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.05967
|
Earth: Atmospheric Evolution of a Habitable Planet
|
Our present-day atmosphere is often used as an analog for potentially
habitable exoplanets, but Earth's atmosphere has changed dramatically
throughout its 4.5 billion year history. For example, molecular oxygen is
abundant in the atmosphere today but was absent on the early Earth. Meanwhile,
the physical and chemical evolution of Earth's atmosphere has also resulted in
major swings in surface temperature, at times resulting in extreme glaciation
or warm greenhouse climates. Despite this dynamic and occasionally dramatic
history, the Earth has been persistently habitable--and, in fact,
inhabited--for roughly 4 billion years. Understanding Earth's momentous changes
and its enduring habitability is essential as a guide to the diversity of
habitable planetary environments that may exist beyond our solar system and for
ultimately recognizing spectroscopic fingerprints of life elsewhere in the
Universe. Here, we review long-term trends in the composition of Earth's
atmosphere as it relates to both planetary habitability and inhabitation. We
focus on gases that may serve as habitability markers (CO2, N2) or
biosignatures (CH4, O2), especially as related to the redox evolution of the
atmosphere and the coupled evolution of Earth's climate system. We emphasize
that in the search for Earth-like planets we must be mindful that the example
provided by the modern atmosphere merely represents a single snapshot of
Earth's long-term evolution. In exploring the many former states of our own
planet, we emphasize Earth's atmospheric evolution during the Archean,
Proterozoic, and Phanerozoic eons, but we conclude with a brief discussion of
potential atmospheric trajectories into the distant future, many millions to
billions of years from now. All of these 'Alternative Earth' scenarios provide
insight to the potential diversity of Earth-like, habitable, and inhabited
worlds.
|
astro-ph.EP
|
our presentday atmosphere is often used as an analog for potentially habitable exoplanets but earths atmosphere has changed dramatically throughout its 45 billion year history for example molecular oxygen is abundant in the atmosphere today but was absent on the early earth meanwhile the physical and chemical evolution of earths atmosphere has also resulted in major swings in surface temperature at times resulting in extreme glaciation or warm greenhouse climates despite this dynamic and occasionally dramatic history the earth has been persistently habitableand in fact inhabitedfor roughly 4 billion years understanding earths momentous changes and its enduring habitability is essential as a guide to the diversity of habitable planetary environments that may exist beyond our solar system and for ultimately recognizing spectroscopic fingerprints of life elsewhere in the universe here we review longterm trends in the composition of earths atmosphere as it relates to both planetary habitability and inhabitation we focus on gases that may serve as habitability markers co2 n2 or biosignatures ch4 o2 especially as related to the redox evolution of the atmosphere and the coupled evolution of earths climate system we emphasize that in the search for earthlike planets we must be mindful that the example provided by the modern atmosphere merely represents a single snapshot of earths longterm evolution in exploring the many former states of our own planet we emphasize earths atmospheric evolution during the archean proterozoic and phanerozoic eons but we conclude with a brief discussion of potential atmospheric trajectories into the distant future many millions to billions of years from now all of these alternative earth scenarios provide insight to the potential diversity of earthlike habitable and inhabited worlds
|
[['our', 'presentday', 'atmosphere', 'is', 'often', 'used', 'as', 'an', 'analog', 'for', 'potentially', 'habitable', 'exoplanets', 'but', 'earths', 'atmosphere', 'has', 'changed', 'dramatically', 'throughout', 'its', '45', 'billion', 'year', 'history', 'for', 'example', 'molecular', 'oxygen', 'is', 'abundant', 'in', 'the', 'atmosphere', 'today', 'but', 'was', 'absent', 'on', 'the', 'early', 'earth', 'meanwhile', 'the', 'physical', 'and', 'chemical', 'evolution', 'of', 'earths', 'atmosphere', 'has', 'also', 'resulted', 'in', 'major', 'swings', 'in', 'surface', 'temperature', 'at', 'times', 'resulting', 'in', 'extreme', 'glaciation', 'or', 'warm', 'greenhouse', 'climates', 'despite', 'this', 'dynamic', 'and', 'occasionally', 'dramatic', 'history', 'the', 'earth', 'has', 'been', 'persistently', 'habitableand', 'in', 'fact', 'inhabitedfor', 'roughly', '4', 'billion', 'years', 'understanding', 'earths', 'momentous', 'changes', 'and', 'its', 'enduring', 'habitability', 'is', 'essential', 'as', 'a', 'guide', 'to', 'the', 'diversity', 'of', 'habitable', 'planetary', 'environments', 'that', 'may', 'exist', 'beyond', 'our', 'solar', 'system', 'and', 'for', 'ultimately', 'recognizing', 'spectroscopic', 'fingerprints', 'of', 'life', 'elsewhere', 'in', 'the', 'universe', 'here', 'we', 'review', 'longterm', 'trends', 'in', 'the', 'composition', 'of', 'earths', 'atmosphere', 'as', 'it', 'relates', 'to', 'both', 'planetary', 'habitability', 'and', 'inhabitation', 'we', 'focus', 'on', 'gases', 'that', 'may', 'serve', 'as', 'habitability', 'markers', 'co2', 'n2', 'or', 'biosignatures', 'ch4', 'o2', 'especially', 'as', 'related', 'to', 'the', 'redox', 'evolution', 'of', 'the', 'atmosphere', 'and', 'the', 'coupled', 'evolution', 'of', 'earths', 'climate', 'system', 'we', 'emphasize', 'that', 'in', 'the', 'search', 'for', 'earthlike', 'planets', 'we', 'must', 'be', 'mindful', 'that', 'the', 'example', 'provided', 'by', 'the', 'modern', 'atmosphere', 'merely', 'represents', 'a', 'single', 'snapshot', 'of', 'earths', 'longterm', 'evolution', 'in', 'exploring', 'the', 'many', 'former', 'states', 'of', 'our', 'own', 'planet', 'we', 'emphasize', 'earths', 'atmospheric', 'evolution', 'during', 'the', 'archean', 'proterozoic', 'and', 'phanerozoic', 'eons', 'but', 'we', 'conclude', 'with', 'a', 'brief', 'discussion', 'of', 'potential', 'atmospheric', 'trajectories', 'into', 'the', 'distant', 'future', 'many', 'millions', 'to', 'billions', 'of', 'years', 'from', 'now', 'all', 'of', 'these', 'alternative', 'earth', 'scenarios', 'provide', 'insight', 'to', 'the', 'potential', 'diversity', 'of', 'earthlike', 'habitable', 'and', 'inhabited', 'worlds']]
|
[-0.08046719368910893, 0.1928550763125043, -0.040590904800928314, 0.09123036095083956, -0.07229051594435489, -0.017125139060199947, 0.06859457473029267, 0.3374093731951961, -0.20993367508570532, -0.3749828776327662, 0.1411920167351937, -0.2822383244069001, -0.16295030703904093, 0.2067045333823291, -0.09302255514342964, 0.0033672100959522447, 0.12149693171942376, 0.006931251884598699, 0.006194507253881421, -0.28893534076760397, 0.22026798394457675, 0.13890239019558703, 0.09836651474351309, 0.05801725214734728, 0.028955357847204193, -0.0846580020237007, -0.032977767182466484, -0.08519026944643213, -0.11947608436755225, 0.06507140562241752, 0.281843048034331, 0.20103491146719069, 0.2521735530441804, -0.4969793864386496, -0.30612389253576483, 0.0936156542631619, 0.14885686946876456, 0.05854154767189855, -0.07149059936339647, -0.22687885156377172, 0.014722333842655644, -0.1809131484986436, -0.170682369828344, -0.0018847584533233223, 0.09028306564853193, -0.05048420718177664, -0.1942295064107875, 0.02705656394035722, 0.05418388359248638, 0.16857019207018842, -0.1549887987836026, -0.16513384569030132, -0.08552951070422266, 0.15454524130064207, 0.04893996122902443, -0.004234869650014452, 0.2200377963834757, -0.09048903079059342, -0.012647598724012233, 0.45786528465130716, -0.12992417579261845, -0.032158534188693674, 0.2877961161948339, -0.21692491420264268, -0.13574886276305104, 0.11819374993066202, 0.18182867034134476, 0.10233149412054106, -0.17305489238283603, 0.021618218256762238, 0.0006508395334121085, 0.13500114894738882, 0.09107159976133683, 0.05574431238070565, 0.3979831998369038, 0.22021823499545481, 0.08723541938684487, 0.02160496172711022, -0.13672959931720777, -0.10486410256903482, -0.15342911244472013, -0.20383889155260995, -0.11458179222999386, 0.05676844885724046, -0.05991741961478358, -0.14994104658967278, 0.39472813085533076, 0.20920621215393018, 0.10838278251518257, -0.05107523167988517, 0.290948883863166, 0.01689379442828184, 0.047674234235917566, 0.057503620620619804, 0.3004915738779113, 0.07064057147405688, 0.15487786369095727, -0.21680587957622519, 0.17743493089228052, -0.023686987273123142]
|
1,803.05968
|
A new gamma-ray source unveiled by AGILE in the region of Orion
|
Diffuse galactic gamma-ray emission is produced by the interaction of cosmic
rays (CRs) with the interstellar environment. The study of gamma-ray emission
is therefore a powerful tool to investigate the origin of CRs and the processes
through which they are accelerated. We aim to gain deeper insights of the
nature of gamma-ray emission in the region of Orion, which is one of the best
studied sites of on-going star formation, by analysing data from the AGILE
satellite. The diffuse gamma-ray emission expected from the Orion region is
relatively high. Its separation from the galactic plane also ensures a very low
contribution from foreground or background emission, which makes it an ideal
site for studying the processes of particle acceleration in star forming
environments. The AGILE data are modelled through a template that quantifies
the gamma-ray diffuse emission expected from atomic and molecular hydrogen.
Other sources of emission are modelled as an isotropic contribution. Gamma-ray
emission exceeding the amount expected by the diffuse emission model is
detected with high level of significance. The main excess is in the
high-longitude part of Orion A. A thorough analysis of this feature suggests a
connection between the observed gamma-ray emission and the B0.5 Ia star k
Orionis. The location of the gamma-ray excess is compatible with the site where
stellar wind collides with the ISM. Both scattering on dark gas and cosmic-ray
acceleration at the shock between the two environments are discussed as
possible explanations, with the latter hypothesis being supported by the
hardness of the energy spectrum of the emission. If confirmed, this would be
the first direct detection of gamma-ray emission from the interaction between
ISM and a single star's stellar wind.
|
astro-ph.HE
|
diffuse galactic gammaray emission is produced by the interaction of cosmic rays crs with the interstellar environment the study of gammaray emission is therefore a powerful tool to investigate the origin of crs and the processes through which they are accelerated we aim to gain deeper insights of the nature of gammaray emission in the region of orion which is one of the best studied sites of ongoing star formation by analysing data from the agile satellite the diffuse gammaray emission expected from the orion region is relatively high its separation from the galactic plane also ensures a very low contribution from foreground or background emission which makes it an ideal site for studying the processes of particle acceleration in star forming environments the agile data are modelled through a template that quantifies the gammaray diffuse emission expected from atomic and molecular hydrogen other sources of emission are modelled as an isotropic contribution gammaray emission exceeding the amount expected by the diffuse emission model is detected with high level of significance the main excess is in the highlongitude part of orion a a thorough analysis of this feature suggests a connection between the observed gammaray emission and the b05 ia star k orionis the location of the gammaray excess is compatible with the site where stellar wind collides with the ism both scattering on dark gas and cosmicray acceleration at the shock between the two environments are discussed as possible explanations with the latter hypothesis being supported by the hardness of the energy spectrum of the emission if confirmed this would be the first direct detection of gammaray emission from the interaction between ism and a single stars stellar wind
|
[['diffuse', 'galactic', 'gammaray', 'emission', 'is', 'produced', 'by', 'the', 'interaction', 'of', 'cosmic', 'rays', 'crs', 'with', 'the', 'interstellar', 'environment', 'the', 'study', 'of', 'gammaray', 'emission', 'is', 'therefore', 'a', 'powerful', 'tool', 'to', 'investigate', 'the', 'origin', 'of', 'crs', 'and', 'the', 'processes', 'through', 'which', 'they', 'are', 'accelerated', 'we', 'aim', 'to', 'gain', 'deeper', 'insights', 'of', 'the', 'nature', 'of', 'gammaray', 'emission', 'in', 'the', 'region', 'of', 'orion', 'which', 'is', 'one', 'of', 'the', 'best', 'studied', 'sites', 'of', 'ongoing', 'star', 'formation', 'by', 'analysing', 'data', 'from', 'the', 'agile', 'satellite', 'the', 'diffuse', 'gammaray', 'emission', 'expected', 'from', 'the', 'orion', 'region', 'is', 'relatively', 'high', 'its', 'separation', 'from', 'the', 'galactic', 'plane', 'also', 'ensures', 'a', 'very', 'low', 'contribution', 'from', 'foreground', 'or', 'background', 'emission', 'which', 'makes', 'it', 'an', 'ideal', 'site', 'for', 'studying', 'the', 'processes', 'of', 'particle', 'acceleration', 'in', 'star', 'forming', 'environments', 'the', 'agile', 'data', 'are', 'modelled', 'through', 'a', 'template', 'that', 'quantifies', 'the', 'gammaray', 'diffuse', 'emission', 'expected', 'from', 'atomic', 'and', 'molecular', 'hydrogen', 'other', 'sources', 'of', 'emission', 'are', 'modelled', 'as', 'an', 'isotropic', 'contribution', 'gammaray', 'emission', 'exceeding', 'the', 'amount', 'expected', 'by', 'the', 'diffuse', 'emission', 'model', 'is', 'detected', 'with', 'high', 'level', 'of', 'significance', 'the', 'main', 'excess', 'is', 'in', 'the', 'highlongitude', 'part', 'of', 'orion', 'a', 'a', 'thorough', 'analysis', 'of', 'this', 'feature', 'suggests', 'a', 'connection', 'between', 'the', 'observed', 'gammaray', 'emission', 'and', 'the', 'b05', 'ia', 'star', 'k', 'orionis', 'the', 'location', 'of', 'the', 'gammaray', 'excess', 'is', 'compatible', 'with', 'the', 'site', 'where', 'stellar', 'wind', 'collides', 'with', 'the', 'ism', 'both', 'scattering', 'on', 'dark', 'gas', 'and', 'cosmicray', 'acceleration', 'at', 'the', 'shock', 'between', 'the', 'two', 'environments', 'are', 'discussed', 'as', 'possible', 'explanations', 'with', 'the', 'latter', 'hypothesis', 'being', 'supported', 'by', 'the', 'hardness', 'of', 'the', 'energy', 'spectrum', 'of', 'the', 'emission', 'if', 'confirmed', 'this', 'would', 'be', 'the', 'first', 'direct', 'detection', 'of', 'gammaray', 'emission', 'from', 'the', 'interaction', 'between', 'ism', 'and', 'a', 'single', 'stars', 'stellar', 'wind']]
|
[-0.06150641015119618, 0.12549260263507936, -0.051331346245881704, 0.1359606367203274, -0.08787574254175914, -0.044627956337561565, 0.034402649902871674, 0.4306262541296227, -0.2435585334996826, -0.3215772510772305, 0.0044686939392704515, -0.315140451030207, -0.010345074260008654, 0.19872809583071752, 0.052564557721364376, -0.07189991748652703, 0.047475716446725914, -0.05898319781658107, 0.022433248040657158, -0.16996173931152692, 0.31122231322307403, 0.185120224498678, 0.19300984538858756, 0.05764482916648766, 0.06442890135450788, -0.10428984112222679, -0.0738731490558296, -0.06764541098548632, -0.06550368176096007, 0.09978709143340114, 0.21847426565072964, 0.1480217764736153, 0.16728928480713096, -0.3789197641557881, -0.2810812014329713, 0.09838477858242446, 0.16501125166583475, -0.00127579911038213, -0.08257296880349584, -0.3090782911071853, 0.02262617218574243, -0.17178215943775804, -0.16632167525323374, 0.1142570899400328, 0.011129340126977435, 0.05501727438282355, -0.1973317921315486, 0.08865867922462972, 0.023948473382915836, 0.06569167656957038, -0.11723081030608487, -0.04843276617133857, -0.02933125011955521, 0.06925453376149693, 0.06535470994422213, 0.08061757488269775, 0.19349148939363658, -0.15688973695838027, -0.06777253409215649, 0.454013704508543, -0.0711145828053954, -0.020872304786462337, 0.24718055003156353, -0.22010995765948402, -0.17585613709608358, 0.23576282975929125, 0.1272792393441445, 0.07552098978277562, -0.18879012201380516, 0.025617341391106104, 0.004229511733033827, 0.16551313524375602, 0.014185505297999564, 0.047339576605424684, 0.312744028952771, 0.16823133185638914, 0.04362235929750438, 0.1537423730210451, -0.2527606297858126, -0.03142344559621831, -0.28736892395952185, -0.10805959918590295, -0.17451595160569663, 0.0939525538406867, -0.08882519738986698, -0.10850483040870001, 0.34483938534311687, 0.08536178740905598, 0.2002851874143484, -0.008689571394435396, 0.34579760333456633, 0.08325523991412151, 0.036106767181939045, 0.12173454890227212, 0.3279362312168814, 0.14829044815352452, 0.07768263420688787, -0.2222970420394891, 0.1225267591233465, -0.026417077540307737]
|
1,803.05969
|
A Novel Approach in Calculating Stakeholder priority in Requirements
Elicitation
|
The ultimate goal of any software developer seeking a competitive edge is to
meet stakeholders needs and expectations. To achieve this, it is necessary to
effectively and accurately manage stakeholders system requirements. The paper
proposes a systematic way of classifying stakeholders and then describes a
novel method for calculating stakeholder priority taking into consideration the
fact that different stakeholders will have different importance level and
different requirement preference. Finally the requirement preference
calculation is done where stakeholders choose the best requirements based on
two factors, value and urgency of the requirement. The proposed method actively
involves stakeholders in the requirement elicitation process.
|
cs.SE
|
the ultimate goal of any software developer seeking a competitive edge is to meet stakeholders needs and expectations to achieve this it is necessary to effectively and accurately manage stakeholders system requirements the paper proposes a systematic way of classifying stakeholders and then describes a novel method for calculating stakeholder priority taking into consideration the fact that different stakeholders will have different importance level and different requirement preference finally the requirement preference calculation is done where stakeholders choose the best requirements based on two factors value and urgency of the requirement the proposed method actively involves stakeholders in the requirement elicitation process
|
[['the', 'ultimate', 'goal', 'of', 'any', 'software', 'developer', 'seeking', 'a', 'competitive', 'edge', 'is', 'to', 'meet', 'stakeholders', 'needs', 'and', 'expectations', 'to', 'achieve', 'this', 'it', 'is', 'necessary', 'to', 'effectively', 'and', 'accurately', 'manage', 'stakeholders', 'system', 'requirements', 'the', 'paper', 'proposes', 'a', 'systematic', 'way', 'of', 'classifying', 'stakeholders', 'and', 'then', 'describes', 'a', 'novel', 'method', 'for', 'calculating', 'stakeholder', 'priority', 'taking', 'into', 'consideration', 'the', 'fact', 'that', 'different', 'stakeholders', 'will', 'have', 'different', 'importance', 'level', 'and', 'different', 'requirement', 'preference', 'finally', 'the', 'requirement', 'preference', 'calculation', 'is', 'done', 'where', 'stakeholders', 'choose', 'the', 'best', 'requirements', 'based', 'on', 'two', 'factors', 'value', 'and', 'urgency', 'of', 'the', 'requirement', 'the', 'proposed', 'method', 'actively', 'involves', 'stakeholders', 'in', 'the', 'requirement', 'elicitation', 'process']]
|
[-0.11396645276131583, 0.06595373966082857, -0.06988746750478943, 0.04884231735232949, -0.17186808457378955, -0.16345979396582527, 0.1410548438594275, 0.37840554282507477, -0.22742439518390478, -0.38336703498099073, 0.05810653691650277, -0.24064528826349096, -0.12376233462390362, 0.1198368895908489, -0.11206870570358839, 0.07328399891654651, 0.0576702581316817, 0.008055198567864649, -0.008575031321550556, -0.30093907586791935, 0.3573195565555829, 0.06960435019915595, 0.3859280446799947, 0.10655729035965587, 0.07981418136178571, -0.012448188001929107, -0.04533242719594901, -0.023281243005447892, -0.10449625530735847, 0.1684320441369588, 0.37585383083890467, 0.25431597796633987, 0.37672109492397043, -0.4078725172645029, -0.12765500770982208, 0.08636613197478593, 0.11624901535961886, 0.015180989661637475, -0.001298052538414577, -0.270216999125813, 0.10019268209169455, -0.2254220483500474, -0.11213533214165591, -0.08584286189893735, -0.029027310400909067, -0.007335589942978877, -0.3263467647644289, -0.08469082291840631, 0.03139907633885741, 0.025306438378916652, -0.07791499805399309, -0.10639812252781007, 0.006723579048982584, 0.25868062093379157, 0.08969516176747515, 0.008243375413596868, 0.1435827520657696, -0.12578123287462137, -0.11026628794349438, 0.44563617053277355, 0.06413533755831476, -0.21475701993924803, 0.15176411804186143, -0.06721058875258427, -0.18711294122405497, 0.06485182283772613, 0.1793918126153157, 0.031371791157974206, -0.23014809413100867, 0.04447227469177497, 0.08833297765722462, 0.17566136037017785, 0.019791116860384744, -0.002828466427494206, 0.225233691634939, 0.2173324086493356, 0.11319673594826941, 0.08871892881671004, 0.024378182555950593, -0.09009431579661574, -0.2736876466558041, -0.1918144220276279, -0.13281579907326138, -0.019509378932507745, -0.07404947076229648, -0.061326902122328095, 0.40649128451888616, 0.23589652033486203, 0.09392310793091561, 0.050536599934703726, 0.3918090541116601, 0.10151014141007966, 0.06591297042391756, 0.058383962664497545, 0.18565506525976838, -0.037327589201238735, 0.11849677284686443, -0.1665631835862501, 0.1604484033396504, 0.02508125514449442]
|
1,803.0597
|
Computing the Planar $\beta$-skeleton Depth
|
For $\beta \geq 1$, the \emph{$\beta$-skeleton depth} ($\SkD_\beta$) of a
query point $q\in \mathbb{R}^d$ with respect to a distribution function $F$ on
$\mathbb{R}^d$ is defined as the probability that $q$ is contained within the
\emph{$\beta$-skeleton influence region} of a random pair of points from $F$.
The $\beta$-skeleton depth of $q\in \mathbb{R}^d$ can also be defined with
respect to a given data set $S\subseteq \mathbb{R}^d$. In this case, computing
the $\beta$-skeleton depth is based on counting all of the $\beta$-skeleton
influence regions, obtained from pairs of points in $S$, that contain $q$. The
$\beta$-skeleton depth introduces a family of depth functions that contains
\emph{spherical depth} and \emph{lens depth} for $\beta=1$ and $\beta=2$,
respectively. The straightforward algorithm for computing the $\beta$-skeleton
depth in dimension $d$ takes $O(dn^2)$. This complexity of computation is a
significant advantage of using the $\beta$-skeleton depth in multivariate data
analysis because unlike most other data depths, the time complexity of the
$\beta$-skeleton depth grows linearly rather than exponentially in the
dimension $d$. The main results of this paper include two algorithms. The first
one is an optimal algorithm that takes $\Theta(n\log n)$ for computing the
planar spherical depth, and the second algorithm with the time complexity of
$O(n^{\frac{3}{2}+\epsilon})$ is for computing the planar $\beta$-skeleton
depth, $\beta >1$. By reducing the problem of \textit{Element Uniqueness}, we
prove that computing the $\beta$-skeleton depth requires $\Omega(n \log n)$
time. Some geometric properties of $\beta$-skeleton depth are also investigated
in this paper. These properties indicate that \emph{simplicial depth} ($\SD$)
is linearly bounded by $\beta$-skeleton depth. Some experimental bounds for
different depth functions are also obtained in this paper.
|
cs.CG
|
for beta geq 1 the emphbetaskeleton depth skd_beta of a query point qin mathbbrd with respect to a distribution function f on mathbbrd is defined as the probability that q is contained within the emphbetaskeleton influence region of a random pair of points from f the betaskeleton depth of qin mathbbrd can also be defined with respect to a given data set ssubseteq mathbbrd in this case computing the betaskeleton depth is based on counting all of the betaskeleton influence regions obtained from pairs of points in s that contain q the betaskeleton depth introduces a family of depth functions that contains emphspherical depth and emphlens depth for beta1 and beta2 respectively the straightforward algorithm for computing the betaskeleton depth in dimension d takes odn2 this complexity of computation is a significant advantage of using the betaskeleton depth in multivariate data analysis because unlike most other data depths the time complexity of the betaskeleton depth grows linearly rather than exponentially in the dimension d the main results of this paper include two algorithms the first one is an optimal algorithm that takes thetanlog n for computing the planar spherical depth and the second algorithm with the time complexity of onfrac32epsilon is for computing the planar betaskeleton depth beta 1 by reducing the problem of textitelement uniqueness we prove that computing the betaskeleton depth requires omegan log n time some geometric properties of betaskeleton depth are also investigated in this paper these properties indicate that emphsimplicial depth sd is linearly bounded by betaskeleton depth some experimental bounds for different depth functions are also obtained in this paper
|
[['for', 'beta', 'geq', '1', 'the', 'emphbetaskeleton', 'depth', 'skd_beta', 'of', 'a', 'query', 'point', 'qin', 'mathbbrd', 'with', 'respect', 'to', 'a', 'distribution', 'function', 'f', 'on', 'mathbbrd', 'is', 'defined', 'as', 'the', 'probability', 'that', 'q', 'is', 'contained', 'within', 'the', 'emphbetaskeleton', 'influence', 'region', 'of', 'a', 'random', 'pair', 'of', 'points', 'from', 'f', 'the', 'betaskeleton', 'depth', 'of', 'qin', 'mathbbrd', 'can', 'also', 'be', 'defined', 'with', 'respect', 'to', 'a', 'given', 'data', 'set', 'ssubseteq', 'mathbbrd', 'in', 'this', 'case', 'computing', 'the', 'betaskeleton', 'depth', 'is', 'based', 'on', 'counting', 'all', 'of', 'the', 'betaskeleton', 'influence', 'regions', 'obtained', 'from', 'pairs', 'of', 'points', 'in', 's', 'that', 'contain', 'q', 'the', 'betaskeleton', 'depth', 'introduces', 'a', 'family', 'of', 'depth', 'functions', 'that', 'contains', 'emphspherical', 'depth', 'and', 'emphlens', 'depth', 'for', 'beta1', 'and', 'beta2', 'respectively', 'the', 'straightforward', 'algorithm', 'for', 'computing', 'the', 'betaskeleton', 'depth', 'in', 'dimension', 'd', 'takes', 'odn2', 'this', 'complexity', 'of', 'computation', 'is', 'a', 'significant', 'advantage', 'of', 'using', 'the', 'betaskeleton', 'depth', 'in', 'multivariate', 'data', 'analysis', 'because', 'unlike', 'most', 'other', 'data', 'depths', 'the', 'time', 'complexity', 'of', 'the', 'betaskeleton', 'depth', 'grows', 'linearly', 'rather', 'than', 'exponentially', 'in', 'the', 'dimension', 'd', 'the', 'main', 'results', 'of', 'this', 'paper', 'include', 'two', 'algorithms', 'the', 'first', 'one', 'is', 'an', 'optimal', 'algorithm', 'that', 'takes', 'thetanlog', 'n', 'for', 'computing', 'the', 'planar', 'spherical', 'depth', 'and', 'the', 'second', 'algorithm', 'with', 'the', 'time', 'complexity', 'of', 'onfrac32epsilon', 'is', 'for', 'computing', 'the', 'planar', 'betaskeleton', 'depth', 'beta', '1', 'by', 'reducing', 'the', 'problem', 'of', 'textitelement', 'uniqueness', 'we', 'prove', 'that', 'computing', 'the', 'betaskeleton', 'depth', 'requires', 'omegan', 'log', 'n', 'time', 'some', 'geometric', 'properties', 'of', 'betaskeleton', 'depth', 'are', 'also', 'investigated', 'in', 'this', 'paper', 'these', 'properties', 'indicate', 'that', 'emphsimplicial', 'depth', 'sd', 'is', 'linearly', 'bounded', 'by', 'betaskeleton', 'depth', 'some', 'experimental', 'bounds', 'for', 'different', 'depth', 'functions', 'are', 'also', 'obtained', 'in', 'this', 'paper']]
|
[-0.11845942786254898, 0.10291260313128259, -0.028339351289230222, -0.010704716746624246, 0.0018914018958479963, -0.1435696120935542, 0.04908688011435251, 0.36470988627082407, -0.2931235003989823, -0.2611286315612872, 0.06559579302992259, -0.3063941304607473, -0.13421488967581957, 0.20481552294178204, -0.07145500929074412, 0.09213339979982516, 0.028713748892631473, 0.07615010136336742, -0.05700312133297281, -0.29048828360845, 0.30307639087861377, -0.012796224621017926, 0.2202871483972808, 0.044059146871481034, 0.07127372831113295, 0.020258268590248724, -0.025158572223975915, 0.05800620864060146, -0.1613282905606609, 0.1290873043280884, 0.2127826520204473, 0.17696537856698633, 0.2425000943662954, -0.3829130183421928, -0.17814172238630477, 0.15774527641159006, 0.15747228964366985, 0.015381456796214952, 0.012710407946813312, -0.23233325022560694, 0.09787899234957766, -0.052595476733648595, -0.1293308490428288, 0.01580591009128199, 0.13992108165051872, 0.028301090428619894, -0.3204791365504151, 0.029186649506272686, 0.0997903936165776, 0.07168841872893927, -0.017134077584847297, -0.17130250447671433, 0.012480189487025256, 0.0964226744711783, -0.050040369836492675, 0.11085791944726975, 0.06592245032932638, -0.14980873387857457, -0.08252440067807938, 0.3396392587849156, -0.03646804563967086, -0.20377295490937264, 0.11533445416761293, -0.1471899944474878, -0.12867203335995778, 0.15309636928994236, 0.16019540137605998, 0.14212518021507003, -0.06965834330518567, 0.1936410250889141, -0.09096088442411132, 0.18932022849501748, 0.11337693711078037, 0.029082049462386187, 0.08156347402570527, 0.1533636416091747, 0.12274779158273137, 0.162000860472144, -0.12975459613567147, -0.03169398944443252, -0.32399601539070827, -0.1375928606939296, -0.23945232476543224, 0.012822875438901446, -0.18253248313137282, -0.1734397786928035, 0.3540339455477723, 0.1564300756471388, 0.25569952473236346, 0.14879663017105652, 0.30490976486369287, 0.1395975431385259, 0.029185984145053696, 0.12493310772053158, 0.12118923762757225, 0.06716128249158586, 0.03433083034589716, -0.16306701899767864, 0.08452703745883844, 0.11320210299524612]
|
1,803.05971
|
Orbital migration and Resonance Offset of the Kepler-25 and K2-24
systems
|
Based on the model described in Ramos et al., 2017, we present an
analytical+numerical study of the resonance capture under Type-I migration for
the Kepler-25 (Marcy et al., 2014) and K2-24 (Petigura et al., 2016) Kepler
systems, both close to a 2/1 mean-motion resonance. We find that, depending on
the flare index and the proximity to the central star, the average value of the
period-ratio between two consecutive planets show a significant deviation with
respect to the resonant nominal value, up to values well in agreement with the
observations.
|
astro-ph.EP
|
based on the model described in ramos et al 2017 we present an analyticalnumerical study of the resonance capture under typei migration for the kepler25 marcy et al 2014 and k224 petigura et al 2016 kepler systems both close to a 21 meanmotion resonance we find that depending on the flare index and the proximity to the central star the average value of the periodratio between two consecutive planets show a significant deviation with respect to the resonant nominal value up to values well in agreement with the observations
|
[['based', 'on', 'the', 'model', 'described', 'in', 'ramos', 'et', 'al', '2017', 'we', 'present', 'an', 'analyticalnumerical', 'study', 'of', 'the', 'resonance', 'capture', 'under', 'typei', 'migration', 'for', 'the', 'kepler25', 'marcy', 'et', 'al', '2014', 'and', 'k224', 'petigura', 'et', 'al', '2016', 'kepler', 'systems', 'both', 'close', 'to', 'a', '21', 'meanmotion', 'resonance', 'we', 'find', 'that', 'depending', 'on', 'the', 'flare', 'index', 'and', 'the', 'proximity', 'to', 'the', 'central', 'star', 'the', 'average', 'value', 'of', 'the', 'periodratio', 'between', 'two', 'consecutive', 'planets', 'show', 'a', 'significant', 'deviation', 'with', 'respect', 'to', 'the', 'resonant', 'nominal', 'value', 'up', 'to', 'values', 'well', 'in', 'agreement', 'with', 'the', 'observations']]
|
[-0.07528112813915042, 0.05220062182359635, -0.022161886873866686, 0.00419156094589694, -0.05114306669301269, -0.04698968197176741, 0.0914590046397114, 0.3299633553463288, -0.16108766112434256, -0.4283966419309515, 0.03494597747869028, -0.30530487949197943, -0.1438473780448972, 0.19677612799039873, -0.12467328808270395, 0.0443070896794366, 0.07124648458028043, -0.02620723832991313, -0.03950080122376676, -0.26040439413521776, 0.25865269802637736, 0.11896783196127879, 0.20018070039805025, -0.010254004560754931, 0.03384750740422698, 0.005722188126211139, 0.006373954111371528, -0.019505030920051715, -0.20939397765629442, 0.07016066464976492, 0.15113506238611246, 0.048664671845141456, 0.21112369938981085, -0.34631829971278255, -0.17082406633364206, 0.062278002746593716, 0.06657411466056312, 0.047721852533868514, -0.01668753671533936, -0.32479353566569363, 0.06283311452187429, -0.17885289716386152, -0.09887062233280051, 0.016015955569772897, 0.12130439529110762, 0.01154901195844683, -0.3378860053437, 0.11665498781737617, 0.07393828074352561, 0.08240600556812504, -0.09811545660803941, -0.1225494332690935, -0.04304752356256358, 0.05842980348229916, -0.004571906726182947, 0.026622031958223404, 0.07057922673993744, -0.04007635223255916, -0.14303563049444082, 0.3302831481996691, -0.09688490533021236, -0.04197284724796191, 0.23791856951852838, -0.1906318941301751, -0.1280425309457562, 0.08404351604986005, 0.1815499593186277, 0.10200770615351344, -0.11682770059930837, 0.06351427748061476, -0.0646518984365023, 0.19579795125702565, 0.12006673661843789, -0.04062161615870123, 0.24335715653036127, 0.10631179782318544, 0.01641213589093902, 0.058216329558159814, -0.16426163136334668, -0.12113931418901881, -0.2380819273900918, -0.1124107456416823, -0.15694388645616444, -0.00949813118627803, -0.02509148269448567, -0.12141008239070122, 0.36047338447745214, 0.1570970789021389, 0.294241008750925, 0.0058763464806940065, 0.18875129749490457, 0.14136359084990213, 0.018519684312526475, 0.15719364690382712, 0.36349347173447977, 0.13193785375915468, 0.11353592315307734, -0.2811141201527789, 0.02407852828566154, 0.024242654076343486]
|
1,803.05972
|
Biomaterials: A trendy source to engineer functional entities -- An
overview
|
The biomaterials exploitation in a sophisticated manner can provide extensive
opportunities for experimentation in the field of interdisciplinary and
multidisciplinary scientific research. Owing to the unique features of this
trendy area, research scientists have been directed/redirected their interests
in bio-based biomaterials for targeted applications in different sectors of the
modern world. The present manuscript highlights the novel perspectives of
biomaterials as a trendy source to engineer functional entities in numerous
geometries for pharmaceuticals, cosmeceuticals, nutraceuticals, and other
biotechnological or biomedical applications.
|
physics.app-ph cond-mat.mtrl-sci physics.bio-ph
|
the biomaterials exploitation in a sophisticated manner can provide extensive opportunities for experimentation in the field of interdisciplinary and multidisciplinary scientific research owing to the unique features of this trendy area research scientists have been directedredirected their interests in biobased biomaterials for targeted applications in different sectors of the modern world the present manuscript highlights the novel perspectives of biomaterials as a trendy source to engineer functional entities in numerous geometries for pharmaceuticals cosmeceuticals nutraceuticals and other biotechnological or biomedical applications
|
[['the', 'biomaterials', 'exploitation', 'in', 'a', 'sophisticated', 'manner', 'can', 'provide', 'extensive', 'opportunities', 'for', 'experimentation', 'in', 'the', 'field', 'of', 'interdisciplinary', 'and', 'multidisciplinary', 'scientific', 'research', 'owing', 'to', 'the', 'unique', 'features', 'of', 'this', 'trendy', 'area', 'research', 'scientists', 'have', 'been', 'directedredirected', 'their', 'interests', 'in', 'biobased', 'biomaterials', 'for', 'targeted', 'applications', 'in', 'different', 'sectors', 'of', 'the', 'modern', 'world', 'the', 'present', 'manuscript', 'highlights', 'the', 'novel', 'perspectives', 'of', 'biomaterials', 'as', 'a', 'trendy', 'source', 'to', 'engineer', 'functional', 'entities', 'in', 'numerous', 'geometries', 'for', 'pharmaceuticals', 'cosmeceuticals', 'nutraceuticals', 'and', 'other', 'biotechnological', 'or', 'biomedical', 'applications']]
|
[-0.07095644847513774, 0.06729483583386844, -0.05914201216551308, 0.030356260235958662, -0.16122330307291868, -0.12041474451334813, -0.0007555511338301959, 0.4067793280268327, -0.25763829590421383, -0.35790082420676184, 0.09965741539818761, -0.30031519655424815, -0.21761789358256814, 0.25780385960556135, -0.0868188215013689, 0.05776160956921581, 0.04965454451545762, -0.02973448860762008, 0.012462682735461455, -0.2115307871538859, 0.2304859396446353, 0.059197547090335347, 0.3802097363349719, 0.1425849363545123, 0.027030112596082453, -0.03282293635539901, -0.08522589795495897, -0.011507646837391151, -0.10737784875509067, 0.25102502298063767, 0.4265393297790956, 0.19763373152743904, 0.4083079646031062, -0.48098749352189213, -0.2940664147385038, 0.0438153944694652, 0.13546241065248465, 0.08593384362757206, -0.15857394435442984, -0.31886700497796905, 0.00022535240994049952, -0.1661141665521054, -0.13079700384360665, -0.152314278547867, 0.05446167457744312, 0.037598783610006556, -0.17980490478042227, -0.030410556827122584, -0.03291504855196063, 0.1622835262509724, -0.015255458742523422, -0.1396445764724213, 0.06260279172028486, 0.22290242895877993, 0.0948107764363671, -0.0010952437953211558, 0.17485013728340468, -0.23397853246663147, -0.16975459308387378, 0.41025691725409186, 0.05683467078667421, -0.12285796066937156, 0.25961164726565283, -0.04845790482030656, -0.20321466006004277, 0.05699183230395787, 0.24951203057590204, 0.09634518506339727, -0.22092181034624958, 0.09747006675938909, 0.05222400320837131, 0.07693327915592071, 0.05009278632515373, 0.07873072365346627, 0.29656513257083505, 0.23939335308013818, 0.02689126378390938, 0.12481446676956227, -0.01158150692936033, -0.09809721416483323, -0.19016754653495857, -0.22198911278675765, -0.1256040755348901, 0.020310552528080266, 0.007397151456993574, -0.18045336620595592, 0.41926477918735683, 0.16750394029375643, 0.0794545167292922, -0.09285959877217045, 0.270739615154572, -0.09196158884337936, 0.12515330754327947, -0.012381442338944627, 0.21211833203545746, 0.03650792923648483, 0.23832291652424595, -0.09982751031221153, 0.05940972442905872, -0.09069985225319098]
|
1,803.05973
|
Tunable high-resolution macroscopic self-engineered geometric phase
optical elements
|
Artificially engineered geometric phase optical elements may have tunable
photonic functionalities owing to sensitivity to external fields, as is the
case for liquid crystals based devices. However, a liquid crystal technology
combining high-resolution topological ordering with tunable spectral behavior
remains elusive. Here, by using a magneto-electric external stimulus, we create
robust and efficient self-engineered liquid crystal geometric phase vortex
masks with broadly tunable operating wavelength, centimeter-size clear
aperture, and high-quality topological ordering.
|
physics.optics
|
artificially engineered geometric phase optical elements may have tunable photonic functionalities owing to sensitivity to external fields as is the case for liquid crystals based devices however a liquid crystal technology combining highresolution topological ordering with tunable spectral behavior remains elusive here by using a magnetoelectric external stimulus we create robust and efficient selfengineered liquid crystal geometric phase vortex masks with broadly tunable operating wavelength centimetersize clear aperture and highquality topological ordering
|
[['artificially', 'engineered', 'geometric', 'phase', 'optical', 'elements', 'may', 'have', 'tunable', 'photonic', 'functionalities', 'owing', 'to', 'sensitivity', 'to', 'external', 'fields', 'as', 'is', 'the', 'case', 'for', 'liquid', 'crystals', 'based', 'devices', 'however', 'a', 'liquid', 'crystal', 'technology', 'combining', 'highresolution', 'topological', 'ordering', 'with', 'tunable', 'spectral', 'behavior', 'remains', 'elusive', 'here', 'by', 'using', 'a', 'magnetoelectric', 'external', 'stimulus', 'we', 'create', 'robust', 'and', 'efficient', 'selfengineered', 'liquid', 'crystal', 'geometric', 'phase', 'vortex', 'masks', 'with', 'broadly', 'tunable', 'operating', 'wavelength', 'centimetersize', 'clear', 'aperture', 'and', 'highquality', 'topological', 'ordering']]
|
[-0.17038515942921448, 0.27184493236644713, -0.07015898702148762, -0.04798063451825227, -0.16231718039812726, -0.24714381564667243, 0.0890946271441256, 0.5408253074727125, -0.24288795977958622, -0.33664380170456654, 0.06316902827368015, -0.25348877999931574, -0.16879898915067315, 0.18817565033936667, -0.010062038853195392, 0.09477184731117126, -0.0643338341679838, -0.1604825323447585, -0.09451679781907135, -0.10482754750410095, 0.22162746953027737, 0.03513196684717615, 0.38473305488393333, 0.004281344593942372, 0.13169494892160097, -0.020061066759000015, 0.08152466893403067, 0.03485063034006291, -0.1364394957005667, 0.05931169365067035, 0.3052144482984052, -0.12094888763709201, 0.15317303066452345, -0.453628465714347, -0.2579899459378794, 0.04430120409880248, 0.1330170959441198, 0.1509243499345353, -0.15781110474684587, -0.29620473786296014, 0.05025485050605817, -0.12851736679052314, -0.15204480430414455, -0.1739124103009494, -0.018164622953109857, 0.010295476053417789, -0.21613075937299678, -0.015148168960068788, 0.023779349377340015, 0.15376056347981326, -0.05670401152524897, -0.05585006810724735, -0.035968395538576364, 0.025654437725380477, -0.1018391603041285, 0.03944936928585068, 0.2130875645735715, -0.147707115043886, -0.12012098584091291, 0.37304500850667766, -0.01714528766590067, -0.09807790111517534, 0.1777351310593076, -0.10507422541397521, -0.0025157729267246192, 0.1910986775635845, 0.14142524013651483, 0.04728152047027834, -0.10923570754109985, 0.004295307973128122, 0.021936354958193585, 0.2688150487633215, 0.0702244281096177, 0.17106234312005755, 0.3381169652307613, 0.2308598411683407, 0.043699326836051315, 0.18237140062653148, -0.11536711480746614, -0.002961939963926044, -0.15872824402888203, -0.14239904430966513, -0.23996114043984562, 0.043245049620357655, -0.07283070256582708, -0.2127387554824559, 0.38074095820128506, 0.15028578623282052, 0.08756888741522238, -0.07418287912150845, 0.28223654503623646, 0.025663376473757025, 0.10863962400536467, -0.0755281071501991, 0.2697748572099954, 0.15778268933516099, 0.15715286609095833, -0.22183666737853652, 0.054942256279496685, -0.022498299199570384]
|
1,803.05974
|
Robustness of optimal transport in disordered interacting many-body
networks
|
The robustness of quantum transport under various perturbations is analyzed
in disordered interacting many-body systems, which are constructed from the
embedded Gaussian random matrix ensembles (EGEs). The transport efficiency can
be enhanced drastically, if centrosymmetry (csEGE) is imposed. When the csEGE
is perturbed with an ordinary EGE, the transport efficiency in the optimal
cases is reduced significantly, while in the suboptimal cases the changes are
less pronounced. Qualitatively the same behavior is observed, when parity and
centrosymmetry are broken by block perturbations. Analyzing the influence of
the environment coupling, optimal transport is observed at a certain coupling
strength, while too weak and too strong coupling reduce the transport. Taking
into account the effects of decoherence, in the EGE the transport efficiency
approaches its maximum at a finite nonzero decoherence strength
(environment-assisted transport). In the csEGE the efficiency decays
monotonically with the decoherence but is always larger than in the EGE.
|
quant-ph
|
the robustness of quantum transport under various perturbations is analyzed in disordered interacting manybody systems which are constructed from the embedded gaussian random matrix ensembles eges the transport efficiency can be enhanced drastically if centrosymmetry csege is imposed when the csege is perturbed with an ordinary ege the transport efficiency in the optimal cases is reduced significantly while in the suboptimal cases the changes are less pronounced qualitatively the same behavior is observed when parity and centrosymmetry are broken by block perturbations analyzing the influence of the environment coupling optimal transport is observed at a certain coupling strength while too weak and too strong coupling reduce the transport taking into account the effects of decoherence in the ege the transport efficiency approaches its maximum at a finite nonzero decoherence strength environmentassisted transport in the csege the efficiency decays monotonically with the decoherence but is always larger than in the ege
|
[['the', 'robustness', 'of', 'quantum', 'transport', 'under', 'various', 'perturbations', 'is', 'analyzed', 'in', 'disordered', 'interacting', 'manybody', 'systems', 'which', 'are', 'constructed', 'from', 'the', 'embedded', 'gaussian', 'random', 'matrix', 'ensembles', 'eges', 'the', 'transport', 'efficiency', 'can', 'be', 'enhanced', 'drastically', 'if', 'centrosymmetry', 'csege', 'is', 'imposed', 'when', 'the', 'csege', 'is', 'perturbed', 'with', 'an', 'ordinary', 'ege', 'the', 'transport', 'efficiency', 'in', 'the', 'optimal', 'cases', 'is', 'reduced', 'significantly', 'while', 'in', 'the', 'suboptimal', 'cases', 'the', 'changes', 'are', 'less', 'pronounced', 'qualitatively', 'the', 'same', 'behavior', 'is', 'observed', 'when', 'parity', 'and', 'centrosymmetry', 'are', 'broken', 'by', 'block', 'perturbations', 'analyzing', 'the', 'influence', 'of', 'the', 'environment', 'coupling', 'optimal', 'transport', 'is', 'observed', 'at', 'a', 'certain', 'coupling', 'strength', 'while', 'too', 'weak', 'and', 'too', 'strong', 'coupling', 'reduce', 'the', 'transport', 'taking', 'into', 'account', 'the', 'effects', 'of', 'decoherence', 'in', 'the', 'ege', 'the', 'transport', 'efficiency', 'approaches', 'its', 'maximum', 'at', 'a', 'finite', 'nonzero', 'decoherence', 'strength', 'environmentassisted', 'transport', 'in', 'the', 'csege', 'the', 'efficiency', 'decays', 'monotonically', 'with', 'the', 'decoherence', 'but', 'is', 'always', 'larger', 'than', 'in', 'the', 'ege']]
|
[-0.1653292588936165, 0.2178639701048572, -0.04722485737719884, 0.07713798600404213, 0.02138838679684947, -0.1827105805433045, 0.0015327837512207527, 0.32965094422300656, -0.29555636304741106, -0.2655117747746408, 0.08240977469366044, -0.29907229607303937, -0.10585892273423572, 0.15405825031610826, -0.011845389505227406, 0.04256756999491093, 0.04297356826874117, 0.02328546308601896, -0.08191976718177708, -0.24454500100730608, 0.2613374229272207, 0.10059964353606726, 0.3428717800648883, 0.06064651637764958, 0.03209888169464345, 9.520826240380605e-05, 0.05857915924862027, 0.06268231622736493, -0.06370066365227103, 0.029738309986860258, 0.19627765818091575, 0.015051640893022218, 0.24634865860299518, -0.4134757658466697, -0.2424162227412065, 0.10638343276688829, 0.15767381934526686, 0.12664127053615326, -0.03297506960341707, -0.2719724377244711, 0.08137819295128186, -0.12989485181712856, -0.09256300438505907, -0.041440857569687066, 0.004960187549392383, 0.011521854028881838, -0.28443937197948493, 0.10814577836543321, 0.06511509770217042, 0.026256718443861852, -0.0031344863298969966, -0.10881337347440422, -0.05520995362739389, 0.1151039057977808, 0.05427436238154769, -0.028937446263929207, 0.17856761237140745, -0.15014889678607385, -0.05668115149019286, 0.3893162219723066, -0.07078243013830313, -0.21911329947412014, 0.17211665717264016, -0.14778983504511417, -0.08346973864827305, 0.17853063028150548, 0.12852806849405168, 0.09445694958791137, -0.12670194940738536, 0.11572161440039054, 0.02594796996563673, 0.14088340478638808, 0.02210441965299348, 0.08521640960747998, 0.1632716772084435, 0.1573153101284212, 0.07859763584254931, 0.14716713630206263, -0.061074875636647145, -0.14187471736067286, -0.2458076055844625, -0.08145319203535716, -0.19155156107308963, 0.08597011253237724, -0.11284331178894111, -0.10222426015883684, 0.3767624423187226, 0.15467727780497323, 0.1736363329179585, 0.02564039659065505, 0.28078883116443953, 0.18991357463101546, 0.06844181043716768, 0.09913628728749851, 0.29299475599080327, 0.14887387041545783, 0.07411788117644998, -0.3414516333277182, 0.12797436537376294, -0.013548876491064827]
|
1,803.05975
|
Contraction and Robustness of Continuous Time Primal-Dual Dynamics
|
The Primal-Dual (PD) algorithm is widely used in convex optimization to
determine saddle points. While the stability of the PD algorithm can be easily
guaranteed, strict contraction is nontrivial to establish in most cases. This
work focuses on continuous, possibly non-autonomous PD dynamics arising in a
network context, in distributed optimization, or in systems with multiple
time-scales. We show that the PD algorithm is indeed strictly contracting in
specific metrics and analyze its robustness establishing stability and
performance guarantees for different approximate PD systems. We derive
estimates for the performance of multiple time-scale multi-layer optimization
systems, and illustrate our results on a primal-dual representation of the
Automatic Generation Control of power systems.
|
math.OC
|
the primaldual pd algorithm is widely used in convex optimization to determine saddle points while the stability of the pd algorithm can be easily guaranteed strict contraction is nontrivial to establish in most cases this work focuses on continuous possibly nonautonomous pd dynamics arising in a network context in distributed optimization or in systems with multiple timescales we show that the pd algorithm is indeed strictly contracting in specific metrics and analyze its robustness establishing stability and performance guarantees for different approximate pd systems we derive estimates for the performance of multiple timescale multilayer optimization systems and illustrate our results on a primaldual representation of the automatic generation control of power systems
|
[['the', 'primaldual', 'pd', 'algorithm', 'is', 'widely', 'used', 'in', 'convex', 'optimization', 'to', 'determine', 'saddle', 'points', 'while', 'the', 'stability', 'of', 'the', 'pd', 'algorithm', 'can', 'be', 'easily', 'guaranteed', 'strict', 'contraction', 'is', 'nontrivial', 'to', 'establish', 'in', 'most', 'cases', 'this', 'work', 'focuses', 'on', 'continuous', 'possibly', 'nonautonomous', 'pd', 'dynamics', 'arising', 'in', 'a', 'network', 'context', 'in', 'distributed', 'optimization', 'or', 'in', 'systems', 'with', 'multiple', 'timescales', 'we', 'show', 'that', 'the', 'pd', 'algorithm', 'is', 'indeed', 'strictly', 'contracting', 'in', 'specific', 'metrics', 'and', 'analyze', 'its', 'robustness', 'establishing', 'stability', 'and', 'performance', 'guarantees', 'for', 'different', 'approximate', 'pd', 'systems', 'we', 'derive', 'estimates', 'for', 'the', 'performance', 'of', 'multiple', 'timescale', 'multilayer', 'optimization', 'systems', 'and', 'illustrate', 'our', 'results', 'on', 'a', 'primaldual', 'representation', 'of', 'the', 'automatic', 'generation', 'control', 'of', 'power', 'systems']]
|
[-0.15756229877505185, -0.025902905979559625, -0.08782361313517738, 0.07883892162811078, -0.021552972158782983, -0.17390219367059348, 0.04627325516360413, 0.3971806061038348, -0.3194199855986101, -0.2704637976296778, 0.14647896266667107, -0.22503425319363096, -0.20017101731147185, 0.22040356743881212, -0.11585020081007055, 0.09529779116408983, 0.07515479715740574, 0.01041650420769916, -0.10793736929813999, -0.25174081324699465, 0.3143561820085909, 0.016912065933086393, 0.288589752507895, 0.03600549279612356, 0.06235405112238368, 0.015553836856270209, 0.012891113227981674, 0.03514003071604423, -0.07340786348536962, 0.12845740013290197, 0.27820345072541386, 0.14940751123607957, 0.330940582554896, -0.41115469323371406, -0.20481478111884957, 0.12641106320578338, 0.1357079934345425, 0.08112060255371034, -0.06620117536970481, -0.2598839534662797, 0.12068721617522117, -0.1056859165712792, -0.08133840339723974, -0.10101289138297684, -0.03800124293775298, 0.06297655684621921, -0.3314434086558841, 0.030884801493292407, 0.07629032440516832, 0.04433349880439762, -0.1020044560957883, -0.08941364353190043, -0.029132047492437, 0.09136840599863458, 0.041133437316083085, -0.003960367799403944, 0.12749758457097674, -0.06348239578853411, -0.17052297145294557, 0.3621457891006555, -0.03871333913204061, -0.22618953496151203, 0.21828061344500124, -0.07337743349905525, -0.15152212289311656, 0.11592444674377995, 0.25916710561640294, 0.18191741488408297, -0.17815241561869957, 0.07460917479485422, 0.004312235009690214, 0.16439351577927092, 0.018820410768967122, 0.021654417892152975, 0.13500962543080927, 0.2163178099019985, 0.1596355972942547, 0.14084582467850332, -0.03505169842641668, -0.17189327364654414, -0.21421223874806725, -0.14546735428406724, -0.1472137869443811, -0.003565327559564529, -0.12442036428819847, -0.14949162511454364, 0.38867112402138965, 0.14835495484931016, 0.17586451781348192, 0.10117289283724469, 0.3021300398811166, 0.1281331970541422, 0.015886230498186445, 0.0935096078735244, 0.2547843063075561, 0.09601156264294072, 0.10564248049506984, -0.23981613483296574, 0.10800752016906959, 0.0971330578904599]
|
1,803.05976
|
Deep Choice Model Using Pointer Networks for Airline Itinerary
Prediction
|
Travel providers such as airlines and on-line travel agents are becoming more
and more interested in understanding how passengers choose among alternative
itineraries when searching for flights. This knowledge helps them better
display and adapt their offer, taking into account market conditions and
customer needs. Some common applications are not only filtering and sorting
alternatives, but also changing certain attributes in real-time (e.g., changing
the price). In this paper, we concentrate with the problem of modeling air
passenger choices of flight itineraries. This problem has historically been
tackled using classical Discrete Choice Modelling techniques. Traditional
statistical approaches, in particular the Multinomial Logit model (MNL), is
widely used in industrial applications due to its simplicity and general good
performance. However, MNL models present several shortcomings and assumptions
that might not hold in real applications. To overcome these difficulties, we
present a new choice model based on Pointer Networks. Given an input sequence,
this type of deep neural architecture combines Recurrent Neural Networks with
the Attention Mechanism to learn the conditional probability of an output whose
values correspond to positions in an input sequence. Therefore, given a
sequence of different alternatives presented to a customer, the model can learn
to point to the one most likely to be chosen by the customer. The proposed
method was evaluated on a real dataset that combines on-line user search logs
and airline flight bookings. Experimental results show that the proposed model
outperforms the traditional MNL model on several metrics.
|
stat.ML cs.LG
|
travel providers such as airlines and online travel agents are becoming more and more interested in understanding how passengers choose among alternative itineraries when searching for flights this knowledge helps them better display and adapt their offer taking into account market conditions and customer needs some common applications are not only filtering and sorting alternatives but also changing certain attributes in realtime eg changing the price in this paper we concentrate with the problem of modeling air passenger choices of flight itineraries this problem has historically been tackled using classical discrete choice modelling techniques traditional statistical approaches in particular the multinomial logit model mnl is widely used in industrial applications due to its simplicity and general good performance however mnl models present several shortcomings and assumptions that might not hold in real applications to overcome these difficulties we present a new choice model based on pointer networks given an input sequence this type of deep neural architecture combines recurrent neural networks with the attention mechanism to learn the conditional probability of an output whose values correspond to positions in an input sequence therefore given a sequence of different alternatives presented to a customer the model can learn to point to the one most likely to be chosen by the customer the proposed method was evaluated on a real dataset that combines online user search logs and airline flight bookings experimental results show that the proposed model outperforms the traditional mnl model on several metrics
|
[['travel', 'providers', 'such', 'as', 'airlines', 'and', 'online', 'travel', 'agents', 'are', 'becoming', 'more', 'and', 'more', 'interested', 'in', 'understanding', 'how', 'passengers', 'choose', 'among', 'alternative', 'itineraries', 'when', 'searching', 'for', 'flights', 'this', 'knowledge', 'helps', 'them', 'better', 'display', 'and', 'adapt', 'their', 'offer', 'taking', 'into', 'account', 'market', 'conditions', 'and', 'customer', 'needs', 'some', 'common', 'applications', 'are', 'not', 'only', 'filtering', 'and', 'sorting', 'alternatives', 'but', 'also', 'changing', 'certain', 'attributes', 'in', 'realtime', 'eg', 'changing', 'the', 'price', 'in', 'this', 'paper', 'we', 'concentrate', 'with', 'the', 'problem', 'of', 'modeling', 'air', 'passenger', 'choices', 'of', 'flight', 'itineraries', 'this', 'problem', 'has', 'historically', 'been', 'tackled', 'using', 'classical', 'discrete', 'choice', 'modelling', 'techniques', 'traditional', 'statistical', 'approaches', 'in', 'particular', 'the', 'multinomial', 'logit', 'model', 'mnl', 'is', 'widely', 'used', 'in', 'industrial', 'applications', 'due', 'to', 'its', 'simplicity', 'and', 'general', 'good', 'performance', 'however', 'mnl', 'models', 'present', 'several', 'shortcomings', 'and', 'assumptions', 'that', 'might', 'not', 'hold', 'in', 'real', 'applications', 'to', 'overcome', 'these', 'difficulties', 'we', 'present', 'a', 'new', 'choice', 'model', 'based', 'on', 'pointer', 'networks', 'given', 'an', 'input', 'sequence', 'this', 'type', 'of', 'deep', 'neural', 'architecture', 'combines', 'recurrent', 'neural', 'networks', 'with', 'the', 'attention', 'mechanism', 'to', 'learn', 'the', 'conditional', 'probability', 'of', 'an', 'output', 'whose', 'values', 'correspond', 'to', 'positions', 'in', 'an', 'input', 'sequence', 'therefore', 'given', 'a', 'sequence', 'of', 'different', 'alternatives', 'presented', 'to', 'a', 'customer', 'the', 'model', 'can', 'learn', 'to', 'point', 'to', 'the', 'one', 'most', 'likely', 'to', 'be', 'chosen', 'by', 'the', 'customer', 'the', 'proposed', 'method', 'was', 'evaluated', 'on', 'a', 'real', 'dataset', 'that', 'combines', 'online', 'user', 'search', 'logs', 'and', 'airline', 'flight', 'bookings', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'model', 'outperforms', 'the', 'traditional', 'mnl', 'model', 'on', 'several', 'metrics']]
|
[-0.04794235170826499, 0.036163223218103606, -0.07595964165816664, 0.10044736961011591, -0.13742056177054976, -0.2112273055063866, 0.06208570492616091, 0.45873803932402957, -0.27768941637635286, -0.3139095772782982, 0.09534395743279764, -0.26578883920103447, -0.1839749595898463, 0.20194980827041856, -0.14997445675598114, 0.07980736507777722, 0.09204928185786006, 0.04198690810332411, -0.010102463041653582, -0.29356354880184854, 0.2832405253429897, 0.046255427669255694, 0.3270944857513761, 0.009169562147227956, 0.10559601256181105, -0.0014377215239753734, -0.05079771982473474, -0.01606032416438226, -0.07713472759147766, 0.13726424177837573, 0.29166953363732856, 0.2015907059902646, 0.3421447725783362, -0.4536533034253927, -0.23482153281859566, 0.1550292061912812, 0.10967385321854352, 0.05668588828669525, -0.018378060888503793, -0.3028082918236414, 0.07437160427750805, -0.1879524401046496, -0.07091217050061668, -0.09789758227139589, -0.013286473471900357, 0.038105087161071784, -0.2828593653346198, -0.029216909810798587, 0.033996095457190616, 0.030913836644536848, -0.04802154570094646, -0.1367283546777068, 0.021789573776138733, 0.18464980610409182, 0.09442112356716324, -0.015582003714669435, 0.1340612053611606, -0.14771854679876, -0.16853502877800894, 0.40916731339100687, -0.008865480471524547, -0.23083176776350736, 0.19755048054193153, -0.03282908281048027, -0.15264797593909699, 0.06436925980281066, 0.2151491775790031, 0.08705206176353862, -0.18596095703552967, 0.012663250089600132, -0.030838516170109364, 0.15980431708647033, 0.05438416905998878, -0.0012941257844461495, 0.17865111840007156, 0.22227960282394693, 0.0636789975229834, 0.0892609513930587, -0.05631613670647923, -0.13448091560820133, -0.21827477453272698, -0.09953765046007962, -0.1638434766591374, -0.0027553114951082477, -0.10752191127909606, -0.15400134279169847, 0.40021769943662355, 0.23781893930095438, 0.18900814154433454, 0.08498067807856581, 0.32003744537789436, 0.07737837136569471, 0.058211315322460294, 0.0908515369624556, 0.1537908107705737, -0.008623409360746442, 0.15589535605452468, -0.14441000411695357, 0.15681890081437724, 0.020714612392857518]
|
1,803.05977
|
The Pauli principle, normal modes and superfluidity: the emergence of
collective organizational phenomena
|
Understanding the emergence of collective organizational phenomena is a major
goal in many fields of physics from condensed matter to cosmology. Using a
recently introduced manybody perturbation formalism for fermions, we propose a
mechanism for the emergence of collective behavior, specifically superfluidity,
driven by quantum statistics and the enforcement of the Pauli principle through
the selection of normal modes. The method, which is called symmetry invariant
perturbation theory (SPT), uses group theory and graphical techniques to solve
the manybody Schrodinger equation through first order exactly. The solution at
first order defines collective coordinates in terms of five N-body normal
modes, identified as breathing, center of mass, single particle angular
excitation, single particle radial excitation and phonon. A correspondence is
established "on paper" that enforces the Pauli principle through the assignment
of specific normal mode quantum numbers. Applied in the unitary regime, this
normal mode assignment yields occupation only in an extremely low frequency
N-body phonon mode at ultralow temperatures. A single particle radial
excitation mode at a much higher frequency creates a gap that stabilizes the
superfluidity at low temperatures. Coupled with the corresponding values for
the frequencies at unitarity obtained by this manybody calculation, we obtain
good agreement with experimental thermodynamic results including the lambda
transition in the specific heat. Our results suggest that the emergence of
collective behavior in macroscopic systems is driven by the Pauli principle and
its selection of the correct collective coordinates in the form of N-body
normal modes.
|
cond-mat.stat-mech cond-mat.quant-gas
|
understanding the emergence of collective organizational phenomena is a major goal in many fields of physics from condensed matter to cosmology using a recently introduced manybody perturbation formalism for fermions we propose a mechanism for the emergence of collective behavior specifically superfluidity driven by quantum statistics and the enforcement of the pauli principle through the selection of normal modes the method which is called symmetry invariant perturbation theory spt uses group theory and graphical techniques to solve the manybody schrodinger equation through first order exactly the solution at first order defines collective coordinates in terms of five nbody normal modes identified as breathing center of mass single particle angular excitation single particle radial excitation and phonon a correspondence is established on paper that enforces the pauli principle through the assignment of specific normal mode quantum numbers applied in the unitary regime this normal mode assignment yields occupation only in an extremely low frequency nbody phonon mode at ultralow temperatures a single particle radial excitation mode at a much higher frequency creates a gap that stabilizes the superfluidity at low temperatures coupled with the corresponding values for the frequencies at unitarity obtained by this manybody calculation we obtain good agreement with experimental thermodynamic results including the lambda transition in the specific heat our results suggest that the emergence of collective behavior in macroscopic systems is driven by the pauli principle and its selection of the correct collective coordinates in the form of nbody normal modes
|
[['understanding', 'the', 'emergence', 'of', 'collective', 'organizational', 'phenomena', 'is', 'a', 'major', 'goal', 'in', 'many', 'fields', 'of', 'physics', 'from', 'condensed', 'matter', 'to', 'cosmology', 'using', 'a', 'recently', 'introduced', 'manybody', 'perturbation', 'formalism', 'for', 'fermions', 'we', 'propose', 'a', 'mechanism', 'for', 'the', 'emergence', 'of', 'collective', 'behavior', 'specifically', 'superfluidity', 'driven', 'by', 'quantum', 'statistics', 'and', 'the', 'enforcement', 'of', 'the', 'pauli', 'principle', 'through', 'the', 'selection', 'of', 'normal', 'modes', 'the', 'method', 'which', 'is', 'called', 'symmetry', 'invariant', 'perturbation', 'theory', 'spt', 'uses', 'group', 'theory', 'and', 'graphical', 'techniques', 'to', 'solve', 'the', 'manybody', 'schrodinger', 'equation', 'through', 'first', 'order', 'exactly', 'the', 'solution', 'at', 'first', 'order', 'defines', 'collective', 'coordinates', 'in', 'terms', 'of', 'five', 'nbody', 'normal', 'modes', 'identified', 'as', 'breathing', 'center', 'of', 'mass', 'single', 'particle', 'angular', 'excitation', 'single', 'particle', 'radial', 'excitation', 'and', 'phonon', 'a', 'correspondence', 'is', 'established', 'on', 'paper', 'that', 'enforces', 'the', 'pauli', 'principle', 'through', 'the', 'assignment', 'of', 'specific', 'normal', 'mode', 'quantum', 'numbers', 'applied', 'in', 'the', 'unitary', 'regime', 'this', 'normal', 'mode', 'assignment', 'yields', 'occupation', 'only', 'in', 'an', 'extremely', 'low', 'frequency', 'nbody', 'phonon', 'mode', 'at', 'ultralow', 'temperatures', 'a', 'single', 'particle', 'radial', 'excitation', 'mode', 'at', 'a', 'much', 'higher', 'frequency', 'creates', 'a', 'gap', 'that', 'stabilizes', 'the', 'superfluidity', 'at', 'low', 'temperatures', 'coupled', 'with', 'the', 'corresponding', 'values', 'for', 'the', 'frequencies', 'at', 'unitarity', 'obtained', 'by', 'this', 'manybody', 'calculation', 'we', 'obtain', 'good', 'agreement', 'with', 'experimental', 'thermodynamic', 'results', 'including', 'the', 'lambda', 'transition', 'in', 'the', 'specific', 'heat', 'our', 'results', 'suggest', 'that', 'the', 'emergence', 'of', 'collective', 'behavior', 'in', 'macroscopic', 'systems', 'is', 'driven', 'by', 'the', 'pauli', 'principle', 'and', 'its', 'selection', 'of', 'the', 'correct', 'collective', 'coordinates', 'in', 'the', 'form', 'of', 'nbody', 'normal', 'modes']]
|
[-0.14672761954954963, 0.20484693125936396, -0.1154297622441711, 0.04855362763990969, -0.06827915709877967, -0.1255560782547185, 0.07063103685886446, 0.29034027930914014, -0.24953859383774707, -0.2749728227996069, 0.014688560149926295, -0.27279537591556485, -0.12031749831073628, 0.16142983841433067, 0.039080738693048234, 0.0515142246620032, 0.03528594362671624, 0.05332908239244239, -0.06057081946656566, -0.1484580992336469, 0.3087530653164188, 0.052786139823824595, 0.3442048288120308, 0.01307941362124364, 0.11062143393028832, 0.023529191656022897, 0.0379071530607361, -0.006817464531135944, -0.13444052456606054, 0.06354976009189144, 0.26148921913432993, 0.032272316826522714, 0.27497506585949266, -0.4080143000846576, -0.2020050841536312, 0.046260218380293885, 0.16386212988090548, 0.17548930264969326, -0.06223506416188416, -0.27856367087510764, 0.023188517778896207, -0.17338789659805146, -0.18376818939386944, -0.10752394237960154, -0.01402128809017175, -0.03568050169698955, -0.24409537277848567, 0.1478349180342477, 0.041085611536934755, 0.07568654693189825, -0.06486533505586357, -0.07258814549814055, -0.016973425200987668, 0.07331499394189689, 0.021671401149761238, -0.004894871171182174, 0.13842446218398838, -0.1363616970722701, -0.12373631507908299, 0.41431302924976365, -0.06747973785777653, -0.1694699927370568, 0.19197011273354292, -0.15852210132336458, -0.12601610082611975, 0.1351326009884599, 0.13438340788993405, 0.07898552350310578, -0.13982920137092808, 0.06631217255246574, -0.008135191355278472, 0.14210013959644607, 0.06690762780957901, 0.06165291642033391, 0.23880997098329645, 0.15621974101847375, 0.038946225242756045, 0.10669346725053849, -0.08345466359760842, -0.12470835359141108, -0.31459910685929365, -0.10893272657269007, -0.20854122717969775, 0.028605670595663737, -0.06275618376117773, -0.14403745919832442, 0.408017058310015, 0.11100546479977565, 0.16003382018744397, 0.01926149307229159, 0.2686990032451548, 0.16940663444721826, 0.0685694932980085, 0.03873814590328724, 0.2609939086017176, 0.17340902384985085, 0.09206647294254774, -0.3229165255959474, -0.009090631188763703, 0.06564257191455938]
|
1,803.05978
|
Kinematic evidence for feedback-driven star formation in NGC 1893
|
OB associations are the prevailing star forming sites in the Galaxy. Up to
now, the process of how OB associations were formed remained a mystery. A
possible process is self-regulating star formation driven by feedback from
massive stars. However, although a number of observational studies uncovered
various signposts of feedback-driven star formation, the effectiveness of such
feedback has been questioned. Stellar and gas kinematics is a promising tool to
capture the relative motion of newborn stars and gas away from ionizing
sources. We present high-resolution spectroscopy of stars and gas in the young
open cluster NGC 1893. Our findings show that newborn stars and the tadpole
nebula Sim 130 are moving away from the central cluster containing two O-type
stars, and that the timescale of sequential star formation is about 1 Myr
within a 9 parsec distance. The newborn stars formed by feedback from massive
stars account for at least 18 per cent of the total stellar population in the
cluster, suggesting that this process can play an important role in the
formation of OB associations. These results support the self-regulating star
formation model.
|
astro-ph.SR astro-ph.GA
|
ob associations are the prevailing star forming sites in the galaxy up to now the process of how ob associations were formed remained a mystery a possible process is selfregulating star formation driven by feedback from massive stars however although a number of observational studies uncovered various signposts of feedbackdriven star formation the effectiveness of such feedback has been questioned stellar and gas kinematics is a promising tool to capture the relative motion of newborn stars and gas away from ionizing sources we present highresolution spectroscopy of stars and gas in the young open cluster ngc 1893 our findings show that newborn stars and the tadpole nebula sim 130 are moving away from the central cluster containing two otype stars and that the timescale of sequential star formation is about 1 myr within a 9 parsec distance the newborn stars formed by feedback from massive stars account for at least 18 per cent of the total stellar population in the cluster suggesting that this process can play an important role in the formation of ob associations these results support the selfregulating star formation model
|
[['ob', 'associations', 'are', 'the', 'prevailing', 'star', 'forming', 'sites', 'in', 'the', 'galaxy', 'up', 'to', 'now', 'the', 'process', 'of', 'how', 'ob', 'associations', 'were', 'formed', 'remained', 'a', 'mystery', 'a', 'possible', 'process', 'is', 'selfregulating', 'star', 'formation', 'driven', 'by', 'feedback', 'from', 'massive', 'stars', 'however', 'although', 'a', 'number', 'of', 'observational', 'studies', 'uncovered', 'various', 'signposts', 'of', 'feedbackdriven', 'star', 'formation', 'the', 'effectiveness', 'of', 'such', 'feedback', 'has', 'been', 'questioned', 'stellar', 'and', 'gas', 'kinematics', 'is', 'a', 'promising', 'tool', 'to', 'capture', 'the', 'relative', 'motion', 'of', 'newborn', 'stars', 'and', 'gas', 'away', 'from', 'ionizing', 'sources', 'we', 'present', 'highresolution', 'spectroscopy', 'of', 'stars', 'and', 'gas', 'in', 'the', 'young', 'open', 'cluster', 'ngc', '1893', 'our', 'findings', 'show', 'that', 'newborn', 'stars', 'and', 'the', 'tadpole', 'nebula', 'sim', '130', 'are', 'moving', 'away', 'from', 'the', 'central', 'cluster', 'containing', 'two', 'otype', 'stars', 'and', 'that', 'the', 'timescale', 'of', 'sequential', 'star', 'formation', 'is', 'about', '1', 'myr', 'within', 'a', '9', 'parsec', 'distance', 'the', 'newborn', 'stars', 'formed', 'by', 'feedback', 'from', 'massive', 'stars', 'account', 'for', 'at', 'least', '18', 'per', 'cent', 'of', 'the', 'total', 'stellar', 'population', 'in', 'the', 'cluster', 'suggesting', 'that', 'this', 'process', 'can', 'play', 'an', 'important', 'role', 'in', 'the', 'formation', 'of', 'ob', 'associations', 'these', 'results', 'support', 'the', 'selfregulating', 'star', 'formation', 'model']]
|
[-0.05434855883631035, 0.14415422578681697, -0.05636802890449357, 0.11686062754295998, -0.10462162576479149, -0.01051454279197218, 0.10187445913929284, 0.40292663890463504, -0.17700266877553708, -0.37029199649417854, 0.043466271083478045, -0.2791653661001676, -0.020203845190775137, 0.18475739693183088, -0.03056058946759035, -0.08371097450751973, 0.14500976985436864, -0.017844952672021464, 0.048294163410110225, -0.29654560689611925, 0.3373695270606929, 0.06813125444434422, 0.09753672067745356, -0.021138585314672484, 0.05150276455147516, -0.1501352913518254, -0.07243868344433038, -0.06282453957512348, -0.14718243693764438, 0.042595823690767844, 0.19736281425550417, 0.1813367351512526, 0.3083105271520174, -0.37850152391373465, -0.2445503929604614, 0.0054688491344796085, 0.2654114694235867, 0.04912417781357046, -0.1565165135189486, -0.2593523097685133, 0.10641815946671515, -0.21106321807399028, -0.18309657103078358, 0.10972365461234206, 0.06554825061112238, 0.038806841292793964, -0.21930570896007417, 0.17488244171039222, 0.04346124206198431, 0.08040601895292006, -0.13901949684520293, -0.08644137078005334, -0.06706353276904733, 0.14679908257676288, -0.005076953078178517, 0.11436940574735079, 0.21092971449631834, -0.17156259907768917, -0.06464497217371978, 0.40923147232514684, -0.002539219076583243, 0.009193228861398024, 0.2783226904196098, -0.22742645633368977, -0.21138317721804767, 0.13889805832624677, 0.1480380696821553, 0.15978431799600873, -0.21984297297793723, -0.053132841627065434, -0.01536435311731032, 0.1766039803870903, 0.0725598407506882, 0.04807410450057827, 0.38003139998055185, 0.1694833681293581, -0.032549454767317715, 0.11441993809674623, -0.2226389389809059, -0.1311085370534388, -0.18841307827413245, -0.08835622485038704, -0.08455002630944364, 0.10698491979644092, -0.1256366398576337, -0.09648569448765319, 0.28139635635053983, 0.09158854381404007, 0.17145269837372168, -0.024211942278982504, 0.2548690684767359, 0.051122585474133855, 0.14794596271171348, 0.1667016109568067, 0.26907862294667767, 0.22112913598033154, 0.03634984194776853, -0.2734604276164369, 0.10600324386335991, -0.02229769471349478]
|
1,803.05979
|
The Hubble Space Telescope UV Legacy Survey of Galactic Globular
Clusters - XIV. Multiple stellar populations within M 15 and their radial
distribution
|
In the context of the Hubble Space Telescope UV Survey of Galactic Globular
Clusters (GCs), we derived high-precision, multi-band photometry to investigate
the multiple stellar populations in the massive and metal-poor GC M 15. By
creating for red-giant branch (RGB) stars of the cluster a 'chromosome map',
which is a pseudo two-colour diagram made with appropriate combination of
F275W, F336W, F438W, and F814W magnitudes, we revealed colour spreads around
two of the three already known stellar populations. These spreads cannot be
produced by photometric errors alone and could hide the existence of (two)
additional populations. This discovery increases the complexity of the
multiple-population phenomenon in M 15. Our analysis shows that M 15 exhibits a
faint sub-giant branch (SGB), which is also detected in colour-magnitude
diagrams (CMDs) made with optical magnitudes only. This poorly-populated SGB
includes about 5% of the total number of SGB stars and evolves into a red RGB
in the m_F336W vs. m_F336W-m_F814W CMD, suggesting that M 15 belongs to the
class of Type II GCs. We measured the relative number of stars in each
population at various radial distances from the cluster centre, showing that
all of these populations share the same radial distribution within statistic
uncertainties. These new findings are discussed in the context of the formation
and evolution scenarios of the multiple populations.
|
astro-ph.SR astro-ph.GA
|
in the context of the hubble space telescope uv survey of galactic globular clusters gcs we derived highprecision multiband photometry to investigate the multiple stellar populations in the massive and metalpoor gc m 15 by creating for redgiant branch rgb stars of the cluster a chromosome map which is a pseudo twocolour diagram made with appropriate combination of f275w f336w f438w and f814w magnitudes we revealed colour spreads around two of the three already known stellar populations these spreads cannot be produced by photometric errors alone and could hide the existence of two additional populations this discovery increases the complexity of the multiplepopulation phenomenon in m 15 our analysis shows that m 15 exhibits a faint subgiant branch sgb which is also detected in colourmagnitude diagrams cmds made with optical magnitudes only this poorlypopulated sgb includes about 5 of the total number of sgb stars and evolves into a red rgb in the m_f336w vs m_f336wm_f814w cmd suggesting that m 15 belongs to the class of type ii gcs we measured the relative number of stars in each population at various radial distances from the cluster centre showing that all of these populations share the same radial distribution within statistic uncertainties these new findings are discussed in the context of the formation and evolution scenarios of the multiple populations
|
[['in', 'the', 'context', 'of', 'the', 'hubble', 'space', 'telescope', 'uv', 'survey', 'of', 'galactic', 'globular', 'clusters', 'gcs', 'we', 'derived', 'highprecision', 'multiband', 'photometry', 'to', 'investigate', 'the', 'multiple', 'stellar', 'populations', 'in', 'the', 'massive', 'and', 'metalpoor', 'gc', 'm', '15', 'by', 'creating', 'for', 'redgiant', 'branch', 'rgb', 'stars', 'of', 'the', 'cluster', 'a', 'chromosome', 'map', 'which', 'is', 'a', 'pseudo', 'twocolour', 'diagram', 'made', 'with', 'appropriate', 'combination', 'of', 'f275w', 'f336w', 'f438w', 'and', 'f814w', 'magnitudes', 'we', 'revealed', 'colour', 'spreads', 'around', 'two', 'of', 'the', 'three', 'already', 'known', 'stellar', 'populations', 'these', 'spreads', 'can', 'not', 'be', 'produced', 'by', 'photometric', 'errors', 'alone', 'and', 'could', 'hide', 'the', 'existence', 'of', 'two', 'additional', 'populations', 'this', 'discovery', 'increases', 'the', 'complexity', 'of', 'the', 'multiplepopulation', 'phenomenon', 'in', 'm', '15', 'our', 'analysis', 'shows', 'that', 'm', '15', 'exhibits', 'a', 'faint', 'subgiant', 'branch', 'sgb', 'which', 'is', 'also', 'detected', 'in', 'colourmagnitude', 'diagrams', 'cmds', 'made', 'with', 'optical', 'magnitudes', 'only', 'this', 'poorlypopulated', 'sgb', 'includes', 'about', '5', 'of', 'the', 'total', 'number', 'of', 'sgb', 'stars', 'and', 'evolves', 'into', 'a', 'red', 'rgb', 'in', 'the', 'm_f336w', 'vs', 'm_f336wm_f814w', 'cmd', 'suggesting', 'that', 'm', '15', 'belongs', 'to', 'the', 'class', 'of', 'type', 'ii', 'gcs', 'we', 'measured', 'the', 'relative', 'number', 'of', 'stars', 'in', 'each', 'population', 'at', 'various', 'radial', 'distances', 'from', 'the', 'cluster', 'centre', 'showing', 'that', 'all', 'of', 'these', 'populations', 'share', 'the', 'same', 'radial', 'distribution', 'within', 'statistic', 'uncertainties', 'these', 'new', 'findings', 'are', 'discussed', 'in', 'the', 'context', 'of', 'the', 'formation', 'and', 'evolution', 'scenarios', 'of', 'the', 'multiple', 'populations']]
|
[-0.08191379145957234, 0.1178236420901323, -0.11527396755039014, 0.1123260850933465, -0.0962462013005279, -0.0467596492073922, 0.10154852964068678, 0.43430549621751363, -0.17593617118969138, -0.3810226707634601, 0.02078995605327443, -0.27643739095973696, -0.06197383704341271, 0.18604772813956846, -0.10286808519476008, -0.08713760424870998, 0.12472068362562409, -0.056219160241413525, -0.025043114278973502, -0.31776633916888386, 0.3081799477338791, -0.0719619535649227, 0.1733880340206352, -0.1253336173820902, 0.04336902076445932, -0.059569317922829546, -0.09470058444210074, -0.00801033575500531, -0.13287235841585657, 0.05509374630399345, 0.21433669277466832, 0.1497775651867414, 0.23754464958963747, -0.2963337551527233, -0.17962274739666925, 0.0876471953233704, 0.27117060965286904, 0.05883096041983332, -0.06786432164001532, -0.2777244510044428, 0.0749378512846306, -0.13636592759496785, -0.19845392722980415, 0.09342895970171826, 0.04858571052424271, 0.048831694044268015, -0.20234740703493695, 0.10077220826814565, -0.007391134330530556, 0.12523197414861484, -0.10803319894621381, -0.1876356604879468, -0.10923511364116249, 0.13765586690424242, -0.0320602825101973, 0.05622585489922626, 0.10865142040631988, -0.12510071752741087, -0.009647490246094424, 0.3395792906553569, -0.08344026523409412, 0.01253751191841068, 0.20493145277617839, -0.20368849831627978, -0.17956831992500652, 0.06944555729384196, 0.11751667217309163, 0.1005324920353649, -0.2091431535801596, 0.03272111039391761, 0.00918545953357931, 0.18870093759614975, 0.0773271440062672, 0.08546652706017167, 0.2892060183708302, 0.1289704240239437, 0.023012428311631083, 0.08688100950411436, -0.2745255278550427, -0.06748389735479246, -0.2376192957162857, -0.08826760853831232, -0.09072971980415538, 0.028272143316479, -0.16956091289248434, -0.1612183940215883, 0.3605000975224274, 0.09556731004902924, 0.2229637823505486, 0.037739728430328384, 0.26657946793023835, 0.04780270488964478, 0.14614800439872355, 0.08835989316629077, 0.2801583350445567, 0.17806225252729332, 0.06142726446163248, -0.2567790231508711, 0.042093629721255806, -0.004981058760842478]
|
1,803.0598
|
Star Forming Galaxies as AGN Imposters? A Theoretical Investigation of
the Mid-infrared Colors of AGNs and Extreme Starbursts
|
We conduct for the first time a theoretical investigation of the mid-infrared
spectral energy distribution (SED) produced by dust heated by an active
galactic nucleus (AGN) and an extreme starburst. These models employ an
integrated modeling approach using photoionization and stellar population
synthesis models in which both the line and emergent continuum is predicted
from gas exposed to the ionizing radiation from a young starburst and an AGN.
In this work, we focus on the infrared colors from the {\it Wide-field Infrared
Survey Explorer}, predicting the dependence of the colors on the input
radiation field, the ISM conditions, the obscuring column, and the metallicity.
We find that an extreme starburst can mimic an AGN in two band mid-infrared
color cuts employed in the literature. However, the three band color cuts
employed in the literature require starbursts with extremely high ionization
parameters or gas densities . We show that the extreme mid-IR colors seen in
some blue compact dwarf galaxies are not due to metallicity but rather a
combination of high ionization parameters and high column densities. Based on
our theoretical calculations, we present a theoretical mid-infrared color cut
that will exclude even the most extreme starburst that we have modeled in this
work. The theoretical AGN demarcation region presented here can be used to
identify elusive AGN candidates for future follow-up studies with the {\it
James Webb Space Telescope (JWST)}. The full suite of simulated SEDs are
available online.
|
astro-ph.GA
|
we conduct for the first time a theoretical investigation of the midinfrared spectral energy distribution sed produced by dust heated by an active galactic nucleus agn and an extreme starburst these models employ an integrated modeling approach using photoionization and stellar population synthesis models in which both the line and emergent continuum is predicted from gas exposed to the ionizing radiation from a young starburst and an agn in this work we focus on the infrared colors from the it widefield infrared survey explorer predicting the dependence of the colors on the input radiation field the ism conditions the obscuring column and the metallicity we find that an extreme starburst can mimic an agn in two band midinfrared color cuts employed in the literature however the three band color cuts employed in the literature require starbursts with extremely high ionization parameters or gas densities we show that the extreme midir colors seen in some blue compact dwarf galaxies are not due to metallicity but rather a combination of high ionization parameters and high column densities based on our theoretical calculations we present a theoretical midinfrared color cut that will exclude even the most extreme starburst that we have modeled in this work the theoretical agn demarcation region presented here can be used to identify elusive agn candidates for future followup studies with the it james webb space telescope jwst the full suite of simulated seds are available online
|
[['we', 'conduct', 'for', 'the', 'first', 'time', 'a', 'theoretical', 'investigation', 'of', 'the', 'midinfrared', 'spectral', 'energy', 'distribution', 'sed', 'produced', 'by', 'dust', 'heated', 'by', 'an', 'active', 'galactic', 'nucleus', 'agn', 'and', 'an', 'extreme', 'starburst', 'these', 'models', 'employ', 'an', 'integrated', 'modeling', 'approach', 'using', 'photoionization', 'and', 'stellar', 'population', 'synthesis', 'models', 'in', 'which', 'both', 'the', 'line', 'and', 'emergent', 'continuum', 'is', 'predicted', 'from', 'gas', 'exposed', 'to', 'the', 'ionizing', 'radiation', 'from', 'a', 'young', 'starburst', 'and', 'an', 'agn', 'in', 'this', 'work', 'we', 'focus', 'on', 'the', 'infrared', 'colors', 'from', 'the', 'it', 'widefield', 'infrared', 'survey', 'explorer', 'predicting', 'the', 'dependence', 'of', 'the', 'colors', 'on', 'the', 'input', 'radiation', 'field', 'the', 'ism', 'conditions', 'the', 'obscuring', 'column', 'and', 'the', 'metallicity', 'we', 'find', 'that', 'an', 'extreme', 'starburst', 'can', 'mimic', 'an', 'agn', 'in', 'two', 'band', 'midinfrared', 'color', 'cuts', 'employed', 'in', 'the', 'literature', 'however', 'the', 'three', 'band', 'color', 'cuts', 'employed', 'in', 'the', 'literature', 'require', 'starbursts', 'with', 'extremely', 'high', 'ionization', 'parameters', 'or', 'gas', 'densities', 'we', 'show', 'that', 'the', 'extreme', 'midir', 'colors', 'seen', 'in', 'some', 'blue', 'compact', 'dwarf', 'galaxies', 'are', 'not', 'due', 'to', 'metallicity', 'but', 'rather', 'a', 'combination', 'of', 'high', 'ionization', 'parameters', 'and', 'high', 'column', 'densities', 'based', 'on', 'our', 'theoretical', 'calculations', 'we', 'present', 'a', 'theoretical', 'midinfrared', 'color', 'cut', 'that', 'will', 'exclude', 'even', 'the', 'most', 'extreme', 'starburst', 'that', 'we', 'have', 'modeled', 'in', 'this', 'work', 'the', 'theoretical', 'agn', 'demarcation', 'region', 'presented', 'here', 'can', 'be', 'used', 'to', 'identify', 'elusive', 'agn', 'candidates', 'for', 'future', 'followup', 'studies', 'with', 'the', 'it', 'james', 'webb', 'space', 'telescope', 'jwst', 'the', 'full', 'suite', 'of', 'simulated', 'seds', 'are', 'available', 'online']]
|
[0.01707535025202904, 0.09191994572059788, -0.1008267251230745, 0.12274717257364004, -0.09053487781173072, -0.05806689519051682, 0.04814214407986797, 0.527328181988364, -0.1281967389347431, -0.33127060488155974, 0.05600485295701005, -0.2729760939333619, -0.05057142195663564, 0.1682846923549503, -0.0735592405878432, -0.011546067885189717, 0.015334418202953866, -0.15435683703198716, -0.0006079910461939558, -0.26677340111781317, 0.30184046342722415, 0.10667256932087368, 0.1922876963552338, -0.013599652927553529, 0.05230839556560484, -0.07873061712060374, -0.10786895950113524, -0.00800050660479176, -0.15536594904710718, 0.06206497600098618, 0.2898162893383598, 0.12824028079249278, 0.23984953914592905, -0.3915887774171762, -0.2544182500559367, 0.09771308764236189, 0.16010501186745296, 0.044465084446245855, -0.11166426615482353, -0.22793796392032453, 0.0013939707152087618, -0.17830204603677036, -0.15524164244048091, 0.028475430946671914, 0.0038865993309085173, 0.029357113841698042, -0.2394608966480381, 0.03828463610457335, -0.010913424525251455, 0.10273190557306995, -0.13166872666906096, -0.1166439620898293, -0.06909193006537839, 0.07884907182107949, -0.023402059540747346, 0.05694646749033068, 0.197492811365147, -0.19070726394762888, -0.05460056065710872, 0.38679673778628854, -0.05308473855844002, 0.005415087507082885, 0.24530178249692308, -0.18888204304517067, -0.17959295007098905, 0.16312436746020542, 0.1592041627394364, 0.14675092916082622, -0.14772184304266917, 0.018798357829600258, -0.04808178428362883, 0.212778008186861, -0.01517350850392039, 0.09261280042901948, 0.302269797474772, 0.11460217125244251, 0.027547855964204407, 0.11003468439282317, -0.21398045366899962, -0.012932498982379666, -0.2811925706283401, -0.05744099771572637, -0.18430316473353467, 0.0885953253371462, -0.11489549803534355, -0.12438714749398916, 0.33306887510091754, 0.1632551137678826, 0.21932723486594388, 0.01786657695280889, 0.3426394774089372, 0.09830260404313233, 0.09549893261062592, 0.11196905065586149, 0.32599964710757107, 0.11334913199133545, 0.06553091206626982, -0.2514514246018322, 0.038087766738843266, 0.0003843922177799234]
|
1,803.05981
|
Entanglement Enhancement in Multimode Integrated Circuits
|
The faithful distribution of entanglement in continuous variable systems is
essential to many quantum information protocols. As such, entanglement
distillation and enhancement schemes are a cornerstone of many applications.
The photon subtraction scheme offers enhancement with a relatively simple setup
and has been studied in various scenarios. Motivated by recent advances in
integrated optics, particularly the ability to build stable multimode
interferometers with squeezed input states, a multimodal extension to the
enhancement via photon subtraction protocol is studied. States generated with
multiple squeezed input states, rather than a single input source, are shown to
be more sensitive to the enhancement protocol, leading to increased
entanglement at the output. Numerical results show the gain in entanglement is
not monotonic with the number of modes or the degree of squeezing in the
additional modes. Consequently, the advantage due to having multiple squeezed
inputs states can be maximized when the number of modes is still relatively
small (e.g., $4$). The requirement for additional squeezing is within the
current realm of implementation, making this scheme achievable with present
technologies.
|
quant-ph physics.optics
|
the faithful distribution of entanglement in continuous variable systems is essential to many quantum information protocols as such entanglement distillation and enhancement schemes are a cornerstone of many applications the photon subtraction scheme offers enhancement with a relatively simple setup and has been studied in various scenarios motivated by recent advances in integrated optics particularly the ability to build stable multimode interferometers with squeezed input states a multimodal extension to the enhancement via photon subtraction protocol is studied states generated with multiple squeezed input states rather than a single input source are shown to be more sensitive to the enhancement protocol leading to increased entanglement at the output numerical results show the gain in entanglement is not monotonic with the number of modes or the degree of squeezing in the additional modes consequently the advantage due to having multiple squeezed inputs states can be maximized when the number of modes is still relatively small eg 4 the requirement for additional squeezing is within the current realm of implementation making this scheme achievable with present technologies
|
[['the', 'faithful', 'distribution', 'of', 'entanglement', 'in', 'continuous', 'variable', 'systems', 'is', 'essential', 'to', 'many', 'quantum', 'information', 'protocols', 'as', 'such', 'entanglement', 'distillation', 'and', 'enhancement', 'schemes', 'are', 'a', 'cornerstone', 'of', 'many', 'applications', 'the', 'photon', 'subtraction', 'scheme', 'offers', 'enhancement', 'with', 'a', 'relatively', 'simple', 'setup', 'and', 'has', 'been', 'studied', 'in', 'various', 'scenarios', 'motivated', 'by', 'recent', 'advances', 'in', 'integrated', 'optics', 'particularly', 'the', 'ability', 'to', 'build', 'stable', 'multimode', 'interferometers', 'with', 'squeezed', 'input', 'states', 'a', 'multimodal', 'extension', 'to', 'the', 'enhancement', 'via', 'photon', 'subtraction', 'protocol', 'is', 'studied', 'states', 'generated', 'with', 'multiple', 'squeezed', 'input', 'states', 'rather', 'than', 'a', 'single', 'input', 'source', 'are', 'shown', 'to', 'be', 'more', 'sensitive', 'to', 'the', 'enhancement', 'protocol', 'leading', 'to', 'increased', 'entanglement', 'at', 'the', 'output', 'numerical', 'results', 'show', 'the', 'gain', 'in', 'entanglement', 'is', 'not', 'monotonic', 'with', 'the', 'number', 'of', 'modes', 'or', 'the', 'degree', 'of', 'squeezing', 'in', 'the', 'additional', 'modes', 'consequently', 'the', 'advantage', 'due', 'to', 'having', 'multiple', 'squeezed', 'inputs', 'states', 'can', 'be', 'maximized', 'when', 'the', 'number', 'of', 'modes', 'is', 'still', 'relatively', 'small', 'eg', '4', 'the', 'requirement', 'for', 'additional', 'squeezing', 'is', 'within', 'the', 'current', 'realm', 'of', 'implementation', 'making', 'this', 'scheme', 'achievable', 'with', 'present', 'technologies']]
|
[-0.1439796347450465, 0.17269260901791442, -0.08806817823089659, 0.03442446522680776, -0.010250033879918711, -0.19557113808180604, 0.02416560609292771, 0.40188234288777624, -0.24902792413852046, -0.3093508840352297, 0.0852750353774588, -0.246567942582603, -0.09741387475415, 0.24557845697073, -0.07725114488974213, 0.12316482954791615, 0.07964391242712736, 0.020968593284487726, -0.01356278953009418, -0.2272040018093373, 0.28572736719357117, 0.06106031995599291, 0.3401351680039495, 0.047415524388530424, 0.09995098074823286, 0.01209594289106982, -0.018731179026487684, -0.02760654913793717, -0.028087526243180037, 0.12588237547748057, 0.27931223460073984, 0.12146462250367872, 0.28091959313622544, -0.3924303590093872, -0.24339684682299517, 0.13347483929113618, 0.14292943210365983, 0.1840471989980766, -0.03354231582596964, -0.2731315718963742, 0.05275375539170844, -0.1964950604331846, -0.11393962215366107, -0.1078216608187982, 0.0058167677346084795, -0.03512364944975291, -0.29574055798551335, 0.038096377921423744, 0.023799679529454026, 0.028835281852765807, 0.05377561328932643, -0.05799236190771418, -0.017565150411932597, 0.09626180068805947, -0.022613136737740465, 0.021364262625575066, 0.141511119220938, -0.18669307030604354, -0.13853056814388506, 0.34873633303812573, -0.058535226876597984, -0.20461110649630426, 0.17917230660627995, -0.12373582057122673, -0.08408481357020459, 0.13811096041596363, 0.12860396851386344, 0.08118258951331622, -0.10457428973076666, 0.02681255656826709, 0.021209858522883485, 0.21443760727931346, 0.08543431500970786, 0.2000248361112816, 0.1851678740605712, 0.14928250782457844, 0.06431210237355636, 0.20270255577351365, -0.06542457013374328, -0.11161829006392508, -0.2716600055413853, -0.12447825410536358, -0.20662889256541217, 0.03746942302885665, -0.05525897463035238, -0.1118474280506572, 0.3886660574683836, 0.12745859585436328, 0.17599441342920596, -0.010333057845543538, 0.3595411063517843, 0.12146939043421298, 0.10615318745640771, 0.05868970037837114, 0.2578249590185338, 0.1472532402058797, 0.06888257119472005, -0.1959139519105, 0.060697245311125046, -0.03543958335981837]
|
1,803.05982
|
Real-time Deep Pose Estimation with Geodesic Loss for Image-to-Template
Rigid Registration
|
With an aim to increase the capture range and accelerate the performance of
state-of-the-art inter-subject and subject-to-template 3D registration, we
propose deep learning-based methods that are trained to find the 3D position of
arbitrarily oriented subjects or anatomy based on slices or volumes of medical
images. For this, we propose regression CNNs that learn to predict the
angle-axis representation of 3D rotations and translations using image
features. We use and compare mean square error and geodesic loss to train
regression CNNs for 3D pose estimation used in two different scenarios:
slice-to-volume registration and volume-to-volume registration. Our results
show that in such registration applications that are amendable to learning, the
proposed deep learning methods with geodesic loss minimization can achieve
accurate results with a wide capture range in real-time (<100ms). We also
tested the generalization capability of the trained CNNs on an expanded age
range and on images of newborn subjects with similar and different MR image
contrasts. We trained our models on T2-weighted fetal brain MRI scans and used
them to predict the 3D pose of newborn brains based on T1-weighted MRI scans.
We showed that the trained models generalized well for the new domain when we
performed image contrast transfer through a conditional generative adversarial
network. This indicates that the domain of application of the trained deep
regression CNNs can be further expanded to image modalities and contrasts other
than those used in training. A combination of our proposed methods with
accelerated optimization-based registration algorithms can dramatically enhance
the performance of automatic imaging devices and image processing methods of
the future.
|
cs.CV
|
with an aim to increase the capture range and accelerate the performance of stateoftheart intersubject and subjecttotemplate 3d registration we propose deep learningbased methods that are trained to find the 3d position of arbitrarily oriented subjects or anatomy based on slices or volumes of medical images for this we propose regression cnns that learn to predict the angleaxis representation of 3d rotations and translations using image features we use and compare mean square error and geodesic loss to train regression cnns for 3d pose estimation used in two different scenarios slicetovolume registration and volumetovolume registration our results show that in such registration applications that are amendable to learning the proposed deep learning methods with geodesic loss minimization can achieve accurate results with a wide capture range in realtime 100ms we also tested the generalization capability of the trained cnns on an expanded age range and on images of newborn subjects with similar and different mr image contrasts we trained our models on t2weighted fetal brain mri scans and used them to predict the 3d pose of newborn brains based on t1weighted mri scans we showed that the trained models generalized well for the new domain when we performed image contrast transfer through a conditional generative adversarial network this indicates that the domain of application of the trained deep regression cnns can be further expanded to image modalities and contrasts other than those used in training a combination of our proposed methods with accelerated optimizationbased registration algorithms can dramatically enhance the performance of automatic imaging devices and image processing methods of the future
|
[['with', 'an', 'aim', 'to', 'increase', 'the', 'capture', 'range', 'and', 'accelerate', 'the', 'performance', 'of', 'stateoftheart', 'intersubject', 'and', 'subjecttotemplate', '3d', 'registration', 'we', 'propose', 'deep', 'learningbased', 'methods', 'that', 'are', 'trained', 'to', 'find', 'the', '3d', 'position', 'of', 'arbitrarily', 'oriented', 'subjects', 'or', 'anatomy', 'based', 'on', 'slices', 'or', 'volumes', 'of', 'medical', 'images', 'for', 'this', 'we', 'propose', 'regression', 'cnns', 'that', 'learn', 'to', 'predict', 'the', 'angleaxis', 'representation', 'of', '3d', 'rotations', 'and', 'translations', 'using', 'image', 'features', 'we', 'use', 'and', 'compare', 'mean', 'square', 'error', 'and', 'geodesic', 'loss', 'to', 'train', 'regression', 'cnns', 'for', '3d', 'pose', 'estimation', 'used', 'in', 'two', 'different', 'scenarios', 'slicetovolume', 'registration', 'and', 'volumetovolume', 'registration', 'our', 'results', 'show', 'that', 'in', 'such', 'registration', 'applications', 'that', 'are', 'amendable', 'to', 'learning', 'the', 'proposed', 'deep', 'learning', 'methods', 'with', 'geodesic', 'loss', 'minimization', 'can', 'achieve', 'accurate', 'results', 'with', 'a', 'wide', 'capture', 'range', 'in', 'realtime', '100ms', 'we', 'also', 'tested', 'the', 'generalization', 'capability', 'of', 'the', 'trained', 'cnns', 'on', 'an', 'expanded', 'age', 'range', 'and', 'on', 'images', 'of', 'newborn', 'subjects', 'with', 'similar', 'and', 'different', 'mr', 'image', 'contrasts', 'we', 'trained', 'our', 'models', 'on', 't2weighted', 'fetal', 'brain', 'mri', 'scans', 'and', 'used', 'them', 'to', 'predict', 'the', '3d', 'pose', 'of', 'newborn', 'brains', 'based', 'on', 't1weighted', 'mri', 'scans', 'we', 'showed', 'that', 'the', 'trained', 'models', 'generalized', 'well', 'for', 'the', 'new', 'domain', 'when', 'we', 'performed', 'image', 'contrast', 'transfer', 'through', 'a', 'conditional', 'generative', 'adversarial', 'network', 'this', 'indicates', 'that', 'the', 'domain', 'of', 'application', 'of', 'the', 'trained', 'deep', 'regression', 'cnns', 'can', 'be', 'further', 'expanded', 'to', 'image', 'modalities', 'and', 'contrasts', 'other', 'than', 'those', 'used', 'in', 'training', 'a', 'combination', 'of', 'our', 'proposed', 'methods', 'with', 'accelerated', 'optimizationbased', 'registration', 'algorithms', 'can', 'dramatically', 'enhance', 'the', 'performance', 'of', 'automatic', 'imaging', 'devices', 'and', 'image', 'processing', 'methods', 'of', 'the', 'future']]
|
[0.018435191003368434, -0.03820865023316962, -0.05717318106627349, 0.08648941008564998, -0.07988646383472216, -0.15612303700844019, -0.03749066078856987, 0.49632901388623707, -0.25680106708787065, -0.34271744669547083, 0.08884409443971297, -0.25956930531593847, -0.19302819610191546, 0.2234178182331781, -0.17019506962813788, 0.12413199223538725, 0.17015081610694757, 0.034671106726337955, -0.11044393046812594, -0.27852234807778936, 0.27506719335335594, 0.0037322765684791866, 0.356551194263772, -0.010990750103014953, 0.15056048760590254, -0.00312513613652338, -0.007285086985791666, 0.009751103953565418, -0.07924114526910717, 0.21375597364151444, 0.30839531036251394, 0.19781857725033017, 0.2786842355936395, -0.4591776032671618, -0.2556006154125749, 0.09139110962771078, 0.16619187839225763, 0.07706581268431012, -0.051259478072411026, -0.3526620687310266, 0.10037187424152055, -0.12444089903314223, 0.027627730436172154, -0.15028892481927955, -0.07590230012007443, -0.0021799862299157285, -0.32276323003547447, 0.08235010989017025, 0.04154936784576853, 0.09096773136774002, -0.10856520582305605, -0.10280251839301652, 0.023856589110778696, 0.184824793681282, 0.035214161143506166, 0.0959122217134519, 0.16317938348649505, -0.21073660841416852, -0.13774736646662727, 0.3306647796519243, -0.056534331812158896, -0.22694142444515994, 0.22029516174434774, -0.07203732247614227, -0.10001202240332932, 0.109534434667321, 0.2757325525541872, 0.14148585715106335, -0.1163950401808914, -0.038142167647963326, 0.0039041889073163044, 0.18534903947916953, 0.05027201549431944, -0.05923045939726619, 0.1516362473407004, 0.2309838578406493, -0.005696308299527999, 0.13462155290689298, -0.2542561581073966, -0.012002528960333951, -0.1836373283848045, -0.11540080534183408, -0.1927039654268901, -0.02916907628180131, -0.11151453835642816, -0.147480758110258, 0.4095273901747675, 0.25923895643902695, 0.21726461670493485, 0.11566677848341023, 0.3369896222134317, 0.007549748606123458, 0.15052477183030968, 0.06479169649225427, 0.20248588621776936, 0.021697585813529874, 0.11158257400281585, -0.17432947968930307, 0.05523470981435501, 0.041353109866287915]
|
1,803.05983
|
Unraveling Go gaming nature by Ising Hamiltonian and common fate graphs:
tactics and statistics
|
Go gaming is a struggle between adversaries, black and white simple stones,
and aim to control the most Go board territory for success. Rules are simple
but Go game fighting is highly intricate. Stones placement and interaction on
board is random-appearance, likewise interaction phenomena among basic elements
in physics thermodynamics, chemistry, biology, or social issues. We model the
Go game dynamic employing an Ising model energy function, whose interaction
coefficients reflect the application of rules and tactics to build long-term
strategies. At any step of the game, the energy function of the model assesses
the control and strength of a player over the board. A close fit between
predictions of the model with actual game's scores is obtained. AlphaGo
computer is the current top Go player, but its behavior does not wholly reveal
the Go gaming nature. The Ising function allows for precisely model the
stochastic evolutions of Go gaming patterns, so, to advance the understanding
on Go own-dynamic -beyond the player`s abilities. The analysis of the frequency
and combination of tactics shows the formation of patterns in the groups of
stones during a game, regarding the turn of each player, or if human or
computer adversaries are confronted.
|
cs.AI physics.app-ph physics.data-an
|
go gaming is a struggle between adversaries black and white simple stones and aim to control the most go board territory for success rules are simple but go game fighting is highly intricate stones placement and interaction on board is randomappearance likewise interaction phenomena among basic elements in physics thermodynamics chemistry biology or social issues we model the go game dynamic employing an ising model energy function whose interaction coefficients reflect the application of rules and tactics to build longterm strategies at any step of the game the energy function of the model assesses the control and strength of a player over the board a close fit between predictions of the model with actual games scores is obtained alphago computer is the current top go player but its behavior does not wholly reveal the go gaming nature the ising function allows for precisely model the stochastic evolutions of go gaming patterns so to advance the understanding on go owndynamic beyond the players abilities the analysis of the frequency and combination of tactics shows the formation of patterns in the groups of stones during a game regarding the turn of each player or if human or computer adversaries are confronted
|
[['go', 'gaming', 'is', 'a', 'struggle', 'between', 'adversaries', 'black', 'and', 'white', 'simple', 'stones', 'and', 'aim', 'to', 'control', 'the', 'most', 'go', 'board', 'territory', 'for', 'success', 'rules', 'are', 'simple', 'but', 'go', 'game', 'fighting', 'is', 'highly', 'intricate', 'stones', 'placement', 'and', 'interaction', 'on', 'board', 'is', 'randomappearance', 'likewise', 'interaction', 'phenomena', 'among', 'basic', 'elements', 'in', 'physics', 'thermodynamics', 'chemistry', 'biology', 'or', 'social', 'issues', 'we', 'model', 'the', 'go', 'game', 'dynamic', 'employing', 'an', 'ising', 'model', 'energy', 'function', 'whose', 'interaction', 'coefficients', 'reflect', 'the', 'application', 'of', 'rules', 'and', 'tactics', 'to', 'build', 'longterm', 'strategies', 'at', 'any', 'step', 'of', 'the', 'game', 'the', 'energy', 'function', 'of', 'the', 'model', 'assesses', 'the', 'control', 'and', 'strength', 'of', 'a', 'player', 'over', 'the', 'board', 'a', 'close', 'fit', 'between', 'predictions', 'of', 'the', 'model', 'with', 'actual', 'games', 'scores', 'is', 'obtained', 'alphago', 'computer', 'is', 'the', 'current', 'top', 'go', 'player', 'but', 'its', 'behavior', 'does', 'not', 'wholly', 'reveal', 'the', 'go', 'gaming', 'nature', 'the', 'ising', 'function', 'allows', 'for', 'precisely', 'model', 'the', 'stochastic', 'evolutions', 'of', 'go', 'gaming', 'patterns', 'so', 'to', 'advance', 'the', 'understanding', 'on', 'go', 'owndynamic', 'beyond', 'the', 'players', 'abilities', 'the', 'analysis', 'of', 'the', 'frequency', 'and', 'combination', 'of', 'tactics', 'shows', 'the', 'formation', 'of', 'patterns', 'in', 'the', 'groups', 'of', 'stones', 'during', 'a', 'game', 'regarding', 'the', 'turn', 'of', 'each', 'player', 'or', 'if', 'human', 'or', 'computer', 'adversaries', 'are', 'confronted']]
|
[-0.06509233073734437, 0.0728860571951668, -0.12003771183618728, 0.10604273131280324, -0.1048107400517627, -0.22011026244156706, 0.11272890434475133, 0.35922677870745284, -0.27222250606025555, -0.34421057334916694, 0.07709467080232645, -0.3147627980860339, -0.18659728239195866, 0.12991891623365925, -0.08344564503200617, -0.01142829772277598, 0.05166732048530718, 0.05170187320374661, 0.03403531452688166, -0.2492962604854182, 0.28463114306642695, 0.04865693678219004, 0.24984620225161958, 0.0361233951564084, 0.0668495932362293, 0.020483126589640747, -0.010288292452276963, 0.019126469359217864, -0.11238737109407952, 0.07968345803662491, 0.2467092981176134, 0.16059707048902203, 0.36113571972606306, -0.48102027050167473, -0.17220275167276525, 0.10238959525385635, 0.0943928158759, 0.10770138010999003, -0.0023702525091712093, -0.284247326919913, 0.025934695532110516, -0.1743658547783696, -0.11463615163063942, -0.029209015692399844, -0.012606161219885734, 0.033783285613857246, -0.24147682072746043, -0.032058124638488755, 0.04982158623465578, 0.08838820738273526, -0.044473695038962015, -0.09804546907260485, -0.01596523161036752, 0.26898176048002986, 0.025968032869862552, -0.008778260649668837, 0.20076148743802671, -0.21006597288491838, -0.20391558455350586, 0.3909096213020408, -0.0011920424197152787, -0.1544733384280196, 0.20410130676567592, -0.12649720538346107, -0.0965699128727405, 0.06945692555361953, 0.17050580538071805, 0.09857343954180703, -0.12681533574885429, 0.08107099762165135, -0.0052264007703675345, 0.21350740511880403, 0.030205885284027168, 0.0009072830683083704, 0.22835864031304448, 0.22000172029859222, 0.06650400157724767, 0.07641456240958293, -0.011025081512749876, -0.2002444673178311, -0.2357531534791522, -0.14102128709236225, -0.12356563249891293, 0.010059308950380933, -0.0767434822210184, -0.16713939596624658, 0.39373857799331247, 0.16715983522649344, 0.12566649957310627, 0.07314904974678976, 0.29821068070696544, 0.061842577442110795, 0.06476889697711934, 0.044236965387643594, 0.23680071028535665, 0.07278631297460175, 0.15028118257952125, -0.1925332225731522, 0.14294555783035412, 0.06133048500343306]
|
1,803.05984
|
Deep Co-Training for Semi-Supervised Image Recognition
|
In this paper, we study the problem of semi-supervised image recognition,
which is to learn classifiers using both labeled and unlabeled images. We
present Deep Co-Training, a deep learning based method inspired by the
Co-Training framework. The original Co-Training learns two classifiers on two
views which are data from different sources that describe the same instances.
To extend this concept to deep learning, Deep Co-Training trains multiple deep
neural networks to be the different views and exploits adversarial examples to
encourage view difference, in order to prevent the networks from collapsing
into each other. As a result, the co-trained networks provide different and
complementary information about the data, which is necessary for the
Co-Training framework to achieve good results. We test our method on SVHN,
CIFAR-10/100 and ImageNet datasets, and our method outperforms the previous
state-of-the-art methods by a large margin.
|
cs.CV
|
in this paper we study the problem of semisupervised image recognition which is to learn classifiers using both labeled and unlabeled images we present deep cotraining a deep learning based method inspired by the cotraining framework the original cotraining learns two classifiers on two views which are data from different sources that describe the same instances to extend this concept to deep learning deep cotraining trains multiple deep neural networks to be the different views and exploits adversarial examples to encourage view difference in order to prevent the networks from collapsing into each other as a result the cotrained networks provide different and complementary information about the data which is necessary for the cotraining framework to achieve good results we test our method on svhn cifar10100 and imagenet datasets and our method outperforms the previous stateoftheart methods by a large margin
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'semisupervised', 'image', 'recognition', 'which', 'is', 'to', 'learn', 'classifiers', 'using', 'both', 'labeled', 'and', 'unlabeled', 'images', 'we', 'present', 'deep', 'cotraining', 'a', 'deep', 'learning', 'based', 'method', 'inspired', 'by', 'the', 'cotraining', 'framework', 'the', 'original', 'cotraining', 'learns', 'two', 'classifiers', 'on', 'two', 'views', 'which', 'are', 'data', 'from', 'different', 'sources', 'that', 'describe', 'the', 'same', 'instances', 'to', 'extend', 'this', 'concept', 'to', 'deep', 'learning', 'deep', 'cotraining', 'trains', 'multiple', 'deep', 'neural', 'networks', 'to', 'be', 'the', 'different', 'views', 'and', 'exploits', 'adversarial', 'examples', 'to', 'encourage', 'view', 'difference', 'in', 'order', 'to', 'prevent', 'the', 'networks', 'from', 'collapsing', 'into', 'each', 'other', 'as', 'a', 'result', 'the', 'cotrained', 'networks', 'provide', 'different', 'and', 'complementary', 'information', 'about', 'the', 'data', 'which', 'is', 'necessary', 'for', 'the', 'cotraining', 'framework', 'to', 'achieve', 'good', 'results', 'we', 'test', 'our', 'method', 'on', 'svhn', 'cifar10100', 'and', 'imagenet', 'datasets', 'and', 'our', 'method', 'outperforms', 'the', 'previous', 'stateoftheart', 'methods', 'by', 'a', 'large', 'margin']]
|
[0.02054958956848298, -0.0530150758534936, -0.08968999260770423, 0.08056104826807443, -0.1317412585693611, -0.17071364803040134, 0.03133983293498334, 0.4535213537780302, -0.28010503931769304, -0.3377751523894923, 0.04058299693445276, -0.29541731588542464, -0.21131293205544352, 0.20178601930716208, -0.15938391965547843, 0.057601904356852175, 0.1623398820703317, 0.03403240104359741, -0.059499722178692795, -0.33926012887220297, 0.3532173424876029, 0.009043386895167973, 0.3896842070389539, 0.010073970993315536, 0.16761680901150353, -0.056728689309342634, -0.021106931405042165, -0.0016499449914720442, -0.053078674159405634, 0.2200410301555946, 0.3317782711520392, 0.24656384368427098, 0.34601565293102926, -0.40675143733720426, -0.23805050420840937, 0.09080659604431796, 0.10584560032335243, 0.15653265171328842, -0.01588427680710863, -0.3925611577728497, 0.11009986529658948, -0.1450008699470865, 0.07137910832784006, -0.18764727645237664, -0.10122849409318795, 0.003046110104436853, -0.3296026723891763, -0.002261171696175422, 0.1002814578291561, 0.026961732808766622, -0.06587775940341609, -0.13955372999355728, 0.05614882087268468, 0.16993627062059075, 0.04045594617990511, 0.09000690572179987, 0.11065865636670164, -0.1906571697077847, -0.17168204547404978, 0.3054361205215433, -0.07533302310039289, -0.18325295565383776, 0.22098146478944858, 0.018124046778705504, -0.16314267319560583, 0.08921206745019715, 0.27376789190623513, 0.16057460098859988, -0.1768072078104264, -0.047176692547093675, -0.09027299871002989, 0.15637856825653995, 0.04901554887349318, -0.03933567355852574, 0.15445798880287578, 0.2898091980767536, 0.004833202067363475, 0.15892901085441866, -0.17615564909065143, -0.06390795141258943, -0.20733069252996106, -0.05303386761141675, -0.21143274376933863, -0.04733248902484775, -0.13016740018449907, -0.10272469817022543, 0.3970531946846417, 0.27524413070308845, 0.2594183817406052, 0.1482195392874668, 0.36101547488277513, -0.024727181171432935, 0.14344976860489364, 0.10894851326676351, 0.19652573716011829, 0.01957891845876085, 0.12067004522042615, -0.13548331043899192, 0.0297910795347499, 0.06691530683144395]
|
1,803.05985
|
EEG machine learning with Higuchi fractal dimension and Sample Entropy
as features for successful detection of depression
|
Reliable diagnosis of depressive disorder is essential for both optimal
treatment and prevention of fatal outcomes. In this study, we aimed to
elucidate the effectiveness of two non-linear measures, Higuchi Fractal
Dimension (HFD) and Sample Entropy (SampEn), in detecting depressive disorders
when applied on EEG. HFD and SampEn of EEG signals were used as features for
seven machine learning algorithms including Multilayer Perceptron, Logistic
Regression, Support Vector Machines with the linear and polynomial kernel,
Decision Tree, Random Forest, and Naive Bayes classifier, discriminating EEG
between healthy control subjects and patients diagnosed with depression. We
confirmed earlier observations that both non-linear measures can discriminate
EEG signals of patients from healthy control subjects. The results suggest that
good classification is possible even with a small number of principal
components. Average accuracy among classifiers ranged from 90.24% to 97.56%.
Among the two measures, SampEn had better performance. Using HFD and SampEn and
a variety of machine learning techniques we can accurately discriminate
patients diagnosed with depression vs controls which can serve as a highly
sensitive, clinically relevant marker for the diagnosis of depressive
disorders.
|
stat.ML cs.LG q-bio.NC
|
reliable diagnosis of depressive disorder is essential for both optimal treatment and prevention of fatal outcomes in this study we aimed to elucidate the effectiveness of two nonlinear measures higuchi fractal dimension hfd and sample entropy sampen in detecting depressive disorders when applied on eeg hfd and sampen of eeg signals were used as features for seven machine learning algorithms including multilayer perceptron logistic regression support vector machines with the linear and polynomial kernel decision tree random forest and naive bayes classifier discriminating eeg between healthy control subjects and patients diagnosed with depression we confirmed earlier observations that both nonlinear measures can discriminate eeg signals of patients from healthy control subjects the results suggest that good classification is possible even with a small number of principal components average accuracy among classifiers ranged from 9024 to 9756 among the two measures sampen had better performance using hfd and sampen and a variety of machine learning techniques we can accurately discriminate patients diagnosed with depression vs controls which can serve as a highly sensitive clinically relevant marker for the diagnosis of depressive disorders
|
[['reliable', 'diagnosis', 'of', 'depressive', 'disorder', 'is', 'essential', 'for', 'both', 'optimal', 'treatment', 'and', 'prevention', 'of', 'fatal', 'outcomes', 'in', 'this', 'study', 'we', 'aimed', 'to', 'elucidate', 'the', 'effectiveness', 'of', 'two', 'nonlinear', 'measures', 'higuchi', 'fractal', 'dimension', 'hfd', 'and', 'sample', 'entropy', 'sampen', 'in', 'detecting', 'depressive', 'disorders', 'when', 'applied', 'on', 'eeg', 'hfd', 'and', 'sampen', 'of', 'eeg', 'signals', 'were', 'used', 'as', 'features', 'for', 'seven', 'machine', 'learning', 'algorithms', 'including', 'multilayer', 'perceptron', 'logistic', 'regression', 'support', 'vector', 'machines', 'with', 'the', 'linear', 'and', 'polynomial', 'kernel', 'decision', 'tree', 'random', 'forest', 'and', 'naive', 'bayes', 'classifier', 'discriminating', 'eeg', 'between', 'healthy', 'control', 'subjects', 'and', 'patients', 'diagnosed', 'with', 'depression', 'we', 'confirmed', 'earlier', 'observations', 'that', 'both', 'nonlinear', 'measures', 'can', 'discriminate', 'eeg', 'signals', 'of', 'patients', 'from', 'healthy', 'control', 'subjects', 'the', 'results', 'suggest', 'that', 'good', 'classification', 'is', 'possible', 'even', 'with', 'a', 'small', 'number', 'of', 'principal', 'components', 'average', 'accuracy', 'among', 'classifiers', 'ranged', 'from', '9024', 'to', '9756', 'among', 'the', 'two', 'measures', 'sampen', 'had', 'better', 'performance', 'using', 'hfd', 'and', 'sampen', 'and', 'a', 'variety', 'of', 'machine', 'learning', 'techniques', 'we', 'can', 'accurately', 'discriminate', 'patients', 'diagnosed', 'with', 'depression', 'vs', 'controls', 'which', 'can', 'serve', 'as', 'a', 'highly', 'sensitive', 'clinically', 'relevant', 'marker', 'for', 'the', 'diagnosis', 'of', 'depressive', 'disorders']]
|
[-0.02601172527920928, 0.07116479625107298, -0.06834303284352079, 0.11516363465276068, -0.06781216605581879, -0.2691548861208171, 0.08097702043532337, 0.3847324205716835, -0.18345930070220107, -0.2701529655631282, 0.11114085476217761, -0.3418843599180408, -0.21444341925214666, 0.2279172128625825, -0.12412592684284099, 0.10593843118812457, 0.09137824858224936, 0.07225027584306155, 0.0004919253206729519, -0.2841780403923521, 0.26554766487303183, 0.03137801303425341, 0.36597135421197385, -0.00247548148550546, 0.07536164508514731, 0.017124536020156428, -0.05495732177295902, 0.04349805553603238, -0.023361137058751178, 0.08867059583719099, 0.40279732841499233, 0.18967291461020833, 0.3652067473621329, -0.369511342648401, -0.24052629148837137, 0.1510977502912283, 0.1009905908825339, 0.05414275528582647, 0.022371278424201873, -0.3504457674169326, 0.10431699314796576, -0.10960542843535605, -0.05045041086754211, -0.13623281413925944, -0.01912094987491506, -0.016480416156613983, -0.31634045094869084, 0.16505257631857875, -0.017240089123801056, 0.17528797149689077, -0.10650340981719737, -0.1421553210062052, -0.006262561366816169, 0.1858816584303669, 0.06928526360325474, 0.05508677082300927, 0.1800758989800529, -0.16120454597734532, -0.1834714227119327, 0.27167956683095235, -0.015834339343793486, -0.1678155440726518, 0.2508391201063908, -0.06002779002494348, -0.12802546663474784, 0.0853298083668091, 0.24034342124224614, 0.03491237892084935, -0.17942100066541455, -0.09305475499398635, 0.06881881310625095, 0.17556728153021295, 0.06326989028654292, -0.05586135191572779, 0.12188163431726642, 0.19780098298405044, -0.03614949089902207, 0.12084100817880743, -0.15632557248032924, 0.010647038358986604, -0.20290044877480057, -0.11843175251160373, -0.12468243307608967, 0.020027684033025076, -0.1528583211143815, -0.17134996839588024, 0.413449638763067, 0.17227616886291858, 0.1453009699767157, 0.0893437230492587, 0.24083840735874124, 0.01996812814440146, 0.08154542659774669, 0.05348017151359448, 0.1791364910635449, 0.1079605390511978, 0.04439876563538339, -0.2354641185387794, 0.16200366468318012, -0.003672400121068973]
|
1,803.05986
|
A Review of Empirical Applications on Food Waste Prevention & Management
|
Food waste has a significant detrimental economic, environmental and social
impact. Recent efforts in HCI re-search have examined ways of influencing
surplus food waste management. In this paper, we conduct a research survey to
investigate and compare the effectiveness of existing approaches in food waste
management throughout its lifecycle from agricultural production, post-harvest
handling and storage, processing, distribution and consumption. The objectives
of the survey are 1) to identify methods in food waste management, 2) their
area of focus, 3) the ICT techniques they apply, 4) and the food waste
lifecycle they target. In addition, we analyse if 5) they provide an open
access API for food waste data analysis. Based on the literature analysis, we
then highlight their pros and cons with respect to applications in food waste
management. The implications of this research could present a new opportunity
for interested stack-holders and future technologies to play a key role in
reducing domestic and national food waste.
|
cs.CY cs.HC
|
food waste has a significant detrimental economic environmental and social impact recent efforts in hci research have examined ways of influencing surplus food waste management in this paper we conduct a research survey to investigate and compare the effectiveness of existing approaches in food waste management throughout its lifecycle from agricultural production postharvest handling and storage processing distribution and consumption the objectives of the survey are 1 to identify methods in food waste management 2 their area of focus 3 the ict techniques they apply 4 and the food waste lifecycle they target in addition we analyse if 5 they provide an open access api for food waste data analysis based on the literature analysis we then highlight their pros and cons with respect to applications in food waste management the implications of this research could present a new opportunity for interested stackholders and future technologies to play a key role in reducing domestic and national food waste
|
[['food', 'waste', 'has', 'a', 'significant', 'detrimental', 'economic', 'environmental', 'and', 'social', 'impact', 'recent', 'efforts', 'in', 'hci', 'research', 'have', 'examined', 'ways', 'of', 'influencing', 'surplus', 'food', 'waste', 'management', 'in', 'this', 'paper', 'we', 'conduct', 'a', 'research', 'survey', 'to', 'investigate', 'and', 'compare', 'the', 'effectiveness', 'of', 'existing', 'approaches', 'in', 'food', 'waste', 'management', 'throughout', 'its', 'lifecycle', 'from', 'agricultural', 'production', 'postharvest', 'handling', 'and', 'storage', 'processing', 'distribution', 'and', 'consumption', 'the', 'objectives', 'of', 'the', 'survey', 'are', '1', 'to', 'identify', 'methods', 'in', 'food', 'waste', 'management', '2', 'their', 'area', 'of', 'focus', '3', 'the', 'ict', 'techniques', 'they', 'apply', '4', 'and', 'the', 'food', 'waste', 'lifecycle', 'they', 'target', 'in', 'addition', 'we', 'analyse', 'if', '5', 'they', 'provide', 'an', 'open', 'access', 'api', 'for', 'food', 'waste', 'data', 'analysis', 'based', 'on', 'the', 'literature', 'analysis', 'we', 'then', 'highlight', 'their', 'pros', 'and', 'cons', 'with', 'respect', 'to', 'applications', 'in', 'food', 'waste', 'management', 'the', 'implications', 'of', 'this', 'research', 'could', 'present', 'a', 'new', 'opportunity', 'for', 'interested', 'stackholders', 'and', 'future', 'technologies', 'to', 'play', 'a', 'key', 'role', 'in', 'reducing', 'domestic', 'and', 'national', 'food', 'waste']]
|
[-0.03968149877171247, 0.04122526310498077, -0.035179507524634786, 0.0813431106074952, -0.0830129844088776, -0.0925033010679703, 0.0991427984128957, 0.3977921620393411, -0.2475061757125868, -0.3156722576453691, 0.18145375556196086, -0.3570808257298687, -0.10887723602653028, 0.21061472185642627, -0.15548300488481823, 0.012511300633121163, 0.07657913567471461, -0.012874579112133525, 0.024007310572181806, -0.30489180739431715, 0.24844096187287226, 0.10503786753934737, 0.4048733790233457, 0.16297261506723515, 0.045593337676016234, -0.032202361979915835, -0.14669159365308962, -0.08583658077240659, -0.12509140037143832, 0.19992995822133544, 0.42003038679607785, 0.2627044160080214, 0.41253589364723897, -0.5010595113898699, -0.21185123936373154, 0.14843394548202363, 0.13395961908659396, 0.029032568745792676, -0.12054088169138712, -0.22530912439852285, 0.04937716842836474, -0.2798825647855082, -0.13153552184573924, -0.09667965049783771, 0.028981817008640904, 0.05329582354244895, -0.16364949961336187, 0.007215940235302043, 0.0007163873479629939, 0.14474786800565198, -0.11450168792268811, -0.16634374929186052, -0.010305793664883822, 0.25298603629758315, 0.09218582595274664, -0.05485060893652889, 0.22018634978060922, -0.20211083194217047, -0.1262173888658603, 0.4092723139537833, 0.01216059800488158, -0.13534998373152354, 0.17301384071395612, -0.04940543092864876, -0.22761407723942867, 0.050615605434032686, 0.2832881703029554, 0.017599695465133455, -0.22482284881138745, 0.05229970557579341, 0.07988133651461118, 0.12021509393563089, 0.04276083737838631, 0.02683389716101094, 0.2086407771357932, 0.25731714237003755, 0.12053073106560475, 0.1806072016658548, -0.059092566590362154, -0.10103880109575887, -0.18498534496085575, -0.18509668110905644, -0.04498419101732091, 0.04202742410919969, -0.023915715747697946, -0.09184680005702643, 0.35830478933759224, 0.2020803487035804, 0.07323694486135188, -0.04605949171579992, 0.3324041097627905, -0.055388048416576706, 0.07705204012111211, 0.05910387079720982, 0.13594004037590005, -0.03130342732840337, 0.2327383145248183, -0.20069749061188374, 0.12234229015601346, -0.06473542689286077]
|
1,803.05987
|
Enhanced navigation systems in GPS denied environments for visually
impaired people: A Survey
|
Although outdoor navigation systems are mostly dependent on GPS, indoor
systems have to rely upon different techniques for localizing the user, due to
unavailability of GPS signals in indoor environments. Over the past decade
various indoor navigation systems have been developed. In this paper an
overview of some existing indoor navigation systems for visually impaired
people are presented and they are compared from different perspectives. The
evaluated techniques are ultrasonic systems, RFID-based solutions, computer
vision aided navigation systems, ans smartphone-based applications.
|
cs.CY
|
although outdoor navigation systems are mostly dependent on gps indoor systems have to rely upon different techniques for localizing the user due to unavailability of gps signals in indoor environments over the past decade various indoor navigation systems have been developed in this paper an overview of some existing indoor navigation systems for visually impaired people are presented and they are compared from different perspectives the evaluated techniques are ultrasonic systems rfidbased solutions computer vision aided navigation systems ans smartphonebased applications
|
[['although', 'outdoor', 'navigation', 'systems', 'are', 'mostly', 'dependent', 'on', 'gps', 'indoor', 'systems', 'have', 'to', 'rely', 'upon', 'different', 'techniques', 'for', 'localizing', 'the', 'user', 'due', 'to', 'unavailability', 'of', 'gps', 'signals', 'in', 'indoor', 'environments', 'over', 'the', 'past', 'decade', 'various', 'indoor', 'navigation', 'systems', 'have', 'been', 'developed', 'in', 'this', 'paper', 'an', 'overview', 'of', 'some', 'existing', 'indoor', 'navigation', 'systems', 'for', 'visually', 'impaired', 'people', 'are', 'presented', 'and', 'they', 'are', 'compared', 'from', 'different', 'perspectives', 'the', 'evaluated', 'techniques', 'are', 'ultrasonic', 'systems', 'rfidbased', 'solutions', 'computer', 'vision', 'aided', 'navigation', 'systems', 'ans', 'smartphonebased', 'applications']]
|
[-0.17877531479354258, 0.026543928766055436, -0.023593416552484772, 0.0189000655606642, -0.06509282203092251, -0.16772762092727203, -0.05196064027144148, 0.48203099198225474, -0.16380766737792227, -0.34401764644792787, 0.18406498905006843, -0.2943441029523074, -0.23170136352196152, 0.34217449746175127, -0.197818133060211, 0.13745026141663808, 0.08710866731901963, 0.022585318734248478, -0.05197081868508026, -0.24955110297319882, 0.24587213372190794, 0.02522229139957531, 0.3550113678024507, 0.009327843181650948, 0.0999362035482018, 0.008923283128504768, -0.06843978284720194, -0.04354792092869311, -0.022996610346721645, 0.15365457192155313, 0.4348780913853351, 0.187236617402645, 0.26356070457072356, -0.45405508706599107, -0.327123865749641, 0.07090001878685054, 0.2068065805044485, 0.09319738183676461, -0.10525371653550983, -0.47629795500571714, 0.11480678136483478, -0.22936768020951637, -0.03383577982952565, -0.051984571018198755, 0.021320249333425804, 0.1054901903104267, -0.1887103310027332, -0.027515077233360507, -0.05068837729121708, 0.22245470280356613, -0.10440479970916554, -0.09749038466884766, 0.11342301494930583, 0.26992895701874253, 0.03173707279572149, -0.02810951514330543, 0.22492358274757862, -0.14985131776178784, -0.17165559595220803, 0.4235349481948364, 0.10247221139524086, -0.2062029767045636, 0.3596969064739015, -0.0011433493116019685, -0.14330193103164618, 0.1083317949137662, 0.3107834471918551, 0.1302830077259353, -0.24390379138244891, 0.04636189482321411, 0.011704648313124054, 0.11254004585085275, 0.066537230356056, 0.07080013954575047, 0.20840776615120746, 0.20422316582034122, 0.10048926529118124, 0.0040612433013724695, -0.0705332029927062, -0.09566387149539811, -0.09804463790324344, -0.053329654664583045, -0.13787072823946306, -0.05116114400781369, -0.002698761750016948, -0.0770684735228618, 0.3191634777151508, 0.3062445993109802, 0.09597659672116056, 0.04147087266944625, 0.40619245714243546, 0.02926804986494927, 0.04560976723829905, 0.046630455911113526, 0.18435858869472416, -0.003748126971868821, 0.2619551038412653, -0.11615504978086662, 0.07199928413984584, -0.010925684239209435]
|
1,803.05988
|
Research on Cross-platform Measurement method of online Advertising
|
There are a large number of competing ADXs on the Internet. It is the primary
demand to identify and compare the advertising performance of ADX. Traditional
method relies on training artificial online personas to represent behavioral
traits. Then it uncovers existing correlation between users each exhibiting a
certain behavioral trait and the display ads shown to them. This approach only
measures and evaluates the performance of a single ADX. Due to without common
measurement basis, this method does not able to apply to the comparative study
of the performance of multiple ADXs. Therefore, in this tech report, a
synchronous cross-platform measurement method is proposed and implemented. This
method can realize the comparison of the performance of different ADXs, and
help advertisers select the appropriate ADX.
|
cs.CY
|
there are a large number of competing adxs on the internet it is the primary demand to identify and compare the advertising performance of adx traditional method relies on training artificial online personas to represent behavioral traits then it uncovers existing correlation between users each exhibiting a certain behavioral trait and the display ads shown to them this approach only measures and evaluates the performance of a single adx due to without common measurement basis this method does not able to apply to the comparative study of the performance of multiple adxs therefore in this tech report a synchronous crossplatform measurement method is proposed and implemented this method can realize the comparison of the performance of different adxs and help advertisers select the appropriate adx
|
[['there', 'are', 'a', 'large', 'number', 'of', 'competing', 'adxs', 'on', 'the', 'internet', 'it', 'is', 'the', 'primary', 'demand', 'to', 'identify', 'and', 'compare', 'the', 'advertising', 'performance', 'of', 'adx', 'traditional', 'method', 'relies', 'on', 'training', 'artificial', 'online', 'personas', 'to', 'represent', 'behavioral', 'traits', 'then', 'it', 'uncovers', 'existing', 'correlation', 'between', 'users', 'each', 'exhibiting', 'a', 'certain', 'behavioral', 'trait', 'and', 'the', 'display', 'ads', 'shown', 'to', 'them', 'this', 'approach', 'only', 'measures', 'and', 'evaluates', 'the', 'performance', 'of', 'a', 'single', 'adx', 'due', 'to', 'without', 'common', 'measurement', 'basis', 'this', 'method', 'does', 'not', 'able', 'to', 'apply', 'to', 'the', 'comparative', 'study', 'of', 'the', 'performance', 'of', 'multiple', 'adxs', 'therefore', 'in', 'this', 'tech', 'report', 'a', 'synchronous', 'crossplatform', 'measurement', 'method', 'is', 'proposed', 'and', 'implemented', 'this', 'method', 'can', 'realize', 'the', 'comparison', 'of', 'the', 'performance', 'of', 'different', 'adxs', 'and', 'help', 'advertisers', 'select', 'the', 'appropriate', 'adx']]
|
[-0.1062640845021233, 0.007084243021905422, -0.09016785927303135, 0.05767651678016409, -0.1275898410566151, -0.18658277844637633, 0.09440157132595778, 0.4036009228527546, -0.23633375182084274, -0.32262686333432794, 0.06043858386296779, -0.2712827600687742, -0.18739676436781882, 0.20355025382339956, -0.11579397952288854, 0.038951288972049955, 0.07433166816458106, 0.07557744889706373, -0.0338991559476126, -0.27646038875542583, 0.29498772752285, 0.04440077596157789, 0.37369392021000386, 0.04157159793004393, 0.09339754300191999, -0.010713691741693765, -0.07736275973543524, -0.005276063121855259, -0.07567927609570324, 0.16480885185673833, 0.28711239340901373, 0.198023947365582, 0.34776103319227697, -0.367013189047575, -0.16288969353213906, 0.12723994859308005, 0.10958493614569306, 0.0729904247932136, -0.023889783324673772, -0.28630458353832366, 0.10093694111797959, -0.18908463701605796, -0.0510217526294291, -0.12149048578366638, -0.04698244310170412, 0.02673007933003828, -0.27453582919202746, 0.0037075178646482528, 0.005422477383166552, 0.056996574521064755, -0.029373892109841107, -0.07985571399331093, -0.003597821481525898, 0.18516220838204026, 0.07841467144712806, 0.009492274643853306, 0.12091820330917835, -0.09049936914071441, -0.1410191961559467, 0.37005265107750895, -0.022846085980534555, -0.19626094544678926, 0.2465701684951782, -0.08628767358325422, -0.10998174859117717, 0.08487103173881769, 0.21274015018343925, 0.10535253934934735, -0.17722984934970737, 0.007326919886749238, -0.020758931340649725, 0.210171946182847, 0.02802254499681294, 0.014341965585947037, 0.16825979551672934, 0.20664047753810882, 0.051389733178541064, 0.12311145131947705, -0.0725510155132506, -0.08208256323635578, -0.20115593356313183, -0.1673424337748438, -0.16323071388714017, 0.014520085645955987, -0.07572078446985687, -0.1831471267126035, 0.41031715623289344, 0.23149771385639906, 0.15569383813813328, 0.05720821648836136, 0.320252788901329, 0.04047434172593057, 0.09772920718044042, 0.04906492254137993, 0.20035130774974824, 0.0005872840732336044, 0.13621886440366507, -0.23883653999865054, 0.11257521548494696, 0.010255519434809684]
|
1,803.05989
|
Positional ordering of hard adsorbate particles in tubular nanopores
|
The phase behaviour and structural properties of a monolayer of hard
particles is examined in such a confinement, where the adsorbed particles are
constrained to the surface of a narrow hard cylindrical pore. The diameter of
the pore is chosen such that only first and second neighbour interactions occur
between the hard particles. The transfer operator method of Percus and Zhang
[Mol. Phys., 69, 347 (1990)] is reformulated to obtain information about the
structure of the monolayer. We have found that a true phase transition is not
possible in the examined range of pore diameters. The monolayer of hard spheres
undergoes a structural change from fluid-like order to a zigzag-like solid one
with increasing surface density. The case of hard cylinders is different in the
sense that a layering takes place continuously between a low density one-row
and a high density two-row monolayer. Our results reveal a clear discrepancy
with classical density functional theories, which do not distinguish
smectic-like ordering in bulk from that in narrow periodic pores.
|
cond-mat.soft cond-mat.stat-mech
|
the phase behaviour and structural properties of a monolayer of hard particles is examined in such a confinement where the adsorbed particles are constrained to the surface of a narrow hard cylindrical pore the diameter of the pore is chosen such that only first and second neighbour interactions occur between the hard particles the transfer operator method of percus and zhang mol phys 69 347 1990 is reformulated to obtain information about the structure of the monolayer we have found that a true phase transition is not possible in the examined range of pore diameters the monolayer of hard spheres undergoes a structural change from fluidlike order to a zigzaglike solid one with increasing surface density the case of hard cylinders is different in the sense that a layering takes place continuously between a low density onerow and a high density tworow monolayer our results reveal a clear discrepancy with classical density functional theories which do not distinguish smecticlike ordering in bulk from that in narrow periodic pores
|
[['the', 'phase', 'behaviour', 'and', 'structural', 'properties', 'of', 'a', 'monolayer', 'of', 'hard', 'particles', 'is', 'examined', 'in', 'such', 'a', 'confinement', 'where', 'the', 'adsorbed', 'particles', 'are', 'constrained', 'to', 'the', 'surface', 'of', 'a', 'narrow', 'hard', 'cylindrical', 'pore', 'the', 'diameter', 'of', 'the', 'pore', 'is', 'chosen', 'such', 'that', 'only', 'first', 'and', 'second', 'neighbour', 'interactions', 'occur', 'between', 'the', 'hard', 'particles', 'the', 'transfer', 'operator', 'method', 'of', 'percus', 'and', 'zhang', 'mol', 'phys', '69', '347', '1990', 'is', 'reformulated', 'to', 'obtain', 'information', 'about', 'the', 'structure', 'of', 'the', 'monolayer', 'we', 'have', 'found', 'that', 'a', 'true', 'phase', 'transition', 'is', 'not', 'possible', 'in', 'the', 'examined', 'range', 'of', 'pore', 'diameters', 'the', 'monolayer', 'of', 'hard', 'spheres', 'undergoes', 'a', 'structural', 'change', 'from', 'fluidlike', 'order', 'to', 'a', 'zigzaglike', 'solid', 'one', 'with', 'increasing', 'surface', 'density', 'the', 'case', 'of', 'hard', 'cylinders', 'is', 'different', 'in', 'the', 'sense', 'that', 'a', 'layering', 'takes', 'place', 'continuously', 'between', 'a', 'low', 'density', 'onerow', 'and', 'a', 'high', 'density', 'tworow', 'monolayer', 'our', 'results', 'reveal', 'a', 'clear', 'discrepancy', 'with', 'classical', 'density', 'functional', 'theories', 'which', 'do', 'not', 'distinguish', 'smecticlike', 'ordering', 'in', 'bulk', 'from', 'that', 'in', 'narrow', 'periodic', 'pores']]
|
[-0.11214991513545447, 0.18785257732018917, -0.08459553018751433, 0.029742167792088974, -0.03270758023288744, -0.11933588104078635, 0.05691347643317256, 0.39878929373142974, -0.2531235538091486, -0.324452786961393, 0.03461979142697861, -0.27306641272956594, -0.15393419830001048, 0.08232311799448715, -0.011231678842921696, 0.01886312038515739, 0.002465198061794841, 0.0001654137837855766, -0.10197997103213788, -0.18704934822549799, 0.24144919149278263, 0.0073483859887346625, 0.25970795594288837, 0.09779931230323632, 0.06723342051104521, 0.004420083263323163, 0.06612832977719206, 0.07403011027712464, -0.18319012923529954, 0.0837874606368132, 0.21435315366501786, -0.015326099883254972, 0.22215587161675407, -0.4167032362837788, -0.23029011777697678, 0.05945059550798587, 0.10539937675154458, 0.07399263632569705, -0.024182171582998263, -0.23862696186656, 0.076247260587046, -0.13237280292447567, -0.11649527702857518, -0.017465162720154262, 0.054492215039707456, 0.025340790946280493, -0.22764767942100575, 0.12468329736258879, 0.07338131767686545, 0.02558598852816171, -0.07429922968038313, -0.10061748693918898, -0.07545025103553642, 0.11459230322257749, 0.03853972560110768, 0.041904598879877346, 0.176598712000885, -0.11566872090110164, -0.04775678144263414, 0.40546982345126925, -0.030196817067224487, -0.1398933727316381, 0.24105723755339914, -0.18600913893689203, -0.09641807476111267, 0.21810661593917757, 0.13303464202077261, 0.12448434888695677, -0.11181511754382102, 0.07048730602660466, -0.0581146204148397, 0.23562241020789815, 0.10549874057358552, -0.01823249722725623, 0.21632287866149064, 0.16925510180659503, 0.048598367578095006, 0.14989496616596756, -0.11721724937559061, -0.10046411742743137, -0.2536844706074113, -0.19739318737715839, -0.22374403646972496, 0.03802473229855726, -0.08992624914089035, -0.21468460565942915, 0.33744104213768705, 0.07470385120021612, 0.2295160824543841, -0.008133442988591491, 0.2087419202732798, 0.07099068845924367, 0.05175978552904867, 0.05861943586829251, 0.274127287081986, 0.16925549611221954, 0.11212408849193405, -0.1878719305097461, 0.04751885306212075, 0.03432650911799144]
|
1,803.0599
|
Discovering Users Topic of Interest from Tweet
|
Nowadays social media has become one of the largest gatherings of people in
online. There are many ways for the industries to promote their products to the
public through advertising. The variety of advertisement is increasing
dramatically. Businessmen are so much dependent on the advertisement that
significantly it really brought out success in the market and hence practiced
by major industries. Thus, companies are trying hard to draw the attention of
customers on social networks through online advertisement. One of the most
popular social media is Twitter which is popular for short text sharing named
Tweet. People here create their profile with basic information. To ensure the
advertisements are shown to relative people, Twitter targets people based on
language, gender, interest, follower, device, behavior, tailored audiences,
keyword, and geography targeting. Twitter generates interest sets based on
their activities on Twitter. What our framework does is that it determines the
topic of interest from a given list of Tweets if it has any. This process is
called Entity Intersect Categorizing Value (EICV). Each category topic
generates a set of words or phrases related to that topic. An entity set is
created from processing tweets by keyword generation and Twitters data using
Twitter API. Value of entities is matched with the set of categories. If they
cross a threshold value, it results in the category which matched the desired
interest category. For smaller amounts of data sizes, the results show that our
framework performs with higher accuracy rate.
|
cs.CY cs.IR
|
nowadays social media has become one of the largest gatherings of people in online there are many ways for the industries to promote their products to the public through advertising the variety of advertisement is increasing dramatically businessmen are so much dependent on the advertisement that significantly it really brought out success in the market and hence practiced by major industries thus companies are trying hard to draw the attention of customers on social networks through online advertisement one of the most popular social media is twitter which is popular for short text sharing named tweet people here create their profile with basic information to ensure the advertisements are shown to relative people twitter targets people based on language gender interest follower device behavior tailored audiences keyword and geography targeting twitter generates interest sets based on their activities on twitter what our framework does is that it determines the topic of interest from a given list of tweets if it has any this process is called entity intersect categorizing value eicv each category topic generates a set of words or phrases related to that topic an entity set is created from processing tweets by keyword generation and twitters data using twitter api value of entities is matched with the set of categories if they cross a threshold value it results in the category which matched the desired interest category for smaller amounts of data sizes the results show that our framework performs with higher accuracy rate
|
[['nowadays', 'social', 'media', 'has', 'become', 'one', 'of', 'the', 'largest', 'gatherings', 'of', 'people', 'in', 'online', 'there', 'are', 'many', 'ways', 'for', 'the', 'industries', 'to', 'promote', 'their', 'products', 'to', 'the', 'public', 'through', 'advertising', 'the', 'variety', 'of', 'advertisement', 'is', 'increasing', 'dramatically', 'businessmen', 'are', 'so', 'much', 'dependent', 'on', 'the', 'advertisement', 'that', 'significantly', 'it', 'really', 'brought', 'out', 'success', 'in', 'the', 'market', 'and', 'hence', 'practiced', 'by', 'major', 'industries', 'thus', 'companies', 'are', 'trying', 'hard', 'to', 'draw', 'the', 'attention', 'of', 'customers', 'on', 'social', 'networks', 'through', 'online', 'advertisement', 'one', 'of', 'the', 'most', 'popular', 'social', 'media', 'is', 'twitter', 'which', 'is', 'popular', 'for', 'short', 'text', 'sharing', 'named', 'tweet', 'people', 'here', 'create', 'their', 'profile', 'with', 'basic', 'information', 'to', 'ensure', 'the', 'advertisements', 'are', 'shown', 'to', 'relative', 'people', 'twitter', 'targets', 'people', 'based', 'on', 'language', 'gender', 'interest', 'follower', 'device', 'behavior', 'tailored', 'audiences', 'keyword', 'and', 'geography', 'targeting', 'twitter', 'generates', 'interest', 'sets', 'based', 'on', 'their', 'activities', 'on', 'twitter', 'what', 'our', 'framework', 'does', 'is', 'that', 'it', 'determines', 'the', 'topic', 'of', 'interest', 'from', 'a', 'given', 'list', 'of', 'tweets', 'if', 'it', 'has', 'any', 'this', 'process', 'is', 'called', 'entity', 'intersect', 'categorizing', 'value', 'eicv', 'each', 'category', 'topic', 'generates', 'a', 'set', 'of', 'words', 'or', 'phrases', 'related', 'to', 'that', 'topic', 'an', 'entity', 'set', 'is', 'created', 'from', 'processing', 'tweets', 'by', 'keyword', 'generation', 'and', 'twitters', 'data', 'using', 'twitter', 'api', 'value', 'of', 'entities', 'is', 'matched', 'with', 'the', 'set', 'of', 'categories', 'if', 'they', 'cross', 'a', 'threshold', 'value', 'it', 'results', 'in', 'the', 'category', 'which', 'matched', 'the', 'desired', 'interest', 'category', 'for', 'smaller', 'amounts', 'of', 'data', 'sizes', 'the', 'results', 'show', 'that', 'our', 'framework', 'performs', 'with', 'higher', 'accuracy', 'rate']]
|
[-0.0605913940223162, 0.062102466183940275, -0.05367155400085814, 0.0999780000722388, -0.19670250474342277, -0.14743941223239337, 0.08720112599584522, 0.4511607108124513, -0.2591277630548278, -0.3095116948062668, 0.09134175402672999, -0.39410202771909913, -0.15230268245486886, 0.21197421632835414, -0.11043368033988743, -0.004069604489617335, 0.09329813104407976, 0.14891980640514166, 0.06892455445450484, -0.34882408830964445, 0.33345843856412993, 0.03160206262326362, 0.36681346805690196, 0.05919773357763544, 0.07405734548098122, -0.003852961207941954, -0.0926973329799972, -0.013163057370681543, -0.08045640473066334, 0.1699832258879074, 0.37610647325803126, 0.23317132217201347, 0.3792353103939938, -0.37029912765232886, -0.16960130000382434, 0.0922282576560974, 0.12262289329831089, 0.06962591023338788, -0.05858532940560229, -0.34644615286391, 0.09790007394693355, -0.2183821125032038, -0.012470843051845322, -0.06631936390066938, 0.0755931939939227, 0.025927013401132154, -0.2142956251891482, -0.011333879580417153, 0.006200687400194845, 0.07256702369611179, 0.019379575849909868, -0.096490858442017, -0.026936784509227287, 0.22287771901168044, 0.12839069906610293, -0.002041253788225657, 0.20553124745742285, -0.1919261111108092, -0.13199812289023277, 0.43076925039842573, -0.0009529952891170979, -0.17588904083953524, 0.17291557661884902, -0.044480609355912526, -0.1383660630693621, 0.09784099060034722, 0.2165916078134763, 0.0859651591077599, -0.1752220726800056, -0.01507052579438504, -0.08210723237134517, 0.21953811995989206, 0.09606718087796959, -0.0048673089280040285, 0.2213860793248275, 0.2104276820751173, 0.06900000657734214, 0.07704949005107795, -0.012773055777714554, -0.0868907833528914, -0.16304657153633176, -0.10319963934717281, -0.17672062930270876, 0.016755609170115572, -0.10232452872780637, -0.170460921807609, 0.3827191743847667, 0.18701274390427433, 0.15518901822328263, 0.02941028633421021, 0.2680550401944819, 0.008169842277337531, 0.11167317492773338, 0.09788941824238519, 0.1320261380635202, -0.026677414273120918, 0.1974932092051877, -0.08161018811622445, 0.16268285071211203, 0.034670188483230925]
|
1,803.05991
|
Big data analytics: The stakes for students, scientists & managers - a
management perspective
|
For a developing nation, deploying big data (BD) technology and introducing
data science in higher education is a challenge. A pessimistic scenario is:
Mis-use of data in many possible ways, waste of trained manpower, poor BD
certifications from institutes, under-utilization of resources, disgruntled
management staff, unhealthy competition in the market, poor integration with
existing technical infrastructures. Also, the questions in the minds of
students, scientists, engineers, teachers and managers deserve wider attention.
Besides the stated perceptions and analyses perhaps ignoring socio-political
and scientific temperaments in developing nations, the following questions
arise: How did the BD phenomenon naturally occur, post technological
developments in Computer and Communications Technology and how did different
experts react to it? Are academicians elsewhere agreeing on the fact that BD is
a new science? Granted that big data science is a new science what are its
foundations as compared to conventional topics in Physics, Chemistry or
Biology? Or, is it similar to astronomy or nuclear science? What are the
technological and engineering implications and how these can be advantageously
used to augment business intelligence, for example? Will the industry adopt the
changes due to tactical advantages? How can BD success stories be carried over
elsewhere? How will BD affect the Computer Science and other curricula? How
will BD benefit different segments of our society on a large scale? To answer
these, an appreciation of the BD as a science and as a technology is necessary.
This paper presents a quick BD overview, relying on the contemporary
literature; it addresses: characterizations of BD and the BD people, the
background required for the students and teachers to join the BD bandwagon, the
management challenges in embracing BD.
|
cs.CY cs.DM
|
for a developing nation deploying big data bd technology and introducing data science in higher education is a challenge a pessimistic scenario is misuse of data in many possible ways waste of trained manpower poor bd certifications from institutes underutilization of resources disgruntled management staff unhealthy competition in the market poor integration with existing technical infrastructures also the questions in the minds of students scientists engineers teachers and managers deserve wider attention besides the stated perceptions and analyses perhaps ignoring sociopolitical and scientific temperaments in developing nations the following questions arise how did the bd phenomenon naturally occur post technological developments in computer and communications technology and how did different experts react to it are academicians elsewhere agreeing on the fact that bd is a new science granted that big data science is a new science what are its foundations as compared to conventional topics in physics chemistry or biology or is it similar to astronomy or nuclear science what are the technological and engineering implications and how these can be advantageously used to augment business intelligence for example will the industry adopt the changes due to tactical advantages how can bd success stories be carried over elsewhere how will bd affect the computer science and other curricula how will bd benefit different segments of our society on a large scale to answer these an appreciation of the bd as a science and as a technology is necessary this paper presents a quick bd overview relying on the contemporary literature it addresses characterizations of bd and the bd people the background required for the students and teachers to join the bd bandwagon the management challenges in embracing bd
|
[['for', 'a', 'developing', 'nation', 'deploying', 'big', 'data', 'bd', 'technology', 'and', 'introducing', 'data', 'science', 'in', 'higher', 'education', 'is', 'a', 'challenge', 'a', 'pessimistic', 'scenario', 'is', 'misuse', 'of', 'data', 'in', 'many', 'possible', 'ways', 'waste', 'of', 'trained', 'manpower', 'poor', 'bd', 'certifications', 'from', 'institutes', 'underutilization', 'of', 'resources', 'disgruntled', 'management', 'staff', 'unhealthy', 'competition', 'in', 'the', 'market', 'poor', 'integration', 'with', 'existing', 'technical', 'infrastructures', 'also', 'the', 'questions', 'in', 'the', 'minds', 'of', 'students', 'scientists', 'engineers', 'teachers', 'and', 'managers', 'deserve', 'wider', 'attention', 'besides', 'the', 'stated', 'perceptions', 'and', 'analyses', 'perhaps', 'ignoring', 'sociopolitical', 'and', 'scientific', 'temperaments', 'in', 'developing', 'nations', 'the', 'following', 'questions', 'arise', 'how', 'did', 'the', 'bd', 'phenomenon', 'naturally', 'occur', 'post', 'technological', 'developments', 'in', 'computer', 'and', 'communications', 'technology', 'and', 'how', 'did', 'different', 'experts', 'react', 'to', 'it', 'are', 'academicians', 'elsewhere', 'agreeing', 'on', 'the', 'fact', 'that', 'bd', 'is', 'a', 'new', 'science', 'granted', 'that', 'big', 'data', 'science', 'is', 'a', 'new', 'science', 'what', 'are', 'its', 'foundations', 'as', 'compared', 'to', 'conventional', 'topics', 'in', 'physics', 'chemistry', 'or', 'biology', 'or', 'is', 'it', 'similar', 'to', 'astronomy', 'or', 'nuclear', 'science', 'what', 'are', 'the', 'technological', 'and', 'engineering', 'implications', 'and', 'how', 'these', 'can', 'be', 'advantageously', 'used', 'to', 'augment', 'business', 'intelligence', 'for', 'example', 'will', 'the', 'industry', 'adopt', 'the', 'changes', 'due', 'to', 'tactical', 'advantages', 'how', 'can', 'bd', 'success', 'stories', 'be', 'carried', 'over', 'elsewhere', 'how', 'will', 'bd', 'affect', 'the', 'computer', 'science', 'and', 'other', 'curricula', 'how', 'will', 'bd', 'benefit', 'different', 'segments', 'of', 'our', 'society', 'on', 'a', 'large', 'scale', 'to', 'answer', 'these', 'an', 'appreciation', 'of', 'the', 'bd', 'as', 'a', 'science', 'and', 'as', 'a', 'technology', 'is', 'necessary', 'this', 'paper', 'presents', 'a', 'quick', 'bd', 'overview', 'relying', 'on', 'the', 'contemporary', 'literature', 'it', 'addresses', 'characterizations', 'of', 'bd', 'and', 'the', 'bd', 'people', 'the', 'background', 'required', 'for', 'the', 'students', 'and', 'teachers', 'to', 'join', 'the', 'bd', 'bandwagon', 'the', 'management', 'challenges', 'in', 'embracing', 'bd']]
|
[-0.05896031608408324, 0.09366224652005146, -0.08768735324715127, 0.09652865158489801, -0.19143705547783887, -0.1519811334338927, 0.07990564400076342, 0.3370037183530346, -0.2582764970288916, -0.3551333521623904, 0.1361000809590719, -0.2691935837262105, -0.19217035859160878, 0.19950472020597906, -0.1875157276578651, -0.010426069260364742, 0.10687888360923553, 0.005808609249683884, -0.008488916535819763, -0.3041711436258461, 0.2515412666112023, 0.10196914883393085, 0.3108498459095169, 0.05045590758246339, -0.016281868205052744, -0.0392457747551199, -0.07852665189105601, -0.030058158583021202, -0.13638009531584203, 0.1578539225841725, 0.4126223995205728, 0.26814134010439067, 0.4096212826975174, -0.4424584013567935, -0.17676065207227043, 0.07774454101416642, 0.11550292676938395, 0.05709078308826965, -0.05879769420425873, -0.2992704241714753, 0.018094456287072333, -0.19599783390051004, -0.11143115172935952, -0.07253425105622825, 0.018874263465707107, -0.008430245302160294, -0.20928512733860027, 0.0030736922804856276, 0.02770860300362379, 0.11410386792622802, -0.013570971444454245, -0.1777449222718658, 0.03463417566296815, 0.20591919305179576, 0.05987987793353499, 0.03479042403325976, 0.17139549647535227, -0.2020484196637431, -0.15019909958674535, 0.4248191158989922, 0.03245322034855639, -0.15088614728107388, 0.24472876229207452, -0.10929384846694176, -0.16479876841542845, 0.03165274373733099, 0.2081912528851241, 0.016341492648444277, -0.1727868589986156, 0.09375046688764077, 0.05798959453499435, 0.14122581394348926, 0.06668348517268896, 0.008187517290094376, 0.2624582852449584, 0.18533487878622157, 0.028299007541037733, 0.04650250297365038, 0.00132438370332606, -0.14648490599865122, -0.2246224067799263, -0.16837585195630037, -0.13241368815780277, 0.05315900951563397, -0.013648617791813809, -0.0993705556369874, 0.33662855199501185, 0.1935865919690727, 0.052603058291240665, -0.04171635255315055, 0.30653427608499456, -0.008719184467004149, 0.09115194730100891, 0.04119804541039069, 0.21391842226474295, 0.035529046973368214, 0.24570325713239893, -0.13804599799473, 0.07951058020028504, -0.0887932519355725]
|
1,803.05992
|
On the Constituent Attributes of Software and Organisational Resilience
|
Our societies are increasingly dependent on services supplied by computers &
their software. New technology only exacerbates this dependence by increasing
the number, performance, and degree of autonomy and inter-connectivity of
software-empowered computers and cyber-physical "things", which translates into
unprecedented scenarios of interdependence. As a consequence, guaranteeing the
persistence-of-identity of individual & collective software systems and
software-backed organisations becomes an important prerequisite toward
sustaining the safety, security, & quality of the computer services supporting
human societies. Resilience is the term used to refer to the ability of a
system to retain its functional and non-functional identity. In this article we
conjecture that a better understanding of resilience may be reached by
decomposing it into ancillary constituent properties, the same way as a better
insight in system dependability was obtained by breaking it down into
sub-properties. 3 of the main sub-properties of resilience proposed here refer
respectively to the ability to perceive environmental changes; understand the
implications introduced by those changes; and plan & enact adjustments intended
to improve the system-environment fit. A fourth property characterises the way
the above abilities manifest themselves in computer systems. The 4 properties
are then analyzed in 3 families of case studies, each consisting of 3 software
systems that embed different resilience methods. Our major conclusion is that
reasoning in terms of resilience sub-properties may help revealing the
characteristics and limitations of classic methods and tools meant to achieve
system and organisational resilience. We conclude by suggesting that our method
may prelude to meta-resilient systems -- systems, that is, able to adjust
optimally their own resilience with respect to changing environmental
conditions.
|
cs.CY cs.OH
|
our societies are increasingly dependent on services supplied by computers their software new technology only exacerbates this dependence by increasing the number performance and degree of autonomy and interconnectivity of softwareempowered computers and cyberphysical things which translates into unprecedented scenarios of interdependence as a consequence guaranteeing the persistenceofidentity of individual collective software systems and softwarebacked organisations becomes an important prerequisite toward sustaining the safety security quality of the computer services supporting human societies resilience is the term used to refer to the ability of a system to retain its functional and nonfunctional identity in this article we conjecture that a better understanding of resilience may be reached by decomposing it into ancillary constituent properties the same way as a better insight in system dependability was obtained by breaking it down into subproperties 3 of the main subproperties of resilience proposed here refer respectively to the ability to perceive environmental changes understand the implications introduced by those changes and plan enact adjustments intended to improve the systemenvironment fit a fourth property characterises the way the above abilities manifest themselves in computer systems the 4 properties are then analyzed in 3 families of case studies each consisting of 3 software systems that embed different resilience methods our major conclusion is that reasoning in terms of resilience subproperties may help revealing the characteristics and limitations of classic methods and tools meant to achieve system and organisational resilience we conclude by suggesting that our method may prelude to metaresilient systems systems that is able to adjust optimally their own resilience with respect to changing environmental conditions
|
[['our', 'societies', 'are', 'increasingly', 'dependent', 'on', 'services', 'supplied', 'by', 'computers', 'their', 'software', 'new', 'technology', 'only', 'exacerbates', 'this', 'dependence', 'by', 'increasing', 'the', 'number', 'performance', 'and', 'degree', 'of', 'autonomy', 'and', 'interconnectivity', 'of', 'softwareempowered', 'computers', 'and', 'cyberphysical', 'things', 'which', 'translates', 'into', 'unprecedented', 'scenarios', 'of', 'interdependence', 'as', 'a', 'consequence', 'guaranteeing', 'the', 'persistenceofidentity', 'of', 'individual', 'collective', 'software', 'systems', 'and', 'softwarebacked', 'organisations', 'becomes', 'an', 'important', 'prerequisite', 'toward', 'sustaining', 'the', 'safety', 'security', 'quality', 'of', 'the', 'computer', 'services', 'supporting', 'human', 'societies', 'resilience', 'is', 'the', 'term', 'used', 'to', 'refer', 'to', 'the', 'ability', 'of', 'a', 'system', 'to', 'retain', 'its', 'functional', 'and', 'nonfunctional', 'identity', 'in', 'this', 'article', 'we', 'conjecture', 'that', 'a', 'better', 'understanding', 'of', 'resilience', 'may', 'be', 'reached', 'by', 'decomposing', 'it', 'into', 'ancillary', 'constituent', 'properties', 'the', 'same', 'way', 'as', 'a', 'better', 'insight', 'in', 'system', 'dependability', 'was', 'obtained', 'by', 'breaking', 'it', 'down', 'into', 'subproperties', '3', 'of', 'the', 'main', 'subproperties', 'of', 'resilience', 'proposed', 'here', 'refer', 'respectively', 'to', 'the', 'ability', 'to', 'perceive', 'environmental', 'changes', 'understand', 'the', 'implications', 'introduced', 'by', 'those', 'changes', 'and', 'plan', 'enact', 'adjustments', 'intended', 'to', 'improve', 'the', 'systemenvironment', 'fit', 'a', 'fourth', 'property', 'characterises', 'the', 'way', 'the', 'above', 'abilities', 'manifest', 'themselves', 'in', 'computer', 'systems', 'the', '4', 'properties', 'are', 'then', 'analyzed', 'in', '3', 'families', 'of', 'case', 'studies', 'each', 'consisting', 'of', '3', 'software', 'systems', 'that', 'embed', 'different', 'resilience', 'methods', 'our', 'major', 'conclusion', 'is', 'that', 'reasoning', 'in', 'terms', 'of', 'resilience', 'subproperties', 'may', 'help', 'revealing', 'the', 'characteristics', 'and', 'limitations', 'of', 'classic', 'methods', 'and', 'tools', 'meant', 'to', 'achieve', 'system', 'and', 'organisational', 'resilience', 'we', 'conclude', 'by', 'suggesting', 'that', 'our', 'method', 'may', 'prelude', 'to', 'metaresilient', 'systems', 'systems', 'that', 'is', 'able', 'to', 'adjust', 'optimally', 'their', 'own', 'resilience', 'with', 'respect', 'to', 'changing', 'environmental', 'conditions']]
|
[-0.12704374312757977, 0.057508883586339744, -0.0826304346293007, 0.07212394560089826, -0.07263068125543524, -0.14569957011790816, 0.04440617723509583, 0.3451024508884343, -0.2609221888525599, -0.36471724860634575, 0.09978271896956316, -0.25237205949731084, -0.1842834791195644, 0.18715323866326938, -0.13900819671333067, 0.06452035237001724, 0.04334280574414518, -0.0011508245546327427, -0.011268732698396022, -0.2817442955795762, 0.2957136683164222, 0.08484242439934218, 0.3154104641144495, 0.0715019536157709, 0.04627658215589648, -0.021343057729708133, -0.019452878160315545, 0.012835562718281335, -0.07410185389894051, 0.15866219862135236, 0.28792661692281146, 0.19914082495871094, 0.3551851737208289, -0.4358815367716227, -0.1961757797800192, 0.06363713008788408, 0.16207754626227616, 0.054243711126127185, 0.009751127619484021, -0.3090212331938579, 0.09325197951998128, -0.21416834499755769, -0.18223948189907513, -0.1201708923281683, 0.004845251793325193, 0.04344518160061232, -0.20532543672331746, -0.0036722908045576756, 0.09849286159273064, 0.07583565957656549, -0.05181605936106576, -0.07950772200629852, -0.05007069874031455, 0.22325737012686503, 0.031788221453027725, -0.004320986198925579, 0.183650508275492, -0.14093410977714715, -0.12319471199623157, 0.4032872773187105, 0.011646029328685543, -0.17004104640493675, 0.2379475760457734, -0.0821093464962409, -0.15269800637263892, 0.07766464703613458, 0.19975534279996804, 0.008632649320571199, -0.1700837841580528, 0.022591401858737172, 0.06260358446138702, 0.2031380208660379, 0.028062228641568415, 0.07940628426059243, 0.21404282993171364, 0.19161147611980983, 0.0844367210962629, 0.12910132772738633, 0.03288202833604472, -0.09053376564113495, -0.21627820644693724, -0.16056048764861658, -0.1158856137352454, 0.029110660226907323, -0.06793864216972928, -0.10872483227488607, 0.3875241809508352, 0.2233365809309383, 0.14949053614116056, 0.03896859126813464, 0.32255738550461394, 0.04407248398502964, 0.09640704675093871, 0.05418285943816827, 0.19685142541614672, 0.08166763356655779, 0.13250586932864358, -0.2055756582846042, 0.1540583567538158, -0.015740995387395106]
|
1,803.05993
|
A Location-based Approach for Distributed Kiosk Design
|
Electronic kiosk interface design and implementation metrics have been well
established. The problem arises when more than one kiosk is utilized in a
different location within the same geographic proximity using the same basic
informational parameters. This manuscript describes the design implications of
a distributed kiosk environment from the standpoint of a field experiment. The
log files from 2 kiosks deployed in the same building are analyzed for
correlations among kiosk location and information required. The results show
that while kiosk systems deployed in primary entrances should have a broad view
of pertinent information, kiosks deployed in more remote locations should have
information pertinent to that area initially presented to the individual. This
research provides both confirmatory evidence and a checklist of implementation
decision points for those who wish to implement a distributed kiosk
architecture.
|
cs.CY
|
electronic kiosk interface design and implementation metrics have been well established the problem arises when more than one kiosk is utilized in a different location within the same geographic proximity using the same basic informational parameters this manuscript describes the design implications of a distributed kiosk environment from the standpoint of a field experiment the log files from 2 kiosks deployed in the same building are analyzed for correlations among kiosk location and information required the results show that while kiosk systems deployed in primary entrances should have a broad view of pertinent information kiosks deployed in more remote locations should have information pertinent to that area initially presented to the individual this research provides both confirmatory evidence and a checklist of implementation decision points for those who wish to implement a distributed kiosk architecture
|
[['electronic', 'kiosk', 'interface', 'design', 'and', 'implementation', 'metrics', 'have', 'been', 'well', 'established', 'the', 'problem', 'arises', 'when', 'more', 'than', 'one', 'kiosk', 'is', 'utilized', 'in', 'a', 'different', 'location', 'within', 'the', 'same', 'geographic', 'proximity', 'using', 'the', 'same', 'basic', 'informational', 'parameters', 'this', 'manuscript', 'describes', 'the', 'design', 'implications', 'of', 'a', 'distributed', 'kiosk', 'environment', 'from', 'the', 'standpoint', 'of', 'a', 'field', 'experiment', 'the', 'log', 'files', 'from', '2', 'kiosks', 'deployed', 'in', 'the', 'same', 'building', 'are', 'analyzed', 'for', 'correlations', 'among', 'kiosk', 'location', 'and', 'information', 'required', 'the', 'results', 'show', 'that', 'while', 'kiosk', 'systems', 'deployed', 'in', 'primary', 'entrances', 'should', 'have', 'a', 'broad', 'view', 'of', 'pertinent', 'information', 'kiosks', 'deployed', 'in', 'more', 'remote', 'locations', 'should', 'have', 'information', 'pertinent', 'to', 'that', 'area', 'initially', 'presented', 'to', 'the', 'individual', 'this', 'research', 'provides', 'both', 'confirmatory', 'evidence', 'and', 'a', 'checklist', 'of', 'implementation', 'decision', 'points', 'for', 'those', 'who', 'wish', 'to', 'implement', 'a', 'distributed', 'kiosk', 'architecture']]
|
[-0.1357104383909178, 0.035515729755301165, -0.08401145963343205, 0.08434441612722973, -0.07497218807262403, -0.1894686858618149, 0.05478011991966654, 0.37415878085626497, -0.21232074814400187, -0.3349926625136976, 0.11917362700785614, -0.2798457377141825, -0.14330852695361332, 0.1895911612789388, -0.08485213536941619, 0.0433231213302524, 0.02195722774292032, 0.05435511871344513, -0.0345399777873859, -0.22580862274928087, 0.27909673260076456, 0.09488734044134617, 0.3336571653701227, 0.02675815663403935, 0.05396243652535809, 0.026463598714865467, -0.04289259777093927, 0.01877146696464883, -0.08596478463808092, 0.13729343640152364, 0.34616480612334, 0.19316621813405718, 0.3132245304744208, -0.4306638801263438, -0.19505987588178228, 0.06106594016223594, 0.14695944152427493, 0.0866385788887446, -0.06118991234516553, -0.2904337318269191, 0.07754946799293437, -0.16598251327458355, -0.11613720081298164, -0.01437687943517058, -0.0023040595421291612, 0.02043444468010286, -0.2350138025979201, -0.027616086578065597, -0.013918266424702274, 0.08486498739501393, -0.04594193948432803, -0.12718972737590473, -0.002190916448900545, 0.21562102284148785, -0.008372614472345621, 0.008017108969700834, 0.17218130929395556, -0.09651203112185208, -0.109867542223246, 0.3804725705318291, 0.02124757445535916, -0.16697521496702122, 0.1734991700509218, -0.07496767763945239, -0.1517922825800876, 0.07711931026998274, 0.20510544511834505, 0.08037112370064413, -0.2301867685096416, 0.025588511544952376, -0.02533023913425428, 0.1710796268587863, 0.024664644925441178, 0.06151124397982602, 0.2185645433211768, 0.18023731582108196, 0.054105762031826155, 0.1258112679563325, -0.06874168128878982, -0.12294927523298949, -0.2415164667500735, -0.14363535450840437, -0.17421693193760734, -0.008161798985330043, -0.06289671274706186, -0.0983423071258046, 0.3553011647304865, 0.21286113344960741, 0.16216680893191585, 0.0031966858008807457, 0.3044205070507747, 0.012916141782921773, 0.1017148363576443, 0.1378177455173702, 0.20232658196516612, 0.03441615783592203, 0.15994362902689588, -0.12286612084480347, 0.11123879273525543, -0.02467611494098997]
|
1,803.05994
|
Review on Master Patient Index
|
In today's health care establishments there is a great diversity of
information systems. Each with different specificities and capacities,
proprietary communication methods, and hardly allow scalability. This set of
characteristics hinders the interoperability of all these systems, in the
search for the good of the patient. It is vulgar that, when we look at all the
databases of each of these information systems, we come across different
registers that refer to the same person; records with insufficient data;
records with erroneous data due to errors or misunderstandings when inserting
patient data; and records with outdated data. These problems cause duplicity,
incoherence, discontinuation and dispersion in patient data. With the intention
of minimizing these problems that the concept of a Master Patient Index is
necessary. A Master Patient Index proposes a centralized repository, which
indexes all patient records of a given set of information systems. Which is
composed of a set of demographic data sufficient to unambiguously identify a
person and a list of identifiers that identify the various records that the
patient has in the repositories of each information system. This solution
allows for synchronization between all the actors, minimizing incoherence, out
datedness, lack of data, and a decrease in duplicate registrations. The Master
Patient Index is an asset to patients, the medical staff and health care
providers.
|
cs.CY
|
in todays health care establishments there is a great diversity of information systems each with different specificities and capacities proprietary communication methods and hardly allow scalability this set of characteristics hinders the interoperability of all these systems in the search for the good of the patient it is vulgar that when we look at all the databases of each of these information systems we come across different registers that refer to the same person records with insufficient data records with erroneous data due to errors or misunderstandings when inserting patient data and records with outdated data these problems cause duplicity incoherence discontinuation and dispersion in patient data with the intention of minimizing these problems that the concept of a master patient index is necessary a master patient index proposes a centralized repository which indexes all patient records of a given set of information systems which is composed of a set of demographic data sufficient to unambiguously identify a person and a list of identifiers that identify the various records that the patient has in the repositories of each information system this solution allows for synchronization between all the actors minimizing incoherence out datedness lack of data and a decrease in duplicate registrations the master patient index is an asset to patients the medical staff and health care providers
|
[['in', 'todays', 'health', 'care', 'establishments', 'there', 'is', 'a', 'great', 'diversity', 'of', 'information', 'systems', 'each', 'with', 'different', 'specificities', 'and', 'capacities', 'proprietary', 'communication', 'methods', 'and', 'hardly', 'allow', 'scalability', 'this', 'set', 'of', 'characteristics', 'hinders', 'the', 'interoperability', 'of', 'all', 'these', 'systems', 'in', 'the', 'search', 'for', 'the', 'good', 'of', 'the', 'patient', 'it', 'is', 'vulgar', 'that', 'when', 'we', 'look', 'at', 'all', 'the', 'databases', 'of', 'each', 'of', 'these', 'information', 'systems', 'we', 'come', 'across', 'different', 'registers', 'that', 'refer', 'to', 'the', 'same', 'person', 'records', 'with', 'insufficient', 'data', 'records', 'with', 'erroneous', 'data', 'due', 'to', 'errors', 'or', 'misunderstandings', 'when', 'inserting', 'patient', 'data', 'and', 'records', 'with', 'outdated', 'data', 'these', 'problems', 'cause', 'duplicity', 'incoherence', 'discontinuation', 'and', 'dispersion', 'in', 'patient', 'data', 'with', 'the', 'intention', 'of', 'minimizing', 'these', 'problems', 'that', 'the', 'concept', 'of', 'a', 'master', 'patient', 'index', 'is', 'necessary', 'a', 'master', 'patient', 'index', 'proposes', 'a', 'centralized', 'repository', 'which', 'indexes', 'all', 'patient', 'records', 'of', 'a', 'given', 'set', 'of', 'information', 'systems', 'which', 'is', 'composed', 'of', 'a', 'set', 'of', 'demographic', 'data', 'sufficient', 'to', 'unambiguously', 'identify', 'a', 'person', 'and', 'a', 'list', 'of', 'identifiers', 'that', 'identify', 'the', 'various', 'records', 'that', 'the', 'patient', 'has', 'in', 'the', 'repositories', 'of', 'each', 'information', 'system', 'this', 'solution', 'allows', 'for', 'synchronization', 'between', 'all', 'the', 'actors', 'minimizing', 'incoherence', 'out', 'datedness', 'lack', 'of', 'data', 'and', 'a', 'decrease', 'in', 'duplicate', 'registrations', 'the', 'master', 'patient', 'index', 'is', 'an', 'asset', 'to', 'patients', 'the', 'medical', 'staff', 'and', 'health', 'care', 'providers']]
|
[-0.12493813916191046, 0.031362839380114485, -0.057762841786330885, 0.06981230297926298, -0.09716981376439746, -0.16077939516431244, 0.12819953936727263, 0.36925632365408445, -0.2562925531400136, -0.3381142538053752, 0.1524273991179202, -0.345998197426005, -0.08753755009381212, 0.17753098409597157, -0.17612396400799538, 0.04109836558592484, 0.13997246774395258, 0.07579045931375178, -0.015683407291731354, -0.29248550734032064, 0.30857234071802847, 0.013135175626244276, 0.3301700426411519, 0.023430958780790528, 0.08405000349444505, 0.015237820797979678, -0.04871109180573013, -0.005595579870798398, -0.060584356003819936, 0.1448098737188542, 0.37979221797209184, 0.2560742034894427, 0.3634984757116039, -0.416806461650037, -0.17478913684565497, 0.11914153480344379, 0.08358231531606326, 0.11096284388186847, -0.01451775236570272, -0.30335397653395424, 0.07318859151618186, -0.1686397438293778, -0.08017946391077797, -0.06271469684520631, 0.009206849759796522, 0.026067106345076165, -0.26556869231868313, 0.05879714200702337, -0.022662019404295127, 0.12008797371339414, -0.07815649121927853, -0.0850435712193418, -0.039987941209789074, 0.2591911927233064, 0.07226385368830374, -0.013454443098084513, 0.12257576614086117, -0.14503941365865314, -0.11826027860040969, 0.3983485779815143, 0.043540936278840224, -0.17056183731998853, 0.164208424561936, -0.10583535992016818, -0.1544442945353103, 0.11555337053208616, 0.18570785650828947, 0.028046996411567014, -0.2544801906208574, -0.033252694656641095, -0.00031468071352501616, 0.20351250399942702, 0.050769310268629256, 0.05574097890569936, 0.18914624646065697, 0.14459860768310795, 0.04700434268859949, 0.07683272807846009, -0.07476326195986659, -0.034284678225304656, -0.23746447100557283, -0.15307146465525992, -0.15120997335059003, 0.012584826432614831, -0.11230609391786187, -0.18684316153610167, 0.39011133413478594, 0.19876931225752226, 0.1354419222251246, 0.0037941245472408436, 0.30167893508088683, 0.02710611666739148, 0.12255411874395603, 0.0911014517533168, 0.0926966653709742, 0.007131736261181615, 0.16378931506140712, -0.19827026206236076, 0.12860067158267932, -0.050609970413800755]
|
1,803.05995
|
Index Estimates for Free Boundary Constant Mean Curvature Surfaces
|
In this paper, we consider compact free boundary constant mean curvature
surfaces immersed in a mean convex body of the Euclidean space or in the unit
sphere. We prove that the Morse index is bounded from below by a linear
function of the genus and number of boundary components.
|
math.DG
|
in this paper we consider compact free boundary constant mean curvature surfaces immersed in a mean convex body of the euclidean space or in the unit sphere we prove that the morse index is bounded from below by a linear function of the genus and number of boundary components
|
[['in', 'this', 'paper', 'we', 'consider', 'compact', 'free', 'boundary', 'constant', 'mean', 'curvature', 'surfaces', 'immersed', 'in', 'a', 'mean', 'convex', 'body', 'of', 'the', 'euclidean', 'space', 'or', 'in', 'the', 'unit', 'sphere', 'we', 'prove', 'that', 'the', 'morse', 'index', 'is', 'bounded', 'from', 'below', 'by', 'a', 'linear', 'function', 'of', 'the', 'genus', 'and', 'number', 'of', 'boundary', 'components']]
|
[-0.16381286175883547, 0.16910553008926157, -0.06089903126299685, 0.013546805562717574, -0.04752027397329102, -0.09766918869346988, 0.0011414173368022454, 0.362831424009435, -0.287135369011334, -0.23488772306971403, 0.12189619676732667, -0.28422923391798927, -0.16604695009656859, 0.1608886010517195, -0.17549481113650361, 0.06653643916456067, 0.023802592172002306, 0.11381733824251866, -0.08769245907113109, -0.21668637441756317, 0.4217404119518338, -0.1086139164636938, 0.15712149184653346, 0.10940745779389173, 0.11061271487222034, 0.027510034509611373, 0.028521896472999027, 0.0860701673658213, -0.2056275342779094, 0.17666811912263536, 0.19167582800003644, 0.03858987000124643, 0.2643291327570166, -0.4032489296276959, -0.28408607428095173, 0.1757098000724705, 0.09408569513173888, -0.027764553185172226, -0.03214977892134719, -0.19906172851974868, 0.06724766205178992, -0.06866935545540585, -0.21289608900302223, 0.044968263930356016, 0.028954981503133873, 0.0028519732830095657, -0.19857104031407102, 0.08662595070556414, 0.0815458857663432, 0.10779198323737602, -0.14817938976445977, -0.1036702092850999, -0.040315862440941284, 0.09276684075688982, 0.03772798376585528, 0.11593112528172074, 0.10753823791117388, -0.09615370286723637, -0.03266303365746019, 0.33510720022782986, -0.1510779064490783, -0.3283390408875991, 0.11642529824938701, -0.19713015188177935, -0.061982976762121736, 0.11898653856383598, 0.2251265845356547, 0.18980570510504957, -0.07361308517580738, 0.20649032201499165, -0.059446922118528464, 0.1610842531699003, 0.11070322541862118, -0.07697233537269034, 0.1661348813118375, 0.08821097628346511, 0.17761081694111547, 0.2211485894453921, -0.07497422706943993, -0.07134922563421484, -0.3834899654802011, -0.2384843721947804, -0.24768696912583343, 0.07387504272390993, -0.1367922044850349, -0.24837369236106777, 0.36254545665175025, -0.023470139701147467, 0.19922609345949427, 0.15932106165861598, 0.2885757124441087, 0.08449535014354909, 0.023145323795057376, 0.15453190203490003, 0.19416431776647056, 0.13935108764135107, -0.018221326438444003, -0.15315490809497329, -0.06595105688296715, 0.15817163579673174]
|
1,803.05996
|
Scalable analysis of linear networked systems via chordal decomposition
|
This paper introduces a chordal decomposition approach for scalable analysis
of linear networked systems, including stability, $\mathcal{H}_2$ and
$\mathcal{H}_{\infty}$ performance. Our main strategy is to exploit any
sparsity within these analysis problems and use chordal decomposition. We first
show that Grone's and Agler's theorems can be generalized to block matrices
with any partition. This facilitates networked systems analysis, allowing one
to solely focus on the physical connections of networked systems to exploit
scalability. Then, by choosing Lyapunov functions with appropriate sparsity
patterns, we decompose large positive semidefinite constraints in all of the
analysis problems into multiple smaller ones depending on the maximal cliques
of the system graph. This makes the solutions more computationally efficient
via a recent first-order algorithm. Numerical experiments demonstrate the
efficiency and scalability of the proposed method.
|
math.OC math.DS
|
this paper introduces a chordal decomposition approach for scalable analysis of linear networked systems including stability mathcalh_2 and mathcalh_infty performance our main strategy is to exploit any sparsity within these analysis problems and use chordal decomposition we first show that grones and aglers theorems can be generalized to block matrices with any partition this facilitates networked systems analysis allowing one to solely focus on the physical connections of networked systems to exploit scalability then by choosing lyapunov functions with appropriate sparsity patterns we decompose large positive semidefinite constraints in all of the analysis problems into multiple smaller ones depending on the maximal cliques of the system graph this makes the solutions more computationally efficient via a recent firstorder algorithm numerical experiments demonstrate the efficiency and scalability of the proposed method
|
[['this', 'paper', 'introduces', 'a', 'chordal', 'decomposition', 'approach', 'for', 'scalable', 'analysis', 'of', 'linear', 'networked', 'systems', 'including', 'stability', 'mathcalh_2', 'and', 'mathcalh_infty', 'performance', 'our', 'main', 'strategy', 'is', 'to', 'exploit', 'any', 'sparsity', 'within', 'these', 'analysis', 'problems', 'and', 'use', 'chordal', 'decomposition', 'we', 'first', 'show', 'that', 'grones', 'and', 'aglers', 'theorems', 'can', 'be', 'generalized', 'to', 'block', 'matrices', 'with', 'any', 'partition', 'this', 'facilitates', 'networked', 'systems', 'analysis', 'allowing', 'one', 'to', 'solely', 'focus', 'on', 'the', 'physical', 'connections', 'of', 'networked', 'systems', 'to', 'exploit', 'scalability', 'then', 'by', 'choosing', 'lyapunov', 'functions', 'with', 'appropriate', 'sparsity', 'patterns', 'we', 'decompose', 'large', 'positive', 'semidefinite', 'constraints', 'in', 'all', 'of', 'the', 'analysis', 'problems', 'into', 'multiple', 'smaller', 'ones', 'depending', 'on', 'the', 'maximal', 'cliques', 'of', 'the', 'system', 'graph', 'this', 'makes', 'the', 'solutions', 'more', 'computationally', 'efficient', 'via', 'a', 'recent', 'firstorder', 'algorithm', 'numerical', 'experiments', 'demonstrate', 'the', 'efficiency', 'and', 'scalability', 'of', 'the', 'proposed', 'method']]
|
[-0.1413076437320202, -0.007612860235027396, -0.08081444861510625, 0.030972234770440712, -0.11704257618313511, -0.1569249090523674, 0.03899472676163826, 0.34961827599371853, -0.306256669988999, -0.27927040416890614, 0.15529209436186087, -0.2303675389275528, -0.2241036286286544, 0.1883715867315634, -0.07599514877387824, 0.11288825394227528, 0.11758163775890493, -0.030554339069371612, -0.09651279978973504, -0.2538080158985954, 0.32012551308681186, 0.022938261893040574, 0.2890450119972229, 0.04829964429635975, 0.1055422889534384, 0.036016135087881526, -0.040910738514951216, 0.03050941511308058, -0.1022066884193359, 0.18530389623931395, 0.2901993121092136, 0.21194867335188275, 0.335953135172335, -0.4141034488924421, -0.18106258660778762, 0.14587187964397555, 0.15622440568672924, 0.08767622838047548, 0.0027603858037484595, -0.2795147158062229, 0.1373792437836528, -0.135534913952534, -0.07237408512155526, -0.14406762396415265, -0.04170187261277953, 0.02434483260507337, -0.3088979692556537, 0.03826001976939061, 0.07938122479961468, 0.015173432431541956, -0.03654873837143756, -0.12463549942834876, 0.02960074482163271, 0.07940104143120921, -0.017206859210721, -0.06842653127118516, 0.11470127961455057, -0.043770149710158315, -0.15808903149042566, 0.35504639698192475, -0.011141707896828078, -0.2550653917052282, 0.19054393516853452, -0.06623004603629502, -0.1842171096081774, 0.08748339920197255, 0.22702311625202687, 0.14478185607406954, -0.14496276731101365, 0.09881757174869282, -0.04483542339159892, 0.19450390023680833, 0.03841381712745016, 0.03546939817472146, 0.12391049948771699, 0.20299126443524773, 0.16615105060717233, 0.16890245008980856, 0.01885395715228067, -0.10429265418161567, -0.22290834620854674, -0.10962416808694028, -0.18369142400333657, -0.00911376398200026, -0.18384116944955448, -0.15651743575267923, 0.4053089957469358, 0.17092695205938072, 0.1745001231964964, 0.12546333132777363, 0.3354752618962756, 0.09574650333782371, 0.06324654617705024, 0.09837944989379209, 0.1738889090716839, 0.14876454709133563, 0.0821415061954982, -0.22858764092939404, 0.051810702910790075, 0.08793519195885613]
|
1,803.05997
|
Synergizing Roadway Infrastructure Investment with Digital
Infrastructure for Infrastructure-Based Connected Vehicle Applications:
Review of Current Status and Future Directions
|
The safety, mobility, environmental, energy, and economic benefits of
transportation systems, which are the focus of recent connected vehicle (CV)
programs, are potentially dramatic. However, realization of these benefits
largely hinges on the timely integration of digital technology into upcoming as
well as existing transportation infrastructure. CVs must be enabled to
broadcast and receive data to and from other CVs [vehicle-to-vehicle (V2V)
communication], to and from infrastructure [vehicle-to-infrastructure (V2I)
communication], and to and from other road users, such as bicyclists or
pedestrians (vehicle-to-other road users communication). Further, the
infrastructure and transportation agencies that manage V2I-focused applications
must be able to collect, process, distribute, and archive these data quickly,
reliably, and securely. This paper focuses on V2I applications and investigates
current digital roadway infrastructure initiatives. It highlights the
importance of including digital infrastructure investment alongside investment
in more traditional transportation infrastructure to keep up with the auto
industry push toward increasing intervehicular communication. By studying
current CV testbeds and smart-city initiatives, this paper identifies digital
infrastructure being used by public agencies. It also examines public agencies
limited budgeting for digital infrastructure and finds that current expenditure
is inadequate for realizing the potential benefits of V2I applications.
Finally, the paper presents a set of recommendations, based on a review of
current practices and future needs, designed to guide agencies responsible for
transportation infrastructure. It stresses the importance of collaboration for
establishing national and international platforms for the planning, deployment,
and management of digital infrastructure to support connected transportation
systems.
|
cs.CY cs.GL
|
the safety mobility environmental energy and economic benefits of transportation systems which are the focus of recent connected vehicle cv programs are potentially dramatic however realization of these benefits largely hinges on the timely integration of digital technology into upcoming as well as existing transportation infrastructure cvs must be enabled to broadcast and receive data to and from other cvs vehicletovehicle v2v communication to and from infrastructure vehicletoinfrastructure v2i communication and to and from other road users such as bicyclists or pedestrians vehicletoother road users communication further the infrastructure and transportation agencies that manage v2ifocused applications must be able to collect process distribute and archive these data quickly reliably and securely this paper focuses on v2i applications and investigates current digital roadway infrastructure initiatives it highlights the importance of including digital infrastructure investment alongside investment in more traditional transportation infrastructure to keep up with the auto industry push toward increasing intervehicular communication by studying current cv testbeds and smartcity initiatives this paper identifies digital infrastructure being used by public agencies it also examines public agencies limited budgeting for digital infrastructure and finds that current expenditure is inadequate for realizing the potential benefits of v2i applications finally the paper presents a set of recommendations based on a review of current practices and future needs designed to guide agencies responsible for transportation infrastructure it stresses the importance of collaboration for establishing national and international platforms for the planning deployment and management of digital infrastructure to support connected transportation systems
|
[['the', 'safety', 'mobility', 'environmental', 'energy', 'and', 'economic', 'benefits', 'of', 'transportation', 'systems', 'which', 'are', 'the', 'focus', 'of', 'recent', 'connected', 'vehicle', 'cv', 'programs', 'are', 'potentially', 'dramatic', 'however', 'realization', 'of', 'these', 'benefits', 'largely', 'hinges', 'on', 'the', 'timely', 'integration', 'of', 'digital', 'technology', 'into', 'upcoming', 'as', 'well', 'as', 'existing', 'transportation', 'infrastructure', 'cvs', 'must', 'be', 'enabled', 'to', 'broadcast', 'and', 'receive', 'data', 'to', 'and', 'from', 'other', 'cvs', 'vehicletovehicle', 'v2v', 'communication', 'to', 'and', 'from', 'infrastructure', 'vehicletoinfrastructure', 'v2i', 'communication', 'and', 'to', 'and', 'from', 'other', 'road', 'users', 'such', 'as', 'bicyclists', 'or', 'pedestrians', 'vehicletoother', 'road', 'users', 'communication', 'further', 'the', 'infrastructure', 'and', 'transportation', 'agencies', 'that', 'manage', 'v2ifocused', 'applications', 'must', 'be', 'able', 'to', 'collect', 'process', 'distribute', 'and', 'archive', 'these', 'data', 'quickly', 'reliably', 'and', 'securely', 'this', 'paper', 'focuses', 'on', 'v2i', 'applications', 'and', 'investigates', 'current', 'digital', 'roadway', 'infrastructure', 'initiatives', 'it', 'highlights', 'the', 'importance', 'of', 'including', 'digital', 'infrastructure', 'investment', 'alongside', 'investment', 'in', 'more', 'traditional', 'transportation', 'infrastructure', 'to', 'keep', 'up', 'with', 'the', 'auto', 'industry', 'push', 'toward', 'increasing', 'intervehicular', 'communication', 'by', 'studying', 'current', 'cv', 'testbeds', 'and', 'smartcity', 'initiatives', 'this', 'paper', 'identifies', 'digital', 'infrastructure', 'being', 'used', 'by', 'public', 'agencies', 'it', 'also', 'examines', 'public', 'agencies', 'limited', 'budgeting', 'for', 'digital', 'infrastructure', 'and', 'finds', 'that', 'current', 'expenditure', 'is', 'inadequate', 'for', 'realizing', 'the', 'potential', 'benefits', 'of', 'v2i', 'applications', 'finally', 'the', 'paper', 'presents', 'a', 'set', 'of', 'recommendations', 'based', 'on', 'a', 'review', 'of', 'current', 'practices', 'and', 'future', 'needs', 'designed', 'to', 'guide', 'agencies', 'responsible', 'for', 'transportation', 'infrastructure', 'it', 'stresses', 'the', 'importance', 'of', 'collaboration', 'for', 'establishing', 'national', 'and', 'international', 'platforms', 'for', 'the', 'planning', 'deployment', 'and', 'management', 'of', 'digital', 'infrastructure', 'to', 'support', 'connected', 'transportation', 'systems']]
|
[-0.1676288813927534, 0.037232783926194724, -0.015336827099399299, 0.02472745663922533, -0.12944549843668937, -0.1754365434547012, 0.13221594981934723, 0.37559862748472667, -0.2571573107931003, -0.3295871404797903, 0.18081799092255912, -0.3270028956918692, -0.15214993075315594, 0.25203110410413726, -0.16912490410483158, 0.09261028205462712, 0.05334618196737173, -0.04301458043711526, 0.07115238840520687, -0.2790764359800069, 0.27001142779137105, 0.08068851795123548, 0.39955356225789507, 0.12048516318354072, 0.035638634848161314, 0.01698027343527243, -0.12102442996942304, -0.05552370303823632, -0.06109731908221207, 0.19503813296442432, 0.42662923941911407, 0.26373283532923275, 0.3480379680817833, -0.48013840846109146, -0.22167651779493508, 0.10980285585914948, 0.13712520300201617, 0.00818556231703153, -0.06289000155253345, -0.343602922219517, 0.0531854777461469, -0.2800204719549843, -0.13570679431847696, -0.07539097526471834, 0.00341864142410115, 0.09079474011692694, -0.23719617862881598, -0.0446676685447491, -0.07040313790713874, 0.10677218776842465, -0.024477035905785708, -0.08332062299477355, -0.055614094344461906, 0.256310444666258, 0.045843883530517125, 0.0024236344910530867, 0.19455260299573823, -0.17536143975009266, -0.1488981295434036, 0.42209533206282224, 0.06693247672507767, -0.10458567412522603, 0.18172353185672901, -0.010222059730630444, -0.12577956901454576, 0.024864761433706677, 0.2933188403079913, -0.019995425334580395, -0.24390147340921114, 0.00844231657042377, 0.08560256061942449, 0.12103073414538663, 0.028367740236346285, 0.07784820163565478, 0.24020373229393546, 0.24022526491851526, 0.2018503836415499, 0.05252923079509744, -0.05134257167216619, -0.14153468322617058, -0.19163040245065885, -0.1705170273951882, -0.1531942940858782, 0.03879818828225288, -0.008119362131846898, -0.07403224070879574, 0.328934221157367, 0.21121300667600365, 0.05242762533681733, 0.045867414332983296, 0.4274665493061956, -0.008171874216261168, 0.12923520184787257, 0.14998206590986526, 0.15639699178947403, -0.0246467297250222, 0.26296892999196236, -0.14247298543911655, 0.10072510532692683, -0.05311468468696278]
|
1,803.05998
|
|{Math, Philosophy, Programming, Writing}| = 1
|
Philosophical thinking has a side effect: by aiming to find the essence of a
diverse set of phenomena, it often makes it difficult to see the differences
between them. This can be the case with Mathematics, Programming, Writing and
Philosophy itself. Their unified essence is having a shared understanding of
the world helped by off-loading our cognitive efforts to suitable languages.
|
cs.CY cs.GL
|
philosophical thinking has a side effect by aiming to find the essence of a diverse set of phenomena it often makes it difficult to see the differences between them this can be the case with mathematics programming writing and philosophy itself their unified essence is having a shared understanding of the world helped by offloading our cognitive efforts to suitable languages
|
[['philosophical', 'thinking', 'has', 'a', 'side', 'effect', 'by', 'aiming', 'to', 'find', 'the', 'essence', 'of', 'a', 'diverse', 'set', 'of', 'phenomena', 'it', 'often', 'makes', 'it', 'difficult', 'to', 'see', 'the', 'differences', 'between', 'them', 'this', 'can', 'be', 'the', 'case', 'with', 'mathematics', 'programming', 'writing', 'and', 'philosophy', 'itself', 'their', 'unified', 'essence', 'is', 'having', 'a', 'shared', 'understanding', 'of', 'the', 'world', 'helped', 'by', 'offloading', 'our', 'cognitive', 'efforts', 'to', 'suitable', 'languages']]
|
[-0.071973597646126, 0.03090600704499444, -0.1507885906784261, 0.11597794138627951, -0.23869976280715133, -0.14558122894100722, 0.09478705152716549, 0.342011387047709, -0.30960091394295947, -0.375238570796906, 0.06406561690611673, -0.24703841197655582, -0.20913431130838198, 0.17224977199049268, -0.1201840569952228, -0.001884381714292237, 0.030448706332044523, 0.011135793489510895, -0.03808866844695733, -0.2583202921220514, 0.29153445718016047, 0.06266409650322843, 0.32451344148607036, 0.06212716929034376, 0.05863343980774039, -0.02753674823668648, -0.03707268498418089, 0.006016957344578915, -0.042779213924449486, 0.16811042390458408, 0.3960166724139183, 0.24070103556589514, 0.3977372866795688, -0.4381185236585433, -0.195247360383023, 0.05302837215455585, 0.07649330625341075, 0.10559109474730785, -0.00425315585720246, -0.3023548980861841, 0.030265122043258954, -0.13372379859153669, -0.09853027196081936, -0.059129792876297334, 0.07085278163068608, -0.06629541009420255, -0.176510663153451, -0.036367679381223976, 0.0790491527954086, 0.07582439872298817, 0.050584912781038736, -0.09002635963871831, 0.01820249569251156, 0.19543136708957495, 0.09082098149114334, 0.033114068038364655, 0.12563293912738074, -0.12598065929258334, -0.15182237875968463, 0.46070750521831827, 0.05446111358946464, -0.19724833856400706, 0.29691806530244036, -0.10988542452820989, -0.1059049467907333, 0.0679283874895668, 0.11741782822569863, 0.05936022199781948, -0.17264135407100692, 0.08934591464663963, -0.01767115714791857, 0.16263381160459803, 0.05590728643640387, 0.019815428365693718, 0.3029363071087931, 0.20746178109748442, 0.0005398040148811262, 0.10663238425594067, 0.020546819758506064, -0.13163485190235688, -0.23338093649840258, -0.1702022638981093, -0.12026653136508386, 0.07126709602040346, -0.013605797102963018, -0.11830609209346966, 0.37113076622872687, 0.18676912284563066, 0.12486684534576584, 0.04540571894832566, 0.3178833294965205, 0.07352723289671408, 0.10599297057974656, 0.06469553947967828, 0.17254977285495546, 0.07527261620509576, 0.18870721733747203, -0.1756132069372068, 0.12161009661761708, -0.02618134985525222]
|
1,803.05999
|
Escaping Saddles with Stochastic Gradients
|
We analyze the variance of stochastic gradients along negative curvature
directions in certain non-convex machine learning models and show that
stochastic gradients exhibit a strong component along these directions.
Furthermore, we show that - contrary to the case of isotropic noise - this
variance is proportional to the magnitude of the corresponding eigenvalues and
not decreasing in the dimensionality. Based upon this observation we propose a
new assumption under which we show that the injection of explicit, isotropic
noise usually applied to make gradient descent escape saddle points can
successfully be replaced by a simple SGD step. Additionally - and under the
same condition - we derive the first convergence rate for plain SGD to a
second-order stationary point in a number of iterations that is independent of
the problem dimension.
|
cs.LG math.OC stat.ML
|
we analyze the variance of stochastic gradients along negative curvature directions in certain nonconvex machine learning models and show that stochastic gradients exhibit a strong component along these directions furthermore we show that contrary to the case of isotropic noise this variance is proportional to the magnitude of the corresponding eigenvalues and not decreasing in the dimensionality based upon this observation we propose a new assumption under which we show that the injection of explicit isotropic noise usually applied to make gradient descent escape saddle points can successfully be replaced by a simple sgd step additionally and under the same condition we derive the first convergence rate for plain sgd to a secondorder stationary point in a number of iterations that is independent of the problem dimension
|
[['we', 'analyze', 'the', 'variance', 'of', 'stochastic', 'gradients', 'along', 'negative', 'curvature', 'directions', 'in', 'certain', 'nonconvex', 'machine', 'learning', 'models', 'and', 'show', 'that', 'stochastic', 'gradients', 'exhibit', 'a', 'strong', 'component', 'along', 'these', 'directions', 'furthermore', 'we', 'show', 'that', 'contrary', 'to', 'the', 'case', 'of', 'isotropic', 'noise', 'this', 'variance', 'is', 'proportional', 'to', 'the', 'magnitude', 'of', 'the', 'corresponding', 'eigenvalues', 'and', 'not', 'decreasing', 'in', 'the', 'dimensionality', 'based', 'upon', 'this', 'observation', 'we', 'propose', 'a', 'new', 'assumption', 'under', 'which', 'we', 'show', 'that', 'the', 'injection', 'of', 'explicit', 'isotropic', 'noise', 'usually', 'applied', 'to', 'make', 'gradient', 'descent', 'escape', 'saddle', 'points', 'can', 'successfully', 'be', 'replaced', 'by', 'a', 'simple', 'sgd', 'step', 'additionally', 'and', 'under', 'the', 'same', 'condition', 'we', 'derive', 'the', 'first', 'convergence', 'rate', 'for', 'plain', 'sgd', 'to', 'a', 'secondorder', 'stationary', 'point', 'in', 'a', 'number', 'of', 'iterations', 'that', 'is', 'independent', 'of', 'the', 'problem', 'dimension']]
|
[-0.12086842484830872, 0.08932098983255339, -0.10337702280614437, 0.07723198416019518, -0.05903648585814426, -0.13460159820585152, 0.04172751953546691, 0.40528217637838104, -0.3209553922647537, -0.23035307762425716, 0.10185677662774129, -0.23499115156449787, -0.16655792498880426, 0.17580668776714076, -0.09351684934437626, 0.03559127215233698, 0.0463669276970446, 0.028436652370031894, -0.08995213335027963, -0.2814016922498049, 0.3029634030746648, 0.04031760057830435, 0.31313227860469695, -0.0012851803514035785, 0.1514618979532301, -0.025048485073515564, 0.02518899106387577, 0.0709422498897422, -0.09705063641322484, 0.10075474050772325, 0.1975029286992698, 0.08791260669088334, 0.3131099207428519, -0.4180781756799052, -0.20781869154540808, 0.16901269506692418, 0.15441593910910292, 0.13298771388766423, -0.0607671007426001, -0.22293341540966152, 0.11031746544772539, -0.08685115013843564, -0.129398017403061, -0.09304211096192791, -0.03172970640539067, 0.0647356526222168, -0.29621863189542036, 0.09483044104481952, 0.11222612128893691, 0.03987749586043161, -0.04645911963495213, -0.1215530203061369, 0.01995362010307786, 0.04776473339980718, 0.12268585837849481, 0.024529927826347196, 0.13221260323005868, -0.09901238600613446, -0.08332253455763727, 0.3018682308707709, -0.11892357791267981, -0.23715036176145077, 0.1578391210495047, -0.10039465319673259, -0.14463024166977312, 0.13223224680496776, 0.21081549619639836, 0.12945057029329884, -0.12873268156041076, 0.0648497340537967, -0.005260261978338084, 0.14830554094954804, 0.0516086921653175, -0.036524156537493614, 0.12316523369871021, 0.09779284230435009, 0.18810310342356446, 0.1674119429800322, -0.1096192539603574, -0.12530820015964544, -0.3233573022921841, -0.15788956998029768, -0.18486044737767046, 0.06656079922858205, -0.13461318408933332, -0.17300395434355642, 0.3816207386296624, 0.19889274416638053, 0.25793149210805966, 0.10825118339734197, 0.31131881516514803, 0.16547100653497898, 0.037678303776352895, 0.13416944345914003, 0.2453541219982458, 0.11536783793405812, 0.09105252466113196, -0.21877583786185215, 0.09215365846707362, 0.06386589150377146]
|
1,803.06
|
Beyond Patient Monitoring: Conversational Agents Role in Telemedicine &
Healthcare Support For Home-Living Elderly Individuals
|
There is a need for systems to dynamically interact with ageing populations
to gather information, monitor health condition and provide support, especially
after hospital discharge or at-home settings. Several smart devices have been
delivered by digital health, bundled with telemedicine systems, smartphone and
other digital services. While such solutions offer personalised data and
suggestions, the real disruptive step comes from the interaction of new digital
ecosystem, represented by chatbots. Chatbots will play a leading role by
embodying the function of a virtual assistant and bridging the gap between
patients and clinicians. Powered by AI and machine learning algorithms,
chatbots are forecasted to save healthcare costs when used in place of a human
or assist them as a preliminary step of helping to assess a condition and
providing self-care recommendations. This paper describes integrating chatbots
into telemedicine systems intended for elderly patient after their hospital
discharge. The paper discusses possible ways to utilise chatbots to assist
healthcare providers and support patients with their condition.
|
cs.CY cs.AI
|
there is a need for systems to dynamically interact with ageing populations to gather information monitor health condition and provide support especially after hospital discharge or athome settings several smart devices have been delivered by digital health bundled with telemedicine systems smartphone and other digital services while such solutions offer personalised data and suggestions the real disruptive step comes from the interaction of new digital ecosystem represented by chatbots chatbots will play a leading role by embodying the function of a virtual assistant and bridging the gap between patients and clinicians powered by ai and machine learning algorithms chatbots are forecasted to save healthcare costs when used in place of a human or assist them as a preliminary step of helping to assess a condition and providing selfcare recommendations this paper describes integrating chatbots into telemedicine systems intended for elderly patient after their hospital discharge the paper discusses possible ways to utilise chatbots to assist healthcare providers and support patients with their condition
|
[['there', 'is', 'a', 'need', 'for', 'systems', 'to', 'dynamically', 'interact', 'with', 'ageing', 'populations', 'to', 'gather', 'information', 'monitor', 'health', 'condition', 'and', 'provide', 'support', 'especially', 'after', 'hospital', 'discharge', 'or', 'athome', 'settings', 'several', 'smart', 'devices', 'have', 'been', 'delivered', 'by', 'digital', 'health', 'bundled', 'with', 'telemedicine', 'systems', 'smartphone', 'and', 'other', 'digital', 'services', 'while', 'such', 'solutions', 'offer', 'personalised', 'data', 'and', 'suggestions', 'the', 'real', 'disruptive', 'step', 'comes', 'from', 'the', 'interaction', 'of', 'new', 'digital', 'ecosystem', 'represented', 'by', 'chatbots', 'chatbots', 'will', 'play', 'a', 'leading', 'role', 'by', 'embodying', 'the', 'function', 'of', 'a', 'virtual', 'assistant', 'and', 'bridging', 'the', 'gap', 'between', 'patients', 'and', 'clinicians', 'powered', 'by', 'ai', 'and', 'machine', 'learning', 'algorithms', 'chatbots', 'are', 'forecasted', 'to', 'save', 'healthcare', 'costs', 'when', 'used', 'in', 'place', 'of', 'a', 'human', 'or', 'assist', 'them', 'as', 'a', 'preliminary', 'step', 'of', 'helping', 'to', 'assess', 'a', 'condition', 'and', 'providing', 'selfcare', 'recommendations', 'this', 'paper', 'describes', 'integrating', 'chatbots', 'into', 'telemedicine', 'systems', 'intended', 'for', 'elderly', 'patient', 'after', 'their', 'hospital', 'discharge', 'the', 'paper', 'discusses', 'possible', 'ways', 'to', 'utilise', 'chatbots', 'to', 'assist', 'healthcare', 'providers', 'and', 'support', 'patients', 'with', 'their', 'condition']]
|
[-0.09034633729285475, 0.06792527477276951, -0.057479612677832324, 0.06047566079797417, -0.16316501275626258, -0.22735794749613736, 0.10069869702504776, 0.401196541193947, -0.21598616799488207, -0.34702142535428876, 0.13866557657041592, -0.32937313404871277, -0.1431117809057647, 0.2355496609541359, -0.16004097648822, 0.041293900216461094, 0.09486840599794312, 0.02738512708377693, 0.04685081823756118, -0.2996357720562377, 0.2877079495714486, 0.04116171185338607, 0.3185944479198818, 0.07341228532919124, 0.058582251735083024, 0.025469306747834743, -0.06579220748757886, -0.05645209735979332, -0.06796322944588343, 0.15753941133009852, 0.42444600143214184, 0.24096638025241715, 0.4231630854988528, -0.5130508688901283, -0.1809810182891009, 0.09438983963208239, 0.145434242446994, 0.035581667566146315, -0.08705307103042131, -0.3576955257006492, 0.08605638248531684, -0.2562231757289564, -0.147491269158303, -0.09340642912004805, -0.01198998206252935, 0.040485451891775485, -0.26513317769159067, -0.005772495896561197, -0.027331474837075712, 0.14658162963399493, -0.08286177879101182, -0.07757855244295135, -0.006179635161591088, 0.2976896358831383, 0.0684166039308773, 0.03010532041608807, 0.2101111184531377, -0.18538652744895545, -0.1398892583828305, 0.38529143372744873, 0.08266659240249796, -0.13854446318114827, 0.2005129495608489, -0.01610888659017035, -0.09245405872952353, 0.021685949392456768, 0.2609237450677787, 0.01083027978500557, -0.2456922281432241, -0.029563057536339286, 0.12179028767623876, 0.13932622192381808, 0.036831235766633656, -0.011157436073512023, 0.25170659784376165, 0.21709381251173104, 0.045411907671736494, 0.08700938857956132, 0.02160731137303801, -0.04258975292951657, -0.17655522000341695, -0.2028162017853165, -0.09672499885939724, 0.02959077902287502, -0.039432437404093156, -0.12220793829779455, 0.33380210074660205, 0.18460296524225797, 0.09086355312757388, 0.022889394262834862, 0.32894600850409983, 0.02156751024025418, 0.13331675632039736, 0.054020324900483516, 0.12790802101521792, -0.028041981610589507, 0.26927652100438215, -0.14625730911881143, 0.1279934715664234, -0.02898452147281517]
|
1,803.06001
|
Symplectic Frieze Patterns
|
We introduce a new class of friezes which is related to symplectic geometry.
On the algebraic and combinatrics sides, this variant of friezes is related to
the cluster algebras involving the Dynkin diagrams of type ${\rm C}_{2}$ and
${\rm A}_{m}$. On the geometric side, they are related to the moduli space of
Lagrangian configurations of points in the 4-dimensional symplectic space
introduced in [Conley C.H., Ovsienko V., Math. Ann. 375 (2019), 1105-1145].
Symplectic friezes share similar combinatorial properties to those of Coxeter
friezes and SL-friezes.
|
math.CO
|
we introduce a new class of friezes which is related to symplectic geometry on the algebraic and combinatrics sides this variant of friezes is related to the cluster algebras involving the dynkin diagrams of type rm c_2 and rm a_m on the geometric side they are related to the moduli space of lagrangian configurations of points in the 4dimensional symplectic space introduced in conley ch ovsienko v math ann 375 2019 11051145 symplectic friezes share similar combinatorial properties to those of coxeter friezes and slfriezes
|
[['we', 'introduce', 'a', 'new', 'class', 'of', 'friezes', 'which', 'is', 'related', 'to', 'symplectic', 'geometry', 'on', 'the', 'algebraic', 'and', 'combinatrics', 'sides', 'this', 'variant', 'of', 'friezes', 'is', 'related', 'to', 'the', 'cluster', 'algebras', 'involving', 'the', 'dynkin', 'diagrams', 'of', 'type', 'rm', 'c_2', 'and', 'rm', 'a_m', 'on', 'the', 'geometric', 'side', 'they', 'are', 'related', 'to', 'the', 'moduli', 'space', 'of', 'lagrangian', 'configurations', 'of', 'points', 'in', 'the', '4dimensional', 'symplectic', 'space', 'introduced', 'in', 'conley', 'ch', 'ovsienko', 'v', 'math', 'ann', '375', '2019', '11051145', 'symplectic', 'friezes', 'share', 'similar', 'combinatorial', 'properties', 'to', 'those', 'of', 'coxeter', 'friezes', 'and', 'slfriezes']]
|
[-0.1656213292295522, 0.07404150092042983, -0.06808856752326303, 0.09397489369261965, -0.15576751909514025, -0.14002011699897304, 0.006278832829216632, 0.3252318958956294, -0.33705866397585627, -0.23787147483629426, 0.07823333920337396, -0.2650881297204916, -0.17930187259959737, 0.15324910268508374, -0.23121226360885108, -0.03586471447630263, 0.004718770363890543, 0.06159456449038372, -0.10280791026951458, -0.30754072895478, 0.40224348040433916, -0.03786235907762425, 0.20642617787234485, -0.012575172306685822, 0.07569231178111784, 0.006594074330656085, -0.040760538961011464, -0.02046172846770255, -0.2146133554349767, 0.1503116752094839, 0.27268216509099413, 0.05289589431954593, 0.11220526232997455, -0.341596837876728, -0.08670114075322068, 0.17427409306259417, 0.13210796807302025, 0.02396466691052632, 0.03931350675241158, -0.3073435982280388, 0.076114189135984, -0.11889219508370066, -0.1751148263304835, -0.0264796521741806, 0.09418082372966881, 0.03160470089784301, -0.1971456428376458, 0.010591025288194054, 0.07287997174894482, 0.11276975710501486, -0.039538970359078635, -0.16872015478310926, -0.10407961500672305, 0.0534908231745315, -0.05314152820103961, 0.06738513086854321, 0.06166928628368712, -0.05966732781323627, -0.15878062954785802, 0.3961496149110267, 0.014683840046750336, -0.20973663313723193, 0.19488962205748356, -0.09141409422679828, -0.2365990764200233, 0.11924327184906139, 0.12517533471762407, 0.13068346002298156, -0.03591835532882592, 0.1657284744085301, -0.1209171716998354, 0.012305705001714027, 0.1387202255825353, 0.010586192848433445, 0.11840353500688584, 0.03578698654693165, 0.07058198894260496, 0.1318491141016527, -0.021287401496410008, -0.11893476691755761, -0.3075137466601119, -0.1926442987183336, -0.0735714138604746, 0.11944241017648359, -0.14213107613134682, -0.18216181811649443, 0.3761801687069237, 0.035797894421238, 0.18258429034833126, 0.06125183571442371, 0.09987392171183829, 0.045776440302000905, 0.08284813505256684, 0.04121723538264632, 0.11876421223008414, 0.2666751750313291, 0.06789414430173432, -0.15658795804625786, -0.06951923096387806, 0.285735897847633]
|
1,803.06002
|
Ridge Regression Estimated Linear Probability Model Predictions of
N-glycosylation in Proteins with Structural and Sequence Data
|
Absent experimental evidence, a robust methodology to predict the likelihood
of N-glycosylation in human proteins is essential for guiding experimental
work. Based on the distribution of amino acids in the neighborhood of the NxS/T
sequon (N-site); the structural attributes of the N-site that include
Accessible Surface Area, secondary structural elements, main-chain phi-psi,
turn types; the relative location of the N-site in the primary sequence; and
the nature of the glycan bound, the ridge regression estimated linear
probability model is used to predict this likelihood. This model yields a
Kolmogorov-Smirnov (Gini coefficient) statistic value of about 74% (89%), which
is reasonable.
|
q-bio.QM
|
absent experimental evidence a robust methodology to predict the likelihood of nglycosylation in human proteins is essential for guiding experimental work based on the distribution of amino acids in the neighborhood of the nxst sequon nsite the structural attributes of the nsite that include accessible surface area secondary structural elements mainchain phipsi turn types the relative location of the nsite in the primary sequence and the nature of the glycan bound the ridge regression estimated linear probability model is used to predict this likelihood this model yields a kolmogorovsmirnov gini coefficient statistic value of about 74 89 which is reasonable
|
[['absent', 'experimental', 'evidence', 'a', 'robust', 'methodology', 'to', 'predict', 'the', 'likelihood', 'of', 'nglycosylation', 'in', 'human', 'proteins', 'is', 'essential', 'for', 'guiding', 'experimental', 'work', 'based', 'on', 'the', 'distribution', 'of', 'amino', 'acids', 'in', 'the', 'neighborhood', 'of', 'the', 'nxst', 'sequon', 'nsite', 'the', 'structural', 'attributes', 'of', 'the', 'nsite', 'that', 'include', 'accessible', 'surface', 'area', 'secondary', 'structural', 'elements', 'mainchain', 'phipsi', 'turn', 'types', 'the', 'relative', 'location', 'of', 'the', 'nsite', 'in', 'the', 'primary', 'sequence', 'and', 'the', 'nature', 'of', 'the', 'glycan', 'bound', 'the', 'ridge', 'regression', 'estimated', 'linear', 'probability', 'model', 'is', 'used', 'to', 'predict', 'this', 'likelihood', 'this', 'model', 'yields', 'a', 'kolmogorovsmirnov', 'gini', 'coefficient', 'statistic', 'value', 'of', 'about', '74', '89', 'which', 'is', 'reasonable']]
|
[-0.07895904638785489, 0.038529885277076036, -0.08952926147767172, 0.10745358510104445, -0.03525276658866478, -0.14951842664075748, 0.08073669608459066, 0.3580748871044845, -0.24973205328272768, -0.313818753537798, 0.036271423653803994, -0.2763517881121144, -0.164078960138164, 0.13805644289229294, -0.04629879146434215, 0.06099707145738054, 0.050128088646321275, 0.07401256889522988, -0.011775544761413974, -0.21179312250900026, 0.24142609594617875, 0.10355137148872018, 0.30145352367995953, 0.03778034837545865, 0.06490417707911027, 0.019385491885073786, -0.01741182209201613, -0.022466602678201636, -0.1484839675348277, 0.1843221705235845, 0.23640263091050545, 0.11856917083757568, 0.2378324753015625, -0.34237598985129475, -0.20961870658995432, 0.1105172544793815, 0.10069353379694061, 0.07190295084907046, 0.005041849534549959, -0.24284197742651617, 0.08973394687363535, -0.1425111335761636, -0.11620600514318224, -0.021081109395207912, 0.006526199138571261, 0.03273612011119495, -0.29114534832271083, 0.167228807842511, 0.055766146851371504, 0.09899303555127462, -0.07767321369658244, -0.1676276900107041, -0.05785502983276181, 0.13008064724390908, 0.05208937239319998, 0.014686034227322255, 0.18252929083869926, -0.09266878153216473, -0.06866882848363294, 0.35261736241435365, -0.032371620970721146, -0.1674676828504521, 0.16140435611572573, -0.1230827471281744, -0.14882684596671666, 0.132238325420577, 0.16104348176824196, 0.10594970575172682, -0.1808241210896902, 0.009844249265852898, -0.06392849977033174, 0.22066073851868967, 0.027431742606532514, -0.01984545888797361, 0.2192335290815301, 0.16987580339167724, 0.031189968310562626, 0.13073920788794605, -0.1394129396696594, -0.08359560034503895, -0.27030265276861964, -0.16690483214440566, -0.1916609594683942, -0.020433122686547588, -0.1326142654999822, -0.19596380623394852, 0.4251237275210751, 0.14989557588587002, 0.2092285146378456, 0.06639641654625421, 0.2229764516422601, 0.05173704669601759, 0.048158613290181576, -0.008696310640293725, 0.19739141199756793, 0.1342979602857816, 0.017627014906848877, -0.24815739161448971, 0.18428930589437428, 0.05312944147783351]
|
1,803.06003
|
Bi-interpretability of Some Monoids with the Arithmetic and Applications
|
We will prove bi-interpretability of the arithmetic $\N = \langle N, +,\cdot,
0, 1\rangle$ and the weak second order theory of $\N$ with the free monoid
$\mathbb{M}_X$ of finite rank greater than 1 and with a non-trivial partially
commutative monoid with trivial center. This bi-interpretability implies that
finitely generated submonoids of these monoids are definable. Moreover, any
recursively enumerable language in the alphabet $X$ is definable in
$\mathbb{M}_X$. Primitive elements, and, therefore, free bases are definable in
the free monoid. It has the so-called QFA property, namely there is a sentence
$\phi$ such that every finitely generated monoid satisfying $\phi$ is
isomorphic to $\mathbb{M}_X$. The same is true for a partially commutative
monoid without center. We also prove that there is no quantifier elimination in
the theory of any structure that is bi-interpretable with $\mathbb N$ to any
boolean combination of formulas from $\Pi_n$ or $\Sigma_n$.
|
math.LO
|
we will prove biinterpretability of the arithmetic n langle n cdot 0 1rangle and the weak second order theory of n with the free monoid mathbbm_x of finite rank greater than 1 and with a nontrivial partially commutative monoid with trivial center this biinterpretability implies that finitely generated submonoids of these monoids are definable moreover any recursively enumerable language in the alphabet x is definable in mathbbm_x primitive elements and therefore free bases are definable in the free monoid it has the socalled qfa property namely there is a sentence phi such that every finitely generated monoid satisfying phi is isomorphic to mathbbm_x the same is true for a partially commutative monoid without center we also prove that there is no quantifier elimination in the theory of any structure that is biinterpretable with mathbb n to any boolean combination of formulas from pi_n or sigma_n
|
[['we', 'will', 'prove', 'biinterpretability', 'of', 'the', 'arithmetic', 'n', 'langle', 'n', 'cdot', '0', '1rangle', 'and', 'the', 'weak', 'second', 'order', 'theory', 'of', 'n', 'with', 'the', 'free', 'monoid', 'mathbbm_x', 'of', 'finite', 'rank', 'greater', 'than', '1', 'and', 'with', 'a', 'nontrivial', 'partially', 'commutative', 'monoid', 'with', 'trivial', 'center', 'this', 'biinterpretability', 'implies', 'that', 'finitely', 'generated', 'submonoids', 'of', 'these', 'monoids', 'are', 'definable', 'moreover', 'any', 'recursively', 'enumerable', 'language', 'in', 'the', 'alphabet', 'x', 'is', 'definable', 'in', 'mathbbm_x', 'primitive', 'elements', 'and', 'therefore', 'free', 'bases', 'are', 'definable', 'in', 'the', 'free', 'monoid', 'it', 'has', 'the', 'socalled', 'qfa', 'property', 'namely', 'there', 'is', 'a', 'sentence', 'phi', 'such', 'that', 'every', 'finitely', 'generated', 'monoid', 'satisfying', 'phi', 'is', 'isomorphic', 'to', 'mathbbm_x', 'the', 'same', 'is', 'true', 'for', 'a', 'partially', 'commutative', 'monoid', 'without', 'center', 'we', 'also', 'prove', 'that', 'there', 'is', 'no', 'quantifier', 'elimination', 'in', 'the', 'theory', 'of', 'any', 'structure', 'that', 'is', 'biinterpretable', 'with', 'mathbb', 'n', 'to', 'any', 'boolean', 'combination', 'of', 'formulas', 'from', 'pi_n', 'or', 'sigma_n']]
|
[-0.16691747516241118, 0.19834577576096715, -0.03675914953687581, 0.05832967295046446, -0.08397628751358595, -0.15680801502814323, -0.015791602540311627, 0.3749901517390691, -0.39926815971989055, -0.14819349559216663, 0.05251374587151704, -0.32146003894379427, -0.07676985761760895, 0.16113977064699705, -0.10126818205211874, -0.03290575766486341, 0.013801501460116486, 0.18535437225845866, -0.08187406497589987, -0.2602504128012164, 0.36029759085705054, -0.09077478404606468, 0.18603212198178315, 0.02498687286700668, 0.11821743350732943, 0.0016829714797244504, 0.0127939164172858, 0.017401699471319546, -0.12657928561956364, 0.06277931996075244, 0.3442683006990059, 0.15293118211135653, 0.2350221463446987, -0.3772971029704485, -0.09741919690036568, 0.2584792412110958, 0.12187808209644824, 0.0010511198659138433, -0.03320169925432781, -0.2306433604291544, 0.22903292339680523, -0.1908483953439984, -0.0934789762414735, -0.02858651032478645, 0.11344192393589765, -0.0030110845759767912, -0.2888727761062408, -0.02567920041419084, 0.16831156258182278, 0.127903411974167, -0.01806812732849784, -0.11330909628485297, -0.0723981824221796, 0.07256448224411699, -0.04386750010067019, 0.08952870507050177, 0.07350925722857937, -0.039848661992763136, -0.12277937159343655, 0.3842216446867277, -0.04597516476210801, -0.2297624948177615, 0.09764117002166037, -0.20068761987354736, -0.18657455279507898, 0.15653854122160582, -0.039820033237980355, 0.14209016203450778, -0.0050313775704627665, 0.27511811155769655, -0.20072240325269, 0.22423875924071363, 0.14213048608989678, 0.021005661687653127, 0.08434268550240788, 0.056658690670055564, 0.06752917202719455, 0.1303005412670559, 0.10687156218457325, -6.532661359885644e-05, -0.3567777146488942, -0.15626099293345008, -0.13086865286760288, 0.1321904488437777, -0.1079772985440976, -0.22363196173361663, 0.2882531448363744, 0.1207460648219647, 0.09318603859845034, 0.15522274613412546, 0.2186686219101579, 0.0765311307209576, 0.07482459493993043, 0.07933939673199222, 0.03106468850425605, 0.1852651375923948, -0.08637330722192238, -0.11848465807049471, 0.06123602574305802, 0.1881941183438075]
|
1,803.06004
|
Three State Quantum System Exhibiting Third Order Exceptional
Singularities and Flip-of-States
|
A quantum inspired open optical system is mathematically implemented with an
analogous three state non-Hermitian Hamiltonian exhibiting two special
avoided-resonance-crossings; where interesting characteristics alongside a
third-order exceptional point is explored towards robust ultra-selective state
switching.
|
quant-ph
|
a quantum inspired open optical system is mathematically implemented with an analogous three state nonhermitian hamiltonian exhibiting two special avoidedresonancecrossings where interesting characteristics alongside a thirdorder exceptional point is explored towards robust ultraselective state switching
|
[['a', 'quantum', 'inspired', 'open', 'optical', 'system', 'is', 'mathematically', 'implemented', 'with', 'an', 'analogous', 'three', 'state', 'nonhermitian', 'hamiltonian', 'exhibiting', 'two', 'special', 'avoidedresonancecrossings', 'where', 'interesting', 'characteristics', 'alongside', 'a', 'thirdorder', 'exceptional', 'point', 'is', 'explored', 'towards', 'robust', 'ultraselective', 'state', 'switching']]
|
[-0.2191723600933046, 0.14187331276524207, -0.07961842039543571, 0.03102660916435222, -0.08808942767085903, -0.32805031089281494, 0.0002490799718846877, 0.38772102490519034, -0.23562412455000661, -0.1916678739768086, 0.10539975401126978, -0.2340948152793289, -0.23633863347949405, 0.23212439267698562, -0.03721396077344252, 0.112376980469421, 0.04939995102132812, 0.03633928044247582, -0.06697307742698203, -0.14256306873126465, 0.29247288775602076, -0.0006865467770363797, 0.2779040726071054, -0.03580929516729983, 0.1331061163606743, -0.010870437264781107, 0.07070122529385668, 0.03572772079584838, -0.06539873278586927, 0.0499394985875397, 0.29625910481042933, -0.024215863170948895, 0.24700047983082407, -0.37808867081096675, -0.1939128457258145, 0.061312139090715034, 0.1660773605108261, 0.15846160251760122, -0.09597388031662293, -0.3496172979022517, -0.03340265939407276, -0.14245110507490058, -0.2215474797694972, -0.09193268634209578, 0.02120799780117743, -0.07548531324066447, -0.20637773084595348, -0.011713706606039495, 0.07080808695349278, 0.10756300231724074, -0.023983545093373818, -0.10613501720680771, -0.0027399126327399053, 0.06979727279394865, -0.09810350189041911, 0.017766650766134262, 0.08256936734753915, -0.10343331200155345, -0.1681597321294248, 0.38803652789669507, 0.007725233296779069, -0.1749657399839524, 0.17155696203311285, -0.011471350620867628, -0.15087069404509032, 0.11981088870600091, 0.07963742526022322, 0.07416406344396598, -0.2096548658710989, 0.07591217338587299, -0.026780951429497112, 0.13668423669966587, 0.014578068403132034, 0.09115471680133576, 0.2261372503231872, 0.1974361501634121, 0.05615262444497961, 0.22186426979235627, 0.02281721229806091, -0.2835482569467841, -0.2567552085401434, -0.12290993864845598, -0.20657678071240132, 0.14542782267160487, -0.04526675681611805, -0.17332716139428544, 0.4635589425310944, 0.10993022875239451, 0.1897460988327635, -0.06903183720582588, 0.26933036484953127, 0.19141953641718085, -0.041272170982803356, 0.04707486224784092, 0.2635222115751469, 0.1317717315222112, 0.06552761410729903, -0.23069109781786348, -0.011293711479414593, 0.042971422895789146]
|
1,803.06005
|
Linear logic in normed cones: probabilistic coherence spaces and beyond
|
Ehrhard, Pagani and Tasson proposed a model of probabilistic functional
programming in a category of normed positive cones and stable measurable cone
maps, which can be seen as a coordinate-free generalization of probabilistic
coherence spaces. However, unlike the case of probabilistic coherence spaces,
it remained unclear if the model could be refined to a model of classical
linear logic.
In this work we consider a somewhat similar category which gives indeed a
coordinate-free model of full propositional linear logic with nondegenerate
interpretation of additives and sound interpretation of exponentials. Objects
are dual pairs of normed cones satisfying certain specific completeness
properties, such as existence of norm-bounded monotone weak limits, and
morphisms are bounded (adjointable) positive maps. Norms allow us a distinct
interpretation of dual additive connectives as product and coproduct.
Exponential connectives are modelled using real analytic functions and
distributions that have representations as power series with positive
coefficients.
Unlike the familiar case of probabilistic coherence spaces, there is no
reference or need for a preferred basis; in this sense the model is invariant.
Probabilistic coherence spaces form a full subcategory, whose objects, seen as
posets, are lattices. Thus we get a model fitting in the tradition of
interpreting linear logic in a linear algebraic setting, which arguably is free
from the drawbacks of its predecessors.
Relations with constructions of Ehrhard, Pagani and Tasson's work are left
for future research.
|
cs.LO
|
ehrhard pagani and tasson proposed a model of probabilistic functional programming in a category of normed positive cones and stable measurable cone maps which can be seen as a coordinatefree generalization of probabilistic coherence spaces however unlike the case of probabilistic coherence spaces it remained unclear if the model could be refined to a model of classical linear logic in this work we consider a somewhat similar category which gives indeed a coordinatefree model of full propositional linear logic with nondegenerate interpretation of additives and sound interpretation of exponentials objects are dual pairs of normed cones satisfying certain specific completeness properties such as existence of normbounded monotone weak limits and morphisms are bounded adjointable positive maps norms allow us a distinct interpretation of dual additive connectives as product and coproduct exponential connectives are modelled using real analytic functions and distributions that have representations as power series with positive coefficients unlike the familiar case of probabilistic coherence spaces there is no reference or need for a preferred basis in this sense the model is invariant probabilistic coherence spaces form a full subcategory whose objects seen as posets are lattices thus we get a model fitting in the tradition of interpreting linear logic in a linear algebraic setting which arguably is free from the drawbacks of its predecessors relations with constructions of ehrhard pagani and tassons work are left for future research
|
[['ehrhard', 'pagani', 'and', 'tasson', 'proposed', 'a', 'model', 'of', 'probabilistic', 'functional', 'programming', 'in', 'a', 'category', 'of', 'normed', 'positive', 'cones', 'and', 'stable', 'measurable', 'cone', 'maps', 'which', 'can', 'be', 'seen', 'as', 'a', 'coordinatefree', 'generalization', 'of', 'probabilistic', 'coherence', 'spaces', 'however', 'unlike', 'the', 'case', 'of', 'probabilistic', 'coherence', 'spaces', 'it', 'remained', 'unclear', 'if', 'the', 'model', 'could', 'be', 'refined', 'to', 'a', 'model', 'of', 'classical', 'linear', 'logic', 'in', 'this', 'work', 'we', 'consider', 'a', 'somewhat', 'similar', 'category', 'which', 'gives', 'indeed', 'a', 'coordinatefree', 'model', 'of', 'full', 'propositional', 'linear', 'logic', 'with', 'nondegenerate', 'interpretation', 'of', 'additives', 'and', 'sound', 'interpretation', 'of', 'exponentials', 'objects', 'are', 'dual', 'pairs', 'of', 'normed', 'cones', 'satisfying', 'certain', 'specific', 'completeness', 'properties', 'such', 'as', 'existence', 'of', 'normbounded', 'monotone', 'weak', 'limits', 'and', 'morphisms', 'are', 'bounded', 'adjointable', 'positive', 'maps', 'norms', 'allow', 'us', 'a', 'distinct', 'interpretation', 'of', 'dual', 'additive', 'connectives', 'as', 'product', 'and', 'coproduct', 'exponential', 'connectives', 'are', 'modelled', 'using', 'real', 'analytic', 'functions', 'and', 'distributions', 'that', 'have', 'representations', 'as', 'power', 'series', 'with', 'positive', 'coefficients', 'unlike', 'the', 'familiar', 'case', 'of', 'probabilistic', 'coherence', 'spaces', 'there', 'is', 'no', 'reference', 'or', 'need', 'for', 'a', 'preferred', 'basis', 'in', 'this', 'sense', 'the', 'model', 'is', 'invariant', 'probabilistic', 'coherence', 'spaces', 'form', 'a', 'full', 'subcategory', 'whose', 'objects', 'seen', 'as', 'posets', 'are', 'lattices', 'thus', 'we', 'get', 'a', 'model', 'fitting', 'in', 'the', 'tradition', 'of', 'interpreting', 'linear', 'logic', 'in', 'a', 'linear', 'algebraic', 'setting', 'which', 'arguably', 'is', 'free', 'from', 'the', 'drawbacks', 'of', 'its', 'predecessors', 'relations', 'with', 'constructions', 'of', 'ehrhard', 'pagani', 'and', 'tassons', 'work', 'are', 'left', 'for', 'future', 'research']]
|
[-0.1029142049287637, 0.0699950589861428, -0.08530512445821838, 0.13520729586158728, -0.13728420238323738, -0.17054295349931223, 0.015327106867957551, 0.3787096845043018, -0.33158921959147053, -0.2117736842330773, 0.1019876971129149, -0.24072360762244488, -0.13499794249940364, 0.18323602605363004, -0.1362747520647585, 0.06524661387694089, 0.03199305781722475, 0.05057224655609301, -0.10762141193019219, -0.21860016333386628, 0.3415547009653058, -0.006038760537623253, 0.228475741103625, -0.007993847719397738, 0.12336426325890695, 0.018847704281436693, -0.02273997610565031, 0.061530755210553977, -0.10239533363645373, 0.15285164315058283, 0.30257496407039985, 0.15619583266042986, 0.2660876934132671, -0.38453197599221917, -0.17519458696575568, 0.14268232228876981, 0.10840084522100385, 0.03926574811441051, -0.0039589463308144475, -0.2868906730525684, 0.046459545285540624, -0.17998777319449427, -0.0834512722975367, -0.12369549858249626, 0.050269326193087355, 0.014453584935788601, -0.27044076695794234, 0.03654941429656536, 0.1672083273546274, 0.10501775897330937, -0.0914037966654396, -0.1020769184311917, -0.04370518567983069, 0.06412292554604467, -0.030027373871810766, 0.024386534865896776, 0.0835180144500817, -0.08416370634298657, -0.17196244793927792, 0.36223872570833393, -0.05562567477994985, -0.2532946579626001, 0.162609343141964, -0.14002191092753904, -0.13728810364774968, 0.08263848621731697, 0.09653814379776539, 0.136979263446672, -0.10000941237459146, 0.16423057112766543, -0.12555238361344326, 0.13405674812536458, 0.11988528531581553, 0.1170802834361393, 0.2021072584419922, 0.12730174419148846, 0.05408297936171781, 0.13389507961036498, 0.05474824831703084, -0.10569270806616847, -0.33258312935920586, -0.15835668792740715, -0.10175708326710364, 0.05867095380069842, -0.0790768625504082, -0.2180885968986069, 0.3376650402279709, 0.09675895585252763, 0.187240167671416, 0.159274344051391, 0.2612588302187589, 0.1122250702536124, 0.06720988111424069, 0.011497292064294761, 0.15906336425633807, 0.1970902468468262, 0.05108603063612916, -0.08619269067940087, 0.08311907587345185, 0.12068885715807204]
|
1,803.06006
|
Synchronization and Stability for Quantum Kuramoto
|
We present and analyze a nonabelian version of the Kuramoto system, which we
call the quantum Kuramoto system. We study the stability of several classes of
special solutions to this system, and show that for certain connection
topologies the system supports multiple attractors. We also present estimates
on the maximal possible heterogeneity in this system that can support an
attractor, and study the effect of modifications analogous to phase-lag.
|
math.DS math-ph math.MP nlin.PS
|
we present and analyze a nonabelian version of the kuramoto system which we call the quantum kuramoto system we study the stability of several classes of special solutions to this system and show that for certain connection topologies the system supports multiple attractors we also present estimates on the maximal possible heterogeneity in this system that can support an attractor and study the effect of modifications analogous to phaselag
|
[['we', 'present', 'and', 'analyze', 'a', 'nonabelian', 'version', 'of', 'the', 'kuramoto', 'system', 'which', 'we', 'call', 'the', 'quantum', 'kuramoto', 'system', 'we', 'study', 'the', 'stability', 'of', 'several', 'classes', 'of', 'special', 'solutions', 'to', 'this', 'system', 'and', 'show', 'that', 'for', 'certain', 'connection', 'topologies', 'the', 'system', 'supports', 'multiple', 'attractors', 'we', 'also', 'present', 'estimates', 'on', 'the', 'maximal', 'possible', 'heterogeneity', 'in', 'this', 'system', 'that', 'can', 'support', 'an', 'attractor', 'and', 'study', 'the', 'effect', 'of', 'modifications', 'analogous', 'to', 'phaselag']]
|
[-0.23947810827066068, 0.06816477284862059, -0.09642386054485172, 0.08206742882823059, -0.04126979008424973, -0.10041370874176314, 0.05737846143935146, 0.3039872629594976, -0.24852972653141056, -0.23820664712052414, 0.1436227800888077, -0.2343836908356921, -0.25579980976771616, 0.18511673538149268, -0.08403072801783033, 0.04620255300424237, 0.07794068298855986, 0.03828588208737041, -0.04280576610050259, -0.2175452964299399, 0.4017985099386694, 0.010710542581206106, 0.26282789220736513, 0.02891631448722404, 0.09087875955130743, -0.028061757819133178, 0.04117292038880396, 0.06172452427689796, -0.16407857138256077, 0.09740314304666675, 0.14483797157257525, 0.11985242557779387, 0.2431115597837429, -0.39835195556498953, -0.22063812455567328, 0.16315777873809356, 0.1449897509891594, 0.15517794211779762, -0.015768128644634526, -0.2929127858243073, 0.11030180174207814, -0.2171034089245739, -0.1582164900728326, -0.1349667549011824, -0.0043479742455309715, 0.054110022855625634, -0.24259157073886498, -0.004642940616063045, 0.09953186754137278, 0.046888584527524486, -0.11048559029249178, -0.014382252272258958, 0.01358815162456122, 0.12053399771262986, 0.03780505981674229, -0.052678178874370846, 0.04867381310306382, -0.0996075447216846, -0.14059325376613255, 0.35590829719127953, -0.08605180407766307, -0.20316133424099805, 0.22695375682003255, -0.134690854145025, -0.19196203652013472, 0.03499542609822221, 0.21408489753451684, 0.09207643042116062, -0.1472560892124539, 0.043201100632069174, -0.08633840671888944, 0.1767887105976326, 0.006029358430617098, 0.06949420267905014, 0.14355905204876393, 0.17807457963193674, 0.10457595993859181, 0.23517075156712014, -0.04298990345020117, -0.1369023821662531, -0.3249107158103404, -0.17539430133984896, -0.12007207659316128, 0.03249845028841409, -0.11047542899905238, -0.18083215394205804, 0.46091664447516634, 0.20181957003997936, 0.18673540224604632, 0.07797930234591004, 0.2148338009238891, 0.09984339363333108, -0.00599791707498008, 0.0657775437567329, 0.22698532150947806, 0.12712337087461914, 0.1065016528793975, -0.2689690276899416, 0.01213946377021679, 0.08799402333418097]
|
1,803.06007
|
Covert Communication over a K-User Multiple Access Channel
|
We consider a scenario in which $K$ transmitters attempt to communicate
covert messages reliably to a legitimate receiver over a discrete memoryless
MAC while simultaneously escaping detection from an adversary who observes
their communication through another discrete memoryless MAC. We assume that
each transmitter may use a secret key that is shared only between itself and
the legitimate receiver. We show that each of the $K$ transmitters can transmit
on the order of $\sqrt{n}$ reliable and covert bits per $n$ channel uses,
exceeding which, the warden will be able to detect the communication. We
identify the optimal pre-constants of the scaling, which leads to a complete
characterization of the covert capacity region of the $K$-user binary-input
MAC. We show that, asymptotically, all sum-rate constraints are inactive unlike
the traditional MAC capacity region. We also characterize the channel
conditions that have to be satisfied for the transmitters to operate without a
secret key.
|
cs.IT math.IT
|
we consider a scenario in which k transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless mac while simultaneously escaping detection from an adversary who observes their communication through another discrete memoryless mac we assume that each transmitter may use a secret key that is shared only between itself and the legitimate receiver we show that each of the k transmitters can transmit on the order of sqrtn reliable and covert bits per n channel uses exceeding which the warden will be able to detect the communication we identify the optimal preconstants of the scaling which leads to a complete characterization of the covert capacity region of the kuser binaryinput mac we show that asymptotically all sumrate constraints are inactive unlike the traditional mac capacity region we also characterize the channel conditions that have to be satisfied for the transmitters to operate without a secret key
|
[['we', 'consider', 'a', 'scenario', 'in', 'which', 'k', 'transmitters', 'attempt', 'to', 'communicate', 'covert', 'messages', 'reliably', 'to', 'a', 'legitimate', 'receiver', 'over', 'a', 'discrete', 'memoryless', 'mac', 'while', 'simultaneously', 'escaping', 'detection', 'from', 'an', 'adversary', 'who', 'observes', 'their', 'communication', 'through', 'another', 'discrete', 'memoryless', 'mac', 'we', 'assume', 'that', 'each', 'transmitter', 'may', 'use', 'a', 'secret', 'key', 'that', 'is', 'shared', 'only', 'between', 'itself', 'and', 'the', 'legitimate', 'receiver', 'we', 'show', 'that', 'each', 'of', 'the', 'k', 'transmitters', 'can', 'transmit', 'on', 'the', 'order', 'of', 'sqrtn', 'reliable', 'and', 'covert', 'bits', 'per', 'n', 'channel', 'uses', 'exceeding', 'which', 'the', 'warden', 'will', 'be', 'able', 'to', 'detect', 'the', 'communication', 'we', 'identify', 'the', 'optimal', 'preconstants', 'of', 'the', 'scaling', 'which', 'leads', 'to', 'a', 'complete', 'characterization', 'of', 'the', 'covert', 'capacity', 'region', 'of', 'the', 'kuser', 'binaryinput', 'mac', 'we', 'show', 'that', 'asymptotically', 'all', 'sumrate', 'constraints', 'are', 'inactive', 'unlike', 'the', 'traditional', 'mac', 'capacity', 'region', 'we', 'also', 'characterize', 'the', 'channel', 'conditions', 'that', 'have', 'to', 'be', 'satisfied', 'for', 'the', 'transmitters', 'to', 'operate', 'without', 'a', 'secret', 'key']]
|
[-0.26820736924754546, 0.06505661208226132, -0.06940389546682897, 0.011023914561350984, -0.09436967408451073, -0.3520097972405766, 0.1878327691583703, 0.37758506937507563, -0.29243061084312616, -0.24154702491367494, 0.08091817855671517, -0.26948833159041524, -0.10929856653979035, 0.1047509785322164, -0.14943762258079138, 0.021780606334572596, -0.033559912930563436, 0.12149371827211669, 0.022589138783021084, -0.3125753807218511, 0.2692097686416167, 0.09337815766636011, 0.2683009132681205, -0.0029123266172034062, 0.09893844602937928, 0.01609246236340001, 0.008065727388251894, -0.11903482650264802, -0.12277392640565128, 0.025572874916359685, 0.35597654289199004, 0.17729278227363696, 0.23515161582028235, -0.3967936479899761, -0.2921245515543893, 0.1548574522526207, 0.17953501119808793, 0.08685504209900904, -0.012608427878944142, -0.279821867598159, 0.1623120286505028, -0.20430773463630617, 0.0145395131541157, 0.04635679174140589, -0.12314733264610073, 0.03834008476010752, -0.3681713038020835, -0.00910338134807843, 0.0263844333424862, -0.021540681208601063, -0.026939009072641466, -0.04575017563357259, 0.027340504904400976, 0.25598750131155384, -0.021251878783643395, -0.020927314637290525, 0.11016962554194773, -0.07043974028610384, -0.11712797505412487, 0.3124682081675169, -0.024904724701603764, -0.18798189908759483, 0.15969602716325348, -0.12469512028989709, -0.0808697622454423, 0.1875916165145521, 0.24343561463132007, 0.07535716256940898, -0.1891013090591261, 0.016931479012698477, -0.08478190979938831, 0.26667892737529975, 0.10432814486904551, 0.16545092827325922, 0.1292394944374135, 0.0868242649509516, 0.1641524863191911, 0.15761139465569957, -0.11313885539486412, -0.1218594730190242, -0.30526771167576905, -0.17327284518111224, -0.24659187750758246, 0.0488600958021518, -0.06980972380137583, -0.0129095037646641, 0.30804450368733816, 0.1822414630754166, 0.1383425818952047, 0.12466352744820522, 0.40337354531943403, 0.02341059193212465, 0.07231730041217478, 0.24691131712239706, 0.19158736754529523, 0.12311727647509253, 0.0774194975499224, -0.17132715059795867, 0.11478577243990654, -0.055179020377579116]
|
1,803.06008
|
A unified image reconstruction framework for quantitative dual- and
triple-energy CT imaging of material compositions
|
Many clinical applications depend critically on the accurate differentiation
and classification of different types of materials in patient anatomy. This
work introduces a unified framework for accurate nonlinear material
decomposition and applies it, for the first time, in the concept of
triple-energy CT (TECT) for enhanced material differentiation and
classification as well as dual-energy CT. The triple-energy data acquisition is
implemented at the scales of micro-CT and clinical CT imaging with commercial
"TwinBeam" dual-source DECT configuration and a fast kV switching DECT
configuration. Material decomposition and quantitative comparison with a photon
counting detector and with the presence of a bow-tie filter are also performed.
The proposed method provides quantitative material- and energy-selective images
examining realistic configurations for both dual- and triple-energy CT
measurements. Compared to the polychromatic kV CT images, virtual monochromatic
images show superior image quality. For the mouse phantom, quantitative
measurements show that the differences between gadodiamide and iodine
concentrations obtained using TECT and idealized photon counting CT (PCCT) are
smaller than 8 mg/mL and 1 mg/mL, respectively. TECT outperforms DECT for
multi-contrast CT imaging and is robust with respect to spectrum estimation.
For the thorax phantom, the differences between the concentrations of the
contrast map and the corresponding true reference values are smaller than 7
mg/mL for all of the realistic configurations. A unified framework for both
dual- and triple-energy CT imaging has been established for the accurate
extraction of material compositions; considering currently available commercial
DECT configurations. The novel technique is promising to provide an urgently
needed solution for several CT-based diagnosis and therapy applications.
|
physics.med-ph
|
many clinical applications depend critically on the accurate differentiation and classification of different types of materials in patient anatomy this work introduces a unified framework for accurate nonlinear material decomposition and applies it for the first time in the concept of tripleenergy ct tect for enhanced material differentiation and classification as well as dualenergy ct the tripleenergy data acquisition is implemented at the scales of microct and clinical ct imaging with commercial twinbeam dualsource dect configuration and a fast kv switching dect configuration material decomposition and quantitative comparison with a photon counting detector and with the presence of a bowtie filter are also performed the proposed method provides quantitative material and energyselective images examining realistic configurations for both dual and tripleenergy ct measurements compared to the polychromatic kv ct images virtual monochromatic images show superior image quality for the mouse phantom quantitative measurements show that the differences between gadodiamide and iodine concentrations obtained using tect and idealized photon counting ct pcct are smaller than 8 mgml and 1 mgml respectively tect outperforms dect for multicontrast ct imaging and is robust with respect to spectrum estimation for the thorax phantom the differences between the concentrations of the contrast map and the corresponding true reference values are smaller than 7 mgml for all of the realistic configurations a unified framework for both dual and tripleenergy ct imaging has been established for the accurate extraction of material compositions considering currently available commercial dect configurations the novel technique is promising to provide an urgently needed solution for several ctbased diagnosis and therapy applications
|
[['many', 'clinical', 'applications', 'depend', 'critically', 'on', 'the', 'accurate', 'differentiation', 'and', 'classification', 'of', 'different', 'types', 'of', 'materials', 'in', 'patient', 'anatomy', 'this', 'work', 'introduces', 'a', 'unified', 'framework', 'for', 'accurate', 'nonlinear', 'material', 'decomposition', 'and', 'applies', 'it', 'for', 'the', 'first', 'time', 'in', 'the', 'concept', 'of', 'tripleenergy', 'ct', 'tect', 'for', 'enhanced', 'material', 'differentiation', 'and', 'classification', 'as', 'well', 'as', 'dualenergy', 'ct', 'the', 'tripleenergy', 'data', 'acquisition', 'is', 'implemented', 'at', 'the', 'scales', 'of', 'microct', 'and', 'clinical', 'ct', 'imaging', 'with', 'commercial', 'twinbeam', 'dualsource', 'dect', 'configuration', 'and', 'a', 'fast', 'kv', 'switching', 'dect', 'configuration', 'material', 'decomposition', 'and', 'quantitative', 'comparison', 'with', 'a', 'photon', 'counting', 'detector', 'and', 'with', 'the', 'presence', 'of', 'a', 'bowtie', 'filter', 'are', 'also', 'performed', 'the', 'proposed', 'method', 'provides', 'quantitative', 'material', 'and', 'energyselective', 'images', 'examining', 'realistic', 'configurations', 'for', 'both', 'dual', 'and', 'tripleenergy', 'ct', 'measurements', 'compared', 'to', 'the', 'polychromatic', 'kv', 'ct', 'images', 'virtual', 'monochromatic', 'images', 'show', 'superior', 'image', 'quality', 'for', 'the', 'mouse', 'phantom', 'quantitative', 'measurements', 'show', 'that', 'the', 'differences', 'between', 'gadodiamide', 'and', 'iodine', 'concentrations', 'obtained', 'using', 'tect', 'and', 'idealized', 'photon', 'counting', 'ct', 'pcct', 'are', 'smaller', 'than', '8', 'mgml', 'and', '1', 'mgml', 'respectively', 'tect', 'outperforms', 'dect', 'for', 'multicontrast', 'ct', 'imaging', 'and', 'is', 'robust', 'with', 'respect', 'to', 'spectrum', 'estimation', 'for', 'the', 'thorax', 'phantom', 'the', 'differences', 'between', 'the', 'concentrations', 'of', 'the', 'contrast', 'map', 'and', 'the', 'corresponding', 'true', 'reference', 'values', 'are', 'smaller', 'than', '7', 'mgml', 'for', 'all', 'of', 'the', 'realistic', 'configurations', 'a', 'unified', 'framework', 'for', 'both', 'dual', 'and', 'tripleenergy', 'ct', 'imaging', 'has', 'been', 'established', 'for', 'the', 'accurate', 'extraction', 'of', 'material', 'compositions', 'considering', 'currently', 'available', 'commercial', 'dect', 'configurations', 'the', 'novel', 'technique', 'is', 'promising', 'to', 'provide', 'an', 'urgently', 'needed', 'solution', 'for', 'several', 'ctbased', 'diagnosis', 'and', 'therapy', 'applications']]
|
[0.0033228445081617828, 0.03096951448541115, -0.030279787314618944, 0.06239253378679882, -0.01870560097370961, -0.15294718460807966, -0.01674192703993226, 0.427034854888916, -0.18941451778252746, -0.3397218286327823, 0.13056897948940047, -0.29952466911311415, -0.10081035584615644, 0.2697782693421757, -0.06942972625865666, 0.06501749284975385, 0.08805842401438155, -0.007761781036112883, -0.06797083043062413, -0.16542132373794538, 0.2200476021348867, 0.043730532878634425, 0.3578503638751401, 0.03843895186644856, 0.12410512525369882, 0.03730918285856565, -0.021467088928803543, 0.030877831914054243, -0.10542353041901081, 0.128290050533102, 0.28753983209815687, 0.14414217774557714, 0.22118230909289605, -0.3942540459147142, -0.219463321205243, 0.07029337107290536, 0.11528435649098503, 0.06652934098789512, -0.0963119092806199, -0.27102691908872345, 0.11296777887307757, -0.12769877978026606, -0.03070928800360177, -0.1075556452982597, -0.008363142388046163, -0.0032197250316800302, -0.3206204154777752, 0.11171708784308447, -0.04359164210749328, 0.09580548758512045, -0.1396530093625188, -0.149075686738487, -0.0013029466194999513, 0.1523568200420357, -0.01852625369567193, 0.0666666570942589, 0.15141362284108015, -0.17960872811665976, -0.09210153696643435, 0.3475233466985325, 0.019336731251949162, -0.1726762314494916, 0.19153457492510537, -0.1137253571962288, -0.08237334432724733, 0.18643243897836223, 0.12937853770067034, 0.1559568364137076, -0.137207442606247, 0.006709976854568073, 0.017983181939944047, 0.18815432525738035, 0.07064469729761355, 0.0026535690606882176, 0.1277351499527924, 0.219947089953709, -0.004723668732642477, 0.13790426198699937, -0.18299423055199893, -0.010277511804209402, -0.22931506154813278, -0.2019028281804843, -0.14795142051433538, -0.00500002996851654, -0.10334736550977641, -0.16002088209051032, 0.39240017042372577, 0.152021586927477, 0.13914872347936758, 0.01680688859485162, 0.35572429582505494, 0.03568970351822876, 0.07714369695348477, -0.0226503074622186, 0.20131563638019295, 0.08792853164179756, 0.12579130182266524, -0.2109461203777022, 0.04064588601043982, 0.005771639725272796]
|
1,803.06009
|
Diffusion in mesoscopic lattice models of amorphous plasticity
|
We present results on tagged particle diffusion in a meso-scale lattice model
for sheared amorphous material in athermal quasi-static conditions. We find a
short time diffusive regime and a long time diffusive regime whose diffusion
coefficients depend on system size in dramatically different ways. At short
time, we find that the diffusion coefficient, $D$, scales roughly linearly with
system length, $D\sim L^{1.05}$. This short time behavior is consistent with
particle-based simulations. The long-time diffusion coefficient scales like
$D\sim L^{1.6}$, close to previous studies which found $D\sim L^{1.5}$.
Furthermore, we show that the near-field details of the interaction kernel do
not affect the short time behavior, but qualitatively and dramatically affect
the long time behavior, potentially causing a saturation of the mean-squared
displacement at long times. Our finding of a $D\sim L^{1.05}$ short time
scaling resolves a long standing puzzle about the disagreement between the
diffusion coefficient measured in particle-based models and meso-scale lattice
models of amorphous plasticity.
|
cond-mat.soft
|
we present results on tagged particle diffusion in a mesoscale lattice model for sheared amorphous material in athermal quasistatic conditions we find a short time diffusive regime and a long time diffusive regime whose diffusion coefficients depend on system size in dramatically different ways at short time we find that the diffusion coefficient d scales roughly linearly with system length dsim l105 this short time behavior is consistent with particlebased simulations the longtime diffusion coefficient scales like dsim l16 close to previous studies which found dsim l15 furthermore we show that the nearfield details of the interaction kernel do not affect the short time behavior but qualitatively and dramatically affect the long time behavior potentially causing a saturation of the meansquared displacement at long times our finding of a dsim l105 short time scaling resolves a long standing puzzle about the disagreement between the diffusion coefficient measured in particlebased models and mesoscale lattice models of amorphous plasticity
|
[['we', 'present', 'results', 'on', 'tagged', 'particle', 'diffusion', 'in', 'a', 'mesoscale', 'lattice', 'model', 'for', 'sheared', 'amorphous', 'material', 'in', 'athermal', 'quasistatic', 'conditions', 'we', 'find', 'a', 'short', 'time', 'diffusive', 'regime', 'and', 'a', 'long', 'time', 'diffusive', 'regime', 'whose', 'diffusion', 'coefficients', 'depend', 'on', 'system', 'size', 'in', 'dramatically', 'different', 'ways', 'at', 'short', 'time', 'we', 'find', 'that', 'the', 'diffusion', 'coefficient', 'd', 'scales', 'roughly', 'linearly', 'with', 'system', 'length', 'dsim', 'l105', 'this', 'short', 'time', 'behavior', 'is', 'consistent', 'with', 'particlebased', 'simulations', 'the', 'longtime', 'diffusion', 'coefficient', 'scales', 'like', 'dsim', 'l16', 'close', 'to', 'previous', 'studies', 'which', 'found', 'dsim', 'l15', 'furthermore', 'we', 'show', 'that', 'the', 'nearfield', 'details', 'of', 'the', 'interaction', 'kernel', 'do', 'not', 'affect', 'the', 'short', 'time', 'behavior', 'but', 'qualitatively', 'and', 'dramatically', 'affect', 'the', 'long', 'time', 'behavior', 'potentially', 'causing', 'a', 'saturation', 'of', 'the', 'meansquared', 'displacement', 'at', 'long', 'times', 'our', 'finding', 'of', 'a', 'dsim', 'l105', 'short', 'time', 'scaling', 'resolves', 'a', 'long', 'standing', 'puzzle', 'about', 'the', 'disagreement', 'between', 'the', 'diffusion', 'coefficient', 'measured', 'in', 'particlebased', 'models', 'and', 'mesoscale', 'lattice', 'models', 'of', 'amorphous', 'plasticity']]
|
[-0.15552072756503138, 0.21470091367260583, -0.09278893456944536, 0.0440951474716947, -0.007254763597983026, -0.1387271344552808, -0.012107265842027001, 0.3999883727981679, -0.32576277004554866, -0.26519147422344935, 0.050340980342439105, -0.2568888080441543, -0.1341473584093394, 0.17262314001338616, 0.03653133074422517, 0.042136277570839854, 0.0721353927176566, -0.013637116993026388, -0.03688596159279827, -0.20050062046897027, 0.1751256752992049, 0.10418058320346679, 0.27415378474059604, 0.08649424895223591, 0.11327705860077854, -0.028598552804079747, -0.01490308087198965, 0.05536064879307824, -0.2066851697896885, -0.03107004261372851, 0.1876508384419609, -0.05582385063171387, 0.24014377100693604, -0.48545642878499723, -0.2571702718554485, 0.046505293929048126, 0.176051055366594, 0.11841466023301285, 0.03639688446006227, -0.20038171985727404, 0.01617992208339274, -0.11366558947390126, -0.13193431039370837, 0.006027688096172266, 0.08538865555498389, 0.06016401764764821, -0.23076108055369507, 0.2053275961939606, 0.07129929218321077, 0.03803281995633076, -0.047069426933904326, -0.0955556077086517, 0.0685976518994017, 0.10953225020634672, 0.1085949155058892, 0.004589293551661314, 0.14353480514349234, -0.13074959617318405, -0.05355932160370773, 0.3488155871629715, -0.12758430490991282, -0.15063846235674236, 0.24636974814798562, -0.20756912402688496, -0.08482693973327837, 0.1816896238754834, 0.16627364677166748, 0.12910531005041012, -0.13404188433271502, 0.036583799930785095, -0.024222248071624385, 0.24998975784307526, 0.05290765836234054, 0.04397148838446986, 0.17138357491142328, 0.23936353020535242, -0.00800281866048012, 0.0653584941988811, -0.10223619774765065, -0.1293847284069465, -0.2695893756865013, -0.09646363182353877, -0.18838429390603015, 0.09592883303740828, -0.15299672958442956, -0.1655391108225881, 0.3602403767827538, 0.17845329145690605, 0.23270778263648673, 0.14772024744175255, 0.21502249696622452, 0.076296867902631, 0.0685797244715955, 0.10382913138657328, 0.212776518601083, 0.05804333094462392, 0.17380117466973682, -0.30173280309104633, 0.11766209916602219, 0.04947896597366179]
|
1,803.0601
|
Ridge Regression and Provable Deterministic Ridge Leverage Score
Sampling
|
Ridge leverage scores provide a balance between low-rank approximation and
regularization, and are ubiquitous in randomized linear algebra and machine
learning. Deterministic algorithms are also of interest in the moderately big
data regime, because deterministic algorithms provide interpretability to the
practitioner by having no failure probability and always returning the same
results.
We provide provable guarantees for deterministic column sampling using ridge
leverage scores. The matrix sketch returned by our algorithm is a column subset
of the original matrix, yielding additional interpretability. Like the
randomized counterparts, the deterministic algorithm provides (1 + {\epsilon})
error column subset selection, (1 + {\epsilon}) error projection-cost
preservation, and an additive-multiplicative spectral bound. We also show that
under the assumption of power-law decay of ridge leverage scores, this
deterministic algorithm is provably as accurate as randomized algorithms.
Lastly, ridge regression is frequently used to regularize ill-posed linear
least-squares problems. While ridge regression provides shrinkage for the
regression coefficients, many of the coefficients remain small but non-zero.
Performing ridge regression with the matrix sketch returned by our algorithm
and a particular regularization parameter forces coefficients to zero and has a
provable (1 + {\epsilon}) bound on the statistical risk. As such, it is an
interesting alternative to elastic net regularization.
|
math.ST cs.DS stat.CO stat.ML stat.TH
|
ridge leverage scores provide a balance between lowrank approximation and regularization and are ubiquitous in randomized linear algebra and machine learning deterministic algorithms are also of interest in the moderately big data regime because deterministic algorithms provide interpretability to the practitioner by having no failure probability and always returning the same results we provide provable guarantees for deterministic column sampling using ridge leverage scores the matrix sketch returned by our algorithm is a column subset of the original matrix yielding additional interpretability like the randomized counterparts the deterministic algorithm provides 1 epsilon error column subset selection 1 epsilon error projectioncost preservation and an additivemultiplicative spectral bound we also show that under the assumption of powerlaw decay of ridge leverage scores this deterministic algorithm is provably as accurate as randomized algorithms lastly ridge regression is frequently used to regularize illposed linear leastsquares problems while ridge regression provides shrinkage for the regression coefficients many of the coefficients remain small but nonzero performing ridge regression with the matrix sketch returned by our algorithm and a particular regularization parameter forces coefficients to zero and has a provable 1 epsilon bound on the statistical risk as such it is an interesting alternative to elastic net regularization
|
[['ridge', 'leverage', 'scores', 'provide', 'a', 'balance', 'between', 'lowrank', 'approximation', 'and', 'regularization', 'and', 'are', 'ubiquitous', 'in', 'randomized', 'linear', 'algebra', 'and', 'machine', 'learning', 'deterministic', 'algorithms', 'are', 'also', 'of', 'interest', 'in', 'the', 'moderately', 'big', 'data', 'regime', 'because', 'deterministic', 'algorithms', 'provide', 'interpretability', 'to', 'the', 'practitioner', 'by', 'having', 'no', 'failure', 'probability', 'and', 'always', 'returning', 'the', 'same', 'results', 'we', 'provide', 'provable', 'guarantees', 'for', 'deterministic', 'column', 'sampling', 'using', 'ridge', 'leverage', 'scores', 'the', 'matrix', 'sketch', 'returned', 'by', 'our', 'algorithm', 'is', 'a', 'column', 'subset', 'of', 'the', 'original', 'matrix', 'yielding', 'additional', 'interpretability', 'like', 'the', 'randomized', 'counterparts', 'the', 'deterministic', 'algorithm', 'provides', '1', 'epsilon', 'error', 'column', 'subset', 'selection', '1', 'epsilon', 'error', 'projectioncost', 'preservation', 'and', 'an', 'additivemultiplicative', 'spectral', 'bound', 'we', 'also', 'show', 'that', 'under', 'the', 'assumption', 'of', 'powerlaw', 'decay', 'of', 'ridge', 'leverage', 'scores', 'this', 'deterministic', 'algorithm', 'is', 'provably', 'as', 'accurate', 'as', 'randomized', 'algorithms', 'lastly', 'ridge', 'regression', 'is', 'frequently', 'used', 'to', 'regularize', 'illposed', 'linear', 'leastsquares', 'problems', 'while', 'ridge', 'regression', 'provides', 'shrinkage', 'for', 'the', 'regression', 'coefficients', 'many', 'of', 'the', 'coefficients', 'remain', 'small', 'but', 'nonzero', 'performing', 'ridge', 'regression', 'with', 'the', 'matrix', 'sketch', 'returned', 'by', 'our', 'algorithm', 'and', 'a', 'particular', 'regularization', 'parameter', 'forces', 'coefficients', 'to', 'zero', 'and', 'has', 'a', 'provable', '1', 'epsilon', 'bound', 'on', 'the', 'statistical', 'risk', 'as', 'such', 'it', 'is', 'an', 'interesting', 'alternative', 'to', 'elastic', 'net', 'regularization']]
|
[-0.0411027804542963, 0.0017404831444615247, -0.09766704825897567, 0.11729503804018526, -0.105006325798832, -0.22920902877749494, 0.07456627501341612, 0.4453385952183634, -0.31716398354990416, -0.2553775431402954, 0.14059746146100152, -0.26187395452711715, -0.16639796491719283, 0.14675667094395714, -0.10660710441764092, 0.15519676266576335, 0.06561757247566027, 0.021641760646795336, -0.0676652142790781, -0.2809131462404977, 0.2516971455750273, 0.08793675950126009, 0.24999507968615167, -0.011066336897421925, 0.1314620892418808, -0.0009888452043367634, -0.024717861222362712, 0.003747361599796669, -0.08293801178668182, 0.11990691838665536, 0.30290825136900135, 0.18689359501479147, 0.37664674388578356, -0.3633726918235866, -0.1566702970210926, 0.11269651503019516, 0.1421960143358516, 0.07841016620569005, -0.03887012269607379, -0.22894310136673166, 0.060463831180229376, -0.13165677312789925, -0.05388415892740517, -0.1570413283046928, -0.028778208667569936, -0.007004160804972887, -0.36883592454077146, 0.10917735405802606, 0.09208458156176652, 0.04570546576206512, -0.018280937148730702, -0.22753222799160291, 0.07625570347873188, 0.062061937120441925, 0.057994085523897586, 0.05544238618519435, 0.13344397565433339, -0.11969743620266035, -0.1294288211884394, 0.3316967753711995, -0.06257240973709531, -0.21397592264473142, 0.1573158734088847, -0.06281109515169811, -0.14318456325856088, 0.149587372599392, 0.20632685261398592, 0.0489594925702341, -0.09722115451571953, 0.08243383591402721, -0.0798451157074783, 0.17689896502650218, 0.051392834712357366, 0.013667265314085233, 0.08225854937756313, 0.14005987716819027, 0.138723185137366, 0.10014822037771243, -0.08599306224956553, -0.06071482857212016, -0.2732070168498811, -0.110195032598851, -0.2168201800407981, -0.02870424236958633, -0.20125281918900775, -0.22305191763496, 0.3207937795946847, 0.1456291203326847, 0.24001079701832426, 0.15321500107775726, 0.329233835592625, 0.11014687947741252, 0.011677878003843147, 0.16627583897959866, 0.21575055779791924, 0.12716226950079315, 0.041018689058148254, -0.1846205373549491, 0.17303200629979965, 0.09202796939774346]
|
1,803.06011
|
A Unified Theory of Regression Adjustment for Design-based Inference
|
Under the Neyman causal model, it is well-known that OLS with
treatment-by-covariate interactions cannot harm asymptotic precision of
estimated treatment effects in completely randomized experiments. But do such
guarantees extend to experiments with more complex designs? This paper proposes
a general framework for addressing this question and defines a class of
generalized regression estimators that are applicable to experiments of any
design. The class subsumes common estimators (e.g., OLS). Within that class,
two novel estimators are proposed that are applicable to arbitrary designs and
asymptotically optimal. The first is composed of three Horvitz-Thompson
estimators. The second recursively applies the principle of generalized
regression estimation to obtain regression-adjusted regression adjustment.
Additionally, variance bounds are derived that are tighter than those existing
in the literature for arbitrary designs. Finally, a simulation study
illustrates the potential for MSE improvements.
|
math.ST stat.TH
|
under the neyman causal model it is wellknown that ols with treatmentbycovariate interactions cannot harm asymptotic precision of estimated treatment effects in completely randomized experiments but do such guarantees extend to experiments with more complex designs this paper proposes a general framework for addressing this question and defines a class of generalized regression estimators that are applicable to experiments of any design the class subsumes common estimators eg ols within that class two novel estimators are proposed that are applicable to arbitrary designs and asymptotically optimal the first is composed of three horvitzthompson estimators the second recursively applies the principle of generalized regression estimation to obtain regressionadjusted regression adjustment additionally variance bounds are derived that are tighter than those existing in the literature for arbitrary designs finally a simulation study illustrates the potential for mse improvements
|
[['under', 'the', 'neyman', 'causal', 'model', 'it', 'is', 'wellknown', 'that', 'ols', 'with', 'treatmentbycovariate', 'interactions', 'can', 'not', 'harm', 'asymptotic', 'precision', 'of', 'estimated', 'treatment', 'effects', 'in', 'completely', 'randomized', 'experiments', 'but', 'do', 'such', 'guarantees', 'extend', 'to', 'experiments', 'with', 'more', 'complex', 'designs', 'this', 'paper', 'proposes', 'a', 'general', 'framework', 'for', 'addressing', 'this', 'question', 'and', 'defines', 'a', 'class', 'of', 'generalized', 'regression', 'estimators', 'that', 'are', 'applicable', 'to', 'experiments', 'of', 'any', 'design', 'the', 'class', 'subsumes', 'common', 'estimators', 'eg', 'ols', 'within', 'that', 'class', 'two', 'novel', 'estimators', 'are', 'proposed', 'that', 'are', 'applicable', 'to', 'arbitrary', 'designs', 'and', 'asymptotically', 'optimal', 'the', 'first', 'is', 'composed', 'of', 'three', 'horvitzthompson', 'estimators', 'the', 'second', 'recursively', 'applies', 'the', 'principle', 'of', 'generalized', 'regression', 'estimation', 'to', 'obtain', 'regressionadjusted', 'regression', 'adjustment', 'additionally', 'variance', 'bounds', 'are', 'derived', 'that', 'are', 'tighter', 'than', 'those', 'existing', 'in', 'the', 'literature', 'for', 'arbitrary', 'designs', 'finally', 'a', 'simulation', 'study', 'illustrates', 'the', 'potential', 'for', 'mse', 'improvements']]
|
[-0.05792201969479383, 0.026202911617993204, -0.07606158285375891, 0.12587571335801234, -0.10127951263690463, -0.22274294548357526, 0.015140352705148635, 0.39324835329833957, -0.20831730109122065, -0.2763177108950913, 0.14507493305330474, -0.246309726961233, -0.21001618750203677, 0.24886204478486132, -0.1379858953188415, 0.09674375876439391, 0.06568420015413452, -0.0191619794677805, -0.12011891527066904, -0.3177981804159504, 0.2842679017223418, 0.05445950330166077, 0.33317780216672904, -0.02447159092881958, 0.09374004556555991, 0.025041956068189056, -0.029180609414147005, 0.0770743731547285, -0.14024431603681511, 0.1422114666758312, 0.30770933697759, 0.1624296596860168, 0.33486261894167574, -0.33559014461934566, -0.2275299586735114, 0.1477071096430774, 0.12376439010377335, 0.10315059310998077, -0.01707167329355057, -0.2213508359035822, 0.07613987658017625, -0.16390075796559728, -0.07815262370018496, -0.11761617675807362, -0.08885183488018811, 0.022783614787342095, -0.39299776145705473, 0.0957235466412924, 0.09082695147436526, 0.011141041511048872, -0.035853375296142916, -0.1776521311633082, 0.07590445824726312, 0.0657818876620796, 0.03415211821578581, -0.047981631536795584, 0.10256173388549575, -0.054261556930012174, -0.15256911525675268, 0.345170195447281, -0.03425839929076136, -0.2730186266065748, 0.16798573454186597, -0.0962494898458115, -0.16304833166370236, 0.08536109529711582, 0.20604680463395736, 0.103317920482476, -0.1831391342708634, 0.05040255789386316, -0.07645735259133357, 0.10782683053554071, 0.03652046155701909, 0.01309254124838238, 0.13209831463517965, 0.1569758342337553, 0.1132568682319726, 0.1326965990855738, -0.0627096032085656, -0.10588232400240721, -0.31695692015518606, -0.09345412619618906, -0.15924852705664105, -0.04225688720870056, -0.12185684780965353, -0.18187150721938383, 0.3624936638503439, 0.22199805657275848, 0.12063903816527238, 0.1722417611559784, 0.3116611258023315, 0.08620718035661547, 0.05690359203489842, 0.10555332123508884, 0.24023080905726937, 0.10585629673053822, -0.017933441326022148, -0.15439003913995328, 0.13755831293485782, 0.04570827796123922]
|
1,803.06012
|
Nonequilibrium many-body quantum dynamics: from full random matrices to
real systems
|
We present an overview of our studies on the nonequilibrium dynamics of
quantum systems that have many interacting particles. Our emphasis is on
systems that show strong level repulsion, referred to as chaotic systems. We
discuss how full random matrices can guide and support our studies of realistic
systems. We show that features of the dynamics can be anticipated from a
detailed analysis of the spectrum and the structure of the initial state
projected onto the energy eigenbasis. On the other way round, if we only have
access to the dynamics, we can use it to infer the properties of the spectrum
of the system. Our focus is on the survival probability, but results for other
observables, such as the spin density imbalance and Shannon entropy are also
mentioned.
|
cond-mat.stat-mech
|
we present an overview of our studies on the nonequilibrium dynamics of quantum systems that have many interacting particles our emphasis is on systems that show strong level repulsion referred to as chaotic systems we discuss how full random matrices can guide and support our studies of realistic systems we show that features of the dynamics can be anticipated from a detailed analysis of the spectrum and the structure of the initial state projected onto the energy eigenbasis on the other way round if we only have access to the dynamics we can use it to infer the properties of the spectrum of the system our focus is on the survival probability but results for other observables such as the spin density imbalance and shannon entropy are also mentioned
|
[['we', 'present', 'an', 'overview', 'of', 'our', 'studies', 'on', 'the', 'nonequilibrium', 'dynamics', 'of', 'quantum', 'systems', 'that', 'have', 'many', 'interacting', 'particles', 'our', 'emphasis', 'is', 'on', 'systems', 'that', 'show', 'strong', 'level', 'repulsion', 'referred', 'to', 'as', 'chaotic', 'systems', 'we', 'discuss', 'how', 'full', 'random', 'matrices', 'can', 'guide', 'and', 'support', 'our', 'studies', 'of', 'realistic', 'systems', 'we', 'show', 'that', 'features', 'of', 'the', 'dynamics', 'can', 'be', 'anticipated', 'from', 'a', 'detailed', 'analysis', 'of', 'the', 'spectrum', 'and', 'the', 'structure', 'of', 'the', 'initial', 'state', 'projected', 'onto', 'the', 'energy', 'eigenbasis', 'on', 'the', 'other', 'way', 'round', 'if', 'we', 'only', 'have', 'access', 'to', 'the', 'dynamics', 'we', 'can', 'use', 'it', 'to', 'infer', 'the', 'properties', 'of', 'the', 'spectrum', 'of', 'the', 'system', 'our', 'focus', 'is', 'on', 'the', 'survival', 'probability', 'but', 'results', 'for', 'other', 'observables', 'such', 'as', 'the', 'spin', 'density', 'imbalance', 'and', 'shannon', 'entropy', 'are', 'also', 'mentioned']]
|
[-0.13271702604563257, 0.10522831235066969, -0.1269576197865513, 0.07989019222102713, -0.0059143392542420434, -0.08081729602891692, 0.02379487765693041, 0.3676113230717737, -0.25111755419724674, -0.2749016052364668, 0.12081855235534698, -0.3059489240494463, -0.16363788359119852, 0.2119363149873508, -0.013043052386925665, 0.0460367691973874, 0.0904777590329795, 0.0727075841223691, -0.05899087848437791, -0.22026207116468585, 0.35018617537751606, 0.06346845397880922, 0.27481805377228313, 0.05661556231897584, 0.05476490585783193, 0.01870508519066281, 0.020266566115121048, 0.02214330801913558, -0.11738694615046405, 0.09786624144293483, 0.18784242322625117, 0.14765258250368196, 0.2351936002157253, -0.43600411997573785, -0.25430752660956435, 0.07410573179819152, 0.1410259926211551, 0.14699732986560396, -0.05508400394776186, -0.2829591714408855, 0.055926768444911686, -0.18215800304861032, -0.12218058186532683, -0.12155174367967271, -0.012078634788130605, 0.07609872301217428, -0.22631217061240558, 0.05914047282245985, 0.0744363364471166, 0.013499768609686415, -0.05298203917747262, -0.10861401258004007, -0.042412429968573785, 0.15623473868048351, 0.016335870363107022, -0.014391577050636718, 0.1545906768454773, -0.12357954430942561, -0.11449369776438084, 0.3789989084886142, -0.0531946144684023, -0.2082736633371475, 0.2624649515343007, -0.16478548671909457, -0.16207063937011038, 0.05426116696786309, 0.2147115095800092, 0.10551711828122999, -0.12196894172017729, 0.06371158651345185, -0.05782404714606904, 0.19382937557547708, -0.045597265304838736, 0.08704679207731933, 0.22707161943377682, 0.16470042443581562, 0.07435554592254709, 0.1413199920369702, -0.07849227759784969, -0.13595285576717683, -0.28055184811007144, -0.15336900565397832, -0.20269313648834017, 0.06367876804740594, -0.026725049798088978, -0.13134115631353696, 0.4124702752293485, 0.2072478815545003, 0.22843093360781438, 0.026901457146488766, 0.2856806660388676, 0.1383634199326959, 0.034922257986266254, 0.04760853801095902, 0.23936396585993988, 0.10734766089292459, 0.05890513337108978, -0.23562002679614655, 0.05972548705244134, 0.009262204157592829]
|
1,803.06013
|
Small-scale displacement fluctuations of vesicles in fibroblasts
|
The intracellular environment is a dynamic space filled with various
organelles moving in all directions. Included in this diverse group of
organelles are vesicles, which are involved in transport of molecular cargo
throughout the cell. Vesicles move in either a directed or non-directed
fashion, often depending on interactions with cytoskeletal proteins such as
microtubules, actin filaments, and molecular motors. How these proteins affect
the local fluctuations of vesicles in the cytoplasm is not clear since they
have the potential to both facilitate and impede movement. Here we show that
vesicle mobility is significantly affected by myosin-II, even though it is not
a cargo transport motor. We find that myosin-II activity increases the
effective diffusivity of vesicles and its inhibition facilitates longer states
of non-directed motion. Our study suggests that altering myosin-II activity in
the cytoplasm of cells can modulate the mobility of vesicles, providing a
possible mechanism for cells to dynamically tune the cytoplasmic environment in
space and time.
|
physics.bio-ph q-bio.SC
|
the intracellular environment is a dynamic space filled with various organelles moving in all directions included in this diverse group of organelles are vesicles which are involved in transport of molecular cargo throughout the cell vesicles move in either a directed or nondirected fashion often depending on interactions with cytoskeletal proteins such as microtubules actin filaments and molecular motors how these proteins affect the local fluctuations of vesicles in the cytoplasm is not clear since they have the potential to both facilitate and impede movement here we show that vesicle mobility is significantly affected by myosinii even though it is not a cargo transport motor we find that myosinii activity increases the effective diffusivity of vesicles and its inhibition facilitates longer states of nondirected motion our study suggests that altering myosinii activity in the cytoplasm of cells can modulate the mobility of vesicles providing a possible mechanism for cells to dynamically tune the cytoplasmic environment in space and time
|
[['the', 'intracellular', 'environment', 'is', 'a', 'dynamic', 'space', 'filled', 'with', 'various', 'organelles', 'moving', 'in', 'all', 'directions', 'included', 'in', 'this', 'diverse', 'group', 'of', 'organelles', 'are', 'vesicles', 'which', 'are', 'involved', 'in', 'transport', 'of', 'molecular', 'cargo', 'throughout', 'the', 'cell', 'vesicles', 'move', 'in', 'either', 'a', 'directed', 'or', 'nondirected', 'fashion', 'often', 'depending', 'on', 'interactions', 'with', 'cytoskeletal', 'proteins', 'such', 'as', 'microtubules', 'actin', 'filaments', 'and', 'molecular', 'motors', 'how', 'these', 'proteins', 'affect', 'the', 'local', 'fluctuations', 'of', 'vesicles', 'in', 'the', 'cytoplasm', 'is', 'not', 'clear', 'since', 'they', 'have', 'the', 'potential', 'to', 'both', 'facilitate', 'and', 'impede', 'movement', 'here', 'we', 'show', 'that', 'vesicle', 'mobility', 'is', 'significantly', 'affected', 'by', 'myosinii', 'even', 'though', 'it', 'is', 'not', 'a', 'cargo', 'transport', 'motor', 'we', 'find', 'that', 'myosinii', 'activity', 'increases', 'the', 'effective', 'diffusivity', 'of', 'vesicles', 'and', 'its', 'inhibition', 'facilitates', 'longer', 'states', 'of', 'nondirected', 'motion', 'our', 'study', 'suggests', 'that', 'altering', 'myosinii', 'activity', 'in', 'the', 'cytoplasm', 'of', 'cells', 'can', 'modulate', 'the', 'mobility', 'of', 'vesicles', 'providing', 'a', 'possible', 'mechanism', 'for', 'cells', 'to', 'dynamically', 'tune', 'the', 'cytoplasmic', 'environment', 'in', 'space', 'and', 'time']]
|
[-0.16407512988215722, 0.24780581820223177, -0.029682593726561807, 0.019782940585476656, -0.032457398748758935, -0.13497480706446482, 0.0472673043180711, 0.4489835670581029, -0.29236892294618244, -0.24392729209232256, 0.017459720483711635, -0.22954735899074646, -0.24738849147000355, 0.14326937734910855, -0.07765610217930949, -0.0674125617900834, 0.07117422546388921, 0.004632316213452591, 0.12860739031336535, -0.15111973620336153, 0.17541372221923848, 0.04263520859322458, 0.27810829782817487, 0.0687088608191167, 0.09955643501671606, -0.047314418544231344, 0.019662183844162233, 0.06313835620937236, -0.1319722184920431, 0.11850840826013635, 0.2231072893354503, 0.031739737793112045, 0.23312494521682392, -0.5579024161323436, -0.2820266288406444, 0.08820734679283071, 0.2615850905509982, 0.1415486769104939, -0.03056052920434905, -0.23992192209258956, 0.07177274933567347, -0.13456989784063128, -0.0918241377931627, -0.07739690590192969, 0.05142632118790885, 0.12255189602509281, -0.197628416027288, 0.14917340560332262, 0.040442221493419236, 0.09825530082335895, -0.12142461732852876, -0.06665033217425803, -0.09702849383949179, 0.22202146324071353, 0.07664449089104251, 0.014132517416311323, 0.3797740454188074, -0.18053487876764024, -0.07523515517676964, 0.39470945545852937, 0.03354667042237092, -0.2540616261249858, 0.24915280336010381, -0.14627138967772232, -0.10802309030653036, 0.15921528070268906, 0.16970596726948642, 0.07911381812520185, -0.16202446411849944, -0.01944033935250211, -0.031187076727806958, 0.1571323678743844, 0.05929890948013877, -0.017397991735956766, 0.2126694409112276, 0.23742498873891132, 0.07536084461025894, 0.08690226646638094, -0.0618296143285485, -0.1184916796233013, -0.17301947792183678, -0.19032504292696995, -0.1189366173234903, 0.019205346191192116, -0.06293846684348413, -0.16833548894761213, 0.3609831152050375, 0.09143922320250773, 0.20557182708626273, 0.05265103618121258, 0.24460384344576663, -0.04539439969830824, 0.11658684204994414, 0.05487811945542787, 0.20265842765663405, 0.07004978641744633, 0.13862847982841375, -0.3040368640077822, 0.14249021619131477, 0.00029514161225572324]
|
1,803.06014
|
Quantum noise in a transversely pumped cavity Bose--Hubbard model
|
We investigate the quantum measurement noise effects on the dynamics of an
atomic Bose lattice gas inside an optical resonator. We describe the dynamics
by means of a hybrid model consisting of a Bose--Hubbard Hamiltonian for the
atoms and a Heisenberg--Langevin equation for the lossy cavity field mode. We
assume that the atoms are prepared initially in the ground state of the lattice
Hamiltonian and then start to interact with the cavity mode. We show that the
cavity field fluctuations originating from the dissipative outcoupling of
photons from the resonator lead to vastly different effects in the different
possible ground state phases, i.e., the superfluid, the supersolid, the Mott-
and the charge-density-wave phases. In the former two phases with the presence
of a superfluid wavefunction, the quantum measurement noise appears as a
driving term leading to excess noise depletion of the ground state. The time
scale for the system to leave the ground scale is determined analytically. For
the latter two incompressible phases, the quantum noise results in the
fluctuation of the chemical potential. We derive an analytical expression for
the corresponding broadening of the quasiparticle resonances.
|
cond-mat.quant-gas quant-ph
|
we investigate the quantum measurement noise effects on the dynamics of an atomic bose lattice gas inside an optical resonator we describe the dynamics by means of a hybrid model consisting of a bosehubbard hamiltonian for the atoms and a heisenberglangevin equation for the lossy cavity field mode we assume that the atoms are prepared initially in the ground state of the lattice hamiltonian and then start to interact with the cavity mode we show that the cavity field fluctuations originating from the dissipative outcoupling of photons from the resonator lead to vastly different effects in the different possible ground state phases ie the superfluid the supersolid the mott and the chargedensitywave phases in the former two phases with the presence of a superfluid wavefunction the quantum measurement noise appears as a driving term leading to excess noise depletion of the ground state the time scale for the system to leave the ground scale is determined analytically for the latter two incompressible phases the quantum noise results in the fluctuation of the chemical potential we derive an analytical expression for the corresponding broadening of the quasiparticle resonances
|
[['we', 'investigate', 'the', 'quantum', 'measurement', 'noise', 'effects', 'on', 'the', 'dynamics', 'of', 'an', 'atomic', 'bose', 'lattice', 'gas', 'inside', 'an', 'optical', 'resonator', 'we', 'describe', 'the', 'dynamics', 'by', 'means', 'of', 'a', 'hybrid', 'model', 'consisting', 'of', 'a', 'bosehubbard', 'hamiltonian', 'for', 'the', 'atoms', 'and', 'a', 'heisenberglangevin', 'equation', 'for', 'the', 'lossy', 'cavity', 'field', 'mode', 'we', 'assume', 'that', 'the', 'atoms', 'are', 'prepared', 'initially', 'in', 'the', 'ground', 'state', 'of', 'the', 'lattice', 'hamiltonian', 'and', 'then', 'start', 'to', 'interact', 'with', 'the', 'cavity', 'mode', 'we', 'show', 'that', 'the', 'cavity', 'field', 'fluctuations', 'originating', 'from', 'the', 'dissipative', 'outcoupling', 'of', 'photons', 'from', 'the', 'resonator', 'lead', 'to', 'vastly', 'different', 'effects', 'in', 'the', 'different', 'possible', 'ground', 'state', 'phases', 'ie', 'the', 'superfluid', 'the', 'supersolid', 'the', 'mott', 'and', 'the', 'chargedensitywave', 'phases', 'in', 'the', 'former', 'two', 'phases', 'with', 'the', 'presence', 'of', 'a', 'superfluid', 'wavefunction', 'the', 'quantum', 'measurement', 'noise', 'appears', 'as', 'a', 'driving', 'term', 'leading', 'to', 'excess', 'noise', 'depletion', 'of', 'the', 'ground', 'state', 'the', 'time', 'scale', 'for', 'the', 'system', 'to', 'leave', 'the', 'ground', 'scale', 'is', 'determined', 'analytically', 'for', 'the', 'latter', 'two', 'incompressible', 'phases', 'the', 'quantum', 'noise', 'results', 'in', 'the', 'fluctuation', 'of', 'the', 'chemical', 'potential', 'we', 'derive', 'an', 'analytical', 'expression', 'for', 'the', 'corresponding', 'broadening', 'of', 'the', 'quasiparticle', 'resonances']]
|
[-0.1781348906739747, 0.23256972045561405, -0.08397411785765806, 0.016245008852329094, 0.03252325097676666, -0.12033569950729928, 0.057002098763356594, 0.32898484707316933, -0.2611991693078974, -0.24206339707349073, 0.0365209319120781, -0.29908256947105244, -0.07479383737685527, 0.1366466193803571, 0.04072173954209283, 0.04566425528566547, 0.024035744569177196, 0.020251136667837195, -0.04883967554613818, -0.17913462989092033, 0.35249904854432307, 0.013124516229444048, 0.2871255351848064, 0.023308957792459964, 0.08738539027010295, -0.026216540847939843, 0.08142478798919502, -0.02401419244158794, -0.13480128071255007, 0.04192013082338527, 0.189767886757512, -0.010882010860219199, 0.2140715657334954, -0.4770891779416146, -0.21244882008656585, 0.07325709591505122, 0.14466211944071447, 0.21650590009509244, -0.02900938980373489, -0.33811849827895607, -0.05015509873429403, -0.1854491524341053, -0.15571099172849306, -0.07012376196180996, -0.014298813510935177, -0.005723563420093235, -0.25304742883841064, 0.08900483220287743, 0.05167968557365637, 0.040939416423848365, -0.10583273885911082, -0.05934033265155566, -0.0007395777741775793, 0.10772733842047619, -0.014751962130771169, 0.009398824712112147, 0.15929846279074084, -0.1732272637614552, -0.09141754413292529, 0.396601857491744, -0.11355989505686265, -0.16157225039112133, 0.17561173185775864, -0.15168934992799674, -0.03907557180709141, 0.16413070993587614, 0.11668870862533542, 0.035257127502980455, -0.1288500145217155, 0.041279304950973664, 0.0015648774015791912, 0.20274529558292684, 0.015558487204037965, 0.10385354609044398, 0.22500888238982222, 0.15149015455661133, 0.02837250978352233, 0.20690940202333352, -0.13001903752736588, -0.13593708115964778, -0.2889921713276781, -0.15087005054269403, -0.22896577631475723, 0.03810970350865892, -0.06083970912024043, -0.18045439291371898, 0.4268064734072768, 0.15051393356064663, 0.1716354530762861, -0.03371560987194672, 0.2917400795448432, 0.14781823737315217, 0.006978895642202009, 0.04077146266323121, 0.2920317212692437, 0.16314861073935613, 0.0781172612921041, -0.33941217063413187, -0.011695255587664358, 0.027656400287374455]
|
1,803.06015
|
Database Perspectives on Blockchains
|
Modern blockchain systems are a fresh look at the paradigm of distributed
computing, applied under assumptions of large-scale public networks. They can
be used to store and share information without a trusted central party. There
has been much effort to develop blockchain systems for a myriad of uses,
ranging from cryptocurrencies to identity control, supply chain management,
etc. None of this work has directly studied the fundamental database issues
that arise when using blockchains as the underlying infrastructure to manage
data.
The key difference between using blockchains to store data and centrally
controlled databases is that transactions are accepted to a blockchain via a
consensus mechanism. Hence, once a user has issued a transaction, she cannot be
certain if it will be accepted. Moreover, a yet unaccepted transaction cannot
be retracted by the user, and may be appended to the blockchain in the future.
This causes difficulties as the user may wish to reissue a transaction, if it
was not accepted. Yet this data may then become appended twice to the
blockchain.
In this paper we present a database perspective on blockchains by introducing
formal foundations for blockchains as a storage layer that underlies a
database. The main issue that we tackle is uncertainty in transaction appending
that is a result of the consensus mechanism. We study two flavors of
transaction appending problems: (1) the complexity of determining whether it is
possible for a denial constraint to be contradicted, given the state of the
blockchain, pending transactions, and integrity constraints and (2) the
complexity of generating transactions that are mutually (in)consistent with
given subsets of pending transactions. Solving these problems is critical to
ensure that users can issue transactions consistent with their intentions.
Finally, we chart important directions for future work.
|
cs.DB
|
modern blockchain systems are a fresh look at the paradigm of distributed computing applied under assumptions of largescale public networks they can be used to store and share information without a trusted central party there has been much effort to develop blockchain systems for a myriad of uses ranging from cryptocurrencies to identity control supply chain management etc none of this work has directly studied the fundamental database issues that arise when using blockchains as the underlying infrastructure to manage data the key difference between using blockchains to store data and centrally controlled databases is that transactions are accepted to a blockchain via a consensus mechanism hence once a user has issued a transaction she cannot be certain if it will be accepted moreover a yet unaccepted transaction cannot be retracted by the user and may be appended to the blockchain in the future this causes difficulties as the user may wish to reissue a transaction if it was not accepted yet this data may then become appended twice to the blockchain in this paper we present a database perspective on blockchains by introducing formal foundations for blockchains as a storage layer that underlies a database the main issue that we tackle is uncertainty in transaction appending that is a result of the consensus mechanism we study two flavors of transaction appending problems 1 the complexity of determining whether it is possible for a denial constraint to be contradicted given the state of the blockchain pending transactions and integrity constraints and 2 the complexity of generating transactions that are mutually inconsistent with given subsets of pending transactions solving these problems is critical to ensure that users can issue transactions consistent with their intentions finally we chart important directions for future work
|
[['modern', 'blockchain', 'systems', 'are', 'a', 'fresh', 'look', 'at', 'the', 'paradigm', 'of', 'distributed', 'computing', 'applied', 'under', 'assumptions', 'of', 'largescale', 'public', 'networks', 'they', 'can', 'be', 'used', 'to', 'store', 'and', 'share', 'information', 'without', 'a', 'trusted', 'central', 'party', 'there', 'has', 'been', 'much', 'effort', 'to', 'develop', 'blockchain', 'systems', 'for', 'a', 'myriad', 'of', 'uses', 'ranging', 'from', 'cryptocurrencies', 'to', 'identity', 'control', 'supply', 'chain', 'management', 'etc', 'none', 'of', 'this', 'work', 'has', 'directly', 'studied', 'the', 'fundamental', 'database', 'issues', 'that', 'arise', 'when', 'using', 'blockchains', 'as', 'the', 'underlying', 'infrastructure', 'to', 'manage', 'data', 'the', 'key', 'difference', 'between', 'using', 'blockchains', 'to', 'store', 'data', 'and', 'centrally', 'controlled', 'databases', 'is', 'that', 'transactions', 'are', 'accepted', 'to', 'a', 'blockchain', 'via', 'a', 'consensus', 'mechanism', 'hence', 'once', 'a', 'user', 'has', 'issued', 'a', 'transaction', 'she', 'can', 'not', 'be', 'certain', 'if', 'it', 'will', 'be', 'accepted', 'moreover', 'a', 'yet', 'unaccepted', 'transaction', 'can', 'not', 'be', 'retracted', 'by', 'the', 'user', 'and', 'may', 'be', 'appended', 'to', 'the', 'blockchain', 'in', 'the', 'future', 'this', 'causes', 'difficulties', 'as', 'the', 'user', 'may', 'wish', 'to', 'reissue', 'a', 'transaction', 'if', 'it', 'was', 'not', 'accepted', 'yet', 'this', 'data', 'may', 'then', 'become', 'appended', 'twice', 'to', 'the', 'blockchain', 'in', 'this', 'paper', 'we', 'present', 'a', 'database', 'perspective', 'on', 'blockchains', 'by', 'introducing', 'formal', 'foundations', 'for', 'blockchains', 'as', 'a', 'storage', 'layer', 'that', 'underlies', 'a', 'database', 'the', 'main', 'issue', 'that', 'we', 'tackle', 'is', 'uncertainty', 'in', 'transaction', 'appending', 'that', 'is', 'a', 'result', 'of', 'the', 'consensus', 'mechanism', 'we', 'study', 'two', 'flavors', 'of', 'transaction', 'appending', 'problems', '1', 'the', 'complexity', 'of', 'determining', 'whether', 'it', 'is', 'possible', 'for', 'a', 'denial', 'constraint', 'to', 'be', 'contradicted', 'given', 'the', 'state', 'of', 'the', 'blockchain', 'pending', 'transactions', 'and', 'integrity', 'constraints', 'and', '2', 'the', 'complexity', 'of', 'generating', 'transactions', 'that', 'are', 'mutually', 'inconsistent', 'with', 'given', 'subsets', 'of', 'pending', 'transactions', 'solving', 'these', 'problems', 'is', 'critical', 'to', 'ensure', 'that', 'users', 'can', 'issue', 'transactions', 'consistent', 'with', 'their', 'intentions', 'finally', 'we', 'chart', 'important', 'directions', 'for', 'future', 'work']]
|
[-0.16098028891822436, 0.05295260412834661, -0.098726147640363, 0.07039880468835895, -0.13867867710911144, -0.1966015986507002, 0.11584521936047695, 0.36378720682909005, -0.32570799951578266, -0.3091437358060715, 0.1859447685505006, -0.303292231909802, -0.0952185193138712, 0.1616067798719217, -0.15079373026142728, 0.05116222992955799, 0.050781147137018375, 0.029227562189903175, 0.01811663419307836, -0.3216537999938029, 0.2947336163602447, 0.05586031889987938, 0.2799073962666374, 0.08269369094247164, 0.05948215445776553, -0.022029515943265878, -0.021076788558424434, 0.02096635410931667, -0.07045493323229068, 0.14375251537958103, 0.34010316043100464, 0.22862315743783354, 0.34585710111433327, -0.4702101214550461, -0.15127802233659876, 0.12355905674626803, 0.12821230515933027, 0.1154817151439729, -0.05666043853415844, -0.264130477076746, 0.1376778065356499, -0.23151389046956755, -0.0882577101728615, -0.08156395820923047, 0.023058024835820493, -0.010104418119158177, -0.2535137952807591, -0.007781168744730868, 0.02806510433392542, 0.04470015153147395, -0.0015338606681077147, -0.044925385880293545, -0.02246958684095153, 0.16514795266499874, 0.05588327459097501, 0.019932786607081802, 0.1466843152695666, -0.09211393487687404, -0.16080756084465042, 0.413977305725878, 0.027566729385029118, -0.17166521028697382, 0.14166937136796937, -0.04463959040291887, -0.18588074397076393, 0.05487763517418616, 0.17723166089148956, 0.0365624441270583, -0.23190257233535155, 0.04589804125691084, -0.06171809737141476, 0.21673764419064892, 0.051127962746423804, 0.03855827859040261, 0.23141898434456604, 0.17095172569336872, 0.08931299675980729, 0.09426275035128023, 0.008621805895806477, -0.1254675324973269, -0.24039400717300766, -0.14233092397511793, -0.187529776034775, 0.04908448966225385, -0.030714088308443348, -0.1415500903570446, 0.3355391710804324, 0.2074461922639775, 0.13167526915911013, 0.011204508265789118, 0.3325081461080614, 0.06426144457631189, 0.13242459898010378, 0.12291050705829883, 0.16609044618103588, 0.014097873819991946, 0.16304118187030073, -0.11296904871300652, 0.19229319466197697, -0.010790680029744175]
|
1,803.06016
|
Twist-minimal trace formulas and the Selberg eigenvalue conjecture
|
We derive a fully explicit version of the Selberg trace formula for
twist-minimal Maass forms of weight 0 and arbitrary conductor and nebentypus
character, and apply it to prove two theorems. First, conditional on Artin's
conjecture, we classify the even 2-dimensional Artin representations of small
conductor; in particular, we show that the even icosahedral representation of
smallest conductor is the one found by Doud and Moore, of conductor 1951.
Second, we verify the Selberg eigenvalue conjecture for groups of small level,
improving on a result of Huxley from 1985.
|
math.NT
|
we derive a fully explicit version of the selberg trace formula for twistminimal maass forms of weight 0 and arbitrary conductor and nebentypus character and apply it to prove two theorems first conditional on artins conjecture we classify the even 2dimensional artin representations of small conductor in particular we show that the even icosahedral representation of smallest conductor is the one found by doud and moore of conductor 1951 second we verify the selberg eigenvalue conjecture for groups of small level improving on a result of huxley from 1985
|
[['we', 'derive', 'a', 'fully', 'explicit', 'version', 'of', 'the', 'selberg', 'trace', 'formula', 'for', 'twistminimal', 'maass', 'forms', 'of', 'weight', '0', 'and', 'arbitrary', 'conductor', 'and', 'nebentypus', 'character', 'and', 'apply', 'it', 'to', 'prove', 'two', 'theorems', 'first', 'conditional', 'on', 'artins', 'conjecture', 'we', 'classify', 'the', 'even', '2dimensional', 'artin', 'representations', 'of', 'small', 'conductor', 'in', 'particular', 'we', 'show', 'that', 'the', 'even', 'icosahedral', 'representation', 'of', 'smallest', 'conductor', 'is', 'the', 'one', 'found', 'by', 'doud', 'and', 'moore', 'of', 'conductor', '1951', 'second', 'we', 'verify', 'the', 'selberg', 'eigenvalue', 'conjecture', 'for', 'groups', 'of', 'small', 'level', 'improving', 'on', 'a', 'result', 'of', 'huxley', 'from', '1985']]
|
[-0.17518026782834734, 0.033727783693228215, -0.11230667094192044, 0.08779486953624821, -0.061624795621768994, -0.16658588607837868, 0.029199876729928128, 0.2676058097805997, -0.24721020417531359, -0.2508815838479098, 0.08099722537603653, -0.26972525768955663, -0.17798371270658786, 0.2375650132731111, -0.10139857698231936, 0.007845269022668204, 0.04468861950127492, 0.0925714284610215, -0.054137633846204895, -0.3025858962421559, 0.3748878017702902, -0.048961501134644175, 0.20885384176587898, 0.08545924787176773, 0.055708303915294397, 0.04136706006565047, 0.014255098479969258, -0.08577826390550895, -0.1426402535617771, 0.17104632047597657, 0.2662149444328282, 0.0038218303525354713, 0.21465085064516065, -0.41478120342997665, -0.13512541813278486, 0.13044851840029217, 0.08076664198465137, 0.08062284437156367, -0.002100750467930497, -0.2780912930823185, 0.15553956985769962, -0.2011095762718469, -0.193744665408634, -0.08384390771441924, 0.043985909994014284, -0.003700598143041134, -0.25103263614371163, 0.06716680408201435, 0.15530663363593208, 0.11403086868284101, -0.12348786932522092, -0.16292296536795964, 0.025907718888695606, 0.11399124870711769, 0.002026750576491891, -0.013741916530720615, 0.04119308989241042, -0.14679186878625347, -0.08680667582137341, 0.317399865609001, -0.07690933186941865, -0.1590639921434393, 0.09598851566972205, -0.2073550446829441, -0.18440286498199301, 0.09481937721879645, 0.09344529328253967, 0.13119714690203016, -0.009309386395298961, 0.15590727683527142, -0.1504798844451381, 0.1189927062673219, 0.17965569184161723, -0.08597383355531334, 0.0923477024559609, 0.042305256306214935, 0.048595607751684096, 0.19721320235509088, -0.02730914436555891, 0.004401545744092966, -0.2908494107594544, -0.2746601694538681, -0.2167470839657736, 0.12575032588475468, -0.084873780546993, -0.19407089822131887, 0.3605708189795471, 0.10144601331558079, 0.15050819813041016, 0.18093761963113633, 0.20505242397352544, 0.14006501766429705, 0.046704982947134835, 0.0779737483932298, 0.11732894403923472, 0.2527898270980751, -0.041107609000226315, -0.12861734873182618, 0.013844603383238957, 0.2067401680820198]
|
1,803.06017
|
On the set of local extrema of a subanalytic function
|
Let ${\mathfrak F}$ be a category of subanalytic subsets of real analytic
manifolds that is closed under basic set-theoretical and basic topological
operations. Let $M$ be a real analytic manifold and denote ${\mathfrak F}(M)$
the family of the subsets of $M$ that belong to ${\mathfrak F}$. Let
$f:X\to{\mathbb R}$ be a subanalytic function on a subset $X\in{\mathfrak
F}(M)$ such that the inverse image under $f$ of each interval of ${\mathbb R}$
belongs to ${\mathfrak F}(M)$. Let ${\rm Max}(f)$ be the set of local maxima of
$f$ and consider ${\rm Max}_\lambda(f):={\rm Max}(f)\cap\{f=\lambda\}$ for each
$\lambda\in{\mathbb R}$. If $f$ is continuous, then ${\rm
Max}(f)=\bigsqcup_{\lambda\in{\mathbb R}}{\rm Max}_\lambda(f)\in{\mathfrak
F}(M)$ if and only if the family $\{{\rm Max}_\lambda(f)\}_{\lambda\in{\mathbb
R}}$ is locally finite in $M$. If we erase continuity condition, there exist
subanalytic functions $f:X\to M$ such that ${\rm Max}(f)\in{\mathfrak F}(M)$,
but the family $\{{\rm Max}_\lambda(f)\}_{\lambda\in{\mathbb R}}$ is not
locally finite in $M$ or such that ${\rm Max}(f)$ is connected but it is not
even subanalytic. If ${\mathfrak F}$ is the category of subanalytic sets and
$f:X\to{\mathbb R}$ is a subanalytic map $f$ that maps relatively compact
subsets of $M$ contained in $X$ to bounded subsets of ${\mathbb R}$, then ${\rm
Max}(f)\in{\mathfrak F}(M)$ and the family $\{{\rm
Max}_\lambda(f)\}_{\lambda\in{\mathbb R}}$ is locally finite in $M$. If the
category ${\mathfrak F}$ contains the intersections of algebraic sets with real
analytic submanifolds and $X\in{\mathfrak F}(M)$ is not closed in $M$, there
exists a continuous subanalytic function $f:X\to{\mathbb R}$ with graph
belonging to ${\mathfrak F}(M\times{\mathbb R})$ such that inverse images under
$f$ of the intervals of ${\mathbb R}$ belong to ${\mathfrak F}(M)$ but ${\rm
Max}(f)$ does not belong to ${\mathfrak F}(M)$.
|
math.AG
|
let mathfrak f be a category of subanalytic subsets of real analytic manifolds that is closed under basic settheoretical and basic topological operations let m be a real analytic manifold and denote mathfrak fm the family of the subsets of m that belong to mathfrak f let fxtomathbb r be a subanalytic function on a subset xinmathfrak fm such that the inverse image under f of each interval of mathbb r belongs to mathfrak fm let rm maxf be the set of local maxima of f and consider rm max_lambdafrm maxfcapflambda for each lambdainmathbb r if f is continuous then rm maxfbigsqcup_lambdainmathbb rrm max_lambdafinmathfrak fm if and only if the family rm max_lambdaf_lambdainmathbb r is locally finite in m if we erase continuity condition there exist subanalytic functions fxto m such that rm maxfinmathfrak fm but the family rm max_lambdaf_lambdainmathbb r is not locally finite in m or such that rm maxf is connected but it is not even subanalytic if mathfrak f is the category of subanalytic sets and fxtomathbb r is a subanalytic map f that maps relatively compact subsets of m contained in x to bounded subsets of mathbb r then rm maxfinmathfrak fm and the family rm max_lambdaf_lambdainmathbb r is locally finite in m if the category mathfrak f contains the intersections of algebraic sets with real analytic submanifolds and xinmathfrak fm is not closed in m there exists a continuous subanalytic function fxtomathbb r with graph belonging to mathfrak fmtimesmathbb r such that inverse images under f of the intervals of mathbb r belong to mathfrak fm but rm maxf does not belong to mathfrak fm
|
[['let', 'mathfrak', 'f', 'be', 'a', 'category', 'of', 'subanalytic', 'subsets', 'of', 'real', 'analytic', 'manifolds', 'that', 'is', 'closed', 'under', 'basic', 'settheoretical', 'and', 'basic', 'topological', 'operations', 'let', 'm', 'be', 'a', 'real', 'analytic', 'manifold', 'and', 'denote', 'mathfrak', 'fm', 'the', 'family', 'of', 'the', 'subsets', 'of', 'm', 'that', 'belong', 'to', 'mathfrak', 'f', 'let', 'fxtomathbb', 'r', 'be', 'a', 'subanalytic', 'function', 'on', 'a', 'subset', 'xinmathfrak', 'fm', 'such', 'that', 'the', 'inverse', 'image', 'under', 'f', 'of', 'each', 'interval', 'of', 'mathbb', 'r', 'belongs', 'to', 'mathfrak', 'fm', 'let', 'rm', 'maxf', 'be', 'the', 'set', 'of', 'local', 'maxima', 'of', 'f', 'and', 'consider', 'rm', 'max_lambdafrm', 'maxfcapflambda', 'for', 'each', 'lambdainmathbb', 'r', 'if', 'f', 'is', 'continuous', 'then', 'rm', 'maxfbigsqcup_lambdainmathbb', 'rrm', 'max_lambdafinmathfrak', 'fm', 'if', 'and', 'only', 'if', 'the', 'family', 'rm', 'max_lambdaf_lambdainmathbb', 'r', 'is', 'locally', 'finite', 'in', 'm', 'if', 'we', 'erase', 'continuity', 'condition', 'there', 'exist', 'subanalytic', 'functions', 'fxto', 'm', 'such', 'that', 'rm', 'maxfinmathfrak', 'fm', 'but', 'the', 'family', 'rm', 'max_lambdaf_lambdainmathbb', 'r', 'is', 'not', 'locally', 'finite', 'in', 'm', 'or', 'such', 'that', 'rm', 'maxf', 'is', 'connected', 'but', 'it', 'is', 'not', 'even', 'subanalytic', 'if', 'mathfrak', 'f', 'is', 'the', 'category', 'of', 'subanalytic', 'sets', 'and', 'fxtomathbb', 'r', 'is', 'a', 'subanalytic', 'map', 'f', 'that', 'maps', 'relatively', 'compact', 'subsets', 'of', 'm', 'contained', 'in', 'x', 'to', 'bounded', 'subsets', 'of', 'mathbb', 'r', 'then', 'rm', 'maxfinmathfrak', 'fm', 'and', 'the', 'family', 'rm', 'max_lambdaf_lambdainmathbb', 'r', 'is', 'locally', 'finite', 'in', 'm', 'if', 'the', 'category', 'mathfrak', 'f', 'contains', 'the', 'intersections', 'of', 'algebraic', 'sets', 'with', 'real', 'analytic', 'submanifolds', 'and', 'xinmathfrak', 'fm', 'is', 'not', 'closed', 'in', 'm', 'there', 'exists', 'a', 'continuous', 'subanalytic', 'function', 'fxtomathbb', 'r', 'with', 'graph', 'belonging', 'to', 'mathfrak', 'fmtimesmathbb', 'r', 'such', 'that', 'inverse', 'images', 'under', 'f', 'of', 'the', 'intervals', 'of', 'mathbb', 'r', 'belong', 'to', 'mathfrak', 'fm', 'but', 'rm', 'maxf', 'does', 'not', 'belong', 'to', 'mathfrak', 'fm']]
|
[-0.2244197271674321, 0.09418982317451578, -0.04449182484037892, 0.027296286671392438, -0.08220293040027503, -0.17265909956591768, -0.0370187695265155, 0.39049083749396785, -0.3203400833334661, -0.13539223306702985, 0.08978086418981988, -0.2820012022522419, -0.028126074083212934, 0.1795561615788646, -0.10058661377071544, -0.07544660136442292, 0.014517164679780377, 0.1277881091404142, -0.10321726913874348, -0.2597485656734727, 0.3613491875444059, -0.16498091426734446, 0.18729236081002676, 0.01016860041669464, 0.08314109716130505, -0.0325543869509023, 0.0807630181996942, 0.01744778836093081, -0.21558974948975723, 0.056811782108111816, 0.31006923229186656, 0.14044413833868352, 0.2559749880963478, -0.3028593544220326, -0.10787181774150778, 0.2812142028988367, 0.13193974394181912, -0.1609953503685767, 0.05326957337886349, -0.259604626920808, 0.23023690324484822, -0.12297715061823979, -0.09815948790778886, -0.0568376990603142, 0.2096252394280093, 0.026247327014888553, -0.3778530841227621, -0.0029641585834641855, 0.10018779715579568, 0.113186451156666, -0.03172448748955503, -0.11594538311571038, -0.16223513866002162, 0.04555389092561337, -0.07447048524001289, 0.23323240008418603, 0.10123340258459476, 0.03155612486520885, 0.0009200919938104397, 0.3795733696324257, -0.09871797205414623, -0.2671227957815228, 0.13257070965526951, -0.2513519653706074, -0.1242883155073011, 0.09119147647024048, 0.06623545125484905, 0.175997622582751, -0.015859132731389818, 0.31462141273346567, -0.1639718075334024, 0.14486602651816088, 0.04774611904356403, 0.0013153635505163534, 0.14842568521624233, 0.06965306374794719, 0.11234265976324395, 0.06880682492699249, 0.016494049989639527, 0.09049535058720996, -0.37885409736455505, -0.12137232725967118, -0.1812219114746602, 0.21106812966811986, -0.09770980235644498, -0.20047787010800233, 0.29852845964231883, 0.04900502581166978, 0.19544894097260002, 0.09147055117258181, 0.16717778490000815, 0.008155686275076181, 0.061914151604992876, 0.13915982680522243, 0.006707529842528995, 0.17255655398669964, -0.08435209936666951, -0.11321734449500748, -0.013348511308184683, 0.15728064677271256]
|
1,803.06018
|
Clusters rich in red supergiants
|
In the past few years, several clusters containing large numbers of red
supergiants have been discovered. These clusters are amongst the most massive
young clusters known in the Milky Way, with stellar masses reaching a few
$10^4\:$M$_\odot$. They have provided us, for the first time, with large
homogeneous samples of red supergiants of a given age. These large populations
make them, despite heavy extinction along their sightlines, powerful
laboratories to understand the evolutionary status of red supergiants. While
some of the clusters, such as the eponymous RSGC1, are so obscured that their
members are only observable in the near-IR, some of them are easily accessible,
allowing for an excellent characterisation of cluster and stellar properties.
The information gleaned so far from these clusters gives strong support to the
idea that late-M type supergiants represent a separate class, characterised by
very heavy mass loss. It also shows that the spectral-type distribution of red
supergiants in the Milky Way is very strongly peaked towards M1, while
suggesting a correlation between spectral type and evolutionary stage.
|
astro-ph.SR astro-ph.GA
|
in the past few years several clusters containing large numbers of red supergiants have been discovered these clusters are amongst the most massive young clusters known in the milky way with stellar masses reaching a few 104m_odot they have provided us for the first time with large homogeneous samples of red supergiants of a given age these large populations make them despite heavy extinction along their sightlines powerful laboratories to understand the evolutionary status of red supergiants while some of the clusters such as the eponymous rsgc1 are so obscured that their members are only observable in the nearir some of them are easily accessible allowing for an excellent characterisation of cluster and stellar properties the information gleaned so far from these clusters gives strong support to the idea that latem type supergiants represent a separate class characterised by very heavy mass loss it also shows that the spectraltype distribution of red supergiants in the milky way is very strongly peaked towards m1 while suggesting a correlation between spectral type and evolutionary stage
|
[['in', 'the', 'past', 'few', 'years', 'several', 'clusters', 'containing', 'large', 'numbers', 'of', 'red', 'supergiants', 'have', 'been', 'discovered', 'these', 'clusters', 'are', 'amongst', 'the', 'most', 'massive', 'young', 'clusters', 'known', 'in', 'the', 'milky', 'way', 'with', 'stellar', 'masses', 'reaching', 'a', 'few', '104m_odot', 'they', 'have', 'provided', 'us', 'for', 'the', 'first', 'time', 'with', 'large', 'homogeneous', 'samples', 'of', 'red', 'supergiants', 'of', 'a', 'given', 'age', 'these', 'large', 'populations', 'make', 'them', 'despite', 'heavy', 'extinction', 'along', 'their', 'sightlines', 'powerful', 'laboratories', 'to', 'understand', 'the', 'evolutionary', 'status', 'of', 'red', 'supergiants', 'while', 'some', 'of', 'the', 'clusters', 'such', 'as', 'the', 'eponymous', 'rsgc1', 'are', 'so', 'obscured', 'that', 'their', 'members', 'are', 'only', 'observable', 'in', 'the', 'nearir', 'some', 'of', 'them', 'are', 'easily', 'accessible', 'allowing', 'for', 'an', 'excellent', 'characterisation', 'of', 'cluster', 'and', 'stellar', 'properties', 'the', 'information', 'gleaned', 'so', 'far', 'from', 'these', 'clusters', 'gives', 'strong', 'support', 'to', 'the', 'idea', 'that', 'latem', 'type', 'supergiants', 'represent', 'a', 'separate', 'class', 'characterised', 'by', 'very', 'heavy', 'mass', 'loss', 'it', 'also', 'shows', 'that', 'the', 'spectraltype', 'distribution', 'of', 'red', 'supergiants', 'in', 'the', 'milky', 'way', 'is', 'very', 'strongly', 'peaked', 'towards', 'm1', 'while', 'suggesting', 'a', 'correlation', 'between', 'spectral', 'type', 'and', 'evolutionary', 'stage']]
|
[-0.040886644648140395, 0.14579124034409657, -0.09171643059140858, 0.11360908191478838, -0.12461121156919382, -0.08866789159122747, 0.07552055916291354, 0.45381309038211154, -0.17716039666930225, -0.36525636727281047, 0.05227374070259403, -0.28894100944387774, -0.04501004967127921, 0.20334063379384706, -0.04849688456534629, -0.03946829910963408, 0.10506205964090594, -0.017313636677888777, 0.005397254013913317, -0.2908308591917049, 0.2985798379115631, 0.006439937803506679, 0.13103621090207832, -0.08480425080758212, 0.01911217577195581, -0.13550627041834196, -0.09189153640568687, -0.006225252844328653, -0.104765154799469, 0.08534482331789028, 0.2646627649503378, 0.15433076193496972, 0.2894132757354851, -0.3561386279654124, -0.18296449908494108, 0.09774020044038859, 0.23699409970771412, 0.06815610152825369, -0.1155312512543677, -0.2661766072902075, 0.09597497631531919, -0.16475174792455455, -0.21344114872061706, -0.0009319977706965769, 0.060442937215025715, 0.07290547245755426, -0.18001456800955912, 0.10033193559670482, -7.228700799404542e-05, 0.08093577791328375, -0.04443407148096543, -0.17999701608898322, -0.0707811841692754, 0.16263563840547737, 0.03728071499664358, 0.01173450265179329, 0.0989266869748641, -0.15724721947426482, -0.006042721366033367, 0.37946905935387737, -0.016354941104867123, -0.01029382464126011, 0.29995339247801833, -0.18820160851582368, -0.2010273775220391, 0.10444020480455864, 0.1091148055648442, 0.1602854280075801, -0.21304786649957902, -0.007594910032395812, -0.022044339201095477, 0.15795027892875102, 0.05573463434019702, 0.13107495538814995, 0.3340340526343856, 0.13212277789767077, 0.01811914251191337, 0.07393918111597354, -0.14931519160543788, -0.07094093042592696, -0.21119476895176434, -0.11126146644907008, -0.11842536338540387, 0.07479083769069177, -0.1449731741034267, -0.17112764956246565, 0.3309379340246363, 0.09449534900917139, 0.24553811220409122, 0.05095305043741027, 0.2614756651179639, 0.050476772310293, 0.1586276092889552, 0.10227823453939203, 0.2952172775430513, 0.1898032667537925, 0.07284910144348967, -0.18676002408011758, 0.10731974097690142, -0.020688381511045115]
|
1,803.06019
|
Large Matrix Asymptotic Analysis of ZF and MMSE Crosstalk Cancelers for
Wireline Channels
|
We present asymptotic expressions for user throughput in a multi-user
wireline system with a linear decoder, in increasingly large system sizes. This
analysis can be seen as a generalization of results obtained for wireless
communication. The features of the diagonal elements of the wireline channel
matrices make wireless asymptotic analyses inapplicable for wireline systems.
Further, direct application of results from random matrix theory (RMT) yields a
trivial lower bound. This paper presents a novel approach to asymptotic
analysis, where an alternative sequence of systems is constructed that includes
the system of interest in order to approximate the spectral efficiency of the
linear zero-forcing (ZF) and minimum mean squared error (MMSE) crosstalk
cancelers. Using works in the field of large dimensional random matrices, we
show that the user rate in this sequence converges to a non-zero rate. The
approximation of the user rate for both the ZF and MMSE cancelers are very
simple to evaluate and does not need to take specific channel realizations into
account. The analysis reveals the intricate behavior of the throughput as a
function of the transmission power and the channel crosstalk. This unique
behavior has not been observed for linear decoders in other systems. The
approximation presented here is much more useful for the next generation G.fast
wireline system than earlier digital subscriber line (DSL) systems as
previously computed performance bounds, which are strictly larger than zero
only at low frequencies. We also provide a numerical performance analysis over
measured and simulated DSL channels which show that the approximation is
accurate even for relatively low dimensional systems and is useful for many
scenarios in practical DSL systems.
|
eess.SP
|
we present asymptotic expressions for user throughput in a multiuser wireline system with a linear decoder in increasingly large system sizes this analysis can be seen as a generalization of results obtained for wireless communication the features of the diagonal elements of the wireline channel matrices make wireless asymptotic analyses inapplicable for wireline systems further direct application of results from random matrix theory rmt yields a trivial lower bound this paper presents a novel approach to asymptotic analysis where an alternative sequence of systems is constructed that includes the system of interest in order to approximate the spectral efficiency of the linear zeroforcing zf and minimum mean squared error mmse crosstalk cancelers using works in the field of large dimensional random matrices we show that the user rate in this sequence converges to a nonzero rate the approximation of the user rate for both the zf and mmse cancelers are very simple to evaluate and does not need to take specific channel realizations into account the analysis reveals the intricate behavior of the throughput as a function of the transmission power and the channel crosstalk this unique behavior has not been observed for linear decoders in other systems the approximation presented here is much more useful for the next generation gfast wireline system than earlier digital subscriber line dsl systems as previously computed performance bounds which are strictly larger than zero only at low frequencies we also provide a numerical performance analysis over measured and simulated dsl channels which show that the approximation is accurate even for relatively low dimensional systems and is useful for many scenarios in practical dsl systems
|
[['we', 'present', 'asymptotic', 'expressions', 'for', 'user', 'throughput', 'in', 'a', 'multiuser', 'wireline', 'system', 'with', 'a', 'linear', 'decoder', 'in', 'increasingly', 'large', 'system', 'sizes', 'this', 'analysis', 'can', 'be', 'seen', 'as', 'a', 'generalization', 'of', 'results', 'obtained', 'for', 'wireless', 'communication', 'the', 'features', 'of', 'the', 'diagonal', 'elements', 'of', 'the', 'wireline', 'channel', 'matrices', 'make', 'wireless', 'asymptotic', 'analyses', 'inapplicable', 'for', 'wireline', 'systems', 'further', 'direct', 'application', 'of', 'results', 'from', 'random', 'matrix', 'theory', 'rmt', 'yields', 'a', 'trivial', 'lower', 'bound', 'this', 'paper', 'presents', 'a', 'novel', 'approach', 'to', 'asymptotic', 'analysis', 'where', 'an', 'alternative', 'sequence', 'of', 'systems', 'is', 'constructed', 'that', 'includes', 'the', 'system', 'of', 'interest', 'in', 'order', 'to', 'approximate', 'the', 'spectral', 'efficiency', 'of', 'the', 'linear', 'zeroforcing', 'zf', 'and', 'minimum', 'mean', 'squared', 'error', 'mmse', 'crosstalk', 'cancelers', 'using', 'works', 'in', 'the', 'field', 'of', 'large', 'dimensional', 'random', 'matrices', 'we', 'show', 'that', 'the', 'user', 'rate', 'in', 'this', 'sequence', 'converges', 'to', 'a', 'nonzero', 'rate', 'the', 'approximation', 'of', 'the', 'user', 'rate', 'for', 'both', 'the', 'zf', 'and', 'mmse', 'cancelers', 'are', 'very', 'simple', 'to', 'evaluate', 'and', 'does', 'not', 'need', 'to', 'take', 'specific', 'channel', 'realizations', 'into', 'account', 'the', 'analysis', 'reveals', 'the', 'intricate', 'behavior', 'of', 'the', 'throughput', 'as', 'a', 'function', 'of', 'the', 'transmission', 'power', 'and', 'the', 'channel', 'crosstalk', 'this', 'unique', 'behavior', 'has', 'not', 'been', 'observed', 'for', 'linear', 'decoders', 'in', 'other', 'systems', 'the', 'approximation', 'presented', 'here', 'is', 'much', 'more', 'useful', 'for', 'the', 'next', 'generation', 'gfast', 'wireline', 'system', 'than', 'earlier', 'digital', 'subscriber', 'line', 'dsl', 'systems', 'as', 'previously', 'computed', 'performance', 'bounds', 'which', 'are', 'strictly', 'larger', 'than', 'zero', 'only', 'at', 'low', 'frequencies', 'we', 'also', 'provide', 'a', 'numerical', 'performance', 'analysis', 'over', 'measured', 'and', 'simulated', 'dsl', 'channels', 'which', 'show', 'that', 'the', 'approximation', 'is', 'accurate', 'even', 'for', 'relatively', 'low', 'dimensional', 'systems', 'and', 'is', 'useful', 'for', 'many', 'scenarios', 'in', 'practical', 'dsl', 'systems']]
|
[-0.17984769730553773, 0.02283391625947118, -0.05651997700608524, 0.06847807107754464, -0.05071197229014827, -0.2012777961412534, 0.06976493168106764, 0.36100603460945957, -0.23116952214884912, -0.2546495055552998, 0.12124665771938373, -0.25489591156489927, -0.18767986698265143, 0.2240423563888427, -0.07784999809245068, 0.07915917453115524, 0.07710703789699837, 0.06019980388333097, -0.0925418038971076, -0.23767494973881217, 0.25631592967341277, 0.09660397333907465, 0.32458124546389133, 0.023017571719682935, 0.0695674446758529, 0.003808095111302014, -0.005529325359201959, -0.0023398802467927723, -0.1058940157647117, 0.08925893382990657, 0.31427081806732965, 0.14276015530065445, 0.26192048767313525, -0.38598121504378385, -0.2427462178842608, 0.09580708545636098, 0.18262484464175807, 0.10421391087412367, -0.04684515619708261, -0.23854498489247808, 0.15551639828019917, -0.21321431546286435, -0.06574507648077178, -0.05195070454434963, -0.03555666138048583, 0.033318248443387974, -0.3357224860692541, 0.05890625994555855, 0.07049797791463573, 0.07531538254065255, -0.020467408824492096, -0.16143343301156599, 0.039877185685649456, 0.15488431969145486, 0.01969307515601803, -0.025720309940376405, 0.07802851957666801, -0.11192677776044947, -0.090557930831251, 0.3545156355046863, -0.06535451683291832, -0.21996700983430942, 0.18396767077480383, -0.12311100830647036, -0.09806339432677852, 0.15223512793908314, 0.2345940935016503, 0.08689294050952825, -0.16941726589755832, 0.04899888299899588, -0.019085062595558564, 0.19519385439773326, 0.03289504685633338, 0.10020971376744418, 0.1558325572061349, 0.18355247581753933, 0.10924394426388817, 0.13492609941854544, -0.07485514605843988, -0.10797180815142789, -0.25657297734848167, -0.14035512201334016, -0.20425027890845693, 0.02724065556376915, -0.10726777338972693, -0.14235288069482097, 0.3597079957440166, 0.14667751193885317, 0.15701997624125977, 0.14092046878304043, 0.3767873034211102, 0.14939841285207897, 0.0682926573601596, 0.09157069361978297, 0.20589622185905757, 0.12946530626279154, 0.12488620490913117, -0.1831519245537345, 0.06064419358422313, 0.031949109722588666]
|
1,803.0602
|
Quantum Field Theory on spherical space forms
|
One of the fundamental questions in Quantum Field Theory regards the
determination of a measure of the degrees of freedom of theories that is
consistent with the Renormalization Group flow. The answer seems to be encoded
in the C-theorems, that involve quantities which decrease with the
Renormalization Group flow to the IR and are stationary at the fixed points,
thus ordering the space of theories. In an originally different problem,
inspired by the use of spherical space forms in cosmological models, we study
the thermodynamic properties of a free theory at finite temperature defined on
such spaces. We start by analyzing the case of a conformal scalar theory: from
the zeta regularization of the effective action we compute the entropy, in
whose high-temperature expansion we find a term ---often disregarded--- which
does not depend on the temperature nor the radius of the covering sphere, which
can be obtained also as the determinant of the zero-temperature theory on the
spatial manifold, and which we relate to its topological properties. We
consider in the case of a massive theory the same expansion, whose
temperature-independent term depends on the mass, and we find that dependence
resemblant to the behavior of a C-quantity. We then analyze the behavior of the
same quantity for the free scalar and Dirac theories on real projective spaces
in arbitrary dimension.
|
hep-th math-ph math.MP
|
one of the fundamental questions in quantum field theory regards the determination of a measure of the degrees of freedom of theories that is consistent with the renormalization group flow the answer seems to be encoded in the ctheorems that involve quantities which decrease with the renormalization group flow to the ir and are stationary at the fixed points thus ordering the space of theories in an originally different problem inspired by the use of spherical space forms in cosmological models we study the thermodynamic properties of a free theory at finite temperature defined on such spaces we start by analyzing the case of a conformal scalar theory from the zeta regularization of the effective action we compute the entropy in whose hightemperature expansion we find a term often disregarded which does not depend on the temperature nor the radius of the covering sphere which can be obtained also as the determinant of the zerotemperature theory on the spatial manifold and which we relate to its topological properties we consider in the case of a massive theory the same expansion whose temperatureindependent term depends on the mass and we find that dependence resemblant to the behavior of a cquantity we then analyze the behavior of the same quantity for the free scalar and dirac theories on real projective spaces in arbitrary dimension
|
[['one', 'of', 'the', 'fundamental', 'questions', 'in', 'quantum', 'field', 'theory', 'regards', 'the', 'determination', 'of', 'a', 'measure', 'of', 'the', 'degrees', 'of', 'freedom', 'of', 'theories', 'that', 'is', 'consistent', 'with', 'the', 'renormalization', 'group', 'flow', 'the', 'answer', 'seems', 'to', 'be', 'encoded', 'in', 'the', 'ctheorems', 'that', 'involve', 'quantities', 'which', 'decrease', 'with', 'the', 'renormalization', 'group', 'flow', 'to', 'the', 'ir', 'and', 'are', 'stationary', 'at', 'the', 'fixed', 'points', 'thus', 'ordering', 'the', 'space', 'of', 'theories', 'in', 'an', 'originally', 'different', 'problem', 'inspired', 'by', 'the', 'use', 'of', 'spherical', 'space', 'forms', 'in', 'cosmological', 'models', 'we', 'study', 'the', 'thermodynamic', 'properties', 'of', 'a', 'free', 'theory', 'at', 'finite', 'temperature', 'defined', 'on', 'such', 'spaces', 'we', 'start', 'by', 'analyzing', 'the', 'case', 'of', 'a', 'conformal', 'scalar', 'theory', 'from', 'the', 'zeta', 'regularization', 'of', 'the', 'effective', 'action', 'we', 'compute', 'the', 'entropy', 'in', 'whose', 'hightemperature', 'expansion', 'we', 'find', 'a', 'term', 'often', 'disregarded', 'which', 'does', 'not', 'depend', 'on', 'the', 'temperature', 'nor', 'the', 'radius', 'of', 'the', 'covering', 'sphere', 'which', 'can', 'be', 'obtained', 'also', 'as', 'the', 'determinant', 'of', 'the', 'zerotemperature', 'theory', 'on', 'the', 'spatial', 'manifold', 'and', 'which', 'we', 'relate', 'to', 'its', 'topological', 'properties', 'we', 'consider', 'in', 'the', 'case', 'of', 'a', 'massive', 'theory', 'the', 'same', 'expansion', 'whose', 'temperatureindependent', 'term', 'depends', 'on', 'the', 'mass', 'and', 'we', 'find', 'that', 'dependence', 'resemblant', 'to', 'the', 'behavior', 'of', 'a', 'cquantity', 'we', 'then', 'analyze', 'the', 'behavior', 'of', 'the', 'same', 'quantity', 'for', 'the', 'free', 'scalar', 'and', 'dirac', 'theories', 'on', 'real', 'projective', 'spaces', 'in', 'arbitrary', 'dimension']]
|
[-0.1323677570710793, 0.1518485583771232, -0.11290661130538758, 0.056541121489477944, -0.05155017347563884, -0.07661089227572758, 0.024632869238282524, 0.30264583857081057, -0.26243329778465346, -0.26092449670901935, 0.09761984665758014, -0.2785381217997066, -0.15031670692705495, 0.16020545914212908, -0.02933374714402364, 0.012363221569037342, -0.03329895437501236, 0.11390503119504526, -0.1330577548797668, -0.24558735954495173, 0.38640490253729853, 0.03378970483981696, 0.25421897257568643, 0.07718855542935667, 0.10960230255727045, 0.020861123640056514, -0.013486236715752513, 0.057735860022996466, -0.15969264963101168, 0.11395880838011169, 0.1942250124139879, 0.07211229438225558, 0.22054895576789166, -0.38823417560260626, -0.25019573723492783, 0.09683496364559852, 0.12954316187515114, 0.09103057819431251, 0.005708750735465816, -0.23617147038399972, 0.07001400878442224, -0.13981773451758692, -0.1607161108651978, -0.07180368204546325, -0.011085215416037355, -0.020575391275100243, -0.23483270680852134, 0.07326179961658112, 0.016610903248224593, 0.07012034266158872, -0.08772369249401471, -0.06331083259852897, -0.03020664062182423, 0.1280213020087696, 0.0827995534072343, 0.030976810523127608, 0.11528162481221138, -0.15578965254642102, -0.08679386022146707, 0.3913145920375522, -0.09147054620078718, -0.220749926715415, 0.17080270148375454, -0.16624055129404253, -0.1449152783077733, 0.08109328348813284, 0.14792927715725085, 0.16954272666764847, -0.09187742070678402, 0.15416417931779647, -0.05080918424259197, 0.14948929737983652, 0.04490708704506852, 0.04736965768485924, 0.21079320532198137, 0.08988645394665623, 0.05316848218561112, 0.12298602474394056, -0.022866455365048208, -0.13384602810266719, -0.34725436147268673, -0.16460574493739266, -0.19032465844052712, 0.07505230392584614, -0.1270863207884668, -0.2152661342211742, 0.39621041591671124, 0.13731325853728463, 0.2171930248819595, 0.043857321815303954, 0.2355682758690275, 0.1423110112256046, 0.07824873242251221, 0.06128980154677281, 0.2242313296959748, 0.14688494125785667, 0.05832262898055727, -0.2598007702473045, 0.001542236472635922, 0.12036943593382735]
|
1,803.06021
|
Experimental characterization of a spin quantum heat engine
|
Developments in the thermodynamics of small quantum systems envisage
non-classical thermal machines. In this scenario, energy fluctuations play a
relevant role in the description of irreversibility. We experimentally
implement a quantum heat engine based on a spin-1/2 system and nuclear magnetic
resonance techniques. Irreversibility at microscope scale is fully
characterized by the assessment of energy fluctuations associated with the work
and heat flows. We also investigate the efficiency lag related to the entropy
production at finite time. The implemented heat engine operates in a regime
where both thermal and quantum fluctuations (associated with transitions among
the instantaneous energy eigenstates) are relevant to its description.
Performing a quantum Otto cycle at maximum power, the proof-of-concept quantum
heat engine is able to reach an efficiency for work extraction
($\eta\approx42$%) very close to its thermodynamic limit ($\eta=44$%).
|
quant-ph cond-mat.stat-mech
|
developments in the thermodynamics of small quantum systems envisage nonclassical thermal machines in this scenario energy fluctuations play a relevant role in the description of irreversibility we experimentally implement a quantum heat engine based on a spin12 system and nuclear magnetic resonance techniques irreversibility at microscope scale is fully characterized by the assessment of energy fluctuations associated with the work and heat flows we also investigate the efficiency lag related to the entropy production at finite time the implemented heat engine operates in a regime where both thermal and quantum fluctuations associated with transitions among the instantaneous energy eigenstates are relevant to its description performing a quantum otto cycle at maximum power the proofofconcept quantum heat engine is able to reach an efficiency for work extraction etaapprox42 very close to its thermodynamic limit eta44
|
[['developments', 'in', 'the', 'thermodynamics', 'of', 'small', 'quantum', 'systems', 'envisage', 'nonclassical', 'thermal', 'machines', 'in', 'this', 'scenario', 'energy', 'fluctuations', 'play', 'a', 'relevant', 'role', 'in', 'the', 'description', 'of', 'irreversibility', 'we', 'experimentally', 'implement', 'a', 'quantum', 'heat', 'engine', 'based', 'on', 'a', 'spin12', 'system', 'and', 'nuclear', 'magnetic', 'resonance', 'techniques', 'irreversibility', 'at', 'microscope', 'scale', 'is', 'fully', 'characterized', 'by', 'the', 'assessment', 'of', 'energy', 'fluctuations', 'associated', 'with', 'the', 'work', 'and', 'heat', 'flows', 'we', 'also', 'investigate', 'the', 'efficiency', 'lag', 'related', 'to', 'the', 'entropy', 'production', 'at', 'finite', 'time', 'the', 'implemented', 'heat', 'engine', 'operates', 'in', 'a', 'regime', 'where', 'both', 'thermal', 'and', 'quantum', 'fluctuations', 'associated', 'with', 'transitions', 'among', 'the', 'instantaneous', 'energy', 'eigenstates', 'are', 'relevant', 'to', 'its', 'description', 'performing', 'a', 'quantum', 'otto', 'cycle', 'at', 'maximum', 'power', 'the', 'proofofconcept', 'quantum', 'heat', 'engine', 'is', 'able', 'to', 'reach', 'an', 'efficiency', 'for', 'work', 'extraction', 'etaapprox42', 'very', 'close', 'to', 'its', 'thermodynamic', 'limit', 'eta44']]
|
[-0.13560598918455513, 0.18633675130507926, -0.059961920801663036, 0.06322206382967786, -0.012184944515342288, -0.14393510516895208, 0.08637161754692595, 0.3130011103313529, -0.26922067167293845, -0.2874426417190328, 0.060605008878293586, -0.3126053932743768, -0.05581724732606248, 0.261738150056, -0.0003937878046241222, 0.08432086954108496, 0.04783395484043991, 0.06975404737044522, -0.019894680901030148, -0.14906354582247636, 0.2647836352592673, 0.16417439432839412, 0.32399772511527053, 0.11551496380530862, 0.11118408808639894, -0.04520878608155093, 0.04337784959837639, 0.031171775811041396, -0.13677832133411852, 0.07433095643875387, 0.2703342782756822, 0.021690353818209558, 0.24530437765078564, -0.43122694977192266, -0.23884741236653292, 0.11355258370608542, 0.0866827466745621, 0.09697286867903489, -0.03273183369575153, -0.21141989895311947, 0.015617399666966363, -0.176288694496069, -0.10994247475878871, -0.12531420364129273, -0.008636136560446837, -0.01675802993298875, -0.2082267526297294, 0.11666793874830932, 0.07820764317346568, 0.07088535310785202, -0.035043319119281616, -0.0019660362308830813, 0.02873013105074113, 0.11404233543682053, -0.04086784487519639, -0.009250350822130162, 0.23901356503395646, -0.14473396408279907, -0.14266396121291275, 0.36329056240731117, -0.06927916370014744, -0.1447893937795677, 0.17956833709137177, -0.12726022648117083, -0.1330928145484491, 0.1096367043633522, 0.1688825489783829, 0.11413303128739988, -0.17191912425032846, 0.057240640475136, 0.0668652332811193, 0.15869243917669254, 0.0030779163670641456, 0.09324941103290202, 0.2732032269634532, 0.1905825305694827, 0.001091090408436051, 0.20577308683035275, -0.07931974521312496, -0.1878237547740961, -0.321150996574116, -0.18539401780193052, -0.21677187763359115, 0.08403491135003137, -0.054140450431904436, -0.11462662061394165, 0.38323568545676995, 0.17613065860474086, 0.16488353572926964, -0.0108842195177479, 0.30658248070341704, 0.16578150997785004, 0.03482561985076631, 0.12924873454947816, 0.25271780493715074, 0.16895085630345752, 0.21614678437243018, -0.3395117682918102, 0.025318173279767067, 0.055593783375198574]
|
1,803.06022
|
Abstract cubical homotopy theory
|
Triangulations and higher triangulations axiomatize the calculus of derived
cokernels when applied to strings of composable morphisms. While there are no
cubical versions of (higher) triangulations, in this paper we use coherent
diagrams to develop some aspects of a rich cubical calculus. Applied to the
models in the background, this enhances the typical examples of triangulated
and tensor-triangulated categories.
The main players are the cardinality filtration of n-cubes, the induced
interpolation between cocartesian and strongly cocartesian n-cubes, and the
yoga of iterated cone constructions. In the stable case, the representation
theories of chunks of n-cubes are related by compatible strong stable
equivalences and admit a global form of Serre duality. As sample applications,
we use these Serre equivalences to express colimits in terms of limits and to
relate the abstract representation theories of chunks by infinite chains of
adjunctions.
On a more abstract side, along the way we establish a general decomposition
result for colimits, which specializes to the classical Bousfield-Kan formulas.
We also include a short discussion of abstract formulas and their compatibility
with morphisms, leading to the idea of universal formulas in monoidal homotopy
theories.
|
math.AT math.CT math.RT
|
triangulations and higher triangulations axiomatize the calculus of derived cokernels when applied to strings of composable morphisms while there are no cubical versions of higher triangulations in this paper we use coherent diagrams to develop some aspects of a rich cubical calculus applied to the models in the background this enhances the typical examples of triangulated and tensortriangulated categories the main players are the cardinality filtration of ncubes the induced interpolation between cocartesian and strongly cocartesian ncubes and the yoga of iterated cone constructions in the stable case the representation theories of chunks of ncubes are related by compatible strong stable equivalences and admit a global form of serre duality as sample applications we use these serre equivalences to express colimits in terms of limits and to relate the abstract representation theories of chunks by infinite chains of adjunctions on a more abstract side along the way we establish a general decomposition result for colimits which specializes to the classical bousfieldkan formulas we also include a short discussion of abstract formulas and their compatibility with morphisms leading to the idea of universal formulas in monoidal homotopy theories
|
[['triangulations', 'and', 'higher', 'triangulations', 'axiomatize', 'the', 'calculus', 'of', 'derived', 'cokernels', 'when', 'applied', 'to', 'strings', 'of', 'composable', 'morphisms', 'while', 'there', 'are', 'no', 'cubical', 'versions', 'of', 'higher', 'triangulations', 'in', 'this', 'paper', 'we', 'use', 'coherent', 'diagrams', 'to', 'develop', 'some', 'aspects', 'of', 'a', 'rich', 'cubical', 'calculus', 'applied', 'to', 'the', 'models', 'in', 'the', 'background', 'this', 'enhances', 'the', 'typical', 'examples', 'of', 'triangulated', 'and', 'tensortriangulated', 'categories', 'the', 'main', 'players', 'are', 'the', 'cardinality', 'filtration', 'of', 'ncubes', 'the', 'induced', 'interpolation', 'between', 'cocartesian', 'and', 'strongly', 'cocartesian', 'ncubes', 'and', 'the', 'yoga', 'of', 'iterated', 'cone', 'constructions', 'in', 'the', 'stable', 'case', 'the', 'representation', 'theories', 'of', 'chunks', 'of', 'ncubes', 'are', 'related', 'by', 'compatible', 'strong', 'stable', 'equivalences', 'and', 'admit', 'a', 'global', 'form', 'of', 'serre', 'duality', 'as', 'sample', 'applications', 'we', 'use', 'these', 'serre', 'equivalences', 'to', 'express', 'colimits', 'in', 'terms', 'of', 'limits', 'and', 'to', 'relate', 'the', 'abstract', 'representation', 'theories', 'of', 'chunks', 'by', 'infinite', 'chains', 'of', 'adjunctions', 'on', 'a', 'more', 'abstract', 'side', 'along', 'the', 'way', 'we', 'establish', 'a', 'general', 'decomposition', 'result', 'for', 'colimits', 'which', 'specializes', 'to', 'the', 'classical', 'bousfieldkan', 'formulas', 'we', 'also', 'include', 'a', 'short', 'discussion', 'of', 'abstract', 'formulas', 'and', 'their', 'compatibility', 'with', 'morphisms', 'leading', 'to', 'the', 'idea', 'of', 'universal', 'formulas', 'in', 'monoidal', 'homotopy', 'theories']]
|
[-0.13484389065169694, 0.07184328011580728, -0.09674105827103961, 0.1631294769038232, -0.10120049359047795, -0.12630117643888503, 0.03139421884356475, 0.35533147277111277, -0.3475094823276295, -0.23210883587050965, 0.08650656079968069, -0.22916674529286948, -0.14373321279156256, 0.16455140168016608, -0.19774372499309453, -0.029119612539515775, 0.06169140397416637, 0.04880326671306701, -0.08134624809474948, -0.24778561717282763, 0.39031136499339325, -0.02894906317541266, 0.2392889555368143, 0.04473385077846401, 0.09157496710877677, -0.006122290019822472, -0.04540880230618989, 0.03063568411106094, -0.17857274788128022, 0.19772194683511946, 0.3218924181972903, 0.09905683454922973, 0.1663949126215841, -0.43200164025799304, -0.10557676482208592, 0.12860412143897962, 0.10650458980278849, 0.0731355764232028, 0.02132615612663844, -0.2968169518579594, 0.1177040821210267, -0.18333651679493287, -0.09872971807063662, -0.11012798406739027, 0.041195541844369576, 0.05403815612805768, -0.20176516602782005, -0.04647480751612513, 0.1525128761416595, 0.10576421294839465, -0.06310522120027619, -0.0697097116626829, -0.05974283630780398, 0.10764388399859168, 0.0015063017761125603, -0.012766539759157017, 0.07991091681664242, -0.13121015531319707, -0.16846781326607269, 0.37047110074623063, -0.04795962132334231, -0.2102489218135728, 0.19497063212012025, -0.10855267634914122, -0.1881941674615849, 0.10948987795229265, 0.05467539363451063, 0.17230479780484656, -0.06456239837171064, 0.1501709799382482, -0.08350191720547204, 0.07537752832161551, 0.16171226396728405, 0.06886194002494604, 0.168646452255562, 0.08836038164510567, 0.04943989785537522, 0.20007844427152272, 0.0630297942313037, -0.1254893335996863, -0.34347213667389104, -0.14609307288266918, -0.02295016317583501, 0.05749465685392566, -0.1367843879535726, -0.20789129553452373, 0.352958821488624, 0.1325391905471299, 0.16761147350936326, 0.18340538089340402, 0.25330620843239804, 0.05089513459404741, 0.08569220216561328, 0.0032613063891004913, 0.1290423816513833, 0.2613103187513503, 0.03355630665624086, -0.08532960134008052, 0.011542116960430926, 0.22530797007182404]
|
1,803.06023
|
Parallelisation, initialisation, and boundary treatments for the diamond
scheme
|
We study a class of general purpose linear multisymplectic integrators for
Hamiltonian wave equations based on a diamond-shaped mesh. On each diamond, the
PDE is discretized by a symplectic Runge--Kutta method. The scheme advances in
time by filling in each diamond locally. We demonstrate that this leads to
greater efficiency and parallelization and easier treatment of boundary
conditions compared to methods based on rectangular meshes. We develop a
variety of initial and boundary value treatments and present numerical evidence
of their performance. In all cases, the observed order of convergence is equal
to or greater than the number of stages of the underlying Runge--Kutta method.
|
math.NA
|
we study a class of general purpose linear multisymplectic integrators for hamiltonian wave equations based on a diamondshaped mesh on each diamond the pde is discretized by a symplectic rungekutta method the scheme advances in time by filling in each diamond locally we demonstrate that this leads to greater efficiency and parallelization and easier treatment of boundary conditions compared to methods based on rectangular meshes we develop a variety of initial and boundary value treatments and present numerical evidence of their performance in all cases the observed order of convergence is equal to or greater than the number of stages of the underlying rungekutta method
|
[['we', 'study', 'a', 'class', 'of', 'general', 'purpose', 'linear', 'multisymplectic', 'integrators', 'for', 'hamiltonian', 'wave', 'equations', 'based', 'on', 'a', 'diamondshaped', 'mesh', 'on', 'each', 'diamond', 'the', 'pde', 'is', 'discretized', 'by', 'a', 'symplectic', 'rungekutta', 'method', 'the', 'scheme', 'advances', 'in', 'time', 'by', 'filling', 'in', 'each', 'diamond', 'locally', 'we', 'demonstrate', 'that', 'this', 'leads', 'to', 'greater', 'efficiency', 'and', 'parallelization', 'and', 'easier', 'treatment', 'of', 'boundary', 'conditions', 'compared', 'to', 'methods', 'based', 'on', 'rectangular', 'meshes', 'we', 'develop', 'a', 'variety', 'of', 'initial', 'and', 'boundary', 'value', 'treatments', 'and', 'present', 'numerical', 'evidence', 'of', 'their', 'performance', 'in', 'all', 'cases', 'the', 'observed', 'order', 'of', 'convergence', 'is', 'equal', 'to', 'or', 'greater', 'than', 'the', 'number', 'of', 'stages', 'of', 'the', 'underlying', 'rungekutta', 'method']]
|
[-0.1177368476277306, 0.023294577916108426, -0.07565192865828672, 0.01115562906599648, -0.05648654906212219, -0.12421272408904596, 0.016555097808928363, 0.41740153566712423, -0.19640781867672644, -0.2820211711561396, 0.12390652505037862, -0.2091583965213171, -0.13292573158451843, 0.21009099153313962, -0.07218596764086258, 0.07849391184392429, 0.11398761401263376, -0.001053220650092477, -0.1362471749185629, -0.270562736769872, 0.335954734031111, 0.009807185061453354, 0.28464451025994053, 0.019557974296843722, 0.13386212976516357, -0.05274772089240806, -0.017368704989729894, 0.046228775035134666, -0.14894560827642203, 0.13344652163796128, 0.21995815583282993, 0.044295047831145073, 0.3253755685651586, -0.46529564843291327, -0.19748400792124726, 0.06463884902242127, 0.12066925680708318, 0.12650769103673243, -0.04144955245844487, -0.2478077995369122, 0.10793812491797976, -0.15148571829666338, -0.1394415753937903, -0.08125245027532357, -0.03909835924527475, 0.03630863916173223, -0.2590835190056601, 0.06371706927727376, 0.05943496296448367, 0.06122001749241636, -0.07463380488389659, -0.12090488909854598, -0.01382207301933141, 0.05306039319728457, -0.0020616961776145867, -0.01537364084229228, 0.06529805497488096, -0.09271960770933046, -0.1242970624672515, 0.4250240869465328, -0.04616039444739553, -0.2988746393915443, 0.1951274521338443, -0.12534365654435187, -0.09732584236411466, 0.15870370741800538, 0.21019751308929352, 0.19363974686712027, -0.11061545422389393, 0.059707196893924404, 0.015817633397749713, 0.150116211637145, 0.06303330509967747, -0.022392803237086072, 0.08236959138663397, 0.2057896440205652, 0.13483517233260153, 0.12504741472325154, -0.0650199699725601, -0.13328003960972032, -0.305924943231401, -0.18835947474109985, -0.16734098492611554, 0.03954357118165631, -0.1315463632029215, -0.17793868157480444, 0.4033274334712284, 0.16544982223283677, 0.1275802868640139, 0.05799787744125795, 0.3090176586815644, 0.125472676984611, 0.06625139055817965, 0.095293228328228, 0.14230863157482374, 0.15618935584401092, 0.06419595682638742, -0.24658368440078837, 0.03347024057016131, 0.1605866374980126]
|
1,803.06024
|
Deep Learning Reconstruction of Ultra-Short Pulses
|
Ultra-short laser pulses with femtosecond to attosecond pulse duration are
the shortest systematic events humans can create. Characterization (amplitude
and phase) of these pulses is a key ingredient in ultrafast science, e.g.,
exploring chemical reactions and electronic phase transitions. Here, we propose
and demonstrate, numerically and experimentally, the first deep neural network
technique to reconstruct ultra-short optical pulses. We anticipate that this
approach will extend the range of ultrashort laser pulses that can be
characterized, e.g., enabling to diagnose very weak attosecond pulses.
|
physics.optics cs.AI cs.LG stat.ML
|
ultrashort laser pulses with femtosecond to attosecond pulse duration are the shortest systematic events humans can create characterization amplitude and phase of these pulses is a key ingredient in ultrafast science eg exploring chemical reactions and electronic phase transitions here we propose and demonstrate numerically and experimentally the first deep neural network technique to reconstruct ultrashort optical pulses we anticipate that this approach will extend the range of ultrashort laser pulses that can be characterized eg enabling to diagnose very weak attosecond pulses
|
[['ultrashort', 'laser', 'pulses', 'with', 'femtosecond', 'to', 'attosecond', 'pulse', 'duration', 'are', 'the', 'shortest', 'systematic', 'events', 'humans', 'can', 'create', 'characterization', 'amplitude', 'and', 'phase', 'of', 'these', 'pulses', 'is', 'a', 'key', 'ingredient', 'in', 'ultrafast', 'science', 'eg', 'exploring', 'chemical', 'reactions', 'and', 'electronic', 'phase', 'transitions', 'here', 'we', 'propose', 'and', 'demonstrate', 'numerically', 'and', 'experimentally', 'the', 'first', 'deep', 'neural', 'network', 'technique', 'to', 'reconstruct', 'ultrashort', 'optical', 'pulses', 'we', 'anticipate', 'that', 'this', 'approach', 'will', 'extend', 'the', 'range', 'of', 'ultrashort', 'laser', 'pulses', 'that', 'can', 'be', 'characterized', 'eg', 'enabling', 'to', 'diagnose', 'very', 'weak', 'attosecond', 'pulses']]
|
[-0.11490607571350522, 0.25159315006381056, -0.11458947745163038, 0.0821910478926477, -0.041644887605973756, -0.15192808057686472, 0.04920001144812678, 0.5999099364930607, -0.3015083300331271, -0.3315215645447733, -1.3422514087554202e-05, -0.2321425769169512, -0.14677146225270019, 0.27003467370228595, -0.03586278233048787, 0.08633587231680033, 0.0804409821747791, -0.14860863672816252, 0.009041893245450345, -0.12452116307903485, 0.21933601389313678, 0.04388186513763258, 0.2436783510394933, 0.051958694646600634, 0.1278959340668362, 0.005505510779793363, 0.03191069841205356, -0.16295705944529723, -0.09525112155912561, 0.09623482106365712, 0.33651363741920653, 0.06426235127924795, 0.25041180089430276, -0.5214659158499485, -0.32337958670883293, 0.09014593113034246, 0.1675087890474838, 0.19242854242448706, -0.078608272675739, -0.31046648375151387, 0.02948173645502293, -0.11691378285906401, -0.11529689083010497, -0.15910574117204151, 0.036019140484193, 0.15431275714682527, -0.2603096639715045, -0.039215376502441536, -0.015339259372418186, 0.030077450257916766, -0.009565864975777376, 0.07769204196464045, 0.04215380958988365, 0.0685508214554424, -0.04674561744898064, 0.09927478261538837, 0.15235821775957403, -0.1418488317124366, -0.12938318487413855, 0.3571837564862995, -0.07617318235247968, 0.03438799495034548, 0.1385876865698451, -0.1736822231863457, -0.04274635663794645, 0.1643674342994051, 0.18117883248557617, 0.18966463313112597, -0.16645910725536117, -0.09508519223891199, 0.08640708029270172, 0.2886819863433849, 0.15960067897720867, 0.13204550548983984, 0.2155790393274412, 0.2521274524729654, 0.012993137049208204, 0.1345094665029389, -0.16323027717151556, -0.0019419109785413168, -0.21206692529909582, -0.06566724555948412, -0.16119927341814141, 0.09324622558744018, -0.00965128608359338, -0.09492454507264746, 0.49388886050107966, 0.23641406389020653, 0.059038781243971133, -0.021947954430704915, 0.2901364312653082, 0.12665689001785568, -0.008888634538883904, -0.02412388971109078, 0.25990322435342045, 0.13708054127328725, 0.11881312214157892, -0.23456984354990973, 0.05300592114946928, -0.005943499107183103]
|
1,803.06025
|
CPVNF:Cost-efficient Proactive VNF Placement and Chaining for
Value-Added Services in Content Delivery Networks
|
Value-added services (e.g., overlaid video advertisements) have become an
integral part of today's Content Delivery Networks (CDNs). To offer
cost-efficient, scalable and more agile provisioning of new value-added
services in CDNs, Network Functions Virtualization (NFV) paradigm may be
leveraged to allow implementation of fine-grained services as a chain of
Virtual Network Functions (VNFs) to be placed in CDN. The manner in which these
chains are placed is critical as it both affects the quality of service (QoS)
and provider cost. The problem is however, very challenging due to the
specifics of the chains (e.g.,one of their end-points is not known prior to the
placement). We formulate it as an Integer Linear Program (ILP) and propose a
cost efficient Proactive VNF placement and chaining (CPVNF)algorithm. The
objective is to find the optimal number of VNFs along with their locations in
such a manner that the cost is minimized while QoS is met. Apart from cost
minimization, the support for large-scale CDNs with a large number of servers
and end-users is an important feature of the proposed algorithm. Through
simulations, the algorithm's behaviour for small-scale to large-scale CDN
networks is analyzed.
|
cs.NI
|
valueadded services eg overlaid video advertisements have become an integral part of todays content delivery networks cdns to offer costefficient scalable and more agile provisioning of new valueadded services in cdns network functions virtualization nfv paradigm may be leveraged to allow implementation of finegrained services as a chain of virtual network functions vnfs to be placed in cdn the manner in which these chains are placed is critical as it both affects the quality of service qos and provider cost the problem is however very challenging due to the specifics of the chains egone of their endpoints is not known prior to the placement we formulate it as an integer linear program ilp and propose a cost efficient proactive vnf placement and chaining cpvnfalgorithm the objective is to find the optimal number of vnfs along with their locations in such a manner that the cost is minimized while qos is met apart from cost minimization the support for largescale cdns with a large number of servers and endusers is an important feature of the proposed algorithm through simulations the algorithms behaviour for smallscale to largescale cdn networks is analyzed
|
[['valueadded', 'services', 'eg', 'overlaid', 'video', 'advertisements', 'have', 'become', 'an', 'integral', 'part', 'of', 'todays', 'content', 'delivery', 'networks', 'cdns', 'to', 'offer', 'costefficient', 'scalable', 'and', 'more', 'agile', 'provisioning', 'of', 'new', 'valueadded', 'services', 'in', 'cdns', 'network', 'functions', 'virtualization', 'nfv', 'paradigm', 'may', 'be', 'leveraged', 'to', 'allow', 'implementation', 'of', 'finegrained', 'services', 'as', 'a', 'chain', 'of', 'virtual', 'network', 'functions', 'vnfs', 'to', 'be', 'placed', 'in', 'cdn', 'the', 'manner', 'in', 'which', 'these', 'chains', 'are', 'placed', 'is', 'critical', 'as', 'it', 'both', 'affects', 'the', 'quality', 'of', 'service', 'qos', 'and', 'provider', 'cost', 'the', 'problem', 'is', 'however', 'very', 'challenging', 'due', 'to', 'the', 'specifics', 'of', 'the', 'chains', 'egone', 'of', 'their', 'endpoints', 'is', 'not', 'known', 'prior', 'to', 'the', 'placement', 'we', 'formulate', 'it', 'as', 'an', 'integer', 'linear', 'program', 'ilp', 'and', 'propose', 'a', 'cost', 'efficient', 'proactive', 'vnf', 'placement', 'and', 'chaining', 'cpvnfalgorithm', 'the', 'objective', 'is', 'to', 'find', 'the', 'optimal', 'number', 'of', 'vnfs', 'along', 'with', 'their', 'locations', 'in', 'such', 'a', 'manner', 'that', 'the', 'cost', 'is', 'minimized', 'while', 'qos', 'is', 'met', 'apart', 'from', 'cost', 'minimization', 'the', 'support', 'for', 'largescale', 'cdns', 'with', 'a', 'large', 'number', 'of', 'servers', 'and', 'endusers', 'is', 'an', 'important', 'feature', 'of', 'the', 'proposed', 'algorithm', 'through', 'simulations', 'the', 'algorithms', 'behaviour', 'for', 'smallscale', 'to', 'largescale', 'cdn', 'networks', 'is', 'analyzed']]
|
[-0.21786003384208755, 0.00654046147285754, -0.026502327107946404, 0.054246738134699074, -0.11290305651186462, -0.18183188871505426, 0.09339816739812573, 0.4482566225616371, -0.2837975278775641, -0.333126793540815, 0.10414690300286872, -0.2591217911676479, -0.13676398256662883, 0.15914926167520232, -0.10457808707397491, 0.09766484638314973, 0.05498992420115414, 0.007907287540153306, 0.01898890179041885, -0.29915502063810506, 0.28043733128934184, 0.09569203096098282, 0.3668364260450284, 0.09344744549337078, 0.029795371876895068, -0.005153493749047505, 0.0018869008589411443, -0.014736940125551294, -0.03721109010238869, 0.16571488153665043, 0.36978094245899806, 0.24630986065927515, 0.33303702293949966, -0.48443848647695176, -0.16640016639276461, 0.0839567044556868, 0.1655019990103612, 0.028683383668334606, -0.03886982192819811, -0.2677066360455863, 0.11344475780718308, -0.2395462865796797, -0.06703155901143576, -0.06876494259359364, -0.03892045383675293, 0.0712123426330465, -0.28827812018888915, -0.04662872836700974, -0.06638611338405127, 0.0017215776615801023, -0.04763433073129365, -0.09630578832780534, -0.04623278378344634, 0.18676171911056128, 0.05391531314621156, 0.047079143306130875, 0.1779925723331059, -0.16747997766410444, -0.10939891097872931, 0.4304933238296426, 0.034986497100970564, -0.20046358428058778, 0.1790692729422235, 0.030194646103636306, -0.17106764959818857, 0.12319661812846833, 0.2669398233015588, 0.07649490954248574, -0.22715862220611405, 0.022578961665077224, -0.0015236166695551199, 0.1584677012091911, 0.02435714397629235, 0.09187369614112426, 0.20919924863380066, 0.2412870247166026, 0.17565349301816346, 0.14382188638079574, -0.010242658734500885, -0.09602264606986534, -0.17908922271593847, -0.17449759724823868, -0.21026203904131596, 0.0010309104527064157, -0.10407884614777137, -0.17993679100567883, 0.33673364998284666, 0.15299729121719316, 0.15147124657053798, 0.13261669505210744, 0.3862221283678782, 0.08428425628649579, 0.14776333492438504, 0.1468034560747325, 0.11924986064878858, -0.03741387763922227, 0.2001130383269971, -0.14067480422152992, 0.14262947791136482, 0.020344123916630756]
|
1,803.06026
|
Influence of Sensorial Delay on Clustering and Swarming
|
We show that sensorial delay alters the collective motion of self-propelling
agents with aligning interactions: In a two-dimensional Vicsek model, short
delays enhance the emergence of clusters and swarms, while long or negative
delays prevent their formation. In order to quantify this phenomenon, we
introduce a global clustering parameter based on the Voronoi tessellation,
which permits us to efficiently measure the formation of clusters. Thanks to
its simplicity, sensorial delay might already play a role in the organization
of living organisms and can provide a powerful tool to engineer and dynamically
tune the behavior of large ensembles of autonomous robots.
|
cond-mat.soft
|
we show that sensorial delay alters the collective motion of selfpropelling agents with aligning interactions in a twodimensional vicsek model short delays enhance the emergence of clusters and swarms while long or negative delays prevent their formation in order to quantify this phenomenon we introduce a global clustering parameter based on the voronoi tessellation which permits us to efficiently measure the formation of clusters thanks to its simplicity sensorial delay might already play a role in the organization of living organisms and can provide a powerful tool to engineer and dynamically tune the behavior of large ensembles of autonomous robots
|
[['we', 'show', 'that', 'sensorial', 'delay', 'alters', 'the', 'collective', 'motion', 'of', 'selfpropelling', 'agents', 'with', 'aligning', 'interactions', 'in', 'a', 'twodimensional', 'vicsek', 'model', 'short', 'delays', 'enhance', 'the', 'emergence', 'of', 'clusters', 'and', 'swarms', 'while', 'long', 'or', 'negative', 'delays', 'prevent', 'their', 'formation', 'in', 'order', 'to', 'quantify', 'this', 'phenomenon', 'we', 'introduce', 'a', 'global', 'clustering', 'parameter', 'based', 'on', 'the', 'voronoi', 'tessellation', 'which', 'permits', 'us', 'to', 'efficiently', 'measure', 'the', 'formation', 'of', 'clusters', 'thanks', 'to', 'its', 'simplicity', 'sensorial', 'delay', 'might', 'already', 'play', 'a', 'role', 'in', 'the', 'organization', 'of', 'living', 'organisms', 'and', 'can', 'provide', 'a', 'powerful', 'tool', 'to', 'engineer', 'and', 'dynamically', 'tune', 'the', 'behavior', 'of', 'large', 'ensembles', 'of', 'autonomous', 'robots']]
|
[-0.14815708222216928, 0.14765932713868096, -0.1169922300282633, 0.07004833967774175, -0.11067021768074482, -0.11109559803735465, 0.06019130304222926, 0.38107488825917246, -0.2815081989020109, -0.34403322445228696, 0.017657504352973773, -0.22070968646556138, -0.2076612573605962, 0.11707671300973743, -0.05830521581694484, -0.006656174604431726, 0.03837750476668589, 0.0012105957957101055, 0.05367762552807107, -0.22149186285911127, 0.2646648025605828, 0.09590156915975967, 0.2822675180644728, 0.02417993867304176, 0.1302882887609303, 0.015345154018141328, -0.016214171731844543, 0.024903905275277794, -0.1240354538529209, 0.14092703597270884, 0.21735068305046298, 0.08777106718938739, 0.3052921523153782, -0.4642724439874291, -0.23750616657547652, 0.15168047378305347, 0.1987805555621162, 0.14329516613041052, -0.04477738333051093, -0.30489904668182133, 0.06405964182689786, -0.16184447706211358, -0.17567852126667277, -0.10362861613743007, 0.017247345079667867, 0.08592092370789033, -0.22626735695404931, 0.046498641906073314, 0.03625980790704489, 0.029673816692084073, -0.06160222042002715, 0.01615496212616563, -0.012139804644975811, 0.2294279125216417, -0.00028984696255065503, -0.02512424055952579, 0.17967823666986077, -0.13580889316974207, -0.13493966582231223, 0.42220441993325947, -0.01151000932441093, -0.1924138411138847, 0.2717807918251492, -0.1354588231537491, -0.12821080025169068, 0.1180340216960758, 0.26551471846643837, 0.07996765119489282, -0.15575967526994647, -0.0032552899903384967, 0.042414910607039925, 0.18145512137096376, 0.055706452000886204, 0.05362658732105047, 0.22591308570932597, 0.22098152950406075, 0.09868936311919242, 0.14639938909211195, -0.06294682128180284, -0.1550639687012881, -0.17831176230683923, -0.13155570724979043, -0.1282205980620347, 0.03475228999770479, -0.11112136702009594, -0.16451215412467718, 0.37554164838045834, 0.16431795774959027, 0.22851292935200035, 0.05555075189404306, 0.24598096082918347, 0.02195681936107576, 0.11069472412462346, 0.019412324726581574, 0.2255340589862317, 0.08144018084742129, 0.11712081703124567, -0.28539930772036315, 0.11757476155675249, 0.042561153573915364]
|
1,803.06027
|
Khuri-Treiman equations for $\pi\pi$ scattering
|
The Khuri-Treiman formalism models the partial-wave expansion of a scattering
amplitude as a sum of three individual truncated series, capturing the
low-energy dynamics of the direct and cross channels. We cast this formalism
into dispersive equations to study $\pi\pi$ scattering, and compare their
expressions and numerical output to the Roy and GKPY equations. We prove that
the Khuri-Treiman equations and Roy equations coincide when both are truncated
to include only $S$- and $P$-waves. When higher partial waves are included, we
find an excellent agreement between the Khuri-Treiman and the GKPY results.
This lends credence to the notion that the Khuri-Treiman formalism is a
reliable low-energy tool for studying hadronic reaction amplitudes.
|
hep-ph
|
the khuritreiman formalism models the partialwave expansion of a scattering amplitude as a sum of three individual truncated series capturing the lowenergy dynamics of the direct and cross channels we cast this formalism into dispersive equations to study pipi scattering and compare their expressions and numerical output to the roy and gkpy equations we prove that the khuritreiman equations and roy equations coincide when both are truncated to include only s and pwaves when higher partial waves are included we find an excellent agreement between the khuritreiman and the gkpy results this lends credence to the notion that the khuritreiman formalism is a reliable lowenergy tool for studying hadronic reaction amplitudes
|
[['the', 'khuritreiman', 'formalism', 'models', 'the', 'partialwave', 'expansion', 'of', 'a', 'scattering', 'amplitude', 'as', 'a', 'sum', 'of', 'three', 'individual', 'truncated', 'series', 'capturing', 'the', 'lowenergy', 'dynamics', 'of', 'the', 'direct', 'and', 'cross', 'channels', 'we', 'cast', 'this', 'formalism', 'into', 'dispersive', 'equations', 'to', 'study', 'pipi', 'scattering', 'and', 'compare', 'their', 'expressions', 'and', 'numerical', 'output', 'to', 'the', 'roy', 'and', 'gkpy', 'equations', 'we', 'prove', 'that', 'the', 'khuritreiman', 'equations', 'and', 'roy', 'equations', 'coincide', 'when', 'both', 'are', 'truncated', 'to', 'include', 'only', 's', 'and', 'pwaves', 'when', 'higher', 'partial', 'waves', 'are', 'included', 'we', 'find', 'an', 'excellent', 'agreement', 'between', 'the', 'khuritreiman', 'and', 'the', 'gkpy', 'results', 'this', 'lends', 'credence', 'to', 'the', 'notion', 'that', 'the', 'khuritreiman', 'formalism', 'is', 'a', 'reliable', 'lowenergy', 'tool', 'for', 'studying', 'hadronic', 'reaction', 'amplitudes']]
|
[-0.12137354615035358, 0.09149144824108146, -0.11546651748253393, 0.10597083824455973, -0.07300466557478046, -0.09187065852336115, 0.02021766464888781, 0.29679746345222535, -0.23675944218160333, -0.22800635536377495, 0.02494845495492153, -0.31678135425003395, -0.13860031808013315, 0.18173313222674503, 0.06298272278755568, 0.07047761899528203, 0.07435422921804963, -0.006791678181773907, -0.09564854140468948, -0.18263967467895667, 0.28576067625335205, 0.0428682914410659, 0.2403591577936937, 0.08557186243417966, 0.08246775460219732, 0.06460207684787812, -0.08623473250584023, -0.01252947861815358, -0.15771542573916655, 0.10285684401337225, 0.26018973799183914, 0.0683119332224869, 0.1685213183455572, -0.44742002391868885, -0.1750850275553226, 0.007440574328742317, 0.15302830152549185, 0.14296296262392053, 0.04950899774049249, -0.30143063646313306, 0.05871598277165479, -0.19958875862764078, -0.1563993102057023, -0.1437666011756068, 0.013828642443472703, 0.00793144308022215, -0.3008091652845578, 0.09301849726906365, 0.03823505713067412, -0.012643008641814729, -0.09669676651918069, -0.13859130610787385, -0.025584376041634795, 0.07964087934033978, 0.051882655500342045, -0.008915727874966807, 0.03770772424350317, -0.11409037828923681, -0.0735115572235438, 0.36906609715902255, -0.09111993500400704, -0.20150085078182142, 0.1499782706451443, -0.15295976708299136, -0.10011994239857404, 0.152754529287015, 0.14927249056966724, 0.10915448322791506, -0.18514803557594828, 0.10067538992210233, -0.04267047046314556, 0.12381684876609224, 0.09557291306555271, 0.026346633105309627, 0.15504842470106375, 0.1064400650049048, -0.05205160850105253, 0.0786672544787294, -0.04477145479386882, -0.11708168568706291, -0.3446760264200133, -0.11644100957808504, -0.07383058195082084, 0.031020199523416458, -0.08627417029276478, -0.15583048497435745, 0.3213144998561155, 0.13763354017256615, 0.19270709472989478, 0.08608275506779686, 0.29922376120009936, 0.20867137916214126, -0.006101073854527361, 0.054542354572363, 0.25468520331196487, 0.2385198182451564, 0.07633873733045819, -0.2690765527832146, -0.003284963879834961, 0.08074683518996378]
|
1,803.06028
|
Crackling to periodic dynamics in sheared granular media
|
The local and global dynamics of a sheared granular medium are studied in a
model experiment as a function of several macroscopic parameters. We observe
that by changing the shear rate or the loading stiffness, the system crackles,
with intermittent slip avalanches, or exhibits periodic motion. By analyzing
the global force, induced while shearing, we capture the transition from the
crackling to the periodic regime and associated scaling laws. We deduce a novel
dynamic phase diagram as a function of the shear rate and the system's
stiffness. Using photo-elasticimetry, we also capture the grain-scale stress
evolution, and investigate the microscopic behavior in the different regimes.
|
cond-mat.soft cond-mat.dis-nn
|
the local and global dynamics of a sheared granular medium are studied in a model experiment as a function of several macroscopic parameters we observe that by changing the shear rate or the loading stiffness the system crackles with intermittent slip avalanches or exhibits periodic motion by analyzing the global force induced while shearing we capture the transition from the crackling to the periodic regime and associated scaling laws we deduce a novel dynamic phase diagram as a function of the shear rate and the systems stiffness using photoelasticimetry we also capture the grainscale stress evolution and investigate the microscopic behavior in the different regimes
|
[['the', 'local', 'and', 'global', 'dynamics', 'of', 'a', 'sheared', 'granular', 'medium', 'are', 'studied', 'in', 'a', 'model', 'experiment', 'as', 'a', 'function', 'of', 'several', 'macroscopic', 'parameters', 'we', 'observe', 'that', 'by', 'changing', 'the', 'shear', 'rate', 'or', 'the', 'loading', 'stiffness', 'the', 'system', 'crackles', 'with', 'intermittent', 'slip', 'avalanches', 'or', 'exhibits', 'periodic', 'motion', 'by', 'analyzing', 'the', 'global', 'force', 'induced', 'while', 'shearing', 'we', 'capture', 'the', 'transition', 'from', 'the', 'crackling', 'to', 'the', 'periodic', 'regime', 'and', 'associated', 'scaling', 'laws', 'we', 'deduce', 'a', 'novel', 'dynamic', 'phase', 'diagram', 'as', 'a', 'function', 'of', 'the', 'shear', 'rate', 'and', 'the', 'systems', 'stiffness', 'using', 'photoelasticimetry', 'we', 'also', 'capture', 'the', 'grainscale', 'stress', 'evolution', 'and', 'investigate', 'the', 'microscopic', 'behavior', 'in', 'the', 'different', 'regimes']]
|
[-0.18739872459823695, 0.19895895205151576, -0.10233353140602748, 0.03714888749303869, -0.011824361944141297, -0.09100398355468105, 0.030228914050474905, 0.32301503978669643, -0.33738770393224865, -0.27068518508727163, 0.09340537360717113, -0.24804644965423414, -0.19875642380121952, 0.16009181151569535, 0.02344344907368605, 0.08887561205595446, -0.010215005745591883, 0.0069830972307290025, -0.07632769462809218, -0.11426256726889943, 0.3075737558448544, 0.04688711797531981, 0.32850143838172347, 0.0033102257338424143, 0.11897875917985892, -0.008821459684091119, 0.007872813497669995, 0.09759476320603146, -0.2111542808016356, 0.009088077443616034, 0.13564718476733945, -0.0021682702757131597, 0.21536317054862872, -0.4586352966636276, -0.2565337516582356, 0.07615942968942153, 0.10290015104916304, 0.11079504722595, -0.027540492608330587, -0.26009757111583337, 0.03125070643056041, -0.17055973089120996, -0.1415380926695294, -0.08063705730287787, 0.0365906530418075, 0.11979138702232515, -0.2793843619919454, 0.1694996454145719, 0.07157320795186724, 0.08818037337802637, -0.1195626088570302, 0.014842652152695406, -0.035706010476972624, 0.1599752401592783, 0.0717599220437338, -0.0047052966681523966, 0.22525846555184287, -0.18074809893397076, -0.04390088839528079, 0.3874865495510256, -0.06297089434208548, -0.16585166535850687, 0.22218113096180156, -0.1661318463112156, -0.07470983574883296, 0.16468864438446382, 0.19843351934105158, 0.06094524781488312, -0.1595665816611682, -0.011544349265302746, -0.003371764198303796, 0.15120176317801592, 0.04540980951815772, -0.018847325722722765, 0.20151885291740584, 0.22040760483091268, 0.03189025515726266, 0.18048391408172812, -0.1154455177305723, -0.10729922841822442, -0.2746445256858491, -0.10072299948212905, -0.14581839013128325, 0.022352979742348768, -0.10825301542858003, -0.17195354276806868, 0.39618005209530777, 0.10670969002127934, 0.23501766718646439, 0.04976426567121122, 0.25230451792818853, 0.11990329993736501, 0.035639440528869346, 0.05974712891307158, 0.27570327196288136, 0.12120630172564863, 0.15389275941729116, -0.2981033005747192, 0.10835265683216186, 0.0790578356335083]
|
1,803.06029
|
A New Model for the Distribution of Observable Earthquake Magnitudes and
Applications to $b$-value Estimation
|
The $b$-value in the Gutenberg-Richter (GR) law contains information that is
essential for evaluating earthquake hazard and predicting the occurrence of
large earthquakes. Estimates of $b$ are often based on seismic events whose
magnitude exceed a certain threshold, the so called magnitude of completeness.
Such estimates are sensitive to the choice of threshold and often ignore a
substantial portion of available data. We present a general model for the
distribution of observable earthquake magnitudes and an estimation procedure
that takes all measurements into account. The model is obtained by generalizing
previous probabilistic descriptions of sensor network limitations and by using
a generalization of the GR law. We show that our model is flexible enough to
handle spatio-temporal variations in the seismic environment and captures
valuable information about sensor network coverage. We also show that the model
leads to significantly improved $b$-value estimates compared with established
methods relying on the magnitude of completeness.
|
physics.geo-ph
|
the bvalue in the gutenbergrichter gr law contains information that is essential for evaluating earthquake hazard and predicting the occurrence of large earthquakes estimates of b are often based on seismic events whose magnitude exceed a certain threshold the so called magnitude of completeness such estimates are sensitive to the choice of threshold and often ignore a substantial portion of available data we present a general model for the distribution of observable earthquake magnitudes and an estimation procedure that takes all measurements into account the model is obtained by generalizing previous probabilistic descriptions of sensor network limitations and by using a generalization of the gr law we show that our model is flexible enough to handle spatiotemporal variations in the seismic environment and captures valuable information about sensor network coverage we also show that the model leads to significantly improved bvalue estimates compared with established methods relying on the magnitude of completeness
|
[['the', 'bvalue', 'in', 'the', 'gutenbergrichter', 'gr', 'law', 'contains', 'information', 'that', 'is', 'essential', 'for', 'evaluating', 'earthquake', 'hazard', 'and', 'predicting', 'the', 'occurrence', 'of', 'large', 'earthquakes', 'estimates', 'of', 'b', 'are', 'often', 'based', 'on', 'seismic', 'events', 'whose', 'magnitude', 'exceed', 'a', 'certain', 'threshold', 'the', 'so', 'called', 'magnitude', 'of', 'completeness', 'such', 'estimates', 'are', 'sensitive', 'to', 'the', 'choice', 'of', 'threshold', 'and', 'often', 'ignore', 'a', 'substantial', 'portion', 'of', 'available', 'data', 'we', 'present', 'a', 'general', 'model', 'for', 'the', 'distribution', 'of', 'observable', 'earthquake', 'magnitudes', 'and', 'an', 'estimation', 'procedure', 'that', 'takes', 'all', 'measurements', 'into', 'account', 'the', 'model', 'is', 'obtained', 'by', 'generalizing', 'previous', 'probabilistic', 'descriptions', 'of', 'sensor', 'network', 'limitations', 'and', 'by', 'using', 'a', 'generalization', 'of', 'the', 'gr', 'law', 'we', 'show', 'that', 'our', 'model', 'is', 'flexible', 'enough', 'to', 'handle', 'spatiotemporal', 'variations', 'in', 'the', 'seismic', 'environment', 'and', 'captures', 'valuable', 'information', 'about', 'sensor', 'network', 'coverage', 'we', 'also', 'show', 'that', 'the', 'model', 'leads', 'to', 'significantly', 'improved', 'bvalue', 'estimates', 'compared', 'with', 'established', 'methods', 'relying', 'on', 'the', 'magnitude', 'of', 'completeness']]
|
[-0.06328829798210216, 0.05168725202661575, -0.0954450938335963, 0.120417734581248, -0.08035076703986545, -0.09338405995482676, 0.056036070398189815, 0.350388170930704, -0.19340642041673786, -0.3459609209584366, 0.11558710549281004, -0.28343568586646334, -0.1409248811511421, 0.23239743617963732, -0.11499501070265021, 0.050482933777139374, 0.08704617380250343, 0.04437272136075128, -0.04093125914713662, -0.20514854734861537, 0.2705479780553632, 0.06260044205210809, 0.3081519275866939, 0.023704317992700164, 0.1125140023842074, 0.02244891903645016, -0.1008079625439438, 0.050690534587422585, -0.13991981571158058, 0.12726207542781545, 0.21188898062743983, 0.15144835449877733, 0.2558113007843004, -0.408529085223563, -0.2545124954478141, 0.11023279474619285, 0.1073107274898671, 0.09346092096529901, 0.023013760631377073, -0.29291920708860025, 0.09436538948150548, -0.18086388303383596, -0.08563772872654035, -0.08366206224615637, 0.03079372108913958, 0.05456345192597885, -0.31920745971269515, 0.11419627618632053, 0.09562855982221663, 0.0618582662800212, -0.06256470656769939, -0.10935410392381814, -0.013993068206074991, 0.14218300370664924, 0.052706852699262334, 0.008106068057761723, 0.1309586588927471, -0.1403918281505053, -0.0634605108245619, 0.3885197779592617, -0.05739952875975225, -0.16399587396575188, 0.1307453353962812, -0.1421341423204132, -0.11044251574754813, 0.11847096618791846, 0.1756977492845372, 0.0751512863472798, -0.16383679790152728, 0.011082013242948482, 0.0043322859323540654, 0.17683690217764755, 0.03184106786073627, 0.04154564893494688, 0.17445070552333308, 0.2061920389839399, 0.07867715640091583, 0.10550722865369416, -0.1445279568954567, -0.07996893089914106, -0.30593623472132575, -0.07386521878039562, -0.18098181266549018, 0.016014417935175038, -0.14492380479609174, -0.17069257145110323, 0.39016484843542504, 0.2414403263216005, 0.19512782293742548, 0.08966124069104951, 0.30416717540203153, 0.11856959021564475, 0.09917357505037216, 0.06728823129148957, 0.23851839328639662, 0.07307447986616018, 0.06355129617823925, -0.15135929653019717, 0.1694747501062107, 0.03201850405189601]
|
1,803.0603
|
Estimation of lactate threshold with machine learning techniques in
recreational runners
|
Lactate threshold is considered an essential parameter when assessing
performance of elite and recreational runners and prescribing training
intensities in endurance sports. However, the measurement of blood lactate
concentration requires expensive equipment and the extraction of blood samples,
which are inconvenient for frequent monitoring. Furthermore, most recreational
runners do not have access to routine assessment of their physical fitness by
the aforementioned equipment so they are not able to calculate the lactate
threshold without resorting to an expensive and specialized centre. Therefore,
the main objective of this study is to create an intelligent system capable of
estimating the lactate threshold of recreational athletes participating in
endurance running sports. The solution here proposed is based on a machine
learning system which models the lactate evolution using recurrent neural
networks and includes the proposal of standardization of the temporal axis as
well as a modification of the stratified sampling method. The results show that
the proposed system accurately estimates the lactate threshold of 89.52% of the
athletes and its correlation with the experimentally measured lactate threshold
is very high (R=0,89). Moreover, its behaviour with the test dataset is as good
as with the training set, meaning that the generalization power of the model is
high. Therefore, in this study a machine learning based system is proposed as
alternative to the traditional invasive lactate threshold measurement tests for
recreational runners.
|
stat.ML
|
lactate threshold is considered an essential parameter when assessing performance of elite and recreational runners and prescribing training intensities in endurance sports however the measurement of blood lactate concentration requires expensive equipment and the extraction of blood samples which are inconvenient for frequent monitoring furthermore most recreational runners do not have access to routine assessment of their physical fitness by the aforementioned equipment so they are not able to calculate the lactate threshold without resorting to an expensive and specialized centre therefore the main objective of this study is to create an intelligent system capable of estimating the lactate threshold of recreational athletes participating in endurance running sports the solution here proposed is based on a machine learning system which models the lactate evolution using recurrent neural networks and includes the proposal of standardization of the temporal axis as well as a modification of the stratified sampling method the results show that the proposed system accurately estimates the lactate threshold of 8952 of the athletes and its correlation with the experimentally measured lactate threshold is very high r089 moreover its behaviour with the test dataset is as good as with the training set meaning that the generalization power of the model is high therefore in this study a machine learning based system is proposed as alternative to the traditional invasive lactate threshold measurement tests for recreational runners
|
[['lactate', 'threshold', 'is', 'considered', 'an', 'essential', 'parameter', 'when', 'assessing', 'performance', 'of', 'elite', 'and', 'recreational', 'runners', 'and', 'prescribing', 'training', 'intensities', 'in', 'endurance', 'sports', 'however', 'the', 'measurement', 'of', 'blood', 'lactate', 'concentration', 'requires', 'expensive', 'equipment', 'and', 'the', 'extraction', 'of', 'blood', 'samples', 'which', 'are', 'inconvenient', 'for', 'frequent', 'monitoring', 'furthermore', 'most', 'recreational', 'runners', 'do', 'not', 'have', 'access', 'to', 'routine', 'assessment', 'of', 'their', 'physical', 'fitness', 'by', 'the', 'aforementioned', 'equipment', 'so', 'they', 'are', 'not', 'able', 'to', 'calculate', 'the', 'lactate', 'threshold', 'without', 'resorting', 'to', 'an', 'expensive', 'and', 'specialized', 'centre', 'therefore', 'the', 'main', 'objective', 'of', 'this', 'study', 'is', 'to', 'create', 'an', 'intelligent', 'system', 'capable', 'of', 'estimating', 'the', 'lactate', 'threshold', 'of', 'recreational', 'athletes', 'participating', 'in', 'endurance', 'running', 'sports', 'the', 'solution', 'here', 'proposed', 'is', 'based', 'on', 'a', 'machine', 'learning', 'system', 'which', 'models', 'the', 'lactate', 'evolution', 'using', 'recurrent', 'neural', 'networks', 'and', 'includes', 'the', 'proposal', 'of', 'standardization', 'of', 'the', 'temporal', 'axis', 'as', 'well', 'as', 'a', 'modification', 'of', 'the', 'stratified', 'sampling', 'method', 'the', 'results', 'show', 'that', 'the', 'proposed', 'system', 'accurately', 'estimates', 'the', 'lactate', 'threshold', 'of', '8952', 'of', 'the', 'athletes', 'and', 'its', 'correlation', 'with', 'the', 'experimentally', 'measured', 'lactate', 'threshold', 'is', 'very', 'high', 'r089', 'moreover', 'its', 'behaviour', 'with', 'the', 'test', 'dataset', 'is', 'as', 'good', 'as', 'with', 'the', 'training', 'set', 'meaning', 'that', 'the', 'generalization', 'power', 'of', 'the', 'model', 'is', 'high', 'therefore', 'in', 'this', 'study', 'a', 'machine', 'learning', 'based', 'system', 'is', 'proposed', 'as', 'alternative', 'to', 'the', 'traditional', 'invasive', 'lactate', 'threshold', 'measurement', 'tests', 'for', 'recreational', 'runners']]
|
[-0.05287143127164907, 0.07258565007469668, -0.057114491135709815, 0.071316124371046, -0.06724114526891047, -0.1670164088356412, 0.06038778240727778, 0.37607787291208905, -0.20102341156297673, -0.3503313984887467, 0.12293847154670705, -0.25932280606279773, -0.16130310284387733, 0.22139164951888637, -0.12315297893145018, 0.10072506026882265, 0.08540278724239518, 0.0731490521464083, 0.007994024333957997, -0.23626113932476275, 0.25803698426009053, 0.1061923298984766, 0.3394494814591275, 0.05457887683684627, 0.1035671200380764, -0.009144843567693088, -0.006297272808021969, -0.011726950894937747, -0.07233967074639319, 0.10573849575076666, 0.2793331854663201, 0.18525152961413066, 0.3462871739061342, -0.41262800292318896, -0.1873987948779379, 0.11107537439920837, 0.12152297660410921, 0.08027160489621261, -0.022072139081364083, -0.24949680891301898, 0.09458113403369983, -0.1766809065370924, -0.07950811634047164, -0.0962079546559188, 0.0014761165819234317, 0.05182573807063616, -0.2795794944858385, 0.05228057261970308, 0.022218847958267562, 0.10221009285118068, -0.044340552762150764, -0.11536676790772213, -0.022003929258013765, 0.18765445306858358, 0.05410375374938465, 0.01858833836391568, 0.194996374859992, -0.17045764456554832, -0.11234567474134059, 0.38643024176255697, -0.021643858056567194, -0.1786908755865362, 0.1801880174037069, -0.0830303044229125, -0.10135078848857018, 0.096227175756875, 0.1872304577173458, 0.11522067566919658, -0.1834113517975978, -0.03767971033178684, 0.011404406922972865, 0.17217554659893117, 0.06786887026495404, -0.028439871470133462, 0.12294336733408272, 0.24607514752540738, 0.034243723007125984, 0.09318124867199609, -0.09219790058727893, -0.04805944496972693, -0.241571845151484, -0.1433577736891392, -0.18063944935798645, 0.017527486965603505, -0.07249500855764685, -0.17800411656084988, 0.3879510419526034, 0.18534708454687562, 0.1601505481519012, 0.07183978547756042, 0.3445591109411584, 0.07745536999679947, 0.09373844017067717, 0.0442442117747204, 0.2218585157332321, 0.04606323159222181, 0.14084855349320505, -0.23447348086939504, 0.1518524472022222, 0.013902615128705898]
|
1,803.06031
|
Optimal Bipartite Network Clustering
|
We study bipartite community detection in networks, or more generally the
network biclustering problem. We present a fast two-stage procedure based on
spectral initialization followed by the application of a pseudo-likelihood
classifier twice. Under mild regularity conditions, we establish the weak
consistency of the procedure (i.e., the convergence of the misclassification
rate to zero) under a general bipartite stochastic block model. We show that
the procedure is optimal in the sense that it achieves the optimal convergence
rate that is achievable by a biclustering oracle, adaptively over the whole
class, up to constants. This is further formalized by deriving a minimax lower
bound over a class of biclustering problems. The optimal rate we obtain
sharpens some of the existing results and generalizes others to a wide regime
of average degree growth, from sparse networks with average degrees growing
arbitrarily slowly to fairly dense networks with average degrees of order
$\sqrt{n}$. As a special case, we recover the known exact recovery threshold in
the $\log n$ regime of sparsity. To obtain the consistency result, as part of
the provable version of the algorithm, we introduce a sub-block partitioning
scheme that is also computationally attractive, allowing for distributed
implementation of the algorithm without sacrificing optimality. The provable
algorithm is derived from a general class of pseudo-likelihood biclustering
algorithms that employ simple EM type updates. We show the effectiveness of
this general class by numerical simulations.
|
math.ST cs.SI stat.ML stat.TH
|
we study bipartite community detection in networks or more generally the network biclustering problem we present a fast twostage procedure based on spectral initialization followed by the application of a pseudolikelihood classifier twice under mild regularity conditions we establish the weak consistency of the procedure ie the convergence of the misclassification rate to zero under a general bipartite stochastic block model we show that the procedure is optimal in the sense that it achieves the optimal convergence rate that is achievable by a biclustering oracle adaptively over the whole class up to constants this is further formalized by deriving a minimax lower bound over a class of biclustering problems the optimal rate we obtain sharpens some of the existing results and generalizes others to a wide regime of average degree growth from sparse networks with average degrees growing arbitrarily slowly to fairly dense networks with average degrees of order sqrtn as a special case we recover the known exact recovery threshold in the log n regime of sparsity to obtain the consistency result as part of the provable version of the algorithm we introduce a subblock partitioning scheme that is also computationally attractive allowing for distributed implementation of the algorithm without sacrificing optimality the provable algorithm is derived from a general class of pseudolikelihood biclustering algorithms that employ simple em type updates we show the effectiveness of this general class by numerical simulations
|
[['we', 'study', 'bipartite', 'community', 'detection', 'in', 'networks', 'or', 'more', 'generally', 'the', 'network', 'biclustering', 'problem', 'we', 'present', 'a', 'fast', 'twostage', 'procedure', 'based', 'on', 'spectral', 'initialization', 'followed', 'by', 'the', 'application', 'of', 'a', 'pseudolikelihood', 'classifier', 'twice', 'under', 'mild', 'regularity', 'conditions', 'we', 'establish', 'the', 'weak', 'consistency', 'of', 'the', 'procedure', 'ie', 'the', 'convergence', 'of', 'the', 'misclassification', 'rate', 'to', 'zero', 'under', 'a', 'general', 'bipartite', 'stochastic', 'block', 'model', 'we', 'show', 'that', 'the', 'procedure', 'is', 'optimal', 'in', 'the', 'sense', 'that', 'it', 'achieves', 'the', 'optimal', 'convergence', 'rate', 'that', 'is', 'achievable', 'by', 'a', 'biclustering', 'oracle', 'adaptively', 'over', 'the', 'whole', 'class', 'up', 'to', 'constants', 'this', 'is', 'further', 'formalized', 'by', 'deriving', 'a', 'minimax', 'lower', 'bound', 'over', 'a', 'class', 'of', 'biclustering', 'problems', 'the', 'optimal', 'rate', 'we', 'obtain', 'sharpens', 'some', 'of', 'the', 'existing', 'results', 'and', 'generalizes', 'others', 'to', 'a', 'wide', 'regime', 'of', 'average', 'degree', 'growth', 'from', 'sparse', 'networks', 'with', 'average', 'degrees', 'growing', 'arbitrarily', 'slowly', 'to', 'fairly', 'dense', 'networks', 'with', 'average', 'degrees', 'of', 'order', 'sqrtn', 'as', 'a', 'special', 'case', 'we', 'recover', 'the', 'known', 'exact', 'recovery', 'threshold', 'in', 'the', 'log', 'n', 'regime', 'of', 'sparsity', 'to', 'obtain', 'the', 'consistency', 'result', 'as', 'part', 'of', 'the', 'provable', 'version', 'of', 'the', 'algorithm', 'we', 'introduce', 'a', 'subblock', 'partitioning', 'scheme', 'that', 'is', 'also', 'computationally', 'attractive', 'allowing', 'for', 'distributed', 'implementation', 'of', 'the', 'algorithm', 'without', 'sacrificing', 'optimality', 'the', 'provable', 'algorithm', 'is', 'derived', 'from', 'a', 'general', 'class', 'of', 'pseudolikelihood', 'biclustering', 'algorithms', 'that', 'employ', 'simple', 'em', 'type', 'updates', 'we', 'show', 'the', 'effectiveness', 'of', 'this', 'general', 'class', 'by', 'numerical', 'simulations']]
|
[-0.11548864243246311, 0.009243785417658705, -0.06603847370610888, 0.07442032733618366, -0.06739616089464513, -0.16915765858371243, 0.12113384685335209, 0.37859543655434913, -0.28505842227392825, -0.2917329320971866, 0.12752316669359115, -0.1870420379754028, -0.18396826698784535, 0.18543460958230343, -0.10069640193613198, 0.0937751227711995, 0.09283940618370096, 0.04774965341050526, -0.08991601542657633, -0.31584343628342315, 0.277472897169436, 0.08152913239428798, 0.307526057169377, 0.003566825408148759, 0.11206711475365663, 0.01986882327795988, 0.016227482246482832, 0.04154127750639672, -0.14660205297418016, 0.13950417341630458, 0.248374374226623, 0.18503388946939883, 0.342191531302911, -0.349136288413706, -0.19053851709596947, 0.1319714383738787, 0.12767362934494764, 0.13688716693989164, -0.039349376337711156, -0.24310293411356376, 0.13469753732361187, -0.15831894557599563, -0.11053751678457843, -0.0920415293313403, -0.048537165572059386, 0.02889221447121248, -0.36977459804070995, 0.09640411765386087, 0.0968817311045294, 0.016566125226362964, -0.026742314253813813, -0.09825259223310556, 0.07196938358607019, 0.07240304477410911, 0.04095779159336147, 0.027974042556320553, 0.09331328946349607, -0.11650772571170007, -0.10331632251513506, 0.3270602515650575, -0.08002580176537273, -0.18612000940951154, 0.16813810958572994, -0.0744486750051571, -0.14845200154586602, 0.14484950390198695, 0.19089990489728462, 0.17051035333264922, -0.14477155401167568, 0.09339972200244866, -0.090722981005979, 0.15676499764502944, 0.06048164770502773, 0.0442958765904531, 0.0678601113533753, 0.17974126758453607, 0.16934710867351216, 0.1958274344999599, -0.06147947859582631, -0.09419615149234178, -0.28182556959520627, -0.09834580932910726, -0.2047322613333028, 0.02732368313673436, -0.16629313989316338, -0.15660258937355276, 0.38775079840421167, 0.15400641257654826, 0.19305551391846376, 0.18584249278029843, 0.2956473866973248, 0.10047256928876586, 0.032563552438269486, 0.15438833377072228, 0.2005961330987507, 0.12989529357351715, 0.05737369129950852, -0.19551025245882284, 0.11482496660746347, 0.11782259161108426]
|
1,803.06032
|
You Watch, You Give, and You Engage: A Study of Live Streaming Practices
in China
|
Despite gaining traction in North America, live streaming has not reached the
popularity it has in China, where livestreaming has a tremendous impact on the
social behaviors of users. To better understand this socio-technological
phenomenon, we conducted a mixed methods study of live streaming practices in
China. We present the results of an online survey of 527 live streaming users,
focusing on their broadcasting or viewing practices and the experiences they
find most engaging. We also interviewed 14 active users to explore their
motivations and experiences. Our data revealed the different categories of
content that was broadcasted and how varying aspects of this content engaged
viewers. We also gained insight into the role reward systems and fan group-chat
play in engaging users, while also finding evidence that both viewers and
streamers desire deeper channels and mechanisms for interaction in addition to
the commenting, gifting, and fan groups that are available today.
|
cs.HC
|
despite gaining traction in north america live streaming has not reached the popularity it has in china where livestreaming has a tremendous impact on the social behaviors of users to better understand this sociotechnological phenomenon we conducted a mixed methods study of live streaming practices in china we present the results of an online survey of 527 live streaming users focusing on their broadcasting or viewing practices and the experiences they find most engaging we also interviewed 14 active users to explore their motivations and experiences our data revealed the different categories of content that was broadcasted and how varying aspects of this content engaged viewers we also gained insight into the role reward systems and fan groupchat play in engaging users while also finding evidence that both viewers and streamers desire deeper channels and mechanisms for interaction in addition to the commenting gifting and fan groups that are available today
|
[['despite', 'gaining', 'traction', 'in', 'north', 'america', 'live', 'streaming', 'has', 'not', 'reached', 'the', 'popularity', 'it', 'has', 'in', 'china', 'where', 'livestreaming', 'has', 'a', 'tremendous', 'impact', 'on', 'the', 'social', 'behaviors', 'of', 'users', 'to', 'better', 'understand', 'this', 'sociotechnological', 'phenomenon', 'we', 'conducted', 'a', 'mixed', 'methods', 'study', 'of', 'live', 'streaming', 'practices', 'in', 'china', 'we', 'present', 'the', 'results', 'of', 'an', 'online', 'survey', 'of', '527', 'live', 'streaming', 'users', 'focusing', 'on', 'their', 'broadcasting', 'or', 'viewing', 'practices', 'and', 'the', 'experiences', 'they', 'find', 'most', 'engaging', 'we', 'also', 'interviewed', '14', 'active', 'users', 'to', 'explore', 'their', 'motivations', 'and', 'experiences', 'our', 'data', 'revealed', 'the', 'different', 'categories', 'of', 'content', 'that', 'was', 'broadcasted', 'and', 'how', 'varying', 'aspects', 'of', 'this', 'content', 'engaged', 'viewers', 'we', 'also', 'gained', 'insight', 'into', 'the', 'role', 'reward', 'systems', 'and', 'fan', 'groupchat', 'play', 'in', 'engaging', 'users', 'while', 'also', 'finding', 'evidence', 'that', 'both', 'viewers', 'and', 'streamers', 'desire', 'deeper', 'channels', 'and', 'mechanisms', 'for', 'interaction', 'in', 'addition', 'to', 'the', 'commenting', 'gifting', 'and', 'fan', 'groups', 'that', 'are', 'available', 'today']]
|
[-0.12372705426222334, 0.09320550218777499, -0.0942619520581017, 0.07616489018468807, -0.15052814352946978, -0.12185855254530907, 0.09098506459539446, 0.42205965330203377, -0.2172037114428046, -0.3393060652787487, 0.08033536615393434, -0.3407628891368707, -0.21180909958512834, 0.17057699500427892, -0.09529661635557811, -0.07623989980434999, 0.05772686862076322, 0.03388791978980104, 0.0057258237471493586, -0.33609518308192493, 0.2839401274609069, 0.10442939653624005, 0.3458686353638768, 0.0823522904329002, 0.05447668062833448, -0.0038823915583391985, -0.10240994623862207, -0.017468399244050185, -0.11422257390256467, 0.1367189232011636, 0.33811131211657386, 0.22805241373212387, 0.3640424691575269, -0.4678677265330528, -0.1839137056283653, 0.06600820971652865, 0.19064755037116507, 0.04024019189023723, -0.14298402304916333, -0.31757313455144565, 0.07295938250298302, -0.21045921050322552, -0.05758085621520877, -0.030208660842229923, 0.03963018419686705, 0.002110846086482828, -0.2060381971951574, -0.006143399233114906, 0.022386218905448913, 0.11603131230920553, -0.07440957928076386, -0.11120347258013984, -0.004989863042719662, 0.2580751172173768, 0.11305457484986012, -0.01557480171128797, 0.15263696266959112, -0.19535909800169368, -0.12849977403879165, 0.39807407135687145, 0.008891078643500805, -0.10919559563772055, 0.2410427920302997, -0.13195025256524484, -0.11443028920330107, 0.07965793341475849, 0.28122007561537127, 0.047939738561399284, -0.13772970885814478, -0.0007667226604341218, -0.06449186435590187, 0.15365395931837458, 0.07985012744242946, 0.032977267678361386, 0.20057871028780938, 0.18335479625190299, 0.0420662270920972, 0.061661836757945516, -0.02537418682128191, -0.10169934700243174, -0.15881893048994244, -0.14149631278861002, -0.08351604502958555, -0.004843432250490878, -0.04444253795712332, -0.08342990583895395, 0.39130956027656794, 0.17729293589790662, 0.13426535215384017, -0.00788180166700234, 0.27227067498490215, -0.016001454302265, 0.06806536849277715, 0.12002751041514179, 0.2056581692630425, 0.0032107486529275777, 0.24726019983024647, -0.12715286972544468, 0.09603928860587378, -0.06199897366265456]
|
1,803.06033
|
$W^{1,p}$ regularity of solutions to Kolmogorov equation and associated
Feller semigroup
|
In $\mathbb R^d$, $d \geq 3$, consider the divergence and the non-divergence
form operators \begin{equation} \tag{$i$} - \nabla \cdot a \cdot \nabla + b
\cdot \nabla, \end{equation} \begin{equation} \tag{$ii$} - a \cdot \nabla^2 + b
\cdot \nabla, \end{equation} where $a=I+c \mathsf{f} \otimes \mathsf{f}$, the
vector fields $\nabla_i \mathsf{f}$ ($i=1,2,\dots,d$) and $b$ are form-bounded
(this includes the sub-critical class $[L^d + L^\infty]^d$ as well as vector
fields having critical-order singularities). We characterize quantitative
dependence on $c$ and the values of the form-bounds of the $L^q \rightarrow
W^{1,qd/(d-2)}$ regularity of the resolvents of the operator realizations of
($i$), ($ii$) in $L^q$, $q \geq 2 \vee ( d-2)$ as (minus) generators of
positivity preserving $L^\infty$ contraction $C_0$ semigroups. The latter
allows to run an iteration procedure $L^p \rightarrow L^\infty$ that yields
associated with ($i$), ($ii$) $L^q$-strong Feller semigroups.
|
math.AP math.PR
|
in mathbb rd d geq 3 consider the divergence and the nondivergence form operators beginequation tagi nabla cdot a cdot nabla b cdot nabla endequation beginequation tagii a cdot nabla2 b cdot nabla endequation where aic mathsff otimes mathsff the vector fields nabla_i mathsff i12dotsd and b are formbounded this includes the subcritical class ld linftyd as well as vector fields having criticalorder singularities we characterize quantitative dependence on c and the values of the formbounds of the lq rightarrow w1qdd2 regularity of the resolvents of the operator realizations of i ii in lq q geq 2 vee d2 as minus generators of positivity preserving linfty contraction c_0 semigroups the latter allows to run an iteration procedure lp rightarrow linfty that yields associated with i ii lqstrong feller semigroups
|
[['in', 'mathbb', 'rd', 'd', 'geq', '3', 'consider', 'the', 'divergence', 'and', 'the', 'nondivergence', 'form', 'operators', 'beginequation', 'tagi', 'nabla', 'cdot', 'a', 'cdot', 'nabla', 'b', 'cdot', 'nabla', 'endequation', 'beginequation', 'tagii', 'a', 'cdot', 'nabla2', 'b', 'cdot', 'nabla', 'endequation', 'where', 'aic', 'mathsff', 'otimes', 'mathsff', 'the', 'vector', 'fields', 'nabla_i', 'mathsff', 'i12dotsd', 'and', 'b', 'are', 'formbounded', 'this', 'includes', 'the', 'subcritical', 'class', 'ld', 'linftyd', 'as', 'well', 'as', 'vector', 'fields', 'having', 'criticalorder', 'singularities', 'we', 'characterize', 'quantitative', 'dependence', 'on', 'c', 'and', 'the', 'values', 'of', 'the', 'formbounds', 'of', 'the', 'lq', 'rightarrow', 'w1qdd2', 'regularity', 'of', 'the', 'resolvents', 'of', 'the', 'operator', 'realizations', 'of', 'i', 'ii', 'in', 'lq', 'q', 'geq', '2', 'vee', 'd2', 'as', 'minus', 'generators', 'of', 'positivity', 'preserving', 'linfty', 'contraction', 'c_0', 'semigroups', 'the', 'latter', 'allows', 'to', 'run', 'an', 'iteration', 'procedure', 'lp', 'rightarrow', 'linfty', 'that', 'yields', 'associated', 'with', 'i', 'ii', 'lqstrong', 'feller', 'semigroups']]
|
[-0.1776170790826361, 0.09991149295268359, 0.08058458341908972, 0.037056001735055036, -0.06277612596562493, -0.21004492551418802, -0.05304778515616612, 0.31712930276989937, -0.3288087958109475, -0.11288388653267775, 0.08867373882282165, -0.3800314332138148, -0.032428537563030276, 0.11015140056617619, -0.058091810957017924, 0.05808346629841723, -0.03622936779790888, 0.106779083440591, -0.12944709623397718, -0.17929367539134897, 0.3006387040161738, -0.11804075547831505, 0.12110438713082863, 0.00608688817855211, 0.10701038404330311, -0.024775493435651785, 0.07097688341520787, -0.12879891979185143, -0.27078196313073755, 0.027596296254365195, 0.18510989781052264, 0.12239929032324243, 0.29233559306650875, -0.3718189568213758, -0.0799222132867022, 0.2516469422938122, 0.17239064061328874, -0.14352959574710938, 0.046476908004654933, -0.3215720726237182, 0.10006196524256901, -0.06944706131734195, -0.10354180162258056, -0.07827337132485193, 0.1344545523489585, 0.05269597944401715, -0.4765889025894144, 0.12657163070604927, 0.14759346003448892, 0.05982706962423699, -0.0439216984992644, -0.23256962519935181, -0.07476657859027205, -0.019744791255723083, 0.00652121740014052, 0.20083090455192443, 0.034921719118081514, -0.09244936403082384, -0.03596452098422413, 0.3329655675427808, -0.1258102827395628, -0.22884519057603733, 0.031627902781756055, -0.2062851222891045, -0.15640011481046978, 0.04207833190899222, 0.1274893580029452, 0.20742086633559195, -0.05273784311007588, 0.3146338152850325, -0.04619508904344853, 0.10069923958508298, 0.10833605769796358, 0.03304625024470771, -0.04379584558304369, 0.04640890893032549, 0.1214037435359299, 0.04370990186109867, -0.00018876140811405475, -0.012925176396815768, -0.4655795045452373, -0.18995479370782814, -0.08411326537644791, 0.20754737523384392, -0.13112281231670134, -0.1086263251603551, 0.25842976300684256, 0.031722168918819196, 0.21658866518860562, 0.11012360192797778, 0.12868084348437767, 0.13827266416140652, 0.008226366451239184, 0.11713485543019019, 0.08115689207672051, 0.21901399700812274, 0.11643291332368408, -0.2399477033665584, -0.0023305056017688323, 0.18506577339834504]
|
1,803.06034
|
Multistage stochastic programs with a random number of stages: dynamic
programming equations, solution methods, and application to portfolio
selection
|
We introduce the class of multistage stochastic optimization problems with a
random number of stages. For such problems, we show how to write dynamic
programming equations and detail the Stochastic Dual Dynamic Programming
algorithm to solve these equations. Finally, we consider a portfolio selection
problem over an optimization period of random duration. For several instances
of this problem, we show the gain obtained using a policy that takes the random
duration of the number of stages into account over a policy built taking a
fixed number of stages (namely the maximal possible number of stages).
|
math.OC
|
we introduce the class of multistage stochastic optimization problems with a random number of stages for such problems we show how to write dynamic programming equations and detail the stochastic dual dynamic programming algorithm to solve these equations finally we consider a portfolio selection problem over an optimization period of random duration for several instances of this problem we show the gain obtained using a policy that takes the random duration of the number of stages into account over a policy built taking a fixed number of stages namely the maximal possible number of stages
|
[['we', 'introduce', 'the', 'class', 'of', 'multistage', 'stochastic', 'optimization', 'problems', 'with', 'a', 'random', 'number', 'of', 'stages', 'for', 'such', 'problems', 'we', 'show', 'how', 'to', 'write', 'dynamic', 'programming', 'equations', 'and', 'detail', 'the', 'stochastic', 'dual', 'dynamic', 'programming', 'algorithm', 'to', 'solve', 'these', 'equations', 'finally', 'we', 'consider', 'a', 'portfolio', 'selection', 'problem', 'over', 'an', 'optimization', 'period', 'of', 'random', 'duration', 'for', 'several', 'instances', 'of', 'this', 'problem', 'we', 'show', 'the', 'gain', 'obtained', 'using', 'a', 'policy', 'that', 'takes', 'the', 'random', 'duration', 'of', 'the', 'number', 'of', 'stages', 'into', 'account', 'over', 'a', 'policy', 'built', 'taking', 'a', 'fixed', 'number', 'of', 'stages', 'namely', 'the', 'maximal', 'possible', 'number', 'of', 'stages']]
|
[-0.1319799238325734, 0.05202322339188724, -0.0689320731761032, 0.0356025152827466, -0.08884543837538283, -0.10235926272151502, 0.0692987548383443, 0.36928031415507, -0.34667014552182274, -0.30595075582203113, 0.12657124935159167, -0.17261641680410034, -0.17006736335001493, 0.2068873917585925, -0.06967022177567216, 0.06444413796263306, 0.0793955840243909, 0.014259780644390143, -0.051636844405928924, -0.31560680143731207, 0.30327272101452474, -0.01361774339487678, 0.2175846860695042, -0.024451721690006947, 0.20030170845014877, 0.07203169773871962, -0.006365800699476447, 0.09804686595146593, -0.11267352152507029, 0.06192184170757077, 0.28448645151710433, 0.2262971814231653, 0.4106423077124514, -0.4564498066117889, -0.20369015117420963, 0.13727019011827285, 0.09645450645506284, 0.11294747865268666, -0.01941154751142389, -0.20256519242140808, 0.09755541637392813, -0.17170127361161194, -0.06793846050032268, -0.020682830177247525, -0.008705564431454005, 0.027655768835623012, -0.33361362445315246, -0.02183894980698824, 0.026322860716793097, -0.0032293486948076046, -0.07488433658880622, -0.15136371561522155, 0.05590549789271072, 0.09148176587431839, 0.05809867029985119, -0.04662529197276423, 0.09308355256277871, -0.10807850336606957, -0.19561673856683467, 0.37250579232840164, -0.023647059826793052, -0.1867000784724951, 0.13727095082010093, -0.02950736978826554, -0.16992344714112972, 0.14351563850221666, 0.2700690178690772, 0.17771004822203204, -0.14912560699801697, 0.051108220356246944, -0.047930301907227225, 0.15940024641979683, 0.05037150968258318, 0.0008023245309136416, 0.14475445448862095, 0.21607026731791465, 0.10983338256268517, 0.22990697533088295, -0.05930884121917188, -0.15572988629206327, -0.2881775018415953, -0.11099498600049533, -0.1174322488325599, 0.029773487729069435, -0.16182031806935188, -0.1753355804046518, 0.43723321553123623, 0.1676454683765769, 0.1806211865997236, 0.1556607554715715, 0.2683868938272721, 0.16591410471224471, 0.0020788794115345044, 0.09766522927307769, 0.11419358596597848, 0.08504732689379077, 0.12410514097611763, -0.25178821604502827, 0.05344552751630545, 0.10601671387098338]
|
1,803.06035
|
Reputation is required for cooperation to emerge in dynamic networks
|
Melamed, Harrell, and Simpson have recently reported on an experiment which
appears to show that cooperation can arise in a dynamic network without
reputational knowledge, i.e., purely via dynamics [1]. We believe that their
experimental design is actually not testing this, in so far as players do know
the last action of their current partners before making a choice on their own
next action and subsequently deciding which link to cut. Had the authors given
no information at all, the result would be a decline in cooperation as shown in
[2].
|
physics.soc-ph cs.SI econ.TH
|
melamed harrell and simpson have recently reported on an experiment which appears to show that cooperation can arise in a dynamic network without reputational knowledge ie purely via dynamics 1 we believe that their experimental design is actually not testing this in so far as players do know the last action of their current partners before making a choice on their own next action and subsequently deciding which link to cut had the authors given no information at all the result would be a decline in cooperation as shown in 2
|
[['melamed', 'harrell', 'and', 'simpson', 'have', 'recently', 'reported', 'on', 'an', 'experiment', 'which', 'appears', 'to', 'show', 'that', 'cooperation', 'can', 'arise', 'in', 'a', 'dynamic', 'network', 'without', 'reputational', 'knowledge', 'ie', 'purely', 'via', 'dynamics', '1', 'we', 'believe', 'that', 'their', 'experimental', 'design', 'is', 'actually', 'not', 'testing', 'this', 'in', 'so', 'far', 'as', 'players', 'do', 'know', 'the', 'last', 'action', 'of', 'their', 'current', 'partners', 'before', 'making', 'a', 'choice', 'on', 'their', 'own', 'next', 'action', 'and', 'subsequently', 'deciding', 'which', 'link', 'to', 'cut', 'had', 'the', 'authors', 'given', 'no', 'information', 'at', 'all', 'the', 'result', 'would', 'be', 'a', 'decline', 'in', 'cooperation', 'as', 'shown', 'in', '2']]
|
[-0.09895276876761475, 0.09428393990981729, -0.10996765788748032, 0.07759507925560077, -0.12271956339375012, -0.15070755699545973, 0.10056015978463823, 0.42041315163175264, -0.2596071656120734, -0.3281033788497249, 0.1316492429520521, -0.24229897342415319, -0.18231785228062009, 0.14524419408213968, -0.10010163482770117, -0.0278351917448971, 0.0624179019075301, 0.11809965349319908, -0.015861301382796632, -0.2944297786724443, 0.2980239534077959, 0.0718189654742471, 0.25293790864654714, 0.08463458145140773, 0.060876529005407874, -0.0015295576666378313, -0.0473145253645877, 0.010109250044398424, -0.09603025435240448, 0.04953940482551439, 0.2634825446539455, 0.1800336846564379, 0.3172488029632303, -0.4384678153607335, -0.21075333027789991, 0.14065599156957534, 0.16753221306328972, 0.1143522874219343, -0.024441948483905032, -0.2573738806014363, 0.09008657050500106, -0.19080327537117733, -0.07843947793460554, -0.06018280235536319, 0.02046334484799041, -0.026527083064946864, -0.23656978046314583, -0.036482950512112845, 0.08259423734206292, 0.05102407771369649, -0.03812703915561239, -0.11661470893046094, -0.04522516105013589, 0.17737551888761421, 0.04414410236964209, 0.0498270499410056, 0.10095937385534247, -0.16155335091623582, -0.1684358058186869, 0.3585769460303709, -0.024437667457904252, -0.18115780212812954, 0.21039287231396883, -0.13023922859898043, -0.1459991087205708, 0.07903710038194225, 0.12498726524257411, 0.08265340509824455, -0.14593183239921928, 0.027501321743087222, -0.06276711290572873, 0.1676263938140538, 0.09922266477046328, 0.0218132557386222, 0.18859159251054128, 0.1222889749178042, 0.07833559694182542, 0.051106048017067626, 0.0007514918274763557, -0.10407500681984756, -0.25322293109881383, -0.13277243051884902, -0.17719731718534604, 0.07847830980980587, 0.0016963575607708966, -0.10147334817480037, 0.34645074424851274, 0.1351038013610782, 0.19350614688980083, 0.059444273483111626, 0.26151887241026595, 0.07311985670174989, 0.10745456328149885, 0.062496768419320385, 0.3060315648869922, 0.031100349604255624, 0.12345122064774235, -0.15435705530560678, 0.1505319797485653, 0.015272535771752397]
|
1,803.06036
|
A Role for Turbulence in Circumgalactic Precipitation
|
Abundant observational evidence indicates that the cooling time t_cool of the
hot ambient medium pervading a massive galaxy does not drop much below 10 times
the freefall time t_ff at any radius. Theoretical models have accounted for
this finding by hypothesizing that cold clouds start to condense out of the
ambient medium when t_cool/t_ff < 10 and fuel a strong black-hole feedback
response that reheats the ambient gas, but those models have not yet been able
to provide a simple explanation for the origin of the critical t_cool/t_ff
ratio. This paper explores a heuristic model for condensation that links the
critical ratio to turbulent driving of gravity-wave oscillations. In the linear
regime, internal gravity waves are thermally unstable in a thermally balanced
medium. Buoyancy oscillations in a balanced medium with t_cool/t_ff therefore
grow until they saturate without condensing at an amplitude that depends on
t_cool/t_ff. However, in a medium with 10 < t_cool/t_ff < 20, turbulence with a
velocity dispersion roughly half the galaxy's stellar velocity dispersion can
drive those oscillations into condensation. Intriguingly, this is indeed the
gas-phase velocity dispersion observed among galaxy-cluster cores that contain
multiphase gas. It is therefore possible that both the critical t_cool/t_ff
ratio for condensation of ambient gas and the level of turbulence in that gas
are determined by coupling between condensation, feedback, and turbulence. Such
a system can converge to a well-regulated equilibrium state, as long as the
fraction of feedback energy that goes into turbulence is significantly less
than the fraction that goes more directly into heat.
|
astro-ph.GA
|
abundant observational evidence indicates that the cooling time t_cool of the hot ambient medium pervading a massive galaxy does not drop much below 10 times the freefall time t_ff at any radius theoretical models have accounted for this finding by hypothesizing that cold clouds start to condense out of the ambient medium when t_coolt_ff 10 and fuel a strong blackhole feedback response that reheats the ambient gas but those models have not yet been able to provide a simple explanation for the origin of the critical t_coolt_ff ratio this paper explores a heuristic model for condensation that links the critical ratio to turbulent driving of gravitywave oscillations in the linear regime internal gravity waves are thermally unstable in a thermally balanced medium buoyancy oscillations in a balanced medium with t_coolt_ff therefore grow until they saturate without condensing at an amplitude that depends on t_coolt_ff however in a medium with 10 t_coolt_ff 20 turbulence with a velocity dispersion roughly half the galaxys stellar velocity dispersion can drive those oscillations into condensation intriguingly this is indeed the gasphase velocity dispersion observed among galaxycluster cores that contain multiphase gas it is therefore possible that both the critical t_coolt_ff ratio for condensation of ambient gas and the level of turbulence in that gas are determined by coupling between condensation feedback and turbulence such a system can converge to a wellregulated equilibrium state as long as the fraction of feedback energy that goes into turbulence is significantly less than the fraction that goes more directly into heat
|
[['abundant', 'observational', 'evidence', 'indicates', 'that', 'the', 'cooling', 'time', 't_cool', 'of', 'the', 'hot', 'ambient', 'medium', 'pervading', 'a', 'massive', 'galaxy', 'does', 'not', 'drop', 'much', 'below', '10', 'times', 'the', 'freefall', 'time', 't_ff', 'at', 'any', 'radius', 'theoretical', 'models', 'have', 'accounted', 'for', 'this', 'finding', 'by', 'hypothesizing', 'that', 'cold', 'clouds', 'start', 'to', 'condense', 'out', 'of', 'the', 'ambient', 'medium', 'when', 't_coolt_ff', '10', 'and', 'fuel', 'a', 'strong', 'blackhole', 'feedback', 'response', 'that', 'reheats', 'the', 'ambient', 'gas', 'but', 'those', 'models', 'have', 'not', 'yet', 'been', 'able', 'to', 'provide', 'a', 'simple', 'explanation', 'for', 'the', 'origin', 'of', 'the', 'critical', 't_coolt_ff', 'ratio', 'this', 'paper', 'explores', 'a', 'heuristic', 'model', 'for', 'condensation', 'that', 'links', 'the', 'critical', 'ratio', 'to', 'turbulent', 'driving', 'of', 'gravitywave', 'oscillations', 'in', 'the', 'linear', 'regime', 'internal', 'gravity', 'waves', 'are', 'thermally', 'unstable', 'in', 'a', 'thermally', 'balanced', 'medium', 'buoyancy', 'oscillations', 'in', 'a', 'balanced', 'medium', 'with', 't_coolt_ff', 'therefore', 'grow', 'until', 'they', 'saturate', 'without', 'condensing', 'at', 'an', 'amplitude', 'that', 'depends', 'on', 't_coolt_ff', 'however', 'in', 'a', 'medium', 'with', '10', 't_coolt_ff', '20', 'turbulence', 'with', 'a', 'velocity', 'dispersion', 'roughly', 'half', 'the', 'galaxys', 'stellar', 'velocity', 'dispersion', 'can', 'drive', 'those', 'oscillations', 'into', 'condensation', 'intriguingly', 'this', 'is', 'indeed', 'the', 'gasphase', 'velocity', 'dispersion', 'observed', 'among', 'galaxycluster', 'cores', 'that', 'contain', 'multiphase', 'gas', 'it', 'is', 'therefore', 'possible', 'that', 'both', 'the', 'critical', 't_coolt_ff', 'ratio', 'for', 'condensation', 'of', 'ambient', 'gas', 'and', 'the', 'level', 'of', 'turbulence', 'in', 'that', 'gas', 'are', 'determined', 'by', 'coupling', 'between', 'condensation', 'feedback', 'and', 'turbulence', 'such', 'a', 'system', 'can', 'converge', 'to', 'a', 'wellregulated', 'equilibrium', 'state', 'as', 'long', 'as', 'the', 'fraction', 'of', 'feedback', 'energy', 'that', 'goes', 'into', 'turbulence', 'is', 'significantly', 'less', 'than', 'the', 'fraction', 'that', 'goes', 'more', 'directly', 'into', 'heat']]
|
[-0.1431380089474953, 0.24622292003816312, -0.0777163755394415, 0.0789713875985601, -0.046148391911715624, -0.10657716024157014, 0.06151054888485103, 0.349963089676633, -0.21097418810533117, -0.30909064671556863, 0.06866346358918467, -0.25586416746955365, -0.042336588982416, 0.18948394567373075, 0.03748675091524741, -0.03652099946824213, 0.007309599623863866, -0.0071300272791718486, -0.014414968973142095, -0.2217619448802286, 0.3003145845751056, 0.10695025985986585, 0.23291026312134427, 0.04797545660726933, 0.06724829117200219, -0.1479283686665382, 0.014248412346378678, 0.04421627989901777, -0.13994155893825727, -0.030296612880192697, 0.18753985554065453, 0.07646366163796287, 0.2719876493885374, -0.4423882153683475, -0.29053761628696634, 0.10494306057854186, 0.22780475234945438, 0.08929203149478232, -0.06497885791499616, -0.19337308320719454, 0.04367717584901829, -0.17291660880899087, -0.14535849433695336, -0.007156270837026929, 0.057599635194203566, -0.0013675927216931923, -0.2246720378364747, 0.15752893260131323, 0.06876180442290321, 0.024954297013455144, -0.099147747014834, -0.062214000520595746, -0.07011017286300009, 0.06401278493920848, 0.01955019628272451, 0.07103995907747294, 0.22760159767875893, -0.16498973648644066, 0.03644911666993894, 0.4161245740417923, -0.09265190563637012, -0.10439041571260618, 0.24633117279662411, -0.1943275663975833, -0.08819397793027632, 0.22006986567210998, 0.16685882072603803, 0.042654486323174624, -0.11490931199642503, -0.034470081010358485, -0.0561858478943736, 0.22437008836173586, 0.07036388922013372, 0.026731060410441834, 0.2859522275079692, 0.1650546318842172, 0.0616863177043371, 0.08747842389765004, -0.07213655075276389, -0.08593635596838477, -0.24877977214886673, -0.1309574912597854, -0.11949953255437624, 0.0812777771748693, -0.09230136000099712, -0.13406154937628242, 0.27249749101484044, 0.151387230282472, 0.21244950992949602, 0.047762870806590876, 0.34187417598404285, 0.12057926917369181, 0.08984966628024325, 0.16486158988638117, 0.3109958005278179, 0.1541325358825455, 0.13215429756036473, -0.25670313635390135, 0.08263365281856663, 0.005778169048772682]
|
1,803.06037
|
Anderson Localization for Radial Tree Graphs With Random Branching
Numbers
|
We prove Anderson localization for the discrete Laplace operator on radial
tree graphs with random branching numbers. Our method relies on the
representation of the Laplace operator as the direct sum of half-line Jacobi
matrices whose entries are non-degenerate, independent, identically distributed
random variables with singular distributions.
|
math.SP math-ph math.DS math.MP
|
we prove anderson localization for the discrete laplace operator on radial tree graphs with random branching numbers our method relies on the representation of the laplace operator as the direct sum of halfline jacobi matrices whose entries are nondegenerate independent identically distributed random variables with singular distributions
|
[['we', 'prove', 'anderson', 'localization', 'for', 'the', 'discrete', 'laplace', 'operator', 'on', 'radial', 'tree', 'graphs', 'with', 'random', 'branching', 'numbers', 'our', 'method', 'relies', 'on', 'the', 'representation', 'of', 'the', 'laplace', 'operator', 'as', 'the', 'direct', 'sum', 'of', 'halfline', 'jacobi', 'matrices', 'whose', 'entries', 'are', 'nondegenerate', 'independent', 'identically', 'distributed', 'random', 'variables', 'with', 'singular', 'distributions']]
|
[-0.1367661304179916, 0.16729558907211461, -0.0589395307915959, 0.009141846104188169, -0.11125249185777725, -0.13838597593155313, 0.053841153271199066, 0.3701392321827564, -0.29742861459863945, -0.13094438153735183, 0.12896880863155138, -0.29490942773508266, -0.14840833155656272, 0.13537403519087016, -0.055979148940520085, 0.16401159967434534, 0.10566232434691901, 0.09637869127649576, -0.06750183058110007, -0.2501457095780271, 0.38455710708946383, -0.06886250216593133, 0.23243746906518936, -0.02710177884139913, 0.11462637208441788, 0.12213188950765005, -0.10534405196580957, -0.11695406829660877, -0.018974221390771106, 0.10396631308732197, 0.1819697192156727, 0.05322510579788557, 0.2246097155767394, -0.36632269282052493, -0.12711114016302089, 0.20862695015966892, 0.18133414024487138, -0.015593806598731812, 0.03311807447004112, -0.36259211766275956, 0.08679598934472875, -0.10344929454174448, -0.15222386455044468, -0.055331357160305725, 0.029096358772763547, 0.12268157842311453, -0.37485238778939906, 0.11214086318269689, 0.06844972140413333, 0.0461133690848154, -0.03494354271567724, -0.26083426056627895, -0.0003089052575462042, 0.039032044602518384, 0.007186563130705915, -0.07740235403972737, 0.11689170631282825, 0.032359215034607876, -0.15865812700321066, 0.30789328337290345, -0.07345027282358484, -0.33924103423239704, 0.07945874444347747, -0.16460711311826365, -0.16975147696211934, 0.08802842487521628, 0.15600788381267736, 0.16220172383683792, -0.1298474604065748, 0.1819365202607785, -0.13192491098604303, 0.06716652755982223, 0.08662561346043615, 0.004543544585876008, 0.14314988826183564, 0.04247333083618829, 0.16471378141617837, 0.10222093406272062, 0.003305763449579319, -0.16394042388159544, -0.3102037589501669, -0.0975823021404683, -0.33982029551283477, 0.11724969723876169, -0.25058458421188606, -0.3620321174013488, 0.38738367464789686, 0.0885700177094166, 0.24065554853370216, 0.20956018735515944, 0.23671097021074372, 0.24272433794202639, -0.01595182423578932, 0.08179442919394438, 0.034364880047778185, 0.28267478399929846, 0.09262736625176796, -0.150828965255951, 0.03736112654664891, 0.22448317678843407]
|
1,803.06038
|
Optimality of multi-refraction dividend strategies in the dual model
|
We consider the multi-refraction strategies in two equivalent versions of the
optimal dividend problem in the dual (spectrally positive L\'evy) model. The
first problem is a variant of the bail-out case where both dividend payments
and capital injections must be absolutely continuous with respect to the
Lebesgue measure. The second is an extension of Avanzi et al. [4] where a
strategy is a combination of two absolutely continuous dividend payments with
different upper bounds and different transaction costs. In both problems, it is
shown to be optimal to refract the process at two thresholds, with the
optimally controlled process being the multi-refracted L\'evy process recently
studied by Czarna et al. [9]. The optimal strategy and the value function are
succinctly written in terms of a version of the scale function. Numerical
results are also given.
|
math.PR
|
we consider the multirefraction strategies in two equivalent versions of the optimal dividend problem in the dual spectrally positive levy model the first problem is a variant of the bailout case where both dividend payments and capital injections must be absolutely continuous with respect to the lebesgue measure the second is an extension of avanzi et al 4 where a strategy is a combination of two absolutely continuous dividend payments with different upper bounds and different transaction costs in both problems it is shown to be optimal to refract the process at two thresholds with the optimally controlled process being the multirefracted levy process recently studied by czarna et al 9 the optimal strategy and the value function are succinctly written in terms of a version of the scale function numerical results are also given
|
[['we', 'consider', 'the', 'multirefraction', 'strategies', 'in', 'two', 'equivalent', 'versions', 'of', 'the', 'optimal', 'dividend', 'problem', 'in', 'the', 'dual', 'spectrally', 'positive', 'levy', 'model', 'the', 'first', 'problem', 'is', 'a', 'variant', 'of', 'the', 'bailout', 'case', 'where', 'both', 'dividend', 'payments', 'and', 'capital', 'injections', 'must', 'be', 'absolutely', 'continuous', 'with', 'respect', 'to', 'the', 'lebesgue', 'measure', 'the', 'second', 'is', 'an', 'extension', 'of', 'avanzi', 'et', 'al', '4', 'where', 'a', 'strategy', 'is', 'a', 'combination', 'of', 'two', 'absolutely', 'continuous', 'dividend', 'payments', 'with', 'different', 'upper', 'bounds', 'and', 'different', 'transaction', 'costs', 'in', 'both', 'problems', 'it', 'is', 'shown', 'to', 'be', 'optimal', 'to', 'refract', 'the', 'process', 'at', 'two', 'thresholds', 'with', 'the', 'optimally', 'controlled', 'process', 'being', 'the', 'multirefracted', 'levy', 'process', 'recently', 'studied', 'by', 'czarna', 'et', 'al', '9', 'the', 'optimal', 'strategy', 'and', 'the', 'value', 'function', 'are', 'succinctly', 'written', 'in', 'terms', 'of', 'a', 'version', 'of', 'the', 'scale', 'function', 'numerical', 'results', 'are', 'also', 'given']]
|
[-0.06844657010030157, 0.10721444013401968, -0.05893535941317113, 0.0694724218670589, -0.05492202050200748, -0.13029377780692425, 0.06799359761961651, 0.39353199167685077, -0.3186011775467319, -0.2675042384975258, 0.17273470063016497, -0.2896035910217148, -0.13496157849405074, 0.16109382979762318, -0.14357417731574088, 0.09987819745120677, -0.017623687995541277, -0.01531773230597151, 0.02036755443127318, -0.31099264978635777, 0.3143714866530376, 0.06917099066600768, 0.2696569452095763, 0.023256335078919867, 0.1184293594278367, -0.015389588338703934, -0.03826576376123932, 0.010411244721829215, -0.15032230683771725, 0.07367509704922806, 0.2620895091853471, 0.10256309463698982, 0.3513469514225356, -0.3668071637882597, -0.133123395874546, 0.18639455098574134, 0.04487493597314989, 0.04781171510165388, -0.0021857541745923686, -0.24016685119061026, 0.06573606939866405, -0.18844617181633966, -0.08432246043406794, 0.017283082184748666, 0.027112846022866892, 0.0294326052888099, -0.3772940518560283, 0.044429469124941424, 0.038894456553724456, -0.0289519031381739, -0.10634519899383921, -0.11716598460704765, -0.03428174013088486, 0.08061492536216974, 0.045940756202705386, 0.011199445646277374, 0.09488278583078434, -0.07905012494037775, -0.20372785867728066, 0.3379167166933643, -0.08045204695681053, -0.25536914848524966, 0.11786840670692707, -0.1193410677369684, -0.10607669027663316, 0.11801836154578875, 0.14247601075013253, 0.13887511407885927, -0.17660029530772148, 0.12108378761022874, -0.06115042136022539, 0.12809948408429397, 0.08354522481165601, -0.011865699981254611, 0.1405839407393201, 0.1342305868694728, 0.16649718381196374, 0.16312853627217314, 0.01827692361830762, -0.14603179922613146, -0.29353406096131285, -0.1428429193505453, -0.1759001026670872, 0.014205307761475331, -0.07736205707877877, -0.14043211919995496, 0.3535168447644647, 0.09075500553819549, 0.18920811791736702, 0.10562806042391017, 0.2548106404684597, 0.19714964260206078, -0.04217046151742662, 0.08896636001582285, 0.19056286891414362, 0.05556614787818751, 0.09789540002009633, -0.1767143928536274, 0.10648488197616782, 0.07068863757321554]
|
1,803.06039
|
Generic asymptotics of resonance counting function for Schr\"odinger
point interactions
|
We study the leading coefficient in the asymptotical formula $ N (R) =
\frac{W}{\pi} R + O (1) $, $ R \to \infty $, for the resonance counting
function $ N (R)$ of Schr\"odinger Hamiltonians with point interactions. For
such Hamiltonians, the Weyl-type and non-Weyl-type asymptotics of $N (R)$ was
introduced recently in a paper by J. Lipovsk\'y and V. Lotoreichik (2017). In
this note, we prove that the Weyl-type asymptotics is generic.
|
math.SP math-ph math.MP
|
we study the leading coefficient in the asymptotical formula n r fracwpi r o 1 r to infty for the resonance counting function n r of schrodinger hamiltonians with point interactions for such hamiltonians the weyltype and nonweyltype asymptotics of n r was introduced recently in a paper by j lipovsky and v lotoreichik 2017 in this note we prove that the weyltype asymptotics is generic
|
[['we', 'study', 'the', 'leading', 'coefficient', 'in', 'the', 'asymptotical', 'formula', 'n', 'r', 'fracwpi', 'r', 'o', '1', 'r', 'to', 'infty', 'for', 'the', 'resonance', 'counting', 'function', 'n', 'r', 'of', 'schrodinger', 'hamiltonians', 'with', 'point', 'interactions', 'for', 'such', 'hamiltonians', 'the', 'weyltype', 'and', 'nonweyltype', 'asymptotics', 'of', 'n', 'r', 'was', 'introduced', 'recently', 'in', 'a', 'paper', 'by', 'j', 'lipovsky', 'and', 'v', 'lotoreichik', '2017', 'in', 'this', 'note', 'we', 'prove', 'that', 'the', 'weyltype', 'asymptotics', 'is', 'generic']]
|
[-0.17619844784419383, 0.07108306770603504, -0.06079918021925785, 0.02950298209344187, 0.013941435684119501, -0.19961123580804035, -0.014914949617964485, 0.2899533781042743, -0.2151453364039621, -0.2609766102546165, 0.035450780225331865, -0.33486673896831853, -0.16436281879507605, 0.10140251288671166, -0.026511394952033317, 0.05930569224179753, -0.002473682544434503, 0.05410828496960382, -0.05204447663404168, -0.25602448953976553, 0.30890860940299686, 0.02529141069540093, 0.15052864151385298, 0.0817319352420107, 0.013655152175605537, 0.06096390069222018, -0.007244974171983138, -0.024649624066847946, -0.2596115672613744, 0.104855046201978, 0.2594040700144345, 0.0590730034107823, 0.24062891854273696, -0.31898354307838506, -0.10791877693226261, 0.13064583258763438, 0.18830279375035916, 0.04801612327836694, 0.017869396176519652, -0.25496856519021094, 0.09772500688690812, -0.18490347228643875, -0.187989909997991, -0.05359137185939377, 0.20529401787526666, 0.04819678920396273, -0.36317788160616354, 0.05225663008769193, 0.14035177103904706, 0.08237482805270702, 0.0064457141974520295, -0.13958283284709097, 0.032543084133536584, 0.04175596137440974, 0.03972295180879413, 0.037986277309697, 0.0014350433954067768, -0.07746919519042657, -0.048029505257164276, 0.30847530229197395, -0.12990952745801018, -0.18337371182297507, 0.12013346715379626, -0.1892074552259498, -0.1516286168818272, 0.037642185857910064, 0.10621122762020077, 0.21805875742293504, -0.1097195944298179, 0.2959196296006051, -0.05508027347405591, 0.08827864408968092, 0.10553838100825105, 0.01676145551215497, 0.0765703839790677, 0.024397851989394235, 0.07210470369506267, 0.13169814585407655, -0.06408782543674592, -8.746344716318192e-05, -0.357658643125286, -0.18804050770197664, -0.26681887965288853, 0.14546112071407297, -0.11636576875096052, -0.12701411190585443, 0.38308911854701655, 0.11053916164523651, 0.2392550118027195, 0.11448575218298263, 0.1440909767951516, 0.17317513433555443, -0.024797963999932813, 0.1202744459057407, 0.15016062539671698, 0.14741574593579337, 0.09413523017428815, -0.20817486372505944, -0.042079471712631565, 0.19872298769112076]
|
1,803.0604
|
False discovery rate control for multiple testing based on p-values with
c\`adl\`ag distribution functions
|
For multiple testing based on p-values with c\`{a}dl\`{a}g distribution
functions, we propose an FDR procedure "BH+" with proven conservativeness. BH+
is at least as powerful as the BH procedure when they are applied to
super-uniform p-values. Further, when applied to mid p-values, BH+ is more
powerful than it is applied to conventional p-values. An easily verifiable
necessary and sufficient condition for this is provided. BH+ is perhaps the
first conservative FDR procedure applicable to mid p-values. BH+ is applied to
multiple testing based on discrete p-values in a methylation study, an HIV
study and a clinical safety study, where it makes considerably more discoveries
than the BH procedure.
|
stat.ME
|
for multiple testing based on pvalues with cadlag distribution functions we propose an fdr procedure bh with proven conservativeness bh is at least as powerful as the bh procedure when they are applied to superuniform pvalues further when applied to mid pvalues bh is more powerful than it is applied to conventional pvalues an easily verifiable necessary and sufficient condition for this is provided bh is perhaps the first conservative fdr procedure applicable to mid pvalues bh is applied to multiple testing based on discrete pvalues in a methylation study an hiv study and a clinical safety study where it makes considerably more discoveries than the bh procedure
|
[['for', 'multiple', 'testing', 'based', 'on', 'pvalues', 'with', 'cadlag', 'distribution', 'functions', 'we', 'propose', 'an', 'fdr', 'procedure', 'bh', 'with', 'proven', 'conservativeness', 'bh', 'is', 'at', 'least', 'as', 'powerful', 'as', 'the', 'bh', 'procedure', 'when', 'they', 'are', 'applied', 'to', 'superuniform', 'pvalues', 'further', 'when', 'applied', 'to', 'mid', 'pvalues', 'bh', 'is', 'more', 'powerful', 'than', 'it', 'is', 'applied', 'to', 'conventional', 'pvalues', 'an', 'easily', 'verifiable', 'necessary', 'and', 'sufficient', 'condition', 'for', 'this', 'is', 'provided', 'bh', 'is', 'perhaps', 'the', 'first', 'conservative', 'fdr', 'procedure', 'applicable', 'to', 'mid', 'pvalues', 'bh', 'is', 'applied', 'to', 'multiple', 'testing', 'based', 'on', 'discrete', 'pvalues', 'in', 'a', 'methylation', 'study', 'an', 'hiv', 'study', 'and', 'a', 'clinical', 'safety', 'study', 'where', 'it', 'makes', 'considerably', 'more', 'discoveries', 'than', 'the', 'bh', 'procedure']]
|
[-0.023743453468239615, 0.035039016419219804, -0.11268035241045823, 0.21623252444600286, -0.12275368083599154, -0.2365075619543128, 0.08591291647204241, 0.40922292917270525, -0.16730689438425492, -0.23269974842458685, 0.15695404973224886, -0.20704650743124642, -0.06595298056012001, 0.30885923086343525, -0.1258986792200741, 0.09338662205002854, 0.04320354619777161, 0.010019562833846729, 0.01653466760463769, -0.31285571416613656, 0.2648600221254698, 0.10377993664451848, 0.2866557940979984, -0.03779699980764362, 0.05921116552237317, 0.04341812935335753, -0.01457279571767235, 0.010780070638545206, -0.12526823904704756, 0.08036879747322648, 0.30311508840124046, 0.22242751571341096, 0.3644833978369971, -0.35709367854799207, -0.1307651858219755, 0.10713438441646154, 0.14627852342657258, 0.11623712556837039, -0.05721565454498708, -0.26208475785695506, 0.14755856383278548, -0.17728968798705141, -0.06364713656437522, -0.10607374048025878, 0.008125901603026786, -0.07380019013212871, -0.39365973454142844, 0.13164381402605604, 0.0462908519379725, 0.06868123162753235, 0.004696172801342523, -0.0773961429405853, -2.577958441400361e-05, 0.04719409878228608, 0.14958027122263737, 0.047715084224713045, 0.15861670885705084, -0.05055715747081858, -0.11942912418847886, 0.327426911366529, 0.04273779519967447, -0.21185758920325506, 0.22540736893000446, -0.15178965408111286, -0.16113382610535928, 0.10387638712162588, 0.1441520174843407, 0.19507244788980652, -0.2443507229008986, 0.038247588037286895, 0.052167220911550745, 0.18353164269127578, 0.03353768725940418, -0.0414359798985664, 0.21629151744576536, 0.13615473141789297, 0.11689990470795153, 0.1255676947081479, -0.09209794337125757, -0.027427062022316956, -0.25881883532579153, -0.1524128151631035, -0.16929512417431328, 0.053738851004462934, -0.11800127214437707, -0.16435772352025052, 0.3096541448313499, 0.192277334003805, 0.15814828314757515, 0.13127558244061527, 0.2592725592238881, 0.14268260708929553, 0.07436473314894067, 0.07539747825989099, 0.19581705018460194, 0.1515205844575278, 0.005263180576404122, -0.15674097560320013, 0.1271196179022299, 0.045594885201132467]
|
1,803.06041
|
Matroids and Codes with the Rank Metric
|
We study the relationship between a q-analogue of matroids and linear codes
with the rank metric in the vector space of matrices with entries in a finite
field. We prove a Greene type identity for the rank generating function of
these matroidal structures and the rank weight enumerator of these linear
codes. As an application, we give a combinatorial proof of a MacWilliams type
identity for Delsarte rank-metric codes.
|
math.CO
|
we study the relationship between a qanalogue of matroids and linear codes with the rank metric in the vector space of matrices with entries in a finite field we prove a greene type identity for the rank generating function of these matroidal structures and the rank weight enumerator of these linear codes as an application we give a combinatorial proof of a macwilliams type identity for delsarte rankmetric codes
|
[['we', 'study', 'the', 'relationship', 'between', 'a', 'qanalogue', 'of', 'matroids', 'and', 'linear', 'codes', 'with', 'the', 'rank', 'metric', 'in', 'the', 'vector', 'space', 'of', 'matrices', 'with', 'entries', 'in', 'a', 'finite', 'field', 'we', 'prove', 'a', 'greene', 'type', 'identity', 'for', 'the', 'rank', 'generating', 'function', 'of', 'these', 'matroidal', 'structures', 'and', 'the', 'rank', 'weight', 'enumerator', 'of', 'these', 'linear', 'codes', 'as', 'an', 'application', 'we', 'give', 'a', 'combinatorial', 'proof', 'of', 'a', 'macwilliams', 'type', 'identity', 'for', 'delsarte', 'rankmetric', 'codes']]
|
[-0.19823024809306514, 0.020378803809222332, -0.05112756848119307, 0.09730924530953601, -0.08034448304712988, -0.18839879584350233, 0.05034758719494161, 0.33140624811251956, -0.3812755702630333, -0.20757325004408325, 0.11599116788272733, -0.23702835692497698, -0.23624923082905402, 0.1546759360699334, -0.11249406840922176, 0.039275700874302696, 0.021331682252070015, 0.07883399903295103, -0.2042425562359985, -0.3397882486106423, 0.42912726147451263, 0.07600732352179677, 0.21024511049947012, 0.03090900721271401, 0.12523008927540935, 0.05968688757064334, -0.04435796937162893, -0.00815183489180197, -0.14685597263978442, 0.16266372764105166, 0.3077371703541797, 0.18621231783923786, 0.19997867245389067, -0.30810558432848123, -0.11939303657255959, 0.1616571270523296, 0.06624979325367705, 0.11931818706131932, -0.08706054306400103, -0.1774657011518012, 0.1234312207384062, -0.22242103854491227, -0.12859011128328848, -0.03630506935650888, 0.04497800301760435, 0.060729291509378, -0.3119895180174406, -0.025205807159722284, 0.11452013584852651, 0.14488028047903292, -0.07859460765198953, -0.197090907211321, 0.06327452020638663, 0.05904574493162226, -0.015892385626616684, 0.03317316610406598, -0.02065729484151023, -0.08690195893396394, -0.155495866154577, 0.3063704795811487, -0.01388772556801205, -0.2478428835562174, 0.11528844409959688, -0.08110155194889808, -0.15037949695724293, 0.05841879233501959, 0.1835858749455192, 0.11662362519427256, -0.04365103840288045, 0.1405790939208363, -0.17847133452153724, 0.1308719701525094, 0.11848691844151936, 0.06015659033226362, 0.1374209201860957, 0.008808237217042757, 0.06932621739426817, 0.21598972525933516, 0.007107098519370175, 0.007656114283895147, -0.31383682555262593, -0.21742118654799633, -0.18520282330396381, 0.09943704123514285, -0.20231188917355408, -0.25185314169072587, 0.45180624684966775, 0.024075800121046494, 0.16943477180556973, 0.18084912763341612, 0.18868368343058703, 0.04553066940296549, 0.08192755605188617, 0.12128838148993859, 0.09673039194034494, 0.3058866488551586, -0.004803737902176985, -0.11778929061593785, 0.016019023015531642, 0.30385334911229817]
|
1,803.06042
|
Stability Engineering of Halide Perovskite via Machine Learning
|
Perovskite stability is of the core importance and difficulty in current
research and application of perovskite solar cells. Nevertheless, over the past
century, the formability and stability of perovskite still relied on simplified
factor based on human knowledge, such as the commonly used tolerance factor t.
Combining machine learning (ML) with first-principles density functional
calculations, we proposed a strategy to firstly calculate the decomposition
energies, considered to be closely related to thermodynamic stability, of 354
kinds halide perovskites, establish the machine learning relationship between
decomposition energy and compositional ionic radius and investigate the
stabilities of 14,190 halide double perovskites. The ML-predicted results
enable us to rediscover a series of stable rare earth metal halide perovskites
(up to ~1000 kinds), indicating the generalization of this model and further
provide elemental and concentration suggestion for improving the stability of
mixed perovskite.
|
cond-mat.mtrl-sci
|
perovskite stability is of the core importance and difficulty in current research and application of perovskite solar cells nevertheless over the past century the formability and stability of perovskite still relied on simplified factor based on human knowledge such as the commonly used tolerance factor t combining machine learning ml with firstprinciples density functional calculations we proposed a strategy to firstly calculate the decomposition energies considered to be closely related to thermodynamic stability of 354 kinds halide perovskites establish the machine learning relationship between decomposition energy and compositional ionic radius and investigate the stabilities of 14190 halide double perovskites the mlpredicted results enable us to rediscover a series of stable rare earth metal halide perovskites up to 1000 kinds indicating the generalization of this model and further provide elemental and concentration suggestion for improving the stability of mixed perovskite
|
[['perovskite', 'stability', 'is', 'of', 'the', 'core', 'importance', 'and', 'difficulty', 'in', 'current', 'research', 'and', 'application', 'of', 'perovskite', 'solar', 'cells', 'nevertheless', 'over', 'the', 'past', 'century', 'the', 'formability', 'and', 'stability', 'of', 'perovskite', 'still', 'relied', 'on', 'simplified', 'factor', 'based', 'on', 'human', 'knowledge', 'such', 'as', 'the', 'commonly', 'used', 'tolerance', 'factor', 't', 'combining', 'machine', 'learning', 'ml', 'with', 'firstprinciples', 'density', 'functional', 'calculations', 'we', 'proposed', 'a', 'strategy', 'to', 'firstly', 'calculate', 'the', 'decomposition', 'energies', 'considered', 'to', 'be', 'closely', 'related', 'to', 'thermodynamic', 'stability', 'of', '354', 'kinds', 'halide', 'perovskites', 'establish', 'the', 'machine', 'learning', 'relationship', 'between', 'decomposition', 'energy', 'and', 'compositional', 'ionic', 'radius', 'and', 'investigate', 'the', 'stabilities', 'of', '14190', 'halide', 'double', 'perovskites', 'the', 'mlpredicted', 'results', 'enable', 'us', 'to', 'rediscover', 'a', 'series', 'of', 'stable', 'rare', 'earth', 'metal', 'halide', 'perovskites', 'up', 'to', '1000', 'kinds', 'indicating', 'the', 'generalization', 'of', 'this', 'model', 'and', 'further', 'provide', 'elemental', 'and', 'concentration', 'suggestion', 'for', 'improving', 'the', 'stability', 'of', 'mixed', 'perovskite']]
|
[-0.04605745768895114, 0.08227362646211456, -0.030442618068888014, 0.03182211298033269, -0.03511963351663664, -0.1205931862707447, 0.13850893755953242, 0.3770668404108852, -0.28111250583340763, -0.31765372539958814, 0.038474136269243474, -0.25174556856118413, -0.16969616603731674, 0.18812672227253988, -0.07147832639365845, 0.07277362117285494, 0.03381986325491138, -0.037972759783232286, -0.11711176585178333, -0.21674034720028404, 0.23677875399997417, 0.07622480821068378, 0.325348952509179, 0.06426302496901284, 0.03890316880369273, -0.06505901190234742, 0.05498705281243816, -0.0021071037495114507, -0.20756815770729342, 0.1960026824215502, 0.26083049427609156, 0.07507075771118385, 0.27416940253010413, -0.43750868249603, -0.22520526808543798, 0.030010977856828457, 0.10472844356847723, 0.0400530516516662, -0.08413414804801943, -0.22469665415340315, 0.10706367451242124, -0.16297410427568051, -0.11480947347684171, -0.14001855643909683, -0.02629209381195098, 0.04790068030982775, -0.2457783811718878, 0.040421051374317084, 0.042553450252833594, 0.09625299939428784, -0.14001158538553185, -0.21132479600581158, -0.015113231499958104, 0.07368409052749511, 0.08400241012028996, -0.0014909371618099891, 0.15975406567776834, -0.06425366266698569, -0.11867609758263141, 0.3917849398095732, -0.020040659399628367, -0.09120982390468138, 0.20267500787001294, -0.13918514631307907, -0.14324811047255775, 0.1267268405585672, 0.16291187293011777, 0.12578582921384895, -0.13757786554467938, 0.056459587356704456, 0.03514183882048632, 0.1850243323774886, 0.08963965676915255, 0.0764468175148333, 0.2262498276005669, 0.2561624921623781, 0.015392809620222254, 0.07434224865627033, -0.0732216613849856, -0.12018373733841861, -0.1564507449086565, -0.22475036660363953, -0.11951980685108225, 0.05820471390155161, -0.09269921211315485, -0.23264979452819284, 0.4103333199546285, 0.12657146651066675, 0.11280637545116844, -0.03327493897951922, 0.23509996218511658, 0.04639751008409245, 0.08688847990672573, -0.005786099409970054, 0.2713545132870276, 0.19407634873174295, 0.12246481097646629, -0.2494300288669969, 0.1132531750124682, 0.0906387371092654]
|
1,803.06043
|
Chiral kinetic approach to the chiral magnetic effect in isobaric
collisions
|
Based on the chiral kinetic approach using quarks and antiquarks from a
multiphase transport model as initial conditions, we study the chiral magnetic
effect, i.e., the magnetic field induced separation of charged particles in the
transverse plane, in non-central isobaric collisions of Zr$+$Zr and Ru$+$Ru,
which have the same atomic number but different proton numbers. For the
observable $\gamma^{OS}-\gamma^{SS}$ related to the difference between the
correlations of particles of opposite charges and of same charges, we find a
difference between the two collision systems if the magnetic field has a long
lifetime of 0.6 fm$/c$ and the observable is evaluated using the initial
reaction plane. This signal of the chiral magnetic effect becomes smaller and
comparable to the background contributions from elliptic flow if the event
plane determined from particle emission angles is used. For the other
observable given by the $R(\Delta S)$ correlator related to the distribution of
average charge separation in a collision, the signal due to the chiral magnetic
effect is found to depend less on whether the reaction or event plane is used
in the analysis, and their difference between the two isobaric collision
systems is thus a more robust observable.
|
nucl-th
|
based on the chiral kinetic approach using quarks and antiquarks from a multiphase transport model as initial conditions we study the chiral magnetic effect ie the magnetic field induced separation of charged particles in the transverse plane in noncentral isobaric collisions of zrzr and ruru which have the same atomic number but different proton numbers for the observable gammaosgammass related to the difference between the correlations of particles of opposite charges and of same charges we find a difference between the two collision systems if the magnetic field has a long lifetime of 06 fmc and the observable is evaluated using the initial reaction plane this signal of the chiral magnetic effect becomes smaller and comparable to the background contributions from elliptic flow if the event plane determined from particle emission angles is used for the other observable given by the rdelta s correlator related to the distribution of average charge separation in a collision the signal due to the chiral magnetic effect is found to depend less on whether the reaction or event plane is used in the analysis and their difference between the two isobaric collision systems is thus a more robust observable
|
[['based', 'on', 'the', 'chiral', 'kinetic', 'approach', 'using', 'quarks', 'and', 'antiquarks', 'from', 'a', 'multiphase', 'transport', 'model', 'as', 'initial', 'conditions', 'we', 'study', 'the', 'chiral', 'magnetic', 'effect', 'ie', 'the', 'magnetic', 'field', 'induced', 'separation', 'of', 'charged', 'particles', 'in', 'the', 'transverse', 'plane', 'in', 'noncentral', 'isobaric', 'collisions', 'of', 'zrzr', 'and', 'ruru', 'which', 'have', 'the', 'same', 'atomic', 'number', 'but', 'different', 'proton', 'numbers', 'for', 'the', 'observable', 'gammaosgammass', 'related', 'to', 'the', 'difference', 'between', 'the', 'correlations', 'of', 'particles', 'of', 'opposite', 'charges', 'and', 'of', 'same', 'charges', 'we', 'find', 'a', 'difference', 'between', 'the', 'two', 'collision', 'systems', 'if', 'the', 'magnetic', 'field', 'has', 'a', 'long', 'lifetime', 'of', '06', 'fmc', 'and', 'the', 'observable', 'is', 'evaluated', 'using', 'the', 'initial', 'reaction', 'plane', 'this', 'signal', 'of', 'the', 'chiral', 'magnetic', 'effect', 'becomes', 'smaller', 'and', 'comparable', 'to', 'the', 'background', 'contributions', 'from', 'elliptic', 'flow', 'if', 'the', 'event', 'plane', 'determined', 'from', 'particle', 'emission', 'angles', 'is', 'used', 'for', 'the', 'other', 'observable', 'given', 'by', 'the', 'rdelta', 's', 'correlator', 'related', 'to', 'the', 'distribution', 'of', 'average', 'charge', 'separation', 'in', 'a', 'collision', 'the', 'signal', 'due', 'to', 'the', 'chiral', 'magnetic', 'effect', 'is', 'found', 'to', 'depend', 'less', 'on', 'whether', 'the', 'reaction', 'or', 'event', 'plane', 'is', 'used', 'in', 'the', 'analysis', 'and', 'their', 'difference', 'between', 'the', 'two', 'isobaric', 'collision', 'systems', 'is', 'thus', 'a', 'more', 'robust', 'observable']]
|
[-0.14734164526003182, 0.21914225519567573, -0.11123172939333767, 0.09072700212709606, -0.016995269717581418, -0.06925303448014412, -0.030492629788662354, 0.3415096721314278, -0.24704315893582462, -0.3149092305624454, 0.023003276017465695, -0.2974139311850148, -0.027446690491957533, 0.1616610574335599, 0.06708310595917583, 0.027351859260888137, 0.024665003087966868, 0.07884729422446456, -0.08029593936330878, -0.15934975704504656, 0.324862401005956, 0.026337278243538337, 0.26802114574910746, 0.09980513871474594, 0.09109090513924194, 0.019616973669191382, 0.0013014714608026534, 0.038087898322870746, -0.09922943758771073, 0.05551685323622486, 0.17286788755259716, 0.026362747083581294, 0.1542583834907981, -0.4143167175160548, -0.15725433776219921, 0.12857871360779194, 0.13973341359920108, 0.11359789903958559, -0.05095231717912367, -0.2529196848651183, 0.0677621611453996, -0.1584495585159754, -0.11349047019300003, 0.01682533641566628, 0.057715263199685236, 0.03710101785728727, -0.29201295046788667, 0.1236233915023496, 0.03741733198589405, 0.08539672134943384, -0.04966771299590731, -0.13077074895401666, -0.08670978334050664, 0.10202546443276529, 0.10126372337996595, 0.06475635605639797, 0.17160772048561, -0.12333591530980427, -0.09615990301334904, 0.40559488128313853, -0.03361327693912863, -0.19767192857548205, 0.17488395979930407, -0.18344409543223986, -0.07046635923955168, 0.1613192632290314, 0.1914725814773173, 0.12807667117158417, -0.15381293284428335, 0.02552859689956339, 0.003521656305481171, 0.1616441455175236, 0.08577481609260298, 0.022379576612609562, 0.23861095310937727, 0.14464546930640168, 0.05138493477086028, 0.12599919594316647, -0.1347265773039964, -0.10361010538529336, -0.2974514057763766, -0.11518323952368144, -0.18567406916606827, 0.04431244690804118, -0.07316268957895107, -0.13864894219453341, 0.3657710177574268, 0.15780611425522983, 0.22116089528234503, -0.046091500191454846, 0.28435449549669073, 0.11339659377699718, 0.06993386031190875, 0.06099465936086304, 0.2764051148641528, 0.1811294745253015, 0.13371409063909165, -0.29456584133836683, 0.06073134613809051, 0.044503915560498986]
|
1,803.06044
|
Optimal Boundary Kernels and Weightings for Local Polynomial Regression
|
Kernel smoothers are considered near the boundary of the interval. Kernels
which minimize the expected mean square error are derived. These kernels are
equivalent to using a linear weighting function in the local polynomial
regression. It is shown that any kernel estimator that satisfies the moment
conditions up to order $m$ is equivalent to a local polynomial regression of
order $m$ with some non-negative weight function if and only if the kernel has
at most $m$ sign changes. A fast algorithm is proposed for computing the kernel
estimate in the boundary region for an arbitrary placement of data points.
|
stat.ME eess.SP math.ST physics.data-an stat.TH
|
kernel smoothers are considered near the boundary of the interval kernels which minimize the expected mean square error are derived these kernels are equivalent to using a linear weighting function in the local polynomial regression it is shown that any kernel estimator that satisfies the moment conditions up to order m is equivalent to a local polynomial regression of order m with some nonnegative weight function if and only if the kernel has at most m sign changes a fast algorithm is proposed for computing the kernel estimate in the boundary region for an arbitrary placement of data points
|
[['kernel', 'smoothers', 'are', 'considered', 'near', 'the', 'boundary', 'of', 'the', 'interval', 'kernels', 'which', 'minimize', 'the', 'expected', 'mean', 'square', 'error', 'are', 'derived', 'these', 'kernels', 'are', 'equivalent', 'to', 'using', 'a', 'linear', 'weighting', 'function', 'in', 'the', 'local', 'polynomial', 'regression', 'it', 'is', 'shown', 'that', 'any', 'kernel', 'estimator', 'that', 'satisfies', 'the', 'moment', 'conditions', 'up', 'to', 'order', 'm', 'is', 'equivalent', 'to', 'a', 'local', 'polynomial', 'regression', 'of', 'order', 'm', 'with', 'some', 'nonnegative', 'weight', 'function', 'if', 'and', 'only', 'if', 'the', 'kernel', 'has', 'at', 'most', 'm', 'sign', 'changes', 'a', 'fast', 'algorithm', 'is', 'proposed', 'for', 'computing', 'the', 'kernel', 'estimate', 'in', 'the', 'boundary', 'region', 'for', 'an', 'arbitrary', 'placement', 'of', 'data', 'points']]
|
[-0.10458067725436065, 0.028797592860887608, -0.07790091355811014, 0.08011047637932041, -0.08275141932700544, -0.16074800650786722, -0.013823590090267849, 0.4168382646642964, -0.3053072372209187, -0.2456193438194918, 0.1644071755963707, -0.27249719428293634, -0.13864979284610882, 0.1687546934146961, -0.04923804546265411, 0.11777312456362063, 0.0611926193367878, 0.09673331166156615, -0.12365368027898549, -0.3167012993462685, 0.31410503714825166, 0.047458510591902515, 0.21345484498511963, 0.0186041707815038, 0.1574997701835019, -0.023635327895971562, -0.015875556336885147, 0.006205521265251769, -0.11484578964044692, 0.07592601762007689, 0.24558630252416913, 0.07807852647201431, 0.31969136365623485, -0.34175098622499994, -0.15984960170368653, 0.18929239835195016, 0.09304175009913367, -0.004372483529761961, 0.04625015738279079, -0.21784249301811662, 0.15778836357228535, -0.09308592532996578, -0.11146111280252838, -0.05970071221353731, 0.03319454057179768, 0.03290936786850745, -0.39406167967903494, 0.049078297065194655, 0.06468155582181433, 0.008215235828450232, -0.049776166651604906, -0.16274344986963152, 0.016767824661325325, 0.07281724307356835, -0.007850149183091943, 0.08534295990536309, 0.10007632513427073, -0.10390806275259967, -0.0502207240212069, 0.31485384306635217, -0.0835413488046727, -0.27161111965342755, 0.13699569167202394, -0.14282947516238148, -0.07427196363410489, 0.1457264299194018, 0.14521281120621346, 0.095309705454668, -0.14471684651204733, 0.12847776931059085, -0.06167447111378847, 0.1279186246672062, 0.06772758418016812, -0.02372915370888406, 0.1182786671614105, 0.07583053276469612, 0.18825725080313707, 0.11884955846412916, -0.10552080832139561, -0.058565133919168, -0.3433603818406059, -0.1410339359814922, -0.2755877049169456, -0.015354377576244074, -0.17211270579263319, -0.21875701313268045, 0.3562553568620874, 0.10782069758973037, 0.21500738554944596, 0.11680827669051448, 0.2512368942149962, 0.21644134754597238, 0.10694759454803937, 0.17112114084320088, 0.14344930056761246, 0.13966807412134127, 0.028997514434535094, -0.21727269375461597, 0.11687426940176984, 0.12685673767606717]
|
1,803.06045
|
Decoy-state quantum key distribution with a leaky source
|
In recent years, there has been a great effort to prove the security of
quantum key distribution (QKD) with a minimum number of assumptions. Besides
its intrinsic theoretical interest, this would allow for larger tolerance
against device imperfections in the actual implementations. However, even in
this device-independent scenario, one assumption seems unavoidable, that is,
the presence of a protected space devoid of any unwanted information leakage in
which the legitimate parties can privately generate, process and store their
classical data. In this paper we relax this unrealistic and hardly feasible
assumption and introduce a general formalism to tackle the information leakage
problem in most of existing QKD systems. More specifically, we prove the
security of optical QKD systems using phase and intensity modulators in their
transmitters, which leak the setting information in an arbitrary manner. We
apply our security proof to cases of practical interest and show key rates
similar to those obtained in a perfectly shielded environment. Our work
constitutes a fundamental step forward in guaranteeing implementation security
of quantum communication systems.
|
quant-ph
|
in recent years there has been a great effort to prove the security of quantum key distribution qkd with a minimum number of assumptions besides its intrinsic theoretical interest this would allow for larger tolerance against device imperfections in the actual implementations however even in this deviceindependent scenario one assumption seems unavoidable that is the presence of a protected space devoid of any unwanted information leakage in which the legitimate parties can privately generate process and store their classical data in this paper we relax this unrealistic and hardly feasible assumption and introduce a general formalism to tackle the information leakage problem in most of existing qkd systems more specifically we prove the security of optical qkd systems using phase and intensity modulators in their transmitters which leak the setting information in an arbitrary manner we apply our security proof to cases of practical interest and show key rates similar to those obtained in a perfectly shielded environment our work constitutes a fundamental step forward in guaranteeing implementation security of quantum communication systems
|
[['in', 'recent', 'years', 'there', 'has', 'been', 'a', 'great', 'effort', 'to', 'prove', 'the', 'security', 'of', 'quantum', 'key', 'distribution', 'qkd', 'with', 'a', 'minimum', 'number', 'of', 'assumptions', 'besides', 'its', 'intrinsic', 'theoretical', 'interest', 'this', 'would', 'allow', 'for', 'larger', 'tolerance', 'against', 'device', 'imperfections', 'in', 'the', 'actual', 'implementations', 'however', 'even', 'in', 'this', 'deviceindependent', 'scenario', 'one', 'assumption', 'seems', 'unavoidable', 'that', 'is', 'the', 'presence', 'of', 'a', 'protected', 'space', 'devoid', 'of', 'any', 'unwanted', 'information', 'leakage', 'in', 'which', 'the', 'legitimate', 'parties', 'can', 'privately', 'generate', 'process', 'and', 'store', 'their', 'classical', 'data', 'in', 'this', 'paper', 'we', 'relax', 'this', 'unrealistic', 'and', 'hardly', 'feasible', 'assumption', 'and', 'introduce', 'a', 'general', 'formalism', 'to', 'tackle', 'the', 'information', 'leakage', 'problem', 'in', 'most', 'of', 'existing', 'qkd', 'systems', 'more', 'specifically', 'we', 'prove', 'the', 'security', 'of', 'optical', 'qkd', 'systems', 'using', 'phase', 'and', 'intensity', 'modulators', 'in', 'their', 'transmitters', 'which', 'leak', 'the', 'setting', 'information', 'in', 'an', 'arbitrary', 'manner', 'we', 'apply', 'our', 'security', 'proof', 'to', 'cases', 'of', 'practical', 'interest', 'and', 'show', 'key', 'rates', 'similar', 'to', 'those', 'obtained', 'in', 'a', 'perfectly', 'shielded', 'environment', 'our', 'work', 'constitutes', 'a', 'fundamental', 'step', 'forward', 'in', 'guaranteeing', 'implementation', 'security', 'of', 'quantum', 'communication', 'systems']]
|
[-0.18170448572224862, 0.04837767643972793, -0.08335815347203543, 0.060891785184875744, -0.039935587146292535, -0.22158115262682468, 0.08304564612096639, 0.36632303653871695, -0.2535245921227252, -0.2993651749270112, 0.10681849508815461, -0.23816608971070952, -0.1167812768727907, 0.20996971698639366, -0.18112402675253464, 0.11268939843133491, 0.041875734634568236, -0.002501295369409154, -0.023988172129291847, -0.2685741557042529, 0.30746949586823497, 0.043865241818237685, 0.32789538229137355, 0.05741590760497516, 0.057407144511608416, 0.02274180859774136, -0.01774790309012243, -0.0552319311060021, -0.09622361994574063, 0.13974990111215826, 0.3183507359306721, 0.16673937216643353, 0.3280635641597082, -0.4424700623410458, -0.23111999053185042, 0.14896484147326622, 0.14714209264887207, 0.17835025538588103, -0.0878780622139063, -0.28688096930272877, 0.08100219142375611, -0.19534298668567068, -0.1257680463725755, -0.06280829086213378, -0.014531537247121851, -0.03872745941262531, -0.24079645362499605, 0.01202772879929987, 0.08579391099827505, 0.0427612634617943, 0.021099192023040416, -0.04426574875194192, 0.028789229596819663, 0.14997547716198414, 0.014329067653285964, -0.0035648926429052144, 0.14415961448264691, -0.12362590115456815, -0.11660607092451261, 0.3712633504300793, 0.0002103850724595475, -0.19826215277614362, 0.16725309653437462, -0.10624942857492177, -0.16679678602154888, 0.0958995984145844, 0.17255289465016713, 0.07063603636975578, -0.1602558881102259, 0.05204574057308828, -0.02382094843442299, 0.2119205418107439, 0.04980757146686143, 0.1587025123013108, 0.18867509814673722, 0.13966301270905948, 0.09958833588672145, 0.13415478519567778, -0.04805219022697107, -0.13251438355504003, -0.29060192787858274, -0.16891109705699497, -0.21067564168977254, 0.06808441797960442, -0.05944780885829722, -0.1057559207130245, 0.3417874696762759, 0.26066782763544094, 0.13460070390060458, 0.025288749659821565, 0.4162750399450777, 0.05042944764691497, 0.0650401200531885, 0.1121615631548914, 0.2482281409128639, 0.08811230717140729, 0.11844419310073977, -0.13068661284148478, 0.16849311280287693, -0.066076038270715]
|
1,803.06046
|
Robustness to incorrect system models in stochastic control
|
In stochastic control applications, typically only an ideal model (controlled
transition kernel) is assumed and the control design is based on the given
model, raising the problem of performance loss due to the mismatch between the
assumed model and the actual model. Toward this end, we study continuity
properties of discrete-time stochastic control problems with respect to system
models (i.e., controlled transition kernels) and robustness of optimal control
policies designed for incorrect models applied to the true system. We study
both fully observed and partially observed setups under an infinite horizon
discounted expected cost criterion. We show that continuity and robustness
cannot be established under weak and setwise convergences of transition kernels
in general, but that the expected induced cost is robust under total variation.
By imposing further assumptions on the measurement models and on the kernel
itself (such as continuous convergence), we show that the optimal cost can be
made continuous under weak convergence of transition kernels as well. Using
these continuity properties, we establish convergence results and error bounds
due to mismatch that occurs by the application of a control policy which is
designed for an incorrectly estimated system model to a true model, thus
establishing positive and negative results on robustness.Compared to the
existing literature, we obtain strictly refined robustness results that are
applicable even when the incorrect models can be investigated under weak
convergence and setwise convergence criteria (with respect to a true model), in
addition to the total variation criteria. These entail positive implications on
empirical learning in (data-driven) stochastic control since often system
models are learned through empirical training data where typically weak
convergence criterion applies but stronger convergence criteria do not.
|
cs.SY
|
in stochastic control applications typically only an ideal model controlled transition kernel is assumed and the control design is based on the given model raising the problem of performance loss due to the mismatch between the assumed model and the actual model toward this end we study continuity properties of discretetime stochastic control problems with respect to system models ie controlled transition kernels and robustness of optimal control policies designed for incorrect models applied to the true system we study both fully observed and partially observed setups under an infinite horizon discounted expected cost criterion we show that continuity and robustness cannot be established under weak and setwise convergences of transition kernels in general but that the expected induced cost is robust under total variation by imposing further assumptions on the measurement models and on the kernel itself such as continuous convergence we show that the optimal cost can be made continuous under weak convergence of transition kernels as well using these continuity properties we establish convergence results and error bounds due to mismatch that occurs by the application of a control policy which is designed for an incorrectly estimated system model to a true model thus establishing positive and negative results on robustnesscompared to the existing literature we obtain strictly refined robustness results that are applicable even when the incorrect models can be investigated under weak convergence and setwise convergence criteria with respect to a true model in addition to the total variation criteria these entail positive implications on empirical learning in datadriven stochastic control since often system models are learned through empirical training data where typically weak convergence criterion applies but stronger convergence criteria do not
|
[['in', 'stochastic', 'control', 'applications', 'typically', 'only', 'an', 'ideal', 'model', 'controlled', 'transition', 'kernel', 'is', 'assumed', 'and', 'the', 'control', 'design', 'is', 'based', 'on', 'the', 'given', 'model', 'raising', 'the', 'problem', 'of', 'performance', 'loss', 'due', 'to', 'the', 'mismatch', 'between', 'the', 'assumed', 'model', 'and', 'the', 'actual', 'model', 'toward', 'this', 'end', 'we', 'study', 'continuity', 'properties', 'of', 'discretetime', 'stochastic', 'control', 'problems', 'with', 'respect', 'to', 'system', 'models', 'ie', 'controlled', 'transition', 'kernels', 'and', 'robustness', 'of', 'optimal', 'control', 'policies', 'designed', 'for', 'incorrect', 'models', 'applied', 'to', 'the', 'true', 'system', 'we', 'study', 'both', 'fully', 'observed', 'and', 'partially', 'observed', 'setups', 'under', 'an', 'infinite', 'horizon', 'discounted', 'expected', 'cost', 'criterion', 'we', 'show', 'that', 'continuity', 'and', 'robustness', 'can', 'not', 'be', 'established', 'under', 'weak', 'and', 'setwise', 'convergences', 'of', 'transition', 'kernels', 'in', 'general', 'but', 'that', 'the', 'expected', 'induced', 'cost', 'is', 'robust', 'under', 'total', 'variation', 'by', 'imposing', 'further', 'assumptions', 'on', 'the', 'measurement', 'models', 'and', 'on', 'the', 'kernel', 'itself', 'such', 'as', 'continuous', 'convergence', 'we', 'show', 'that', 'the', 'optimal', 'cost', 'can', 'be', 'made', 'continuous', 'under', 'weak', 'convergence', 'of', 'transition', 'kernels', 'as', 'well', 'using', 'these', 'continuity', 'properties', 'we', 'establish', 'convergence', 'results', 'and', 'error', 'bounds', 'due', 'to', 'mismatch', 'that', 'occurs', 'by', 'the', 'application', 'of', 'a', 'control', 'policy', 'which', 'is', 'designed', 'for', 'an', 'incorrectly', 'estimated', 'system', 'model', 'to', 'a', 'true', 'model', 'thus', 'establishing', 'positive', 'and', 'negative', 'results', 'on', 'robustnesscompared', 'to', 'the', 'existing', 'literature', 'we', 'obtain', 'strictly', 'refined', 'robustness', 'results', 'that', 'are', 'applicable', 'even', 'when', 'the', 'incorrect', 'models', 'can', 'be', 'investigated', 'under', 'weak', 'convergence', 'and', 'setwise', 'convergence', 'criteria', 'with', 'respect', 'to', 'a', 'true', 'model', 'in', 'addition', 'to', 'the', 'total', 'variation', 'criteria', 'these', 'entail', 'positive', 'implications', 'on', 'empirical', 'learning', 'in', 'datadriven', 'stochastic', 'control', 'since', 'often', 'system', 'models', 'are', 'learned', 'through', 'empirical', 'training', 'data', 'where', 'typically', 'weak', 'convergence', 'criterion', 'applies', 'but', 'stronger', 'convergence', 'criteria', 'do', 'not']]
|
[-0.0766299419229006, 0.05023336623728957, -0.07330684572887078, 0.11575917130062244, -0.05775036546485431, -0.16618004694359925, 0.08124317742466236, 0.41852349550094753, -0.29542049745486365, -0.2891791445398268, 0.16119292408911337, -0.21451657946328734, -0.1549273659408146, 0.208238933023933, -0.11737476152044607, 0.12107365516185252, 0.06882309144121601, 0.019109556926732628, -0.09823812983436811, -0.26429776263129295, 0.3127871773087607, 0.06420419847914319, 0.32572705886768943, 0.049993847109663814, 0.11187690273533439, -0.025076414771686248, 0.019520871370122934, 0.04960913900218958, -0.12932062808315042, 0.08316761663848561, 0.20621417194862462, 0.11728709680698277, 0.3167076743502679, -0.402330702019976, -0.20441222393536845, 0.1507777001913101, 0.10712003225610146, 0.06759517728945696, -0.03787656933807922, -0.28611460625589324, 0.11809495176865364, -0.13216519702256074, -0.09227991631763766, -0.12093289537780764, -0.04285718136711596, 0.04375180448137438, -0.34632011985560385, 0.07643138346883717, 0.10315706453951103, 0.03704919820323104, -0.10988481749827378, -0.08482963783899322, -0.02007378454959998, 0.11508871077381078, 0.06948607176811963, 0.008106147389684758, 0.12127473356249147, -0.11300181505092748, -0.11096658596681873, 0.3567470504279188, -0.08028703815682302, -0.24797886013716675, 0.21999388732763156, -0.09590064084807264, -0.10600695983722819, 0.10892961224668371, 0.20952550426004923, 0.1054190370847183, -0.16148751148001983, 0.06069097002899516, -0.009194455361630258, 0.17325103433095856, 0.011317237118249023, 0.037050255384378256, 0.1305156245295012, 0.13960162280780672, 0.14361846460181912, 0.14509697187911358, -0.016635617305752453, -0.12907034859962413, -0.3161204621805508, -0.08001719153546494, -0.16809518232090706, 0.028182914530922885, -0.08862310188469434, -0.14716150742752826, 0.32666070767881, 0.2027024593532568, 0.1843710999253077, 0.11394098001279325, 0.28613046250178764, 0.16781482595545005, 0.031662777101472056, 0.08184323025358131, 0.2472256123785117, 0.11290452800768179, 0.07200182657420849, -0.20683487308573434, 0.17216336991966252, 0.04957733656407046]
|
1,803.06047
|
A Family of Second-Order Energy-Stable Schemes for Cahn-Hilliard Type
Equations
|
We focus on the numerical approximation of the Cahn-Hilliard type equations,
and present a family of second-order unconditionally energy-stable schemes. By
reformulating the equation into an equivalent system employing a scalar
auxiliary variable, we approximate the system at the time step $(n+\theta)$
($n$ denoting the time step index and $\theta$ is a real-valued parameter), and
devise a family of corresponding approximations that are second-order accurate
and unconditionally energy stable. This family of approximations contains the
often-used Crank-Nicolson scheme and the second-order backward differentiation
formula as particular cases. We further develop an efficient solution algorithm
for the resultant discrete system of equations to overcome the difficulty
caused by the unknown scalar auxiliary variable. The final algorithm requires
only the solution of four de-coupled individual Helmholtz type equations within
each time step, which involve only constant and time-independent coefficient
matrices that can be pre-computed. A number of numerical examples are presented
to demonstrate the performance of the family of schemes developed herein. We
note that this family of second-order approximations can be readily applied to
devise energy-stable schemes for other types of gradient flows when combined
with the auxiliary variable approaches.
|
physics.flu-dyn math.NA physics.comp-ph
|
we focus on the numerical approximation of the cahnhilliard type equations and present a family of secondorder unconditionally energystable schemes by reformulating the equation into an equivalent system employing a scalar auxiliary variable we approximate the system at the time step ntheta n denoting the time step index and theta is a realvalued parameter and devise a family of corresponding approximations that are secondorder accurate and unconditionally energy stable this family of approximations contains the oftenused cranknicolson scheme and the secondorder backward differentiation formula as particular cases we further develop an efficient solution algorithm for the resultant discrete system of equations to overcome the difficulty caused by the unknown scalar auxiliary variable the final algorithm requires only the solution of four decoupled individual helmholtz type equations within each time step which involve only constant and timeindependent coefficient matrices that can be precomputed a number of numerical examples are presented to demonstrate the performance of the family of schemes developed herein we note that this family of secondorder approximations can be readily applied to devise energystable schemes for other types of gradient flows when combined with the auxiliary variable approaches
|
[['we', 'focus', 'on', 'the', 'numerical', 'approximation', 'of', 'the', 'cahnhilliard', 'type', 'equations', 'and', 'present', 'a', 'family', 'of', 'secondorder', 'unconditionally', 'energystable', 'schemes', 'by', 'reformulating', 'the', 'equation', 'into', 'an', 'equivalent', 'system', 'employing', 'a', 'scalar', 'auxiliary', 'variable', 'we', 'approximate', 'the', 'system', 'at', 'the', 'time', 'step', 'ntheta', 'n', 'denoting', 'the', 'time', 'step', 'index', 'and', 'theta', 'is', 'a', 'realvalued', 'parameter', 'and', 'devise', 'a', 'family', 'of', 'corresponding', 'approximations', 'that', 'are', 'secondorder', 'accurate', 'and', 'unconditionally', 'energy', 'stable', 'this', 'family', 'of', 'approximations', 'contains', 'the', 'oftenused', 'cranknicolson', 'scheme', 'and', 'the', 'secondorder', 'backward', 'differentiation', 'formula', 'as', 'particular', 'cases', 'we', 'further', 'develop', 'an', 'efficient', 'solution', 'algorithm', 'for', 'the', 'resultant', 'discrete', 'system', 'of', 'equations', 'to', 'overcome', 'the', 'difficulty', 'caused', 'by', 'the', 'unknown', 'scalar', 'auxiliary', 'variable', 'the', 'final', 'algorithm', 'requires', 'only', 'the', 'solution', 'of', 'four', 'decoupled', 'individual', 'helmholtz', 'type', 'equations', 'within', 'each', 'time', 'step', 'which', 'involve', 'only', 'constant', 'and', 'timeindependent', 'coefficient', 'matrices', 'that', 'can', 'be', 'precomputed', 'a', 'number', 'of', 'numerical', 'examples', 'are', 'presented', 'to', 'demonstrate', 'the', 'performance', 'of', 'the', 'family', 'of', 'schemes', 'developed', 'herein', 'we', 'note', 'that', 'this', 'family', 'of', 'secondorder', 'approximations', 'can', 'be', 'readily', 'applied', 'to', 'devise', 'energystable', 'schemes', 'for', 'other', 'types', 'of', 'gradient', 'flows', 'when', 'combined', 'with', 'the', 'auxiliary', 'variable', 'approaches']]
|
[-0.1377916027737594, 0.06052611618861433, -0.07677207847505256, 0.03325253762933056, -0.06794062333437738, -0.18465188472093177, 0.04327502959930195, 0.35364468880589045, -0.3029997776430002, -0.27155684928099316, 0.12149990442154741, -0.226413179427264, -0.13958562395865562, 0.1982828659798812, -0.021192130946835117, 0.10842040684271269, 0.05278549832076317, 0.012329553819394537, -0.08677593164919585, -0.264101834263081, 0.3406122020647797, -0.014896644796762202, 0.2291919151863093, -0.028458199239577407, 0.17489723764143136, -0.026669971910970553, -0.03566513549063414, 0.024193278018073115, -0.11732350009065903, 0.11137546909968098, 0.23974474309450852, 0.07716427871306973, 0.3166556184687627, -0.40688176299248224, -0.20852450445471776, 0.09547738375224754, 0.16265428404289264, 0.13636567943455977, -0.03803059973485433, -0.24450163281074277, 0.08410613210108032, -0.15514597798101407, -0.16114313881006584, -0.12189847661832733, -0.025402682572209016, 0.04700397805522674, -0.325963622432143, 0.09346959371213362, 0.05084891703531698, -0.013506367428735806, -0.06437358715714364, -0.11995012587535062, 0.018386065385861215, 0.06103294484133132, 0.017792971427774147, -0.0061824935871526284, 0.04069903277282026, -0.060476536062889774, -0.08338303817312909, 0.35381715666846414, -0.09149266607386784, -0.29476772623245046, 0.12438053568016993, -0.04557518893113685, -0.11699929239632434, 0.15375623897595145, 0.18875915042208458, 0.21703556648864553, -0.14044875655455388, 0.09828650648397684, -0.0027196345328496245, 0.19556190790460695, 0.05240998612889261, 0.00952750605422629, 0.09135037487762039, 0.10437976651975611, 0.0899744609379451, 0.12460741898070814, -0.04329347677427842, -0.1517262996091857, -0.3477118510220732, -0.17392093748266613, -0.16668758227455396, 0.003758334468498274, -0.1265331776549352, -0.17378188303743228, 0.3818265020277525, 0.13133437312134202, 0.13524972212318548, 0.07579082452689628, 0.3022170343273689, 0.21316965789966552, 0.0028621427475834494, 0.08577021212124872, 0.17539687114570626, 0.11774053002298666, 0.08001547762828451, -0.2281190321421024, 0.07251918394852765, 0.18542530118591255]
|
1,803.06048
|
Identifying and Estimating Principal Causal Effects in Multi-site Trials
|
Randomized trials are often conducted with separate randomizations across
multiple sites such as schools, voting districts, or hospitals. These sites can
differ in important ways, including the site's implementation, local
conditions, and the composition of individuals. An important question in
practice is whether---and under what assumptions---researchers can leverage
this cross-site variation to learn more about the intervention. We address
these questions in the principal stratification framework, which describes
causal effects for subgroups defined by post-treatment quantities. We show that
researchers can estimate certain principal causal effects via the multi-site
design if they are willing to impose the strong assumption that the
site-specific effects are uncorrelated with the site-specific distribution of
stratum membership. We motivate this approach with a multi-site trial of the
Early College High School Initiative, a unique secondary education program with
the goal of increasing high school graduation rates and college enrollment. Our
analyses corroborate previous studies suggesting that the initiative had
positive effects for students who would have otherwise attended a low-quality
high school, although power is limited.
|
stat.ME
|
randomized trials are often conducted with separate randomizations across multiple sites such as schools voting districts or hospitals these sites can differ in important ways including the sites implementation local conditions and the composition of individuals an important question in practice is whetherand under what assumptionsresearchers can leverage this crosssite variation to learn more about the intervention we address these questions in the principal stratification framework which describes causal effects for subgroups defined by posttreatment quantities we show that researchers can estimate certain principal causal effects via the multisite design if they are willing to impose the strong assumption that the sitespecific effects are uncorrelated with the sitespecific distribution of stratum membership we motivate this approach with a multisite trial of the early college high school initiative a unique secondary education program with the goal of increasing high school graduation rates and college enrollment our analyses corroborate previous studies suggesting that the initiative had positive effects for students who would have otherwise attended a lowquality high school although power is limited
|
[['randomized', 'trials', 'are', 'often', 'conducted', 'with', 'separate', 'randomizations', 'across', 'multiple', 'sites', 'such', 'as', 'schools', 'voting', 'districts', 'or', 'hospitals', 'these', 'sites', 'can', 'differ', 'in', 'important', 'ways', 'including', 'the', 'sites', 'implementation', 'local', 'conditions', 'and', 'the', 'composition', 'of', 'individuals', 'an', 'important', 'question', 'in', 'practice', 'is', 'whetherand', 'under', 'what', 'assumptionsresearchers', 'can', 'leverage', 'this', 'crosssite', 'variation', 'to', 'learn', 'more', 'about', 'the', 'intervention', 'we', 'address', 'these', 'questions', 'in', 'the', 'principal', 'stratification', 'framework', 'which', 'describes', 'causal', 'effects', 'for', 'subgroups', 'defined', 'by', 'posttreatment', 'quantities', 'we', 'show', 'that', 'researchers', 'can', 'estimate', 'certain', 'principal', 'causal', 'effects', 'via', 'the', 'multisite', 'design', 'if', 'they', 'are', 'willing', 'to', 'impose', 'the', 'strong', 'assumption', 'that', 'the', 'sitespecific', 'effects', 'are', 'uncorrelated', 'with', 'the', 'sitespecific', 'distribution', 'of', 'stratum', 'membership', 'we', 'motivate', 'this', 'approach', 'with', 'a', 'multisite', 'trial', 'of', 'the', 'early', 'college', 'high', 'school', 'initiative', 'a', 'unique', 'secondary', 'education', 'program', 'with', 'the', 'goal', 'of', 'increasing', 'high', 'school', 'graduation', 'rates', 'and', 'college', 'enrollment', 'our', 'analyses', 'corroborate', 'previous', 'studies', 'suggesting', 'that', 'the', 'initiative', 'had', 'positive', 'effects', 'for', 'students', 'who', 'would', 'have', 'otherwise', 'attended', 'a', 'lowquality', 'high', 'school', 'although', 'power', 'is', 'limited']]
|
[-0.08283589862096923, 0.13012057603772567, -0.10304092396995791, 0.12061567732116439, -0.11670172909831286, -0.17441689416755146, 0.10478147235561229, 0.39386229084793634, -0.23318888178679364, -0.3497091015007281, 0.1089161899668914, -0.28294297490687764, -0.15544271958921624, 0.14918597023135063, -0.13126151278868495, -0.01564376365349314, 0.09760614347605574, 0.020082356358641352, 0.0015887892095526382, -0.34212489963919696, 0.3085547131968431, 0.11407838299589441, 0.3187396396006617, 0.035031821860824354, 0.04831028937709314, 0.008487188891017225, -0.059595166994864945, 0.018776797064023434, -0.10118094169786689, 0.11595596797867973, 0.37114173041232285, 0.18936998486937678, 0.40895052814095684, -0.44306826675255623, -0.1844384165965682, 0.10715666713920483, 0.0951144892678282, 0.0948320126116893, -0.018333063703791525, -0.2799695774750266, 0.05167660540170946, -0.1633076952830971, -0.10367335747519629, -0.07876379613781116, -0.034883320750393104, 0.020825367454665344, -0.27314531667565806, 0.050750543355126174, 0.007682089992804376, 0.14837059029515767, -0.05482801936632959, -0.15102403222434443, -0.007888488021001396, 0.220351838403431, 0.08485329380367755, -0.00045549056627760095, 0.1488490178023834, -0.12521389309460154, -0.15009440511972064, 0.3579077802563345, 0.027738072449264264, -0.1476825477800624, 0.21447122684740544, -0.16608848417530486, -0.17768615513720368, 0.06207038886492422, 0.22353577655402546, 0.07537427391118463, -0.16522546793119267, 0.006372778579322677, -0.029746095407423536, 0.1663109355781106, 0.05570662985610936, -0.025223884329243877, 0.2224270630567252, 0.11962909725930035, 0.03119513737699072, 0.08033012244960613, -0.046881800418245724, -0.06249428812700968, -0.24117160532051785, -0.12524101573191362, -0.10330346079967563, 0.03733087419229146, -0.05212974408899776, -0.13771285059472296, 0.3562716578475073, 0.15471160128029318, 0.09367341618742463, 0.004553395689061441, 0.2421728633785036, 0.02959994918159788, 0.07450001174308492, 0.08034125587368417, 0.1716307384794104, 0.03324785979172579, 0.08423980256024549, -0.16923585324134877, 0.1739436835050583, -0.016087445453534]
|
1,803.06049
|
Zero-Shot Object Detection: Learning to Simultaneously Recognize and
Localize Novel Concepts
|
Current Zero-Shot Learning (ZSL) approaches are restricted to recognition of
a single dominant unseen object category in a test image. We hypothesize that
this setting is ill-suited for real-world applications where unseen objects
appear only as a part of a complex scene, warranting both the `recognition' and
`localization' of an unseen category. To address this limitation, we introduce
a new \emph{`Zero-Shot Detection'} (ZSD) problem setting, which aims at
simultaneously recognizing and locating object instances belonging to novel
categories without any training examples. We also propose a new experimental
protocol for ZSD based on the highly challenging ILSVRC dataset, adhering to
practical issues, e.g., the rarity of unseen objects. To the best of our
knowledge, this is the first end-to-end deep network for ZSD that jointly
models the interplay between visual and semantic domain information. To
overcome the noise in the automatically derived semantic descriptions, we
utilize the concept of meta-classes to design an original loss function that
achieves synergy between max-margin class separation and semantic space
clustering. Furthermore, we present a baseline approach extended from
recognition to detection setting. Our extensive experiments show significant
performance boost over the baseline on the imperative yet difficult ZSD
problem.
|
cs.CV
|
current zeroshot learning zsl approaches are restricted to recognition of a single dominant unseen object category in a test image we hypothesize that this setting is illsuited for realworld applications where unseen objects appear only as a part of a complex scene warranting both the recognition and localization of an unseen category to address this limitation we introduce a new emphzeroshot detection zsd problem setting which aims at simultaneously recognizing and locating object instances belonging to novel categories without any training examples we also propose a new experimental protocol for zsd based on the highly challenging ilsvrc dataset adhering to practical issues eg the rarity of unseen objects to the best of our knowledge this is the first endtoend deep network for zsd that jointly models the interplay between visual and semantic domain information to overcome the noise in the automatically derived semantic descriptions we utilize the concept of metaclasses to design an original loss function that achieves synergy between maxmargin class separation and semantic space clustering furthermore we present a baseline approach extended from recognition to detection setting our extensive experiments show significant performance boost over the baseline on the imperative yet difficult zsd problem
|
[['current', 'zeroshot', 'learning', 'zsl', 'approaches', 'are', 'restricted', 'to', 'recognition', 'of', 'a', 'single', 'dominant', 'unseen', 'object', 'category', 'in', 'a', 'test', 'image', 'we', 'hypothesize', 'that', 'this', 'setting', 'is', 'illsuited', 'for', 'realworld', 'applications', 'where', 'unseen', 'objects', 'appear', 'only', 'as', 'a', 'part', 'of', 'a', 'complex', 'scene', 'warranting', 'both', 'the', 'recognition', 'and', 'localization', 'of', 'an', 'unseen', 'category', 'to', 'address', 'this', 'limitation', 'we', 'introduce', 'a', 'new', 'emphzeroshot', 'detection', 'zsd', 'problem', 'setting', 'which', 'aims', 'at', 'simultaneously', 'recognizing', 'and', 'locating', 'object', 'instances', 'belonging', 'to', 'novel', 'categories', 'without', 'any', 'training', 'examples', 'we', 'also', 'propose', 'a', 'new', 'experimental', 'protocol', 'for', 'zsd', 'based', 'on', 'the', 'highly', 'challenging', 'ilsvrc', 'dataset', 'adhering', 'to', 'practical', 'issues', 'eg', 'the', 'rarity', 'of', 'unseen', 'objects', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'endtoend', 'deep', 'network', 'for', 'zsd', 'that', 'jointly', 'models', 'the', 'interplay', 'between', 'visual', 'and', 'semantic', 'domain', 'information', 'to', 'overcome', 'the', 'noise', 'in', 'the', 'automatically', 'derived', 'semantic', 'descriptions', 'we', 'utilize', 'the', 'concept', 'of', 'metaclasses', 'to', 'design', 'an', 'original', 'loss', 'function', 'that', 'achieves', 'synergy', 'between', 'maxmargin', 'class', 'separation', 'and', 'semantic', 'space', 'clustering', 'furthermore', 'we', 'present', 'a', 'baseline', 'approach', 'extended', 'from', 'recognition', 'to', 'detection', 'setting', 'our', 'extensive', 'experiments', 'show', 'significant', 'performance', 'boost', 'over', 'the', 'baseline', 'on', 'the', 'imperative', 'yet', 'difficult', 'zsd', 'problem']]
|
[-0.062094155393349816, -0.04201882640720727, -0.051866208353581335, 0.0914176199495649, -0.16426326670469, -0.1608198545419444, 0.05456883960033361, 0.43896372879926976, -0.2880422657594467, -0.35975584586222586, 0.05329040771183104, -0.2284265886610135, -0.18790549048676322, 0.18549218526444375, -0.1896926441683601, 0.05720539933595902, 0.14191363307360846, 0.053455117276798074, -0.07996405667673127, -0.2565741928748022, 0.35009446722956805, 0.03331793728694976, 0.32441230255107467, 0.049406608031728326, 0.1457487728088521, -0.03608517786487937, -0.021401228567059987, -0.024868434307744536, -0.03817520569827115, 0.20039727456796055, 0.3468699922721918, 0.2054491890188402, 0.300462701686252, -0.3375780641363981, -0.2266384590524607, 0.11006194928613229, 0.12802732762043328, 0.1101520592185597, -0.05863755196213531, -0.39523712571423786, 0.09509415372680777, -0.18813942994635838, 0.03398526152954079, -0.11750791685428852, 0.006357475475240976, -0.06625260249592173, -0.27803130238197554, 0.021202787645728305, 0.1225197767600035, 0.05215178654194833, -0.09514254605015501, -0.07437692824512337, 0.09147079447523142, 0.1865570984195727, 0.016033209771968614, 0.05004287983577412, 0.10899385617425045, -0.22159150457487276, -0.1547619681685972, 0.39201611800071523, -0.043894409785906856, -0.21692876218674847, 0.26375695172554026, -0.026628883846868307, -0.17517212187775816, 0.09353963303355835, 0.24278564038089454, 0.1679495950933928, -0.17285601929224167, 0.002261545051796696, -0.09007914651853915, 0.18973901772346252, 0.049298351926681326, 0.0013620844994408961, 0.20309595119070786, 0.27641042452633907, 0.05772733255170095, 0.18379484166641935, -0.16860189100560277, -0.03213771254015275, -0.25071345118519206, -0.1023205695560393, -0.17906116789732224, -0.027680502810443822, -0.07573992417235739, -0.13377462760187112, 0.3819334106269078, 0.2780596372384865, 0.22080994121348246, 0.12195619755985741, 0.35561676071479154, -0.009771588873953964, 0.09568478382067182, 0.058256147782772015, 0.1900341406243686, -0.012269177219758813, 0.11211092636916034, -0.17410256643242275, 0.08338596923246933, 0.05320702993000547]
|
1,803.0605
|
Sufficient Conditions for a Linear Estimator to be a Local Polynomial
Regression
|
It is shown that any linear estimator that satisfies the moment conditions up
to order $p$ is equivalent to a local polynomial regression of order $p$ with
some non-negative weight function if and only if the kernel has at most $p$
sign changes. If the data points are placed symmetrically about the estimation
point, a linear weighting function is equivalent to the standard quadratic
weighting function.
|
stat.ME math.ST stat.TH
|
it is shown that any linear estimator that satisfies the moment conditions up to order p is equivalent to a local polynomial regression of order p with some nonnegative weight function if and only if the kernel has at most p sign changes if the data points are placed symmetrically about the estimation point a linear weighting function is equivalent to the standard quadratic weighting function
|
[['it', 'is', 'shown', 'that', 'any', 'linear', 'estimator', 'that', 'satisfies', 'the', 'moment', 'conditions', 'up', 'to', 'order', 'p', 'is', 'equivalent', 'to', 'a', 'local', 'polynomial', 'regression', 'of', 'order', 'p', 'with', 'some', 'nonnegative', 'weight', 'function', 'if', 'and', 'only', 'if', 'the', 'kernel', 'has', 'at', 'most', 'p', 'sign', 'changes', 'if', 'the', 'data', 'points', 'are', 'placed', 'symmetrically', 'about', 'the', 'estimation', 'point', 'a', 'linear', 'weighting', 'function', 'is', 'equivalent', 'to', 'the', 'standard', 'quadratic', 'weighting', 'function']]
|
[-0.09601609953361648, 0.05908007819600629, -0.10734018145100863, 0.03994568149827308, -0.1119323234659422, -0.2038422413593666, -0.006127985966017921, 0.3768678809142192, -0.35936990712776384, -0.22891830670943653, 0.10648882551344507, -0.32378608806792536, -0.1393319983035326, 0.12330346918580207, -0.03676617638010419, 0.09345457969748443, 0.03209825968863725, 0.12458382421314265, -0.12706359326980557, -0.3477486548028096, 0.3177440892904997, 0.018037555457064598, 0.22155184688215906, 0.014793877892026847, 0.15786944679866516, 0.02829774274406108, 0.040279245004057884, 0.009396737977636583, -0.11751387164699598, 0.03430391451845274, 0.2562149573879486, 0.09499273158496979, 0.3291311983273111, -0.3109247130482937, -0.12855109675420504, 0.22883693079435916, 0.06300300536818351, -0.003405817008266846, 0.023690665673436313, -0.1833035292273218, 0.19020606725032188, -0.06950643712259603, -0.117075236295491, -0.0408194311188929, 0.07071524730770651, 0.01783131877186172, -0.3951948503963649, 0.04543570900392352, 0.08708380277014592, 0.01593960127369924, -0.017750339250955167, -0.1653662778606469, -0.030308397472694967, 0.030680683116908327, 0.038959433885545215, 0.11966540197362051, 0.10919425716962326, -0.09672112127935345, -0.046568786478460286, 0.35208683230942395, -0.06794437629551711, -0.2839296191232279, 0.13384330261385802, -0.19163923895438062, -0.08862610181059802, 0.13301968721277785, 0.10308569390326738, 0.07392469456306461, -0.11704335292575485, 0.1473839792385909, -0.07952471640468999, 0.1955673537718901, 0.08548161441770692, -0.050745183122203205, 0.1455665726609754, 0.04964976150994048, 0.18589276319482562, 0.10032496501155423, -0.07977652071029738, -0.03811299188457655, -0.3518500091564475, -0.09156863035803492, -0.2322259209203449, 0.03233287280432485, -0.13514731956313358, -0.18398420514219624, 0.3607245810104139, 0.10052279018176098, 0.20839187879623336, 0.0811492324185868, 0.2543934090839078, 0.24510848934225965, 0.09261264509493203, 0.11361698698337105, 0.15231399107803803, 0.13639753530239404, -0.0165125784591179, -0.1865751639812846, 0.1399682418246591, 0.07823302623265507]
|
1,803.06051
|
Deep Multiple Instance Learning for Zero-shot Image Tagging
|
In-line with the success of deep learning on traditional recognition problem,
several end-to-end deep models for zero-shot recognition have been proposed in
the literature. These models are successful to predict a single unseen label
given an input image, but does not scale to cases where multiple unseen objects
are present. In this paper, we model this problem within the framework of
Multiple Instance Learning (MIL). To the best of our knowledge, we propose the
first end-to-end trainable deep MIL framework for the multi-label zero-shot
tagging problem. Due to its novel design, the proposed framework has several
interesting features: (1) Unlike previous deep MIL models, it does not use any
off-line procedure (e.g., Selective Search or EdgeBoxes) for bag generation.
(2) During test time, it can process any number of unseen labels given their
semantic embedding vectors. (3) Using only seen labels per image as weak
annotation, it can produce a bounding box for each predicted labels. We
experiment with the NUS-WIDE dataset and achieve superior performance across
conventional, zero-shot and generalized zero-shot tagging tasks.
|
cs.CV
|
inline with the success of deep learning on traditional recognition problem several endtoend deep models for zeroshot recognition have been proposed in the literature these models are successful to predict a single unseen label given an input image but does not scale to cases where multiple unseen objects are present in this paper we model this problem within the framework of multiple instance learning mil to the best of our knowledge we propose the first endtoend trainable deep mil framework for the multilabel zeroshot tagging problem due to its novel design the proposed framework has several interesting features 1 unlike previous deep mil models it does not use any offline procedure eg selective search or edgeboxes for bag generation 2 during test time it can process any number of unseen labels given their semantic embedding vectors 3 using only seen labels per image as weak annotation it can produce a bounding box for each predicted labels we experiment with the nuswide dataset and achieve superior performance across conventional zeroshot and generalized zeroshot tagging tasks
|
[['inline', 'with', 'the', 'success', 'of', 'deep', 'learning', 'on', 'traditional', 'recognition', 'problem', 'several', 'endtoend', 'deep', 'models', 'for', 'zeroshot', 'recognition', 'have', 'been', 'proposed', 'in', 'the', 'literature', 'these', 'models', 'are', 'successful', 'to', 'predict', 'a', 'single', 'unseen', 'label', 'given', 'an', 'input', 'image', 'but', 'does', 'not', 'scale', 'to', 'cases', 'where', 'multiple', 'unseen', 'objects', 'are', 'present', 'in', 'this', 'paper', 'we', 'model', 'this', 'problem', 'within', 'the', 'framework', 'of', 'multiple', 'instance', 'learning', 'mil', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'we', 'propose', 'the', 'first', 'endtoend', 'trainable', 'deep', 'mil', 'framework', 'for', 'the', 'multilabel', 'zeroshot', 'tagging', 'problem', 'due', 'to', 'its', 'novel', 'design', 'the', 'proposed', 'framework', 'has', 'several', 'interesting', 'features', '1', 'unlike', 'previous', 'deep', 'mil', 'models', 'it', 'does', 'not', 'use', 'any', 'offline', 'procedure', 'eg', 'selective', 'search', 'or', 'edgeboxes', 'for', 'bag', 'generation', '2', 'during', 'test', 'time', 'it', 'can', 'process', 'any', 'number', 'of', 'unseen', 'labels', 'given', 'their', 'semantic', 'embedding', 'vectors', '3', 'using', 'only', 'seen', 'labels', 'per', 'image', 'as', 'weak', 'annotation', 'it', 'can', 'produce', 'a', 'bounding', 'box', 'for', 'each', 'predicted', 'labels', 'we', 'experiment', 'with', 'the', 'nuswide', 'dataset', 'and', 'achieve', 'superior', 'performance', 'across', 'conventional', 'zeroshot', 'and', 'generalized', 'zeroshot', 'tagging', 'tasks']]
|
[-0.0034133232808832466, -0.018870370154688537, -0.025663395595586933, 0.08002233145470691, -0.14940536720410588, -0.21730487220070924, 0.03812607533857761, 0.47525333196203084, -0.26480006122688665, -0.40504906751950076, 0.029705317170444834, -0.24575769534366654, -0.14403635898642456, 0.16683203282086287, -0.14945049210981434, 0.12587776963148084, 0.16239427983655122, 0.10762313183332825, -0.0740338753127418, -0.3110410550785861, 0.29867781825823947, 0.022672630210899502, 0.3340195628477196, 0.026824089789484768, 0.15046216744993782, -0.027877837644311888, -0.0065239402224663, -0.036995450803406965, -0.021286343192232066, 0.16250343162542338, 0.34645880687723507, 0.2469989626960101, 0.3150381452133665, -0.36470642476075, -0.2921366773481513, 0.12576797060218864, 0.1601876917460916, 0.12899346259989958, -0.050022811455593244, -0.3547231340593519, 0.0992770580074418, -0.19922977964789873, 0.07780332086827263, -0.1290960249266234, -0.03747392977031226, -0.05578433181662327, -0.2955630009394439, 0.027281597513577033, 0.12723777259147362, 0.030404449354900026, -0.0889563468122994, -0.12780290656393908, 0.09252893007173064, 0.17227405501963122, 0.025411768553306176, 0.08712843535253885, 0.10473423029648023, -0.21332567761084814, -0.17120565325637274, 0.37609176110775994, -0.0574144866510198, -0.22906513029211684, 0.23662391895877904, -0.024698338178976643, -0.18280127688428793, 0.08392916378918393, 0.2348960828913868, 0.18754816275416478, -0.16172132840187387, -0.00043123257252783784, -0.10879306805095282, 0.190120712864673, 0.06227024101877007, -0.027728061598522223, 0.181193803459802, 0.27876685496055703, -0.022173758196756887, 0.13795712976662936, -0.17478685786588996, -0.037607553500639296, -0.2331860437340253, -0.0947905430348119, -0.18242218124883613, -0.04964375125907292, -0.09747897824469884, -0.1490865306067013, 0.3670943650716766, 0.2655726883937765, 0.23902689287674495, 0.12312522458950266, 0.3570141506504439, 0.02449799827085915, 0.162792818009286, 0.0633976715355951, 0.19699085490836965, -0.04935200355315431, 0.12348772148366204, -0.13097483092308815, 0.10661573146721455, 0.07828959081878607]
|
1,803.06052
|
Revealing weak spin-orbit coupling effects on charge carriers in a
$\pi$-conjugated polymer
|
We measure electrically detected magnetic resonance (EDMR) on organic
light-emitting diodes (OLEDs) made of the polymer
poly[2-methoxy-5-(2-ethylhexyloxy)-1,4-phenylenevinylene] (MEH-PPV) at room
temperature and high magnetic fields, where spectral broadening of the
resonance due to spin-orbit coupling (SOC) exceeds that due to the local
hyperfine fields. Density-functional-theory calculations on an open-shell model
of the material reveal g-tensors of charge-carrier spins in the lowest
unoccupied (electron) and highest occupied (hole) molecular orbitals. These
tensors are used for simulations of magnetic resonance line-shapes. Besides
providing the first quantification and direct observation of SOC effects on
charge-carrier states in these weakly SO-coupled hydrocarbons, this procedure
demonstrates that spin-related phenomena in these materials are fundamentally
monomolecular in nature.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
we measure electrically detected magnetic resonance edmr on organic lightemitting diodes oleds made of the polymer poly2methoxy52ethylhexyloxy14phenylenevinylene mehppv at room temperature and high magnetic fields where spectral broadening of the resonance due to spinorbit coupling soc exceeds that due to the local hyperfine fields densityfunctionaltheory calculations on an openshell model of the material reveal gtensors of chargecarrier spins in the lowest unoccupied electron and highest occupied hole molecular orbitals these tensors are used for simulations of magnetic resonance lineshapes besides providing the first quantification and direct observation of soc effects on chargecarrier states in these weakly socoupled hydrocarbons this procedure demonstrates that spinrelated phenomena in these materials are fundamentally monomolecular in nature
|
[['we', 'measure', 'electrically', 'detected', 'magnetic', 'resonance', 'edmr', 'on', 'organic', 'lightemitting', 'diodes', 'oleds', 'made', 'of', 'the', 'polymer', 'poly2methoxy52ethylhexyloxy14phenylenevinylene', 'mehppv', 'at', 'room', 'temperature', 'and', 'high', 'magnetic', 'fields', 'where', 'spectral', 'broadening', 'of', 'the', 'resonance', 'due', 'to', 'spinorbit', 'coupling', 'soc', 'exceeds', 'that', 'due', 'to', 'the', 'local', 'hyperfine', 'fields', 'densityfunctionaltheory', 'calculations', 'on', 'an', 'openshell', 'model', 'of', 'the', 'material', 'reveal', 'gtensors', 'of', 'chargecarrier', 'spins', 'in', 'the', 'lowest', 'unoccupied', 'electron', 'and', 'highest', 'occupied', 'hole', 'molecular', 'orbitals', 'these', 'tensors', 'are', 'used', 'for', 'simulations', 'of', 'magnetic', 'resonance', 'lineshapes', 'besides', 'providing', 'the', 'first', 'quantification', 'and', 'direct', 'observation', 'of', 'soc', 'effects', 'on', 'chargecarrier', 'states', 'in', 'these', 'weakly', 'socoupled', 'hydrocarbons', 'this', 'procedure', 'demonstrates', 'that', 'spinrelated', 'phenomena', 'in', 'these', 'materials', 'are', 'fundamentally', 'monomolecular', 'in', 'nature']]
|
[-0.1573314228901706, 0.18481657329032583, 0.032461320785971894, 0.014637386008741617, 0.008429328206277984, -0.14701771529092053, 0.06652234446456921, 0.43638830211213125, -0.21655444128555246, -0.3238106041182099, -0.07096434378763661, -0.2985983446872394, -0.09576657656413902, 0.19400917273430554, 0.07251544629980344, -0.009594022082248037, -0.004073632831153061, -0.10458923543046694, -0.01653430297821095, -0.14260596357592345, 0.26175408814002105, 0.06257659711159899, 0.2939957572671119, 0.1556415000263119, 0.058914829710764546, -0.028050223581625948, 0.11773955008123137, -0.04130970282962413, -0.11726822755281319, 0.10033771887589994, 0.28890534269157797, -0.1107584973516558, 0.1886274241873512, -0.482044743307467, -0.20300900210194023, -0.019895970921165178, 0.13575782559096947, 0.1733914040419872, -0.06763274212010272, -0.31274770882113706, -0.00045855225679198545, -0.1281742567038496, -0.09018026778358035, -0.14062283096427564, -0.004561096583659362, 0.003947165865351313, -0.23848511313242074, 0.11040651097365688, 0.03471599333404031, 0.10735732233654614, -0.1402088691704973, -0.1814376506372355, -0.061875163652335426, 0.02785746125508532, 0.030683712830068544, -0.022258896763170406, 0.260113057734478, -0.11161741301475558, -0.12494416352378071, 0.3484860107502235, -0.060204873582863784, -0.0990412411566857, 0.22191808519086667, -0.22300577059442211, -0.09380806438691382, 0.20912342414417903, 0.14410138688046054, 0.12213922983417953, -0.13332661600517376, 0.07642144331319807, 0.025258339085017463, 0.17806270510274252, 0.033742769430058876, 0.1438696497602255, 0.270346335018985, 0.1444990553760103, -0.015412320108485542, 0.07828794710388008, -0.1533558676206407, -0.03956421558645421, -0.15641659578042372, -0.17243115949271928, -0.2569148281555889, 0.08625172226623233, -0.024889157829680437, -0.19196291330237208, 0.39991868634076255, 0.1539311895924454, 0.13812114131204517, -0.12324288536910899, 0.25087093769772245, 0.08803370294689168, 0.08624702433735365, -0.021010063796503737, 0.30111723365761073, 0.24664219818493752, 0.08692991142743267, -0.328732366141464, 0.05220514957077934, -0.027905746394286064]
|
1,803.06053
|
The world of research has gone berserk: modeling the consequences of
requiring "greater statistical stringency" for scientific publication
|
In response to growing concern about the reliability and reproducibility of
published science, researchers have proposed adopting measures of greater
statistical stringency, including suggestions to require larger sample sizes
and to lower the highly criticized p<0.05 significance threshold. While pros
and cons are vigorously debated, there has been little to no modeling of how
adopting these measures might affect what type of science is published. In this
paper, we develop a novel optimality model that, given current incentives to
publish, predicts a researcher's most rational use of resources in terms of the
number of studies to undertake, the statistical power to devote to each study,
and the desirable pre-study odds to pursue. We then develop a methodology that
allows one to estimate the reliability of published research by considering a
distribution of preferred research strategies. Using this approach, we
investigate the merits of adopting measures of `greater statistical stringency'
with the goal of informing the ongoing debate.
|
stat.ME stat.AP
|
in response to growing concern about the reliability and reproducibility of published science researchers have proposed adopting measures of greater statistical stringency including suggestions to require larger sample sizes and to lower the highly criticized p005 significance threshold while pros and cons are vigorously debated there has been little to no modeling of how adopting these measures might affect what type of science is published in this paper we develop a novel optimality model that given current incentives to publish predicts a researchers most rational use of resources in terms of the number of studies to undertake the statistical power to devote to each study and the desirable prestudy odds to pursue we then develop a methodology that allows one to estimate the reliability of published research by considering a distribution of preferred research strategies using this approach we investigate the merits of adopting measures of greater statistical stringency with the goal of informing the ongoing debate
|
[['in', 'response', 'to', 'growing', 'concern', 'about', 'the', 'reliability', 'and', 'reproducibility', 'of', 'published', 'science', 'researchers', 'have', 'proposed', 'adopting', 'measures', 'of', 'greater', 'statistical', 'stringency', 'including', 'suggestions', 'to', 'require', 'larger', 'sample', 'sizes', 'and', 'to', 'lower', 'the', 'highly', 'criticized', 'p005', 'significance', 'threshold', 'while', 'pros', 'and', 'cons', 'are', 'vigorously', 'debated', 'there', 'has', 'been', 'little', 'to', 'no', 'modeling', 'of', 'how', 'adopting', 'these', 'measures', 'might', 'affect', 'what', 'type', 'of', 'science', 'is', 'published', 'in', 'this', 'paper', 'we', 'develop', 'a', 'novel', 'optimality', 'model', 'that', 'given', 'current', 'incentives', 'to', 'publish', 'predicts', 'a', 'researchers', 'most', 'rational', 'use', 'of', 'resources', 'in', 'terms', 'of', 'the', 'number', 'of', 'studies', 'to', 'undertake', 'the', 'statistical', 'power', 'to', 'devote', 'to', 'each', 'study', 'and', 'the', 'desirable', 'prestudy', 'odds', 'to', 'pursue', 'we', 'then', 'develop', 'a', 'methodology', 'that', 'allows', 'one', 'to', 'estimate', 'the', 'reliability', 'of', 'published', 'research', 'by', 'considering', 'a', 'distribution', 'of', 'preferred', 'research', 'strategies', 'using', 'this', 'approach', 'we', 'investigate', 'the', 'merits', 'of', 'adopting', 'measures', 'of', 'greater', 'statistical', 'stringency', 'with', 'the', 'goal', 'of', 'informing', 'the', 'ongoing', 'debate']]
|
[-0.06979980538777153, 0.0329008177011778, -0.0906914186420714, 0.07415509424365131, -0.13366004421262984, -0.1303762197346207, 0.10795463952695607, 0.3844280003221145, -0.18607906340309982, -0.3493019961900297, 0.09484117821965271, -0.2759829578450532, -0.11163729202531716, 0.18350135396934666, -0.1274464083479563, 0.06253332727823027, 0.024152662751122503, 0.006410101962507151, -0.05586836848906271, -0.2819216110140002, 0.29351538211807227, 0.13327104947529733, 0.3214386787182491, 0.06574218919215973, 0.04429006485778625, -0.03191088116876069, -0.11814917631115124, 0.025999673054951013, -0.1904948537545108, 0.19604458232895192, 0.28005733430848284, 0.23397143261513084, 0.409039934681859, -0.4073162150691515, -0.2183772233362268, 0.1387754324793958, 0.12708583848986918, 0.054347802711365994, -0.052883797036009324, -0.22727119377487973, 0.1178251561897089, -0.2109201084941056, -0.14366964951222821, -0.07448090125871881, 0.04657994488633837, 0.01380834832697051, -0.19668492525341405, 0.04613440062043963, 0.016681884029868303, 0.11130556527667554, -0.025013836099585268, -0.1722806854882414, 0.0230933059256073, 0.1619083247352154, 0.1143918543598751, 0.010781428603170688, 0.11013042189441859, -0.14566100539586205, -0.139633301882797, 0.38716290477710735, -0.006208898962303332, -0.18105676514838057, 0.20869789897185412, -0.15147846087421865, -0.17847908671743645, 0.056523295356684426, 0.19911404699087143, 0.04966265849389468, -0.16118215134509714, -0.002458854476108578, 0.01883020938913913, 0.18185489657809542, 0.02471351732683789, 0.03438685579258047, 0.21005873417090268, 0.1972651902429024, 0.04132815431002646, 0.132710376837451, -0.04798003415144078, -0.10624940167655753, -0.2220924812084313, -0.12226093734857763, -0.12504664279526442, 0.031528938102690134, -0.005521976186932438, -0.11340069898869842, 0.40621090831033363, 0.27246975594431544, 0.12680380521520118, 0.031675422930449344, 0.28905816334685325, 0.06484730235911954, 0.049686269262200516, 0.05184014376021542, 0.25212149795999, 0.09261624818922845, 0.09304366396683725, -0.1494850099014836, 0.13214593247219825, -0.025953863302518608]
|
1,803.06054
|
Deep Predictive Coding Neural Network for RF Anomaly Detection in
Wireless Networks
|
Intrusion detection has become one of the most critical tasks in a wireless
network to prevent service outages that can take long to fix. The sheer variety
of anomalous events necessitates adopting cognitive anomaly detection methods
instead of the traditional signature-based detection techniques. This paper
proposes an anomaly detection methodology for wireless systems that is based on
monitoring and analyzing radio frequency (RF) spectrum activities. Our
detection technique leverages an existing solution for the video prediction
problem, and uses it on image sequences generated from monitoring the wireless
spectrum. The deep predictive coding network is trained with images
corresponding to the normal behavior of the system, and whenever there is an
anomaly, its detection is triggered by the deviation between the actual and
predicted behavior. For our analysis, we use the images generated from the
time-frequency spectrograms and spectral correlation functions of the received
RF signal. We test our technique on a dataset which contains anomalies such as
jamming, chirping of transmitters, spectrum hijacking, and node failure, and
evaluate its performance using standard classifier metrics: detection ratio,
and false alarm rate. Simulation results demonstrate that the proposed
methodology effectively detects many unforeseen anomalous events in real time.
We discuss the applications, which encompass industrial IoT, autonomous vehicle
control and mission-critical communications services.
|
eess.SP
|
intrusion detection has become one of the most critical tasks in a wireless network to prevent service outages that can take long to fix the sheer variety of anomalous events necessitates adopting cognitive anomaly detection methods instead of the traditional signaturebased detection techniques this paper proposes an anomaly detection methodology for wireless systems that is based on monitoring and analyzing radio frequency rf spectrum activities our detection technique leverages an existing solution for the video prediction problem and uses it on image sequences generated from monitoring the wireless spectrum the deep predictive coding network is trained with images corresponding to the normal behavior of the system and whenever there is an anomaly its detection is triggered by the deviation between the actual and predicted behavior for our analysis we use the images generated from the timefrequency spectrograms and spectral correlation functions of the received rf signal we test our technique on a dataset which contains anomalies such as jamming chirping of transmitters spectrum hijacking and node failure and evaluate its performance using standard classifier metrics detection ratio and false alarm rate simulation results demonstrate that the proposed methodology effectively detects many unforeseen anomalous events in real time we discuss the applications which encompass industrial iot autonomous vehicle control and missioncritical communications services
|
[['intrusion', 'detection', 'has', 'become', 'one', 'of', 'the', 'most', 'critical', 'tasks', 'in', 'a', 'wireless', 'network', 'to', 'prevent', 'service', 'outages', 'that', 'can', 'take', 'long', 'to', 'fix', 'the', 'sheer', 'variety', 'of', 'anomalous', 'events', 'necessitates', 'adopting', 'cognitive', 'anomaly', 'detection', 'methods', 'instead', 'of', 'the', 'traditional', 'signaturebased', 'detection', 'techniques', 'this', 'paper', 'proposes', 'an', 'anomaly', 'detection', 'methodology', 'for', 'wireless', 'systems', 'that', 'is', 'based', 'on', 'monitoring', 'and', 'analyzing', 'radio', 'frequency', 'rf', 'spectrum', 'activities', 'our', 'detection', 'technique', 'leverages', 'an', 'existing', 'solution', 'for', 'the', 'video', 'prediction', 'problem', 'and', 'uses', 'it', 'on', 'image', 'sequences', 'generated', 'from', 'monitoring', 'the', 'wireless', 'spectrum', 'the', 'deep', 'predictive', 'coding', 'network', 'is', 'trained', 'with', 'images', 'corresponding', 'to', 'the', 'normal', 'behavior', 'of', 'the', 'system', 'and', 'whenever', 'there', 'is', 'an', 'anomaly', 'its', 'detection', 'is', 'triggered', 'by', 'the', 'deviation', 'between', 'the', 'actual', 'and', 'predicted', 'behavior', 'for', 'our', 'analysis', 'we', 'use', 'the', 'images', 'generated', 'from', 'the', 'timefrequency', 'spectrograms', 'and', 'spectral', 'correlation', 'functions', 'of', 'the', 'received', 'rf', 'signal', 'we', 'test', 'our', 'technique', 'on', 'a', 'dataset', 'which', 'contains', 'anomalies', 'such', 'as', 'jamming', 'chirping', 'of', 'transmitters', 'spectrum', 'hijacking', 'and', 'node', 'failure', 'and', 'evaluate', 'its', 'performance', 'using', 'standard', 'classifier', 'metrics', 'detection', 'ratio', 'and', 'false', 'alarm', 'rate', 'simulation', 'results', 'demonstrate', 'that', 'the', 'proposed', 'methodology', 'effectively', 'detects', 'many', 'unforeseen', 'anomalous', 'events', 'in', 'real', 'time', 'we', 'discuss', 'the', 'applications', 'which', 'encompass', 'industrial', 'iot', 'autonomous', 'vehicle', 'control', 'and', 'missioncritical', 'communications', 'services']]
|
[-0.1678947349746694, -0.009458720525971038, -0.055324028255165345, 0.027248256030944967, -0.08292768268411066, -0.18190347763626255, 0.05790656585441815, 0.3808462814568489, -0.2415555409416073, -0.31381233595750946, 0.13567756087760022, -0.3138800152403935, -0.2145504787463238, 0.22405697803422403, -0.11543135470183531, 0.09709112039319116, 0.07260216017613925, 0.0637528888303523, -0.009291212340236976, -0.2096566461654872, 0.2715241996799859, 0.07828702888204958, 0.381376968630818, 0.06676271223333524, 0.09589346646955062, 0.015382588973910248, -0.0716698576508415, -0.05245115652236701, -0.029373436258469637, 0.10368770565057858, 0.33527914107280765, 0.24475090869730953, 0.25601118683314195, -0.38889597387070646, -0.27157500894072484, 0.14194580300640808, 0.14147687688050353, 0.06069455888201395, -0.058273627198156285, -0.3662872100556445, 0.11993968107886964, -0.22529838297006516, -0.03866137117850331, -0.06708293461311117, -0.023882297578241396, 0.0054175760882537605, -0.2841718979443441, 0.03877585559132298, 0.007747560399057309, 0.07550845494634419, -0.057169393222792214, -0.039772722236965874, 0.05097738141193986, 0.18038706887592473, 0.08253034384358886, -0.0072492599341236405, 0.19282575866318954, -0.15914547661047418, -0.16264741754852333, 0.36347236155470797, -0.04876532812684089, -0.1483859708137318, 0.2035600803662745, -0.04360909281377593, -0.15502889098748915, 0.15830942945343987, 0.24033643717367975, 0.08045882189576074, -0.16282375453354106, -0.014087732194072814, 0.03099226264529071, 0.18388194510743971, 0.05006497599874219, 0.02015085046768259, 0.19882136859594984, 0.23598294812342469, 0.09239452021698388, 0.11039857729667586, -0.18587589765380505, -0.021181003673810442, -0.21516312091536643, -0.1076176478483556, -0.22504780424115212, 0.007198806233234036, -0.0832225070153072, -0.14185765774301165, 0.4181656864321272, 0.22313372419382674, 0.13788416369088907, 0.08522832709285519, 0.3965420420435345, 0.09566021606629223, 0.10318912731599994, 0.0809588326396034, 0.20194627846072796, 0.024703639423263805, 0.1593776926720067, -0.18743730489469906, 0.09384880234149091, 0.01938008695164309]
|
1,803.06055
|
Characterization and Optical Properties of Erbium doped As2S3 Films
Prepared by Multi-layer Magnetron Sputtering
|
As2S3 film doped with erbium is prepared using multi-layer magnetron
sputtering. The optical properties were measured by reflectance spectroscopy,
and its chemical composition is examined by x-ray photoelectron, Rutherford
backscattering, and Raman spectroscopy. The results show that the refractive
index and absorption coefficient follow closely to a sputtered As2S3 film, and
there are no detectable Er-S clusters and photo-induced As2O3 in the film.
Rutherford backscattering spectroscopy shows that the film is homogeneous, and
revealed the concentration level of erbium, and the stoichiometry of the film.
The deposition method was used to fabricate an integrated Erdoped As2S3
Mach-Zehnder Interferometer and the presence of active erbium ions in the
waveguide is evident from the green luminescence it emitted when it was pumped
by 1488 nm diode laser. This method is attractive because the doping process
can produce an Er:As2S3 film that is close to the ideal stoichiometry of As2S3
with lower risk of photo-decomposed As2O3 crystals developing on the surface
when the as-deposited film is exposed to the environment.
|
cond-mat.mtrl-sci
|
as2s3 film doped with erbium is prepared using multilayer magnetron sputtering the optical properties were measured by reflectance spectroscopy and its chemical composition is examined by xray photoelectron rutherford backscattering and raman spectroscopy the results show that the refractive index and absorption coefficient follow closely to a sputtered as2s3 film and there are no detectable ers clusters and photoinduced as2o3 in the film rutherford backscattering spectroscopy shows that the film is homogeneous and revealed the concentration level of erbium and the stoichiometry of the film the deposition method was used to fabricate an integrated erdoped as2s3 machzehnder interferometer and the presence of active erbium ions in the waveguide is evident from the green luminescence it emitted when it was pumped by 1488 nm diode laser this method is attractive because the doping process can produce an eras2s3 film that is close to the ideal stoichiometry of as2s3 with lower risk of photodecomposed as2o3 crystals developing on the surface when the asdeposited film is exposed to the environment
|
[['as2s3', 'film', 'doped', 'with', 'erbium', 'is', 'prepared', 'using', 'multilayer', 'magnetron', 'sputtering', 'the', 'optical', 'properties', 'were', 'measured', 'by', 'reflectance', 'spectroscopy', 'and', 'its', 'chemical', 'composition', 'is', 'examined', 'by', 'xray', 'photoelectron', 'rutherford', 'backscattering', 'and', 'raman', 'spectroscopy', 'the', 'results', 'show', 'that', 'the', 'refractive', 'index', 'and', 'absorption', 'coefficient', 'follow', 'closely', 'to', 'a', 'sputtered', 'as2s3', 'film', 'and', 'there', 'are', 'no', 'detectable', 'ers', 'clusters', 'and', 'photoinduced', 'as2o3', 'in', 'the', 'film', 'rutherford', 'backscattering', 'spectroscopy', 'shows', 'that', 'the', 'film', 'is', 'homogeneous', 'and', 'revealed', 'the', 'concentration', 'level', 'of', 'erbium', 'and', 'the', 'stoichiometry', 'of', 'the', 'film', 'the', 'deposition', 'method', 'was', 'used', 'to', 'fabricate', 'an', 'integrated', 'erdoped', 'as2s3', 'machzehnder', 'interferometer', 'and', 'the', 'presence', 'of', 'active', 'erbium', 'ions', 'in', 'the', 'waveguide', 'is', 'evident', 'from', 'the', 'green', 'luminescence', 'it', 'emitted', 'when', 'it', 'was', 'pumped', 'by', '1488', 'nm', 'diode', 'laser', 'this', 'method', 'is', 'attractive', 'because', 'the', 'doping', 'process', 'can', 'produce', 'an', 'eras2s3', 'film', 'that', 'is', 'close', 'to', 'the', 'ideal', 'stoichiometry', 'of', 'as2s3', 'with', 'lower', 'risk', 'of', 'photodecomposed', 'as2o3', 'crystals', 'developing', 'on', 'the', 'surface', 'when', 'the', 'asdeposited', 'film', 'is', 'exposed', 'to', 'the', 'environment']]
|
[-0.044527222901215836, 0.1950418315928387, -0.07073362607739965, -0.06722587227769977, 0.022595507146395518, -0.17282485746863213, 0.0474140189305851, 0.5199670054695823, -0.23941832336625365, -0.29126990623983806, 0.017023585644324848, -0.3750511924877311, -0.08517537567425858, 0.2217664352364161, -0.01568106972245556, 0.046259287901744814, -0.027637974573581508, -0.12927762119833267, 0.0062586490650463735, -0.19175186834552072, 0.25793436195870695, 0.11580496192486449, 0.37481865453477387, 0.07047843486035356, 0.07383954528944962, 0.010118296130024122, 0.09362675441485463, -0.028923705039602336, -0.1336392438906566, 0.08211859077758467, 0.26941264067409615, -0.08272142074437755, 0.16408028048604276, -0.44453637718477035, -0.21204488538064514, -0.025355361811252253, 0.09340363071144869, 0.08485851757877479, -0.117427505296655, -0.264558670273982, 0.039139497600439374, -0.0791251642403729, -0.1293183256420448, -0.0005007983834454507, -0.027113377774190723, 0.02258592698384415, -0.23423601927969492, 0.01657824499363249, 0.015055819696774988, 0.09527334090548031, -0.10761745900240247, -0.08987534173736067, -0.12501553126864812, 0.012962433511292505, -0.00914561311717879, 0.029046242862100235, 0.2640503621688395, -0.05884357325478711, -0.030983356459800042, 0.3305774248515566, -0.06445131802997132, -0.015975018096805522, 0.15078154663470658, -0.20604287569665097, 0.035013298512521114, 0.22422380142873435, 0.0675045622152869, 0.13859342553116608, -0.17204042423435373, 0.027879606293175707, -0.01524907536804676, 0.29826148866365354, 0.1785164028434365, 0.03141952891848191, 0.17435375074926537, 0.2228418961054448, 0.0032475437383365, 0.18358879783120233, -0.16344586688827611, 0.07226114117427532, -0.13567322765223006, -0.20253444909485, -0.2291409963953563, 0.09387348583391444, -0.04936107862246872, -0.1672239819534518, 0.33835929886466176, 0.0873892365785485, 0.09339954311761892, -0.08657825604984254, 0.27854375446384605, 0.12839232547942656, 0.05917726680213078, -0.025328061890534378, 0.3006258711924381, 0.20600440311951168, 0.14446663125841455, -0.28026370468380096, 0.1305881518108601, -0.04423741619173212]
|
1,803.06056
|
Between homogeneous and inhomogeneous Navier-Stokes systems: the issue
of stability
|
We construct large velocity vector solutions to the three dimensional
inhomogeneous Navier-Stokes system. The result is proved via the stability of
two dimensional solutions with constant density, under the assumption that
initial density is point-wisely close to a constant. Key elements of our
approach are estimates in the maximal regularity regime and the Lagrangian
coordinates. Considerations are done in the whole $\R^3$.
|
math.AP
|
we construct large velocity vector solutions to the three dimensional inhomogeneous navierstokes system the result is proved via the stability of two dimensional solutions with constant density under the assumption that initial density is pointwisely close to a constant key elements of our approach are estimates in the maximal regularity regime and the lagrangian coordinates considerations are done in the whole r3
|
[['we', 'construct', 'large', 'velocity', 'vector', 'solutions', 'to', 'the', 'three', 'dimensional', 'inhomogeneous', 'navierstokes', 'system', 'the', 'result', 'is', 'proved', 'via', 'the', 'stability', 'of', 'two', 'dimensional', 'solutions', 'with', 'constant', 'density', 'under', 'the', 'assumption', 'that', 'initial', 'density', 'is', 'pointwisely', 'close', 'to', 'a', 'constant', 'key', 'elements', 'of', 'our', 'approach', 'are', 'estimates', 'in', 'the', 'maximal', 'regularity', 'regime', 'and', 'the', 'lagrangian', 'coordinates', 'considerations', 'are', 'done', 'in', 'the', 'whole', 'r3']]
|
[-0.18980338748904965, 0.10668810650766376, -0.0712343144358226, 0.019199365318091886, -0.01524964569797439, -0.11016376046914488, -0.0344129558953066, 0.3115066203979715, -0.2616032677732648, -0.23999488577547093, 0.14427876475101878, -0.24391713230720452, -0.09694141482994441, 0.15689525566995144, -0.034446447772244294, 0.10631343583396126, 0.05803448400805674, 0.043038224902815156, -0.09219245343363934, -0.2706497107301989, 0.39561716839671135, -0.02098507898288869, 0.2970062659813031, -0.004155692619068788, 0.10999322346892328, -0.0595953255373564, -0.00031025927033155197, 0.05598080813163711, -0.2096151063682731, 0.10309204444169037, 0.20590648486188823, 0.06152922482860665, 0.2706752770370053, -0.3943365390502637, -0.22643591140607192, 0.07927664431683239, 0.11284340166997525, 0.12499110646275503, -0.022386517319377634, -0.26111421052126155, 0.10234947708405313, -0.0944104919420375, -0.2616629647091031, -0.08367035435813089, 0.006050109352555967, 0.06381656292585595, -0.3097059545858252, 0.10763108967653205, 0.06491220078521198, 0.011999943038268436, -0.16466626581255225, -0.07301730037509133, -0.03639845956762832, 0.07636869211320675, 0.10222762829113391, 0.03719905861503174, 0.06920367425998612, -0.1063207259972959, -0.00655198707095077, 0.36380862642920786, -0.11675157336022464, -0.30400590180990195, 0.19332368102585595, -0.15613593290289562, -0.09574179537594318, 0.12290809448477963, 0.14039080297093717, 0.13880139906259795, -0.12172232350454695, 0.16054278883929063, -0.07431364484927466, 0.16245813820991786, 0.076242710568852, -0.008622660774797682, 0.11617103441347999, 0.11166456180451918, 0.12745162632857118, 0.08757730988004515, -0.048968713062124386, -0.1350064645896876, -0.3496408217676705, -0.13794615353277373, -0.1791483082342893, 0.08200181488909068, -0.15195323969214036, -0.14858079559710477, 0.3426235773029827, 0.11406390905012226, 0.19788553397501668, 0.037185234258011464, 0.2868888098596325, 0.16301519405134324, 0.02447162675971706, 0.13176125193375252, 0.23949010324694456, 0.17039803343434487, 0.07921721503859566, -0.17466297176396173, 0.017687363520024285, 0.17758059232015042]
|
1,803.06057
|
The crucial role of ground-based, Doppler measurements for the future of
exoplanet science
|
We outline the important role that ground-based, Doppler monitoring of
exoplanetary systems will play in advancing our theories of planet formation
and dynamical evolution. A census of planetary systems requires a well designed
survey to be executed over the course of a decade or longer. A coordinated
survey to monitor several thousand targets each at ~1000 epochs (~3-5 million
new observations) will require roughly 40 dedicated spectrographs. We advocate
for improvements in data management, data sharing, analysis techniques, and
software testing, as well as possible changes to the funding structures for
exoplanet science.
|
astro-ph.IM astro-ph.EP
|
we outline the important role that groundbased doppler monitoring of exoplanetary systems will play in advancing our theories of planet formation and dynamical evolution a census of planetary systems requires a well designed survey to be executed over the course of a decade or longer a coordinated survey to monitor several thousand targets each at 1000 epochs 35 million new observations will require roughly 40 dedicated spectrographs we advocate for improvements in data management data sharing analysis techniques and software testing as well as possible changes to the funding structures for exoplanet science
|
[['we', 'outline', 'the', 'important', 'role', 'that', 'groundbased', 'doppler', 'monitoring', 'of', 'exoplanetary', 'systems', 'will', 'play', 'in', 'advancing', 'our', 'theories', 'of', 'planet', 'formation', 'and', 'dynamical', 'evolution', 'a', 'census', 'of', 'planetary', 'systems', 'requires', 'a', 'well', 'designed', 'survey', 'to', 'be', 'executed', 'over', 'the', 'course', 'of', 'a', 'decade', 'or', 'longer', 'a', 'coordinated', 'survey', 'to', 'monitor', 'several', 'thousand', 'targets', 'each', 'at', '1000', 'epochs', '35', 'million', 'new', 'observations', 'will', 'require', 'roughly', '40', 'dedicated', 'spectrographs', 'we', 'advocate', 'for', 'improvements', 'in', 'data', 'management', 'data', 'sharing', 'analysis', 'techniques', 'and', 'software', 'testing', 'as', 'well', 'as', 'possible', 'changes', 'to', 'the', 'funding', 'structures', 'for', 'exoplanet', 'science']]
|
[-0.11851746473781845, 0.09182732577325516, -0.06475365638572683, 0.06501544206853836, -0.13521286761588466, -0.0924564880514217, 0.0476324298313909, 0.3784854507213959, -0.20126932416792198, -0.41887037616263156, 0.17216016627317396, -0.2859164503182695, -0.09131635179973498, 0.2723021951669286, -0.05278918918182132, 0.06655276907227373, 0.1674644906945046, -0.06740845354293944, -0.030400627761483393, -0.3328397674586183, 0.23850886547257022, 0.13884818144342911, 0.17803476098924875, -0.008461319971629369, 0.044501413874107824, 0.009720137277718192, -0.14641966322757383, -0.048087506935561214, -0.13330801328563105, 0.08981850213486693, 0.3806371490961762, 0.2436528818641779, 0.3399003823237714, -0.41365687915634725, -0.22809666229952727, 0.04935179090988572, 0.18240152130601928, 0.049885018816297894, -0.03583418883843928, -0.24376666125270627, 0.02273348510836161, -0.21636152349572668, -0.1683244266427092, -0.055202229024832364, 0.053764340748149224, 0.025688031167593054, -0.2253540260316704, -0.005196772348035568, -0.01529055418633175, 0.19715537083765833, -0.11852435165295197, -0.11176772337527044, 0.010921815432788383, 0.18842061056495113, -0.030012084942270992, 0.037126429253808595, 0.1564088624511515, -0.10750005896934257, -0.1260688281267561, 0.4229059691005136, -0.08936550755990089, -0.008816485984190818, 0.20487132644461048, -0.14933639419295133, -0.21263903393460218, 0.11579507991911904, 0.23574009782043837, 0.11774365781175514, -0.17509704746145716, -0.04982689295279523, 0.04499717205712792, 0.1987102535573305, 0.03824643026386458, 0.07103204778620913, 0.33206401450148915, 0.21284228082626097, 0.11104044288219082, 0.07665439847461199, -0.17993564008464735, -0.09037820272891212, -0.22932821092751599, -0.15610858717318674, -0.07257638415021281, 0.057145105373497394, -0.01789020857071474, -0.0850574968142375, 0.37299856514499713, 0.17454566355914838, 0.11424726579758909, -0.004419809778130824, 0.3179481892285728, -0.04008154576939721, 0.16860276257358892, 0.03459411758869406, 0.24226518146198003, 0.05155224420819669, 0.19075940258585677, -0.14646535915427752, 0.05974876365914781, -0.07440508031336371]
|
1,803.06058
|
Constant-Time Predictive Distributions for Gaussian Processes
|
One of the most compelling features of Gaussian process (GP) regression is
its ability to provide well-calibrated posterior distributions. Recent advances
in inducing point methods have sped up GP marginal likelihood and posterior
mean computations, leaving posterior covariance estimation and sampling as the
remaining computational bottlenecks. In this paper we address these
shortcomings by using the Lanczos algorithm to rapidly approximate the
predictive covariance matrix. Our approach, which we refer to as LOVE (LanczOs
Variance Estimates), substantially improves time and space complexity. In our
experiments, LOVE computes covariances up to 2,000 times faster and draws
samples 18,000 times faster than existing methods, all without sacrificing
accuracy.
|
cs.LG stat.ML
|
one of the most compelling features of gaussian process gp regression is its ability to provide wellcalibrated posterior distributions recent advances in inducing point methods have sped up gp marginal likelihood and posterior mean computations leaving posterior covariance estimation and sampling as the remaining computational bottlenecks in this paper we address these shortcomings by using the lanczos algorithm to rapidly approximate the predictive covariance matrix our approach which we refer to as love lanczos variance estimates substantially improves time and space complexity in our experiments love computes covariances up to 2000 times faster and draws samples 18000 times faster than existing methods all without sacrificing accuracy
|
[['one', 'of', 'the', 'most', 'compelling', 'features', 'of', 'gaussian', 'process', 'gp', 'regression', 'is', 'its', 'ability', 'to', 'provide', 'wellcalibrated', 'posterior', 'distributions', 'recent', 'advances', 'in', 'inducing', 'point', 'methods', 'have', 'sped', 'up', 'gp', 'marginal', 'likelihood', 'and', 'posterior', 'mean', 'computations', 'leaving', 'posterior', 'covariance', 'estimation', 'and', 'sampling', 'as', 'the', 'remaining', 'computational', 'bottlenecks', 'in', 'this', 'paper', 'we', 'address', 'these', 'shortcomings', 'by', 'using', 'the', 'lanczos', 'algorithm', 'to', 'rapidly', 'approximate', 'the', 'predictive', 'covariance', 'matrix', 'our', 'approach', 'which', 'we', 'refer', 'to', 'as', 'love', 'lanczos', 'variance', 'estimates', 'substantially', 'improves', 'time', 'and', 'space', 'complexity', 'in', 'our', 'experiments', 'love', 'computes', 'covariances', 'up', 'to', '2000', 'times', 'faster', 'and', 'draws', 'samples', '18000', 'times', 'faster', 'than', 'existing', 'methods', 'all', 'without', 'sacrificing', 'accuracy']]
|
[0.01508993575050724, 0.009346487228473086, -0.07174067172213053, 0.07992006653109096, -0.10211463289704385, -0.1298025087717007, 0.11956650940789226, 0.42372001582791785, -0.2587874688807752, -0.36922307238685637, 0.12541715364932315, -0.27826052424849346, -0.12670112602667497, 0.1856700253853012, -0.10230875994026098, 0.13064450510164705, 0.10215270544736171, -0.028158304678827507, -0.16442712528174216, -0.334495620180431, 0.19722440066079627, 0.11132993036002484, 0.2843927438744291, -0.08487714701310187, 0.12575939803753258, -0.004972114974527426, -0.07143684593468623, -0.05504891680106565, -0.10932509084935037, 0.15140046962352363, 0.26152947255331177, 0.2186602179031327, 0.3637246990110725, -0.4141487036216653, -0.20736123614434926, 0.12820405594099593, 0.2048494058973068, 0.12880228477736655, 0.02177367400694287, -0.2871270586367486, 0.06699367595028202, -0.1636214614230788, -0.08057254454437292, -0.19378770562328118, -0.03039930635219756, 0.004236939622370421, -0.29417449711132265, 0.14408159697700715, 0.05895360603594696, 0.006657256718443812, 0.028489141548184223, -0.2176251033022297, 0.050275720054072874, 0.10034159613984092, 0.11490597010485527, 0.051369910044947044, 0.1544015784264665, -0.12498011337461407, -0.11626575767712773, 0.3161804030807513, -0.06177681239548618, -0.20412857602965437, 0.15365197910171635, -0.10401938251606277, -0.1254164848283355, 0.18244425711257137, 0.19224408269367832, 0.10650988533776605, -0.13008293187913467, 0.07034256844122384, 0.04063589018352224, 0.1478360169844478, 0.051392141677975164, -0.027553248807858182, 0.11982844371067465, 0.16887419477526872, 0.08545197427211294, 0.07340850562015373, -0.1302604843897499, -0.11248932781031812, -0.19621782711232608, -0.12420563713454132, -0.23776991815714799, -0.019882811024732324, -0.18739696433009878, -0.1566801632794042, 0.38567320927362536, 0.26160131335447384, 0.20169675883503174, 0.18785217579757302, 0.37098112076802076, 0.10169346108681189, 0.047277257799715644, 0.16918379153160132, 0.15487809507352002, 0.11113043688896622, 0.01832192701744443, -0.16618955697214124, 0.11656165332643245, 0.028421132791269007]
|
1,803.06059
|
Distributed Cache Enabled V2X Networks: Proposals, Research Trends and
Challenging Issues
|
Nowadays, the internet of vehicles (IoV) has been evolved into the stage of
vehicle to everything (V2X). However, the majority of existing work focuses on
the motor-vehicles. In contrast, the sharing bicycle system is vastly and
rapidly deployed as a feasible internet of things (IoT) application scene for
the last mile problem (e.g., from station to home/office). Moreover, the
internet access of current V2X is relied on the back-haul to roadside unit
(RSU) connections. In this paper, other than prior work, we propose a versatile
V2X system with a distributed framework and heterogeneous caching method. All
the vehicles and devices on-the-road (motor-vehicle, non-motor-vehicle,
pedestrian, etc.) are comprehensively included in the proposed networks. We
further introduce a heterogeneous cache method for effective wireless
transmission while utilizing the massive connected devices. The potential
research trends on achieving high speed transmission, deep programming
dedicated network slicing are highlighted as well as the big data, machine
learning (ML), fog computing based image recognition and reconstruction, to
provide some insights for future studies. Finally, the challenging issues,
i.e., urban street canyon path loss and channel models, ultra reliable
communication and low latency requirements, are discussed.
|
cs.NI eess.SP
|
nowadays the internet of vehicles iov has been evolved into the stage of vehicle to everything v2x however the majority of existing work focuses on the motorvehicles in contrast the sharing bicycle system is vastly and rapidly deployed as a feasible internet of things iot application scene for the last mile problem eg from station to homeoffice moreover the internet access of current v2x is relied on the backhaul to roadside unit rsu connections in this paper other than prior work we propose a versatile v2x system with a distributed framework and heterogeneous caching method all the vehicles and devices ontheroad motorvehicle nonmotorvehicle pedestrian etc are comprehensively included in the proposed networks we further introduce a heterogeneous cache method for effective wireless transmission while utilizing the massive connected devices the potential research trends on achieving high speed transmission deep programming dedicated network slicing are highlighted as well as the big data machine learning ml fog computing based image recognition and reconstruction to provide some insights for future studies finally the challenging issues ie urban street canyon path loss and channel models ultra reliable communication and low latency requirements are discussed
|
[['nowadays', 'the', 'internet', 'of', 'vehicles', 'iov', 'has', 'been', 'evolved', 'into', 'the', 'stage', 'of', 'vehicle', 'to', 'everything', 'v2x', 'however', 'the', 'majority', 'of', 'existing', 'work', 'focuses', 'on', 'the', 'motorvehicles', 'in', 'contrast', 'the', 'sharing', 'bicycle', 'system', 'is', 'vastly', 'and', 'rapidly', 'deployed', 'as', 'a', 'feasible', 'internet', 'of', 'things', 'iot', 'application', 'scene', 'for', 'the', 'last', 'mile', 'problem', 'eg', 'from', 'station', 'to', 'homeoffice', 'moreover', 'the', 'internet', 'access', 'of', 'current', 'v2x', 'is', 'relied', 'on', 'the', 'backhaul', 'to', 'roadside', 'unit', 'rsu', 'connections', 'in', 'this', 'paper', 'other', 'than', 'prior', 'work', 'we', 'propose', 'a', 'versatile', 'v2x', 'system', 'with', 'a', 'distributed', 'framework', 'and', 'heterogeneous', 'caching', 'method', 'all', 'the', 'vehicles', 'and', 'devices', 'ontheroad', 'motorvehicle', 'nonmotorvehicle', 'pedestrian', 'etc', 'are', 'comprehensively', 'included', 'in', 'the', 'proposed', 'networks', 'we', 'further', 'introduce', 'a', 'heterogeneous', 'cache', 'method', 'for', 'effective', 'wireless', 'transmission', 'while', 'utilizing', 'the', 'massive', 'connected', 'devices', 'the', 'potential', 'research', 'trends', 'on', 'achieving', 'high', 'speed', 'transmission', 'deep', 'programming', 'dedicated', 'network', 'slicing', 'are', 'highlighted', 'as', 'well', 'as', 'the', 'big', 'data', 'machine', 'learning', 'ml', 'fog', 'computing', 'based', 'image', 'recognition', 'and', 'reconstruction', 'to', 'provide', 'some', 'insights', 'for', 'future', 'studies', 'finally', 'the', 'challenging', 'issues', 'ie', 'urban', 'street', 'canyon', 'path', 'loss', 'and', 'channel', 'models', 'ultra', 'reliable', 'communication', 'and', 'low', 'latency', 'requirements', 'are', 'discussed']]
|
[-0.20798299782558954, -0.003144890619491938, -0.010674142679299718, 0.020670772814526728, -0.11240543255467288, -0.2090901584184218, 0.08367918701454376, 0.4119263580963967, -0.24588213269148143, -0.3050720684595847, 0.13866984473368635, -0.27550900605837664, -0.18064847389756833, 0.2101564621602896, -0.15666094559597812, 0.12034397826139484, 0.08869449648916078, 0.025175580766298607, 0.014866295408317319, -0.26801396132151406, 0.29324531528450326, 0.06560594528730113, 0.4099656248625408, 0.0906746119788647, 0.07729526777984574, 0.002804878655375452, -0.05875613554430905, -0.025873547350432003, -0.07396325953095095, 0.18651196171006348, 0.3452835365417653, 0.2146232456271787, 0.31284254305978476, -0.4982826099033162, -0.2799160920486595, 0.0683408698833157, 0.20187542075189568, 0.041197356167099165, -0.06272530020903094, -0.314516668278043, 0.1135965945835661, -0.2465404457943414, -0.053502462054033244, -0.02247770505166182, -0.007772308980835782, 0.04766707907472136, -0.23509141560224567, -0.029205952765531486, -0.04571856636120888, 0.06861056845324735, -0.03824427849766473, -0.089611350188172, 0.03311888347204615, 0.20003352847178116, 0.022426568541265225, 0.02673869618585193, 0.16911462250119325, -0.1726780891210662, -0.10500993374459726, 0.4029489194909211, 0.027985705127135316, -0.14866035035310654, 0.18609466476357162, -0.014338931882433513, -0.14272764094063753, 0.0577541387149243, 0.26314746075177126, 0.07748419526834241, -0.2134062550581431, 0.028052093630928237, 0.007941012785229231, 0.09651260116007379, 0.0498314055098441, 0.08076172871690404, 0.19389494504988156, 0.3045496268057695, 0.14584894575959734, 0.06319303643327677, -0.11858045942805988, -0.11610756980465545, -0.16166246109842372, -0.15203815699875434, -0.19658315471706472, -0.0031147003687056964, -0.06447250927971822, -0.09798332693565998, 0.3545245487613463, 0.19500550160044303, 0.1360902181752677, 0.08841526806254381, 0.4403628766416542, 0.023997474419859346, 0.12858385199640868, 0.15519078209575626, 0.1536898454045689, 0.019550551636066595, 0.25540738088274073, -0.13781808084690622, 0.07668254818699713, -0.02078572578317616]
|
1,803.0606
|
Characterizing the velocity of a wandering black hole and properties of
the surrounding medium using convolutional neural networks
|
We present a method for estimating the velocity of a wandering black hole and
the equation of state for the gas around, based on a catalog of numerical
simulations. The method uses machine learning methods based on convolutional
neural networks applied to the classification of images resulting from
numerical simulations. Specifically we focus on the supersonic velocity regime
and choose the direction of the black hole to be parallel to its spin. We build
a catalog of 900 simulations by numerically solving Euler's equations onto the
fixed space-time background of a black hole, for two parameters: the adiabatic
index $\Gamma$ with values in the range [1.1, 5/3], and the asymptotic relative
velocity of the black hole with respect to the surroundings $v_{\infty}$, with
values within $[0.2, 0.8]c$. For each simulation we produce a 2D image of the
gas density once the process of accretion has approached a stationary regime.
The results obtained show that the implemented Convolutional Neural Networks
are capable to classify correctly the adiabatic index $87.78\%$ of the time
within an uncertainty of $\pm 0.0284$ while the prediction of the velocity is
correct $96.67\%$ of the times within an uncertainty of $\pm 0.03c$. We expect
that this combination of a massive number of numerical simulations and machine
learning methods will help analyze more complicated scenarios related to future
high resolution observations of black holes, like those from the Event Horizon
Telescope.
|
astro-ph.HE
|
we present a method for estimating the velocity of a wandering black hole and the equation of state for the gas around based on a catalog of numerical simulations the method uses machine learning methods based on convolutional neural networks applied to the classification of images resulting from numerical simulations specifically we focus on the supersonic velocity regime and choose the direction of the black hole to be parallel to its spin we build a catalog of 900 simulations by numerically solving eulers equations onto the fixed spacetime background of a black hole for two parameters the adiabatic index gamma with values in the range 11 53 and the asymptotic relative velocity of the black hole with respect to the surroundings v_infty with values within 02 08c for each simulation we produce a 2d image of the gas density once the process of accretion has approached a stationary regime the results obtained show that the implemented convolutional neural networks are capable to classify correctly the adiabatic index 8778 of the time within an uncertainty of pm 00284 while the prediction of the velocity is correct 9667 of the times within an uncertainty of pm 003c we expect that this combination of a massive number of numerical simulations and machine learning methods will help analyze more complicated scenarios related to future high resolution observations of black holes like those from the event horizon telescope
|
[['we', 'present', 'a', 'method', 'for', 'estimating', 'the', 'velocity', 'of', 'a', 'wandering', 'black', 'hole', 'and', 'the', 'equation', 'of', 'state', 'for', 'the', 'gas', 'around', 'based', 'on', 'a', 'catalog', 'of', 'numerical', 'simulations', 'the', 'method', 'uses', 'machine', 'learning', 'methods', 'based', 'on', 'convolutional', 'neural', 'networks', 'applied', 'to', 'the', 'classification', 'of', 'images', 'resulting', 'from', 'numerical', 'simulations', 'specifically', 'we', 'focus', 'on', 'the', 'supersonic', 'velocity', 'regime', 'and', 'choose', 'the', 'direction', 'of', 'the', 'black', 'hole', 'to', 'be', 'parallel', 'to', 'its', 'spin', 'we', 'build', 'a', 'catalog', 'of', '900', 'simulations', 'by', 'numerically', 'solving', 'eulers', 'equations', 'onto', 'the', 'fixed', 'spacetime', 'background', 'of', 'a', 'black', 'hole', 'for', 'two', 'parameters', 'the', 'adiabatic', 'index', 'gamma', 'with', 'values', 'in', 'the', 'range', '11', '53', 'and', 'the', 'asymptotic', 'relative', 'velocity', 'of', 'the', 'black', 'hole', 'with', 'respect', 'to', 'the', 'surroundings', 'v_infty', 'with', 'values', 'within', '02', '08c', 'for', 'each', 'simulation', 'we', 'produce', 'a', '2d', 'image', 'of', 'the', 'gas', 'density', 'once', 'the', 'process', 'of', 'accretion', 'has', 'approached', 'a', 'stationary', 'regime', 'the', 'results', 'obtained', 'show', 'that', 'the', 'implemented', 'convolutional', 'neural', 'networks', 'are', 'capable', 'to', 'classify', 'correctly', 'the', 'adiabatic', 'index', '8778', 'of', 'the', 'time', 'within', 'an', 'uncertainty', 'of', 'pm', '00284', 'while', 'the', 'prediction', 'of', 'the', 'velocity', 'is', 'correct', '9667', 'of', 'the', 'times', 'within', 'an', 'uncertainty', 'of', 'pm', '003c', 'we', 'expect', 'that', 'this', 'combination', 'of', 'a', 'massive', 'number', 'of', 'numerical', 'simulations', 'and', 'machine', 'learning', 'methods', 'will', 'help', 'analyze', 'more', 'complicated', 'scenarios', 'related', 'to', 'future', 'high', 'resolution', 'observations', 'of', 'black', 'holes', 'like', 'those', 'from', 'the', 'event', 'horizon', 'telescope']]
|
[-0.09224116416810306, 0.06067744624265268, -0.08431492963285706, 0.042823108373041575, -0.039568787832740385, -0.10517661584525075, 0.03701055003027734, 0.3682578789408911, -0.21554594860690368, -0.32027493172664867, 0.10045012123872692, -0.29125033840295167, -0.07902480490118652, 0.24747957693598358, -0.040363990610013854, 0.07320081878307848, 0.07897566753294465, 0.03638349759676675, -0.11006445665422976, -0.21496044373486464, 0.3220313779961366, 0.08579060114976583, 0.25237015933624884, -0.037525777628411465, 0.13491758209747945, -0.035651784916095906, -0.024928966647485732, 0.034743107427959836, -0.16332464527309262, 0.10359731789887984, 0.21412133568901875, 0.11218621859274547, 0.2787232475286729, -0.3955725744533961, -0.21906367464805448, 0.06211668880882137, 0.1566678432473566, 0.11590965386584413, -0.06015583987780433, -0.2894329028163766, 0.09916983341099694, -0.19655650291285473, -0.1385350647922686, -0.031411836225160465, 0.02527248446105927, 0.01562102778600045, -0.24422902391933196, 0.11156190278258546, 0.01953226573039194, -0.006396544732363064, -0.08767337885431269, -0.0671077456428101, -0.03486290825399856, 0.10504270981981124, 0.05924992226817629, 0.052626356387760864, 0.15841285450771064, -0.14813463635706378, -0.10209174739807698, 0.3729318632417685, -0.06602978610153434, -0.175721591959397, 0.17072919636029443, -0.16021114775661008, -0.11880269723448467, 0.1454061986334235, 0.21425522436101585, 0.15060489133879285, -0.11780493596600958, 0.03256476915731736, -0.020733557249927384, 0.19825004596964685, 0.046034944488654854, -0.026289441090609347, 0.2722368672801569, 0.16903241886354145, 0.006585829717901362, 0.11117073890372095, -0.1796804136411162, -0.07138324482971198, -0.2584325439010412, -0.12826917095924223, -0.17493143536551609, 0.05120021511913475, -0.16028850870302705, -0.1431140708313747, 0.3720385953783989, 0.18591207872927026, 0.2005513990439023, 0.07626802521632799, 0.29257370694523116, 0.10289764243432066, 0.042837745564469655, 0.12562000215480917, 0.2619716129235488, 0.13393114724204558, 0.11330128047369356, -0.22413222808028002, 0.0028179377444427123, 0.06374840535227516]
|
1,803.06061
|
Inverse Design of Compact Multimode Cavity Couplers
|
Efficient coupling between on-chip sources and cavities plays a key role in
silicon photonics. However, despite the importance of this basic functionality,
there are few systematic design tools to simultaneously control coupling
between multiple modes in a compact resonator and a single waveguide. Here, we
propose a large-scale adjoint optimization approach to produce wavelength-scale
waveguide--cavity couplers operating over tunable and broad frequency bands. We
numerically demonstrate couplers discovered by this method that can achieve
critical, or nearly critical, coupling between multi-ring cavities and a single
waveguide at up to six widely separated wavelengths spanning the
$560$--$1500$~nm range of interest for on-chip nonlinear optical devices.
|
physics.optics cond-mat.mes-hall
|
efficient coupling between onchip sources and cavities plays a key role in silicon photonics however despite the importance of this basic functionality there are few systematic design tools to simultaneously control coupling between multiple modes in a compact resonator and a single waveguide here we propose a largescale adjoint optimization approach to produce wavelengthscale waveguidecavity couplers operating over tunable and broad frequency bands we numerically demonstrate couplers discovered by this method that can achieve critical or nearly critical coupling between multiring cavities and a single waveguide at up to six widely separated wavelengths spanning the 5601500nm range of interest for onchip nonlinear optical devices
|
[['efficient', 'coupling', 'between', 'onchip', 'sources', 'and', 'cavities', 'plays', 'a', 'key', 'role', 'in', 'silicon', 'photonics', 'however', 'despite', 'the', 'importance', 'of', 'this', 'basic', 'functionality', 'there', 'are', 'few', 'systematic', 'design', 'tools', 'to', 'simultaneously', 'control', 'coupling', 'between', 'multiple', 'modes', 'in', 'a', 'compact', 'resonator', 'and', 'a', 'single', 'waveguide', 'here', 'we', 'propose', 'a', 'largescale', 'adjoint', 'optimization', 'approach', 'to', 'produce', 'wavelengthscale', 'waveguidecavity', 'couplers', 'operating', 'over', 'tunable', 'and', 'broad', 'frequency', 'bands', 'we', 'numerically', 'demonstrate', 'couplers', 'discovered', 'by', 'this', 'method', 'that', 'can', 'achieve', 'critical', 'or', 'nearly', 'critical', 'coupling', 'between', 'multiring', 'cavities', 'and', 'a', 'single', 'waveguide', 'at', 'up', 'to', 'six', 'widely', 'separated', 'wavelengths', 'spanning', 'the', '5601500nm', 'range', 'of', 'interest', 'for', 'onchip', 'nonlinear', 'optical', 'devices']]
|
[-0.18777447975539033, 0.12452074779238262, 0.015800245856703483, -0.0606256429404382, -0.06369061486849796, -0.22996993091644594, 0.05547171937755549, 0.5356183495481037, -0.24617340104672517, -0.32776494452603233, 0.045477212241679, -0.24848364693851852, -0.14576660502855712, 0.29957027467266084, 0.018905713714577835, 0.08793126958992006, 0.022392082577390435, -0.11127317896637234, -0.02597093801647063, -0.11763016721098096, 0.24514388612209304, 0.022013540754944664, 0.3427988979287301, 0.05798747885556331, 0.13411020170625987, -0.02236228259009065, 0.0474773335984899, -0.07021304586160819, -0.0826345788164757, 0.1610387901784581, 0.32967932161522434, -0.010944083748945913, 0.34008204625937544, -0.40263550410282267, -0.21906897881818774, 0.08374168743713967, 0.190395639858941, 0.09723053976200584, -0.0899395190712824, -0.22255177681958213, 0.045578385160747664, -0.1404123684771142, -0.11290641910454724, -0.0822083407942911, -0.006120924232075516, -0.016971439033864263, -0.2416968334204002, -0.003280877831925466, -0.00039911465109009476, 0.04648220549943378, 0.019071189614744105, -0.016944470892217265, 0.014301482298709815, 0.07519517264563988, -0.09916937157728718, -0.023209773853999898, 0.14912928464524086, -0.09667158917551047, -0.1429952439824933, 0.3475988533673356, -0.05340126093965277, -0.12737406416371175, 0.1965722249418461, -0.09497115964033795, -0.05278578104487466, 0.13032711558586474, 0.2279373596521836, 0.08256953914912002, -0.15206412873705577, 0.009608620345972261, 0.05602975492365658, 0.23265842720866203, 0.125449773003302, 0.16806091743892113, 0.2859287128887745, 0.22940699808588885, 0.05204982108219518, 0.1638485994619471, -0.092860702892033, -0.046323352782688676, -0.2707030008353736, -0.11197823882769811, -0.1573031970697627, 0.013150527299092449, -0.11449339132681399, -0.16426273399129854, 0.40922990919642366, 0.14999600257995782, 0.11918378345559812, -0.03354412846231056, 0.3314340821946564, 0.07715004034457927, 0.15303389958187358, 0.05461418957820217, 0.33919963808458986, 0.16136003942093224, 0.10491447029431866, -0.21915214828405422, -0.05681473643347187, -0.05629068418197985]
|
1,803.06062
|
Heuristics for vehicle routing problems: Sequence or set optimization?
|
We investigate a structural decomposition for the capacitated vehicle routing
problem (CVRP) based on vehicle-to-customer "assignment" and visits
"sequencing" decision variables. We show that an heuristic search focused on
assignment decisions with a systematic optimal choice of sequences (using
Concorde TSP solver) during each move evaluation is promising but requires a
prohibitive computational effort. We therefore introduce an intermediate search
space, based on the dynamic programming procedure of Balas & Simonetti, which
finds a good compromise between intensification and computational efficiency. A
variety of speed-up techniques are proposed for a fast exploration:
neighborhood reductions, dynamic move filters, memory structures, and
concatenation techniques. Finally, a tunneling strategy is designed to reshape
the search space as the algorithm progresses.
The combination of these techniques within a classical local search, as well
as in the unified hybrid genetic search (UHGS) leads to significant
improvements of solution accuracy. New best solutions are found for
surprisingly small instances with as few as 256 customers. These solutions had
not been attained up to now with classic neighborhoods. Overall, this research
permits to better evaluate the respective impact of sequence and assignment
optimization, proposes new ways of combining the optimization of these two
decision sets, and opens promising research perspectives for the CVRP and its
variants.
|
math.OC cs.AI
|
we investigate a structural decomposition for the capacitated vehicle routing problem cvrp based on vehicletocustomer assignment and visits sequencing decision variables we show that an heuristic search focused on assignment decisions with a systematic optimal choice of sequences using concorde tsp solver during each move evaluation is promising but requires a prohibitive computational effort we therefore introduce an intermediate search space based on the dynamic programming procedure of balas simonetti which finds a good compromise between intensification and computational efficiency a variety of speedup techniques are proposed for a fast exploration neighborhood reductions dynamic move filters memory structures and concatenation techniques finally a tunneling strategy is designed to reshape the search space as the algorithm progresses the combination of these techniques within a classical local search as well as in the unified hybrid genetic search uhgs leads to significant improvements of solution accuracy new best solutions are found for surprisingly small instances with as few as 256 customers these solutions had not been attained up to now with classic neighborhoods overall this research permits to better evaluate the respective impact of sequence and assignment optimization proposes new ways of combining the optimization of these two decision sets and opens promising research perspectives for the cvrp and its variants
|
[['we', 'investigate', 'a', 'structural', 'decomposition', 'for', 'the', 'capacitated', 'vehicle', 'routing', 'problem', 'cvrp', 'based', 'on', 'vehicletocustomer', 'assignment', 'and', 'visits', 'sequencing', 'decision', 'variables', 'we', 'show', 'that', 'an', 'heuristic', 'search', 'focused', 'on', 'assignment', 'decisions', 'with', 'a', 'systematic', 'optimal', 'choice', 'of', 'sequences', 'using', 'concorde', 'tsp', 'solver', 'during', 'each', 'move', 'evaluation', 'is', 'promising', 'but', 'requires', 'a', 'prohibitive', 'computational', 'effort', 'we', 'therefore', 'introduce', 'an', 'intermediate', 'search', 'space', 'based', 'on', 'the', 'dynamic', 'programming', 'procedure', 'of', 'balas', 'simonetti', 'which', 'finds', 'a', 'good', 'compromise', 'between', 'intensification', 'and', 'computational', 'efficiency', 'a', 'variety', 'of', 'speedup', 'techniques', 'are', 'proposed', 'for', 'a', 'fast', 'exploration', 'neighborhood', 'reductions', 'dynamic', 'move', 'filters', 'memory', 'structures', 'and', 'concatenation', 'techniques', 'finally', 'a', 'tunneling', 'strategy', 'is', 'designed', 'to', 'reshape', 'the', 'search', 'space', 'as', 'the', 'algorithm', 'progresses', 'the', 'combination', 'of', 'these', 'techniques', 'within', 'a', 'classical', 'local', 'search', 'as', 'well', 'as', 'in', 'the', 'unified', 'hybrid', 'genetic', 'search', 'uhgs', 'leads', 'to', 'significant', 'improvements', 'of', 'solution', 'accuracy', 'new', 'best', 'solutions', 'are', 'found', 'for', 'surprisingly', 'small', 'instances', 'with', 'as', 'few', 'as', '256', 'customers', 'these', 'solutions', 'had', 'not', 'been', 'attained', 'up', 'to', 'now', 'with', 'classic', 'neighborhoods', 'overall', 'this', 'research', 'permits', 'to', 'better', 'evaluate', 'the', 'respective', 'impact', 'of', 'sequence', 'and', 'assignment', 'optimization', 'proposes', 'new', 'ways', 'of', 'combining', 'the', 'optimization', 'of', 'these', 'two', 'decision', 'sets', 'and', 'opens', 'promising', 'research', 'perspectives', 'for', 'the', 'cvrp', 'and', 'its', 'variants']]
|
[-0.10322375393773588, 0.006994769747351955, -0.0854947410841904, 0.05806237714004521, -0.1365005546363025, -0.1664210787860722, 0.15114421598363395, 0.4219751012034533, -0.28880067868385373, -0.381468346000013, 0.11431907530669577, -0.22638782156949364, -0.16216297530194335, 0.19868125302785236, -0.08168473519475722, 0.10095571065690687, 0.11129093655362361, -0.007037201625999154, -0.0721705959689599, -0.2625154708637061, 0.22122903692354334, 0.07528473454777423, 0.30863270050982333, 0.016290710572289622, 0.10890684320659536, 0.017688458662752697, -0.03980923199844433, 0.03983141410522299, -0.11121209887010415, 0.14957817246649052, 0.2763883539214276, 0.21351258595610356, 0.35317926775300645, -0.4046995515321813, -0.1768733491212493, 0.09758173926597143, 0.16274362494601163, 0.10629811421684103, -0.0810712280359528, -0.24548334454572418, 0.07924248121860551, -0.12563977120614542, -0.05171259035265482, -0.1265694124110202, 0.0013602964966217192, 0.04001924422762652, -0.270289775617875, -0.02265484792112214, -0.0014223201807997213, 0.02190391216427088, -0.054340516932013375, -0.17074592890240614, 0.061479407386490846, 0.12497320011621568, 0.034371976846283896, 0.05686584126158822, 0.1091173574731617, -0.09675216025004885, -0.22289479678701155, 0.3941374718711325, -0.02173361920144, -0.19011700554955296, 0.20803050372193044, -0.0045759424476361854, -0.15871915923340654, 0.1421182833248522, 0.2070527812647747, 0.1493262751686682, -0.1592803025799917, 0.04047955351643173, -0.015203182569352864, 0.15549338877473662, 0.07877916599305847, 0.030808699519441624, 0.17929978474247746, 0.2730646134581326, 0.15127272555042376, 0.15013986321893044, -0.07081455452503954, -0.12749366066305012, -0.23512966926096052, -0.14111968990778778, -0.12219657473629568, -0.012380575261393948, -0.10270028568579952, -0.16926390917562856, 0.37814653802027065, 0.15649913349614775, 0.15775372007089417, 0.08656548556996646, 0.3124830986526454, 0.06376910733183982, 0.08509426897153168, 0.104093718889919, 0.17470434830160583, 0.03371738496054782, 0.10552245193138356, -0.21476861433205535, 0.08816321735247606, 0.06178600191104612]
|
1,803.06063
|
Simulation of angular resolved RABBITT measurements in noble gas atoms
|
We simulate angular resolved RABBITT (Reconstruction of Attosecond Beating By
Interference of Two-photon Transitions) measurements on valence shells of noble
gas atoms (Ne, Ar, Kr, and Xe). Our non-perturbative numerical simulation is
based on solution of the time-dependent Schr\"odinger equation for a target
atom driven by an ionizing XUV and dressing IR fields. From these simulations
we extract the angular dependent magnitude and phase of the RABBITT
oscillations and deduce the corresponding angular anisotropy {\beta} parameter
and Wigner time delay ${\tau}_W$ for the single XUV photon absorption which
initiates the RABBITT process. Said {\beta} and ${\tau}_W$ parameters are
compared with calculations in the random phase approximation with exchange
(RPAE) which includes inter-shell correlation. This comparison is used to test
various effective potentials employed in the one-electron TDSE. In lighter
atoms (Ne and Ar), several effective potentials are found to provide accurate
simulation of RABBITT measurements for a wide range of photon energies up to
100 eV above the valence shell threshold. In heavier atoms (Kr and Xe), the
onset of strong correlation with the d-shell restricts the validity of the
single active electron approximation to several tens of eV above the valence
shell threshold.
|
physics.atom-ph
|
we simulate angular resolved rabbitt reconstruction of attosecond beating by interference of twophoton transitions measurements on valence shells of noble gas atoms ne ar kr and xe our nonperturbative numerical simulation is based on solution of the timedependent schrodinger equation for a target atom driven by an ionizing xuv and dressing ir fields from these simulations we extract the angular dependent magnitude and phase of the rabbitt oscillations and deduce the corresponding angular anisotropy beta parameter and wigner time delay tau_w for the single xuv photon absorption which initiates the rabbitt process said beta and tau_w parameters are compared with calculations in the random phase approximation with exchange rpae which includes intershell correlation this comparison is used to test various effective potentials employed in the oneelectron tdse in lighter atoms ne and ar several effective potentials are found to provide accurate simulation of rabbitt measurements for a wide range of photon energies up to 100 ev above the valence shell threshold in heavier atoms kr and xe the onset of strong correlation with the dshell restricts the validity of the single active electron approximation to several tens of ev above the valence shell threshold
|
[['we', 'simulate', 'angular', 'resolved', 'rabbitt', 'reconstruction', 'of', 'attosecond', 'beating', 'by', 'interference', 'of', 'twophoton', 'transitions', 'measurements', 'on', 'valence', 'shells', 'of', 'noble', 'gas', 'atoms', 'ne', 'ar', 'kr', 'and', 'xe', 'our', 'nonperturbative', 'numerical', 'simulation', 'is', 'based', 'on', 'solution', 'of', 'the', 'timedependent', 'schrodinger', 'equation', 'for', 'a', 'target', 'atom', 'driven', 'by', 'an', 'ionizing', 'xuv', 'and', 'dressing', 'ir', 'fields', 'from', 'these', 'simulations', 'we', 'extract', 'the', 'angular', 'dependent', 'magnitude', 'and', 'phase', 'of', 'the', 'rabbitt', 'oscillations', 'and', 'deduce', 'the', 'corresponding', 'angular', 'anisotropy', 'beta', 'parameter', 'and', 'wigner', 'time', 'delay', 'tau_w', 'for', 'the', 'single', 'xuv', 'photon', 'absorption', 'which', 'initiates', 'the', 'rabbitt', 'process', 'said', 'beta', 'and', 'tau_w', 'parameters', 'are', 'compared', 'with', 'calculations', 'in', 'the', 'random', 'phase', 'approximation', 'with', 'exchange', 'rpae', 'which', 'includes', 'intershell', 'correlation', 'this', 'comparison', 'is', 'used', 'to', 'test', 'various', 'effective', 'potentials', 'employed', 'in', 'the', 'oneelectron', 'tdse', 'in', 'lighter', 'atoms', 'ne', 'and', 'ar', 'several', 'effective', 'potentials', 'are', 'found', 'to', 'provide', 'accurate', 'simulation', 'of', 'rabbitt', 'measurements', 'for', 'a', 'wide', 'range', 'of', 'photon', 'energies', 'up', 'to', '100', 'ev', 'above', 'the', 'valence', 'shell', 'threshold', 'in', 'heavier', 'atoms', 'kr', 'and', 'xe', 'the', 'onset', 'of', 'strong', 'correlation', 'with', 'the', 'dshell', 'restricts', 'the', 'validity', 'of', 'the', 'single', 'active', 'electron', 'approximation', 'to', 'several', 'tens', 'of', 'ev', 'above', 'the', 'valence', 'shell', 'threshold']]
|
[-0.044347637809138536, 0.20059661540815177, -0.015580011883356906, 0.07128906346227352, 0.04210031479681103, -0.13673841240863824, 0.0732198422558644, 0.42448595857977406, -0.21127280674649151, -0.3350393584900603, -0.055541947188777564, -0.3300007897736409, -0.011874869159787664, 0.153492622593833, 0.08285003547921546, 0.056543497632728104, 0.04889759809479655, -0.0268027626730192, -0.09396703350333709, -0.15265332193944373, 0.27688380457297657, 0.10135268295644638, 0.21893739561579123, 0.1000383892240598, 0.05240974130502604, 0.004348212826370559, 0.00993338157182809, -0.056709440779084935, -0.1337687351355196, 0.06407561762373626, 0.2204063448800823, 0.01744583262083812, 0.2097380868154434, -0.44168336658748153, -0.21827547673433634, 0.02839324696555964, 0.15318341347864187, 0.09288421191020686, -0.08308634463098793, -0.2785999783333967, -0.0211463606065456, -0.15829258356195366, -0.14619304369366967, -0.06015951331277599, 0.033547801041217115, 0.07256632133329421, -0.32303361768459843, 0.09950320400806509, -0.025740218050561883, 0.017449556407601197, -0.0907271593627904, -0.12791193053414374, -0.018396801497071943, 0.048608191434075555, 0.00104948233308381, 0.03074299494349446, 0.18198235671110355, -0.09588868456734248, -0.06070583374611553, 0.38735251622178507, -0.09466631532425887, -0.1000474381414194, 0.16414602901234493, -0.18661870576138848, -0.0472523406179161, 0.24400872947676971, 0.11032691837130018, 0.15568359756479808, -0.09598106779542166, 0.06511524950451765, 0.01492833400615635, 0.22135193754928476, 0.11849332617874228, 0.05285914569190636, 0.15287782297920935, 0.1357862837324591, 0.008336879082561768, 0.0731238980469121, -0.17923353606662185, -0.11171898783482227, -0.2751610725253974, -0.11483407691029589, -0.1625373374344301, 0.06634157083774965, -0.09853274813497957, -0.15096464277168295, 0.3855901882124431, 0.1256955364267774, 0.14273038279437988, -0.047138365392438764, 0.2700293828762069, 0.14955874370379835, 0.0030080470215702025, 0.005237500581736725, 0.2974356861746649, 0.1910338164991267, 0.08825468144513973, -0.29693814541678876, 0.015103385769330041, 0.03625383413367972]
|
1,803.06064
|
A Meaning-based Statistical English Math Word Problem Solver
|
We introduce MeSys, a meaning-based approach, for solving English math word
problems (MWPs) via understanding and reasoning in this paper. It first
analyzes the text, transforms both body and question parts into their
corresponding logic forms, and then performs inference on them. The associated
context of each quantity is represented with proposed role-tags (e.g., nsubj,
verb, etc.), which provides the flexibility for annotating an extracted math
quantity with its associated context information (i.e., the physical meaning of
this quantity). Statistical models are proposed to select the operator and
operands. A noisy dataset is designed to assess if a solver solves MWPs mainly
via understanding or mechanical pattern matching. Experimental results show
that our approach outperforms existing systems on both benchmark datasets and
the noisy dataset, which demonstrates that the proposed approach understands
the meaning of each quantity in the text more.
|
cs.AI cs.CL
|
we introduce mesys a meaningbased approach for solving english math word problems mwps via understanding and reasoning in this paper it first analyzes the text transforms both body and question parts into their corresponding logic forms and then performs inference on them the associated context of each quantity is represented with proposed roletags eg nsubj verb etc which provides the flexibility for annotating an extracted math quantity with its associated context information ie the physical meaning of this quantity statistical models are proposed to select the operator and operands a noisy dataset is designed to assess if a solver solves mwps mainly via understanding or mechanical pattern matching experimental results show that our approach outperforms existing systems on both benchmark datasets and the noisy dataset which demonstrates that the proposed approach understands the meaning of each quantity in the text more
|
[['we', 'introduce', 'mesys', 'a', 'meaningbased', 'approach', 'for', 'solving', 'english', 'math', 'word', 'problems', 'mwps', 'via', 'understanding', 'and', 'reasoning', 'in', 'this', 'paper', 'it', 'first', 'analyzes', 'the', 'text', 'transforms', 'both', 'body', 'and', 'question', 'parts', 'into', 'their', 'corresponding', 'logic', 'forms', 'and', 'then', 'performs', 'inference', 'on', 'them', 'the', 'associated', 'context', 'of', 'each', 'quantity', 'is', 'represented', 'with', 'proposed', 'roletags', 'eg', 'nsubj', 'verb', 'etc', 'which', 'provides', 'the', 'flexibility', 'for', 'annotating', 'an', 'extracted', 'math', 'quantity', 'with', 'its', 'associated', 'context', 'information', 'ie', 'the', 'physical', 'meaning', 'of', 'this', 'quantity', 'statistical', 'models', 'are', 'proposed', 'to', 'select', 'the', 'operator', 'and', 'operands', 'a', 'noisy', 'dataset', 'is', 'designed', 'to', 'assess', 'if', 'a', 'solver', 'solves', 'mwps', 'mainly', 'via', 'understanding', 'or', 'mechanical', 'pattern', 'matching', 'experimental', 'results', 'show', 'that', 'our', 'approach', 'outperforms', 'existing', 'systems', 'on', 'both', 'benchmark', 'datasets', 'and', 'the', 'noisy', 'dataset', 'which', 'demonstrates', 'that', 'the', 'proposed', 'approach', 'understands', 'the', 'meaning', 'of', 'each', 'quantity', 'in', 'the', 'text', 'more']]
|
[-0.048940255941883865, -0.016630439246237864, -0.07210573824662445, 0.05571253917287981, -0.120412681164031, -0.13951275257926865, 0.03813585767647305, 0.3745445628191574, -0.29081931555022794, -0.3437684858960194, 0.08372100714958557, -0.30740268716750585, -0.1838942830319233, 0.22404871278854113, -0.108953061492513, 0.04526954670639142, 0.11957176731717166, 0.07222121110374945, -0.038812214037929865, -0.2399527621877285, 0.30955909712213103, 0.02194585800980744, 0.31405604227979167, 0.03977818771913324, 0.1449115225518851, -0.015789326540180955, -0.08800673683130088, -0.0037518184163027267, -0.05823274706779267, 0.17842482501114515, 0.2968034017303053, 0.23074507406926242, 0.3080721307356936, -0.3754970354662425, -0.18950139368087918, 0.07459152427812417, 0.1208942903181921, 0.07865515960461841, -0.011546149958398335, -0.34350044714907807, 0.08297155584306523, -0.14046518827883014, 0.01100850223219427, -0.13583631041135802, 0.02252131586799911, -0.049986122894789216, -0.27118281609095307, 0.0635564773330006, 0.10961622532889032, 0.056445206528988434, -0.06652776340269011, -0.12500756905090227, 0.014503062515438574, 0.1330457780884741, 0.03061879835466085, 0.04213139782507863, 0.13517527937116372, -0.13552630626245576, -0.14306189897183355, 0.41979887918906583, -0.013670622086003963, -0.2675085659071371, 0.19163352122152413, -0.04804808091358754, -0.1412379704888208, 0.04330036512818997, 0.1929992015146232, 0.12053141889054382, -0.16801597220499231, 0.03754394633174145, -0.06990430283400675, 0.2061273605508757, 0.05604121292117929, 0.014208044775802156, 0.17463833802933063, 0.21900011815022732, -0.013730003386719045, 0.1521925954165045, -0.05414672904125705, -0.09640605620823908, -0.23836161223817212, -0.14405083849999137, -0.18807129178911555, -0.047913045399700815, -0.06803585850391992, -0.14549881031574763, 0.39451921569264453, 0.2505507512267787, 0.16902795799778422, 0.09329070695136013, 0.3129844200270979, 0.06587078782436236, 0.05263049545923739, 0.09573591284730566, 0.12142034413198521, 0.04556507030097039, 0.1206562800022463, -0.18586981492926893, 0.09376236529130003, 0.08507671116925505]
|
1,803.06065
|
The compression body graph has infinite diameter
|
We show that the compression body graph has infinite diameter.
|
math.GT
|
we show that the compression body graph has infinite diameter
|
[['we', 'show', 'that', 'the', 'compression', 'body', 'graph', 'has', 'infinite', 'diameter']]
|
[-0.1903625290840864, 0.14094626288861037, -0.14460775963962078, -0.07678419165313244, -0.09466339685022832, -0.0570832097902894, -0.07384317331016063, 0.513373589515686, -0.2816661700606346, -0.22918932884931564, 0.12456945297308267, -0.33837637547403576, -0.21948363203555346, 0.07618697509169578, -0.14881233870983124, 0.06123007163405418, 0.20744594223797322, 0.16479287818074226, 0.02159102747682482, -0.2148170284606749, 0.248657872248441, -0.06635344997048379, 0.2311983896419406, 0.12439412623643875, 0.19001763667911292, 0.053190379636362195, 0.06310373600572347, 0.1936311438679695, -0.23698633800158858, 0.10619778716936708, 0.1854435194283724, 0.2124266006052494, 0.2091819666326046, -0.38531630784273146, -0.33714174330234525, 0.13181599751114845, 0.15155263601336627, 0.10660957135260105, -0.06088615246117115, -0.15657247919589282, 0.20279177101328968, -0.22017064653337, -0.08185683032497763, 0.031599891185760495, 0.20602159723639488, 0.00014034565538167953, -0.17415384585037827, -0.029711280018091202, 0.15664695166051387, 0.030036084074527025, -0.011502841673791408, -0.1639249232597649, 0.06250341311097145, 0.12728941962122917, 0.007777089811861515, 0.0370450412388891, 0.13325305175967514, -0.02778987092897296, -0.1261082947254181, 0.327545465901494, -0.04542020205408335, -0.1835456809028983, 0.1781623713672161, -0.19357933644205333, -0.14131612330675125, 0.11567929983139039, 0.18368307640776038, -0.009923431812785566, -0.00875203125178814, 0.16519509851932526, -0.17980450708419085, 0.25685252994298935, 0.22263466119766234, -0.0626455754507333, 0.07390275374054908, 0.21445997022092342, 0.1970025829039514, 0.35656019002199174, -0.09173671752214432, 0.0069936376065015795, -0.21765880286693573, -0.12072873590514063, -0.2933561973273754, 0.065815868973732, -0.2722381793893874, -0.22911081165075303, 0.31149164168164134, 0.10847684387117625, 0.17035673689097167, 0.11664474317803979, 0.2986960202455521, 0.03512227889150381, 0.12928751655854284, 0.21208390882238745, 0.23969843089580536, 0.13501912467181681, -0.03788708932697773, -0.1741405986249447, 0.052374759851954875, 0.11876708641648293]
|
1,803.06066
|
Study of Total Electron Content-TEC and electron density profile during
geomagnetic storms
|
Total Electron Content (TEC) and electron density are the basic parameters,
which determine the major properties of the Ionosphere. Detail study of the
ionospheric TEC and electron density variations has been carried out during
geomagnetic storms, with longitude and latitude, for four different locations:
(24{\deg}W-14{\deg}W, 25{\deg}S-10{\deg}S); (53{\deg}W- 46{\deg}W,
04{\deg}N-14{\deg}N); (161{\deg}E-165{\deg}E, 42{\deg}S-34{\deg}S), and
(135{\deg}W- 120{\deg}W, 39{\deg}S-35{\deg}S) using the COSMIC satellite data.
In order to find the background conditions of the ionosphere, the solar wind
parameters such as north-south component of inter planetary magnetic field
(Bz), plasma velocity (Vsw), AE, Dst and Kp indices, have also been correlated
with the TEC and electron density. The results illustrates that the observed
TEC and electron density profile significantly vary with longitudes and
latitudes as well. This study illustrates that the values of TEC and the
vertical electron density profile are influenced by the solar wind parameters
associated with solar activities. The peak value of electron density and TEC
increase as the geomagnetic storms becomes stronger. Similarly, the electron
density profile vary with altitudes which peaks around the altitude range of
about 180-280 km, depending on the strength of geomagnetic storms. The results
clearly show that the peak electron density shifted to higher altitude (from
about 180 km to 300 km) as the geomagnetic disturbances becomes stronger.
|
physics.space-ph physics.ao-ph
|
total electron content tec and electron density are the basic parameters which determine the major properties of the ionosphere detail study of the ionospheric tec and electron density variations has been carried out during geomagnetic storms with longitude and latitude for four different locations 24degw14degw 25degs10degs 53degw 46degw 04degn14degn 161dege165dege 42degs34degs and 135degw 120degw 39degs35degs using the cosmic satellite data in order to find the background conditions of the ionosphere the solar wind parameters such as northsouth component of inter planetary magnetic field bz plasma velocity vsw ae dst and kp indices have also been correlated with the tec and electron density the results illustrates that the observed tec and electron density profile significantly vary with longitudes and latitudes as well this study illustrates that the values of tec and the vertical electron density profile are influenced by the solar wind parameters associated with solar activities the peak value of electron density and tec increase as the geomagnetic storms becomes stronger similarly the electron density profile vary with altitudes which peaks around the altitude range of about 180280 km depending on the strength of geomagnetic storms the results clearly show that the peak electron density shifted to higher altitude from about 180 km to 300 km as the geomagnetic disturbances becomes stronger
|
[['total', 'electron', 'content', 'tec', 'and', 'electron', 'density', 'are', 'the', 'basic', 'parameters', 'which', 'determine', 'the', 'major', 'properties', 'of', 'the', 'ionosphere', 'detail', 'study', 'of', 'the', 'ionospheric', 'tec', 'and', 'electron', 'density', 'variations', 'has', 'been', 'carried', 'out', 'during', 'geomagnetic', 'storms', 'with', 'longitude', 'and', 'latitude', 'for', 'four', 'different', 'locations', '24degw14degw', '25degs10degs', '53degw', '46degw', '04degn14degn', '161dege165dege', '42degs34degs', 'and', '135degw', '120degw', '39degs35degs', 'using', 'the', 'cosmic', 'satellite', 'data', 'in', 'order', 'to', 'find', 'the', 'background', 'conditions', 'of', 'the', 'ionosphere', 'the', 'solar', 'wind', 'parameters', 'such', 'as', 'northsouth', 'component', 'of', 'inter', 'planetary', 'magnetic', 'field', 'bz', 'plasma', 'velocity', 'vsw', 'ae', 'dst', 'and', 'kp', 'indices', 'have', 'also', 'been', 'correlated', 'with', 'the', 'tec', 'and', 'electron', 'density', 'the', 'results', 'illustrates', 'that', 'the', 'observed', 'tec', 'and', 'electron', 'density', 'profile', 'significantly', 'vary', 'with', 'longitudes', 'and', 'latitudes', 'as', 'well', 'this', 'study', 'illustrates', 'that', 'the', 'values', 'of', 'tec', 'and', 'the', 'vertical', 'electron', 'density', 'profile', 'are', 'influenced', 'by', 'the', 'solar', 'wind', 'parameters', 'associated', 'with', 'solar', 'activities', 'the', 'peak', 'value', 'of', 'electron', 'density', 'and', 'tec', 'increase', 'as', 'the', 'geomagnetic', 'storms', 'becomes', 'stronger', 'similarly', 'the', 'electron', 'density', 'profile', 'vary', 'with', 'altitudes', 'which', 'peaks', 'around', 'the', 'altitude', 'range', 'of', 'about', '180280', 'km', 'depending', 'on', 'the', 'strength', 'of', 'geomagnetic', 'storms', 'the', 'results', 'clearly', 'show', 'that', 'the', 'peak', 'electron', 'density', 'shifted', 'to', 'higher', 'altitude', 'from', 'about', '180', 'km', 'to', '300', 'km', 'as', 'the', 'geomagnetic', 'disturbances', 'becomes', 'stronger']]
|
[-0.12053453948334861, 0.2240444429407582, 0.0025233079016727593, 0.09619112052336168, 0.0033546162090869213, -0.028840959571366804, -0.0179724742192775, 0.3739772350040834, -0.20168896442029013, -0.3994619708267314, 0.0567402252493037, -0.2901184258713799, -0.09777756583232859, 0.21044886470812868, -0.010534373452581132, -0.01010976795537747, 0.0069751872945187695, 0.011914646985074181, -0.07115634766183458, -0.1696240667853764, 0.21444854380294162, 0.18328838484316592, 0.24375923086346976, 0.08131870185140873, 0.07589438411729198, -0.060987101953513735, -0.03911119145549723, 0.03346240943974227, -0.09660948752802802, 0.04162929421267588, 0.21191919614811108, 0.0670424025582233, 0.18381511563648337, -0.45441025180078404, -0.2764886024266722, -0.01745447107539767, 0.09471513110847764, -0.03296357909850521, -0.0016744806024649027, -0.2604144189775509, 0.032450399055743394, -0.17424856641663433, -0.1921190448540879, 0.046493879797409716, 0.06578527835593906, 0.10838486726595024, -0.28507023174616863, 0.13551287779446103, -0.02432998687211906, 0.16669842956671074, -0.11091927724510468, -0.14220351635232864, -0.12330440937458023, 0.1043274208917213, 0.17235552354030015, 0.06174334817431608, 0.24876799373146127, -0.058147159528997336, 3.724887188690812e-05, 0.37592282948728223, -0.093827448743604, -0.04428734335543319, 0.15786869060919986, -0.26683684262859436, -0.0881427430445838, 0.1943645485160196, 0.16648480161707108, 0.012181399964648693, -0.09998885141592936, -0.011166231225439305, -0.05229472515024986, 0.18901276779337903, 0.14819919443063773, 0.020767054705885215, 0.26489572813827084, 0.04941650437404267, 0.14501108270977156, 0.03435687692656381, -0.2953073349008128, -0.03304414162632374, -0.18732252409357336, -0.08854541820601389, -0.08883489487780749, 0.012947049466846742, -0.1021808316479078, -0.13848885734662858, 0.482283562227194, 0.1939468362220373, 0.18534969463591136, -0.04747443823190174, 0.3166983736058076, 0.16289338751450477, 0.04112775440545595, 0.14398704121695527, 0.25515335346039253, 0.1833189331002033, 0.18103058054459406, -0.2481771128968016, 0.11904620127845092, -0.0017904697370655204]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.