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.02867 | Phase transitions for a model with uncountable spin space on the Cayley
tree: the general case | In this paper we complete the analysis of a statistical mechanics model on
Cayley trees of any degree, started in
[EsHaRo12,EsRo10,BoEsRo13,JaKuBo14,Bo17]. The potential is of nearest-neighbor
type and the local state space is compact but uncountable. Based on the system
parameters we prove existence of a critical value $\theta_{\rm c}$ such that
for $\theta\le \theta_{\rm c}$ there is a unique translation-invariant
splitting Gibbs measure. For $\theta_{\rm c}<\theta$ there is a phase
transition with exactly three translation-invariant splitting Gibbs measures.
The proof rests on an analysis of fixed points of an associated non-linear
Hammerstein integral operator for the boundary laws.
| math.PR | in this paper we complete the analysis of a statistical mechanics model on cayley trees of any degree started in esharo12esro10boesro13jakubo14bo17 the potential is of nearestneighbor type and the local state space is compact but uncountable based on the system parameters we prove existence of a critical value theta_rm c such that for thetale theta_rm c there is a unique translationinvariant splitting gibbs measure for theta_rm ctheta there is a phase transition with exactly three translationinvariant splitting gibbs measures the proof rests on an analysis of fixed points of an associated nonlinear hammerstein integral operator for the boundary laws | [['in', 'this', 'paper', 'we', 'complete', 'the', 'analysis', 'of', 'a', 'statistical', 'mechanics', 'model', 'on', 'cayley', 'trees', 'of', 'any', 'degree', 'started', 'in', 'esharo12esro10boesro13jakubo14bo17', 'the', 'potential', 'is', 'of', 'nearestneighbor', 'type', 'and', 'the', 'local', 'state', 'space', 'is', 'compact', 'but', 'uncountable', 'based', 'on', 'the', 'system', 'parameters', 'we', 'prove', 'existence', 'of', 'a', 'critical', 'value', 'theta_rm', 'c', 'such', 'that', 'for', 'thetale', 'theta_rm', 'c', 'there', 'is', 'a', 'unique', 'translationinvariant', 'splitting', 'gibbs', 'measure', 'for', 'theta_rm', 'ctheta', 'there', 'is', 'a', 'phase', 'transition', 'with', 'exactly', 'three', 'translationinvariant', 'splitting', 'gibbs', 'measures', 'the', 'proof', 'rests', 'on', 'an', 'analysis', 'of', 'fixed', 'points', 'of', 'an', 'associated', 'nonlinear', 'hammerstein', 'integral', 'operator', 'for', 'the', 'boundary', 'laws']] | [-0.1752613979291969, 0.12426221111049277, -0.11212340492413056, 0.058538768580658554, -0.06066005484780715, -0.15540788765540536, 0.06574099394136432, 0.34636332866336617, -0.24528173446579246, -0.18333071378553856, 0.09905812315041751, -0.2975203041272352, -0.09967477270283223, 0.18020484258886427, -0.019329241700280383, 0.061532748387936424, 0.06280931585221267, 0.07043127550943089, -0.10585255163712237, -0.14966250897375677, 0.40505687129322665, -0.005472543364276691, 0.25826409075181095, 0.08068908655977979, 0.15826118882859544, 0.026934851989701237, 0.04236780731862753, 0.025808117285606034, -0.1741323580432176, 0.05507108205881882, 0.17900356541302206, 0.09613984258018662, 0.2567515872770502, -0.297590646208549, -0.1908908249449213, 0.19573375329194703, 0.07725604027343382, 0.056743771495886754, -0.03577850782193662, -0.2628729048859784, 0.06197798320054248, -0.12825725066647223, -0.18248903858760485, -0.06431370172459557, 0.08100831206906967, 0.015660118701278557, -0.28142512059409397, 0.06014282320036876, 0.11824898804984607, 0.12537995049235773, -0.07109054910465695, -0.1246897902955035, -0.013060388820511954, 0.06202165636100939, -0.03318483271393735, 0.08105307168384292, 0.05065541173039213, -0.06653036289059613, -0.1195490743622792, 0.37083091164882087, -0.05325065890317593, -0.22454983155879818, 0.16779297473602833, -0.11588251201568969, -0.19158058180188647, 0.10635055004790121, 0.10342963022531523, 0.1264554783511831, -0.11575787142691278, 0.16104738837124646, -0.0481578245347993, 0.18036650489939718, 0.01754327932828847, -0.009999201124610037, 0.16612291987035044, 0.13999311099475137, 0.15065163369670662, 0.1180045711332742, -0.04904860251034344, -0.1363494226480929, -0.350769207822349, -0.18006520805766388, -0.22876428353020503, 0.1107421928793382, -0.15289608873792196, -0.22529079084645728, 0.3923092057633841, 0.10502472812575954, 0.17844269799106582, 0.060311146755227626, 0.2065162719369923, 0.1429168576426918, -0.0030437359712276683, 0.10460430611048502, 0.18750497396579202, 0.13083806147855914, 0.04276243003788499, -0.17605644878361146, 0.036332332823729635, 0.1394393261408015] |
1,803.02868 | Looking for Galactic Diffuse Dark Matter in INO-MagICAL Detector | The Weakly Interacting Massive Particle (WIMP) is a popular particle physics
candidate for the dark matter (DM). It can annihilate and/or decay to neutrino
and antineutrino pair. The proposed 50 kt Magnetized Iron CALorimeter (MagICAL)
detector at the India-based Neutrino Observatory (INO) can observe these pairs
over the conventional atmospheric neutrino and antineutrino fluxes. If we do
not see any excess of events in ten years, then INO-Magical can place
competitive limits on self-annihilation cross-section ($\langle\sigma
v\rangle$) and decay lifetime ($\tau$) of dark matter at 90\% C.L.:
$\langle\sigma v\rangle\leq 1.87\,\times\,10^{-24}$ cm$^3$ s$^{-1}$ and
$\tau\geq 4.8\,\times\,10^{24}$ s for $m_\chi$ = 10 GeV assuming the NFW as DM
density profile.
| hep-ph hep-ex physics.ins-det | the weakly interacting massive particle wimp is a popular particle physics candidate for the dark matter dm it can annihilate andor decay to neutrino and antineutrino pair the proposed 50 kt magnetized iron calorimeter magical detector at the indiabased neutrino observatory ino can observe these pairs over the conventional atmospheric neutrino and antineutrino fluxes if we do not see any excess of events in ten years then inomagical can place competitive limits on selfannihilation crosssection langlesigma vrangle and decay lifetime tau of dark matter at 90 cl langlesigma vrangleleq 187times1024 cm3 s1 and taugeq 48times1024 s for m_chi 10 gev assuming the nfw as dm density profile | [['the', 'weakly', 'interacting', 'massive', 'particle', 'wimp', 'is', 'a', 'popular', 'particle', 'physics', 'candidate', 'for', 'the', 'dark', 'matter', 'dm', 'it', 'can', 'annihilate', 'andor', 'decay', 'to', 'neutrino', 'and', 'antineutrino', 'pair', 'the', 'proposed', '50', 'kt', 'magnetized', 'iron', 'calorimeter', 'magical', 'detector', 'at', 'the', 'indiabased', 'neutrino', 'observatory', 'ino', 'can', 'observe', 'these', 'pairs', 'over', 'the', 'conventional', 'atmospheric', 'neutrino', 'and', 'antineutrino', 'fluxes', 'if', 'we', 'do', 'not', 'see', 'any', 'excess', 'of', 'events', 'in', 'ten', 'years', 'then', 'inomagical', 'can', 'place', 'competitive', 'limits', 'on', 'selfannihilation', 'crosssection', 'langlesigma', 'vrangle', 'and', 'decay', 'lifetime', 'tau', 'of', 'dark', 'matter', 'at', '90', 'cl', 'langlesigma', 'vrangleleq', '187times1024', 'cm3', 's1', 'and', 'taugeq', '48times1024', 's', 'for', 'm_chi', '10', 'gev', 'assuming', 'the', 'nfw', 'as', 'dm', 'density', 'profile']] | [-0.05765415770137339, 0.3011173902585813, -0.030086948662923958, 0.2122139111036905, -0.05603121137879427, -0.14396118498814192, 0.004768087558032384, 0.3353224902865036, -0.14103052811245026, -0.41962294223564633, -0.02027713336181619, -0.38314723062500794, 0.12227351561604628, 0.1857246162598157, 0.12345997175400697, -0.00018862241119580361, 0.07078186315439135, 0.05336899341997302, -0.07403545991011254, -0.27625899243810514, 0.19110208799954034, 0.1135147367287608, 0.20239486859080572, 0.09507037658081616, 0.12241245988864922, -0.04030975092256677, -0.027271315360496057, -0.13387883761083907, -0.13962681704987456, -0.030670544417412245, 0.22333567536173804, 0.10956918351460719, 0.022907834703518638, -0.39863442084345135, -0.17218732316661806, 0.24010348480502233, 0.18975418020781237, -0.051851155747234534, -0.044514375275398775, -0.3630213662439469, 0.09265141062736873, -0.29716970785114083, -0.1049580637679788, 0.06452218007671566, -0.0010359570818039977, -0.0426427122427024, -0.2701625289255301, 0.11761445073790631, -0.04850415009281878, -0.09743664509535414, -0.026714123369565287, -0.20012198527822794, -0.013841866520097822, -0.09867143964630018, 0.0951910102265227, -0.018822949693890884, 0.2862744565750246, -0.15136290344441292, -0.03679166503196347, 0.38003218262591987, -0.16220752708387823, -0.06869052007830548, 0.18587433681958943, -0.18964768348948904, -0.12804911591257284, 0.25063329672856816, 0.16121959253847237, 0.04006494636968393, -0.18981925998497934, 0.12680153153357504, -0.10031683073103319, 0.22539131021470699, 0.08746623274535664, 0.004822702237486261, 0.37067138461522686, 0.23296052414146298, 0.13558302538071587, -0.11664653439255594, -0.24802889594880556, 0.023373910693849607, -0.3472020772457557, -0.14538366040124476, -0.0453838350260359, 0.10581646016779134, -0.04029542006025525, -0.05810455925021212, 0.3219416300558205, 0.08048316195733773, 0.18150645825397044, -0.00467149976830821, 0.2840876407306461, 0.040210162668072987, 0.017157278032702148, 0.061768610405654296, 0.33957878001106595, 0.14146050570749688, 0.12033330544137658, -0.17250429502534634, -0.004199754652449662, 0.014313102349440016] |
1,803.02869 | Computing Bottleneck Distance for Multi-parameter Interval Decomposable
Persistence Modules | Computation of the interleaving distance between persistence modules is a
central task in topological data analysis. For $1$-parameter persistence
modules, thanks to the isometry theorem, this can be done by computing the
bottleneck distance with known efficient algorithms. The question is open for
most $n$-parameter persistence modules, $n>1$, because of the well recognized
complications of the indecomposables. Here, we consider a reasonably
complicated class called {\em $n$-parameter interval decomposable} modules
whose indecomposables may have a description of non-constant complexity. We
present a polynomial time algorithm to compute the bottleneck distance for
these modules from indecomposables, which bounds the interleaving distance from
above, and give another algorithm to compute a new distance called {\em
dimension distance} that bounds it from below. An earlier version of this paper
considered only the $2$-parameter interval decomposable
modules~\cite{DeyCheng18}.
| cs.CG | computation of the interleaving distance between persistence modules is a central task in topological data analysis for 1parameter persistence modules thanks to the isometry theorem this can be done by computing the bottleneck distance with known efficient algorithms the question is open for most nparameter persistence modules n1 because of the well recognized complications of the indecomposables here we consider a reasonably complicated class called em nparameter interval decomposable modules whose indecomposables may have a description of nonconstant complexity we present a polynomial time algorithm to compute the bottleneck distance for these modules from indecomposables which bounds the interleaving distance from above and give another algorithm to compute a new distance called em dimension distance that bounds it from below an earlier version of this paper considered only the 2parameter interval decomposable modulescitedeycheng18 | [['computation', 'of', 'the', 'interleaving', 'distance', 'between', 'persistence', 'modules', 'is', 'a', 'central', 'task', 'in', 'topological', 'data', 'analysis', 'for', '1parameter', 'persistence', 'modules', 'thanks', 'to', 'the', 'isometry', 'theorem', 'this', 'can', 'be', 'done', 'by', 'computing', 'the', 'bottleneck', 'distance', 'with', 'known', 'efficient', 'algorithms', 'the', 'question', 'is', 'open', 'for', 'most', 'nparameter', 'persistence', 'modules', 'n1', 'because', 'of', 'the', 'well', 'recognized', 'complications', 'of', 'the', 'indecomposables', 'here', 'we', 'consider', 'a', 'reasonably', 'complicated', 'class', 'called', 'em', 'nparameter', 'interval', 'decomposable', 'modules', 'whose', 'indecomposables', 'may', 'have', 'a', 'description', 'of', 'nonconstant', 'complexity', 'we', 'present', 'a', 'polynomial', 'time', 'algorithm', 'to', 'compute', 'the', 'bottleneck', 'distance', 'for', 'these', 'modules', 'from', 'indecomposables', 'which', 'bounds', 'the', 'interleaving', 'distance', 'from', 'above', 'and', 'give', 'another', 'algorithm', 'to', 'compute', 'a', 'new', 'distance', 'called', 'em', 'dimension', 'distance', 'that', 'bounds', 'it', 'from', 'below', 'an', 'earlier', 'version', 'of', 'this', 'paper', 'considered', 'only', 'the', '2parameter', 'interval', 'decomposable', 'modulescitedeycheng18']] | [-0.15743413178786408, 0.07223267285746371, -0.07679945813971713, 0.1173924750112223, -0.08743661589511303, -0.18331547461407768, 0.03561514859426428, 0.36675200264223595, -0.367362183985251, -0.27157322467996203, 0.13020855513009752, -0.1973531500605697, -0.15854930895147845, 0.2051979975605553, -0.11635084610382117, 0.021596182925295027, 0.10064011950497374, 0.07534666468078892, -0.07287700810367383, -0.25718072221339255, 0.3168875748983048, 0.05582696916606052, 0.21483190493502966, 0.025701335190343812, 0.10871336959164844, 0.019793894201883988, -0.030631496802071168, 0.0279964629426655, -0.1785174163050573, 0.16035543251817932, 0.300430178762216, 0.14275294274380995, 0.24087813111360779, -0.3323433619560533, -0.13669526297246304, 0.17928418542600633, 0.16347872581558698, 0.07825579031046029, 0.0059087144309711275, -0.25056323433069116, 0.0985469985629827, -0.17690552038733254, -0.10969775865404782, -0.04608520267312556, 0.06970725732389838, -0.02397204897098356, -0.22326656194248548, 0.038299414085816934, 0.0816898851798297, 0.06178729270697769, -0.021175503473249122, -0.10227699742200926, 0.024773173478685996, 0.10572893785887794, -0.015332156930746736, 0.049261124190789735, 0.08186042824209752, -0.06436170884196392, -0.17420400647361847, 0.3190741920808443, -0.0196131713843594, -0.19582933780144562, 0.16499706726718807, -0.07086924204221842, -0.14267013268192497, 0.11849521971872133, 0.12222019922796101, 0.12103456034850696, -0.14505087613890116, 0.14220253381283715, -0.07338314936637427, 0.12310167892649064, 0.09928151732310653, 0.05722867698976629, 0.13528832696575785, 0.13184637431351637, 0.1218144483105844, 0.17747067784181458, -0.016305839575855345, -0.05483903714004114, -0.3100258156121003, -0.17434632171044182, -0.1807064081341113, 0.06157571410806144, -0.09670471989849114, -0.21964069366786684, 0.38882567071017216, 0.1258124693157504, 0.2086898178271385, 0.16786460170017867, 0.2749652829599764, 0.0624887318011712, 0.11210485272617503, 0.12219247755296458, 0.16518554720272677, 0.1562214897130616, 0.023679535433819347, -0.11614321664356711, 0.06521045691051493, 0.190012456761024] |
1,803.0287 | Speech Enhancement Based on Non-stationary Noise-driven Geometric
Spectral Subtraction and Phase Spectrum Compensation | In this paper, a speech enhancement method based on noise compensation
performed on short time magnitude as well phase spectra is presented. Unlike
the conventional geometric approach (GA) to spectral subtraction (SS), here the
noise estimate to be subtracted from the noisy speech spectrum is proposed to
be determined by exploiting the low frequency regions of current frame of noisy
speech rather than depending only on the initial silence frames. This approach
gives the capability of tracking non-stationary noise thus resulting in a
non-stationary noise-driven geometric approach of spectral subtraction for
speech enhancement. The noise compensated magnitude spectrum from the GA step
is then recombined with unchanged phase of noisy speech spectrum and used in
phase compensation to obtain an enhanced complex spectrum, which is used to
produce an enhanced speech frame. Extensive simulations are carried out using
speech files available in the NOIZEUS database shows that the proposed method
consistently outperforms some of the recent methods of speech enhancement when
employed on the noisy speeches corrupted by street or babble noise at different
levels of SNR in terms of objective measures, spectrogram analysis and formal
subjective listening tests.
| eess.AS cs.SD | in this paper a speech enhancement method based on noise compensation performed on short time magnitude as well phase spectra is presented unlike the conventional geometric approach ga to spectral subtraction ss here the noise estimate to be subtracted from the noisy speech spectrum is proposed to be determined by exploiting the low frequency regions of current frame of noisy speech rather than depending only on the initial silence frames this approach gives the capability of tracking nonstationary noise thus resulting in a nonstationary noisedriven geometric approach of spectral subtraction for speech enhancement the noise compensated magnitude spectrum from the ga step is then recombined with unchanged phase of noisy speech spectrum and used in phase compensation to obtain an enhanced complex spectrum which is used to produce an enhanced speech frame extensive simulations are carried out using speech files available in the noizeus database shows that the proposed method consistently outperforms some of the recent methods of speech enhancement when employed on the noisy speeches corrupted by street or babble noise at different levels of snr in terms of objective measures spectrogram analysis and formal subjective listening tests | [['in', 'this', 'paper', 'a', 'speech', 'enhancement', 'method', 'based', 'on', 'noise', 'compensation', 'performed', 'on', 'short', 'time', 'magnitude', 'as', 'well', 'phase', 'spectra', 'is', 'presented', 'unlike', 'the', 'conventional', 'geometric', 'approach', 'ga', 'to', 'spectral', 'subtraction', 'ss', 'here', 'the', 'noise', 'estimate', 'to', 'be', 'subtracted', 'from', 'the', 'noisy', 'speech', 'spectrum', 'is', 'proposed', 'to', 'be', 'determined', 'by', 'exploiting', 'the', 'low', 'frequency', 'regions', 'of', 'current', 'frame', 'of', 'noisy', 'speech', 'rather', 'than', 'depending', 'only', 'on', 'the', 'initial', 'silence', 'frames', 'this', 'approach', 'gives', 'the', 'capability', 'of', 'tracking', 'nonstationary', 'noise', 'thus', 'resulting', 'in', 'a', 'nonstationary', 'noisedriven', 'geometric', 'approach', 'of', 'spectral', 'subtraction', 'for', 'speech', 'enhancement', 'the', 'noise', 'compensated', 'magnitude', 'spectrum', 'from', 'the', 'ga', 'step', 'is', 'then', 'recombined', 'with', 'unchanged', 'phase', 'of', 'noisy', 'speech', 'spectrum', 'and', 'used', 'in', 'phase', 'compensation', 'to', 'obtain', 'an', 'enhanced', 'complex', 'spectrum', 'which', 'is', 'used', 'to', 'produce', 'an', 'enhanced', 'speech', 'frame', 'extensive', 'simulations', 'are', 'carried', 'out', 'using', 'speech', 'files', 'available', 'in', 'the', 'noizeus', 'database', 'shows', 'that', 'the', 'proposed', 'method', 'consistently', 'outperforms', 'some', 'of', 'the', 'recent', 'methods', 'of', 'speech', 'enhancement', 'when', 'employed', 'on', 'the', 'noisy', 'speeches', 'corrupted', 'by', 'street', 'or', 'babble', 'noise', 'at', 'different', 'levels', 'of', 'snr', 'in', 'terms', 'of', 'objective', 'measures', 'spectrogram', 'analysis', 'and', 'formal', 'subjective', 'listening', 'tests']] | [-0.06995225561753152, 0.03083300062534695, -0.09784069614763317, 0.04491417282802994, -0.03723834626002129, -0.15067856676048702, 0.03671556054897823, 0.42317452159508195, -0.23828623837559784, -0.30223978465304724, 0.08786016887499798, -0.2647810001714677, -0.1637604183966427, 0.2204597682067533, -0.14335892493614838, 0.04597374861080584, 0.0917657500862208, 0.05755016351520286, -0.06421088055884909, -0.22880851251206227, 0.26304652197680695, 0.09473700071167615, 0.33339949924666334, -0.044691346493357466, 0.09888604914747356, -0.022159145129893823, -0.10088978375359955, -0.03808866892374618, -0.01921720073759961, 0.07570648104415606, 0.29325694369433064, 0.1395722877667852, 0.23711044537938303, -0.37704798861322975, -0.22480245457873457, 0.09577433354093166, 0.15151441878905253, 0.10986629748044328, -0.04118899075146863, -0.3917657525608779, 0.09843224898305913, -0.1383746472327778, 0.018598256744789304, -0.08394901267691422, -0.035580769718363485, -0.017361815853744113, -0.30158611526959156, 0.12012150923342065, 0.077608529646467, 0.10062739043927717, -0.045687615954737235, -0.1256701154412613, 0.01794715954555031, 0.14615979167727, 0.05989887220070515, 0.0378991572935351, 0.16752629868671418, -0.11372746237634962, -0.08600105575893183, 0.3687627980505269, -0.1318327899408316, -0.20023839887051115, 0.17414400475493894, -0.0932965395471978, -0.08018232812543237, 0.215749251056295, 0.18787439501100273, 0.08494964586053458, -0.16643702910534566, 0.0033359830620361087, 0.04354363248718006, 0.25097874719551, 0.09397125014297358, 0.06282723914812166, 0.13471000764036067, 0.16337674989231996, 0.008262444110143752, 0.16217488359792956, -0.13880468103492621, -0.023483106657516496, -0.23082800498281522, -0.0421376151929575, -0.24185504761238696, -0.011751235176306513, -0.0871667226543342, -0.14263125607576319, 0.4279062710948801, 0.20174981429359862, 0.1742523463502053, 0.03753856272207543, 0.38468029429869993, 0.12367528738643697, 0.017961357142431317, 0.015283628620660652, 0.20889831355371927, 0.057760433463882356, 0.14021525340199115, -0.22623536422868412, 0.06505163392192492, 0.01516107594035073] |
1,803.02871 | Higgs Vacuum Decay from Particle Collisions? | We examine the effect of large extra dimensions on black hole seeded vacuum
decay using the Randall-Sundrum model as a prototype for warped extra
dimensions. We model the braneworld black hole by a tidal solution, and solve
the Higgs equations of motion for the instanton on the brane. Remarkably, the
action of the static instanton can be shown to be the difference in the bulk
areas of the seed and remnant black holes, and we estimate these areas assuming
the black holes are small compared to the bulk AdS radius. Comparing to the
Hawking evaporation rate shows that small black hole seeds preferentially
catalyse vacuum decay, thus extending our previous results to higher
dimensional braneworld scenarios. The parameter ranges do not allow for
Standard Model Higgs decay from collider black holes, but they can be relevant
for cosmic ray collisions.
| hep-th hep-ph | we examine the effect of large extra dimensions on black hole seeded vacuum decay using the randallsundrum model as a prototype for warped extra dimensions we model the braneworld black hole by a tidal solution and solve the higgs equations of motion for the instanton on the brane remarkably the action of the static instanton can be shown to be the difference in the bulk areas of the seed and remnant black holes and we estimate these areas assuming the black holes are small compared to the bulk ads radius comparing to the hawking evaporation rate shows that small black hole seeds preferentially catalyse vacuum decay thus extending our previous results to higher dimensional braneworld scenarios the parameter ranges do not allow for standard model higgs decay from collider black holes but they can be relevant for cosmic ray collisions | [['we', 'examine', 'the', 'effect', 'of', 'large', 'extra', 'dimensions', 'on', 'black', 'hole', 'seeded', 'vacuum', 'decay', 'using', 'the', 'randallsundrum', 'model', 'as', 'a', 'prototype', 'for', 'warped', 'extra', 'dimensions', 'we', 'model', 'the', 'braneworld', 'black', 'hole', 'by', 'a', 'tidal', 'solution', 'and', 'solve', 'the', 'higgs', 'equations', 'of', 'motion', 'for', 'the', 'instanton', 'on', 'the', 'brane', 'remarkably', 'the', 'action', 'of', 'the', 'static', 'instanton', 'can', 'be', 'shown', 'to', 'be', 'the', 'difference', 'in', 'the', 'bulk', 'areas', 'of', 'the', 'seed', 'and', 'remnant', 'black', 'holes', 'and', 'we', 'estimate', 'these', 'areas', 'assuming', 'the', 'black', 'holes', 'are', 'small', 'compared', 'to', 'the', 'bulk', 'ads', 'radius', 'comparing', 'to', 'the', 'hawking', 'evaporation', 'rate', 'shows', 'that', 'small', 'black', 'hole', 'seeds', 'preferentially', 'catalyse', 'vacuum', 'decay', 'thus', 'extending', 'our', 'previous', 'results', 'to', 'higher', 'dimensional', 'braneworld', 'scenarios', 'the', 'parameter', 'ranges', 'do', 'not', 'allow', 'for', 'standard', 'model', 'higgs', 'decay', 'from', 'collider', 'black', 'holes', 'but', 'they', 'can', 'be', 'relevant', 'for', 'cosmic', 'ray', 'collisions']] | [-0.09545040358539804, 0.14791718380459185, -0.044050801239375555, 0.17977696904313883, -0.0836332946683147, -0.1463723312381522, -0.009963630939767296, 0.29669871012946325, -0.15664716915427043, -0.3015133379692478, 0.09205778575602121, -0.31903039688976215, -0.03888644002269887, 0.1938575187922522, -0.04074677248219294, 0.042731743794865905, 0.013819208947409477, 0.012614040726995361, -0.051470025504905995, -0.273772909181259, 0.3689796350297651, 0.11631190089974552, 0.23574560300580094, 0.009348079128332236, 0.06848277932897742, -0.0543793462848823, 0.03010092549957335, 0.06012130730918475, -0.1720810076873022, 0.06980287180236441, 0.17049660212194015, 0.09903139442072383, 0.1359476998381849, -0.4295082579899047, -0.26817954896417046, 0.07563536777493678, 0.2015256227626066, 0.20847184381979916, -0.10610622862919367, -0.2910930287159447, 0.12406983953634543, -0.2606947427698677, -0.1232829029172925, -0.023980414807530385, 0.011405716470575759, -0.08614698389179207, -0.2527795624120959, 0.11563692828972957, 0.020037997953061548, -0.11890657745035631, -0.12984975828772544, -0.06953262414483885, -0.06358203259463023, 0.07647622911193008, 0.2024364356176063, 0.0023639817855187826, 0.22600838849653623, -0.12981503981515874, -0.12681226788221725, 0.3458899786230177, -0.09154516237821164, -0.18744813846798414, 0.18835991520401357, -0.24852133040382926, -0.05498058791106034, 0.13098972765562525, 0.1893460364679673, 0.20526192571435656, -0.12291677590858724, 0.16535110200345246, 0.018289736874534616, 0.1913066784718207, 0.13299994683891003, 0.06262541879966323, 0.38379314282709465, 0.1221025301010481, -0.006380288292919951, 0.14587269983021542, -0.0745875853878845, -0.08646605287379186, -0.3409831649058365, -0.14462025259687963, -0.11657162879626932, 0.1047480720778237, -0.1941977662064476, -0.1592419758678131, 0.314973049956773, 0.0982464480226294, 0.2092193315770211, -0.004982771185625877, 0.22588637615967205, 0.05005394001491368, 0.07874912900130897, 0.07864174186116933, 0.35230989335104823, 0.07540728606150619, 0.13175862898185317, -0.24302785326560428, -0.05310554467474243, 0.11520718417596072] |
1,803.02872 | The nested structural organization of the worldwide trade multi-layer
network | Nestedness has traditionally been used to detect assembly patterns in
meta-communities and networks of interacting species. Attempts have also been
made to uncover nested structures in international trade, typically represented
as bipartite networks in which connections can be established between countries
(exporters or importers) and industries. A bipartite representation of trade,
however, inevitably neglects transactions between industries. To fully capture
the organization of the global value chain, we draw on the World Input-Output
Database and construct a multi-layer network in which the nodes are the
countries, the layers are the industries, and links can be established from
sellers to buyers within and across industries. We define the buyers' and
sellers' participation matrices in which the rows are the countries and the
columns are all possible pairs of industries, and then compute nestedness based
on buyers' and sellers' involvement in transactions between and within
industries. Drawing on appropriate null models that preserve the countries' or
layers' degree distributions in the original multi-layer network, we uncover
variations of country- and transaction-based nestedness over time, and identify
the countries and industries that most contributed to nestedness. We discuss
the implications of our findings for the study of the international production
network and other real-world systems.
| physics.soc-ph q-fin.GN | nestedness has traditionally been used to detect assembly patterns in metacommunities and networks of interacting species attempts have also been made to uncover nested structures in international trade typically represented as bipartite networks in which connections can be established between countries exporters or importers and industries a bipartite representation of trade however inevitably neglects transactions between industries to fully capture the organization of the global value chain we draw on the world inputoutput database and construct a multilayer network in which the nodes are the countries the layers are the industries and links can be established from sellers to buyers within and across industries we define the buyers and sellers participation matrices in which the rows are the countries and the columns are all possible pairs of industries and then compute nestedness based on buyers and sellers involvement in transactions between and within industries drawing on appropriate null models that preserve the countries or layers degree distributions in the original multilayer network we uncover variations of country and transactionbased nestedness over time and identify the countries and industries that most contributed to nestedness we discuss the implications of our findings for the study of the international production network and other realworld systems | [['nestedness', 'has', 'traditionally', 'been', 'used', 'to', 'detect', 'assembly', 'patterns', 'in', 'metacommunities', 'and', 'networks', 'of', 'interacting', 'species', 'attempts', 'have', 'also', 'been', 'made', 'to', 'uncover', 'nested', 'structures', 'in', 'international', 'trade', 'typically', 'represented', 'as', 'bipartite', 'networks', 'in', 'which', 'connections', 'can', 'be', 'established', 'between', 'countries', 'exporters', 'or', 'importers', 'and', 'industries', 'a', 'bipartite', 'representation', 'of', 'trade', 'however', 'inevitably', 'neglects', 'transactions', 'between', 'industries', 'to', 'fully', 'capture', 'the', 'organization', 'of', 'the', 'global', 'value', 'chain', 'we', 'draw', 'on', 'the', 'world', 'inputoutput', 'database', 'and', 'construct', 'a', 'multilayer', 'network', 'in', 'which', 'the', 'nodes', 'are', 'the', 'countries', 'the', 'layers', 'are', 'the', 'industries', 'and', 'links', 'can', 'be', 'established', 'from', 'sellers', 'to', 'buyers', 'within', 'and', 'across', 'industries', 'we', 'define', 'the', 'buyers', 'and', 'sellers', 'participation', 'matrices', 'in', 'which', 'the', 'rows', 'are', 'the', 'countries', 'and', 'the', 'columns', 'are', 'all', 'possible', 'pairs', 'of', 'industries', 'and', 'then', 'compute', 'nestedness', 'based', 'on', 'buyers', 'and', 'sellers', 'involvement', 'in', 'transactions', 'between', 'and', 'within', 'industries', 'drawing', 'on', 'appropriate', 'null', 'models', 'that', 'preserve', 'the', 'countries', 'or', 'layers', 'degree', 'distributions', 'in', 'the', 'original', 'multilayer', 'network', 'we', 'uncover', 'variations', 'of', 'country', 'and', 'transactionbased', 'nestedness', 'over', 'time', 'and', 'identify', 'the', 'countries', 'and', 'industries', 'that', 'most', 'contributed', 'to', 'nestedness', 'we', 'discuss', 'the', 'implications', 'of', 'our', 'findings', 'for', 'the', 'study', 'of', 'the', 'international', 'production', 'network', 'and', 'other', 'realworld', 'systems']] | [-0.09975014116380497, 0.07413015156836793, -0.03402231741433797, 0.08840357840503796, -0.05788059461410019, -0.12196284755234524, 0.11095275760785041, 0.4139401517983637, -0.2785118668700919, -0.30542362050964766, 0.09191639551092953, -0.34880180162663504, -0.19073393732991697, 0.10110875339729085, -0.07875919293169634, -0.005462849604330108, 0.044238363648534264, 0.010772239603563258, 0.017517666289488334, -0.31347707589156926, 0.3192946566868168, 0.030589691884262433, 0.3429593380337747, 0.08213987275447303, 0.0738710891962928, -0.03349977417613868, -0.06347231297681136, 0.023444985079297813, -0.08360082080098166, 0.1822478740757313, 0.35100996759017405, 0.1605563282962003, 0.2887211955903965, -0.4817250917047852, -0.17587014414038105, 0.15379135462911891, 0.1008853149591106, 0.019166128823301976, 0.05769407223635768, -0.2758195122132207, 0.04273696803478616, -0.23105321100535214, -0.05036330881204668, -0.08848786892802778, 0.03862156868320982, 0.06769852650940815, -0.2556027177684378, 0.01961489145210045, -0.02035653227386941, 0.07907073266486093, -0.0037963655569802713, -0.1161629410857095, -0.08492539940162165, 0.22615167081107082, 0.09297466865454865, -0.08393266685376184, 0.1423469442426974, -0.1525731661615174, -0.1695828679709875, 0.351867925366479, 0.023717420798090128, -0.14517319443091603, 0.20689060921679334, -0.11173921493158703, -0.16306531726437998, 0.01281370026506668, 0.24447803743792199, 0.007840914086964313, -0.19159852905604657, 0.04368559274036382, -0.05809136755801368, 0.16935674702670278, 0.12291176616713304, 0.002066441230697207, 0.2154391198004089, 0.15585392000848694, 0.0999031978633974, 0.10287630161423798, -0.02279129822762674, -0.16279309305926037, -0.1671635684647164, -0.1515888582522022, -0.13855246715259156, -0.0036964868933036187, -0.09978915394372007, -0.17124748928530031, 0.4063222221292482, 0.13515641782787677, 0.1706114946080759, 0.03635588048776902, 0.2367499917826274, 0.011129460060083777, 0.13665971373949007, 0.12048886750714097, 0.20098642878335818, 0.07488513283119168, 0.15194233934715445, -0.09932790487880201, 0.1863986002189098, 0.003586681585039685] |
1,803.02873 | Ultrafast lattice deformations studied by means of time-resolved
electron and x-ray diffraction | Ultrafast lattice deformation of tens to hundreds of nanometer thick metallic
crystals, after femtosecond laser excitation, was measured directly using 8.04
keV subpicosecond x-ray and 59 keV femtosecond electron pulses. Coherent
phonons were generated in both single crystal and polycrystalline films.
Lattice compression was observed within the first few picoseconds after laser
irradiation in single crystal aluminum, which was attributed to the generation
of a blast force and the propagation of elastic waves. The different time scale
of lattice heating for tens and hundreds nanometer thick films are clearly
distinguished by electron and x-ray pulse diffraction. The electron and lattice
heating due to ultrafast deposition of photon energy was numerically simulated
using the two-temperature model (TTM) and the results agreed with experimental
observations. The ultrafast heating described by TTM was also discussed from an
electrical circuit perspective, which may provide new insights on the possible
connection between thermal and electrical processes. This study demonstrates
that the combination of two complimentary ultrafast time-resolved methods,
ultrafast x-ray and electron diffraction will provide a panoramic picture of
the transient atomic motions and structure in crystals.
| cond-mat.mtrl-sci | ultrafast lattice deformation of tens to hundreds of nanometer thick metallic crystals after femtosecond laser excitation was measured directly using 804 kev subpicosecond xray and 59 kev femtosecond electron pulses coherent phonons were generated in both single crystal and polycrystalline films lattice compression was observed within the first few picoseconds after laser irradiation in single crystal aluminum which was attributed to the generation of a blast force and the propagation of elastic waves the different time scale of lattice heating for tens and hundreds nanometer thick films are clearly distinguished by electron and xray pulse diffraction the electron and lattice heating due to ultrafast deposition of photon energy was numerically simulated using the twotemperature model ttm and the results agreed with experimental observations the ultrafast heating described by ttm was also discussed from an electrical circuit perspective which may provide new insights on the possible connection between thermal and electrical processes this study demonstrates that the combination of two complimentary ultrafast timeresolved methods ultrafast xray and electron diffraction will provide a panoramic picture of the transient atomic motions and structure in crystals | [['ultrafast', 'lattice', 'deformation', 'of', 'tens', 'to', 'hundreds', 'of', 'nanometer', 'thick', 'metallic', 'crystals', 'after', 'femtosecond', 'laser', 'excitation', 'was', 'measured', 'directly', 'using', '804', 'kev', 'subpicosecond', 'xray', 'and', '59', 'kev', 'femtosecond', 'electron', 'pulses', 'coherent', 'phonons', 'were', 'generated', 'in', 'both', 'single', 'crystal', 'and', 'polycrystalline', 'films', 'lattice', 'compression', 'was', 'observed', 'within', 'the', 'first', 'few', 'picoseconds', 'after', 'laser', 'irradiation', 'in', 'single', 'crystal', 'aluminum', 'which', 'was', 'attributed', 'to', 'the', 'generation', 'of', 'a', 'blast', 'force', 'and', 'the', 'propagation', 'of', 'elastic', 'waves', 'the', 'different', 'time', 'scale', 'of', 'lattice', 'heating', 'for', 'tens', 'and', 'hundreds', 'nanometer', 'thick', 'films', 'are', 'clearly', 'distinguished', 'by', 'electron', 'and', 'xray', 'pulse', 'diffraction', 'the', 'electron', 'and', 'lattice', 'heating', 'due', 'to', 'ultrafast', 'deposition', 'of', 'photon', 'energy', 'was', 'numerically', 'simulated', 'using', 'the', 'twotemperature', 'model', 'ttm', 'and', 'the', 'results', 'agreed', 'with', 'experimental', 'observations', 'the', 'ultrafast', 'heating', 'described', 'by', 'ttm', 'was', 'also', 'discussed', 'from', 'an', 'electrical', 'circuit', 'perspective', 'which', 'may', 'provide', 'new', 'insights', 'on', 'the', 'possible', 'connection', 'between', 'thermal', 'and', 'electrical', 'processes', 'this', 'study', 'demonstrates', 'that', 'the', 'combination', 'of', 'two', 'complimentary', 'ultrafast', 'timeresolved', 'methods', 'ultrafast', 'xray', 'and', 'electron', 'diffraction', 'will', 'provide', 'a', 'panoramic', 'picture', 'of', 'the', 'transient', 'atomic', 'motions', 'and', 'structure', 'in', 'crystals']] | [-0.05443117536948533, 0.25067147019053465, -0.05493247181760495, 0.017753844668162516, -0.0326295773189126, -0.11767409334968582, 0.05751748419760798, 0.5118831418823082, -0.2908346047829632, -0.3244399193502901, 0.04120321314114115, -0.322347280412022, -0.02730390706334959, 0.27770985229386036, 0.06812198028086101, 0.09292783708284273, 0.020414699303948288, -0.14320136433701378, -0.036726195768486444, -0.17022520302830693, 0.1958789229444177, 0.11518163298455625, 0.3125679655880718, 0.09780424000800249, 0.128275828842831, 0.00506178429222328, 0.02606727749334423, -0.04940486548034791, -0.13182487585320385, 0.07008581887163058, 0.2280987636621141, -0.05654429694046625, 0.19672291439185227, -0.547002672596456, -0.29054523033222984, -0.0662949549464079, 0.1277692274468411, 0.10133506625033288, -0.08740123741170085, -0.24226002112174264, 0.019840853439725855, -0.11637225997337437, -0.10443090687884571, -0.06000706231078276, -0.026090191851196053, 0.05926478000237494, -0.19669952786528852, 0.07914749229090816, 0.010697286153867185, 0.0887779034520653, -0.13800015618671552, -0.009254915455540458, -0.014630632986734202, -0.008011506036292393, 0.010654760438918167, 0.05345693125727249, 0.23899927569500806, -0.072609048742279, -0.148617017441071, 0.3924302729256042, -0.03948550133781692, 0.016350311104331043, 0.15808260745808975, -0.22086524858781018, -0.02248998710714219, 0.2574359396175778, 0.09819445369002706, 0.12239099265546999, -0.18837582533632194, -0.030573975666421966, -0.017460238726446302, 0.2723695409092745, 0.16051373175207198, 0.06646371563796752, 0.23160252667154993, 0.24500971798309135, -0.06529172380444603, 0.1507389555719763, -0.18966143368103716, 0.012317094598464402, -0.22584734382721913, -0.09063966192847507, -0.17774173148375536, 0.12920132475766957, -0.0665300963719946, -0.12531621401725276, 0.42137112192666304, 0.1116663758328906, 0.11974076599721889, -0.09478808304289826, 0.28663987413580927, 0.07363436943697897, 0.04447321058123035, -0.03553478587367623, 0.2716294176477407, 0.16173158311105978, 0.12090330081480136, -0.286184243129945, 0.02775955041499481, -0.018795094809720067] |
1,803.02874 | Entanglement in a dephasing model and many-body localization | We study entanglement dynamics in a diagonal dephasing model in which the
strength of interaction decays exponentially with distance -- the so-called
l-bit model of many-body localization. We calculate the exact expression for
entanglement growth with time, finding in addition to a logarithmic growth, a
sublogarithmic correction. Provided the l-bit picture correctly describes the
many-body localized phase this implies that the entanglement in such systems
does not grow (just) as a logarithm of time, as believed so far.
| cond-mat.dis-nn cond-mat.str-el quant-ph | we study entanglement dynamics in a diagonal dephasing model in which the strength of interaction decays exponentially with distance the socalled lbit model of manybody localization we calculate the exact expression for entanglement growth with time finding in addition to a logarithmic growth a sublogarithmic correction provided the lbit picture correctly describes the manybody localized phase this implies that the entanglement in such systems does not grow just as a logarithm of time as believed so far | [['we', 'study', 'entanglement', 'dynamics', 'in', 'a', 'diagonal', 'dephasing', 'model', 'in', 'which', 'the', 'strength', 'of', 'interaction', 'decays', 'exponentially', 'with', 'distance', 'the', 'socalled', 'lbit', 'model', 'of', 'manybody', 'localization', 'we', 'calculate', 'the', 'exact', 'expression', 'for', 'entanglement', 'growth', 'with', 'time', 'finding', 'in', 'addition', 'to', 'a', 'logarithmic', 'growth', 'a', 'sublogarithmic', 'correction', 'provided', 'the', 'lbit', 'picture', 'correctly', 'describes', 'the', 'manybody', 'localized', 'phase', 'this', 'implies', 'that', 'the', 'entanglement', 'in', 'such', 'systems', 'does', 'not', 'grow', 'just', 'as', 'a', 'logarithm', 'of', 'time', 'as', 'believed', 'so', 'far']] | [-0.16195962713523346, 0.1736273438996309, -0.1002661394463344, 0.11712665059271135, 0.043274731278516256, -0.15684999759284804, 0.03145879001829882, 0.289219787283861, -0.2637410314342418, -0.24246491699830278, 0.053039164119097704, -0.28575736990609724, -0.17071382682044783, 0.14320843444846862, 0.012609151077106015, 0.07784712914522592, 0.02370970698629881, 0.07792163498748045, -0.08207675036611398, -0.20343842610184634, 0.25315391319477326, 0.06942237183064609, 0.2642592849367141, 0.0930266946043166, 0.026992789862750024, 0.021894284759877952, 0.032581086258416055, 0.02058018245069044, -0.14506243285770276, 0.05871969768656539, 0.21886230817793373, 0.09843964784031177, 0.26872670025770345, -0.41081268212141153, -0.20257546180593117, 0.11779700022481092, 0.22294107125467294, 0.204035165464179, -0.03412140538166096, -0.2491619498650362, -0.0043901551224581606, -0.199805663565972, -0.1639456380545706, -0.06804691724382438, 0.04929811596967183, -0.03359487712800551, -0.25743119905448775, 0.1258468452187908, 0.08367977091776473, -0.009960459327542937, -0.04050460472315937, 0.010481576483648319, 0.015022192050569825, 0.14092109031225372, 0.03770464026465915, 0.05649168398412695, 0.10915624024951226, -0.1375496606856536, -0.10442640402584107, 0.35984095881463257, -0.0899287809877862, -0.16094133584433562, 0.18549006817826105, -0.1869519834781622, -0.10091710164417307, 0.11862941841026406, 0.1461648124258046, 0.10268926843637963, -0.13432362371701867, 0.11230837034859828, 0.004007528862589365, 0.20979381154303428, 0.019548816473356316, 0.12491700443281949, 0.1406751579133334, 0.13592451183101187, 0.06034029981532654, 0.17248462616502272, -0.03534523492025864, -0.17561679493103707, -0.3305677030622572, -0.15298687936224092, -0.2568625085926675, 0.11270881517712396, -0.08393757473435495, -0.2358620350442633, 0.405412106296991, 0.13099670671410374, 0.22982359482217338, 0.11054565799089947, 0.25397755515265774, 0.1256013233547232, 0.10693071800126851, 0.08766443900425326, 0.2552894343948596, 0.08730096604626675, 0.060250721508999926, -0.29173967619607977, 0.11653822249817578, 0.11297713974853615] |
1,803.02875 | Machine Learning Inverse Problem for Topological Photonics | Topological concepts open many new horizons for photonic devices, from
integrated optics to lasers. The complexity of large scale topological devices
asks for an effective solution of the inverse problem: how best to engineer the
topology for a specific application? We introduce a novel machine learning
approach to the topological inverse problem. We train a neural network system
with the band structure of the Aubry-Andre-Harper model and then adopt the
network for solving the inverse problem. Our application is able to identify
the parameters of a complex topological insulator in order to obtain protected
edge states at target frequencies. One challenging aspect is handling the
multivalued branches of the direct problem and discarding unphysical solutions.
We overcome this problem by adopting a self-consistent method to only select
physically relevant solutions. We demonstrate our technique in a realistic
topological laser design and by resorting to the widely available open-source
TensorFlow library. Our results are general and scalable to thousands of
topological components. This new inverse design technique based on machine
learning potentially extends the applications of topological photonics, for
example, to frequency combs, quantum sources, neuromorphic computing and
metrology.
| physics.optics | topological concepts open many new horizons for photonic devices from integrated optics to lasers the complexity of large scale topological devices asks for an effective solution of the inverse problem how best to engineer the topology for a specific application we introduce a novel machine learning approach to the topological inverse problem we train a neural network system with the band structure of the aubryandreharper model and then adopt the network for solving the inverse problem our application is able to identify the parameters of a complex topological insulator in order to obtain protected edge states at target frequencies one challenging aspect is handling the multivalued branches of the direct problem and discarding unphysical solutions we overcome this problem by adopting a selfconsistent method to only select physically relevant solutions we demonstrate our technique in a realistic topological laser design and by resorting to the widely available opensource tensorflow library our results are general and scalable to thousands of topological components this new inverse design technique based on machine learning potentially extends the applications of topological photonics for example to frequency combs quantum sources neuromorphic computing and metrology | [['topological', 'concepts', 'open', 'many', 'new', 'horizons', 'for', 'photonic', 'devices', 'from', 'integrated', 'optics', 'to', 'lasers', 'the', 'complexity', 'of', 'large', 'scale', 'topological', 'devices', 'asks', 'for', 'an', 'effective', 'solution', 'of', 'the', 'inverse', 'problem', 'how', 'best', 'to', 'engineer', 'the', 'topology', 'for', 'a', 'specific', 'application', 'we', 'introduce', 'a', 'novel', 'machine', 'learning', 'approach', 'to', 'the', 'topological', 'inverse', 'problem', 'we', 'train', 'a', 'neural', 'network', 'system', 'with', 'the', 'band', 'structure', 'of', 'the', 'aubryandreharper', 'model', 'and', 'then', 'adopt', 'the', 'network', 'for', 'solving', 'the', 'inverse', 'problem', 'our', 'application', 'is', 'able', 'to', 'identify', 'the', 'parameters', 'of', 'a', 'complex', 'topological', 'insulator', 'in', 'order', 'to', 'obtain', 'protected', 'edge', 'states', 'at', 'target', 'frequencies', 'one', 'challenging', 'aspect', 'is', 'handling', 'the', 'multivalued', 'branches', 'of', 'the', 'direct', 'problem', 'and', 'discarding', 'unphysical', 'solutions', 'we', 'overcome', 'this', 'problem', 'by', 'adopting', 'a', 'selfconsistent', 'method', 'to', 'only', 'select', 'physically', 'relevant', 'solutions', 'we', 'demonstrate', 'our', 'technique', 'in', 'a', 'realistic', 'topological', 'laser', 'design', 'and', 'by', 'resorting', 'to', 'the', 'widely', 'available', 'opensource', 'tensorflow', 'library', 'our', 'results', 'are', 'general', 'and', 'scalable', 'to', 'thousands', 'of', 'topological', 'components', 'this', 'new', 'inverse', 'design', 'technique', 'based', 'on', 'machine', 'learning', 'potentially', 'extends', 'the', 'applications', 'of', 'topological', 'photonics', 'for', 'example', 'to', 'frequency', 'combs', 'quantum', 'sources', 'neuromorphic', 'computing', 'and', 'metrology']] | [-0.09817960461046785, 0.06071542504194324, -0.06119083026064897, 0.06485729290301258, -0.14339124758608957, -0.18839908374518038, 0.056106470939529904, 0.38996091099614477, -0.31744570750464496, -0.31877154710286476, 0.09575202100925108, -0.2527885495070764, -0.1935424175125205, 0.2516553333274366, -0.05961658668511131, 0.149610937278262, 0.04228759986940434, -0.037101365000435566, -0.046862138351029224, -0.1909705334506493, 0.32448803154662487, 0.011380470899661923, 0.3264910593192945, 0.04271333890550948, 0.11703728058405141, -0.0197466441982505, 0.026820540259730942, -0.01886832943443764, -0.11871099814232637, 0.1889739928874212, 0.3275219009337115, 0.11127133230416184, 0.29263626620237854, -0.4186632909237387, -0.23605240436077013, 0.06563716353493293, 0.1219748816752628, 0.1591232720269584, -0.06760092640840237, -0.3076721039263809, 0.107874407160512, -0.16936839684507154, -0.1129381332874355, -0.12013793425594872, 0.00608562907709324, -0.05363049861935384, -0.24619932772692024, -0.02144778934582954, 0.011852648027459198, 0.025015619499212566, -0.059618946944612346, -0.06853356413379748, 0.05654842649373484, 0.11292799976604813, -0.02837128889997133, 0.01642308746987181, 0.12388540558923195, -0.15083770160166982, -0.18054111879269413, 0.37291009914367756, -0.008582605992102045, -0.18886770162746272, 0.1957026421466466, -0.017975998544530507, -0.129626678891153, 0.08952722100954641, 0.21979448838813348, 0.12820112421251637, -0.14520715536181864, 0.08532523661647537, 0.011707792868540484, 0.1831586376851811, 0.01741584802561618, 0.052430036518923404, 0.21478925569805296, 0.22912710548893728, 0.10117956689626884, 0.1877609787550953, -0.05517400610582665, -0.05944569963228671, -0.25196377620190147, -0.1559403226710856, -0.21569377354821784, 0.03146531160653351, -0.07594765039748187, -0.20834627238249634, 0.4312746215839573, 0.22705189533108422, 0.14886458424177576, 0.02241805784077324, 0.334567325843617, 0.10780741529417859, 0.09487490824725915, 0.0869741974388586, 0.19110414662963135, 0.10457526834587508, 0.1234864847037317, -0.20282407540907252, -0.01593489789755698, 0.050454778243797495] |
1,803.02876 | Optimizing cluster-based randomized experiments under a monotonicity
assumption | Cluster-based randomized experiments are popular designs for mitigating the
bias of standard estimators when interference is present and classical causal
inference and experimental design assumptions (such as SUTVA or ITR) do not
hold. Without an exact knowledge of the interference structure, it can be
challenging to understand which partitioning of the experimental units is
optimal to minimize the estimation bias. In the paper, we introduce a
monotonicity condition under which a novel two-stage experimental design allows
us to determine which of two cluster-based designs yields the least biased
estimator. We then consider the setting of online advertising auctions and show
that reserve price experiments verify the monotonicity condition and the
proposed framework and methodology applies. We validate our findings on an
advertising auction dataset.
| stat.ME | clusterbased randomized experiments are popular designs for mitigating the bias of standard estimators when interference is present and classical causal inference and experimental design assumptions such as sutva or itr do not hold without an exact knowledge of the interference structure it can be challenging to understand which partitioning of the experimental units is optimal to minimize the estimation bias in the paper we introduce a monotonicity condition under which a novel twostage experimental design allows us to determine which of two clusterbased designs yields the least biased estimator we then consider the setting of online advertising auctions and show that reserve price experiments verify the monotonicity condition and the proposed framework and methodology applies we validate our findings on an advertising auction dataset | [['clusterbased', 'randomized', 'experiments', 'are', 'popular', 'designs', 'for', 'mitigating', 'the', 'bias', 'of', 'standard', 'estimators', 'when', 'interference', 'is', 'present', 'and', 'classical', 'causal', 'inference', 'and', 'experimental', 'design', 'assumptions', 'such', 'as', 'sutva', 'or', 'itr', 'do', 'not', 'hold', 'without', 'an', 'exact', 'knowledge', 'of', 'the', 'interference', 'structure', 'it', 'can', 'be', 'challenging', 'to', 'understand', 'which', 'partitioning', 'of', 'the', 'experimental', 'units', 'is', 'optimal', 'to', 'minimize', 'the', 'estimation', 'bias', 'in', 'the', 'paper', 'we', 'introduce', 'a', 'monotonicity', 'condition', 'under', 'which', 'a', 'novel', 'twostage', 'experimental', 'design', 'allows', 'us', 'to', 'determine', 'which', 'of', 'two', 'clusterbased', 'designs', 'yields', 'the', 'least', 'biased', 'estimator', 'we', 'then', 'consider', 'the', 'setting', 'of', 'online', 'advertising', 'auctions', 'and', 'show', 'that', 'reserve', 'price', 'experiments', 'verify', 'the', 'monotonicity', 'condition', 'and', 'the', 'proposed', 'framework', 'and', 'methodology', 'applies', 'we', 'validate', 'our', 'findings', 'on', 'an', 'advertising', 'auction', 'dataset']] | [-0.09129510236333215, -0.0074280169245602955, -0.09040065123248965, 0.10271073427640894, -0.15596956945955753, -0.20817102836595186, 0.09725882384021045, 0.4125952666264869, -0.24545409748961608, -0.31741877254323975, 0.12520955303578726, -0.24523427539268947, -0.20432572727159207, 0.19063892528591228, -0.13696531883831467, 0.07958866284518022, 0.07847570270795616, -0.011249324949007601, -0.0181915344005721, -0.2904425391987447, 0.2878538036959306, 0.09253675036222464, 0.3587715935803229, 0.06353200770184142, 0.10028548076027824, 0.028045408254969987, -0.02354808383050465, 0.024373722600660497, -0.1705715740046153, 0.10649298788836947, 0.28340408540961726, 0.18709782790392637, 0.3404497753682306, -0.40235663722119025, -0.16888465205275063, 0.1267275041675255, 0.09780975333940718, 0.09077859820230984, -0.05922505529240645, -0.2532140839856208, 0.09187472068832346, -0.1668864588681308, -0.034374587322329925, -0.1221878385549644, -0.12053611894859181, -0.005627627876463286, -0.40687319411635176, 0.04517613925535472, 0.058933816089730466, 0.007796441813209845, -0.052447808644032076, -0.11971971939783543, 0.06294404953951016, 0.12644691593807017, 0.040665532450094036, -0.05534969209768479, 0.1259784151315539, -0.07982762672397639, -0.19607837445237825, 0.363336518226612, -0.002005335818525524, -0.20618820562958717, 0.1369870829141526, -0.06233151102318398, -0.1316521162159681, 0.043606880241103714, 0.220129931345582, 0.1003490708986177, -0.1812115641783279, 0.03639322194043592, -0.07785161242129342, 0.1667687004242438, 0.024690791773008963, 0.001725422139579971, 0.11804897318624201, 0.18336248107868502, 0.1479862907154095, 0.1543266816663691, -0.08040042137238948, -0.10306921205107844, -0.2781159557972945, -0.1469998549427762, -0.1651824689958425, 0.008633998504416424, -0.1126828541928262, -0.16459340692322696, 0.3643284780499075, 0.23813946490812551, 0.14992364985312545, 0.10764826582125088, 0.3499661139963615, 0.07073452796471576, 0.034432723014164834, 0.08665590516231474, 0.19433243851733184, 0.03365900858695949, 0.05547075621378157, -0.21721971999279283, 0.14595243223049048, -0.009692232851164355] |
1,803.02877 | Distributed Base Station: A Concept System for Long-Range Broadband
Wireless Access | We propose a concept system termed distributed base station (DBS), which
enables distributed transmit beamforming at large carrier wavelengths to
achieve significant range extension and/or increased downlink data rate,
providing a low-cost infrastructure for applications such as rural broadband.
We consider a frequency division duplexed (FDD) system, using feedback from the
receiver to achieve the required phase coherence. At a given range, $N$
cooperating transmitters can achieve $N^2$-fold increase in received power
compared to that for a single transmitters, and feedback-based algorithms with
near-ideal performance have been prototyped. In this paper, however, we
identify and address key technical issues in translating such power gains into
range extension via a DBS. First, to combat the drop in per-node SNR with
extended range, we design a feedback-based adaptation strategy that is suitably
robust to noise. Second, to utilize available system bandwidth, we extend
narrowband adaptation algorithms to wideband channels through interpolation
over OFDM subcarriers. Third, we observe that the feedback channel may become a
bottleneck unless sophisticated distributed reception strategies are employed,
but show that acceptable performance can still be obtained with standard uplink
reception if channel time variations are slow enough. We quantify system
performance compactly via outage capacity analyses.
| cs.IT math.IT | we propose a concept system termed distributed base station dbs which enables distributed transmit beamforming at large carrier wavelengths to achieve significant range extension andor increased downlink data rate providing a lowcost infrastructure for applications such as rural broadband we consider a frequency division duplexed fdd system using feedback from the receiver to achieve the required phase coherence at a given range n cooperating transmitters can achieve n2fold increase in received power compared to that for a single transmitters and feedbackbased algorithms with nearideal performance have been prototyped in this paper however we identify and address key technical issues in translating such power gains into range extension via a dbs first to combat the drop in pernode snr with extended range we design a feedbackbased adaptation strategy that is suitably robust to noise second to utilize available system bandwidth we extend narrowband adaptation algorithms to wideband channels through interpolation over ofdm subcarriers third we observe that the feedback channel may become a bottleneck unless sophisticated distributed reception strategies are employed but show that acceptable performance can still be obtained with standard uplink reception if channel time variations are slow enough we quantify system performance compactly via outage capacity analyses | [['we', 'propose', 'a', 'concept', 'system', 'termed', 'distributed', 'base', 'station', 'dbs', 'which', 'enables', 'distributed', 'transmit', 'beamforming', 'at', 'large', 'carrier', 'wavelengths', 'to', 'achieve', 'significant', 'range', 'extension', 'andor', 'increased', 'downlink', 'data', 'rate', 'providing', 'a', 'lowcost', 'infrastructure', 'for', 'applications', 'such', 'as', 'rural', 'broadband', 'we', 'consider', 'a', 'frequency', 'division', 'duplexed', 'fdd', 'system', 'using', 'feedback', 'from', 'the', 'receiver', 'to', 'achieve', 'the', 'required', 'phase', 'coherence', 'at', 'a', 'given', 'range', 'n', 'cooperating', 'transmitters', 'can', 'achieve', 'n2fold', 'increase', 'in', 'received', 'power', 'compared', 'to', 'that', 'for', 'a', 'single', 'transmitters', 'and', 'feedbackbased', 'algorithms', 'with', 'nearideal', 'performance', 'have', 'been', 'prototyped', 'in', 'this', 'paper', 'however', 'we', 'identify', 'and', 'address', 'key', 'technical', 'issues', 'in', 'translating', 'such', 'power', 'gains', 'into', 'range', 'extension', 'via', 'a', 'dbs', 'first', 'to', 'combat', 'the', 'drop', 'in', 'pernode', 'snr', 'with', 'extended', 'range', 'we', 'design', 'a', 'feedbackbased', 'adaptation', 'strategy', 'that', 'is', 'suitably', 'robust', 'to', 'noise', 'second', 'to', 'utilize', 'available', 'system', 'bandwidth', 'we', 'extend', 'narrowband', 'adaptation', 'algorithms', 'to', 'wideband', 'channels', 'through', 'interpolation', 'over', 'ofdm', 'subcarriers', 'third', 'we', 'observe', 'that', 'the', 'feedback', 'channel', 'may', 'become', 'a', 'bottleneck', 'unless', 'sophisticated', 'distributed', 'reception', 'strategies', 'are', 'employed', 'but', 'show', 'that', 'acceptable', 'performance', 'can', 'still', 'be', 'obtained', 'with', 'standard', 'uplink', 'reception', 'if', 'channel', 'time', 'variations', 'are', 'slow', 'enough', 'we', 'quantify', 'system', 'performance', 'compactly', 'via', 'outage', 'capacity', 'analyses']] | [-0.20655466773753153, 0.0397902054597516, -0.022958969441125517, 0.0027572740028476597, -0.09593303037231704, -0.25617265133140377, 0.13170659835228052, 0.4523606514558196, -0.2693626363717848, -0.27596099980540534, 0.11572453058874656, -0.2033785343446287, -0.14474027297089823, 0.17520300828355678, -0.16097287320761225, 0.05171592818133196, 0.06972543347683084, -0.010382055242934344, -0.024655245431264787, -0.23740627112489512, 0.22300590962597436, 0.1238528394079463, 0.3584854981333167, 0.002869760285332874, 0.10402199510021612, -0.010389744898482184, -0.00962350215182532, -0.04516034926891552, -0.0728713323284074, 0.049143948716558424, 0.3795623602474286, 0.17181763919561766, 0.31127479879288517, -0.4047426538045832, -0.277402214306973, 0.1352760377445319, 0.22002736538831125, 0.08053532897340586, -0.07558863072120234, -0.24255501547472635, 0.14541746221421914, -0.26362532609839684, -0.034238351139254004, -0.04618981722028617, -0.0788026296079683, 0.056014897775297064, -0.3664174334019722, 0.01601604394727017, -0.017691222537512513, 0.044188114234138674, -0.03577058924123383, -0.10203534389036385, 0.07797077712813515, 0.16236894014970066, -0.0112540794404261, -0.013211994422552872, 0.12136647967977365, -0.048437052139024904, -0.09819014378096731, 0.347418730535624, -0.04410983508817814, -0.2069112787201027, 0.17681257278660203, -0.0966803669033282, -0.07759882179299492, 0.18714841647569708, 0.27689298974050575, 0.03187239854255792, -0.1776206443576498, 0.009821796304799017, 0.04365256746725446, 0.2504440128122311, 0.10738571465422572, 0.14770152912142887, 0.155490275268237, 0.211003313285659, 0.1449923261698223, 0.14177581071022935, -0.1195011477257551, -0.08655849988917451, -0.189877595515552, -0.08537994094553343, -0.18979203527390806, 0.015965158089377623, -0.046494441191009456, -0.05873416289780757, 0.3411194718403077, 0.16775064162960296, 0.12272522647879157, 0.12545648720595123, 0.41082098870655176, 0.0986897377619033, 0.08251319519927416, 0.13368357135212264, 0.19991075977959188, 0.06933645116418001, 0.17366488529638335, -0.20096208236719032, 0.02903323176775558, -0.05156781149550748] |
1,803.02878 | A Faraday Rotation Study of the Stellar Bubble and HII Region Associated
with the W4 Complex | We utilized the Very Large Array to make multifrequency polarization
measurements of 20 radio sources viewed through the IC 1805 HII region and
"Superbubble", as well as in the immediate vicinity. The measurements at
frequencies between 4.33 and 7.76 GHz yield Faraday rotation measures along 27
lines of sight to these sources (some sources have more than one component).
The Faraday rotation measures (RM) are used to probe the plasma structure of
the IC 1805 HII region and to test the degree to which the Galactic magnetic
field is heavily modified (amplified) by the dynamics of the HII region. We
find that similar to the Rosette Nebula (Savage et al. 2013, Costa et al. 2016)
and the Cygnus OB1 association (Whiting et al. 2009), IC 1805 constitutes a
"Faraday rotation anomaly", or a region of increased RM relative to the general
Galactic background value. Although the RM observed on lines of sight through
the region vary substantially, the |RM| due to the nebula is commonly 600 --
800 rad m^-2. In spite of this, the observed RMs are not as large as simple,
analytic models of magnetic field amplification in HII regions might indicate.
This suggests that the Galactic field is not increased by a substantial factor
within the ionized gas in an HII region. We also find that with one exception,
the sign of the RM for all sources is that expected for the polarity of the
Galactic field in this direction. The same behavior was found for the Rosette
Nebula, and qualitatively indicates that turbulent fluctuations in the Galactic
field on spatial scales of $\sim 10$ pc are smaller than the mean Galactic
field. Finally, our results show intriguing indications that some of the
largest values of |RM| occur for lines of sight that pass outside the fully
ionized shell of the IC 1805 HII region, but pass through the Photodissociation
Region (PDR) associated with IC 1805.
| astro-ph.GA | we utilized the very large array to make multifrequency polarization measurements of 20 radio sources viewed through the ic 1805 hii region and superbubble as well as in the immediate vicinity the measurements at frequencies between 433 and 776 ghz yield faraday rotation measures along 27 lines of sight to these sources some sources have more than one component the faraday rotation measures rm are used to probe the plasma structure of the ic 1805 hii region and to test the degree to which the galactic magnetic field is heavily modified amplified by the dynamics of the hii region we find that similar to the rosette nebula savage et al 2013 costa et al 2016 and the cygnus ob1 association whiting et al 2009 ic 1805 constitutes a faraday rotation anomaly or a region of increased rm relative to the general galactic background value although the rm observed on lines of sight through the region vary substantially the rm due to the nebula is commonly 600 800 rad m2 in spite of this the observed rms are not as large as simple analytic models of magnetic field amplification in hii regions might indicate this suggests that the galactic field is not increased by a substantial factor within the ionized gas in an hii region we also find that with one exception the sign of the rm for all sources is that expected for the polarity of the galactic field in this direction the same behavior was found for the rosette nebula and qualitatively indicates that turbulent fluctuations in the galactic field on spatial scales of sim 10 pc are smaller than the mean galactic field finally our results show intriguing indications that some of the largest values of rm occur for lines of sight that pass outside the fully ionized shell of the ic 1805 hii region but pass through the photodissociation region pdr associated with ic 1805 | [['we', 'utilized', 'the', 'very', 'large', 'array', 'to', 'make', 'multifrequency', 'polarization', 'measurements', 'of', '20', 'radio', 'sources', 'viewed', 'through', 'the', 'ic', '1805', 'hii', 'region', 'and', 'superbubble', 'as', 'well', 'as', 'in', 'the', 'immediate', 'vicinity', 'the', 'measurements', 'at', 'frequencies', 'between', '433', 'and', '776', 'ghz', 'yield', 'faraday', 'rotation', 'measures', 'along', '27', 'lines', 'of', 'sight', 'to', 'these', 'sources', 'some', 'sources', 'have', 'more', 'than', 'one', 'component', 'the', 'faraday', 'rotation', 'measures', 'rm', 'are', 'used', 'to', 'probe', 'the', 'plasma', 'structure', 'of', 'the', 'ic', '1805', 'hii', 'region', 'and', 'to', 'test', 'the', 'degree', 'to', 'which', 'the', 'galactic', 'magnetic', 'field', 'is', 'heavily', 'modified', 'amplified', 'by', 'the', 'dynamics', 'of', 'the', 'hii', 'region', 'we', 'find', 'that', 'similar', 'to', 'the', 'rosette', 'nebula', 'savage', 'et', 'al', '2013', 'costa', 'et', 'al', '2016', 'and', 'the', 'cygnus', 'ob1', 'association', 'whiting', 'et', 'al', '2009', 'ic', '1805', 'constitutes', 'a', 'faraday', 'rotation', 'anomaly', 'or', 'a', 'region', 'of', 'increased', 'rm', 'relative', 'to', 'the', 'general', 'galactic', 'background', 'value', 'although', 'the', 'rm', 'observed', 'on', 'lines', 'of', 'sight', 'through', 'the', 'region', 'vary', 'substantially', 'the', 'rm', 'due', 'to', 'the', 'nebula', 'is', 'commonly', '600', '800', 'rad', 'm2', 'in', 'spite', 'of', 'this', 'the', 'observed', 'rms', 'are', 'not', 'as', 'large', 'as', 'simple', 'analytic', 'models', 'of', 'magnetic', 'field', 'amplification', 'in', 'hii', 'regions', 'might', 'indicate', 'this', 'suggests', 'that', 'the', 'galactic', 'field', 'is', 'not', 'increased', 'by', 'a', 'substantial', 'factor', 'within', 'the', 'ionized', 'gas', 'in', 'an', 'hii', 'region', 'we', 'also', 'find', 'that', 'with', 'one', 'exception', 'the', 'sign', 'of', 'the', 'rm', 'for', 'all', 'sources', 'is', 'that', 'expected', 'for', 'the', 'polarity', 'of', 'the', 'galactic', 'field', 'in', 'this', 'direction', 'the', 'same', 'behavior', 'was', 'found', 'for', 'the', 'rosette', 'nebula', 'and', 'qualitatively', 'indicates', 'that', 'turbulent', 'fluctuations', 'in', 'the', 'galactic', 'field', 'on', 'spatial', 'scales', 'of', 'sim', '10', 'pc', 'are', 'smaller', 'than', 'the', 'mean', 'galactic', 'field', 'finally', 'our', 'results', 'show', 'intriguing', 'indications', 'that', 'some', 'of', 'the', 'largest', 'values', 'of', 'rm', 'occur', 'for', 'lines', 'of', 'sight', 'that', 'pass', 'outside', 'the', 'fully', 'ionized', 'shell', 'of', 'the', 'ic', '1805', 'hii', 'region', 'but', 'pass', 'through', 'the', 'photodissociation', 'region', 'pdr', 'associated', 'with', 'ic', '1805']] | [-0.09125095130213091, 0.08020361661864335, -0.0013138705572778206, 0.05926246218765506, -0.07874922118583144, -0.04321144125863628, 0.04272744571643665, 0.40603532321727687, -0.19124520288300026, -0.34072592578617467, 0.04898502289884249, -0.26516691647300134, -0.03822524764255837, 0.21803448886102442, -0.023273987530836097, -0.0921865649445022, -0.0024411739681191365, -0.048216351782742, 0.004864204538409135, -0.19651377440125276, 0.26975746819772906, 0.12441453641813553, 0.22691869141560328, 0.004738536078714233, 0.07046960176733094, -0.12705322506079017, -0.027470834813528817, 0.006427164640535349, -0.1189654311125173, 0.05525056639965917, 0.22491888436957627, 0.10672411961120747, 0.1868924342407757, -0.3515280358897487, -0.24184280479694395, 0.06013874614716701, 0.2156338662849212, 0.04974599861841555, -0.020931820174521377, -0.3067213216527078, 0.08020593118253486, -0.16312771146929766, -0.19125559809873957, 0.09765865640940273, 0.06167215887316555, 0.007633812042427654, -0.23098234686090424, 0.1376640121737142, 0.00729460502201241, 0.10855984472839525, -0.07174674848331807, -0.130469828582319, -0.03491838390165764, 0.05010423359443557, 0.024422026661066513, 0.12411821006691821, 0.19803967514169057, -0.12073737421693902, -0.05535277127655832, 0.366691734026766, -0.03642418827455558, -0.029849713766338222, 0.19741223627809762, -0.24885792634815984, -0.15073552582729258, 0.19247981327594663, 0.1279409687509233, 0.1040131938658397, -0.10354127908149681, 0.02267892193030888, -0.06671743375855445, 0.19018981417691563, 0.06434407166671008, 0.043520584965524495, 0.23217968716514562, 0.05317785108312613, 0.039366287169773015, 0.12637806845424, -0.2545917369544275, -0.07740987124160933, -0.27182971634323644, -0.10486532251516052, -0.09488350238523639, 0.061630615390600704, -0.13043456613619733, -0.1114906092480399, 0.3246857182901798, 0.11360139198126798, 0.2276531248060553, -0.043086517226601125, 0.2766355723135302, 0.06898646236327037, 0.09887742235928586, 0.17929881992592453, 0.34275056447327845, 0.1962978818516815, 0.09973629445471631, -0.2314719083043893, 0.07834737757279438, -0.02189735473578784] |
1,803.02879 | Deep Models of Interactions Across Sets | We use deep learning to model interactions across two or more sets of
objects, such as user-movie ratings, protein-drug bindings, or ternary
user-item-tag interactions. The canonical representation of such interactions
is a matrix (or a higher-dimensional tensor) with an exchangeability property:
the encoding's meaning is not changed by permuting rows or columns. We argue
that models should hence be Permutation Equivariant (PE): constrained to make
the same predictions across such permutations. We present a parameter-sharing
scheme and prove that it could not be made any more expressive without
violating PE. This scheme yields three benefits. First, we demonstrate
state-of-the-art performance on multiple matrix completion benchmarks. Second,
our models require a number of parameters independent of the numbers of
objects, and thus scale well to large datasets. Third, models can be queried
about new objects that were not available at training time, but for which
interactions have since been observed. In experiments, our models achieved
surprisingly good generalization performance on this matrix extrapolation task,
both within domains (e.g., new users and new movies drawn from the same
distribution used for training) and even across domains (e.g., predicting music
ratings after training on movies).
| stat.ML cs.LG | we use deep learning to model interactions across two or more sets of objects such as usermovie ratings proteindrug bindings or ternary useritemtag interactions the canonical representation of such interactions is a matrix or a higherdimensional tensor with an exchangeability property the encodings meaning is not changed by permuting rows or columns we argue that models should hence be permutation equivariant pe constrained to make the same predictions across such permutations we present a parametersharing scheme and prove that it could not be made any more expressive without violating pe this scheme yields three benefits first we demonstrate stateoftheart performance on multiple matrix completion benchmarks second our models require a number of parameters independent of the numbers of objects and thus scale well to large datasets third models can be queried about new objects that were not available at training time but for which interactions have since been observed in experiments our models achieved surprisingly good generalization performance on this matrix extrapolation task both within domains eg new users and new movies drawn from the same distribution used for training and even across domains eg predicting music ratings after training on movies | [['we', 'use', 'deep', 'learning', 'to', 'model', 'interactions', 'across', 'two', 'or', 'more', 'sets', 'of', 'objects', 'such', 'as', 'usermovie', 'ratings', 'proteindrug', 'bindings', 'or', 'ternary', 'useritemtag', 'interactions', 'the', 'canonical', 'representation', 'of', 'such', 'interactions', 'is', 'a', 'matrix', 'or', 'a', 'higherdimensional', 'tensor', 'with', 'an', 'exchangeability', 'property', 'the', 'encodings', 'meaning', 'is', 'not', 'changed', 'by', 'permuting', 'rows', 'or', 'columns', 'we', 'argue', 'that', 'models', 'should', 'hence', 'be', 'permutation', 'equivariant', 'pe', 'constrained', 'to', 'make', 'the', 'same', 'predictions', 'across', 'such', 'permutations', 'we', 'present', 'a', 'parametersharing', 'scheme', 'and', 'prove', 'that', 'it', 'could', 'not', 'be', 'made', 'any', 'more', 'expressive', 'without', 'violating', 'pe', 'this', 'scheme', 'yields', 'three', 'benefits', 'first', 'we', 'demonstrate', 'stateoftheart', 'performance', 'on', 'multiple', 'matrix', 'completion', 'benchmarks', 'second', 'our', 'models', 'require', 'a', 'number', 'of', 'parameters', 'independent', 'of', 'the', 'numbers', 'of', 'objects', 'and', 'thus', 'scale', 'well', 'to', 'large', 'datasets', 'third', 'models', 'can', 'be', 'queried', 'about', 'new', 'objects', 'that', 'were', 'not', 'available', 'at', 'training', 'time', 'but', 'for', 'which', 'interactions', 'have', 'since', 'been', 'observed', 'in', 'experiments', 'our', 'models', 'achieved', 'surprisingly', 'good', 'generalization', 'performance', 'on', 'this', 'matrix', 'extrapolation', 'task', 'both', 'within', 'domains', 'eg', 'new', 'users', 'and', 'new', 'movies', 'drawn', 'from', 'the', 'same', 'distribution', 'used', 'for', 'training', 'and', 'even', 'across', 'domains', 'eg', 'predicting', 'music', 'ratings', 'after', 'training', 'on', 'movies']] | [-0.06631458140085063, 0.08931336466844186, -0.05639214562082392, 0.09296247119830998, -0.10988383805912842, -0.17153861036664844, 0.05113525122154291, 0.42754186169380165, -0.2760187335370574, -0.3472281358141724, 0.0834121288589813, -0.28033023242945393, -0.1365896154262979, 0.19116678898035389, -0.08173710060630886, 0.03416828118012442, 0.12209928288393712, 0.04719942353646426, -0.09048194441371986, -0.3004526958106908, 0.29474312672027736, 0.02216041217964933, 0.2808437291920806, 0.023433193661427747, 0.08999222216759033, -0.017210942233456688, -0.025469241598329972, 0.03855502174277111, -0.021734336589171715, 0.10505115497774871, 0.2783525614611335, 0.18760538759818246, 0.24791414170370749, -0.43156765626432997, -0.21405589918807286, 0.1329112257080851, 0.14080937229224824, 0.10920765362372246, -0.02925841150757454, -0.2940199955094916, 0.08569565739518718, -0.1947257143292518, -0.017109255012352758, -0.14376194701738618, 0.0071083013575806335, 0.008687191424542107, -0.3051801551124906, 0.02405106786985319, 0.06475446789227135, 0.07364261082489065, -0.02439186431244404, -0.14968671929091215, 0.013114271087639887, 0.16480085459867647, 0.039313005455066254, -0.014037851669854717, 0.10755671591080802, -0.15226455049135743, -0.1355271982041207, 0.38986985668695223, -0.04538055168814026, -0.22043904836512715, 0.2067314685494542, -0.08944364399333911, -0.15874113566921247, 0.09333550331454414, 0.17789474947494455, 0.12845577083498938, -0.12573490132247875, 0.018226411199672537, -0.07128827630367596, 0.22901686277570357, 0.06844382158305962, 0.011205734219402075, 0.19562358750408748, 0.1621545620728284, 0.01379647486586085, 0.09697542671650201, -0.037523447263083654, -0.055225580495365044, -0.2373326242671586, -0.11820400527115756, -0.19577430059143808, 0.027504450895245707, -0.10962946305486791, -0.15785380105565613, 0.3623322296129648, 0.19734766617087493, 0.21781232146440743, 0.10649239829414607, 0.28448406084013794, 0.019917589700222987, 0.15338236464594956, 0.07585343959696426, 0.16398542674627, 0.03273140628637824, 0.07854830990496946, -0.10926878565881755, 0.1077729045561379, 0.046360782793878265] |
1,803.0288 | Observational implications of lowering the LIGO-Virgo alert threshold | The recent detection of the binary-neutron-star merger associated with
GW170817 by both LIGO-Virgo and the network of electromagnetic-spectrum
observing facilities around the world has made the multi-messenger detection of
gravitational-wave events a reality. These joint detections allow us to probe
gravitational-wave sources in greater detail and provide us with the
possibility of confidently establishing events that would not have been
detected in gravitational-wave data alone. In this paper, we explore the
prospects of using the electromagnetic follow-up of low-significance
gravitational-wave event candidates to increase the sample of confident
detections with electromagnetic counterparts. We find that the
gravitational-wave alert threshold change that would roughly double the number
of detectable astrophysical events would increase the false-alarm rate by more
than 5 orders of magnitude from 1 per 100 years to more than 1000 per year. We
find that the localization costs of following-up low-significance candidates
are marginal, as the same changes to false-alarm rate only increase
distance/area localizations by less than a factor of 2 and increase volume
localization by less than a factor of 4. We argue that EM follow-up thresholds
for low-significance candidates should be set on the basis of alert purity
($P_\text{astro}$) and not false-alarm rate. Ideally, such estimates of
$P_\text{astro}$ would be provided by LIGO-Virgo, but in their absence we
provide estimates of the average purity of the gravitational-wave candidate
alerts issued by LIGO-Virgo as a function of false-alarm rate for various
LIGO-Virgo observing epochs.
| astro-ph.HE | the recent detection of the binaryneutronstar merger associated with gw170817 by both ligovirgo and the network of electromagneticspectrum observing facilities around the world has made the multimessenger detection of gravitationalwave events a reality these joint detections allow us to probe gravitationalwave sources in greater detail and provide us with the possibility of confidently establishing events that would not have been detected in gravitationalwave data alone in this paper we explore the prospects of using the electromagnetic followup of lowsignificance gravitationalwave event candidates to increase the sample of confident detections with electromagnetic counterparts we find that the gravitationalwave alert threshold change that would roughly double the number of detectable astrophysical events would increase the falsealarm rate by more than 5 orders of magnitude from 1 per 100 years to more than 1000 per year we find that the localization costs of followingup lowsignificance candidates are marginal as the same changes to falsealarm rate only increase distancearea localizations by less than a factor of 2 and increase volume localization by less than a factor of 4 we argue that em followup thresholds for lowsignificance candidates should be set on the basis of alert purity p_textastro and not falsealarm rate ideally such estimates of p_textastro would be provided by ligovirgo but in their absence we provide estimates of the average purity of the gravitationalwave candidate alerts issued by ligovirgo as a function of falsealarm rate for various ligovirgo observing epochs | [['the', 'recent', 'detection', 'of', 'the', 'binaryneutronstar', 'merger', 'associated', 'with', 'gw170817', 'by', 'both', 'ligovirgo', 'and', 'the', 'network', 'of', 'electromagneticspectrum', 'observing', 'facilities', 'around', 'the', 'world', 'has', 'made', 'the', 'multimessenger', 'detection', 'of', 'gravitationalwave', 'events', 'a', 'reality', 'these', 'joint', 'detections', 'allow', 'us', 'to', 'probe', 'gravitationalwave', 'sources', 'in', 'greater', 'detail', 'and', 'provide', 'us', 'with', 'the', 'possibility', 'of', 'confidently', 'establishing', 'events', 'that', 'would', 'not', 'have', 'been', 'detected', 'in', 'gravitationalwave', 'data', 'alone', 'in', 'this', 'paper', 'we', 'explore', 'the', 'prospects', 'of', 'using', 'the', 'electromagnetic', 'followup', 'of', 'lowsignificance', 'gravitationalwave', 'event', 'candidates', 'to', 'increase', 'the', 'sample', 'of', 'confident', 'detections', 'with', 'electromagnetic', 'counterparts', 'we', 'find', 'that', 'the', 'gravitationalwave', 'alert', 'threshold', 'change', 'that', 'would', 'roughly', 'double', 'the', 'number', 'of', 'detectable', 'astrophysical', 'events', 'would', 'increase', 'the', 'falsealarm', 'rate', 'by', 'more', 'than', '5', 'orders', 'of', 'magnitude', 'from', '1', 'per', '100', 'years', 'to', 'more', 'than', '1000', 'per', 'year', 'we', 'find', 'that', 'the', 'localization', 'costs', 'of', 'followingup', 'lowsignificance', 'candidates', 'are', 'marginal', 'as', 'the', 'same', 'changes', 'to', 'falsealarm', 'rate', 'only', 'increase', 'distancearea', 'localizations', 'by', 'less', 'than', 'a', 'factor', 'of', '2', 'and', 'increase', 'volume', 'localization', 'by', 'less', 'than', 'a', 'factor', 'of', '4', 'we', 'argue', 'that', 'em', 'followup', 'thresholds', 'for', 'lowsignificance', 'candidates', 'should', 'be', 'set', 'on', 'the', 'basis', 'of', 'alert', 'purity', 'p_textastro', 'and', 'not', 'falsealarm', 'rate', 'ideally', 'such', 'estimates', 'of', 'p_textastro', 'would', 'be', 'provided', 'by', 'ligovirgo', 'but', 'in', 'their', 'absence', 'we', 'provide', 'estimates', 'of', 'the', 'average', 'purity', 'of', 'the', 'gravitationalwave', 'candidate', 'alerts', 'issued', 'by', 'ligovirgo', 'as', 'a', 'function', 'of', 'falsealarm', 'rate', 'for', 'various', 'ligovirgo', 'observing', 'epochs']] | [-0.11383936936315549, 0.11652570033182147, -0.007395510695666842, 0.10743462040274936, -0.08620883546002177, -0.06940379767986454, 0.1160817405467757, 0.36052316813349977, -0.14069387287325166, -0.39865595425275263, 0.1208944254656734, -0.34522326137119097, -0.08777150595480727, 0.25577193851554725, -0.004982611897917137, 0.020295284684475653, 0.1304206788348026, 0.033431023906150936, -0.08656287733605332, -0.2944286068893425, 0.24377530425299326, 0.18466866201053617, 0.18841542612987094, -0.03172295550613908, 0.061118642901981754, 0.005921617196273266, -0.10132964710003492, -0.027955355498911774, -0.10631132937042576, 0.08062598269506854, 0.28770347284412917, 0.2238170195774619, 0.267618603308889, -0.39584989922281427, -0.22320888567987685, 0.15452885845688055, 0.11954634907943208, 0.07115034683836852, -0.0306433471812329, -0.35480842451153266, 0.12807713220067835, -0.24538678159065896, -0.1305122731309464, -0.005925124371724099, 0.07454733810559427, 0.04327060537844449, -0.22498172688070092, 0.10139606889315317, -0.00472834191530895, -0.0051004355573475105, -0.07629808652526479, -0.07122849371651979, 0.008793257669018093, 0.08508886142769756, 0.0587816762142363, 0.05910642009204485, 0.14404564851878987, -0.1773646699350583, -0.16071775833008883, 0.32363649265832656, -0.07468869433815235, -0.07548718770981923, 0.1812122217699278, -0.2176208126882307, -0.1396746918591051, 0.20745464099387242, 0.16501363078651893, 0.09825333776831818, -0.15018661728112803, -0.06582696803509709, 0.06574521464887255, 0.22125028781472933, 0.11049563811628284, 0.10118218428853004, 0.28203554290782484, 0.15635574149375567, 0.09880542343126635, 0.08794221656507904, -0.22787537698283225, 0.03371923345105139, -0.28981312149096394, -0.11968605206128162, -0.14325407423406775, 0.11816258242545158, -0.08236869602114893, -0.07047753277371634, 0.3671079549834516, 0.18089430343635507, 0.15629192475302447, 0.05836262008726853, 0.24033410584578058, 0.11149163508859948, 0.09200150299069867, 0.045658205995584, 0.3662175891737058, 0.0336546412811019, 0.04693918462139215, -0.12418931159150863, 0.11414341095089513, -0.04143392450332066] |
1,803.02881 | Algorithms and diagnostics for the analysis of preference rankings with
the Extended Plackett-Luce model | Choice behavior and preferences typically involve numerous and subjective
aspects that are difficult to be identified and quantified. For this reason,
their exploration is frequently conducted through the collection of ordinal
evidence in the form of ranking data. A ranking is an ordered sequence
resulting from the comparative evaluation of a given set of items according to
a specific criterion. Multistage ranking models, including the popular
Plackett-Luce distribution (PL), rely on the assumption that the ranking
process is performed sequentially, by assigning the positions from the top to
the bottom one (forward order). A recent contribution to the ranking literature
relaxed this assumption with the addition of the discrete reference order
parameter, yielding the novel Extended Plackett-Luce model (EPL). Inference on
the EPL and its generalization into a finite mixture framework was originally
addressed from the frequentist perspective. In this work, we propose the
Bayesian estimation of the EPL with order constraints on the reference order
parameter. The restrictions for the discrete parameter reflect a meaningful
rank assignment process and, in combination with the data augmentation strategy
and the conjugacy of the Gamma prior distribution with the EPL, facilitate the
construction of a tuned joint Metropolis-Hastings algorithm within Gibbs
sampling to simulate from the posterior distribution. We additionally propose a
novel model diagnostic to assess the adequacy of the EPL parametric
specification. The usefulness of the proposal is illustrated with applications
to simulated and real datasets.
| stat.ME | choice behavior and preferences typically involve numerous and subjective aspects that are difficult to be identified and quantified for this reason their exploration is frequently conducted through the collection of ordinal evidence in the form of ranking data a ranking is an ordered sequence resulting from the comparative evaluation of a given set of items according to a specific criterion multistage ranking models including the popular plackettluce distribution pl rely on the assumption that the ranking process is performed sequentially by assigning the positions from the top to the bottom one forward order a recent contribution to the ranking literature relaxed this assumption with the addition of the discrete reference order parameter yielding the novel extended plackettluce model epl inference on the epl and its generalization into a finite mixture framework was originally addressed from the frequentist perspective in this work we propose the bayesian estimation of the epl with order constraints on the reference order parameter the restrictions for the discrete parameter reflect a meaningful rank assignment process and in combination with the data augmentation strategy and the conjugacy of the gamma prior distribution with the epl facilitate the construction of a tuned joint metropolishastings algorithm within gibbs sampling to simulate from the posterior distribution we additionally propose a novel model diagnostic to assess the adequacy of the epl parametric specification the usefulness of the proposal is illustrated with applications to simulated and real datasets | [['choice', 'behavior', 'and', 'preferences', 'typically', 'involve', 'numerous', 'and', 'subjective', 'aspects', 'that', 'are', 'difficult', 'to', 'be', 'identified', 'and', 'quantified', 'for', 'this', 'reason', 'their', 'exploration', 'is', 'frequently', 'conducted', 'through', 'the', 'collection', 'of', 'ordinal', 'evidence', 'in', 'the', 'form', 'of', 'ranking', 'data', 'a', 'ranking', 'is', 'an', 'ordered', 'sequence', 'resulting', 'from', 'the', 'comparative', 'evaluation', 'of', 'a', 'given', 'set', 'of', 'items', 'according', 'to', 'a', 'specific', 'criterion', 'multistage', 'ranking', 'models', 'including', 'the', 'popular', 'plackettluce', 'distribution', 'pl', 'rely', 'on', 'the', 'assumption', 'that', 'the', 'ranking', 'process', 'is', 'performed', 'sequentially', 'by', 'assigning', 'the', 'positions', 'from', 'the', 'top', 'to', 'the', 'bottom', 'one', 'forward', 'order', 'a', 'recent', 'contribution', 'to', 'the', 'ranking', 'literature', 'relaxed', 'this', 'assumption', 'with', 'the', 'addition', 'of', 'the', 'discrete', 'reference', 'order', 'parameter', 'yielding', 'the', 'novel', 'extended', 'plackettluce', 'model', 'epl', 'inference', 'on', 'the', 'epl', 'and', 'its', 'generalization', 'into', 'a', 'finite', 'mixture', 'framework', 'was', 'originally', 'addressed', 'from', 'the', 'frequentist', 'perspective', 'in', 'this', 'work', 'we', 'propose', 'the', 'bayesian', 'estimation', 'of', 'the', 'epl', 'with', 'order', 'constraints', 'on', 'the', 'reference', 'order', 'parameter', 'the', 'restrictions', 'for', 'the', 'discrete', 'parameter', 'reflect', 'a', 'meaningful', 'rank', 'assignment', 'process', 'and', 'in', 'combination', 'with', 'the', 'data', 'augmentation', 'strategy', 'and', 'the', 'conjugacy', 'of', 'the', 'gamma', 'prior', 'distribution', 'with', 'the', 'epl', 'facilitate', 'the', 'construction', 'of', 'a', 'tuned', 'joint', 'metropolishastings', 'algorithm', 'within', 'gibbs', 'sampling', 'to', 'simulate', 'from', 'the', 'posterior', 'distribution', 'we', 'additionally', 'propose', 'a', 'novel', 'model', 'diagnostic', 'to', 'assess', 'the', 'adequacy', 'of', 'the', 'epl', 'parametric', 'specification', 'the', 'usefulness', 'of', 'the', 'proposal', 'is', 'illustrated', 'with', 'applications', 'to', 'simulated', 'and', 'real', 'datasets']] | [-0.020017001096413755, 0.03524683061766416, -0.10649544749432638, 0.0600592635675824, -0.1286872737445095, -0.11087885905270291, 0.12423355455196589, 0.38302151240128235, -0.25905741209566785, -0.3536521973861855, 0.07510090859604888, -0.24443469745485838, -0.11022789802666659, 0.13666907580711452, -0.0740759424476537, 0.08743712313742559, 0.06170940641422314, 0.03584627302608184, -0.0447546026030145, -0.25734794659439425, 0.31834111838913287, 0.06863996468955982, 0.3417753240328393, -0.01427985381500764, 0.09297843250320603, 0.032054542430668624, -0.08167523910366473, 0.011765530359282867, -0.14192590616887357, 0.15070776446915815, 0.24237181037986344, 0.1812424034990619, 0.3264164301187937, -0.34698081451383816, -0.20584246493228298, 0.11414680494611168, 0.07321857900745472, 0.0727065809321283, -0.019588388246212795, -0.31666579215897844, 0.06253213394764748, -0.191370646968993, -0.04468811611384469, -0.090111043402862, -0.01779074029912146, 0.01661162457322323, -0.325149127999439, 0.05969089105275412, 0.06045305555867884, 0.04409810278784943, -0.02860117689716251, -0.12634906619866143, -0.0034496949825798934, 0.09866571040050584, 0.0533324038021373, 0.027997060814676056, 0.11216863395914561, -0.10721672988561834, -0.14453634080650696, 0.3832253737143789, -0.036635917692318935, -0.22436684048813532, 0.18062105217861738, -0.07230796108330143, -0.16069677372668253, 0.09482783933517412, 0.18406788204102068, 0.12267107911266374, -0.1680756829308062, 0.058566438514883315, -0.041346141981933725, 0.16464580004093615, 0.019794405622494612, -0.04544991771374845, 0.18157599958141288, 0.19823123746792295, 0.015572331074262195, 0.15516141493226623, -0.09634910325985402, -0.12962777110707543, -0.2979533456313282, -0.1380950016078344, -0.1904535391930317, -0.011048489804695345, -0.09822532481084019, -0.17570289967619118, 0.41520984193815264, 0.20183938234987506, 0.2275108922572838, 0.05939875216365366, 0.28520583750687983, 0.10333231953200854, 0.022363406276997275, 0.037477604192444836, 0.1697848436296365, 0.07909591693600829, 0.054315998063075466, -0.1735470423990884, 0.13767336943173009, 0.029956864170390732] |
1,803.02882 | Compact sub-kilohertz low-frequency quantum light source based on
four-wave mixing in cesium vapor | Using a nondegenerate four-wave mixing (FWM) process based on a
double-{\Lambda} scheme in hot cesium vapor, we demonstrate a compact
diode-laser-pumped quantum light source for the generation of quantum
correlated twin beams with a maximum squeezing of 6.5 dB. The squeezing is
observed at a Fourier frequency in the audio band down to 0.7 kHz which, to the
best of our knowledge, is the first observation of sub-kilohertz
intensity-difference squeezing in an atomic system so far. A phase-matching
condition is also investigated in our system, which confirms the
spatial-multi-mode characteristics of the FWM process. Our compact
low-frequency squeezed light source may find applications in quantum imaging,
quantum metrology, and the transfer of optical squeezing onto a matter wave.
| quant-ph | using a nondegenerate fourwave mixing fwm process based on a doublelambda scheme in hot cesium vapor we demonstrate a compact diodelaserpumped quantum light source for the generation of quantum correlated twin beams with a maximum squeezing of 65 db the squeezing is observed at a fourier frequency in the audio band down to 07 khz which to the best of our knowledge is the first observation of subkilohertz intensitydifference squeezing in an atomic system so far a phasematching condition is also investigated in our system which confirms the spatialmultimode characteristics of the fwm process our compact lowfrequency squeezed light source may find applications in quantum imaging quantum metrology and the transfer of optical squeezing onto a matter wave | [['using', 'a', 'nondegenerate', 'fourwave', 'mixing', 'fwm', 'process', 'based', 'on', 'a', 'doublelambda', 'scheme', 'in', 'hot', 'cesium', 'vapor', 'we', 'demonstrate', 'a', 'compact', 'diodelaserpumped', 'quantum', 'light', 'source', 'for', 'the', 'generation', 'of', 'quantum', 'correlated', 'twin', 'beams', 'with', 'a', 'maximum', 'squeezing', 'of', '65', 'db', 'the', 'squeezing', 'is', 'observed', 'at', 'a', 'fourier', 'frequency', 'in', 'the', 'audio', 'band', 'down', 'to', '07', 'khz', 'which', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'is', 'the', 'first', 'observation', 'of', 'subkilohertz', 'intensitydifference', 'squeezing', 'in', 'an', 'atomic', 'system', 'so', 'far', 'a', 'phasematching', 'condition', 'is', 'also', 'investigated', 'in', 'our', 'system', 'which', 'confirms', 'the', 'spatialmultimode', 'characteristics', 'of', 'the', 'fwm', 'process', 'our', 'compact', 'lowfrequency', 'squeezed', 'light', 'source', 'may', 'find', 'applications', 'in', 'quantum', 'imaging', 'quantum', 'metrology', 'and', 'the', 'transfer', 'of', 'optical', 'squeezing', 'onto', 'a', 'matter', 'wave']] | [-0.11980226252268514, 0.21289733606302078, -0.07478409624941972, -0.00516155056396636, -0.010004367096268613, -0.11143266068285575, 0.09951904891666187, 0.41560944752848666, -0.25599396670966046, -0.23712185256831023, 0.06479593514485042, -0.25122872805627794, -0.09579808169004062, 0.28043172300347813, -0.02501201957626187, 0.09613291038524198, 0.07465159287676215, -0.027204754361477883, -0.03478090036660433, -0.16237988714938578, 0.2754760375114806, 0.034240876490493184, 0.3231137445439463, 0.04253550946874463, 0.15645352981417723, -0.0331095446265586, 0.04198606334950613, -0.16564536371632763, -0.06494922630245918, 0.08940382137206261, 0.23580234172834974, 0.0578540119494352, 0.228497937872358, -0.3312242202784704, -0.25665272018750723, 0.060312544533276786, 0.1226431202477492, 0.1654275146252273, -0.06740717456736804, -0.3144144460072984, -0.0009345622166343357, -0.13322626707022606, -0.1178410117150001, -0.03675419248478568, -0.031409017689040176, -0.011953945911448934, -0.3092150712466758, 0.05019450004835127, 0.08506322277547873, 0.056246211339274176, 0.011924894913302168, -0.044203537773421925, -0.012746238548551565, 0.02083253381854814, -0.10190655554938333, 0.011180212464102585, 0.147335298537054, -0.13269463596946518, -0.10897130364876079, 0.4051664577797055, -0.13923289732673488, -0.11980410081172443, 0.13967927500767552, -0.20066529540749994, -0.05156905034192554, 0.15697669039034973, 0.15331853241254778, 0.10442146681573079, -0.14043495547654025, 0.0005033492389054078, -0.025991192877004125, 0.27942600275349355, 0.15580709914312416, 0.15613144313025734, 0.23886805982531412, 0.20658677914584783, 0.0477665517155243, 0.1788596532712488, -0.16482579865006972, -0.06155420640564483, -0.2726486138837493, -0.1490800526079155, -0.2538210264933498, 0.09654709721912894, -0.07361543116997421, -0.11314212472947395, 0.42611191473485593, 0.13106122667719003, 0.11911446539199223, -0.06192971078031089, 0.3504289908901505, 0.13831568404364036, 0.04297709466646547, 0.02708437136252937, 0.33103064788586417, 0.19131274052045266, 0.1208366496205006, -0.2676989953924456, -0.029501279884868344, -0.051464951206403584] |
1,803.02883 | On the round-trip efficiency of an HVAC-based virtual battery | Flexible loads, especially heating, ventilation, and air-conditioning (HVAC)
systems can be used to provide a battery-like service to the power grid by
varying their demand up and down over a baseline. Recent work has reported that
providing virtual energy storage with HVAC systems lead to a net loss of
energy, akin to a low round-trip efficiency (RTE) of a battery. In this work we
rigorously analyze the RTE of a virtual battery through a simplified
physics-based model. We show that the low RTEs reported in recent experimental
and simulation work are an artifact of the experimental/simulation setup. When
the HVAC system is repeatedly used as a virtual battery, the asymptotic RTE is
1. Robustness of the result to assumptions made in the analysis is illustrated
through a simulation case study.
| cs.SY math.DS | flexible loads especially heating ventilation and airconditioning hvac systems can be used to provide a batterylike service to the power grid by varying their demand up and down over a baseline recent work has reported that providing virtual energy storage with hvac systems lead to a net loss of energy akin to a low roundtrip efficiency rte of a battery in this work we rigorously analyze the rte of a virtual battery through a simplified physicsbased model we show that the low rtes reported in recent experimental and simulation work are an artifact of the experimentalsimulation setup when the hvac system is repeatedly used as a virtual battery the asymptotic rte is 1 robustness of the result to assumptions made in the analysis is illustrated through a simulation case study | [['flexible', 'loads', 'especially', 'heating', 'ventilation', 'and', 'airconditioning', 'hvac', 'systems', 'can', 'be', 'used', 'to', 'provide', 'a', 'batterylike', 'service', 'to', 'the', 'power', 'grid', 'by', 'varying', 'their', 'demand', 'up', 'and', 'down', 'over', 'a', 'baseline', 'recent', 'work', 'has', 'reported', 'that', 'providing', 'virtual', 'energy', 'storage', 'with', 'hvac', 'systems', 'lead', 'to', 'a', 'net', 'loss', 'of', 'energy', 'akin', 'to', 'a', 'low', 'roundtrip', 'efficiency', 'rte', 'of', 'a', 'battery', 'in', 'this', 'work', 'we', 'rigorously', 'analyze', 'the', 'rte', 'of', 'a', 'virtual', 'battery', 'through', 'a', 'simplified', 'physicsbased', 'model', 'we', 'show', 'that', 'the', 'low', 'rtes', 'reported', 'in', 'recent', 'experimental', 'and', 'simulation', 'work', 'are', 'an', 'artifact', 'of', 'the', 'experimentalsimulation', 'setup', 'when', 'the', 'hvac', 'system', 'is', 'repeatedly', 'used', 'as', 'a', 'virtual', 'battery', 'the', 'asymptotic', 'rte', 'is', '1', 'robustness', 'of', 'the', 'result', 'to', 'assumptions', 'made', 'in', 'the', 'analysis', 'is', 'illustrated', 'through', 'a', 'simulation', 'case', 'study']] | [-0.12148390394498328, 0.07596766636736219, -0.04645986699087675, 0.020086574247251302, -0.02380319806934847, -0.12963852227499434, 0.09181404324219555, 0.3787905340653288, -0.24793965274886798, -0.35376767495055067, 0.11477348967834354, -0.25287111425165865, -0.09752644025973341, 0.25679291708281177, -0.12278947370964312, 0.1058996841031697, 0.08829052800532834, -0.0034611073334777165, -0.008332477665917819, -0.20401471176783936, 0.242796598060071, 0.15443246114219344, 0.3202487445154855, 0.08215271859689681, 0.10063528401647197, -0.032397064468787276, -0.012372870362804149, 0.016325266024660924, -0.07098489319745455, 0.11771680022925572, 0.25666226561058514, 0.0955661761722448, 0.2970458068126856, -0.4800682361995758, -0.2664703749178443, 0.08750388902330468, 0.09195169982998523, 0.06853623102354102, -0.06436944772695126, -0.20123467575794793, 0.10440776746200267, -0.29048969903455457, -0.09900585313660612, -0.07364423079560548, -0.022760405187141293, 0.04477918975221268, -0.2852098293775736, 0.013843179875335027, 0.05298230337888696, 0.058651852268047, -0.06697220261327835, -0.07102622755337507, -0.01725531099797335, 0.1322922435214169, 0.04264310288672559, -0.010249437823848323, 0.1435997938564004, -0.10316326039799945, -0.10921356491491833, 0.3920251666820904, -0.03549602983768509, -0.20416236143963512, 0.2023918232663946, -0.03918335294755277, -0.06165576108204302, 0.10627093028219402, 0.2182716864753197, 0.09408660547432396, -0.18665430987808337, 0.03681355320159057, 0.0001591663850947868, 0.16506525799776464, 0.0283844490993999, -0.021350872915873464, 0.16010194360964405, 0.25425722624731156, 0.06294381927496703, 0.17511892811369958, -0.05902430206869346, -0.08146272949484545, -0.2307255938576982, -0.16815210888956406, -0.16678793399861847, 0.07599972929289318, -0.04676185490515231, -0.10925446365158571, 0.3767316268482643, 0.1911549905130943, 0.18467454449634624, 0.057771470913908975, 0.3949509577017075, 0.13896636906632243, 0.04794185635157276, 0.07890252649870723, 0.19942293726828295, 0.05386305726205483, 0.17659130107968785, -0.24659297772315006, 0.08030915212846368, -0.003385569710760962] |
1,803.02884 | Synthesis in pMDPs: A Tale of 1001 Parameters | This paper considers parametric Markov decision processes (pMDPs) whose
transitions are equipped with affine functions over a finite set of parameters.
The synthesis problem is to find a parameter valuation such that the
instantiated pMDP satisfies a specification under all strategies. We show that
this problem can be formulated as a quadratically-constrained quadratic program
(QCQP) and is non-convex in general. To deal with the NP-hardness of such
problems, we exploit a convex-concave procedure (CCP) to iteratively obtain
local optima. An appropriate interplay between CCP solvers and probabilistic
model checkers creates a procedure --- realized in the open-source tool
PROPhESY --- that solves the synthesis problem for models with thousands of
parameters.
| cs.AI math.OC | this paper considers parametric markov decision processes pmdps whose transitions are equipped with affine functions over a finite set of parameters the synthesis problem is to find a parameter valuation such that the instantiated pmdp satisfies a specification under all strategies we show that this problem can be formulated as a quadraticallyconstrained quadratic program qcqp and is nonconvex in general to deal with the nphardness of such problems we exploit a convexconcave procedure ccp to iteratively obtain local optima an appropriate interplay between ccp solvers and probabilistic model checkers creates a procedure realized in the opensource tool prophesy that solves the synthesis problem for models with thousands of parameters | [['this', 'paper', 'considers', 'parametric', 'markov', 'decision', 'processes', 'pmdps', 'whose', 'transitions', 'are', 'equipped', 'with', 'affine', 'functions', 'over', 'a', 'finite', 'set', 'of', 'parameters', 'the', 'synthesis', 'problem', 'is', 'to', 'find', 'a', 'parameter', 'valuation', 'such', 'that', 'the', 'instantiated', 'pmdp', 'satisfies', 'a', 'specification', 'under', 'all', 'strategies', 'we', 'show', 'that', 'this', 'problem', 'can', 'be', 'formulated', 'as', 'a', 'quadraticallyconstrained', 'quadratic', 'program', 'qcqp', 'and', 'is', 'nonconvex', 'in', 'general', 'to', 'deal', 'with', 'the', 'nphardness', 'of', 'such', 'problems', 'we', 'exploit', 'a', 'convexconcave', 'procedure', 'ccp', 'to', 'iteratively', 'obtain', 'local', 'optima', 'an', 'appropriate', 'interplay', 'between', 'ccp', 'solvers', 'and', 'probabilistic', 'model', 'checkers', 'creates', 'a', 'procedure', 'realized', 'in', 'the', 'opensource', 'tool', 'prophesy', 'that', 'solves', 'the', 'synthesis', 'problem', 'for', 'models', 'with', 'thousands', 'of', 'parameters']] | [-0.10421078868436619, 0.012455618597711784, -0.06819915821532084, 0.08133653362899601, -0.128855681825847, -0.1919251335958872, 0.06022609067018901, 0.39698703157732906, -0.378706258660722, -0.3003356059856504, 0.12565877213073182, -0.19750500423833728, -0.15420713515900006, 0.19237097351655155, -0.10143512984407003, 0.09999806003070602, 0.06903953981698951, -0.035015487033769346, -0.08678723390597119, -0.24656730833915977, 0.29068119692503014, -0.003986714399097679, 0.20741333189272435, 0.013236857282115303, 0.17459168613270343, 0.033074986002468894, 0.04090844399826688, 0.062321697910116096, -0.10015001283869067, 0.10549432823160297, 0.33688892206660864, 0.22634801388692075, 0.36427711196696366, -0.4173080104916731, -0.1996661074564, 0.16616542387980027, 0.07429872142481748, 0.09726715508726573, -0.017187481691677855, -0.22773078477410513, 0.07876800942108488, -0.15251005976678472, -0.09876585773966998, -0.07057233122351501, -0.05779271662043773, 0.003972707581749865, -0.383551697986566, -0.013689675098546197, 0.05373133537054897, 0.03898031751529497, -0.09001695407363021, -0.08629901269254944, 0.016242527979574053, 0.0408272607030051, 0.03096417116902107, 0.02327030767016461, 0.08094661361777232, -0.07778841337606868, -0.18021821476101318, 0.3786202768711417, -0.030333580766917667, -0.2589684339331585, 0.15591165005168486, 0.014888663610843855, -0.1912128507055203, 0.10444325719585765, 0.19312358811871957, 0.17271107264629035, -0.17205319019191176, 0.16818841226359776, -0.08886978229090015, 0.17022631735166657, 0.019322060483777635, -0.028907388332843884, 0.17941224563292393, 0.17611305501799437, 0.14673753366065778, 0.21972923940722178, 0.03430858684842971, -0.12701003690398185, -0.27943986798658377, -0.09735610861348633, -0.11448330138091903, -0.005567407615212985, -0.07286773428345908, -0.21526976956803107, 0.37771086750343164, 0.14662642350907776, 0.1607680199058535, 0.14491681853814103, 0.2840249951685143, 0.15960726957720875, 0.05830284922483549, 0.08991679087037517, 0.14212326517069676, 0.07957482896745205, 0.032356735871599936, -0.21687709633696162, 0.10840522332082146, 0.08985950712497547] |
1,803.02885 | Stability of constant mean curvature surfaces in three dimensional
warped product manifolds | In this paper we prove that stable, compact without boundary, oriented,
nonzero constant mean curvature surfaces in the de Sitter-Schwarzschild and
Reissner-Nordstrom manifolds are the slices, provided its mean curvature
satisfies some positive lower bound. More generally, we prove that stable,
compact without boundary, oriented nonzero constant mean curvature surfaces in
a large class of three dimensional warped product manifolds are embedded
topological spheres, provided the mean curvature satisfies a positive lower
bound depending only on the ambient curvatures. We conclude the paper proving
that a stable, compact without boundary, nonzero constant mean curvature
surface in a general Riemannian is a topological sphere provided its mean
curvature has a lower bound depending only on the scalar curvature of the
ambient space and the squared norm of the mean curvature vector field of the
immersion of the ambient space in some Euclidean space.
| math.DG | in this paper we prove that stable compact without boundary oriented nonzero constant mean curvature surfaces in the de sitterschwarzschild and reissnernordstrom manifolds are the slices provided its mean curvature satisfies some positive lower bound more generally we prove that stable compact without boundary oriented nonzero constant mean curvature surfaces in a large class of three dimensional warped product manifolds are embedded topological spheres provided the mean curvature satisfies a positive lower bound depending only on the ambient curvatures we conclude the paper proving that a stable compact without boundary nonzero constant mean curvature surface in a general riemannian is a topological sphere provided its mean curvature has a lower bound depending only on the scalar curvature of the ambient space and the squared norm of the mean curvature vector field of the immersion of the ambient space in some euclidean space | [['in', 'this', 'paper', 'we', 'prove', 'that', 'stable', 'compact', 'without', 'boundary', 'oriented', 'nonzero', 'constant', 'mean', 'curvature', 'surfaces', 'in', 'the', 'de', 'sitterschwarzschild', 'and', 'reissnernordstrom', 'manifolds', 'are', 'the', 'slices', 'provided', 'its', 'mean', 'curvature', 'satisfies', 'some', 'positive', 'lower', 'bound', 'more', 'generally', 'we', 'prove', 'that', 'stable', 'compact', 'without', 'boundary', 'oriented', 'nonzero', 'constant', 'mean', 'curvature', 'surfaces', 'in', 'a', 'large', 'class', 'of', 'three', 'dimensional', 'warped', 'product', 'manifolds', 'are', 'embedded', 'topological', 'spheres', 'provided', 'the', 'mean', 'curvature', 'satisfies', 'a', 'positive', 'lower', 'bound', 'depending', 'only', 'on', 'the', 'ambient', 'curvatures', 'we', 'conclude', 'the', 'paper', 'proving', 'that', 'a', 'stable', 'compact', 'without', 'boundary', 'nonzero', 'constant', 'mean', 'curvature', 'surface', 'in', 'a', 'general', 'riemannian', 'is', 'a', 'topological', 'sphere', 'provided', 'its', 'mean', 'curvature', 'has', 'a', 'lower', 'bound', 'depending', 'only', 'on', 'the', 'scalar', 'curvature', 'of', 'the', 'ambient', 'space', 'and', 'the', 'squared', 'norm', 'of', 'the', 'mean', 'curvature', 'vector', 'field', 'of', 'the', 'immersion', 'of', 'the', 'ambient', 'space', 'in', 'some', 'euclidean', 'space']] | [-0.2439803463934829, 0.19215889326887023, -0.07888466160942006, 0.09215714354855074, -0.1059475019967682, -0.15770355173924439, -0.05226209222398121, 0.37198503031788893, -0.20486349976477278, -0.2205442963823886, 0.13617043607478016, -0.24702199345165995, -0.15265516605569232, 0.1629049772475387, -0.11820139021048663, 0.01870840329358774, 0.025986992235911985, 0.15220753653761995, -0.13458234958947493, -0.2871688575349407, 0.4392069685731975, -0.029021324071718355, 0.22818676261296889, 0.12134339614577827, 0.13621615931313014, -0.06777382947333997, 0.042545985771526754, 0.09833972080890253, -0.23626600447823876, 0.16703234715583984, 0.12162493216857628, 0.031144815382324685, 0.22845780696149287, -0.37764185841496983, -0.27158367942730094, 0.17274869210414692, 0.07938468384779465, 0.012902819377724344, -0.06775693067492553, -0.2862306206657643, 0.12262579684578617, -0.03712767538365344, -0.1794061411736192, -0.04296768743964568, 0.008917235556996467, -0.0756735134161484, -0.19139697997089686, 0.0790653388888221, 0.10546767767387587, 0.07520383657415358, -0.1745432517048575, -0.1465473945480509, -0.09811276768688375, 0.08887973609446011, 0.04567456588273684, 0.08105313507544899, 0.11944640335023508, -0.09176072117145555, -0.018977276683280007, 0.3003113052224032, -0.1889692995775963, -0.3138884878651777, 0.10003179768887414, -0.19351548697589568, -0.08023580690701558, 0.16482626816297186, 0.19080579185753432, 0.19582552182763605, -0.021809729098171835, 0.19387030386952947, -0.019977801752401332, 0.11186463601598648, 0.12763524750693583, -0.0021324104307265295, 0.16422617102933812, 0.044849693043892025, 0.21518195359508546, 0.11721991461334409, -0.05072336221395821, -0.1012562895193696, -0.38181283192472976, -0.2747110431865481, -0.22242788970470428, 0.13436752121279041, -0.2168387970163628, -0.23007070374819386, 0.3130678186475129, -0.03415936819141613, 0.20499990897541734, 0.12460811480118984, 0.28169168964762925, 0.0590561006864218, 0.005079066825204227, 0.1745388957993193, 0.2519117318258562, 0.18374594929300145, 0.02546061661330537, -0.12706537819697036, -0.031063265308186833, 0.10585546661430681] |
1,803.02886 | Quantum-assisted cluster analysis | We present an algorithm for quantum-assisted cluster analysis (QACA) that
makes use of the topological properties of a D-Wave 2000Q quantum processing
unit (QPU). Clustering is a form of unsupervised machine learning, where
instances are organized into groups whose members share similarities. The
assignments are, in contrast to classification, not known a priori, but
generated by the algorithm. We explain how the problem can be expressed as a
quadratic unconstrained binary optimization (QUBO) problem, and show that the
introduced quantum-assisted clustering algorithm is, regarding accuracy,
equivalent to commonly used classical clustering algorithms. Quantum annealing
algorithms belong to the class of metaheuristic tools, applicable for solving
binary optimization problems. Hardware implementations of quantum annealing,
such as the quantum annealing machines produced by D-Wave Systems, have been
subject to multiple analyses in research, with the aim of characterizing the
technology's usefulness for optimization, sampling, and clustering. Our first
and foremost aim is to explain how to represent and solve parts of these
problems with the help of the QPU, and not to prove supremacy over every
existing classical clustering algorithm.
| quant-ph | we present an algorithm for quantumassisted cluster analysis qaca that makes use of the topological properties of a dwave 2000q quantum processing unit qpu clustering is a form of unsupervised machine learning where instances are organized into groups whose members share similarities the assignments are in contrast to classification not known a priori but generated by the algorithm we explain how the problem can be expressed as a quadratic unconstrained binary optimization qubo problem and show that the introduced quantumassisted clustering algorithm is regarding accuracy equivalent to commonly used classical clustering algorithms quantum annealing algorithms belong to the class of metaheuristic tools applicable for solving binary optimization problems hardware implementations of quantum annealing such as the quantum annealing machines produced by dwave systems have been subject to multiple analyses in research with the aim of characterizing the technologys usefulness for optimization sampling and clustering our first and foremost aim is to explain how to represent and solve parts of these problems with the help of the qpu and not to prove supremacy over every existing classical clustering algorithm | [['we', 'present', 'an', 'algorithm', 'for', 'quantumassisted', 'cluster', 'analysis', 'qaca', 'that', 'makes', 'use', 'of', 'the', 'topological', 'properties', 'of', 'a', 'dwave', '2000q', 'quantum', 'processing', 'unit', 'qpu', 'clustering', 'is', 'a', 'form', 'of', 'unsupervised', 'machine', 'learning', 'where', 'instances', 'are', 'organized', 'into', 'groups', 'whose', 'members', 'share', 'similarities', 'the', 'assignments', 'are', 'in', 'contrast', 'to', 'classification', 'not', 'known', 'a', 'priori', 'but', 'generated', 'by', 'the', 'algorithm', 'we', 'explain', 'how', 'the', 'problem', 'can', 'be', 'expressed', 'as', 'a', 'quadratic', 'unconstrained', 'binary', 'optimization', 'qubo', 'problem', 'and', 'show', 'that', 'the', 'introduced', 'quantumassisted', 'clustering', 'algorithm', 'is', 'regarding', 'accuracy', 'equivalent', 'to', 'commonly', 'used', 'classical', 'clustering', 'algorithms', 'quantum', 'annealing', 'algorithms', 'belong', 'to', 'the', 'class', 'of', 'metaheuristic', 'tools', 'applicable', 'for', 'solving', 'binary', 'optimization', 'problems', 'hardware', 'implementations', 'of', 'quantum', 'annealing', 'such', 'as', 'the', 'quantum', 'annealing', 'machines', 'produced', 'by', 'dwave', 'systems', 'have', 'been', 'subject', 'to', 'multiple', 'analyses', 'in', 'research', 'with', 'the', 'aim', 'of', 'characterizing', 'the', 'technologys', 'usefulness', 'for', 'optimization', 'sampling', 'and', 'clustering', 'our', 'first', 'and', 'foremost', 'aim', 'is', 'to', 'explain', 'how', 'to', 'represent', 'and', 'solve', 'parts', 'of', 'these', 'problems', 'with', 'the', 'help', 'of', 'the', 'qpu', 'and', 'not', 'to', 'prove', 'supremacy', 'over', 'every', 'existing', 'classical', 'clustering', 'algorithm']] | [-0.07674380294099913, 0.0299296358391928, -0.11725897498634029, 0.0832079779402758, -0.09572786723374058, -0.19044519800661228, 0.028713879235336127, 0.40326663538666263, -0.31516696215412543, -0.3617079568642723, 0.10748241239721955, -0.24029656822693213, -0.17477887508980297, 0.2170541826635599, -0.07042253758011144, 0.12252998750362187, 0.08000468950597622, 0.028970499088235284, -0.06404804220517814, -0.3279465316784289, 0.2796130256127503, 0.020477245940621627, 0.26311605475779815, -0.00711634701465146, 0.0729671033746484, 0.013862703295456151, 0.00085181175957376, 0.04662068703311816, -0.07961816428596546, 0.14310621531117224, 0.3354350407160608, 0.2153539029265738, 0.3205889489207059, -0.37870741192705926, -0.20226647946549484, 0.1533138058312753, 0.17056496548703162, 0.09461005006806325, -0.051160030547098, -0.2543688928826823, 0.11919604015002543, -0.10929274353288156, -0.042936894629613656, -0.11302151410487918, -0.04369917399470963, 0.01901404972524924, -0.22630978892899334, 0.03773972835381236, 0.056846554185550575, 0.0189593794550431, -0.064931492714506, -0.12848421191470435, 0.09321715875718174, 0.09198969390801033, -0.002442751498103647, 0.040916508487241585, 0.11882821286043237, -0.11757959742467367, -0.24542457930280664, 0.41268095159429613, 0.026127723653374586, -0.18617930095826965, 0.2030622694762371, 0.007133521817066828, -0.19470806515086336, 0.08863659977313068, 0.20804751087716744, 0.12306819133997215, -0.14358552956774748, 0.08529905899721171, -0.011967452537626197, 0.16473571749372504, 0.024758567528451902, 0.012780193598562126, 0.1781653847527627, 0.17580827664173507, 0.07224523790028094, 0.1805367801433145, -0.042155929400433, -0.13913428538747258, -0.21413025064531999, -0.15230155637287823, -0.21923394557772635, 0.003038228010149715, -0.04616234227079348, -0.18650853004185536, 0.36459516620626514, 0.19673833938112936, 0.17785925492591692, 0.05648185127404239, 0.29591990606517315, 0.08178274273690847, 0.09154223574431992, 0.11723961965259859, 0.1710912947316712, 0.13946248625410396, 0.07442476594554902, -0.23886157404815536, 0.08567711357342994, 0.05701690444612276] |
1,803.02887 | A first look at browser-based Cryptojacking | In this paper, we examine the recent trend towards in-browser mining of
cryptocurrencies; in particular, the mining of Monero through Coinhive and
similar code- bases. In this model, a user visiting a website will download a
JavaScript code that executes client-side in her browser, mines a
cryptocurrency, typically without her consent or knowledge, and pays out the
seigniorage to the website. Websites may consciously employ this as an
alternative or to supplement advertisement revenue, may offer premium content
in exchange for mining, or may be unwittingly serving the code as a result of a
breach (in which case the seigniorage is collected by the attacker). The
cryptocurrency Monero is preferred seemingly for its unfriendliness to
large-scale ASIC mining that would drive browser-based efforts out of the
market, as well as for its purported privacy features. In this paper, we survey
this landscape, conduct some measurements to establish its prevalence and
profitability, outline an ethical framework for considering whether it should
be classified as an attack or business opportunity, and make suggestions for
the detection, mitigation and/or prevention of browser-based mining for non-
consenting users.
| cs.CR cs.CY cs.HC econ.EM | in this paper we examine the recent trend towards inbrowser mining of cryptocurrencies in particular the mining of monero through coinhive and similar code bases in this model a user visiting a website will download a javascript code that executes clientside in her browser mines a cryptocurrency typically without her consent or knowledge and pays out the seigniorage to the website websites may consciously employ this as an alternative or to supplement advertisement revenue may offer premium content in exchange for mining or may be unwittingly serving the code as a result of a breach in which case the seigniorage is collected by the attacker the cryptocurrency monero is preferred seemingly for its unfriendliness to largescale asic mining that would drive browserbased efforts out of the market as well as for its purported privacy features in this paper we survey this landscape conduct some measurements to establish its prevalence and profitability outline an ethical framework for considering whether it should be classified as an attack or business opportunity and make suggestions for the detection mitigation andor prevention of browserbased mining for non consenting users | [['in', 'this', 'paper', 'we', 'examine', 'the', 'recent', 'trend', 'towards', 'inbrowser', 'mining', 'of', 'cryptocurrencies', 'in', 'particular', 'the', 'mining', 'of', 'monero', 'through', 'coinhive', 'and', 'similar', 'code', 'bases', 'in', 'this', 'model', 'a', 'user', 'visiting', 'a', 'website', 'will', 'download', 'a', 'javascript', 'code', 'that', 'executes', 'clientside', 'in', 'her', 'browser', 'mines', 'a', 'cryptocurrency', 'typically', 'without', 'her', 'consent', 'or', 'knowledge', 'and', 'pays', 'out', 'the', 'seigniorage', 'to', 'the', 'website', 'websites', 'may', 'consciously', 'employ', 'this', 'as', 'an', 'alternative', 'or', 'to', 'supplement', 'advertisement', 'revenue', 'may', 'offer', 'premium', 'content', 'in', 'exchange', 'for', 'mining', 'or', 'may', 'be', 'unwittingly', 'serving', 'the', 'code', 'as', 'a', 'result', 'of', 'a', 'breach', 'in', 'which', 'case', 'the', 'seigniorage', 'is', 'collected', 'by', 'the', 'attacker', 'the', 'cryptocurrency', 'monero', 'is', 'preferred', 'seemingly', 'for', 'its', 'unfriendliness', 'to', 'largescale', 'asic', 'mining', 'that', 'would', 'drive', 'browserbased', 'efforts', 'out', 'of', 'the', 'market', 'as', 'well', 'as', 'for', 'its', 'purported', 'privacy', 'features', 'in', 'this', 'paper', 'we', 'survey', 'this', 'landscape', 'conduct', 'some', 'measurements', 'to', 'establish', 'its', 'prevalence', 'and', 'profitability', 'outline', 'an', 'ethical', 'framework', 'for', 'considering', 'whether', 'it', 'should', 'be', 'classified', 'as', 'an', 'attack', 'or', 'business', 'opportunity', 'and', 'make', 'suggestions', 'for', 'the', 'detection', 'mitigation', 'andor', 'prevention', 'of', 'browserbased', 'mining', 'for', 'non', 'consenting', 'users']] | [-0.10767935306214578, -0.006226224551194101, -0.09816862806389674, 0.08893798262933114, -0.17256951259541742, -0.20400193784622608, 0.14866048989699154, 0.383934804778649, -0.2849731105251124, -0.321541359169262, 0.15173196244067694, -0.3334082049219252, -0.11242227564509237, 0.1666580425274368, -0.13143278715469128, -0.01444469783770291, 0.0304531065196581, 0.056546693819559575, 0.03919819994309907, -0.30857012788919497, 0.274706855798346, 0.12054010175164655, 0.27439582545840235, 0.08507052714774355, 0.00017545613696932463, 0.013456080144898996, -0.07585258359984798, -0.048788447725427085, -0.08350740383208398, 0.10752101644544955, 0.3686940367565135, 0.2696910874882085, 0.36126766839574054, -0.4113209792798725, -0.14480661769212322, 0.09619361405821712, 0.15379459979925922, 0.10911278578244377, -0.09761915509769106, -0.2949387677186246, 0.09282621512066017, -0.28471969726150703, -0.10251125191256033, -0.10091910921088651, 0.010173260958515395, 0.0023313389797772165, -0.26357609996294284, -0.05450074888189524, 0.03124852615951442, 0.11166288083398622, -0.014303424122591519, -0.07156353447720079, -0.017395576826188693, 0.1717834509909153, 0.09500881528304324, 0.01410822295815329, 0.16194837917805294, -0.15796253082435063, -0.17085546110010608, 0.388831192493768, -0.007487010946548776, -0.12183261722215652, 0.14671160305402556, -0.013148803303779736, -0.16660134484142436, 0.034427956730070736, 0.22673066178573428, 0.08705226656111235, -0.2127703154099094, 0.0020713624145670983, -0.02130583118009304, 0.18400293096863968, 0.0674966923244174, 0.0029203632242851556, 0.23895737073430534, 0.19882663040555684, 0.09404671280156018, 0.12211832667196694, -0.035151144680026815, -0.05999614081592479, -0.2342448474296487, -0.1900477854468093, -0.12130033351012727, 0.07209685089540004, -0.046012984473934884, -0.15465296857388308, 0.35873590897542335, 0.20564212286214534, 0.11004871925730156, 0.017731999370619367, 0.33374546344253075, -0.00699765688883789, 0.10070838097956299, 0.11095269299909802, 0.162273496300148, -0.07480668433355322, 0.20635002827688598, -0.11494742870042667, 0.19061138626324395, -0.03620756875359561] |
1,803.02888 | Graph extensions, edit number and regular graphs | A graph G on n vertices is said to be extendable if G can be modified to form
a new graph H on more than n vertices, while preserving the degrees of the
vertices common to G and H. The added vertices all have the same degree and we
define edit numbers to quantify the amount of modification needed to obtain the
extended graph. Characterizing graphs with least possible edit numbers, we
obtain that graphs with zero edit number can be extended using regular graphs.
We also describe an iterative algorithm to construct connected regular graphs
on arbitrarily large vertex sets, starting from the complete graph on a fixed
set of vertices.
| math.CO | a graph g on n vertices is said to be extendable if g can be modified to form a new graph h on more than n vertices while preserving the degrees of the vertices common to g and h the added vertices all have the same degree and we define edit numbers to quantify the amount of modification needed to obtain the extended graph characterizing graphs with least possible edit numbers we obtain that graphs with zero edit number can be extended using regular graphs we also describe an iterative algorithm to construct connected regular graphs on arbitrarily large vertex sets starting from the complete graph on a fixed set of vertices | [['a', 'graph', 'g', 'on', 'n', 'vertices', 'is', 'said', 'to', 'be', 'extendable', 'if', 'g', 'can', 'be', 'modified', 'to', 'form', 'a', 'new', 'graph', 'h', 'on', 'more', 'than', 'n', 'vertices', 'while', 'preserving', 'the', 'degrees', 'of', 'the', 'vertices', 'common', 'to', 'g', 'and', 'h', 'the', 'added', 'vertices', 'all', 'have', 'the', 'same', 'degree', 'and', 'we', 'define', 'edit', 'numbers', 'to', 'quantify', 'the', 'amount', 'of', 'modification', 'needed', 'to', 'obtain', 'the', 'extended', 'graph', 'characterizing', 'graphs', 'with', 'least', 'possible', 'edit', 'numbers', 'we', 'obtain', 'that', 'graphs', 'with', 'zero', 'edit', 'number', 'can', 'be', 'extended', 'using', 'regular', 'graphs', 'we', 'also', 'describe', 'an', 'iterative', 'algorithm', 'to', 'construct', 'connected', 'regular', 'graphs', 'on', 'arbitrarily', 'large', 'vertex', 'sets', 'starting', 'from', 'the', 'complete', 'graph', 'on', 'a', 'fixed', 'set', 'of', 'vertices']] | [-0.1417566819239125, 0.125374409541759, -0.06495166480973628, 0.06601128437510592, -0.16514205517471833, -0.1683761415978162, 0.0568714071164972, 0.3885698995852311, -0.2807945586807494, -0.35674796744258075, 0.05027244400532384, -0.32703876974327223, -0.11006900147185661, 0.09830981970299035, -0.09559276693835272, -0.010863834168828492, 0.1423728435869894, 0.15534619659131618, 0.01806924687688089, -0.29478003978251116, 0.29096321979471085, -0.0402700788108632, 0.12478027930982145, 0.05141817747582016, 0.07903899611639124, 0.029726499587663317, -0.002868977446009272, 0.13330810107332322, -0.171505778286116, 0.10849964760460093, 0.24912196375121962, 0.1632909446489066, 0.21225236041937023, -0.41846762831223067, -0.13195452993802195, 0.24373461740573735, 0.09920594211351792, 0.06696027650156923, 0.05619458558729613, -0.23590436946999813, 0.15695588063265728, -0.1090927551133843, -0.09108098836648944, -0.04554274253314361, 0.10006313122409795, -0.0063916559951654305, -0.27848506083578933, -0.08319384103508908, 0.02105140678135545, 0.01915314992324316, 0.1416593974323145, -0.1502071702935999, -0.07434923708829697, 0.13066794179030694, -0.08301152372275412, 0.11158493279695644, 0.039261276921024546, -0.06895550511191166, -0.147625481722311, 0.3769647491904574, -0.048806451974737035, -0.1899009185934639, 0.15438688411190274, -0.1395212549250573, -0.16201893411510224, 0.12263462616621316, 0.1961362675314636, 0.1636722514522262, -0.12615136169500016, 0.10835346261800234, -0.06459062982217542, 0.1470511593340364, 0.14435468338654442, 0.021163981861069, 0.12230490679628149, 0.09779571914571404, 0.17413772766303737, 0.21261096897173307, 0.029184887281319658, 0.027597400197139774, -0.30271420382528696, -0.0682705418252486, -0.2535267612287758, 0.08301489243500068, -0.21557851673086198, -0.208159188249348, 0.4246098141447874, 0.12388610799514156, 0.2249676056048234, 0.11898366979689204, 0.19682873949100863, 0.056664995220411844, 0.1069451681562766, 0.20889901449221984, 0.08183019108920624, 0.1651264424602102, -0.06516100688895676, -0.14489619848193666, 0.05195581406171966, 0.15816668734104106] |
1,803.02889 | Towards an MDD Based Framework for Self Adaptive IoT Applications
Development | As technology and communication advances, more devices (and things) are able
to connect to the Internet and talk to each other to achieve a common goal
which results in the emergence of the Internet of Things (IoT) era. It is
believed that IoT will bring up a limitless number of applications and business
opportunities that will affect almost every aspect of our life. Research has
already been conducted to investigate the challenges that obstruct the
realization of IoT along with the promising solutions that pave the way for the
acceptance and enabling of IoT. Among the research areas that is of a great
importance to making IoT paradigm possible is the presence of a unified
programming framework that masks the heterogeneity of the involved devices of
the IoT platform. Such a framework guides system developers throughout the IoT
application development process. In this paper, we investigate the IoT concept
and its high level architecture in general and focus more on the application
development aspect. We believe that IoT applications are highly dynamic in
nature and thus need to be engineered with the self adaptive and autonomic
concepts in mind. Therefore, our proposed IoT software development lifecycle
was based on the IBM architecture blueprint for autonomic systems. To cater for
the runtime dynamic and heterogeneity aspects of IoT applications, we adopt the
MDD paradigm for our proposed development framework. We highlight the core
requirements of a resilient development framework that accommodates the
necessary concepts and processes for a successful IoT application.
| cs.SE | as technology and communication advances more devices and things are able to connect to the internet and talk to each other to achieve a common goal which results in the emergence of the internet of things iot era it is believed that iot will bring up a limitless number of applications and business opportunities that will affect almost every aspect of our life research has already been conducted to investigate the challenges that obstruct the realization of iot along with the promising solutions that pave the way for the acceptance and enabling of iot among the research areas that is of a great importance to making iot paradigm possible is the presence of a unified programming framework that masks the heterogeneity of the involved devices of the iot platform such a framework guides system developers throughout the iot application development process in this paper we investigate the iot concept and its high level architecture in general and focus more on the application development aspect we believe that iot applications are highly dynamic in nature and thus need to be engineered with the self adaptive and autonomic concepts in mind therefore our proposed iot software development lifecycle was based on the ibm architecture blueprint for autonomic systems to cater for the runtime dynamic and heterogeneity aspects of iot applications we adopt the mdd paradigm for our proposed development framework we highlight the core requirements of a resilient development framework that accommodates the necessary concepts and processes for a successful iot application | [['as', 'technology', 'and', 'communication', 'advances', 'more', 'devices', 'and', 'things', 'are', 'able', 'to', 'connect', 'to', 'the', 'internet', 'and', 'talk', 'to', 'each', 'other', 'to', 'achieve', 'a', 'common', 'goal', 'which', 'results', 'in', 'the', 'emergence', 'of', 'the', 'internet', 'of', 'things', 'iot', 'era', 'it', 'is', 'believed', 'that', 'iot', 'will', 'bring', 'up', 'a', 'limitless', 'number', 'of', 'applications', 'and', 'business', 'opportunities', 'that', 'will', 'affect', 'almost', 'every', 'aspect', 'of', 'our', 'life', 'research', 'has', 'already', 'been', 'conducted', 'to', 'investigate', 'the', 'challenges', 'that', 'obstruct', 'the', 'realization', 'of', 'iot', 'along', 'with', 'the', 'promising', 'solutions', 'that', 'pave', 'the', 'way', 'for', 'the', 'acceptance', 'and', 'enabling', 'of', 'iot', 'among', 'the', 'research', 'areas', 'that', 'is', 'of', 'a', 'great', 'importance', 'to', 'making', 'iot', 'paradigm', 'possible', 'is', 'the', 'presence', 'of', 'a', 'unified', 'programming', 'framework', 'that', 'masks', 'the', 'heterogeneity', 'of', 'the', 'involved', 'devices', 'of', 'the', 'iot', 'platform', 'such', 'a', 'framework', 'guides', 'system', 'developers', 'throughout', 'the', 'iot', 'application', 'development', 'process', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'iot', 'concept', 'and', 'its', 'high', 'level', 'architecture', 'in', 'general', 'and', 'focus', 'more', 'on', 'the', 'application', 'development', 'aspect', 'we', 'believe', 'that', 'iot', 'applications', 'are', 'highly', 'dynamic', 'in', 'nature', 'and', 'thus', 'need', 'to', 'be', 'engineered', 'with', 'the', 'self', 'adaptive', 'and', 'autonomic', 'concepts', 'in', 'mind', 'therefore', 'our', 'proposed', 'iot', 'software', 'development', 'lifecycle', 'was', 'based', 'on', 'the', 'ibm', 'architecture', 'blueprint', 'for', 'autonomic', 'systems', 'to', 'cater', 'for', 'the', 'runtime', 'dynamic', 'and', 'heterogeneity', 'aspects', 'of', 'iot', 'applications', 'we', 'adopt', 'the', 'mdd', 'paradigm', 'for', 'our', 'proposed', 'development', 'framework', 'we', 'highlight', 'the', 'core', 'requirements', 'of', 'a', 'resilient', 'development', 'framework', 'that', 'accommodates', 'the', 'necessary', 'concepts', 'and', 'processes', 'for', 'a', 'successful', 'iot', 'application']] | [-0.16057545862626285, 0.04311813570605591, -0.04892553003039211, 0.01102784765096294, -0.13333038478717207, -0.14142627046629785, 0.021398862197529525, 0.3677268383949995, -0.24235667763277888, -0.31601121749356387, 0.1269633207404986, -0.2364169207010418, -0.24392925619333983, 0.24768349457532168, -0.1131966492496431, 0.054659621286904436, 0.06604198767757043, -0.014236236871220172, 0.008347568459575995, -0.25527491214498876, 0.30300089667364954, 0.06120846065878868, 0.39029333559144286, 0.11115470324922352, 0.04802051549404859, -0.020067458130419255, -0.014656260516494513, -0.03208043847233057, -0.0832114848990459, 0.21303347705909984, 0.35928446469455955, 0.2273659450116975, 0.3775571991503239, -0.46116970755846703, -0.204303844015114, 0.06522816933505238, 0.16412211039476096, 0.056610269440338014, -0.10248117527418071, -0.3021994591988623, 0.14299244636204095, -0.24123598369490357, -0.1669375870617805, -0.07643260820629075, 0.03336661736038513, 0.018365113022737203, -0.2197571393805556, -0.07657198952231556, 0.016066421668976545, 0.015138734878040851, -0.04143221750680823, -0.060592092097736895, 0.030681177845224738, 0.17989441815321333, 0.03480830042657908, -0.002949643378262408, 0.18196313849999568, -0.16061729806568473, -0.1495658986698836, 0.389001399949193, 0.03482844949606806, -0.12832829930633308, 0.2045884273950942, -0.03878321777284145, -0.19941131934337317, 0.03874743396416307, 0.2249660057667643, 0.04740933156525716, -0.19816214471310378, 0.058022934834705664, 0.07482067499309779, 0.1429448264548555, -0.01176473797718063, 0.08790037690591998, 0.24761194970551878, 0.2819831896927208, 0.11065849177911878, 0.10198914646240882, -0.02033690015040338, -0.12845526461792178, -0.24384710840508342, -0.2202373875901103, -0.12957188539160416, -0.0036230564434081318, -0.047744373222172724, -0.12970235665887594, 0.3896272052880377, 0.26869725577160714, 0.11594482465647162, 0.029536534813698383, 0.3674113012105227, 0.01429876218456775, 0.13890233033243568, 0.0794895562781021, 0.17828654474951328, 0.04939688247162849, 0.2329567203577608, -0.14931041166000067, 0.10643422133056447, -0.037108140538446605] |
1,803.0289 | Challenges: Bridge between Cloud and IoT | In the real time processing, a new emerging technology where the need of
connecting smart devices with cloud through Internet has raised. IoT devices
processed information is to be stored and accessed anywhere needed with a
support of powerful computing performance, efficient storage infrastructure for
heterogeneous systems and software which configures and controls these
different devices. A lot of challenges to be addressed are listed with this new
emerging technology as it needs to be compatible with the upcoming 5G wireless
devices too. In this paper, the benefits and challenges of this innovative
paradigm along with the areas open to do research are shown.
| cs.SE cs.CY | in the real time processing a new emerging technology where the need of connecting smart devices with cloud through internet has raised iot devices processed information is to be stored and accessed anywhere needed with a support of powerful computing performance efficient storage infrastructure for heterogeneous systems and software which configures and controls these different devices a lot of challenges to be addressed are listed with this new emerging technology as it needs to be compatible with the upcoming 5g wireless devices too in this paper the benefits and challenges of this innovative paradigm along with the areas open to do research are shown | [['in', 'the', 'real', 'time', 'processing', 'a', 'new', 'emerging', 'technology', 'where', 'the', 'need', 'of', 'connecting', 'smart', 'devices', 'with', 'cloud', 'through', 'internet', 'has', 'raised', 'iot', 'devices', 'processed', 'information', 'is', 'to', 'be', 'stored', 'and', 'accessed', 'anywhere', 'needed', 'with', 'a', 'support', 'of', 'powerful', 'computing', 'performance', 'efficient', 'storage', 'infrastructure', 'for', 'heterogeneous', 'systems', 'and', 'software', 'which', 'configures', 'and', 'controls', 'these', 'different', 'devices', 'a', 'lot', 'of', 'challenges', 'to', 'be', 'addressed', 'are', 'listed', 'with', 'this', 'new', 'emerging', 'technology', 'as', 'it', 'needs', 'to', 'be', 'compatible', 'with', 'the', 'upcoming', '5g', 'wireless', 'devices', 'too', 'in', 'this', 'paper', 'the', 'benefits', 'and', 'challenges', 'of', 'this', 'innovative', 'paradigm', 'along', 'with', 'the', 'areas', 'open', 'to', 'do', 'research', 'are', 'shown']] | [-0.1830418709690163, 0.08638906947677381, -0.004894285135938285, -0.011080175013585877, -0.12625090858021465, -0.21395136008057028, 0.032072210432558604, 0.3892338967953737, -0.3078462450335232, -0.3461282418396037, 0.1642634593501078, -0.2666330890586743, -0.14838819857239008, 0.2649066772215659, -0.1263705444199821, 0.08837489440562561, 0.06537521234713495, -0.012234843631561559, 0.0017635548496260666, -0.25965827798399216, 0.25974049736620286, 0.06308325213523439, 0.3628928002793915, 0.11084959600031233, 0.02097466005048213, -0.06700161128425791, -0.0464810034340749, -0.011268790224746156, -0.05019664575789088, 0.24656299674489462, 0.3980420690853722, 0.1921287988885664, 0.33973479562421116, -0.5071321721726025, -0.2350362600901952, 0.0865584713129255, 0.19965072199164963, 0.033743998863008946, -0.11608682899700049, -0.30492829965526025, 0.14439328553047603, -0.2362867671125479, -0.151713809051636, -0.051301598669782, 0.01265796200067808, 0.06168473862971251, -0.22790664085634768, -0.06417782644991978, -0.0705517350579612, 0.0425497932995383, -0.002224520782944567, -0.05566282432902461, 0.038340980641525954, 0.1880264354448837, 0.00681392556333986, 0.031393725737311445, 0.1493969164842453, -0.1335496912249185, -0.13655460187986207, 0.4007310019268726, 0.0556789086795806, -0.13351819974979243, 0.1673397171801368, -0.034647317616663016, -0.1603964292265188, 0.05804638871240268, 0.20815522191472924, 0.023013170619938485, -0.21467358913706938, 0.06558882391142945, 0.07812948158243671, 0.13490104845102627, 0.010617451831841698, 0.10872894405530623, 0.28568570656352676, 0.23777562476551303, 0.09933543240857454, 0.1040181557014316, -0.03181574567973327, -0.1002542773494497, -0.22561424273925906, -0.18671678221569613, -0.1932943990798846, 0.03807670082628297, -0.009674277467218837, -0.12544217420145287, 0.32722776245254165, 0.21429662297976812, 0.1325605979610163, -0.0365985470315746, 0.408195714179713, 0.05778645537681699, 0.18821118116522065, 0.14463480019744915, 0.14650368156771248, 0.017343129210460644, 0.267729069894323, -0.0815517947015066, 0.07015582846585088, -0.08516627538931341] |
1,803.02891 | Improving Privacy and Trust in Federated Identity Using SAML with Hash
Based Encryption Algorithm | Cloud computing is an upcoming technology that has been designed for
commercial needs. One of the major issues in cloud computing is the difficulty
to manage federated identities and the trust between the user and the service
providers. This paper focuses on how security can be provided between the user
and the service provider and how the user information can be authenticated. For
the purpose of providing privacy and authentication, Security Assertion Markup
Language (SAML) based Single Sign-On is used. Security is provided by using
Hash based Encryption algorithm (HBE). HBE algorithm works with the help of Key
Exchange Protocol which contains poly hash function. In the algorithm, Identity
providers maintain user directory and authenticates user information; service
provider provides the service to users. The user has to register their details
with the identity provider prior to this. During this stage, Hash based
Encryption algorithm is used to provide secure communication between the
identity provider and the user. In this paper we suggest that higher security
can be given to user login by using an additional cryptographic technique, i.e.
Hash based Encryption algorithm with the help of the Key Exchange Protocol.
| cs.CR | cloud computing is an upcoming technology that has been designed for commercial needs one of the major issues in cloud computing is the difficulty to manage federated identities and the trust between the user and the service providers this paper focuses on how security can be provided between the user and the service provider and how the user information can be authenticated for the purpose of providing privacy and authentication security assertion markup language saml based single signon is used security is provided by using hash based encryption algorithm hbe hbe algorithm works with the help of key exchange protocol which contains poly hash function in the algorithm identity providers maintain user directory and authenticates user information service provider provides the service to users the user has to register their details with the identity provider prior to this during this stage hash based encryption algorithm is used to provide secure communication between the identity provider and the user in this paper we suggest that higher security can be given to user login by using an additional cryptographic technique ie hash based encryption algorithm with the help of the key exchange protocol | [['cloud', 'computing', 'is', 'an', 'upcoming', 'technology', 'that', 'has', 'been', 'designed', 'for', 'commercial', 'needs', 'one', 'of', 'the', 'major', 'issues', 'in', 'cloud', 'computing', 'is', 'the', 'difficulty', 'to', 'manage', 'federated', 'identities', 'and', 'the', 'trust', 'between', 'the', 'user', 'and', 'the', 'service', 'providers', 'this', 'paper', 'focuses', 'on', 'how', 'security', 'can', 'be', 'provided', 'between', 'the', 'user', 'and', 'the', 'service', 'provider', 'and', 'how', 'the', 'user', 'information', 'can', 'be', 'authenticated', 'for', 'the', 'purpose', 'of', 'providing', 'privacy', 'and', 'authentication', 'security', 'assertion', 'markup', 'language', 'saml', 'based', 'single', 'signon', 'is', 'used', 'security', 'is', 'provided', 'by', 'using', 'hash', 'based', 'encryption', 'algorithm', 'hbe', 'hbe', 'algorithm', 'works', 'with', 'the', 'help', 'of', 'key', 'exchange', 'protocol', 'which', 'contains', 'poly', 'hash', 'function', 'in', 'the', 'algorithm', 'identity', 'providers', 'maintain', 'user', 'directory', 'and', 'authenticates', 'user', 'information', 'service', 'provider', 'provides', 'the', 'service', 'to', 'users', 'the', 'user', 'has', 'to', 'register', 'their', 'details', 'with', 'the', 'identity', 'provider', 'prior', 'to', 'this', 'during', 'this', 'stage', 'hash', 'based', 'encryption', 'algorithm', 'is', 'used', 'to', 'provide', 'secure', 'communication', 'between', 'the', 'identity', 'provider', 'and', 'the', 'user', 'in', 'this', 'paper', 'we', 'suggest', 'that', 'higher', 'security', 'can', 'be', 'given', 'to', 'user', 'login', 'by', 'using', 'an', 'additional', 'cryptographic', 'technique', 'ie', 'hash', 'based', 'encryption', 'algorithm', 'with', 'the', 'help', 'of', 'the', 'key', 'exchange', 'protocol']] | [-0.17995623602892677, -0.07550886834996597, -0.11843234405935747, 0.04661517419440291, -0.12396053655355857, -0.29416001849553025, 0.12623863203660707, 0.408806732260861, -0.29532153704033004, -0.3406776476904984, 0.08538226855989467, -0.2775013323249149, -0.11781602687841154, 0.1622023589236184, -0.16503728077690855, 0.10868435463726676, -0.0072150053767272865, 0.037312498612540254, 0.03282995732545033, -0.35438438093397007, 0.34377157571603645, 0.09179345400350568, 0.3271411787864815, 0.12111426609768215, 0.02690394681083594, 0.04064405760703443, -0.039322927535672465, -0.1281950646689581, -0.062280421159050366, 0.17556601679147615, 0.33810344562470834, 0.30294213181785773, 0.3346570828412684, -0.4224313214465157, -0.0715364583412, 0.046239020056651994, 0.16314306598966113, 0.05749222597153614, -0.0960246889653289, -0.32798172920547347, 0.14333160049787902, -0.29290880295521143, -0.03490650226576595, -0.05430720826727948, -0.08123884814259894, 0.052974826481787536, -0.3088658442617155, -0.06870018851246042, -0.026495538261860452, 0.06597656621329526, 0.023250042256065376, -0.0023494527811740392, -0.005889750959800254, 0.24261023400166115, 0.031074618803659033, 0.03988600051803368, 0.1738558707731966, -0.09621359197729443, -0.15628389506332616, 0.40433019600535564, 0.030273327996456965, -0.1584858693699328, 0.10717549860594472, 0.004543528755570894, -0.16725819176111703, 0.07683615820178841, 0.1910868222966634, 0.01952093908641273, -0.22178171853490994, 0.037894852152545275, -0.03460347938292821, 0.2561030686584287, 0.06495131786512845, 0.06493814587495558, 0.17078978086807106, 0.17361585728102485, 0.09961081620492285, 0.12531714371822442, -0.014194813172981454, -0.09669756509987784, -0.18019567375895396, -0.20190637150544097, -0.2143485587558353, -0.01637863247357894, -0.08141809722345568, -0.10617831210680159, 0.3574733020864544, 0.22881937006620096, 0.08061808358916905, 0.03724123256498002, 0.4427625067795368, 0.05063186515078768, 0.1286545553334857, 0.18378056672094537, 0.09667956694004891, -0.029868720076168784, 0.2326993912638833, -0.11894555032711612, 0.23356583085232926, 0.0610837510138438] |
1,803.02892 | Link cobordism and the intersection of slice discs | It is well-known that all 2-knots are slice. Are all 2-links slice? This is
an outstanding open question. In this paper we prove the following: For any
2-component 2-link (J,K)in the 4-sphere which bounds the 5-ball B^5, there is
an embedded disc 2-disc D^2_J (respectively, D^2_K) in B^5 with the following
properties: J (respectively K) bounds D^2_J (respectively, D^2_K).
D^2_J and D^2_K intersect transversely. the intersection of D^2_J and D^2_K
in D^2_J (respectively, D^2_K) is a trivial 1-knot.
| math.GT | it is wellknown that all 2knots are slice are all 2links slice this is an outstanding open question in this paper we prove the following for any 2component 2link jkin the 4sphere which bounds the 5ball b5 there is an embedded disc 2disc d2_j respectively d2_k in b5 with the following properties j respectively k bounds d2_j respectively d2_k d2_j and d2_k intersect transversely the intersection of d2_j and d2_k in d2_j respectively d2_k is a trivial 1knot | [['it', 'is', 'wellknown', 'that', 'all', '2knots', 'are', 'slice', 'are', 'all', '2links', 'slice', 'this', 'is', 'an', 'outstanding', 'open', 'question', 'in', 'this', 'paper', 'we', 'prove', 'the', 'following', 'for', 'any', '2component', '2link', 'jkin', 'the', '4sphere', 'which', 'bounds', 'the', '5ball', 'b5', 'there', 'is', 'an', 'embedded', 'disc', '2disc', 'd2_j', 'respectively', 'd2_k', 'in', 'b5', 'with', 'the', 'following', 'properties', 'j', 'respectively', 'k', 'bounds', 'd2_j', 'respectively', 'd2_k', 'd2_j', 'and', 'd2_k', 'intersect', 'transversely', 'the', 'intersection', 'of', 'd2_j', 'and', 'd2_k', 'in', 'd2_j', 'respectively', 'd2_k', 'is', 'a', 'trivial', '1knot']] | [-0.20841822762332565, 0.11110048773494403, -0.03512199133840184, 0.03639951198627906, -0.035099805973760494, -0.1583366262387823, -0.038902435776801754, 0.379484538956509, -0.21283636689367522, -0.20654194217247815, 0.11418690176245261, -0.3073590360581875, -0.08887459729592521, 0.17346573651877123, -0.11383478221326292, -0.05698928384521565, -0.002553748075741452, 0.00622449357776189, -0.023127620000325675, -0.26905427880391675, 0.29378160689171257, -0.09567132526282947, 0.14425402719946276, 0.10218220167224865, 0.04621696579511967, 0.0008867747186646833, 0.03503687601754224, -0.028294169852002102, -0.21919982872236982, 0.08691198360734292, 0.22874301865503385, 0.0759982609268665, 0.15425177482440583, -0.29494355604439587, -0.09636740358667327, 0.1540783472818794, 0.1579525704773796, -0.02954276201962312, 0.01602135166562126, -0.22069088681661464, 0.17184878403151577, -0.08338218123966513, -0.12226064683409868, 0.011744884798279056, 0.07163715531880205, -0.0008383574472232299, -0.18417508460508733, 0.0137179588850636, 0.13945511878504382, 0.0848455670132459, -0.04892971928158848, -0.14118173936164224, -0.06781321956304373, 0.0882314104623125, -0.013650418153371324, 0.1548540830648468, 0.02347017697651278, -0.0765146265931234, -0.09568008010626419, 0.32030980784881424, -0.040294336572337844, -0.19275265317652132, 0.1331625708814275, -0.12467342922343062, -0.19356979042678685, 0.10605468414119118, 0.03939798241481185, 0.15055445429276337, -0.07695829058549815, 0.16949858050642222, -0.16828949297113077, 0.08628555665294603, 0.12590894136916508, -0.055822777059896814, 0.1519038203813426, 0.0527334877580114, 0.07913543460678986, 0.12808424984286357, -0.055943358108981864, -0.014059233914625335, -0.28718324228607167, -0.2033538038104579, -0.08302556433376264, 0.0915609427860805, -0.0648469127674569, -0.12310106817378917, 0.32469726021722106, 0.04645587434363249, 0.20509522728767102, 0.06193144987307053, 0.25187833522531117, 0.0368285354275208, -0.005129405502955635, 0.22691186673503805, 0.17535185702628903, 0.15357666895059602, -0.021492196005079654, -0.11544121465609446, -0.05086586185331855, 0.10194423629043552] |
1,803.02893 | An efficient framework for learning sentence representations | In this work we propose a simple and efficient framework for learning
sentence representations from unlabelled data. Drawing inspiration from the
distributional hypothesis and recent work on learning sentence representations,
we reformulate the problem of predicting the context in which a sentence
appears as a classification problem. Given a sentence and its context, a
classifier distinguishes context sentences from other contrastive sentences
based on their vector representations. This allows us to efficiently learn
different types of encoding functions, and we show that the model learns
high-quality sentence representations. We demonstrate that our sentence
representations outperform state-of-the-art unsupervised and supervised
representation learning methods on several downstream NLP tasks that involve
understanding sentence semantics while achieving an order of magnitude speedup
in training time.
| cs.CL cs.AI cs.LG | in this work we propose a simple and efficient framework for learning sentence representations from unlabelled data drawing inspiration from the distributional hypothesis and recent work on learning sentence representations we reformulate the problem of predicting the context in which a sentence appears as a classification problem given a sentence and its context a classifier distinguishes context sentences from other contrastive sentences based on their vector representations this allows us to efficiently learn different types of encoding functions and we show that the model learns highquality sentence representations we demonstrate that our sentence representations outperform stateoftheart unsupervised and supervised representation learning methods on several downstream nlp tasks that involve understanding sentence semantics while achieving an order of magnitude speedup in training time | [['in', 'this', 'work', 'we', 'propose', 'a', 'simple', 'and', 'efficient', 'framework', 'for', 'learning', 'sentence', 'representations', 'from', 'unlabelled', 'data', 'drawing', 'inspiration', 'from', 'the', 'distributional', 'hypothesis', 'and', 'recent', 'work', 'on', 'learning', 'sentence', 'representations', 'we', 'reformulate', 'the', 'problem', 'of', 'predicting', 'the', 'context', 'in', 'which', 'a', 'sentence', 'appears', 'as', 'a', 'classification', 'problem', 'given', 'a', 'sentence', 'and', 'its', 'context', 'a', 'classifier', 'distinguishes', 'context', 'sentences', 'from', 'other', 'contrastive', 'sentences', 'based', 'on', 'their', 'vector', 'representations', 'this', 'allows', 'us', 'to', 'efficiently', 'learn', 'different', 'types', 'of', 'encoding', 'functions', 'and', 'we', 'show', 'that', 'the', 'model', 'learns', 'highquality', 'sentence', 'representations', 'we', 'demonstrate', 'that', 'our', 'sentence', 'representations', 'outperform', 'stateoftheart', 'unsupervised', 'and', 'supervised', 'representation', 'learning', 'methods', 'on', 'several', 'downstream', 'nlp', 'tasks', 'that', 'involve', 'understanding', 'sentence', 'semantics', 'while', 'achieving', 'an', 'order', 'of', 'magnitude', 'speedup', 'in', 'training', 'time']] | [0.009613911682342897, -0.01955577407734083, -0.091586318989208, 0.10218981488371176, -0.2079602482988209, -0.1500920338754649, 0.06873894618732519, 0.4803870776935374, -0.32656620973415795, -0.30976117025205835, -0.024843214181839626, -0.28681742882971045, -0.1839024263212732, 0.18921004068504801, -0.13019796245594006, 0.07151677068198847, 0.16413507499106106, 0.1225493470489307, -0.10552621528231462, -0.2915170561354302, 0.3446909003398671, -0.02194221403266563, 0.36786863993525076, -0.009467702712023967, 0.19799225935120837, -0.025107391672895947, -0.04264062720152442, -0.0719798556987013, -0.036353276761429534, 0.2273026685417462, 0.41612569950368317, 0.2439975729975544, 0.3444780962232531, -0.382355076219356, -0.22651887137717644, 0.10083324545383697, 0.13547617829114686, 0.16005856696550627, -0.007350451831102799, -0.3628092717969042, 0.06271385290415683, -0.1533680851972036, 0.15100585634545347, -0.18617177838958193, -0.03833661560869974, -0.07239200620669642, -0.27542260002543323, 0.01586054946815015, 0.20014798798460942, 0.06893443280342416, -0.08989235836789242, -0.10416199044385528, 0.0766216624150297, 0.13978445952468108, 0.04789324890971031, 0.1298011836641636, 0.10669514318674299, -0.2290077722162871, -0.22365473229896093, 0.3706345229073748, -0.06854707916881736, -0.22501068558452314, 0.19965359182516876, -0.004033996311367535, -0.1950297161868056, 0.03292813833009024, 0.2521821784970091, 0.13253311092438574, -0.13726980173693146, 0.028801656320030785, -0.08772558889153306, 0.19879918966965263, 0.10242815940930951, -0.021397065466697344, 0.20075702293419095, 0.26808261530870786, -0.04412261171067958, 0.16683466730259558, -0.06428189223945202, -0.031651958639993046, -0.22595533134690562, -0.10340471350450496, -0.16371852289847114, -0.061043625040987474, -0.13280948189592473, -0.13932681689957313, 0.4403920478538656, 0.27961959653213375, 0.23320342869818456, 0.21686472451470823, 0.31357721718730497, 0.02746643800456382, 0.08576667074068281, 0.11634619755968147, 0.08629403729373436, 0.010830049107202375, 0.09459866262918919, -0.1231735014971193, 0.11883092352063165, 0.12280854653399133] |
1,803.02894 | RHIP, a Radio-controlled High-Voltage Insulated Picoammeter and its
usage in studying ion backflow in MPGD-based photon detectors | A picoammeter system has been developed and engineering. It consists in a
current-voltage converter, based on an operational amplifier with very low
input current, a high precision ADC, a radio controlled data acquisition unit
and the computer-based control, visualization and storage. The precision is of
the order of a tenth of picoampers and it can measure currents between
electrodes at potentials up to 8 kV. The system is battery powered and a number
of strategies have been implemented to limit the power consumption. The system
is designed for multichannel applications, up to 256 parallel channels. The
overall implementation is cost-effective to make the availability of
multichannel setups easily affordable. The design, implementation and
performance of the picoammeter system are described in detail as well as a an
application: the measurement of ion backflow in MPGD-based photon detectors.
| physics.ins-det hep-ex nucl-ex | a picoammeter system has been developed and engineering it consists in a currentvoltage converter based on an operational amplifier with very low input current a high precision adc a radio controlled data acquisition unit and the computerbased control visualization and storage the precision is of the order of a tenth of picoampers and it can measure currents between electrodes at potentials up to 8 kv the system is battery powered and a number of strategies have been implemented to limit the power consumption the system is designed for multichannel applications up to 256 parallel channels the overall implementation is costeffective to make the availability of multichannel setups easily affordable the design implementation and performance of the picoammeter system are described in detail as well as a an application the measurement of ion backflow in mpgdbased photon detectors | [['a', 'picoammeter', 'system', 'has', 'been', 'developed', 'and', 'engineering', 'it', 'consists', 'in', 'a', 'currentvoltage', 'converter', 'based', 'on', 'an', 'operational', 'amplifier', 'with', 'very', 'low', 'input', 'current', 'a', 'high', 'precision', 'adc', 'a', 'radio', 'controlled', 'data', 'acquisition', 'unit', 'and', 'the', 'computerbased', 'control', 'visualization', 'and', 'storage', 'the', 'precision', 'is', 'of', 'the', 'order', 'of', 'a', 'tenth', 'of', 'picoampers', 'and', 'it', 'can', 'measure', 'currents', 'between', 'electrodes', 'at', 'potentials', 'up', 'to', '8', 'kv', 'the', 'system', 'is', 'battery', 'powered', 'and', 'a', 'number', 'of', 'strategies', 'have', 'been', 'implemented', 'to', 'limit', 'the', 'power', 'consumption', 'the', 'system', 'is', 'designed', 'for', 'multichannel', 'applications', 'up', 'to', '256', 'parallel', 'channels', 'the', 'overall', 'implementation', 'is', 'costeffective', 'to', 'make', 'the', 'availability', 'of', 'multichannel', 'setups', 'easily', 'affordable', 'the', 'design', 'implementation', 'and', 'performance', 'of', 'the', 'picoammeter', 'system', 'are', 'described', 'in', 'detail', 'as', 'well', 'as', 'a', 'an', 'application', 'the', 'measurement', 'of', 'ion', 'backflow', 'in', 'mpgdbased', 'photon', 'detectors']] | [-0.14947456541395857, 0.06338204693597885, -0.03375995608032955, -0.016399482162395382, -0.022051042392644483, -0.1896771198063267, 0.03337738554246778, 0.3921120213618612, -0.2282494437565808, -0.3591144274636035, 0.14436939099259155, -0.27715876540648476, -0.05448886934969136, 0.27583426588749077, -0.07626132605775424, 0.10856973833185346, 0.05802546714938431, 0.017052405866492978, -0.04183480008235646, -0.2044827808627708, 0.20198405568953604, 0.1438872464487384, 0.339927814229775, 0.05868491974166211, 0.1588072332986699, -0.034169309954022, 0.015228527539875358, -0.016050510479972753, -0.02669942202149233, 0.10893595568931606, 0.2783712124287644, 0.11339275678277344, 0.25156249873586656, -0.4283710154978668, -0.1788211950676187, 0.03651299726163201, 0.11834556616582524, 0.07363205165465307, -0.06868456963275094, -0.2350680873838856, 0.09220979518517304, -0.23764131052816725, -0.09942337788422317, -0.06971867735196344, 0.0138983785526601, 0.04438906795557534, -0.27865495789891986, -0.021888578878989554, -0.0126670509147088, 0.06288829617722727, -0.0213683752962799, -0.0888395354952937, 0.034854324423256054, 0.13720128795145736, -0.07119862141210914, 0.023065178468481034, 0.16611953017384032, -0.12384512641823248, -0.11447179784162846, 0.3561247368993731, -0.0278324688971385, -0.19790415320655003, 0.1981129185656113, -0.09180414868409142, -0.06605564361534026, 0.13951118590621797, 0.1933004307656494, 0.04979667515041964, -0.20986503243501134, 0.0579454623745786, 0.05789724325158579, 0.21153447209307535, 0.05547818321536076, 0.05505324061446385, 0.19135461669921985, 0.2807139892898062, 0.0723481656429666, 0.15559096628663505, -0.12837307300993844, -0.02520006471176577, -0.2728665826143697, -0.1669770494199303, -0.1843040623318623, 0.037312376388239074, -0.013908265115092303, -0.11115319248603876, 0.3969937504751429, 0.13709648429101115, 0.1331999704159577, -0.006594937527552247, 0.38251443645533395, 0.13321372423396335, 0.11410135641670101, 0.05553442373981371, 0.2038670232766034, 0.13672018513727166, 0.18469573050285415, -0.21951722957686903, 0.037705552805324685, -0.03032228202723405] |
1,803.02895 | MCP detector development for UV space missions | We are developing imaging and photon counting UV-MCP detectors, which are
sensitive in the wavelength range from far ultraviolet to near ultraviolet. A
good quantum efficiency, solar blindness and high spatial resolution is the aim
of our development. The sealed detector has a Cs-activated photoactive layer of
GaN (or similarly advanced photocathode), which is operated in semitransparent
mode on (001)-MgF 2 . The detector comprises a stack of two long-life MCPs and
a coplanar cross strip anode with advanced readout electronics. The main
challenge is the flawless growth of the GaN photocathode layer as well as the
requirements for the sealing of the detector, to prevent a degradation of the
photocathode. We present here the detector concept and the experimental setup,
examine in detail the status in the production and describe the current status
of the readout electronics development.
| physics.ins-det astro-ph.IM | we are developing imaging and photon counting uvmcp detectors which are sensitive in the wavelength range from far ultraviolet to near ultraviolet a good quantum efficiency solar blindness and high spatial resolution is the aim of our development the sealed detector has a csactivated photoactive layer of gan or similarly advanced photocathode which is operated in semitransparent mode on 001mgf 2 the detector comprises a stack of two longlife mcps and a coplanar cross strip anode with advanced readout electronics the main challenge is the flawless growth of the gan photocathode layer as well as the requirements for the sealing of the detector to prevent a degradation of the photocathode we present here the detector concept and the experimental setup examine in detail the status in the production and describe the current status of the readout electronics development | [['we', 'are', 'developing', 'imaging', 'and', 'photon', 'counting', 'uvmcp', 'detectors', 'which', 'are', 'sensitive', 'in', 'the', 'wavelength', 'range', 'from', 'far', 'ultraviolet', 'to', 'near', 'ultraviolet', 'a', 'good', 'quantum', 'efficiency', 'solar', 'blindness', 'and', 'high', 'spatial', 'resolution', 'is', 'the', 'aim', 'of', 'our', 'development', 'the', 'sealed', 'detector', 'has', 'a', 'csactivated', 'photoactive', 'layer', 'of', 'gan', 'or', 'similarly', 'advanced', 'photocathode', 'which', 'is', 'operated', 'in', 'semitransparent', 'mode', 'on', '001mgf', '2', 'the', 'detector', 'comprises', 'a', 'stack', 'of', 'two', 'longlife', 'mcps', 'and', 'a', 'coplanar', 'cross', 'strip', 'anode', 'with', 'advanced', 'readout', 'electronics', 'the', 'main', 'challenge', 'is', 'the', 'flawless', 'growth', 'of', 'the', 'gan', 'photocathode', 'layer', 'as', 'well', 'as', 'the', 'requirements', 'for', 'the', 'sealing', 'of', 'the', 'detector', 'to', 'prevent', 'a', 'degradation', 'of', 'the', 'photocathode', 'we', 'present', 'here', 'the', 'detector', 'concept', 'and', 'the', 'experimental', 'setup', 'examine', 'in', 'detail', 'the', 'status', 'in', 'the', 'production', 'and', 'describe', 'the', 'current', 'status', 'of', 'the', 'readout', 'electronics', 'development']] | [-0.0747695852847149, 0.11743027690660071, -0.01723010499306299, -0.013549876082861036, -0.003438592012281771, -0.15015966798075372, -0.005079951652981065, 0.3938496520915241, -0.1854395903646946, -0.345910371163929, 0.1323001985921076, -0.32955056407523375, -0.06786960937876116, 0.20546007364539912, -0.09886348365150668, 0.10227662565885112, 0.06887662431000974, -0.02255619587721648, -0.036514071606237576, -0.1745403838309425, 0.2438232761428312, 0.1477208967484465, 0.3502907973265758, 0.07110263520023889, 0.13781939971571167, -0.007902571096740387, -0.010015130801454048, -0.05448237531301048, -0.10374144072885867, 0.09720314242747716, 0.29676446925020883, 0.08430279904062411, 0.22822267154438627, -0.47039123220300233, -0.1773478140985524, 0.011077289438496033, 0.08949232540541777, 0.06006962377405553, -0.1105868987230308, -0.23343742745066132, 0.09013844842988032, -0.17729455497529772, -0.11417807617604181, 0.03921221618592325, -0.06643261801865366, 0.012899594766484505, -0.21225696387873202, -0.0415367875593128, 0.014376623505140068, 0.03721866381216656, -0.02426707520218635, -0.08666097114759463, -0.0033737915550807007, 0.09681402841686375, -0.04781897911474247, 0.027340200479590782, 0.2258019677018402, -0.17317453967062413, -0.08283616553612605, 0.304816530766968, -0.044004024544523825, -0.12527603247521998, 0.19335524444640786, -0.17634943162470504, -0.02095622166266872, 0.14578538377665812, 0.17518507235390307, 0.10038566955330747, -0.18262582780724324, 0.0503267165527817, 0.07293478281202692, 0.18516922903385152, 0.08765788912186744, 0.10489805099312906, 0.2225532289111504, 0.32363475339349224, 0.05264190843811742, 0.15445559382766347, -0.2089974044253015, -0.023381719648562095, -0.335383109672478, -0.2204791253156684, -0.13334723685898267, 0.043683162724806206, 0.005771121904103051, -0.17131215271850428, 0.42359365667733884, 0.1357285734783444, 0.13713653316997268, -0.03633451343307065, 0.36423479299992323, 0.033071168725102865, 0.11907548621917764, -0.028229158071594106, 0.3204283851276462, 0.1029954760024945, 0.16231103615783568, -0.202686518256518, 0.054814692020968156, -0.016469770864825005] |
1,803.02896 | A Robustness Measure of Transient Stability under Operational
Constraints in Power Systems | The aggressive integration of distributed renewable sources is changing the
dynamics of the electric power grid in an unexpected manner. As a result,
maintaining conventional performance specifications, such as transient
stability, may not be sufficient to ensure its reliable operation in stressed
conditions. In this paper, we introduce a novel criteria in transient stability
with consideration of operational constraints over frequency deviation and
angular separation. In addition, we provide a robustness measure of the region
of attraction, which can quantify the ability of the post-fault system to
remain synchronized even under disturbances. To assess this new stability
specification, we adopt the notion of Input-to-State Stability (ISS) to the
context of power systems and introduce a new class of convex Lyapunov
functions, which will result in tractable convex-optimization-based stability
certificates. As a result, we are able to quantify the level of disturbance a
power system can withstand while maintaining its safe operation. We illustrate
the introduced stability specification and certificate on the IEEE 9 bus
system.
| math.OC | the aggressive integration of distributed renewable sources is changing the dynamics of the electric power grid in an unexpected manner as a result maintaining conventional performance specifications such as transient stability may not be sufficient to ensure its reliable operation in stressed conditions in this paper we introduce a novel criteria in transient stability with consideration of operational constraints over frequency deviation and angular separation in addition we provide a robustness measure of the region of attraction which can quantify the ability of the postfault system to remain synchronized even under disturbances to assess this new stability specification we adopt the notion of inputtostate stability iss to the context of power systems and introduce a new class of convex lyapunov functions which will result in tractable convexoptimizationbased stability certificates as a result we are able to quantify the level of disturbance a power system can withstand while maintaining its safe operation we illustrate the introduced stability specification and certificate on the ieee 9 bus system | [['the', 'aggressive', 'integration', 'of', 'distributed', 'renewable', 'sources', 'is', 'changing', 'the', 'dynamics', 'of', 'the', 'electric', 'power', 'grid', 'in', 'an', 'unexpected', 'manner', 'as', 'a', 'result', 'maintaining', 'conventional', 'performance', 'specifications', 'such', 'as', 'transient', 'stability', 'may', 'not', 'be', 'sufficient', 'to', 'ensure', 'its', 'reliable', 'operation', 'in', 'stressed', 'conditions', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'novel', 'criteria', 'in', 'transient', 'stability', 'with', 'consideration', 'of', 'operational', 'constraints', 'over', 'frequency', 'deviation', 'and', 'angular', 'separation', 'in', 'addition', 'we', 'provide', 'a', 'robustness', 'measure', 'of', 'the', 'region', 'of', 'attraction', 'which', 'can', 'quantify', 'the', 'ability', 'of', 'the', 'postfault', 'system', 'to', 'remain', 'synchronized', 'even', 'under', 'disturbances', 'to', 'assess', 'this', 'new', 'stability', 'specification', 'we', 'adopt', 'the', 'notion', 'of', 'inputtostate', 'stability', 'iss', 'to', 'the', 'context', 'of', 'power', 'systems', 'and', 'introduce', 'a', 'new', 'class', 'of', 'convex', 'lyapunov', 'functions', 'which', 'will', 'result', 'in', 'tractable', 'convexoptimizationbased', 'stability', 'certificates', 'as', 'a', 'result', 'we', 'are', 'able', 'to', 'quantify', 'the', 'level', 'of', 'disturbance', 'a', 'power', 'system', 'can', 'withstand', 'while', 'maintaining', 'its', 'safe', 'operation', 'we', 'illustrate', 'the', 'introduced', 'stability', 'specification', 'and', 'certificate', 'on', 'the', 'ieee', '9', 'bus', 'system']] | [-0.20359508359635417, 0.04860439223570707, -0.08468468929217621, 0.046041276454784424, -0.03707256438916154, -0.12395621594606024, 0.08626882854750323, 0.33926245743465244, -0.2933701548951142, -0.3137394990913118, 0.15593731627150467, -0.1858239192471515, -0.12892201595911473, 0.1810859642912295, -0.16343063467594965, 0.09755576382828594, 0.03108627166895365, -0.006224628057944673, -0.04704184731553224, -0.2064992226321589, 0.2688637012735743, 0.10375670694435636, 0.29176324249499225, 0.04462676900081781, 0.08481675923773736, -0.02044722068998398, 0.012038866435283456, 0.05022869259119034, -0.09985276533460075, 0.09439052117311142, 0.24501550932781715, 0.16558679525853331, 0.330427991903641, -0.40192803916606035, -0.16975597571440493, 0.11731998567525861, 0.09393211111680351, 0.06477763628530683, -0.02265179723520608, -0.2798270688928438, 0.12458110851320353, -0.21685314028890748, -0.16727027871758873, -0.13621169190402282, -0.029453711762008342, 0.07505424561113062, -0.30786766561143325, 0.028005688671361318, 0.09452570818195288, 0.05429398469824457, -0.08355778938752007, -0.014012777374238904, -0.04182637021312434, 0.13496196092191068, 0.017397182045335118, -0.04240541832264033, 0.15518488780750583, -0.0941206201544088, -0.09976637717900855, 0.37104586807051393, -0.040417381008967024, -0.2087069672955708, 0.1967334652714657, -0.10218606777771404, -0.13788035508583893, 0.10471621508230314, 0.23011678155285842, 0.07106877350333062, -0.1874125407747642, 0.042464781554317044, 0.02565298717694752, 0.19885264157007138, 0.07023289288027268, 0.10333597914626201, 0.18649775936324714, 0.20630208541159378, 0.17058550916104154, 0.18572338624137708, -0.06023018162866885, -0.0927591026314379, -0.30489599665231776, -0.12543151021906823, -0.11061022853422346, 0.019408433987480364, -0.05777212863507553, -0.16267474018510036, 0.43381712529243843, 0.18585040509263337, 0.12301049464255233, 0.09900680980927339, 0.3199110346691062, 0.12170896905114535, 0.027988980719700605, 0.06005949311692155, 0.2689972505424962, 0.09323781882059957, 0.13870255155277184, -0.20813722342930058, 0.10502208767628128, 0.02099504068804284] |
1,803.02897 | Extraction of isoscalar $\pi\pi$ phase-shifts from lattice QCD | We conduct a two-flavor ($N_f=2$) lattice QCD calculation of the elastic
phase-shifts for pion-pion scattering in the scalar, isoscalar channel (the
$\sigma$-meson). The calculation is performed for two quark masses
corresponding to a pion mass of $315\text{ MeV}$ and $227\text{ MeV}$. The
$\sigma$-meson parameters are extracted using various parametrizations of the
scattering amplitude. The results obtained from a chiral unitary
parametrization are extrapolated to the physical point and read $M_\sigma =
(440^{+10}_{-16}(50) - i\,240(20)(25))\text{ MeV}$, where the uncertainties in
the parentheses denote the stochastic and systematic ones. The behavior of the
$\sigma$-meson parameters with increasing pion mass is discussed as well.
| hep-lat hep-ph nucl-th | we conduct a twoflavor n_f2 lattice qcd calculation of the elastic phaseshifts for pionpion scattering in the scalar isoscalar channel the sigmameson the calculation is performed for two quark masses corresponding to a pion mass of 315text mev and 227text mev the sigmameson parameters are extracted using various parametrizations of the scattering amplitude the results obtained from a chiral unitary parametrization are extrapolated to the physical point and read m_sigma 44010_1650 i2402025text mev where the uncertainties in the parentheses denote the stochastic and systematic ones the behavior of the sigmameson parameters with increasing pion mass is discussed as well | [['we', 'conduct', 'a', 'twoflavor', 'n_f2', 'lattice', 'qcd', 'calculation', 'of', 'the', 'elastic', 'phaseshifts', 'for', 'pionpion', 'scattering', 'in', 'the', 'scalar', 'isoscalar', 'channel', 'the', 'sigmameson', 'the', 'calculation', 'is', 'performed', 'for', 'two', 'quark', 'masses', 'corresponding', 'to', 'a', 'pion', 'mass', 'of', '315text', 'mev', 'and', '227text', 'mev', 'the', 'sigmameson', 'parameters', 'are', 'extracted', 'using', 'various', 'parametrizations', 'of', 'the', 'scattering', 'amplitude', 'the', 'results', 'obtained', 'from', 'a', 'chiral', 'unitary', 'parametrization', 'are', 'extrapolated', 'to', 'the', 'physical', 'point', 'and', 'read', 'm_sigma', '44010_1650', 'i2402025text', 'mev', 'where', 'the', 'uncertainties', 'in', 'the', 'parentheses', 'denote', 'the', 'stochastic', 'and', 'systematic', 'ones', 'the', 'behavior', 'of', 'the', 'sigmameson', 'parameters', 'with', 'increasing', 'pion', 'mass', 'is', 'discussed', 'as', 'well']] | [-0.11421705774570766, 0.26933077427950736, -0.08359459119995957, 0.12548476769588887, -0.031713840759690165, -0.0567966668229354, 0.09104620147845707, 0.3486930508558687, -0.1596501927063065, -0.24835726822677412, -0.0038168476624904496, -0.34187631098259436, -0.012700067499750538, 0.14201846553846018, 0.11618811786174774, 0.13715701705751646, 0.06073985939943477, 0.07123410122861204, -0.14706605777732637, -0.1686047333537748, 0.3470861270607106, 0.013543352577835321, 0.19436162374913693, 0.15704673818851772, 0.025733753332966253, 0.03253736358724142, -0.044575413826264836, -0.12645599022752751, -0.15684491686130825, 0.03145741043906463, 0.21935846548662277, -0.011344835750366511, 0.06836269609630108, -0.32452522323368804, -0.17228201372107785, 0.08476853584380527, 0.14766348356007306, 0.11855217055172512, 0.018646325700377164, -0.31326460242271426, 0.07657220727322918, -0.20283188514509484, -0.18062783581645867, -0.08952116358437036, -0.03291852873701014, -0.014698569410431541, -0.3506581346455373, 0.10204250118450114, -0.1085194818173094, 0.02447165282149064, -0.07624106416968923, -0.3065318074273436, -0.024562383228667866, 0.09261762902238652, 0.1499512834253868, 0.08537925198478134, 0.18694394001933304, -0.1498125576120066, -0.07724122186559007, 0.449339597348712, -0.038241567413665745, -0.18094368129968644, 0.03175043902715276, -0.1169907127458014, -0.06902677682963641, 0.1352594536876208, 0.1563944112607523, 0.03320952369096248, -0.20883465995521922, 0.09462466874025076, -0.03953351162888698, 0.1931710377436646, 0.10850982242508939, 0.01650310673162733, 0.17112657005506518, 0.19700603266981873, -0.08670164887842378, 0.05061112783702188, -0.09282562718971779, -0.12521971831784437, -0.3873854192856111, -0.006377975181921533, -0.1448450913015557, 0.07497912856848224, -0.13627150409171773, -0.13133504852333938, 0.3807584730614173, 0.10866181419083946, 0.2690864892970575, 0.03354964561172222, 0.3196098070787756, 0.12554681235311652, 0.07568721895988442, 0.036455545339145155, 0.2899672151788285, 0.24082905972670568, 0.1117244016428135, -0.3135364889191758, -0.07560670215048287, 0.07248505882085546] |
1,803.02898 | Impact of the domain structure in ferroelectric substrate on graphene
conductance (authors' review) | Review is devoted to the recent theoretical studies of the impact of domain
structure of ferroelectric substrate on graphene conductance. An analytical
description of the hysteresis memory effect in a field effect transistor based
on graphene-on-ferroelectric, taking into account absorbed dipole layers on the
free surface of graphene and localized states on its interfaces is considered.
The aspects of the recently developed theory of p-n junctions conductivity in a
graphene channel on a ferroelectric substrate, which are created by a
180-degree ferroelectric domain structure, are analyzed, and cases of different
current regimes from ballistic to diffusion one are considered. The influence
of size effects in such systems and the possibility of using the results for
improving the characteristics of field effect transistors with a graphene
channel, non-volatile ferroelectric memory cells with random access, sensors,
as well as for miniaturization of various devices of functional nanoelectronics
are discussed.
| cond-mat.mtrl-sci cond-mat.mes-hall | review is devoted to the recent theoretical studies of the impact of domain structure of ferroelectric substrate on graphene conductance an analytical description of the hysteresis memory effect in a field effect transistor based on grapheneonferroelectric taking into account absorbed dipole layers on the free surface of graphene and localized states on its interfaces is considered the aspects of the recently developed theory of pn junctions conductivity in a graphene channel on a ferroelectric substrate which are created by a 180degree ferroelectric domain structure are analyzed and cases of different current regimes from ballistic to diffusion one are considered the influence of size effects in such systems and the possibility of using the results for improving the characteristics of field effect transistors with a graphene channel nonvolatile ferroelectric memory cells with random access sensors as well as for miniaturization of various devices of functional nanoelectronics are discussed | [['review', 'is', 'devoted', 'to', 'the', 'recent', 'theoretical', 'studies', 'of', 'the', 'impact', 'of', 'domain', 'structure', 'of', 'ferroelectric', 'substrate', 'on', 'graphene', 'conductance', 'an', 'analytical', 'description', 'of', 'the', 'hysteresis', 'memory', 'effect', 'in', 'a', 'field', 'effect', 'transistor', 'based', 'on', 'grapheneonferroelectric', 'taking', 'into', 'account', 'absorbed', 'dipole', 'layers', 'on', 'the', 'free', 'surface', 'of', 'graphene', 'and', 'localized', 'states', 'on', 'its', 'interfaces', 'is', 'considered', 'the', 'aspects', 'of', 'the', 'recently', 'developed', 'theory', 'of', 'pn', 'junctions', 'conductivity', 'in', 'a', 'graphene', 'channel', 'on', 'a', 'ferroelectric', 'substrate', 'which', 'are', 'created', 'by', 'a', '180degree', 'ferroelectric', 'domain', 'structure', 'are', 'analyzed', 'and', 'cases', 'of', 'different', 'current', 'regimes', 'from', 'ballistic', 'to', 'diffusion', 'one', 'are', 'considered', 'the', 'influence', 'of', 'size', 'effects', 'in', 'such', 'systems', 'and', 'the', 'possibility', 'of', 'using', 'the', 'results', 'for', 'improving', 'the', 'characteristics', 'of', 'field', 'effect', 'transistors', 'with', 'a', 'graphene', 'channel', 'nonvolatile', 'ferroelectric', 'memory', 'cells', 'with', 'random', 'access', 'sensors', 'as', 'well', 'as', 'for', 'miniaturization', 'of', 'various', 'devices', 'of', 'functional', 'nanoelectronics', 'are', 'discussed']] | [-0.1740077330737191, 0.11381404179864686, -0.03621892808131924, -0.039846230215918856, -0.046228707112295896, -0.13424166331232404, 0.07326327870539738, 0.40299325345122083, -0.24480420423887012, -0.26361942844984887, 0.04592416753286027, -0.2773573438820689, -0.16153640035843972, 0.23708921086144488, -0.01273862711869839, 0.04817228737646764, -0.013653019142216768, -0.04908040643599974, -0.0023034022468439983, -0.19984877812454388, 0.26296671215907297, 0.026157533030855617, 0.3428698950811435, 0.10798706046818775, 0.06196764752199101, -0.019838430076127962, 0.06072249748509656, 0.04990937030363341, -0.13548291875936447, 0.08989252787531626, 0.20890337281201515, -0.07815773806338307, 0.22566825535732835, -0.5627235955476355, -0.2730080574674874, -0.0507178233641827, 0.10438306125032963, 0.13111628668595005, -0.08918095697081793, -0.28611607453785837, 0.09010199232495764, -0.14042687595055317, -0.07026215486351613, -0.03222670943355885, 0.03370125054977327, 0.03315589262717435, -0.2174922895885459, 0.03261211013332719, 0.0492680879772267, 0.07012269633733445, -0.0897018335769341, -0.18141326061164847, -0.03213809622486508, 0.12555713881104932, 0.047769750747196124, -0.010274708469011852, 0.219540858370423, -0.15640441856511747, -0.15392868413406163, 0.3575953517337235, -0.01778684277721003, -0.18401017742307516, 0.1523089419779539, -0.1704117875786967, -0.044933709483847124, 0.10815357894883776, 0.17681911083407142, 0.10340588632337495, -0.1648153357962495, 0.11861870941416151, 0.0550456358956135, 0.1374912313914218, 0.05907137335442818, 0.13248137951366046, 0.2407629537035008, 0.26589303804548825, 0.009841801515514297, 0.16831034090493482, -0.10215976890012701, -0.05259715561393877, -0.24995576184825832, -0.16961165114233054, -0.217978761217804, 0.06867048445911635, -0.06339304529886367, -0.23919591189165706, 0.4205101684787545, 0.13125226835460485, 0.15043231374172328, -0.05329552036314113, 0.3010326997237597, 0.08979854590994414, 0.10931685296058351, -0.020615137727031496, 0.21573819830810942, 0.19338462680901344, 0.1256762249933771, -0.24172482537707554, 0.10991632697397374, -0.01923921196974915] |
1,803.02899 | Categorifying induction formulae via divergent series | We show how to get explicit induction formulae for finite group
representations, and more generally for rational Green functors, by summing a
divergent series over Dwyer's subgroup and centralizer decomposition spaces.
This results in formulae with rational coefficients. The former space yields a
well-known induction formula, the latter yields a new one. As essentially
immediate corollaries of the existing literature, we get similar formulae in
group cohomology and stable splittings of classifying spaces.
| math.GR math.RT | we show how to get explicit induction formulae for finite group representations and more generally for rational green functors by summing a divergent series over dwyers subgroup and centralizer decomposition spaces this results in formulae with rational coefficients the former space yields a wellknown induction formula the latter yields a new one as essentially immediate corollaries of the existing literature we get similar formulae in group cohomology and stable splittings of classifying spaces | [['we', 'show', 'how', 'to', 'get', 'explicit', 'induction', 'formulae', 'for', 'finite', 'group', 'representations', 'and', 'more', 'generally', 'for', 'rational', 'green', 'functors', 'by', 'summing', 'a', 'divergent', 'series', 'over', 'dwyers', 'subgroup', 'and', 'centralizer', 'decomposition', 'spaces', 'this', 'results', 'in', 'formulae', 'with', 'rational', 'coefficients', 'the', 'former', 'space', 'yields', 'a', 'wellknown', 'induction', 'formula', 'the', 'latter', 'yields', 'a', 'new', 'one', 'as', 'essentially', 'immediate', 'corollaries', 'of', 'the', 'existing', 'literature', 'we', 'get', 'similar', 'formulae', 'in', 'group', 'cohomology', 'and', 'stable', 'splittings', 'of', 'classifying', 'spaces']] | [-0.1220966847150982, 0.05043839554815499, -0.15426599416779738, 0.14238663522163023, -0.13911837187263962, -0.09234675560274148, 0.05516211509908715, 0.3586203627390404, -0.308751545540274, -0.21156364712506942, 0.10265841143371614, -0.21755781314935382, -0.1448548373651423, 0.2688418458892058, -0.11874208996097928, -0.04195537826378051, 0.04445892560601949, 0.07553281251034916, -0.12648967558148075, -0.2608976108277191, 0.36299930760407284, -0.05122720867982262, 0.23743051310924634, 0.011868555086014206, 0.10855764853576683, 0.025411045813473733, -0.07495406329989025, -0.033669918807851765, -0.13256785549759253, 0.1583029298137312, 0.34290824549859517, 0.03625164823351453, 0.1936448174815829, -0.35486783291379065, -0.12870521516832586, 0.15728764121152766, 0.18086584670188494, 0.08042687087077392, -0.047586378336235025, -0.2607869742922995, 0.08468121361650832, -0.21631338649863147, -0.1435831217159045, -0.17115526606826342, 0.08596841141275346, 0.014465690815298218, -0.259241996664707, 0.006312080397436472, 0.09452078518240828, 0.0966870135385288, -0.11736979166824013, -0.17038713354770452, -0.0010125475029831063, 0.14915720347876418, 0.02966400582904685, -0.003525328139889322, 0.08446987262888722, -0.09563880914197087, -0.1303504195242916, 0.36238684275583044, -0.11087566276068149, -0.21669639126486975, 0.1212102801041448, -0.17321244123940394, -0.1654788071085533, 0.14119518974362172, 0.02050469517197511, 0.1724957582885272, -0.0475274952740906, 0.12495747843696672, -0.11284881992240066, 0.053692455842057625, 0.12404638125675999, 0.0010324186926120764, 0.05307281972865944, 0.024270065026740506, 0.08025571266316796, 0.15138480965086348, 0.09365312040668644, -0.056679806664063, -0.3348240282638509, -0.192227997581079, -0.06919754936666012, 0.07824867462407645, -0.12654820234416697, -0.19069566045670885, 0.3777851052008161, 0.063990788993566, 0.17475818130761794, 0.17533432675704155, 0.280645956680791, 0.10778059638009649, 0.08472404546066098, 0.02645107765669284, 0.10844425882582795, 0.21065832054153186, -0.009841295805790028, -0.11132697373858258, -0.0013536025629672286, 0.26416472341125347] |
1,803.029 | Benefits of V2V Communication for Autonomous and Connected Vehicles | In this paper, we investigate the benefits of Vehicle-to-Vehicle (V2V)
communication for autonomous vehicles and provide results on how V2V
information helps reduce employable time headway in the presence of parasitic
lags. For a string of vehicles adopting a Constant Time Headway Policy (CTHP)
and availing the on-board information of predecessor's vehicle position and
velocity, the minimum employable time headway ($h_{\min}$) must be lower
bounded by $2\tau_0$ for string stability, where $\tau_0$ is the maximum
parasitic actuation lag. In this paper, we quantify the benefits of using V2V
communication in terms of a reduction in the employable time headway: (1) If
the position and velocity information of $r$ immediately preceding vehicles is
used, then $h_{\min}$ can be reduced to ${4\tau_0}/{(1+r)}$; (2) furthermore,
if the acceleration of `$r$' immediately preceding vehicles is used, then
$h_{\min}$ can be reduced to ${2\tau_0}/{(1+r)}$; and (3) if the position,
velocity and acceleration of the immediate and the $r$-th predecessors are
used, then $h_{\min} \ge {2\tau_0}/{(1+r)}$. Note that cases (2) and (3)
provide the same lower bound on the minimum employable time headway; however,
case (3) requires much less communicated information.
| cs.SY | in this paper we investigate the benefits of vehicletovehicle v2v communication for autonomous vehicles and provide results on how v2v information helps reduce employable time headway in the presence of parasitic lags for a string of vehicles adopting a constant time headway policy cthp and availing the onboard information of predecessors vehicle position and velocity the minimum employable time headway h_min must be lower bounded by 2tau_0 for string stability where tau_0 is the maximum parasitic actuation lag in this paper we quantify the benefits of using v2v communication in terms of a reduction in the employable time headway 1 if the position and velocity information of r immediately preceding vehicles is used then h_min can be reduced to 4tau_01r 2 furthermore if the acceleration of r immediately preceding vehicles is used then h_min can be reduced to 2tau_01r and 3 if the position velocity and acceleration of the immediate and the rth predecessors are used then h_min ge 2tau_01r note that cases 2 and 3 provide the same lower bound on the minimum employable time headway however case 3 requires much less communicated information | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'benefits', 'of', 'vehicletovehicle', 'v2v', 'communication', 'for', 'autonomous', 'vehicles', 'and', 'provide', 'results', 'on', 'how', 'v2v', 'information', 'helps', 'reduce', 'employable', 'time', 'headway', 'in', 'the', 'presence', 'of', 'parasitic', 'lags', 'for', 'a', 'string', 'of', 'vehicles', 'adopting', 'a', 'constant', 'time', 'headway', 'policy', 'cthp', 'and', 'availing', 'the', 'onboard', 'information', 'of', 'predecessors', 'vehicle', 'position', 'and', 'velocity', 'the', 'minimum', 'employable', 'time', 'headway', 'h_min', 'must', 'be', 'lower', 'bounded', 'by', '2tau_0', 'for', 'string', 'stability', 'where', 'tau_0', 'is', 'the', 'maximum', 'parasitic', 'actuation', 'lag', 'in', 'this', 'paper', 'we', 'quantify', 'the', 'benefits', 'of', 'using', 'v2v', 'communication', 'in', 'terms', 'of', 'a', 'reduction', 'in', 'the', 'employable', 'time', 'headway', '1', 'if', 'the', 'position', 'and', 'velocity', 'information', 'of', 'r', 'immediately', 'preceding', 'vehicles', 'is', 'used', 'then', 'h_min', 'can', 'be', 'reduced', 'to', '4tau_01r', '2', 'furthermore', 'if', 'the', 'acceleration', 'of', 'r', 'immediately', 'preceding', 'vehicles', 'is', 'used', 'then', 'h_min', 'can', 'be', 'reduced', 'to', '2tau_01r', 'and', '3', 'if', 'the', 'position', 'velocity', 'and', 'acceleration', 'of', 'the', 'immediate', 'and', 'the', 'rth', 'predecessors', 'are', 'used', 'then', 'h_min', 'ge', '2tau_01r', 'note', 'that', 'cases', '2', 'and', '3', 'provide', 'the', 'same', 'lower', 'bound', 'on', 'the', 'minimum', 'employable', 'time', 'headway', 'however', 'case', '3', 'requires', 'much', 'less', 'communicated', 'information']] | [-0.164752654850276, 0.13896546751622937, -0.07049371681383086, 0.043779085722053426, -0.07292151198360242, -0.16166214124661768, 0.08243532541026878, 0.3663509089085791, -0.27032864375505594, -0.31468863094535965, 0.14860811625258066, -0.24227678671272265, -0.09486134684153108, 0.18245771659227708, -0.1413668673951179, 0.033817640689408617, 0.05324313619639724, 0.0999057448032545, -0.03811301051820111, -0.2587029212568369, 0.22656404579627432, 0.05271828273673439, 0.23461938669077223, 0.09458172383925154, 0.0916347536801671, 0.011423344403091404, -0.017918704005165233, 0.025084973182988, -0.15310063463940524, 0.09989281308112873, 0.2502243370632641, 0.1896190413998233, 0.2837934292335477, -0.46634832428147394, -0.20043262326055103, 0.14603355932566855, 0.17803729512508856, 0.03971288660670527, 0.024760980448789067, -0.27210627010790633, 0.12450551060545775, -0.18675438168769082, -0.10707471621378015, 0.027538818891884552, 0.07395574429796802, 0.0446900915425633, -0.2549707177095115, 0.04965082468051049, 0.014594089633060827, 0.044208490483773254, -0.047458721611959236, -0.04947852432831294, -0.014992734557017684, 0.1852774972639357, 0.046510353126925315, 0.05412122264193992, 0.1216690089133206, -0.11171484317035518, -0.09560791071659575, 0.3811723881815043, -0.04531472426218291, -0.1824047246430483, 0.10928155601076368, -0.11342329077370879, -0.0687914069638484, 0.11277494618358712, 0.19290865880385455, 0.08007500049295939, -0.12453549234196544, 0.04529778524625322, 0.026771850260492, 0.18440862937519947, 0.11065400037655813, 0.044523921057892345, 0.12339737135270197, 0.134942574863736, 0.17584808781781855, 0.06275802470885941, -0.12897000243732085, -0.050611895157231225, -0.2824068557781478, -0.18947491003103398, -0.19283723905682565, 0.01785277515753276, -0.11807174066068708, -0.032225403854519954, 0.36431596657364734, 0.17708856069689824, 0.13358190023702465, 0.10452481408396529, 0.36126104123476477, 0.12122376707848162, 0.030444051393876886, 0.18523928348699378, 0.2237912055952216, 0.06853707724690644, 0.14093842705931617, -0.21505456280170215, 0.12190666425610996, 0.04987741151279705] |
1,803.02901 | Exponentially Light Dark Matter from Coannihilation | Dark matter may be a thermal relic whose abundance is set by mutual
annihilations among multiple species. Traditionally, this coannihilation
scenario has been applied to weak scale dark matter that is highly degenerate
with other states. We show that coannihilation among states with split masses
points to dark matter that is exponentially lighter than the weak scale, down
to the keV scale. We highlight the regime where dark matter does not
participate in the annihilations that dilute its number density. In this
"sterile coannihilation" limit, the dark matter relic density is independent of
its couplings, implying a broad parameter space of thermal relic targets for
future experiments. Light dark matter from coannihilation evades stringent
bounds from the cosmic microwave background, but will be tested by future
direct detection, fixed target, and long-lived particle experiments.
| hep-ph | dark matter may be a thermal relic whose abundance is set by mutual annihilations among multiple species traditionally this coannihilation scenario has been applied to weak scale dark matter that is highly degenerate with other states we show that coannihilation among states with split masses points to dark matter that is exponentially lighter than the weak scale down to the kev scale we highlight the regime where dark matter does not participate in the annihilations that dilute its number density in this sterile coannihilation limit the dark matter relic density is independent of its couplings implying a broad parameter space of thermal relic targets for future experiments light dark matter from coannihilation evades stringent bounds from the cosmic microwave background but will be tested by future direct detection fixed target and longlived particle experiments | [['dark', 'matter', 'may', 'be', 'a', 'thermal', 'relic', 'whose', 'abundance', 'is', 'set', 'by', 'mutual', 'annihilations', 'among', 'multiple', 'species', 'traditionally', 'this', 'coannihilation', 'scenario', 'has', 'been', 'applied', 'to', 'weak', 'scale', 'dark', 'matter', 'that', 'is', 'highly', 'degenerate', 'with', 'other', 'states', 'we', 'show', 'that', 'coannihilation', 'among', 'states', 'with', 'split', 'masses', 'points', 'to', 'dark', 'matter', 'that', 'is', 'exponentially', 'lighter', 'than', 'the', 'weak', 'scale', 'down', 'to', 'the', 'kev', 'scale', 'we', 'highlight', 'the', 'regime', 'where', 'dark', 'matter', 'does', 'not', 'participate', 'in', 'the', 'annihilations', 'that', 'dilute', 'its', 'number', 'density', 'in', 'this', 'sterile', 'coannihilation', 'limit', 'the', 'dark', 'matter', 'relic', 'density', 'is', 'independent', 'of', 'its', 'couplings', 'implying', 'a', 'broad', 'parameter', 'space', 'of', 'thermal', 'relic', 'targets', 'for', 'future', 'experiments', 'light', 'dark', 'matter', 'from', 'coannihilation', 'evades', 'stringent', 'bounds', 'from', 'the', 'cosmic', 'microwave', 'background', 'but', 'will', 'be', 'tested', 'by', 'future', 'direct', 'detection', 'fixed', 'target', 'and', 'longlived', 'particle', 'experiments']] | [-0.126914803837009, 0.2783104391740774, -0.11359513202793341, 0.14831116468013167, -0.1269699482954413, -0.141207406066233, 0.015513221397057676, 0.29570075156907344, -0.21940105707634852, -0.37665337594069626, 0.015620022179878582, -0.2872532913530829, 0.05114532287802492, 0.1773785907955868, 0.06180198387062149, 0.019243191286518392, 0.02544728954280935, 0.00015295145741260762, 0.023054005703263318, -0.2697069038438903, 0.27992269213992493, 0.07599077907863504, 0.2163615935906045, 0.09750457563604326, 0.011163725905216372, -0.07273851417060663, -0.018601470491362373, -0.05100617173093948, -0.11971842766797636, 0.018910507370071456, 0.2540840273966262, 0.1006178653454421, 0.15439552141339588, -0.42851976866819963, -0.2595721288000359, 0.2801328067417576, 0.20314603996699426, 0.08628830265726394, -0.10501642436581428, -0.3707718449686445, 0.06982579738433375, -0.19647984167060523, -0.10167108877186677, -0.026353320814043617, -0.030007107047808925, -0.06292910033440802, -0.24547089736060754, 0.14189263876812505, -0.08470247588259404, -0.14443027255222646, -0.017288487936272773, -0.1436054298459594, -0.05560421381048413, -0.052739123202193136, 0.12227052361912914, -0.05577067018889669, 0.2761924225878693, -0.2290312614145953, -0.05019225612797065, 0.40414149450388415, -0.1520482857826508, -0.11204804784145707, 0.20281044918863075, -0.14563440414729403, -0.18549524902525955, 0.17115013725680314, 0.12842562815535868, 0.08266092499078655, -0.13199681890850415, 0.16902739947979728, -0.07701946855105682, 0.21488043076424762, 0.06704985258280675, 0.06063622566384833, 0.41213392408620286, 0.20448525482093666, 0.1567284263524491, 0.000906367201111349, -0.12161832736846782, -0.057421761246071436, -0.33885217483334396, -0.11682059982471835, -0.1328132618288162, -0.012468716784605389, -0.07009380586576082, -0.09783759736716609, 0.3109815624931744, 0.1314621563291059, 0.21990311938970447, -0.008065272934053704, 0.3399839794763656, 0.05305515921862758, 0.027069060771322963, 0.0491677499628181, 0.3565054316448965, 0.13342057265438584, 0.0671086492079463, -0.21433996256274074, -0.004581273411775925, -0.04175634198099264] |
1,803.02902 | Non-classical correlations in quantum mechanics and beyond | Is entanglement an exclusive feature of quantum systems, or is it common to
all non-classical theories? And if this is the case, how strong is quantum
mechanical entanglement as compared to that exhibited by other theories? The
first part of this thesis deals with these questions by considering quantum
theory as part of a wider landscape of physical theories, collectively called
general probabilistic theories (GPTs). Among the other things, this manuscript
contains a detailed introduction to the abstract state space formalism for
GPTs. We start with a comprehensive review of the proof of a famous theorem by
Ludwig that constitutes one of its cornerstones (Ch. 1). After explaining the
basic rules of the game, we translate our questions into precise conjectures
and present our progress toward a full solution (Ch. 2). In Ch. 3 we consider
entanglement at the level of measurements instead of states, focusing on one of
its main implications, i.e. data hiding. We determine the maximal data hiding
strength that a quantum mechanical system can exhibit, and also the maximum
value among all GPTs, finding that the former scales as the square root of the
latter. In the second part of this manuscript we look into quantum
entanglement. In Ch. 4 we discuss the entanglement transformation properties of
a class of maps that model white noise acting either locally or globally on a
bipartite system. In Ch. 5 we employ matrix analysis tools to develop a unified
approach to Gaussian entanglement. The third part of this thesis concerns more
general forms of non-classical correlations in bipartite continuous variable
systems. In Ch. 6 we devise a general scheme that allows to consistently
classify correlations of bipartite Gaussian states into classical and quantum
ones. Finally, Ch. 7 explores some problems connected with a certain strong
subadditivity matrix inequality.
| quant-ph math-ph math.FA math.MP | is entanglement an exclusive feature of quantum systems or is it common to all nonclassical theories and if this is the case how strong is quantum mechanical entanglement as compared to that exhibited by other theories the first part of this thesis deals with these questions by considering quantum theory as part of a wider landscape of physical theories collectively called general probabilistic theories gpts among the other things this manuscript contains a detailed introduction to the abstract state space formalism for gpts we start with a comprehensive review of the proof of a famous theorem by ludwig that constitutes one of its cornerstones ch 1 after explaining the basic rules of the game we translate our questions into precise conjectures and present our progress toward a full solution ch 2 in ch 3 we consider entanglement at the level of measurements instead of states focusing on one of its main implications ie data hiding we determine the maximal data hiding strength that a quantum mechanical system can exhibit and also the maximum value among all gpts finding that the former scales as the square root of the latter in the second part of this manuscript we look into quantum entanglement in ch 4 we discuss the entanglement transformation properties of a class of maps that model white noise acting either locally or globally on a bipartite system in ch 5 we employ matrix analysis tools to develop a unified approach to gaussian entanglement the third part of this thesis concerns more general forms of nonclassical correlations in bipartite continuous variable systems in ch 6 we devise a general scheme that allows to consistently classify correlations of bipartite gaussian states into classical and quantum ones finally ch 7 explores some problems connected with a certain strong subadditivity matrix inequality | [['is', 'entanglement', 'an', 'exclusive', 'feature', 'of', 'quantum', 'systems', 'or', 'is', 'it', 'common', 'to', 'all', 'nonclassical', 'theories', 'and', 'if', 'this', 'is', 'the', 'case', 'how', 'strong', 'is', 'quantum', 'mechanical', 'entanglement', 'as', 'compared', 'to', 'that', 'exhibited', 'by', 'other', 'theories', 'the', 'first', 'part', 'of', 'this', 'thesis', 'deals', 'with', 'these', 'questions', 'by', 'considering', 'quantum', 'theory', 'as', 'part', 'of', 'a', 'wider', 'landscape', 'of', 'physical', 'theories', 'collectively', 'called', 'general', 'probabilistic', 'theories', 'gpts', 'among', 'the', 'other', 'things', 'this', 'manuscript', 'contains', 'a', 'detailed', 'introduction', 'to', 'the', 'abstract', 'state', 'space', 'formalism', 'for', 'gpts', 'we', 'start', 'with', 'a', 'comprehensive', 'review', 'of', 'the', 'proof', 'of', 'a', 'famous', 'theorem', 'by', 'ludwig', 'that', 'constitutes', 'one', 'of', 'its', 'cornerstones', 'ch', '1', 'after', 'explaining', 'the', 'basic', 'rules', 'of', 'the', 'game', 'we', 'translate', 'our', 'questions', 'into', 'precise', 'conjectures', 'and', 'present', 'our', 'progress', 'toward', 'a', 'full', 'solution', 'ch', '2', 'in', 'ch', '3', 'we', 'consider', 'entanglement', 'at', 'the', 'level', 'of', 'measurements', 'instead', 'of', 'states', 'focusing', 'on', 'one', 'of', 'its', 'main', 'implications', 'ie', 'data', 'hiding', 'we', 'determine', 'the', 'maximal', 'data', 'hiding', 'strength', 'that', 'a', 'quantum', 'mechanical', 'system', 'can', 'exhibit', 'and', 'also', 'the', 'maximum', 'value', 'among', 'all', 'gpts', 'finding', 'that', 'the', 'former', 'scales', 'as', 'the', 'square', 'root', 'of', 'the', 'latter', 'in', 'the', 'second', 'part', 'of', 'this', 'manuscript', 'we', 'look', 'into', 'quantum', 'entanglement', 'in', 'ch', '4', 'we', 'discuss', 'the', 'entanglement', 'transformation', 'properties', 'of', 'a', 'class', 'of', 'maps', 'that', 'model', 'white', 'noise', 'acting', 'either', 'locally', 'or', 'globally', 'on', 'a', 'bipartite', 'system', 'in', 'ch', '5', 'we', 'employ', 'matrix', 'analysis', 'tools', 'to', 'develop', 'a', 'unified', 'approach', 'to', 'gaussian', 'entanglement', 'the', 'third', 'part', 'of', 'this', 'thesis', 'concerns', 'more', 'general', 'forms', 'of', 'nonclassical', 'correlations', 'in', 'bipartite', 'continuous', 'variable', 'systems', 'in', 'ch', '6', 'we', 'devise', 'a', 'general', 'scheme', 'that', 'allows', 'to', 'consistently', 'classify', 'correlations', 'of', 'bipartite', 'gaussian', 'states', 'into', 'classical', 'and', 'quantum', 'ones', 'finally', 'ch', '7', 'explores', 'some', 'problems', 'connected', 'with', 'a', 'certain', 'strong', 'subadditivity', 'matrix', 'inequality']] | [-0.11271523374146829, 0.11203172452301823, -0.08474747306296608, 0.06959476060721476, -0.04598460665103484, -0.17697949446800063, 0.041738799443962145, 0.3084508183764225, -0.26288715496279275, -0.2540526053320031, 0.09661846793604, -0.28245528286598803, -0.16129145075771084, 0.17079961256756382, -0.06555814533081702, 0.037645491076412185, 0.04527464101829233, 0.048043089115760135, -0.058905480339979895, -0.24902447035737074, 0.3659021821337126, 0.013095544306187576, 0.25217348285896213, 0.05550864223549672, 0.0800717947451728, 0.03365148862813721, -0.029529776480235782, 0.02565453401686901, -0.1237264969284443, 0.16422255641748087, 0.2494900478364512, 0.1716669690764095, 0.290452225449928, -0.39834874499991013, -0.21362561778707373, 0.1035046806717821, 0.0970167809802697, 0.14619461667488787, 0.0035891247627361953, -0.26405292917681505, 0.053655870173151377, -0.15935732569330588, -0.1483411195666146, -0.06718091722102805, 0.027378829411016062, -0.035725341141099314, -0.20456826313278859, 0.07505348826562477, 0.11987303305330864, 0.0594580397570512, -0.03332308916922855, -0.08923204203352743, 0.018181333214007195, 0.11552850982909368, -0.01244524419915093, 0.005644804517054046, 0.09841977334410001, -0.13388651103101729, -0.14859257458030156, 0.38851977178665736, -0.051008496968267196, -0.1691707601349483, 0.1898767036984653, -0.12648574800158924, -0.2012745024018102, 0.049685947838423145, 0.13022140831060483, 0.11489091053399503, -0.14583199739652408, 0.06334946977276741, -0.05663207403219065, 0.1734943792915414, 0.026725735029448635, 0.09416843102415587, 0.18242391459581545, 0.12129685064671829, 0.08052256132902758, 0.1949977270521404, -0.022190706885379295, -0.12540688619864823, -0.34061586100882213, -0.20476040215593622, -0.15795992572875975, 0.08597639060170813, -0.06658750853402366, -0.1441051784936295, 0.41012135676748923, 0.13548938764230406, 0.17121170327095797, 0.05074009114921554, 0.26510094131115686, 0.09427042610952661, 0.03975544800809787, 0.056561291635964676, 0.2208217583003144, 0.16735820242836075, 0.09576683233252238, -0.17286122569833404, 0.028616893649518638, 0.07835341734736909] |
1,803.02903 | Nuclear-recoil energy scale in CDMS II silicon dark-matter detectors | The Cryogenic Dark Matter Search (CDMS II) experiment aims to detect dark
matter particles that elastically scatter from nuclei in semiconductor
detectors. The resulting nuclear-recoil energy depositions are detected by
ionization and phonon sensors. Neutrons produce a similar spectrum of
low-energy nuclear recoils in such detectors, while most other backgrounds
produce electron recoils. The absolute energy scale for nuclear recoils is
necessary to interpret results correctly. The energy scale can be determined in
CDMS II silicon detectors using neutrons incident from a broad-spectrum
$^{252}$Cf source, taking advantage of a prominent resonance in the neutron
elastic scattering cross section of silicon at a recoil (neutron) energy near
20 (182) keV. Results indicate that the phonon collection efficiency for
nuclear recoils is $4.8^{+0.7}_{-0.9}$% lower than for electron recoils of the
same energy. Comparisons of the ionization signals for nuclear recoils to those
measured previously by other groups at higher electric fields indicate that the
ionization collection efficiency for CDMS II silicon detectors operated at
$\sim$4 V/cm is consistent with 100% for nuclear recoils below 20 keV and
gradually decreases for larger energies to $\sim$75% at 100 keV. The impact of
these measurements on previously published CDMS II silicon results is small.
| physics.ins-det astro-ph.IM hep-ex | the cryogenic dark matter search cdms ii experiment aims to detect dark matter particles that elastically scatter from nuclei in semiconductor detectors the resulting nuclearrecoil energy depositions are detected by ionization and phonon sensors neutrons produce a similar spectrum of lowenergy nuclear recoils in such detectors while most other backgrounds produce electron recoils the absolute energy scale for nuclear recoils is necessary to interpret results correctly the energy scale can be determined in cdms ii silicon detectors using neutrons incident from a broadspectrum 252cf source taking advantage of a prominent resonance in the neutron elastic scattering cross section of silicon at a recoil neutron energy near 20 182 kev results indicate that the phonon collection efficiency for nuclear recoils is 4807_09 lower than for electron recoils of the same energy comparisons of the ionization signals for nuclear recoils to those measured previously by other groups at higher electric fields indicate that the ionization collection efficiency for cdms ii silicon detectors operated at sim4 vcm is consistent with 100 for nuclear recoils below 20 kev and gradually decreases for larger energies to sim75 at 100 kev the impact of these measurements on previously published cdms ii silicon results is small | [['the', 'cryogenic', 'dark', 'matter', 'search', 'cdms', 'ii', 'experiment', 'aims', 'to', 'detect', 'dark', 'matter', 'particles', 'that', 'elastically', 'scatter', 'from', 'nuclei', 'in', 'semiconductor', 'detectors', 'the', 'resulting', 'nuclearrecoil', 'energy', 'depositions', 'are', 'detected', 'by', 'ionization', 'and', 'phonon', 'sensors', 'neutrons', 'produce', 'a', 'similar', 'spectrum', 'of', 'lowenergy', 'nuclear', 'recoils', 'in', 'such', 'detectors', 'while', 'most', 'other', 'backgrounds', 'produce', 'electron', 'recoils', 'the', 'absolute', 'energy', 'scale', 'for', 'nuclear', 'recoils', 'is', 'necessary', 'to', 'interpret', 'results', 'correctly', 'the', 'energy', 'scale', 'can', 'be', 'determined', 'in', 'cdms', 'ii', 'silicon', 'detectors', 'using', 'neutrons', 'incident', 'from', 'a', 'broadspectrum', '252cf', 'source', 'taking', 'advantage', 'of', 'a', 'prominent', 'resonance', 'in', 'the', 'neutron', 'elastic', 'scattering', 'cross', 'section', 'of', 'silicon', 'at', 'a', 'recoil', 'neutron', 'energy', 'near', '20', '182', 'kev', 'results', 'indicate', 'that', 'the', 'phonon', 'collection', 'efficiency', 'for', 'nuclear', 'recoils', 'is', '4807_09', 'lower', 'than', 'for', 'electron', 'recoils', 'of', 'the', 'same', 'energy', 'comparisons', 'of', 'the', 'ionization', 'signals', 'for', 'nuclear', 'recoils', 'to', 'those', 'measured', 'previously', 'by', 'other', 'groups', 'at', 'higher', 'electric', 'fields', 'indicate', 'that', 'the', 'ionization', 'collection', 'efficiency', 'for', 'cdms', 'ii', 'silicon', 'detectors', 'operated', 'at', 'sim4', 'vcm', 'is', 'consistent', 'with', '100', 'for', 'nuclear', 'recoils', 'below', '20', 'kev', 'and', 'gradually', 'decreases', 'for', 'larger', 'energies', 'to', 'sim75', 'at', '100', 'kev', 'the', 'impact', 'of', 'these', 'measurements', 'on', 'previously', 'published', 'cdms', 'ii', 'silicon', 'results', 'is', 'small']] | [0.0161402099164652, 0.24586984621727784, -0.04114004714659067, 0.11637042386861837, 0.005225907575550082, -0.14718666558643106, 0.011543115378696133, 0.37890605177410475, -0.171120815292457, -0.4292952363200561, -0.050373415855427435, -0.44862547299514216, 0.10503054365299341, 0.21007334341581987, 0.049897392331551986, 0.02280829634548005, 0.05977900979412494, 0.016518974926021664, -0.08342318963659269, -0.1755885255483045, 0.21578035678366445, 0.19112844313988744, 0.26575383359820326, 0.0935207939650299, 0.09827182521911884, -0.008463430687587595, -0.002635974879141408, -0.03989078080272208, -0.09353317055939267, 0.0408978983948026, 0.33970864833746517, 0.037175570179842354, 0.1181800130959318, -0.4421825320883231, -0.20409331045047652, 0.10898333528982193, 0.1086256079025322, 0.06767187373491587, -0.14014329389031657, -0.3054318253628232, 0.06983214958260457, -0.20523753325746516, -0.11126826712720547, -0.00022271936147878266, -0.004870966778576581, 0.04954475638747093, -0.2040857875418633, 0.10192198384049904, -0.02898846744416244, -0.02650959452736483, -0.1324608654872693, -0.19837321941928956, 0.03669537441696821, -0.04176362367309253, 0.012936676320892692, 0.0065808167676394335, 0.32683243035489334, -0.14275112113623759, -0.07959170552379818, 0.35357264771756497, -0.0556438449853849, -0.02836972730504137, 0.16214900037198507, -0.19557874599434058, -0.07753291011040071, 0.3293016437518868, 0.14041828211735596, 0.07580038130335096, -0.15361996229286445, 0.024993482835454432, 0.05909428259444827, 0.23657998061654242, 0.11549356655862107, 0.06624752265692811, 0.23494618768672074, 0.2115126678113346, 0.07081581884054373, 0.0077880942574325915, -0.2433219377005548, 0.04303536414065295, -0.30516414612977333, -0.11332481449488739, -0.137607665624319, 0.0527791827540807, -0.03558589615656246, -0.059158284231230165, 0.3335307228115547, 0.056568993561086245, 0.1521527774754272, -0.04744127216382009, 0.321141737823685, 0.0529937106390446, 0.0859210651057462, 0.013058889739572851, 0.3831018358892338, 0.151805498113978, 0.08368457002315971, -0.24849100097557625, 0.030654575868575562, -0.048967931847643066] |
1,803.02904 | Renormalization group analysis of dipolar Heisenberg model on square
lattice | We present a detailed functional renormalization group analysis of spin-1/2
dipolar Heisenberg model on square lattice. This model is similar to the well
known $J_1$-$J_2$ model and describes the pseudospin degrees of freedom of
polar molecules confined in deep optical lattice with long-range anisotropic
dipole-dipole interactions. Previous study of this model based on tensor
network ansatz indicates a paramagnetic ground state for certain dipole tilting
angles which can be tuned in experiments to control the exchange couplings. The
tensor ansatz formulated on a small cluster unit cell is inadequate to describe
the spiral order, and therefore the phase diagram at high azimuthal tilting
angles remains undetermined. Here we obtain the full phase diagram of the model
from numerical pseudofermion functional renormalization group calculations. We
show that an extended quantum paramagnetic phase is realized between the
N\'{e}el and stripe/spiral phase. In this region, the spin susceptibility flows
smoothly down to the lowest numerical renormalization group scales with no sign
of divergence or breakdown of the flow, in sharp contrast to the flow towards
the long-range ordered phases. Our results provide further evidence that the
dipolar Heisenberg model is a fertile ground for quantum spin liquids.
| cond-mat.quant-gas cond-mat.str-el | we present a detailed functional renormalization group analysis of spin12 dipolar heisenberg model on square lattice this model is similar to the well known j_1j_2 model and describes the pseudospin degrees of freedom of polar molecules confined in deep optical lattice with longrange anisotropic dipoledipole interactions previous study of this model based on tensor network ansatz indicates a paramagnetic ground state for certain dipole tilting angles which can be tuned in experiments to control the exchange couplings the tensor ansatz formulated on a small cluster unit cell is inadequate to describe the spiral order and therefore the phase diagram at high azimuthal tilting angles remains undetermined here we obtain the full phase diagram of the model from numerical pseudofermion functional renormalization group calculations we show that an extended quantum paramagnetic phase is realized between the neel and stripespiral phase in this region the spin susceptibility flows smoothly down to the lowest numerical renormalization group scales with no sign of divergence or breakdown of the flow in sharp contrast to the flow towards the longrange ordered phases our results provide further evidence that the dipolar heisenberg model is a fertile ground for quantum spin liquids | [['we', 'present', 'a', 'detailed', 'functional', 'renormalization', 'group', 'analysis', 'of', 'spin12', 'dipolar', 'heisenberg', 'model', 'on', 'square', 'lattice', 'this', 'model', 'is', 'similar', 'to', 'the', 'well', 'known', 'j_1j_2', 'model', 'and', 'describes', 'the', 'pseudospin', 'degrees', 'of', 'freedom', 'of', 'polar', 'molecules', 'confined', 'in', 'deep', 'optical', 'lattice', 'with', 'longrange', 'anisotropic', 'dipoledipole', 'interactions', 'previous', 'study', 'of', 'this', 'model', 'based', 'on', 'tensor', 'network', 'ansatz', 'indicates', 'a', 'paramagnetic', 'ground', 'state', 'for', 'certain', 'dipole', 'tilting', 'angles', 'which', 'can', 'be', 'tuned', 'in', 'experiments', 'to', 'control', 'the', 'exchange', 'couplings', 'the', 'tensor', 'ansatz', 'formulated', 'on', 'a', 'small', 'cluster', 'unit', 'cell', 'is', 'inadequate', 'to', 'describe', 'the', 'spiral', 'order', 'and', 'therefore', 'the', 'phase', 'diagram', 'at', 'high', 'azimuthal', 'tilting', 'angles', 'remains', 'undetermined', 'here', 'we', 'obtain', 'the', 'full', 'phase', 'diagram', 'of', 'the', 'model', 'from', 'numerical', 'pseudofermion', 'functional', 'renormalization', 'group', 'calculations', 'we', 'show', 'that', 'an', 'extended', 'quantum', 'paramagnetic', 'phase', 'is', 'realized', 'between', 'the', 'neel', 'and', 'stripespiral', 'phase', 'in', 'this', 'region', 'the', 'spin', 'susceptibility', 'flows', 'smoothly', 'down', 'to', 'the', 'lowest', 'numerical', 'renormalization', 'group', 'scales', 'with', 'no', 'sign', 'of', 'divergence', 'or', 'breakdown', 'of', 'the', 'flow', 'in', 'sharp', 'contrast', 'to', 'the', 'flow', 'towards', 'the', 'longrange', 'ordered', 'phases', 'our', 'results', 'provide', 'further', 'evidence', 'that', 'the', 'dipolar', 'heisenberg', 'model', 'is', 'a', 'fertile', 'ground', 'for', 'quantum', 'spin', 'liquids']] | [-0.19322177924703168, 0.20103325596426969, -0.07215360765269394, 0.041989324723582695, -0.057703186719258524, -0.12384387110528859, 0.05469430305686215, 0.3972666998794351, -0.2689812706995736, -0.2550929535621864, 0.03076793786881424, -0.27254124538046476, -0.13699495252294205, 0.10440592861787411, 0.0713638768501807, 0.010640135136254402, -0.002724399840835617, 0.017577875940125543, -0.12954148172685598, -0.19337540628977234, 0.2680895138300299, 0.009175214613214801, 0.30300330251715885, 0.07615861452155664, 0.07874608052402271, 0.040090946676064804, 0.0878875593659637, 0.015515503530882763, -0.17088476873711392, 0.07036314192445167, 0.22593446837381068, -0.07224661866782012, 0.15730989992937044, -0.42183909594645924, -0.21108137496621612, 0.04785038078978291, 0.15571877331994088, 0.17891361906465839, -0.023973386992285406, -0.31787050483082396, 0.00022228301015388163, -0.21384167386197192, -0.1686066803425898, -0.15680847408182416, -0.058343532251512606, -0.029911503630058137, -0.2490243205385659, 0.14326008269683954, 0.042153307660772354, 0.11247925074746769, -0.07804253462634479, -0.10445393967548376, -0.030378141068887216, 0.10945629192289409, 0.041124496005181164, 0.08543040208612603, 0.10586348236622917, -0.13933521439653093, -0.10989876208498765, 0.3777762713451228, -0.05393876632496985, -0.16153793413327147, 0.1655098757009297, -0.17852732386819142, -0.11383469335715542, 0.13083542952883429, 0.1340100187615255, 0.08712017224676946, -0.11413441997484686, 0.08160350660080515, -0.06365121280475293, 0.21025984797028371, -0.045292390220909536, -0.007608337937661211, 0.22013625217881536, 0.16588199493798567, 0.06506949347212254, 0.16988231323555672, -0.09492664634134895, -0.1757169362746295, -0.2864898575971704, -0.12402585546131405, -0.21462218959603477, 0.042096322410199505, -0.12002698216960377, -0.17529469345807258, 0.39309911562342176, 0.140477669993512, 0.16213445942981622, -0.008678600379661536, 0.250172087428078, 0.06286498217196855, 0.07223497047885248, 0.04186409627270783, 0.26430680622090946, 0.1932464469697114, 0.05548245880820359, -0.2918958904865859, 0.012408638648071128, 0.09572249950257183] |
1,803.02905 | A Novel Model of Cancer-Induced Peripheral Neuropathy and the Role of
TRPA1 in Pain Transduction | Background. Models of cancer-induced neuropathy are designed by injecting
cancer cells near the peripheral nerves. The interference of tissue-resident
immune cells does not allow a direct contact with nerve fibres which affects
the tumor microenvironment and the invasion process. Methods. Anaplastic
tumor-1 (AT-1) cells were inoculated within the sciatic nerves (SNs) of male
Copenhagen rats. Lumbar dorsal root ganglia (DRGs) and the SNs were collected
on days 3, 7, 14, and 21. SN tissues were examined for morphological changes
and DRG tissues for immunofluorescence, electrophoretic tendency, and mRNA
quantification. Hypersensitivities to cold, mechanical, and thermal stimuli
were determined. HC-030031, a selective TRPA1 antagonist, was used to treat
cold allodynia. Results. Nociception thresholds were identified on day 6.
Immunofluorescent micrographs showed overexpression of TRPA1 on days 7 and 14
and of CGRP on day 14 until day 21. Both TRPA1 and CGRP were coexpressed on the
same cells. Immunoblots exhibited an increase in TRPA1 expression on day 14.
TRPA1 mRNA underwent an increase on day 7 (normalized to 18S). Injection of
HC-030031 transiently reversed the cold allodynia. Conclusion. A novel and a
promising model of cancer-induced neuropathy was established, and the role of
TRPA1 and CGRP in pain transduction was examined.
| q-bio.TO q-bio.NC | background models of cancerinduced neuropathy are designed by injecting cancer cells near the peripheral nerves the interference of tissueresident immune cells does not allow a direct contact with nerve fibres which affects the tumor microenvironment and the invasion process methods anaplastic tumor1 at1 cells were inoculated within the sciatic nerves sns of male copenhagen rats lumbar dorsal root ganglia drgs and the sns were collected on days 3 7 14 and 21 sn tissues were examined for morphological changes and drg tissues for immunofluorescence electrophoretic tendency and mrna quantification hypersensitivities to cold mechanical and thermal stimuli were determined hc030031 a selective trpa1 antagonist was used to treat cold allodynia results nociception thresholds were identified on day 6 immunofluorescent micrographs showed overexpression of trpa1 on days 7 and 14 and of cgrp on day 14 until day 21 both trpa1 and cgrp were coexpressed on the same cells immunoblots exhibited an increase in trpa1 expression on day 14 trpa1 mrna underwent an increase on day 7 normalized to 18s injection of hc030031 transiently reversed the cold allodynia conclusion a novel and a promising model of cancerinduced neuropathy was established and the role of trpa1 and cgrp in pain transduction was examined | [['background', 'models', 'of', 'cancerinduced', 'neuropathy', 'are', 'designed', 'by', 'injecting', 'cancer', 'cells', 'near', 'the', 'peripheral', 'nerves', 'the', 'interference', 'of', 'tissueresident', 'immune', 'cells', 'does', 'not', 'allow', 'a', 'direct', 'contact', 'with', 'nerve', 'fibres', 'which', 'affects', 'the', 'tumor', 'microenvironment', 'and', 'the', 'invasion', 'process', 'methods', 'anaplastic', 'tumor1', 'at1', 'cells', 'were', 'inoculated', 'within', 'the', 'sciatic', 'nerves', 'sns', 'of', 'male', 'copenhagen', 'rats', 'lumbar', 'dorsal', 'root', 'ganglia', 'drgs', 'and', 'the', 'sns', 'were', 'collected', 'on', 'days', '3', '7', '14', 'and', '21', 'sn', 'tissues', 'were', 'examined', 'for', 'morphological', 'changes', 'and', 'drg', 'tissues', 'for', 'immunofluorescence', 'electrophoretic', 'tendency', 'and', 'mrna', 'quantification', 'hypersensitivities', 'to', 'cold', 'mechanical', 'and', 'thermal', 'stimuli', 'were', 'determined', 'hc030031', 'a', 'selective', 'trpa1', 'antagonist', 'was', 'used', 'to', 'treat', 'cold', 'allodynia', 'results', 'nociception', 'thresholds', 'were', 'identified', 'on', 'day', '6', 'immunofluorescent', 'micrographs', 'showed', 'overexpression', 'of', 'trpa1', 'on', 'days', '7', 'and', '14', 'and', 'of', 'cgrp', 'on', 'day', '14', 'until', 'day', '21', 'both', 'trpa1', 'and', 'cgrp', 'were', 'coexpressed', 'on', 'the', 'same', 'cells', 'immunoblots', 'exhibited', 'an', 'increase', 'in', 'trpa1', 'expression', 'on', 'day', '14', 'trpa1', 'mrna', 'underwent', 'an', 'increase', 'on', 'day', '7', 'normalized', 'to', '18s', 'injection', 'of', 'hc030031', 'transiently', 'reversed', 'the', 'cold', 'allodynia', 'conclusion', 'a', 'novel', 'and', 'a', 'promising', 'model', 'of', 'cancerinduced', 'neuropathy', 'was', 'established', 'and', 'the', 'role', 'of', 'trpa1', 'and', 'cgrp', 'in', 'pain', 'transduction', 'was', 'examined']] | [-0.04943765343151041, 0.15349875229574783, -0.01018657825438608, 0.03806891932683585, 0.0013288169982233597, -0.15695382254710177, 0.0669235710203355, 0.4008254904558404, -0.17223016900639415, -0.29392070527047076, 0.0849018029482177, -0.3398832796697373, -0.17354024559288672, 0.19489372840897223, -0.1389082078224643, -0.02374702201990401, 0.07231008813013103, 0.018225049342794335, 0.07415368406014293, -0.24756941532335824, 0.15787001136027237, 0.05945346128751392, 0.3118192415162726, 0.04744725422238863, 0.11320761780325245, -0.01327590680686045, -0.058516648910081515, -0.046161597615456226, -0.12269398190217648, 0.07936738246343439, 0.2281275899767553, 0.109640008428607, 0.2391209212224443, -0.47400225827675213, -0.19355079770839106, 0.05229784988588532, 0.1601808219660483, 0.07189893709307936, -0.006831211268935957, -0.27711319593780953, 0.09398708248959552, -0.14453177018998026, -0.07868003911772714, 0.034297018810492304, 0.04751636993008329, 0.02991760526271781, -0.19744834541562575, 0.1603442672749796, -0.00030912125040655127, 0.1908061012152719, -0.1411503785709163, -0.1293157248651726, -0.07347057175734788, 0.173104728062525, -0.005226727518532181, 0.035844539921622266, 0.26288243892958574, -0.09781979509575672, -0.10035448784117723, 0.2947736639597731, 0.009494781239367827, -0.061714503177074734, 0.2098707691936983, -0.13117529428685912, -0.10854062620131055, 0.1761235518000669, 0.14298082158671624, 0.04121615919796506, -0.1771360699487216, -0.08939494241909149, 0.05006828366081518, 0.19171966082923583, 0.1914296500587163, -0.0833060232659129, 0.16714860430762601, 0.19575614817391748, -0.07152843269420768, 0.08195154288057141, -0.18476710160060528, -0.003345352781300204, -0.15202669190554952, -0.13116877613813466, -0.04074556033824283, 0.06127340850886262, -0.05827409102101762, -0.10476759407201207, 0.3727071402748042, 0.02504163246640828, 0.15174056336049635, 0.018426255587670044, 0.18631815422126408, -0.015581160042610467, 0.11640581687063915, -0.019605164988916027, 0.2132477531080373, 0.12237564490191366, 0.13620683470014386, -0.2340899899953011, 0.13116099299248601, -0.0007244055086249457] |
1,803.02906 | Simultaneous Task Allocation and Planning Under Uncertainty | We propose novel techniques for task allocation and planning in multi-robot
systems operating in uncertain environments. Task allocation is performed
simultaneously with planning, which provides more detailed information about
individual robot behaviour, but also exploits independence between tasks to do
so efficiently. We use Markov decision processes to model robot behaviour and
linear temporal logic to specify tasks and safety constraints. Building upon
techniques and tools from formal verification, we show how to generate a
sequence of multi-robot policies, iteratively refining them to reallocate tasks
if individual robots fail, and providing probabilistic guarantees on the
performance (and safe operation) of the team of robots under the resulting
policy. We implement our approach and evaluate it on a benchmark multi-robot
example.
| cs.AI cs.RO | we propose novel techniques for task allocation and planning in multirobot systems operating in uncertain environments task allocation is performed simultaneously with planning which provides more detailed information about individual robot behaviour but also exploits independence between tasks to do so efficiently we use markov decision processes to model robot behaviour and linear temporal logic to specify tasks and safety constraints building upon techniques and tools from formal verification we show how to generate a sequence of multirobot policies iteratively refining them to reallocate tasks if individual robots fail and providing probabilistic guarantees on the performance and safe operation of the team of robots under the resulting policy we implement our approach and evaluate it on a benchmark multirobot example | [['we', 'propose', 'novel', 'techniques', 'for', 'task', 'allocation', 'and', 'planning', 'in', 'multirobot', 'systems', 'operating', 'in', 'uncertain', 'environments', 'task', 'allocation', 'is', 'performed', 'simultaneously', 'with', 'planning', 'which', 'provides', 'more', 'detailed', 'information', 'about', 'individual', 'robot', 'behaviour', 'but', 'also', 'exploits', 'independence', 'between', 'tasks', 'to', 'do', 'so', 'efficiently', 'we', 'use', 'markov', 'decision', 'processes', 'to', 'model', 'robot', 'behaviour', 'and', 'linear', 'temporal', 'logic', 'to', 'specify', 'tasks', 'and', 'safety', 'constraints', 'building', 'upon', 'techniques', 'and', 'tools', 'from', 'formal', 'verification', 'we', 'show', 'how', 'to', 'generate', 'a', 'sequence', 'of', 'multirobot', 'policies', 'iteratively', 'refining', 'them', 'to', 'reallocate', 'tasks', 'if', 'individual', 'robots', 'fail', 'and', 'providing', 'probabilistic', 'guarantees', 'on', 'the', 'performance', 'and', 'safe', 'operation', 'of', 'the', 'team', 'of', 'robots', 'under', 'the', 'resulting', 'policy', 'we', 'implement', 'our', 'approach', 'and', 'evaluate', 'it', 'on', 'a', 'benchmark', 'multirobot', 'example']] | [-0.09947128794253028, -0.007634760438910841, -0.11963961296132766, 0.054711383310495874, -0.18963937336423745, -0.19556503816662976, 0.13022976518792953, 0.4994628191925585, -0.25783050377697997, -0.38203478339128194, 0.10027153965978262, -0.19239471230345467, -0.16208327176767245, 0.2056257997319335, -0.16414760917735596, 0.1482753434102051, 0.11326247070489141, 0.027718330973099607, 0.009438517361801738, -0.23881766316480935, 0.2513609672683136, 0.04666621731206154, 0.29297587883193044, 0.005968737522198353, 0.1653141418277907, 0.06881551139522343, 0.0004867544223088771, -0.030592259108865014, -0.0950616505278352, 0.14529452478357902, 0.3903980297036469, 0.2745501876110211, 0.3312943299456189, -0.4485041953312854, -0.16511717451891553, 0.09262658326770179, 0.10466050435982956, 0.058386548615332386, 0.02872448383071363, -0.32953027753780284, 0.08320335170719773, -0.17967142939548164, -0.03084459634652982, -0.1708832658904915, -0.041200405064349375, 0.0005475199892922925, -0.3232681507593952, -0.059963944106372465, 0.08347171660667906, 0.08312422348729645, -0.06228532908911196, -0.04955680623728161, 0.03171006119907058, 0.22751910423588317, 0.012307171861175447, -0.04162185361783486, 0.2026032983752278, -0.13523581249458705, -0.2157139130285941, 0.392191019297267, 0.03423425011375609, -0.22704251596393685, 0.23456218915137772, -0.03092827823323508, -0.22001137775563015, 0.06351740759952615, 0.2580189581339558, 0.1596672771576171, -0.20863188048048567, 0.01955056244090277, 0.014641124460225304, 0.1792741084859396, 0.0169318023409384, -0.0015722320065833628, 0.18421473926476514, 0.256625690421788, 0.15064492865737217, 0.1471767657843884, 0.0024249271390241727, -0.1472297810173283, -0.21355572931934147, -0.08359288026961925, -0.0936444859369658, -0.05548425167022894, -0.06102686155657769, -0.09477961913216859, 0.32036494063601517, 0.26178535631624983, 0.13112400679771477, 0.15669170172089555, 0.3793992584416022, 0.05362408853931508, 0.04981717978953384, 0.14078948598956534, 0.13485135863738834, -0.006533135869540274, 0.14596406059572473, -0.2359359450560684, 0.11266437955588723, 0.030647335320585018] |
1,803.02907 | The tangent space to the space of 0-cycles | Let $S$ be a Noetherian scheme, and let $X$ be a scheme over $S$, such that
all relative symmetric powers of $X$ over $S$ exist. Assume that either $S$ is
of pure characteristic $0$ or $X$ is flat over $S$. Assume also that the
structural morphism from $X$ to $S$ admits a section, and use it to construct
the connected infinite symmetric power ${\rm Sym}^{\infty }(X/S)$ of the scheme
$X$ over $S$. This is a commutative monoid whose group completion ${\rm
Sym}^{\infty }(X/S)^+$ is an abelian group object in the category of set valued
sheaves on the Nisnevich site over $S$, which is known to be isomorphic, as a
Nisnevich sheaf, to the sheaf of relative $0$-cycles in Rydh's sense. Being
restricted on seminormal schemes over $\mathbb Q$, it is also isomorphic to the
sheaf of relative $0$-cycles in the sense of Suslin-Voevodsky and Koll\'ar. In
the paper we construct a locally ringed Nisnevich-\'etale site of $0$-cycles
${\rm Sym}^{\infty }(X/S)^+_{\rm {Nis-et}}$, such that the category of \'etale
neighbourhoods, at each point $P$ on it, is cofiltered. This yields the sheaf
of K\"ahler differentials $\Omega ^1_{{\rm Sym}^{\infty }(X/S)^+}$ and its
dual, the tangent sheaf $T_{{\rm Sym}^{\infty }(X/S)^+}$ on the space ${\rm
Sym}^{\infty }(X/S)^+$. Applying the stalk functor, we obtain the stalk
$T_{{\rm Sym}^{\infty }(X/S)^+,P}$ of the tangent sheaf at $P$, whose tensor
product with the residue field $\kappa (P)$ is our tangent space to the space
of $0$-cycles at $P$.
| math.AG | let s be a noetherian scheme and let x be a scheme over s such that all relative symmetric powers of x over s exist assume that either s is of pure characteristic 0 or x is flat over s assume also that the structural morphism from x to s admits a section and use it to construct the connected infinite symmetric power rm syminfty xs of the scheme x over s this is a commutative monoid whose group completion rm syminfty xs is an abelian group object in the category of set valued sheaves on the nisnevich site over s which is known to be isomorphic as a nisnevich sheaf to the sheaf of relative 0cycles in rydhs sense being restricted on seminormal schemes over mathbb q it is also isomorphic to the sheaf of relative 0cycles in the sense of suslinvoevodsky and kollar in the paper we construct a locally ringed nisnevichetale site of 0cycles rm syminfty xs_rm niset such that the category of etale neighbourhoods at each point p on it is cofiltered this yields the sheaf of kahler differentials omega 1_rm syminfty xs and its dual the tangent sheaf t_rm syminfty xs on the space rm syminfty xs applying the stalk functor we obtain the stalk t_rm syminfty xsp of the tangent sheaf at p whose tensor product with the residue field kappa p is our tangent space to the space of 0cycles at p | [['let', 's', 'be', 'a', 'noetherian', 'scheme', 'and', 'let', 'x', 'be', 'a', 'scheme', 'over', 's', 'such', 'that', 'all', 'relative', 'symmetric', 'powers', 'of', 'x', 'over', 's', 'exist', 'assume', 'that', 'either', 's', 'is', 'of', 'pure', 'characteristic', '0', 'or', 'x', 'is', 'flat', 'over', 's', 'assume', 'also', 'that', 'the', 'structural', 'morphism', 'from', 'x', 'to', 's', 'admits', 'a', 'section', 'and', 'use', 'it', 'to', 'construct', 'the', 'connected', 'infinite', 'symmetric', 'power', 'rm', 'syminfty', 'xs', 'of', 'the', 'scheme', 'x', 'over', 's', 'this', 'is', 'a', 'commutative', 'monoid', 'whose', 'group', 'completion', 'rm', 'syminfty', 'xs', 'is', 'an', 'abelian', 'group', 'object', 'in', 'the', 'category', 'of', 'set', 'valued', 'sheaves', 'on', 'the', 'nisnevich', 'site', 'over', 's', 'which', 'is', 'known', 'to', 'be', 'isomorphic', 'as', 'a', 'nisnevich', 'sheaf', 'to', 'the', 'sheaf', 'of', 'relative', '0cycles', 'in', 'rydhs', 'sense', 'being', 'restricted', 'on', 'seminormal', 'schemes', 'over', 'mathbb', 'q', 'it', 'is', 'also', 'isomorphic', 'to', 'the', 'sheaf', 'of', 'relative', '0cycles', 'in', 'the', 'sense', 'of', 'suslinvoevodsky', 'and', 'kollar', 'in', 'the', 'paper', 'we', 'construct', 'a', 'locally', 'ringed', 'nisnevichetale', 'site', 'of', '0cycles', 'rm', 'syminfty', 'xs_rm', 'niset', 'such', 'that', 'the', 'category', 'of', 'etale', 'neighbourhoods', 'at', 'each', 'point', 'p', 'on', 'it', 'is', 'cofiltered', 'this', 'yields', 'the', 'sheaf', 'of', 'kahler', 'differentials', 'omega', '1_rm', 'syminfty', 'xs', 'and', 'its', 'dual', 'the', 'tangent', 'sheaf', 't_rm', 'syminfty', 'xs', 'on', 'the', 'space', 'rm', 'syminfty', 'xs', 'applying', 'the', 'stalk', 'functor', 'we', 'obtain', 'the', 'stalk', 't_rm', 'syminfty', 'xsp', 'of', 'the', 'tangent', 'sheaf', 'at', 'p', 'whose', 'tensor', 'product', 'with', 'the', 'residue', 'field', 'kappa', 'p', 'is', 'our', 'tangent', 'space', 'to', 'the', 'space', 'of', '0cycles', 'at', 'p']] | [-0.21118533472793224, 0.046083087239697534, -0.08481975625523835, 0.003909837128196517, -0.06934908342062153, -0.14550231742417902, 0.019230870579261906, 0.37360975908863747, -0.39986503371793747, -0.12152194902927686, 0.04488092046390232, -0.2529164070582403, -0.05750578595673602, 0.18074622077511177, -0.1355301715974879, -0.11293786254728364, -0.015698638517791644, 0.16607415983970794, -0.10526891116104606, -0.2971475705520337, 0.40784117329913455, -0.044398667233096614, 0.25221567045057464, 0.013794161204216827, 0.13013348521557278, -0.0071392743509963285, 0.02293477627487543, -0.025011760807913553, -0.1667212169478363, 0.09467591564907318, 0.32974595845175475, 0.0537323803983183, 0.18053079774263953, -0.315596715395904, -0.11932430143814343, 0.2511367109513635, 0.08406393259015475, -0.07586234375589694, 0.05977231103321935, -0.25125818287965673, 0.1828175870856891, -0.19456207387260774, -0.09655364073661721, -0.06888372673947588, 0.1335653332649117, 0.01289050354479024, -0.2709404432740158, -0.046478178245652244, 0.07977622445484571, 0.11752451859060356, -0.051512498946852475, -0.10084627794786397, -0.16234738996021578, -0.005985165290478776, -0.018812875480303526, 0.19233543270378986, 0.12244725156511761, -0.03416717188576093, -0.07988111248625936, 0.38744230471097696, -0.11932028274939388, -0.196181553736345, 0.08701329685461062, -0.19206408294351596, -0.09193600461276996, 0.19366236719597354, 0.0364024922128321, 0.2303805794302199, 0.06677618391143206, 0.26954427916600376, -0.1424610038411318, 0.08846568127183152, 0.0773121688164707, 0.024101992949652366, 0.11465180065193309, 0.1043533336960225, 0.09374893594405845, 0.026290158855103943, -0.033911750466825485, 0.024789699860729087, -0.4044986627796967, -0.219972178632489, -0.09925588445278266, 0.22071171916909835, -0.08167081647706775, -0.14704045945476008, 0.3419188771912691, 0.029723669091860454, 0.21791729512704042, 0.0920589167279446, 0.21575246133560982, 0.019679269281329893, 0.03215849163750999, 0.058137111705091074, 0.07406231936099184, 0.21842576699872684, -0.057228346704505384, -0.13144506217437224, 0.023725569968581453, 0.20750284153156173] |
1,803.02908 | On the Improved Nonlinear Tracking Differentiator based Nonlinear PID
Controller Design | This paper presents a new improved nonlinear tracking differentiator (INTD)
with hyperbolic tangent function in the state space system. The stability and
convergence of the INTD are thoroughly investigated and proved. Through the
error analysis, the proposed INTD can extract differentiation of any piecewise
smooth nonlinear signal to reach a high accuracy. the INTD has the required
filtering features and can cope with th nonlinearities caused by the niose.
Through simulations, the INTD is implemented as signal derivative generator for
the closed loop feedback control system with a nolinear PID controller for the
nonlinear Mass Spring Damper system and showed that it could achieve the signal
tracking and differentiation faster with a minimum mean square error.
| math.OC eess.SP | this paper presents a new improved nonlinear tracking differentiator intd with hyperbolic tangent function in the state space system the stability and convergence of the intd are thoroughly investigated and proved through the error analysis the proposed intd can extract differentiation of any piecewise smooth nonlinear signal to reach a high accuracy the intd has the required filtering features and can cope with th nonlinearities caused by the niose through simulations the intd is implemented as signal derivative generator for the closed loop feedback control system with a nolinear pid controller for the nonlinear mass spring damper system and showed that it could achieve the signal tracking and differentiation faster with a minimum mean square error | [['this', 'paper', 'presents', 'a', 'new', 'improved', 'nonlinear', 'tracking', 'differentiator', 'intd', 'with', 'hyperbolic', 'tangent', 'function', 'in', 'the', 'state', 'space', 'system', 'the', 'stability', 'and', 'convergence', 'of', 'the', 'intd', 'are', 'thoroughly', 'investigated', 'and', 'proved', 'through', 'the', 'error', 'analysis', 'the', 'proposed', 'intd', 'can', 'extract', 'differentiation', 'of', 'any', 'piecewise', 'smooth', 'nonlinear', 'signal', 'to', 'reach', 'a', 'high', 'accuracy', 'the', 'intd', 'has', 'the', 'required', 'filtering', 'features', 'and', 'can', 'cope', 'with', 'th', 'nonlinearities', 'caused', 'by', 'the', 'niose', 'through', 'simulations', 'the', 'intd', 'is', 'implemented', 'as', 'signal', 'derivative', 'generator', 'for', 'the', 'closed', 'loop', 'feedback', 'control', 'system', 'with', 'a', 'nolinear', 'pid', 'controller', 'for', 'the', 'nonlinear', 'mass', 'spring', 'damper', 'system', 'and', 'showed', 'that', 'it', 'could', 'achieve', 'the', 'signal', 'tracking', 'and', 'differentiation', 'faster', 'with', 'a', 'minimum', 'mean', 'square', 'error']] | [-0.143208211781862, 0.025792091457254213, -0.07363950885812064, 0.01605038128833732, -0.0623056850436589, -0.16974453018249377, -0.020285108712825763, 0.35662882127799095, -0.2965387673805589, -0.2807654661855296, 0.17373722321353852, -0.24578244491358814, -0.1711440635845065, 0.2128541628141766, -0.08870406405008195, 0.13624466660877932, 0.06819011186269801, 0.05653425271562098, -0.06668119452331904, -0.20981739432672444, 0.24566773299289787, 0.06988425784055953, 0.23285167786576177, 0.0030237142695114017, 0.20638203538306382, -0.01859705534601665, -0.0007446867130372836, 0.012370246490615461, -0.10436657568086799, 0.06606667061923477, 0.22036526276041632, 0.09716544834006091, 0.307005842262879, -0.3635798574465772, -0.2242338209291515, 0.10493603605048164, 0.14090587489873818, 0.05027949247590226, -0.07605688590556384, -0.30340398622919684, 0.1148775042237147, -0.1696492572274545, -0.10664746059590707, -0.09953196457101275, -0.02040650027439646, 0.05359841297229097, -0.33635090432413245, 0.05778342085364072, 0.051071437162792555, 0.06311167495568161, -0.04017680337166657, -0.06658268508643074, -0.052413667224185626, 0.10329638495535144, -0.02800829390509297, 0.071101407237027, 0.13102604667858586, -0.08420936343179125, -0.1235591198661891, 0.3403919609668462, -0.1013863048819906, -0.2666480875968852, 0.14298645369303614, -0.1353603066755054, -0.03844927540858802, 0.1774090266430152, 0.21139723322475734, 0.059100744157584144, -0.14555985060237023, 0.07401905279839412, 0.050814352968059806, 0.21648294656415995, 0.04955244329150604, -0.0031513089516564557, 0.10435285451619522, 0.20142155567427045, 0.10309642541991627, 0.1205098957673687, -0.07147611187285055, -0.07042260341670202, -0.2860342709914498, -0.14209469127995164, -0.13669223316094797, -0.023006988927195576, -0.08378806730862656, -0.1412896617639648, 0.40996624292481854, 0.10768253912582346, 0.1309570056953184, 0.08280227826300847, 0.3319906479871386, 0.17653431291641344, 0.07209398906030084, 0.07907486113760134, 0.2812077903877134, 0.12902840662180728, 0.11935283945792395, -0.27478585277846, 0.07376371716938751, 0.09239012882842318] |
1,803.02909 | Hierarchical relaxation dynamics in a tilted two-band Bose-Hubbard model | We numerically examine slow and hierarchical relaxation dynamics of
interacting bosons described by a tilted two-band Bose-Hubbard model. The
system is found to exhibit signatures of quantum chaos within the spectrum and
the validity of the eigenstate thermalization hypothesis for relevant physical
observables is demonstrated for certain parameter regimes. Using the truncated
Wigner representation in the semiclassical limit of the system, dynamics of
relevant observables reveal hierarchical relaxation and the appearance of
prethermalized states is studied from the perspective of statistics of the
underlying mean-field trajectories. The observed prethermalization scenario can
be attributed to different stages of glassy dynamics in the mode-time
configuration space due to dynamical phase transition between ergodic and
nonergodic trajectories.
| cond-mat.quant-gas cond-mat.stat-mech quant-ph | we numerically examine slow and hierarchical relaxation dynamics of interacting bosons described by a tilted twoband bosehubbard model the system is found to exhibit signatures of quantum chaos within the spectrum and the validity of the eigenstate thermalization hypothesis for relevant physical observables is demonstrated for certain parameter regimes using the truncated wigner representation in the semiclassical limit of the system dynamics of relevant observables reveal hierarchical relaxation and the appearance of prethermalized states is studied from the perspective of statistics of the underlying meanfield trajectories the observed prethermalization scenario can be attributed to different stages of glassy dynamics in the modetime configuration space due to dynamical phase transition between ergodic and nonergodic trajectories | [['we', 'numerically', 'examine', 'slow', 'and', 'hierarchical', 'relaxation', 'dynamics', 'of', 'interacting', 'bosons', 'described', 'by', 'a', 'tilted', 'twoband', 'bosehubbard', 'model', 'the', 'system', 'is', 'found', 'to', 'exhibit', 'signatures', 'of', 'quantum', 'chaos', 'within', 'the', 'spectrum', 'and', 'the', 'validity', 'of', 'the', 'eigenstate', 'thermalization', 'hypothesis', 'for', 'relevant', 'physical', 'observables', 'is', 'demonstrated', 'for', 'certain', 'parameter', 'regimes', 'using', 'the', 'truncated', 'wigner', 'representation', 'in', 'the', 'semiclassical', 'limit', 'of', 'the', 'system', 'dynamics', 'of', 'relevant', 'observables', 'reveal', 'hierarchical', 'relaxation', 'and', 'the', 'appearance', 'of', 'prethermalized', 'states', 'is', 'studied', 'from', 'the', 'perspective', 'of', 'statistics', 'of', 'the', 'underlying', 'meanfield', 'trajectories', 'the', 'observed', 'prethermalization', 'scenario', 'can', 'be', 'attributed', 'to', 'different', 'stages', 'of', 'glassy', 'dynamics', 'in', 'the', 'modetime', 'configuration', 'space', 'due', 'to', 'dynamical', 'phase', 'transition', 'between', 'ergodic', 'and', 'nonergodic', 'trajectories']] | [-0.15626980947326474, 0.21526616985654146, -0.16048568989379466, 0.11659799199613158, 0.040235537200119444, -0.14730675026580725, 0.019887987994053197, 0.30070042327474966, -0.29519094898884674, -0.2330143401910246, 0.03227381191867511, -0.22306636655785606, -0.15181003232791493, 0.13826209069971424, 0.03994671326435575, 0.08093541031456099, 0.0441408958842368, 0.006977717798054878, -0.07668958003509098, -0.17453698533507572, 0.3156004453127363, 0.0452322670025751, 0.2938819488333291, -0.002114057474959213, 0.07999000154369701, 0.015082892364270128, 0.0727800149099687, -0.005985750581098687, -0.14809913835611888, 0.008834526702592693, 0.2153344777746505, 0.0691373523694836, 0.2003987755593473, -0.41393543511167563, -0.23990431655429106, 0.06685676454593205, 0.18777252814476997, 0.11841754423273085, 0.021811567559071807, -0.34893832583211165, -0.012166835264657188, -0.16874764424509706, -0.18615791092387737, -0.1269946902396932, -0.0014743949492684507, -0.016593433281950717, -0.2557828120178485, 0.17142733784837533, 0.06361492026666286, 0.057234782898650235, -0.06925634381493175, -0.021382370549542583, -0.019162080613319324, 0.09882678605813895, 0.04815077240088444, -0.05559207434432202, 0.16196317340976732, -0.12236982144299993, -0.1434371354289155, 0.40130600343103956, -0.05051398345689594, -0.1455818806461726, 0.23998143910574604, -0.20016013227188878, -0.11229253132143512, 0.16176748629741833, 0.1369260368061013, 0.07965179925487764, -0.16475602830306882, 0.0896474947778542, -0.0016526490103750103, 0.1394285858501639, -0.024399558484010334, 0.0869497321298824, 0.24645253541195286, 0.21000741444429202, -0.02232203439014049, 0.16843427513186218, -0.07868615204913426, -0.2679704527403599, -0.26775464402363364, -0.08477416255540189, -0.2217100481296667, 0.05236634079663627, -0.0788502025029589, -0.1435063041280955, 0.43357178483537473, 0.15903216481324187, 0.21931530955964618, 0.005033985151192256, 0.19686228477404313, 0.1603304834797385, -0.016117368713515785, 0.03273064342319174, 0.2612045093530179, 0.16202061784255886, 0.08315360769464643, -0.3107727938805567, 0.06718391734092966, 0.07669713062984226] |
1,803.0291 | Classification of integrable complex structures on 6-dimensional product
Lie algebras | We classify all integrable complex structures on 6-dimensional Lie algebras
of the form $\mathfrak{g}\times\mathfrak{g}$.
| math.DG | we classify all integrable complex structures on 6dimensional lie algebras of the form mathfrakgtimesmathfrakg | [['we', 'classify', 'all', 'integrable', 'complex', 'structures', 'on', '6dimensional', 'lie', 'algebras', 'of', 'the', 'form', 'mathfrakgtimesmathfrakg']] | [-0.25469821519576585, 0.010887396378585925, 0.04335595438113579, 0.1382067689958673, -0.24899305285026246, -0.10297340541504897, -0.18280081680187812, 0.4479278704294792, -0.298911010989776, -0.13373479189781043, 0.1535307723813905, -0.23240041675475928, -0.2528516065615874, 0.16957176827753967, -0.05101891220189058, -0.11873364047362255, 0.028940322934291683, 0.16453912109136581, -0.20370172078792864, -0.3469684341779122, 0.5505127333677732, -0.1603362542541268, 0.18721370857495528, -0.11529462211407147, 0.18290681979404047, 0.01835802860128192, 0.013414675369858742, -0.029242597806912202, -0.1803186284378171, 0.16192681872500822, 0.32157924513404185, 0.005812659680556793, 0.039801481538094007, -0.3500003700072949, -0.10984820765084945, 0.1924759570795756, 0.20620519975916698, 0.029935284589345638, 0.03370706718235921, -0.27823408521138704, 0.04382886064167206, -0.1705195938165371, -0.18213907808351976, -0.14749188090746218, 0.007069911951055894, -0.03348936971563559, -0.08213294655657731, 0.054059100265686326, 0.057435330290060774, 0.13890894839110282, -0.2677631750702858, -0.07776793394273576, -0.103563341885232, 0.06230314906973105, -0.23512511913521358, -0.07817946392326401, 0.14793955208733678, -0.04727525181638507, -0.18383384087624458, 0.379079258069396, 0.08450211899784896, -0.30657633078786045, 0.18658428753797823, -0.22246438995576823, -0.28700491986595666, 0.14345916962394348, 0.17229864545739615, 0.11897243100863236, -0.06818566786555144, 0.2465832201907268, -0.12354372291324231, -0.0400131493806839, 0.10887196337660918, -0.0559628362265917, 0.18785767285869673, 0.16512028242533022, -0.00815878500445531, 0.040754856971594006, 0.10238255598009206, -0.09975866905341928, -0.3527946231456903, -0.1726635113501778, -0.0034649375772390226, 0.22679753028429472, -0.11244173090045269, -0.2491121183221157, 0.48794017422299546, 0.06758848061928383, 0.25364937575963825, 0.11257319188175294, 0.08177737003335586, -0.003414213442458556, 0.2506557730241464, 0.07696994623312584, 0.08537779852318075, 0.285699843070828, -0.08165217907382892, -0.06906238699761721, -0.19539250580307382, 0.16729121225384566] |
1,803.02911 | The Serre-Swan theorem for normed modules | The aim of this note is to analyse the structure of the $L^0$-normed
$L^0$-modules over a metric measure space. These are a tool that has been
introduced by N. Gigli to develop a differential calculus on spaces verifying
the Riemannian Curvature Dimension condition. More precisely, we discuss under
which conditions an $L^0$-normed $L^0$-module can be viewed as the space of
sections of a suitable measurable Banach bundle and in which sense such
correspondence can be actually made into an equivalence of categories.
| math.DG math.MG | the aim of this note is to analyse the structure of the l0normed l0modules over a metric measure space these are a tool that has been introduced by n gigli to develop a differential calculus on spaces verifying the riemannian curvature dimension condition more precisely we discuss under which conditions an l0normed l0module can be viewed as the space of sections of a suitable measurable banach bundle and in which sense such correspondence can be actually made into an equivalence of categories | [['the', 'aim', 'of', 'this', 'note', 'is', 'to', 'analyse', 'the', 'structure', 'of', 'the', 'l0normed', 'l0modules', 'over', 'a', 'metric', 'measure', 'space', 'these', 'are', 'a', 'tool', 'that', 'has', 'been', 'introduced', 'by', 'n', 'gigli', 'to', 'develop', 'a', 'differential', 'calculus', 'on', 'spaces', 'verifying', 'the', 'riemannian', 'curvature', 'dimension', 'condition', 'more', 'precisely', 'we', 'discuss', 'under', 'which', 'conditions', 'an', 'l0normed', 'l0module', 'can', 'be', 'viewed', 'as', 'the', 'space', 'of', 'sections', 'of', 'a', 'suitable', 'measurable', 'banach', 'bundle', 'and', 'in', 'which', 'sense', 'such', 'correspondence', 'can', 'be', 'actually', 'made', 'into', 'an', 'equivalence', 'of', 'categories']] | [-0.1299638323665632, 0.08671318256344847, -0.1385785120338956, 0.10623970436804657, -0.08280612211497619, -0.09212549527093203, -0.0417407652822948, 0.3902266491911834, -0.3063119763767795, -0.23767961920062197, 0.1317395372537283, -0.19492599205998115, -0.15870921339992952, 0.1983541125472918, -0.14800408564484382, 0.025699194862589807, 0.03569268786548814, 0.08713857240715547, -0.07692594856577867, -0.24898487859835872, 0.445759604189875, 0.02575790658121622, 0.21958869577185075, 0.05116575513892701, 0.1281853120750453, -0.010090552158417958, -0.010870689431889147, 0.09151562188878726, -0.15927202950419247, 0.1468050852535835, 0.27872541120063654, 0.13049806749132828, 0.26572374460733894, -0.38181314630363183, -0.19381631355544057, 0.16266776527030558, 0.09767145381155837, 0.019800815613398068, 0.006460725424680093, -0.33883434286506114, 0.09672090257930605, -0.13248950833619771, -0.1232846433921611, -0.13523350319459657, 0.02989441438731325, -0.042166156635348555, -0.2689216259573704, -0.06797096195713251, 0.09263804991128324, 0.05783740469973676, -0.06607269572648161, -0.03147068061523988, -0.03941673911294511, 0.08876609935313227, 0.015117906042834438, 0.05989723068756299, 0.07237637440874418, -0.03848261165409054, -0.10686791956548497, 0.37003210035471035, -0.08610940645625696, -0.27124189260073855, 0.1423614514119263, -0.12198153336803559, -0.1280593329722274, 0.07432724706993639, 0.15838446887210011, 0.1574715846984447, -0.146981484434255, 0.1431114379238467, -0.07977277046376013, 0.12683952810195617, 0.08656368277896243, 0.041900863947606164, 0.15785621116645163, 0.14520879970462638, 0.12218695147481712, 0.12729745883718604, -0.019383282804437265, -0.059359398637338294, -0.33905870184490955, -0.26654537972298603, -0.10741908493439985, 0.1175009074231869, -0.07505097826688603, -0.15324438332662552, 0.34375119342504046, 0.08424016810906461, 0.2444675945782963, 0.0644722785240723, 0.21951960599273915, 0.12706236132638693, 0.061062677499625975, 0.02209434968115809, 0.20305044773400208, 0.18716160276067692, 0.04006565820066187, -0.0942025574784773, 0.05005488054874011, 0.1372484977746123] |
1,803.02912 | A Brandom-ian view of Reinforcement Learning towards strong-AI | The analytic philosophy of Robert Brandom, based on the ideas of pragmatism,
paints a picture of sapience, through inferentialism. In this paper, we present
a theory, that utilizes essential elements of Brandom's philosophy, towards the
objective of achieving strong-AI. We do this by connecting the constitutive
elements of reinforcement learning and the Game Of Giving and Asking For
Reasons. Further, following Brandom's prescriptive thoughts, we restructure the
popular reinforcement learning algorithm A3C, and show that RL algorithms can
be tuned towards the objective of strong-AI.
| cs.AI | the analytic philosophy of robert brandom based on the ideas of pragmatism paints a picture of sapience through inferentialism in this paper we present a theory that utilizes essential elements of brandoms philosophy towards the objective of achieving strongai we do this by connecting the constitutive elements of reinforcement learning and the game of giving and asking for reasons further following brandoms prescriptive thoughts we restructure the popular reinforcement learning algorithm a3c and show that rl algorithms can be tuned towards the objective of strongai | [['the', 'analytic', 'philosophy', 'of', 'robert', 'brandom', 'based', 'on', 'the', 'ideas', 'of', 'pragmatism', 'paints', 'a', 'picture', 'of', 'sapience', 'through', 'inferentialism', 'in', 'this', 'paper', 'we', 'present', 'a', 'theory', 'that', 'utilizes', 'essential', 'elements', 'of', 'brandoms', 'philosophy', 'towards', 'the', 'objective', 'of', 'achieving', 'strongai', 'we', 'do', 'this', 'by', 'connecting', 'the', 'constitutive', 'elements', 'of', 'reinforcement', 'learning', 'and', 'the', 'game', 'of', 'giving', 'and', 'asking', 'for', 'reasons', 'further', 'following', 'brandoms', 'prescriptive', 'thoughts', 'we', 'restructure', 'the', 'popular', 'reinforcement', 'learning', 'algorithm', 'a3c', 'and', 'show', 'that', 'rl', 'algorithms', 'can', 'be', 'tuned', 'towards', 'the', 'objective', 'of', 'strongai']] | [-0.042346006381558256, 0.034076135396026073, -0.15188382305204867, 0.028616924351081253, -0.12957858584122733, -0.13827150561292, 0.08130150725191924, 0.41146695462521166, -0.252846929745283, -0.3014271091495175, 0.044619294685253406, -0.22335910617839544, -0.2505087892524898, 0.1735471149404475, -0.13631322337446364, 0.01565449652262032, 0.0359754356672056, 0.008164682763163001, -0.04698284593177959, -0.2355077600106597, 0.3500849774631206, 0.03149227992253145, 0.25911745805060493, 0.05357284708152292, 0.14146025877271312, 0.021125719574047252, -0.0266719231789466, 0.03641915469197556, -0.11840338871570566, 0.2314226981252432, 0.30812989224214105, 0.2582310067198705, 0.408578945370391, -0.44156453415125724, -0.13227942952507873, 0.0774842466082191, 0.15121857059421018, 0.0892138522991445, -0.051173345344432165, -0.2928310549701564, 0.07047900270554237, -0.14120350475932356, -0.0889545458368957, -0.07087492347345688, -0.03039284273982048, 0.01388587433611974, -0.2517629175737966, -0.042164791072718796, 0.1205247902078554, 0.06326690815621987, -0.04054629864986055, -0.14349529466126115, 0.08777623479254544, 0.14759202851564623, 0.05014139105333015, 0.029091766074998304, 0.1392482392162492, -0.1598374525186955, -0.1769382189027965, 0.3616997465491295, -0.0288167400052771, -0.11070511853322387, 0.1556705891911406, -0.010539771233743523, -0.14475134884705768, 0.021067365439375863, 0.19504789262718986, 0.12274252564875496, -0.1329738071304746, 0.06431196156554506, -0.04025277828040998, 0.129792425854248, 0.009359031799249351, -0.02733395955292508, 0.18074441060307436, 0.22607113483827562, 0.027032498249900526, 0.10075580407719827, 0.01786141343472991, -0.11773867094889283, -0.2699159941927064, -0.18594631777377799, -0.14603919709043112, 0.03351226937229512, -0.06600584594361862, -0.12617502121720464, 0.3857078701723367, 0.2137334134837147, 0.16070858360180865, 0.11544073261320591, 0.31130273521412166, 0.04862024906324223, 0.04831550588132814, 0.0969397391541861, 0.24240184944937937, 0.0842617294198135, 0.1357976136088837, -0.1938543922326062, 0.11139671941054985, 0.0970784574688878] |
1,803.02913 | Magnetically-defined topological edge plasmons in edgeless electron gas | Topological materials bear gapped excitations in bulk yet protected gapless
excitations at boundaries. Magnetoplasmons (MPs), as high-frequency density
excitations of two-dimensional electron gas (2DEG) in a perpendicular magnetic
field, embody a prototype of band topology for bosons. The
time-reversal-breaking magnetic field opens a topological gap for bulk MPs up
to the cyclotron frequency; topologically-protected edge magnetoplasmons (EMPs)
bridge the bulk gap and propagate unidirectionally along system's boundaries.
However, all the EMPs known to date adhere to physical edges where the electron
density terminates abruptly. This restriction has made device application
extremely difficult. Here we demonstrate a new class of topological edge
plasmons -- domain-boundary magnetoplasmons (DBMPs), within a uniform edgeless
2DEG. Such DBMPs arise at the domain boundaries of an engineered sign-changing
magnetic field and are protected by the difference of gap Chern numbers (+/-1)
across the magnetic domains. They propagate unidirectionally along the domain
boundaries and are immune to domain defects. Moreover, they exhibit wide
tunability in the microwave frequency range under an applied magnetic field or
gate voltage. Our study opens a new direction to realize high-speed
reconfigurable topological devices.
| cond-mat.mtrl-sci cond-mat.mes-hall physics.optics physics.plasm-ph quant-ph | topological materials bear gapped excitations in bulk yet protected gapless excitations at boundaries magnetoplasmons mps as highfrequency density excitations of twodimensional electron gas 2deg in a perpendicular magnetic field embody a prototype of band topology for bosons the timereversalbreaking magnetic field opens a topological gap for bulk mps up to the cyclotron frequency topologicallyprotected edge magnetoplasmons emps bridge the bulk gap and propagate unidirectionally along systems boundaries however all the emps known to date adhere to physical edges where the electron density terminates abruptly this restriction has made device application extremely difficult here we demonstrate a new class of topological edge plasmons domainboundary magnetoplasmons dbmps within a uniform edgeless 2deg such dbmps arise at the domain boundaries of an engineered signchanging magnetic field and are protected by the difference of gap chern numbers 1 across the magnetic domains they propagate unidirectionally along the domain boundaries and are immune to domain defects moreover they exhibit wide tunability in the microwave frequency range under an applied magnetic field or gate voltage our study opens a new direction to realize highspeed reconfigurable topological devices | [['topological', 'materials', 'bear', 'gapped', 'excitations', 'in', 'bulk', 'yet', 'protected', 'gapless', 'excitations', 'at', 'boundaries', 'magnetoplasmons', 'mps', 'as', 'highfrequency', 'density', 'excitations', 'of', 'twodimensional', 'electron', 'gas', '2deg', 'in', 'a', 'perpendicular', 'magnetic', 'field', 'embody', 'a', 'prototype', 'of', 'band', 'topology', 'for', 'bosons', 'the', 'timereversalbreaking', 'magnetic', 'field', 'opens', 'a', 'topological', 'gap', 'for', 'bulk', 'mps', 'up', 'to', 'the', 'cyclotron', 'frequency', 'topologicallyprotected', 'edge', 'magnetoplasmons', 'emps', 'bridge', 'the', 'bulk', 'gap', 'and', 'propagate', 'unidirectionally', 'along', 'systems', 'boundaries', 'however', 'all', 'the', 'emps', 'known', 'to', 'date', 'adhere', 'to', 'physical', 'edges', 'where', 'the', 'electron', 'density', 'terminates', 'abruptly', 'this', 'restriction', 'has', 'made', 'device', 'application', 'extremely', 'difficult', 'here', 'we', 'demonstrate', 'a', 'new', 'class', 'of', 'topological', 'edge', 'plasmons', 'domainboundary', 'magnetoplasmons', 'dbmps', 'within', 'a', 'uniform', 'edgeless', '2deg', 'such', 'dbmps', 'arise', 'at', 'the', 'domain', 'boundaries', 'of', 'an', 'engineered', 'signchanging', 'magnetic', 'field', 'and', 'are', 'protected', 'by', 'the', 'difference', 'of', 'gap', 'chern', 'numbers', '1', 'across', 'the', 'magnetic', 'domains', 'they', 'propagate', 'unidirectionally', 'along', 'the', 'domain', 'boundaries', 'and', 'are', 'immune', 'to', 'domain', 'defects', 'moreover', 'they', 'exhibit', 'wide', 'tunability', 'in', 'the', 'microwave', 'frequency', 'range', 'under', 'an', 'applied', 'magnetic', 'field', 'or', 'gate', 'voltage', 'our', 'study', 'opens', 'a', 'new', 'direction', 'to', 'realize', 'highspeed', 'reconfigurable', 'topological', 'devices']] | [-0.26965100945177745, 0.2548300272002413, -0.014390174544015743, 0.0022566655348965577, -0.09991237269480344, -0.18825851434415114, 0.07356759515075877, 0.42203412755449726, -0.2969574523594116, -0.2878042537336597, 0.010018747783130732, -0.2701099463764516, -0.12355794501490891, 0.19343428868818613, 0.00372388002179126, 0.06462992489983083, -0.039778532993631155, -0.07599248093755802, -0.06572726149470988, -0.12757190750188627, 0.2681819796302049, -0.06181691335084947, 0.35521053064187896, 0.08292077337463215, 0.013887311700034325, -0.04802399945013516, 0.13904531640664014, 0.014865716196097143, -0.14133917706805235, 0.04673149901332969, 0.2838056227894677, -0.1398646928533891, 0.21401335043291556, -0.4988057861506533, -0.22849427484100757, -0.036787843961898214, 0.1839087267000457, 0.13926815669515363, -0.08508384289082098, -0.325321665924698, 0.07586981804375459, -0.1334191992483492, -0.1776707586545371, -0.07282172509354627, -0.01655467669739695, -0.04262668733789414, -0.17619146969346278, 0.04576262461240065, 0.034711090691762266, 0.0939587946440088, -0.08560235501898195, -0.06137565991388603, -0.09722491436866866, 0.10348865178211426, 0.019055534143770873, 0.06454057834636649, 0.19107917126778035, -0.15167533880094453, -0.1582347246396808, 0.3193985348744266, -0.030295360573910843, -0.14698984263745765, 0.23298578050804414, -0.17122502077381288, -0.048439583764541584, 0.18222724590918787, 0.14559465736721763, 0.05235534403655241, -0.0910278594891369, 0.11778503938743262, -0.005128195984080933, 0.15222734799764676, 0.08322521823187821, 0.14075702507544424, 0.33355061806264913, 0.13960203947499394, 0.12871957931397016, 0.15991509560880632, -0.11666540533769876, -0.002016427765428687, -0.24693058752949096, -0.19680535397362275, -0.2623779084279811, 0.033799004549805764, -0.011105129721346207, -0.25934488743064954, 0.4674132387140797, 0.1488587415189217, 0.15932611478544648, -0.048227867876555426, 0.2324526971856434, 0.1075099096815596, 0.11334949374906511, 0.09815553776847001, 0.22947621845000282, 0.17226229334775586, 0.11082198170102175, -0.23335701689857719, -0.02129247009509644, -0.026323494847406054] |
1,803.02914 | Translating Questions into Answers using DBPedia n-triples | In this paper we present a question answering system using a neural network
to interpret questions learned from the DBpedia repository. We train a
sequence-to-sequence neural network model with n-triples extracted from the
DBpedia Infobox Properties. Since these properties do not represent the natural
language, we further used question-answer dialogues from movie subtitles.
Although the automatic evaluation shows a low overlap of the generated answers
compared to the gold standard set, a manual inspection of the showed promising
outcomes from the experiment for further work.
| cs.CL | in this paper we present a question answering system using a neural network to interpret questions learned from the dbpedia repository we train a sequencetosequence neural network model with ntriples extracted from the dbpedia infobox properties since these properties do not represent the natural language we further used questionanswer dialogues from movie subtitles although the automatic evaluation shows a low overlap of the generated answers compared to the gold standard set a manual inspection of the showed promising outcomes from the experiment for further work | [['in', 'this', 'paper', 'we', 'present', 'a', 'question', 'answering', 'system', 'using', 'a', 'neural', 'network', 'to', 'interpret', 'questions', 'learned', 'from', 'the', 'dbpedia', 'repository', 'we', 'train', 'a', 'sequencetosequence', 'neural', 'network', 'model', 'with', 'ntriples', 'extracted', 'from', 'the', 'dbpedia', 'infobox', 'properties', 'since', 'these', 'properties', 'do', 'not', 'represent', 'the', 'natural', 'language', 'we', 'further', 'used', 'questionanswer', 'dialogues', 'from', 'movie', 'subtitles', 'although', 'the', 'automatic', 'evaluation', 'shows', 'a', 'low', 'overlap', 'of', 'the', 'generated', 'answers', 'compared', 'to', 'the', 'gold', 'standard', 'set', 'a', 'manual', 'inspection', 'of', 'the', 'showed', 'promising', 'outcomes', 'from', 'the', 'experiment', 'for', 'further', 'work']] | [0.002806943695408752, -0.024359999499452042, -0.06616679935839521, 0.0990813806693698, -0.13222631095369985, -0.12339946358879826, 0.09755051588072969, 0.43425014812544166, -0.2846582079788737, -0.34454196184334984, 0.017353592848640877, -0.3345913909689849, -0.19714727625531336, 0.22950134401529443, -0.10858597392665155, 0.07429278741383094, 0.19375174308577217, 0.0561520948372108, -0.023705362336687654, -0.2650841859965978, 0.3107025468699544, 0.02596394872259214, 0.3174801697303732, 0.019711351807577063, 0.09440958209290921, -0.05583664479508368, -0.056469237207468735, -0.007377030465370381, -0.08120415650353015, 0.20444283297591204, 0.307336831294247, 0.24711129834583725, 0.30914582624044046, -0.4079520722671625, -0.19489279538617435, 0.0663234850473096, 0.1309443782139794, 0.13744678813964128, -0.04703887789902917, -0.3648189216493124, 0.09814998884517026, -0.2094916837761201, 0.03179414266740051, -0.10178006155393927, -0.047512048990072976, -0.019447016787816244, -0.2575610399418735, -0.0002792273109487022, 0.10193615144185991, 0.1154542222102902, -0.05820611424474831, -0.07853433532859143, 0.0027104325225038163, 0.20215010159390878, 0.025866439171887218, 0.1015119451260845, 0.1196802561395768, -0.17140594448232238, -0.17758070655077338, 0.3830605660935482, -0.08163813161888127, -0.17420120018882207, 0.2076306223914207, -0.028693928170096444, -0.1523976676469018, 0.040300084726817634, 0.21917161953646735, 0.09039002616541932, -0.17706692197461085, -0.01650548803427885, -0.12334330171256898, 0.26226652019197144, 0.08164866358400827, -0.036340173333883286, 0.21828906426587738, 0.2496834622530536, -0.08797863464387336, 0.16298448187804007, -0.03939070047653583, 0.0020844389471303985, -0.2238413462392896, -0.104411555097876, -0.16935203329895634, 0.049559066852124085, -0.016995262635131198, -0.16652823297912817, 0.4195765789306487, 0.25657688578343896, 0.23561820910727405, 0.1056001977293741, 0.2769256732594895, -0.04451535204660389, 0.11588683553847921, 0.07829719327715595, 0.14293490057384753, -0.023343208739646227, 0.18666980578283587, -0.12417786395603633, 0.08088072857830718, 0.06366680054196033] |
1,803.02915 | On cold diluted plasmas hit by short laser pulses | Adapting a plane hydrodynamical model we briefly revisit the study of the
impact of a very short and intense laser pulse onto a diluted plasma, the
formation of a plasma wave, its wave-breaking, the occurrence of the slingshot
effect.
| physics.plasm-ph physics.acc-ph | adapting a plane hydrodynamical model we briefly revisit the study of the impact of a very short and intense laser pulse onto a diluted plasma the formation of a plasma wave its wavebreaking the occurrence of the slingshot effect | [['adapting', 'a', 'plane', 'hydrodynamical', 'model', 'we', 'briefly', 'revisit', 'the', 'study', 'of', 'the', 'impact', 'of', 'a', 'very', 'short', 'and', 'intense', 'laser', 'pulse', 'onto', 'a', 'diluted', 'plasma', 'the', 'formation', 'of', 'a', 'plasma', 'wave', 'its', 'wavebreaking', 'the', 'occurrence', 'of', 'the', 'slingshot', 'effect']] | [-0.17469476002196854, 0.1862624068207179, -0.1011510754051881, 0.10229670043843679, -0.044641687033268124, -0.038420732240550794, 0.032518826759396456, 0.3722246266328372, -0.20091066335160762, -0.23868138543688333, 0.09580068095611075, -0.2142698771547144, -0.07659895560489251, 0.1912077600076699, 0.043157349698818646, -0.001483329931477037, 0.06381610611405893, -0.04795800498089729, -0.06023706452777752, -0.16000790545382562, 0.2964989185834733, 0.1481206245147265, 0.20879351627678636, 0.04254931201919531, 0.10297495647309682, 0.005401572475257592, -0.023654918998288803, -0.025709789162740495, -0.1857930957123291, 0.04449590732558416, 0.09153232159904945, 0.0655467948064399, 0.3070890012030036, -0.48000220839793867, -0.3217216324395476, 0.02257602919752781, 0.11552240155064143, 0.15952151923034436, -0.15344514060192382, -0.24094505397937235, -0.024614928505168512, -0.22757515645562074, -0.17914508981630206, 0.11705317064069021, 0.03257253804267981, 0.10644673593700506, -0.2441196200939325, 0.026375362219718788, 0.09607745210329692, 0.0029587046458170964, -0.045130777721985794, 0.02385399428506692, -0.04016456588243063, 0.011958308398532562, 0.0737750417021557, 0.09436139591539708, 0.19967876352035466, -0.1730260586915299, -0.03695923049384967, 0.4303437276528432, -0.09030201534430186, -0.07192626318488365, 0.1959252735504355, -0.22572336193078604, -0.08240690851249756, 0.17283436501374802, 0.20392268130149788, 0.15310341276180667, -0.10243998037484021, 0.00438969601274062, -0.028439788911596108, 0.1257440583744588, 0.12982203180973345, 0.022303507114068057, 0.3104829372694859, 0.2739923191853823, -0.06341776422535379, 0.19436089675395918, -0.16034323196762648, -0.029283974821177814, -0.25338690374524164, -0.06500616521598437, -0.14726166982645503, 0.06877104871277996, -0.026674028246839628, -0.18707755551888391, 0.4970648811222651, 0.17835782188922167, 0.16433739189345103, -0.0547908358514691, 0.3156791609258224, 0.12022672488521306, -0.05330350977153732, 0.012426536936217394, 0.2660665699543479, 0.20937314686866906, 0.12730497981493288, -0.3263418398415431, 0.03285380137654451, 0.050075688996376135] |
1,803.02916 | A Bayesian framework for molecular strain identification from mixed
diagnostic samples | We provide a mathematical formulation and develop a computational framework
for identifying multiple strains of microorganisms from mixed samples of DNA.
Our method is applicable in public health domains where efficient
identification of pathogens is paramount, e.g., for the monitoring of disease
outbreaks. We formulate strain identification as an inverse problem that aims
at simultaneously estimating a binary matrix (encoding presence or absence of
mutations in each strain) and a real-valued vector (representing the mixture of
strains) such that their product is approximately equal to the measured data
vector. The problem at hand has a similar structure to blind deconvolution,
except for the presence of binary constraints, which we enforce in our
approach. Following a Bayesian approach, we derive a posterior density. We
present two computational methods for solving the non-convex maximum a
posteriori estimation problem. The first one is a local optimization method
that is made efficient and scalable by decoupling the problem into smaller
independent subproblems, whereas the second one yields a global minimizer by
converting the problem into a convex mixed-integer quadratic programming
problem. The decoupling approach also provides an efficient way to integrate
over the posterior. This provides useful information about the ambiguity of the
underdetermined problem and, thus, the uncertainty associated with numerical
solutions. We evaluate the potential and limitations of our framework in silico
using synthetic and experimental data with available ground truths.
| stat.AP math.NA q-bio.QM | we provide a mathematical formulation and develop a computational framework for identifying multiple strains of microorganisms from mixed samples of dna our method is applicable in public health domains where efficient identification of pathogens is paramount eg for the monitoring of disease outbreaks we formulate strain identification as an inverse problem that aims at simultaneously estimating a binary matrix encoding presence or absence of mutations in each strain and a realvalued vector representing the mixture of strains such that their product is approximately equal to the measured data vector the problem at hand has a similar structure to blind deconvolution except for the presence of binary constraints which we enforce in our approach following a bayesian approach we derive a posterior density we present two computational methods for solving the nonconvex maximum a posteriori estimation problem the first one is a local optimization method that is made efficient and scalable by decoupling the problem into smaller independent subproblems whereas the second one yields a global minimizer by converting the problem into a convex mixedinteger quadratic programming problem the decoupling approach also provides an efficient way to integrate over the posterior this provides useful information about the ambiguity of the underdetermined problem and thus the uncertainty associated with numerical solutions we evaluate the potential and limitations of our framework in silico using synthetic and experimental data with available ground truths | [['we', 'provide', 'a', 'mathematical', 'formulation', 'and', 'develop', 'a', 'computational', 'framework', 'for', 'identifying', 'multiple', 'strains', 'of', 'microorganisms', 'from', 'mixed', 'samples', 'of', 'dna', 'our', 'method', 'is', 'applicable', 'in', 'public', 'health', 'domains', 'where', 'efficient', 'identification', 'of', 'pathogens', 'is', 'paramount', 'eg', 'for', 'the', 'monitoring', 'of', 'disease', 'outbreaks', 'we', 'formulate', 'strain', 'identification', 'as', 'an', 'inverse', 'problem', 'that', 'aims', 'at', 'simultaneously', 'estimating', 'a', 'binary', 'matrix', 'encoding', 'presence', 'or', 'absence', 'of', 'mutations', 'in', 'each', 'strain', 'and', 'a', 'realvalued', 'vector', 'representing', 'the', 'mixture', 'of', 'strains', 'such', 'that', 'their', 'product', 'is', 'approximately', 'equal', 'to', 'the', 'measured', 'data', 'vector', 'the', 'problem', 'at', 'hand', 'has', 'a', 'similar', 'structure', 'to', 'blind', 'deconvolution', 'except', 'for', 'the', 'presence', 'of', 'binary', 'constraints', 'which', 'we', 'enforce', 'in', 'our', 'approach', 'following', 'a', 'bayesian', 'approach', 'we', 'derive', 'a', 'posterior', 'density', 'we', 'present', 'two', 'computational', 'methods', 'for', 'solving', 'the', 'nonconvex', 'maximum', 'a', 'posteriori', 'estimation', 'problem', 'the', 'first', 'one', 'is', 'a', 'local', 'optimization', 'method', 'that', 'is', 'made', 'efficient', 'and', 'scalable', 'by', 'decoupling', 'the', 'problem', 'into', 'smaller', 'independent', 'subproblems', 'whereas', 'the', 'second', 'one', 'yields', 'a', 'global', 'minimizer', 'by', 'converting', 'the', 'problem', 'into', 'a', 'convex', 'mixedinteger', 'quadratic', 'programming', 'problem', 'the', 'decoupling', 'approach', 'also', 'provides', 'an', 'efficient', 'way', 'to', 'integrate', 'over', 'the', 'posterior', 'this', 'provides', 'useful', 'information', 'about', 'the', 'ambiguity', 'of', 'the', 'underdetermined', 'problem', 'and', 'thus', 'the', 'uncertainty', 'associated', 'with', 'numerical', 'solutions', 'we', 'evaluate', 'the', 'potential', 'and', 'limitations', 'of', 'our', 'framework', 'in', 'silico', 'using', 'synthetic', 'and', 'experimental', 'data', 'with', 'available', 'ground', 'truths']] | [-0.08753972642218255, 0.012167070444401833, -0.0854833476574823, 0.06022349223403024, -0.09581735795851813, -0.15596596878652327, 0.06646461199916183, 0.35650029727644145, -0.31133216807281183, -0.3037875410999013, 0.137638229132512, -0.24806411728449979, -0.16692993638088405, 0.1727646581389368, -0.057523803490592273, 0.08298116574657666, 0.09207627842788418, -0.004329885745407835, -0.06779848848770506, -0.2330576789059054, 0.2805181644281462, 0.014909795062478193, 0.2836558342602218, 0.018274209614615382, 0.15590316815785737, 0.05058819372776294, -0.01781299334592857, 0.025217666002966495, -0.09737619722114473, 0.18836686082792317, 0.31218055724654364, 0.19970709479875393, 0.3486576658708153, -0.4102877570533775, -0.22136108883337308, 0.12757453875917144, 0.13591544399708744, 0.15195664761366331, -0.05265735943525151, -0.2586801079392645, 0.08151663999341624, -0.13243767078437205, -0.07934119032215994, -0.08200374135125314, -0.017499295088735014, -0.03793477981786476, -0.33449279908502605, 0.11783249541091749, 0.012673120827497468, 0.048163441042354795, -0.12661960187437232, -0.13547127686164395, 0.01954303093825967, 0.12354719400401817, 0.05234372924391066, 0.0279831488196856, 0.10238001247162333, -0.11666754330683161, -0.10845303675668176, 0.3784648992810561, -0.02246629996489587, -0.2384913864384881, 0.16043367605924802, -0.03880388676656581, -0.1534696858087514, 0.13971079375308137, 0.21025425053250418, 0.1497115015619593, -0.18422963264460296, 0.044828725264480895, -0.03332523106013762, 0.15807193141088996, 0.01863014266936019, -0.021320706945091618, 0.1935734305252203, 0.21716939579384345, 0.12659641119395282, 0.1707607341668971, -0.09610842232639173, -0.07955023955948261, -0.2546420888306764, -0.13728873635129799, -0.1839202123208126, 0.006757668402009363, -0.1133006973143547, -0.16608486900423292, 0.38508476536745395, 0.17511274286075068, 0.16165326172018252, 0.09058498619093791, 0.3355255669773878, 0.09777898003355352, 0.03193749171299413, 0.06768294416040621, 0.1787682902921951, 0.11230694994345149, 0.05477375250185665, -0.22312033478504628, 0.10793137137969248, 0.03624587752307281] |
1,803.02917 | Rapidly forming, slowly evolving, spatial patterns from quasi-cycle
Mexican Hat coupling | A lattice-indexed family of stochastic processes has quasi-cycle oscillations
if its otherwise-damped oscillations are sustained by noise. Such a family
performs the reaction part of a discrete stochastic reaction-diffusion system
when we insert a local Mexican Hat-type, difference of Gaussians, coupling on a
one-dimensional and on a two-dimensional lattice. Quasi-cycles are a proposed
mechanism for the production of neural oscillations, and Mexican Hat coupling
is ubiquitous in the brain. Thus this combination might provide insight into
the function of neural oscillations in the brain. Importantly, we study this
system only in the transient case, on time intervals before saturation occurs.
In one dimension, for weak coupling, we find that the phases of the coupled
quasi-cycles synchronize (establish a relatively constant relationship, or
phase lock) rapidly at coupling strengths lower than those required to produce
spatial patterns of their amplitudes. In two dimensions the amplitude patterns
form more quickly, but there remain parameter regimes in which phase
synchronization patterns form without being accompanied by clear amplitude
patterns. At higher coupling strengths we find patterns both of phase
synchronization and of amplitude (resembling Turing patterns) corresponding to
the patterns of phase synchronization. Specific properties of these patterns
are controlled by the parameters of the reaction and of the Mexican Hat
coupling.
| q-bio.NC nlin.AO | a latticeindexed family of stochastic processes has quasicycle oscillations if its otherwisedamped oscillations are sustained by noise such a family performs the reaction part of a discrete stochastic reactiondiffusion system when we insert a local mexican hattype difference of gaussians coupling on a onedimensional and on a twodimensional lattice quasicycles are a proposed mechanism for the production of neural oscillations and mexican hat coupling is ubiquitous in the brain thus this combination might provide insight into the function of neural oscillations in the brain importantly we study this system only in the transient case on time intervals before saturation occurs in one dimension for weak coupling we find that the phases of the coupled quasicycles synchronize establish a relatively constant relationship or phase lock rapidly at coupling strengths lower than those required to produce spatial patterns of their amplitudes in two dimensions the amplitude patterns form more quickly but there remain parameter regimes in which phase synchronization patterns form without being accompanied by clear amplitude patterns at higher coupling strengths we find patterns both of phase synchronization and of amplitude resembling turing patterns corresponding to the patterns of phase synchronization specific properties of these patterns are controlled by the parameters of the reaction and of the mexican hat coupling | [['a', 'latticeindexed', 'family', 'of', 'stochastic', 'processes', 'has', 'quasicycle', 'oscillations', 'if', 'its', 'otherwisedamped', 'oscillations', 'are', 'sustained', 'by', 'noise', 'such', 'a', 'family', 'performs', 'the', 'reaction', 'part', 'of', 'a', 'discrete', 'stochastic', 'reactiondiffusion', 'system', 'when', 'we', 'insert', 'a', 'local', 'mexican', 'hattype', 'difference', 'of', 'gaussians', 'coupling', 'on', 'a', 'onedimensional', 'and', 'on', 'a', 'twodimensional', 'lattice', 'quasicycles', 'are', 'a', 'proposed', 'mechanism', 'for', 'the', 'production', 'of', 'neural', 'oscillations', 'and', 'mexican', 'hat', 'coupling', 'is', 'ubiquitous', 'in', 'the', 'brain', 'thus', 'this', 'combination', 'might', 'provide', 'insight', 'into', 'the', 'function', 'of', 'neural', 'oscillations', 'in', 'the', 'brain', 'importantly', 'we', 'study', 'this', 'system', 'only', 'in', 'the', 'transient', 'case', 'on', 'time', 'intervals', 'before', 'saturation', 'occurs', 'in', 'one', 'dimension', 'for', 'weak', 'coupling', 'we', 'find', 'that', 'the', 'phases', 'of', 'the', 'coupled', 'quasicycles', 'synchronize', 'establish', 'a', 'relatively', 'constant', 'relationship', 'or', 'phase', 'lock', 'rapidly', 'at', 'coupling', 'strengths', 'lower', 'than', 'those', 'required', 'to', 'produce', 'spatial', 'patterns', 'of', 'their', 'amplitudes', 'in', 'two', 'dimensions', 'the', 'amplitude', 'patterns', 'form', 'more', 'quickly', 'but', 'there', 'remain', 'parameter', 'regimes', 'in', 'which', 'phase', 'synchronization', 'patterns', 'form', 'without', 'being', 'accompanied', 'by', 'clear', 'amplitude', 'patterns', 'at', 'higher', 'coupling', 'strengths', 'we', 'find', 'patterns', 'both', 'of', 'phase', 'synchronization', 'and', 'of', 'amplitude', 'resembling', 'turing', 'patterns', 'corresponding', 'to', 'the', 'patterns', 'of', 'phase', 'synchronization', 'specific', 'properties', 'of', 'these', 'patterns', 'are', 'controlled', 'by', 'the', 'parameters', 'of', 'the', 'reaction', 'and', 'of', 'the', 'mexican', 'hat', 'coupling']] | [-0.19097989901320475, 0.20731737761299388, -0.06341038036495854, 0.08034631497513738, -0.04487703586431238, -0.1448533526391189, 0.07468633519404215, 0.3526759513346388, -0.2759590837956142, -0.26606603071333174, 0.08269006480266186, -0.2612782813454933, -0.20104810582966662, 0.18306549685867052, 0.010493116154905084, -0.003363022681334716, 0.025376881029144906, 0.03915421762269158, -0.039797849354144293, -0.1720024272211764, 0.2872117297832393, 0.004977243482270866, 0.28359413647784587, -0.022611841037236517, 0.06973044401050536, -0.05596676075975727, 0.025132873851706462, -0.013904086630610586, -0.10952474623263697, 0.041425353752503405, 0.20729474026429495, 0.07482728374120554, 0.25762241964852345, -0.4570612290747536, -0.21113032443693033, 0.1198779814311493, 0.15852966038617577, 0.11902153987191093, -0.03782864086968808, -0.2730291265331986, 0.03797023945931092, -0.11513968782433878, -0.12521538554094008, -0.09023891695214489, 0.03838945803395247, 0.033386125948700544, -0.2867086781414895, 0.11623737730031598, 0.06944882796706578, 0.07500921023864913, -0.02905701647808739, -0.046865476242230426, -0.04394097823041573, 0.12127825996662757, 0.027276169933102917, 0.014803057780898474, 0.1148386091057175, -0.14560635936292773, -0.08222954312466013, 0.341026624644885, -0.0737566103273918, -0.19375166130247662, 0.19957614167439705, -0.17149850735770034, -0.0981513193528195, 0.14688207784405394, 0.19059498753631487, 0.06316870896516422, -0.13251349758007847, 0.03696499089823439, 0.04055454799774311, 0.19759069842518673, 0.09695378951366665, 0.049797332550634094, 0.19226264993850034, 0.18587909008543577, 0.04585033147008095, 0.13313041805985917, -0.07165262157954186, -0.13186602035505715, -0.2547964307488602, -0.06222752261979198, -0.11818976932684484, 0.009996765335565162, -0.10700911363712241, -0.17995339427911902, 0.46186302493787507, 0.10175484707145285, 0.2276021044077442, 0.037503129267472846, 0.24457915953487086, 0.11789232102512083, 0.07527269473869028, 0.03731501712328167, 0.25589229847622125, 0.10502134848982819, 0.117943517916872, -0.24369834609515062, 0.097350539684802, 0.03812667460054232] |
1,803.02918 | Mixed Voltage Angle and Frequency Droop Control for Transient Stability
of Interconnected Microgrids with Loss of PMU Measurements | We consider the problem of guaranteeing transient stability of a network of
interconnected angle droop controlled microgrids, where voltage phase angle
measurements from phasor measurement units (PMUs) may be lost, leading to poor
performance and instability. In this paper, we propose a novel mixed voltage
angle and frequency droop control (MAFD) framework to improve the reliability
of such angle droop controlled microgrid interconnections. In this framework,
when the phase angle measurement is lost at a microgrid, conventional frequency
droop control is temporarily used for primary control in place of angle droop
control. We model the network of interconnected microgrids with the MAFD
architecture as a nonlinear switched system. We then propose a
dissipativity-based distributed secondary control design to guarantee transient
stability of this network under arbitrary switching between angle droop and
frequency droop controllers. We demonstrate the performance of this control
framework by simulation on a test 123-feeder distribution network.
| cs.SY math.OC | we consider the problem of guaranteeing transient stability of a network of interconnected angle droop controlled microgrids where voltage phase angle measurements from phasor measurement units pmus may be lost leading to poor performance and instability in this paper we propose a novel mixed voltage angle and frequency droop control mafd framework to improve the reliability of such angle droop controlled microgrid interconnections in this framework when the phase angle measurement is lost at a microgrid conventional frequency droop control is temporarily used for primary control in place of angle droop control we model the network of interconnected microgrids with the mafd architecture as a nonlinear switched system we then propose a dissipativitybased distributed secondary control design to guarantee transient stability of this network under arbitrary switching between angle droop and frequency droop controllers we demonstrate the performance of this control framework by simulation on a test 123feeder distribution network | [['we', 'consider', 'the', 'problem', 'of', 'guaranteeing', 'transient', 'stability', 'of', 'a', 'network', 'of', 'interconnected', 'angle', 'droop', 'controlled', 'microgrids', 'where', 'voltage', 'phase', 'angle', 'measurements', 'from', 'phasor', 'measurement', 'units', 'pmus', 'may', 'be', 'lost', 'leading', 'to', 'poor', 'performance', 'and', 'instability', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'mixed', 'voltage', 'angle', 'and', 'frequency', 'droop', 'control', 'mafd', 'framework', 'to', 'improve', 'the', 'reliability', 'of', 'such', 'angle', 'droop', 'controlled', 'microgrid', 'interconnections', 'in', 'this', 'framework', 'when', 'the', 'phase', 'angle', 'measurement', 'is', 'lost', 'at', 'a', 'microgrid', 'conventional', 'frequency', 'droop', 'control', 'is', 'temporarily', 'used', 'for', 'primary', 'control', 'in', 'place', 'of', 'angle', 'droop', 'control', 'we', 'model', 'the', 'network', 'of', 'interconnected', 'microgrids', 'with', 'the', 'mafd', 'architecture', 'as', 'a', 'nonlinear', 'switched', 'system', 'we', 'then', 'propose', 'a', 'dissipativitybased', 'distributed', 'secondary', 'control', 'design', 'to', 'guarantee', 'transient', 'stability', 'of', 'this', 'network', 'under', 'arbitrary', 'switching', 'between', 'angle', 'droop', 'and', 'frequency', 'droop', 'controllers', 'we', 'demonstrate', 'the', 'performance', 'of', 'this', 'control', 'framework', 'by', 'simulation', 'on', 'a', 'test', '123feeder', 'distribution', 'network']] | [-0.26165740096252665, 0.06927795869566195, -0.019099194993430824, -0.059767039301358675, -0.044313017683971216, -0.21450730845051474, 0.11570591716596551, 0.3954876003888984, -0.33716838257004544, -0.3252078595552083, 0.10568938792558795, -0.18245642682639499, -0.14581634188134682, 0.1934545356700554, -0.1585370383180729, 0.11475042053115593, 0.026619552991876048, -0.04253795434089301, -0.010509451133620045, -0.12928204181801833, 0.2603175751681516, 0.07429751984086143, 0.3637450279106628, -0.0031866573952680634, 0.13658499740676522, 0.00854434240896459, 0.058330423300703094, 0.03531343289148636, -0.06502540255992431, 0.06618555625565732, 0.27956298968359217, 0.07802248346517245, 0.3083412170103968, -0.435854245615128, -0.1767346950962323, 0.09328764671944592, 0.10459038621127248, 0.04300746257251052, -0.05339460703145636, -0.24337717212979004, 0.09674626342116613, -0.24315251238892902, -0.11088818747212166, -0.02718891485351814, -0.08215642839427782, 0.06509060463676714, -0.3477627570447448, 0.04889597777557904, 0.03249207421920377, 0.06016226192260136, -0.0726529479549866, -0.0368882833991187, -0.027853241901564067, 0.11809567029389381, -0.0026230032887462882, -0.015507936771091533, 0.23353546159501404, -0.08456719977691872, -0.13307265637837962, 0.3115457459942961, 0.02658934720747224, -0.21328301479631703, 0.07176862555166885, -0.10357791928204466, -0.06678361574519578, 0.07892334657045055, 0.2957020898729129, 0.09462370434161978, -0.18842184511047216, -0.025691179822163963, 0.044135859596530255, 0.21875561922565356, 0.04883097177722223, 0.045820536503364165, 0.20255662168197539, 0.27378274543746695, 0.18319235733321115, 0.15911016135384035, -0.10845225456821388, -0.0864493012721714, -0.26427995699317486, -0.08223862983031224, -0.10370398694266604, 0.019934802188550774, -0.07374220692573756, -0.11859243036860166, 0.4690448575244885, 0.17665003141633887, 0.1375389702168408, 0.08158798484539945, 0.4248660955169838, 0.14568092725526746, 0.055976121188843084, 0.06871929296534764, 0.2862728410081504, 0.10093432986209398, 0.1848634799387408, -0.29865590597930275, 0.12460851696262468, -0.023263100898276046] |
1,803.02919 | Proximal Activation of Smooth Functions in Splitting Algorithms for
Convex Image Recovery | Structured convex optimization problems typically involve a mix of smooth and
nonsmooth functions. The common practice is to activate the smooth functions
via their gradient and the nonsmooth ones via their proximity operator. We show
that, although intuitively natural, this approach is not necessarily the most
efficient numerically and that, in particular, activating all the functions
proximally may be advantageous. To make this viewpoint viable computationally,
we derive a number of new examples of proximity operators of smooth convex
functions arising in applications. A novel variational model to relax
inconsistent convex feasibility problems is also investigated within the
proposed framework. Several numerical applications to image recovery are
presented to compare the behavior of fully proximal versus mixed
proximal/gradient implementations of several splitting algorithms.
| math.OC | structured convex optimization problems typically involve a mix of smooth and nonsmooth functions the common practice is to activate the smooth functions via their gradient and the nonsmooth ones via their proximity operator we show that although intuitively natural this approach is not necessarily the most efficient numerically and that in particular activating all the functions proximally may be advantageous to make this viewpoint viable computationally we derive a number of new examples of proximity operators of smooth convex functions arising in applications a novel variational model to relax inconsistent convex feasibility problems is also investigated within the proposed framework several numerical applications to image recovery are presented to compare the behavior of fully proximal versus mixed proximalgradient implementations of several splitting algorithms | [['structured', 'convex', 'optimization', 'problems', 'typically', 'involve', 'a', 'mix', 'of', 'smooth', 'and', 'nonsmooth', 'functions', 'the', 'common', 'practice', 'is', 'to', 'activate', 'the', 'smooth', 'functions', 'via', 'their', 'gradient', 'and', 'the', 'nonsmooth', 'ones', 'via', 'their', 'proximity', 'operator', 'we', 'show', 'that', 'although', 'intuitively', 'natural', 'this', 'approach', 'is', 'not', 'necessarily', 'the', 'most', 'efficient', 'numerically', 'and', 'that', 'in', 'particular', 'activating', 'all', 'the', 'functions', 'proximally', 'may', 'be', 'advantageous', 'to', 'make', 'this', 'viewpoint', 'viable', 'computationally', 'we', 'derive', 'a', 'number', 'of', 'new', 'examples', 'of', 'proximity', 'operators', 'of', 'smooth', 'convex', 'functions', 'arising', 'in', 'applications', 'a', 'novel', 'variational', 'model', 'to', 'relax', 'inconsistent', 'convex', 'feasibility', 'problems', 'is', 'also', 'investigated', 'within', 'the', 'proposed', 'framework', 'several', 'numerical', 'applications', 'to', 'image', 'recovery', 'are', 'presented', 'to', 'compare', 'the', 'behavior', 'of', 'fully', 'proximal', 'versus', 'mixed', 'proximalgradient', 'implementations', 'of', 'several', 'splitting', 'algorithms']] | [-0.09230281381557386, 0.023540825499751703, -0.06944433583052663, 0.11910374271891618, -0.11813304436817099, -0.16681575545344532, 0.013157987213746562, 0.42703780401649516, -0.3435494955127483, -0.22514156845769262, 0.1266028981076599, -0.22025126165036507, -0.2188621091285372, 0.22490303949036491, -0.11490477340076331, 0.07567629483585223, 0.05569037315587142, -0.04677154907835572, -0.13679411436802125, -0.24577924248107474, 0.3143597668551696, -0.03070551998216689, 0.2543728424044992, 0.07954676106678156, 0.07524138821546382, -0.01748941617268251, 0.024247777534694207, 0.05123907409237349, -0.06092450988530541, 0.17683688134742462, 0.30670121843487447, 0.1794575535904283, 0.345897465386171, -0.4585517418790397, -0.21334990716683186, 0.1458299563652495, 0.13496816997100197, 0.07115473315059169, -0.07985229682597536, -0.22577252672091733, 0.11024131059904045, -0.12320877363095135, -0.09674147308645088, -0.15023408728704704, -0.05129207021412932, 0.045637945756240465, -0.3088848501466578, 0.06739522844370326, 0.024784563524777266, -0.0047692049491575095, -0.06697305711554136, -0.12251819188259845, 0.013006425772157566, 0.05911206412015528, 0.04503287858144206, 0.028798301412716387, 0.12828132066481968, -0.09961355548745733, -0.11772202048072122, 0.35478096688544847, -0.006736715770955008, -0.2750874790022286, 0.24626592038638465, -0.0672712397148333, -0.13091284624202465, 0.12554842067079816, 0.212822186631885, 0.24222368266191183, -0.19609414870146571, 0.0664695511307999, -0.03143473533057888, 0.09316823965343608, 0.015677403376581585, 0.02132490480023368, 0.11532604256909855, 0.12260784441983796, 0.13265045150372434, 0.171009044763935, -0.0030856106952741377, -0.15642414318125059, -0.31527537377021175, -0.10063669465603382, -0.18505537019743457, -0.035849445692440536, -0.07567959359520005, -0.20348187255374028, 0.3949972309581027, 0.13462988905158135, 0.20877408549734733, 0.0826469149243662, 0.3273508091404186, 0.11510310097355245, 0.06613643813075695, 0.06450009206309915, 0.21366773034082498, 0.11885176913725681, 0.050003789191141845, -0.2054200230083027, 0.07540143188846306, 0.062335082091300224] |
1,803.0292 | Study of the $ s-\bar s $ asymmetry in the proton | The study of $ s-\bar s $ asymmetry is essential to better understand of the
structure of nucleon and also the perturbative and nonperturbative mechanisms
for sea quark generation. Actually, the nature and dynamical origins of this
asymmetry have always been an interesting subject to research both
experimentally and theoretically. One of the most powerful models can lead to $
s-\bar s $ asymmetry is the meson-baryon model (MBM). In this work, using a
simplified configuration of this model suggested by Pumplin, we calculate the $
s-\bar s $ asymmetry for different values of cutoff parameter $\Lambda$, to
study the dependence of model to this parameter and also to estimate the
theoretical uncertainty imposed on the results due to its uncertainty. Then, we
study the evolution of distributions obtained both at next-to-leading order
(NLO) and next-to-next-to-leading order (NNLO) using different evolution
schemes. It is shown that the evolution of the intrinsic quark distributions
from a low initial scale, as suggested by Chang and Pang, is not a good choice
at NNLO using variable flavor number scheme (VFNS).
| hep-ph | the study of sbar s asymmetry is essential to better understand of the structure of nucleon and also the perturbative and nonperturbative mechanisms for sea quark generation actually the nature and dynamical origins of this asymmetry have always been an interesting subject to research both experimentally and theoretically one of the most powerful models can lead to sbar s asymmetry is the mesonbaryon model mbm in this work using a simplified configuration of this model suggested by pumplin we calculate the sbar s asymmetry for different values of cutoff parameter lambda to study the dependence of model to this parameter and also to estimate the theoretical uncertainty imposed on the results due to its uncertainty then we study the evolution of distributions obtained both at nexttoleading order nlo and nexttonexttoleading order nnlo using different evolution schemes it is shown that the evolution of the intrinsic quark distributions from a low initial scale as suggested by chang and pang is not a good choice at nnlo using variable flavor number scheme vfns | [['the', 'study', 'of', 'sbar', 's', 'asymmetry', 'is', 'essential', 'to', 'better', 'understand', 'of', 'the', 'structure', 'of', 'nucleon', 'and', 'also', 'the', 'perturbative', 'and', 'nonperturbative', 'mechanisms', 'for', 'sea', 'quark', 'generation', 'actually', 'the', 'nature', 'and', 'dynamical', 'origins', 'of', 'this', 'asymmetry', 'have', 'always', 'been', 'an', 'interesting', 'subject', 'to', 'research', 'both', 'experimentally', 'and', 'theoretically', 'one', 'of', 'the', 'most', 'powerful', 'models', 'can', 'lead', 'to', 'sbar', 's', 'asymmetry', 'is', 'the', 'mesonbaryon', 'model', 'mbm', 'in', 'this', 'work', 'using', 'a', 'simplified', 'configuration', 'of', 'this', 'model', 'suggested', 'by', 'pumplin', 'we', 'calculate', 'the', 'sbar', 's', 'asymmetry', 'for', 'different', 'values', 'of', 'cutoff', 'parameter', 'lambda', 'to', 'study', 'the', 'dependence', 'of', 'model', 'to', 'this', 'parameter', 'and', 'also', 'to', 'estimate', 'the', 'theoretical', 'uncertainty', 'imposed', 'on', 'the', 'results', 'due', 'to', 'its', 'uncertainty', 'then', 'we', 'study', 'the', 'evolution', 'of', 'distributions', 'obtained', 'both', 'at', 'nexttoleading', 'order', 'nlo', 'and', 'nexttonexttoleading', 'order', 'nnlo', 'using', 'different', 'evolution', 'schemes', 'it', 'is', 'shown', 'that', 'the', 'evolution', 'of', 'the', 'intrinsic', 'quark', 'distributions', 'from', 'a', 'low', 'initial', 'scale', 'as', 'suggested', 'by', 'chang', 'and', 'pang', 'is', 'not', 'a', 'good', 'choice', 'at', 'nnlo', 'using', 'variable', 'flavor', 'number', 'scheme', 'vfns']] | [-0.0702637760234147, 0.13347295790371874, -0.13067084833794432, 0.11663561293103716, -0.061937208109050554, -0.07636206289167838, 0.05352093695325243, 0.3453365106092036, -0.2235235711266913, -0.30016831696926677, 0.035023588125358406, -0.2616313802388467, -0.07634157850985737, 0.11997517626814283, 0.01846397505822586, 0.08651694468856035, 0.01149827519115823, -0.015192845201784233, -0.045611426644081694, -0.23481704199847314, 0.33274410740126537, 0.08539027191578732, 0.2448685357731097, 0.12811104990732555, 0.06679906108966696, -0.022916450794944157, -0.050155312198688067, -0.03165863199998238, -0.144503618471608, 0.09364041861736254, 0.20048640285951255, 0.05780437030034325, 0.19118964456005447, -0.35702964758952505, -0.19014393129012935, 0.10606128133136278, 0.14577527755765213, 0.12486721300765087, -0.008594281301555927, -0.25251869810472805, 0.11317425030310861, -0.2300072721537878, -0.15319933371321565, -0.11405662321948518, 0.05097262510398065, -0.024120850645806314, -0.3214059380275927, 0.058872858719690564, 0.0135630068050259, 0.008593164342156017, 0.007717902367057725, -0.15834829921436588, -0.07072641017944797, 0.07280840763375598, 0.1137832480466418, 0.08652830345158558, 0.07883675737893318, -0.15323217467684708, -0.13307990555172208, 0.4037593214375059, -0.058857640325723555, -0.19291674725477154, 0.144982464178547, -0.18139706907878297, -0.1364502695672301, 0.08842874395426864, 0.18547323070689817, 0.10839380127002012, -0.16666198499828894, 0.0956480605737102, -0.018287091943835675, 0.16924844102454725, 0.0514630961901786, 0.05462304840806589, 0.15618305764166496, 0.18719594191476616, -0.005912281704892279, 0.08030336090821054, -0.07172761871806231, -0.11113620860970508, -0.3519601394090126, -0.07843188722536229, -0.12571981358845657, 0.039865730937699004, -0.09581041449283682, -0.09886419433301821, 0.4233574257089921, 0.18186537201968375, 0.255164217841757, -0.019876964471972826, 0.2995350113062308, 0.12028907850311187, 0.04636700462539032, 0.06128637128841807, 0.25176836005602665, 0.16203195205481166, 0.08233492535250315, -0.29163466505188906, 0.10250222271754902, 0.049345517863263515] |
1,803.02921 | Analysis of Decimation on Finite Frames with Sigma-Delta Quantization | In Analog-to-digital (A/D) conversion, signal decimation has been proven to
greatly improve the efficiency of data storage while maintaining high accuracy.
When one couples signal decimation with the $\Sigma\Delta$ quantization scheme,
the reconstruction error decays exponentially with respect to the bit-rate. In
this study, similar results have been proven for finite unitarily generated
frames. We have devised a process called alternative decimation on finite
frames that is compatible with $\Sigma\Delta$ quantization up to the second
order. In both cases, decimation results in exponential error decay with
respect to the bit usage.
| cs.IT math.IT | in analogtodigital ad conversion signal decimation has been proven to greatly improve the efficiency of data storage while maintaining high accuracy when one couples signal decimation with the sigmadelta quantization scheme the reconstruction error decays exponentially with respect to the bitrate in this study similar results have been proven for finite unitarily generated frames we have devised a process called alternative decimation on finite frames that is compatible with sigmadelta quantization up to the second order in both cases decimation results in exponential error decay with respect to the bit usage | [['in', 'analogtodigital', 'ad', 'conversion', 'signal', 'decimation', 'has', 'been', 'proven', 'to', 'greatly', 'improve', 'the', 'efficiency', 'of', 'data', 'storage', 'while', 'maintaining', 'high', 'accuracy', 'when', 'one', 'couples', 'signal', 'decimation', 'with', 'the', 'sigmadelta', 'quantization', 'scheme', 'the', 'reconstruction', 'error', 'decays', 'exponentially', 'with', 'respect', 'to', 'the', 'bitrate', 'in', 'this', 'study', 'similar', 'results', 'have', 'been', 'proven', 'for', 'finite', 'unitarily', 'generated', 'frames', 'we', 'have', 'devised', 'a', 'process', 'called', 'alternative', 'decimation', 'on', 'finite', 'frames', 'that', 'is', 'compatible', 'with', 'sigmadelta', 'quantization', 'up', 'to', 'the', 'second', 'order', 'in', 'both', 'cases', 'decimation', 'results', 'in', 'exponential', 'error', 'decay', 'with', 'respect', 'to', 'the', 'bit', 'usage']] | [-0.11188760587106367, 0.10442232813399571, -0.0798015950271952, 0.017951953473759483, -0.03775826616437881, -0.18987955408334567, 0.03379646301458866, 0.43418804772587105, -0.2660589730725266, -0.2563992456627682, 0.1120757939534487, -0.2554661099809212, -0.08557038430820454, 0.1701657821930904, -0.13767061150213192, 0.1452893723048024, 0.10314009081736043, 0.08552785487947884, -0.10841087893337258, -0.3110371318615072, 0.21747917271024741, 0.15248467952299577, 0.359304710746753, -0.0394478828267573, 0.09777977268063145, -0.027691892598970577, -0.0595782891448055, -0.07124849684281959, -0.10176560587985607, 0.05572037730918645, 0.247665784864144, 0.08641780157583756, 0.2831783246167086, -0.38653725426603147, -0.21641807975042815, 0.11094964301254559, 0.20546231156849598, 0.11909448799349695, -0.09690945334144059, -0.28850128796401914, 0.20159621664660646, -0.1801973355391605, -0.003335578295473869, -0.10274267421810182, -0.026472013832612353, -0.009006831982393063, -0.3116627501344288, 0.030541504344360513, 0.0468167021543115, 0.0067117960540229804, -0.013996516252038897, -0.0796729635324452, 0.056784571046112, 0.08227740924013523, 0.06140468007300284, 0.07268753098989171, 0.05820099483397636, -0.05951615903720996, -0.1383434224996593, 0.3527378940156528, -0.10067878812065369, -0.2643123468752582, 0.13998971605202654, -0.07980042492336296, -0.10203122361921348, 0.19201509482585466, 0.1754233052923375, 0.0431890385967403, -0.10774944967076638, 0.09096401441678569, 0.093273638665758, 0.1879216352743762, 0.11502381190043556, 0.12521138998608178, 0.07237629539200238, 0.16271254524414602, 0.10206854997259043, 0.12512724946769835, -0.09763101049043893, -0.09377807911976681, -0.22646271251142025, -0.15711141517897556, -0.21748461260122584, 0.012371737916779878, -0.1008772358533691, -0.12872257484839514, 0.4088182693417616, 0.15163317963399076, 0.19897783895606522, 0.11211440644667044, 0.3349585490976716, 0.16298088636044616, 0.11796183017297433, 0.10062901104010762, 0.22247159185916554, 0.1482648611897705, 0.07854662153225106, -0.2321568680290711, 0.03263115951443439, 0.0805158680765429] |
1,803.02922 | Fast Convergence for Stochastic and Distributed Gradient Descent in the
Interpolation Limit | Modern supervised learning techniques, particularly those using deep nets,
involve fitting high dimensional labelled data sets with functions containing
very large numbers of parameters. Much of this work is empirical. Interesting
phenomena have been observed that require theoretical explanations; however the
non-convexity of the loss functions complicates the analysis. Recently it has
been proposed that the success of these techniques rests partly in the
effectiveness of the simple stochastic gradient descent algorithm in the so
called interpolation limit in which all labels are fit perfectly. This analysis
is made possible since the SGD algorithm reduces to a stochastic linear system
near the interpolating minimum of the loss function. Here we exploit this
insight by presenting and analyzing a new distributed algorithm for gradient
descent, also in the interpolating limit. The distributed SGD algorithm
presented in the paper corresponds to gradient descent applied to a simple
penalized distributed loss function, $L({\bf w}_1,...,{\bf w}_n) = \Sigma_i
l_i({\bf w}_i) + \mu \sum_{<i,j>}|{\bf w}_i-{\bf w}_j|^2$. Here each node holds
only one sample, and its own parameter vector. The notation $<i,j>$ denotes
edges of a connected graph defining the links between nodes. It is shown that
this distributed algorithm converges linearly (ie the error reduces
exponentially with iteration number), with a rate
$1-\frac{\eta}{n}\lambda_{min}(H)<R<1$ where $\lambda_{min}(H)$ is the smallest
nonzero eigenvalue of the sample covariance or the Hessian H. In contrast with
previous usage of similar penalty functions to enforce consensus between nodes,
in the interpolating limit it is not required to take the penalty parameter to
infinity for consensus to occur. The analysis further reinforces the utility of
the interpolation limit in the theoretical treatment of modern machine learning
algorithms.
| stat.ML cs.LG | modern supervised learning techniques particularly those using deep nets involve fitting high dimensional labelled data sets with functions containing very large numbers of parameters much of this work is empirical interesting phenomena have been observed that require theoretical explanations however the nonconvexity of the loss functions complicates the analysis recently it has been proposed that the success of these techniques rests partly in the effectiveness of the simple stochastic gradient descent algorithm in the so called interpolation limit in which all labels are fit perfectly this analysis is made possible since the sgd algorithm reduces to a stochastic linear system near the interpolating minimum of the loss function here we exploit this insight by presenting and analyzing a new distributed algorithm for gradient descent also in the interpolating limit the distributed sgd algorithm presented in the paper corresponds to gradient descent applied to a simple penalized distributed loss function lbf w_1bf w_n sigma_i l_ibf w_i mu sum_ijbf w_ibf w_j2 here each node holds only one sample and its own parameter vector the notation ij denotes edges of a connected graph defining the links between nodes it is shown that this distributed algorithm converges linearly ie the error reduces exponentially with iteration number with a rate 1fracetanlambda_minhr1 where lambda_minh is the smallest nonzero eigenvalue of the sample covariance or the hessian h in contrast with previous usage of similar penalty functions to enforce consensus between nodes in the interpolating limit it is not required to take the penalty parameter to infinity for consensus to occur the analysis further reinforces the utility of the interpolation limit in the theoretical treatment of modern machine learning algorithms | [['modern', 'supervised', 'learning', 'techniques', 'particularly', 'those', 'using', 'deep', 'nets', 'involve', 'fitting', 'high', 'dimensional', 'labelled', 'data', 'sets', 'with', 'functions', 'containing', 'very', 'large', 'numbers', 'of', 'parameters', 'much', 'of', 'this', 'work', 'is', 'empirical', 'interesting', 'phenomena', 'have', 'been', 'observed', 'that', 'require', 'theoretical', 'explanations', 'however', 'the', 'nonconvexity', 'of', 'the', 'loss', 'functions', 'complicates', 'the', 'analysis', 'recently', 'it', 'has', 'been', 'proposed', 'that', 'the', 'success', 'of', 'these', 'techniques', 'rests', 'partly', 'in', 'the', 'effectiveness', 'of', 'the', 'simple', 'stochastic', 'gradient', 'descent', 'algorithm', 'in', 'the', 'so', 'called', 'interpolation', 'limit', 'in', 'which', 'all', 'labels', 'are', 'fit', 'perfectly', 'this', 'analysis', 'is', 'made', 'possible', 'since', 'the', 'sgd', 'algorithm', 'reduces', 'to', 'a', 'stochastic', 'linear', 'system', 'near', 'the', 'interpolating', 'minimum', 'of', 'the', 'loss', 'function', 'here', 'we', 'exploit', 'this', 'insight', 'by', 'presenting', 'and', 'analyzing', 'a', 'new', 'distributed', 'algorithm', 'for', 'gradient', 'descent', 'also', 'in', 'the', 'interpolating', 'limit', 'the', 'distributed', 'sgd', 'algorithm', 'presented', 'in', 'the', 'paper', 'corresponds', 'to', 'gradient', 'descent', 'applied', 'to', 'a', 'simple', 'penalized', 'distributed', 'loss', 'function', 'lbf', 'w_1bf', 'w_n', 'sigma_i', 'l_ibf', 'w_i', 'mu', 'sum_ijbf', 'w_ibf', 'w_j2', 'here', 'each', 'node', 'holds', 'only', 'one', 'sample', 'and', 'its', 'own', 'parameter', 'vector', 'the', 'notation', 'ij', 'denotes', 'edges', 'of', 'a', 'connected', 'graph', 'defining', 'the', 'links', 'between', 'nodes', 'it', 'is', 'shown', 'that', 'this', 'distributed', 'algorithm', 'converges', 'linearly', 'ie', 'the', 'error', 'reduces', 'exponentially', 'with', 'iteration', 'number', 'with', 'a', 'rate', '1fracetanlambda_minhr1', 'where', 'lambda_minh', 'is', 'the', 'smallest', 'nonzero', 'eigenvalue', 'of', 'the', 'sample', 'covariance', 'or', 'the', 'hessian', 'h', 'in', 'contrast', 'with', 'previous', 'usage', 'of', 'similar', 'penalty', 'functions', 'to', 'enforce', 'consensus', 'between', 'nodes', 'in', 'the', 'interpolating', 'limit', 'it', 'is', 'not', 'required', 'to', 'take', 'the', 'penalty', 'parameter', 'to', 'infinity', 'for', 'consensus', 'to', 'occur', 'the', 'analysis', 'further', 'reinforces', 'the', 'utility', 'of', 'the', 'interpolation', 'limit', 'in', 'the', 'theoretical', 'treatment', 'of', 'modern', 'machine', 'learning', 'algorithms']] | [-0.10256323106682856, 0.04338779283533996, -0.09144219384643804, 0.0655214145303484, -0.09913900169397422, -0.1724233055375656, 0.0745555879439189, 0.3848858705158468, -0.30207451466690705, -0.2988942093320526, 0.08162743972844622, -0.2687754775162033, -0.16188916678920612, 0.1487699968745576, -0.09356949682049244, 0.09690652049647135, 0.08153663873707366, 0.03892059396334997, -0.06751350392016307, -0.281761887876255, 0.27251590931202085, 0.04690395219132482, 0.29352598738758945, -0.013601344511303562, 0.11610076077019077, -0.0009411951022969091, -0.026219461281515297, 0.021906947450230967, -0.08272592542290906, 0.13534976114464004, 0.2579328682228281, 0.16853865930175738, 0.35262595806515007, -0.38839166281082754, -0.17668303949863054, 0.17900473576680886, 0.17162891932347205, 0.07785233136350184, -0.025250600136411883, -0.20732075868223268, 0.08882704309941258, -0.1302204882710377, -0.09195071579330368, -0.07974019619437415, -0.0042842667591705755, 0.05197510102237069, -0.3027252140629353, 0.06359772598673938, 0.06687699839989882, 0.0416816641185921, -0.012327025786185225, -0.15747328066263366, 0.008576971171807484, 0.08507912518275197, 0.07312523018593171, 0.06987310578603619, 0.09763760547666403, -0.10591864810545501, -0.09980252299332217, 0.3251266665425333, -0.03093571243859995, -0.2213210384572912, 0.15713262077061677, -0.08929362716170705, -0.15194168462320354, 0.11578566531261798, 0.1801368399220824, 0.1365512916917454, -0.13707893078711603, 0.12341963458581294, -0.04079847033606487, 0.13357527667747232, 0.04100184803148418, 0.004601885770423136, 0.1274225940606958, 0.18378947389203956, 0.11469527513960774, 0.12617956668884958, -0.0749787803170749, -0.12339699746058096, -0.2904410899969076, -0.11938766700090066, -0.24680970963273782, -0.0021949432426099998, -0.13418071246119512, -0.17868675174370796, 0.36107291271892633, 0.16552569411934212, 0.24519025972147895, 0.1085012289882927, 0.31706386350430127, 0.13509813788057434, 0.09980097625313905, 0.13099331147763843, 0.22707584392922942, 0.13914233734499845, 0.08793810694234286, -0.20800247114790038, 0.09369939529643942, 0.08162834304681375] |
1,803.02923 | Spin and Valley States in Gate-defined Bilayer Graphene Quantum Dots | In bilayer graphene, electrostatic confinement can be realized by a suitable
design of top and back gate electrodes. We measure electronic transport through
a bilayer graphene quantum dot, which is laterally confined by gapped regions
and connected to the leads via p-n junctions. Single electron and hole
occupancy is realized and charge carriers $n = 1, 2,\dots 50$ can be filled
successively into the quantum system with charging energies exceeding $10 \
\mathrm{meV}$. For the lowest quantum states, we can clearly observe valley and
Zeeman splittings with a spin g-factor of $g_{s}\approx 2$. In the low
field-limit, the valley splitting depends linearly on the perpendicular
magnetic field and is in qualitative agreement with calculations.
| cond-mat.mes-hall | in bilayer graphene electrostatic confinement can be realized by a suitable design of top and back gate electrodes we measure electronic transport through a bilayer graphene quantum dot which is laterally confined by gapped regions and connected to the leads via pn junctions single electron and hole occupancy is realized and charge carriers n 1 2dots 50 can be filled successively into the quantum system with charging energies exceeding 10 mathrmmev for the lowest quantum states we can clearly observe valley and zeeman splittings with a spin gfactor of g_sapprox 2 in the low fieldlimit the valley splitting depends linearly on the perpendicular magnetic field and is in qualitative agreement with calculations | [['in', 'bilayer', 'graphene', 'electrostatic', 'confinement', 'can', 'be', 'realized', 'by', 'a', 'suitable', 'design', 'of', 'top', 'and', 'back', 'gate', 'electrodes', 'we', 'measure', 'electronic', 'transport', 'through', 'a', 'bilayer', 'graphene', 'quantum', 'dot', 'which', 'is', 'laterally', 'confined', 'by', 'gapped', 'regions', 'and', 'connected', 'to', 'the', 'leads', 'via', 'pn', 'junctions', 'single', 'electron', 'and', 'hole', 'occupancy', 'is', 'realized', 'and', 'charge', 'carriers', 'n', '1', '2dots', '50', 'can', 'be', 'filled', 'successively', 'into', 'the', 'quantum', 'system', 'with', 'charging', 'energies', 'exceeding', '10', 'mathrmmev', 'for', 'the', 'lowest', 'quantum', 'states', 'we', 'can', 'clearly', 'observe', 'valley', 'and', 'zeeman', 'splittings', 'with', 'a', 'spin', 'gfactor', 'of', 'g_sapprox', '2', 'in', 'the', 'low', 'fieldlimit', 'the', 'valley', 'splitting', 'depends', 'linearly', 'on', 'the', 'perpendicular', 'magnetic', 'field', 'and', 'is', 'in', 'qualitative', 'agreement', 'with', 'calculations']] | [-0.1873889489829339, 0.26653819246981125, 0.008994693496591738, 0.0012263296002119376, 0.04582200912750318, -0.22647134079136425, 0.07239552788742659, 0.4183078522684875, -0.2364530063586662, -0.33310150778390935, -0.046495420215357734, -0.29362849548861786, -0.06954383420724389, 0.2032683586076674, 0.01849854114226292, -0.017189066815148066, 0.024699861359958712, -0.06879778841703392, -0.0692957091304633, -0.18027516515392744, 0.26420326744046835, 0.006092535462943619, 0.29371262347610955, 0.14266115460578385, 0.055567508789937235, 0.003994901414943842, 0.15393861498985742, 0.0414117688296346, -0.1116275964053096, 0.05359743263410941, 0.2353610393868105, -0.15682188683684478, 0.2109956948531305, -0.47815105981856315, -0.12873176159756677, -0.03256997099116881, 0.17272574721357306, 0.1584209577560106, -0.04679242912197469, -0.28349653465320934, 0.08380495709039874, -0.1614834925470253, -0.07764629256987088, -0.05724808888358844, -0.0416579108469205, -0.012489375129744813, -0.23657242441654777, 0.08423996170529642, -0.00575464248955082, 0.0253859162010092, -0.055951778953139845, -0.10218742345396832, -0.10043778260414665, 0.07315988658700844, -0.019285002335285146, 0.08480826918631457, 0.24106324884016905, -0.08643350640242617, -0.14774186799285915, 0.346167154138203, -0.07999322861894495, -0.1738729956769594, 0.13862822983447495, -0.21353951372994898, 0.003085389498386297, 0.15476953298973575, 0.08353853456441078, 0.09369749081665063, -0.10596396414109983, 0.12334674801011486, 0.007481994938004661, 0.18409524689562753, 0.07678408410425323, 0.0711251690407333, 0.2961862968733987, 0.164613032986217, 0.087674347159394, 0.13399289640480536, -0.14574641309603042, -0.06776055841295568, -0.21120875184466173, -0.1902277962166212, -0.2185734416618272, 0.14927291394387548, -0.05188138354574918, -0.14009717707564165, 0.4455352599002622, 0.07350167870806816, 0.1796770276761874, -0.08550208519099632, 0.2626914011633342, 0.16254268536293828, 0.09176571319941096, 0.03873641797559554, 0.22526934218743966, 0.19225443956475738, 0.06264338028661252, -0.2807656715808621, 0.000925421767222049, -0.03077150165598403] |
1,803.02924 | A Newton-CG Algorithm with Complexity Guarantees for Smooth
Unconstrained Optimization | We consider minimization of a smooth nonconvex objective function using an
iterative algorithm based on Newton's method and the linear conjugate gradient
algorithm, with explicit detection and use of negative curvature directions for
the Hessian of the objective function. The algorithm tracks Newton-conjugate
gradient procedures developed in the 1980s closely, but includes enhancements
that allow worst-case complexity results to be proved for convergence to points
that satisfy approximate first-order and second-order optimality conditions.
The complexity results match the best known results in the literature for
second-order methods.
| math.OC | we consider minimization of a smooth nonconvex objective function using an iterative algorithm based on newtons method and the linear conjugate gradient algorithm with explicit detection and use of negative curvature directions for the hessian of the objective function the algorithm tracks newtonconjugate gradient procedures developed in the 1980s closely but includes enhancements that allow worstcase complexity results to be proved for convergence to points that satisfy approximate firstorder and secondorder optimality conditions the complexity results match the best known results in the literature for secondorder methods | [['we', 'consider', 'minimization', 'of', 'a', 'smooth', 'nonconvex', 'objective', 'function', 'using', 'an', 'iterative', 'algorithm', 'based', 'on', 'newtons', 'method', 'and', 'the', 'linear', 'conjugate', 'gradient', 'algorithm', 'with', 'explicit', 'detection', 'and', 'use', 'of', 'negative', 'curvature', 'directions', 'for', 'the', 'hessian', 'of', 'the', 'objective', 'function', 'the', 'algorithm', 'tracks', 'newtonconjugate', 'gradient', 'procedures', 'developed', 'in', 'the', '1980s', 'closely', 'but', 'includes', 'enhancements', 'that', 'allow', 'worstcase', 'complexity', 'results', 'to', 'be', 'proved', 'for', 'convergence', 'to', 'points', 'that', 'satisfy', 'approximate', 'firstorder', 'and', 'secondorder', 'optimality', 'conditions', 'the', 'complexity', 'results', 'match', 'the', 'best', 'known', 'results', 'in', 'the', 'literature', 'for', 'secondorder', 'methods']] | [-0.05301724505058468, -0.0570890488694246, -0.11603571261874221, 0.10563533168914187, -0.11249921500390439, -0.15658926123991435, 0.034016045091976956, 0.4052145239398923, -0.26327135512973504, -0.2944151929601334, 0.10505839547434778, -0.2285519951662092, -0.2230219466091935, 0.2150768709997105, -0.10043578573805821, 0.16919390426212272, 0.0510586642248686, 0.011403915789086632, -0.14095700469117092, -0.325340882206314, 0.2771907082737185, 0.03546786394923232, 0.28219337764109464, 0.04556874708857301, 0.14206194543810344, -0.01797547964595778, 0.002235466950074878, 0.04956295127644702, -0.14992870328400343, 0.0971827449623582, 0.2581437589292046, 0.1971603651574358, 0.30460726430769575, -0.39726052000079043, -0.14845853946767315, 0.11733318322885045, 0.10997237300305346, 0.08951300053402435, -0.07876898204978165, -0.22636903616664714, 0.09397743603615306, -0.05513055274685368, -0.10695804392399136, -0.10600895498511057, -0.0920143103183702, 0.07960520668881187, -0.34164795244849006, 0.08545586910791868, 0.05817404685834379, 0.0207210203719347, -0.0852844484859731, -0.16472223560023933, 0.06966662834680011, 0.05767885573630676, 0.06850197436260926, 0.06461982724126862, 0.08543678135935996, -0.0745177972996824, -0.14557539125861124, 0.32451191229399207, -0.09739749088239055, -0.23776426839609738, 0.14493205582690533, -0.03775255774082833, -0.1446503237929455, 0.1793385438057919, 0.1981850591607305, 0.19053959980780302, -0.11790073241735267, 0.10198421777716059, 0.0183179714002235, 0.13389008976302522, 0.050310387189478376, -0.022483046464405434, 0.06116877650425141, 0.07519277422364022, 0.20439487405467865, 0.14241345499799218, -0.008666391914905331, -0.14779506710379622, -0.30926233261477115, -0.1498961296409022, -0.2102666522056774, -0.07449499049852061, -0.12310943644183152, -0.18761503012433953, 0.36588262125503185, 0.13581700336058125, 0.18696174578102262, 0.1636692387658323, 0.3474848665903474, 0.15224214237140016, 0.02063826172136117, 0.14827132349573943, 0.2444216683290379, 0.15483261023778036, 0.09544050845664082, -0.2558640513033065, 0.10494591586486718, 0.17506527673279823] |
1,803.02925 | Stochastic Games for Fuel Followers Problem: N vs MFG | In this paper we formulate and analyze an $N$-player stochastic game of the
classical fuel follower problem and its Mean Field Game (MFG) counterpart. For
the $N$-player game, we obtain the Nash Equilibrium (NE) explicitly by deriving
and analyzing a system of Hamilton--Jacobi--Bellman (HJB) equations, and by
establishing the existence of a unique strong solution to the associated
Skorokhod problem on an unbounded polyhedron with an oblique reflection. For
the MFG, we derive a bang-bang type NE under some mild technical conditions and
by the viscosity solution approach. We also show that this solution is an
$\epsilon$-NE to the $N$-player game, with $\epsilon =O(\frac{1}{\sqrt{N}})$.
The $N$-player game and the MFG differ in that the NE for the former is state
dependent while the NE for the latter is threshold-type bang-bang policy where
the threshold is state independent. Our analysis shows that the NE for a
stationary MFG may not be the NE for the corresponding MFG.
| math.OC | in this paper we formulate and analyze an nplayer stochastic game of the classical fuel follower problem and its mean field game mfg counterpart for the nplayer game we obtain the nash equilibrium ne explicitly by deriving and analyzing a system of hamiltonjacobibellman hjb equations and by establishing the existence of a unique strong solution to the associated skorokhod problem on an unbounded polyhedron with an oblique reflection for the mfg we derive a bangbang type ne under some mild technical conditions and by the viscosity solution approach we also show that this solution is an epsilonne to the nplayer game with epsilon ofrac1sqrtn the nplayer game and the mfg differ in that the ne for the former is state dependent while the ne for the latter is thresholdtype bangbang policy where the threshold is state independent our analysis shows that the ne for a stationary mfg may not be the ne for the corresponding mfg | [['in', 'this', 'paper', 'we', 'formulate', 'and', 'analyze', 'an', 'nplayer', 'stochastic', 'game', 'of', 'the', 'classical', 'fuel', 'follower', 'problem', 'and', 'its', 'mean', 'field', 'game', 'mfg', 'counterpart', 'for', 'the', 'nplayer', 'game', 'we', 'obtain', 'the', 'nash', 'equilibrium', 'ne', 'explicitly', 'by', 'deriving', 'and', 'analyzing', 'a', 'system', 'of', 'hamiltonjacobibellman', 'hjb', 'equations', 'and', 'by', 'establishing', 'the', 'existence', 'of', 'a', 'unique', 'strong', 'solution', 'to', 'the', 'associated', 'skorokhod', 'problem', 'on', 'an', 'unbounded', 'polyhedron', 'with', 'an', 'oblique', 'reflection', 'for', 'the', 'mfg', 'we', 'derive', 'a', 'bangbang', 'type', 'ne', 'under', 'some', 'mild', 'technical', 'conditions', 'and', 'by', 'the', 'viscosity', 'solution', 'approach', 'we', 'also', 'show', 'that', 'this', 'solution', 'is', 'an', 'epsilonne', 'to', 'the', 'nplayer', 'game', 'with', 'epsilon', 'ofrac1sqrtn', 'the', 'nplayer', 'game', 'and', 'the', 'mfg', 'differ', 'in', 'that', 'the', 'ne', 'for', 'the', 'former', 'is', 'state', 'dependent', 'while', 'the', 'ne', 'for', 'the', 'latter', 'is', 'thresholdtype', 'bangbang', 'policy', 'where', 'the', 'threshold', 'is', 'state', 'independent', 'our', 'analysis', 'shows', 'that', 'the', 'ne', 'for', 'a', 'stationary', 'mfg', 'may', 'not', 'be', 'the', 'ne', 'for', 'the', 'corresponding', 'mfg']] | [-0.11742258279655989, -0.02042973229478006, -0.12833597751047748, 0.06508495983255741, -0.03998054291617173, -0.18770140240219638, 0.08522377885916892, 0.35256883684689033, -0.3331002693441219, -0.23143760587733525, 0.12822790332146, -0.262045801921676, -0.1450610428553027, 0.07971132540842518, -0.11928391477499062, -0.0006511144176609098, 0.055190014849918395, 0.0603138260403051, 0.0144548609551305, -0.2024440484536358, 0.3598961763573476, -0.004579933813940256, 0.2146569134754081, 0.042433478251974195, 0.13524918797581145, -0.00016903644502282335, 0.09040072991420181, 0.09296177135547623, -0.17001926274413284, 0.03103805605534058, 0.2681652099947827, 0.16835751188563547, 0.3543461366222264, -0.39849517732643736, -0.12776563812692004, 0.14223928988958973, 0.11615427067590645, 0.11477400619650069, -0.04818159566060879, -0.3024163922497955, 0.10499886961247867, -0.14587552506978121, -0.18566259815214345, -0.012662225295431338, 0.020331163810810838, 0.04974165969514825, -0.36997979361480343, 0.015173213447269518, 0.061667303005472206, 0.022189115756191313, -0.14690195598702233, -0.1262353049577751, -0.01895226723699568, 0.09975724439517272, 0.03980272678652396, -0.026997998126973517, 0.0934791719326033, -0.16457966507788604, -0.15114595757786914, 0.34724990051024807, -0.10351452221108887, -0.20290619468029875, 0.14580224426493096, -0.0915629038026031, -0.10330528226898959, 0.13621800558832595, 0.1063981087376865, 0.18530497807436264, -0.14773810157874742, 0.10850828815959036, -0.12690227457847542, 0.15115373234192914, 0.017208410209068693, 0.0010734640258865862, 0.08693923628053223, 0.11656367384756987, 0.22670273706078148, 0.1327088060184346, 0.005440629428798834, -0.2171252467430746, -0.33101649792530596, -0.17154766319510648, -0.11150146689033136, 0.09426538267731442, -0.14561459225044998, -0.14557618498563385, 0.32732699340125787, 0.11169880786231563, 0.06512408956097296, 0.12075660424008487, 0.2372494422687361, 0.23974881870806433, -0.1371931625643554, 0.12760479916006517, 0.25783520792286324, 0.12780490582987952, 0.14641811481814307, -0.3095617340907502, 0.11617119633294164, 0.08925665189058353] |
1,803.02926 | The Importance of Multiple Observation Methods to Characterize
Potentially Habitable Exoplanets: Ground- and Space-Based Synergies | The discovery of a truly habitable exoplanet would be one of the most
important events in the history of science. However, the nature and
distribution of habitable environments on exoplanets is currently
unconstrained. The exoplanet revolution teaches us to expect surprises. Thus,
versatile, capable observatories, and multiple observation techniques are
needed to study the full diversity of habitable environments. Here, we
summarize the challenges and opportunities of observing planets orbiting M
dwarf vs. FGK dwarfs, which are best targeted with different methods.
| astro-ph.EP | the discovery of a truly habitable exoplanet would be one of the most important events in the history of science however the nature and distribution of habitable environments on exoplanets is currently unconstrained the exoplanet revolution teaches us to expect surprises thus versatile capable observatories and multiple observation techniques are needed to study the full diversity of habitable environments here we summarize the challenges and opportunities of observing planets orbiting m dwarf vs fgk dwarfs which are best targeted with different methods | [['the', 'discovery', 'of', 'a', 'truly', 'habitable', 'exoplanet', 'would', 'be', 'one', 'of', 'the', 'most', 'important', 'events', 'in', 'the', 'history', 'of', 'science', 'however', 'the', 'nature', 'and', 'distribution', 'of', 'habitable', 'environments', 'on', 'exoplanets', 'is', 'currently', 'unconstrained', 'the', 'exoplanet', 'revolution', 'teaches', 'us', 'to', 'expect', 'surprises', 'thus', 'versatile', 'capable', 'observatories', 'and', 'multiple', 'observation', 'techniques', 'are', 'needed', 'to', 'study', 'the', 'full', 'diversity', 'of', 'habitable', 'environments', 'here', 'we', 'summarize', 'the', 'challenges', 'and', 'opportunities', 'of', 'observing', 'planets', 'orbiting', 'm', 'dwarf', 'vs', 'fgk', 'dwarfs', 'which', 'are', 'best', 'targeted', 'with', 'different', 'methods']] | [-0.10551080502933119, 0.1271757189775022, -0.07803108259217768, 0.0965227240415449, -0.2008530322530466, -0.06280591722191652, 0.1136158258631462, 0.32218789034409495, -0.1436738300480789, -0.4015445020504114, 0.1188859986240703, -0.30123919750586514, -0.16263568173049064, 0.2546573712734687, -0.11318412639495985, 0.05935686099394111, 0.16808091410685602, -0.061165814685476265, -0.011193840366947214, -0.3327324154854911, 0.2697101505856575, 0.07896318426923599, 0.09446294350754016, -0.052687479157523226, 0.020109084660361987, -0.0444052952239517, -0.07919123906233325, -0.10125133586002559, -0.18052048953931507, 0.09881286307737776, 0.36556623939697336, 0.21941063518312237, 0.2805163061768725, -0.37798646108883366, -0.24007093462746637, 0.07562464264664435, 0.14707793201297337, 0.016395308092952046, -0.04695707229789483, -0.2959274531728247, 0.06759017609377824, -0.14980362760891183, -0.18079762817246886, -0.01451309158171459, 0.07038190209011479, -0.00025537052822140297, -0.22656948800857474, 0.00033871110006258257, 0.04086275615661246, 0.09997650444019222, -0.11834511211107872, -0.15417511258047165, 0.029259192439295898, 0.1803357916225384, -0.004954074462591784, -0.0048848430075251114, 0.16506688436493278, -0.1450489465056396, -0.07981482322793454, 0.4678509067516865, -0.07592301466502249, -0.016188182365489988, 0.3281931560145827, -0.24453970177735135, -0.14378451669543255, 0.0865748421311742, 0.19640046888508084, 0.20105174471192608, -0.2086399394306127, 0.032821662954719194, 0.026537505080696286, 0.12679863920458023, 0.029723295215062978, 0.09975432904391754, 0.4410692319591961, 0.20703621576085868, 0.1272572912616519, 0.004563339592650442, -0.17232945873458846, -0.07283781947306835, -0.15949462986304197, -0.191204529588548, -0.15686078451392127, 0.015179602247549266, -0.034087865023693445, -0.11837466566528125, 0.4020946362033123, 0.23843354379996748, 0.10109035700287033, -0.022324750936737785, 0.3297991658242919, -0.008594221441166066, 0.09981417446965124, 0.06235715419213038, 0.28338639023316253, 0.09845907702934133, 0.08822758907520371, -0.19507737436598713, 0.14101847751838406, -0.07956235066465125] |
1,803.02927 | A High-Precision Trigonometric Parallax to an Ancient Metal-Poor
Globular Cluster | Using the Wide Field Camera 3 (WFC3) on the Hubble Space Telescope (HST), we
have obtained a direct trigonometric parallax for the nearest metal-poor
globular cluster, NGC 6397. Although trigonometric parallaxes have been
previously measured for many nearby open clusters, this is the first parallax
for an ancient metal-poor population -- one that is used as a fundamental
template in many stellar population studies. This high-precision measurement
was enabled by the HST/WFC3 spatial-scanning mode, providing hundreds of
astrometric measurements for dozens of stars in the cluster and also for
Galactic field stars along the same sightline. We find a parallax of 0.418 +/-
0.013 +/- 0.018 mas (statistical, systematic), corresponding to a true distance
modulus of 11.89 +/- 0.07 +/- 0.09 mag (2.39 +/- 0.07 +/- 0.10 kpc). The V
luminosity at the stellar main sequence turnoff implies an absolute cluster age
of 13.4 +/- 0.7 +/- 1.2 Gyr.
| astro-ph.SR astro-ph.GA astro-ph.IM | using the wide field camera 3 wfc3 on the hubble space telescope hst we have obtained a direct trigonometric parallax for the nearest metalpoor globular cluster ngc 6397 although trigonometric parallaxes have been previously measured for many nearby open clusters this is the first parallax for an ancient metalpoor population one that is used as a fundamental template in many stellar population studies this highprecision measurement was enabled by the hstwfc3 spatialscanning mode providing hundreds of astrometric measurements for dozens of stars in the cluster and also for galactic field stars along the same sightline we find a parallax of 0418 0013 0018 mas statistical systematic corresponding to a true distance modulus of 1189 007 009 mag 239 007 010 kpc the v luminosity at the stellar main sequence turnoff implies an absolute cluster age of 134 07 12 gyr | [['using', 'the', 'wide', 'field', 'camera', '3', 'wfc3', 'on', 'the', 'hubble', 'space', 'telescope', 'hst', 'we', 'have', 'obtained', 'a', 'direct', 'trigonometric', 'parallax', 'for', 'the', 'nearest', 'metalpoor', 'globular', 'cluster', 'ngc', '6397', 'although', 'trigonometric', 'parallaxes', 'have', 'been', 'previously', 'measured', 'for', 'many', 'nearby', 'open', 'clusters', 'this', 'is', 'the', 'first', 'parallax', 'for', 'an', 'ancient', 'metalpoor', 'population', 'one', 'that', 'is', 'used', 'as', 'a', 'fundamental', 'template', 'in', 'many', 'stellar', 'population', 'studies', 'this', 'highprecision', 'measurement', 'was', 'enabled', 'by', 'the', 'hstwfc3', 'spatialscanning', 'mode', 'providing', 'hundreds', 'of', 'astrometric', 'measurements', 'for', 'dozens', 'of', 'stars', 'in', 'the', 'cluster', 'and', 'also', 'for', 'galactic', 'field', 'stars', 'along', 'the', 'same', 'sightline', 'we', 'find', 'a', 'parallax', 'of', '0418', '0013', '0018', 'mas', 'statistical', 'systematic', 'corresponding', 'to', 'a', 'true', 'distance', 'modulus', 'of', '1189', '007', '009', 'mag', '239', '007', '010', 'kpc', 'the', 'v', 'luminosity', 'at', 'the', 'stellar', 'main', 'sequence', 'turnoff', 'implies', 'an', 'absolute', 'cluster', 'age', 'of', '134', '07', '12', 'gyr']] | [-0.05669319567357679, 0.07203182618057509, -0.10362779905537156, 0.06029889321879303, -0.1346072736447476, -0.054396984478117055, 0.10178349794327489, 0.44689237216500927, -0.1720591049319763, -0.3959446648041979, 0.03615629696789727, -0.3045073750381954, 0.05789386590259324, 0.26562637029711506, -0.09930352243534524, -0.008310737829528106, 0.15601004389579082, -0.048978752875365586, -0.0460255758404705, -0.2856487747509595, 0.2015217576953147, 0.0019098658838289247, 0.10117796252367736, -0.11111383200388589, 0.08486211214427293, -0.09180351216078018, -0.07076382538531538, -0.053146810810418346, -0.21568362593506135, 0.039358695599220346, 0.2304109079786744, 0.10530389568152027, 0.2582603499775739, -0.22518248092249143, -0.15205630616506013, 0.060989138914821606, 0.2520655856916694, 0.02514417215230332, -0.06491082546505542, -0.3279455425058619, 0.07409799512368527, -0.16825432057924594, -0.21997532607290707, 0.12705756890296052, 0.1046845749868147, -0.00011712843686235037, -0.2016854369543868, 0.20201082224099187, -0.08061822846853475, 0.20735761775675385, -0.1742183076793147, -0.22119394000351644, -0.002915150513570997, 0.11314294258092376, -0.06179528805031944, 0.2002684402291281, 0.11488940512506868, -0.044432624068995605, -0.01636595252345202, 0.40610019936353614, -0.08746262457851561, 0.028329405660586927, 0.15645688124295834, -0.2053337628256342, -0.23349575768643654, 0.08395119235355059, 0.12251019248698684, 0.11131936789108374, -0.2663662107761869, 0.026646982506168804, 0.00794914124613936, 0.27994049559833095, 0.06572026692803198, 0.06226230941699456, 0.30310822327842385, 0.10732374196326051, 0.07154458627798226, -0.009370127372048367, -0.3341719315122652, -0.004927460211429664, -0.190197261442303, -0.1077887490626237, -0.11097943246186202, 0.11076627182439237, -0.23981251428793637, -0.11838192602606129, 0.2962770181098323, 0.10079114670235423, 0.18179189891005001, 0.0644282598396857, 0.2791448218493367, 0.03130475011412992, 0.14593597095884323, 0.07384427094651158, 0.36271093580067804, 0.24344838636578897, 0.0537302183262039, -0.21448746012362965, 0.047998080589547215, 0.001909648837092862] |
1,803.02928 | Towards Noise Simulation in Interacting Nonequilibrium Systems Strongly
Coupled to Baths | Progress in experimental techniques at nanoscale made measurements of noise
in molecular junctions possible. These data are important source of information
not accessible through average flux measurements. Emergence of optoelectronics,
recently shown possibility of strong light-matter couplings, and developments
in the field of quantum thermodynamics are making counting statistics
measurements of even higher importance. Theoretical methods for noise
evaluation in first principles simulations can be roughly divided into
approaches applicable in the case of weak intra-system interactions, and those
treating strong interactions for systems weakly coupled to baths. We argue that
due to structure of its diagrammatic expansion and the fact of utilizing
many-body states as a basis of its formulation recently introduced
nonequilibrium Hubbard Green functions formulation is a relatively inexpensive
method suitable for evaluation of noise characteristics in first principles
simulations over wide range of parameters. We illustrate viability of the
approach by simulations of noise and noise spectrum within generic models for
non-, weakly and strongly interacting systems. Results of the simulations are
compared to exact data (where available) and to simulations performed within
approaches best suited for each of the three parameter regimes.
| cond-mat.mes-hall | progress in experimental techniques at nanoscale made measurements of noise in molecular junctions possible these data are important source of information not accessible through average flux measurements emergence of optoelectronics recently shown possibility of strong lightmatter couplings and developments in the field of quantum thermodynamics are making counting statistics measurements of even higher importance theoretical methods for noise evaluation in first principles simulations can be roughly divided into approaches applicable in the case of weak intrasystem interactions and those treating strong interactions for systems weakly coupled to baths we argue that due to structure of its diagrammatic expansion and the fact of utilizing manybody states as a basis of its formulation recently introduced nonequilibrium hubbard green functions formulation is a relatively inexpensive method suitable for evaluation of noise characteristics in first principles simulations over wide range of parameters we illustrate viability of the approach by simulations of noise and noise spectrum within generic models for non weakly and strongly interacting systems results of the simulations are compared to exact data where available and to simulations performed within approaches best suited for each of the three parameter regimes | [['progress', 'in', 'experimental', 'techniques', 'at', 'nanoscale', 'made', 'measurements', 'of', 'noise', 'in', 'molecular', 'junctions', 'possible', 'these', 'data', 'are', 'important', 'source', 'of', 'information', 'not', 'accessible', 'through', 'average', 'flux', 'measurements', 'emergence', 'of', 'optoelectronics', 'recently', 'shown', 'possibility', 'of', 'strong', 'lightmatter', 'couplings', 'and', 'developments', 'in', 'the', 'field', 'of', 'quantum', 'thermodynamics', 'are', 'making', 'counting', 'statistics', 'measurements', 'of', 'even', 'higher', 'importance', 'theoretical', 'methods', 'for', 'noise', 'evaluation', 'in', 'first', 'principles', 'simulations', 'can', 'be', 'roughly', 'divided', 'into', 'approaches', 'applicable', 'in', 'the', 'case', 'of', 'weak', 'intrasystem', 'interactions', 'and', 'those', 'treating', 'strong', 'interactions', 'for', 'systems', 'weakly', 'coupled', 'to', 'baths', 'we', 'argue', 'that', 'due', 'to', 'structure', 'of', 'its', 'diagrammatic', 'expansion', 'and', 'the', 'fact', 'of', 'utilizing', 'manybody', 'states', 'as', 'a', 'basis', 'of', 'its', 'formulation', 'recently', 'introduced', 'nonequilibrium', 'hubbard', 'green', 'functions', 'formulation', 'is', 'a', 'relatively', 'inexpensive', 'method', 'suitable', 'for', 'evaluation', 'of', 'noise', 'characteristics', 'in', 'first', 'principles', 'simulations', 'over', 'wide', 'range', 'of', 'parameters', 'we', 'illustrate', 'viability', 'of', 'the', 'approach', 'by', 'simulations', 'of', 'noise', 'and', 'noise', 'spectrum', 'within', 'generic', 'models', 'for', 'non', 'weakly', 'and', 'strongly', 'interacting', 'systems', 'results', 'of', 'the', 'simulations', 'are', 'compared', 'to', 'exact', 'data', 'where', 'available', 'and', 'to', 'simulations', 'performed', 'within', 'approaches', 'best', 'suited', 'for', 'each', 'of', 'the', 'three', 'parameter', 'regimes']] | [-0.12944815601882112, 0.10676784298561992, -0.07126205712544388, 0.060969992053326476, -0.016232562611218204, -0.147493718231824, 0.041965380088142296, 0.38140252409353453, -0.22743662481599633, -0.3064117740321765, 0.06712935813752446, -0.2739145797154403, -0.1445562669603941, 0.25388593000564025, 0.021736014447608254, 0.08242162355572921, 0.08802221689054514, -0.03967270485429283, -0.06365771507526832, -0.22436135154551165, 0.2856285038869828, 0.0758736410102294, 0.29894350772165756, 0.07138297650564641, 0.08219158432800024, -0.003058828662503212, -0.03228380471931143, 0.059103082873569655, -0.12343950735618775, 0.1152289792292074, 0.26632206903031375, 0.06774088995092932, 0.271596647426735, -0.4510038975267646, -0.24093552608600752, 0.04235816224797082, 0.1433053476683656, 0.1301092209199812, -0.04247038905698069, -0.2787630742647371, 0.04863567151537633, -0.16915307843430158, -0.11390014024100262, -0.1435975161129559, -0.0054293206256669875, 0.04276027120301191, -0.2739573115707664, 0.09907182860424751, 0.01951231775160401, 0.049049388679531326, -0.04989613033084069, -0.10198654023243144, 0.02281261201733773, 0.12364071679866828, 0.005442044671555174, -0.02390968880770519, 0.13667507907425497, -0.17541920208187903, -0.13200910958177584, 0.38560384210139353, -0.07846533119887672, -0.18422860508027641, 0.23501701474707712, -0.13580904051382592, -0.15672301850406165, 0.13048951852229987, 0.14498924286531803, 0.1273078427925198, -0.19091661523979028, 0.08744911407805323, 0.04545300913586177, 0.15121059712236698, -0.017049754322332175, 0.08588142808835535, 0.20958852389252142, 0.18790557108729838, 0.011458177194198504, 0.11555882121055303, -0.05748500469524194, -0.14287743310320794, -0.2775590949527481, -0.09463670585282087, -0.20958605524710314, 0.02125235080831363, -0.055276176973929586, -0.131709777367056, 0.3674866008238598, 0.21431461144188907, 0.14237396264657937, 0.017744466618828992, 0.3161671053740211, 0.09382420698340166, 0.054431738773918645, 0.013215979675757375, 0.24661141112857662, 0.18579550806985778, 0.0655980320008631, -0.19812567741049822, 0.03150779531551475, 0.009198783209577283] |
1,803.02929 | On generalized and fractional derivatives and their applications to
classical mechanics | (Draft 3) A generalized differential operator on the real line is defined by
means of a limiting process. These generalized derivatives include, as a
special case, the classical derivative and current studies of fractional
differential operators. All such operators satisfy properties such as the sum,
product/quotient rules, chain rule, etc. We study a Sturm-Liouville eigenvalue
problem with generalized derivatives and show that the general case is actually
a consequence of standard Sturm-Liouville Theory. As an application of the
developments herein we find the general solution of a generalized harmonic
oscillator. We also consider the classical problem of a planar motion under a
central force and show that the general solution of this problem is still
generically an ellipse, and that this result is true independently of the
choice of the generalized derivatives being used modulo a time shift. The
previous result on the generic nature of phase plane orbits is extended to the
classical gravitational n-body problem of Newton to show that the global nature
of these orbits is independent of the choice of the generalized derivatives
being used in defining the force law (modulo a time shift). Finally,
restricting the generalized derivatives to a special class of fractional
derivatives, we consider the question of motion under gravity with and without
resistance and arrive at a new notion of time that depends on the fractional
parameter. The results herein are meant to clarify and extend many known
results in the literature and intended to show the limitations and use of
generalized derivatives and corresponding fractional derivatives.
| math-ph math.MP | draft 3 a generalized differential operator on the real line is defined by means of a limiting process these generalized derivatives include as a special case the classical derivative and current studies of fractional differential operators all such operators satisfy properties such as the sum productquotient rules chain rule etc we study a sturmliouville eigenvalue problem with generalized derivatives and show that the general case is actually a consequence of standard sturmliouville theory as an application of the developments herein we find the general solution of a generalized harmonic oscillator we also consider the classical problem of a planar motion under a central force and show that the general solution of this problem is still generically an ellipse and that this result is true independently of the choice of the generalized derivatives being used modulo a time shift the previous result on the generic nature of phase plane orbits is extended to the classical gravitational nbody problem of newton to show that the global nature of these orbits is independent of the choice of the generalized derivatives being used in defining the force law modulo a time shift finally restricting the generalized derivatives to a special class of fractional derivatives we consider the question of motion under gravity with and without resistance and arrive at a new notion of time that depends on the fractional parameter the results herein are meant to clarify and extend many known results in the literature and intended to show the limitations and use of generalized derivatives and corresponding fractional derivatives | [['draft', '3', 'a', 'generalized', 'differential', 'operator', 'on', 'the', 'real', 'line', 'is', 'defined', 'by', 'means', 'of', 'a', 'limiting', 'process', 'these', 'generalized', 'derivatives', 'include', 'as', 'a', 'special', 'case', 'the', 'classical', 'derivative', 'and', 'current', 'studies', 'of', 'fractional', 'differential', 'operators', 'all', 'such', 'operators', 'satisfy', 'properties', 'such', 'as', 'the', 'sum', 'productquotient', 'rules', 'chain', 'rule', 'etc', 'we', 'study', 'a', 'sturmliouville', 'eigenvalue', 'problem', 'with', 'generalized', 'derivatives', 'and', 'show', 'that', 'the', 'general', 'case', 'is', 'actually', 'a', 'consequence', 'of', 'standard', 'sturmliouville', 'theory', 'as', 'an', 'application', 'of', 'the', 'developments', 'herein', 'we', 'find', 'the', 'general', 'solution', 'of', 'a', 'generalized', 'harmonic', 'oscillator', 'we', 'also', 'consider', 'the', 'classical', 'problem', 'of', 'a', 'planar', 'motion', 'under', 'a', 'central', 'force', 'and', 'show', 'that', 'the', 'general', 'solution', 'of', 'this', 'problem', 'is', 'still', 'generically', 'an', 'ellipse', 'and', 'that', 'this', 'result', 'is', 'true', 'independently', 'of', 'the', 'choice', 'of', 'the', 'generalized', 'derivatives', 'being', 'used', 'modulo', 'a', 'time', 'shift', 'the', 'previous', 'result', 'on', 'the', 'generic', 'nature', 'of', 'phase', 'plane', 'orbits', 'is', 'extended', 'to', 'the', 'classical', 'gravitational', 'nbody', 'problem', 'of', 'newton', 'to', 'show', 'that', 'the', 'global', 'nature', 'of', 'these', 'orbits', 'is', 'independent', 'of', 'the', 'choice', 'of', 'the', 'generalized', 'derivatives', 'being', 'used', 'in', 'defining', 'the', 'force', 'law', 'modulo', 'a', 'time', 'shift', 'finally', 'restricting', 'the', 'generalized', 'derivatives', 'to', 'a', 'special', 'class', 'of', 'fractional', 'derivatives', 'we', 'consider', 'the', 'question', 'of', 'motion', 'under', 'gravity', 'with', 'and', 'without', 'resistance', 'and', 'arrive', 'at', 'a', 'new', 'notion', 'of', 'time', 'that', 'depends', 'on', 'the', 'fractional', 'parameter', 'the', 'results', 'herein', 'are', 'meant', 'to', 'clarify', 'and', 'extend', 'many', 'known', 'results', 'in', 'the', 'literature', 'and', 'intended', 'to', 'show', 'the', 'limitations', 'and', 'use', 'of', 'generalized', 'derivatives', 'and', 'corresponding', 'fractional', 'derivatives']] | [-0.12268400813411517, 0.05437279089403546, -0.06209101887759516, 0.06551244496430542, -0.1213728344791889, -0.08423722813677159, 0.024790602553821373, 0.30703143924984033, -0.3027661402520607, -0.2536895131925121, 0.14011578858435314, -0.2494628910699248, -0.19190222371435084, 0.19798614286264637, -0.08135211033095402, 0.0631550352609338, 0.026152944948989898, 0.07394718361047126, -0.08327838776403951, -0.2338970861337657, 0.3621173569495113, 0.0033494652270746883, 0.2178595454497554, 0.04574422008909096, 0.12389966910996009, 0.023067634921972058, -0.03596916495780533, 0.028235418316398864, -0.14778923136194067, 0.10266826416659569, 0.1984307539605652, 0.06426428396591177, 0.2755815606251417, -0.3979456172637583, -0.19916531401031534, 0.12587277155625998, 0.08693815618153167, 0.08745567921869224, -0.014927711690233991, -0.2615868142875115, 0.058820108060899656, -0.15713231872541655, -0.19985832749625843, -0.06291103578951152, 0.024393172617237724, 0.05994327607550076, -0.2670277945539965, 0.0854468582518848, 0.0976163637751597, 0.02041940994968172, -0.07601037659424037, -0.1109982712018791, 0.012521173750428716, 0.06847460180142662, 0.04604108225964865, 0.006034529985299741, 0.08228827960374474, -0.09256676127733954, -0.1397665389613394, 0.4119540434330702, -0.07736047039156801, -0.2644779372931225, 0.13038059540667746, -0.1453783538299831, -0.15117187630448825, 0.061259272617370186, 0.12415781599884212, 0.17403820548011595, -0.1342854879803781, 0.11758414324185651, -0.04506007354530084, 0.12536897537302139, 0.0922450215207391, 0.015259635569009333, 0.1588423894763764, 0.08948275266993733, 0.1040821632193456, 0.1485934202291901, -0.025086719534783697, -0.13742240849933296, -0.3484495155935292, -0.18580281240383556, -0.16727702270145528, 0.053969854855495214, -0.0844188728304971, -0.1792148403765168, 0.39126093675440643, 0.12693929872751042, 0.16774575334613928, 0.08261916113224288, 0.2589726120186242, 0.20714539594905546, 0.04220527023426257, 0.020519080138910795, 0.21194265917347366, 0.13932951476726885, 0.08083531840475189, -0.19378222066552553, 0.02224511889835412, 0.10646197466667218] |
1,803.0293 | Non-radiative decay and stability of $N$-heterocyclic carbene
iridium(III) complexes | Devices based on deep-blue emitting iridium (III) complexes with
N-heterocyclic carbene (NHC) ligands have recently been shown to give excellent
performance as phosphorescent organic light-emitting diodes (PHOLEDs). To
facilitate the design of even better deep-blue phosphorescent emitters we
carried out density functional theory (DFT) calculations of the lowest triplet
($T_1$) potential-energy surfaces (PES) upon lengthening the iridium-ligand
(Ir-C) bonds. Relativistic time dependent-DFT (TDDFT) calculations demonstrate
that this changes the nature of $T_1$ from a highly-emissive metal-to-ligand
charge transfer ($^3$MLCT) state to a metal centered ($^3$MC) state where the
radiative decay rate is orders of magnitude slower than that of the $^3$MLCT
state. We identify the elongation of an Ir-C bond on the NHC group as the
pathway with lowest energy barrier between the $^3$MLCT and $^3$MC states for
all complexes studied and show that the barrier height is correlated with the
experimentally measured non-radiative decay rate. This suggests that the
thermal population of $^3$MC states is the dominant non-radiative decay
mechanism at room temperature. We show that the $^3$MLCT $\rightarrow$ $^3$MC
transition is reversible, in marked contrast to other deep blue phosphors
containing coordinating nitrogen atoms, where the population of $^3$MC states
breaks Ir-N bonds. This suggests that, as well as improved efficiency, blue
PHOLEDs containing phosphors where the metal is only coordinated by carbon
atoms will have improved device lifetimes.
| physics.chem-ph cond-mat.mtrl-sci | devices based on deepblue emitting iridium iii complexes with nheterocyclic carbene nhc ligands have recently been shown to give excellent performance as phosphorescent organic lightemitting diodes pholeds to facilitate the design of even better deepblue phosphorescent emitters we carried out density functional theory dft calculations of the lowest triplet t_1 potentialenergy surfaces pes upon lengthening the iridiumligand irc bonds relativistic time dependentdft tddft calculations demonstrate that this changes the nature of t_1 from a highlyemissive metaltoligand charge transfer 3mlct state to a metal centered 3mc state where the radiative decay rate is orders of magnitude slower than that of the 3mlct state we identify the elongation of an irc bond on the nhc group as the pathway with lowest energy barrier between the 3mlct and 3mc states for all complexes studied and show that the barrier height is correlated with the experimentally measured nonradiative decay rate this suggests that the thermal population of 3mc states is the dominant nonradiative decay mechanism at room temperature we show that the 3mlct rightarrow 3mc transition is reversible in marked contrast to other deep blue phosphors containing coordinating nitrogen atoms where the population of 3mc states breaks irn bonds this suggests that as well as improved efficiency blue pholeds containing phosphors where the metal is only coordinated by carbon atoms will have improved device lifetimes | [['devices', 'based', 'on', 'deepblue', 'emitting', 'iridium', 'iii', 'complexes', 'with', 'nheterocyclic', 'carbene', 'nhc', 'ligands', 'have', 'recently', 'been', 'shown', 'to', 'give', 'excellent', 'performance', 'as', 'phosphorescent', 'organic', 'lightemitting', 'diodes', 'pholeds', 'to', 'facilitate', 'the', 'design', 'of', 'even', 'better', 'deepblue', 'phosphorescent', 'emitters', 'we', 'carried', 'out', 'density', 'functional', 'theory', 'dft', 'calculations', 'of', 'the', 'lowest', 'triplet', 't_1', 'potentialenergy', 'surfaces', 'pes', 'upon', 'lengthening', 'the', 'iridiumligand', 'irc', 'bonds', 'relativistic', 'time', 'dependentdft', 'tddft', 'calculations', 'demonstrate', 'that', 'this', 'changes', 'the', 'nature', 'of', 't_1', 'from', 'a', 'highlyemissive', 'metaltoligand', 'charge', 'transfer', '3mlct', 'state', 'to', 'a', 'metal', 'centered', '3mc', 'state', 'where', 'the', 'radiative', 'decay', 'rate', 'is', 'orders', 'of', 'magnitude', 'slower', 'than', 'that', 'of', 'the', '3mlct', 'state', 'we', 'identify', 'the', 'elongation', 'of', 'an', 'irc', 'bond', 'on', 'the', 'nhc', 'group', 'as', 'the', 'pathway', 'with', 'lowest', 'energy', 'barrier', 'between', 'the', '3mlct', 'and', '3mc', 'states', 'for', 'all', 'complexes', 'studied', 'and', 'show', 'that', 'the', 'barrier', 'height', 'is', 'correlated', 'with', 'the', 'experimentally', 'measured', 'nonradiative', 'decay', 'rate', 'this', 'suggests', 'that', 'the', 'thermal', 'population', 'of', '3mc', 'states', 'is', 'the', 'dominant', 'nonradiative', 'decay', 'mechanism', 'at', 'room', 'temperature', 'we', 'show', 'that', 'the', '3mlct', 'rightarrow', '3mc', 'transition', 'is', 'reversible', 'in', 'marked', 'contrast', 'to', 'other', 'deep', 'blue', 'phosphors', 'containing', 'coordinating', 'nitrogen', 'atoms', 'where', 'the', 'population', 'of', '3mc', 'states', 'breaks', 'irn', 'bonds', 'this', 'suggests', 'that', 'as', 'well', 'as', 'improved', 'efficiency', 'blue', 'pholeds', 'containing', 'phosphors', 'where', 'the', 'metal', 'is', 'only', 'coordinated', 'by', 'carbon', 'atoms', 'will', 'have', 'improved', 'device', 'lifetimes']] | [-0.0859057052902817, 0.1741766390457121, -0.022123958842173493, 0.03234984370808686, 0.04311601859559165, -0.1684887253989776, 0.10503554835007957, 0.4405411277914903, -0.21144294985397546, -0.2606700698638128, -0.01289651539398754, -0.32396301816307066, -0.07812159979948774, 0.14436930514380542, 0.033455867695415184, -0.03519009688116731, 0.02870712797071233, -0.02538596632614456, -0.029489494662912976, -0.1806548016913304, 0.23186048871354648, 0.08035598668855662, 0.2920568534388655, 0.09299762440409891, 0.03698826211189886, -0.03759889984912998, 0.10555872509764784, -0.06584453173154206, -0.13598612773428073, 0.0895737607950785, 0.24096372429522928, -0.01328747151786013, 0.21514046318501373, -0.4484449913294089, -0.2121262785556071, 0.06738266714576942, 0.15150213579181582, 0.10773245351069986, -0.07161196178424654, -0.2584200830056539, 0.0470040427053054, -0.1534258199131323, -0.10248399546462342, -0.03988102864025644, 0.033759297089461515, 0.02748738100301664, -0.23288354002148412, 0.09215233837285605, 0.007074318276998518, 0.03479220853255861, -0.06453282911853522, -0.17914339996275008, -0.13197584900276357, 0.07113573576659998, 0.019300317465590692, 0.028927260096208083, 0.2106084952031745, -0.08525434972155684, -0.10449866690517713, 0.3370224897683969, -0.09745680122924333, -0.0481781201928647, 0.1832261107359685, -0.14402602004217138, -0.10111364217138746, 0.204260793859484, 0.07838857552161682, 0.1555832231436701, -0.1246450782809579, 0.0594292990383649, 0.018208721085102297, 0.2058633198687824, 0.062739994441573, 0.10325083288976371, 0.1749825946117872, 0.19278440616876147, 0.034709041034889025, 0.12428819206872033, -0.1265511168166995, -0.10711745824449247, -0.1959910561644291, -0.203641803897443, -0.1703667002951045, 0.10062128641314942, -0.032589867665659834, -0.15419088649017526, 0.3434142690363202, 0.0803699000820483, 0.16477603125558407, -0.0011578490149178025, 0.24458269779009884, 0.08367649352509977, 0.09897299348409029, 0.030299277154511032, 0.24469390927697532, 0.14739917614443349, 0.055347855183451124, -0.3009820027671392, 0.10092616872538605, -0.00012631207290622924] |
1,803.02931 | Issued for Abuse: Measuring the Underground Trade in Code Signing
Certificate | Recent measurements of the Windows code-signing certificate ecosystem have
highlighted various forms of abuse that allow malware authors to produce
malicious code carrying valid digital signatures. However, the underground
trade that allows miscreants to acquire such certificates is not well
understood. In this paper, we illuminate two aspects of this trade. First, we
investigate 4 leading vendors of Authenticode certificates, we document how
they conduct business, and we estimate their market share. Second, we collect a
data set of recently signed malware and we use it to study the relationships
among malware developers, malware families and the certificates. We also use
information from the black market to fingerprint the certificates traded and to
identify when the are likely used to sign malware in the wild. Using these
methods, we document a shift in the methods that malware authors employ to
obtain valid digital signatures. While prior studies have reported the use of
code-signing certificates that had been compromised or obtained directly from
legitimate Certification Authorities, we observe that, in 2017, these methods
have become secondary to purchasing certificates from underground vendors. We
also find that the need to bypass platform protections such as Microsoft
Defender SmartScreen plays a growing role in driving the demand for
Authenticode certificates. Together, these findings suggest that the trade in
certificates issued for abuse represents an emerging segment of the underground
economy.
| cs.CR | recent measurements of the windows codesigning certificate ecosystem have highlighted various forms of abuse that allow malware authors to produce malicious code carrying valid digital signatures however the underground trade that allows miscreants to acquire such certificates is not well understood in this paper we illuminate two aspects of this trade first we investigate 4 leading vendors of authenticode certificates we document how they conduct business and we estimate their market share second we collect a data set of recently signed malware and we use it to study the relationships among malware developers malware families and the certificates we also use information from the black market to fingerprint the certificates traded and to identify when the are likely used to sign malware in the wild using these methods we document a shift in the methods that malware authors employ to obtain valid digital signatures while prior studies have reported the use of codesigning certificates that had been compromised or obtained directly from legitimate certification authorities we observe that in 2017 these methods have become secondary to purchasing certificates from underground vendors we also find that the need to bypass platform protections such as microsoft defender smartscreen plays a growing role in driving the demand for authenticode certificates together these findings suggest that the trade in certificates issued for abuse represents an emerging segment of the underground economy | [['recent', 'measurements', 'of', 'the', 'windows', 'codesigning', 'certificate', 'ecosystem', 'have', 'highlighted', 'various', 'forms', 'of', 'abuse', 'that', 'allow', 'malware', 'authors', 'to', 'produce', 'malicious', 'code', 'carrying', 'valid', 'digital', 'signatures', 'however', 'the', 'underground', 'trade', 'that', 'allows', 'miscreants', 'to', 'acquire', 'such', 'certificates', 'is', 'not', 'well', 'understood', 'in', 'this', 'paper', 'we', 'illuminate', 'two', 'aspects', 'of', 'this', 'trade', 'first', 'we', 'investigate', '4', 'leading', 'vendors', 'of', 'authenticode', 'certificates', 'we', 'document', 'how', 'they', 'conduct', 'business', 'and', 'we', 'estimate', 'their', 'market', 'share', 'second', 'we', 'collect', 'a', 'data', 'set', 'of', 'recently', 'signed', 'malware', 'and', 'we', 'use', 'it', 'to', 'study', 'the', 'relationships', 'among', 'malware', 'developers', 'malware', 'families', 'and', 'the', 'certificates', 'we', 'also', 'use', 'information', 'from', 'the', 'black', 'market', 'to', 'fingerprint', 'the', 'certificates', 'traded', 'and', 'to', 'identify', 'when', 'the', 'are', 'likely', 'used', 'to', 'sign', 'malware', 'in', 'the', 'wild', 'using', 'these', 'methods', 'we', 'document', 'a', 'shift', 'in', 'the', 'methods', 'that', 'malware', 'authors', 'employ', 'to', 'obtain', 'valid', 'digital', 'signatures', 'while', 'prior', 'studies', 'have', 'reported', 'the', 'use', 'of', 'codesigning', 'certificates', 'that', 'had', 'been', 'compromised', 'or', 'obtained', 'directly', 'from', 'legitimate', 'certification', 'authorities', 'we', 'observe', 'that', 'in', '2017', 'these', 'methods', 'have', 'become', 'secondary', 'to', 'purchasing', 'certificates', 'from', 'underground', 'vendors', 'we', 'also', 'find', 'that', 'the', 'need', 'to', 'bypass', 'platform', 'protections', 'such', 'as', 'microsoft', 'defender', 'smartscreen', 'plays', 'a', 'growing', 'role', 'in', 'driving', 'the', 'demand', 'for', 'authenticode', 'certificates', 'together', 'these', 'findings', 'suggest', 'that', 'the', 'trade', 'in', 'certificates', 'issued', 'for', 'abuse', 'represents', 'an', 'emerging', 'segment', 'of', 'the', 'underground', 'economy']] | [-0.11126583119870961, 0.01028258606941433, -0.08807532904445127, 0.13704046683207188, -0.12441050827120696, -0.18118990473781846, 0.1041651078407345, 0.3682640451680917, -0.2551795439441256, -0.32103208753064144, 0.1539145927391863, -0.3534683396668307, -0.16111996614745294, 0.2247901654978445, -0.1109546175617392, 0.04788937850181745, 0.023043785896464084, 0.0033972279332894167, 0.01676923180067596, -0.326277387943784, 0.32296298838835874, 0.027462418357442533, 0.2873109107308015, 0.10442590326523973, 0.0525049370652206, -0.02147178332130092, -0.06576186575122327, -0.03126965540702388, -0.12002697661757468, 0.12839206830332323, 0.3785175922000365, 0.23187659458926646, 0.3125234235210103, -0.48365587221425294, -0.12603321534282128, 0.14973089622591423, 0.13485681134495411, 0.14247553621992534, -0.09012561323574378, -0.3020739393333705, 0.12308769245776473, -0.2634993145558318, -0.1127733757873232, -0.11757389673480897, -0.017097165502491407, 0.0356120406520079, -0.21424864383672165, -0.02006352624266583, 0.011338241432115734, 0.08145802030256684, 0.001076155042548115, -0.07819834817200899, -0.02290732801910573, 0.22755485782038573, 0.10537662087569645, -0.06442460558849104, 0.16353838374821603, -0.10234082996248617, -0.17239531710012151, 0.3154736635707585, -0.011508049877842754, -0.11498003913064687, 0.18300126395427338, -0.060964665922386176, -0.17293879840040713, 0.07438353823921975, 0.2382740447397477, 0.06777171896387049, -0.1758109119081642, 0.003989752545229359, -0.03968119866476627, 0.20684737565586278, 0.09266484724503243, 0.019539860942001854, 0.20692683101515286, 0.1335198089052158, 0.07002407369457485, 0.12643009395729418, -0.06187595340764217, -0.07086274040921126, -0.2059894513315937, -0.16242217549214338, -0.14586628775370108, -0.008062821682934944, -0.03580293570822895, -0.1703813226642004, 0.3654290535778273, 0.24023220571273537, 0.11593598656015404, 0.034530585598466654, 0.29759979598955916, 0.003394400944736325, 0.13232107633978427, 0.10162238413717464, 0.21108353229647037, -0.012426537916845908, 0.18814773890439287, -0.12235311567214271, 0.16276912862070145, -0.0014758537898679996] |
1,803.02932 | Weight-almost greedy bases | We introduce the notion of a \textit{weight-almost greedy} basis and show
that a basis for a real Banach space is $w$-almost greedy if and only if it is
both quasi-greedy and $w$-democratic. We also introduce the notion of
\textit{weight-semi-greedy} basis and show that a $w$-almost greedy basis is
$w$-semi-greedy and that the converse holds if the Banach space has finite
cotype.
| math.FA | we introduce the notion of a textitweightalmost greedy basis and show that a basis for a real banach space is walmost greedy if and only if it is both quasigreedy and wdemocratic we also introduce the notion of textitweightsemigreedy basis and show that a walmost greedy basis is wsemigreedy and that the converse holds if the banach space has finite cotype | [['we', 'introduce', 'the', 'notion', 'of', 'a', 'textitweightalmost', 'greedy', 'basis', 'and', 'show', 'that', 'a', 'basis', 'for', 'a', 'real', 'banach', 'space', 'is', 'walmost', 'greedy', 'if', 'and', 'only', 'if', 'it', 'is', 'both', 'quasigreedy', 'and', 'wdemocratic', 'we', 'also', 'introduce', 'the', 'notion', 'of', 'textitweightsemigreedy', 'basis', 'and', 'show', 'that', 'a', 'walmost', 'greedy', 'basis', 'is', 'wsemigreedy', 'and', 'that', 'the', 'converse', 'holds', 'if', 'the', 'banach', 'space', 'has', 'finite', 'cotype']] | [-0.11380784432485438, 0.12702485012184633, -0.14234319040061613, 0.08808532631506719, -0.11487596880709916, -0.10557712879227965, 0.07335324002952691, 0.4407043470102444, -0.31468044286757185, -0.09961926603787824, 0.12873876602960782, -0.2058217706844995, -0.24246932994247528, 0.17488931869401744, -0.0850620396075803, -0.030757220282235688, 0.11010052649336949, 0.06016667497654756, -0.09464057461816099, -0.2865097838323237, 0.3955111782017507, -0.024498588356532548, 0.25859881292113607, 0.061539817642289815, 0.18967018943900862, 0.05064491067375792, 0.029787354971886726, 0.07107355260890663, -0.1162597114982833, 0.11710109602222872, 0.22892630172141812, 0.23766779925739556, 0.37098133269893496, -0.30702228246158675, -0.14106126324061238, 0.21264798323248038, 0.10238849564471789, 0.029380196729969037, -0.06908387600918088, -0.21135883889438814, 0.1427500609373837, -0.1713239929655142, -0.052522108996319664, -0.1789736606082634, 0.07872771131887771, -0.0012091804426490214, -0.35555933824364555, -0.026750412006278344, 0.11376196672126912, 0.04699877819471192, -0.08074669840565898, -0.07752002885140348, -0.05186614679303347, 0.02848028963464394, -0.05299207473198246, 0.10402554840568387, 0.028189769439529954, -0.0018943492323160172, -0.13375663321073117, 0.4089861378857964, -0.04997913843314899, -0.2731695046419637, 0.13681646650493667, -0.209601093230671, -0.14308129956847743, 0.019091673277057054, 0.09475862494620838, 0.12694442085921764, -0.04959426067050612, 0.20736754542980507, -0.20079978267874635, 0.15769751762088977, 0.053334989209185564, 0.08361058586620186, 0.044078329120550236, 0.1542770798693885, 0.17953543201611752, 0.11817075324391849, -0.010654466128663012, -0.011603482165618947, -0.32442557367316466, -0.22311392988552126, -0.2189200126582332, 0.027635237675879085, -0.1061701376403155, -0.19722485094608969, 0.33258211024497686, 0.11533284637456138, 0.17248284021033006, 0.13468279694452098, 0.244048476742025, 0.10422460053508219, 0.022535432914369984, 0.12252447524581823, 0.20286664977800428, 0.10551508150079794, -2.880015394143891e-05, -0.09946007851772663, 0.06473646292528301, 0.19673426063698635] |
1,803.02933 | Distributed Computation of Wasserstein Barycenters over Networks | We propose a new \cu{class-optimal} algorithm for the distributed computation
of Wasserstein Barycenters over networks. Assuming that each node in a graph
has a probability distribution, we prove that every node can reach the
barycenter of all distributions held in the network by using local interactions
compliant with the topology of the graph. We provide an estimate for the
minimum number of communication rounds required for the proposed method to
achieve arbitrary relative precision both in the optimality of the solution and
the consensus among all agents for undirected fixed networks.
| math.OC cs.DC cs.MA stat.ML | we propose a new cuclassoptimal algorithm for the distributed computation of wasserstein barycenters over networks assuming that each node in a graph has a probability distribution we prove that every node can reach the barycenter of all distributions held in the network by using local interactions compliant with the topology of the graph we provide an estimate for the minimum number of communication rounds required for the proposed method to achieve arbitrary relative precision both in the optimality of the solution and the consensus among all agents for undirected fixed networks | [['we', 'propose', 'a', 'new', 'cuclassoptimal', 'algorithm', 'for', 'the', 'distributed', 'computation', 'of', 'wasserstein', 'barycenters', 'over', 'networks', 'assuming', 'that', 'each', 'node', 'in', 'a', 'graph', 'has', 'a', 'probability', 'distribution', 'we', 'prove', 'that', 'every', 'node', 'can', 'reach', 'the', 'barycenter', 'of', 'all', 'distributions', 'held', 'in', 'the', 'network', 'by', 'using', 'local', 'interactions', 'compliant', 'with', 'the', 'topology', 'of', 'the', 'graph', 'we', 'provide', 'an', 'estimate', 'for', 'the', 'minimum', 'number', 'of', 'communication', 'rounds', 'required', 'for', 'the', 'proposed', 'method', 'to', 'achieve', 'arbitrary', 'relative', 'precision', 'both', 'in', 'the', 'optimality', 'of', 'the', 'solution', 'and', 'the', 'consensus', 'among', 'all', 'agents', 'for', 'undirected', 'fixed', 'networks']] | [-0.17844285891494818, 0.022115173932171377, -0.07567082964621173, 0.023649236011422343, -0.006923809494926698, -0.1488187102963113, 0.10562007015364037, 0.3933081980458357, -0.2903351599816233, -0.33144048025003736, 0.06349578715033001, -0.24005273766815663, -0.14322055270183934, 0.11968070204473204, -0.09591157048804841, 0.09610720429983403, 0.09942701515845126, 0.11425800153552296, -0.007318519700008134, -0.2692349341523368, 0.29929110419341465, 0.0353878789063957, 0.25469781866090163, 0.025446100595096745, 0.16020080285250313, 0.052910071507924136, 0.02387849222868681, 0.04848153040511534, -0.11089069518444981, 0.15280969351943996, 0.25072809934046947, 0.19065303047084145, 0.31889335255966417, -0.42801412936241834, -0.19153537754900754, 0.203387331437423, 0.12155814921069476, 0.09385048367290033, -0.009709096213595735, -0.26250031977478, 0.15685164105768004, -0.1711243126127455, -0.07927492225232223, -0.047904005884710284, 0.010915394665466415, 0.08571677470528004, -0.31390759891106024, -0.003615365001476473, 0.022179856076723403, 0.03472935370583501, -0.04676675952246619, -0.09658441624811126, -0.006155894304134158, 0.1848607505412979, -0.032103442690438695, 0.04104692970609499, 0.07981579246762623, -0.10836638530923261, -0.17383074664200346, 0.3618534693080518, -0.049772923801922136, -0.20908975508743122, 0.12294213828734225, -0.09084219067978362, -0.1590240287594497, 0.086831677518785, 0.22016625772747728, 0.11137313931766483, -0.14457244160067703, 0.06544145720221826, -0.056394922997181615, 0.1205108377772073, 0.04249733456720908, 0.02765609474024839, 0.13354916779531373, 0.18932210128340457, 0.21604080570654738, 0.11419144745709167, -0.09573981343354616, -0.10760578903266126, -0.29374547564528053, -0.15516399645970927, -0.2472132979814584, -0.01997913202374346, -0.20241334415024742, -0.13409806814872557, 0.40462890238397653, 0.17052960224553115, 0.21100933047321935, 0.18551908826145033, 0.2762681767848941, 0.07464554148157024, 0.042918825925638275, 0.21853515857106282, 0.21440393526314033, 0.1130307275801897, 0.06501663185837162, -0.16493485292885451, 0.13908910278567216, 0.07267119069583713] |
1,803.02934 | Hard magnetic properties in nanoflake van der Waals Fe3GeTe2 | Two dimensional (2D) van der Waals (vdW) materials have demonstrated
fascinating optical, electrical and thickness-dependent characteristics. These
have been explored by numerous authors but reports on magnetic properties and
spintronic applications of 2D vdW materials are scarce by comparison. By
performing anomalous Hall effect transport measurements, we have characterised
the thickness dependent magnetic properties of single crystalline vdW Fe3GeTe2.
The nanoflakes of this vdW metallic material exhibit a single hard magnetic
phase with a near square-shaped magnetic loop, large coercivity (up to 550 mT
at 2 K), a Curie temperature near 200 K and strong perpendicular magnetic
anisotropy. Using criticality analysis, we confirmed the existence of magnetic
coupling between vdW atomic layers and obtained an estimated coupling length of
~ 5 vdW layers in Fe3GeTe2. Furthermore, the hard magnetic behaviour of
Fe3GeTe2 can be well described by a proposed model. The magnetic properties of
Fe3GeTe2 highlight its potential for integration into vdW magnetic
heterostructures, paving the way for spintronic research and applications based
on these devices.
| cond-mat.mtrl-sci | two dimensional 2d van der waals vdw materials have demonstrated fascinating optical electrical and thicknessdependent characteristics these have been explored by numerous authors but reports on magnetic properties and spintronic applications of 2d vdw materials are scarce by comparison by performing anomalous hall effect transport measurements we have characterised the thickness dependent magnetic properties of single crystalline vdw fe3gete2 the nanoflakes of this vdw metallic material exhibit a single hard magnetic phase with a near squareshaped magnetic loop large coercivity up to 550 mt at 2 k a curie temperature near 200 k and strong perpendicular magnetic anisotropy using criticality analysis we confirmed the existence of magnetic coupling between vdw atomic layers and obtained an estimated coupling length of 5 vdw layers in fe3gete2 furthermore the hard magnetic behaviour of fe3gete2 can be well described by a proposed model the magnetic properties of fe3gete2 highlight its potential for integration into vdw magnetic heterostructures paving the way for spintronic research and applications based on these devices | [['two', 'dimensional', '2d', 'van', 'der', 'waals', 'vdw', 'materials', 'have', 'demonstrated', 'fascinating', 'optical', 'electrical', 'and', 'thicknessdependent', 'characteristics', 'these', 'have', 'been', 'explored', 'by', 'numerous', 'authors', 'but', 'reports', 'on', 'magnetic', 'properties', 'and', 'spintronic', 'applications', 'of', '2d', 'vdw', 'materials', 'are', 'scarce', 'by', 'comparison', 'by', 'performing', 'anomalous', 'hall', 'effect', 'transport', 'measurements', 'we', 'have', 'characterised', 'the', 'thickness', 'dependent', 'magnetic', 'properties', 'of', 'single', 'crystalline', 'vdw', 'fe3gete2', 'the', 'nanoflakes', 'of', 'this', 'vdw', 'metallic', 'material', 'exhibit', 'a', 'single', 'hard', 'magnetic', 'phase', 'with', 'a', 'near', 'squareshaped', 'magnetic', 'loop', 'large', 'coercivity', 'up', 'to', '550', 'mt', 'at', '2', 'k', 'a', 'curie', 'temperature', 'near', '200', 'k', 'and', 'strong', 'perpendicular', 'magnetic', 'anisotropy', 'using', 'criticality', 'analysis', 'we', 'confirmed', 'the', 'existence', 'of', 'magnetic', 'coupling', 'between', 'vdw', 'atomic', 'layers', 'and', 'obtained', 'an', 'estimated', 'coupling', 'length', 'of', '5', 'vdw', 'layers', 'in', 'fe3gete2', 'furthermore', 'the', 'hard', 'magnetic', 'behaviour', 'of', 'fe3gete2', 'can', 'be', 'well', 'described', 'by', 'a', 'proposed', 'model', 'the', 'magnetic', 'properties', 'of', 'fe3gete2', 'highlight', 'its', 'potential', 'for', 'integration', 'into', 'vdw', 'magnetic', 'heterostructures', 'paving', 'the', 'way', 'for', 'spintronic', 'research', 'and', 'applications', 'based', 'on', 'these', 'devices']] | [-0.18228866282257844, 0.1616536748067257, -0.011225400300640048, -0.028227663610948982, -0.05295388839546252, -0.16487055232071063, 0.033823293896222656, 0.4341262132663167, -0.27215304017970054, -0.3662009652026675, -0.04397456264334985, -0.3194727635744846, -0.15780088943005963, 0.27369595896311555, 0.09465346689138449, 0.07136014933165633, -0.034447364353885256, -0.09954269942121975, -0.08575875965823687, -0.21269541492713898, 0.24844448646586953, 0.005045550490136851, 0.31032248825314596, 0.12997916277893112, 0.025935563995418222, -0.0073568013219769595, 0.13754805020254218, 0.10076731202107939, -0.19896269085901705, 0.09397530953583279, 0.223275811376163, -0.2001692607674296, 0.24375044996898698, -0.4725947261646842, -0.23319379383218333, -0.042670655690810896, 0.11717541675280893, 0.09788327221617554, -0.09860000916418027, -0.27270601719166293, 0.09581721556641049, -0.1264970440756191, -0.10485045386779926, -0.15215928929886133, -0.0013154336307762246, 0.048258108826297705, -0.19687328931847306, 0.08771280082909277, 0.07214802420401777, 0.1341080235673651, -0.10428174553257342, -0.16164198434827, -0.04874749996868724, 0.07622188822980124, 0.012645311737574185, 0.023489570263490984, 0.22070710805216523, -0.1457807967896577, -0.10203784845988124, 0.34340596684452257, -0.025738693858412178, -0.033674230584592534, 0.19043899062230732, -0.13882301485899723, -0.09265038299120286, 0.13813313978978178, 0.12325844019863078, 0.07224304052634221, -0.16425808339633724, 0.1051038443488792, 0.041801469770231935, 0.17044152275405147, 0.0887068337422203, 0.07787128254545457, 0.3143501009679202, 0.21292056213274146, -0.0134295728914863, 0.126137500052044, -0.11743496024247371, 0.02282668757252395, -0.1720141338452584, -0.18609163135741696, -0.2501829899678176, 0.0993501566470403, -0.11389859122264721, -0.22435458762796992, 0.36174842729092094, 0.1472882647190779, 0.15027854070067406, -0.09351911449974233, 0.250985078896029, 0.06223044638366749, 0.12104981248408105, 0.02496769493727973, 0.31945623692802405, 0.203192073132871, 0.16947234864205574, -0.23294763157539294, 0.08702341343247981, 0.023186949663089984] |
1,803.02935 | Tilted Dirac Cone Effect on Interlayer Magnetoresistance in
\alpha-(BEDT-TTF)$_2$I$_3$ | We report the effect of Dirac cone tilting on interlayer magnetoresistance in
\alpha-(BEDT-TTF)$_2$I$_3$, which is a Dirac semimetal under pressure. Fitting
of the experimental data by the theoretical formula suggests that the system is
close to a type-II Dirac semimetal.
| cond-mat.str-el | we report the effect of dirac cone tilting on interlayer magnetoresistance in alphabedtttf_2i_3 which is a dirac semimetal under pressure fitting of the experimental data by the theoretical formula suggests that the system is close to a typeii dirac semimetal | [['we', 'report', 'the', 'effect', 'of', 'dirac', 'cone', 'tilting', 'on', 'interlayer', 'magnetoresistance', 'in', 'alphabedtttf_2i_3', 'which', 'is', 'a', 'dirac', 'semimetal', 'under', 'pressure', 'fitting', 'of', 'the', 'experimental', 'data', 'by', 'the', 'theoretical', 'formula', 'suggests', 'that', 'the', 'system', 'is', 'close', 'to', 'a', 'typeii', 'dirac', 'semimetal']] | [-0.2622376188985072, 0.14843110282090494, -0.08750632654409855, -0.012692224298371002, -0.14374535912647843, -0.2119879563106224, 0.16210037110140546, 0.365311028342694, -0.24868667004629968, -0.25919079771265385, -0.05374625221884344, -0.34491217182949185, -0.21664333359804006, 0.1996115674264729, 0.010401638923212886, 0.04739158097654581, 0.019113263656618074, -0.04356997756403871, -0.17118361226166598, -0.22734863609075545, 0.4024177758023143, 0.024012171372305602, 0.35389010664075615, 0.07800019734277157, 0.052025966384098864, -0.04825970641686581, 0.19429174435790628, 0.03149296236224473, -0.11328323591242224, 0.014211666031042115, 0.17791911405511202, -0.15347390646347775, 0.16475388249382378, -0.34903874723240735, -0.1687520904932171, -0.05196068435907364, 0.09937571007758379, 0.11756026918301359, -0.15543710697966162, -0.3406807195395231, 0.0949394959025085, -0.12802546836901457, -0.12785273146582768, -0.05768815060146153, -0.06176876154495403, -0.11101875444874168, -0.2545339078642428, 0.12172664327081292, 0.005411707935854793, 0.10815936166327447, -0.14087782233254983, -0.1385666996386135, -0.09983066259883344, -0.029494280449580402, 0.09171737491851673, -0.01655598436482251, 0.08638990290928632, -0.0828004700364545, -0.10950091978302226, 0.45230404487811027, -0.062371066416380926, -0.12104451265186071, 0.07420465755276381, -0.21240466545568779, -0.024323092168197037, 0.15608931584283708, 0.09531643372029067, 0.0853279253700748, -0.12077203607186675, 0.11599091996904462, -0.1350729096448049, 0.04906969228759408, -0.034981580916792154, -0.024973839661106466, 0.3191479460336268, 0.19312251233495772, 0.0675412331998814, 0.13529334040358662, -0.15151794601115398, 0.018898923165397718, -0.2985609480179846, -0.21825234510470182, -0.28444229988381264, 0.1143381393281743, -0.04565375143793062, -0.2315574177308008, 0.4107535115967039, 0.17450892804190515, 0.2041387090459466, -0.06036321163119283, 0.2375135555397719, 0.12532401010394095, 0.07631730672437698, 0.016489282133989036, 0.30281536662951114, 0.15855880389572122, 0.13599162665341283, -0.30923165929270907, 0.055378663400188086, 0.0516491226022481] |
1,803.02936 | Blurring the boundaries between topological and non-topological
phenomena in dots | We investigate the electronic and transport properties of topological and
trivial InAs$_{1-x}$Bi$_x$ quantum dots (QDs). By considering the rapid band
gap change within valence band anticrossing theory for InAs$_{1-x}$Bi$_x$, we
predicted that Bi-alloyed quantum wells become $\sim 30$meV gapped 2D
topological insulators for well widths $d>6.9$nm $(x = 0.15)$ and obtain the
$\boldsymbol{k.p}$ parameters of the corresponding Bernevig-Hughes-Zhang (BHZ)
model. We analytically solve this model for cylindrical confinement via
modified Bessel functions. For non-topological dots we find "geometrically
protected" discrete helical edge-like states, i.e., Kramers pairs with
spin-angular-momentum locking, in stark contrast with ordinary InAs QDs. For a
conduction window with four edge states, we find that the two-terminal
conductance ${\cal G}$ vs. the QD radius $R$ and the gate $V_g$ controlling its
levels shows a double peak at $2e^2/h$ for both topological and trivial QDs. In
contrast, when bulk and edge-state Kramers pairs coexist and are degenerate, a
single-peak resonance emerges. Our results blur the boundaries between
topological and non-topological phenomena for conductance measurements in small
systems such as QDs. Bi-based BHZ QDs should also prove important as hosts to
edge spin qubits.
| cond-mat.mes-hall | we investigate the electronic and transport properties of topological and trivial inas_1xbi_x quantum dots qds by considering the rapid band gap change within valence band anticrossing theory for inas_1xbi_x we predicted that bialloyed quantum wells become sim 30mev gapped 2d topological insulators for well widths d69nm x 015 and obtain the boldsymbolkp parameters of the corresponding bernevighugheszhang bhz model we analytically solve this model for cylindrical confinement via modified bessel functions for nontopological dots we find geometrically protected discrete helical edgelike states ie kramers pairs with spinangularmomentum locking in stark contrast with ordinary inas qds for a conduction window with four edge states we find that the twoterminal conductance cal g vs the qd radius r and the gate v_g controlling its levels shows a double peak at 2e2h for both topological and trivial qds in contrast when bulk and edgestate kramers pairs coexist and are degenerate a singlepeak resonance emerges our results blur the boundaries between topological and nontopological phenomena for conductance measurements in small systems such as qds bibased bhz qds should also prove important as hosts to edge spin qubits | [['we', 'investigate', 'the', 'electronic', 'and', 'transport', 'properties', 'of', 'topological', 'and', 'trivial', 'inas_1xbi_x', 'quantum', 'dots', 'qds', 'by', 'considering', 'the', 'rapid', 'band', 'gap', 'change', 'within', 'valence', 'band', 'anticrossing', 'theory', 'for', 'inas_1xbi_x', 'we', 'predicted', 'that', 'bialloyed', 'quantum', 'wells', 'become', 'sim', '30mev', 'gapped', '2d', 'topological', 'insulators', 'for', 'well', 'widths', 'd69nm', 'x', '015', 'and', 'obtain', 'the', 'boldsymbolkp', 'parameters', 'of', 'the', 'corresponding', 'bernevighugheszhang', 'bhz', 'model', 'we', 'analytically', 'solve', 'this', 'model', 'for', 'cylindrical', 'confinement', 'via', 'modified', 'bessel', 'functions', 'for', 'nontopological', 'dots', 'we', 'find', 'geometrically', 'protected', 'discrete', 'helical', 'edgelike', 'states', 'ie', 'kramers', 'pairs', 'with', 'spinangularmomentum', 'locking', 'in', 'stark', 'contrast', 'with', 'ordinary', 'inas', 'qds', 'for', 'a', 'conduction', 'window', 'with', 'four', 'edge', 'states', 'we', 'find', 'that', 'the', 'twoterminal', 'conductance', 'cal', 'g', 'vs', 'the', 'qd', 'radius', 'r', 'and', 'the', 'gate', 'v_g', 'controlling', 'its', 'levels', 'shows', 'a', 'double', 'peak', 'at', '2e2h', 'for', 'both', 'topological', 'and', 'trivial', 'qds', 'in', 'contrast', 'when', 'bulk', 'and', 'edgestate', 'kramers', 'pairs', 'coexist', 'and', 'are', 'degenerate', 'a', 'singlepeak', 'resonance', 'emerges', 'our', 'results', 'blur', 'the', 'boundaries', 'between', 'topological', 'and', 'nontopological', 'phenomena', 'for', 'conductance', 'measurements', 'in', 'small', 'systems', 'such', 'as', 'qds', 'bibased', 'bhz', 'qds', 'should', 'also', 'prove', 'important', 'as', 'hosts', 'to', 'edge', 'spin', 'qubits']] | [-0.19001087320884322, 0.21474059336222867, -0.02061033506593588, 0.06647447088146635, 0.034665026102151913, -0.27720014143756216, 0.07778767318172791, 0.3984846265744523, -0.2613007351019457, -0.3088139934770468, -0.040432329875638044, -0.33167154203224297, -0.13925161549234816, 0.16538318633601742, 0.004583315802132974, 0.06442751354468186, 0.007600984680808365, -0.08044271051652183, -0.10841947237534796, -0.1472876301896232, 0.2817243993897938, -0.07107268488639702, 0.28996140107980767, 0.09050995260634917, -0.011342993194627376, 0.005595544964801204, 0.16167386435498457, 0.015018348247970397, -0.18854462678427808, 0.03468011420333263, 0.25832012541115934, -0.16197307922056545, 0.1677377342225426, -0.4342566983863754, -0.18804135399878466, 0.014799584303114373, 0.17554865775256295, 0.13587081137423715, -0.05672060343763123, -0.3302344854100276, 0.0892215110887747, -0.13548679679558523, -0.08189843780108554, -0.048193536348914524, 0.017281292785106407, -0.06491651389442679, -0.22816010328380676, 0.1204640712248001, 0.041058651772117254, 0.05217751991635157, -0.04009325135470299, -0.0975678449149354, -0.1335188169163878, 0.07926529152848295, -0.01931247162155555, -0.009590513871372336, 0.17244953458791987, -0.1045050429677496, -0.18032936162531038, 0.35340790414793344, -0.05660410912833729, -0.12025764376440712, 0.13966162706919982, -0.18101313488332996, -0.05900485090921912, 0.09843150719126824, 0.06448421721730781, 0.09001946340230857, -0.043890529455986045, 0.1230508931728322, -0.009411806021659178, 0.14839929919742512, 0.04488456421952674, 0.155014207207803, 0.28707354341102187, 0.12121148019539729, 0.08610789165016537, 0.14028239464992395, -0.13100473383720437, -0.08246811969589841, -0.24673482018922807, -0.19024613139477406, -0.23307775898236718, 0.09725385130840843, -0.05080544638334337, -0.22710269902132998, 0.46361370733018314, 0.07241145719308406, 0.20329888441499933, -0.00038279762372702076, 0.21878312517873058, 0.163763744718432, 0.049728074759878955, 0.06411699468393595, 0.2276435948745216, 0.1987073333916849, 0.03811842625392443, -0.28193094264873764, -0.021856111612208424, -0.006283639056744885] |
1,803.02937 | Reconstruction of inclusion from boundary measurements | We consider the problem of reconstructing of the boundary of an unknown
inclusion together with its conductivity from the localized
Dirichlet-to-Neumann map. We give an exact reconstruction procedure and apply
the method to an inverse boundary value problem for the system of the equations
in the theory of elasticity.
| math.AP | we consider the problem of reconstructing of the boundary of an unknown inclusion together with its conductivity from the localized dirichlettoneumann map we give an exact reconstruction procedure and apply the method to an inverse boundary value problem for the system of the equations in the theory of elasticity | [['we', 'consider', 'the', 'problem', 'of', 'reconstructing', 'of', 'the', 'boundary', 'of', 'an', 'unknown', 'inclusion', 'together', 'with', 'its', 'conductivity', 'from', 'the', 'localized', 'dirichlettoneumann', 'map', 'we', 'give', 'an', 'exact', 'reconstruction', 'procedure', 'and', 'apply', 'the', 'method', 'to', 'an', 'inverse', 'boundary', 'value', 'problem', 'for', 'the', 'system', 'of', 'the', 'equations', 'in', 'the', 'theory', 'of', 'elasticity']] | [-0.09492340048166867, 0.010063945314293367, -0.06755862402140486, -0.013650916060622858, -0.056747816883179605, -0.07460671498877358, -0.006007068764361344, 0.3200838604219714, -0.3738047495408326, -0.26220926415289236, 0.15530349621881864, -0.29915961336192426, -0.16497861993099963, 0.16513102182320186, -0.06337547821125813, 0.10039455002549161, 0.05373493734062934, 0.06117692958012375, -0.11261623326156821, -0.1690334472852778, 0.38264009889633377, 0.024152462807845096, 0.22282861342786678, 0.06203279530211371, 0.14504372510983018, 0.03486013292258947, -0.014331972055441263, 0.020731446817897414, -0.157868088023471, 0.16380222397856414, 0.19406772100803804, 0.10315118254903628, 0.22308744353299237, -0.4492982122666982, -0.1958738538740697, 0.08234028907834876, 0.09677289501402755, 0.15546246887925935, -0.007430142870324911, -0.2918764975454126, 0.0636990977669781, -0.10065299191284088, -0.19132771996819242, -0.009814511148297057, -0.0208436236621774, -0.06793514517497043, -0.302222657416548, 0.1316446262050648, 0.040402824838398674, 0.03584185664599039, -0.21435017693949368, -0.09275673547217965, 0.02666617853909123, 0.16052084361031957, 0.046850485054833094, 0.009021823893168144, 0.05445000040820058, -0.18249635976188036, -0.08136083427056366, 0.35777027196041783, -0.03688900124718796, -0.2647326289847189, 0.12771145472949258, -0.08325528228009234, -0.07273532947221277, 0.1436117588523395, 0.1820649572324996, 0.16529478353201127, -0.16289744161577818, 0.15009418733261184, -0.06427678879711549, 0.14375848530278523, 0.0032530483428616914, -0.05880870679583477, 0.12522303702651846, 0.15161067000305167, 0.16602476078028583, 0.21424327528208723, -0.0726896536023337, -0.015190254440721201, -0.3445510400877315, -0.14909588168042578, -0.19124178105623138, 0.03776338396175784, -0.12602976644952182, -0.27481667925508657, 0.38891300289150404, 0.21026400277124985, 0.2225157877629889, 0.05808736976920342, 0.2591613003062274, 0.22674484121404131, -0.025571261019426948, 0.044232205715866724, 0.2005383875221014, 0.1823004364245096, 0.09992173613448228, -0.30030121104506663, -0.00446476389140803, 0.1427014291628587] |
1,803.02938 | Stability and Well-posedness of a Nonlinear Railway Track Model | Railway tracks rest on a foundation known for exhibiting nonlinear
viscoelastic behavior. Railway track deflections are modeled by a semilinear
partial differential equation. This paper studies the stability of solutions to
this equation in presence of an input. With the aid of a suitable Lyapunov
function, existence and exponential stability of classical solutions is
established for certain inputs. The Lyapunov function is further used to find
an a-priori estimate of the solutions, and also to study the input-to-state
stability (ISS) of mild solutions.
| math.AP | railway tracks rest on a foundation known for exhibiting nonlinear viscoelastic behavior railway track deflections are modeled by a semilinear partial differential equation this paper studies the stability of solutions to this equation in presence of an input with the aid of a suitable lyapunov function existence and exponential stability of classical solutions is established for certain inputs the lyapunov function is further used to find an apriori estimate of the solutions and also to study the inputtostate stability iss of mild solutions | [['railway', 'tracks', 'rest', 'on', 'a', 'foundation', 'known', 'for', 'exhibiting', 'nonlinear', 'viscoelastic', 'behavior', 'railway', 'track', 'deflections', 'are', 'modeled', 'by', 'a', 'semilinear', 'partial', 'differential', 'equation', 'this', 'paper', 'studies', 'the', 'stability', 'of', 'solutions', 'to', 'this', 'equation', 'in', 'presence', 'of', 'an', 'input', 'with', 'the', 'aid', 'of', 'a', 'suitable', 'lyapunov', 'function', 'existence', 'and', 'exponential', 'stability', 'of', 'classical', 'solutions', 'is', 'established', 'for', 'certain', 'inputs', 'the', 'lyapunov', 'function', 'is', 'further', 'used', 'to', 'find', 'an', 'apriori', 'estimate', 'of', 'the', 'solutions', 'and', 'also', 'to', 'study', 'the', 'inputtostate', 'stability', 'iss', 'of', 'mild', 'solutions']] | [-0.18140605804566518, 0.025994659915176525, -0.10636607849274773, 0.06970228521007461, -0.08765577373981297, -0.12262360415567296, -0.009007646055634033, 0.26506304258413343, -0.3046828154250082, -0.2625104219215103, 0.18218777237841524, -0.2600441504135189, -0.18470809203418287, 0.18893532082999506, -0.06785814115126808, 0.1778022857966373, 0.054648733372429766, 0.02862928568172347, -0.0545320031681962, -0.19232270233501422, 0.33341241399028215, 0.025404377627265023, 0.24538455577532156, -0.017903923932238514, 0.12819808476929923, -0.014514049459024366, -0.003042908093656402, 0.008817801588630101, -0.1930626179147736, 0.07517581447644765, 0.24018451381833797, 0.09389385752133038, 0.3043386718729533, -0.4075304995549012, -0.22179872166724449, 0.113911976607191, 0.13265829577660523, 0.06928740099566169, -0.0693553611594084, -0.31539966316377543, 0.12764979345746427, -0.11676165278080895, -0.24753890092854938, -0.07190813424896045, 0.019192088513175047, 0.13226875164041138, -0.30430860588529024, 0.07743578203021077, 0.05374140780508877, 0.0657582206915256, -0.18131050727251602, -0.026065646597823823, -0.024814834829464734, 0.10606720494330828, 0.09673978578501258, -0.026022825031036353, 0.07189530202647648, -0.13799266560362225, -0.09302275737814875, 0.32066286366477786, -0.0792879508359425, -0.28291597473154584, 0.18003647706011333, -0.07953622080497892, -0.09049141230286066, 0.13988075293712768, 0.20196489591420774, 0.1468323277399303, -0.2071077193032546, 0.06365835975928524, -0.034356371994713794, 0.21171869630420423, 0.05942280740331275, 0.013080283977001547, 0.1087895008589489, 0.18985614252377706, 0.1513362910755607, 0.1624038344899933, 0.008915130119119962, -0.1299703026145517, -0.3282778107796807, -0.13307451974061957, -0.07834591612174928, 0.0714137148145721, -0.09627506648420345, -0.21420839808163156, 0.4140975100425891, 0.0961833135414229, 0.15084093868597803, 0.0947158349879894, 0.2641623383051301, 0.18430626296988092, -0.02529686686010605, 0.05024565217610805, 0.2641715424202652, 0.16401190515775907, 0.16186700357371067, -0.2462802999428507, 0.11199102066008441, 0.1073618966704571] |
1,803.02939 | Relating Cut and Paste Invariants and TQFTs | In this paper, we shall be concerned with a relation between TQFTs and cut
and paste invariants introduced by Karras, Kreck, Neumann and Ossa. Cut and
paste invariants, or SK invariants, are functions on the set of smooth
manifolds that are invariant under the cutting and pasting operation. Central
to the work in this paper are also SKK invariants, whose values on cut and
paste equivalent manifolds differ by an error term depending only on the
glueing diffeomorphism. Here we investigate a surprisingly natural group
homomorphism between the group of invertible TQFTs and the group of SKK
invariants and describe how these groups fit into an exact sequence. We
conclude in particular that all positive real-valued SKK invariants can be
realized as restrictions of invertible TQFTs. All manifolds are smooth and
oriented throughout unless stated otherwise.
| math.AT math-ph math.GT math.MP | in this paper we shall be concerned with a relation between tqfts and cut and paste invariants introduced by karras kreck neumann and ossa cut and paste invariants or sk invariants are functions on the set of smooth manifolds that are invariant under the cutting and pasting operation central to the work in this paper are also skk invariants whose values on cut and paste equivalent manifolds differ by an error term depending only on the glueing diffeomorphism here we investigate a surprisingly natural group homomorphism between the group of invertible tqfts and the group of skk invariants and describe how these groups fit into an exact sequence we conclude in particular that all positive realvalued skk invariants can be realized as restrictions of invertible tqfts all manifolds are smooth and oriented throughout unless stated otherwise | [['in', 'this', 'paper', 'we', 'shall', 'be', 'concerned', 'with', 'a', 'relation', 'between', 'tqfts', 'and', 'cut', 'and', 'paste', 'invariants', 'introduced', 'by', 'karras', 'kreck', 'neumann', 'and', 'ossa', 'cut', 'and', 'paste', 'invariants', 'or', 'sk', 'invariants', 'are', 'functions', 'on', 'the', 'set', 'of', 'smooth', 'manifolds', 'that', 'are', 'invariant', 'under', 'the', 'cutting', 'and', 'pasting', 'operation', 'central', 'to', 'the', 'work', 'in', 'this', 'paper', 'are', 'also', 'skk', 'invariants', 'whose', 'values', 'on', 'cut', 'and', 'paste', 'equivalent', 'manifolds', 'differ', 'by', 'an', 'error', 'term', 'depending', 'only', 'on', 'the', 'glueing', 'diffeomorphism', 'here', 'we', 'investigate', 'a', 'surprisingly', 'natural', 'group', 'homomorphism', 'between', 'the', 'group', 'of', 'invertible', 'tqfts', 'and', 'the', 'group', 'of', 'skk', 'invariants', 'and', 'describe', 'how', 'these', 'groups', 'fit', 'into', 'an', 'exact', 'sequence', 'we', 'conclude', 'in', 'particular', 'that', 'all', 'positive', 'realvalued', 'skk', 'invariants', 'can', 'be', 'realized', 'as', 'restrictions', 'of', 'invertible', 'tqfts', 'all', 'manifolds', 'are', 'smooth', 'and', 'oriented', 'throughout', 'unless', 'stated', 'otherwise']] | [-0.15501591664635472, 0.1171176602876383, -0.08868406630224651, 0.08528410399643084, -0.07746154465195206, -0.1671993558536525, 0.007629978755075071, 0.3733329125628289, -0.3064039885342397, -0.26926432846252013, 0.14458350271279752, -0.266103255831533, -0.1734293117446618, 0.1678811412839288, -0.17443641624585898, -0.004135500405013941, 0.03362045883787451, 0.03471132505133196, -0.1343429335013584, -0.25353205217117514, 0.42678966715379996, -0.04314338638688679, 0.20492376085646727, 0.07943996143898133, 0.08345225068430105, -0.009632858854753, -0.033519796539029034, 0.07012005456016157, -0.16972317104626672, 0.09425366130760975, 0.2696713319203506, 0.052513286881838685, 0.1195876161671347, -0.4234823383321917, -0.11538788907367874, 0.1555296254111454, 0.13371700546186832, 0.015926060039136145, 0.013365376710512297, -0.27353810950837754, 0.12458088964361835, -0.13337512444963473, -0.07376303658648221, -0.10765478000803679, 0.027820980386739528, 0.00558399977852349, -0.19205052385934526, 0.009524262832538053, 0.10138968907607099, 0.11132353068570848, -0.04759529112510521, -0.07282118624835103, -0.07751165929043459, 0.12904172863604293, 0.0077576768826003424, 0.042779485545879986, 0.11752504047903198, -0.07919413889585822, -0.10372582566406992, 0.3425695219870519, -0.03852081624791026, -0.26974241888081585, 0.1314973114127362, -0.08426387975061381, -0.1894579921538631, 0.08083485292650207, 0.09454398363897645, 0.1629562027476452, -0.09743049668355121, 0.14757495721483052, -0.07536229652921772, 0.08880798879890116, 0.12768663100863772, -0.010734150684611112, 0.15934218988684867, 0.022860988210541784, 0.08573314687927013, 0.15331971925959267, 0.05977931657840532, -0.033694608495743184, -0.3522894929059678, -0.19386767737688151, -0.10687341137306282, 0.11792878261249927, -0.08978869150192217, -0.16755117800052244, 0.3960022500647163, 0.05396028207615018, 0.178265314783763, 0.1428095625196066, 0.2197721641441738, 0.07159356730655957, 0.04922171252331248, 0.09815648299883362, 0.1496507128217706, 0.16293245928224037, -0.012988295299173506, -0.15384031263076597, -0.003810889777485971, 0.1654095276914261] |
1,803.0294 | The Advantage of Doubling: A Deep Reinforcement Learning Approach to
Studying the Double Team in the NBA | During the 2017 NBA playoffs, Celtics coach Brad Stevens was faced with a
difficult decision when defending against the Cavaliers: "Do you double and
risk giving up easy shots, or stay at home and do the best you can?" It's a
tough call, but finding a good defensive strategy that effectively incorporates
doubling can make all the difference in the NBA. In this paper, we analyze
double teaming in the NBA, quantifying the trade-off between risk and reward.
Using player trajectory data pertaining to over 643,000 possessions, we
identified when the ball handler was double teamed. Given these data and the
corresponding outcome (i.e., was the defense successful), we used deep
reinforcement learning to estimate the quality of the defensive actions. We
present qualitative and quantitative results summarizing our learned defensive
strategy for defending. We show that our policy value estimates are predictive
of points per possession and win percentage. Overall, the proposed framework
represents a step toward a more comprehensive understanding of defensive
strategies in the NBA.
| cs.LG | during the 2017 nba playoffs celtics coach brad stevens was faced with a difficult decision when defending against the cavaliers do you double and risk giving up easy shots or stay at home and do the best you can its a tough call but finding a good defensive strategy that effectively incorporates doubling can make all the difference in the nba in this paper we analyze double teaming in the nba quantifying the tradeoff between risk and reward using player trajectory data pertaining to over 643000 possessions we identified when the ball handler was double teamed given these data and the corresponding outcome ie was the defense successful we used deep reinforcement learning to estimate the quality of the defensive actions we present qualitative and quantitative results summarizing our learned defensive strategy for defending we show that our policy value estimates are predictive of points per possession and win percentage overall the proposed framework represents a step toward a more comprehensive understanding of defensive strategies in the nba | [['during', 'the', '2017', 'nba', 'playoffs', 'celtics', 'coach', 'brad', 'stevens', 'was', 'faced', 'with', 'a', 'difficult', 'decision', 'when', 'defending', 'against', 'the', 'cavaliers', 'do', 'you', 'double', 'and', 'risk', 'giving', 'up', 'easy', 'shots', 'or', 'stay', 'at', 'home', 'and', 'do', 'the', 'best', 'you', 'can', 'its', 'a', 'tough', 'call', 'but', 'finding', 'a', 'good', 'defensive', 'strategy', 'that', 'effectively', 'incorporates', 'doubling', 'can', 'make', 'all', 'the', 'difference', 'in', 'the', 'nba', 'in', 'this', 'paper', 'we', 'analyze', 'double', 'teaming', 'in', 'the', 'nba', 'quantifying', 'the', 'tradeoff', 'between', 'risk', 'and', 'reward', 'using', 'player', 'trajectory', 'data', 'pertaining', 'to', 'over', '643000', 'possessions', 'we', 'identified', 'when', 'the', 'ball', 'handler', 'was', 'double', 'teamed', 'given', 'these', 'data', 'and', 'the', 'corresponding', 'outcome', 'ie', 'was', 'the', 'defense', 'successful', 'we', 'used', 'deep', 'reinforcement', 'learning', 'to', 'estimate', 'the', 'quality', 'of', 'the', 'defensive', 'actions', 'we', 'present', 'qualitative', 'and', 'quantitative', 'results', 'summarizing', 'our', 'learned', 'defensive', 'strategy', 'for', 'defending', 'we', 'show', 'that', 'our', 'policy', 'value', 'estimates', 'are', 'predictive', 'of', 'points', 'per', 'possession', 'and', 'win', 'percentage', 'overall', 'the', 'proposed', 'framework', 'represents', 'a', 'step', 'toward', 'a', 'more', 'comprehensive', 'understanding', 'of', 'defensive', 'strategies', 'in', 'the', 'nba']] | [-0.047611960708528356, 0.031106171130864734, -0.12323735255316035, 0.11658242195269587, -0.11421269106577678, -0.18371340136481337, 0.1655022035912521, 0.42223637264940034, -0.211219671429191, -0.32175089408631624, 0.0972097388862987, -0.3134259152792798, -0.15681237109595944, 0.1768644067840314, -0.18595967483243916, 0.051878792787439204, 0.09405860633600548, 0.04602766069246972, 0.028452262588137066, -0.3310520841686773, 0.2804704986664141, 0.05195246072866847, 0.2874069698982457, 0.02908847623682477, 0.09863638470695545, 0.02772902361543692, -0.04225841386198818, 0.012370368813624582, -0.12897539026630236, 0.11426665498566511, 0.3117202160170257, 0.21975302973801428, 0.4089332403256053, -0.38190383383308546, -0.1264411492963288, 0.13006444668245828, 0.07815689605580789, 0.10180943615240864, -0.021127564461319005, -0.29164892405899895, 0.07120757697974836, -0.18524664828759976, -0.07005099928657334, -0.11116880774869674, -0.027506731377622808, -0.015394919085546386, -0.2844854635691427, -0.01183429351974144, 0.02377990159452949, 0.04308362654971341, -0.044079162858578054, -0.12875651930885232, -0.01924770669618913, 0.2367708768800086, 0.05513315975205995, 0.04536542035947857, 0.11693108316611903, -0.13356581232748949, -0.17144953205912228, 0.3418687813275729, -0.0360925961173622, -0.11428422517148801, 0.15504945412906537, -0.08223858097545712, -0.13068192594493164, 0.08794076583090138, 0.18203082705528129, 0.08699653649994407, -0.11283847667415015, -0.03227427552372823, -0.04188646512465125, 0.15816848738124617, 0.06752612498723509, -0.062104555497686544, 0.14811537591516075, 0.19801196096049822, 0.08826516120672136, 0.09539371568580574, -0.08629622301984444, -0.1137238743473742, -0.25903115725616016, -0.15039447782538742, -0.0994924320229217, 0.006165374329885894, -0.07066045449334842, -0.10725654116326785, 0.38982971801691835, 0.19616626389885702, 0.15604183562408505, 0.10232660046453218, 0.31049309431923083, 0.030607644385792852, 0.0436415945743691, 0.11218560353645224, 0.23457138086052007, -0.03361083443153156, 0.11266303593531274, -0.2054892154529702, 0.16535247908624628, 0.03247445032943085] |
1,803.02941 | Model reduction methods for classical stochastic systems with
fast-switching environments: reduced master equations, stochastic
differential equations, and applications | We study classical stochastic systems with discrete states, coupled to
switching external environments. For fast environmental processes we derive
reduced dynamics for the system itself, focusing on corrections to the
adiabatic limit of infinite time scale separation. In some cases, this leads to
master equations with negative transition `rates' or bursting events. We devise
a simulation algorithm in discrete time to unravel these master equations into
sample paths, and provide an interpretation of bursting events. Focusing on
stochastic population dynamics coupled to external environments, we discuss a
series of approximation schemes combining expansions in the inverse switching
rate of the environment, and a Kramers--Moyal expansion in the inverse size of
the population. This places the different approximations in relation to
existing work on piecewise-deterministic and piecewise-diffusive Markov
processes. We apply the model reduction methods to different examples including
systems in biology and a model of crack propagation.
| cond-mat.stat-mech q-bio.MN q-bio.PE q-bio.QM | we study classical stochastic systems with discrete states coupled to switching external environments for fast environmental processes we derive reduced dynamics for the system itself focusing on corrections to the adiabatic limit of infinite time scale separation in some cases this leads to master equations with negative transition rates or bursting events we devise a simulation algorithm in discrete time to unravel these master equations into sample paths and provide an interpretation of bursting events focusing on stochastic population dynamics coupled to external environments we discuss a series of approximation schemes combining expansions in the inverse switching rate of the environment and a kramersmoyal expansion in the inverse size of the population this places the different approximations in relation to existing work on piecewisedeterministic and piecewisediffusive markov processes we apply the model reduction methods to different examples including systems in biology and a model of crack propagation | [['we', 'study', 'classical', 'stochastic', 'systems', 'with', 'discrete', 'states', 'coupled', 'to', 'switching', 'external', 'environments', 'for', 'fast', 'environmental', 'processes', 'we', 'derive', 'reduced', 'dynamics', 'for', 'the', 'system', 'itself', 'focusing', 'on', 'corrections', 'to', 'the', 'adiabatic', 'limit', 'of', 'infinite', 'time', 'scale', 'separation', 'in', 'some', 'cases', 'this', 'leads', 'to', 'master', 'equations', 'with', 'negative', 'transition', 'rates', 'or', 'bursting', 'events', 'we', 'devise', 'a', 'simulation', 'algorithm', 'in', 'discrete', 'time', 'to', 'unravel', 'these', 'master', 'equations', 'into', 'sample', 'paths', 'and', 'provide', 'an', 'interpretation', 'of', 'bursting', 'events', 'focusing', 'on', 'stochastic', 'population', 'dynamics', 'coupled', 'to', 'external', 'environments', 'we', 'discuss', 'a', 'series', 'of', 'approximation', 'schemes', 'combining', 'expansions', 'in', 'the', 'inverse', 'switching', 'rate', 'of', 'the', 'environment', 'and', 'a', 'kramersmoyal', 'expansion', 'in', 'the', 'inverse', 'size', 'of', 'the', 'population', 'this', 'places', 'the', 'different', 'approximations', 'in', 'relation', 'to', 'existing', 'work', 'on', 'piecewisedeterministic', 'and', 'piecewisediffusive', 'markov', 'processes', 'we', 'apply', 'the', 'model', 'reduction', 'methods', 'to', 'different', 'examples', 'including', 'systems', 'in', 'biology', 'and', 'a', 'model', 'of', 'crack', 'propagation']] | [-0.14118614124950685, 0.09341217345673326, -0.09301430999288617, 0.09340064081264507, -0.03919513484029329, -0.10235785455155913, 0.08995757326372095, 0.3659838984197337, -0.3005744109794574, -0.28436782185868553, 0.10928470932811575, -0.24789124008344665, -0.1397346706458125, 0.206116276254163, -0.023965541605059416, 0.04248151641134938, 0.04550578557465174, -0.021540115647813725, -0.048756404567752286, -0.2099750939069303, 0.2862171560138873, 0.04346880019476561, 0.2770573519591293, -0.04014358735860211, 0.14199336125094392, -0.010534356815472552, -0.03106596099518954, -0.01883944312073117, -0.13404788754099808, 0.07003644255288137, 0.2315235766422718, 0.0925527893210927, 0.26001295906631916, -0.4811294146759929, -0.2433363850011605, 0.09472448475641351, 0.14644722582107372, 0.16907873774610765, -0.03326939063366783, -0.2700368794325535, 0.006925668975670044, -0.15349710700006466, -0.13593455572765678, -0.05867533306655002, 0.026377213694640016, 0.06523904584392855, -0.27356312029567637, 0.11019569189345133, 0.06017368782809234, 0.030413700988490697, -0.07453902925632588, -0.051836000847126265, 0.060054239539480574, 0.10702649280843517, 0.0322640264041607, -0.051614350742941136, 0.14043516590106875, -0.13247776261773214, -0.15645971665898822, 0.34277519080724106, -0.08361041288000008, -0.20351479239506673, 0.25991053806222364, -0.14202299487058628, -0.15267721724007532, 0.1255797417770612, 0.2820993452907017, 0.13308257733675818, -0.18466261440364976, 0.07949780843265304, 0.05980876501496524, 0.14372207638680015, 0.02030195184020096, 0.013170810626845246, 0.12023861897624519, 0.20093071820495062, 0.03092907929126403, 0.16186853806960255, -0.038885498242388954, -0.18826176107331652, -0.27983886259926916, -0.10827265006860029, -0.09911545202748416, 0.07543414034593646, -0.09995044835632641, -0.1857044068611648, 0.36757525386390827, 0.19235387624501352, 0.18176191084546178, 0.06453108172927512, 0.2768186154258629, 0.1901073024850594, 0.0060037740790093806, 0.062002337773726005, 0.16607429182307623, 0.15213609498938266, 0.09482242123619335, -0.26304455000065163, 0.06056715432739472, 0.07145480155842761] |
1,803.02942 | Presentations of Categories of Modules using the
Cautis-Kamnitzer-Morrison Principle | We use duality theorems to obtain presentations of some categories of
modules. To derive these presentations we generalize a result of
Cautis-Kamnitzer-Morrison [arXiv:1210.6437v4]:
Let $\mathfrak{g}$ be a reductive Lie algebra, and $A$ an algebra, both over
$\mathbb{C}$. Consider a $(\mathfrak{g} , A)$-bimodule $P$ in which
(a) $P$ has a multiplicity free decomposition into irreducible $(\mathfrak{g}
, A)$-bimodules.
(b) $P$ is "saturated" i.e. for any irreducible $\mathfrak{g}$-module $V$, if
every weight of $V$ is a weight of $P$, then $V$ is a submodule of $P$.
We show that statements (a) and (b) are necessary and sufficient conditions
for the existence of an isomorphism of categories between the full subcategory
of $\mathcal{R}ep A$ whose objects are $\mathfrak{g}$-weight spaces of $P$, and
a quotient of the category version of Lusztig's idempotented form,
$\dot{{\mathcal{U}}} \mathfrak{g}$, formed by setting to zero all morphisms
factoring through a collection of objects in $\dot{{\mathcal{U}}} \mathfrak{g}$
depending on $P$. This is essentially a categorical version of the
identification of generalized Schur algebras with quotients of Lusztig's
idempotented forms given by Doty in [arXiv:math/0305208].
Applied to Schur-Weyl Duality we obtain a diagrammatic presentation of the
full subcategory of $\mathcal{R}ep S_d$ whose objects are direct sums of
permutation modules, as well as an explicit description of the
$\otimes$-product of morphisms between permutation modules. Applied to
Brauer-Schur-Weyl Duality we obtain diagrammatic presentations of subcategories
of $\mathcal{R}ep \mathcal{B}_{d}^{(- 2n)}$ and $\mathcal{R}ep
\mathcal{B}_{r,s}^{(n)}$ whose Karoubi completion is the whole of
$\mathcal{R}ep \mathcal{B}_{d}^{(- 2n)}$ and $\mathcal{R}ep
\mathcal{B}_{r,s}^{(n)}$ respectively.
| math.RT | we use duality theorems to obtain presentations of some categories of modules to derive these presentations we generalize a result of cautiskamnitzermorrison arxiv12106437v4 let mathfrakg be a reductive lie algebra and a an algebra both over mathbbc consider a mathfrakg abimodule p in which a p has a multiplicity free decomposition into irreducible mathfrakg abimodules b p is saturated ie for any irreducible mathfrakgmodule v if every weight of v is a weight of p then v is a submodule of p we show that statements a and b are necessary and sufficient conditions for the existence of an isomorphism of categories between the full subcategory of mathcalrep a whose objects are mathfrakgweight spaces of p and a quotient of the category version of lusztigs idempotented form dotmathcalu mathfrakg formed by setting to zero all morphisms factoring through a collection of objects in dotmathcalu mathfrakg depending on p this is essentially a categorical version of the identification of generalized schur algebras with quotients of lusztigs idempotented forms given by doty in arxivmath0305208 applied to schurweyl duality we obtain a diagrammatic presentation of the full subcategory of mathcalrep s_d whose objects are direct sums of permutation modules as well as an explicit description of the otimesproduct of morphisms between permutation modules applied to brauerschurweyl duality we obtain diagrammatic presentations of subcategories of mathcalrep mathcalb_d 2n and mathcalrep mathcalb_rsn whose karoubi completion is the whole of mathcalrep mathcalb_d 2n and mathcalrep mathcalb_rsn respectively | [['we', 'use', 'duality', 'theorems', 'to', 'obtain', 'presentations', 'of', 'some', 'categories', 'of', 'modules', 'to', 'derive', 'these', 'presentations', 'we', 'generalize', 'a', 'result', 'of', 'cautiskamnitzermorrison', 'arxiv12106437v4', 'let', 'mathfrakg', 'be', 'a', 'reductive', 'lie', 'algebra', 'and', 'a', 'an', 'algebra', 'both', 'over', 'mathbbc', 'consider', 'a', 'mathfrakg', 'abimodule', 'p', 'in', 'which', 'a', 'p', 'has', 'a', 'multiplicity', 'free', 'decomposition', 'into', 'irreducible', 'mathfrakg', 'abimodules', 'b', 'p', 'is', 'saturated', 'ie', 'for', 'any', 'irreducible', 'mathfrakgmodule', 'v', 'if', 'every', 'weight', 'of', 'v', 'is', 'a', 'weight', 'of', 'p', 'then', 'v', 'is', 'a', 'submodule', 'of', 'p', 'we', 'show', 'that', 'statements', 'a', 'and', 'b', 'are', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'the', 'existence', 'of', 'an', 'isomorphism', 'of', 'categories', 'between', 'the', 'full', 'subcategory', 'of', 'mathcalrep', 'a', 'whose', 'objects', 'are', 'mathfrakgweight', 'spaces', 'of', 'p', 'and', 'a', 'quotient', 'of', 'the', 'category', 'version', 'of', 'lusztigs', 'idempotented', 'form', 'dotmathcalu', 'mathfrakg', 'formed', 'by', 'setting', 'to', 'zero', 'all', 'morphisms', 'factoring', 'through', 'a', 'collection', 'of', 'objects', 'in', 'dotmathcalu', 'mathfrakg', 'depending', 'on', 'p', 'this', 'is', 'essentially', 'a', 'categorical', 'version', 'of', 'the', 'identification', 'of', 'generalized', 'schur', 'algebras', 'with', 'quotients', 'of', 'lusztigs', 'idempotented', 'forms', 'given', 'by', 'doty', 'in', 'arxivmath0305208', 'applied', 'to', 'schurweyl', 'duality', 'we', 'obtain', 'a', 'diagrammatic', 'presentation', 'of', 'the', 'full', 'subcategory', 'of', 'mathcalrep', 's_d', 'whose', 'objects', 'are', 'direct', 'sums', 'of', 'permutation', 'modules', 'as', 'well', 'as', 'an', 'explicit', 'description', 'of', 'the', 'otimesproduct', 'of', 'morphisms', 'between', 'permutation', 'modules', 'applied', 'to', 'brauerschurweyl', 'duality', 'we', 'obtain', 'diagrammatic', 'presentations', 'of', 'subcategories', 'of', 'mathcalrep', 'mathcalb_d', '2n', 'and', 'mathcalrep', 'mathcalb_rsn', 'whose', 'karoubi', 'completion', 'is', 'the', 'whole', 'of', 'mathcalrep', 'mathcalb_d', '2n', 'and', 'mathcalrep', 'mathcalb_rsn', 'respectively']] | [-0.19483288148274788, 0.06294664670915356, -0.11991080943729855, 0.029723000881843206, -0.10644583506549461, -0.14229260059073567, 0.0003482607381346707, 0.3361733347639187, -0.35753161863037825, -0.18053866184165335, 0.07004601693598744, -0.2160488605092187, -0.09643148443100448, 0.1723156583497428, -0.1565980935527975, -0.09059772695191841, 0.08054698574352755, 0.1451903189588179, -0.11264467343556671, -0.27329489449536604, 0.3855432554378978, -0.05407960610175665, 0.19451122804003584, 0.0059198024025998814, 0.1392853864076603, 0.05084081169647666, -0.0027273731817626674, -0.0260050621880696, -0.15223085785023574, 0.12872339091582113, 0.3431749595886367, 0.11002929558162577, 0.20189622116253242, -0.3252769582769306, -0.03732572747076042, 0.20334654320111004, 0.14807987255372632, -0.006098391383221676, 0.016838853071845718, -0.28977417583282816, 0.13504471031351425, -0.24976965367125395, -0.07440742506430699, -0.0717806454288224, 0.13352268265011027, -0.004688246594535167, -0.29080292940911895, -0.01045558399010378, 0.12173526095371677, 0.14722097091452402, -0.09480757009870826, -0.14073199966850763, -0.07159041273148938, 0.07631190775686668, -0.09885382725067166, 0.024670337074093968, 0.08477422979070295, -0.12119818709961847, -0.15348142804179946, 0.38593327537035715, -0.006837881383641313, -0.2117187875545878, 0.12364993936931476, -0.16132204176491907, -0.13315679656906834, 0.11146383135754646, 0.04600052186088939, 0.15329797811901721, -0.0407414729328842, 0.20469247246744174, -0.1763935237326938, 0.02465125672125186, 0.10794444824170926, 0.0006273521317376031, 0.13404789389684224, 0.0892596555640921, 0.01965649085219862, 0.14733228761390346, 0.05590997143294344, 0.06004606999589218, -0.40458048332450736, -0.20802570551904476, -0.08091390355237417, 0.1592892202604403, -0.08192783838802646, -0.179402749097914, 0.36594744625155073, 0.07056958148401214, 0.19716388270911625, 0.15198876468801042, 0.1744098565581008, 0.04806140969426801, 0.08117137351978777, 0.02658076230317163, 0.05124030614524988, 0.3055223103724102, -0.06823039902165198, -0.10617897070399047, -0.05236505875717172, 0.24260658684035397] |
1,803.02943 | Multi-objective evolution for 3D RTS Micro | We attack the problem of controlling teams of autonomous units during
skirmishes in real-time strategy games. Earlier work had shown promise in
evolving control algorithm parameters that lead to high performance team
behaviors similar to those favored by good human players in real-time strategy
games like Starcraft. This algorithm specifically encoded parameterized kiting
and fleeing behaviors and the genetic algorithm evolved these parameter values.
In this paper we investigate using influence maps and potential fields alone to
compactly represent and control real-time team behavior for entities that can
maneuver in three dimensions. A two-objective fitness function that maximizes
damage done and minimizes damage taken guides our multi-objective evolutionary
algorithm. Preliminary results indicate that evolving friend and enemy unit
potential field parameters for distance, weapon characteristics, and entity
health suffice to produce complex, high performing, three-dimensional, team
tactics.
| cs.NE | we attack the problem of controlling teams of autonomous units during skirmishes in realtime strategy games earlier work had shown promise in evolving control algorithm parameters that lead to high performance team behaviors similar to those favored by good human players in realtime strategy games like starcraft this algorithm specifically encoded parameterized kiting and fleeing behaviors and the genetic algorithm evolved these parameter values in this paper we investigate using influence maps and potential fields alone to compactly represent and control realtime team behavior for entities that can maneuver in three dimensions a twoobjective fitness function that maximizes damage done and minimizes damage taken guides our multiobjective evolutionary algorithm preliminary results indicate that evolving friend and enemy unit potential field parameters for distance weapon characteristics and entity health suffice to produce complex high performing threedimensional team tactics | [['we', 'attack', 'the', 'problem', 'of', 'controlling', 'teams', 'of', 'autonomous', 'units', 'during', 'skirmishes', 'in', 'realtime', 'strategy', 'games', 'earlier', 'work', 'had', 'shown', 'promise', 'in', 'evolving', 'control', 'algorithm', 'parameters', 'that', 'lead', 'to', 'high', 'performance', 'team', 'behaviors', 'similar', 'to', 'those', 'favored', 'by', 'good', 'human', 'players', 'in', 'realtime', 'strategy', 'games', 'like', 'starcraft', 'this', 'algorithm', 'specifically', 'encoded', 'parameterized', 'kiting', 'and', 'fleeing', 'behaviors', 'and', 'the', 'genetic', 'algorithm', 'evolved', 'these', 'parameter', 'values', 'in', 'this', 'paper', 'we', 'investigate', 'using', 'influence', 'maps', 'and', 'potential', 'fields', 'alone', 'to', 'compactly', 'represent', 'and', 'control', 'realtime', 'team', 'behavior', 'for', 'entities', 'that', 'can', 'maneuver', 'in', 'three', 'dimensions', 'a', 'twoobjective', 'fitness', 'function', 'that', 'maximizes', 'damage', 'done', 'and', 'minimizes', 'damage', 'taken', 'guides', 'our', 'multiobjective', 'evolutionary', 'algorithm', 'preliminary', 'results', 'indicate', 'that', 'evolving', 'friend', 'and', 'enemy', 'unit', 'potential', 'field', 'parameters', 'for', 'distance', 'weapon', 'characteristics', 'and', 'entity', 'health', 'suffice', 'to', 'produce', 'complex', 'high', 'performing', 'threedimensional', 'team', 'tactics']] | [-0.1061915708697223, 0.05625457187210593, -0.10961469058255556, 0.07926130882868379, -0.11145796094034963, -0.2070830771665308, 0.09258992561594556, 0.44906856168938036, -0.21961460516938722, -0.3849624121999916, 0.0434408867628971, -0.2497891939642346, -0.2368264431202346, 0.1568528276470983, -0.13446703838074908, 0.09325516858980872, 0.11495961446095915, -0.0061716601040269084, 0.06592492153868079, -0.296796487604939, 0.2750714914496605, 0.06886747341794784, 0.2709832094637129, -0.01476306896245874, 0.11372677253572927, 0.03681469087228727, -0.017383912550833297, 0.07124043112922021, -0.11265699253250633, 0.07373861526481479, 0.31012867528582266, 0.21879607472253745, 0.34447954815593274, -0.4241836389855427, -0.19275690035475931, 0.14803430548293844, 0.12611994679729618, 0.076667050638421, -0.03972476020499016, -0.31282371033996564, 0.06005155855039929, -0.17112073046497672, -0.11486795158741776, -0.0907084019991624, 0.0010252965054378899, 0.041487969304024076, -0.2869454533279435, 0.004512827884515419, -0.0043919308860923215, 0.06817699549377293, -0.11944698976431563, -0.11144106139716528, 0.009730401454041438, 0.21941238635918126, 0.0016704227172714822, 0.056941300390890855, 0.20010955856346033, -0.14101794380900068, -0.17739945390306222, 0.34658275267985816, -0.016388731173184866, -0.15280118498348577, 0.1621289197997505, -0.06866129103924751, -0.15803680703838302, 0.10320086981707444, 0.23942591180093586, 0.10795869665418971, -0.15663422238739097, 0.004009445821472635, 0.03856371652663631, 0.18308739703463608, 0.05487550104803899, 0.006236278672825874, 0.16293033919646405, 0.18898785332738258, 0.09000086324179873, 0.09860861001995064, 0.0036054780571516056, -0.15093462049759077, -0.1701003441669266, -0.11996164067771614, -0.11932044095952091, -0.01652324529748191, -0.0885528667791625, -0.11292936223767089, 0.3825466294416829, 0.19675530485384277, 0.11855384590008351, 0.07731562787461478, 0.29153772900976677, 0.031916382507701846, 0.05665480471918058, 0.06966726573505987, 0.19641151821055888, -0.02336607641636339, 0.13973624049685895, -0.24246263794724227, 0.12708069301237734, 0.02206842654884574] |
1,803.02944 | Multiresolution Representations for Piecewise-Smooth Signals on Graphs | What is a mathematically rigorous way to describe the taxi-pickup
distribution in Manhattan, or the profile information in online social
networks? A deep understanding of representing those data not only provides
insights to the data properties, but also benefits to many subsequent
processing procedures, such as denoising, sampling, recovery and localization.
In this paper, we model those complex and irregular data as piecewise-smooth
graph signals and propose a graph dictionary to effectively represent those
graph signals. We first propose the graph multiresolution analysis, which
provides a principle to design good representations. We then propose a
coarse-to-fine approach, which iteratively partitions a graph into two
subgraphs until we reach individual nodes. This approach efficiently implements
the graph multiresolution analysis and the induced graph dictionary promotes
sparse representations piecewise-smooth graph signals. Finally, we validate the
proposed graph dictionary on two tasks: approximation and localization. The
empirical results show that the proposed graph dictionary outperforms eight
other representation methods on six datasets, including traffic networks,
social networks and point cloud meshes.
| eess.SP cs.SI | what is a mathematically rigorous way to describe the taxipickup distribution in manhattan or the profile information in online social networks a deep understanding of representing those data not only provides insights to the data properties but also benefits to many subsequent processing procedures such as denoising sampling recovery and localization in this paper we model those complex and irregular data as piecewisesmooth graph signals and propose a graph dictionary to effectively represent those graph signals we first propose the graph multiresolution analysis which provides a principle to design good representations we then propose a coarsetofine approach which iteratively partitions a graph into two subgraphs until we reach individual nodes this approach efficiently implements the graph multiresolution analysis and the induced graph dictionary promotes sparse representations piecewisesmooth graph signals finally we validate the proposed graph dictionary on two tasks approximation and localization the empirical results show that the proposed graph dictionary outperforms eight other representation methods on six datasets including traffic networks social networks and point cloud meshes | [['what', 'is', 'a', 'mathematically', 'rigorous', 'way', 'to', 'describe', 'the', 'taxipickup', 'distribution', 'in', 'manhattan', 'or', 'the', 'profile', 'information', 'in', 'online', 'social', 'networks', 'a', 'deep', 'understanding', 'of', 'representing', 'those', 'data', 'not', 'only', 'provides', 'insights', 'to', 'the', 'data', 'properties', 'but', 'also', 'benefits', 'to', 'many', 'subsequent', 'processing', 'procedures', 'such', 'as', 'denoising', 'sampling', 'recovery', 'and', 'localization', 'in', 'this', 'paper', 'we', 'model', 'those', 'complex', 'and', 'irregular', 'data', 'as', 'piecewisesmooth', 'graph', 'signals', 'and', 'propose', 'a', 'graph', 'dictionary', 'to', 'effectively', 'represent', 'those', 'graph', 'signals', 'we', 'first', 'propose', 'the', 'graph', 'multiresolution', 'analysis', 'which', 'provides', 'a', 'principle', 'to', 'design', 'good', 'representations', 'we', 'then', 'propose', 'a', 'coarsetofine', 'approach', 'which', 'iteratively', 'partitions', 'a', 'graph', 'into', 'two', 'subgraphs', 'until', 'we', 'reach', 'individual', 'nodes', 'this', 'approach', 'efficiently', 'implements', 'the', 'graph', 'multiresolution', 'analysis', 'and', 'the', 'induced', 'graph', 'dictionary', 'promotes', 'sparse', 'representations', 'piecewisesmooth', 'graph', 'signals', 'finally', 'we', 'validate', 'the', 'proposed', 'graph', 'dictionary', 'on', 'two', 'tasks', 'approximation', 'and', 'localization', 'the', 'empirical', 'results', 'show', 'that', 'the', 'proposed', 'graph', 'dictionary', 'outperforms', 'eight', 'other', 'representation', 'methods', 'on', 'six', 'datasets', 'including', 'traffic', 'networks', 'social', 'networks', 'and', 'point', 'cloud', 'meshes']] | [-0.0901782978402763, -0.0213181778598956, -0.12984326361639503, 0.07445977071319668, -0.14794571557595299, -0.14020483329624472, 0.054150982802415905, 0.4633270507444165, -0.31532019889818697, -0.3224647649825958, 0.10327299498927829, -0.2895865794856793, -0.27310596172095547, 0.11558028668845574, -0.0962023004167295, 0.07233885127749896, 0.16220866160433806, 0.05601140954336542, -0.032512138397600164, -0.2334976485650847, 0.2883520509216734, 0.009768286288937576, 0.3412118335435736, 0.00015594365220226926, 0.10000196342080453, 0.016841923706456572, -0.0694279099659838, 0.02288399788155081, -0.08620561048839678, 0.16828573700375185, 0.3347593424061012, 0.24257004392907738, 0.28729906165414676, -0.4563926567552154, -0.2485020816030572, 0.14819595271799557, 0.15091670849946087, 0.12481951189283519, -0.029122235709355175, -0.33344135923634566, 0.08130469468971548, -0.1321927420739196, 0.014211256963251059, -0.14319873030693409, -0.04145083779435672, -0.01854202492597574, -0.31158274373396516, 0.004273938412274775, 0.07499965856794245, 0.02978370035859104, -0.010990480985771307, -0.10337761167888558, 0.02946335241800832, 0.13112563254802437, -0.027283175962051365, 0.03229779293300573, 0.13929975086064664, -0.11706741421182311, -0.15690993792293761, 0.3699973600799452, -0.01787590486740604, -0.19656529973963732, 0.19090130722741344, -0.04612106354879271, -0.19628438772354834, 0.09689626782786792, 0.23996184406868978, 0.07033355666804099, -0.19451935404164347, 0.006526672935899637, -0.06085317840097015, 0.1407805656741337, 0.04787359184524167, 0.01354837344372422, 0.13351578303350659, 0.2339352429537716, 0.10531474465279823, 0.14385346755905434, -0.08599749510873578, -0.04648481069054611, -0.20445037345174688, -0.06367654774427235, -0.2345605461445531, -0.05264028169562926, -0.20045974431786, -0.17978855288548473, 0.4635986124394004, 0.18977529472465107, 0.21605561438579848, 0.11574161777267243, 0.34102011796485765, 0.01830200768287801, 0.06532108064874739, 0.13460132178242604, 0.11165020498586539, 0.0845531966693387, 0.0985305833737094, -0.11377733226720534, 0.04234204351383367, 0.1253622837760625] |
1,803.02945 | Comparison of Noisy Channels and Reverse Data-Processing Theorems | This paper considers the comparison of noisy channels from the viewpoint of
statistical decision theory. Various orderings are discussed, all formalizing
the idea that one channel is "better" than another for information
transmission. The main result is an equivalence relation that is proved for
classical channels, quantum channels with classical encoding, and quantum
channels with quantum encoding.
| cs.IT math.IT math.ST quant-ph stat.TH | this paper considers the comparison of noisy channels from the viewpoint of statistical decision theory various orderings are discussed all formalizing the idea that one channel is better than another for information transmission the main result is an equivalence relation that is proved for classical channels quantum channels with classical encoding and quantum channels with quantum encoding | [['this', 'paper', 'considers', 'the', 'comparison', 'of', 'noisy', 'channels', 'from', 'the', 'viewpoint', 'of', 'statistical', 'decision', 'theory', 'various', 'orderings', 'are', 'discussed', 'all', 'formalizing', 'the', 'idea', 'that', 'one', 'channel', 'is', 'better', 'than', 'another', 'for', 'information', 'transmission', 'the', 'main', 'result', 'is', 'an', 'equivalence', 'relation', 'that', 'is', 'proved', 'for', 'classical', 'channels', 'quantum', 'channels', 'with', 'classical', 'encoding', 'and', 'quantum', 'channels', 'with', 'quantum', 'encoding']] | [-0.1550604419521334, 0.12753738373290266, -0.0779486373475377, 0.10139152341881734, -0.043205607911212404, -0.24972194031273065, 0.03447506930924168, 0.33195527528592367, -0.3248421994871215, -0.24369284151154652, 0.08484787230477914, -0.2776306143945508, -0.17835893612681775, 0.20237531160053454, -0.11104043605819083, 0.07637119856908132, 0.08151884912921671, 0.0611031443991682, -0.0586153715277058, -0.25164909360587207, 0.35430614579174863, 0.05920165481674893, 0.32010978251172784, -0.005826340922922419, 0.0725258366580595, 0.08350495605733604, -0.06684202504785437, -0.04084883442377312, -0.11985788359679486, 0.1256970183008857, 0.30141463818584097, 0.17513208439279543, 0.21877702112358652, -0.3739932627139384, -0.27225363677727027, 0.05066668980738573, 0.10249927762095212, 0.1721833630612022, -0.02453639974262108, -0.2877148031012008, 0.1285607000637244, -0.14838112402184492, -0.004969430744255844, 0.0014307300494820403, -0.016309542091269242, -0.06290123540001284, -0.26166316102209847, 0.051512498113432933, 0.12703726030559392, 0.052250168727416745, -0.010830133556992862, -0.12061630023578018, 0.07904215482790676, 0.1656875716228234, 0.0026691496339544913, 0.01080307262957815, 0.08897088981119164, -0.1139559318156292, -0.22104744126268647, 0.35519286872524963, 0.024066709233968715, -0.19404758248282106, 0.2084309079433105, -0.06913622579815094, -0.09218124504478876, 0.07533678686115564, 0.08320697442742817, 0.06796236754509441, -0.20794211230812626, 0.05048521845744465, -0.055067707898846845, 0.16864931990041218, 0.06311299968020696, 0.15850367941158383, 0.14578506240229072, 0.12921723787950581, 0.07165354006645973, 0.1750571208172723, -0.04283607336120647, -0.23425646691599436, -0.32288069238788203, -0.1931872802476088, -0.15966057326652827, 0.03474148733770115, -0.07595335915169, -0.08454945556035168, 0.33206241724914626, 0.15336279620686055, 0.14689567723523891, 0.09438218192703891, 0.34758058232827144, 0.13157525534022665, 0.003754629377733197, 0.06076827261743969, 0.19750518609949372, 0.24728477176017405, 0.031359972489442216, -0.1617699436181666, 0.08742744194572433, 0.0395442780654616] |
1,803.02946 | Assessing a GTA professional development program | For the last four years, the School of Physics at Georgia Tech have been
preparing new Graduate Teaching Assistants (GTAs) through a program that
integrates pedagogy, physics content, and professional development strategies.
Here we discuss various assessments we have used to evaluate the program, among
them surveys, GTA self-reporting, and end-of-semester student evaluations. Our
results indicate that GTAs who participate in the program find its practical
activities useful, feel better prepared for teaching, make use of
learner-centered teaching strategies, and receive higher scores in teaching
evaluations.
| physics.ed-ph | for the last four years the school of physics at georgia tech have been preparing new graduate teaching assistants gtas through a program that integrates pedagogy physics content and professional development strategies here we discuss various assessments we have used to evaluate the program among them surveys gta selfreporting and endofsemester student evaluations our results indicate that gtas who participate in the program find its practical activities useful feel better prepared for teaching make use of learnercentered teaching strategies and receive higher scores in teaching evaluations | [['for', 'the', 'last', 'four', 'years', 'the', 'school', 'of', 'physics', 'at', 'georgia', 'tech', 'have', 'been', 'preparing', 'new', 'graduate', 'teaching', 'assistants', 'gtas', 'through', 'a', 'program', 'that', 'integrates', 'pedagogy', 'physics', 'content', 'and', 'professional', 'development', 'strategies', 'here', 'we', 'discuss', 'various', 'assessments', 'we', 'have', 'used', 'to', 'evaluate', 'the', 'program', 'among', 'them', 'surveys', 'gta', 'selfreporting', 'and', 'endofsemester', 'student', 'evaluations', 'our', 'results', 'indicate', 'that', 'gtas', 'who', 'participate', 'in', 'the', 'program', 'find', 'its', 'practical', 'activities', 'useful', 'feel', 'better', 'prepared', 'for', 'teaching', 'make', 'use', 'of', 'learnercentered', 'teaching', 'strategies', 'and', 'receive', 'higher', 'scores', 'in', 'teaching', 'evaluations']] | [0.023498878313009352, 0.08352005757487324, -0.15262833095758277, 0.0912554857923704, -0.16498425300506986, -0.21773685225669076, 0.07303881861050339, 0.41408366446985917, -0.14335204006775337, -0.3999820112086394, 0.08300857775954201, -0.3058974142350695, -0.16053866671453065, 0.22640241295756663, -0.0932983307989643, -0.005787508866941447, 0.10653949804494486, -0.024712894240270972, -0.04335124796694693, -0.39630435019293253, 0.25019175825184314, 0.11014424159246332, 0.31198292772066505, 0.05046439414624782, 0.08956750228124506, 0.03855939207269865, -0.08497665775939822, -0.049545571223408094, -0.11028234812461853, 0.12991970183656495, 0.452403613267576, 0.2881118100547396, 0.4649982324856169, -0.43806045876596783, -0.10717966299065772, -0.012656068796401515, 0.06179369094452875, 0.0802993142100818, -0.10758607818142456, -0.3083953969180584, 0.007885961326332215, -0.225038095859482, -0.07714091736741145, -0.13062482572790673, -0.025088167743866935, -0.0031784712323261535, -0.1737080739263226, -0.07863074458916397, -0.028085413395071073, 0.21668153894955622, -0.002182791060220231, -0.2577380912049728, 0.030851012560100678, 0.25275649770217784, 0.05764859557590064, 0.021170249975779477, 0.16742926638792544, -0.20157132723620366, -0.23204291530830018, 0.35906671743620844, 0.014221204433809309, -0.11453574582496111, 0.22777031521477242, -0.1153469143955804, -0.17780471275396206, 0.028562582771786874, 0.28118627566625093, 0.10903994102469262, -0.16260645287796197, 0.012324688745909097, 0.03051153740243, 0.16212316544671707, 0.0428033152485595, -0.021993384362362763, 0.22928385385996936, 0.16931567480239798, -0.03187347980325713, 0.06492017140776357, 0.015430648862863617, -0.051717255812357456, -0.2325507897445384, -0.22543923267546823, -0.10688706779688159, -0.03504888885380591, 0.03551001650168259, -0.030693083446856367, 0.3564770342563005, 0.23770251442842624, -0.010943872634978855, 0.045280603401582034, 0.2375493628794656, 0.005671297250699032, 0.07883209450827802, 0.09363362976514242, 0.22396774788743215, -0.00027299088371150634, 0.24067995845723678, -0.13312078884747974, 0.0971462457714712, -0.008900047296329457] |
1,803.02947 | Possible structural origin of superconductivity in Sr-doped Bi2Se3 | Doping bismuth selenide (Bi2Se3) with elements such as copper and strontium
(Sr) can induce superconductivity, making the doped materials interesting
candidates to explore potential topological superconducting behaviors. It was
thought that the superconductivity of doped Bi2Se3 was induced by dopant atoms
intercalated in van der Waals gaps. However, several experiments have shown
that the intercalation of dopant atoms may not necessarily make doped Bi2Se3
superconducting. Thus, the structural origin of superconductivity in doped
Bi2Se3 remains an open question. Herein, we combined material synthesis and
characterization, high-resolution transmission electron microscopy, and
first-principles calculations to study the doping structure of Sr-doped Bi2Se3.
We found that the emergence of superconductivity is strongly related with
n-type dopant atoms. Atomic-level energy-dispersive X-ray mapping revealed
various n-type Sr dopants that occupy intercalated and interstitial positions.
First-principles calculations showed that the formation energy of a specific
interstitial Sr doping position depends strongly on Sr doping level. This site
changes from a metastable position at low Sr doping level to a stable position
at high Sr doping level. The calculation results explain why quenching is
necessary to obtain superconducting samples when the Sr doping level is low and
also why slow furnace cooling can yield superconducting samples when the Sr
doping level is high. Our findings suggest that Sr atoms doped at interstitial
locations, instead of those intercalated in van der Waals gaps, are most likely
to be responsible for the emergence of superconductivity in Sr-doped Bi2Se3.
| cond-mat.supr-con | doping bismuth selenide bi2se3 with elements such as copper and strontium sr can induce superconductivity making the doped materials interesting candidates to explore potential topological superconducting behaviors it was thought that the superconductivity of doped bi2se3 was induced by dopant atoms intercalated in van der waals gaps however several experiments have shown that the intercalation of dopant atoms may not necessarily make doped bi2se3 superconducting thus the structural origin of superconductivity in doped bi2se3 remains an open question herein we combined material synthesis and characterization highresolution transmission electron microscopy and firstprinciples calculations to study the doping structure of srdoped bi2se3 we found that the emergence of superconductivity is strongly related with ntype dopant atoms atomiclevel energydispersive xray mapping revealed various ntype sr dopants that occupy intercalated and interstitial positions firstprinciples calculations showed that the formation energy of a specific interstitial sr doping position depends strongly on sr doping level this site changes from a metastable position at low sr doping level to a stable position at high sr doping level the calculation results explain why quenching is necessary to obtain superconducting samples when the sr doping level is low and also why slow furnace cooling can yield superconducting samples when the sr doping level is high our findings suggest that sr atoms doped at interstitial locations instead of those intercalated in van der waals gaps are most likely to be responsible for the emergence of superconductivity in srdoped bi2se3 | [['doping', 'bismuth', 'selenide', 'bi2se3', 'with', 'elements', 'such', 'as', 'copper', 'and', 'strontium', 'sr', 'can', 'induce', 'superconductivity', 'making', 'the', 'doped', 'materials', 'interesting', 'candidates', 'to', 'explore', 'potential', 'topological', 'superconducting', 'behaviors', 'it', 'was', 'thought', 'that', 'the', 'superconductivity', 'of', 'doped', 'bi2se3', 'was', 'induced', 'by', 'dopant', 'atoms', 'intercalated', 'in', 'van', 'der', 'waals', 'gaps', 'however', 'several', 'experiments', 'have', 'shown', 'that', 'the', 'intercalation', 'of', 'dopant', 'atoms', 'may', 'not', 'necessarily', 'make', 'doped', 'bi2se3', 'superconducting', 'thus', 'the', 'structural', 'origin', 'of', 'superconductivity', 'in', 'doped', 'bi2se3', 'remains', 'an', 'open', 'question', 'herein', 'we', 'combined', 'material', 'synthesis', 'and', 'characterization', 'highresolution', 'transmission', 'electron', 'microscopy', 'and', 'firstprinciples', 'calculations', 'to', 'study', 'the', 'doping', 'structure', 'of', 'srdoped', 'bi2se3', 'we', 'found', 'that', 'the', 'emergence', 'of', 'superconductivity', 'is', 'strongly', 'related', 'with', 'ntype', 'dopant', 'atoms', 'atomiclevel', 'energydispersive', 'xray', 'mapping', 'revealed', 'various', 'ntype', 'sr', 'dopants', 'that', 'occupy', 'intercalated', 'and', 'interstitial', 'positions', 'firstprinciples', 'calculations', 'showed', 'that', 'the', 'formation', 'energy', 'of', 'a', 'specific', 'interstitial', 'sr', 'doping', 'position', 'depends', 'strongly', 'on', 'sr', 'doping', 'level', 'this', 'site', 'changes', 'from', 'a', 'metastable', 'position', 'at', 'low', 'sr', 'doping', 'level', 'to', 'a', 'stable', 'position', 'at', 'high', 'sr', 'doping', 'level', 'the', 'calculation', 'results', 'explain', 'why', 'quenching', 'is', 'necessary', 'to', 'obtain', 'superconducting', 'samples', 'when', 'the', 'sr', 'doping', 'level', 'is', 'low', 'and', 'also', 'why', 'slow', 'furnace', 'cooling', 'can', 'yield', 'superconducting', 'samples', 'when', 'the', 'sr', 'doping', 'level', 'is', 'high', 'our', 'findings', 'suggest', 'that', 'sr', 'atoms', 'doped', 'at', 'interstitial', 'locations', 'instead', 'of', 'those', 'intercalated', 'in', 'van', 'der', 'waals', 'gaps', 'are', 'most', 'likely', 'to', 'be', 'responsible', 'for', 'the', 'emergence', 'of', 'superconductivity', 'in', 'srdoped', 'bi2se3']] | [-0.10629090785573014, 0.22857288943042747, 0.027128051209485617, 0.02368595472499962, 0.011690068456381325, -0.24294000898515142, 0.17523058929756308, 0.43016854371236457, -0.23517847902708489, -0.2822358997715988, -0.11083829890601493, -0.4209218601185719, -0.13504070200407917, 0.13994412732634023, -0.017422553333044676, -0.03028047871707732, -0.03243768276553211, -0.12411621830593716, -0.16909391092297, -0.2938989733324375, 0.2597024346503067, 0.12346427764480049, 0.3648603468525485, 0.11126427863876504, -0.01922721252289589, -0.05021225198787719, 0.21013790722273945, 0.04180148131093283, -0.1625059647631133, 0.05979753501017828, 0.37248318204188635, -0.12721578070356132, 0.2124696775450601, -0.48173746854752675, -0.2432512655643801, -0.0773923188748976, 0.1374484495012378, 0.17497906483374692, -0.16161747129826912, -0.24825898414890762, 0.07442531219043547, -0.07853568846527409, -0.09205372944263795, -0.10199943294935708, -0.031115021251695362, -0.0012976106065793048, -0.20384707899348203, 0.04657699590513315, 0.0540622824366559, 0.10812411563090783, -0.17648838960690322, -0.1457652637703835, -0.1184220908197017, -0.008815735550042024, 0.015649713704432654, 0.035929812915417636, 0.25393416102981453, -0.04487654176797858, -0.058048365444771044, 0.3634071866494592, -6.520809950579784e-05, -0.0014264847942974776, 0.1837652981550156, -0.20282841972211788, -0.10997352569469224, 0.1786961634565441, 0.032914677571269556, 0.07300228211993672, -0.12496791722603186, 0.07912027351382855, 0.005478372512663867, 0.2673793963237498, 0.128477967112368, 0.13291672530250864, 0.25242157758770817, 0.240904845466358, 0.03595516377491058, 0.032753120757596545, -0.14354596408103518, 0.06873662566676518, -0.1298734264109268, -0.24315907535382847, -0.22015857296921781, 0.09962543578249515, -0.049139351519416515, -0.22510827219765925, 0.34010088475124917, 0.14786798010097288, 0.147950405687499, -0.18017062945408302, 0.1702509414843989, 0.06734647084160018, 0.052528639645978155, -0.03795273075558277, 0.24174706318520914, 0.15099685027840778, 0.08402649364453667, -0.3183631877674016, 0.15774396735060353, 0.017828863951432124] |
1,803.02948 | On localizing and concentrating electromagnetic fields | We consider field localizing and concentration of electromagnetic waves
governed by the time-harmonic anisotropic Maxwell system in a bounded domain.
It is shown that there always exist certain boundary inputs which can generate
electromagnetic fields with energy localized/concentrated in a given subdomain
while nearly vanishing in another given subdomain. The theoretical results may
have potential applications in telecommunication, inductive charging and
medical therapy. We also derive a related Runge approximation result for the
time-harmonic anisotropic Maxwell system with partial boundary data.
| math.AP | we consider field localizing and concentration of electromagnetic waves governed by the timeharmonic anisotropic maxwell system in a bounded domain it is shown that there always exist certain boundary inputs which can generate electromagnetic fields with energy localizedconcentrated in a given subdomain while nearly vanishing in another given subdomain the theoretical results may have potential applications in telecommunication inductive charging and medical therapy we also derive a related runge approximation result for the timeharmonic anisotropic maxwell system with partial boundary data | [['we', 'consider', 'field', 'localizing', 'and', 'concentration', 'of', 'electromagnetic', 'waves', 'governed', 'by', 'the', 'timeharmonic', 'anisotropic', 'maxwell', 'system', 'in', 'a', 'bounded', 'domain', 'it', 'is', 'shown', 'that', 'there', 'always', 'exist', 'certain', 'boundary', 'inputs', 'which', 'can', 'generate', 'electromagnetic', 'fields', 'with', 'energy', 'localizedconcentrated', 'in', 'a', 'given', 'subdomain', 'while', 'nearly', 'vanishing', 'in', 'another', 'given', 'subdomain', 'the', 'theoretical', 'results', 'may', 'have', 'potential', 'applications', 'in', 'telecommunication', 'inductive', 'charging', 'and', 'medical', 'therapy', 'we', 'also', 'derive', 'a', 'related', 'runge', 'approximation', 'result', 'for', 'the', 'timeharmonic', 'anisotropic', 'maxwell', 'system', 'with', 'partial', 'boundary', 'data']] | [-0.1835997642701841, 0.1345796716690529, -0.014178945712046698, 0.0008104512075078673, -0.12342392324935644, -0.1512640102824662, -0.05001415098086, 0.36449687290005384, -0.26359941211703697, -0.2649861484766006, 0.11403419527341611, -0.2576782256830484, -0.14835210522869602, 0.2069922618655255, -0.041513017134275285, 0.0848678312584525, 0.06025738848838955, 0.03773175287642516, -0.00671293364430312, -0.17904652331781107, 0.3569758127676323, -0.030854000104591252, 0.29700781055107656, 0.09409953053254867, 0.11353256869042525, 0.02569341879861895, 0.005976053042104468, 0.06543234316632152, -0.10150699034902573, 0.08091830357443541, 0.32576686252141374, 0.05694565510493703, 0.272519033314893, -0.46708760524634274, -0.25207267187070104, 0.101106410221837, 0.11229289628099651, 0.11783502794714877, -0.11059965011081659, -0.28604928574641236, 0.05384380533650983, -0.09726480508688837, -0.16963373417383992, -0.053640311351045966, 0.00877035675366642, 0.055339464258577206, -0.31800806284300054, 0.06800009662074444, 0.07083715996850515, 0.03687699806469027, -0.18077573063783348, -0.07981679333315697, 0.0042086100904271005, 0.0669427027576603, 0.06285800606856355, 0.06627488475642167, 0.0871673084970098, -0.15926794649785733, -0.05625534861464985, 0.37176628946326673, -0.06153206948074512, -0.2853201741760131, 0.17856455387081951, -0.1393092060025083, -0.039117605332285164, 0.1552513701026328, 0.1641352879203623, 0.1225481357658282, -0.17197680817916988, 0.1335315272779553, -0.03909110851527657, 0.13344654861139132, 0.14819504662882538, -0.005055282829562202, 0.16682662442326546, 0.11350461658439599, 0.10680635241151322, 0.1489777123177191, -0.00906945057795383, -0.058100514876423405, -0.3403851191746071, -0.12186087511945516, -0.19816401962889357, 0.07446053376188502, -0.08784089386572305, -0.2304508433338924, 0.34157569400267673, 0.1572317331811064, 0.09247474850853905, 0.003336504650360439, 0.263944471324794, 0.1858594001038, 0.05633255835273303, 0.12367693976848386, 0.23555259332060813, 0.12696881803276483, 0.16354734368796925, -0.19641870568666492, -0.017174753319704906, 0.06690276128410914] |
1,803.02949 | Nearly orthogonal vectors and small antipodal spherical codes | How can $d+k$ vectors in $\mathbb{R}^d$ be arranged so that they are as close
to orthogonal as possible? In particular, define
$\theta(d,k):=\min_X\max_{x\neq y\in X}|\langle x,y\rangle|$ where the minimum
is taken over all collections of $d+k$ unit vectors $X\subseteq\mathbb{R}^d$.
In this paper, we focus on the case where $k$ is fixed and $d\to\infty$. In
establishing bounds on $\theta(d,k)$, we find an intimate connection to the
existence of systems of ${k+1\choose 2}$ equiangular lines in $\mathbb{R}^k$.
Using this connection, we are able to pin down $\theta(d,k)$ whenever
$k\in\{1,2,3,7,23\}$ and establish asymptotics for general $k$. The main tool
is an upper bound on $\mathbb{E}_{x,y\sim\mu}|\langle x,y\rangle|$ whenever
$\mu$ is an isotropic probability mass on $\mathbb{R}^k$, which may be of
independent interest. Our results translate naturally to the analogous question
in $\mathbb{C}^d$. In this case, the question relates to the existence of
systems of $k^2$ equiangular lines in $\mathbb{C}^k$, also known as SIC-POVM in
physics literature.
| math.CO cs.IT math.IT math.MG | how can dk vectors in mathbbrd be arranged so that they are as close to orthogonal as possible in particular define thetadkmin_xmax_xneq yin xlangle xyrangle where the minimum is taken over all collections of dk unit vectors xsubseteqmathbbrd in this paper we focus on the case where k is fixed and dtoinfty in establishing bounds on thetadk we find an intimate connection to the existence of systems of k1choose 2 equiangular lines in mathbbrk using this connection we are able to pin down thetadk whenever kin123723 and establish asymptotics for general k the main tool is an upper bound on mathbbe_xysimmulangle xyrangle whenever mu is an isotropic probability mass on mathbbrk which may be of independent interest our results translate naturally to the analogous question in mathbbcd in this case the question relates to the existence of systems of k2 equiangular lines in mathbbck also known as sicpovm in physics literature | [['how', 'can', 'dk', 'vectors', 'in', 'mathbbrd', 'be', 'arranged', 'so', 'that', 'they', 'are', 'as', 'close', 'to', 'orthogonal', 'as', 'possible', 'in', 'particular', 'define', 'thetadkmin_xmax_xneq', 'yin', 'xlangle', 'xyrangle', 'where', 'the', 'minimum', 'is', 'taken', 'over', 'all', 'collections', 'of', 'dk', 'unit', 'vectors', 'xsubseteqmathbbrd', 'in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'case', 'where', 'k', 'is', 'fixed', 'and', 'dtoinfty', 'in', 'establishing', 'bounds', 'on', 'thetadk', 'we', 'find', 'an', 'intimate', 'connection', 'to', 'the', 'existence', 'of', 'systems', 'of', 'k1choose', '2', 'equiangular', 'lines', 'in', 'mathbbrk', 'using', 'this', 'connection', 'we', 'are', 'able', 'to', 'pin', 'down', 'thetadk', 'whenever', 'kin123723', 'and', 'establish', 'asymptotics', 'for', 'general', 'k', 'the', 'main', 'tool', 'is', 'an', 'upper', 'bound', 'on', 'mathbbe_xysimmulangle', 'xyrangle', 'whenever', 'mu', 'is', 'an', 'isotropic', 'probability', 'mass', 'on', 'mathbbrk', 'which', 'may', 'be', 'of', 'independent', 'interest', 'our', 'results', 'translate', 'naturally', 'to', 'the', 'analogous', 'question', 'in', 'mathbbcd', 'in', 'this', 'case', 'the', 'question', 'relates', 'to', 'the', 'existence', 'of', 'systems', 'of', 'k2', 'equiangular', 'lines', 'in', 'mathbbck', 'also', 'known', 'as', 'sicpovm', 'in', 'physics', 'literature']] | [-0.13453528211296847, 0.11955470212413072, -0.024171705087711517, 0.0576637657043951, -0.04589483954704418, -0.12672408746584551, 0.05228823309274352, 0.3581620228877809, -0.25638714080883396, -0.23874807719969088, 0.09951218322304259, -0.28964865073471124, -0.15894662476946703, 0.1957995927077718, -0.09736603232320501, 0.01342776649269379, -0.010824328079858484, 0.10156144655290215, -0.04411225110420168, -0.2718450569276077, 0.3366120923407531, -0.009819317065800229, 0.21173794456343684, 0.05873770475672144, 0.03480778094510444, 0.0020575338049740014, 0.018533398791785456, -0.019482814486966364, -0.18623137778543727, 0.10694106275655536, 0.2906097353148248, 0.14577301598622702, 0.21668963240194394, -0.3550813155468657, -0.13339640118647367, 0.1792171313047422, 0.20251593133434653, 0.03212005377523989, 0.008604193213007724, -0.2375858319865074, 0.11142687806083511, -0.06321668815993083, -0.13296162945011425, -0.04533181744368954, 0.09460453538081816, 0.01512486876163166, -0.3009989411414911, 0.01157203510855551, 0.1252017436248328, 0.031400541310682054, -0.05708701487714683, -0.13801781038879804, 0.01795297751959879, 0.12506311330717937, 0.022794189028597128, 0.0986315443749643, 0.02740693066152744, -0.051818656465103335, -0.09249477784912112, 0.3854801078559831, -0.07601422480284883, -0.23451948581108203, 0.17215338790265378, -0.1688226638264799, -0.18349924121220182, 0.07862463095484094, 0.19699054469432062, 0.11322059703848532, -0.10427501669619232, 0.13937783347905175, -0.15948055885059553, 0.12571239360113395, 0.10518542530351421, 0.05733298907135678, 0.1867873449292448, 0.09899685333220987, 0.11848013425737412, 0.1491936972766881, -0.0410205372140303, -0.06627661416011203, -0.33914510543561643, -0.16514056127642915, -0.1950826295336204, 0.09639415081275932, -0.08524179985053909, -0.12187275438514512, 0.2921627386790028, 0.1379556594515129, 0.26621170264358324, 0.05312310025409614, 0.21391330513061904, 0.09980498238938809, 0.011611368080290655, 0.09794918505132147, 0.2010563112271484, 0.17086354304208523, 0.019962556074056517, -0.13384857424211483, 0.016351317296438437, 0.07681381503223544] |
1,803.0295 | M-ary Orthogonal Chirp Modulation for Coherent and Non-coherent
Underwater Acoustic Communications | We propose an orthogonal chirp waveform design for underwater acoustic (UW-A)
communications and analyze the cross-correlation characteristics of orthogonal
chirp waveforms in coherent and non-coherent detections. We consider
information symbols are carried over proposed M-ary orthogonal chirp waveforms
for UW-A transmissions. Moreover, we develop a coherent and an optimal
non-coherent receivers based on proposed chirp waveforms. Explicit derivations
include closed-form expressions for cross-correlation coefficients, and
theoretical bit-error-rate (BER) of coherent and non-coherent receivers.
Performance of M-ary orthogonal chirp waveforms is evaluated in water tank
experiments. Therefore, we have demonstrated the effectiveness of proposed
M-ary orthogonal chirp modulation in UW-A multipath fading channel.
| eess.SP | we propose an orthogonal chirp waveform design for underwater acoustic uwa communications and analyze the crosscorrelation characteristics of orthogonal chirp waveforms in coherent and noncoherent detections we consider information symbols are carried over proposed mary orthogonal chirp waveforms for uwa transmissions moreover we develop a coherent and an optimal noncoherent receivers based on proposed chirp waveforms explicit derivations include closedform expressions for crosscorrelation coefficients and theoretical biterrorrate ber of coherent and noncoherent receivers performance of mary orthogonal chirp waveforms is evaluated in water tank experiments therefore we have demonstrated the effectiveness of proposed mary orthogonal chirp modulation in uwa multipath fading channel | [['we', 'propose', 'an', 'orthogonal', 'chirp', 'waveform', 'design', 'for', 'underwater', 'acoustic', 'uwa', 'communications', 'and', 'analyze', 'the', 'crosscorrelation', 'characteristics', 'of', 'orthogonal', 'chirp', 'waveforms', 'in', 'coherent', 'and', 'noncoherent', 'detections', 'we', 'consider', 'information', 'symbols', 'are', 'carried', 'over', 'proposed', 'mary', 'orthogonal', 'chirp', 'waveforms', 'for', 'uwa', 'transmissions', 'moreover', 'we', 'develop', 'a', 'coherent', 'and', 'an', 'optimal', 'noncoherent', 'receivers', 'based', 'on', 'proposed', 'chirp', 'waveforms', 'explicit', 'derivations', 'include', 'closedform', 'expressions', 'for', 'crosscorrelation', 'coefficients', 'and', 'theoretical', 'biterrorrate', 'ber', 'of', 'coherent', 'and', 'noncoherent', 'receivers', 'performance', 'of', 'mary', 'orthogonal', 'chirp', 'waveforms', 'is', 'evaluated', 'in', 'water', 'tank', 'experiments', 'therefore', 'we', 'have', 'demonstrated', 'the', 'effectiveness', 'of', 'proposed', 'mary', 'orthogonal', 'chirp', 'modulation', 'in', 'uwa', 'multipath', 'fading', 'channel']] | [-0.3449280240627773, 0.06823271362130374, -0.0169066290654169, 0.03275445153521301, -0.10116479168280813, -0.1910890129020474, 0.07198710657437057, 0.4832409862794128, -0.14336207077162816, -0.1385220995391993, 0.07614957057418958, -0.22055602664876656, -0.27121526411022334, 0.2802102932450818, -0.1157604327251879, 0.13327211641030862, 0.09963217199615695, -0.019234275340340008, -0.10721069939580619, -0.22858275159252991, 0.23700146494871555, 0.14659651948650385, 0.38883513994697555, -0.10977088551347454, 0.18929073542091704, 0.09400986186593917, -0.12251340784589011, -0.21746278933920515, -0.12139161418685142, -0.005767472124859399, 0.4258388059907684, 0.19711441482307718, 0.13704532423221014, -0.3690080508114953, -0.28976763666187433, 0.06078629452260394, 0.19632324275609755, 0.13220980312325992, -0.10546091728154387, -0.3513926029132277, 0.11283442108006235, -0.3011015111982238, 0.06244098949337415, 0.006720937532829303, -0.03709178649382118, 0.12514855874264064, -0.35617919054393676, 0.03841905821543917, 0.014790607329547022, 0.018725650330238482, -0.06308561762082665, -0.15124730295592956, 0.11637008943202376, 0.12188661766841132, -0.03370810008046272, -0.09025152437229111, 0.028098953696077362, 0.0180565205621807, -0.16898379370789318, 0.3304751526801756, -0.0812472167639427, -0.29058924826848154, 0.03580737495897612, -0.11433162055361797, 0.04634942125766447, 0.2158808344975114, 0.3134324842808293, 0.04244748534013828, -0.13120893178069415, -0.023996922582976848, 0.06222108698577857, 0.22619616215610328, 0.2504591287442428, 0.1490607131592126, 0.18783471890606498, 0.10790653923051614, 0.08877387003945734, 0.15021377598282462, -0.2092098096664082, -0.011014587556322416, -0.18403334750830397, -0.02487558621785366, -0.21383428699610865, -0.052620890914398595, -0.09538098800783022, -0.0755657621056718, 0.4267009919253634, 0.13332454267177074, 0.02269059573482795, 0.14448403638294516, 0.4654097998989563, 0.13817083487725434, -0.05717824545561099, 0.07883146338566553, 0.23233783547309975, 0.17579823783507534, 0.06377470927819719, -0.24272958744390338, -0.00886301111941244, -0.005400315812770643] |
1,803.02951 | A single-source molten salt synthesis of uniform octahedral Na2Ti3O7
particels composed of nanorods | Na2Ti3O7, as one of the most potential anode electrode materials, is expected
to play an important role in various fields. In this work, we synthesized
uniform hollow octahedral Na2Ti3O7 particles through directly sintering a kind
of precursors obtained by (NH4)2TiF6 and NH4OH in the presence of
sodium-containing cationic polyacrylamide. XRD, SEM, TEM were used to
characterize precursors and Na2Ti3O7 particles. In addition, the synthesis
conditions and the formation mechanism were discussed in detail. This
single-source molten salt method is flexible, efficient and controllable.
Moreover, the strategy of this method makes it possible for us to synthesize
other sodium titanate materials.
| cond-mat.mtrl-sci cond-mat.mes-hall | na2ti3o7 as one of the most potential anode electrode materials is expected to play an important role in various fields in this work we synthesized uniform hollow octahedral na2ti3o7 particles through directly sintering a kind of precursors obtained by nh42tif6 and nh4oh in the presence of sodiumcontaining cationic polyacrylamide xrd sem tem were used to characterize precursors and na2ti3o7 particles in addition the synthesis conditions and the formation mechanism were discussed in detail this singlesource molten salt method is flexible efficient and controllable moreover the strategy of this method makes it possible for us to synthesize other sodium titanate materials | [['na2ti3o7', 'as', 'one', 'of', 'the', 'most', 'potential', 'anode', 'electrode', 'materials', 'is', 'expected', 'to', 'play', 'an', 'important', 'role', 'in', 'various', 'fields', 'in', 'this', 'work', 'we', 'synthesized', 'uniform', 'hollow', 'octahedral', 'na2ti3o7', 'particles', 'through', 'directly', 'sintering', 'a', 'kind', 'of', 'precursors', 'obtained', 'by', 'nh42tif6', 'and', 'nh4oh', 'in', 'the', 'presence', 'of', 'sodiumcontaining', 'cationic', 'polyacrylamide', 'xrd', 'sem', 'tem', 'were', 'used', 'to', 'characterize', 'precursors', 'and', 'na2ti3o7', 'particles', 'in', 'addition', 'the', 'synthesis', 'conditions', 'and', 'the', 'formation', 'mechanism', 'were', 'discussed', 'in', 'detail', 'this', 'singlesource', 'molten', 'salt', 'method', 'is', 'flexible', 'efficient', 'and', 'controllable', 'moreover', 'the', 'strategy', 'of', 'this', 'method', 'makes', 'it', 'possible', 'for', 'us', 'to', 'synthesize', 'other', 'sodium', 'titanate', 'materials']] | [-0.04229500642217392, 0.15868805724386795, -0.030069348221758798, 0.01998460838661472, -0.03101799785686961, -0.16110132252132253, 0.03460829385689327, 0.45658678272548986, -0.24869940492766435, -0.2962237418443915, 0.07741353578499652, -0.26199716725861844, -0.16610243229423555, 0.17166446674406072, -0.03146190429106355, 0.061383628145059835, -0.0030943450270866863, -0.08972329239608073, -0.012676953034575231, -0.22332613198656817, 0.21007257687612152, 0.1294405124321276, 0.31942438336127266, 0.07051847917883068, 0.05252776070372012, -0.013210898075176745, 0.0399519440679982, 0.01912644222065122, -0.16270353112426794, 0.11157658973670735, 0.26180503474624484, 0.021198563581826736, 0.2041825467140927, -0.4793304288569762, -0.23429118962578324, 0.03990378429428959, 0.12549534051593544, 0.10770434325344727, -0.15020579885577365, -0.20928218821063638, 0.09478033071131997, -0.10901625662072732, -0.16435371158788295, -0.07131777543156427, -0.02200310847398882, 0.02803157835756904, -0.27395772489205916, 0.04349536443965472, 0.046604721960184, 0.04157847894013536, -0.13377762519592915, -0.13745876525443199, -0.03732853762601141, 0.09624497075945292, 0.049294677505991896, -0.012953282652270734, 0.20057325432438175, -0.06704542298839257, -0.050739382198840687, 0.40168417936989237, -0.03210568044106571, -0.11913802516789232, 0.21739754909459424, -0.09579427500982407, -0.11560238302419228, 0.18665105051703143, 0.1347983191835181, 0.16880179463163475, -0.22218232986764336, -0.0051368147497687835, -0.006855782045393574, 0.1578616571009197, 0.1463955749890634, 0.019656345086666395, 0.1929003130454494, 0.22615805534854988, 0.005255806402360298, 0.21481600222807395, -0.10390028146770308, -0.011381754015539107, -0.17013296326242236, -0.25676427222788334, -0.14318467464953738, -0.006066305911802801, -0.05706373939459326, -0.18703855492640287, 0.3344550503759968, 0.13239991537542367, 0.10050018112726357, -0.11117174875523363, 0.2276114500983029, -0.015789831433758825, 0.07158673305435068, -0.042590929409108906, 0.23068839679377115, 0.1445367402867509, 0.15784983719908158, -0.2391573093470414, 0.1489500617513395, 0.04903554111215457] |
1,803.02952 | Touch Your Heart: A Tone-aware Chatbot for Customer Care on Social Media | Chatbot has become an important solution to rapidly increasing customer care
demands on social media in recent years. However, current work on chatbot for
customer care ignores a key to impact user experience - tones. In this work, we
create a novel tone-aware chatbot that generates toned responses to user
requests on social media. We first conduct a formative research, in which the
effects of tones are studied. Significant and various influences of different
tones on user experience are uncovered in the study. With the knowledge of
effects of tones, we design a deep learning based chatbot that takes tone
information into account. We train our system on over 1.5 million real customer
care conversations collected from Twitter. The evaluation reveals that our
tone-aware chatbot generates as appropriate responses to user requests as human
agents. More importantly, our chatbot is perceived to be even more empathetic
than human agents.
| cs.HC | chatbot has become an important solution to rapidly increasing customer care demands on social media in recent years however current work on chatbot for customer care ignores a key to impact user experience tones in this work we create a novel toneaware chatbot that generates toned responses to user requests on social media we first conduct a formative research in which the effects of tones are studied significant and various influences of different tones on user experience are uncovered in the study with the knowledge of effects of tones we design a deep learning based chatbot that takes tone information into account we train our system on over 15 million real customer care conversations collected from twitter the evaluation reveals that our toneaware chatbot generates as appropriate responses to user requests as human agents more importantly our chatbot is perceived to be even more empathetic than human agents | [['chatbot', 'has', 'become', 'an', 'important', 'solution', 'to', 'rapidly', 'increasing', 'customer', 'care', 'demands', 'on', 'social', 'media', 'in', 'recent', 'years', 'however', 'current', 'work', 'on', 'chatbot', 'for', 'customer', 'care', 'ignores', 'a', 'key', 'to', 'impact', 'user', 'experience', 'tones', 'in', 'this', 'work', 'we', 'create', 'a', 'novel', 'toneaware', 'chatbot', 'that', 'generates', 'toned', 'responses', 'to', 'user', 'requests', 'on', 'social', 'media', 'we', 'first', 'conduct', 'a', 'formative', 'research', 'in', 'which', 'the', 'effects', 'of', 'tones', 'are', 'studied', 'significant', 'and', 'various', 'influences', 'of', 'different', 'tones', 'on', 'user', 'experience', 'are', 'uncovered', 'in', 'the', 'study', 'with', 'the', 'knowledge', 'of', 'effects', 'of', 'tones', 'we', 'design', 'a', 'deep', 'learning', 'based', 'chatbot', 'that', 'takes', 'tone', 'information', 'into', 'account', 'we', 'train', 'our', 'system', 'on', 'over', '15', 'million', 'real', 'customer', 'care', 'conversations', 'collected', 'from', 'twitter', 'the', 'evaluation', 'reveals', 'that', 'our', 'toneaware', 'chatbot', 'generates', 'as', 'appropriate', 'responses', 'to', 'user', 'requests', 'as', 'human', 'agents', 'more', 'importantly', 'our', 'chatbot', 'is', 'perceived', 'to', 'be', 'even', 'more', 'empathetic', 'than', 'human', 'agents']] | [-0.10220582007066896, 0.057310650550241246, -0.06526510940214032, 0.05825092949687618, -0.19780175141632966, -0.16278425897535395, 0.08195459692777224, 0.45212021584890477, -0.15945684618303832, -0.31533338693576574, 0.04346542870817221, -0.3718043066471917, -0.22563950825252965, 0.2045793891278389, -0.126547699038271, 0.0017888047413466728, 0.09299602658864213, 0.08105369536556967, 0.031219565972992, -0.3136740526286502, 0.3222966270129777, 0.0275877904454294, 0.35361131371241317, 0.05842284231178769, 0.0868278069131408, 0.01085776294906917, -0.07369513222820138, -0.037074508796101566, -0.048984377510151556, 0.12876272762564253, 0.3658593581632188, 0.23511795369487204, 0.4352397941920447, -0.4811228521244779, -0.2148993224724258, 0.05358934280628415, 0.11515325397310447, 0.08680171696772186, -0.06301704545888878, -0.36551434250727094, 0.08289430285357449, -0.21941275130447052, 0.0136935855708506, -0.07999459558568435, 0.022330098313419786, -0.023674630090332757, -0.2874306187365357, -0.05095373881878714, 0.039576230162422954, 0.12297856705167573, -0.053954715275186534, -0.09301167749241632, 0.02511100283878128, 0.2667390810651067, 0.12660714735002704, 0.016851181796694505, 0.17778891940403424, -0.15986139693916201, -0.10488696062733253, 0.39446838349359087, -0.008152639327992602, -0.1596855133236067, 0.15285371861752275, -0.06533045775882185, -0.12789638383211951, 0.07048478080533853, 0.3410617023999867, 0.06549261668569421, -0.18880193649906002, -0.0847004108606959, -0.03990740187574586, 0.2382623588232553, 0.05676855966337153, 0.005754519570523184, 0.2118563361797635, 0.23052693338592678, 0.05193653856467915, 0.09651054173615467, 0.024749831629802203, -0.09067710996158931, -0.1728239214264673, -0.11365102249836949, -0.1373630401531668, 0.05576921856247705, -0.06339630081423173, -0.11237574724659119, 0.4103990808027248, 0.2275383620306033, 0.13722919114372592, 0.046309015503925056, 0.3440226199016077, 0.03204403664001378, 0.09923807167358799, 0.043249765965985516, 0.14742862638596393, -0.0670528868165454, 0.2277311243440586, -0.16157826535843875, 0.14122990968761556, -0.03821188536128157] |
1,803.02953 | Modeling Three-dimensional Invasive Solid Tumor Growth in Heterogeneous
Microenvironment under Chemotherapy | A systematic understanding of the evolution and growth dynamics of invasive
solid tumors in response to different chemotherapy strategies is crucial for
the development of individually optimized oncotherapy. Here, we develop a
hybrid three-dimensional (3D) computational model that integrates
pharmacokinetic model, continuum diffusion-reaction model and discrete cell
automaton model to investigate 3D invasive solid tumor growth in heterogeneous
microenvironment under chemotherapy. Specifically, we consider the effects of
heterogeneous environment on drug diffusion, tumor growth, invasion and the
drug-tumor interaction on individual cell level. We employ the hybrid model to
investigate the evolution and growth dynamics of avascular invasive solid
tumors under different chemotherapy strategies. Our simulations reproduce the
well-established observation that constant dosing is generally more effective
in suppressing primary tumor growth than periodic dosing, due to the resulting
continuous high drug concentration. In highly heterogeneous microenvironment,
the malignancy of the tumor is significantly enhanced, leading to inefficiency
of chemotherapies. The effects of geometrically-confined microenvironment and
non-uniform drug dosing are also investigated. Our computational model, when
supplemented with sufficient clinical data, could eventually lead to the
development of efficient in silico tools for prognosis and treatment strategy
optimization.
| q-bio.TO q-bio.PE | a systematic understanding of the evolution and growth dynamics of invasive solid tumors in response to different chemotherapy strategies is crucial for the development of individually optimized oncotherapy here we develop a hybrid threedimensional 3d computational model that integrates pharmacokinetic model continuum diffusionreaction model and discrete cell automaton model to investigate 3d invasive solid tumor growth in heterogeneous microenvironment under chemotherapy specifically we consider the effects of heterogeneous environment on drug diffusion tumor growth invasion and the drugtumor interaction on individual cell level we employ the hybrid model to investigate the evolution and growth dynamics of avascular invasive solid tumors under different chemotherapy strategies our simulations reproduce the wellestablished observation that constant dosing is generally more effective in suppressing primary tumor growth than periodic dosing due to the resulting continuous high drug concentration in highly heterogeneous microenvironment the malignancy of the tumor is significantly enhanced leading to inefficiency of chemotherapies the effects of geometricallyconfined microenvironment and nonuniform drug dosing are also investigated our computational model when supplemented with sufficient clinical data could eventually lead to the development of efficient in silico tools for prognosis and treatment strategy optimization | [['a', 'systematic', 'understanding', 'of', 'the', 'evolution', 'and', 'growth', 'dynamics', 'of', 'invasive', 'solid', 'tumors', 'in', 'response', 'to', 'different', 'chemotherapy', 'strategies', 'is', 'crucial', 'for', 'the', 'development', 'of', 'individually', 'optimized', 'oncotherapy', 'here', 'we', 'develop', 'a', 'hybrid', 'threedimensional', '3d', 'computational', 'model', 'that', 'integrates', 'pharmacokinetic', 'model', 'continuum', 'diffusionreaction', 'model', 'and', 'discrete', 'cell', 'automaton', 'model', 'to', 'investigate', '3d', 'invasive', 'solid', 'tumor', 'growth', 'in', 'heterogeneous', 'microenvironment', 'under', 'chemotherapy', 'specifically', 'we', 'consider', 'the', 'effects', 'of', 'heterogeneous', 'environment', 'on', 'drug', 'diffusion', 'tumor', 'growth', 'invasion', 'and', 'the', 'drugtumor', 'interaction', 'on', 'individual', 'cell', 'level', 'we', 'employ', 'the', 'hybrid', 'model', 'to', 'investigate', 'the', 'evolution', 'and', 'growth', 'dynamics', 'of', 'avascular', 'invasive', 'solid', 'tumors', 'under', 'different', 'chemotherapy', 'strategies', 'our', 'simulations', 'reproduce', 'the', 'wellestablished', 'observation', 'that', 'constant', 'dosing', 'is', 'generally', 'more', 'effective', 'in', 'suppressing', 'primary', 'tumor', 'growth', 'than', 'periodic', 'dosing', 'due', 'to', 'the', 'resulting', 'continuous', 'high', 'drug', 'concentration', 'in', 'highly', 'heterogeneous', 'microenvironment', 'the', 'malignancy', 'of', 'the', 'tumor', 'is', 'significantly', 'enhanced', 'leading', 'to', 'inefficiency', 'of', 'chemotherapies', 'the', 'effects', 'of', 'geometricallyconfined', 'microenvironment', 'and', 'nonuniform', 'drug', 'dosing', 'are', 'also', 'investigated', 'our', 'computational', 'model', 'when', 'supplemented', 'with', 'sufficient', 'clinical', 'data', 'could', 'eventually', 'lead', 'to', 'the', 'development', 'of', 'efficient', 'in', 'silico', 'tools', 'for', 'prognosis', 'and', 'treatment', 'strategy', 'optimization']] | [-0.037119723207827006, 0.1280299036889463, -0.028209679266689595, 0.05367255557133388, -0.030783548769918647, -0.18378903521979983, 0.05175231775973697, 0.360880636959966, -0.2299972932634724, -0.2535763106642392, 0.09618659474402415, -0.2261027496584968, -0.22695238559771913, 0.14681562193090447, -0.09912901736946927, 0.05279563299405414, 0.06045865483795972, -0.0660091765778693, 0.06139256657680144, -0.2463855864543065, 0.26288405794184655, 0.07195475092535285, 0.35994267869186963, 0.031462427924664034, 0.0831254557586854, 0.001843259175232536, -0.036511894289051765, 0.01364610455615597, -0.1763925355070151, 0.13962012016894043, 0.2658659795478515, 0.13625606914063462, 0.33698056743455096, -0.5428549797853103, -0.2983951605441099, 0.08513831442373024, 0.135839170245202, 0.1579824454176265, -0.07005603443933463, -0.21224355205289416, 0.05014522623245579, -0.15573033258394414, -0.134760553427544, -0.07646586364009292, -0.01475615398203199, 0.007663869999059652, -0.3230384439509991, 0.1495867196863794, -0.033371668005664205, 0.07411591762022392, -0.15161240915201504, -0.08808404710143805, -0.0512290577404201, 0.1647977299360571, 0.016349993447924184, 0.0003595635176925744, 0.23938324539796324, -0.17506402044280156, -0.0943075406308462, 0.35498305457971385, 0.0077595700115764615, -0.21796773806516384, 0.2419168336568652, -0.13371655359750967, -0.09529525107087417, 0.177589311798078, 0.2519182688002852, 0.09452990837665778, -0.21361246346535376, -0.04373720024674627, 0.0987171956212134, 0.17272545141042084, 0.026808715030248908, -0.042950047562653956, 0.1446840565796388, 0.31852454454008794, 0.006554947843825495, 0.11210963186380025, -0.07987453998947466, -0.1062392711891113, -0.18641548210603964, -0.17647884271290104, -0.05456884622926245, 0.02235333474503981, -0.10643475017387646, -0.22618501286110462, 0.3956959224834635, 0.13836911811392655, 0.06251029254541406, 0.04836396156634028, 0.276922208970614, 0.010349940305663826, 0.04604564584615464, -0.04448963891135881, 0.15729109494242113, 0.059922175510861986, 0.07820591457389496, -0.35545281672950935, 0.18768855283930394, 0.006366735592333449] |
1,803.02954 | Numerical realization of the variational method for generating
self-trapped beams | We introduce a numerical variational method based on the Rayleigh-Ritz
optimization principle for predicting two-dimensional self-trapped beams in
nonlinear media. This technique overcomes the limitation of the traditional
variational approximation in performing analytical Lagrangian integration and
differentiation. Approximate soliton solutions of a generalized nonlinear
Schr\"odinger equation are obtained, demonstrating robustness of the beams of
various types (fundamental, vortices, multipoles, azimuthons) in the course of
their propagation. The algorithm offers possibilities to produce more
sophisticated soliton profiles in general nonlinear models.
| physics.optics | we introduce a numerical variational method based on the rayleighritz optimization principle for predicting twodimensional selftrapped beams in nonlinear media this technique overcomes the limitation of the traditional variational approximation in performing analytical lagrangian integration and differentiation approximate soliton solutions of a generalized nonlinear schrodinger equation are obtained demonstrating robustness of the beams of various types fundamental vortices multipoles azimuthons in the course of their propagation the algorithm offers possibilities to produce more sophisticated soliton profiles in general nonlinear models | [['we', 'introduce', 'a', 'numerical', 'variational', 'method', 'based', 'on', 'the', 'rayleighritz', 'optimization', 'principle', 'for', 'predicting', 'twodimensional', 'selftrapped', 'beams', 'in', 'nonlinear', 'media', 'this', 'technique', 'overcomes', 'the', 'limitation', 'of', 'the', 'traditional', 'variational', 'approximation', 'in', 'performing', 'analytical', 'lagrangian', 'integration', 'and', 'differentiation', 'approximate', 'soliton', 'solutions', 'of', 'a', 'generalized', 'nonlinear', 'schrodinger', 'equation', 'are', 'obtained', 'demonstrating', 'robustness', 'of', 'the', 'beams', 'of', 'various', 'types', 'fundamental', 'vortices', 'multipoles', 'azimuthons', 'in', 'the', 'course', 'of', 'their', 'propagation', 'the', 'algorithm', 'offers', 'possibilities', 'to', 'produce', 'more', 'sophisticated', 'soliton', 'profiles', 'in', 'general', 'nonlinear', 'models']] | [-0.12337670517226798, 0.020897405740106477, -0.09818412297754549, 0.10819702168373624, -0.12035923455841839, -0.14438800521893427, 0.0017712935747113078, 0.3781578814145178, -0.27047085363374207, -0.2530852539464831, 0.044203453839872967, -0.24051850215764717, -0.1781576999113895, 0.23204093761742114, 0.014101779297925532, 0.14938382046530024, 0.07661902204854414, -0.06859210005495697, -0.09246666311519221, -0.17969207821006422, 0.3064290946436813, 0.007833466462034266, 0.33789436765946446, 0.019989272265229376, 0.12724288166500627, 0.002116628299700096, -0.02165291056735441, -0.008968920761253685, -0.13955599092005286, 0.18328136935597286, 0.23179545956868425, 0.11339101136545651, 0.31706527299247683, -0.48416300136595963, -0.30008581433212383, 0.04782899669953622, 0.18276419932662974, 0.21111503245483618, -0.09129637340029148, -0.312160291580949, 0.020464329328387976, -0.12926674410118721, -0.2048286261589965, -0.14904505474260077, -0.04674781521316618, 0.10514801351819188, -0.25762215434806424, 0.13787602162337861, 0.04668172879901249, 0.022646925842855124, -0.07940481433761307, -0.08164634284185013, 0.028868309887184296, -0.0006979832076467573, 0.004477222752757371, -0.05108050712733529, 0.056546112330397594, -0.13743826821737457, -0.14055597527185454, 0.4103498748736456, -0.05130646899633575, -0.27554522777209056, 0.1406872567225946, -0.04654335737686779, -0.08011417041125242, 0.15017451746971347, 0.20884804096422158, 0.18283412540331484, -0.12338241533143446, 0.041041553310788, 0.01082053241552785, 0.12603245084173978, 0.11339378152624704, 0.005535972372308606, 0.1567575615743408, 0.20509213280165567, 0.08261997911613435, 0.10936482737306505, -0.05820634984120261, -0.16134592993767, -0.2652687997848261, -0.12621356499148534, -0.14014820455922744, 0.003818499151384458, -0.10796033968199481, -0.17368333191261626, 0.43805567575618626, 0.14747480021324008, 0.08591904205095488, 0.03514083647169173, 0.3174749036785215, 0.17259009984554724, 0.011327383873867803, 0.03045020602294244, 0.2579630956985056, 0.16356379953213035, 0.12126693513655482, -0.23580552134662866, -0.047382378584006804, 0.1287719497224316] |
1,803.02955 | Strong Convex Nonlinear Relaxations of the Pooling Problem | We investigate new convex relaxations for the pooling problem, a classic
nonconvex production planning problem in which input materials are mixed in
intermediate pools, with the outputs of these pools further mixed to make
output products meeting given attribute percentage requirements. Our
relaxations are derived by considering a set which arises from the formulation
by considering a single product, a single attibute, and a single pool. The
convex hull of the resulting nonconvex set is not polyhedral. We derive valid
linear and convex nonlinear inequalities for the convex hull, and demonstrate
that different subsets of these inequalities define the convex hull of the
nonconvex set in three cases determined by the parameters of the set.
Computational results on literature instances and newly created larger test
instances demonstrate that the inequalities can significantly strengthen the
convex relaxation of the pq-formulation of the pooling problem, which is the
relaxation known to have the strongest bound.
| math.OC | we investigate new convex relaxations for the pooling problem a classic nonconvex production planning problem in which input materials are mixed in intermediate pools with the outputs of these pools further mixed to make output products meeting given attribute percentage requirements our relaxations are derived by considering a set which arises from the formulation by considering a single product a single attibute and a single pool the convex hull of the resulting nonconvex set is not polyhedral we derive valid linear and convex nonlinear inequalities for the convex hull and demonstrate that different subsets of these inequalities define the convex hull of the nonconvex set in three cases determined by the parameters of the set computational results on literature instances and newly created larger test instances demonstrate that the inequalities can significantly strengthen the convex relaxation of the pqformulation of the pooling problem which is the relaxation known to have the strongest bound | [['we', 'investigate', 'new', 'convex', 'relaxations', 'for', 'the', 'pooling', 'problem', 'a', 'classic', 'nonconvex', 'production', 'planning', 'problem', 'in', 'which', 'input', 'materials', 'are', 'mixed', 'in', 'intermediate', 'pools', 'with', 'the', 'outputs', 'of', 'these', 'pools', 'further', 'mixed', 'to', 'make', 'output', 'products', 'meeting', 'given', 'attribute', 'percentage', 'requirements', 'our', 'relaxations', 'are', 'derived', 'by', 'considering', 'a', 'set', 'which', 'arises', 'from', 'the', 'formulation', 'by', 'considering', 'a', 'single', 'product', 'a', 'single', 'attibute', 'and', 'a', 'single', 'pool', 'the', 'convex', 'hull', 'of', 'the', 'resulting', 'nonconvex', 'set', 'is', 'not', 'polyhedral', 'we', 'derive', 'valid', 'linear', 'and', 'convex', 'nonlinear', 'inequalities', 'for', 'the', 'convex', 'hull', 'and', 'demonstrate', 'that', 'different', 'subsets', 'of', 'these', 'inequalities', 'define', 'the', 'convex', 'hull', 'of', 'the', 'nonconvex', 'set', 'in', 'three', 'cases', 'determined', 'by', 'the', 'parameters', 'of', 'the', 'set', 'computational', 'results', 'on', 'literature', 'instances', 'and', 'newly', 'created', 'larger', 'test', 'instances', 'demonstrate', 'that', 'the', 'inequalities', 'can', 'significantly', 'strengthen', 'the', 'convex', 'relaxation', 'of', 'the', 'pqformulation', 'of', 'the', 'pooling', 'problem', 'which', 'is', 'the', 'relaxation', 'known', 'to', 'have', 'the', 'strongest', 'bound']] | [-0.06822691546808558, 0.046769620730412124, -0.03438904185221216, 0.049793728130764714, -0.06326402878598464, -0.14449387568894106, 0.06661838385899434, 0.31037646539459957, -0.3746453305808149, -0.28407253222601697, 0.11957449075035036, -0.27099153257610387, -0.12541627066074224, 0.19720081755404195, -0.10077406606630773, 0.09187766810916118, 0.0790106108217864, -0.019117044198591976, -0.1017015953417189, -0.2955292506630699, 0.32169595644470084, -0.0609078709134795, 0.26188576422224674, 0.06289416737391904, 0.09920296661050015, 0.0062957532728547295, 0.012594923169262683, 0.0873106086607447, -0.1033337731674716, 0.17842130667748954, 0.28066424139010543, 0.21702049289897873, 0.3140396106639717, -0.44282639912323446, -0.17704765659750019, 0.11343623623051464, 0.06882369635466314, 0.04766183395928623, -0.025616449943052864, -0.2443556641228497, 0.07031664649172631, -0.09473893654205842, -0.043706408600070024, -0.0756107834630356, -0.019931715142154537, 0.03595411167819275, -0.33163984888695824, 0.038051340335807364, 0.05536448580154298, -0.004333595716739875, -0.11995261421408628, -0.18158990412407758, -0.004305878797521358, 0.05643850986981481, 0.029656527312595816, 0.011727707824416903, 0.12978106938820605, -0.08741769601054342, -0.143191022163146, 0.3896502736980552, 0.018478462355371737, -0.24940657200941674, 0.1773919577799762, -0.12215171668320796, -0.1393786895186836, 0.13009591058932787, 0.22429977693527148, 0.17772549258187315, -0.17319521344951447, 0.07148057420195283, -0.13355856250342452, 0.10759706708713626, 0.07084374588032234, 0.025297963270140406, 0.16598809309402443, 0.15465420122653098, 0.1321548602816692, 0.2526285451704279, -0.055336532005116026, -0.10590793625436205, -0.312758276905149, -0.09246829404096298, -0.22377530798093964, -0.008001004852911933, -0.12722912001144449, -0.14888412385118127, 0.375286905754925, 0.0552438298588779, 0.1738002420162523, 0.14427254513902157, 0.2653984579377937, 0.12135779301733063, 0.07668431721541365, 0.08330240760565988, 0.22883164696087013, 0.06947449597665756, 0.012478215672347127, -0.2257923051677891, 0.10930859338529161, 0.0854987241420278] |
1,803.02956 | Some Approximation Bounds for Deep Networks | In this paper we introduce new bounds on the approximation of functions in
deep networks and in doing so introduce some new deep network architectures for
function approximation. These results give some theoretical insight into the
success of autoencoders and ResNets.
| cs.LG | in this paper we introduce new bounds on the approximation of functions in deep networks and in doing so introduce some new deep network architectures for function approximation these results give some theoretical insight into the success of autoencoders and resnets | [['in', 'this', 'paper', 'we', 'introduce', 'new', 'bounds', 'on', 'the', 'approximation', 'of', 'functions', 'in', 'deep', 'networks', 'and', 'in', 'doing', 'so', 'introduce', 'some', 'new', 'deep', 'network', 'architectures', 'for', 'function', 'approximation', 'these', 'results', 'give', 'some', 'theoretical', 'insight', 'into', 'the', 'success', 'of', 'autoencoders', 'and', 'resnets']] | [-0.04864099821666392, -0.011898228183116128, -0.10515863525613052, 0.11650485530347995, -0.0748855312150426, -0.1413146722834648, 0.07514396584990275, 0.4364261790746596, -0.27570074651299453, -0.2814522640915906, 0.030333021999245917, -0.21167038453788292, -0.32994836880030426, 0.17958343728649906, -0.10276240905428805, 0.09039652674663358, 0.09786458872258663, -0.033628506040791185, -0.11518244215900578, -0.3055310978826771, 0.3592107679422309, 0.01951395973375794, 0.2720234491294477, 0.1167790012933859, 0.11026927567564132, -0.04685144199103844, 0.0019385943802573333, -0.04752179855628439, -0.21045333328770427, 0.217254625269916, 0.23276502230181928, 0.22105328528573964, 0.3731238867224353, -0.5253739956675506, -0.23186414967086622, 0.0786911944018268, 0.18333560906396043, 0.10124551258390634, -0.07574097359291755, -0.29246008181490185, 0.05930888280272484, -0.15715592820197344, -0.007331066117508382, -0.225134376073029, -0.08637183536661834, 0.050413094915267895, -0.22499060208295904, -0.021182448421491355, 0.12394566734026118, 0.02346008464057998, -0.06999071907797237, -0.21017461192862288, 0.15370549477364231, 0.11257869906996082, -0.005839379958626701, 0.05907290313029435, 0.016515049197506612, -0.22509114198363955, -0.10347743009830393, 0.27459910146256045, -0.0769661758095026, -0.23169061183793152, 0.1511431401992989, -0.058701416551385346, -0.2586709669813877, 0.03092576122683723, 0.3178361269713538, 0.09030380872328107, -0.16365573214503323, 0.042796466292290974, -0.07204857479962634, 0.05079897397720232, -0.0018175671376833102, 0.11127591347776172, 0.11645894579407645, 0.2624902849244635, 0.05805617350539783, 0.1609167890430133, -0.10120830016505973, -0.08223895024417377, -0.27952699533595543, -0.12759917006805177, -0.13981427397669816, 0.011830222974644929, -0.10752270919222544, -0.16583509168235538, 0.44118976544179933, 0.21478430272602453, 0.25574809458197617, 0.20718140521927214, 0.3336507660768381, 0.09462992017861546, 0.12116323402378618, 0.09319992642849684, 0.2650174798923772, 0.1072332743930108, 0.0971279113508034, -0.06411563009932274, 0.07456262043972568, 0.11416345228236623] |
1,803.02957 | The degree of irrationality of hypersurfaces in various Fano varieties | The purpose of this paper is to compute the degree of irrationality of
hypersurfaces of sufficiently high degree in various Fano varieties: quadrics,
Grassmannians, products of projective space, cubic threefolds, cubic fourfolds,
and complete intersection threefolds of type (2,2). This extends the techniques
of Bastianelli, De Poi, Ein, Lazarsfeld, and the second author who computed the
degree of irrationality of hypersurfaces of sufficiently high degree in
projective space. A theme in the paper is that the fibers of low degree
rational maps from the hypersurfaces to projective space tend to lie on curves
of low degree contained in the Fano varieties. This allows us to study these
maps by studying the geometry of curves in these Fano varieties.
| math.AG | the purpose of this paper is to compute the degree of irrationality of hypersurfaces of sufficiently high degree in various fano varieties quadrics grassmannians products of projective space cubic threefolds cubic fourfolds and complete intersection threefolds of type 22 this extends the techniques of bastianelli de poi ein lazarsfeld and the second author who computed the degree of irrationality of hypersurfaces of sufficiently high degree in projective space a theme in the paper is that the fibers of low degree rational maps from the hypersurfaces to projective space tend to lie on curves of low degree contained in the fano varieties this allows us to study these maps by studying the geometry of curves in these fano varieties | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'compute', 'the', 'degree', 'of', 'irrationality', 'of', 'hypersurfaces', 'of', 'sufficiently', 'high', 'degree', 'in', 'various', 'fano', 'varieties', 'quadrics', 'grassmannians', 'products', 'of', 'projective', 'space', 'cubic', 'threefolds', 'cubic', 'fourfolds', 'and', 'complete', 'intersection', 'threefolds', 'of', 'type', '22', 'this', 'extends', 'the', 'techniques', 'of', 'bastianelli', 'de', 'poi', 'ein', 'lazarsfeld', 'and', 'the', 'second', 'author', 'who', 'computed', 'the', 'degree', 'of', 'irrationality', 'of', 'hypersurfaces', 'of', 'sufficiently', 'high', 'degree', 'in', 'projective', 'space', 'a', 'theme', 'in', 'the', 'paper', 'is', 'that', 'the', 'fibers', 'of', 'low', 'degree', 'rational', 'maps', 'from', 'the', 'hypersurfaces', 'to', 'projective', 'space', 'tend', 'to', 'lie', 'on', 'curves', 'of', 'low', 'degree', 'contained', 'in', 'the', 'fano', 'varieties', 'this', 'allows', 'us', 'to', 'study', 'these', 'maps', 'by', 'studying', 'the', 'geometry', 'of', 'curves', 'in', 'these', 'fano', 'varieties']] | [-0.23562435314090827, -0.001730779953443019, -0.07837571726985655, 0.06228525476763025, -0.07213099808747864, -0.13956423666943812, -0.016252263883223473, 0.29281965411915367, -0.25301545491378946, -0.22140684297852914, 0.04967505651648488, -0.27081068701683486, -0.1858580366676768, 0.20002215899037734, -0.2272043409283762, -0.0022671693320370327, -0.007549428446139446, 0.010460868671189174, -0.07018577156517403, -0.4343245405707729, 0.4866180745884776, -0.013142837274630191, 0.23975744934839402, 0.08426995366275059, 0.13611596305775692, 0.047428362671349006, 0.017626289593971382, -0.018628495252815517, -0.17813803441261417, 0.23587709516326313, 0.3598163765697282, 0.0900374885522208, 0.15440019045688086, -0.32260926096242365, -0.15552549327771037, 0.26235053487816606, 0.11117506093716532, 0.08406005385410735, 0.06362591036181045, -0.21919288645672091, 0.06128708240023609, -0.08670348423543994, -0.2550266369885244, -0.09331655038236561, 0.00817257648933742, 0.0844026505848456, -0.1552308154256888, -0.029905493923668133, 0.08889082214652987, 0.23804471932225307, 0.00024203148273893205, -0.08164318390358319, -0.10210283798011714, 0.039697304742915905, -0.02836539721416341, 0.056024793146762175, 0.0407114532791962, -0.11666703790276295, -0.10883715105542945, 0.37295361999738014, -0.05027570772000541, -0.16967045683098042, 0.11216251755141164, -0.2380157334165711, -0.15088288083088475, 0.21367537903094316, 0.1975826079309997, 0.20725607316372757, 0.008472781963804263, 0.15869657764304035, -0.04300945633785578, 0.06114158548130575, 0.17117759049475445, -0.033785370300855426, 0.11810928320520069, 0.045794406779489275, 0.05838329505996179, 0.09225328443611389, -0.028853409171846332, -0.006628872297893641, -0.3451424785021503, -0.21034977714515338, -0.12573316162925655, 0.16832259853796686, -0.1702516002072933, -0.13126345415662785, 0.4452499973358807, 0.009064055659603013, 0.24267885016309002, 0.07576854674587563, 0.2184228735218235, -0.03680450994110966, -0.0007166702505516804, 0.008928793150994737, 0.17130798444061113, 0.2264912030758273, 0.024646760094753008, -0.10550345902620238, -0.01806457458316522, 0.16226096225949793] |
1,803.02958 | Three-body Faddeev equations in two-particle Alt-Grassberger-Sandhas
form with Distorted-Wave-Born-approximation amplitudes as effective
potentials | In this paper, I prove that the sub-Coulomb $A(d,p)B$ reaction amplitude,
which is a solution of the three-body Faddeev equations in the
Alt-Grassberger-Sandhas (AGS) form, is peripheral if a peripheral is the
corresponding DWBA amplitude. Hence the Faddeev's reaction amplitude for the
sub-Coulomb $A(d,p)B$ reactions can also be parametrized in terms of the ANC of
the $(n\,A)$ bound state. First, I consider the original AGS equations with
separable potentials and prove that such equations are peripheral at
sub-Coulomb energies. After that, the two-particle AGS equations are derived
for the general potentials for sub-Coulomb transfer reactions. The effective
AGS potentials are expressed in terms of the DWBA amplitudes for the
sub-Coulomb reactions. Again, I demonstrate that the amplitude of the $A(d,p)B$
transfer reaction obtained from the AGS equation is peripheral and can be
parametrized in terms of the ANC for the $(nA)$ bound state because the
corresponding DWBA amplitude is peripheral. Finally, the AGS equations are
generalized by including the optical nuclear potentials in the same manner as
it is done in the DWBA. The obtained two-particle AGS equations contain the
DWBA effective potentials with distorted waves generated by the sum of the
nuclear optical and the channel Coulomb potentials. The AGS equation for the
$A(d,p)B$ reactions is analyzed above the Coulomb barrier and it is shown again
that the reaction amplitude satisfying generalized AGS equation with optical
potentials depends on the ANC if a peripheral is the DWBA amplitude. The
two-body AGS equations are generalized by including the intermediate three-body
continuum and more than one bound state in each channel.
| nucl-th | in this paper i prove that the subcoulomb adpb reaction amplitude which is a solution of the threebody faddeev equations in the altgrassbergersandhas ags form is peripheral if a peripheral is the corresponding dwba amplitude hence the faddeevs reaction amplitude for the subcoulomb adpb reactions can also be parametrized in terms of the anc of the na bound state first i consider the original ags equations with separable potentials and prove that such equations are peripheral at subcoulomb energies after that the twoparticle ags equations are derived for the general potentials for subcoulomb transfer reactions the effective ags potentials are expressed in terms of the dwba amplitudes for the subcoulomb reactions again i demonstrate that the amplitude of the adpb transfer reaction obtained from the ags equation is peripheral and can be parametrized in terms of the anc for the na bound state because the corresponding dwba amplitude is peripheral finally the ags equations are generalized by including the optical nuclear potentials in the same manner as it is done in the dwba the obtained twoparticle ags equations contain the dwba effective potentials with distorted waves generated by the sum of the nuclear optical and the channel coulomb potentials the ags equation for the adpb reactions is analyzed above the coulomb barrier and it is shown again that the reaction amplitude satisfying generalized ags equation with optical potentials depends on the anc if a peripheral is the dwba amplitude the twobody ags equations are generalized by including the intermediate threebody continuum and more than one bound state in each channel | [['in', 'this', 'paper', 'i', 'prove', 'that', 'the', 'subcoulomb', 'adpb', 'reaction', 'amplitude', 'which', 'is', 'a', 'solution', 'of', 'the', 'threebody', 'faddeev', 'equations', 'in', 'the', 'altgrassbergersandhas', 'ags', 'form', 'is', 'peripheral', 'if', 'a', 'peripheral', 'is', 'the', 'corresponding', 'dwba', 'amplitude', 'hence', 'the', 'faddeevs', 'reaction', 'amplitude', 'for', 'the', 'subcoulomb', 'adpb', 'reactions', 'can', 'also', 'be', 'parametrized', 'in', 'terms', 'of', 'the', 'anc', 'of', 'the', 'na', 'bound', 'state', 'first', 'i', 'consider', 'the', 'original', 'ags', 'equations', 'with', 'separable', 'potentials', 'and', 'prove', 'that', 'such', 'equations', 'are', 'peripheral', 'at', 'subcoulomb', 'energies', 'after', 'that', 'the', 'twoparticle', 'ags', 'equations', 'are', 'derived', 'for', 'the', 'general', 'potentials', 'for', 'subcoulomb', 'transfer', 'reactions', 'the', 'effective', 'ags', 'potentials', 'are', 'expressed', 'in', 'terms', 'of', 'the', 'dwba', 'amplitudes', 'for', 'the', 'subcoulomb', 'reactions', 'again', 'i', 'demonstrate', 'that', 'the', 'amplitude', 'of', 'the', 'adpb', 'transfer', 'reaction', 'obtained', 'from', 'the', 'ags', 'equation', 'is', 'peripheral', 'and', 'can', 'be', 'parametrized', 'in', 'terms', 'of', 'the', 'anc', 'for', 'the', 'na', 'bound', 'state', 'because', 'the', 'corresponding', 'dwba', 'amplitude', 'is', 'peripheral', 'finally', 'the', 'ags', 'equations', 'are', 'generalized', 'by', 'including', 'the', 'optical', 'nuclear', 'potentials', 'in', 'the', 'same', 'manner', 'as', 'it', 'is', 'done', 'in', 'the', 'dwba', 'the', 'obtained', 'twoparticle', 'ags', 'equations', 'contain', 'the', 'dwba', 'effective', 'potentials', 'with', 'distorted', 'waves', 'generated', 'by', 'the', 'sum', 'of', 'the', 'nuclear', 'optical', 'and', 'the', 'channel', 'coulomb', 'potentials', 'the', 'ags', 'equation', 'for', 'the', 'adpb', 'reactions', 'is', 'analyzed', 'above', 'the', 'coulomb', 'barrier', 'and', 'it', 'is', 'shown', 'again', 'that', 'the', 'reaction', 'amplitude', 'satisfying', 'generalized', 'ags', 'equation', 'with', 'optical', 'potentials', 'depends', 'on', 'the', 'anc', 'if', 'a', 'peripheral', 'is', 'the', 'dwba', 'amplitude', 'the', 'twobody', 'ags', 'equations', 'are', 'generalized', 'by', 'including', 'the', 'intermediate', 'threebody', 'continuum', 'and', 'more', 'than', 'one', 'bound', 'state', 'in', 'each', 'channel']] | [-0.08230262989661871, 0.1553510727889191, -0.10630320677972542, 0.09181306693129815, 0.028685616615873117, -0.12695617493277844, -0.05076825593266851, 0.30255250793953353, -0.2571317721982128, -0.21239110961771354, -0.02050363512423176, -0.3083600874596204, -0.10703910867182108, 0.16121999978159482, 0.07219308763473796, 0.05092628190222268, 0.1210451840942439, 0.09668626800322762, -0.08130780453032527, -0.18195843116487734, 0.3610407649754332, 0.033455579556399384, 0.2110070220194757, 0.1338343622521139, 0.07594168498225581, 0.05275484461229868, 0.04134823768701888, -0.029825116145926027, -0.08253264754740275, 0.09995180435407047, 0.2853819566116167, 0.04445427739276336, 0.14413947637121266, -0.4313954914526011, -0.20306710264144034, 0.0860897370829032, 0.14704434386132142, 0.17602450721315108, -0.00847288272953637, -0.2762192675772195, 0.061463544400444686, -0.19934249872413393, -0.15786676233670172, -0.049413022751328896, 0.048978866368102336, 0.11321969038197914, -0.2910406091720618, 0.13735391837600708, 0.01135845040418924, -0.007338897926876178, -0.1285530371672044, -0.21709550932058708, -0.04382285431672174, 0.05413545094466267, -0.007020014843706472, 0.05145510422970312, 0.10434133287053556, -0.13682662494807468, -0.05015100298646408, 0.39716895368720334, -0.03274720139457853, -0.207235110604849, 0.10324911581432948, -0.13636603068399172, -0.09892197497045764, 0.1894739400765572, 0.14456410943396175, 0.11032998273865535, -0.22652171323649012, 0.11537104445899156, -0.003330319525244144, 0.13086815767634946, 0.14131740286337355, -0.034971172155481046, 0.03635418618169541, 0.11614771391188977, -0.01873888562146861, 0.08223116486960162, -0.06808302084816835, -0.11017878875852777, -0.3417994198962473, -0.05758320093669821, -0.11579817393078254, 0.0313475611870392, -0.07305002822333616, -0.0781710662560027, 0.35224063518801885, 0.029959686961956323, 0.17516626049048054, 0.0501682625443209, 0.2561013391133971, 0.2423294668618697, 0.06850227902961285, 0.09343943877163557, 0.3200264475460594, 0.18233636715628493, 0.13085549783069067, -0.27617039351742, 0.0609743694586751, 0.10510504310771536] |
1,803.02959 | Topological and magnetic phase transition in silicene-like zigzag
nanoribbons | Spin-orbital interactions (SOI) in silicene results in the quantum spin Hall
effect, while the Hubbard-induced Coulomb interaction in zigzag nanoribbons
often generates a band gap with the anti-ferromagnetic (AF) spin orders on two
edges. In this paper we systematically study these two joint contributions to
the zigzag silicene-like nanoribbons (zSiNR). Some topological and magnetic
phase transitions are investigated with different material parameters and
external fields. We find when the ribbon width or the SOI value exceeds some
critical value, the SOI may overcome the Coulomb interaction and the system
transits from a band insulator to a topological insulator: the
quantum-spin-Hall or the spin quantum-anomalous Hall state. We also find some
magnetic phase transition exist in the Hubbard-dominated zSiNR systems when the
exchange field or the electric field goes beyond some critical values. At last
we observe a double topological/magnetic phase transition in a
Hubbard-SOI-balanced zSiNR system before the magnetic and topological phases
are destroyed by a strong electric field.
| cond-mat.mes-hall | spinorbital interactions soi in silicene results in the quantum spin hall effect while the hubbardinduced coulomb interaction in zigzag nanoribbons often generates a band gap with the antiferromagnetic af spin orders on two edges in this paper we systematically study these two joint contributions to the zigzag silicenelike nanoribbons zsinr some topological and magnetic phase transitions are investigated with different material parameters and external fields we find when the ribbon width or the soi value exceeds some critical value the soi may overcome the coulomb interaction and the system transits from a band insulator to a topological insulator the quantumspinhall or the spin quantumanomalous hall state we also find some magnetic phase transition exist in the hubbarddominated zsinr systems when the exchange field or the electric field goes beyond some critical values at last we observe a double topologicalmagnetic phase transition in a hubbardsoibalanced zsinr system before the magnetic and topological phases are destroyed by a strong electric field | [['spinorbital', 'interactions', 'soi', 'in', 'silicene', 'results', 'in', 'the', 'quantum', 'spin', 'hall', 'effect', 'while', 'the', 'hubbardinduced', 'coulomb', 'interaction', 'in', 'zigzag', 'nanoribbons', 'often', 'generates', 'a', 'band', 'gap', 'with', 'the', 'antiferromagnetic', 'af', 'spin', 'orders', 'on', 'two', 'edges', 'in', 'this', 'paper', 'we', 'systematically', 'study', 'these', 'two', 'joint', 'contributions', 'to', 'the', 'zigzag', 'silicenelike', 'nanoribbons', 'zsinr', 'some', 'topological', 'and', 'magnetic', 'phase', 'transitions', 'are', 'investigated', 'with', 'different', 'material', 'parameters', 'and', 'external', 'fields', 'we', 'find', 'when', 'the', 'ribbon', 'width', 'or', 'the', 'soi', 'value', 'exceeds', 'some', 'critical', 'value', 'the', 'soi', 'may', 'overcome', 'the', 'coulomb', 'interaction', 'and', 'the', 'system', 'transits', 'from', 'a', 'band', 'insulator', 'to', 'a', 'topological', 'insulator', 'the', 'quantumspinhall', 'or', 'the', 'spin', 'quantumanomalous', 'hall', 'state', 'we', 'also', 'find', 'some', 'magnetic', 'phase', 'transition', 'exist', 'in', 'the', 'hubbarddominated', 'zsinr', 'systems', 'when', 'the', 'exchange', 'field', 'or', 'the', 'electric', 'field', 'goes', 'beyond', 'some', 'critical', 'values', 'at', 'last', 'we', 'observe', 'a', 'double', 'topologicalmagnetic', 'phase', 'transition', 'in', 'a', 'hubbardsoibalanced', 'zsinr', 'system', 'before', 'the', 'magnetic', 'and', 'topological', 'phases', 'are', 'destroyed', 'by', 'a', 'strong', 'electric', 'field']] | [-0.2515160665667105, 0.23365374815935688, -0.001132937207172114, 0.03748014243094311, -0.022439364056223102, -0.1684682888850089, 0.06976237940947495, 0.4263142552286867, -0.28355855125212864, -0.2909019823156057, 0.030593592999503018, -0.31161746750135094, -0.16182961163952225, 0.1355304020381863, 0.06270497550647106, -0.01488141831106341, -0.009928907541137549, -0.015756744494841945, -0.13543828238222388, -0.19924211423213203, 0.32259850163132914, -0.05845748751889914, 0.26523510577577736, 0.0982304980587815, -0.02606862864922732, 0.018404286135468753, 0.16999661190615548, 0.06019157331827427, -0.16250276380488948, -0.020525340768959253, 0.20218530510056523, -0.16891347188202124, 0.20599631358298562, -0.456460466764627, -0.16718432216514503, 0.01967339464613507, 0.11630902359329705, 0.1834717667796799, -0.05459635194105607, -0.33599620451850276, 0.038211378116431015, -0.1803820540257279, -0.07265453554366925, -0.05346596540672885, 0.0008839843066168889, -0.0375647921013766, -0.24417601283339244, 0.03547640264225793, 0.07171207166111637, 0.0925970143240486, -0.08461281289496729, -0.12970066903189065, -0.09643889345348843, 0.07938100701355706, 0.07297333091640124, 0.06124634967606154, 0.15931938774883747, -0.1794991377230373, -0.14326862560645226, 0.3312367599577673, -0.04133142813619587, -0.09035573420265029, 0.15833725272752947, -0.21600496159395158, -0.07119640059799197, 0.1710260585491215, 0.08323902695049201, 0.04602417250392928, -0.08900237950860643, 0.10140953704925074, 0.04019001569118231, 0.14424486744608128, 0.016866376157850027, 0.08907740412490261, 0.2997483243024157, 0.13932616834739042, 0.07975738865713919, 0.15687265715621893, -0.137679404657965, -0.06436201321832355, -0.21551202569877909, -0.17667927986852103, -0.21266663423288734, 0.06076161985796306, -0.06637229637746069, -0.2058644436119545, 0.44369678083213887, 0.19226620876260342, 0.15617250068293465, -0.06486828231793498, 0.25871157277856144, 0.14212087545724164, 0.06864542212457427, 0.04043649380666114, 0.2964975175755699, 0.18069166090609806, 0.13213003066991785, -0.249753325055128, 0.03945960087791806, 0.022109109173799234] |
1,803.0296 | Rigorous numerical computations for 1D advection equations with variable
coefficients | This paper provides a methodology of verified computing for solutions to
1-dimensional advection equations with variable coefficients. The advection
equation is typical partial differential equations (PDEs) of hyperbolic type.
There are few results of verified numerical computations to initial-boundary
value problems of hyperbolic PDEs. Our methodology is based on the spectral
method and semigroup theory. The provided method in this paper is regarded as
an efficient application of semigroup theory in a sequence space associated
with the Fourier series of unknown functions. This is a foundational approach
of verified numerical computations for hyperbolic PDEs. Numerical examples show
that the rigorous error estimate showing the well-posedness of the exact
solution is given with high accuracy and high speed.
| math.NA math.AP | this paper provides a methodology of verified computing for solutions to 1dimensional advection equations with variable coefficients the advection equation is typical partial differential equations pdes of hyperbolic type there are few results of verified numerical computations to initialboundary value problems of hyperbolic pdes our methodology is based on the spectral method and semigroup theory the provided method in this paper is regarded as an efficient application of semigroup theory in a sequence space associated with the fourier series of unknown functions this is a foundational approach of verified numerical computations for hyperbolic pdes numerical examples show that the rigorous error estimate showing the wellposedness of the exact solution is given with high accuracy and high speed | [['this', 'paper', 'provides', 'a', 'methodology', 'of', 'verified', 'computing', 'for', 'solutions', 'to', '1dimensional', 'advection', 'equations', 'with', 'variable', 'coefficients', 'the', 'advection', 'equation', 'is', 'typical', 'partial', 'differential', 'equations', 'pdes', 'of', 'hyperbolic', 'type', 'there', 'are', 'few', 'results', 'of', 'verified', 'numerical', 'computations', 'to', 'initialboundary', 'value', 'problems', 'of', 'hyperbolic', 'pdes', 'our', 'methodology', 'is', 'based', 'on', 'the', 'spectral', 'method', 'and', 'semigroup', 'theory', 'the', 'provided', 'method', 'in', 'this', 'paper', 'is', 'regarded', 'as', 'an', 'efficient', 'application', 'of', 'semigroup', 'theory', 'in', 'a', 'sequence', 'space', 'associated', 'with', 'the', 'fourier', 'series', 'of', 'unknown', 'functions', 'this', 'is', 'a', 'foundational', 'approach', 'of', 'verified', 'numerical', 'computations', 'for', 'hyperbolic', 'pdes', 'numerical', 'examples', 'show', 'that', 'the', 'rigorous', 'error', 'estimate', 'showing', 'the', 'wellposedness', 'of', 'the', 'exact', 'solution', 'is', 'given', 'with', 'high', 'accuracy', 'and', 'high', 'speed']] | [-0.13085978171732435, -0.008488529066144265, -0.07687394375888965, 0.0516966520748937, -0.09670075669916522, -0.12163300954330808, -0.012705470770637259, 0.3189458910089273, -0.31047734763059354, -0.26867226153039014, 0.17292810295724398, -0.27849919352935165, -0.18202185867857745, 0.284282381224454, -0.08712658021821935, 0.15198385026644215, 0.10969903458578464, -0.00547461112579092, -0.09888583643667392, -0.239918307807201, 0.32910664095423925, -0.003050916868015232, 0.2230184947132555, 0.041361838451817505, 0.18037168868284068, -0.07991112537809417, -0.07893130985988128, 0.017900126193934638, -0.15727886311446454, 0.1431986197976507, 0.2791247552690598, 0.08231722631563361, 0.3138417968721503, -0.39679599493049467, -0.22891494260830247, 0.03137208453705932, 0.15673201800618544, 0.10138690162004314, -0.09429164158088815, -0.27796121776645255, 0.11539599025208089, -0.14583155467139128, -0.20760858848563626, -0.11127781813056806, 0.011548347695547545, 0.04153752529945893, -0.3074990417012292, 0.12544196121330953, 0.03573495984618735, 0.08502657220571533, -0.09846764180857019, -0.06109262954316333, 0.010961948565613383, 0.046468711350686275, 0.056423836863180823, -0.016695348939930018, 0.03721342985637677, -0.07289072300673613, -0.1185850562273055, 0.37107567247162515, -0.06161969766402856, -0.3062599601669826, 0.1526437558603879, -0.11180537696688986, -0.11609186413180497, 0.16965083416917512, 0.16502312938165334, 0.1956318604767832, -0.10677267596698724, 0.11919920624763124, -0.06609523101335663, 0.16277834704607472, 0.00658515951811121, -0.03937757282685011, 0.06035505323750405, 0.19879188652858776, 0.08435241712066226, 0.1167487606473872, 0.035516813725260936, -0.11967108084255049, -0.35363310736277676, -0.1739303051229391, -0.18811161297126713, 0.05004587928708802, -0.13632420101302525, -0.21697167577779192, 0.3699949774692137, 0.16145673133114463, 0.11315746607784277, 0.10153793512533109, 0.29612896331928223, 0.24561403999373746, -0.05004909983239113, 0.0776927151864506, 0.17789038616972855, 0.1922594546041905, 0.11298159522235267, -0.20824221611962232, 0.02725129272852443, 0.1877513889095977] |
1,803.02961 | Influence Maximization for Fixed Heterogeneous Thresholds | Influence Maximization is a NP-hard problem of selecting the optimal set of
influencers in a network. Here, we propose two new approaches to influence
maximization based on two very different metrics. The first metric, termed
Balanced Index (BI), is fast to compute and assigns top values to two kinds of
nodes: those with high resistance to adoption, and those with large out-degree.
This is done by linearly combining three properties of a node: its degree,
susceptibility to new opinions, and the impact its activation will have on its
neighborhood. Controlling the weights between those three terms has a huge
impact on performance. The second metric, termed Group Performance Index (GPI),
measures performance of each node as an initiator when it is a part of randomly
selected initiator set. In each such selection, the score assigned to each
teammate is inversely proportional to the number of initiators causing the
desired spread. These two metrics are applicable to various cascade models;
here we test them on the Linear Threshold Model with fixed and known
thresholds. Furthermore, we study the impact of network degree assortativity
and threshold distribution on the cascade size for metrics including ours. The
results demonstrate our two metrics deliver strong performance for influence
maximization.
| cs.SI physics.comp-ph physics.soc-ph | influence maximization is a nphard problem of selecting the optimal set of influencers in a network here we propose two new approaches to influence maximization based on two very different metrics the first metric termed balanced index bi is fast to compute and assigns top values to two kinds of nodes those with high resistance to adoption and those with large outdegree this is done by linearly combining three properties of a node its degree susceptibility to new opinions and the impact its activation will have on its neighborhood controlling the weights between those three terms has a huge impact on performance the second metric termed group performance index gpi measures performance of each node as an initiator when it is a part of randomly selected initiator set in each such selection the score assigned to each teammate is inversely proportional to the number of initiators causing the desired spread these two metrics are applicable to various cascade models here we test them on the linear threshold model with fixed and known thresholds furthermore we study the impact of network degree assortativity and threshold distribution on the cascade size for metrics including ours the results demonstrate our two metrics deliver strong performance for influence maximization | [['influence', 'maximization', 'is', 'a', 'nphard', 'problem', 'of', 'selecting', 'the', 'optimal', 'set', 'of', 'influencers', 'in', 'a', 'network', 'here', 'we', 'propose', 'two', 'new', 'approaches', 'to', 'influence', 'maximization', 'based', 'on', 'two', 'very', 'different', 'metrics', 'the', 'first', 'metric', 'termed', 'balanced', 'index', 'bi', 'is', 'fast', 'to', 'compute', 'and', 'assigns', 'top', 'values', 'to', 'two', 'kinds', 'of', 'nodes', 'those', 'with', 'high', 'resistance', 'to', 'adoption', 'and', 'those', 'with', 'large', 'outdegree', 'this', 'is', 'done', 'by', 'linearly', 'combining', 'three', 'properties', 'of', 'a', 'node', 'its', 'degree', 'susceptibility', 'to', 'new', 'opinions', 'and', 'the', 'impact', 'its', 'activation', 'will', 'have', 'on', 'its', 'neighborhood', 'controlling', 'the', 'weights', 'between', 'those', 'three', 'terms', 'has', 'a', 'huge', 'impact', 'on', 'performance', 'the', 'second', 'metric', 'termed', 'group', 'performance', 'index', 'gpi', 'measures', 'performance', 'of', 'each', 'node', 'as', 'an', 'initiator', 'when', 'it', 'is', 'a', 'part', 'of', 'randomly', 'selected', 'initiator', 'set', 'in', 'each', 'such', 'selection', 'the', 'score', 'assigned', 'to', 'each', 'teammate', 'is', 'inversely', 'proportional', 'to', 'the', 'number', 'of', 'initiators', 'causing', 'the', 'desired', 'spread', 'these', 'two', 'metrics', 'are', 'applicable', 'to', 'various', 'cascade', 'models', 'here', 'we', 'test', 'them', 'on', 'the', 'linear', 'threshold', 'model', 'with', 'fixed', 'and', 'known', 'thresholds', 'furthermore', 'we', 'study', 'the', 'impact', 'of', 'network', 'degree', 'assortativity', 'and', 'threshold', 'distribution', 'on', 'the', 'cascade', 'size', 'for', 'metrics', 'including', 'ours', 'the', 'results', 'demonstrate', 'our', 'two', 'metrics', 'deliver', 'strong', 'performance', 'for', 'influence', 'maximization']] | [-0.13581878889079502, 0.0639382761682344, -0.036145656796672, 0.03758595598770714, -0.08457648276987417, -0.15633585034619743, 0.07971464422099837, 0.4085773176127454, -0.2606847694915969, -0.3131868511733667, 0.07357002380758343, -0.3223681356576158, -0.1770355276127414, 0.15465536356233514, -0.05454857151773645, 0.058453612430262515, 0.05001264936688197, 0.09846737431135119, -0.02374116270632551, -0.29712778231435705, 0.3600039972208168, 0.08561355755096528, 0.3364418420179679, 0.06587075324297496, 0.10954261867133559, -0.02308493070680614, -0.02103463191618552, 0.07704167540366876, -0.1161641837858663, 0.10589902324931379, 0.2028820685368839, 0.16374561961558534, 0.3431736299177495, -0.34519271478965513, -0.18134331536797307, 0.1331623726984395, 0.08649547681007988, 0.05307781948458131, 0.003743861874043033, -0.23502082963383233, 0.12741228003600022, -0.1783434349512568, -0.05616736333680952, -0.03387718135349044, -0.002041383733882046, 0.05452504835727556, -0.2734333494587279, -0.008302948158234357, -0.02144870833471054, 0.024910550339647182, -0.03708336221724294, -0.1598423806109988, -0.018099626639244578, 0.17448450602980034, 0.05096490063332589, 0.005403260380688418, 0.14354386752153314, -0.13365235531066613, -0.15505164146150757, 0.36434445075191013, -0.04871837250411329, -0.2453349387761569, 0.1941024312613214, -0.08721376010784652, -0.12409093451867925, 0.0943383262140631, 0.2247316174345409, 0.11648985386610304, -0.12988315119398133, -0.020354672045753586, -0.001942921148204222, 0.15216369736576227, 0.055023413212833605, 0.04583530276559475, 0.15437311050368518, 0.18575545860477155, 0.10619755046805594, 0.16250450381804712, -0.09871144218089219, -0.0805004427890952, -0.23715136130681125, -0.11079731048425523, -0.20306695973182598, 0.027012276827789297, -0.14922589589919746, -0.17715809214178746, 0.44881478384557383, 0.1393108021081766, 0.23306562674754278, 0.08399111950293002, 0.2770219930379492, 0.09081105479598613, 0.054713370509036796, 0.08433671764143538, 0.219275175421158, 0.07282007728567029, 0.03763532169083724, -0.20539780753429002, 0.13482888260878986, 0.059159360848730656] |
1,803.02962 | Does the time horizon of the return predictive effect of investor
sentiment vary with stock characteristics? A Granger causality analysis in
the frequency domain | Behavioral theories posit that investor sentiment exhibits predictive power
for stock returns, whereas there is little study have investigated the
relationship between the time horizon of the predictive effect of investor
sentiment and the firm characteristics. To this end, by using a Granger
causality analysis in the frequency domain proposed by Lemmens et al. (2008),
this paper examine whether the time horizon of the predictive effect of
investor sentiment on the U.S. returns of stocks vary with different firm
characteristics (e.g., firm size (Size), book-to-market equity (B/M) rate,
operating profitability (OP) and investment (Inv)). The empirical results
indicate that investor sentiment has a long-term (more than 12 months) or
short-term (less than 12 months) predictive effect on stock returns with
different firm characteristics. Specifically, the investor sentiment has strong
predictability in the stock returns for smaller Size stocks, lower B/M stocks
and lower OP stocks, both in the short term and long term, but only has a
short-term predictability for higher quantile ones. The investor sentiment
merely has predictability for the returns of smaller Inv stocks in the short
term, but has a strong short-term and long-term predictability for larger Inv
stocks. These results have important implications for the investors for the
planning of the short and the long run stock investment strategy.
| econ.EM q-fin.ST | behavioral theories posit that investor sentiment exhibits predictive power for stock returns whereas there is little study have investigated the relationship between the time horizon of the predictive effect of investor sentiment and the firm characteristics to this end by using a granger causality analysis in the frequency domain proposed by lemmens et al 2008 this paper examine whether the time horizon of the predictive effect of investor sentiment on the us returns of stocks vary with different firm characteristics eg firm size size booktomarket equity bm rate operating profitability op and investment inv the empirical results indicate that investor sentiment has a longterm more than 12 months or shortterm less than 12 months predictive effect on stock returns with different firm characteristics specifically the investor sentiment has strong predictability in the stock returns for smaller size stocks lower bm stocks and lower op stocks both in the short term and long term but only has a shortterm predictability for higher quantile ones the investor sentiment merely has predictability for the returns of smaller inv stocks in the short term but has a strong shortterm and longterm predictability for larger inv stocks these results have important implications for the investors for the planning of the short and the long run stock investment strategy | [['behavioral', 'theories', 'posit', 'that', 'investor', 'sentiment', 'exhibits', 'predictive', 'power', 'for', 'stock', 'returns', 'whereas', 'there', 'is', 'little', 'study', 'have', 'investigated', 'the', 'relationship', 'between', 'the', 'time', 'horizon', 'of', 'the', 'predictive', 'effect', 'of', 'investor', 'sentiment', 'and', 'the', 'firm', 'characteristics', 'to', 'this', 'end', 'by', 'using', 'a', 'granger', 'causality', 'analysis', 'in', 'the', 'frequency', 'domain', 'proposed', 'by', 'lemmens', 'et', 'al', '2008', 'this', 'paper', 'examine', 'whether', 'the', 'time', 'horizon', 'of', 'the', 'predictive', 'effect', 'of', 'investor', 'sentiment', 'on', 'the', 'us', 'returns', 'of', 'stocks', 'vary', 'with', 'different', 'firm', 'characteristics', 'eg', 'firm', 'size', 'size', 'booktomarket', 'equity', 'bm', 'rate', 'operating', 'profitability', 'op', 'and', 'investment', 'inv', 'the', 'empirical', 'results', 'indicate', 'that', 'investor', 'sentiment', 'has', 'a', 'longterm', 'more', 'than', '12', 'months', 'or', 'shortterm', 'less', 'than', '12', 'months', 'predictive', 'effect', 'on', 'stock', 'returns', 'with', 'different', 'firm', 'characteristics', 'specifically', 'the', 'investor', 'sentiment', 'has', 'strong', 'predictability', 'in', 'the', 'stock', 'returns', 'for', 'smaller', 'size', 'stocks', 'lower', 'bm', 'stocks', 'and', 'lower', 'op', 'stocks', 'both', 'in', 'the', 'short', 'term', 'and', 'long', 'term', 'but', 'only', 'has', 'a', 'shortterm', 'predictability', 'for', 'higher', 'quantile', 'ones', 'the', 'investor', 'sentiment', 'merely', 'has', 'predictability', 'for', 'the', 'returns', 'of', 'smaller', 'inv', 'stocks', 'in', 'the', 'short', 'term', 'but', 'has', 'a', 'strong', 'shortterm', 'and', 'longterm', 'predictability', 'for', 'larger', 'inv', 'stocks', 'these', 'results', 'have', 'important', 'implications', 'for', 'the', 'investors', 'for', 'the', 'planning', 'of', 'the', 'short', 'and', 'the', 'long', 'run', 'stock', 'investment', 'strategy']] | [-0.04798343670477942, 0.07205997690221758, -0.12160728476994054, 0.1725906986724629, -0.11435295385499857, -0.17949774751588352, 0.14345353994214635, 0.4348955343962765, -0.22644741605407614, -0.28622750482689197, 0.15273496942696305, -0.3442378340665024, -0.0940776972653248, 0.1869879897996486, -0.10057397270706338, -0.005598129914470122, 0.0348634032265856, 0.02912345060317869, 0.03566635485974626, -0.3058758677331022, 0.2159306838848309, 0.11973462577804293, 0.354087187093136, 0.02223116233988617, 0.11795308415454424, 0.0007400985013588633, -0.0813692146201701, -0.0046095664092632525, -0.10960871050771853, 0.1186362890911424, 0.26676531653947466, 0.0987080597567936, 0.4013966994246407, -0.41168935321044053, -0.17809831251241617, 0.14465633082365345, 0.022579464930458926, -0.013300388566100262, 0.06914089774370506, -0.24919267920799062, 0.030958236055230032, -0.2614180571498008, -0.029816610327628855, -0.0636507496368927, 0.18742799238594765, -0.007669233151890793, -0.254953355515297, 0.11708298482289406, 0.07586217431150412, 0.10702837564973729, -0.06299430462766763, -0.15897530512315847, -0.03394139641589822, 0.17400057463110927, 0.22866356686225484, -0.0624154802737539, 0.1188813230075257, -0.11533781541650787, -0.19335071206422952, 0.3173336334648966, -0.09277052972577797, -0.1165641699633408, 0.09181615220986201, -0.1567296312510871, -0.1251847008068307, 0.05793945507710459, 0.23013187818526523, 0.01556115413954735, -0.12757751702149553, 0.02744533164271464, -0.06507814465475405, 0.28952903046049705, 0.08960711060664639, 0.01260627612680363, 0.21375230184270883, 0.23154770324067891, 0.10557314867433598, 0.07441380737265223, -0.10451106253482331, -0.14658398538343653, -0.19039333925610888, -0.09784395441176816, -0.10636873173999092, 0.06782900398769831, -0.21925893253846282, -0.13685929744139297, 0.4331894869863672, 0.16070427776078208, 0.10227669908844389, 0.16341742087689015, 0.22842187124103341, 0.13551663655674023, 0.022204787783027397, 0.11688228978003712, 0.21971760989722092, -0.07376505001535542, 0.20612826698980002, -0.20830398352304036, 0.22160627823235562, -0.0061696641958218085] |
1,803.02963 | Role of La doping for Topological Hall Effect in Epitaxial EuO Films | We report the critical role of La doping in the topological Hall effect
observed in LaxEu1-xO thin films (~ 50 nm) grown by molecular beam epitaxy.
When the La doping exceeds 0.036, topological Hall effect emerges, which we
attribute to the formation of magnetic skyrmions. Besides, the La doping is
found to play a critical role in determining the phases, densities, and sizes
of the skyrmions in the LaxEu1-xO thin films. The maximum region of the
skyrmion phase diagram is observed on the La0.1Eu0.9O thin film. As the La
doping increases, the skyrmion density increases while the skyrmion size
decreases. Our findings demonstrate the important role of La doping for the
skyrmions in EuO films, which could be important for future studies of magnetic
skyrmions in Heisenberg ferromagnets.
| cond-mat.mtrl-sci cond-mat.mes-hall | we report the critical role of la doping in the topological hall effect observed in laxeu1xo thin films 50 nm grown by molecular beam epitaxy when the la doping exceeds 0036 topological hall effect emerges which we attribute to the formation of magnetic skyrmions besides the la doping is found to play a critical role in determining the phases densities and sizes of the skyrmions in the laxeu1xo thin films the maximum region of the skyrmion phase diagram is observed on the la01eu09o thin film as the la doping increases the skyrmion density increases while the skyrmion size decreases our findings demonstrate the important role of la doping for the skyrmions in euo films which could be important for future studies of magnetic skyrmions in heisenberg ferromagnets | [['we', 'report', 'the', 'critical', 'role', 'of', 'la', 'doping', 'in', 'the', 'topological', 'hall', 'effect', 'observed', 'in', 'laxeu1xo', 'thin', 'films', '50', 'nm', 'grown', 'by', 'molecular', 'beam', 'epitaxy', 'when', 'the', 'la', 'doping', 'exceeds', '0036', 'topological', 'hall', 'effect', 'emerges', 'which', 'we', 'attribute', 'to', 'the', 'formation', 'of', 'magnetic', 'skyrmions', 'besides', 'the', 'la', 'doping', 'is', 'found', 'to', 'play', 'a', 'critical', 'role', 'in', 'determining', 'the', 'phases', 'densities', 'and', 'sizes', 'of', 'the', 'skyrmions', 'in', 'the', 'laxeu1xo', 'thin', 'films', 'the', 'maximum', 'region', 'of', 'the', 'skyrmion', 'phase', 'diagram', 'is', 'observed', 'on', 'the', 'la01eu09o', 'thin', 'film', 'as', 'the', 'la', 'doping', 'increases', 'the', 'skyrmion', 'density', 'increases', 'while', 'the', 'skyrmion', 'size', 'decreases', 'our', 'findings', 'demonstrate', 'the', 'important', 'role', 'of', 'la', 'doping', 'for', 'the', 'skyrmions', 'in', 'euo', 'films', 'which', 'could', 'be', 'important', 'for', 'future', 'studies', 'of', 'magnetic', 'skyrmions', 'in', 'heisenberg', 'ferromagnets']] | [-0.19495250270401518, 0.23887849730935187, -0.022786494802623507, 0.009475911308395406, -0.0099064392232967, -0.09048845436078526, 0.09419868386260444, 0.3649166528315794, -0.2441892507561152, -0.32114269448849825, 0.017558625835414614, -0.30688666591360686, -0.08482110422975835, 0.19754891524902515, 0.011854409253095171, -0.0011162473970363217, -0.1216697228315576, -0.10491736309843198, -0.08812743558308049, -0.23879269039964363, 0.2775532269395978, 0.06768425197280463, 0.3841531767149366, 0.10924443725361338, 0.016988007971386034, -0.019274340337893416, 0.1718547058558362, 0.046399904587756724, -0.22367792347452656, -0.002961432502131849, 0.2589953013079902, -0.15620333623636753, 0.18511636705408174, -0.47126790260775914, -0.20081674005655992, -0.04397224948831623, 0.19725471850946516, 0.161131304838965, -0.1277203292768043, -0.2833222292923188, 0.10871771173392077, -0.09852614405240127, -0.1371253752220054, -0.04931377385735452, 0.03175315618394844, -0.02340251370333135, -0.21380351532969788, 0.08166420243440135, 0.09036457966712694, 0.12035086385402528, -0.11981861487091068, -0.18545736485130845, -0.16181231004508934, 0.06459039279504777, 0.07539227706635551, 0.10306715227723602, 0.24581907772188705, -0.15442731453766745, -0.09750770649031526, 0.3241850360176496, -0.024313124063830342, -0.03079532994888723, 0.08222624302781638, -0.24646154402263723, -0.08008113473648161, 0.12293447424928027, 0.10534042560104881, 0.12367014978606734, -0.00981300020641591, 0.09801218299628911, 0.007950904894612669, 0.23081275857158848, 0.060651664325456704, 0.09042940842318198, 0.3148980985635952, 0.2829462884147952, 0.0410120761239781, 0.14603119613058235, -0.17158794788185566, -0.04340567953899623, -0.16958700851987926, -0.2356177993614467, -0.18587201884797505, 0.05338631678516263, -0.13585300580211146, -0.19597949704245454, 0.3352212298195809, 0.17968959418301952, 0.16099231174936698, -0.1308584294315698, 0.17771200330988055, 0.08096593239479849, 0.08661005528823983, -0.008611241043845733, 0.2798412561702031, 0.15518158563270024, 0.17479712346363568, -0.3095812685675018, 0.1305302034597844, 0.025881884116379004] |
1,803.02964 | Persistent spin texture enforced by symmetry | Persistent spin texture (PST) is the property of some materials to maintain a
uniform spin configuration in the momentum space. This property has been
predicted to support an extraordinarily long spin lifetime of carriers
promising for spintronics applications. The PST is known to emerge when the
strengths of two dominant spin-orbit couplings, the Rashba and linear
Dresselhaus, are equal. This condition, however, is not trivial to achieve and
requires tuning the Rashba and Dresselhaus parameters, as has been demonstrated
with semiconductor quantum-well structures. Here we predict that there exist a
class of non-centrosymmetric bulk materials where the PST is enforced by the
non-symmorphic space group symmetry of the crystal. Around certain high
symmetry points in the Brillouin zone, the sublattice degrees of freedom impose
a constraint on the effective spin-orbit field, which remains independent of
the momentum orientation and thus maintains the PST. We illustrate this
behavior using density-functional theory calculations for a handful of
promising candidates accessible experimentally. Among them is the ferroelectric
oxide BiInO3-a wide band gap semiconductor which sustains a PST around the
conduction band minimum. Our results broaden the range of materials, which can
be employed in spintronics.
| cond-mat.mtrl-sci cond-mat.mes-hall | persistent spin texture pst is the property of some materials to maintain a uniform spin configuration in the momentum space this property has been predicted to support an extraordinarily long spin lifetime of carriers promising for spintronics applications the pst is known to emerge when the strengths of two dominant spinorbit couplings the rashba and linear dresselhaus are equal this condition however is not trivial to achieve and requires tuning the rashba and dresselhaus parameters as has been demonstrated with semiconductor quantumwell structures here we predict that there exist a class of noncentrosymmetric bulk materials where the pst is enforced by the nonsymmorphic space group symmetry of the crystal around certain high symmetry points in the brillouin zone the sublattice degrees of freedom impose a constraint on the effective spinorbit field which remains independent of the momentum orientation and thus maintains the pst we illustrate this behavior using densityfunctional theory calculations for a handful of promising candidates accessible experimentally among them is the ferroelectric oxide biino3a wide band gap semiconductor which sustains a pst around the conduction band minimum our results broaden the range of materials which can be employed in spintronics | [['persistent', 'spin', 'texture', 'pst', 'is', 'the', 'property', 'of', 'some', 'materials', 'to', 'maintain', 'a', 'uniform', 'spin', 'configuration', 'in', 'the', 'momentum', 'space', 'this', 'property', 'has', 'been', 'predicted', 'to', 'support', 'an', 'extraordinarily', 'long', 'spin', 'lifetime', 'of', 'carriers', 'promising', 'for', 'spintronics', 'applications', 'the', 'pst', 'is', 'known', 'to', 'emerge', 'when', 'the', 'strengths', 'of', 'two', 'dominant', 'spinorbit', 'couplings', 'the', 'rashba', 'and', 'linear', 'dresselhaus', 'are', 'equal', 'this', 'condition', 'however', 'is', 'not', 'trivial', 'to', 'achieve', 'and', 'requires', 'tuning', 'the', 'rashba', 'and', 'dresselhaus', 'parameters', 'as', 'has', 'been', 'demonstrated', 'with', 'semiconductor', 'quantumwell', 'structures', 'here', 'we', 'predict', 'that', 'there', 'exist', 'a', 'class', 'of', 'noncentrosymmetric', 'bulk', 'materials', 'where', 'the', 'pst', 'is', 'enforced', 'by', 'the', 'nonsymmorphic', 'space', 'group', 'symmetry', 'of', 'the', 'crystal', 'around', 'certain', 'high', 'symmetry', 'points', 'in', 'the', 'brillouin', 'zone', 'the', 'sublattice', 'degrees', 'of', 'freedom', 'impose', 'a', 'constraint', 'on', 'the', 'effective', 'spinorbit', 'field', 'which', 'remains', 'independent', 'of', 'the', 'momentum', 'orientation', 'and', 'thus', 'maintains', 'the', 'pst', 'we', 'illustrate', 'this', 'behavior', 'using', 'densityfunctional', 'theory', 'calculations', 'for', 'a', 'handful', 'of', 'promising', 'candidates', 'accessible', 'experimentally', 'among', 'them', 'is', 'the', 'ferroelectric', 'oxide', 'biino3a', 'wide', 'band', 'gap', 'semiconductor', 'which', 'sustains', 'a', 'pst', 'around', 'the', 'conduction', 'band', 'minimum', 'our', 'results', 'broaden', 'the', 'range', 'of', 'materials', 'which', 'can', 'be', 'employed', 'in', 'spintronics']] | [-0.21528350853931685, 0.17844269609608118, -0.0007915324360834367, 0.009000127133669536, -0.1170566570786613, -0.17191147015805489, 0.05838928239953982, 0.42400851187842326, -0.2873419673250335, -0.303882180270617, 0.0222198482504095, -0.2532243586111209, -0.12435488660907597, 0.16908301960028396, 0.010824912878640815, 0.030494189974778766, -0.008748767114273658, -0.03753216419227577, -0.12449715683768206, -0.2076874785155731, 0.261121474125993, 0.016078060697666638, 0.31399996885152154, 0.10605216017285489, 0.0853001282194444, 0.011247340862819661, 0.14839777550830735, -0.01844169617860934, -0.1226778738477608, 0.07921886300736385, 0.27535057535848495, -0.08487988692067268, 0.22452179311301695, -0.41728604876031583, -0.24135153778677523, 0.05573906698837116, 0.12183983347845552, 0.16104370602089618, -0.075140622111052, -0.2623207689999208, 0.09526664954463888, -0.16623075551314387, -0.13789235299248345, -0.11434271533276243, 0.0067450343491021955, -0.037254421203153414, -0.24657672994370275, 0.022284180616944083, 0.06377140883629391, 0.06541181716628962, -0.08389225796947539, -0.12223446256108095, -0.1197764209912924, 0.08449490837029337, 0.07572680840351624, 0.04443491069924242, 0.12078831080683745, -0.11995200860601757, -0.1365808728797098, 0.414884333786462, -0.02721123663094187, -0.1743301643809567, 0.1690376240355377, -0.14725891622002799, -0.08792146767918703, 0.14857575508244142, 0.10119133782957032, 0.11350615676346172, -0.12580077979064253, 0.14229115398469044, -0.04153082611682917, 0.1557239190338872, 0.010583846554335655, 0.140263851220032, 0.2769714803069206, 0.18824251095462025, 0.0942089001353128, 0.10581817231762725, -0.10597901773978517, -0.07162289297164305, -0.2178478360527161, -0.18271435344962314, -0.28091454579060926, 0.05640444435864621, -0.07220078188485919, -0.16944766790406163, 0.44066994708441004, 0.15141108344462628, 0.13535965780644674, -0.0367099329693906, 0.22054633016195832, 0.08965020287533276, 0.1417135721979497, 0.04040994298100686, 0.30622375926995743, 0.1721844354373798, 0.05514939091319501, -0.25392676115795454, 0.068885136421292, -0.02388980327398365] |
1,803.02965 | A Multi-Objective Deep Reinforcement Learning Framework | This paper introduces a new scalable multi-objective deep reinforcement
learning (MODRL) framework based on deep Q-networks. We develop a
high-performance MODRL framework that supports both single-policy and
multi-policy strategies, as well as both linear and non-linear approaches to
action selection. The experimental results on two benchmark problems
(two-objective deep sea treasure environment and three-objective Mountain Car
problem) indicate that the proposed framework is able to find the
Pareto-optimal solutions effectively. The proposed framework is generic and
highly modularized, which allows the integration of different deep
reinforcement learning algorithms in different complex problem domains. This
therefore overcomes many disadvantages involved with standard multi-objective
reinforcement learning methods in the current literature. The proposed
framework acts as a testbed platform that accelerates the development of MODRL
for solving increasingly complicated multi-objective problems.
| cs.LG cs.AI stat.ML | this paper introduces a new scalable multiobjective deep reinforcement learning modrl framework based on deep qnetworks we develop a highperformance modrl framework that supports both singlepolicy and multipolicy strategies as well as both linear and nonlinear approaches to action selection the experimental results on two benchmark problems twoobjective deep sea treasure environment and threeobjective mountain car problem indicate that the proposed framework is able to find the paretooptimal solutions effectively the proposed framework is generic and highly modularized which allows the integration of different deep reinforcement learning algorithms in different complex problem domains this therefore overcomes many disadvantages involved with standard multiobjective reinforcement learning methods in the current literature the proposed framework acts as a testbed platform that accelerates the development of modrl for solving increasingly complicated multiobjective problems | [['this', 'paper', 'introduces', 'a', 'new', 'scalable', 'multiobjective', 'deep', 'reinforcement', 'learning', 'modrl', 'framework', 'based', 'on', 'deep', 'qnetworks', 'we', 'develop', 'a', 'highperformance', 'modrl', 'framework', 'that', 'supports', 'both', 'singlepolicy', 'and', 'multipolicy', 'strategies', 'as', 'well', 'as', 'both', 'linear', 'and', 'nonlinear', 'approaches', 'to', 'action', 'selection', 'the', 'experimental', 'results', 'on', 'two', 'benchmark', 'problems', 'twoobjective', 'deep', 'sea', 'treasure', 'environment', 'and', 'threeobjective', 'mountain', 'car', 'problem', 'indicate', 'that', 'the', 'proposed', 'framework', 'is', 'able', 'to', 'find', 'the', 'paretooptimal', 'solutions', 'effectively', 'the', 'proposed', 'framework', 'is', 'generic', 'and', 'highly', 'modularized', 'which', 'allows', 'the', 'integration', 'of', 'different', 'deep', 'reinforcement', 'learning', 'algorithms', 'in', 'different', 'complex', 'problem', 'domains', 'this', 'therefore', 'overcomes', 'many', 'disadvantages', 'involved', 'with', 'standard', 'multiobjective', 'reinforcement', 'learning', 'methods', 'in', 'the', 'current', 'literature', 'the', 'proposed', 'framework', 'acts', 'as', 'a', 'testbed', 'platform', 'that', 'accelerates', 'the', 'development', 'of', 'modrl', 'for', 'solving', 'increasingly', 'complicated', 'multiobjective', 'problems']] | [-0.0438849460460915, -0.02564316615826101, -0.08874422322514874, 0.06361309970907314, -0.15099126918357797, -0.1925157213518105, 0.011578602950066852, 0.4212469926860649, -0.2920033773916657, -0.3163874194433447, 0.07874795674979396, -0.20457418576017972, -0.2544082087656534, 0.23235827132157283, -0.09174189055920579, 0.13220860635556164, 0.11929738313028793, -0.07420140259273467, -0.023396804945150507, -0.23289957093948033, 0.3066995600675, 0.015374747913483588, 0.3848506484500831, 0.05233384347411629, 0.1681886434325861, 0.008826539478150153, 0.02396297492123267, 0.023819815289243707, -0.05542645027975368, 0.176968749236039, 0.3473106425299193, 0.23485757494199788, 0.4051587565918453, -0.4189882338687312, -0.22525499271432636, 0.07562949930797913, 0.1665327208393137, 0.07607337571153039, -0.08777904220005439, -0.3045269541471498, 0.052597617244686035, -0.175486639626115, -0.0339065326115815, -0.12859294004010735, -0.06148893263298305, -0.022889637271873653, -0.2916762644017581, -0.03504443409872238, 0.03178773124182044, -0.02856202921248041, -0.09374668615328119, -0.16718745599064277, 0.10122253320150776, 0.08504730109416414, 0.022177431444106332, 0.054167297937965486, 0.1390263946268533, -0.15634392129140906, -0.19344721607194515, 0.3534404227102641, -0.04052834758113022, -0.19370616017295106, 0.23682682792241394, 0.05669317978754407, -0.16503597809969506, 0.061939299706864404, 0.26484704840640916, 0.20345208469734644, -0.18535748634894844, 0.06486383280935115, -0.04754094913005247, 0.1218945986856852, -0.027219986060117662, -0.05583045284583932, 0.15963992686647543, 0.31545839708996937, 0.09092363838999518, 0.11365882112841064, -0.08095909607072826, -0.1778506754344562, -0.1966179566217079, -0.12427481283521047, -0.11275784297686187, -0.07470854658458848, -0.08929070472686362, -0.1621031842987577, 0.3521289115096806, 0.21450321636075387, 0.15892906257067807, 0.09658645184117631, 0.3684447745035868, 0.053809575877039606, 0.0776661722748031, 0.11433052233041963, 0.2023122241062083, 0.031314258587372024, 0.16338907839963213, -0.20886039259039535, 0.055159720470328466, 0.04743707535453723] |
1,803.02966 | Modulus p^2 congruences involving harmonic numbers | The harmonic number $H_k=\sum_{j=1}^k1/j(k=1,2,3\cdots)$ play an important
role in mathematics. Let $p>3$ be a prime. In this paper, we establish a number
of congruences with the form $\sum_{k=1}^{p-1}k^mH_k^n(\mod p^2)$ for
$m=1,2\cdots,p-2$ and $n=1,2,3$.
| math.CO | the harmonic number h_ksum_j1k1jk123cdots play an important role in mathematics let p3 be a prime in this paper we establish a number of congruences with the form sum_k1p1kmh_knmod p2 for m12cdotsp2 and n123 | [['the', 'harmonic', 'number', 'h_ksum_j1k1jk123cdots', 'play', 'an', 'important', 'role', 'in', 'mathematics', 'let', 'p3', 'be', 'a', 'prime', 'in', 'this', 'paper', 'we', 'establish', 'a', 'number', 'of', 'congruences', 'with', 'the', 'form', 'sum_k1p1kmh_knmod', 'p2', 'for', 'm12cdotsp2', 'and', 'n123']] | [-0.21476462843517463, 0.09096407265218052, -0.08763675497223934, 0.06012939926780139, -0.040968860313296315, -0.11994107877835632, -0.07084411764129375, 0.2711681951458255, -0.2358475426211953, -0.2992615674622357, 0.04309556876153996, -0.2609404160330693, -0.14946161626527707, 0.24190528641144435, -0.04762637826303641, -0.05086644955445081, -0.006834217168701192, 0.13281371674189965, 0.044981213131298624, -0.3011610807230075, 0.32385913530985516, -0.01415003469834725, 0.14434457054982583, 0.04577180896885693, -0.04188961756105224, 0.06249283510648335, 0.0568855557590723, -0.03082956684908519, -0.17257319648439687, 0.14707428396989902, 0.3829110811154048, 0.06233837809413671, 0.36298621371388434, -0.4544378856817881, -0.10077182299767931, 0.2749546290375292, 0.21143892932062347, -0.004557901993393898, -0.10507591525092722, -0.14167436895271143, 0.09470786452293396, -0.13412608922614405, -0.19393777940422297, -0.08030089996755123, 0.08116139937192202, 0.04137307380636533, -0.30989346392452716, 0.006502314067135254, 0.1526599844917655, 0.20374712270374098, -0.019658989940459528, -0.14617233897248905, 0.058401412020126976, 0.13044224722931783, 0.03142109674712022, 0.10184318373600641, -0.0391993952759852, -0.12229890400388589, -0.107548472036918, 0.39791954110066097, 0.00270849425966541, -0.2262236346801122, 0.030885330339272817, -0.18931911699473858, -0.23921819667642316, 0.0676041825984915, 0.20697150245929757, 0.11859703001876672, 0.0014919163503994545, 0.1325038360101947, -0.09871119984115163, 0.10576886107834677, 0.13375089544182023, 0.030038663620750108, 0.20638578881820044, 0.12410966499398152, 0.008660377284589535, 0.2001158108585514, -0.03322691296537717, 0.02993098720908165, -0.40202888747056326, -0.25832901370401185, -0.10094358244289954, 0.15061881402604438, -0.08848240181444757, -0.12188805292050044, 0.3472410546227669, 0.07544851054747899, 0.1603906669964393, 0.03957216407482823, 0.15918447617441417, 0.11057984392779568, -0.020219657135506473, 0.07693458725698292, 0.13722681816046436, 0.21225042740503947, 0.012968523520976305, -0.1496750132491191, -0.03072509329455594, 0.17096346312512953] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.