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.07767
|
Composite fermion Hall conductivity and the half-filled Landau level
|
We consider the Hall conductivity of composite fermions in the theory of
Halperin, Lee, and Read (HLR). We present a fully quantum mechanical numerical
calculation that shows, under suitable conditions, the HLR theory exhibits a
particle-hole symmetric dc electrical Hall response in the presence of quenched
disorder. Remarkably, this response of the HLR theory remains robust even when
the disorder range is of the order of the Fermi wavelength. We find that
deviations from particle-hole symmetric response can appear in the ac Hall
conductivity at frequencies sufficiently large compared to the inverse system
size. Our results agree with a recent semi-classical analysis by Wang et al.,
Phys. Rev. X 7, 031029 (2017) and complement the arguments based on the fully
quantum-mechanical model by Kumar et al., Phys. Rev. B 98, 11505 (2018). These
results provide further evidence that the HLR theory is compatible with an
emergent particle-hole symmetry.
|
cond-mat.str-el
|
we consider the hall conductivity of composite fermions in the theory of halperin lee and read hlr we present a fully quantum mechanical numerical calculation that shows under suitable conditions the hlr theory exhibits a particlehole symmetric dc electrical hall response in the presence of quenched disorder remarkably this response of the hlr theory remains robust even when the disorder range is of the order of the fermi wavelength we find that deviations from particlehole symmetric response can appear in the ac hall conductivity at frequencies sufficiently large compared to the inverse system size our results agree with a recent semiclassical analysis by wang et al phys rev x 7 031029 2017 and complement the arguments based on the fully quantummechanical model by kumar et al phys rev b 98 11505 2018 these results provide further evidence that the hlr theory is compatible with an emergent particlehole symmetry
|
[['we', 'consider', 'the', 'hall', 'conductivity', 'of', 'composite', 'fermions', 'in', 'the', 'theory', 'of', 'halperin', 'lee', 'and', 'read', 'hlr', 'we', 'present', 'a', 'fully', 'quantum', 'mechanical', 'numerical', 'calculation', 'that', 'shows', 'under', 'suitable', 'conditions', 'the', 'hlr', 'theory', 'exhibits', 'a', 'particlehole', 'symmetric', 'dc', 'electrical', 'hall', 'response', 'in', 'the', 'presence', 'of', 'quenched', 'disorder', 'remarkably', 'this', 'response', 'of', 'the', 'hlr', 'theory', 'remains', 'robust', 'even', 'when', 'the', 'disorder', 'range', 'is', 'of', 'the', 'order', 'of', 'the', 'fermi', 'wavelength', 'we', 'find', 'that', 'deviations', 'from', 'particlehole', 'symmetric', 'response', 'can', 'appear', 'in', 'the', 'ac', 'hall', 'conductivity', 'at', 'frequencies', 'sufficiently', 'large', 'compared', 'to', 'the', 'inverse', 'system', 'size', 'our', 'results', 'agree', 'with', 'a', 'recent', 'semiclassical', 'analysis', 'by', 'wang', 'et', 'al', 'phys', 'rev', 'x', '7', '031029', '2017', 'and', 'complement', 'the', 'arguments', 'based', 'on', 'the', 'fully', 'quantummechanical', 'model', 'by', 'kumar', 'et', 'al', 'phys', 'rev', 'b', '98', '11505', '2018', 'these', 'results', 'provide', 'further', 'evidence', 'that', 'the', 'hlr', 'theory', 'is', 'compatible', 'with', 'an', 'emergent', 'particlehole', 'symmetry']]
|
[-0.12647225788143807, 0.14672719811223692, -0.07505170689347161, -0.054065205628045974, -0.03592710865961311, -0.14128986112964786, 0.07295295244325208, 0.3145303103103213, -0.15809366005562145, -0.28184835110114864, 0.0013531941820050858, -0.2888432001943815, -0.22568154904021792, 0.1576166193635675, -0.08036905022542158, 0.040769049993473784, -0.03229601931924077, -0.07748137519368742, -0.09842163668498907, -0.2734864767631261, 0.21750658688499044, 0.0877925748960753, 0.32923874593888447, 0.06632413241927741, -0.005801349938910914, 0.06074441229120815, 0.0012454929002496886, 0.04853210673900321, -0.1472961626147468, 0.020026879200124987, 0.22999120521843944, -0.05679950998037135, 0.19021811634812452, -0.41364411896171227, -0.2045226162937406, 0.013038809663195112, 0.036291454472158056, 0.17494312718459595, -0.03238885934314729, -0.32728757329240493, 0.07929032533876088, -0.21130287865406439, -0.1575748088820646, -0.12223443339183314, 0.07758310698738245, -0.0617341803744027, -0.2776242653035546, 0.18656363195344194, 0.0829084474427549, 0.07694830260022659, -0.045572700720098606, -0.12167028708571619, -0.043428671767947916, -0.004436913664629747, -0.010058044244643708, 0.05624953435322474, 0.11260633301771285, -0.1046415665155047, -0.1567069281559208, 0.331485557841928, -0.05653791709074253, -0.13495375313604735, 0.21311851940596196, -0.1595770022768068, -0.09381889857109381, 0.13763407632558644, 0.089347083725941, 0.07764848994652498, -0.11196409771109259, 0.17493602607242942, -0.13961823625579375, 0.17744687748339333, 0.05072720904598548, 0.020197596542732767, 0.21347886955442086, 0.11013808909465546, -0.014252749120191454, 0.1040576640253389, -0.0845264205406101, -0.08472226032977669, -0.3223548611460177, -0.10699848822407322, -0.2157018710332859, 0.11043106050195478, 0.007209407102056677, -0.14519645304942172, 0.382966230381025, 0.1712042588919197, 0.19513656908414814, 0.042464663229933745, 0.20768892400170844, 0.1538418011320436, 0.0004230730816855874, 0.13010330767409034, 0.27693498867989697, 0.202855565709585, 0.12049237586723717, -0.297684665270188, -0.009182741335666522, 0.04990738160168267]
|
1,803.07768
|
Statistical Properties and Variations of LOS MIMO Channels at Millimeter
Wave Frequencies
|
Measurement results for millimeter wave LOS MIMO systems are presented with a
focus on time variation and multipath propagation. Different system setups are
used, including 2x2 and 3x3 MIMO, and involving different synchronization
procedures and front-ends. Furthermore, different propagation scenarios are
evaluated, covering a wide area of applications. The results show that the LOS
component carries significantly more power than the NLOS components, and that
frequency selectivity from front-ends should be taken into account when
designing these high bandwidth systems. Frequency offsets and other phase
variations due to transmit and receive oscillator differences are treated as
part of the channel and thus, depending on the synchronization setup, the MIMO
system exhibits different time variations, particularly in the case of
independent local oscillators. It is also observed that these systems
experience significant non-trivial long-term variations in terms of amplitude
and phase.
|
eess.SP cs.IT math.IT
|
measurement results for millimeter wave los mimo systems are presented with a focus on time variation and multipath propagation different system setups are used including 2x2 and 3x3 mimo and involving different synchronization procedures and frontends furthermore different propagation scenarios are evaluated covering a wide area of applications the results show that the los component carries significantly more power than the nlos components and that frequency selectivity from frontends should be taken into account when designing these high bandwidth systems frequency offsets and other phase variations due to transmit and receive oscillator differences are treated as part of the channel and thus depending on the synchronization setup the mimo system exhibits different time variations particularly in the case of independent local oscillators it is also observed that these systems experience significant nontrivial longterm variations in terms of amplitude and phase
|
[['measurement', 'results', 'for', 'millimeter', 'wave', 'los', 'mimo', 'systems', 'are', 'presented', 'with', 'a', 'focus', 'on', 'time', 'variation', 'and', 'multipath', 'propagation', 'different', 'system', 'setups', 'are', 'used', 'including', '2x2', 'and', '3x3', 'mimo', 'and', 'involving', 'different', 'synchronization', 'procedures', 'and', 'frontends', 'furthermore', 'different', 'propagation', 'scenarios', 'are', 'evaluated', 'covering', 'a', 'wide', 'area', 'of', 'applications', 'the', 'results', 'show', 'that', 'the', 'los', 'component', 'carries', 'significantly', 'more', 'power', 'than', 'the', 'nlos', 'components', 'and', 'that', 'frequency', 'selectivity', 'from', 'frontends', 'should', 'be', 'taken', 'into', 'account', 'when', 'designing', 'these', 'high', 'bandwidth', 'systems', 'frequency', 'offsets', 'and', 'other', 'phase', 'variations', 'due', 'to', 'transmit', 'and', 'receive', 'oscillator', 'differences', 'are', 'treated', 'as', 'part', 'of', 'the', 'channel', 'and', 'thus', 'depending', 'on', 'the', 'synchronization', 'setup', 'the', 'mimo', 'system', 'exhibits', 'different', 'time', 'variations', 'particularly', 'in', 'the', 'case', 'of', 'independent', 'local', 'oscillators', 'it', 'is', 'also', 'observed', 'that', 'these', 'systems', 'experience', 'significant', 'nontrivial', 'longterm', 'variations', 'in', 'terms', 'of', 'amplitude', 'and', 'phase']]
|
[-0.23793631168997048, 0.12331269270673927, -0.013185817186188485, 0.023625531311180177, -0.03215804328875882, -0.2009741013537028, 0.008941492418359433, 0.41491122149995396, -0.20917105471183148, -0.29780625020419915, 0.13013342308113351, -0.23988540960542326, -0.17171467906861965, 0.24187032776618642, -0.052470868676235634, 0.019936883123591542, 0.0863959210658712, -0.024309153113115045, -0.06130316434261788, -0.20769710327648291, 0.2927211542281189, 0.054085342230142226, 0.3364068661151188, 0.006489103816316596, 0.08903639185092678, 0.01737727739382535, -0.038459790682619704, 0.016828846266227108, -0.029308224890961094, 0.033389730847972844, 0.29655234933431657, 0.11988847296155915, 0.20499534724679377, -0.4150931085193796, -0.2852515646456076, 0.08149200596048363, 0.15219055546248064, 0.06530862685426005, -0.011509705047709368, -0.2983448617077166, 0.06428807218825179, -0.18179556173189276, -0.04323475730405854, -0.006784866104966827, -0.006012085688832615, 0.07579927198322756, -0.27269012405969467, 0.05907059821911389, 0.010556404142906622, 0.06698394706472754, -0.06016115726836558, -0.1655035176979644, 0.003680925826275987, 0.17537569352695884, 0.02805244284183053, -0.03503316470970666, 0.11946136654920078, -0.08433754861221782, -0.06440206476076388, 0.4000457084072488, -0.030729287409277665, -0.2181462108373775, 0.21260625806711947, -0.14101666558791684, -0.09580417457701905, 0.14953335100352497, 0.2633938307175413, 0.04269399830373004, -0.12627025748588494, -0.006712046510490057, 0.05395470719262708, 0.21590938515894648, 0.08770075043388975, 0.15321504822266954, 0.1946436771989933, 0.13361891438086917, 0.07612348150781015, 0.11000415090363407, -0.1437280290826623, -0.12301571962722976, -0.23705125905440322, -0.07946152807645766, -0.14051767540097768, -0.024397995159649456, -0.11056422626373075, -0.08223140038815992, 0.4021933561190963, 0.14924858950211534, 0.1391497551895944, 0.06112808174886075, 0.34728035725919265, 0.14309798546185318, 0.08085243381293757, 0.04917445677731718, 0.2382381716684904, 0.12265636145270296, 0.15667913359190735, -0.22701192635244558, 0.049091260930124135, -0.08401005488454498]
|
1,803.07769
|
Investigation of activation cross sections for deuteron induced
reactions on strontium up to 50 MeV
|
Excitation functions were measured for the natSr(d,x)88,87m,87g,86g,85gY,
87m,85g,83g,82Sr, 86g,84g,83,82m, 81gRb reactions by the stacked foil
activation technique and high-resolution gamma-spectrometry up to 50 MeV. We
present the first experimental activation cross section data for all
investigated reactions. Our experimental data are compared with the TALYS code
results as available in the TENDL-2015 on-line library. Use of deuteron induced
reactions on Sr for production of medical isotopes is discussed.
|
nucl-ex
|
excitation functions were measured for the natsrdx8887m87g86g85gy 87m85g83g82sr 86g84g8382m 81grb reactions by the stacked foil activation technique and highresolution gammaspectrometry up to 50 mev we present the first experimental activation cross section data for all investigated reactions our experimental data are compared with the talys code results as available in the tendl2015 online library use of deuteron induced reactions on sr for production of medical isotopes is discussed
|
[['excitation', 'functions', 'were', 'measured', 'for', 'the', 'natsrdx8887m87g86g85gy', '87m85g83g82sr', '86g84g8382m', '81grb', 'reactions', 'by', 'the', 'stacked', 'foil', 'activation', 'technique', 'and', 'highresolution', 'gammaspectrometry', 'up', 'to', '50', 'mev', 'we', 'present', 'the', 'first', 'experimental', 'activation', 'cross', 'section', 'data', 'for', 'all', 'investigated', 'reactions', 'our', 'experimental', 'data', 'are', 'compared', 'with', 'the', 'talys', 'code', 'results', 'as', 'available', 'in', 'the', 'tendl2015', 'online', 'library', 'use', 'of', 'deuteron', 'induced', 'reactions', 'on', 'sr', 'for', 'production', 'of', 'medical', 'isotopes', 'is', 'discussed']]
|
[0.045545625009253854, 0.12207227946055355, 0.018559641830506735, 0.08138527940354834, 0.03308391451855641, -0.11438441800419241, 0.04977992218118743, 0.44382334337569773, -0.2118678428523708, -0.30508786236168817, -0.022288695459792507, -0.4051539899519412, 0.003444485424552113, 0.2620806711820478, 0.08546512998873368, 0.13350679159339052, 0.1619275426164677, 0.002152977242076304, -0.013864776541595347, -0.23319388087838888, 0.29414171889948193, 0.18021520260663237, 0.2825591677828925, 0.14546321849775268, 0.057147012132190866, 0.0034872157339123078, -0.039644843071982905, -0.10980140892206691, -0.15115596540272236, 0.13360515020031016, 0.33701031938835513, 0.11636314314819174, 0.09173029527300969, -0.4432392629387323, -0.1995472735579824, -6.130621477495879e-05, 0.1089094375129207, 0.1230904956755694, -0.14630911125459534, -0.26170934941910673, 0.10001146629656432, -0.21078264211246278, -0.01980777197968564, -0.11224511085310951, 0.010617863568768371, 0.0985800805137842, -0.2952870026056189, 0.030064746395510156, -0.08014472207287326, 0.13494933535184828, -0.14262937935927766, -0.2624812868598383, -0.028560086186189437, 0.07744514083606191, 0.01465352849845658, 0.03794712579838233, 0.19787182682921411, -0.05743689874361735, -0.13566342445847113, 0.3628922229545424, -0.04677790110508795, -0.09776563726336462, 0.08501613060070667, -0.08618989236856578, -0.1356237756608607, 0.17579213951830752, 0.20013439480680972, 0.14683330637853942, -0.21313678412116133, 0.020288984701437585, 0.024135750034474768, 0.16639696975107654, 0.10886792753444752, -0.05460011318064062, 0.025506701203994453, 0.24071004977849952, -0.10339012868644204, 0.11367589222390961, -0.1847446065476106, -0.03086001781775849, -0.3092382447212003, -0.10479700897121802, -0.10536052001589269, 0.025114655243669404, 0.01056906508188149, -0.06767207264101671, 0.34111914021195844, 0.09262005931668682, 0.2144177414375008, 0.015315695462049916, 0.32665150237153284, 0.03983135767339263, 0.11218658863072051, 0.028475072984292638, 0.2660634407075122, 0.15501215965196025, 0.1279940944223199, -0.19108733200846473, 0.10179134928330313, -0.03410982720015454]
|
1,803.0777
|
Emergence of grid-like representations by training recurrent neural
networks to perform spatial localization
|
Decades of research on the neural code underlying spatial navigation have
revealed a diverse set of neural response properties. The Entorhinal Cortex
(EC) of the mammalian brain contains a rich set of spatial correlates,
including grid cells which encode space using tessellating patterns. However,
the mechanisms and functional significance of these spatial representations
remain largely mysterious. As a new way to understand these neural
representations, we trained recurrent neural networks (RNNs) to perform
navigation tasks in 2D arenas based on velocity inputs. Surprisingly, we find
that grid-like spatial response patterns emerge in trained networks, along with
units that exhibit other spatial correlates, including border cells and
band-like cells. All these different functional types of neurons have been
observed experimentally. The order of the emergence of grid-like and border
cells is also consistent with observations from developmental studies.
Together, our results suggest that grid cells, border cells and others as
observed in EC may be a natural solution for representing space efficiently
given the predominant recurrent connections in the neural circuits.
|
q-bio.NC cs.AI cs.NE stat.ML
|
decades of research on the neural code underlying spatial navigation have revealed a diverse set of neural response properties the entorhinal cortex ec of the mammalian brain contains a rich set of spatial correlates including grid cells which encode space using tessellating patterns however the mechanisms and functional significance of these spatial representations remain largely mysterious as a new way to understand these neural representations we trained recurrent neural networks rnns to perform navigation tasks in 2d arenas based on velocity inputs surprisingly we find that gridlike spatial response patterns emerge in trained networks along with units that exhibit other spatial correlates including border cells and bandlike cells all these different functional types of neurons have been observed experimentally the order of the emergence of gridlike and border cells is also consistent with observations from developmental studies together our results suggest that grid cells border cells and others as observed in ec may be a natural solution for representing space efficiently given the predominant recurrent connections in the neural circuits
|
[['decades', 'of', 'research', 'on', 'the', 'neural', 'code', 'underlying', 'spatial', 'navigation', 'have', 'revealed', 'a', 'diverse', 'set', 'of', 'neural', 'response', 'properties', 'the', 'entorhinal', 'cortex', 'ec', 'of', 'the', 'mammalian', 'brain', 'contains', 'a', 'rich', 'set', 'of', 'spatial', 'correlates', 'including', 'grid', 'cells', 'which', 'encode', 'space', 'using', 'tessellating', 'patterns', 'however', 'the', 'mechanisms', 'and', 'functional', 'significance', 'of', 'these', 'spatial', 'representations', 'remain', 'largely', 'mysterious', 'as', 'a', 'new', 'way', 'to', 'understand', 'these', 'neural', 'representations', 'we', 'trained', 'recurrent', 'neural', 'networks', 'rnns', 'to', 'perform', 'navigation', 'tasks', 'in', '2d', 'arenas', 'based', 'on', 'velocity', 'inputs', 'surprisingly', 'we', 'find', 'that', 'gridlike', 'spatial', 'response', 'patterns', 'emerge', 'in', 'trained', 'networks', 'along', 'with', 'units', 'that', 'exhibit', 'other', 'spatial', 'correlates', 'including', 'border', 'cells', 'and', 'bandlike', 'cells', 'all', 'these', 'different', 'functional', 'types', 'of', 'neurons', 'have', 'been', 'observed', 'experimentally', 'the', 'order', 'of', 'the', 'emergence', 'of', 'gridlike', 'and', 'border', 'cells', 'is', 'also', 'consistent', 'with', 'observations', 'from', 'developmental', 'studies', 'together', 'our', 'results', 'suggest', 'that', 'grid', 'cells', 'border', 'cells', 'and', 'others', 'as', 'observed', 'in', 'ec', 'may', 'be', 'a', 'natural', 'solution', 'for', 'representing', 'space', 'efficiently', 'given', 'the', 'predominant', 'recurrent', 'connections', 'in', 'the', 'neural', 'circuits']]
|
[-0.09705579514231752, 0.10708533495301654, -0.016512984370210152, 0.07755046690992244, -0.07177158115048181, -0.15316080140936025, 0.031803436941631576, 0.45514473766088487, -0.2725391479976037, -0.2841649046222515, 0.05063589843647445, -0.26392534170847604, -0.3068699395284057, 0.17699011472629053, -0.09168762040105374, 0.029783402906854033, 0.0559920898919432, 0.03614640813868712, -0.007946912241716156, -0.21723444191328087, 0.26799315856221845, 0.01490179821574951, 0.32897153080095237, -0.05037222165098201, 0.13097652855931835, -0.10393865229014088, -0.0326802455518833, 0.02128166371703093, -0.06072547454451149, 0.18134837206179166, 0.28586928966482555, 0.1481219419329564, 0.2633004521430634, -0.5323351770748987, -0.2983256478136515, 0.08248680358040421, 0.17106732228113447, 0.06295927128795643, -0.007968548086800557, -0.273677021489643, 0.0904648211226552, -0.11267038530067486, -0.0489908028198817, -0.11895192676319685, 0.02579747330506935, 0.05325012192171177, -0.2193750707049142, 0.05308929690115346, 0.0431900712853188, 0.11306337314000463, -0.0915259707486257, -0.11013585323029582, -0.056245238457203785, 0.21079986923483804, 0.009239912028972279, 0.035163907260935316, 0.14993865874815074, -0.15418175806219497, -0.1578852559248095, 0.30850619944360325, 0.028592455085120438, -0.18264958972397247, 0.2495176537304788, -0.1277730276085683, -0.16161341958350556, 0.09999727195074015, 0.21265012088286525, 0.04869611641419504, -0.15134043019977125, 0.00640296114690821, -0.06707893591511119, 0.18823084626757705, 0.08444306366145611, 0.06602290753987344, 0.22327122096218827, 0.26186468799543733, -0.0018731143818620374, 0.08407188849078547, -0.12219019775443217, -0.10852671768173903, -0.19293743324849535, -0.08739658667541603, -0.13351433584261138, -0.0023141764730954654, -0.11069093195221606, -0.18068457081749598, 0.4437955221873434, 0.13800315950408248, 0.23476819540100063, 0.08886217202833745, 0.24149246795568616, 0.002820808208472205, 0.18720764590098576, 0.06431950908907524, 0.15980437642292064, 0.10699044329196433, 0.125471936382682, -0.18333512737744434, 0.12357998531866435, 0.029575672842945683]
|
1,803.07771
|
$\rho$-hot Lexicon Embedding-based Two-level LSTM for Sentiment Analysis
|
Sentiment analysis is a key component in various text mining applications.
Numerous sentiment classification techniques, including conventional and deep
learning-based methods, have been proposed in the literature. In most existing
methods, a high-quality training set is assumed to be given. Nevertheless,
constructing a high-quality training set that consists of highly accurate
labels is challenging in real applications. This difficulty stems from the fact
that text samples usually contain complex sentiment representations, and their
annotation is subjective. We address this challenge in this study by leveraging
a new labeling strategy and utilizing a two-level long short-term memory
network to construct a sentiment classifier. Lexical cues are useful for
sentiment analysis, and they have been utilized in conventional studies. For
example, polar and privative words play important roles in sentiment analysis.
A new encoding strategy, that is, $\rho$-hot encoding, is proposed to alleviate
the drawbacks of one-hot encoding and thus effectively incorporate useful
lexical cues. We compile three Chinese data sets on the basis of our label
strategy and proposed methodology. Experiments on the three data sets
demonstrate that the proposed method outperforms state-of-the-art algorithms.
|
cs.CL
|
sentiment analysis is a key component in various text mining applications numerous sentiment classification techniques including conventional and deep learningbased methods have been proposed in the literature in most existing methods a highquality training set is assumed to be given nevertheless constructing a highquality training set that consists of highly accurate labels is challenging in real applications this difficulty stems from the fact that text samples usually contain complex sentiment representations and their annotation is subjective we address this challenge in this study by leveraging a new labeling strategy and utilizing a twolevel long shortterm memory network to construct a sentiment classifier lexical cues are useful for sentiment analysis and they have been utilized in conventional studies for example polar and privative words play important roles in sentiment analysis a new encoding strategy that is rhohot encoding is proposed to alleviate the drawbacks of onehot encoding and thus effectively incorporate useful lexical cues we compile three chinese data sets on the basis of our label strategy and proposed methodology experiments on the three data sets demonstrate that the proposed method outperforms stateoftheart algorithms
|
[['sentiment', 'analysis', 'is', 'a', 'key', 'component', 'in', 'various', 'text', 'mining', 'applications', 'numerous', 'sentiment', 'classification', 'techniques', 'including', 'conventional', 'and', 'deep', 'learningbased', 'methods', 'have', 'been', 'proposed', 'in', 'the', 'literature', 'in', 'most', 'existing', 'methods', 'a', 'highquality', 'training', 'set', 'is', 'assumed', 'to', 'be', 'given', 'nevertheless', 'constructing', 'a', 'highquality', 'training', 'set', 'that', 'consists', 'of', 'highly', 'accurate', 'labels', 'is', 'challenging', 'in', 'real', 'applications', 'this', 'difficulty', 'stems', 'from', 'the', 'fact', 'that', 'text', 'samples', 'usually', 'contain', 'complex', 'sentiment', 'representations', 'and', 'their', 'annotation', 'is', 'subjective', 'we', 'address', 'this', 'challenge', 'in', 'this', 'study', 'by', 'leveraging', 'a', 'new', 'labeling', 'strategy', 'and', 'utilizing', 'a', 'twolevel', 'long', 'shortterm', 'memory', 'network', 'to', 'construct', 'a', 'sentiment', 'classifier', 'lexical', 'cues', 'are', 'useful', 'for', 'sentiment', 'analysis', 'and', 'they', 'have', 'been', 'utilized', 'in', 'conventional', 'studies', 'for', 'example', 'polar', 'and', 'privative', 'words', 'play', 'important', 'roles', 'in', 'sentiment', 'analysis', 'a', 'new', 'encoding', 'strategy', 'that', 'is', 'rhohot', 'encoding', 'is', 'proposed', 'to', 'alleviate', 'the', 'drawbacks', 'of', 'onehot', 'encoding', 'and', 'thus', 'effectively', 'incorporate', 'useful', 'lexical', 'cues', 'we', 'compile', 'three', 'chinese', 'data', 'sets', 'on', 'the', 'basis', 'of', 'our', 'label', 'strategy', 'and', 'proposed', 'methodology', 'experiments', 'on', 'the', 'three', 'data', 'sets', 'demonstrate', 'that', 'the', 'proposed', 'method', 'outperforms', 'stateoftheart', 'algorithms']]
|
[-0.0342805873762137, -0.02462031442584542, -0.07016728915665196, 0.09836241837850777, -0.1630576478429293, -0.16326622985231365, 0.04937452488985345, 0.4573751288924099, -0.25285080219143025, -0.3039990563012495, 0.09445582051151716, -0.30802497635106685, -0.19505194671843099, 0.2218957979563149, -0.1359171529264493, 0.07488800096775801, 0.13855416627371817, 0.026911266526279363, -0.019812685867786943, -0.28600472611766203, 0.32087597954189867, 0.005081462685259327, 0.4069540543090655, 0.01100201764560783, 0.1144865916531214, -0.046165277675895317, -0.11597107990081448, -0.009741899031291598, -0.023095137718325297, 0.20548777676120564, 0.3933297584749223, 0.2292570160105001, 0.3519903796645221, -0.3849470703270883, -0.25374624592210915, 0.08208628099679288, 0.16285098356822536, 0.1521239355823941, -0.06201419309190042, -0.3215422086798437, 0.11150790131342139, -0.16553457290350937, 0.06252104232540528, -0.20294309504656893, 0.014395552342603219, -0.01562841576575533, -0.26749079241623164, 0.028489124151274758, 0.10264242096586688, 0.09091538938986991, -0.041069152878175454, -0.14880708201778076, 0.06803775115713004, 0.190001311045634, 0.06061730351175557, 0.041804535427640156, 0.0976711949860955, -0.149120883464309, -0.18005279409416144, 0.3629410952658943, -0.04163849362537512, -0.24340822465861864, 0.19093595559384613, 0.0033967000411730774, -0.21404560149559823, 0.09895516411293277, 0.2184744990116901, 0.12794766621664166, -0.18334180147911922, 0.02372299340291165, -0.05130543938364566, 0.22712777400304415, 0.06534317758536347, 0.013987630703460775, 0.18855694482277935, 0.2807793495919329, -0.001165887837437141, 0.11244951478702155, -0.11636132975906463, -0.034190962820452794, -0.18711015756900592, -0.09571169843877607, -0.19812691612915234, -0.04623118241864915, -0.09576040088497835, -0.1464747617751854, 0.39603854551427686, 0.2312577470406396, 0.17727816184128517, 0.039157033442565915, 0.35483712795221384, 0.014620585174933951, 0.11862655636051783, 0.06987058906494356, 0.14188322486054894, -0.007094207954289423, 0.1351262775548214, -0.15506763938230395, 0.11970232955684361, 0.06307657237051477]
|
1,803.07772
|
Cross-Layer Energy Efficient Resource Allocation in PD-NOMA based
H-CRANs: Implementation via GPU
|
In this paper, we propose a cross layer energy efficient resource allocation
and remote radio head (RRH) selection algorithm for heterogeneous traffic in
power domain - non-orthogonal multiple access (PD-NOMA) based heterogeneous
cloud radio access networks (H-CRANs). The main aim is to maximize the EE of
the elastic users subject to the average delay constraint of the streaming
users and the constraints, RRH selection, subcarrier, transmit power and
successive interference cancellation. The considered optimization problem is
non-convex, NP-hard and intractable. To solve this problem, we transform the
fractional objective function into a subtractive form. Then, we utilize
successive convex approximation approach. Moreover, in order to increase the
processing speed, we introduce a framework for accelerating the successive
convex approximation for low complexity with the Lagrangian method on graphics
processing unit. Furthermore, in order to show the optimality gap of the
proposed successive convex approximation approach, we solve the proposed
optimization problem by applying an optimal method based on the monotonic
optimization. Studying different scenarios show that by using both PD-NOMA
technique and H-CRAN, the system energy efficiency is improved.
|
eess.SP cs.IT math.IT
|
in this paper we propose a cross layer energy efficient resource allocation and remote radio head rrh selection algorithm for heterogeneous traffic in power domain nonorthogonal multiple access pdnoma based heterogeneous cloud radio access networks hcrans the main aim is to maximize the ee of the elastic users subject to the average delay constraint of the streaming users and the constraints rrh selection subcarrier transmit power and successive interference cancellation the considered optimization problem is nonconvex nphard and intractable to solve this problem we transform the fractional objective function into a subtractive form then we utilize successive convex approximation approach moreover in order to increase the processing speed we introduce a framework for accelerating the successive convex approximation for low complexity with the lagrangian method on graphics processing unit furthermore in order to show the optimality gap of the proposed successive convex approximation approach we solve the proposed optimization problem by applying an optimal method based on the monotonic optimization studying different scenarios show that by using both pdnoma technique and hcran the system energy efficiency is improved
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'cross', 'layer', 'energy', 'efficient', 'resource', 'allocation', 'and', 'remote', 'radio', 'head', 'rrh', 'selection', 'algorithm', 'for', 'heterogeneous', 'traffic', 'in', 'power', 'domain', 'nonorthogonal', 'multiple', 'access', 'pdnoma', 'based', 'heterogeneous', 'cloud', 'radio', 'access', 'networks', 'hcrans', 'the', 'main', 'aim', 'is', 'to', 'maximize', 'the', 'ee', 'of', 'the', 'elastic', 'users', 'subject', 'to', 'the', 'average', 'delay', 'constraint', 'of', 'the', 'streaming', 'users', 'and', 'the', 'constraints', 'rrh', 'selection', 'subcarrier', 'transmit', 'power', 'and', 'successive', 'interference', 'cancellation', 'the', 'considered', 'optimization', 'problem', 'is', 'nonconvex', 'nphard', 'and', 'intractable', 'to', 'solve', 'this', 'problem', 'we', 'transform', 'the', 'fractional', 'objective', 'function', 'into', 'a', 'subtractive', 'form', 'then', 'we', 'utilize', 'successive', 'convex', 'approximation', 'approach', 'moreover', 'in', 'order', 'to', 'increase', 'the', 'processing', 'speed', 'we', 'introduce', 'a', 'framework', 'for', 'accelerating', 'the', 'successive', 'convex', 'approximation', 'for', 'low', 'complexity', 'with', 'the', 'lagrangian', 'method', 'on', 'graphics', 'processing', 'unit', 'furthermore', 'in', 'order', 'to', 'show', 'the', 'optimality', 'gap', 'of', 'the', 'proposed', 'successive', 'convex', 'approximation', 'approach', 'we', 'solve', 'the', 'proposed', 'optimization', 'problem', 'by', 'applying', 'an', 'optimal', 'method', 'based', 'on', 'the', 'monotonic', 'optimization', 'studying', 'different', 'scenarios', 'show', 'that', 'by', 'using', 'both', 'pdnoma', 'technique', 'and', 'hcran', 'the', 'system', 'energy', 'efficiency', 'is', 'improved']]
|
[-0.17903212888566566, -0.04040241077157415, -0.05973404833492352, 0.06286981596488485, -0.11285262257828681, -0.1834024959636245, 0.12079299871058967, 0.4236548352944717, -0.33623264514412105, -0.29474433689911883, 0.0702992089111044, -0.20415385180477347, -0.184446340369249, 0.13044860638322286, -0.0890160239866694, 0.1197182701958155, 0.04789097666128256, -0.01966050885267179, -0.04692738109890874, -0.2686348119842182, 0.2731655928949836, 0.08455988480395564, 0.3699924017491049, 0.05263357942798332, 0.11541055826132782, 0.049194704303047045, -0.023677537617995667, 0.006699131287665766, -0.07020447796866791, 0.13551261471035064, 0.3019061290614537, 0.20570357333544348, 0.34404889080840884, -0.4620894927510552, -0.20341358318652833, 0.09772059298905261, 0.16791779180109667, 0.01525450825790634, -0.04628855628196903, -0.2182860851256449, 0.11775783831554497, -0.1875336164863011, -0.01626218772713053, -0.020337802483543253, -0.08523448771179727, 0.03786982416850253, -0.36204334068650984, 0.0423228285181221, -0.013425029071278117, -0.029834248724634225, -0.10932584464277946, -0.10071180249483251, 0.10666191145605042, 0.08941996183764357, 0.027887934916476155, 0.037027487558773144, 0.10566530530759541, -0.07181284968280809, -0.1406223997891369, 0.38188237123704105, 0.012628664173646255, -0.23713916685665026, 0.1363066721660493, -0.03794091433192488, -0.13257868757623176, 0.15728889268645074, 0.28887924130252574, 0.12479404142889026, -0.18730204860324018, 0.05532369252508166, -0.0013152363237903945, 0.14097923291009967, 0.08203763755959238, 0.045078137302195675, 0.11880633873169133, 0.17924715503736327, 0.17681635412377086, 0.19888878934048745, -0.100454431693619, -0.11503309673326237, -0.2189385586093164, -0.11555942151992414, -0.22139697347040382, -0.028583108001451394, -0.10014172363462218, -0.09256699372846842, 0.37762771961096087, 0.12945495023695605, 0.13596577447410044, 0.11611995064873207, 0.4301965763645895, 0.16455632913072876, 0.0383649022361588, 0.14806427384119775, 0.16540545122593306, 0.08430679035902787, 0.1344641360001435, -0.2914437678723669, 0.024457653094962072, 0.0719527329653083]
|
1,803.07773
|
Looking for Bird Nests: Identifying Stay Points with Bounded Gaps
|
A stay point of a moving entity is a region in which it spends a significant
amount of time. In this paper, we identify all stay points of an entity in a
certain time interval, where the entity is allowed to leave the region but it
should return within a given time limit. This definition of stay points seems
more natural in many applications of trajectory analysis than those that do not
limit the time of entity's absence from the region. We present an $O(n \log n)$
algorithm for trajectories in $R^1$ with $n$ vertices and a $(1 +
\epsilon)$-approximation algorithm for trajectories in $R^2$ to identify all
such stay points. Our algorithm runs in $O(kn^2)$, where $k$ depends on
$\epsilon$ and the ratio of the duration of the trajectory to the allowed gap
time.
|
cs.CG
|
a stay point of a moving entity is a region in which it spends a significant amount of time in this paper we identify all stay points of an entity in a certain time interval where the entity is allowed to leave the region but it should return within a given time limit this definition of stay points seems more natural in many applications of trajectory analysis than those that do not limit the time of entitys absence from the region we present an on log n algorithm for trajectories in r1 with n vertices and a 1 epsilonapproximation algorithm for trajectories in r2 to identify all such stay points our algorithm runs in okn2 where k depends on epsilon and the ratio of the duration of the trajectory to the allowed gap time
|
[['a', 'stay', 'point', 'of', 'a', 'moving', 'entity', 'is', 'a', 'region', 'in', 'which', 'it', 'spends', 'a', 'significant', 'amount', 'of', 'time', 'in', 'this', 'paper', 'we', 'identify', 'all', 'stay', 'points', 'of', 'an', 'entity', 'in', 'a', 'certain', 'time', 'interval', 'where', 'the', 'entity', 'is', 'allowed', 'to', 'leave', 'the', 'region', 'but', 'it', 'should', 'return', 'within', 'a', 'given', 'time', 'limit', 'this', 'definition', 'of', 'stay', 'points', 'seems', 'more', 'natural', 'in', 'many', 'applications', 'of', 'trajectory', 'analysis', 'than', 'those', 'that', 'do', 'not', 'limit', 'the', 'time', 'of', 'entitys', 'absence', 'from', 'the', 'region', 'we', 'present', 'an', 'on', 'log', 'n', 'algorithm', 'for', 'trajectories', 'in', 'r1', 'with', 'n', 'vertices', 'and', 'a', '1', 'epsilonapproximation', 'algorithm', 'for', 'trajectories', 'in', 'r2', 'to', 'identify', 'all', 'such', 'stay', 'points', 'our', 'algorithm', 'runs', 'in', 'okn2', 'where', 'k', 'depends', 'on', 'epsilon', 'and', 'the', 'ratio', 'of', 'the', 'duration', 'of', 'the', 'trajectory', 'to', 'the', 'allowed', 'gap', 'time']]
|
[-0.16615895636522196, 0.0938745443789556, -0.09319078758247752, 0.013366894459407499, -0.020443373151234727, -0.1310599032379409, 0.1389537754591551, 0.3691329936594216, -0.24295023715457142, -0.31971476143643035, 0.09927850829892611, -0.29047921999121334, -0.07496174169468012, 0.17295920791246913, -0.06789344297300628, 0.011199955192547458, 0.06039462403964196, 0.14817090488886878, -0.016879771744012277, -0.24590184850924052, 0.26068177089484323, 0.03986320489628324, 0.19402491878335879, 0.016111017594030545, 0.09344841422054416, -0.007798650795454855, 0.008496554641386688, 0.01390960633949335, -0.10800978510299351, 0.053925778980909, 0.25940940352573766, 0.1341520890197369, 0.31581913285068614, -0.37988810069466344, -0.1669599887317241, 0.16981582395704603, 0.1655336099801891, 0.0789541320192433, 0.014863177337627266, -0.2452065187068517, 0.09221324861508363, -0.08972190690240753, -0.11747277927508494, 0.006451321605926574, 0.0972447993734212, -0.011797898810412457, -0.26703593612704146, 0.03856752294379828, 0.06567628711545423, 0.008440514415052525, -0.052969080793893716, -0.0728460034431973, 0.026900966820279277, 0.16748370314642452, 0.04956564838900717, 0.09150979526813573, 0.11255960458013882, -0.10881321858128172, -0.0756374194300664, 0.4031672868599643, -0.03719921738707283, -0.17762469181638044, 0.1604303440162495, -0.186931384199146, -0.1424894200450282, 0.1552460721290823, 0.17383186550074214, 0.18540346558525492, -0.09981032981495581, 0.09986365268809665, -0.054185474194141464, 0.2117989768159885, 0.0836364905464588, 0.01878560483003897, 0.18467417161967328, 0.1564505057298203, 0.13787695926174506, 0.08661259210029089, -0.10089844419992765, -0.1271944120309121, -0.34543034417638135, -0.17300730254918115, -0.1760777901282965, 0.01853182914055651, -0.10040915671561379, -0.18233332547373068, 0.37055100706308636, 0.1787378960706071, 0.29790707888714135, 0.09804393308073867, 0.25258032814947085, 0.09338571346076484, 0.03697556905003626, 0.16511739012020737, 0.17822856748990937, -0.025339259543636843, 0.09776238635627192, -0.1579318067680961, 0.0786803327327066, 0.05567470472479767]
|
1,803.07774
|
Measurement of Time-dependent $CP$ Asymmetries in $B^{0}\to K_S^0 \eta
\gamma$ Decays
|
We report a measurement of time-dependent $CP$ violation parameters in ${B^0
\to K_S^0 \eta \gamma}$ decays. The study is based on a data sample, containing
${772 \times 10^6 B\bar{B}}$ pairs, that was collected at the $\Upsilon(4S)$
resonance with the Belle detector at the KEKB asymmetric-energy $e^+ e^-$
collider. We obtain the $CP$ violation parameters of ${{\cal S} = -1.32 \pm
0.77 {\rm (stat.)} \pm 0.36{\rm (syst.)}}$ and ${{\cal A} = -0.48 \pm 0.41 {\rm
(stat.)} \pm 0.07{\rm (syst.)}}$ for the invariant mass of the $K_S^0 \eta$
system up to 2.1 GeV/$c^2$.
|
hep-ex
|
we report a measurement of timedependent cp violation parameters in b0 to k_s0 eta gamma decays the study is based on a data sample containing 772 times 106 bbarb pairs that was collected at the upsilon4s resonance with the belle detector at the kekb asymmetricenergy e e collider we obtain the cp violation parameters of cal s 132 pm 077 rm stat pm 036rm syst and cal a 048 pm 041 rm stat pm 007rm syst for the invariant mass of the k_s0 eta system up to 21 gevc2
|
[['we', 'report', 'a', 'measurement', 'of', 'timedependent', 'cp', 'violation', 'parameters', 'in', 'b0', 'to', 'k_s0', 'eta', 'gamma', 'decays', 'the', 'study', 'is', 'based', 'on', 'a', 'data', 'sample', 'containing', '772', 'times', '106', 'bbarb', 'pairs', 'that', 'was', 'collected', 'at', 'the', 'upsilon4s', 'resonance', 'with', 'the', 'belle', 'detector', 'at', 'the', 'kekb', 'asymmetricenergy', 'e', 'e', 'collider', 'we', 'obtain', 'the', 'cp', 'violation', 'parameters', 'of', 'cal', 's', '132', 'pm', '077', 'rm', 'stat', 'pm', '036rm', 'syst', 'and', 'cal', 'a', '048', 'pm', '041', 'rm', 'stat', 'pm', '007rm', 'syst', 'for', 'the', 'invariant', 'mass', 'of', 'the', 'k_s0', 'eta', 'system', 'up', 'to', '21', 'gevc2']]
|
[-0.16397955621346488, 0.19518699711081625, -0.047565359884509065, 0.009496668387129474, 0.012628560701128224, -0.1413044191029822, 0.08218643134700712, 0.22705778122033882, -0.10275223067608373, -0.367658295936283, -0.05213016779670471, -0.5108615575872105, 0.1590204388331408, 0.14857433879501775, 0.017882573193517225, 0.15298159402292008, 0.1279781405364388, -0.005799803585777509, -0.12566168724837573, -0.12440674495080421, 0.07637551259891741, 0.016227522736479497, 0.2571507066263464, 0.034067388367036294, 0.03481004668544207, -0.020689058195178706, 0.0021796543151140213, -0.1628699178604045, -0.2808816972883296, 0.011605266899127385, 0.22399741181054678, 0.09580123755845359, 0.07938915421522555, -0.18617961524633475, 0.12663388262963157, 0.24560083906251895, 0.1353515866426644, -0.10473741796509974, 0.04894400197455938, -0.46314679863380975, 0.24530748432052546, -0.19557224016304758, -0.03589868738219656, 0.05679783920875226, 0.15313449575854787, -0.2081261569361106, -0.4655097356901087, 0.25811646819842615, -0.15357308202669367, 0.12423265661145079, 0.023075275717238927, -0.30889205822464205, -0.04947738484318914, -0.13931650703708673, 0.03490752895662411, 0.2002642733264372, 0.20012181197646364, 0.010696237061129904, -0.17316380302132717, 0.3906601818342661, -0.11305211484783474, -0.09554040755263005, 0.052933152521500125, -0.28362671728513533, -0.16251813276702987, 0.23934791438367176, 0.2804646600123452, 0.07490218849852681, -0.26200417809231186, 0.1537642502593915, -0.04122341627016899, 0.27585320119028806, 0.08804376797493675, 0.04331785662570733, 0.1635216870666321, 0.18775086296486787, 0.015015059975029409, -0.017657501279140942, -0.20299691545520107, 0.0667933492824949, -0.46101846839783006, -0.10981163327400198, -0.02122682984383113, 0.21040673186499412, -0.05478099824030397, 0.05195226294427425, 0.29689909367897044, 0.04684875973221985, 0.3659995572919818, -0.011401440522729837, 0.1795403391936387, 0.05915499466803224, -0.024320918628771993, 0.09357859513601262, 0.30147994501280717, 0.25522095808523826, 0.14479561131340504, -0.3373534854129492, -0.02892087540728436, -0.03890018151195227]
|
1,803.07775
|
Activation cross section data of proton induced nuclear reactions on
lanthanum in the 34-65 MeV energy range and application for production of
medical radionuclides
|
Activation cross sections of the natLa(p,x)139,137m,137g,135,134,133mCe,
natLa(p,x)135,134,133La and 133m,133g,131Ba nuclear reactions have been
measured experimentally, for the first time (except 139Ce). Cross-sections in
the 34-64 MeV energy range were obtained through an activation method combining
the stacked foil irradiation technique and gamma-ray spectrometry. The
experimental cross sections were compared with the theoretical prediction in
the TENDL-2014 and TENDL-2015, TALYS based libraries. Applications in the field
of medical radionuclides production is discussed.
|
nucl-ex
|
activation cross sections of the natlapx139137m137g135134133mce natlapx135134133la and 133m133g131ba nuclear reactions have been measured experimentally for the first time except 139ce crosssections in the 3464 mev energy range were obtained through an activation method combining the stacked foil irradiation technique and gammaray spectrometry the experimental cross sections were compared with the theoretical prediction in the tendl2014 and tendl2015 talys based libraries applications in the field of medical radionuclides production is discussed
|
[['activation', 'cross', 'sections', 'of', 'the', 'natlapx139137m137g135134133mce', 'natlapx135134133la', 'and', '133m133g131ba', 'nuclear', 'reactions', 'have', 'been', 'measured', 'experimentally', 'for', 'the', 'first', 'time', 'except', '139ce', 'crosssections', 'in', 'the', '3464', 'mev', 'energy', 'range', 'were', 'obtained', 'through', 'an', 'activation', 'method', 'combining', 'the', 'stacked', 'foil', 'irradiation', 'technique', 'and', 'gammaray', 'spectrometry', 'the', 'experimental', 'cross', 'sections', 'were', 'compared', 'with', 'the', 'theoretical', 'prediction', 'in', 'the', 'tendl2014', 'and', 'tendl2015', 'talys', 'based', 'libraries', 'applications', 'in', 'the', 'field', 'of', 'medical', 'radionuclides', 'production', 'is', 'discussed']]
|
[0.041850315917091555, 0.1271522624697622, -0.04348169219584259, 0.08147554700297084, 0.053905478426553174, -0.08410842500983134, -0.010326198887709966, 0.45890868455171585, -0.18874032683122685, -0.32572521283017364, 0.00017872070790925885, -0.3736665292423876, 0.018258462810669753, 0.3060541335007121, 0.06675097908009775, 0.17082193254164474, 0.11757391437148566, 0.005714223370887339, -0.015517641502596876, -0.21402236540555297, 0.23198589555206983, 0.1742871481760898, 0.2926417158998768, 0.17337140947689905, 0.05637364331906771, 0.022828627340084708, -0.04030295137079734, -0.08355165813939974, -0.15214957295478704, 0.12382664472576888, 0.2975448734839173, 0.05831931218819912, 0.10790388668914709, -0.43002706553156983, -0.21071776165626943, 0.06011029283570893, 0.10231494172202314, 0.06482923431458938, -0.13563807156649144, -0.27936609341379476, 0.06422792243778103, -0.21260521848521688, -0.016940474198610687, -0.03468152104109964, 0.008731974071398488, 0.1119678894550923, -0.2377051255556152, 0.0653989958741209, -0.10685342172270312, 0.11791595704648096, -0.1658047901788343, -0.23968789227964246, -0.034367758561583125, 0.07312748780446675, 0.05577998688814285, 0.0064493993105476394, 0.22154913815286228, -0.09000021135023631, -0.1600835520075634, 0.3386854660930112, -0.03523272886762724, -0.08332743771675535, 0.09468545292517827, -0.10353460583342787, -0.13194171474178268, 0.2051666893530637, 0.17368598590495393, 0.1402928583762225, -0.22057674291735405, 0.08194207841520171, 0.04110127322115552, 0.17341869702453122, 0.1208671545061995, -0.05401428026722416, 0.08583970830402583, 0.2462619522240643, -0.11011673345381175, 0.06754249917610329, -0.21732047659016268, -0.04534941068028703, -0.2842871515381643, -0.1282639288863934, -0.07703227133435361, 0.020035735218484393, 0.02037694115557208, -0.07640945066369194, 0.3411039147690377, 0.07325388906824895, 0.24204595591051176, -8.298448451301631e-05, 0.31168463535825996, 0.09873496792416143, 0.11021535376922283, 0.007017988156910767, 0.3186969771871672, 0.19994303506716868, 0.12643694563303143, -0.18763622178298914, 0.12215685753343518, 0.008049680005676825]
|
1,803.07776
|
How can population pyramids be used to explore the past?
|
In the same way as tree rings give us useful information about the climate
many decades ago (or even centuries ago in the case of big trees), population
pyramids allow us to know birth or death rates several decades earlier.
Naturally, they can fulfill such promises only if they have been recorded
accurately. That is why we start this study by listing a number of pitfalls
that may occur in the process of taking censuses. In this paper our main goal
is to show how it is possible to "read" population pyramids. Sudden changes in
birth rate give rise to the clearest signatures. This indicator reveals that
major tragedies like famines, wars, or epidemics are generally accompanied by a
fall in birth rates. Thanks to this observation, population pyramids can be
used to identify and gauge the blows suffered by populations and nations. As an
illustration of how this works, we compare the population pyramids of North and
South Korea. This allows us, among other things, to gauge the scale of the food
shortage that North Korea experienced at the end of the 1990s.
|
physics.soc-ph
|
in the same way as tree rings give us useful information about the climate many decades ago or even centuries ago in the case of big trees population pyramids allow us to know birth or death rates several decades earlier naturally they can fulfill such promises only if they have been recorded accurately that is why we start this study by listing a number of pitfalls that may occur in the process of taking censuses in this paper our main goal is to show how it is possible to read population pyramids sudden changes in birth rate give rise to the clearest signatures this indicator reveals that major tragedies like famines wars or epidemics are generally accompanied by a fall in birth rates thanks to this observation population pyramids can be used to identify and gauge the blows suffered by populations and nations as an illustration of how this works we compare the population pyramids of north and south korea this allows us among other things to gauge the scale of the food shortage that north korea experienced at the end of the 1990s
|
[['in', 'the', 'same', 'way', 'as', 'tree', 'rings', 'give', 'us', 'useful', 'information', 'about', 'the', 'climate', 'many', 'decades', 'ago', 'or', 'even', 'centuries', 'ago', 'in', 'the', 'case', 'of', 'big', 'trees', 'population', 'pyramids', 'allow', 'us', 'to', 'know', 'birth', 'or', 'death', 'rates', 'several', 'decades', 'earlier', 'naturally', 'they', 'can', 'fulfill', 'such', 'promises', 'only', 'if', 'they', 'have', 'been', 'recorded', 'accurately', 'that', 'is', 'why', 'we', 'start', 'this', 'study', 'by', 'listing', 'a', 'number', 'of', 'pitfalls', 'that', 'may', 'occur', 'in', 'the', 'process', 'of', 'taking', 'censuses', 'in', 'this', 'paper', 'our', 'main', 'goal', 'is', 'to', 'show', 'how', 'it', 'is', 'possible', 'to', 'read', 'population', 'pyramids', 'sudden', 'changes', 'in', 'birth', 'rate', 'give', 'rise', 'to', 'the', 'clearest', 'signatures', 'this', 'indicator', 'reveals', 'that', 'major', 'tragedies', 'like', 'famines', 'wars', 'or', 'epidemics', 'are', 'generally', 'accompanied', 'by', 'a', 'fall', 'in', 'birth', 'rates', 'thanks', 'to', 'this', 'observation', 'population', 'pyramids', 'can', 'be', 'used', 'to', 'identify', 'and', 'gauge', 'the', 'blows', 'suffered', 'by', 'populations', 'and', 'nations', 'as', 'an', 'illustration', 'of', 'how', 'this', 'works', 'we', 'compare', 'the', 'population', 'pyramids', 'of', 'north', 'and', 'south', 'korea', 'this', 'allows', 'us', 'among', 'other', 'things', 'to', 'gauge', 'the', 'scale', 'of', 'the', 'food', 'shortage', 'that', 'north', 'korea', 'experienced', 'at', 'the', 'end', 'of', 'the', '1990s']]
|
[-0.06326237528169852, 0.15430511264631883, -0.10908613339668828, 0.13696757467872214, -0.09568713831907624, -0.11195241844246123, 0.05578877869677102, 0.3723792112445074, -0.24740330989816753, -0.3369914485425081, 0.1560908540167198, -0.2811259575677389, -0.1672227943161725, 0.18591295617617384, -0.12679165815580232, -0.060627109102864306, 0.06602287689051793, 0.01457714661196603, 0.008092867592336994, -0.32986656865914876, 0.2862546275386906, 0.09704014253498905, 0.25262343147567107, 0.03313879586336122, 0.06102833473984071, -0.037401092550404115, -0.048697903994015294, -0.018307383559421516, -0.10566059651651101, 0.09137020750847075, 0.2815123085216012, 0.19233452286077765, 0.3011474818416426, -0.45837559683612833, -0.1882575274212286, 0.16954747464194003, 0.18305162954809773, 0.13557603659422096, -0.021011006924748908, -0.23656357897308897, 0.015029773662757614, -0.2026166116170909, -0.18970213648129214, -0.02754391846500094, 0.042780952943165015, -0.001266043953364715, -0.17933526562790023, 0.08264470396502673, 0.034974573913685796, 0.05401857113516282, -0.006877291181096908, -0.10741972962695519, -0.010768824169645086, 0.2101138189710859, 0.1029848799186331, 0.01870588876076711, 0.10216714277909056, -0.09314237835781608, -0.13333108097456559, 0.34650705641758145, -0.03290008825874595, -0.05232297020721371, 0.23953399530348732, -0.20748223969712853, -0.15221785972180837, 0.10323959735757418, 0.17090795378692786, 0.07016476906922078, -0.1726680729290187, 0.011563001133807753, -0.019521647883305814, 0.12656140407932032, 0.14436309754534665, -0.001197552767774576, 0.2574292852381325, 0.16239835390740115, 0.0768896155704288, 0.09989866354147164, -0.08580120461081843, -0.11767674939303265, -0.20483724083161456, -0.13185906121361768, -0.08881154400549586, 0.07456485051079653, -0.0182136927157009, -0.12418825747843822, 0.39618002524113527, 0.19564525815012926, 0.19933410354323036, 0.00472478402029399, 0.2199258370598292, 0.041155942317741195, 0.13344788227898433, 0.054216597287449986, 0.21071608252469046, 0.08439622486121548, 0.13561959362224393, -0.14950312858032386, 0.12678918810864992, 0.017580493651937857]
|
1,803.07777
|
The Ultraviolet Behavior Of Quantum Gravity
|
A theory of quantum gravity has been recently proposed by means of a novel
quantization prescription, which is able to turn the poles of the free
propagators that are due to the higher derivatives into fakeons. The classical
Lagrangian contains the cosmological term, the Hilbert term, $\sqrt{-g}R_{\mu
\nu }R^{\mu \nu }$ and $\sqrt{-g}R^{2}$. In this paper, we compute the one-loop
renormalization of the theory and the absorptive part of the graviton self
energy. The results illustrate the mechanism that makes renormalizability
compatible with unitarity. The fakeons disentangle the real part of the self
energy from the imaginary part. The former obeys a renormalizable power
counting, while the latter obeys the nonrenormalizable power counting of the
low energy expansion and is consistent with unitarity in the limit of vanishing
cosmological constant. The value of the absorptive part is related to the
central charge $c$ of the matter fields coupled to gravity.
|
hep-th gr-qc hep-ph
|
a theory of quantum gravity has been recently proposed by means of a novel quantization prescription which is able to turn the poles of the free propagators that are due to the higher derivatives into fakeons the classical lagrangian contains the cosmological term the hilbert term sqrtgr_mu nu rmu nu and sqrtgr2 in this paper we compute the oneloop renormalization of the theory and the absorptive part of the graviton self energy the results illustrate the mechanism that makes renormalizability compatible with unitarity the fakeons disentangle the real part of the self energy from the imaginary part the former obeys a renormalizable power counting while the latter obeys the nonrenormalizable power counting of the low energy expansion and is consistent with unitarity in the limit of vanishing cosmological constant the value of the absorptive part is related to the central charge c of the matter fields coupled to gravity
|
[['a', 'theory', 'of', 'quantum', 'gravity', 'has', 'been', 'recently', 'proposed', 'by', 'means', 'of', 'a', 'novel', 'quantization', 'prescription', 'which', 'is', 'able', 'to', 'turn', 'the', 'poles', 'of', 'the', 'free', 'propagators', 'that', 'are', 'due', 'to', 'the', 'higher', 'derivatives', 'into', 'fakeons', 'the', 'classical', 'lagrangian', 'contains', 'the', 'cosmological', 'term', 'the', 'hilbert', 'term', 'sqrtgr_mu', 'nu', 'rmu', 'nu', 'and', 'sqrtgr2', 'in', 'this', 'paper', 'we', 'compute', 'the', 'oneloop', 'renormalization', 'of', 'the', 'theory', 'and', 'the', 'absorptive', 'part', 'of', 'the', 'graviton', 'self', 'energy', 'the', 'results', 'illustrate', 'the', 'mechanism', 'that', 'makes', 'renormalizability', 'compatible', 'with', 'unitarity', 'the', 'fakeons', 'disentangle', 'the', 'real', 'part', 'of', 'the', 'self', 'energy', 'from', 'the', 'imaginary', 'part', 'the', 'former', 'obeys', 'a', 'renormalizable', 'power', 'counting', 'while', 'the', 'latter', 'obeys', 'the', 'nonrenormalizable', 'power', 'counting', 'of', 'the', 'low', 'energy', 'expansion', 'and', 'is', 'consistent', 'with', 'unitarity', 'in', 'the', 'limit', 'of', 'vanishing', 'cosmological', 'constant', 'the', 'value', 'of', 'the', 'absorptive', 'part', 'is', 'related', 'to', 'the', 'central', 'charge', 'c', 'of', 'the', 'matter', 'fields', 'coupled', 'to', 'gravity']]
|
[-0.15277217147259098, 0.1414868900205506, -0.11259089426036824, 0.07221532400502395, -0.09225965146057157, -0.10720765660202282, -0.004068215008718087, 0.22759466503142706, -0.2251555417016199, -0.2510494291153107, 0.04962292925282216, -0.2913004302724919, -0.12188810202595149, 0.12305845979072556, -0.01702980469201213, 0.03206110807337068, -0.026819953805848805, 0.08101393664755223, -0.04021245989133604, -0.22141359496949795, 0.3606738501945762, 0.10323469310202887, 0.23306442369908295, 0.11266683734248618, 0.11104792517270087, -0.0071758777768401475, -0.05700834339399621, -0.014531006281440323, -0.10680147808572557, 0.10695268649519798, 0.18440362886601203, 0.0334644754735023, 0.2251637092312612, -0.38485213594410467, -0.19059519923443125, 0.10149356717482914, 0.10892709090714217, 0.08524331799157694, -0.007830871124374302, -0.23640105872087785, 0.07875205971917289, -0.19254530149958776, -0.15789388399256543, -0.0828604332857287, -0.010044210793362377, -0.0676824841903982, -0.25487154162161657, 0.11472614442401037, 0.014303445681533147, -0.03205097774421242, -0.05641282440125439, -0.09010178618435119, -0.03526956827782497, 0.08820893668028451, 0.11077582230948768, 0.03966214249266085, 0.1200906582227027, -0.19232249638750815, -0.07434607019987763, 0.41110031057551905, -0.10144384648309504, -0.1938729742714959, 0.1359486933797598, -0.17268286232610006, -0.11586927315471945, 0.14238741052513187, 0.07466372205227664, 0.09637367682581818, -0.14009837568360003, 0.22696878539136378, 0.0013619838156611532, 0.13621619900034085, 0.07160092243056342, 0.03646488706077877, 0.20788577834232333, 0.06405605308749285, 0.033734976090616674, 0.1220963514564131, -0.039593562452323934, -0.13829463269762896, -0.4065896072047385, -0.14655841674932554, -0.17184469580801354, 0.06300323867755062, -0.1158209280257398, -0.1687457646295189, 0.40567292391976995, 0.12110553509547892, 0.1617500828264432, 0.07929295694811044, 0.3234911581589463, 0.20328428803917928, 0.12694575791986584, 0.04453228139381453, 0.2794206927332247, 0.17736181682070112, 0.10631423254302275, -0.28902205623012994, -0.043552320953961964, 0.1166731704064217]
|
1,803.07778
|
Moduli spaces of point configurations and plane curve counts
|
We identify certain Gromov-Witten invariants counting rational curves with
given incidence and tangency conditions with the Betti numbers of moduli spaces
of point configurations in projective spaces. On the Gromov-Witten side, S.
Fomin and G. Mikhalkin established a recurrence relation via tropicalization,
which is realized on the moduli space side using Donaldson-Thomas invariants of
subspace quivers.
|
math.AG
|
we identify certain gromovwitten invariants counting rational curves with given incidence and tangency conditions with the betti numbers of moduli spaces of point configurations in projective spaces on the gromovwitten side s fomin and g mikhalkin established a recurrence relation via tropicalization which is realized on the moduli space side using donaldsonthomas invariants of subspace quivers
|
[['we', 'identify', 'certain', 'gromovwitten', 'invariants', 'counting', 'rational', 'curves', 'with', 'given', 'incidence', 'and', 'tangency', 'conditions', 'with', 'the', 'betti', 'numbers', 'of', 'moduli', 'spaces', 'of', 'point', 'configurations', 'in', 'projective', 'spaces', 'on', 'the', 'gromovwitten', 'side', 's', 'fomin', 'and', 'g', 'mikhalkin', 'established', 'a', 'recurrence', 'relation', 'via', 'tropicalization', 'which', 'is', 'realized', 'on', 'the', 'moduli', 'space', 'side', 'using', 'donaldsonthomas', 'invariants', 'of', 'subspace', 'quivers']]
|
[-0.2815472295707358, 0.05076505296996662, -0.13807266328201098, 0.14455620443290432, -0.0904090419602913, -0.163043273222034, 0.03736132787889801, 0.2803465989418328, -0.3781565936681415, -0.21538929235456244, 0.11175180326452912, -0.22293116571381688, -0.1943549242901749, 0.22328468095344892, -0.25235614095748005, 0.051305090077221394, 0.029665373438287394, 0.03344998307459589, -0.14786289100136077, -0.4105224199593067, 0.5120268960017711, -0.10306605821408864, 0.22738311976094597, 0.0574968160861837, 0.1100850136052551, 0.05405998540975686, 0.012089281110092998, -0.02709045681123306, -0.20950355488873487, 0.15535969099229469, 0.35396260014385916, 0.07784455680354897, 0.03006439932089831, -0.36979821467372986, -0.10002018514309644, 0.23213604099250265, 0.0967723750343014, -0.015226826090448802, 0.035498490636070655, -0.29524914883742376, 0.02207905309790346, -0.06761020545257322, -0.19693812164976926, -0.09896163818692523, 0.07995390260059919, 0.08283482836226799, -0.16215874227054883, -0.08351480958351333, -0.06388013445705708, 0.18976987515842275, -0.02912367622567607, -0.10907002469424956, -0.2087138142835881, 0.005108071582591427, -0.0375921169054761, 0.12098108303533602, 0.08594044352815088, -0.1291791089045416, -0.17985412822703697, 0.304263952520809, 0.014324063850965883, -0.24253018922172487, 0.05992439329358084, -0.15793000589058334, -0.16767080924806319, 0.1389029552602941, 0.0035403557371215095, 0.20547289060362214, 0.0695478879746848, 0.18117384989870647, -0.09691846565276917, 0.027466397547998764, 0.2128463680357007, -0.006737801969783115, 0.17849378710213518, 0.043905371022577, 0.06375061322302956, 0.1428723771678051, -0.02521946932288951, -0.05096545276007548, -0.38263461805347887, -0.18225024437664875, -0.08948975825582497, 0.16519938653800637, -0.1723915339009961, -0.17872831948001736, 0.4018127406598069, -0.005214996161937181, 0.22442964667321316, 0.2012678968707665, 0.1994998376550419, 0.022474539948494306, 0.0031630560073868503, 0.018595217452717146, 0.07103233551606536, 0.29723709375996676, -0.04982323210320568, -0.13761419844753878, -0.015524555704489882, 0.38059443526435643]
|
1,803.07779
|
Heat-assisted self-localization of exciton polaritons
|
Bosonic condensation of microcavity polaritons is accompanied by their
relaxation from the ensemble of excited states into a single quantum state. The
excess of energy is transferred to the crystal lattice that eventually involves
heating of the structure. Creation of the condensate results in the local
increase of the temperature which leads to the red shift of the exciton energy
providing the mechanism for polariton self-trapping. By employing the
driven-dissipative Gross-Pitaevskii model we predict a new type of a stable
localized solution supported by the thermally-induced self-trapping in a
one-dimensional microcavity structure. The predicted solution is of a sink-type
i.e. it is characterized by the presence of converging density currents. We
examine the spontaneous formation of these states from the white noise under
spatially localized pumping and analyze the criteria for their stability. The
collective bosonic polaron state described here may be considered as a toy
model for studies of bosonic stars formed due to the self-gravity effect.
|
cond-mat.mes-hall
|
bosonic condensation of microcavity polaritons is accompanied by their relaxation from the ensemble of excited states into a single quantum state the excess of energy is transferred to the crystal lattice that eventually involves heating of the structure creation of the condensate results in the local increase of the temperature which leads to the red shift of the exciton energy providing the mechanism for polariton selftrapping by employing the drivendissipative grosspitaevskii model we predict a new type of a stable localized solution supported by the thermallyinduced selftrapping in a onedimensional microcavity structure the predicted solution is of a sinktype ie it is characterized by the presence of converging density currents we examine the spontaneous formation of these states from the white noise under spatially localized pumping and analyze the criteria for their stability the collective bosonic polaron state described here may be considered as a toy model for studies of bosonic stars formed due to the selfgravity effect
|
[['bosonic', 'condensation', 'of', 'microcavity', 'polaritons', 'is', 'accompanied', 'by', 'their', 'relaxation', 'from', 'the', 'ensemble', 'of', 'excited', 'states', 'into', 'a', 'single', 'quantum', 'state', 'the', 'excess', 'of', 'energy', 'is', 'transferred', 'to', 'the', 'crystal', 'lattice', 'that', 'eventually', 'involves', 'heating', 'of', 'the', 'structure', 'creation', 'of', 'the', 'condensate', 'results', 'in', 'the', 'local', 'increase', 'of', 'the', 'temperature', 'which', 'leads', 'to', 'the', 'red', 'shift', 'of', 'the', 'exciton', 'energy', 'providing', 'the', 'mechanism', 'for', 'polariton', 'selftrapping', 'by', 'employing', 'the', 'drivendissipative', 'grosspitaevskii', 'model', 'we', 'predict', 'a', 'new', 'type', 'of', 'a', 'stable', 'localized', 'solution', 'supported', 'by', 'the', 'thermallyinduced', 'selftrapping', 'in', 'a', 'onedimensional', 'microcavity', 'structure', 'the', 'predicted', 'solution', 'is', 'of', 'a', 'sinktype', 'ie', 'it', 'is', 'characterized', 'by', 'the', 'presence', 'of', 'converging', 'density', 'currents', 'we', 'examine', 'the', 'spontaneous', 'formation', 'of', 'these', 'states', 'from', 'the', 'white', 'noise', 'under', 'spatially', 'localized', 'pumping', 'and', 'analyze', 'the', 'criteria', 'for', 'their', 'stability', 'the', 'collective', 'bosonic', 'polaron', 'state', 'described', 'here', 'may', 'be', 'considered', 'as', 'a', 'toy', 'model', 'for', 'studies', 'of', 'bosonic', 'stars', 'formed', 'due', 'to', 'the', 'selfgravity', 'effect']]
|
[-0.145472471640819, 0.23053462279272402, -0.07855308090283233, 0.0518840855680062, 0.01041705198704627, -0.11092776408905436, 0.07834118520648213, 0.3365171548501132, -0.24651932098256174, -0.24963142598940616, 0.025013546196886213, -0.24855949325119234, -0.10064840531510533, 0.14860245979029188, 0.03190052474902314, 0.016168829861503378, 0.02005109063996251, -0.003356634589152375, -0.0025215299880120214, -0.19753715002636432, 0.3365356438988998, 0.043526583083513766, 0.30739243985539316, 0.05274420548460274, 0.06234186036203792, -0.042084714240590286, 0.05564899411301609, -0.013371306358077296, -0.14163664620538177, 0.08714863272149495, 0.18787463931188841, 0.010485202877835673, 0.2549925660684847, -0.44486597860765875, -0.2502117780731267, 0.062098793356210755, 0.1671143755506558, 0.19314543333032114, -0.08192736656956706, -0.3368523455918974, 0.013719895584686736, -0.16439390261390596, -0.1742776732856206, -0.07120941030336128, -0.019519000830259293, 0.008184951078294997, -0.2587583468311947, 0.14471018750437054, 0.10472284466218038, 0.01126649386729974, -0.1226797086857022, -0.020199239927834896, -0.08819090756795304, 0.05786385401493164, -0.0016141276210427853, -0.013276905730473482, 0.16320634374964485, -0.1771187320066865, -0.10628581097924927, 0.38222637047411306, -0.11201885031168438, -0.145711137885732, 0.171711547650207, -0.11518828668720593, -0.0023660862011609563, 0.1831542425818599, 0.1293892604113515, 0.10591982394622959, -0.11409493569272813, 0.04243585927628617, -0.02723239055630057, 0.1620917828013204, 0.05772611560822008, 0.09672455151808584, 0.29201157133029715, 0.2110152897235172, 0.02520221761267656, 0.21507875879731173, -0.10037496840806713, -0.15851962016183574, -0.2669305850627126, -0.12702860471578967, -0.21759817505753629, 0.10107330131421613, -0.010274300653436281, -0.18437611548953756, 0.43475752416256647, 0.08104119792648823, 0.19573341865851812, -0.029859338791382493, 0.2407941315590054, 0.1823193292262531, 0.06158311465648236, 0.024314719649731732, 0.266286367740316, 0.16965575272122482, 0.06935014829757345, -0.3377439017892536, 0.017772949348162315, 0.03508282306598155]
|
1,803.0778
|
Learning and Recognizing Human Action from Skeleton Movement with Deep
Residual Neural Networks
|
Automatic human action recognition is indispensable for almost artificial
intelligent systems such as video surveillance, human-computer interfaces,
video retrieval, etc. Despite a lot of progress, recognizing actions in an
unknown video is still a challenging task in computer vision. Recently, deep
learning algorithms have proved its great potential in many vision-related
recognition tasks. In this paper, we propose the use of Deep Residual Neural
Networks (ResNets) to learn and recognize human action from skeleton data
provided by Kinect sensor. Firstly, the body joint coordinates are transformed
into 3D-arrays and saved in RGB images space. Five different deep learning
models based on ResNet have been designed to extract image features and
classify them into classes. Experiments are conducted on two public video
datasets for human action recognition containing various challenges. The
results show that our method achieves the state-of-the-art performance
comparing with existing approaches.
|
cs.CV
|
automatic human action recognition is indispensable for almost artificial intelligent systems such as video surveillance humancomputer interfaces video retrieval etc despite a lot of progress recognizing actions in an unknown video is still a challenging task in computer vision recently deep learning algorithms have proved its great potential in many visionrelated recognition tasks in this paper we propose the use of deep residual neural networks resnets to learn and recognize human action from skeleton data provided by kinect sensor firstly the body joint coordinates are transformed into 3darrays and saved in rgb images space five different deep learning models based on resnet have been designed to extract image features and classify them into classes experiments are conducted on two public video datasets for human action recognition containing various challenges the results show that our method achieves the stateoftheart performance comparing with existing approaches
|
[['automatic', 'human', 'action', 'recognition', 'is', 'indispensable', 'for', 'almost', 'artificial', 'intelligent', 'systems', 'such', 'as', 'video', 'surveillance', 'humancomputer', 'interfaces', 'video', 'retrieval', 'etc', 'despite', 'a', 'lot', 'of', 'progress', 'recognizing', 'actions', 'in', 'an', 'unknown', 'video', 'is', 'still', 'a', 'challenging', 'task', 'in', 'computer', 'vision', 'recently', 'deep', 'learning', 'algorithms', 'have', 'proved', 'its', 'great', 'potential', 'in', 'many', 'visionrelated', 'recognition', 'tasks', 'in', 'this', 'paper', 'we', 'propose', 'the', 'use', 'of', 'deep', 'residual', 'neural', 'networks', 'resnets', 'to', 'learn', 'and', 'recognize', 'human', 'action', 'from', 'skeleton', 'data', 'provided', 'by', 'kinect', 'sensor', 'firstly', 'the', 'body', 'joint', 'coordinates', 'are', 'transformed', 'into', '3darrays', 'and', 'saved', 'in', 'rgb', 'images', 'space', 'five', 'different', 'deep', 'learning', 'models', 'based', 'on', 'resnet', 'have', 'been', 'designed', 'to', 'extract', 'image', 'features', 'and', 'classify', 'them', 'into', 'classes', 'experiments', 'are', 'conducted', 'on', 'two', 'public', 'video', 'datasets', 'for', 'human', 'action', 'recognition', 'containing', 'various', 'challenges', 'the', 'results', 'show', 'that', 'our', 'method', 'achieves', 'the', 'stateoftheart', 'performance', 'comparing', 'with', 'existing', 'approaches']]
|
[-0.04297796090241705, -0.035601112984090515, -0.06923320312315309, 0.025774123974334658, -0.10650541942524003, -0.2053843812761225, -0.07596818605703498, 0.5153314119047472, -0.24519677233265738, -0.35041579002724355, 0.08078799647292201, -0.3004708937434873, -0.2681008843593562, 0.2358364555755184, -0.22679619636373516, 0.12634970393305658, 0.20047998814974768, 0.10246182530200187, -0.03777284020210393, -0.3386910806219815, 0.2642587782916757, -0.05036121975646098, 0.37648481762358055, 0.021457570850927855, 0.1591775973817714, -0.040692195939031284, -0.06808913970025073, -0.04231817514285557, -0.023304351646722454, 0.20701923662621174, 0.39139640882962673, 0.2328968952249237, 0.3340379683969831, -0.4425475996046681, -0.2640535820187004, 0.0833687373981352, 0.1610947409021655, 0.09000911523063723, -0.08253622449390118, -0.4220553761164487, 0.09355661070341585, -0.1653797132615656, 0.057627823325136385, -0.1777265539596146, 0.04245228699529806, -0.055290688806078986, -0.23141643814217877, -0.03621181923220537, 0.05923659811829361, 0.15556832381957014, -0.0857936769328736, -0.11261004766344394, 0.06123067419582479, 0.28090366398797595, 0.06622101323888965, 0.08241406687154947, 0.16835318206445457, -0.27378566804322296, -0.1686185659958758, 0.39994683264899, -0.03908434656488014, -0.20016592961586815, 0.23767571279969277, 0.0365780831353975, -0.20226822129424504, 0.09584855887765052, 0.2673066419050832, 0.11886394643273965, -0.2011906786848017, 0.02803396538570589, -0.04798785537402605, 0.16867371190759078, 0.06449024207581779, -0.008869492337370003, 0.2015946334060675, 0.2968468227699189, -0.001232011414224833, 0.11497462742706158, -0.14259683642668394, -0.05161574627207199, -0.12199905933156399, -0.054581171414457445, -0.18952718106898622, -0.04463209401124196, -0.07497936018554471, -0.10758707436790746, 0.36824186835897116, 0.2478665063538077, 0.15608992567613825, 0.08828578307293355, 0.3928024151926519, -0.03418823299129349, 0.15207972926494312, 0.06775170318006773, 0.16909095815720665, -0.054484053893657534, 0.17102369186132294, -0.15210373715241768, 0.04943467240819944, 0.09113143570229254]
|
1,803.07781
|
Exploiting deep residual networks for human action recognition from
skeletal data
|
The computer vision community is currently focusing on solving action
recognition problems in real videos, which contain thousands of samples with
many challenges. In this process, Deep Convolutional Neural Networks (D-CNNs)
have played a significant role in advancing the state-of-the-art in various
vision-based action recognition systems. Recently, the introduction of residual
connections in conjunction with a more traditional CNN model in a single
architecture called Residual Network (ResNet) has shown impressive performance
and great potential for image recognition tasks. In this paper, we investigate
and apply deep ResNets for human action recognition using skeletal data
provided by depth sensors. Firstly, the 3D coordinates of the human body joints
carried in skeleton sequences are transformed into image-based representations
and stored as RGB images. These color images are able to capture the
spatial-temporal evolutions of 3D motions from skeleton sequences and can be
efficiently learned by D-CNNs. We then propose a novel deep learning
architecture based on ResNets to learn features from obtained color-based
representations and classify them into action classes. The proposed method is
evaluated on three challenging benchmark datasets including MSR Action 3D,
KARD, and NTU-RGB+D datasets. Experimental results demonstrate that our method
achieves state-of-the-art performance for all these benchmarks whilst requiring
less computation resource. In particular, the proposed method surpasses
previous approaches by a significant margin of 3.4% on MSR Action 3D dataset,
0.67% on KARD dataset, and 2.5% on NTU-RGB+D dataset.
|
cs.CV
|
the computer vision community is currently focusing on solving action recognition problems in real videos which contain thousands of samples with many challenges in this process deep convolutional neural networks dcnns have played a significant role in advancing the stateoftheart in various visionbased action recognition systems recently the introduction of residual connections in conjunction with a more traditional cnn model in a single architecture called residual network resnet has shown impressive performance and great potential for image recognition tasks in this paper we investigate and apply deep resnets for human action recognition using skeletal data provided by depth sensors firstly the 3d coordinates of the human body joints carried in skeleton sequences are transformed into imagebased representations and stored as rgb images these color images are able to capture the spatialtemporal evolutions of 3d motions from skeleton sequences and can be efficiently learned by dcnns we then propose a novel deep learning architecture based on resnets to learn features from obtained colorbased representations and classify them into action classes the proposed method is evaluated on three challenging benchmark datasets including msr action 3d kard and nturgbd datasets experimental results demonstrate that our method achieves stateoftheart performance for all these benchmarks whilst requiring less computation resource in particular the proposed method surpasses previous approaches by a significant margin of 34 on msr action 3d dataset 067 on kard dataset and 25 on nturgbd dataset
|
[['the', 'computer', 'vision', 'community', 'is', 'currently', 'focusing', 'on', 'solving', 'action', 'recognition', 'problems', 'in', 'real', 'videos', 'which', 'contain', 'thousands', 'of', 'samples', 'with', 'many', 'challenges', 'in', 'this', 'process', 'deep', 'convolutional', 'neural', 'networks', 'dcnns', 'have', 'played', 'a', 'significant', 'role', 'in', 'advancing', 'the', 'stateoftheart', 'in', 'various', 'visionbased', 'action', 'recognition', 'systems', 'recently', 'the', 'introduction', 'of', 'residual', 'connections', 'in', 'conjunction', 'with', 'a', 'more', 'traditional', 'cnn', 'model', 'in', 'a', 'single', 'architecture', 'called', 'residual', 'network', 'resnet', 'has', 'shown', 'impressive', 'performance', 'and', 'great', 'potential', 'for', 'image', 'recognition', 'tasks', 'in', 'this', 'paper', 'we', 'investigate', 'and', 'apply', 'deep', 'resnets', 'for', 'human', 'action', 'recognition', 'using', 'skeletal', 'data', 'provided', 'by', 'depth', 'sensors', 'firstly', 'the', '3d', 'coordinates', 'of', 'the', 'human', 'body', 'joints', 'carried', 'in', 'skeleton', 'sequences', 'are', 'transformed', 'into', 'imagebased', 'representations', 'and', 'stored', 'as', 'rgb', 'images', 'these', 'color', 'images', 'are', 'able', 'to', 'capture', 'the', 'spatialtemporal', 'evolutions', 'of', '3d', 'motions', 'from', 'skeleton', 'sequences', 'and', 'can', 'be', 'efficiently', 'learned', 'by', 'dcnns', 'we', 'then', 'propose', 'a', 'novel', 'deep', 'learning', 'architecture', 'based', 'on', 'resnets', 'to', 'learn', 'features', 'from', 'obtained', 'colorbased', 'representations', 'and', 'classify', 'them', 'into', 'action', 'classes', 'the', 'proposed', 'method', 'is', 'evaluated', 'on', 'three', 'challenging', 'benchmark', 'datasets', 'including', 'msr', 'action', '3d', 'kard', 'and', 'nturgbd', 'datasets', 'experimental', 'results', 'demonstrate', 'that', 'our', 'method', 'achieves', 'stateoftheart', 'performance', 'for', 'all', 'these', 'benchmarks', 'whilst', 'requiring', 'less', 'computation', 'resource', 'in', 'particular', 'the', 'proposed', 'method', 'surpasses', 'previous', 'approaches', 'by', 'a', 'significant', 'margin', 'of', '34', 'on', 'msr', 'action', '3d', 'dataset', '067', 'on', 'kard', 'dataset', 'and', '25', 'on', 'nturgbd', 'dataset']]
|
[-0.02785345351472658, -0.03450840176385525, -0.056788598327369336, 0.01898622867333693, -0.05723479097039798, -0.169555082842627, -0.044579649212552454, 0.48142329627220637, -0.2415594786689798, -0.3631673793235866, 0.07795245579072956, -0.2953542431340718, -0.24025729131276086, 0.23842949934759342, -0.17797118396126843, 0.11101603796866871, 0.21369586085942996, 0.05925635845920482, -0.06549272612765335, -0.306552593765611, 0.2850260667893955, 0.0016146970463531633, 0.37444506916197345, 0.015290252638554143, 0.16386202698295282, -0.07005164120346308, -0.03566095001846391, -0.008044589416212625, -0.012801210432434585, 0.2052747698760797, 0.28546164728584195, 0.18120684307592708, 0.27740780423391304, -0.43244213236745815, -0.26069970931394176, 0.06257409273719343, 0.15764276811538577, 0.08951596189877402, -0.06549906477492627, -0.39281823647760855, 0.09401642063882573, -0.15699127995312312, 0.056497188125993025, -0.17810748943865493, 0.0068391834544945206, -0.04853546623144605, -0.2599743444319347, 0.026266016106391368, 0.05456165766728502, 0.1222128855846661, -0.08657041611817658, -0.1442337706433085, 0.030345713988337585, 0.20744412901984666, 0.0025496786223166094, 0.0848682631710262, 0.14387044512154737, -0.24932651364675912, -0.14592004675031095, 0.38286280763452446, -0.054998071463093226, -0.2119900846523253, 0.20981678644545956, -0.01964294464726533, -0.16985136496802203, 0.11307214480724984, 0.26604595137316556, 0.13300529870888, -0.1719019458693698, 0.014398980773108491, -0.05999480320283845, 0.1708344743840066, 0.05740717830825839, -0.0152660218123911, 0.18138319633909183, 0.2954055417915685, -0.016877128451596946, 0.13139665217765756, -0.1768234270591807, -0.06918906763970077, -0.15898431972217508, -0.05630706782952693, -0.18071280551511892, -0.04678822891661712, -0.10261423284450226, -0.11210679002951587, 0.41588020691994854, 0.24673349137954187, 0.18981681814118898, 0.11539794458126754, 0.34608038057657803, -0.018187639221863505, 0.19423025185811774, 0.08255344316226257, 0.18066405825058876, -0.011811108123793296, 0.10028722803677871, -0.16539213725101623, 0.026669776240500796, 0.11569059476784523]
|
1,803.07782
|
Gaze-Assisted User Authentication to Counter Shoulder-surfing Attacks
|
A highly secure, foolproof, user authentication system is still a primary
focus of research in the field of User Privacy and Security. Shoulder-surfing
is an act of spying when an authorized user is logging into a system, and is
promoted by a malicious intent of gaining unauthorized access. We present a
gaze-assisted user authentication system as a potential solution to counter
shoulder-surfing attacks. The system comprises of an eye tracker and an
authentication interface with 12 pre-defined shapes (e.g., triangle, circle,
etc.) that move simultaneously on the screen. A user chooses a set of three
shapes as a password. To authenticate, the user follows the paths of three
shapes as they move, one on each frame, over three consecutive frames.
The system uses either the template matching or decision tree algorithms to
match the scan-path of the user's gaze with the path traversed by the shape.
The system was evaluated with seven users to test the accuracy of both the
algorithms. We found that with the template matching algorithm the system
achieves an accuracy of 95%, and with the decision tree algorithm an accuracy
of 90.2%. We also present the advantages and disadvantages of using both the
algorithms. Our study suggests that gaze-based authentication is a highly
secure method against shoulder-surfing attacks as the unique pattern of eye
movements for each individual makes the system hard to break into.
|
cs.HC
|
a highly secure foolproof user authentication system is still a primary focus of research in the field of user privacy and security shouldersurfing is an act of spying when an authorized user is logging into a system and is promoted by a malicious intent of gaining unauthorized access we present a gazeassisted user authentication system as a potential solution to counter shouldersurfing attacks the system comprises of an eye tracker and an authentication interface with 12 predefined shapes eg triangle circle etc that move simultaneously on the screen a user chooses a set of three shapes as a password to authenticate the user follows the paths of three shapes as they move one on each frame over three consecutive frames the system uses either the template matching or decision tree algorithms to match the scanpath of the users gaze with the path traversed by the shape the system was evaluated with seven users to test the accuracy of both the algorithms we found that with the template matching algorithm the system achieves an accuracy of 95 and with the decision tree algorithm an accuracy of 902 we also present the advantages and disadvantages of using both the algorithms our study suggests that gazebased authentication is a highly secure method against shouldersurfing attacks as the unique pattern of eye movements for each individual makes the system hard to break into
|
[['a', 'highly', 'secure', 'foolproof', 'user', 'authentication', 'system', 'is', 'still', 'a', 'primary', 'focus', 'of', 'research', 'in', 'the', 'field', 'of', 'user', 'privacy', 'and', 'security', 'shouldersurfing', 'is', 'an', 'act', 'of', 'spying', 'when', 'an', 'authorized', 'user', 'is', 'logging', 'into', 'a', 'system', 'and', 'is', 'promoted', 'by', 'a', 'malicious', 'intent', 'of', 'gaining', 'unauthorized', 'access', 'we', 'present', 'a', 'gazeassisted', 'user', 'authentication', 'system', 'as', 'a', 'potential', 'solution', 'to', 'counter', 'shouldersurfing', 'attacks', 'the', 'system', 'comprises', 'of', 'an', 'eye', 'tracker', 'and', 'an', 'authentication', 'interface', 'with', '12', 'predefined', 'shapes', 'eg', 'triangle', 'circle', 'etc', 'that', 'move', 'simultaneously', 'on', 'the', 'screen', 'a', 'user', 'chooses', 'a', 'set', 'of', 'three', 'shapes', 'as', 'a', 'password', 'to', 'authenticate', 'the', 'user', 'follows', 'the', 'paths', 'of', 'three', 'shapes', 'as', 'they', 'move', 'one', 'on', 'each', 'frame', 'over', 'three', 'consecutive', 'frames', 'the', 'system', 'uses', 'either', 'the', 'template', 'matching', 'or', 'decision', 'tree', 'algorithms', 'to', 'match', 'the', 'scanpath', 'of', 'the', 'users', 'gaze', 'with', 'the', 'path', 'traversed', 'by', 'the', 'shape', 'the', 'system', 'was', 'evaluated', 'with', 'seven', 'users', 'to', 'test', 'the', 'accuracy', 'of', 'both', 'the', 'algorithms', 'we', 'found', 'that', 'with', 'the', 'template', 'matching', 'algorithm', 'the', 'system', 'achieves', 'an', 'accuracy', 'of', '95', 'and', 'with', 'the', 'decision', 'tree', 'algorithm', 'an', 'accuracy', 'of', '902', 'we', 'also', 'present', 'the', 'advantages', 'and', 'disadvantages', 'of', 'using', 'both', 'the', 'algorithms', 'our', 'study', 'suggests', 'that', 'gazebased', 'authentication', 'is', 'a', 'highly', 'secure', 'method', 'against', 'shouldersurfing', 'attacks', 'as', 'the', 'unique', 'pattern', 'of', 'eye', 'movements', 'for', 'each', 'individual', 'makes', 'the', 'system', 'hard', 'to', 'break', 'into']]
|
[-0.16815345226299003, -0.022801630060299297, -0.09076839577438163, 0.022834069323807337, -0.08107333047128401, -0.2567067477815504, 0.0920272395055432, 0.4089157471970114, -0.24447017459516052, -0.3268788385257841, 0.09871606597731268, -0.319107178009957, -0.12276443857679298, 0.1761018148405827, -0.13028824724883298, 0.0722700449532329, 0.04501190800504458, 0.09170193658373013, 0.0016278042036055804, -0.2731643105820472, 0.28590382431183486, 0.07273453051086076, 0.29900330448254747, 0.015343177667107254, 0.1114344015782577, 0.04818024589806209, -0.025236855100384835, -0.012019625572105423, -0.04056142518999269, 0.10602046261103336, 0.245930155497207, 0.2224063190782044, 0.30453619433111434, -0.36606566696610776, -0.1298658358418397, 0.03256593271683267, 0.15720905787452566, 0.09426062105134064, -0.0679827117489236, -0.340092022688734, 0.11731531760069708, -0.21945188966209647, -0.06869404492533754, -0.032802311172830875, -0.028883764562990077, 0.019951118293572136, -0.2809381640809039, -0.052313703727551564, 0.033371016562115156, 0.07414702369575286, -0.03844909495308052, -0.05398682011741287, -0.017306055974606202, 0.2294420730232365, 0.04888124557417374, 0.024023222441146533, 0.1717998756962019, -0.13863866290028765, -0.16510399651162602, 0.40677511438271885, 0.004333563203878668, -0.19738248055475444, 0.18058576838898283, -0.036841819788772594, -0.10510262152216678, 0.1504550234914867, 0.19903327881330096, 0.10059093488848007, -0.18023721774356027, -0.017335831430663383, -0.04128704698083772, 0.2284831715336956, 0.06177224489091591, 0.005670906798954744, 0.20215829158716914, 0.1949200304580942, 0.10467297210679369, 0.1304780362330491, -0.0940435870187601, -0.041907682941665296, -0.23172659730319112, -0.16981968515467175, -0.16783438396831266, -0.04659210112836521, -0.0856392005268219, -0.16500712591162414, 0.4032060827807763, 0.17648386315942852, 0.18483782660797662, 0.07263927346738015, 0.3751184343274959, 0.02491821495183961, 0.07188600827390776, 0.11049734694818665, 0.1737154311788732, -0.01898878980448315, 0.1164914729507278, -0.17222376096399916, 0.12590469639772736, 0.0396567926014922]
|
1,803.07783
|
A Pure Confinement Induced Trimer in One-Dimensional Atomic Waveguides
|
Shallow trimers composed of three bosonic atoms in one-dimensional harmonic
waveguides are studied in the vicinity of a Feshbach resonance. It is shown
that for arbitrarily large values of the one-dimensional scattering length, an
excited trimer branch exists in coexistence with the dimer and the trimer of
the Lieb-Liniger model.
|
cond-mat.quant-gas
|
shallow trimers composed of three bosonic atoms in onedimensional harmonic waveguides are studied in the vicinity of a feshbach resonance it is shown that for arbitrarily large values of the onedimensional scattering length an excited trimer branch exists in coexistence with the dimer and the trimer of the liebliniger model
|
[['shallow', 'trimers', 'composed', 'of', 'three', 'bosonic', 'atoms', 'in', 'onedimensional', 'harmonic', 'waveguides', 'are', 'studied', 'in', 'the', 'vicinity', 'of', 'a', 'feshbach', 'resonance', 'it', 'is', 'shown', 'that', 'for', 'arbitrarily', 'large', 'values', 'of', 'the', 'onedimensional', 'scattering', 'length', 'an', 'excited', 'trimer', 'branch', 'exists', 'in', 'coexistence', 'with', 'the', 'dimer', 'and', 'the', 'trimer', 'of', 'the', 'liebliniger', 'model']]
|
[-0.18381278250133617, 0.25329125582502454, 0.017940611205995084, 0.04014835738809779, 0.08743201434612274, -0.20993134996853768, -0.015777254216372966, 0.3916156443953514, -0.2077929978480097, -0.17639655576553195, -0.031734732852783054, -0.3356121664494276, -0.11014492951333522, 0.15540428889449687, 0.13748692375491373, 0.06906869011727394, 0.07202389867044985, 0.0470154972281307, -0.00759739940520376, -0.21997212022542953, 0.3016675283946097, -0.039486166397109626, 0.23041989136487245, 0.10746734206564725, 0.028072474086657168, 0.014043864011764527, 0.20806338656693696, -0.08033625107258559, -0.1761006135547359, 0.13215279806405306, 0.2741754400730133, -0.08092910684645176, 0.17769209578633308, -0.4259930895641446, -0.2015579274855554, 0.07315291361883283, 0.2505372905638069, 0.19525947635993363, -0.012455048388801515, -0.29529429074376823, -0.070236932055559, -0.1510524184629321, -0.22576499627903104, -0.04294900431297719, 0.064352096170187, 0.044792194087058305, -0.23608890514355152, 0.07561734326183796, 0.07667991105467081, 0.08892168838530778, -0.10644748766906559, -0.10556023107841611, -0.04801709339022636, 0.03504003725014627, -0.04180899235187099, -0.03378705271403305, 0.10383245933800936, -0.15401709329104052, -0.07759045515209437, 0.373765789270401, -0.14740825652144848, -0.16232134640216828, 0.21642903251340612, -0.13703407425433398, -0.06599505682475865, 0.20743437591940164, 0.08707000751048327, 0.06630147084593772, -0.1144142490811646, 0.11479541780310683, -0.1275129648670554, 0.20740267454530112, 0.1322361285146326, 0.04099344004876912, 0.26691393412649633, 0.20573999341577293, 0.033190572895109655, 0.22060252580791712, -0.14723252429626882, -0.20587374716997148, -0.23581165190786124, -0.11841321565210819, -0.27768252274021504, -0.03390389485284686, -0.02255456370272441, -0.22903541091072838, 0.3613659546524286, 0.007668616729788482, 0.22486752351745964, -0.03401252498850226, 0.186762647095602, 0.14048697985708714, 0.06196732101030648, 0.04040775472298264, 0.28082928320392964, 0.17756625409470872, 0.005764442654326558, -0.33037307248450815, -0.06120703971013427, 0.05773175668902695]
|
1,803.07784
|
Investigation of activation cross sections of proton induced reactions
on rhodium up to 70 MeV for practical applications
|
Excitation functions were measured for the production of the 101,100Pd, 102m,
102g,101m,101g,100,99m,99gRh and 97Ru radionuclides by bombardment of 103Rh
targets with proton beams up to 70 MeV, some of them for the first time. The
new results are compared with the earlier experimental data and with the
theoretical nuclear model code calculations from ALICE-IPPE, EMPIRE and TALYS
1.6. Thick target yields were deduced and possible application of the new data
for production of medically relevant 101m,101gRh and 97Ru are discussed.
|
nucl-ex
|
excitation functions were measured for the production of the 101100pd 102m 102g101m101g10099m99grh and 97ru radionuclides by bombardment of 103rh targets with proton beams up to 70 mev some of them for the first time the new results are compared with the earlier experimental data and with the theoretical nuclear model code calculations from aliceippe empire and talys 16 thick target yields were deduced and possible application of the new data for production of medically relevant 101m101grh and 97ru are discussed
|
[['excitation', 'functions', 'were', 'measured', 'for', 'the', 'production', 'of', 'the', '101100pd', '102m', '102g101m101g10099m99grh', 'and', '97ru', 'radionuclides', 'by', 'bombardment', 'of', '103rh', 'targets', 'with', 'proton', 'beams', 'up', 'to', '70', 'mev', 'some', 'of', 'them', 'for', 'the', 'first', 'time', 'the', 'new', 'results', 'are', 'compared', 'with', 'the', 'earlier', 'experimental', 'data', 'and', 'with', 'the', 'theoretical', 'nuclear', 'model', 'code', 'calculations', 'from', 'aliceippe', 'empire', 'and', 'talys', '16', 'thick', 'target', 'yields', 'were', 'deduced', 'and', 'possible', 'application', 'of', 'the', 'new', 'data', 'for', 'production', 'of', 'medically', 'relevant', '101m101grh', 'and', '97ru', 'are', 'discussed']]
|
[0.03197273934309028, 0.16593705529445096, -0.039464808136567865, 0.0756389455575692, 0.03766149772127392, -0.11256278690033421, 0.030065498437340323, 0.38188452886319474, -0.19924643646165924, -0.36508052369677707, 0.067815035042402, -0.3640164117647433, 0.03557088521407231, 0.27637188499915954, 0.04048814319417273, 0.12852828493831972, 0.0989000564349178, 0.00010933037724738058, -0.03722230945545322, -0.2288437871458499, 0.298071786516199, 0.14822413579033883, 0.2084102208824142, 0.0981264077984777, 0.026318775511371267, -0.02838869761111901, -0.07593191412467461, -0.09798553945055526, -0.15221334730832545, 0.14121900009922683, 0.24930347623548618, 0.12607851873862705, 0.11690422103397156, -0.44150727683384167, -0.18041528106397509, -0.0016103944814714946, 0.05499738111221201, 0.11983180066607402, -0.11867630929612603, -0.2751885536862047, 0.0983948948682825, -0.1931319152568712, -0.10454647687239278, -0.07042260275614497, 0.029289535602162544, 0.11020980451844241, -0.27504480130186204, 0.061105876171495765, -0.056422878167052805, 0.07792680672173447, -0.14659323841701016, -0.2709393392096421, -0.041421421000881024, 0.09546376324234236, 0.09049215054868623, 0.050194945045452764, 0.14860976763425002, -0.07087815048075036, -0.13661807237536108, 0.37354664209200755, -0.032615232930861805, -0.07056410474040986, 0.1592213940304263, -0.14902054073019444, -0.10735413333934143, 0.1866651232550411, 0.15757257151984194, 0.12492617872837734, -0.17708999271455564, 0.010671381467162925, -0.004645830277647627, 0.12940450891925903, 0.08854401604223408, 0.018984366067391085, 0.11905610785929878, 0.192548565565008, -0.10853036975880202, 0.11052071032769929, -0.15227632051506876, -0.06699762369680684, -0.3129659310767525, -0.12104314352434717, -0.06580681658938135, 0.01636407203286102, -0.03648333003232102, -0.031263905442564896, 0.3714850982160945, 0.08097334415039145, 0.19266856812234773, 0.021635948251442688, 0.25487965928684725, 0.0337065223567678, 0.08555692626089838, 0.04724859582309268, 0.25875393815505576, 0.1529762961834326, 0.08460704874443381, -0.19544492498665167, 0.08360346851833655, -0.0501266160128197]
|
1,803.07785
|
Probing microscopic models for system-bath interactions via parametric
driving
|
We show that strong parametric driving of a quantum harmonic oscillator
coupled to a thermal bath allows one to distinguish between different
microscopic models for the oscillator-bath coupling. We consider a bath with an
Ohmic spectral density and a model where the system-bath interaction can be
tuned continuously between position and momentum coupling via the coupling
angle $\alpha$. We derive a master equation for the reduced density operator of
the oscillator in Born-Markov approximation and investigate its quasi-steady
state as a function of the driving parameters, the temperature of the bath and
the coupling angle $\alpha$. We find that the time-averaged variance of
position and momentum exhibits a strong dependence on these parameters. In
particular, we identify parameter regimes that maximise the $\alpha$-dependence
and provide an intuitive explanation of our results.
|
physics.atom-ph quant-ph
|
we show that strong parametric driving of a quantum harmonic oscillator coupled to a thermal bath allows one to distinguish between different microscopic models for the oscillatorbath coupling we consider a bath with an ohmic spectral density and a model where the systembath interaction can be tuned continuously between position and momentum coupling via the coupling angle alpha we derive a master equation for the reduced density operator of the oscillator in bornmarkov approximation and investigate its quasisteady state as a function of the driving parameters the temperature of the bath and the coupling angle alpha we find that the timeaveraged variance of position and momentum exhibits a strong dependence on these parameters in particular we identify parameter regimes that maximise the alphadependence and provide an intuitive explanation of our results
|
[['we', 'show', 'that', 'strong', 'parametric', 'driving', 'of', 'a', 'quantum', 'harmonic', 'oscillator', 'coupled', 'to', 'a', 'thermal', 'bath', 'allows', 'one', 'to', 'distinguish', 'between', 'different', 'microscopic', 'models', 'for', 'the', 'oscillatorbath', 'coupling', 'we', 'consider', 'a', 'bath', 'with', 'an', 'ohmic', 'spectral', 'density', 'and', 'a', 'model', 'where', 'the', 'systembath', 'interaction', 'can', 'be', 'tuned', 'continuously', 'between', 'position', 'and', 'momentum', 'coupling', 'via', 'the', 'coupling', 'angle', 'alpha', 'we', 'derive', 'a', 'master', 'equation', 'for', 'the', 'reduced', 'density', 'operator', 'of', 'the', 'oscillator', 'in', 'bornmarkov', 'approximation', 'and', 'investigate', 'its', 'quasisteady', 'state', 'as', 'a', 'function', 'of', 'the', 'driving', 'parameters', 'the', 'temperature', 'of', 'the', 'bath', 'and', 'the', 'coupling', 'angle', 'alpha', 'we', 'find', 'that', 'the', 'timeaveraged', 'variance', 'of', 'position', 'and', 'momentum', 'exhibits', 'a', 'strong', 'dependence', 'on', 'these', 'parameters', 'in', 'particular', 'we', 'identify', 'parameter', 'regimes', 'that', 'maximise', 'the', 'alphadependence', 'and', 'provide', 'an', 'intuitive', 'explanation', 'of', 'our', 'results']]
|
[-0.1539503378359928, 0.17279333282703754, -0.09286376561272804, 0.044016488920186315, -0.03694507047064773, -0.16968325472202236, 0.06382906240080519, 0.36705023688015365, -0.26306520247270304, -0.2871653360975835, -0.0016412557731915749, -0.2513951295650189, -0.10431783473943822, 0.18644779058393687, 0.04327701086903574, 0.0003581261151214308, 0.028211295858864453, 0.031876387904826484, -0.06501079310364452, -0.10757599049603268, 0.3140001490584198, 0.04529677089197092, 0.24446270565274847, 0.06979983375329553, 0.1435215518425951, -0.004531094548470191, 0.07007868032020922, 0.002470202274791157, -0.1704301168663469, 0.032652590974795684, 0.1789421677848074, 0.016522526118961225, 0.2716535254424253, -0.4046747740713581, -0.19940566719786926, 0.09172045844358229, 0.10893996387634797, 0.1153435918701571, -0.01300943611307027, -0.24730063954240267, -0.058597969458232285, -0.19182096665924173, -0.1572125543980639, -0.1174750226009495, 0.009069646266999989, 0.0522841815347961, -0.3236108316634675, 0.10741583765875407, 0.046341758919879794, 0.005694538184249674, -0.07282542139211784, -0.05901329291856471, -0.04759125093190099, 0.13833962346405815, 0.029651623288567627, 0.00843198358913073, 0.15782311193659218, -0.1614844168328417, -0.05694032159726356, 0.3211540208755324, -0.14800758838994812, -0.22191247659671398, 0.18781284386121477, -0.15093881470499604, -0.06976653408003218, 0.07726820629402881, 0.15658335816399513, 0.09328500177348673, -0.15346915208030748, 0.09681561646560022, 0.016095429374516464, 0.22293334579955473, 0.01403773691725583, 0.05179396397896282, 0.18236548592912333, 0.13100865082850835, 0.05496724190915586, 0.17007850873095645, -0.10488899611469842, -0.12773032063611192, -0.3037721698122625, -0.13140003254480717, -0.18556206686180512, 0.07776755777379597, -0.14416915445898673, -0.15763740415261873, 0.4312700687175375, 0.19477133079296874, 0.22339765345748827, 0.03655867165537508, 0.2707454530195198, 0.22454970353105255, 0.008118718709682917, 0.050326287231002825, 0.3237263706178611, 0.1721869788100616, 0.0638903129938279, -0.3286864010204796, 0.028291462744650154, 0.023001842360716056]
|
1,803.07786
|
$Z_4$ Topological Superconductivity in UCoGe
|
Topological nonsymmorphic crystalline superconductivity (TNCS) is an
intriguing phase of matter, offering a platform to study the interplay between
topology, superconductivity, and nonsymmorphic crystalline symmetries.
Interestingly, some of TNCS are classified into $Z_4$ topological phases, which
have unique surface states referred to as a M\"obius strip or an hourglass, and
have not been achieved in symmorphic superconductors. However, material
realization of $Z_4$ TNCS has never been known, to the best of our knowledge.
Here we propose that the paramagnetic superconducting phase of UCoGe under
pressure is a promising candidate of $Z_4$-nontrivial TNCS enriched by glide
symmetry. We evaluate $Z_4$ invariants of UCoGe by deriving the formulas
relating $Z_4$ invariants to the topology of Fermi surfaces. Applying the
formulas and previous ab-initio calculations, we clarify that three odd-parity
representations, out of four, are $Z_4$-nontrivial TNCS, while the other is
also $Z_2$-nontrivial TNCS. We also discuss possible $Z_4$ TNCS in CrAs and
related materials.
|
cond-mat.supr-con cond-mat.str-el
|
topological nonsymmorphic crystalline superconductivity tncs is an intriguing phase of matter offering a platform to study the interplay between topology superconductivity and nonsymmorphic crystalline symmetries interestingly some of tncs are classified into z_4 topological phases which have unique surface states referred to as a mobius strip or an hourglass and have not been achieved in symmorphic superconductors however material realization of z_4 tncs has never been known to the best of our knowledge here we propose that the paramagnetic superconducting phase of ucoge under pressure is a promising candidate of z_4nontrivial tncs enriched by glide symmetry we evaluate z_4 invariants of ucoge by deriving the formulas relating z_4 invariants to the topology of fermi surfaces applying the formulas and previous abinitio calculations we clarify that three oddparity representations out of four are z_4nontrivial tncs while the other is also z_2nontrivial tncs we also discuss possible z_4 tncs in cras and related materials
|
[['topological', 'nonsymmorphic', 'crystalline', 'superconductivity', 'tncs', 'is', 'an', 'intriguing', 'phase', 'of', 'matter', 'offering', 'a', 'platform', 'to', 'study', 'the', 'interplay', 'between', 'topology', 'superconductivity', 'and', 'nonsymmorphic', 'crystalline', 'symmetries', 'interestingly', 'some', 'of', 'tncs', 'are', 'classified', 'into', 'z_4', 'topological', 'phases', 'which', 'have', 'unique', 'surface', 'states', 'referred', 'to', 'as', 'a', 'mobius', 'strip', 'or', 'an', 'hourglass', 'and', 'have', 'not', 'been', 'achieved', 'in', 'symmorphic', 'superconductors', 'however', 'material', 'realization', 'of', 'z_4', 'tncs', 'has', 'never', 'been', 'known', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'here', 'we', 'propose', 'that', 'the', 'paramagnetic', 'superconducting', 'phase', 'of', 'ucoge', 'under', 'pressure', 'is', 'a', 'promising', 'candidate', 'of', 'z_4nontrivial', 'tncs', 'enriched', 'by', 'glide', 'symmetry', 'we', 'evaluate', 'z_4', 'invariants', 'of', 'ucoge', 'by', 'deriving', 'the', 'formulas', 'relating', 'z_4', 'invariants', 'to', 'the', 'topology', 'of', 'fermi', 'surfaces', 'applying', 'the', 'formulas', 'and', 'previous', 'abinitio', 'calculations', 'we', 'clarify', 'that', 'three', 'oddparity', 'representations', 'out', 'of', 'four', 'are', 'z_4nontrivial', 'tncs', 'while', 'the', 'other', 'is', 'also', 'z_2nontrivial', 'tncs', 'we', 'also', 'discuss', 'possible', 'z_4', 'tncs', 'in', 'cras', 'and', 'related', 'materials']]
|
[-0.22674384168755488, 0.1939503632397188, -0.07610962028933951, 0.03234943621143411, -0.12195956641995667, -0.17265347201664677, 0.09855930369945819, 0.3957496585586927, -0.23556187917672147, -0.27822841331362724, 0.06235937063930706, -0.28821845160134685, -0.16675809176557466, 0.1329298179577911, -0.009137210807092675, 0.0409117213781648, -0.11703041825918543, -0.02794095394654737, -0.18931002852127218, -0.282304265473863, 0.3117414815382619, -0.031958305876977094, 0.32818366107437136, 0.04925878143880279, 0.02471537855000629, -0.09630529958154731, 0.08537372467014313, -0.014458973504502901, -0.1563510728829842, 0.028851833980102343, 0.272238493032891, -0.03691098614339561, 0.08963906776860056, -0.44809867010370596, -0.23061856241809242, 0.05384630762156249, 0.13282184421253584, 0.108688864406142, -0.09636503636240085, -0.35906546985443005, 0.10905958046736633, -0.1762605830745759, -0.11448582243400894, -0.17437289839597955, -0.01335397002055941, -0.07130072804928864, -0.13685485572185394, 0.021635317027603195, 0.08896149723671827, 0.11531533109020846, -0.09194390642012926, -0.13139064808144865, -0.11099664569244838, 0.0355780335008823, 0.08917556549484948, 0.03497065948291163, 0.05685294168335604, -0.12988830303835594, -0.17342534341268093, 0.41087533027283696, 0.027586235502272245, -0.10974330742118392, 0.1585732661703314, -0.09660415697638523, -0.1940749222756482, 0.14436831611564896, 0.06032072582857171, 0.071784389552179, -0.11306201867077925, 0.1127191519024063, -0.09015257328423677, 0.1261738791097668, 0.03194048765096688, 0.09313977604744418, 0.2461801623127067, 0.16567550185167748, 0.027456692969989056, 0.17205187617746437, -0.08483808528438161, -0.043898260390039086, -0.27228534217586353, -0.22533159577694015, -0.19124016218706216, 0.049925693486299175, -0.01348240128460484, -0.16101419888186774, 0.4136171831230589, 0.12179393557778516, 0.1493003026663557, -0.0860230995509336, 0.17685729062384706, 0.04063487740158535, 0.10838318474265753, 0.012789288838862772, 0.21568412717916977, 0.16756233323565464, 0.002009746241977051, -0.22942958688738463, 0.06273735441414377, 0.08177560004999473]
|
1,803.07787
|
First eigenvalues of geometric operators under the Yamabe flow
|
Suppose $(M,g_0)$ is a compact Riemannian manifold without boundary of
dimension $n\geq 3$. Using the Yamabe flow, we obtain estimate for the first
nonzero eigenvalue of the Laplacian of $g_0$ with negative scalar curvature in
terms of the Yamabe metric in its conformal class. On the other hand, we prove
that the first eigenvalue of some geometric operators on a compact Riemannian
manifold is nondecreasing along the unnormalized Yamabe flow under suitable
curvature assumption. Similar results are obtained for manifolds with boundary
and for CR manifold.
|
math.DG math.CV
|
suppose mg_0 is a compact riemannian manifold without boundary of dimension ngeq 3 using the yamabe flow we obtain estimate for the first nonzero eigenvalue of the laplacian of g_0 with negative scalar curvature in terms of the yamabe metric in its conformal class on the other hand we prove that the first eigenvalue of some geometric operators on a compact riemannian manifold is nondecreasing along the unnormalized yamabe flow under suitable curvature assumption similar results are obtained for manifolds with boundary and for cr manifold
|
[['suppose', 'mg_0', 'is', 'a', 'compact', 'riemannian', 'manifold', 'without', 'boundary', 'of', 'dimension', 'ngeq', '3', 'using', 'the', 'yamabe', 'flow', 'we', 'obtain', 'estimate', 'for', 'the', 'first', 'nonzero', 'eigenvalue', 'of', 'the', 'laplacian', 'of', 'g_0', 'with', 'negative', 'scalar', 'curvature', 'in', 'terms', 'of', 'the', 'yamabe', 'metric', 'in', 'its', 'conformal', 'class', 'on', 'the', 'other', 'hand', 'we', 'prove', 'that', 'the', 'first', 'eigenvalue', 'of', 'some', 'geometric', 'operators', 'on', 'a', 'compact', 'riemannian', 'manifold', 'is', 'nondecreasing', 'along', 'the', 'unnormalized', 'yamabe', 'flow', 'under', 'suitable', 'curvature', 'assumption', 'similar', 'results', 'are', 'obtained', 'for', 'manifolds', 'with', 'boundary', 'and', 'for', 'cr', 'manifold']]
|
[-0.18860853182660892, 0.0656596420354448, -0.06594365742057562, 0.05615956601849215, -0.15072353861868643, -0.19937277572814288, -0.13366293675959284, 0.37574718231985044, -0.2192248628734676, -0.2039174437739475, 0.1666144952881908, -0.32145818741992116, -0.15519795998684563, 0.16099053574725986, -0.10729566541348778, 0.08650735316210599, 0.10015311412686526, 0.18933043000829775, -0.12452460012972615, -0.19664039455494994, 0.5500105824754682, -0.07990523447217636, 0.1962797386750449, 0.138865932560293, 0.12061657899514187, -0.09421698685713806, 0.013040594946116556, 0.049634133741736065, -0.18678048606577863, 0.13956975512379824, 0.18434471446143594, 0.03971888978294162, 0.216066274207172, -0.3911867073715426, -0.26705192001049166, 0.18531537120945232, 0.08556175719253546, -0.014841538594039373, -0.050232375628141646, -0.3271934505508736, 0.16601719051534528, -0.008609366627561664, -0.18214516876655262, -0.0636240636908211, -0.005099811093058697, -0.06245124656273875, -0.2558508152142167, 0.08716992073865651, 0.10367671253029691, 0.038686325362082136, -0.15820367249990488, -0.14205964109968655, -0.06561919481515191, 0.0763296924875291, 0.06691371475692925, 0.062115360395224806, 0.09837979184420304, -0.048129537494766506, -0.07554129967709657, 0.3279795359311149, -0.15523582775968797, -0.3335078003014936, 0.050033191262289535, -0.1645128400888034, -0.17260005811857448, 0.08388004971798076, 0.17797291921018515, 0.21704135012141493, -0.05638421489857137, 0.17197378365211946, -0.03463811140648241, 0.06308998020235883, 0.10306883283327659, -0.04180209920741618, 0.05679912308534218, 0.08182562150732549, 0.2666092371394814, 0.11884537506320644, -0.020284336401409534, -0.06418991162506647, -0.3596647697132687, -0.24186054461224135, -0.23669931989942872, 0.23128489117939457, -0.23063404637177037, -0.17887650372807024, 0.3902685434427546, -0.021462235971506913, 0.20549362261108187, 0.16440878283005034, 0.23684378748023233, 0.08055260885225306, -0.0025999874883699554, 0.19573414039278272, 0.16681299723182577, 0.22541201840219802, 0.06929133903251442, -0.18443354789904037, -0.0627554241665314, 0.17133467760326904]
|
1,803.07788
|
Particle Filter for Randomly Delayed Measurements with Unknown Latency
Probability
|
This paper focuses on designing a particle filter for randomly delayed
measurements with an unknown latency probability. A generalized measurement
model is adopted which includes measurements that are delayed randomly by an
arbitrary but fixed maximum number of the steps, along with random packet
drops. Recursion equation for importance weights is derived under the presence
of random delays. Offline and online algorithms for identification of the
unknown latency parameter using the maximum likelihood criterion are proposed.
Further, this work explores the conditions which ensure the convergence of the
proposed particle filter. Finally, two numerical examples concerning problems
of non-stationary growth model and the bearing-only tracking are simulated to
show the effectiveness and superiority of the proposed filter.
|
eess.SP
|
this paper focuses on designing a particle filter for randomly delayed measurements with an unknown latency probability a generalized measurement model is adopted which includes measurements that are delayed randomly by an arbitrary but fixed maximum number of the steps along with random packet drops recursion equation for importance weights is derived under the presence of random delays offline and online algorithms for identification of the unknown latency parameter using the maximum likelihood criterion are proposed further this work explores the conditions which ensure the convergence of the proposed particle filter finally two numerical examples concerning problems of nonstationary growth model and the bearingonly tracking are simulated to show the effectiveness and superiority of the proposed filter
|
[['this', 'paper', 'focuses', 'on', 'designing', 'a', 'particle', 'filter', 'for', 'randomly', 'delayed', 'measurements', 'with', 'an', 'unknown', 'latency', 'probability', 'a', 'generalized', 'measurement', 'model', 'is', 'adopted', 'which', 'includes', 'measurements', 'that', 'are', 'delayed', 'randomly', 'by', 'an', 'arbitrary', 'but', 'fixed', 'maximum', 'number', 'of', 'the', 'steps', 'along', 'with', 'random', 'packet', 'drops', 'recursion', 'equation', 'for', 'importance', 'weights', 'is', 'derived', 'under', 'the', 'presence', 'of', 'random', 'delays', 'offline', 'and', 'online', 'algorithms', 'for', 'identification', 'of', 'the', 'unknown', 'latency', 'parameter', 'using', 'the', 'maximum', 'likelihood', 'criterion', 'are', 'proposed', 'further', 'this', 'work', 'explores', 'the', 'conditions', 'which', 'ensure', 'the', 'convergence', 'of', 'the', 'proposed', 'particle', 'filter', 'finally', 'two', 'numerical', 'examples', 'concerning', 'problems', 'of', 'nonstationary', 'growth', 'model', 'and', 'the', 'bearingonly', 'tracking', 'are', 'simulated', 'to', 'show', 'the', 'effectiveness', 'and', 'superiority', 'of', 'the', 'proposed', 'filter']]
|
[-0.12365739510004592, 0.07717923407117502, -0.05078171527920625, -0.0025378688533081967, -0.05886179790235101, -0.17202976440740192, 0.04969425595059004, 0.386835770152159, -0.24868329658578986, -0.3166120423672673, 0.13135524209127084, -0.24600054380189404, -0.1665552186801568, 0.19745723996112424, -0.09472813471379635, 0.13211502745333645, 0.09588293324654493, 0.03521925778502328, -0.05197566570156915, -0.3020658007799051, 0.2896889299631883, 0.11255144553446075, 0.31425230741564536, -0.006532240749046238, 0.14822518591475264, 0.05706197506963061, -0.07418276469668962, 0.009030442346587904, -0.11848783092285978, 0.06878759314775722, 0.21701130316927073, 0.15261606168813813, 0.32607324400709736, -0.3885971608643348, -0.22092509667715457, 0.11345834370989066, 0.12418561639128906, 0.09438929772681087, -0.07825937983878435, -0.29971105763768285, 0.10649666852819231, -0.13315950932665768, -0.09867080444326767, -0.022129493319771737, -0.03276241913390083, 0.09464297191544364, -0.3454740872312114, 0.06537976393249267, 0.03774172282562806, 0.014541036290172329, -0.04969583241006312, -0.10594398455702278, 0.013174757536532532, 0.08294773854824722, 0.05164522109911419, -0.038501111985558376, 0.12732375716456237, -0.10143591498987925, -0.14067498347761795, 0.332214269022911, -0.011371820801411334, -0.24511473305905476, 0.15084454754932633, -0.043454204626285874, -0.10650041771049683, 0.14791840695354164, 0.21515047695869818, 0.11082275354096459, -0.18309628582384405, 0.030792918044807088, -0.04041453743847007, 0.154087046165274, 0.05211079587093276, 0.013848918422451641, 0.10919968962955934, 0.17603631875613052, 0.09256041392238222, 0.16402629088674092, -0.12138708444256495, -0.12961877651739484, -0.3081535460570684, -0.10887062917742082, -0.20884026021449867, -0.04848275355135019, -0.14349438499972228, -0.14481934421082848, 0.40121410669297236, 0.19434820372674966, 0.1860718804005629, 0.1219879689051284, 0.3296843978823123, 0.14135069537581477, -0.02079806548471634, 0.08715993364174397, 0.19403107546500734, 0.11375520513870586, 0.07339164828503521, -0.2313353243546608, 0.136150806529336, 0.05078219250640553]
|
1,803.07789
|
QoE-Oriented Resource Allocation for 360-degree Video Transmission over
Heterogeneous Networks
|
Immersive media streaming, especially virtual reality (VR)/360-degree video
streaming which is very bandwidth demanding, has become more and more popular
due to the rapid growth of the multimedia and networking deployments. To better
explore the usage of resource and achieve better quality of experience (QoE)
perceived by users, this paper develops an application-layer scheme to jointly
exploit the available bandwidth from the LTE and Wi-Fi networks in 360-degree
video streaming. This newly proposed scheme and the corresponding solution
algorithms utilize the saliency of video, prediction of users' view and the
status information of users to obtain an optimal association of the users with
different Wi-Fi access points (APs) for maximizing the system's utility.
Besides, a novel buffer strategy is proposed to mitigate the influence of
short-time prediction problem for transmitting 360-degree videos in
time-varying networks. The promising performance and low complexity of the
proposed scheme and algorithms are validated in simulations with various
360-degree videos.
|
cs.MM cs.NI
|
immersive media streaming especially virtual reality vr360degree video streaming which is very bandwidth demanding has become more and more popular due to the rapid growth of the multimedia and networking deployments to better explore the usage of resource and achieve better quality of experience qoe perceived by users this paper develops an applicationlayer scheme to jointly exploit the available bandwidth from the lte and wifi networks in 360degree video streaming this newly proposed scheme and the corresponding solution algorithms utilize the saliency of video prediction of users view and the status information of users to obtain an optimal association of the users with different wifi access points aps for maximizing the systems utility besides a novel buffer strategy is proposed to mitigate the influence of shorttime prediction problem for transmitting 360degree videos in timevarying networks the promising performance and low complexity of the proposed scheme and algorithms are validated in simulations with various 360degree videos
|
[['immersive', 'media', 'streaming', 'especially', 'virtual', 'reality', 'vr360degree', 'video', 'streaming', 'which', 'is', 'very', 'bandwidth', 'demanding', 'has', 'become', 'more', 'and', 'more', 'popular', 'due', 'to', 'the', 'rapid', 'growth', 'of', 'the', 'multimedia', 'and', 'networking', 'deployments', 'to', 'better', 'explore', 'the', 'usage', 'of', 'resource', 'and', 'achieve', 'better', 'quality', 'of', 'experience', 'qoe', 'perceived', 'by', 'users', 'this', 'paper', 'develops', 'an', 'applicationlayer', 'scheme', 'to', 'jointly', 'exploit', 'the', 'available', 'bandwidth', 'from', 'the', 'lte', 'and', 'wifi', 'networks', 'in', '360degree', 'video', 'streaming', 'this', 'newly', 'proposed', 'scheme', 'and', 'the', 'corresponding', 'solution', 'algorithms', 'utilize', 'the', 'saliency', 'of', 'video', 'prediction', 'of', 'users', 'view', 'and', 'the', 'status', 'information', 'of', 'users', 'to', 'obtain', 'an', 'optimal', 'association', 'of', 'the', 'users', 'with', 'different', 'wifi', 'access', 'points', 'aps', 'for', 'maximizing', 'the', 'systems', 'utility', 'besides', 'a', 'novel', 'buffer', 'strategy', 'is', 'proposed', 'to', 'mitigate', 'the', 'influence', 'of', 'shorttime', 'prediction', 'problem', 'for', 'transmitting', '360degree', 'videos', 'in', 'timevarying', 'networks', 'the', 'promising', 'performance', 'and', 'low', 'complexity', 'of', 'the', 'proposed', 'scheme', 'and', 'algorithms', 'are', 'validated', 'in', 'simulations', 'with', 'various', '360degree', 'videos']]
|
[-0.1659439110436005, -0.02121055989383339, -0.051636084540393326, 0.03646208128896421, -0.10713270575703158, -0.20157808060878768, 0.092386691862046, 0.437729386128969, -0.2610732587054372, -0.3146752006035637, 0.06740486710680069, -0.27878541829270104, -0.1708629176129478, 0.17179636816288552, -0.17908372146125834, 0.09582301250631715, 0.08882379628923516, 0.04682802889109045, -0.0014336273745428046, -0.30573248093367206, 0.2853613404236589, 0.13414619401000538, 0.4244571356949481, 0.0669870839247105, 0.08447508222775764, -0.0029535525169997632, -0.08256795277891608, -0.033743881716093584, -0.07149673692198688, 0.17412582197674104, 0.33408881998137124, 0.22473805026429428, 0.35187577929758984, -0.43957444670452894, -0.2554680011416604, 0.04332976433291257, 0.15999245081798402, 0.05180296165998662, -0.09621002406956078, -0.35054883325786945, 0.16474753171175283, -0.23025578911138045, -0.012060888882842846, -0.05810148152522743, -0.0461532627202135, 0.0196338781180592, -0.31689602645210824, -0.0191101774803133, -0.07091784405268052, 0.05689055209543992, -0.05725563607347204, -0.030404680794068648, 0.042041511071525366, 0.2312248195015051, 0.07468018046725396, 0.014672230855809742, 0.11589464909917155, -0.18448160134494765, -0.1295229909645224, 0.4585374048911035, -0.00934167107863521, -0.1715283147059381, 0.21479553920398284, -0.006571102890415819, -0.05811201561659623, 0.165573888666952, 0.2810909820270011, 0.08237653895426396, -0.19162892492778308, -0.022401504975844887, -0.015771891068298273, 0.16939890547353145, 0.07651467786386743, 0.11378174378194955, 0.14425122984775718, 0.24966396835281865, 0.1158681158671857, 0.08609887060116637, -0.0758479787581056, -0.09612607768458592, -0.1274228216898809, -0.14546577360287502, -0.19230235961580336, -0.056494068680935865, -0.12917502901090502, -0.11821640171594434, 0.37312015022441547, 0.22285005528262103, 0.1282948506708777, 0.1025686588632729, 0.42303020142883596, 0.036767509536116155, 0.0610752275618785, 0.1436020199892825, 0.1331243246594178, -0.017313355120358528, 0.2599740236900844, -0.1882004437940921, 0.0697434353370026, 0.009925156121154303]
|
1,803.0779
|
Linear Tidal Vestige found in the WM Sheet
|
We present a vestige of the linear tidal influence on the spin orientations
of the constituent galaxies of the WM sheet discovered in the vicinity of the
Virgo cluster and the Local Void. The WM sheet is chosen as an optimal target
since it has a rectangular parallelepiped-like shape whose three sides are in
parallel with the supergalactic Cartesian axes. Determining three probability
density functions of the absolute values of the supergalactic Cartesian
components of the spin vectors of the WM sheet galaxies, we investigate their
alignments with the principal directions of the surrounding large-scale tidal
field. When the WM sheet galaxies located in the central region within the
distance of $2\,h^{-1}$Mpc are excluded, the spin vectors of the remaining WM
sheet galaxies are found to be weakly aligned, strongly aligned, and strongly
anti-aligned with the minor, intermediate and major principal directions of the
surrounding large-scale tidal field, respectively. To examine whether or not
the origin of the observed alignment tendency from the WM sheet is the linear
tidal effect, we infer the eigenvalues of the linear tidal tensor from the
axial ratios of the WM sheet with the help of the Zel'dovich approximation and
conduct a full analytic evaluation of the prediction of the linear tidal torque
model for the three probability density functions. A detailed comparison
between the analytical and the observational results reveals a good
quantitative agreement not only in the behaviors but also in the amplitudes of
the three probability density functions.
|
astro-ph.CO
|
we present a vestige of the linear tidal influence on the spin orientations of the constituent galaxies of the wm sheet discovered in the vicinity of the virgo cluster and the local void the wm sheet is chosen as an optimal target since it has a rectangular parallelepipedlike shape whose three sides are in parallel with the supergalactic cartesian axes determining three probability density functions of the absolute values of the supergalactic cartesian components of the spin vectors of the wm sheet galaxies we investigate their alignments with the principal directions of the surrounding largescale tidal field when the wm sheet galaxies located in the central region within the distance of 2h1mpc are excluded the spin vectors of the remaining wm sheet galaxies are found to be weakly aligned strongly aligned and strongly antialigned with the minor intermediate and major principal directions of the surrounding largescale tidal field respectively to examine whether or not the origin of the observed alignment tendency from the wm sheet is the linear tidal effect we infer the eigenvalues of the linear tidal tensor from the axial ratios of the wm sheet with the help of the zeldovich approximation and conduct a full analytic evaluation of the prediction of the linear tidal torque model for the three probability density functions a detailed comparison between the analytical and the observational results reveals a good quantitative agreement not only in the behaviors but also in the amplitudes of the three probability density functions
|
[['we', 'present', 'a', 'vestige', 'of', 'the', 'linear', 'tidal', 'influence', 'on', 'the', 'spin', 'orientations', 'of', 'the', 'constituent', 'galaxies', 'of', 'the', 'wm', 'sheet', 'discovered', 'in', 'the', 'vicinity', 'of', 'the', 'virgo', 'cluster', 'and', 'the', 'local', 'void', 'the', 'wm', 'sheet', 'is', 'chosen', 'as', 'an', 'optimal', 'target', 'since', 'it', 'has', 'a', 'rectangular', 'parallelepipedlike', 'shape', 'whose', 'three', 'sides', 'are', 'in', 'parallel', 'with', 'the', 'supergalactic', 'cartesian', 'axes', 'determining', 'three', 'probability', 'density', 'functions', 'of', 'the', 'absolute', 'values', 'of', 'the', 'supergalactic', 'cartesian', 'components', 'of', 'the', 'spin', 'vectors', 'of', 'the', 'wm', 'sheet', 'galaxies', 'we', 'investigate', 'their', 'alignments', 'with', 'the', 'principal', 'directions', 'of', 'the', 'surrounding', 'largescale', 'tidal', 'field', 'when', 'the', 'wm', 'sheet', 'galaxies', 'located', 'in', 'the', 'central', 'region', 'within', 'the', 'distance', 'of', '2h1mpc', 'are', 'excluded', 'the', 'spin', 'vectors', 'of', 'the', 'remaining', 'wm', 'sheet', 'galaxies', 'are', 'found', 'to', 'be', 'weakly', 'aligned', 'strongly', 'aligned', 'and', 'strongly', 'antialigned', 'with', 'the', 'minor', 'intermediate', 'and', 'major', 'principal', 'directions', 'of', 'the', 'surrounding', 'largescale', 'tidal', 'field', 'respectively', 'to', 'examine', 'whether', 'or', 'not', 'the', 'origin', 'of', 'the', 'observed', 'alignment', 'tendency', 'from', 'the', 'wm', 'sheet', 'is', 'the', 'linear', 'tidal', 'effect', 'we', 'infer', 'the', 'eigenvalues', 'of', 'the', 'linear', 'tidal', 'tensor', 'from', 'the', 'axial', 'ratios', 'of', 'the', 'wm', 'sheet', 'with', 'the', 'help', 'of', 'the', 'zeldovich', 'approximation', 'and', 'conduct', 'a', 'full', 'analytic', 'evaluation', 'of', 'the', 'prediction', 'of', 'the', 'linear', 'tidal', 'torque', 'model', 'for', 'the', 'three', 'probability', 'density', 'functions', 'a', 'detailed', 'comparison', 'between', 'the', 'analytical', 'and', 'the', 'observational', 'results', 'reveals', 'a', 'good', 'quantitative', 'agreement', 'not', 'only', 'in', 'the', 'behaviors', 'but', 'also', 'in', 'the', 'amplitudes', 'of', 'the', 'three', 'probability', 'density', 'functions']]
|
[-0.15396319239946143, 0.09456611318628497, -0.03953849313471497, 0.04628177885954711, -0.061342258204812886, -0.02184190445619666, 0.007970255022376135, 0.3700102104759607, -0.2248915688155723, -0.29184417539947954, 0.050932203619416465, -0.2722606955923438, -0.11569985948201483, 0.143270434695296, 0.039250210730896185, -0.006121766772519579, 0.022383592819916556, 0.04519202134602505, -0.09129127432481524, -0.23564190076297667, 0.3081929054727671, 0.06543600650840119, 0.2588751664565071, -0.02941893646493554, 0.08515818609443844, 0.0062171710308232785, -0.05855240371673689, 0.05198202119972251, -0.14508857495021685, 0.09599712534500363, 0.19236094087408093, 0.06837211200608642, 0.24215907562279798, -0.4375080891854328, -0.1277794729434927, 0.036115526928772505, 0.12519085162665627, 0.06261214183559488, -0.017360374642551312, -0.28508701666685765, 0.07484300210203625, -0.12100585689386506, -0.14311632512664024, 0.029650492220544486, 0.035064223281596404, 0.06905241194181144, -0.23555672863025034, 0.14471078207193908, 0.07528764926484924, 0.05378004484122894, -0.10586929813191509, -0.14695668626256042, -0.06658776166474782, 0.12830838813796186, 0.07962720115816022, 0.060751294607456895, 0.19131695701775034, -0.1700928046856625, -0.05348464975144989, 0.3963790080676115, -0.056701529793036706, -0.1778548172585376, 0.19820725238599554, -0.23459547850709853, -0.09105164867913594, 0.09343357402716809, 0.14462153475395725, 0.0859803585163852, -0.10639926002554827, 0.05721273152496414, -0.051776863721897826, 0.13794261159863871, 0.05614284142760224, -0.017309999496364234, 0.30487222710746475, 0.10618288067959585, 0.05888508583228061, 0.11466978241204757, -0.18274862109397186, -0.08160647853434116, -0.2695629641654153, -0.13521497044330616, -0.17439072097644026, 0.014457802973486308, -0.15211441450613716, -0.19124877745558538, 0.4124098817672825, 0.0987242914847915, 0.2385003839308858, 0.03399702692766995, 0.292785509294815, 0.09091043674156116, 0.07588759038624064, 0.08059275738196447, 0.29799685630371, 0.1941106425002828, 0.03404591578730672, -0.24064311323130166, 0.07366971110306741, 0.0048026197960172766]
|
1,803.07791
|
Investigation of $\alpha$-induced reactions on Sb isotopes relevant to
the astrophysical $\gamma$-process
|
The aim of the present work is to measure the
$^{121}$Sb($\alpha,\gamma$)$^{125}$I, $^{121}$Sb($\alpha$,n)$^{124}$I, and
$^{123}$Sb($\alpha$,n)$^{126}$I reaction cross sections. The $\alpha$-induced
reactions on natural and enriched antimony targets were investigated using the
activation technique. The ($\alpha$,$\gamma$) cross sections of $^{121}$Sb were
measured and are reported for first time. To determine the cross section of the
$^{121}$Sb($\alpha$,$\gamma$)$^{125}$I, $^{121}$Sb($\alpha$,n)$^{124}$I, and
$^{123}$Sb($\alpha$,n)$^{126}$I reactions, the yields of $\gamma$-rays
following the $\beta$-decay of the reaction products were measured. For the
measurement of the lowest cross sections, the characteristic X-rays were
counted with a LEPS (Low Energy Photon Spectrometer) detector. The cross
section of the $^{121}$Sb($\alpha$,$\gamma$)$^{125}$I,
$^{121}$Sb($\alpha$,n)$^{124}$I and $^{123}$Sb($\alpha$,n)$^{126}$I reactions
were measured with high precision in an energy range between 9.74 MeV to 15.48
MeV, close to the astrophysically relevant energy window. The results are
compared with the predictions of statistical model calculations. The
($\alpha$,n) data show that the $\alpha$ widths are predicted well for these
reactions. The ($\alpha$,$\gamma$) results are overestimated by the
calculations but this is due to the applied neutron- and $\gamma$ widths.
Relevant for the astrophysical reaction rate is the $\alpha$ width used in the
calculations.While for other reactions the $\alpha$ widths seem to have been
overestimated and their energy dependence was not described well in the
measured energy range, this is not the case for the reactions studied here. The
result is consistent with the proposal that additional reaction channels, such
as Coulomb excitation, may have led to the discrepancies found in other
reactions.
|
nucl-ex
|
the aim of the present work is to measure the 121sbalphagamma125i 121sbalphan124i and 123sbalphan126i reaction cross sections the alphainduced reactions on natural and enriched antimony targets were investigated using the activation technique the alphagamma cross sections of 121sb were measured and are reported for first time to determine the cross section of the 121sbalphagamma125i 121sbalphan124i and 123sbalphan126i reactions the yields of gammarays following the betadecay of the reaction products were measured for the measurement of the lowest cross sections the characteristic xrays were counted with a leps low energy photon spectrometer detector the cross section of the 121sbalphagamma125i 121sbalphan124i and 123sbalphan126i reactions were measured with high precision in an energy range between 974 mev to 1548 mev close to the astrophysically relevant energy window the results are compared with the predictions of statistical model calculations the alphan data show that the alpha widths are predicted well for these reactions the alphagamma results are overestimated by the calculations but this is due to the applied neutron and gamma widths relevant for the astrophysical reaction rate is the alpha width used in the calculationswhile for other reactions the alpha widths seem to have been overestimated and their energy dependence was not described well in the measured energy range this is not the case for the reactions studied here the result is consistent with the proposal that additional reaction channels such as coulomb excitation may have led to the discrepancies found in other reactions
|
[['the', 'aim', 'of', 'the', 'present', 'work', 'is', 'to', 'measure', 'the', '121sbalphagamma125i', '121sbalphan124i', 'and', '123sbalphan126i', 'reaction', 'cross', 'sections', 'the', 'alphainduced', 'reactions', 'on', 'natural', 'and', 'enriched', 'antimony', 'targets', 'were', 'investigated', 'using', 'the', 'activation', 'technique', 'the', 'alphagamma', 'cross', 'sections', 'of', '121sb', 'were', 'measured', 'and', 'are', 'reported', 'for', 'first', 'time', 'to', 'determine', 'the', 'cross', 'section', 'of', 'the', '121sbalphagamma125i', '121sbalphan124i', 'and', '123sbalphan126i', 'reactions', 'the', 'yields', 'of', 'gammarays', 'following', 'the', 'betadecay', 'of', 'the', 'reaction', 'products', 'were', 'measured', 'for', 'the', 'measurement', 'of', 'the', 'lowest', 'cross', 'sections', 'the', 'characteristic', 'xrays', 'were', 'counted', 'with', 'a', 'leps', 'low', 'energy', 'photon', 'spectrometer', 'detector', 'the', 'cross', 'section', 'of', 'the', '121sbalphagamma125i', '121sbalphan124i', 'and', '123sbalphan126i', 'reactions', 'were', 'measured', 'with', 'high', 'precision', 'in', 'an', 'energy', 'range', 'between', '974', 'mev', 'to', '1548', 'mev', 'close', 'to', 'the', 'astrophysically', 'relevant', 'energy', 'window', 'the', 'results', 'are', 'compared', 'with', 'the', 'predictions', 'of', 'statistical', 'model', 'calculations', 'the', 'alphan', 'data', 'show', 'that', 'the', 'alpha', 'widths', 'are', 'predicted', 'well', 'for', 'these', 'reactions', 'the', 'alphagamma', 'results', 'are', 'overestimated', 'by', 'the', 'calculations', 'but', 'this', 'is', 'due', 'to', 'the', 'applied', 'neutron', 'and', 'gamma', 'widths', 'relevant', 'for', 'the', 'astrophysical', 'reaction', 'rate', 'is', 'the', 'alpha', 'width', 'used', 'in', 'the', 'calculationswhile', 'for', 'other', 'reactions', 'the', 'alpha', 'widths', 'seem', 'to', 'have', 'been', 'overestimated', 'and', 'their', 'energy', 'dependence', 'was', 'not', 'described', 'well', 'in', 'the', 'measured', 'energy', 'range', 'this', 'is', 'not', 'the', 'case', 'for', 'the', 'reactions', 'studied', 'here', 'the', 'result', 'is', 'consistent', 'with', 'the', 'proposal', 'that', 'additional', 'reaction', 'channels', 'such', 'as', 'coulomb', 'excitation', 'may', 'have', 'led', 'to', 'the', 'discrepancies', 'found', 'in', 'other', 'reactions']]
|
[-0.029822187725221737, 0.16169579410786053, -0.03475115715458135, 0.10883503965014825, 0.026325418159588783, -0.0859927760262508, 0.021016026525952233, 0.3800235626442979, -0.20546078230060327, -0.3393411912567293, -0.023975689113528157, -0.34665150827883434, 0.006320666371417853, 0.22217023463502603, 0.04499574144914125, 0.10217544888728299, 0.0676536278265606, 0.06236155175720341, -0.02188180056012546, -0.1957879325399214, 0.2961810880592869, 0.15052024177954687, 0.23086948648754818, 0.16246266049759772, 0.03453589323956597, -0.024136462988099083, -0.0507553643527596, -0.050260247666543974, -0.18083489283581003, 0.08305138260281335, 0.29006439708852366, 0.0476369971477349, 0.11151055275695398, -0.36723258544225246, -0.1867426817091958, 0.10379980886549069, 0.11303066381175692, 0.08091899957022784, -0.038493931971121734, -0.2581786022123803, 0.08539213225400696, -0.16179069231535928, -0.08641783984639914, -0.04024661632817394, 0.04039365388453007, 0.07095453180566741, -0.25238764273623626, 0.05520413843720841, -0.015510244028215917, 0.03193365853846141, -0.11166108910983893, -0.2132451766713833, -0.028210517620512594, 0.09496192283695563, 0.06836174133204623, 0.0055773068166066276, 0.17853883880500993, -0.07684158391978903, -0.09025338304539522, 0.38149769023099606, -0.03636502058555682, -0.12716439582873135, 0.14047973929555155, -0.18593919972069367, -0.12473691049138627, 0.21983610567015907, 0.1391533958192061, 0.13264649511741786, -0.16428111726418138, 0.05309831960418402, 0.040494129991081235, 0.15459854981915366, 0.10103352212075455, -0.005309991538524628, 0.09801454666109445, 0.16990028989578906, -0.05056245356293706, 0.03813065156233885, -0.17712593610534288, -0.05386693705222569, -0.2999748871099049, -0.1374844952195417, -0.08213532633380964, 0.06392638358144419, 0.0033811593102655024, -0.07320166071294806, 0.3080662024817381, 0.06470049619529164, 0.2611625535287506, 0.0068956008404105285, 0.2538620590600961, 0.15094604112431018, 0.0837661829694601, 0.0014229217495691652, 0.33805881352551903, 0.18870485851269525, 0.10761013784795068, -0.22380070465345245, 0.13833579775528052, -0.01796189640299417]
|
1,803.07792
|
Subfields of algebraically maximal Kaplansky fields
|
Using the ramification theory of tame and Kaplansky fields, we show that
maximal Kaplansky fields contain maximal immediate extensions of each of their
subfields. Likewise, algebraically maximal Kaplansky fields contain maximal
immediate algebraic extensions of each of their subfields. This study is
inspired by problems that appear in henselian valued fields of rank higher than
1 when a Hensel root of a polynomial is approximated by the elements generated
by a (transfinite) Newton algorithm.
|
math.AC
|
using the ramification theory of tame and kaplansky fields we show that maximal kaplansky fields contain maximal immediate extensions of each of their subfields likewise algebraically maximal kaplansky fields contain maximal immediate algebraic extensions of each of their subfields this study is inspired by problems that appear in henselian valued fields of rank higher than 1 when a hensel root of a polynomial is approximated by the elements generated by a transfinite newton algorithm
|
[['using', 'the', 'ramification', 'theory', 'of', 'tame', 'and', 'kaplansky', 'fields', 'we', 'show', 'that', 'maximal', 'kaplansky', 'fields', 'contain', 'maximal', 'immediate', 'extensions', 'of', 'each', 'of', 'their', 'subfields', 'likewise', 'algebraically', 'maximal', 'kaplansky', 'fields', 'contain', 'maximal', 'immediate', 'algebraic', 'extensions', 'of', 'each', 'of', 'their', 'subfields', 'this', 'study', 'is', 'inspired', 'by', 'problems', 'that', 'appear', 'in', 'henselian', 'valued', 'fields', 'of', 'rank', 'higher', 'than', '1', 'when', 'a', 'hensel', 'root', 'of', 'a', 'polynomial', 'is', 'approximated', 'by', 'the', 'elements', 'generated', 'by', 'a', 'transfinite', 'newton', 'algorithm']]
|
[-0.18932519530927813, 0.11641046202212975, -0.07065400569322142, 0.0842032372728116, -0.11598752591935163, -0.13022789613947877, -0.008460088301059866, 0.30749945486014757, -0.3381081663474843, -0.21454375122069708, 0.12932590432811175, -0.2257159030052355, -0.15926861958074812, 0.25552507544037056, -0.11114930405558364, -0.07355196177456025, -0.01966996001696365, 0.16721434974287813, -0.06168862669476988, -0.3917193574377814, 0.34966567650160474, -0.07464160888480979, 0.16174245506172646, 0.008768457579552321, 0.13384654727525305, 0.03865019145824418, -0.06544317755646803, 0.07730910797427232, -0.09655237700133364, 0.17263977295039473, 0.315933514521709, 0.17282185437963218, 0.30902042687710096, -0.3652227778440794, -0.15414550618860065, 0.22702540293637966, 0.14916457529053898, 0.03076731979947638, -0.036386704084941664, -0.24789553800773984, 0.14771007099566427, -0.15563386977599883, -0.2103089778117735, -0.05490123425182458, 0.047479275417375705, 0.07162824024546992, -0.266602063952706, 0.018349073361605406, 0.10466764062466855, 0.2444757416819197, -0.05130543402471655, -0.13005788523445813, -0.005129609206641042, 0.02083472152298782, 0.018233661357363738, 0.02778267940015507, 0.12307675520738436, -0.14972701270724773, -0.22322248841157635, 0.3175210295672956, -0.05324887969264465, -0.17019000303352605, 0.13916870745251309, -0.17642023051283448, -0.08765487951805463, 0.12678473092760337, 0.06807986547465662, 0.14769974978982056, -0.02056512457882589, 0.2454733464267495, -0.148441544589209, 0.07838954766457146, 0.1328405147116329, 0.029347061152834242, 0.13371528309417535, 0.002793692653319119, 0.09545146375642838, 0.13527885913798535, 0.08967839689874971, -0.03469295203182343, -0.3296528922242893, -0.16313220105587026, -0.1476883825380355, 0.10622138141125843, -0.14131810160560654, -0.19022197769703092, 0.4428008729151475, 0.1190828928170172, 0.14383842558222446, 0.10183330782613642, 0.2120568991663891, 0.07538312535128884, 0.12561831016068323, 0.07565161496451175, 0.11158612934318748, 0.2815116116921795, -0.032261490104468285, -0.1264823727888634, -0.03237925767599655, 0.16843216752356574]
|
1,803.07793
|
High-dimensional covariance matrices in elliptical distributions with
application to spherical test
|
This paper discusses fluctuations of linear spectral statistics of
high-dimensional sample covariance matrices when the underlying population
follows an elliptical distribution. Such population often possesses high order
correlations among their coordinates, which have great impact on the asymptotic
behaviors of linear spectral statistics. Taking such kind of dependency into
consideration, we establish a new central limit theorem for the linear spectral
statistics in this paper for a class of elliptical populations. This general
theoretical result has wide applications and, as an example, it is then applied
to test the sphericity of elliptical populations.
|
math.ST stat.TH
|
this paper discusses fluctuations of linear spectral statistics of highdimensional sample covariance matrices when the underlying population follows an elliptical distribution such population often possesses high order correlations among their coordinates which have great impact on the asymptotic behaviors of linear spectral statistics taking such kind of dependency into consideration we establish a new central limit theorem for the linear spectral statistics in this paper for a class of elliptical populations this general theoretical result has wide applications and as an example it is then applied to test the sphericity of elliptical populations
|
[['this', 'paper', 'discusses', 'fluctuations', 'of', 'linear', 'spectral', 'statistics', 'of', 'highdimensional', 'sample', 'covariance', 'matrices', 'when', 'the', 'underlying', 'population', 'follows', 'an', 'elliptical', 'distribution', 'such', 'population', 'often', 'possesses', 'high', 'order', 'correlations', 'among', 'their', 'coordinates', 'which', 'have', 'great', 'impact', 'on', 'the', 'asymptotic', 'behaviors', 'of', 'linear', 'spectral', 'statistics', 'taking', 'such', 'kind', 'of', 'dependency', 'into', 'consideration', 'we', 'establish', 'a', 'new', 'central', 'limit', 'theorem', 'for', 'the', 'linear', 'spectral', 'statistics', 'in', 'this', 'paper', 'for', 'a', 'class', 'of', 'elliptical', 'populations', 'this', 'general', 'theoretical', 'result', 'has', 'wide', 'applications', 'and', 'as', 'an', 'example', 'it', 'is', 'then', 'applied', 'to', 'test', 'the', 'sphericity', 'of', 'elliptical', 'populations']]
|
[-0.06506760433436401, 0.04443998043256391, -0.14537827243968363, 0.1207111260317947, -0.06396962822444978, -0.06886128322171267, -0.005166141879594614, 0.3466935759029722, -0.2570234233994157, -0.3175828659967069, 0.09785844358585534, -0.24346280424644098, -0.14056469473026453, 0.1897953884495843, -0.0878343060362323, 0.05657763749621408, 0.03917668943834161, -0.009237776159919718, -0.05872183487254886, -0.22878193321527654, 0.34606774877356267, 0.05365103487205762, 0.3166659010313852, -0.041992258836304946, 0.10820847504361662, 0.06033429496931613, -0.02453222080704666, 0.03081449134630822, -0.10814899884624987, 0.10553842696851941, 0.26714570728200737, 0.11690601769093704, 0.32229570764046844, -0.36155247683247227, -0.20654019734431658, 0.15912595788838083, 0.1721079587656003, 0.10602625516889196, -0.07406811426789249, -0.2369242836470886, 0.06607651226197479, -0.19142839848314241, -0.18987204566077198, -0.04865060656541778, 0.043119448530037074, 0.0655508422022385, -0.28125000280398194, 0.10691310870411094, 0.14896381494679278, 0.09573044167250715, -0.009086321563690259, -0.1240023382406141, 0.015223736594361003, 0.13702037577393406, 0.06992356668687075, -0.0794835875514314, 0.10035546685779287, -0.11155051530479022, -0.05184970831658731, 0.34757385042405897, -0.020329365087422713, -0.17730200419863384, 0.18265914292104782, -0.18858912549111792, -0.1969178828525968, 0.06766938608420152, 0.25437025037864525, 0.08635387607219239, -0.16804970175817094, 0.09638704059042177, -0.062421674669910505, 0.14485028325029278, 0.01658287185734959, 0.08588741021543761, 0.22080829487212242, 0.1621025994755528, 0.060241667128178064, 0.1490376099183034, -0.11419504455050393, -0.08694262685434472, -0.2746453335038036, -0.12674251829664554, -0.21534521611888083, 0.07635421811613025, -0.15324740624039618, -0.20531255994192374, 0.4247849528747861, 0.09849036513997983, 0.19819535151804968, 0.07960433103970342, 0.2425248531764874, 0.16475655402742848, 0.020161769550634166, 0.03835172366891657, 0.19735516964267658, 0.18931801173140003, 0.05894032768124054, -0.1766288373519176, 0.07489827674843612, -0.016545230738057564]
|
1,803.07794
|
Measurement of activation cross-section of long-lived products in
deuteron induced nuclear reactions on palladium in the 30-50 MeV energy range
|
Excitation functions were measured in the 31 - 49.2 MeV energy range for the
natPd(d,xn)111,110m,106m,105,104g,103Ag, natPd(d,x) 111m,109,101,100Pd,
natPd(d,x), 105,102m,102g,101m,101g,100,99m,99gRh and natPd(d,x)103,97Ru
nuclear reactions by using the stacked foil irradiation technique. The
experimental results are compared with our previous results and with the
theoretical predictions calculated with the ALICE-D, EMPIRE-D and TALYS (TENDL
libraries) codes.
|
nucl-ex
|
excitation functions were measured in the 31 492 mev energy range for the natpddxn111110m106m105104g103ag natpddx 111m109101100pd natpddx 105102m102g101m101g10099m99grh and natpddx10397ru nuclear reactions by using the stacked foil irradiation technique the experimental results are compared with our previous results and with the theoretical predictions calculated with the aliced empired and talys tendl libraries codes
|
[['excitation', 'functions', 'were', 'measured', 'in', 'the', '31', '492', 'mev', 'energy', 'range', 'for', 'the', 'natpddxn111110m106m105104g103ag', 'natpddx', '111m109101100pd', 'natpddx', '105102m102g101m101g10099m99grh', 'and', 'natpddx10397ru', 'nuclear', 'reactions', 'by', 'using', 'the', 'stacked', 'foil', 'irradiation', 'technique', 'the', 'experimental', 'results', 'are', 'compared', 'with', 'our', 'previous', 'results', 'and', 'with', 'the', 'theoretical', 'predictions', 'calculated', 'with', 'the', 'aliced', 'empired', 'and', 'talys', 'tendl', 'libraries', 'codes']]
|
[0.07568192459206949, 0.10672249726237769, -0.036956712405415294, 0.0504537017500781, 0.09267277685873349, -0.11242866516113281, 0.017928555800995612, 0.4503013215800549, -0.17015498057205944, -0.4087650285677073, 0.02389741808602071, -0.39415630838893195, 0.0328843126251818, 0.27697867812945487, 0.061342031397718065, 0.13736375275642632, 0.15046471925551427, -0.0636252978261798, -0.09041412331243144, -0.21758480425527754, 0.24074534967323727, 0.18254263084778127, 0.2678041324177955, 0.10057031533661041, -0.007079224131922138, 0.0008693207947022103, -0.05274508278222477, -0.07218985945144867, -0.1889657710599614, 0.11713627908141055, 0.26836753982872247, 0.03868070601465854, 0.09748666866266346, -0.40998397947863696, -0.21301049136735023, -0.023369487077790373, 0.048191780214534796, 0.12283870771290745, -0.11290959552168212, -0.2748876324200884, 0.11103629126669244, -0.21799624279299948, -0.03142929066745366, -0.04847516761498248, -0.04560652056193732, 0.14342796382434825, -0.28719857604579724, 0.040535978180296875, -0.0641731531086794, 0.09955757222277054, -0.1596266058610475, -0.29898257414869805, -0.04283886898725115, 0.06785670778852829, 0.012652832360819299, 0.10101110697228541, 0.18072773209039836, -0.03913610089728807, -0.15635312435791848, 0.3475722477355219, -0.06779708933243726, -0.11174083505063614, 0.14257116257609365, -0.12695933217579064, -0.08844587543949564, 0.1573975148036125, 0.10168235670735544, 0.10192149544649935, -0.14616640029039155, 0.030934064784037704, -0.02004757089579993, 0.1953849164878038, 0.04755235315756278, -0.017979104854562816, 0.07764803875792534, 0.15405195676771172, -0.17277474083164904, 0.08643205357626318, -0.16074858362132566, -0.06830135170132556, -0.24769823794114462, -0.012911937853440325, -0.0955654516162232, -0.0022080024268398895, -0.059404578504828796, -0.034312994159916614, 0.3798388555408158, 0.08018925904910615, 0.18191265425783523, 0.08499801945575375, 0.29379324741820073, 0.06882382111197853, 0.1117929438267775, 0.09846156690903801, 0.3050069306442078, 0.2008774133617098, 0.09790406592111005, -0.2164279020916512, 0.03269814002139375, -0.02477521573173556]
|
1,803.07795
|
Phenomenological study on the decay widths of $\Upsilon(nS)\rightarrow
\bar{d}^{\ast}(2380)+X$
|
The decay widths of $\Upsilon(nS)$ $\rightarrow$ $\bar{d}^{\ast}(2380)+X$
with $n=1,2,3$ are studied in a phenomenological way. With the help of crossing
symmetry, the decay widths are obtained by investigating the imaginary part of
the forward scattering amplitudes between $d^\ast$ and $\Upsilon(nS)$. The wave
functions of $d^\ast$ and deuteron obtained in previous studies are used for
calculating the amplitude. The interaction between $d^{\ast}$ ($d$) and
$\Upsilon$ is governed by the quark-meson interaction where the coupling
constant is determined by fitting the observed widths of $\Upsilon(nS)$
$\rightarrow$ $\bar{d}+X$. The numerical results show that the decay widths of
$\Upsilon(nS)$ $\rightarrow$ $\bar{d}^{\ast}+X$ are about $2 - 10$ times
smaller than that of $\bar{d}+X$. The calculated momentum of $\bar{d^*}$ is in
the range $0.3-0.8$ GeV. Therefore, it is very likely that one can find
$\bar{d}^\ast(2380)$ in these semi-inclusive decay processes.
|
hep-ph nucl-th
|
the decay widths of upsilonns rightarrow bardast2380x with n123 are studied in a phenomenological way with the help of crossing symmetry the decay widths are obtained by investigating the imaginary part of the forward scattering amplitudes between dast and upsilonns the wave functions of dast and deuteron obtained in previous studies are used for calculating the amplitude the interaction between dast d and upsilon is governed by the quarkmeson interaction where the coupling constant is determined by fitting the observed widths of upsilonns rightarrow bardx the numerical results show that the decay widths of upsilonns rightarrow bardastx are about 2 10 times smaller than that of bardx the calculated momentum of bard is in the range 0308 gev therefore it is very likely that one can find bardast2380 in these semiinclusive decay processes
|
[['the', 'decay', 'widths', 'of', 'upsilonns', 'rightarrow', 'bardast2380x', 'with', 'n123', 'are', 'studied', 'in', 'a', 'phenomenological', 'way', 'with', 'the', 'help', 'of', 'crossing', 'symmetry', 'the', 'decay', 'widths', 'are', 'obtained', 'by', 'investigating', 'the', 'imaginary', 'part', 'of', 'the', 'forward', 'scattering', 'amplitudes', 'between', 'dast', 'and', 'upsilonns', 'the', 'wave', 'functions', 'of', 'dast', 'and', 'deuteron', 'obtained', 'in', 'previous', 'studies', 'are', 'used', 'for', 'calculating', 'the', 'amplitude', 'the', 'interaction', 'between', 'dast', 'd', 'and', 'upsilon', 'is', 'governed', 'by', 'the', 'quarkmeson', 'interaction', 'where', 'the', 'coupling', 'constant', 'is', 'determined', 'by', 'fitting', 'the', 'observed', 'widths', 'of', 'upsilonns', 'rightarrow', 'bardx', 'the', 'numerical', 'results', 'show', 'that', 'the', 'decay', 'widths', 'of', 'upsilonns', 'rightarrow', 'bardastx', 'are', 'about', '2', '10', 'times', 'smaller', 'than', 'that', 'of', 'bardx', 'the', 'calculated', 'momentum', 'of', 'bard', 'is', 'in', 'the', 'range', '0308', 'gev', 'therefore', 'it', 'is', 'very', 'likely', 'that', 'one', 'can', 'find', 'bardast2380', 'in', 'these', 'semiinclusive', 'decay', 'processes']]
|
[-0.10671356085043114, 0.2391516405909967, -0.03485007588393413, 0.10713802023360935, 0.01500034319738356, -0.11916506672636247, -0.008405870208158516, 0.3753788660065486, -0.1886714840737673, -0.2331617263145745, -0.028736514780813686, -0.3372519184978536, -0.020677728872173107, 0.16420070349883575, 0.16815695086350807, 0.0816792915808037, 0.059425575422266355, 0.011485848835526178, -0.06399703223723918, -0.14490186563478066, 0.29411796688173825, -0.022466989810793446, 0.17988352085678624, 0.13220118736275113, -0.06519375216359129, 0.010252370563550637, -0.020570969972043083, -0.10197494833801801, -0.19179307033857465, 0.06030851456050116, 0.21635537890520376, 0.07586524214308996, 0.12813005527624718, -0.3507348008238925, -0.11007027463324798, 0.09740129403340128, 0.2023934220787711, 0.05383988987529077, 0.027466000222529357, -0.37001798218116166, 0.1275760411356504, -0.13115940119605513, -0.11028800945227536, -0.030689152147477635, 0.07672741952208946, 0.0051681999958908325, -0.318989023564455, 0.10778046219538037, -0.037897882187882294, 0.02894639391452074, -0.03927213868771035, -0.2480498480395629, -0.06440022301931794, 0.04833374357639024, 0.1359246457568728, 0.09964271314943639, 0.13719332500522097, -0.1304448566453245, -0.1445427873565887, 0.3859810232525118, -0.08673766051081028, -0.16411341341781036, 0.1285866547232637, -0.2159744011488958, -0.09533977853492476, 0.2151677562496983, 0.1501654117045781, 0.0811775843326289, -0.1271727861979833, 0.11010901296663528, -0.004935155665533294, 0.16736079473182774, 0.13276837521161025, 0.07428084286288, 0.1125644813470829, 0.15235117547428953, -0.09679330608162742, 0.07175571310083168, -0.09490745424722823, -0.08316216282546521, -0.37473930878421435, -0.09326614459546713, -0.11589274649651578, 0.11170412405929081, -0.04584079436351133, -0.027302173596735185, 0.3436238379110224, 0.025598380678834822, 0.30091497461813, 0.06062838966922405, 0.25960852182828464, 0.17340559493750335, 0.0632942732477274, 0.061689022817434026, 0.3400317554720319, 0.21375254271372865, 0.0733493937501827, -0.2950097416241009, 0.0597697406147535, 0.005619474066994511]
|
1,803.07796
|
Well-posedness of an evolution problem with nonlocal diffusion
|
We prove the well-posedness of a general evolution reaction-nonlocal
diffusion problem under two sets of assumptions. In the first set, the main
hypothesis is the Lipschitz continuity of the range kernel and the bounded
variation of the spatial kernel and the initial datum. In the second set of
assumptions, we relax the Lipschitz continuity of the range kernel to H\"older
continuity, and assume monotonic behavior. In this case, the spatial kernel and
the initial data can be just integrable functions. The main applications of
this model are related to the fields of Image Processing and Population
Dynamics.
|
math.AP
|
we prove the wellposedness of a general evolution reactionnonlocal diffusion problem under two sets of assumptions in the first set the main hypothesis is the lipschitz continuity of the range kernel and the bounded variation of the spatial kernel and the initial datum in the second set of assumptions we relax the lipschitz continuity of the range kernel to holder continuity and assume monotonic behavior in this case the spatial kernel and the initial data can be just integrable functions the main applications of this model are related to the fields of image processing and population dynamics
|
[['we', 'prove', 'the', 'wellposedness', 'of', 'a', 'general', 'evolution', 'reactionnonlocal', 'diffusion', 'problem', 'under', 'two', 'sets', 'of', 'assumptions', 'in', 'the', 'first', 'set', 'the', 'main', 'hypothesis', 'is', 'the', 'lipschitz', 'continuity', 'of', 'the', 'range', 'kernel', 'and', 'the', 'bounded', 'variation', 'of', 'the', 'spatial', 'kernel', 'and', 'the', 'initial', 'datum', 'in', 'the', 'second', 'set', 'of', 'assumptions', 'we', 'relax', 'the', 'lipschitz', 'continuity', 'of', 'the', 'range', 'kernel', 'to', 'holder', 'continuity', 'and', 'assume', 'monotonic', 'behavior', 'in', 'this', 'case', 'the', 'spatial', 'kernel', 'and', 'the', 'initial', 'data', 'can', 'be', 'just', 'integrable', 'functions', 'the', 'main', 'applications', 'of', 'this', 'model', 'are', 'related', 'to', 'the', 'fields', 'of', 'image', 'processing', 'and', 'population', 'dynamics']]
|
[-0.11012429536882944, 0.04286868076693887, -0.09714509051991627, 0.10074022653983168, -0.0695149446061502, -0.054283382016971395, -0.023348264599917457, 0.3605991095828358, -0.37564337397149455, -0.2253519316194191, 0.15746589234549901, -0.242056936743514, -0.07702254372998141, 0.16227540552063147, -0.07054045525728725, 0.11575705028008088, 0.06194489146097718, 0.03217496555104541, -0.08366409173080076, -0.2605517229142909, 0.4339876228768844, -0.048528613086091354, 0.25566066064250964, 0.06757363898395852, 0.12756305952522476, -0.011013379577586116, -0.008339023950005261, -0.047888019005768, -0.13340740947508797, 0.125650966247728, 0.1705871309483579, 0.12583171353617217, 0.32807342483526253, -0.4029934754556355, -0.2298071081362044, 0.17565867063240148, 0.07410671333491337, 0.046815777342999354, -0.002162445319603042, -0.2696504995862294, 0.09470271307994456, -0.06963773380266502, -0.15897109627743097, -0.034212695085443556, 0.01411634207276317, 0.0933701976876667, -0.31667751747105893, 0.1195179078883181, 0.12726048713496615, 0.04337134541128762, -0.17030593855694556, -0.07011889735076693, -0.009643957241981601, 0.10801101864005129, 0.048017865790219126, 0.04138050008623395, 0.1188299205484024, -0.13970770006805347, -0.021731027372879907, 0.33759689537691884, -0.08415765427829076, -0.25842817425048753, 0.20780256102443673, -0.19934610222359575, -0.13581742656242568, 0.05013856908772141, 0.16123014616702372, 0.1179152559391999, -0.1713496453303378, 0.14640625285088996, -0.04149477345587608, 0.14713171812278839, 0.07539534598375515, 0.029138717594832997, 0.07266367006620082, 0.15000207323464565, 0.1261457427269003, 0.15666219423656003, -0.056682439307527, -0.0923532274561391, -0.3904217342690875, -0.13220880002821409, -0.2090744141411657, 0.04941281424059222, -0.1465026014088835, -0.1874278767306047, 0.4224942239197844, 0.17984187728628362, 0.20025176337609688, 0.10698427671256165, 0.23901273213656773, 0.1492240887191656, 0.02308590278456298, 0.07807870514322228, 0.1739189388366261, 0.14421294963297746, 0.13821891530339295, -0.18489111062353913, 0.10596973485371564, 0.07422199606223027]
|
1,803.07797
|
Innovative design and construction technique for the Cylindrical GEM
detector for the BESIII experiment
|
Gas detector are very light instrument used in high energy physics to measure
the particle properties: position and momentum. Through high electric field is
possible to use the Gas Electron Multiplier (GEM) technology to detect the
particles and to exploit the its properties to construct a large area detector,
such as the new IT for BESIII. The state of the art in the GEM production allow
to create very large area GEM foils (up to 50x100 cm2) and thanks to the small
thickness of these foil is it possible to shape it to the desired form: a
Cylindrical Gas Electron Multiplier (CGEM) is then proposed. The innovative
construction technique based on Rohacell, a PMI foam, will give solidity to
cathode and anode with a very low impact on material budget. The entire
detector is sustained by permaglass rings glued at the edges. These rings are
use to assembly the CGEM together with a dedicated Vertical Insertion System
and moreover there is placed the On-Detector electronic. The anode has been
improved w.r.t. the state of the art through a jagged readout that minimize the
inter-strip capacitance. The mechanical challenge of this detector requires a
precision of the entire geometry within few hundreds of microns in the whole
area. In this presentation will be presented an overview of the construction
technique and the validation of this technique through the realization of a
CGEM and its first tests. These activities are performed within the framework
of the BESIIICGEM Project (645664), funded by the European Commission in the
action H2020-RISE-MSCA-2014.
|
physics.ins-det
|
gas detector are very light instrument used in high energy physics to measure the particle properties position and momentum through high electric field is possible to use the gas electron multiplier gem technology to detect the particles and to exploit the its properties to construct a large area detector such as the new it for besiii the state of the art in the gem production allow to create very large area gem foils up to 50x100 cm2 and thanks to the small thickness of these foil is it possible to shape it to the desired form a cylindrical gas electron multiplier cgem is then proposed the innovative construction technique based on rohacell a pmi foam will give solidity to cathode and anode with a very low impact on material budget the entire detector is sustained by permaglass rings glued at the edges these rings are use to assembly the cgem together with a dedicated vertical insertion system and moreover there is placed the ondetector electronic the anode has been improved wrt the state of the art through a jagged readout that minimize the interstrip capacitance the mechanical challenge of this detector requires a precision of the entire geometry within few hundreds of microns in the whole area in this presentation will be presented an overview of the construction technique and the validation of this technique through the realization of a cgem and its first tests these activities are performed within the framework of the besiiicgem project 645664 funded by the european commission in the action h2020risemsca2014
|
[['gas', 'detector', 'are', 'very', 'light', 'instrument', 'used', 'in', 'high', 'energy', 'physics', 'to', 'measure', 'the', 'particle', 'properties', 'position', 'and', 'momentum', 'through', 'high', 'electric', 'field', 'is', 'possible', 'to', 'use', 'the', 'gas', 'electron', 'multiplier', 'gem', 'technology', 'to', 'detect', 'the', 'particles', 'and', 'to', 'exploit', 'the', 'its', 'properties', 'to', 'construct', 'a', 'large', 'area', 'detector', 'such', 'as', 'the', 'new', 'it', 'for', 'besiii', 'the', 'state', 'of', 'the', 'art', 'in', 'the', 'gem', 'production', 'allow', 'to', 'create', 'very', 'large', 'area', 'gem', 'foils', 'up', 'to', '50x100', 'cm2', 'and', 'thanks', 'to', 'the', 'small', 'thickness', 'of', 'these', 'foil', 'is', 'it', 'possible', 'to', 'shape', 'it', 'to', 'the', 'desired', 'form', 'a', 'cylindrical', 'gas', 'electron', 'multiplier', 'cgem', 'is', 'then', 'proposed', 'the', 'innovative', 'construction', 'technique', 'based', 'on', 'rohacell', 'a', 'pmi', 'foam', 'will', 'give', 'solidity', 'to', 'cathode', 'and', 'anode', 'with', 'a', 'very', 'low', 'impact', 'on', 'material', 'budget', 'the', 'entire', 'detector', 'is', 'sustained', 'by', 'permaglass', 'rings', 'glued', 'at', 'the', 'edges', 'these', 'rings', 'are', 'use', 'to', 'assembly', 'the', 'cgem', 'together', 'with', 'a', 'dedicated', 'vertical', 'insertion', 'system', 'and', 'moreover', 'there', 'is', 'placed', 'the', 'ondetector', 'electronic', 'the', 'anode', 'has', 'been', 'improved', 'wrt', 'the', 'state', 'of', 'the', 'art', 'through', 'a', 'jagged', 'readout', 'that', 'minimize', 'the', 'interstrip', 'capacitance', 'the', 'mechanical', 'challenge', 'of', 'this', 'detector', 'requires', 'a', 'precision', 'of', 'the', 'entire', 'geometry', 'within', 'few', 'hundreds', 'of', 'microns', 'in', 'the', 'whole', 'area', 'in', 'this', 'presentation', 'will', 'be', 'presented', 'an', 'overview', 'of', 'the', 'construction', 'technique', 'and', 'the', 'validation', 'of', 'this', 'technique', 'through', 'the', 'realization', 'of', 'a', 'cgem', 'and', 'its', 'first', 'tests', 'these', 'activities', 'are', 'performed', 'within', 'the', 'framework', 'of', 'the', 'besiiicgem', 'project', '645664', 'funded', 'by', 'the', 'european', 'commission', 'in', 'the', 'action', 'h2020risemsca2014']]
|
[-0.07454983918522708, 0.09754409589040589, -0.07053713750027388, -0.0014459062543923993, -0.05004318442985979, -0.11714898926981417, 0.02150845081467493, 0.373845010120199, -0.2380760107894402, -0.3456019222758621, 0.11666710770260394, -0.28957542829378785, -0.052240733599217895, 0.2084205405794982, -0.0739407648158026, 0.07614249429355684, 0.06341689336484677, -0.0011809460106361434, -0.06376591905816069, -0.2351048206539446, 0.23905006552808936, 0.15766098149365698, 0.2913020846927427, 0.06875266698912617, 0.14764173025013952, -0.03208858666105977, -0.020862480721749975, 0.0006809417210311529, -0.11971407289913251, 0.12644248929285662, 0.2558998023920444, 0.09258494798402002, 0.24262901350477362, -0.45610283702552556, -0.13484638281314043, 0.03048094496245967, 0.0716836283899903, 0.05099714877254578, -0.08613096810951532, -0.2622013472324883, 0.0853355299399431, -0.21851217220871305, -0.15345080479500867, -0.038179425164626773, 0.005420572245474979, 0.04249737209517999, -0.2166512620587095, -0.03581713642776606, 0.011700548426400262, 0.010368103737965137, -0.03406212176660083, -0.08800482887921268, 0.0037785515474875373, 0.11042072993714318, 0.008423625489240475, 0.054656306869791914, 0.19378182501253854, -0.11817828103050262, -0.05375600538858439, 0.32962082797268116, -0.05228575534744752, -0.17891803948557472, 0.19337567057093213, -0.1820843026962176, -0.06418094865836767, 0.1756585192128244, 0.1746854592834514, 0.08143071677031151, -0.18674398118637472, 0.06463993317482389, 0.0044358126778318826, 0.17191431647448605, 0.06201190708123474, 0.03519099055459181, 0.2444704977491225, 0.24737271758545917, 0.07782063387757338, 0.15076145434342103, -0.16479904974061269, -0.029005444866968728, -0.2971030234459387, -0.20482445393055418, -0.15622736511481147, 0.02885017286989823, -0.014925763747096896, -0.16853319608098066, 0.4103949169927013, 0.13619916508460336, 0.16862678992194663, -0.04161015171668978, 0.3122359730017583, 0.04523674974846932, 0.13489483149705522, 0.021691761901639253, 0.2587576713561418, 0.13659362751670878, 0.12646434239048762, -0.20377781596851063, 0.041500057471801056, 0.040770195629790916]
|
1,803.07798
|
A single-phase bcc high-entropy alloy in the refractory Zr-Nb-Ti-V-Hf
system
|
We report on the production and characterization of a high-entropy alloy in
the refractory Zr-Nb-Ti-V-Hf system. Equiatomic ingots were produced by arc and
levitation melting, and were subsequently homogenized by high-temperature
annealing. We obtained a coarse-grained, single-phase high-entropy alloy, with
a homogeneous distribution of the constituting elements. The phase is a
chemically disordered solid solution, based on a bcc lattice with a lattice
parameter of 0.336(5) nm.
|
cond-mat.mtrl-sci
|
we report on the production and characterization of a highentropy alloy in the refractory zrnbtivhf system equiatomic ingots were produced by arc and levitation melting and were subsequently homogenized by hightemperature annealing we obtained a coarsegrained singlephase highentropy alloy with a homogeneous distribution of the constituting elements the phase is a chemically disordered solid solution based on a bcc lattice with a lattice parameter of 03365 nm
|
[['we', 'report', 'on', 'the', 'production', 'and', 'characterization', 'of', 'a', 'highentropy', 'alloy', 'in', 'the', 'refractory', 'zrnbtivhf', 'system', 'equiatomic', 'ingots', 'were', 'produced', 'by', 'arc', 'and', 'levitation', 'melting', 'and', 'were', 'subsequently', 'homogenized', 'by', 'hightemperature', 'annealing', 'we', 'obtained', 'a', 'coarsegrained', 'singlephase', 'highentropy', 'alloy', 'with', 'a', 'homogeneous', 'distribution', 'of', 'the', 'constituting', 'elements', 'the', 'phase', 'is', 'a', 'chemically', 'disordered', 'solid', 'solution', 'based', 'on', 'a', 'bcc', 'lattice', 'with', 'a', 'lattice', 'parameter', 'of', '03365', 'nm']]
|
[-0.0872421024617954, 0.26022605428902, -0.08774679598326866, -0.1160869527518606, 0.01785349650845791, -0.10538512590842751, 0.12472350732065164, 0.41754371776030613, -0.23436897557515365, -0.24751297087014582, 0.09397533204084119, -0.32356788146381193, -0.06165557099649539, 0.11901959278262579, 0.04741242917684408, 0.09401984417345374, 0.040569839898783426, -0.05164500854264658, -0.12038866661202449, -0.2406888895166608, 0.26068894241291746, 0.02789661351304788, 0.2633722834289074, -0.0062260019951141795, 0.06812455424895654, -0.0476597306640962, 0.10811840145794961, 0.055793444017091624, -0.1992780235954202, 0.08317312861864383, 0.16726219026515118, -0.03374621220506155, 0.14740438661896266, -0.4587792610606322, -0.2451957976588836, -0.008445484921909295, 0.06649280083007537, 0.12000211968731422, -0.1595355487536066, -0.24761041150643276, 0.11342438622019611, -0.13499984927833653, -0.1017928350286988, -0.032159123218689974, -0.014314686908171727, 0.05151055402194078, -0.27251695686808, 0.08432124290042199, 0.05608813359778231, 0.1436794682441709, -0.14637404493629358, -0.151914113579103, -0.0789952766436797, -0.00981486514927103, -0.08678126493827082, -0.017141610756516455, 0.19474112908714092, -0.061820760161544266, -0.025011076994885046, 0.4518372170877858, -0.0604318340201504, -0.058031488496523634, 0.17040898027256704, -0.12894084700025044, -0.055059054429427934, 0.2130699989027702, 0.1291166348526111, 0.12414447259731018, -0.1955604213791398, 0.03690504265250638, -0.023453969151104013, 0.2309499949754144, 0.06477214342986162, -0.013789466310005922, 0.21214772603259638, 0.2991802310427794, -0.08257044315911256, 0.24057261313383396, -0.0855164769392174, -0.08314148766490129, -0.19985631707196053, -0.24299153482111602, -0.19835691306596764, 0.06640781139632544, -0.10146838163603276, -0.266169796196314, 0.33410360223900243, 0.05793460770510137, 0.1712709476168339, -0.07046689800918102, 0.18265361522252743, 0.011497870216575952, 0.011317373192510926, 0.01869774874156484, 0.21672233560910592, 0.18041117867239967, 0.14815468669224244, -0.22049374054544246, 0.16904003685340285, 0.08467735508456826]
|
1,803.07799
|
Symplectic Model-Reduction with a Weighted Inner Product
|
In the recent years, considerable attention has been paid to preserving
structures and invariants in reduced basis methods, in order to enhance the
stability and robustness of the reduced system. In the context of Hamiltonian
systems, symplectic model reduction seeks to construct a reduced system that
preserves the symplectic symmetry of Hamiltonian systems. However, symplectic
methods are based on the standard Euclidean inner products and are not suitable
for problems equipped with a more general inner product. In this paper, we
generalize symplectic model reduction to allow for the norms and inner products
that are most appropriate to the problem while preserving the symplectic
symmetry of the Hamiltonian systems. To construct a reduced basis and
accelerate the evaluation of nonlinear terms, a greedy generation of a
symplectic basis is proposed. Furthermore, it is shown that the greedy approach
yields a norm-bounded reduced basis. The accuracy and the stability of this
model reduction technique are illustrated through the development of reduced
models for a vibrating elastic beam and the sine-Gordon equation.
|
math.NA
|
in the recent years considerable attention has been paid to preserving structures and invariants in reduced basis methods in order to enhance the stability and robustness of the reduced system in the context of hamiltonian systems symplectic model reduction seeks to construct a reduced system that preserves the symplectic symmetry of hamiltonian systems however symplectic methods are based on the standard euclidean inner products and are not suitable for problems equipped with a more general inner product in this paper we generalize symplectic model reduction to allow for the norms and inner products that are most appropriate to the problem while preserving the symplectic symmetry of the hamiltonian systems to construct a reduced basis and accelerate the evaluation of nonlinear terms a greedy generation of a symplectic basis is proposed furthermore it is shown that the greedy approach yields a normbounded reduced basis the accuracy and the stability of this model reduction technique are illustrated through the development of reduced models for a vibrating elastic beam and the sinegordon equation
|
[['in', 'the', 'recent', 'years', 'considerable', 'attention', 'has', 'been', 'paid', 'to', 'preserving', 'structures', 'and', 'invariants', 'in', 'reduced', 'basis', 'methods', 'in', 'order', 'to', 'enhance', 'the', 'stability', 'and', 'robustness', 'of', 'the', 'reduced', 'system', 'in', 'the', 'context', 'of', 'hamiltonian', 'systems', 'symplectic', 'model', 'reduction', 'seeks', 'to', 'construct', 'a', 'reduced', 'system', 'that', 'preserves', 'the', 'symplectic', 'symmetry', 'of', 'hamiltonian', 'systems', 'however', 'symplectic', 'methods', 'are', 'based', 'on', 'the', 'standard', 'euclidean', 'inner', 'products', 'and', 'are', 'not', 'suitable', 'for', 'problems', 'equipped', 'with', 'a', 'more', 'general', 'inner', 'product', 'in', 'this', 'paper', 'we', 'generalize', 'symplectic', 'model', 'reduction', 'to', 'allow', 'for', 'the', 'norms', 'and', 'inner', 'products', 'that', 'are', 'most', 'appropriate', 'to', 'the', 'problem', 'while', 'preserving', 'the', 'symplectic', 'symmetry', 'of', 'the', 'hamiltonian', 'systems', 'to', 'construct', 'a', 'reduced', 'basis', 'and', 'accelerate', 'the', 'evaluation', 'of', 'nonlinear', 'terms', 'a', 'greedy', 'generation', 'of', 'a', 'symplectic', 'basis', 'is', 'proposed', 'furthermore', 'it', 'is', 'shown', 'that', 'the', 'greedy', 'approach', 'yields', 'a', 'normbounded', 'reduced', 'basis', 'the', 'accuracy', 'and', 'the', 'stability', 'of', 'this', 'model', 'reduction', 'technique', 'are', 'illustrated', 'through', 'the', 'development', 'of', 'reduced', 'models', 'for', 'a', 'vibrating', 'elastic', 'beam', 'and', 'the', 'sinegordon', 'equation']]
|
[-0.12095422037082779, 0.039366073514718346, -0.06963905056609827, 0.048951904819456535, -0.06407516103457002, -0.1065663727137315, -0.0025311525055097743, 0.35257888791315695, -0.27385847319040774, -0.26576869059901903, 0.11785742411157116, -0.24606336995082742, -0.17375678430201816, 0.20319687755477123, -0.09952973868588315, 0.10926495309549329, 0.11494460614288554, 0.030029308457639726, -0.16101861654041225, -0.25084511696854056, 0.3323353895862751, 0.07811079206054701, 0.2956749129821272, 0.00903531739844338, 0.12589099097120413, -0.012045022239908576, -0.00807539472794708, 0.011959729160127395, -0.08347248338939287, 0.1894751231179244, 0.23729959963643255, 0.0975181678926353, 0.24483282692620859, -0.4360885185573031, -0.22494356371873223, 0.11982609924435725, 0.1396454295143485, 0.10616640165475581, -0.019107929944242215, -0.26798683564890835, 0.09878845598877353, -0.20948508380747893, -0.13719391376875778, -0.1385279703864773, -0.00850240569013883, -0.008814127541571746, -0.25136480676832007, 0.029359052648000858, 0.08727773988400311, 0.05380882395102697, -0.06300327987547087, -0.08864142574876656, -0.045824810548904624, 0.08355865324573482, 0.026142734580207615, 0.03360264608499539, 0.0899667355872225, -0.08937315209220875, -0.1077427443336038, 0.43663080759784756, -0.048504405523486, -0.28883760949898074, 0.16416102756116102, -0.07493313384680625, -0.14260203608804767, 0.14260976930861088, 0.18750786106923925, 0.10704639544436599, -0.12102658430607442, 0.12864035754224887, -0.016191000037360938, 0.127102013511638, 0.0412465628620018, 0.013103102395817747, 0.10620096276569016, 0.18453520135680104, 0.11893685707712874, 0.13352035100517026, -0.002740813434288344, -0.14216270310639897, -0.24900266021928366, -0.16775711928768194, -0.12510016029700638, 0.01396700602499015, -0.07446442833110375, -0.1421292029956342, 0.4142566509435282, 0.1216358285068589, 0.1648040758459555, 0.041639470814398546, 0.2844700041500961, 0.14027843947303206, 0.09355543903349077, 0.042247344867342586, 0.2251718674443991, 0.17245574741459946, 0.046103573380969466, -0.22102758520118454, 0.007780217873069512, 0.11610858010347275]
|
1,803.078
|
Combined density functional and Brazovskii theories for systems with
spontaneous inhomogeneities
|
The low-T part of the phase diagram in self-assembling systems is correctly
predicted by the known versions of the density functional theory (DFT). The
high-T part obtained in DFT, however, does not agree with simulations even on
the qualitative level. In this work a new version of the DFT is developed. The
contribution to the grand thermodynamic potential associated with mesoscopic
fluctuations is explicitly taken into account. The expression for this
contribution is obtained by the methods known from the Brazovskii field theory.
Apart from developing the approximate expression for the grand thermodynamic
potential that contains the fluctuation contribution and is ready for numerical
minimization, we develop a simplified version of the theory valid for weakly
ordered phases, i.e. for the high -T part of the phase diagram. The simplified
theory is verified by a comparison with the results of simulations for a
particular version of the short-range attraction long-range repulsion (SALR)
interaction potential. Except from the fact that in our theory the ordered
phases are stable at lower T than in simulations, a good agreement for the
high-T part of the phase diagram is obtained for the range of density that was
considered in simulations. In addition, the equation of state and
compressibility isotherms are presented. Finally, the physical interpretation
of the fluctuation-contribution to the grand potential is discussed in detail.
|
cond-mat.soft
|
the lowt part of the phase diagram in selfassembling systems is correctly predicted by the known versions of the density functional theory dft the hight part obtained in dft however does not agree with simulations even on the qualitative level in this work a new version of the dft is developed the contribution to the grand thermodynamic potential associated with mesoscopic fluctuations is explicitly taken into account the expression for this contribution is obtained by the methods known from the brazovskii field theory apart from developing the approximate expression for the grand thermodynamic potential that contains the fluctuation contribution and is ready for numerical minimization we develop a simplified version of the theory valid for weakly ordered phases ie for the high t part of the phase diagram the simplified theory is verified by a comparison with the results of simulations for a particular version of the shortrange attraction longrange repulsion salr interaction potential except from the fact that in our theory the ordered phases are stable at lower t than in simulations a good agreement for the hight part of the phase diagram is obtained for the range of density that was considered in simulations in addition the equation of state and compressibility isotherms are presented finally the physical interpretation of the fluctuationcontribution to the grand potential is discussed in detail
|
[['the', 'lowt', 'part', 'of', 'the', 'phase', 'diagram', 'in', 'selfassembling', 'systems', 'is', 'correctly', 'predicted', 'by', 'the', 'known', 'versions', 'of', 'the', 'density', 'functional', 'theory', 'dft', 'the', 'hight', 'part', 'obtained', 'in', 'dft', 'however', 'does', 'not', 'agree', 'with', 'simulations', 'even', 'on', 'the', 'qualitative', 'level', 'in', 'this', 'work', 'a', 'new', 'version', 'of', 'the', 'dft', 'is', 'developed', 'the', 'contribution', 'to', 'the', 'grand', 'thermodynamic', 'potential', 'associated', 'with', 'mesoscopic', 'fluctuations', 'is', 'explicitly', 'taken', 'into', 'account', 'the', 'expression', 'for', 'this', 'contribution', 'is', 'obtained', 'by', 'the', 'methods', 'known', 'from', 'the', 'brazovskii', 'field', 'theory', 'apart', 'from', 'developing', 'the', 'approximate', 'expression', 'for', 'the', 'grand', 'thermodynamic', 'potential', 'that', 'contains', 'the', 'fluctuation', 'contribution', 'and', 'is', 'ready', 'for', 'numerical', 'minimization', 'we', 'develop', 'a', 'simplified', 'version', 'of', 'the', 'theory', 'valid', 'for', 'weakly', 'ordered', 'phases', 'ie', 'for', 'the', 'high', 't', 'part', 'of', 'the', 'phase', 'diagram', 'the', 'simplified', 'theory', 'is', 'verified', 'by', 'a', 'comparison', 'with', 'the', 'results', 'of', 'simulations', 'for', 'a', 'particular', 'version', 'of', 'the', 'shortrange', 'attraction', 'longrange', 'repulsion', 'salr', 'interaction', 'potential', 'except', 'from', 'the', 'fact', 'that', 'in', 'our', 'theory', 'the', 'ordered', 'phases', 'are', 'stable', 'at', 'lower', 't', 'than', 'in', 'simulations', 'a', 'good', 'agreement', 'for', 'the', 'hight', 'part', 'of', 'the', 'phase', 'diagram', 'is', 'obtained', 'for', 'the', 'range', 'of', 'density', 'that', 'was', 'considered', 'in', 'simulations', 'in', 'addition', 'the', 'equation', 'of', 'state', 'and', 'compressibility', 'isotherms', 'are', 'presented', 'finally', 'the', 'physical', 'interpretation', 'of', 'the', 'fluctuationcontribution', 'to', 'the', 'grand', 'potential', 'is', 'discussed', 'in', 'detail']]
|
[-0.11029671355913398, 0.1195526434394649, -0.1126303598305792, 0.09675447914930592, 0.028544625861578667, -0.0724277792780816, 0.0498313223558575, 0.30767909529707416, -0.2271675624952091, -0.28105683272443205, 0.06725872949827716, -0.2943006712201629, -0.16185473989509888, 0.16615518861201622, 0.010717409735596085, 0.009491262595038609, 0.02674132613338766, 0.0496286993869475, -0.08772496754731308, -0.20206840011413416, 0.28345623597233005, 0.051430677173330504, 0.26272934742642745, 0.06754806659888156, 0.03691957594734107, 0.011988940869712975, 0.016943348205028887, 0.0793628013472608, -0.1639994897271443, 0.09461094335730849, 0.234984779549495, 0.03015561748666866, 0.21886457908557247, -0.4275625450410185, -0.23112269915214728, 0.047972849158283606, 0.11194425115305973, 0.12951062081963227, -0.07382031785834126, -0.25874891415305806, 0.07977112259492447, -0.16960355714469205, -0.1584486828619673, -0.103467521110204, 0.0024845351099470688, 0.013695639247871193, -0.2569766408569976, 0.13078985453980482, 0.025240422336055952, 0.0446301757176807, -0.11212670300535149, -0.13542591787904198, -0.015957110954398012, 0.11023261547151834, 0.031044714621634842, 0.06228616216013996, 0.09607022985440944, -0.15129370433560202, -0.06630980422034463, 0.3998311001268043, -0.0666660009520534, -0.1443548280560323, 0.18238527710840308, -0.14372807672856758, -0.13971427428890104, 0.1559565496352834, 0.06415660790593376, 0.08263988937440905, -0.14653163760630794, 0.139601040243306, -0.006593890933265143, 0.16186765044700033, -0.013873914340974519, -0.024368045202908643, 0.19698853299392563, 0.17093820080932282, 0.008617332795154455, 0.1469464367856082, -0.06506064221689876, -0.18970481452544755, -0.3483684599374282, -0.13487398489778735, -0.22105088446613788, -0.015994646571662458, -0.06599719953242314, -0.16619369032375547, 0.3858186698232133, 0.1534545433600075, 0.15041872245002522, 0.06023839577016889, 0.2824067984901503, 0.14214869408011732, 0.0435646349054285, 0.010352212116037963, 0.25897148346140714, 0.15942226934280432, 0.10573995699084099, -0.2204636990585748, 0.05636123287369291, 0.09851926029870514]
|
1,803.07801
|
Domain Adaptation for Ear Recognition Using Deep Convolutional Neural
Networks
|
In this paper, we have extensively investigated the unconstrained ear
recognition problem. We have first shown the importance of domain adaptation,
when deep convolutional neural network models are used for ear recognition. To
enable domain adaptation, we have collected a new ear dataset using the
Multi-PIE face dataset, which we named as Multi-PIE ear dataset. To improve the
performance further, we have combined different deep convolutional neural
network models. We have analyzed in depth the effect of ear image quality, for
example illumination and aspect ratio, on the classification performance.
Finally, we have addressed the problem of dataset bias in the ear recognition
field. Experiments on the UERC dataset have shown that domain adaptation leads
to a significant performance improvement. For example, when VGG-16 model is
used and the domain adaptation is applied, an absolute increase of around 10\%
has been achieved. Combining different deep convolutional neural network models
has further improved the accuracy by 4\%. It has also been observed that image
quality has an influence on the results. In the experiments that we have
conducted to examine the dataset bias, given an ear image, we were able to
classify the dataset that it has come from with 99.71\% accuracy, which
indicates a strong bias among the ear recognition datasets.
|
cs.CV
|
in this paper we have extensively investigated the unconstrained ear recognition problem we have first shown the importance of domain adaptation when deep convolutional neural network models are used for ear recognition to enable domain adaptation we have collected a new ear dataset using the multipie face dataset which we named as multipie ear dataset to improve the performance further we have combined different deep convolutional neural network models we have analyzed in depth the effect of ear image quality for example illumination and aspect ratio on the classification performance finally we have addressed the problem of dataset bias in the ear recognition field experiments on the uerc dataset have shown that domain adaptation leads to a significant performance improvement for example when vgg16 model is used and the domain adaptation is applied an absolute increase of around 10 has been achieved combining different deep convolutional neural network models has further improved the accuracy by 4 it has also been observed that image quality has an influence on the results in the experiments that we have conducted to examine the dataset bias given an ear image we were able to classify the dataset that it has come from with 9971 accuracy which indicates a strong bias among the ear recognition datasets
|
[['in', 'this', 'paper', 'we', 'have', 'extensively', 'investigated', 'the', 'unconstrained', 'ear', 'recognition', 'problem', 'we', 'have', 'first', 'shown', 'the', 'importance', 'of', 'domain', 'adaptation', 'when', 'deep', 'convolutional', 'neural', 'network', 'models', 'are', 'used', 'for', 'ear', 'recognition', 'to', 'enable', 'domain', 'adaptation', 'we', 'have', 'collected', 'a', 'new', 'ear', 'dataset', 'using', 'the', 'multipie', 'face', 'dataset', 'which', 'we', 'named', 'as', 'multipie', 'ear', 'dataset', 'to', 'improve', 'the', 'performance', 'further', 'we', 'have', 'combined', 'different', 'deep', 'convolutional', 'neural', 'network', 'models', 'we', 'have', 'analyzed', 'in', 'depth', 'the', 'effect', 'of', 'ear', 'image', 'quality', 'for', 'example', 'illumination', 'and', 'aspect', 'ratio', 'on', 'the', 'classification', 'performance', 'finally', 'we', 'have', 'addressed', 'the', 'problem', 'of', 'dataset', 'bias', 'in', 'the', 'ear', 'recognition', 'field', 'experiments', 'on', 'the', 'uerc', 'dataset', 'have', 'shown', 'that', 'domain', 'adaptation', 'leads', 'to', 'a', 'significant', 'performance', 'improvement', 'for', 'example', 'when', 'vgg16', 'model', 'is', 'used', 'and', 'the', 'domain', 'adaptation', 'is', 'applied', 'an', 'absolute', 'increase', 'of', 'around', '10', 'has', 'been', 'achieved', 'combining', 'different', 'deep', 'convolutional', 'neural', 'network', 'models', 'has', 'further', 'improved', 'the', 'accuracy', 'by', '4', 'it', 'has', 'also', 'been', 'observed', 'that', 'image', 'quality', 'has', 'an', 'influence', 'on', 'the', 'results', 'in', 'the', 'experiments', 'that', 'we', 'have', 'conducted', 'to', 'examine', 'the', 'dataset', 'bias', 'given', 'an', 'ear', 'image', 'we', 'were', 'able', 'to', 'classify', 'the', 'dataset', 'that', 'it', 'has', 'come', 'from', 'with', '9971', 'accuracy', 'which', 'indicates', 'a', 'strong', 'bias', 'among', 'the', 'ear', 'recognition', 'datasets']]
|
[-0.030665564272437967, -0.07825754894534295, -0.09798450419299692, 0.018919679555287186, -0.07235172414110523, -0.13768498606591428, -0.023293610032144668, 0.5149378975703253, -0.21721507120718606, -0.34085321614421654, 0.123050817743085, -0.27347497645571334, -0.20856343415649653, 0.21105247632693058, -0.16666744599202693, 0.1016819732687414, 0.155640696640506, 0.08097237859790818, -0.01211532170473823, -0.3310915653106108, 0.28073170792611574, 0.04339111837411136, 0.37914477165521376, 0.08710319733095986, 0.13855457407868163, -0.08763276311288637, -0.005720059507663287, 0.02676808035665443, -0.09126228334945494, 0.13270304636297067, 0.2598442222131961, 0.18590178552538297, 0.29521050101357965, -0.39143863729956024, -0.24841634948047633, 0.09568053868630133, 0.1741441149745684, 0.10775841020387807, -0.06823832823749261, -0.34645008501901303, 0.1242992349925685, -0.18654051820319412, 0.04429357411269257, -0.11991638052431752, 0.005667749208053883, -0.06691560482438566, -0.2679439903329616, 0.04422722708848217, 0.07824349782531154, 0.12215863554892947, -0.06560121769729949, -0.16105176845975927, 0.04672537803632247, 0.21704402066225414, 0.04471589851477823, 0.091822604112486, 0.12104838594222679, -0.2065653225718181, -0.1376390364550725, 0.30885336340859676, -0.10726923498538019, -0.21352667237468664, 0.20684886920007642, -0.04132095153633311, -0.13800542891219753, 0.09987513679499027, 0.26930189365300383, 0.08637011401196368, -0.16384080609252072, 0.021200321141908483, -0.10452855061143813, 0.19954860118169213, 0.10435243022862063, -0.03993782546741985, 0.14862026022063013, 0.28962984478313, -0.010646523958539935, 0.19720112295905173, -0.21668107185834992, 0.006160572802391945, -0.1346028084376765, -0.059942263310942885, -0.17003998364668374, -0.05028265246446134, -0.06772419712955896, -0.11120737072436793, 0.43708761798888796, 0.24014948023333085, 0.18161599158190225, 0.06757900124565826, 0.2884892221028206, 0.04259986386599099, 0.1740296084016685, 0.0443590152280414, 0.2739167709358178, 0.013749312536536619, 0.11732405384614075, -0.1950322788642384, 0.06546389210916244, 0.027427063835564102]
|
1,803.07802
|
Prolate-to-oblate shape phase transitions in neutron-rich odd-mass
nuclei
|
We investigate the prolate-to-oblate shape phase transitions in the
neutron-rich Pt, Os and Ir nuclei in the mass $A\approx 190$ region. The
Hamiltonian of the interacting boson-fermion model, used to describe the
odd-mass $^{185-199}$Pt, $^{185-193}$Os and $^{185-195}$Ir isotopes, is
partially constructed by using as a microscopic input the results of
constrained self-consistent mean-field calculations within the
Hartree-Fock-Bogoliubov method with the Gogny force. The remaining few
parameters are adjusted to experimental data in the odd systems. In this way
the calculations reasonably describe the spectroscopic properties of the
odd-mass systems considered. Several calculated observables for the odd-mass
nuclei, especially the low-energy excitation spectra and the effective
deformation parameters, point to a prolate-oblate shape transition as a
function of the neutron number for all the isotopic chains considered and
similar to the one already observed in the neighboring even-even systems.
|
nucl-th nucl-ex
|
we investigate the prolatetooblate shape phase transitions in the neutronrich pt os and ir nuclei in the mass aapprox 190 region the hamiltonian of the interacting bosonfermion model used to describe the oddmass 185199pt 185193os and 185195ir isotopes is partially constructed by using as a microscopic input the results of constrained selfconsistent meanfield calculations within the hartreefockbogoliubov method with the gogny force the remaining few parameters are adjusted to experimental data in the odd systems in this way the calculations reasonably describe the spectroscopic properties of the oddmass systems considered several calculated observables for the oddmass nuclei especially the lowenergy excitation spectra and the effective deformation parameters point to a prolateoblate shape transition as a function of the neutron number for all the isotopic chains considered and similar to the one already observed in the neighboring eveneven systems
|
[['we', 'investigate', 'the', 'prolatetooblate', 'shape', 'phase', 'transitions', 'in', 'the', 'neutronrich', 'pt', 'os', 'and', 'ir', 'nuclei', 'in', 'the', 'mass', 'aapprox', '190', 'region', 'the', 'hamiltonian', 'of', 'the', 'interacting', 'bosonfermion', 'model', 'used', 'to', 'describe', 'the', 'oddmass', '185199pt', '185193os', 'and', '185195ir', 'isotopes', 'is', 'partially', 'constructed', 'by', 'using', 'as', 'a', 'microscopic', 'input', 'the', 'results', 'of', 'constrained', 'selfconsistent', 'meanfield', 'calculations', 'within', 'the', 'hartreefockbogoliubov', 'method', 'with', 'the', 'gogny', 'force', 'the', 'remaining', 'few', 'parameters', 'are', 'adjusted', 'to', 'experimental', 'data', 'in', 'the', 'odd', 'systems', 'in', 'this', 'way', 'the', 'calculations', 'reasonably', 'describe', 'the', 'spectroscopic', 'properties', 'of', 'the', 'oddmass', 'systems', 'considered', 'several', 'calculated', 'observables', 'for', 'the', 'oddmass', 'nuclei', 'especially', 'the', 'lowenergy', 'excitation', 'spectra', 'and', 'the', 'effective', 'deformation', 'parameters', 'point', 'to', 'a', 'prolateoblate', 'shape', 'transition', 'as', 'a', 'function', 'of', 'the', 'neutron', 'number', 'for', 'all', 'the', 'isotopic', 'chains', 'considered', 'and', 'similar', 'to', 'the', 'one', 'already', 'observed', 'in', 'the', 'neighboring', 'eveneven', 'systems']]
|
[-0.07150119800051605, 0.15728617745831056, -0.0492764084427445, 0.13525413626597987, 0.04580261079008104, -0.10133364085039055, 0.054780256465353346, 0.35644542624553044, -0.21438526610533395, -0.31698606386780737, -0.024408701694294533, -0.30135621675462637, -0.05246940939514725, 0.1226188796589634, 0.07059063885546359, 0.07223708241729548, 0.01421934680978733, 0.03828641754678554, -0.12489625921610881, -0.16954515410621684, 0.29403734912888874, 0.07431269792960611, 0.22654759213328363, 0.024087804952567373, 0.012961826557121067, 0.03465107813886048, 0.06353962552492265, -0.016214693501522697, -0.14892629524692894, 0.08236023515152434, 0.2823171156613777, 0.027381158877687994, 0.1506611051313855, -0.42113821670688967, -0.20681205900618807, 0.06937917541471068, 0.16038711947492426, 0.16681044118271934, -0.05589463024150097, -0.28352150760453054, 0.024380789610936687, -0.21688677534047102, -0.19563817002107733, -0.11400305245813258, 0.007896300864026502, 0.09631667164740738, -0.24652631802277433, 0.03182390677910815, -0.011087709320364176, 0.07115350640971749, -0.15473294941432497, -0.19067567918725586, -0.06516683979166879, 0.09505894970217789, 0.0615217618100966, 0.002074282485301848, 0.16767586852182392, -0.07692118806557523, -0.032539704380798395, 0.4304980041942111, -0.014999515934053947, -0.12629917532343554, 0.14950943715801393, -0.1403308581319396, -0.17338462020529227, 0.15520285435227885, 0.11466912524084802, 0.14733533983774208, -0.17487964360388342, 0.08758983240393853, -0.011564799663783223, 0.1789712338184472, -0.006474448570817778, 0.042283455827445894, 0.1689965307764295, 0.17401838225347024, -0.038786121117408145, 0.0756751745266633, -0.14544296457811637, -0.12879618847811664, -0.2830762758816558, -0.05428329377124707, -0.17422135668306576, -0.015127917427431654, -0.06925715867524829, -0.13457371136195165, 0.39801829424169327, 0.0773772206717964, 0.23219314710133607, -0.022640258385972292, 0.2637196481572809, 0.0803439507657593, 0.08151999687844956, 0.01656269683994146, 0.3172188331131582, 0.1973833028882466, 0.06538015539861387, -0.30511127453754416, 0.018504084170692495, 0.0798571699126451]
|
1,803.07803
|
A low-energy sensitive compact gamma-ray detector based on LaBr3 and
SiPM for GECAM
|
The Gravitational wave high-energy Electromagnetic Counterpart All-sky
Monitor (GECAM) project is the planned Chinese space telescope for detecting
the X and gamma-ray counterpart. It consists of two micro-satellites in low
earth orbit with the advantages of instantaneous full-sky coverage, low energy
threshold down to 6 keV and can be achieved within a short period and small
budget. Due to the limitation of size, weight and power consumption of
micro-satellites, silicon photomultipliers (SiPMs) are used to replace the
photomultiplier tubes (PMTs) to assemble a novel gamma-ray detector. A
prototype of a SiPM array with LaBr3 crystal is built and tested, and it shows
a high detection efficiency (70% at 5.9 keV) and an acceptable uniformity. The
low-energy X-ray of 5.9 keV can be detected by a simply readout circuit, and
the energy resolution is 6.5% (FWHM) at 662 keV. The design and performance of
the detector are discussed in detail in this paper.
|
astro-ph.IM physics.ins-det
|
the gravitational wave highenergy electromagnetic counterpart allsky monitor gecam project is the planned chinese space telescope for detecting the x and gammaray counterpart it consists of two microsatellites in low earth orbit with the advantages of instantaneous fullsky coverage low energy threshold down to 6 kev and can be achieved within a short period and small budget due to the limitation of size weight and power consumption of microsatellites silicon photomultipliers sipms are used to replace the photomultiplier tubes pmts to assemble a novel gammaray detector a prototype of a sipm array with labr3 crystal is built and tested and it shows a high detection efficiency 70 at 59 kev and an acceptable uniformity the lowenergy xray of 59 kev can be detected by a simply readout circuit and the energy resolution is 65 fwhm at 662 kev the design and performance of the detector are discussed in detail in this paper
|
[['the', 'gravitational', 'wave', 'highenergy', 'electromagnetic', 'counterpart', 'allsky', 'monitor', 'gecam', 'project', 'is', 'the', 'planned', 'chinese', 'space', 'telescope', 'for', 'detecting', 'the', 'x', 'and', 'gammaray', 'counterpart', 'it', 'consists', 'of', 'two', 'microsatellites', 'in', 'low', 'earth', 'orbit', 'with', 'the', 'advantages', 'of', 'instantaneous', 'fullsky', 'coverage', 'low', 'energy', 'threshold', 'down', 'to', '6', 'kev', 'and', 'can', 'be', 'achieved', 'within', 'a', 'short', 'period', 'and', 'small', 'budget', 'due', 'to', 'the', 'limitation', 'of', 'size', 'weight', 'and', 'power', 'consumption', 'of', 'microsatellites', 'silicon', 'photomultipliers', 'sipms', 'are', 'used', 'to', 'replace', 'the', 'photomultiplier', 'tubes', 'pmts', 'to', 'assemble', 'a', 'novel', 'gammaray', 'detector', 'a', 'prototype', 'of', 'a', 'sipm', 'array', 'with', 'labr3', 'crystal', 'is', 'built', 'and', 'tested', 'and', 'it', 'shows', 'a', 'high', 'detection', 'efficiency', '70', 'at', '59', 'kev', 'and', 'an', 'acceptable', 'uniformity', 'the', 'lowenergy', 'xray', 'of', '59', 'kev', 'can', 'be', 'detected', 'by', 'a', 'simply', 'readout', 'circuit', 'and', 'the', 'energy', 'resolution', 'is', '65', 'fwhm', 'at', '662', 'kev', 'the', 'design', 'and', 'performance', 'of', 'the', 'detector', 'are', 'discussed', 'in', 'detail', 'in', 'this', 'paper']]
|
[-0.07087197074801416, 0.14032571094723703, -0.012131728213525525, 0.061614270136679375, -0.044658995631739105, -0.14027248163658537, 0.036195769088839085, 0.43827603745127197, -0.16566947935528956, -0.4088789417628983, 0.09872420854011771, -0.3478878496557866, 0.001746114352212508, 0.22258743665511965, -0.052140455742023493, 0.06246214852006616, 0.07726152528898399, -0.03397366049773011, -0.06175200400972053, -0.24869604149946672, 0.13425786850673735, 0.21236237856608473, 0.2914079525232266, 0.04283456231534824, 0.1788649059721808, -0.04515088793184412, -0.034323757775717625, -0.035621646139349504, -0.0495419235728485, 0.0666966793092127, 0.31062090363105344, 0.10060827524591189, 0.1831261570792106, -0.37216295630940677, -0.16198433465385614, 0.08018621577924166, 0.08410759687974764, -0.05075916485992294, -0.02907433928186564, -0.28489572061746576, 0.12215658125014191, -0.22562405456004567, -0.15597688645587032, 0.04081605108359853, -0.004700224393194443, 0.05905939918930495, -0.15724924864173917, 0.00810726988895208, -0.011511137624773638, 0.03386862049688046, -0.07253229401938274, -0.10490102062804478, 0.04540553876722697, 0.025565260710304995, -0.027967087337808488, 0.0554117042859281, 0.17393841141050584, -0.11902780859504435, -0.05725732717607906, 0.36255589209644024, -0.04654960040582074, -0.07643091638946269, 0.14919975469667024, -0.17063054861807214, -0.08204916204282965, 0.26812732644305615, 0.14769226070807476, 0.05583912604273983, -0.2051971237493777, 0.05179372352645978, 0.06491203039379463, 0.2758072326327429, 0.12299448781107601, 0.06584571117510725, 0.2713772939904103, 0.26298007203532553, 0.06515650880235051, 0.14671131129542023, -0.26786238760503595, 0.04596468146299135, -0.2746813969317468, -0.14164669879736672, -0.15983477071399407, 0.09290272172792786, -0.023623875268592536, -0.10175597251662494, 0.42641561518815396, 0.0835801342588016, 0.11587318583808251, 0.023287638550085064, 0.3197469680744689, 0.05712001057614352, 0.0910821111814776, 0.028641395004294617, 0.3064088847451402, 0.11121827723017257, 0.12341289835843015, -0.1868912092759274, -0.023508732305727836, -0.015877945386914928]
|
1,803.07804
|
Several properties of hypergeometric Bernoulli numbers
|
In this paper, we give the determinant expressions of the hypergeometric
Bernoulli numbers, and some relations between the hypergeometric and the
classical Bernoulli numbers which include Kummer's congruences. By applying
Trudi's formula, we have some different expressions and inversion relations. We
also determine explicit forms of convergents of the generating function of the
hypergeometric Bernoulli numbers, from which several identities for
hypergeometric Bernoulli numbers are given.
|
math.NT
|
in this paper we give the determinant expressions of the hypergeometric bernoulli numbers and some relations between the hypergeometric and the classical bernoulli numbers which include kummers congruences by applying trudis formula we have some different expressions and inversion relations we also determine explicit forms of convergents of the generating function of the hypergeometric bernoulli numbers from which several identities for hypergeometric bernoulli numbers are given
|
[['in', 'this', 'paper', 'we', 'give', 'the', 'determinant', 'expressions', 'of', 'the', 'hypergeometric', 'bernoulli', 'numbers', 'and', 'some', 'relations', 'between', 'the', 'hypergeometric', 'and', 'the', 'classical', 'bernoulli', 'numbers', 'which', 'include', 'kummers', 'congruences', 'by', 'applying', 'trudis', 'formula', 'we', 'have', 'some', 'different', 'expressions', 'and', 'inversion', 'relations', 'we', 'also', 'determine', 'explicit', 'forms', 'of', 'convergents', 'of', 'the', 'generating', 'function', 'of', 'the', 'hypergeometric', 'bernoulli', 'numbers', 'from', 'which', 'several', 'identities', 'for', 'hypergeometric', 'bernoulli', 'numbers', 'are', 'given']]
|
[-0.2072060295738853, 0.1179460397706582, -0.09874241340618867, 0.13828611567867202, -0.11568496169952246, -0.11653575200874072, 0.08670282657795514, 0.2609514412255241, -0.27630502226260995, -0.27504845215724066, 0.07655058906485256, -0.25086172312641375, -0.251181982916135, 0.3074784556260476, -0.02157935408445505, 0.059410562405649285, -0.038334075766257365, 0.05389670102069011, -0.14899598699636185, -0.29741582449239035, 0.3931178434537007, -0.09001175057716095, 0.17469822250020045, 0.005282783121443712, 0.09543325021289863, -0.02184769218035329, -0.08326997756958007, -0.11478404345420691, -0.19310914209255806, 0.12904805382713674, 0.24737170074994747, 0.14683016367399923, 0.23334329206353197, -0.3844269620684477, -0.04144612406738676, 0.1583785478455516, 0.15055929319216654, 0.032936037990909356, -0.02868121534299392, -0.24899248065283666, -0.0020938509717010534, -0.234299504219626, -0.17566114426948704, -0.13847908096817824, 0.033906486085974255, 0.25121678601090724, -0.28680576541675973, 0.10499567510873581, 0.04358144299342082, 0.1223731619090988, -0.019973439802057468, -0.22520736779731054, 0.0646482437562484, 0.12452749765406435, 0.10162546603152385, -0.0911364238565931, -0.01588197249489335, -0.15603395165660633, -0.1072562434603102, 0.33579287311205497, 0.06950651821322167, -0.2885953939878024, 0.047852300035838895, -0.18394854874708333, -0.23865581849733225, 0.09931765996779386, 0.10799535203438539, 0.10562668322370602, -0.11787587061810952, 0.033521047733330096, -0.1353071174512689, 0.03896874785423279, 0.26787201512175113, -0.0035459147909512887, 0.12956724184063764, -0.11392113130826216, -0.10538686342322483, 0.24403989822245561, -0.01181668140567266, -0.10491306520998478, -0.3835810605150003, -0.22985074852521603, -0.15804557484628345, 0.10142873616602559, -0.17670198443296473, -0.18839207176978773, 0.37345617562532424, 0.11288911509954443, 0.15146717499726667, 0.20790210224759692, 0.20077954994944425, 0.26146588881428423, 0.026551413622040016, -0.02163118698562567, 0.025674563901534733, 0.2683484032535209, 0.06290039025390377, -0.08140857013730475, 0.0366046637439957, 0.24560372868122962]
|
1,803.07805
|
Microscopic description of triaxiality in Ru isotopes with covariant
energy density functional theory
|
The triaxiality in nuclear low-lying states has attracted great interests for
many years. Recently, the reduced transition probabilities for levels near the
ground state in $^{110}$Ru have been measured and provided strong evidences for
a triaxial shape of this nucleus. The aim of this work is to provide a
microscopic study of low-lying states for the Ru isotopes with $A\sim100$ and
to examine in detail the role of triaxiality, and the evolution of quadrupole
shapes with the isospin and spin degrees of freedom. The low-lying excitation
spectra and transition probabilities of even-even Ru isotopes are described at
the beyond mean-field level by solving a five-dimensional collective
Hamiltonian with parameters determined by constrained self-consistent
mean-field calculations based on the relativistic energy density functional
PC-PK1. The calculated energy surfaces, low-energy spectra, intraband and
interband transition rates, as well as some characteristic collective
observables, such as $E(4_{\rm g.s.}^+)/E(2^+_{\rm g.s.})$,
$E(2^+_\gamma)/E(4^+_{\rm g.s.})$, $B(E2; 2^+_{\rm g.s.}\to 0^+_{\rm g.s.})$,
and $\gamma$ band staggerings are in a good agreement with the available
experimental data. The main features of the experimental low-lying excitation
spectra and electric transition rates are well reproduced, and thus strongly
support the onset of triaxiality in the low-lying excited states of the Ru
isotopes around $^{110}$Ru.
|
nucl-th nucl-ex
|
the triaxiality in nuclear lowlying states has attracted great interests for many years recently the reduced transition probabilities for levels near the ground state in 110ru have been measured and provided strong evidences for a triaxial shape of this nucleus the aim of this work is to provide a microscopic study of lowlying states for the ru isotopes with asim100 and to examine in detail the role of triaxiality and the evolution of quadrupole shapes with the isospin and spin degrees of freedom the lowlying excitation spectra and transition probabilities of eveneven ru isotopes are described at the beyond meanfield level by solving a fivedimensional collective hamiltonian with parameters determined by constrained selfconsistent meanfield calculations based on the relativistic energy density functional pcpk1 the calculated energy surfaces lowenergy spectra intraband and interband transition rates as well as some characteristic collective observables such as e4_rm gse2_rm gs e2_gammae4_rm gs be2 2_rm gsto 0_rm gs and gamma band staggerings are in a good agreement with the available experimental data the main features of the experimental lowlying excitation spectra and electric transition rates are well reproduced and thus strongly support the onset of triaxiality in the lowlying excited states of the ru isotopes around 110ru
|
[['the', 'triaxiality', 'in', 'nuclear', 'lowlying', 'states', 'has', 'attracted', 'great', 'interests', 'for', 'many', 'years', 'recently', 'the', 'reduced', 'transition', 'probabilities', 'for', 'levels', 'near', 'the', 'ground', 'state', 'in', '110ru', 'have', 'been', 'measured', 'and', 'provided', 'strong', 'evidences', 'for', 'a', 'triaxial', 'shape', 'of', 'this', 'nucleus', 'the', 'aim', 'of', 'this', 'work', 'is', 'to', 'provide', 'a', 'microscopic', 'study', 'of', 'lowlying', 'states', 'for', 'the', 'ru', 'isotopes', 'with', 'asim100', 'and', 'to', 'examine', 'in', 'detail', 'the', 'role', 'of', 'triaxiality', 'and', 'the', 'evolution', 'of', 'quadrupole', 'shapes', 'with', 'the', 'isospin', 'and', 'spin', 'degrees', 'of', 'freedom', 'the', 'lowlying', 'excitation', 'spectra', 'and', 'transition', 'probabilities', 'of', 'eveneven', 'ru', 'isotopes', 'are', 'described', 'at', 'the', 'beyond', 'meanfield', 'level', 'by', 'solving', 'a', 'fivedimensional', 'collective', 'hamiltonian', 'with', 'parameters', 'determined', 'by', 'constrained', 'selfconsistent', 'meanfield', 'calculations', 'based', 'on', 'the', 'relativistic', 'energy', 'density', 'functional', 'pcpk1', 'the', 'calculated', 'energy', 'surfaces', 'lowenergy', 'spectra', 'intraband', 'and', 'interband', 'transition', 'rates', 'as', 'well', 'as', 'some', 'characteristic', 'collective', 'observables', 'such', 'as', 'e4_rm', 'gse2_rm', 'gs', 'e2_gammae4_rm', 'gs', 'be2', '2_rm', 'gsto', '0_rm', 'gs', 'and', 'gamma', 'band', 'staggerings', 'are', 'in', 'a', 'good', 'agreement', 'with', 'the', 'available', 'experimental', 'data', 'the', 'main', 'features', 'of', 'the', 'experimental', 'lowlying', 'excitation', 'spectra', 'and', 'electric', 'transition', 'rates', 'are', 'well', 'reproduced', 'and', 'thus', 'strongly', 'support', 'the', 'onset', 'of', 'triaxiality', 'in', 'the', 'lowlying', 'excited', 'states', 'of', 'the', 'ru', 'isotopes', 'around', '110ru']]
|
[-0.07119522169325969, 0.18604073874083765, -0.023020575480563705, 0.10743501849282983, 0.051813123979367055, -0.1023444324806707, 0.06147778290323913, 0.36846795204053423, -0.1699750370102649, -0.3131864323987434, -0.03434665512232737, -0.3306405588413528, -0.06852852702538609, 0.11607214961909974, 0.08037734180267657, 0.05681907574777215, 0.039001505026048586, 0.04521507940775172, -0.10490459051268672, -0.12024870017325814, 0.3052132749677303, 0.10723316199214218, 0.2615669599533006, 0.08040759044681967, -0.001996620407856851, -0.006861182274858481, 0.08963582506075726, -0.03053621908921243, -0.15656840243732473, 0.09175064830061506, 0.27934658258273526, 0.02127485713060365, 0.18041877703619513, -0.4159401714680108, -0.215152029538189, 0.05275529460869168, 0.1640783581793795, 0.15995780821309316, -0.05939677699563215, -0.32778773820214907, 0.012914324286932023, -0.19725113497911273, -0.17569252226417462, -0.1538337394846697, 0.053258499428957475, 0.059789219036951065, -0.23598838699560368, 0.10940383818941238, 0.0097472209450625, 0.11017025583250367, -0.14575866214350688, -0.22133334709247152, -0.11690712591923362, 0.09481700597939037, 0.10259014484560323, 0.005616216097365194, 0.15173238392769542, -0.10644278932250474, -0.09184790533281695, 0.3881796807818227, -0.018931555290280573, -0.07850716865651343, 0.12699718022573944, -0.17413916235237414, -0.14804637504755588, 0.19275871802346042, 0.11217063162522624, 0.11198704198807777, -0.09117158789459111, 0.09108516770557895, 0.014488548843597236, 0.15079533081997804, 0.013499574629729146, 0.0880212548698036, 0.20856717818571097, 0.1576588159847078, -0.038062819215672644, 0.055156508759576735, -0.13527294646319113, -0.11735636659373702, -0.25543909893375844, -0.07223132611650168, -0.1921357821337364, 0.021254851936769844, -0.01650064884988888, -0.12161866002046297, 0.4436789931724756, 0.03041731592808293, 0.21415802500861225, -0.03071785705917557, 0.21699438724507714, 0.12825039798106025, 0.026093764010940834, 0.054410597761091424, 0.3175596925296912, 0.2170364165950061, 0.03483756073053233, -0.3250110393142019, 0.050969127011040796, 0.026331448360070137]
|
1,803.07806
|
Selected methods for the classification of cuts, and their applications
|
We consider four approaches to the analysis of cuts in ordered abelian groups
and ordered fields, their interconnection, and various applications. The
notions we discuss are: ball cuts, invariance group, invariance valuation ring,
and cut cofinality.
|
math.AC math.RA
|
we consider four approaches to the analysis of cuts in ordered abelian groups and ordered fields their interconnection and various applications the notions we discuss are ball cuts invariance group invariance valuation ring and cut cofinality
|
[['we', 'consider', 'four', 'approaches', 'to', 'the', 'analysis', 'of', 'cuts', 'in', 'ordered', 'abelian', 'groups', 'and', 'ordered', 'fields', 'their', 'interconnection', 'and', 'various', 'applications', 'the', 'notions', 'we', 'discuss', 'are', 'ball', 'cuts', 'invariance', 'group', 'invariance', 'valuation', 'ring', 'and', 'cut', 'cofinality']]
|
[-0.2386976861808863, 0.1242703256300754, -0.12392422911297116, 0.13486109275577796, -0.13697205543414587, -0.09923820751201776, 0.03270989388662807, 0.46991777378651833, -0.3318422417052918, -0.23409416443771786, 0.17390888938098215, -0.2845084131954031, -0.05217565609038704, 0.08338165893736812, -0.08179440866741869, 0.008448154225738512, -0.04034793105286857, 0.01834024131918947, -0.08523417217010218, -0.28370966550816473, 0.36446656121148, -0.09462836032940282, 0.3309526903451317, 0.029442676317153707, 0.065993102073359, 0.08104926460267355, -0.08835924059773485, 0.11453578983330065, -0.18715849487731853, 0.12152973166666925, 0.27221046864158577, 0.10346786866688894, 0.19497124457524884, -0.3923657439235184, -0.12163814379730159, 0.1686238643920256, 0.062157283504752234, 0.02941897084626059, -0.00045616766955289576, -0.2839326984766457, 0.11083909696511303, -0.16138151577777332, -0.14693932809556523, -0.15108460788097647, 0.057970091868709356, 0.015435572144471936, -0.21678578028351897, -0.037780596046812005, 0.10598732703430061, 0.16984062512508696, -0.05633289733022037, -0.1189479826328655, -0.012519662232888449, 0.06333790922589186, 0.05928068404642141, -0.06011098611634225, 0.21692394472969076, -0.14735090160845882, -0.23579142480674717, 0.40922338970833355, 0.018260488286614418, -0.16665577836748627, 0.19729659401087296, -0.17353328648540708, -0.1963796478877258, 0.05425123175761352, 0.1527657360355887, 0.11013855541952783, -0.045799379625047244, 0.21445036001225365, -0.08295829953405903, 0.02706700643628008, 0.13534129583018106, 0.09184939908381137, 0.13462185867441198, 0.05692430484729508, 0.11994865539357609, 0.18212198513841335, 0.015404356139091155, -0.07300744787789881, -0.3611176362157696, -0.10452929335749811, -0.029181887809601095, 0.015594057535054162, -0.12545064640006684, -0.158864555214273, 0.3833234604034159, 0.09788909267323713, 0.14191760528936154, 0.05463882820266816, 0.22199034432156217, 0.024785037902701233, 0.09774873782751253, 0.061348913703113794, 0.09419029257777664, 0.2431185737045275, -0.0442840920554267, -0.1425537590144409, -0.08001715052847026, 0.11700794698360066]
|
1,803.07807
|
Triangle singularity in $\tau \to f_1(1285)\pi\nu_\tau$ decay
|
We show that the $\tau^-$ decay into $f_1(1285)\pi^-\nu_\tau $ is dominated
by a triangle loop mechanism with $K^*$, $\bar K^*$ and $K$ (or $\bar K$) as
internal lines, which manifests a strong enhancement reminiscent of a nearby
singularity present in the narrow $K^*$ limit. The $f_1(1285)$ is then produced
by its coupling to the $K^*\bar K$ and $\bar K^*K$ which is obtained from a
previous model where this resonance was dynamically generated as a molecular
$K^*\bar K$ (or $\bar K^*K$) state using the techniques of the chiral unitary
approach. We make predictions for the $f_1 \pi$ mass distribution which
significantly deviates from the phase-space shape, due to the distortion caused
by the triangle singularity. We find a good agreement with the experimental
value within uncertainties for the integrated partial decay width, which is a
clear indication of the importance of the triangle singularity in this decay
and supports the dynamical origin of the $f_1(1285)$ as a $K^*\bar K$ and $\bar
K^* K$ molecular state.
|
hep-ph
|
we show that the tau decay into f_11285pinu_tau is dominated by a triangle loop mechanism with k bar k and k or bar k as internal lines which manifests a strong enhancement reminiscent of a nearby singularity present in the narrow k limit the f_11285 is then produced by its coupling to the kbar k and bar kk which is obtained from a previous model where this resonance was dynamically generated as a molecular kbar k or bar kk state using the techniques of the chiral unitary approach we make predictions for the f_1 pi mass distribution which significantly deviates from the phasespace shape due to the distortion caused by the triangle singularity we find a good agreement with the experimental value within uncertainties for the integrated partial decay width which is a clear indication of the importance of the triangle singularity in this decay and supports the dynamical origin of the f_11285 as a kbar k and bar k k molecular state
|
[['we', 'show', 'that', 'the', 'tau', 'decay', 'into', 'f_11285pinu_tau', 'is', 'dominated', 'by', 'a', 'triangle', 'loop', 'mechanism', 'with', 'k', 'bar', 'k', 'and', 'k', 'or', 'bar', 'k', 'as', 'internal', 'lines', 'which', 'manifests', 'a', 'strong', 'enhancement', 'reminiscent', 'of', 'a', 'nearby', 'singularity', 'present', 'in', 'the', 'narrow', 'k', 'limit', 'the', 'f_11285', 'is', 'then', 'produced', 'by', 'its', 'coupling', 'to', 'the', 'kbar', 'k', 'and', 'bar', 'kk', 'which', 'is', 'obtained', 'from', 'a', 'previous', 'model', 'where', 'this', 'resonance', 'was', 'dynamically', 'generated', 'as', 'a', 'molecular', 'kbar', 'k', 'or', 'bar', 'kk', 'state', 'using', 'the', 'techniques', 'of', 'the', 'chiral', 'unitary', 'approach', 'we', 'make', 'predictions', 'for', 'the', 'f_1', 'pi', 'mass', 'distribution', 'which', 'significantly', 'deviates', 'from', 'the', 'phasespace', 'shape', 'due', 'to', 'the', 'distortion', 'caused', 'by', 'the', 'triangle', 'singularity', 'we', 'find', 'a', 'good', 'agreement', 'with', 'the', 'experimental', 'value', 'within', 'uncertainties', 'for', 'the', 'integrated', 'partial', 'decay', 'width', 'which', 'is', 'a', 'clear', 'indication', 'of', 'the', 'importance', 'of', 'the', 'triangle', 'singularity', 'in', 'this', 'decay', 'and', 'supports', 'the', 'dynamical', 'origin', 'of', 'the', 'f_11285', 'as', 'a', 'kbar', 'k', 'and', 'bar', 'k', 'k', 'molecular', 'state']]
|
[-0.14306296106646366, 0.16260809023623113, -0.12363006079707432, 0.027205822202463256, -0.03250779094530937, -0.11676360674009854, 0.11003798472746792, 0.31357754447876857, -0.2832018734359421, -0.2505725183535689, -9.941375227989974e-05, -0.2933686566769065, -0.07876592739427715, 0.11522313833012487, 0.08824516823773997, 0.0279367587692248, 0.04527778201233481, 0.07942770304514762, -0.05121922026313611, -0.1483774899036543, 0.3084307696762276, 0.016711837238413685, 0.18338858893710291, 0.07821528151930299, 0.006636470024485463, -0.019752241620063827, 0.021617857543866574, 1.1301125158314352e-05, -0.1657980772752238, 0.049283395319412476, 0.212005999271275, 0.06927916567979588, 0.16577210886702862, -0.3293922225869962, -0.16010917342026476, 0.09183056663181403, 0.18177791717059819, 0.08062333136475013, -0.01657277016819995, -0.3181828887972199, 0.16183815254070968, -0.11273290582984272, -0.13781073527629084, -0.02428301798329217, 0.0480461646285322, -0.08230807015350387, -0.31507030843446654, 0.10019670194302352, 0.08006349862872962, 0.0870939347056534, -0.0031514813193625965, -0.1997636617779341, -0.02048896618164432, 0.05245667921284352, 0.054571030153404275, 0.1323534004831468, 0.18027908782428706, -0.13998452658702096, -0.07897869670579646, 0.39915074306873627, -0.11887391205851196, -0.08658363238367954, 0.148559065297085, -0.15517955638732714, -0.07177521190950992, 0.20702479647495498, 0.11224022459376741, 0.07538266841575135, -0.0970034891233584, 0.13197081295319224, -0.04769488342140836, 0.18757521287167306, 0.08785033086602242, 0.023468258265680043, 0.19775548849680985, 0.12307854840692914, 0.018662811067231274, 0.13214425063285298, -0.09705550159488655, -0.08131181764312917, -0.33537394113056823, -0.1264241991656614, -0.09587729917724191, 0.09388620262019864, -0.05176797825580802, -0.10259188823171972, 0.3348999122462385, 0.040757104116319505, 0.3255429944529394, 0.002779171855011409, 0.29349990124687736, 0.10977396779811516, 0.09246757462546, 0.09879116758842159, 0.2293613487085684, 0.19849340101261337, 0.04836011335345698, -0.31185667990508525, 0.05889652330549808, -0.011224082389409527]
|
1,803.07808
|
IEEE 802.11ay based mmWave WLANs: Design Challenges and Solutions
|
Millimeter-wave (mmWave) with large spectrum available is considered as the
most promising frequency band for future wireless communications. The IEEE
802.11ad and IEEE 802.11ay operating on 60 GHz mmWave are the two most expected
wireless local area network (WLAN) technologies for ultra-high-speed
communications. For the IEEE 802.11ay standard still under development, there
are plenty of proposals from companies and researchers who are involved with
the IEEE 802.11ay task group. In this survey, we conduct a comprehensive review
on the medium access control layer (MAC) related issues for the IEEE 802.11ay,
some cross-layer between physical layer (PHY) and MAC technologies are also
included. We start with MAC related technologies in the IEEE 802.11ad and
discuss design challenges on mmWave communications, leading to some MAC related
technologies for the IEEE 802.11ay. We then elaborate on important design
issues for IEEE 802.11ay. Specifically, we review the channel bonding and
aggregation for the IEEE 802.11ay, and point out the major differences between
the two technologies. Then, we describe channel access and channel allocation
in the IEEE 802.11ay, including spatial sharing and interference mitigation
technologies. After that, we present an in-depth survey on beamforming training
(BFT), beam tracking, single-user multiple-input-multiple-output (SU-MIMO)
beamforming and multi-user multiple-input-multiple-output (MU-MIMO)
beamforming. Finally, we discuss some open design issues and future research
directions for mmWave WLANs. We hope that this paper provides a good
introduction to this exciting research area for future wireless systems.
|
cs.NI
|
millimeterwave mmwave with large spectrum available is considered as the most promising frequency band for future wireless communications the ieee 80211ad and ieee 80211ay operating on 60 ghz mmwave are the two most expected wireless local area network wlan technologies for ultrahighspeed communications for the ieee 80211ay standard still under development there are plenty of proposals from companies and researchers who are involved with the ieee 80211ay task group in this survey we conduct a comprehensive review on the medium access control layer mac related issues for the ieee 80211ay some crosslayer between physical layer phy and mac technologies are also included we start with mac related technologies in the ieee 80211ad and discuss design challenges on mmwave communications leading to some mac related technologies for the ieee 80211ay we then elaborate on important design issues for ieee 80211ay specifically we review the channel bonding and aggregation for the ieee 80211ay and point out the major differences between the two technologies then we describe channel access and channel allocation in the ieee 80211ay including spatial sharing and interference mitigation technologies after that we present an indepth survey on beamforming training bft beam tracking singleuser multipleinputmultipleoutput sumimo beamforming and multiuser multipleinputmultipleoutput mumimo beamforming finally we discuss some open design issues and future research directions for mmwave wlans we hope that this paper provides a good introduction to this exciting research area for future wireless systems
|
[['millimeterwave', 'mmwave', 'with', 'large', 'spectrum', 'available', 'is', 'considered', 'as', 'the', 'most', 'promising', 'frequency', 'band', 'for', 'future', 'wireless', 'communications', 'the', 'ieee', '80211ad', 'and', 'ieee', '80211ay', 'operating', 'on', '60', 'ghz', 'mmwave', 'are', 'the', 'two', 'most', 'expected', 'wireless', 'local', 'area', 'network', 'wlan', 'technologies', 'for', 'ultrahighspeed', 'communications', 'for', 'the', 'ieee', '80211ay', 'standard', 'still', 'under', 'development', 'there', 'are', 'plenty', 'of', 'proposals', 'from', 'companies', 'and', 'researchers', 'who', 'are', 'involved', 'with', 'the', 'ieee', '80211ay', 'task', 'group', 'in', 'this', 'survey', 'we', 'conduct', 'a', 'comprehensive', 'review', 'on', 'the', 'medium', 'access', 'control', 'layer', 'mac', 'related', 'issues', 'for', 'the', 'ieee', '80211ay', 'some', 'crosslayer', 'between', 'physical', 'layer', 'phy', 'and', 'mac', 'technologies', 'are', 'also', 'included', 'we', 'start', 'with', 'mac', 'related', 'technologies', 'in', 'the', 'ieee', '80211ad', 'and', 'discuss', 'design', 'challenges', 'on', 'mmwave', 'communications', 'leading', 'to', 'some', 'mac', 'related', 'technologies', 'for', 'the', 'ieee', '80211ay', 'we', 'then', 'elaborate', 'on', 'important', 'design', 'issues', 'for', 'ieee', '80211ay', 'specifically', 'we', 'review', 'the', 'channel', 'bonding', 'and', 'aggregation', 'for', 'the', 'ieee', '80211ay', 'and', 'point', 'out', 'the', 'major', 'differences', 'between', 'the', 'two', 'technologies', 'then', 'we', 'describe', 'channel', 'access', 'and', 'channel', 'allocation', 'in', 'the', 'ieee', '80211ay', 'including', 'spatial', 'sharing', 'and', 'interference', 'mitigation', 'technologies', 'after', 'that', 'we', 'present', 'an', 'indepth', 'survey', 'on', 'beamforming', 'training', 'bft', 'beam', 'tracking', 'singleuser', 'multipleinputmultipleoutput', 'sumimo', 'beamforming', 'and', 'multiuser', 'multipleinputmultipleoutput', 'mumimo', 'beamforming', 'finally', 'we', 'discuss', 'some', 'open', 'design', 'issues', 'and', 'future', 'research', 'directions', 'for', 'mmwave', 'wlans', 'we', 'hope', 'that', 'this', 'paper', 'provides', 'a', 'good', 'introduction', 'to', 'this', 'exciting', 'research', 'area', 'for', 'future', 'wireless', 'systems']]
|
[-0.2865540454418868, -0.027362981539965373, 0.04952787534676047, -0.0372825682874168, -0.07873129600292852, -0.27118974396338064, 0.08371594454247393, 0.41562937723042875, -0.21316335795936772, -0.2417874689767153, 0.13907202272342606, -0.25936857050679757, -0.24215671356417176, 0.19650896706292006, -0.12384372477670415, 0.12198314279776552, 0.04326509990586111, -0.06982434434024219, 0.004426218084712378, -0.2595585606704689, 0.26394283208144337, 0.16028786917479756, 0.4205602237469174, 0.09420299780247614, 0.003416133333598542, 0.01536914576879806, -0.10469724248664883, -0.12837388609689224, -0.13882488989002323, 0.1178779412933096, 0.39453113057578987, 0.2042999475210324, 0.3197646713457428, -0.44466308504343033, -0.28354256047119, 0.007713202450774673, 0.15083110701734534, 0.009985468077720104, -0.09411685227398546, -0.30997624521692974, 0.14607478772975607, -0.2798489656893369, -0.03428214628440447, 0.05698515180673482, -0.07561494945125599, 0.06219243566925005, -0.2993674167142345, -0.02781034683453966, -0.058148512988884606, 0.1043332214666228, -0.04016243706322494, -0.1502092087921949, 0.08586573603953052, 0.14349110503919804, 0.005072258713328813, -0.022890447485698465, 0.12325849675107747, -0.12373076271142365, -0.16166317883260053, 0.4131704417881198, 0.044660763957081996, -0.18716363536301428, 0.18217380888910334, -0.020258011924984474, -0.1507402135260228, 0.022272273086948704, 0.2775336751837729, -0.03979165411109511, -0.21333963653564247, 0.04634289855772279, 0.009592494083584374, 0.15270232611734313, 0.11259194244561295, 0.1818503678943484, 0.18117615876870596, 0.24144603924738228, 0.1430155447958849, 0.06811164601897009, -0.14394941776254588, -0.1454281610542208, -0.25589603586440796, -0.12416520029998934, -0.14069277939583677, 0.032424704730908714, -0.03358685158172714, -0.05163796791313296, 0.39387687272093713, 0.23197182060346708, 0.014939208873189412, 0.04838576445925153, 0.397422070762254, 0.00010582032905987058, 0.07157122021671344, 0.16785659499612685, 0.21760778252866705, 0.0816798405124782, 0.2531145371349417, -0.11942838508492479, -0.017636258368038088, -0.06936876102485973]
|
1,803.07809
|
Valuation theory, generalized IFS attractors and fractals
|
Using valuation rings and valued fields as examples, we discuss in which ways
the notions of "topological IFS attractor" and "fractal space" can be
generalized to cover more general settings.
|
math.AC math.DS
|
using valuation rings and valued fields as examples we discuss in which ways the notions of topological ifs attractor and fractal space can be generalized to cover more general settings
|
[['using', 'valuation', 'rings', 'and', 'valued', 'fields', 'as', 'examples', 'we', 'discuss', 'in', 'which', 'ways', 'the', 'notions', 'of', 'topological', 'ifs', 'attractor', 'and', 'fractal', 'space', 'can', 'be', 'generalized', 'to', 'cover', 'more', 'general', 'settings']]
|
[-0.09235323395890495, 0.07543849252785245, -0.13078360327829916, 0.15282725269595782, -0.11141934978465239, -0.13357839106271666, -0.0325348780490458, 0.35662796137233577, -0.3351893700659275, -0.20777087671061356, 0.11980258387435848, -0.21750686041389902, -0.21003149288396042, 0.2669590069601933, -0.13492153293142717, -0.004770728573203087, -0.06424332372844219, 0.009546247062583764, -0.050576739758253095, -0.3505127791315317, 0.4209007350727916, -0.04750705456438785, 0.20195057662203908, -0.0102141704565535, 0.060983557859435676, -0.012394054342682164, -0.01029617687066396, 0.1660944793363645, -0.19370985355538625, 0.11911279962708553, 0.3062832125656617, 0.14290210048978527, 0.2336746937284867, -0.38281019950906436, -0.24364986872921388, 0.18390468023717405, 0.12669142025212446, 0.02497035179209585, 0.012837808491409912, -0.3226220900813738, 0.07376663686397175, -0.14636477888173735, -0.15620880350470542, -0.21700807022862137, 0.04030496759029726, 0.055988166310514016, -0.28640617517133554, -0.03302840782950322, 0.0314715598593466, 0.13294589199746648, -0.08197811009983222, -0.034342365118209275, -0.02478778629253308, 0.05753407611822089, -0.011337775861223538, -0.016513858052591483, 0.15201147518431146, -0.09432138527433077, -0.22178152222186326, 0.38454012976338464, -0.0571661946674188, -0.2534935463840763, 0.21880593659977118, -0.16840207303563753, -0.1453273784990112, 0.05693961170812448, 0.1789024462768187, 0.10035297187666098, -0.0868367848607401, 0.15988350829963263, -0.1132334031475087, 0.057113270026942095, 0.13524118453885117, 0.11333624207763933, 0.1848250803227226, 0.07331215773398678, 0.13377197578859826, 0.20755072088213639, -0.015087126102298499, -0.12811122260366878, -0.32629423414667447, -0.18309285705909134, -0.11837311256676912, 0.08293764845778545, -0.11621533767223204, -0.16072240977858504, 0.43567566423056026, 0.11758893341757357, 0.170881424130251, 0.03819620879755045, 0.23488565310835838, 0.08213764919200912, 0.07563547448565562, 0.0387328731516997, 0.09024126497339845, 0.1636421691160649, 0.07793923240775863, -0.026179411013921104, -0.026312833419069648, 0.09559163717397799]
|
1,803.0781
|
Adiabatic elimination for multi-partite open quantum systems with
non-trivial zero-order dynamics
|
We provide model reduction formulas for open quantum systems consisting of a
target component which weakly interacts with a strongly dissipative
environment. The time-scale separation between the uncoupled dynamics and the
interaction allows to employ tools from center manifold theory and geometric
singular perturbation theory to eliminate the variables associated to the
environment (adiabatic elimination) with high-order accuracy. An important
specificity is to preserve the quantum structure: reduced dynamics in
(positive) Lindblad form and coordinate mappings in Kraus form. We provide
formulas of the reduced dynamics. The main contributions of this paper are (i)
to show how the decomposition of the environment into $K$ components enables
its efficient treatment, avoiding the quantum curse of dimension; and (ii) to
extend the results to the case where the target component is subject to
Hamiltonian evolution at the fast time-scale. We apply our theory to a
microwave superconducting quantum resonator subject to material losses, and we
show that our reduced-order model can explain the transmission spectrum
observed in a recent pump probe experiment.
|
quant-ph
|
we provide model reduction formulas for open quantum systems consisting of a target component which weakly interacts with a strongly dissipative environment the timescale separation between the uncoupled dynamics and the interaction allows to employ tools from center manifold theory and geometric singular perturbation theory to eliminate the variables associated to the environment adiabatic elimination with highorder accuracy an important specificity is to preserve the quantum structure reduced dynamics in positive lindblad form and coordinate mappings in kraus form we provide formulas of the reduced dynamics the main contributions of this paper are i to show how the decomposition of the environment into k components enables its efficient treatment avoiding the quantum curse of dimension and ii to extend the results to the case where the target component is subject to hamiltonian evolution at the fast timescale we apply our theory to a microwave superconducting quantum resonator subject to material losses and we show that our reducedorder model can explain the transmission spectrum observed in a recent pump probe experiment
|
[['we', 'provide', 'model', 'reduction', 'formulas', 'for', 'open', 'quantum', 'systems', 'consisting', 'of', 'a', 'target', 'component', 'which', 'weakly', 'interacts', 'with', 'a', 'strongly', 'dissipative', 'environment', 'the', 'timescale', 'separation', 'between', 'the', 'uncoupled', 'dynamics', 'and', 'the', 'interaction', 'allows', 'to', 'employ', 'tools', 'from', 'center', 'manifold', 'theory', 'and', 'geometric', 'singular', 'perturbation', 'theory', 'to', 'eliminate', 'the', 'variables', 'associated', 'to', 'the', 'environment', 'adiabatic', 'elimination', 'with', 'highorder', 'accuracy', 'an', 'important', 'specificity', 'is', 'to', 'preserve', 'the', 'quantum', 'structure', 'reduced', 'dynamics', 'in', 'positive', 'lindblad', 'form', 'and', 'coordinate', 'mappings', 'in', 'kraus', 'form', 'we', 'provide', 'formulas', 'of', 'the', 'reduced', 'dynamics', 'the', 'main', 'contributions', 'of', 'this', 'paper', 'are', 'i', 'to', 'show', 'how', 'the', 'decomposition', 'of', 'the', 'environment', 'into', 'k', 'components', 'enables', 'its', 'efficient', 'treatment', 'avoiding', 'the', 'quantum', 'curse', 'of', 'dimension', 'and', 'ii', 'to', 'extend', 'the', 'results', 'to', 'the', 'case', 'where', 'the', 'target', 'component', 'is', 'subject', 'to', 'hamiltonian', 'evolution', 'at', 'the', 'fast', 'timescale', 'we', 'apply', 'our', 'theory', 'to', 'a', 'microwave', 'superconducting', 'quantum', 'resonator', 'subject', 'to', 'material', 'losses', 'and', 'we', 'show', 'that', 'our', 'reducedorder', 'model', 'can', 'explain', 'the', 'transmission', 'spectrum', 'observed', 'in', 'a', 'recent', 'pump', 'probe', 'experiment']]
|
[-0.12767865651232355, 0.10235732061701128, -0.09494311009971973, 0.018998897027717357, -0.0658745709587546, -0.13797919763635624, 0.020832528169814717, 0.3461696278303862, -0.2985325441817301, -0.26169148015460986, 0.04735751907026176, -0.27321856385242427, -0.14106162083061302, 0.16863693479612907, -0.04079089832255918, 0.02704236712820335, 0.061435079211643075, 0.01959953605067259, -0.04697601874495911, -0.2104704508523676, 0.30655873546048124, 0.05840608202304472, 0.2528126487412545, 0.026493753251099192, 0.10186176834189717, 0.0013582559302449226, 0.004815177312668632, -0.021952757603653214, -0.10779521382599555, 0.13814873959430876, 0.2511569914301885, 0.11111147557659184, 0.25218594582230947, -0.45850071460008623, -0.21595396242816658, 0.06969119327841326, 0.12436851153547382, 0.14742718394229407, -0.0036918213282821372, -0.2675227942862822, 0.04751438151442391, -0.15702322375796296, -0.1746572757687639, -0.10799131019260078, 0.008005976470817319, -0.02468919464633526, -0.2693185078394462, 0.0645580311278429, 0.09579977448755765, 0.0146199492717107, -0.06277643816155272, -0.038845035148894085, 0.017272325846202235, 0.11422946057076949, -0.01803791488876895, 0.010474753781797035, 0.1541176439892939, -0.1048274478313568, -0.09125824514228631, 0.3623117559356615, -0.0904133155462606, -0.2142699585734483, 0.21642933718805366, -0.12437438698595062, -0.10390771999955177, 0.118625001885983, 0.18956238526357885, 0.09393033631272642, -0.13744177230777602, 0.0964330564989188, 0.034527538116911755, 0.19274592853959321, 0.01870332208242925, 0.04401711715823587, 0.17036935781293056, 0.1351034596658257, 0.07945660136683727, 0.1707316993475508, -0.05918126837658586, -0.15412877558127921, -0.29726258291424634, -0.1237466824857299, -0.13783951825736201, 0.07558750975740088, -0.05507167947216658, -0.1544802457861164, 0.39781979822882396, 0.17706500965389696, 0.1976376388605465, 0.021316483317573062, 0.3111103837898768, 0.13242320072535863, 0.04530060279511792, 0.05905532980447306, 0.21698154270758524, 0.20627339355757132, 0.05342746359186576, -0.2872469941455433, 0.024151611430159606, 0.056613621784045415]
|
1,803.07811
|
The LIR Method. $L^{r}$ solutions of elliptic equation in a complete
riemannian manifold
|
We introduce the Local Increasing Regularity Method (LIRM) which allows us to
get from \emph{local} a priori estimates, on solutions $u$ of a linear equation
$\displaystyle Du=\omega ,$ \emph{global} ones.
As an application we shall prove that if $D$ is an elliptic linear
differential operator of order $m$ with ${\mathcal{C}}^{\infty }$ coefficients
operating on the sections of a complex vector bundle $\displaystyle G:=(H,\pi
,M)$ over a compact Riemannian manifold $M$ without boundary and $\omega \in
L^{r}_{G}(M)\cap (\mathrm{k}\mathrm{e}\mathrm{r}D^{*})^{\perp },$ then there is
a $u\in W^{m,r}_{G}(M)$ such that $Du=\omega $ on $M.$ \quad Next we
investigate the case of a compact manifold with boundary by use of the
"riemannian double manifold". In the last sections we study the more delicate
case of a complete but non compact Riemannian manifold by use of adapted
weights.
|
math.AP
|
we introduce the local increasing regularity method lirm which allows us to get from emphlocal a priori estimates on solutions u of a linear equation displaystyle duomega emphglobal ones as an application we shall prove that if d is an elliptic linear differential operator of order m with mathcalcinfty coefficients operating on the sections of a complex vector bundle displaystyle ghpi m over a compact riemannian manifold m without boundary and omega in lr_gmcap mathrmkmathrmemathrmrdperp then there is a uin wmr_gm such that duomega on m quad next we investigate the case of a compact manifold with boundary by use of the riemannian double manifold in the last sections we study the more delicate case of a complete but non compact riemannian manifold by use of adapted weights
|
[['we', 'introduce', 'the', 'local', 'increasing', 'regularity', 'method', 'lirm', 'which', 'allows', 'us', 'to', 'get', 'from', 'emphlocal', 'a', 'priori', 'estimates', 'on', 'solutions', 'u', 'of', 'a', 'linear', 'equation', 'displaystyle', 'duomega', 'emphglobal', 'ones', 'as', 'an', 'application', 'we', 'shall', 'prove', 'that', 'if', 'd', 'is', 'an', 'elliptic', 'linear', 'differential', 'operator', 'of', 'order', 'm', 'with', 'mathcalcinfty', 'coefficients', 'operating', 'on', 'the', 'sections', 'of', 'a', 'complex', 'vector', 'bundle', 'displaystyle', 'ghpi', 'm', 'over', 'a', 'compact', 'riemannian', 'manifold', 'm', 'without', 'boundary', 'and', 'omega', 'in', 'lr_gmcap', 'mathrmkmathrmemathrmrdperp', 'then', 'there', 'is', 'a', 'uin', 'wmr_gm', 'such', 'that', 'duomega', 'on', 'm', 'quad', 'next', 'we', 'investigate', 'the', 'case', 'of', 'a', 'compact', 'manifold', 'with', 'boundary', 'by', 'use', 'of', 'the', 'riemannian', 'double', 'manifold', 'in', 'the', 'last', 'sections', 'we', 'study', 'the', 'more', 'delicate', 'case', 'of', 'a', 'complete', 'but', 'non', 'compact', 'riemannian', 'manifold', 'by', 'use', 'of', 'adapted', 'weights']]
|
[-0.17900391097646207, 0.021683688465045856, -0.06309041968448376, 0.03882258553701506, -0.13393738628100088, -0.14740154542013761, -0.011610337639060931, 0.357575904063093, -0.2605164619238396, -0.1978048764063212, 0.13555424238509703, -0.29989845418701105, -0.14446321999790465, 0.19711836302800603, -0.10366076298769776, 0.046018747518187374, 0.08997059518062486, 0.12371090176606142, -0.1292982221490181, -0.21717637365899709, 0.4630806748755276, -0.06024577431674153, 0.16119837757896602, 0.031090441803500905, 0.1468679435866813, 0.01458167739409378, 0.02168280769487828, 0.012941569351114152, -0.20437773786604924, 0.11759408029190045, 0.2328852465815418, 0.055592988248596466, 0.27960743788417763, -0.41586134058794355, -0.18077033246787855, 0.1827693333455581, 0.10787224654502016, -0.017671644550415012, -0.010680606442610582, -0.2829812524454078, 0.1292021870111471, -0.09634147405745537, -0.17234376459988213, -0.09028443838545401, 0.05081851542662314, 0.0029679388470372292, -0.3139976072125137, 0.012125067022909237, 0.10384625405909842, 0.029952730739307477, -0.07935020107372733, -0.09654584817012878, -0.04453957819463155, 0.056335749176550445, -0.02115732131949891, 0.09439010467433287, 0.053479758613720174, -0.05931970191650032, -0.05560931025027502, 0.3337821484490381, -0.14961802105824426, -0.3057211790919092, 0.10824751778225589, -0.16160114157975206, -0.12439521822351508, 0.09574785821018665, 0.17107603052343295, 0.21178431150586746, -0.08489582857980234, 0.1963553181920405, -0.07802504557563461, 0.13705375168957118, 0.07722815984814632, -0.034018196383248864, 0.06606356286428626, 0.15607977236670298, 0.20836213320433125, 0.08349523073577178, -0.039083200308108114, -0.030773606541286396, -0.3620718612176616, -0.20107790019090582, -0.13248959668283541, 0.19373684337199856, -0.11861738751486713, -0.15692557152114597, 0.3404990781658912, 0.027056081152362067, 0.24060025447752417, 0.0788920477602434, 0.22718378921168123, 0.1080334881648073, 0.021987862831996222, 0.10734925424013801, 0.1327952135475428, 0.1868207431322615, 0.09840970056706934, -0.1587137150241259, -0.036406384163907145, 0.12418267318630606]
|
1,803.07812
|
Covert Wireless Communications with Channel Inversion Power Control in
Rayleigh Fading
|
In this work, we adopt channel inversion power control (CIPC) to achieve
covert communications aided by a full-duplex receiver. Specifically, the
transmitter varies the power and phase of transmitted signals as per the
channel to the receiver, such that the receiver can decode these signals
without knowing the channel state information. This eliminates the required
feedback from the transmitter to the receiver, which aids hiding the
transmitter from a warden. The truncated CIPC and conventional CIPC schemes are
proposed and examined, where for truncated CIPC covert transmission ceases when
the channel quality from the transmitter to the receiver is low, while for
conventional CIPC covert transmission always occurs regardless of this channel
quality. We examine their performance in terms of the achieved effective covert
throughput (ECT), which quantifies the amount of information that the
transmitter can reliably convey to the receiver, subject to the constraint that
the warden's detection error probability is no less than some specific value.
Our examination shows that the truncated CIPC scheme can outperform the
conventional CIPC scheme due to this constraint.
|
cs.IT math.IT
|
in this work we adopt channel inversion power control cipc to achieve covert communications aided by a fullduplex receiver specifically the transmitter varies the power and phase of transmitted signals as per the channel to the receiver such that the receiver can decode these signals without knowing the channel state information this eliminates the required feedback from the transmitter to the receiver which aids hiding the transmitter from a warden the truncated cipc and conventional cipc schemes are proposed and examined where for truncated cipc covert transmission ceases when the channel quality from the transmitter to the receiver is low while for conventional cipc covert transmission always occurs regardless of this channel quality we examine their performance in terms of the achieved effective covert throughput ect which quantifies the amount of information that the transmitter can reliably convey to the receiver subject to the constraint that the wardens detection error probability is no less than some specific value our examination shows that the truncated cipc scheme can outperform the conventional cipc scheme due to this constraint
|
[['in', 'this', 'work', 'we', 'adopt', 'channel', 'inversion', 'power', 'control', 'cipc', 'to', 'achieve', 'covert', 'communications', 'aided', 'by', 'a', 'fullduplex', 'receiver', 'specifically', 'the', 'transmitter', 'varies', 'the', 'power', 'and', 'phase', 'of', 'transmitted', 'signals', 'as', 'per', 'the', 'channel', 'to', 'the', 'receiver', 'such', 'that', 'the', 'receiver', 'can', 'decode', 'these', 'signals', 'without', 'knowing', 'the', 'channel', 'state', 'information', 'this', 'eliminates', 'the', 'required', 'feedback', 'from', 'the', 'transmitter', 'to', 'the', 'receiver', 'which', 'aids', 'hiding', 'the', 'transmitter', 'from', 'a', 'warden', 'the', 'truncated', 'cipc', 'and', 'conventional', 'cipc', 'schemes', 'are', 'proposed', 'and', 'examined', 'where', 'for', 'truncated', 'cipc', 'covert', 'transmission', 'ceases', 'when', 'the', 'channel', 'quality', 'from', 'the', 'transmitter', 'to', 'the', 'receiver', 'is', 'low', 'while', 'for', 'conventional', 'cipc', 'covert', 'transmission', 'always', 'occurs', 'regardless', 'of', 'this', 'channel', 'quality', 'we', 'examine', 'their', 'performance', 'in', 'terms', 'of', 'the', 'achieved', 'effective', 'covert', 'throughput', 'ect', 'which', 'quantifies', 'the', 'amount', 'of', 'information', 'that', 'the', 'transmitter', 'can', 'reliably', 'convey', 'to', 'the', 'receiver', 'subject', 'to', 'the', 'constraint', 'that', 'the', 'wardens', 'detection', 'error', 'probability', 'is', 'no', 'less', 'than', 'some', 'specific', 'value', 'our', 'examination', 'shows', 'that', 'the', 'truncated', 'cipc', 'scheme', 'can', 'outperform', 'the', 'conventional', 'cipc', 'scheme', 'due', 'to', 'this', 'constraint']]
|
[-0.21280035335274244, 0.014634158861802214, -0.07176383629716425, 0.026864646654840642, -0.08949116421784063, -0.2863119252512909, 0.12795522329609163, 0.35535467006477783, -0.29285100961252203, -0.25917266335190187, 0.12492080616985649, -0.27214534821740183, -0.1427117355567382, 0.1322074095164267, -0.14506851867455142, 0.03621005321276078, 0.008633974934293126, 0.09905114799304018, -0.05488016033698593, -0.24374122273002286, 0.2496926216937771, 0.1543115983830913, 0.3550693604629487, 0.017585045199997363, 0.11445468732067225, 0.031303853338944136, -0.0012071334984449838, -0.11346155408153374, -0.0856839110243031, 0.04060142622025027, 0.3107426187753762, 0.18139498118861494, 0.23124132251740032, -0.4136810832847418, -0.2897757039529758, 0.11718586785189639, 0.14680785017712464, 0.11632422628463246, -0.026584161533388728, -0.2605206186734987, 0.1424417887544471, -0.20661284326475157, 0.022087947670529087, 0.047409980981187386, -0.13823987921403552, 0.008782323814443771, -0.3377859013218602, 0.054130969271930306, 0.01882999786010425, 0.015239297742730494, -0.004304123929283709, -0.10465220433913848, 0.004189107471161565, 0.19947046985990627, 0.013266158693692309, 0.015343858695070428, 0.11801201877163046, -0.120363449392409, -0.07715213370300428, 0.34353192149931355, -0.01623179731913379, -0.2188283124176616, 0.12438239170065075, -0.12951368105661293, -0.010598168666051193, 0.20148180654822764, 0.19547518446448853, 0.04079775820983658, -0.1509941213038143, -0.02211288056307901, 0.031385727361670106, 0.2472420573652595, 0.0939395276390397, 0.13541360544927142, 0.12551543285636316, 0.10553706403879914, 0.09382853994743941, 0.14000123809224038, -0.15897842082565397, -0.10488973036725921, -0.23051604287585095, -0.1329783498870463, -0.2580622931960864, 0.016796975642633202, -0.05388591839114683, -0.019775485527299515, 0.3588529450103124, 0.1769235467033716, 0.09596390561835672, 0.08956852670499674, 0.4566485923291607, 0.10812114022767426, 0.06025872502703516, 0.13572545458605004, 0.25916370876654005, 0.09050081089398274, 0.11074598582953596, -0.25201552966345014, 0.10719811122081327, -0.0624881062844493]
|
1,803.07813
|
Introducing higher order correlations to marginals' subset of
multivariate data by means of Archimedean copulas
|
In this paper, we present the algorithm that alters the subset of marginals
of multivariate standard distributed data into such modelled by an Archimedean
copula. Proposed algorithm leaves a correlation matrix almost unchanged, but
introduces a higher order correlation into a subset of marginals. Our data
transformation algorithm can be used to analyse whether particular machine
learning algorithm, especially a dimensionality reduction one, utilises higher
order correlations or not. We present an exemplary application on two features
selection algorithms, mention that features selection is one of the approaches
to dimensionality reduction. To measure higher order correlation, we use
multivariate higher order cumulants, hence to utilises higher order
correlations be to use the Joint Skewness Band Selection (JSBS) algorithm that
uses third-order multivariate cumulant. We show the robust performance of the
JSBS in contrary to the poor performance of the Maximum Ellipsoid Volume (MEV)
algorithm that does not utilise such higher order correlations. With this
result, we confirm the potential application of our data generation algorithm
to analyse a performance of various dimensionality reduction algorithms.
|
cs.DS stat.CO
|
in this paper we present the algorithm that alters the subset of marginals of multivariate standard distributed data into such modelled by an archimedean copula proposed algorithm leaves a correlation matrix almost unchanged but introduces a higher order correlation into a subset of marginals our data transformation algorithm can be used to analyse whether particular machine learning algorithm especially a dimensionality reduction one utilises higher order correlations or not we present an exemplary application on two features selection algorithms mention that features selection is one of the approaches to dimensionality reduction to measure higher order correlation we use multivariate higher order cumulants hence to utilises higher order correlations be to use the joint skewness band selection jsbs algorithm that uses thirdorder multivariate cumulant we show the robust performance of the jsbs in contrary to the poor performance of the maximum ellipsoid volume mev algorithm that does not utilise such higher order correlations with this result we confirm the potential application of our data generation algorithm to analyse a performance of various dimensionality reduction algorithms
|
[['in', 'this', 'paper', 'we', 'present', 'the', 'algorithm', 'that', 'alters', 'the', 'subset', 'of', 'marginals', 'of', 'multivariate', 'standard', 'distributed', 'data', 'into', 'such', 'modelled', 'by', 'an', 'archimedean', 'copula', 'proposed', 'algorithm', 'leaves', 'a', 'correlation', 'matrix', 'almost', 'unchanged', 'but', 'introduces', 'a', 'higher', 'order', 'correlation', 'into', 'a', 'subset', 'of', 'marginals', 'our', 'data', 'transformation', 'algorithm', 'can', 'be', 'used', 'to', 'analyse', 'whether', 'particular', 'machine', 'learning', 'algorithm', 'especially', 'a', 'dimensionality', 'reduction', 'one', 'utilises', 'higher', 'order', 'correlations', 'or', 'not', 'we', 'present', 'an', 'exemplary', 'application', 'on', 'two', 'features', 'selection', 'algorithms', 'mention', 'that', 'features', 'selection', 'is', 'one', 'of', 'the', 'approaches', 'to', 'dimensionality', 'reduction', 'to', 'measure', 'higher', 'order', 'correlation', 'we', 'use', 'multivariate', 'higher', 'order', 'cumulants', 'hence', 'to', 'utilises', 'higher', 'order', 'correlations', 'be', 'to', 'use', 'the', 'joint', 'skewness', 'band', 'selection', 'jsbs', 'algorithm', 'that', 'uses', 'thirdorder', 'multivariate', 'cumulant', 'we', 'show', 'the', 'robust', 'performance', 'of', 'the', 'jsbs', 'in', 'contrary', 'to', 'the', 'poor', 'performance', 'of', 'the', 'maximum', 'ellipsoid', 'volume', 'mev', 'algorithm', 'that', 'does', 'not', 'utilise', 'such', 'higher', 'order', 'correlations', 'with', 'this', 'result', 'we', 'confirm', 'the', 'potential', 'application', 'of', 'our', 'data', 'generation', 'algorithm', 'to', 'analyse', 'a', 'performance', 'of', 'various', 'dimensionality', 'reduction', 'algorithms']]
|
[-0.07496605663923113, 0.008510322917995942, -0.11817458086798704, 0.11022866981274579, -0.09668126108133651, -0.11782984629132633, 0.03343220120417712, 0.4064576259900837, -0.25511224924175196, -0.29968480096566813, 0.08765568148458464, -0.2707016947570928, -0.1585549838072079, 0.15310623140891927, -0.07451091846231192, 0.07434260174848659, 0.040455934538798366, 0.017624257538510962, -0.09791981182223576, -0.31681184125197837, 0.300214162698086, 0.05922771376445294, 0.34212102672236777, 0.002880929777030508, 0.12193203909217033, 0.04046565947409849, -0.032792150454465735, 0.045330963544222676, -0.08912974306964992, 0.1345609070930825, 0.2546769296425546, 0.1607795737732505, 0.2953208103277829, -0.35754191661849183, -0.16760361025131545, 0.1527827070663185, 0.15836880813951085, 0.12816295863215832, -0.019626256311439223, -0.2334638000357636, 0.07291488390995277, -0.1980782905950544, -0.090645994501206, -0.16602209199701848, -0.0519340762885106, -0.007047106666208873, -0.3064434909759912, 0.09050364264287986, 0.09400258662157454, 0.03636843736315969, -0.0064603148101352505, -0.13377348713436013, 0.031881199371973916, 0.08442482086532034, 0.02972465553906405, 0.03663583665403949, 0.10367722431066456, -0.08896451304885993, -0.16001100232993892, 0.3603725489553844, -0.08694430297852472, -0.21275595621054255, 0.18322235326618388, -0.14182108067799098, -0.18341740190936795, 0.13574324393114293, 0.2380065533026598, 0.07363153233593546, -0.12795488993897167, 0.027641061384793976, 0.013513843902538335, 0.21764470135988018, 0.028007225095575978, 0.00983299398361597, 0.1167447246559679, 0.1719337347123317, 0.11023820192163247, 0.1528241228522749, -0.11464898952494137, -0.052014630550496974, -0.2606094605181106, -0.15714229498367194, -0.2081602395669189, -0.020613759726138384, -0.14649344378064366, -0.17149994143306516, 0.39322812362509063, 0.23440874965731487, 0.21502533830908063, 0.06981832632621707, 0.3160596867091954, 0.12117260344851719, 0.07840952565852921, 0.09370488720826892, 0.16045816847783795, 0.09429852979739609, 0.07095500480567733, -0.19831623104238494, 0.08927296111116532, 0.06283418136800445]
|
1,803.07814
|
Modeling the distribution of the arrival angle based on transmitter
antenna pattern
|
An angular distribution of received signals has a significant impact on their
spectral and correlational properties. Most of angular dispersion models do not
consider antenna patterns. The developed procedure for determining the
propagation path parameters enables a wide range of assessment of the impact of
the propagation environment on the received signal properties. In contrast to
the other models, this procedure is based on a geometrical structure, which
parameters are defined on the basis of power delay profile or spectrum This
modeling method allows also the power radiation pattern (PRP) of the
transmitting antenna. The aim of the paper is to present the influence of the
transmitter antenna PRP on the scattering propagation paths that arrive at the
receiver. This analysis is realized on the basis of simulations studies using
the developed procedure. Presented in this paper procedure maps the effects of
propagation phenomena that predominate in an azimuth plane.
|
cs.IT math.IT
|
an angular distribution of received signals has a significant impact on their spectral and correlational properties most of angular dispersion models do not consider antenna patterns the developed procedure for determining the propagation path parameters enables a wide range of assessment of the impact of the propagation environment on the received signal properties in contrast to the other models this procedure is based on a geometrical structure which parameters are defined on the basis of power delay profile or spectrum this modeling method allows also the power radiation pattern prp of the transmitting antenna the aim of the paper is to present the influence of the transmitter antenna prp on the scattering propagation paths that arrive at the receiver this analysis is realized on the basis of simulations studies using the developed procedure presented in this paper procedure maps the effects of propagation phenomena that predominate in an azimuth plane
|
[['an', 'angular', 'distribution', 'of', 'received', 'signals', 'has', 'a', 'significant', 'impact', 'on', 'their', 'spectral', 'and', 'correlational', 'properties', 'most', 'of', 'angular', 'dispersion', 'models', 'do', 'not', 'consider', 'antenna', 'patterns', 'the', 'developed', 'procedure', 'for', 'determining', 'the', 'propagation', 'path', 'parameters', 'enables', 'a', 'wide', 'range', 'of', 'assessment', 'of', 'the', 'impact', 'of', 'the', 'propagation', 'environment', 'on', 'the', 'received', 'signal', 'properties', 'in', 'contrast', 'to', 'the', 'other', 'models', 'this', 'procedure', 'is', 'based', 'on', 'a', 'geometrical', 'structure', 'which', 'parameters', 'are', 'defined', 'on', 'the', 'basis', 'of', 'power', 'delay', 'profile', 'or', 'spectrum', 'this', 'modeling', 'method', 'allows', 'also', 'the', 'power', 'radiation', 'pattern', 'prp', 'of', 'the', 'transmitting', 'antenna', 'the', 'aim', 'of', 'the', 'paper', 'is', 'to', 'present', 'the', 'influence', 'of', 'the', 'transmitter', 'antenna', 'prp', 'on', 'the', 'scattering', 'propagation', 'paths', 'that', 'arrive', 'at', 'the', 'receiver', 'this', 'analysis', 'is', 'realized', 'on', 'the', 'basis', 'of', 'simulations', 'studies', 'using', 'the', 'developed', 'procedure', 'presented', 'in', 'this', 'paper', 'procedure', 'maps', 'the', 'effects', 'of', 'propagation', 'phenomena', 'that', 'predominate', 'in', 'an', 'azimuth', 'plane']]
|
[-0.17130991796652476, 0.06569231908943038, -0.10985780323855579, 0.006360311689786613, -0.0901952655861775, -0.07174811227557559, 0.03190795356562982, 0.40371833958973485, -0.251647743859794, -0.2923045593624314, 0.06962004687404261, -0.2475418067057035, -0.17481769147794693, 0.20067288693583882, -0.013131675502906243, 0.048283954204525796, 0.05022138057836855, 0.022249871812139946, -0.049493300466953466, -0.16768616512805845, 0.31660203584164265, 0.15396690553364653, 0.3308674740170439, 0.035384023659862575, 0.10937449283276995, 0.06473049027534823, -0.06430954625209173, -0.0040403917881970605, -0.1213421435255441, 0.10753442218837639, 0.20807312648185566, 0.16377577706550558, 0.2375110855465755, -0.4094769759600361, -0.27182178471858304, 0.09667135547846556, 0.13589751619612797, 0.09445028030856822, -0.05660358037954817, -0.23354349300886193, 0.04961668513560047, -0.1530797936146458, -0.10886926495780548, 0.03460621444818874, -0.02047513096903761, 0.044352477478484316, -0.24890069468451353, 0.023569629988439072, 0.03932317411527038, 0.06440653949975968, -0.03394509346961665, -0.10643242670533558, -0.0023908133960018553, 0.148048099281732, 0.026585535373693955, -0.01805400786998992, 0.12234685847225289, -0.10768986055317024, -0.09062402678032716, 0.40084773059779155, -0.019566190869857867, -0.2349520507082343, 0.14662755179063727, -0.14668005518906285, -0.09360884507807593, 0.14682835624863705, 0.2682302030765762, 0.12522976038667064, -0.16130290373267295, 0.05648440918225484, -0.007640865699698528, 0.19408497758830587, 0.04772732013836503, 0.05915131431693832, 0.18352664785910747, 0.15852189502368372, 0.04552284859896948, 0.12055854595925969, -0.15079096071111658, -0.05962375028679768, -0.26183955527337577, -0.08262077673027912, -0.17690204269330329, -0.009998888737269833, -0.07779293735501899, -0.1610877634336551, 0.45594122741371396, 0.18113655563133457, 0.1860388267847399, 0.039015674129283674, 0.339274595088015, 0.13328965349743763, 0.04626709778327495, 0.03855614302059015, 0.25670305935665966, 0.1292654403919975, 0.1055375360387067, -0.23330335488077253, 0.10339081446640193, 0.0064853175543248655]
|
1,803.07815
|
Delay-induced blow-up in a planar oscillation model
|
In this paper we study a system of delay differential equations from the
viewpoint of a finite time blow-up of the solution. We prove that the system
admits a blow-up solution, no matter how small the length of the delay is. In
the non-delay system every solution approaches to a stable unit circle in the
plane, thus time delay induces blow-up of solutions, which we call
"delay-induced blow-up" phenomenon. Furthermore, it is shown that the system
has a family of infinitely many periodic solutions, while the non-delay system
has only one stable limit cycle. The system studied in this paper is an example
that arbitrary small delay can be responsible for a drastic change of the
dynamics. We show numerical examples to illustrate our theoretical results.
|
math.DS
|
in this paper we study a system of delay differential equations from the viewpoint of a finite time blowup of the solution we prove that the system admits a blowup solution no matter how small the length of the delay is in the nondelay system every solution approaches to a stable unit circle in the plane thus time delay induces blowup of solutions which we call delayinduced blowup phenomenon furthermore it is shown that the system has a family of infinitely many periodic solutions while the nondelay system has only one stable limit cycle the system studied in this paper is an example that arbitrary small delay can be responsible for a drastic change of the dynamics we show numerical examples to illustrate our theoretical results
|
[['in', 'this', 'paper', 'we', 'study', 'a', 'system', 'of', 'delay', 'differential', 'equations', 'from', 'the', 'viewpoint', 'of', 'a', 'finite', 'time', 'blowup', 'of', 'the', 'solution', 'we', 'prove', 'that', 'the', 'system', 'admits', 'a', 'blowup', 'solution', 'no', 'matter', 'how', 'small', 'the', 'length', 'of', 'the', 'delay', 'is', 'in', 'the', 'nondelay', 'system', 'every', 'solution', 'approaches', 'to', 'a', 'stable', 'unit', 'circle', 'in', 'the', 'plane', 'thus', 'time', 'delay', 'induces', 'blowup', 'of', 'solutions', 'which', 'we', 'call', 'delayinduced', 'blowup', 'phenomenon', 'furthermore', 'it', 'is', 'shown', 'that', 'the', 'system', 'has', 'a', 'family', 'of', 'infinitely', 'many', 'periodic', 'solutions', 'while', 'the', 'nondelay', 'system', 'has', 'only', 'one', 'stable', 'limit', 'cycle', 'the', 'system', 'studied', 'in', 'this', 'paper', 'is', 'an', 'example', 'that', 'arbitrary', 'small', 'delay', 'can', 'be', 'responsible', 'for', 'a', 'drastic', 'change', 'of', 'the', 'dynamics', 'we', 'show', 'numerical', 'examples', 'to', 'illustrate', 'our', 'theoretical', 'results']]
|
[-0.2385953025705743, 0.05000552031803333, -0.11028207294524663, 0.0380315074802465, -0.022627363047961677, -0.1385103116802398, 0.04343147450570194, 0.3158417713813602, -0.2898744996932764, -0.21902287792828348, 0.14385880734993234, -0.28177571292257025, -0.20824205420453043, 0.22136976167057004, -0.09344345463868527, 0.06275069279714472, 0.10783089323723245, 0.0733801841491922, -0.04936521792865639, -0.24772473461999897, 0.33310734546772897, -0.01742025316459134, 0.23355263699629594, 0.04627016695985009, 0.14524580963281175, -0.06036654977674877, 0.04919631602930918, 0.05429189658856818, -0.15192974155064484, 0.044585208220052575, 0.21188901817159994, 0.11217006845658438, 0.2802916382779441, -0.4039931913331014, -0.22895917391020154, 0.14832536115251954, 0.1717241147924806, 0.16314442424077746, -0.0745551743533551, -0.2343810316663058, 0.12171812895833263, -0.16369104196709242, -0.18758654965102553, -0.0498646694338984, 0.06720500117507837, 0.041565947600045346, -0.24003266693196362, 0.02463628789262166, 0.10997573774869716, 0.00944795696774409, -0.09782831722293936, 0.013416430112787538, -0.014292367480857859, 0.10289292783284235, 0.0764229798630353, 0.011642696577981705, 0.056646514587411066, -0.08508434609347393, -0.08580277472852714, 0.3831751876642802, -0.09201659632861496, -0.21212229222862608, 0.16409844993835404, -0.13747670396881562, -0.11885630268056596, 0.18026986171210568, 0.15730786017910947, 0.1529699059365879, -0.12877212170629748, 0.11677326859965448, -0.09512920974798146, 0.21347021428583604, 0.08244812337770349, 0.008089552985482095, 0.13744022851322024, 0.20739445618043342, 0.15760423127323434, 0.1302133698528263, -0.03437939497627436, -0.11809714136475194, -0.3274317803452649, -0.16994017885170049, -0.13209504458872187, 0.07084335403383843, -0.0979229947940136, -0.1703937916712935, 0.4033082202963886, 0.12843680353687395, 0.19163347574483072, 0.06844827431597791, 0.2680297974933175, 0.1952815263962654, 0.008949343178842571, 0.05659570296235856, 0.20608076559461003, 0.07413560423781977, 0.12141885924234336, -0.24370671302959737, 0.054259329411526405, 0.08750292960376967]
|
1,803.07816
|
Flow and filtration imaging of single use sterile membrane filters
|
Sterile filters incorporating endotoxin adsorption function emerged recently
to pretreat dialysate liquids fed to a hemodialysis filtration process. Their
application significantly enhances the survival rate during dialysis treatment
as they function as sterile filters as well as an endotoxin adsorber. Little is
known about the fluid flow distribution in such single use membrane modules. We
report a detailed analysis of the local 3D flow field distribution in such
membrane modules using magnetic resonance flow imaging. Next to pure water
filtration representing the application case of endotoxin adsorption from an
already pure liquid, we also used the module as a filtration device rejecting
for instance colloidal silica. Such experiments performed in-situ allow the
quantification of cake layer development and its concomitant redistribution of
the flow field. Particularly novel is the quantification of the time evolution
of local permeate flux distribution. These detailed insights of this study
encourage the use of flow-MRI when designing and applying new membrane module
configurations.
|
physics.ins-det
|
sterile filters incorporating endotoxin adsorption function emerged recently to pretreat dialysate liquids fed to a hemodialysis filtration process their application significantly enhances the survival rate during dialysis treatment as they function as sterile filters as well as an endotoxin adsorber little is known about the fluid flow distribution in such single use membrane modules we report a detailed analysis of the local 3d flow field distribution in such membrane modules using magnetic resonance flow imaging next to pure water filtration representing the application case of endotoxin adsorption from an already pure liquid we also used the module as a filtration device rejecting for instance colloidal silica such experiments performed insitu allow the quantification of cake layer development and its concomitant redistribution of the flow field particularly novel is the quantification of the time evolution of local permeate flux distribution these detailed insights of this study encourage the use of flowmri when designing and applying new membrane module configurations
|
[['sterile', 'filters', 'incorporating', 'endotoxin', 'adsorption', 'function', 'emerged', 'recently', 'to', 'pretreat', 'dialysate', 'liquids', 'fed', 'to', 'a', 'hemodialysis', 'filtration', 'process', 'their', 'application', 'significantly', 'enhances', 'the', 'survival', 'rate', 'during', 'dialysis', 'treatment', 'as', 'they', 'function', 'as', 'sterile', 'filters', 'as', 'well', 'as', 'an', 'endotoxin', 'adsorber', 'little', 'is', 'known', 'about', 'the', 'fluid', 'flow', 'distribution', 'in', 'such', 'single', 'use', 'membrane', 'modules', 'we', 'report', 'a', 'detailed', 'analysis', 'of', 'the', 'local', '3d', 'flow', 'field', 'distribution', 'in', 'such', 'membrane', 'modules', 'using', 'magnetic', 'resonance', 'flow', 'imaging', 'next', 'to', 'pure', 'water', 'filtration', 'representing', 'the', 'application', 'case', 'of', 'endotoxin', 'adsorption', 'from', 'an', 'already', 'pure', 'liquid', 'we', 'also', 'used', 'the', 'module', 'as', 'a', 'filtration', 'device', 'rejecting', 'for', 'instance', 'colloidal', 'silica', 'such', 'experiments', 'performed', 'insitu', 'allow', 'the', 'quantification', 'of', 'cake', 'layer', 'development', 'and', 'its', 'concomitant', 'redistribution', 'of', 'the', 'flow', 'field', 'particularly', 'novel', 'is', 'the', 'quantification', 'of', 'the', 'time', 'evolution', 'of', 'local', 'permeate', 'flux', 'distribution', 'these', 'detailed', 'insights', 'of', 'this', 'study', 'encourage', 'the', 'use', 'of', 'flowmri', 'when', 'designing', 'and', 'applying', 'new', 'membrane', 'module', 'configurations']]
|
[-0.05933037612947725, 0.10452142615761277, -0.07886114977750808, 0.021441267223171082, -0.05398436140329126, -0.12808096596310214, 0.013810897053730103, 0.3786661906348121, -0.31410309818362997, -0.30284123509641614, 0.11165355036125309, -0.23640967617712674, -0.15301869432291676, 0.16928101526272873, -0.045345951403461156, 0.07064004412273907, 0.057095239855228894, -0.03312846469435176, -0.0008457542885275137, -0.17839348569752708, 0.2613577726221974, 0.12588551212703028, 0.3209107272041541, 0.05316777165618635, 0.10752098527286322, 0.05187394564911242, -0.023641784723487592, 0.0032646106015289983, -0.15245560564761682, 0.0784925572634224, 0.22818121169092914, 0.07835543061087412, 0.2557017501203283, -0.4921821136868769, -0.2540277670407968, 0.08461295611810901, 0.142571443289278, 0.09783765271065696, -0.08813745493760272, -0.23932110448968746, 0.015587911448411403, -0.19893859712437034, -0.1015750341387766, -0.0764928211307814, -0.02352486735945868, 0.02109163640979527, -0.2509341744045096, 0.07260374172962451, 0.032122112869945985, 0.10768537163854607, -0.10564977804934907, -0.13046937168936334, -0.05818864059514336, 0.15978545019527027, 0.043348422954272055, 0.005922621538141562, 0.26344738174079646, -0.18171844283389227, -0.08453715403954828, 0.3505319511457797, -0.08367487041790399, -0.17071660798223268, 0.20200023388550167, -0.11581502598860571, -0.09224298573568493, 0.14830304676546685, 0.14516317935720566, 0.12810602908833854, -0.13971986300058498, -0.003664845781731269, -0.02254505350344604, 0.15472593389812014, 0.07414165321707485, 0.011008678825812475, 0.22378471073424144, 0.2588335107576342, 0.06217261719247026, 0.16522669467714526, -0.12143558439828696, -0.055368245996895334, -0.2613478812719545, -0.24151473055563627, -0.12667867213998352, 0.04650284376280803, -0.07217068834091356, -0.1829246663548533, 0.38801590498656996, 0.1026248304113265, 0.1623003532539212, -0.002974856084573173, 0.268150702833889, 0.05209232222874679, 0.07270541314275995, -0.003071148470494776, 0.20444391575499227, 0.15010481793733854, 0.12088462579657414, -0.18860997624747874, 0.07827075984133708, 0.031966696691609196]
|
1,803.07817
|
Patch-based Fake Fingerprint Detection Using a Fully Convolutional
Neural Network with a Small Number of Parameters and an Optimal Threshold
|
Fingerprint authentication is widely used in biometrics due to its simple
process, but it is vulnerable to fake fingerprints. This study proposes a
patch-based fake fingerprint detection method using a fully convolutional
neural network with a small number of parameters and an optimal threshold to
solve the above-mentioned problem. Unlike the existing methods that classify a
fingerprint as live or fake, the proposed method classifies fingerprints as
fake, live, or background, so preprocessing methods such as segmentation are
not needed. The proposed convolutional neural network (CNN) structure applies
the Fire module of SqueezeNet, and the fewer parameters used require only 2.0
MB of memory. The network that has completed training is applied to the
training data in a fully convolutional way, and the optimal threshold to
distinguish fake fingerprints is determined, which is used in the final test.
As a result of this study experiment, the proposed method showed an average
classification error of 1.35%, demonstrating a fake fingerprint detection
method using a high-performance CNN with a small number of parameters.
|
cs.CV
|
fingerprint authentication is widely used in biometrics due to its simple process but it is vulnerable to fake fingerprints this study proposes a patchbased fake fingerprint detection method using a fully convolutional neural network with a small number of parameters and an optimal threshold to solve the abovementioned problem unlike the existing methods that classify a fingerprint as live or fake the proposed method classifies fingerprints as fake live or background so preprocessing methods such as segmentation are not needed the proposed convolutional neural network cnn structure applies the fire module of squeezenet and the fewer parameters used require only 20 mb of memory the network that has completed training is applied to the training data in a fully convolutional way and the optimal threshold to distinguish fake fingerprints is determined which is used in the final test as a result of this study experiment the proposed method showed an average classification error of 135 demonstrating a fake fingerprint detection method using a highperformance cnn with a small number of parameters
|
[['fingerprint', 'authentication', 'is', 'widely', 'used', 'in', 'biometrics', 'due', 'to', 'its', 'simple', 'process', 'but', 'it', 'is', 'vulnerable', 'to', 'fake', 'fingerprints', 'this', 'study', 'proposes', 'a', 'patchbased', 'fake', 'fingerprint', 'detection', 'method', 'using', 'a', 'fully', 'convolutional', 'neural', 'network', 'with', 'a', 'small', 'number', 'of', 'parameters', 'and', 'an', 'optimal', 'threshold', 'to', 'solve', 'the', 'abovementioned', 'problem', 'unlike', 'the', 'existing', 'methods', 'that', 'classify', 'a', 'fingerprint', 'as', 'live', 'or', 'fake', 'the', 'proposed', 'method', 'classifies', 'fingerprints', 'as', 'fake', 'live', 'or', 'background', 'so', 'preprocessing', 'methods', 'such', 'as', 'segmentation', 'are', 'not', 'needed', 'the', 'proposed', 'convolutional', 'neural', 'network', 'cnn', 'structure', 'applies', 'the', 'fire', 'module', 'of', 'squeezenet', 'and', 'the', 'fewer', 'parameters', 'used', 'require', 'only', '20', 'mb', 'of', 'memory', 'the', 'network', 'that', 'has', 'completed', 'training', 'is', 'applied', 'to', 'the', 'training', 'data', 'in', 'a', 'fully', 'convolutional', 'way', 'and', 'the', 'optimal', 'threshold', 'to', 'distinguish', 'fake', 'fingerprints', 'is', 'determined', 'which', 'is', 'used', 'in', 'the', 'final', 'test', 'as', 'a', 'result', 'of', 'this', 'study', 'experiment', 'the', 'proposed', 'method', 'showed', 'an', 'average', 'classification', 'error', 'of', '135', 'demonstrating', 'a', 'fake', 'fingerprint', 'detection', 'method', 'using', 'a', 'highperformance', 'cnn', 'with', 'a', 'small', 'number', 'of', 'parameters']]
|
[-0.0707903536110136, -0.020584440908404285, -0.058828443844328844, 0.06601018318741547, -0.08159669882982795, -0.21044079388072442, 0.02916159949194618, 0.39898644893141516, -0.26108490554234615, -0.35168056268168735, 0.09957520675788258, -0.24092517503433758, -0.21739916581039628, 0.1947369260729797, -0.12305410257241095, 0.10870443171193846, 0.10176497192410698, 0.08584560621502586, -0.03167502420317186, -0.30490028676958153, 0.2701249761256384, 0.053941158022274054, 0.3582178575234564, 0.009265976209106326, 0.13063739448832076, -0.03713431080792382, -0.06560521399362655, -0.019022846062754808, -0.037851054111528976, 0.10965331027227078, 0.2970535828383389, 0.17957460224541308, 0.287307975847786, -0.3880228178483047, -0.2162097274545003, 0.13438615608383078, 0.15854784640979175, 0.15702579906469005, -0.04780655866216498, -0.31390210274710423, 0.1570107402410685, -0.20464156379062703, -0.03264558403235343, -0.12300780643055444, -0.041102029312380224, -0.042268810521440894, -0.28231323629717087, 0.03559309823917802, 0.05114181285251915, 0.044642032241198226, -0.012978609863053246, -0.06891124128712592, -0.008703313928576763, 0.16429287936179, 0.004890022566371831, 0.07343485207454852, 0.15267823278707893, -0.166231995380391, -0.13339958636550375, 0.35291187111179384, -0.042471164494360746, -0.21245044794213436, 0.1785412197319889, 0.01972203608789503, -0.10313867882155535, 0.1634759372481477, 0.21554174289455888, 0.149366026736077, -0.16942722834639895, -0.028943245003356637, -0.05399206896416015, 0.20941595379698869, 0.029637737736127705, -0.022722945718791836, 0.14957130273902103, 0.23431571545446978, 0.043906307753042065, 0.12714564781744928, -0.17901175752096968, 0.00358710490055321, -0.23179930429742263, -0.12701008447897974, -0.21160967019522747, -0.007244902366022743, -0.04628159145101951, -0.19000852866130963, 0.4407184902709304, 0.19698853794027837, 0.25510245312430097, 0.05965988980184107, 0.3557549623434829, 0.01170529804481139, 0.1730899599218082, 0.0843294848938478, 0.19980341987139735, 0.0391128191517459, 0.11212026074049417, -0.14456602544877786, 0.11335029401299027, 0.0882149622802846]
|
1,803.07818
|
Phase Retrieval via Sensor Network Localization
|
The problem of phase retrieval is revisited and studied from a fresh
perspective. In particular, we establish a connection between the phase
retrieval problem and the sensor network localization problem, which allows us
to utilize the vast theoretical and algorithmic literature on the latter to
tackle the former. Leveraging this connection, we develop a two-stage algorithm
for phase retrieval that can provably recover the desired signal. In both
sparse and dense settings, our proposed algorithm improves upon prior
approaches simultaneously in the number of required measurements for recovery
and the reconstruction time. We present numerical results to corroborate our
theory and to demonstrate the efficiency of the proposed algorithm. As a side
result, we propose a new form of phase retrieval problem and connect it to the
complex rigidity theory proposed by Gortler and Thurston.
|
math.OC eess.SP math.MG
|
the problem of phase retrieval is revisited and studied from a fresh perspective in particular we establish a connection between the phase retrieval problem and the sensor network localization problem which allows us to utilize the vast theoretical and algorithmic literature on the latter to tackle the former leveraging this connection we develop a twostage algorithm for phase retrieval that can provably recover the desired signal in both sparse and dense settings our proposed algorithm improves upon prior approaches simultaneously in the number of required measurements for recovery and the reconstruction time we present numerical results to corroborate our theory and to demonstrate the efficiency of the proposed algorithm as a side result we propose a new form of phase retrieval problem and connect it to the complex rigidity theory proposed by gortler and thurston
|
[['the', 'problem', 'of', 'phase', 'retrieval', 'is', 'revisited', 'and', 'studied', 'from', 'a', 'fresh', 'perspective', 'in', 'particular', 'we', 'establish', 'a', 'connection', 'between', 'the', 'phase', 'retrieval', 'problem', 'and', 'the', 'sensor', 'network', 'localization', 'problem', 'which', 'allows', 'us', 'to', 'utilize', 'the', 'vast', 'theoretical', 'and', 'algorithmic', 'literature', 'on', 'the', 'latter', 'to', 'tackle', 'the', 'former', 'leveraging', 'this', 'connection', 'we', 'develop', 'a', 'twostage', 'algorithm', 'for', 'phase', 'retrieval', 'that', 'can', 'provably', 'recover', 'the', 'desired', 'signal', 'in', 'both', 'sparse', 'and', 'dense', 'settings', 'our', 'proposed', 'algorithm', 'improves', 'upon', 'prior', 'approaches', 'simultaneously', 'in', 'the', 'number', 'of', 'required', 'measurements', 'for', 'recovery', 'and', 'the', 'reconstruction', 'time', 'we', 'present', 'numerical', 'results', 'to', 'corroborate', 'our', 'theory', 'and', 'to', 'demonstrate', 'the', 'efficiency', 'of', 'the', 'proposed', 'algorithm', 'as', 'a', 'side', 'result', 'we', 'propose', 'a', 'new', 'form', 'of', 'phase', 'retrieval', 'problem', 'and', 'connect', 'it', 'to', 'the', 'complex', 'rigidity', 'theory', 'proposed', 'by', 'gortler', 'and', 'thurston']]
|
[-0.07956532321835834, 0.005318266198177029, -0.10061983126733039, 0.02207096339099937, -0.07514126199056152, -0.12678729788641688, 0.10680520886693287, 0.37557574245319875, -0.29599436728490724, -0.3288133025859241, 0.10954446690157056, -0.23022735668529531, -0.2318438373023161, 0.17474311910293722, -0.12627345869248663, 0.09624286101423894, 0.05243462185996274, 0.017442635688240882, -0.10405629596293524, -0.24878836560787426, 0.2831665712926123, 0.06155191169430812, 0.3172139089140627, 0.06975014741980919, 0.10981405606769301, 0.03139002046976842, -0.048009873767969787, 0.014311142830626556, -0.1337254117967893, 0.1624780191556999, 0.2768304838936914, 0.19386628642333326, 0.2492108671753495, -0.41803028561450817, -0.2545784484664047, 0.10191842953295067, 0.13063985959937174, 0.13659857986408666, -0.09294027040143393, -0.2913564663880539, 0.09695401936769485, -0.13921740989166279, -0.04032284569133211, -0.11363298953683287, -0.057353987037721606, -0.03615139186796215, -0.30056933911034356, 0.05175041837134847, 0.07024760403911824, -0.03182951755545758, -0.07271569400241047, -0.06649861022209128, 0.08338476845442697, 0.14833999828745922, 0.03512355304970966, 0.0534171646564371, 0.05715077959380492, -0.1067806439594952, -0.12134147872458453, 0.36804724131469374, -0.025594748163388834, -0.1685979127952898, 0.1948683240071491, -0.08262868362513405, -0.14930895103693562, 0.12718372368426234, 0.19938223715181705, 0.13832842251630845, -0.10362733945388485, 0.05156281258634947, -0.0548622267148285, 0.16144749575329048, 0.026678170805314073, 0.0063126038690959965, 0.12474981603661069, 0.1914260182650415, 0.11214953679591418, 0.18778533072995574, -0.09689068220107368, -0.11673718051708959, -0.24503233414143324, -0.13977727318975935, -0.2044795089504785, -0.050997875247978504, -0.1009912716837048, -0.1237543218113758, 0.4016481979491396, 0.2292835328279546, 0.2198327171995684, 0.08781738196482398, 0.3469075746834278, 0.06021831434702984, -0.001464177271420205, 0.06976626111125504, 0.22644659181435903, 0.1417514130904305, 0.14367981334734295, -0.21961292360426374, 0.05418264067524837, 0.09790375399299794]
|
1,803.07819
|
Some Theoretical Properties of GANs
|
Generative Adversarial Networks (GANs) are a class of generative algorithms
that have been shown to produce state-of-the art samples, especially in the
domain of image creation. The fundamental principle of GANs is to approximate
the unknown distribution of a given data set by optimizing an objective
function through an adversarial game between a family of generators and a
family of discriminators. In this paper, we offer a better theoretical
understanding of GANs by analyzing some of their mathematical and statistical
properties. We study the deep connection between the adversarial principle
underlying GANs and the Jensen-Shannon divergence, together with some
optimality characteristics of the problem. An analysis of the role of the
discriminator family via approximation arguments is also provided. In addition,
taking a statistical point of view, we study the large sample properties of the
estimated distribution and prove in particular a central limit theorem. Some of
our results are illustrated with simulated examples.
|
stat.ML cs.LG
|
generative adversarial networks gans are a class of generative algorithms that have been shown to produce stateofthe art samples especially in the domain of image creation the fundamental principle of gans is to approximate the unknown distribution of a given data set by optimizing an objective function through an adversarial game between a family of generators and a family of discriminators in this paper we offer a better theoretical understanding of gans by analyzing some of their mathematical and statistical properties we study the deep connection between the adversarial principle underlying gans and the jensenshannon divergence together with some optimality characteristics of the problem an analysis of the role of the discriminator family via approximation arguments is also provided in addition taking a statistical point of view we study the large sample properties of the estimated distribution and prove in particular a central limit theorem some of our results are illustrated with simulated examples
|
[['generative', 'adversarial', 'networks', 'gans', 'are', 'a', 'class', 'of', 'generative', 'algorithms', 'that', 'have', 'been', 'shown', 'to', 'produce', 'stateofthe', 'art', 'samples', 'especially', 'in', 'the', 'domain', 'of', 'image', 'creation', 'the', 'fundamental', 'principle', 'of', 'gans', 'is', 'to', 'approximate', 'the', 'unknown', 'distribution', 'of', 'a', 'given', 'data', 'set', 'by', 'optimizing', 'an', 'objective', 'function', 'through', 'an', 'adversarial', 'game', 'between', 'a', 'family', 'of', 'generators', 'and', 'a', 'family', 'of', 'discriminators', 'in', 'this', 'paper', 'we', 'offer', 'a', 'better', 'theoretical', 'understanding', 'of', 'gans', 'by', 'analyzing', 'some', 'of', 'their', 'mathematical', 'and', 'statistical', 'properties', 'we', 'study', 'the', 'deep', 'connection', 'between', 'the', 'adversarial', 'principle', 'underlying', 'gans', 'and', 'the', 'jensenshannon', 'divergence', 'together', 'with', 'some', 'optimality', 'characteristics', 'of', 'the', 'problem', 'an', 'analysis', 'of', 'the', 'role', 'of', 'the', 'discriminator', 'family', 'via', 'approximation', 'arguments', 'is', 'also', 'provided', 'in', 'addition', 'taking', 'a', 'statistical', 'point', 'of', 'view', 'we', 'study', 'the', 'large', 'sample', 'properties', 'of', 'the', 'estimated', 'distribution', 'and', 'prove', 'in', 'particular', 'a', 'central', 'limit', 'theorem', 'some', 'of', 'our', 'results', 'are', 'illustrated', 'with', 'simulated', 'examples']]
|
[-0.05709546685820542, -0.0037376598592782574, -0.11777309363998183, 0.11572894846261539, -0.06584658421872353, -0.08623299639151952, 0.038439625998892425, 0.41083533324712473, -0.26768061611650196, -0.33169700239192357, 0.06575458201839794, -0.28256930987193407, -0.2035096158128377, 0.19541295337514927, -0.11952612405134873, 0.09532347846739962, 0.08476794113755806, 0.015125325156750713, -0.06687747660945714, -0.24297978046241325, 0.356582607038307, 0.0411649649316829, 0.3224493808040468, 0.0076040259997856305, 0.12569146496909006, -0.043146353895328456, -0.010441477731015388, 0.01881478942156612, -0.12215385394490834, 0.1915431251354794, 0.25113336814494874, 0.1972503477870789, 0.35678564488899883, -0.40542739775467795, -0.2223641193750036, 0.1519652524442932, 0.08520681086576895, 0.09803815007621011, -0.10445352885705818, -0.3047103034513821, 0.12118203731181172, -0.1438483822268325, -0.08460630474377018, -0.10409437032271322, -0.05282425925183993, 0.06039215962012456, -0.2880029037788317, -0.0015389769923549702, 0.13416673620412875, 0.08761762785301967, -0.03525505677831674, -0.1092417941053773, -0.01270002691232442, 0.1349126791427299, 0.06712840672570293, 0.02886744789996898, 0.06606719502574437, -0.19224866699917217, -0.14499859860644665, 0.31634764789109265, -0.03779081967598819, -0.20199582733927512, 0.15078996693830357, -0.07480743362616699, -0.14272588414635945, 0.07490546608044367, 0.21253458425771543, 0.13958448206691385, -0.1789475977420807, 0.060801559165664404, -0.06100682184015485, 0.09332719862452775, 0.014011869418688795, 0.058009491205312215, 0.167354026900048, 0.21078348053504362, 0.023789310475581554, 0.18791190207204117, -0.0915955026881987, -0.1287239010252252, -0.30241200239579014, -0.11774476771484818, -0.22705270751234288, 0.04514484173488235, -0.12231982781894976, -0.16245618354368127, 0.4086231433290553, 0.17216930869216848, 0.22453484629649767, 0.10016557472068574, 0.2802703578581477, 0.08576015641547319, 0.015157194377237617, 0.0606831848022661, 0.22473429519718652, 0.13949405166544263, 0.04746659611375978, -0.1516001143994705, 0.10407614378960102, 0.0521166856476641]
|
1,803.0782
|
What are the microscopic events of colloidal membrane fouling?
|
Due to the complex interplay between surface adsorption and hydrodynamic
interactions, representative microscopic mechanisms of colloidal membrane
fouling are still not well understood. Numerical simulations overcome
experimental limitations such as the temporal and spatial resolution of
microscopic events during colloidal membrane fouling: they help to gain deeper
insight into fouling processes. This study uses coupled computational fluid
dynamics - discrete element methods (CFD-DEM) simulations to examine mechanisms
of colloidal fouling in a microfluidic architecture mimicking a porous
microfiltration membrane. We pay special attention to how particles can
overcome energy barriers leading to adsorption and desorption with each other
and with the external and internal membrane surface. Interparticle interaction
leads to a transition from the secondary to the primary minimum of the DLVO
potential. Adsorbed particles can show re-entrainment or they can glide
downstream. Since particles mainly re-suspend as clusters, the inner pore
geometry significantly affects the fouling behavior. The findings allow a basic
understanding of microscopic fouling events during colloidal filtration. The
methodology enables future systematic studies on the interplay of hydrodynamic
conditions and surface energy contributions represented by potentials for soft
and patchy colloids.
|
physics.comp-ph cond-mat.soft
|
due to the complex interplay between surface adsorption and hydrodynamic interactions representative microscopic mechanisms of colloidal membrane fouling are still not well understood numerical simulations overcome experimental limitations such as the temporal and spatial resolution of microscopic events during colloidal membrane fouling they help to gain deeper insight into fouling processes this study uses coupled computational fluid dynamics discrete element methods cfddem simulations to examine mechanisms of colloidal fouling in a microfluidic architecture mimicking a porous microfiltration membrane we pay special attention to how particles can overcome energy barriers leading to adsorption and desorption with each other and with the external and internal membrane surface interparticle interaction leads to a transition from the secondary to the primary minimum of the dlvo potential adsorbed particles can show reentrainment or they can glide downstream since particles mainly resuspend as clusters the inner pore geometry significantly affects the fouling behavior the findings allow a basic understanding of microscopic fouling events during colloidal filtration the methodology enables future systematic studies on the interplay of hydrodynamic conditions and surface energy contributions represented by potentials for soft and patchy colloids
|
[['due', 'to', 'the', 'complex', 'interplay', 'between', 'surface', 'adsorption', 'and', 'hydrodynamic', 'interactions', 'representative', 'microscopic', 'mechanisms', 'of', 'colloidal', 'membrane', 'fouling', 'are', 'still', 'not', 'well', 'understood', 'numerical', 'simulations', 'overcome', 'experimental', 'limitations', 'such', 'as', 'the', 'temporal', 'and', 'spatial', 'resolution', 'of', 'microscopic', 'events', 'during', 'colloidal', 'membrane', 'fouling', 'they', 'help', 'to', 'gain', 'deeper', 'insight', 'into', 'fouling', 'processes', 'this', 'study', 'uses', 'coupled', 'computational', 'fluid', 'dynamics', 'discrete', 'element', 'methods', 'cfddem', 'simulations', 'to', 'examine', 'mechanisms', 'of', 'colloidal', 'fouling', 'in', 'a', 'microfluidic', 'architecture', 'mimicking', 'a', 'porous', 'microfiltration', 'membrane', 'we', 'pay', 'special', 'attention', 'to', 'how', 'particles', 'can', 'overcome', 'energy', 'barriers', 'leading', 'to', 'adsorption', 'and', 'desorption', 'with', 'each', 'other', 'and', 'with', 'the', 'external', 'and', 'internal', 'membrane', 'surface', 'interparticle', 'interaction', 'leads', 'to', 'a', 'transition', 'from', 'the', 'secondary', 'to', 'the', 'primary', 'minimum', 'of', 'the', 'dlvo', 'potential', 'adsorbed', 'particles', 'can', 'show', 'reentrainment', 'or', 'they', 'can', 'glide', 'downstream', 'since', 'particles', 'mainly', 'resuspend', 'as', 'clusters', 'the', 'inner', 'pore', 'geometry', 'significantly', 'affects', 'the', 'fouling', 'behavior', 'the', 'findings', 'allow', 'a', 'basic', 'understanding', 'of', 'microscopic', 'fouling', 'events', 'during', 'colloidal', 'filtration', 'the', 'methodology', 'enables', 'future', 'systematic', 'studies', 'on', 'the', 'interplay', 'of', 'hydrodynamic', 'conditions', 'and', 'surface', 'energy', 'contributions', 'represented', 'by', 'potentials', 'for', 'soft', 'and', 'patchy', 'colloids']]
|
[-0.07326120932351102, 0.1907957144884986, -0.09004114596537764, 0.04863481488076274, -0.0834373953665228, -0.153026280929795, 0.017585906958089793, 0.38566475045217385, -0.31675144007101985, -0.3270060704268802, 0.012863911042926363, -0.2677939941193192, -0.1854796548550539, 0.11899893354863737, -0.05194272470767968, 0.035473894053151586, 0.06526801234704781, -0.08227047736751386, 0.015603889492442728, -0.15448622334912254, 0.22854152858605262, 0.12069608371418256, 0.2711301819871661, 0.15950213310022193, 0.07827986578283073, -0.024168295059788073, -0.00806794283594322, 0.03397028694942512, -0.2194283618308683, 0.0867453203363866, 0.23672794142340126, -0.01975113539611102, 0.23816798929544677, -0.5817463980107517, -0.29404750437178945, 0.07315881829452957, 0.18121957217834397, 0.12072144530935515, -0.06393298386803388, -0.2474105013380912, 0.006156472096176163, -0.12546497535799722, -0.12079436990053771, -0.06785005747064293, -0.022408009166471086, 0.08089967664864661, -0.21077023251660187, 0.10188885362931414, 0.04199395848343476, 0.03896421913548813, -0.09651196530667021, -0.06754834246041336, -0.07449223458956272, 0.13973286041125124, 0.06865125989597701, -0.05568420429039839, 0.3113108398316039, -0.14785991387907416, -0.08187637183876646, 0.41969211353500796, 0.0089314374676138, -0.22169947978825524, 0.28806678992747276, -0.11482070234686054, -0.06438758266209574, 0.19555899439824764, 0.20946705109276043, 0.05938396185804747, -0.1752977811956553, 0.022113435336575425, 0.07005036131806344, 0.176493425953335, 0.0710801202113034, -0.014644166723323556, 0.2723061245441396, 0.25223446506264896, -0.0061699718001534, 0.1467285988750678, -0.07484455590307774, -0.1457047175275735, -0.22778208108598386, -0.15712500765541015, -0.14518647067310228, 0.04029596577013333, -0.10243017428481355, -0.158490772402569, 0.34582728520035744, 0.11319389362604572, 0.15641201045466485, -0.009964484276229537, 0.2690343658112317, -0.00953560605310006, 0.05411933623970701, -0.03205723468992081, 0.23063642020173536, 0.13943520651050526, 0.12988968396938028, -0.27323450902118707, 0.07217661267821933, 0.05308526321723648]
|
1,803.07821
|
Multi-view Metric Learning in Vector-valued Kernel Spaces
|
We consider the problem of metric learning for multi-view data and present a
novel method for learning within-view as well as between-view metrics in
vector-valued kernel spaces, as a way to capture multi-modal structure of the
data. We formulate two convex optimization problems to jointly learn the metric
and the classifier or regressor in kernel feature spaces. An iterative
three-step multi-view metric learning algorithm is derived from the
optimization problems. In order to scale the computation to large training
sets, a block-wise Nystr{\"o}m approximation of the multi-view kernel matrix is
introduced. We justify our approach theoretically and experimentally, and show
its performance on real-world datasets against relevant state-of-the-art
methods.
|
cs.LG stat.ML
|
we consider the problem of metric learning for multiview data and present a novel method for learning withinview as well as betweenview metrics in vectorvalued kernel spaces as a way to capture multimodal structure of the data we formulate two convex optimization problems to jointly learn the metric and the classifier or regressor in kernel feature spaces an iterative threestep multiview metric learning algorithm is derived from the optimization problems in order to scale the computation to large training sets a blockwise nystrom approximation of the multiview kernel matrix is introduced we justify our approach theoretically and experimentally and show its performance on realworld datasets against relevant stateoftheart methods
|
[['we', 'consider', 'the', 'problem', 'of', 'metric', 'learning', 'for', 'multiview', 'data', 'and', 'present', 'a', 'novel', 'method', 'for', 'learning', 'withinview', 'as', 'well', 'as', 'betweenview', 'metrics', 'in', 'vectorvalued', 'kernel', 'spaces', 'as', 'a', 'way', 'to', 'capture', 'multimodal', 'structure', 'of', 'the', 'data', 'we', 'formulate', 'two', 'convex', 'optimization', 'problems', 'to', 'jointly', 'learn', 'the', 'metric', 'and', 'the', 'classifier', 'or', 'regressor', 'in', 'kernel', 'feature', 'spaces', 'an', 'iterative', 'threestep', 'multiview', 'metric', 'learning', 'algorithm', 'is', 'derived', 'from', 'the', 'optimization', 'problems', 'in', 'order', 'to', 'scale', 'the', 'computation', 'to', 'large', 'training', 'sets', 'a', 'blockwise', 'nystrom', 'approximation', 'of', 'the', 'multiview', 'kernel', 'matrix', 'is', 'introduced', 'we', 'justify', 'our', 'approach', 'theoretically', 'and', 'experimentally', 'and', 'show', 'its', 'performance', 'on', 'realworld', 'datasets', 'against', 'relevant', 'stateoftheart', 'methods']]
|
[-0.00654228319655414, -0.07168919581979732, -0.09922896459250262, 0.12535699849939663, -0.11088073311839253, -0.15890223659031713, 0.007955073573005697, 0.4841716522005973, -0.33685085626051725, -0.27709827100840845, 0.09492371653538646, -0.26470887985218455, -0.23044761305856, 0.18830223520287998, -0.1501651803606634, 0.1641947662762875, 0.12423922194176595, 0.03190581162063474, -0.1152922869918661, -0.2971617905078111, 0.37878084066108353, 0.029609317576547188, 0.332891014872412, 0.02079644171020913, 0.19664181138311201, -0.009810529877776626, -0.022756079908167186, 0.015160438837483525, -0.061764750472287196, 0.18974552828822872, 0.34658406202301933, 0.23306592510306035, 0.34190375711639515, -0.3507180894828505, -0.22049885769202202, 0.1166751370226309, 0.1039529572137528, 0.07562070273639553, -0.001492005515265865, -0.3501613442182403, 0.06672975716086242, -0.1379042944646682, -0.0007042981623844416, -0.21069590732049956, -0.06763809354096237, -0.04930528566775912, -0.35734037702948424, 0.03083319235938015, 0.056582432086105215, 0.018095019049252623, -0.09676615953880914, -0.10818285789530448, 0.10416071583447908, 0.08124797236545149, 0.04895089948614542, 0.051325154020795946, 0.10950812434829357, -0.116183020768976, -0.1743146831523282, 0.36822486151423717, -0.07123191030027724, -0.24370272945250487, 0.156465869343029, -0.00158723702231698, -0.12966556004593494, 0.06245146540890413, 0.29258791503875897, 0.1766202177386731, -0.15050173310306422, 0.08780957099386594, -0.052640096944135926, 0.10652761712359886, 0.0059168873768713735, -0.026496565892119652, 0.0635067019934973, 0.2447446380327973, 0.11718717402847553, 0.16400221642969107, -0.1253627831767382, -0.07102668549567978, -0.2260831633530971, -0.10386243730748969, -0.243471670451712, -0.06122560353294291, -0.18150655828207232, -0.19975291189257405, 0.36435850892491917, 0.1829805296082567, 0.25945640742537324, 0.12512995066397167, 0.35905591159826145, 0.04656127789618309, 0.0674841013279985, 0.11985966954725208, 0.1568957522287275, 0.08672429459962856, 0.1052249388260491, -0.177678471446227, 0.05359522986583653, 0.1320963257673645]
|
1,803.07822
|
Fluid structure interaction with curved space lattice Boltzmann
|
We present a novel method for fluid structure interaction (FSI) simulations
where an original 2nd-order curved space lattice Boltzmann fluid solver (LBM)
is coupled to a finite element method (FEM) for thin shells. The LBM can work
independently on a standard lattice in curved coordinates without the need for
interpolation, re-meshing or an immersed boundary. The LBM distribution
functions are transformed dynamically under coordinate change. In addition,
force and momentum can be calculated on the nodes exactly in any geometry.
Furthermore, the FEM shell is a complete numerical tool with implementations
such as growth, self-contact and strong external forces. We show resolution
convergent error for standard tests under metric deformation. Mass and volume
conservation, momentum transfer, boundary-slip and pressure maintenance are
verified through specific examples. Additionally, a brief deformation stability
analysis is carried out. Next, we study the interaction of a square fluid flow
channel to a deformable shell. Finally, we simulate a flag at moderate Reynolds
number, air flow channel. The scheme is limited to small deformations of O(10%)
relative to domain size, by improving its stability the method can be naturally
extended to multiple applications without further implementations.
|
physics.comp-ph
|
we present a novel method for fluid structure interaction fsi simulations where an original 2ndorder curved space lattice boltzmann fluid solver lbm is coupled to a finite element method fem for thin shells the lbm can work independently on a standard lattice in curved coordinates without the need for interpolation remeshing or an immersed boundary the lbm distribution functions are transformed dynamically under coordinate change in addition force and momentum can be calculated on the nodes exactly in any geometry furthermore the fem shell is a complete numerical tool with implementations such as growth selfcontact and strong external forces we show resolution convergent error for standard tests under metric deformation mass and volume conservation momentum transfer boundaryslip and pressure maintenance are verified through specific examples additionally a brief deformation stability analysis is carried out next we study the interaction of a square fluid flow channel to a deformable shell finally we simulate a flag at moderate reynolds number air flow channel the scheme is limited to small deformations of o10 relative to domain size by improving its stability the method can be naturally extended to multiple applications without further implementations
|
[['we', 'present', 'a', 'novel', 'method', 'for', 'fluid', 'structure', 'interaction', 'fsi', 'simulations', 'where', 'an', 'original', '2ndorder', 'curved', 'space', 'lattice', 'boltzmann', 'fluid', 'solver', 'lbm', 'is', 'coupled', 'to', 'a', 'finite', 'element', 'method', 'fem', 'for', 'thin', 'shells', 'the', 'lbm', 'can', 'work', 'independently', 'on', 'a', 'standard', 'lattice', 'in', 'curved', 'coordinates', 'without', 'the', 'need', 'for', 'interpolation', 'remeshing', 'or', 'an', 'immersed', 'boundary', 'the', 'lbm', 'distribution', 'functions', 'are', 'transformed', 'dynamically', 'under', 'coordinate', 'change', 'in', 'addition', 'force', 'and', 'momentum', 'can', 'be', 'calculated', 'on', 'the', 'nodes', 'exactly', 'in', 'any', 'geometry', 'furthermore', 'the', 'fem', 'shell', 'is', 'a', 'complete', 'numerical', 'tool', 'with', 'implementations', 'such', 'as', 'growth', 'selfcontact', 'and', 'strong', 'external', 'forces', 'we', 'show', 'resolution', 'convergent', 'error', 'for', 'standard', 'tests', 'under', 'metric', 'deformation', 'mass', 'and', 'volume', 'conservation', 'momentum', 'transfer', 'boundaryslip', 'and', 'pressure', 'maintenance', 'are', 'verified', 'through', 'specific', 'examples', 'additionally', 'a', 'brief', 'deformation', 'stability', 'analysis', 'is', 'carried', 'out', 'next', 'we', 'study', 'the', 'interaction', 'of', 'a', 'square', 'fluid', 'flow', 'channel', 'to', 'a', 'deformable', 'shell', 'finally', 'we', 'simulate', 'a', 'flag', 'at', 'moderate', 'reynolds', 'number', 'air', 'flow', 'channel', 'the', 'scheme', 'is', 'limited', 'to', 'small', 'deformations', 'of', 'o10', 'relative', 'to', 'domain', 'size', 'by', 'improving', 'its', 'stability', 'the', 'method', 'can', 'be', 'naturally', 'extended', 'to', 'multiple', 'applications', 'without', 'further', 'implementations']]
|
[-0.12266602574246467, 0.10663196778620307, -0.0891793283643743, 0.0223280982109447, -0.08397663366197357, -0.1303785427562183, -0.012856659398903262, 0.4123929033250543, -0.3002222056806127, -0.2778836307165129, 0.11344145102704821, -0.22595060186795693, -0.08725897644562695, 0.1643160589879487, -0.04984145905581062, 0.08416322120262074, 0.11473011747421451, -0.01908616808602813, -0.0903318583985012, -0.20891006727500883, 0.2899755679080805, 0.07916488806426368, 0.28955178886834315, 0.06713905030302211, 0.09758900803706003, -0.007243518724978444, 0.004209004337628367, 0.09595514187899112, -0.14953706591887764, 0.05855349475572073, 0.19161481248407636, 0.01399756200788986, 0.25223828618237304, -0.4568749988628995, -0.2519609528697199, 0.0531782397887024, 0.15360524616371743, 0.1423262870382695, -0.0615635762704418, -0.24051245637656873, 0.07837574287913937, -0.1905121109078801, -0.15766281970140952, -0.12859720774192027, -0.017402176243849297, 0.02204443807079255, -0.2903907148286986, 0.07438720814223407, 0.02758300601722329, 0.06846807680521456, -0.07233674393624323, -0.07803631666431785, -0.02206831808305449, 0.08538247102307324, 0.021077869292447177, 0.03163243256011613, 0.14925551769217704, -0.09673661134506344, -0.045082369085066215, 0.4141822471455843, -0.047012897534172725, -0.3225366011478756, 0.1820056363589145, -0.08858540580021562, -0.05136518471839803, 0.15413823817910813, 0.20926971313951379, 0.11419560650088541, -0.13358854176261015, 0.08267010305269015, -0.014636285879147835, 0.19688001089044427, 0.07873414109938989, -0.07731839141773957, 0.1612069727754388, 0.18716080872207713, 0.0557295050097521, 0.1367815815207361, -0.09027524710948229, -0.12163741391573456, -0.33765358683590346, -0.17082060431438206, -0.1889642501870791, 0.01838658205615406, -0.13523569356412357, -0.1762180965216387, 0.33017973263973044, 0.09494944445909895, 0.13752047657946903, 0.02249900858072261, 0.3341534438927377, 0.07286768141830902, 0.07764312619356951, 0.09443367564577669, 0.2128413647302998, 0.1434472243550416, 0.07745293266315163, -0.2528266234584547, -0.00568519883173784, 0.11480212205202964]
|
1,803.07823
|
Field-free Three-Dimensional Orientation of Asymmetric-Top Molecules
|
Alignment and orientation of molecules by intense, ultrashort laser fields
are crucial for a variety of applications in physics and chemistry. These
include control of high harmonics generation, molecular orbitals tomography,
control of molecular photoionization and dissociation processes, production of
"molecular movies" with the help of X-ray free-electron laser sources and
ultrafast electron diffraction of relativistic electrons. While the dynamics of
laser-induced molecular alignment has been extensively studied and
demonstrated, molecular orientation is a much more challenging task, especially
for asymmetric-top molecules. Here we report the first experimental
demonstration of a field-free, all-optical three-dimensional orientation of
asymmetric-top molecules by means of phase-locked cross-polarized two-color
laser pulses. In addition to the conventional integrated orientation factor, we
report the differential degree of orientation which is not amenable to optical
measurements, but is readily accessible in our angle-resolved imaging
technique. Our scheme applies to a wide class of asymmetric molecules and opens
new ways towards controlling their orientation, eventually leading to direct
imaging of structure of gas-phase molecules using advanced free electron laser
beams with extremely high spatiotemporal resolution.
|
physics.chem-ph physics.optics
|
alignment and orientation of molecules by intense ultrashort laser fields are crucial for a variety of applications in physics and chemistry these include control of high harmonics generation molecular orbitals tomography control of molecular photoionization and dissociation processes production of molecular movies with the help of xray freeelectron laser sources and ultrafast electron diffraction of relativistic electrons while the dynamics of laserinduced molecular alignment has been extensively studied and demonstrated molecular orientation is a much more challenging task especially for asymmetrictop molecules here we report the first experimental demonstration of a fieldfree alloptical threedimensional orientation of asymmetrictop molecules by means of phaselocked crosspolarized twocolor laser pulses in addition to the conventional integrated orientation factor we report the differential degree of orientation which is not amenable to optical measurements but is readily accessible in our angleresolved imaging technique our scheme applies to a wide class of asymmetric molecules and opens new ways towards controlling their orientation eventually leading to direct imaging of structure of gasphase molecules using advanced free electron laser beams with extremely high spatiotemporal resolution
|
[['alignment', 'and', 'orientation', 'of', 'molecules', 'by', 'intense', 'ultrashort', 'laser', 'fields', 'are', 'crucial', 'for', 'a', 'variety', 'of', 'applications', 'in', 'physics', 'and', 'chemistry', 'these', 'include', 'control', 'of', 'high', 'harmonics', 'generation', 'molecular', 'orbitals', 'tomography', 'control', 'of', 'molecular', 'photoionization', 'and', 'dissociation', 'processes', 'production', 'of', 'molecular', 'movies', 'with', 'the', 'help', 'of', 'xray', 'freeelectron', 'laser', 'sources', 'and', 'ultrafast', 'electron', 'diffraction', 'of', 'relativistic', 'electrons', 'while', 'the', 'dynamics', 'of', 'laserinduced', 'molecular', 'alignment', 'has', 'been', 'extensively', 'studied', 'and', 'demonstrated', 'molecular', 'orientation', 'is', 'a', 'much', 'more', 'challenging', 'task', 'especially', 'for', 'asymmetrictop', 'molecules', 'here', 'we', 'report', 'the', 'first', 'experimental', 'demonstration', 'of', 'a', 'fieldfree', 'alloptical', 'threedimensional', 'orientation', 'of', 'asymmetrictop', 'molecules', 'by', 'means', 'of', 'phaselocked', 'crosspolarized', 'twocolor', 'laser', 'pulses', 'in', 'addition', 'to', 'the', 'conventional', 'integrated', 'orientation', 'factor', 'we', 'report', 'the', 'differential', 'degree', 'of', 'orientation', 'which', 'is', 'not', 'amenable', 'to', 'optical', 'measurements', 'but', 'is', 'readily', 'accessible', 'in', 'our', 'angleresolved', 'imaging', 'technique', 'our', 'scheme', 'applies', 'to', 'a', 'wide', 'class', 'of', 'asymmetric', 'molecules', 'and', 'opens', 'new', 'ways', 'towards', 'controlling', 'their', 'orientation', 'eventually', 'leading', 'to', 'direct', 'imaging', 'of', 'structure', 'of', 'gasphase', 'molecules', 'using', 'advanced', 'free', 'electron', 'laser', 'beams', 'with', 'extremely', 'high', 'spatiotemporal', 'resolution']]
|
[-0.10369282436642441, 0.17030479964821346, -0.05223384218433322, 0.012947766130805989, -0.02998016997034111, -0.11669706173548051, 0.017863772994711657, 0.5152849383673377, -0.2523301996344261, -0.3178939756002034, 0.00964249186257472, -0.21970159641403536, -0.081345930417063, 0.24553377937991172, 0.03952959432588572, 0.08433440279490738, 0.0444193140534811, -0.11740970771378753, 0.0023340312340720134, -0.14013979480130895, 0.24335611149912106, 0.09819634543220507, 0.287934949798827, 0.0846531927408333, 0.13258428767916153, 0.023736503652550957, -0.005635909608827205, -0.06133275659257462, -0.10915707161290232, 0.18070740574065977, 0.2794004633363908, 0.028103637989261188, 0.22380789709727236, -0.47250523781192233, -0.25797552871120966, 0.0001233569663864645, 0.16097991147067992, 0.1749562974867083, -0.1405389202962562, -0.2633785099949984, -0.01223338274973106, -0.12101681842225596, -0.1480097155609573, -0.10604494518140034, 0.02684027212936516, 0.08570367840233799, -0.258482960800889, 0.04926105314040218, -0.019149469822216568, 0.13155861275167394, -0.0490581419673452, -0.053323238101174036, -0.020768219509839335, 0.06375474369798956, -0.057228837790634396, 0.06994200160393534, 0.2200707808075425, -0.1723295609355608, -0.15532265257735905, 0.4398416244763542, -0.0498720555717062, -0.10568241236879575, 0.22050359808649359, -0.22290097187082705, -0.11206348868753677, 0.22092988671184602, 0.14817681099520996, 0.19766745920556292, -0.13061734606261863, 0.0022245787318256175, 0.005883053215008907, 0.21227883868083486, 0.10991624131301334, 0.10530758832861796, 0.2172430581915912, 0.19624648862769722, 0.034978449177949435, 0.137548238666072, -0.17674201175263574, -0.06210650801023638, -0.17153006087226624, -0.15945574100954796, -0.1612582201804881, 0.06988529787560599, -0.002459209733139935, -0.0975487203815481, 0.3864585252694972, 0.12904947880253365, 0.10002553378118054, -0.10267655970462576, 0.3500241046475077, 0.07427520940241679, 0.03664936448727862, -0.05221867447207015, 0.24181951489828696, 0.1789082529959904, 0.08100346411943478, -0.2669850729527587, 0.0676162410884651, -0.038485908069891266]
|
1,803.07824
|
A First-Principles Study on the Adsorption of Small Molecules on
Antimonene: Oxidation Tendency and Stability
|
Antimonene, a new group-VA 2D semiconducting material beyond phosphorene, was
recently synthesized through various approaches and was shown to exhibit a good
structural integrity in ambient conditions and various interesting properties.
In this work, we perform systematical first-principles investigations on the
interactions of antimonene with the small molecules CO, NO, NO2, H2O, O2, NH3
and H2. It is found that NO, NO2, H2O, O2, and NH3 serve as charge acceptors,
while CO shows a negligible charge transfer. H2 acts as a charge donor to
antimonene with the amount of charge transfer being ten times that of H2 on
phosphorene. The interaction of the O2 molecule with antimonene is much
stronger than that with phosphorene. Surprisingly, the kinetic barrier for the
splitting of the O2 molecule on antimonene is low (~0.40 eV), suggesting that
pristine antimonene may undergo oxidation in ambient conditions, especially at
elevated temperatures. Fortunately, the acceptor role of H2O on antimonene,
opposite to a donor role in phosphorene, helps to suppress further structural
degradation of the oxidized antimonene by preventing the proton transfer
between water molecules and oxygen species to form acids.
|
cond-mat.mtrl-sci
|
antimonene a new groupva 2d semiconducting material beyond phosphorene was recently synthesized through various approaches and was shown to exhibit a good structural integrity in ambient conditions and various interesting properties in this work we perform systematical firstprinciples investigations on the interactions of antimonene with the small molecules co no no2 h2o o2 nh3 and h2 it is found that no no2 h2o o2 and nh3 serve as charge acceptors while co shows a negligible charge transfer h2 acts as a charge donor to antimonene with the amount of charge transfer being ten times that of h2 on phosphorene the interaction of the o2 molecule with antimonene is much stronger than that with phosphorene surprisingly the kinetic barrier for the splitting of the o2 molecule on antimonene is low 040 ev suggesting that pristine antimonene may undergo oxidation in ambient conditions especially at elevated temperatures fortunately the acceptor role of h2o on antimonene opposite to a donor role in phosphorene helps to suppress further structural degradation of the oxidized antimonene by preventing the proton transfer between water molecules and oxygen species to form acids
|
[['antimonene', 'a', 'new', 'groupva', '2d', 'semiconducting', 'material', 'beyond', 'phosphorene', 'was', 'recently', 'synthesized', 'through', 'various', 'approaches', 'and', 'was', 'shown', 'to', 'exhibit', 'a', 'good', 'structural', 'integrity', 'in', 'ambient', 'conditions', 'and', 'various', 'interesting', 'properties', 'in', 'this', 'work', 'we', 'perform', 'systematical', 'firstprinciples', 'investigations', 'on', 'the', 'interactions', 'of', 'antimonene', 'with', 'the', 'small', 'molecules', 'co', 'no', 'no2', 'h2o', 'o2', 'nh3', 'and', 'h2', 'it', 'is', 'found', 'that', 'no', 'no2', 'h2o', 'o2', 'and', 'nh3', 'serve', 'as', 'charge', 'acceptors', 'while', 'co', 'shows', 'a', 'negligible', 'charge', 'transfer', 'h2', 'acts', 'as', 'a', 'charge', 'donor', 'to', 'antimonene', 'with', 'the', 'amount', 'of', 'charge', 'transfer', 'being', 'ten', 'times', 'that', 'of', 'h2', 'on', 'phosphorene', 'the', 'interaction', 'of', 'the', 'o2', 'molecule', 'with', 'antimonene', 'is', 'much', 'stronger', 'than', 'that', 'with', 'phosphorene', 'surprisingly', 'the', 'kinetic', 'barrier', 'for', 'the', 'splitting', 'of', 'the', 'o2', 'molecule', 'on', 'antimonene', 'is', 'low', '040', 'ev', 'suggesting', 'that', 'pristine', 'antimonene', 'may', 'undergo', 'oxidation', 'in', 'ambient', 'conditions', 'especially', 'at', 'elevated', 'temperatures', 'fortunately', 'the', 'acceptor', 'role', 'of', 'h2o', 'on', 'antimonene', 'opposite', 'to', 'a', 'donor', 'role', 'in', 'phosphorene', 'helps', 'to', 'suppress', 'further', 'structural', 'degradation', 'of', 'the', 'oxidized', 'antimonene', 'by', 'preventing', 'the', 'proton', 'transfer', 'between', 'water', 'molecules', 'and', 'oxygen', 'species', 'to', 'form', 'acids']]
|
[-0.06769914429890417, 0.13944496558574232, 0.039278909744651806, 0.015418539178031295, 0.04313329798068204, -0.18200299456435934, 0.12175946185395689, 0.4629097050865707, -0.18385743262479082, -0.3039480094334779, -0.005730030367292626, -0.3057012504407043, -0.11586333513538272, 0.12658246057664813, 0.03330900367734063, -0.021619015940181587, 0.03918848310612426, -0.09318985603148695, -0.10176845593631025, -0.1909751610674784, 0.2120377835969481, 0.14163745109133585, 0.2761166843018778, 0.1812465814164961, 0.0036157573416383693, -0.09782904424734981, 0.12316371778338774, -0.0638161088022373, -0.14308091549284416, 0.10968559427184395, 0.2596017950010086, -0.07035288218226608, 0.20208420954978742, -0.49781584679958935, -0.26619221453311975, 0.01478872931835687, 0.09528588834243988, 0.1650791753908498, -0.10942844877196045, -0.21834966457327423, 0.08377920015735309, -0.1376941482392241, -0.08299361657539164, -0.0430823960746436, 0.0409230976340199, -0.012243007522635668, -0.23394483744936145, 0.11315087917255764, 0.03066069885592341, 0.08436629157886669, -0.13625839571772225, -0.21554590984875255, -0.22800420130901647, 0.06236619889766545, 0.07377315350427323, 0.07007465745972814, 0.2954478550717518, -0.09491318632480335, 0.006568575652478182, 0.4260534418483629, -0.09580064725813155, -0.11679012444801629, 0.26850614444170473, -0.1429393610881601, -0.16445588709093104, 0.23278235154398513, 0.054471770093938256, 0.12071447280164727, -0.12253611883700258, 0.022467295558074155, 0.004301997542390144, 0.21336966941959437, 0.1159302572891845, 0.09559088423417922, 0.2229423148699267, 0.17305847458571763, 0.08897413906347736, 0.1252994077462379, -0.12580566298066, -0.027073938314772575, -0.10550273226007172, -0.26381006844736554, -0.14819572151400676, 0.13284034195669886, -0.05731967521751358, -0.12346728701374124, 0.31845902928794007, 0.08633724317990962, 0.1655542181142664, -0.11233205044054953, 0.24200266464891762, 0.045023874677059685, 0.10932751761182495, -0.01792009383505343, 0.2640309256625503, 0.169216832615506, 0.11955566400454541, -0.27091562914163503, 0.13924870445549933, -0.018189085294421682]
|
1,803.07825
|
Interstellar bromine abundance is consistent with cometary ices from
Rosetta
|
Cometary ices are formed during star and planet formation, and their
molecular and elemental makeup can be related to the early solar system via the
study of inter- and protostellar material. The first cometary abundance of the
halogen element bromine (Br) was recently made available by the Rosetta
mission. Its abundance in protostellar gas is thus far unconstrained, however.
We set out to place the first observational constraints on the interstellar
gas-phase abundance of bromine (Br). We further aim to compare the protostellar
Br abundance with that measured by Rosetta in the ices of comet
67P/Churyumov-Gerasimenko. Archival Herschel data of Orion KL, Sgr B2(N), and
NGC 6334I are examined for the presence of HBr and HBr$^{+}$ emission or
absorption lines. A chemical network for modelling HBr in protostellar
molecular gas is compiled to aid in the interpretation. HBr and HBr$^{+}$ were
not detected towards any of our targets. However, in the Orion KL Hot Core, our
upper limit on HBr/H$_{2}$O is a factor of ten below the ratio measured in
comet 67P. This result is consistent with the chemical network prediction that
HBr is not a dominant gas-phase Br carrier. Cometary HBr is likely
predominantly formed in icy grain mantles which lock up nearly all elemental
Br.
|
astro-ph.GA astro-ph.SR
|
cometary ices are formed during star and planet formation and their molecular and elemental makeup can be related to the early solar system via the study of inter and protostellar material the first cometary abundance of the halogen element bromine br was recently made available by the rosetta mission its abundance in protostellar gas is thus far unconstrained however we set out to place the first observational constraints on the interstellar gasphase abundance of bromine br we further aim to compare the protostellar br abundance with that measured by rosetta in the ices of comet 67pchuryumovgerasimenko archival herschel data of orion kl sgr b2n and ngc 6334i are examined for the presence of hbr and hbr emission or absorption lines a chemical network for modelling hbr in protostellar molecular gas is compiled to aid in the interpretation hbr and hbr were not detected towards any of our targets however in the orion kl hot core our upper limit on hbrh_2o is a factor of ten below the ratio measured in comet 67p this result is consistent with the chemical network prediction that hbr is not a dominant gasphase br carrier cometary hbr is likely predominantly formed in icy grain mantles which lock up nearly all elemental br
|
[['cometary', 'ices', 'are', 'formed', 'during', 'star', 'and', 'planet', 'formation', 'and', 'their', 'molecular', 'and', 'elemental', 'makeup', 'can', 'be', 'related', 'to', 'the', 'early', 'solar', 'system', 'via', 'the', 'study', 'of', 'inter', 'and', 'protostellar', 'material', 'the', 'first', 'cometary', 'abundance', 'of', 'the', 'halogen', 'element', 'bromine', 'br', 'was', 'recently', 'made', 'available', 'by', 'the', 'rosetta', 'mission', 'its', 'abundance', 'in', 'protostellar', 'gas', 'is', 'thus', 'far', 'unconstrained', 'however', 'we', 'set', 'out', 'to', 'place', 'the', 'first', 'observational', 'constraints', 'on', 'the', 'interstellar', 'gasphase', 'abundance', 'of', 'bromine', 'br', 'we', 'further', 'aim', 'to', 'compare', 'the', 'protostellar', 'br', 'abundance', 'with', 'that', 'measured', 'by', 'rosetta', 'in', 'the', 'ices', 'of', 'comet', '67pchuryumovgerasimenko', 'archival', 'herschel', 'data', 'of', 'orion', 'kl', 'sgr', 'b2n', 'and', 'ngc', '6334i', 'are', 'examined', 'for', 'the', 'presence', 'of', 'hbr', 'and', 'hbr', 'emission', 'or', 'absorption', 'lines', 'a', 'chemical', 'network', 'for', 'modelling', 'hbr', 'in', 'protostellar', 'molecular', 'gas', 'is', 'compiled', 'to', 'aid', 'in', 'the', 'interpretation', 'hbr', 'and', 'hbr', 'were', 'not', 'detected', 'towards', 'any', 'of', 'our', 'targets', 'however', 'in', 'the', 'orion', 'kl', 'hot', 'core', 'our', 'upper', 'limit', 'on', 'hbrh_2o', 'is', 'a', 'factor', 'of', 'ten', 'below', 'the', 'ratio', 'measured', 'in', 'comet', '67p', 'this', 'result', 'is', 'consistent', 'with', 'the', 'chemical', 'network', 'prediction', 'that', 'hbr', 'is', 'not', 'a', 'dominant', 'gasphase', 'br', 'carrier', 'cometary', 'hbr', 'is', 'likely', 'predominantly', 'formed', 'in', 'icy', 'grain', 'mantles', 'which', 'lock', 'up', 'nearly', 'all', 'elemental', 'br']]
|
[-0.04234554978071721, 0.12354313811395788, -0.045871937135460526, 0.0037530952984313436, -0.0102731026641265, -0.040616376382000385, 0.07287864619866014, 0.4458027054257329, -0.17721440244095346, -0.31854570905668933, 0.04556999360584175, -0.27235248535238565, -0.051243037282652, 0.09721227852261435, -0.03052462494459849, -0.008144542450838026, 0.08015295479094013, -0.10494317585326622, 0.013123419375421063, -0.2431297737164694, 0.2554613823010089, 0.11693951027305091, 0.10757698290399276, 0.059522669303210596, 0.004600346189848988, -0.19081611083978697, -0.03776681717277224, -0.06554380567965902, -0.16402234264924384, 0.09439315996810939, 0.23300807449053432, 0.14817650197299867, 0.14651255829551357, -0.42847341578114706, -0.2509976027242939, 0.04548251027076333, 0.1551056927379709, 0.011722844498100899, -0.0515516725034245, -0.28935095886993717, 0.06166359876198875, -0.1586532219735797, -0.13825158904152876, 0.06297070045901228, 0.08807209199204029, -0.0012971070443632679, -0.22640973687492927, 0.062456123110413264, -0.011306204994150339, 0.12222080152677892, -0.18046927514985583, -0.19850099839222646, -0.13888832002774207, 0.07945192400569512, -0.008422484290808692, 0.07703697514037593, 0.26802964837435017, -0.06865925405025301, 0.01802435377386661, 0.44822708532684347, -0.11055811391397406, 0.005772125762570831, 0.2560108921194485, -0.2093942467642053, -0.24961950306925307, 0.21168794727079498, 0.09966347174881732, 0.13271001540576516, -0.1828227273835032, -0.002786168171651209, -0.04330957006975032, 0.19205518788432033, 0.09101392920535889, 0.036466483179326124, 0.3019404791315873, 0.13724683474374086, 0.0017146041076539934, 0.12040016433937267, -0.2323458122464747, -0.07933144526922334, -0.15987593228973954, -0.21141599987642568, -0.14882403541835548, 0.04796615725813221, -0.10166760514332354, -0.0772741202048017, 0.2639718138843377, 0.09371449363426966, 0.19710898814379302, -0.05520575945502943, 0.32051661957814853, 0.032107301312456364, 0.07546568921771696, 0.07957294313304886, 0.30596355451225726, 0.13216908077044792, 0.10632430191278386, -0.27666691571781504, 0.22547302298808417, 0.017809946625719515]
|
1,803.07826
|
Singularity formation for Burgers equation with transverse viscosity
|
We consider Burgers equation with transverse viscosity
$$\partial_tu+u\partial_xu-\partial_{yy}u=0, \ \ (x,y)\in \mathbb R^2, \ \
u:[0,T)\times \mathbb R^2\rightarrow \mathbb R.$$ We construct and describe
precisely a family of solutions which become singular in finite time by having
their gradient becoming unbounded. To leading order, the solution is given by a
backward self-similar solution of Burgers equation along the $x$ variable,
whose scaling parameters evolve according to parabolic equations along the $y$
variable, one of them being the quadratic semi-linear heat equation. We develop
a new framework adapted to this mixed hyperbolic/parabolic blow-up problem,
revisit the construction of flat blow-up profiles for the semi-linear heat
equation, and the self-similarity in the shocks of Burgers equation.
|
math.AP
|
we consider burgers equation with transverse viscosity partial_tuupartial_xupartial_yyu0 xyin mathbb r2 u0ttimes mathbb r2rightarrow mathbb r we construct and describe precisely a family of solutions which become singular in finite time by having their gradient becoming unbounded to leading order the solution is given by a backward selfsimilar solution of burgers equation along the x variable whose scaling parameters evolve according to parabolic equations along the y variable one of them being the quadratic semilinear heat equation we develop a new framework adapted to this mixed hyperbolicparabolic blowup problem revisit the construction of flat blowup profiles for the semilinear heat equation and the selfsimilarity in the shocks of burgers equation
|
[['we', 'consider', 'burgers', 'equation', 'with', 'transverse', 'viscosity', 'partial_tuupartial_xupartial_yyu0', 'xyin', 'mathbb', 'r2', 'u0ttimes', 'mathbb', 'r2rightarrow', 'mathbb', 'r', 'we', 'construct', 'and', 'describe', 'precisely', 'a', 'family', 'of', 'solutions', 'which', 'become', 'singular', 'in', 'finite', 'time', 'by', 'having', 'their', 'gradient', 'becoming', 'unbounded', 'to', 'leading', 'order', 'the', 'solution', 'is', 'given', 'by', 'a', 'backward', 'selfsimilar', 'solution', 'of', 'burgers', 'equation', 'along', 'the', 'x', 'variable', 'whose', 'scaling', 'parameters', 'evolve', 'according', 'to', 'parabolic', 'equations', 'along', 'the', 'y', 'variable', 'one', 'of', 'them', 'being', 'the', 'quadratic', 'semilinear', 'heat', 'equation', 'we', 'develop', 'a', 'new', 'framework', 'adapted', 'to', 'this', 'mixed', 'hyperbolicparabolic', 'blowup', 'problem', 'revisit', 'the', 'construction', 'of', 'flat', 'blowup', 'profiles', 'for', 'the', 'semilinear', 'heat', 'equation', 'and', 'the', 'selfsimilarity', 'in', 'the', 'shocks', 'of', 'burgers', 'equation']]
|
[-0.18000090991457304, 0.059524596834779474, -0.07492818424685134, 0.04203192630989684, -0.15302234419828487, -0.20436982478066865, -0.03828029271055668, 0.25917387244946977, -0.36209082221439864, -0.1610277194661278, 0.11790525524540701, -0.33449880689106604, -0.06911508895077363, 0.1496212983728145, -0.021430731561310864, 0.1230633253710241, 0.00583573845560076, 0.016494911653420853, -0.07801869057584554, -0.24010026485754038, 0.3861691973310102, -0.08827830625146076, 0.21769275737891872, -0.05378993600175751, 0.1637583263002819, -0.058217378359081015, -0.02875640581596936, 0.006914740340410693, -0.23803354226940968, 0.05468292917982951, 0.2492144163428478, 0.00951352967294278, 0.29280544303495576, -0.41555401546173487, -0.2597903189725238, 0.14179238044070425, 0.1668897471735599, 0.07584040222745561, -0.02499593585660612, -0.27093337617676566, 0.06969878156734113, -0.12151857793193173, -0.2604421383433941, -0.03666569614627709, 0.08082293317204824, 0.09828543161145514, -0.2614968158563392, 0.14363353848198634, 0.09634609697214155, -0.006984139074726651, -0.1405838284710491, -0.054489580207262876, -0.07452789108976032, -0.027334035857132188, 0.056360474984911785, 0.07415324318464156, 0.019420913468046044, -0.07616161751448763, -0.03952601493370754, 0.3645892993722723, -0.11711798371699708, -0.32865091866848095, 0.11727574086506609, -0.12881319221816268, -0.09457077459363197, 0.13357139968623719, 0.18565466002716371, 0.183999153698635, -0.14251954676755876, 0.1514870009106946, -0.041459657389808585, 0.08413010293777377, 0.08555157912713993, -0.06142716283082134, 0.10072946358748057, 0.12875766188113225, 0.11505004653655407, 0.1473542870953679, -0.0002891015440885288, -0.12343795294011081, -0.35690489000882264, -0.17611033030321036, -0.09010896186508169, 0.1500601752734467, -0.15376743635661788, -0.23825190141279665, 0.36482969771518753, 0.11755696466166733, 0.18880234053358436, 0.09303446155563169, 0.20226415426953248, 0.2244970494777792, -0.033585297032173174, 0.127347330212177, 0.10591318516526371, 0.18078432247663537, 0.1606647679733147, -0.23441206913924328, 0.025328865141124913, 0.19644692742386488]
|
1,803.07827
|
A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes
|
In this paper, we describe a new Niederreiter cryptosystem based on
quasi-cyclic $\frac{m-1}{m}$ codes that is quantum-secure. This new
cryptosystem has good transmission rate compared to the one using binary Goppa
codes and uses smaller keys.
|
cs.CR cs.IT math.IT
|
in this paper we describe a new niederreiter cryptosystem based on quasicyclic fracm1m codes that is quantumsecure this new cryptosystem has good transmission rate compared to the one using binary goppa codes and uses smaller keys
|
[['in', 'this', 'paper', 'we', 'describe', 'a', 'new', 'niederreiter', 'cryptosystem', 'based', 'on', 'quasicyclic', 'fracm1m', 'codes', 'that', 'is', 'quantumsecure', 'this', 'new', 'cryptosystem', 'has', 'good', 'transmission', 'rate', 'compared', 'to', 'the', 'one', 'using', 'binary', 'goppa', 'codes', 'and', 'uses', 'smaller', 'keys']]
|
[-0.21146437799971965, -0.028553693736385968, -0.15037831964178217, 0.08887152268693575, -0.024771782155666087, -0.32764220541705275, 0.046064561378443614, 0.34068102984585696, -0.3092224556538794, -0.20100762581245768, 0.14054770725973262, -0.2396770174511605, -0.18069924150283137, 0.28026210118292105, -0.2561636179840813, 0.1379995219823387, 0.0454953101515356, -0.020336798606068542, -0.10909457507983057, -0.40503444372572833, 0.35305545789500076, 0.224247255983452, 0.27905519575708443, -0.03330534417182207, 0.06280195247381926, 0.02887270891935461, -0.023605992306127317, -0.12759871811916432, -0.17879690643268178, 0.14529356062929663, 0.22731190482025138, 0.16833069233689457, 0.19177583866338763, -0.299393393099308, -0.17010436266233833, 0.08372803624822861, 0.13930987903020448, 0.2125082212086353, -0.1740026599113157, -0.14255923637150167, 0.19727678790998956, -0.30457260330311126, 0.05158645910624829, 0.01566639627950887, -0.03865400875090725, 0.035625653431957796, -0.24484851128525204, -0.04376863561467164, 0.026811800793641143, 0.09629224388239284, 0.05539729738504522, -0.1418776742842359, 0.143061771005806, 0.06759336885362346, -0.03367726326945962, 0.08381626745944636, -0.015935282261731725, 0.025360321276821196, -0.18756101197666591, 0.39740290699733627, -0.025520740387340386, -0.1397997536502468, 0.11127417805578767, -0.00040249968878924847, -0.16393379929165044, 0.12833992474608952, 0.2715066642138279, 0.1382118985703629, -0.08399268283715679, 0.034782110168533914, -0.1710432915844851, 0.319731783380525, 0.08849598526204419, 0.11732777117544578, 0.1145442589186132, 0.13067554840947398, -0.019191411504935887, 0.18422811501659453, -0.0693687704171882, -0.10223057721224096, -0.19657426208464635, -0.1475184241361502, -0.20458198780478495, 0.012359101014832655, -0.07240338648059857, -0.14357562865027124, 0.442022202639944, 0.16831010496631885, 0.0831904123382022, 0.09482815398627685, 0.3139998500442339, -0.014766690191916294, 0.16207674404399264, 0.1989566316543561, 0.16274317206504443, 0.15800596196721825, -0.005304997308283216, -0.14942061426376718, 0.1219904975603438, 0.17641060654487875]
|
1,803.07828
|
Expeditious Generation of Knowledge Graph Embeddings
|
Knowledge Graph Embedding methods aim at representing entities and relations
in a knowledge base as points or vectors in a continuous vector space. Several
approaches using embeddings have shown promising results on tasks such as link
prediction, entity recommendation, question answering, and triplet
classification. However, only a few methods can compute low-dimensional
embeddings of very large knowledge bases without needing state-of-the-art
computational resources. In this paper, we propose KG2Vec, a simple and fast
approach to Knowledge Graph Embedding based on the skip-gram model. Instead of
using a predefined scoring function, we learn it relying on Long Short-Term
Memories. We show that our embeddings achieve results comparable with the most
scalable approaches on knowledge graph completion as well as on a new metric.
Yet, KG2Vec can embed large graphs in lesser time by processing more than 250
million triples in less than 7 hours on common hardware.
|
cs.CL cs.AI
|
knowledge graph embedding methods aim at representing entities and relations in a knowledge base as points or vectors in a continuous vector space several approaches using embeddings have shown promising results on tasks such as link prediction entity recommendation question answering and triplet classification however only a few methods can compute lowdimensional embeddings of very large knowledge bases without needing stateoftheart computational resources in this paper we propose kg2vec a simple and fast approach to knowledge graph embedding based on the skipgram model instead of using a predefined scoring function we learn it relying on long shortterm memories we show that our embeddings achieve results comparable with the most scalable approaches on knowledge graph completion as well as on a new metric yet kg2vec can embed large graphs in lesser time by processing more than 250 million triples in less than 7 hours on common hardware
|
[['knowledge', 'graph', 'embedding', 'methods', 'aim', 'at', 'representing', 'entities', 'and', 'relations', 'in', 'a', 'knowledge', 'base', 'as', 'points', 'or', 'vectors', 'in', 'a', 'continuous', 'vector', 'space', 'several', 'approaches', 'using', 'embeddings', 'have', 'shown', 'promising', 'results', 'on', 'tasks', 'such', 'as', 'link', 'prediction', 'entity', 'recommendation', 'question', 'answering', 'and', 'triplet', 'classification', 'however', 'only', 'a', 'few', 'methods', 'can', 'compute', 'lowdimensional', 'embeddings', 'of', 'very', 'large', 'knowledge', 'bases', 'without', 'needing', 'stateoftheart', 'computational', 'resources', 'in', 'this', 'paper', 'we', 'propose', 'kg2vec', 'a', 'simple', 'and', 'fast', 'approach', 'to', 'knowledge', 'graph', 'embedding', 'based', 'on', 'the', 'skipgram', 'model', 'instead', 'of', 'using', 'a', 'predefined', 'scoring', 'function', 'we', 'learn', 'it', 'relying', 'on', 'long', 'shortterm', 'memories', 'we', 'show', 'that', 'our', 'embeddings', 'achieve', 'results', 'comparable', 'with', 'the', 'most', 'scalable', 'approaches', 'on', 'knowledge', 'graph', 'completion', 'as', 'well', 'as', 'on', 'a', 'new', 'metric', 'yet', 'kg2vec', 'can', 'embed', 'large', 'graphs', 'in', 'lesser', 'time', 'by', 'processing', 'more', 'than', '250', 'million', 'triples', 'in', 'less', 'than', '7', 'hours', 'on', 'common', 'hardware']]
|
[-0.0436279032162727, 0.007032615004896393, -0.022449268526138946, 0.09197930895485722, -0.15793785967657137, -0.1594948418306659, 0.08334821816485298, 0.47082750783819294, -0.2540285886085864, -0.37392844542692827, 0.09534276621949782, -0.29333513861476807, -0.16225881016119578, 0.2125348173883847, -0.10490770992409024, 0.048235914266519506, 0.14615040315483283, 0.11489251971943304, -0.10358319742792649, -0.25766193473646126, 0.31441757902211975, 0.009499748331210058, 0.3127802739941722, 0.013430763294713365, 0.13307753748894255, -0.011465840549337573, -0.05969667374544466, -0.012266172026809526, -0.07485352493944851, 0.1801622942568631, 0.3078079600074691, 0.20363362810652083, 0.3243812038627867, -0.4272806328048723, -0.2543843202098894, 0.12170316059604779, 0.15806836217719442, 0.10279469870147295, -0.014607385347921486, -0.2839982240628969, 0.1046667358378828, -0.17519352360007664, 0.04083835007299462, -0.1850255773986444, -0.008325663013642447, -0.026390406274812348, -0.22574196466141278, -0.010924579191648971, 0.09808689706147157, 0.07315762070033492, -0.05192008209067151, -0.12652556964571382, 0.06152502634924733, 0.13185246436074116, -0.017005668572285988, 0.0934599410651976, 0.09890410737069841, -0.14081085247097588, -0.21104831492347229, 0.3919556436335875, -0.10153205090985769, -0.24657478115598983, 0.21972529952472541, -0.05086580919871469, -0.16658008201435828, 0.07503390522389156, 0.22550330655778655, 0.1543643678232911, -0.14173065165070714, 0.028959692499888154, -0.04151953276919408, 0.2186202744099622, 0.08286803816251147, 0.04216878930633862, 0.1774479522007621, 0.2575586942645411, 0.06347692205033834, 0.08239726423117746, -0.04916166351176798, -0.06162738978956542, -0.20099428721975224, -0.1059843989496585, -0.24247286698664539, 0.041258593579793036, -0.15197342368032374, -0.1422633194875339, 0.39949236152784173, 0.1756880743131559, 0.24850988838524143, 0.10402899564683644, 0.34414467406976557, -0.012157665648879224, 0.14212307718763542, 0.14695271004974428, 0.12680992751847953, 0.024322421254409064, 0.0914182100419162, -0.054652192100952054, 0.08795478855123899, 0.07813204285210101]
|
1,803.07829
|
Lacunas and local algebraicity of volume functions
|
The volume cut off by a hyperplane from a bounded body with smooth boundary
in $R^{2k}$ never is an algebraic function on the space of hyperplanes: for k=1
it is the famous lemma XXVIII from Newton's Principia. Following an analogy of
these volume functions with the solutions of hyperbolic PDE's, we study the
local version of the same problem: can such a volume function coincide with an
algebraic one at least in some domains of the space of hyperplanes,
intersecting the body? We prove some homological and geometric obstructions to
this integrability property. Based on these restrictions, we find a family of
examples of such "locally integrable" bodies in Euclidean spaces
|
math.AG
|
the volume cut off by a hyperplane from a bounded body with smooth boundary in r2k never is an algebraic function on the space of hyperplanes for k1 it is the famous lemma xxviii from newtons principia following an analogy of these volume functions with the solutions of hyperbolic pdes we study the local version of the same problem can such a volume function coincide with an algebraic one at least in some domains of the space of hyperplanes intersecting the body we prove some homological and geometric obstructions to this integrability property based on these restrictions we find a family of examples of such locally integrable bodies in euclidean spaces
|
[['the', 'volume', 'cut', 'off', 'by', 'a', 'hyperplane', 'from', 'a', 'bounded', 'body', 'with', 'smooth', 'boundary', 'in', 'r2k', 'never', 'is', 'an', 'algebraic', 'function', 'on', 'the', 'space', 'of', 'hyperplanes', 'for', 'k1', 'it', 'is', 'the', 'famous', 'lemma', 'xxviii', 'from', 'newtons', 'principia', 'following', 'an', 'analogy', 'of', 'these', 'volume', 'functions', 'with', 'the', 'solutions', 'of', 'hyperbolic', 'pdes', 'we', 'study', 'the', 'local', 'version', 'of', 'the', 'same', 'problem', 'can', 'such', 'a', 'volume', 'function', 'coincide', 'with', 'an', 'algebraic', 'one', 'at', 'least', 'in', 'some', 'domains', 'of', 'the', 'space', 'of', 'hyperplanes', 'intersecting', 'the', 'body', 'we', 'prove', 'some', 'homological', 'and', 'geometric', 'obstructions', 'to', 'this', 'integrability', 'property', 'based', 'on', 'these', 'restrictions', 'we', 'find', 'a', 'family', 'of', 'examples', 'of', 'such', 'locally', 'integrable', 'bodies', 'in', 'euclidean', 'spaces']]
|
[-0.14934268828716363, 0.045642216127079506, -0.11255405063380126, 0.06222935728749747, -0.10064160358999763, -0.08891983586992766, -0.0007449528831686523, 0.3019861242658383, -0.3294768776442554, -0.2105005600800117, 0.15340671290303706, -0.3215907846078243, -0.15676134990041588, 0.1963039620502575, -0.1645461961098418, 0.05509855285253342, 0.01851303526829626, 0.06147690901012571, -0.09747195603988797, -0.27197649669812507, 0.41717614272613546, -0.08781544550380728, 0.18662644682351398, 0.06716560746589256, 0.1539048022141697, 0.019330605910671456, 0.01729147972304139, 0.04934011851301048, -0.17082888673915453, 0.13287356150911298, 0.22793058982236428, 0.10894964250047935, 0.2437463473792918, -0.3935874581068486, -0.1598089428383622, 0.15524958411172904, 0.11664201994636306, 0.07977686829965662, -0.018775097780382714, -0.27063938618746697, 0.06402853647297299, -0.08079149580753602, -0.2176436764137769, -0.003971823214276417, 0.023484770925967274, 0.04296506917615933, -0.2043185114911925, 0.007152732633691919, 0.11295433311412732, 0.11114665561330479, -0.084237034575225, -0.09503049212759612, -0.0233780078354988, 0.047563614197880834, 0.029825186335926387, 0.07387289938701501, 0.07742134739669997, -0.07031169728174605, -0.09737681173446781, 0.3568813149572921, -0.0057544316844762985, -0.286421615238142, 0.17728378792159125, -0.1565427115765979, -0.15234417795530847, 0.12483866522634016, 0.14739781459751497, 0.15122420868106387, -0.08775763914223995, 0.16087538070991417, -0.11112443281564156, 0.09898597965444866, 0.11583531514514943, -0.00035537132439581126, 0.14963611150642875, 0.09388699829746205, 0.1452466176722098, 0.1657562355478378, 0.020301391586644558, -0.08090791863185849, -0.3704966298212205, -0.1949714582816169, -0.19009352759416173, 0.0822598307502565, -0.17220817133561428, -0.20708508927598995, 0.3570138530570779, 0.023101148623469715, 0.2116335115840172, 0.09704717810198597, 0.23139005674569457, 0.07913671629681664, 0.055911814947067213, 0.09857156698231224, 0.19899049071387412, 0.11529125634220068, 0.03113229031599051, -0.1433030673961348, -0.012376933090120286, 0.19367962489195634]
|
1,803.0783
|
End-to-End Fingerprints Liveness Detection using Convolutional Networks
with Gram module
|
This paper proposes an end-to-end CNN(Convolutional Neural Networks) model
that uses gram modules with parameters that are approximately 1.2MB in size to
detect fake fingerprints. The proposed method assumes that texture is the most
appropriate characteristic in fake fingerprint detection, and implements the
gram module to extract textures from the CNN. The proposed CNN structure uses
the fire module as the base model and uses the gram module for texture
extraction. Tensors that passed the fire module will be joined with gram
modules to create a gram matrix with the same spatial size. After 3 gram
matrices extracted from different layers are combined with the channel axis, it
becomes the basis for categorizing fake fingerprints. The experiment results
had an average detection error of 2.61% from the LivDet 2011, 2013, 2015 data,
proving that an end-to-end CNN structure with few parameters that is able to be
used in fake fingerprint detection can be designed.
|
cs.CV
|
this paper proposes an endtoend cnnconvolutional neural networks model that uses gram modules with parameters that are approximately 12mb in size to detect fake fingerprints the proposed method assumes that texture is the most appropriate characteristic in fake fingerprint detection and implements the gram module to extract textures from the cnn the proposed cnn structure uses the fire module as the base model and uses the gram module for texture extraction tensors that passed the fire module will be joined with gram modules to create a gram matrix with the same spatial size after 3 gram matrices extracted from different layers are combined with the channel axis it becomes the basis for categorizing fake fingerprints the experiment results had an average detection error of 261 from the livdet 2011 2013 2015 data proving that an endtoend cnn structure with few parameters that is able to be used in fake fingerprint detection can be designed
|
[['this', 'paper', 'proposes', 'an', 'endtoend', 'cnnconvolutional', 'neural', 'networks', 'model', 'that', 'uses', 'gram', 'modules', 'with', 'parameters', 'that', 'are', 'approximately', '12mb', 'in', 'size', 'to', 'detect', 'fake', 'fingerprints', 'the', 'proposed', 'method', 'assumes', 'that', 'texture', 'is', 'the', 'most', 'appropriate', 'characteristic', 'in', 'fake', 'fingerprint', 'detection', 'and', 'implements', 'the', 'gram', 'module', 'to', 'extract', 'textures', 'from', 'the', 'cnn', 'the', 'proposed', 'cnn', 'structure', 'uses', 'the', 'fire', 'module', 'as', 'the', 'base', 'model', 'and', 'uses', 'the', 'gram', 'module', 'for', 'texture', 'extraction', 'tensors', 'that', 'passed', 'the', 'fire', 'module', 'will', 'be', 'joined', 'with', 'gram', 'modules', 'to', 'create', 'a', 'gram', 'matrix', 'with', 'the', 'same', 'spatial', 'size', 'after', '3', 'gram', 'matrices', 'extracted', 'from', 'different', 'layers', 'are', 'combined', 'with', 'the', 'channel', 'axis', 'it', 'becomes', 'the', 'basis', 'for', 'categorizing', 'fake', 'fingerprints', 'the', 'experiment', 'results', 'had', 'an', 'average', 'detection', 'error', 'of', '261', 'from', 'the', 'livdet', '2011', '2013', '2015', 'data', 'proving', 'that', 'an', 'endtoend', 'cnn', 'structure', 'with', 'few', 'parameters', 'that', 'is', 'able', 'to', 'be', 'used', 'in', 'fake', 'fingerprint', 'detection', 'can', 'be', 'designed']]
|
[-0.05814831688588491, 0.02707182915584151, -0.054737988932459965, 0.01418124363085048, -0.0753026215718706, -0.18396873435376856, -0.05516789748646879, 0.4097022935139393, -0.28690647993775487, -0.32054229145504387, 0.11260075011409308, -0.2951044943548885, -0.21489875850091184, 0.14508470693858816, -0.07961338731076788, 0.04520116665809921, 0.10999174462859611, 0.0773466795841171, -0.05092908037838593, -0.27462835500041155, 0.2977892501565804, 0.13238844914008785, 0.32088197181549144, -0.0034736314137143636, 0.16445495713474778, 0.0013834550593267469, -0.040381219183259154, -0.060650806216632616, -0.033689284022936285, 0.12838897595845553, 0.2798410432133215, 0.18630107780507602, 0.19095094281315705, -0.41135802511369285, -0.15539484186207547, 0.10281580748048678, 0.1185573933986959, 0.11070326925103181, -0.031757500935711114, -0.3170414102367229, 0.14717854653771212, -0.1922891562244569, -0.03601511931838163, -0.08845697241543117, 6.780750270372902e-05, -0.042368283824009055, -0.31366903334703855, 0.0446891515619225, 0.02481657622044973, 0.04441697928929714, -0.04488897529808086, -0.14430084183593006, -0.010434799663284245, 0.1768501967015171, -0.006830438740210595, 0.01503821921662665, 0.1588686348366691, -0.10950056973729112, -0.09854160555413151, 0.3046987627091166, -0.059553829940900305, -0.2079908133855735, 0.15665185390370504, -0.042025021915369686, -0.07789948070726169, 0.1541179928234687, 0.1861402499946017, 0.0806320777423132, -0.1624970024434874, -0.03301983608276845, -0.07745338430372524, 0.22802475830113966, 0.0535487569016374, -0.05038048200357973, 0.2069294020728348, 0.18792746073012453, 0.025712238107670975, 0.12119189294867729, -0.18009529277998831, 0.007266122948232235, -0.24345302026341456, -0.1411897678893962, -0.19618549957579257, -0.012303133714286721, -0.0847272164082943, -0.13229440229950973, 0.48094980107023827, 0.20235384463521291, 0.25891840588027504, 0.08441975198798733, 0.27387275115215504, 0.01592800808154363, 0.1969658015600217, 0.10067346806674465, 0.19455695420114044, 0.07369035995547094, 0.09515396895167096, -0.11031945494271425, 0.0979418917619958, 0.11285378934520303]
|
1,803.07831
|
3D-printed rotating spinnerets create membranes with a twist
|
Round hollow fiber membranes are long-established in applications such as gas
separation, ultrafiltration and blood dialysis. Yet, it is well known that
geometrical topologies can introduce secondary ow patterns counteracting mass
transport limitations, stemming from diffusion resistances and fouling. We
present a new systematic method- ology to fabricate novel membrane
architectures. We use the freedom of design by 3D-printing spinnerets, having
multiple bore channels of any geometry. First, such spinnerets are stationary
to fabricate straight bore channels inside a monolithic membrane. Second, in an
even more complex design, a new mechanical system enables rotating the
spinneret. Such rotating multibore spinnerets enable (A) the preparation of
twisted channels inside a porous monolithic membrane as well as (B) a helical
twist of the outside geometry. The spun material systems comprise classical
polymer solutions as well as metal-polymer slurries resulting in solid porous
metallic monolithic membrane after thermal post-processing. It is known that
twisted spiral-type bore channel geometries are potentially superior over
straight channels with respect to mass and heat polarization phenomena, however
their fabrication was cumber- some in the past. Now, the described methodology
enables membrane fabrication to tailor the membrane geometry to the needs of
the membrane process.
|
physics.app-ph
|
round hollow fiber membranes are longestablished in applications such as gas separation ultrafiltration and blood dialysis yet it is well known that geometrical topologies can introduce secondary ow patterns counteracting mass transport limitations stemming from diffusion resistances and fouling we present a new systematic method ology to fabricate novel membrane architectures we use the freedom of design by 3dprinting spinnerets having multiple bore channels of any geometry first such spinnerets are stationary to fabricate straight bore channels inside a monolithic membrane second in an even more complex design a new mechanical system enables rotating the spinneret such rotating multibore spinnerets enable a the preparation of twisted channels inside a porous monolithic membrane as well as b a helical twist of the outside geometry the spun material systems comprise classical polymer solutions as well as metalpolymer slurries resulting in solid porous metallic monolithic membrane after thermal postprocessing it is known that twisted spiraltype bore channel geometries are potentially superior over straight channels with respect to mass and heat polarization phenomena however their fabrication was cumber some in the past now the described methodology enables membrane fabrication to tailor the membrane geometry to the needs of the membrane process
|
[['round', 'hollow', 'fiber', 'membranes', 'are', 'longestablished', 'in', 'applications', 'such', 'as', 'gas', 'separation', 'ultrafiltration', 'and', 'blood', 'dialysis', 'yet', 'it', 'is', 'well', 'known', 'that', 'geometrical', 'topologies', 'can', 'introduce', 'secondary', 'ow', 'patterns', 'counteracting', 'mass', 'transport', 'limitations', 'stemming', 'from', 'diffusion', 'resistances', 'and', 'fouling', 'we', 'present', 'a', 'new', 'systematic', 'method', 'ology', 'to', 'fabricate', 'novel', 'membrane', 'architectures', 'we', 'use', 'the', 'freedom', 'of', 'design', 'by', '3dprinting', 'spinnerets', 'having', 'multiple', 'bore', 'channels', 'of', 'any', 'geometry', 'first', 'such', 'spinnerets', 'are', 'stationary', 'to', 'fabricate', 'straight', 'bore', 'channels', 'inside', 'a', 'monolithic', 'membrane', 'second', 'in', 'an', 'even', 'more', 'complex', 'design', 'a', 'new', 'mechanical', 'system', 'enables', 'rotating', 'the', 'spinneret', 'such', 'rotating', 'multibore', 'spinnerets', 'enable', 'a', 'the', 'preparation', 'of', 'twisted', 'channels', 'inside', 'a', 'porous', 'monolithic', 'membrane', 'as', 'well', 'as', 'b', 'a', 'helical', 'twist', 'of', 'the', 'outside', 'geometry', 'the', 'spun', 'material', 'systems', 'comprise', 'classical', 'polymer', 'solutions', 'as', 'well', 'as', 'metalpolymer', 'slurries', 'resulting', 'in', 'solid', 'porous', 'metallic', 'monolithic', 'membrane', 'after', 'thermal', 'postprocessing', 'it', 'is', 'known', 'that', 'twisted', 'spiraltype', 'bore', 'channel', 'geometries', 'are', 'potentially', 'superior', 'over', 'straight', 'channels', 'with', 'respect', 'to', 'mass', 'and', 'heat', 'polarization', 'phenomena', 'however', 'their', 'fabrication', 'was', 'cumber', 'some', 'in', 'the', 'past', 'now', 'the', 'described', 'methodology', 'enables', 'membrane', 'fabrication', 'to', 'tailor', 'the', 'membrane', 'geometry', 'to', 'the', 'needs', 'of', 'the', 'membrane', 'process']]
|
[-0.120366139715621, 0.14954040662112394, -0.03501229971305479, -0.04642231042390706, -0.0831346703848491, -0.19954711346504972, -0.010862160885993104, 0.41148230395255947, -0.2686335941824393, -0.2708586564221873, 0.09192127416220804, -0.23168968107814017, -0.14631706271917583, 0.20561798573113405, -0.12102668908960484, 0.09147856919701623, 0.03618126920878123, -0.06888502861779087, -0.034503162421811465, -0.12481931128825706, 0.23175664657297043, 0.059905647042950684, 0.28279816990670487, 0.0301505234092474, 0.08993725087135457, -0.022771259985911924, 0.04813363098073751, 0.033491197063659245, -0.150727121369355, 0.06998013963994498, 0.22605271469801663, 0.02068277757632761, 0.20279857349605895, -0.4895027972423495, -0.264925302645096, 0.015810755679670434, 0.1645838416229265, 0.1295338476721484, -0.05280246663135656, -0.22530491939769723, 0.04705998056018964, -0.17453485132457736, -0.15696908169043944, -0.06128652438712426, -0.005649390742660333, 0.03290943991548071, -0.194937373077473, 0.05065744716005448, 0.045921379243596815, 0.0028713412947045307, -0.04551483525369221, -0.09093361973869972, -0.04157058561268525, 0.12019154750622618, -0.007260776489214876, -0.005421487133329113, 0.2754058410771764, -0.10898401745690559, -0.09227295513145435, 0.3589330342335579, -0.005841982138987917, -0.2150547472998882, 0.19963258540956302, -0.10226078836414486, -0.039519443401159385, 0.18320184152674837, 0.18294765048731979, 0.1154211532849914, -0.19330365432378574, 0.0010842163560879179, 0.005990320151725497, 0.15726156797027216, 0.13837945232979762, 0.021648202648458, 0.26036517006368975, 0.25853122144650953, 0.0274988992115817, 0.19153958328235418, -0.08859910282473533, -0.06889314994265218, -0.27358947003481143, -0.21167484866455197, -0.12334075142653325, 0.08656789095749935, -0.07128978779230517, -0.2399227197210376, 0.32573117331052437, 0.06221003078837664, 0.1637054682064515, -0.017106625859219675, 0.30176338540921466, -0.02789020360005685, 0.12760575577670422, 0.03905392981802997, 0.2453535023753573, 0.1934043792924151, 0.14907584977634727, -0.19035351948158888, 0.03001925742540222, -0.006193389476109774]
|
1,803.07832
|
Some intriguing aspects of multiparticle production processes
|
Multiparticle production processes provide valuable information about the
mechanism of the conversion of the initial energy of projectiles into a number
of secondaries by measuring their multiplicity distributions and their
distributions in phase space. They therefore serve as a reference point for
more involved measurements. Distributions in phase space are usually
investigated using the statistical approach, very successful in general but
failing in cases of small colliding systems, small multiplicities, and at the
edges of the allowed phase space, in which cases the underlying dynamical
effects competing with the statistical distributions take over. We discuss an
alternative approach, which applies to the whole phase space without detailed
knowledge of dynamics. It is based on a modification of the usual statistics by
generalizing it to a superstatistical form. We stress particularly the scaling
and self-similar properties of such an approach manifesting themselves as the
phenomena of the log-periodic oscillations and oscillations of temperature
caused by sound waves in hadronic matter. Concerning the multiplicity
distributions we discuss in detail the phenomenon of the oscillatory behaviour
of the modified combinants apparently observed in experimental data.
|
hep-ph nucl-th
|
multiparticle production processes provide valuable information about the mechanism of the conversion of the initial energy of projectiles into a number of secondaries by measuring their multiplicity distributions and their distributions in phase space they therefore serve as a reference point for more involved measurements distributions in phase space are usually investigated using the statistical approach very successful in general but failing in cases of small colliding systems small multiplicities and at the edges of the allowed phase space in which cases the underlying dynamical effects competing with the statistical distributions take over we discuss an alternative approach which applies to the whole phase space without detailed knowledge of dynamics it is based on a modification of the usual statistics by generalizing it to a superstatistical form we stress particularly the scaling and selfsimilar properties of such an approach manifesting themselves as the phenomena of the logperiodic oscillations and oscillations of temperature caused by sound waves in hadronic matter concerning the multiplicity distributions we discuss in detail the phenomenon of the oscillatory behaviour of the modified combinants apparently observed in experimental data
|
[['multiparticle', 'production', 'processes', 'provide', 'valuable', 'information', 'about', 'the', 'mechanism', 'of', 'the', 'conversion', 'of', 'the', 'initial', 'energy', 'of', 'projectiles', 'into', 'a', 'number', 'of', 'secondaries', 'by', 'measuring', 'their', 'multiplicity', 'distributions', 'and', 'their', 'distributions', 'in', 'phase', 'space', 'they', 'therefore', 'serve', 'as', 'a', 'reference', 'point', 'for', 'more', 'involved', 'measurements', 'distributions', 'in', 'phase', 'space', 'are', 'usually', 'investigated', 'using', 'the', 'statistical', 'approach', 'very', 'successful', 'in', 'general', 'but', 'failing', 'in', 'cases', 'of', 'small', 'colliding', 'systems', 'small', 'multiplicities', 'and', 'at', 'the', 'edges', 'of', 'the', 'allowed', 'phase', 'space', 'in', 'which', 'cases', 'the', 'underlying', 'dynamical', 'effects', 'competing', 'with', 'the', 'statistical', 'distributions', 'take', 'over', 'we', 'discuss', 'an', 'alternative', 'approach', 'which', 'applies', 'to', 'the', 'whole', 'phase', 'space', 'without', 'detailed', 'knowledge', 'of', 'dynamics', 'it', 'is', 'based', 'on', 'a', 'modification', 'of', 'the', 'usual', 'statistics', 'by', 'generalizing', 'it', 'to', 'a', 'superstatistical', 'form', 'we', 'stress', 'particularly', 'the', 'scaling', 'and', 'selfsimilar', 'properties', 'of', 'such', 'an', 'approach', 'manifesting', 'themselves', 'as', 'the', 'phenomena', 'of', 'the', 'logperiodic', 'oscillations', 'and', 'oscillations', 'of', 'temperature', 'caused', 'by', 'sound', 'waves', 'in', 'hadronic', 'matter', 'concerning', 'the', 'multiplicity', 'distributions', 'we', 'discuss', 'in', 'detail', 'the', 'phenomenon', 'of', 'the', 'oscillatory', 'behaviour', 'of', 'the', 'modified', 'combinants', 'apparently', 'observed', 'in', 'experimental', 'data']]
|
[-0.11234023099813795, 0.17367195928354803, -0.1505460259415066, 0.1244535829243762, -0.03681451241884913, -0.06432739936984605, 0.044943054930747045, 0.32312985536243233, -0.2544514950784435, -0.3196058380673384, 0.05405292282863469, -0.26636055675923703, -0.10775883960189646, 0.19504025360443988, -0.005466384728756416, 0.05410303710703994, 0.03950325729246098, 0.03140994435279236, -0.061883086700038475, -0.17052085993550514, 0.34538856872773516, 0.08451049236768145, 0.27211387419131594, 0.02686095323956029, 0.07550885628686277, 0.026903252003479053, -0.04598333016210645, 0.02047106868647481, -0.12740278512429432, 0.060413306105656775, 0.2256800922325935, 0.11180090494159671, 0.21897071209009533, -0.4242583403855071, -0.22847710098498142, 0.12462504991268801, 0.13674540225682513, 0.09809563365754681, -0.04717774870576769, -0.2705959383715558, 0.01747636970357744, -0.1588000856713484, -0.1581494546787056, -0.09536089905752586, 0.022245725961261335, 0.04718883780271306, -0.2353406634417127, 0.10350888468079515, 0.0803523687445904, 0.04949122935067862, -0.05679351979083699, -0.10790430185587176, -0.023812915774185088, 0.11452588786186835, 0.06907094035241343, -0.031730590121447015, 0.12314467351873415, -0.1469721306156326, -0.08743372555965415, 0.4017267062502739, -0.030742643905706336, -0.2013945560034839, 0.19156909546850678, -0.18970720205394612, -0.1368807952372603, 0.15242974484431465, 0.18450376995235354, 0.11109548112362173, -0.14278099945603082, 0.02967937544607404, 0.015174961306031916, 0.10999416359933732, 0.04397461050993425, 0.08318026584143248, 0.21530972050942973, 0.1863907303016346, -4.010577941988851e-05, 0.12603858659801248, -0.08424720598082826, -0.12667984597558912, -0.3256406010241135, -0.12893618279326052, -0.16388464996918709, 0.022069659466589137, -0.09293981883028819, -0.16500653630726367, 0.3973057571309874, 0.12891778683642968, 0.24710470242016427, -0.00487767192816546, 0.2772291880305652, 0.09486922742044143, 0.03679406480172234, 0.040695040578861814, 0.24351082218345255, 0.12723968244940656, 0.12581845964650512, -0.20314715475683193, 0.09641883189528976, 0.011547835035873885]
|
1,803.07833
|
Diffusing Up the Hill: Dynamics and Equipartition in Highly Unstable
Systems
|
Stochastic motion of particles in a highly unstable potential generates a
number of diverging trajectories leading to undefined statistical moments of
the particle position. This makes experiments challenging and breaks down a
standard statistical analysis of unstable mechanical processes and their
applications. A newly proposed approach takes advantage of the local
characteristics of the most probable particle motion instead of the divergent
averages. We experimentally verify its theoretical predictions for a Brownian
particle moving near an inflection in a highly unstable cubic optical
potential. The most-likely position of the particle atypically shifts against
the force despite the trajectories diverge in the opposite direction. The local
uncertainty around the most-likely position saturates even for strong diffusion
and enables well-resolved position detection. Remarkably, the measured particle
distribution quickly converges to the quasi-stationary one with the same
atypical shift for different initial particle positions. The demonstrated
experimental confirmation of the theoretical predictions approves the utility
of local characteristics for highly unstable systems which can be exploited in
thermodynamic processes to uncover energetics of unstable systems.
|
cond-mat.stat-mech
|
stochastic motion of particles in a highly unstable potential generates a number of diverging trajectories leading to undefined statistical moments of the particle position this makes experiments challenging and breaks down a standard statistical analysis of unstable mechanical processes and their applications a newly proposed approach takes advantage of the local characteristics of the most probable particle motion instead of the divergent averages we experimentally verify its theoretical predictions for a brownian particle moving near an inflection in a highly unstable cubic optical potential the mostlikely position of the particle atypically shifts against the force despite the trajectories diverge in the opposite direction the local uncertainty around the mostlikely position saturates even for strong diffusion and enables wellresolved position detection remarkably the measured particle distribution quickly converges to the quasistationary one with the same atypical shift for different initial particle positions the demonstrated experimental confirmation of the theoretical predictions approves the utility of local characteristics for highly unstable systems which can be exploited in thermodynamic processes to uncover energetics of unstable systems
|
[['stochastic', 'motion', 'of', 'particles', 'in', 'a', 'highly', 'unstable', 'potential', 'generates', 'a', 'number', 'of', 'diverging', 'trajectories', 'leading', 'to', 'undefined', 'statistical', 'moments', 'of', 'the', 'particle', 'position', 'this', 'makes', 'experiments', 'challenging', 'and', 'breaks', 'down', 'a', 'standard', 'statistical', 'analysis', 'of', 'unstable', 'mechanical', 'processes', 'and', 'their', 'applications', 'a', 'newly', 'proposed', 'approach', 'takes', 'advantage', 'of', 'the', 'local', 'characteristics', 'of', 'the', 'most', 'probable', 'particle', 'motion', 'instead', 'of', 'the', 'divergent', 'averages', 'we', 'experimentally', 'verify', 'its', 'theoretical', 'predictions', 'for', 'a', 'brownian', 'particle', 'moving', 'near', 'an', 'inflection', 'in', 'a', 'highly', 'unstable', 'cubic', 'optical', 'potential', 'the', 'mostlikely', 'position', 'of', 'the', 'particle', 'atypically', 'shifts', 'against', 'the', 'force', 'despite', 'the', 'trajectories', 'diverge', 'in', 'the', 'opposite', 'direction', 'the', 'local', 'uncertainty', 'around', 'the', 'mostlikely', 'position', 'saturates', 'even', 'for', 'strong', 'diffusion', 'and', 'enables', 'wellresolved', 'position', 'detection', 'remarkably', 'the', 'measured', 'particle', 'distribution', 'quickly', 'converges', 'to', 'the', 'quasistationary', 'one', 'with', 'the', 'same', 'atypical', 'shift', 'for', 'different', 'initial', 'particle', 'positions', 'the', 'demonstrated', 'experimental', 'confirmation', 'of', 'the', 'theoretical', 'predictions', 'approves', 'the', 'utility', 'of', 'local', 'characteristics', 'for', 'highly', 'unstable', 'systems', 'which', 'can', 'be', 'exploited', 'in', 'thermodynamic', 'processes', 'to', 'uncover', 'energetics', 'of', 'unstable', 'systems']]
|
[-0.13025144347379547, 0.1532450942655106, -0.13951431081067164, 0.08237076428892134, -0.04519800884042715, -0.13731399114882617, 0.04640354612503109, 0.3391977674436084, -0.2748891317920467, -0.2710644293381551, 0.04343812102803874, -0.2859030661720046, -0.08667586410288201, 0.1876868131789812, -0.011367832847903374, 0.09198503802445186, 0.08248368204777064, 0.05864784213562691, -0.035234731488027284, -0.1546913745425923, 0.23443726269084267, 0.09272958648791753, 0.2970341502020114, -0.011572928869078845, 0.11726403134322703, 0.020516249272690783, -0.009291136902648696, 0.03860972985235411, -0.09911659602238256, 0.09227897016992143, 0.16221760961140486, 0.04874110393507709, 0.27936626626226, -0.4045388922528472, -0.17869948115075268, 0.10468853781064756, 0.1847550343817877, 0.14023922581082146, -0.06017458352526287, -0.28597913493488936, 0.04764736487464519, -0.10608028774258009, -0.2310878594113557, -0.07839188843878896, 0.059926058903646516, 0.047165582820145026, -0.2402313849969962, 0.11824046418092451, 0.04350731075947108, 0.03058614158937924, -0.07891292883158353, -0.08708285946713024, -0.050725609638056786, 0.14472446744709255, 0.07359749246469893, -0.016345215092283174, 0.22496896251213067, -0.1573971992600195, -0.10199884300899886, 0.40641399060895794, -0.05901619825758538, -0.18579103702646788, 0.21692635156593265, -0.16272097465387264, -0.11788156157262017, 0.19922306362896897, 0.15579343443942192, 0.12989089473625806, -0.12976238029185944, 0.023926054519062406, 0.023830559222450004, 0.13976389279610715, 0.048983830150465896, 0.019580027269914226, 0.2632366890510068, 0.15872306067991981, 0.06859575268855794, 0.11763249776328827, -0.14795036319383356, -0.17762189625415864, -0.2869541308961722, -0.13168458912628542, -0.16900662908893685, 0.01657293920762577, -0.11057572140397984, -0.19291992804447058, 0.3948886685999284, 0.18776079509028254, 0.22638259508219266, 0.03525066476783629, 0.2874205579770036, 0.11575382334981547, 0.01527393116313845, 0.0568878709725754, 0.2846654915348302, 0.11062450080278849, 0.10074070938673346, -0.25634022036886794, 0.09803720790389275, 0.004990714596757709]
|
1,803.07834
|
A hybrid variational Allen-Cahn/ALE scheme for the coupled analysis of
two-phase fluid-structure interaction
|
We present a novel partitioned iterative formulation for modeling of
fluid-structure interaction in two-phase flows. The variational formulation
consists of a stable and robust integration of three blocks of differential
equations, viz., incompressible viscous fluid, a rigid or flexible structure
and two-phase indicator field. The fluid-fluid interface between the two
phases, which may have high density and viscosity ratios, is evolved by solving
the conservative phase-field Allen-Cahn equation in the arbitrary
Lagrangian-Eulerian coordinates. While the Navier-Stokes equations are solved
by a stabilized Petrov-Galerkin method, the conservative Allen-Chan phase-field
equation is discretized by the positivity preserving variational scheme. Fully
decoupled implicit solvers for the two-phase fluid and the structure are
integrated by the nonlinear iterative force correction in a staggered
partitioned manner. We assess the accuracy and stability of the new
phase-field/ALE variational formulation for two- and three-dimensional problems
involving the dynamical interaction of rigid bodies with free-surface. We
consider the decay test problems of increasing complexity, namely free
translational heave decay of a circular cylinder and free rotation of a
rectangular barge. Through numerical experiments, we show that the proposed
formulation is stable and robust for high density ratios across fluid-fluid
interface and for low structure-to-fluid mass ratio with strong added-mass
effects. Using three-dimensional unstructured meshes, we demonstrate the
second-order temporal accuracy of the coupled phase-field/ALE method. Finally,
we demonstrate the three-dimensional phase-field FSI formulation for a
practical problem of internal two-phase flow in a flexible circular pipe
subjected to vortex-induced vibrations due to external fluid flow.
|
physics.flu-dyn physics.comp-ph
|
we present a novel partitioned iterative formulation for modeling of fluidstructure interaction in twophase flows the variational formulation consists of a stable and robust integration of three blocks of differential equations viz incompressible viscous fluid a rigid or flexible structure and twophase indicator field the fluidfluid interface between the two phases which may have high density and viscosity ratios is evolved by solving the conservative phasefield allencahn equation in the arbitrary lagrangianeulerian coordinates while the navierstokes equations are solved by a stabilized petrovgalerkin method the conservative allenchan phasefield equation is discretized by the positivity preserving variational scheme fully decoupled implicit solvers for the twophase fluid and the structure are integrated by the nonlinear iterative force correction in a staggered partitioned manner we assess the accuracy and stability of the new phasefieldale variational formulation for two and threedimensional problems involving the dynamical interaction of rigid bodies with freesurface we consider the decay test problems of increasing complexity namely free translational heave decay of a circular cylinder and free rotation of a rectangular barge through numerical experiments we show that the proposed formulation is stable and robust for high density ratios across fluidfluid interface and for low structuretofluid mass ratio with strong addedmass effects using threedimensional unstructured meshes we demonstrate the secondorder temporal accuracy of the coupled phasefieldale method finally we demonstrate the threedimensional phasefield fsi formulation for a practical problem of internal twophase flow in a flexible circular pipe subjected to vortexinduced vibrations due to external fluid flow
|
[['we', 'present', 'a', 'novel', 'partitioned', 'iterative', 'formulation', 'for', 'modeling', 'of', 'fluidstructure', 'interaction', 'in', 'twophase', 'flows', 'the', 'variational', 'formulation', 'consists', 'of', 'a', 'stable', 'and', 'robust', 'integration', 'of', 'three', 'blocks', 'of', 'differential', 'equations', 'viz', 'incompressible', 'viscous', 'fluid', 'a', 'rigid', 'or', 'flexible', 'structure', 'and', 'twophase', 'indicator', 'field', 'the', 'fluidfluid', 'interface', 'between', 'the', 'two', 'phases', 'which', 'may', 'have', 'high', 'density', 'and', 'viscosity', 'ratios', 'is', 'evolved', 'by', 'solving', 'the', 'conservative', 'phasefield', 'allencahn', 'equation', 'in', 'the', 'arbitrary', 'lagrangianeulerian', 'coordinates', 'while', 'the', 'navierstokes', 'equations', 'are', 'solved', 'by', 'a', 'stabilized', 'petrovgalerkin', 'method', 'the', 'conservative', 'allenchan', 'phasefield', 'equation', 'is', 'discretized', 'by', 'the', 'positivity', 'preserving', 'variational', 'scheme', 'fully', 'decoupled', 'implicit', 'solvers', 'for', 'the', 'twophase', 'fluid', 'and', 'the', 'structure', 'are', 'integrated', 'by', 'the', 'nonlinear', 'iterative', 'force', 'correction', 'in', 'a', 'staggered', 'partitioned', 'manner', 'we', 'assess', 'the', 'accuracy', 'and', 'stability', 'of', 'the', 'new', 'phasefieldale', 'variational', 'formulation', 'for', 'two', 'and', 'threedimensional', 'problems', 'involving', 'the', 'dynamical', 'interaction', 'of', 'rigid', 'bodies', 'with', 'freesurface', 'we', 'consider', 'the', 'decay', 'test', 'problems', 'of', 'increasing', 'complexity', 'namely', 'free', 'translational', 'heave', 'decay', 'of', 'a', 'circular', 'cylinder', 'and', 'free', 'rotation', 'of', 'a', 'rectangular', 'barge', 'through', 'numerical', 'experiments', 'we', 'show', 'that', 'the', 'proposed', 'formulation', 'is', 'stable', 'and', 'robust', 'for', 'high', 'density', 'ratios', 'across', 'fluidfluid', 'interface', 'and', 'for', 'low', 'structuretofluid', 'mass', 'ratio', 'with', 'strong', 'addedmass', 'effects', 'using', 'threedimensional', 'unstructured', 'meshes', 'we', 'demonstrate', 'the', 'secondorder', 'temporal', 'accuracy', 'of', 'the', 'coupled', 'phasefieldale', 'method', 'finally', 'we', 'demonstrate', 'the', 'threedimensional', 'phasefield', 'fsi', 'formulation', 'for', 'a', 'practical', 'problem', 'of', 'internal', 'twophase', 'flow', 'in', 'a', 'flexible', 'circular', 'pipe', 'subjected', 'to', 'vortexinduced', 'vibrations', 'due', 'to', 'external', 'fluid', 'flow']]
|
[-0.15846568182371404, 0.10667430700680601, -0.08362338434734264, 0.0099575423588593, -0.05125210648919973, -0.16488291080245832, -0.0433825452729615, 0.3509388297888232, -0.29834301507487554, -0.29135615652074476, 0.08844271203054598, -0.21860996484679818, -0.10972151507186577, 0.1383612697911468, -0.03140871047900813, 0.13688719595318713, 0.0772700634051532, -0.07918108091785461, -0.10625234992749254, -0.15519005680550657, 0.2979987978574977, -0.019254337206728173, 0.29622077512259715, 0.04088240724877136, 0.17478825342400697, -0.018219424964028407, -0.013043546605181646, 0.10221743933500055, -0.15835142964243898, 0.09883781825144365, 0.21915800851882808, -0.005136543290819896, 0.26447532633549453, -0.4707491046867866, -0.2584342873643762, 0.011816101170762025, 0.14123396430195237, 0.12404306204999134, -0.07178165373265927, -0.2774417678626262, 0.06512901221915558, -0.16228410219505368, -0.14061240233296965, -0.09754676531057482, -0.018711830025113382, 0.03374682335588322, -0.29213694122441713, 0.15474959151769524, 0.035822650236954315, 0.04969478853587291, -0.12806542371592528, -0.07415652581693705, -0.03667686769591238, 0.050550010345623266, 0.01191704005286588, -0.022614376637183988, 0.11144154003549199, -0.12211375833784112, -0.04291480011713917, 0.4255858785990212, -0.07530806310462416, -0.3133224018604146, 0.2035405236399836, -0.041200083803154104, -0.07454397800328677, 0.18988739574948946, 0.22942241742716404, 0.16994227775767323, -0.141061564007728, 0.06701706369863075, -0.01838764866311946, 0.16258529942087951, 0.04401567492657053, -0.10124601855674767, 0.16029311043551428, 0.21173444475380726, 0.08233803784649114, 0.1533370832893461, -0.08154123312887811, -0.1708519822024882, -0.28874294079326135, -0.1678877464005026, -0.12389091050411372, -0.029141953071280393, -0.1377269558415345, -0.20725507925592943, 0.3349377386355762, 0.10521561694772216, 0.10549013308582851, 0.04174647623337249, 0.33759189317761745, 0.11899778952461824, -0.004404344793347788, 0.10131041586606039, 0.24401142111301055, 0.1763723117027263, 0.11314092272865767, -0.2889654577063941, 0.013597529609553485, 0.15457449582838473]
|
1,803.07835
|
Joint 3D Face Reconstruction and Dense Alignment with Position Map
Regression Network
|
We propose a straightforward method that simultaneously reconstructs the 3D
facial structure and provides dense alignment. To achieve this, we design a 2D
representation called UV position map which records the 3D shape of a complete
face in UV space, then train a simple Convolutional Neural Network to regress
it from a single 2D image. We also integrate a weight mask into the loss
function during training to improve the performance of the network. Our method
does not rely on any prior face model, and can reconstruct full facial geometry
along with semantic meaning. Meanwhile, our network is very light-weighted and
spends only 9.8ms to process an image, which is extremely faster than previous
works. Experiments on multiple challenging datasets show that our method
surpasses other state-of-the-art methods on both reconstruction and alignment
tasks by a large margin.
|
cs.CV cs.GR
|
we propose a straightforward method that simultaneously reconstructs the 3d facial structure and provides dense alignment to achieve this we design a 2d representation called uv position map which records the 3d shape of a complete face in uv space then train a simple convolutional neural network to regress it from a single 2d image we also integrate a weight mask into the loss function during training to improve the performance of the network our method does not rely on any prior face model and can reconstruct full facial geometry along with semantic meaning meanwhile our network is very lightweighted and spends only 98ms to process an image which is extremely faster than previous works experiments on multiple challenging datasets show that our method surpasses other stateoftheart methods on both reconstruction and alignment tasks by a large margin
|
[['we', 'propose', 'a', 'straightforward', 'method', 'that', 'simultaneously', 'reconstructs', 'the', '3d', 'facial', 'structure', 'and', 'provides', 'dense', 'alignment', 'to', 'achieve', 'this', 'we', 'design', 'a', '2d', 'representation', 'called', 'uv', 'position', 'map', 'which', 'records', 'the', '3d', 'shape', 'of', 'a', 'complete', 'face', 'in', 'uv', 'space', 'then', 'train', 'a', 'simple', 'convolutional', 'neural', 'network', 'to', 'regress', 'it', 'from', 'a', 'single', '2d', 'image', 'we', 'also', 'integrate', 'a', 'weight', 'mask', 'into', 'the', 'loss', 'function', 'during', 'training', 'to', 'improve', 'the', 'performance', 'of', 'the', 'network', 'our', 'method', 'does', 'not', 'rely', 'on', 'any', 'prior', 'face', 'model', 'and', 'can', 'reconstruct', 'full', 'facial', 'geometry', 'along', 'with', 'semantic', 'meaning', 'meanwhile', 'our', 'network', 'is', 'very', 'lightweighted', 'and', 'spends', 'only', '98ms', 'to', 'process', 'an', 'image', 'which', 'is', 'extremely', 'faster', 'than', 'previous', 'works', 'experiments', 'on', 'multiple', 'challenging', 'datasets', 'show', 'that', 'our', 'method', 'surpasses', 'other', 'stateoftheart', 'methods', 'on', 'both', 'reconstruction', 'and', 'alignment', 'tasks', 'by', 'a', 'large', 'margin']]
|
[-0.011681172058638865, -0.044660298176595, -0.08223130239214557, 0.03459000722027435, -0.11780072185958661, -0.16234603670024633, 0.016918158699098948, 0.49957147789915113, -0.2605698764677683, -0.3111067715366065, 0.06263643320918383, -0.2486553971866404, -0.2155661816321259, 0.19540015263245, -0.15479973743051073, 0.06328353231745588, 0.17745995720046281, 0.046320595289070676, -0.1221140047690804, -0.2665212132006095, 0.28576498084878343, 0.03608439499036457, 0.34981122750952076, 0.013715529906135188, 0.16880934959427066, 0.0011889748836112937, -0.012434956721322488, -0.0011119536775500807, -0.04690983976175019, 0.17525568616365755, 0.22621763082234747, 0.1963673618105478, 0.2595598422837219, -0.42801466660342946, -0.2599175408054279, 0.06494498794157412, 0.14451381361560664, 0.13505839987967697, -0.03591637114100294, -0.30684765488126853, 0.1052810140514923, -0.12298636565352009, 0.01278616352020389, -0.13418629505488017, -0.03527363192589179, -0.06494927555866485, -0.31752625409127927, 0.030436353861434166, 0.07398946445612033, 0.024629136567840177, -0.04350387180618344, -0.07184447735262504, -0.027266534849199175, 0.18275099889762755, -0.03976679856172613, 0.1261145908684626, 0.14066158388027528, -0.1972571835176761, -0.08439407524326477, 0.3634437455584968, -0.059389443890158475, -0.23930773156504725, 0.20672699471894843, -0.07716926623706835, -0.12738175392762696, 0.1610444563026302, 0.22625287975368163, 0.1456902712569946, -0.13058495562715647, 0.009977739795457817, -0.07940603173031968, 0.2324740711980275, 0.03588921761983176, -0.028058037739654963, 0.19133375216798898, 0.23203882866668224, 0.07413513066559813, 0.13262512425196962, -0.19878743211126948, -0.02709764270043939, -0.19986345900781793, -0.1060386135499503, -0.22640484623121518, -0.024970409246123343, -0.0988017857294822, -0.18750654782991122, 0.43827900682392457, 0.22327400061444644, 0.2755947654495818, 0.11912279241092938, 0.393697555917893, 0.009986505788465432, 0.14783593310242057, 0.07281464970514287, 0.18098829672365946, -0.014490374455731498, 0.09576328630120677, -0.16629795213977733, 0.0717128677062952, 0.08521020945746206]
|
1,803.07836
|
Convergence rates for distributed stochastic optimization over random
networks
|
We establish the O($\frac{1}{k}$) convergence rate for distributed stochastic
gradient methods that operate over strongly convex costs and random networks.
The considered class of methods is standard each node performs a weighted
average of its own and its neighbors solution estimates (consensus), and takes
a negative step with respect to a noisy version of its local functions gradient
(innovation). The underlying communication network is modeled through a
sequence of temporally independent identically distributed (i.i.d.) Laplacian
matrices connected on average, while the local gradient noises are also i.i.d.
in time, have finite second moment, and possibly unbounded support. We show
that, after a careful setting of the consensus and innovations potentials
(weights), the distributed stochastic gradient method achieves a
(order-optimal) O($\frac{1}{k}$) convergence rate in the mean square distance
from the solution. This is the first order-optimal convergence rate result on
distributed strongly convex stochastic optimization when the network is random
and/or the gradient noises have unbounded support. Simulation examples confirm
the theoretical findings.
|
math.OC
|
we establish the ofrac1k convergence rate for distributed stochastic gradient methods that operate over strongly convex costs and random networks the considered class of methods is standard each node performs a weighted average of its own and its neighbors solution estimates consensus and takes a negative step with respect to a noisy version of its local functions gradient innovation the underlying communication network is modeled through a sequence of temporally independent identically distributed iid laplacian matrices connected on average while the local gradient noises are also iid in time have finite second moment and possibly unbounded support we show that after a careful setting of the consensus and innovations potentials weights the distributed stochastic gradient method achieves a orderoptimal ofrac1k convergence rate in the mean square distance from the solution this is the first orderoptimal convergence rate result on distributed strongly convex stochastic optimization when the network is random andor the gradient noises have unbounded support simulation examples confirm the theoretical findings
|
[['we', 'establish', 'the', 'ofrac1k', 'convergence', 'rate', 'for', 'distributed', 'stochastic', 'gradient', 'methods', 'that', 'operate', 'over', 'strongly', 'convex', 'costs', 'and', 'random', 'networks', 'the', 'considered', 'class', 'of', 'methods', 'is', 'standard', 'each', 'node', 'performs', 'a', 'weighted', 'average', 'of', 'its', 'own', 'and', 'its', 'neighbors', 'solution', 'estimates', 'consensus', 'and', 'takes', 'a', 'negative', 'step', 'with', 'respect', 'to', 'a', 'noisy', 'version', 'of', 'its', 'local', 'functions', 'gradient', 'innovation', 'the', 'underlying', 'communication', 'network', 'is', 'modeled', 'through', 'a', 'sequence', 'of', 'temporally', 'independent', 'identically', 'distributed', 'iid', 'laplacian', 'matrices', 'connected', 'on', 'average', 'while', 'the', 'local', 'gradient', 'noises', 'are', 'also', 'iid', 'in', 'time', 'have', 'finite', 'second', 'moment', 'and', 'possibly', 'unbounded', 'support', 'we', 'show', 'that', 'after', 'a', 'careful', 'setting', 'of', 'the', 'consensus', 'and', 'innovations', 'potentials', 'weights', 'the', 'distributed', 'stochastic', 'gradient', 'method', 'achieves', 'a', 'orderoptimal', 'ofrac1k', 'convergence', 'rate', 'in', 'the', 'mean', 'square', 'distance', 'from', 'the', 'solution', 'this', 'is', 'the', 'first', 'orderoptimal', 'convergence', 'rate', 'result', 'on', 'distributed', 'strongly', 'convex', 'stochastic', 'optimization', 'when', 'the', 'network', 'is', 'random', 'andor', 'the', 'gradient', 'noises', 'have', 'unbounded', 'support', 'simulation', 'examples', 'confirm', 'the', 'theoretical', 'findings']]
|
[-0.1534250852771184, 0.061338681549431735, -0.06725765979722326, 0.02293199462238354, -0.042522939220990666, -0.1693228669780778, 0.08545004246134115, 0.43999722801769775, -0.3328475016341717, -0.19516507554749016, 0.15329313707353984, -0.26243606616777404, -0.15702605609247391, 0.14776838107327758, -0.11696786052593386, 0.07898651858479831, 0.09277237967708735, 0.07572118052062982, -0.04506199426638583, -0.34328066111530786, 0.25306976746112386, 0.04516751109909864, 0.2964162212310727, -0.021908482722794338, 0.13558988178268874, -0.018197598093890665, -0.048561285738545804, 0.03216349487164184, -0.05868338656252075, 0.1083620571370386, 0.19467309189178508, 0.12901478538315356, 0.4016907822432709, -0.41077637732212924, -0.210250340692446, 0.14822058221555234, 0.13412918012972236, 0.0662707410979855, -0.06656576231277238, -0.2696247076684678, 0.11695723636018365, -0.12686826678403987, -0.0888449958048439, -0.04441406973493918, -0.04056469943765321, 0.13791425333841256, -0.36029267817646565, 0.11724952006562366, 0.09062035176558075, 0.018156718658168376, -0.06881302383075824, -0.14092434256590536, 0.025399919912609974, 0.10024179066017552, 0.03206386517756331, 0.05570206564080752, 0.1601679857366109, -0.055988577216070284, -0.13744595263118822, 0.2925387931567973, -0.08820215685948453, -0.24262302741013111, 0.1516023424449003, -0.07358872099710559, -0.11833039141421056, 0.12254511657239939, 0.22999782223300433, 0.14502970852176256, -0.15406179640711254, 0.09499051204679913, -0.023732334823796043, 0.13932053308019898, -0.0054370849335819114, 0.021726879731027618, 0.09983794172975324, 0.14865183307542063, 0.22139117458869736, 0.1298040545683492, -0.03930753496343293, -0.19037783675091227, -0.28941512510272455, -0.09471360917122644, -0.24856605123653777, 0.024906284494877414, -0.21399431880288627, -0.1732073081139889, 0.3650638970810874, 0.11335341473408964, 0.1990216443646429, 0.19141065796339932, 0.31372806809290693, 0.1301649401228829, 0.007423687867107399, 0.16154319943750944, 0.17425962570295842, 0.17672018233376244, 0.1229126146742298, -0.1961719136684055, 0.15138850787821237, 0.0743149235976837]
|
1,803.07837
|
Rigidity results in generalized isothermal fluids
|
We investigate the long-time behavior of solutions to the isothermal Euler,
Korteweg or quantum Navier Stokes equations, as well as generalizations of
these equations where the convex pressure law is asymptotically linear near
vacuum. By writing the system with a suitable time-dependent scaling we prove
that the densities of global solutions display universal dispersion rate and
asymptotic profile. This result applies to weak solutions defined in an
appropriate way. In the exactly isothermal case, we establish the compactness
of bounded sets of such weak solutions, by introducing modified entropies
adapted to the new unknown functions.
|
math.AP
|
we investigate the longtime behavior of solutions to the isothermal euler korteweg or quantum navier stokes equations as well as generalizations of these equations where the convex pressure law is asymptotically linear near vacuum by writing the system with a suitable timedependent scaling we prove that the densities of global solutions display universal dispersion rate and asymptotic profile this result applies to weak solutions defined in an appropriate way in the exactly isothermal case we establish the compactness of bounded sets of such weak solutions by introducing modified entropies adapted to the new unknown functions
|
[['we', 'investigate', 'the', 'longtime', 'behavior', 'of', 'solutions', 'to', 'the', 'isothermal', 'euler', 'korteweg', 'or', 'quantum', 'navier', 'stokes', 'equations', 'as', 'well', 'as', 'generalizations', 'of', 'these', 'equations', 'where', 'the', 'convex', 'pressure', 'law', 'is', 'asymptotically', 'linear', 'near', 'vacuum', 'by', 'writing', 'the', 'system', 'with', 'a', 'suitable', 'timedependent', 'scaling', 'we', 'prove', 'that', 'the', 'densities', 'of', 'global', 'solutions', 'display', 'universal', 'dispersion', 'rate', 'and', 'asymptotic', 'profile', 'this', 'result', 'applies', 'to', 'weak', 'solutions', 'defined', 'in', 'an', 'appropriate', 'way', 'in', 'the', 'exactly', 'isothermal', 'case', 'we', 'establish', 'the', 'compactness', 'of', 'bounded', 'sets', 'of', 'such', 'weak', 'solutions', 'by', 'introducing', 'modified', 'entropies', 'adapted', 'to', 'the', 'new', 'unknown', 'functions']]
|
[-0.15565511984260458, 0.07602498605495049, -0.08825287853220576, 0.08683013661127341, -0.06166195692494512, -0.1598766860846234, -0.0074047730917013, 0.253574315380109, -0.3061814214648238, -0.24991223512854624, 0.12479652626390912, -0.257039355346933, -0.11744964203405145, 0.17804374478904433, -0.05092145573289599, 0.1618524605310277, -0.02430107163657483, 0.0038746020511577005, -0.09678690639496046, -0.19937934081413244, 0.37047512493169815, -0.022753806683038804, 0.2665355388369215, 0.007008031584126385, 0.12622591704130173, -0.025031197534285878, 0.0275090690555149, 0.07826896319655996, -0.21991186395178758, 0.031539895277666416, 0.23610704658234394, 0.06956714321859181, 0.24723236539254062, -0.42144890162897736, -0.20528311989221135, 0.09500743009051994, 0.14786102468834111, 0.09959945062444986, -0.02831755671895256, -0.2852873360419548, 0.07693099424880194, -0.1372370432964281, -0.2650180573575199, -0.10016899904922436, -0.00225169922862398, 0.1227809908040064, -0.2726567505956872, 0.14603994036289422, 0.09343743352832175, 0.02233951790748458, -0.14528307607887606, -0.04872000643762907, -0.005871803276730996, 0.058947715748983776, 0.07556609326336337, -0.03169263508415928, 0.09286078312679341, -0.14414314205611223, -0.03591245212837269, 0.3481940998156604, -0.1404253940514632, -0.27867250142766065, 0.1792984160986778, -0.14370885865860863, -0.07845441423307516, 0.07379972136726505, 0.13474180728050048, 0.17354515469058626, -0.14706281980401592, 0.12242401763245365, -0.048271088439383006, 0.12967235916539244, 0.1177925708262544, 0.0007625968342548922, 0.13785066525206754, 0.0649841694014245, 0.12031094964201514, 0.18942729494975585, -0.0027284682783494264, -0.1364177331426426, -0.33932894487914284, -0.15514441942305943, -0.15284056700275916, 0.11949809640768523, -0.140222980890662, -0.22893255023579848, 0.3334369626876555, 0.09459252276114727, 0.1622647404964817, 0.1098842317385501, 0.24542298658113731, 0.226531755500228, 0.005411888884478494, 0.11347485815027827, 0.23324767633488303, 0.14721484562186035, 0.14510312108813148, -0.2313018245083329, 0.03614911081661519, 0.162347013935122]
|
1,803.07838
|
An Experimental Study on Relative and Absolute Pose Graph Fusion for
Vehicle Localization
|
In this work, we research and evaluate multiple pose-graph fusion strategies
for vehicle localization. We focus on fusing a single absolute localization
system, i.e. automotive-grade Global Navigation Satellite System (GNSS) at 1
Hertz, with a single relative localization system, i.e. vehicle odometry at 25
Hertz. Our evaluation is based on 180 Km long vehicle trajectories that are
recorded in highway, urban and rural areas, and that are accompanied with
post-processed Real Time Kinematic GNSS as ground truth. The results exhibit a
significant reduction in the error's standard deviation by 18% but the bias in
the error is unchanged, when compared to non-fused GNSS. We show that the
underlying principle is the fact that errors in GNSS readings are highly
correlated in time. This causes a bias that cannot be compensated for by using
the relative localization information from the odometry, but it can reduce the
standard deviation of the error.
|
eess.SP
|
in this work we research and evaluate multiple posegraph fusion strategies for vehicle localization we focus on fusing a single absolute localization system ie automotivegrade global navigation satellite system gnss at 1 hertz with a single relative localization system ie vehicle odometry at 25 hertz our evaluation is based on 180 km long vehicle trajectories that are recorded in highway urban and rural areas and that are accompanied with postprocessed real time kinematic gnss as ground truth the results exhibit a significant reduction in the errors standard deviation by 18 but the bias in the error is unchanged when compared to nonfused gnss we show that the underlying principle is the fact that errors in gnss readings are highly correlated in time this causes a bias that cannot be compensated for by using the relative localization information from the odometry but it can reduce the standard deviation of the error
|
[['in', 'this', 'work', 'we', 'research', 'and', 'evaluate', 'multiple', 'posegraph', 'fusion', 'strategies', 'for', 'vehicle', 'localization', 'we', 'focus', 'on', 'fusing', 'a', 'single', 'absolute', 'localization', 'system', 'ie', 'automotivegrade', 'global', 'navigation', 'satellite', 'system', 'gnss', 'at', '1', 'hertz', 'with', 'a', 'single', 'relative', 'localization', 'system', 'ie', 'vehicle', 'odometry', 'at', '25', 'hertz', 'our', 'evaluation', 'is', 'based', 'on', '180', 'km', 'long', 'vehicle', 'trajectories', 'that', 'are', 'recorded', 'in', 'highway', 'urban', 'and', 'rural', 'areas', 'and', 'that', 'are', 'accompanied', 'with', 'postprocessed', 'real', 'time', 'kinematic', 'gnss', 'as', 'ground', 'truth', 'the', 'results', 'exhibit', 'a', 'significant', 'reduction', 'in', 'the', 'errors', 'standard', 'deviation', 'by', '18', 'but', 'the', 'bias', 'in', 'the', 'error', 'is', 'unchanged', 'when', 'compared', 'to', 'nonfused', 'gnss', 'we', 'show', 'that', 'the', 'underlying', 'principle', 'is', 'the', 'fact', 'that', 'errors', 'in', 'gnss', 'readings', 'are', 'highly', 'correlated', 'in', 'time', 'this', 'causes', 'a', 'bias', 'that', 'can', 'not', 'be', 'compensated', 'for', 'by', 'using', 'the', 'relative', 'localization', 'information', 'from', 'the', 'odometry', 'but', 'it', 'can', 'reduce', 'the', 'standard', 'deviation', 'of', 'the', 'error']]
|
[-0.11440228332215358, 0.09391900881712369, -0.04495094108376527, 0.044723260131252045, 0.004302137809486797, -0.14222691925680078, 0.03562342371610337, 0.40154543651530406, -0.2529180829425736, -0.33970966745768016, 0.14695723529205026, -0.30123347473399553, -0.13854168859879243, 0.24392719655578968, -0.1684381456642518, 0.06637682886356676, 0.13620627369581653, 0.05918235444673181, -0.07124485876317442, -0.21361744813871064, 0.2501919113893387, 0.05079487982462316, 0.2938941848783085, 0.03274887685207713, 0.13143177390811128, 0.0038090855736385458, -0.02632989196693556, 0.0528771043247262, -0.030804758153563983, 0.11891696494597717, 0.2555440668088553, 0.10632705955372361, 0.2622090775844635, -0.37653497313485235, -0.2066425169355567, 0.08721583327528515, 0.12264647815476527, 0.11725336242617176, -0.016309278002227562, -0.3925503591144295, 0.10316184124809334, -0.19099954486318282, -0.06450722888174573, -0.03454676236107245, -0.0009553143254562512, 0.02999653124669254, -0.26226614721138153, 0.0935607875155085, 0.016316723700901085, 0.1251218709282127, -0.06762059445136645, -0.07455885493518447, -0.0020144066020171313, 0.20620131377547185, 0.046542445630547685, 0.06029337780759514, 0.1812427167018138, -0.11123629863605008, -0.11157392587937764, 0.4046233654922287, -0.08256776288273626, -0.20580391408469303, 0.17682144152088053, -0.12391434556135796, -0.10462438592674748, 0.15965240566847508, 0.1847527614738417, 0.039973221806771805, -0.16801961386568873, 0.007717162447640885, -0.01256048227441591, 0.1988394168799746, 0.04918063513547082, 0.019910556330242437, 0.17151260287219647, 0.17456362166929515, 0.14967852897142003, 0.044369150094544174, -0.21044141225143329, -0.0834058775377441, -0.25885067667363637, -0.11067713311585854, -0.19371442115184345, 0.0009247304063216915, -0.0692004813909751, -0.093671721406281, 0.356348801266727, 0.23731020924054327, 0.1823622639003466, 0.09254724313598751, 0.3727289894408228, 0.09082261344492935, 0.07025774052810399, 0.07455478361635876, 0.27627036511201114, -0.01050305685916003, 0.12013147521964056, -0.198001553087289, 0.09305797253216573, 0.028692301350251942]
|
1,803.07839
|
Sharp estimates for operators with positive Bergman kernel in
Homogeneous Siegel domains of Cn
|
We obtain necessary and sufficient conditions for the $L^p$-boundedness of
the operator with positive Bergman kernel in some homogeneous Siegel domains of
Cn. The key tool used here is the Okikiolu test, which finally leads to better
result than the Schur test as it has been used so far.
|
math.CV
|
we obtain necessary and sufficient conditions for the lpboundedness of the operator with positive bergman kernel in some homogeneous siegel domains of cn the key tool used here is the okikiolu test which finally leads to better result than the schur test as it has been used so far
|
[['we', 'obtain', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'the', 'lpboundedness', 'of', 'the', 'operator', 'with', 'positive', 'bergman', 'kernel', 'in', 'some', 'homogeneous', 'siegel', 'domains', 'of', 'cn', 'the', 'key', 'tool', 'used', 'here', 'is', 'the', 'okikiolu', 'test', 'which', 'finally', 'leads', 'to', 'better', 'result', 'than', 'the', 'schur', 'test', 'as', 'it', 'has', 'been', 'used', 'so', 'far']]
|
[-0.02958318404853344, 0.00944264244516285, -0.1060099972373977, 0.11677811632398516, -0.1079992478931969, -0.13533466678036718, -0.021564286912563353, 0.36925502493977547, -0.20903001368349913, -0.23070580641529997, 0.16370580694875775, -0.18093396032381118, -0.17164934145248667, 0.23270969256302532, -0.060055266091676086, 0.151992404149199, 0.025289870494482468, 0.07560369155692812, -0.0650212457023409, -0.2957234008199706, 0.37382790761790713, 0.07299601216325347, 0.2336913892828232, 0.10653347663144219, 0.043692627541568815, -0.08312692003780786, -0.011848710244521499, -0.05703060625463116, -0.19329000004016014, 0.09710702963401469, 0.25523011272355, 0.15722701399663122, 0.2910590237196611, -0.4365922332342182, -0.13294117636853894, 0.2048066391571596, 0.14613201438772436, 0.00402130719454845, -0.005598569364876163, -0.2572177474063878, 0.07614920676058652, -0.11282169237276729, -0.1778603575230405, -0.15459937132818966, 0.016731872090271542, 0.029462262833662028, -0.3369003915589075, 0.04777179277330941, 0.1435848606028119, 0.061943600800040424, -0.08412139971113326, -0.15678590401645978, 0.004026725964278591, 0.14977569003798524, 0.01195487039334768, 0.08382428893391804, 0.043744281951186, -0.055978584274345516, -0.056905463242865335, 0.3617047315311371, -0.0898612651582546, -0.2505308234569978, 0.2187284962891848, -0.18774261804563658, -0.11297705665002672, 0.050762350594967, 0.10136309262764241, 0.16983991566741344, -0.1216767550997284, 0.10425345810505618, -0.1002346453808096, 0.0971817996124832, 0.12140217742749623, 0.03817765905084659, 0.0768646178957151, 0.12220994393550316, 0.13893065299382623, 0.19080708368339253, -0.06191108085937342, -0.01946988197314382, -0.30077164878650586, -0.21837791524903508, -0.18092848185677918, 0.07586059025583827, -0.09995470152263843, -0.1742034733143388, 0.3908225487233425, 0.14746858957888825, 0.16574911899598582, 0.028908835469783112, 0.22091128677129745, 0.13702618451527682, 0.12705816239194603, 0.05007196083778934, 0.21475467358879763, 0.20651299017006342, 0.09104008280805179, -0.15069032227620482, 0.07635932031790821, 0.12236132002340591]
|
1,803.0784
|
Approximation of the Ventcel problem, numerical results
|
Report on the numerical approximation of the Ventcel problem. The Ventcel
problem is a 3D eigenvalue problem involving a surface differential operator on
the domain boundary: the Laplace Beltrami operator. We present in the first
section the problem statement together with its finite element approximation,
the code machinery used for its resolution is also presented here. The last
section presents the obtained numerical results. These results are quite
unexpected for us. Either super-converging for $P^1$ Lagrange finite elements
or under converging for $P^2$ and $P^3$. The remaining sections 2 and 3 provide
numerical results either for the classical Laplace or for the Laplace Beltrami
operator numerical approximation. These examples being aimed to validate the
code implementation.
|
math.NA
|
report on the numerical approximation of the ventcel problem the ventcel problem is a 3d eigenvalue problem involving a surface differential operator on the domain boundary the laplace beltrami operator we present in the first section the problem statement together with its finite element approximation the code machinery used for its resolution is also presented here the last section presents the obtained numerical results these results are quite unexpected for us either superconverging for p1 lagrange finite elements or under converging for p2 and p3 the remaining sections 2 and 3 provide numerical results either for the classical laplace or for the laplace beltrami operator numerical approximation these examples being aimed to validate the code implementation
|
[['report', 'on', 'the', 'numerical', 'approximation', 'of', 'the', 'ventcel', 'problem', 'the', 'ventcel', 'problem', 'is', 'a', '3d', 'eigenvalue', 'problem', 'involving', 'a', 'surface', 'differential', 'operator', 'on', 'the', 'domain', 'boundary', 'the', 'laplace', 'beltrami', 'operator', 'we', 'present', 'in', 'the', 'first', 'section', 'the', 'problem', 'statement', 'together', 'with', 'its', 'finite', 'element', 'approximation', 'the', 'code', 'machinery', 'used', 'for', 'its', 'resolution', 'is', 'also', 'presented', 'here', 'the', 'last', 'section', 'presents', 'the', 'obtained', 'numerical', 'results', 'these', 'results', 'are', 'quite', 'unexpected', 'for', 'us', 'either', 'superconverging', 'for', 'p1', 'lagrange', 'finite', 'elements', 'or', 'under', 'converging', 'for', 'p2', 'and', 'p3', 'the', 'remaining', 'sections', '2', 'and', '3', 'provide', 'numerical', 'results', 'either', 'for', 'the', 'classical', 'laplace', 'or', 'for', 'the', 'laplace', 'beltrami', 'operator', 'numerical', 'approximation', 'these', 'examples', 'being', 'aimed', 'to', 'validate', 'the', 'code', 'implementation']]
|
[-0.09635635411731251, 2.446503823866015e-05, -0.07830255663265352, 0.0776793306308758, -0.08413399438090298, -0.13051705251893272, 0.007538062299642226, 0.3563017054744389, -0.28704873572873035, -0.2442962826675047, 0.1801918208072691, -0.2917131329684154, -0.11750127680032797, 0.23561826695323637, -0.02903333549266276, 0.1350665811985812, 0.10447274344446866, 0.03982579006007417, -0.09013890164863804, -0.23215757349263066, 0.36172945765049563, 0.012570238121501778, 0.18270586972003397, 0.09260283517600644, 0.07755235424467727, -0.025121724451689618, -0.04708412405882922, -0.025088915467748177, -0.15580660669214053, 0.12771597779963328, 0.2491826644734196, 0.07513689851064397, 0.24529695348895114, -0.44838809798593104, -0.16718110268854577, 0.05686042704821929, 0.14213740210575254, 0.07726114940951052, -0.09391755995482369, -0.25352370997323936, 0.12889031792039293, -0.1227681809509902, -0.17567042216010717, -0.0791013373547922, -0.014940002447237139, -0.015505208313951026, -0.29740075051946485, 0.06381280555202545, 0.07491256970628772, 0.07560582905197921, -0.10988644665390578, -0.1648136465607778, 0.035828021330677945, 0.08352658786284535, 0.024312043781189816, -0.00013688974406408228, 0.03956590240983211, -0.07075030049309135, -0.10270412326790393, 0.3819859481052212, -0.02233085519755664, -0.29650146676450156, 0.13098430970440741, -0.13808810410454223, -0.0954386977924277, 0.12982543717421915, 0.14154738976579645, 0.17786211639075825, -0.08428142435200836, 0.13898312767218474, -0.04620504935130315, 0.11741601378636678, 0.06842119725745009, -0.08514775974756998, 0.08083181712452485, 0.11981652872231992, 0.09532173308392015, 0.11644103227780483, -0.0829238172357335, -0.10330580147388188, -0.37015608396867045, -0.16485863535300546, -0.1552334902646101, 0.03154348409532205, -0.0968489664563727, -0.18012634690689003, 0.37783396725907276, 0.10055290588187864, 0.14923959113657476, 0.08771098039072493, 0.31248321818268815, 0.1695592914465005, -0.012356638811204744, 0.06115783913587423, 0.17800149030011633, 0.16665979908050402, 0.10145163200390728, -0.22834926021649785, 0.011595646101657463, 0.16934420423501212]
|
1,803.07841
|
Asymptotic expansions for the incomplete gamma function in the
transition regions
|
We construct asymptotic expansions for the normalised incomplete gamma
function $Q(a,z)=\Gamma(a,z)/\Gamma(a)$ that are valid in the transition
regions, including the case $z\approx a$, and have simple polynomial
coefficients. For Bessel functions, these type of expansions are well known,
but for the normalised incomplete gamma function they were missing from the
literature. A detailed historical overview is included. We also derive an
asymptotic expansion for the corresponding inverse problem, which has
importance in probability theory and mathematical statistics. The coefficients
in this expansion are again simple polynomials, and therefore its
implementation is straightforward. As a byproduct, we give the first complete
asymptotic expansion as $a\to-\infty$ of the unique negative zero of the
regularised incomplete gamma function $\gamma^*(a,x)$.
|
math.CA
|
we construct asymptotic expansions for the normalised incomplete gamma function qazgammaazgammaa that are valid in the transition regions including the case zapprox a and have simple polynomial coefficients for bessel functions these type of expansions are well known but for the normalised incomplete gamma function they were missing from the literature a detailed historical overview is included we also derive an asymptotic expansion for the corresponding inverse problem which has importance in probability theory and mathematical statistics the coefficients in this expansion are again simple polynomials and therefore its implementation is straightforward as a byproduct we give the first complete asymptotic expansion as atoinfty of the unique negative zero of the regularised incomplete gamma function gammaax
|
[['we', 'construct', 'asymptotic', 'expansions', 'for', 'the', 'normalised', 'incomplete', 'gamma', 'function', 'qazgammaazgammaa', 'that', 'are', 'valid', 'in', 'the', 'transition', 'regions', 'including', 'the', 'case', 'zapprox', 'a', 'and', 'have', 'simple', 'polynomial', 'coefficients', 'for', 'bessel', 'functions', 'these', 'type', 'of', 'expansions', 'are', 'well', 'known', 'but', 'for', 'the', 'normalised', 'incomplete', 'gamma', 'function', 'they', 'were', 'missing', 'from', 'the', 'literature', 'a', 'detailed', 'historical', 'overview', 'is', 'included', 'we', 'also', 'derive', 'an', 'asymptotic', 'expansion', 'for', 'the', 'corresponding', 'inverse', 'problem', 'which', 'has', 'importance', 'in', 'probability', 'theory', 'and', 'mathematical', 'statistics', 'the', 'coefficients', 'in', 'this', 'expansion', 'are', 'again', 'simple', 'polynomials', 'and', 'therefore', 'its', 'implementation', 'is', 'straightforward', 'as', 'a', 'byproduct', 'we', 'give', 'the', 'first', 'complete', 'asymptotic', 'expansion', 'as', 'atoinfty', 'of', 'the', 'unique', 'negative', 'zero', 'of', 'the', 'regularised', 'incomplete', 'gamma', 'function', 'gammaax']]
|
[-0.07744183032487503, 0.07134301448253641, -0.1291160348214601, 0.1371602998207029, -0.10535877449192892, -0.06403855814827247, 0.032788634560634626, 0.3593321134123886, -0.2676326557319905, -0.21317553134193937, 0.13928999034984021, -0.2800697740453312, -0.17000252899730153, 0.19842379081283548, -0.012395150984000219, 0.04638162759294031, 0.030663148696093184, 0.07536380782135223, -0.09653194567593011, -0.23114400720652684, 0.27794880190202476, 0.061553070975238815, 0.22289824683684856, 0.03382083303866941, 0.08790430004234638, 0.007121579799180229, -0.09339709943895669, -0.014587107154320142, -0.1844274643293542, 0.07490183458063066, 0.2519761870733642, 0.10964384829429419, 0.24520047598828873, -0.36594053174842867, -0.15140082328090151, 0.11174696197696521, 0.17423560370266306, 0.08803069964357603, -0.03684980558688965, -0.19764773958370807, 0.06898462457843778, -0.1908695578836558, -0.18551818717663227, -0.1005485888831971, 0.04371453768557362, 0.05446115331397506, -0.3108516159638959, 0.1544207323793416, 0.04909183257851717, 0.06732782658129285, -0.022341676748749848, -0.18625848981747894, 0.05136002021179976, 0.14576417129699207, 0.03904056108327942, -0.008212402389433823, 0.04845543591644648, -0.12585498571289672, -0.07129862237509274, 0.32523493831487077, -0.0580400353738744, -0.21913622512498446, 0.14127392396984392, -0.17884694930296718, -0.14483105109007866, 0.12468554008458006, 0.13737164521099707, 0.14300799270552633, -0.14034177748927554, 0.13692741133446248, -0.039504233845754674, 0.07003603842550594, 0.09154668724442129, 0.020898981718346477, 0.16313630885755023, 0.0607321639300177, 0.02138057881516911, 0.17842799033397777, -0.02058417234455415, -0.07806377813399754, -0.3990487185748, -0.1335918738449548, -0.18409704158425724, 0.07034951099603061, -0.1376947572883964, -0.24865649325217595, 0.3580624468853338, 0.06351165044766835, 0.2167767387275633, 0.09331212539875292, 0.2665045143619768, 0.20917543258901947, -0.006851060287373369, 0.03971466584245495, 0.20884092438051052, 0.15266544043021113, 0.07179589389839716, -0.14136545680945314, 0.08722764760533576, 0.11457755724621708]
|
1,803.07842
|
Optimal Dynamic Contract for Spectrum Reservation in Mission-Critical
UNB-IoT Systems
|
Spectrum reservation is emerging as one of the potential solutions to cater
for the communication needs of massive number of wireless Internet of Things
(IoT) devices with reliability constraints particularly in mission-critical
scenarios. In most mission-critical systems, the true utility of a reservation
may not be completely known ahead of time as the unforseen events might not be
completely predictable. In this paper, we present a dynamic contract approach
where an advance payment is made at the time of reservation based on partial
information about spectrum reservation utility. Once the complete information
is obtained, a rebate on the payment is made if the reservation is released. In
this paper, we present a contract theoretic approach to design an incentivized
mechanism that coerces the applications to reveal their true application type
resulting in greater profitability of the IoT network operator. The operator
offers a menu of contracts with advanced payments and rebate to the IoT
applications without having knowledge about the types of applications. The
decision of the applications in selecting a contract leads to a revelation of
their true type to the operator which allows it to generate higher profits than
a traditional spectrum auction mechanism. Under some assumptions on
distribution of the utility of the applications, closed form solutions for the
optimal dynamic spectrum reservation contract are provided and the sensitivity
against system parameters is analyzed.
|
cs.NI cs.GT
|
spectrum reservation is emerging as one of the potential solutions to cater for the communication needs of massive number of wireless internet of things iot devices with reliability constraints particularly in missioncritical scenarios in most missioncritical systems the true utility of a reservation may not be completely known ahead of time as the unforseen events might not be completely predictable in this paper we present a dynamic contract approach where an advance payment is made at the time of reservation based on partial information about spectrum reservation utility once the complete information is obtained a rebate on the payment is made if the reservation is released in this paper we present a contract theoretic approach to design an incentivized mechanism that coerces the applications to reveal their true application type resulting in greater profitability of the iot network operator the operator offers a menu of contracts with advanced payments and rebate to the iot applications without having knowledge about the types of applications the decision of the applications in selecting a contract leads to a revelation of their true type to the operator which allows it to generate higher profits than a traditional spectrum auction mechanism under some assumptions on distribution of the utility of the applications closed form solutions for the optimal dynamic spectrum reservation contract are provided and the sensitivity against system parameters is analyzed
|
[['spectrum', 'reservation', 'is', 'emerging', 'as', 'one', 'of', 'the', 'potential', 'solutions', 'to', 'cater', 'for', 'the', 'communication', 'needs', 'of', 'massive', 'number', 'of', 'wireless', 'internet', 'of', 'things', 'iot', 'devices', 'with', 'reliability', 'constraints', 'particularly', 'in', 'missioncritical', 'scenarios', 'in', 'most', 'missioncritical', 'systems', 'the', 'true', 'utility', 'of', 'a', 'reservation', 'may', 'not', 'be', 'completely', 'known', 'ahead', 'of', 'time', 'as', 'the', 'unforseen', 'events', 'might', 'not', 'be', 'completely', 'predictable', 'in', 'this', 'paper', 'we', 'present', 'a', 'dynamic', 'contract', 'approach', 'where', 'an', 'advance', 'payment', 'is', 'made', 'at', 'the', 'time', 'of', 'reservation', 'based', 'on', 'partial', 'information', 'about', 'spectrum', 'reservation', 'utility', 'once', 'the', 'complete', 'information', 'is', 'obtained', 'a', 'rebate', 'on', 'the', 'payment', 'is', 'made', 'if', 'the', 'reservation', 'is', 'released', 'in', 'this', 'paper', 'we', 'present', 'a', 'contract', 'theoretic', 'approach', 'to', 'design', 'an', 'incentivized', 'mechanism', 'that', 'coerces', 'the', 'applications', 'to', 'reveal', 'their', 'true', 'application', 'type', 'resulting', 'in', 'greater', 'profitability', 'of', 'the', 'iot', 'network', 'operator', 'the', 'operator', 'offers', 'a', 'menu', 'of', 'contracts', 'with', 'advanced', 'payments', 'and', 'rebate', 'to', 'the', 'iot', 'applications', 'without', 'having', 'knowledge', 'about', 'the', 'types', 'of', 'applications', 'the', 'decision', 'of', 'the', 'applications', 'in', 'selecting', 'a', 'contract', 'leads', 'to', 'a', 'revelation', 'of', 'their', 'true', 'type', 'to', 'the', 'operator', 'which', 'allows', 'it', 'to', 'generate', 'higher', 'profits', 'than', 'a', 'traditional', 'spectrum', 'auction', 'mechanism', 'under', 'some', 'assumptions', 'on', 'distribution', 'of', 'the', 'utility', 'of', 'the', 'applications', 'closed', 'form', 'solutions', 'for', 'the', 'optimal', 'dynamic', 'spectrum', 'reservation', 'contract', 'are', 'provided', 'and', 'the', 'sensitivity', 'against', 'system', 'parameters', 'is', 'analyzed']]
|
[-0.16965637312758927, 0.017566570118382484, -0.0686538923831271, 0.05468206810211098, -0.1393694800964766, -0.1568551354873351, 0.10851086815152448, 0.37333548442349823, -0.2823392256898477, -0.27004199063544887, 0.1680372921013507, -0.2848899479420668, -0.13562100069055802, 0.19513897314367176, -0.11636872677386857, 0.02967529110907934, 0.03436687673464631, 0.07665276647615143, -0.00910942005414089, -0.2687479049529373, 0.32083164071377024, 0.06834896769228961, 0.307361574794293, 0.07952116994830341, 0.04911124349842545, 0.013485625837026944, 0.003501656981152257, -0.027626293913937186, -0.09161137195529302, 0.15098673378892802, 0.3019235998285434, 0.21314393335313328, 0.3497170247958095, -0.43844258873046493, -0.19333058115636462, 0.11707318058116402, 0.10254547856378857, 0.056600982997677234, -0.06305838514494788, -0.25034611839042065, 0.10956496375280593, -0.23978003628945824, -0.13652235033940102, -0.03792120777132064, -0.0035892172741174436, 0.011257233039428795, -0.30646829937260583, -0.01332118557684025, 0.005605040023735179, -0.007292656973619752, -0.08758346363729008, -0.0648814295280093, -0.02084884648662602, 0.15286399214425933, 0.05547980290513469, -0.043109730412231734, 0.14447851415050714, -0.15454845530281483, -0.1424383904624911, 0.412787685835414, -0.004501459851672787, -0.1812673150418154, 0.13545228849628752, -0.06768965276495639, -0.12712919192095307, 0.10186838651345714, 0.1930515116269368, 0.10047742525845897, -0.19240486745349242, 0.047878917872327245, -0.012145555057123895, 0.17505010986077038, 0.049845530465347815, 0.09619268532924452, 0.1863443972901872, 0.19870725069666847, 0.1361956845903318, 0.10527516076328963, -0.001002893201588337, -0.12578654259090447, -0.26350292137984005, -0.1643378489501036, -0.1697039089785142, 0.06452229219637011, -0.08175808607881667, -0.14734386331053032, 0.3853192477095216, 0.1870254275470045, 0.11871121122218702, 0.06582547526033226, 0.35166926963443534, 0.11317852689137904, 0.08893722063443307, 0.1003524780679609, 0.18912627488348555, 0.002507365624613174, 0.18808567226097184, -0.14455755261523806, 0.14923730208682068, -0.009504498085130153]
|
1,803.07843
|
Pricing Credit Default Swap Subject to Counterparty Risk and
Collateralization
|
This article presents a new model for valuing a credit default swap (CDS)
contract that is affected by multiple credit risks of the buyer, seller and
reference entity. We show that default dependency has a significant impact on
asset pricing. In fact, correlated default risk is one of the most pervasive
threats in financial markets. We also show that a fully collateralized CDS is
not equivalent to a risk-free one. In other words, full collateralization
cannot eliminate counterparty risk completely in the CDS market.
|
q-fin.CP q-fin.PR q-fin.RM
|
this article presents a new model for valuing a credit default swap cds contract that is affected by multiple credit risks of the buyer seller and reference entity we show that default dependency has a significant impact on asset pricing in fact correlated default risk is one of the most pervasive threats in financial markets we also show that a fully collateralized cds is not equivalent to a riskfree one in other words full collateralization cannot eliminate counterparty risk completely in the cds market
|
[['this', 'article', 'presents', 'a', 'new', 'model', 'for', 'valuing', 'a', 'credit', 'default', 'swap', 'cds', 'contract', 'that', 'is', 'affected', 'by', 'multiple', 'credit', 'risks', 'of', 'the', 'buyer', 'seller', 'and', 'reference', 'entity', 'we', 'show', 'that', 'default', 'dependency', 'has', 'a', 'significant', 'impact', 'on', 'asset', 'pricing', 'in', 'fact', 'correlated', 'default', 'risk', 'is', 'one', 'of', 'the', 'most', 'pervasive', 'threats', 'in', 'financial', 'markets', 'we', 'also', 'show', 'that', 'a', 'fully', 'collateralized', 'cds', 'is', 'not', 'equivalent', 'to', 'a', 'riskfree', 'one', 'in', 'other', 'words', 'full', 'collateralization', 'can', 'not', 'eliminate', 'counterparty', 'risk', 'completely', 'in', 'the', 'cds', 'market']]
|
[-0.0885888105367913, 0.00048337976503021575, -0.06869621176327415, 0.19541227583335163, -0.1390020217089092, -0.19431581647847504, 0.15284797282725135, 0.48988002573742584, -0.2859390705563676, -0.18247808196636683, 0.1606458124704659, -0.3348191295476521, -0.12229917772552547, 0.14854223339215797, -0.23951383245122784, -0.03769951916217585, 0.05807230539400788, -0.00018089242717799018, 0.10869645550573136, -0.3039201367427321, 0.2948005389093476, 0.055008131419034566, 0.3031291411641766, 0.08524446107228012, 0.08554064370143939, 0.00047322909950333486, -0.03409973832176012, 0.044083696117569855, -0.09704672983044635, 0.14478301010368502, 0.33806733887861756, 0.16131386996301658, 0.4849131173947278, -0.44714337129364995, -0.14423566752058617, 0.1325815791154609, -0.0019202817888820873, 0.05038344078861615, 0.019988476357641904, -0.2509147826253491, -0.029638687838964603, -0.3755070891669568, -0.048164604428936456, -0.031075769881991778, 0.004848438906757271, -0.005440672659589087, -0.30996201546479235, 0.023251844177994987, 0.007261606733150342, 0.022553874239982927, -0.03792320217060692, -0.09999868618872236, -0.08334444412304198, 0.12527981157798102, 0.1326139988418778, -0.08200815716100966, 0.16745168305933475, -0.09743317624225337, -0.2228308803648414, 0.3604527343502816, -0.07492423885885408, -0.1698929685373407, 0.02866579746717916, -0.12888594610780915, -0.17280039290678414, 0.11233566323404803, 0.1293374942834763, -0.010003057155100739, -0.2427634505335899, 0.03491079542539356, -0.06639969688566293, 0.20606925121563321, 0.0813442921375527, -0.020629274439724052, 0.16714316812645205, 0.1519226441926816, 0.14934510985553703, 0.11565080841195167, -0.008470217601450928, -0.18482929221217465, -0.25837638225639237, -0.17608718842898002, -0.0990638320279472, 0.0231851104157292, -0.13213036808661213, -0.2512219324762769, 0.36717178768971387, 0.20202263391521924, 0.0737693750682999, 0.06036259024677908, 0.31792676365550826, 0.10183746174306554, 0.04853943218203152, 0.08946231564178186, 0.14311036987997153, -0.14289404841632966, 0.10394954372964361, -0.12467158871757633, 0.32238243592574317, -0.0522104471538435]
|
1,803.07844
|
Distributed Zeroth Order Optimization Over Random Networks: A
Kiefer-Wolfowitz Stochastic Approximation Approach
|
We study a standard distributed optimization framework where $N$ networked
nodes collaboratively minimize the sum of their local convex costs. The main
body of existing work considers the described problem when the underling
network is either static or deterministically varying, and the distributed
optimization algorithm is of first or second order, i.e., it involves the local
costs' gradients and possibly the local Hessians. In this paper, we consider
the currently understudied but highly relevant scenarios when: 1) only noisy
function values' estimates are available (no gradients nor Hessians can be
evaluated); and 2) the underlying network is randomly varying (according to an
independent, identically distributed process). For the described random
networks-zeroth order optimization setting, we develop a distributed stochastic
approximation method of the Kiefer-Wolfowitz type. Furthermore, under standard
smoothness and strong convexity assumptions on the local costs, we establish
the $O(1/k^{1/2})$ mean square convergence rate for the method -- the rate that
matches that of the method's centralized counterpart under equivalent
conditions.
|
math.OC
|
we study a standard distributed optimization framework where n networked nodes collaboratively minimize the sum of their local convex costs the main body of existing work considers the described problem when the underling network is either static or deterministically varying and the distributed optimization algorithm is of first or second order ie it involves the local costs gradients and possibly the local hessians in this paper we consider the currently understudied but highly relevant scenarios when 1 only noisy function values estimates are available no gradients nor hessians can be evaluated and 2 the underlying network is randomly varying according to an independent identically distributed process for the described random networkszeroth order optimization setting we develop a distributed stochastic approximation method of the kieferwolfowitz type furthermore under standard smoothness and strong convexity assumptions on the local costs we establish the o1k12 mean square convergence rate for the method the rate that matches that of the methods centralized counterpart under equivalent conditions
|
[['we', 'study', 'a', 'standard', 'distributed', 'optimization', 'framework', 'where', 'n', 'networked', 'nodes', 'collaboratively', 'minimize', 'the', 'sum', 'of', 'their', 'local', 'convex', 'costs', 'the', 'main', 'body', 'of', 'existing', 'work', 'considers', 'the', 'described', 'problem', 'when', 'the', 'underling', 'network', 'is', 'either', 'static', 'or', 'deterministically', 'varying', 'and', 'the', 'distributed', 'optimization', 'algorithm', 'is', 'of', 'first', 'or', 'second', 'order', 'ie', 'it', 'involves', 'the', 'local', 'costs', 'gradients', 'and', 'possibly', 'the', 'local', 'hessians', 'in', 'this', 'paper', 'we', 'consider', 'the', 'currently', 'understudied', 'but', 'highly', 'relevant', 'scenarios', 'when', '1', 'only', 'noisy', 'function', 'values', 'estimates', 'are', 'available', 'no', 'gradients', 'nor', 'hessians', 'can', 'be', 'evaluated', 'and', '2', 'the', 'underlying', 'network', 'is', 'randomly', 'varying', 'according', 'to', 'an', 'independent', 'identically', 'distributed', 'process', 'for', 'the', 'described', 'random', 'networkszeroth', 'order', 'optimization', 'setting', 'we', 'develop', 'a', 'distributed', 'stochastic', 'approximation', 'method', 'of', 'the', 'kieferwolfowitz', 'type', 'furthermore', 'under', 'standard', 'smoothness', 'and', 'strong', 'convexity', 'assumptions', 'on', 'the', 'local', 'costs', 'we', 'establish', 'the', 'o1k12', 'mean', 'square', 'convergence', 'rate', 'for', 'the', 'method', 'the', 'rate', 'that', 'matches', 'that', 'of', 'the', 'methods', 'centralized', 'counterpart', 'under', 'equivalent', 'conditions']]
|
[-0.1338648483400239, 0.04078711199498393, -0.031795824889632514, 0.05731213997224935, -0.050093705087911874, -0.1566220870118518, 0.05631707201099738, 0.4025597376163182, -0.3313886303331633, -0.276096750642378, 0.1448886954077701, -0.21785257814112324, -0.14853346991241448, 0.13147937393829273, -0.1103276402371754, 0.07489519908889886, 0.03445129932648262, 0.04690335941670826, -0.060409380272382275, -0.31224897214059233, 0.31220644082487475, 0.032339846857372415, 0.29112806868206403, -0.01741750163184303, 0.1042969517714385, 0.03688184088740334, -0.03507074166847826, 0.043985315372626684, -0.09494676594023883, 0.13604382704723766, 0.21185001831958597, 0.13826389216744514, 0.34699313077232186, -0.44414709555863774, -0.1766750293508547, 0.17251066169730803, 0.1137201635168101, 0.06779631872737557, -0.004184144048998425, -0.23697878987053936, 0.12240152271851054, -0.12214405534777252, -0.08920772551594056, -0.05099673256711484, -0.04553614910574829, 0.0760697393704487, -0.3469663625173036, 0.1023432089750942, 0.06189749311398035, 0.030247896458695894, -0.08513044725675956, -0.12169076014257404, 0.04535942683992146, 0.11185707387246438, 0.047745547249126864, 0.029542017711982504, 0.16585454730457574, -0.0934434862142581, -0.10753110334066288, 0.36760959056727355, -0.041191105123129, -0.24493099351372546, 0.17467568632297265, -0.05883705753938488, -0.11881387280885997, 0.09947991979443147, 0.21207350328763794, 0.16952519673039937, -0.1879199688484286, 0.11360737504651726, -0.021508296368842793, 0.17125141153217488, 0.01694392172455694, 0.007020142854121074, 0.1303588321370969, 0.1289083105394816, 0.17814455261606277, 0.13172210574826612, -0.04308326427426494, -0.1509080189250925, -0.30815733266326617, -0.10996810862290785, -0.2263103428314317, 0.0043674462881970145, -0.13119261744600552, -0.16603845719002047, 0.3561155710972658, 0.12256339105408427, 0.1737232953145274, 0.12121116965291612, 0.3414856257889443, 0.13354373286381574, 0.020476232375071016, 0.1532720733264098, 0.19272085032191527, 0.08194472731688535, 0.08982890401234699, -0.18589464323715973, 0.13913525584440842, 0.040676888763764]
|
1,803.07845
|
Stationary phase methods and the splitting of separatrices
|
Using stationary phase methods, we provide an explicit formula for the
Melnikov function of the one and a half degrees of freedom system given by a
Hamiltonian system subject to a rapidly oscillating perturbation. Remarkably,
the Melnikov function turns out to be computable without an explicit knowledge
of the separatrix and in the case of non-analytic systems. This is related to a
priori stable systems coupled with low regularity perturbations. It also
applies to perturbations controlled by wave-type equations, so in particular we
also illustrate this result with the motion of charged particles in a rapidly
oscillating electromagnetic field. Quasiperiodic perturbations are discussed
too.
|
math.DS
|
using stationary phase methods we provide an explicit formula for the melnikov function of the one and a half degrees of freedom system given by a hamiltonian system subject to a rapidly oscillating perturbation remarkably the melnikov function turns out to be computable without an explicit knowledge of the separatrix and in the case of nonanalytic systems this is related to a priori stable systems coupled with low regularity perturbations it also applies to perturbations controlled by wavetype equations so in particular we also illustrate this result with the motion of charged particles in a rapidly oscillating electromagnetic field quasiperiodic perturbations are discussed too
|
[['using', 'stationary', 'phase', 'methods', 'we', 'provide', 'an', 'explicit', 'formula', 'for', 'the', 'melnikov', 'function', 'of', 'the', 'one', 'and', 'a', 'half', 'degrees', 'of', 'freedom', 'system', 'given', 'by', 'a', 'hamiltonian', 'system', 'subject', 'to', 'a', 'rapidly', 'oscillating', 'perturbation', 'remarkably', 'the', 'melnikov', 'function', 'turns', 'out', 'to', 'be', 'computable', 'without', 'an', 'explicit', 'knowledge', 'of', 'the', 'separatrix', 'and', 'in', 'the', 'case', 'of', 'nonanalytic', 'systems', 'this', 'is', 'related', 'to', 'a', 'priori', 'stable', 'systems', 'coupled', 'with', 'low', 'regularity', 'perturbations', 'it', 'also', 'applies', 'to', 'perturbations', 'controlled', 'by', 'wavetype', 'equations', 'so', 'in', 'particular', 'we', 'also', 'illustrate', 'this', 'result', 'with', 'the', 'motion', 'of', 'charged', 'particles', 'in', 'a', 'rapidly', 'oscillating', 'electromagnetic', 'field', 'quasiperiodic', 'perturbations', 'are', 'discussed', 'too']]
|
[-0.19084801438685434, 0.13186741361753845, -0.10226619927785717, 0.0768548181636456, -0.0627679471038461, -0.14578418349041244, 0.015061641320174273, 0.2905570566922856, -0.2506878750103239, -0.25504368604519045, 0.10154826747580395, -0.25539198522724643, -0.18246659421576902, 0.1929716911757938, -0.050244422817531116, 0.08255564853943025, 0.04621349959052168, 0.07151558340886438, -0.07005115058004427, -0.22718838538499908, 0.338159671836855, 0.03300762445612166, 0.18688700734100377, -0.0007083189915507459, 0.09011472155375835, -0.017158885325233523, 0.029305086669270307, 0.01872184913820372, -0.14009707775235605, 0.060975402539882526, 0.21256329772376586, 0.05085680881613651, 0.26321118536333626, -0.42493597766420305, -0.18936914171522054, 0.08803376215151869, 0.16467238898621872, 0.17422501936268348, -0.05451718241406175, -0.3006667428752945, 0.052200565317224785, -0.1656953626930212, -0.2419984039510242, -0.1282253902933847, 0.04586984517719919, 0.060106365547443814, -0.297223726591955, 0.07260600613517454, 0.09383359126345917, 0.05759845287180864, -0.09095171596541499, -0.02152056451394366, -0.027040460182783697, 0.08863432463616706, 0.0873606698990513, 0.051397306186397776, 0.10864417213283908, -0.12018690848848425, -0.042104217456653714, 0.34975567055293, -0.10635482667399068, -0.30410708886539883, 0.1660283870744304, -0.14079355304308522, -0.09848314373252484, 0.1810234261703534, 0.1469765649929356, 0.17944512981921434, -0.17257403576066002, 0.08865345980162741, 0.0090777944916716, 0.169446684133548, 0.08112602826440707, 0.001380518920576343, 0.21946598421065852, 0.10905451082642405, 0.09619103545824495, 0.19316417097714014, 0.005422606912011711, -0.12466521323389876, -0.31008915990017927, -0.10737059514324826, -0.17816838188670003, 0.0607365118787409, -0.07044558071762506, -0.2056660307257866, 0.4098222536715464, 0.14142140417803042, 0.17031000585904202, 0.025696017345091186, 0.2767487549079725, 0.18562093823073575, 0.023878730645474907, 0.07965742515919444, 0.2559290234572612, 0.17120611738377753, 0.12034160154871643, -0.20433333069265175, -0.01027614808229443, 0.0563861030991225]
|
1,803.07846
|
Active Underwater Detection with an Array of Atomic Magnetometers
|
We report on a 2x2 array of radio-frequency atomic magnetometers in magnetic
induction tomography configuration. Active detection, localization, and
real-time tracking of conductive, non-magnetic targets are demonstrated in air
and saline water. Penetration in different media and detection are achieved
thanks to the sensitivity and tunability of the sensors, and to the active
nature of magnetic induction probing. We obtained a 100% success rate for
automatic detection and 93% success rate for automatic localization in air and
water, up to 190 mm away from the sensors' plane (100 mm underwater). We
anticipate magnetic induction tomography with arrays of atomic magnetometers
finding applications in civil engineering and maintenance, oil&gas industry,
geological surveys, marine science, archeology, search and rescue, and security
and surveillance.
|
physics.ins-det physics.atom-ph
|
we report on a 2x2 array of radiofrequency atomic magnetometers in magnetic induction tomography configuration active detection localization and realtime tracking of conductive nonmagnetic targets are demonstrated in air and saline water penetration in different media and detection are achieved thanks to the sensitivity and tunability of the sensors and to the active nature of magnetic induction probing we obtained a 100 success rate for automatic detection and 93 success rate for automatic localization in air and water up to 190 mm away from the sensors plane 100 mm underwater we anticipate magnetic induction tomography with arrays of atomic magnetometers finding applications in civil engineering and maintenance oilgas industry geological surveys marine science archeology search and rescue and security and surveillance
|
[['we', 'report', 'on', 'a', '2x2', 'array', 'of', 'radiofrequency', 'atomic', 'magnetometers', 'in', 'magnetic', 'induction', 'tomography', 'configuration', 'active', 'detection', 'localization', 'and', 'realtime', 'tracking', 'of', 'conductive', 'nonmagnetic', 'targets', 'are', 'demonstrated', 'in', 'air', 'and', 'saline', 'water', 'penetration', 'in', 'different', 'media', 'and', 'detection', 'are', 'achieved', 'thanks', 'to', 'the', 'sensitivity', 'and', 'tunability', 'of', 'the', 'sensors', 'and', 'to', 'the', 'active', 'nature', 'of', 'magnetic', 'induction', 'probing', 'we', 'obtained', 'a', '100', 'success', 'rate', 'for', 'automatic', 'detection', 'and', '93', 'success', 'rate', 'for', 'automatic', 'localization', 'in', 'air', 'and', 'water', 'up', 'to', '190', 'mm', 'away', 'from', 'the', 'sensors', 'plane', '100', 'mm', 'underwater', 'we', 'anticipate', 'magnetic', 'induction', 'tomography', 'with', 'arrays', 'of', 'atomic', 'magnetometers', 'finding', 'applications', 'in', 'civil', 'engineering', 'and', 'maintenance', 'oilgas', 'industry', 'geological', 'surveys', 'marine', 'science', 'archeology', 'search', 'and', 'rescue', 'and', 'security', 'and', 'surveillance']]
|
[-0.10656103720957767, 0.1492008688236194, 0.08138660924539955, -0.027817493108339794, -0.020932052322963544, -0.10277875704490695, 0.07847557165506026, 0.43306773323334813, -0.21935865817175917, -0.403749004060264, 0.1704421839821114, -0.2875763782307752, -0.10457539513383891, 0.25679606864082605, -0.03622028792338554, 0.08337344322113074, 0.05408394804093525, -0.04955494616273021, -0.006554598319690582, -0.154846389713497, 0.13860927750779825, 0.07525817366424671, 0.37976407213136554, 0.08718278041409622, 0.11736470488408073, 0.013430700194769373, -0.05988011443371738, -0.02501292480877408, -0.07976361766095805, 0.13421141665259545, 0.35446624949666833, 0.12059071016197731, 0.24330501105975022, -0.45955514463726893, -0.22413460732522336, 0.0747997363536688, 0.12405542776561997, 0.08586083738179492, -0.11062776449873413, -0.3765813524042033, 0.043696531229306106, -0.14161124504132827, -0.12635926611352066, -0.04176877889193379, 0.03160490558197922, 0.04712655125878566, -0.2442902243380581, 0.016549976434835717, -0.009988934738746236, 0.18555838217543177, -0.14026517084268622, -0.08579272867665311, 0.04223739670027694, 0.15507659941049648, -0.018002442697116965, 0.020796788799622642, 0.27201729213572606, -0.20854305737259343, -0.11113374487088978, 0.3402437075880195, -0.04022264982812292, -0.09426063272239994, 0.24450680940635194, -0.1255117155542243, -0.0839519187276952, 0.17594037940802654, 0.21942575661511707, 0.10041864830538753, -0.16668008969065326, -0.008351401968047116, 0.04712005243983027, 0.1861366294324398, 0.13339646271052807, 0.021915260879399854, 0.2223761095242067, 0.2753093936018769, 0.11875513964140218, 0.11840734793997008, -0.2580201712702516, -0.0025671725738639676, -0.16147476856472656, -0.183357957935284, -0.13494905534735305, 0.0660811921904895, -0.015186508665893666, -0.12252283702809642, 0.3544265837370118, 0.2069434723239546, 0.04993667093890696, -0.047692880224944514, 0.35382778837907414, -0.03359180855880345, 0.07743557365534227, 0.0068436305554321975, 0.3096737324083147, 0.11258682114464685, 0.17148093936564632, -0.1993690450687331, 0.05232615112365523, -0.00829060161957702]
|
1,803.07847
|
On-demand Relational Concept Analysis
|
Formal Concept Analysis and its associated conceptual structures have been
used to support exploratory search through conceptual navigation. Relational
Concept Analysis (RCA) is an extension of Formal Concept Analysis to process
relational datasets. RCA and its multiple interconnected structures represent
good candidates to support exploratory search in relational datasets, as they
are enabling navigation within a structure as well as between the connected
structures. However, building the entire structures does not present an
efficient solution to explore a small localised area of the dataset, for
instance to retrieve the closest alternatives to a given query. In these cases,
generating only a concept and its neighbour concepts at each navigation step
appears as a less costly alternative. In this paper, we propose an algorithm to
compute a concept and its neighbourhood in extended concept lattices. The
concepts are generated directly from the relational context family, and possess
both formal and relational attributes. The algorithm takes into account two RCA
scaling operators. We illustrate it on an example.
|
cs.DB cs.AI cs.SE
|
formal concept analysis and its associated conceptual structures have been used to support exploratory search through conceptual navigation relational concept analysis rca is an extension of formal concept analysis to process relational datasets rca and its multiple interconnected structures represent good candidates to support exploratory search in relational datasets as they are enabling navigation within a structure as well as between the connected structures however building the entire structures does not present an efficient solution to explore a small localised area of the dataset for instance to retrieve the closest alternatives to a given query in these cases generating only a concept and its neighbour concepts at each navigation step appears as a less costly alternative in this paper we propose an algorithm to compute a concept and its neighbourhood in extended concept lattices the concepts are generated directly from the relational context family and possess both formal and relational attributes the algorithm takes into account two rca scaling operators we illustrate it on an example
|
[['formal', 'concept', 'analysis', 'and', 'its', 'associated', 'conceptual', 'structures', 'have', 'been', 'used', 'to', 'support', 'exploratory', 'search', 'through', 'conceptual', 'navigation', 'relational', 'concept', 'analysis', 'rca', 'is', 'an', 'extension', 'of', 'formal', 'concept', 'analysis', 'to', 'process', 'relational', 'datasets', 'rca', 'and', 'its', 'multiple', 'interconnected', 'structures', 'represent', 'good', 'candidates', 'to', 'support', 'exploratory', 'search', 'in', 'relational', 'datasets', 'as', 'they', 'are', 'enabling', 'navigation', 'within', 'a', 'structure', 'as', 'well', 'as', 'between', 'the', 'connected', 'structures', 'however', 'building', 'the', 'entire', 'structures', 'does', 'not', 'present', 'an', 'efficient', 'solution', 'to', 'explore', 'a', 'small', 'localised', 'area', 'of', 'the', 'dataset', 'for', 'instance', 'to', 'retrieve', 'the', 'closest', 'alternatives', 'to', 'a', 'given', 'query', 'in', 'these', 'cases', 'generating', 'only', 'a', 'concept', 'and', 'its', 'neighbour', 'concepts', 'at', 'each', 'navigation', 'step', 'appears', 'as', 'a', 'less', 'costly', 'alternative', 'in', 'this', 'paper', 'we', 'propose', 'an', 'algorithm', 'to', 'compute', 'a', 'concept', 'and', 'its', 'neighbourhood', 'in', 'extended', 'concept', 'lattices', 'the', 'concepts', 'are', 'generated', 'directly', 'from', 'the', 'relational', 'context', 'family', 'and', 'possess', 'both', 'formal', 'and', 'relational', 'attributes', 'the', 'algorithm', 'takes', 'into', 'account', 'two', 'rca', 'scaling', 'operators', 'we', 'illustrate', 'it', 'on', 'an', 'example']]
|
[-0.10358810152000109, 0.0026007446895931364, -0.0967012684194775, 0.10557672315940454, -0.14121594442284655, -0.11315348077879613, 0.054013116292919154, 0.4149630133017718, -0.301835233185732, -0.320718738884407, 0.11625140719676771, -0.2556771952743047, -0.1794058487186747, 0.18452887801195395, -0.058607983761971974, 0.028907913589816404, 0.053047697090667235, 0.06186961715042322, -0.04043442309702219, -0.20082657563034445, 0.26955257513047004, 0.07399351202534983, 0.28659773658938614, -0.0017655589575710964, 0.0959446317942656, 0.005960220193310854, -0.0630716023579554, 0.043357898856460866, -0.06834727302347927, 0.15945006383958846, 0.3060259856781586, 0.20896557562687176, 0.31769423385526624, -0.40779376557904734, -0.1722412012203271, 0.09883060373354659, 0.15151907501500997, 0.09864007496062514, -0.045119704093071575, -0.316581554543255, 0.10022695234651308, -0.1921209965422974, -0.0983438479646771, -0.14906578999777473, 0.02203060849850257, -0.02781067049854536, -0.24114540622868375, -0.03803772866131222, 0.09136382096057129, 0.07739586823518915, -0.07044258212435048, -0.06744175784676251, 0.011433823959178191, 0.15485023644034673, -0.027113091409752, 0.007151125386043127, 0.12286377906468304, -0.07897779536545725, -0.1842242819649807, 0.403339402507135, -0.0015177571674786419, -0.2141860585255795, 0.22072127671822547, -0.03588027483783662, -0.16508128089796617, 0.08145635049363756, 0.19957390689173243, 0.10953748902917491, -0.16427001741424438, 0.0756793723235479, -0.049347922391067424, 0.18027339501065168, 0.038230406969690316, 0.03275010598534494, 0.23368551151782094, 0.23785131864799522, 0.053895550895712324, 0.14985913670543266, -0.05482730027239108, -0.12618068475360386, -0.2676947606641221, -0.17451374837497519, -0.16610536223322334, -0.03191098533576026, -0.08969232775863535, -0.22030020678129766, 0.37822489256420766, 0.1871227137183389, 0.2041557258645813, 0.052408932315477406, 0.30806733290552646, 0.038420124217890296, 0.11982119255082076, 0.07244423957589273, 0.13776742716611598, 0.08391005484000162, 0.10816128105093467, -0.10456079533968839, 0.0697151536307107, 0.07008351044201977]
|
1,803.07848
|
Non-perturbative spectrum of non-local gravity
|
We investigate the non-perturbative degrees of freedom of a class of weakly
non-local gravitational theories that have been proposed as an ultraviolet
completion of general relativity. At the perturbative level, it is known that
the degrees of freedom of non-local gravity are the same of the
Einstein--Hilbert theory around any maximally symmetric spacetime. We prove
that, at the non-perturbative level, the degrees of freedom are actually eight
in four dimensions, contrary to what one might guess on the basis of the
"infinite number of derivatives" present in the action. It is shown that six of
these degrees of freedom do not propagate on Minkowski spacetime, but they
might play a role at large scales on curved backgrounds. We also propose a
criterion to select the form factor almost uniquely.
|
hep-th gr-qc
|
we investigate the nonperturbative degrees of freedom of a class of weakly nonlocal gravitational theories that have been proposed as an ultraviolet completion of general relativity at the perturbative level it is known that the degrees of freedom of nonlocal gravity are the same of the einsteinhilbert theory around any maximally symmetric spacetime we prove that at the nonperturbative level the degrees of freedom are actually eight in four dimensions contrary to what one might guess on the basis of the infinite number of derivatives present in the action it is shown that six of these degrees of freedom do not propagate on minkowski spacetime but they might play a role at large scales on curved backgrounds we also propose a criterion to select the form factor almost uniquely
|
[['we', 'investigate', 'the', 'nonperturbative', 'degrees', 'of', 'freedom', 'of', 'a', 'class', 'of', 'weakly', 'nonlocal', 'gravitational', 'theories', 'that', 'have', 'been', 'proposed', 'as', 'an', 'ultraviolet', 'completion', 'of', 'general', 'relativity', 'at', 'the', 'perturbative', 'level', 'it', 'is', 'known', 'that', 'the', 'degrees', 'of', 'freedom', 'of', 'nonlocal', 'gravity', 'are', 'the', 'same', 'of', 'the', 'einsteinhilbert', 'theory', 'around', 'any', 'maximally', 'symmetric', 'spacetime', 'we', 'prove', 'that', 'at', 'the', 'nonperturbative', 'level', 'the', 'degrees', 'of', 'freedom', 'are', 'actually', 'eight', 'in', 'four', 'dimensions', 'contrary', 'to', 'what', 'one', 'might', 'guess', 'on', 'the', 'basis', 'of', 'the', 'infinite', 'number', 'of', 'derivatives', 'present', 'in', 'the', 'action', 'it', 'is', 'shown', 'that', 'six', 'of', 'these', 'degrees', 'of', 'freedom', 'do', 'not', 'propagate', 'on', 'minkowski', 'spacetime', 'but', 'they', 'might', 'play', 'a', 'role', 'at', 'large', 'scales', 'on', 'curved', 'backgrounds', 'we', 'also', 'propose', 'a', 'criterion', 'to', 'select', 'the', 'form', 'factor', 'almost', 'uniquely']]
|
[-0.17149453336650924, 0.16953639417280741, -0.11380115323952696, 0.057281116097660144, -0.0734156916105701, -0.10245576309935414, -0.02734506624667768, 0.3258719603502184, -0.2007963510389014, -0.28882568401768227, 0.07507539990668495, -0.2756931808047978, -0.15603875719703908, 0.10747488855308485, -0.03842454953227452, -0.023789382229248684, -0.0010086455447382706, 0.1025228370847397, -0.07265939034409677, -0.30158218594138014, 0.3451174151174031, 0.05999603132941118, 0.22704422580576394, 0.031614915373944494, 0.13657926954323374, -0.012987451761412297, -0.009631708365424659, 0.038475506440844645, -0.09834794555506453, 0.0950064714675383, 0.22285426108621406, 0.09988132412292698, 0.2615991747620436, -0.40248570966267194, -0.2468678282624356, 0.06916578630321162, 0.12981514026259267, 0.1662184657716705, 0.022371648339727938, -0.23473013163897996, 0.057879873519842764, -0.14679323885835302, -0.2094752720752081, -0.10013516869598119, -0.006381795582787473, -0.08019783311747303, -0.21936326073266046, 0.06758496498074491, 0.04366592701899913, 0.027920203507235345, 0.001961936367415758, -0.10937739943890551, -0.04697052875981313, 0.11112359463951962, 0.07610286865744365, 0.028559368957906183, 0.10379670719551139, -0.17283141220262807, -0.10605216607841295, 0.3979351314131257, -0.04170473592081504, -0.27101024740750995, 0.20151165376828853, -0.1970703686739123, -0.16658951445886966, 0.12587333918014873, 0.16483944264247782, 0.19461911157235617, -0.15147637577308704, 0.11916315582645841, -0.060034683205245076, 0.17522863279793469, 0.11440385404483293, 0.14347054072440957, 0.2485880227831676, 0.05758612687056956, 0.07133748744390617, 0.09001538419532915, -0.02488753604774847, -0.12573433408961276, -0.4045829907521721, -0.11705754024099356, -0.13665897763955095, 0.09877620137496508, -0.12060991880418949, -0.1685315362047386, 0.3827728634220079, 0.14696685706315807, 0.11024526525252723, 0.03089489180652439, 0.19627596374398978, 0.08935910645807378, 0.11289554775165495, 0.08981712470047695, 0.30958960523698914, 0.09372157214368268, 0.007718722807070197, -0.21224751366056907, -0.02410569224080663, 0.09372500951813403]
|
1,803.07849
|
Testing conformal gravity with the supermassive black hole in 1H0707-495
|
Recently, two of us have found a family of singularity-free rotating black
hole solutions in Einstein's conformal gravity. These spacetimes are
characterized by three parameters: the black hole mass $M$, the black hole spin
angular momentum $J$, and a parameter $L$ that is not specified by the theory
but can be expected to be proportional to the black hole mass $M$. The Kerr
black hole solution of Einstein's gravity is recovered for $L = 0$. In a
previous paper, we showed that X-ray data of astrophysical black holes require
$L/M < 1.2$. In the present paper, we report the results of a more
sophisticated analysis. We apply the X-ray reflection model {\sc relxill\_nk}
to \textsl{NuSTAR} and \textsl{Swift} data of the supermassive black hole in
1H0707-495. We find the constraint $L/M < 0.45$ (90% confidence level).
|
gr-qc astro-ph.HE
|
recently two of us have found a family of singularityfree rotating black hole solutions in einsteins conformal gravity these spacetimes are characterized by three parameters the black hole mass m the black hole spin angular momentum j and a parameter l that is not specified by the theory but can be expected to be proportional to the black hole mass m the kerr black hole solution of einsteins gravity is recovered for l 0 in a previous paper we showed that xray data of astrophysical black holes require lm 12 in the present paper we report the results of a more sophisticated analysis we apply the xray reflection model sc relxill_nk to textslnustar and textslswift data of the supermassive black hole in 1h0707495 we find the constraint lm 045 90 confidence level
|
[['recently', 'two', 'of', 'us', 'have', 'found', 'a', 'family', 'of', 'singularityfree', 'rotating', 'black', 'hole', 'solutions', 'in', 'einsteins', 'conformal', 'gravity', 'these', 'spacetimes', 'are', 'characterized', 'by', 'three', 'parameters', 'the', 'black', 'hole', 'mass', 'm', 'the', 'black', 'hole', 'spin', 'angular', 'momentum', 'j', 'and', 'a', 'parameter', 'l', 'that', 'is', 'not', 'specified', 'by', 'the', 'theory', 'but', 'can', 'be', 'expected', 'to', 'be', 'proportional', 'to', 'the', 'black', 'hole', 'mass', 'm', 'the', 'kerr', 'black', 'hole', 'solution', 'of', 'einsteins', 'gravity', 'is', 'recovered', 'for', 'l', '0', 'in', 'a', 'previous', 'paper', 'we', 'showed', 'that', 'xray', 'data', 'of', 'astrophysical', 'black', 'holes', 'require', 'lm', '12', 'in', 'the', 'present', 'paper', 'we', 'report', 'the', 'results', 'of', 'a', 'more', 'sophisticated', 'analysis', 'we', 'apply', 'the', 'xray', 'reflection', 'model', 'sc', 'relxill_nk', 'to', 'textslnustar', 'and', 'textslswift', 'data', 'of', 'the', 'supermassive', 'black', 'hole', 'in', '1h0707495', 'we', 'find', 'the', 'constraint', 'lm', '045', '90', 'confidence', 'level']]
|
[-0.16207968413632792, 0.08099651847822735, -0.04805931868389822, 0.1272955811672056, -0.1142148833292035, -0.1660230684094131, 0.02906530181465384, 0.3130183323358114, -0.12323953263112344, -0.35890331215655, 0.08951574716215524, -0.33054456433567864, -0.06020635364827915, 0.21176420145381528, -0.05139583854291301, 0.04833389107997601, -0.008145989620914826, 0.008425064692990139, -0.12250796999030102, -0.22648115990540155, 0.3775543253832998, 0.08945383328514603, 0.18406310949693971, -0.04684422712128323, 0.08863693760851254, -0.027383346497439422, 0.003363842889666557, 0.07330182497031414, -0.1951946663443008, 0.04439427812512104, 0.2433701582897741, 0.14389014772067849, 0.21668531361680765, -0.36905254538959037, -0.22134170341126333, 0.02418835937188795, 0.15099266932945912, 0.14643280817052493, -0.10155652199497966, -0.23965205320945152, 0.08609984441158863, -0.2578434869933587, -0.14753297143615782, -0.025393072576620258, 0.07160588300142151, -0.049006461445242164, -0.2217851917223575, 0.1264403348716979, 0.10300504356049574, -0.10225226081764469, -0.12493585865550604, -0.05657668641696756, -0.08148997702189192, 0.04361296612411164, 0.13019696530939726, 0.06903386903465547, 0.16069749704060646, -0.04870980902610777, -0.11482164243666025, 0.33658875567399754, -0.06381236537574575, -0.1874366914208692, 0.13017905201547994, -0.3017105305424103, -0.12959128678059922, 0.11623414025570337, 0.12659131893529915, 0.2136198647499371, -0.16138407815462694, 0.1357331830247019, -0.02849787511647894, 0.2166388889344839, 0.09641401668509039, 0.05011588645239289, 0.4051243830579691, 0.10510011430686483, -0.01056624022133362, 0.09902694747568323, -0.12305885870726063, -0.01076446860948076, -0.24092075086127107, -0.13301828738588553, -0.157686986724058, 0.1321634024839463, -0.16484293221437837, -0.13016438134587727, 0.2943449010929236, 0.1192315766779267, 0.19434691039272226, 0.03306612918475786, 0.19368663137353836, 0.07935588104793659, 0.017451279434876947, 0.12807440042424087, 0.3586469922823688, 0.11609619583827085, 0.12868625750281634, -0.23879832272919324, -0.07606617010270174, 0.07905649233322877]
|
1,803.0785
|
Contribution of Data Categories to Readmission Prediction Accuracy
|
Identification of patients at high risk for readmission could help reduce
morbidity and mortality as well as healthcare costs. Most of the existing
studies on readmission prediction did not compare the contribution of data
categories. In this study we analyzed relative contribution of 90,101 variables
across 398,884 admission records corresponding to 163,468 patients, including
patient demographics, historical hospitalization information, discharge
disposition, diagnoses, procedures, medications and laboratory test results. We
established an interpretable readmission prediction model based on Logistic
Regression in scikit-learn, and added the available variables to the model one
by one in order to analyze the influences of individual data categories on
readmission prediction accuracy. Diagnosis related groups (c-statistic
increment of 0.0933) and discharge disposition (c-statistic increment of
0.0269) were the strongest contributors to model accuracy. Additionally, we
also identified the top ten contributing variables in every data category.
|
q-bio.QM
|
identification of patients at high risk for readmission could help reduce morbidity and mortality as well as healthcare costs most of the existing studies on readmission prediction did not compare the contribution of data categories in this study we analyzed relative contribution of 90101 variables across 398884 admission records corresponding to 163468 patients including patient demographics historical hospitalization information discharge disposition diagnoses procedures medications and laboratory test results we established an interpretable readmission prediction model based on logistic regression in scikitlearn and added the available variables to the model one by one in order to analyze the influences of individual data categories on readmission prediction accuracy diagnosis related groups cstatistic increment of 00933 and discharge disposition cstatistic increment of 00269 were the strongest contributors to model accuracy additionally we also identified the top ten contributing variables in every data category
|
[['identification', 'of', 'patients', 'at', 'high', 'risk', 'for', 'readmission', 'could', 'help', 'reduce', 'morbidity', 'and', 'mortality', 'as', 'well', 'as', 'healthcare', 'costs', 'most', 'of', 'the', 'existing', 'studies', 'on', 'readmission', 'prediction', 'did', 'not', 'compare', 'the', 'contribution', 'of', 'data', 'categories', 'in', 'this', 'study', 'we', 'analyzed', 'relative', 'contribution', 'of', '90101', 'variables', 'across', '398884', 'admission', 'records', 'corresponding', 'to', '163468', 'patients', 'including', 'patient', 'demographics', 'historical', 'hospitalization', 'information', 'discharge', 'disposition', 'diagnoses', 'procedures', 'medications', 'and', 'laboratory', 'test', 'results', 'we', 'established', 'an', 'interpretable', 'readmission', 'prediction', 'model', 'based', 'on', 'logistic', 'regression', 'in', 'scikitlearn', 'and', 'added', 'the', 'available', 'variables', 'to', 'the', 'model', 'one', 'by', 'one', 'in', 'order', 'to', 'analyze', 'the', 'influences', 'of', 'individual', 'data', 'categories', 'on', 'readmission', 'prediction', 'accuracy', 'diagnosis', 'related', 'groups', 'cstatistic', 'increment', 'of', '00933', 'and', 'discharge', 'disposition', 'cstatistic', 'increment', 'of', '00269', 'were', 'the', 'strongest', 'contributors', 'to', 'model', 'accuracy', 'additionally', 'we', 'also', 'identified', 'the', 'top', 'ten', 'contributing', 'variables', 'in', 'every', 'data', 'category']]
|
[-0.026542550277102877, 0.005253091375278827, -0.031795499848063895, 0.1266105213124926, -0.07588335856174429, -0.14532162681980818, 0.13070120580701364, 0.3910291558614484, -0.19721244807199886, -0.3317665809627484, 0.14955216382664663, -0.3616248258837947, -0.08830680282165607, 0.2078069112505074, -0.18593657129892596, 0.030943952836268752, 0.09969837977205989, 0.09428900496827232, 0.01954909219165091, -0.3422845677757222, 0.25064618339486144, 0.09054957013577222, 0.36399362987528244, 0.03589206907760214, 0.0644986030223124, 0.0007394564717456147, -0.12223130282083595, -0.014388987793656135, -0.09831880446764882, 0.12518627922292108, 0.347705916977591, 0.18826022697612643, 0.338300914269941, -0.39006087622945884, -0.18294073606116903, 0.08383010512010919, 0.07842639992703442, 0.038643492009766675, 0.014752847074393045, -0.2887412639817706, 0.020380150228393852, -0.20602335876060857, -0.06655663534722946, -0.07857112685149467, -0.0033051373368060146, 0.006418742196358464, -0.27343897209330287, 0.13503264670790588, -0.05465527887998313, 0.13462595250457526, -0.16093155210665255, -0.16943433239918065, -0.0533557752944169, 0.2179522888355509, 0.12765747612359485, 0.002647609116199116, 0.19351637075025657, -0.16917355809947132, -0.16145785883655428, 0.3376842673005605, -0.036829724289580354, -0.1555450817733934, 0.19730835301905042, -0.1292631634235106, -0.16730858138417481, 0.09986420581246623, 0.27245738803650493, 0.03164231525734067, -0.1965812797382198, -0.08168374755488778, 0.03904165611602366, 0.15963399059794567, 0.05997431579701327, -0.05318659404982571, 0.1376558850346892, 0.20355160058717484, -0.04191668909043074, 0.09824323084170895, -0.10673417941046258, -0.03078392586774296, -0.25513025656066557, -0.13681819709362808, -0.05827802939133512, 0.00268890743016662, -0.10176116173905837, -0.163511171993903, 0.4119895273336658, 0.22154937101597036, 0.13396492335703913, 0.05027304282907776, 0.2768987272555629, 0.015165139026767402, 0.10603053020313383, 0.033123340040307356, 0.14151326652478288, 0.06480763387969798, 0.06599774542437108, -0.1983830423404773, 0.2020479312373532, -0.0052000459628524605]
|
1,803.07851
|
Strong-lensing of Gravitational Waves by Galaxy Clusters
|
Discovery of strongly-lensed gravitational wave (GW) sources will unveil
binary compact objects at higher redshifts and lower intrinsic luminosities
than is possible without lensing. Such systems will yield unprecedented
constraints on the mass distribution in galaxy clusters, measurements of the
polarization of GWs, tests of General Relativity, and constraints on the Hubble
parameter. Excited by these prospects, and intrigued by the presence of
so-called "heavy black holes" in the early detections by LIGO-Virgo, we
commenced a search for strongly-lensed GWs and possible electromagnetic
counterparts in the latter stages of the second LIGO observing run (O2). Here,
we summarise our calculation of the detection rate of strongly-lensed GWs,
describe our review of BBH detections from O1, outline our observing strategy
in O2, summarize our follow-up observations of GW170814, and discuss the future
prospects of detection.
|
astro-ph.CO gr-qc
|
discovery of stronglylensed gravitational wave gw sources will unveil binary compact objects at higher redshifts and lower intrinsic luminosities than is possible without lensing such systems will yield unprecedented constraints on the mass distribution in galaxy clusters measurements of the polarization of gws tests of general relativity and constraints on the hubble parameter excited by these prospects and intrigued by the presence of socalled heavy black holes in the early detections by ligovirgo we commenced a search for stronglylensed gws and possible electromagnetic counterparts in the latter stages of the second ligo observing run o2 here we summarise our calculation of the detection rate of stronglylensed gws describe our review of bbh detections from o1 outline our observing strategy in o2 summarize our followup observations of gw170814 and discuss the future prospects of detection
|
[['discovery', 'of', 'stronglylensed', 'gravitational', 'wave', 'gw', 'sources', 'will', 'unveil', 'binary', 'compact', 'objects', 'at', 'higher', 'redshifts', 'and', 'lower', 'intrinsic', 'luminosities', 'than', 'is', 'possible', 'without', 'lensing', 'such', 'systems', 'will', 'yield', 'unprecedented', 'constraints', 'on', 'the', 'mass', 'distribution', 'in', 'galaxy', 'clusters', 'measurements', 'of', 'the', 'polarization', 'of', 'gws', 'tests', 'of', 'general', 'relativity', 'and', 'constraints', 'on', 'the', 'hubble', 'parameter', 'excited', 'by', 'these', 'prospects', 'and', 'intrigued', 'by', 'the', 'presence', 'of', 'socalled', 'heavy', 'black', 'holes', 'in', 'the', 'early', 'detections', 'by', 'ligovirgo', 'we', 'commenced', 'a', 'search', 'for', 'stronglylensed', 'gws', 'and', 'possible', 'electromagnetic', 'counterparts', 'in', 'the', 'latter', 'stages', 'of', 'the', 'second', 'ligo', 'observing', 'run', 'o2', 'here', 'we', 'summarise', 'our', 'calculation', 'of', 'the', 'detection', 'rate', 'of', 'stronglylensed', 'gws', 'describe', 'our', 'review', 'of', 'bbh', 'detections', 'from', 'o1', 'outline', 'our', 'observing', 'strategy', 'in', 'o2', 'summarize', 'our', 'followup', 'observations', 'of', 'gw170814', 'and', 'discuss', 'the', 'future', 'prospects', 'of', 'detection']]
|
[-0.13738909830797963, 0.12796171962061145, -0.027147630524974483, 0.1013774739712157, -0.12658894274543636, -0.052134648768175675, 0.06708221341511096, 0.3476697765047481, -0.09883130225700451, -0.34822314142583133, 0.12320621640581304, -0.3084216598532538, -0.08956827518683094, 0.232376013936322, 0.056830691194523185, 0.022721222605306044, 0.10802346171894625, -0.06471522741798144, -0.0981049167848915, -0.2787288935080087, 0.2964000600292834, 0.16312241158100652, 0.1470466380792934, -0.03075700727249704, 0.06327159081954065, -0.009432915716306932, -0.15287371380115622, -0.07140312279894281, -0.15341263714419337, 0.055124578033591304, 0.27800379815136095, 0.23297319249701756, 0.20737776421218998, -0.40847668086470507, -0.22048631227755947, 0.0831001581951677, 0.12079423262369332, 0.14917421017412041, -0.10811945368751272, -0.39019666932985436, 0.057989115206048644, -0.1955050450303147, -0.15024547879723138, 0.00675611927021128, 0.05346746356665233, 0.022599592585978445, -0.16873291038574456, 0.10147112785532737, -0.010486348337535537, -0.044147049877862096, -0.1107827152701967, -0.10128288819114052, -0.004498924444943889, 0.027470175885776087, 0.05517846986012005, 0.05156518427529998, 0.14270142497800625, -0.19073337389316075, -0.17080110221503497, 0.38211248259741204, -0.09264848709774096, -0.021526823053136468, 0.1966884614666924, -0.23632120984995655, -0.24453504231007797, 0.12014751025100252, 0.2283469293971977, 0.16549764530483022, -0.15510309613031795, 0.022116565452662728, 0.09371862155326674, 0.19217261070830385, 0.08685729709460831, 0.12106790661921728, 0.3860834839010139, 0.1646271828464719, 0.0405048070677014, 0.09541545569924499, -0.21314338775031935, 0.038386509134329914, -0.31624672996269454, -0.11374739575575092, -0.1648086491718527, 0.10142492669069385, -0.113506003595939, -0.042066940297146756, 0.3796604037451655, 0.18285719362963268, 0.11296311058729554, 0.07204289216054742, 0.279832935360059, 0.054884785211144656, 0.036790782912398005, 0.024031546166680975, 0.4229881869100813, 0.0841287902240127, 0.04943731686694603, -0.204052304116003, 0.04496702869464435, -0.016703833710339698]
|
1,803.07852
|
A note on the optimal boundary regularity for the planar generalized
$p$-Poisson equation
|
In this note, we establish sharp regularity for solutions to the following
generalized $p$- Poisson equation $$-\ div\ \big(\langle A\nabla u,\nabla
u\rangle^{\frac{p-2}{2}}A\nabla u\big)=-\ div\ \mathbf{h}+f$$ in the plane
(i.e. in $\mathbb{R}^n=\mathbb{R}^2$) for $p>2$ in the presence of Dirichlet as
well as Neumann boundary conditions and with $\mathbf{h}\in C^{1-n/q}$, $f\in
L^q$, $2=n<q\leq\infty$. The regularity assumptions on the principal part $A$
as well as that on the Dirichlet/Neumann conditions are exactly the same as in
the linear case and therefore sharp (see Remark 2.5 below). Our main results
Theorem 2.3 and Theorem 2.4 should be thought of as the boundary analogues of
the sharp interior regularity result established in the recent interesting
paper [1] in the case of \begin{equation}\label{e0} -\ div\ (|\nabla u|^{p-2}
\nabla u) =f \end{equation} for more general variable coefficient operators and
with an additional divergence term.
|
math.AP
|
in this note we establish sharp regularity for solutions to the following generalized p poisson equation div biglangle anabla unabla uranglefracp22anabla ubig div mathbfhf in the plane ie in mathbbrnmathbbr2 for p2 in the presence of dirichlet as well as neumann boundary conditions and with mathbfhin c1nq fin lq 2nqleqinfty the regularity assumptions on the principal part a as well as that on the dirichletneumann conditions are exactly the same as in the linear case and therefore sharp see remark 25 below our main results theorem 23 and theorem 24 should be thought of as the boundary analogues of the sharp interior regularity result established in the recent interesting paper 1 in the case of beginequationlabele0 div nabla up2 nabla u f endequation for more general variable coefficient operators and with an additional divergence term
|
[['in', 'this', 'note', 'we', 'establish', 'sharp', 'regularity', 'for', 'solutions', 'to', 'the', 'following', 'generalized', 'p', 'poisson', 'equation', 'div', 'biglangle', 'anabla', 'unabla', 'uranglefracp22anabla', 'ubig', 'div', 'mathbfhf', 'in', 'the', 'plane', 'ie', 'in', 'mathbbrnmathbbr2', 'for', 'p2', 'in', 'the', 'presence', 'of', 'dirichlet', 'as', 'well', 'as', 'neumann', 'boundary', 'conditions', 'and', 'with', 'mathbfhin', 'c1nq', 'fin', 'lq', '2nqleqinfty', 'the', 'regularity', 'assumptions', 'on', 'the', 'principal', 'part', 'a', 'as', 'well', 'as', 'that', 'on', 'the', 'dirichletneumann', 'conditions', 'are', 'exactly', 'the', 'same', 'as', 'in', 'the', 'linear', 'case', 'and', 'therefore', 'sharp', 'see', 'remark', '25', 'below', 'our', 'main', 'results', 'theorem', '23', 'and', 'theorem', '24', 'should', 'be', 'thought', 'of', 'as', 'the', 'boundary', 'analogues', 'of', 'the', 'sharp', 'interior', 'regularity', 'result', 'established', 'in', 'the', 'recent', 'interesting', 'paper', '1', 'in', 'the', 'case', 'of', 'beginequationlabele0', 'div', 'nabla', 'up2', 'nabla', 'u', 'f', 'endequation', 'for', 'more', 'general', 'variable', 'coefficient', 'operators', 'and', 'with', 'an', 'additional', 'divergence', 'term']]
|
[-0.12156781703924935, 0.04086266314573095, -0.018035781307844445, 0.06007740474433376, -0.061986079817415884, -0.14375304881104967, -0.02981506418200297, 0.28388194214312534, -0.3186095782311895, -0.23556665487558348, 0.163482213775751, -0.3028263998494367, -0.10724091640440747, 0.19991834632674, -0.12026426058992001, 0.06925181293627247, 0.012309906160226092, 0.08334667058443301, -0.08396838653970917, -0.19221601441677194, 0.35915850262972526, -0.06812104767323035, 0.16990790242198273, 0.09928629442947567, 0.04727612865099218, -0.00972144172192202, 0.05892315006713034, -0.06108400003358838, -0.22158888627228635, 0.04768460400373442, 0.24894404334918363, 0.003110788129561115, 0.2937481431035849, -0.40856381870435143, -0.1775562846341927, 0.12634349789004773, 0.12951755972972023, -0.04063316124302219, 0.00926644740991378, -0.28780005880253157, 0.11713623164541787, -0.06184630216739606, -0.19940995711931464, -0.013445064328152512, 0.04681428954427247, 0.06710950879732991, -0.36717106472860905, 0.17890900260317721, 0.16888220510281826, 0.053422264511027606, -0.1475364353882469, -0.18389952150482713, -0.03456480067870871, 0.027677836405928247, 0.062464268870826345, 0.10131634958361246, 0.009368655933940317, -0.10570300755534845, -0.018171710738897673, 0.3318059109551541, -0.11333369663771009, -0.2396035890269559, 0.13685525661276188, -0.18602477703097975, -0.1613121487407625, 0.023945584942339337, 0.12272232520444959, 0.1620933130107005, -0.12053742697753478, 0.15542978268968, -0.07051119524658134, 0.10764807723899139, 0.15977909815046587, 0.019242771539666137, 0.025033797925061663, 0.07746525252332503, 0.157237709038327, 0.1072305281240915, -0.03417724720748083, -0.03697119318530895, -0.4168027275009081, -0.16995823335309979, -0.13763503701648006, 0.1359158358318382, -0.10847046104345281, -0.14594108254004823, 0.3090463074540821, 0.09579803752558291, 0.20501928087287524, 0.048579539339698385, 0.19024388209800236, 0.16024787566038867, -0.004839367968088482, 0.09697519976907643, 0.17535588331520557, 0.18095089041162282, 0.1697654991876334, -0.17353823613825625, 0.007431939892740047, 0.1260722567931225]
|
1,803.07853
|
On automorphisms of finite $p$-groups
|
It is proved in [J. Group Theory, {\bf 10} (2007), 859-866] that if $G$ is a
finite $p$-group such that $(G,Z(G))$ is a Camina pair, then $|G|$ divides
$|\Aut(G)|$. We give a very short and elementary proof of this result.
|
math.GR
|
it is proved in j group theory bf 10 2007 859866 that if g is a finite pgroup such that gzg is a camina pair then g divides autg we give a very short and elementary proof of this result
|
[['it', 'is', 'proved', 'in', 'j', 'group', 'theory', 'bf', '10', '2007', '859866', 'that', 'if', 'g', 'is', 'a', 'finite', 'pgroup', 'such', 'that', 'gzg', 'is', 'a', 'camina', 'pair', 'then', 'g', 'divides', 'autg', 'we', 'give', 'a', 'very', 'short', 'and', 'elementary', 'proof', 'of', 'this', 'result']]
|
[-0.2164424106430931, 0.18083249671289173, -0.17959622327142802, 0.038473357142020874, -0.13578206162828094, -0.18317009271003115, 0.014087033825210081, 0.3629443164532765, -0.2739783051686409, -0.24554979760581866, 0.03661078528369753, -0.2343928442360499, -0.14348478451854765, 0.1591490265698387, -0.12914102449296758, -0.16070217862486458, 0.09592906022683167, 0.11072821853061517, 0.03472656476048705, -0.33426079774896306, 0.23866256905528596, -0.10115062502714303, 0.17970745730921267, 0.10338903076421374, 0.11448913277126849, 0.035099602196938716, 0.0022790044761047913, -0.0033880425855899467, -0.16277811145118903, -0.003065070352302148, 0.33452488861691493, 0.08712394540317547, 0.280523345590784, -0.3042231641996365, -0.1267378682939288, 0.17702819477432433, 0.07514559029816435, 0.004285964296939664, -0.0686950116442182, -0.21701279695695028, 0.230786042741667, -0.2692546510639099, -0.08806519569733585, -0.022449596737248775, 0.267929279890198, -0.04423101014720324, -0.3244095536378714, -0.013488828347852597, 0.1948405381721946, 0.0955421047953841, 0.07339054049971776, -0.09075229320054252, -0.023348483567436535, 0.015135362445830535, -0.055559608745030485, 0.14402317069470882, 0.03293762316043752, -4.887370129999442e-05, -0.059328309105088316, 0.4081990590844399, -0.07919111628180896, -0.1390870532546288, 0.1462421602784441, -0.12920466311371478, -0.20130024516047576, 0.10132588832997359, 0.035223642602944985, 0.20634520545792887, -0.026933037389356356, 0.23386126794726947, -0.22496648261753413, 0.1419396078070769, 0.06245468099876188, -0.07280605379492044, 0.06837574817622319, 0.1082416830632167, 0.11216570362926294, 0.0833198285351197, 0.05629668346582315, 0.13143146457150578, -0.40527921055371946, -0.18343621205825072, -0.24852301388119274, 0.18201908834565145, -0.0327662864146987, -0.13361628933881337, 0.37550343023851895, 0.0598973705409429, 0.12802833263786176, 0.07507344278005454, 0.16919117898513109, 0.08749609736677928, -0.009571170726886544, 0.15122644676086613, 0.10338822588658868, 0.2417212586181286, -0.0962498513265298, -0.10677468793418927, -0.07377991067150082, 0.2556378145773823]
|
1,803.07854
|
Thermoelectric transport of GaAs, InP, and PbTe: Hybrid functional with
${\bf \it k \cdot p}$ interpolation versus scissor-corrected generalized
gradient approximation
|
Boltzmann transport calculations based on band structures generated with
density functional theory (DFT) are often used in the discovery and analysis of
thermoelectric materials. In standard implementations, such calculations
require dense ${\it k}$-point sampling of the Brillouin zone and are therefore
typically limited to the generalized gradient approximation (GGA), whereas more
accurate methods such as hybrid functionals would have been preferable. GGA
variants, however, generally underestimate the band gap. While premature onset
of minority carriers can be avoided with scissor corrections, the band gap also
affects the band curvature. In this study, we resolved the ${\it k}$-point
sampling issue in hybrid-functional based calculations by extending our
recently developed ${\it k}\cdot\tilde{{\it p}}$ interpolation scheme [Comput.
Mater. Sci. 134, 17 (2017)] to non-local one-electron potentials and spin-orbit
coupling. The Seebeck coefficient generated based on hybrid functionals were
found to agree better than GGA with experimental data for GaAs, InP, and PbTe.
For PbTe, even the choice of hybrid functional has bearing on the
interpretation of experimental data, which we attribute to the description of
valley convergence of the valence band.
|
cond-mat.mtrl-sci
|
boltzmann transport calculations based on band structures generated with density functional theory dft are often used in the discovery and analysis of thermoelectric materials in standard implementations such calculations require dense it kpoint sampling of the brillouin zone and are therefore typically limited to the generalized gradient approximation gga whereas more accurate methods such as hybrid functionals would have been preferable gga variants however generally underestimate the band gap while premature onset of minority carriers can be avoided with scissor corrections the band gap also affects the band curvature in this study we resolved the it kpoint sampling issue in hybridfunctional based calculations by extending our recently developed it kcdottildeit p interpolation scheme comput mater sci 134 17 2017 to nonlocal oneelectron potentials and spinorbit coupling the seebeck coefficient generated based on hybrid functionals were found to agree better than gga with experimental data for gaas inp and pbte for pbte even the choice of hybrid functional has bearing on the interpretation of experimental data which we attribute to the description of valley convergence of the valence band
|
[['boltzmann', 'transport', 'calculations', 'based', 'on', 'band', 'structures', 'generated', 'with', 'density', 'functional', 'theory', 'dft', 'are', 'often', 'used', 'in', 'the', 'discovery', 'and', 'analysis', 'of', 'thermoelectric', 'materials', 'in', 'standard', 'implementations', 'such', 'calculations', 'require', 'dense', 'it', 'kpoint', 'sampling', 'of', 'the', 'brillouin', 'zone', 'and', 'are', 'therefore', 'typically', 'limited', 'to', 'the', 'generalized', 'gradient', 'approximation', 'gga', 'whereas', 'more', 'accurate', 'methods', 'such', 'as', 'hybrid', 'functionals', 'would', 'have', 'been', 'preferable', 'gga', 'variants', 'however', 'generally', 'underestimate', 'the', 'band', 'gap', 'while', 'premature', 'onset', 'of', 'minority', 'carriers', 'can', 'be', 'avoided', 'with', 'scissor', 'corrections', 'the', 'band', 'gap', 'also', 'affects', 'the', 'band', 'curvature', 'in', 'this', 'study', 'we', 'resolved', 'the', 'it', 'kpoint', 'sampling', 'issue', 'in', 'hybridfunctional', 'based', 'calculations', 'by', 'extending', 'our', 'recently', 'developed', 'it', 'kcdottildeit', 'p', 'interpolation', 'scheme', 'comput', 'mater', 'sci', '134', '17', '2017', 'to', 'nonlocal', 'oneelectron', 'potentials', 'and', 'spinorbit', 'coupling', 'the', 'seebeck', 'coefficient', 'generated', 'based', 'on', 'hybrid', 'functionals', 'were', 'found', 'to', 'agree', 'better', 'than', 'gga', 'with', 'experimental', 'data', 'for', 'gaas', 'inp', 'and', 'pbte', 'for', 'pbte', 'even', 'the', 'choice', 'of', 'hybrid', 'functional', 'has', 'bearing', 'on', 'the', 'interpretation', 'of', 'experimental', 'data', 'which', 'we', 'attribute', 'to', 'the', 'description', 'of', 'valley', 'convergence', 'of', 'the', 'valence', 'band']]
|
[-0.0723923686306429, 0.06057475615387498, -0.08356970276007439, 0.07437038157805459, -0.05369599344535063, -0.1437260290702521, 0.10620526411888942, 0.4350037375980683, -0.25166463333387246, -0.3418943318354208, 0.013418139518885795, -0.3082481588442194, -0.14727264594307726, 0.17250954942668573, -0.008770146880740836, 0.0789915184999453, 0.06779671018932668, -0.09106781609398497, -0.12987538876069846, -0.21030858851243125, 0.2449478216214095, 0.10041122855868527, 0.3168535627461549, 0.10101068167457894, -0.019544505933825833, 0.01922917905353052, 0.028351200576134994, 0.02614208107214358, -0.12499931387308627, 0.13948896402850916, 0.2976080409203798, -0.06953807459521966, 0.27341534670884327, -0.4640909547438729, -0.2531458000878746, 0.0020537934355479848, 0.0992019524729395, 0.11921829628852844, -0.03769378624269463, -0.24062685905771572, 0.087943007659146, -0.15991395509059905, -0.07149921996403212, -0.1465441204500937, -0.029616568037598146, 0.0061481943676948, -0.24759348419147653, 0.15475263402486183, -0.001544179791113688, 0.03687578811851037, -0.08166431918040465, -0.23004525289528788, -0.08239573330650012, -0.002782449172283549, 0.021968527221499737, 0.04771916414505807, 0.14413189123211018, -0.05610241272518317, -0.12218562659076125, 0.40711710281606955, -0.06579245533703729, -0.13780640945427836, 0.1749710487214964, -0.1347311902429519, -0.11089308843763787, 0.1423794293150011, 0.11956740129330606, 0.11347226866961281, -0.12196819704699483, 0.11573590645645508, 0.020535123034309342, 0.1587885709026944, 0.06312072061339004, 0.08176891080045935, 0.1532553784505827, 0.16605924449776863, 0.03913181361289811, 0.007801372145492015, -0.1239159288914811, -0.10774718792477654, -0.20991484737181562, -0.1388840609851476, -0.25637182795921454, 0.026494333042373808, -0.04545494682309455, -0.2165844877491216, 0.38963100391954014, 0.15050157369246, 0.11302503817162271, -0.017970529305327703, 0.23070495383614031, 0.14014252960039986, 0.10320784028693192, 0.09430373697357494, 0.27455181867380146, 0.15839677284166512, 0.06300827723106969, -0.23048634416197483, 0.05208791166183534, 0.0337399573020616]
|
1,803.07855
|
The astronomical garden of Venus and Mars-NG915: the pivotal role of
Astronomy in dating and deciphering Botticelli's masterpiece
|
This essay demonstrates the key role of Astronomy in Botticelli's "Venus and
Mars-NG915" painting, to date only very partially understood. Worthwhile
coincidences among the principles of the Ficinian philosophy, the historical
characters involved and the compositional elements of the painting, show how
the astronomical knowledge of that time strongly influenced this masterpiece.
First, Astronomy provides its precise dating since the artist used the
astronomical ephemerides of his time, albeit preserving a mythological meaning,
and a clue for Botticelli's signature. Second, it allows the correlation among
Botticelli's creative intention, the historical facts and the astronomical
phenomena such as the heliacal rising of the planet Venus in conjunction with
the Aquarius constellation dating back to the earliest representations of Venus
in Mesopotamian culture. This work not only bears a significant value for the
history of science and art, but, in the current era of three-dimensional
mapping of billion stars about to be delivered by Gaia, states the role of
astronomical heritage in Western culture. Finally, following the same method, a
precise astronomical dating for the famous Primavera painting is suggested.
|
physics.hist-ph physics.pop-ph
|
this essay demonstrates the key role of astronomy in botticellis venus and marsng915 painting to date only very partially understood worthwhile coincidences among the principles of the ficinian philosophy the historical characters involved and the compositional elements of the painting show how the astronomical knowledge of that time strongly influenced this masterpiece first astronomy provides its precise dating since the artist used the astronomical ephemerides of his time albeit preserving a mythological meaning and a clue for botticellis signature second it allows the correlation among botticellis creative intention the historical facts and the astronomical phenomena such as the heliacal rising of the planet venus in conjunction with the aquarius constellation dating back to the earliest representations of venus in mesopotamian culture this work not only bears a significant value for the history of science and art but in the current era of threedimensional mapping of billion stars about to be delivered by gaia states the role of astronomical heritage in western culture finally following the same method a precise astronomical dating for the famous primavera painting is suggested
|
[['this', 'essay', 'demonstrates', 'the', 'key', 'role', 'of', 'astronomy', 'in', 'botticellis', 'venus', 'and', 'marsng915', 'painting', 'to', 'date', 'only', 'very', 'partially', 'understood', 'worthwhile', 'coincidences', 'among', 'the', 'principles', 'of', 'the', 'ficinian', 'philosophy', 'the', 'historical', 'characters', 'involved', 'and', 'the', 'compositional', 'elements', 'of', 'the', 'painting', 'show', 'how', 'the', 'astronomical', 'knowledge', 'of', 'that', 'time', 'strongly', 'influenced', 'this', 'masterpiece', 'first', 'astronomy', 'provides', 'its', 'precise', 'dating', 'since', 'the', 'artist', 'used', 'the', 'astronomical', 'ephemerides', 'of', 'his', 'time', 'albeit', 'preserving', 'a', 'mythological', 'meaning', 'and', 'a', 'clue', 'for', 'botticellis', 'signature', 'second', 'it', 'allows', 'the', 'correlation', 'among', 'botticellis', 'creative', 'intention', 'the', 'historical', 'facts', 'and', 'the', 'astronomical', 'phenomena', 'such', 'as', 'the', 'heliacal', 'rising', 'of', 'the', 'planet', 'venus', 'in', 'conjunction', 'with', 'the', 'aquarius', 'constellation', 'dating', 'back', 'to', 'the', 'earliest', 'representations', 'of', 'venus', 'in', 'mesopotamian', 'culture', 'this', 'work', 'not', 'only', 'bears', 'a', 'significant', 'value', 'for', 'the', 'history', 'of', 'science', 'and', 'art', 'but', 'in', 'the', 'current', 'era', 'of', 'threedimensional', 'mapping', 'of', 'billion', 'stars', 'about', 'to', 'be', 'delivered', 'by', 'gaia', 'states', 'the', 'role', 'of', 'astronomical', 'heritage', 'in', 'western', 'culture', 'finally', 'following', 'the', 'same', 'method', 'a', 'precise', 'astronomical', 'dating', 'for', 'the', 'famous', 'primavera', 'painting', 'is', 'suggested']]
|
[-0.03568033993111125, 0.09133717919192609, -0.1264006890622633, 0.08747251732807074, -0.16093764505748237, -0.052242164912833164, 0.05947688502924783, 0.33215915462600865, -0.26324125222595673, -0.3377134415174701, 0.11185848478959608, -0.28124197927045835, -0.16021313400939108, 0.20860138565534725, -0.1138978284318, -0.015050472177099436, 0.10148022624530963, 0.03520098486083693, -0.021695163872625146, -0.28832307292946746, 0.25585819151784694, 0.12900284230576028, 0.21898286708048545, 0.020637317579239606, 0.10002795126023037, -0.02662556473697935, -0.1226186834089458, -0.08809569578418242, -0.09803818589296757, 0.13908199771407193, 0.302015387120191, 0.2226128778819527, 0.2846706613911582, -0.4277621859737805, -0.17411257517424278, 0.03547906461304852, 0.10265649893720236, 0.07186103963916789, -0.05927333605874862, -0.30774612779729066, -0.016224255709177147, -0.16481687423240926, -0.16243783838182155, 0.02441710527986288, 0.07733752622036263, -0.025140340344182083, -0.13110300752334297, 0.04718948669532048, 0.057049065053995165, 0.11829280858593327, -0.0707005566288717, -0.13650476197978215, -0.0046522300264665055, 0.22483417562342115, 0.06085617259743491, 0.05206728114413896, 0.07110684679721349, -0.13874592399623778, -0.08510624864770631, 0.4514872620148318, -0.04734243555160771, -0.05031936085117715, 0.178380663487395, -0.18650773445942573, -0.16026870816480368, 0.0672626957360522, 0.11855931144872947, 0.08996323777894889, -0.15539432004094123, 0.03343854642040762, -0.027566941960581712, 0.17328851423159775, 0.11664136158036334, 0.020889278974916253, 0.29702217377988355, 0.15414081977148142, 0.008504136340426547, 0.052327349880776766, -0.08626032410588648, -0.09374569493478963, -0.21707123661413788, -0.1953263629760061, -0.15851387254494642, 0.039308925698195316, -0.049364183904586495, -0.12951234227844646, 0.4056723690724799, 0.17601446088669556, 0.11247053765292679, -0.03371470332411783, 0.293549645016236, -0.023073637102996664, 0.07202905066311359, 0.030093585090445622, 0.250771189954664, 0.06994024650992027, 0.20890706242727383, -0.16600783065377203, 0.16096990272934947, 0.04399214041103343]
|
1,803.07856
|
Investigating Collaboration Within Online Communities: Software
Development Vs. Artistic Creation
|
Online creative communities have been able to develop large, open source
software (OSS) projects like Linux and Firefox throughout the successful
collaborations carried out over the Internet. These communities have also
expanded to creative arts domains such as animation, video games, and music.
Despite their growing popularity, the factors that lead to successful
collaborations in these communities are not entirely understood. In the
following, I describe my PhD research project aimed at improving communication,
collaboration, and retention in creative arts communities, starting from the
experience gained from the literature about OSS communities.
|
cs.SI cs.SE
|
online creative communities have been able to develop large open source software oss projects like linux and firefox throughout the successful collaborations carried out over the internet these communities have also expanded to creative arts domains such as animation video games and music despite their growing popularity the factors that lead to successful collaborations in these communities are not entirely understood in the following i describe my phd research project aimed at improving communication collaboration and retention in creative arts communities starting from the experience gained from the literature about oss communities
|
[['online', 'creative', 'communities', 'have', 'been', 'able', 'to', 'develop', 'large', 'open', 'source', 'software', 'oss', 'projects', 'like', 'linux', 'and', 'firefox', 'throughout', 'the', 'successful', 'collaborations', 'carried', 'out', 'over', 'the', 'internet', 'these', 'communities', 'have', 'also', 'expanded', 'to', 'creative', 'arts', 'domains', 'such', 'as', 'animation', 'video', 'games', 'and', 'music', 'despite', 'their', 'growing', 'popularity', 'the', 'factors', 'that', 'lead', 'to', 'successful', 'collaborations', 'in', 'these', 'communities', 'are', 'not', 'entirely', 'understood', 'in', 'the', 'following', 'i', 'describe', 'my', 'phd', 'research', 'project', 'aimed', 'at', 'improving', 'communication', 'collaboration', 'and', 'retention', 'in', 'creative', 'arts', 'communities', 'starting', 'from', 'the', 'experience', 'gained', 'from', 'the', 'literature', 'about', 'oss', 'communities']]
|
[-0.05126376114988133, 0.07031998095740362, -0.11403413152362665, 0.10290064654596474, -0.15996333129157353, -0.13111248883939444, 0.045922776385534395, 0.4459933700649265, -0.21515963408772065, -0.35650041043434455, 0.11059640101840436, -0.30347935019729094, -0.16727216964974775, 0.17323366995412431, -0.09146797983988147, 0.04094480842594867, 0.13165979492149074, 0.006004326418168721, 0.05557184175679298, -0.36223894687693403, 0.30044976733220013, 0.10095003677491585, 0.33068692105133896, 0.07890426817997966, 0.011044563967279037, -0.03550869975436438, -0.1496041649525464, -0.046239196854319584, -0.09529349904859492, 0.1454876779436903, 0.4574390501188843, 0.3281384629536542, 0.41540130981466855, -0.45126311413174414, -0.15076526248088593, 0.03196747788815233, 0.18535898872600545, 0.05680868421610364, -0.08317497343966312, -0.4002025503482994, 0.06440798555685552, -0.2745774550282437, -0.09739326322248773, -0.05532690161667035, 0.03749549410143948, 0.039092814286603876, -0.10731479195047817, -0.06138289360229544, -0.018536788968207395, 0.14644231236256336, 0.012563887224330203, -0.2225243335225336, 0.04125006909421443, 0.27523897401988506, 0.12249567387018191, 0.05536475604648054, 0.17816704444830184, -0.192092444446525, -0.16749265804157956, 0.33922832236503775, 0.008229217689443865, -0.08627164034355107, 0.24622685831791782, -0.07974385357279655, -0.20684981720684015, 0.08684252219720055, 0.270777623966316, -0.003886467886015611, -0.20539282998272582, 0.04657916994524978, -0.02674522265063032, 0.17236276259822975, 0.11550805647034988, -0.012318755312741774, 0.22193920769748968, 0.19380898068345193, 0.036842482179686754, 0.04758094506763408, 0.07758004868241108, -0.12921003629858402, -0.12560541595777738, -0.09826123110036386, -0.15100541075377766, 0.006261540628854519, -0.0034950895422535605, -0.12109521295591864, 0.4094626520046681, 0.1769110032853306, 0.013014637338726417, 0.019140610289152548, 0.2413712733971846, -0.0808403181663775, 0.13766407913214568, 0.13220046120746384, 0.18372341051049854, -0.03159309448876783, 0.3061643897229299, -0.10719762460338762, 0.11043851138295038, -0.07305566976150579]
|
1,803.07857
|
Ulrich and aCM bundles from invariant theory
|
We use certain special prehomogeneous representations of algebraic groups in
order to construct aCM vector bundles, possibly Ulrich, on certain families of
hypersurfaces. Among other results, we show that a general cubic hypersurface
of dimension seven admitsan indecomposable Ulrich bundle of rank nine, and that
a general cubic fourfold admits an unsplit aCM bundle of rank six.
|
math.AG math.RT
|
we use certain special prehomogeneous representations of algebraic groups in order to construct acm vector bundles possibly ulrich on certain families of hypersurfaces among other results we show that a general cubic hypersurface of dimension seven admitsan indecomposable ulrich bundle of rank nine and that a general cubic fourfold admits an unsplit acm bundle of rank six
|
[['we', 'use', 'certain', 'special', 'prehomogeneous', 'representations', 'of', 'algebraic', 'groups', 'in', 'order', 'to', 'construct', 'acm', 'vector', 'bundles', 'possibly', 'ulrich', 'on', 'certain', 'families', 'of', 'hypersurfaces', 'among', 'other', 'results', 'we', 'show', 'that', 'a', 'general', 'cubic', 'hypersurface', 'of', 'dimension', 'seven', 'admitsan', 'indecomposable', 'ulrich', 'bundle', 'of', 'rank', 'nine', 'and', 'that', 'a', 'general', 'cubic', 'fourfold', 'admits', 'an', 'unsplit', 'acm', 'bundle', 'of', 'rank', 'six']]
|
[-0.2889390011384551, 0.019927561696022167, -0.009900746567706977, 0.022527790212604617, -0.16003942058055795, -0.20808942853805742, -0.0638322157361212, 0.3912570911925286, -0.23981026214148318, -0.1775580685519214, 0.11088203202026696, -0.24936156095022202, -0.2118034830252457, 0.1546528022736311, -0.12545678930889284, -0.02155146371972348, 0.042385152141962736, 0.11601799796751168, -0.12561106546283035, -0.4820266177121084, 0.527327880163544, -0.07226647407514974, 0.2564194078025009, 0.03831443661225161, 0.20183449045621923, 0.04483634273388556, 0.004834614893687623, -0.0013088721482615387, -0.1221605581660177, 0.20071547993990993, 0.36103587058771935, 0.0806869240519258, 0.14022821137664973, -0.33039162650571335, -0.13828668400778302, 0.2801583965525164, 0.05882266679379557, 0.044623331765511205, 0.027660922220093198, -0.1778836223446498, 0.06224055072691824, -0.18076432235206344, -0.2063872563885525, -0.17769264836429752, 0.05740488344287899, -0.012314989514249777, -0.1874326773852642, -0.055625712532284, 0.07142932789741151, 0.18654496299235948, -0.13300212198269687, -0.13392279815369484, -0.14550513315147587, -0.05598857107647096, -0.025389581586101224, 0.020345335859539255, 0.02550204544760553, -0.0543714624363929, -0.1888784121588937, 0.37340510056986076, -0.08290247192780953, -0.24831216882947565, 0.13433089419933303, -0.10913662319736821, -0.22137745412432455, 0.2159561251859746, 0.18196616127222245, 0.19724850238604372, 0.04788274457678199, 0.13275513881879825, -0.1894252777897886, 0.08500424951905318, 0.129279569656189, -0.06977147716055956, 0.09564285699161701, 0.04258632187598518, 0.07012301340832242, 0.07520005040922635, -0.00836031325577226, -0.03528391762769648, -0.3554032887997372, -0.23138092961328635, -0.042708844358068224, 0.1664161995286122, -0.16901225253215152, -0.195035552439679, 0.4675042015234275, -0.028061175319765295, 0.22076849909665594, 0.11564668814077907, 0.16669914944629585, -0.06502118074734296, 0.028835649136453867, 0.09043070557527244, 0.1614733249215143, 0.22746504881485766, -0.07473465064374198, -0.02833191739461784, -0.09372501024232147, 0.24163192529262492]
|
1,803.07858
|
Non-normality, reactivity, and intrinsic stochasticity in neural
dynamics: a non-equilibrium potential approach
|
Intrinsic stochasticity can induce highly non-trivial effects on dynamical
systems, including stochastic and coherence resonance, noise induced
bistability, noise-induced oscillations, to name but a few. In this paper we
revisit a mechanism first investigated in the context of neuroscience by which
relatively small demographic (intrinsic) fluctuations can lead to the emergence
of avalanching behavior in systems that are deterministically characterized by
a single stable fixed point (up state). The anomalously large response of such
systems to stochasticity stems (or is strongly associated with) the existence
of a "non-normal" stability matrix at the deterministic fixed point, which may
induce the system to be "reactive". Here, we further investigate this mechanism
by exploring the interplay between non-normality and intrinsic (demographic)
stochasticity, by employing a number of analytical and computational
approaches. We establish, in particular, that the resulting dynamics in this
type of systems cannot be simply derived from a scalar potential but,
additionally, one needs to consider a curl flux which describes the essential
non-equilibrium nature of this type of noisy non-normal systems. Moreover, we
shed further light on the origin of the phenomenon, introduce the novel concept
of "non-linear reactivity", and rationalize of the observed the value of the
emerging avalanche exponents.
|
cond-mat.dis-nn cond-mat.stat-mech q-bio.NC
|
intrinsic stochasticity can induce highly nontrivial effects on dynamical systems including stochastic and coherence resonance noise induced bistability noiseinduced oscillations to name but a few in this paper we revisit a mechanism first investigated in the context of neuroscience by which relatively small demographic intrinsic fluctuations can lead to the emergence of avalanching behavior in systems that are deterministically characterized by a single stable fixed point up state the anomalously large response of such systems to stochasticity stems or is strongly associated with the existence of a nonnormal stability matrix at the deterministic fixed point which may induce the system to be reactive here we further investigate this mechanism by exploring the interplay between nonnormality and intrinsic demographic stochasticity by employing a number of analytical and computational approaches we establish in particular that the resulting dynamics in this type of systems cannot be simply derived from a scalar potential but additionally one needs to consider a curl flux which describes the essential nonequilibrium nature of this type of noisy nonnormal systems moreover we shed further light on the origin of the phenomenon introduce the novel concept of nonlinear reactivity and rationalize of the observed the value of the emerging avalanche exponents
|
[['intrinsic', 'stochasticity', 'can', 'induce', 'highly', 'nontrivial', 'effects', 'on', 'dynamical', 'systems', 'including', 'stochastic', 'and', 'coherence', 'resonance', 'noise', 'induced', 'bistability', 'noiseinduced', 'oscillations', 'to', 'name', 'but', 'a', 'few', 'in', 'this', 'paper', 'we', 'revisit', 'a', 'mechanism', 'first', 'investigated', 'in', 'the', 'context', 'of', 'neuroscience', 'by', 'which', 'relatively', 'small', 'demographic', 'intrinsic', 'fluctuations', 'can', 'lead', 'to', 'the', 'emergence', 'of', 'avalanching', 'behavior', 'in', 'systems', 'that', 'are', 'deterministically', 'characterized', 'by', 'a', 'single', 'stable', 'fixed', 'point', 'up', 'state', 'the', 'anomalously', 'large', 'response', 'of', 'such', 'systems', 'to', 'stochasticity', 'stems', 'or', 'is', 'strongly', 'associated', 'with', 'the', 'existence', 'of', 'a', 'nonnormal', 'stability', 'matrix', 'at', 'the', 'deterministic', 'fixed', 'point', 'which', 'may', 'induce', 'the', 'system', 'to', 'be', 'reactive', 'here', 'we', 'further', 'investigate', 'this', 'mechanism', 'by', 'exploring', 'the', 'interplay', 'between', 'nonnormality', 'and', 'intrinsic', 'demographic', 'stochasticity', 'by', 'employing', 'a', 'number', 'of', 'analytical', 'and', 'computational', 'approaches', 'we', 'establish', 'in', 'particular', 'that', 'the', 'resulting', 'dynamics', 'in', 'this', 'type', 'of', 'systems', 'can', 'not', 'be', 'simply', 'derived', 'from', 'a', 'scalar', 'potential', 'but', 'additionally', 'one', 'needs', 'to', 'consider', 'a', 'curl', 'flux', 'which', 'describes', 'the', 'essential', 'nonequilibrium', 'nature', 'of', 'this', 'type', 'of', 'noisy', 'nonnormal', 'systems', 'moreover', 'we', 'shed', 'further', 'light', 'on', 'the', 'origin', 'of', 'the', 'phenomenon', 'introduce', 'the', 'novel', 'concept', 'of', 'nonlinear', 'reactivity', 'and', 'rationalize', 'of', 'the', 'observed', 'the', 'value', 'of', 'the', 'emerging', 'avalanche', 'exponents']]
|
[-0.14945903540321506, 0.16504040084627117, -0.08050869192840476, 0.07853252218176361, -0.045346937361311644, -0.13300149052433835, 0.0733356011845863, 0.31471056691059696, -0.32437987472299523, -0.27647631359286606, 0.09189725639287032, -0.23275708101948003, -0.2305689424813476, 0.17761697530133264, -0.07109816447084788, 0.01202699408801918, 0.0078014639286338215, -0.008546689480294169, -0.03073085991303796, -0.17199197419893716, 0.35420615856286763, 0.02865785231890438, 0.27790906405915494, 0.04349622178458526, 0.0986689262341081, -0.03534442054034017, 0.00209148827880289, 0.062020080402668674, -0.1061734917893773, 0.11540099632774138, 0.20543109412572466, 0.06396078285161812, 0.28754211729622936, -0.4369800049203015, -0.24973569912340327, 0.1427360032857995, 0.14900831907505221, 0.1397476413369059, -0.06509673388301404, -0.27170461523093026, 0.08065279203208883, -0.13893072240833784, -0.15583202117733602, -0.09463885438335727, 0.006580461586576583, 0.04837077008998298, -0.24062203356678052, 0.10354826230288364, 0.09282243889361726, 0.05654908112932624, -0.032963543613948446, -0.04534445667240566, -0.011681264528738437, 0.11146149849104188, 0.04087027063245175, -0.02777193819569184, 0.13857092562426657, -0.14366619418937676, -0.11835462640565221, 0.3586613529011386, -0.06131973470812479, -0.18084464052547689, 0.20959017198131705, -0.15462306506717394, -0.11703829196429268, 0.13518741374603693, 0.20931071176488728, 0.06556305754699256, -0.16615042970734786, 0.05439422976128794, 0.01214183256776985, 0.1800499295018784, 0.01877470942338615, 0.08058890880207706, 0.22204221564225188, 0.18797107430239493, 0.04912274644829997, 0.13674839013279186, -0.06961622289272422, -0.12380994336983871, -0.27655691746622324, -0.09623298183254123, -0.14618960056583039, 0.10452176855482555, -0.055017704674040456, -0.1739762612447917, 0.40965705686755993, 0.16986231312402386, 0.21630733090482818, 0.003131429565088399, 0.24906673128854964, 0.15000598124714826, 0.02926139680825469, 0.017344564122221625, 0.24499137698451406, 0.11662285173735996, 0.10276003681482876, -0.2883806634650538, 0.11704715502582085, 0.022553152086600515]
|
1,803.07859
|
Efficient Sampling and Structure Learning of Bayesian Networks
|
Bayesian networks are probabilistic graphical models widely employed to
understand dependencies in high dimensional data, and even to facilitate causal
discovery. Learning the underlying network structure, which is encoded as a
directed acyclic graph (DAG) is highly challenging mainly due to the vast
number of possible networks in combination with the acyclicity constraint.
Efforts have focussed on two fronts: constraint-based methods that perform
conditional independence tests to exclude edges and score and search approaches
which explore the DAG space with greedy or MCMC schemes. Here we synthesise
these two fields in a novel hybrid method which reduces the complexity of MCMC
approaches to that of a constraint-based method. Individual steps in the MCMC
scheme only require simple table lookups so that very long chains can be
efficiently obtained. Furthermore, the scheme includes an iterative procedure
to correct for errors from the conditional independence tests. The algorithm
offers markedly superior performance to alternatives, particularly because DAGs
can also be sampled from the posterior distribution, enabling full Bayesian
model averaging for much larger Bayesian networks.
|
stat.ML cs.LG stat.CO stat.ME
|
bayesian networks are probabilistic graphical models widely employed to understand dependencies in high dimensional data and even to facilitate causal discovery learning the underlying network structure which is encoded as a directed acyclic graph dag is highly challenging mainly due to the vast number of possible networks in combination with the acyclicity constraint efforts have focussed on two fronts constraintbased methods that perform conditional independence tests to exclude edges and score and search approaches which explore the dag space with greedy or mcmc schemes here we synthesise these two fields in a novel hybrid method which reduces the complexity of mcmc approaches to that of a constraintbased method individual steps in the mcmc scheme only require simple table lookups so that very long chains can be efficiently obtained furthermore the scheme includes an iterative procedure to correct for errors from the conditional independence tests the algorithm offers markedly superior performance to alternatives particularly because dags can also be sampled from the posterior distribution enabling full bayesian model averaging for much larger bayesian networks
|
[['bayesian', 'networks', 'are', 'probabilistic', 'graphical', 'models', 'widely', 'employed', 'to', 'understand', 'dependencies', 'in', 'high', 'dimensional', 'data', 'and', 'even', 'to', 'facilitate', 'causal', 'discovery', 'learning', 'the', 'underlying', 'network', 'structure', 'which', 'is', 'encoded', 'as', 'a', 'directed', 'acyclic', 'graph', 'dag', 'is', 'highly', 'challenging', 'mainly', 'due', 'to', 'the', 'vast', 'number', 'of', 'possible', 'networks', 'in', 'combination', 'with', 'the', 'acyclicity', 'constraint', 'efforts', 'have', 'focussed', 'on', 'two', 'fronts', 'constraintbased', 'methods', 'that', 'perform', 'conditional', 'independence', 'tests', 'to', 'exclude', 'edges', 'and', 'score', 'and', 'search', 'approaches', 'which', 'explore', 'the', 'dag', 'space', 'with', 'greedy', 'or', 'mcmc', 'schemes', 'here', 'we', 'synthesise', 'these', 'two', 'fields', 'in', 'a', 'novel', 'hybrid', 'method', 'which', 'reduces', 'the', 'complexity', 'of', 'mcmc', 'approaches', 'to', 'that', 'of', 'a', 'constraintbased', 'method', 'individual', 'steps', 'in', 'the', 'mcmc', 'scheme', 'only', 'require', 'simple', 'table', 'lookups', 'so', 'that', 'very', 'long', 'chains', 'can', 'be', 'efficiently', 'obtained', 'furthermore', 'the', 'scheme', 'includes', 'an', 'iterative', 'procedure', 'to', 'correct', 'for', 'errors', 'from', 'the', 'conditional', 'independence', 'tests', 'the', 'algorithm', 'offers', 'markedly', 'superior', 'performance', 'to', 'alternatives', 'particularly', 'because', 'dags', 'can', 'also', 'be', 'sampled', 'from', 'the', 'posterior', 'distribution', 'enabling', 'full', 'bayesian', 'model', 'averaging', 'for', 'much', 'larger', 'bayesian', 'networks']]
|
[-0.051512100031623625, 0.03657631098901425, -0.09865958440370556, 0.11956909633557193, -0.151014911235617, -0.19400503896876653, 0.0912327843217241, 0.4607020606060722, -0.2979562836779938, -0.3553595040817853, 0.0807303713763811, -0.18696790420304918, -0.13519184000593626, 0.17135997140117937, -0.07514491868124618, 0.09907208694241984, 0.13165009773277134, -0.00022738177000916417, -0.05696269348122427, -0.2698285281733876, 0.24553385327941593, 0.0891370449263624, 0.34482113251764046, -0.04619311948839812, 0.10317609833507675, 0.004650491728538895, -0.044705823580653684, 0.06067664374249471, -0.10602393123583506, 0.15190479790016664, 0.29024916580122256, 0.21427633069358723, 0.3004292388260903, -0.44501323554384914, -0.2444156465763926, 0.15369796203287867, 0.16123947613694936, 0.1391444507349724, 0.02764134850511812, -0.2780279557549023, 0.07608254644696767, -0.16847763108789404, 0.0009534113308296382, -0.14058832701489415, -0.043094881274602835, 0.015137425812251994, -0.31520513241546705, 0.044417158742751546, 0.0529749756941378, 0.026108727141719506, 0.05373222516066357, -0.13590121111762576, 0.002397407436772987, 0.08048585738927513, 0.038587694852397575, 0.02429390235432569, 0.10073943834784145, -0.11502866032372688, -0.18673380049661534, 0.33846023240573486, -0.015668037315868272, -0.2154973970074745, 0.19153123439795666, -0.039861516790152283, -0.2145218751823928, 0.15778124569834484, 0.1967762715076877, 0.15605799880112936, -0.1782077050978463, 0.0518655740091378, -0.006642664064696284, 0.16051996745858232, 0.0045499355812164055, 0.01429256494628061, 0.16599247905673362, 0.20426024152558145, 0.08942715744111106, 0.11695632216186838, -0.1061136767071688, -0.12297627205470565, -0.20562640059203707, -0.11632436194364251, -0.18917496456102484, -0.04925429725325047, -0.13346432942355044, -0.20727774480390065, 0.36517920961610756, 0.23548698020295503, 0.18108505717979345, 0.11179252415074499, 0.33198553938526293, 0.04683609985856802, 0.09323199189165769, 0.1006579036740963, 0.17060163851209642, 0.13188673720851196, 0.047761023800949313, -0.1367263660505091, 0.16167688516986078, 0.031896215948313905]
|
1,803.0786
|
Spin-orbital-angular-momentum coupled Bose-Einstein condensates
|
We demonstrate coupling between the atomic spin and orbital-angular-momentum
(OAM) of the atom's center-of-mass motion in a Bose-Einstein condensate (BEC).
The coupling is induced by Raman-dressing lasers with a Laguerre-Gaussian beam,
and creates coreless vortices in a $F=1$ $^{87}$Rb spinor BEC. We observe
correlations between spin and OAM in the dressed state and characterize the
spin texture; the result is in good agreement with the theory. In the presence
of the Raman field our dressed state is stable for 0.1~s or longer, and it
decays due to collision-induced relaxation. As we turn off the Raman beams, the
vortex cores in the bare spin $|m_F=1\rangle$ and $|-1\rangle$ split. These
spin-OAM coupled systems with the Raman-dressing approach have great potential
for exploring new topological textures and quantum states.
|
cond-mat.quant-gas
|
we demonstrate coupling between the atomic spin and orbitalangularmomentum oam of the atoms centerofmass motion in a boseeinstein condensate bec the coupling is induced by ramandressing lasers with a laguerregaussian beam and creates coreless vortices in a f1 87rb spinor bec we observe correlations between spin and oam in the dressed state and characterize the spin texture the result is in good agreement with the theory in the presence of the raman field our dressed state is stable for 01s or longer and it decays due to collisioninduced relaxation as we turn off the raman beams the vortex cores in the bare spin m_f1rangle and 1rangle split these spinoam coupled systems with the ramandressing approach have great potential for exploring new topological textures and quantum states
|
[['we', 'demonstrate', 'coupling', 'between', 'the', 'atomic', 'spin', 'and', 'orbitalangularmomentum', 'oam', 'of', 'the', 'atoms', 'centerofmass', 'motion', 'in', 'a', 'boseeinstein', 'condensate', 'bec', 'the', 'coupling', 'is', 'induced', 'by', 'ramandressing', 'lasers', 'with', 'a', 'laguerregaussian', 'beam', 'and', 'creates', 'coreless', 'vortices', 'in', 'a', 'f1', '87rb', 'spinor', 'bec', 'we', 'observe', 'correlations', 'between', 'spin', 'and', 'oam', 'in', 'the', 'dressed', 'state', 'and', 'characterize', 'the', 'spin', 'texture', 'the', 'result', 'is', 'in', 'good', 'agreement', 'with', 'the', 'theory', 'in', 'the', 'presence', 'of', 'the', 'raman', 'field', 'our', 'dressed', 'state', 'is', 'stable', 'for', '01s', 'or', 'longer', 'and', 'it', 'decays', 'due', 'to', 'collisioninduced', 'relaxation', 'as', 'we', 'turn', 'off', 'the', 'raman', 'beams', 'the', 'vortex', 'cores', 'in', 'the', 'bare', 'spin', 'm_f1rangle', 'and', '1rangle', 'split', 'these', 'spinoam', 'coupled', 'systems', 'with', 'the', 'ramandressing', 'approach', 'have', 'great', 'potential', 'for', 'exploring', 'new', 'topological', 'textures', 'and', 'quantum', 'states']]
|
[-0.16807618933707114, 0.27266699673108213, -0.05995001518205414, 0.010969008170484709, 0.021777110855753828, -0.13951804445359886, 0.02502948844074688, 0.4211030059335072, -0.22902520888341152, -0.2481645462519633, -0.04445131749153228, -0.28913535357346926, -0.057064457510681295, 0.16010495114927673, 0.07034320574314372, 0.052149989816352604, 0.032684769424632554, -0.01891210013470514, -0.047262012941490225, -0.1906347406225476, 0.3212722039751224, -0.020245210658493867, 0.324865884605674, 0.08302464370986795, 0.09915395089372145, 0.02119220003894553, 0.09748310674875368, -0.07409690088039733, -0.10768475666702763, 0.078639665161869, 0.20134483133177689, -0.02080668882008763, 0.18504644066428508, -0.44880706406524024, -0.16985789818804695, 0.08698225067928433, 0.17169476949375093, 0.2220542221897986, -0.054237110157898526, -0.3454177387482752, -0.03047732155527768, -0.17186256076731696, -0.144367963935029, -0.16421656431327383, 0.03378719737804381, 0.014775524317188477, -0.2620311051349693, 0.07446170887887114, 0.07181737333066701, 0.05025715673175769, -0.07758248467433713, -0.06537318886901305, -0.056987667806461695, 0.022471790677087943, 0.000682579878740376, 0.0795137816756146, 0.1077047416645034, -0.1779810834242546, -0.12877092398778817, 0.36349102797183563, -0.11187322283299958, -0.1632583818617996, 0.17078515113051224, -0.17177399910410973, 0.00040030609664878225, 0.1252230510827366, 0.1257244069810684, 0.10598342399665617, -0.054763866785338254, 0.02466326950892155, -0.03571152991834816, 0.183653239178759, 0.13041970577484707, 0.14026538496102325, 0.3164819141441002, 0.17579073384328464, 0.04097146789422183, 0.1695865580236645, -0.13623240300855502, -0.1499649061162661, -0.22850374040019705, -0.15608885624574695, -0.20650718583748107, 0.04375561179472058, -0.012628299925344753, -0.09032119298732377, 0.4051132405676493, 0.10258592055647679, 0.185479937802491, -0.07086038547265154, 0.29281599212407583, 0.1296007971220642, 0.07950219806904595, 0.02438805752426265, 0.2853851585187078, 0.21201889252676287, 0.08625547858276897, -0.3520463230429081, -0.054531361671104055, -0.0033273956420399793]
|
1,803.07861
|
Long-time analysis of extended RKN integrators for Hamiltonian systems
with a solution-dependent high frequency
|
In this paper, we analyse the long-time behaviour of the extended RKN (ERKN)
integrators for solving highly oscillatory Hamiltonian systems with a slowly
varying, solution-dependent high frequency. We prove that a symmetric ERKN
integrator approximately conserves a modified action and a modified total
energy over long time intervals based on the technique of varying-frequency
modulated Fourier expansion. An illustrative numerical experiment is carried
out and the numerical results strongly support the theoretical analysis
presented in this paper. As a byproduct of this work, similar long-time
behaviour is also investigated for an RKN method.
|
math.NA
|
in this paper we analyse the longtime behaviour of the extended rkn erkn integrators for solving highly oscillatory hamiltonian systems with a slowly varying solutiondependent high frequency we prove that a symmetric erkn integrator approximately conserves a modified action and a modified total energy over long time intervals based on the technique of varyingfrequency modulated fourier expansion an illustrative numerical experiment is carried out and the numerical results strongly support the theoretical analysis presented in this paper as a byproduct of this work similar longtime behaviour is also investigated for an rkn method
|
[['in', 'this', 'paper', 'we', 'analyse', 'the', 'longtime', 'behaviour', 'of', 'the', 'extended', 'rkn', 'erkn', 'integrators', 'for', 'solving', 'highly', 'oscillatory', 'hamiltonian', 'systems', 'with', 'a', 'slowly', 'varying', 'solutiondependent', 'high', 'frequency', 'we', 'prove', 'that', 'a', 'symmetric', 'erkn', 'integrator', 'approximately', 'conserves', 'a', 'modified', 'action', 'and', 'a', 'modified', 'total', 'energy', 'over', 'long', 'time', 'intervals', 'based', 'on', 'the', 'technique', 'of', 'varyingfrequency', 'modulated', 'fourier', 'expansion', 'an', 'illustrative', 'numerical', 'experiment', 'is', 'carried', 'out', 'and', 'the', 'numerical', 'results', 'strongly', 'support', 'the', 'theoretical', 'analysis', 'presented', 'in', 'this', 'paper', 'as', 'a', 'byproduct', 'of', 'this', 'work', 'similar', 'longtime', 'behaviour', 'is', 'also', 'investigated', 'for', 'an', 'rkn', 'method']]
|
[-0.1599078358982376, 0.07841346026986645, -0.14362071696972556, 0.06190323582015243, -0.03878060730336153, -0.11275154861884759, 0.0021372986932123163, 0.3737098146938597, -0.25003400448527513, -0.2511350408641864, 0.11922115242139072, -0.21725821264250122, -0.1851669460757757, 0.2354629859024578, -0.017683070902105257, 0.07900935732354612, 0.09974577296120317, 0.01032465725691746, -0.09587383917381015, -0.21327156779538517, 0.2544183480760852, 0.10865275574210302, 0.24101980050782795, 0.014300048204503306, 0.12620646454920265, -0.010044076867178892, -0.05397650836359547, 0.024074148730901274, -0.13795809546251764, 0.05746200811320349, 0.19820304020591403, 0.01829575266658693, 0.2858863194655303, -0.40064852534914797, -0.18890541755472837, 0.0665295414586106, 0.2007351559257823, 0.09488370222970843, -0.06807749018796881, -0.2771331996494985, 0.0754919797511083, -0.20495801261099783, -0.18961125030182302, -0.12774565926267076, 0.02641758082292812, 0.06622731027638783, -0.2549228053944914, 0.09936980275866202, 0.06524083016278304, 0.07707111533407283, -0.08771603803135171, -0.0606891388559471, 0.039396520650884864, 0.04339902057393413, 0.058574006928171475, -0.016151389618323225, 0.05111648913083153, -0.03931573996289998, -0.0886282388465074, 0.34456559532807896, -0.12465692930298088, -0.24679985334691795, 0.1661793666375477, -0.10845878945015695, -0.1666968151137395, 0.12587402961419328, 0.1853215731465278, 0.21903273895504358, -0.15455581630838267, 0.06170905258066183, -0.04176973204796567, 0.19708104807068594, 0.05941837513819337, -0.027138352998957525, 0.11161554487341124, 0.18495240905220903, 0.07261158391306906, 0.1538907654770731, -0.046470491602794144, -0.14547763171646258, -0.31174539583330246, -0.14302918004028944, -0.18261170131660512, 0.0484177678147756, -0.06794102408425913, -0.15884394592949716, 0.43531537574270496, 0.12326176096077847, 0.15734819175027634, 0.09571020792835676, 0.2771643803647274, 0.19144709984665614, -0.0061563037933133865, 0.07498369500567408, 0.18725065677173677, 0.12648191307063983, 0.1355585824969002, -0.26959398005198204, -0.023756137826358496, 0.06321213955221616]
|
1,803.07862
|
A new notion of Tameness
|
We generalize the notion of tame discrete sets introduced by Rosay and Rudin
from complex-Euclidean space to arbitrary complex manifolds and establish their
basic properties. We show that complex-linear algebraic groups different from
the complex line or the punctured complex line contain tame discrete sets.
|
math.CV
|
we generalize the notion of tame discrete sets introduced by rosay and rudin from complexeuclidean space to arbitrary complex manifolds and establish their basic properties we show that complexlinear algebraic groups different from the complex line or the punctured complex line contain tame discrete sets
|
[['we', 'generalize', 'the', 'notion', 'of', 'tame', 'discrete', 'sets', 'introduced', 'by', 'rosay', 'and', 'rudin', 'from', 'complexeuclidean', 'space', 'to', 'arbitrary', 'complex', 'manifolds', 'and', 'establish', 'their', 'basic', 'properties', 'we', 'show', 'that', 'complexlinear', 'algebraic', 'groups', 'different', 'from', 'the', 'complex', 'line', 'or', 'the', 'punctured', 'complex', 'line', 'contain', 'tame', 'discrete', 'sets']]
|
[-0.13023580160251882, 0.07764122141308563, -0.05819539002381092, 0.14073020468877498, -0.14343393581031366, -0.12630759110284406, 0.004745965780213822, 0.3743031116765599, -0.3495198347887328, -0.21845895647569452, 0.08974089555788872, -0.2031625474391635, -0.20089243763386336, 0.18839556576012698, -0.14698472298508466, 0.003669307242299235, 0.0012429367133611163, 0.031910462521536405, -0.08528198028351505, -0.27017821579478507, 0.5003632967208707, -0.09811718765305096, 0.21830244529125994, 0.006225085995961414, 0.10135374597522842, 0.06058222101392159, -0.12299503713066495, 0.021407378576885433, -0.1540335606369745, 0.18793049544572485, 0.2909272529704626, 0.10680210806949195, 0.17886959276227063, -0.41415845654731576, -0.2238052461816128, 0.21269187669074813, 0.08988449856812178, 0.016929229008721534, 0.04991270007219079, -0.3501903280009364, 0.12708730137971944, -0.08978941926169534, -0.17149667451591338, -0.0905392005996302, -0.001626176413062007, 0.08471187503012113, -0.1537168349550907, -0.033522573559609956, 0.09874049331559691, 0.16261149834581587, -0.07072650253512831, -0.07194595079771568, -0.07540169701001845, 0.1100805185486151, -0.04759330982558949, -0.005619716278255679, 0.10125914556082598, 0.023405115737384834, -0.13233694384351027, 0.35715644745979197, 0.005367040417568628, -0.2518698313641687, 0.2397729429134796, -0.1435019097637472, -0.19906248609253832, 0.16738802832443006, 0.13488352368044298, 0.13358563176074692, 0.004158369460424712, 0.19001457487980208, -0.1261804919083451, 0.07351144074007522, 0.10605950255033582, 0.028121599153247336, 0.10616591377833555, 0.011101743542091098, 0.06763165143080228, 0.1436353765514701, 0.011193713882591489, -0.09055000236041325, -0.28662910576649875, -0.15125087948602645, -0.08875314014162435, 0.11591512397971264, -0.11737817226906394, -0.2058016413790282, 0.37445284823648806, 0.04674860018543726, 0.22277242621017057, 0.13966387971629238, 0.2016837396171637, 0.024703358603251534, 0.03353888761836949, 0.0742067021512708, 0.0670236338709676, 0.2033046962704163, -0.013446060052618038, -0.11272885857236593, -0.03538809436221802, 0.1705273740740796]
|
1,803.07863
|
Novel voltage signal at proximity effect induced superconducting
transition temperature in gold nanowires
|
We observed a novel voltage peak in the proximity effect induced
superconducting gold (Au) nanowire while cooling the sample through the
superconducting transition temperature. The voltage peak turned into dip in the
warming process. The voltage peak (or dip) was found to be closely related to
the emergence (vanishing) of the proximity induced superconductivity in the Au
nanowire. The amplitude of the voltage signal depends on the temperature
scanning rate and it cannot be detected when the temperature is changed slower
than 0.03 K/min. This transient feature suggests the non-equilibrium property
of the effect. The voltage peak could be understood by Ginzburg-Landau model as
a combined result of the emergence of Cooper pairs with relatively lower free
energy in W contact and the non-equilibrium diffusion of Cooper pairs and
quasiparticles.
|
cond-mat.supr-con
|
we observed a novel voltage peak in the proximity effect induced superconducting gold au nanowire while cooling the sample through the superconducting transition temperature the voltage peak turned into dip in the warming process the voltage peak or dip was found to be closely related to the emergence vanishing of the proximity induced superconductivity in the au nanowire the amplitude of the voltage signal depends on the temperature scanning rate and it cannot be detected when the temperature is changed slower than 003 kmin this transient feature suggests the nonequilibrium property of the effect the voltage peak could be understood by ginzburglandau model as a combined result of the emergence of cooper pairs with relatively lower free energy in w contact and the nonequilibrium diffusion of cooper pairs and quasiparticles
|
[['we', 'observed', 'a', 'novel', 'voltage', 'peak', 'in', 'the', 'proximity', 'effect', 'induced', 'superconducting', 'gold', 'au', 'nanowire', 'while', 'cooling', 'the', 'sample', 'through', 'the', 'superconducting', 'transition', 'temperature', 'the', 'voltage', 'peak', 'turned', 'into', 'dip', 'in', 'the', 'warming', 'process', 'the', 'voltage', 'peak', 'or', 'dip', 'was', 'found', 'to', 'be', 'closely', 'related', 'to', 'the', 'emergence', 'vanishing', 'of', 'the', 'proximity', 'induced', 'superconductivity', 'in', 'the', 'au', 'nanowire', 'the', 'amplitude', 'of', 'the', 'voltage', 'signal', 'depends', 'on', 'the', 'temperature', 'scanning', 'rate', 'and', 'it', 'can', 'not', 'be', 'detected', 'when', 'the', 'temperature', 'is', 'changed', 'slower', 'than', '003', 'kmin', 'this', 'transient', 'feature', 'suggests', 'the', 'nonequilibrium', 'property', 'of', 'the', 'effect', 'the', 'voltage', 'peak', 'could', 'be', 'understood', 'by', 'ginzburglandau', 'model', 'as', 'a', 'combined', 'result', 'of', 'the', 'emergence', 'of', 'cooper', 'pairs', 'with', 'relatively', 'lower', 'free', 'energy', 'in', 'w', 'contact', 'and', 'the', 'nonequilibrium', 'diffusion', 'of', 'cooper', 'pairs', 'and', 'quasiparticles']]
|
[-0.16764710233937807, 0.2105379799267149, -0.06286171620668583, 0.05764153853593626, -0.044892264103502715, -0.15412083315087183, 0.11732970655163508, 0.3577510144646841, -0.261273154146429, -0.31730610664884157, -0.005843175546699808, -0.30059890843259585, -0.07055627186569378, 0.2112124283288833, 0.0039307187730801925, -0.01443212889561444, -0.012464514323012576, 0.011074092296016125, -0.08096130977150139, -0.201590716781962, 0.28017996747103585, 0.07244792617573083, 0.3670160939547283, 0.13958398338037592, 0.01635575006922124, -0.04968961571940427, 0.08349090014079599, 0.031983823060477506, -0.10821242821722768, -0.031191706678737666, 0.22729941113418295, -0.06304036419241484, 0.2152630584563292, -0.423276797811159, -0.20018074144289352, 0.08679823490136965, 0.14142271614356236, 0.0956181778504961, -0.02767975522891284, -0.29569263912680493, 0.056132825336753185, -0.13247373152723294, -0.11820274370345678, 0.044521778075465264, 0.0013117331812399944, -0.006261648212555967, -0.22470521829881926, 0.15462000595533665, 0.10475156943399089, 0.055072312243282795, -0.03443747956149337, -0.06762144861046139, -0.09567118138572528, 0.017853814527794064, 0.0332314707318815, 0.08628481879958329, 0.2341308025261103, -0.09476963389231219, -0.06050568968786339, 0.29815757935084686, -0.10550859068817627, -0.026509847186278294, 0.13224481017407003, -0.1990163283607432, 0.007878802777161353, 0.1878003858683901, 0.11274739543246176, 0.08122712663794292, -0.15821346594964933, -0.005362929034718661, 0.057046897531636345, 0.1725347910542041, 0.0834068615693343, 0.049229762938143753, 0.2640504748169475, 0.21307877600166364, 0.04546903524519378, 0.1492911003190555, -0.1688408919642075, -0.03444705597473351, -0.23650293267609282, -0.12519542256526592, -0.20683215554618767, 0.08064432668809349, -0.050323533157854455, -0.1770673746683898, 0.4205978761803899, 0.13752505699712925, 0.24807168987672065, -0.045453602837341775, 0.25143678403168007, 0.19839183171724062, 0.12476626225171313, 0.035382299228990804, 0.26418398091754386, 0.16993352481988722, 0.1350085438310901, -0.3282342529713482, 0.12819868876804946, -0.0036059597610204504]
|
1,803.07864
|
Privacy-preserving smart meter control strategy including energy storage
losses
|
Privacy-preserving smart meter control strategies proposed in the literature
so far make some ideal assumptions such as instantaneous control without delay,
lossless energy storage systems etc. In this paper, we present a one-step-ahead
predictive control strategy using Bayesian risk to measure and control privacy
leakage with an energy storage system. The controller estimates energy state
using a three-circuit energy storage model to account for steady-state energy
losses. With numerical experiments, the controller is evaluated with real
household consumption data using a state-of-the-art adversarial algorithm.
Results show that the state estimation of the energy storage system
significantly affects the controller's performance. The results also show that
the privacy leakage can be effectively reduced using an energy storage system
but at the expense of energy loss.
|
eess.SP
|
privacypreserving smart meter control strategies proposed in the literature so far make some ideal assumptions such as instantaneous control without delay lossless energy storage systems etc in this paper we present a onestepahead predictive control strategy using bayesian risk to measure and control privacy leakage with an energy storage system the controller estimates energy state using a threecircuit energy storage model to account for steadystate energy losses with numerical experiments the controller is evaluated with real household consumption data using a stateoftheart adversarial algorithm results show that the state estimation of the energy storage system significantly affects the controllers performance the results also show that the privacy leakage can be effectively reduced using an energy storage system but at the expense of energy loss
|
[['privacypreserving', 'smart', 'meter', 'control', 'strategies', 'proposed', 'in', 'the', 'literature', 'so', 'far', 'make', 'some', 'ideal', 'assumptions', 'such', 'as', 'instantaneous', 'control', 'without', 'delay', 'lossless', 'energy', 'storage', 'systems', 'etc', 'in', 'this', 'paper', 'we', 'present', 'a', 'onestepahead', 'predictive', 'control', 'strategy', 'using', 'bayesian', 'risk', 'to', 'measure', 'and', 'control', 'privacy', 'leakage', 'with', 'an', 'energy', 'storage', 'system', 'the', 'controller', 'estimates', 'energy', 'state', 'using', 'a', 'threecircuit', 'energy', 'storage', 'model', 'to', 'account', 'for', 'steadystate', 'energy', 'losses', 'with', 'numerical', 'experiments', 'the', 'controller', 'is', 'evaluated', 'with', 'real', 'household', 'consumption', 'data', 'using', 'a', 'stateoftheart', 'adversarial', 'algorithm', 'results', 'show', 'that', 'the', 'state', 'estimation', 'of', 'the', 'energy', 'storage', 'system', 'significantly', 'affects', 'the', 'controllers', 'performance', 'the', 'results', 'also', 'show', 'that', 'the', 'privacy', 'leakage', 'can', 'be', 'effectively', 'reduced', 'using', 'an', 'energy', 'storage', 'system', 'but', 'at', 'the', 'expense', 'of', 'energy', 'loss']]
|
[-0.13283708676264236, 0.003572718727040839, -0.060238113683625694, 0.046871014555530034, -0.019905454774455326, -0.19004909036590195, 0.09191341153667801, 0.38893160869072124, -0.3129442211513112, -0.368105259595242, 0.12837350012119803, -0.28379898005717896, -0.08123635001314002, 0.229862219197827, -0.14663793237092412, 0.1341949593790663, 0.10353256359211797, 0.033058113638099615, -0.01615624137722501, -0.2533152194985196, 0.2762398083213474, 0.15090822290659436, 0.36351443381934634, 0.04693323135285116, 0.12194520399462795, -0.016636598747359906, 0.03964100444946832, 0.01111129801379653, -0.10277456648203419, 0.12630571662713358, 0.28207698351574867, 0.1606449496788465, 0.3251809933510556, -0.4514561892918697, -0.23768295758835425, 0.1254859706235489, 0.08867157109051459, 0.1094433962617342, -0.10961431270934702, -0.2533192995337512, 0.06956901188515793, -0.2557443378235751, -0.08201858988864635, -0.12333251221006196, -0.07053920296607614, 0.060828592378373555, -0.3092600173218463, 0.04218865853400212, 0.000731646560314225, 0.04648690521565637, -0.13394421831386663, -0.09199287095088209, -0.044663009366278, 0.10432870758364235, 0.004101731056324774, -0.05473301857634167, 0.20613044613288012, -0.13279809469803866, -0.14055622015261976, 0.32555167654877515, -0.018594676221728446, -0.22388600391464505, 0.09906988328784644, -0.037815623265516955, -0.050570727015535034, 0.14458291659158148, 0.226885961062025, 0.04586683390889226, -0.20003705404365693, 0.04058245454708538, 0.02494584712222582, 0.25047552419023783, 0.005401575301841992, 0.08736170795784007, 0.10467155037894542, 0.224297211997635, 0.15283712664073923, 0.13456822914256888, -0.09672795100576752, -0.10955588822253048, -0.26267561887398483, -0.1301206182764192, -0.16953310283748962, 0.029831411226130113, -0.07131456166902857, -0.07541701744302987, 0.35855836353862913, 0.2000960256503062, 0.14244369762741185, 0.09750320610393415, 0.45817549335883884, 0.14667535313060584, 0.06489732794982297, 0.1678986664884156, 0.22765400439876557, -0.017276659231193786, 0.1723152481519231, -0.2694978557443776, 0.0993402584690631, -0.0423849451666077]
|
1,803.07865
|
Norm Estimates for $\tau$-Pseudodifferential Operators in Wiener Amalgam
and Modulation Spaces
|
We study continuity properties on modulation spaces for
$\tau$-pseudodifferential operators with symbols $a$ in Wiener amalgam spaces.
We obtain boundedness results for $\tau \in (0,1)$ whereas, in the end-points
$\tau=0$ and $\tau=1$, the corresponding operators are in general unbounded.
Furthermore, for $\tau \in (0,1)$, we exhibit a function of $\tau$ which is an
upper bound for the operator norm.
The continuity properties of $\tau$-pseudodifferential operators, for any
$\tau\in [0,1]$, with symbols $a$ in modulation spaces are well known. Here we
find an upper bound for the operator norm which does not depend on the
parameter $\tau \in [0,1]$, as expected. Key ingredients are uniform continuity
estimates for $\tau$-Wigner distributions.
|
math.FA
|
we study continuity properties on modulation spaces for taupseudodifferential operators with symbols a in wiener amalgam spaces we obtain boundedness results for tau in 01 whereas in the endpoints tau0 and tau1 the corresponding operators are in general unbounded furthermore for tau in 01 we exhibit a function of tau which is an upper bound for the operator norm the continuity properties of taupseudodifferential operators for any tauin 01 with symbols a in modulation spaces are well known here we find an upper bound for the operator norm which does not depend on the parameter tau in 01 as expected key ingredients are uniform continuity estimates for tauwigner distributions
|
[['we', 'study', 'continuity', 'properties', 'on', 'modulation', 'spaces', 'for', 'taupseudodifferential', 'operators', 'with', 'symbols', 'a', 'in', 'wiener', 'amalgam', 'spaces', 'we', 'obtain', 'boundedness', 'results', 'for', 'tau', 'in', '01', 'whereas', 'in', 'the', 'endpoints', 'tau0', 'and', 'tau1', 'the', 'corresponding', 'operators', 'are', 'in', 'general', 'unbounded', 'furthermore', 'for', 'tau', 'in', '01', 'we', 'exhibit', 'a', 'function', 'of', 'tau', 'which', 'is', 'an', 'upper', 'bound', 'for', 'the', 'operator', 'norm', 'the', 'continuity', 'properties', 'of', 'taupseudodifferential', 'operators', 'for', 'any', 'tauin', '01', 'with', 'symbols', 'a', 'in', 'modulation', 'spaces', 'are', 'well', 'known', 'here', 'we', 'find', 'an', 'upper', 'bound', 'for', 'the', 'operator', 'norm', 'which', 'does', 'not', 'depend', 'on', 'the', 'parameter', 'tau', 'in', '01', 'as', 'expected', 'key', 'ingredients', 'are', 'uniform', 'continuity', 'estimates', 'for', 'tauwigner', 'distributions']]
|
[-0.11182804409138582, 0.16770672568047842, -0.05703673072868561, 0.13469006035463987, -0.04379727977923014, -0.08942150719101644, 0.034700190432852614, 0.37449648878019715, -0.2873022980401637, -0.22346949622388584, 0.16967427040368352, -0.286257971526572, -0.09356997934756456, 0.2300372611325993, -0.08819469068354617, 0.06623507993882177, 0.01039456730035858, 0.08282911742679533, -0.16129492751874583, -0.1944984092152919, 0.36228796639652167, -0.02144250467730065, 0.17319443668842455, 0.06540478881517495, 0.039573380499388335, -0.012678648371042477, -0.020338396011437807, -0.09640328068268934, -0.20886148533921828, 0.07914764907521506, 0.18178100973212472, 0.06700781305079107, 0.2230670549173805, -0.3519761946086806, -0.17234701514071613, 0.17388422181506435, 0.14476750063692667, -0.05096424901556155, -0.02266654061127661, -0.25276196413432006, 0.10693356226612297, -0.0837036564954798, -0.11520773362092397, -0.05263604991206968, 0.08393365826621582, 0.08812607988430601, -0.4025731211812753, 0.0880238970642461, 0.1207568785445161, 0.05041534313446997, -0.16792843334325072, -0.14802663727917847, 0.011213511648950063, 0.10282445927926649, -0.018791473852211818, 0.0553479899320303, 0.045879586677377425, -0.08874561351344541, -0.10907559020927658, 0.30465437651232435, -0.12635095082482117, -0.3014505358619822, 0.10909880660646767, -0.2121055345137224, -0.15504219578320366, 0.060220811826487385, 0.14709156333723244, 0.1567068700592413, -0.10556124282690386, 0.16924074475806533, -0.050785618763054825, 0.16852610477211852, 0.07151397016692769, 0.16351933439997351, 0.05831952963921207, 0.09887414735190019, 0.19382955537595856, 0.10858136481234666, -0.04010466462932527, -0.05321998279854328, -0.381096974429157, -0.1736815897068785, -0.16949126716806656, 0.05262874353354197, -0.13331666486151839, -0.19917366032799086, 0.3291999894782849, 0.0900278356814481, 0.22528804279863834, 0.129535036241308, 0.21495287082399483, 0.20903819397466983, 0.0555685015860945, 0.09458847604778216, 0.20470959669479202, 0.1611392324514411, 0.07793607612795851, -0.1179019679893153, 0.08485937808398847, 0.1666895147430262]
|
1,803.07866
|
Downlink Non-Orthogonal Multiple Access (NOMA) in Poisson Networks
|
A network model is considered where Poisson distributed base stations
transmit to $N$ power-domain non-orthogonal multiple access (NOMA) users (UEs)
each {that employ successive interference cancellation (SIC) for decoding}. We
propose three models for the clustering of NOMA UEs and consider two different
ordering techniques for the NOMA UEs: mean signal power-based and instantaneous
signal-to-intercell-interference-and-noise-ratio-based. For each technique, we
present a signal-to-interference-and-noise ratio analysis for the coverage of
the typical UE. We plot the rate region for the two-user case and show that
neither ordering technique is consistently superior to the other. We propose
two efficient algorithms for finding a feasible resource allocation that
maximize the cell sum rate $\mathcal{R}_{\rm tot}$, for general $N$,
constrained to: 1) a minimum throughput $\mathcal{T}$ for each UE, 2) identical
throughput for all UEs. We show the existence of: 1) an optimum $N$ that
maximizes the constrained $\mathcal{R}_{\rm tot}$ given a set of network
parameters, 2) a critical SIC level necessary for NOMA to outperform orthogonal
multiple access. The results highlight the importance in choosing the network
parameters $N$, the constraints, and the ordering technique to balance the
$\mathcal{R}_{\rm tot}$ and fairness requirements. We also show that
interference-aware UE clustering can significantly improve performance.
|
cs.IT math.IT
|
a network model is considered where poisson distributed base stations transmit to n powerdomain nonorthogonal multiple access noma users ues each that employ successive interference cancellation sic for decoding we propose three models for the clustering of noma ues and consider two different ordering techniques for the noma ues mean signal powerbased and instantaneous signaltointercellinterferenceandnoiseratiobased for each technique we present a signaltointerferenceandnoise ratio analysis for the coverage of the typical ue we plot the rate region for the twouser case and show that neither ordering technique is consistently superior to the other we propose two efficient algorithms for finding a feasible resource allocation that maximize the cell sum rate mathcalr_rm tot for general n constrained to 1 a minimum throughput mathcalt for each ue 2 identical throughput for all ues we show the existence of 1 an optimum n that maximizes the constrained mathcalr_rm tot given a set of network parameters 2 a critical sic level necessary for noma to outperform orthogonal multiple access the results highlight the importance in choosing the network parameters n the constraints and the ordering technique to balance the mathcalr_rm tot and fairness requirements we also show that interferenceaware ue clustering can significantly improve performance
|
[['a', 'network', 'model', 'is', 'considered', 'where', 'poisson', 'distributed', 'base', 'stations', 'transmit', 'to', 'n', 'powerdomain', 'nonorthogonal', 'multiple', 'access', 'noma', 'users', 'ues', 'each', 'that', 'employ', 'successive', 'interference', 'cancellation', 'sic', 'for', 'decoding', 'we', 'propose', 'three', 'models', 'for', 'the', 'clustering', 'of', 'noma', 'ues', 'and', 'consider', 'two', 'different', 'ordering', 'techniques', 'for', 'the', 'noma', 'ues', 'mean', 'signal', 'powerbased', 'and', 'instantaneous', 'signaltointercellinterferenceandnoiseratiobased', 'for', 'each', 'technique', 'we', 'present', 'a', 'signaltointerferenceandnoise', 'ratio', 'analysis', 'for', 'the', 'coverage', 'of', 'the', 'typical', 'ue', 'we', 'plot', 'the', 'rate', 'region', 'for', 'the', 'twouser', 'case', 'and', 'show', 'that', 'neither', 'ordering', 'technique', 'is', 'consistently', 'superior', 'to', 'the', 'other', 'we', 'propose', 'two', 'efficient', 'algorithms', 'for', 'finding', 'a', 'feasible', 'resource', 'allocation', 'that', 'maximize', 'the', 'cell', 'sum', 'rate', 'mathcalr_rm', 'tot', 'for', 'general', 'n', 'constrained', 'to', '1', 'a', 'minimum', 'throughput', 'mathcalt', 'for', 'each', 'ue', '2', 'identical', 'throughput', 'for', 'all', 'ues', 'we', 'show', 'the', 'existence', 'of', '1', 'an', 'optimum', 'n', 'that', 'maximizes', 'the', 'constrained', 'mathcalr_rm', 'tot', 'given', 'a', 'set', 'of', 'network', 'parameters', '2', 'a', 'critical', 'sic', 'level', 'necessary', 'for', 'noma', 'to', 'outperform', 'orthogonal', 'multiple', 'access', 'the', 'results', 'highlight', 'the', 'importance', 'in', 'choosing', 'the', 'network', 'parameters', 'n', 'the', 'constraints', 'and', 'the', 'ordering', 'technique', 'to', 'balance', 'the', 'mathcalr_rm', 'tot', 'and', 'fairness', 'requirements', 'we', 'also', 'show', 'that', 'interferenceaware', 'ue', 'clustering', 'can', 'significantly', 'improve', 'performance']]
|
[-0.24906033801673047, 0.004925770539484436, -0.013371322767331672, 0.057564227192442696, -0.052753389314584544, -0.25451350966047254, 0.15938483948711699, 0.3941401744661525, -0.2591484425842163, -0.27033798293539335, 0.022318363179752238, -0.23877835501191305, -0.15408273913836734, 0.08945916103896447, -0.05865827077504215, 0.03446638749224419, 0.05839719361831532, 0.056718775948706134, -0.053695851798875996, -0.2830708053854561, 0.26196113771269913, 0.12972453421440405, 0.39490490237335163, 0.02147406079612167, 0.08236534466988046, 0.041430424318541235, 0.010969222459506862, -0.01674300075880715, -0.12375560898457955, 0.06783225672698613, 0.31559068761993303, 0.23694457365293523, 0.27298260488589504, -0.37682600673194505, -0.220158784583576, 0.09612159415770641, 0.18685175360054077, -0.001304366714765678, -0.01684238622433052, -0.20090426082123802, 0.18169704099635045, -0.22494662746824512, -0.013329805959549607, 0.01802963867371705, -0.07117453651811609, 0.07093588089986924, -0.4287565145922366, 0.013711377834268242, -0.02353605441047094, -0.005949171768950682, -0.06923580408943396, -0.188479236424807, 0.03739110860229475, 0.16954053996888988, 0.00025181564263737383, -0.013008930149866062, 0.09512123223932357, -0.06452563064127234, -0.1349212028256183, 0.3707914935172203, 0.01029352260631832, -0.23359328911326188, 0.13905328810542597, -0.0956379466282962, -0.14322158039533464, 0.14660819332073233, 0.1932232804852655, 0.09114338731365138, -0.16810695618512717, -0.006175696577504745, -0.032108797382881596, 0.1520468730540319, 0.09343988399007287, 0.09694989159762925, 0.13570706697646528, 0.1818154455682066, 0.18520440814791986, 0.09549022695177174, -0.14475070329233256, -0.06795871957677917, -0.23845388593875227, -0.13167866059209235, -0.199381307240145, 0.004198529392737666, -0.14986930909441099, -0.054991948591479704, 0.36362828373272515, 0.15253888037121252, 0.1633784307925096, 0.15667081682067646, 0.3757568293779939, 0.10794451258014524, 0.03900131345469149, 0.13377581189863907, 0.16685558792177924, 0.06871413240231451, 0.0897435690460966, -0.25203276656149187, 0.025683182819357993, 0.012182303269080182]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.