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.03667
|
Co-occurrence of the Benford-like and Zipf Laws Arising from the Texts
Representing Human and Artificial Languages
|
We demonstrate that large texts, representing human (English, Russian,
Ukrainian) and artificial (C++, Java) languages, display quantitative patterns
characterized by the Benford-like and Zipf laws. The frequency of a word
following the Zipf law is inversely proportional to its rank, whereas the total
numbers of a certain word appearing in the text generate the uneven
Benford-like distribution of leading numbers. Excluding the most popular words
essentially improves the correlation of actual textual data with the Zipfian
distribution, whereas the Benford distribution of leading numbers (arising from
the overall amount of a certain word) is insensitive to the same elimination
procedure. The calculated values of the moduli of slopes of double
logarithmical plots for artificial languages (C++, Java) are markedly larger
than those for human ones.
|
cs.CL physics.soc-ph stat.OT
|
we demonstrate that large texts representing human english russian ukrainian and artificial c java languages display quantitative patterns characterized by the benfordlike and zipf laws the frequency of a word following the zipf law is inversely proportional to its rank whereas the total numbers of a certain word appearing in the text generate the uneven benfordlike distribution of leading numbers excluding the most popular words essentially improves the correlation of actual textual data with the zipfian distribution whereas the benford distribution of leading numbers arising from the overall amount of a certain word is insensitive to the same elimination procedure the calculated values of the moduli of slopes of double logarithmical plots for artificial languages c java are markedly larger than those for human ones
|
[['we', 'demonstrate', 'that', 'large', 'texts', 'representing', 'human', 'english', 'russian', 'ukrainian', 'and', 'artificial', 'c', 'java', 'languages', 'display', 'quantitative', 'patterns', 'characterized', 'by', 'the', 'benfordlike', 'and', 'zipf', 'laws', 'the', 'frequency', 'of', 'a', 'word', 'following', 'the', 'zipf', 'law', 'is', 'inversely', 'proportional', 'to', 'its', 'rank', 'whereas', 'the', 'total', 'numbers', 'of', 'a', 'certain', 'word', 'appearing', 'in', 'the', 'text', 'generate', 'the', 'uneven', 'benfordlike', 'distribution', 'of', 'leading', 'numbers', 'excluding', 'the', 'most', 'popular', 'words', 'essentially', 'improves', 'the', 'correlation', 'of', 'actual', 'textual', 'data', 'with', 'the', 'zipfian', 'distribution', 'whereas', 'the', 'benford', 'distribution', 'of', 'leading', 'numbers', 'arising', 'from', 'the', 'overall', 'amount', 'of', 'a', 'certain', 'word', 'is', 'insensitive', 'to', 'the', 'same', 'elimination', 'procedure', 'the', 'calculated', 'values', 'of', 'the', 'moduli', 'of', 'slopes', 'of', 'double', 'logarithmical', 'plots', 'for', 'artificial', 'languages', 'c', 'java', 'are', 'markedly', 'larger', 'than', 'those', 'for', 'human', 'ones']]
|
[-0.11610000836662948, 0.13417693903684857, -0.07067101390235414, 0.13326309511733309, -0.08969652050409496, -0.13272889782258165, 0.07299369640792228, 0.3113609484086434, -0.2881654401748002, -0.33235999730953236, 0.010919660646884845, -0.3374369839675785, -0.1054931313738348, 0.21251380387589533, -0.08598210186069563, 0.036239564793238345, 0.03945386622525085, 0.08097563223625587, -0.03774916348274707, -0.23962257485988178, 0.3174874067185371, 0.02528600609005709, 0.3546477223318676, -0.03525228440246689, 0.058809105955193015, -0.04352455568212137, -0.10830712313877373, -0.014697666359474747, -0.06643018109859507, 0.15138373055639184, 0.287053286565498, 0.1656445842917736, 0.24926557329728702, -0.351132924191472, -0.12462424269566934, 0.09120299648947833, 0.1135374329973777, 0.06887526061325296, 0.02959616223304737, -0.27654405710158675, 0.09226251866411024, -0.1847760836173576, -0.07844760312464058, -0.01958312676477481, 0.10713028366491956, 0.08056780010721139, -0.20667665329103063, 0.09156737249435448, 0.0772900224390735, 0.12423798367305379, -0.01949390891388795, -0.18582312950516136, -0.04175843548302243, 0.16655541399524101, 0.1151131139689587, 0.02249812528044288, 0.13292720023830368, -0.1646760130481893, -0.10315743144327108, 0.4122256972198564, -0.04548050488624059, -0.17985651079694007, 0.15046685104205357, -0.15407741067143596, -0.1011610627439388, 0.12417765265156523, 0.13459251544105147, 0.05870572777756734, -0.10934472069185894, 0.05281036697011971, -0.06589180282582112, 0.24093037726153144, 0.16015114395583913, 0.0036805561380233707, 0.15082373450002898, 0.13230146493429576, -0.03674865009384305, 0.15500432413025964, -0.0778605277627343, -0.10568327129614062, -0.25385005366269164, -0.12416613640309107, -0.18935070139530108, 0.003959013300576831, -0.1745885100243594, -0.21747939741310884, 0.3919460990322315, 0.12302665884428604, 0.18176327262649206, 0.14739024424849728, 0.23220136400872493, 0.0938285091831311, 0.12564698165108457, 0.0749138720310861, 0.10805408257567059, 0.0443570009239654, 0.13898064750549574, -0.1809396584796515, 0.15114152415965995, 0.036555032855338926]
|
1,803.03668
|
Coupling tunable D-band directional coupler for millimeter-wave
applications
|
A coupling tunable D-band directional coupler is designed based on a novel
coupling grid structure proposed in this letter. The designed directional
coupler has excellent performance with ultra-wideband. The coupling can be
tuned from -28.2 dB to -33.2 dB at 140 GHz by changing the angle of the
coupling grid, and the dynamic range of the coupling is about 5 dB. The return
loss is smaller than -15 dB in the whole D-band from 110 GHz to 170 GHz. A 3-dB
coupler use the similar coupling structure is also designed. The coupling is
3.3144 dB at the center frequency of 140 GHz.
|
physics.ins-det
|
a coupling tunable dband directional coupler is designed based on a novel coupling grid structure proposed in this letter the designed directional coupler has excellent performance with ultrawideband the coupling can be tuned from 282 db to 332 db at 140 ghz by changing the angle of the coupling grid and the dynamic range of the coupling is about 5 db the return loss is smaller than 15 db in the whole dband from 110 ghz to 170 ghz a 3db coupler use the similar coupling structure is also designed the coupling is 33144 db at the center frequency of 140 ghz
|
[['a', 'coupling', 'tunable', 'dband', 'directional', 'coupler', 'is', 'designed', 'based', 'on', 'a', 'novel', 'coupling', 'grid', 'structure', 'proposed', 'in', 'this', 'letter', 'the', 'designed', 'directional', 'coupler', 'has', 'excellent', 'performance', 'with', 'ultrawideband', 'the', 'coupling', 'can', 'be', 'tuned', 'from', '282', 'db', 'to', '332', 'db', 'at', '140', 'ghz', 'by', 'changing', 'the', 'angle', 'of', 'the', 'coupling', 'grid', 'and', 'the', 'dynamic', 'range', 'of', 'the', 'coupling', 'is', 'about', '5', 'db', 'the', 'return', 'loss', 'is', 'smaller', 'than', '15', 'db', 'in', 'the', 'whole', 'dband', 'from', '110', 'ghz', 'to', '170', 'ghz', 'a', '3db', 'coupler', 'use', 'the', 'similar', 'coupling', 'structure', 'is', 'also', 'designed', 'the', 'coupling', 'is', '33144', 'db', 'at', 'the', 'center', 'frequency', 'of', '140', 'ghz']]
|
[-0.16335102526867523, 0.12325841051037653, 0.03900951419791004, -0.050106155607701826, -0.07003470081467145, -0.19693788468819295, 0.11365705232440244, 0.446041181462236, -0.2202773249090308, -0.3726751750869916, 0.07023890429674325, -0.232955481036391, -0.07575438955872513, 0.1947719172475454, 0.008553452769036192, 0.015639240839656923, 0.01188621034910257, -0.016235530883590185, -0.07316110482310305, -0.1178918724077394, 0.2096802691265129, 0.14556102377321053, 0.3683757319087439, 0.06266874154467172, 0.12179082453638168, -0.049770749327357824, 0.07686306409408698, -0.08873774189649537, -0.08432472935223048, 0.07093926320903667, 0.22460845691880377, -0.007778746223464461, 0.25767892889106775, -0.2581335623739379, -0.16389291595072844, 0.02002625789788395, 0.08332391103296218, 0.07945664421111198, 0.02167873699817401, -0.30047510811450456, 0.09963191783811787, -0.2064682427300417, -0.09089801074605029, 0.049009595716390575, -0.01802894658879331, -0.01216624461409479, -0.30465592799528435, 0.06860403366828347, 0.016447140521711052, 0.08689136135548649, -0.012152002342875199, -0.13449647314477675, -0.05777846695394209, 0.06772471795614698, -0.126406219836306, 0.08483566255723633, 0.1504684062213591, -0.03562872769371007, -0.10053381964213925, 0.3903618378951998, -0.13646123492655154, -0.13475809092541216, 0.17017678853059834, -0.1435152695809334, 0.050873659938426304, 0.21891016064045749, 0.19012748523347892, 0.05445786513904534, -0.12852333392486862, 0.041447229710485936, 0.03259075373079222, 0.3072826177859218, 0.18094125417715842, 0.07818026979002032, 0.18849551770144538, 0.20367933773680008, 0.07269000539747482, 0.16323232456078143, -0.21362662718211772, -0.046853012027274266, -0.2230134554308756, -0.0702901128771724, -0.19633063054263206, 0.08550360055391372, -0.15156188659761263, -0.027344348139618294, 0.46104889444195396, 0.15598132214186214, 0.15581369992013616, 0.008781673571113313, 0.31558176941505756, 0.12165849294402811, 0.1522112932784649, 0.07480540277325723, 0.3979049724443714, 0.1873725404395805, 0.13738181412976125, -0.2012722142372686, -0.01790551244198243, -0.10534841468151991]
|
1,803.03669
|
Provably robust estimation of modulo 1 samples of a smooth function with
applications to phase unwrapping
|
Consider an unknown smooth function $f: [0,1]^d \rightarrow \mathbb{R}$, and
say we are given $n$ noisy mod 1 samples of $f$, i.e., $y_i = (f(x_i) +
\eta_i)\mod 1$, for $x_i \in [0,1]^d$, where $\eta_i$ denotes the noise. Given
the samples $(x_i,y_i)_{i=1}^{n}$, our goal is to recover smooth, robust
estimates of the clean samples $f(x_i) \bmod 1$. We formulate a natural
approach for solving this problem, which works with angular embeddings of the
noisy mod 1 samples over the unit circle, inspired by the angular
synchronization framework. This amounts to solving a smoothness regularized
least-squares problem -- a quadratically constrained quadratic program (QCQP)
-- where the variables are constrained to lie on the unit circle. Our approach
is based on solving its relaxation, which is a trust-region sub-problem and
hence solvable efficiently. We provide theoretical guarantees demonstrating its
robustness to noise for adversarial, and random Gaussian and Bernoulli noise
models. To the best of our knowledge, these are the first such theoretical
results for this problem. We demonstrate the robustness and efficiency of our
approach via extensive numerical simulations on synthetic data, along with a
simple least-squares solution for the unwrapping stage, that recovers the
original samples of $f$ (up to a global shift). It is shown to perform well at
high levels of noise, when taking as input the denoised modulo $1$ samples.
Finally, we also consider two other approaches for denoising the modulo 1
samples that leverage tools from Riemannian optimization on manifolds,
including a Burer-Monteiro approach for a semidefinite programming relaxation
of our formulation. For the two-dimensional version of the problem, which has
applications in radar interferometry, we are able to solve instances of
real-world data with a million sample points in under 10 seconds, on a personal
laptop.
|
stat.ML
|
consider an unknown smooth function f 01d rightarrow mathbbr and say we are given n noisy mod 1 samples of f ie y_i fx_i eta_imod 1 for x_i in 01d where eta_i denotes the noise given the samples x_iy_i_i1n our goal is to recover smooth robust estimates of the clean samples fx_i bmod 1 we formulate a natural approach for solving this problem which works with angular embeddings of the noisy mod 1 samples over the unit circle inspired by the angular synchronization framework this amounts to solving a smoothness regularized leastsquares problem a quadratically constrained quadratic program qcqp where the variables are constrained to lie on the unit circle our approach is based on solving its relaxation which is a trustregion subproblem and hence solvable efficiently we provide theoretical guarantees demonstrating its robustness to noise for adversarial and random gaussian and bernoulli noise models to the best of our knowledge these are the first such theoretical results for this problem we demonstrate the robustness and efficiency of our approach via extensive numerical simulations on synthetic data along with a simple leastsquares solution for the unwrapping stage that recovers the original samples of f up to a global shift it is shown to perform well at high levels of noise when taking as input the denoised modulo 1 samples finally we also consider two other approaches for denoising the modulo 1 samples that leverage tools from riemannian optimization on manifolds including a burermonteiro approach for a semidefinite programming relaxation of our formulation for the twodimensional version of the problem which has applications in radar interferometry we are able to solve instances of realworld data with a million sample points in under 10 seconds on a personal laptop
|
[['consider', 'an', 'unknown', 'smooth', 'function', 'f', '01d', 'rightarrow', 'mathbbr', 'and', 'say', 'we', 'are', 'given', 'n', 'noisy', 'mod', '1', 'samples', 'of', 'f', 'ie', 'y_i', 'fx_i', 'eta_imod', '1', 'for', 'x_i', 'in', '01d', 'where', 'eta_i', 'denotes', 'the', 'noise', 'given', 'the', 'samples', 'x_iy_i_i1n', 'our', 'goal', 'is', 'to', 'recover', 'smooth', 'robust', 'estimates', 'of', 'the', 'clean', 'samples', 'fx_i', 'bmod', '1', 'we', 'formulate', 'a', 'natural', 'approach', 'for', 'solving', 'this', 'problem', 'which', 'works', 'with', 'angular', 'embeddings', 'of', 'the', 'noisy', 'mod', '1', 'samples', 'over', 'the', 'unit', 'circle', 'inspired', 'by', 'the', 'angular', 'synchronization', 'framework', 'this', 'amounts', 'to', 'solving', 'a', 'smoothness', 'regularized', 'leastsquares', 'problem', 'a', 'quadratically', 'constrained', 'quadratic', 'program', 'qcqp', 'where', 'the', 'variables', 'are', 'constrained', 'to', 'lie', 'on', 'the', 'unit', 'circle', 'our', 'approach', 'is', 'based', 'on', 'solving', 'its', 'relaxation', 'which', 'is', 'a', 'trustregion', 'subproblem', 'and', 'hence', 'solvable', 'efficiently', 'we', 'provide', 'theoretical', 'guarantees', 'demonstrating', 'its', 'robustness', 'to', 'noise', 'for', 'adversarial', 'and', 'random', 'gaussian', 'and', 'bernoulli', 'noise', 'models', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'these', 'are', 'the', 'first', 'such', 'theoretical', 'results', 'for', 'this', 'problem', 'we', 'demonstrate', 'the', 'robustness', 'and', 'efficiency', 'of', 'our', 'approach', 'via', 'extensive', 'numerical', 'simulations', 'on', 'synthetic', 'data', 'along', 'with', 'a', 'simple', 'leastsquares', 'solution', 'for', 'the', 'unwrapping', 'stage', 'that', 'recovers', 'the', 'original', 'samples', 'of', 'f', 'up', 'to', 'a', 'global', 'shift', 'it', 'is', 'shown', 'to', 'perform', 'well', 'at', 'high', 'levels', 'of', 'noise', 'when', 'taking', 'as', 'input', 'the', 'denoised', 'modulo', '1', 'samples', 'finally', 'we', 'also', 'consider', 'two', 'other', 'approaches', 'for', 'denoising', 'the', 'modulo', '1', 'samples', 'that', 'leverage', 'tools', 'from', 'riemannian', 'optimization', 'on', 'manifolds', 'including', 'a', 'burermonteiro', 'approach', 'for', 'a', 'semidefinite', 'programming', 'relaxation', 'of', 'our', 'formulation', 'for', 'the', 'twodimensional', 'version', 'of', 'the', 'problem', 'which', 'has', 'applications', 'in', 'radar', 'interferometry', 'we', 'are', 'able', 'to', 'solve', 'instances', 'of', 'realworld', 'data', 'with', 'a', 'million', 'sample', 'points', 'in', 'under', '10', 'seconds', 'on', 'a', 'personal', 'laptop']]
|
[-0.07903401245700091, 0.00342553220669962, -0.04977399210846117, 0.038024712018538395, -0.06675702822069032, -0.16960470444177622, 0.05291123239167191, 0.38274199803200243, -0.32204502564366466, -0.30768991529425016, 0.12397867921207399, -0.304167505754223, -0.14990927303703241, 0.2007476178085809, -0.10577241774083447, 0.10294380867112936, 0.07349870610987064, 0.03658711464501269, -0.08371518383623211, -0.2973297315953345, 0.2950456407355874, -0.005085917922401136, 0.2260703405681216, -0.026133969083625395, 0.1466692405878208, -0.0018581769964820542, 0.005575966185721621, 0.0017654517440815697, -0.10340690153914095, 0.10435511367851412, 0.2663414246698222, 0.1507386298267288, 0.31752154620208, -0.39772081811137644, -0.1886119844190047, 0.1306981047667511, 0.11759703038415019, 0.06488110852334975, -0.03102094061237962, -0.28419226952470267, 0.12826143300455467, -0.07427091434129052, -0.053274464998654764, -0.09440874194089727, 0.008016830057856607, 0.011971097522565014, -0.3687632022607889, 0.06266970953232873, 0.07180453883524711, 0.040058999707662545, -0.06939365062781225, -0.16100222717928278, 0.04040036651051857, 0.08025905735462242, 0.033770868555525434, 0.07789522334054061, 0.10701136086689686, -0.07944439721401207, -0.11155897599215117, 0.3687716067371356, -0.03770535532242644, -0.2575400552762855, 0.14298033707049004, -0.09543216746085538, -0.15993848584032247, 0.11943527526658523, 0.19803422799177625, 0.17565319282686584, -0.10688268953481066, 0.10467877867041396, -0.07440516496096718, 0.1735923073475959, 0.02630265957148342, -0.02651415704106391, 0.12524581845309193, 0.17106279090899237, 0.1055760649366669, 0.15086605047283635, -0.09708755265394636, -0.0589550477354885, -0.2886750217579253, -0.10392418259207706, -0.23805094553382378, 0.06601993705942198, -0.11437927847670129, -0.13127225599692519, 0.3781767945827825, 0.16361237603070383, 0.225510432313268, 0.1566787021054717, 0.3327332909147327, 0.09545675131420676, 0.014378388838881588, 0.07645456511136535, 0.1400682761617187, 0.11222612700291577, 0.04966045496293337, -0.18304037729235875, 0.008530427220642203, 0.04598460220031675]
|
1,803.0367
|
IcoRating: A Deep-Learning System for Scam ICO Identification
|
Cryptocurrencies (or digital tokens, digital currencies, e.g., BTC, ETH, XRP,
NEO) have been rapidly gaining ground in use, value, and understanding among
the public, bringing astonishing profits to investors. Unlike other money and
banking systems, most digital tokens do not require central authorities. Being
decentralized poses significant challenges for credit rating. Most ICOs are
currently not subject to government regulations, which makes a reliable credit
rating system for ICO projects necessary and urgent.
In this paper, we introduce IcoRating, the first learning--based
cryptocurrency rating system. We exploit natural-language processing techniques
to analyze various aspects of 2,251 digital currencies to date, such as white
paper content, founding teams, Github repositories, websites, etc. Supervised
learning models are used to correlate the life span and the price change of
cryptocurrencies with these features. For the best setting, the proposed system
is able to identify scam ICO projects with 0.83 precision.
We hope this work will help investors identify scam ICOs and attract more
efforts in automatically evaluating and analyzing ICO projects.
|
cs.CL
|
cryptocurrencies or digital tokens digital currencies eg btc eth xrp neo have been rapidly gaining ground in use value and understanding among the public bringing astonishing profits to investors unlike other money and banking systems most digital tokens do not require central authorities being decentralized poses significant challenges for credit rating most icos are currently not subject to government regulations which makes a reliable credit rating system for ico projects necessary and urgent in this paper we introduce icorating the first learningbased cryptocurrency rating system we exploit naturallanguage processing techniques to analyze various aspects of 2251 digital currencies to date such as white paper content founding teams github repositories websites etc supervised learning models are used to correlate the life span and the price change of cryptocurrencies with these features for the best setting the proposed system is able to identify scam ico projects with 083 precision we hope this work will help investors identify scam icos and attract more efforts in automatically evaluating and analyzing ico projects
|
[['cryptocurrencies', 'or', 'digital', 'tokens', 'digital', 'currencies', 'eg', 'btc', 'eth', 'xrp', 'neo', 'have', 'been', 'rapidly', 'gaining', 'ground', 'in', 'use', 'value', 'and', 'understanding', 'among', 'the', 'public', 'bringing', 'astonishing', 'profits', 'to', 'investors', 'unlike', 'other', 'money', 'and', 'banking', 'systems', 'most', 'digital', 'tokens', 'do', 'not', 'require', 'central', 'authorities', 'being', 'decentralized', 'poses', 'significant', 'challenges', 'for', 'credit', 'rating', 'most', 'icos', 'are', 'currently', 'not', 'subject', 'to', 'government', 'regulations', 'which', 'makes', 'a', 'reliable', 'credit', 'rating', 'system', 'for', 'ico', 'projects', 'necessary', 'and', 'urgent', 'in', 'this', 'paper', 'we', 'introduce', 'icorating', 'the', 'first', 'learningbased', 'cryptocurrency', 'rating', 'system', 'we', 'exploit', 'naturallanguage', 'processing', 'techniques', 'to', 'analyze', 'various', 'aspects', 'of', '2251', 'digital', 'currencies', 'to', 'date', 'such', 'as', 'white', 'paper', 'content', 'founding', 'teams', 'github', 'repositories', 'websites', 'etc', 'supervised', 'learning', 'models', 'are', 'used', 'to', 'correlate', 'the', 'life', 'span', 'and', 'the', 'price', 'change', 'of', 'cryptocurrencies', 'with', 'these', 'features', 'for', 'the', 'best', 'setting', 'the', 'proposed', 'system', 'is', 'able', 'to', 'identify', 'scam', 'ico', 'projects', 'with', '083', 'precision', 'we', 'hope', 'this', 'work', 'will', 'help', 'investors', 'identify', 'scam', 'icos', 'and', 'attract', 'more', 'efforts', 'in', 'automatically', 'evaluating', 'and', 'analyzing', 'ico', 'projects']]
|
[-0.07028252633586861, -0.00829423176581988, -0.028740803408575898, 0.11603965714760682, -0.16696460115929654, -0.21194801307534297, 0.10785707593533005, 0.41303809903963595, -0.20947096842092958, -0.3324946563817773, 0.15523296124427327, -0.38197813884610965, -0.11544354219396716, 0.1854064815732076, -0.18354076816781262, 0.036155407944719255, 0.05195870289710088, -0.0019332225128456191, 0.019982177120059015, -0.34642323950712683, 0.26226731690070676, 0.056022128388620245, 0.33533519805369977, 0.03506885111906348, 0.04968920298768375, -0.044772223204173546, -0.10025960873724603, -0.051896932063635416, -0.09767178261741817, 0.1598351617729916, 0.4079898906334955, 0.24841173904847555, 0.4036580262047623, -0.4108976701770848, -0.10450423919560226, 0.16365881968435309, 0.1201728145496238, 0.09077294606054592, -0.03489828846895925, -0.3112748866541099, 0.05441903563015565, -0.28889798602329086, -0.07194586500280097, -0.12849154765369136, 0.033889422368838226, 0.028884463235289752, -0.20483370108842225, -0.013150472017939197, -0.011217385212595235, 0.10246568286239342, -0.022626289351938104, -0.14533931968669536, -0.004237666866229011, 0.24379751405645228, 0.0990493010470231, -0.025637338914062193, 0.178945607208078, -0.14721007714003415, -0.163869602816224, 0.40127712340703414, 0.0072801536476116875, -0.09478045373661499, 0.1736029722605146, -0.05500784629403786, -0.18884980754123745, 0.04347269493294601, 0.24694753920068285, 0.013071401057274131, -0.24186145937109288, -0.029850497102214324, 0.0008751875327929331, 0.24072588144308013, 0.06856223590348563, 0.04949033805319041, 0.2468935001284598, 0.19091826031809886, 0.07660682653327902, 0.042328755761995844, -0.015754658871045903, -0.13267631019036213, -0.14175703691131808, -0.13905552595653042, -0.10466954470082314, 0.025830140917507575, -0.015200899681250681, -0.151740338603135, 0.3468707665734127, 0.24826993452507756, 0.0580055003610724, 0.02685467560404722, 0.31188778782648197, -0.008948500748461636, 0.12601225926473872, 0.11638717300713085, 0.17559542086234728, -0.05983926288638554, 0.24337322159229727, -0.09242496887935761, 0.17493729161176674, -0.016111930158870396]
|
1,803.03671
|
Unique dynamic crossover in supercooled x,3-dihydroxypropyl acrylate (x
= 1, 2) isomers mixture
|
The previtreous dynamics in glass forming monomer, glycerol monoacrylate
(GMA), using broadband dielectric spectroscopy (BDS) was tested. Measurements
revealed the clear dynamic crossover at temperature $T_B = 254$ K and the time
scale $\tau(T_B) = 5.4$ ns for the primary (structural) relaxation time and no
hallmarks for the crossover for the DC electric conductivity $\sigma_{DC}$.
This result was revealed via the derivative-based and distortions-sensitive
analysis $dln{H_{a}}/d(1/T)$ vs. $1/T$, where $H_a$ is for the apparent
activation energy. Subsequent tests of the fractional Debye-Stokes-Einsten
relation $\sigma_{DC}(\tau_{\alpha})^S = const$ showed that the crossover is
associated with $S = 1$ (for $T>T_B$)->$S = 0.84$ (for $T<T_B$). The crossover
is associated with the emergence of the secondary beta relaxation which
smoothly develops deeply into the solid amorphous phase below the glass
temperature $T_g$.
|
cond-mat.soft
|
the previtreous dynamics in glass forming monomer glycerol monoacrylate gma using broadband dielectric spectroscopy bds was tested measurements revealed the clear dynamic crossover at temperature t_b 254 k and the time scale taut_b 54 ns for the primary structural relaxation time and no hallmarks for the crossover for the dc electric conductivity sigma_dc this result was revealed via the derivativebased and distortionssensitive analysis dlnh_ad1t vs 1t where h_a is for the apparent activation energy subsequent tests of the fractional debyestokeseinsten relation sigma_dctau_alphas const showed that the crossover is associated with s 1 for tt_bs 084 for tt_b the crossover is associated with the emergence of the secondary beta relaxation which smoothly develops deeply into the solid amorphous phase below the glass temperature t_g
|
[['the', 'previtreous', 'dynamics', 'in', 'glass', 'forming', 'monomer', 'glycerol', 'monoacrylate', 'gma', 'using', 'broadband', 'dielectric', 'spectroscopy', 'bds', 'was', 'tested', 'measurements', 'revealed', 'the', 'clear', 'dynamic', 'crossover', 'at', 'temperature', 't_b', '254', 'k', 'and', 'the', 'time', 'scale', 'taut_b', '54', 'ns', 'for', 'the', 'primary', 'structural', 'relaxation', 'time', 'and', 'no', 'hallmarks', 'for', 'the', 'crossover', 'for', 'the', 'dc', 'electric', 'conductivity', 'sigma_dc', 'this', 'result', 'was', 'revealed', 'via', 'the', 'derivativebased', 'and', 'distortionssensitive', 'analysis', 'dlnh_ad1t', 'vs', '1t', 'where', 'h_a', 'is', 'for', 'the', 'apparent', 'activation', 'energy', 'subsequent', 'tests', 'of', 'the', 'fractional', 'debyestokeseinsten', 'relation', 'sigma_dctau_alphas', 'const', 'showed', 'that', 'the', 'crossover', 'is', 'associated', 'with', 's', '1', 'for', 'tt_bs', '084', 'for', 'tt_b', 'the', 'crossover', 'is', 'associated', 'with', 'the', 'emergence', 'of', 'the', 'secondary', 'beta', 'relaxation', 'which', 'smoothly', 'develops', 'deeply', 'into', 'the', 'solid', 'amorphous', 'phase', 'below', 'the', 'glass', 'temperature', 't_g']]
|
[-0.10141670423276399, 0.24393105863026626, -0.09415011051029938, 0.0019440963722603477, 0.005836496451545669, -0.17360578224103412, 0.07437161045229954, 0.3566518155776936, -0.24879381296442538, -0.2743166596993156, 0.07442742295704945, -0.2981980233412722, -0.07779741270629609, 0.15640910122158896, 0.08231056330968504, 0.019462667779146653, -0.05563119663249539, 0.014171139932359042, -0.10259244657303813, -0.13164188494176968, 0.24494816929344898, 0.030579157776968634, 0.2988889019936323, 0.10144301367842633, 0.05820613167256258, -0.007291679766596011, 0.04352774415165186, 0.02855459733704186, -0.19802755323756213, -0.04698473451578099, 0.2421850355402769, -0.016339703301048798, 0.19309964321715675, -0.36993441005115923, -0.21540412068210096, 0.04716131100431085, 0.10336270780181107, 0.002736012543470639, -0.03240495132201392, -0.22207207961979766, 0.05606987471540418, -0.06687668719045493, -0.11548171430907171, -0.027172743804428887, 0.07489833827737881, -0.016966735316521448, -0.252560027162342, 0.19648140675752707, 0.06506098585770181, 0.10536526338723691, -0.12227378039742294, -0.15381092869312218, -0.018738422006287652, 0.055400874093174936, 0.03285609377021699, 0.0874944469744704, 0.18837644459841693, -0.08560723415980845, -0.05242476531344911, 0.33092565780262584, -0.08430384578760308, -0.009682204201817512, 0.2028709729374184, -0.21257068114355207, -0.07926270044813662, 0.22811979280541772, 0.056418009563956574, 0.09070355675750129, -0.14174929372966288, 0.047262169413126845, 0.038572889112907904, 0.22956865715753774, 0.074383621784332, -0.01303234152070692, 0.20576085343794978, 0.23298106686131137, -0.012751379665797171, 0.16920405785026757, -0.16473432178507844, -0.08675623881610353, -0.24023602633109398, -0.18872036220829772, -0.18767134736383173, 0.06743976520070726, -0.12845168036330268, -0.12776957385991092, 0.3523138252613337, 0.04990538161085999, 0.19858203761117613, 0.0708613073706384, 0.21977327860228757, 0.12941731747300567, 0.06680733416857117, 0.04917401497128278, 0.24719003502522474, 0.16325922710922264, 0.1846548356277787, -0.33503510840642065, 0.07129382335621377, 0.008103612721290277]
|
1,803.03672
|
Competitive Machine Learning: Best Theoretical Prediction vs
Optimization
|
Machine learning is often used in competitive scenarios: Participants learn
and fit static models, and those models compete in a shared platform. The
common assumption is that in order to win a competition one has to have the
best predictive model, i.e., the model with the smallest out-sample error. Is
that necessarily true? Does the best theoretical predictive model for a target
always yield the best reward in a competition? If not, can one take the best
model and purposefully change it into a theoretically inferior model which in
practice results in a higher competitive edge? How does that modification look
like? And finally, if all participants modify their prediction models towards
the best practical performance, who benefits the most? players with inferior
models, or those with theoretical superiority? The main theme of this paper is
to raise these important questions and propose a theoretical model to answer
them. We consider a study case where two linear predictive models compete over
a shared target. The model with the closest estimate gets the whole reward,
which is equal to the absolute value of the target. We characterize the reward
function of each model, and using a basic game theoretic approach, demonstrate
that the inferior competitor can significantly improve his performance by
choosing optimal model coefficients that are different from the best
theoretical prediction. This is a preliminary study that emphasizes the fact
that in many applications where predictive machine learning is at the service
of competition, much can be gained from practical (back-testing) optimization
of the model compared to static prediction improvement.
|
cs.LG stat.ML
|
machine learning is often used in competitive scenarios participants learn and fit static models and those models compete in a shared platform the common assumption is that in order to win a competition one has to have the best predictive model ie the model with the smallest outsample error is that necessarily true does the best theoretical predictive model for a target always yield the best reward in a competition if not can one take the best model and purposefully change it into a theoretically inferior model which in practice results in a higher competitive edge how does that modification look like and finally if all participants modify their prediction models towards the best practical performance who benefits the most players with inferior models or those with theoretical superiority the main theme of this paper is to raise these important questions and propose a theoretical model to answer them we consider a study case where two linear predictive models compete over a shared target the model with the closest estimate gets the whole reward which is equal to the absolute value of the target we characterize the reward function of each model and using a basic game theoretic approach demonstrate that the inferior competitor can significantly improve his performance by choosing optimal model coefficients that are different from the best theoretical prediction this is a preliminary study that emphasizes the fact that in many applications where predictive machine learning is at the service of competition much can be gained from practical backtesting optimization of the model compared to static prediction improvement
|
[['machine', 'learning', 'is', 'often', 'used', 'in', 'competitive', 'scenarios', 'participants', 'learn', 'and', 'fit', 'static', 'models', 'and', 'those', 'models', 'compete', 'in', 'a', 'shared', 'platform', 'the', 'common', 'assumption', 'is', 'that', 'in', 'order', 'to', 'win', 'a', 'competition', 'one', 'has', 'to', 'have', 'the', 'best', 'predictive', 'model', 'ie', 'the', 'model', 'with', 'the', 'smallest', 'outsample', 'error', 'is', 'that', 'necessarily', 'true', 'does', 'the', 'best', 'theoretical', 'predictive', 'model', 'for', 'a', 'target', 'always', 'yield', 'the', 'best', 'reward', 'in', 'a', 'competition', 'if', 'not', 'can', 'one', 'take', 'the', 'best', 'model', 'and', 'purposefully', 'change', 'it', 'into', 'a', 'theoretically', 'inferior', 'model', 'which', 'in', 'practice', 'results', 'in', 'a', 'higher', 'competitive', 'edge', 'how', 'does', 'that', 'modification', 'look', 'like', 'and', 'finally', 'if', 'all', 'participants', 'modify', 'their', 'prediction', 'models', 'towards', 'the', 'best', 'practical', 'performance', 'who', 'benefits', 'the', 'most', 'players', 'with', 'inferior', 'models', 'or', 'those', 'with', 'theoretical', 'superiority', 'the', 'main', 'theme', 'of', 'this', 'paper', 'is', 'to', 'raise', 'these', 'important', 'questions', 'and', 'propose', 'a', 'theoretical', 'model', 'to', 'answer', 'them', 'we', 'consider', 'a', 'study', 'case', 'where', 'two', 'linear', 'predictive', 'models', 'compete', 'over', 'a', 'shared', 'target', 'the', 'model', 'with', 'the', 'closest', 'estimate', 'gets', 'the', 'whole', 'reward', 'which', 'is', 'equal', 'to', 'the', 'absolute', 'value', 'of', 'the', 'target', 'we', 'characterize', 'the', 'reward', 'function', 'of', 'each', 'model', 'and', 'using', 'a', 'basic', 'game', 'theoretic', 'approach', 'demonstrate', 'that', 'the', 'inferior', 'competitor', 'can', 'significantly', 'improve', 'his', 'performance', 'by', 'choosing', 'optimal', 'model', 'coefficients', 'that', 'are', 'different', 'from', 'the', 'best', 'theoretical', 'prediction', 'this', 'is', 'a', 'preliminary', 'study', 'that', 'emphasizes', 'the', 'fact', 'that', 'in', 'many', 'applications', 'where', 'predictive', 'machine', 'learning', 'is', 'at', 'the', 'service', 'of', 'competition', 'much', 'can', 'be', 'gained', 'from', 'practical', 'backtesting', 'optimization', 'of', 'the', 'model', 'compared', 'to', 'static', 'prediction', 'improvement']]
|
[-0.013422048962014902, 0.03281163735586393, -0.1033067374946942, 0.09567435554913833, -0.10398380716163594, -0.20943824817529982, 0.06849744309933492, 0.39498607847853867, -0.26428998770393874, -0.32431547382703296, 0.08551531974685653, -0.29768802792144317, -0.16727166125748014, 0.16810581048904166, -0.1175065199780547, 0.030786020547897336, 0.08528357246797888, 0.0918134643814002, -0.030495649134968605, -0.3000239436077561, 0.2613817933211781, 0.07447790280983595, 0.31926171371349316, 0.031050071105989004, 0.0762236381281467, -0.02672402614525116, 0.022470791281782577, 0.014022069763288729, -0.0944256913791965, 0.1377983367323904, 0.27592337312190707, 0.15868924966374576, 0.34722524362355756, -0.38148483707144915, -0.2153114407962024, 0.1463732923937683, 0.11931911209897919, 0.0928921345553327, -0.012877768129502847, -0.23601122886581183, 0.09692059081270289, -0.19398905795827592, -0.05013568910067166, -0.07219314824083242, -0.035933783438442085, 0.01211671238333358, -0.3126784490557009, 0.02743909609329198, 0.07128994201285001, -0.0008406474065906244, -0.080033226765628, -0.1534514031366274, 0.015273715416237113, 0.17754060668082217, 0.07117054712752774, 0.06791970717017735, 0.10275486545187645, -0.1769186525982073, -0.17435183261175036, 0.40536179337864636, -0.07059732543985213, -0.2085299818701614, 0.19967737847268296, -0.11287547647863826, -0.1034771981988088, 0.0712600273465545, 0.2011973207809345, 0.09672218490252807, -0.13420754362707707, 0.032461648070524624, -0.06882747374046808, 0.18916722953183954, -0.003280638653331818, -0.012430892269737247, 0.18681456735875043, 0.21813681637832602, 0.06276032766768837, 0.10275923627227103, -0.006491794159133665, -0.14981496804197572, -0.24839421163288114, -0.11377404062648329, -0.15666828822332052, -0.013328614047854707, -0.09195513874651433, -0.10796267773771624, 0.40740381687936655, 0.23065011817747835, 0.19501487152308397, 0.07664587188929577, 0.3445927735375262, 0.07841447620006756, 0.0598994562058028, 0.08807904291291403, 0.2565182455230176, 0.014754533227104908, 0.05230938806956798, -0.18117872355648557, 0.1618840665738473, 0.002880416791333007]
|
1,803.03673
|
Fault Localization Models in Debugging
|
Debugging is considered as a rigorous but important feature of software
engineering process. Since more than a decade, the software engineering
research community is exploring different techniques for removal of faults from
programs but it is quite difficult to overcome all the faults of software
programs. Thus, it is still remains as a real challenge for software debugging
and maintenance community. In this paper, we briefly introduced software
anomalies and faults classification and then explained different fault
localization models using theory of diagnosis. Furthermore, we compared and
contrasted between value based and dependencies based models in accordance with
different real misbehaviours and presented some insight information for the
debugging process. Moreover, we discussed the results of both models and
manifested the shortcomings as well as advantages of these models in terms of
debugging and maintenance.
|
cs.SE
|
debugging is considered as a rigorous but important feature of software engineering process since more than a decade the software engineering research community is exploring different techniques for removal of faults from programs but it is quite difficult to overcome all the faults of software programs thus it is still remains as a real challenge for software debugging and maintenance community in this paper we briefly introduced software anomalies and faults classification and then explained different fault localization models using theory of diagnosis furthermore we compared and contrasted between value based and dependencies based models in accordance with different real misbehaviours and presented some insight information for the debugging process moreover we discussed the results of both models and manifested the shortcomings as well as advantages of these models in terms of debugging and maintenance
|
[['debugging', 'is', 'considered', 'as', 'a', 'rigorous', 'but', 'important', 'feature', 'of', 'software', 'engineering', 'process', 'since', 'more', 'than', 'a', 'decade', 'the', 'software', 'engineering', 'research', 'community', 'is', 'exploring', 'different', 'techniques', 'for', 'removal', 'of', 'faults', 'from', 'programs', 'but', 'it', 'is', 'quite', 'difficult', 'to', 'overcome', 'all', 'the', 'faults', 'of', 'software', 'programs', 'thus', 'it', 'is', 'still', 'remains', 'as', 'a', 'real', 'challenge', 'for', 'software', 'debugging', 'and', 'maintenance', 'community', 'in', 'this', 'paper', 'we', 'briefly', 'introduced', 'software', 'anomalies', 'and', 'faults', 'classification', 'and', 'then', 'explained', 'different', 'fault', 'localization', 'models', 'using', 'theory', 'of', 'diagnosis', 'furthermore', 'we', 'compared', 'and', 'contrasted', 'between', 'value', 'based', 'and', 'dependencies', 'based', 'models', 'in', 'accordance', 'with', 'different', 'real', 'misbehaviours', 'and', 'presented', 'some', 'insight', 'information', 'for', 'the', 'debugging', 'process', 'moreover', 'we', 'discussed', 'the', 'results', 'of', 'both', 'models', 'and', 'manifested', 'the', 'shortcomings', 'as', 'well', 'as', 'advantages', 'of', 'these', 'models', 'in', 'terms', 'of', 'debugging', 'and', 'maintenance']]
|
[-0.0892803269498809, 0.02898859240597597, -0.0401072498479927, 0.10145041101660118, -0.07340180582401377, -0.18526221082925245, 0.029465341221334207, 0.38232259575139593, -0.2432993865399449, -0.3497299931322535, 0.1708406766919695, -0.22751727386688192, -0.20916092012215542, 0.2475113561445916, -0.09708778541535139, 0.11075692611780984, 0.09304972565118483, -0.0277669174734641, -0.05618854278905524, -0.2498286841471714, 0.2796499472973799, 0.09503447586256597, 0.3016148471721896, 0.11153870280832053, 0.03917543203397481, 0.02150171224924701, -0.07633454806205851, 0.0405736218172091, -0.06359752501292085, 0.11575707231553409, 0.3651413943511822, 0.22391742669063172, 0.29860754596690336, -0.4378997315549188, -0.21455481516680233, 0.06317339935857388, 0.1547271326839648, 0.10456879314173151, -0.02918818639472765, -0.2857609225161098, 0.09008405762897045, -0.19384923557302466, -0.0803491543771492, -0.10582541948253357, 0.01570083520685633, -0.02031177657621878, -0.19440882528821626, 0.01563452523270691, 0.08186613534559944, 0.11928437948226929, -0.05936345987073663, -0.12175083268709756, -0.010320363633541597, 0.1440491615070237, 0.1001712905592285, 0.012780307768844068, 0.1357760441903439, -0.15042020249249483, -0.18028114873019083, 0.4166281007230282, 0.0180276861995312, -0.15672173429694441, 0.2504478580318391, -0.013100458847151861, -0.2054001798680811, 0.06030092941666091, 0.16895391315014827, 0.08860718579617916, -0.19477815777753238, 0.04948203244970904, 0.09146128632473173, 0.1603490889210392, 0.039670483823175784, 0.006189541549732288, 0.18593470090655265, 0.24030472816278536, 0.009606645889235316, 0.13003358934764508, -0.020707067978326922, -0.08583591787868904, -0.2672790789838742, -0.16668054814691896, -0.14132606470698697, -0.04618221537761942, -0.03765052259916923, -0.20028277286500842, 0.412405261606047, 0.23515282824497533, 0.1376634776764722, 0.047070780499941775, 0.34467363129369916, 0.06247435365717306, 0.08515153633499586, 0.07612899611014183, 0.1727575784499533, 0.06592573332427829, 0.12023388924836009, -0.14549176140981554, 0.16654339169186574, -0.03371825594437757]
|
1,803.03674
|
Sequential Outlier Detection based on Incremental Decision Trees
|
We introduce an online outlier detection algorithm to detect outliers in a
sequentially observed data stream. For this purpose, we use a two-stage
filtering and hedging approach. In the first stage, we construct a multi-modal
probability density function to model the normal samples. In the second stage,
given a new observation, we label it as an anomaly if the value of
aforementioned density function is below a specified threshold at the newly
observed point. In order to construct our multi-modal density function, we use
an incremental decision tree to construct a set of subspaces of the observation
space. We train a single component density function of the exponential family
using the observations, which fall inside each subspace represented on the
tree. These single component density functions are then adaptively combined to
produce our multi-modal density function, which is shown to achieve the
performance of the best convex combination of the density functions defined on
the subspaces. As we observe more samples, our tree grows and produces more
subspaces. As a result, our modeling power increases in time, while mitigating
overfitting issues. In order to choose our threshold level to label the
observations, we use an adaptive thresholding scheme. We show that our adaptive
threshold level achieves the performance of the optimal pre-fixed threshold
level, which knows the observation labels in hindsight. Our algorithm provides
significant performance improvements over the state of the art in our wide set
of experiments involving both synthetic as well as real data.
|
cs.LG
|
we introduce an online outlier detection algorithm to detect outliers in a sequentially observed data stream for this purpose we use a twostage filtering and hedging approach in the first stage we construct a multimodal probability density function to model the normal samples in the second stage given a new observation we label it as an anomaly if the value of aforementioned density function is below a specified threshold at the newly observed point in order to construct our multimodal density function we use an incremental decision tree to construct a set of subspaces of the observation space we train a single component density function of the exponential family using the observations which fall inside each subspace represented on the tree these single component density functions are then adaptively combined to produce our multimodal density function which is shown to achieve the performance of the best convex combination of the density functions defined on the subspaces as we observe more samples our tree grows and produces more subspaces as a result our modeling power increases in time while mitigating overfitting issues in order to choose our threshold level to label the observations we use an adaptive thresholding scheme we show that our adaptive threshold level achieves the performance of the optimal prefixed threshold level which knows the observation labels in hindsight our algorithm provides significant performance improvements over the state of the art in our wide set of experiments involving both synthetic as well as real data
|
[['we', 'introduce', 'an', 'online', 'outlier', 'detection', 'algorithm', 'to', 'detect', 'outliers', 'in', 'a', 'sequentially', 'observed', 'data', 'stream', 'for', 'this', 'purpose', 'we', 'use', 'a', 'twostage', 'filtering', 'and', 'hedging', 'approach', 'in', 'the', 'first', 'stage', 'we', 'construct', 'a', 'multimodal', 'probability', 'density', 'function', 'to', 'model', 'the', 'normal', 'samples', 'in', 'the', 'second', 'stage', 'given', 'a', 'new', 'observation', 'we', 'label', 'it', 'as', 'an', 'anomaly', 'if', 'the', 'value', 'of', 'aforementioned', 'density', 'function', 'is', 'below', 'a', 'specified', 'threshold', 'at', 'the', 'newly', 'observed', 'point', 'in', 'order', 'to', 'construct', 'our', 'multimodal', 'density', 'function', 'we', 'use', 'an', 'incremental', 'decision', 'tree', 'to', 'construct', 'a', 'set', 'of', 'subspaces', 'of', 'the', 'observation', 'space', 'we', 'train', 'a', 'single', 'component', 'density', 'function', 'of', 'the', 'exponential', 'family', 'using', 'the', 'observations', 'which', 'fall', 'inside', 'each', 'subspace', 'represented', 'on', 'the', 'tree', 'these', 'single', 'component', 'density', 'functions', 'are', 'then', 'adaptively', 'combined', 'to', 'produce', 'our', 'multimodal', 'density', 'function', 'which', 'is', 'shown', 'to', 'achieve', 'the', 'performance', 'of', 'the', 'best', 'convex', 'combination', 'of', 'the', 'density', 'functions', 'defined', 'on', 'the', 'subspaces', 'as', 'we', 'observe', 'more', 'samples', 'our', 'tree', 'grows', 'and', 'produces', 'more', 'subspaces', 'as', 'a', 'result', 'our', 'modeling', 'power', 'increases', 'in', 'time', 'while', 'mitigating', 'overfitting', 'issues', 'in', 'order', 'to', 'choose', 'our', 'threshold', 'level', 'to', 'label', 'the', 'observations', 'we', 'use', 'an', 'adaptive', 'thresholding', 'scheme', 'we', 'show', 'that', 'our', 'adaptive', 'threshold', 'level', 'achieves', 'the', 'performance', 'of', 'the', 'optimal', 'prefixed', 'threshold', 'level', 'which', 'knows', 'the', 'observation', 'labels', 'in', 'hindsight', 'our', 'algorithm', 'provides', 'significant', 'performance', 'improvements', 'over', 'the', 'state', 'of', 'the', 'art', 'in', 'our', 'wide', 'set', 'of', 'experiments', 'involving', 'both', 'synthetic', 'as', 'well', 'as', 'real', 'data']]
|
[-0.06646878873212508, 0.03871233235155741, -0.0886527145795641, 0.05448950076077948, -0.07336540160104935, -0.08444878776832992, 0.09147959681857483, 0.4094804070309287, -0.28239448080668866, -0.30530304413454734, 0.08550009556748124, -0.27335710998300294, -0.16130693753811753, 0.1513540975189568, -0.08186554223645916, 0.06867332677526573, 0.07380738945183936, 0.06672412543845088, -0.06458854996542698, -0.2798449327680942, 0.3147234716570487, 0.07375674918180837, 0.298770639796549, -0.013299017601650254, 0.14026428037511585, 0.017706333782131736, -0.01285157170380477, -0.0002896237520073062, -0.0949599536491696, 0.09907897872197996, 0.29330692135517744, 0.18747435291703066, 0.3186759801302482, -0.36070351589561594, -0.20064949323913375, 0.11966022694113887, 0.11325851886114671, 0.10354303649149699, -0.04428823744307408, -0.2785208372574541, 0.0990279492891963, -0.16474355028485993, -0.0969801089238104, -0.09460500251079498, -0.04143991471581191, 0.0012965659959230436, -0.33710502930784875, 0.0475544273572397, 0.031895746702002174, -0.0009722195514798285, -0.061224458037841656, -0.13265932643944436, 0.007012173524955929, 0.10824782242772249, 0.011833161854200245, 0.07706919692111247, 0.127839369276941, -0.13247358032477727, -0.13126724582120233, 0.3055077457079628, -0.1061563088157052, -0.19727337884392424, 0.17036240740428463, -0.11388734554370436, -0.14477187798413643, 0.13145541080352868, 0.21443576299536385, 0.12705451263273174, -0.10368837901063052, 0.012114525991793617, -0.053468158556740385, 0.20178749073762917, 0.03733572195593252, -0.003725181757906067, 0.14752741534025351, 0.21771773690855514, 0.11978613516798446, 0.1610400780335753, -0.13943424532265375, -0.0586516406115612, -0.30633076367172063, -0.1236590615316739, -0.20704062843717908, -0.02314409737094392, -0.10145460108852651, -0.18833940648150946, 0.41146368772570724, 0.19373009554091614, 0.2677401270583528, 0.12214790275537217, 0.3234916796666468, 0.14796174771252826, 0.06101238968883931, 0.09869296473378729, 0.17266739574392978, 0.03842218696546971, 0.028401994661791892, -0.1778431393835092, 0.08240393142834275, 0.043623195295264525]
|
1,803.03675
|
Active Galactic Nuclei Feedback in an Elliptical Galaxy with the Most
Updated AGN Physics (II): High-Angular Momentum Case
|
This is the second paper of our series of works of studying the effects of
active galactic nuclei (AGN) feedback on the cosmological evolution of an
isolated elliptical galaxy by performing two-dimensional high-resolution
hydrodynamical numerical simulations. In these simulations, the inner boundary
is chosen so that the Bondi radius is resolved. Physical processes like star
formation, SNe Ia and II are taken into account. Compared to previous works,
the main improvements is that we adopt the most updated AGN physics, which is
described in detail in the first paper of this series (Yuan et al. 2018, Paper
I). These improvements include the discrimination of the two accretion modes of
the central AGN and the most updated descriptions of the wind and radiation in
the two modes. In Paper I, we consider the case that the specific angular
momentum of the gas in the galaxy is very low. In this paper, we consider the
case that the specific angular momentum of the gas is high. In the galactic
scale, we adopt the gravitational torques raised due to non-axisymmetric
structure in the galaxy as the mechanism of the transfer of angular momentum of
gas, as proposed in some recent works. Since our simulations are axisymmetric,
we make use of a parameterized prescription to mimic this mechanism. Same as
Paper I, we investigate the AGN light curve, typical AGN lifetime, growth of
the black hole mass, AGN duty-cycle, star formation, and the X-ray surface
brightness of the galaxy. Special attention is paid to the effects of specific
angular momentum of the galaxy on these properties. We find that some results
are qualitatively similar to those shown in Paper I, while some results such as
star formation and black hole growth do show a significant difference due to
the mass concentration in the galactic disk as a consequence of galactic
rotation.
|
astro-ph.HE astro-ph.GA
|
this is the second paper of our series of works of studying the effects of active galactic nuclei agn feedback on the cosmological evolution of an isolated elliptical galaxy by performing twodimensional highresolution hydrodynamical numerical simulations in these simulations the inner boundary is chosen so that the bondi radius is resolved physical processes like star formation sne ia and ii are taken into account compared to previous works the main improvements is that we adopt the most updated agn physics which is described in detail in the first paper of this series yuan et al 2018 paper i these improvements include the discrimination of the two accretion modes of the central agn and the most updated descriptions of the wind and radiation in the two modes in paper i we consider the case that the specific angular momentum of the gas in the galaxy is very low in this paper we consider the case that the specific angular momentum of the gas is high in the galactic scale we adopt the gravitational torques raised due to nonaxisymmetric structure in the galaxy as the mechanism of the transfer of angular momentum of gas as proposed in some recent works since our simulations are axisymmetric we make use of a parameterized prescription to mimic this mechanism same as paper i we investigate the agn light curve typical agn lifetime growth of the black hole mass agn dutycycle star formation and the xray surface brightness of the galaxy special attention is paid to the effects of specific angular momentum of the galaxy on these properties we find that some results are qualitatively similar to those shown in paper i while some results such as star formation and black hole growth do show a significant difference due to the mass concentration in the galactic disk as a consequence of galactic rotation
|
[['this', 'is', 'the', 'second', 'paper', 'of', 'our', 'series', 'of', 'works', 'of', 'studying', 'the', 'effects', 'of', 'active', 'galactic', 'nuclei', 'agn', 'feedback', 'on', 'the', 'cosmological', 'evolution', 'of', 'an', 'isolated', 'elliptical', 'galaxy', 'by', 'performing', 'twodimensional', 'highresolution', 'hydrodynamical', 'numerical', 'simulations', 'in', 'these', 'simulations', 'the', 'inner', 'boundary', 'is', 'chosen', 'so', 'that', 'the', 'bondi', 'radius', 'is', 'resolved', 'physical', 'processes', 'like', 'star', 'formation', 'sne', 'ia', 'and', 'ii', 'are', 'taken', 'into', 'account', 'compared', 'to', 'previous', 'works', 'the', 'main', 'improvements', 'is', 'that', 'we', 'adopt', 'the', 'most', 'updated', 'agn', 'physics', 'which', 'is', 'described', 'in', 'detail', 'in', 'the', 'first', 'paper', 'of', 'this', 'series', 'yuan', 'et', 'al', '2018', 'paper', 'i', 'these', 'improvements', 'include', 'the', 'discrimination', 'of', 'the', 'two', 'accretion', 'modes', 'of', 'the', 'central', 'agn', 'and', 'the', 'most', 'updated', 'descriptions', 'of', 'the', 'wind', 'and', 'radiation', 'in', 'the', 'two', 'modes', 'in', 'paper', 'i', 'we', 'consider', 'the', 'case', 'that', 'the', 'specific', 'angular', 'momentum', 'of', 'the', 'gas', 'in', 'the', 'galaxy', 'is', 'very', 'low', 'in', 'this', 'paper', 'we', 'consider', 'the', 'case', 'that', 'the', 'specific', 'angular', 'momentum', 'of', 'the', 'gas', 'is', 'high', 'in', 'the', 'galactic', 'scale', 'we', 'adopt', 'the', 'gravitational', 'torques', 'raised', 'due', 'to', 'nonaxisymmetric', 'structure', 'in', 'the', 'galaxy', 'as', 'the', 'mechanism', 'of', 'the', 'transfer', 'of', 'angular', 'momentum', 'of', 'gas', 'as', 'proposed', 'in', 'some', 'recent', 'works', 'since', 'our', 'simulations', 'are', 'axisymmetric', 'we', 'make', 'use', 'of', 'a', 'parameterized', 'prescription', 'to', 'mimic', 'this', 'mechanism', 'same', 'as', 'paper', 'i', 'we', 'investigate', 'the', 'agn', 'light', 'curve', 'typical', 'agn', 'lifetime', 'growth', 'of', 'the', 'black', 'hole', 'mass', 'agn', 'dutycycle', 'star', 'formation', 'and', 'the', 'xray', 'surface', 'brightness', 'of', 'the', 'galaxy', 'special', 'attention', 'is', 'paid', 'to', 'the', 'effects', 'of', 'specific', 'angular', 'momentum', 'of', 'the', 'galaxy', 'on', 'these', 'properties', 'we', 'find', 'that', 'some', 'results', 'are', 'qualitatively', 'similar', 'to', 'those', 'shown', 'in', 'paper', 'i', 'while', 'some', 'results', 'such', 'as', 'star', 'formation', 'and', 'black', 'hole', 'growth', 'do', 'show', 'a', 'significant', 'difference', 'due', 'to', 'the', 'mass', 'concentration', 'in', 'the', 'galactic', 'disk', 'as', 'a', 'consequence', 'of', 'galactic', 'rotation']]
|
[-0.08331083167433065, 0.0689171842343105, -0.061931819966706034, 0.09310388724480419, -0.09752971686632145, -0.04245072923197202, -0.006974295036888496, 0.3811979505024147, -0.1885469084012501, -0.30743582450241724, 0.06041929937431935, -0.27999870501631563, -0.0830232321287745, 0.19597672684711984, -0.06420525734795178, 0.00856443035343498, 0.023539541234605086, -0.0602395882828507, -0.057228135901195354, -0.2757814404788254, 0.37112138285802176, 0.12051286751022168, 0.18398816995201359, 0.010524178486535817, 0.07040777304953007, -0.06348797385444324, -0.09321481995254222, 0.009541647099580386, -0.18446906233236823, 0.049983654030164894, 0.21782153582424896, 0.1093214211533459, 0.24825799789398012, -0.4088109744597433, -0.23434125903405323, 0.06214869920170414, 0.1915029890999101, 0.11815052370863878, -0.11402403141805335, -0.18975942277771204, 0.038754555611364566, -0.23016338545452888, -0.13510799009189106, 0.011753131147073612, 0.026755559782979933, 0.048398471116665905, -0.22114909495358243, 0.11482082608425899, 0.108554387419615, 0.017566980519529176, -0.10410551877892561, -0.06891993633456261, -0.062283391308900975, 0.08693979743447956, 0.08800058629809718, 0.05352961600466907, 0.1632079666545645, -0.14167933167088836, -0.061317263028496445, 0.41419265768718255, -0.016571061700849463, -0.09958186957997298, 0.2064138941371249, -0.2240767748829232, -0.16945098832868502, 0.07038953836896557, 0.19919708720029178, 0.1369528845536556, -0.12728004710819324, 0.03377457764007759, -0.04960745415067852, 0.14356506126477755, 0.0326674718528088, 0.04297760484311828, 0.27329666804407, 0.14147526662567697, 0.00896319437010596, 0.10826111006086346, -0.16264391273293485, -0.07691861660366102, -0.27624741904680233, -0.11265010529285728, -0.16472864966287432, 0.0763880421865598, -0.08988834898409787, -0.10256559883973543, 0.38360854574700615, 0.12467237248961209, 0.2496327340439059, 0.010111982396467064, 0.3119713034031834, 0.07950865080449669, 0.05753399872339364, 0.10852478240034164, 0.32438248992624164, 0.1405633785026239, 0.10020307650795686, -0.2967686789052095, 0.03955950080500521, 0.028409781850607465]
|
1,803.03676
|
Existence and Construction of Galilean invariant $z\neq2$ Theories
|
We prove a no-go theorem for the construction of a Galilean boost invariant
and $z\neq2$ anisotropic scale invariant field theory with a finite dimensional
basis of fields. Two point correlators in such theories, we show, grow
unboundedly with spatial separation. Correlators of theories with an infinite
dimensional basis of fields, for example, labeled by a continuous parameter, do
not necessarily exhibit this bad behavior. Hence, such theories behave
effectively as if in one extra dimension. Embedding the symmetry algebra into
the conformal algebra of one higher dimension also reveals the existence of an
internal continuous parameter. Consideration of isometries shows that the
non-relativistic holographic picture assumes a canonical form, where the bulk
gravitational theory lives in a space-time with one extra dimension. This can
be contrasted with the original proposal by Balasubramanian and McGreevy, and
by Son, where the metric of a $d+2$ dimensional space-time is proposed to be
dual of a $d$ dimensional field theory. We provide explicit examples of
theories living at fixed point with anisotropic scaling exponent
$z=\frac{2\ell}{\ell+1}\,,\ell\in \mathbb{Z}$
|
hep-th cond-mat.quant-gas cond-mat.str-el math-ph math.MP
|
we prove a nogo theorem for the construction of a galilean boost invariant and zneq2 anisotropic scale invariant field theory with a finite dimensional basis of fields two point correlators in such theories we show grow unboundedly with spatial separation correlators of theories with an infinite dimensional basis of fields for example labeled by a continuous parameter do not necessarily exhibit this bad behavior hence such theories behave effectively as if in one extra dimension embedding the symmetry algebra into the conformal algebra of one higher dimension also reveals the existence of an internal continuous parameter consideration of isometries shows that the nonrelativistic holographic picture assumes a canonical form where the bulk gravitational theory lives in a spacetime with one extra dimension this can be contrasted with the original proposal by balasubramanian and mcgreevy and by son where the metric of a d2 dimensional spacetime is proposed to be dual of a d dimensional field theory we provide explicit examples of theories living at fixed point with anisotropic scaling exponent zfrac2ellell1ellin mathbbz
|
[['we', 'prove', 'a', 'nogo', 'theorem', 'for', 'the', 'construction', 'of', 'a', 'galilean', 'boost', 'invariant', 'and', 'zneq2', 'anisotropic', 'scale', 'invariant', 'field', 'theory', 'with', 'a', 'finite', 'dimensional', 'basis', 'of', 'fields', 'two', 'point', 'correlators', 'in', 'such', 'theories', 'we', 'show', 'grow', 'unboundedly', 'with', 'spatial', 'separation', 'correlators', 'of', 'theories', 'with', 'an', 'infinite', 'dimensional', 'basis', 'of', 'fields', 'for', 'example', 'labeled', 'by', 'a', 'continuous', 'parameter', 'do', 'not', 'necessarily', 'exhibit', 'this', 'bad', 'behavior', 'hence', 'such', 'theories', 'behave', 'effectively', 'as', 'if', 'in', 'one', 'extra', 'dimension', 'embedding', 'the', 'symmetry', 'algebra', 'into', 'the', 'conformal', 'algebra', 'of', 'one', 'higher', 'dimension', 'also', 'reveals', 'the', 'existence', 'of', 'an', 'internal', 'continuous', 'parameter', 'consideration', 'of', 'isometries', 'shows', 'that', 'the', 'nonrelativistic', 'holographic', 'picture', 'assumes', 'a', 'canonical', 'form', 'where', 'the', 'bulk', 'gravitational', 'theory', 'lives', 'in', 'a', 'spacetime', 'with', 'one', 'extra', 'dimension', 'this', 'can', 'be', 'contrasted', 'with', 'the', 'original', 'proposal', 'by', 'balasubramanian', 'and', 'mcgreevy', 'and', 'by', 'son', 'where', 'the', 'metric', 'of', 'a', 'd2', 'dimensional', 'spacetime', 'is', 'proposed', 'to', 'be', 'dual', 'of', 'a', 'd', 'dimensional', 'field', 'theory', 'we', 'provide', 'explicit', 'examples', 'of', 'theories', 'living', 'at', 'fixed', 'point', 'with', 'anisotropic', 'scaling', 'exponent', 'zfrac2ellell1ellin', 'mathbbz']]
|
[-0.1382919753785245, 0.19089433858462143, -0.1114528054042774, 0.05031591512344997, -0.06975728959317648, -0.18587773058919566, -0.03350083939114805, 0.30461570100091834, -0.21639823339646683, -0.23644820956294152, 0.08871937633341398, -0.24350441427582958, -0.16789779290419948, 0.12761612412218443, -0.047769950012512066, 0.00702413691461141, -0.0274419178487733, 0.10959517448911142, -0.10939858048086, -0.25950851409750825, 0.36647103161770195, 0.01246526931576869, 0.2888057958827738, 0.007684871915262193, 0.12073249922079199, 0.019115776378962706, -0.002083114975625101, 0.09149982518078212, -0.11168024828815867, 0.09851054133409086, 0.24547343596966717, 0.06864605529220118, 0.20829982978346592, -0.4011237072703593, -0.2681568998718456, 0.11020441132542842, 0.1516510725906461, 0.10959570006303052, -0.03487174813841086, -0.2770072600694702, 0.0573835442567703, -0.17645719619467853, -0.2195701452656923, -0.1010588672477752, 0.016811067962964228, -0.07265126317986013, -0.2795785313061274, 0.08028496440126807, 0.09580246505519266, 0.09878002104678137, -0.07102592941921423, -0.04282517950735329, -0.053116837908130356, 0.05814079415833796, 0.07786407180212657, 0.06429122418904787, 0.09615351960117764, -0.12858739591782284, -0.15679808831636738, 0.35819685772773535, -0.07002598098616171, -0.264705005644218, 0.19296340957174407, -0.17214108646080337, -0.1681030218503164, 0.08646002414307612, 0.11784105512916165, 0.12583490614505374, -0.060965371581123154, 0.20702131025061724, -0.05408278842292288, 0.1416453302355127, 0.08200277801712647, 0.0777908339028192, 0.2033573998391683, 0.10115337649750633, 0.06686627555994645, 0.13367693071828826, 0.027288258119541057, -0.10599891437108026, -0.3651109217720873, -0.1911806392197511, -0.16697415500598523, 0.1457283555626739, -0.17768261429061086, -0.18036359824678477, 0.329006485267104, 0.11117670827721561, 0.2048481721431017, 0.05500290285563096, 0.22894891285720995, 0.11690295671715456, 0.10246869480504435, 0.08457518583985374, 0.18216109657660126, 0.10859390937873875, 0.029657267025151455, -0.1547058747999151, -0.09482725951546693, 0.1821918389705174]
|
1,803.03677
|
Nonparametric Risk Assessment and Density Estimation for Persistence
Landscapes
|
This paper presents approximate confidence intervals for each function of
parameters in a Banach space based on a bootstrap algorithm. We apply kernel
density approach to estimate the persistence landscape. In addition, we
evaluate the quality distribution function estimator of random variables using
integrated mean square error (IMSE). The results of simulation studies show a
significant improvement achieved by our approach compared to the standard
version of confidence intervals algorithm. In the next step, we provide several
algorithms to solve our model. Finally, real data analysis shows that the
accuracy of our method compared to that of previous works for computing the
confidence interval.
|
stat.ML
|
this paper presents approximate confidence intervals for each function of parameters in a banach space based on a bootstrap algorithm we apply kernel density approach to estimate the persistence landscape in addition we evaluate the quality distribution function estimator of random variables using integrated mean square error imse the results of simulation studies show a significant improvement achieved by our approach compared to the standard version of confidence intervals algorithm in the next step we provide several algorithms to solve our model finally real data analysis shows that the accuracy of our method compared to that of previous works for computing the confidence interval
|
[['this', 'paper', 'presents', 'approximate', 'confidence', 'intervals', 'for', 'each', 'function', 'of', 'parameters', 'in', 'a', 'banach', 'space', 'based', 'on', 'a', 'bootstrap', 'algorithm', 'we', 'apply', 'kernel', 'density', 'approach', 'to', 'estimate', 'the', 'persistence', 'landscape', 'in', 'addition', 'we', 'evaluate', 'the', 'quality', 'distribution', 'function', 'estimator', 'of', 'random', 'variables', 'using', 'integrated', 'mean', 'square', 'error', 'imse', 'the', 'results', 'of', 'simulation', 'studies', 'show', 'a', 'significant', 'improvement', 'achieved', 'by', 'our', 'approach', 'compared', 'to', 'the', 'standard', 'version', 'of', 'confidence', 'intervals', 'algorithm', 'in', 'the', 'next', 'step', 'we', 'provide', 'several', 'algorithms', 'to', 'solve', 'our', 'model', 'finally', 'real', 'data', 'analysis', 'shows', 'that', 'the', 'accuracy', 'of', 'our', 'method', 'compared', 'to', 'that', 'of', 'previous', 'works', 'for', 'computing', 'the', 'confidence', 'interval']]
|
[-0.05091476668782819, -0.057921183783596814, -0.13274394725718033, 0.10045792183350735, -0.01169385564012023, -0.07883525644697678, 0.11629937877856159, 0.43656478378062064, -0.196125230151945, -0.32480471139290157, 0.10634025974006643, -0.2428681385667565, -0.15753890663136888, 0.24438717289012857, -0.07907369682036985, 0.11434127948730467, 0.1337289951311854, 0.019630336576833194, -0.09116892458405346, -0.3218945946651869, 0.2540920134454679, 0.07934476603538944, 0.3049766776295236, 0.015446120668247413, 0.1202255532183559, 0.01259858005393583, -0.051165322244812086, 0.024211294348788215, -0.15042400514203808, 0.1750333446275013, 0.2080840637007406, 0.14307802012458873, 0.3388059149639538, -0.33796653401357335, -0.19966268754349306, 0.10573862883477257, 0.16336725034321156, 0.0847325577096154, -0.018831464986970577, -0.2807438026648015, 0.09957622959112856, -0.17545736611534196, -0.09712397081490892, -0.09090256303674184, -0.04276538079676147, 0.01827345844000005, -0.33770014356391936, 0.11197337805508421, 0.01564946549031167, 0.04636825329194275, -0.0648566104668694, -0.16290439309579177, 0.05665119077177504, 0.09195742942392826, 0.03699319236441694, 0.0746399187247824, 0.1153148788591632, -0.05808062166754378, -0.1729111631329243, 0.29436827562032986, -0.11502559363333813, -0.2384375682528256, 0.1170777633781724, -0.12547564207880685, -0.1598721190328853, 0.10653238585039687, 0.23529863531943052, 0.10582753338922675, -0.1323527698449862, 0.0730615494853387, -0.035825641132900134, 0.18508920311712876, -0.005607601792479937, -0.02676845895117507, 0.09926107376276587, 0.22031810027412854, 0.09508339177745466, 0.15136905539951, -0.11570478941743764, -0.10510498450513786, -0.31733050206317925, -0.1463212151743042, -0.2120090780260328, -0.061365679970969304, -0.14480835472484335, -0.17982150764706042, 0.4270628742255772, 0.2850125807095677, 0.21917579332903886, 0.17371276629049903, 0.313612325116992, 0.13654662531133419, 0.021840719468645357, 0.0828175284102774, 0.18967588623994602, 0.07998543171561323, 0.029369014892906237, -0.16055419750045985, 0.050044390285620466, 0.08123737369672969]
|
1,803.03678
|
Early-type galaxies in the Antlia Cluster: Catalogue and isophotal
analysis
|
We present a statistical isophotal analysis of 138 early-type galaxies in the
Antlia cluster, located at a distance of ${\sim} 35$ Mpc. The observational
material consists of CCD images of four $36$ arcmin ${\times} 36$ arcmin fields
obtained with the MOSAIC II camera at the Blanco 4-m telescope at CTIO. Our
present work supersedes previous Antlia studies in the sense that the covered
area is four times larger, the limiting magnitude is $M_{B} {\sim} -9.6$ mag,
and the surface photometry parameters of each galaxy are derived from S\'ersic
model fits extrapolated to infinity. In a companion previous study we focused
on the scaling relations obtained by means of surface photometry, and now we
present the data, on which the previous paper is based, the parameters of the
isophotal fits as well as an isophotal analysis. For each galaxy, we derive
isophotal shape parameters along the semi-major axis and search for
correlations within different radial bins. Through extensive statistical tests,
we also analyse the behaviour of these values against photometric and global
parameters of the galaxies themselves. While some galaxies do display radial
gradients in their ellipticity (${\epsilon}$) and/or their Fourier
coefficients, differences in mean values between adjacent regions are not
statistically significant. Regarding Fourier coefficients, dwarf galaxies
usually display gradients between all adjacent regions, while non-dwarfs tend
to show this behaviour just between the two outermost regions. Globally, there
is no obvious correlation between Fourier coefficients and luminosity for the
whole magnitude range ($-12 {\gtrsim} M_{V} {\gtrsim} -22$); however, dwarfs
display much higher dispersions at all radii.
|
astro-ph.GA
|
we present a statistical isophotal analysis of 138 earlytype galaxies in the antlia cluster located at a distance of sim 35 mpc the observational material consists of ccd images of four 36 arcmin times 36 arcmin fields obtained with the mosaic ii camera at the blanco 4m telescope at ctio our present work supersedes previous antlia studies in the sense that the covered area is four times larger the limiting magnitude is m_b sim 96 mag and the surface photometry parameters of each galaxy are derived from sersic model fits extrapolated to infinity in a companion previous study we focused on the scaling relations obtained by means of surface photometry and now we present the data on which the previous paper is based the parameters of the isophotal fits as well as an isophotal analysis for each galaxy we derive isophotal shape parameters along the semimajor axis and search for correlations within different radial bins through extensive statistical tests we also analyse the behaviour of these values against photometric and global parameters of the galaxies themselves while some galaxies do display radial gradients in their ellipticity epsilon andor their fourier coefficients differences in mean values between adjacent regions are not statistically significant regarding fourier coefficients dwarf galaxies usually display gradients between all adjacent regions while nondwarfs tend to show this behaviour just between the two outermost regions globally there is no obvious correlation between fourier coefficients and luminosity for the whole magnitude range 12 gtrsim m_v gtrsim 22 however dwarfs display much higher dispersions at all radii
|
[['we', 'present', 'a', 'statistical', 'isophotal', 'analysis', 'of', '138', 'earlytype', 'galaxies', 'in', 'the', 'antlia', 'cluster', 'located', 'at', 'a', 'distance', 'of', 'sim', '35', 'mpc', 'the', 'observational', 'material', 'consists', 'of', 'ccd', 'images', 'of', 'four', '36', 'arcmin', 'times', '36', 'arcmin', 'fields', 'obtained', 'with', 'the', 'mosaic', 'ii', 'camera', 'at', 'the', 'blanco', '4m', 'telescope', 'at', 'ctio', 'our', 'present', 'work', 'supersedes', 'previous', 'antlia', 'studies', 'in', 'the', 'sense', 'that', 'the', 'covered', 'area', 'is', 'four', 'times', 'larger', 'the', 'limiting', 'magnitude', 'is', 'm_b', 'sim', '96', 'mag', 'and', 'the', 'surface', 'photometry', 'parameters', 'of', 'each', 'galaxy', 'are', 'derived', 'from', 'sersic', 'model', 'fits', 'extrapolated', 'to', 'infinity', 'in', 'a', 'companion', 'previous', 'study', 'we', 'focused', 'on', 'the', 'scaling', 'relations', 'obtained', 'by', 'means', 'of', 'surface', 'photometry', 'and', 'now', 'we', 'present', 'the', 'data', 'on', 'which', 'the', 'previous', 'paper', 'is', 'based', 'the', 'parameters', 'of', 'the', 'isophotal', 'fits', 'as', 'well', 'as', 'an', 'isophotal', 'analysis', 'for', 'each', 'galaxy', 'we', 'derive', 'isophotal', 'shape', 'parameters', 'along', 'the', 'semimajor', 'axis', 'and', 'search', 'for', 'correlations', 'within', 'different', 'radial', 'bins', 'through', 'extensive', 'statistical', 'tests', 'we', 'also', 'analyse', 'the', 'behaviour', 'of', 'these', 'values', 'against', 'photometric', 'and', 'global', 'parameters', 'of', 'the', 'galaxies', 'themselves', 'while', 'some', 'galaxies', 'do', 'display', 'radial', 'gradients', 'in', 'their', 'ellipticity', 'epsilon', 'andor', 'their', 'fourier', 'coefficients', 'differences', 'in', 'mean', 'values', 'between', 'adjacent', 'regions', 'are', 'not', 'statistically', 'significant', 'regarding', 'fourier', 'coefficients', 'dwarf', 'galaxies', 'usually', 'display', 'gradients', 'between', 'all', 'adjacent', 'regions', 'while', 'nondwarfs', 'tend', 'to', 'show', 'this', 'behaviour', 'just', 'between', 'the', 'two', 'outermost', 'regions', 'globally', 'there', 'is', 'no', 'obvious', 'correlation', 'between', 'fourier', 'coefficients', 'and', 'luminosity', 'for', 'the', 'whole', 'magnitude', 'range', '12', 'gtrsim', 'm_v', 'gtrsim', '22', 'however', 'dwarfs', 'display', 'much', 'higher', 'dispersions', 'at', 'all', 'radii']]
|
[-0.07431361904639289, 0.07522850517631241, -0.08422868754951196, 0.07110072464956829, -0.06908578323054826, -0.07494150706679648, 0.030155497997384373, 0.45211165088403504, -0.14026330592218983, -0.38489371554896934, 0.06940645447821225, -0.3355540031916462, -0.050944901860020764, 0.21904516892345782, -0.040998416864738374, -0.0029323586899181464, 0.062270027469594424, -0.07351742979653864, -0.11093112710022979, -0.2771298045890944, 0.2466148011972109, 0.021635620051711157, 0.20474847258651607, -0.0705003059288174, 0.05415505562018552, -0.04032559578809014, -0.11447111144298106, -0.0018204615935246693, -0.19667516569384702, 0.025257604911530507, 0.22020120841489188, 0.07120264312106883, 0.22894318920589285, -0.33894983396021416, -0.13791041591321118, 0.08066872769813926, 0.210305207001511, 0.005234388819644664, -0.015006866904514027, -0.266389266389524, 0.06656338057655375, -0.12236265750152597, -0.15979560915548063, 0.046073311154032126, 0.0715979515739491, 0.04055262527344894, -0.21406061276411492, 0.17951334148881415, -0.0012260509511179407, 0.17676578124383013, -0.1075788633834236, -0.179692929956218, -0.05592880669291844, 0.10825152780125791, 0.028520050129827723, 0.07302725654153619, 0.16828840338530426, -0.12477680475330999, 0.020419936634198166, 0.36093609807721805, -0.04290897265332205, -0.06981006540354429, 0.20109563366531802, -0.21753735177480849, -0.1454883523706485, 0.10191573388647157, 0.15101746216896572, 0.09425338848450338, -0.17269334909360623, 0.03976353478060446, -0.014524778685881756, 0.23905310713871586, 0.06857686918101535, 0.0645283108511876, 0.268237747333842, 0.061433727973053465, 0.05925335341726168, 0.05518866668535338, -0.24765181678799308, -0.035615351762317005, -0.2801312846440851, -0.07223156429120081, -0.13858465188695845, 0.026319849901540238, -0.19636936598107013, -0.10090620800838224, 0.3809587605210254, 0.12303778289151523, 0.26264210569479474, 0.11288333847232934, 0.2851556539826561, 0.05828050845912003, 0.1521255800353174, 0.10342940553891822, 0.3185667832718764, 0.12691871379593067, 0.06819936537795002, -0.18247163648175047, 0.02632676077155338, 0.013014906088756106]
|
1,803.03679
|
Twist Angle-Dependent Bands and Valley Inversion in 2D Materials/hBN
Heterostructures
|
The use of relative twist angle between adjacent atomic layers in a van der
Waals heterostructure, has emerged as a new degree of freedom to tune
electronic and optoelectronic properties of devices based on 2D materials.
Using ABA-stacked trilayer (TLG) graphene as the model system, we show that,
contrary to conventional wisdom, the band structures of 2D materials are
systematically tunable depending on their relative alignment angle between
hexagonal BN (hBN), even at very large twist angles. Moreover, addition or
removal of the hBN substrate results in an inversion of the K and K' valley in
TLG's lowest Landau level (LL). Our work illustrates the critical role played
by substrates in van der Waals heterostructures and opens the door towards band
structure modification and valley control via substrate and twist angle
engineering.
|
cond-mat.mes-hall
|
the use of relative twist angle between adjacent atomic layers in a van der waals heterostructure has emerged as a new degree of freedom to tune electronic and optoelectronic properties of devices based on 2d materials using abastacked trilayer tlg graphene as the model system we show that contrary to conventional wisdom the band structures of 2d materials are systematically tunable depending on their relative alignment angle between hexagonal bn hbn even at very large twist angles moreover addition or removal of the hbn substrate results in an inversion of the k and k valley in tlgs lowest landau level ll our work illustrates the critical role played by substrates in van der waals heterostructures and opens the door towards band structure modification and valley control via substrate and twist angle engineering
|
[['the', 'use', 'of', 'relative', 'twist', 'angle', 'between', 'adjacent', 'atomic', 'layers', 'in', 'a', 'van', 'der', 'waals', 'heterostructure', 'has', 'emerged', 'as', 'a', 'new', 'degree', 'of', 'freedom', 'to', 'tune', 'electronic', 'and', 'optoelectronic', 'properties', 'of', 'devices', 'based', 'on', '2d', 'materials', 'using', 'abastacked', 'trilayer', 'tlg', 'graphene', 'as', 'the', 'model', 'system', 'we', 'show', 'that', 'contrary', 'to', 'conventional', 'wisdom', 'the', 'band', 'structures', 'of', '2d', 'materials', 'are', 'systematically', 'tunable', 'depending', 'on', 'their', 'relative', 'alignment', 'angle', 'between', 'hexagonal', 'bn', 'hbn', 'even', 'at', 'very', 'large', 'twist', 'angles', 'moreover', 'addition', 'or', 'removal', 'of', 'the', 'hbn', 'substrate', 'results', 'in', 'an', 'inversion', 'of', 'the', 'k', 'and', 'k', 'valley', 'in', 'tlgs', 'lowest', 'landau', 'level', 'll', 'our', 'work', 'illustrates', 'the', 'critical', 'role', 'played', 'by', 'substrates', 'in', 'van', 'der', 'waals', 'heterostructures', 'and', 'opens', 'the', 'door', 'towards', 'band', 'structure', 'modification', 'and', 'valley', 'control', 'via', 'substrate', 'and', 'twist', 'angle', 'engineering']]
|
[-0.1749997854543229, 0.13203458939637075, -0.023795441764928964, -0.04340587224049324, -0.0285725207967599, -0.18919147835395328, 0.10774454949458948, 0.4405434817828901, -0.2911600335465857, -0.33571439387389657, -0.08504257914539652, -0.30047972435678466, -0.23715897745040077, 0.20833069215895553, 0.04423956273541824, 0.035291333956234724, -0.013691362014717677, -0.18511410780110688, -0.09230769574853846, -0.16392727479670252, 0.30826736801783694, 0.05378248393676723, 0.3431695064628553, 0.11847116294401613, 0.037232100631985246, 0.04091127941236747, 0.13330206484181073, -0.002605068423277275, -0.19086815706644053, 0.12757899445679152, 0.2182333825392451, -0.20119301625174668, 0.26514330063417385, -0.46302354592604167, -0.14798079816462245, -0.06100641238630156, 0.10575790341703617, 0.1514892792999462, -0.06144209645660312, -0.24197004398923705, 0.0671095159680893, -0.15479791267154558, -0.1068864604033782, -0.08189517778880669, -0.01903266861424499, -0.0024211430872762294, -0.1712663316156426, 0.045943616342617934, 0.04847863974866799, 0.09256904130399396, -0.04151690893096119, -0.18965273925762935, -0.13163263793279784, 0.10604684131227038, -0.0022962587209996964, 0.025959407514936614, 0.21855787148304057, -0.17804432457849156, -0.1144797447186923, 0.4109926164065572, -0.02451134701506376, -0.12170637735504318, 0.1753863777509347, -0.14288654071490534, -0.05863484151830727, 0.09477596033442144, 0.1199017683834289, 0.06816673620999085, -0.07746931900813554, 0.12526222729524528, 0.012485032357896367, 0.1889750200824699, 0.16183260710782965, 0.0954606002390695, 0.25436803393390484, 0.1737541687801819, 0.10131676114289087, 0.12402556890403062, -0.1255941564776356, -0.013250242012101367, -0.16729484051889318, -0.21432990439390062, -0.23855496847042532, 0.09183495624209613, -0.09037952228776924, -0.23574077937695564, 0.4164770926052535, 0.10890831245430463, 0.1778290486263083, -0.07071233964278222, 0.22965728865132073, 0.04408963077796877, 0.1174301388893968, -0.027276447480262228, 0.30188187961396057, 0.15249225660580012, 0.07376200759035507, -0.20850875139038896, 0.0705446317654357, 0.028072166746962026]
|
1,803.0368
|
Modulus metrics on networks
|
The concept of $p$-modulus gives a way to measure the richness of a family of
objects on a graph. In this paper, we investigate the families of connecting
walks between two fixed nodes and show how to use $p$-modulus to form a
parametrized family of graph metrics that generalize several well-known and
widely-used metrics. We also investigate a characteristic of metrics called the
"antisnowflaking exponent" and present some numerical findings supporting a
conjecture about the new metrics. We end with explicit computations of the new
metrics on some selected graphs.
|
math.MG
|
the concept of pmodulus gives a way to measure the richness of a family of objects on a graph in this paper we investigate the families of connecting walks between two fixed nodes and show how to use pmodulus to form a parametrized family of graph metrics that generalize several wellknown and widelyused metrics we also investigate a characteristic of metrics called the antisnowflaking exponent and present some numerical findings supporting a conjecture about the new metrics we end with explicit computations of the new metrics on some selected graphs
|
[['the', 'concept', 'of', 'pmodulus', 'gives', 'a', 'way', 'to', 'measure', 'the', 'richness', 'of', 'a', 'family', 'of', 'objects', 'on', 'a', 'graph', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'families', 'of', 'connecting', 'walks', 'between', 'two', 'fixed', 'nodes', 'and', 'show', 'how', 'to', 'use', 'pmodulus', 'to', 'form', 'a', 'parametrized', 'family', 'of', 'graph', 'metrics', 'that', 'generalize', 'several', 'wellknown', 'and', 'widelyused', 'metrics', 'we', 'also', 'investigate', 'a', 'characteristic', 'of', 'metrics', 'called', 'the', 'antisnowflaking', 'exponent', 'and', 'present', 'some', 'numerical', 'findings', 'supporting', 'a', 'conjecture', 'about', 'the', 'new', 'metrics', 'we', 'end', 'with', 'explicit', 'computations', 'of', 'the', 'new', 'metrics', 'on', 'some', 'selected', 'graphs']]
|
[-0.1742663442397888, 0.03228648534316695, -0.10133186357326052, 0.07565864442790116, -0.09277877424584619, -0.10777566036774536, 0.08572694717702362, 0.3758568223356531, -0.2329043967837698, -0.282457749160488, 0.07799606484470868, -0.3011326266457902, -0.22993889150701546, 0.2236846754143637, -0.10562174951427439, 0.02737011494680067, 0.04530982331770441, 0.05446804509487715, -0.1018477161859654, -0.23871868195109006, 0.4296547845843133, 0.007234648801386356, 0.23421818261777752, 0.08692990379143778, 0.11182318980481183, -0.048500430989968646, -0.058941371131981356, 0.06468097438376523, -0.23295894757299382, 0.19480542236876286, 0.18666852767882722, 0.16288621829341302, 0.2609716532647275, -0.3146030047301496, -0.1956650622717492, 0.15109704112571276, 0.10503493064198266, 0.08241587339931827, -0.04796681812901594, -0.268939822870359, 0.12058951811383614, -0.15740258528411472, -0.14401799199705043, -0.07922882414187482, 0.003924451562382406, 0.05728808256308286, -0.19871844595109814, -0.04088661426533108, 0.0727618354048287, 0.05583017699294881, -0.02599957991349563, -0.08491884550770347, 0.04171059940407953, 0.11583170341851001, 0.025985696324159712, 0.006189592735936049, 0.05022565086026875, -0.08297799013259434, -0.18852298964191688, 0.35431055766870423, -0.05256654627704888, -0.2163802211701326, 0.18498175026158267, -0.09184465107895183, -0.19419093466667312, 0.010595829812077325, 0.2135552265733648, 0.1464839033112767, -0.12559201910024445, 0.044097343452531176, -0.07360444597251127, 0.12671254700824117, 0.0944645069120975, 0.027221937030763102, 0.1357030323340317, 0.12091609080102336, 0.08935494641407152, 0.2013135641143563, -0.010723949912307637, -0.08186610234545523, -0.31791173146770785, -0.2003967994614766, -0.14462650609150363, 0.06038289030051131, -0.15148500475481158, -0.23228465941514861, 0.46935119063153946, 0.1457700552209542, 0.2519765422585305, 0.14243863844260407, 0.20092033548803812, 0.030300405033435045, 0.0289527025084231, 0.10857906028251635, 0.14929084164113998, 0.14791184460765192, 0.008591281365226494, -0.12895403513580225, 0.01918431734234576, 0.0963964781702988]
|
1,803.03681
|
Geometric and LP-based heuristics for the quadratic travelling salesman
problem
|
A generalization of the classical TSP is the so-called quadratic travelling
salesman problem (QTSP), in which a cost coefficient is associated with the
transition in every vertex, i.e. with every pair of edges traversed in
succession. In this paper we consider two geometrically motivated special cases
of the QTSP known from the literature, namely the angular-metric TSP, where
transition costs correspond to turning angles in every vertex, and the
angular-distance-metric TSP, where a linear combination of turning angles and
Euclidean distances is considered.
At first we introduce a wide range of heuristic approaches, motivated by the
typical geometric structure of optimal solutions. In particular, we exploit
lens-shaped neighborhoods of edges and a decomposition of the graph into layers
of convex hulls, which are then merged into a tour by a greedy-type procedure
or by utilizing an ILP model. Secondly, we consider an ILP model for a standard
linearization of QTSP and compute fractional solutions of a relaxation. By
rounding we obtain a collection of subtours, paths and isolated points, which
are combined into a tour by various strategies, all of them involving auxiliary
ILP models. Finally, different improvement heuristics are proposed, most
notably a matheuristic which locally reoptimizes the solution for rectangular
sectors of the given point set by an ILP approach.
Extensive computational experiments for benchmark instances from the
literature and extensions thereof illustrate the Pareto-efficient frontier of
algorithms in a (running time, objective value)-space. It turns out that our
new methods clearly dominate the previously published heuristics.
|
cs.DM
|
a generalization of the classical tsp is the socalled quadratic travelling salesman problem qtsp in which a cost coefficient is associated with the transition in every vertex ie with every pair of edges traversed in succession in this paper we consider two geometrically motivated special cases of the qtsp known from the literature namely the angularmetric tsp where transition costs correspond to turning angles in every vertex and the angulardistancemetric tsp where a linear combination of turning angles and euclidean distances is considered at first we introduce a wide range of heuristic approaches motivated by the typical geometric structure of optimal solutions in particular we exploit lensshaped neighborhoods of edges and a decomposition of the graph into layers of convex hulls which are then merged into a tour by a greedytype procedure or by utilizing an ilp model secondly we consider an ilp model for a standard linearization of qtsp and compute fractional solutions of a relaxation by rounding we obtain a collection of subtours paths and isolated points which are combined into a tour by various strategies all of them involving auxiliary ilp models finally different improvement heuristics are proposed most notably a matheuristic which locally reoptimizes the solution for rectangular sectors of the given point set by an ilp approach extensive computational experiments for benchmark instances from the literature and extensions thereof illustrate the paretoefficient frontier of algorithms in a running time objective valuespace it turns out that our new methods clearly dominate the previously published heuristics
|
[['a', 'generalization', 'of', 'the', 'classical', 'tsp', 'is', 'the', 'socalled', 'quadratic', 'travelling', 'salesman', 'problem', 'qtsp', 'in', 'which', 'a', 'cost', 'coefficient', 'is', 'associated', 'with', 'the', 'transition', 'in', 'every', 'vertex', 'ie', 'with', 'every', 'pair', 'of', 'edges', 'traversed', 'in', 'succession', 'in', 'this', 'paper', 'we', 'consider', 'two', 'geometrically', 'motivated', 'special', 'cases', 'of', 'the', 'qtsp', 'known', 'from', 'the', 'literature', 'namely', 'the', 'angularmetric', 'tsp', 'where', 'transition', 'costs', 'correspond', 'to', 'turning', 'angles', 'in', 'every', 'vertex', 'and', 'the', 'angulardistancemetric', 'tsp', 'where', 'a', 'linear', 'combination', 'of', 'turning', 'angles', 'and', 'euclidean', 'distances', 'is', 'considered', 'at', 'first', 'we', 'introduce', 'a', 'wide', 'range', 'of', 'heuristic', 'approaches', 'motivated', 'by', 'the', 'typical', 'geometric', 'structure', 'of', 'optimal', 'solutions', 'in', 'particular', 'we', 'exploit', 'lensshaped', 'neighborhoods', 'of', 'edges', 'and', 'a', 'decomposition', 'of', 'the', 'graph', 'into', 'layers', 'of', 'convex', 'hulls', 'which', 'are', 'then', 'merged', 'into', 'a', 'tour', 'by', 'a', 'greedytype', 'procedure', 'or', 'by', 'utilizing', 'an', 'ilp', 'model', 'secondly', 'we', 'consider', 'an', 'ilp', 'model', 'for', 'a', 'standard', 'linearization', 'of', 'qtsp', 'and', 'compute', 'fractional', 'solutions', 'of', 'a', 'relaxation', 'by', 'rounding', 'we', 'obtain', 'a', 'collection', 'of', 'subtours', 'paths', 'and', 'isolated', 'points', 'which', 'are', 'combined', 'into', 'a', 'tour', 'by', 'various', 'strategies', 'all', 'of', 'them', 'involving', 'auxiliary', 'ilp', 'models', 'finally', 'different', 'improvement', 'heuristics', 'are', 'proposed', 'most', 'notably', 'a', 'matheuristic', 'which', 'locally', 'reoptimizes', 'the', 'solution', 'for', 'rectangular', 'sectors', 'of', 'the', 'given', 'point', 'set', 'by', 'an', 'ilp', 'approach', 'extensive', 'computational', 'experiments', 'for', 'benchmark', 'instances', 'from', 'the', 'literature', 'and', 'extensions', 'thereof', 'illustrate', 'the', 'paretoefficient', 'frontier', 'of', 'algorithms', 'in', 'a', 'running', 'time', 'objective', 'valuespace', 'it', 'turns', 'out', 'that', 'our', 'new', 'methods', 'clearly', 'dominate', 'the', 'previously', 'published', 'heuristics']]
|
[-0.11234718535718562, 0.0413892066387577, -0.07656086949139192, 0.04237659432692453, -0.08812332431476594, -0.15020799383971473, 0.07890410346339731, 0.36701126978350956, -0.3093585855815155, -0.3076493471677675, 0.10787921996508557, -0.29234833299033497, -0.17893215571625587, 0.18440680536746856, -0.04939836332026762, 0.05971644747072877, 0.0859533551409812, 0.016935261024150723, -0.07419632424502137, -0.25203491452202054, 0.3000549592009326, -0.010926298410669884, 0.21315283127526036, 0.02220270642867602, 0.12052745181069037, 0.024170457772418216, 0.005945604589393698, 0.10657277211531123, -0.1415023045552874, 0.10656763242555736, 0.26622724336578013, 0.14642059220932424, 0.29571909709074, -0.4216772030818812, -0.17139623677510707, 0.1268006676639102, 0.11754500185240625, 0.0994613462463632, -0.03600758551448187, -0.24655654643601205, 0.06773037528886353, -0.10169711952731318, -0.07016781264425591, -0.02598402461468349, 0.016262064083406823, 0.02366286932708329, -0.2767475773840398, 0.001599301214780292, 0.053323795277526086, 0.00574204077130445, -0.052190485376994444, -0.16500082202055338, 0.019219678642942006, 0.06659303940966206, 0.032668653149424944, 0.03474651760999953, 0.051097205055440534, -0.11880276490386468, -0.20731172938334955, 0.40111528735485724, -0.013983623168791919, -0.20451904528155984, 0.16069161620078853, -0.05647949504830157, -0.1183815884001202, 0.14374675270080275, 0.18472422281333598, 0.1805683249248894, -0.1502343274227851, 0.11109334602999715, -0.09698051276815231, 0.09943656465785337, 0.11057972375658479, -0.023568536273249594, 0.16694675407326612, 0.17033759660858538, 0.14377716906725613, 0.180043474181372, -0.036400479295450365, -0.12084979654984457, -0.3014107969642968, -0.11814332365814108, -0.18021503467538363, -0.0033417163940612227, -0.13837533072173905, -0.1696075935553202, 0.4177263327110864, 0.12027922688413709, 0.21124493423205243, 0.10198082083288831, 0.27662175324684407, 0.11097040490184569, 0.06883606364708164, 0.12398079569837017, 0.1829559244759396, 0.04783362987905466, 0.03949700858344736, -0.18543544250347682, 0.031386157387073656, 0.1175038424286167]
|
1,803.03682
|
Network Traffic Driven Storage Repair
|
Recently we constructed an explicit family of locally repairable and locally
regenerating codes. Their existence was proven by Kamath et al. but no explicit
construction was given. Our design is based on HashTag codes that can have
different sub-packetization levels. In this work we emphasize the importance of
having two ways to repair a node: repair only with local parity nodes or repair
with both local and global parity nodes. We say that the repair strategy is
network traffic driven since it is in connection with the concrete system and
code parameters: the repair bandwidth of the code, the number of I/O
operations, the access time for the contacted parts and the size of the stored
file. We show the benefits of having repair duality in one practical example
implemented in Hadoop. We also give algorithms for efficient repair of the
global parity nodes.
|
cs.IT cs.DC math.IT
|
recently we constructed an explicit family of locally repairable and locally regenerating codes their existence was proven by kamath et al but no explicit construction was given our design is based on hashtag codes that can have different subpacketization levels in this work we emphasize the importance of having two ways to repair a node repair only with local parity nodes or repair with both local and global parity nodes we say that the repair strategy is network traffic driven since it is in connection with the concrete system and code parameters the repair bandwidth of the code the number of io operations the access time for the contacted parts and the size of the stored file we show the benefits of having repair duality in one practical example implemented in hadoop we also give algorithms for efficient repair of the global parity nodes
|
[['recently', 'we', 'constructed', 'an', 'explicit', 'family', 'of', 'locally', 'repairable', 'and', 'locally', 'regenerating', 'codes', 'their', 'existence', 'was', 'proven', 'by', 'kamath', 'et', 'al', 'but', 'no', 'explicit', 'construction', 'was', 'given', 'our', 'design', 'is', 'based', 'on', 'hashtag', 'codes', 'that', 'can', 'have', 'different', 'subpacketization', 'levels', 'in', 'this', 'work', 'we', 'emphasize', 'the', 'importance', 'of', 'having', 'two', 'ways', 'to', 'repair', 'a', 'node', 'repair', 'only', 'with', 'local', 'parity', 'nodes', 'or', 'repair', 'with', 'both', 'local', 'and', 'global', 'parity', 'nodes', 'we', 'say', 'that', 'the', 'repair', 'strategy', 'is', 'network', 'traffic', 'driven', 'since', 'it', 'is', 'in', 'connection', 'with', 'the', 'concrete', 'system', 'and', 'code', 'parameters', 'the', 'repair', 'bandwidth', 'of', 'the', 'code', 'the', 'number', 'of', 'io', 'operations', 'the', 'access', 'time', 'for', 'the', 'contacted', 'parts', 'and', 'the', 'size', 'of', 'the', 'stored', 'file', 'we', 'show', 'the', 'benefits', 'of', 'having', 'repair', 'duality', 'in', 'one', 'practical', 'example', 'implemented', 'in', 'hadoop', 'we', 'also', 'give', 'algorithms', 'for', 'efficient', 'repair', 'of', 'the', 'global', 'parity', 'nodes']]
|
[-0.21590659234950887, 0.04849765937504142, -0.02560930727082046, 0.028460408798612963, -0.032029652709348336, -0.22765244699096204, 0.10344160890801707, 0.3835253182721014, -0.27617992441648515, -0.32529979317587276, 0.10513922197828328, -0.2456395892917903, -0.14020071119981972, 0.12916500828739824, -0.10788626476197452, 0.07745593104563239, 0.047385570408854015, 0.054948459222537674, -0.044491543378980064, -0.3335144930913682, 0.3041900698137599, 0.1668663659576042, 0.2902032164113027, 0.03070628032825577, 0.038053758410064295, 0.003186631034218913, -0.03603402133578331, -0.010119349192084175, -0.13040817057693252, 0.10118523225699189, 0.2912702151548324, 0.1985942656028783, 0.2443580903507407, -0.45852669576803845, -0.18945210664545206, 0.11279781323779996, 0.10592675457964004, 0.1721840050174958, -0.07379285360042963, -0.21842857923184056, 0.13958016573128085, -0.22322814874739075, -0.045899373799329624, -0.05898733453715169, 0.03172135498607531, 0.014156921786100915, -0.2777712596192335, -0.031096968177532998, 0.04016936668813287, 0.06783978389931791, -0.04442894793949866, -0.08076518194138771, -0.04428099303267016, 0.12825398580591557, -0.00012545113612658397, 0.0065621628713819925, 0.08350647181052612, -0.03386935127168221, -0.15474093377189194, 0.3258355446576186, 0.06531070281602701, -0.19390050822079907, 0.18801853427592302, -0.012452667119861063, -0.1580940137630225, 0.09640194804200695, 0.17687305741451886, 0.09270171686593029, -0.13879860425772172, 0.0953573955387886, -0.06474680142451285, 0.18267355956615777, 0.11335740482091852, 0.08359067563934433, 0.11987711934165822, 0.14833055711480686, 0.0844644099302564, 0.17481588462315914, -0.03820128724409086, -0.06603124555395981, -0.2735635895644211, -0.14425604443325332, -0.2084501381969959, 0.007461346828171777, -0.08490475656961077, -0.14574662682005307, 0.4257302484733777, 0.12376235122469047, 0.1339851093232735, 0.11327305718118118, 0.29351479097062516, 0.02840016294390403, 0.14824169646858032, 0.21917339421149032, 0.14807857633018606, 0.04472681628895872, 0.04446648597392292, -0.2229040533748048, 0.11126035706062491, 0.08384515065053064]
|
1,803.03683
|
Nonperturbative Renormalization Group for the Landau-de Gennes Model
|
We studied the nematic isotropic phase transition by applying the functional
renormalization group to the Landau-de Gennes model. We derived the flow
equations for the effective potential as well as the cubic and quartic
"couplings" and the anomalous dimension. We then solved the coupled flow
equations on a grid using Newton Raphson method. A first order phase transition
is observed. We also investigated the nematic isotropic puzzle (the NI puzzle)
in this paper. We obtained the NI transition temperature difference
${T_c-T^*}=5.85K$ with sizable improvement over previous results.
|
cond-mat.stat-mech hep-ph
|
we studied the nematic isotropic phase transition by applying the functional renormalization group to the landaude gennes model we derived the flow equations for the effective potential as well as the cubic and quartic couplings and the anomalous dimension we then solved the coupled flow equations on a grid using newton raphson method a first order phase transition is observed we also investigated the nematic isotropic puzzle the ni puzzle in this paper we obtained the ni transition temperature difference t_ct585k with sizable improvement over previous results
|
[['we', 'studied', 'the', 'nematic', 'isotropic', 'phase', 'transition', 'by', 'applying', 'the', 'functional', 'renormalization', 'group', 'to', 'the', 'landaude', 'gennes', 'model', 'we', 'derived', 'the', 'flow', 'equations', 'for', 'the', 'effective', 'potential', 'as', 'well', 'as', 'the', 'cubic', 'and', 'quartic', 'couplings', 'and', 'the', 'anomalous', 'dimension', 'we', 'then', 'solved', 'the', 'coupled', 'flow', 'equations', 'on', 'a', 'grid', 'using', 'newton', 'raphson', 'method', 'a', 'first', 'order', 'phase', 'transition', 'is', 'observed', 'we', 'also', 'investigated', 'the', 'nematic', 'isotropic', 'puzzle', 'the', 'ni', 'puzzle', 'in', 'this', 'paper', 'we', 'obtained', 'the', 'ni', 'transition', 'temperature', 'difference', 't_ct585k', 'with', 'sizable', 'improvement', 'over', 'previous', 'results']]
|
[-0.14241691066905163, 0.12273246426200278, -0.06112613956725528, 0.047977914018448184, -0.0626708306642899, -0.11729375163613018, 0.031669770200942575, 0.3512081604256013, -0.27094569256485895, -0.3084783427049081, 0.06383068784177953, -0.3206830853163156, -0.17809791023149912, 0.09239853316509208, 0.060854492427478, 0.07133399429297897, -0.06307489889251544, -0.007381173132290674, -0.14693293110792374, -0.25524764437618297, 0.314610512125804, -0.010047093943454499, 0.27975707425367696, 0.059803496943353567, 0.10956248525140244, -0.0051759942922048096, 0.07125296834639686, 0.11388146978001608, -0.23473444354157288, 0.058054490924574605, 0.22009845389064056, -0.06653056886631908, 0.15327256036445844, -0.4158826605525128, -0.2328611056775201, 0.08178859982953601, 0.15334871770857378, 0.14540463863590428, -0.08054418296168753, -0.2799337511925503, 0.022424243540817134, -0.17566324245227977, -0.17311179668231066, -0.09838284307895878, -0.056447003989718685, -0.01698714821209568, -0.24416020794008145, 0.11212092527894975, 0.030669931399495188, 0.06387223804716108, -0.10377001916708121, -0.1219191892711489, -0.03873789383282582, 0.06151528770055319, 0.061381080319162805, 0.04914869246787803, 0.07844236199094286, -0.08597197713666098, -0.0709871607291144, 0.39795252589270647, -0.1430915251311976, -0.14416704963632795, 0.08943115430071863, -0.12963127217060605, -0.11035925115805206, 0.15221673851226306, 0.14331147202485522, 0.13852837842585908, -0.12625108494661574, 0.10813941035912437, -0.020282405542296378, 0.15512841744998165, 0.011110178779724032, -0.09703241128387839, 0.11139149891299217, 0.19016885944793738, 0.012363795472612215, 0.11641677727836162, -0.08744171396883335, -0.14052479985971436, -0.3021610624828311, -0.1381076239807488, -0.1930073998532756, 0.011790206412199971, -0.12062719264467041, -0.1396456691544763, 0.38428469660670256, 0.14139325514998893, 0.16124340094257752, 0.011725582991899965, 0.25681508667658753, 0.14967236004845608, 0.03641558283138587, 0.05981539722077202, 0.27278114125392466, 0.17244527465393117, 0.15697618731876922, -0.29347545655747487, 0.0011821799954875958, 0.1545312595770283]
|
1,803.03684
|
Scoring Formulation for Multi-Condition Joint PLDA
|
The joint PLDA model, is a generalization of PLDA where the nuisance variable
is no longer considered independent across samples, but potentially shared
(tied) across samples that correspond to the same nuisance condition. The
original work considered a single nuisance condition, deriving the EM and
scoring formulas for this scenario. In this document, we show how to obtain
likelihood ratios for scoring when multiple nuisance conditions are allowed in
the model.
|
cs.LG stat.ML
|
the joint plda model is a generalization of plda where the nuisance variable is no longer considered independent across samples but potentially shared tied across samples that correspond to the same nuisance condition the original work considered a single nuisance condition deriving the em and scoring formulas for this scenario in this document we show how to obtain likelihood ratios for scoring when multiple nuisance conditions are allowed in the model
|
[['the', 'joint', 'plda', 'model', 'is', 'a', 'generalization', 'of', 'plda', 'where', 'the', 'nuisance', 'variable', 'is', 'no', 'longer', 'considered', 'independent', 'across', 'samples', 'but', 'potentially', 'shared', 'tied', 'across', 'samples', 'that', 'correspond', 'to', 'the', 'same', 'nuisance', 'condition', 'the', 'original', 'work', 'considered', 'a', 'single', 'nuisance', 'condition', 'deriving', 'the', 'em', 'and', 'scoring', 'formulas', 'for', 'this', 'scenario', 'in', 'this', 'document', 'we', 'show', 'how', 'to', 'obtain', 'likelihood', 'ratios', 'for', 'scoring', 'when', 'multiple', 'nuisance', 'conditions', 'are', 'allowed', 'in', 'the', 'model']]
|
[-0.07913290425597257, 0.05686690870829871, -0.0710310088995267, 0.12327588585690713, -0.1136606684066093, -0.21644671564318343, 0.08050364040782754, 0.3878848617634093, -0.2544629728014935, -0.33417475517366974, 0.0727585601640052, -0.20283547153984996, -0.09407456098517901, 0.17569754825590153, -0.10944544844567927, 0.05246289256750278, 0.07846235432727657, 0.045932746111926895, -0.06240479279847317, -0.2992944981850369, 0.2942855082793345, 0.05049301185776335, 0.32387110013777104, -0.05866136424190981, 0.09729443331131003, 0.04040445708735308, -0.07702046627519836, -0.019384145172653904, -0.11229618741447371, 0.056250069788853885, 0.28282525187725543, 0.16408901110455038, 0.3045870205256301, -0.3256550696120978, -0.23596858777578028, 0.14907134952627019, 0.12775133415715587, 0.07848121692151042, 0.07373207147744759, -0.24232596124876554, 0.026364235915768315, -0.1489826543650157, -0.04144248971059709, -0.07452709776100139, -0.02088548650991329, -0.04457906262398186, -0.3971161017010749, 0.1330448367541105, 0.08222927410208003, 0.014786074489960119, -0.0855263203651395, -0.13457678395985875, -0.000650300316407647, 0.09124901665015553, 0.11484762816689909, 0.0030480429766253686, 0.08834695398256602, -0.11211804828514725, -0.054149477844270814, 0.35524067891315675, -0.03552148291762446, -0.29353103489601906, 0.1436955766804831, -0.10284426557162488, -0.18677096721440764, 0.06882961341966941, 0.15390588513011455, 0.12822010733423309, -0.22308004150125296, 0.017064545040418932, -0.07521761210084381, 0.19935248472767186, 0.05874717981279106, 0.019976713024014214, 0.18327416728814722, 0.13104003504440057, 0.02876626401090286, 0.16245291192530537, -0.09563196840709154, -0.0666531653891147, -0.3457498138739308, -0.09771252805563871, -0.18069597611754712, -0.025300631102856616, -0.130215938602907, -0.2249257791734917, 0.3725524097549873, 0.21384218715551034, 0.21848716926564213, 0.10127580624227871, 0.2783687559651657, 0.0933587322549396, 0.0986156849425063, 0.024828969645248333, 0.19683315414725475, 0.06252837099764548, 0.02976133910493112, -0.13347390742847878, 0.16375558047463568, -0.028665834723014226]
|
1,803.03685
|
Lattice Diagrams of Knots and Diagrams of Lattice Stick Knots
|
We give a simple example showing that a knot or link diagram that lies in the
${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick
knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and
sufficient condition for when a knot or link diagram that lies in the
${\mathbb{Z}}^2$ lattice is in fact the projection of a lattice stick knot or
link.
|
math.GT
|
we give a simple example showing that a knot or link diagram that lies in the mathbbz2 lattice is not necessarily the projection of a lattice stick knot or link in the mathbbz3 lattice and we give a necessary and sufficient condition for when a knot or link diagram that lies in the mathbbz2 lattice is in fact the projection of a lattice stick knot or link
|
[['we', 'give', 'a', 'simple', 'example', 'showing', 'that', 'a', 'knot', 'or', 'link', 'diagram', 'that', 'lies', 'in', 'the', 'mathbbz2', 'lattice', 'is', 'not', 'necessarily', 'the', 'projection', 'of', 'a', 'lattice', 'stick', 'knot', 'or', 'link', 'in', 'the', 'mathbbz3', 'lattice', 'and', 'we', 'give', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'when', 'a', 'knot', 'or', 'link', 'diagram', 'that', 'lies', 'in', 'the', 'mathbbz2', 'lattice', 'is', 'in', 'fact', 'the', 'projection', 'of', 'a', 'lattice', 'stick', 'knot', 'or', 'link']]
|
[-0.24891270129288087, 0.15212905726659653, -0.1505878715734206, 0.04475680412377106, -0.12693804480246643, -0.21671190581270564, 0.15463099121672116, 0.42414280794449705, -0.2591502938363979, -0.18388178838945146, 0.15943749627765658, -0.2023638486306169, -0.19021891348008343, 0.0868956086072904, -0.08647936968994674, -0.0714112543257704, 0.10499674640595913, 0.1040329042919425, -0.07010525080319772, -0.24424366900391542, 0.29658496813542806, -0.05508931503811879, 0.18676376081447102, 0.12585361534034584, 0.06786600928475607, 0.014024795776705689, 0.007036856254006722, 0.03221953101282411, -0.23346503252507128, 0.05256609732646551, 0.1549452714093808, 0.018360907545507843, 0.11310318869941716, -0.3911440307413464, -0.14817846025715567, 0.15286707456932583, 0.1541012045857844, 0.05812376534649685, -0.04530635541270195, -0.19233246076393373, 0.036842787464552405, -0.14880537541944588, -0.15527967687473812, 0.007949092161299577, -0.003446586409222279, 0.027253537202504143, -0.24809871736997322, 0.02471916435925818, 0.13105089798458477, 0.1477876493139123, 0.04896928937132679, -0.05121548066555119, -0.007836312715853774, 0.14823955749795745, -0.05198137485074686, 0.14974379363650483, 0.041112380866795334, -0.17021291581357814, -0.1463879807782707, 0.4956137855995947, -0.01085670441806094, -0.23851789823218958, 0.19250354945048023, -0.17584167078915816, -0.16455589610138047, 0.18758751626418374, 0.021940972405805517, -0.0034969006804054354, -0.04811306363566772, 0.08109119131208968, -0.18486442355744875, 0.1484702625103406, 0.033404205522652886, -0.05893953053503117, 0.21033125102464387, 0.11515643452850184, 0.1379184615485537, 0.19315189189875304, -0.054631120205592756, -0.0901769174457486, -0.3469982734367029, -0.22938447782714197, -0.24396141184799708, 0.07808788021033414, -0.09213287941373037, -0.19831176598403435, 0.3771164443260476, 0.03696431787406553, 0.22542019900101334, 0.06892845604513119, 0.2377916264431134, 0.06282440372377829, 0.05218516265167229, 0.05385005914731257, 0.13382758375312856, 0.12246783478046532, -0.030372549626809447, -0.15547574432427758, 0.006714851762265411, 0.20339079142145033]
|
1,803.03686
|
Jetting Through The Primordial Universe
|
Collisions of heavy ion nuclei at relativistic speeds (close to the speed of
light) creates a high temperature and very dense form of matter, now known to
consist of de-confined quarks and gluons, named the quark gluon plasma (QGP).
In this thesis, Run1 experimental data from pp and heavy ion collisions at the
CERN LHC is analyzed with the CMS detector. The pp jet cross section is
compared with next to leading order theoretical calculations supplemented with
non perturbative corrections for three different jet radii highlighting better
comparisons for larger radii jets. Measurement of the jet yield followed by the
nuclear modification factors in proton-lead at 5.02 TeV and lead-lead
collisions at 2.76 TeV are presented. A new data driven technique is introduced
to estimate and correct for the fake jet contribution in PbPb for low
transverse momenta jets. The nuclear modification factors studied in this
thesis show jet quenching to be attributed to final state effects, have a
strong correlation to the event centrality, a weak inverse correlation to the
jet transverse momenta and an apparent independence on the jet radii in the
kinematic range studied. These measurements are compared with leading
theoretical model calculations and other experimental results at the LHC
leading to unanimous agreement on the qualitative nature of jet quenching. This
thesis also features novel updates to the Monte Carlo heavy ion event generator
JEWEL (Jet Evolution With Energy Loss) including the boson-jet production
channels and also background subtraction techniques to reduce the effect of the
thermal background. Keeping track of these jet-medium recoils in JEWEL due to
the background subtraction techniques significantly improves its descriptions
of several jet structure and sub-structure measurements at the LHC. [Shortened
abstract]
|
hep-ex hep-ph
|
collisions of heavy ion nuclei at relativistic speeds close to the speed of light creates a high temperature and very dense form of matter now known to consist of deconfined quarks and gluons named the quark gluon plasma qgp in this thesis run1 experimental data from pp and heavy ion collisions at the cern lhc is analyzed with the cms detector the pp jet cross section is compared with next to leading order theoretical calculations supplemented with non perturbative corrections for three different jet radii highlighting better comparisons for larger radii jets measurement of the jet yield followed by the nuclear modification factors in protonlead at 502 tev and leadlead collisions at 276 tev are presented a new data driven technique is introduced to estimate and correct for the fake jet contribution in pbpb for low transverse momenta jets the nuclear modification factors studied in this thesis show jet quenching to be attributed to final state effects have a strong correlation to the event centrality a weak inverse correlation to the jet transverse momenta and an apparent independence on the jet radii in the kinematic range studied these measurements are compared with leading theoretical model calculations and other experimental results at the lhc leading to unanimous agreement on the qualitative nature of jet quenching this thesis also features novel updates to the monte carlo heavy ion event generator jewel jet evolution with energy loss including the bosonjet production channels and also background subtraction techniques to reduce the effect of the thermal background keeping track of these jetmedium recoils in jewel due to the background subtraction techniques significantly improves its descriptions of several jet structure and substructure measurements at the lhc shortened abstract
|
[['collisions', 'of', 'heavy', 'ion', 'nuclei', 'at', 'relativistic', 'speeds', 'close', 'to', 'the', 'speed', 'of', 'light', 'creates', 'a', 'high', 'temperature', 'and', 'very', 'dense', 'form', 'of', 'matter', 'now', 'known', 'to', 'consist', 'of', 'deconfined', 'quarks', 'and', 'gluons', 'named', 'the', 'quark', 'gluon', 'plasma', 'qgp', 'in', 'this', 'thesis', 'run1', 'experimental', 'data', 'from', 'pp', 'and', 'heavy', 'ion', 'collisions', 'at', 'the', 'cern', 'lhc', 'is', 'analyzed', 'with', 'the', 'cms', 'detector', 'the', 'pp', 'jet', 'cross', 'section', 'is', 'compared', 'with', 'next', 'to', 'leading', 'order', 'theoretical', 'calculations', 'supplemented', 'with', 'non', 'perturbative', 'corrections', 'for', 'three', 'different', 'jet', 'radii', 'highlighting', 'better', 'comparisons', 'for', 'larger', 'radii', 'jets', 'measurement', 'of', 'the', 'jet', 'yield', 'followed', 'by', 'the', 'nuclear', 'modification', 'factors', 'in', 'protonlead', 'at', '502', 'tev', 'and', 'leadlead', 'collisions', 'at', '276', 'tev', 'are', 'presented', 'a', 'new', 'data', 'driven', 'technique', 'is', 'introduced', 'to', 'estimate', 'and', 'correct', 'for', 'the', 'fake', 'jet', 'contribution', 'in', 'pbpb', 'for', 'low', 'transverse', 'momenta', 'jets', 'the', 'nuclear', 'modification', 'factors', 'studied', 'in', 'this', 'thesis', 'show', 'jet', 'quenching', 'to', 'be', 'attributed', 'to', 'final', 'state', 'effects', 'have', 'a', 'strong', 'correlation', 'to', 'the', 'event', 'centrality', 'a', 'weak', 'inverse', 'correlation', 'to', 'the', 'jet', 'transverse', 'momenta', 'and', 'an', 'apparent', 'independence', 'on', 'the', 'jet', 'radii', 'in', 'the', 'kinematic', 'range', 'studied', 'these', 'measurements', 'are', 'compared', 'with', 'leading', 'theoretical', 'model', 'calculations', 'and', 'other', 'experimental', 'results', 'at', 'the', 'lhc', 'leading', 'to', 'unanimous', 'agreement', 'on', 'the', 'qualitative', 'nature', 'of', 'jet', 'quenching', 'this', 'thesis', 'also', 'features', 'novel', 'updates', 'to', 'the', 'monte', 'carlo', 'heavy', 'ion', 'event', 'generator', 'jewel', 'jet', 'evolution', 'with', 'energy', 'loss', 'including', 'the', 'bosonjet', 'production', 'channels', 'and', 'also', 'background', 'subtraction', 'techniques', 'to', 'reduce', 'the', 'effect', 'of', 'the', 'thermal', 'background', 'keeping', 'track', 'of', 'these', 'jetmedium', 'recoils', 'in', 'jewel', 'due', 'to', 'the', 'background', 'subtraction', 'techniques', 'significantly', 'improves', 'its', 'descriptions', 'of', 'several', 'jet', 'structure', 'and', 'substructure', 'measurements', 'at', 'the', 'lhc', 'shortened', 'abstract']]
|
[-0.037232625763863325, 0.1924753518645996, -0.1518778185185098, 0.14570727460713834, -0.031217615943276555, -0.10313183109355258, -0.06004143312655171, 0.38272473569926374, -0.1994516215227703, -0.3254437496495955, -0.016191823071971905, -0.35363684482674335, 0.09930301848398554, 0.15438753808188047, 0.03655172870387092, 0.09854870653816115, 0.13365629932872872, -0.026280017617548293, -0.07113352035509145, -0.20324716115319202, 0.2915066744247121, 0.16894431495382647, 0.2263048333916747, 0.15408196937889754, 0.09085873345735464, 0.03454284316609145, -0.08240573822437283, 0.008562033010171131, -0.10780604573639385, 0.05069292918231969, 0.25223542980545083, 0.022443584154082583, 0.14892773235046242, -0.3849224576640689, -0.14532629542470932, 0.050694585516503916, 0.12617408812371353, 0.10466964755117306, -0.07687646145666108, -0.2584463668894683, 0.11330657398182872, -0.2755679633997419, -0.1390217960769218, -0.04240675667814369, -0.020049889438830196, -0.020338061272665357, -0.28209588361894944, 0.11284403703220895, -0.017146338288447693, 0.058469311653664056, 0.010438853606882221, -0.16128439573651174, -0.04997004301234393, 0.00853635089353044, 0.12700669779747736, 0.11297249595584276, 0.2176026162882963, -0.1855159173030175, -0.1790347917831886, 0.37274592945183765, 0.00647865385948251, -0.1069366059237959, 0.22198460711635226, -0.2082347675698895, -0.15490330408198483, 0.19799473158032047, 0.26999420456997786, 0.07432541807850077, -0.17970450612710598, 0.001165044816695517, 0.04123169364876622, 0.15421195669677998, 0.07259863980134275, 0.07965213895573818, 0.16705179546963, 0.1817443682647026, -0.039626626508369886, 0.08363306454496569, -0.12297423879437624, -0.07851013819297366, -0.3951853077449169, -0.051524025612945855, -0.08484590297142962, 0.0047122915118523205, -0.09387114857019425, -0.0664654228149365, 0.37282992581793944, 0.11380445324624468, 0.2660304990758895, -0.02988761385196014, 0.32522455719877563, 0.05463390150136341, 0.0568966783569954, 0.1230657467427036, 0.32494681599097497, 0.17610369288570624, 0.19506130002130231, -0.265022309553968, 0.05432581033636915, 0.06848637467573879]
|
1,803.03687
|
Data Driven Stability Analysis of Black-box Switched Linear Systems
|
Can we conclude the stability of an unknown dynamical system from the
knowledge of a finite number of snapshots of trajectories? We tackle this
black-box problem for switched linear systems. We show that, for any given
random set of observations, one can give probabilistic stability guarantees.
The probabilistic nature of these guarantees implies a trade-off between their
quality and the desired level of confidence. We provide an explicit way of
computing the best stability-like guarantee, as a function of both the number
of observations and the required level of confidence. Our proof techniques rely
on geometrical analysis, chance-constrained optimization, and stability
analysis tools for switched systems, including the joint spectral radius.
|
math.OC
|
can we conclude the stability of an unknown dynamical system from the knowledge of a finite number of snapshots of trajectories we tackle this blackbox problem for switched linear systems we show that for any given random set of observations one can give probabilistic stability guarantees the probabilistic nature of these guarantees implies a tradeoff between their quality and the desired level of confidence we provide an explicit way of computing the best stabilitylike guarantee as a function of both the number of observations and the required level of confidence our proof techniques rely on geometrical analysis chanceconstrained optimization and stability analysis tools for switched systems including the joint spectral radius
|
[['can', 'we', 'conclude', 'the', 'stability', 'of', 'an', 'unknown', 'dynamical', 'system', 'from', 'the', 'knowledge', 'of', 'a', 'finite', 'number', 'of', 'snapshots', 'of', 'trajectories', 'we', 'tackle', 'this', 'blackbox', 'problem', 'for', 'switched', 'linear', 'systems', 'we', 'show', 'that', 'for', 'any', 'given', 'random', 'set', 'of', 'observations', 'one', 'can', 'give', 'probabilistic', 'stability', 'guarantees', 'the', 'probabilistic', 'nature', 'of', 'these', 'guarantees', 'implies', 'a', 'tradeoff', 'between', 'their', 'quality', 'and', 'the', 'desired', 'level', 'of', 'confidence', 'we', 'provide', 'an', 'explicit', 'way', 'of', 'computing', 'the', 'best', 'stabilitylike', 'guarantee', 'as', 'a', 'function', 'of', 'both', 'the', 'number', 'of', 'observations', 'and', 'the', 'required', 'level', 'of', 'confidence', 'our', 'proof', 'techniques', 'rely', 'on', 'geometrical', 'analysis', 'chanceconstrained', 'optimization', 'and', 'stability', 'analysis', 'tools', 'for', 'switched', 'systems', 'including', 'the', 'joint', 'spectral', 'radius']]
|
[-0.16819596752893548, -0.0023601354235628, -0.11370815514578475, 0.06922978151333728, -0.07112541582502492, -0.10863042824276564, 0.12111105871814731, 0.3341825724587784, -0.2607109664628903, -0.3458006487370611, 0.1297311585557517, -0.21078477292699185, -0.13780905524696652, 0.21812705870986254, -0.0783774798299681, 0.13588574132672301, 0.06760199508301469, 0.028773502736438385, -0.08045995749768105, -0.23456397081981203, 0.30417607273688324, 0.040727920586931275, 0.2552627307606173, 0.043975467980327504, 0.12323383736919176, 0.0445903111048628, -0.01580567107544289, 0.02198446058271755, -0.12461549919634808, 0.1535917961590311, 0.23873799064339282, 0.23294808332564998, 0.31566181973562585, -0.4234590463944384, -0.1772914922771019, 0.10592020725042701, 0.13912606293960633, 0.10464621501395831, -0.04100949537566955, -0.265844613431139, 0.09769753866770246, -0.13945062229460156, -0.1253990638657129, -0.1018418945153957, -0.06038036484371971, 0.06124250271970087, -0.2990316177827415, 0.03093007482957464, 0.11004064839437126, 0.08025904003685962, -0.0864963121775135, -0.10313165916427802, -0.0037750777880753484, 0.16884440923243896, 0.00692984026642768, -0.04099101612401019, 0.09494297955864789, -0.10795765032001713, -0.14542186859290343, 0.3515519228101045, -0.04932523330963041, -0.2174475470385808, 0.19368292662935951, -0.08903481223125446, -0.1701958440936397, 0.11742759276147899, 0.21072751483334615, 0.11329666583438043, -0.13279123085777503, 0.093575448008057, -0.03418991894582874, 0.23455330105246724, 0.016660153832253034, 0.072811177961092, 0.19783290892814262, 0.18218239255014573, 0.1403574959190378, 0.13026953906005434, -0.04289102356100606, -0.06030314711136492, -0.30936272576585544, -0.12476425664918916, -0.17321772788240164, 0.026356324584953284, -0.14989778135972923, -0.17516636473403588, 0.4041057680439842, 0.16836981202668702, 0.2112979022114798, 0.13788865370726264, 0.30678333128961893, 0.1484859269312929, -0.04752363810559047, 0.07917020453123359, 0.23744075339463716, 0.10453863035434403, 0.03511685973268237, -0.20023532478277245, 0.09280747522574824, 0.05721917510166898]
|
1,803.03688
|
Bit-Tactical: Exploiting Ineffectual Computations in Convolutional
Neural Networks: Which, Why, and How
|
We show that, during inference with Convolutional Neural Networks (CNNs),
more than 2x to $8x ineffectual work can be exposed if instead of targeting
those weights and activations that are zero, we target different combinations
of value stream properties. We demonstrate a practical application with
Bit-Tactical (TCL), a hardware accelerator which exploits weight sparsity, per
layer precision variability and dynamic fine-grain precision reduction for
activations, and optionally the naturally occurring sparse effectual bit
content of activations to improve performance and energy efficiency. TCL
benefits both sparse and dense CNNs, natively supports both convolutional and
fully-connected layers, and exploits properties of all activations to reduce
storage, communication, and computation demands. While TCL does not require
changes to the CNN to deliver benefits, it does reward any technique that would
amplify any of the aforementioned weight and activation value properties.
Compared to an equivalent data-parallel accelerator for dense CNNs, TCLp, a
variant of TCL improves performance by 5.05x and is 2.98x more energy efficient
while requiring 22% more area.
|
cs.NE
|
we show that during inference with convolutional neural networks cnns more than 2x to 8x ineffectual work can be exposed if instead of targeting those weights and activations that are zero we target different combinations of value stream properties we demonstrate a practical application with bittactical tcl a hardware accelerator which exploits weight sparsity per layer precision variability and dynamic finegrain precision reduction for activations and optionally the naturally occurring sparse effectual bit content of activations to improve performance and energy efficiency tcl benefits both sparse and dense cnns natively supports both convolutional and fullyconnected layers and exploits properties of all activations to reduce storage communication and computation demands while tcl does not require changes to the cnn to deliver benefits it does reward any technique that would amplify any of the aforementioned weight and activation value properties compared to an equivalent dataparallel accelerator for dense cnns tclp a variant of tcl improves performance by 505x and is 298x more energy efficient while requiring 22 more area
|
[['we', 'show', 'that', 'during', 'inference', 'with', 'convolutional', 'neural', 'networks', 'cnns', 'more', 'than', '2x', 'to', '8x', 'ineffectual', 'work', 'can', 'be', 'exposed', 'if', 'instead', 'of', 'targeting', 'those', 'weights', 'and', 'activations', 'that', 'are', 'zero', 'we', 'target', 'different', 'combinations', 'of', 'value', 'stream', 'properties', 'we', 'demonstrate', 'a', 'practical', 'application', 'with', 'bittactical', 'tcl', 'a', 'hardware', 'accelerator', 'which', 'exploits', 'weight', 'sparsity', 'per', 'layer', 'precision', 'variability', 'and', 'dynamic', 'finegrain', 'precision', 'reduction', 'for', 'activations', 'and', 'optionally', 'the', 'naturally', 'occurring', 'sparse', 'effectual', 'bit', 'content', 'of', 'activations', 'to', 'improve', 'performance', 'and', 'energy', 'efficiency', 'tcl', 'benefits', 'both', 'sparse', 'and', 'dense', 'cnns', 'natively', 'supports', 'both', 'convolutional', 'and', 'fullyconnected', 'layers', 'and', 'exploits', 'properties', 'of', 'all', 'activations', 'to', 'reduce', 'storage', 'communication', 'and', 'computation', 'demands', 'while', 'tcl', 'does', 'not', 'require', 'changes', 'to', 'the', 'cnn', 'to', 'deliver', 'benefits', 'it', 'does', 'reward', 'any', 'technique', 'that', 'would', 'amplify', 'any', 'of', 'the', 'aforementioned', 'weight', 'and', 'activation', 'value', 'properties', 'compared', 'to', 'an', 'equivalent', 'dataparallel', 'accelerator', 'for', 'dense', 'cnns', 'tclp', 'a', 'variant', 'of', 'tcl', 'improves', 'performance', 'by', '505x', 'and', 'is', '298x', 'more', 'energy', 'efficient', 'while', 'requiring', '22', 'more', 'area']]
|
[-0.07951038718677805, 0.05330247570058128, -0.0035785166732395534, 0.007924496738291546, -0.12536041004057585, -0.20688505174500718, 0.0759714790177103, 0.4641646320540229, -0.30734025604417264, -0.3318228597147105, 0.06790908388907742, -0.2551737160656167, -0.16626303183683336, 0.18807835621327915, -0.11763353722917767, 0.11141457517797047, 0.14350214132473468, 0.026512488417121713, -0.12242143465551703, -0.30844740842131935, 0.23118039558533054, 0.130240959920949, 0.3352101111150364, 0.013212843389576016, 0.11541486389494353, -0.016335105646310227, 0.027975605106541165, -0.04328474084749544, 0.0019389791421730077, 0.16701407021485973, 0.28590114668377337, 0.17554571805807528, 0.3114044419232687, -0.4799193283600127, -0.24249718370961676, 0.10662425803077732, 0.1420488847459615, 0.06028046282122563, 0.001013070217885814, -0.21694855913919814, 0.15610502610565877, -0.1744152765529676, 0.002367579969548923, -0.16372628368585845, -0.05498371263851692, 0.03649859330074096, -0.33023166886467964, 0.027665659471020742, 0.08107307310497526, 0.003667172188784904, -0.012371357883172441, -0.1449132104664241, -0.012955748648925519, 0.1319199596314571, -0.038238386407871645, 0.046588121430571276, 0.18229351760648146, -0.21016901700637458, -0.0900942621998306, 0.31024707445840527, -0.02850443596547781, -0.2022913452980617, 0.17896668131154694, -0.043025193550264, -0.13918406441893452, 0.1528106885447961, 0.2202634757978876, 0.0469939099921862, -0.1272776595201126, 0.01527003019382503, 0.05207568767589111, 0.2462029457692217, 0.10235276695717972, 0.0819576633437051, 0.13073390650140132, 0.21436206391366897, 0.0911844893090107, 0.13163688268006832, -0.12822520716881458, -0.08045339452365607, -0.18422102573916224, -0.11106111959445696, -0.18101145818820966, -0.0010424678718658348, -0.12430064988581813, -0.1053686732500563, 0.40370282646057204, 0.18643571992056227, 0.21603556810106878, 0.16974345202189214, 0.35121284090439603, 0.060985583094937124, 0.19837917190365081, 0.18130018797194575, 0.15646323934197426, 0.058866360557602686, 0.1307188401468658, -0.17578045235078302, 0.08847085189287111, 0.024460266384244696]
|
1,803.03689
|
Three colour bipartite Ramsey number of cycles and paths
|
The $k$-colour bipartite Ramsey number of a bipartite graph $H$ is the least
integer $n$ for which every $k$-edge-coloured complete bipartite graph
$K_{n,n}$ contains a monochromatic copy of $H$. The study of bipartite Ramsey
numbers was initiated, over 40 years ago, by Faudree and Schelp and,
independently, by Gy\'arf\'as and Lehel, who determined the $2$-colour Ramsey
number of paths. In this paper we determine asymptotically the $3$-colour
bipartite Ramsey number of paths and (even) cycles.
|
math.CO
|
the kcolour bipartite ramsey number of a bipartite graph h is the least integer n for which every kedgecoloured complete bipartite graph k_nn contains a monochromatic copy of h the study of bipartite ramsey numbers was initiated over 40 years ago by faudree and schelp and independently by gyarfas and lehel who determined the 2colour ramsey number of paths in this paper we determine asymptotically the 3colour bipartite ramsey number of paths and even cycles
|
[['the', 'kcolour', 'bipartite', 'ramsey', 'number', 'of', 'a', 'bipartite', 'graph', 'h', 'is', 'the', 'least', 'integer', 'n', 'for', 'which', 'every', 'kedgecoloured', 'complete', 'bipartite', 'graph', 'k_nn', 'contains', 'a', 'monochromatic', 'copy', 'of', 'h', 'the', 'study', 'of', 'bipartite', 'ramsey', 'numbers', 'was', 'initiated', 'over', '40', 'years', 'ago', 'by', 'faudree', 'and', 'schelp', 'and', 'independently', 'by', 'gyarfas', 'and', 'lehel', 'who', 'determined', 'the', '2colour', 'ramsey', 'number', 'of', 'paths', 'in', 'this', 'paper', 'we', 'determine', 'asymptotically', 'the', '3colour', 'bipartite', 'ramsey', 'number', 'of', 'paths', 'and', 'even', 'cycles']]
|
[-0.2158473181227843, 0.28211055013273534, -0.0337630956619978, 0.016046688097218674, -0.026807428107907375, -0.15026979765078674, 0.10600739852990955, 0.32427750224868457, -0.19794291086494922, -0.37984008848667145, 0.08074816858706375, -0.33942920962969464, -0.12086557906431457, 0.08512454474965732, -0.1269321729366978, 0.03510589301586151, 0.15750009271626672, 0.09524159934371709, 0.17012057931162416, -0.376700676571733, 0.25274216652246345, -0.06428752268354097, 0.14432450972497463, 0.05558496763308843, 0.03904962850734592, 0.16688752784083286, -0.024260094600419203, 0.12938399309913318, -0.25578365465005237, 0.05473021230349938, 0.2658969176188111, 0.21567105229943992, 0.2663361429423094, -0.34933372521578954, -0.1271374279105415, 0.26890440423041584, 0.08401266040901344, 0.08819966832641513, 0.06435604160030683, -0.22648586167410636, 0.0735864048699538, -0.10893489168646435, -0.06553187766422829, 0.046737046463725465, 0.17279998948176703, -0.025929454592987896, -0.24711761290828388, -0.04778003616879384, 0.10966885385413964, 0.09868479818105698, 0.16635958567261697, -0.14169127232084672, -0.044630343193809194, 0.0807189049385488, -0.1251264853682369, 0.08653264441682647, -0.06679740737580384, -0.09067379339869755, -0.2466211860254407, 0.3282876279950142, -0.044965355963455904, -0.004208756028286492, 0.07771361750705788, -0.15230095330625773, -0.18814418255041043, 0.12311522838970025, 0.0200464241951704, 0.1874212803132832, -0.09443602907781799, 0.13391215320987007, -0.2087062326570352, 0.12757085176805655, 0.2618157915895184, 0.041789247331519924, 0.07493906715341533, 0.07793598546336095, 0.16977920204401017, 0.2205846415553242, 0.04160335501035055, 0.03164564629395803, -0.1939489430313309, -0.12149099764724572, -0.2970430868119001, 0.15847576203756034, -0.14100420345164213, -0.1676535429308812, 0.435180392836531, 0.02161811776459217, 0.12220214835678538, 0.08895987088636806, 0.19532913792257509, 0.010674553339680036, -0.010094588870803516, 0.1786517322373887, 0.1207794006417195, 0.3006872873939574, -0.03742080172679076, -0.17787992951149742, 0.015629521366208793, 0.18209918284167845]
|
1,803.0369
|
Results from phase 1 of the HAYSTAC microwave cavity axion experiment
|
We report on the results from a search for dark matter axions with the
HAYSTAC experiment using a microwave cavity detector at frequencies between
5.6-5.8$\, \rm Ghz$. We exclude axion models with two photon coupling
$g_{a\gamma\gamma}\,\gtrsim\,2\times10^{-14}\,\rm GeV^{-1}$, a factor of 2.7
above the benchmark KSVZ model over the mass range 23.15$\,<\,$$m_a
\,$<$\,$24.0$\,\mu\rm eV$. This doubles the range reported in our previous
paper. We achieve a near-quantum-limited sensitivity by operating at a
temperature $T<h\nu/2k_B$ and incorporating a Josephson parametric amplifier
(JPA), with improvements in the cooling of the cavity further reducing the
experiment's system noise temperature to only twice the Standard Quantum Limit
at its operational frequency, an order of magnitude better than any other dark
matter microwave cavity experiment to date. This result concludes the first
phase of the HAYSTAC program utilizing a conventional copper cavity and a
single JPA.
|
hep-ex physics.ins-det
|
we report on the results from a search for dark matter axions with the haystac experiment using a microwave cavity detector at frequencies between 5658 rm ghz we exclude axion models with two photon coupling g_agammagammagtrsim2times1014rm gev1 a factor of 27 above the benchmark ksvz model over the mass range 2315m_a 240murm ev this doubles the range reported in our previous paper we achieve a nearquantumlimited sensitivity by operating at a temperature thnu2k_b and incorporating a josephson parametric amplifier jpa with improvements in the cooling of the cavity further reducing the experiments system noise temperature to only twice the standard quantum limit at its operational frequency an order of magnitude better than any other dark matter microwave cavity experiment to date this result concludes the first phase of the haystac program utilizing a conventional copper cavity and a single jpa
|
[['we', 'report', 'on', 'the', 'results', 'from', 'a', 'search', 'for', 'dark', 'matter', 'axions', 'with', 'the', 'haystac', 'experiment', 'using', 'a', 'microwave', 'cavity', 'detector', 'at', 'frequencies', 'between', '5658', 'rm', 'ghz', 'we', 'exclude', 'axion', 'models', 'with', 'two', 'photon', 'coupling', 'g_agammagammagtrsim2times1014rm', 'gev1', 'a', 'factor', 'of', '27', 'above', 'the', 'benchmark', 'ksvz', 'model', 'over', 'the', 'mass', 'range', '2315m_a', '240murm', 'ev', 'this', 'doubles', 'the', 'range', 'reported', 'in', 'our', 'previous', 'paper', 'we', 'achieve', 'a', 'nearquantumlimited', 'sensitivity', 'by', 'operating', 'at', 'a', 'temperature', 'thnu2k_b', 'and', 'incorporating', 'a', 'josephson', 'parametric', 'amplifier', 'jpa', 'with', 'improvements', 'in', 'the', 'cooling', 'of', 'the', 'cavity', 'further', 'reducing', 'the', 'experiments', 'system', 'noise', 'temperature', 'to', 'only', 'twice', 'the', 'standard', 'quantum', 'limit', 'at', 'its', 'operational', 'frequency', 'an', 'order', 'of', 'magnitude', 'better', 'than', 'any', 'other', 'dark', 'matter', 'microwave', 'cavity', 'experiment', 'to', 'date', 'this', 'result', 'concludes', 'the', 'first', 'phase', 'of', 'the', 'haystac', 'program', 'utilizing', 'a', 'conventional', 'copper', 'cavity', 'and', 'a', 'single', 'jpa']]
|
[-0.1312838959455904, 0.14550862979516818, -0.026565560888223073, -0.013435748690325353, -0.04158088305482158, -0.118032735210188, 0.11071811920221619, 0.356470788118464, -0.16562823380033176, -0.3871630717224131, 0.05308667954091949, -0.2913028778025398, -0.004774061283441606, 0.27869071786084937, 0.03081726497039199, 0.057180736927505305, 0.026345400886472175, 0.011783860274590552, -0.06913833832023321, -0.20574912773445247, 0.2377727598986692, 0.10869314509737132, 0.27665283389010087, 0.03928343993094233, 0.1213417301627083, -0.08302806252441197, 0.03586629623443716, -0.06466221331998154, -0.13515674583312054, 0.05039197724243557, 0.22562226264651852, 0.03279179824792124, 0.22625800721968214, -0.3757662389151476, -0.21072750613093377, 0.14440994496215825, 0.09145969880779309, 0.11956036851085998, -0.04176310955943471, -0.3057221305642829, 0.025683035967112692, -0.2108366054379278, -0.08332176539977944, 0.008482902924771663, -0.0763964820722187, -0.04576306291166003, -0.27595571923173134, 0.06321523114176536, 0.030277154398047262, 0.0329572897542406, -0.012809932263809498, -0.11782219987276389, 0.05648239933264752, -0.00952107815278901, -0.024266735066366556, 0.05251049760522114, 0.1863785477803537, -0.1419017170176462, -0.13004205620295747, 0.3492997131513052, -0.16137599842763006, -0.08476562631419964, 0.16800725831201782, -0.1598579734598321, -0.06546764986727524, 0.14658841354841434, 0.1317942435266795, 0.06357614250025816, -0.13152054269470412, 0.06981316271531224, -0.006928710515300433, 0.2846836469584593, 0.11164613014811443, 0.06816629977310422, 0.2563648007672142, 0.26118943198342565, 0.04902771554059453, 0.13371683173097187, -0.12084647359291989, -0.02014743534296199, -0.32298702334433244, -0.09199794987044124, -0.12470310351086987, 0.03328562587223671, -0.08350907269395301, -0.08024417874575765, 0.3994708231477826, 0.18594031951700649, 0.16496913415138367, 0.031542762499992494, 0.3573993112477991, 0.11514758604009533, 0.07502097155967796, 0.0226391620727049, 0.348274177333547, 0.12474267808548002, 0.11832453599458354, -0.2523148731518261, -0.08285999827224899, -0.041555517470395126]
|
1,803.03691
|
Cascades and Dissipative Anomalies in Nearly Collisionless Plasma
Turbulence
|
We develop first-principles theory of kinetic plasma turbulence governed by
the Vlasov-Maxwell-Landau equations in the limit of vanishing collision rates.
Following an exact renormalization-group approach pioneered by Onsager, we
demonstrate the existence of a "collisionless range" of scales (lengths and
velocities) in 1-particle phase space where the ideal Vlasov-Maxwell equations
are satisfied in a "coarse-grained sense". Entropy conservation may
nevertheless be violated in that range by a "dissipative anomaly" due to
nonlinear entropy cascade. We derive "4/5th-law" type expressions for the
entropy flux, which allow us to characterize the singularities
(structure-function scaling exponents) required for its non-vanishing.
Conservation laws of mass, momentum and energy are not afflicted with anomalous
transfers in the collisionless limit. In a subsequent limit of small gyroradii,
however, anomalous contributions to inertial-range energy balance may appear
due both to cascade of bulk energy and to turbulent redistribution of internal
energy in phase space. In that same limit the "generalized Ohm's law" derived
from the particle momentum balances reduces to an "ideal Ohm's law", but only
in a coarse-grained sense that does not imply magnetic flux-freezing and that
permits magnetic reconnection at all inertial-range scales. We compare our
results with prior theory based on the gyrokinetic (high gyro-frequency) limit,
with numerical simulations, and with spacecraft measurements of the solar wind
and terrestrial magnetosphere.
|
physics.plasm-ph astro-ph.GA astro-ph.SR
|
we develop firstprinciples theory of kinetic plasma turbulence governed by the vlasovmaxwelllandau equations in the limit of vanishing collision rates following an exact renormalizationgroup approach pioneered by onsager we demonstrate the existence of a collisionless range of scales lengths and velocities in 1particle phase space where the ideal vlasovmaxwell equations are satisfied in a coarsegrained sense entropy conservation may nevertheless be violated in that range by a dissipative anomaly due to nonlinear entropy cascade we derive 45thlaw type expressions for the entropy flux which allow us to characterize the singularities structurefunction scaling exponents required for its nonvanishing conservation laws of mass momentum and energy are not afflicted with anomalous transfers in the collisionless limit in a subsequent limit of small gyroradii however anomalous contributions to inertialrange energy balance may appear due both to cascade of bulk energy and to turbulent redistribution of internal energy in phase space in that same limit the generalized ohms law derived from the particle momentum balances reduces to an ideal ohms law but only in a coarsegrained sense that does not imply magnetic fluxfreezing and that permits magnetic reconnection at all inertialrange scales we compare our results with prior theory based on the gyrokinetic high gyrofrequency limit with numerical simulations and with spacecraft measurements of the solar wind and terrestrial magnetosphere
|
[['we', 'develop', 'firstprinciples', 'theory', 'of', 'kinetic', 'plasma', 'turbulence', 'governed', 'by', 'the', 'vlasovmaxwelllandau', 'equations', 'in', 'the', 'limit', 'of', 'vanishing', 'collision', 'rates', 'following', 'an', 'exact', 'renormalizationgroup', 'approach', 'pioneered', 'by', 'onsager', 'we', 'demonstrate', 'the', 'existence', 'of', 'a', 'collisionless', 'range', 'of', 'scales', 'lengths', 'and', 'velocities', 'in', '1particle', 'phase', 'space', 'where', 'the', 'ideal', 'vlasovmaxwell', 'equations', 'are', 'satisfied', 'in', 'a', 'coarsegrained', 'sense', 'entropy', 'conservation', 'may', 'nevertheless', 'be', 'violated', 'in', 'that', 'range', 'by', 'a', 'dissipative', 'anomaly', 'due', 'to', 'nonlinear', 'entropy', 'cascade', 'we', 'derive', '45thlaw', 'type', 'expressions', 'for', 'the', 'entropy', 'flux', 'which', 'allow', 'us', 'to', 'characterize', 'the', 'singularities', 'structurefunction', 'scaling', 'exponents', 'required', 'for', 'its', 'nonvanishing', 'conservation', 'laws', 'of', 'mass', 'momentum', 'and', 'energy', 'are', 'not', 'afflicted', 'with', 'anomalous', 'transfers', 'in', 'the', 'collisionless', 'limit', 'in', 'a', 'subsequent', 'limit', 'of', 'small', 'gyroradii', 'however', 'anomalous', 'contributions', 'to', 'inertialrange', 'energy', 'balance', 'may', 'appear', 'due', 'both', 'to', 'cascade', 'of', 'bulk', 'energy', 'and', 'to', 'turbulent', 'redistribution', 'of', 'internal', 'energy', 'in', 'phase', 'space', 'in', 'that', 'same', 'limit', 'the', 'generalized', 'ohms', 'law', 'derived', 'from', 'the', 'particle', 'momentum', 'balances', 'reduces', 'to', 'an', 'ideal', 'ohms', 'law', 'but', 'only', 'in', 'a', 'coarsegrained', 'sense', 'that', 'does', 'not', 'imply', 'magnetic', 'fluxfreezing', 'and', 'that', 'permits', 'magnetic', 'reconnection', 'at', 'all', 'inertialrange', 'scales', 'we', 'compare', 'our', 'results', 'with', 'prior', 'theory', 'based', 'on', 'the', 'gyrokinetic', 'high', 'gyrofrequency', 'limit', 'with', 'numerical', 'simulations', 'and', 'with', 'spacecraft', 'measurements', 'of', 'the', 'solar', 'wind', 'and', 'terrestrial', 'magnetosphere']]
|
[-0.1505993690926495, 0.2035184730777008, -0.08359732064932889, 0.08206114586940859, -0.058679508201258126, -0.08263040342541454, 0.01832453080366344, 0.2602238741145621, -0.25482031985315995, -0.31120613628435273, 0.011216614054256054, -0.2386636916656307, -0.06861348313842575, 0.20634555345736877, -0.013840492661002764, 0.06827541335762023, 0.03799275488939223, -0.027176319596595888, -0.052152480688325106, -0.13579193083569407, 0.309588651363413, 0.12085785586116185, 0.2814431785291797, 0.06583017058627204, 0.1342826406698847, -0.056996985824323845, -0.015804162519702385, 0.06971083755989364, -0.18480704046743868, 0.03992558784436348, 0.21497011425049412, 0.011825833386243429, 0.21241276254660862, -0.4833094437888195, -0.23773850734497226, 0.06444143678040005, 0.1716930107662974, 0.08482345782036264, -0.006100844581568137, -0.19936117912685974, 0.0603112606705318, -0.20345501840374497, -0.16241622818417328, -0.09858697135391277, 0.019238596577955368, 0.059332394826789064, -0.30150839291637505, 0.18006207104014277, 0.07364344799154719, 0.042601737505648024, -0.11928056196666995, -0.04072031900394968, -0.061256919263017386, 0.07021740809960161, 0.0965702902807226, -0.023707188673447385, 0.16024168148246962, -0.1504636145684175, -0.06538795236156994, 0.38749573338170384, -0.06187912713151512, -0.2027679703642376, 0.20331314941110132, -0.21697148485542384, -0.12006152717851448, 0.17615178306803628, 0.12481346983451742, 0.07942827674607628, -0.14999811369979885, 0.08911824077205342, -0.012836031603415735, 0.13145337268536866, 0.05787259578314978, 0.03371464966384824, 0.20495968595103817, 0.09304809217709442, 0.039998962632705304, 0.07563468691795458, -0.09330219069040965, -0.1450125283399207, -0.3368739063873194, -0.14054124303822688, -0.19112634486139773, 0.09808637425425289, -0.08980833722324501, -0.14582649969474173, 0.311740771151516, 0.1828130433909855, 0.16012794948074707, 0.06633756450529016, 0.27276379547926577, 0.18651714888184742, 0.04316364587392918, 0.14306502042251618, 0.28826927467422603, 0.17671182829085305, 0.1612568162706529, -0.2653354399761748, 0.01491110541094311, 0.12269520980500898]
|
1,803.03692
|
On the information in spike timing: neural codes derived from
polychronous groups
|
There is growing evidence regarding the importance of spike timing in neural
information processing, with even a small number of spikes carrying
information, but computational models lag significantly behind those for rate
coding. Experimental evidence on neuronal behavior is consistent with the
dynamical and state dependent behavior provided by recurrent connections. This
motivates the minimalistic abstraction investigated in this paper, aimed at
providing insight into information encoding in spike timing via recurrent
connections. We employ information-theoretic techniques for a simple reservoir
model which encodes input spatiotemporal patterns into a sparse neural code,
translating the polychronous groups introduced by Izhikevich into codewords on
which we can perform standard vector operations. We show that the distance
properties of the code are similar to those for (optimal) random codes. In
particular, the code meets benchmarks associated with both linear
classification and capacity, with the latter scaling exponentially with
reservoir size.
|
q-bio.NC cs.NE stat.ML
|
there is growing evidence regarding the importance of spike timing in neural information processing with even a small number of spikes carrying information but computational models lag significantly behind those for rate coding experimental evidence on neuronal behavior is consistent with the dynamical and state dependent behavior provided by recurrent connections this motivates the minimalistic abstraction investigated in this paper aimed at providing insight into information encoding in spike timing via recurrent connections we employ informationtheoretic techniques for a simple reservoir model which encodes input spatiotemporal patterns into a sparse neural code translating the polychronous groups introduced by izhikevich into codewords on which we can perform standard vector operations we show that the distance properties of the code are similar to those for optimal random codes in particular the code meets benchmarks associated with both linear classification and capacity with the latter scaling exponentially with reservoir size
|
[['there', 'is', 'growing', 'evidence', 'regarding', 'the', 'importance', 'of', 'spike', 'timing', 'in', 'neural', 'information', 'processing', 'with', 'even', 'a', 'small', 'number', 'of', 'spikes', 'carrying', 'information', 'but', 'computational', 'models', 'lag', 'significantly', 'behind', 'those', 'for', 'rate', 'coding', 'experimental', 'evidence', 'on', 'neuronal', 'behavior', 'is', 'consistent', 'with', 'the', 'dynamical', 'and', 'state', 'dependent', 'behavior', 'provided', 'by', 'recurrent', 'connections', 'this', 'motivates', 'the', 'minimalistic', 'abstraction', 'investigated', 'in', 'this', 'paper', 'aimed', 'at', 'providing', 'insight', 'into', 'information', 'encoding', 'in', 'spike', 'timing', 'via', 'recurrent', 'connections', 'we', 'employ', 'informationtheoretic', 'techniques', 'for', 'a', 'simple', 'reservoir', 'model', 'which', 'encodes', 'input', 'spatiotemporal', 'patterns', 'into', 'a', 'sparse', 'neural', 'code', 'translating', 'the', 'polychronous', 'groups', 'introduced', 'by', 'izhikevich', 'into', 'codewords', 'on', 'which', 'we', 'can', 'perform', 'standard', 'vector', 'operations', 'we', 'show', 'that', 'the', 'distance', 'properties', 'of', 'the', 'code', 'are', 'similar', 'to', 'those', 'for', 'optimal', 'random', 'codes', 'in', 'particular', 'the', 'code', 'meets', 'benchmarks', 'associated', 'with', 'both', 'linear', 'classification', 'and', 'capacity', 'with', 'the', 'latter', 'scaling', 'exponentially', 'with', 'reservoir', 'size']]
|
[-0.12763543105937641, 0.10570268857539916, -0.06846159682324042, 0.08579252342864567, -0.06312120140713899, -0.21599648640804678, 0.07769491963269075, 0.39691425905048966, -0.2899116853720882, -0.2742866649336758, 0.11329203501001608, -0.27525775092432186, -0.20287609421711442, 0.20109003274004628, -0.0772678187927928, 0.08372026762202839, 0.08948473866967972, 0.06316689381591317, -0.04533673188059914, -0.22717189034890561, 0.2802685042320542, 0.10651643538442092, 0.30364135015426447, -0.015153545740660008, 0.10776572674196087, 0.00019304549993098187, -0.07073653937273082, 0.003052716998725521, -0.0968664666104901, 0.14768344863020136, 0.26328563254966963, 0.1928604543272431, 0.26422591711438836, -0.47319134202513363, -0.27291812759120854, 0.0688084266987965, 0.14707540381592096, 0.12412330908162304, -0.0681492704038863, -0.2550172349200489, 0.09331730858036348, -0.1489907137251326, -0.020464354241425235, -0.08183814348656127, 0.004070213089893465, 0.03456392098015466, -0.2592924276404843, 0.04137670782198306, 0.09150741872481438, 0.07176601990018369, -0.04274785350279591, -0.07687985140285424, 0.009712105100581637, 0.14805449187069764, 0.0176285554846546, 0.028368566929264514, 0.0965375962736858, -0.12819827440254974, -0.11643093827871137, 0.30166026906325755, -0.046017151513631095, -0.21095571961360002, 0.19597922180633562, -0.07428214018752634, -0.1553388153629292, 0.12125967944446368, 0.20264006565486517, 0.020448335010849802, -0.14006800649903056, 0.03192960317040711, -0.026669538304285735, 0.2464186168484846, 0.046362570366587766, 0.08717144396929007, 0.22060825801802939, 0.22873297652236002, -0.00016846609789700735, 0.18234637857978644, -0.069531673417018, -0.14056900909588654, -0.2468845945067045, -0.06465949444100261, -0.14728160924753364, 0.028035734380994524, -0.1312923211171561, -0.1326745995652995, 0.424203982158583, 0.15162650272281852, 0.21150529018419534, 0.14626820884062117, 0.3036230721805549, 0.048999748791434934, 0.09629145328693574, 0.1425585446255218, 0.14864392659775785, 0.12079199891360033, 0.07163547339918865, -0.20289435841501088, 0.11301981340333515, 0.07072895240564482]
|
1,803.03693
|
Laboratory Measurements of X-Ray Emission from Highly Charged Argon Ions
|
Uncertainties in atomic models will introduce noticeable additional
systematics in calculating the flux of weak dielectronic recombination (DR)
satellite lines, affecting the detection and flux measurements of other weak
spectral lines. One important example is the Ar XVII He-beta DR, which is
expected to be present in emission from the hot intracluster medium (ICM) of
galaxy clusters and could impact measurements of the flux of the 3.5 keV line
that has been suggested as a secondary emission from a dark matter interaction.
We perform a set of experiments using the Lawrence Livermore National
Laboratory's electron beam ion trap (EBIT-I) and the X-Ray Spectrometer quantum
calorimeter (XRS/EBIT), to test the Ar XVII He-beta DR origin of the 3.5 keV
line. We measured the X-ray emission following resonant DR onto helium-like and
lithium-like Argon using EBIT-I's Maxwellian simulator mode at a simulated
electron temperature of Te=1.74 keV. The measured flux of the Ar XVII He-beta
DR lined is too weak to account for the flux in the 3.5 keV line assuming
reasonable plasma parameters. We, therefore, rule out Ar XVII He-beta DR as a
significant contributor to the 3.5 keV line. A comprehensive comparison between
the atomic theory and the EBIT experiment results is also provided.
|
astro-ph.HE
|
uncertainties in atomic models will introduce noticeable additional systematics in calculating the flux of weak dielectronic recombination dr satellite lines affecting the detection and flux measurements of other weak spectral lines one important example is the ar xvii hebeta dr which is expected to be present in emission from the hot intracluster medium icm of galaxy clusters and could impact measurements of the flux of the 35 kev line that has been suggested as a secondary emission from a dark matter interaction we perform a set of experiments using the lawrence livermore national laboratorys electron beam ion trap ebiti and the xray spectrometer quantum calorimeter xrsebit to test the ar xvii hebeta dr origin of the 35 kev line we measured the xray emission following resonant dr onto heliumlike and lithiumlike argon using ebitis maxwellian simulator mode at a simulated electron temperature of te174 kev the measured flux of the ar xvii hebeta dr lined is too weak to account for the flux in the 35 kev line assuming reasonable plasma parameters we therefore rule out ar xvii hebeta dr as a significant contributor to the 35 kev line a comprehensive comparison between the atomic theory and the ebit experiment results is also provided
|
[['uncertainties', 'in', 'atomic', 'models', 'will', 'introduce', 'noticeable', 'additional', 'systematics', 'in', 'calculating', 'the', 'flux', 'of', 'weak', 'dielectronic', 'recombination', 'dr', 'satellite', 'lines', 'affecting', 'the', 'detection', 'and', 'flux', 'measurements', 'of', 'other', 'weak', 'spectral', 'lines', 'one', 'important', 'example', 'is', 'the', 'ar', 'xvii', 'hebeta', 'dr', 'which', 'is', 'expected', 'to', 'be', 'present', 'in', 'emission', 'from', 'the', 'hot', 'intracluster', 'medium', 'icm', 'of', 'galaxy', 'clusters', 'and', 'could', 'impact', 'measurements', 'of', 'the', 'flux', 'of', 'the', '35', 'kev', 'line', 'that', 'has', 'been', 'suggested', 'as', 'a', 'secondary', 'emission', 'from', 'a', 'dark', 'matter', 'interaction', 'we', 'perform', 'a', 'set', 'of', 'experiments', 'using', 'the', 'lawrence', 'livermore', 'national', 'laboratorys', 'electron', 'beam', 'ion', 'trap', 'ebiti', 'and', 'the', 'xray', 'spectrometer', 'quantum', 'calorimeter', 'xrsebit', 'to', 'test', 'the', 'ar', 'xvii', 'hebeta', 'dr', 'origin', 'of', 'the', '35', 'kev', 'line', 'we', 'measured', 'the', 'xray', 'emission', 'following', 'resonant', 'dr', 'onto', 'heliumlike', 'and', 'lithiumlike', 'argon', 'using', 'ebitis', 'maxwellian', 'simulator', 'mode', 'at', 'a', 'simulated', 'electron', 'temperature', 'of', 'te174', 'kev', 'the', 'measured', 'flux', 'of', 'the', 'ar', 'xvii', 'hebeta', 'dr', 'lined', 'is', 'too', 'weak', 'to', 'account', 'for', 'the', 'flux', 'in', 'the', '35', 'kev', 'line', 'assuming', 'reasonable', 'plasma', 'parameters', 'we', 'therefore', 'rule', 'out', 'ar', 'xvii', 'hebeta', 'dr', 'as', 'a', 'significant', 'contributor', 'to', 'the', '35', 'kev', 'line', 'a', 'comprehensive', 'comparison', 'between', 'the', 'atomic', 'theory', 'and', 'the', 'ebit', 'experiment', 'results', 'is', 'also', 'provided']]
|
[-0.023763356305425986, 0.11660156110534445, -0.02997843918390572, 0.10589010923460591, -0.0019775576365645975, -0.14728496253956108, 0.055361839043034704, 0.4140700013656169, -0.1526815044612158, -0.34321842503268274, 0.01066936956718564, -0.35229730579070745, 0.058675148701295254, 0.20314563218038528, 0.03368043770315125, 0.014462948569562286, 0.04872705803893041, -0.07293272522045299, -0.01248898490681313, -0.1858555856172461, 0.2382208486413583, 0.1925253510818584, 0.24104252382181585, 0.11937928105471655, 0.07794086227891966, -0.0640894721224322, -0.07613038069335744, 0.005369874201714992, -0.07191045303869031, 0.06409298837796086, 0.24076985512272586, 0.11216587159753544, 0.1938946215074975, -0.4069554581958801, -0.19517725767567753, 0.04064597173361108, 0.14178180215414612, 0.01945427121419925, -0.0527836242178455, -0.26944159818813207, 0.0007118975423509255, -0.18487744321115315, -0.13951692654169165, 0.054845146636944266, 0.032528984198579566, 0.027417807640740647, -0.25204422291833906, 0.06377898839200498, 0.002334302925155498, 0.10704623840283603, -0.10666011398774572, -0.12476307886652649, -0.018427020717645064, 0.017429511172231286, 0.02282331035938114, 0.03166478203202132, 0.2436255328601692, -0.06679901640163735, -0.056228673229925336, 0.4010175036947476, -0.11914601256139576, 0.014235184397548437, 0.15683457053382882, -0.1917988812411204, -0.142902594585903, 0.25057174485875294, 0.11750989189255051, 0.0787528077699244, -0.13771536226151512, 0.03166277270851424, -0.05848157953587361, 0.2127496779195826, 0.05818385990802199, -0.011838118511877837, 0.23555635759374127, 0.09886944113881327, 0.00012674345634877682, 0.07667007874384581, -0.28144296730402857, -0.003415084159350954, -0.28791209468152373, -0.14484264108294156, -0.072168523157452, 0.06991331464261748, 0.0008384551891504089, -0.12004440125296241, 0.35190584126859903, 0.0921167028695345, 0.18264352720987517, -0.10852589493442792, 0.3381070484779775, 0.13037726919581474, 0.03051922606304288, 0.041343234577216205, 0.3095239836256951, 0.18420939024072142, 0.14564491357654333, -0.28417313950369133, 0.03737658589845523, 0.03147041377145797]
|
1,803.03694
|
Set Theory-Based Safety Supervisory Control for Wind Turbines to Ensure
Adequate Frequency Response
|
Inadequate frequency response can arise due to a high penetration of wind
turbine generators (WTGs) and requires a frequency support function to be
integrated in the WTG. The appropriate design for these controllers to ensure
adequate response has not been investigated thoroughly. In this paper, a safety
supervisory control (SSC) is proposed to synthesize the supportive modes in
WTGs to guarantee performance. The concept, region of safety (ROS), is stated
for safe switching synthesis. An optimization formula is proposed to calculate
the largest ROS. By assuming a polynomial structure, the problem can be solved
by a sum of squares program. A feasible result will generate a polynomial, the
zero sublevel set of which represents the ROS and is employed as the safety
supervisor. A decentralized communication architecture is proposed for
small-scale systems. Moreover, a scheduling loop is suggested so that the
supervisor updates its boundary with respect to the renewable penetration level
to be robust with respect to variations in system inertia. The proposed
controller is first verified on a single-machine three-phase nonlinear
microgrid, and then implemented on the IEEE 39-bus system. Both results
indicate that the proposed framework and control configuration can guarantee
adequate response without excessive conservativeness.
|
cs.SY
|
inadequate frequency response can arise due to a high penetration of wind turbine generators wtgs and requires a frequency support function to be integrated in the wtg the appropriate design for these controllers to ensure adequate response has not been investigated thoroughly in this paper a safety supervisory control ssc is proposed to synthesize the supportive modes in wtgs to guarantee performance the concept region of safety ros is stated for safe switching synthesis an optimization formula is proposed to calculate the largest ros by assuming a polynomial structure the problem can be solved by a sum of squares program a feasible result will generate a polynomial the zero sublevel set of which represents the ros and is employed as the safety supervisor a decentralized communication architecture is proposed for smallscale systems moreover a scheduling loop is suggested so that the supervisor updates its boundary with respect to the renewable penetration level to be robust with respect to variations in system inertia the proposed controller is first verified on a singlemachine threephase nonlinear microgrid and then implemented on the ieee 39bus system both results indicate that the proposed framework and control configuration can guarantee adequate response without excessive conservativeness
|
[['inadequate', 'frequency', 'response', 'can', 'arise', 'due', 'to', 'a', 'high', 'penetration', 'of', 'wind', 'turbine', 'generators', 'wtgs', 'and', 'requires', 'a', 'frequency', 'support', 'function', 'to', 'be', 'integrated', 'in', 'the', 'wtg', 'the', 'appropriate', 'design', 'for', 'these', 'controllers', 'to', 'ensure', 'adequate', 'response', 'has', 'not', 'been', 'investigated', 'thoroughly', 'in', 'this', 'paper', 'a', 'safety', 'supervisory', 'control', 'ssc', 'is', 'proposed', 'to', 'synthesize', 'the', 'supportive', 'modes', 'in', 'wtgs', 'to', 'guarantee', 'performance', 'the', 'concept', 'region', 'of', 'safety', 'ros', 'is', 'stated', 'for', 'safe', 'switching', 'synthesis', 'an', 'optimization', 'formula', 'is', 'proposed', 'to', 'calculate', 'the', 'largest', 'ros', 'by', 'assuming', 'a', 'polynomial', 'structure', 'the', 'problem', 'can', 'be', 'solved', 'by', 'a', 'sum', 'of', 'squares', 'program', 'a', 'feasible', 'result', 'will', 'generate', 'a', 'polynomial', 'the', 'zero', 'sublevel', 'set', 'of', 'which', 'represents', 'the', 'ros', 'and', 'is', 'employed', 'as', 'the', 'safety', 'supervisor', 'a', 'decentralized', 'communication', 'architecture', 'is', 'proposed', 'for', 'smallscale', 'systems', 'moreover', 'a', 'scheduling', 'loop', 'is', 'suggested', 'so', 'that', 'the', 'supervisor', 'updates', 'its', 'boundary', 'with', 'respect', 'to', 'the', 'renewable', 'penetration', 'level', 'to', 'be', 'robust', 'with', 'respect', 'to', 'variations', 'in', 'system', 'inertia', 'the', 'proposed', 'controller', 'is', 'first', 'verified', 'on', 'a', 'singlemachine', 'threephase', 'nonlinear', 'microgrid', 'and', 'then', 'implemented', 'on', 'the', 'ieee', '39bus', 'system', 'both', 'results', 'indicate', 'that', 'the', 'proposed', 'framework', 'and', 'control', 'configuration', 'can', 'guarantee', 'adequate', 'response', 'without', 'excessive', 'conservativeness']]
|
[-0.15812404961490692, 0.03176102940730933, -0.0730768515052378, 0.028978453873453408, -0.09392161050759407, -0.15255730374843865, 0.03120948769197076, 0.3557654008089664, -0.25737657225667143, -0.3033766513601711, 0.1419494055651204, -0.19539139911929515, -0.13189876664590638, 0.2034581496006795, -0.1562104450547914, 0.1330196836421551, 0.05299244393939673, 0.008278666838275524, 0.020646774810874777, -0.21286126220572815, 0.24010535932650084, 0.0932231640471571, 0.32017001775707954, 0.046953884029032916, 0.12004250107181784, -0.03390296975382353, 0.04496421031701156, 0.05427206112875551, -0.04022347049938035, 0.10685602820071813, 0.29900161668109865, 0.16497973681588274, 0.31185596104744384, -0.42979034313903697, -0.19457854394715865, 0.07923092562374352, 0.11633476852510256, 0.04669232614194208, -0.015096764394606884, -0.2657107480276887, 0.14728668060030808, -0.22812538655465328, -0.12403888600703498, -0.07641492852631503, -0.026178563368237262, 0.024366677257404924, -0.3632606206320552, -0.03831341400681073, 0.037916377397150106, 0.051483607198570286, -0.08794169950707896, -0.0587157789915611, -0.036255895678393615, 0.1064792753015243, -0.0014529231886100497, 0.02137032408414404, 0.15619795414888618, -0.07444633293168874, -0.13341814202970356, 0.3833228824471081, -0.016217289572855845, -0.23197005203627238, 0.15625754829855437, -0.05576253511002145, -0.10241306277918559, 0.1364606095733225, 0.20094896989122865, 0.07202925058294485, -0.20208128574239279, 0.06516767017600046, -0.006516585660138673, 0.20442718101977395, 0.02591838214314793, -0.008789476678531787, 0.16886324792637059, 0.21671241811041717, 0.13722416131194623, 0.1556023966898045, -0.030573135293868896, -0.08947941067576559, -0.28133840859763626, -0.12018731391993422, -0.1630883623968791, -0.01579040988827973, -0.03508532776403936, -0.13199438326306603, 0.40322723366830704, 0.18133614899184045, 0.11280275023480887, 0.07848208973734985, 0.3593790571720618, 0.17899618309996088, 0.09291329082848533, 0.10165286858963217, 0.24567322473060624, 0.08800950902041407, 0.12212565692193655, -0.2797288490237129, 0.13619534481023698, 0.046954377119424684]
|
1,803.03695
|
Markov chains under nonlinear expectation
|
In this paper, we consider continuous-time Markov chains with a finite state
space under nonlinear expectations. We define so-called Q-operators as an
extension of Q-matrices or rate matrices to a nonlinear setup, where the
nonlinearity is due to model uncertainty. The main result gives a full
characterization of convex Q-operators in terms of a positive maximum
principle, a dual representation by means of Q-matrices, continuous-time Markov
chains under convex expectations and nonlinear ordinary differential equations.
This extends a classical characterization of generators of Markov chains to the
case of model uncertainty in the generator. We further derive a primal and dual
representation of the convex semigroup arising from a Markov chain under a
convex expectation via the Fenchel-Legendre transformation of its generator. We
illustrate the results with several numerical examples, where we compute price
bounds for European contingent claims under model uncertainty in terms of the
rate matrix.
|
math.PR
|
in this paper we consider continuoustime markov chains with a finite state space under nonlinear expectations we define socalled qoperators as an extension of qmatrices or rate matrices to a nonlinear setup where the nonlinearity is due to model uncertainty the main result gives a full characterization of convex qoperators in terms of a positive maximum principle a dual representation by means of qmatrices continuoustime markov chains under convex expectations and nonlinear ordinary differential equations this extends a classical characterization of generators of markov chains to the case of model uncertainty in the generator we further derive a primal and dual representation of the convex semigroup arising from a markov chain under a convex expectation via the fenchellegendre transformation of its generator we illustrate the results with several numerical examples where we compute price bounds for european contingent claims under model uncertainty in terms of the rate matrix
|
[['in', 'this', 'paper', 'we', 'consider', 'continuoustime', 'markov', 'chains', 'with', 'a', 'finite', 'state', 'space', 'under', 'nonlinear', 'expectations', 'we', 'define', 'socalled', 'qoperators', 'as', 'an', 'extension', 'of', 'qmatrices', 'or', 'rate', 'matrices', 'to', 'a', 'nonlinear', 'setup', 'where', 'the', 'nonlinearity', 'is', 'due', 'to', 'model', 'uncertainty', 'the', 'main', 'result', 'gives', 'a', 'full', 'characterization', 'of', 'convex', 'qoperators', 'in', 'terms', 'of', 'a', 'positive', 'maximum', 'principle', 'a', 'dual', 'representation', 'by', 'means', 'of', 'qmatrices', 'continuoustime', 'markov', 'chains', 'under', 'convex', 'expectations', 'and', 'nonlinear', 'ordinary', 'differential', 'equations', 'this', 'extends', 'a', 'classical', 'characterization', 'of', 'generators', 'of', 'markov', 'chains', 'to', 'the', 'case', 'of', 'model', 'uncertainty', 'in', 'the', 'generator', 'we', 'further', 'derive', 'a', 'primal', 'and', 'dual', 'representation', 'of', 'the', 'convex', 'semigroup', 'arising', 'from', 'a', 'markov', 'chain', 'under', 'a', 'convex', 'expectation', 'via', 'the', 'fenchellegendre', 'transformation', 'of', 'its', 'generator', 'we', 'illustrate', 'the', 'results', 'with', 'several', 'numerical', 'examples', 'where', 'we', 'compute', 'price', 'bounds', 'for', 'european', 'contingent', 'claims', 'under', 'model', 'uncertainty', 'in', 'terms', 'of', 'the', 'rate', 'matrix']]
|
[-0.0996642518732335, 0.078822143241465, -0.048742148065561985, 0.06873828437371254, -0.08381763282483695, -0.10146879628804084, 0.06218939269593967, 0.34084072656224706, -0.3269503006099635, -0.19563428574002575, 0.16617820778235518, -0.25230726313374535, -0.15112133097136393, 0.1917584595865117, -0.10531034825111714, 0.07956931356779565, 0.0613122802083003, 0.04460874886717647, -0.1147551557483353, -0.19746798520901468, 0.30252406947673427, 0.03671816362672158, 0.25262825714732595, -0.006393410663460256, 0.19022532511578016, 0.05294274486211204, -0.0020056418835412006, 0.004232541604299488, -0.1529408284066547, 0.15270581674239775, 0.2589994185333568, 0.12058789460806528, 0.27853856830271884, -0.41617853288236706, -0.1705223786160098, 0.16377114230213133, 0.051995441565334144, 0.1036110572026086, -0.012868189020082355, -0.2839281994053414, 0.04651502343807118, -0.21246670176136634, -0.12491360064155448, -0.04015829649948943, -0.053365815072194546, 0.03721717671598182, -0.3630791295042916, 0.04740445563621088, 0.11611556346257645, 0.04547487199306488, -0.048118244291037775, -0.08982731149267606, -0.0015354391747481517, 0.015239227548984156, 0.05585997864113164, -0.03301663704749788, 0.07536696899694868, -0.08041505005550445, -0.1858575891945637, 0.3334336019045598, -0.1052159016023349, -0.2660387718005458, 0.13729656936531584, -0.13505514639719213, -0.14807321193527329, 0.11031832977204357, 0.18718533260068176, 0.1422331191983225, -0.1845999608772832, 0.1752418701000499, -0.0970881875585513, 0.1184513631081712, -0.005992923240252846, 0.019841272276362114, 0.12199527125277028, 0.14283181152879135, 0.11509984330513288, 0.23351705435040482, 0.024135944367436744, -0.18975662348817127, -0.3410932507516967, -0.16606699300904734, -0.15052571612083027, 0.08221779418228245, -0.12593822601794838, -0.1799898045570149, 0.36994167815931644, 0.12941905972725426, 0.17185380304786, 0.14921657700796384, 0.22634140388077326, 0.1943806709550208, -0.022732730665420357, 0.03803809719298639, 0.12626685982497685, 0.2127277881388452, 0.020940698777652672, -0.21054693483637418, 0.08115619510047238, 0.15364526179965232]
|
1,803.03696
|
Minimum $T$-Joins and Signed-Circuit Covering
|
Let $G$ be a graph and $T$ be a vertex subset of $G$ with even cardinality. A
$T$-join of $G$ is a subset $J$ of edges such that a vertex of $G$ is incident
with an odd number of edges in $J$ if and only if the vertex belongs to $T$.
Minimum $T$-joins have many applications in combinatorial optimizations. In
this paper, we show that a minimum $T$-join of a connected graph $G$ has at
most $|E(G)|-\frac 1 2 |E(\widehat{\, G\,})|$ edges where $\widehat{\,G\,}$ is
the maximum bidegeless subgraph of $G$. Further, we are able to use this result
to show that every flow-admissible signed graph $(G,\sigma)$ has a
signed-circuit cover with length at most $\frac{19} 6 |E(G)|$. Particularly, a
2-edge-connected signed graph $(G,\sigma)$ with even negativeness has a
signed-circuit cover with length at most $\frac 8 3 |E(G)|$.
|
math.CO cs.DM
|
let g be a graph and t be a vertex subset of g with even cardinality a tjoin of g is a subset j of edges such that a vertex of g is incident with an odd number of edges in j if and only if the vertex belongs to t minimum tjoins have many applications in combinatorial optimizations in this paper we show that a minimum tjoin of a connected graph g has at most egfrac 1 2 ewidehat g edges where widehatg is the maximum bidegeless subgraph of g further we are able to use this result to show that every flowadmissible signed graph gsigma has a signedcircuit cover with length at most frac19 6 eg particularly a 2edgeconnected signed graph gsigma with even negativeness has a signedcircuit cover with length at most frac 8 3 eg
|
[['let', 'g', 'be', 'a', 'graph', 'and', 't', 'be', 'a', 'vertex', 'subset', 'of', 'g', 'with', 'even', 'cardinality', 'a', 'tjoin', 'of', 'g', 'is', 'a', 'subset', 'j', 'of', 'edges', 'such', 'that', 'a', 'vertex', 'of', 'g', 'is', 'incident', 'with', 'an', 'odd', 'number', 'of', 'edges', 'in', 'j', 'if', 'and', 'only', 'if', 'the', 'vertex', 'belongs', 'to', 't', 'minimum', 'tjoins', 'have', 'many', 'applications', 'in', 'combinatorial', 'optimizations', 'in', 'this', 'paper', 'we', 'show', 'that', 'a', 'minimum', 'tjoin', 'of', 'a', 'connected', 'graph', 'g', 'has', 'at', 'most', 'egfrac', '1', '2', 'ewidehat', 'g', 'edges', 'where', 'widehatg', 'is', 'the', 'maximum', 'bidegeless', 'subgraph', 'of', 'g', 'further', 'we', 'are', 'able', 'to', 'use', 'this', 'result', 'to', 'show', 'that', 'every', 'flowadmissible', 'signed', 'graph', 'gsigma', 'has', 'a', 'signedcircuit', 'cover', 'with', 'length', 'at', 'most', 'frac19', '6', 'eg', 'particularly', 'a', '2edgeconnected', 'signed', 'graph', 'gsigma', 'with', 'even', 'negativeness', 'has', 'a', 'signedcircuit', 'cover', 'with', 'length', 'at', 'most', 'frac', '8', '3', 'eg']]
|
[-0.18392158603226696, 0.13774019071791338, -0.038652459649300135, -0.053640097835860046, -0.1378803890026002, -0.17353573593966387, 0.022417795113977734, 0.40012832428156225, -0.26668958865985687, -0.3369207408003233, 0.08064447941206809, -0.3613306621606979, -0.143758992312683, 0.10773481555559017, -0.09152580826991687, -0.058369929178755865, 0.12866840813981575, 0.17294311339932458, 0.039110076918182635, -0.25311081554757914, 0.25345713605897296, -0.07168527668066046, 0.11428639397102719, 0.09504372950781274, 0.07805800559344116, 0.053427231898186385, 0.04586642182052687, 0.12476267910355496, -0.16464482322933488, 0.03947309317343213, 0.30165044072049635, 0.13445985859466925, 0.2907251638394815, -0.33889333855735865, -0.17016950860033156, 0.24478743469204617, 0.09488595326375043, -0.0223799757797409, 0.031294422320745606, -0.13468966152587974, 0.2251680866746163, -0.14202044624145385, -0.061996295258264854, 0.06413593854479216, 0.19447994566763993, -0.00882207864412555, -0.30300413579507557, -0.05277309452218038, 0.07096097198858237, 0.04449021381636461, 0.12896568773624797, -0.1782841281172026, -0.09231487232156926, 0.06646901143507825, -0.08153520736118985, 0.17629079671093711, 0.015243709538804575, -0.14290811907741482, -0.15156075124870297, 0.39577882547552384, -0.04867155791984664, -0.1504213299671257, 0.11741899234001284, -0.16121053478154526, -0.19803208080292853, 0.12789832655754355, 0.0964955504052341, 0.1668556961506881, -0.06736420554419359, 0.16012677842388964, -0.13648293054904098, 0.11804768247529865, 0.1137856605945638, -0.01292226454243064, 0.13137250496074557, 0.15706855294518862, 0.20930560476931365, 0.13733226602931542, -0.04271414403769153, 0.1522560899214888, -0.30793791514028, -0.09163244373027098, -0.2550269099642281, 0.11489066070773535, -0.15225269851011777, -0.15609438441849002, 0.42522504373832987, 0.0955334296717343, 0.22664663962054032, 0.08404900582024345, 0.17606157961008312, 0.0666313839248485, 0.08832559978451442, 0.24022294248117962, 0.07049173247414055, 0.17451056942378204, -0.0666909112457048, -0.1463743816509291, 0.03367510377946827, 0.12474637707626378]
|
1,803.03697
|
Community Interaction and Conflict on the Web
|
Users organize themselves into communities on web platforms. These
communities can interact with one another, often leading to conflicts and toxic
interactions. However, little is known about the mechanisms of interactions
between communities and how they impact users.
Here we study intercommunity interactions across 36,000 communities on
Reddit, examining cases where users of one community are mobilized by negative
sentiment to comment in another community. We show that such conflicts tend to
be initiated by a handful of communities---less than 1% of communities start
74% of conflicts. While conflicts tend to be initiated by highly active
community members, they are carried out by significantly less active members.
We find that conflicts are marked by formation of echo chambers, where users
primarily talk to other users from their own community. In the long-term,
conflicts have adverse effects and reduce the overall activity of users in the
targeted communities.
Our analysis of user interactions also suggests strategies for mitigating the
negative impact of conflicts---such as increasing direct engagement between
attackers and defenders. Further, we accurately predict whether a conflict will
occur by creating a novel LSTM model that combines graph embeddings, user,
community, and text features. This model can be used toreate early-warning
systems for community moderators to prevent conflicts. Altogether, this work
presents a data-driven view of community interactions and conflict, and paves
the way towards healthier online communities.
|
cs.SI cs.CL cs.HC
|
users organize themselves into communities on web platforms these communities can interact with one another often leading to conflicts and toxic interactions however little is known about the mechanisms of interactions between communities and how they impact users here we study intercommunity interactions across 36000 communities on reddit examining cases where users of one community are mobilized by negative sentiment to comment in another community we show that such conflicts tend to be initiated by a handful of communitiesless than 1 of communities start 74 of conflicts while conflicts tend to be initiated by highly active community members they are carried out by significantly less active members we find that conflicts are marked by formation of echo chambers where users primarily talk to other users from their own community in the longterm conflicts have adverse effects and reduce the overall activity of users in the targeted communities our analysis of user interactions also suggests strategies for mitigating the negative impact of conflictssuch as increasing direct engagement between attackers and defenders further we accurately predict whether a conflict will occur by creating a novel lstm model that combines graph embeddings user community and text features this model can be used toreate earlywarning systems for community moderators to prevent conflicts altogether this work presents a datadriven view of community interactions and conflict and paves the way towards healthier online communities
|
[['users', 'organize', 'themselves', 'into', 'communities', 'on', 'web', 'platforms', 'these', 'communities', 'can', 'interact', 'with', 'one', 'another', 'often', 'leading', 'to', 'conflicts', 'and', 'toxic', 'interactions', 'however', 'little', 'is', 'known', 'about', 'the', 'mechanisms', 'of', 'interactions', 'between', 'communities', 'and', 'how', 'they', 'impact', 'users', 'here', 'we', 'study', 'intercommunity', 'interactions', 'across', '36000', 'communities', 'on', 'reddit', 'examining', 'cases', 'where', 'users', 'of', 'one', 'community', 'are', 'mobilized', 'by', 'negative', 'sentiment', 'to', 'comment', 'in', 'another', 'community', 'we', 'show', 'that', 'such', 'conflicts', 'tend', 'to', 'be', 'initiated', 'by', 'a', 'handful', 'of', 'communitiesless', 'than', '1', 'of', 'communities', 'start', '74', 'of', 'conflicts', 'while', 'conflicts', 'tend', 'to', 'be', 'initiated', 'by', 'highly', 'active', 'community', 'members', 'they', 'are', 'carried', 'out', 'by', 'significantly', 'less', 'active', 'members', 'we', 'find', 'that', 'conflicts', 'are', 'marked', 'by', 'formation', 'of', 'echo', 'chambers', 'where', 'users', 'primarily', 'talk', 'to', 'other', 'users', 'from', 'their', 'own', 'community', 'in', 'the', 'longterm', 'conflicts', 'have', 'adverse', 'effects', 'and', 'reduce', 'the', 'overall', 'activity', 'of', 'users', 'in', 'the', 'targeted', 'communities', 'our', 'analysis', 'of', 'user', 'interactions', 'also', 'suggests', 'strategies', 'for', 'mitigating', 'the', 'negative', 'impact', 'of', 'conflictssuch', 'as', 'increasing', 'direct', 'engagement', 'between', 'attackers', 'and', 'defenders', 'further', 'we', 'accurately', 'predict', 'whether', 'a', 'conflict', 'will', 'occur', 'by', 'creating', 'a', 'novel', 'lstm', 'model', 'that', 'combines', 'graph', 'embeddings', 'user', 'community', 'and', 'text', 'features', 'this', 'model', 'can', 'be', 'used', 'toreate', 'earlywarning', 'systems', 'for', 'community', 'moderators', 'to', 'prevent', 'conflicts', 'altogether', 'this', 'work', 'presents', 'a', 'datadriven', 'view', 'of', 'community', 'interactions', 'and', 'conflict', 'and', 'paves', 'the', 'way', 'towards', 'healthier', 'online', 'communities']]
|
[-0.11780170960248344, 0.11795204276632931, -0.06057602593131984, 0.12340008924973922, -0.16592052497383622, -0.16781956954632835, 0.15098556811067587, 0.41030913468036384, -0.24510368262107174, -0.3771830794877476, 0.057182818947605685, -0.35670698353813757, -0.19651994448983007, 0.09687052636510796, -0.07201591832741946, -0.04509113000550618, 0.08548285782544149, 0.02667824880530437, 0.05741361922687954, -0.27609006795062063, 0.3196265961933467, 0.11339649162151748, 0.25626088756447035, 0.078818733477965, -0.002806097316659159, -0.02209887145914965, -0.110744850071561, 0.048905225689579515, -0.05623030543194747, 0.11845697152324848, 0.37212379577673144, 0.19799561756973466, 0.3749510633283191, -0.4837014275872045, -0.20637602512000336, 0.11769973584812962, 0.18829603156592284, 0.10469116280372771, -0.0382239630828715, -0.35959882657768, 0.08084173071612087, -0.21808213529694412, -0.05866992167404128, -0.059697703334192435, 0.0028966753081315095, 0.03797638444359311, -0.19884304726289379, 0.03167817759625096, 0.00975085763571163, 0.07049574770447281, 0.0009708244084484048, -0.09717468717083749, -0.004843121832236647, 0.23424497081794673, 0.08662880892037518, -0.025789842643878527, 0.17891816309756703, -0.16462884874703984, -0.15196233378309343, 0.3819334955347909, 0.01645372599124029, -0.13772128419898863, 0.24959831679136388, -0.07022559946609867, -0.17138320927818615, 0.09189288643499216, 0.2374044483522367, 0.06375511669424466, -0.1548779321865489, -0.042762574518047686, -0.006762952223006222, 0.19050617376135456, 0.07865370884330736, -0.009941426711156965, 0.25660416314585344, 0.17057121336046194, 0.08225280185385296, 0.07710475292755291, -0.0027648602022478977, -0.07631633249835836, -0.1502088856125354, -0.10539133886910147, -0.10959064055648116, -0.02540337931416515, -0.055862090204932935, -0.09984314727493458, 0.40175467673275206, 0.1972477947982649, 0.1604403363727033, 0.05060701802877399, 0.25150934932960406, -0.031868496822814146, 0.10599937829602923, 0.07778948209119133, 0.21510101694510214, 0.004167023179017835, 0.1377941526296652, -0.1685092826671381, 0.1577505618489037, -0.036203288849857115]
|
1,803.03698
|
Almost prime values of the order of abelian varieties over finite fields
|
Let $E/\mathbb Q$ be an elliptic curve, and denote by $N(p)$ the number of
$\mathbb{F}_p$-points of the reduction modulo $p$ of $E$. A conjecture of
Koblitz, refined by Zywina, states that the number of primes $p \leq X$ at
which $N(p)$ is also prime is asymptotic to $C_E \cdot X / \log(X)^2$, where
$C_E$ is an arithmetically-defined non-negative constant. Following Miri-Murty
(2001) and others, Y.R. Liu (2006) and David-Wu (2012) study the number of
prime factors of $N(p)$. We generalize their arguments to abelian varieties $A
/ \mathbb Q$ whose adelic Galois representation has open image in
$\textrm{GSp}_{2g} \widehat{\mathbb Z}$. Our main result, after David-Wu, finds
a conditional lower bound on the number of primes at which $\# A_p (
\mathbb{F}_p)$ has few prime factors. We also present some experimental
evidence in favor of a generalization of Koblitz's conjecture to this context.
|
math.NT
|
let emathbb q be an elliptic curve and denote by np the number of mathbbf_ppoints of the reduction modulo p of e a conjecture of koblitz refined by zywina states that the number of primes p leq x at which np is also prime is asymptotic to c_e cdot x logx2 where c_e is an arithmeticallydefined nonnegative constant following mirimurty 2001 and others yr liu 2006 and davidwu 2012 study the number of prime factors of np we generalize their arguments to abelian varieties a mathbb q whose adelic galois representation has open image in textrmgsp_2g widehatmathbb z our main result after davidwu finds a conditional lower bound on the number of primes at which a_p mathbbf_p has few prime factors we also present some experimental evidence in favor of a generalization of koblitzs conjecture to this context
|
[['let', 'emathbb', 'q', 'be', 'an', 'elliptic', 'curve', 'and', 'denote', 'by', 'np', 'the', 'number', 'of', 'mathbbf_ppoints', 'of', 'the', 'reduction', 'modulo', 'p', 'of', 'e', 'a', 'conjecture', 'of', 'koblitz', 'refined', 'by', 'zywina', 'states', 'that', 'the', 'number', 'of', 'primes', 'p', 'leq', 'x', 'at', 'which', 'np', 'is', 'also', 'prime', 'is', 'asymptotic', 'to', 'c_e', 'cdot', 'x', 'logx2', 'where', 'c_e', 'is', 'an', 'arithmeticallydefined', 'nonnegative', 'constant', 'following', 'mirimurty', '2001', 'and', 'others', 'yr', 'liu', '2006', 'and', 'davidwu', '2012', 'study', 'the', 'number', 'of', 'prime', 'factors', 'of', 'np', 'we', 'generalize', 'their', 'arguments', 'to', 'abelian', 'varieties', 'a', 'mathbb', 'q', 'whose', 'adelic', 'galois', 'representation', 'has', 'open', 'image', 'in', 'textrmgsp_2g', 'widehatmathbb', 'z', 'our', 'main', 'result', 'after', 'davidwu', 'finds', 'a', 'conditional', 'lower', 'bound', 'on', 'the', 'number', 'of', 'primes', 'at', 'which', 'a_p', 'mathbbf_p', 'has', 'few', 'prime', 'factors', 'we', 'also', 'present', 'some', 'experimental', 'evidence', 'in', 'favor', 'of', 'a', 'generalization', 'of', 'koblitzs', 'conjecture', 'to', 'this', 'context']]
|
[-0.2045944626619475, 0.1143768536772272, -0.12020188727359654, 0.028156619735951113, -0.051514190693551704, -0.1576870329268841, 0.055393492248240916, 0.26440049919201003, -0.27894544680902705, -0.3054282713018245, 0.013082045966505328, -0.271163689889804, -0.07368279152874355, 0.20451618576683386, -0.13240014809663547, 0.016524275297397806, 0.005650449006046101, 0.08930247672127956, -0.03055963508968213, -0.37485793592041416, 0.3142749380221534, -0.02376280622697915, 0.14858442197102262, 0.07929972291987558, 0.04070838610994432, 0.03186319469276703, 0.024308831131113977, -0.06097673086774056, -0.1954070505438391, 0.11950241233739001, 0.2898421637364663, 0.12290418384399152, 0.2667553374423843, -0.3375373435291377, -0.11524703512744357, 0.23259841850041552, 0.14721009598438148, -0.04934597335170221, 0.003265009951781284, -0.21295310269730786, 0.17265837199308656, -0.15157766063048533, -0.16088951720192915, -0.056933662619540526, 0.17292476922386524, 0.01292809477000088, -0.31947695293947065, 0.024414884021318743, 0.13181290129961615, 0.1286280213377419, -0.014950123782689458, -0.22834684769975755, 0.02354270005669219, 0.002221698034907494, 0.05235602391114684, 0.12728769786719402, 0.017954570431770248, -0.09222613795568715, -0.1228699668479914, 0.3206422553736378, -0.032496825622564014, -0.13197709591071488, 0.07072147126878421, -0.17566599238974354, -0.17972295912984532, 0.14055179507263485, 0.12973034321718538, 0.14261612666516818, 0.009906722186838813, 0.22327783702613405, -0.18867880061677142, 0.1291321253352869, 0.12871491520976028, -0.022270630738189953, 0.10723023640281154, 0.05684795563998209, 0.023256451335989616, 0.08940988396573106, -0.04059003315915382, 0.04567702908962295, -0.3744478180482419, -0.16190257093694527, -0.16583410016380984, 0.17788068458409698, -0.1031900632304755, -0.11099049402400851, 0.34396069395271217, 0.06324760021975222, 0.20633311039119057, 0.09857509750123206, 0.1923493248142415, 0.08191475837057541, -0.014805017914058584, 0.08434193914184686, 0.10535770281554009, 0.20189098358704624, -0.053788322768399885, -0.16119190733474115, 0.01925376564031467, 0.15476242880068833]
|
1,803.03699
|
Ideal convergent subseries in Banach spaces
|
Assume that $\mathcal{I}$ is an ideal on $\mathbb{N}$, and $\sum_n x_n$ is a
divergent series in a Banach space $X$. We study the Baire category, and the
measure of the set $A(\mathcal{I}):=\left\{t \in \{0,1\}^{\mathbb{N}} \colon
\sum_n t(n)x_n \textrm{ is } \mathcal{I}\textrm{-convergent}\right\}$. In the
category case, we assume that $\mathcal{I}$ has the Baire property and $\sum_n
x_n$ is not unconditionally convergent, and we deduce that $A(\mathcal{I})$ is
meager. We also study the smallness of $A(\mathcal{I})$ in the measure case
when the Haar probability measure $\lambda$ on $\{0,1\}^{\mathbb{N}}$ is
considered. If $\mathcal{I}$ is analytic or coanalytic, and $\sum_n x_n$ is
$\mathcal{I}$-divergent, then $\lambda(A(\mathcal{I}))=0$ which extends the
theorem of Dindo\v{s}, \v{S}al\'at and Toma. Generalizing one of their
examples, we show that, for every ideal $\mathcal{I}$ on $\mathbb{N}$, with the
property of long intervals, there is a divergent series of reals such that
$\lambda(A(Fin))=0$ and $\lambda(A(\mathcal{I}))=1$.
|
math.FA
|
assume that mathcali is an ideal on mathbbn and sum_n x_n is a divergent series in a banach space x we study the baire category and the measure of the set amathcalileftt in 01mathbbn colon sum_n tnx_n textrm is mathcalitextrmconvergentright in the category case we assume that mathcali has the baire property and sum_n x_n is not unconditionally convergent and we deduce that amathcali is meager we also study the smallness of amathcali in the measure case when the haar probability measure lambda on 01mathbbn is considered if mathcali is analytic or coanalytic and sum_n x_n is mathcalidivergent then lambdaamathcali0 which extends the theorem of dindovs vsalat and toma generalizing one of their examples we show that for every ideal mathcali on mathbbn with the property of long intervals there is a divergent series of reals such that lambdaafin0 and lambdaamathcali1
|
[['assume', 'that', 'mathcali', 'is', 'an', 'ideal', 'on', 'mathbbn', 'and', 'sum_n', 'x_n', 'is', 'a', 'divergent', 'series', 'in', 'a', 'banach', 'space', 'x', 'we', 'study', 'the', 'baire', 'category', 'and', 'the', 'measure', 'of', 'the', 'set', 'amathcalileftt', 'in', '01mathbbn', 'colon', 'sum_n', 'tnx_n', 'textrm', 'is', 'mathcalitextrmconvergentright', 'in', 'the', 'category', 'case', 'we', 'assume', 'that', 'mathcali', 'has', 'the', 'baire', 'property', 'and', 'sum_n', 'x_n', 'is', 'not', 'unconditionally', 'convergent', 'and', 'we', 'deduce', 'that', 'amathcali', 'is', 'meager', 'we', 'also', 'study', 'the', 'smallness', 'of', 'amathcali', 'in', 'the', 'measure', 'case', 'when', 'the', 'haar', 'probability', 'measure', 'lambda', 'on', '01mathbbn', 'is', 'considered', 'if', 'mathcali', 'is', 'analytic', 'or', 'coanalytic', 'and', 'sum_n', 'x_n', 'is', 'mathcalidivergent', 'then', 'lambdaamathcali0', 'which', 'extends', 'the', 'theorem', 'of', 'dindovs', 'vsalat', 'and', 'toma', 'generalizing', 'one', 'of', 'their', 'examples', 'we', 'show', 'that', 'for', 'every', 'ideal', 'mathcali', 'on', 'mathbbn', 'with', 'the', 'property', 'of', 'long', 'intervals', 'there', 'is', 'a', 'divergent', 'series', 'of', 'reals', 'such', 'that', 'lambdaafin0', 'and', 'lambdaamathcali1']]
|
[-0.17242736378474569, 0.10878351548981163, -0.10590346360971269, 0.07754080587581388, -0.032582812949566914, -0.10310562825026481, -0.017255033883905122, 0.38980434692107646, -0.3262656003208761, -0.04910771576057475, 0.10355534519706118, -0.3469884093024565, -0.09893040461430705, 0.1927854535607551, -0.14490308446277464, 0.00027540724206351694, 0.04452328217264853, 0.10865602392311159, -0.029748865219421293, -0.24393018126431712, 0.38990451207146387, -0.08129420065272011, 0.2186197548355431, 0.03401043404355869, 0.15500406976579165, -0.031549209364710895, 0.026877616763226968, -0.013980871350268126, -0.20719138445483418, 0.020808772807608227, 0.26417004420681106, 0.15686174563335298, 0.3011273595528971, -0.32400072336829744, -0.09264479351363011, 0.2410409619779627, 0.12216186777975663, -0.10277990590434354, 0.011383009986747126, -0.2529420994005089, 0.18578249242338807, -0.15387810623847453, -0.11268092759996932, -0.11684187615108221, 0.13583878867496224, 0.042515520482583155, -0.37921857692763433, 0.024778118445249134, 0.16953902006765506, 0.051964354645320794, -0.03840263198126331, -0.06729307392598095, -0.04077621977741277, 0.06829452628197141, 0.04049092336361738, 0.11461203464453942, 0.03551153158305101, -0.0006851922454578536, -0.04399871977249203, 0.35164116426630126, -0.08639646279433028, -0.240936655845297, 0.09468461951254901, -0.25239866229712515, -0.18557907970748225, 0.06500406610198263, 0.011716777934076586, 0.17768451680352254, -0.047435367062072534, 0.2527565978072703, -0.16461440859646082, 0.15972548471133513, 0.08935708332722797, 0.057203748760153224, 0.11548423973661393, 0.11489378987755486, 0.08352994586208037, 0.1160029828394378, -0.005567608248876562, 0.002639338766273699, -0.37844100943241354, -0.1948321071887543, -0.23531793014853633, 0.18917883578803885, -0.07581886132626314, -0.2090638756569951, 0.306319468310698, 0.1284278310761836, 0.16843671179411554, 0.14017813427363263, 0.2081801510675061, 0.11059196730228789, -0.024517235856440226, 0.061240006945467086, 0.06373131258218002, 0.13154525222270785, -0.03493801643371694, -0.1045555090024031, 0.054988793419110345, 0.16124310622103794]
|
1,803.037
|
Semimartingales and Shrinkage of Filtration
|
We consider a complete probability space $(\Omega,\mathcal{F},\mathbb{P})$,
which is endowed with two filtrations, $\mathbb{G}$ and $\mathbb{F}$, assumed
to satisfy the usual conditions and such that $\mathbb{F} \subset \mathbb{G}$.
On this probability space we consider a real valued special
$\mathbb{G}$-semimartingale $X$. The purpose of this work is to study the
following two problems:
A. If $X$ is $\mathbb{F}$-adapted, compute the $\mathbb{F}$-semimartingale
characteristics of $X$ in terms of the $\mathbb{G}$-semimartingale
characteristics of $X$.
B. If $X$ is not $\mathbb{F}$-adapted, given that the $\mathbb{F}$-optional
projection of $X$ is a special semimartingale, compute the
$\mathbb{F}$-semimartingale characteristics of $\mathbb{F}$-optional projection
of $X$ in terms of the $\mathbb{G}$-canonical decomposition and
$\mathbb{G}$-semimartingale characteristics of $X$.
|
math.PR
|
we consider a complete probability space omegamathcalfmathbbp which is endowed with two filtrations mathbbg and mathbbf assumed to satisfy the usual conditions and such that mathbbf subset mathbbg on this probability space we consider a real valued special mathbbgsemimartingale x the purpose of this work is to study the following two problems a if x is mathbbfadapted compute the mathbbfsemimartingale characteristics of x in terms of the mathbbgsemimartingale characteristics of x b if x is not mathbbfadapted given that the mathbbfoptional projection of x is a special semimartingale compute the mathbbfsemimartingale characteristics of mathbbfoptional projection of x in terms of the mathbbgcanonical decomposition and mathbbgsemimartingale characteristics of x
|
[['we', 'consider', 'a', 'complete', 'probability', 'space', 'omegamathcalfmathbbp', 'which', 'is', 'endowed', 'with', 'two', 'filtrations', 'mathbbg', 'and', 'mathbbf', 'assumed', 'to', 'satisfy', 'the', 'usual', 'conditions', 'and', 'such', 'that', 'mathbbf', 'subset', 'mathbbg', 'on', 'this', 'probability', 'space', 'we', 'consider', 'a', 'real', 'valued', 'special', 'mathbbgsemimartingale', 'x', 'the', 'purpose', 'of', 'this', 'work', 'is', 'to', 'study', 'the', 'following', 'two', 'problems', 'a', 'if', 'x', 'is', 'mathbbfadapted', 'compute', 'the', 'mathbbfsemimartingale', 'characteristics', 'of', 'x', 'in', 'terms', 'of', 'the', 'mathbbgsemimartingale', 'characteristics', 'of', 'x', 'b', 'if', 'x', 'is', 'not', 'mathbbfadapted', 'given', 'that', 'the', 'mathbbfoptional', 'projection', 'of', 'x', 'is', 'a', 'special', 'semimartingale', 'compute', 'the', 'mathbbfsemimartingale', 'characteristics', 'of', 'mathbbfoptional', 'projection', 'of', 'x', 'in', 'terms', 'of', 'the', 'mathbbgcanonical', 'decomposition', 'and', 'mathbbgsemimartingale', 'characteristics', 'of', 'x']]
|
[-0.17593621306157517, 0.08323556935251916, -0.0778761771552771, 0.023426019124352167, -0.05203070720088062, -0.09796148764638646, 0.019583392519847427, 0.38299789247148247, -0.31139134618824404, -0.14416030687686887, 0.10316643780504253, -0.23532716281151453, -0.12754504562997557, 0.1560002835919556, -0.14452163180227853, -0.03749694036844286, 0.026348539085570468, 0.1232320373308239, -0.13966828695887212, -0.27106137538003255, 0.36525934182324454, -0.05348563753068447, 0.23486391510995266, -0.003934521824844833, 0.19329095126844, 0.03167528368858168, 0.001322890351553565, 0.019665305841221357, -0.13828175699915307, 0.09365685339293724, 0.24423671401675465, 0.1234376182173858, 0.2524360633156832, -0.34693031341235325, -0.17447522083903183, 0.22220648438172433, 0.06292522399351724, -0.07497713032960711, 0.024692061145844175, -0.24004960888363783, 0.1399044431791216, -0.11969172182375366, -0.13436987815262044, -0.03518382110859005, 0.09261225473171877, 0.03920839899400412, -0.30934342704442086, -0.025141360706116243, 0.07781690266209393, 0.007146988348872627, -0.04020419755715479, -0.093777799779929, -0.04814324672650365, 0.07501867231777282, 0.015246831934031063, 0.09843183884134932, 0.0829457292667798, -0.06503951626838846, -0.09053261477717207, 0.4081504778140812, -0.07404772665134622, -0.26497191516230406, 0.11280936181310167, -0.22220338123072916, -0.1603824092545411, 0.12292441962856474, 0.13272233716736648, 0.18145014041835822, -0.08755511045003835, 0.21214641825786512, -0.11942710172276473, 0.0990263907808485, 0.03051680998279921, 0.0537407440630701, 0.10959549708906742, 0.12487576375670224, 0.08849543285583264, 0.10799568968381985, -0.05230077223861319, -0.013901575133927818, -0.3792440641707587, -0.2123502452487072, -0.17180361487739945, 0.16170787740992135, -0.06916026901682608, -0.18203297297208054, 0.37459654620514043, 0.09754653894387692, 0.2272490306838768, 0.042348355101195424, 0.2231957677896451, 0.09733598473147281, -0.04886692053202124, 0.05050192185162196, 0.06432783038545291, 0.1583266367285865, 0.010574815663717036, -0.1460527091160489, 0.0913386728786366, 0.11162243083625742]
|
1,803.03701
|
Biharmonic constant mean curvature surfaces in Killing submersions
|
A $3$-dimensional Riemannian manifold is called Killing submersion if it
admits a Riemannian submersion over a surface such that its fibers are the
trajectories of a complete unit Killing vector field. In this paper, we give a
characterization of proper biharmonic CMC surfaces in a Killing submersion. In
the last part, we also classify the proper biharmonic Hopf cylinders in a
Killing submersion.
|
math.DG
|
a 3dimensional riemannian manifold is called killing submersion if it admits a riemannian submersion over a surface such that its fibers are the trajectories of a complete unit killing vector field in this paper we give a characterization of proper biharmonic cmc surfaces in a killing submersion in the last part we also classify the proper biharmonic hopf cylinders in a killing submersion
|
[['a', '3dimensional', 'riemannian', 'manifold', 'is', 'called', 'killing', 'submersion', 'if', 'it', 'admits', 'a', 'riemannian', 'submersion', 'over', 'a', 'surface', 'such', 'that', 'its', 'fibers', 'are', 'the', 'trajectories', 'of', 'a', 'complete', 'unit', 'killing', 'vector', 'field', 'in', 'this', 'paper', 'we', 'give', 'a', 'characterization', 'of', 'proper', 'biharmonic', 'cmc', 'surfaces', 'in', 'a', 'killing', 'submersion', 'in', 'the', 'last', 'part', 'we', 'also', 'classify', 'the', 'proper', 'biharmonic', 'hopf', 'cylinders', 'in', 'a', 'killing', 'submersion']]
|
[-0.25765513480892255, 0.06002606348031097, -0.06388315596869068, 0.014640559752782186, -0.21428329244788205, -0.11406133252949942, -0.07399465885597266, 0.4542363202051511, -0.2536180833620684, -0.11003869437863903, 0.10642811149499187, -0.2754741923380939, -0.20887352566101722, 0.14871546365911997, -0.1992295392463723, 0.0035622690366359337, 0.15795868568654572, 0.1600607538980151, -0.11265686341672364, -0.26464100888678954, 0.4792603099393466, -0.09517555538978842, 0.20063932105115365, 0.062006765924808055, 0.2701959189411903, -0.028134829675157864, 0.05757841130068141, 0.08333415167021846, -0.2196548936546952, 0.07597363317414882, 0.21803625412876643, 0.11425571007624505, 0.23252183714851973, -0.3568709499483544, -0.22004111422569303, 0.22629248046330988, 0.1337639596608896, 0.0009725908083575112, -0.05823135718939796, -0.29390789642338716, 0.03175947788201036, -0.03331654093095234, -0.19389029853932915, -0.13524403210197175, 0.07825183054794455, -0.10737595107362029, -0.16651274113073236, 0.009879874933551672, 0.1842832297441505, 0.15084072048701938, -0.17088747372858168, -0.00097687253432851, -0.12051337947034174, 0.08799789781637844, 0.0009289367442270593, 0.1439660194566444, 0.12184722762968805, -0.025555137312039733, -0.09720417418118034, 0.3241903376839464, -0.12777395700178448, -0.4157134635403516, 0.025235575477829172, -0.15417063814247883, -0.12237188346417886, 0.18195120911926976, 0.18338450984585852, 0.2120715891794553, -0.16961970574976432, 0.16400863521451514, -0.10166260990358535, -0.01769191689700598, 0.14164537889882922, -0.1285074782993881, 0.16286612868989034, 0.15571132544723768, 0.189779036944466, 0.12174695232025688, -0.04893520212037459, -0.009103120661281522, -0.41972022728314473, -0.3369059728399392, -0.08221325307108816, 0.28926463379332473, -0.13744685989582822, -0.2531077155163364, 0.428028071920077, -0.0669192753081757, 0.19991384297313672, 0.11456143733350531, 0.22503443121437042, -0.04086081285975755, 0.0684532515394191, 0.13075429689700876, 0.23604751569366764, 0.29384047635609195, 0.04611638829015964, -0.05400415983731075, -0.17124510784116057, 0.11785045650506777]
|
1,803.03702
|
Orbifold Vertex Operator Algebras and the Positivity Condition
|
In this note we show that the irreducible twisted modules of a holomorphic,
$C_2$-cofinite vertex operator algebra $V$ have $L_0$-weights at least as large
as the smallest $L_0$-weight of $V$. Hence, if $V$ is of CFT-type, then the
twisted $V$-modules are almost strictly positively graded. This in turn implies
that the fixed-point vertex operator subalgebra $V^G$ for a finite, solvable
group of automorphisms of $V$ almost satisfies the positivity condition. These
and some further results are obtained by a careful analysis of Dong, Li and
Mason's twisted modular invariance.
|
math.QA math.RT
|
in this note we show that the irreducible twisted modules of a holomorphic c_2cofinite vertex operator algebra v have l_0weights at least as large as the smallest l_0weight of v hence if v is of cfttype then the twisted vmodules are almost strictly positively graded this in turn implies that the fixedpoint vertex operator subalgebra vg for a finite solvable group of automorphisms of v almost satisfies the positivity condition these and some further results are obtained by a careful analysis of dong li and masons twisted modular invariance
|
[['in', 'this', 'note', 'we', 'show', 'that', 'the', 'irreducible', 'twisted', 'modules', 'of', 'a', 'holomorphic', 'c_2cofinite', 'vertex', 'operator', 'algebra', 'v', 'have', 'l_0weights', 'at', 'least', 'as', 'large', 'as', 'the', 'smallest', 'l_0weight', 'of', 'v', 'hence', 'if', 'v', 'is', 'of', 'cfttype', 'then', 'the', 'twisted', 'vmodules', 'are', 'almost', 'strictly', 'positively', 'graded', 'this', 'in', 'turn', 'implies', 'that', 'the', 'fixedpoint', 'vertex', 'operator', 'subalgebra', 'vg', 'for', 'a', 'finite', 'solvable', 'group', 'of', 'automorphisms', 'of', 'v', 'almost', 'satisfies', 'the', 'positivity', 'condition', 'these', 'and', 'some', 'further', 'results', 'are', 'obtained', 'by', 'a', 'careful', 'analysis', 'of', 'dong', 'li', 'and', 'masons', 'twisted', 'modular', 'invariance']]
|
[-0.19592012347246723, 0.1287555417619288, -0.05569307816792922, 0.014326650808543909, -0.0919008546712241, -0.1821106825205872, -0.007924723149887446, 0.37912286773869963, -0.3400035032295975, -0.1737631655394517, 0.10429569821130356, -0.2812766365348308, -0.14662495463813557, 0.14515413976563463, -0.1021999241034875, -0.01869530865023362, 0.13521623417324302, 0.11080459990249626, -0.08909037734927802, -0.28440575763561776, 0.41401912040751554, -0.02246141624262278, 0.18019365362994288, 0.1052947615262592, 0.1267325079560965, 0.02140944770901282, -0.012952812535195857, 0.028871009377869725, -0.12118520343160369, 0.08378673255464983, 0.24806121361158232, 0.07883156484913552, 0.2368077179952257, -0.3406594608128927, -0.0943088809392233, 0.17790262083169714, 0.1534556942676119, -0.049850948433252586, -0.013952565106466926, -0.21774845291999564, 0.17235111832704353, -0.19884946779615578, -0.16580261755199438, -0.042201683631744875, 0.12214650918098016, -0.009126588884184415, -0.26397423722898994, 0.02351879330630275, 0.1375561980423571, 0.10058550010300636, -0.03737937091667762, -0.13388870565231417, -0.17243728331750494, 0.04915807068604847, -0.07100034896659012, 0.07447494840752547, 0.0754923359116261, -0.09774108174867158, -0.10968761419577674, 0.3398214256840533, -0.054002267503896834, -0.18745617082492375, 0.0844822825071798, -0.19891993389946633, -0.19157529636232676, 0.08570423048931634, 0.009308894555587536, 0.1344588496561708, -0.08137183253193038, 0.21313740315060292, -0.18336842589123153, 0.022997547240777946, 0.09275747579790053, 0.0033345891720743784, 0.09312930329563632, 0.032393809696980594, 0.13062736683460915, 0.10986610935149907, 0.09646662127697604, 0.063351861029949, -0.41795297283893346, -0.17404908306853867, -0.10738576355593643, 0.14475778572330916, -0.1043989400445596, -0.17614938516769257, 0.42110034204676916, 0.09577351516840615, 0.20015884237899179, 0.08551537974512782, 0.15743057137547894, 0.13828087817534976, 0.11465847937540076, 0.09088512426028135, 0.12782364062083104, 0.2329607303013447, -0.019152102413876302, -0.18650690669022585, -0.036612813264645376, 0.2133695730918098]
|
1,803.03703
|
Gravitational Coupling and the Cosmological Constant
|
We deal with a dynamical mechanism in which a large cosmological constant, as
suggested by inflationary scenarios, decays due to expansion of the universe.
This mechanism has its origin in the gravitational coupling of the vacuum
density. We assume that the vacuum couples anomalously to gravity that is the
metric tensor that appears the gravitational part is not the same as that
appears the matter part as suggested by weak equivalence principle. Instead,
the two metric tensors are taken to be conformally related. We show that this
provides a dynamical mechanism which works during expansion of the universe. We
also consider some observational consequences of such a gravitational model.
|
gr-qc
|
we deal with a dynamical mechanism in which a large cosmological constant as suggested by inflationary scenarios decays due to expansion of the universe this mechanism has its origin in the gravitational coupling of the vacuum density we assume that the vacuum couples anomalously to gravity that is the metric tensor that appears the gravitational part is not the same as that appears the matter part as suggested by weak equivalence principle instead the two metric tensors are taken to be conformally related we show that this provides a dynamical mechanism which works during expansion of the universe we also consider some observational consequences of such a gravitational model
|
[['we', 'deal', 'with', 'a', 'dynamical', 'mechanism', 'in', 'which', 'a', 'large', 'cosmological', 'constant', 'as', 'suggested', 'by', 'inflationary', 'scenarios', 'decays', 'due', 'to', 'expansion', 'of', 'the', 'universe', 'this', 'mechanism', 'has', 'its', 'origin', 'in', 'the', 'gravitational', 'coupling', 'of', 'the', 'vacuum', 'density', 'we', 'assume', 'that', 'the', 'vacuum', 'couples', 'anomalously', 'to', 'gravity', 'that', 'is', 'the', 'metric', 'tensor', 'that', 'appears', 'the', 'gravitational', 'part', 'is', 'not', 'the', 'same', 'as', 'that', 'appears', 'the', 'matter', 'part', 'as', 'suggested', 'by', 'weak', 'equivalence', 'principle', 'instead', 'the', 'two', 'metric', 'tensors', 'are', 'taken', 'to', 'be', 'conformally', 'related', 'we', 'show', 'that', 'this', 'provides', 'a', 'dynamical', 'mechanism', 'which', 'works', 'during', 'expansion', 'of', 'the', 'universe', 'we', 'also', 'consider', 'some', 'observational', 'consequences', 'of', 'such', 'a', 'gravitational', 'model']]
|
[-0.16743974902009198, 0.16411372077215566, -0.12582262156001472, 0.108479573288847, -0.11767773747170737, -0.08540800634831396, -0.03889384411527442, 0.3028959025278551, -0.2591634437467459, -0.25446845749991204, 0.08696396364146895, -0.22864332776345792, -0.16571177518285743, 0.1288101226134106, -0.007226616430412465, -0.016853672978275995, 0.005002449646831379, 0.053951691938649626, -0.031247947365045547, -0.22999796741898385, 0.3762324140407145, 0.08892584979158202, 0.22366788985320887, 0.061461257697040333, 0.122207881190703, -0.08427600906905505, -0.017014581180357057, 0.05256541437307082, -0.10807475883791644, 0.039429458479798576, 0.17437776891565923, 0.1390601300010714, 0.26876144072280156, -0.39966301866080783, -0.26332092060442636, 0.1457722058451367, 0.11526649734517987, 0.16203077137256638, -0.07554351523894509, -0.27342462555266095, 0.07780114755487291, -0.2017348802033299, -0.1470416043671446, -0.06058608906673601, 0.01618593214763277, -0.06386573314495864, -0.25340804146226803, 0.09107527052828777, 0.0377885121483689, -0.08241898721135264, -0.09595845976455666, -0.03630169574384911, 0.006819906909394702, 0.04674278170195058, 0.15879288169452835, 0.06550039829891346, 0.12874922170004713, -0.125396532156086, -0.09561363037316761, 0.4373125044304296, -0.15476476373428633, -0.17538126517053043, 0.16851469379670303, -0.16043804439827117, -0.157144651081789, 0.07062273548591301, 0.11225686452154993, 0.1071805979697666, -0.14682997795197805, 0.1454973529955936, -0.0069445862206245915, 0.131089202628189, 0.05164213899582829, 0.05749956994753228, 0.2783950050874109, 0.10558182424053959, 0.03385020014958097, 0.13200546227664678, -0.02888560022116391, -0.08028540774376704, -0.37436880253323723, -0.12878719176199938, -0.18739986933186786, 0.08369094155819065, -0.115833736657071, -0.18285953858440077, 0.3576033970494883, 0.14619088762038207, 0.20944848039386144, 0.02663132426363134, 0.2800206861911564, 0.08940066602038339, 0.09130473644899871, 0.04453913618836108, 0.3555342344678789, 0.1324582331335394, 0.11733874902257337, -0.2240177919242292, 0.059554275620831265, 0.0679022323814383]
|
1,803.03704
|
Edge-decomposing graphs into coprime forests
|
The Barat-Thomassen conjecture, recently proved in [Bensmail et al.: A proof
of the Barat-Thomassen conjecture. J. Combin. Theory Ser. B, 124:39-55, 2017.],
asserts that for every tree T, there is a constant $c_T$ such that every
$c_T$-edge connected graph G with number of edges (size) divisible by the size
of T admits an edge partition into copies of T (a T-decomposition). In this
paper, we investigate in which case the connectivity requirement can be dropped
to a minimum degree condition. For instance, it was shown in [Bensmail et al.:
Edge-partitioning a graph into paths: beyond the Barat-Thomassen conjecture.
arXiv:1507.08208] that when T is a path with k edges, there is a constant $d_k$
such that every 24-edge connected graph G with size divisible by k and minimum
degree $d_k$ has a T-decomposition. We show in this paper that when F is a
coprime forest (the sizes of its components being a coprime set of integers),
any graph G with sufficiently large minimum degree has an F-decomposition
provided that the size of F divides the size of G (no connectivity is
required). A natural conjecture asked in [Bensmail et al.: Edge-partitioning a
graph into paths: beyond the Barat-Thomassen conjecture. arXiv:1507.08208]
asserts that for a fixed tree T, any graph G of size divisible by the size of T
with sufficiently high minimum degree has a T-decomposition, provided that G is
sufficiently highly connected in terms of the maximal degree of T. The case of
maximum degree 2 is answered by paths. We provide a counterexample to this
conjecture in the case of maximum degree 3.
|
math.CO cs.DM
|
the baratthomassen conjecture recently proved in bensmail et al a proof of the baratthomassen conjecture j combin theory ser b 1243955 2017 asserts that for every tree t there is a constant c_t such that every c_tedge connected graph g with number of edges size divisible by the size of t admits an edge partition into copies of t a tdecomposition in this paper we investigate in which case the connectivity requirement can be dropped to a minimum degree condition for instance it was shown in bensmail et al edgepartitioning a graph into paths beyond the baratthomassen conjecture arxiv150708208 that when t is a path with k edges there is a constant d_k such that every 24edge connected graph g with size divisible by k and minimum degree d_k has a tdecomposition we show in this paper that when f is a coprime forest the sizes of its components being a coprime set of integers any graph g with sufficiently large minimum degree has an fdecomposition provided that the size of f divides the size of g no connectivity is required a natural conjecture asked in bensmail et al edgepartitioning a graph into paths beyond the baratthomassen conjecture arxiv150708208 asserts that for a fixed tree t any graph g of size divisible by the size of t with sufficiently high minimum degree has a tdecomposition provided that g is sufficiently highly connected in terms of the maximal degree of t the case of maximum degree 2 is answered by paths we provide a counterexample to this conjecture in the case of maximum degree 3
|
[['the', 'baratthomassen', 'conjecture', 'recently', 'proved', 'in', 'bensmail', 'et', 'al', 'a', 'proof', 'of', 'the', 'baratthomassen', 'conjecture', 'j', 'combin', 'theory', 'ser', 'b', '1243955', '2017', 'asserts', 'that', 'for', 'every', 'tree', 't', 'there', 'is', 'a', 'constant', 'c_t', 'such', 'that', 'every', 'c_tedge', 'connected', 'graph', 'g', 'with', 'number', 'of', 'edges', 'size', 'divisible', 'by', 'the', 'size', 'of', 't', 'admits', 'an', 'edge', 'partition', 'into', 'copies', 'of', 't', 'a', 'tdecomposition', 'in', 'this', 'paper', 'we', 'investigate', 'in', 'which', 'case', 'the', 'connectivity', 'requirement', 'can', 'be', 'dropped', 'to', 'a', 'minimum', 'degree', 'condition', 'for', 'instance', 'it', 'was', 'shown', 'in', 'bensmail', 'et', 'al', 'edgepartitioning', 'a', 'graph', 'into', 'paths', 'beyond', 'the', 'baratthomassen', 'conjecture', 'arxiv150708208', 'that', 'when', 't', 'is', 'a', 'path', 'with', 'k', 'edges', 'there', 'is', 'a', 'constant', 'd_k', 'such', 'that', 'every', '24edge', 'connected', 'graph', 'g', 'with', 'size', 'divisible', 'by', 'k', 'and', 'minimum', 'degree', 'd_k', 'has', 'a', 'tdecomposition', 'we', 'show', 'in', 'this', 'paper', 'that', 'when', 'f', 'is', 'a', 'coprime', 'forest', 'the', 'sizes', 'of', 'its', 'components', 'being', 'a', 'coprime', 'set', 'of', 'integers', 'any', 'graph', 'g', 'with', 'sufficiently', 'large', 'minimum', 'degree', 'has', 'an', 'fdecomposition', 'provided', 'that', 'the', 'size', 'of', 'f', 'divides', 'the', 'size', 'of', 'g', 'no', 'connectivity', 'is', 'required', 'a', 'natural', 'conjecture', 'asked', 'in', 'bensmail', 'et', 'al', 'edgepartitioning', 'a', 'graph', 'into', 'paths', 'beyond', 'the', 'baratthomassen', 'conjecture', 'arxiv150708208', 'asserts', 'that', 'for', 'a', 'fixed', 'tree', 't', 'any', 'graph', 'g', 'of', 'size', 'divisible', 'by', 'the', 'size', 'of', 't', 'with', 'sufficiently', 'high', 'minimum', 'degree', 'has', 'a', 'tdecomposition', 'provided', 'that', 'g', 'is', 'sufficiently', 'highly', 'connected', 'in', 'terms', 'of', 'the', 'maximal', 'degree', 'of', 't', 'the', 'case', 'of', 'maximum', 'degree', '2', 'is', 'answered', 'by', 'paths', 'we', 'provide', 'a', 'counterexample', 'to', 'this', 'conjecture', 'in', 'the', 'case', 'of', 'maximum', 'degree', '3']]
|
[-0.20007208146830724, 0.16434034181712104, -0.06024570950100394, -0.04617436736521351, -0.05958222592854691, -0.15439843244357795, 0.05757719787346844, 0.32252153386416255, -0.2536804020904903, -0.30617421681373036, 0.027734941929299747, -0.27797898502860957, -0.15687883286718787, 0.11897988415754433, -0.11648212283476463, -0.019968751800049037, 0.07612324703180373, 0.10305026285850863, 0.0469398395373968, -0.32209187080691376, 0.25353170434657485, -0.006289234826094852, 0.17524394427450168, 0.10381055653733039, 0.1046188673455674, 0.05976697839070646, 0.02029722607680977, 0.1078918603047772, -0.18851723679335033, 0.058283054459195016, 0.2520626139453819, 0.1642415827386632, 0.30390064480645645, -0.3283180324253146, -0.18952656482393465, 0.21093927926822395, 0.07647586661093807, 0.01108752485457083, 0.005426528477671662, -0.17669796360953774, 0.2021718102657682, -0.11830943130251838, -0.15101232927415795, 0.02999583482633595, 0.18542112032919109, -0.022105436130691363, -0.3339977998772078, -0.002277090943487296, 0.14563826016777337, 0.06105085425006392, 0.07667411449193186, -0.14184007356088274, -0.07564875867185165, 0.06825977090156388, -0.05135333106412773, 0.12863438674393707, -0.012602089508119536, -0.1078347732749648, -0.1393316323444943, 0.3320180611052561, -0.054603965895011264, -0.13922142416079336, 0.1186306949139569, -0.14501012611005398, -0.17673366613584618, 0.13394192370843389, 0.07998758217080673, 0.14648289842973192, -0.061060271789147684, 0.21499368419181303, -0.1599682052094301, 0.16410319271618826, 0.15471796053307718, -0.030047153828009703, 0.12760487053149125, 0.12282130507397164, 0.14422964309280487, 0.13912714561963896, 0.0010793686034484015, 0.06581350576503071, -0.3050892281596067, -0.14978934551955198, -0.27424713237399545, 0.12298607827908928, -0.14726152677846127, -0.14644983192352698, 0.3634123785243685, 0.08908176298943124, 0.21835520582324336, 0.10695276378086815, 0.20106243504870844, 0.1030842001031353, 0.059836081199480244, 0.21203710295935796, 0.1009236545399817, 0.196085523074703, -0.02941684369070289, -0.15308944331047195, 0.07464882613663427, 0.12934117682879712]
|
1,803.03705
|
Geodesic Obstacle Representation of Graphs
|
An obstacle representation of a graph is a mapping of the vertices onto
points in the plane and a set of connected regions of the plane (called
obstacles) such that the straight-line segment connecting the points
corresponding to two vertices does not intersect any obstacles if and only if
the vertices are adjacent in the graph. The obstacle representation and its
plane variant (in which the resulting representation is a plane straight-line
embedding of the graph) have been extensively studied with the main objective
of minimizing the number of obstacles. Recently, Biedl and Mehrabi (GD 2017)
studied grid obstacle representations of graphs in which the vertices of the
graph are mapped onto the points in the plane while the straight-line segments
representing the adjacency between the vertices is replaced by the $L_1$
(Manhattan) shortest paths in the plane that avoid obstacles.
In this paper, we introduce the notion of geodesic obstacle representations
of graphs with the main goal of providing a generalized model, which comes
naturally when viewing line segments as shortest paths in the Euclidean plane.
To this end, we extend the definition of obstacle representation by allowing
some obstacles-avoiding shortest path between the corresponding points in the
underlying metric space whenever the vertices are adjacent in the graph. We
consider both general and plane variants of geodesic obstacle representations
(in a similar sense to obstacle representations) under any polyhedral distance
function in $\mathbb{R}^d$ as well as shortest path distances in graphs. Our
results generalize and unify the notions of obstacle representations, plane
obstacle representations and grid obstacle representations, leading to a number
of questions on such embeddings.
|
cs.CG
|
an obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane called obstacles such that the straightline segment connecting the points corresponding to two vertices does not intersect any obstacles if and only if the vertices are adjacent in the graph the obstacle representation and its plane variant in which the resulting representation is a plane straightline embedding of the graph have been extensively studied with the main objective of minimizing the number of obstacles recently biedl and mehrabi gd 2017 studied grid obstacle representations of graphs in which the vertices of the graph are mapped onto the points in the plane while the straightline segments representing the adjacency between the vertices is replaced by the l_1 manhattan shortest paths in the plane that avoid obstacles in this paper we introduce the notion of geodesic obstacle representations of graphs with the main goal of providing a generalized model which comes naturally when viewing line segments as shortest paths in the euclidean plane to this end we extend the definition of obstacle representation by allowing some obstaclesavoiding shortest path between the corresponding points in the underlying metric space whenever the vertices are adjacent in the graph we consider both general and plane variants of geodesic obstacle representations in a similar sense to obstacle representations under any polyhedral distance function in mathbbrd as well as shortest path distances in graphs our results generalize and unify the notions of obstacle representations plane obstacle representations and grid obstacle representations leading to a number of questions on such embeddings
|
[['an', 'obstacle', 'representation', 'of', 'a', 'graph', 'is', 'a', 'mapping', 'of', 'the', 'vertices', 'onto', 'points', 'in', 'the', 'plane', 'and', 'a', 'set', 'of', 'connected', 'regions', 'of', 'the', 'plane', 'called', 'obstacles', 'such', 'that', 'the', 'straightline', 'segment', 'connecting', 'the', 'points', 'corresponding', 'to', 'two', 'vertices', 'does', 'not', 'intersect', 'any', 'obstacles', 'if', 'and', 'only', 'if', 'the', 'vertices', 'are', 'adjacent', 'in', 'the', 'graph', 'the', 'obstacle', 'representation', 'and', 'its', 'plane', 'variant', 'in', 'which', 'the', 'resulting', 'representation', 'is', 'a', 'plane', 'straightline', 'embedding', 'of', 'the', 'graph', 'have', 'been', 'extensively', 'studied', 'with', 'the', 'main', 'objective', 'of', 'minimizing', 'the', 'number', 'of', 'obstacles', 'recently', 'biedl', 'and', 'mehrabi', 'gd', '2017', 'studied', 'grid', 'obstacle', 'representations', 'of', 'graphs', 'in', 'which', 'the', 'vertices', 'of', 'the', 'graph', 'are', 'mapped', 'onto', 'the', 'points', 'in', 'the', 'plane', 'while', 'the', 'straightline', 'segments', 'representing', 'the', 'adjacency', 'between', 'the', 'vertices', 'is', 'replaced', 'by', 'the', 'l_1', 'manhattan', 'shortest', 'paths', 'in', 'the', 'plane', 'that', 'avoid', 'obstacles', 'in', 'this', 'paper', 'we', 'introduce', 'the', 'notion', 'of', 'geodesic', 'obstacle', 'representations', 'of', 'graphs', 'with', 'the', 'main', 'goal', 'of', 'providing', 'a', 'generalized', 'model', 'which', 'comes', 'naturally', 'when', 'viewing', 'line', 'segments', 'as', 'shortest', 'paths', 'in', 'the', 'euclidean', 'plane', 'to', 'this', 'end', 'we', 'extend', 'the', 'definition', 'of', 'obstacle', 'representation', 'by', 'allowing', 'some', 'obstaclesavoiding', 'shortest', 'path', 'between', 'the', 'corresponding', 'points', 'in', 'the', 'underlying', 'metric', 'space', 'whenever', 'the', 'vertices', 'are', 'adjacent', 'in', 'the', 'graph', 'we', 'consider', 'both', 'general', 'and', 'plane', 'variants', 'of', 'geodesic', 'obstacle', 'representations', 'in', 'a', 'similar', 'sense', 'to', 'obstacle', 'representations', 'under', 'any', 'polyhedral', 'distance', 'function', 'in', 'mathbbrd', 'as', 'well', 'as', 'shortest', 'path', 'distances', 'in', 'graphs', 'our', 'results', 'generalize', 'and', 'unify', 'the', 'notions', 'of', 'obstacle', 'representations', 'plane', 'obstacle', 'representations', 'and', 'grid', 'obstacle', 'representations', 'leading', 'to', 'a', 'number', 'of', 'questions', 'on', 'such', 'embeddings']]
|
[-0.14992853769652004, 0.08120861654948494, -0.05622356461618207, 0.030195205325153032, -0.1176725391527888, -0.053065961181644854, 0.046537941413385964, 0.4025932752723639, -0.32723994768891873, -0.28048438858240843, 0.09867711071013612, -0.3439590885206612, -0.16271037868321386, 0.12043401488205488, -0.11046068767544383, 0.05162426624633893, 0.10840738291414316, 0.0694095076916656, -0.02526424643270838, -0.207574429557465, 0.3362598385420865, -0.07475875852040516, 0.21781062824849678, 0.045094025426208904, 0.12131902167083584, 0.0671222682112377, 0.004999913584524349, 0.06321578016389533, -0.11779754401086664, 0.1463800160381109, 0.26188676215277346, 0.13024011150839976, 0.22251733240268345, -0.4302568894336626, -0.19181976676038937, 0.20188722813522805, 0.16024964145139736, 0.04902118293928163, 0.012235070931909384, -0.26845440528626596, 0.09067975652817664, -0.046849932204480214, -0.12213891803603202, 0.07599931654221476, 0.0671755713758184, 0.036090637492702284, -0.203831143216786, -0.05402615850699245, 0.11188643437909282, 0.03247116895048504, -0.004226455120057034, -0.08703525942783288, -0.020776321526587274, 0.14824547730666435, -0.00031233925907525107, 0.1373717648588788, 0.05244686869807096, -0.12475121443493487, -0.1530035967619763, 0.4188758839293619, 0.021165161635101175, -0.25624103529149417, 0.1558033060004462, -0.121055851095363, -0.09862104690209754, 0.10583160929868358, 0.175935007478875, 0.13620153563110152, -0.1341673519609278, 0.13215192466989029, -0.07471351587229214, 0.06583693466338662, 0.14010267826526968, -0.014674431198483348, 0.18859876454756777, 0.1283284075029973, 0.16227758906298637, 0.17174228300503802, -0.05249743130311731, -0.09210421550504641, -0.30527693193767275, -0.13772826382230946, -0.22430681766214114, -0.02455820863081078, -0.1688049287642652, -0.20088704135668561, 0.4040343007715697, 0.1198420548731628, 0.28154073885655895, 0.08686160741142804, 0.2810295640852358, 0.06619683234417445, 0.0642399477039172, 0.15798784463854035, 0.1591406214706219, 0.12801582388034258, -0.007635718017795693, -0.13977218054429585, 0.05312443833012801, 0.16065492488638455]
|
1,803.03706
|
Electrode configuration and electrical dissipation of mechanical energy
in quartz crystal resonators
|
Mechanical resonators made with monolithic piezoelectric quartz crystals are
promising for studying new physical phenomena. High mechanical quality factors
($Q$) exhibited by the mm-sized quartz resonators make them ideal for studying
weak couplings or long timescales in the quantum regime. However, energy losses
through mechanical supports pose a serious limiting factor for obtaining high
quality factors. Here we investigate how the $Q$ of quartz resonators at deep
cryogenic temperatures can be limited by several types of losses related to
anchoring. We first introduce means to reduce the mechanical losses by more
than an order of magnitude in a no-clamping scheme, obtaining $Q$-factors of
$10^8$ of the lowest shear mode. We can exclude a wide coverage of aluminum
metallization on the disk or bond wires as sources of dissipation. However, we
find a dramatic reduction of the $Q$-factor accompanying an electrode
configuration that involves strong focusing of the vibrations in the disk
center. We propose a circuit model that accounts for the reduced mechanical
$Q$-factor in terms of electrical losses. In particular, we show how the
limiting factor for losses can be small ohmic dissipation in a grounding
connection, which can be interpreted as electrical anchor losses of the
mechanical device.
|
physics.app-ph cond-mat.mes-hall
|
mechanical resonators made with monolithic piezoelectric quartz crystals are promising for studying new physical phenomena high mechanical quality factors q exhibited by the mmsized quartz resonators make them ideal for studying weak couplings or long timescales in the quantum regime however energy losses through mechanical supports pose a serious limiting factor for obtaining high quality factors here we investigate how the q of quartz resonators at deep cryogenic temperatures can be limited by several types of losses related to anchoring we first introduce means to reduce the mechanical losses by more than an order of magnitude in a noclamping scheme obtaining qfactors of 108 of the lowest shear mode we can exclude a wide coverage of aluminum metallization on the disk or bond wires as sources of dissipation however we find a dramatic reduction of the qfactor accompanying an electrode configuration that involves strong focusing of the vibrations in the disk center we propose a circuit model that accounts for the reduced mechanical qfactor in terms of electrical losses in particular we show how the limiting factor for losses can be small ohmic dissipation in a grounding connection which can be interpreted as electrical anchor losses of the mechanical device
|
[['mechanical', 'resonators', 'made', 'with', 'monolithic', 'piezoelectric', 'quartz', 'crystals', 'are', 'promising', 'for', 'studying', 'new', 'physical', 'phenomena', 'high', 'mechanical', 'quality', 'factors', 'q', 'exhibited', 'by', 'the', 'mmsized', 'quartz', 'resonators', 'make', 'them', 'ideal', 'for', 'studying', 'weak', 'couplings', 'or', 'long', 'timescales', 'in', 'the', 'quantum', 'regime', 'however', 'energy', 'losses', 'through', 'mechanical', 'supports', 'pose', 'a', 'serious', 'limiting', 'factor', 'for', 'obtaining', 'high', 'quality', 'factors', 'here', 'we', 'investigate', 'how', 'the', 'q', 'of', 'quartz', 'resonators', 'at', 'deep', 'cryogenic', 'temperatures', 'can', 'be', 'limited', 'by', 'several', 'types', 'of', 'losses', 'related', 'to', 'anchoring', 'we', 'first', 'introduce', 'means', 'to', 'reduce', 'the', 'mechanical', 'losses', 'by', 'more', 'than', 'an', 'order', 'of', 'magnitude', 'in', 'a', 'noclamping', 'scheme', 'obtaining', 'qfactors', 'of', '108', 'of', 'the', 'lowest', 'shear', 'mode', 'we', 'can', 'exclude', 'a', 'wide', 'coverage', 'of', 'aluminum', 'metallization', 'on', 'the', 'disk', 'or', 'bond', 'wires', 'as', 'sources', 'of', 'dissipation', 'however', 'we', 'find', 'a', 'dramatic', 'reduction', 'of', 'the', 'qfactor', 'accompanying', 'an', 'electrode', 'configuration', 'that', 'involves', 'strong', 'focusing', 'of', 'the', 'vibrations', 'in', 'the', 'disk', 'center', 'we', 'propose', 'a', 'circuit', 'model', 'that', 'accounts', 'for', 'the', 'reduced', 'mechanical', 'qfactor', 'in', 'terms', 'of', 'electrical', 'losses', 'in', 'particular', 'we', 'show', 'how', 'the', 'limiting', 'factor', 'for', 'losses', 'can', 'be', 'small', 'ohmic', 'dissipation', 'in', 'a', 'grounding', 'connection', 'which', 'can', 'be', 'interpreted', 'as', 'electrical', 'anchor', 'losses', 'of', 'the', 'mechanical', 'device']]
|
[-0.15508761359557122, 0.152112293802582, 0.0010633349334399904, -0.015809840252728264, -0.05523538366708923, -0.14440861713122483, 0.07444934306160814, 0.4200179853556144, -0.23640627001444972, -0.3196349239688198, 0.050036950948315874, -0.24078903889199296, -0.11255982274835433, 0.25204844961537226, -0.07585729404829966, 0.06534935916357454, 0.04545214930701364, -0.057746881674378456, -0.04824525037728924, -0.17474720453265494, 0.255397091805774, 0.09472858361901608, 0.3057414176873863, 0.08023649192972099, 0.10310860774327706, -0.054478758947231136, 0.07365812577456984, 0.03221971590403028, -0.13152111392626456, 0.09888525151217066, 0.24792666745666958, -0.01597026047582303, 0.2888341080537768, -0.4840452599353227, -0.2433292429575968, 0.06745610577311723, 0.12041664612011507, 0.11699145298331845, -0.021887192901369562, -0.20283090226801495, 0.07194482839324666, -0.18105930024503505, -0.12466539976645692, -0.10652240053820775, 0.0014152033213554092, 0.016616390345281166, -0.23848214684681376, 0.07997611633691487, 0.05706966545283046, 0.05853730929201122, -0.0545987121681285, -0.08867771729321486, 0.00797843835527199, 0.09731005795122166, 0.005438925931815189, -0.04722659088099076, 0.222008403762707, -0.17455290886222494, -0.1023796430751494, 0.4032874859532519, -0.0662835605753891, -0.1478560133322362, 0.17890158552096116, -0.14496031436272405, -0.03135284664221669, 0.1554963242323442, 0.18430465338172522, 0.044738574451199456, -0.1637360707636754, 0.0015000967104420834, 0.05197988418235102, 0.1949696264583056, 0.13067448024764358, 0.08577988734386917, 0.22145927753112274, 0.21524618479338983, 0.013111145394718526, 0.20598957136135324, -0.07820196552263531, 0.03130318120650798, -0.2720166184944124, -0.16381288949755868, -0.15660850264072937, 0.11152786569641762, -0.1224303802729224, -0.17263586558114935, 0.3565269456118023, 0.11645894563153161, 0.19209914071071219, -0.021368531039307578, 0.2947136814794948, 0.1284323411855622, 0.11718374272415312, 0.025006417929190186, 0.33876540786563303, 0.12030121548705028, 0.05602368889797722, -0.25195302139328857, 0.050475173791280796, -0.02042532001561181]
|
1,803.03707
|
Quasi-Equilibrium Problems with Non-self Constraint Map
|
In 2016 Aussel, Sultana and Vetrivel developed the concept of projected
solution for quasi-variational inequality problems and projected Nash
equilibrium. We introduce a new concept of solution for quasi-equilibrium
problems and we study the existence of such solutions. Additionally, as a
consequence of our results, we give existence results of projected solutions
for quasi-optimization problems, quasi-variational inequalities problems and
generalized Nash equilibrium problems.
|
math.OC
|
in 2016 aussel sultana and vetrivel developed the concept of projected solution for quasivariational inequality problems and projected nash equilibrium we introduce a new concept of solution for quasiequilibrium problems and we study the existence of such solutions additionally as a consequence of our results we give existence results of projected solutions for quasioptimization problems quasivariational inequalities problems and generalized nash equilibrium problems
|
[['in', '2016', 'aussel', 'sultana', 'and', 'vetrivel', 'developed', 'the', 'concept', 'of', 'projected', 'solution', 'for', 'quasivariational', 'inequality', 'problems', 'and', 'projected', 'nash', 'equilibrium', 'we', 'introduce', 'a', 'new', 'concept', 'of', 'solution', 'for', 'quasiequilibrium', 'problems', 'and', 'we', 'study', 'the', 'existence', 'of', 'such', 'solutions', 'additionally', 'as', 'a', 'consequence', 'of', 'our', 'results', 'we', 'give', 'existence', 'results', 'of', 'projected', 'solutions', 'for', 'quasioptimization', 'problems', 'quasivariational', 'inequalities', 'problems', 'and', 'generalized', 'nash', 'equilibrium', 'problems']]
|
[-0.10441770707257092, -0.05637624128721654, -0.12679901206865907, 0.10505316344400246, -0.04512504246085882, -0.1480731516610831, 0.06161915850243531, 0.25304934810847046, -0.3206684383874138, -0.2851499600956837, 0.18096206444121588, -0.270893138848866, -0.18315866276000936, 0.1810652663310369, -0.063345854007639, 0.1411103437965115, 0.11953046748725077, -0.09314097911119461, -0.11465904955208922, -0.21432283795050655, 0.3786341049397985, -0.059119466360425574, 0.22091902481236805, 0.12182266619056463, 0.1725236970698461, -0.03356235533331831, 0.07440059199774017, 0.1370953875904282, -0.24111106661148368, 0.12929564584046602, 0.30475018098950385, 0.24904050004358094, 0.36126688805719215, -0.3853910741706689, -0.13736591495107858, 0.15734310682552557, 0.09012450883941105, 0.12510988731519318, -0.09755497816950083, -0.30160105377435686, 0.06946634869479264, -0.14738314508770903, -0.25501069009381655, -0.11237454663108414, -0.009336748532950878, 0.09386753082508222, -0.3094474088245382, 0.1575587513158098, 0.07172403890096272, 0.010537265584571288, -0.18978476567038646, -0.11807269998826087, 0.07088695393952851, 0.027219504459450643, 0.027416085219010712, -0.050077864764413484, 0.05423771160809944, -0.10048342452694972, -0.22123120386774342, 0.3540668181454142, -0.06057729061382512, -0.22787414345269402, 0.19314095294103026, -0.00012261826971856257, -0.16037752277140196, 0.027465079383303722, 0.21542009709713358, 0.24124707930410902, -0.12769241978724796, 0.06468971630480762, -0.1394757225178182, 0.0870678825614353, 0.07428670430866381, 0.030979486073677738, 0.12617206275463105, 0.11568662188947201, 0.2629847848632683, 0.20221576483454556, -0.017359965216989317, -0.17724588685669004, -0.31155381140609584, -0.1796194743985931, -0.13888308006959657, 0.050773284925768776, -0.1137147674249718, -0.1798813598851363, 0.3589095869256804, 0.10536954253911972, 0.09570541298016906, 0.10352563932538032, 0.1750371494020025, 0.13927409757937614, -0.08193323730374687, 0.10122839932640394, 0.24775896075492104, 0.1824637894751504, 0.15259710978716612, -0.18897333606146277, 0.013543561558860044, 0.15738609549589455]
|
1,803.03708
|
Computational Complexity of Generalized Push Fight
|
We analyze the computational complexity of optimally playing the two-player
board game Push Fight, generalized to an arbitrary board and number of pieces.
We prove that the game is PSPACE-hard to decide who will win from a given
position, even for simple (almost rectangular) hole-free boards. We also
analyze the mate-in-1 problem: can the player win in a single turn? One turn in
Push Fight consists of up to two "moves" followed by a mandatory "push". With
these rules, or generalizing the number of allowed moves to any constant, we
show mate-in-1 can be solved in polynomial time. If, however, the number of
moves per turn is part of the input, the problem becomes NP-complete. On the
other hand, without any limit on the number of moves per turn, the problem
becomes polynomially solvable again.
|
cs.CC
|
we analyze the computational complexity of optimally playing the twoplayer board game push fight generalized to an arbitrary board and number of pieces we prove that the game is pspacehard to decide who will win from a given position even for simple almost rectangular holefree boards we also analyze the matein1 problem can the player win in a single turn one turn in push fight consists of up to two moves followed by a mandatory push with these rules or generalizing the number of allowed moves to any constant we show matein1 can be solved in polynomial time if however the number of moves per turn is part of the input the problem becomes npcomplete on the other hand without any limit on the number of moves per turn the problem becomes polynomially solvable again
|
[['we', 'analyze', 'the', 'computational', 'complexity', 'of', 'optimally', 'playing', 'the', 'twoplayer', 'board', 'game', 'push', 'fight', 'generalized', 'to', 'an', 'arbitrary', 'board', 'and', 'number', 'of', 'pieces', 'we', 'prove', 'that', 'the', 'game', 'is', 'pspacehard', 'to', 'decide', 'who', 'will', 'win', 'from', 'a', 'given', 'position', 'even', 'for', 'simple', 'almost', 'rectangular', 'holefree', 'boards', 'we', 'also', 'analyze', 'the', 'matein1', 'problem', 'can', 'the', 'player', 'win', 'in', 'a', 'single', 'turn', 'one', 'turn', 'in', 'push', 'fight', 'consists', 'of', 'up', 'to', 'two', 'moves', 'followed', 'by', 'a', 'mandatory', 'push', 'with', 'these', 'rules', 'or', 'generalizing', 'the', 'number', 'of', 'allowed', 'moves', 'to', 'any', 'constant', 'we', 'show', 'matein1', 'can', 'be', 'solved', 'in', 'polynomial', 'time', 'if', 'however', 'the', 'number', 'of', 'moves', 'per', 'turn', 'is', 'part', 'of', 'the', 'input', 'the', 'problem', 'becomes', 'npcomplete', 'on', 'the', 'other', 'hand', 'without', 'any', 'limit', 'on', 'the', 'number', 'of', 'moves', 'per', 'turn', 'the', 'problem', 'becomes', 'polynomially', 'solvable', 'again']]
|
[-0.13138292894733172, 0.14384301485314843, -0.06721928893347029, 0.050163287001972395, -0.11114531118008826, -0.23070162450204845, 0.1131625867759188, 0.3422174642207446, -0.31018731603571387, -0.3278927886233389, 0.11075701485991615, -0.2856449790779691, -0.09028977556326599, 0.17952787097095063, -0.11579233059935548, -0.02344956654296429, 0.08105207714252174, 0.11717461317915608, 0.02649594865463398, -0.3385860487499654, 0.26928515116925594, 0.0031071817454950954, 0.19061590353440908, 0.023745686005525016, 0.09148169646936434, 0.053009547169009845, -0.002060055649942822, 0.07940021538762031, -0.11207452243634854, 0.05689209155755601, 0.23234770724429163, 0.14763367191362367, 0.36179675716492865, -0.4644067398617389, -0.08682933346264893, 0.19962505126820393, 0.15472920632886666, 0.11296151702602704, 0.015278984647658136, -0.22086789971217513, 0.07957834177822978, -0.13281512431524417, -0.14033654988225963, 0.0023293228681992603, 0.017508140420196234, -0.019173538668460593, -0.25282609713850196, -0.07374959361278106, 0.04887930540436948, -0.035695355084937076, -0.011744589168854333, -0.09615859719062293, -0.007979919840754182, 0.20252663821361408, -0.007516558361412198, 0.04975574023469731, 0.11396621459948451, -0.15462741941489555, -0.1423166661678503, 0.38872996712517405, -0.010399572592642571, -0.20171550284657214, 0.12410812287556905, -0.10908035845323294, -0.1367586535367149, 0.11848633102382775, 0.13683443766225267, 0.12804722810095107, -0.05812446152515433, 0.08576350831728498, -0.09190053629378478, 0.2236790509135635, 0.13367984981310588, -0.024767430591034808, 0.15041291833061862, 0.14596375038640366, 0.17736066944414267, 0.1961395095477605, -0.026399785149152633, -0.12475103375122502, -0.2479366670811066, -0.15073885650167035, -0.13963441712160904, 0.0465343007300463, -0.06489617765904836, -0.14663200568821694, 0.3517629492251823, 0.14789120914862938, 0.1660897716123145, 0.10636887100042293, 0.28326404530692983, 0.1316571826874106, 0.05016121153926684, 0.09269712075108179, 0.18055574570575522, 0.04890405374441158, 0.07521570260739989, -0.19309767868749245, 0.08995345283679113, 0.10328710218546568]
|
1,803.03709
|
Nonadiabatic corrections to electric current in molecular junction due
to nuclear motion at the molecule-electrode interfaces
|
We present quantum electron transport theory that incorporates dynamical
effects of motion of atoms on electrode-molecule interfaces in the calculations
of the electric current. The theory is based on non-equilibrium Green's
functions. We separate time scales in the Green's functions on fast relative
time and slow central time. The derivative with respect to the central time
serves as a small parameter in the theory. We solve the real-time Kadanoff-Baym
equations for molecular Green's functions using Wigner representation and keep
terms up to the second order with respect to the central time derivatives.
Molecular Green's functions and consequently the electric current are expressed
as functions of molecular junction coordinates as well as velocities and
accelerations of molecule-electrode interface nuclei. We apply the theory to
model a molecular system and study the effects of non-adiabatic nuclear motion
on molecular junction conductivity.
|
cond-mat.mes-hall physics.chem-ph
|
we present quantum electron transport theory that incorporates dynamical effects of motion of atoms on electrodemolecule interfaces in the calculations of the electric current the theory is based on nonequilibrium greens functions we separate time scales in the greens functions on fast relative time and slow central time the derivative with respect to the central time serves as a small parameter in the theory we solve the realtime kadanoffbaym equations for molecular greens functions using wigner representation and keep terms up to the second order with respect to the central time derivatives molecular greens functions and consequently the electric current are expressed as functions of molecular junction coordinates as well as velocities and accelerations of moleculeelectrode interface nuclei we apply the theory to model a molecular system and study the effects of nonadiabatic nuclear motion on molecular junction conductivity
|
[['we', 'present', 'quantum', 'electron', 'transport', 'theory', 'that', 'incorporates', 'dynamical', 'effects', 'of', 'motion', 'of', 'atoms', 'on', 'electrodemolecule', 'interfaces', 'in', 'the', 'calculations', 'of', 'the', 'electric', 'current', 'the', 'theory', 'is', 'based', 'on', 'nonequilibrium', 'greens', 'functions', 'we', 'separate', 'time', 'scales', 'in', 'the', 'greens', 'functions', 'on', 'fast', 'relative', 'time', 'and', 'slow', 'central', 'time', 'the', 'derivative', 'with', 'respect', 'to', 'the', 'central', 'time', 'serves', 'as', 'a', 'small', 'parameter', 'in', 'the', 'theory', 'we', 'solve', 'the', 'realtime', 'kadanoffbaym', 'equations', 'for', 'molecular', 'greens', 'functions', 'using', 'wigner', 'representation', 'and', 'keep', 'terms', 'up', 'to', 'the', 'second', 'order', 'with', 'respect', 'to', 'the', 'central', 'time', 'derivatives', 'molecular', 'greens', 'functions', 'and', 'consequently', 'the', 'electric', 'current', 'are', 'expressed', 'as', 'functions', 'of', 'molecular', 'junction', 'coordinates', 'as', 'well', 'as', 'velocities', 'and', 'accelerations', 'of', 'moleculeelectrode', 'interface', 'nuclei', 'we', 'apply', 'the', 'theory', 'to', 'model', 'a', 'molecular', 'system', 'and', 'study', 'the', 'effects', 'of', 'nonadiabatic', 'nuclear', 'motion', 'on', 'molecular', 'junction', 'conductivity']]
|
[-0.146109952028546, 0.10345313131722132, -0.09226753505318687, 0.052614191303317764, -0.004080920690618683, -0.05169447415035969, 0.0340851167545205, 0.3630539481092593, -0.2699516082195927, -0.25451950739697293, 0.02907210749677858, -0.2560450684299304, -0.10415689884383472, 0.1725640785679382, 0.04354606129450174, 0.07311721094180461, -0.013633493479783479, -0.0017217639247424526, -0.09623321968385373, -0.14270516545277276, 0.287824971231183, 0.042447170426084146, 0.23193358058418087, 0.08970642830211696, 0.1171260094796701, 0.027331790727690507, 0.007690375729417094, 0.020031167844163, -0.10972037200386538, 0.08270229151130741, 0.21870109614942945, 0.009322713859540095, 0.23828073761178006, -0.5271935371427442, -0.18673161562471885, 0.0008454060972594529, 0.12149725026926762, 0.1375499115519815, -0.011754991088008924, -0.25699133945883607, 0.007624839951800143, -0.16470375840666054, -0.1678655840014275, -0.11704275236974249, 0.02330641937944636, 0.1037950821927742, -0.2234800560734898, 0.14841672878297005, -0.04301695985104612, 0.022934204303664104, -0.09452374545244245, -0.10067956604686626, -0.007404380523190974, 0.11821959044100891, 0.015726531332311815, 0.07969288515905254, 0.2172254803280594, -0.13717478357268859, -0.1006492394987467, 0.4050629548393458, -0.08812665859264114, -0.23280570406145115, 0.20857210475582924, -0.1934577782015256, -0.09902476817168457, 0.08442469505097107, 0.18783002694492504, 0.17044656754558463, -0.176888927954698, 0.10919579624980622, 0.022738712954522518, 0.1672289879898802, 0.04781258291156172, 0.05127564276963901, 0.17845941179519076, 0.12000738085656286, 0.037013599300663245, 0.11815033057409761, -0.0958150743805006, -0.17445525027168313, -0.3168723412903307, -0.17426184520356544, -0.18797772559973833, 0.04298723480335886, -0.0806883508133285, -0.19546884564321032, 0.42001780629720836, 0.15003951676792915, 0.16018877303723594, 0.051529996231091106, 0.316441023226479, 0.20716323728150549, 0.07126477181705439, 0.04999573412183806, 0.1795860595009524, 0.18296823241218602, 0.09496150274590166, -0.30350336008190126, 0.05632193325080728, 0.1115739906287129]
|
1,803.0371
|
Label-free imaging of cholesterol and lipid distributions in model
membranes
|
Over recent decades, lipid membranes have become standard models for
examining the biophysics and biochemistry of cell membranes. Interrogation of
lipid domains within biomembranes is generally done with fluorescence
microscopy via exogenous chemical probes. However, most fluorophores have
limited partitioning tunability, with the majority segregating in the least
biologically relevant domains (i.e., low-density liquid domains). Therefore, a
molecular-level picture of the majority of non-labeled lipids forming the
membrane is still elusive. Here, we present simple, label-free imaging of
domain formation in lipid monolayers, with chemical selectivity in unraveling
lipid and cholesterol composition in all domain types. Exploiting conventional
vibrational contrast in spontaneous Raman imaging, combined with chemometrics
analysis, allows for examination of ternary systems containing saturated
lipids, unsaturated lipids, and cholesterol. We confirm features commonly
observed by fluorescence microscopy, and provide an unprecedented analysis of
cholesterol distribution at the single-membrane level.
|
physics.bio-ph cond-mat.soft
|
over recent decades lipid membranes have become standard models for examining the biophysics and biochemistry of cell membranes interrogation of lipid domains within biomembranes is generally done with fluorescence microscopy via exogenous chemical probes however most fluorophores have limited partitioning tunability with the majority segregating in the least biologically relevant domains ie lowdensity liquid domains therefore a molecularlevel picture of the majority of nonlabeled lipids forming the membrane is still elusive here we present simple labelfree imaging of domain formation in lipid monolayers with chemical selectivity in unraveling lipid and cholesterol composition in all domain types exploiting conventional vibrational contrast in spontaneous raman imaging combined with chemometrics analysis allows for examination of ternary systems containing saturated lipids unsaturated lipids and cholesterol we confirm features commonly observed by fluorescence microscopy and provide an unprecedented analysis of cholesterol distribution at the singlemembrane level
|
[['over', 'recent', 'decades', 'lipid', 'membranes', 'have', 'become', 'standard', 'models', 'for', 'examining', 'the', 'biophysics', 'and', 'biochemistry', 'of', 'cell', 'membranes', 'interrogation', 'of', 'lipid', 'domains', 'within', 'biomembranes', 'is', 'generally', 'done', 'with', 'fluorescence', 'microscopy', 'via', 'exogenous', 'chemical', 'probes', 'however', 'most', 'fluorophores', 'have', 'limited', 'partitioning', 'tunability', 'with', 'the', 'majority', 'segregating', 'in', 'the', 'least', 'biologically', 'relevant', 'domains', 'ie', 'lowdensity', 'liquid', 'domains', 'therefore', 'a', 'molecularlevel', 'picture', 'of', 'the', 'majority', 'of', 'nonlabeled', 'lipids', 'forming', 'the', 'membrane', 'is', 'still', 'elusive', 'here', 'we', 'present', 'simple', 'labelfree', 'imaging', 'of', 'domain', 'formation', 'in', 'lipid', 'monolayers', 'with', 'chemical', 'selectivity', 'in', 'unraveling', 'lipid', 'and', 'cholesterol', 'composition', 'in', 'all', 'domain', 'types', 'exploiting', 'conventional', 'vibrational', 'contrast', 'in', 'spontaneous', 'raman', 'imaging', 'combined', 'with', 'chemometrics', 'analysis', 'allows', 'for', 'examination', 'of', 'ternary', 'systems', 'containing', 'saturated', 'lipids', 'unsaturated', 'lipids', 'and', 'cholesterol', 'we', 'confirm', 'features', 'commonly', 'observed', 'by', 'fluorescence', 'microscopy', 'and', 'provide', 'an', 'unprecedented', 'analysis', 'of', 'cholesterol', 'distribution', 'at', 'the', 'singlemembrane', 'level']]
|
[-0.06617121997864005, 0.1556211185736742, -0.0008273435763169265, -0.035985346369986945, 0.02145154816626921, -0.15111127183673548, 0.04582994765228863, 0.4320227563486877, -0.22809365242868265, -0.27007561510574096, 0.029869735860992355, -0.2829586553424704, -0.18414675540964495, 0.15314569420607246, -0.032273576238212434, 0.024966862129463637, 0.03544126644875881, -0.09049406217255114, 0.05269468713102611, -0.1563330295079566, 0.19655489788641692, 0.005101734871401432, 0.33424124133885436, 0.09754730347818068, 0.06701793398126854, 0.005818864864013191, 0.011923927615614647, -0.004262348810369347, -0.18346307863289793, 0.16436586556964428, 0.3187269880150741, 0.019801789983869233, 0.2319904844547417, -0.49949648680416403, -0.3325549180979398, 0.07474258074418028, 0.1978485779044159, 0.13577814127734683, -0.07939871295077845, -0.23474294471666746, 0.04951850100955431, -0.10560266536013191, -0.06447333582604291, -0.10136019394250838, -0.011991328880164428, 0.06166381016271719, -0.18908484577340015, 0.1924237210356386, -0.0006941593407342831, 0.19102948586991492, -0.16409004555151513, -0.122741210442829, -0.027802013970435933, 0.12187100080641132, 0.020976320090736692, -0.03168594125713592, 0.27119129846542944, -0.17208116807056761, -0.10909717697782297, 0.36908508575660115, -0.01740996098535545, -0.14743011207022566, 0.2710480987365153, -0.19368781656991188, -0.14930075113430408, 0.19089871302167785, 0.09390190585113067, 0.12473953662585494, -0.19781725623823226, 0.03284347842361593, -0.0040502487153396115, 0.25791936899792955, 0.17190482592456213, 0.052847286005973396, 0.25154002758522404, 0.3032826500290886, -0.025877820747303413, 0.13387739105176524, -0.107490925375927, -0.09009455126571528, -0.12736703340849237, -0.18302272375943865, -0.13290493052324004, 0.004195604478306276, -0.05144658001389103, -0.1959765926003456, 0.33325188828249136, 0.06865410423500741, 0.15161331725828614, -0.018659366555644055, 0.2597543308973735, -0.05128646886359293, 0.11846505907192456, -0.08883146090921781, 0.16332827035605194, 0.1608726974256363, 0.10742120474745381, -0.25079723335934656, 0.1269118068681977, -0.04390394886054019]
|
1,803.03711
|
Local Kernels that Approximate Bayesian Regularization and Proximal
Operators
|
In this work, we broadly connect kernel-based filtering (e.g. approaches such
as the bilateral filters and nonlocal means, but also many more) with general
variational formulations of Bayesian regularized least squares, and the related
concept of proximal operators. The latter set of variational/Bayesian/proximal
formulations often result in optimization problems that do not have closed-form
solutions, and therefore typically require global iterative solutions. Our main
contribution here is to establish how one can approximate the solution of the
resulting global optimization problems with use of locally adaptive filters
with specific kernels. Our results are valid for small regularization strength
but the approach is powerful enough to be useful for a wide range of
applications because we expose how to derive a "kernelized" solution to these
problems that approximates the global solution in one-shot, using only local
operations. As another side benefit in the reverse direction, given a local
data-adaptive filter constructed with a particular choice of kernel, we enable
the interpretation of such filters in the variational/Bayesian/proximal
framework.
|
cs.CV
|
in this work we broadly connect kernelbased filtering eg approaches such as the bilateral filters and nonlocal means but also many more with general variational formulations of bayesian regularized least squares and the related concept of proximal operators the latter set of variationalbayesianproximal formulations often result in optimization problems that do not have closedform solutions and therefore typically require global iterative solutions our main contribution here is to establish how one can approximate the solution of the resulting global optimization problems with use of locally adaptive filters with specific kernels our results are valid for small regularization strength but the approach is powerful enough to be useful for a wide range of applications because we expose how to derive a kernelized solution to these problems that approximates the global solution in oneshot using only local operations as another side benefit in the reverse direction given a local dataadaptive filter constructed with a particular choice of kernel we enable the interpretation of such filters in the variationalbayesianproximal framework
|
[['in', 'this', 'work', 'we', 'broadly', 'connect', 'kernelbased', 'filtering', 'eg', 'approaches', 'such', 'as', 'the', 'bilateral', 'filters', 'and', 'nonlocal', 'means', 'but', 'also', 'many', 'more', 'with', 'general', 'variational', 'formulations', 'of', 'bayesian', 'regularized', 'least', 'squares', 'and', 'the', 'related', 'concept', 'of', 'proximal', 'operators', 'the', 'latter', 'set', 'of', 'variationalbayesianproximal', 'formulations', 'often', 'result', 'in', 'optimization', 'problems', 'that', 'do', 'not', 'have', 'closedform', 'solutions', 'and', 'therefore', 'typically', 'require', 'global', 'iterative', 'solutions', 'our', 'main', 'contribution', 'here', 'is', 'to', 'establish', 'how', 'one', 'can', 'approximate', 'the', 'solution', 'of', 'the', 'resulting', 'global', 'optimization', 'problems', 'with', 'use', 'of', 'locally', 'adaptive', 'filters', 'with', 'specific', 'kernels', 'our', 'results', 'are', 'valid', 'for', 'small', 'regularization', 'strength', 'but', 'the', 'approach', 'is', 'powerful', 'enough', 'to', 'be', 'useful', 'for', 'a', 'wide', 'range', 'of', 'applications', 'because', 'we', 'expose', 'how', 'to', 'derive', 'a', 'kernelized', 'solution', 'to', 'these', 'problems', 'that', 'approximates', 'the', 'global', 'solution', 'in', 'oneshot', 'using', 'only', 'local', 'operations', 'as', 'another', 'side', 'benefit', 'in', 'the', 'reverse', 'direction', 'given', 'a', 'local', 'dataadaptive', 'filter', 'constructed', 'with', 'a', 'particular', 'choice', 'of', 'kernel', 'we', 'enable', 'the', 'interpretation', 'of', 'such', 'filters', 'in', 'the', 'variationalbayesianproximal', 'framework']]
|
[-0.028720232267391333, -0.019353226467854145, -0.10548395568674261, 0.08786791030275212, -0.12708098622688063, -0.17179077353882322, 0.02385294380964655, 0.4108518024737185, -0.32989576984563784, -0.29571139890361914, 0.16493424707670892, -0.22547307447671439, -0.21188275784705624, 0.2024629004885245, -0.08841836298674796, 0.07378159120421376, 0.07972284222416806, -0.0004987686025825414, -0.10777534899261258, -0.22755647324815845, 0.29803605798956456, 0.02763816009303837, 0.25395777602821135, 0.026819747725896764, 0.11443068660711023, 0.02111099680151903, -0.029138327785062066, 0.06564284704597384, -0.09594166392264676, 0.16118130885685483, 0.2977288769628627, 0.16847183590924197, 0.34865921571512115, -0.4309685932980342, -0.2165014656147722, 0.12631696062162517, 0.15950349181013845, 0.11452429759400812, -0.03639421563385633, -0.22720069298802903, 0.08152104149092779, -0.1490275542223544, -0.10554525246279257, -0.1378124385063226, -0.054002640411878626, 0.056075532438064166, -0.3264401657055273, 0.06976734033034353, 0.06247461759732246, -0.005249184230342508, -0.0533473230164611, -0.12490781806338805, 0.041535490243977895, 0.0962920783158166, 0.04909158535936678, 0.009805613216436044, 0.09411797095372369, -0.12670833921821958, -0.11796672374264083, 0.3368535328091997, -0.0463116509268399, -0.27071758612821045, 0.22080158913564502, -0.06033263582397591, -0.15008987254942907, 0.08776951009464083, 0.17641627488897718, 0.18613029077620893, -0.16838416290102584, 0.061477305806792254, -0.04751345218603753, 0.1510281828909435, 0.03215550979260694, 0.06604266695177295, 0.1397901546576935, 0.12839494279980884, 0.16940003005597232, 0.11677564440760761, -0.053198728237343444, -0.11411816825116561, -0.3076961091352683, -0.11920058523361204, -0.17513774432185472, -0.009928380871442091, -0.10750974790858119, -0.20147142019405057, 0.38158715537777455, 0.19485275494790227, 0.17862840346201803, 0.07122292827081048, 0.2883022121633544, 0.1505266766731493, 0.09713112324984237, 0.0966951890030142, 0.23153312225741418, 0.10567474709682619, 0.0927331940355626, -0.15858989074776852, 0.05408275025600398, 0.10168628614170082]
|
1,803.03712
|
Response to the authors of 'On the (un)effectiveness of Proton Boron
Capture in Proton Therapy'
|
This manuscript provides a response to a recent report by Mazzone et al.
available online on arXiv that, in turn, tentatively aims at demonstrating the
inefficacy of proton boron capture in hadrotherapy. We clarify that Mazzone et
al. do not add any scientific or technical insights to the points extensively
discussed in the original manuscript by Cirrone et al., and/or in the series of
iterations had with the Referee, which ultimately lead to the publication of
our original and pioneering experimental work. Here we summarize some of the
key points of the long scientific debate we had during the review process of
paper by Cirrone et al., which are very similar to the considerations presented
by Mazzone et al.. In conclusion, no quantitative explanation of our robust
experimental achievements presented in Cirrone et al. is provided in Mazzone et
al.
|
physics.med-ph
|
this manuscript provides a response to a recent report by mazzone et al available online on arxiv that in turn tentatively aims at demonstrating the inefficacy of proton boron capture in hadrotherapy we clarify that mazzone et al do not add any scientific or technical insights to the points extensively discussed in the original manuscript by cirrone et al andor in the series of iterations had with the referee which ultimately lead to the publication of our original and pioneering experimental work here we summarize some of the key points of the long scientific debate we had during the review process of paper by cirrone et al which are very similar to the considerations presented by mazzone et al in conclusion no quantitative explanation of our robust experimental achievements presented in cirrone et al is provided in mazzone et al
|
[['this', 'manuscript', 'provides', 'a', 'response', 'to', 'a', 'recent', 'report', 'by', 'mazzone', 'et', 'al', 'available', 'online', 'on', 'arxiv', 'that', 'in', 'turn', 'tentatively', 'aims', 'at', 'demonstrating', 'the', 'inefficacy', 'of', 'proton', 'boron', 'capture', 'in', 'hadrotherapy', 'we', 'clarify', 'that', 'mazzone', 'et', 'al', 'do', 'not', 'add', 'any', 'scientific', 'or', 'technical', 'insights', 'to', 'the', 'points', 'extensively', 'discussed', 'in', 'the', 'original', 'manuscript', 'by', 'cirrone', 'et', 'al', 'andor', 'in', 'the', 'series', 'of', 'iterations', 'had', 'with', 'the', 'referee', 'which', 'ultimately', 'lead', 'to', 'the', 'publication', 'of', 'our', 'original', 'and', 'pioneering', 'experimental', 'work', 'here', 'we', 'summarize', 'some', 'of', 'the', 'key', 'points', 'of', 'the', 'long', 'scientific', 'debate', 'we', 'had', 'during', 'the', 'review', 'process', 'of', 'paper', 'by', 'cirrone', 'et', 'al', 'which', 'are', 'very', 'similar', 'to', 'the', 'considerations', 'presented', 'by', 'mazzone', 'et', 'al', 'in', 'conclusion', 'no', 'quantitative', 'explanation', 'of', 'our', 'robust', 'experimental', 'achievements', 'presented', 'in', 'cirrone', 'et', 'al', 'is', 'provided', 'in', 'mazzone', 'et', 'al']]
|
[-0.03500023244824863, 0.05815954135878266, -0.07632779599361711, -0.035786258011049545, -0.11297018453478813, -0.05043165666690237, 0.0894047908372708, 0.3401594650563147, -0.16580463108680338, -0.38861855087306, 0.037815995481729564, -0.2737338875685048, -0.21771626653679038, 0.18452311626873347, -0.18628676293967225, 0.05674570491671455, 0.05382935509166057, -0.08479481646724099, 0.0011111142368410989, -0.37299511498577304, 0.2581020040712286, 0.19515771922829608, 0.27232005449494334, 0.0739048091667912, 0.03553183687006613, 0.005279648886564717, -0.1367988428067443, -0.004210206666599503, -0.19847812947263127, 0.09591019663477329, 0.24477166702247244, 0.13721048026580177, 0.29319445678307643, -0.44031377518616566, -0.21307158764290937, 0.02700861293333415, 0.0989765866283535, 0.143423281318555, -0.08053191483486444, -0.301504580773038, 0.059775408734265956, -0.160352558031571, -0.09630282354547823, -0.0623125406652153, 0.08743381100244445, 0.01943397087467124, -0.22887317093906642, 0.07148440329528837, 0.1285213973714883, 0.05299744022199415, -0.01925422902815312, -0.16414578691821732, 0.02248537357186349, 0.04309832571885086, 0.019153254694370687, 0.07686253656505895, 0.03442184528228726, -0.03255885145157951, -0.14917247583620624, 0.3213543679645593, 0.0015511376140036172, -0.06762956324026739, 0.21068934026247949, -0.10371479543810375, -0.19440835305295295, 0.051320472269875114, 0.1285145904151924, 0.08018143978907907, -0.15843295224225348, 0.09929548872411988, -0.10313591284412729, 0.13277421965726094, 0.08737779175192653, -0.0002322879581370478, 0.15552037175771571, 0.12532542941989436, -0.05025634580131004, 0.07421515580005408, -0.015060444684069363, -0.07563207776699443, -0.27770401126028393, -0.15081969327661846, -0.1796585374659182, 0.024473199319440316, 0.08289249968497675, -0.10563583777909227, 0.3881311110813814, 0.21728179863111363, 0.24662873017929976, -0.05204395450050306, 0.23806642511819334, 0.022667917340873277, -0.016096336992370407, 0.10592270888749966, 0.31609303550229395, 0.07805971854882275, 0.17810063986040706, -0.17303498159330205, 0.113363927481495, 0.05867152021219619]
|
1,803.03713
|
Current fluctuations in quantum absorption refrigerators
|
Absorption refrigerators transfer thermal energy from a cold bath to a hot
bath without input power by utilizing heat from an additional "work" reservoir.
Particularly interesting is a three-level design for a quantum absorption
refrigerator, which can be optimized to reach the maximal (Carnot) cooling
efficiency. Previous studies of three-level chillers focused on the behavior of
the averaged cooling current. Here, we go beyond that and study the full
counting statistics of heat exchange in a three-level chiller model. We explain
how to obtain the complete cumulant generating function of the refrigerator in
steady state, then derive a partial cumulant generating function, which yields
closed-form expressions for both the averaged cooling current and its noise.
Our analytical results and simulations are beneficial for the design of
nanoscale engines and cooling systems far from equilibrium, with their
performance optimized according to different criteria, efficiency, power,
fluctuations and dissipation.
|
cond-mat.mes-hall cond-mat.stat-mech
|
absorption refrigerators transfer thermal energy from a cold bath to a hot bath without input power by utilizing heat from an additional work reservoir particularly interesting is a threelevel design for a quantum absorption refrigerator which can be optimized to reach the maximal carnot cooling efficiency previous studies of threelevel chillers focused on the behavior of the averaged cooling current here we go beyond that and study the full counting statistics of heat exchange in a threelevel chiller model we explain how to obtain the complete cumulant generating function of the refrigerator in steady state then derive a partial cumulant generating function which yields closedform expressions for both the averaged cooling current and its noise our analytical results and simulations are beneficial for the design of nanoscale engines and cooling systems far from equilibrium with their performance optimized according to different criteria efficiency power fluctuations and dissipation
|
[['absorption', 'refrigerators', 'transfer', 'thermal', 'energy', 'from', 'a', 'cold', 'bath', 'to', 'a', 'hot', 'bath', 'without', 'input', 'power', 'by', 'utilizing', 'heat', 'from', 'an', 'additional', 'work', 'reservoir', 'particularly', 'interesting', 'is', 'a', 'threelevel', 'design', 'for', 'a', 'quantum', 'absorption', 'refrigerator', 'which', 'can', 'be', 'optimized', 'to', 'reach', 'the', 'maximal', 'carnot', 'cooling', 'efficiency', 'previous', 'studies', 'of', 'threelevel', 'chillers', 'focused', 'on', 'the', 'behavior', 'of', 'the', 'averaged', 'cooling', 'current', 'here', 'we', 'go', 'beyond', 'that', 'and', 'study', 'the', 'full', 'counting', 'statistics', 'of', 'heat', 'exchange', 'in', 'a', 'threelevel', 'chiller', 'model', 'we', 'explain', 'how', 'to', 'obtain', 'the', 'complete', 'cumulant', 'generating', 'function', 'of', 'the', 'refrigerator', 'in', 'steady', 'state', 'then', 'derive', 'a', 'partial', 'cumulant', 'generating', 'function', 'which', 'yields', 'closedform', 'expressions', 'for', 'both', 'the', 'averaged', 'cooling', 'current', 'and', 'its', 'noise', 'our', 'analytical', 'results', 'and', 'simulations', 'are', 'beneficial', 'for', 'the', 'design', 'of', 'nanoscale', 'engines', 'and', 'cooling', 'systems', 'far', 'from', 'equilibrium', 'with', 'their', 'performance', 'optimized', 'according', 'to', 'different', 'criteria', 'efficiency', 'power', 'fluctuations', 'and', 'dissipation']]
|
[-0.07872089092797112, 0.12120601584983207, -0.06389641709511681, 0.040290081060212736, -0.03827970374223529, -0.1485073206420405, 0.10331610987298698, 0.3558227145904992, -0.243773127375424, -0.29886656028351616, 0.057808418696442126, -0.30007867166316327, -0.03885696081406608, 0.2746975116057917, 0.01298288426672419, 0.06852053077598451, 0.03683964820059181, 0.022761146430255605, -0.04263392633197791, -0.18406298308677616, 0.26560302748389186, 0.129753598335538, 0.31217302733455743, 0.07241105869235027, 0.09735847695344159, -0.04787826345644283, 0.030930514396706812, 0.002318426547284938, -0.1424093722949556, 0.0653372897424412, 0.2519699343841295, 0.07304415250273079, 0.23132559880424214, -0.44241423297952226, -0.24639793799011683, 0.11425521527303163, 0.1350929829431381, 0.12656402302950265, -0.05718230063390291, -0.20355254484872734, -0.0025043977190087846, -0.20777943710714172, -0.09149962667451829, -0.11789414897556322, -0.02961414570913834, 0.07619354211516222, -0.2909490992156725, 0.0775603085097407, 0.10305564781669907, 0.0412606945935301, -0.04015704431986043, -0.08754112551204202, -0.0007981299406842513, 0.1250793126033188, -0.06423909509741403, -0.05114519072943652, 0.24011654598752455, -0.147375296367345, -0.09667930199739327, 0.34198177333439694, -0.10930888586658605, -0.1554849594806966, 0.15718846403214395, -0.12432098488456436, -0.0761615973041982, 0.1541153791924419, 0.1522099586317734, 0.10565529151369824, -0.21681907426464517, 0.0047665952818094414, 0.01649755890145391, 0.16131817948763721, 0.04390084592714196, 0.05526812596652074, 0.21148199949343846, 0.18556022019993487, 0.038506535477429424, 0.2157256391420517, -0.048420569490400606, -0.12286726109442764, -0.27107980827085015, -0.15048067945334426, -0.1914743803675939, 0.11400776614948195, -0.08278635488143966, -0.12249049073287925, 0.3857183668391817, 0.19985427868514494, 0.14528181815209487, 0.04576743548406529, 0.3723064670806472, 0.18708494659529074, 0.0067004544510128735, 0.0841256972484696, 0.2471197909187703, 0.1430902224220969, 0.1162311390618838, -0.32423864726173585, 0.020776723597838612, 0.008097373880445957]
|
1,803.03714
|
Accelerated Wirtinger Flow for Multiplexed Fourier Ptychographic
Microscopy
|
Fourier ptychographic microscopy enables gigapixel-scale imaging, with both
large field-of-view and high resolution. Using a set of low-resolution images
that are recorded under varying illumination angles, the goal is to
computationally reconstruct high-resolution phase and amplitude images. To
increase temporal resolution, one may use multiplexed measurements where the
sample is illuminated simultaneously from a subset of the angles. In this
paper, we develop an algorithm for Fourier ptychographic microscopy with such
multiplexed illumination. Specifically, we consider gradient descent type
updates and propose an analytical step size that ensures the convergence of the
iterates to a stationary point. Furthermore, we propose an accelerated version
of our algorithm (with the same step size) which significantly improves the
convergence speed. We demonstrate that the practical performance of our
algorithm is identical to the case where the step size is manually tuned.
Finally, we apply our parameter-free approach to real data and validate its
applicability.
|
eess.SP math.OC
|
fourier ptychographic microscopy enables gigapixelscale imaging with both large fieldofview and high resolution using a set of lowresolution images that are recorded under varying illumination angles the goal is to computationally reconstruct highresolution phase and amplitude images to increase temporal resolution one may use multiplexed measurements where the sample is illuminated simultaneously from a subset of the angles in this paper we develop an algorithm for fourier ptychographic microscopy with such multiplexed illumination specifically we consider gradient descent type updates and propose an analytical step size that ensures the convergence of the iterates to a stationary point furthermore we propose an accelerated version of our algorithm with the same step size which significantly improves the convergence speed we demonstrate that the practical performance of our algorithm is identical to the case where the step size is manually tuned finally we apply our parameterfree approach to real data and validate its applicability
|
[['fourier', 'ptychographic', 'microscopy', 'enables', 'gigapixelscale', 'imaging', 'with', 'both', 'large', 'fieldofview', 'and', 'high', 'resolution', 'using', 'a', 'set', 'of', 'lowresolution', 'images', 'that', 'are', 'recorded', 'under', 'varying', 'illumination', 'angles', 'the', 'goal', 'is', 'to', 'computationally', 'reconstruct', 'highresolution', 'phase', 'and', 'amplitude', 'images', 'to', 'increase', 'temporal', 'resolution', 'one', 'may', 'use', 'multiplexed', 'measurements', 'where', 'the', 'sample', 'is', 'illuminated', 'simultaneously', 'from', 'a', 'subset', 'of', 'the', 'angles', 'in', 'this', 'paper', 'we', 'develop', 'an', 'algorithm', 'for', 'fourier', 'ptychographic', 'microscopy', 'with', 'such', 'multiplexed', 'illumination', 'specifically', 'we', 'consider', 'gradient', 'descent', 'type', 'updates', 'and', 'propose', 'an', 'analytical', 'step', 'size', 'that', 'ensures', 'the', 'convergence', 'of', 'the', 'iterates', 'to', 'a', 'stationary', 'point', 'furthermore', 'we', 'propose', 'an', 'accelerated', 'version', 'of', 'our', 'algorithm', 'with', 'the', 'same', 'step', 'size', 'which', 'significantly', 'improves', 'the', 'convergence', 'speed', 'we', 'demonstrate', 'that', 'the', 'practical', 'performance', 'of', 'our', 'algorithm', 'is', 'identical', 'to', 'the', 'case', 'where', 'the', 'step', 'size', 'is', 'manually', 'tuned', 'finally', 'we', 'apply', 'our', 'parameterfree', 'approach', 'to', 'real', 'data', 'and', 'validate', 'its', 'applicability']]
|
[-0.06509377920247664, 0.03850965854657478, -0.10254156100409513, -0.00910416383385683, -0.07414942425336467, -0.12757460452270825, 0.03261691492840352, 0.4648340684639302, -0.29441996725485814, -0.3119085295687103, 0.10204663036610093, -0.2514700936523593, -0.1506683733329695, 0.20641179593119596, -0.12270811956147633, 0.07672376497702624, 0.09613304229033802, -0.02807915477785251, -0.06324259147498239, -0.24999396047949643, 0.24862920613620207, 0.07774999008640425, 0.3187088722205838, -0.012767161478963835, 0.15871514897525235, 0.030146934381926692, -0.01785597792558298, 0.024425922683285955, -0.08826058924221086, 0.10628955478360567, 0.23562417220515477, 0.15365825473201394, 0.27509835976737224, -0.41775457735537874, -0.15412084835377948, 0.07865473665050324, 0.1926378752004713, 0.10850460575939778, -0.09498760086678536, -0.2690114637448249, 0.11419750388791872, -0.07785981592555709, -0.11403050139509388, -0.12247347278020881, -0.053611246096463686, 0.023479914742935176, -0.3491571135387219, 0.0481155320049097, -0.018040830059754136, 0.054653918003626414, -0.051264982574946244, -0.04422166380901753, 0.06734412466946817, 0.12359003143212358, -0.003977849128939804, 0.05275097295382856, 0.12480140250139185, -0.09635658376921116, -0.07534166195488455, 0.34487671031931183, -0.05800289797499492, -0.1883111715514139, 0.18294022507990235, -0.1482642035228231, -0.1054111739731585, 0.16826219770853834, 0.1855116135807745, 0.17658077300038955, -0.11628555011278673, 0.04299589312043263, -0.039235494290756075, 0.23681359889316497, 0.07245144770721233, 0.025203793241784272, 0.10732427858963411, 0.20069991703459758, 0.09183925754137781, 0.17375228188420022, -0.22277730938651605, -0.029854677802580873, -0.2618114058952162, -0.13789349435736112, -0.21239655416625372, 0.0013544197619849484, -0.11397189090594291, -0.12599958972820383, 0.4024759244346461, 0.2375551036054836, 0.22764230789369996, 0.11820605071647006, 0.38620627162645, 0.08981347242025242, 0.05253043198736002, 0.05597815850737276, 0.18709261140582578, 0.07254576123557023, 0.1117812835323063, -0.23335954502829356, 0.023494576168746152, 0.04190195407965128]
|
1,803.03715
|
The dynamics of the angular and radial density correlation scaling
exponents in fractal to non-fractal morphodynamics
|
Fractal/non-fractal morphological transitions allow for the systematic study
of the physics behind fractal morphogenesis in nature. In these systems, the
fractal dimension is considered a non-thermal order parameter, commonly and
equivalently computed from the scaling of the two-point radial- or
angular-density correlations. However, these two quantities lead to
discrepancies during the analysis of basic systems, such as in the
diffusion-limited aggregation fractal. Hence, the corresponding clarification
regarding the limits of the radial/angular scaling equivalence is needed. In
this work, considering three fundamental fractal/non-fractal transitions in two
dimensions, we show that the unavoidable emergence of growth anisotropies is
responsible for the breaking-down of the radial/angular equivalence.
Specifically, we show that the angular scaling behaves as a critical power-law,
whereas the radial scaling as an exponential that, under the fractal dimension
interpretation, resemble first- and second-order transitions, respectively.
Remarkably, these and previous results can be unified under a single fractal
dimensionality equation.
|
nlin.PS cond-mat.soft
|
fractalnonfractal morphological transitions allow for the systematic study of the physics behind fractal morphogenesis in nature in these systems the fractal dimension is considered a nonthermal order parameter commonly and equivalently computed from the scaling of the twopoint radial or angulardensity correlations however these two quantities lead to discrepancies during the analysis of basic systems such as in the diffusionlimited aggregation fractal hence the corresponding clarification regarding the limits of the radialangular scaling equivalence is needed in this work considering three fundamental fractalnonfractal transitions in two dimensions we show that the unavoidable emergence of growth anisotropies is responsible for the breakingdown of the radialangular equivalence specifically we show that the angular scaling behaves as a critical powerlaw whereas the radial scaling as an exponential that under the fractal dimension interpretation resemble first and secondorder transitions respectively remarkably these and previous results can be unified under a single fractal dimensionality equation
|
[['fractalnonfractal', 'morphological', 'transitions', 'allow', 'for', 'the', 'systematic', 'study', 'of', 'the', 'physics', 'behind', 'fractal', 'morphogenesis', 'in', 'nature', 'in', 'these', 'systems', 'the', 'fractal', 'dimension', 'is', 'considered', 'a', 'nonthermal', 'order', 'parameter', 'commonly', 'and', 'equivalently', 'computed', 'from', 'the', 'scaling', 'of', 'the', 'twopoint', 'radial', 'or', 'angulardensity', 'correlations', 'however', 'these', 'two', 'quantities', 'lead', 'to', 'discrepancies', 'during', 'the', 'analysis', 'of', 'basic', 'systems', 'such', 'as', 'in', 'the', 'diffusionlimited', 'aggregation', 'fractal', 'hence', 'the', 'corresponding', 'clarification', 'regarding', 'the', 'limits', 'of', 'the', 'radialangular', 'scaling', 'equivalence', 'is', 'needed', 'in', 'this', 'work', 'considering', 'three', 'fundamental', 'fractalnonfractal', 'transitions', 'in', 'two', 'dimensions', 'we', 'show', 'that', 'the', 'unavoidable', 'emergence', 'of', 'growth', 'anisotropies', 'is', 'responsible', 'for', 'the', 'breakingdown', 'of', 'the', 'radialangular', 'equivalence', 'specifically', 'we', 'show', 'that', 'the', 'angular', 'scaling', 'behaves', 'as', 'a', 'critical', 'powerlaw', 'whereas', 'the', 'radial', 'scaling', 'as', 'an', 'exponential', 'that', 'under', 'the', 'fractal', 'dimension', 'interpretation', 'resemble', 'first', 'and', 'secondorder', 'transitions', 'respectively', 'remarkably', 'these', 'and', 'previous', 'results', 'can', 'be', 'unified', 'under', 'a', 'single', 'fractal', 'dimensionality', 'equation']]
|
[-0.10439063096733613, 0.15682647039343342, -0.10288079696348743, 0.11300440010696498, -0.01354335663947151, -0.0970741765120545, 0.011098000683469346, 0.303009332494332, -0.26816460217751964, -0.2729063751238927, 0.08649321054533199, -0.25502040722042424, -0.17157773738034773, 0.18518623462846703, 0.004195161116611515, 0.0809030462987721, -0.03357180087462168, 0.00010043753128549135, -0.07065983113637697, -0.18994257419143576, 0.35791238183407365, 0.03553348391417514, 0.3119651615632245, 0.04674533075602675, 0.04431669258298604, -0.041114306889122, -0.032910000677598084, 0.05988926746303568, -0.15920502646440582, 0.08630176750011742, 0.20182320409819382, 0.0693592388824736, 0.20616969184924824, -0.39504856740854477, -0.2243188659100466, 0.10114114782206614, 0.18959628437988688, 0.08162002223036473, -0.007459595991374069, -0.22883134835865349, 0.036563225836191024, -0.10791166293170504, -0.16498429101665277, -0.07982140223533418, 0.04535573964538934, 0.025815233030919666, -0.2315913733359225, 0.15756195625353203, 0.11820553794402529, 0.0628219979368402, -0.0815231564424844, -0.08182969580505144, -0.012288081583982284, 0.13365506478018957, 0.052349719484777166, -0.02546560433472985, 0.10969676249786406, -0.12256756006280665, -0.1401025234049853, 0.39743419018860376, -0.02460258363154591, -0.170636286870954, 0.23301068945108233, -0.1690035186223434, -0.19094192646003352, 0.09933137867247334, 0.15549458893066323, 0.03926058683695423, -0.13833764779485283, 0.07705695460105277, -0.0055321969400235526, 0.17761041917932546, 0.08017014904967132, 0.05596742796636111, 0.17950738766671134, 0.15778214332798646, 0.02569366867553342, 0.13790274186475152, -0.06948058271145045, -0.1320189592504018, -0.3229185434158992, -0.16303058980013924, -0.15525853670693027, 0.0767648495942971, -0.15204161611777758, -0.16092731997156767, 0.3651150782919816, 0.1492926204495283, 0.23468317651831722, 0.04626430044693218, 0.24508893786854036, 0.12616002609138377, 0.07150895851156895, 0.04956829797324522, 0.2515586007235421, 0.10633411012885689, 0.095670790578289, -0.23200419649632797, 0.08173322766339658, 0.07706435806372806]
|
1,803.03716
|
TRAJEDI: Trajectory Dissimilarity
|
The vast increase in our ability to obtain and store trajectory data
necessitates trajectory analytics techniques to extract useful information from
this data. Pair-wise distance functions are a foundation building block for
common operations on trajectory datasets including constrained SELECT queries,
k-nearest neighbors, and similarity and diversity algorithms. The accuracy and
performance of these operations depend heavily on the speed and accuracy of the
underlying trajectory distance function, which is in turn affected by
trajectory calibration. Current methods either require calibrated data, or
perform calibration of the entire relevant dataset first, which is expensive
and time consuming for large datasets. We present TRAJEDI, a calibrationaware
pair-wise distance calculation scheme that outperforms naive approaches while
preserving accuracy. We also provide analyses of parameter tuning to trade-off
between speed and accuracy. Our scheme is usable with any diversity, similarity
or k-nearest neighbor algorithm.
|
cs.DB
|
the vast increase in our ability to obtain and store trajectory data necessitates trajectory analytics techniques to extract useful information from this data pairwise distance functions are a foundation building block for common operations on trajectory datasets including constrained select queries knearest neighbors and similarity and diversity algorithms the accuracy and performance of these operations depend heavily on the speed and accuracy of the underlying trajectory distance function which is in turn affected by trajectory calibration current methods either require calibrated data or perform calibration of the entire relevant dataset first which is expensive and time consuming for large datasets we present trajedi a calibrationaware pairwise distance calculation scheme that outperforms naive approaches while preserving accuracy we also provide analyses of parameter tuning to tradeoff between speed and accuracy our scheme is usable with any diversity similarity or knearest neighbor algorithm
|
[['the', 'vast', 'increase', 'in', 'our', 'ability', 'to', 'obtain', 'and', 'store', 'trajectory', 'data', 'necessitates', 'trajectory', 'analytics', 'techniques', 'to', 'extract', 'useful', 'information', 'from', 'this', 'data', 'pairwise', 'distance', 'functions', 'are', 'a', 'foundation', 'building', 'block', 'for', 'common', 'operations', 'on', 'trajectory', 'datasets', 'including', 'constrained', 'select', 'queries', 'knearest', 'neighbors', 'and', 'similarity', 'and', 'diversity', 'algorithms', 'the', 'accuracy', 'and', 'performance', 'of', 'these', 'operations', 'depend', 'heavily', 'on', 'the', 'speed', 'and', 'accuracy', 'of', 'the', 'underlying', 'trajectory', 'distance', 'function', 'which', 'is', 'in', 'turn', 'affected', 'by', 'trajectory', 'calibration', 'current', 'methods', 'either', 'require', 'calibrated', 'data', 'or', 'perform', 'calibration', 'of', 'the', 'entire', 'relevant', 'dataset', 'first', 'which', 'is', 'expensive', 'and', 'time', 'consuming', 'for', 'large', 'datasets', 'we', 'present', 'trajedi', 'a', 'calibrationaware', 'pairwise', 'distance', 'calculation', 'scheme', 'that', 'outperforms', 'naive', 'approaches', 'while', 'preserving', 'accuracy', 'we', 'also', 'provide', 'analyses', 'of', 'parameter', 'tuning', 'to', 'tradeoff', 'between', 'speed', 'and', 'accuracy', 'our', 'scheme', 'is', 'usable', 'with', 'any', 'diversity', 'similarity', 'or', 'knearest', 'neighbor', 'algorithm']]
|
[-0.07898700642122324, -0.020125450640112806, -0.07664629125719716, 0.06627206511547615, -0.12406128181459503, -0.18263853599967286, 0.14124320876087806, 0.4397163485284064, -0.26354279376486006, -0.3780091568532822, 0.10516834502751611, -0.307543239517727, -0.10429986501983601, 0.2198909005156899, -0.08015625470941015, 0.10083528706576113, 0.1724124757050396, 0.04812214052720873, -0.0985470867142912, -0.29988146786454045, 0.2563291175656101, 0.08775639280060427, 0.34036192119711167, 0.018258817882524977, 0.11934777065397997, 0.03914387780241668, -0.08418015802610773, 0.012213735204699228, -0.09934217149917104, 0.15249155225439948, 0.2708609802313417, 0.24723250258767562, 0.2809872320658869, -0.3800899052603854, -0.19276824629724884, 0.11231206970365983, 0.14589463689920606, 0.08741401322709444, -0.0001952404993010028, -0.286497682681401, 0.050226665359901654, -0.11532030919258543, -0.04551695015536045, -0.185575208934895, 0.006098997347030065, 0.04545622666679631, -0.3102232933500045, 0.09921782171473463, -0.0032556100900070543, 0.06053591075373425, 0.033019464055960665, -0.09816917582421744, 0.024271388233324392, 0.19615797300173118, 0.020679850539983176, 0.07891953934449703, 0.15737963091287252, -0.09306148488724457, -0.14037605724213711, 0.3754329570776803, -0.039306772593073816, -0.23214893017580612, 0.192558768300822, -0.043846530116183294, -0.11878810044404843, 0.12346178339124261, 0.23078929823019254, 0.11442702590310343, -0.14794999350987964, 0.04723752022045832, 0.06839986232933488, 0.2194609063804793, 0.026278344977968673, 0.05333926671740713, 0.1461852841940206, 0.2237416044842425, 0.07977742901517466, 0.05999817848942584, -0.11102116142781518, -0.10373923258199323, -0.21881986275422488, -0.10112751360393042, -0.21567579687124105, -0.06334300956306912, -0.16718480009981349, -0.1484879327254544, 0.357470459655828, 0.24337325629396298, 0.209686720295702, 0.09564918184673026, 0.3852779710223134, 0.007473019894761897, 0.10625079361279663, 0.1307925816471253, 0.19811136528209736, -0.003426851306057019, 0.06849136000010017, -0.19117155530500032, 0.09871933626835135, 0.06614274827582534]
|
1,803.03717
|
Low-Rank Solution Methods for Stochastic Eigenvalue Problems
|
We study efficient solution methods for stochastic eigenvalue problems
arising from discretization of self-adjoint partial differential equations with
random data. With the stochastic Galerkin approach, the solutions are
represented as generalized polynomial chaos expansions. A low-rank variant of
the inverse subspace iteration algorithm is presented for computing one or
several minimal eigenvalues and corresponding eigenvectors of
parameter-dependent matrices. In the algorithm, the iterates are approximated
by low-rank matrices, which leads to significant cost savings. The algorithm is
tested on two benchmark problems, a stochastic diffusion problem with some
poorly separated eigenvalues, and an operator derived from a discrete
stochastic Stokes problem whose minimal eigenvalue is related to the inf-sup
stability constant. Numerical experiments show that the low-rank algorithm
produces accurate solutions compared to the Monte Carlo method, and it uses
much less computational time than the original algorithm without low-rank
approximation.
|
math.NA
|
we study efficient solution methods for stochastic eigenvalue problems arising from discretization of selfadjoint partial differential equations with random data with the stochastic galerkin approach the solutions are represented as generalized polynomial chaos expansions a lowrank variant of the inverse subspace iteration algorithm is presented for computing one or several minimal eigenvalues and corresponding eigenvectors of parameterdependent matrices in the algorithm the iterates are approximated by lowrank matrices which leads to significant cost savings the algorithm is tested on two benchmark problems a stochastic diffusion problem with some poorly separated eigenvalues and an operator derived from a discrete stochastic stokes problem whose minimal eigenvalue is related to the infsup stability constant numerical experiments show that the lowrank algorithm produces accurate solutions compared to the monte carlo method and it uses much less computational time than the original algorithm without lowrank approximation
|
[['we', 'study', 'efficient', 'solution', 'methods', 'for', 'stochastic', 'eigenvalue', 'problems', 'arising', 'from', 'discretization', 'of', 'selfadjoint', 'partial', 'differential', 'equations', 'with', 'random', 'data', 'with', 'the', 'stochastic', 'galerkin', 'approach', 'the', 'solutions', 'are', 'represented', 'as', 'generalized', 'polynomial', 'chaos', 'expansions', 'a', 'lowrank', 'variant', 'of', 'the', 'inverse', 'subspace', 'iteration', 'algorithm', 'is', 'presented', 'for', 'computing', 'one', 'or', 'several', 'minimal', 'eigenvalues', 'and', 'corresponding', 'eigenvectors', 'of', 'parameterdependent', 'matrices', 'in', 'the', 'algorithm', 'the', 'iterates', 'are', 'approximated', 'by', 'lowrank', 'matrices', 'which', 'leads', 'to', 'significant', 'cost', 'savings', 'the', 'algorithm', 'is', 'tested', 'on', 'two', 'benchmark', 'problems', 'a', 'stochastic', 'diffusion', 'problem', 'with', 'some', 'poorly', 'separated', 'eigenvalues', 'and', 'an', 'operator', 'derived', 'from', 'a', 'discrete', 'stochastic', 'stokes', 'problem', 'whose', 'minimal', 'eigenvalue', 'is', 'related', 'to', 'the', 'infsup', 'stability', 'constant', 'numerical', 'experiments', 'show', 'that', 'the', 'lowrank', 'algorithm', 'produces', 'accurate', 'solutions', 'compared', 'to', 'the', 'monte', 'carlo', 'method', 'and', 'it', 'uses', 'much', 'less', 'computational', 'time', 'than', 'the', 'original', 'algorithm', 'without', 'lowrank', 'approximation']]
|
[-0.08445490203824238, -0.004288225269489195, -0.06449100003802342, 0.09383253586818695, -0.08152935652273662, -0.17824674194599402, -0.007875142176470435, 0.35572875141172755, -0.36076094564182537, -0.2713810008395701, 0.16807578017865804, -0.2889972477292655, -0.18185933306152727, 0.1887283823007044, -0.04579153203517727, 0.17851813384562942, 0.14906785942627288, 0.0010903184137023088, -0.1276868004917418, -0.23468078737120732, 0.27530566743056534, 0.0414769175381512, 0.20764695838628772, -0.03748378365677088, 0.17326908354591314, -0.07094024484712921, -0.049860172834022776, 0.009067982319636759, -0.05985277254120587, 0.13058959505626444, 0.2839680319381151, 0.13669326903747644, 0.3381160868397119, -0.43315929614324516, -0.16088318020429013, 0.1737871345987953, 0.1606469981047054, 0.12093966350154224, -0.03685450977695353, -0.2902378051191674, 0.09421414239596285, -0.12338109361338066, -0.10816314991180462, -0.1281304712760665, -0.07491627408865284, 0.006429857367580321, -0.3514732019645525, 0.13028988909927455, 0.021836417538926324, 0.01230990435062835, -0.06102108498969188, -0.19842375416295432, 0.05132256856465593, 0.00035687206570613893, 0.04849941527028403, -0.027932120419391398, 0.07304440582078611, -0.033017887705804924, -0.14457910074125843, 0.37732659656792245, -0.05150439528674498, -0.30642198886167493, 0.11817369733421886, -0.06056661746325962, -0.095474505318157, 0.20073081447960847, 0.18693319356406657, 0.18356108979870242, -0.13373959962120083, 0.14247905524944596, -0.06641967425202118, 0.1424435509355567, 0.04472717900218852, -0.03147509884657272, 0.018769856079990137, 0.14254402297801597, 0.18488719274375773, 0.11335616320345207, -0.00035410175506184075, -0.190178920608179, -0.25426703077123386, -0.08237519063431595, -0.2552295129742896, 0.015044382839390994, -0.21627844728978188, -0.23436295061458087, 0.3966567272696882, 0.13410228875908234, 0.16832397513567132, 0.11824398222362874, 0.32741696936084974, 0.19688198977589264, -0.013961460712573868, 0.13623457934694194, 0.13487057507154532, 0.18813646811304996, 0.09581251632948967, -0.2520734714872554, 0.06341527758747445, 0.22281417635051495]
|
1,803.03718
|
Simultaneous Broadband Vector Magnetometry Using Solid-State Spins
|
We demonstrate a vector magnetometer that simultaneously measures all
Cartesian components of a dynamic magnetic field using an ensemble of
nitrogen-vacancy (NV) centers in a single-crystal diamond. Optical NV-diamond
measurements provide high-sensitivity, broadband magnetometry under ambient or
extreme physical conditions; and the fixed crystallographic axes inherent to
this solid-state system enable vector sensing free from heading errors. In the
present device, multi-channel lock-in detection extracts the
magnetic-field-dependent spin resonance shifts of NVs oriented along all four
tetrahedral diamond axes from the optical signal measured on a single detector.
The sensor operates from near DC up to a $12.5$ kHz measurement bandwidth; and
simultaneously achieves $\sim\!50$ pT/$\sqrt{\text{Hz}}$ magnetic field
sensitivity for each Cartesian component, which is to date the highest
demonstrated sensitivity of a full vector magnetometer employing solid-state
spins. Compared to optimized devices interrogating the four NV orientations
sequentially, the simultaneous vector magnetometer enables a $4\times$
measurement speedup. This technique can be extended to pulsed-type sensing
protocols and parallel wide-field magnetic imaging.
|
quant-ph cond-mat.mes-hall physics.app-ph physics.ins-det
|
we demonstrate a vector magnetometer that simultaneously measures all cartesian components of a dynamic magnetic field using an ensemble of nitrogenvacancy nv centers in a singlecrystal diamond optical nvdiamond measurements provide highsensitivity broadband magnetometry under ambient or extreme physical conditions and the fixed crystallographic axes inherent to this solidstate system enable vector sensing free from heading errors in the present device multichannel lockin detection extracts the magneticfielddependent spin resonance shifts of nvs oriented along all four tetrahedral diamond axes from the optical signal measured on a single detector the sensor operates from near dc up to a 125 khz measurement bandwidth and simultaneously achieves sim50 ptsqrttexthz magnetic field sensitivity for each cartesian component which is to date the highest demonstrated sensitivity of a full vector magnetometer employing solidstate spins compared to optimized devices interrogating the four nv orientations sequentially the simultaneous vector magnetometer enables a 4times measurement speedup this technique can be extended to pulsedtype sensing protocols and parallel widefield magnetic imaging
|
[['we', 'demonstrate', 'a', 'vector', 'magnetometer', 'that', 'simultaneously', 'measures', 'all', 'cartesian', 'components', 'of', 'a', 'dynamic', 'magnetic', 'field', 'using', 'an', 'ensemble', 'of', 'nitrogenvacancy', 'nv', 'centers', 'in', 'a', 'singlecrystal', 'diamond', 'optical', 'nvdiamond', 'measurements', 'provide', 'highsensitivity', 'broadband', 'magnetometry', 'under', 'ambient', 'or', 'extreme', 'physical', 'conditions', 'and', 'the', 'fixed', 'crystallographic', 'axes', 'inherent', 'to', 'this', 'solidstate', 'system', 'enable', 'vector', 'sensing', 'free', 'from', 'heading', 'errors', 'in', 'the', 'present', 'device', 'multichannel', 'lockin', 'detection', 'extracts', 'the', 'magneticfielddependent', 'spin', 'resonance', 'shifts', 'of', 'nvs', 'oriented', 'along', 'all', 'four', 'tetrahedral', 'diamond', 'axes', 'from', 'the', 'optical', 'signal', 'measured', 'on', 'a', 'single', 'detector', 'the', 'sensor', 'operates', 'from', 'near', 'dc', 'up', 'to', 'a', '125', 'khz', 'measurement', 'bandwidth', 'and', 'simultaneously', 'achieves', 'sim50', 'ptsqrttexthz', 'magnetic', 'field', 'sensitivity', 'for', 'each', 'cartesian', 'component', 'which', 'is', 'to', 'date', 'the', 'highest', 'demonstrated', 'sensitivity', 'of', 'a', 'full', 'vector', 'magnetometer', 'employing', 'solidstate', 'spins', 'compared', 'to', 'optimized', 'devices', 'interrogating', 'the', 'four', 'nv', 'orientations', 'sequentially', 'the', 'simultaneous', 'vector', 'magnetometer', 'enables', 'a', '4times', 'measurement', 'speedup', 'this', 'technique', 'can', 'be', 'extended', 'to', 'pulsedtype', 'sensing', 'protocols', 'and', 'parallel', 'widefield', 'magnetic', 'imaging']]
|
[-0.15449892851431501, 0.16152415035651513, 0.019745261743896125, -0.08600810854854814, -0.04549527629018293, -0.16415847677980427, 0.052341746558255936, 0.5002851454043611, -0.25980250107309555, -0.30322593958435223, 0.07787689077378661, -0.2750114712817884, -0.036500953440120595, 0.22595839448828506, -0.0035772427543419305, 0.06763671493007345, 0.06475258826260796, 0.03821167307895006, -0.07943782878328137, -0.1472041969916419, 0.175383399862428, 0.04967528115234899, 0.3825113366687705, -0.01394595665045904, 0.1919157963812999, 0.07204006341725634, 0.06438613265914761, 0.001271467238681981, -0.04772006260522718, 0.1299503027940146, 0.2587452213733995, 0.05205911013980321, 0.17923089798239078, -0.39995433527814306, -0.18459909593524493, 0.07174992891352462, 0.12581504903363516, 0.12689897570808228, -0.06260213309173003, -0.3037273461181346, 0.07929236564484442, -0.11905859160289076, -0.10560723910856955, -0.08368189813372512, -0.07006288618167504, 0.008839277356793606, -0.30101649004456976, 0.02537701276611097, 0.004181823502142873, 0.14268099049088886, -0.12236108359425568, -0.0844060128622671, 0.041789938131729085, 0.07410955029215825, -0.1067328332122184, 0.08339851949384193, 0.2777824516680022, -0.05946514817961254, -0.17810264520595856, 0.3375192977233518, -0.0608884827479697, -0.11292833728160455, 0.13854148778203956, -0.16997659203498075, -0.09241095934097904, 0.14722572925633617, 0.16405975516894197, 0.12458338458900867, -0.19892770359408318, 0.022179272328431122, 0.035540138489150254, 0.2198792547305687, 0.08450557676473668, 0.0888073146719231, 0.23072229764823401, 0.16096326939021208, 0.11397066566421939, 0.14532993058963267, -0.23132790436950854, 0.0038478075127516475, -0.20231797212665403, -0.14074641981043545, -0.1761139704981784, 0.07698326927511404, -0.12584204097129825, -0.111917223443309, 0.382159720342722, 0.1896986048046777, 0.16597588889746237, -0.07726439167470642, 0.3878196269557204, 0.0223895472160581, 0.14181815222576724, 0.01287043294204133, 0.2768489103258142, 0.24444005477259526, 0.12606702051711158, -0.25033974495820516, -0.028346285585499145, -0.056246557686570456]
|
1,803.03719
|
DeepMoTIon: Learning to Navigate Like Humans
|
We present a novel human-aware navigation approach, where the robot learns to
mimic humans to navigate safely in crowds. The presented model, referred to as
DeepMoTIon, is trained with pedestrian surveillance data to predict human
velocity in the environment. The robot processes LiDAR scans via the trained
network to navigate to the target location. We conduct extensive experiments to
assess the components of our network and prove their necessity to imitate
humans. Our experiments show that DeepMoTIion outperforms all the benchmarks in
terms of human imitation, achieving a 24% reduction in time series-based path
deviation over the next best approach. In addition, while many other approaches
often failed to reach the target, our method reached the target in 100% of the
test cases while complying with social norms and ensuring human safety.
|
cs.RO cs.AI cs.LG stat.ML
|
we present a novel humanaware navigation approach where the robot learns to mimic humans to navigate safely in crowds the presented model referred to as deepmotion is trained with pedestrian surveillance data to predict human velocity in the environment the robot processes lidar scans via the trained network to navigate to the target location we conduct extensive experiments to assess the components of our network and prove their necessity to imitate humans our experiments show that deepmotiion outperforms all the benchmarks in terms of human imitation achieving a 24 reduction in time seriesbased path deviation over the next best approach in addition while many other approaches often failed to reach the target our method reached the target in 100 of the test cases while complying with social norms and ensuring human safety
|
[['we', 'present', 'a', 'novel', 'humanaware', 'navigation', 'approach', 'where', 'the', 'robot', 'learns', 'to', 'mimic', 'humans', 'to', 'navigate', 'safely', 'in', 'crowds', 'the', 'presented', 'model', 'referred', 'to', 'as', 'deepmotion', 'is', 'trained', 'with', 'pedestrian', 'surveillance', 'data', 'to', 'predict', 'human', 'velocity', 'in', 'the', 'environment', 'the', 'robot', 'processes', 'lidar', 'scans', 'via', 'the', 'trained', 'network', 'to', 'navigate', 'to', 'the', 'target', 'location', 'we', 'conduct', 'extensive', 'experiments', 'to', 'assess', 'the', 'components', 'of', 'our', 'network', 'and', 'prove', 'their', 'necessity', 'to', 'imitate', 'humans', 'our', 'experiments', 'show', 'that', 'deepmotiion', 'outperforms', 'all', 'the', 'benchmarks', 'in', 'terms', 'of', 'human', 'imitation', 'achieving', 'a', '24', 'reduction', 'in', 'time', 'seriesbased', 'path', 'deviation', 'over', 'the', 'next', 'best', 'approach', 'in', 'addition', 'while', 'many', 'other', 'approaches', 'often', 'failed', 'to', 'reach', 'the', 'target', 'our', 'method', 'reached', 'the', 'target', 'in', '100', 'of', 'the', 'test', 'cases', 'while', 'complying', 'with', 'social', 'norms', 'and', 'ensuring', 'human', 'safety']]
|
[-0.03262588318723899, 0.014113856226993867, -0.06587180765345693, 0.04302811317913718, -0.10034322543069721, -0.14985822468566207, 0.07072952864512515, 0.44570641447431764, -0.23535258948373106, -0.37197708061967905, 0.04440051372557019, -0.2924146710465161, -0.16951554733543442, 0.19099600233782368, -0.14417419686259775, 0.09407361102863573, 0.13741125003255616, 0.09473031071247533, 0.011382838218616178, -0.27262761145830156, 0.21991709015117242, 0.03579096771919957, 0.3058960227510677, 0.026058989139990163, 0.14983416564422303, -0.024959753439403497, -0.023020208246396997, -0.0196114402576803, -0.05002996739645963, 0.13152230774243295, 0.3488197129792892, 0.20716021802240553, 0.3218042394003043, -0.44167650880050274, -0.2266149276563038, 0.12315189134902679, 0.12548078399581405, 0.06776128363294097, 0.02407683986597336, -0.40522493055949993, 0.0928208809847442, -0.16882434947272906, -0.10678677938233774, -0.10802975529088424, -0.04586283245052283, 0.0011108397425582202, -0.29929658498910544, -0.009572559104372675, 0.014044511282386688, 0.07628681353078438, -0.08082302418859819, -0.04824739074280772, -0.0026841930633124253, 0.24654257288919046, 0.07395796298783702, 0.04932338865115665, 0.20905930831661232, -0.19594442840450657, -0.1509520508725053, 0.4159172689434714, -0.04464819500437723, -0.2100679338748495, 0.23763597815010984, -0.0917182234975581, -0.09705034822333031, 0.08556777515018789, 0.25084982869716793, 0.12147327097168623, -0.16434501297413728, -0.03485733309420399, -0.04031312486443382, 0.1588505824884543, 0.04297079110446458, -0.05655257657456857, 0.13227706352017077, 0.26144201843641124, 0.0749507738849878, 0.09589161754344017, -0.12423919912857505, -0.12648429627386995, -0.23253208237628525, -0.11192796953277698, -0.16147059185090118, -0.0500640369951725, -0.07585385926761844, -0.0896896417127349, 0.3523685747650094, 0.3058275761082768, 0.20469546229220353, 0.14558800606486888, 0.3493781139921898, -0.023825158703570756, 0.09432593503644547, 0.08605189256799908, 0.22445104651582928, -0.059354164449569695, 0.14963407319021196, -0.22518157058108884, 0.1104906938996954, 0.0035025459051562045]
|
1,803.0372
|
Reduced modeling of porous media convection in a minimal flow unit at
large Rayleigh number
|
Direct numerical simulations (DNS) indicate that at large values of the
Rayleigh number ($Ra$) convection in porous media self-organizes into
narrowly-spaced columnar flows, with more complex spatiotemporal features being
confined to boundary layers near the top and bottom walls. In this
investigation of high-$Ra$ porous media convection in a minimal flow unit, two
reduced modeling strategies are proposed that exploit these specific flow
characteristics. Both approaches utilize the idea of decomposition since the
flow exhibits different dynamics in different regions of the domain:
small-scale cellular motions generally are localized within the thermal and
vorticity boundary layers near the upper and lower walls, while in the
interior, the flow exhibits persistent large-scale structures and only a few
low (horizontal) wavenumber Fourier modes are active. Accordingly, in the first
strategy, the domain is decomposed into two near-wall regions and one interior
region. Our results confirm that suppressing the interior high-wavenumber modes
has negligible impact on the essential structural features and transport
properties of the flow. In the second strategy, a hybrid reduced model is
constructed by using Galerkin projection onto a fully \emph{a priori}
eigenbasis drawn from energy stability and upper bound theory, thereby
extending the model reduction strategy developed by Chini \emph{et al.}
(\emph{Physica~D}, vol. 240, 2011, pp. 241--248) to large $Ra$. The results
indicate that the near-wall upper-bound eigenmodes can economically represent
the small-scale rolls within the exquisitely-thin thermal boundary layers.
Relative to DNS, the hybrid algorithm enables over an order-of-magnitude
increase in computational efficiency with only a modest loss of accuracy.
|
physics.flu-dyn
|
direct numerical simulations dns indicate that at large values of the rayleigh number ra convection in porous media selforganizes into narrowlyspaced columnar flows with more complex spatiotemporal features being confined to boundary layers near the top and bottom walls in this investigation of highra porous media convection in a minimal flow unit two reduced modeling strategies are proposed that exploit these specific flow characteristics both approaches utilize the idea of decomposition since the flow exhibits different dynamics in different regions of the domain smallscale cellular motions generally are localized within the thermal and vorticity boundary layers near the upper and lower walls while in the interior the flow exhibits persistent largescale structures and only a few low horizontal wavenumber fourier modes are active accordingly in the first strategy the domain is decomposed into two nearwall regions and one interior region our results confirm that suppressing the interior highwavenumber modes has negligible impact on the essential structural features and transport properties of the flow in the second strategy a hybrid reduced model is constructed by using galerkin projection onto a fully empha priori eigenbasis drawn from energy stability and upper bound theory thereby extending the model reduction strategy developed by chini emphet al emphphysicad vol 240 2011 pp 241248 to large ra the results indicate that the nearwall upperbound eigenmodes can economically represent the smallscale rolls within the exquisitelythin thermal boundary layers relative to dns the hybrid algorithm enables over an orderofmagnitude increase in computational efficiency with only a modest loss of accuracy
|
[['direct', 'numerical', 'simulations', 'dns', 'indicate', 'that', 'at', 'large', 'values', 'of', 'the', 'rayleigh', 'number', 'ra', 'convection', 'in', 'porous', 'media', 'selforganizes', 'into', 'narrowlyspaced', 'columnar', 'flows', 'with', 'more', 'complex', 'spatiotemporal', 'features', 'being', 'confined', 'to', 'boundary', 'layers', 'near', 'the', 'top', 'and', 'bottom', 'walls', 'in', 'this', 'investigation', 'of', 'highra', 'porous', 'media', 'convection', 'in', 'a', 'minimal', 'flow', 'unit', 'two', 'reduced', 'modeling', 'strategies', 'are', 'proposed', 'that', 'exploit', 'these', 'specific', 'flow', 'characteristics', 'both', 'approaches', 'utilize', 'the', 'idea', 'of', 'decomposition', 'since', 'the', 'flow', 'exhibits', 'different', 'dynamics', 'in', 'different', 'regions', 'of', 'the', 'domain', 'smallscale', 'cellular', 'motions', 'generally', 'are', 'localized', 'within', 'the', 'thermal', 'and', 'vorticity', 'boundary', 'layers', 'near', 'the', 'upper', 'and', 'lower', 'walls', 'while', 'in', 'the', 'interior', 'the', 'flow', 'exhibits', 'persistent', 'largescale', 'structures', 'and', 'only', 'a', 'few', 'low', 'horizontal', 'wavenumber', 'fourier', 'modes', 'are', 'active', 'accordingly', 'in', 'the', 'first', 'strategy', 'the', 'domain', 'is', 'decomposed', 'into', 'two', 'nearwall', 'regions', 'and', 'one', 'interior', 'region', 'our', 'results', 'confirm', 'that', 'suppressing', 'the', 'interior', 'highwavenumber', 'modes', 'has', 'negligible', 'impact', 'on', 'the', 'essential', 'structural', 'features', 'and', 'transport', 'properties', 'of', 'the', 'flow', 'in', 'the', 'second', 'strategy', 'a', 'hybrid', 'reduced', 'model', 'is', 'constructed', 'by', 'using', 'galerkin', 'projection', 'onto', 'a', 'fully', 'empha', 'priori', 'eigenbasis', 'drawn', 'from', 'energy', 'stability', 'and', 'upper', 'bound', 'theory', 'thereby', 'extending', 'the', 'model', 'reduction', 'strategy', 'developed', 'by', 'chini', 'emphet', 'al', 'emphphysicad', 'vol', '240', '2011', 'pp', '241248', 'to', 'large', 'ra', 'the', 'results', 'indicate', 'that', 'the', 'nearwall', 'upperbound', 'eigenmodes', 'can', 'economically', 'represent', 'the', 'smallscale', 'rolls', 'within', 'the', 'exquisitelythin', 'thermal', 'boundary', 'layers', 'relative', 'to', 'dns', 'the', 'hybrid', 'algorithm', 'enables', 'over', 'an', 'orderofmagnitude', 'increase', 'in', 'computational', 'efficiency', 'with', 'only', 'a', 'modest', 'loss', 'of', 'accuracy']]
|
[-0.1336620965649798, 0.13669679628840573, -0.06957028476886709, 0.0005497420071794583, -0.056657815466604644, -0.084335236958388, 0.04028525839822852, 0.344055224472195, -0.2921584920590456, -0.3024090322612868, 0.10056007831694361, -0.25532332958527687, -0.1165264822330659, 0.17172849670476545, -0.030359631066510597, 0.04413954476118173, 0.08004496683843615, -0.038458992792407005, -0.02322777105131891, -0.16744265559591293, 0.2690068821910659, 0.04903176985491764, 0.33959816518898417, 0.03675620590253332, 0.058747566448963756, -0.08802954091149102, -0.043839559086070325, 0.04346912251255376, -0.15415233962024408, 0.11087804102259348, 0.22721532593165122, 0.02786791226750891, 0.26782022720217946, -0.4888923575541353, -0.27615162827561013, 0.028415486210866307, 0.17312181443595934, 0.07294983818759854, -0.037697482543982794, -0.2466295721668114, 0.12775076701252805, -0.1394099701400392, -0.09032881299859079, -0.05750176853242868, -0.008351390837501603, 0.0028923304656395554, -0.2719109262968224, 0.11729791470636743, 0.06444196237031227, 0.05471995945596818, -0.08243570867660872, -0.1126861240169624, -0.09164760314302928, 0.11500454884887544, 0.02358857996674724, -0.005557492366264105, 0.1397365764676919, -0.1467755810834176, -0.05675287278959664, 0.3448594077660634, -0.05419813542072169, -0.2288533507702433, 0.22341902106546047, -0.15136332960839088, -0.04135386083593092, 0.2085665565351312, 0.20919720802600003, 0.10361795364481556, -0.10440456624709758, 0.04101546187409506, -0.05570675689978828, 0.1791268206543168, 0.07971655635534203, 0.0019028826982986817, 0.19080922787709018, 0.1960635632920132, 0.09322274600702708, 0.12445016342548396, -0.1281195351318267, -0.14235209716044792, -0.2696345027581584, -0.12270146036338168, -0.15144047321660853, -0.035211651122227794, -0.12455290515155377, -0.1592071050119291, 0.37823144715076795, 0.10656099798773251, 0.19683416720292327, -0.0046135925127541635, 0.3245845494173823, 0.08312729676869296, 0.06866382753544646, 0.15927828412570558, 0.2552755323458251, 0.1492612751340872, 0.14202921490167927, -0.22857798901289547, 0.04692381283370551, 0.08440092857927084]
|
1,803.03721
|
Multiscale Methods for Model Order Reduction of Non Linear Multiphase
Flow Problems
|
Numerical simulations for flow and transport in subsurface porous media often
prove computationally prohibitive due to property data availability at multiple
spatial scales that can vary by orders of magnitude. A number of model order
reduction approaches are available in the existing literature that alleviate
this issue by approximating the solution at a coarse scale. We attempt to
present a comparison between two such model order reduction techniques, namely:
(1) adaptive numerical homogenization and (2) generalized multiscale basis
functions. We rely upon a non-linear, multi-phase, black-oil model formulation,
commonly encountered in the oil and gas industry, as the basis for comparing
the aforementioned two approaches. An expanded mixed finite element formulation
is used to separate the spatial scales between non-linear, flow and transport
problems. To the author's knowledge this is the first time these approaches
have been described for a practical non-linear, multiphase flow problem of
interest. A numerical benchmark is setup using fine scale property information
from the 10$^{th}$ SPE comparative project dataset for the purpose of comparing
accuracies of these two schemes. An adaptive criterion is employed in by both
the schemes for local enrichment that allows us to preserve solution accuracy
compared to the fine scale benchmark problem. The numerical results indicate
that both schemes are able to adequately capture the fine scale features of the
model problem at hand.
|
math.NA
|
numerical simulations for flow and transport in subsurface porous media often prove computationally prohibitive due to property data availability at multiple spatial scales that can vary by orders of magnitude a number of model order reduction approaches are available in the existing literature that alleviate this issue by approximating the solution at a coarse scale we attempt to present a comparison between two such model order reduction techniques namely 1 adaptive numerical homogenization and 2 generalized multiscale basis functions we rely upon a nonlinear multiphase blackoil model formulation commonly encountered in the oil and gas industry as the basis for comparing the aforementioned two approaches an expanded mixed finite element formulation is used to separate the spatial scales between nonlinear flow and transport problems to the authors knowledge this is the first time these approaches have been described for a practical nonlinear multiphase flow problem of interest a numerical benchmark is setup using fine scale property information from the 10th spe comparative project dataset for the purpose of comparing accuracies of these two schemes an adaptive criterion is employed in by both the schemes for local enrichment that allows us to preserve solution accuracy compared to the fine scale benchmark problem the numerical results indicate that both schemes are able to adequately capture the fine scale features of the model problem at hand
|
[['numerical', 'simulations', 'for', 'flow', 'and', 'transport', 'in', 'subsurface', 'porous', 'media', 'often', 'prove', 'computationally', 'prohibitive', 'due', 'to', 'property', 'data', 'availability', 'at', 'multiple', 'spatial', 'scales', 'that', 'can', 'vary', 'by', 'orders', 'of', 'magnitude', 'a', 'number', 'of', 'model', 'order', 'reduction', 'approaches', 'are', 'available', 'in', 'the', 'existing', 'literature', 'that', 'alleviate', 'this', 'issue', 'by', 'approximating', 'the', 'solution', 'at', 'a', 'coarse', 'scale', 'we', 'attempt', 'to', 'present', 'a', 'comparison', 'between', 'two', 'such', 'model', 'order', 'reduction', 'techniques', 'namely', '1', 'adaptive', 'numerical', 'homogenization', 'and', '2', 'generalized', 'multiscale', 'basis', 'functions', 'we', 'rely', 'upon', 'a', 'nonlinear', 'multiphase', 'blackoil', 'model', 'formulation', 'commonly', 'encountered', 'in', 'the', 'oil', 'and', 'gas', 'industry', 'as', 'the', 'basis', 'for', 'comparing', 'the', 'aforementioned', 'two', 'approaches', 'an', 'expanded', 'mixed', 'finite', 'element', 'formulation', 'is', 'used', 'to', 'separate', 'the', 'spatial', 'scales', 'between', 'nonlinear', 'flow', 'and', 'transport', 'problems', 'to', 'the', 'authors', 'knowledge', 'this', 'is', 'the', 'first', 'time', 'these', 'approaches', 'have', 'been', 'described', 'for', 'a', 'practical', 'nonlinear', 'multiphase', 'flow', 'problem', 'of', 'interest', 'a', 'numerical', 'benchmark', 'is', 'setup', 'using', 'fine', 'scale', 'property', 'information', 'from', 'the', '10th', 'spe', 'comparative', 'project', 'dataset', 'for', 'the', 'purpose', 'of', 'comparing', 'accuracies', 'of', 'these', 'two', 'schemes', 'an', 'adaptive', 'criterion', 'is', 'employed', 'in', 'by', 'both', 'the', 'schemes', 'for', 'local', 'enrichment', 'that', 'allows', 'us', 'to', 'preserve', 'solution', 'accuracy', 'compared', 'to', 'the', 'fine', 'scale', 'benchmark', 'problem', 'the', 'numerical', 'results', 'indicate', 'that', 'both', 'schemes', 'are', 'able', 'to', 'adequately', 'capture', 'the', 'fine', 'scale', 'features', 'of', 'the', 'model', 'problem', 'at', 'hand']]
|
[-0.05659239998347264, 0.022543999492926858, -0.08500397943102257, 0.07298588728915374, -0.06320766485379717, -0.11827682265374943, -0.010999397876893793, 0.38751331765221375, -0.3111509500831499, -0.33758521240388334, 0.13827696724506638, -0.2591323449011843, -0.11358740275559713, 0.20697650701776482, -0.04009998910705404, 0.12460419924662453, 0.05911588709490299, -0.04556216099800651, -0.07103139214267779, -0.2448037877478407, 0.3162879245481015, 0.053896904907882584, 0.32377202351548345, 0.053259646006329445, 0.11239882905268911, -0.07397493502232684, -0.07961526483447696, 0.06122840234734151, -0.12763925179520166, 0.13021849035838778, 0.26956369131573815, 0.0816965130185959, 0.3179198216371272, -0.45392206281156283, -0.2570235033972698, 0.07200429668846318, 0.14426384763499814, 0.1257670229246564, -0.025199085837355376, -0.2141915520072618, 0.08654027516095411, -0.16771936155813894, -0.10921041734909195, -0.09944634241440371, -0.04835913952799188, -0.00025674281537432575, -0.3043175649457515, 0.09151347419544595, 0.022588129673203276, 0.05559792937585591, -0.05598335828441049, -0.10086852543561348, 0.030914291060809465, 0.1298873876644332, 0.039613755036671666, -0.015967887727598003, 0.08265424167607899, -0.11548993774510151, -0.11582194077114119, 0.4041705161015683, -0.058433728133883714, -0.22986712225873623, 0.21813060696165792, -0.05862500820822613, -0.12905344217096879, 0.14662302984551195, 0.2021572427790729, 0.14021840461241625, -0.14027770598483744, 0.05155053899434605, -0.0394637108897381, 0.20632648422077898, 0.044676868863103104, 0.001167418788116208, 0.12262375108822512, 0.21682853174537856, 0.06795801275468227, 0.08286458160937032, -0.07917350641923702, -0.12531842919893463, -0.25965951518662017, -0.10536232221069758, -0.16274571023680973, -0.026095304980606776, -0.10777954079786048, -0.12539351021353104, 0.36493371598915336, 0.21302417812726956, 0.1659606529479103, 0.025173885330156895, 0.323392852566585, 0.08253145126172763, 0.0541949858680167, 0.06498110354376849, 0.2070580622903802, 0.0825322538900352, 0.122393023261838, -0.22521504220049493, 0.0630671355169634, 0.116846714468439]
|
1,803.03722
|
Random Partitions and Cohen-Lenstra Heuristics
|
We investigate combinatorial properties of a family of probability
distributions on finite abelian p-groups. This family includes several
well-known distributions as specializations. These specializations have been
studied in the context of Cohen-Lenstra heuristics and cokernels of families of
random p-adic matrices.
|
math.NT math.CO math.PR
|
we investigate combinatorial properties of a family of probability distributions on finite abelian pgroups this family includes several wellknown distributions as specializations these specializations have been studied in the context of cohenlenstra heuristics and cokernels of families of random padic matrices
|
[['we', 'investigate', 'combinatorial', 'properties', 'of', 'a', 'family', 'of', 'probability', 'distributions', 'on', 'finite', 'abelian', 'pgroups', 'this', 'family', 'includes', 'several', 'wellknown', 'distributions', 'as', 'specializations', 'these', 'specializations', 'have', 'been', 'studied', 'in', 'the', 'context', 'of', 'cohenlenstra', 'heuristics', 'and', 'cokernels', 'of', 'families', 'of', 'random', 'padic', 'matrices']]
|
[-0.1563476538257219, 0.09397373191739727, -0.12156971873397507, 0.1418192672923707, -0.09302148808975046, -0.0780638168202486, -0.018888912140959647, 0.3833307338106196, -0.3015382462521879, -0.2723695675660742, 0.04786106591714864, -0.23900867757819047, -0.14405341046612438, 0.21673569589762426, -0.13105957793844183, 0.12070277400269377, -0.0331144059167766, 0.06217806940762008, -0.11265231658993488, -0.353908614141912, 0.40592285318345556, -0.06085416179422925, 0.2648930122348957, 0.005429767889947426, 0.061213764634619396, 0.03582912121286116, -0.0700441143225606, -0.013104729127229714, -0.18225711454614635, 0.09810754899844164, 0.31784308572277065, 0.0961223316503825, 0.24759968486046646, -0.29669460726947317, -0.2099212378308904, 0.26513045944455194, 0.12154256725093214, 0.036145183575771206, -0.08125783704368897, -0.2333078636083661, 0.09087385099790082, -0.2525773823840498, -0.16139294211639138, -0.1187874593022393, 0.05451344903104189, 0.16401327383227465, -0.2069610242800015, -0.03377429409543189, 0.09673150859364285, 0.1632282658502823, -0.009777966046296969, -0.27540009087178763, 0.04035310976479838, 0.04169188509127352, 0.04394409771463493, -0.12217492586365197, 0.05412255033350936, -0.11329197873952003, -0.2441941992629592, 0.3454061012073397, -0.0027425806605961265, -0.21069334365609216, 0.1801656740604014, -0.14498615878202567, -0.2762365947000501, 0.08227040853760229, 0.16818296400512137, 0.20562181739908894, -0.084208873373161, 0.18997469233070705, -0.18264825333182405, -0.01972451024666065, 0.1463167372318666, 0.05168654587937564, 0.13306415864698043, 0.025935918683322463, 0.0033048257152209193, 0.2361817579807305, 0.029838092335522537, -0.12999605490803356, -0.2788208910212966, -0.13002447892979876, -0.1565888170834358, 0.08240985250236785, -0.13049506552754503, -0.24074781533875844, 0.4850541509506179, 0.0793567446469352, 0.17205953270923802, 0.1698920810140851, 0.11460041647731531, 0.048521425117874835, 0.04428574662064997, 0.01142855061263573, 0.05109037957494942, 0.2589005709784787, -0.08171902232371815, -0.08394516125412249, 0.06990954123590733, 0.19478624234566602]
|
1,803.03723
|
Design, construction, and characterization of a compact DD neutron
generator designed for 40Ar/39Ar geochronology
|
A next-generation, high-flux DD neutron generator has been designed,
commissioned, and characterized, and is now operational in a new facility at
the University of California Berkeley. The generator, originally designed for
40Ar/39Ar dating of geological materials, has since served numerous additional
applications, including medical isotope production studies, with others planned
for the near future. In this work, we present an overview of the High Flux
Neutron Generator (HFNG) which includes a variety of simulations, analytical
models, and experimental validation of results. Extensive analysis was
performed in order to characterize the neutron yield, flux, and energy
distribution at specific locations where samples may be loaded for irradiation.
A notable design feature of the HFNG is the possibility for sample irradiation
internal to the cathode, just 8 mm away from the neutron production site, thus
maximizing the neutron flux (n/cm2/s). The generator's maximum neutron flux at
this irradiation position is 2.58e7 n/cm2/s +/- 5% (approximately 3e8 n/s total
yield) as measured via activation of small natural indium foils. However,
future development is aimed at achieving an order of magnitude increase in
flux. Additionally, the deuterium ion beam optics were optimized by simulations
for various extraction configurations in order to achieve a uniform neutron
flux distribution and an acceptable heat load. Finally, experiments were
performed in order to benchmark the modeling and characterization of the HFNG.
|
physics.acc-ph
|
a nextgeneration highflux dd neutron generator has been designed commissioned and characterized and is now operational in a new facility at the university of california berkeley the generator originally designed for 40ar39ar dating of geological materials has since served numerous additional applications including medical isotope production studies with others planned for the near future in this work we present an overview of the high flux neutron generator hfng which includes a variety of simulations analytical models and experimental validation of results extensive analysis was performed in order to characterize the neutron yield flux and energy distribution at specific locations where samples may be loaded for irradiation a notable design feature of the hfng is the possibility for sample irradiation internal to the cathode just 8 mm away from the neutron production site thus maximizing the neutron flux ncm2s the generators maximum neutron flux at this irradiation position is 258e7 ncm2s 5 approximately 3e8 ns total yield as measured via activation of small natural indium foils however future development is aimed at achieving an order of magnitude increase in flux additionally the deuterium ion beam optics were optimized by simulations for various extraction configurations in order to achieve a uniform neutron flux distribution and an acceptable heat load finally experiments were performed in order to benchmark the modeling and characterization of the hfng
|
[['a', 'nextgeneration', 'highflux', 'dd', 'neutron', 'generator', 'has', 'been', 'designed', 'commissioned', 'and', 'characterized', 'and', 'is', 'now', 'operational', 'in', 'a', 'new', 'facility', 'at', 'the', 'university', 'of', 'california', 'berkeley', 'the', 'generator', 'originally', 'designed', 'for', '40ar39ar', 'dating', 'of', 'geological', 'materials', 'has', 'since', 'served', 'numerous', 'additional', 'applications', 'including', 'medical', 'isotope', 'production', 'studies', 'with', 'others', 'planned', 'for', 'the', 'near', 'future', 'in', 'this', 'work', 'we', 'present', 'an', 'overview', 'of', 'the', 'high', 'flux', 'neutron', 'generator', 'hfng', 'which', 'includes', 'a', 'variety', 'of', 'simulations', 'analytical', 'models', 'and', 'experimental', 'validation', 'of', 'results', 'extensive', 'analysis', 'was', 'performed', 'in', 'order', 'to', 'characterize', 'the', 'neutron', 'yield', 'flux', 'and', 'energy', 'distribution', 'at', 'specific', 'locations', 'where', 'samples', 'may', 'be', 'loaded', 'for', 'irradiation', 'a', 'notable', 'design', 'feature', 'of', 'the', 'hfng', 'is', 'the', 'possibility', 'for', 'sample', 'irradiation', 'internal', 'to', 'the', 'cathode', 'just', '8', 'mm', 'away', 'from', 'the', 'neutron', 'production', 'site', 'thus', 'maximizing', 'the', 'neutron', 'flux', 'ncm2s', 'the', 'generators', 'maximum', 'neutron', 'flux', 'at', 'this', 'irradiation', 'position', 'is', '258e7', 'ncm2s', '5', 'approximately', '3e8', 'ns', 'total', 'yield', 'as', 'measured', 'via', 'activation', 'of', 'small', 'natural', 'indium', 'foils', 'however', 'future', 'development', 'is', 'aimed', 'at', 'achieving', 'an', 'order', 'of', 'magnitude', 'increase', 'in', 'flux', 'additionally', 'the', 'deuterium', 'ion', 'beam', 'optics', 'were', 'optimized', 'by', 'simulations', 'for', 'various', 'extraction', 'configurations', 'in', 'order', 'to', 'achieve', 'a', 'uniform', 'neutron', 'flux', 'distribution', 'and', 'an', 'acceptable', 'heat', 'load', 'finally', 'experiments', 'were', 'performed', 'in', 'order', 'to', 'benchmark', 'the', 'modeling', 'and', 'characterization', 'of', 'the', 'hfng']]
|
[-0.05138967528952943, 0.13851806279702472, -0.03893244445821211, 0.039512879026598585, -0.0318675188893427, -0.10038023217627567, 0.04737105455810027, 0.38603443018586386, -0.18566358736105162, -0.3872677730912621, 0.10171819359329592, -0.3236114307732334, 0.008636286054480804, 0.25736398095469415, -0.018124295578746976, 0.09540354838695933, 0.09353165576714871, 0.022449710883086386, -0.07410090692240978, -0.20831694197103515, 0.24101815442870714, 0.20167616830308546, 0.31414210409920545, 0.0702941593570778, 0.0944959432375512, -0.03147320027162354, -0.03945311342684207, -0.033168647895520764, -0.12007584069682732, 0.06759800740103637, 0.2802794802987694, 0.10173555033605934, 0.2006790656132868, -0.4513174069506931, -0.21995720442287556, 0.08114310662152574, 0.08925416833158516, 0.052269337766835934, -0.10592734638869665, -0.21795632071767795, 0.07428867612992797, -0.1903279235521205, -0.13620822859835302, -0.03159903569675864, 0.024791374688807925, 0.0658657784859241, -0.29471420043894003, -0.00019421416747792544, 0.0011138936643787908, 0.08980312684921725, -0.08411147098406745, -0.1717590090683851, -0.005160000841596851, 0.0923164998891245, 0.009901197647730656, 0.07028000848262457, 0.1705066261260467, -0.11888132239607631, -0.0929793824896857, 0.32817893208118315, -0.028427809449197195, -0.06981247787393326, 0.15673846592157406, -0.16363443921602486, -0.12943804184316207, 0.1837695092047097, 0.18258530143290186, 0.11491040110891491, -0.2101541265331175, -0.007625904098064617, 0.022237097351428342, 0.16675943274841956, 0.10853258516361339, -0.005950856640696845, 0.24782893381911705, 0.262443282946468, 0.005027494473884312, 0.14776728461014277, -0.19953403732111483, -0.029363433437472487, -0.2817443089445893, -0.1315113373861408, -0.1383414592518054, 0.05153544761537578, -0.022079206592897457, -0.09759257793652629, 0.35289125830541906, 0.11163754291508222, 0.11949059030049528, -0.04678849996951497, 0.28272142474132916, 0.07472513308716996, 0.08311428506218627, 0.03576774427422841, 0.24973524986382792, 0.12251543031048821, 0.14442711749785198, -0.2352415675442767, 0.07663146664948957, -0.014214002542045997]
|
1,803.03724
|
Contour Parametrization via Anisotropic Mean Curvature Flows
|
We present a new implementation of anisotropic mean curvature flow for
contour recognition. Our procedure couples the mean curvature flow of planar
closed smooth curves, with an external field from a potential of point-wise
charges. This coupling constrains the motion when the curve matches a picture
placed as background. We include a stability criteria for our numerical
approximation.
|
math.DG cs.CG cs.CV math.AP math.NA
|
we present a new implementation of anisotropic mean curvature flow for contour recognition our procedure couples the mean curvature flow of planar closed smooth curves with an external field from a potential of pointwise charges this coupling constrains the motion when the curve matches a picture placed as background we include a stability criteria for our numerical approximation
|
[['we', 'present', 'a', 'new', 'implementation', 'of', 'anisotropic', 'mean', 'curvature', 'flow', 'for', 'contour', 'recognition', 'our', 'procedure', 'couples', 'the', 'mean', 'curvature', 'flow', 'of', 'planar', 'closed', 'smooth', 'curves', 'with', 'an', 'external', 'field', 'from', 'a', 'potential', 'of', 'pointwise', 'charges', 'this', 'coupling', 'constrains', 'the', 'motion', 'when', 'the', 'curve', 'matches', 'a', 'picture', 'placed', 'as', 'background', 'we', 'include', 'a', 'stability', 'criteria', 'for', 'our', 'numerical', 'approximation']]
|
[-0.1718620180056013, 0.0604523499759721, -0.12796703016321206, 0.028439266179640103, -0.08708749355041775, -0.11291245285196808, 0.00589080242809422, 0.3823407117020467, -0.23683693247108623, -0.2620416818315099, 0.0653526626671825, -0.2505980462542382, -0.1451903924843746, 0.22965864612367645, -0.0877618935794152, 0.03553597237272509, 0.06136864292884952, 0.07980085324881406, -0.058573689568659354, -0.2030813324200953, 0.29683422482700955, -0.00700113042418299, 0.2710403704148685, 0.07057641576855155, 0.11454227891879092, 0.018486117984264576, 0.020308947094298643, 0.08401799681275313, -0.17885112476631485, 0.1376847149362659, 0.10898495987378831, 0.04339354318277589, 0.21202432110520272, -0.38855944143543986, -0.2562460907060525, 0.06308432398685093, 0.13245289931716075, 0.12067196855385756, -0.10816551868578997, -0.2781106282571523, 0.01062827245011155, -0.0926998487938645, -0.20545416212929735, -0.08589317949472702, -0.011903037419462383, 0.02477556434941703, -0.29607410663096556, 0.11079593864269555, 0.07441547439144604, 0.0965963458835051, -0.1246419957806838, -0.0711441661295449, -0.011727679191671055, 0.11518909312345103, 0.05260677532903079, 0.08286601445509185, 0.1423449132527257, -0.17926940674781158, -0.07364348116619833, 0.35480265617210033, -0.14508620011299078, -0.26811064301251336, 0.10457142492242415, -0.08066738688322747, -0.06570198400556271, 0.16363647418771068, 0.21095375633188362, 0.1677668842984813, -0.1361296286232918, 0.1033359497769511, -0.010949190047665917, 0.14115275879358424, 0.03163462529633323, -0.06107109563489412, 0.2445979368840826, 0.1503327210746898, 0.09831651199030979, 0.1620349927889665, -0.11428503844694331, -0.10190622277300933, -0.42870607281681794, -0.13726135190769, -0.12123017478734255, 0.07450793032405963, -0.17147823363735243, -0.23242428049380923, 0.40774986805426405, 0.09895457142707088, 0.18360968097113073, 0.10323824367389597, 0.33078690511495645, 0.10343495029193381, 0.0251732204276401, 0.1269640855748078, 0.27698853986683014, 0.15937543528732553, 0.05177990804779632, -0.22095854883885074, -0.03263379902386203, 0.0971689885482192]
|
1,803.03725
|
Dynamically Efficient Kinematics for Hyper-Redundant Manipulators
|
A hyper-redundant robotic arm is a manipulator with many degrees of freedom,
capable of executing tasks in cluttered environments where robotic arms with
fewer degrees of freedom are unable to operate. This paper introduces a new
method for modeling those manipulators in a completely dynamic way. The
proposed method enables online changes of the kinematic structure with the use
of a special function; termed "meta-controlling function". This function can be
used to develop policies to reduce drastically the computational cost for a
single task, and to robustly control the robotic arm, even in the event of
partial damage. The direct and inverse kinematics are solved for a generic
three-dimensional articulated hyper-redundant arm, that can be used as a proof
of concept for more specific structures. To demonstrate the robustness of our
method, experimental simulation results, for a basic "meta-controlling"
function, are presented.
|
cs.RO
|
a hyperredundant robotic arm is a manipulator with many degrees of freedom capable of executing tasks in cluttered environments where robotic arms with fewer degrees of freedom are unable to operate this paper introduces a new method for modeling those manipulators in a completely dynamic way the proposed method enables online changes of the kinematic structure with the use of a special function termed metacontrolling function this function can be used to develop policies to reduce drastically the computational cost for a single task and to robustly control the robotic arm even in the event of partial damage the direct and inverse kinematics are solved for a generic threedimensional articulated hyperredundant arm that can be used as a proof of concept for more specific structures to demonstrate the robustness of our method experimental simulation results for a basic metacontrolling function are presented
|
[['a', 'hyperredundant', 'robotic', 'arm', 'is', 'a', 'manipulator', 'with', 'many', 'degrees', 'of', 'freedom', 'capable', 'of', 'executing', 'tasks', 'in', 'cluttered', 'environments', 'where', 'robotic', 'arms', 'with', 'fewer', 'degrees', 'of', 'freedom', 'are', 'unable', 'to', 'operate', 'this', 'paper', 'introduces', 'a', 'new', 'method', 'for', 'modeling', 'those', 'manipulators', 'in', 'a', 'completely', 'dynamic', 'way', 'the', 'proposed', 'method', 'enables', 'online', 'changes', 'of', 'the', 'kinematic', 'structure', 'with', 'the', 'use', 'of', 'a', 'special', 'function', 'termed', 'metacontrolling', 'function', 'this', 'function', 'can', 'be', 'used', 'to', 'develop', 'policies', 'to', 'reduce', 'drastically', 'the', 'computational', 'cost', 'for', 'a', 'single', 'task', 'and', 'to', 'robustly', 'control', 'the', 'robotic', 'arm', 'even', 'in', 'the', 'event', 'of', 'partial', 'damage', 'the', 'direct', 'and', 'inverse', 'kinematics', 'are', 'solved', 'for', 'a', 'generic', 'threedimensional', 'articulated', 'hyperredundant', 'arm', 'that', 'can', 'be', 'used', 'as', 'a', 'proof', 'of', 'concept', 'for', 'more', 'specific', 'structures', 'to', 'demonstrate', 'the', 'robustness', 'of', 'our', 'method', 'experimental', 'simulation', 'results', 'for', 'a', 'basic', 'metacontrolling', 'function', 'are', 'presented']]
|
[-0.11857297659568888, 0.039872049457127495, -0.09178325060555445, 0.003347260524086388, -0.1432731373734506, -0.13429203671735845, 0.014104050257343001, 0.4009220885179405, -0.26545265280375524, -0.35972034156854665, 0.0704855731297617, -0.1875050699255163, -0.1998533968081964, 0.2219401107302734, -0.10944503862410784, 0.10527148766310088, 0.07803436124564282, -0.00394173254857638, -0.04003796660815299, -0.20943283616797997, 0.2507064525079581, 0.03146951768347728, 0.22005515211660948, -0.007846762083603867, 0.15830365820521755, 0.040245933451556734, 0.026130373622956022, 0.033463475620374085, -0.0650828660703285, 0.13806544469766127, 0.31449906872585415, 0.14729807993197547, 0.2936084736221736, -0.41749553440936976, -0.20562075477625644, 0.06479543446995584, 0.14855674207543157, 0.10484472444305928, -0.03464062799518745, -0.2895064270705916, 0.09405111040188266, -0.17863430639508807, -0.16225506214957153, -0.09496319140889682, -0.028098923646445784, 0.01718193292950413, -0.3084525013446442, 0.02182667825171458, 0.00575668516602101, 0.0670854543252582, -0.01150341531028971, -0.08337528094250177, 0.022497863929519163, 0.1629384445591963, -0.011834210771069463, 0.035380509745196576, 0.1792185549025557, -0.16962824510576735, -0.1499590376791145, 0.40949408880634497, 0.026265589655044354, -0.2757897767437888, 0.22935608656137316, -0.08650032129205232, -0.14143165059919868, 0.1338159142236691, 0.22584147363834614, 0.17026637802565736, -0.1744092718502673, 0.017273741206320536, -0.03523558205259698, 0.1649721627659996, 0.013878086335690959, -0.0007960215111130051, 0.1585173160101736, 0.20224392857178047, 0.10870697181297666, 0.17809888427478393, -0.07647994827878263, -0.09203127170912921, -0.2753363829571754, -0.15449899536324666, -0.13145414236766687, -0.03744081434062017, -0.07808039668161655, -0.1243989291800452, 0.3927133089988014, 0.16844025759928627, 0.1995282551440011, 0.07935784125833639, 0.3492356111162475, 0.05286807371636054, 0.11778541135801268, 0.07099379598720199, 0.2077911471981289, 0.03790089501334088, 0.08590713228498187, -0.22659633280044156, 0.1028768368847003, 0.006397783340487097]
|
1,803.03726
|
A new route to finding bounds on the generalized spectrum of many
physical operators
|
Here we obtain bounds on the spectrum of that operator whose inverse, when it
exists, gives the Green's function. We consider the wide of physical problems
that can be cast in a form where a constitutive equation ${\bf J}({\bf x})={\bf
L}({\bf x}){\bf E}({\bf x})-{\bf h}({\bf x})$ with a source term ${\bf h}({\bf
x})$ holds for all ${\bf x}$ in some domain $\Omega$, and relates fields ${\bf
E}$ and ${\bf J}$ that satisfy appropriate differential constraints, symbolized
by ${\bf E}\in\cal{E}_\Omega$ and ${\bf J}\in\cal{J}_\Omega$ where
$\cal{E}_\Omega$ and $\cal{J}_\Omega$ are orthogonal spaces that span the space
$\cal{H}_\Omega$ of square-integrable fields in which ${\bf h}$ lies.
Boundedness and coercivity conditions on the moduli ${\bf L}({\bf x})$ ensure
there exists a unique ${\bf E}$ for any given ${\bf h}$, i.e., ${\bf E}={\bf
G}_\Omega{\bf h}$ which then establishes the existence of the Green's function
${\bf G}_\Omega$. We show that the coercivity condition is guaranteed to hold
if weaker conditions, involving generalized quasiconvex functions, are
satisfied. The advantage is that these weaker conditions are easier to verify,
and for multiphase materials they can be independent of the geometry of the
phases. For ${\bf L}({\bf x} )$ depending linearly on a vector of parameters
${\bf z}=(z_1, z_2,\ldots, z_n)$, we obtain constraints on ${\bf z}$ that
ensure the Green's function exists, and hence which provide bounds on the
spectrum.
|
math-ph math.MP
|
here we obtain bounds on the spectrum of that operator whose inverse when it exists gives the greens function we consider the wide of physical problems that can be cast in a form where a constitutive equation bf jbf xbf lbf xbf ebf xbf hbf x with a source term bf hbf x holds for all bf x in some domain omega and relates fields bf e and bf j that satisfy appropriate differential constraints symbolized by bf eincale_omega and bf jincalj_omega where cale_omega and calj_omega are orthogonal spaces that span the space calh_omega of squareintegrable fields in which bf h lies boundedness and coercivity conditions on the moduli bf lbf x ensure there exists a unique bf e for any given bf h ie bf ebf g_omegabf h which then establishes the existence of the greens function bf g_omega we show that the coercivity condition is guaranteed to hold if weaker conditions involving generalized quasiconvex functions are satisfied the advantage is that these weaker conditions are easier to verify and for multiphase materials they can be independent of the geometry of the phases for bf lbf x depending linearly on a vector of parameters bf zz_1 z_2ldots z_n we obtain constraints on bf z that ensure the greens function exists and hence which provide bounds on the spectrum
|
[['here', 'we', 'obtain', 'bounds', 'on', 'the', 'spectrum', 'of', 'that', 'operator', 'whose', 'inverse', 'when', 'it', 'exists', 'gives', 'the', 'greens', 'function', 'we', 'consider', 'the', 'wide', 'of', 'physical', 'problems', 'that', 'can', 'be', 'cast', 'in', 'a', 'form', 'where', 'a', 'constitutive', 'equation', 'bf', 'jbf', 'xbf', 'lbf', 'xbf', 'ebf', 'xbf', 'hbf', 'x', 'with', 'a', 'source', 'term', 'bf', 'hbf', 'x', 'holds', 'for', 'all', 'bf', 'x', 'in', 'some', 'domain', 'omega', 'and', 'relates', 'fields', 'bf', 'e', 'and', 'bf', 'j', 'that', 'satisfy', 'appropriate', 'differential', 'constraints', 'symbolized', 'by', 'bf', 'eincale_omega', 'and', 'bf', 'jincalj_omega', 'where', 'cale_omega', 'and', 'calj_omega', 'are', 'orthogonal', 'spaces', 'that', 'span', 'the', 'space', 'calh_omega', 'of', 'squareintegrable', 'fields', 'in', 'which', 'bf', 'h', 'lies', 'boundedness', 'and', 'coercivity', 'conditions', 'on', 'the', 'moduli', 'bf', 'lbf', 'x', 'ensure', 'there', 'exists', 'a', 'unique', 'bf', 'e', 'for', 'any', 'given', 'bf', 'h', 'ie', 'bf', 'ebf', 'g_omegabf', 'h', 'which', 'then', 'establishes', 'the', 'existence', 'of', 'the', 'greens', 'function', 'bf', 'g_omega', 'we', 'show', 'that', 'the', 'coercivity', 'condition', 'is', 'guaranteed', 'to', 'hold', 'if', 'weaker', 'conditions', 'involving', 'generalized', 'quasiconvex', 'functions', 'are', 'satisfied', 'the', 'advantage', 'is', 'that', 'these', 'weaker', 'conditions', 'are', 'easier', 'to', 'verify', 'and', 'for', 'multiphase', 'materials', 'they', 'can', 'be', 'independent', 'of', 'the', 'geometry', 'of', 'the', 'phases', 'for', 'bf', 'lbf', 'x', 'depending', 'linearly', 'on', 'a', 'vector', 'of', 'parameters', 'bf', 'zz_1', 'z_2ldots', 'z_n', 'we', 'obtain', 'constraints', 'on', 'bf', 'z', 'that', 'ensure', 'the', 'greens', 'function', 'exists', 'and', 'hence', 'which', 'provide', 'bounds', 'on', 'the', 'spectrum']]
|
[-0.19318471263373657, 0.10633467370863864, -0.055547431708787974, 0.000989356784387228, -0.09733745525041947, -0.12488591122959372, 0.02755829079772943, 0.35274765020201226, -0.2616774670621556, -0.20770579996685726, 0.08793459821054228, -0.20247813028858355, -0.12999615509761497, 0.19047017249373174, -0.045556142414977144, -0.0022671963038792798, -0.014596146143718078, 0.03856979454727514, -0.10909601349223247, -0.25928805215956363, 0.2877777061108851, -0.07212116231291801, 0.24657919238728387, 0.04830106793032994, 0.15436334357671616, 0.03965604322839458, 0.03816928978095639, -0.006425530515871459, -0.20247609371698724, 0.03836438096406263, 0.224506041690716, 0.12606207122457216, 0.21400068329981053, -0.36577448818858993, -0.16263169369964123, 0.15550183128776415, 0.06594181497183733, -0.049648593440717786, 0.04404417098882028, -0.26753166482403856, 0.15889993329413832, -0.07255111218271952, -0.07281572791036078, -0.10518345215032755, 0.13536591508715712, 0.050985709388459206, -0.4152530261737136, 0.10424714358545453, 0.1137387743538228, 0.004334126800800595, -0.06381228186392207, -0.14988633101577606, -0.09460738429114363, 0.008623501709426253, 0.009733549872180447, 0.15907364458497503, 0.0712806950290336, -0.11066698007953335, -0.03446467337418207, 0.394226252984361, -0.05757019698909783, -0.26410916394923095, 0.14690648230975537, -0.14503989332770975, -0.11835088699678276, 0.08116856031339476, 0.15956799238964142, 0.13247685346978647, -0.10847109302205422, 0.2583874033323054, -0.12016789585693502, 0.12670264793296326, 0.0678942210396822, 0.038007081115073615, 0.11510204913244003, 0.01227483891701888, 0.11307556498883609, 0.07341338156718093, -0.03730361989835488, -0.02996180189047492, -0.40819927833025466, -0.16750280069898954, -0.21132436818124745, 0.12536407257254534, -0.06389339491984432, -0.16632283210011972, 0.3301063610234228, 0.12477315947433214, 0.18729976167955067, 0.03677986176269357, 0.13591548031852757, 0.1638705948376501, -0.00674232317986986, 0.1630754400251152, 0.17464369702944202, 0.16787491330573828, 0.05924241341659272, -0.14858256252855942, 0.008181313683173427, 0.08220921785412531]
|
1,803.03727
|
Thermal Management in Fine-Grained 3-D Integrated Circuits
|
For beyond 2-D CMOS logic, various 3-D integration approaches specially
transistor based 3-D integrations such as monolithic 3-D [1], Skybridge [2],
SN3D [3] holds most promise. However, such 3D architectures within small form
factor increase hotspots and demand careful consideration of thermal management
at all levels of integration [4] as stacked transistors are detached from the
substrate (i.e., heat sink). Traditional system level approaches such as liquid
cooling [5], heat spreader [6], etc. are inadequate for transistor level 3-D
integration and have huge cost overhead [7]. In this paper, we investigate the
thermal profile for transistor level 3-D integration approaches through finite
element based modeling. Additionally, we propose generic physical level heat
management features for such transistor level 3-D integration and show their
application through detailed thermal modeling and simulations. These features
include a thermal junction and heat conducting nano pillar. The heat junction
is a specialized junction to extract heat from a selected region in 3-D; it
allows heat conduction without interference with the electrical activities of
the circuit. In conjunction with the junction, our proposed thermal pillars
enable heat dissipation through the substrate; these pillars are analogous to
TSVs/Vias, but carry only heat. Such structures are generic and is applicable
to any transistor level 3-D integration approaches. We perform 3-D finite
element based analysis to capture both static and transient thermal behaviors
of 3-D circuits, and show the effectiveness of heat management features. Our
simulation results show that without any heat extraction feature, temperature
for 3-D integrated circuits increased by almost 100K-200K. However, proposed
heat extraction feature is very effective in heat management, reducing
temperature from heated area by up to 53%.
|
cs.ET
|
for beyond 2d cmos logic various 3d integration approaches specially transistor based 3d integrations such as monolithic 3d 1 skybridge 2 sn3d 3 holds most promise however such 3d architectures within small form factor increase hotspots and demand careful consideration of thermal management at all levels of integration 4 as stacked transistors are detached from the substrate ie heat sink traditional system level approaches such as liquid cooling 5 heat spreader 6 etc are inadequate for transistor level 3d integration and have huge cost overhead 7 in this paper we investigate the thermal profile for transistor level 3d integration approaches through finite element based modeling additionally we propose generic physical level heat management features for such transistor level 3d integration and show their application through detailed thermal modeling and simulations these features include a thermal junction and heat conducting nano pillar the heat junction is a specialized junction to extract heat from a selected region in 3d it allows heat conduction without interference with the electrical activities of the circuit in conjunction with the junction our proposed thermal pillars enable heat dissipation through the substrate these pillars are analogous to tsvsvias but carry only heat such structures are generic and is applicable to any transistor level 3d integration approaches we perform 3d finite element based analysis to capture both static and transient thermal behaviors of 3d circuits and show the effectiveness of heat management features our simulation results show that without any heat extraction feature temperature for 3d integrated circuits increased by almost 100k200k however proposed heat extraction feature is very effective in heat management reducing temperature from heated area by up to 53
|
[['for', 'beyond', '2d', 'cmos', 'logic', 'various', '3d', 'integration', 'approaches', 'specially', 'transistor', 'based', '3d', 'integrations', 'such', 'as', 'monolithic', '3d', '1', 'skybridge', '2', 'sn3d', '3', 'holds', 'most', 'promise', 'however', 'such', '3d', 'architectures', 'within', 'small', 'form', 'factor', 'increase', 'hotspots', 'and', 'demand', 'careful', 'consideration', 'of', 'thermal', 'management', 'at', 'all', 'levels', 'of', 'integration', '4', 'as', 'stacked', 'transistors', 'are', 'detached', 'from', 'the', 'substrate', 'ie', 'heat', 'sink', 'traditional', 'system', 'level', 'approaches', 'such', 'as', 'liquid', 'cooling', '5', 'heat', 'spreader', '6', 'etc', 'are', 'inadequate', 'for', 'transistor', 'level', '3d', 'integration', 'and', 'have', 'huge', 'cost', 'overhead', '7', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'thermal', 'profile', 'for', 'transistor', 'level', '3d', 'integration', 'approaches', 'through', 'finite', 'element', 'based', 'modeling', 'additionally', 'we', 'propose', 'generic', 'physical', 'level', 'heat', 'management', 'features', 'for', 'such', 'transistor', 'level', '3d', 'integration', 'and', 'show', 'their', 'application', 'through', 'detailed', 'thermal', 'modeling', 'and', 'simulations', 'these', 'features', 'include', 'a', 'thermal', 'junction', 'and', 'heat', 'conducting', 'nano', 'pillar', 'the', 'heat', 'junction', 'is', 'a', 'specialized', 'junction', 'to', 'extract', 'heat', 'from', 'a', 'selected', 'region', 'in', '3d', 'it', 'allows', 'heat', 'conduction', 'without', 'interference', 'with', 'the', 'electrical', 'activities', 'of', 'the', 'circuit', 'in', 'conjunction', 'with', 'the', 'junction', 'our', 'proposed', 'thermal', 'pillars', 'enable', 'heat', 'dissipation', 'through', 'the', 'substrate', 'these', 'pillars', 'are', 'analogous', 'to', 'tsvsvias', 'but', 'carry', 'only', 'heat', 'such', 'structures', 'are', 'generic', 'and', 'is', 'applicable', 'to', 'any', 'transistor', 'level', '3d', 'integration', 'approaches', 'we', 'perform', '3d', 'finite', 'element', 'based', 'analysis', 'to', 'capture', 'both', 'static', 'and', 'transient', 'thermal', 'behaviors', 'of', '3d', 'circuits', 'and', 'show', 'the', 'effectiveness', 'of', 'heat', 'management', 'features', 'our', 'simulation', 'results', 'show', 'that', 'without', 'any', 'heat', 'extraction', 'feature', 'temperature', 'for', '3d', 'integrated', 'circuits', 'increased', 'by', 'almost', '100k200k', 'however', 'proposed', 'heat', 'extraction', 'feature', 'is', 'very', 'effective', 'in', 'heat', 'management', 'reducing', 'temperature', 'from', 'heated', 'area', 'by', 'up', 'to', '53']]
|
[-0.09183057742997977, 0.06207173985175734, 0.009158764800625196, -0.0028825303820400115, -0.05983000047854148, -0.18101275851265253, 0.06456598475351176, 0.4054331865079482, -0.24619014890092383, -0.341917398482431, 0.09103090246122413, -0.3126669844153131, -0.12384951650678619, 0.26221357927031075, -0.01682849691272114, 0.09338980694583905, 0.06538670608279062, -0.0430442292631864, -0.0525896760795791, -0.1488353774715078, 0.2806419144852792, 0.069360301747699, 0.3645043749758556, 0.07847990238566555, 0.09066682624432039, -0.04838118021913996, -0.004676815108670031, 0.03751687807380222, -0.083938928004901, 0.09560815162502181, 0.28895075088161426, 0.017539403058917206, 0.21939301421448096, -0.5260941003541708, -0.2974207785429077, 0.00717751900853781, 0.1259207963354557, 0.0987462455249282, -0.05908927088817376, -0.21308132036938332, 0.08759846836876344, -0.166046310292372, -0.05877215186346268, -0.10609329836049308, -0.010971433909349692, 0.010400886636168305, -0.2270068469994893, 0.06273289680297346, 0.06782704722033539, 0.07497562170508043, -0.04961871199831127, -0.12830029195730971, -0.03768968841220211, 0.1580831411124296, -0.06719575794768924, -0.010501235358199612, 0.2512692628986449, -0.14520675410013234, -0.10384104100076537, 0.3393854753470377, -0.04382261841622975, -0.1961952391658783, 0.20098045066975723, -0.10503162088399917, -0.07023131633639637, 0.15741206115704057, 0.14840958949935157, 0.07698991490563939, -0.18569851962520795, 0.042720762310850924, 0.05639503153575146, 0.18421833442827099, 0.06439023260506527, 0.029114670021740226, 0.2418446028510944, 0.2562414522056797, 0.02938852887189783, 0.14926066428426352, -0.15726460336265838, -0.06902676754072994, -0.24792855654959567, -0.20291334398173014, -0.15718328253141783, 0.09342370911283926, -0.09826113342141445, -0.19090421504156171, 0.3454798066681285, 0.21156360378389602, 0.13746397587580278, 0.020382047298720434, 0.35253764423610207, 0.12325612231207368, 0.11604999984025627, 0.1061577853448826, 0.16184809879632667, 0.0849118711266783, 0.16575283253983156, -0.23536509308135412, 0.015767969335737528, 0.006766984555082779]
|
1,803.03728
|
Geodesic nets with three boundary vertices
|
We prove that a geodesic net with three boundary (= unbalanced) vertices on a
non-positively curved plane has at most one balanced vertex. We do not assume
any a priori bound for the degrees of unbalanced vertices. The result seems to
be new even in the Euclidean case. We demonstrate by examples that the result
is not true for metrics of positive curvature on the plane, and that there are
no immediate generalizations of this result for geodesic nets with four
unbalanced vertices.
|
math.MG math.CO math.DG
|
we prove that a geodesic net with three boundary unbalanced vertices on a nonpositively curved plane has at most one balanced vertex we do not assume any a priori bound for the degrees of unbalanced vertices the result seems to be new even in the euclidean case we demonstrate by examples that the result is not true for metrics of positive curvature on the plane and that there are no immediate generalizations of this result for geodesic nets with four unbalanced vertices
|
[['we', 'prove', 'that', 'a', 'geodesic', 'net', 'with', 'three', 'boundary', 'unbalanced', 'vertices', 'on', 'a', 'nonpositively', 'curved', 'plane', 'has', 'at', 'most', 'one', 'balanced', 'vertex', 'we', 'do', 'not', 'assume', 'any', 'a', 'priori', 'bound', 'for', 'the', 'degrees', 'of', 'unbalanced', 'vertices', 'the', 'result', 'seems', 'to', 'be', 'new', 'even', 'in', 'the', 'euclidean', 'case', 'we', 'demonstrate', 'by', 'examples', 'that', 'the', 'result', 'is', 'not', 'true', 'for', 'metrics', 'of', 'positive', 'curvature', 'on', 'the', 'plane', 'and', 'that', 'there', 'are', 'no', 'immediate', 'generalizations', 'of', 'this', 'result', 'for', 'geodesic', 'nets', 'with', 'four', 'unbalanced', 'vertices']]
|
[-0.15750502463339305, 0.12265143758140323, -0.0365796938436333, 0.0882468225616144, -0.11240338802155925, -0.15068242049821448, 0.01987082013724054, 0.4027307070110266, -0.18108357811238754, -0.24964665430711536, 0.10177483715020438, -0.33644818444168423, -0.1837836765945412, 0.18214570808298206, -0.11888535755754608, -0.015266380947162738, 0.14548776672426156, 0.09765816046061312, -0.02487008645988592, -0.2813224860682811, 0.3871247802077361, -0.0704984300309883, 0.21324627634092438, 0.11901468189047058, 0.14120054848083272, 0.01888476310456853, 0.008016198669083235, 0.1143682963873555, -0.14427541993498424, 0.07622113100979931, 0.21904558629342696, 0.1116463597154063, 0.22261234684052264, -0.4019550607630574, -0.20737718990663204, 0.22081344735399797, 0.10650426329386126, 0.11431185890233325, -0.047550910442113514, -0.20947997058207943, 0.13820535428367736, -0.08936711530223852, -0.16535380393516544, -0.016259621170054122, 0.02961985680569963, -0.005741380972833168, -0.22754353356388649, 0.02761336746512026, 0.16613486113889916, 0.01743150738681235, -0.009989515824311571, -0.13048279634659127, -0.04830945909545734, 0.08877509047856509, 0.004859819255837399, 0.07855899634106629, 0.024097738140149087, -0.09165280498493258, -0.14657907147051358, 0.3512896584664903, -0.0354882994348683, -0.3157324473566671, 0.17648853693248295, -0.1761732144031401, -0.14610340053119084, 0.10098767990002228, 0.14778908885583827, 0.16256684361866153, -0.11302242908490504, 0.0755102613752015, -0.1007769692237716, 0.10479292914089633, 0.13962504803345016, -0.0037474524948132655, 0.16546575795211715, 0.0627520443877296, 0.2022858347953865, 0.15549815982074772, -0.019249906387214164, -0.07488566871005588, -0.35552618558314153, -0.14688529441681145, -0.21282670906142945, 0.0950180486858987, -0.15772073186643665, -0.19786220192682089, 0.3523414635394768, 0.08243438233507842, 0.21867638551516505, 0.08484505479246741, 0.26650400139482283, 0.05599027333167813, 0.08885543389109576, 0.15653673268105017, 0.24857652232777783, 0.09134485996498658, 0.007908500242614892, -0.11358436231683122, 0.04215388524164332, 0.1115455617389937]
|
1,803.03729
|
A Large-Scale Multi-Institutional Evaluation of Advanced Discrimination
Algorithms for Buried Threat Detection in Ground Penetrating Radar
|
In this paper we consider the development of algorithms for the automatic
detection of buried threats using ground penetrating radar (GPR) measurements.
GPR is one of the most studied and successful modalities for automatic buried
threat detection (BTD), and a large variety of BTD algorithms have been
proposed for it. Despite this, large-scale comparisons of GPR-based BTD
algorithms are rare in the literature. In this work we report the results of a
multi-institutional effort to develop advanced buried threat detection
algorithms for a real-world GPR BTD system. The effort involved five
institutions with substantial experience with the development of GPR-based BTD
algorithms. In this paper we report the technical details of the advanced
algorithms submitted by each institution, representing their latest technical
advances, and many state-of-the-art GPR-based BTD algorithms. We also report
the results of evaluating the algorithms from each institution on the large
experimental dataset used for development. The experimental dataset comprised
120,000 m^2 of GPR data using surface area, from 13 different lanes across two
US test sites. The data was collected using a vehicle-mounted GPR system, the
variants of which have supplied data for numerous publications. Using these
results, we identify the most successful and common processing strategies among
the submitted algorithms, and make recommendations for GPR-based BTD algorithm
design.
|
cs.CV
|
in this paper we consider the development of algorithms for the automatic detection of buried threats using ground penetrating radar gpr measurements gpr is one of the most studied and successful modalities for automatic buried threat detection btd and a large variety of btd algorithms have been proposed for it despite this largescale comparisons of gprbased btd algorithms are rare in the literature in this work we report the results of a multiinstitutional effort to develop advanced buried threat detection algorithms for a realworld gpr btd system the effort involved five institutions with substantial experience with the development of gprbased btd algorithms in this paper we report the technical details of the advanced algorithms submitted by each institution representing their latest technical advances and many stateoftheart gprbased btd algorithms we also report the results of evaluating the algorithms from each institution on the large experimental dataset used for development the experimental dataset comprised 120000 m2 of gpr data using surface area from 13 different lanes across two us test sites the data was collected using a vehiclemounted gpr system the variants of which have supplied data for numerous publications using these results we identify the most successful and common processing strategies among the submitted algorithms and make recommendations for gprbased btd algorithm design
|
[['in', 'this', 'paper', 'we', 'consider', 'the', 'development', 'of', 'algorithms', 'for', 'the', 'automatic', 'detection', 'of', 'buried', 'threats', 'using', 'ground', 'penetrating', 'radar', 'gpr', 'measurements', 'gpr', 'is', 'one', 'of', 'the', 'most', 'studied', 'and', 'successful', 'modalities', 'for', 'automatic', 'buried', 'threat', 'detection', 'btd', 'and', 'a', 'large', 'variety', 'of', 'btd', 'algorithms', 'have', 'been', 'proposed', 'for', 'it', 'despite', 'this', 'largescale', 'comparisons', 'of', 'gprbased', 'btd', 'algorithms', 'are', 'rare', 'in', 'the', 'literature', 'in', 'this', 'work', 'we', 'report', 'the', 'results', 'of', 'a', 'multiinstitutional', 'effort', 'to', 'develop', 'advanced', 'buried', 'threat', 'detection', 'algorithms', 'for', 'a', 'realworld', 'gpr', 'btd', 'system', 'the', 'effort', 'involved', 'five', 'institutions', 'with', 'substantial', 'experience', 'with', 'the', 'development', 'of', 'gprbased', 'btd', 'algorithms', 'in', 'this', 'paper', 'we', 'report', 'the', 'technical', 'details', 'of', 'the', 'advanced', 'algorithms', 'submitted', 'by', 'each', 'institution', 'representing', 'their', 'latest', 'technical', 'advances', 'and', 'many', 'stateoftheart', 'gprbased', 'btd', 'algorithms', 'we', 'also', 'report', 'the', 'results', 'of', 'evaluating', 'the', 'algorithms', 'from', 'each', 'institution', 'on', 'the', 'large', 'experimental', 'dataset', 'used', 'for', 'development', 'the', 'experimental', 'dataset', 'comprised', '120000', 'm2', 'of', 'gpr', 'data', 'using', 'surface', 'area', 'from', '13', 'different', 'lanes', 'across', 'two', 'us', 'test', 'sites', 'the', 'data', 'was', 'collected', 'using', 'a', 'vehiclemounted', 'gpr', 'system', 'the', 'variants', 'of', 'which', 'have', 'supplied', 'data', 'for', 'numerous', 'publications', 'using', 'these', 'results', 'we', 'identify', 'the', 'most', 'successful', 'and', 'common', 'processing', 'strategies', 'among', 'the', 'submitted', 'algorithms', 'and', 'make', 'recommendations', 'for', 'gprbased', 'btd', 'algorithm', 'design']]
|
[-0.07532842350170506, -0.00522196541339194, -0.03705464317922441, 0.02625827813803048, -0.06239130131751649, -0.12838898900488585, 0.03605868353971888, 0.3869946587813292, -0.16078481902018574, -0.37087351646921446, 0.17280030444684163, -0.30893881138531104, -0.17510160657319246, 0.2673893826510845, -0.09024587561930596, 0.1023565359673782, 0.12817370551397822, -0.007064345461084669, -0.04034128944343612, -0.30186467188707783, 0.26710684358649517, 0.05382856328210885, 0.3308638785506638, 0.04298584531126937, 0.09720366676130328, -0.023180531506194896, -0.11724028131211868, -0.01568400489489937, -0.10327091514670723, 0.16781779985590412, 0.3489726054653779, 0.21706810075146946, 0.32325288990923495, -0.43733794399550263, -0.16852668643013044, 0.09779490400029198, 0.10096325698426702, 0.1049974679049463, -0.09484084954369429, -0.3348892699629768, 0.0528755420895442, -0.185974905796419, -0.04983490076082203, -0.06999250449690565, 0.010914549603730336, 0.005220167355086651, -0.23097583105374442, -0.01160179445218894, -0.0024626803553789993, 0.11915304468498683, -0.0618941527594563, -0.1759011227289923, 0.07371603021236407, 0.18455035649152568, 0.07415604496543064, 0.010677486511620697, 0.1283820478290433, -0.1386125286923013, -0.16634146822616458, 0.3280577424021674, -0.04489391030767766, -0.09693816199706334, 0.23097720437906158, -0.06384726139025963, -0.20991570574882934, 0.13916205107913507, 0.2438453764440448, 0.09280042245955657, -0.18283860939839078, 0.03267765858843529, -0.018253072794579283, 0.13841541678023836, 0.02308665930065042, -0.022475496507271635, 0.1477155826478637, 0.24391533970448054, 0.03435945780833029, 0.13398148900033477, -0.17194156159926643, -0.03566447468343335, -0.2084937457934223, -0.15691627192167792, -0.14684384314457016, -0.04616327735348364, -0.036575858004294456, -0.15354961064068093, 0.3930895060711833, 0.2267824397881476, 0.12846961115626837, 0.01295794003373646, 0.3658816238139437, -0.002627559238498235, 0.08973917715194604, 0.06978142010911582, 0.2156814067469289, 0.04415765255492863, 0.16254265179875102, -0.15883140020649616, 0.09633023172568862, -0.0205219005444415]
|
1,803.0373
|
A White Paper Submitted to The National Academy of Science's Committee
on Exoplanet Science Strategy: Observing Exoplanets with the James Webb Space
Telescope
|
The James Webb Space Telescope (JWST) will revolutionize our understanding of
exoplanets with transit spectroscopy of a wide range of mature planets close to
their host stars ($<$2 AU) and with coronagraphic imaging and spectroscopy of
young objects located further out ($>$10 AU). The census of exoplanets has
revealed an enormous variety of planets orbiting stars of all ages and spectral
types. With TESS adding to this census with its all-sky survey of the closest,
brightest stars, the challenge of the coming decade will be to move from
demography to physical characterization. This white paper discusses the wide
variety of exoplanet opportunities enabled by JWST's sensitivity and stability,
its high angular resolution, and its suite of powerful instruments. JWST
observations will advance our understanding of the atmospheres of young to
mature planets and will provide new insights into planet formation.
|
astro-ph.IM astro-ph.EP astro-ph.SR
|
the james webb space telescope jwst will revolutionize our understanding of exoplanets with transit spectroscopy of a wide range of mature planets close to their host stars 2 au and with coronagraphic imaging and spectroscopy of young objects located further out 10 au the census of exoplanets has revealed an enormous variety of planets orbiting stars of all ages and spectral types with tess adding to this census with its allsky survey of the closest brightest stars the challenge of the coming decade will be to move from demography to physical characterization this white paper discusses the wide variety of exoplanet opportunities enabled by jwsts sensitivity and stability its high angular resolution and its suite of powerful instruments jwst observations will advance our understanding of the atmospheres of young to mature planets and will provide new insights into planet formation
|
[['the', 'james', 'webb', 'space', 'telescope', 'jwst', 'will', 'revolutionize', 'our', 'understanding', 'of', 'exoplanets', 'with', 'transit', 'spectroscopy', 'of', 'a', 'wide', 'range', 'of', 'mature', 'planets', 'close', 'to', 'their', 'host', 'stars', '2', 'au', 'and', 'with', 'coronagraphic', 'imaging', 'and', 'spectroscopy', 'of', 'young', 'objects', 'located', 'further', 'out', '10', 'au', 'the', 'census', 'of', 'exoplanets', 'has', 'revealed', 'an', 'enormous', 'variety', 'of', 'planets', 'orbiting', 'stars', 'of', 'all', 'ages', 'and', 'spectral', 'types', 'with', 'tess', 'adding', 'to', 'this', 'census', 'with', 'its', 'allsky', 'survey', 'of', 'the', 'closest', 'brightest', 'stars', 'the', 'challenge', 'of', 'the', 'coming', 'decade', 'will', 'be', 'to', 'move', 'from', 'demography', 'to', 'physical', 'characterization', 'this', 'white', 'paper', 'discusses', 'the', 'wide', 'variety', 'of', 'exoplanet', 'opportunities', 'enabled', 'by', 'jwsts', 'sensitivity', 'and', 'stability', 'its', 'high', 'angular', 'resolution', 'and', 'its', 'suite', 'of', 'powerful', 'instruments', 'jwst', 'observations', 'will', 'advance', 'our', 'understanding', 'of', 'the', 'atmospheres', 'of', 'young', 'to', 'mature', 'planets', 'and', 'will', 'provide', 'new', 'insights', 'into', 'planet', 'formation']]
|
[-0.046083580339992686, 0.12499638450691626, -0.08361673692041742, 0.02795753042113834, -0.19842960840822862, -0.03846680960351867, 0.08745914578654006, 0.36087991848055806, -0.1906301437211888, -0.41512354342932145, 0.1143377514921927, -0.3009838319183992, -0.10099569673516921, 0.2629865849789764, -0.10954121836195034, 0.016150041255917, 0.1904546926500708, -0.134044321917671, -0.017458307852835527, -0.327171058354101, 0.2715819175587967, 0.14504619129002094, 0.03591319202013048, -0.014348503471618252, 0.035383526600032515, -0.06762605249283037, -0.1150398755612384, -0.061194613510035974, -0.21243308489460366, 0.11112622506916522, 0.31425901926787836, 0.2181726719751688, 0.27469677521315006, -0.34837054773233833, -0.22601585457367557, 0.06773013079405896, 0.17298781677995326, -0.026365430779489024, -0.060158070319864365, -0.35269098561257123, 0.08042769406123886, -0.19518008626930947, -0.24163314003297792, -0.02988027486883636, 0.046880073652469684, 0.052571811227660095, -0.1836253742758085, -0.03725289971916936, 0.009749952647169786, 0.15594819389017564, -0.15086308474502794, -0.14116125235533608, -0.03837818520093736, 0.16915047367427696, -0.05708176922053099, 0.045305715897120534, 0.1323954390494951, -0.15542975831444242, -0.03871929089405707, 0.4047386958367757, -0.081322481875707, 0.04805086234700866, 0.2915486201394482, -0.30536036240934794, -0.12158177541901491, 0.14358267637518501, 0.19140277904059205, 0.1703535649243609, -0.16718245670199394, 0.01758578951121308, 0.035615713488576665, 0.17644116732460263, 0.0579154385187264, 0.13884972564077802, 0.4669693863152393, 0.21705721874854395, 0.09771900839238827, 0.05623345994307394, -0.2868597331523363, -0.028337725524657537, -0.1449848680690463, -0.18865789665308383, -0.13607784808264115, 0.09989851831924171, -0.08630055839249898, -0.11742896473068477, 0.35654341963319375, 0.18705668640988213, 0.11707516360662079, 0.011910580244979688, 0.32296839337795974, -0.02809218010432752, 0.13086765652156568, -0.01050087935956461, 0.3034007168341694, 0.16327972873280358, 0.1357793344983033, -0.17306433079065756, 0.024483154936128165, -0.07124453309391227]
|
1,803.03731
|
Model Structural Inference using Local Dynamic Operators
|
This paper focuses on the problem of quantifying the effects of
model-structure uncertainty in the context of time-evolving dynamical systems.
This is motivated by multi-model uncertainty in computer physics simulations:
developers often make different modeling choices in numerical approximations
and process simplifications, leading to different numerical codes that
ostensibly represent the same underlying dynamics. We consider model-structure
inference as a two-step methodology: the first step is to perform system
identification on numerical codes for which it is possible to observe the full
state; the second step is structural uncertainty quantification (UQ), in which
the goal is to search candidate models "close" to the numerical code surrogates
for those that best match a quantity-of-interest (QOI) from some empirical
dataset. Specifically, we: (1) define a discrete, local representation of the
structure of a partial differential equation, which we refer to as the "local
dynamical operator" (LDO); (2) identify model structure non-intrusively from
numerical code output; (3) non-intrusively construct a reduced order model
(ROM) of the numerical model through POD-DEIM-Galerkin projection; (4) perturb
the ROM dynamics to approximate the behavior of alternate model structures; and
(5) apply Bayesian inference and energy conservation laws to calibrate a LDO to
a given QOI. We demonstrate these techniques using the two-dimensional rotating
shallow water (RSW) equations as an example system.
|
math.DS math.AP
|
this paper focuses on the problem of quantifying the effects of modelstructure uncertainty in the context of timeevolving dynamical systems this is motivated by multimodel uncertainty in computer physics simulations developers often make different modeling choices in numerical approximations and process simplifications leading to different numerical codes that ostensibly represent the same underlying dynamics we consider modelstructure inference as a twostep methodology the first step is to perform system identification on numerical codes for which it is possible to observe the full state the second step is structural uncertainty quantification uq in which the goal is to search candidate models close to the numerical code surrogates for those that best match a quantityofinterest qoi from some empirical dataset specifically we 1 define a discrete local representation of the structure of a partial differential equation which we refer to as the local dynamical operator ldo 2 identify model structure nonintrusively from numerical code output 3 nonintrusively construct a reduced order model rom of the numerical model through poddeimgalerkin projection 4 perturb the rom dynamics to approximate the behavior of alternate model structures and 5 apply bayesian inference and energy conservation laws to calibrate a ldo to a given qoi we demonstrate these techniques using the twodimensional rotating shallow water rsw equations as an example system
|
[['this', 'paper', 'focuses', 'on', 'the', 'problem', 'of', 'quantifying', 'the', 'effects', 'of', 'modelstructure', 'uncertainty', 'in', 'the', 'context', 'of', 'timeevolving', 'dynamical', 'systems', 'this', 'is', 'motivated', 'by', 'multimodel', 'uncertainty', 'in', 'computer', 'physics', 'simulations', 'developers', 'often', 'make', 'different', 'modeling', 'choices', 'in', 'numerical', 'approximations', 'and', 'process', 'simplifications', 'leading', 'to', 'different', 'numerical', 'codes', 'that', 'ostensibly', 'represent', 'the', 'same', 'underlying', 'dynamics', 'we', 'consider', 'modelstructure', 'inference', 'as', 'a', 'twostep', 'methodology', 'the', 'first', 'step', 'is', 'to', 'perform', 'system', 'identification', 'on', 'numerical', 'codes', 'for', 'which', 'it', 'is', 'possible', 'to', 'observe', 'the', 'full', 'state', 'the', 'second', 'step', 'is', 'structural', 'uncertainty', 'quantification', 'uq', 'in', 'which', 'the', 'goal', 'is', 'to', 'search', 'candidate', 'models', 'close', 'to', 'the', 'numerical', 'code', 'surrogates', 'for', 'those', 'that', 'best', 'match', 'a', 'quantityofinterest', 'qoi', 'from', 'some', 'empirical', 'dataset', 'specifically', 'we', '1', 'define', 'a', 'discrete', 'local', 'representation', 'of', 'the', 'structure', 'of', 'a', 'partial', 'differential', 'equation', 'which', 'we', 'refer', 'to', 'as', 'the', 'local', 'dynamical', 'operator', 'ldo', '2', 'identify', 'model', 'structure', 'nonintrusively', 'from', 'numerical', 'code', 'output', '3', 'nonintrusively', 'construct', 'a', 'reduced', 'order', 'model', 'rom', 'of', 'the', 'numerical', 'model', 'through', 'poddeimgalerkin', 'projection', '4', 'perturb', 'the', 'rom', 'dynamics', 'to', 'approximate', 'the', 'behavior', 'of', 'alternate', 'model', 'structures', 'and', '5', 'apply', 'bayesian', 'inference', 'and', 'energy', 'conservation', 'laws', 'to', 'calibrate', 'a', 'ldo', 'to', 'a', 'given', 'qoi', 'we', 'demonstrate', 'these', 'techniques', 'using', 'the', 'twodimensional', 'rotating', 'shallow', 'water', 'rsw', 'equations', 'as', 'an', 'example', 'system']]
|
[-0.07050471135221843, 0.014922748529091411, -0.0885287349832789, 0.0971053148988725, -0.07331732723132689, -0.12614466527911816, 0.033758108413784835, 0.3437827976622601, -0.3229440523416929, -0.3310660262491097, 0.11807654911425966, -0.24920612558248048, -0.16264656334368618, 0.17376935949443645, -0.037459344297805626, 0.11342529663464652, 0.07250696399802659, 0.007908680603646164, -0.09378694339884876, -0.19916989882850036, 0.2971282887189069, 0.08942034702642628, 0.24782531885902467, -0.03807676540696466, 0.11230650133637816, -0.0417876031528719, -0.04331936806172378, -0.011240183071558416, -0.14976992938627176, 0.12196459421582678, 0.25406695486734227, 0.1343598652143418, 0.2906514375782484, -0.41775586995524616, -0.24881841991764475, 0.06277175396620428, 0.13002208521905936, 0.15465069639349338, -0.022525564408290007, -0.24920717209032825, 0.0755505089720553, -0.20578854749822673, -0.10934399323590663, -0.10174370326215999, -0.012579640373587608, 0.008901724624798968, -0.2951580220421574, 0.07144962030107085, 0.039374065437993336, 0.04815492892246869, -0.061215977442015915, -0.08655219640868896, -0.0060720699509816635, 0.13903995928901494, 0.00964557946116536, 0.006473972506047982, 0.10002639191225171, -0.10334542951434587, -0.12861684830101505, 0.3925967078462665, -0.02706263935630526, -0.26191800169730206, 0.17240319656700176, -0.09136005702103435, -0.14694265953159696, 0.1060607379504462, 0.2199036409322805, 0.112093476055548, -0.1671648519305855, 0.049977005531029545, -0.02833186710288502, 0.20398350964621026, -0.003480716639215935, -0.0420865357396597, 0.15407250530332467, 0.20796861079574194, 0.04833982946139207, 0.120469675198931, -0.06560911333124167, -0.13428632636144888, -0.3026154745668876, -0.14094737555199074, -0.15027137430064064, 0.0273936860725165, -0.08997447961519356, -0.1734374976664219, 0.3865499083756663, 0.22278059108340936, 0.17304572724420927, 0.05883607441913073, 0.3021024482106166, 0.10975734187775503, 0.024983523486023944, 0.05592066377186093, 0.19771405863303818, 0.12267302991580745, 0.053948800329927285, -0.2152833469737297, 0.06817001655343909, 0.09010552750562124]
|
1,803.03732
|
Precision Space Astrometry as a Tool to Find Earth-like Exoplanets
|
Because of the recent technological advances, the key technologies needed for
precision space optical astrometry are now in hand. The Microarcsecond
Astrometry Probe (MAP) mission concept is designed to find 1 Earth mass planets
at 1AU orbit (scaled to solar luminosity) around the nearest ~90 FGK stars. The
MAP payload includes i) a single three-mirror anastigmatic telescope with a 1-m
primary mirror and metrology subsystems, and ii) a camera. The camera focal
plane consists of 42 detectors, providing a Nyquist sampled FOV of 0.4-deg. Its
metrology subsystems ensure that MAP can achieve the 0.8 uas astrometric
precision in 1 hr, which is required to detect Earth-like exoplanets in our
stellar neighborhood. MAP mission could provide ~10 specific targets for a much
larger coronagraphic mission that would measure its spectra. We argue for the
development of the space astrometric missions capable of finding Earth-2.0.
Given the current technology readiness such missions relying on precision
astrometry could be flown in the next decade, perhaps in collaboration with
other national space agencies.
|
astro-ph.IM astro-ph.EP
|
because of the recent technological advances the key technologies needed for precision space optical astrometry are now in hand the microarcsecond astrometry probe map mission concept is designed to find 1 earth mass planets at 1au orbit scaled to solar luminosity around the nearest 90 fgk stars the map payload includes i a single threemirror anastigmatic telescope with a 1m primary mirror and metrology subsystems and ii a camera the camera focal plane consists of 42 detectors providing a nyquist sampled fov of 04deg its metrology subsystems ensure that map can achieve the 08 uas astrometric precision in 1 hr which is required to detect earthlike exoplanets in our stellar neighborhood map mission could provide 10 specific targets for a much larger coronagraphic mission that would measure its spectra we argue for the development of the space astrometric missions capable of finding earth20 given the current technology readiness such missions relying on precision astrometry could be flown in the next decade perhaps in collaboration with other national space agencies
|
[['because', 'of', 'the', 'recent', 'technological', 'advances', 'the', 'key', 'technologies', 'needed', 'for', 'precision', 'space', 'optical', 'astrometry', 'are', 'now', 'in', 'hand', 'the', 'microarcsecond', 'astrometry', 'probe', 'map', 'mission', 'concept', 'is', 'designed', 'to', 'find', '1', 'earth', 'mass', 'planets', 'at', '1au', 'orbit', 'scaled', 'to', 'solar', 'luminosity', 'around', 'the', 'nearest', '90', 'fgk', 'stars', 'the', 'map', 'payload', 'includes', 'i', 'a', 'single', 'threemirror', 'anastigmatic', 'telescope', 'with', 'a', '1m', 'primary', 'mirror', 'and', 'metrology', 'subsystems', 'and', 'ii', 'a', 'camera', 'the', 'camera', 'focal', 'plane', 'consists', 'of', '42', 'detectors', 'providing', 'a', 'nyquist', 'sampled', 'fov', 'of', '04deg', 'its', 'metrology', 'subsystems', 'ensure', 'that', 'map', 'can', 'achieve', 'the', '08', 'uas', 'astrometric', 'precision', 'in', '1', 'hr', 'which', 'is', 'required', 'to', 'detect', 'earthlike', 'exoplanets', 'in', 'our', 'stellar', 'neighborhood', 'map', 'mission', 'could', 'provide', '10', 'specific', 'targets', 'for', 'a', 'much', 'larger', 'coronagraphic', 'mission', 'that', 'would', 'measure', 'its', 'spectra', 'we', 'argue', 'for', 'the', 'development', 'of', 'the', 'space', 'astrometric', 'missions', 'capable', 'of', 'finding', 'earth20', 'given', 'the', 'current', 'technology', 'readiness', 'such', 'missions', 'relying', 'on', 'precision', 'astrometry', 'could', 'be', 'flown', 'in', 'the', 'next', 'decade', 'perhaps', 'in', 'collaboration', 'with', 'other', 'national', 'space', 'agencies']]
|
[-0.11556141591274659, 0.15224477249576884, -0.0598518279671089, 0.03311594524476565, -0.11153874360024929, -0.11502028399699195, 0.047383803453207196, 0.36921165980577114, -0.1912064716097213, -0.39910694401332003, 0.1300843421433924, -0.3205626648265177, -0.04852503956250936, 0.26784889041139426, -0.15497345259011594, 0.08222329168103658, 0.16476557594110552, -0.027685440674355855, -0.06072918128593083, -0.25715874934716787, 0.21627642062330943, 0.1572986624850529, 0.16629319335473422, -0.0672943591513855, 0.13612259409535385, -0.051972391284600704, -0.06881313798056837, -0.05643970335322756, -0.12946492592669245, 0.10934985355435017, 0.31196717333692436, 0.20634682599906837, 0.251913498914215, -0.33568129108237205, -0.1833714830109147, 0.08147076218436726, 0.11557667588948936, -0.023244719905639345, -0.025567937659763337, -0.3279044155427394, 0.037374415407013035, -0.16635406738102526, -0.19568698197982448, -0.020634228096993272, 0.04942784789659663, 0.00989032464246907, -0.24033631570567515, -0.054556064702246984, -0.033768338011856566, 0.1499643527211142, -0.11031399859243747, -0.10696892838222449, -0.02198249240152114, 0.16383118072139868, -0.07994271430861719, 0.1271181089509401, 0.1681816396944805, -0.11128840913220928, -0.05567045029654296, 0.41855678386138584, -0.07043960563347725, -0.0518594312587541, 0.15108151643426843, -0.2718989778349098, -0.14010888590717208, 0.11352773429268224, 0.17040622384150786, 0.09595459722216704, -0.17293986820401122, 0.03635309368001108, 0.06968933369122267, 0.22842631687571902, 0.0758792423687786, 0.09725978281795086, 0.3397264294437841, 0.22294697504836375, 0.18036663074159304, 0.02755435502113395, -0.28570628656816116, -0.014542836626199726, -0.2200915260828786, -0.15184395726418826, -0.1581217106605997, 0.023235589023233354, -0.08445186001610451, -0.06194364929761358, 0.33494425867544764, 0.20345775016263185, 0.09894296920071997, 0.010021361436633515, 0.3641829596899316, -6.675833632645314e-05, 0.13465119556532223, 0.021926373417606344, 0.36891106125748085, 0.06444528191015794, 0.14984509621852796, -0.14632796898378272, 0.027366545846724804, 0.012729583432184097]
|
1,803.03733
|
Mobile Edge Computing for Cellular-Connected UAV: Computation Offloading
and Trajectory Optimization
|
This paper studies a new mobile edge computing (MEC) setup where an unmanned
aerial vehicle (UAV) is served by cellular ground base stations (GBSs) for
computation offloading. The UAV flies between a give pair of initial and final
locations, during which it needs to accomplish certain computation tasks by
offloading them to some selected GBSs along its trajectory for parallel
execution. Under this setup, we aim to minimize the UAV's mission completion
time by optimizing its trajectory jointly with the computation offloading
scheduling, subject to the maximum speed constraint of the UAV, and the
computation capacity constraints at GBSs. The joint UAV trajectory and
computation offloading optimization problem is, however, non-convex and thus
difficult to be solved optimally. To tackle this problem, we propose an
efficient algorithm to obtain a high-quality suboptimal solution. Numerical
results show that the proposed design significantly reduces the UAV's mission
completion time, as compared to benchmark schemes.
|
cs.IT math.IT
|
this paper studies a new mobile edge computing mec setup where an unmanned aerial vehicle uav is served by cellular ground base stations gbss for computation offloading the uav flies between a give pair of initial and final locations during which it needs to accomplish certain computation tasks by offloading them to some selected gbss along its trajectory for parallel execution under this setup we aim to minimize the uavs mission completion time by optimizing its trajectory jointly with the computation offloading scheduling subject to the maximum speed constraint of the uav and the computation capacity constraints at gbss the joint uav trajectory and computation offloading optimization problem is however nonconvex and thus difficult to be solved optimally to tackle this problem we propose an efficient algorithm to obtain a highquality suboptimal solution numerical results show that the proposed design significantly reduces the uavs mission completion time as compared to benchmark schemes
|
[['this', 'paper', 'studies', 'a', 'new', 'mobile', 'edge', 'computing', 'mec', 'setup', 'where', 'an', 'unmanned', 'aerial', 'vehicle', 'uav', 'is', 'served', 'by', 'cellular', 'ground', 'base', 'stations', 'gbss', 'for', 'computation', 'offloading', 'the', 'uav', 'flies', 'between', 'a', 'give', 'pair', 'of', 'initial', 'and', 'final', 'locations', 'during', 'which', 'it', 'needs', 'to', 'accomplish', 'certain', 'computation', 'tasks', 'by', 'offloading', 'them', 'to', 'some', 'selected', 'gbss', 'along', 'its', 'trajectory', 'for', 'parallel', 'execution', 'under', 'this', 'setup', 'we', 'aim', 'to', 'minimize', 'the', 'uavs', 'mission', 'completion', 'time', 'by', 'optimizing', 'its', 'trajectory', 'jointly', 'with', 'the', 'computation', 'offloading', 'scheduling', 'subject', 'to', 'the', 'maximum', 'speed', 'constraint', 'of', 'the', 'uav', 'and', 'the', 'computation', 'capacity', 'constraints', 'at', 'gbss', 'the', 'joint', 'uav', 'trajectory', 'and', 'computation', 'offloading', 'optimization', 'problem', 'is', 'however', 'nonconvex', 'and', 'thus', 'difficult', 'to', 'be', 'solved', 'optimally', 'to', 'tackle', 'this', 'problem', 'we', 'propose', 'an', 'efficient', 'algorithm', 'to', 'obtain', 'a', 'highquality', 'suboptimal', 'solution', 'numerical', 'results', 'show', 'that', 'the', 'proposed', 'design', 'significantly', 'reduces', 'the', 'uavs', 'mission', 'completion', 'time', 'as', 'compared', 'to', 'benchmark', 'schemes']]
|
[-0.2223245812714786, 0.010475851376548618, -0.03591581675573252, -0.0029527620438449574, -0.1022696565809096, -0.22830582225364388, 0.15742026857409847, 0.4131423480269548, -0.31465212609863985, -0.3690028548559272, 0.10913417264696602, -0.20811066591474964, -0.15450343748671003, 0.16668122022192142, -0.180734839974129, 0.14223955672059674, 0.1579113930868181, 0.027868568927882927, -0.02255197825156517, -0.2916572107749648, 0.20466848349468292, 0.13363197261749424, 0.33318707959934774, 0.01856630008267913, 0.09452482022798474, 0.011459950924434355, 0.025020686833733253, -0.027149012734298594, -0.11298720826614858, 0.13708292132421201, 0.37021257204469293, 0.23435487355240375, 0.3163609355075383, -0.469833169377556, -0.19602142558984556, 0.11236684846593753, 0.15882064455332798, 0.025143020866763482, -0.003389975690975246, -0.3036788302201067, 0.1224561244506683, -0.21309714796064472, -0.046307332645243914, -0.033917782583126894, -0.0017097635733845987, 0.011184853793422104, -0.3288023952198656, -0.1025775097108348, -0.10176691216628042, -0.006501550871976896, -0.11325858050105653, -0.05247036151980099, 0.03371288690342274, 0.19422306146742285, 0.0827047127171873, 0.057252060497136735, 0.13487931437243547, -0.11698668580165279, -0.13349956651769676, 0.42115298339999035, 0.06301902230265305, -0.21663076735077133, 0.11682659350213055, -0.0037560521817986705, -0.12244418749316155, 0.15469855824018228, 0.24341444849146923, 0.14211776840353482, -0.18297198320138514, 0.02610449465206138, -0.0014796163702971842, 0.09652237378452953, 0.05167644188316588, 0.00521845180666883, 0.17596769633267909, 0.2125786910611695, 0.2666892245485398, 0.14857276892182295, -0.10845815093968045, -0.1392564340571162, -0.21350783000295787, -0.14534640138184554, -0.22653665721391966, -0.017240479614548877, -0.03572880673355509, -0.038575350134602844, 0.34862755595761546, 0.16083268170539095, 0.16557762012081712, 0.1492354533900078, 0.4563854716375078, 0.10702066663208443, 0.02570000717931084, 0.16030518978598257, 0.1432110781455489, 0.012984432770233405, 0.16772377566973629, -0.27245186089452256, 0.04401569366822705, 0.042574267073130036]
|
1,803.03734
|
Quantum heat engine based on trapped Bose gases: Its maximum efficiency
can approach the Carnot value at finite power
|
It was reported that, if and only if the specific heat, correlation length,
and dynamical exponents $\alpha, \nu$ and $z$, fulfill the condition
$\alpha-z\nu>0$, the phase transitions can enable a quantum heat engine to
approach Carnot efficiency at finite power. We start our analysis via a
different approach in which the effects of interaction and fluctuations on the
Hamiltonian of a trapped dilute Bose gas belonging to the same universality as
$XY$ model. Based on models of quantum Otto heat engines, we find the general
expression of the efficiency which includes the correction due to interaction
and fluctuations at the critical point, and show that, near the
Bose-Einstein-condensation point with $\alpha-z\nu<0$, energy fluctuations
could enable attaintment of the Carnot efficiency with nonvanishing power. Such
quantum heat engines can also be realized by changing the shape of the trap
confining the ideal and weakly interacting Bose gas during the adiabatic
processes of the cycle. These quantum heat engines working with the trapped
Bose gases, which are based on techniques of cooling Bose condensates and could
be realizable at present technology.
|
cond-mat.stat-mech
|
it was reported that if and only if the specific heat correlation length and dynamical exponents alpha nu and z fulfill the condition alphaznu0 the phase transitions can enable a quantum heat engine to approach carnot efficiency at finite power we start our analysis via a different approach in which the effects of interaction and fluctuations on the hamiltonian of a trapped dilute bose gas belonging to the same universality as xy model based on models of quantum otto heat engines we find the general expression of the efficiency which includes the correction due to interaction and fluctuations at the critical point and show that near the boseeinsteincondensation point with alphaznu0 energy fluctuations could enable attaintment of the carnot efficiency with nonvanishing power such quantum heat engines can also be realized by changing the shape of the trap confining the ideal and weakly interacting bose gas during the adiabatic processes of the cycle these quantum heat engines working with the trapped bose gases which are based on techniques of cooling bose condensates and could be realizable at present technology
|
[['it', 'was', 'reported', 'that', 'if', 'and', 'only', 'if', 'the', 'specific', 'heat', 'correlation', 'length', 'and', 'dynamical', 'exponents', 'alpha', 'nu', 'and', 'z', 'fulfill', 'the', 'condition', 'alphaznu0', 'the', 'phase', 'transitions', 'can', 'enable', 'a', 'quantum', 'heat', 'engine', 'to', 'approach', 'carnot', 'efficiency', 'at', 'finite', 'power', 'we', 'start', 'our', 'analysis', 'via', 'a', 'different', 'approach', 'in', 'which', 'the', 'effects', 'of', 'interaction', 'and', 'fluctuations', 'on', 'the', 'hamiltonian', 'of', 'a', 'trapped', 'dilute', 'bose', 'gas', 'belonging', 'to', 'the', 'same', 'universality', 'as', 'xy', 'model', 'based', 'on', 'models', 'of', 'quantum', 'otto', 'heat', 'engines', 'we', 'find', 'the', 'general', 'expression', 'of', 'the', 'efficiency', 'which', 'includes', 'the', 'correction', 'due', 'to', 'interaction', 'and', 'fluctuations', 'at', 'the', 'critical', 'point', 'and', 'show', 'that', 'near', 'the', 'boseeinsteincondensation', 'point', 'with', 'alphaznu0', 'energy', 'fluctuations', 'could', 'enable', 'attaintment', 'of', 'the', 'carnot', 'efficiency', 'with', 'nonvanishing', 'power', 'such', 'quantum', 'heat', 'engines', 'can', 'also', 'be', 'realized', 'by', 'changing', 'the', 'shape', 'of', 'the', 'trap', 'confining', 'the', 'ideal', 'and', 'weakly', 'interacting', 'bose', 'gas', 'during', 'the', 'adiabatic', 'processes', 'of', 'the', 'cycle', 'these', 'quantum', 'heat', 'engines', 'working', 'with', 'the', 'trapped', 'bose', 'gases', 'which', 'are', 'based', 'on', 'techniques', 'of', 'cooling', 'bose', 'condensates', 'and', 'could', 'be', 'realizable', 'at', 'present', 'technology']]
|
[-0.10513584432258292, 0.2117226861287649, -0.06100053146457702, 0.0264582348278385, -0.001238592725712806, -0.18283063358566407, 0.08518619755208916, 0.3218713404739075, -0.23804032436402683, -0.2680725007263721, 0.0607919322627078, -0.3102606299362378, -0.07199426047224154, 0.24734342339401005, 0.03757622267188377, 0.07197942847745832, 0.019949101939511656, 0.05450772991885473, -0.06747899068961322, -0.21541844651536932, 0.32006209734721447, 0.09991565571081909, 0.3016323862777261, 0.10949461802109992, 0.08043780929239636, -0.049012838692182085, 0.05234433920122683, 0.017230625028870152, -0.1473636026366049, 0.051539487033468584, 0.20969928886149153, 0.0021351636228659613, 0.20777358326912773, -0.41554780526679347, -0.25159543224568054, 0.1347135353928686, 0.12986429830727336, 0.09690254472198748, -0.03551997391861567, -0.26412770854817197, 0.0005019041702573966, -0.1716650946340947, -0.12285886275772513, -0.09523216364430648, 0.0017031564123251221, 0.07402417255798355, -0.2500568421978228, 0.10540392129289765, 0.12275490577506142, 0.04235731135916219, -0.03838846626141193, -0.027926296230527278, 0.002909015344233591, 0.1099864013694142, -0.04660967550179604, 0.006521990993695164, 0.2176653032736133, -0.14777503774332051, -0.09751576869927124, 0.397985198831355, -0.10067425620152128, -0.15128377503292126, 0.2213569255254697, -0.17002665987291204, -0.09360527658612806, 0.1165792662981072, 0.14966459987706252, 0.0822036521144169, -0.13567971949073995, 0.08795924769418145, 0.021923530868000606, 0.13748598411654134, 0.026553057033610952, 0.029678020094830903, 0.28627088547694834, 0.136562048617634, 0.02687971678096801, 0.17933487570288972, -0.07889622428047005, -0.13887817663436924, -0.288676694305402, -0.18380742267155173, -0.21527490637460936, 0.0869132964600629, -0.08455703290383099, -0.13745657324960286, 0.3564733271143103, 0.1695697982518554, 0.1562941898327236, -0.005700316143702366, 0.27550533797528426, 0.16678216066264379, 0.06438733717566886, 0.11997366402118298, 0.25216681849203515, 0.11337932313472265, 0.1272701701249885, -0.30823592607670103, -0.005844668559306724, 0.09505121762313964]
|
1,803.03735
|
Attention-based Graph Neural Network for Semi-supervised Learning
|
Recently popularized graph neural networks achieve the state-of-the-art
accuracy on a number of standard benchmark datasets for graph-based
semi-supervised learning, improving significantly over existing approaches.
These architectures alternate between a propagation layer that aggregates the
hidden states of the local neighborhood and a fully-connected layer. Perhaps
surprisingly, we show that a linear model, that removes all the intermediate
fully-connected layers, is still able to achieve a performance comparable to
the state-of-the-art models. This significantly reduces the number of
parameters, which is critical for semi-supervised learning where number of
labeled examples are small. This in turn allows a room for designing more
innovative propagation layers. Based on this insight, we propose a novel graph
neural network that removes all the intermediate fully-connected layers, and
replaces the propagation layers with attention mechanisms that respect the
structure of the graph. The attention mechanism allows us to learn a dynamic
and adaptive local summary of the neighborhood to achieve more accurate
predictions. In a number of experiments on benchmark citation networks
datasets, we demonstrate that our approach outperforms competing methods. By
examining the attention weights among neighbors, we show that our model
provides some interesting insights on how neighbors influence each other.
|
stat.ML cs.AI cs.LG
|
recently popularized graph neural networks achieve the stateoftheart accuracy on a number of standard benchmark datasets for graphbased semisupervised learning improving significantly over existing approaches these architectures alternate between a propagation layer that aggregates the hidden states of the local neighborhood and a fullyconnected layer perhaps surprisingly we show that a linear model that removes all the intermediate fullyconnected layers is still able to achieve a performance comparable to the stateoftheart models this significantly reduces the number of parameters which is critical for semisupervised learning where number of labeled examples are small this in turn allows a room for designing more innovative propagation layers based on this insight we propose a novel graph neural network that removes all the intermediate fullyconnected layers and replaces the propagation layers with attention mechanisms that respect the structure of the graph the attention mechanism allows us to learn a dynamic and adaptive local summary of the neighborhood to achieve more accurate predictions in a number of experiments on benchmark citation networks datasets we demonstrate that our approach outperforms competing methods by examining the attention weights among neighbors we show that our model provides some interesting insights on how neighbors influence each other
|
[['recently', 'popularized', 'graph', 'neural', 'networks', 'achieve', 'the', 'stateoftheart', 'accuracy', 'on', 'a', 'number', 'of', 'standard', 'benchmark', 'datasets', 'for', 'graphbased', 'semisupervised', 'learning', 'improving', 'significantly', 'over', 'existing', 'approaches', 'these', 'architectures', 'alternate', 'between', 'a', 'propagation', 'layer', 'that', 'aggregates', 'the', 'hidden', 'states', 'of', 'the', 'local', 'neighborhood', 'and', 'a', 'fullyconnected', 'layer', 'perhaps', 'surprisingly', 'we', 'show', 'that', 'a', 'linear', 'model', 'that', 'removes', 'all', 'the', 'intermediate', 'fullyconnected', 'layers', 'is', 'still', 'able', 'to', 'achieve', 'a', 'performance', 'comparable', 'to', 'the', 'stateoftheart', 'models', 'this', 'significantly', 'reduces', 'the', 'number', 'of', 'parameters', 'which', 'is', 'critical', 'for', 'semisupervised', 'learning', 'where', 'number', 'of', 'labeled', 'examples', 'are', 'small', 'this', 'in', 'turn', 'allows', 'a', 'room', 'for', 'designing', 'more', 'innovative', 'propagation', 'layers', 'based', 'on', 'this', 'insight', 'we', 'propose', 'a', 'novel', 'graph', 'neural', 'network', 'that', 'removes', 'all', 'the', 'intermediate', 'fullyconnected', 'layers', 'and', 'replaces', 'the', 'propagation', 'layers', 'with', 'attention', 'mechanisms', 'that', 'respect', 'the', 'structure', 'of', 'the', 'graph', 'the', 'attention', 'mechanism', 'allows', 'us', 'to', 'learn', 'a', 'dynamic', 'and', 'adaptive', 'local', 'summary', 'of', 'the', 'neighborhood', 'to', 'achieve', 'more', 'accurate', 'predictions', 'in', 'a', 'number', 'of', 'experiments', 'on', 'benchmark', 'citation', 'networks', 'datasets', 'we', 'demonstrate', 'that', 'our', 'approach', 'outperforms', 'competing', 'methods', 'by', 'examining', 'the', 'attention', 'weights', 'among', 'neighbors', 'we', 'show', 'that', 'our', 'model', 'provides', 'some', 'interesting', 'insights', 'on', 'how', 'neighbors', 'influence', 'each', 'other']]
|
[-0.08169571868957708, 0.030733371623838792, -0.036644076460483246, 0.048970195826382915, -0.125588739283778, -0.17653004704936961, 0.08527926884996093, 0.43099191098125894, -0.267219222781032, -0.32214665128714215, 0.012131513991261446, -0.2812472851184077, -0.22791536106031876, 0.18660957572953493, -0.06501327954100991, 0.03375235298234555, 0.1481491512862373, 0.059031851653178986, -0.06392207290892574, -0.30089998602113954, 0.3029513336798044, 0.05905303882547852, 0.3534564071080901, 0.018359588073434855, 0.1274266426868659, -0.024385650294146154, 0.007320741716551247, 0.026908000723595234, -0.08186339687289537, 0.1901857135205934, 0.2449926461837517, 0.12835449723037656, 0.3364658854146855, -0.44992316551647626, -0.2848864202105412, 0.09510529836207027, 0.14431099521555948, 0.1306754859486851, -0.034815026967665134, -0.2687105504381988, 0.1211789587343281, -0.1590080081645136, 0.009838559460177115, -0.1497052038797516, -0.03772421712479131, -0.00026227271412452213, -0.30648413679304987, 0.017536228853089714, 0.10007706640354085, -0.00022058030402269028, -0.013378755204177301, -0.1520243007119397, -0.0033275699901460397, 0.1432441450782459, -0.0035415220952174165, 0.04504910832496755, 0.12192074274832401, -0.19248111983831745, -0.1423446993305903, 0.3131112605239255, -0.04586669414379455, -0.1952117615758037, 0.22955493811833097, -0.016924076242227755, -0.14969156496109196, 0.08372452777970318, 0.23158953624490572, 0.12244500681720298, -0.11822879948974305, 0.022803924807566076, -0.07548317540850905, 0.19743525717087618, 0.03796665691841168, 0.026213217122160425, 0.15045590369110795, 0.2811038414877134, 0.07035563630404684, 0.14524639198924602, -0.11382647016264423, -0.1140878218357837, -0.19679201433359825, -0.08790659694513482, -0.17055225476617877, -0.031100307403113505, -0.15686256923182748, -0.14236739692326714, 0.4612146448343992, 0.2645491318955942, 0.2529067134748053, 0.11633892065311566, 0.3263320996557748, -0.0009208169349497466, 0.12563879100130776, 0.12799952444714505, 0.21799532235955768, 0.05800105416041921, 0.08935577635690946, -0.16655904802521973, 0.11334382977061482, 0.06347347398975281]
|
1,803.03736
|
Joint Optimization of Scheduling and Routing in Multicast Wireless
Ad-Hoc Network Using Soft Graph Coloring and Non-linear Cubic Games
|
In this paper we present matrix game-theoretic models for joint routing,
network coding, and scheduling problem. First routing and network coding are
modeled by using a new approach based on compressed topology matrix that takes
into account the inherent multicast gain of the network. The scheduling is
optimized by a new approach called network graph soft coloring. Soft graph
coloring is designed by switching between different components of a wireless
network graph, which we refer to as graph fractals, with appropriate usage
rates. The network components, represented by graph fractals, are a new
paradigm in network graph partitioning that enables modeling of the network
optimization problem by using the matrix game framework. In the proposed game
which is a nonlinear cubic game, the strategy sets of the players are links,
path, and network components. The outputs of this game model are mixed strategy
vectors of the second and the third players at equilibrium. Strategy vector of
the second player specifies optimum multi-path routing and network coding
solution while mixed strategy vector of the third players indicates optimum
switching rate among different network components or membership probabilities
for optimal soft scheduling approach. Optimum throughput is the value of the
proposed nonlinear cubic game at equilibrium. The proposed nonlinear cubic game
is solved by extending fictitious playing method. Numerical and simulation
results prove the superior performance of the proposed techniques compared to
the conventional schemes using hard graph coloring.
|
eess.SP cs.NI
|
in this paper we present matrix gametheoretic models for joint routing network coding and scheduling problem first routing and network coding are modeled by using a new approach based on compressed topology matrix that takes into account the inherent multicast gain of the network the scheduling is optimized by a new approach called network graph soft coloring soft graph coloring is designed by switching between different components of a wireless network graph which we refer to as graph fractals with appropriate usage rates the network components represented by graph fractals are a new paradigm in network graph partitioning that enables modeling of the network optimization problem by using the matrix game framework in the proposed game which is a nonlinear cubic game the strategy sets of the players are links path and network components the outputs of this game model are mixed strategy vectors of the second and the third players at equilibrium strategy vector of the second player specifies optimum multipath routing and network coding solution while mixed strategy vector of the third players indicates optimum switching rate among different network components or membership probabilities for optimal soft scheduling approach optimum throughput is the value of the proposed nonlinear cubic game at equilibrium the proposed nonlinear cubic game is solved by extending fictitious playing method numerical and simulation results prove the superior performance of the proposed techniques compared to the conventional schemes using hard graph coloring
|
[['in', 'this', 'paper', 'we', 'present', 'matrix', 'gametheoretic', 'models', 'for', 'joint', 'routing', 'network', 'coding', 'and', 'scheduling', 'problem', 'first', 'routing', 'and', 'network', 'coding', 'are', 'modeled', 'by', 'using', 'a', 'new', 'approach', 'based', 'on', 'compressed', 'topology', 'matrix', 'that', 'takes', 'into', 'account', 'the', 'inherent', 'multicast', 'gain', 'of', 'the', 'network', 'the', 'scheduling', 'is', 'optimized', 'by', 'a', 'new', 'approach', 'called', 'network', 'graph', 'soft', 'coloring', 'soft', 'graph', 'coloring', 'is', 'designed', 'by', 'switching', 'between', 'different', 'components', 'of', 'a', 'wireless', 'network', 'graph', 'which', 'we', 'refer', 'to', 'as', 'graph', 'fractals', 'with', 'appropriate', 'usage', 'rates', 'the', 'network', 'components', 'represented', 'by', 'graph', 'fractals', 'are', 'a', 'new', 'paradigm', 'in', 'network', 'graph', 'partitioning', 'that', 'enables', 'modeling', 'of', 'the', 'network', 'optimization', 'problem', 'by', 'using', 'the', 'matrix', 'game', 'framework', 'in', 'the', 'proposed', 'game', 'which', 'is', 'a', 'nonlinear', 'cubic', 'game', 'the', 'strategy', 'sets', 'of', 'the', 'players', 'are', 'links', 'path', 'and', 'network', 'components', 'the', 'outputs', 'of', 'this', 'game', 'model', 'are', 'mixed', 'strategy', 'vectors', 'of', 'the', 'second', 'and', 'the', 'third', 'players', 'at', 'equilibrium', 'strategy', 'vector', 'of', 'the', 'second', 'player', 'specifies', 'optimum', 'multipath', 'routing', 'and', 'network', 'coding', 'solution', 'while', 'mixed', 'strategy', 'vector', 'of', 'the', 'third', 'players', 'indicates', 'optimum', 'switching', 'rate', 'among', 'different', 'network', 'components', 'or', 'membership', 'probabilities', 'for', 'optimal', 'soft', 'scheduling', 'approach', 'optimum', 'throughput', 'is', 'the', 'value', 'of', 'the', 'proposed', 'nonlinear', 'cubic', 'game', 'at', 'equilibrium', 'the', 'proposed', 'nonlinear', 'cubic', 'game', 'is', 'solved', 'by', 'extending', 'fictitious', 'playing', 'method', 'numerical', 'and', 'simulation', 'results', 'prove', 'the', 'superior', 'performance', 'of', 'the', 'proposed', 'techniques', 'compared', 'to', 'the', 'conventional', 'schemes', 'using', 'hard', 'graph', 'coloring']]
|
[-0.15780178536582376, 0.002640570739857884, -0.09613884362010953, 0.0336753466212729, -0.09178319763989513, -0.22750856355839616, 0.10397140688767838, 0.4320364192026011, -0.31608387956961614, -0.30477041374417496, 0.0748856807494033, -0.22672117390485189, -0.2381843420144422, 0.07564797058882278, -0.11669747085990345, 0.1012385594462072, 0.09761503061774789, 0.024377871391202326, 0.040610752151473445, -0.24276084586511806, 0.3407825595160891, 0.02759171531138792, 0.31902326782968854, 0.008402385660506126, 0.1306729804968092, 0.04527134862472991, -0.0253568651893408, 0.05738748425670864, -0.08931381239896917, 0.12342022245215402, 0.2830490945906209, 0.1919977166375562, 0.3284271816931319, -0.4247291544491606, -0.2297931847551578, 0.11323341398543132, 0.09897655526073924, 0.06789452861601541, 0.004707951736754349, -0.26853170290781886, 0.12532900655367077, -0.18681514317087264, 0.005936044023690533, -0.03473675835244986, -0.051504319820568786, 0.023309499643033738, -0.3299536699004754, -0.024963421627234684, 0.015051138311239423, -0.014959707412129968, -0.03441187148846937, -0.14294669934929613, 0.0001250669273708943, 0.14284390809686406, -0.027647371283528014, 0.022572766339115577, 0.11476007149208982, -0.12061066159001996, -0.21854969433740662, 0.3818792924167046, -0.021809407081533585, -0.17793698237132172, 0.0855976401352744, 0.015860370440872285, -0.13209593106446324, 0.14722866742018972, 0.2171968686559438, 0.10827104000051463, -0.1681287328138916, 0.02928183639455461, -0.0717213579516402, 0.16875116540441282, 0.0640406882123165, 0.017587065857831184, 0.11718225960349217, 0.2519743904581427, 0.16291313747227495, 0.1714877787032381, -0.027546411676858926, -0.154584435705795, -0.23116811552529032, -0.07202693093017938, -0.2250017725945085, -0.049299836825807325, -0.1884757003582128, -0.12118114791181772, 0.4275107856501947, 0.10831927739571041, 0.11293465034242421, 0.11626266019383469, 0.34589318070513536, 0.09759155555553577, 0.04663708519174831, 0.150723153112244, 0.17105776025031452, 0.120126742092531, 0.1329228528686858, -0.20823894062483259, 0.10493998193154544, 0.11769837559690062]
|
1,803.03737
|
Enhancing Evolutionary Conversion Rate Optimization via Multi-armed
Bandit Algorithms
|
Conversion rate optimization means designing web interfaces such that more
visitors perform a desired action (such as register or purchase) on the site.
One promising approach, implemented in Sentient Ascend, is to optimize the
design using evolutionary algorithms, evaluating each candidate design online
with actual visitors. Because such evaluations are costly and noisy, several
challenges emerge: How can available visitor traffic be used most efficiently?
How can good solutions be identified most reliably? How can a high conversion
rate be maintained during optimization? This paper proposes a new technique to
address these issues. Traffic is allocated to candidate solutions using a
multi-armed bandit algorithm, using more traffic on those evaluations that are
most useful. In a best-arm identification mode, the best candidate can be
identified reliably at the end of evolution, and in a campaign mode, the
overall conversion rate can be optimized throughout the entire evolution
process. Multi-armed bandit algorithms thus improve performance and reliability
of machine discovery in noisy real-world environments.
|
cs.NE
|
conversion rate optimization means designing web interfaces such that more visitors perform a desired action such as register or purchase on the site one promising approach implemented in sentient ascend is to optimize the design using evolutionary algorithms evaluating each candidate design online with actual visitors because such evaluations are costly and noisy several challenges emerge how can available visitor traffic be used most efficiently how can good solutions be identified most reliably how can a high conversion rate be maintained during optimization this paper proposes a new technique to address these issues traffic is allocated to candidate solutions using a multiarmed bandit algorithm using more traffic on those evaluations that are most useful in a bestarm identification mode the best candidate can be identified reliably at the end of evolution and in a campaign mode the overall conversion rate can be optimized throughout the entire evolution process multiarmed bandit algorithms thus improve performance and reliability of machine discovery in noisy realworld environments
|
[['conversion', 'rate', 'optimization', 'means', 'designing', 'web', 'interfaces', 'such', 'that', 'more', 'visitors', 'perform', 'a', 'desired', 'action', 'such', 'as', 'register', 'or', 'purchase', 'on', 'the', 'site', 'one', 'promising', 'approach', 'implemented', 'in', 'sentient', 'ascend', 'is', 'to', 'optimize', 'the', 'design', 'using', 'evolutionary', 'algorithms', 'evaluating', 'each', 'candidate', 'design', 'online', 'with', 'actual', 'visitors', 'because', 'such', 'evaluations', 'are', 'costly', 'and', 'noisy', 'several', 'challenges', 'emerge', 'how', 'can', 'available', 'visitor', 'traffic', 'be', 'used', 'most', 'efficiently', 'how', 'can', 'good', 'solutions', 'be', 'identified', 'most', 'reliably', 'how', 'can', 'a', 'high', 'conversion', 'rate', 'be', 'maintained', 'during', 'optimization', 'this', 'paper', 'proposes', 'a', 'new', 'technique', 'to', 'address', 'these', 'issues', 'traffic', 'is', 'allocated', 'to', 'candidate', 'solutions', 'using', 'a', 'multiarmed', 'bandit', 'algorithm', 'using', 'more', 'traffic', 'on', 'those', 'evaluations', 'that', 'are', 'most', 'useful', 'in', 'a', 'bestarm', 'identification', 'mode', 'the', 'best', 'candidate', 'can', 'be', 'identified', 'reliably', 'at', 'the', 'end', 'of', 'evolution', 'and', 'in', 'a', 'campaign', 'mode', 'the', 'overall', 'conversion', 'rate', 'can', 'be', 'optimized', 'throughout', 'the', 'entire', 'evolution', 'process', 'multiarmed', 'bandit', 'algorithms', 'thus', 'improve', 'performance', 'and', 'reliability', 'of', 'machine', 'discovery', 'in', 'noisy', 'realworld', 'environments']]
|
[-0.0994742261854706, 0.029161433563596267, -0.0740530874217329, 0.09242371718927604, -0.15425916601463788, -0.21606615799382053, 0.10270611059700534, 0.43624729571715454, -0.2878160771958107, -0.3703145678926465, 0.17037876939081067, -0.2396457979964104, -0.17805406545071742, 0.2321324157828545, -0.1039852553184367, 0.08149038336276894, 0.11032078928882656, 1.282982551064228e-06, 0.009031468519385322, -0.2995188208811122, 0.2090329301883986, 0.10414519557226563, 0.3167834549033843, -0.019690169718550758, 0.043875030561870226, -0.038925903669770584, -0.008329792942371836, -0.002958750321731211, -0.06702280650531339, 0.09348562260392619, 0.38375697752455123, 0.24792033846724343, 0.33720057545104093, -0.41264521864248566, -0.18682370348147864, 0.11698156759782803, 0.20601144675279687, 0.07793549351691285, -0.0841495908442899, -0.2696851490099737, 0.08605919815342805, -0.1735302127449219, -0.04733339747402566, -0.08986897949426452, -0.07409471639094908, 0.02355178965804127, -0.2839497525467783, 0.013272860521690612, -0.07329804540870345, -0.0053050029662900546, -0.03426862233375525, -0.08376712709425325, 0.014166081957004827, 0.19839207752767746, 0.029592701282310785, 0.04360075944040451, 0.19964155168529668, -0.14260707981741638, -0.1807227007947588, 0.4025269391277999, -0.04112619273878771, -0.19211291093122146, 0.19437109477292358, -0.02841772942695241, -0.15158015389018265, 0.1329451354529046, 0.26409574044351264, 0.15282357088861517, -0.21761600493790548, -0.025283721223847793, 0.012228272278204652, 0.18597269542743824, 0.0511915331536424, 0.03123313357962147, 0.21432381118019253, 0.24187100202736497, 0.07998738551592352, 0.13967870644285155, -0.048187844303830815, -0.07781838643381749, -0.20959325379297777, -0.13218704953595448, -0.16038333464057136, 0.01700877687898093, -0.07784387202366709, -0.06994312738234097, 0.3743684223847338, 0.20420391441385713, 0.1674481905693977, 0.025701199546799156, 0.3409822578399094, 0.07879324146743544, 0.07291930731660201, 0.12006595380749965, 0.18743580975426943, -0.01772682605299847, 0.13130984244513913, -0.19951494953715088, 0.15968904020607563, 0.008224557863799798]
|
1,803.03738
|
Stochastic Models of Coalition Games for Spectrum Sharing in Large Scale
Interference Channels
|
In this paper, we present a framework for the analysis of self-organized
distributed coalition formation process for spectrum sharing in interference
channel for large-scale ad hoc networks. In this approach, we use the concept
of coalition clusters within the network where mutual interdependency between
different clusters is characterized by the concept of spatial network
correlation. Then by using stochastic models of the process we give up some
details characteristic for coalition game theory in order to be able to include
some additional parameters for network scaling. Applications of this model are
a) Estimation of average time to reach grand coalition and its variance through
closed-form equations. These parameters are important in designing the process
in a dynamic environment. b) Dimensioning the coalition cluster within the
network c) Modelling the network spatial correlation characterizing mutual
visibility of the interfering links. d) Modeling of the effect of the new link
activation/inactivation on the coalition forming process. e) Modeling the
effect of link mobility on the coalition-forming process.
|
eess.SP
|
in this paper we present a framework for the analysis of selforganized distributed coalition formation process for spectrum sharing in interference channel for largescale ad hoc networks in this approach we use the concept of coalition clusters within the network where mutual interdependency between different clusters is characterized by the concept of spatial network correlation then by using stochastic models of the process we give up some details characteristic for coalition game theory in order to be able to include some additional parameters for network scaling applications of this model are a estimation of average time to reach grand coalition and its variance through closedform equations these parameters are important in designing the process in a dynamic environment b dimensioning the coalition cluster within the network c modelling the network spatial correlation characterizing mutual visibility of the interfering links d modeling of the effect of the new link activationinactivation on the coalition forming process e modeling the effect of link mobility on the coalitionforming process
|
[['in', 'this', 'paper', 'we', 'present', 'a', 'framework', 'for', 'the', 'analysis', 'of', 'selforganized', 'distributed', 'coalition', 'formation', 'process', 'for', 'spectrum', 'sharing', 'in', 'interference', 'channel', 'for', 'largescale', 'ad', 'hoc', 'networks', 'in', 'this', 'approach', 'we', 'use', 'the', 'concept', 'of', 'coalition', 'clusters', 'within', 'the', 'network', 'where', 'mutual', 'interdependency', 'between', 'different', 'clusters', 'is', 'characterized', 'by', 'the', 'concept', 'of', 'spatial', 'network', 'correlation', 'then', 'by', 'using', 'stochastic', 'models', 'of', 'the', 'process', 'we', 'give', 'up', 'some', 'details', 'characteristic', 'for', 'coalition', 'game', 'theory', 'in', 'order', 'to', 'be', 'able', 'to', 'include', 'some', 'additional', 'parameters', 'for', 'network', 'scaling', 'applications', 'of', 'this', 'model', 'are', 'a', 'estimation', 'of', 'average', 'time', 'to', 'reach', 'grand', 'coalition', 'and', 'its', 'variance', 'through', 'closedform', 'equations', 'these', 'parameters', 'are', 'important', 'in', 'designing', 'the', 'process', 'in', 'a', 'dynamic', 'environment', 'b', 'dimensioning', 'the', 'coalition', 'cluster', 'within', 'the', 'network', 'c', 'modelling', 'the', 'network', 'spatial', 'correlation', 'characterizing', 'mutual', 'visibility', 'of', 'the', 'interfering', 'links', 'd', 'modeling', 'of', 'the', 'effect', 'of', 'the', 'new', 'link', 'activationinactivation', 'on', 'the', 'coalition', 'forming', 'process', 'e', 'modeling', 'the', 'effect', 'of', 'link', 'mobility', 'on', 'the', 'coalitionforming', 'process']]
|
[-0.16870049244110905, 0.03275681507103599, -0.0706067657575193, 0.06171793979655842, -0.03833190523508209, -0.1216010937148495, 0.11034419622894082, 0.397261959829981, -0.3024011118814531, -0.3273741239170748, 0.05120360311092355, -0.20432207577332298, -0.2034890040891563, 0.08929943444531002, -0.04482416582305166, 0.036247874672947704, 0.04198917936144692, 0.05648155663753065, 0.02951628826672166, -0.2132038189632046, 0.3626032057480898, 0.09827121950277104, 0.2737469347151246, 0.02721533580206153, 0.06877613194264108, 0.013215720085654317, -0.04494498561352219, 0.007475563741669558, -0.14004973589340453, 0.1275493134467624, 0.2378212944763507, 0.1678265538733884, 0.31179717875926233, -0.45127323324928376, -0.23341426975377721, 0.11117026969654167, 0.1521598677029876, 0.0611187813763802, -0.001141473706300575, -0.27460097534036854, 0.10419566599402304, -0.2215249648363125, -0.0610554464468051, -0.027676523670202076, 0.014457829177334177, 0.03504766543267401, -0.3084199012700105, 0.0752278817547826, 0.04028066345376939, 0.05457701909685189, -0.039779051153767266, -0.09318605419702647, 0.01501652485940878, 0.17510607727042332, -0.020763652706014775, -0.02202500865749288, 0.14606506618275023, -0.1544220921620386, -0.13468511048463036, 0.35544071058606413, -0.010494276890446, -0.18474401876602958, 0.154854548692195, -0.10162601193197345, -0.15526370417110893, 0.08592549292370677, 0.23525827463216534, 0.09166005154128937, -0.19579002526929465, 0.03529974887830421, -0.024425297850429184, 0.13279904039695906, 0.03743323482993263, 0.061365660166413316, 0.21258679901181562, 0.23978897713397335, 0.08832457214707463, 0.12520073025370948, -0.084483591132661, -0.16390401254430775, -0.26763055399173824, -0.12126376901514738, -0.1575868518159884, -0.019821324548258152, -0.1412063988220059, -0.12421540389861059, 0.40170072163341614, 0.16501507256180048, 0.16877733891341473, 0.08969841137522741, 0.2920061596491794, 0.0863436246148833, 0.0543329743295766, 0.05260844903759568, 0.1823780497656028, 0.09959403663112713, 0.1111131933263628, -0.22304943856419768, 0.11698463657748795, 0.015954390236335558]
|
1,803.03739
|
Disentangled cooperative orderings in artificial rare-earth nickelates
|
Coupled transitions between distinct ordered phases are important aspects
behind the rich phase complexity of correlated oxides that hinders our
understanding of the underlying phenomena. For this reason, fundamental control
over complex transitions has become a leading motivation of the designer
approach to materials. We have devised a series of new superlattices by
combining a Mott insulator and a correlated metal to form ultra-short period
superlattices, which allow one to disentangle the simultaneous orderings in
$RE$NiO$_3$. Tailoring an incommensurate heterostructure period relative to the
bulk charge ordering pattern suppresses the charge order transition while
preserving metal-insulator and antiferromagnetic transitions. Such selective
decoupling of the entangled phases resolves the long-standing puzzle about the
driving force behind the metal-insulator transition and points to the site
selective Mott transition as the operative mechanism. This designer approach
emphasizes the potential of heterointerfaces for selective control of
simultaneous transitions in complex materials with entwined broken symmetries.
|
cond-mat.str-el
|
coupled transitions between distinct ordered phases are important aspects behind the rich phase complexity of correlated oxides that hinders our understanding of the underlying phenomena for this reason fundamental control over complex transitions has become a leading motivation of the designer approach to materials we have devised a series of new superlattices by combining a mott insulator and a correlated metal to form ultrashort period superlattices which allow one to disentangle the simultaneous orderings in renio_3 tailoring an incommensurate heterostructure period relative to the bulk charge ordering pattern suppresses the charge order transition while preserving metalinsulator and antiferromagnetic transitions such selective decoupling of the entangled phases resolves the longstanding puzzle about the driving force behind the metalinsulator transition and points to the site selective mott transition as the operative mechanism this designer approach emphasizes the potential of heterointerfaces for selective control of simultaneous transitions in complex materials with entwined broken symmetries
|
[['coupled', 'transitions', 'between', 'distinct', 'ordered', 'phases', 'are', 'important', 'aspects', 'behind', 'the', 'rich', 'phase', 'complexity', 'of', 'correlated', 'oxides', 'that', 'hinders', 'our', 'understanding', 'of', 'the', 'underlying', 'phenomena', 'for', 'this', 'reason', 'fundamental', 'control', 'over', 'complex', 'transitions', 'has', 'become', 'a', 'leading', 'motivation', 'of', 'the', 'designer', 'approach', 'to', 'materials', 'we', 'have', 'devised', 'a', 'series', 'of', 'new', 'superlattices', 'by', 'combining', 'a', 'mott', 'insulator', 'and', 'a', 'correlated', 'metal', 'to', 'form', 'ultrashort', 'period', 'superlattices', 'which', 'allow', 'one', 'to', 'disentangle', 'the', 'simultaneous', 'orderings', 'in', 'renio_3', 'tailoring', 'an', 'incommensurate', 'heterostructure', 'period', 'relative', 'to', 'the', 'bulk', 'charge', 'ordering', 'pattern', 'suppresses', 'the', 'charge', 'order', 'transition', 'while', 'preserving', 'metalinsulator', 'and', 'antiferromagnetic', 'transitions', 'such', 'selective', 'decoupling', 'of', 'the', 'entangled', 'phases', 'resolves', 'the', 'longstanding', 'puzzle', 'about', 'the', 'driving', 'force', 'behind', 'the', 'metalinsulator', 'transition', 'and', 'points', 'to', 'the', 'site', 'selective', 'mott', 'transition', 'as', 'the', 'operative', 'mechanism', 'this', 'designer', 'approach', 'emphasizes', 'the', 'potential', 'of', 'heterointerfaces', 'for', 'selective', 'control', 'of', 'simultaneous', 'transitions', 'in', 'complex', 'materials', 'with', 'entwined', 'broken', 'symmetries']]
|
[-0.18444448317530632, 0.218757989919002, -0.043825164443461705, 0.043022485244834166, -0.0692775503096991, -0.1889786229758764, 0.12959298264506636, 0.3848262910009516, -0.29710625269024676, -0.286232362075752, 0.015799437083661654, -0.28991125249273036, -0.18112955924697122, 0.10014630150395316, 0.021263037333326625, 0.016623237614353366, -0.08305414667736974, -0.11484574036987263, -0.11455962447209024, -0.15651193808529848, 0.3062429454035761, -0.0013004188666379216, 0.3083252392783268, 0.07487718760967255, 0.06995143033857057, 0.004938871107739357, 0.10055011815648983, -0.04347764284794052, -0.14001296038319402, 0.07025988640985298, 0.292790351703837, -0.034907360801732304, 0.22720603538818857, -0.4441699449046953, -0.24382633998502812, 0.02726542489720348, 0.12538749288878595, 0.1281728511190486, -0.09698113165672449, -0.2917116284432099, 0.015499886791437666, -0.12206074852644411, -0.13592317157358683, -0.12025632964607501, 0.003101349789772602, -0.03088254813414795, -0.25289662134531415, 0.05762657065280645, 0.09412708408986596, 0.08090059455200438, -0.0799009745573588, -0.0628257921915378, -0.03282261291319899, 0.15970931384737128, 0.04852506732074729, 0.05956039124859238, 0.11847634255170625, -0.12795560452963736, -0.17109998572149024, 0.4086224841823592, 0.017485539861399654, -0.04303075387358468, 0.21944721876057666, -0.15589373425094083, -0.11474727431238191, 0.211777078030964, 0.12278613963762657, 0.0887885639804033, -0.10019494104661689, 0.03120564690225184, 0.05306754255087565, 0.1992034321583018, 0.022686041105193216, 0.11157265269438064, 0.3030436663018749, 0.21722810197966974, 0.05862301314058436, 0.12952079071620146, -0.030233908561829306, -0.1312584106051764, -0.20191181144855966, -0.1756873297172025, -0.17471539439781514, 0.021542670347092563, -0.06538511946497082, -0.1987943831724824, 0.4427037793442928, 0.18559607987936635, 0.16164161053344311, -0.12192802430849078, 0.2240439667551476, 0.08079794161515125, 0.06329189079743501, -0.047088966020290425, 0.22332404155765248, 0.16279192706677964, 0.1160947173280296, -0.2765650696490062, 0.10655533754118773, 0.0437547817734912]
|
1,803.0374
|
Cluster Size Optimization in Cooperative Spectrum Sensing
|
In this paper, we study and optimize the cooperation cluster size in
cooperative spectrum sensing to maximize the throughput of secondary users
(SUs). To calculate the effective throughput, we assume each SU spends just 1
symbol to negotiate with the other SUs in its transmission range. This is the
minimum overhead required for each SU to broadcast its sensing decision to the
other members of the cluster. When the number of SUs is large, the throughput
spent for the negotiation is noticeable and therefore increasing the
cooperation cluster size does not improve the effective throughput anymore. In
this paper, we calculate the effective throughput as a function of the
cooperation cluster size, and then we maximize the throughput by finding the
optimal cluster size. Various numerical results show that when decisions are
combined by the OR-rule, the optimum cooperation cluster size is less than when
the AND-rule is used. On the other hand, the optimum cluster size monotonically
decreases with the increase in the average SNR of the SUs. Another interesting
result is that when the cluster size is optimized the OR-rule always
outperforms the AND-rule.
|
eess.SP cs.IT math.IT
|
in this paper we study and optimize the cooperation cluster size in cooperative spectrum sensing to maximize the throughput of secondary users sus to calculate the effective throughput we assume each su spends just 1 symbol to negotiate with the other sus in its transmission range this is the minimum overhead required for each su to broadcast its sensing decision to the other members of the cluster when the number of sus is large the throughput spent for the negotiation is noticeable and therefore increasing the cooperation cluster size does not improve the effective throughput anymore in this paper we calculate the effective throughput as a function of the cooperation cluster size and then we maximize the throughput by finding the optimal cluster size various numerical results show that when decisions are combined by the orrule the optimum cooperation cluster size is less than when the andrule is used on the other hand the optimum cluster size monotonically decreases with the increase in the average snr of the sus another interesting result is that when the cluster size is optimized the orrule always outperforms the andrule
|
[['in', 'this', 'paper', 'we', 'study', 'and', 'optimize', 'the', 'cooperation', 'cluster', 'size', 'in', 'cooperative', 'spectrum', 'sensing', 'to', 'maximize', 'the', 'throughput', 'of', 'secondary', 'users', 'sus', 'to', 'calculate', 'the', 'effective', 'throughput', 'we', 'assume', 'each', 'su', 'spends', 'just', '1', 'symbol', 'to', 'negotiate', 'with', 'the', 'other', 'sus', 'in', 'its', 'transmission', 'range', 'this', 'is', 'the', 'minimum', 'overhead', 'required', 'for', 'each', 'su', 'to', 'broadcast', 'its', 'sensing', 'decision', 'to', 'the', 'other', 'members', 'of', 'the', 'cluster', 'when', 'the', 'number', 'of', 'sus', 'is', 'large', 'the', 'throughput', 'spent', 'for', 'the', 'negotiation', 'is', 'noticeable', 'and', 'therefore', 'increasing', 'the', 'cooperation', 'cluster', 'size', 'does', 'not', 'improve', 'the', 'effective', 'throughput', 'anymore', 'in', 'this', 'paper', 'we', 'calculate', 'the', 'effective', 'throughput', 'as', 'a', 'function', 'of', 'the', 'cooperation', 'cluster', 'size', 'and', 'then', 'we', 'maximize', 'the', 'throughput', 'by', 'finding', 'the', 'optimal', 'cluster', 'size', 'various', 'numerical', 'results', 'show', 'that', 'when', 'decisions', 'are', 'combined', 'by', 'the', 'orrule', 'the', 'optimum', 'cooperation', 'cluster', 'size', 'is', 'less', 'than', 'when', 'the', 'andrule', 'is', 'used', 'on', 'the', 'other', 'hand', 'the', 'optimum', 'cluster', 'size', 'monotonically', 'decreases', 'with', 'the', 'increase', 'in', 'the', 'average', 'snr', 'of', 'the', 'sus', 'another', 'interesting', 'result', 'is', 'that', 'when', 'the', 'cluster', 'size', 'is', 'optimized', 'the', 'orrule', 'always', 'outperforms', 'the', 'andrule']]
|
[-0.1711103270275979, 0.07892443535358755, -0.03435057902868877, 0.03987316970753493, -0.07997248637219591, -0.1572530728900024, 0.13800315634642918, 0.38512901545587364, -0.27847873051250255, -0.30763205655059345, 0.0748301010205841, -0.27107164140800716, -0.12988881903990943, 0.08947872567010583, -0.13380814306638253, -0.00843927328805289, 0.07468822052181569, 0.1441464223022703, -0.024864200083288535, -0.3412287355380593, 0.27127740220842705, 0.1719712902871912, 0.3235779963859347, 0.026992081278955103, 0.025440022860082886, 0.05990223874468156, -0.005324315772296721, 0.002054943292531916, -0.13611903921890345, 0.0796356569269612, 0.27638502094033424, 0.1865922487315832, 0.30263654463323614, -0.35316968138419813, -0.18967038384508542, 0.10517588619302998, 0.18991246310648538, 0.0572006727333471, 0.0036786232432801155, -0.20862557934922596, 0.16882447604971226, -0.21004612704298348, -0.0842735014645563, 0.05508656101802024, -0.016084574693713778, 0.07210019698381544, -0.30261006997147155, 0.010088757278994777, -0.02785286975283456, -0.006581283141908947, -0.0886740298223211, -0.1291437311979231, -0.018308092568380136, 0.210956749150164, 0.05544502857787114, 0.007806563002598141, 0.13976597880145974, -0.1239147381769413, -0.07453325960374567, 0.3705348088155671, -0.00035425645253253017, -0.1575750308061239, 0.17573437881806203, -0.12071514049024192, -0.12412496835997289, 0.150194867045909, 0.17642823393426596, 0.08840378561252428, -0.13093074678189262, 0.04308146070244582, -0.01865932606260783, 0.2194792417438841, 0.07505053421732799, 0.08961413383498908, 0.11695418145785469, 0.18898962079221884, 0.18407311691071399, 0.13219777141010478, -0.10327399523943782, -0.09576958998466932, -0.19622089751865915, -0.14575328882683508, -0.2142819842919507, -0.00479010323440263, -0.13660495371974926, -0.07751093693428061, 0.34763315546336354, 0.13167708294130662, 0.15173949729851496, 0.1357383800605412, 0.3466283740896371, 0.13635177339955423, 0.08898152466562967, 0.13659883104515091, 0.24026174830292824, 0.05098602743831874, 0.10553374050825995, -0.3242219767423086, 0.09327705403018782, -0.03260645339946433]
|
1,803.03741
|
Tokunaga self-similarity arises naturally from time invariance
|
The Tokunaga condition is an algebraic rule that provides a detailed
description of the branching structure in a self-similar tree. Despite a solid
empirical validation and practical convenience, the Tokunaga condition lacks a
theoretical justification. Such a justification is suggested in this work. We
define a geometric branching processes $\mathcal{G}(s)$ that generates
self-similar rooted trees. The main result establishes the equivalence between
the invariance of $\mathcal{G}(s)$ with respect to a time shift and a
one-parametric version of the Tokunaga condition. In the parameter region where
the process satisfies the Tokunaga condition (and hence is time invariant),
$\mathcal{G}(s)$ enjoys many of the symmetries observed in a critical binary
Galton-Watson branching process and reproduce the latter for a particular
parameter value.
|
math.DS math.PR nlin.AO nlin.CD
|
the tokunaga condition is an algebraic rule that provides a detailed description of the branching structure in a selfsimilar tree despite a solid empirical validation and practical convenience the tokunaga condition lacks a theoretical justification such a justification is suggested in this work we define a geometric branching processes mathcalgs that generates selfsimilar rooted trees the main result establishes the equivalence between the invariance of mathcalgs with respect to a time shift and a oneparametric version of the tokunaga condition in the parameter region where the process satisfies the tokunaga condition and hence is time invariant mathcalgs enjoys many of the symmetries observed in a critical binary galtonwatson branching process and reproduce the latter for a particular parameter value
|
[['the', 'tokunaga', 'condition', 'is', 'an', 'algebraic', 'rule', 'that', 'provides', 'a', 'detailed', 'description', 'of', 'the', 'branching', 'structure', 'in', 'a', 'selfsimilar', 'tree', 'despite', 'a', 'solid', 'empirical', 'validation', 'and', 'practical', 'convenience', 'the', 'tokunaga', 'condition', 'lacks', 'a', 'theoretical', 'justification', 'such', 'a', 'justification', 'is', 'suggested', 'in', 'this', 'work', 'we', 'define', 'a', 'geometric', 'branching', 'processes', 'mathcalgs', 'that', 'generates', 'selfsimilar', 'rooted', 'trees', 'the', 'main', 'result', 'establishes', 'the', 'equivalence', 'between', 'the', 'invariance', 'of', 'mathcalgs', 'with', 'respect', 'to', 'a', 'time', 'shift', 'and', 'a', 'oneparametric', 'version', 'of', 'the', 'tokunaga', 'condition', 'in', 'the', 'parameter', 'region', 'where', 'the', 'process', 'satisfies', 'the', 'tokunaga', 'condition', 'and', 'hence', 'is', 'time', 'invariant', 'mathcalgs', 'enjoys', 'many', 'of', 'the', 'symmetries', 'observed', 'in', 'a', 'critical', 'binary', 'galtonwatson', 'branching', 'process', 'and', 'reproduce', 'the', 'latter', 'for', 'a', 'particular', 'parameter', 'value']]
|
[-0.14968466791549323, 0.11101470625983305, -0.1445810668593069, 0.09106386839740488, -0.11865877947464835, -0.10290366627995957, 0.11032305481773214, 0.3127399123168136, -0.24466585252089662, -0.22670329416790946, 0.09176875987019734, -0.2042364294507674, -0.1340440950205891, 0.15446101416278035, -0.06933571050406293, 0.074762649865461, 0.07315472104516224, 0.050440151475276016, -0.04393531907420261, -0.145049817924693, 0.29042638270106136, 0.06724706171236995, 0.2963871270919046, 0.05491015189151209, 0.14122516663447648, -0.01230665821065547, -0.022217602019018234, 0.01203731051059205, -0.17819128178528162, 0.053392626943375855, 0.18879363933155516, 0.13579097255563535, 0.24750113422872827, -0.31897118080313464, -0.15633726078369303, 0.1432874955142997, 0.1085643329649788, 0.08119625754717018, -0.03535649369807303, -0.2644538212647787, 0.08481063016400743, -0.12771157551940313, -0.1736236126201243, -0.047188656889841335, 0.07431503453198038, -0.018562714944930135, -0.3234580825107415, 0.07364440044122082, 0.1743670455062715, 0.06898193818149197, -0.0372268804212046, -0.06881620818181668, -0.04843415667404648, 0.05789263907256497, 0.04365837992073091, 0.02395933951024248, 0.09199031573884628, -0.10254164446466171, -0.13208947509151547, 0.3973452005566669, -0.029788550282945903, -0.20730534366120687, 0.15926356855466836, -0.12489880137575962, -0.2242451806967499, 0.11612072678188942, 0.10873323148351256, 0.08260299250123505, -0.15348565814568574, 0.1455074659129996, -0.09074697574647535, 0.12488300100892406, 0.060320338293002186, -0.0009963011384761635, 0.13008136317102598, 0.2176201027610629, 0.06901174221538055, 0.1620727693583785, 0.005080668971787731, -0.15744378159073094, -0.35389439069799017, -0.19531764230101972, -0.12311803428417056, 0.06277888482182185, -0.13542625322857746, -0.21660085070189558, 0.3492482935954981, 0.12750376854874507, 0.2562491031316649, 0.1434099768726703, 0.23579366056506812, 0.16100473863761403, 0.015960363749445986, 0.03729176846481547, 0.18613667359591282, 0.19164698618706785, 0.07799486644534755, -0.16401719804090142, 0.14112848510276996, 0.10522662586837757]
|
1,803.03742
|
K-shell decomposition reveals hierarchical cortical organization of the
human brain
|
In recent years numerous attempts to understand the human brain were
undertaken from a network point of view. A network framework takes into account
the relationships between the different parts of the system and enables to
examine how global and complex functions might emerge from network topology.
Previous work revealed that the human brain features 'small world'
characteristics and that cortical hubs tend to interconnect among themselves.
However, in order to fully understand the topological structure of hubs one
needs to go beyond the properties of a specific hub and examine the various
structural layers of the network. To address this topic further, we applied an
analysis known in statistical physics and network theory as k-shell
decomposition analysis. The analysis was applied on a human cortical network,
derived from MRI\DSI data of six participants. Such analysis enables us to
portray a detailed account of cortical connectivity focusing on different
neighborhoods of interconnected layers across the cortex. Our findings reveal
that the human cortex is highly connected and efficient, and unlike the
internet network contains no isolated nodes. The cortical network is comprised
of a nucleus alongside shells of increasing connectivity that formed one
connected giant component. All these components were further categorized into
three hierarchies in accordance with their connectivity profile, with each
hierarchy reflecting different functional roles. Such a model may explain an
efficient flow of information from the lowest hierarchy to the highest one,
with each step enabling increased data integration. At the top, the highest
hierarchy (the nucleus) serves as a global interconnected collective and
demonstrates high correlation with consciousness related regions, suggesting
that the nucleus might serve as a platform for consciousness to emerge.
|
q-bio.NC
|
in recent years numerous attempts to understand the human brain were undertaken from a network point of view a network framework takes into account the relationships between the different parts of the system and enables to examine how global and complex functions might emerge from network topology previous work revealed that the human brain features small world characteristics and that cortical hubs tend to interconnect among themselves however in order to fully understand the topological structure of hubs one needs to go beyond the properties of a specific hub and examine the various structural layers of the network to address this topic further we applied an analysis known in statistical physics and network theory as kshell decomposition analysis the analysis was applied on a human cortical network derived from mridsi data of six participants such analysis enables us to portray a detailed account of cortical connectivity focusing on different neighborhoods of interconnected layers across the cortex our findings reveal that the human cortex is highly connected and efficient and unlike the internet network contains no isolated nodes the cortical network is comprised of a nucleus alongside shells of increasing connectivity that formed one connected giant component all these components were further categorized into three hierarchies in accordance with their connectivity profile with each hierarchy reflecting different functional roles such a model may explain an efficient flow of information from the lowest hierarchy to the highest one with each step enabling increased data integration at the top the highest hierarchy the nucleus serves as a global interconnected collective and demonstrates high correlation with consciousness related regions suggesting that the nucleus might serve as a platform for consciousness to emerge
|
[['in', 'recent', 'years', 'numerous', 'attempts', 'to', 'understand', 'the', 'human', 'brain', 'were', 'undertaken', 'from', 'a', 'network', 'point', 'of', 'view', 'a', 'network', 'framework', 'takes', 'into', 'account', 'the', 'relationships', 'between', 'the', 'different', 'parts', 'of', 'the', 'system', 'and', 'enables', 'to', 'examine', 'how', 'global', 'and', 'complex', 'functions', 'might', 'emerge', 'from', 'network', 'topology', 'previous', 'work', 'revealed', 'that', 'the', 'human', 'brain', 'features', 'small', 'world', 'characteristics', 'and', 'that', 'cortical', 'hubs', 'tend', 'to', 'interconnect', 'among', 'themselves', 'however', 'in', 'order', 'to', 'fully', 'understand', 'the', 'topological', 'structure', 'of', 'hubs', 'one', 'needs', 'to', 'go', 'beyond', 'the', 'properties', 'of', 'a', 'specific', 'hub', 'and', 'examine', 'the', 'various', 'structural', 'layers', 'of', 'the', 'network', 'to', 'address', 'this', 'topic', 'further', 'we', 'applied', 'an', 'analysis', 'known', 'in', 'statistical', 'physics', 'and', 'network', 'theory', 'as', 'kshell', 'decomposition', 'analysis', 'the', 'analysis', 'was', 'applied', 'on', 'a', 'human', 'cortical', 'network', 'derived', 'from', 'mridsi', 'data', 'of', 'six', 'participants', 'such', 'analysis', 'enables', 'us', 'to', 'portray', 'a', 'detailed', 'account', 'of', 'cortical', 'connectivity', 'focusing', 'on', 'different', 'neighborhoods', 'of', 'interconnected', 'layers', 'across', 'the', 'cortex', 'our', 'findings', 'reveal', 'that', 'the', 'human', 'cortex', 'is', 'highly', 'connected', 'and', 'efficient', 'and', 'unlike', 'the', 'internet', 'network', 'contains', 'no', 'isolated', 'nodes', 'the', 'cortical', 'network', 'is', 'comprised', 'of', 'a', 'nucleus', 'alongside', 'shells', 'of', 'increasing', 'connectivity', 'that', 'formed', 'one', 'connected', 'giant', 'component', 'all', 'these', 'components', 'were', 'further', 'categorized', 'into', 'three', 'hierarchies', 'in', 'accordance', 'with', 'their', 'connectivity', 'profile', 'with', 'each', 'hierarchy', 'reflecting', 'different', 'functional', 'roles', 'such', 'a', 'model', 'may', 'explain', 'an', 'efficient', 'flow', 'of', 'information', 'from', 'the', 'lowest', 'hierarchy', 'to', 'the', 'highest', 'one', 'with', 'each', 'step', 'enabling', 'increased', 'data', 'integration', 'at', 'the', 'top', 'the', 'highest', 'hierarchy', 'the', 'nucleus', 'serves', 'as', 'a', 'global', 'interconnected', 'collective', 'and', 'demonstrates', 'high', 'correlation', 'with', 'consciousness', 'related', 'regions', 'suggesting', 'that', 'the', 'nucleus', 'might', 'serve', 'as', 'a', 'platform', 'for', 'consciousness', 'to', 'emerge']]
|
[-0.10883063619573086, 0.05494552856512512, -0.07084551276908078, 0.07449274657618604, -0.07996091448965849, -0.12091988640995394, 0.040290244563738226, 0.37928396503067835, -0.2683272219047838, -0.33066387758976934, 0.06221135015118639, -0.2972572979244945, -0.2246216660128429, 0.1366547734152176, -0.030043545632962715, -0.0030550539404463144, 0.04569451277655304, 0.0520092240729729, -0.002528212684213389, -0.18243863209980662, 0.3127205932398565, 0.042419418104208115, 0.32606687057185046, 0.03456776661155657, 0.07839281302002606, -0.03731449252870337, -0.05440893507476842, 0.025946578283252916, -0.06685463489781471, 0.18381035787688857, 0.29208608534969205, 0.14574977202384667, 0.3078807796652526, -0.5190027956094337, -0.2469824629807206, 0.06628877430227972, 0.17123702362294071, 0.06909657057731107, 0.027001514545867106, -0.3009350352982792, 0.0926995087685635, -0.16168829456092756, -0.0955287165156421, -0.07228105573281175, -0.011616385107295124, -0.0005151315305183645, -0.20613044352268142, 0.044091206085040247, 0.02904436739820597, 0.06163174459804858, -0.06136892132405595, -0.096570007667359, -0.06560756198075073, 0.24203193420544267, 0.03959717287279376, 0.021129765366254515, 0.1847306786332824, -0.14429226736208198, -0.10671752991153949, 0.3326157992201376, 0.02872160770669781, -0.1421579413842208, 0.24063779062688997, -0.11477868945761466, -0.172722698473422, 0.09837684350105891, 0.1948717613965071, 0.024082615143629565, -0.15867157332243614, -0.02947476173882181, -0.02142168633263249, 0.19614674832719373, 0.02355969548628864, 0.027860314501634384, 0.22746130571085355, 0.23721821421912, 0.049472532064219164, 0.13332360677105048, -0.09386378344920017, -0.11438361136915183, -0.23674456472928881, -0.11813227618987325, -0.135087650476464, 0.0037296592902614054, -0.106299066228123, -0.13722100895106631, 0.4583446602253008, 0.12112717919304021, 0.24275204013286678, 0.022943239366456643, 0.25051441122164164, 0.01950969802474583, 0.1446919054783114, 0.06514409725513941, 0.20483740237760037, 0.11578374914239209, 0.12843738788980924, -0.1803671292757232, 0.11577929936337625, 0.01046232697772474]
|
1,803.03743
|
Classical and quantum dissipative dynamics in Josephson junctions: an
Arnold problem, bifurcation and capture into resonance
|
We theoretically study the phase dynamics in Josephson junctions, which maps
onto the oscillatory motion of a point-like particle in the washboard
potential. Under appropriate driving and damping conditions, the Josephson
phase undergoes intriguing bistable dynamics near a saddle point in the
quasienergy landscape. The bifurcation mechanism plays a critical role in
superconducting quantum circuits with relevance to non-demolition measurements
such as high-fidelity readout of qubit states. We address the question `what is
the probability of capture into either basin of attraction' and answer it
concerning both classical and quantum dynamics. Consequently, we derive the
Arnold probability and numerically analyze its implementation of the controlled
dynamical switching between two steady states under the various nonequilibrium
conditions.
|
cond-mat.stat-mech quant-ph
|
we theoretically study the phase dynamics in josephson junctions which maps onto the oscillatory motion of a pointlike particle in the washboard potential under appropriate driving and damping conditions the josephson phase undergoes intriguing bistable dynamics near a saddle point in the quasienergy landscape the bifurcation mechanism plays a critical role in superconducting quantum circuits with relevance to nondemolition measurements such as highfidelity readout of qubit states we address the question what is the probability of capture into either basin of attraction and answer it concerning both classical and quantum dynamics consequently we derive the arnold probability and numerically analyze its implementation of the controlled dynamical switching between two steady states under the various nonequilibrium conditions
|
[['we', 'theoretically', 'study', 'the', 'phase', 'dynamics', 'in', 'josephson', 'junctions', 'which', 'maps', 'onto', 'the', 'oscillatory', 'motion', 'of', 'a', 'pointlike', 'particle', 'in', 'the', 'washboard', 'potential', 'under', 'appropriate', 'driving', 'and', 'damping', 'conditions', 'the', 'josephson', 'phase', 'undergoes', 'intriguing', 'bistable', 'dynamics', 'near', 'a', 'saddle', 'point', 'in', 'the', 'quasienergy', 'landscape', 'the', 'bifurcation', 'mechanism', 'plays', 'a', 'critical', 'role', 'in', 'superconducting', 'quantum', 'circuits', 'with', 'relevance', 'to', 'nondemolition', 'measurements', 'such', 'as', 'highfidelity', 'readout', 'of', 'qubit', 'states', 'we', 'address', 'the', 'question', 'what', 'is', 'the', 'probability', 'of', 'capture', 'into', 'either', 'basin', 'of', 'attraction', 'and', 'answer', 'it', 'concerning', 'both', 'classical', 'and', 'quantum', 'dynamics', 'consequently', 'we', 'derive', 'the', 'arnold', 'probability', 'and', 'numerically', 'analyze', 'its', 'implementation', 'of', 'the', 'controlled', 'dynamical', 'switching', 'between', 'two', 'steady', 'states', 'under', 'the', 'various', 'nonequilibrium', 'conditions']]
|
[-0.21548953690116518, 0.1778816960286349, -0.09215860628795906, 0.06978934742048672, 0.025790900662380815, -0.1850177365172542, 0.10225704087121092, 0.33901017631307756, -0.2734428770370492, -0.23785848373442825, 0.04665176842937744, -0.2533226439544674, -0.1977467133005246, 0.2063382778965049, -0.00962983044908093, 0.0983625450487658, 0.03997333912813137, -0.009787731129547646, -0.03307494120913204, -0.1389177794445804, 0.31773376625416605, 0.002043982520137496, 0.313091362549538, 0.04011417048529658, 0.10252184338818991, -0.034172914479972075, 0.09992628634088384, -0.03096337159914928, -0.18153333636643043, 0.002153008693532119, 0.2221331072184418, 0.02114341153004528, 0.26194968638170896, -0.490268032178925, -0.1938871713596043, 0.12879443300912027, 0.14084357170564732, 0.16390187068188017, -0.05511320565409701, -0.3350878791112838, -0.0023064840342126914, -0.11266748866182752, -0.1585681643096152, -0.09283478888040729, 0.03828064242682966, 0.016795087619764924, -0.21627756488381017, 0.06735199525679365, 0.09041226325643947, 0.06410726936180787, -0.053429741142438085, 0.017794596015250887, -0.04021788003617609, 0.12516526355616878, -0.01929198784305613, -0.005586447581600654, 0.2057719474722599, -0.17454214358766532, -0.12139759581648456, 0.32465396927878387, -0.044818546716324535, -0.19699140534342813, 0.18493330514797107, -0.14206003096829778, -0.07524817734796169, 0.10430076627205287, 0.13066395083924048, 0.050598685051603566, -0.15625727927545086, 0.0853433146558959, 0.02484387323131849, 0.12088377979019023, 0.09306822158195528, 0.08516533995962478, 0.24682242628829232, 0.20016206024166452, 0.09822700439213679, 0.2011505399458311, -0.12117133254349906, -0.2233083931857656, -0.29534090662792584, -0.13848023723553995, -0.17272579725550744, 0.09582126345525592, -0.057265372304065185, -0.19776498769000495, 0.4432513773328914, 0.1684639430459356, 0.1802172683709269, -0.05410714205735813, 0.25188025918885554, 0.14635840361157096, -0.04183206238466765, 0.029493292464457196, 0.22457202392277018, 0.1798986394343705, 0.10101855923080463, -0.3406995839383132, 0.05456696040045213, 0.0486790868734684]
|
1,803.03744
|
Enhanced Optimization with Composite Objectives and Novelty Selection
|
An important benefit of multi-objective search is that it maintains a diverse
population of candidates, which helps in deceptive problems in particular. Not
all diversity is useful, however: candidates that optimize only one objective
while ignoring others are rarely helpful. This paper proposes a solution: The
original objectives are replaced by their linear combinations, thus focusing
the search on the most useful tradeoffs between objectives. To compensate for
the loss of diversity, this transformation is accompanied by a selection
mechanism that favors novelty. In the highly deceptive problem of discovering
minimal sorting networks, this approach finds better solutions, and finds them
faster and more consistently than standard methods. It is therefore a promising
approach to solving deceptive problems through multi-objective optimization.
|
cs.NE
|
an important benefit of multiobjective search is that it maintains a diverse population of candidates which helps in deceptive problems in particular not all diversity is useful however candidates that optimize only one objective while ignoring others are rarely helpful this paper proposes a solution the original objectives are replaced by their linear combinations thus focusing the search on the most useful tradeoffs between objectives to compensate for the loss of diversity this transformation is accompanied by a selection mechanism that favors novelty in the highly deceptive problem of discovering minimal sorting networks this approach finds better solutions and finds them faster and more consistently than standard methods it is therefore a promising approach to solving deceptive problems through multiobjective optimization
|
[['an', 'important', 'benefit', 'of', 'multiobjective', 'search', 'is', 'that', 'it', 'maintains', 'a', 'diverse', 'population', 'of', 'candidates', 'which', 'helps', 'in', 'deceptive', 'problems', 'in', 'particular', 'not', 'all', 'diversity', 'is', 'useful', 'however', 'candidates', 'that', 'optimize', 'only', 'one', 'objective', 'while', 'ignoring', 'others', 'are', 'rarely', 'helpful', 'this', 'paper', 'proposes', 'a', 'solution', 'the', 'original', 'objectives', 'are', 'replaced', 'by', 'their', 'linear', 'combinations', 'thus', 'focusing', 'the', 'search', 'on', 'the', 'most', 'useful', 'tradeoffs', 'between', 'objectives', 'to', 'compensate', 'for', 'the', 'loss', 'of', 'diversity', 'this', 'transformation', 'is', 'accompanied', 'by', 'a', 'selection', 'mechanism', 'that', 'favors', 'novelty', 'in', 'the', 'highly', 'deceptive', 'problem', 'of', 'discovering', 'minimal', 'sorting', 'networks', 'this', 'approach', 'finds', 'better', 'solutions', 'and', 'finds', 'them', 'faster', 'and', 'more', 'consistently', 'than', 'standard', 'methods', 'it', 'is', 'therefore', 'a', 'promising', 'approach', 'to', 'solving', 'deceptive', 'problems', 'through', 'multiobjective', 'optimization']]
|
[-0.08177173355775154, 0.023748475747603408, -0.06250480785658044, 0.12222602553444353, -0.1504909688229711, -0.210876437211948, 0.07467933057149302, 0.39766590252195383, -0.2778799408355974, -0.36025125601074914, 0.08740760942955679, -0.2664529583493848, -0.2163846110694172, 0.21170049095680274, -0.07558415819359712, 0.04510881958533201, 0.08485973834768246, -0.030354930772946393, -0.034711928770700395, -0.29640655528969506, 0.28535550526412556, 0.08471908518459556, 0.2976843247821262, 0.004814674627528457, 0.08529313108094867, 0.006017390969555733, -0.025028853323156675, 0.03770933343359262, -0.03734858299133874, 0.16799569495834318, 0.32470855339668875, 0.24839185152110482, 0.39141597664984296, -0.364815155305892, -0.2158590808533871, 0.15978101966902614, 0.18381282687956882, 0.09498611163474958, -0.09378455650056078, -0.2286452899633114, 0.09153818330161796, -0.08551065566250092, -0.06325469361541193, -0.10212320535759295, -0.013060392904256986, -0.018274458185365532, -0.28405382944855934, 0.04496490002103118, 0.06606811331103994, -0.03558409538635723, -0.05399920534889006, -0.1431706553298118, 0.016526676760601603, 0.1107553615704302, 0.07255624706110309, 0.02972282501984357, 0.07600389547984708, -0.15488542894032314, -0.152104457014833, 0.4406952072273601, 0.006913755228911326, -0.2393643827564112, 0.2167833037857228, -0.029677239346725882, -0.12323583218977163, 0.1539801429410673, 0.1788558729323905, 0.20177088272642374, -0.21891538600229526, -0.008200620365529206, -0.010331590567553832, 0.17561091807640103, 0.03481147756168911, 0.0418435381302102, 0.21245848896436023, 0.2441483372586687, 0.14238314385225703, 0.1421658958285308, 0.007859750792974884, -0.11602037307452256, -0.2089049453339116, -0.12521155521106206, -0.1421390678974115, -0.048469729453959304, -0.08706274216062358, -0.11424770007633474, 0.3925331363008042, 0.198409035963522, 0.16065940078471072, 0.04597708628915081, 0.3227182306380065, 0.06723201405333955, 0.09150896376058505, 0.06803359062033744, 0.228522712917044, 0.014649338306366536, 0.09815848327996132, -0.19821482495220055, 0.1510704248789544, 0.017453499403897642]
|
1,803.03745
|
Evolutionary Architecture Search For Deep Multitask Networks
|
Multitask learning, i.e. learning several tasks at once with the same neural
network, can improve performance in each of the tasks. Designing deep neural
network architectures for multitask learning is a challenge: There are many
ways to tie the tasks together, and the design choices matter. The size and
complexity of this problem exceeds human design ability, making it a compelling
domain for evolutionary optimization. Using the existing state of the art soft
ordering architecture as the starting point, methods for evolving the modules
of this architecture and for evolving the overall topology or routing between
modules are evaluated in this paper. A synergetic approach of evolving custom
routings with evolved, shared modules for each task is found to be very
powerful, significantly improving the state of the art in the Omniglot
multitask, multialphabet character recognition domain. This result demonstrates
how evolution can be instrumental in advancing deep neural network and complex
system design in general.
|
cs.NE cs.AI
|
multitask learning ie learning several tasks at once with the same neural network can improve performance in each of the tasks designing deep neural network architectures for multitask learning is a challenge there are many ways to tie the tasks together and the design choices matter the size and complexity of this problem exceeds human design ability making it a compelling domain for evolutionary optimization using the existing state of the art soft ordering architecture as the starting point methods for evolving the modules of this architecture and for evolving the overall topology or routing between modules are evaluated in this paper a synergetic approach of evolving custom routings with evolved shared modules for each task is found to be very powerful significantly improving the state of the art in the omniglot multitask multialphabet character recognition domain this result demonstrates how evolution can be instrumental in advancing deep neural network and complex system design in general
|
[['multitask', 'learning', 'ie', 'learning', 'several', 'tasks', 'at', 'once', 'with', 'the', 'same', 'neural', 'network', 'can', 'improve', 'performance', 'in', 'each', 'of', 'the', 'tasks', 'designing', 'deep', 'neural', 'network', 'architectures', 'for', 'multitask', 'learning', 'is', 'a', 'challenge', 'there', 'are', 'many', 'ways', 'to', 'tie', 'the', 'tasks', 'together', 'and', 'the', 'design', 'choices', 'matter', 'the', 'size', 'and', 'complexity', 'of', 'this', 'problem', 'exceeds', 'human', 'design', 'ability', 'making', 'it', 'a', 'compelling', 'domain', 'for', 'evolutionary', 'optimization', 'using', 'the', 'existing', 'state', 'of', 'the', 'art', 'soft', 'ordering', 'architecture', 'as', 'the', 'starting', 'point', 'methods', 'for', 'evolving', 'the', 'modules', 'of', 'this', 'architecture', 'and', 'for', 'evolving', 'the', 'overall', 'topology', 'or', 'routing', 'between', 'modules', 'are', 'evaluated', 'in', 'this', 'paper', 'a', 'synergetic', 'approach', 'of', 'evolving', 'custom', 'routings', 'with', 'evolved', 'shared', 'modules', 'for', 'each', 'task', 'is', 'found', 'to', 'be', 'very', 'powerful', 'significantly', 'improving', 'the', 'state', 'of', 'the', 'art', 'in', 'the', 'omniglot', 'multitask', 'multialphabet', 'character', 'recognition', 'domain', 'this', 'result', 'demonstrates', 'how', 'evolution', 'can', 'be', 'instrumental', 'in', 'advancing', 'deep', 'neural', 'network', 'and', 'complex', 'system', 'design', 'in', 'general']]
|
[-0.08408059691709857, 0.019323975316459133, -0.07059972765705277, 0.034625285585981706, -0.11049926649899253, -0.19833468684566116, 0.008570691958941038, 0.4531745598320999, -0.3013097233349277, -0.3449542099189374, 0.07096473455143672, -0.2085489960327264, -0.2130905091597308, 0.19400542589174885, -0.1115990647257516, 0.08500799099283833, 0.15497910702721246, 0.04172960585734296, -0.07700559312417622, -0.2989599535061467, 0.3292324791346947, 0.045227555873157875, 0.3455568337512593, 0.011375367965909742, 0.12023746197322203, -0.020786974072876958, 0.019743868408183898, -0.022885036128272692, -0.030302720418530365, 0.19160466578623822, 0.36710348612809135, 0.21337985370097862, 0.3488036416320791, -0.40273813489944704, -0.24649879771374886, 0.10043368419151633, 0.1563469967203996, 0.09289719053814488, -0.010201086839961428, -0.31174547353969706, 0.07649073832698407, -0.17622546184687846, -0.014548714086413384, -0.10087261379906727, -0.018841689323345498, -0.006661774996187418, -0.2585931481793523, -0.01916333289156037, 0.07038599829519948, 0.036383961423510504, -0.07459950865126184, -0.1356347303131535, 0.03271889590748375, 0.19668637766322541, -0.005453732551165646, 0.0850001471544308, 0.16095469478637942, -0.24074084649703675, -0.17041694304395105, 0.33158100990037764, -0.02363763049455179, -0.21035108001482103, 0.21709573175758123, -0.006811512562055742, -0.18469837765780187, 0.08091620352089164, 0.22791305754874502, 0.08434457193098722, -0.16186918813374734, 0.019763794533848283, -0.0008151864212366843, 0.1636354294678782, 0.02559450813869555, 0.012988983712444502, 0.19971834286266277, 0.35310736011052807, 0.03839338882638502, 0.14317831295963016, -0.07605878944478689, -0.08228566698549736, -0.1903262801588543, -0.12244152999933688, -0.16832862183031055, -0.014919044852497116, -0.10208132367002808, -0.12172862905408105, 0.419035164687422, 0.18877324214385402, 0.18028148997935556, 0.11983433313547603, 0.34448323845863343, 0.02786244748295435, 0.11384093973845724, 0.128756742683735, 0.20229575327792837, 0.021880479454393347, 0.156023139885116, -0.20197750418146532, 0.10331841803065711, 0.014087885710215497]
|
1,803.03746
|
Signal Optimization with HV divider of MCP-PMT for JUNO
|
The Jiangmen Underground Neutrino Observatory (JUNO) is proposed to determine
the neutrino mass hierarchy using a 20 kiloton underground liquid scintillator
detector (CD). One of the keys is the energy resolution of the CD to reach <3%
at 1 MeV, where totally 15,000 MCP-PMT will be used. The optimization of the
20-inch MCP-PMT is very important for better detection efficiency and stable
performance. In this work, we will show the study to optimize the MCP-PMT
working configuration for charge measurement. Particularly, the quality of PMT
signal is another key for high-precision neutrino experiments while most of
these experiments are affected by the overshoot of PMT signal from the positive
HV scheme. The overshoot coupled with positive HV which is troubling trigger,
dead time and precise charge measurement, we have studied to control it to less
than 1% of signal amplitude for a better physics measurement. In this article,
on the one hand, the optimized HV divider ratio will be presented here to
improve its collection efficiency; on the other hand, we will introduce the
method to reduce the ratio of overshoot from 10% to 1%.
|
physics.ins-det hep-ex
|
the jiangmen underground neutrino observatory juno is proposed to determine the neutrino mass hierarchy using a 20 kiloton underground liquid scintillator detector cd one of the keys is the energy resolution of the cd to reach 3 at 1 mev where totally 15000 mcppmt will be used the optimization of the 20inch mcppmt is very important for better detection efficiency and stable performance in this work we will show the study to optimize the mcppmt working configuration for charge measurement particularly the quality of pmt signal is another key for highprecision neutrino experiments while most of these experiments are affected by the overshoot of pmt signal from the positive hv scheme the overshoot coupled with positive hv which is troubling trigger dead time and precise charge measurement we have studied to control it to less than 1 of signal amplitude for a better physics measurement in this article on the one hand the optimized hv divider ratio will be presented here to improve its collection efficiency on the other hand we will introduce the method to reduce the ratio of overshoot from 10 to 1
|
[['the', 'jiangmen', 'underground', 'neutrino', 'observatory', 'juno', 'is', 'proposed', 'to', 'determine', 'the', 'neutrino', 'mass', 'hierarchy', 'using', 'a', '20', 'kiloton', 'underground', 'liquid', 'scintillator', 'detector', 'cd', 'one', 'of', 'the', 'keys', 'is', 'the', 'energy', 'resolution', 'of', 'the', 'cd', 'to', 'reach', '3', 'at', '1', 'mev', 'where', 'totally', '15000', 'mcppmt', 'will', 'be', 'used', 'the', 'optimization', 'of', 'the', '20inch', 'mcppmt', 'is', 'very', 'important', 'for', 'better', 'detection', 'efficiency', 'and', 'stable', 'performance', 'in', 'this', 'work', 'we', 'will', 'show', 'the', 'study', 'to', 'optimize', 'the', 'mcppmt', 'working', 'configuration', 'for', 'charge', 'measurement', 'particularly', 'the', 'quality', 'of', 'pmt', 'signal', 'is', 'another', 'key', 'for', 'highprecision', 'neutrino', 'experiments', 'while', 'most', 'of', 'these', 'experiments', 'are', 'affected', 'by', 'the', 'overshoot', 'of', 'pmt', 'signal', 'from', 'the', 'positive', 'hv', 'scheme', 'the', 'overshoot', 'coupled', 'with', 'positive', 'hv', 'which', 'is', 'troubling', 'trigger', 'dead', 'time', 'and', 'precise', 'charge', 'measurement', 'we', 'have', 'studied', 'to', 'control', 'it', 'to', 'less', 'than', '1', 'of', 'signal', 'amplitude', 'for', 'a', 'better', 'physics', 'measurement', 'in', 'this', 'article', 'on', 'the', 'one', 'hand', 'the', 'optimized', 'hv', 'divider', 'ratio', 'will', 'be', 'presented', 'here', 'to', 'improve', 'its', 'collection', 'efficiency', 'on', 'the', 'other', 'hand', 'we', 'will', 'introduce', 'the', 'method', 'to', 'reduce', 'the', 'ratio', 'of', 'overshoot', 'from', '10', 'to', '1']]
|
[-0.06955415018255244, 0.14766376744200652, -0.044839181401766834, 0.051414762242898544, -0.05202757074777666, -0.1668444757601498, 0.033312432892066805, 0.3482558812493005, -0.21729018626596175, -0.3502085599544886, 0.13514693255938992, -0.2987771090031979, -0.04453547791754072, 0.23011998482098853, -0.05260899492816345, 0.046275173150619645, 0.08299207890255225, 0.037747177540802875, -0.07803192378550365, -0.24504957585469694, 0.23286881565896644, 0.15316245521141872, 0.2770281994098646, 0.07056327208473875, 0.12524800104265277, -0.04843035249568119, -0.042694927135331406, -0.024268192722386606, -0.09607328998740618, 0.05542646973091807, 0.28610267445580356, 0.12182404832801202, 0.19847612279794505, -0.4087666115547354, -0.14475794029799668, 0.13686969255827167, 0.10322799767946472, 0.026298718376563408, -0.05480248588892455, -0.26431941769362705, 0.13597322018766725, -0.16854553921997698, -0.10005049343925675, 0.008708028909608697, -0.02653385563375982, 0.00882943907856463, -0.26078027040143875, 0.03258387361829345, -0.004254832032342706, 0.003902212160362585, -0.012072241154650377, -0.16475424568697408, 0.04129921982719286, 0.09976219172916702, 0.02653951879490066, 0.043147389963269236, 0.1612003654531027, -0.11685730884908824, -0.056219385991602935, 0.3587763205774733, -0.06966821583580994, -0.16960409670262724, 0.15370122353118418, -0.17772364741996735, -0.09236478664836771, 0.16179681001840682, 0.18713870389840087, 0.09169695147036298, -0.1444340571811473, -0.006309359732738419, 0.010688354525513746, 0.21302879190676519, 0.08460398587725453, 0.009523355067279693, 0.1995834342858477, 0.2820324939902167, 0.12018881757945024, 0.058104433281963845, -0.20039893740259512, -0.02250439994339202, -0.2869732680655009, -0.17806715936953757, -0.14224098083229636, 0.04758837937654273, -0.036646388629545786, -0.07336663327406387, 0.43037326068535203, 0.18321695737792432, 0.14196719543983202, 0.0007521239979305884, 0.3358748217836979, 0.07818135170870133, 0.08611470566357712, -0.005455565117802975, 0.31744139091036205, 0.12171415803746345, 0.14219685494522186, -0.23937092371712868, 0.04497514142390542, 0.011138753250644014]
|
1,803.03747
|
Emergence of spiral dark solitons in the merging of rotating
Bose-Einstein condensates
|
Merging of isolated Bose-Einstein condensates (BECs) is an important topic
due to its relevance to matter-wave interferometry and the Kibble-Zurek
mechanism. Many past research focused on merging of BECs with uniform initial
phases. In our recent numerical study (Phys. Rev. A 97, 013612 (2018)), we
revealed that upon merging of rotating BECs with non-uniform initial phases,
spiral-shaped dark solitons can emerge. These solitons facilitate angular
momentum transfer and allow the merged condensate to rotate even in the absence
of quantized vortices. More strikingly, the sharp endpoints of these spiral
solitons can induce rotational motion in the BECs like vortices but with
effectively a fraction of a quantized circulation. This paper reports our
systematic study on the merging dynamics of rotating BECs. We discuss how the
potential barrier that initially separates the BECs can affect the profile of
the spiral solitons. We also show that the number of spiral solitons created in
the BECs matches the relative winding number of the rotating BECs. The
underlying mechanism of the observed soliton dynamics is explained.
|
cond-mat.quant-gas
|
merging of isolated boseeinstein condensates becs is an important topic due to its relevance to matterwave interferometry and the kibblezurek mechanism many past research focused on merging of becs with uniform initial phases in our recent numerical study phys rev a 97 013612 2018 we revealed that upon merging of rotating becs with nonuniform initial phases spiralshaped dark solitons can emerge these solitons facilitate angular momentum transfer and allow the merged condensate to rotate even in the absence of quantized vortices more strikingly the sharp endpoints of these spiral solitons can induce rotational motion in the becs like vortices but with effectively a fraction of a quantized circulation this paper reports our systematic study on the merging dynamics of rotating becs we discuss how the potential barrier that initially separates the becs can affect the profile of the spiral solitons we also show that the number of spiral solitons created in the becs matches the relative winding number of the rotating becs the underlying mechanism of the observed soliton dynamics is explained
|
[['merging', 'of', 'isolated', 'boseeinstein', 'condensates', 'becs', 'is', 'an', 'important', 'topic', 'due', 'to', 'its', 'relevance', 'to', 'matterwave', 'interferometry', 'and', 'the', 'kibblezurek', 'mechanism', 'many', 'past', 'research', 'focused', 'on', 'merging', 'of', 'becs', 'with', 'uniform', 'initial', 'phases', 'in', 'our', 'recent', 'numerical', 'study', 'phys', 'rev', 'a', '97', '013612', '2018', 'we', 'revealed', 'that', 'upon', 'merging', 'of', 'rotating', 'becs', 'with', 'nonuniform', 'initial', 'phases', 'spiralshaped', 'dark', 'solitons', 'can', 'emerge', 'these', 'solitons', 'facilitate', 'angular', 'momentum', 'transfer', 'and', 'allow', 'the', 'merged', 'condensate', 'to', 'rotate', 'even', 'in', 'the', 'absence', 'of', 'quantized', 'vortices', 'more', 'strikingly', 'the', 'sharp', 'endpoints', 'of', 'these', 'spiral', 'solitons', 'can', 'induce', 'rotational', 'motion', 'in', 'the', 'becs', 'like', 'vortices', 'but', 'with', 'effectively', 'a', 'fraction', 'of', 'a', 'quantized', 'circulation', 'this', 'paper', 'reports', 'our', 'systematic', 'study', 'on', 'the', 'merging', 'dynamics', 'of', 'rotating', 'becs', 'we', 'discuss', 'how', 'the', 'potential', 'barrier', 'that', 'initially', 'separates', 'the', 'becs', 'can', 'affect', 'the', 'profile', 'of', 'the', 'spiral', 'solitons', 'we', 'also', 'show', 'that', 'the', 'number', 'of', 'spiral', 'solitons', 'created', 'in', 'the', 'becs', 'matches', 'the', 'relative', 'winding', 'number', 'of', 'the', 'rotating', 'becs', 'the', 'underlying', 'mechanism', 'of', 'the', 'observed', 'soliton', 'dynamics', 'is', 'explained']]
|
[-0.22360647064347736, 0.18767149133510053, -0.10681299558889709, 0.040868683923063094, -0.05400612968842537, -0.09406732720709597, 0.005228232435081481, 0.3662808532853834, -0.1863706487650324, -0.2723846737396146, 0.015334133973769974, -0.23138367319860828, -0.1091435892855999, 0.16936050063919558, -0.00602067819638559, 0.026360829743728238, 0.04623372797181623, -0.029609141867248376, -0.02785046529828173, -0.2806832596485378, 0.33251065700124316, 0.007003097277548578, 0.29583537980113506, 0.015200949086105092, 0.052409343756408544, -0.0324755328740075, 0.01347697461949803, -0.014413494235503744, -0.17764409438073628, 0.05548979561743245, 0.17451841586775946, 0.026148078827002243, 0.22973522678703853, -0.4887383155611872, -0.21938688752693478, 0.10885520727095897, 0.25453591599995107, 0.2339700940364634, -0.0871505287251393, -0.3682943370726983, -0.002661481413892225, -0.16326687346710905, -0.197434995116459, -0.10465469018812155, 0.05423681576850645, 0.09890972932648154, -0.19196708592564435, 0.134244988300553, 0.12128650934500272, 0.013453037178481531, -0.08548903181040605, -0.03248783644991355, -0.06144443561992886, 0.019962684245921715, 0.04359442672803889, 0.06658341189674837, 0.14479223357469975, -0.16721263443077614, -0.12189690078940918, 0.3754702315880912, -0.0850285496195092, -0.13749631127200976, 0.21768240607071299, -0.15329469426154507, -0.045631827895491445, 0.12714982328511643, 0.16953450147258609, 0.10826059050411421, -0.03604789530281086, -0.03721183355533782, -0.09027792623386396, 0.17624502471098077, 0.13967068029883487, 0.06012155805926835, 0.36027420949386924, 0.1665150043704378, 0.006415718144870619, 0.16044586111399295, -0.12547717606535197, -0.17283977397917688, -0.24832053907346308, -0.0978908237690727, -0.17495674436792122, -0.005606930575021052, -0.016723400526319234, -0.1261719439058886, 0.3926496602028434, 0.12731988716472964, 0.22157797628294743, -0.06730830263242954, 0.28240604785799284, 0.06885168345016018, 0.041910667307348104, 0.07370661111066543, 0.2912897413830703, 0.1501527137384472, 0.14165213162675827, -0.29947449232598666, -0.034065260028341315, 0.02040866454341585]
|
1,803.03748
|
Integrated Optimization of Partitioning, Scheduling and Floorplanning
for Partially Dynamically Reconfigurable Systems
|
Confronted with the challenge of high performance for applications and the
restriction of hardware resources for field-programmable gate arrays (FPGAs),
partial dynamic reconfiguration (PDR) technology is anticipated to accelerate
the reconfiguration process and alleviate the device shortage. In this paper,
we propose an integrated optimization framework for task partitioning,
scheduling and floorplanning on partially dynamically reconfigurable FPGAs. The
partitions, schedule, and floorplan of the tasks are represented by the
partitioned sequence triple P-ST (PS,QS,RS), where (PS,QS) is a hybrid nested
sequence pair (HNSP) for representing the spatial and temporal partitions, as
well as the floorplan, and RS is the partitioned dynamic configuration order of
the tasks. The floorplanning and scheduling of task modules can be computed
from the partitioned sequence triple P-ST in O(n^2) time. To integrate the
exploration of the scheduling and floorplanning design space, we use a
simulated annealing-based search engine and elaborate a perturbation method,
where a randomly chosen task module is removed from the partition sequence
triple and then inserted back into a proper position selected from all the
(n+1)^3 possible combinations of partitions, schedule and floorplan. The
experimental results demonstrate the efficiency and effectiveness of the
proposed framework.
|
cs.AR
|
confronted with the challenge of high performance for applications and the restriction of hardware resources for fieldprogrammable gate arrays fpgas partial dynamic reconfiguration pdr technology is anticipated to accelerate the reconfiguration process and alleviate the device shortage in this paper we propose an integrated optimization framework for task partitioning scheduling and floorplanning on partially dynamically reconfigurable fpgas the partitions schedule and floorplan of the tasks are represented by the partitioned sequence triple pst psqsrs where psqs is a hybrid nested sequence pair hnsp for representing the spatial and temporal partitions as well as the floorplan and rs is the partitioned dynamic configuration order of the tasks the floorplanning and scheduling of task modules can be computed from the partitioned sequence triple pst in on2 time to integrate the exploration of the scheduling and floorplanning design space we use a simulated annealingbased search engine and elaborate a perturbation method where a randomly chosen task module is removed from the partition sequence triple and then inserted back into a proper position selected from all the n13 possible combinations of partitions schedule and floorplan the experimental results demonstrate the efficiency and effectiveness of the proposed framework
|
[['confronted', 'with', 'the', 'challenge', 'of', 'high', 'performance', 'for', 'applications', 'and', 'the', 'restriction', 'of', 'hardware', 'resources', 'for', 'fieldprogrammable', 'gate', 'arrays', 'fpgas', 'partial', 'dynamic', 'reconfiguration', 'pdr', 'technology', 'is', 'anticipated', 'to', 'accelerate', 'the', 'reconfiguration', 'process', 'and', 'alleviate', 'the', 'device', 'shortage', 'in', 'this', 'paper', 'we', 'propose', 'an', 'integrated', 'optimization', 'framework', 'for', 'task', 'partitioning', 'scheduling', 'and', 'floorplanning', 'on', 'partially', 'dynamically', 'reconfigurable', 'fpgas', 'the', 'partitions', 'schedule', 'and', 'floorplan', 'of', 'the', 'tasks', 'are', 'represented', 'by', 'the', 'partitioned', 'sequence', 'triple', 'pst', 'psqsrs', 'where', 'psqs', 'is', 'a', 'hybrid', 'nested', 'sequence', 'pair', 'hnsp', 'for', 'representing', 'the', 'spatial', 'and', 'temporal', 'partitions', 'as', 'well', 'as', 'the', 'floorplan', 'and', 'rs', 'is', 'the', 'partitioned', 'dynamic', 'configuration', 'order', 'of', 'the', 'tasks', 'the', 'floorplanning', 'and', 'scheduling', 'of', 'task', 'modules', 'can', 'be', 'computed', 'from', 'the', 'partitioned', 'sequence', 'triple', 'pst', 'in', 'on2', 'time', 'to', 'integrate', 'the', 'exploration', 'of', 'the', 'scheduling', 'and', 'floorplanning', 'design', 'space', 'we', 'use', 'a', 'simulated', 'annealingbased', 'search', 'engine', 'and', 'elaborate', 'a', 'perturbation', 'method', 'where', 'a', 'randomly', 'chosen', 'task', 'module', 'is', 'removed', 'from', 'the', 'partition', 'sequence', 'triple', 'and', 'then', 'inserted', 'back', 'into', 'a', 'proper', 'position', 'selected', 'from', 'all', 'the', 'n13', 'possible', 'combinations', 'of', 'partitions', 'schedule', 'and', 'floorplan', 'the', 'experimental', 'results', 'demonstrate', 'the', 'efficiency', 'and', 'effectiveness', 'of', 'the', 'proposed', 'framework']]
|
[-0.15751305910089286, 0.06440935689480891, -0.025618337208773784, 0.027188865713365356, -0.07513926248914989, -0.1492062078541494, 0.08048917507827962, 0.4204954964516219, -0.30826450879734085, -0.3568195905245375, 0.10589920769052696, -0.21259068563813344, -0.13068575610183567, 0.1641246595766764, -0.0856559588064556, 0.08123821499005619, 0.11994609556859359, -0.00039961876488329534, -0.018163265966298543, -0.2419907491281871, 0.2598066791785338, 0.04419924419683715, 0.2991183441093502, 0.001757493814996754, 0.11727317775148549, 0.02264356432230367, -0.01190896980369871, 0.0019534374294683707, -0.05383808191982098, 0.09969898488270701, 0.29540555002070806, 0.19217499137145447, 0.2687718169860697, -0.4426063705274525, -0.13836538328420525, 0.08153970069542993, 0.1558217866064903, 0.03007913873079815, -0.02507271159447555, -0.27551472625539947, 0.11465666507380472, -0.18436253916540105, -0.023645805728544172, -0.04948085003707092, -0.007433136472779249, 0.021628426801423, -0.30462366797049373, -0.06067208783254804, 0.030070627815803164, -0.015625823205482448, -0.046979245908005396, -0.11449451186490478, -0.007922464080669064, 0.16881187020529373, -0.06505377570783821, 0.05093050904906704, 0.14167727681342512, -0.07157053134020923, -0.18834081901150057, 0.37136921218674007, 0.013626042356312004, -0.20888544180828225, 0.1325921493213779, -0.03543421541538313, -0.1476912504634432, 0.11215786370545781, 0.19235627521508528, 0.11708987765693261, -0.15081445750790104, 0.06285525451554956, 0.019146638772023532, 0.18238160475084442, 0.07754659700574014, 0.013464795435235525, 0.20534430214077778, 0.2463761711078405, 0.07436475819849875, 0.21246762884220516, -0.08427119496991509, -0.09824827959679776, -0.2531555875671832, -0.14969600604187386, -0.20462064771648633, -0.025908571480006987, -0.11161921300526956, -0.14061969903165542, 0.39894244600630674, 0.15596187224582536, 0.1943890567345079, 0.07887161021161167, 0.35575308828265406, 0.08737694182915827, 0.10456837523088325, 0.07842532728591323, 0.08920450439836713, 0.04538524651828387, 0.10539445769245503, -0.2362838513957589, 0.027830418580227462, 0.06310763932682069]
|
1,803.03749
|
Counting trees in a graph
|
We discuss a recursive formula for number of spanning trees in a graph. The
paper is written primary for school students.
|
math.HO math.CO
|
we discuss a recursive formula for number of spanning trees in a graph the paper is written primary for school students
|
[['we', 'discuss', 'a', 'recursive', 'formula', 'for', 'number', 'of', 'spanning', 'trees', 'in', 'a', 'graph', 'the', 'paper', 'is', 'written', 'primary', 'for', 'school', 'students']]
|
[-0.1509954577223176, 0.1271908243763305, -0.08312050936122735, 0.11614714818452263, -0.16050141340210325, -0.08646930093389182, 0.08722830577642612, 0.3489486669145879, -0.2248256831829037, -0.38384588630426497, 0.0716671868216335, -0.2582473286117117, -0.18892073028144382, 0.22434976484094346, -0.16010251729970887, -0.029863073002724422, 0.1354288509714284, 0.11340619490614959, -0.00553394907287189, -0.2755782494967293, 0.3130247069611436, 0.029681866545052754, 0.1693924648598546, 0.04658328147516364, 0.1684388928115368, 0.11504412923629086, -0.08028898884852727, 0.06581535137125424, -0.14954197890169563, 0.13150892828014635, 0.39728825486132074, 0.23641401901841164, 0.29616461215274675, -0.36356727007244316, -0.08770977315448579, 0.10023971921986058, 0.10192130341948498, 0.11496835290676072, -0.012752859587115901, -0.11005261473889862, 0.09638332974697862, -0.23900320221270835, -0.10546064669532436, 0.037608837620133444, 0.02638112682671774, -0.0007598564206134705, -0.2488428515692552, -0.0335406069422052, 0.05948323206532569, 0.16576835411112933, 0.0464582180693036, -0.2033947624620937, 0.02894410810300282, 0.14124405918465482, -0.03549589337559328, 0.02480799445350255, -0.00270225318326127, -0.15553410235969795, -0.18647188107882226, 0.3542405171763329, -0.011292236901464917, -0.1306646028090091, 0.10409941843577794, -0.09940048369268577, -0.2481943259813956, 0.02191252296879178, 0.2672475425615197, 0.1435162091317276, -0.20076735495101838, 0.09499720847677617, -0.060726937083970936, 0.09105552333806242, 0.17600088899156877, -0.07714783196293172, 0.2077417199810346, 0.2143314028424876, 0.0487795344753457, 0.20989568886302767, 0.027676210694369815, 0.001404404773243836, -0.28383247341428486, -0.24489558869529338, -0.22096751594827288, -0.009758266465117535, -0.09868232395854734, -0.2252352988081319, 0.46747677737758275, 0.08227808924303168, 0.1041176233085848, 0.20097770395555667, 0.2159687521468316, 0.13586916189108575, -0.04396717755922249, 0.1242000024898776, 0.05376454726571128, 0.17623623017044293, 0.12227098732477143, -0.07421681298209089, 0.049864399169261255, 0.17878062042984225]
|
1,803.0375
|
Charge Transfer Effects in Naturally Occurring van der Waals
Heterostructures (PbSe)1.16(TiSe2)m (m=1, 2)
|
Van der Waals heterostructures (VDWHs) exhibit rich properties and thus has
potential for applications, and charge transfer between different layers in a
heterostructure often dominates its properties and device performance. It is
thus critical to reveal and understand the charge transfer effects in VDWHs,
for which electronic structure measurements have proven to be effective. Using
angle-resolved photoemission spectroscopy, we studied the electronic structures
of (PbSe)1.16(TiSe2)m(m=1, 2), which are naturally occurring VDWHs, and
discovered several striking charge transfer effects. When the thickness of the
TiSe2 layers is halved from m=2 to m=1, the amount of charge transferred
increases unexpectedly by more than 250%. This is accompanied by a dramatic
drop in the electron-phonon interaction strength far beyond the prediction by
first-principles calculations and, consequently, superconductivity only exists
in the m=2 compound with strong electron-phonon interaction, albeit with lower
carrier density. Furthermore, we found that the amount of charge transferred in
both compounds is nearly halved when warmed from below 10 K to room
temperature, due to the different thermal expansion coefficients of the
constituent layers of these misfit compounds. These unprecedentedly large
charge transfer effects might widely exist in VDWHs composed of
metal-semiconductor contacts; thus, our results provide important insights for
further understanding and applications of VDWHs.
|
cond-mat.str-el cond-mat.mtrl-sci
|
van der waals heterostructures vdwhs exhibit rich properties and thus has potential for applications and charge transfer between different layers in a heterostructure often dominates its properties and device performance it is thus critical to reveal and understand the charge transfer effects in vdwhs for which electronic structure measurements have proven to be effective using angleresolved photoemission spectroscopy we studied the electronic structures of pbse116tise2mm1 2 which are naturally occurring vdwhs and discovered several striking charge transfer effects when the thickness of the tise2 layers is halved from m2 to m1 the amount of charge transferred increases unexpectedly by more than 250 this is accompanied by a dramatic drop in the electronphonon interaction strength far beyond the prediction by firstprinciples calculations and consequently superconductivity only exists in the m2 compound with strong electronphonon interaction albeit with lower carrier density furthermore we found that the amount of charge transferred in both compounds is nearly halved when warmed from below 10 k to room temperature due to the different thermal expansion coefficients of the constituent layers of these misfit compounds these unprecedentedly large charge transfer effects might widely exist in vdwhs composed of metalsemiconductor contacts thus our results provide important insights for further understanding and applications of vdwhs
|
[['van', 'der', 'waals', 'heterostructures', 'vdwhs', 'exhibit', 'rich', 'properties', 'and', 'thus', 'has', 'potential', 'for', 'applications', 'and', 'charge', 'transfer', 'between', 'different', 'layers', 'in', 'a', 'heterostructure', 'often', 'dominates', 'its', 'properties', 'and', 'device', 'performance', 'it', 'is', 'thus', 'critical', 'to', 'reveal', 'and', 'understand', 'the', 'charge', 'transfer', 'effects', 'in', 'vdwhs', 'for', 'which', 'electronic', 'structure', 'measurements', 'have', 'proven', 'to', 'be', 'effective', 'using', 'angleresolved', 'photoemission', 'spectroscopy', 'we', 'studied', 'the', 'electronic', 'structures', 'of', 'pbse116tise2mm1', '2', 'which', 'are', 'naturally', 'occurring', 'vdwhs', 'and', 'discovered', 'several', 'striking', 'charge', 'transfer', 'effects', 'when', 'the', 'thickness', 'of', 'the', 'tise2', 'layers', 'is', 'halved', 'from', 'm2', 'to', 'm1', 'the', 'amount', 'of', 'charge', 'transferred', 'increases', 'unexpectedly', 'by', 'more', 'than', '250', 'this', 'is', 'accompanied', 'by', 'a', 'dramatic', 'drop', 'in', 'the', 'electronphonon', 'interaction', 'strength', 'far', 'beyond', 'the', 'prediction', 'by', 'firstprinciples', 'calculations', 'and', 'consequently', 'superconductivity', 'only', 'exists', 'in', 'the', 'm2', 'compound', 'with', 'strong', 'electronphonon', 'interaction', 'albeit', 'with', 'lower', 'carrier', 'density', 'furthermore', 'we', 'found', 'that', 'the', 'amount', 'of', 'charge', 'transferred', 'in', 'both', 'compounds', 'is', 'nearly', 'halved', 'when', 'warmed', 'from', 'below', '10', 'k', 'to', 'room', 'temperature', 'due', 'to', 'the', 'different', 'thermal', 'expansion', 'coefficients', 'of', 'the', 'constituent', 'layers', 'of', 'these', 'misfit', 'compounds', 'these', 'unprecedentedly', 'large', 'charge', 'transfer', 'effects', 'might', 'widely', 'exist', 'in', 'vdwhs', 'composed', 'of', 'metalsemiconductor', 'contacts', 'thus', 'our', 'results', 'provide', 'important', 'insights', 'for', 'further', 'understanding', 'and', 'applications', 'of', 'vdwhs']]
|
[-0.13093554270510538, 0.17845274355126226, -0.034919162749926125, 0.03342398482477065, -0.016094965047043996, -0.1470002838137855, 0.07493962472213841, 0.38536553784591576, -0.2764848740953134, -0.3449187378421789, 0.002631954179804136, -0.3529412439501867, -0.16755078420065705, 0.20712678049259434, 0.040347665891323874, -0.0008081789154036924, 0.00524289715274169, -0.06316101982630222, -0.114820276990124, -0.18419905007861573, 0.2858378880657256, 0.07078267902976311, 0.30340684171788757, 0.16409225012062162, 0.03003385100313519, -0.03130119338222757, 0.08984999278242269, 0.027767006877139663, -0.1538636150078851, 0.09176971938165768, 0.29260418430004814, -0.08940705913232594, 0.2343818040712305, -0.4640180781574511, -0.24951329856838395, -0.009175112175687058, 0.1339773074860071, 0.1238283874864531, -0.09542258250698868, -0.21750280282392007, 0.10761678491594133, -0.1671430953403526, -0.06940219797103143, -0.11203197234696367, 0.03436618751232944, 0.0029220723751478077, -0.23195419463629993, 0.0986380897750567, 0.04768096994972083, 0.0609129431926881, -0.07979668580271054, -0.16565052668405014, -0.08407295342966369, 0.11307531704177808, 0.056120262215220616, 0.02574222931502069, 0.17320183181181187, -0.1432819083957683, -0.0460346630729008, 0.3557023984084769, -0.02989449549115706, -0.08654997487348028, 0.20908493691283028, -0.17689913621331316, -0.05654793654571333, 0.17054422998392, 0.10838602268386904, 0.08406142561026372, -0.1400064356521442, 0.05971765414749204, 0.028546538580884795, 0.20323866723536899, 0.08392544132316622, 0.12025648551288902, 0.23900594747761583, 0.19080748919897328, 0.020737475221522333, 0.11249668966161042, -0.08200084327822324, -0.055183723693849836, -0.16459852062710903, -0.14792955818517906, -0.20215894777736648, 0.09244339289143681, -0.07839314399191985, -0.15654853535588922, 0.36966199161393976, 0.1553543379518953, 0.20723839069648486, -0.070718562224789, 0.25383429408311936, 0.08047423292769165, 0.13513279749625703, 0.0243866357906926, 0.27160789048662637, 0.1658314418626904, 0.11146972029208682, -0.24004740531686922, 0.11124188511961754, -0.021594068305794058]
|
1,803.03751
|
Exploring Extreme Space Weather Factors of Exoplanetary Habitability
|
It is currently unknown how common life is on exoplanets, or how long planets
can remain viable for life. To date, we have a superficial notion of
habitability, a necessary first step, but so far lacking an understanding of
the detailed interaction between stars and planets over geological timescales,
dynamical evolution of planetary systems, and atmospheric evolution on planets
in other systems. A planet mass, net insolation, and atmospheric composition
alone are insufficient to determine the probability that life on a planet could
arise or be detected. The latter set of planetary considerations, among others,
underpin the concept of the habitable zone (HZ), defined as the circumstellar
region where standing bodies of liquid water could be supported on the surface
of a rocky planet. However, stars within the same spectral class are often
treated in the same way in HZ studies, without any regard for variations in
activity among individual stars. Such formulations ignore differences in how
nonthermal emission and magnetic energy of transient events in different stars
affect the ability of an exoplanet to retain its atmosphere.In the last few
years there has been a growing appreciation that the atmospheric chemistry, and
even retention of an atmosphere in many cases, depends critically on the
high-energy radiation and particle environments around these stars. Indeed,
recent studies have shown stellar activity and the extreme space weather, such
as that created by the frequent flares and coronal mass ejections (CMEs) from
the active stars and young Sun, may have profoundly affected the chemistry and
climate and thus habitability of the early Earth and terrestrial type
exoplanets. The goal of this white paper is to identify and describe promising
key research goals to aid the field of the exoplanetary habitability for the
next 20 years.
|
astro-ph.EP
|
it is currently unknown how common life is on exoplanets or how long planets can remain viable for life to date we have a superficial notion of habitability a necessary first step but so far lacking an understanding of the detailed interaction between stars and planets over geological timescales dynamical evolution of planetary systems and atmospheric evolution on planets in other systems a planet mass net insolation and atmospheric composition alone are insufficient to determine the probability that life on a planet could arise or be detected the latter set of planetary considerations among others underpin the concept of the habitable zone hz defined as the circumstellar region where standing bodies of liquid water could be supported on the surface of a rocky planet however stars within the same spectral class are often treated in the same way in hz studies without any regard for variations in activity among individual stars such formulations ignore differences in how nonthermal emission and magnetic energy of transient events in different stars affect the ability of an exoplanet to retain its atmospherein the last few years there has been a growing appreciation that the atmospheric chemistry and even retention of an atmosphere in many cases depends critically on the highenergy radiation and particle environments around these stars indeed recent studies have shown stellar activity and the extreme space weather such as that created by the frequent flares and coronal mass ejections cmes from the active stars and young sun may have profoundly affected the chemistry and climate and thus habitability of the early earth and terrestrial type exoplanets the goal of this white paper is to identify and describe promising key research goals to aid the field of the exoplanetary habitability for the next 20 years
|
[['it', 'is', 'currently', 'unknown', 'how', 'common', 'life', 'is', 'on', 'exoplanets', 'or', 'how', 'long', 'planets', 'can', 'remain', 'viable', 'for', 'life', 'to', 'date', 'we', 'have', 'a', 'superficial', 'notion', 'of', 'habitability', 'a', 'necessary', 'first', 'step', 'but', 'so', 'far', 'lacking', 'an', 'understanding', 'of', 'the', 'detailed', 'interaction', 'between', 'stars', 'and', 'planets', 'over', 'geological', 'timescales', 'dynamical', 'evolution', 'of', 'planetary', 'systems', 'and', 'atmospheric', 'evolution', 'on', 'planets', 'in', 'other', 'systems', 'a', 'planet', 'mass', 'net', 'insolation', 'and', 'atmospheric', 'composition', 'alone', 'are', 'insufficient', 'to', 'determine', 'the', 'probability', 'that', 'life', 'on', 'a', 'planet', 'could', 'arise', 'or', 'be', 'detected', 'the', 'latter', 'set', 'of', 'planetary', 'considerations', 'among', 'others', 'underpin', 'the', 'concept', 'of', 'the', 'habitable', 'zone', 'hz', 'defined', 'as', 'the', 'circumstellar', 'region', 'where', 'standing', 'bodies', 'of', 'liquid', 'water', 'could', 'be', 'supported', 'on', 'the', 'surface', 'of', 'a', 'rocky', 'planet', 'however', 'stars', 'within', 'the', 'same', 'spectral', 'class', 'are', 'often', 'treated', 'in', 'the', 'same', 'way', 'in', 'hz', 'studies', 'without', 'any', 'regard', 'for', 'variations', 'in', 'activity', 'among', 'individual', 'stars', 'such', 'formulations', 'ignore', 'differences', 'in', 'how', 'nonthermal', 'emission', 'and', 'magnetic', 'energy', 'of', 'transient', 'events', 'in', 'different', 'stars', 'affect', 'the', 'ability', 'of', 'an', 'exoplanet', 'to', 'retain', 'its', 'atmospherein', 'the', 'last', 'few', 'years', 'there', 'has', 'been', 'a', 'growing', 'appreciation', 'that', 'the', 'atmospheric', 'chemistry', 'and', 'even', 'retention', 'of', 'an', 'atmosphere', 'in', 'many', 'cases', 'depends', 'critically', 'on', 'the', 'highenergy', 'radiation', 'and', 'particle', 'environments', 'around', 'these', 'stars', 'indeed', 'recent', 'studies', 'have', 'shown', 'stellar', 'activity', 'and', 'the', 'extreme', 'space', 'weather', 'such', 'as', 'that', 'created', 'by', 'the', 'frequent', 'flares', 'and', 'coronal', 'mass', 'ejections', 'cmes', 'from', 'the', 'active', 'stars', 'and', 'young', 'sun', 'may', 'have', 'profoundly', 'affected', 'the', 'chemistry', 'and', 'climate', 'and', 'thus', 'habitability', 'of', 'the', 'early', 'earth', 'and', 'terrestrial', 'type', 'exoplanets', 'the', 'goal', 'of', 'this', 'white', 'paper', 'is', 'to', 'identify', 'and', 'describe', 'promising', 'key', 'research', 'goals', 'to', 'aid', 'the', 'field', 'of', 'the', 'exoplanetary', 'habitability', 'for', 'the', 'next', '20', 'years']]
|
[-0.07572986387697295, 0.19723824362959225, -0.03758658736263509, 0.11618049700702045, -0.112548808833661, -0.022814116457115563, 0.06588717916847568, 0.3641620276477212, -0.19722226870812706, -0.3664324490963145, 0.11623581316557319, -0.25578024046482756, -0.13914273452266565, 0.22763616342579185, -0.10930251763324265, 0.033370065839066654, 0.12126599585467827, 0.0002954957910326927, -0.010662689439982777, -0.2664283329230506, 0.30710958284757955, 0.08662036877634369, 0.10402104126759949, 0.03714314103286547, 0.02858491540211173, -0.09188875022881962, -0.05140763724831259, -0.06281108984087629, -0.13631617802607204, 0.053743394250946305, 0.27626076012652184, 0.17746826819115386, 0.2651912856437394, -0.4534017969902182, -0.2937823937872994, 0.08889202561605616, 0.16074498153901323, 0.015979389536044084, -0.05625151791905863, -0.2352227558377055, 0.05375065229220245, -0.18088747118479698, -0.15063968634223276, 0.008024067693962827, 0.08022886981805179, 0.01259815352166766, -0.21703675494343683, 0.04656702039892949, 0.06641650295252688, 0.14028143634238757, -0.133716914736781, -0.12320995508433924, -0.062465152767234036, 0.1669814851078208, 0.07798227006041435, 0.008550665500938663, 0.19597436881166502, -0.12241676403009541, -0.047163914840690845, 0.43937723839009835, -0.06781410293684012, -0.0860985470659666, 0.2937246546864548, -0.21800226658499477, -0.14200228409156768, 0.11588295766302861, 0.1881136857997306, 0.13806583384080723, -0.1859204961671862, 0.007753058890748091, -0.003176822300673914, 0.14720204368208079, 0.08148530481024757, 0.06572183775731533, 0.388423452496247, 0.1760152214105942, 0.06968020506325591, 0.019512661461697577, -0.15818050538756634, -0.07906950878769901, -0.1779472804564304, -0.1646623834495551, -0.14985582053091673, 0.03593181587893298, -0.06120233668935128, -0.15954823262236023, 0.38747198994693915, 0.177833839316846, 0.12540151179476908, -0.04464189244551853, 0.27329956785106835, 0.053121544858026705, 0.09013811212762729, 0.07729539941257038, 0.32412049660932823, 0.12263089846227561, 0.11631672797345355, -0.23680947329993024, 0.16081986464344003, -0.028452553369482513]
|
1,803.03752
|
Optimum Linear Codes with Support Constraints over Small Fields
|
We consider the problem of designing optimal linear codes (in terms of having
the largest minimum distance) subject to a support constraint on the generator
matrix. We show that the largest minimum distance can be achieved by a subcode
of a Reed-Solomon code of small field size. As a by-product of this result, we
settle the GM-MDS conjecture of Dau et. al. in the affirmative.
|
cs.IT math.IT
|
we consider the problem of designing optimal linear codes in terms of having the largest minimum distance subject to a support constraint on the generator matrix we show that the largest minimum distance can be achieved by a subcode of a reedsolomon code of small field size as a byproduct of this result we settle the gmmds conjecture of dau et al in the affirmative
|
[['we', 'consider', 'the', 'problem', 'of', 'designing', 'optimal', 'linear', 'codes', 'in', 'terms', 'of', 'having', 'the', 'largest', 'minimum', 'distance', 'subject', 'to', 'a', 'support', 'constraint', 'on', 'the', 'generator', 'matrix', 'we', 'show', 'that', 'the', 'largest', 'minimum', 'distance', 'can', 'be', 'achieved', 'by', 'a', 'subcode', 'of', 'a', 'reedsolomon', 'code', 'of', 'small', 'field', 'size', 'as', 'a', 'byproduct', 'of', 'this', 'result', 'we', 'settle', 'the', 'gmmds', 'conjecture', 'of', 'dau', 'et', 'al', 'in', 'the', 'affirmative']]
|
[-0.19143455306497903, 0.05841266419738531, -0.0470025000663904, 0.052244978561066094, -0.03269245992772854, -0.12635699920356275, 0.04802600717745148, 0.296359076945541, -0.2995301063100879, -0.321567563769909, 0.10613450140405734, -0.24404142951377883, -0.14216166918094342, 0.18352183328511623, -0.12517704046689548, 0.08581014958864007, 0.09848643524142411, 0.019656335132626386, -0.07868894644869635, -0.31746625708631027, 0.31164402475652214, 0.14698692910516492, 0.20494823945829502, 0.0824539271541513, 0.07701556030660868, 0.03953191918822435, -0.0003730589058250189, 0.06032189891601984, -0.1787151165742006, 0.09798012977788369, 0.23379293118531888, 0.19461398745815342, 0.2854693872997394, -0.3408326939751323, -0.18399786088400735, 0.12107088641765026, 0.11333254745158439, 0.1542770291177126, -0.049619421651228686, -0.18129608266127223, 0.16917805985834164, -0.19668143027676985, -0.131667770868024, 0.05878601357600508, 0.026915574211698885, 0.006889324434674703, -0.3118620831805926, 0.038144699204713105, 0.10409837826513327, 0.052314505253273705, -0.039841354394761413, -0.14197052338232213, 0.027313181184805357, 0.09574684127448843, -0.0006060381294586337, 0.09652424109383272, 0.017782243848061905, -0.06768180211791053, -0.1367457938935751, 0.3624229439605887, -0.06006191963186631, -0.16657344796336615, 0.08668779891270857, -0.09184191067201587, -0.09253627143155496, 0.0720822250112318, 0.2607583455168284, 0.1439227085847121, -0.09966884746860999, 0.13526551189044347, -0.173186879297002, 0.16958417168890055, 0.10519315765167658, 0.05397651734260412, 0.14368993395294707, 0.11445754393218802, 0.10265002769346421, 0.20664370144323374, -0.0283662164870363, -0.021255647066013458, -0.3017711724942693, -0.14989462495924763, -0.2424298164434731, 0.08092044162062498, -0.11766412109136581, -0.15974883668912718, 0.3715608789943732, 0.1296151338216777, 0.2492236734009706, 0.09588436224999336, 0.21648615518441566, 0.08079312473642998, 0.08893879007977935, 0.1626323879409868, 0.2203244387387083, 0.1597773377532856, 0.0005254546395288064, -0.2328772467131225, 0.0707150747712988, 0.11836123632696958]
|
1,803.03753
|
On a metric generalization of the $tt$-degrees and effective dimension
theory
|
In this article, we study an analogue of $tt$-reducibility for points in
computable metric spaces. We characterize the notion of the metric $tt$-degree
in the context of first-level Borel isomorphism. Then, we study this concept
from the perspectives of effective topological dimension theory and of
effective fractal dimension theory.
|
math.LO cs.LO
|
in this article we study an analogue of ttreducibility for points in computable metric spaces we characterize the notion of the metric ttdegree in the context of firstlevel borel isomorphism then we study this concept from the perspectives of effective topological dimension theory and of effective fractal dimension theory
|
[['in', 'this', 'article', 'we', 'study', 'an', 'analogue', 'of', 'ttreducibility', 'for', 'points', 'in', 'computable', 'metric', 'spaces', 'we', 'characterize', 'the', 'notion', 'of', 'the', 'metric', 'ttdegree', 'in', 'the', 'context', 'of', 'firstlevel', 'borel', 'isomorphism', 'then', 'we', 'study', 'this', 'concept', 'from', 'the', 'perspectives', 'of', 'effective', 'topological', 'dimension', 'theory', 'and', 'of', 'effective', 'fractal', 'dimension', 'theory']]
|
[-0.12004722450721136, 0.11458074884331894, -0.12041997527604566, 0.12344519119769176, -0.03448485153073326, -0.040207639931047215, 0.05152588925681057, 0.29970398822680433, -0.3255265253655454, -0.20849913154590002, 0.055856091676260086, -0.26481151176576917, -0.26654282370780374, 0.14933358144728429, -0.1290965630732318, 0.03738698238962667, -0.03661272540054423, 0.08765665414505341, -0.10738794505596161, -0.23531510034932734, 0.479775318776832, 0.006498556346335309, 0.2984183024060219, 0.10834661241065949, 0.10692549128323159, 0.011797492035684433, -0.0694406113012674, 0.09731052865947973, -0.24707599015946083, 0.21512679030445028, 0.2693850242711128, 0.13628908362675538, 0.24473087235968163, -0.32254721190621877, -0.17498185467767588, 0.14759886136001094, 0.10703353724501868, 0.07003206971220355, -0.009153128522349166, -0.2957593260649988, 0.13239324683610826, -0.1851877950607462, -0.19693959702519662, -0.0816098555868016, 0.037026128503791195, -0.084841485997226, -0.20864186477550167, -0.024213510036636937, 0.10606640918140715, 0.1372081841480859, -0.1158151404654726, 0.011817621364396937, 0.05611333793445312, 0.09582392086195661, 0.03569280276907251, 0.03508201668514533, 0.041489876697751435, -0.10198616940389446, -0.17828023995451153, 0.35014356528111595, -0.08791634157062211, -0.2215912987359185, 0.16609863144286136, -0.1463528497421995, -0.17640711409733334, 0.015800448907341096, 0.21638600662984747, 0.15861581793015309, -0.10955801584381372, 0.2175993620544335, -0.07118116089321197, 0.09469345834185468, 0.0808665123669074, 0.10351005293666682, 0.12859096988401514, 0.17237865231297117, 0.11082425239951686, 0.20796508559996776, 0.006898076937315946, -0.09024968079880792, -0.3414198576492515, -0.2356705847889819, -0.1596523187063793, 0.08705795516676092, -0.133438320632001, -0.20024877897602447, 0.4180231740341542, 0.1744779841776224, 0.17118436476572396, 0.08299351969060112, 0.24503846755845748, 0.08927474698012179, -0.02295574094069765, 0.026566943569861827, 0.1870248828261615, 0.16941306884697777, 0.014267383896289988, -0.1442423277841683, -0.05568147800426851, 0.2255326210858023]
|
1,803.03754
|
Extensions of $\overline\partial$-closed forms on compact generalized
Hermitian manifolds
|
In this paper, we first get a criterion formula for whether a differential
form is holomorphic with respect to the generalized complex structure induced
by $\epsilon$. Next, we get the local extensions of $\overline\partial$-closed
forms on a smooth family of compact generalized Hermitian manifolds by using
this criterion. Finally, as an application, we use this extension to get the
invariance of the generalized Hodge number of the deformations of compact
generalized Hermitian manifolds with $\partial\overline\partial$-lemma holds.
|
math.DG
|
in this paper we first get a criterion formula for whether a differential form is holomorphic with respect to the generalized complex structure induced by epsilon next we get the local extensions of overlinepartialclosed forms on a smooth family of compact generalized hermitian manifolds by using this criterion finally as an application we use this extension to get the invariance of the generalized hodge number of the deformations of compact generalized hermitian manifolds with partialoverlinepartiallemma holds
|
[['in', 'this', 'paper', 'we', 'first', 'get', 'a', 'criterion', 'formula', 'for', 'whether', 'a', 'differential', 'form', 'is', 'holomorphic', 'with', 'respect', 'to', 'the', 'generalized', 'complex', 'structure', 'induced', 'by', 'epsilon', 'next', 'we', 'get', 'the', 'local', 'extensions', 'of', 'overlinepartialclosed', 'forms', 'on', 'a', 'smooth', 'family', 'of', 'compact', 'generalized', 'hermitian', 'manifolds', 'by', 'using', 'this', 'criterion', 'finally', 'as', 'an', 'application', 'we', 'use', 'this', 'extension', 'to', 'get', 'the', 'invariance', 'of', 'the', 'generalized', 'hodge', 'number', 'of', 'the', 'deformations', 'of', 'compact', 'generalized', 'hermitian', 'manifolds', 'with', 'partialoverlinepartiallemma', 'holds']]
|
[-0.1412689870738081, 0.03779819601167171, -0.09602070148838193, 0.09385240265155996, -0.13437254275930555, -0.10066762427480794, -0.01155763903577616, 0.31738255344527333, -0.28949108631595183, -0.2217530302533353, 0.1138308406424537, -0.1998849067052728, -0.23392608526505923, 0.18901818846107313, -0.10986474505625665, 0.015523296119155068, 0.014213078826861946, 0.09947207632572636, -0.14779678937415347, -0.254843876571517, 0.47070407164038014, 0.0068467108863650965, 0.19309984841138908, 0.045069379670741525, 0.10393381445943592, 0.025205606662080084, 0.016015738224316584, 0.006564818004048185, -0.16267330659014223, 0.17523075908952465, 0.22194246733009718, 0.07522312616071615, 0.223313410303825, -0.37738379135139677, -0.16083147852240423, 0.19216507801933116, 0.0743284512703356, 0.05248730014519472, -0.021825032331674408, -0.2730002471883046, 0.13197087619061532, -0.1798439302089575, -0.2505704268298455, -0.1286578256342756, 0.00838235167228911, 0.014329583089994756, -0.2686882113071318, 0.0341392968609733, 0.12757057685552067, 0.06218285139306987, -0.06927696836033934, -0.04740165932238788, -0.0027950047637875144, 0.04084113321120018, -0.026317105325257505, 0.03274906487939389, 0.053873057250472665, -0.04857137416011507, -0.10079732912249471, 0.3622488955818546, -0.12153769180708639, -0.2990016490496744, 0.08416730786771759, -0.09596858304729194, -0.18819629077456498, 0.08331160195245359, 0.1500645447277317, 0.1890244961128031, -0.09311634767877158, 0.14228235823592464, -0.10505348135178026, 0.07104769799441688, 0.12564989675669685, 0.009617107270873691, 0.12698678833150648, 0.11458516832882244, 0.13035426945670656, 0.18020859839835843, -0.026595668551683622, -0.07702925465510864, -0.3649477241070647, -0.2129853277614242, -0.12712282950891868, 0.15701574307719343, -0.10607995608466138, -0.18845666589607535, 0.3829282210545467, 0.021857889785774444, 0.22921448876149952, 0.12380641138818312, 0.23078843691128945, 0.11660583948832937, 0.051764731565000194, 0.04485728303093071, 0.1505497353224966, 0.22130981756153664, 0.022638185078425233, -0.1265926128161434, -0.01860984237742071, 0.1496596306832017]
|
1,803.03755
|
Global stability of a network-based SIRS epidemic model with nonmonotone
incidence rate
|
This paper studies the dynamics of a network-based SIRS epidemic model with
vaccination and a nonmonotone incidence rate. This type of nonlinear incidence
can be used to describe the psychological or inhibitory effect from the
behavioral change of the susceptible individuals when the number of infective
individuals on heterogeneous networks is getting larger. Using the analytical
method, epidemic threshold $R_0$ is obtained. When $R_0$ is less than one, we
prove the disease-free equilibrium is globally asymptotically stable and the
disease dies out, while $R_0$ is greater than one, there exists a unique
endemic equilibrium. By constructing a suitable Lyapunov function, we also
prove the endemic equilibrium is globally asymptotically stable if the
inhibitory factor $\alpha$ is sufficiently large. Numerical experiments are
also given to support the theoretical results. It is shown both theoretically
and numerically a larger $\alpha$ can accelerate the extinction of the disease
and reduce the level of disease.
|
q-bio.PE physics.soc-ph
|
this paper studies the dynamics of a networkbased sirs epidemic model with vaccination and a nonmonotone incidence rate this type of nonlinear incidence can be used to describe the psychological or inhibitory effect from the behavioral change of the susceptible individuals when the number of infective individuals on heterogeneous networks is getting larger using the analytical method epidemic threshold r_0 is obtained when r_0 is less than one we prove the diseasefree equilibrium is globally asymptotically stable and the disease dies out while r_0 is greater than one there exists a unique endemic equilibrium by constructing a suitable lyapunov function we also prove the endemic equilibrium is globally asymptotically stable if the inhibitory factor alpha is sufficiently large numerical experiments are also given to support the theoretical results it is shown both theoretically and numerically a larger alpha can accelerate the extinction of the disease and reduce the level of disease
|
[['this', 'paper', 'studies', 'the', 'dynamics', 'of', 'a', 'networkbased', 'sirs', 'epidemic', 'model', 'with', 'vaccination', 'and', 'a', 'nonmonotone', 'incidence', 'rate', 'this', 'type', 'of', 'nonlinear', 'incidence', 'can', 'be', 'used', 'to', 'describe', 'the', 'psychological', 'or', 'inhibitory', 'effect', 'from', 'the', 'behavioral', 'change', 'of', 'the', 'susceptible', 'individuals', 'when', 'the', 'number', 'of', 'infective', 'individuals', 'on', 'heterogeneous', 'networks', 'is', 'getting', 'larger', 'using', 'the', 'analytical', 'method', 'epidemic', 'threshold', 'r_0', 'is', 'obtained', 'when', 'r_0', 'is', 'less', 'than', 'one', 'we', 'prove', 'the', 'diseasefree', 'equilibrium', 'is', 'globally', 'asymptotically', 'stable', 'and', 'the', 'disease', 'dies', 'out', 'while', 'r_0', 'is', 'greater', 'than', 'one', 'there', 'exists', 'a', 'unique', 'endemic', 'equilibrium', 'by', 'constructing', 'a', 'suitable', 'lyapunov', 'function', 'we', 'also', 'prove', 'the', 'endemic', 'equilibrium', 'is', 'globally', 'asymptotically', 'stable', 'if', 'the', 'inhibitory', 'factor', 'alpha', 'is', 'sufficiently', 'large', 'numerical', 'experiments', 'are', 'also', 'given', 'to', 'support', 'the', 'theoretical', 'results', 'it', 'is', 'shown', 'both', 'theoretically', 'and', 'numerically', 'a', 'larger', 'alpha', 'can', 'accelerate', 'the', 'extinction', 'of', 'the', 'disease', 'and', 'reduce', 'the', 'level', 'of', 'disease']]
|
[-0.11960496554777199, 0.13300960431097458, -0.07119059114291376, 0.12401082348201843, -0.02411572447058973, -0.23092252473094013, 0.08349150817283114, 0.34837831136776715, -0.22867917471306262, -0.18358352825983076, 0.12337942312846256, -0.30426816496726694, -0.23051652469092498, 0.16784293272236472, -0.04978891821047723, 0.027531399348417654, 0.06899123782113145, 0.0699368261281919, 0.043445724633133766, -0.2926931812748658, 0.3099159473763002, 0.049217796693278464, 0.27770929488766666, 0.016857842912447227, 0.09038867680232553, -0.04256390041320134, 0.003911354572863768, 0.06922171289095075, -0.17810172914212805, 0.06773039545796022, 0.2822737243822128, 0.15689110565338507, 0.3649751241658105, -0.383412996356357, -0.2141046704807695, 0.18673199771391535, 0.1615967884295873, 0.16828618789344582, 0.02433327950817835, -0.2561208425299419, 0.15099365439648363, -0.1681684306236786, -0.1897902456297237, -0.023284983000909257, 0.0503034258711565, 0.037410004767172954, -0.31423600580518607, 0.09887241741252249, -0.020871041117495062, 0.10378712257802092, -0.035795579760008495, -0.1060243309197935, -0.1065715984317986, 0.12697076231329116, 0.07752381813086397, 0.0031679133188429703, 0.16653905197089872, -0.12590883786339832, -0.05422086573964515, 0.3020632668207122, -0.012193417914608025, -0.21568870189790892, 0.1645879698562627, -0.13133558269130646, -0.049639941270259634, 0.15917152014641178, 0.14465206699902253, 0.12142367111457301, -0.12937234707014011, 0.005636726166059985, -0.03781235095465075, 0.19668989223952324, 0.0597275880331926, -0.0640068130339465, 0.1264287761246033, 0.24359564188658106, 0.15931530318081083, 0.08642489534559111, -0.050319147547583605, -0.12570555743126088, -0.23926623074942274, -0.08290902980979507, -0.11612168990001576, 0.11591230871368643, -0.1535826852380927, -0.15658042758193624, 0.3807767762722361, 0.13206038125543948, 0.13933180274429502, 0.1240066277566335, 0.25531095161722567, 0.1342789036968094, -0.0030416650389203962, 0.11107198190323149, 0.24137738818882515, 0.08846685443122082, 0.05104231629489816, -0.24273955960918392, 0.18971976358443499, 0.007092682755743431]
|
1,803.03756
|
Influence of the Event Rate on Discrimination Abilities of Bankruptcy
Prediction Models
|
In bankruptcy prediction, the proportion of events is very low, which is
often oversampled to eliminate this bias. In this paper, we study the influence
of the event rate on discrimination abilities of bankruptcy prediction models.
First the statistical association and significance of public records and
firmographics indicators with the bankruptcy were explored. Then the event rate
was oversampled from 0.12% to 10%, 20%, 30%, 40%, and 50%, respectively. Seven
models were developed, including Logistic Regression, Decision Tree, Random
Forest, Gradient Boosting, Support Vector Machine, Bayesian Network, and Neural
Network. Under different event rates, models were comprehensively evaluated and
compared based on Kolmogorov-Smirnov Statistic, accuracy, F1 score, Type I
error, Type II error, and ROC curve on the hold-out dataset with their best
probability cut-offs. Results show that Bayesian Network is the most
insensitive to the event rate, while Support Vector Machine is the most
sensitive.
|
stat.ML cs.LG
|
in bankruptcy prediction the proportion of events is very low which is often oversampled to eliminate this bias in this paper we study the influence of the event rate on discrimination abilities of bankruptcy prediction models first the statistical association and significance of public records and firmographics indicators with the bankruptcy were explored then the event rate was oversampled from 012 to 10 20 30 40 and 50 respectively seven models were developed including logistic regression decision tree random forest gradient boosting support vector machine bayesian network and neural network under different event rates models were comprehensively evaluated and compared based on kolmogorovsmirnov statistic accuracy f1 score type i error type ii error and roc curve on the holdout dataset with their best probability cutoffs results show that bayesian network is the most insensitive to the event rate while support vector machine is the most sensitive
|
[['in', 'bankruptcy', 'prediction', 'the', 'proportion', 'of', 'events', 'is', 'very', 'low', 'which', 'is', 'often', 'oversampled', 'to', 'eliminate', 'this', 'bias', 'in', 'this', 'paper', 'we', 'study', 'the', 'influence', 'of', 'the', 'event', 'rate', 'on', 'discrimination', 'abilities', 'of', 'bankruptcy', 'prediction', 'models', 'first', 'the', 'statistical', 'association', 'and', 'significance', 'of', 'public', 'records', 'and', 'firmographics', 'indicators', 'with', 'the', 'bankruptcy', 'were', 'explored', 'then', 'the', 'event', 'rate', 'was', 'oversampled', 'from', '012', 'to', '10', '20', '30', '40', 'and', '50', 'respectively', 'seven', 'models', 'were', 'developed', 'including', 'logistic', 'regression', 'decision', 'tree', 'random', 'forest', 'gradient', 'boosting', 'support', 'vector', 'machine', 'bayesian', 'network', 'and', 'neural', 'network', 'under', 'different', 'event', 'rates', 'models', 'were', 'comprehensively', 'evaluated', 'and', 'compared', 'based', 'on', 'kolmogorovsmirnov', 'statistic', 'accuracy', 'f1', 'score', 'type', 'i', 'error', 'type', 'ii', 'error', 'and', 'roc', 'curve', 'on', 'the', 'holdout', 'dataset', 'with', 'their', 'best', 'probability', 'cutoffs', 'results', 'show', 'that', 'bayesian', 'network', 'is', 'the', 'most', 'insensitive', 'to', 'the', 'event', 'rate', 'while', 'support', 'vector', 'machine', 'is', 'the', 'most', 'sensitive']]
|
[-0.0464442480291272, 0.02474801242030386, -0.03979288575014678, 0.1433170428644095, -0.06946381127847166, -0.18112362018738198, 0.1265184348762228, 0.4256233155984303, -0.21707163453904976, -0.32842751656626834, 0.14742482801224907, -0.3233032659274237, -0.12230684815681186, 0.17305632450714192, -0.11213634989128031, 0.11507445908280026, 0.11544626115275354, 0.08984351346333479, -0.018593134067888404, -0.33114018415919794, 0.28055583375088616, 0.12961440314378203, 0.3867433508536939, -0.020982820279334253, 0.09458488668475686, -0.02188597233195243, -0.08061190404897106, -0.015367312706075609, -0.08241161065650823, 0.09556223093853171, 0.2442299220776978, 0.21198736663329704, 0.3140705704978057, -0.32336763459546813, -0.19800557835220262, 0.1277340479098774, 0.08249003105427556, 0.047630662787384516, 0.01862150411490865, -0.27713546777497333, 0.10768862628410089, -0.19714091465776337, -0.003969416155977624, -0.03988729771226644, -0.004514419291858914, 0.03034102916837959, -0.29944490024755743, 0.13470908134276496, -0.00036826181097020363, 0.11711219116274653, -0.0528409011694121, -0.16892187602753783, 0.0006922956572139058, 0.08310112555286493, 0.08672389745198447, 0.07124268724904236, 0.15485290659607612, -0.1407038755811237, -0.1635105733655329, 0.3115302715771671, -0.09160365912549455, -0.17041965381178106, 0.18160773475718653, -0.11237262845810117, -0.13044005775310355, 0.13128410963470052, 0.2593140178392159, 0.0703249744155669, -0.19679274959168558, -0.03405138296295953, 0.03914097724373278, 0.18657905567308952, 0.054176737750270244, -0.05820383484282627, 0.16239897701246986, 0.2190835448198727, -0.03027221689016783, 0.08568147035508321, -0.2273544993460307, -0.07913890940875842, -0.23516753008990582, -0.10533392361750633, -0.12614101886363893, -0.008278610440902412, -0.14866046499529179, -0.14499537089080872, 0.4049552567110493, 0.1940143519627123, 0.18945674505727045, 0.1345179397749297, 0.25044673471390433, 0.07979111160183774, 0.04793320922983874, 0.08992484599062851, 0.24218709188160198, 0.0716233553128028, 0.0576397344742998, -0.13990256910629828, 0.15438102607711635, 0.026276268574593847]
|
1,803.03757
|
Surface wrinkling of an elastic block subject to biaxial loading by an
energy method
|
Wrinkles are often observed on the surfaces of compressed soft materials in
nature. In the past few decades, the fascinating surface patterns have been
studied extensively by using the linear bifurcation analysis under plane
strain. The bifurcation concerns the non-uniqueness solutions, however, it
delivers little information about the surface instability before and after the
threshold. In this paper, we study surface wrinkling of a finite elastic block
of general elastic materials subject to biaxial loading by an energy method.
The first and second variations of the strain energy functional are
systematically studied, and an eigenvalue problem is proposed whether the
second variation is positive definite. We illustrate our analysis by using
neo-Hookean materials as an example. Accordingly, we show that the initially
flat state has the lowest energy and is stable before the stretches reach the
threshold at which the surface wrinkling occurs. We also find that the
threshold is independent of the size of the block and coincides with that of
the surface instability of an elastic half-space studied by Biot (1963) with
the linear bifurcation analysis. However, the stability region cannot be
obtained by using the linear stability analysis. In contrast to the
size-independent threshold, the wavelength of surface wrinkling depends on the
size of the block. We first show that a two-dimensional rather than a
three-dimensional perturbation has lower energy and is more likely to trigger
the surface wrinkling in the instability region. The same stretch threshold of
a finite block and a half-space could shed light on the relation of surface
instabilities between finite and infinite bodies.
|
cond-mat.soft
|
wrinkles are often observed on the surfaces of compressed soft materials in nature in the past few decades the fascinating surface patterns have been studied extensively by using the linear bifurcation analysis under plane strain the bifurcation concerns the nonuniqueness solutions however it delivers little information about the surface instability before and after the threshold in this paper we study surface wrinkling of a finite elastic block of general elastic materials subject to biaxial loading by an energy method the first and second variations of the strain energy functional are systematically studied and an eigenvalue problem is proposed whether the second variation is positive definite we illustrate our analysis by using neohookean materials as an example accordingly we show that the initially flat state has the lowest energy and is stable before the stretches reach the threshold at which the surface wrinkling occurs we also find that the threshold is independent of the size of the block and coincides with that of the surface instability of an elastic halfspace studied by biot 1963 with the linear bifurcation analysis however the stability region cannot be obtained by using the linear stability analysis in contrast to the sizeindependent threshold the wavelength of surface wrinkling depends on the size of the block we first show that a twodimensional rather than a threedimensional perturbation has lower energy and is more likely to trigger the surface wrinkling in the instability region the same stretch threshold of a finite block and a halfspace could shed light on the relation of surface instabilities between finite and infinite bodies
|
[['wrinkles', 'are', 'often', 'observed', 'on', 'the', 'surfaces', 'of', 'compressed', 'soft', 'materials', 'in', 'nature', 'in', 'the', 'past', 'few', 'decades', 'the', 'fascinating', 'surface', 'patterns', 'have', 'been', 'studied', 'extensively', 'by', 'using', 'the', 'linear', 'bifurcation', 'analysis', 'under', 'plane', 'strain', 'the', 'bifurcation', 'concerns', 'the', 'nonuniqueness', 'solutions', 'however', 'it', 'delivers', 'little', 'information', 'about', 'the', 'surface', 'instability', 'before', 'and', 'after', 'the', 'threshold', 'in', 'this', 'paper', 'we', 'study', 'surface', 'wrinkling', 'of', 'a', 'finite', 'elastic', 'block', 'of', 'general', 'elastic', 'materials', 'subject', 'to', 'biaxial', 'loading', 'by', 'an', 'energy', 'method', 'the', 'first', 'and', 'second', 'variations', 'of', 'the', 'strain', 'energy', 'functional', 'are', 'systematically', 'studied', 'and', 'an', 'eigenvalue', 'problem', 'is', 'proposed', 'whether', 'the', 'second', 'variation', 'is', 'positive', 'definite', 'we', 'illustrate', 'our', 'analysis', 'by', 'using', 'neohookean', 'materials', 'as', 'an', 'example', 'accordingly', 'we', 'show', 'that', 'the', 'initially', 'flat', 'state', 'has', 'the', 'lowest', 'energy', 'and', 'is', 'stable', 'before', 'the', 'stretches', 'reach', 'the', 'threshold', 'at', 'which', 'the', 'surface', 'wrinkling', 'occurs', 'we', 'also', 'find', 'that', 'the', 'threshold', 'is', 'independent', 'of', 'the', 'size', 'of', 'the', 'block', 'and', 'coincides', 'with', 'that', 'of', 'the', 'surface', 'instability', 'of', 'an', 'elastic', 'halfspace', 'studied', 'by', 'biot', '1963', 'with', 'the', 'linear', 'bifurcation', 'analysis', 'however', 'the', 'stability', 'region', 'can', 'not', 'be', 'obtained', 'by', 'using', 'the', 'linear', 'stability', 'analysis', 'in', 'contrast', 'to', 'the', 'sizeindependent', 'threshold', 'the', 'wavelength', 'of', 'surface', 'wrinkling', 'depends', 'on', 'the', 'size', 'of', 'the', 'block', 'we', 'first', 'show', 'that', 'a', 'twodimensional', 'rather', 'than', 'a', 'threedimensional', 'perturbation', 'has', 'lower', 'energy', 'and', 'is', 'more', 'likely', 'to', 'trigger', 'the', 'surface', 'wrinkling', 'in', 'the', 'instability', 'region', 'the', 'same', 'stretch', 'threshold', 'of', 'a', 'finite', 'block', 'and', 'a', 'halfspace', 'could', 'shed', 'light', 'on', 'the', 'relation', 'of', 'surface', 'instabilities', 'between', 'finite', 'and', 'infinite', 'bodies']]
|
[-0.1340870598143585, 0.13506677905688566, -0.09526120694460817, 0.03734035296756632, -0.04906093882830487, -0.08161433082863064, 0.031643627297207856, 0.34227709438765547, -0.2873435804499527, -0.2693084182625615, 0.1453063046245992, -0.2592785372185514, -0.1870689622898771, 0.18658836643417714, -0.029147559654488377, 0.07753817714352644, 0.02165806764791869, 0.036122990100296175, -0.07238871044744133, -0.22411000149018834, 0.3288104824618728, 0.0777590328895039, 0.31093857135936503, 0.0780172781707303, 0.060089978066856, -0.003072116108973802, 0.03895895283861185, 0.043341627179308194, -0.18561750443846445, 0.07589759798462765, 0.21306700121437178, 0.032666758775198076, 0.2706598701339414, -0.4435861402596454, -0.24952400650630016, 0.06271213213273302, 0.12874519717142, 0.13699036948729434, -0.03129757626253431, -0.2148902989294778, 0.11154968456190989, -0.11762819837295373, -0.1434274727588818, -0.012526239652385694, 0.042929197633141326, 0.018489021503985043, -0.20303013630678793, 0.09934670768244075, 0.08202068786712662, 0.07408445726952138, -0.10224210636029091, -0.09112341890159553, -0.07965557484128619, 0.07913886619738893, 0.08892698408298208, -5.4163628129843084e-05, 0.1402793007348273, -0.1210590469041521, -0.043233514361737564, 0.36699093387991844, -0.04819610541294736, -0.1668188540302288, 0.1709928668320947, -0.13643991260590274, -0.06311404189443258, 0.18638382799735023, 0.17609706982607662, 0.11757172622854771, -0.11761729298550494, 0.08110848302199355, -0.04299898406105002, 0.19155602924834994, 0.12138780174805348, -0.03572783552137744, 0.19001140375443884, 0.2111700634935956, 0.08039438062372355, 0.17214996316816786, -0.09802670934404609, -0.0648177494597088, -0.2957635970363209, -0.13502381675883787, -0.18312451871910013, 0.0013197257511965569, -0.07696196983545266, -0.18807942297136124, 0.40046162875227004, 0.07322388104134674, 0.20128183747741274, 0.01111957925960123, 0.25415886217996636, 0.1311566992182967, 0.05284203869070261, 0.07163363403395416, 0.3114281532191138, 0.13688521496400607, 0.06784711583990262, -0.2226684412231157, 0.07402517247762005, 0.047526559917761]
|
1,803.03758
|
A Tutorial On Autonomous Vehicle Steering Controller Design, Simulation
and Implementation
|
In this tutorial, we detailed simple controllers for autonomous parking and
path following for self-driving cars providing practical methods for curvature
computation.
|
cs.RO
|
in this tutorial we detailed simple controllers for autonomous parking and path following for selfdriving cars providing practical methods for curvature computation
|
[['in', 'this', 'tutorial', 'we', 'detailed', 'simple', 'controllers', 'for', 'autonomous', 'parking', 'and', 'path', 'following', 'for', 'selfdriving', 'cars', 'providing', 'practical', 'methods', 'for', 'curvature', 'computation']]
|
[-0.18385844400406562, 0.03262076464439319, -0.03714108107272874, 0.03567950441819531, -0.17277141867882825, -0.22819896855137564, 0.074350729288364, 0.5060942240736701, -0.22458741801198234, -0.2568596585188061, 0.11248069477997805, -0.2142057768492536, -0.1970598897896707, 0.36710721389813855, -0.22509397830766498, 0.1609462093223225, 0.13305253552442248, -0.016998613327318293, 0.058076358611949465, -0.17009351156990637, 0.259183588988063, -0.010424656116149643, 0.18170436437834392, 0.08597765426913445, 0.11217367541129616, 0.1059455290352079, -0.024818154792724686, -0.0033220059492371297, -0.19381717092950235, 0.17846319985321976, 0.37988704565743153, 0.18046082598580557, 0.3301955227824775, -0.4746582420034842, -0.19725237613205204, 0.11050455936823379, 0.1440468035976995, 0.09276110646103254, -0.10566745101558891, -0.28967948672785, 0.06810259899463166, -0.23383629859679125, -0.1449085116301748, -0.15450472489465028, 0.09740080828355117, 0.030408335637978533, -0.2809300586073236, -0.05037508909167214, 0.0348435083234852, 0.20214033029465514, -0.04994068904356523, -0.07912408509715037, 0.09250423549251123, 0.24883702473545616, -0.04431322792714292, -0.05784442178397016, 0.14507532885975458, -0.15627240879588167, -0.1657019266858697, 0.3926998381926255, 0.0969534339806573, -0.18273013224825263, 0.14205332252789626, 0.03425206392156807, -0.20433138581839475, 0.06791006926108491, 0.257544423612258, 0.13540663303468714, -0.1931680859415792, -0.04732425130152313, 0.04547140865840695, 0.034772610969164154, 0.01974108349531889, -0.020892346108501606, 0.16180261805427357, 0.29534168753095646, 0.22642759356478398, 0.04235205996188928, 0.024536318399689415, -0.16136821545660496, -0.28903316863050516, -0.2702462547882037, -0.12393551311371001, 0.023928771769119936, -0.059787842740743974, -0.0965148061831397, 0.37813952328129247, 0.22767909213011575, 0.09904646331613715, 0.16475357627496123, 0.49141471629792993, 0.11431233301250772, -0.01733430043201555, 0.12852188205810802, 0.14005825829438187, 0.0019003805619749155, 0.23525798007507215, -0.14383680796758694, -0.03166931245306676, 0.10434568296609954]
|
1,803.03759
|
Speech Recognition: Keyword Spotting Through Image Recognition
|
The problem of identifying voice commands has always been a challenge due to
the presence of noise and variability in speed, pitch, etc. We will compare the
efficacies of several neural network architectures for the speech recognition
problem. In particular, we will build a model to determine whether a one second
audio clip contains a particular word (out of a set of 10), an unknown word, or
silence. The models to be implemented are a CNN recommended by the Tensorflow
Speech Recognition tutorial, a low-latency CNN, and an adversarially trained
CNN. The result is a demonstration of how to convert a problem in audio
recognition to the better-studied domain of image classification, where the
powerful techniques of convolutional neural networks are fully developed.
Additionally, we demonstrate the applicability of the technique of Virtual
Adversarial Training (VAT) to this problem domain, functioning as a powerful
regularizer with promising potential future applications.
|
stat.ML cs.LG
|
the problem of identifying voice commands has always been a challenge due to the presence of noise and variability in speed pitch etc we will compare the efficacies of several neural network architectures for the speech recognition problem in particular we will build a model to determine whether a one second audio clip contains a particular word out of a set of 10 an unknown word or silence the models to be implemented are a cnn recommended by the tensorflow speech recognition tutorial a lowlatency cnn and an adversarially trained cnn the result is a demonstration of how to convert a problem in audio recognition to the betterstudied domain of image classification where the powerful techniques of convolutional neural networks are fully developed additionally we demonstrate the applicability of the technique of virtual adversarial training vat to this problem domain functioning as a powerful regularizer with promising potential future applications
|
[['the', 'problem', 'of', 'identifying', 'voice', 'commands', 'has', 'always', 'been', 'a', 'challenge', 'due', 'to', 'the', 'presence', 'of', 'noise', 'and', 'variability', 'in', 'speed', 'pitch', 'etc', 'we', 'will', 'compare', 'the', 'efficacies', 'of', 'several', 'neural', 'network', 'architectures', 'for', 'the', 'speech', 'recognition', 'problem', 'in', 'particular', 'we', 'will', 'build', 'a', 'model', 'to', 'determine', 'whether', 'a', 'one', 'second', 'audio', 'clip', 'contains', 'a', 'particular', 'word', 'out', 'of', 'a', 'set', 'of', '10', 'an', 'unknown', 'word', 'or', 'silence', 'the', 'models', 'to', 'be', 'implemented', 'are', 'a', 'cnn', 'recommended', 'by', 'the', 'tensorflow', 'speech', 'recognition', 'tutorial', 'a', 'lowlatency', 'cnn', 'and', 'an', 'adversarially', 'trained', 'cnn', 'the', 'result', 'is', 'a', 'demonstration', 'of', 'how', 'to', 'convert', 'a', 'problem', 'in', 'audio', 'recognition', 'to', 'the', 'betterstudied', 'domain', 'of', 'image', 'classification', 'where', 'the', 'powerful', 'techniques', 'of', 'convolutional', 'neural', 'networks', 'are', 'fully', 'developed', 'additionally', 'we', 'demonstrate', 'the', 'applicability', 'of', 'the', 'technique', 'of', 'virtual', 'adversarial', 'training', 'vat', 'to', 'this', 'problem', 'domain', 'functioning', 'as', 'a', 'powerful', 'regularizer', 'with', 'promising', 'potential', 'future', 'applications']]
|
[-0.07691718050084959, -0.0003907245432648608, -0.042018312654589246, 0.06295568596113836, -0.1325771739462628, -0.1914286537770957, 0.012530020425633696, 0.4399230558387685, -0.29945754018555953, -0.29598860368960783, 0.09593769786144989, -0.25335935930777714, -0.22533587262115673, 0.21648494132650678, -0.1480794243058252, 0.1174741525651462, 0.12262466629723325, 0.09674870172256116, -0.025465135117682187, -0.27755397384136216, 0.27221959214282515, 0.030933913381007695, 0.313626866093868, 0.03087718066471885, 0.13544669367322987, -0.07610833262337134, -0.005219830988418786, -0.06339910394752761, -0.01838863916650583, 0.15625466472288005, 0.339114160596823, 0.20642905892810515, 0.36333676048510727, -0.4111917309037991, -0.23194670550124377, 0.10587105769414029, 0.15347702446199904, 0.1405729206432057, -0.0450241933240799, -0.3552041581313082, 0.12775840082529294, -0.19905682460673704, 0.014352178469850313, -0.09101628233997414, 0.012133448209688567, -0.024680946794207265, -0.27593619521588536, -0.014129778926554542, 0.10355314475346682, 0.057146748784154454, -0.046719264023431, -0.06136760918498539, 0.04477099748797115, 0.18941617535971006, 0.022743546476606404, 0.10271269631893967, 0.12497741421184584, -0.21742587402480928, -0.1502728340522255, 0.3839949467688199, -0.0668950031555239, -0.23600889930514082, 0.17818717745245252, 0.011304424369345175, -0.1509901039339852, 0.07995900402358114, 0.2810308649173419, 0.09034846506500305, -0.19430202986434064, -0.004272180419546496, -0.029316946246892513, 0.224114818123463, 0.06709503009915352, -0.02954371871689222, 0.1881088212705936, 0.2920206062708225, 0.011507077333236101, 0.1898164899961948, -0.1656511748122089, 0.019240147446578326, -0.21341393434211312, -0.09092908141034461, -0.20350095111214175, -0.005849853323635039, -0.05782914058217035, -0.16826765143293762, 0.4462155469461975, 0.22045092906602878, 0.19054453211036454, 0.10366498986134093, 0.3513917135709159, 0.026603078057199574, 0.1169326481153101, 0.06352658847021876, 0.1806809816418853, 0.03662184973703635, 0.14830462896458854, -0.1409371087443624, 0.07091929257578598, 0.05306476763380854]
|
1,803.0376
|
Efficient Determination of Equivalence for Encrypted Data
|
Secure computation of equivalence has fundamental application in many
different areas, including healthcare. We study this problem in the context of
matching an individual identity to link medical records across systems. We
develop an efficient solution for equivalence based on existing work that can
evaluate the greater than relation. We implement the approach and demonstrate
its effectiveness on data, as well as demonstrate how it meets regulatory
criteria for risk.
|
cs.CR
|
secure computation of equivalence has fundamental application in many different areas including healthcare we study this problem in the context of matching an individual identity to link medical records across systems we develop an efficient solution for equivalence based on existing work that can evaluate the greater than relation we implement the approach and demonstrate its effectiveness on data as well as demonstrate how it meets regulatory criteria for risk
|
[['secure', 'computation', 'of', 'equivalence', 'has', 'fundamental', 'application', 'in', 'many', 'different', 'areas', 'including', 'healthcare', 'we', 'study', 'this', 'problem', 'in', 'the', 'context', 'of', 'matching', 'an', 'individual', 'identity', 'to', 'link', 'medical', 'records', 'across', 'systems', 'we', 'develop', 'an', 'efficient', 'solution', 'for', 'equivalence', 'based', 'on', 'existing', 'work', 'that', 'can', 'evaluate', 'the', 'greater', 'than', 'relation', 'we', 'implement', 'the', 'approach', 'and', 'demonstrate', 'its', 'effectiveness', 'on', 'data', 'as', 'well', 'as', 'demonstrate', 'how', 'it', 'meets', 'regulatory', 'criteria', 'for', 'risk']]
|
[-0.08565365918246763, -0.04297702329391281, -0.04068090701475739, 0.101145994914363, -0.0637717847712338, -0.11472964871209115, 0.07209719042293727, 0.4150531425007752, -0.2585000857910407, -0.3430586656289441, 0.1513387739159433, -0.26149593948253563, -0.20803800399548242, 0.27486968730310246, -0.13914406833729506, 0.059748207111676624, 0.05717157334355372, 0.0445721517250474, -0.03570671393203416, -0.23695236120007135, 0.32701067845337095, 0.030333663815898554, 0.39618412923134333, 0.09937358877754637, 0.1018036513073769, 0.03846606564308916, -0.02469346161233261, -0.0014191121528191225, -0.11480391512543844, 0.1703016860127848, 0.30137680609311374, 0.26250127970374054, 0.3203405228177352, -0.42476249117670317, -0.18208941692220312, 0.0957342696575714, 0.16344386163566793, 0.08193956594914198, -0.0427027696776869, -0.24334641970427973, 0.09981127594531114, -0.21915906704962254, -0.09033841997318502, -0.1427984025861536, 0.011558116732963494, -0.016418283788620362, -0.23299984189548661, 0.036881774238177706, 0.007222824808143611, 0.09038228362000414, -0.06629899261419528, -0.08003436776011118, 0.043760062977006395, 0.19768979297285633, 0.049789001107481974, -0.017151092841023844, 0.13009249460883437, -0.11922070008742074, -0.18370560512079726, 0.39079041564837097, -0.027466914840416783, -0.18689706818050972, 0.23317451755449708, -0.02398849997137274, -0.16933025676491006, 0.010044833039864897, 0.22423248877748847, 0.10420190795058651, -0.1857553950045258, 0.05223784233759424, -0.04641099636043821, 0.14277018013942455, 0.047789208105366146, 0.043462610810196825, 0.15829024896624366, 0.20378337829772916, 0.10616486885368691, 0.17545430157333614, -0.03678435773056533, -0.10017204960542066, -0.24375462659767697, -0.1927330171157207, -0.14705329351127147, -0.010237863613292575, -0.08686144021318926, -0.13852457710142646, 0.3815519106175218, 0.263790818403608, 0.14454772085217493, 0.061064310890339715, 0.3573372529154377, 0.0848803665788312, 0.058578294300605196, 0.04427536028836455, 0.19789475591054984, 0.059785330425282675, 0.05458349036052823, -0.17428204377314874, 0.1022457475574421, 0.03618621688593911]
|
1,803.03761
|
Quantum-secure message authentication via blind-unforgeability
|
Formulating and designing authentication of classical messages in the
presence of adversaries with quantum query access has been a longstanding
challenge, as the familiar classical notions of unforgeability do not directly
translate into meaningful notions in the quantum setting. A particular
difficulty is how to fairly capture the notion of "predicting an unqueried
value" when the adversary can query in quantum superposition.
We propose a natural definition of unforgeability against quantum adversaries
called blind unforgeability. This notion defines a function to be predictable
if there exists an adversary who can use "partially blinded" oracle access to
predict values in the blinded region. We support the proposal with a number of
technical results. We begin by establishing that the notion coincides with
EUF-CMA in the classical setting and go on to demonstrate that the notion is
satisfied by a number of simple guiding examples, such as random functions and
quantum-query-secure pseudorandom functions. We then show the suitability of
blind unforgeability for supporting canonical constructions and reductions. We
prove that the "hash-and-MAC" paradigm and the Lamport one-time digital
signature scheme are indeed unforgeable according to the definition. To support
our analysis, we additionally define and study a new variety of quantum-secure
hash functions called Bernoulli-preserving.
Finally, we demonstrate that blind unforgeability is stronger than a previous
definition of Boneh and Zhandry [EUROCRYPT '13, CRYPTO '13] in the sense that
we can construct an explicit function family which is forgeable by an attack
that is recognized by blind-unforgeability, yet satisfies the definition by
Boneh and Zhandry.
|
quant-ph cs.CR
|
formulating and designing authentication of classical messages in the presence of adversaries with quantum query access has been a longstanding challenge as the familiar classical notions of unforgeability do not directly translate into meaningful notions in the quantum setting a particular difficulty is how to fairly capture the notion of predicting an unqueried value when the adversary can query in quantum superposition we propose a natural definition of unforgeability against quantum adversaries called blind unforgeability this notion defines a function to be predictable if there exists an adversary who can use partially blinded oracle access to predict values in the blinded region we support the proposal with a number of technical results we begin by establishing that the notion coincides with eufcma in the classical setting and go on to demonstrate that the notion is satisfied by a number of simple guiding examples such as random functions and quantumquerysecure pseudorandom functions we then show the suitability of blind unforgeability for supporting canonical constructions and reductions we prove that the hashandmac paradigm and the lamport onetime digital signature scheme are indeed unforgeable according to the definition to support our analysis we additionally define and study a new variety of quantumsecure hash functions called bernoullipreserving finally we demonstrate that blind unforgeability is stronger than a previous definition of boneh and zhandry eurocrypt 13 crypto 13 in the sense that we can construct an explicit function family which is forgeable by an attack that is recognized by blindunforgeability yet satisfies the definition by boneh and zhandry
|
[['formulating', 'and', 'designing', 'authentication', 'of', 'classical', 'messages', 'in', 'the', 'presence', 'of', 'adversaries', 'with', 'quantum', 'query', 'access', 'has', 'been', 'a', 'longstanding', 'challenge', 'as', 'the', 'familiar', 'classical', 'notions', 'of', 'unforgeability', 'do', 'not', 'directly', 'translate', 'into', 'meaningful', 'notions', 'in', 'the', 'quantum', 'setting', 'a', 'particular', 'difficulty', 'is', 'how', 'to', 'fairly', 'capture', 'the', 'notion', 'of', 'predicting', 'an', 'unqueried', 'value', 'when', 'the', 'adversary', 'can', 'query', 'in', 'quantum', 'superposition', 'we', 'propose', 'a', 'natural', 'definition', 'of', 'unforgeability', 'against', 'quantum', 'adversaries', 'called', 'blind', 'unforgeability', 'this', 'notion', 'defines', 'a', 'function', 'to', 'be', 'predictable', 'if', 'there', 'exists', 'an', 'adversary', 'who', 'can', 'use', 'partially', 'blinded', 'oracle', 'access', 'to', 'predict', 'values', 'in', 'the', 'blinded', 'region', 'we', 'support', 'the', 'proposal', 'with', 'a', 'number', 'of', 'technical', 'results', 'we', 'begin', 'by', 'establishing', 'that', 'the', 'notion', 'coincides', 'with', 'eufcma', 'in', 'the', 'classical', 'setting', 'and', 'go', 'on', 'to', 'demonstrate', 'that', 'the', 'notion', 'is', 'satisfied', 'by', 'a', 'number', 'of', 'simple', 'guiding', 'examples', 'such', 'as', 'random', 'functions', 'and', 'quantumquerysecure', 'pseudorandom', 'functions', 'we', 'then', 'show', 'the', 'suitability', 'of', 'blind', 'unforgeability', 'for', 'supporting', 'canonical', 'constructions', 'and', 'reductions', 'we', 'prove', 'that', 'the', 'hashandmac', 'paradigm', 'and', 'the', 'lamport', 'onetime', 'digital', 'signature', 'scheme', 'are', 'indeed', 'unforgeable', 'according', 'to', 'the', 'definition', 'to', 'support', 'our', 'analysis', 'we', 'additionally', 'define', 'and', 'study', 'a', 'new', 'variety', 'of', 'quantumsecure', 'hash', 'functions', 'called', 'bernoullipreserving', 'finally', 'we', 'demonstrate', 'that', 'blind', 'unforgeability', 'is', 'stronger', 'than', 'a', 'previous', 'definition', 'of', 'boneh', 'and', 'zhandry', 'eurocrypt', '13', 'crypto', '13', 'in', 'the', 'sense', 'that', 'we', 'can', 'construct', 'an', 'explicit', 'function', 'family', 'which', 'is', 'forgeable', 'by', 'an', 'attack', 'that', 'is', 'recognized', 'by', 'blindunforgeability', 'yet', 'satisfies', 'the', 'definition', 'by', 'boneh', 'and', 'zhandry']]
|
[-0.13322238569455822, 0.06535779080572425, -0.1135518537804244, 0.08360474993852192, -0.0882411528727971, -0.19652218303282656, 0.08677180423452932, 0.3305930748380976, -0.2768313457678643, -0.294678570421022, 0.08480831409378292, -0.24920330853051237, -0.18321727769028756, 0.19728418003585596, -0.16719028417543497, 0.05758546153699553, 5.6984297360383694e-05, 0.017495180571248995, -0.041073788336718514, -0.24964642102432047, 0.33703231723836413, 0.04663935074284147, 0.27950028784107417, 0.05642786692929334, 0.0931777510803283, 0.03778739163791186, -0.024522649323297365, 0.016408588458151855, -0.11468960598293991, 0.09567108627356168, 0.2597103386726831, 0.2103215949027799, 0.322640287389438, -0.3788562284335644, -0.16943028684504352, 0.1297914653222242, 0.11793021808825283, 0.12640278848712408, -0.06194669313892166, -0.2972365753582468, 0.15928271580988593, -0.20260120578947657, -0.09316038679624457, -0.09779953772874339, -0.017045876120861184, -0.008928241572932401, -0.27683529113194033, -0.022102028072338492, 0.10317925753277508, 0.04474807931147816, -0.0017236086498615482, -0.026544572179479854, 0.03734073842309543, 0.10422109146783178, -0.014504479526940192, 0.0510473726190544, 0.09872546058801573, -0.11003282257626133, -0.18380930717713426, 0.34570367291880466, -0.03785551242740879, -0.2099160842875379, 0.16190689377817175, -0.06304661906629448, -0.14614609717729413, 0.05194193302398367, 0.12613539760106154, 0.09463060573245692, -0.124305394324467, 0.07271977119436938, -0.11560337985640452, 0.18840876838282472, 0.06692399409404325, 0.0861657290182437, 0.1540312803699635, 0.09815443658097196, 0.08083472358374556, 0.16859700888697612, -0.018820194175444362, -0.12418400147186232, -0.3013723916458642, -0.18439322664292582, -0.18586279891596566, 0.05394314568682955, -0.04103435226716101, -0.1634030735482567, 0.34161482903793455, 0.17763231060915483, 0.17722927470728586, 0.11379068966198247, 0.3059754467634071, 0.07566653673899465, 0.06420516164836308, 0.1133253101067948, 0.19074374943457154, 0.07600029446785489, 0.05315093072074946, -0.11857974172134193, 0.13547878442125605, 0.08255604656428218]
|
1,803.03762
|
The Dirichlet Casimir Energy for $\phi^4$ Theory in a Rectangle
|
In this article, we present the zero and first-order radiative correction to
the Dirichlet Casimir energy for massive and massless scalar field confined in
a rectangle. This calculation procedure was conducted in two spatial dimensions
and for the case of the first-order correction term is new. The renormalization
program that we have used in this work, allows all influences from the dominant
boundary conditions (e.g. the Dirichlet boundary condition) be automatically
reflected in the counterterms. This permission usually makes the counterterms
position-dependent. Along with the renormalization program, a supplementary
regularization technique was performed in this work. In this regularization
technique, that we have named Box Subtraction Scheme (BSS), two similar
configurations were introduced and the zero point energies of these two
configurations were subtracted from each other using appropriate limits. This
regularization procedure makes the usage of any analytic continuation
techniques unnecessary. In the present work, first, we briefly present
calculation of the leading order Casimir energy for the massive scalar field in
a rectangle via BSS. Next, the first order correction to the Casimir energy is
calculated by applying the mentioned renormalization and regularization
procedures. Finally, all the necessary limits of obtained answers for both
massive and massless cases are discussed.
|
hep-th
|
in this article we present the zero and firstorder radiative correction to the dirichlet casimir energy for massive and massless scalar field confined in a rectangle this calculation procedure was conducted in two spatial dimensions and for the case of the firstorder correction term is new the renormalization program that we have used in this work allows all influences from the dominant boundary conditions eg the dirichlet boundary condition be automatically reflected in the counterterms this permission usually makes the counterterms positiondependent along with the renormalization program a supplementary regularization technique was performed in this work in this regularization technique that we have named box subtraction scheme bss two similar configurations were introduced and the zero point energies of these two configurations were subtracted from each other using appropriate limits this regularization procedure makes the usage of any analytic continuation techniques unnecessary in the present work first we briefly present calculation of the leading order casimir energy for the massive scalar field in a rectangle via bss next the first order correction to the casimir energy is calculated by applying the mentioned renormalization and regularization procedures finally all the necessary limits of obtained answers for both massive and massless cases are discussed
|
[['in', 'this', 'article', 'we', 'present', 'the', 'zero', 'and', 'firstorder', 'radiative', 'correction', 'to', 'the', 'dirichlet', 'casimir', 'energy', 'for', 'massive', 'and', 'massless', 'scalar', 'field', 'confined', 'in', 'a', 'rectangle', 'this', 'calculation', 'procedure', 'was', 'conducted', 'in', 'two', 'spatial', 'dimensions', 'and', 'for', 'the', 'case', 'of', 'the', 'firstorder', 'correction', 'term', 'is', 'new', 'the', 'renormalization', 'program', 'that', 'we', 'have', 'used', 'in', 'this', 'work', 'allows', 'all', 'influences', 'from', 'the', 'dominant', 'boundary', 'conditions', 'eg', 'the', 'dirichlet', 'boundary', 'condition', 'be', 'automatically', 'reflected', 'in', 'the', 'counterterms', 'this', 'permission', 'usually', 'makes', 'the', 'counterterms', 'positiondependent', 'along', 'with', 'the', 'renormalization', 'program', 'a', 'supplementary', 'regularization', 'technique', 'was', 'performed', 'in', 'this', 'work', 'in', 'this', 'regularization', 'technique', 'that', 'we', 'have', 'named', 'box', 'subtraction', 'scheme', 'bss', 'two', 'similar', 'configurations', 'were', 'introduced', 'and', 'the', 'zero', 'point', 'energies', 'of', 'these', 'two', 'configurations', 'were', 'subtracted', 'from', 'each', 'other', 'using', 'appropriate', 'limits', 'this', 'regularization', 'procedure', 'makes', 'the', 'usage', 'of', 'any', 'analytic', 'continuation', 'techniques', 'unnecessary', 'in', 'the', 'present', 'work', 'first', 'we', 'briefly', 'present', 'calculation', 'of', 'the', 'leading', 'order', 'casimir', 'energy', 'for', 'the', 'massive', 'scalar', 'field', 'in', 'a', 'rectangle', 'via', 'bss', 'next', 'the', 'first', 'order', 'correction', 'to', 'the', 'casimir', 'energy', 'is', 'calculated', 'by', 'applying', 'the', 'mentioned', 'renormalization', 'and', 'regularization', 'procedures', 'finally', 'all', 'the', 'necessary', 'limits', 'of', 'obtained', 'answers', 'for', 'both', 'massive', 'and', 'massless', 'cases', 'are', 'discussed']]
|
[-0.12708117672251446, 0.09593572257787432, -0.09556508372367203, 0.08968235278389149, -0.07768155662412064, -0.1305083904742715, 0.03742484103122929, 0.3684819031709639, -0.197898791694903, -0.29471913172798875, 0.09821990719883435, -0.2550106583484293, -0.14442171031000592, 0.14274028050113874, -0.03321714871816595, 0.10047876990157051, 0.05798370557281622, 0.035285029071613704, -0.0799589158764275, -0.2500238700926599, 0.3836503470268119, 0.049340880701853204, 0.2449290157009912, 0.0798468118562884, 0.057549376288800046, 0.026354439361804708, -0.07051437975156426, 0.01094025322922474, -0.15010908359033806, 0.08394229625055502, 0.2246460568535575, 0.04424999631643941, 0.26419965278283497, -0.40624112339856305, -0.19292162914788075, 0.07165301409503906, 0.1493007240503292, 0.140966320965937, -0.04592361533322768, -0.24215041772153523, 0.07341405176234865, -0.17344197925493712, -0.12250631821968842, -0.08400218869734666, -0.06381571165742445, -0.046497101516296886, -0.2821504335647615, 0.07109216046012422, 0.01275538326250297, 0.02921315666552089, -0.09651131246562836, -0.12119711280251752, 0.017888548675611026, 0.12441607286904634, 0.08768077366662645, 0.02920641442230617, 0.09424707252015867, -0.10099969807485497, -0.08445486251154158, 0.3660365764217654, -0.06419238188787534, -0.23127237228114195, 0.15859424390618015, -0.10907742373949599, -0.15361948365214198, 0.11634023389306454, 0.11933008046811538, 0.1537541569758663, -0.21403545939990568, 0.12317623353925174, 0.0247764962686152, 0.11949697625780095, 0.1163345461107311, -0.016507697104946664, 0.15612159596553238, 0.09744176132567596, 0.04129153672123955, 0.18361892148196504, -0.09164045528176766, -0.08025868634444357, -0.38018247909327546, -0.16083783412462857, -0.16035658223116495, -0.003848482325608556, -0.09277286674636577, -0.15264536398416845, 0.37594269272717656, 0.19128341009923358, 0.16438542122550373, 0.02152997595119742, 0.3353715139812338, 0.16336672071201525, 0.11097081694728925, 0.07627702557878328, 0.23876422857877216, 0.10346182908673798, 0.12092847965132113, -0.23711781234810092, -0.04623954312525468, 0.11865671128979746]
|
1,803.03763
|
\bf $\delta M$ Formalism and Anisotropic Chaotic Inflation Power
Spectrum
|
A new analytical approach to linear perturbations in anisotropic inflation
has been introduced in [A. Talebian-Ashkezari, N. Ahmadi and A.A. Abolhasanib,
JCAP 03(2018)001] under the name of $\delta M$ formalism. In this paper we
apply the mentioned approach to a model of anisotropic inflation driven by a
scalar field, coupled to the kinetic term of a vector field with a $U(1)$
symmetry. The $\delta M$ formalism provides an efficient way of computing
tensor- tensor, tensor- scalar as well as scalar- scalar 2-point correlations
that are needed for the analysis of the observational features of an
anisotropic model on the CMB. A comparison between $\delta M$ results and the
tedious calculations using in-in formalism shows the aptitude of the $\delta M$
formalism in calculating accurate two point correlation functions between
physical modes of the system.
|
gr-qc
|
a new analytical approach to linear perturbations in anisotropic inflation has been introduced in a talebianashkezari n ahmadi and aa abolhasanib jcap 032018001 under the name of delta m formalism in this paper we apply the mentioned approach to a model of anisotropic inflation driven by a scalar field coupled to the kinetic term of a vector field with a u1 symmetry the delta m formalism provides an efficient way of computing tensor tensor tensor scalar as well as scalar scalar 2point correlations that are needed for the analysis of the observational features of an anisotropic model on the cmb a comparison between delta m results and the tedious calculations using inin formalism shows the aptitude of the delta m formalism in calculating accurate two point correlation functions between physical modes of the system
|
[['a', 'new', 'analytical', 'approach', 'to', 'linear', 'perturbations', 'in', 'anisotropic', 'inflation', 'has', 'been', 'introduced', 'in', 'a', 'talebianashkezari', 'n', 'ahmadi', 'and', 'aa', 'abolhasanib', 'jcap', '032018001', 'under', 'the', 'name', 'of', 'delta', 'm', 'formalism', 'in', 'this', 'paper', 'we', 'apply', 'the', 'mentioned', 'approach', 'to', 'a', 'model', 'of', 'anisotropic', 'inflation', 'driven', 'by', 'a', 'scalar', 'field', 'coupled', 'to', 'the', 'kinetic', 'term', 'of', 'a', 'vector', 'field', 'with', 'a', 'u1', 'symmetry', 'the', 'delta', 'm', 'formalism', 'provides', 'an', 'efficient', 'way', 'of', 'computing', 'tensor', 'tensor', 'tensor', 'scalar', 'as', 'well', 'as', 'scalar', 'scalar', '2point', 'correlations', 'that', 'are', 'needed', 'for', 'the', 'analysis', 'of', 'the', 'observational', 'features', 'of', 'an', 'anisotropic', 'model', 'on', 'the', 'cmb', 'a', 'comparison', 'between', 'delta', 'm', 'results', 'and', 'the', 'tedious', 'calculations', 'using', 'inin', 'formalism', 'shows', 'the', 'aptitude', 'of', 'the', 'delta', 'm', 'formalism', 'in', 'calculating', 'accurate', 'two', 'point', 'correlation', 'functions', 'between', 'physical', 'modes', 'of', 'the', 'system']]
|
[-0.16260432587751678, 0.12841792313496667, -0.1115966661307136, 0.07766332073787668, -0.0652149113193723, -0.1472055908783076, -0.03602544725641523, 0.32628454675343427, -0.20270902167237898, -0.30537850619116014, -0.0023098982593314794, -0.271884583924961, -0.1738099882126793, 0.14814330535969264, 0.052179226239446465, 0.05182111650733775, 0.01667684230612207, 0.03087525282815838, -0.10454506583810422, -0.19297038972420433, 0.31958946059564597, 0.06863761364788044, 0.2263804238102086, 0.03510702200338799, 0.0857632891132802, 0.012159009347225446, -0.050009480382507764, 0.029158076218094763, -0.14559096940963054, 0.11320361931531028, 0.1861705354734578, 0.0935330564637832, 0.2482424228174882, -0.3791983751366839, -0.20797269237547658, 0.08251957012383082, 0.11624153922063135, 0.0991705535832821, -0.00804618049771987, -0.2580556208338901, 0.07250652191467327, -0.19512918442914276, -0.13209314844464415, -0.10640296625428414, 0.027644225913419865, -0.06246153116652756, -0.3249138960586363, 0.11883844643740608, 0.045337728701908685, 0.03889398146832836, -0.061852746838632656, -0.10856439789867327, -0.021945491669528926, 0.04657673834776861, 0.0655918424639794, 0.07869194690422475, 0.08159752970806657, -0.13116715301738213, -0.06512544190338707, 0.3703609064918097, -0.1682555505433582, -0.21801271352149149, 0.09807227778013881, -0.09405956541957647, -0.12840601777167324, 0.05926771987076735, 0.13978855513420155, 0.14130359273830442, -0.1754476312798526, 0.16796893827201273, -0.005475469893342211, 0.13303421791896175, 0.041215442927938155, 0.006710709520537435, 0.21216333902064172, 0.1268801085458969, 0.023515327840702226, 0.119967587599673, -0.04493055196002638, -0.08715220106381724, -0.3675856094821605, -0.13914918693365486, -0.1839606180193457, 0.07174176804433427, -0.12418484411052186, -0.1731665846074128, 0.4023055633146117, 0.14206369679762434, 0.1981550282563211, 0.040580533139180135, 0.2905894758425056, 0.1059061010734299, 0.05965622605485771, 0.06470155873236368, 0.23392696384312087, 0.2150542592889281, 0.13932583016123026, -0.2305056338539731, -0.05087420240556466, 0.07205272045427265]
|
1,803.03764
|
Variance Networks: When Expectation Does Not Meet Your Expectations
|
Ordinary stochastic neural networks mostly rely on the expected values of
their weights to make predictions, whereas the induced noise is mostly used to
capture the uncertainty, prevent overfitting and slightly boost the performance
through test-time averaging. In this paper, we introduce variance layers, a
different kind of stochastic layers. Each weight of a variance layer follows a
zero-mean distribution and is only parameterized by its variance. We show that
such layers can learn surprisingly well, can serve as an efficient exploration
tool in reinforcement learning tasks and provide a decent defense against
adversarial attacks. We also show that a number of conventional Bayesian neural
networks naturally converge to such zero-mean posteriors. We observe that in
these cases such zero-mean parameterization leads to a much better training
objective than conventional parameterizations where the mean is being learned.
|
stat.ML
|
ordinary stochastic neural networks mostly rely on the expected values of their weights to make predictions whereas the induced noise is mostly used to capture the uncertainty prevent overfitting and slightly boost the performance through testtime averaging in this paper we introduce variance layers a different kind of stochastic layers each weight of a variance layer follows a zeromean distribution and is only parameterized by its variance we show that such layers can learn surprisingly well can serve as an efficient exploration tool in reinforcement learning tasks and provide a decent defense against adversarial attacks we also show that a number of conventional bayesian neural networks naturally converge to such zeromean posteriors we observe that in these cases such zeromean parameterization leads to a much better training objective than conventional parameterizations where the mean is being learned
|
[['ordinary', 'stochastic', 'neural', 'networks', 'mostly', 'rely', 'on', 'the', 'expected', 'values', 'of', 'their', 'weights', 'to', 'make', 'predictions', 'whereas', 'the', 'induced', 'noise', 'is', 'mostly', 'used', 'to', 'capture', 'the', 'uncertainty', 'prevent', 'overfitting', 'and', 'slightly', 'boost', 'the', 'performance', 'through', 'testtime', 'averaging', 'in', 'this', 'paper', 'we', 'introduce', 'variance', 'layers', 'a', 'different', 'kind', 'of', 'stochastic', 'layers', 'each', 'weight', 'of', 'a', 'variance', 'layer', 'follows', 'a', 'zeromean', 'distribution', 'and', 'is', 'only', 'parameterized', 'by', 'its', 'variance', 'we', 'show', 'that', 'such', 'layers', 'can', 'learn', 'surprisingly', 'well', 'can', 'serve', 'as', 'an', 'efficient', 'exploration', 'tool', 'in', 'reinforcement', 'learning', 'tasks', 'and', 'provide', 'a', 'decent', 'defense', 'against', 'adversarial', 'attacks', 'we', 'also', 'show', 'that', 'a', 'number', 'of', 'conventional', 'bayesian', 'neural', 'networks', 'naturally', 'converge', 'to', 'such', 'zeromean', 'posteriors', 'we', 'observe', 'that', 'in', 'these', 'cases', 'such', 'zeromean', 'parameterization', 'leads', 'to', 'a', 'much', 'better', 'training', 'objective', 'than', 'conventional', 'parameterizations', 'where', 'the', 'mean', 'is', 'being', 'learned']]
|
[-0.05392692767654675, 0.07106644929189959, -0.061448698611862036, 0.1023405062078913, -0.11329025975394531, -0.17097725509495956, 0.04775003114133992, 0.44008075941292857, -0.32293496085466805, -0.3122090032854437, 0.05431822067157223, -0.252340394252381, -0.21806197247066855, 0.1765474889318656, -0.14354093150867925, 0.07977121227038905, 0.08542704122671246, 0.04112800963271416, -0.05721139776805946, -0.2680567956230447, 0.28679293559959335, 0.0707058843945826, 0.31897975049783767, -0.04663453618299053, 0.12571983386989322, -0.04108470032861742, 0.0018608743510970397, 0.018899780986277724, -0.059773927118514925, 0.11251245371412731, 0.2891643399297919, 0.14368194293054024, 0.34160969633078814, -0.4357952534690173, -0.2562831010887005, 0.16058019049513242, 0.15905648369952208, 0.12089152943281742, -0.003218679910654841, -0.2663240819204136, 0.0835749289440671, -0.18744997226422394, -0.023076969241369923, -0.1501273275488974, -0.07557418271831244, 0.04587520656930487, -0.3478286012286579, 0.04725961308449636, 0.10714592016556973, 0.02249572757991833, 0.0021202076493293375, -0.17102266044566666, -0.0031786932300667476, 0.11261668174534384, 0.06359535595232173, 0.04215739964827025, 0.16206909671262668, -0.1655359726363494, -0.10408505580445793, 0.3227014726123018, -0.08071251801458565, -0.23759756740318597, 0.17494937749987427, -0.024973171909278544, -0.11642116534244949, 0.10078092907677765, 0.22758612974485667, 0.11478051197898649, -0.14155385260517797, -0.01112734068339745, -0.011997011143469462, 0.17441886258532505, 0.02885113975345871, 0.011135553087984775, 0.14433752449380616, 0.21101654264192185, 0.11467192806286507, 0.14025586109309301, -0.12199759199012099, -0.10937220826201195, -0.23537553559961547, -0.09406647054193011, -0.18714773964755455, 0.05422744391159746, -0.11104775361181832, -0.1781662808146785, 0.36673812020950725, 0.21170159417755194, 0.26401710720991134, 0.1608848176611057, 0.34364849653258156, 0.10211853757687593, 0.08987584980850509, 0.11592360262684252, 0.22384659460589398, 0.07446648538058256, 0.06815276979927626, -0.12562795746119787, 0.16210423989912298, 0.009010259004268986]
|
1,803.03765
|
How to solve the stochastic partial differential equation that gives a
Mat\'ern random field using the finite element method
|
This tutorial teaches parts of the finite element method (FEM), and solves a
stochastic partial differential equation (SPDE). The contents herein are
considered "known" in the numerics literature, but for statisticians it is very
difficult to find a resource for learning these ideas in a timely manner
(without doing a year's worth of courses in numerics). The goal of this
tutorial is to be pedagogical and explain the computations/theory to a
statistician. This is not a practical tutorial, there is little computer code,
and no data analysis.
|
stat.CO
|
this tutorial teaches parts of the finite element method fem and solves a stochastic partial differential equation spde the contents herein are considered known in the numerics literature but for statisticians it is very difficult to find a resource for learning these ideas in a timely manner without doing a years worth of courses in numerics the goal of this tutorial is to be pedagogical and explain the computationstheory to a statistician this is not a practical tutorial there is little computer code and no data analysis
|
[['this', 'tutorial', 'teaches', 'parts', 'of', 'the', 'finite', 'element', 'method', 'fem', 'and', 'solves', 'a', 'stochastic', 'partial', 'differential', 'equation', 'spde', 'the', 'contents', 'herein', 'are', 'considered', 'known', 'in', 'the', 'numerics', 'literature', 'but', 'for', 'statisticians', 'it', 'is', 'very', 'difficult', 'to', 'find', 'a', 'resource', 'for', 'learning', 'these', 'ideas', 'in', 'a', 'timely', 'manner', 'without', 'doing', 'a', 'years', 'worth', 'of', 'courses', 'in', 'numerics', 'the', 'goal', 'of', 'this', 'tutorial', 'is', 'to', 'be', 'pedagogical', 'and', 'explain', 'the', 'computationstheory', 'to', 'a', 'statistician', 'this', 'is', 'not', 'a', 'practical', 'tutorial', 'there', 'is', 'little', 'computer', 'code', 'and', 'no', 'data', 'analysis']]
|
[-0.06415067880609354, 0.03278360206384732, -0.12456318157790013, 0.10774741819545323, -0.1781202268808387, -0.1826074022561485, 0.03381271885578022, 0.390336308931542, -0.2700471281003597, -0.3116105940696502, 0.1437120565042701, -0.2746193788750747, -0.16357467509806156, 0.18849460753547245, -0.14925515449194368, 0.03318083560267507, 0.12614204280814806, 0.033269475138378, -0.05839898978186728, -0.2887596835106135, 0.2594622821969435, 0.07742168333348927, 0.23952421634782886, 0.07219350773862801, 0.09800621167740373, -0.055662342672084655, -0.10517958569141418, 0.006917080354638571, -0.12255308118670485, 0.10239697318134267, 0.4139942106855817, 0.1789379276519338, 0.3860443542429874, -0.40745053756548916, -0.1911953192983949, 0.0625533849978278, 0.1263877717699997, 0.18234836190754852, -0.08938015322200954, -0.2397660706354695, 0.06268040234287985, -0.17812864467241737, -0.1221572608405421, -0.08782391302249676, 0.04108504048375369, -0.06320717289697292, -0.2385380627143435, 0.011664384916468068, 0.07975109108875311, 0.11336310697058866, 0.02400347783750053, -0.10832792719782786, 0.06858800474532642, 0.12093164312090118, 0.07705963432225724, 0.04828860035144486, 0.059520075831367356, -0.11199508065108729, -0.07611625915025036, 0.3989635880191832, -0.007931639554065674, -0.24434116384729224, 0.1741760937540337, -0.07271981256104312, -0.16028955295616978, 0.10393668351651625, 0.15880263476296827, 0.12401367435881565, -0.22880085792289614, 0.09193274753809863, -0.056248364645208035, 0.20010790307897813, -0.018320327034480003, -0.05887059792253557, 0.16089260668038977, 0.20941055150226104, 0.034493441931730096, 0.06299197896746485, 0.03529993517237694, -0.13745486959381853, -0.30937909501534344, -0.17437078353277471, -0.18451784936667875, 0.015974565072230138, 0.0002508169477656592, -0.15417887563113297, 0.36715297436958916, 0.19304680525390214, 0.12783945271702007, 0.028773677952284384, 0.34307824197052006, 0.10194084867510166, 0.0326530750451554, 0.07803739471967484, 0.18006933888496268, 0.13505750320050433, 0.21774051641655523, -0.14558250830863428, 0.059754514693130936, 0.024100310104184373]
|
1,803.03766
|
Bright luminescence from indirect and strongly bound excitons in hBN
|
A quantitative analysis of the excitonic luminescence efficiency in hexagonal
boron nitride (hBN) is carried out by cathodoluminescence in the ultraviolet
range and compared with zinc oxide and diamond single crystals. A high quantum
yield value of ~50% is found for hBN at 10 K comparable to that of direct
bandgap semiconductors. This bright luminescence at 215 nm remains stable up to
room temperature, evidencing the strongly bound character of excitons in bulk
hBN. Ab initio calculations of the exciton dispersion confirm the indirect
nature of the lowest-energy exciton whose binding energy is found equal to 300
meV, in agreement with the thermal stability observed in luminescence. The
direct exciton is found at a higher energy but very close to the indirect one,
which solves the long debated Stokes shift in bulk hBN.
|
cond-mat.mtrl-sci
|
a quantitative analysis of the excitonic luminescence efficiency in hexagonal boron nitride hbn is carried out by cathodoluminescence in the ultraviolet range and compared with zinc oxide and diamond single crystals a high quantum yield value of 50 is found for hbn at 10 k comparable to that of direct bandgap semiconductors this bright luminescence at 215 nm remains stable up to room temperature evidencing the strongly bound character of excitons in bulk hbn ab initio calculations of the exciton dispersion confirm the indirect nature of the lowestenergy exciton whose binding energy is found equal to 300 mev in agreement with the thermal stability observed in luminescence the direct exciton is found at a higher energy but very close to the indirect one which solves the long debated stokes shift in bulk hbn
|
[['a', 'quantitative', 'analysis', 'of', 'the', 'excitonic', 'luminescence', 'efficiency', 'in', 'hexagonal', 'boron', 'nitride', 'hbn', 'is', 'carried', 'out', 'by', 'cathodoluminescence', 'in', 'the', 'ultraviolet', 'range', 'and', 'compared', 'with', 'zinc', 'oxide', 'and', 'diamond', 'single', 'crystals', 'a', 'high', 'quantum', 'yield', 'value', 'of', '50', 'is', 'found', 'for', 'hbn', 'at', '10', 'k', 'comparable', 'to', 'that', 'of', 'direct', 'bandgap', 'semiconductors', 'this', 'bright', 'luminescence', 'at', '215', 'nm', 'remains', 'stable', 'up', 'to', 'room', 'temperature', 'evidencing', 'the', 'strongly', 'bound', 'character', 'of', 'excitons', 'in', 'bulk', 'hbn', 'ab', 'initio', 'calculations', 'of', 'the', 'exciton', 'dispersion', 'confirm', 'the', 'indirect', 'nature', 'of', 'the', 'lowestenergy', 'exciton', 'whose', 'binding', 'energy', 'is', 'found', 'equal', 'to', '300', 'mev', 'in', 'agreement', 'with', 'the', 'thermal', 'stability', 'observed', 'in', 'luminescence', 'the', 'direct', 'exciton', 'is', 'found', 'at', 'a', 'higher', 'energy', 'but', 'very', 'close', 'to', 'the', 'indirect', 'one', 'which', 'solves', 'the', 'long', 'debated', 'stokes', 'shift', 'in', 'bulk', 'hbn']]
|
[-0.06987467418508814, 0.17346172044018662, -0.01562801840596069, 0.015377949620422004, 0.024678520337263598, -0.15833802983038744, 0.11849283738870565, 0.48342892953327726, -0.23812391499015398, -0.3379195320132868, -0.04091588123281367, -0.3466056818562679, -0.04202461488198321, 0.2017872053622163, 0.08411032160309921, 0.02716113246725242, 0.04905220027312748, -0.04877356737431951, -0.04888692783380866, -0.18796536944372425, 0.18334761025608146, 0.09904076034838642, 0.33854569984193805, 0.17875850394095077, 0.02523028599168349, -0.06382830059716016, 0.10263203737094886, -0.054057536163556394, -0.1808458223987193, 0.11194448912349053, 0.295130411534101, -0.1868226793769719, 0.2380885312235669, -0.3834371979075267, -0.18642139219139753, 0.019026640858641246, 0.14813576360570996, 0.1221195719392158, -0.09702361881368815, -0.23627384170833834, 0.11462505093138468, -0.07134170193204138, -0.09316411993949485, -0.024955811353638432, 0.00918626694947033, -0.06399947667452402, -0.17870654607597822, 0.1419491469641251, -0.03039758700415268, 0.05011630012898634, -0.13963226457056416, -0.1552703688002132, -0.13235183635768585, -0.01593929246992321, 0.014166654748456986, 0.011780634876060531, 0.2136821965686977, -0.10024447035205487, -0.09947974318148274, 0.4301578871121532, -0.08630943536947489, 0.0005750959367960467, 0.16336400372228285, -0.19570737134987362, -0.02781034889806034, 0.2707618021763357, 0.02296338204637562, 0.13703000358887074, -0.10814745772649233, 0.06951516385704867, -0.014140913704116093, 0.2578514173777452, 0.1339542562333706, 0.13572977719555174, 0.25237992844593365, 0.21414134396884338, 0.04927649737783897, 0.09797543308984741, -0.12022192486302745, -0.02947653810444631, -0.1636427035686539, -0.18983377926305456, -0.23303200111241268, 0.12748278124709578, -0.0734581896429969, -0.21370970464794709, 0.39400367527723984, 0.09168254200691231, 0.15008959363396734, -0.026753636827181213, 0.22254689120428456, 0.10100264640497794, 0.08512765286822717, -0.015345013147234021, 0.3579288846498033, 0.19241117271664726, 0.11310797374471462, -0.2970582645498496, 0.023223663750279667, -0.06322235443027116]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.