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.07667
|
Edgeworth expansions for weakly dependent random variables
|
We discuss sufficient conditions that guarantee the existence of asymptotic
expansions for the Central Limit Theorem for weakly dependent random variables
including observations arising from sufficiently chaotic dynamical systems like
piece-wise expanding maps, and strongly ergodic Markov chains. We primarily use
spectral techniques to obtain the results.
|
math.PR math.DS
|
we discuss sufficient conditions that guarantee the existence of asymptotic expansions for the central limit theorem for weakly dependent random variables including observations arising from sufficiently chaotic dynamical systems like piecewise expanding maps and strongly ergodic markov chains we primarily use spectral techniques to obtain the results
|
[['we', 'discuss', 'sufficient', 'conditions', 'that', 'guarantee', 'the', 'existence', 'of', 'asymptotic', 'expansions', 'for', 'the', 'central', 'limit', 'theorem', 'for', 'weakly', 'dependent', 'random', 'variables', 'including', 'observations', 'arising', 'from', 'sufficiently', 'chaotic', 'dynamical', 'systems', 'like', 'piecewise', 'expanding', 'maps', 'and', 'strongly', 'ergodic', 'markov', 'chains', 'we', 'primarily', 'use', 'spectral', 'techniques', 'to', 'obtain', 'the', 'results']]
|
[-0.14276538670380065, 0.15451364250893287, -0.11118776680148662, 0.11612193643095646, -0.032120869608913014, -0.14784160360664209, 0.06601544530403385, 0.34742331445375657, -0.27060659364499945, -0.16314958424327222, 0.22949739065060906, -0.22562295469911176, -0.1516898086571947, 0.21807261710946865, -0.03926321635260544, 0.07920600991062027, 0.08905078541051517, -0.011589133160862517, -0.09239484766557654, -0.19000099713795204, 0.3329098241284807, 0.0032818901174245995, 0.24314352402344663, 0.009634377553741982, 0.12008191504456261, 0.05818479947072077, -0.06952492359213214, 0.00040509732702667726, -0.213360928242532, 0.0926783932174774, 0.24007624998054605, 0.11081994621162401, 0.2242737804358996, -0.3961601140017205, -0.2084739482268057, 0.16573850049617442, 0.13993023020869239, 0.09662395955882025, -0.013957679809190016, -0.28708068959097915, 0.08572993623687232, -0.1220150922147676, -0.21031043124682408, -0.1439048500652326, -0.038637967205586585, 0.16679695738043557, -0.32840548328896785, 0.08957892297668026, 0.16756983571673467, 0.0646857978340159, -0.07092656902572576, -0.04027739672505475, -0.0008618999867046133, 0.1143613306277907, 0.042772769214625056, -0.06044816245582509, 0.14243891925868044, -0.09217469196053261, -0.08407123790598138, 0.30824915771471695, -0.14542850188940684, -0.19186150789894957, 0.29960401937306086, -0.16934761103797466, -0.26085890736430883, 0.1351098896975213, 0.16909301839768887, 0.12550485074183249, -0.15893179511136196, 0.14523776814197883, -0.031008746494796683, 0.14728599866019917, 0.05753479939588207, 0.10576218760948866, 0.18155696746358213, 0.05629785030961354, 0.12720644500780295, 0.17394380388840874, -0.02454287169421924, -0.15965725291282573, -0.2801286448784014, -0.03630423753898829, -0.15885038317200986, 0.07953679692396458, -0.16477557587743233, -0.23550995474958675, 0.3193905391789814, 0.15950157419045238, 0.17469747380373327, 0.13126443876845248, 0.204681474755102, 0.17063232324398223, -0.06252424250495561, 0.08963915668031637, 0.15826366650822393, 0.2548338457882563, 0.09466799740937162, -0.16540857877314805, 0.032588028893905115, 0.13186742768603119]
|
1,803.07668
|
Hybrid asymptotic/numerical methods for the evaluation of layer heat
potentials in two dimensions
|
We present a hybrid asymptotic/numerical method for the accurate computation
of single and double layer heat potentials in two dimensions. It has been shown
in previous work that simple quadrature schemes suffer from a phenomenon called
"geometrically-induced stiffness," meaning that formally high-order accurate
methods require excessively small time steps before the rapid convergence rate
is observed. This can be overcome by analytic integration in time, requiring
the evaluation of a collection of spatial boundary integral operators with
non-physical, weakly singular kernels. In our hybrid scheme, we combine a local
asymptotic approximation with the evaluation of a few boundary integral
operators involving only Gaussian kernels, which are easily accelerated by a
new version of the fast Gauss transform. This new scheme is robust, avoids
geometrically-induced stiffness, and is easy to use in the presence of moving
geometries. Its extension to three dimensions is natural and straightforward,
and should permit layer heat potentials to become flexible and powerful tools
for modeling diffusion processes.
|
math.NA
|
we present a hybrid asymptoticnumerical method for the accurate computation of single and double layer heat potentials in two dimensions it has been shown in previous work that simple quadrature schemes suffer from a phenomenon called geometricallyinduced stiffness meaning that formally highorder accurate methods require excessively small time steps before the rapid convergence rate is observed this can be overcome by analytic integration in time requiring the evaluation of a collection of spatial boundary integral operators with nonphysical weakly singular kernels in our hybrid scheme we combine a local asymptotic approximation with the evaluation of a few boundary integral operators involving only gaussian kernels which are easily accelerated by a new version of the fast gauss transform this new scheme is robust avoids geometricallyinduced stiffness and is easy to use in the presence of moving geometries its extension to three dimensions is natural and straightforward and should permit layer heat potentials to become flexible and powerful tools for modeling diffusion processes
|
[['we', 'present', 'a', 'hybrid', 'asymptoticnumerical', 'method', 'for', 'the', 'accurate', 'computation', 'of', 'single', 'and', 'double', 'layer', 'heat', 'potentials', 'in', 'two', 'dimensions', 'it', 'has', 'been', 'shown', 'in', 'previous', 'work', 'that', 'simple', 'quadrature', 'schemes', 'suffer', 'from', 'a', 'phenomenon', 'called', 'geometricallyinduced', 'stiffness', 'meaning', 'that', 'formally', 'highorder', 'accurate', 'methods', 'require', 'excessively', 'small', 'time', 'steps', 'before', 'the', 'rapid', 'convergence', 'rate', 'is', 'observed', 'this', 'can', 'be', 'overcome', 'by', 'analytic', 'integration', 'in', 'time', 'requiring', 'the', 'evaluation', 'of', 'a', 'collection', 'of', 'spatial', 'boundary', 'integral', 'operators', 'with', 'nonphysical', 'weakly', 'singular', 'kernels', 'in', 'our', 'hybrid', 'scheme', 'we', 'combine', 'a', 'local', 'asymptotic', 'approximation', 'with', 'the', 'evaluation', 'of', 'a', 'few', 'boundary', 'integral', 'operators', 'involving', 'only', 'gaussian', 'kernels', 'which', 'are', 'easily', 'accelerated', 'by', 'a', 'new', 'version', 'of', 'the', 'fast', 'gauss', 'transform', 'this', 'new', 'scheme', 'is', 'robust', 'avoids', 'geometricallyinduced', 'stiffness', 'and', 'is', 'easy', 'to', 'use', 'in', 'the', 'presence', 'of', 'moving', 'geometries', 'its', 'extension', 'to', 'three', 'dimensions', 'is', 'natural', 'and', 'straightforward', 'and', 'should', 'permit', 'layer', 'heat', 'potentials', 'to', 'become', 'flexible', 'and', 'powerful', 'tools', 'for', 'modeling', 'diffusion', 'processes']]
|
[-0.11060893649209337, 0.08356310150539792, -0.09577976708930934, 0.05680673485455502, -0.11250614042550047, -0.17019258839546803, 0.03603254431502182, 0.41497335566774657, -0.26339398068375885, -0.24471009605974883, 0.12043722687211027, -0.2116872918508623, -0.14589892430823898, 0.23048163266123636, -0.06946356131341626, 0.09925594706788243, 0.10186951658659563, -0.0035111055946590738, -0.07392552086464506, -0.20256935838633072, 0.2982770390172275, 0.041251793193742226, 0.27002837195535484, 0.043614724618802135, 0.11244743300662578, -0.020205305433710633, -0.03721577313769123, 0.01625400337734786, -0.07320108713832704, 0.1537702599372599, 0.2211261707479539, 0.05506334297708959, 0.2926630607187193, -0.4566722730845676, -0.25661924398671954, 0.08276756922642105, 0.16207161614373441, 0.11810182130053894, -0.045517515401957524, -0.23012905564413677, 0.0687145834892803, -0.16360560540104088, -0.1546622943465731, -0.16984449672911847, 0.0015931826645959608, 0.026888075834198027, -0.3154086987054126, 0.10708842432901541, 0.06027399667868425, 0.015032627408664604, -0.009244384771207152, -0.08190795798317431, 0.06190283234832774, 0.08547177616851542, 0.005526741365005511, 0.01740275656584627, 0.0898539146165485, -0.07294356644801471, -0.08386710487155719, 0.3211847460258937, -0.06520799515907716, -0.2613167907909442, 0.22009542663089976, -0.08851458190402352, -0.11979106502457065, 0.1791550261807275, 0.1459377426509485, 0.17089318663390898, -0.18230863508872502, 0.08783769477787862, 0.038015132470588596, 0.1456190177979908, 0.06919520908550168, 0.015606264656074113, 0.1462465158247198, 0.1518893728946677, 0.08032546058783065, 0.13235400331868957, -0.07606366993743718, -0.12722899116321196, -0.29420590377557354, -0.1788679029825447, -0.1684874742210883, 0.018271499895490706, -0.10011498036789665, -0.20365381258252793, 0.36200480753864467, 0.14432902637903827, 0.18390304480696687, 0.05380818560670321, 0.34490350276659826, 0.15085961582118887, 0.12312884833258779, 0.07607836979701653, 0.1907170390050789, 0.11585531480645078, 0.13079245657492314, -0.17421853784124675, 0.042432093026799074, 0.1174174255477438]
|
1,803.07669
|
A note on the complexity of evolutionary dynamics in a classic
consumer-resource model
|
We study how the complexity of evolutionary dynamics in the classic MacArthur
consumer-resource model depends on resource uptake and utilization rates. The
traditional assumption in such models is that the utilization rate of the
consumer is proportional to the uptake rate. More generally, we show that if
these two rates are related through a power law (which includes the traditional
assumption as a special case), then the resulting evolutionary dynamics in the
consumer is necessarily a simple hill-climbing process leading to an
evolutionary equilibrium, regardless of the dimension of phenotype space. When
utilization and uptake rates are not related by a power law, more complex
evolutionary trajectories can occur, including the chaotic dynamics observed in
previous studies for high-dimensional phenotype spaces. These results draw
attention to the importance of distinguishing between utilization and uptake
rates in consumer-resource models.
|
q-bio.PE cond-mat.stat-mech
|
we study how the complexity of evolutionary dynamics in the classic macarthur consumerresource model depends on resource uptake and utilization rates the traditional assumption in such models is that the utilization rate of the consumer is proportional to the uptake rate more generally we show that if these two rates are related through a power law which includes the traditional assumption as a special case then the resulting evolutionary dynamics in the consumer is necessarily a simple hillclimbing process leading to an evolutionary equilibrium regardless of the dimension of phenotype space when utilization and uptake rates are not related by a power law more complex evolutionary trajectories can occur including the chaotic dynamics observed in previous studies for highdimensional phenotype spaces these results draw attention to the importance of distinguishing between utilization and uptake rates in consumerresource models
|
[['we', 'study', 'how', 'the', 'complexity', 'of', 'evolutionary', 'dynamics', 'in', 'the', 'classic', 'macarthur', 'consumerresource', 'model', 'depends', 'on', 'resource', 'uptake', 'and', 'utilization', 'rates', 'the', 'traditional', 'assumption', 'in', 'such', 'models', 'is', 'that', 'the', 'utilization', 'rate', 'of', 'the', 'consumer', 'is', 'proportional', 'to', 'the', 'uptake', 'rate', 'more', 'generally', 'we', 'show', 'that', 'if', 'these', 'two', 'rates', 'are', 'related', 'through', 'a', 'power', 'law', 'which', 'includes', 'the', 'traditional', 'assumption', 'as', 'a', 'special', 'case', 'then', 'the', 'resulting', 'evolutionary', 'dynamics', 'in', 'the', 'consumer', 'is', 'necessarily', 'a', 'simple', 'hillclimbing', 'process', 'leading', 'to', 'an', 'evolutionary', 'equilibrium', 'regardless', 'of', 'the', 'dimension', 'of', 'phenotype', 'space', 'when', 'utilization', 'and', 'uptake', 'rates', 'are', 'not', 'related', 'by', 'a', 'power', 'law', 'more', 'complex', 'evolutionary', 'trajectories', 'can', 'occur', 'including', 'the', 'chaotic', 'dynamics', 'observed', 'in', 'previous', 'studies', 'for', 'highdimensional', 'phenotype', 'spaces', 'these', 'results', 'draw', 'attention', 'to', 'the', 'importance', 'of', 'distinguishing', 'between', 'utilization', 'and', 'uptake', 'rates', 'in', 'consumerresource', 'models']]
|
[-0.09250436411947822, 0.12009411707507409, -0.06167073586982661, 0.08904095570541477, -0.04566376454844747, -0.13335388468956386, 0.06140904657650685, 0.37957361333774053, -0.28362872530503763, -0.2585393298194622, 0.10876751266524493, -0.22434761980379783, -0.19530045912277116, 0.21634648436430734, -0.10899089184670668, -0.0003967536714575861, 0.05451753436574253, 0.041509072174844536, 0.012438542710657677, -0.27360691932667774, 0.3038945419754347, 0.09432885711472752, 0.3399510434963673, 0.018572447301846914, 0.03547206185116986, -0.041284360335734877, -0.027019008668477014, 0.005251242161477052, -0.13587393878633916, 0.12370282317093317, 0.25583450518704764, 0.1908671363590933, 0.2964165870613162, -0.41633007217846485, -0.23753527334622998, 0.16460949777072106, 0.1202541250883993, 0.07871155275716919, -0.05081527713332764, -0.17820611487284466, 0.055650552923696625, -0.17111650265186376, -0.09700147142849755, -0.06729281696059025, 0.030421445414464433, 0.07218254820369455, -0.27524920122738444, 0.11081580357437117, 0.05302973833623464, 0.03156218250228119, -0.08080224652329217, -0.08795934863577502, -0.06610332154061484, 0.16291430386890948, 0.08621022316515008, -0.028096728743917807, 0.15807235544290987, -0.1672939273117083, -0.1250080898221906, 0.3898159027659753, -0.025045164803420936, -0.2310806198477529, 0.23630409318602819, -0.13088683822475697, -0.11828080158464718, 0.10974148682241018, 0.18504072818905115, 0.1124257262125721, -0.15215899761434243, 0.0511108728221017, 0.02044740849700959, 0.1792259412004437, 0.028516788750994896, 0.03185935093737815, 0.17115400033746508, 0.21565893016404647, 0.05210114743533558, 0.10063524539683662, -0.04931576386856698, -0.2183433198315206, -0.20077581316286672, -0.13791464707152784, -0.12822729736512553, 0.07835218357270249, -0.10592526069851137, -0.12031774949687331, 0.3796998645023753, 0.1158227678169024, 0.19050511352353447, 0.10267168182147451, 0.286713863061606, 0.11699058848983217, 0.04726941641960023, 0.05799397965555714, 0.19718497079810587, 0.0696045299536427, 0.10545705198107855, -0.25833669323069247, 0.1569633386604002, 0.036827685940754265]
|
1,803.0767
|
Comments on the double copy construction for gravitational theories
|
We revisit the double copy description for linearized gravity and point out
various technical issues and subtleties, associated with setting up the double
copy description, including the problem of matching degrees of freedom on both
sides of the double copy dictionary and the related issue of the constraint
between graviton and dilaton sources. We introduce and discuss possible
resolutions of these issues.
|
hep-th
|
we revisit the double copy description for linearized gravity and point out various technical issues and subtleties associated with setting up the double copy description including the problem of matching degrees of freedom on both sides of the double copy dictionary and the related issue of the constraint between graviton and dilaton sources we introduce and discuss possible resolutions of these issues
|
[['we', 'revisit', 'the', 'double', 'copy', 'description', 'for', 'linearized', 'gravity', 'and', 'point', 'out', 'various', 'technical', 'issues', 'and', 'subtleties', 'associated', 'with', 'setting', 'up', 'the', 'double', 'copy', 'description', 'including', 'the', 'problem', 'of', 'matching', 'degrees', 'of', 'freedom', 'on', 'both', 'sides', 'of', 'the', 'double', 'copy', 'dictionary', 'and', 'the', 'related', 'issue', 'of', 'the', 'constraint', 'between', 'graviton', 'and', 'dilaton', 'sources', 'we', 'introduce', 'and', 'discuss', 'possible', 'resolutions', 'of', 'these', 'issues']]
|
[-0.13999986349635066, 0.06911813645368262, -0.025091713474642847, 0.0884900378784345, -0.08161966221767568, -0.14483372138197265, 0.09244125973688619, 0.3032646545118863, -0.28317584205539, -0.3183012672009007, 0.11697313586069692, -0.320144159043388, -0.14550214592788008, 0.12409755674701545, -0.11453789648329539, 0.022875480383874908, 0.07652562065050006, 0.030719608564170137, -0.08117182608487294, -0.21479421254480258, 0.39515403778322283, 0.04205440641230633, 0.25764788458904914, 0.07233166868888563, 0.15404491337587037, 0.05227631965892449, -0.10030610673129559, -0.018836936507854733, -0.15879476101479434, 0.11163777491310611, 0.18195937060931278, 0.13528517012544458, 0.22068716494006016, -0.4269512856769706, -0.1668014441797089, 0.06873119239424987, 0.10928784393810577, 0.12167652062095341, -0.03599277850157852, -0.22524170850069383, 0.04831547866154823, -0.1274293685752538, -0.15657766383036129, -0.08484304130017277, -0.05554359382198703, -0.03189313330597455, -0.18131945168809785, 0.049064542662592664, 0.03839369593638806, 0.015818566534548037, 0.003945033982275955, -0.14060660735553793, 0.024802047411926213, 0.11057177404572646, 0.12130230592728983, 0.011983551821040531, 0.08763244291467051, -0.21735289541163272, -0.16406380478292704, 0.3911677896676044, -0.014557958986129492, -0.20672424690377328, 0.1609375028187529, -0.11976325396268118, -0.183486373651953, 0.06007753285549341, 0.11857719554926359, 0.11759392056433905, -0.1235947135926014, 0.15452555818915098, 0.011261385835466846, 0.14083585560917028, 0.15908143498123653, 0.13425461521312113, 0.2585632370844964, 0.095511730084376, 0.04431389977464512, 0.18603794634222023, -0.08320437580245667, -0.1373277242875643, -0.4078678786754608, -0.11122982588506514, -0.030649375350725268, 0.02937160095860881, -0.11767866600547999, -0.15785887747939165, 0.405582747932884, 0.11664514064661137, 0.1655710111822813, 0.004230509211699809, 0.24906731309789804, 0.06721683672719425, 0.05480838387513593, 0.026913639413373124, 0.1789924725589733, 0.16382225059093006, 0.025469310835227764, -0.26501810642319823, -0.08575796643872896, 0.07461206960461793]
|
1,803.07671
|
Multi-Modal Geometric Learning for Grasping and Manipulation
|
This work provides an architecture that incorporates depth and tactile
information to create rich and accurate 3D models useful for robotic
manipulation tasks. This is accomplished through the use of a 3D convolutional
neural network (CNN). Offline, the network is provided with both depth and
tactile information and trained to predict the object's geometry, thus filling
in regions of occlusion. At runtime, the network is provided a partial view of
an object. Tactile information is acquired to augment the captured depth
information. The network can then reason about the object's geometry by
utilizing both the collected tactile and depth information. We demonstrate that
even small amounts of additional tactile information can be incredibly helpful
in reasoning about object geometry. This is particularly true when information
from depth alone fails to produce an accurate geometric prediction. Our method
is benchmarked against and outperforms other visual-tactile approaches to
general geometric reasoning. We also provide experimental results comparing
grasping success with our method.
|
cs.RO
|
this work provides an architecture that incorporates depth and tactile information to create rich and accurate 3d models useful for robotic manipulation tasks this is accomplished through the use of a 3d convolutional neural network cnn offline the network is provided with both depth and tactile information and trained to predict the objects geometry thus filling in regions of occlusion at runtime the network is provided a partial view of an object tactile information is acquired to augment the captured depth information the network can then reason about the objects geometry by utilizing both the collected tactile and depth information we demonstrate that even small amounts of additional tactile information can be incredibly helpful in reasoning about object geometry this is particularly true when information from depth alone fails to produce an accurate geometric prediction our method is benchmarked against and outperforms other visualtactile approaches to general geometric reasoning we also provide experimental results comparing grasping success with our method
|
[['this', 'work', 'provides', 'an', 'architecture', 'that', 'incorporates', 'depth', 'and', 'tactile', 'information', 'to', 'create', 'rich', 'and', 'accurate', '3d', 'models', 'useful', 'for', 'robotic', 'manipulation', 'tasks', 'this', 'is', 'accomplished', 'through', 'the', 'use', 'of', 'a', '3d', 'convolutional', 'neural', 'network', 'cnn', 'offline', 'the', 'network', 'is', 'provided', 'with', 'both', 'depth', 'and', 'tactile', 'information', 'and', 'trained', 'to', 'predict', 'the', 'objects', 'geometry', 'thus', 'filling', 'in', 'regions', 'of', 'occlusion', 'at', 'runtime', 'the', 'network', 'is', 'provided', 'a', 'partial', 'view', 'of', 'an', 'object', 'tactile', 'information', 'is', 'acquired', 'to', 'augment', 'the', 'captured', 'depth', 'information', 'the', 'network', 'can', 'then', 'reason', 'about', 'the', 'objects', 'geometry', 'by', 'utilizing', 'both', 'the', 'collected', 'tactile', 'and', 'depth', 'information', 'we', 'demonstrate', 'that', 'even', 'small', 'amounts', 'of', 'additional', 'tactile', 'information', 'can', 'be', 'incredibly', 'helpful', 'in', 'reasoning', 'about', 'object', 'geometry', 'this', 'is', 'particularly', 'true', 'when', 'information', 'from', 'depth', 'alone', 'fails', 'to', 'produce', 'an', 'accurate', 'geometric', 'prediction', 'our', 'method', 'is', 'benchmarked', 'against', 'and', 'outperforms', 'other', 'visualtactile', 'approaches', 'to', 'general', 'geometric', 'reasoning', 'we', 'also', 'provide', 'experimental', 'results', 'comparing', 'grasping', 'success', 'with', 'our', 'method']]
|
[-0.04117478971492569, -0.004838621261864227, -0.09009069641144161, 0.06305528634576327, -0.15968287079565743, -0.20396320599734596, -0.009147716795955345, 0.44635923164633085, -0.26667026439447356, -0.35993083168711487, 0.09657110415440076, -0.2571030131002314, -0.21564670689052567, 0.21630559108987357, -0.18229679111098437, 0.06123567305639995, 0.13988186772209857, 0.07883269738851835, -0.055742892837913345, -0.2529322097441123, 0.29395489781251494, 0.05856512322342433, 0.2891213543619375, 0.053927147618945945, 0.16351614436632572, 0.015121672583638498, -0.04537417564421025, 0.04210678832722629, -0.07237613987393235, 0.22516123711354094, 0.3005294051945384, 0.2160354207076554, 0.23198530903238357, -0.46129515200103605, -0.24358873717111987, 0.03920879914372597, 0.12448265604288962, 0.15838427653934503, -0.015202272252864996, -0.39913740739484066, 0.10288192933343304, -0.13051888719054652, -0.05097331538058396, -0.14839821222162097, -0.010989516815346366, -0.06798124789851923, -0.3061484215581942, 0.01101079298920619, 0.06577930023634525, 0.11321899056018758, -0.05897310089448807, -0.05636002159964457, -0.0018008650052097608, 0.2257698989620084, -0.037970203907212896, 0.054773466366507206, 0.1815676548307375, -0.22374092370605553, -0.08741493348863984, 0.3329569129566164, 0.01228745868312394, -0.2125686259984929, 0.189448006225621, -0.049647495067098514, -0.0861907296326398, 0.14229222139601344, 0.192987062726697, 0.10622613954009288, -0.1583214602130209, -0.02441313277209564, -0.029748329498113936, 0.24414430810109297, 0.019235992289452854, 0.02408827899745812, 0.2195534742116612, 0.2580933475079097, 0.030282961813814985, 0.1434376370055607, -0.16662795640785927, -0.042047090507727466, -0.21217056807517162, -0.1137304940411408, -0.19576627071126826, -0.013650043890957936, -0.1257490805257258, -0.08571754614295403, 0.348668117521319, 0.2651685112501559, 0.21470344741389435, 0.08796736277909305, 0.39435888362943, 0.007650939655437504, 0.09380375819702474, 0.07899142820212357, 0.19011458531373515, 0.03960847959607699, 0.1512732164518404, -0.14628135259834313, 0.11949292650452153, 0.0290991944413187]
|
1,803.07672
|
Variability of Brown Dwarfs
|
Brown dwarfs constitute a missing link between low-mass stars and giant
planets. Their atmospheres display chemical species typical of planets, and one
could wonder whether they also have weather-like patterns. While brown dwarf
surface features cannot be directly resolved, the photometric and spectroscopic
modulations induced by these features, as they rotate in and out of view,
provide a wealth of information on the evolution of their atmosphere. A review
of brown dwarfs variability through the L, T and Y spectral types sequence is
presented, as well as the constraints that they set on the nature of
weather-like patterns on their surface.
|
astro-ph.SR astro-ph.EP
|
brown dwarfs constitute a missing link between lowmass stars and giant planets their atmospheres display chemical species typical of planets and one could wonder whether they also have weatherlike patterns while brown dwarf surface features cannot be directly resolved the photometric and spectroscopic modulations induced by these features as they rotate in and out of view provide a wealth of information on the evolution of their atmosphere a review of brown dwarfs variability through the l t and y spectral types sequence is presented as well as the constraints that they set on the nature of weatherlike patterns on their surface
|
[['brown', 'dwarfs', 'constitute', 'a', 'missing', 'link', 'between', 'lowmass', 'stars', 'and', 'giant', 'planets', 'their', 'atmospheres', 'display', 'chemical', 'species', 'typical', 'of', 'planets', 'and', 'one', 'could', 'wonder', 'whether', 'they', 'also', 'have', 'weatherlike', 'patterns', 'while', 'brown', 'dwarf', 'surface', 'features', 'can', 'not', 'be', 'directly', 'resolved', 'the', 'photometric', 'and', 'spectroscopic', 'modulations', 'induced', 'by', 'these', 'features', 'as', 'they', 'rotate', 'in', 'and', 'out', 'of', 'view', 'provide', 'a', 'wealth', 'of', 'information', 'on', 'the', 'evolution', 'of', 'their', 'atmosphere', 'a', 'review', 'of', 'brown', 'dwarfs', 'variability', 'through', 'the', 'l', 't', 'and', 'y', 'spectral', 'types', 'sequence', 'is', 'presented', 'as', 'well', 'as', 'the', 'constraints', 'that', 'they', 'set', 'on', 'the', 'nature', 'of', 'weatherlike', 'patterns', 'on', 'their', 'surface']]
|
[-0.08166054175144025, 0.17001262457822175, -0.12673068087657585, 0.13477849170186684, -0.14234711825117177, -0.08282661002914549, 0.12528798453550896, 0.38143834296394796, -0.20823375689032414, -0.37891875945177733, 0.07741431525438185, -0.285982020290605, -0.12339507560154386, 0.2038219926459943, -0.0881089891694251, -0.028893061760612123, 0.11817306637942024, -0.03581581153540516, -0.019141201314507236, -0.29297965987329827, 0.3221577479339698, 0.020749779230933272, 0.08870582834945298, -0.028059436341601553, 0.01672640916727045, -0.09459498645646461, -0.08456846084171797, -0.030860852052950683, -0.1592592071476033, 0.016245090694842385, 0.2546100482600285, 0.14081642763488286, 0.18714871726857096, -0.3813073973847078, -0.26673991438320965, 0.06297634593576339, 0.1586120159732744, 0.005303036492299654, -0.0349105849814163, -0.26862501900862246, 0.10785437152976644, -0.11908155717480672, -0.10900256823857918, -0.05686366065478354, 0.0559166215232336, 0.0770182000118189, -0.1875717678431458, 0.05563450756559249, 0.1345053926925175, 0.14436245903226674, -0.0792866641399907, -0.1535260685829117, -0.1182467008292602, 0.16016009092038752, 0.006132229533749541, -0.000601322245190614, 0.1458688326814559, -0.12387343969963052, -0.048409063588170445, 0.39979002007520664, -0.1166837722218285, -0.10582212744253304, 0.2988855211981846, -0.17111761872108808, -0.1279338458187732, 0.09121474233802919, 0.15348638638205753, 0.15186010832514832, -0.17980667324417143, -0.004181630638377814, -0.022969338869420337, 0.14636348655639106, 0.08152844480184071, 0.1333414914278204, 0.43535734414506483, 0.1168682045430543, 0.04691526377299691, 0.014032378335090755, -0.18851858361706356, -0.011472693160541501, -0.1940543441759313, -0.12545148327526653, -0.15787508071162829, 0.05783484824810419, -0.051458297602520735, -0.17196883155516915, 0.3607564325097437, 0.08148850306615178, 0.24456999286799236, -0.016498847590649828, 0.2617811104465349, 0.04678567717614807, 0.11560455544659977, 0.06137753803255584, 0.22197021659025373, 0.1685832141026599, 0.12313139506423955, -0.23580070888605334, 0.11760930888646957, 0.00014300860793274993]
|
1,803.07673
|
Ultra-Low Latency (ULL) Networks: The IEEE TSN and IETF DetNet Standards
and Related 5G ULL Research
|
Many network applications, e.g., industrial control, demand Ultra-Low Latency
(ULL). However, traditional packet networks can only reduce the end-to-end
latencies to the order of tens of milliseconds. The IEEE 802.1 Time Sensitive
Networking (TSN) standard and related research studies have sought to provide
link layer support for ULL networking, while the emerging IETF Deterministic
Networking (DetNet) standards seek to provide the complementary network layer
ULL support. This article provides an up-to-date comprehensive survey of the
IEEE TSN and IETF DetNet standards and the related research studies. The survey
of these standards and research studies is organized according to the main
categories of flow concept, flow synchronization, flow management, flow
control, and flow integrity. ULL networking mechanisms play a critical role in
the emerging fifth generation (5G) network access chain from wireless devices
via access, backhaul, and core networks. We survey the studies that
specifically target the support of ULL in 5G networks, with the main categories
of fronthaul, backhaul, and network management. Throughout, we identify the
pitfalls and limitations of the existing standards and research studies. This
survey can thus serve as a basis for the development of standards enhancements
and future ULL research studies that address the identified pitfalls and
limitations.
|
cs.NI
|
many network applications eg industrial control demand ultralow latency ull however traditional packet networks can only reduce the endtoend latencies to the order of tens of milliseconds the ieee 8021 time sensitive networking tsn standard and related research studies have sought to provide link layer support for ull networking while the emerging ietf deterministic networking detnet standards seek to provide the complementary network layer ull support this article provides an uptodate comprehensive survey of the ieee tsn and ietf detnet standards and the related research studies the survey of these standards and research studies is organized according to the main categories of flow concept flow synchronization flow management flow control and flow integrity ull networking mechanisms play a critical role in the emerging fifth generation 5g network access chain from wireless devices via access backhaul and core networks we survey the studies that specifically target the support of ull in 5g networks with the main categories of fronthaul backhaul and network management throughout we identify the pitfalls and limitations of the existing standards and research studies this survey can thus serve as a basis for the development of standards enhancements and future ull research studies that address the identified pitfalls and limitations
|
[['many', 'network', 'applications', 'eg', 'industrial', 'control', 'demand', 'ultralow', 'latency', 'ull', 'however', 'traditional', 'packet', 'networks', 'can', 'only', 'reduce', 'the', 'endtoend', 'latencies', 'to', 'the', 'order', 'of', 'tens', 'of', 'milliseconds', 'the', 'ieee', '8021', 'time', 'sensitive', 'networking', 'tsn', 'standard', 'and', 'related', 'research', 'studies', 'have', 'sought', 'to', 'provide', 'link', 'layer', 'support', 'for', 'ull', 'networking', 'while', 'the', 'emerging', 'ietf', 'deterministic', 'networking', 'detnet', 'standards', 'seek', 'to', 'provide', 'the', 'complementary', 'network', 'layer', 'ull', 'support', 'this', 'article', 'provides', 'an', 'uptodate', 'comprehensive', 'survey', 'of', 'the', 'ieee', 'tsn', 'and', 'ietf', 'detnet', 'standards', 'and', 'the', 'related', 'research', 'studies', 'the', 'survey', 'of', 'these', 'standards', 'and', 'research', 'studies', 'is', 'organized', 'according', 'to', 'the', 'main', 'categories', 'of', 'flow', 'concept', 'flow', 'synchronization', 'flow', 'management', 'flow', 'control', 'and', 'flow', 'integrity', 'ull', 'networking', 'mechanisms', 'play', 'a', 'critical', 'role', 'in', 'the', 'emerging', 'fifth', 'generation', '5g', 'network', 'access', 'chain', 'from', 'wireless', 'devices', 'via', 'access', 'backhaul', 'and', 'core', 'networks', 'we', 'survey', 'the', 'studies', 'that', 'specifically', 'target', 'the', 'support', 'of', 'ull', 'in', '5g', 'networks', 'with', 'the', 'main', 'categories', 'of', 'fronthaul', 'backhaul', 'and', 'network', 'management', 'throughout', 'we', 'identify', 'the', 'pitfalls', 'and', 'limitations', 'of', 'the', 'existing', 'standards', 'and', 'research', 'studies', 'this', 'survey', 'can', 'thus', 'serve', 'as', 'a', 'basis', 'for', 'the', 'development', 'of', 'standards', 'enhancements', 'and', 'future', 'ull', 'research', 'studies', 'that', 'address', 'the', 'identified', 'pitfalls', 'and', 'limitations']]
|
[-0.22881350437142323, -0.007690401136282126, 0.02865796856522228, 0.010915000415245754, -0.09681942279330723, -0.17678867025061115, 0.09505362484528047, 0.3711284445875352, -0.26431736530791416, -0.28010224134403067, 0.14880999371220385, -0.26322985608084587, -0.17805535863799107, 0.19890256016976246, -0.10158513794828317, 0.09998238404594952, 0.06120175473209895, -0.028524746846045727, 0.018485609546884673, -0.2419592636605116, 0.26983051829381227, 0.11359315983360947, 0.4463728778248671, 0.12357003290648802, -0.0004660440908542069, -0.047768033190289196, -0.09478215428788474, -0.06009473690754039, -0.130831864494401, 0.18681385664333874, 0.36580442823700166, 0.22049421325584154, 0.3414858290925622, -0.48450444064259823, -0.28544316274381365, 0.04533880659249971, 0.17031538913896396, 0.02499636622390129, -0.030788596034842994, -0.2883492086963304, 0.10571795869428471, -0.2616617899090697, -0.07883644289627273, -0.04498576126026801, -0.023445469917415983, 0.10527045029073742, -0.22077228685398356, -0.042371960651327735, -0.014330493913281082, 0.11044633110275141, -0.04690728606265741, -0.07517414475505305, 0.02323550783733994, 0.21914553844674242, 0.03147840508522632, 0.06754318514313216, 0.17531135864757547, -0.16723474593242943, -0.1514505495191644, 0.4143819324672222, 0.00735638554537632, -0.10356523844385797, 0.1685070095360187, 0.009671193307800459, -0.17297295912855887, 0.027025682011407128, 0.25304731067977754, -0.01220829930216406, -0.1964455263016026, 0.014404565821191997, 0.042331093147692116, 0.13272186386800086, 0.05439868985587676, 0.1002156884261951, 0.2100252214667046, 0.2667950860243106, 0.1299045799022868, 0.06577564647080063, -0.07163571614523113, -0.12120030011801916, -0.24622237359722246, -0.1367822800034491, -0.11607951422609242, 0.011257653846318999, -0.03478270626114278, -0.11635906067573105, 0.38120110925877154, 0.20526978091408124, 0.09753900183835021, 0.039827208057746734, 0.38401229784704083, 0.010219866252564226, 0.16292337022518905, 0.10492976864172827, 0.18733817895201246, 0.07282211910702731, 0.24686918316505813, -0.13880268295207937, 0.07387772676913013, -0.01708730070685765]
|
1,803.07674
|
Joule overheating poisons the fractional ac Josephson effect in
topological Josephson junctions
|
Topological Josephson junctions designed on the surface of a 3D-topological
insulator (TI) harbor Majorana bound states (MBS's) among a continuum of
conventional Andreev bound states. The distinct feature of these MBS's lies in
the $4\pi$-periodicity of their energy-phase relation that yields a fractional
ac Josephson effect and a suppression of odd Shapiro steps under $r\!f$
irradiation. Yet, recent experiments showed that a few, or only the first, odd
Shapiro steps are missing, casting doubts on the interpretation. Here, we show
that Josephson junctions tailored on the large bandgap 3D TI Bi$_2$Se$_3$
exhibit a fractional ac Josephson effect acting on the first Shapiro step only.
With a modified resistively shunted junction model, we demonstrate that the
resilience of higher order odd Shapiro steps can be accounted for by thermal
poisoning driven by Joule overheating. Furthermore, we uncover a residual
supercurrent at the nodes between Shapiro lobes, which provides a direct and
novel signature of the current carried by the MBS. Our findings showcase the
crucial role of thermal effects in topological Josephson junctions and lend
support to the Majorana origin of the partial suppression of odd Shapiro steps.
|
cond-mat.mes-hall cond-mat.supr-con
|
topological josephson junctions designed on the surface of a 3dtopological insulator ti harbor majorana bound states mbss among a continuum of conventional andreev bound states the distinct feature of these mbss lies in the 4piperiodicity of their energyphase relation that yields a fractional ac josephson effect and a suppression of odd shapiro steps under rf irradiation yet recent experiments showed that a few or only the first odd shapiro steps are missing casting doubts on the interpretation here we show that josephson junctions tailored on the large bandgap 3d ti bi_2se_3 exhibit a fractional ac josephson effect acting on the first shapiro step only with a modified resistively shunted junction model we demonstrate that the resilience of higher order odd shapiro steps can be accounted for by thermal poisoning driven by joule overheating furthermore we uncover a residual supercurrent at the nodes between shapiro lobes which provides a direct and novel signature of the current carried by the mbs our findings showcase the crucial role of thermal effects in topological josephson junctions and lend support to the majorana origin of the partial suppression of odd shapiro steps
|
[['topological', 'josephson', 'junctions', 'designed', 'on', 'the', 'surface', 'of', 'a', '3dtopological', 'insulator', 'ti', 'harbor', 'majorana', 'bound', 'states', 'mbss', 'among', 'a', 'continuum', 'of', 'conventional', 'andreev', 'bound', 'states', 'the', 'distinct', 'feature', 'of', 'these', 'mbss', 'lies', 'in', 'the', '4piperiodicity', 'of', 'their', 'energyphase', 'relation', 'that', 'yields', 'a', 'fractional', 'ac', 'josephson', 'effect', 'and', 'a', 'suppression', 'of', 'odd', 'shapiro', 'steps', 'under', 'rf', 'irradiation', 'yet', 'recent', 'experiments', 'showed', 'that', 'a', 'few', 'or', 'only', 'the', 'first', 'odd', 'shapiro', 'steps', 'are', 'missing', 'casting', 'doubts', 'on', 'the', 'interpretation', 'here', 'we', 'show', 'that', 'josephson', 'junctions', 'tailored', 'on', 'the', 'large', 'bandgap', '3d', 'ti', 'bi_2se_3', 'exhibit', 'a', 'fractional', 'ac', 'josephson', 'effect', 'acting', 'on', 'the', 'first', 'shapiro', 'step', 'only', 'with', 'a', 'modified', 'resistively', 'shunted', 'junction', 'model', 'we', 'demonstrate', 'that', 'the', 'resilience', 'of', 'higher', 'order', 'odd', 'shapiro', 'steps', 'can', 'be', 'accounted', 'for', 'by', 'thermal', 'poisoning', 'driven', 'by', 'joule', 'overheating', 'furthermore', 'we', 'uncover', 'a', 'residual', 'supercurrent', 'at', 'the', 'nodes', 'between', 'shapiro', 'lobes', 'which', 'provides', 'a', 'direct', 'and', 'novel', 'signature', 'of', 'the', 'current', 'carried', 'by', 'the', 'mbs', 'our', 'findings', 'showcase', 'the', 'crucial', 'role', 'of', 'thermal', 'effects', 'in', 'topological', 'josephson', 'junctions', 'and', 'lend', 'support', 'to', 'the', 'majorana', 'origin', 'of', 'the', 'partial', 'suppression', 'of', 'odd', 'shapiro', 'steps']]
|
[-0.27217273794632546, 0.16897519119753113, -0.04338783189594586, 0.035461974462225314, -0.0825743484609626, -0.20543002627321824, 0.13418469841860953, 0.3221689951730603, -0.17863695895458687, -0.31923827026935825, -0.026607913987332567, -0.2651917320143252, -0.1595010312179472, 0.23018201429865018, -0.01002290464668749, 0.02933340292563413, 0.018439035022252782, -0.07944079375960292, -0.05109658843232568, -0.20241441851591363, 0.30642500869870026, -0.0066340671018647514, 0.3169140845293149, 0.09284050357098476, 0.03796777111493091, -0.07592115245440746, 0.0448399978729692, 0.031790681033928125, -0.09008748471667806, 0.020025038329092536, 0.22867909337040335, -0.08834640597077933, 0.20680138384574714, -0.5483244255603476, -0.2168099172158107, 0.048917628336638055, 0.147687008108864, 0.131245488955211, -0.04874878273629409, -0.3299517705656817, 0.09934045635362998, -0.1467191637418965, -0.06382225803348589, -0.0323137254566253, 0.01759704062466156, -0.01933555290779039, -0.20686352353843107, 0.07955678486524219, 0.12443538644022635, 0.049696130742335115, 0.003934172400457655, -0.10879515253852824, -0.05762649748230323, 0.05863161442208697, -0.01899407807249516, -0.021784437735649673, 0.13417045666741576, -0.09705464800111302, -0.1763883430939068, 0.2760359676060501, -0.0644500663480348, -0.11286205414403729, 0.12386805658791473, -0.13854744084886608, -0.09835852493773548, 0.10412812093770839, 0.07224368593371648, 0.09897899976807004, -0.09062001723447506, 0.03125593124392049, -0.02813236963970059, 0.13891138793946678, 0.08891157651031241, 0.0790737861777372, 0.2868351762352342, 0.2038700674675445, 0.09329890165500403, 0.13367530154151452, -0.15360758822650356, -0.0030631424913949825, -0.3285054311475014, -0.1810684899387403, -0.2175916789602588, 0.09156276220156946, -0.01533099614125166, -0.17866639294885697, 0.41941199849115657, 0.15830925933239773, 0.19467977128604197, -0.013287148350615672, 0.30881955557288654, 0.1656112033048306, 0.07832546647573338, 0.011861912187756622, 0.19461506636524423, 0.19564906668470783, 0.09371421806623831, -0.35133234516563105, 0.07424976281326184, 0.038336773008297395]
|
1,803.07675
|
HPL-GEM: Controlling High Pressure Laminates bulk resistivity with GEMs
|
We succeeded in modifying and controlling the electrical resistance of a
standard High Pressure Laminate (HPL) panel through the use of a Gas Electron
Multiplier (GEM) foil that has been embedded into the bulk of the HPL plate
itself. Electrical characterizations were made and preliminary data show that
this HPL-GEM embedded system can easily vary its bulk resistance by more than
one order of magnitude. Data show that the bulk resistance change is
exponential with the applied voltage to the embedded GEM.
|
physics.ins-det
|
we succeeded in modifying and controlling the electrical resistance of a standard high pressure laminate hpl panel through the use of a gas electron multiplier gem foil that has been embedded into the bulk of the hpl plate itself electrical characterizations were made and preliminary data show that this hplgem embedded system can easily vary its bulk resistance by more than one order of magnitude data show that the bulk resistance change is exponential with the applied voltage to the embedded gem
|
[['we', 'succeeded', 'in', 'modifying', 'and', 'controlling', 'the', 'electrical', 'resistance', 'of', 'a', 'standard', 'high', 'pressure', 'laminate', 'hpl', 'panel', 'through', 'the', 'use', 'of', 'a', 'gas', 'electron', 'multiplier', 'gem', 'foil', 'that', 'has', 'been', 'embedded', 'into', 'the', 'bulk', 'of', 'the', 'hpl', 'plate', 'itself', 'electrical', 'characterizations', 'were', 'made', 'and', 'preliminary', 'data', 'show', 'that', 'this', 'hplgem', 'embedded', 'system', 'can', 'easily', 'vary', 'its', 'bulk', 'resistance', 'by', 'more', 'than', 'one', 'order', 'of', 'magnitude', 'data', 'show', 'that', 'the', 'bulk', 'resistance', 'change', 'is', 'exponential', 'with', 'the', 'applied', 'voltage', 'to', 'the', 'embedded', 'gem']]
|
[-0.0917880492576651, 0.12222551460159414, -0.06420414904592397, -0.05346024400888034, -0.05047977014364284, -0.15856855234453154, 0.022218683435593124, 0.38014592561456895, -0.2634354238340884, -0.30553533290915286, 0.09555895547641234, -0.3006851526644127, -0.08101532831040706, 0.2414938590121398, -0.06663662094024965, 0.06384115269404755, 0.02958259971835363, -0.010084802126741888, -0.10409309851137898, -0.24623268191921122, 0.2633248521819895, 0.051252809502644305, 0.30698982083790555, 0.0340863135125902, 0.10725556489045697, -0.04318037087868117, 0.027091825967309652, 0.10791371378725693, -0.09936281408455991, 0.08604144173053403, 0.2033753305455141, -0.02920932809960235, 0.22860214653148972, -0.5109919125881092, -0.23342725987557644, 0.019070286240520668, 0.10359867105697408, 0.03060806113479222, -0.07954674266242094, -0.2128169722855091, 0.10186687093458058, -0.17798347396339165, -0.12355504063946873, -0.05084299592209267, -0.009378467065592607, -0.003015615396707514, -0.2227665654004172, 0.049427164936967104, 0.04528380215259982, 0.04588016813023039, -0.06306886482253717, -0.10938292862933681, -0.06344054459973618, 0.10054166997922297, 0.018494662113004812, 0.042352225300913426, 0.24963554255319415, -0.09307335445622879, -0.04471322825109517, 0.2985301023280179, -0.09187687115034485, -0.15408105550356854, 0.18782228954642274, -0.16982749368374547, -0.016222126178305457, 0.14312192732123313, 0.14352551821251341, 0.041894706931931, -0.1940701402907754, 0.0639036469216125, 0.007299782800269715, 0.19978972851229762, 0.11447726283222437, -0.03090704802170764, 0.17942119589834302, 0.21386314943478799, 0.03216001969750649, 0.1827068046471219, -0.12804213517207513, 0.041075949994042335, -0.23997066627590008, -0.24905367488800376, -0.13757594959971345, 0.05328775804926768, -0.08223229109483518, -0.1889582336132909, 0.4157549867429483, 0.12153346771604301, 0.15057415988894157, -0.054104981012642384, 0.3136184238311317, 0.11562833669422953, 0.134086975776073, 0.037664143996939126, 0.2772838276477508, 0.14575397766793124, 0.14230750829993208, -0.21728103134758125, 0.12598753570762958, -0.00410191934371804]
|
1,803.07676
|
Poisson geometry, monoidal Fukaya categories, and commutative Floer
cohomology rings
|
We describe connections between concepts arising in Poisson geometry and the
theory of Fukaya categories. The key concept is that of a symplectic groupoid,
which is an integration of a Poisson manifold. The Fukaya category of a
symplectic groupoid is monoidal, and it acts on the Fukaya categories of the
symplectic leaves of the Poisson structure. Conversely, we consider a wide
range of known monoidal structures on Fukaya categories and observe that they
all arise from symplectic groupoids. We also use the picture developed to
resolve a conundrum in Floer theory: why are some Lagrangian Floer cohomology
rings commutative?
|
math.SG
|
we describe connections between concepts arising in poisson geometry and the theory of fukaya categories the key concept is that of a symplectic groupoid which is an integration of a poisson manifold the fukaya category of a symplectic groupoid is monoidal and it acts on the fukaya categories of the symplectic leaves of the poisson structure conversely we consider a wide range of known monoidal structures on fukaya categories and observe that they all arise from symplectic groupoids we also use the picture developed to resolve a conundrum in floer theory why are some lagrangian floer cohomology rings commutative
|
[['we', 'describe', 'connections', 'between', 'concepts', 'arising', 'in', 'poisson', 'geometry', 'and', 'the', 'theory', 'of', 'fukaya', 'categories', 'the', 'key', 'concept', 'is', 'that', 'of', 'a', 'symplectic', 'groupoid', 'which', 'is', 'an', 'integration', 'of', 'a', 'poisson', 'manifold', 'the', 'fukaya', 'category', 'of', 'a', 'symplectic', 'groupoid', 'is', 'monoidal', 'and', 'it', 'acts', 'on', 'the', 'fukaya', 'categories', 'of', 'the', 'symplectic', 'leaves', 'of', 'the', 'poisson', 'structure', 'conversely', 'we', 'consider', 'a', 'wide', 'range', 'of', 'known', 'monoidal', 'structures', 'on', 'fukaya', 'categories', 'and', 'observe', 'that', 'they', 'all', 'arise', 'from', 'symplectic', 'groupoids', 'we', 'also', 'use', 'the', 'picture', 'developed', 'to', 'resolve', 'a', 'conundrum', 'in', 'floer', 'theory', 'why', 'are', 'some', 'lagrangian', 'floer', 'cohomology', 'rings', 'commutative']]
|
[-0.193759436418086, 0.0035102815060662294, -0.10671659187423159, 0.15763643388565857, -0.12799460002023613, -0.11860511515458877, -0.045501484850779025, 0.38739534685708055, -0.4240813370455395, -0.2415383489651963, 0.025406014510533877, -0.18804783297872002, -0.22346558958066232, 0.12201561297130104, -0.2663936791000794, -0.12922746157085505, 0.08882851287666144, 0.07000206609849226, -0.11485055836053998, -0.19476887812329965, 0.531962782003437, 0.027793969037105338, 0.2274466926100278, 0.05473623567164083, 0.13486491862421085, -0.05348572959521353, -0.02650868756263846, -0.010607020793049926, -0.15189222118425103, 0.1304222287250344, 0.3424189229486416, 0.02649638123546887, 0.14641517464865547, -0.4139499125644715, -0.1155898691898193, 0.09652796312531625, 0.07375141477325198, 0.04667420940111495, -0.012573489627678586, -0.353697807321118, 0.08154901558053539, -0.22649619271602445, -0.11296180206188706, -0.0904250375049264, 0.044267087803231644, 0.012819364949157743, -0.12419726471757667, -0.07753578164512433, 0.09038532418763322, 0.08821220551100042, -0.08148456646618668, -0.04696552645452697, -0.0880142796144943, 0.12123326061180595, -0.038535727840622494, 0.028313918870572715, 0.22668577904690695, -0.07769091387933139, -0.12815791245248884, 0.39946718431181377, -0.0372778300120674, -0.26620239282798286, 0.14284862687039857, -0.09343024129706501, -0.23277311531751596, 0.15732472997647945, -0.004013691163349031, 0.1457299400624264, -0.043229880202396986, 0.21303392751812653, -0.14029435387746703, 0.02833454870628287, 0.10329508091172561, 0.0015245085920799863, 0.17350908786509978, 0.15203131568815673, 0.072660694086943, 0.06404756637515896, -0.035128049773512166, -0.16085613050469846, -0.35412373171761785, -0.2092151321221444, -0.04324088572886669, 0.2007336922159249, -0.07031608306561159, -0.1922166864952129, 0.36557373999044146, 0.10808295207192199, 0.1962411372047482, 0.13131878597572483, 0.23974125639469634, 0.008231552609364794, 0.06591685732469113, -0.0005158257595442161, 0.12213802369307925, 0.348984915960693, 0.011549015985707742, -0.041464652349899586, -0.08675467521375553, 0.2223107022694265]
|
1,803.07677
|
8th Low-Level RF Workshop (LLRF2017)
|
This volume contains a subset of contributions presented at LLRF2017: the 8th
Low-Level RF Workshop held in Barcelona, Spain, on October 16-19, 2017.
|
physics.acc-ph
|
this volume contains a subset of contributions presented at llrf2017 the 8th lowlevel rf workshop held in barcelona spain on october 1619 2017
|
[['this', 'volume', 'contains', 'a', 'subset', 'of', 'contributions', 'presented', 'at', 'llrf2017', 'the', '8th', 'lowlevel', 'rf', 'workshop', 'held', 'in', 'barcelona', 'spain', 'on', 'october', '1619', '2017']]
|
[-0.12247640496670184, 0.08403200932132843, -0.07852901622060347, -0.07869097459743815, -0.03269509183750911, -0.03675576703707603, 0.05138226556168361, 0.2582830221138217, -0.06821989346380261, -0.421763164922595, 0.13600380171556026, -0.4048162805424495, -0.08182028342377055, 0.17569609559590885, -0.16584996062076904, -0.11498884128575976, 0.06410662227691236, 0.029549769887870007, 0.06173246228453619, -0.4420072538778186, 0.1492709337987683, 0.12976386228745634, 0.3523102375594052, 0.09913735167885368, 0.18205515896393495, -0.012507347580553456, -0.12363583480261943, -0.12294062066145918, -0.08427791301669045, 0.10920104824683884, 0.4172364767979492, 0.10840239864774048, 0.27080218866467476, -0.394243486225605, -0.021031996404582805, -0.06012923493769697, -0.14565657688812775, -0.059867188763085076, 0.018010899144097824, -0.3410297032784332, -0.062238589733500375, -0.21911933069879358, -0.06161207367073406, 0.1412767107513818, 0.07237723327919164, -0.01111171559684656, -0.13812483682043172, 0.039417855060574686, 0.013432940214195034, 0.2339294406966391, -0.004580590365962548, -0.1944763890509917, -0.017933396093378014, 0.15431744488672516, -0.0840218430808322, 0.14811064659046347, 0.10561998366293582, 0.04887350587391252, -0.09123374631797726, 0.361296199854802, -0.03739294443618168, 0.10811400019817731, 0.20361399561674756, -0.19688613230193203, -0.30374120522967796, 0.14051203514364632, 0.39421204579147423, 0.031847002314117905, -0.1373945390805602, 0.1604683114723726, 0.004322117025201971, 0.28339260825040663, 0.22942614474926482, -0.13290601689368486, 0.2594435858455571, 0.15392407415096054, -0.05406268076463179, 0.075544441687684, -0.11843698762822896, -0.0678447921845046, -0.44846223294734955, -0.04105093846605583, -0.12666760516268286, -0.05942771461030299, 0.13417937221344223, -0.10707798858427188, 0.389178839596835, 0.06658563102510842, 0.08744656336917118, -0.1131740019614385, 0.1991063429635357, -0.0018728262459097261, -0.015600266019729052, 0.2111664881760424, 0.22701115686107765, 0.007045338311317292, 0.31194532808678394, -0.0962225344370712, -0.06929195251061836, 0.19637481330639936]
|
1,803.07678
|
Lagrange's Theorem For Hom-Groups
|
Hom-groups are nonassociative generalizations of groups where the unitality
and associativity are twisted by a map. We show that a Hom-group (G, {\alpha})
is a pointed idempotent quasigroup (pique). We use Cayley table of quasigroups
to introduce some examples of Hom-groups. Introducing the notions of
Hom-subgroups and cosets we prove Lagrange's theorem for finite Hom-groups.
This states that the order of any Hom-subgroup H of a finite Hom-group G
divides the order of G. We linearize Hom-groups to obtain a class of
nonassociative Hopf algebras called Hom-Hopf algebras. As an application of our
results, we show that the dimension of a Hom-sub-Hopf algebra of the finite
dimensional Hom-group Hopf algebra KG divides the order of G. The new tools
introduced in this paper could potentially have applications in theories of
quasigroups, nonassociative Hopf algebras, Hom-type objects, combinatorics, and
cryptography.
|
math.GR
|
homgroups are nonassociative generalizations of groups where the unitality and associativity are twisted by a map we show that a homgroup g alpha is a pointed idempotent quasigroup pique we use cayley table of quasigroups to introduce some examples of homgroups introducing the notions of homsubgroups and cosets we prove lagranges theorem for finite homgroups this states that the order of any homsubgroup h of a finite homgroup g divides the order of g we linearize homgroups to obtain a class of nonassociative hopf algebras called homhopf algebras as an application of our results we show that the dimension of a homsubhopf algebra of the finite dimensional homgroup hopf algebra kg divides the order of g the new tools introduced in this paper could potentially have applications in theories of quasigroups nonassociative hopf algebras homtype objects combinatorics and cryptography
|
[['homgroups', 'are', 'nonassociative', 'generalizations', 'of', 'groups', 'where', 'the', 'unitality', 'and', 'associativity', 'are', 'twisted', 'by', 'a', 'map', 'we', 'show', 'that', 'a', 'homgroup', 'g', 'alpha', 'is', 'a', 'pointed', 'idempotent', 'quasigroup', 'pique', 'we', 'use', 'cayley', 'table', 'of', 'quasigroups', 'to', 'introduce', 'some', 'examples', 'of', 'homgroups', 'introducing', 'the', 'notions', 'of', 'homsubgroups', 'and', 'cosets', 'we', 'prove', 'lagranges', 'theorem', 'for', 'finite', 'homgroups', 'this', 'states', 'that', 'the', 'order', 'of', 'any', 'homsubgroup', 'h', 'of', 'a', 'finite', 'homgroup', 'g', 'divides', 'the', 'order', 'of', 'g', 'we', 'linearize', 'homgroups', 'to', 'obtain', 'a', 'class', 'of', 'nonassociative', 'hopf', 'algebras', 'called', 'homhopf', 'algebras', 'as', 'an', 'application', 'of', 'our', 'results', 'we', 'show', 'that', 'the', 'dimension', 'of', 'a', 'homsubhopf', 'algebra', 'of', 'the', 'finite', 'dimensional', 'homgroup', 'hopf', 'algebra', 'kg', 'divides', 'the', 'order', 'of', 'g', 'the', 'new', 'tools', 'introduced', 'in', 'this', 'paper', 'could', 'potentially', 'have', 'applications', 'in', 'theories', 'of', 'quasigroups', 'nonassociative', 'hopf', 'algebras', 'homtype', 'objects', 'combinatorics', 'and', 'cryptography']]
|
[-0.19683975978542173, 0.11892558017376252, -0.06614922288366977, 0.07230357395276181, -0.1517742588527172, -0.1253549322787234, -0.01620512106712661, 0.32402503770529567, -0.36071329732315943, -0.1929164519533515, 0.124332773810773, -0.228281632750569, -0.17827712814323604, 0.18834278248387443, -0.17163145060048385, -0.0675495537066394, 0.04668672152654514, 0.12529555700637182, -0.12284687614609378, -0.28364541695405293, 0.4055308267227648, -0.0431591204542201, 0.15978175865294522, 0.0258612529381507, 0.13051330599495592, -0.006840378664064166, -0.021203392623540235, 0.026128687806810963, -0.19912672113974517, 0.10407630401031757, 0.3113162645330543, 0.06284784912542604, 0.24034563929308206, -0.33876743171747553, -0.11675404503201957, 0.16521929648211775, 0.12332573985280332, 0.01931905796535669, -0.03671980190590736, -0.270858213017859, 0.13477307142388514, -0.2960790524683783, -0.10292434831225204, -0.09987845879924648, 0.10072465312174138, 0.002827320412239608, -0.26093164062716395, -0.024936244525152314, 0.1466956333435305, 0.13257308829548387, -0.02772191261893193, -0.09966477952377104, -0.049922460854491764, 0.07719186106131769, -0.09436077581588453, -0.018301804082618806, 0.08686464771573596, -0.06916589738856975, -0.2207136766399558, 0.3720063829404192, 0.005993681118364774, -0.1737739355851184, 0.08904610471440452, -0.15108698989634456, -0.23550047086524395, 0.06234204614370623, 0.06288737767060999, 0.15483675410231465, -0.023267198694691828, 0.20180546361413743, -0.14663054832421682, 0.05905471442212515, 0.11268582037540481, 0.00038092828917262307, 0.12127839559723404, 0.080251576471389, 0.06400422288467833, 0.18736799050512834, 0.03367834087967982, 0.009446135485418113, -0.37350557595217493, -0.20101674733793035, -0.04919293852906455, 0.11446275930639412, -0.11125492664049329, -0.20233197178287596, 0.399164928445209, 0.15033851008903346, 0.10770639277967241, 0.08584199251387925, 0.16914012406863654, 0.06706700089510859, 0.12663227352587617, 0.04631777135449845, 0.09806982590239119, 0.3139866673240356, -0.01977543270913884, -0.09604614176992875, -0.09692126076654806, 0.2512281443581314]
|
1,803.07679
|
Product Characterisation towards Personalisation: Learning Attributes
from Unstructured Data to Recommend Fashion Products
|
In this paper, we describe a solution to tackle a common set of challenges in
e-commerce, which arise from the fact that new products are continually being
added to the catalogue. The challenges involve properly personalising the
customer experience, forecasting demand and planning the product range. We
argue that the foundational piece to solve all of these problems is having
consistent and detailed information about each product, information that is
rarely available or consistent given the multitude of suppliers and types of
products. We describe in detail the architecture and methodology implemented at
ASOS, one of the world's largest fashion e-commerce retailers, to tackle this
problem. We then show how this quantitative understanding of the products can
be leveraged to improve recommendations in a hybrid recommender system
approach.
|
stat.ML cs.CL cs.CV cs.IR cs.LG
|
in this paper we describe a solution to tackle a common set of challenges in ecommerce which arise from the fact that new products are continually being added to the catalogue the challenges involve properly personalising the customer experience forecasting demand and planning the product range we argue that the foundational piece to solve all of these problems is having consistent and detailed information about each product information that is rarely available or consistent given the multitude of suppliers and types of products we describe in detail the architecture and methodology implemented at asos one of the worlds largest fashion ecommerce retailers to tackle this problem we then show how this quantitative understanding of the products can be leveraged to improve recommendations in a hybrid recommender system approach
|
[['in', 'this', 'paper', 'we', 'describe', 'a', 'solution', 'to', 'tackle', 'a', 'common', 'set', 'of', 'challenges', 'in', 'ecommerce', 'which', 'arise', 'from', 'the', 'fact', 'that', 'new', 'products', 'are', 'continually', 'being', 'added', 'to', 'the', 'catalogue', 'the', 'challenges', 'involve', 'properly', 'personalising', 'the', 'customer', 'experience', 'forecasting', 'demand', 'and', 'planning', 'the', 'product', 'range', 'we', 'argue', 'that', 'the', 'foundational', 'piece', 'to', 'solve', 'all', 'of', 'these', 'problems', 'is', 'having', 'consistent', 'and', 'detailed', 'information', 'about', 'each', 'product', 'information', 'that', 'is', 'rarely', 'available', 'or', 'consistent', 'given', 'the', 'multitude', 'of', 'suppliers', 'and', 'types', 'of', 'products', 'we', 'describe', 'in', 'detail', 'the', 'architecture', 'and', 'methodology', 'implemented', 'at', 'asos', 'one', 'of', 'the', 'worlds', 'largest', 'fashion', 'ecommerce', 'retailers', 'to', 'tackle', 'this', 'problem', 'we', 'then', 'show', 'how', 'this', 'quantitative', 'understanding', 'of', 'the', 'products', 'can', 'be', 'leveraged', 'to', 'improve', 'recommendations', 'in', 'a', 'hybrid', 'recommender', 'system', 'approach']]
|
[-0.08627221397835556, 0.04031001246262958, -0.04587103235425325, 0.06639798677422833, -0.1125509470268556, -0.10425860569335696, 0.04276138420425737, 0.3933388654758611, -0.31619126359954125, -0.31757590813400943, 0.13568988857849493, -0.32098080889930525, -0.15033595344807044, 0.18740510588372492, -0.12540066428482533, 0.018399082402552946, 0.12687997201798615, 0.05797967344328145, -0.02720541613085716, -0.28087626883804095, 0.34482073247447376, 0.008963411959441833, 0.2880260552404316, 0.07367747136773029, 0.0863705546206494, -0.029018251571848286, -0.06700446982693851, 0.018936276647599604, -0.12143840628219392, 0.1836640417005676, 0.3284450631926027, 0.212499895661072, 0.3280849064751638, -0.43262865995680255, -0.16582513982466768, 0.10615881717228513, 0.13902855713395254, 0.07225007752935571, -0.03411577460466055, -0.2605849633389336, 0.08092849548378094, -0.25084580435586257, -0.1149640027910295, -0.09572208007086273, -0.03893132612666511, 0.0008032740438430328, -0.25743902335310076, -0.01372945027730215, 0.028497754662173, 0.0036791123185805448, -0.07143337555654992, -0.1026634440168841, 0.028100462907221256, 0.19706138439557155, 0.06934561291764542, -0.008651605236168041, 0.10507837498531215, -0.12921898641374227, -0.13085216850291673, 0.40828925855164455, 0.008255201188836422, -0.17525731804084002, 0.16870467942648046, -0.10117850033933018, -0.19473855595625056, 0.08110492920693685, 0.23159435486024993, 0.08376094460758696, -0.220028562720601, 0.019039931259756015, -0.030757320546141758, 0.15127737135681374, 0.027599595349161028, 0.023817613420230668, 0.22559640879236806, 0.1921144662989582, 0.06913794333291218, 0.12203014938630105, 0.02088273110374163, -0.09438954361193762, -0.2536593762503233, -0.16471290133717492, -0.1396025386648106, 0.01342198282010912, -0.05679829948807252, -0.1503283136476594, 0.3880535739979993, 0.2304693073525614, 0.1594132123933005, 0.008420824587499121, 0.32863048182463084, 0.07117516847291144, 0.07401132095086307, 0.08154849969143943, 0.17134344894585646, 0.00019961267555733834, 0.15537880478412147, -0.13882141800296646, 0.09209674239290629, 0.015512629705444566]
|
1,803.0768
|
PaaS Cloud: The Business Perspective
|
The next generation of PaaS technology accomplishes the true promise of
object-oriented and 4GLs development with less effort. Now PaaS is becoming one
of the core technical services for application development organizations. PaaS
offers a resourceful and agile approach to develop, operate and deploy
applications in a cost-effective manner. It is now turning out to be one of the
preferred choices throughout the world, especially for globally distributed
development environment. However it still lacks the scale of popularity and
acceptance which Software-as-a-Service (SaaS) and Infrastructure-as-a-Service
(IaaS) have attained. PaaS offers a promising future with novel technology
architecture and evolutionary development approach. In this article, we
identify the strengths, weaknesses, opportunities and threats for the PaaS
industry. We then identify the various issues that will affect the different
stakeholders of PaaS industry. This research will outline a set of
recommendations for the PaaS practitioners to better manage this technology.
For PaaS technology researchers, we also outline the number of research areas
that need attention in coming future. Finally, we also included an online
survey to outline PaaS technology market leaders. This will facilitate PaaS
technology practitioners to have a more deep insight into market trends and
technologies.
|
cs.CY cs.DC
|
the next generation of paas technology accomplishes the true promise of objectoriented and 4gls development with less effort now paas is becoming one of the core technical services for application development organizations paas offers a resourceful and agile approach to develop operate and deploy applications in a costeffective manner it is now turning out to be one of the preferred choices throughout the world especially for globally distributed development environment however it still lacks the scale of popularity and acceptance which softwareasaservice saas and infrastructureasaservice iaas have attained paas offers a promising future with novel technology architecture and evolutionary development approach in this article we identify the strengths weaknesses opportunities and threats for the paas industry we then identify the various issues that will affect the different stakeholders of paas industry this research will outline a set of recommendations for the paas practitioners to better manage this technology for paas technology researchers we also outline the number of research areas that need attention in coming future finally we also included an online survey to outline paas technology market leaders this will facilitate paas technology practitioners to have a more deep insight into market trends and technologies
|
[['the', 'next', 'generation', 'of', 'paas', 'technology', 'accomplishes', 'the', 'true', 'promise', 'of', 'objectoriented', 'and', '4gls', 'development', 'with', 'less', 'effort', 'now', 'paas', 'is', 'becoming', 'one', 'of', 'the', 'core', 'technical', 'services', 'for', 'application', 'development', 'organizations', 'paas', 'offers', 'a', 'resourceful', 'and', 'agile', 'approach', 'to', 'develop', 'operate', 'and', 'deploy', 'applications', 'in', 'a', 'costeffective', 'manner', 'it', 'is', 'now', 'turning', 'out', 'to', 'be', 'one', 'of', 'the', 'preferred', 'choices', 'throughout', 'the', 'world', 'especially', 'for', 'globally', 'distributed', 'development', 'environment', 'however', 'it', 'still', 'lacks', 'the', 'scale', 'of', 'popularity', 'and', 'acceptance', 'which', 'softwareasaservice', 'saas', 'and', 'infrastructureasaservice', 'iaas', 'have', 'attained', 'paas', 'offers', 'a', 'promising', 'future', 'with', 'novel', 'technology', 'architecture', 'and', 'evolutionary', 'development', 'approach', 'in', 'this', 'article', 'we', 'identify', 'the', 'strengths', 'weaknesses', 'opportunities', 'and', 'threats', 'for', 'the', 'paas', 'industry', 'we', 'then', 'identify', 'the', 'various', 'issues', 'that', 'will', 'affect', 'the', 'different', 'stakeholders', 'of', 'paas', 'industry', 'this', 'research', 'will', 'outline', 'a', 'set', 'of', 'recommendations', 'for', 'the', 'paas', 'practitioners', 'to', 'better', 'manage', 'this', 'technology', 'for', 'paas', 'technology', 'researchers', 'we', 'also', 'outline', 'the', 'number', 'of', 'research', 'areas', 'that', 'need', 'attention', 'in', 'coming', 'future', 'finally', 'we', 'also', 'included', 'an', 'online', 'survey', 'to', 'outline', 'paas', 'technology', 'market', 'leaders', 'this', 'will', 'facilitate', 'paas', 'technology', 'practitioners', 'to', 'have', 'a', 'more', 'deep', 'insight', 'into', 'market', 'trends', 'and', 'technologies']]
|
[-0.10940748605846275, 0.03700227103719062, -0.05780860433967936, 0.07061996058785423, -0.17372462996020344, -0.18478241808859783, 0.05215982740866115, 0.44205181513513836, -0.252322218252574, -0.3180466287541298, 0.14548872679362682, -0.24821716945200245, -0.15603350493041276, 0.23640505297849554, -0.10803463304420097, 0.019748347588073537, 0.059743365021042376, -0.053500888531799524, 0.00837205899184408, -0.3068755073662923, 0.22971095117842494, 0.09773193319356045, 0.3723504483576256, 0.12662285888729122, 0.027533341058392117, -0.06337003885502261, -0.04640226916701661, -0.05512520679681353, -0.10627898805525583, 0.24915466026541996, 0.3877500172856511, 0.282298555046472, 0.43303258300815917, -0.4499295552698325, -0.1623012386785098, 0.0581457475984317, 0.1668230828850492, 0.051230713486913784, -0.10189201180326897, -0.3072996230615417, 0.07786766088707847, -0.3173310749888496, -0.2007624130645275, -0.12840768158119836, 0.037654086163419545, 0.0030460369058086406, -0.20986565265077528, -0.11951016368640216, -0.035304080713920445, 0.05736233239128653, -0.012454941353228475, -0.14174255930547774, 0.05681678579291044, 0.20378035791123247, 0.0618787091676792, 0.02932394688654387, 0.17913054132196168, -0.17356998351763706, -0.12293718081699419, 0.3936799337745321, 0.021720921471940678, -0.12095943935291499, 0.19303504856331843, -0.030251042724929143, -0.2119434685487899, 0.038285703362056, 0.22309766580084606, 0.0013509828654326955, -0.22124172959771313, 0.06070556049353956, 0.07575883914013298, 0.13964021561087622, 0.01383406866480815, 0.05456050504854291, 0.27955574439767256, 0.3036800617523187, 0.14078221326261492, 0.08712175952885966, 0.000787104384935632, -0.12765258010589678, -0.2099569958761781, -0.2153191230240829, -0.06516926740866383, 0.002258877235919722, -0.023862762056226956, -0.1405780134218916, 0.36330083020183507, 0.27065256642823926, 0.04145124983588918, 0.020254079909990445, 0.38869945267785566, -0.017502730641539604, 0.12817705215230507, 0.08875452303945335, 0.19699193472375295, -0.034779413776681284, 0.2663857724472443, -0.07808225524459718, 0.09343878821735936, -0.057990049437277626]
|
1,803.07681
|
Pathwise approximation of Feynman path integrals using simple random
walks
|
The aim of the presented research is to give a rigorous mathematical approach
to Feynman path integrals based on strong (pathwise) approximations based on
simple random walks.
|
math-ph math.MP math.PR
|
the aim of the presented research is to give a rigorous mathematical approach to feynman path integrals based on strong pathwise approximations based on simple random walks
|
[['the', 'aim', 'of', 'the', 'presented', 'research', 'is', 'to', 'give', 'a', 'rigorous', 'mathematical', 'approach', 'to', 'feynman', 'path', 'integrals', 'based', 'on', 'strong', 'pathwise', 'approximations', 'based', 'on', 'simple', 'random', 'walks']]
|
[-0.10252965645243724, 0.034883974533942014, -0.18724042094416088, 0.08562371059303621, -0.22540053573471527, -0.10214473622747594, 0.13393255875066476, 0.41355392547255315, -0.18629789448998593, -0.17681356588447536, 0.05354330878428839, -0.21146385259581385, -0.227835343874715, 0.2477218679807804, -0.1257680831477046, 0.1079216524268742, 0.1098061924179395, 0.02054297399741632, -0.011033483332505933, -0.2778805720154196, 0.2510819323792088, 0.03143501723254168, 0.3045785723736993, 0.12467883447944014, 0.17046683226470594, 0.07152368863009745, -0.12452805621756448, -0.017039942106714955, -0.21261306172581734, 0.20591299228922086, 0.1983742772222117, 0.07934328206573371, 0.32516207863335256, -0.496085660946038, -0.15515159679300808, 0.014923635320479257, 0.10836056356007855, 0.10236080370291516, -0.006878831880856995, -0.3163080048505907, 0.028573627324981823, -0.09055560013210331, -0.12656213212068435, -0.11449199114684705, 0.011210170402019113, 0.0361665158222119, -0.24366430641600378, 0.015467748934127114, 0.036630041621349474, 0.10900458414107561, 0.057737925400336586, -0.13618359207693073, 0.11690964732595065, 0.06928458956449672, 0.0077632437891292354, 0.02362973929417354, 0.06534918473550567, -0.02489093187506552, -0.23610620580061717, 0.3833320196028109, -0.056887436921156394, -0.276770935324883, 0.19764120771584134, -0.07654393854102602, -0.16540668318393054, 0.14334975279591702, 0.18220255689488518, 0.18085757663680446, -0.27794390647775596, 0.09172825094450403, -0.0035243664902669413, 0.03402627452656075, -0.02095875085365993, -0.010922806837630493, 0.11087246838427813, 0.16334149006892135, 0.1281976987504297, 0.1353347162647104, 0.018396713684692426, -0.22178416395628894, -0.36837494789829683, -0.10666812845954189, -0.2097707429072923, 0.09931672050583142, -0.13113834232919747, -0.32689473619339643, 0.3918707001505903, 0.21561107515460914, 0.13935192439843108, 0.14929714895508908, 0.3002599677829831, 0.19405412384205395, -0.031060334708955552, 0.031405195128172636, 0.1593872528626687, 0.2291536011767608, 0.06972110054145257, -0.1196877395009829, 0.06307256899567114, 0.25352648942282907]
|
1,803.07682
|
A Feature-Driven Active Framework for Ultrasound-Based Brain Shift
Compensation
|
A reliable Ultrasound (US)-to-US registration method to compensate for brain
shift would substantially improve Image-Guided Neurological Surgery. Developing
such a registration method is very challenging, due to factors such as missing
correspondence in images, the complexity of brain pathology and the demand for
fast computation. We propose a novel feature-driven active framework. Here,
landmarks and their displacement are first estimated from a pair of US images
using corresponding local image features. Subsequently, a Gaussian Process (GP)
model is used to interpolate a dense deformation field from the sparse
landmarks. Kernels of the GP are estimated by using variograms and a discrete
grid search method. If necessary, the user can actively add new landmarks based
on the image context and visualization of the uncertainty measure provided by
the GP to further improve the result. We retrospectively demonstrate our
registration framework as a robust and accurate brain shift compensation
solution on clinical data acquired during neurosurgery.
|
cs.CV
|
a reliable ultrasound ustous registration method to compensate for brain shift would substantially improve imageguided neurological surgery developing such a registration method is very challenging due to factors such as missing correspondence in images the complexity of brain pathology and the demand for fast computation we propose a novel featuredriven active framework here landmarks and their displacement are first estimated from a pair of us images using corresponding local image features subsequently a gaussian process gp model is used to interpolate a dense deformation field from the sparse landmarks kernels of the gp are estimated by using variograms and a discrete grid search method if necessary the user can actively add new landmarks based on the image context and visualization of the uncertainty measure provided by the gp to further improve the result we retrospectively demonstrate our registration framework as a robust and accurate brain shift compensation solution on clinical data acquired during neurosurgery
|
[['a', 'reliable', 'ultrasound', 'ustous', 'registration', 'method', 'to', 'compensate', 'for', 'brain', 'shift', 'would', 'substantially', 'improve', 'imageguided', 'neurological', 'surgery', 'developing', 'such', 'a', 'registration', 'method', 'is', 'very', 'challenging', 'due', 'to', 'factors', 'such', 'as', 'missing', 'correspondence', 'in', 'images', 'the', 'complexity', 'of', 'brain', 'pathology', 'and', 'the', 'demand', 'for', 'fast', 'computation', 'we', 'propose', 'a', 'novel', 'featuredriven', 'active', 'framework', 'here', 'landmarks', 'and', 'their', 'displacement', 'are', 'first', 'estimated', 'from', 'a', 'pair', 'of', 'us', 'images', 'using', 'corresponding', 'local', 'image', 'features', 'subsequently', 'a', 'gaussian', 'process', 'gp', 'model', 'is', 'used', 'to', 'interpolate', 'a', 'dense', 'deformation', 'field', 'from', 'the', 'sparse', 'landmarks', 'kernels', 'of', 'the', 'gp', 'are', 'estimated', 'by', 'using', 'variograms', 'and', 'a', 'discrete', 'grid', 'search', 'method', 'if', 'necessary', 'the', 'user', 'can', 'actively', 'add', 'new', 'landmarks', 'based', 'on', 'the', 'image', 'context', 'and', 'visualization', 'of', 'the', 'uncertainty', 'measure', 'provided', 'by', 'the', 'gp', 'to', 'further', 'improve', 'the', 'result', 'we', 'retrospectively', 'demonstrate', 'our', 'registration', 'framework', 'as', 'a', 'robust', 'and', 'accurate', 'brain', 'shift', 'compensation', 'solution', 'on', 'clinical', 'data', 'acquired', 'during', 'neurosurgery']]
|
[-0.004333557825827715, 0.009345616715400193, -0.10585724252117859, 0.09237000714039312, -0.10341253181694234, -0.1513065121873142, 0.05560647136473943, 0.4251399261791722, -0.27377195886999756, -0.3267377148704981, 0.13027984534886367, -0.22414941585689685, -0.21658814919722919, 0.19635894260821207, -0.13687448727946236, 0.10651749275697797, 0.11067216708309632, 0.026502282352618922, -0.04644034203793245, -0.19550451892884632, 0.2611630631776624, 0.030673069590276558, 0.32516631298680226, 0.007700434720807167, 0.11839452994686059, 0.017238927501393785, -0.06947101269745165, -0.0037131306709222546, -0.07476445925087223, 0.19547907836595246, 0.299556107193329, 0.19257281025950768, 0.2948993749709593, -0.43354324392937854, -0.24462779895767717, 0.09882498608317737, 0.14391849237932441, 0.10758838423807783, -0.06399501164693361, -0.3657817898525132, 0.08285905147470485, -0.1196980431030681, -0.039897062140060405, -0.14254362608482635, -0.037391854140426645, -0.026222068971643846, -0.3327577355663213, 0.08377225202161308, 0.006583238933600632, 0.07236590417211547, -0.07605084931490079, -0.05143001946784994, 0.009908906070004199, 0.1844053846552627, 0.004372875379463901, 0.0996086189091157, 0.1671392723029248, -0.157352393066961, -0.09403532839173244, 0.35300311593344935, -0.004818310023717631, -0.21749970208993485, 0.176877094081183, -0.07031370864289332, -0.10908414788690268, 0.1610897613211468, 0.23737625497715925, 0.1152368195634944, -0.16625230608422772, -0.003658128548124379, 0.032113923864314345, 0.16249834838037203, 0.045310698427546016, -0.053351023736610714, 0.17316680431999024, 0.2010537904224608, 0.050518089149062056, 0.13188820725513828, -0.18574694844854545, -0.006731287445386056, -0.2536375868937695, -0.15224563967186602, -0.20459880250402623, -0.028414464201489038, -0.0999884525083996, -0.14386601621601608, 0.4015480719287606, 0.18172114275036733, 0.21989450700584118, 0.04830685725855623, 0.34416943033122355, 0.06250566556924966, 0.09536146933708974, 0.02315589996188684, 0.16785180862092114, 0.0728159067753605, 0.08773879177284007, -0.1839221966958124, 0.08192753690915804, 0.07178162151850224]
|
1,803.07683
|
On the Complexity of Testing Attainment of the Optimal Value in
Nonlinear Optimization
|
We prove that unless P=NP, there exists no polynomial time (or even
pseudo-polynomial time) algorithm that can test whether the optimal value of a
nonlinear optimization problem where the objective and constraints are given by
low-degree polynomials is attained. If the degrees of these polynomials are
fixed, our results along with previously-known "Frank-Wolfe type" theorems
imply that exactly one of two cases can occur: either the optimal value is
attained on every instance, or it is strongly NP-hard to distinguish attainment
from non-attainment. We also show that testing for some well-known sufficient
conditions for attainment of the optimal value, such as coercivity of the
objective function and closedness and boundedness of the feasible set, is
strongly NP-hard. As a byproduct, our proofs imply that testing the Archimedean
property of a quadratic module is strongly NP-hard, a property that is of
independent interest to the convergence of the Lasserre hierarchy. Finally, we
give semidefinite programming (SDP)-based sufficient conditions for attainment
of the optimal value, in particular a new characterization of coercive
polynomials that lends itself to an SDP hierarchy.
|
math.OC cs.CC math.AG math.NA
|
we prove that unless pnp there exists no polynomial time or even pseudopolynomial time algorithm that can test whether the optimal value of a nonlinear optimization problem where the objective and constraints are given by lowdegree polynomials is attained if the degrees of these polynomials are fixed our results along with previouslyknown frankwolfe type theorems imply that exactly one of two cases can occur either the optimal value is attained on every instance or it is strongly nphard to distinguish attainment from nonattainment we also show that testing for some wellknown sufficient conditions for attainment of the optimal value such as coercivity of the objective function and closedness and boundedness of the feasible set is strongly nphard as a byproduct our proofs imply that testing the archimedean property of a quadratic module is strongly nphard a property that is of independent interest to the convergence of the lasserre hierarchy finally we give semidefinite programming sdpbased sufficient conditions for attainment of the optimal value in particular a new characterization of coercive polynomials that lends itself to an sdp hierarchy
|
[['we', 'prove', 'that', 'unless', 'pnp', 'there', 'exists', 'no', 'polynomial', 'time', 'or', 'even', 'pseudopolynomial', 'time', 'algorithm', 'that', 'can', 'test', 'whether', 'the', 'optimal', 'value', 'of', 'a', 'nonlinear', 'optimization', 'problem', 'where', 'the', 'objective', 'and', 'constraints', 'are', 'given', 'by', 'lowdegree', 'polynomials', 'is', 'attained', 'if', 'the', 'degrees', 'of', 'these', 'polynomials', 'are', 'fixed', 'our', 'results', 'along', 'with', 'previouslyknown', 'frankwolfe', 'type', 'theorems', 'imply', 'that', 'exactly', 'one', 'of', 'two', 'cases', 'can', 'occur', 'either', 'the', 'optimal', 'value', 'is', 'attained', 'on', 'every', 'instance', 'or', 'it', 'is', 'strongly', 'nphard', 'to', 'distinguish', 'attainment', 'from', 'nonattainment', 'we', 'also', 'show', 'that', 'testing', 'for', 'some', 'wellknown', 'sufficient', 'conditions', 'for', 'attainment', 'of', 'the', 'optimal', 'value', 'such', 'as', 'coercivity', 'of', 'the', 'objective', 'function', 'and', 'closedness', 'and', 'boundedness', 'of', 'the', 'feasible', 'set', 'is', 'strongly', 'nphard', 'as', 'a', 'byproduct', 'our', 'proofs', 'imply', 'that', 'testing', 'the', 'archimedean', 'property', 'of', 'a', 'quadratic', 'module', 'is', 'strongly', 'nphard', 'a', 'property', 'that', 'is', 'of', 'independent', 'interest', 'to', 'the', 'convergence', 'of', 'the', 'lasserre', 'hierarchy', 'finally', 'we', 'give', 'semidefinite', 'programming', 'sdpbased', 'sufficient', 'conditions', 'for', 'attainment', 'of', 'the', 'optimal', 'value', 'in', 'particular', 'a', 'new', 'characterization', 'of', 'coercive', 'polynomials', 'that', 'lends', 'itself', 'to', 'an', 'sdp', 'hierarchy']]
|
[-0.15103689546067675, 0.05010481236387748, -0.09003849069096065, 0.0803508379109455, -0.11588624521195261, -0.1838052885612117, 0.06489996419005682, 0.3444433759615411, -0.3234390290375548, -0.26921738045070365, 0.18422902195146726, -0.2084222664726961, -0.16557094640245013, 0.21978914934691837, -0.0719175084868153, 0.05870386417118016, 0.08392445903253125, 0.0371869320332418, -0.0872571886222145, -0.33257042002351433, 0.3068848496502111, -0.011083447472833286, 0.20850176277852964, 0.09423239975173571, 0.10285564146941172, -0.013459890677980828, 0.0795603813695083, 0.06965255410237108, -0.12994946170678548, 0.06483759707149923, 0.2861719030201477, 0.23334059062222734, 0.31934366053953933, -0.3723357920866823, -0.0911701143787274, 0.19402718113923675, 0.10959326641979429, 0.04452304327677349, -0.04262895407508326, -0.1838945632884174, 0.119474201887621, -0.058037734667644995, -0.14043965822169452, -0.0742462755379063, 0.008773155280210998, 0.029306574164774647, -0.36257581616322815, 0.07176490573410672, 0.13866773989114367, 0.01728004530030355, -0.07781085932072712, -0.1555634618755116, 0.007587809116956307, 0.041899621371556534, 0.0395512139577395, 0.043559204004809594, 0.07419966312100472, -0.10353352590934949, -0.14443595303102197, 0.3579852253910196, -0.023094752491150953, -0.22442487199539632, 0.17722387042738957, -0.12292850390599852, -0.1664893579606511, 0.11932343518717235, 0.12016065330787436, 0.15412424688405368, -0.11176133125214681, 0.1132346551575609, -0.15213919257002181, 0.1684200184346501, 0.09535160851193948, 0.03948706396779548, 0.12485769447174677, 0.11271001798430395, 0.21799176212941726, 0.1580582868237195, 0.038884939202055165, -0.0660922352140874, -0.33030045600385627, -0.1396212775647389, -0.2171625421105183, 0.04798718535254992, -0.14093081705840213, -0.16789894505257436, 0.3691471344660549, 0.14703928576808506, 0.13029828748739, 0.1492551749891319, 0.22986105608353602, 0.16049185517027234, 0.03583455376073279, 0.11052707231961965, 0.2266748849012473, 0.11967703716023669, 0.030634053718570746, -0.21211050430004055, 0.12153813933294393, 0.09881484500927788]
|
1,803.07684
|
Characterization by forbidden induced subgraphs of some subclasses of
chordal graphs
|
Chordal graphs are the graphs in which every cycle of length at least four
has a chord. A set $S$ is a vertex separator for vertices $a$ and $b$ if the
removal of $S$ of the graph separates $a$ and $b$ into distinct connected
components. A graph $G$ is chordal if and only if every minimal vertex
separator is a clique. We study subclasses of chordal graphs defined by
restrictions imposed on the intersections of its minimal separator cliques. Our
goal is to characterize them by forbidden induced subgraphs. Some of these
classes have already been studied such as chordal graphs in which two minimal
separators have no empty intersection if and only if they are equal. Those
graphs are known as strictly chordal graphs and they were first introduced as
block duplicate graphs by Golumbic and Peled. They were also considered in
other previous works, showing that strictly chordal graphs are exactly the
(gem, dart)-free graphs.
|
cs.DM
|
chordal graphs are the graphs in which every cycle of length at least four has a chord a set s is a vertex separator for vertices a and b if the removal of s of the graph separates a and b into distinct connected components a graph g is chordal if and only if every minimal vertex separator is a clique we study subclasses of chordal graphs defined by restrictions imposed on the intersections of its minimal separator cliques our goal is to characterize them by forbidden induced subgraphs some of these classes have already been studied such as chordal graphs in which two minimal separators have no empty intersection if and only if they are equal those graphs are known as strictly chordal graphs and they were first introduced as block duplicate graphs by golumbic and peled they were also considered in other previous works showing that strictly chordal graphs are exactly the gem dartfree graphs
|
[['chordal', 'graphs', 'are', 'the', 'graphs', 'in', 'which', 'every', 'cycle', 'of', 'length', 'at', 'least', 'four', 'has', 'a', 'chord', 'a', 'set', 's', 'is', 'a', 'vertex', 'separator', 'for', 'vertices', 'a', 'and', 'b', 'if', 'the', 'removal', 'of', 's', 'of', 'the', 'graph', 'separates', 'a', 'and', 'b', 'into', 'distinct', 'connected', 'components', 'a', 'graph', 'g', 'is', 'chordal', 'if', 'and', 'only', 'if', 'every', 'minimal', 'vertex', 'separator', 'is', 'a', 'clique', 'we', 'study', 'subclasses', 'of', 'chordal', 'graphs', 'defined', 'by', 'restrictions', 'imposed', 'on', 'the', 'intersections', 'of', 'its', 'minimal', 'separator', 'cliques', 'our', 'goal', 'is', 'to', 'characterize', 'them', 'by', 'forbidden', 'induced', 'subgraphs', 'some', 'of', 'these', 'classes', 'have', 'already', 'been', 'studied', 'such', 'as', 'chordal', 'graphs', 'in', 'which', 'two', 'minimal', 'separators', 'have', 'no', 'empty', 'intersection', 'if', 'and', 'only', 'if', 'they', 'are', 'equal', 'those', 'graphs', 'are', 'known', 'as', 'strictly', 'chordal', 'graphs', 'and', 'they', 'were', 'first', 'introduced', 'as', 'block', 'duplicate', 'graphs', 'by', 'golumbic', 'and', 'peled', 'they', 'were', 'also', 'considered', 'in', 'other', 'previous', 'works', 'showing', 'that', 'strictly', 'chordal', 'graphs', 'are', 'exactly', 'the', 'gem', 'dartfree', 'graphs']]
|
[-0.17119345634250313, 0.15044678299640346, 0.00024141757719361098, 0.06148685905548513, -0.1108941340916879, -0.19362714152284868, 0.016844106927086974, 0.43194063909197594, -0.2722067166190998, -0.28993519219409697, 0.14475135654463153, -0.3492627649502769, -0.11759300231577674, 0.10541510497142745, -0.0947228272439568, 0.028570738223241937, 0.15254511607953222, 0.10695152840974509, 0.04752817750792761, -0.27716868547136914, 0.2964185526991963, -0.05859203475741017, 0.12970887838305228, 0.10211287754451394, 0.07055756980909189, -0.004902207378630236, -0.01461139230864348, 0.1637001917927354, -0.16874035955192618, 0.03894486193319747, 0.2624443105724492, 0.19327360976265504, 0.211378537711634, -0.3903278582265962, -0.1760066516403495, 0.2366828302427189, 0.11571302548700434, 0.019477374039298948, 0.05298750268838184, -0.19445599448884937, 0.15017968973227938, -0.07158015359632054, -0.04716411520649863, 0.020690729568718345, 0.13261017344808976, 0.03154194448291543, -0.2229075501346664, -0.0782216474416467, 0.17567134619494723, 0.029683507836548387, 0.11078063855288775, -0.16483635220463108, -0.10112467130563062, 0.10186310041292458, -0.08823812217896532, 0.04140776618988888, 0.0458516080731787, -0.09032883812898805, -0.20692451418656263, 0.35388941698333926, 0.004999264647626573, -0.16981923778298175, 0.15083629012724775, -0.1452538926209246, -0.20923203145076705, 0.11316618130536406, 0.06191508547302074, 0.20092884338443068, -0.15962037432250703, 0.14527136532094473, -0.12860323055380374, 0.052499795600232095, 0.19340440902597966, -0.014973469451514732, 0.13477033383812115, 0.1203295437034789, 0.16564874176730685, 0.17464049832278472, 0.024113998383359248, 0.019741488878680453, -0.2791685002565289, -0.06536905132649336, -0.20222240817661924, 0.018274786271107426, -0.15321529054199345, -0.21065757077804226, 0.4508554106340951, 0.019468074369356984, 0.18869343648848544, 0.09079350624085185, 0.2206245881170153, 0.025114270856334817, 0.10686202230566674, 0.22176484684726805, 0.15915320129789987, 0.199933109418667, -0.061008696962084184, -0.12337128113166304, 0.10908167321638317, 0.14849980923815803]
|
1,803.07685
|
aKWISP: investigating short-distance interactions at sub-micron scales
|
The sub-micron range in the field of short distance interactions has yet to
be opened to experimental investigation, and may well hold the key to
understanding al least part of the dark matter puzzle. The aKWISP
(advanced-KWISP) project introduces the novel Double Membrane Interaction
Monitor (DMIM), a combined source-sensing device where interaction distances
can be as short as 100 nm or even 10 nm, much below the 1-10 micron distance
which is the lower limit encountered by current experimental efforts. aKWISP
builds on the technology and the results obtained with the KWISP
opto-mechanical force sensor now searching at CAST for the direct coupling to
matter of solar chameleons. It will reach the ultimate quantum-limited
sensitivity by exploiting an array of technologies, including operation at
milli-Kelvin temperatures. Recent suggestions point at short-distance
interactions studies as intriguing possibilities for the detection of axions
and of new physical phenomena.
|
physics.ins-det astro-ph.IM hep-ex
|
the submicron range in the field of short distance interactions has yet to be opened to experimental investigation and may well hold the key to understanding al least part of the dark matter puzzle the akwisp advancedkwisp project introduces the novel double membrane interaction monitor dmim a combined sourcesensing device where interaction distances can be as short as 100 nm or even 10 nm much below the 110 micron distance which is the lower limit encountered by current experimental efforts akwisp builds on the technology and the results obtained with the kwisp optomechanical force sensor now searching at cast for the direct coupling to matter of solar chameleons it will reach the ultimate quantumlimited sensitivity by exploiting an array of technologies including operation at millikelvin temperatures recent suggestions point at shortdistance interactions studies as intriguing possibilities for the detection of axions and of new physical phenomena
|
[['the', 'submicron', 'range', 'in', 'the', 'field', 'of', 'short', 'distance', 'interactions', 'has', 'yet', 'to', 'be', 'opened', 'to', 'experimental', 'investigation', 'and', 'may', 'well', 'hold', 'the', 'key', 'to', 'understanding', 'al', 'least', 'part', 'of', 'the', 'dark', 'matter', 'puzzle', 'the', 'akwisp', 'advancedkwisp', 'project', 'introduces', 'the', 'novel', 'double', 'membrane', 'interaction', 'monitor', 'dmim', 'a', 'combined', 'sourcesensing', 'device', 'where', 'interaction', 'distances', 'can', 'be', 'as', 'short', 'as', '100', 'nm', 'or', 'even', '10', 'nm', 'much', 'below', 'the', '110', 'micron', 'distance', 'which', 'is', 'the', 'lower', 'limit', 'encountered', 'by', 'current', 'experimental', 'efforts', 'akwisp', 'builds', 'on', 'the', 'technology', 'and', 'the', 'results', 'obtained', 'with', 'the', 'kwisp', 'optomechanical', 'force', 'sensor', 'now', 'searching', 'at', 'cast', 'for', 'the', 'direct', 'coupling', 'to', 'matter', 'of', 'solar', 'chameleons', 'it', 'will', 'reach', 'the', 'ultimate', 'quantumlimited', 'sensitivity', 'by', 'exploiting', 'an', 'array', 'of', 'technologies', 'including', 'operation', 'at', 'millikelvin', 'temperatures', 'recent', 'suggestions', 'point', 'at', 'shortdistance', 'interactions', 'studies', 'as', 'intriguing', 'possibilities', 'for', 'the', 'detection', 'of', 'axions', 'and', 'of', 'new', 'physical', 'phenomena']]
|
[-0.12925063433374842, 0.18307246734696836, -0.03747936529123788, 0.027433041060953334, -0.07009511716126031, -0.1590111378849235, 0.052617914620524564, 0.3464966209238054, -0.26183924774481904, -0.39768070923689175, 0.09260187524249515, -0.2724948255148467, -0.06771493129945412, 0.23672306419409234, 0.006377919091725014, 0.045709485782500565, 0.032610541734267286, -0.013771020720834175, -0.019567753749073182, -0.1863860483051763, 0.22568012749067914, 0.12655493689530437, 0.26076649797385115, 0.1446891690565037, 0.08579089473047569, -0.014264539694151198, 0.004527426357577804, -0.021554766737685447, -0.13664332458841233, 0.08841609713149218, 0.25648066018212873, 0.06036965776575913, 0.24444544291563175, -0.4399011996640286, -0.21971724154493233, 0.06666909003528622, 0.14677281281582907, 0.09290328270404823, -0.06831146462600757, -0.3128692187486925, 0.04812611935477422, -0.13746351715583932, -0.14667921566115824, -0.02594786073723939, 0.026461340379606093, 0.009284478723740493, -0.2235343581996858, 0.027758199570726762, 0.021470229183225303, 0.026502590173934127, -0.028868596167893897, -0.14068323284925394, 0.06407285144086927, 0.11439595127340511, 0.02219290819681499, 0.06385805517513778, 0.19369673942343635, -0.15266692419011724, -0.11418956601795491, 0.37605578197874656, -0.0823297177795583, -0.05184616578388697, 0.22297882418103948, -0.14578552113216317, -0.08125096361454524, 0.13459857591611504, 0.16000141588147912, 0.080258285155369, -0.17436901869704868, 0.06729403223955518, 0.02450069713301327, 0.18716032810375574, 0.07878462414742565, 0.10295907757900866, 0.30001001333666993, 0.25751679416247447, 0.06001569715190784, 0.07929200361627088, -0.12304021449248032, -0.05309268589743125, -0.2807362696523188, -0.12648977257940971, -0.17178974854026127, 0.06068537008463287, -0.05691372398744111, -0.08697300115075539, 0.34168393512151507, 0.18903496000394357, 0.17309864206587186, -0.0006326019139238961, 0.3071553338914257, 0.040997032831180315, 0.1429269091672146, -0.01778420594251964, 0.3510928119231068, 0.12918449669722204, 0.13174910971593165, -0.1801798257314351, 0.024344165381503254, -0.015255159569714008]
|
1,803.07686
|
Big-bang nucleosynthesis and Leptogenesis in CMSSM
|
We have investigated the constrained minimal supersymmetric standard model
with three right-handed Majorana neutrinos whether there still is a parameter
region which is consistent with all existing experimental data/limits such as
Leptogenesis and the dark matter abundance and we also can solve the Lithium
problem. Using Casas-Ibarra parameterization, we have found that a very narrow
parameter space of the complex orthogonal matrix elements where the lightest
slepton can have a long lifetime, that is necessary for solving the Lithium
problem. Further, under this condition, there is a parameter region that can
give an explanation for the experimental observations. We have studied three
cases of the right-handed neutrino mass ratio \mbox{\em (i)} $M_{2}=2 \times
M_{1}$, \mbox{\em (ii)} $M_{2}=4 \times M_{1}$, \mbox{\em (iii)} $M_{2}=10
\times M_{1}$ while $M_{3}=40 \times M_{1}$ is fixed. We have obtained the mass
range of the lightest right-handed neutrino mass that lies between $10^9$ GeV
and $10^{11}$ GeV. The important result is that its upper limit is derived by
solving the Lithium problem and the lower limit comes from Leptogenesis.
Calculated low-energy observables of these parameter sets such as BR($\mu \to e
\gamma$) is not yet restricted by experiments and will be verified in the near
future.
|
hep-ph
|
we have investigated the constrained minimal supersymmetric standard model with three righthanded majorana neutrinos whether there still is a parameter region which is consistent with all existing experimental datalimits such as leptogenesis and the dark matter abundance and we also can solve the lithium problem using casasibarra parameterization we have found that a very narrow parameter space of the complex orthogonal matrix elements where the lightest slepton can have a long lifetime that is necessary for solving the lithium problem further under this condition there is a parameter region that can give an explanation for the experimental observations we have studied three cases of the righthanded neutrino mass ratio mboxem i m_22 times m_1 mboxem ii m_24 times m_1 mboxem iii m_210 times m_1 while m_340 times m_1 is fixed we have obtained the mass range of the lightest righthanded neutrino mass that lies between 109 gev and 1011 gev the important result is that its upper limit is derived by solving the lithium problem and the lower limit comes from leptogenesis calculated lowenergy observables of these parameter sets such as brmu to e gamma is not yet restricted by experiments and will be verified in the near future
|
[['we', 'have', 'investigated', 'the', 'constrained', 'minimal', 'supersymmetric', 'standard', 'model', 'with', 'three', 'righthanded', 'majorana', 'neutrinos', 'whether', 'there', 'still', 'is', 'a', 'parameter', 'region', 'which', 'is', 'consistent', 'with', 'all', 'existing', 'experimental', 'datalimits', 'such', 'as', 'leptogenesis', 'and', 'the', 'dark', 'matter', 'abundance', 'and', 'we', 'also', 'can', 'solve', 'the', 'lithium', 'problem', 'using', 'casasibarra', 'parameterization', 'we', 'have', 'found', 'that', 'a', 'very', 'narrow', 'parameter', 'space', 'of', 'the', 'complex', 'orthogonal', 'matrix', 'elements', 'where', 'the', 'lightest', 'slepton', 'can', 'have', 'a', 'long', 'lifetime', 'that', 'is', 'necessary', 'for', 'solving', 'the', 'lithium', 'problem', 'further', 'under', 'this', 'condition', 'there', 'is', 'a', 'parameter', 'region', 'that', 'can', 'give', 'an', 'explanation', 'for', 'the', 'experimental', 'observations', 'we', 'have', 'studied', 'three', 'cases', 'of', 'the', 'righthanded', 'neutrino', 'mass', 'ratio', 'mboxem', 'i', 'm_22', 'times', 'm_1', 'mboxem', 'ii', 'm_24', 'times', 'm_1', 'mboxem', 'iii', 'm_210', 'times', 'm_1', 'while', 'm_340', 'times', 'm_1', 'is', 'fixed', 'we', 'have', 'obtained', 'the', 'mass', 'range', 'of', 'the', 'lightest', 'righthanded', 'neutrino', 'mass', 'that', 'lies', 'between', '109', 'gev', 'and', '1011', 'gev', 'the', 'important', 'result', 'is', 'that', 'its', 'upper', 'limit', 'is', 'derived', 'by', 'solving', 'the', 'lithium', 'problem', 'and', 'the', 'lower', 'limit', 'comes', 'from', 'leptogenesis', 'calculated', 'lowenergy', 'observables', 'of', 'these', 'parameter', 'sets', 'such', 'as', 'brmu', 'to', 'e', 'gamma', 'is', 'not', 'yet', 'restricted', 'by', 'experiments', 'and', 'will', 'be', 'verified', 'in', 'the', 'near', 'future']]
|
[-0.1194037420803453, 0.2306338025819616, 0.0056335846347050095, 0.12960643411260003, -0.045700892254268294, -0.16514188503818017, 0.038592492540281416, 0.3789613845625094, -0.19863779641621346, -0.31841583103202853, 0.0943268785563212, -0.2583073613908598, -0.03489204461695816, 0.19678769606921098, 0.008197768602332537, 0.02805317362814391, 0.0752165606708684, 0.019928004968037108, -0.08284282795633474, -0.21695459897781968, 0.28386197959034876, 0.029845292679965496, 0.18361384823695015, 0.09300040946744753, 0.08029767113015512, -0.0798520294792608, 0.036096913406235755, -0.05692718971864006, -0.1638325989296929, 0.04323056452445524, 0.22833828980991694, 0.12418625075655172, 0.1485103333228724, -0.3539525676632718, -0.17761855543714625, 0.21397617476403105, 0.18510629757716113, 0.017749253065890765, -0.07094778248337003, -0.2634602232939535, 0.12771222665543638, -0.17473805308037874, -0.10784178848701473, -0.02065246021069173, 0.02280678994934626, -0.09725455338003504, -0.31988417428718613, 0.11272558333677102, -0.015293720161675342, -0.051299986142631884, -0.03980404731629854, -0.20139947388801077, -0.029416593851293533, 0.037090665689308425, 0.1356110109380988, -0.010017951665332123, 0.10754006171874626, -0.10312144580083608, -0.07128513901914964, 0.4246620500994233, -0.0773179052582923, -0.16094515832350115, 0.14204902536288017, -0.12316842034354578, -0.1381237678495901, 0.11122333524720174, 0.0987745590522239, 0.11338523407561743, -0.1540027283873333, 0.17943792229331793, -0.13631926261097055, 0.17709179218901244, 0.057687172722023894, 0.010484444036870738, 0.25245037543906934, 0.20430691177453086, 0.08525626305003689, 0.0018975132718748813, -0.0904841937542874, -0.0364532983025574, -0.3255006735669259, -0.1086619140827382, -0.12306061888598285, 0.06837509600429294, -0.10094498633132352, -0.0745060311485443, 0.3652899611708043, 0.1241565558569962, 0.2518578717290253, 0.0241690275231994, 0.27626821200591417, 0.15269511579464626, 0.052218555759374834, 0.046854834098425904, 0.30438601008701915, 0.13747223028057845, 0.059506924752839745, -0.21982066848253526, 0.00849843473762882, 0.061238757677955974]
|
1,803.07687
|
Tidal deformability from GW170817 as a direct probe of the neutron star
radius
|
Gravitational waves from the coalescence of two neutron stars were recently
detected for the first time by the LIGO-Virgo collaboration, in event GW170817.
This detection placed an upper limit on the effective tidal deformability of
the two neutron stars and tightly constrained the chirp mass of the system. We
report here on a new simplification that arises in the effective tidal
deformability of the binary, when the chirp mass is specified. We find that, in
this case, the effective tidal deformability of the binary is surprisingly
independent of the component masses of the individual neutron stars, and
instead depends primarily on the ratio of the chirp mass to the neutron star
radius. Thus, a measurement of the effective tidal deformability can be used to
directly measure the neutron star radius. We find that the upper limit on the
effective tidal deformability from GW170817 implies that the radius cannot be
larger than ~13km, at the 90% level, independent of the assumed masses for the
component stars. The result can be applied generally, to probe the stellar
radii in any neutron star-neutron star merger with a measured chirp mass. The
approximate mass-independence disappears for neutron star-black hole mergers.
Finally, we discuss a Bayesian inference of the equation of state that uses the
measured chirp mass and tidal deformability from GW170817 combined with nuclear
and astrophysical priors and discuss possible statistical biases in this
inference.
|
astro-ph.HE
|
gravitational waves from the coalescence of two neutron stars were recently detected for the first time by the ligovirgo collaboration in event gw170817 this detection placed an upper limit on the effective tidal deformability of the two neutron stars and tightly constrained the chirp mass of the system we report here on a new simplification that arises in the effective tidal deformability of the binary when the chirp mass is specified we find that in this case the effective tidal deformability of the binary is surprisingly independent of the component masses of the individual neutron stars and instead depends primarily on the ratio of the chirp mass to the neutron star radius thus a measurement of the effective tidal deformability can be used to directly measure the neutron star radius we find that the upper limit on the effective tidal deformability from gw170817 implies that the radius cannot be larger than 13km at the 90 level independent of the assumed masses for the component stars the result can be applied generally to probe the stellar radii in any neutron starneutron star merger with a measured chirp mass the approximate massindependence disappears for neutron starblack hole mergers finally we discuss a bayesian inference of the equation of state that uses the measured chirp mass and tidal deformability from gw170817 combined with nuclear and astrophysical priors and discuss possible statistical biases in this inference
|
[['gravitational', 'waves', 'from', 'the', 'coalescence', 'of', 'two', 'neutron', 'stars', 'were', 'recently', 'detected', 'for', 'the', 'first', 'time', 'by', 'the', 'ligovirgo', 'collaboration', 'in', 'event', 'gw170817', 'this', 'detection', 'placed', 'an', 'upper', 'limit', 'on', 'the', 'effective', 'tidal', 'deformability', 'of', 'the', 'two', 'neutron', 'stars', 'and', 'tightly', 'constrained', 'the', 'chirp', 'mass', 'of', 'the', 'system', 'we', 'report', 'here', 'on', 'a', 'new', 'simplification', 'that', 'arises', 'in', 'the', 'effective', 'tidal', 'deformability', 'of', 'the', 'binary', 'when', 'the', 'chirp', 'mass', 'is', 'specified', 'we', 'find', 'that', 'in', 'this', 'case', 'the', 'effective', 'tidal', 'deformability', 'of', 'the', 'binary', 'is', 'surprisingly', 'independent', 'of', 'the', 'component', 'masses', 'of', 'the', 'individual', 'neutron', 'stars', 'and', 'instead', 'depends', 'primarily', 'on', 'the', 'ratio', 'of', 'the', 'chirp', 'mass', 'to', 'the', 'neutron', 'star', 'radius', 'thus', 'a', 'measurement', 'of', 'the', 'effective', 'tidal', 'deformability', 'can', 'be', 'used', 'to', 'directly', 'measure', 'the', 'neutron', 'star', 'radius', 'we', 'find', 'that', 'the', 'upper', 'limit', 'on', 'the', 'effective', 'tidal', 'deformability', 'from', 'gw170817', 'implies', 'that', 'the', 'radius', 'can', 'not', 'be', 'larger', 'than', '13km', 'at', 'the', '90', 'level', 'independent', 'of', 'the', 'assumed', 'masses', 'for', 'the', 'component', 'stars', 'the', 'result', 'can', 'be', 'applied', 'generally', 'to', 'probe', 'the', 'stellar', 'radii', 'in', 'any', 'neutron', 'starneutron', 'star', 'merger', 'with', 'a', 'measured', 'chirp', 'mass', 'the', 'approximate', 'massindependence', 'disappears', 'for', 'neutron', 'starblack', 'hole', 'mergers', 'finally', 'we', 'discuss', 'a', 'bayesian', 'inference', 'of', 'the', 'equation', 'of', 'state', 'that', 'uses', 'the', 'measured', 'chirp', 'mass', 'and', 'tidal', 'deformability', 'from', 'gw170817', 'combined', 'with', 'nuclear', 'and', 'astrophysical', 'priors', 'and', 'discuss', 'possible', 'statistical', 'biases', 'in', 'this', 'inference']]
|
[-0.11023529161111544, 0.1826659819504567, -0.08268712512157506, 0.12355534628367396, -0.13818315957780816, 0.005710827530453645, 0.06729455677219846, 0.3147374744978713, -0.18125289965964567, -0.34084204951293223, 0.05775755835055522, -0.2745440457547843, -0.04804245222863529, 0.24057628220354924, -0.010412986802992455, 0.0055210977141213775, 0.11168688726076824, 0.0865569295903244, -0.1185769035429454, -0.20417890083414497, 0.3533860946337936, 0.08855796305166933, 0.13982487766295992, 0.01756806160890909, 0.08511475213244257, 0.00864427411716927, -0.013295810405852457, -0.029755460600020933, -0.1802698153842357, 0.03483433605775301, 0.20136827827119488, 0.1568023489798542, 0.18272270417128703, -0.3829157860837717, -0.20691952282311035, 0.08283710415483064, 0.15471838246191583, 0.09068649242941366, -0.0700789690397424, -0.28981122456475006, 0.06918639519907406, -0.28520713749645443, -0.1194997251817213, 0.02975143242403545, 0.0742749205566623, 0.07150611465211254, -0.2643058561528094, 0.13365259815630495, 0.07952947473521205, -0.061129141806039254, -0.11889944302293876, -0.11405408648871956, -0.020512205546585914, 0.058872167609233306, 0.0932513537113215, 0.08485776804801769, 0.20603758628757934, -0.11229447857976407, -0.025465363398286246, 0.3692746419267721, -0.07372903572141878, -0.12732553013596412, 0.16614825286639678, -0.2101976082324502, -0.14725431753522336, 0.10939224289386441, 0.19351362218768556, 0.152453613791279, -0.1703155737292434, -0.0051034278460666375, 0.02634360189319792, 0.24757227570202217, 0.11296061455180205, 0.012970365128228082, 0.38230946154809303, 0.1948773634755912, 0.02275225627655763, 0.0817321685863291, -0.21654998069796952, -0.0010720793462094607, -0.24210081803872222, -0.05230498911868861, -0.17044575951839577, 0.05950258772270884, -0.17528425595719846, -0.114363942586601, 0.3005130007351417, 0.11081421553644916, 0.18062799308117272, 0.046106637103778866, 0.3043336397808349, 0.14031236658178572, 0.09159912097481651, 0.061970500325456326, 0.39723825069991753, 0.20192422502066604, 0.0271967912528488, -0.29153270516624524, 0.09311001376316846, 0.009314868905953264]
|
1,803.07688
|
Point process models for quasi-periodic volcanic earthquakes
|
Long period (LP) earthquakes are common at active volcanoes, and are
ubiquitous at persistently active andesitic and dacitic subduction zone
volcanoes. They provide critical information regarding the state of volcanic
unrest, and their occurrence rates are key data for eruption forecasting. LPs
are commonly quasi-periodic or 'anti-clustered', unlike volcano-tectonic (VT)
earthquakes, so the existing Poisson point process methods used to model
occurrence rates of VT earthquakes are unlikely to be optimal for LP data. We
evaluate the performance of candidate formulations for LP data, based on
inhomogeneous point process models with four different inter-event time
distributions: exponential (IP), Gamma (IG), inverse Gaussian (IIG), and
Weibull (IW). We examine how well these models explain the observed data, and
the quality of retrospective forecasts of eruption time. We use a Bayesian MCMC
approach to fit the models. Goodness-of-fit is assessed using Quantile-Quantile
and Kolmogorov-Smirnov methods, and benchmarking against results obtained from
synthetic datasets. IG and IIG models were both found to fit the data well,
with the IIG model slightly outperforming the IG model. Retrospective
forecasting analysis shows that the IG model performs best, with the initial
preference for the IIG model controlled by catalogue incompleteness late in the
sequence. The IG model fits the data significantly better than the IP model,
and simulations show it produces better forecasts for highly periodic data.
Simulations also show that forecast precision increases with the degree of
periodicity of the earthquake process using the IG model, and so should be
better for LP earthquakes than VTs. These results provide a new framework for
point process modelling of volcanic earthquake time series, and verification of
alternative models.
|
stat.AP
|
long period lp earthquakes are common at active volcanoes and are ubiquitous at persistently active andesitic and dacitic subduction zone volcanoes they provide critical information regarding the state of volcanic unrest and their occurrence rates are key data for eruption forecasting lps are commonly quasiperiodic or anticlustered unlike volcanotectonic vt earthquakes so the existing poisson point process methods used to model occurrence rates of vt earthquakes are unlikely to be optimal for lp data we evaluate the performance of candidate formulations for lp data based on inhomogeneous point process models with four different interevent time distributions exponential ip gamma ig inverse gaussian iig and weibull iw we examine how well these models explain the observed data and the quality of retrospective forecasts of eruption time we use a bayesian mcmc approach to fit the models goodnessoffit is assessed using quantilequantile and kolmogorovsmirnov methods and benchmarking against results obtained from synthetic datasets ig and iig models were both found to fit the data well with the iig model slightly outperforming the ig model retrospective forecasting analysis shows that the ig model performs best with the initial preference for the iig model controlled by catalogue incompleteness late in the sequence the ig model fits the data significantly better than the ip model and simulations show it produces better forecasts for highly periodic data simulations also show that forecast precision increases with the degree of periodicity of the earthquake process using the ig model and so should be better for lp earthquakes than vts these results provide a new framework for point process modelling of volcanic earthquake time series and verification of alternative models
|
[['long', 'period', 'lp', 'earthquakes', 'are', 'common', 'at', 'active', 'volcanoes', 'and', 'are', 'ubiquitous', 'at', 'persistently', 'active', 'andesitic', 'and', 'dacitic', 'subduction', 'zone', 'volcanoes', 'they', 'provide', 'critical', 'information', 'regarding', 'the', 'state', 'of', 'volcanic', 'unrest', 'and', 'their', 'occurrence', 'rates', 'are', 'key', 'data', 'for', 'eruption', 'forecasting', 'lps', 'are', 'commonly', 'quasiperiodic', 'or', 'anticlustered', 'unlike', 'volcanotectonic', 'vt', 'earthquakes', 'so', 'the', 'existing', 'poisson', 'point', 'process', 'methods', 'used', 'to', 'model', 'occurrence', 'rates', 'of', 'vt', 'earthquakes', 'are', 'unlikely', 'to', 'be', 'optimal', 'for', 'lp', 'data', 'we', 'evaluate', 'the', 'performance', 'of', 'candidate', 'formulations', 'for', 'lp', 'data', 'based', 'on', 'inhomogeneous', 'point', 'process', 'models', 'with', 'four', 'different', 'interevent', 'time', 'distributions', 'exponential', 'ip', 'gamma', 'ig', 'inverse', 'gaussian', 'iig', 'and', 'weibull', 'iw', 'we', 'examine', 'how', 'well', 'these', 'models', 'explain', 'the', 'observed', 'data', 'and', 'the', 'quality', 'of', 'retrospective', 'forecasts', 'of', 'eruption', 'time', 'we', 'use', 'a', 'bayesian', 'mcmc', 'approach', 'to', 'fit', 'the', 'models', 'goodnessoffit', 'is', 'assessed', 'using', 'quantilequantile', 'and', 'kolmogorovsmirnov', 'methods', 'and', 'benchmarking', 'against', 'results', 'obtained', 'from', 'synthetic', 'datasets', 'ig', 'and', 'iig', 'models', 'were', 'both', 'found', 'to', 'fit', 'the', 'data', 'well', 'with', 'the', 'iig', 'model', 'slightly', 'outperforming', 'the', 'ig', 'model', 'retrospective', 'forecasting', 'analysis', 'shows', 'that', 'the', 'ig', 'model', 'performs', 'best', 'with', 'the', 'initial', 'preference', 'for', 'the', 'iig', 'model', 'controlled', 'by', 'catalogue', 'incompleteness', 'late', 'in', 'the', 'sequence', 'the', 'ig', 'model', 'fits', 'the', 'data', 'significantly', 'better', 'than', 'the', 'ip', 'model', 'and', 'simulations', 'show', 'it', 'produces', 'better', 'forecasts', 'for', 'highly', 'periodic', 'data', 'simulations', 'also', 'show', 'that', 'forecast', 'precision', 'increases', 'with', 'the', 'degree', 'of', 'periodicity', 'of', 'the', 'earthquake', 'process', 'using', 'the', 'ig', 'model', 'and', 'so', 'should', 'be', 'better', 'for', 'lp', 'earthquakes', 'than', 'vts', 'these', 'results', 'provide', 'a', 'new', 'framework', 'for', 'point', 'process', 'modelling', 'of', 'volcanic', 'earthquake', 'time', 'series', 'and', 'verification', 'of', 'alternative', 'models']]
|
[-0.021243351257025974, 0.06414743588909451, -0.09967854188420297, 0.16042236371759053, -0.04738016663121813, -0.15503601139160186, 0.06929603127426073, 0.4057621419122826, -0.23658178054691997, -0.3241624440507325, 0.15928964485799763, -0.2970340043613304, -0.1232158493831377, 0.23603815722021132, -0.050635289210714536, 0.09191013519322562, 0.1062171720744421, -0.0003832552060118636, -0.016499892348503825, -0.2521788875802598, 0.22361233940109093, 0.11021711130378845, 0.318303267426147, -0.05689028878469536, 0.02990188882973966, -0.04195408122125692, -0.061339155740862406, -0.032664877723567604, -0.14006880605890903, 0.06525235571671793, 0.23500031803270302, 0.17255620228140597, 0.22617382654041218, -0.4204407204116942, -0.25307357307237466, 0.11656890622791852, 0.0994731267671753, 0.03655234260240627, 0.01627012944958183, -0.286959789709052, 0.06809002226340664, -0.16261624332526323, -0.09716970167098364, -0.0823092900795604, 0.018422130807494736, 0.05274785166712694, -0.33834526823634764, 0.13155303074669158, 0.06413354728482525, 0.09334716269020898, -0.08182263412784911, -0.15546739647471894, -0.04590482607419334, 0.0999723559486146, 0.0730635794258959, 0.020047693436159596, 0.110674555721386, -0.09914582029609284, -0.152991133481299, 0.3545886074168405, -0.07001084537292858, -0.12144061055972698, 0.19258133304821615, -0.12313356218957221, -0.12134154242333042, 0.10398054681543945, 0.17632260182453843, 0.06884956846278761, -0.1339103711946878, -0.0031155953556560815, -0.0032970533176056678, 0.14165335328722362, 0.024174572308704758, -0.05015654105358244, 0.19714285674254664, 0.20869911798408555, 0.0280146221516912, 0.09011970180582102, -0.1729935389456831, -0.10945204593597001, -0.2525260490047037, -0.08369561584931468, -0.16327484252632418, -0.019131195565994328, -0.13684760159072737, -0.15747579504048612, 0.3907585579392671, 0.21726091694669303, 0.1673966094159106, 0.08347034638081346, 0.2649376273211022, 0.08835752103268431, 0.032458151639048936, 0.10913813436605635, 0.19479900556581603, 0.04844228985496144, 0.10156670658001571, -0.15023268524937555, 0.1389075197516644, 0.030046059814550344]
|
1,803.07689
|
Join-Idle-Queue with Service Elasticity: Large-Scale Asymptotics of a
Non-monotone System
|
We consider the model of a token-based joint auto-scaling and load balancing
strategy, proposed in a recent paper by Mukherjee, Dhara, Borst, and van
Leeuwaarden (SIGMETRICS '17, arXiv:1703.08373), which offers an efficient
scalable implementation and yet achieves asymptotically optimal steady-state
delay performance and energy consumption as the number of servers $N\to\infty$.
In the above work, the asymptotic results are obtained under the assumption
that the queues have fixed-size finite buffers, and therefore the fundamental
question of stability of the proposed scheme with infinite buffers was left
open. In this paper, we address this fundamental stability question. The system
stability under the usual subcritical load assumption is not automatic.
Moreover, the stability may not even hold for all $N$. The key challenge stems
from the fact that the process lacks monotonicity, which has been the powerful
primary tool for establishing stability in load balancing models. We develop a
novel method to prove that the subcritically loaded system is stable for large
enough $N$, and establish convergence of steady-state distributions to the
optimal one, as $N \to \infty$. The method goes beyond the state of the art
techniques -- it uses an induction-based idea and a "weak monotonicity"
property of the model; this technique is of independent interest and may have
broader applicability.
|
math.PR cs.PF
|
we consider the model of a tokenbased joint autoscaling and load balancing strategy proposed in a recent paper by mukherjee dhara borst and van leeuwaarden sigmetrics 17 arxiv170308373 which offers an efficient scalable implementation and yet achieves asymptotically optimal steadystate delay performance and energy consumption as the number of servers ntoinfty in the above work the asymptotic results are obtained under the assumption that the queues have fixedsize finite buffers and therefore the fundamental question of stability of the proposed scheme with infinite buffers was left open in this paper we address this fundamental stability question the system stability under the usual subcritical load assumption is not automatic moreover the stability may not even hold for all n the key challenge stems from the fact that the process lacks monotonicity which has been the powerful primary tool for establishing stability in load balancing models we develop a novel method to prove that the subcritically loaded system is stable for large enough n and establish convergence of steadystate distributions to the optimal one as n to infty the method goes beyond the state of the art techniques it uses an inductionbased idea and a weak monotonicity property of the model this technique is of independent interest and may have broader applicability
|
[['we', 'consider', 'the', 'model', 'of', 'a', 'tokenbased', 'joint', 'autoscaling', 'and', 'load', 'balancing', 'strategy', 'proposed', 'in', 'a', 'recent', 'paper', 'by', 'mukherjee', 'dhara', 'borst', 'and', 'van', 'leeuwaarden', 'sigmetrics', '17', 'arxiv170308373', 'which', 'offers', 'an', 'efficient', 'scalable', 'implementation', 'and', 'yet', 'achieves', 'asymptotically', 'optimal', 'steadystate', 'delay', 'performance', 'and', 'energy', 'consumption', 'as', 'the', 'number', 'of', 'servers', 'ntoinfty', 'in', 'the', 'above', 'work', 'the', 'asymptotic', 'results', 'are', 'obtained', 'under', 'the', 'assumption', 'that', 'the', 'queues', 'have', 'fixedsize', 'finite', 'buffers', 'and', 'therefore', 'the', 'fundamental', 'question', 'of', 'stability', 'of', 'the', 'proposed', 'scheme', 'with', 'infinite', 'buffers', 'was', 'left', 'open', 'in', 'this', 'paper', 'we', 'address', 'this', 'fundamental', 'stability', 'question', 'the', 'system', 'stability', 'under', 'the', 'usual', 'subcritical', 'load', 'assumption', 'is', 'not', 'automatic', 'moreover', 'the', 'stability', 'may', 'not', 'even', 'hold', 'for', 'all', 'n', 'the', 'key', 'challenge', 'stems', 'from', 'the', 'fact', 'that', 'the', 'process', 'lacks', 'monotonicity', 'which', 'has', 'been', 'the', 'powerful', 'primary', 'tool', 'for', 'establishing', 'stability', 'in', 'load', 'balancing', 'models', 'we', 'develop', 'a', 'novel', 'method', 'to', 'prove', 'that', 'the', 'subcritically', 'loaded', 'system', 'is', 'stable', 'for', 'large', 'enough', 'n', 'and', 'establish', 'convergence', 'of', 'steadystate', 'distributions', 'to', 'the', 'optimal', 'one', 'as', 'n', 'to', 'infty', 'the', 'method', 'goes', 'beyond', 'the', 'state', 'of', 'the', 'art', 'techniques', 'it', 'uses', 'an', 'inductionbased', 'idea', 'and', 'a', 'weak', 'monotonicity', 'property', 'of', 'the', 'model', 'this', 'technique', 'is', 'of', 'independent', 'interest', 'and', 'may', 'have', 'broader', 'applicability']]
|
[-0.13863496872672929, 0.06688353228891732, -0.0907266852085969, 0.042365959379022364, -0.036392556420180966, -0.1811714700607646, 0.09703335683716344, 0.340477479936708, -0.26049381786741427, -0.2873416342975005, 0.12413092348544638, -0.21896587365086456, -0.12674588437955872, 0.18593870432471524, -0.11872507700615603, 0.11604876957152147, 0.058121447848462036, 0.02882615982775311, -0.003910709010518115, -0.26282127451372067, 0.29535011004584566, 0.0775617131072542, 0.3570219447143412, 0.0733227003135174, 0.09454692963393774, 0.0044622334746131, 0.010578067122918108, 0.0014833681918635677, -0.13260217440695754, 0.10866091084657552, 0.23009745331092274, 0.14708705864767832, 0.3414749292328342, -0.3957202900279817, -0.20313088030774812, 0.12090836477956333, 0.16410639396405236, 0.08599293870842399, -0.0491919259502494, -0.21785741047888707, 0.13857673969376239, -0.17737552648689148, -0.14699734558895733, -0.0903733458801888, -0.00471396135095426, 0.04723389789570069, -0.2838427252743555, 0.03928579237977951, 0.13341933393801433, 0.013920742294026745, -0.06572443852651018, -0.0948994080974734, 0.02564199928673443, 0.15019623143148522, 0.052746166658597875, -0.00902827162799484, 0.0789360082877017, -0.095361901158107, -0.08274276320797792, 0.3546337759039862, -0.049862938602387476, -0.19094164740375202, 0.18383344653279607, -0.06807001844129484, -0.16094736746233407, 0.10013498297942001, 0.1543308822573095, 0.12084709069183196, -0.14587542565161551, 0.1150396679762013, -0.06837595057795229, 0.1575198271688623, 0.0637136695879525, 0.038882095215995095, 0.1317103028394156, 0.21528970359730115, 0.12523772093300947, 0.15383121091310062, -0.04889214461768307, -0.09261201355597319, -0.26298986094585364, -0.1546325657836157, -0.16832333344657982, 0.04791032013965316, -0.07444871892052554, -0.15240763017420145, 0.3492939666522618, 0.17396653266983547, 0.15487542106423546, 0.09862409034127523, 0.3219929080544229, 0.10766004327041263, 0.014326609927567019, 0.11890638574669903, 0.21617133854967113, 0.10802621553777965, 0.12312454195352325, -0.2159438701397132, 0.09798280402015813, 0.07343419043840459]
|
1,803.0769
|
Adaptive Super-twisting Second-order Sliding Mode for Attitude Control
of Quadcopter UAVs
|
This work addresses the modelling and control aspects for quadcopter or drone
unmanned aerial vehicles (UAVs). First, the mathematical model of the drone is
derived by identifying significant parameters and the negligible ones are
treated as disturbances. The control design begins with the switching surface
selection, then, an Adaptive Super Twisting Sliding Mode (ASTSM) Control
algorithm is applied to adjust attitudes of the quadcopter under harsh
conditions such as nonlinear, strong coupling, high uncertainties and
disturbances. Simulation results show that the proposed controller can achieve
robust operation with disturbance rejection, parametric variation adaptation as
well as chattering attenuation. Comparisons with some commonly used and
advanced controllers in a quadcopter model show advantages of the proposed
control scheme.
|
cs.SY
|
this work addresses the modelling and control aspects for quadcopter or drone unmanned aerial vehicles uavs first the mathematical model of the drone is derived by identifying significant parameters and the negligible ones are treated as disturbances the control design begins with the switching surface selection then an adaptive super twisting sliding mode astsm control algorithm is applied to adjust attitudes of the quadcopter under harsh conditions such as nonlinear strong coupling high uncertainties and disturbances simulation results show that the proposed controller can achieve robust operation with disturbance rejection parametric variation adaptation as well as chattering attenuation comparisons with some commonly used and advanced controllers in a quadcopter model show advantages of the proposed control scheme
|
[['this', 'work', 'addresses', 'the', 'modelling', 'and', 'control', 'aspects', 'for', 'quadcopter', 'or', 'drone', 'unmanned', 'aerial', 'vehicles', 'uavs', 'first', 'the', 'mathematical', 'model', 'of', 'the', 'drone', 'is', 'derived', 'by', 'identifying', 'significant', 'parameters', 'and', 'the', 'negligible', 'ones', 'are', 'treated', 'as', 'disturbances', 'the', 'control', 'design', 'begins', 'with', 'the', 'switching', 'surface', 'selection', 'then', 'an', 'adaptive', 'super', 'twisting', 'sliding', 'mode', 'astsm', 'control', 'algorithm', 'is', 'applied', 'to', 'adjust', 'attitudes', 'of', 'the', 'quadcopter', 'under', 'harsh', 'conditions', 'such', 'as', 'nonlinear', 'strong', 'coupling', 'high', 'uncertainties', 'and', 'disturbances', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'controller', 'can', 'achieve', 'robust', 'operation', 'with', 'disturbance', 'rejection', 'parametric', 'variation', 'adaptation', 'as', 'well', 'as', 'chattering', 'attenuation', 'comparisons', 'with', 'some', 'commonly', 'used', 'and', 'advanced', 'controllers', 'in', 'a', 'quadcopter', 'model', 'show', 'advantages', 'of', 'the', 'proposed', 'control', 'scheme']]
|
[-0.15946521793877513, 0.08024483033095121, -0.041077422640479075, 0.025484664003356715, -0.10564654578800024, -0.20123487540344098, 0.015277590562493122, 0.41036881728836433, -0.2635121760078995, -0.35023175161492465, 0.14849365324460387, -0.18395226893159722, -0.2076584452478183, 0.2168689588634779, -0.20208917125850787, 0.13383593495758572, 0.08399171654761223, -0.028023635037243366, 0.01544866245440689, -0.16981226507903494, 0.21779720339891984, 0.09011761569980017, 0.33116665380155863, -0.03170130967718533, 0.1782982498347149, 0.011390555298742678, 0.005270654331603697, 0.017493266525983424, -0.09286900657332745, 0.04545542355907824, 0.29617955167135546, 0.12141235724316332, 0.3311151568777859, -0.4368169664581916, -0.26035966834149743, 0.04160111091713871, 0.11543963856368872, 0.08640597268120097, -0.0690834439231147, -0.34422096589596235, 0.06115960795432329, -0.2075436126788504, -0.1280125686617825, -0.0655675676414454, -0.03917345396345401, 0.08839363427752436, -0.3204003195117774, -0.03146694988967722, 0.014320011223578054, 0.08707167289284026, -0.10559689158027799, -0.0714785748779581, -0.030177065671084385, 0.17216587968467703, 0.06349156422195314, -0.010900665405768388, 0.22342911932681656, -0.12168577312419576, -0.14970411226988353, 0.39249625144444067, -0.021791349980048835, -0.23969965492343082, 0.1780992914854292, -0.02841246026519943, -0.05556222926905571, 0.12095889388666396, 0.2254896425915047, 0.08682589894732669, -0.15781143868085126, -0.006348956566994432, 0.04056563932079308, 0.14994102459830425, 0.06054229609033992, 0.0008710324402962779, 0.12276970635264597, 0.24832654632788537, 0.16952073870323084, 0.10636126177168675, -0.1127676489052427, -0.10859852610958805, -0.29248373792506754, -0.06996499499755687, -0.09921997880782923, -0.0527672417510044, -0.06628013367650244, -0.10649209763204422, 0.34773385891969216, 0.18364151336397205, 0.11466077575861508, 0.08648029851911847, 0.42883407205527907, 0.10656380593567959, 0.045673310849012744, 0.07884995053553148, 0.26894193298132196, 0.08174952129423939, 0.09419786671561928, -0.2971864137632957, 0.10908610662967287, -0.01321680639099715]
|
1,803.07691
|
Modeling evolution of dark matter substructure and annihilation boost
|
We study evolution of dark matter substructures, especially how they lose the
mass and change density profile after they fall in gravitational potential of
larger host halos. We develop an analytical prescription that models the
subhalo mass evolution and calibrate it to results of N-body numerical
simulations of various scales from very small (Earth size) to large (galaxies
to clusters) halos. We then combine the results with halo accretion histories,
and calculate the subhalo mass function that is physically motivated down to
Earth-mass scales. Our results --- valid for arbitrary host masses and
redshifts --- show reasonable agreement with those of numerical simulations at
resolved scales. Our analytical model also enables self-consistent calculations
of the boost factor of dark matter annhilation, which we find to increase from
tens of percent at the smallest (Earth) and intermediate (dwarfs) masses to a
factor of several at galaxy size, and to become as large as a factor of
$\sim$10 for the largest halos (clusters) at small redshifts. Our analytical
approach can accommodate substructures in the subhalos (sub-subhalos) in a
consistent framework, which we find to give up to a factor of a few enhancement
to the annihilation boost. Presence of the subhalos enhances the intensity of
the isotropic gamma-ray background by a factor of a few, and as the result, the
measurement by Fermi Large Area Telescope excludes the annihilation cross
section greater than $\sim$$4\times 10^{-26}$ cm$^3$ s$^{-1}$ for dark matter
masses up to $\sim$200 GeV.
|
astro-ph.CO astro-ph.HE
|
we study evolution of dark matter substructures especially how they lose the mass and change density profile after they fall in gravitational potential of larger host halos we develop an analytical prescription that models the subhalo mass evolution and calibrate it to results of nbody numerical simulations of various scales from very small earth size to large galaxies to clusters halos we then combine the results with halo accretion histories and calculate the subhalo mass function that is physically motivated down to earthmass scales our results valid for arbitrary host masses and redshifts show reasonable agreement with those of numerical simulations at resolved scales our analytical model also enables selfconsistent calculations of the boost factor of dark matter annhilation which we find to increase from tens of percent at the smallest earth and intermediate dwarfs masses to a factor of several at galaxy size and to become as large as a factor of sim10 for the largest halos clusters at small redshifts our analytical approach can accommodate substructures in the subhalos subsubhalos in a consistent framework which we find to give up to a factor of a few enhancement to the annihilation boost presence of the subhalos enhances the intensity of the isotropic gammaray background by a factor of a few and as the result the measurement by fermi large area telescope excludes the annihilation cross section greater than sim4times 1026 cm3 s1 for dark matter masses up to sim200 gev
|
[['we', 'study', 'evolution', 'of', 'dark', 'matter', 'substructures', 'especially', 'how', 'they', 'lose', 'the', 'mass', 'and', 'change', 'density', 'profile', 'after', 'they', 'fall', 'in', 'gravitational', 'potential', 'of', 'larger', 'host', 'halos', 'we', 'develop', 'an', 'analytical', 'prescription', 'that', 'models', 'the', 'subhalo', 'mass', 'evolution', 'and', 'calibrate', 'it', 'to', 'results', 'of', 'nbody', 'numerical', 'simulations', 'of', 'various', 'scales', 'from', 'very', 'small', 'earth', 'size', 'to', 'large', 'galaxies', 'to', 'clusters', 'halos', 'we', 'then', 'combine', 'the', 'results', 'with', 'halo', 'accretion', 'histories', 'and', 'calculate', 'the', 'subhalo', 'mass', 'function', 'that', 'is', 'physically', 'motivated', 'down', 'to', 'earthmass', 'scales', 'our', 'results', 'valid', 'for', 'arbitrary', 'host', 'masses', 'and', 'redshifts', 'show', 'reasonable', 'agreement', 'with', 'those', 'of', 'numerical', 'simulations', 'at', 'resolved', 'scales', 'our', 'analytical', 'model', 'also', 'enables', 'selfconsistent', 'calculations', 'of', 'the', 'boost', 'factor', 'of', 'dark', 'matter', 'annhilation', 'which', 'we', 'find', 'to', 'increase', 'from', 'tens', 'of', 'percent', 'at', 'the', 'smallest', 'earth', 'and', 'intermediate', 'dwarfs', 'masses', 'to', 'a', 'factor', 'of', 'several', 'at', 'galaxy', 'size', 'and', 'to', 'become', 'as', 'large', 'as', 'a', 'factor', 'of', 'sim10', 'for', 'the', 'largest', 'halos', 'clusters', 'at', 'small', 'redshifts', 'our', 'analytical', 'approach', 'can', 'accommodate', 'substructures', 'in', 'the', 'subhalos', 'subsubhalos', 'in', 'a', 'consistent', 'framework', 'which', 'we', 'find', 'to', 'give', 'up', 'to', 'a', 'factor', 'of', 'a', 'few', 'enhancement', 'to', 'the', 'annihilation', 'boost', 'presence', 'of', 'the', 'subhalos', 'enhances', 'the', 'intensity', 'of', 'the', 'isotropic', 'gammaray', 'background', 'by', 'a', 'factor', 'of', 'a', 'few', 'and', 'as', 'the', 'result', 'the', 'measurement', 'by', 'fermi', 'large', 'area', 'telescope', 'excludes', 'the', 'annihilation', 'cross', 'section', 'greater', 'than', 'sim4times', '1026', 'cm3', 's1', 'for', 'dark', 'matter', 'masses', 'up', 'to', 'sim200', 'gev']]
|
[-0.07151704364460101, 0.14573327467842773, -0.08153214284771458, 0.13073413734492378, -0.06937788057728396, -0.020893345088446782, 0.03284872547989997, 0.363921475531031, -0.16269565391821855, -0.4291296107308066, 0.005265143485952369, -0.2926839728804916, -0.008632067647951953, 0.21758842023202563, 0.04240630799034974, 0.011558192898821245, 0.05886364090778088, -0.03214917772476604, -0.08792127186603481, -0.2789557900731896, 0.30414176415999833, 0.11572913666491501, 0.15876403422369254, 0.05432814433281909, 0.09158078899135605, -0.08624021578348276, -0.04820380426355912, -0.008683434679826019, -0.18441235716001825, 0.041352708376190504, 0.225273508794659, 0.08337946105902991, 0.21101682732573468, -0.38980602122325436, -0.20592819353859268, 0.09721308748365314, 0.19311765905689926, 0.11363881797912817, -0.07762368010691294, -0.28240298127554575, 0.12218014142549447, -0.25071034235763845, -0.19010669946357997, -0.012555168994752636, 0.041134986429401825, -0.005947172151940306, -0.24061731776634146, 0.18092116892047486, -0.029539108895155684, -0.03389055698584592, -0.06492716314501025, -0.10260337759852718, -0.016370770188156684, 0.05811066720035715, 0.07698846194860275, 0.026216393181111245, 0.24244585027725, -0.15803609654129602, -0.020954039558397287, 0.42888424266902614, -0.09330212103602181, -0.059832455207790826, 0.2011942175000566, -0.20450465953561064, -0.14501461302533097, 0.16043118709764498, 0.1943073058017835, 0.08935607247213018, -0.1203583507930002, 0.020565709960212182, -0.0354915929719597, 0.22571122084833156, 0.06428116755714616, 0.025295262718439165, 0.30407352689499056, 0.14690754240614468, 0.0754044406788416, 0.030435320487462326, -0.1445037160886073, -0.04242321892923587, -0.2581842894974159, -0.09419030734990952, -0.14175025711060188, 0.06277947678497348, -0.15121876365265807, -0.10493671564028803, 0.34941803820091166, 0.1569559754720692, 0.2732057784649223, 0.12428384949453175, 0.3051343018737819, 0.0757017549483832, 0.12724648743550993, 0.09098831379952303, 0.28146518116499997, 0.15477073780276437, 0.019405673281193025, -0.21353978666581244, -0.01555982117707304, -0.0473088234637891]
|
1,803.07692
|
The $HI$- and $H_{2}$-to-stellar mass correlations of late- and
early-type galaxies and their consistency with the observational mass
functions
|
We compile and carrefully homogenize local galaxy samples with available
information on stellar, $\rm HI$ and/or $\rm H_{2}$ masses, and morphology.
After processing the information on upper limits in the case of non gas
detections, we determine the $\rm HI$- and $\rm H_{2}$-to-stellar mass
relations and their $1\sigma$ scatter for both late- and early-type galaxies.
The obtained relations are fitted to single or double power laws. Late-type
galaxies are significantly gas richer than early-type ones, specially at high
masses. The respective $\rm H_{2}$-to-$\rm HI$ mass ratios as a function of
$M_{\ast}$ are discussed. Further, we constrain the full mass-dependent
distribution functions of the $\rm HI$- and $\rm H_{2}$-to-stellar mass ratios.
We find that they can be described by a Schechter function for late types and a
(broken) Schechter + uniform function for early types. By using the observed
galaxy stellar mass function and the volume-complete late-to-early-type galaxy
ratio as a function of $M_{\ast}$, these empirical distribution functions are
mapped into $\rm HI$ and $\rm H_{2}$ mass functions. The obtained mass
functions are consistent with those inferred from large surveys. The empirical
gas-to-stellar mass relations and their distributions for local late- and
early-type galaxies presented here can be used to constrain models and
simulations of galaxy evolution.
|
astro-ph.GA
|
we compile and carrefully homogenize local galaxy samples with available information on stellar rm hi andor rm h_2 masses and morphology after processing the information on upper limits in the case of non gas detections we determine the rm hi and rm h_2tostellar mass relations and their 1sigma scatter for both late and earlytype galaxies the obtained relations are fitted to single or double power laws latetype galaxies are significantly gas richer than earlytype ones specially at high masses the respective rm h_2torm hi mass ratios as a function of m_ast are discussed further we constrain the full massdependent distribution functions of the rm hi and rm h_2tostellar mass ratios we find that they can be described by a schechter function for late types and a broken schechter uniform function for early types by using the observed galaxy stellar mass function and the volumecomplete latetoearlytype galaxy ratio as a function of m_ast these empirical distribution functions are mapped into rm hi and rm h_2 mass functions the obtained mass functions are consistent with those inferred from large surveys the empirical gastostellar mass relations and their distributions for local late and earlytype galaxies presented here can be used to constrain models and simulations of galaxy evolution
|
[['we', 'compile', 'and', 'carrefully', 'homogenize', 'local', 'galaxy', 'samples', 'with', 'available', 'information', 'on', 'stellar', 'rm', 'hi', 'andor', 'rm', 'h_2', 'masses', 'and', 'morphology', 'after', 'processing', 'the', 'information', 'on', 'upper', 'limits', 'in', 'the', 'case', 'of', 'non', 'gas', 'detections', 'we', 'determine', 'the', 'rm', 'hi', 'and', 'rm', 'h_2tostellar', 'mass', 'relations', 'and', 'their', '1sigma', 'scatter', 'for', 'both', 'late', 'and', 'earlytype', 'galaxies', 'the', 'obtained', 'relations', 'are', 'fitted', 'to', 'single', 'or', 'double', 'power', 'laws', 'latetype', 'galaxies', 'are', 'significantly', 'gas', 'richer', 'than', 'earlytype', 'ones', 'specially', 'at', 'high', 'masses', 'the', 'respective', 'rm', 'h_2torm', 'hi', 'mass', 'ratios', 'as', 'a', 'function', 'of', 'm_ast', 'are', 'discussed', 'further', 'we', 'constrain', 'the', 'full', 'massdependent', 'distribution', 'functions', 'of', 'the', 'rm', 'hi', 'and', 'rm', 'h_2tostellar', 'mass', 'ratios', 'we', 'find', 'that', 'they', 'can', 'be', 'described', 'by', 'a', 'schechter', 'function', 'for', 'late', 'types', 'and', 'a', 'broken', 'schechter', 'uniform', 'function', 'for', 'early', 'types', 'by', 'using', 'the', 'observed', 'galaxy', 'stellar', 'mass', 'function', 'and', 'the', 'volumecomplete', 'latetoearlytype', 'galaxy', 'ratio', 'as', 'a', 'function', 'of', 'm_ast', 'these', 'empirical', 'distribution', 'functions', 'are', 'mapped', 'into', 'rm', 'hi', 'and', 'rm', 'h_2', 'mass', 'functions', 'the', 'obtained', 'mass', 'functions', 'are', 'consistent', 'with', 'those', 'inferred', 'from', 'large', 'surveys', 'the', 'empirical', 'gastostellar', 'mass', 'relations', 'and', 'their', 'distributions', 'for', 'local', 'late', 'and', 'earlytype', 'galaxies', 'presented', 'here', 'can', 'be', 'used', 'to', 'constrain', 'models', 'and', 'simulations', 'of', 'galaxy', 'evolution']]
|
[-0.029718979790923184, 0.10109610383515247, -0.04057730497093871, 0.181688841865398, -0.04427512100432068, -0.03236512767150998, 0.0015391756966710091, 0.43665500402916224, -0.12807392694056033, -0.3609907129511703, 0.047286907194065864, -0.3006980180600658, 0.0069817039079498495, 0.21358369178022257, 0.042575802695937456, 0.04026409690501168, 0.0025068730767816307, -0.10377726403530688, -0.13120415435638277, -0.27127785013057293, 0.31273645396286154, 0.0285674136588932, 0.16897240376332776, -0.039283820965792984, 0.05984271621971857, -0.099781449371294, -0.10440913520404138, -0.04029070600867271, -0.2325686672646043, 0.015887473474722354, 0.21654221452505226, 0.17671851109014824, 0.1609774680924602, -0.35043588098138573, -0.14335434480104595, 0.11803263024958141, 0.2286382722115377, 0.009895845089340582, -0.07275895265673171, -0.2729171197966207, 0.06493685113353422, -0.2083299357222859, -0.14177583294454962, 0.03484880267176777, 0.019014857796719298, 0.07948253892594949, -0.2723722110275412, 0.21332618016283958, -0.016313419102225453, 0.074435073769273, -0.09324759214534424, -0.14652167454361917, -0.13879227868281305, 0.07816047586675268, -0.001728606204269454, 0.0733195222413633, 0.23885643234010787, -0.16276970157399773, 0.04394715000758879, 0.41592695070430635, -0.09671847586672812, -0.07627585534704849, 0.2151771683199331, -0.2051886734564323, -0.17815389411058277, 0.06030533647397533, 0.17511038444470614, 0.07370979418279604, -0.16635865427087992, 0.038258450106986856, -0.038379719753284004, 0.21515290197916329, 0.01457927791227121, 0.06366458131495165, 0.3268693411862478, 0.035022661363400404, 0.011262486218474805, 0.03969608504907228, -0.14098546677734702, 0.0034123425860889257, -0.2225416907458566, -0.09034090819186531, -0.12921652896271552, 0.08992194196442142, -0.17160003720462555, -0.06942916701955255, 0.3059339486423414, 0.05107964425929822, 0.29399496094789357, 0.1738482614408713, 0.2819238011725247, 0.16720997101976537, 0.1477540587983094, 0.09318823211593553, 0.23960046066902577, 0.18927833242982162, 0.031118194510345348, -0.2326123468845617, 0.05620139494945761, 0.0010662686021532864]
|
1,803.07693
|
Balanced Black and White Coloring Problem on knights chessboards
|
Graph anticoloring problem is partial coloring problem where the main feature
is the opposite rule of the graph coloring problem, i.e., if two vertices are
adjacent, their assigned colors must be the same or at least one of them is
uncolored. In the same way, Berge in 1972 proposed the problem of placing b
black queens and w white queens on a $n \times n$ chessboard such that no two
queens of different color can attack to each other, the complexity of this
problem remains open. In this work we deal with the knight piece under the
balance property, since this special case is the most difficult for brute force
algorithms.
|
cs.DM math.CO
|
graph anticoloring problem is partial coloring problem where the main feature is the opposite rule of the graph coloring problem ie if two vertices are adjacent their assigned colors must be the same or at least one of them is uncolored in the same way berge in 1972 proposed the problem of placing b black queens and w white queens on a n times n chessboard such that no two queens of different color can attack to each other the complexity of this problem remains open in this work we deal with the knight piece under the balance property since this special case is the most difficult for brute force algorithms
|
[['graph', 'anticoloring', 'problem', 'is', 'partial', 'coloring', 'problem', 'where', 'the', 'main', 'feature', 'is', 'the', 'opposite', 'rule', 'of', 'the', 'graph', 'coloring', 'problem', 'ie', 'if', 'two', 'vertices', 'are', 'adjacent', 'their', 'assigned', 'colors', 'must', 'be', 'the', 'same', 'or', 'at', 'least', 'one', 'of', 'them', 'is', 'uncolored', 'in', 'the', 'same', 'way', 'berge', 'in', '1972', 'proposed', 'the', 'problem', 'of', 'placing', 'b', 'black', 'queens', 'and', 'w', 'white', 'queens', 'on', 'a', 'n', 'times', 'n', 'chessboard', 'such', 'that', 'no', 'two', 'queens', 'of', 'different', 'color', 'can', 'attack', 'to', 'each', 'other', 'the', 'complexity', 'of', 'this', 'problem', 'remains', 'open', 'in', 'this', 'work', 'we', 'deal', 'with', 'the', 'knight', 'piece', 'under', 'the', 'balance', 'property', 'since', 'this', 'special', 'case', 'is', 'the', 'most', 'difficult', 'for', 'brute', 'force', 'algorithms']]
|
[-0.157311773435636, 0.11134027825583788, -0.0557444526094266, 0.04360977391479537, -0.11979641457596286, -0.215740565138615, 0.06295685277913105, 0.3811436852101575, -0.27495977430794893, -0.3349529969336634, 0.09574367299104448, -0.33182497214398937, -0.10278496298388663, 0.09185749288775366, -0.13222479462433098, 0.015062171666332605, 0.06593182075091383, 0.09842753775618886, 0.03549206144896082, -0.3353901337520008, 0.30771183550611814, -0.06614074346143753, 0.2084960913285613, 0.047357789513295175, 0.08279464682140811, 0.03099399729716507, -0.0018560649742456999, 0.04877795664678243, -0.06994202905790933, 0.038822100972968406, 0.2543835227293047, 0.15006190772083672, 0.29364990263499996, -0.41964416687630796, -0.12047659852118654, 0.1881835276811299, 0.12725448986430737, 0.09722800752656026, -0.004352930951228535, -0.20892971130722965, 0.11797964287583124, -0.09250216866758737, -0.07067485862750221, 0.0906687749126418, 0.09022230948956514, -0.052094441694630816, -0.23732097871093588, -0.018953486161560496, 0.09777019413357431, 0.004625242569653148, 0.003696919378655201, -0.17933756046166474, 0.001890397575599226, 0.1545058961555531, 0.04881110850890929, 0.08976975204634734, 0.04721535560674965, -0.13124214910309423, -0.146068146482999, 0.40752485960309226, 0.018129103766246275, -0.1959706995646808, 0.16634768232364547, -0.09615567674098367, -0.1834347574759952, 0.09139518116029319, 0.10276999387212775, 0.16748193285046992, -0.1311408013528721, 0.0825009595989038, -0.13438053109090436, 0.1321564804879017, 0.14687150547873568, 0.007796637001659044, 0.17138959197327494, 0.12383370958268643, 0.14753816758324814, 0.1601362197442954, -0.03390776421477891, -0.04864512396637689, -0.2598761342042549, -0.12379004241771657, -0.2089244111102413, 0.041656905920668084, -0.10238550213517474, -0.15091954385861756, 0.36235010236374693, 0.12216155487112701, 0.20152206267230213, 0.022831706668842922, 0.30754852056164633, 0.08744069467806681, 0.046956054104851895, 0.12060588475909423, 0.1769619976466691, 0.08492849569090388, 0.02609696050005203, -0.20328853178600018, 0.0883064388636161, 0.13372524378990586]
|
1,803.07694
|
Defective and Clustered Graph Colouring
|
Consider the following two ways to colour the vertices of a graph where the
requirement that adjacent vertices get distinct colours is relaxed. A colouring
has "defect" $d$ if each monochromatic component has maximum degree at most
$d$. A colouring has "clustering" $c$ if each monochromatic component has at
most $c$ vertices. This paper surveys research on these types of colourings,
where the first priority is to minimise the number of colours, with small
defect or small clustering as a secondary goal. List colouring variants are
also considered. The following graph classes are studied: outerplanar graphs,
planar graphs, graphs embeddable in surfaces, graphs with given maximum degree,
graphs with given maximum average degree, graphs excluding a given subgraph,
graphs with linear crossing number, linklessly or knotlessly embeddable graphs,
graphs with given Colin de Verdi\`ere parameter, graphs with given
circumference, graphs excluding a fixed graph as an immersion, graphs with
given thickness, graphs with given stack- or queue-number, graphs excluding
$K_t$ as a minor, graphs excluding $K_{s,t}$ as a minor, and graphs excluding
an arbitrary graph $H$ as a minor. Several open problems are discussed.
|
math.CO
|
consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed a colouring has defect d if each monochromatic component has maximum degree at most d a colouring has clustering c if each monochromatic component has at most c vertices this paper surveys research on these types of colourings where the first priority is to minimise the number of colours with small defect or small clustering as a secondary goal list colouring variants are also considered the following graph classes are studied outerplanar graphs planar graphs graphs embeddable in surfaces graphs with given maximum degree graphs with given maximum average degree graphs excluding a given subgraph graphs with linear crossing number linklessly or knotlessly embeddable graphs graphs with given colin de verdiere parameter graphs with given circumference graphs excluding a fixed graph as an immersion graphs with given thickness graphs with given stack or queuenumber graphs excluding k_t as a minor graphs excluding k_st as a minor and graphs excluding an arbitrary graph h as a minor several open problems are discussed
|
[['consider', 'the', 'following', 'two', 'ways', 'to', 'colour', 'the', 'vertices', 'of', 'a', 'graph', 'where', 'the', 'requirement', 'that', 'adjacent', 'vertices', 'get', 'distinct', 'colours', 'is', 'relaxed', 'a', 'colouring', 'has', 'defect', 'd', 'if', 'each', 'monochromatic', 'component', 'has', 'maximum', 'degree', 'at', 'most', 'd', 'a', 'colouring', 'has', 'clustering', 'c', 'if', 'each', 'monochromatic', 'component', 'has', 'at', 'most', 'c', 'vertices', 'this', 'paper', 'surveys', 'research', 'on', 'these', 'types', 'of', 'colourings', 'where', 'the', 'first', 'priority', 'is', 'to', 'minimise', 'the', 'number', 'of', 'colours', 'with', 'small', 'defect', 'or', 'small', 'clustering', 'as', 'a', 'secondary', 'goal', 'list', 'colouring', 'variants', 'are', 'also', 'considered', 'the', 'following', 'graph', 'classes', 'are', 'studied', 'outerplanar', 'graphs', 'planar', 'graphs', 'graphs', 'embeddable', 'in', 'surfaces', 'graphs', 'with', 'given', 'maximum', 'degree', 'graphs', 'with', 'given', 'maximum', 'average', 'degree', 'graphs', 'excluding', 'a', 'given', 'subgraph', 'graphs', 'with', 'linear', 'crossing', 'number', 'linklessly', 'or', 'knotlessly', 'embeddable', 'graphs', 'graphs', 'with', 'given', 'colin', 'de', 'verdiere', 'parameter', 'graphs', 'with', 'given', 'circumference', 'graphs', 'excluding', 'a', 'fixed', 'graph', 'as', 'an', 'immersion', 'graphs', 'with', 'given', 'thickness', 'graphs', 'with', 'given', 'stack', 'or', 'queuenumber', 'graphs', 'excluding', 'k_t', 'as', 'a', 'minor', 'graphs', 'excluding', 'k_st', 'as', 'a', 'minor', 'and', 'graphs', 'excluding', 'an', 'arbitrary', 'graph', 'h', 'as', 'a', 'minor', 'several', 'open', 'problems', 'are', 'discussed']]
|
[-0.19101597212987845, 0.13798231850750362, 0.020854559039971868, 0.005165463996048549, -0.15276312443957019, -0.1798843750450251, 0.009349573394054638, 0.44106685813984586, -0.224328117247905, -0.3809796379563587, 0.09656285906472635, -0.35608294342334074, -0.07435982481734267, 0.054076977737013844, -0.12572583161253748, 0.015210912813549566, 0.14857350988568016, 0.091234192353943, 0.08090285938156799, -0.29261563636319293, 0.297141806800122, -0.04990621706053533, 0.11885917808127697, 0.08969708412244427, 0.06050818600269452, 0.058794845194591445, 0.006023017281813985, 0.16460199539340992, -0.1986845137955461, 0.038274558960801106, 0.2846230654850032, 0.15783771835878246, 0.22626203835987654, -0.33098772924159314, -0.18230733625232012, 0.26414720444364953, 0.09832543164206659, 0.04459599583267229, -0.005564866935493313, -0.18935475011910896, 0.11214710858299351, -0.07193349984363472, -0.07826259003048336, 0.08725176344986985, 0.15135370959308955, 0.023437313699860716, -0.22672631400840895, -0.06541570050332089, 0.11119374896455658, 0.07580547724326289, 0.1299684789347274, -0.20996660950384993, -0.10975970266020445, 0.09169290809322128, -0.0760176446514021, 0.09730243175468646, 0.04037024375926601, -0.12642325785983088, -0.22748123977557233, 0.39883792939814716, 0.005449501761932516, -0.13700399579622788, 0.11924395720153803, -0.11630916151999307, -0.24657522494741843, 0.10509743627486497, 0.12093203137959532, 0.1557882732635474, -0.08656680005821374, 0.11250997596271489, -0.08845020946664889, 0.12067103817425363, 0.19439192842297723, 0.006104865434574462, 0.1362972222472149, 0.13861937931219695, 0.18813032594056484, 0.20703561779218496, 0.02312601514572858, 0.03896435360739751, -0.2876272521750197, -0.045495713517690696, -0.22714258298720616, 0.04382740203392962, -0.2714520880265913, -0.24710383486509058, 0.42584089325649327, 0.02385809926998094, 0.21549273073123615, 0.11066205011772327, 0.22738582144435393, 0.04781731141952523, 0.08013847487841229, 0.2228829538897494, 0.09222182506043973, 0.207680273910506, -0.05416625200470533, -0.10552663069416876, 0.08791678100875248, 0.12968281485888436]
|
1,803.07695
|
Detection and characterization of spin-orbit resonances in the advanced
gravitational wave detectors era
|
In this paper, we test the performance of templates in detection and
characterization of Spin-orbit resonant (SOR) binaries. We use precessing
SEOBNRv3 waveforms as well as {\it four} numerical relativity (NR) waveforms to
model GWs from SOR binaries and filter them through IMRPhenomD, SEOBNRv4
(non-precessing) and IMRPhenomPv2 (precessing) approximants. We find that
IMRPhenomD and SEOBNRv4 recover only $\sim70\%$ of injections with fitting
factor (FF) higher than 0.97 (or 90\% of injections with ${\rm FF}
>0.9$).However, using the sky-maxed statistic, IMRPhenomPv2 performs
magnificently better than their non-precessing counterparts with recovering
$99\%$ of the injections with FFs higher than 0.97. Interestingly, injections
with $\Delta \phi = 180^{\circ}$ have higher FFs ($\Delta \phi$ is the angle
between the components of the black hole spins in the plane orthogonal to the
orbital angular momentum) as compared to their $\Delta \phi =0^{\circ}$ and
generic counterparts. This implies that we will have a slight observation bias
towards $\Delta \phi=180^{\circ}$ SORs while using non-precessing templates for
searches. All template approximants are able to recover most of the injected NR
waveforms with FFs $>0.95$. For all the injections including NR, the error in
estimating chirp mass remains below $<10\%$ with minimum error for $\Delta \phi
= 180^{\circ}$ resonant binaries. The symmetric mass ratio can be estimated
with errors below $15\%$. The effective spin parameter $\chi_{\rm eff}$ is
measured with maximum absolute error of 0.13. The in-plane spin parameter
$\chi_p$ is mostly underestimated indicating that a precessing signal will be
recovered as a relatively less precessing signal. Based on our findings, we
conclude that we not only need improvements in waveform models towards
precession and non-quadrupole modes but also better search strategies for
precessing GW signals.
|
gr-qc
|
in this paper we test the performance of templates in detection and characterization of spinorbit resonant sor binaries we use precessing seobnrv3 waveforms as well as it four numerical relativity nr waveforms to model gws from sor binaries and filter them through imrphenomd seobnrv4 nonprecessing and imrphenompv2 precessing approximants we find that imrphenomd and seobnrv4 recover only sim70 of injections with fitting factor ff higher than 097 or 90 of injections with rm ff 09however using the skymaxed statistic imrphenompv2 performs magnificently better than their nonprecessing counterparts with recovering 99 of the injections with ffs higher than 097 interestingly injections with delta phi 180circ have higher ffs delta phi is the angle between the components of the black hole spins in the plane orthogonal to the orbital angular momentum as compared to their delta phi 0circ and generic counterparts this implies that we will have a slight observation bias towards delta phi180circ sors while using nonprecessing templates for searches all template approximants are able to recover most of the injected nr waveforms with ffs 095 for all the injections including nr the error in estimating chirp mass remains below 10 with minimum error for delta phi 180circ resonant binaries the symmetric mass ratio can be estimated with errors below 15 the effective spin parameter chi_rm eff is measured with maximum absolute error of 013 the inplane spin parameter chi_p is mostly underestimated indicating that a precessing signal will be recovered as a relatively less precessing signal based on our findings we conclude that we not only need improvements in waveform models towards precession and nonquadrupole modes but also better search strategies for precessing gw signals
|
[['in', 'this', 'paper', 'we', 'test', 'the', 'performance', 'of', 'templates', 'in', 'detection', 'and', 'characterization', 'of', 'spinorbit', 'resonant', 'sor', 'binaries', 'we', 'use', 'precessing', 'seobnrv3', 'waveforms', 'as', 'well', 'as', 'it', 'four', 'numerical', 'relativity', 'nr', 'waveforms', 'to', 'model', 'gws', 'from', 'sor', 'binaries', 'and', 'filter', 'them', 'through', 'imrphenomd', 'seobnrv4', 'nonprecessing', 'and', 'imrphenompv2', 'precessing', 'approximants', 'we', 'find', 'that', 'imrphenomd', 'and', 'seobnrv4', 'recover', 'only', 'sim70', 'of', 'injections', 'with', 'fitting', 'factor', 'ff', 'higher', 'than', '097', 'or', '90', 'of', 'injections', 'with', 'rm', 'ff', '09however', 'using', 'the', 'skymaxed', 'statistic', 'imrphenompv2', 'performs', 'magnificently', 'better', 'than', 'their', 'nonprecessing', 'counterparts', 'with', 'recovering', '99', 'of', 'the', 'injections', 'with', 'ffs', 'higher', 'than', '097', 'interestingly', 'injections', 'with', 'delta', 'phi', '180circ', 'have', 'higher', 'ffs', 'delta', 'phi', 'is', 'the', 'angle', 'between', 'the', 'components', 'of', 'the', 'black', 'hole', 'spins', 'in', 'the', 'plane', 'orthogonal', 'to', 'the', 'orbital', 'angular', 'momentum', 'as', 'compared', 'to', 'their', 'delta', 'phi', '0circ', 'and', 'generic', 'counterparts', 'this', 'implies', 'that', 'we', 'will', 'have', 'a', 'slight', 'observation', 'bias', 'towards', 'delta', 'phi180circ', 'sors', 'while', 'using', 'nonprecessing', 'templates', 'for', 'searches', 'all', 'template', 'approximants', 'are', 'able', 'to', 'recover', 'most', 'of', 'the', 'injected', 'nr', 'waveforms', 'with', 'ffs', '095', 'for', 'all', 'the', 'injections', 'including', 'nr', 'the', 'error', 'in', 'estimating', 'chirp', 'mass', 'remains', 'below', '10', 'with', 'minimum', 'error', 'for', 'delta', 'phi', '180circ', 'resonant', 'binaries', 'the', 'symmetric', 'mass', 'ratio', 'can', 'be', 'estimated', 'with', 'errors', 'below', '15', 'the', 'effective', 'spin', 'parameter', 'chi_rm', 'eff', 'is', 'measured', 'with', 'maximum', 'absolute', 'error', 'of', '013', 'the', 'inplane', 'spin', 'parameter', 'chi_p', 'is', 'mostly', 'underestimated', 'indicating', 'that', 'a', 'precessing', 'signal', 'will', 'be', 'recovered', 'as', 'a', 'relatively', 'less', 'precessing', 'signal', 'based', 'on', 'our', 'findings', 'we', 'conclude', 'that', 'we', 'not', 'only', 'need', 'improvements', 'in', 'waveform', 'models', 'towards', 'precession', 'and', 'nonquadrupole', 'modes', 'but', 'also', 'better', 'search', 'strategies', 'for', 'precessing', 'gw', 'signals']]
|
[-0.1491963415105334, 0.12522125986117102, -0.004444472666364163, 0.07633544661161175, -0.07601485613678746, -0.1431281058158835, 0.06734578412322341, 0.3859673242524663, -0.15561509959832834, -0.3381233236492228, 0.06236221839678953, -0.32715663728338445, -0.05567601333827684, 0.263397941371509, -0.006154145077061912, 0.032898243182845524, 0.06646011056085734, -0.030343970586888164, -0.1580093643621213, -0.17023887771596063, 0.22085760962486614, 0.07972522585324067, 0.15912018797654823, -0.0629757369234165, 0.04791966664197389, 0.009536311040659818, 0.020905737331999904, -0.02099973916569177, -0.1421598270523699, 0.02824326612479875, 0.25130283604059567, 0.10363581109499244, 0.16607093687343877, -0.3260993356739431, -0.16182045619729357, 0.10808709432304194, 0.15173628360079258, 0.10525979443328277, -0.030125486203948695, -0.2440817769987488, 0.13624443701872438, -0.24764356201750856, -0.09161933569124117, -0.06042080514731317, 0.04171594848155698, 0.040496749914703235, -0.29433722458334693, 0.14972066011742916, 0.07787682057524388, 0.0025524926210945364, -0.04994925004276036, -0.17875023284774644, -0.06113463537151213, 0.05047353688346715, 0.0749965847871328, 0.13962645047371658, 0.1561321426244617, -0.07501096925390062, -0.1089235258542056, 0.366347711362965, -0.07996558844489995, -0.21724450392888256, 0.1110638841333532, -0.2351749374253867, -0.08396065040399074, 0.14502540928215774, 0.1635217605416983, 0.1355607052186422, -0.11889239927147761, 0.003892377777768107, 0.0772968459277763, 0.23571867265041768, 0.09569380694644197, 0.030140592031410264, 0.2702313328276539, 0.11493637510369915, 0.036683323153444206, 0.08322568901734057, -0.17491190558864808, -0.014912915658308467, -0.23009796173167107, -0.053632383309270476, -0.14191406272156576, 0.06117799005866854, -0.14007799850354358, -0.1053984965033391, 0.3710772172164391, 0.1334339845372383, 0.1962625699071556, 0.09805839979569153, 0.3204852570882341, 0.10566894692986833, 0.0686241316879579, 0.08801083955468665, 0.3232901419464992, 0.11349466058548868, 0.02403546637523344, -0.20505421455720138, 0.03708098587230779, -0.026712474780009977]
|
1,803.07696
|
Inverse Optimal Control from Incomplete Trajectory Observations
|
This article develops a methodology that enables learning an objective
function of an optimal control system from incomplete trajectory observations.
The objective function is assumed to be a weighted sum of features (or basis
functions) with unknown weights, and the observed data is a segment of a
trajectory of system states and inputs. The proposed technique introduces the
concept of the recovery matrix to establish the relationship between any
available segment of the trajectory and the weights of given candidate
features. The rank of the recovery matrix indicates whether a subset of
relevant features can be found among the candidate features and the
corresponding weights can be learned from the segment data. The recovery matrix
can be obtained iteratively and its rank non-decreasing property shows that
additional observations may contribute to the objective learning. Based on the
recovery matrix, a method for using incomplete trajectory observations to learn
the weights of selected features is established, and an incremental inverse
optimal control algorithm is developed by automatically finding the minimal
required observation. The effectiveness of the proposed method is demonstrated
on a linear quadratic regulator system and a simulated robot manipulator.
|
cs.RO cs.SY
|
this article develops a methodology that enables learning an objective function of an optimal control system from incomplete trajectory observations the objective function is assumed to be a weighted sum of features or basis functions with unknown weights and the observed data is a segment of a trajectory of system states and inputs the proposed technique introduces the concept of the recovery matrix to establish the relationship between any available segment of the trajectory and the weights of given candidate features the rank of the recovery matrix indicates whether a subset of relevant features can be found among the candidate features and the corresponding weights can be learned from the segment data the recovery matrix can be obtained iteratively and its rank nondecreasing property shows that additional observations may contribute to the objective learning based on the recovery matrix a method for using incomplete trajectory observations to learn the weights of selected features is established and an incremental inverse optimal control algorithm is developed by automatically finding the minimal required observation the effectiveness of the proposed method is demonstrated on a linear quadratic regulator system and a simulated robot manipulator
|
[['this', 'article', 'develops', 'a', 'methodology', 'that', 'enables', 'learning', 'an', 'objective', 'function', 'of', 'an', 'optimal', 'control', 'system', 'from', 'incomplete', 'trajectory', 'observations', 'the', 'objective', 'function', 'is', 'assumed', 'to', 'be', 'a', 'weighted', 'sum', 'of', 'features', 'or', 'basis', 'functions', 'with', 'unknown', 'weights', 'and', 'the', 'observed', 'data', 'is', 'a', 'segment', 'of', 'a', 'trajectory', 'of', 'system', 'states', 'and', 'inputs', 'the', 'proposed', 'technique', 'introduces', 'the', 'concept', 'of', 'the', 'recovery', 'matrix', 'to', 'establish', 'the', 'relationship', 'between', 'any', 'available', 'segment', 'of', 'the', 'trajectory', 'and', 'the', 'weights', 'of', 'given', 'candidate', 'features', 'the', 'rank', 'of', 'the', 'recovery', 'matrix', 'indicates', 'whether', 'a', 'subset', 'of', 'relevant', 'features', 'can', 'be', 'found', 'among', 'the', 'candidate', 'features', 'and', 'the', 'corresponding', 'weights', 'can', 'be', 'learned', 'from', 'the', 'segment', 'data', 'the', 'recovery', 'matrix', 'can', 'be', 'obtained', 'iteratively', 'and', 'its', 'rank', 'nondecreasing', 'property', 'shows', 'that', 'additional', 'observations', 'may', 'contribute', 'to', 'the', 'objective', 'learning', 'based', 'on', 'the', 'recovery', 'matrix', 'a', 'method', 'for', 'using', 'incomplete', 'trajectory', 'observations', 'to', 'learn', 'the', 'weights', 'of', 'selected', 'features', 'is', 'established', 'and', 'an', 'incremental', 'inverse', 'optimal', 'control', 'algorithm', 'is', 'developed', 'by', 'automatically', 'finding', 'the', 'minimal', 'required', 'observation', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'is', 'demonstrated', 'on', 'a', 'linear', 'quadratic', 'regulator', 'system', 'and', 'a', 'simulated', 'robot', 'manipulator']]
|
[-0.09600191757965244, 0.019239692297062568, -0.11806591275074568, 0.02296386762816263, -0.10140901901269038, -0.1436226438583904, 0.05712245622845857, 0.3891627240460366, -0.3306179069276703, -0.2986089397025736, 0.12597523923951054, -0.2670247113503712, -0.20291972575145528, 0.1625691782425795, -0.07659561102719684, 0.10948259876520176, 0.09178091174138611, 0.07667332421528715, -0.06795231559387359, -0.2417116928539288, 0.3011756026474024, 0.06757633248589148, 0.2824697047654282, 0.0015166017447451228, 0.15851419188302796, 0.021773313104763235, -0.04120166329912057, -0.005639282928926772, -0.065188887725526, 0.1473205984456734, 0.274615110068484, 0.22018021833286375, 0.3004553457771085, -0.37916012200968047, -0.17819083253117768, 0.12275293317476385, 0.09577779000330912, 0.07127523506060243, -0.021635829195331194, -0.28586333405079417, 0.09561693405389393, -0.11361314902866357, -0.1098704484609985, -0.07018732737051323, -0.032532982985293, 0.009522473084201155, -0.37359056218380204, 0.015774574829265475, 0.0295701804485074, 0.018394952989183366, -0.11280464365845547, -0.11281148013475008, -0.006841665214711899, 0.14213786878819137, 0.0277216916131836, 0.052554704365933215, 0.14225309129167152, -0.10578185382274617, -0.12220866808385931, 0.341399190873888, -0.033208398301595526, -0.2240451577854784, 0.13791032766702732, -0.06674646745729995, -0.07357219367802731, 0.15000817634557423, 0.17908930951288263, 0.11561785068785722, -0.17265706357889268, 0.030834011295136358, -0.05479997482248827, 0.1985335521056856, -0.01879667968146111, -0.020035686785061107, 0.17388324557641202, 0.16590469973161817, 0.09102652701549233, 0.1593234232259228, -0.09899766351537485, -0.04554800194639124, -0.2883268174617306, -0.10792233003946756, -0.2523087473843541, -0.022492183102784974, -0.10375805943170378, -0.14543363529504094, 0.43000837186547486, 0.14577354941284285, 0.2469986305547584, 0.09000136858759154, 0.29107324146714647, 0.11838175786818426, 0.08761370875382501, 0.0774060306776511, 0.19238385228611726, 0.08841982409725652, 0.05125025994340448, -0.2264557302034901, 0.14008872868542216, 0.07850675053992553]
|
1,803.07697
|
180-degree phase shift of magnetoelastic waves observed by
phase-resolved spin-wave tomography
|
We have investigated optically-excited magnetoelastic waves by phase-resolved
spin-wave tomography (PSWaT). PSWaT reconstructs dispersion relation of spin
waves together with their phase information by using time-resolved
magneto-optical imaging for spin-wave propagation followed by an analysis based
on the convolution theorem and a complex Fourier transform. In PSWaT spectra
for a Bi-doped garnet film, we found a 180 degree phase shift of magnetoelastic
waves at around the crossing of the dispersion relations of spin and elastic
waves. The result is explained by a coupling between spin waves and elastic
waves through magnetoelastic interaction. We also propose an efficient way for
phase manipulation of magnetoelastic waves by rotating the orientation of
magnetization less than 10 degree.
|
cond-mat.mtrl-sci
|
we have investigated opticallyexcited magnetoelastic waves by phaseresolved spinwave tomography pswat pswat reconstructs dispersion relation of spin waves together with their phase information by using timeresolved magnetooptical imaging for spinwave propagation followed by an analysis based on the convolution theorem and a complex fourier transform in pswat spectra for a bidoped garnet film we found a 180 degree phase shift of magnetoelastic waves at around the crossing of the dispersion relations of spin and elastic waves the result is explained by a coupling between spin waves and elastic waves through magnetoelastic interaction we also propose an efficient way for phase manipulation of magnetoelastic waves by rotating the orientation of magnetization less than 10 degree
|
[['we', 'have', 'investigated', 'opticallyexcited', 'magnetoelastic', 'waves', 'by', 'phaseresolved', 'spinwave', 'tomography', 'pswat', 'pswat', 'reconstructs', 'dispersion', 'relation', 'of', 'spin', 'waves', 'together', 'with', 'their', 'phase', 'information', 'by', 'using', 'timeresolved', 'magnetooptical', 'imaging', 'for', 'spinwave', 'propagation', 'followed', 'by', 'an', 'analysis', 'based', 'on', 'the', 'convolution', 'theorem', 'and', 'a', 'complex', 'fourier', 'transform', 'in', 'pswat', 'spectra', 'for', 'a', 'bidoped', 'garnet', 'film', 'we', 'found', 'a', '180', 'degree', 'phase', 'shift', 'of', 'magnetoelastic', 'waves', 'at', 'around', 'the', 'crossing', 'of', 'the', 'dispersion', 'relations', 'of', 'spin', 'and', 'elastic', 'waves', 'the', 'result', 'is', 'explained', 'by', 'a', 'coupling', 'between', 'spin', 'waves', 'and', 'elastic', 'waves', 'through', 'magnetoelastic', 'interaction', 'we', 'also', 'propose', 'an', 'efficient', 'way', 'for', 'phase', 'manipulation', 'of', 'magnetoelastic', 'waves', 'by', 'rotating', 'the', 'orientation', 'of', 'magnetization', 'less', 'than', '10', 'degree']]
|
[-0.19516328041311026, 0.23856825520628613, -0.07204221906099599, 0.012123859078999152, -0.1402744680475607, -0.056086723280155605, 0.03681010079341369, 0.424329581817514, -0.2835753688490705, -0.2692231305858545, 0.0390955464793941, -0.3061113992477195, -0.15486534406418764, 0.2442380530727014, 0.11140718052915313, 0.026046782119297666, -0.00949144400983003, -0.06792451155355625, -0.06328857041437898, -0.05586026599549018, 0.268194706399778, 0.009867018889309022, 0.28539209825950757, 0.020868644044783554, 0.10666404534621458, 0.10169359756094452, 0.05596492256511722, -0.013192658998856419, -0.14646191207136502, 0.07699708045019131, 0.2413679359040607, -0.025965063411971193, 0.15167532943336196, -0.47918205545845505, -0.23555744892770522, -0.02465491391424286, 0.15250479846604562, 0.16360316293216065, -0.07739579239186194, -0.31957440974452256, -0.004759835643007567, -0.13323860188865455, -0.13565656109794713, -0.09699359770635502, 0.019246310579770227, 0.008851518421515561, -0.19811035553197653, 0.1442114983727694, 0.09495266790812214, 0.14008792968499556, -0.08722849178797844, -0.03822278327373951, -0.09816203027832926, -0.0253971890472856, 0.037108200714563985, 0.04491844276076575, 0.07010957958552529, -0.0733291706327643, -0.11202800362738535, 0.3381746787447156, -0.10062377270795671, -0.1288595771265886, 0.08820866635518573, -0.17431760871075216, -0.01973195724483383, 0.2014002794800163, 0.178719508821112, 0.1205435777573209, -0.11589910982487102, 0.008876717165868174, 0.018942762460363537, 0.22499556285778485, 0.14077515407514415, 0.045688620080207396, 0.26911830849814833, 0.17319459609867058, -0.018216702092455274, 0.15731295332794584, -0.18015351862720164, 0.04116990053290991, -0.19865389013859003, -0.13045336922892092, -0.2130712801427172, 0.029789814481454527, -0.10641753742138942, -0.12877499529879474, 0.42995821858609196, 0.08642074739838247, 0.12734192850787127, 0.003934757694144521, 0.28318996479113895, 0.13303153809127316, 0.0397597509931585, 0.04846746255766208, 0.33543085401649014, 0.27413985755073983, 0.1273335303759954, -0.29081798014394417, 0.047803269927961786, 0.03634938307662021]
|
1,803.07698
|
The classification of $n$-dimensional anticommutative algebras with
$(n-3)$-dimensional annihilator
|
We give the classification of all $n$-dimensional anticommutative complex
algebras with $(n-3)$-dimensional annihilator. Namely, we describe all central
extensions of all $3$-dimensional anticommutative complex algebras.
|
math.RA
|
we give the classification of all ndimensional anticommutative complex algebras with n3dimensional annihilator namely we describe all central extensions of all 3dimensional anticommutative complex algebras
|
[['we', 'give', 'the', 'classification', 'of', 'all', 'ndimensional', 'anticommutative', 'complex', 'algebras', 'with', 'n3dimensional', 'annihilator', 'namely', 'we', 'describe', 'all', 'central', 'extensions', 'of', 'all', '3dimensional', 'anticommutative', 'complex', 'algebras']]
|
[-0.21261156871914863, 0.03651634529232979, 0.05626477681100368, 0.08943794604390859, -0.14010194050148128, -0.16034717723727226, -0.18871239796280861, 0.3599657818675041, -0.2955491918325424, -0.13105793096125126, 0.14529406640678644, -0.22932658672332765, -0.18042722769081593, 0.18335513666272163, -0.1757067944854498, -0.0733638009428978, 0.04835925042629242, 0.14360822811722757, -0.1447413171827793, -0.33762107461690904, 0.47638065710663796, -0.11488422000780701, 0.1574029840528965, -0.030706102177500725, 0.16019129931926726, 0.13162016125395895, -0.04264755226671696, -0.009823630303144456, -0.1889201894775033, 0.151445851624012, 0.37584572106599806, 0.1161996766924858, 0.09371882390230894, -0.33636351688764987, -0.07733271749690175, 0.30640422359108926, 0.19132052773609756, 0.03560793459415436, -0.018742908015847205, -0.21254193022847176, 0.08980045981705188, -0.25339893117547035, -0.17838270910084247, -0.1709575417265296, 0.07946153348777443, 0.019859548807144165, -0.16420378729701043, 0.025291956029832363, 0.15385478585958481, 0.1624372010678053, -0.18656580235809087, -0.12188027799129486, -0.06707804523408413, 0.08924491055309773, -0.20409658476710318, -0.0350716064684093, 0.10332302767783404, -0.04536105202510953, -0.22730768069624901, 0.39875708550214767, 0.0723362294875551, -0.2620211079716682, 0.17851298391819, -0.2420891536772251, -0.1941536771133542, 0.08943816088140011, 0.05020587921142578, 0.11040848480537534, -0.04550139097496867, 0.25117322243750095, -0.16452360443770886, -0.07724081233143806, 0.09746721650473773, 0.0164870685711503, 0.15667509742081165, 0.10367386151105165, 0.016526205018162727, 0.14945913940668107, 0.08521547697484494, -0.0471881271712482, -0.3759440016746521, -0.2296851085498929, -0.004277475965209305, 0.1903005204349756, -0.15017608677968383, -0.21971997268497945, 0.45380291040986775, 0.12378911372274161, 0.18661760840564967, 0.13302335873246193, 0.21018272068351507, -0.007581191547214985, 0.13245389401912688, 0.09441465829891968, 0.04229382132180035, 0.304918891787529, -0.08374163661152124, -0.03453601412475109, -0.17604335833340884, 0.23007687106728553]
|
1,803.07699
|
On the role of secondary motions in turbulent square duct flow
|
We use a direct numerical simulations (DNS) database for turbulent flow in a
square duct up to bulk Reynolds number $\Rey_b=40000$, to quantitatively
analyze the role of secondary motions on the mean flow structure. For that
purpose we derive a generalized form of the identity of Fukagata, Iwamoto and
Kasagi (FIK), which allows to quantify the effect of cross-stream convection on
the mean streamwise velocity, wall shear stress and bulk friction coefficient.
Secondary motions are found to contribute for about $6\%$ of total friction,
and to act as a self-regulating mechanism of turbulence whereby wall shear
stress nonuniformities induced by corners are equalized, and universality of
the wall-normal velocity profiles is established. We also carry out numerical
experiments whereby the secondary motions are artificially suppressed, in which
case their equalizing role is partially taken by the turbulent stresses.
|
physics.flu-dyn
|
we use a direct numerical simulations dns database for turbulent flow in a square duct up to bulk reynolds number rey_b40000 to quantitatively analyze the role of secondary motions on the mean flow structure for that purpose we derive a generalized form of the identity of fukagata iwamoto and kasagi fik which allows to quantify the effect of crossstream convection on the mean streamwise velocity wall shear stress and bulk friction coefficient secondary motions are found to contribute for about 6 of total friction and to act as a selfregulating mechanism of turbulence whereby wall shear stress nonuniformities induced by corners are equalized and universality of the wallnormal velocity profiles is established we also carry out numerical experiments whereby the secondary motions are artificially suppressed in which case their equalizing role is partially taken by the turbulent stresses
|
[['we', 'use', 'a', 'direct', 'numerical', 'simulations', 'dns', 'database', 'for', 'turbulent', 'flow', 'in', 'a', 'square', 'duct', 'up', 'to', 'bulk', 'reynolds', 'number', 'rey_b40000', 'to', 'quantitatively', 'analyze', 'the', 'role', 'of', 'secondary', 'motions', 'on', 'the', 'mean', 'flow', 'structure', 'for', 'that', 'purpose', 'we', 'derive', 'a', 'generalized', 'form', 'of', 'the', 'identity', 'of', 'fukagata', 'iwamoto', 'and', 'kasagi', 'fik', 'which', 'allows', 'to', 'quantify', 'the', 'effect', 'of', 'crossstream', 'convection', 'on', 'the', 'mean', 'streamwise', 'velocity', 'wall', 'shear', 'stress', 'and', 'bulk', 'friction', 'coefficient', 'secondary', 'motions', 'are', 'found', 'to', 'contribute', 'for', 'about', '6', 'of', 'total', 'friction', 'and', 'to', 'act', 'as', 'a', 'selfregulating', 'mechanism', 'of', 'turbulence', 'whereby', 'wall', 'shear', 'stress', 'nonuniformities', 'induced', 'by', 'corners', 'are', 'equalized', 'and', 'universality', 'of', 'the', 'wallnormal', 'velocity', 'profiles', 'is', 'established', 'we', 'also', 'carry', 'out', 'numerical', 'experiments', 'whereby', 'the', 'secondary', 'motions', 'are', 'artificially', 'suppressed', 'in', 'which', 'case', 'their', 'equalizing', 'role', 'is', 'partially', 'taken', 'by', 'the', 'turbulent', 'stresses']]
|
[-0.17715714979611002, 0.19108764212161525, -0.09724932334471821, 0.023439798596203883, -0.08334554383121152, -0.04497967843216524, 0.00037616237289091545, 0.33469906996991206, -0.30683991622089396, -0.2980042402945292, 0.05833105195692476, -0.23481041845813855, -0.12126788532764499, 0.19778825372019643, -0.012660123227136348, 0.03246702867865896, 0.037041441697293696, -0.006383240632990848, 0.022125504050862544, -0.1855658872501313, 0.29282517390631474, 0.10163937537816228, 0.3057452090147104, 0.06420694839959937, 0.07441796078138165, -0.08286761862934748, -0.08689583049141872, 0.0995653500196649, -0.20401484427701919, 0.040519926240042185, 0.1566428974819884, -0.0324469507644092, 0.2543748922163009, -0.44977712283717164, -0.23444325472714742, 0.025610712683523326, 0.16554680234863797, 0.10505890874921886, -0.02023668231489484, -0.23692696236956642, 0.1086416343985466, -0.1665132925359171, -0.1274424213290548, -0.0603032753309374, 0.03363504725397189, 0.032570475597740775, -0.27911144452831543, 0.2217500920599907, 0.04755862010642886, 0.10538930975512337, -0.08538737320106601, -0.07412339314651578, -0.11291695119284872, 0.1536126154854567, 0.1165010094635689, -0.013049152954273037, 0.21471575209384422, -0.15087512321422683, -0.029526836214910274, 0.40474825503249, -0.047300500315683544, -0.2437542430333682, 0.17012393213426277, -0.1489417989887714, -0.038712108281871944, 0.18139045693174893, 0.23892804424264538, 0.057666121047240365, -0.10402986574474958, -0.05771069064798918, -0.04964711546286273, 0.10884200606265787, 0.0943518246948865, -0.07420841586400768, 0.22555930738740448, 0.12491417592982136, 0.07142361067582978, 0.14717795141388787, -0.16667584890027098, -0.08838582060598671, -0.3015021420372372, -0.1499090667105099, -0.12823296806761134, 0.0448682983649144, -0.08595714576167937, -0.1607763026478273, 0.31023364717057395, 0.13084555999723388, 0.17097888942356151, 0.047742445723834764, 0.29009190944037333, 0.07658788297280196, 0.071806042814808, 0.10462026939546662, 0.27539724898316076, 0.2125504054094373, 0.13253826290410733, -0.2648759893655999, 0.056965969676680085, 0.08163621535858334]
|
1,803.077
|
Instability of the solitary wave solutions for the genenalized
derivative Nonlinear Schr\"odinger equation in the critical frequency case
|
We study the stability theory of solitary wave solutions for the generalized
derivative nonlinear Schr\"odinger equation $$
i\partial_{t}u+\partial_{x}^{2}u+i|u|^{2\sigma}\partial_x u=0. $$ The equation
has a two-parameter family of solitary wave solutions of the form
\begin{align*} \phi_{\omega,c}(x)=\varphi_{\omega,c}(x)\exp{\big\{ i\frac c2
x-\frac{i}{2\sigma+2}\int_{-\infty}^{x}\varphi^{2\sigma}_{\omega,c}(y)dy\big\}}.
\end{align*} Here $ \varphi_{\omega,c}$ is some real-valued function. It was
proved in \cite{LiSiSu1} that the solitary wave solutions are stable if
$-2\sqrt{\omega }<c <2z_0\sqrt{\omega }$, and unstable if $2z_0\sqrt{\omega }<c
<2\sqrt{\omega }$ for some $z_0\in(0,1)$. We prove the instability at the
borderline case $c =2z_0\sqrt{\omega }$ for $1<\sigma<2$, improving the
previous results in \cite{Fu-16-DNLS} where $3/2<\sigma<2$.
|
math.AP
|
we study the stability theory of solitary wave solutions for the generalized derivative nonlinear schrodinger equation ipartial_tupartial_x2uiu2sigmapartial_x u0 the equation has a twoparameter family of solitary wave solutions of the form beginalign phi_omegacxvarphi_omegacxexpbig ifrac c2 xfraci2sigma2int_inftyxvarphi2sigma_omegacydybig endalign here varphi_omegac is some realvalued function it was proved in citelisisu1 that the solitary wave solutions are stable if 2sqrtomega c 2z_0sqrtomega and unstable if 2z_0sqrtomega c 2sqrtomega for some z_0in01 we prove the instability at the borderline case c 2z_0sqrtomega for 1sigma2 improving the previous results in citefu16dnls where 32sigma2
|
[['we', 'study', 'the', 'stability', 'theory', 'of', 'solitary', 'wave', 'solutions', 'for', 'the', 'generalized', 'derivative', 'nonlinear', 'schrodinger', 'equation', 'ipartial_tupartial_x2uiu2sigmapartial_x', 'u0', 'the', 'equation', 'has', 'a', 'twoparameter', 'family', 'of', 'solitary', 'wave', 'solutions', 'of', 'the', 'form', 'beginalign', 'phi_omegacxvarphi_omegacxexpbig', 'ifrac', 'c2', 'xfraci2sigma2int_inftyxvarphi2sigma_omegacydybig', 'endalign', 'here', 'varphi_omegac', 'is', 'some', 'realvalued', 'function', 'it', 'was', 'proved', 'in', 'citelisisu1', 'that', 'the', 'solitary', 'wave', 'solutions', 'are', 'stable', 'if', '2sqrtomega', 'c', '2z_0sqrtomega', 'and', 'unstable', 'if', '2z_0sqrtomega', 'c', '2sqrtomega', 'for', 'some', 'z_0in01', 'we', 'prove', 'the', 'instability', 'at', 'the', 'borderline', 'case', 'c', '2z_0sqrtomega', 'for', '1sigma2', 'improving', 'the', 'previous', 'results', 'in', 'citefu16dnls', 'where', '32sigma2']]
|
[-0.2100857600915986, 0.06852117421415944, -0.04419886804251478, 0.06846925577906987, -0.07745087750327702, -0.16195171096553215, -0.05301992058342036, 0.2847010076810152, -0.24991281275661328, -0.10976155511199091, 0.1345421717627547, -0.349710923130027, -0.17616996636244062, 0.19449858185954583, 0.03623498285499712, 0.1103446422658192, 0.03978712878261621, 0.04384836759895851, -0.043443269678391516, -0.19021509668956965, 0.3588030945855933, -0.09774041717472033, 0.20266413433142963, 0.045986897616575546, 0.06374448962294711, -0.040029280526468, 0.10875679747177622, -0.04190122844794622, -0.2555584510560155, -0.0014081877739861226, 0.22303808953326482, 0.10024617064015892, 0.30897008584669006, -0.3790363478116118, -0.22791380922381693, 0.11568403965196548, 0.16093231162701088, 0.09009118888001794, -0.04744057107652621, -0.3184477732164594, 0.11779706749635246, -0.10021029539310779, -0.23917358628927898, -0.03866831865161657, 0.12489270750815287, 0.12688178445200604, -0.2869239911102714, 0.13849914067974076, 0.09129378684342672, -0.04382748686923431, -0.1562090982706883, -0.11105440882368921, -0.08593708911361411, -0.03277613106183708, 0.06371394540959348, 0.08695445787340689, -0.05115073010062751, -0.12121998276322699, -0.005160997120606809, 0.34959093308395656, -0.10473158814980146, -0.2788695584122951, 0.10478185350672366, -0.18259388839457338, -0.15173409649361977, 0.11544529307537651, 0.11597264588523942, 0.1817585366945236, -0.0715993429080416, 0.17186199538693286, -0.0631614829443816, 0.14018665684255746, 0.17205631002807656, -0.006183131078544717, 0.09274165492313795, 0.12424380401035962, 0.08859509086379638, 0.10062112993835352, 0.010496734068370782, -0.06822656766057779, -0.33882869952000105, -0.16834959489269516, -0.11283708727942446, 0.08047581639440092, -0.05151830701652216, -0.16549088310402554, 0.37368002583165294, 0.07034455267234872, 0.08885117510381417, 0.07229686979777537, 0.16567779983728168, 0.22250550844443914, -0.06534782380540258, 0.11257083585652976, 0.2307384255713819, 0.13803084726290157, 0.12013973406730936, -0.20330353846582463, 0.009213351817706075, 0.1279283485446985]
|
1,803.07701
|
Very high efficiency of low cost graphite-based solar cell by improving
the fill factor using optimal ion concentration in polymer electrolyte
|
We report the development of graphite-based solar cells using a simple method
and low cost materials. Suspension of graphite powder in mineral water was
simply dropped onto the surface of fluorine-doped tin oxide glass (FTO) to form
a thick film. Surprisingly, using mineral waters greatly improved the
efficiency of the solar cell to reach the highest efficiency of 6.97%. Due to
some minerals contained, the mineral water induced the development of fibrous
structure between the graphite particles which is assumed to play a role as a
bridge for the photoexcited electrons to quickly move to the electrode and
suppress recombination with holes. This efficiency is very attractive when
considering the materials used to develop the solar cell are all low cost.
Economically this may challenge the present high efficiency semiconductor-based
solar cells. We achieved the high efficiency by manipulating the cell fill
factor through optimizing the ion concentration in PVA.LiOH polymer
electrolyte. We also propose an equation to describe the effect of LiOH
concentration and efficiency and we also provide strong correlation between the
cell efficiency and the polymer conductivity
|
physics.app-ph cond-mat.mtrl-sci
|
we report the development of graphitebased solar cells using a simple method and low cost materials suspension of graphite powder in mineral water was simply dropped onto the surface of fluorinedoped tin oxide glass fto to form a thick film surprisingly using mineral waters greatly improved the efficiency of the solar cell to reach the highest efficiency of 697 due to some minerals contained the mineral water induced the development of fibrous structure between the graphite particles which is assumed to play a role as a bridge for the photoexcited electrons to quickly move to the electrode and suppress recombination with holes this efficiency is very attractive when considering the materials used to develop the solar cell are all low cost economically this may challenge the present high efficiency semiconductorbased solar cells we achieved the high efficiency by manipulating the cell fill factor through optimizing the ion concentration in pvalioh polymer electrolyte we also propose an equation to describe the effect of lioh concentration and efficiency and we also provide strong correlation between the cell efficiency and the polymer conductivity
|
[['we', 'report', 'the', 'development', 'of', 'graphitebased', 'solar', 'cells', 'using', 'a', 'simple', 'method', 'and', 'low', 'cost', 'materials', 'suspension', 'of', 'graphite', 'powder', 'in', 'mineral', 'water', 'was', 'simply', 'dropped', 'onto', 'the', 'surface', 'of', 'fluorinedoped', 'tin', 'oxide', 'glass', 'fto', 'to', 'form', 'a', 'thick', 'film', 'surprisingly', 'using', 'mineral', 'waters', 'greatly', 'improved', 'the', 'efficiency', 'of', 'the', 'solar', 'cell', 'to', 'reach', 'the', 'highest', 'efficiency', 'of', '697', 'due', 'to', 'some', 'minerals', 'contained', 'the', 'mineral', 'water', 'induced', 'the', 'development', 'of', 'fibrous', 'structure', 'between', 'the', 'graphite', 'particles', 'which', 'is', 'assumed', 'to', 'play', 'a', 'role', 'as', 'a', 'bridge', 'for', 'the', 'photoexcited', 'electrons', 'to', 'quickly', 'move', 'to', 'the', 'electrode', 'and', 'suppress', 'recombination', 'with', 'holes', 'this', 'efficiency', 'is', 'very', 'attractive', 'when', 'considering', 'the', 'materials', 'used', 'to', 'develop', 'the', 'solar', 'cell', 'are', 'all', 'low', 'cost', 'economically', 'this', 'may', 'challenge', 'the', 'present', 'high', 'efficiency', 'semiconductorbased', 'solar', 'cells', 'we', 'achieved', 'the', 'high', 'efficiency', 'by', 'manipulating', 'the', 'cell', 'fill', 'factor', 'through', 'optimizing', 'the', 'ion', 'concentration', 'in', 'pvalioh', 'polymer', 'electrolyte', 'we', 'also', 'propose', 'an', 'equation', 'to', 'describe', 'the', 'effect', 'of', 'lioh', 'concentration', 'and', 'efficiency', 'and', 'we', 'also', 'provide', 'strong', 'correlation', 'between', 'the', 'cell', 'efficiency', 'and', 'the', 'polymer', 'conductivity']]
|
[-0.06615794711231186, 0.17457910434041476, 0.005986681529945127, -0.004315839877466583, -0.009109831815741582, -0.10140658929350906, 0.10452960837533562, 0.4028928462629253, -0.2520943891787745, -0.32546916719546864, 0.04345870037906538, -0.2785001837299856, -0.13204737566411495, 0.1636869891328144, -0.06889497243939748, 0.00943971001777236, 0.03166042725742904, -0.07821741934937904, -0.025571463321980775, -0.21402832946360278, 0.18402158120886408, 0.13266119531189305, 0.32737097745064087, 0.13351302827232356, 0.11434184538861268, -0.05681228052627025, 0.08046939338989265, 0.013980994664403147, -0.13925859586637487, 0.1681311286012928, 0.26657387278401734, 0.016286898011539402, 0.2291208854030984, -0.513225856335969, -0.23946889919129996, 0.04951645439886098, 0.12441818928736256, 0.055178668432577654, -0.11934810601091585, -0.16861792019563182, 0.09981391575790984, -0.1502719049481155, -0.12815427432856497, -0.021641072905596408, -0.027930680017231563, 0.02738790152667288, -0.2211560984470559, 0.07732709713362147, 0.04262980221063107, 0.04127132520079613, -0.08720889624842969, -0.14997811076704767, -0.060474312596293635, 0.12906535033883876, 0.0346718836255767, -0.006506526158529454, 0.26346201651766066, -0.12195158264825418, -0.00506894059405095, 0.4011164640997375, -0.05801098674793296, -0.15494342138418438, 0.20902249200904335, -0.172794914975445, -0.04325407976804915, 0.19639329651797283, 0.16190547960440957, 0.10325616856974514, -0.17789314295415307, 0.01823250208373244, 0.01326186683382735, 0.1743030615302179, 0.100049372852192, 0.02621785460258496, 0.22497634115816204, 0.27065178907122567, 0.03176666369568036, 0.16700683287925325, -0.12854342528114188, -0.02269841110666787, -0.16325402264509287, -0.259118247558701, -0.16457615981812396, 0.060655563725217104, -0.09189052226022862, -0.18313742896760477, 0.3541018505952732, 0.10963062180645826, 0.1632469783084436, -0.02805107043127337, 0.2500629800964024, 0.062429775811039825, 0.07524288674899736, 0.022539837985668935, 0.2547241270956102, 0.14219513380322502, 0.16329825575094067, -0.2795280176553064, 0.10744336283799552, 0.04758088422065091]
|
1,803.07702
|
Robust Depth Estimation from Auto Bracketed Images
|
As demand for advanced photographic applications on hand-held devices grows,
these electronics require the capture of high quality depth. However, under
low-light conditions, most devices still suffer from low imaging quality and
inaccurate depth acquisition. To address the problem, we present a robust depth
estimation method from a short burst shot with varied intensity (i.e., Auto
Bracketing) or strong noise (i.e., High ISO). We introduce a geometric
transformation between flow and depth tailored for burst images, enabling our
learning-based multi-view stereo matching to be performed effectively. We then
describe our depth estimation pipeline that incorporates the geometric
transformation into our residual-flow network. It allows our framework to
produce an accurate depth map even with a bracketed image sequence. We
demonstrate that our method outperforms state-of-the-art methods for various
datasets captured by a smartphone and a DSLR camera. Moreover, we show that the
estimated depth is applicable for image quality enhancement and photographic
editing.
|
cs.CV
|
as demand for advanced photographic applications on handheld devices grows these electronics require the capture of high quality depth however under lowlight conditions most devices still suffer from low imaging quality and inaccurate depth acquisition to address the problem we present a robust depth estimation method from a short burst shot with varied intensity ie auto bracketing or strong noise ie high iso we introduce a geometric transformation between flow and depth tailored for burst images enabling our learningbased multiview stereo matching to be performed effectively we then describe our depth estimation pipeline that incorporates the geometric transformation into our residualflow network it allows our framework to produce an accurate depth map even with a bracketed image sequence we demonstrate that our method outperforms stateoftheart methods for various datasets captured by a smartphone and a dslr camera moreover we show that the estimated depth is applicable for image quality enhancement and photographic editing
|
[['as', 'demand', 'for', 'advanced', 'photographic', 'applications', 'on', 'handheld', 'devices', 'grows', 'these', 'electronics', 'require', 'the', 'capture', 'of', 'high', 'quality', 'depth', 'however', 'under', 'lowlight', 'conditions', 'most', 'devices', 'still', 'suffer', 'from', 'low', 'imaging', 'quality', 'and', 'inaccurate', 'depth', 'acquisition', 'to', 'address', 'the', 'problem', 'we', 'present', 'a', 'robust', 'depth', 'estimation', 'method', 'from', 'a', 'short', 'burst', 'shot', 'with', 'varied', 'intensity', 'ie', 'auto', 'bracketing', 'or', 'strong', 'noise', 'ie', 'high', 'iso', 'we', 'introduce', 'a', 'geometric', 'transformation', 'between', 'flow', 'and', 'depth', 'tailored', 'for', 'burst', 'images', 'enabling', 'our', 'learningbased', 'multiview', 'stereo', 'matching', 'to', 'be', 'performed', 'effectively', 'we', 'then', 'describe', 'our', 'depth', 'estimation', 'pipeline', 'that', 'incorporates', 'the', 'geometric', 'transformation', 'into', 'our', 'residualflow', 'network', 'it', 'allows', 'our', 'framework', 'to', 'produce', 'an', 'accurate', 'depth', 'map', 'even', 'with', 'a', 'bracketed', 'image', 'sequence', 'we', 'demonstrate', 'that', 'our', 'method', 'outperforms', 'stateoftheart', 'methods', 'for', 'various', 'datasets', 'captured', 'by', 'a', 'smartphone', 'and', 'a', 'dslr', 'camera', 'moreover', 'we', 'show', 'that', 'the', 'estimated', 'depth', 'is', 'applicable', 'for', 'image', 'quality', 'enhancement', 'and', 'photographic', 'editing']]
|
[-0.0304460926563479, 0.012050050975487562, -0.08318256473438324, 0.05079255038857043, -0.08492673763478371, -0.17620805131216338, 0.010290957833364556, 0.4888495184285076, -0.2826287352922679, -0.35838182271139596, 0.10644070836899214, -0.26383588985874284, -0.16276289858567333, 0.27183036334463395, -0.18583900342223628, 0.08793311682682925, 0.15334935316059273, -0.015934753985340267, -0.08374762788604896, -0.23214955630981804, 0.24672110031640745, 0.015938624445545047, 0.3665451977974858, 0.015324860510621588, 0.1701430277316831, 0.05667324848993877, -0.0600369734357197, 0.04032905122470478, -0.08319834778984314, 0.15757938665161705, 0.2744192074108134, 0.18973084643029756, 0.21808276076090374, -0.4376473255044977, -0.2503978374481544, 0.03568589965365582, 0.11872045535346842, 0.0933763482172301, -0.08804211218911835, -0.33146866907880296, 0.09204075374566999, -0.14322654411769595, -0.008245695884206247, -0.11387017554922127, -0.013024700861454843, 0.003384821002806635, -0.32179423325425505, 0.05528744523838357, 0.019963988326612468, 0.0908289207283432, -0.059435766516368234, -0.07654715099028851, 0.051836299854728984, 0.19220764897794365, -0.03818483907506513, 0.0649306213262638, 0.15316252469538563, -0.21304284655458391, -0.034829924497324485, 0.36616635717770185, -0.07304741076414327, -0.14660471301574848, 0.19978046713789044, -0.04949548014586693, -0.12059203808588025, 0.15740912428775214, 0.187295127304663, 0.10728277907228882, -0.12191114684958991, -0.005834082487509525, 0.013206035768043398, 0.25016904935412304, 0.0807724686762269, 0.04307489171562912, 0.18752659254364276, 0.21599222810963462, 0.08998957418340356, 0.13475001253429678, -0.2274625495024099, 0.042994187446311116, -0.21548169907519446, -0.10029856718555445, -0.18135920516291854, -0.011895619179420848, -0.09690608858019052, -0.1600698502305405, 0.3654421439155397, 0.2933912371701904, 0.20134697740554416, 0.098955578608806, 0.42483787843344833, 0.0642761433003838, 0.1051532346770584, 0.04707632126366278, 0.17753807376567765, -0.007362170581473038, 0.13323550617114002, -0.1583917458062244, 0.06818739986230962, 0.03702715972413946]
|
1,803.07703
|
Weakly Supervised Medical Diagnosis and Localization from Multiple
Resolutions
|
Diagnostic imaging often requires the simultaneous identification of a
multitude of findings of varied size and appearance. Beyond global indication
of said findings, the prediction and display of localization information
improves trust in and understanding of results when augmenting clinical
workflow. Medical training data rarely includes more than global image-level
labels as segmentations are time-consuming and expensive to collect. We
introduce an approach to managing these practical constraints by applying a
novel architecture which learns at multiple resolutions while generating
saliency maps with weak supervision. Further, we parameterize the Log-Sum-Exp
pooling function with a learnable lower-bounded adaptation (LSE-LBA) to build
in a sharpness prior and better handle localizing abnormalities of different
sizes using only image-level labels. Applying this approach to interpreting
chest x-rays, we set the state of the art on 9 abnormalities in the NIH's CXR14
dataset while generating saliency maps with the highest resolution to date.
|
cs.CV
|
diagnostic imaging often requires the simultaneous identification of a multitude of findings of varied size and appearance beyond global indication of said findings the prediction and display of localization information improves trust in and understanding of results when augmenting clinical workflow medical training data rarely includes more than global imagelevel labels as segmentations are timeconsuming and expensive to collect we introduce an approach to managing these practical constraints by applying a novel architecture which learns at multiple resolutions while generating saliency maps with weak supervision further we parameterize the logsumexp pooling function with a learnable lowerbounded adaptation lselba to build in a sharpness prior and better handle localizing abnormalities of different sizes using only imagelevel labels applying this approach to interpreting chest xrays we set the state of the art on 9 abnormalities in the nihs cxr14 dataset while generating saliency maps with the highest resolution to date
|
[['diagnostic', 'imaging', 'often', 'requires', 'the', 'simultaneous', 'identification', 'of', 'a', 'multitude', 'of', 'findings', 'of', 'varied', 'size', 'and', 'appearance', 'beyond', 'global', 'indication', 'of', 'said', 'findings', 'the', 'prediction', 'and', 'display', 'of', 'localization', 'information', 'improves', 'trust', 'in', 'and', 'understanding', 'of', 'results', 'when', 'augmenting', 'clinical', 'workflow', 'medical', 'training', 'data', 'rarely', 'includes', 'more', 'than', 'global', 'imagelevel', 'labels', 'as', 'segmentations', 'are', 'timeconsuming', 'and', 'expensive', 'to', 'collect', 'we', 'introduce', 'an', 'approach', 'to', 'managing', 'these', 'practical', 'constraints', 'by', 'applying', 'a', 'novel', 'architecture', 'which', 'learns', 'at', 'multiple', 'resolutions', 'while', 'generating', 'saliency', 'maps', 'with', 'weak', 'supervision', 'further', 'we', 'parameterize', 'the', 'logsumexp', 'pooling', 'function', 'with', 'a', 'learnable', 'lowerbounded', 'adaptation', 'lselba', 'to', 'build', 'in', 'a', 'sharpness', 'prior', 'and', 'better', 'handle', 'localizing', 'abnormalities', 'of', 'different', 'sizes', 'using', 'only', 'imagelevel', 'labels', 'applying', 'this', 'approach', 'to', 'interpreting', 'chest', 'xrays', 'we', 'set', 'the', 'state', 'of', 'the', 'art', 'on', '9', 'abnormalities', 'in', 'the', 'nihs', 'cxr14', 'dataset', 'while', 'generating', 'saliency', 'maps', 'with', 'the', 'highest', 'resolution', 'to', 'date']]
|
[-0.017113975868239227, 0.005319601262955734, -0.007656076975026422, 0.07768167142579653, -0.13930523101368855, -0.17728472407907248, 0.05035986186663524, 0.43975500446455235, -0.23761555273125975, -0.37423101366208544, 0.07379880374987963, -0.27460301256064196, -0.1363429012969297, 0.1831326026694271, -0.14014706725730353, 0.06551986917660668, 0.1271142773611214, 0.025589660592457472, -0.079725896941241, -0.2396853659687371, 0.30426390236083034, 0.053528856325509216, 0.3117029653155598, 0.03826651182542515, 0.11652384344247523, -0.0131138375093197, -0.08203941371356105, 0.004610048465687653, -0.07232371709662778, 0.19340145981966936, 0.32278802218076225, 0.22198069122838707, 0.33315476349972445, -0.40712013716652895, -0.2107538938586568, 0.09353899311210061, 0.14008710296696117, 0.09278517792980862, -0.010350788721577906, -0.36756295609962325, 0.09342034819559997, -0.12378184997059148, -0.012441538457341235, -0.14681877999341694, -0.05573283948068475, -0.024473314049075646, -0.32866999632277494, 0.06699273472908755, 0.03788678693838, 0.11385526238812198, -0.1018418212678155, -0.07426003291239512, -0.012623376025143882, 0.19479363484504825, 0.015688730021216103, 0.07249160328044973, 0.1407864859391903, -0.25411977629209387, -0.11084905499110705, 0.3222716407594472, -0.011311670765782513, -0.19089932268132168, 0.22121473780736842, -0.10784095524135849, -0.17148798066030801, 0.15062907340711562, 0.1646653355902125, 0.11076275564023647, -0.1622076205039148, -0.034007527064612325, -0.013592792527172073, 0.20951146971562812, 0.0855234898658919, 0.015498368983088736, 0.16560959359630942, 0.2532894742193407, 0.043091443225998304, 0.14717402772432, -0.1569975056131531, -0.006015250189550992, -0.23421156300304072, -0.09111560793143922, -0.18577948625616986, 0.00043417147585544095, -0.11135588995419876, -0.160806026206962, 0.4038992425619528, 0.25952989965163425, 0.23622506881325409, 0.10030112731960955, 0.3293353594839573, 0.0080047064991708, 0.12507511234128696, 0.04557671304792166, 0.15811435167822216, -0.00745771198115986, 0.09452916543673852, -0.1452061536272281, 0.11214747217580162, 0.05316665730828515]
|
1,803.07704
|
On irrationality of hypersurfaces In $\mathbf{P}^{n+1}$
|
In this note, we study various measures of irrationality for hypersurfaces in
projective spaces which were recently proposed by Bastianelli, De Poi, Ein,
Lazarsfeld and Ullery. In particular, we answer the question raised by
Bastianelli that if $X \subset P^{n+1}$ is a very general smooth hypersurface
of dimension $n$ and degree $d\geq 2n+2$, then
$\text{stab.irr}(X)=\text{uni.irr}(X)=d-1$. As a corollary, we prove that
$\text{irr}(X\times P^{m})=\text{irr}(X)$ for any integer $m\geq 1$.
|
math.AG
|
in this note we study various measures of irrationality for hypersurfaces in projective spaces which were recently proposed by bastianelli de poi ein lazarsfeld and ullery in particular we answer the question raised by bastianelli that if x subset pn1 is a very general smooth hypersurface of dimension n and degree dgeq 2n2 then textstabirrxtextuniirrxd1 as a corollary we prove that textirrxtimes pmtextirrx for any integer mgeq 1
|
[['in', 'this', 'note', 'we', 'study', 'various', 'measures', 'of', 'irrationality', 'for', 'hypersurfaces', 'in', 'projective', 'spaces', 'which', 'were', 'recently', 'proposed', 'by', 'bastianelli', 'de', 'poi', 'ein', 'lazarsfeld', 'and', 'ullery', 'in', 'particular', 'we', 'answer', 'the', 'question', 'raised', 'by', 'bastianelli', 'that', 'if', 'x', 'subset', 'pn1', 'is', 'a', 'very', 'general', 'smooth', 'hypersurface', 'of', 'dimension', 'n', 'and', 'degree', 'dgeq', '2n2', 'then', 'textstabirrxtextuniirrxd1', 'as', 'a', 'corollary', 'we', 'prove', 'that', 'textirrxtimes', 'pmtextirrx', 'for', 'any', 'integer', 'mgeq', '1']]
|
[-0.18702984766031688, 0.06525550647280537, -0.05288139050110029, 0.05401620996686129, -0.01760176496866804, -0.21800903140638883, -0.02532271486348831, 0.30714076513854355, -0.238854504061433, -0.21514950942319747, 0.07459922236068031, -0.30618240874833785, -0.21460512638844262, 0.18205229533979525, -0.19370159648645383, 0.02993147955634273, 0.020057185219887357, 0.03893761531664775, -0.018678238982549653, -0.3921523582190275, 0.44265692858741834, -0.07489867212537389, 0.15227755183497302, 0.1337953856214881, 0.14175903477634375, 0.035586458523399554, 0.052373187802731994, 0.03287066727016981, -0.24196451054997922, 0.08813898364225259, 0.3341517581962622, 0.16283104108789792, 0.26522435952837653, -0.28799058153079105, -0.1879194725734683, 0.24465920205872793, 0.15654325626002483, 0.013923326297663153, -0.025558293557081085, -0.26187427560440624, 0.16769605671557097, -0.09273275194819479, -0.17803743954461354, -0.08840686146599742, 0.15407643924252346, -0.010363286121103626, -0.2743091148539231, -0.013939563657801884, 0.16252251786108202, 0.13471404833432574, -0.048607699057230586, -0.14735895757599232, -0.029375872526389474, 0.0315003943325092, -0.022302770692882546, 0.14156533140474215, -0.016354798693926288, -0.028245119145140052, -0.1266763914304857, 0.30228250339770546, -0.060937543786489044, -0.24436918190465523, 0.08353145031545024, -0.19390207309848986, -0.2120377453832099, 0.04931406029858268, 0.13378478040059025, 0.20025827643963007, -0.004197952194282642, 0.2244451879362504, -0.14413922836001103, 0.11759629808366298, 0.2109327851006618, -0.030999970123565826, 0.06835182026530115, 0.05258496368232255, 0.10408838844070067, 0.07258114505272645, 0.006070265517784999, 0.05764672443575154, -0.3153668869573336, -0.24268171133903357, -0.18420407274164832, 0.21253140647537433, -0.12680031456581603, -0.08185409043127527, 0.3181008516309353, 0.09494882612847365, 0.20316088893092596, 0.11750132964673238, 0.19171429243511878, -0.005019870129987025, -0.09188283508500228, 0.10379395118842905, 0.08397828065432035, 0.09396882111905143, 0.014546034757334453, -0.08322779195598112, 1.7296773596451832e-05, 0.17906186876531976]
|
1,803.07705
|
Markov Chains with Maximum Return Time Entropy for Robotic Surveillance
|
Motivated by robotic surveillance applications, this paper studies the novel
problem of maximizing the return time entropy of a Markov chain, subject to a
graph topology with travel times and stationary distribution. The return time
entropy is the weighted average, over all graph nodes, of the entropy of the
first return times of the Markov chain; this objective function is a function
series that does not admit in general a closed form.
The paper features theoretical and computational contributions. First, we
obtain a discrete-time delayed linear system for the return time probability
distribution and establish its convergence properties. We show that the
objective function is continuous over a compact set and therefore admits a
global maximum; a unique globally-optimal solution is known only for complete
graphs with unitary travel times. We then establish upper and lower bounds
between the return time entropy and the well-known entropy rate of the Markov
chain. To compute the optimal Markov chain numerically, we establish the
asymptotic equality between entropy, conditional entropy and truncated entropy,
and propose an iteration to compute the gradient of the truncated entropy.
Finally, we apply these results to the robotic surveillance problem. Our
numerical results show that, for a model of rational intruder over prototypical
graph topologies and test cases, the maximum return time entropy chain performs
better than several existing Markov chains.
|
math.OC
|
motivated by robotic surveillance applications this paper studies the novel problem of maximizing the return time entropy of a markov chain subject to a graph topology with travel times and stationary distribution the return time entropy is the weighted average over all graph nodes of the entropy of the first return times of the markov chain this objective function is a function series that does not admit in general a closed form the paper features theoretical and computational contributions first we obtain a discretetime delayed linear system for the return time probability distribution and establish its convergence properties we show that the objective function is continuous over a compact set and therefore admits a global maximum a unique globallyoptimal solution is known only for complete graphs with unitary travel times we then establish upper and lower bounds between the return time entropy and the wellknown entropy rate of the markov chain to compute the optimal markov chain numerically we establish the asymptotic equality between entropy conditional entropy and truncated entropy and propose an iteration to compute the gradient of the truncated entropy finally we apply these results to the robotic surveillance problem our numerical results show that for a model of rational intruder over prototypical graph topologies and test cases the maximum return time entropy chain performs better than several existing markov chains
|
[['motivated', 'by', 'robotic', 'surveillance', 'applications', 'this', 'paper', 'studies', 'the', 'novel', 'problem', 'of', 'maximizing', 'the', 'return', 'time', 'entropy', 'of', 'a', 'markov', 'chain', 'subject', 'to', 'a', 'graph', 'topology', 'with', 'travel', 'times', 'and', 'stationary', 'distribution', 'the', 'return', 'time', 'entropy', 'is', 'the', 'weighted', 'average', 'over', 'all', 'graph', 'nodes', 'of', 'the', 'entropy', 'of', 'the', 'first', 'return', 'times', 'of', 'the', 'markov', 'chain', 'this', 'objective', 'function', 'is', 'a', 'function', 'series', 'that', 'does', 'not', 'admit', 'in', 'general', 'a', 'closed', 'form', 'the', 'paper', 'features', 'theoretical', 'and', 'computational', 'contributions', 'first', 'we', 'obtain', 'a', 'discretetime', 'delayed', 'linear', 'system', 'for', 'the', 'return', 'time', 'probability', 'distribution', 'and', 'establish', 'its', 'convergence', 'properties', 'we', 'show', 'that', 'the', 'objective', 'function', 'is', 'continuous', 'over', 'a', 'compact', 'set', 'and', 'therefore', 'admits', 'a', 'global', 'maximum', 'a', 'unique', 'globallyoptimal', 'solution', 'is', 'known', 'only', 'for', 'complete', 'graphs', 'with', 'unitary', 'travel', 'times', 'we', 'then', 'establish', 'upper', 'and', 'lower', 'bounds', 'between', 'the', 'return', 'time', 'entropy', 'and', 'the', 'wellknown', 'entropy', 'rate', 'of', 'the', 'markov', 'chain', 'to', 'compute', 'the', 'optimal', 'markov', 'chain', 'numerically', 'we', 'establish', 'the', 'asymptotic', 'equality', 'between', 'entropy', 'conditional', 'entropy', 'and', 'truncated', 'entropy', 'and', 'propose', 'an', 'iteration', 'to', 'compute', 'the', 'gradient', 'of', 'the', 'truncated', 'entropy', 'finally', 'we', 'apply', 'these', 'results', 'to', 'the', 'robotic', 'surveillance', 'problem', 'our', 'numerical', 'results', 'show', 'that', 'for', 'a', 'model', 'of', 'rational', 'intruder', 'over', 'prototypical', 'graph', 'topologies', 'and', 'test', 'cases', 'the', 'maximum', 'return', 'time', 'entropy', 'chain', 'performs', 'better', 'than', 'several', 'existing', 'markov', 'chains']]
|
[-0.12080136020229336, 0.069732983332013, -0.09221636615860622, 0.07893333889058446, -0.05241035233301866, -0.11609642000998383, 0.08996900228361679, 0.37534379237853494, -0.2996727599294631, -0.23757287851772835, 0.1365267559564923, -0.28469729104033364, -0.12325231557828896, 0.18532302934517708, -0.07200936379324595, 0.10540594226307959, 0.0786144357099461, 0.1027875116059448, -0.08544334150838244, -0.25829833735920166, 0.2571164673265287, 0.0489230425704705, 0.28056476171328915, 0.040372841085219595, 0.14540108651311173, 0.0155686144059265, -1.6405035724921878e-05, 0.018961670754780884, -0.18478098641524396, 0.10555924244972589, 0.24158366819355018, 0.18029431676421098, 0.292008554759214, -0.4096375755305849, -0.20475714077813875, 0.19127247491256322, 0.0880497761640798, 0.07283454195224584, 0.0014186647403233521, -0.2467771902630281, 0.0774577185960545, -0.18252649084213837, -0.09329017857924905, -0.05740421398484353, 0.01773045663492161, 0.04302253989208356, -0.30965335077226097, 0.0719119988448684, 0.07969012557718937, 0.030095178171529773, -0.0497050645950171, -0.06105540878235492, -0.010410184614911609, 0.13026102600961656, 0.06757810095799126, 0.028132371777760474, 0.10095086444018934, -0.07031980711098075, -0.1508264883751292, 0.2924235708710859, -0.09052209125581404, -0.2025449731525017, 0.16287323486711414, -0.12059926352100321, -0.14792590550639803, 0.11534254219604347, 0.17800576140022953, 0.1736913496408363, -0.1530168886555384, 0.07805395361861932, -0.061001784130596794, 0.1586673231931161, 0.019491840794999903, 0.01591759853429399, 0.1443669563315959, 0.15042777298511142, 0.17622741755471885, 0.2167253527213974, -0.05129104839964674, -0.16345526144167433, -0.2956829265928347, -0.19903039153364607, -0.21281237519009982, 0.05706235211695734, -0.1389367549419544, -0.18085893781828558, 0.4066949757599092, 0.13861137082906194, 0.19720135065371946, 0.2020439923022594, 0.2830129285748096, 0.16352690839540943, -0.036321972632538446, 0.14372359110760782, 0.1466201522240479, 0.10989899379242997, 0.06158035683431015, -0.21375272261509212, 0.10785491750867945, 0.12405776179963597]
|
1,803.07706
|
On the Prony Series Representation of Stretched Exponential Relaxation
|
Stretched exponential relaxation is a ubiquitous feature of homogeneous
glasses. The stretched exponential decay function can be derived from the
diffusion-trap model, which predicts certain critical values of the fractional
stretching exponent. In practical implementations of glass relaxation models,
it is computationally convenient to represent the stretched exponential
function as a Prony series of simple exponentials. Here, we perform a
comprehensive mathematical analysis of the Prony series approximation of the
stretched exponential relaxation, including optimized coefficients for certain
critical values of the exponent. The fitting quality of the Prony series is
analyzed as a function of the number of terms in the series. With a sufficient
number of terms, the Prony series can accurately capture the time evolution of
the stretched exponential function, including its "fat tail" at long times.
However, it is unable to capture the divergence of the first-derivative of the
stretched exponential function in the limit of zero time. We also present a
frequency-domain analysis of the Prony series representation of the stretched
exponential function and discuss its physical implications for the modeling of
glass relaxation behavior.
|
cond-mat.soft
|
stretched exponential relaxation is a ubiquitous feature of homogeneous glasses the stretched exponential decay function can be derived from the diffusiontrap model which predicts certain critical values of the fractional stretching exponent in practical implementations of glass relaxation models it is computationally convenient to represent the stretched exponential function as a prony series of simple exponentials here we perform a comprehensive mathematical analysis of the prony series approximation of the stretched exponential relaxation including optimized coefficients for certain critical values of the exponent the fitting quality of the prony series is analyzed as a function of the number of terms in the series with a sufficient number of terms the prony series can accurately capture the time evolution of the stretched exponential function including its fat tail at long times however it is unable to capture the divergence of the firstderivative of the stretched exponential function in the limit of zero time we also present a frequencydomain analysis of the prony series representation of the stretched exponential function and discuss its physical implications for the modeling of glass relaxation behavior
|
[['stretched', 'exponential', 'relaxation', 'is', 'a', 'ubiquitous', 'feature', 'of', 'homogeneous', 'glasses', 'the', 'stretched', 'exponential', 'decay', 'function', 'can', 'be', 'derived', 'from', 'the', 'diffusiontrap', 'model', 'which', 'predicts', 'certain', 'critical', 'values', 'of', 'the', 'fractional', 'stretching', 'exponent', 'in', 'practical', 'implementations', 'of', 'glass', 'relaxation', 'models', 'it', 'is', 'computationally', 'convenient', 'to', 'represent', 'the', 'stretched', 'exponential', 'function', 'as', 'a', 'prony', 'series', 'of', 'simple', 'exponentials', 'here', 'we', 'perform', 'a', 'comprehensive', 'mathematical', 'analysis', 'of', 'the', 'prony', 'series', 'approximation', 'of', 'the', 'stretched', 'exponential', 'relaxation', 'including', 'optimized', 'coefficients', 'for', 'certain', 'critical', 'values', 'of', 'the', 'exponent', 'the', 'fitting', 'quality', 'of', 'the', 'prony', 'series', 'is', 'analyzed', 'as', 'a', 'function', 'of', 'the', 'number', 'of', 'terms', 'in', 'the', 'series', 'with', 'a', 'sufficient', 'number', 'of', 'terms', 'the', 'prony', 'series', 'can', 'accurately', 'capture', 'the', 'time', 'evolution', 'of', 'the', 'stretched', 'exponential', 'function', 'including', 'its', 'fat', 'tail', 'at', 'long', 'times', 'however', 'it', 'is', 'unable', 'to', 'capture', 'the', 'divergence', 'of', 'the', 'firstderivative', 'of', 'the', 'stretched', 'exponential', 'function', 'in', 'the', 'limit', 'of', 'zero', 'time', 'we', 'also', 'present', 'a', 'frequencydomain', 'analysis', 'of', 'the', 'prony', 'series', 'representation', 'of', 'the', 'stretched', 'exponential', 'function', 'and', 'discuss', 'its', 'physical', 'implications', 'for', 'the', 'modeling', 'of', 'glass', 'relaxation', 'behavior']]
|
[-0.10650933784329229, 0.07745050344900746, -0.15260878738352202, 0.09247796287397958, -0.039162059700659786, -0.11810526923379965, -0.007001595409949207, 0.31207075821132296, -0.31141658378247583, -0.2245690586666266, 0.11633746512169536, -0.2307062569203683, -0.1575010361770789, 0.2019908255056685, 0.028289201048513252, 0.12939824315253645, -0.0221258392635112, 0.04391266219317913, -0.1148604150990852, -0.23653303252972868, 0.22955300643031176, 0.06586250884251463, 0.27413540373349354, 0.012974272002207323, 0.07228645980875525, 0.0024491468560881914, -0.02188877871958539, -0.011993612913000915, -0.1664404607972958, 0.0904477618738181, 0.19811434369728684, 0.10072811433734993, 0.2669130207763778, -0.43716995819575255, -0.19058632167547734, 0.10480506396593733, 0.18346961308011991, 0.04273723566956404, 0.019945214988870752, -0.20193221617697013, 0.041576543036434384, -0.15986225449790556, -0.1768647111719474, -0.10392769432316223, 0.06822922327426366, 0.08630452882821879, -0.2897995757146014, 0.14766113576657114, 0.08434800046767729, 0.05359924002291842, -0.047553473375996365, -0.09336541408103788, 0.045330332960131475, 0.10972851741438111, 0.10711753754811879, -0.000488236487015254, 0.13255907792546268, -0.13224134852644057, -0.05991913089140629, 0.3335166027510746, -0.10486884038481448, -0.17676746113639738, 0.15018461371590902, -0.1632191615179181, -0.10624090481756462, 0.1620234858063567, 0.14891455095882217, 0.12289678542357352, -0.12355442963243048, 0.10762914826078082, -0.011026099518251916, 0.14507588071541655, 0.07497462944851982, 0.023863933695894148, 0.1763445013564908, 0.1772608457857536, 0.0029904521924133103, 0.20408350891472463, -0.06474596152030346, -0.13954035784376578, -0.32377036167308687, -0.1487356178772946, -0.21675027407861006, 0.08062614160848575, -0.1582661340089948, -0.23744015098652907, 0.4455204275016715, 0.030161727043903536, 0.24386686209149452, 0.12066721341430417, 0.2546708858468466, 0.19901645448440428, 0.05065877928088109, 0.023429249632115696, 0.16873701387085022, 0.11160660145752546, 0.09171721065585088, -0.23900750847403995, 0.11548035720026949, 0.07638699877619122]
|
1,803.07707
|
Pressure-Induced Phase Transformation in $\beta$-Eucryptite: an X-Ray
Diffraction and Density Functional Theory Study
|
Certain alumino-silicates display exotic properties enabled by their
framework structure made of corner-sharing tetrahedral rigid units. Using
\textit{in situ} diamond-anvil cell x-ray diffraction (XRD), we study the
pressure-induced transformation of $\beta$ eucryptite, a prototypical
alumino-silicate. $\beta$ eucryptite undergoes a phase transformation at
moderate pressures, but the atomic structure of the new phase has not yet been
reported. Based on density functional theory stability studies and Rietveld
analysis of XRD patterns, we find that the pressure-stabilized phase belongs to
the Pna2$_1$ space group. Furthermore, we discover two other possible
pressure-stabilized polymorphs, P1c1 and Pca2$_1$.
|
cond-mat.mtrl-sci
|
certain aluminosilicates display exotic properties enabled by their framework structure made of cornersharing tetrahedral rigid units using textitin situ diamondanvil cell xray diffraction xrd we study the pressureinduced transformation of beta eucryptite a prototypical aluminosilicate beta eucryptite undergoes a phase transformation at moderate pressures but the atomic structure of the new phase has not yet been reported based on density functional theory stability studies and rietveld analysis of xrd patterns we find that the pressurestabilized phase belongs to the pna2_1 space group furthermore we discover two other possible pressurestabilized polymorphs p1c1 and pca2_1
|
[['certain', 'aluminosilicates', 'display', 'exotic', 'properties', 'enabled', 'by', 'their', 'framework', 'structure', 'made', 'of', 'cornersharing', 'tetrahedral', 'rigid', 'units', 'using', 'textitin', 'situ', 'diamondanvil', 'cell', 'xray', 'diffraction', 'xrd', 'we', 'study', 'the', 'pressureinduced', 'transformation', 'of', 'beta', 'eucryptite', 'a', 'prototypical', 'aluminosilicate', 'beta', 'eucryptite', 'undergoes', 'a', 'phase', 'transformation', 'at', 'moderate', 'pressures', 'but', 'the', 'atomic', 'structure', 'of', 'the', 'new', 'phase', 'has', 'not', 'yet', 'been', 'reported', 'based', 'on', 'density', 'functional', 'theory', 'stability', 'studies', 'and', 'rietveld', 'analysis', 'of', 'xrd', 'patterns', 'we', 'find', 'that', 'the', 'pressurestabilized', 'phase', 'belongs', 'to', 'the', 'pna2_1', 'space', 'group', 'furthermore', 'we', 'discover', 'two', 'other', 'possible', 'pressurestabilized', 'polymorphs', 'p1c1', 'and', 'pca2_1']]
|
[-0.12793531672492542, 0.19885092250921804, -0.11107666055803471, -0.019078632725564683, -0.055868413051306874, -0.12239361970442468, 0.1345937689677711, 0.46744094888234267, -0.279485970938644, -0.2585609815609844, 0.05517751448433441, -0.3008167452239634, -0.20284464755905388, 0.13166032107951847, 0.06130111047794977, 0.06527045067480725, -0.04045429167783131, -0.02605050088554297, -0.15306368151125396, -0.16997515309460298, 0.25363682357736095, 0.04633274473219543, 0.3290191041305661, -0.0008901822350352355, 0.047730441926472376, -0.009334508607144411, 0.03338748204481343, 0.038610738463909874, -0.2083620363420145, 0.04875014593784252, 0.20249704762270837, 0.005938412856978729, 0.14430781000840437, -0.42916249874574336, -0.26025190044437413, 0.02961642149856071, 0.0861423569528953, 0.020204820290572294, -0.1349264330789953, -0.2389939439776556, 0.07133986537456108, -0.13542585072370814, -0.15727155292204217, -0.161932551899277, -0.045403158120082124, 0.0016038945000416236, -0.20872534930316286, 0.11320328223542753, -0.0013295491580324976, 0.15254767952770318, -0.14431527386287876, -0.12333223786022839, -0.05093094534949278, 0.06358214373113183, 0.013414455800438705, 0.020129938695944198, 0.1621322404522368, -0.039271480292486755, -0.09807789011392742, 0.3939011680043262, 0.028056246684054317, -0.021789530962806843, 0.1985039866008067, -0.20460585301992504, -0.23065959237030018, 0.19825612900920375, 0.044510589376010976, 0.11847816709348041, -0.13733120775989094, 0.08218870641481456, -0.03141269730226866, 0.26398242327749083, 0.12279871766931257, -0.0007841526429452326, 0.17146338593801888, 0.2041352463547019, -0.03276041657258959, 0.15583662991475253, -0.15067811357110497, -0.055159517195020075, -0.16843180835206548, -0.1604381768113893, -0.0957264207270624, 0.0039018932668272023, -0.07730846189983624, -0.2032020441762617, 0.33509494396655454, 0.02305929014540237, 0.1335084703143524, -0.08403413231565576, 0.18289975483861307, 0.01930157019270827, 0.08441644603305537, -0.03580422470923108, 0.22402923683757367, 0.17026702642855843, 0.09665242923200941, -0.27221320492579887, 0.10834455475940005, 0.07472613491067338]
|
1,803.07708
|
K2 Ultracool Dwarfs Survey. III. White Light Flares are Ubiquitous in
M6-L0 Dwarfs
|
We report the white light flare rates for 10 ultracool dwarfs (UCDs) using
\textit{Kepler K2} short cadence data. Among our sample stars, two have
spectral type M6, three are M7, three are M8 and two are L0. Most of our
targets are old low mass stars. We identify a total of 283 flares in all of the
stars in our sample, with \textit{Kepler} energies in the range log
\textit{E$_{Kp}$} $\sim$(29 - 33.5) erg. Using the maximum-likelihood method of
line fitting, we find that the flare frequency distribution (FFD) for each star
in our sample follows a power law with slope -$\alpha$ in range -(1.3-2.0). We
find that cooler objects tend to have shallower slopes. For some of our
targets, the FFD follows either a broken power law, or a power law with an
exponential cutoff. For the L0 dwarf 2MASS J12321827-0951502, we find a very
shallow slope (-$\alpha$ $=$ -1.3) in the \textit{Kepler} energy range
(0.82-130)$\times$10$^{30}$ erg: this L0 dwarf has flare rates which are
comparable to the rates of high energy flares in stars of earlier spectral
types. In addition, we report photometry of two superflares: one on the L0
dwarf 2MASS J12321827-0951502 and another on the M7 dwarf 2MASS
J08352366+1029318. In case of 2MASS J12321827-0951502, we report a flare
brightening by a factor of $\sim$144 relative to the quiescent photospheric
level. Likewise, for 2MASS J08352366+1029318, we report a flare brightening by
a factor of $\sim$60 relative to the quiescent photospheric level. These two
superflares have bolometric (UV/optical/infrared) energies 3.6 $\times$
10$^{33}$ erg and 8.9 $\times$ 10$^{33}$ erg respectively, while the FWHM time
scales are very short, $\sim$2 minutes. We find that the M8 star TRAPPIST-1 is
more active than the M8.5 dwarf: 2M03264453+1919309, but less active than
another M8 dwarf (2M12215066-0843197).
|
astro-ph.SR
|
we report the white light flare rates for 10 ultracool dwarfs ucds using textitkepler k2 short cadence data among our sample stars two have spectral type m6 three are m7 three are m8 and two are l0 most of our targets are old low mass stars we identify a total of 283 flares in all of the stars in our sample with textitkepler energies in the range log textite_kp sim29 335 erg using the maximumlikelihood method of line fitting we find that the flare frequency distribution ffd for each star in our sample follows a power law with slope alpha in range 1320 we find that cooler objects tend to have shallower slopes for some of our targets the ffd follows either a broken power law or a power law with an exponential cutoff for the l0 dwarf 2mass j123218270951502 we find a very shallow slope alpha 13 in the textitkepler energy range 082130times1030 erg this l0 dwarf has flare rates which are comparable to the rates of high energy flares in stars of earlier spectral types in addition we report photometry of two superflares one on the l0 dwarf 2mass j123218270951502 and another on the m7 dwarf 2mass j083523661029318 in case of 2mass j123218270951502 we report a flare brightening by a factor of sim144 relative to the quiescent photospheric level likewise for 2mass j083523661029318 we report a flare brightening by a factor of sim60 relative to the quiescent photospheric level these two superflares have bolometric uvopticalinfrared energies 36 times 1033 erg and 89 times 1033 erg respectively while the fwhm time scales are very short sim2 minutes we find that the m8 star trappist1 is more active than the m85 dwarf 2m032644531919309 but less active than another m8 dwarf 2m122150660843197
|
[['we', 'report', 'the', 'white', 'light', 'flare', 'rates', 'for', '10', 'ultracool', 'dwarfs', 'ucds', 'using', 'textitkepler', 'k2', 'short', 'cadence', 'data', 'among', 'our', 'sample', 'stars', 'two', 'have', 'spectral', 'type', 'm6', 'three', 'are', 'm7', 'three', 'are', 'm8', 'and', 'two', 'are', 'l0', 'most', 'of', 'our', 'targets', 'are', 'old', 'low', 'mass', 'stars', 'we', 'identify', 'a', 'total', 'of', '283', 'flares', 'in', 'all', 'of', 'the', 'stars', 'in', 'our', 'sample', 'with', 'textitkepler', 'energies', 'in', 'the', 'range', 'log', 'textite_kp', 'sim29', '335', 'erg', 'using', 'the', 'maximumlikelihood', 'method', 'of', 'line', 'fitting', 'we', 'find', 'that', 'the', 'flare', 'frequency', 'distribution', 'ffd', 'for', 'each', 'star', 'in', 'our', 'sample', 'follows', 'a', 'power', 'law', 'with', 'slope', 'alpha', 'in', 'range', '1320', 'we', 'find', 'that', 'cooler', 'objects', 'tend', 'to', 'have', 'shallower', 'slopes', 'for', 'some', 'of', 'our', 'targets', 'the', 'ffd', 'follows', 'either', 'a', 'broken', 'power', 'law', 'or', 'a', 'power', 'law', 'with', 'an', 'exponential', 'cutoff', 'for', 'the', 'l0', 'dwarf', '2mass', 'j123218270951502', 'we', 'find', 'a', 'very', 'shallow', 'slope', 'alpha', '13', 'in', 'the', 'textitkepler', 'energy', 'range', '082130times1030', 'erg', 'this', 'l0', 'dwarf', 'has', 'flare', 'rates', 'which', 'are', 'comparable', 'to', 'the', 'rates', 'of', 'high', 'energy', 'flares', 'in', 'stars', 'of', 'earlier', 'spectral', 'types', 'in', 'addition', 'we', 'report', 'photometry', 'of', 'two', 'superflares', 'one', 'on', 'the', 'l0', 'dwarf', '2mass', 'j123218270951502', 'and', 'another', 'on', 'the', 'm7', 'dwarf', '2mass', 'j083523661029318', 'in', 'case', 'of', '2mass', 'j123218270951502', 'we', 'report', 'a', 'flare', 'brightening', 'by', 'a', 'factor', 'of', 'sim144', 'relative', 'to', 'the', 'quiescent', 'photospheric', 'level', 'likewise', 'for', '2mass', 'j083523661029318', 'we', 'report', 'a', 'flare', 'brightening', 'by', 'a', 'factor', 'of', 'sim60', 'relative', 'to', 'the', 'quiescent', 'photospheric', 'level', 'these', 'two', 'superflares', 'have', 'bolometric', 'uvopticalinfrared', 'energies', '36', 'times', '1033', 'erg', 'and', '89', 'times', '1033', 'erg', 'respectively', 'while', 'the', 'fwhm', 'time', 'scales', 'are', 'very', 'short', 'sim2', 'minutes', 'we', 'find', 'that', 'the', 'm8', 'star', 'trappist1', 'is', 'more', 'active', 'than', 'the', 'm85', 'dwarf', '2m032644531919309', 'but', 'less', 'active', 'than', 'another', 'm8', 'dwarf', '2m122150660843197']]
|
[-0.07177892310133295, 0.1517766967246618, -0.06266353645650538, 0.14142227790016734, -0.10522103749140178, -0.10554268443465076, 0.08706713331335315, 0.451629338549896, -0.08449537132196062, -0.4091730277893514, 0.05154650923131939, -0.34168133936850287, -0.0066506903443131335, 0.2522301838911978, -0.07983373827628897, -0.03185661896714009, 0.09406111617638192, -0.03647614974044034, -0.058778158839116475, -0.28006755766904795, 0.25170389946359933, 0.017685711629767443, 0.1253154446529946, -0.091244946371659, 0.025726053512058367, -0.13396446282227695, -0.053959715386695216, -0.09774104701879789, -0.15117267521323605, -0.0026870733987815467, 0.21957144085285057, 0.07950544860591115, 0.22279503456465277, -0.3041008771434322, -0.21279569099899906, 0.0681397932447152, 0.17227291350636606, -0.05684593772191003, -0.012624052385432714, -0.2068376224705274, 0.11153097640277004, -0.19211631996268538, -0.13069059504081273, 0.0799882132133705, 0.11504481992238319, 0.036502403060169435, -0.23066252717603994, 0.15378382131719673, 0.05195832159887699, 0.1312768079363413, -0.174732885921938, -0.1643508882425778, -0.03507091133637209, 0.04601805161399452, 0.044471489632843246, 0.09096973813339759, 0.11788588486493788, -0.0956618660873599, -0.024297644110383387, 0.3548668533004902, -0.09154225480023355, 0.064047082253112, 0.205514891194442, -0.18788869044510648, -0.1999237504541795, 0.1742837784814314, 0.10773743673155582, 0.1506591505300273, -0.16516011542170045, -0.03239804080863316, 0.02512189096928587, 0.23674121908646759, 0.04516979343664478, 0.07494076406320846, 0.26314028148198315, 0.13308318996142832, 0.06253037184048903, 0.08013707051598008, -0.3126622403325828, 0.008877511201819904, -0.25127925481778424, -0.07179805419070016, -0.1232870355216478, 0.11871220764103936, -0.14716395743718597, -0.10827543635682112, 0.39236835659724256, 0.06479035773639187, 0.2434486543659685, 0.09493762332895643, 0.2547512758706867, 0.12476023044937264, 0.09665716788403585, 0.16676204450703436, 0.3258879793842502, 0.14015016704182875, 0.10969295826147009, -0.2064138119269661, -0.021307557657308563, 0.018243679422622835]
|
1,803.07709
|
Time dilation in relativistic quantum decay laws of moving unstable
particles
|
The relativistic quantum decay laws of moving unstable particles are analyzed
for a general class of mass distribution densities which behave as power laws
near the (non-vanishing) lower bound $\mu_0$ of the mass spectrum. The survival
probability $\mathcal{P}_p(t)$, the instantaneous mass $M_p(t)$ and the
instantaneous decay rate $\Gamma_p(t)$ of the moving unstable particle are
evaluated over short and long times for an arbitrary value $p$ of the
(constant) linear momentum. The ultrarelativistic and non-relativistic limits
are studied. Over long times, the survival probability $\mathcal{P}_p(t)$ is
approximately related to the survival probability at rest $\mathcal{P}_0(t)$ by
a scaling law. The scaling law can be interpreted as the effect of the
relativistic time dilation if the asymptotic value $M_p\left(\infty\right)$ of
the instantaneous mass is considered as the effective mass of the unstable
particle over long times. The effective mass has magnitude $\mu_0$ at rest and
moves with linear momentum $p$ or, equivalently, with constant velocity
$1\Big/\sqrt{1+\mu_0^2\big/p^2}$. The instantaneous decay rate $\Gamma_p(t)$ is
approximately independent of the linear momentum $p$, over long times, and,
consequently, is approximately invariant by changing reference frame.
|
quant-ph
|
the relativistic quantum decay laws of moving unstable particles are analyzed for a general class of mass distribution densities which behave as power laws near the nonvanishing lower bound mu_0 of the mass spectrum the survival probability mathcalp_pt the instantaneous mass m_pt and the instantaneous decay rate gamma_pt of the moving unstable particle are evaluated over short and long times for an arbitrary value p of the constant linear momentum the ultrarelativistic and nonrelativistic limits are studied over long times the survival probability mathcalp_pt is approximately related to the survival probability at rest mathcalp_0t by a scaling law the scaling law can be interpreted as the effect of the relativistic time dilation if the asymptotic value m_pleftinftyright of the instantaneous mass is considered as the effective mass of the unstable particle over long times the effective mass has magnitude mu_0 at rest and moves with linear momentum p or equivalently with constant velocity 1bigsqrt1mu_02bigp2 the instantaneous decay rate gamma_pt is approximately independent of the linear momentum p over long times and consequently is approximately invariant by changing reference frame
|
[['the', 'relativistic', 'quantum', 'decay', 'laws', 'of', 'moving', 'unstable', 'particles', 'are', 'analyzed', 'for', 'a', 'general', 'class', 'of', 'mass', 'distribution', 'densities', 'which', 'behave', 'as', 'power', 'laws', 'near', 'the', 'nonvanishing', 'lower', 'bound', 'mu_0', 'of', 'the', 'mass', 'spectrum', 'the', 'survival', 'probability', 'mathcalp_pt', 'the', 'instantaneous', 'mass', 'm_pt', 'and', 'the', 'instantaneous', 'decay', 'rate', 'gamma_pt', 'of', 'the', 'moving', 'unstable', 'particle', 'are', 'evaluated', 'over', 'short', 'and', 'long', 'times', 'for', 'an', 'arbitrary', 'value', 'p', 'of', 'the', 'constant', 'linear', 'momentum', 'the', 'ultrarelativistic', 'and', 'nonrelativistic', 'limits', 'are', 'studied', 'over', 'long', 'times', 'the', 'survival', 'probability', 'mathcalp_pt', 'is', 'approximately', 'related', 'to', 'the', 'survival', 'probability', 'at', 'rest', 'mathcalp_0t', 'by', 'a', 'scaling', 'law', 'the', 'scaling', 'law', 'can', 'be', 'interpreted', 'as', 'the', 'effect', 'of', 'the', 'relativistic', 'time', 'dilation', 'if', 'the', 'asymptotic', 'value', 'm_pleftinftyright', 'of', 'the', 'instantaneous', 'mass', 'is', 'considered', 'as', 'the', 'effective', 'mass', 'of', 'the', 'unstable', 'particle', 'over', 'long', 'times', 'the', 'effective', 'mass', 'has', 'magnitude', 'mu_0', 'at', 'rest', 'and', 'moves', 'with', 'linear', 'momentum', 'p', 'or', 'equivalently', 'with', 'constant', 'velocity', '1bigsqrt1mu_02bigp2', 'the', 'instantaneous', 'decay', 'rate', 'gamma_pt', 'is', 'approximately', 'independent', 'of', 'the', 'linear', 'momentum', 'p', 'over', 'long', 'times', 'and', 'consequently', 'is', 'approximately', 'invariant', 'by', 'changing', 'reference', 'frame']]
|
[-0.1356407780625556, 0.24830240024254058, -0.08924742520618813, 0.07763247490881688, 0.02097158774267882, -0.1313409947165796, 0.010815780477225251, 0.3201125650878318, -0.24437404953641817, -0.29064819193445146, 0.07905551008562642, -0.23825581636629067, 0.034335884087009945, 0.16619944092578656, 0.01801840177821842, 0.09528858029939742, -0.007851965040158988, 0.1287563596217131, -0.10309944292054173, -0.20582276162564417, 0.2606202339705884, 0.10932924067376669, 0.25960145075805485, 0.013530774525530764, 0.11570988432165243, 0.031805917771469634, -0.026424029655159262, -0.004124697940741581, -0.15292070334015245, -0.0036814067650332368, 0.16189994194296145, 0.051669950212313284, 0.2390644788948438, -0.3417931103189899, -0.1658378426932772, 0.13103431502399457, 0.1577743128921363, 0.060280164099822287, 0.0017126024079268311, -0.24473504498283463, 0.0643832676366649, -0.1872015037145254, -0.2061179379869083, 0.02862002181989903, 0.14123791158371288, 0.05363851382968609, -0.2922121169871058, 0.18952232423940918, 0.034875509424389085, 0.003384408509274098, -0.07822359156588474, -0.1190586119581977, -0.03474005972384475, 0.1042700477555627, 0.14487692700508473, 0.04985750204915265, 0.18728799507318233, -0.11432552585822785, -0.0512565527619286, 0.3713145338909023, -0.11025919763117352, -0.1788181880256161, 0.1439579296327958, -0.17404466932533647, -0.03363168683823791, 0.1906328296331181, 0.18034926953226782, 0.1224991584118801, -0.12412006057142703, 0.10250631429946887, -0.02761786331988829, 0.14304450728972865, 0.10488128094584681, 0.06374668106813756, 0.23689618030039128, 0.11943724404243933, 0.06813764951551672, 0.036753601452139927, -0.0967421689234801, -0.14532791829630945, -0.32196195950117806, -0.12980714995071388, -0.18614267140616325, 0.12907595141917805, -0.12207521156059639, -0.10418632128064266, 0.34692122418941423, 0.03631001346300102, 0.22988040249434893, 0.13431663804923036, 0.27807938016485423, 0.21755005678873698, 0.06950489556236955, 0.1256343605055008, 0.24302390205081215, 0.13662170656607486, 0.07740979317763545, -0.25772182865264104, 0.05617934420165098, 0.05916974098760296]
|
1,803.0771
|
Inference in Probabilistic Graphical Models by Graph Neural Networks
|
A fundamental computation for statistical inference and accurate
decision-making is to compute the marginal probabilities or most probable
states of task-relevant variables. Probabilistic graphical models can
efficiently represent the structure of such complex data, but performing these
inferences is generally difficult. Message-passing algorithms, such as belief
propagation, are a natural way to disseminate evidence amongst correlated
variables while exploiting the graph structure, but these algorithms can
struggle when the conditional dependency graphs contain loops. Here we use
Graph Neural Networks (GNNs) to learn a message-passing algorithm that solves
these inference tasks. We first show that the architecture of GNNs is
well-matched to inference tasks. We then demonstrate the efficacy of this
inference approach by training GNNs on a collection of graphical models and
showing that they substantially outperform belief propagation on loopy graphs.
Our message-passing algorithms generalize out of the training set to larger
graphs and graphs with different structure.
|
cs.LG cs.AI stat.ML
|
a fundamental computation for statistical inference and accurate decisionmaking is to compute the marginal probabilities or most probable states of taskrelevant variables probabilistic graphical models can efficiently represent the structure of such complex data but performing these inferences is generally difficult messagepassing algorithms such as belief propagation are a natural way to disseminate evidence amongst correlated variables while exploiting the graph structure but these algorithms can struggle when the conditional dependency graphs contain loops here we use graph neural networks gnns to learn a messagepassing algorithm that solves these inference tasks we first show that the architecture of gnns is wellmatched to inference tasks we then demonstrate the efficacy of this inference approach by training gnns on a collection of graphical models and showing that they substantially outperform belief propagation on loopy graphs our messagepassing algorithms generalize out of the training set to larger graphs and graphs with different structure
|
[['a', 'fundamental', 'computation', 'for', 'statistical', 'inference', 'and', 'accurate', 'decisionmaking', 'is', 'to', 'compute', 'the', 'marginal', 'probabilities', 'or', 'most', 'probable', 'states', 'of', 'taskrelevant', 'variables', 'probabilistic', 'graphical', 'models', 'can', 'efficiently', 'represent', 'the', 'structure', 'of', 'such', 'complex', 'data', 'but', 'performing', 'these', 'inferences', 'is', 'generally', 'difficult', 'messagepassing', 'algorithms', 'such', 'as', 'belief', 'propagation', 'are', 'a', 'natural', 'way', 'to', 'disseminate', 'evidence', 'amongst', 'correlated', 'variables', 'while', 'exploiting', 'the', 'graph', 'structure', 'but', 'these', 'algorithms', 'can', 'struggle', 'when', 'the', 'conditional', 'dependency', 'graphs', 'contain', 'loops', 'here', 'we', 'use', 'graph', 'neural', 'networks', 'gnns', 'to', 'learn', 'a', 'messagepassing', 'algorithm', 'that', 'solves', 'these', 'inference', 'tasks', 'we', 'first', 'show', 'that', 'the', 'architecture', 'of', 'gnns', 'is', 'wellmatched', 'to', 'inference', 'tasks', 'we', 'then', 'demonstrate', 'the', 'efficacy', 'of', 'this', 'inference', 'approach', 'by', 'training', 'gnns', 'on', 'a', 'collection', 'of', 'graphical', 'models', 'and', 'showing', 'that', 'they', 'substantially', 'outperform', 'belief', 'propagation', 'on', 'loopy', 'graphs', 'our', 'messagepassing', 'algorithms', 'generalize', 'out', 'of', 'the', 'training', 'set', 'to', 'larger', 'graphs', 'and', 'graphs', 'with', 'different', 'structure']]
|
[-0.07696313475258648, 0.03428824436540405, -0.06786359674413689, 0.13642446427140384, -0.1752589142881334, -0.17076263329014182, 0.07275805476897707, 0.49330393970012665, -0.30350433841735747, -0.3655005485502382, 0.06474112040208031, -0.2237249149971952, -0.23307487558728704, 0.15943829824216663, -0.080067137957667, 0.10837627356328691, 0.16624410237185658, 0.05530147726802776, -0.04735266521495456, -0.28749618007219396, 0.27217049470171334, 0.023670877227559686, 0.27564066340215504, -0.027364668931501607, 0.10823852383686851, 0.003168375939130783, -0.011783536464596789, 0.038569314951697985, -0.05029355528371525, 0.1765880628748952, 0.3195234568609643, 0.2624362576830511, 0.30436881121713666, -0.4329741736377279, -0.24112409537735705, 0.1352467520814389, 0.17237152063132574, 0.14743192265896748, 0.05571474310786774, -0.30636583182339866, 0.09448297238598267, -0.12791343294394514, 0.024591299400975306, -0.1670562014915049, -0.03951622632332146, 0.015357009057188406, -0.295705894358689, 0.019325246612230937, 0.1004475714514653, 0.03571948771054546, 0.04120513776317239, -0.11934819910364847, 0.0037199909364183745, 0.11184362209499038, -0.012264376740592222, 0.009133290881291032, 0.12188921198714525, -0.15629317645643218, -0.2108248193593075, 0.3447935436759144, 0.022833704613149167, -0.20738301128769915, 0.20483478580601513, -0.0273353107937146, -0.23790759309815865, 0.09054123502535125, 0.24626821912049005, 0.1377097432843099, -0.15550172841806972, 0.03187802343978546, -0.03913899614165227, 0.15484236646443605, 0.03281702958745882, -0.004697152211641272, 0.1739405452956756, 0.19939207427048436, 0.05573249348904938, 0.11530150165781379, -0.06539519377673665, -0.13120693077643714, -0.20717311153110737, -0.1020822668299661, -0.1898571227521946, -0.010147124955741068, -0.16121813824992084, -0.22175642033544135, 0.38766838940636567, 0.24566111307591199, 0.18341113423307737, 0.16554965188105902, 0.3036711887580653, 0.0515262063058132, 0.07816674545286029, 0.2117822673311457, 0.13744302355723145, 0.122998388063473, 0.041462752876492835, -0.12974392932839693, 0.1694131531411161, 0.01575734410978233]
|
1,803.07711
|
Data-Driven Computational Methods: Parameter and Operator Estimations
(Chapter 1)
|
Modern scientific computational methods are undergoing a transformative
change; big data and statistical learning methods now have the potential to
outperform the classical first-principles modeling paradigm. This book bridges
this transition, connecting the theory of probability, stochastic processes,
functional analysis, numerical analysis, and differential geometry. It
describes two classes of computational methods to leverage data for modeling
dynamical systems. The first is concerned with data fitting algorithms to
estimate parameters in parametric models that are postulated on the basis of
physical or dynamical laws. The second class is on operator estimation, which
uses the data to nonparametrically approximate the operator generated by the
transition function of the underlying dynamical systems.
This self-contained book is suitable for graduate studies in applied
mathematics, statistics, and engineering. Carefully chosen elementary examples
with supplementary MATLAB codes and appendices covering the relevant
prerequisite materials are provided, making it suitable for self-study.
|
physics.data-an physics.comp-ph
|
modern scientific computational methods are undergoing a transformative change big data and statistical learning methods now have the potential to outperform the classical firstprinciples modeling paradigm this book bridges this transition connecting the theory of probability stochastic processes functional analysis numerical analysis and differential geometry it describes two classes of computational methods to leverage data for modeling dynamical systems the first is concerned with data fitting algorithms to estimate parameters in parametric models that are postulated on the basis of physical or dynamical laws the second class is on operator estimation which uses the data to nonparametrically approximate the operator generated by the transition function of the underlying dynamical systems this selfcontained book is suitable for graduate studies in applied mathematics statistics and engineering carefully chosen elementary examples with supplementary matlab codes and appendices covering the relevant prerequisite materials are provided making it suitable for selfstudy
|
[['modern', 'scientific', 'computational', 'methods', 'are', 'undergoing', 'a', 'transformative', 'change', 'big', 'data', 'and', 'statistical', 'learning', 'methods', 'now', 'have', 'the', 'potential', 'to', 'outperform', 'the', 'classical', 'firstprinciples', 'modeling', 'paradigm', 'this', 'book', 'bridges', 'this', 'transition', 'connecting', 'the', 'theory', 'of', 'probability', 'stochastic', 'processes', 'functional', 'analysis', 'numerical', 'analysis', 'and', 'differential', 'geometry', 'it', 'describes', 'two', 'classes', 'of', 'computational', 'methods', 'to', 'leverage', 'data', 'for', 'modeling', 'dynamical', 'systems', 'the', 'first', 'is', 'concerned', 'with', 'data', 'fitting', 'algorithms', 'to', 'estimate', 'parameters', 'in', 'parametric', 'models', 'that', 'are', 'postulated', 'on', 'the', 'basis', 'of', 'physical', 'or', 'dynamical', 'laws', 'the', 'second', 'class', 'is', 'on', 'operator', 'estimation', 'which', 'uses', 'the', 'data', 'to', 'nonparametrically', 'approximate', 'the', 'operator', 'generated', 'by', 'the', 'transition', 'function', 'of', 'the', 'underlying', 'dynamical', 'systems', 'this', 'selfcontained', 'book', 'is', 'suitable', 'for', 'graduate', 'studies', 'in', 'applied', 'mathematics', 'statistics', 'and', 'engineering', 'carefully', 'chosen', 'elementary', 'examples', 'with', 'supplementary', 'matlab', 'codes', 'and', 'appendices', 'covering', 'the', 'relevant', 'prerequisite', 'materials', 'are', 'provided', 'making', 'it', 'suitable', 'for', 'selfstudy']]
|
[-0.058131890377820766, 0.03839705906144968, -0.09913918916263605, 0.11405091183116557, -0.10545234254893068, -0.15389260424744364, 0.018910609156193137, 0.3557407991093111, -0.290974204505041, -0.3193930716457943, 0.1309889327289779, -0.2874544228695027, -0.17765443046236, 0.23405805425176218, -0.07071672942750921, 0.11554592856116695, 0.0845040123820407, -0.011160958092659712, -0.09142884065885769, -0.2243751529572302, 0.3215978814684467, 0.05537752742075348, 0.2924160033349611, -0.019072874918044228, 0.08707621145342821, -0.0017119253272838949, -0.10302345332855435, -0.022522482653435524, -0.15799479489718055, 0.1597689823183703, 0.3194868931723872, 0.1598338165148225, 0.314133314661401, -0.41661560071683296, -0.24058605673761196, 0.0646613890190341, 0.08528513756117381, 0.11059961696665684, -0.03749197154873599, -0.26815912441337764, 0.042551789882478035, -0.14235169903617606, -0.11315454513533041, -0.13232567024174824, 0.01161063824818559, 0.03903555624467665, -0.2534086442718359, 0.052694022534287545, 0.04119097238605083, 0.1166682286213522, -0.03995805185077687, -0.13004741013968643, 0.020614179922905686, 0.12195326134270258, 0.024609165216719554, -0.0013021161677698567, 0.15216141033675268, -0.0985506845670848, -0.13795375544896782, 0.3717463771260044, -0.010267607847783612, -0.20384417571229477, 0.19877656431843158, -0.0765308071516314, -0.19010207482792232, 0.10399477185573021, 0.19937768066222206, 0.08629954519341955, -0.20212760471024435, 0.10794020082310403, 0.03682863320385852, 0.15083779009020798, -0.010962416083003357, -0.013217808171621945, 0.17953543432458777, 0.20235037735714387, -0.0013535683958676376, 0.07147608171392564, 0.006609946739706785, -0.15443626170729172, -0.3096800836134855, -0.12131781170578444, -0.20853856195733972, 0.004150733873184311, -0.07237134684054244, -0.1997260643322378, 0.37229861733376063, 0.1767843460216831, 0.10790761207766218, 0.014494361168519938, 0.3080297631836713, 0.13714453069276292, 0.05778892794049868, 0.06031437224408688, 0.18447675439688593, 0.15103992391441476, 0.12645581729505975, -0.13804395459389016, 0.06823530189744005, 0.058653225310542303]
|
1,803.07712
|
Causal Inference on Discrete Data via Estimating Distance Correlations
|
In this paper, we deal with the problem of inferring causal directions when
the data is on discrete domain. By considering the distribution of the cause
$P(X)$ and the conditional distribution mapping cause to effect $P(Y|X)$ as
independent random variables, we propose to infer the causal direction via
comparing the distance correlation between $P(X)$ and $P(Y|X)$ with the
distance correlation between $P(Y)$ and $P(X|Y)$. We infer "$X$ causes $Y$" if
the dependence coefficient between $P(X)$ and $P(Y|X)$ is smaller. Experiments
are performed to show the performance of the proposed method.
|
stat.ML cs.AI cs.LG
|
in this paper we deal with the problem of inferring causal directions when the data is on discrete domain by considering the distribution of the cause px and the conditional distribution mapping cause to effect pyx as independent random variables we propose to infer the causal direction via comparing the distance correlation between px and pyx with the distance correlation between py and pxy we infer x causes y if the dependence coefficient between px and pyx is smaller experiments are performed to show the performance of the proposed method
|
[['in', 'this', 'paper', 'we', 'deal', 'with', 'the', 'problem', 'of', 'inferring', 'causal', 'directions', 'when', 'the', 'data', 'is', 'on', 'discrete', 'domain', 'by', 'considering', 'the', 'distribution', 'of', 'the', 'cause', 'px', 'and', 'the', 'conditional', 'distribution', 'mapping', 'cause', 'to', 'effect', 'pyx', 'as', 'independent', 'random', 'variables', 'we', 'propose', 'to', 'infer', 'the', 'causal', 'direction', 'via', 'comparing', 'the', 'distance', 'correlation', 'between', 'px', 'and', 'pyx', 'with', 'the', 'distance', 'correlation', 'between', 'py', 'and', 'pxy', 'we', 'infer', 'x', 'causes', 'y', 'if', 'the', 'dependence', 'coefficient', 'between', 'px', 'and', 'pyx', 'is', 'smaller', 'experiments', 'are', 'performed', 'to', 'show', 'the', 'performance', 'of', 'the', 'proposed', 'method']]
|
[-0.09047118123206828, 0.06258126587296525, -0.07850151370900373, 0.05035664837988507, -0.08245614746378528, -0.11503219753503799, 0.0768083649674534, 0.4211382140301996, -0.3474171358264155, -0.3011072052901404, 0.05069157774948205, -0.31229311198823984, -0.12150739505887032, 0.14032666919908177, -0.05187090484218465, 0.028075151471421124, 0.025738164596259595, 0.02102996538289719, -0.11680144160054624, -0.21941099752568535, 0.34462176202020295, 0.0225735479509846, 0.2833651791119741, 0.02678956395636002, 0.1539389974036668, 0.059644325900201994, -0.050283923879679705, 0.019701442515684498, -0.097874700006408, 0.09089064025708164, 0.19528497440947426, 0.16228846214613035, 0.26196648445394305, -0.37090244324256977, -0.20576542763737962, 0.139203880323718, 0.08951356875089307, -0.009816806111484767, 0.024869777832645924, -0.283359916583221, 0.09709371751588251, -0.11682447736254997, -0.0730588329289781, -0.0055870994149396815, 0.06219827226725304, 0.0242001679725945, -0.3279089477948017, 0.1299890562452169, 0.05601205159392622, 0.07326497690131267, -0.011090145855107241, -0.11284171021026042, -0.014069352195494704, 0.12829739597218576, 0.1408057134029352, 0.12071885236331986, 0.058405956289627484, -0.06277123533654957, -0.08062317948659053, 0.31660209668593275, -0.0769151956657879, -0.25220171450960654, 0.15876612588763236, -0.19223425678598385, -0.09031079894759589, 0.048103736196127206, 0.17310327020370297, 0.102800884258209, -0.13447278272182706, 0.06957804115696085, -0.0159939292507867, 0.1769855590744151, 0.026006437385351293, 0.026266608532104226, 0.18141550699300651, 0.12193963625727014, 0.02447349116102689, 0.1816594526119944, -0.20429341793448355, -0.094407344257666, -0.26531491176121763, -0.1389718713135355, -0.23430593006002406, 0.034822636899641816, -0.1370299605853183, -0.11719714278846773, 0.33911206130352284, 0.1930828320586847, 0.2840009588230815, 0.055236830262260304, 0.23976380626360574, 0.12896378754198345, 0.011135883399078415, 0.09158959133136603, 0.17796813378162268, 0.14686041660865562, 0.05927493617249032, -0.24148756371707553, 0.21961536459728248, 0.022668846727659304]
|
1,803.07713
|
Robust Beamforming for SWIPT System with Chance Constraints
|
The robust beamforming problem in multiple-input single-output (MISO)
downlink networks of simultaneous wireless information and power transfer
(SWIPT) is studied in this paper. Adopting the time switching fashion to
perform energy harvesting and information decoding respectively, we aim at
maximizing the sum rate under imperfect channel state information (CSI) and the
chance constraints of users' harvested energy. In view of the fact that the
constraints for minimal harvested energy is not necessary to meet from time to
time, this paper adopts chance constraint to model it and uses the Bernstein
inequality to transform it into deterministic constraints equivalently.
Recognizing the maximum sum rate problem of imperfect CSI as nonconvex problem,
we transform it into finding the expectation of minimum mean square error
(MMSE) equivalently in this paper, and an alternative optimization (AO)
algorithm is proposed to decompose the optimization problem into two
sub-problems: the transmit beamformer design and the division of switching
time. The simulation results show the performance gains compared to non-robust
state of the art schemes.
|
eess.SP
|
the robust beamforming problem in multipleinput singleoutput miso downlink networks of simultaneous wireless information and power transfer swipt is studied in this paper adopting the time switching fashion to perform energy harvesting and information decoding respectively we aim at maximizing the sum rate under imperfect channel state information csi and the chance constraints of users harvested energy in view of the fact that the constraints for minimal harvested energy is not necessary to meet from time to time this paper adopts chance constraint to model it and uses the bernstein inequality to transform it into deterministic constraints equivalently recognizing the maximum sum rate problem of imperfect csi as nonconvex problem we transform it into finding the expectation of minimum mean square error mmse equivalently in this paper and an alternative optimization ao algorithm is proposed to decompose the optimization problem into two subproblems the transmit beamformer design and the division of switching time the simulation results show the performance gains compared to nonrobust state of the art schemes
|
[['the', 'robust', 'beamforming', 'problem', 'in', 'multipleinput', 'singleoutput', 'miso', 'downlink', 'networks', 'of', 'simultaneous', 'wireless', 'information', 'and', 'power', 'transfer', 'swipt', 'is', 'studied', 'in', 'this', 'paper', 'adopting', 'the', 'time', 'switching', 'fashion', 'to', 'perform', 'energy', 'harvesting', 'and', 'information', 'decoding', 'respectively', 'we', 'aim', 'at', 'maximizing', 'the', 'sum', 'rate', 'under', 'imperfect', 'channel', 'state', 'information', 'csi', 'and', 'the', 'chance', 'constraints', 'of', 'users', 'harvested', 'energy', 'in', 'view', 'of', 'the', 'fact', 'that', 'the', 'constraints', 'for', 'minimal', 'harvested', 'energy', 'is', 'not', 'necessary', 'to', 'meet', 'from', 'time', 'to', 'time', 'this', 'paper', 'adopts', 'chance', 'constraint', 'to', 'model', 'it', 'and', 'uses', 'the', 'bernstein', 'inequality', 'to', 'transform', 'it', 'into', 'deterministic', 'constraints', 'equivalently', 'recognizing', 'the', 'maximum', 'sum', 'rate', 'problem', 'of', 'imperfect', 'csi', 'as', 'nonconvex', 'problem', 'we', 'transform', 'it', 'into', 'finding', 'the', 'expectation', 'of', 'minimum', 'mean', 'square', 'error', 'mmse', 'equivalently', 'in', 'this', 'paper', 'and', 'an', 'alternative', 'optimization', 'ao', 'algorithm', 'is', 'proposed', 'to', 'decompose', 'the', 'optimization', 'problem', 'into', 'two', 'subproblems', 'the', 'transmit', 'beamformer', 'design', 'and', 'the', 'division', 'of', 'switching', 'time', 'the', 'simulation', 'results', 'show', 'the', 'performance', 'gains', 'compared', 'to', 'nonrobust', 'state', 'of', 'the', 'art', 'schemes']]
|
[-0.19945962876400222, -0.028013348693656598, -0.048459255938983654, 0.02720454670322527, -0.10213141590412263, -0.21840196565192724, 0.08890430570699252, 0.38216243895086727, -0.3390501471343062, -0.3064925221260637, 0.11088061552505851, -0.24540518138313755, -0.14437213913853547, 0.12053227545333184, -0.12601881598987216, 0.08568715885104168, 0.07398899628814044, 0.03718791979675492, -0.07921749441829022, -0.30176772372353644, 0.24680233163581716, 0.13851023057386988, 0.37284781685143353, 0.009106155191451156, 0.14189183432123778, 0.04575307566916481, 0.011262743074136475, -0.048424699596667085, -0.12339865092425975, 0.08257174858313408, 0.3322487136992138, 0.2504875478223853, 0.3020998945104934, -0.42145649350381326, -0.21573589586963257, 0.17180121978578558, 0.1497059699024595, 0.04932207990315787, -0.01615567962705557, -0.23161776810108373, 0.09699012090485278, -0.1848496517964772, 0.028519265445841786, 0.04113019538705148, -0.11127459578121834, -0.010582208796958661, -0.37416712454952566, 0.07590695266844705, 0.031944066843044266, -0.01106091070410219, -0.11654475709379074, -0.1610311870241449, 0.02768311581097632, 0.11355296378107076, 0.05090940702800816, -0.013713391319989958, 0.06400557599096958, -0.10697295866668269, -0.11501634528419691, 0.3554448847204358, 0.012771750219967327, -0.25833576809271197, 0.08521531948194717, -0.061291853179379054, -0.06360926881565579, 0.19082378228527627, 0.2689717738054848, 0.0906139512579622, -0.20891086994309999, 0.022795548480297884, 0.003907155025184953, 0.17660200401830176, 0.0596251209062757, 0.1208532906242735, 0.14504403315368108, 0.1869357576776695, 0.1954639443318315, 0.16485905165678733, -0.10019234882894948, -0.13767159056650208, -0.22772429668943264, -0.1315696862487433, -0.2440945287747863, 0.04840547009518473, -0.06939893438972095, -0.04995220649566147, 0.36547795752994716, 0.13764141232795304, 0.08905665312306069, 0.1489245572981114, 0.4242256691546312, 0.1413859246053367, -0.006175131362397224, 0.12940491307693133, 0.2124345216323577, 0.13166200126510202, 0.12947343571812825, -0.25945427172423696, 0.042273140632979836, 0.02109620345349651]
|
1,803.07714
|
Breathing mode frequency of a strongly interacting Fermi gas across the
2D-3D dimensional crossover
|
We address the interplay between dimension and quantum anomaly on the
breathing mode frequency of a strongly interacting Fermi gas harmonically
trapped at zero temperature. Using a beyond mean-field, Gaussian pair
fluctuation theory, we employ periodic boundary conditions to simulate the
dimensionality of the system and impose a local density approximation, with two
different schemes, to model different trapping potentials in the
tightly-confined axial direction. By using a sum-rule approach, we compute the
breathing mode frequency associated with a small variation of the trapping
frequency along the weakly-confined transverse direction, and describe its
behavior as functions of the dimensionality, from two- to three-dimensions, and
of the interaction strength. We compare our predictions with previous
calculations on the two-dimensional breathing mode anomaly and discuss their
possible observation in ultracold Fermi gases of $^{6}$Li and $^{40}$K atoms.
|
cond-mat.quant-gas
|
we address the interplay between dimension and quantum anomaly on the breathing mode frequency of a strongly interacting fermi gas harmonically trapped at zero temperature using a beyond meanfield gaussian pair fluctuation theory we employ periodic boundary conditions to simulate the dimensionality of the system and impose a local density approximation with two different schemes to model different trapping potentials in the tightlyconfined axial direction by using a sumrule approach we compute the breathing mode frequency associated with a small variation of the trapping frequency along the weaklyconfined transverse direction and describe its behavior as functions of the dimensionality from two to threedimensions and of the interaction strength we compare our predictions with previous calculations on the twodimensional breathing mode anomaly and discuss their possible observation in ultracold fermi gases of 6li and 40k atoms
|
[['we', 'address', 'the', 'interplay', 'between', 'dimension', 'and', 'quantum', 'anomaly', 'on', 'the', 'breathing', 'mode', 'frequency', 'of', 'a', 'strongly', 'interacting', 'fermi', 'gas', 'harmonically', 'trapped', 'at', 'zero', 'temperature', 'using', 'a', 'beyond', 'meanfield', 'gaussian', 'pair', 'fluctuation', 'theory', 'we', 'employ', 'periodic', 'boundary', 'conditions', 'to', 'simulate', 'the', 'dimensionality', 'of', 'the', 'system', 'and', 'impose', 'a', 'local', 'density', 'approximation', 'with', 'two', 'different', 'schemes', 'to', 'model', 'different', 'trapping', 'potentials', 'in', 'the', 'tightlyconfined', 'axial', 'direction', 'by', 'using', 'a', 'sumrule', 'approach', 'we', 'compute', 'the', 'breathing', 'mode', 'frequency', 'associated', 'with', 'a', 'small', 'variation', 'of', 'the', 'trapping', 'frequency', 'along', 'the', 'weaklyconfined', 'transverse', 'direction', 'and', 'describe', 'its', 'behavior', 'as', 'functions', 'of', 'the', 'dimensionality', 'from', 'two', 'to', 'threedimensions', 'and', 'of', 'the', 'interaction', 'strength', 'we', 'compare', 'our', 'predictions', 'with', 'previous', 'calculations', 'on', 'the', 'twodimensional', 'breathing', 'mode', 'anomaly', 'and', 'discuss', 'their', 'possible', 'observation', 'in', 'ultracold', 'fermi', 'gases', 'of', '6li', 'and', '40k', 'atoms']]
|
[-0.154803061364792, 0.1932342368970389, -0.05405612030229879, 0.023811823441716496, -0.009530541768519958, -0.16043710463277217, 0.08714389915616293, 0.36983578632683006, -0.24697082639852566, -0.23575153453414566, 0.027544032026485386, -0.29042209511094574, -0.09931421427772061, 0.16840864288787455, 0.05252684618662626, 0.05448572642696368, 0.01860150845839517, 0.03279806467280515, -0.08669282791401092, -0.1837300783702617, 0.33120174981469513, 0.041937799421451816, 0.32963729148848786, 0.066519631079829, 0.06515630692201875, 0.02320815401964946, 0.030198442617625887, -0.0026130644090251245, -0.1577136427330882, 0.1019305884872855, 0.17407783990727613, -0.03420203076866664, 0.2258361641772842, -0.44438796345867326, -0.22579866518447203, 0.06551962398659827, 0.14204336714986435, 0.1780299147879427, -0.02110612398072549, -0.28601518465873244, -0.0394263347270273, -0.17396821702288381, -0.2141502705479124, -0.1102408459271068, -0.018172679439451157, 0.026797576969030745, -0.2413874838376112, 0.13325483088534493, 0.014149537796516027, 0.09534278999332733, -0.1279232222838814, -0.06627886566079792, 0.015985868747846514, 0.0507932887612425, 0.05364151414589776, 0.025984194518914865, 0.15885499857866497, -0.11903436341559265, -0.09683921993814353, 0.3698282863757114, -0.13855204997069911, -0.1943278945721825, 0.270543532866512, -0.18092537313046406, -0.0607328085444256, 0.11123368786230906, 0.19234495029659637, 0.0491040057586089, -0.1051765337365735, 0.0716483339714234, -0.003152759587600716, 0.148952022169668, 0.09080031187336113, 0.038531831569914056, 0.22630054706624195, 0.14488501023542857, 0.03510441230401508, 0.15011616555084265, -0.17439132615265354, -0.09758839140161385, -0.267715982147562, -0.10058733741900494, -0.19878834378649307, -0.013700755535444217, -0.05658484183520308, -0.1592852754984051, 0.4240828994939576, 0.14348570733511848, 0.23481835988558716, -0.0037196503079899436, 0.29468591129337784, 0.12311130504596478, 0.045738603997933884, 0.037449465480758184, 0.2505279900384511, 0.1626429257553015, 0.06472081264981361, -0.33850484097258315, -0.048339129095452266, 0.07581660582218319]
|
1,803.07715
|
SurvBoost: An R Package for High-Dimensional Variable Selection in the
Stratified Proportional Hazards Model via Gradient Boosting
|
High-dimensional variable selection in the proportional hazards (PH) model
has many successful applications in different areas. In practice, data may
involve confounding variables that do not satisfy the PH assumption, in which
case the stratified proportional hazards (SPH) model can be adopted to control
the confounding effects by stratification of the confounding variable, without
directly modeling the confounding effects. However, there is lack of
computationally efficient statistical software for high-dimensional variable
selection in the SPH model. In this work, an R package, SurvBoost, is developed
to implement the gradient boosting algorithm for fitting the SPH model with
high-dimensional covariate variables and other confounders. Extensive
simulation studies demonstrate that in many scenarios SurvBoost can achieve a
better selection accuracy and reduce computational time substantially compared
to the existing R package that implements boosting algorithms without
stratification. The proposed R package is also illustrated by an analysis of
the gene expression data with survival outcome in The Cancer Genome Atlas
(TCGA) study. In addition, a detailed hands-on tutorial for SurvBoost is
provided.
|
stat.CO
|
highdimensional variable selection in the proportional hazards ph model has many successful applications in different areas in practice data may involve confounding variables that do not satisfy the ph assumption in which case the stratified proportional hazards sph model can be adopted to control the confounding effects by stratification of the confounding variable without directly modeling the confounding effects however there is lack of computationally efficient statistical software for highdimensional variable selection in the sph model in this work an r package survboost is developed to implement the gradient boosting algorithm for fitting the sph model with highdimensional covariate variables and other confounders extensive simulation studies demonstrate that in many scenarios survboost can achieve a better selection accuracy and reduce computational time substantially compared to the existing r package that implements boosting algorithms without stratification the proposed r package is also illustrated by an analysis of the gene expression data with survival outcome in the cancer genome atlas tcga study in addition a detailed handson tutorial for survboost is provided
|
[['highdimensional', 'variable', 'selection', 'in', 'the', 'proportional', 'hazards', 'ph', 'model', 'has', 'many', 'successful', 'applications', 'in', 'different', 'areas', 'in', 'practice', 'data', 'may', 'involve', 'confounding', 'variables', 'that', 'do', 'not', 'satisfy', 'the', 'ph', 'assumption', 'in', 'which', 'case', 'the', 'stratified', 'proportional', 'hazards', 'sph', 'model', 'can', 'be', 'adopted', 'to', 'control', 'the', 'confounding', 'effects', 'by', 'stratification', 'of', 'the', 'confounding', 'variable', 'without', 'directly', 'modeling', 'the', 'confounding', 'effects', 'however', 'there', 'is', 'lack', 'of', 'computationally', 'efficient', 'statistical', 'software', 'for', 'highdimensional', 'variable', 'selection', 'in', 'the', 'sph', 'model', 'in', 'this', 'work', 'an', 'r', 'package', 'survboost', 'is', 'developed', 'to', 'implement', 'the', 'gradient', 'boosting', 'algorithm', 'for', 'fitting', 'the', 'sph', 'model', 'with', 'highdimensional', 'covariate', 'variables', 'and', 'other', 'confounders', 'extensive', 'simulation', 'studies', 'demonstrate', 'that', 'in', 'many', 'scenarios', 'survboost', 'can', 'achieve', 'a', 'better', 'selection', 'accuracy', 'and', 'reduce', 'computational', 'time', 'substantially', 'compared', 'to', 'the', 'existing', 'r', 'package', 'that', 'implements', 'boosting', 'algorithms', 'without', 'stratification', 'the', 'proposed', 'r', 'package', 'is', 'also', 'illustrated', 'by', 'an', 'analysis', 'of', 'the', 'gene', 'expression', 'data', 'with', 'survival', 'outcome', 'in', 'the', 'cancer', 'genome', 'atlas', 'tcga', 'study', 'in', 'addition', 'a', 'detailed', 'handson', 'tutorial', 'for', 'survboost', 'is', 'provided']]
|
[-0.045087164072045945, 0.01792912159460898, -0.08617298091926119, 0.11090344834785142, -0.1051593168583863, -0.2049338349743801, 0.02124344280318302, 0.399719635191757, -0.2343606127617771, -0.329298156891566, 0.09483813354403109, -0.22078833932276157, -0.14250730956521104, 0.20121358465745717, -0.14421384407152585, 0.07476340467658113, 0.11727448397398214, -0.047617428447804686, 0.012644073530100285, -0.29754469758721397, 0.22192554952138488, 0.1166887069312746, 0.29769271584090723, -0.02736588318092639, 0.06840153307215695, 0.025119383559178782, -0.12643178032081137, 0.03424883003565757, -0.0922091323436796, 0.07566815176773269, 0.3232889938113444, 0.21200668088653507, 0.3571996974375318, -0.4040144506992553, -0.2869922635419404, 0.1259067571900018, 0.1408883848172777, 0.08737704147283426, -0.03329910988755086, -0.21695038143627565, 0.020719102005857755, -0.1942612646481447, -0.07469490380574237, -0.12942982042098747, 0.002327001587871243, -0.0010444468250224257, -0.3403977799777161, 0.09672017440949704, 0.010958032535991686, 0.10707792083404082, -0.02294483787708861, -0.1499787773238495, -0.016545702634132742, 0.06906535541638732, 0.10779855770387632, 0.04401167769888964, 0.17033372580840744, -0.11833048502996783, -0.11941436514367952, 0.3461489734404227, -0.03569887068999164, -0.2703966851565329, 0.20603007580811047, -0.08611752003540887, -0.1805945685270297, 0.11049590751747874, 0.20972527478383307, 0.08069141077918603, -0.2071434290613979, 0.09396430382381796, 0.011331083740600769, 0.1889920281520223, -0.009712923238711322, -0.06040788470246993, 0.10820990440380925, 0.18652589544106055, 0.010208576641675524, 0.1007502071939491, -0.10276226958889953, -0.08039491356295698, -0.285033289288335, -0.13404740141156843, -0.1407092634430977, -0.06339072938794475, -0.13734441826048116, -0.16569890456602854, 0.3575323556056794, 0.23135985090082292, 0.14611478804350447, 0.02356827455257778, 0.35320211014546016, 0.04866061204332201, 0.09605240297832471, 0.06357958847245969, 0.16452759837539976, 0.08079150655745145, 0.05089498961289578, -0.24453339564668783, 0.16053164596258498, -0.011409930295399938]
|
1,803.07716
|
Generative Adversarial Talking Head: Bringing Portraits to Life with a
Weakly Supervised Neural Network
|
This paper presents Generative Adversarial Talking Head (GATH), a novel deep
generative neural network that enables fully automatic facial expression
synthesis of an arbitrary portrait with continuous action unit (AU)
coefficients. Specifically, our model directly manipulates image pixels to make
the unseen subject in the still photo express various emotions controlled by
values of facial AU coefficients, while maintaining her personal
characteristics, such as facial geometry, skin color and hair style, as well as
the original surrounding background. In contrast to prior work, GATH is purely
data-driven and it requires neither a statistical face model nor image
processing tricks to enact facial deformations. Additionally, our model is
trained from unpaired data, where the input image, with its auxiliary identity
label taken from abundance of still photos in the wild, and the target frame
are from different persons. In order to effectively learn such model, we
propose a novel weakly supervised adversarial learning framework that consists
of a generator, a discriminator, a classifier and an action unit estimator. Our
work gives rise to template-and-target-free expression editing, where still
faces can be effortlessly animated with arbitrary AU coefficients provided by
the user.
|
cs.CV
|
this paper presents generative adversarial talking head gath a novel deep generative neural network that enables fully automatic facial expression synthesis of an arbitrary portrait with continuous action unit au coefficients specifically our model directly manipulates image pixels to make the unseen subject in the still photo express various emotions controlled by values of facial au coefficients while maintaining her personal characteristics such as facial geometry skin color and hair style as well as the original surrounding background in contrast to prior work gath is purely datadriven and it requires neither a statistical face model nor image processing tricks to enact facial deformations additionally our model is trained from unpaired data where the input image with its auxiliary identity label taken from abundance of still photos in the wild and the target frame are from different persons in order to effectively learn such model we propose a novel weakly supervised adversarial learning framework that consists of a generator a discriminator a classifier and an action unit estimator our work gives rise to templateandtargetfree expression editing where still faces can be effortlessly animated with arbitrary au coefficients provided by the user
|
[['this', 'paper', 'presents', 'generative', 'adversarial', 'talking', 'head', 'gath', 'a', 'novel', 'deep', 'generative', 'neural', 'network', 'that', 'enables', 'fully', 'automatic', 'facial', 'expression', 'synthesis', 'of', 'an', 'arbitrary', 'portrait', 'with', 'continuous', 'action', 'unit', 'au', 'coefficients', 'specifically', 'our', 'model', 'directly', 'manipulates', 'image', 'pixels', 'to', 'make', 'the', 'unseen', 'subject', 'in', 'the', 'still', 'photo', 'express', 'various', 'emotions', 'controlled', 'by', 'values', 'of', 'facial', 'au', 'coefficients', 'while', 'maintaining', 'her', 'personal', 'characteristics', 'such', 'as', 'facial', 'geometry', 'skin', 'color', 'and', 'hair', 'style', 'as', 'well', 'as', 'the', 'original', 'surrounding', 'background', 'in', 'contrast', 'to', 'prior', 'work', 'gath', 'is', 'purely', 'datadriven', 'and', 'it', 'requires', 'neither', 'a', 'statistical', 'face', 'model', 'nor', 'image', 'processing', 'tricks', 'to', 'enact', 'facial', 'deformations', 'additionally', 'our', 'model', 'is', 'trained', 'from', 'unpaired', 'data', 'where', 'the', 'input', 'image', 'with', 'its', 'auxiliary', 'identity', 'label', 'taken', 'from', 'abundance', 'of', 'still', 'photos', 'in', 'the', 'wild', 'and', 'the', 'target', 'frame', 'are', 'from', 'different', 'persons', 'in', 'order', 'to', 'effectively', 'learn', 'such', 'model', 'we', 'propose', 'a', 'novel', 'weakly', 'supervised', 'adversarial', 'learning', 'framework', 'that', 'consists', 'of', 'a', 'generator', 'a', 'discriminator', 'a', 'classifier', 'and', 'an', 'action', 'unit', 'estimator', 'our', 'work', 'gives', 'rise', 'to', 'templateandtargetfree', 'expression', 'editing', 'where', 'still', 'faces', 'can', 'be', 'effortlessly', 'animated', 'with', 'arbitrary', 'au', 'coefficients', 'provided', 'by', 'the', 'user']]
|
[0.004212050003318345, 0.008209900892081914, -0.057248620235144515, 0.03831945725574711, -0.1388715127075868, -0.22263222120273957, -0.0011874949354130555, 0.4527257785878398, -0.27517119437495974, -0.3512404932376535, 0.033991072003176824, -0.28627134614031424, -0.2154049879353354, 0.11623176338515595, -0.2242903043839702, 0.06956558257074003, 0.09512075374928866, 0.10897257867926623, -0.017173061475411734, -0.24201914559076118, 0.29293929518793116, 0.018032109199115447, 0.2973168279121525, -0.0020350059930155464, 0.16360277488621022, 0.009643986658691204, -0.02537553665541949, -0.03865203961174696, -0.024989186015797474, 0.17797565377687158, 0.3207233856422179, 0.19027742998983294, 0.2663138041286455, -0.4450553340419011, -0.1975281172217851, 0.04912758598671878, 0.1201125221279634, 0.12905114362599018, -0.059085985593980844, -0.3720545380894234, 0.08161587301669095, -0.17964255551553585, 0.0032923463271323215, -0.11708165953100166, -0.013465350466396879, -0.06448276052693463, -0.3280220562940772, 0.03689768005481219, 0.11918456401778037, 0.10707409229169396, -0.0777064621881806, -0.0678410413924027, -0.01969435713801752, 0.21055011783308164, 0.04522806459559715, 0.10075435010258128, 0.18449489365675473, -0.20859935898757118, -0.08146950795830671, 0.3492666450154813, -0.043805695699781856, -0.2502532702376369, 0.17897087518115812, -0.060687509745130326, -0.0987380200581137, 0.1047048346204235, 0.2177858563204779, 0.14154285377228912, -0.20559672237358947, 0.03206432409918205, -0.05756507197925373, 0.21950799603772195, 0.06387791016393086, -0.019845009793871066, 0.22590965086427384, 0.17365806129789677, 0.004609000305072429, 0.16579415794041127, -0.12915821194668664, -0.032431522247326726, -0.2358849156814606, -0.08897030840871885, -0.18025262728532687, 0.014740465825437917, -0.10798611343224448, -0.17683681678675914, 0.41155885063848874, 0.20881018849129585, 0.26236840880993895, 0.0941871221595628, 0.3650808463789483, 0.013944946825852926, 0.1213742929425484, 0.04179747627903633, 0.12483250916522136, 0.008727815094339179, 0.11620019648826736, -0.1429210574376113, 0.12600579482184493, 0.07879038617751974]
|
1,803.07717
|
The Ice Cap Zone: A Unique Habitable Zone for Ocean Worlds
|
Traditional definitions of the habitable zone assume that habitable planets
contain a carbonate-silicate cycle that regulates CO2 between the atmosphere,
surface, and the interior. Such theories have been used to cast doubt on the
habitability of ocean worlds. However, Levi et al (2017) have recently proposed
a mechanism by which CO2 is mobilized between the atmosphere and the interior
of an ocean world. At high enough CO2 pressures, sea ice can become enriched in
CO2 clathrates and sink after a threshold density is achieved. The presence of
subpolar sea ice is of great importance for habitability in ocean worlds. It
may moderate the climate and is fundamental in current theories of life
formation in diluted environments. Here, we model the Levi et al. mechanism and
use latitudinally-dependent non-grey energy balance and single-column
radiative-convective climate models and find that this mechanism may be
sustained on ocean worlds that rotate at least 3 times faster than the Earth.
We calculate the circumstellar region in which this cycle may operate for
G-M-stars (Teff = 2,600 to 5,800 K), extending from about 1.23 to 1.65, 0.69 to
0.954, 0.38 to 0.528 AU, 0.219 to 0.308 AU, 0.146 to 0.206 AU, and 0.0428 to
0.0617 AU for G2, K2, M0, M3, M5, and M8 stars, respectively. However, unless
planets are very young and not tidally locked, our mechanism would be unlikely
to apply to stars cooler than a ~M3. We predict C/O ratios for our atmospheres
(about 0.5) that can be verified by the JWST mission.
|
astro-ph.EP
|
traditional definitions of the habitable zone assume that habitable planets contain a carbonatesilicate cycle that regulates co2 between the atmosphere surface and the interior such theories have been used to cast doubt on the habitability of ocean worlds however levi et al 2017 have recently proposed a mechanism by which co2 is mobilized between the atmosphere and the interior of an ocean world at high enough co2 pressures sea ice can become enriched in co2 clathrates and sink after a threshold density is achieved the presence of subpolar sea ice is of great importance for habitability in ocean worlds it may moderate the climate and is fundamental in current theories of life formation in diluted environments here we model the levi et al mechanism and use latitudinallydependent nongrey energy balance and singlecolumn radiativeconvective climate models and find that this mechanism may be sustained on ocean worlds that rotate at least 3 times faster than the earth we calculate the circumstellar region in which this cycle may operate for gmstars teff 2600 to 5800 k extending from about 123 to 165 069 to 0954 038 to 0528 au 0219 to 0308 au 0146 to 0206 au and 00428 to 00617 au for g2 k2 m0 m3 m5 and m8 stars respectively however unless planets are very young and not tidally locked our mechanism would be unlikely to apply to stars cooler than a m3 we predict co ratios for our atmospheres about 05 that can be verified by the jwst mission
|
[['traditional', 'definitions', 'of', 'the', 'habitable', 'zone', 'assume', 'that', 'habitable', 'planets', 'contain', 'a', 'carbonatesilicate', 'cycle', 'that', 'regulates', 'co2', 'between', 'the', 'atmosphere', 'surface', 'and', 'the', 'interior', 'such', 'theories', 'have', 'been', 'used', 'to', 'cast', 'doubt', 'on', 'the', 'habitability', 'of', 'ocean', 'worlds', 'however', 'levi', 'et', 'al', '2017', 'have', 'recently', 'proposed', 'a', 'mechanism', 'by', 'which', 'co2', 'is', 'mobilized', 'between', 'the', 'atmosphere', 'and', 'the', 'interior', 'of', 'an', 'ocean', 'world', 'at', 'high', 'enough', 'co2', 'pressures', 'sea', 'ice', 'can', 'become', 'enriched', 'in', 'co2', 'clathrates', 'and', 'sink', 'after', 'a', 'threshold', 'density', 'is', 'achieved', 'the', 'presence', 'of', 'subpolar', 'sea', 'ice', 'is', 'of', 'great', 'importance', 'for', 'habitability', 'in', 'ocean', 'worlds', 'it', 'may', 'moderate', 'the', 'climate', 'and', 'is', 'fundamental', 'in', 'current', 'theories', 'of', 'life', 'formation', 'in', 'diluted', 'environments', 'here', 'we', 'model', 'the', 'levi', 'et', 'al', 'mechanism', 'and', 'use', 'latitudinallydependent', 'nongrey', 'energy', 'balance', 'and', 'singlecolumn', 'radiativeconvective', 'climate', 'models', 'and', 'find', 'that', 'this', 'mechanism', 'may', 'be', 'sustained', 'on', 'ocean', 'worlds', 'that', 'rotate', 'at', 'least', '3', 'times', 'faster', 'than', 'the', 'earth', 'we', 'calculate', 'the', 'circumstellar', 'region', 'in', 'which', 'this', 'cycle', 'may', 'operate', 'for', 'gmstars', 'teff', '2600', 'to', '5800', 'k', 'extending', 'from', 'about', '123', 'to', '165', '069', 'to', '0954', '038', 'to', '0528', 'au', '0219', 'to', '0308', 'au', '0146', 'to', '0206', 'au', 'and', '00428', 'to', '00617', 'au', 'for', 'g2', 'k2', 'm0', 'm3', 'm5', 'and', 'm8', 'stars', 'respectively', 'however', 'unless', 'planets', 'are', 'very', 'young', 'and', 'not', 'tidally', 'locked', 'our', 'mechanism', 'would', 'be', 'unlikely', 'to', 'apply', 'to', 'stars', 'cooler', 'than', 'a', 'm3', 'we', 'predict', 'co', 'ratios', 'for', 'our', 'atmospheres', 'about', '05', 'that', 'can', 'be', 'verified', 'by', 'the', 'jwst', 'mission']]
|
[-0.06604508308284893, 0.18613263829740198, -0.032556891627799026, 0.07720579668440349, -0.07662059174759722, -0.061099793652178554, 0.09835817034515303, 0.345793947312466, -0.16878458858861367, -0.37609209991400927, 0.10799746687582702, -0.28205340450659877, -0.0945169639156571, 0.17633542475930408, -0.10164494418107992, -0.03786364167349458, 0.07991973455139716, -0.04852437836542059, -0.005368746422435634, -0.2722025607614134, 0.21893803413902463, 0.10239493075428849, 0.12006493410799743, 0.0633421932873354, 0.03012180394669086, -0.13203045203467847, 0.047782277457919575, -0.06847860693658997, -0.1684691707802214, 0.04903484805112296, 0.27639767599199644, 0.1200338611871428, 0.20652238011163304, -0.44329819279700156, -0.27997575746375947, 0.07334802948374763, 0.12489456165050383, 0.023932642955522287, 0.013957094746581241, -0.228500410024743, 0.11401233175860309, -0.20333002861664912, -0.1569666233371822, 0.0005043742031131576, 0.09464195050200735, -0.07740594875313554, -0.2788056704917037, 0.07122183240461731, 0.07153702039286737, 0.11844033912596542, -0.1291308288152019, -0.2035609976794548, -0.13241165794897825, 0.06682871486288892, 0.005687901911579405, 0.06327588966010304, 0.18353203781577568, -0.061867810807539135, -0.004625172795334119, 0.4052235510510703, -0.12949801735616406, -0.047326657799928167, 0.2760170384895102, -0.20354194751050042, -0.10017901087724944, 0.15717913766630084, 0.16713799299079285, 0.13855005360901265, -0.13622522678195945, 0.016512651810407397, -0.02375542721379836, 0.18193854789847766, 0.1271211539804027, -0.023263336123323174, 0.36197036151902945, 0.17308928934067896, 0.08635167629321719, 0.019310135623852805, -0.18134723059318172, -0.07772615375479956, -0.14509952510517787, -0.15479020525680523, -0.11031471424626292, 0.043118359185568327, -0.05983936840541021, -0.10519678137886028, 0.30079521051308944, 0.1800431354852522, 0.140492587841998, -0.00619801470718339, 0.26078397896172995, 0.04537031292722265, 0.08769176921966236, 0.15067519215494016, 0.3043202693806961, 0.12699343486143866, 0.10530841816027414, -0.20992493246610056, 0.09790407690386159, 0.0005426716648148206]
|
1,803.07718
|
InfyNLP at SMM4H Task 2: Stacked Ensemble of Shallow Convolutional
Neural Networks for Identifying Personal Medication Intake from Twitter
|
This paper describes Infosys's participation in the "2nd Social Media Mining
for Health Applications Shared Task at AMIA, 2017, Task 2". Mining social media
messages for health and drug related information has received significant
interest in pharmacovigilance research. This task targets at developing
automated classification models for identifying tweets containing descriptions
of personal intake of medicines. Towards this objective we train a stacked
ensemble of shallow convolutional neural network (CNN) models on an annotated
dataset provided by the organizers. We use random search for tuning the
hyper-parameters of the CNN and submit an ensemble of best models for the
prediction task. Our system secured first place among 9 teams, with a
micro-averaged F-score of 0.693.
|
cs.CL
|
this paper describes infosyss participation in the 2nd social media mining for health applications shared task at amia 2017 task 2 mining social media messages for health and drug related information has received significant interest in pharmacovigilance research this task targets at developing automated classification models for identifying tweets containing descriptions of personal intake of medicines towards this objective we train a stacked ensemble of shallow convolutional neural network cnn models on an annotated dataset provided by the organizers we use random search for tuning the hyperparameters of the cnn and submit an ensemble of best models for the prediction task our system secured first place among 9 teams with a microaveraged fscore of 0693
|
[['this', 'paper', 'describes', 'infosyss', 'participation', 'in', 'the', '2nd', 'social', 'media', 'mining', 'for', 'health', 'applications', 'shared', 'task', 'at', 'amia', '2017', 'task', '2', 'mining', 'social', 'media', 'messages', 'for', 'health', 'and', 'drug', 'related', 'information', 'has', 'received', 'significant', 'interest', 'in', 'pharmacovigilance', 'research', 'this', 'task', 'targets', 'at', 'developing', 'automated', 'classification', 'models', 'for', 'identifying', 'tweets', 'containing', 'descriptions', 'of', 'personal', 'intake', 'of', 'medicines', 'towards', 'this', 'objective', 'we', 'train', 'a', 'stacked', 'ensemble', 'of', 'shallow', 'convolutional', 'neural', 'network', 'cnn', 'models', 'on', 'an', 'annotated', 'dataset', 'provided', 'by', 'the', 'organizers', 'we', 'use', 'random', 'search', 'for', 'tuning', 'the', 'hyperparameters', 'of', 'the', 'cnn', 'and', 'submit', 'an', 'ensemble', 'of', 'best', 'models', 'for', 'the', 'prediction', 'task', 'our', 'system', 'secured', 'first', 'place', 'among', '9', 'teams', 'with', 'a', 'microaveraged', 'fscore', 'of', '0693']]
|
[-0.06100595963040465, -0.013444091031775124, 0.00365378410073422, 0.05628931505724036, -0.126624009296249, -0.18498032344831972, 0.08638330391432535, 0.43643131107091904, -0.2007654316298533, -0.370713844519566, 0.057326005810050686, -0.35003251379780603, -0.18037439918701062, 0.18055316242757008, -0.12323281236688656, 0.058757847524248064, 0.13999116876195267, 0.08656159034938339, 0.04285264802328719, -0.36506524128153134, 0.27532845439405684, 0.04588959823574936, 0.3714290625954929, 0.03702654160518075, 0.11105192651902734, 0.02645856561139226, -0.09903111695230268, -0.07721153256920445, -0.05712222265643313, 0.22187901983290845, 0.399442239995583, 0.22054793477760987, 0.41212693089210806, -0.36111918539462384, -0.200246302868452, 0.10264943277855453, 0.11586008639189235, 0.10054931709907435, -0.028388705000173087, -0.37495216114544555, 0.04481898824145135, -0.20408559257058395, 0.021128277478151415, -0.11625821925005303, 0.04047666574223784, -0.03278619457003579, -0.26845148149387615, 0.044887126856401824, 0.027780982255200416, 0.17753027210404215, -0.07585488620884064, -0.13244546633193335, 0.028800717336452453, 0.23809469820882537, 0.042641868342016415, 0.04673449495672494, 0.15228063136894712, -0.2431063780115852, -0.16729419414166427, 0.3582084003280391, -0.01717063202522695, -0.1322310593881922, 0.13808541929986523, 0.035045667588220614, -0.2305104577497236, 0.06466707993266091, 0.3215007371792014, 0.07782289909460303, -0.22159182312571557, -0.06737896579158444, -0.04983957793988418, 0.2284053733588703, 0.07872127952348244, -0.06882513381220122, 0.2087392955936753, 0.30899974716043, 0.013650389841610664, 0.10047141363713563, -0.07775081026678284, -0.023967639081539552, -0.17365231755058885, -0.12179714692102973, -0.18751783070579303, 0.0020391039893423255, -0.0899029980827707, -0.12622576549224424, 0.40976945973377216, 0.2127303025162403, 0.11939184788794241, 0.07702240764506553, 0.27855364675837846, -0.04103510115569327, 0.0931779525497149, 0.10705925130260814, 0.1521807525208906, -0.03322367592951642, 0.2352095449612917, -0.12282533119146696, 0.1248507666679328, 0.046789276266568584]
|
1,803.07719
|
A conservative energy-momentum tensor in the $f(R,T)$ gravity and its
implications for the phenomenology of neutron stars
|
The solutions for the Tolmann-Oppenheimer-Volkoff (TOV) equation bring
valuable informations about the macroscopical features of compact astrophysical
objects as neutron stars. They are sensitive to both the equation of state
considered for nuclear matter and the background gravitational theory. In this
work we construct the TOV equation for a conservative version of the $f(R,T)$
gravity. While the non-vanishing of the covariant derivative of the $f(R,T)$
energy-momentum tensor yields, in a cosmological perspective, the prediction of
creation of matter throughout the universe evolution as shown by T. Harko, in
the analysis of the hydrostatic equilibrium of compact astrophysical objects,
this property still lacks a convincing physical explanation. The imposition of
$\nabla^{\mu}T_{\mu\nu}=0$ demands a particular form for the function $h(T)$ in
$f(R,T)=R+h(T)$, which is here derived. Therefore, the choice of a specific
equation of state for the star matter demands a unique form of $h(T)$,
manifesting a strong connection between conserved $f(R,T)$ gravity and the star
matter constitution. We construct and solve the TOV equation for the general
equation of state for $p=k\rho^{\Gamma}$, with $k$ being the EoS parameter,
$\rho$ {\it the energy density} and $\Gamma$ is the adiabatic index. We also
derive the macroscopical properties of neutron stars ($\Gamma=5/3$) within this
approach.
|
gr-qc
|
the solutions for the tolmannoppenheimervolkoff tov equation bring valuable informations about the macroscopical features of compact astrophysical objects as neutron stars they are sensitive to both the equation of state considered for nuclear matter and the background gravitational theory in this work we construct the tov equation for a conservative version of the frt gravity while the nonvanishing of the covariant derivative of the frt energymomentum tensor yields in a cosmological perspective the prediction of creation of matter throughout the universe evolution as shown by t harko in the analysis of the hydrostatic equilibrium of compact astrophysical objects this property still lacks a convincing physical explanation the imposition of nablamut_munu0 demands a particular form for the function ht in frtrht which is here derived therefore the choice of a specific equation of state for the star matter demands a unique form of ht manifesting a strong connection between conserved frt gravity and the star matter constitution we construct and solve the tov equation for the general equation of state for pkrhogamma with k being the eos parameter rho it the energy density and gamma is the adiabatic index we also derive the macroscopical properties of neutron stars gamma53 within this approach
|
[['the', 'solutions', 'for', 'the', 'tolmannoppenheimervolkoff', 'tov', 'equation', 'bring', 'valuable', 'informations', 'about', 'the', 'macroscopical', 'features', 'of', 'compact', 'astrophysical', 'objects', 'as', 'neutron', 'stars', 'they', 'are', 'sensitive', 'to', 'both', 'the', 'equation', 'of', 'state', 'considered', 'for', 'nuclear', 'matter', 'and', 'the', 'background', 'gravitational', 'theory', 'in', 'this', 'work', 'we', 'construct', 'the', 'tov', 'equation', 'for', 'a', 'conservative', 'version', 'of', 'the', 'frt', 'gravity', 'while', 'the', 'nonvanishing', 'of', 'the', 'covariant', 'derivative', 'of', 'the', 'frt', 'energymomentum', 'tensor', 'yields', 'in', 'a', 'cosmological', 'perspective', 'the', 'prediction', 'of', 'creation', 'of', 'matter', 'throughout', 'the', 'universe', 'evolution', 'as', 'shown', 'by', 't', 'harko', 'in', 'the', 'analysis', 'of', 'the', 'hydrostatic', 'equilibrium', 'of', 'compact', 'astrophysical', 'objects', 'this', 'property', 'still', 'lacks', 'a', 'convincing', 'physical', 'explanation', 'the', 'imposition', 'of', 'nablamut_munu0', 'demands', 'a', 'particular', 'form', 'for', 'the', 'function', 'ht', 'in', 'frtrht', 'which', 'is', 'here', 'derived', 'therefore', 'the', 'choice', 'of', 'a', 'specific', 'equation', 'of', 'state', 'for', 'the', 'star', 'matter', 'demands', 'a', 'unique', 'form', 'of', 'ht', 'manifesting', 'a', 'strong', 'connection', 'between', 'conserved', 'frt', 'gravity', 'and', 'the', 'star', 'matter', 'constitution', 'we', 'construct', 'and', 'solve', 'the', 'tov', 'equation', 'for', 'the', 'general', 'equation', 'of', 'state', 'for', 'pkrhogamma', 'with', 'k', 'being', 'the', 'eos', 'parameter', 'rho', 'it', 'the', 'energy', 'density', 'and', 'gamma', 'is', 'the', 'adiabatic', 'index', 'we', 'also', 'derive', 'the', 'macroscopical', 'properties', 'of', 'neutron', 'stars', 'gamma53', 'within', 'this', 'approach']]
|
[-0.13125424687083737, 0.11294020671425528, -0.1566720026686797, 0.11387874917466492, -0.1278353498630862, -0.08522648979493197, 0.013200075455108217, 0.25172675013467294, -0.21623796841536821, -0.309843350496686, 0.05270779275700412, -0.2517931405454874, -0.06138366169820367, 0.15676751339822145, 0.016829121512730593, 0.028429357716392482, 0.013874612546212335, 0.09223768920941867, -0.09826457588266506, -0.18599728969435894, 0.37669081391354825, 0.04780281260703227, 0.21341010285354214, 0.01868052924070601, 0.1208190934652996, -0.05979267851362969, -0.028037092012257302, 0.006535293134256973, -0.19343936606661308, 0.052028003914209184, 0.21383889342995183, 0.13442646463790056, 0.20443368290817768, -0.39538464105533594, -0.2656645346058523, 0.08815327682181369, 0.08216367948837766, 0.10612816658940391, -0.08174712375162085, -0.277501441566414, 0.05847578533882996, -0.20612336855484686, -0.17698243649526682, -0.0715247978299538, 0.07029167150882021, 0.006056848861658524, -0.2451025071968067, 0.13837112504950883, 0.047843438660931874, -0.05130976199490678, -0.14397387043689963, -0.09861853063263318, -0.026684161853314327, 0.03347227093178648, 0.060200532774286504, 0.03922067802099876, 0.11413467537621083, -0.20527758515187206, -0.004702164265607957, 0.4334839448033266, -0.09253659949230789, -0.19485756156301529, 0.12492425207296695, -0.14420605693059277, -0.18169754796928198, 0.06414647975716388, 0.10365268690792385, 0.16213904137269186, -0.18815949586589806, 0.11351702733306991, -0.012626379971970435, 0.13620634994354922, 0.0681787717083572, 0.04539175322144784, 0.273419330898092, 0.15193889744406633, 0.028499842583945948, 0.09489384624433128, -0.055400149402999546, -0.11213375951851433, -0.3471383450543461, -0.18511745216905248, -0.14612371631635906, 0.08295573067240623, -0.13985106216283777, -0.1795752648614878, 0.35362538556339, 0.0983982656664249, 0.10720713665251429, 0.023541555085322404, 0.25599439572262106, 0.13373754132040613, -0.0006554215785523119, 0.10714942769114695, 0.2751082792110629, 0.21948938572957138, 0.1382804348340595, -0.25848307872738635, 0.0454962438524668, 0.05442390460450783]
|
1,803.0772
|
Asymptotic Optimal Portfolio in Fast Mean-reverting Stochastic
Environments
|
This paper studies the portfolio optimization problem when the investor's
utility is general and the return and volatility of the risky asset are fast
mean-reverting, which are important to capture the fast-time scale in the
modeling of stock price volatility. Motivated by the heuristic derivation in
[J.-P. Fouque, R. Sircar and T. Zariphopoulou, \emph{Mathematical Finance},
2016], we propose a zeroth order strategy, and show its asymptotic optimality
within a specific (smaller) family of admissible strategies under proper
assumptions. This optimality result is achieved by establishing a first order
approximation of the problem value associated to this proposed strategy using
singular perturbation method, and estimating the risk-tolerance functions. The
results are natural extensions of our previous work on portfolio optimization
in a slowly varying stochastic environment [J.-P. Fouque and R. Hu, \emph{SIAM
Journal on Control and Optimization}, 2017], and together they form a whole
picture of analyzing portfolio optimization in both fast and slow environments.
|
q-fin.MF q-fin.PM
|
this paper studies the portfolio optimization problem when the investors utility is general and the return and volatility of the risky asset are fast meanreverting which are important to capture the fasttime scale in the modeling of stock price volatility motivated by the heuristic derivation in jp fouque r sircar and t zariphopoulou emphmathematical finance 2016 we propose a zeroth order strategy and show its asymptotic optimality within a specific smaller family of admissible strategies under proper assumptions this optimality result is achieved by establishing a first order approximation of the problem value associated to this proposed strategy using singular perturbation method and estimating the risktolerance functions the results are natural extensions of our previous work on portfolio optimization in a slowly varying stochastic environment jp fouque and r hu emphsiam journal on control and optimization 2017 and together they form a whole picture of analyzing portfolio optimization in both fast and slow environments
|
[['this', 'paper', 'studies', 'the', 'portfolio', 'optimization', 'problem', 'when', 'the', 'investors', 'utility', 'is', 'general', 'and', 'the', 'return', 'and', 'volatility', 'of', 'the', 'risky', 'asset', 'are', 'fast', 'meanreverting', 'which', 'are', 'important', 'to', 'capture', 'the', 'fasttime', 'scale', 'in', 'the', 'modeling', 'of', 'stock', 'price', 'volatility', 'motivated', 'by', 'the', 'heuristic', 'derivation', 'in', 'jp', 'fouque', 'r', 'sircar', 'and', 't', 'zariphopoulou', 'emphmathematical', 'finance', '2016', 'we', 'propose', 'a', 'zeroth', 'order', 'strategy', 'and', 'show', 'its', 'asymptotic', 'optimality', 'within', 'a', 'specific', 'smaller', 'family', 'of', 'admissible', 'strategies', 'under', 'proper', 'assumptions', 'this', 'optimality', 'result', 'is', 'achieved', 'by', 'establishing', 'a', 'first', 'order', 'approximation', 'of', 'the', 'problem', 'value', 'associated', 'to', 'this', 'proposed', 'strategy', 'using', 'singular', 'perturbation', 'method', 'and', 'estimating', 'the', 'risktolerance', 'functions', 'the', 'results', 'are', 'natural', 'extensions', 'of', 'our', 'previous', 'work', 'on', 'portfolio', 'optimization', 'in', 'a', 'slowly', 'varying', 'stochastic', 'environment', 'jp', 'fouque', 'and', 'r', 'hu', 'emphsiam', 'journal', 'on', 'control', 'and', 'optimization', '2017', 'and', 'together', 'they', 'form', 'a', 'whole', 'picture', 'of', 'analyzing', 'portfolio', 'optimization', 'in', 'both', 'fast', 'and', 'slow', 'environments']]
|
[-0.08579717066711168, 0.010326524896644592, -0.09052829479865633, 0.10683848814326613, -0.09106174937991146, -0.14248761244489525, 0.10018965131998842, 0.3764953409485957, -0.27858825510647756, -0.2910358608134237, 0.1615028033897378, -0.22991397273818068, -0.16346720886702826, 0.1567934478657454, -0.1507338731004887, 0.07254688778520847, 0.03289040621351816, -0.053089699774883155, 0.013901075228799159, -0.28553703585578727, 0.2657015435854156, 0.055018801601250576, 0.2550877338241834, 0.008231345162760417, 0.11279045344251239, 0.017837261467612064, -0.05253561580967572, 0.012684317506557586, -0.15696170807091725, 0.15180338231779733, 0.2729481369594806, 0.12346463921948586, 0.39004476241816105, -0.3778215835123548, -0.160120627668601, 0.09369601770547627, 0.0551542576272695, 0.04813469155368949, 0.010621324997224839, -0.2830572175592476, 0.0548763340612983, -0.19745964111206335, -0.09231526282877704, -0.0958741106263368, 0.04331699704440931, 0.03484683895325349, -0.34090846213299075, 0.09012897896391699, 0.07507843080469791, 0.0342152131941273, -0.06787617130393735, -0.14902739745969548, 0.02095697110281417, 0.04801118103243271, 0.11589545581270666, 0.006779376219568494, 0.13049706828238722, -0.1053848763626507, -0.15640927529498155, 0.34687065973145936, -0.06461256113530325, -0.18238826635981503, 0.11582270561674841, -0.11114614504371204, -0.13820972321920244, 0.09211323661973177, 0.20194790079532302, 0.13813165428871715, -0.17830034626582775, 0.1323798727788171, -0.05594369357457884, 0.11145732381298919, 0.0755182696381596, -0.031851745443038176, 0.11491906754307303, 0.1729953966493067, 0.12149129853906487, 0.09083791418774115, -0.008237796619890587, -0.1821785242345452, -0.2796281434206012, -0.11602591445442788, -0.1557379358667223, 0.040010258273885047, -0.13542008954866902, -0.12337798578360307, 0.4021389405136575, 0.1411893543121717, 0.13552330223709538, 0.10344254415637504, 0.26405301144547466, 0.1477768762300424, -0.04978461600413996, 0.11887407875345911, 0.16111529755156512, 0.07018577980997613, 0.144757813710135, -0.19758224670145222, 0.13044263341226706, 0.07474688655739418]
|
1,803.07721
|
Modeling Camera Effects to Improve Visual Learning from Synthetic Data
|
Recent work has focused on generating synthetic imagery to increase the size
and variability of training data for learning visual tasks in urban scenes.
This includes increasing the occurrence of occlusions or varying environmental
and weather effects. However, few have addressed modeling variation in the
sensor domain. Sensor effects can degrade real images, limiting
generalizability of network performance on visual tasks trained on synthetic
data and tested in real environments. This paper proposes an efficient,
automatic, physically-based augmentation pipeline to vary sensor effects
--chromatic aberration, blur, exposure, noise, and color cast-- for synthetic
imagery. In particular, this paper illustrates that augmenting synthetic
training datasets with the proposed pipeline reduces the domain gap between
synthetic and real domains for the task of object detection in urban driving
scenes.
|
cs.CV
|
recent work has focused on generating synthetic imagery to increase the size and variability of training data for learning visual tasks in urban scenes this includes increasing the occurrence of occlusions or varying environmental and weather effects however few have addressed modeling variation in the sensor domain sensor effects can degrade real images limiting generalizability of network performance on visual tasks trained on synthetic data and tested in real environments this paper proposes an efficient automatic physicallybased augmentation pipeline to vary sensor effects chromatic aberration blur exposure noise and color cast for synthetic imagery in particular this paper illustrates that augmenting synthetic training datasets with the proposed pipeline reduces the domain gap between synthetic and real domains for the task of object detection in urban driving scenes
|
[['recent', 'work', 'has', 'focused', 'on', 'generating', 'synthetic', 'imagery', 'to', 'increase', 'the', 'size', 'and', 'variability', 'of', 'training', 'data', 'for', 'learning', 'visual', 'tasks', 'in', 'urban', 'scenes', 'this', 'includes', 'increasing', 'the', 'occurrence', 'of', 'occlusions', 'or', 'varying', 'environmental', 'and', 'weather', 'effects', 'however', 'few', 'have', 'addressed', 'modeling', 'variation', 'in', 'the', 'sensor', 'domain', 'sensor', 'effects', 'can', 'degrade', 'real', 'images', 'limiting', 'generalizability', 'of', 'network', 'performance', 'on', 'visual', 'tasks', 'trained', 'on', 'synthetic', 'data', 'and', 'tested', 'in', 'real', 'environments', 'this', 'paper', 'proposes', 'an', 'efficient', 'automatic', 'physicallybased', 'augmentation', 'pipeline', 'to', 'vary', 'sensor', 'effects', 'chromatic', 'aberration', 'blur', 'exposure', 'noise', 'and', 'color', 'cast', 'for', 'synthetic', 'imagery', 'in', 'particular', 'this', 'paper', 'illustrates', 'that', 'augmenting', 'synthetic', 'training', 'datasets', 'with', 'the', 'proposed', 'pipeline', 'reduces', 'the', 'domain', 'gap', 'between', 'synthetic', 'and', 'real', 'domains', 'for', 'the', 'task', 'of', 'object', 'detection', 'in', 'urban', 'driving', 'scenes']]
|
[-0.07385897650346747, 0.016747748638859833, -0.025953192029177674, 0.04424998229626185, -0.1221215789899318, -0.12538236299691002, 0.009441874770990273, 0.49850840397237794, -0.21031156728616146, -0.4147451687897519, 0.09045764294867294, -0.25639989963314663, -0.2055407960616844, 0.2259003264796517, -0.26755204635092944, 0.08837114986010247, 0.1906671850927409, -0.04115301006891596, -0.014772612645518123, -0.295068596592393, 0.30440050620754344, 0.0214144678669065, 0.36461786395598816, 0.03492150522812497, 0.13927109706019397, -0.015759334028661837, -0.10499863116268626, 0.0015756211850396174, -0.0006963432069036443, 0.12924295315504308, 0.3175330567723653, 0.19939571246504784, 0.2680530024061757, -0.426292314524139, -0.30632601946035004, 0.12096696695327525, 0.13487089569057067, 0.050872747541710506, -0.08018079519777845, -0.3975038078639246, 0.02494649202966197, -0.1265282088535009, 0.012318268146981873, -0.11117351501740104, 0.05491105015811283, -0.020228653487118737, -0.2997469768903446, 0.05565518585921038, 0.024199770415187116, 0.19746242980399412, -0.08712704452378016, -0.08614386777268855, 0.015536689823750026, 0.22891893618608142, 0.03339522160721693, 0.011089952215259, 0.1957499028337518, -0.2120471528170293, -0.11159864769089879, 0.38555335183811235, -0.04464368208304165, -0.20361615638578617, 0.20166209989088021, -0.0616744297884742, -0.14604638046841686, 0.10311815399295232, 0.3052020896644163, 0.10443032488930883, -0.13925955862202866, 0.028508073406011657, 1.1116163585129685e-05, 0.1829101349095132, 0.08243319222806242, -0.030698469458661212, 0.15426423624121238, 0.2909287432864983, 0.04067038422941751, 0.17998777903748428, -0.23119093364518958, -0.015528085389482518, -0.17925110498285582, -0.03864198252852038, -0.22441914898350718, -0.04738079999962191, -0.13942275093224424, -0.15056593239850063, 0.388086616567622, 0.3172218336459748, 0.18897768077587224, 0.06554499162566357, 0.42048013067298284, -0.014102892818178718, 0.098348258796522, -0.00017907410194569333, 0.1498627134518126, -0.03762530501176581, 0.18637618392075259, -0.21707493178986423, 0.07775779068779373, -0.057019397455054945]
|
1,803.07722
|
A Robust Fault-Tolerant and Scalable Cluster-wide Deduplication for
Shared-Nothing Storage Systems
|
Deduplication has been largely employed in distributed storage systems to
improve space efficiency. Traditional deduplication research ignores the design
specifications of shared-nothing distributed storage systems such as no central
metadata bottleneck, scalability, and storage rebalancing. Further,
deduplication introduces transactional changes, which are prone to errors in
the event of a system failure, resulting in inconsistencies in data and
deduplication metadata. In this paper, we propose a robust, fault-tolerant and
scalable cluster-wide deduplication that can eliminate duplicate copies across
the cluster. We design a distributed deduplication metadata shard which
guarantees performance scalability while preserving the design constraints of
shared- nothing storage systems. The placement of chunks and deduplication
metadata is made cluster-wide based on the content fingerprint of chunks. To
ensure transactional consistency and garbage identification, we employ a
flag-based asynchronous consistency mechanism. We implement the proposed
deduplication on Ceph. The evaluation shows high disk-space savings with
minimal performance degradation as well as high robustness in the event of
sudden server failure.
|
cs.DC
|
deduplication has been largely employed in distributed storage systems to improve space efficiency traditional deduplication research ignores the design specifications of sharednothing distributed storage systems such as no central metadata bottleneck scalability and storage rebalancing further deduplication introduces transactional changes which are prone to errors in the event of a system failure resulting in inconsistencies in data and deduplication metadata in this paper we propose a robust faulttolerant and scalable clusterwide deduplication that can eliminate duplicate copies across the cluster we design a distributed deduplication metadata shard which guarantees performance scalability while preserving the design constraints of shared nothing storage systems the placement of chunks and deduplication metadata is made clusterwide based on the content fingerprint of chunks to ensure transactional consistency and garbage identification we employ a flagbased asynchronous consistency mechanism we implement the proposed deduplication on ceph the evaluation shows high diskspace savings with minimal performance degradation as well as high robustness in the event of sudden server failure
|
[['deduplication', 'has', 'been', 'largely', 'employed', 'in', 'distributed', 'storage', 'systems', 'to', 'improve', 'space', 'efficiency', 'traditional', 'deduplication', 'research', 'ignores', 'the', 'design', 'specifications', 'of', 'sharednothing', 'distributed', 'storage', 'systems', 'such', 'as', 'no', 'central', 'metadata', 'bottleneck', 'scalability', 'and', 'storage', 'rebalancing', 'further', 'deduplication', 'introduces', 'transactional', 'changes', 'which', 'are', 'prone', 'to', 'errors', 'in', 'the', 'event', 'of', 'a', 'system', 'failure', 'resulting', 'in', 'inconsistencies', 'in', 'data', 'and', 'deduplication', 'metadata', 'in', 'this', 'paper', 'we', 'propose', 'a', 'robust', 'faulttolerant', 'and', 'scalable', 'clusterwide', 'deduplication', 'that', 'can', 'eliminate', 'duplicate', 'copies', 'across', 'the', 'cluster', 'we', 'design', 'a', 'distributed', 'deduplication', 'metadata', 'shard', 'which', 'guarantees', 'performance', 'scalability', 'while', 'preserving', 'the', 'design', 'constraints', 'of', 'shared', 'nothing', 'storage', 'systems', 'the', 'placement', 'of', 'chunks', 'and', 'deduplication', 'metadata', 'is', 'made', 'clusterwide', 'based', 'on', 'the', 'content', 'fingerprint', 'of', 'chunks', 'to', 'ensure', 'transactional', 'consistency', 'and', 'garbage', 'identification', 'we', 'employ', 'a', 'flagbased', 'asynchronous', 'consistency', 'mechanism', 'we', 'implement', 'the', 'proposed', 'deduplication', 'on', 'ceph', 'the', 'evaluation', 'shows', 'high', 'diskspace', 'savings', 'with', 'minimal', 'performance', 'degradation', 'as', 'well', 'as', 'high', 'robustness', 'in', 'the', 'event', 'of', 'sudden', 'server', 'failure']]
|
[-0.21607684731518603, -0.004337004223346429, -0.02891243659779898, 0.03134460071300935, -0.1013956309761852, -0.17359409873145368, 0.1451447878242324, 0.3794923643464422, -0.2934033722095426, -0.35964122903093976, 0.13847822102179178, -0.27097135817971807, -0.0744554708413809, 0.12465121020393083, -0.22984527691952744, 0.1446378619451099, 0.1179516214698717, -0.010224305189935104, -0.046953368186657816, -0.29084365304454035, 0.20731342643273865, 0.1255621804924222, 0.4333504954903568, 0.042863545623028056, 0.06799729611305813, 0.004589532525425062, -0.059198867854714954, -0.030512514506772736, -0.010863619235883476, 0.13232501569236432, 0.3196354263093112, 0.2625896299840683, 0.29463984418964984, -0.45490894760678774, -0.16515009827419835, 0.06925418407732398, 0.18521829195754053, 0.08967360474407943, -0.09483863279200012, -0.2508797868969118, 0.12734667348833578, -0.2561571256366687, -0.006356781366158207, -0.12875873964197887, -0.038127531774880936, 0.02984793134489091, -0.2637886210702032, 0.026406666621237807, 0.05439423438258258, 0.05658051626223766, -0.014958022975669618, -0.02450741072106263, 0.018182843371511163, 0.1262289840733902, -0.014917243604472129, -0.00803346550326396, 0.17946185592749397, -0.07483884102354448, -0.18001336993579314, 0.41302980166280046, 0.013702347361388962, -0.17223930123566691, 0.19961850904074716, 0.03741756482518413, -0.2110470769774614, 0.10525708699470046, 0.19565825719011468, 0.02302211745929137, -0.19331096349951793, 0.03139323215900903, 0.04631766143332546, 0.21781300110215285, 0.08140426465316014, 0.1511799889380909, 0.16037184250418027, 0.22854164676629476, 0.0859921687581348, 0.18195776129434318, -0.06796477875326695, -0.10220515608652816, -0.2190801388343925, -0.17197291615108648, -0.16055159029878863, -0.05689896419702929, -0.09410038311574417, -0.2063171343245315, 0.3280481709864389, 0.25493624581773794, 0.164100319858781, 0.058119937207706494, 0.43643454179378616, -0.010863284421528238, 0.1670321594124203, 0.17545511413353887, 0.11041785665617893, -0.02064383789858892, 0.1835209368186294, -0.23376978304436277, 0.14233584512235983, -0.025410349716017983]
|
1,803.07723
|
Poisson sigma model and semiclassical quantization of integrable systems
|
In this paper we outline the construction of semiclassical eigenfunctions of
integrable models in terms of the semiclassical path integral for the Poisson
sigma model with the target space being the phase space of the integrable
system. The semiclassical path integral is defined as a formal power series
with coefficients being Feynman diagrams. We also argue that in a similar way
one can obtain irreducible semiclassical representations of Kontsevich's star
product.
|
math-ph hep-th math.MP math.SG
|
in this paper we outline the construction of semiclassical eigenfunctions of integrable models in terms of the semiclassical path integral for the poisson sigma model with the target space being the phase space of the integrable system the semiclassical path integral is defined as a formal power series with coefficients being feynman diagrams we also argue that in a similar way one can obtain irreducible semiclassical representations of kontsevichs star product
|
[['in', 'this', 'paper', 'we', 'outline', 'the', 'construction', 'of', 'semiclassical', 'eigenfunctions', 'of', 'integrable', 'models', 'in', 'terms', 'of', 'the', 'semiclassical', 'path', 'integral', 'for', 'the', 'poisson', 'sigma', 'model', 'with', 'the', 'target', 'space', 'being', 'the', 'phase', 'space', 'of', 'the', 'integrable', 'system', 'the', 'semiclassical', 'path', 'integral', 'is', 'defined', 'as', 'a', 'formal', 'power', 'series', 'with', 'coefficients', 'being', 'feynman', 'diagrams', 'we', 'also', 'argue', 'that', 'in', 'a', 'similar', 'way', 'one', 'can', 'obtain', 'irreducible', 'semiclassical', 'representations', 'of', 'kontsevichs', 'star', 'product']]
|
[-0.14317998523548456, 0.10310313274795321, -0.1339650519559501, 0.0847611991085217, -0.11316497120219217, -0.06537210497296822, -0.02255327140249994, 0.3488758130812309, -0.28843161264355754, -0.19794704959216253, 0.057161170833507996, -0.2598240992290453, -0.1857176441994404, 0.1842775025149204, -0.0950734952307293, 0.034021928007911206, 0.09670457152098837, 0.1087123892683221, -0.1366728556007934, -0.23653482762493297, 0.3767835320117818, 0.015426110922240876, 0.2033834819170371, -0.028104951100187823, 0.1311300830968039, 0.027532530400875797, -0.026041159604702303, -0.043170468515263946, -0.15143168690455766, 0.14901148860382152, 0.2837409607984202, 0.05309967958355244, 0.1768715335416909, -0.38900236730319515, -0.2025472078383015, 0.1000813324083115, 0.20436788751730617, 0.07132021012440534, 0.047868388101563485, -0.2722579924206079, 0.011257102831043827, -0.21023992026670718, -0.18796934388105718, -0.08866403149572057, 0.010168975009255007, 0.00882088004703253, -0.2165309592530551, 0.044725929457008914, 0.06315398675350237, 0.030239728335159977, -0.08120097820712648, -0.07901405012333425, -0.00680107860268474, 0.0936825608992031, -0.013631335359630766, 0.07302045002317345, 0.053823486226282906, -0.12501185416886715, -0.12745477757613424, 0.36548550104276395, -0.08238120740082797, -0.24953320019707922, 0.09238922105393779, -0.186401241852469, -0.16353294132998816, 0.10841416563628845, 0.060720393460401346, 0.11766893285470949, -0.15788277844622942, 0.17337727778866677, -0.042613652364259035, 0.04185575033820064, 0.04644307432512582, 0.05760119134612696, 0.19402997772160976, 0.14069297408658854, 0.039865887500870396, 0.15093628578150356, -0.035057065057450196, -0.15071920887895032, -0.38271966953040426, -0.19820081471821333, -0.16866953821498637, 0.09971104138596378, -0.14413430011818107, -0.22511014276721947, 0.40096587413580903, 0.11319446151184154, 0.18920719756172563, 0.10669039697451911, 0.26349387964574805, 0.23064687544919393, 0.027752244569571087, 0.035297069947799325, 0.1516659130722704, 0.143666394553344, 0.05803526128301213, -0.17786439359319253, -0.041094791777038446, 0.17891313260237515]
|
1,803.07724
|
Attention on Attention: Architectures for Visual Question Answering
(VQA)
|
Visual Question Answering (VQA) is an increasingly popular topic in deep
learning research, requiring coordination of natural language processing and
computer vision modules into a single architecture. We build upon the model
which placed first in the VQA Challenge by developing thirteen new attention
mechanisms and introducing a simplified classifier. We performed 300 GPU hours
of extensive hyperparameter and architecture searches and were able to achieve
an evaluation score of 64.78%, outperforming the existing state-of-the-art
single model's validation score of 63.15%.
|
cs.CL cs.AI cs.CV
|
visual question answering vqa is an increasingly popular topic in deep learning research requiring coordination of natural language processing and computer vision modules into a single architecture we build upon the model which placed first in the vqa challenge by developing thirteen new attention mechanisms and introducing a simplified classifier we performed 300 gpu hours of extensive hyperparameter and architecture searches and were able to achieve an evaluation score of 6478 outperforming the existing stateoftheart single models validation score of 6315
|
[['visual', 'question', 'answering', 'vqa', 'is', 'an', 'increasingly', 'popular', 'topic', 'in', 'deep', 'learning', 'research', 'requiring', 'coordination', 'of', 'natural', 'language', 'processing', 'and', 'computer', 'vision', 'modules', 'into', 'a', 'single', 'architecture', 'we', 'build', 'upon', 'the', 'model', 'which', 'placed', 'first', 'in', 'the', 'vqa', 'challenge', 'by', 'developing', 'thirteen', 'new', 'attention', 'mechanisms', 'and', 'introducing', 'a', 'simplified', 'classifier', 'we', 'performed', '300', 'gpu', 'hours', 'of', 'extensive', 'hyperparameter', 'and', 'architecture', 'searches', 'and', 'were', 'able', 'to', 'achieve', 'an', 'evaluation', 'score', 'of', '6478', 'outperforming', 'the', 'existing', 'stateoftheart', 'single', 'models', 'validation', 'score', 'of', '6315']]
|
[-0.035972566155221646, -0.03870723634049049, -0.02527643618751553, 0.01629965529111037, -0.14041990459059614, -0.24639795181824814, 0.039848900411891035, 0.47245539925238, -0.22649034460464232, -0.4180538203048555, 0.030672937498982006, -0.2599143968965811, -0.14093074506690986, 0.21890379251419312, -0.10760623862660385, 0.1241974043939852, 0.1797292822532804, 0.04376109157352932, -0.04750715516790559, -0.3618585498107574, 0.23674642824556066, 0.09085470721194862, 0.3445668410674869, 0.04536451808400924, 0.12069512129160045, -0.04226054484024644, -0.05542055481478949, -0.07576040455576362, -0.08962643342799967, 0.22577883415380964, 0.3306944886408249, 0.2469244360027811, 0.4003693060124222, -0.4229765984972444, -0.18543384906753332, 0.066889737575032, 0.13651073759398127, 0.04394633785520881, -0.07590779423996617, -0.3633035878308966, 0.029475179772022405, -0.18788780766845786, 0.08256364085039572, -0.1306872894763475, -0.007307507321710074, -0.0797112304304691, -0.27754659222032213, -0.019007522453660074, 0.10934674471050879, 0.1445674381566623, -0.04306119338526756, -0.14675810489555985, 0.07453444703847548, 0.15455823417611514, 0.0011236489709183762, 0.11025029702017768, 0.17924095842916565, -0.22800762725616747, -0.20443889197799128, 0.36860957986946347, -0.0688337617070426, -0.1827015065694157, 0.1987816316393923, 0.04080607635086945, -0.19836477625266283, 0.06356828886119625, 0.24422714096505807, 0.10388731204939983, -0.19927606224730798, 0.012935142124166028, -0.03564097363313165, 0.2235588943173142, 0.04856803296487543, -0.06921064301948004, 0.23236077609530922, 0.38689842368652927, -0.02907010928220764, 0.13615042893098125, -0.11893027368343517, -0.1094104514952419, -0.14534927636997985, -0.1006079265726966, -0.12392423675053671, -0.03931888103591207, -0.052362822054419667, -0.13481759529890894, 0.4151498976198933, 0.24949429728845252, 0.1686849324622109, 0.08478836741304331, 0.3577767878334639, -0.01620389021051859, 0.15363552996924124, 0.08589105310413657, 0.16979780721277754, -0.017454961308902953, 0.1397746481661555, -0.10108957894122865, 0.03438847515543428, 0.04006594733653378]
|
1,803.07725
|
Semidefinite Outer Approximation of the Backward Reachable Set of
Discrete-time Autonomous Polynomial Systems
|
We approximate the backward reachable set of discrete-time autonomous
polynomial systems using the recently developed occupation measure approach. We
formulate the problem as an infinite-dimensional linear programming (LP)
problem on measures and its dual on continuous functions. Then we approximate
the LP by a hierarchy of finite-dimensional semidefinite programming (SDP)
programs on moments of measures and their duals on sums-of-squares polynomials.
Finally we solve the SDP's and obtain a sequence of outer approximations of the
backward reachable set. We demonstrate our approach on three dynamical systems.
As a special case, we also show how to approximate the preimage of a compact
semi-algebraic set under a polynomial map.
|
cs.SY cs.RO math.OC
|
we approximate the backward reachable set of discretetime autonomous polynomial systems using the recently developed occupation measure approach we formulate the problem as an infinitedimensional linear programming lp problem on measures and its dual on continuous functions then we approximate the lp by a hierarchy of finitedimensional semidefinite programming sdp programs on moments of measures and their duals on sumsofsquares polynomials finally we solve the sdps and obtain a sequence of outer approximations of the backward reachable set we demonstrate our approach on three dynamical systems as a special case we also show how to approximate the preimage of a compact semialgebraic set under a polynomial map
|
[['we', 'approximate', 'the', 'backward', 'reachable', 'set', 'of', 'discretetime', 'autonomous', 'polynomial', 'systems', 'using', 'the', 'recently', 'developed', 'occupation', 'measure', 'approach', 'we', 'formulate', 'the', 'problem', 'as', 'an', 'infinitedimensional', 'linear', 'programming', 'lp', 'problem', 'on', 'measures', 'and', 'its', 'dual', 'on', 'continuous', 'functions', 'then', 'we', 'approximate', 'the', 'lp', 'by', 'a', 'hierarchy', 'of', 'finitedimensional', 'semidefinite', 'programming', 'sdp', 'programs', 'on', 'moments', 'of', 'measures', 'and', 'their', 'duals', 'on', 'sumsofsquares', 'polynomials', 'finally', 'we', 'solve', 'the', 'sdps', 'and', 'obtain', 'a', 'sequence', 'of', 'outer', 'approximations', 'of', 'the', 'backward', 'reachable', 'set', 'we', 'demonstrate', 'our', 'approach', 'on', 'three', 'dynamical', 'systems', 'as', 'a', 'special', 'case', 'we', 'also', 'show', 'how', 'to', 'approximate', 'the', 'preimage', 'of', 'a', 'compact', 'semialgebraic', 'set', 'under', 'a', 'polynomial', 'map']]
|
[-0.12429695446740523, -0.03194097716186661, -0.10169762090745026, 0.12996697956371794, -0.09235596874615648, -0.10527304203628136, 0.09178479863700639, 0.3413062377258369, -0.3918380585507812, -0.22479580223525517, 0.17368663961903374, -0.24389465364288085, -0.17796813706197193, 0.22232376219199917, -0.049210967637476656, 0.16523940056164219, 0.051151518622918106, 0.02912430418220079, -0.14842851347699065, -0.2679865479852273, 0.3574893236438805, -0.045569764528528, 0.18631328088144344, 0.01747987459133005, 0.20526543042457132, 0.014982236235916057, 0.021458084090116705, 0.02927935500324608, -0.13076250778215232, 0.13136877103982858, 0.27943189533331614, 0.2259729324892233, 0.2996273304675227, -0.4139648764002546, -0.09811703807665645, 0.14062585857115842, 0.10965201422293609, 0.08480251101324353, -0.011213904012769251, -0.3061084665649649, 0.08757411940110342, -0.14105481480653007, -0.09487684164196253, -0.10969458700148998, -0.00018665657126318627, 0.022215930224944638, -0.296910701719957, -0.01146961690745943, 0.08033731893204353, 0.04775791804993821, -0.08844889216146772, -0.13411473195399287, 0.008891070910041855, 0.018307366325720168, -0.05323967909457806, 0.022159407354856483, 0.0906323548145244, -0.015044686613521738, -0.18444415924322105, 0.33020366662155803, -0.06612648416003734, -0.3019465758404303, 0.19762445135024664, -0.1133080275302805, -0.1774148542812599, 0.06332196066891513, 0.25866857227634327, 0.21877291366875729, -0.12199282774997648, 0.16489503672618472, -0.14970740161522805, 0.11835745113649379, 0.053083293784026785, 0.03241727564257579, 0.15989660382897497, 0.13772010794518708, 0.177733358082788, 0.1898047078496594, 0.017518563672604265, -0.11754136224642883, -0.28021127794146816, -0.12400447590294007, -0.1906503269701291, 0.015267642476012774, -0.11826992843033002, -0.1687843401385384, 0.4038893139320556, 0.11961979210098213, 0.14436325067480174, 0.21839379638033074, 0.2683323612001455, 0.20317891257351034, -0.015665591488239816, 0.08671622304028231, 0.13987341839776626, 0.15264932984686413, 0.04201302173651894, -0.2428907770271822, 0.03936907011040739, 0.18023966611406514]
|
1,803.07726
|
Gradient Descent with Random Initialization: Fast Global Convergence for
Nonconvex Phase Retrieval
|
This paper considers the problem of solving systems of quadratic equations,
namely, recovering an object of interest
$\mathbf{x}^{\natural}\in\mathbb{R}^{n}$ from $m$ quadratic equations/samples
$y_{i}=(\mathbf{a}_{i}^{\top}\mathbf{x}^{\natural})^{2}$, $1\leq i\leq m$. This
problem, also dubbed as phase retrieval, spans multiple domains including
physical sciences and machine learning.
We investigate the efficiency of gradient descent (or Wirtinger flow)
designed for the nonconvex least squares problem. We prove that under Gaussian
designs, gradient descent --- when randomly initialized --- yields an
$\epsilon$-accurate solution in $O\big(\log n+\log(1/\epsilon)\big)$ iterations
given nearly minimal samples, thus achieving near-optimal computational and
sample complexities at once. This provides the first global convergence
guarantee concerning vanilla gradient descent for phase retrieval, without the
need of (i) carefully-designed initialization, (ii) sample splitting, or (iii)
sophisticated saddle-point escaping schemes. All of these are achieved by
exploiting the statistical models in analyzing optimization algorithms, via a
leave-one-out approach that enables the decoupling of certain statistical
dependency between the gradient descent iterates and the data.
|
stat.ML cs.IT cs.LG cs.NA math.IT math.OC
|
this paper considers the problem of solving systems of quadratic equations namely recovering an object of interest mathbfxnaturalinmathbbrn from m quadratic equationssamples y_imathbfa_itopmathbfxnatural2 1leq ileq m this problem also dubbed as phase retrieval spans multiple domains including physical sciences and machine learning we investigate the efficiency of gradient descent or wirtinger flow designed for the nonconvex least squares problem we prove that under gaussian designs gradient descent when randomly initialized yields an epsilonaccurate solution in obiglog nlog1epsilonbig iterations given nearly minimal samples thus achieving nearoptimal computational and sample complexities at once this provides the first global convergence guarantee concerning vanilla gradient descent for phase retrieval without the need of i carefullydesigned initialization ii sample splitting or iii sophisticated saddlepoint escaping schemes all of these are achieved by exploiting the statistical models in analyzing optimization algorithms via a leaveoneout approach that enables the decoupling of certain statistical dependency between the gradient descent iterates and the data
|
[['this', 'paper', 'considers', 'the', 'problem', 'of', 'solving', 'systems', 'of', 'quadratic', 'equations', 'namely', 'recovering', 'an', 'object', 'of', 'interest', 'mathbfxnaturalinmathbbrn', 'from', 'm', 'quadratic', 'equationssamples', 'y_imathbfa_itopmathbfxnatural2', '1leq', 'ileq', 'm', 'this', 'problem', 'also', 'dubbed', 'as', 'phase', 'retrieval', 'spans', 'multiple', 'domains', 'including', 'physical', 'sciences', 'and', 'machine', 'learning', 'we', 'investigate', 'the', 'efficiency', 'of', 'gradient', 'descent', 'or', 'wirtinger', 'flow', 'designed', 'for', 'the', 'nonconvex', 'least', 'squares', 'problem', 'we', 'prove', 'that', 'under', 'gaussian', 'designs', 'gradient', 'descent', 'when', 'randomly', 'initialized', 'yields', 'an', 'epsilonaccurate', 'solution', 'in', 'obiglog', 'nlog1epsilonbig', 'iterations', 'given', 'nearly', 'minimal', 'samples', 'thus', 'achieving', 'nearoptimal', 'computational', 'and', 'sample', 'complexities', 'at', 'once', 'this', 'provides', 'the', 'first', 'global', 'convergence', 'guarantee', 'concerning', 'vanilla', 'gradient', 'descent', 'for', 'phase', 'retrieval', 'without', 'the', 'need', 'of', 'i', 'carefullydesigned', 'initialization', 'ii', 'sample', 'splitting', 'or', 'iii', 'sophisticated', 'saddlepoint', 'escaping', 'schemes', 'all', 'of', 'these', 'are', 'achieved', 'by', 'exploiting', 'the', 'statistical', 'models', 'in', 'analyzing', 'optimization', 'algorithms', 'via', 'a', 'leaveoneout', 'approach', 'that', 'enables', 'the', 'decoupling', 'of', 'certain', 'statistical', 'dependency', 'between', 'the', 'gradient', 'descent', 'iterates', 'and', 'the', 'data']]
|
[-0.11078296859736327, 0.007106364798918675, -0.07112130757100535, 0.049181862331815804, -0.048367785004627524, -0.1936674613524105, 0.0433907480856453, 0.39196416498501074, -0.34624537798176697, -0.31614061517776637, 0.11422387702507737, -0.24415480774142687, -0.13135592940429977, 0.18277625786603138, -0.10649995664936422, 0.11017268248494493, 0.09356936448198182, -0.02112318751161659, -0.14297918272081342, -0.31492103548220896, 0.27817184961592123, 0.026321520137643776, 0.2879957407157843, -0.0549228681926577, 0.1789989119884404, 0.024735706842917676, 0.007512030303509079, 0.014768497225449156, -0.08256261768900798, 0.12992033195012676, 0.27263878705782296, 0.22049584742851358, 0.3693832212948049, -0.3953242223178436, -0.1850613731496184, 0.17658323720436767, 0.1854181521239117, 0.09858962199619867, -0.08214901832864459, -0.22941407064802402, 0.0997011312437768, -0.08999947784622724, -0.051357844503695106, -0.12077783979302031, -0.06547689521438535, 0.04234770299336373, -0.3220086833893858, 0.05516855113824293, 0.09109189790451516, 0.08653456108823468, -0.053946052952392014, -0.1643287858999772, 0.03391497346552533, 0.07119224904762698, 0.051055558443698565, 0.017033698536850363, 0.09983357278412726, -0.13098553395583387, -0.11012395365866802, 0.3518108586034435, -0.056305849600879365, -0.18106196590680754, 0.14686949648323858, -0.03182713320441791, -0.13703171141285275, 0.13693078592209923, 0.20081949062546753, 0.18805822882406562, -0.1483793994062002, 0.10863243350766859, -0.021421675854023325, 0.12603402843649517, 0.055557537210229414, -0.027492550725197507, 0.1167841892001768, 0.15277350631334152, 0.18481446085813832, 0.15039295012852955, -0.07724229298225166, -0.13113351358526343, -0.2864672009935695, -0.10503459491131716, -0.1777369440325061, 0.006713618442650564, -0.1590698918367972, -0.14664840880806082, 0.3465621429217967, 0.13642137981750788, 0.19148332950973648, 0.1328935248805025, 0.3191380398594682, 0.08814721430469896, 0.015957476524944534, 0.1467644687285585, 0.19083186316562953, 0.11404242255842152, 0.10034263877210435, -0.243059450636937, 0.08181392094613799, 0.12973380083794897]
|
1,803.07727
|
A family of Bell transformations
|
We introduce a family of sequence transformations, defined via partial Bell
polynomials, that may be used for a systematic study of a wide variety of
problems in enumerative combinatorics. This family includes some of the
transformations listed in the paper by Bernstein & Sloane, now seen as
transformations under the umbrella of partial Bell polynomials. Our goal is to
describe these transformations from the algebraic and combinatorial points of
view. We provide functional equations satisfied by the generating functions,
derive inverse relations, and give a convolution formula. While the full range
of applications remains unexplored, in this paper we show a glimpse of the
versatility of Bell transformations by discussing the enumeration of several
combinatorial configurations, including rational Dyck paths, rooted planar
maps, and certain classes of permutations.
|
math.CO math.NT math.PR
|
we introduce a family of sequence transformations defined via partial bell polynomials that may be used for a systematic study of a wide variety of problems in enumerative combinatorics this family includes some of the transformations listed in the paper by bernstein sloane now seen as transformations under the umbrella of partial bell polynomials our goal is to describe these transformations from the algebraic and combinatorial points of view we provide functional equations satisfied by the generating functions derive inverse relations and give a convolution formula while the full range of applications remains unexplored in this paper we show a glimpse of the versatility of bell transformations by discussing the enumeration of several combinatorial configurations including rational dyck paths rooted planar maps and certain classes of permutations
|
[['we', 'introduce', 'a', 'family', 'of', 'sequence', 'transformations', 'defined', 'via', 'partial', 'bell', 'polynomials', 'that', 'may', 'be', 'used', 'for', 'a', 'systematic', 'study', 'of', 'a', 'wide', 'variety', 'of', 'problems', 'in', 'enumerative', 'combinatorics', 'this', 'family', 'includes', 'some', 'of', 'the', 'transformations', 'listed', 'in', 'the', 'paper', 'by', 'bernstein', 'sloane', 'now', 'seen', 'as', 'transformations', 'under', 'the', 'umbrella', 'of', 'partial', 'bell', 'polynomials', 'our', 'goal', 'is', 'to', 'describe', 'these', 'transformations', 'from', 'the', 'algebraic', 'and', 'combinatorial', 'points', 'of', 'view', 'we', 'provide', 'functional', 'equations', 'satisfied', 'by', 'the', 'generating', 'functions', 'derive', 'inverse', 'relations', 'and', 'give', 'a', 'convolution', 'formula', 'while', 'the', 'full', 'range', 'of', 'applications', 'remains', 'unexplored', 'in', 'this', 'paper', 'we', 'show', 'a', 'glimpse', 'of', 'the', 'versatility', 'of', 'bell', 'transformations', 'by', 'discussing', 'the', 'enumeration', 'of', 'several', 'combinatorial', 'configurations', 'including', 'rational', 'dyck', 'paths', 'rooted', 'planar', 'maps', 'and', 'certain', 'classes', 'of', 'permutations']]
|
[-0.14567406689216508, 0.07784947655420368, -0.068829864771362, 0.09040977639663143, -0.10419776202656153, -0.07971805693787032, 0.06773684618492266, 0.31985511896237145, -0.3506503974768268, -0.2895985165038916, 0.09344216441739292, -0.22175617796904223, -0.20778207296109574, 0.22848986897536913, -0.11054455708184345, 0.08086747679159074, 0.043816240861879914, -0.03597515793384317, -0.13782958708890058, -0.2626839449783186, 0.35895284345492906, -0.03490635999808396, 0.2193814865423469, 0.010626486208799522, 0.1347486012189935, 0.04374351346219971, -0.07280768227110815, 0.002785091424052875, -0.17658846172180775, 0.14311928022286202, 0.31499637855495527, 0.19098096515426016, 0.22544738324725722, -0.37565383334152813, -0.1466889956885377, 0.13203656896728816, 0.1301727653985227, 0.10189980822505326, -0.06246607036395805, -0.2746355542326419, 0.040662563424264116, -0.14517277209583201, -0.1444694177471248, -0.11154891684006049, 0.02166380530120585, 0.08805179201189325, -0.23395328169782997, -0.002896510262599611, 0.09402122943273444, 0.13950356944119485, 0.011373460439481134, -0.11439194705054956, 0.04066131340237114, 0.0844108546299376, -0.005146129801136067, 0.003241777166130212, 0.048931485841300075, -0.11485399646908191, -0.18044238557899736, 0.39777752753680823, 0.04060154747745887, -0.22015912062305165, 0.13581125013618253, -0.13027841603295423, -0.22097145055794692, 0.11112216087131518, 0.13457150658130587, 0.14769299934053515, -0.16568331009026352, 0.12295978377237696, -0.13016378240821164, 0.06100995374630814, 0.1468380860540664, 0.0416918920617052, 0.16488070524935647, 0.05176546649024712, 0.053190508371541705, 0.2535013127769527, 0.006494194236180679, -0.10646650608716987, -0.3521858504111695, -0.15650286629986693, -0.13274926748713406, 0.07230710004287677, -0.09867539049474995, -0.19061185638823613, 0.4335928686681812, 0.11859065233124787, 0.17490004050530727, 0.10412752607059995, 0.16750784848237366, 0.1073574815788783, 0.051046917031658444, 0.00012374099153350656, 0.12569781393293974, 0.18700712556789417, 0.040031128326489585, -0.12904613868307732, 0.039136993673109396, 0.14485773726505793]
|
1,803.07728
|
Unsupervised Representation Learning by Predicting Image Rotations
|
Over the last years, deep convolutional neural networks (ConvNets) have
transformed the field of computer vision thanks to their unparalleled capacity
to learn high level semantic image features. However, in order to successfully
learn those features, they usually require massive amounts of manually labeled
data, which is both expensive and impractical to scale. Therefore, unsupervised
semantic feature learning, i.e., learning without requiring manual annotation
effort, is of crucial importance in order to successfully harvest the vast
amount of visual data that are available today. In our work we propose to learn
image features by training ConvNets to recognize the 2d rotation that is
applied to the image that it gets as input. We demonstrate both qualitatively
and quantitatively that this apparently simple task actually provides a very
powerful supervisory signal for semantic feature learning. We exhaustively
evaluate our method in various unsupervised feature learning benchmarks and we
exhibit in all of them state-of-the-art performance. Specifically, our results
on those benchmarks demonstrate dramatic improvements w.r.t. prior
state-of-the-art approaches in unsupervised representation learning and thus
significantly close the gap with supervised feature learning. For instance, in
PASCAL VOC 2007 detection task our unsupervised pre-trained AlexNet model
achieves the state-of-the-art (among unsupervised methods) mAP of 54.4% that is
only 2.4 points lower from the supervised case. We get similarly striking
results when we transfer our unsupervised learned features on various other
tasks, such as ImageNet classification, PASCAL classification, PASCAL
segmentation, and CIFAR-10 classification. The code and models of our paper
will be published on: https://github.com/gidariss/FeatureLearningRotNet .
|
cs.CV cs.LG
|
over the last years deep convolutional neural networks convnets have transformed the field of computer vision thanks to their unparalleled capacity to learn high level semantic image features however in order to successfully learn those features they usually require massive amounts of manually labeled data which is both expensive and impractical to scale therefore unsupervised semantic feature learning ie learning without requiring manual annotation effort is of crucial importance in order to successfully harvest the vast amount of visual data that are available today in our work we propose to learn image features by training convnets to recognize the 2d rotation that is applied to the image that it gets as input we demonstrate both qualitatively and quantitatively that this apparently simple task actually provides a very powerful supervisory signal for semantic feature learning we exhaustively evaluate our method in various unsupervised feature learning benchmarks and we exhibit in all of them stateoftheart performance specifically our results on those benchmarks demonstrate dramatic improvements wrt prior stateoftheart approaches in unsupervised representation learning and thus significantly close the gap with supervised feature learning for instance in pascal voc 2007 detection task our unsupervised pretrained alexnet model achieves the stateoftheart among unsupervised methods map of 544 that is only 24 points lower from the supervised case we get similarly striking results when we transfer our unsupervised learned features on various other tasks such as imagenet classification pascal classification pascal segmentation and cifar10 classification the code and models of our paper will be published on httpsgithubcomgidarissfeaturelearningrotnet
|
[['over', 'the', 'last', 'years', 'deep', 'convolutional', 'neural', 'networks', 'convnets', 'have', 'transformed', 'the', 'field', 'of', 'computer', 'vision', 'thanks', 'to', 'their', 'unparalleled', 'capacity', 'to', 'learn', 'high', 'level', 'semantic', 'image', 'features', 'however', 'in', 'order', 'to', 'successfully', 'learn', 'those', 'features', 'they', 'usually', 'require', 'massive', 'amounts', 'of', 'manually', 'labeled', 'data', 'which', 'is', 'both', 'expensive', 'and', 'impractical', 'to', 'scale', 'therefore', 'unsupervised', 'semantic', 'feature', 'learning', 'ie', 'learning', 'without', 'requiring', 'manual', 'annotation', 'effort', 'is', 'of', 'crucial', 'importance', 'in', 'order', 'to', 'successfully', 'harvest', 'the', 'vast', 'amount', 'of', 'visual', 'data', 'that', 'are', 'available', 'today', 'in', 'our', 'work', 'we', 'propose', 'to', 'learn', 'image', 'features', 'by', 'training', 'convnets', 'to', 'recognize', 'the', '2d', 'rotation', 'that', 'is', 'applied', 'to', 'the', 'image', 'that', 'it', 'gets', 'as', 'input', 'we', 'demonstrate', 'both', 'qualitatively', 'and', 'quantitatively', 'that', 'this', 'apparently', 'simple', 'task', 'actually', 'provides', 'a', 'very', 'powerful', 'supervisory', 'signal', 'for', 'semantic', 'feature', 'learning', 'we', 'exhaustively', 'evaluate', 'our', 'method', 'in', 'various', 'unsupervised', 'feature', 'learning', 'benchmarks', 'and', 'we', 'exhibit', 'in', 'all', 'of', 'them', 'stateoftheart', 'performance', 'specifically', 'our', 'results', 'on', 'those', 'benchmarks', 'demonstrate', 'dramatic', 'improvements', 'wrt', 'prior', 'stateoftheart', 'approaches', 'in', 'unsupervised', 'representation', 'learning', 'and', 'thus', 'significantly', 'close', 'the', 'gap', 'with', 'supervised', 'feature', 'learning', 'for', 'instance', 'in', 'pascal', 'voc', '2007', 'detection', 'task', 'our', 'unsupervised', 'pretrained', 'alexnet', 'model', 'achieves', 'the', 'stateoftheart', 'among', 'unsupervised', 'methods', 'map', 'of', '544', 'that', 'is', 'only', '24', 'points', 'lower', 'from', 'the', 'supervised', 'case', 'we', 'get', 'similarly', 'striking', 'results', 'when', 'we', 'transfer', 'our', 'unsupervised', 'learned', 'features', 'on', 'various', 'other', 'tasks', 'such', 'as', 'imagenet', 'classification', 'pascal', 'classification', 'pascal', 'segmentation', 'and', 'cifar10', 'classification', 'the', 'code', 'and', 'models', 'of', 'our', 'paper', 'will', 'be', 'published', 'on', 'httpsgithubcomgidarissfeaturelearningrotnet']]
|
[0.02227300375169403, -0.03365719636328949, -0.0633038783212196, 0.06563286330556475, -0.14354558098519526, -0.18720670450994545, 0.01997107300449133, 0.4977237492692156, -0.26156161349652657, -0.4015463894730308, 0.052584264682053, -0.2830777304280416, -0.18915275463197134, 0.2272233358432216, -0.16939905595495383, 0.10573017927521164, 0.20693612607906525, 0.08086279689137679, -0.09231383340346044, -0.35142523851857865, 0.28542532368221757, 0.03950999828277664, 0.3747187641252619, 0.02054587955701636, 0.12360652210654698, -0.09421652051308507, -0.045200436954865184, -0.0451456838328228, -0.019052149817252215, 0.18857942697447372, 0.4033696693430435, 0.2023590393086146, 0.2899947676694473, -0.37811086570242963, -0.23178826080935735, 0.10863152661535191, 0.1542167282269978, 0.1200138456164952, -0.031453840051911236, -0.37287647061818, 0.09336359232576391, -0.16362081816145385, 0.09110664399303645, -0.21887478054050297, -0.010081491777691916, -0.04701693105999291, -0.2670293686045538, 0.0530268689951455, 0.1208572709632377, 0.0896364556870375, -0.059047710460766525, -0.12272826460676187, 0.01706710410771884, 0.1924662378824648, 0.025220895086348324, 0.09480476798083859, 0.14697139158815264, -0.26118625568912296, -0.15129240543119596, 0.35354875269312547, -0.07330958519976928, -0.1918964403351227, 0.25199078673504266, -0.012394544781664334, -0.18064091320472409, 0.10832168948113087, 0.23316970778827692, 0.1088642535148656, -0.13626979723642535, 0.00861475887973663, -0.057999436582152945, 0.20123846729683034, 0.06483703173058798, -0.017272437332695224, 0.16089436070357202, 0.2885581569781386, -0.00910720436400604, 0.12720699279000464, -0.18202980186391818, -0.047417997606135756, -0.16388766844552827, -0.07189419984713612, -0.2101557381099565, -0.021783739003720156, -0.12139989280448465, -0.12239254798328057, 0.390218263325018, 0.2968831286910342, 0.22710404862775893, 0.12171418401964595, 0.3531333856818923, -0.025418021974981247, 0.1747611473412791, 0.11761100818792662, 0.2122539074857723, -0.029890890739694892, 0.14961658428591004, -0.1530423854937799, 0.05661475004821244, 0.05514562607323565]
|
1,803.07729
|
Look Before You Leap: Bridging Model-Free and Model-Based Reinforcement
Learning for Planned-Ahead Vision-and-Language Navigation
|
Existing research studies on vision and language grounding for robot
navigation focus on improving model-free deep reinforcement learning (DRL)
models in synthetic environments. However, model-free DRL models do not
consider the dynamics in the real-world environments, and they often fail to
generalize to new scenes. In this paper, we take a radical approach to bridge
the gap between synthetic studies and real-world practices---We propose a
novel, planned-ahead hybrid reinforcement learning model that combines
model-free and model-based reinforcement learning to solve a real-world
vision-language navigation task. Our look-ahead module tightly integrates a
look-ahead policy model with an environment model that predicts the next state
and the reward. Experimental results suggest that our proposed method
significantly outperforms the baselines and achieves the best on the real-world
Room-to-Room dataset. Moreover, our scalable method is more generalizable when
transferring to unseen environments.
|
cs.CV cs.AI cs.CL cs.RO
|
existing research studies on vision and language grounding for robot navigation focus on improving modelfree deep reinforcement learning drl models in synthetic environments however modelfree drl models do not consider the dynamics in the realworld environments and they often fail to generalize to new scenes in this paper we take a radical approach to bridge the gap between synthetic studies and realworld practiceswe propose a novel plannedahead hybrid reinforcement learning model that combines modelfree and modelbased reinforcement learning to solve a realworld visionlanguage navigation task our lookahead module tightly integrates a lookahead policy model with an environment model that predicts the next state and the reward experimental results suggest that our proposed method significantly outperforms the baselines and achieves the best on the realworld roomtoroom dataset moreover our scalable method is more generalizable when transferring to unseen environments
|
[['existing', 'research', 'studies', 'on', 'vision', 'and', 'language', 'grounding', 'for', 'robot', 'navigation', 'focus', 'on', 'improving', 'modelfree', 'deep', 'reinforcement', 'learning', 'drl', 'models', 'in', 'synthetic', 'environments', 'however', 'modelfree', 'drl', 'models', 'do', 'not', 'consider', 'the', 'dynamics', 'in', 'the', 'realworld', 'environments', 'and', 'they', 'often', 'fail', 'to', 'generalize', 'to', 'new', 'scenes', 'in', 'this', 'paper', 'we', 'take', 'a', 'radical', 'approach', 'to', 'bridge', 'the', 'gap', 'between', 'synthetic', 'studies', 'and', 'realworld', 'practiceswe', 'propose', 'a', 'novel', 'plannedahead', 'hybrid', 'reinforcement', 'learning', 'model', 'that', 'combines', 'modelfree', 'and', 'modelbased', 'reinforcement', 'learning', 'to', 'solve', 'a', 'realworld', 'visionlanguage', 'navigation', 'task', 'our', 'lookahead', 'module', 'tightly', 'integrates', 'a', 'lookahead', 'policy', 'model', 'with', 'an', 'environment', 'model', 'that', 'predicts', 'the', 'next', 'state', 'and', 'the', 'reward', 'experimental', 'results', 'suggest', 'that', 'our', 'proposed', 'method', 'significantly', 'outperforms', 'the', 'baselines', 'and', 'achieves', 'the', 'best', 'on', 'the', 'realworld', 'roomtoroom', 'dataset', 'moreover', 'our', 'scalable', 'method', 'is', 'more', 'generalizable', 'when', 'transferring', 'to', 'unseen', 'environments']]
|
[-0.014585551623841403, -0.023442244486499543, -0.08585373713738388, 0.054222104414064366, -0.1719254692878436, -0.20714359636659976, 0.039663783986017935, 0.5213273037225008, -0.2434984466612891, -0.34957562363189126, 0.01703310678281856, -0.23081747077715895, -0.23139898969783207, 0.24598297834379115, -0.19026224114759652, 0.056953310650014494, 0.16355868707350626, -0.0014852149929437373, -0.030622441865745243, -0.2669554384925437, 0.2812404695794814, 0.019417814397968833, 0.36732984372173194, 0.021159376767981384, 0.1582991515510474, -0.04223245511314383, 0.030319426744244992, -0.02089595814511456, -0.03863648388926069, 0.17108768817830694, 0.36146924432471644, 0.23707221699188705, 0.35674418947762915, -0.41778402559597183, -0.26507682907222596, 0.11813182159913359, 0.12684508938756253, 0.09255169819419583, -0.07669045153317576, -0.3840284526900009, 0.04702163355864791, -0.18712123826629035, 0.027581787426714546, -0.17063202364370228, -0.050274653196403826, -0.04691931838255928, -0.316705059414488, -0.016410576148579516, 0.08424738784734574, 0.026893670598251953, -0.09266497797022263, -0.12367158441424922, 0.09554302386111684, 0.1544690181011834, 0.015936048366819267, 0.050367729821138914, 0.1844835817158498, -0.19037185896498462, -0.2424938438632698, 0.35280317010151013, -0.048712002813678094, -0.18637744442007884, 0.2655917966738343, -0.010204451979586372, -0.17778392013300348, 0.040678038903408584, 0.2964156432448093, 0.18953689830377698, -0.15730687631520496, 0.03375810902927899, -0.08234302274779313, 0.1829752408175005, -0.06349202263237977, -0.0885421724403622, 0.14323036687931529, 0.3333916217554361, 0.0855065842607507, 0.09596798670892086, -0.0672877055980886, -0.17544870710591096, -0.16423896027521956, -0.091568717536413, -0.1648663776581762, -0.07690058848292446, -0.10197853281063511, -0.11336618744750955, 0.35152164285795556, 0.3510924474301714, 0.18430900837260264, 0.19232296336062804, 0.4142210614350107, 0.0008994961588608998, 0.09997892516915238, 0.1159787389479957, 0.2055547146609536, -0.03450991821440834, 0.16057355307706597, -0.2178770529071766, 0.11402759307443544, -0.002486161135688976]
|
1,803.0773
|
The Origins Space Telescope: Towards An Understanding of Temperate
Planetary Atmospheres
|
The Origins Space Telescope (OST) is one of four mission concepts currently
being studied by NASA in preparation for the Astrophysics 2020 Decadal Survey.
With active cooling (~4 K), OST will be sensitive in mid- to far-IR
wavelengths, using imaging and spectroscopy to probe the furthest reaches of
our galaxies, trace the path of water through star and planet formation, and
place thermochemical constraints on the atmospheres of exoplanets ranging in
size from Jupiter to Earth. This contribution to the Exoplanet Science Strategy
committee discusses the significant advancements that the OST Mid-Infrared
Imager, Spectrometer, and Coronagraph (MISC) instrument can make in studying
cool planetary atmospheres. We particularly focus on the atmospheres of
transiting rocky planets in the habitable zones of mid-to-late M stars. We
discuss how OST thermal infrared observations can significantly enhance our
understanding of the temperature structure and molecular abundances of
biologically interesting gases on these worlds, including O3, CH4, H2O, and
CO2.
|
astro-ph.EP
|
the origins space telescope ost is one of four mission concepts currently being studied by nasa in preparation for the astrophysics 2020 decadal survey with active cooling 4 k ost will be sensitive in mid to farir wavelengths using imaging and spectroscopy to probe the furthest reaches of our galaxies trace the path of water through star and planet formation and place thermochemical constraints on the atmospheres of exoplanets ranging in size from jupiter to earth this contribution to the exoplanet science strategy committee discusses the significant advancements that the ost midinfrared imager spectrometer and coronagraph misc instrument can make in studying cool planetary atmospheres we particularly focus on the atmospheres of transiting rocky planets in the habitable zones of midtolate m stars we discuss how ost thermal infrared observations can significantly enhance our understanding of the temperature structure and molecular abundances of biologically interesting gases on these worlds including o3 ch4 h2o and co2
|
[['the', 'origins', 'space', 'telescope', 'ost', 'is', 'one', 'of', 'four', 'mission', 'concepts', 'currently', 'being', 'studied', 'by', 'nasa', 'in', 'preparation', 'for', 'the', 'astrophysics', '2020', 'decadal', 'survey', 'with', 'active', 'cooling', '4', 'k', 'ost', 'will', 'be', 'sensitive', 'in', 'mid', 'to', 'farir', 'wavelengths', 'using', 'imaging', 'and', 'spectroscopy', 'to', 'probe', 'the', 'furthest', 'reaches', 'of', 'our', 'galaxies', 'trace', 'the', 'path', 'of', 'water', 'through', 'star', 'and', 'planet', 'formation', 'and', 'place', 'thermochemical', 'constraints', 'on', 'the', 'atmospheres', 'of', 'exoplanets', 'ranging', 'in', 'size', 'from', 'jupiter', 'to', 'earth', 'this', 'contribution', 'to', 'the', 'exoplanet', 'science', 'strategy', 'committee', 'discusses', 'the', 'significant', 'advancements', 'that', 'the', 'ost', 'midinfrared', 'imager', 'spectrometer', 'and', 'coronagraph', 'misc', 'instrument', 'can', 'make', 'in', 'studying', 'cool', 'planetary', 'atmospheres', 'we', 'particularly', 'focus', 'on', 'the', 'atmospheres', 'of', 'transiting', 'rocky', 'planets', 'in', 'the', 'habitable', 'zones', 'of', 'midtolate', 'm', 'stars', 'we', 'discuss', 'how', 'ost', 'thermal', 'infrared', 'observations', 'can', 'significantly', 'enhance', 'our', 'understanding', 'of', 'the', 'temperature', 'structure', 'and', 'molecular', 'abundances', 'of', 'biologically', 'interesting', 'gases', 'on', 'these', 'worlds', 'including', 'o3', 'ch4', 'h2o', 'and', 'co2']]
|
[-0.03491180038169747, 0.19208482577495517, -0.06194637564852113, 0.04698364487098109, -0.12544894137329632, -0.05151642605722431, 0.06827803139815167, 0.3732536875823092, -0.1670193067301185, -0.3626510852767575, 0.12217692923807208, -0.2916861967574204, -0.11041154780335004, 0.21811661217812328, -0.08905754897202696, 0.020091622752407865, 0.12757380187751785, -0.13692345355126645, 0.033665375112585966, -0.28085962700312056, 0.2519236137714958, 0.1491929056663667, 0.0959922907025283, 0.015049575010855352, 0.024838311964225385, -0.09754587604453968, -0.08498029370769677, -0.08936190547500436, -0.21426038573098918, 0.0673824216539581, 0.3430866503397063, 0.17125134199647413, 0.20128336537163705, -0.3949929820403697, -0.23829344066550895, 0.03893292714511194, 0.10386854780297125, -0.030723286936840705, -0.017318088145956638, -0.2697705851822731, -0.010569972590723585, -0.12782066690945817, -0.16057432214278847, -0.00772058357364468, 0.05086707884686128, -0.015248674286469336, -0.2405978635407894, -0.050328854119194855, 0.009440615935431372, 0.17892346746258198, -0.1668167929735876, -0.18806869719598082, -0.07142370729481862, 0.09912125526987497, -0.04037696433463885, 0.018812083446931454, 0.21593715649759096, -0.13320130548860518, -0.0065010965411220825, 0.43814408523781645, -0.13207202247163702, 0.04996970709893973, 0.26312900337000045, -0.2559230451231762, -0.14951522719535615, 0.13576141242163195, 0.1767043968999426, 0.1466815149591815, -0.17008157894052867, 0.050988301284040416, 0.008734365596225665, 0.1859769477756814, 0.08490894275206712, 0.10509708064172657, 0.3851861252042469, 0.19598687308870497, 0.10486633607351611, 0.09397426358979917, -0.26858454795343983, -0.06689568727968201, -0.15144281014499644, -0.17907547521735392, -0.1487745569628333, 0.026968161701675385, -0.05864823049538949, -0.08901163832614979, 0.3289412382422128, 0.20075368758050666, 0.10031874830714396, -0.044318841161927386, 0.3527132214077057, -0.0021475196564419855, 0.11045156444963669, 0.05081271367525915, 0.3464147597280962, 0.12429477059162192, 0.15445970970115835, -0.27809044051344595, 0.06420805817770381, 0.0012121300348230909]
|
1,803.07731
|
Mixed-timescale Per-group Hybrid Precoding for Multiuser Massive MIMO
Systems
|
Considering the expensive radio frequency (RF) chain, huge training overhead
and feedback burden issues in massive MIMO, in this letter, we propose a
mixed-timescale per-group hybrid precoding (MPHP) scheme under an adaptive
partially-connected RF precoding structure (PRPS), where the RF precoder is
implemented using an adaptive connection network (ACN) and M analog phase
shifters (APSs), where M is the number of antennas at the base station (BS).
Exploiting the mixed-time stage channel state information (CSI) structure, the
joint-design of ACN and APSs is formulated as a statistical
signal-to-leakage-and-noise ratio (SSLNR) maximization problem, and a heuristic
group RF precoding (GRFP) algorithm is proposed to provide a near-optimal
solution. Simulation results show that the proposed design advances at better
energy efficiency (EE) and lower hardware cost, CSI signaling overhead and
computational complexity than the conventional hybrid precoding (HP) schemes.
|
eess.SP
|
considering the expensive radio frequency rf chain huge training overhead and feedback burden issues in massive mimo in this letter we propose a mixedtimescale pergroup hybrid precoding mphp scheme under an adaptive partiallyconnected rf precoding structure prps where the rf precoder is implemented using an adaptive connection network acn and m analog phase shifters apss where m is the number of antennas at the base station bs exploiting the mixedtime stage channel state information csi structure the jointdesign of acn and apss is formulated as a statistical signaltoleakageandnoise ratio sslnr maximization problem and a heuristic group rf precoding grfp algorithm is proposed to provide a nearoptimal solution simulation results show that the proposed design advances at better energy efficiency ee and lower hardware cost csi signaling overhead and computational complexity than the conventional hybrid precoding hp schemes
|
[['considering', 'the', 'expensive', 'radio', 'frequency', 'rf', 'chain', 'huge', 'training', 'overhead', 'and', 'feedback', 'burden', 'issues', 'in', 'massive', 'mimo', 'in', 'this', 'letter', 'we', 'propose', 'a', 'mixedtimescale', 'pergroup', 'hybrid', 'precoding', 'mphp', 'scheme', 'under', 'an', 'adaptive', 'partiallyconnected', 'rf', 'precoding', 'structure', 'prps', 'where', 'the', 'rf', 'precoder', 'is', 'implemented', 'using', 'an', 'adaptive', 'connection', 'network', 'acn', 'and', 'm', 'analog', 'phase', 'shifters', 'apss', 'where', 'm', 'is', 'the', 'number', 'of', 'antennas', 'at', 'the', 'base', 'station', 'bs', 'exploiting', 'the', 'mixedtime', 'stage', 'channel', 'state', 'information', 'csi', 'structure', 'the', 'jointdesign', 'of', 'acn', 'and', 'apss', 'is', 'formulated', 'as', 'a', 'statistical', 'signaltoleakageandnoise', 'ratio', 'sslnr', 'maximization', 'problem', 'and', 'a', 'heuristic', 'group', 'rf', 'precoding', 'grfp', 'algorithm', 'is', 'proposed', 'to', 'provide', 'a', 'nearoptimal', 'solution', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'design', 'advances', 'at', 'better', 'energy', 'efficiency', 'ee', 'and', 'lower', 'hardware', 'cost', 'csi', 'signaling', 'overhead', 'and', 'computational', 'complexity', 'than', 'the', 'conventional', 'hybrid', 'precoding', 'hp', 'schemes']]
|
[-0.2802596911361427, 0.005651145741807382, -0.014195768316347465, -0.012227413904380395, -0.11531014514034828, -0.2680940414842872, 0.14335816033639526, 0.3947739012251459, -0.2346612624824047, -0.28854679880230083, 0.09760179787426333, -0.19250388069874572, -0.2022937188628805, 0.10370808029334054, -0.10869665372803922, 0.06484411227452846, 0.07398722944283531, -0.0003388033118294481, -0.07802769597526461, -0.25004560594582037, 0.21778727644069817, 0.20354615158636039, 0.41583395604300133, -0.0676958232479106, 0.1384382437743986, -0.021052827664032464, 0.027317431037321347, -0.04967980364778342, -0.07514393387855793, 0.04190998234188909, 0.3658195710758757, 0.21386816558776467, 0.30103743199671384, -0.42691540828273267, -0.23406943774831887, 0.08945426495233906, 0.15748793940514838, 0.04362196170632507, -0.09024646409737472, -0.21510530447317217, 0.13009291379676977, -0.2476383137893472, 0.02724015975605611, 0.02733513672537533, -0.14441673076384565, 0.001459494150221594, -0.3746453099884093, -0.0010480935976819228, -0.032112475354864285, 0.02985770360545348, -0.01162360132252442, -0.19715119660512068, 0.04186385340334577, 0.043574974735317226, -0.03950019175264956, 0.02099465750040529, 0.09798993735719927, -0.052091106081040194, -0.10874165404047675, 0.3192538931283332, 0.027639876421383682, -0.24050044945178142, 0.13361947563386217, -0.0487179771236336, -0.0961581778442416, 0.21381374759215663, 0.24420541860447584, 0.051685873831387695, -0.13732191463505836, 0.07042501548763706, 0.04176462403825619, 0.22646536340737958, 0.06635922727260368, 0.14337182726767908, 0.0755268910913977, 0.2689072290028424, 0.13008709662977805, 0.14926645163098307, -0.11639820446059435, -0.07911638897054522, -0.18219779040806622, -0.14523849388911525, -0.24966768175274673, -0.0005630095407565814, -0.10439073930264323, -0.031074900180101395, 0.29349421086828986, 0.09712418960119254, 0.07245187946499275, 0.1132124905111908, 0.47497516994201044, 0.09375575325586868, 0.04581780942380855, 0.1711914399585452, 0.16704054819746564, 0.1375501781101303, 0.1620369460362628, -0.29758231764488663, -0.000869004672592264, 0.04068604714276255]
|
1,803.07732
|
Superconvergence Points of Integer and Fractional Derivatives of Special
Hermite Interpolations and Its Applications in Solving FDEs
|
In this paper, we study convergence and superconvergence theory of integer
and fractional derivatives of the one-point and the two-point Hermite
interpolations. When considering the integer-order derivative, exponential
decay of the error is proved, and superconvergence points are located, at which
the convergence rates are $O(N^{-2})$ and $O(N^{-1.5})$, respectively, better
than the global rate for the one-point and two-point interpolations. Here $N$
represents the degree of interpolation polynomial. It is proved that the
$\alpha$-th fractional derivative of $(u-u_N)$ with $k<\alpha<k+1$, is bounded
by its $(k+1)$-th derivative. Furthermore, the corresponding superconvergence
points are predicted for fractional derivatives, and an eigenvalue method is
proposed to calculate the superconvergence points for the Riemann-Liouville
fractional derivative. In the application of the knowledge of superconvergence
points to solve FDEs, we discover that a modified collocation method makes
numerical solutions much more accurate than the traditional collocation method.
|
math.NA
|
in this paper we study convergence and superconvergence theory of integer and fractional derivatives of the onepoint and the twopoint hermite interpolations when considering the integerorder derivative exponential decay of the error is proved and superconvergence points are located at which the convergence rates are on2 and on15 respectively better than the global rate for the onepoint and twopoint interpolations here n represents the degree of interpolation polynomial it is proved that the alphath fractional derivative of uu_n with kalphak1 is bounded by its k1th derivative furthermore the corresponding superconvergence points are predicted for fractional derivatives and an eigenvalue method is proposed to calculate the superconvergence points for the riemannliouville fractional derivative in the application of the knowledge of superconvergence points to solve fdes we discover that a modified collocation method makes numerical solutions much more accurate than the traditional collocation method
|
[['in', 'this', 'paper', 'we', 'study', 'convergence', 'and', 'superconvergence', 'theory', 'of', 'integer', 'and', 'fractional', 'derivatives', 'of', 'the', 'onepoint', 'and', 'the', 'twopoint', 'hermite', 'interpolations', 'when', 'considering', 'the', 'integerorder', 'derivative', 'exponential', 'decay', 'of', 'the', 'error', 'is', 'proved', 'and', 'superconvergence', 'points', 'are', 'located', 'at', 'which', 'the', 'convergence', 'rates', 'are', 'on2', 'and', 'on15', 'respectively', 'better', 'than', 'the', 'global', 'rate', 'for', 'the', 'onepoint', 'and', 'twopoint', 'interpolations', 'here', 'n', 'represents', 'the', 'degree', 'of', 'interpolation', 'polynomial', 'it', 'is', 'proved', 'that', 'the', 'alphath', 'fractional', 'derivative', 'of', 'uu_n', 'with', 'kalphak1', 'is', 'bounded', 'by', 'its', 'k1th', 'derivative', 'furthermore', 'the', 'corresponding', 'superconvergence', 'points', 'are', 'predicted', 'for', 'fractional', 'derivatives', 'and', 'an', 'eigenvalue', 'method', 'is', 'proposed', 'to', 'calculate', 'the', 'superconvergence', 'points', 'for', 'the', 'riemannliouville', 'fractional', 'derivative', 'in', 'the', 'application', 'of', 'the', 'knowledge', 'of', 'superconvergence', 'points', 'to', 'solve', 'fdes', 'we', 'discover', 'that', 'a', 'modified', 'collocation', 'method', 'makes', 'numerical', 'solutions', 'much', 'more', 'accurate', 'than', 'the', 'traditional', 'collocation', 'method']]
|
[-0.10481019659283837, 0.003417159843229456, -0.0918776267141636, 0.10571815757929082, -0.07231336093308138, -0.1195503907145134, 0.021100528754426966, 0.33021092297775406, -0.291904010590432, -0.24717011423448898, 0.15148253680339882, -0.3243748115309115, -0.14486496884907996, 0.17505022593374764, -0.04253719112436686, 0.1305624380370968, -0.003804031782367799, 0.05557674125302583, -0.141484332636797, -0.3072343155142984, 0.2886343923031485, 0.008490287831851415, 0.2126019240406874, 0.027764511783607303, 0.1000579679860883, -0.10101379049675806, -0.0654236515717847, -0.051873358289178995, -0.14119254229974884, 0.1390168469864875, 0.20281221230314778, 0.027448670798912646, 0.31304871567658016, -0.3783363878660436, -0.1634400310327432, 0.1433938662455018, 0.16242861752730928, 0.0437984619780244, 0.001992053210415179, -0.263015913352969, 0.1326046023185232, -0.09151806356977821, -0.17592891400480376, -0.13712349058394985, 0.010657440398686699, 0.06383560393753994, -0.3520646519825927, 0.15714499690969075, 0.03733244419771446, 0.047520283187207364, -0.03555998210878378, -0.1699615115299821, -0.027428657097542393, 0.04636203957592703, 0.04923891783691943, 0.03241578898159787, 0.00835778884523149, -0.087227680525809, -0.11283222709607799, 0.3644209221121855, -0.06557378705162721, -0.27676568428952514, 0.09783736519914653, -0.20485403950525713, -0.07422783536104752, 0.12128205452645488, 0.12294860935736714, 0.20040479050897245, -0.09978954239101898, 0.101238079349527, 0.016802962383787548, 0.142669690553365, 0.1352810792924304, 0.01936910807687257, 0.04691069188161886, 0.10664380587071978, 0.1642961418721825, 0.12202229729321386, -0.06937422512939, -0.14630561473646334, -0.3554495091417006, -0.21487726636436752, -0.26508440198376776, -0.01020036402790408, -0.18148780576811988, -0.16342690637601273, 0.40247312088363935, 0.15607562555399324, 0.10028813873151583, 0.14456542014294038, 0.2911095313495025, 0.2675828826015017, 0.017319474740569215, 0.11559947467607604, 0.18467267536159074, 0.14386139232166378, 0.09650956073809148, -0.2354209793265909, 0.057375317688898315, 0.22955047389124436]
|
1,803.07733
|
Bach Flow on Homogeneous Products
|
Qualitative behavior of Bach flow is established on compact four-dimensional
locally homogeneous product manifolds. This is achieved by lifting to the
homogeneous universal cover and, in most cases, capitalizing on the resultant
group structure. The resulting system of ordinary differential equations is
carefully analyzed on a case-by-case basis, with explicit solutions found in
some cases. Limiting behavior of the metric and the curvature are determined in
all cases. The behavior on quotients of $\mathbb{R} \times \mathbb{S}^3$ proves
to be the most challenging and interesting.
|
math.DG
|
qualitative behavior of bach flow is established on compact fourdimensional locally homogeneous product manifolds this is achieved by lifting to the homogeneous universal cover and in most cases capitalizing on the resultant group structure the resulting system of ordinary differential equations is carefully analyzed on a casebycase basis with explicit solutions found in some cases limiting behavior of the metric and the curvature are determined in all cases the behavior on quotients of mathbbr times mathbbs3 proves to be the most challenging and interesting
|
[['qualitative', 'behavior', 'of', 'bach', 'flow', 'is', 'established', 'on', 'compact', 'fourdimensional', 'locally', 'homogeneous', 'product', 'manifolds', 'this', 'is', 'achieved', 'by', 'lifting', 'to', 'the', 'homogeneous', 'universal', 'cover', 'and', 'in', 'most', 'cases', 'capitalizing', 'on', 'the', 'resultant', 'group', 'structure', 'the', 'resulting', 'system', 'of', 'ordinary', 'differential', 'equations', 'is', 'carefully', 'analyzed', 'on', 'a', 'casebycase', 'basis', 'with', 'explicit', 'solutions', 'found', 'in', 'some', 'cases', 'limiting', 'behavior', 'of', 'the', 'metric', 'and', 'the', 'curvature', 'are', 'determined', 'in', 'all', 'cases', 'the', 'behavior', 'on', 'quotients', 'of', 'mathbbr', 'times', 'mathbbs3', 'proves', 'to', 'be', 'the', 'most', 'challenging', 'and', 'interesting']]
|
[-0.16928791229258336, 0.03248841815678004, -0.07678479141378332, 0.06167835616950123, -0.07974468858446926, -0.10880885625235914, -0.030511487364059404, 0.3583215646711843, -0.23252262284568997, -0.23532834665543523, 0.16563096137612038, -0.2659090334117146, -0.16332511640419917, 0.24193877445179082, -0.08444345500763684, 0.04404824108739073, 0.04084003896873799, 0.08773504382476122, -0.09216991319161545, -0.30089933487553416, 0.398644799344419, -0.004464060866406986, 0.29214519240139497, 0.020884021429256314, 0.10320145650933098, -0.04767073657352566, -0.03922997563980365, 0.06344956912594821, -0.149109773271318, 0.0928974088081824, 0.25196660487979117, 0.05424736743970286, 0.1731540289169754, -0.3913273605340648, -0.2026970104475151, 0.10333170801667231, 0.12130894846770734, 0.024735090655407736, -0.006901758506761065, -0.3025441898221505, 0.07760368214942337, -0.09275020272027523, -0.14961824724118092, -0.1027250538602294, 0.0475222508844343, 0.007904226639463255, -0.21365984836163643, 0.052167200815996954, 0.05551367246412805, 0.06470568176536333, -0.0736567136343746, -0.11078825292948057, -0.03738368623557368, 0.11342625907577929, 0.06724705543491014, -0.013178932885195883, 0.08755431089195467, -0.12609072010465233, -0.048703398245076336, 0.3913791684566864, -0.06719319023180842, -0.27848798499568755, 0.15809604339301586, -0.15853962404764302, -0.1238850521067867, 0.12348931615373918, 0.13033528149493837, 0.18813679572416558, -0.12595999704388391, 0.14242088427514923, -0.06802315760536917, 0.1094010982640265, 0.09420337429868855, -0.007893711666665262, 0.12961736890221282, 0.1426414395931975, 0.08009335389942862, 0.11709690803989015, 0.042816780923333554, -0.12905490889845947, -0.3059952051789012, -0.12968945417863628, -0.1267218879254956, 0.13709967771899842, -0.11844190405186271, -0.16640667586276928, 0.3871375289413014, 0.031035221930194114, 0.18611704234388612, 0.0377212288523359, 0.22553841086725393, 0.11882664868330937, 0.03530120574647472, 0.08436748095499795, 0.2232990565316868, 0.15150758553396113, 0.04548853613613617, -0.18723431297777487, 0.041073919099289924, 0.12816737352460178]
|
1,803.07734
|
Adaptive Sequential MCMC for Combined State and Parameter Estimation
|
In the case of a linear state space model, we implement an MCMC sampler with
two phases. In the learning phase, a self-tuning sampler is used to learn the
parameter mean and covariance structure. In the estimation phase, the parameter
mean and covariance structure informs the proposed mechanism and is also used
in a delayed-acceptance algorithm. Information on the resulting state of the
system is given by a Gaussian mixture. In on-line mode, the algorithm is
adaptive and uses a sliding window approach to accelerate sampling speed and to
maintain appropriate acceptance rates. We apply the algorithm to joined state
and parameter estimation in the case of irregularly sampled GPS time series
data.
|
stat.AP
|
in the case of a linear state space model we implement an mcmc sampler with two phases in the learning phase a selftuning sampler is used to learn the parameter mean and covariance structure in the estimation phase the parameter mean and covariance structure informs the proposed mechanism and is also used in a delayedacceptance algorithm information on the resulting state of the system is given by a gaussian mixture in online mode the algorithm is adaptive and uses a sliding window approach to accelerate sampling speed and to maintain appropriate acceptance rates we apply the algorithm to joined state and parameter estimation in the case of irregularly sampled gps time series data
|
[['in', 'the', 'case', 'of', 'a', 'linear', 'state', 'space', 'model', 'we', 'implement', 'an', 'mcmc', 'sampler', 'with', 'two', 'phases', 'in', 'the', 'learning', 'phase', 'a', 'selftuning', 'sampler', 'is', 'used', 'to', 'learn', 'the', 'parameter', 'mean', 'and', 'covariance', 'structure', 'in', 'the', 'estimation', 'phase', 'the', 'parameter', 'mean', 'and', 'covariance', 'structure', 'informs', 'the', 'proposed', 'mechanism', 'and', 'is', 'also', 'used', 'in', 'a', 'delayedacceptance', 'algorithm', 'information', 'on', 'the', 'resulting', 'state', 'of', 'the', 'system', 'is', 'given', 'by', 'a', 'gaussian', 'mixture', 'in', 'online', 'mode', 'the', 'algorithm', 'is', 'adaptive', 'and', 'uses', 'a', 'sliding', 'window', 'approach', 'to', 'accelerate', 'sampling', 'speed', 'and', 'to', 'maintain', 'appropriate', 'acceptance', 'rates', 'we', 'apply', 'the', 'algorithm', 'to', 'joined', 'state', 'and', 'parameter', 'estimation', 'in', 'the', 'case', 'of', 'irregularly', 'sampled', 'gps', 'time', 'series', 'data']]
|
[-0.06852892173899222, 0.10096698221907667, -0.149699812186305, 0.055365332927703195, -0.07845958034235952, -0.15075186054444814, 0.08648397325150735, 0.4397395762194574, -0.2957514999681606, -0.3082477775797973, 0.13272590407961568, -0.20777373704070276, -0.12680367950712684, 0.15933225685277277, -0.07153139582348872, 0.10881725451455707, 0.050443947529502674, 0.05210311838376245, -0.05224523283293949, -0.24434140235169138, 0.25150342990718455, 0.10295406816345928, 0.3177312696682273, -0.09456800082410001, 0.17480954024384407, 0.03199099264297206, -0.021504735928523328, -0.016217416362781324, -0.12499193508853823, 0.07836257220056336, 0.23543006117430937, 0.16112168209289357, 0.3124505569292974, -0.3503454176263999, -0.18768407569258613, 0.12852769246967757, 0.1344692244120272, 0.11986824415368647, -0.02993337468932325, -0.28845637995312895, 0.012132964286524637, -0.16085162719266605, -0.0897306065256419, -0.09630003268212343, -0.07207721093385192, -0.02074957850380941, -0.36027743401669327, 0.07708262200688787, 0.033741445913169105, -0.009389647584515664, -0.05831217122124096, -0.08179184283331795, 0.026697857717497157, 0.09759409960969227, 0.017366131787204836, 0.045582304909553346, 0.11951793814325228, -0.10391793261999183, -0.10683102049428013, 0.3193470346926819, -0.06929899962305759, -0.2468562021159229, 0.14026147767950872, -0.10396546571511894, -0.10758728940921745, 0.15381897688406496, 0.23584285364445068, 0.10982518817351686, -0.11760097197401213, 0.08531893072217142, 0.031738750611852225, 0.18333843033925623, -0.02544427167344014, -0.0303458985542895, 0.11508741298179447, 0.21160716371223395, 0.09657529880399857, 0.15980500463742467, -0.16480857707288082, -0.15894217007851177, -0.23842619594693415, -0.1599849541712783, -0.23197956931384783, -0.08134832989271994, -0.12679207926967379, -0.1744882950361713, 0.41559497543519974, 0.19124760187078532, 0.22970482209631432, 0.05713591611721611, 0.30458574986035847, 0.07799932682285068, 0.021645642161797898, 0.13469526071134394, 0.18394541914319307, 0.11731961748018795, 0.09437491509453518, -0.20316543490255037, 0.10894170802795386, 0.0709095499733261]
|
1,803.07735
|
Phase amplification in optical interferometry with weak measurement
|
Improving the phase resolution of interferometry is crucial for
high-precision measurements of various physical quantities. Systematic phase
errors dominate the phase uncertainties in most realistic optical
interferometers. Here we propose and experimentally demonstrate a weak
measurement scheme to considerably suppress the phase uncertainties by the
direct amplification of phase shift in optical interferometry. Given an initial
ultra-small phase shift between orthogonal polarization states, we observe the
phase amplification effect with a factor of 388. Our weak measurement scheme
provides a practical approach to significantly improve the interferometric
phase resolution, which is favorable for precision measurement applications.
|
quant-ph physics.optics
|
improving the phase resolution of interferometry is crucial for highprecision measurements of various physical quantities systematic phase errors dominate the phase uncertainties in most realistic optical interferometers here we propose and experimentally demonstrate a weak measurement scheme to considerably suppress the phase uncertainties by the direct amplification of phase shift in optical interferometry given an initial ultrasmall phase shift between orthogonal polarization states we observe the phase amplification effect with a factor of 388 our weak measurement scheme provides a practical approach to significantly improve the interferometric phase resolution which is favorable for precision measurement applications
|
[['improving', 'the', 'phase', 'resolution', 'of', 'interferometry', 'is', 'crucial', 'for', 'highprecision', 'measurements', 'of', 'various', 'physical', 'quantities', 'systematic', 'phase', 'errors', 'dominate', 'the', 'phase', 'uncertainties', 'in', 'most', 'realistic', 'optical', 'interferometers', 'here', 'we', 'propose', 'and', 'experimentally', 'demonstrate', 'a', 'weak', 'measurement', 'scheme', 'to', 'considerably', 'suppress', 'the', 'phase', 'uncertainties', 'by', 'the', 'direct', 'amplification', 'of', 'phase', 'shift', 'in', 'optical', 'interferometry', 'given', 'an', 'initial', 'ultrasmall', 'phase', 'shift', 'between', 'orthogonal', 'polarization', 'states', 'we', 'observe', 'the', 'phase', 'amplification', 'effect', 'with', 'a', 'factor', 'of', '388', 'our', 'weak', 'measurement', 'scheme', 'provides', 'a', 'practical', 'approach', 'to', 'significantly', 'improve', 'the', 'interferometric', 'phase', 'resolution', 'which', 'is', 'favorable', 'for', 'precision', 'measurement', 'applications']]
|
[-0.18621460766492723, 0.1759426418249556, -0.0875243434663086, 0.005660382628169221, -0.03437657265749294, -0.12117173839942552, 0.11716801409541706, 0.415626027136265, -0.2510586264118804, -0.3158649736336277, 0.07892650929958715, -0.22203483224924034, -0.09800352791838425, 0.23224611217544103, -0.03259699061406233, 0.09359362040534809, 0.09575273748487234, -0.09240783314938501, -0.1400223097371054, -0.13086535680728653, 0.2573112248016211, 0.11252030335405531, 0.34505089580488857, 0.03221527873150384, 0.09273166366134926, -0.011404088848697333, -0.04925275090499781, -0.01314506276200215, -0.11208772567139628, 0.03410299731270546, 0.24206894174373397, 0.05009416631946806, 0.19069190548422435, -0.3702617330321421, -0.24514039871185864, 0.1335658343062581, 0.11291836990130832, 0.20306887250990258, -0.07070167277561268, -0.31766375292014953, -0.004796198331556904, -0.14986845146631822, -0.1198635651441388, -0.11215106879050533, 0.0037892933760304004, -0.03425946093921084, -0.29627950279549015, 0.10456137201011491, -0.009842868622702857, 0.048886790726101026, 0.012473395111252708, -0.0927583480127699, 0.07076269639098125, 0.11381128046681017, -0.0910316011844164, 0.07091836002655327, 0.1212255305290455, -0.10835795446837437, -0.0882799649698427, 0.3916954714998913, -0.07162668527113662, -0.11534097432740964, 0.09308076668094145, -0.19936764652084094, -0.10296200785281447, 0.16154165587067837, 0.15744530154430927, 0.10627819978981279, -0.07909571982963826, -0.040145870264799065, 0.08724431271548383, 0.24528774407614642, 0.03204295784720065, 0.18313617129266882, 0.18457527495532608, 0.20555264243739657, 0.07556246913251623, 0.11502685047647294, -0.18387313412191966, -0.0625800311002725, -0.27567363747706014, -0.1128634095560604, -0.14494236247749845, 0.007993078732397407, -0.11198036797410775, -0.09996625033090822, 0.3798068092221456, 0.23800658274558373, 0.1804108487413032, -0.03887418864057205, 0.4153753224333438, 0.1083151649266559, 0.045098437500807144, -0.057255504303611815, 0.3777176947914995, 0.1719063050331897, 0.10369584425158489, -0.285556661139708, 0.062007611753263824, -0.0014947542731533758]
|
1,803.07736
|
Asteroseismic Investigations of the Binary System HD176465
|
HD 176465 is a binary system whose both components are solar-like pulsators
and whose oscillation frequencies were observed by the \kepler\ mission. In
this paper we have modeled the asteroseismic and spectroscopic data of the
stars, and have determined their convection-zone helium abundances using the
signatures left by the He{\sc ii} ionization zone on the mode frequencies. As
expected we find that the components of the binary have the same age within
uncertainties ($3.087 \pm 0.580$ Gyr and $3.569 \pm 0.912$ Gyr); they also have
the same initial helium abundance (Y$_{\mathrm{init}}$=0.253 $\pm$ 0.006 and
0.254 $\pm$ 0.008). Their current metallicity ([Fe/H]=$-0.275 \pm 0.04$ and
$-0.285 \pm 0.04$) is also the same within errors. Fits to the signature of the
He{\sc ii} acoustic glitch yields current helium abundances of $Y_{\rm A} =
0.224 \pm 0.006$ and $Y_{\rm B} = 0.233 \pm 0.008$ for the two components.
Analyzing the complete ensemble of models generated for this investigation we
find that both the amplitude and acoustic depth of the glitch signature arising
from the second helium ionization zone and the base of the convection zone (CZ)
are functions of mass. We show that the acoustic depths of these glitches are
positively correlated with each other. The analysis can help us to detect the
internal structure and constrain the chemical compositions.
|
astro-ph.SR
|
hd 176465 is a binary system whose both components are solarlike pulsators and whose oscillation frequencies were observed by the kepler mission in this paper we have modeled the asteroseismic and spectroscopic data of the stars and have determined their convectionzone helium abundances using the signatures left by the hesc ii ionization zone on the mode frequencies as expected we find that the components of the binary have the same age within uncertainties 3087 pm 0580 gyr and 3569 pm 0912 gyr they also have the same initial helium abundance y_mathrminit0253 pm 0006 and 0254 pm 0008 their current metallicity feh0275 pm 004 and 0285 pm 004 is also the same within errors fits to the signature of the hesc ii acoustic glitch yields current helium abundances of y_rm a 0224 pm 0006 and y_rm b 0233 pm 0008 for the two components analyzing the complete ensemble of models generated for this investigation we find that both the amplitude and acoustic depth of the glitch signature arising from the second helium ionization zone and the base of the convection zone cz are functions of mass we show that the acoustic depths of these glitches are positively correlated with each other the analysis can help us to detect the internal structure and constrain the chemical compositions
|
[['hd', '176465', 'is', 'a', 'binary', 'system', 'whose', 'both', 'components', 'are', 'solarlike', 'pulsators', 'and', 'whose', 'oscillation', 'frequencies', 'were', 'observed', 'by', 'the', 'kepler', 'mission', 'in', 'this', 'paper', 'we', 'have', 'modeled', 'the', 'asteroseismic', 'and', 'spectroscopic', 'data', 'of', 'the', 'stars', 'and', 'have', 'determined', 'their', 'convectionzone', 'helium', 'abundances', 'using', 'the', 'signatures', 'left', 'by', 'the', 'hesc', 'ii', 'ionization', 'zone', 'on', 'the', 'mode', 'frequencies', 'as', 'expected', 'we', 'find', 'that', 'the', 'components', 'of', 'the', 'binary', 'have', 'the', 'same', 'age', 'within', 'uncertainties', '3087', 'pm', '0580', 'gyr', 'and', '3569', 'pm', '0912', 'gyr', 'they', 'also', 'have', 'the', 'same', 'initial', 'helium', 'abundance', 'y_mathrminit0253', 'pm', '0006', 'and', '0254', 'pm', '0008', 'their', 'current', 'metallicity', 'feh0275', 'pm', '004', 'and', '0285', 'pm', '004', 'is', 'also', 'the', 'same', 'within', 'errors', 'fits', 'to', 'the', 'signature', 'of', 'the', 'hesc', 'ii', 'acoustic', 'glitch', 'yields', 'current', 'helium', 'abundances', 'of', 'y_rm', 'a', '0224', 'pm', '0006', 'and', 'y_rm', 'b', '0233', 'pm', '0008', 'for', 'the', 'two', 'components', 'analyzing', 'the', 'complete', 'ensemble', 'of', 'models', 'generated', 'for', 'this', 'investigation', 'we', 'find', 'that', 'both', 'the', 'amplitude', 'and', 'acoustic', 'depth', 'of', 'the', 'glitch', 'signature', 'arising', 'from', 'the', 'second', 'helium', 'ionization', 'zone', 'and', 'the', 'base', 'of', 'the', 'convection', 'zone', 'cz', 'are', 'functions', 'of', 'mass', 'we', 'show', 'that', 'the', 'acoustic', 'depths', 'of', 'these', 'glitches', 'are', 'positively', 'correlated', 'with', 'each', 'other', 'the', 'analysis', 'can', 'help', 'us', 'to', 'detect', 'the', 'internal', 'structure', 'and', 'constrain', 'the', 'chemical', 'compositions']]
|
[-0.08723990604961711, 0.1868353651139126, -0.055439396558320635, 0.03514165284279822, -0.02096953139402043, -0.0728702473970598, 0.08130089037166688, 0.36215658564014597, -0.19864809132066347, -0.3568048840741764, 0.06722480862156457, -0.3285369466442915, -0.010492915693688166, 0.20094907023365746, -0.052769914907248805, -0.014022388955097099, 0.0822509675500782, -0.008305757078099378, -0.05886902956687073, -0.1817935141373395, 0.2391457733680534, 0.03183636143229796, 0.17857459050457553, -0.03972188831788104, 0.03065556441312347, -0.125870624015889, -0.05119869369523538, -0.05988906742122148, -0.20286813470966297, 0.05559461898064479, 0.21525166511516128, 0.11680319897336135, 0.1562196817780446, -0.32729430791648256, -0.17615127993385657, 0.09486330999944236, 0.17474724693329766, 0.04107426879353716, -0.001465643809609539, -0.27550194911786763, 0.0884206828310086, -0.17659743725856264, -0.12007413461133484, 0.03831071486934949, 0.07488737017648975, 0.022133627813750816, -0.2510075254823187, 0.16679804464079379, 0.012118037772404638, 0.10847053130408882, -0.13182192413308502, -0.21487811529596218, -0.10111585470419641, 0.1051738957667026, 0.013743371788800751, 0.053743807581293074, 0.10679747621193351, -0.04482217292826605, -0.012966107677500607, 0.3955995810496228, -0.11656036568580469, -0.050724611803420305, 0.1423903909639866, -0.19629701900503363, -0.12274485849444335, 0.11681572538888814, 0.14647494765192764, 0.08841686783815288, -0.14162156768435594, 0.006190424345288055, 0.021700576912187994, 0.23150854179926958, 0.08191182843952383, 0.023892722072706544, 0.2975553813968648, 0.11808130769301824, -0.020737642966153186, -0.003231608966239662, -0.24839591818543866, -0.0005370922302783101, -0.25456923644954416, -0.09163561338002647, -0.0635289247593262, 0.0429331695344255, -0.11801318609267716, -0.131586297145952, 0.3737903491227548, 0.12015274588307763, 0.23000567800131455, 0.041638421365920615, 0.28775351468950366, 0.1291961566830866, 0.060333440611326526, 0.09177468469150153, 0.3054497492106817, 0.21152897036007617, 0.08076393080133751, -0.2915643662214555, 0.10106728296126659, -0.01724365221279104]
|
1,803.07737
|
PyramidBox: A Context-assisted Single Shot Face Detector
|
Face detection has been well studied for many years and one of remaining
challenges is to detect small, blurred and partially occluded faces in
uncontrolled environment. This paper proposes a novel context-assisted single
shot face detector, named \emph{PyramidBox} to handle the hard face detection
problem. Observing the importance of the context, we improve the utilization of
contextual information in the following three aspects. First, we design a novel
context anchor to supervise high-level contextual feature learning by a
semi-supervised method, which we call it PyramidAnchors. Second, we propose the
Low-level Feature Pyramid Network to combine adequate high-level context
semantic feature and Low-level facial feature together, which also allows the
PyramidBox to predict faces of all scales in a single shot. Third, we introduce
a context-sensitive structure to increase the capacity of prediction network to
improve the final accuracy of output. In addition, we use the method of
Data-anchor-sampling to augment the training samples across different scales,
which increases the diversity of training data for smaller faces. By exploiting
the value of context, PyramidBox achieves superior performance among the
state-of-the-art over the two common face detection benchmarks, FDDB and WIDER
FACE. Our code is available in PaddlePaddle:
\href{https://github.com/PaddlePaddle/models/tree/develop/fluid/face_detection}{\url{https://github.com/PaddlePaddle/models/tree/develop/fluid/face_detection}}.
|
cs.CV
|
face detection has been well studied for many years and one of remaining challenges is to detect small blurred and partially occluded faces in uncontrolled environment this paper proposes a novel contextassisted single shot face detector named emphpyramidbox to handle the hard face detection problem observing the importance of the context we improve the utilization of contextual information in the following three aspects first we design a novel context anchor to supervise highlevel contextual feature learning by a semisupervised method which we call it pyramidanchors second we propose the lowlevel feature pyramid network to combine adequate highlevel context semantic feature and lowlevel facial feature together which also allows the pyramidbox to predict faces of all scales in a single shot third we introduce a contextsensitive structure to increase the capacity of prediction network to improve the final accuracy of output in addition we use the method of dataanchorsampling to augment the training samples across different scales which increases the diversity of training data for smaller faces by exploiting the value of context pyramidbox achieves superior performance among the stateoftheart over the two common face detection benchmarks fddb and wider face our code is available in paddlepaddle hrefhttpsgithubcompaddlepaddlemodelstreedevelopfluidface_detectionurlhttpsgithubcompaddlepaddlemodelstreedevelopfluidface_detection
|
[['face', 'detection', 'has', 'been', 'well', 'studied', 'for', 'many', 'years', 'and', 'one', 'of', 'remaining', 'challenges', 'is', 'to', 'detect', 'small', 'blurred', 'and', 'partially', 'occluded', 'faces', 'in', 'uncontrolled', 'environment', 'this', 'paper', 'proposes', 'a', 'novel', 'contextassisted', 'single', 'shot', 'face', 'detector', 'named', 'emphpyramidbox', 'to', 'handle', 'the', 'hard', 'face', 'detection', 'problem', 'observing', 'the', 'importance', 'of', 'the', 'context', 'we', 'improve', 'the', 'utilization', 'of', 'contextual', 'information', 'in', 'the', 'following', 'three', 'aspects', 'first', 'we', 'design', 'a', 'novel', 'context', 'anchor', 'to', 'supervise', 'highlevel', 'contextual', 'feature', 'learning', 'by', 'a', 'semisupervised', 'method', 'which', 'we', 'call', 'it', 'pyramidanchors', 'second', 'we', 'propose', 'the', 'lowlevel', 'feature', 'pyramid', 'network', 'to', 'combine', 'adequate', 'highlevel', 'context', 'semantic', 'feature', 'and', 'lowlevel', 'facial', 'feature', 'together', 'which', 'also', 'allows', 'the', 'pyramidbox', 'to', 'predict', 'faces', 'of', 'all', 'scales', 'in', 'a', 'single', 'shot', 'third', 'we', 'introduce', 'a', 'contextsensitive', 'structure', 'to', 'increase', 'the', 'capacity', 'of', 'prediction', 'network', 'to', 'improve', 'the', 'final', 'accuracy', 'of', 'output', 'in', 'addition', 'we', 'use', 'the', 'method', 'of', 'dataanchorsampling', 'to', 'augment', 'the', 'training', 'samples', 'across', 'different', 'scales', 'which', 'increases', 'the', 'diversity', 'of', 'training', 'data', 'for', 'smaller', 'faces', 'by', 'exploiting', 'the', 'value', 'of', 'context', 'pyramidbox', 'achieves', 'superior', 'performance', 'among', 'the', 'stateoftheart', 'over', 'the', 'two', 'common', 'face', 'detection', 'benchmarks', 'fddb', 'and', 'wider', 'face', 'our', 'code', 'is', 'available', 'in', 'paddlepaddle', 'hrefhttpsgithubcompaddlepaddlemodelstreedevelopfluidface_detectionurlhttpsgithubcompaddlepaddlemodelstreedevelopfluidface_detection']]
|
[-0.04541679901805726, -0.02521812057901154, -0.02811315731717047, 0.03699941468725681, -0.11876669204079364, -0.15963297440034765, 0.02181869113347222, 0.42415115386543295, -0.2997510195561936, -0.3440184577915783, 0.07697124147933056, -0.28516270237164537, -0.15712636998958057, 0.1467682495602362, -0.18514966650585096, 0.08254326050534411, 0.11217868966099723, 0.04723590847090005, -0.06822537473466361, -0.2669432318976356, 0.3200075638827883, 0.06603930919633183, 0.33642052420015844, 0.051210505498275063, 0.14560772089851853, -0.01250017540117913, -0.0478626694579525, 0.00990952670120846, -0.03344234673271852, 0.20241114478028582, 0.3208957549243692, 0.20107356547476557, 0.3137999114755383, -0.3938680890560761, -0.21922560826513088, 0.06639385311346915, 0.12051864431200243, 0.11985415799811817, -0.03744113121967684, -0.32623444616341246, 0.10931252391402801, -0.18773498735144223, -0.00442048905432106, -0.10851944340503819, -0.04260385371054764, -0.05797537394538128, -0.2632887397263576, 0.04065398717278777, 0.07499532189119174, 0.03434226062720415, -0.03334541691906957, -0.09975897147573984, 0.030844296944677514, 0.21109350514475, 0.011077734109546458, 0.026499066501239895, 0.12789780830486466, -0.20241015994670017, -0.1386819783593257, 0.37586452306381296, -0.05481392721566692, -0.186118627711145, 0.20912886590317445, -0.07215116301640159, -0.1780404196517781, 0.13992064873929377, 0.24580341860252833, 0.1280487510301764, -0.16816852643633773, -0.003707143632084052, -0.027485061530516577, 0.19693962425220185, 0.06821753801999703, 0.02962243482314984, 0.19065889869520944, 0.27379283807659277, 0.05044168111388991, 0.19167043128982186, -0.2030908450736509, -0.05914049964858879, -0.2137390235130966, -0.12054922990254545, -0.16838555337636973, -0.08512358219614105, -0.08531336977347367, -0.1384103214516053, 0.4471219980488063, 0.2674183858584406, 0.24337711356082567, 0.06654114184809341, 0.3630160845855556, 0.013618619658580178, 0.13484622547205874, 0.06364737050459972, 0.19257690788618728, -0.02490459882688743, 0.10641610535402492, -0.1697182996291236, 0.09721650563367697, 0.04815020125972787]
|
1,803.07738
|
Speech Emotion Recognition Considering Local Dynamic Features
|
Recently, increasing attention has been directed to the study of the speech
emotion recognition, in which global acoustic features of an utterance are
mostly used to eliminate the content differences. However, the expression of
speech emotion is a dynamic process, which is reflected through dynamic
durations, energies, and some other prosodic information when one speaks. In
this paper, a novel local dynamic pitch probability distribution feature, which
is obtained by drawing the histogram, is proposed to improve the accuracy of
speech emotion recognition. Compared with most of the previous works using
global features, the proposed method takes advantage of the local dynamic
information conveyed by the emotional speech. Several experiments on Berlin
Database of Emotional Speech are conducted to verify the effectiveness of the
proposed method. The experimental results demonstrate that the local dynamic
information obtained with the proposed method is more effective for speech
emotion recognition than the traditional global features.
|
cs.HC cs.AI cs.CL
|
recently increasing attention has been directed to the study of the speech emotion recognition in which global acoustic features of an utterance are mostly used to eliminate the content differences however the expression of speech emotion is a dynamic process which is reflected through dynamic durations energies and some other prosodic information when one speaks in this paper a novel local dynamic pitch probability distribution feature which is obtained by drawing the histogram is proposed to improve the accuracy of speech emotion recognition compared with most of the previous works using global features the proposed method takes advantage of the local dynamic information conveyed by the emotional speech several experiments on berlin database of emotional speech are conducted to verify the effectiveness of the proposed method the experimental results demonstrate that the local dynamic information obtained with the proposed method is more effective for speech emotion recognition than the traditional global features
|
[['recently', 'increasing', 'attention', 'has', 'been', 'directed', 'to', 'the', 'study', 'of', 'the', 'speech', 'emotion', 'recognition', 'in', 'which', 'global', 'acoustic', 'features', 'of', 'an', 'utterance', 'are', 'mostly', 'used', 'to', 'eliminate', 'the', 'content', 'differences', 'however', 'the', 'expression', 'of', 'speech', 'emotion', 'is', 'a', 'dynamic', 'process', 'which', 'is', 'reflected', 'through', 'dynamic', 'durations', 'energies', 'and', 'some', 'other', 'prosodic', 'information', 'when', 'one', 'speaks', 'in', 'this', 'paper', 'a', 'novel', 'local', 'dynamic', 'pitch', 'probability', 'distribution', 'feature', 'which', 'is', 'obtained', 'by', 'drawing', 'the', 'histogram', 'is', 'proposed', 'to', 'improve', 'the', 'accuracy', 'of', 'speech', 'emotion', 'recognition', 'compared', 'with', 'most', 'of', 'the', 'previous', 'works', 'using', 'global', 'features', 'the', 'proposed', 'method', 'takes', 'advantage', 'of', 'the', 'local', 'dynamic', 'information', 'conveyed', 'by', 'the', 'emotional', 'speech', 'several', 'experiments', 'on', 'berlin', 'database', 'of', 'emotional', 'speech', 'are', 'conducted', 'to', 'verify', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'the', 'experimental', 'results', 'demonstrate', 'that', 'the', 'local', 'dynamic', 'information', 'obtained', 'with', 'the', 'proposed', 'method', 'is', 'more', 'effective', 'for', 'speech', 'emotion', 'recognition', 'than', 'the', 'traditional', 'global', 'features']]
|
[-0.0429080381222057, 0.02169107645223496, -0.0864458074287732, 0.04426473780965448, -0.12416449981422997, -0.12318553371158869, -0.006569249462795836, 0.4093149045335227, -0.23549695931280057, -0.3060358424148657, 0.07311382392838009, -0.30591278355323565, -0.20497841010556409, 0.20107271358076678, -0.12005673135679804, 0.09883938414599183, 0.08038902733058326, 0.14520148195228294, -0.02467409112968629, -0.2599253434209937, 0.27238280165597406, 0.05657417322570262, 0.391666576780967, 0.05930023002560789, 0.11340201017063871, -0.029462767001524826, -0.08543453473401696, -0.03535097195249124, -0.03324779250842288, 0.185355431577926, 0.32506538977031596, 0.19511559407232867, 0.3074795228649715, -0.3904656696157824, -0.26562365895676376, 0.04956801430518298, 0.125560152411804, 0.13433827846510163, -0.05350607528022298, -0.4175743906832251, 0.12034480961799425, -0.1565714553373829, 0.039305267595122324, -0.08732960348654735, 0.020152207972530863, -0.006319909830620561, -0.26880571841014134, 0.05112250728626876, 0.12501369517504876, 0.13048757460139887, -0.06614772335620057, -0.11795647977851331, -0.020688846866649232, 0.21174416605227683, 0.0958145160890892, 0.04373842893447114, 0.16303529179544726, -0.18175611908602723, -0.14526151462594403, 0.38001789956500653, -0.08204772933372863, -0.21080834582588928, 0.19124086237953683, -0.0545359022798948, -0.114390278492417, 0.14832778137152722, 0.19706694403736802, 0.09491525999711532, -0.19468405868869204, -0.02841669164550503, -0.045163305041282194, 0.23723270533771842, 0.0748120816229187, -0.0007271277856106233, 0.15022759333767585, 0.21465853743690164, 0.002333076493079333, 0.15836419611380398, -0.13609041867886462, -0.06069417672819997, -0.16315031364118973, -0.07971743081304196, -0.19965272506172033, -0.09168785275113278, -0.0891727561062764, -0.09450938428543802, 0.45147253782488406, 0.22923268830575244, 0.17959972503778868, 0.09215019221684136, 0.3453041607832634, 0.09312414813566168, 0.0796429346174639, 0.038582908501235864, 0.20663315196093449, 0.0005510115404735858, 0.15571100930805856, -0.2315805765745034, 0.13995299229128777, 0.06785754132158074]
|
1,803.07739
|
Assessing Shape Bias Property of Convolutional Neural Networks
|
It is known that humans display "shape bias" when classifying new items,
i.e., they prefer to categorize objects based on their shape rather than color.
Convolutional Neural Networks (CNNs) are also designed to take into account the
spatial structure of image data. In fact, experiments on image datasets,
consisting of triples of a probe image, a shape-match and a color-match, have
shown that one-shot learning models display shape bias as well.
In this paper, we examine the shape bias property of CNNs. In order to
conduct large scale experiments, we propose using the model accuracy on images
with reversed brightness as a metric to evaluate the shape bias property. Such
images, called negative images, contain objects that have the same shape as
original images, but with different colors. Through extensive systematic
experiments, we investigate the role of different factors, such as training
data, model architecture, initialization and regularization techniques, on the
shape bias property of CNNs. We show that it is possible to design different
CNNs that achieve similar accuracy on original images, but perform
significantly different on negative images, suggesting that CNNs do not
intrinsically display shape bias. We then show that CNNs are able to learn and
generalize the structures, when the model is properly initialized or data is
properly augmented, and if batch normalization is used.
|
cs.CV
|
it is known that humans display shape bias when classifying new items ie they prefer to categorize objects based on their shape rather than color convolutional neural networks cnns are also designed to take into account the spatial structure of image data in fact experiments on image datasets consisting of triples of a probe image a shapematch and a colormatch have shown that oneshot learning models display shape bias as well in this paper we examine the shape bias property of cnns in order to conduct large scale experiments we propose using the model accuracy on images with reversed brightness as a metric to evaluate the shape bias property such images called negative images contain objects that have the same shape as original images but with different colors through extensive systematic experiments we investigate the role of different factors such as training data model architecture initialization and regularization techniques on the shape bias property of cnns we show that it is possible to design different cnns that achieve similar accuracy on original images but perform significantly different on negative images suggesting that cnns do not intrinsically display shape bias we then show that cnns are able to learn and generalize the structures when the model is properly initialized or data is properly augmented and if batch normalization is used
|
[['it', 'is', 'known', 'that', 'humans', 'display', 'shape', 'bias', 'when', 'classifying', 'new', 'items', 'ie', 'they', 'prefer', 'to', 'categorize', 'objects', 'based', 'on', 'their', 'shape', 'rather', 'than', 'color', 'convolutional', 'neural', 'networks', 'cnns', 'are', 'also', 'designed', 'to', 'take', 'into', 'account', 'the', 'spatial', 'structure', 'of', 'image', 'data', 'in', 'fact', 'experiments', 'on', 'image', 'datasets', 'consisting', 'of', 'triples', 'of', 'a', 'probe', 'image', 'a', 'shapematch', 'and', 'a', 'colormatch', 'have', 'shown', 'that', 'oneshot', 'learning', 'models', 'display', 'shape', 'bias', 'as', 'well', 'in', 'this', 'paper', 'we', 'examine', 'the', 'shape', 'bias', 'property', 'of', 'cnns', 'in', 'order', 'to', 'conduct', 'large', 'scale', 'experiments', 'we', 'propose', 'using', 'the', 'model', 'accuracy', 'on', 'images', 'with', 'reversed', 'brightness', 'as', 'a', 'metric', 'to', 'evaluate', 'the', 'shape', 'bias', 'property', 'such', 'images', 'called', 'negative', 'images', 'contain', 'objects', 'that', 'have', 'the', 'same', 'shape', 'as', 'original', 'images', 'but', 'with', 'different', 'colors', 'through', 'extensive', 'systematic', 'experiments', 'we', 'investigate', 'the', 'role', 'of', 'different', 'factors', 'such', 'as', 'training', 'data', 'model', 'architecture', 'initialization', 'and', 'regularization', 'techniques', 'on', 'the', 'shape', 'bias', 'property', 'of', 'cnns', 'we', 'show', 'that', 'it', 'is', 'possible', 'to', 'design', 'different', 'cnns', 'that', 'achieve', 'similar', 'accuracy', 'on', 'original', 'images', 'but', 'perform', 'significantly', 'different', 'on', 'negative', 'images', 'suggesting', 'that', 'cnns', 'do', 'not', 'intrinsically', 'display', 'shape', 'bias', 'we', 'then', 'show', 'that', 'cnns', 'are', 'able', 'to', 'learn', 'and', 'generalize', 'the', 'structures', 'when', 'the', 'model', 'is', 'properly', 'initialized', 'or', 'data', 'is', 'properly', 'augmented', 'and', 'if', 'batch', 'normalization', 'is', 'used']]
|
[-0.014962099997373942, 0.01861244587663321, -0.10357409336685722, 0.11105462121412432, -0.10439996164686943, -0.1740427205160964, -0.022488272259084827, 0.5189361692607952, -0.2562195212708481, -0.3643747043113486, 0.064430895508782, -0.27279094877129223, -0.1921681032702756, 0.16706860698126513, -0.12931597098826983, 0.041856644442573206, 0.1245172436189224, 0.037785379486995396, -0.06078502679139607, -0.29334357142135126, 0.3248915393377573, 0.0326123404904582, 0.3458427583824517, 1.7927617289572268e-05, 0.12023894809195042, -0.04469726259566947, -0.02161739047397838, 0.061144394668630295, -0.06704530707374189, 0.09467712539990651, 0.23893759596185485, 0.15554390558683256, 0.25935578666743286, -0.43187269515224863, -0.213840476966845, 0.1176462073350102, 0.15243662724567553, 0.09346230121707375, -0.04801134724429624, -0.30235237039385304, 0.11937052869422507, -0.11017966650915655, -0.010308092872049951, -0.1571020112278515, -0.01273809618333758, 0.0034498534238283536, -0.2549030934320977, 0.05134560183870331, 0.09134493830714649, 0.043607134140238236, -0.04654639458266615, -0.11009390334585845, -0.015489584237362863, 0.17568551358087675, 0.023931258933700208, 0.026913122082996066, 0.15256665865161073, -0.18846800108088158, -0.08847986468304944, 0.36969953263393057, -0.028465918687825126, -0.22918081606635266, 0.17781033101148286, -0.09125490104436257, -0.1361868983748356, 0.08033170316621559, 0.2393443196891777, 0.10605856263795481, -0.11249128084783742, 0.005791086227148084, -0.051496587180820064, 0.21411518545280542, 0.05555488145266432, 0.027487398861276525, 0.1751076581025247, 0.1842048892033531, 0.024739875934839953, 0.1425569054846596, -0.1583332873726358, -0.013429872455850055, -0.19984757103034498, -0.06725819979060424, -0.1861434939364615, 0.01148649440169783, -0.09557493221554433, -0.18396520560674642, 0.40051214887507364, 0.232768484977104, 0.28444052201991876, 0.09289875148027311, 0.3251105063521917, 0.028403708455903877, 0.19427511750340618, 0.03887454079129317, 0.20777860389269184, 0.01547168140527084, 0.0760722628919073, -0.1501635676759514, 0.08316813818337868, 0.033423569300190505]
|
1,803.0774
|
New measurements of excitation functions of 186W(p,x) nuclear reactions
up to 65 MeV. Production of 178W/178mTa generator
|
New experimental excitation functions for proton induced reactions on natW
are presented in the 32- 65 MeV energy range. The cross sections for
natW(p,xn)186,184,183,182m,182g,181Re, naW(p,x)178W,
natW(p,x)183,182,180m,177,176,175Ta, 175Hf, 177Lu were measured via an
activation method by using a stacked-foil irradiation technique and high
resolution gamma-ray spectrometry. The results were compared with predicted
values obtained with the nuclear reaction model code TALYS (results taken from
TENDL-2014 and TENDL-2015 on-line library). Production routes of the medically
relevant radionuclides 186Re, 178W 178Ta and 181W are discussed.
|
nucl-ex
|
new experimental excitation functions for proton induced reactions on natw are presented in the 32 65 mev energy range the cross sections for natwpxn186184183182m182g181re nawpx178w natwpx183182180m177176175ta 175hf 177lu were measured via an activation method by using a stackedfoil irradiation technique and high resolution gammaray spectrometry the results were compared with predicted values obtained with the nuclear reaction model code talys results taken from tendl2014 and tendl2015 online library production routes of the medically relevant radionuclides 186re 178w 178ta and 181w are discussed
|
[['new', 'experimental', 'excitation', 'functions', 'for', 'proton', 'induced', 'reactions', 'on', 'natw', 'are', 'presented', 'in', 'the', '32', '65', 'mev', 'energy', 'range', 'the', 'cross', 'sections', 'for', 'natwpxn186184183182m182g181re', 'nawpx178w', 'natwpx183182180m177176175ta', '175hf', '177lu', 'were', 'measured', 'via', 'an', 'activation', 'method', 'by', 'using', 'a', 'stackedfoil', 'irradiation', 'technique', 'and', 'high', 'resolution', 'gammaray', 'spectrometry', 'the', 'results', 'were', 'compared', 'with', 'predicted', 'values', 'obtained', 'with', 'the', 'nuclear', 'reaction', 'model', 'code', 'talys', 'results', 'taken', 'from', 'tendl2014', 'and', 'tendl2015', 'online', 'library', 'production', 'routes', 'of', 'the', 'medically', 'relevant', 'radionuclides', '186re', '178w', '178ta', 'and', '181w', 'are', 'discussed']]
|
[0.048784932260074326, 0.17449921692546136, -0.013350248120086445, 0.09156195287643051, 0.05250969946477248, -0.11795058988925144, 0.026082771783065353, 0.42138641518918246, -0.1941819474654826, -0.3651541561844784, 0.011964749549578473, -0.3622098347876926, 0.01442436345324323, 0.3186122743661415, 0.07099113208273225, 0.1343281267486541, 0.14537626928083497, -0.029513309615336963, -0.002934949913036984, -0.18123679557764852, 0.24934226843981525, 0.18986326578148716, 0.2527510058638212, 0.15344803262426443, 0.06563196236871786, 0.010727148945128696, -0.07247135852624008, -0.08564915339386947, -0.17207231131740972, 0.11716198551407983, 0.27918637383766975, 0.10076928466583628, 0.09237184620311333, -0.3916616386016579, -0.1997051146384832, 0.019835713621530984, 0.07499151787645109, 0.08098047136996142, -0.13407568476395682, -0.29731185089897466, 0.0932719705727052, -0.22137610469567212, -0.047347074085091416, -0.06515618102197107, -0.024635255468908598, 0.10452652905715278, -0.28216996840578884, 0.04756396759704158, -0.12628842711549354, 0.117313049761956, -0.18292794402726498, -0.2670816756357011, -0.03656936627560975, 0.060739803952290804, 0.029877860103796765, 0.04585372819132612, 0.21683869111930598, -0.061324930265294134, -0.14355991395643433, 0.34851265171341395, -0.04181263325232509, -0.09900715302776646, 0.13240899589869218, -0.10548740644888902, -0.11541842476848664, 0.22972840596795888, 0.16125616227352135, 0.13663015075380336, -0.2109929697864966, 0.01982225733887832, 0.05342879205489078, 0.1637778851593769, 0.11166147263468923, -0.024489787633757334, 0.08915753786867434, 0.19344464359282693, -0.11717141770782906, 0.07963999227236805, -0.16661769576760865, -0.04352133664478724, -0.2777251421499091, -0.07128202867366977, -0.08654490064175145, 0.037507669701291296, -0.02087598251170208, -0.02059952657657197, 0.341610260483985, 0.045802418010410025, 0.2222531828525904, 0.010698350492512455, 0.27504061515493367, 0.08356593190566511, 0.10204570207153321, 0.0361175066539766, 0.24788715280089024, 0.15848090872483178, 0.13001747661572252, -0.22091138826972628, 0.09514061270936115, 0.006439006588472104]
|
1,803.07741
|
A Distributed Stochastic Gradient Tracking Method
|
In this paper, we study the problem of distributed multi-agent optimization
over a network, where each agent possesses a local cost function that is smooth
and strongly convex. The global objective is to find a common solution that
minimizes the average of all cost functions. Assuming agents only have access
to unbiased estimates of the gradients of their local cost functions, we
consider a distributed stochastic gradient tracking method. We show that, in
expectation, the iterates generated by each agent are attracted to a
neighborhood of the optimal solution, where they accumulate exponentially fast
(under a constant step size choice). More importantly, the limiting (expected)
error bounds on the distance of the iterates from the optimal solution decrease
with the network size, which is a comparable performance to a centralized
stochastic gradient algorithm. Numerical examples further demonstrate the
effectiveness of the method.
|
math.OC cs.DC cs.MA
|
in this paper we study the problem of distributed multiagent optimization over a network where each agent possesses a local cost function that is smooth and strongly convex the global objective is to find a common solution that minimizes the average of all cost functions assuming agents only have access to unbiased estimates of the gradients of their local cost functions we consider a distributed stochastic gradient tracking method we show that in expectation the iterates generated by each agent are attracted to a neighborhood of the optimal solution where they accumulate exponentially fast under a constant step size choice more importantly the limiting expected error bounds on the distance of the iterates from the optimal solution decrease with the network size which is a comparable performance to a centralized stochastic gradient algorithm numerical examples further demonstrate the effectiveness of the method
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'distributed', 'multiagent', 'optimization', 'over', 'a', 'network', 'where', 'each', 'agent', 'possesses', 'a', 'local', 'cost', 'function', 'that', 'is', 'smooth', 'and', 'strongly', 'convex', 'the', 'global', 'objective', 'is', 'to', 'find', 'a', 'common', 'solution', 'that', 'minimizes', 'the', 'average', 'of', 'all', 'cost', 'functions', 'assuming', 'agents', 'only', 'have', 'access', 'to', 'unbiased', 'estimates', 'of', 'the', 'gradients', 'of', 'their', 'local', 'cost', 'functions', 'we', 'consider', 'a', 'distributed', 'stochastic', 'gradient', 'tracking', 'method', 'we', 'show', 'that', 'in', 'expectation', 'the', 'iterates', 'generated', 'by', 'each', 'agent', 'are', 'attracted', 'to', 'a', 'neighborhood', 'of', 'the', 'optimal', 'solution', 'where', 'they', 'accumulate', 'exponentially', 'fast', 'under', 'a', 'constant', 'step', 'size', 'choice', 'more', 'importantly', 'the', 'limiting', 'expected', 'error', 'bounds', 'on', 'the', 'distance', 'of', 'the', 'iterates', 'from', 'the', 'optimal', 'solution', 'decrease', 'with', 'the', 'network', 'size', 'which', 'is', 'a', 'comparable', 'performance', 'to', 'a', 'centralized', 'stochastic', 'gradient', 'algorithm', 'numerical', 'examples', 'further', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'method']]
|
[-0.13074237168815747, 0.0019288163314061895, -0.08136426896499602, 0.02682634623570394, -0.0506693562984624, -0.12426314275042796, 0.08394879197888733, 0.41323260865895683, -0.32387643955192125, -0.25566939209443584, 0.10931190315299523, -0.26476480348796494, -0.17485328334626335, 0.1642368570507937, -0.09946115316600132, 0.08524171957536272, 0.08384926308235022, 0.0619812183816668, -0.07874386149178207, -0.29589444666635245, 0.2691887231653517, 0.0491857202494071, 0.27812866692129573, -0.009819360894665882, 0.16071412003759794, -0.026489351971179877, 0.02151391532396714, 0.05741719504929817, -0.09255942479705456, 0.14126394287778168, 0.23160644125809868, 0.1681738170519681, 0.4157053016086804, -0.4027354504821271, -0.17143845125954127, 0.16663610102595683, 0.13862360900056445, 0.09147246207133539, -0.06159173194485024, -0.2238289681361647, 0.1285726238242154, -0.13412742645637146, -0.09913235551572706, -0.034488059048668786, -0.025550031155662636, 0.09651663462946218, -0.35827117196848274, 0.05143474711393806, 0.025397932360237335, -0.0013908250322958954, -0.07962895485467579, -0.10595939185103061, -0.009529288479415568, 0.11145204660469588, 0.06733774927421801, 0.06902152277048822, 0.17876105562744427, -0.12140873674480376, -0.09689682438759736, 0.32494796134374093, -0.0626994358821654, -0.2512027514724612, 0.15941583400946374, -0.09076080999573247, -0.09716549782987527, 0.14975497553544775, 0.23232335214253882, 0.17273352689988597, -0.15185984891091645, 0.0967186212807756, -0.06504726884550494, 0.17518978367205446, 0.007256097458696491, 0.030368878083093694, 0.1120598858884785, 0.1708865287536624, 0.2419558767521177, 0.15035892332064538, -0.03252539652093104, -0.14908812180633696, -0.2874219997090773, -0.1434401346987087, -0.22210777576924237, 0.020071962825350568, -0.1536201160550929, -0.17108567767287933, 0.3966444598012407, 0.157882167321538, 0.21645131166434098, 0.1532256564586161, 0.32367519366646735, 0.1333433071513739, 0.04982870108854603, 0.16643967337801424, 0.2127068534650853, 0.0343700231718634, 0.061981020271482966, -0.25441315411557247, 0.13036659425518043, 0.07539284779545917]
|
1,803.07742
|
Fast Semantic Segmentation on Video Using Block Motion-Based Feature
Interpolation
|
Convolutional networks optimized for accuracy on challenging, dense
prediction tasks are prohibitively slow to run on each frame in a video. The
spatial similarity of nearby video frames, however, suggests opportunity to
reuse computation. Existing work has explored basic feature reuse and feature
warping based on optical flow, but has encountered limits to the speedup
attainable with these techniques. In this paper, we present a new, two part
approach to accelerating inference on video. First, we propose a fast feature
propagation technique that utilizes the block motion vectors present in
compressed video (e.g. H.264 codecs) to cheaply propagate features from frame
to frame. Second, we develop a novel feature estimation scheme, termed feature
interpolation, that fuses features propagated from enclosing keyframes to
render accurate feature estimates, even at sparse keyframe frequencies. We
evaluate our system on the Cityscapes and CamVid datasets, comparing to both a
frame-by-frame baseline and related work. We find that we are able to
substantially accelerate segmentation on video, achieving near real-time frame
rates (20.1 frames per second) on large images (960 x 720 pixels), while
maintaining competitive accuracy. This represents an improvement of almost 6x
over the single-frame baseline and 2.5x over the fastest prior work.
|
cs.CV
|
convolutional networks optimized for accuracy on challenging dense prediction tasks are prohibitively slow to run on each frame in a video the spatial similarity of nearby video frames however suggests opportunity to reuse computation existing work has explored basic feature reuse and feature warping based on optical flow but has encountered limits to the speedup attainable with these techniques in this paper we present a new two part approach to accelerating inference on video first we propose a fast feature propagation technique that utilizes the block motion vectors present in compressed video eg h264 codecs to cheaply propagate features from frame to frame second we develop a novel feature estimation scheme termed feature interpolation that fuses features propagated from enclosing keyframes to render accurate feature estimates even at sparse keyframe frequencies we evaluate our system on the cityscapes and camvid datasets comparing to both a framebyframe baseline and related work we find that we are able to substantially accelerate segmentation on video achieving near realtime frame rates 201 frames per second on large images 960 x 720 pixels while maintaining competitive accuracy this represents an improvement of almost 6x over the singleframe baseline and 25x over the fastest prior work
|
[['convolutional', 'networks', 'optimized', 'for', 'accuracy', 'on', 'challenging', 'dense', 'prediction', 'tasks', 'are', 'prohibitively', 'slow', 'to', 'run', 'on', 'each', 'frame', 'in', 'a', 'video', 'the', 'spatial', 'similarity', 'of', 'nearby', 'video', 'frames', 'however', 'suggests', 'opportunity', 'to', 'reuse', 'computation', 'existing', 'work', 'has', 'explored', 'basic', 'feature', 'reuse', 'and', 'feature', 'warping', 'based', 'on', 'optical', 'flow', 'but', 'has', 'encountered', 'limits', 'to', 'the', 'speedup', 'attainable', 'with', 'these', 'techniques', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'two', 'part', 'approach', 'to', 'accelerating', 'inference', 'on', 'video', 'first', 'we', 'propose', 'a', 'fast', 'feature', 'propagation', 'technique', 'that', 'utilizes', 'the', 'block', 'motion', 'vectors', 'present', 'in', 'compressed', 'video', 'eg', 'h264', 'codecs', 'to', 'cheaply', 'propagate', 'features', 'from', 'frame', 'to', 'frame', 'second', 'we', 'develop', 'a', 'novel', 'feature', 'estimation', 'scheme', 'termed', 'feature', 'interpolation', 'that', 'fuses', 'features', 'propagated', 'from', 'enclosing', 'keyframes', 'to', 'render', 'accurate', 'feature', 'estimates', 'even', 'at', 'sparse', 'keyframe', 'frequencies', 'we', 'evaluate', 'our', 'system', 'on', 'the', 'cityscapes', 'and', 'camvid', 'datasets', 'comparing', 'to', 'both', 'a', 'framebyframe', 'baseline', 'and', 'related', 'work', 'we', 'find', 'that', 'we', 'are', 'able', 'to', 'substantially', 'accelerate', 'segmentation', 'on', 'video', 'achieving', 'near', 'realtime', 'frame', 'rates', '201', 'frames', 'per', 'second', 'on', 'large', 'images', '960', 'x', '720', 'pixels', 'while', 'maintaining', 'competitive', 'accuracy', 'this', 'represents', 'an', 'improvement', 'of', 'almost', '6x', 'over', 'the', 'singleframe', 'baseline', 'and', '25x', 'over', 'the', 'fastest', 'prior', 'work']]
|
[-0.08577466640505009, -0.021846320755357737, -0.052119707993697376, 0.015006954715354369, -0.08920055419555865, -0.15109935439220862, 0.044091164438868874, 0.5064838742651046, -0.2577316556102596, -0.31916008492931724, 0.08403350181004499, -0.25245820574462413, -0.11821463867090642, 0.2086097375524696, -0.14124718165243394, 0.09128256103169406, 0.16896989522210787, 0.049570223863702266, -0.09928136991104111, -0.28277789351763205, 0.22757178558968008, 0.09611259189900011, 0.36143864384153856, -0.011623127878410742, 0.17109494925825858, -0.03352318535151426, -0.08942086156806908, -0.03411811787635088, -0.05781740904170874, 0.18787516287877223, 0.29380979223758913, 0.17545705189637373, 0.29110827557276936, -0.39816828543931476, -0.23008583732531407, 0.04077597412513569, 0.17915088093279338, 0.11813098480684857, -0.04234997018647846, -0.3153555045009125, 0.11048734828538727, -0.14259702701121568, 0.026586148967035116, -0.13547866874258033, -0.014890433214022778, -0.04518709184456384, -0.30087120439857246, 0.08232060703216121, 0.0389942875385168, 0.03159793212544173, -0.05374487190740183, -0.0979915571102174, 0.08379790985607542, 0.15561803554417566, 0.01801278811879456, 0.09928496415726841, 0.14033408771123504, -0.14117525210222084, -0.10372525440412574, 0.4092875086516142, -0.1106182697264012, -0.18376021251111524, 0.22023755375645124, -0.05068433074789937, -0.13128822013502942, 0.1677294752956368, 0.26607384950388224, 0.14004675746276918, -0.12839479086338543, -0.03195774509338662, -0.02112559021450579, 0.22013245256850497, 0.12211023996118456, 0.04782018777215853, 0.17212886695284396, 0.2318566192034632, 0.0642857479173108, 0.11067264156183228, -0.19480205410975032, -0.0657868196896743, -0.21086034017149358, -0.09730679547756153, -0.1802481676498428, -0.05617840482271277, -0.10292342684435425, -0.11576199658680707, 0.417104382696034, 0.2507952691684477, 0.22886768521973863, 0.11715777073521166, 0.3708077731076628, -0.008163525601266883, 0.12162330034188926, 0.1350958248367533, 0.19875151396088767, -0.01975314955227077, 0.13699059373349884, -0.1477782825878239, 0.027463506929343566, 0.09163264887902187]
|
1,803.07743
|
A Supplementary Condition for the Convergence of the Control Policy
during Adaptive Dynamic Programming
|
Reinforcement learning based adaptive/approximate dynamic programming (ADP)
is a powerful technique to determine an approximate optimal controller for a
dynamical system. These methods bypass the need to analytically solve the
nonlinear Hamilton-Jacobi-Bellman equation, whose solution is often to
difficult to determine but is needed to determine the optimal control policy.
ADP methods usually employ a policy iteration algorithm that evaluates and
improves a value function at every step to find the optimal control policy.
Previous works in ADP have been lacking a stronger condition that ensures the
convergence of the policy iteration algorithm. This paper provides a sufficient
but not necessary condition that guarantees the convergence of an ADP
algorithm. This condition may provide a more solid theoretical framework for
ADP-based control algorithm design for nonlinear dynamical systems.
|
math.OC
|
reinforcement learning based adaptiveapproximate dynamic programming adp is a powerful technique to determine an approximate optimal controller for a dynamical system these methods bypass the need to analytically solve the nonlinear hamiltonjacobibellman equation whose solution is often to difficult to determine but is needed to determine the optimal control policy adp methods usually employ a policy iteration algorithm that evaluates and improves a value function at every step to find the optimal control policy previous works in adp have been lacking a stronger condition that ensures the convergence of the policy iteration algorithm this paper provides a sufficient but not necessary condition that guarantees the convergence of an adp algorithm this condition may provide a more solid theoretical framework for adpbased control algorithm design for nonlinear dynamical systems
|
[['reinforcement', 'learning', 'based', 'adaptiveapproximate', 'dynamic', 'programming', 'adp', 'is', 'a', 'powerful', 'technique', 'to', 'determine', 'an', 'approximate', 'optimal', 'controller', 'for', 'a', 'dynamical', 'system', 'these', 'methods', 'bypass', 'the', 'need', 'to', 'analytically', 'solve', 'the', 'nonlinear', 'hamiltonjacobibellman', 'equation', 'whose', 'solution', 'is', 'often', 'to', 'difficult', 'to', 'determine', 'but', 'is', 'needed', 'to', 'determine', 'the', 'optimal', 'control', 'policy', 'adp', 'methods', 'usually', 'employ', 'a', 'policy', 'iteration', 'algorithm', 'that', 'evaluates', 'and', 'improves', 'a', 'value', 'function', 'at', 'every', 'step', 'to', 'find', 'the', 'optimal', 'control', 'policy', 'previous', 'works', 'in', 'adp', 'have', 'been', 'lacking', 'a', 'stronger', 'condition', 'that', 'ensures', 'the', 'convergence', 'of', 'the', 'policy', 'iteration', 'algorithm', 'this', 'paper', 'provides', 'a', 'sufficient', 'but', 'not', 'necessary', 'condition', 'that', 'guarantees', 'the', 'convergence', 'of', 'an', 'adp', 'algorithm', 'this', 'condition', 'may', 'provide', 'a', 'more', 'solid', 'theoretical', 'framework', 'for', 'adpbased', 'control', 'algorithm', 'design', 'for', 'nonlinear', 'dynamical', 'systems']]
|
[-0.10187344029009904, -0.039232075847971754, -0.16710172127562736, 0.08292882366287005, -0.15300436901106013, -0.22976479687291892, 0.1021897478014349, 0.40641661419991465, -0.31708251737383386, -0.2971481737858128, 0.1364750025954674, -0.16377908168342112, -0.1997079044896444, 0.20622353827107756, -0.10392321441470394, 0.15601581789641863, 0.05276969439693771, 0.01580281203842744, -0.05900665592136128, -0.2324396666021101, 0.250797373889428, 0.06914257462180796, 0.29586275503231535, 0.03180615879624846, 0.17059822924553403, -0.03364669559856078, 0.05404369111934174, 0.005439202680015966, -0.16193207526492417, 0.11770337235389484, 0.3030156781453462, 0.20142282449477722, 0.42525429771621787, -0.4022937909769733, -0.1625162428023205, 0.1260135920814401, 0.1671642415181157, 0.15418985090772844, -0.04785927659557072, -0.18864829071043504, 0.14117848798854365, -0.1422610694546223, -0.11099460397270464, -0.1370160977877233, -0.03527914784804341, -0.008532681780505098, -0.39242886283641887, 0.010728212561280955, 0.05519934418742427, 0.009461159544390819, -0.1053520441387913, -0.080495249320169, 0.039782083600700374, 0.10793897298918594, 0.030233505151565105, 0.06766712640149755, 0.1547934859875582, -0.0833792475251747, -0.15990092495958957, 0.345380267468355, 0.0115097416084378, -0.23757323182173193, 0.15452280906971455, -0.019342852889427116, -0.16406918012829025, 0.18554901991349956, 0.20645848945538986, 0.1747104862985748, -0.22045800000676766, 0.05051401282969256, -0.041368011629120224, 0.19922709221848184, -0.011349402255349098, -0.020684833194883095, 0.059073898446051376, 0.2040396748805448, 0.2402542006494182, 0.11144482434195067, 0.02307895026982777, -0.1262318186521057, -0.24353672235110213, -0.11574119319843632, -0.15188792684773308, -0.02708256460662972, -0.08748490588232738, -0.16634575565094276, 0.32443977282049935, 0.20594346754360088, 0.1261971342533971, 0.1447438508113255, 0.3442027154304678, 0.1947029769094476, 0.02891874064863216, 0.14410281465536665, 0.24854099318858178, 0.09124079184784066, 0.14269859131632578, -0.2860592374215937, 0.15420841795229723, 0.11770008113752636]
|
1,803.07744
|
Passivity and Evolutionary Game Dynamics
|
This paper investigates an energy conservation and dissipation -- passivity
-- aspect of dynamic models in evolutionary game theory. We define a notion of
passivity using the state-space representation of the models, and we devise
systematic methods to examine passivity and to identify properties of passive
dynamic models. Based on the methods, we describe how passivity is connected to
stability in population games and illustrate stability of passive dynamic
models using numerical simulations.
|
math.OC
|
this paper investigates an energy conservation and dissipation passivity aspect of dynamic models in evolutionary game theory we define a notion of passivity using the statespace representation of the models and we devise systematic methods to examine passivity and to identify properties of passive dynamic models based on the methods we describe how passivity is connected to stability in population games and illustrate stability of passive dynamic models using numerical simulations
|
[['this', 'paper', 'investigates', 'an', 'energy', 'conservation', 'and', 'dissipation', 'passivity', 'aspect', 'of', 'dynamic', 'models', 'in', 'evolutionary', 'game', 'theory', 'we', 'define', 'a', 'notion', 'of', 'passivity', 'using', 'the', 'statespace', 'representation', 'of', 'the', 'models', 'and', 'we', 'devise', 'systematic', 'methods', 'to', 'examine', 'passivity', 'and', 'to', 'identify', 'properties', 'of', 'passive', 'dynamic', 'models', 'based', 'on', 'the', 'methods', 'we', 'describe', 'how', 'passivity', 'is', 'connected', 'to', 'stability', 'in', 'population', 'games', 'and', 'illustrate', 'stability', 'of', 'passive', 'dynamic', 'models', 'using', 'numerical', 'simulations']]
|
[-0.13874878801903884, 0.018739508184756833, -0.158816987720751, 0.07442229334264994, -0.05545693331621063, -0.11727296996494414, 0.05532000974004327, 0.37657081023593186, -0.29685387980770056, -0.30846908234689435, 0.10150111405323194, -0.19302117609432046, -0.21945157363800935, 0.09792037525306076, -0.1363636473141296, 0.06241575569491571, 0.0056969582982046504, -0.040803317925040154, -0.03692531676202173, -0.16912220943141992, 0.36571244759695, 0.048093362042391806, 0.27481563053500485, 0.0018972593661345228, 0.12654110797169343, -0.020861906140491788, -0.06188518769094642, 0.0663706505159572, -0.20782922163710627, 0.12976625927684593, 0.2212428985924778, 0.17718699584308434, 0.3455068167220329, -0.45037289470119374, -0.22189065481824669, 0.125760786983014, 0.11852506070699491, 0.10330632223393506, -0.03855621705362967, -0.2332689095629563, 0.12543192532726785, -0.19302105174308093, -0.10936841171916942, -0.12040609889991687, -0.03891441166978067, 0.06287517453688131, -0.26527248907991696, 0.04840323878583354, 0.056384938716573615, 0.09779140980205905, -0.11994061580347554, -0.03792413948497302, -0.02843534432574582, 0.11135138954449131, -0.008055700530284936, -0.14442477677620844, 0.1576735396659605, -0.13413050306737948, -0.1999229655771608, 0.3559033188798373, -0.026108711197132796, -0.22983390245009477, 0.23838062599157048, -0.04353649270209208, -0.15612529257548527, 0.021753862519866565, 0.27128488529132494, 0.13807541032938261, -0.1773090557470708, 0.04921502567184958, -0.015271226429498531, 0.20692582633083975, -0.056214692887627114, 0.035490250660919806, 0.1454382793269527, 0.2562327501691983, 0.06863556730783951, 0.1629721792808301, -0.014093798267143503, -0.1977840789633108, -0.2543939797496292, -0.10531140664513682, -0.08179100923909163, 0.0057415713188828715, -0.06937965483021018, -0.1684500127374916, 0.4239425393949512, 0.2413931386151784, 0.10437824897153276, 0.1341369443402534, 0.33874122108149174, 0.14786648876230482, -0.005378893543769356, 0.07861792510637725, 0.2575480480363566, 0.21042676802567192, 0.1142394691902462, -0.2708481243339328, 0.04897079131775864, 0.10838038455301398]
|
1,803.07745
|
Formation of S0s via disc accretion around high-redshift compact
ellipticals
|
We present hydrodynamical N-body models which demonstrate that elliptical
galaxies can transform into S0s by acquiring a disc. In particular, we show
that the merger with a massive gas-rich satellite can lead to the formation of
a baryonic disc around an elliptical. We model the elliptical as a massive,
compact galaxy which could be observed as a 'red nugget' in the high-z
universe. This scenario contrasts with existing S0 formation scenarios in the
literature in two important ways. First, the progenitor is an elliptical galaxy
whereas scenarios in the literature typically assume a spiral progenitor.
Second, the physical conditions underlying our proposed scenario can exist in
low-density environments such as the field, in contrast to scenarios in the
literature which typically address dense environments like clusters and groups.
As a consequence, S0s in the field may be the most likely candidates to have
evolved from elliptical progenitors. Our scenario also naturally explains
recent observations which indicate that field S0s may have older bulges than
discs, contrary to cluster S0s which seem to have older discs than bulges.
|
astro-ph.GA
|
we present hydrodynamical nbody models which demonstrate that elliptical galaxies can transform into s0s by acquiring a disc in particular we show that the merger with a massive gasrich satellite can lead to the formation of a baryonic disc around an elliptical we model the elliptical as a massive compact galaxy which could be observed as a red nugget in the highz universe this scenario contrasts with existing s0 formation scenarios in the literature in two important ways first the progenitor is an elliptical galaxy whereas scenarios in the literature typically assume a spiral progenitor second the physical conditions underlying our proposed scenario can exist in lowdensity environments such as the field in contrast to scenarios in the literature which typically address dense environments like clusters and groups as a consequence s0s in the field may be the most likely candidates to have evolved from elliptical progenitors our scenario also naturally explains recent observations which indicate that field s0s may have older bulges than discs contrary to cluster s0s which seem to have older discs than bulges
|
[['we', 'present', 'hydrodynamical', 'nbody', 'models', 'which', 'demonstrate', 'that', 'elliptical', 'galaxies', 'can', 'transform', 'into', 's0s', 'by', 'acquiring', 'a', 'disc', 'in', 'particular', 'we', 'show', 'that', 'the', 'merger', 'with', 'a', 'massive', 'gasrich', 'satellite', 'can', 'lead', 'to', 'the', 'formation', 'of', 'a', 'baryonic', 'disc', 'around', 'an', 'elliptical', 'we', 'model', 'the', 'elliptical', 'as', 'a', 'massive', 'compact', 'galaxy', 'which', 'could', 'be', 'observed', 'as', 'a', 'red', 'nugget', 'in', 'the', 'highz', 'universe', 'this', 'scenario', 'contrasts', 'with', 'existing', 's0', 'formation', 'scenarios', 'in', 'the', 'literature', 'in', 'two', 'important', 'ways', 'first', 'the', 'progenitor', 'is', 'an', 'elliptical', 'galaxy', 'whereas', 'scenarios', 'in', 'the', 'literature', 'typically', 'assume', 'a', 'spiral', 'progenitor', 'second', 'the', 'physical', 'conditions', 'underlying', 'our', 'proposed', 'scenario', 'can', 'exist', 'in', 'lowdensity', 'environments', 'such', 'as', 'the', 'field', 'in', 'contrast', 'to', 'scenarios', 'in', 'the', 'literature', 'which', 'typically', 'address', 'dense', 'environments', 'like', 'clusters', 'and', 'groups', 'as', 'a', 'consequence', 's0s', 'in', 'the', 'field', 'may', 'be', 'the', 'most', 'likely', 'candidates', 'to', 'have', 'evolved', 'from', 'elliptical', 'progenitors', 'our', 'scenario', 'also', 'naturally', 'explains', 'recent', 'observations', 'which', 'indicate', 'that', 'field', 's0s', 'may', 'have', 'older', 'bulges', 'than', 'discs', 'contrary', 'to', 'cluster', 's0s', 'which', 'seem', 'to', 'have', 'older', 'discs', 'than', 'bulges']]
|
[-0.08383801060933936, 0.06507609168604926, -0.14048300398576816, 0.13980926443312297, -0.10584243903420655, -0.03358811138744997, -0.03644849757116688, 0.41932176709264557, -0.11727217157926452, -0.33028571393951184, 0.07413112207534223, -0.21024862810506323, -0.13706543744873192, 0.1889503789200095, -0.08194466149118745, -0.05972936229798732, 0.06753090264914968, -0.07589796920554281, -0.04668285979331592, -0.3291992334054394, 0.3368803238138388, 0.022258223071273436, 0.15183478231294512, -0.14252791705799137, -0.014308402227963937, -0.12616442272828965, -0.01373099219738006, -0.021654868345854984, -0.125477899578201, 0.004816788105665059, 0.28170824949169615, 0.10505827974612261, 0.26577657358036877, -0.4400024060580858, -0.25645312217543015, 0.13066509881419902, 0.2903359005606528, 0.10830063936839901, -0.1385422063712557, -0.2762595270839283, 0.10472647727882795, -0.20418739711305411, -0.14530433749643254, 0.07505936469451266, 0.0133911629502088, 0.002733477943782079, -0.2477446710506696, 0.16788478063976545, 0.07490049187346536, -0.008680498637890412, -0.08621589796049363, -0.08981414010227358, -0.047902277852329665, 0.027166268217382626, 0.045801807101552856, 0.06843430451827787, 0.22070445614935313, -0.15584019921577963, -0.06710393697097056, 0.43506178607122376, -0.015842968580414316, -0.05402325046653886, 0.30855454634980295, -0.2007645387084113, -0.17621907518024288, 0.05064660656308008, 0.18480061231928188, 0.07776231464856215, -0.13775279028157014, 0.006086806574307571, -0.07570779611261845, 0.16941393421841838, 0.028900418612095764, 0.05251654212795182, 0.35032647521377114, 0.11182094773009293, 0.02097690669361944, 0.09266702724241857, -0.10988593206735654, -0.09006469952413486, -0.20571974084559974, -0.11497983169126308, -0.11986999015065994, 0.06458470219809373, -0.12280106897284027, -0.1217960573951214, 0.3004055788403766, 0.11234427215452543, 0.2632079110770239, 0.037387889162058506, 0.32795151348336266, 0.047966358333426176, 0.17899912843575416, 0.11497008837075473, 0.28105276240572585, 0.12028818388369544, 0.05685953699094427, -0.18687903465644592, 0.08292012048509013, -0.052595201597251735]
|
1,803.07746
|
Measuring Small Longitudinal Phase Shifts via Weak Measurement
Amplification
|
Weak measurement amplification, which is considered as a very promising
scheme in precision measurement, has been applied to various small physical
quantities estimation. Since many quantities can be converted to phase signal,
it is thus interesting and important to consider measuring ultra-small
longitudinal phase shifts by using weak measurement. Here, we propose and
experimentally demonstrate a novel weak measurement amplification based
ultra-small longitudinal phase estimation, which is suitable for polarization
interferometry. We realize one order of magnitude amplification measurement of
small phase signal directly introduced by Liquid Crystal Variable Retarder and
show its robust to finite visibility of interference. Our results may find
important applications in high-precision measurements, such as gravitational
waves detection.
|
quant-ph
|
weak measurement amplification which is considered as a very promising scheme in precision measurement has been applied to various small physical quantities estimation since many quantities can be converted to phase signal it is thus interesting and important to consider measuring ultrasmall longitudinal phase shifts by using weak measurement here we propose and experimentally demonstrate a novel weak measurement amplification based ultrasmall longitudinal phase estimation which is suitable for polarization interferometry we realize one order of magnitude amplification measurement of small phase signal directly introduced by liquid crystal variable retarder and show its robust to finite visibility of interference our results may find important applications in highprecision measurements such as gravitational waves detection
|
[['weak', 'measurement', 'amplification', 'which', 'is', 'considered', 'as', 'a', 'very', 'promising', 'scheme', 'in', 'precision', 'measurement', 'has', 'been', 'applied', 'to', 'various', 'small', 'physical', 'quantities', 'estimation', 'since', 'many', 'quantities', 'can', 'be', 'converted', 'to', 'phase', 'signal', 'it', 'is', 'thus', 'interesting', 'and', 'important', 'to', 'consider', 'measuring', 'ultrasmall', 'longitudinal', 'phase', 'shifts', 'by', 'using', 'weak', 'measurement', 'here', 'we', 'propose', 'and', 'experimentally', 'demonstrate', 'a', 'novel', 'weak', 'measurement', 'amplification', 'based', 'ultrasmall', 'longitudinal', 'phase', 'estimation', 'which', 'is', 'suitable', 'for', 'polarization', 'interferometry', 'we', 'realize', 'one', 'order', 'of', 'magnitude', 'amplification', 'measurement', 'of', 'small', 'phase', 'signal', 'directly', 'introduced', 'by', 'liquid', 'crystal', 'variable', 'retarder', 'and', 'show', 'its', 'robust', 'to', 'finite', 'visibility', 'of', 'interference', 'our', 'results', 'may', 'find', 'important', 'applications', 'in', 'highprecision', 'measurements', 'such', 'as', 'gravitational', 'waves', 'detection']]
|
[-0.15557808610322202, 0.19674675749713735, -0.07565854355462093, 0.0340764461424144, -0.08428304029249511, -0.18269296498573592, 0.023670411153605818, 0.3807061988431796, -0.27854137219472136, -0.32540188468498205, 0.12860036269757502, -0.22366325931409292, -0.1380333118511578, 0.23337190798112908, -0.02298941092763459, 0.1204390717599236, 0.048875909574758424, -0.026320136226383985, -0.06535986242238927, -0.13890620914650503, 0.23419154173307186, 0.06278363215547483, 0.3526973068545185, 0.05195645189151761, 0.14494592172662374, 0.032226214422308636, -0.033431903751715356, 0.04675714415704123, -0.09825766693586402, 0.03342877796323624, 0.2938022537927547, 0.0630120928873168, 0.21287145170556232, -0.3790375765153429, -0.24332116261965273, 0.12645432513322583, 0.14470928097020141, 0.18709788866036167, -0.10464070944642995, -0.3238251539013159, 0.04857384859979878, -0.13453394447791234, -0.08692205896749433, -0.15602658419515444, 0.04191005440939844, -0.0127648840531134, -0.29086955312013096, 0.08174354619082821, -0.01391207360027902, 0.020068363195895094, 0.01932155260037367, -0.06335131874909641, 0.054989316580050615, 0.0978729930475552, -0.0021844057529027353, 0.04841790404747677, 0.14032060460525408, -0.08176542312294179, -0.09480611868697193, 0.3953967646951169, -0.1148210027867071, -0.15706050805170582, 0.1412727924257484, -0.17423439679453068, -0.10757106642312972, 0.1262593146359993, 0.19176901072475944, 0.10551484927238353, -0.14240637379986917, -0.04222332237162668, 0.03373359538515849, 0.19603945562962147, 0.057180616749137374, 0.13076318825586838, 0.2192081803521883, 0.17943290335052045, 0.06808755883846053, 0.15329669457262762, -0.16840027103332422, -0.029857571519070626, -0.265356828466849, -0.13148596129520276, -0.1926231211570578, 0.04298049114454966, -0.07655461065729244, -0.13029471878992574, 0.3711312510212201, 0.2160988738086843, 0.1656838840767906, -0.07270412777336233, 0.3847610280350411, 0.14359874171472722, 0.08879204009107389, -0.048053996756969565, 0.35691845685293055, 0.1871194809930712, 0.07596792867077531, -0.207145849360252, 0.11773714673318035, -0.012606940833868178]
|
1,803.07747
|
More Nonlocality with Less Entanglement in CHSH Experiments using
Inefficient Detectors
|
It is well-known that in certain scenarios weakly entangled states can
generate stronger nonlocal effects than their maximally entangled counterparts.
In this paper, we consider violations of the CHSH Inequality when one party has
inefficient detectors, a scenario known as an asymmetric Bell experiment. %We
show that violations can occur if and only if the detection efficiency is above
$50\%$. For any fixed detection efficiency, we derive a simple upper bound on
the entanglement needed to violate the inequality by more than some specified
amount $\kappa\geq 0$. When $\kappa=0$, the amount of entanglement in all
states violating the inequality goes to zero as the detection efficiency
approaches $50\%$ from above. %This provides another scenario in which weakly
entangled states are advantageous for violating the CHSH Inequality in the
presence of detection inefficiency. We finally consider the scenario in which
detection inefficiency arises for only one choice of local measurement. In this
case, it is shown that the CHSH Inequality can always be violated for any
nonzero detection efficiency and any choice of non-commuting measurements.
|
quant-ph
|
it is wellknown that in certain scenarios weakly entangled states can generate stronger nonlocal effects than their maximally entangled counterparts in this paper we consider violations of the chsh inequality when one party has inefficient detectors a scenario known as an asymmetric bell experiment we show that violations can occur if and only if the detection efficiency is above 50 for any fixed detection efficiency we derive a simple upper bound on the entanglement needed to violate the inequality by more than some specified amount kappageq 0 when kappa0 the amount of entanglement in all states violating the inequality goes to zero as the detection efficiency approaches 50 from above this provides another scenario in which weakly entangled states are advantageous for violating the chsh inequality in the presence of detection inefficiency we finally consider the scenario in which detection inefficiency arises for only one choice of local measurement in this case it is shown that the chsh inequality can always be violated for any nonzero detection efficiency and any choice of noncommuting measurements
|
[['it', 'is', 'wellknown', 'that', 'in', 'certain', 'scenarios', 'weakly', 'entangled', 'states', 'can', 'generate', 'stronger', 'nonlocal', 'effects', 'than', 'their', 'maximally', 'entangled', 'counterparts', 'in', 'this', 'paper', 'we', 'consider', 'violations', 'of', 'the', 'chsh', 'inequality', 'when', 'one', 'party', 'has', 'inefficient', 'detectors', 'a', 'scenario', 'known', 'as', 'an', 'asymmetric', 'bell', 'experiment', 'we', 'show', 'that', 'violations', 'can', 'occur', 'if', 'and', 'only', 'if', 'the', 'detection', 'efficiency', 'is', 'above', '50', 'for', 'any', 'fixed', 'detection', 'efficiency', 'we', 'derive', 'a', 'simple', 'upper', 'bound', 'on', 'the', 'entanglement', 'needed', 'to', 'violate', 'the', 'inequality', 'by', 'more', 'than', 'some', 'specified', 'amount', 'kappageq', '0', 'when', 'kappa0', 'the', 'amount', 'of', 'entanglement', 'in', 'all', 'states', 'violating', 'the', 'inequality', 'goes', 'to', 'zero', 'as', 'the', 'detection', 'efficiency', 'approaches', '50', 'from', 'above', 'this', 'provides', 'another', 'scenario', 'in', 'which', 'weakly', 'entangled', 'states', 'are', 'advantageous', 'for', 'violating', 'the', 'chsh', 'inequality', 'in', 'the', 'presence', 'of', 'detection', 'inefficiency', 'we', 'finally', 'consider', 'the', 'scenario', 'in', 'which', 'detection', 'inefficiency', 'arises', 'for', 'only', 'one', 'choice', 'of', 'local', 'measurement', 'in', 'this', 'case', 'it', 'is', 'shown', 'that', 'the', 'chsh', 'inequality', 'can', 'always', 'be', 'violated', 'for', 'any', 'nonzero', 'detection', 'efficiency', 'and', 'any', 'choice', 'of', 'noncommuting', 'measurements']]
|
[-0.137995613745585, 0.1676135739859698, -0.027737865451958842, 0.09776157927003572, -0.02316409396944332, -0.2543778935843415, 0.06571356385435116, 0.29686998427128314, -0.2221932302055738, -0.3162233221489165, 0.09533475401032523, -0.3112202185639662, -0.08208880271634152, 0.19171421537202538, -0.07676864776294678, 0.03269484510709499, 0.0703617805272512, 0.060111236330335854, -0.05449586111554426, -0.25458303337178095, 0.2922620350660906, 0.03519722169543477, 0.30218513984896844, 0.09515736354367765, 0.046624012114801286, 0.007674183784823479, 0.058983604601670014, 0.013511672979970088, -0.08712700810533482, 0.07177684768992905, 0.23627169200636702, 0.20561497969467235, 0.2556920392310311, -0.3787245856726478, -0.2012428934525313, 0.2387490763185792, 0.11631680388490659, 0.11858392847118493, -0.040500299265523225, -0.29320393071172696, 0.05452503034598783, -0.18221602063149686, -0.12779448951337616, -0.07658954528856209, 0.009856757402805418, -0.0711440804187642, -0.29884592054047804, 0.16141927149949659, 0.07927820377918923, -0.02915528326863343, 0.010663841264964691, -0.04033121851743895, 0.011861343199023228, 0.049155091282432554, 0.005153424229644154, -0.03172773451961834, 0.1249186381451443, -0.15260975354654854, -0.15632085296346795, 0.34287014703169977, -0.05092011532333449, -0.24481189981418736, 0.1754947685122747, -0.17341760667201517, -0.168231833580314, 0.06404863300615515, 0.10782614725256531, 0.16205358134860964, -0.10602386844168477, 0.03690943625239099, -0.08335658186851283, 0.19096084977714237, 0.10266102438835406, 0.10945011132353938, 0.15039911947544965, 0.07507662875203137, 0.17348905348208274, 0.18333367508937787, -0.07132922452151903, -0.08862360889873543, -0.3757763063533756, -0.17436338115340344, -0.21892277488616113, 0.10798102090049577, -0.08222766074030152, -0.05829196878566391, 0.32085627988623133, 0.15470372916242087, 0.14578719756244174, 0.028665775969763684, 0.289523672374051, 0.12576259604599005, 0.07961915822394577, 0.0821767522894574, 0.3288664065775443, 0.07985640634199198, 0.05128858852649814, -0.18437646308394642, 0.13465240068704254, 0.005940001827247184]
|
1,803.07748
|
Search for a Hypothetical 16.7 MeV Gauge Boson and Dark Photons in the
NA64 Experiment at CERN
|
We report the first results on a direct search for a new 16.7 MeV boson (X)
which could explain the anomalous excess of e+e- pairs observed in the excited
Be-8 nucleus decays. Due to its coupling to electrons, the X could be produced
in the bremsstrahlung reaction e- Z -> e- Z X by a 100 GeV e- beam incident on
an active target in the NA64 experiment at the CERN SPS and observed through
the subsequent decay into an e+e- pair. With 5.4\times 10^{10} electrons on
target, no evidence for such decays was found, allowing to set first limits on
the X-e^- coupling in the range 1.3\times 10^{-4} < \epsilon_e < 4.2\times
10^{-4} excluding part of the allowed parameter space. We also set new bounds
on the mixing strength of photons with dark photons (A') from non-observation
of the decay A'->e+e- of the bremsstrahlung A' with a mass <~ 23 MeV.
|
hep-ex hep-ph
|
we report the first results on a direct search for a new 167 mev boson x which could explain the anomalous excess of ee pairs observed in the excited be8 nucleus decays due to its coupling to electrons the x could be produced in the bremsstrahlung reaction e z e z x by a 100 gev e beam incident on an active target in the na64 experiment at the cern sps and observed through the subsequent decay into an ee pair with 54times 1010 electrons on target no evidence for such decays was found allowing to set first limits on the xe coupling in the range 13times 104 epsilon_e 42times 104 excluding part of the allowed parameter space we also set new bounds on the mixing strength of photons with dark photons a from nonobservation of the decay aee of the bremsstrahlung a with a mass 23 mev
|
[['we', 'report', 'the', 'first', 'results', 'on', 'a', 'direct', 'search', 'for', 'a', 'new', '167', 'mev', 'boson', 'x', 'which', 'could', 'explain', 'the', 'anomalous', 'excess', 'of', 'ee', 'pairs', 'observed', 'in', 'the', 'excited', 'be8', 'nucleus', 'decays', 'due', 'to', 'its', 'coupling', 'to', 'electrons', 'the', 'x', 'could', 'be', 'produced', 'in', 'the', 'bremsstrahlung', 'reaction', 'e', 'z', 'e', 'z', 'x', 'by', 'a', '100', 'gev', 'e', 'beam', 'incident', 'on', 'an', 'active', 'target', 'in', 'the', 'na64', 'experiment', 'at', 'the', 'cern', 'sps', 'and', 'observed', 'through', 'the', 'subsequent', 'decay', 'into', 'an', 'ee', 'pair', 'with', '54times', '1010', 'electrons', 'on', 'target', 'no', 'evidence', 'for', 'such', 'decays', 'was', 'found', 'allowing', 'to', 'set', 'first', 'limits', 'on', 'the', 'xe', 'coupling', 'in', 'the', 'range', '13times', '104', 'epsilon_e', '42times', '104', 'excluding', 'part', 'of', 'the', 'allowed', 'parameter', 'space', 'we', 'also', 'set', 'new', 'bounds', 'on', 'the', 'mixing', 'strength', 'of', 'photons', 'with', 'dark', 'photons', 'a', 'from', 'nonobservation', 'of', 'the', 'decay', 'aee', 'of', 'the', 'bremsstrahlung', 'a', 'with', 'a', 'mass', '23', 'mev']]
|
[-0.07759290952487169, 0.24260692575783627, -0.02890918433302038, 0.08484117953559837, -0.007483869953461722, -0.08614056439428414, 0.10796721708941953, 0.3399876434909734, -0.19732782809925895, -0.3358535110270856, -0.04075116356457206, -0.34935181234283624, 0.08768212722891287, 0.20958039218503227, 0.0949455611706661, 0.011104781538911944, 0.06264143606578629, 0.022428226326843975, -0.01948204495931497, -0.17992320100185336, 0.2302670018791498, 0.09820475757933801, 0.19946457659416655, 0.12100230142671019, 0.08350270362948445, -0.010550376169408697, 0.007045082983913252, -0.12078075062792679, -0.14574196846287296, 0.053186826654898656, 0.17496999451336828, 0.06681822172076618, 0.17067975185754886, -0.3453982113294203, -0.12122905057401874, 0.17429452816125107, 0.14731681703061267, 0.006801244190019379, -0.09397405141105598, -0.33537644686529766, 0.06410139468750237, -0.18218270891874627, -0.07909715459430339, 0.026080068265327026, 0.05301059099744905, -0.04131255475992991, -0.32565608050523176, 0.04426954592388545, -0.02672960401655842, -0.012296930628803533, -0.04110347721930216, -0.16338174659570023, -0.042971097115376916, -0.020818877059060173, 0.09458456775865744, 0.10427680190883079, 0.1825995798241599, -0.09999731208852215, -0.13495070514791468, 0.37686062931410363, -0.11277908721712192, -0.09954573108651046, 0.1839913378715062, -0.21904534814136759, -0.11602302381416431, 0.24656324919841782, 0.2150085587770288, 0.08586124013605956, -0.14128422354838835, 0.11565912947824816, -0.014795387205644196, 0.19317550497047753, 0.06015598788429555, 0.03313513776339352, 0.21808927184650423, 0.18540090710126064, 0.006239744334330631, 0.07101630720363401, -0.17391007299365074, 0.03334929230245384, -0.3741338645183557, -0.13772818422876298, -0.11482418121493145, 0.12682391613536212, -0.03412805101962058, -0.03327091655464264, 0.3565724312510291, 0.06452933958899922, 0.2878018672502524, -0.022753478719292813, 0.2581621271564399, 0.10756612405030692, 0.04413954405636351, 0.055652659745081455, 0.3436580760328955, 0.14953337331787003, 0.08959148777963442, -0.21544284239329548, 0.02255427056130626, -0.004056580931048941]
|
1,803.07749
|
Ultrabright narrow-band telecom two-photon source for long-distance
quantum communication
|
We demonstrate an ultrabright narrow-band two-photon source at the 1.5 -\mu m
telecom wavelength for long-distance quantum communication. By utilizing a
bow-tie cavity, we obtain a cavity enhancement factor of $4.06\times 10^4$. Our
measurement of the second-order correlation function $G^{(2)} ({\tau})$ reveals
that the linewidth of $2.4$ MHz has been hitherto unachieved in the 1.5 -\mu m
telecom band. This two-photon source is useful for obtaining a high absorption
probability close to unity by quantum memories set inside quantum repeater
nodes. Furthermore, to the best of our knowledge, the observed spectral
brightness of $3.94\times 10^5$ pairs/(s$\cdot$MHz$\cdot$mW) is also the
highest reported over all wavelengths.
|
quant-ph
|
we demonstrate an ultrabright narrowband twophoton source at the 15 mu m telecom wavelength for longdistance quantum communication by utilizing a bowtie cavity we obtain a cavity enhancement factor of 406times 104 our measurement of the secondorder correlation function g2 tau reveals that the linewidth of 24 mhz has been hitherto unachieved in the 15 mu m telecom band this twophoton source is useful for obtaining a high absorption probability close to unity by quantum memories set inside quantum repeater nodes furthermore to the best of our knowledge the observed spectral brightness of 394times 105 pairsscdotmhzcdotmw is also the highest reported over all wavelengths
|
[['we', 'demonstrate', 'an', 'ultrabright', 'narrowband', 'twophoton', 'source', 'at', 'the', '15', 'mu', 'm', 'telecom', 'wavelength', 'for', 'longdistance', 'quantum', 'communication', 'by', 'utilizing', 'a', 'bowtie', 'cavity', 'we', 'obtain', 'a', 'cavity', 'enhancement', 'factor', 'of', '406times', '104', 'our', 'measurement', 'of', 'the', 'secondorder', 'correlation', 'function', 'g2', 'tau', 'reveals', 'that', 'the', 'linewidth', 'of', '24', 'mhz', 'has', 'been', 'hitherto', 'unachieved', 'in', 'the', '15', 'mu', 'm', 'telecom', 'band', 'this', 'twophoton', 'source', 'is', 'useful', 'for', 'obtaining', 'a', 'high', 'absorption', 'probability', 'close', 'to', 'unity', 'by', 'quantum', 'memories', 'set', 'inside', 'quantum', 'repeater', 'nodes', 'furthermore', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'the', 'observed', 'spectral', 'brightness', 'of', '394times', '105', 'pairsscdotmhzcdotmw', 'is', 'also', 'the', 'highest', 'reported', 'over', 'all', 'wavelengths']]
|
[-0.1513386256262368, 0.13325635161762714, -0.010734605041387327, -0.010122132545802742, -0.0003833180320832659, -0.16216884961570888, 0.10734244063040059, 0.4495661113338143, -0.18797901300850378, -0.31476605253513246, 0.009550974689487951, -0.2897260825094931, -0.04996415648572877, 0.23261392830104075, 0.013409624487394467, 0.06835367458452489, 0.035950060653632654, 0.00499667056525747, -0.008939088068847708, -0.1658368851058185, 0.23356643812639602, 0.09318051660803202, 0.282787386149935, 0.0799962130167485, 0.09282205871525495, -0.0508772151170335, -0.0016838660527605052, -0.12081641603407323, -0.11508207304174065, 0.07725430936461278, 0.28965632471383784, 0.06191094559115157, 0.2443196865200412, -0.29759296346181896, -0.19204730466556022, 0.08823280598438692, 0.1344833566770688, 0.0787793756736552, -0.008588654340664838, -0.29481297641919524, 0.09154476619818631, -0.18642493866968388, -0.10498101521949924, 0.01992002036422491, 0.03453280872610562, -0.05797892312208811, -0.2664293920548231, 0.02588503593869973, -0.0072542747771413086, 0.06314643564652286, 0.024027153876993584, -0.09077082028356838, 0.04171105884940035, 0.08126720465153602, -0.10279093282160294, 0.07009794827614564, 0.14640537219341188, -0.09662969508801825, -0.13490717943390265, 0.34856732357658593, -0.1294605508515173, -0.04564534089135408, 0.13236162974042634, -0.24238167103270397, -0.07573572187410559, 0.21818679004140637, 0.091145004501895, 0.06818946944001843, -0.13753417185416408, 0.04898890446615862, -0.015271258307620883, 0.2630290017079781, 0.12912863991040663, 0.17945859952391507, 0.2066338206002233, 0.153918426520392, 0.02450230375260991, 0.13175613649518175, -0.19424922957413776, -0.030434488830174886, -0.2749700587352409, -0.14106205723011025, -0.2363733423453774, 0.14581058362005828, -0.14582230697623363, -0.07886575721204281, 0.3817932632770024, 0.11620831339364397, 0.17939842764890807, 0.04241975175682455, 0.31443670125422524, 0.15202160101220144, 0.10651091612218057, 0.07665256889737851, 0.3162432906455269, 0.1603476167131471, 0.09006057312944904, -0.21958270117037876, -0.005530494283519539, -0.07036394285330293]
|
1,803.0775
|
Activation cross-section data for alpha-particle induced nuclear
reactions on natural ytterbium for some longer lived radioisotopes
|
Additional experimental cross sections were deduced for the long half-life
activation products (172Hf and 173Lu) from the alpha particle induced reactions
on ytterbium up to 38 MeV from late, long measurements and for 175Yb, 167Tm
from a re-evaluation of earlier measured spectra. The cross-sections are
compared with the earlier experimental datasets and with the data based on the
TALYS theoretical nuclear reaction model (available in the TENDL-2014 and 2015
libraries) and the ALICE-IPPE code.
|
nucl-ex stat.AP
|
additional experimental cross sections were deduced for the long halflife activation products 172hf and 173lu from the alpha particle induced reactions on ytterbium up to 38 mev from late long measurements and for 175yb 167tm from a reevaluation of earlier measured spectra the crosssections are compared with the earlier experimental datasets and with the data based on the talys theoretical nuclear reaction model available in the tendl2014 and 2015 libraries and the aliceippe code
|
[['additional', 'experimental', 'cross', 'sections', 'were', 'deduced', 'for', 'the', 'long', 'halflife', 'activation', 'products', '172hf', 'and', '173lu', 'from', 'the', 'alpha', 'particle', 'induced', 'reactions', 'on', 'ytterbium', 'up', 'to', '38', 'mev', 'from', 'late', 'long', 'measurements', 'and', 'for', '175yb', '167tm', 'from', 'a', 'reevaluation', 'of', 'earlier', 'measured', 'spectra', 'the', 'crosssections', 'are', 'compared', 'with', 'the', 'earlier', 'experimental', 'datasets', 'and', 'with', 'the', 'data', 'based', 'on', 'the', 'talys', 'theoretical', 'nuclear', 'reaction', 'model', 'available', 'in', 'the', 'tendl2014', 'and', '2015', 'libraries', 'and', 'the', 'aliceippe', 'code']]
|
[0.04570088875147381, 0.12803519385467682, -0.05591530588696644, 0.043141431867011956, 0.04545937519911344, -0.11342798377653318, 0.04253514224796423, 0.3854026212756123, -0.18674304368240494, -0.37741972782782146, 0.0483759900737953, -0.3968843498932464, 0.04201136576011777, 0.27414476213577604, 0.06590656932343596, 0.12862602029261844, 0.16563441777335747, 0.04483660616512809, -0.03715938672955547, -0.20289939107107266, 0.2578314254675726, 0.17548210599592753, 0.23535193598696164, 0.10893065840271966, 0.041697029970652826, -0.01040435606347663, -0.10035913417315377, -0.09011839952852045, -0.17993982001873, 0.11362257500046066, 0.23051020272874406, 0.08338093025875944, 0.0708290794997343, -0.4372193507584078, -0.1809055470063218, 0.042927197885832616, 0.05540389754543347, 0.133961811264453, -0.05603947169480047, -0.32682716750672886, 0.026920629798301628, -0.20900015461125543, -0.007278220940913473, -0.03804842945454376, 0.05197991466016642, 0.09418201598205737, -0.27499423138797285, 0.07715084588687335, -0.06067356210468071, 0.12351349900875773, -0.15639345992489584, -0.2738511937936502, -0.026657084628407445, 0.08721809473686985, 0.0682072573990029, 0.03521211155498999, 0.14575130143868073, -0.05405110523237714, -0.14127796155267527, 0.3530586830739464, -0.09392782019318215, -0.05258206060555364, 0.15789588077459485, -0.1328821090715272, -0.1251145423489756, 0.18881922295050962, 0.1766136694965618, 0.09999544862657786, -0.15384627065754364, 0.0796278026112954, 0.01846128710146461, 0.18352755505059445, 0.07495955868091966, -0.030193120507257327, 0.09578267552008453, 0.1780806921538897, -0.11004505559269871, 0.04308458657303293, -0.13301963853383703, -0.0919438491708466, -0.3086648335015135, -0.07132333113944957, -0.09352619211921202, 0.07683415939765317, -0.032435631212138105, -0.06328096154278942, 0.3429787023791245, 0.08240849300553756, 0.24408142734318972, 0.02636312499110188, 0.29448835968172976, 0.017437531398276664, 0.12660428110809466, 0.041810046908046516, 0.2832428424353046, 0.16432061579544097, 0.12213266910985113, -0.22524414267390966, 0.09088157563071166, -0.01422559968861086]
|
1,803.07751
|
A Secure Proxy-based Access Control Scheme for Implantable Medical
Devices
|
With the rapid development of health equipments, increasingly more patients
have installed the implantable medical devices (IMD) in their bodies for
diagnostic, monitoring, and therapeutic purposes. IMDs are extremely limited in
computation power and battery capacity. Meanwhile, IMDs have to communicate
with an external programmer device (i.e., IMD programmer) through the wireless
channel, which put them under the risk of unauthorized access and malicious
wireless attacks. In this paper, we propose a proxy-based fine-grained access
control scheme for IMDs, which can prolong the IMD's lifetime by delegating the
access control computations to the proxy device (e.g., smartphone). In our
scheme, the proxy communicates with the IMD programmer through an audio cable,
which is resistant to a number of wireless attacks. Additionally, we use the
ciphertext-policy attribute-based encryption (CP-ABE) to enforce fine-grained
access control. The proposed scheme is implemented on real emulator devices and
evaluated through experimental tests. The experiments show that the proposed
scheme is lightweight and effective.
|
cs.CR
|
with the rapid development of health equipments increasingly more patients have installed the implantable medical devices imd in their bodies for diagnostic monitoring and therapeutic purposes imds are extremely limited in computation power and battery capacity meanwhile imds have to communicate with an external programmer device ie imd programmer through the wireless channel which put them under the risk of unauthorized access and malicious wireless attacks in this paper we propose a proxybased finegrained access control scheme for imds which can prolong the imds lifetime by delegating the access control computations to the proxy device eg smartphone in our scheme the proxy communicates with the imd programmer through an audio cable which is resistant to a number of wireless attacks additionally we use the ciphertextpolicy attributebased encryption cpabe to enforce finegrained access control the proposed scheme is implemented on real emulator devices and evaluated through experimental tests the experiments show that the proposed scheme is lightweight and effective
|
[['with', 'the', 'rapid', 'development', 'of', 'health', 'equipments', 'increasingly', 'more', 'patients', 'have', 'installed', 'the', 'implantable', 'medical', 'devices', 'imd', 'in', 'their', 'bodies', 'for', 'diagnostic', 'monitoring', 'and', 'therapeutic', 'purposes', 'imds', 'are', 'extremely', 'limited', 'in', 'computation', 'power', 'and', 'battery', 'capacity', 'meanwhile', 'imds', 'have', 'to', 'communicate', 'with', 'an', 'external', 'programmer', 'device', 'ie', 'imd', 'programmer', 'through', 'the', 'wireless', 'channel', 'which', 'put', 'them', 'under', 'the', 'risk', 'of', 'unauthorized', 'access', 'and', 'malicious', 'wireless', 'attacks', 'in', 'this', 'paper', 'we', 'propose', 'a', 'proxybased', 'finegrained', 'access', 'control', 'scheme', 'for', 'imds', 'which', 'can', 'prolong', 'the', 'imds', 'lifetime', 'by', 'delegating', 'the', 'access', 'control', 'computations', 'to', 'the', 'proxy', 'device', 'eg', 'smartphone', 'in', 'our', 'scheme', 'the', 'proxy', 'communicates', 'with', 'the', 'imd', 'programmer', 'through', 'an', 'audio', 'cable', 'which', 'is', 'resistant', 'to', 'a', 'number', 'of', 'wireless', 'attacks', 'additionally', 'we', 'use', 'the', 'ciphertextpolicy', 'attributebased', 'encryption', 'cpabe', 'to', 'enforce', 'finegrained', 'access', 'control', 'the', 'proposed', 'scheme', 'is', 'implemented', 'on', 'real', 'emulator', 'devices', 'and', 'evaluated', 'through', 'experimental', 'tests', 'the', 'experiments', 'show', 'that', 'the', 'proposed', 'scheme', 'is', 'lightweight', 'and', 'effective']]
|
[-0.19070342662257933, 0.015251968929999438, -0.049495238781305434, -0.02524536380491255, -0.1244617889081187, -0.30245679425358585, 0.12115830154220067, 0.39194299606901084, -0.24469030410923723, -0.3206440458144945, 0.12326198703126062, -0.25721733832932253, -0.11446782515260473, 0.24371985505228932, -0.17159695348233026, 0.1003999418131064, 0.020879612339636946, 0.03323237345660034, 0.061082059155731123, -0.2600782973267421, 0.22950750098215958, 0.10106845140233164, 0.3831033224263523, 0.08633500669273854, 0.07916499766568312, 0.021509724347911114, -0.03623023090878195, -0.07784125179308761, -0.028726687541062414, 0.1276330731085596, 0.3690942200372302, 0.20001420992591618, 0.3279953931098733, -0.5008895641564513, -0.2318082128716279, 0.05753784840174986, 0.12379142450534553, 0.058037348689151856, -0.08972886187008573, -0.341047964257754, 0.16975295061062834, -0.3259947251033368, -0.043297323650095455, -0.10119261655991874, -0.043606197966934664, 0.015778872122563705, -0.31891755154798446, -0.06796200518570752, -0.05355460642795727, 0.0941438193792548, -0.04546149673262358, 0.013055096306731994, 0.020233565150123513, 0.21383673787895072, 0.005721058432685868, -0.018200615120320757, 0.21189230944242188, -0.11074188289960517, -0.1275580540384885, 0.360673759473028, 0.0558938843701359, -0.18409492545378028, 0.17031411748251266, 0.007396041875398612, -0.07503713768482491, 0.06988148846887524, 0.24170671167888066, 0.09037959621482398, -0.2073206474821826, 0.0008994443795225241, 0.04074146912456785, 0.20764717487824633, 0.05148089563479954, 0.08636775695648091, 0.14043263279054832, 0.2091128175099722, 0.09301006541214589, 0.11545897617529417, -0.09136312362119774, -0.05144524632671647, -0.1927867145454393, -0.17275638828832138, -0.16319983727534454, 0.013816840317442165, -0.05048857863852091, -0.13198249018483993, 0.34120316555916225, 0.22139320160922465, 0.08134669857689097, 0.04381881197663967, 0.4662452461787417, 0.014955499383718176, 0.16638005286074964, 0.12452450147358395, 0.13504159735822224, 0.032790119266078534, 0.19659478467877342, -0.19896479059729866, 0.17395744674626878, -0.04431358467245215]
|
1,803.07752
|
Activation cross sections of deuteron induced reactions on silver in the
33-50 MeV energy range
|
Excitation functions were measured for the $^{nat}$Ag(d,x)$^{105,104}$Cd,
$^{110m,108m,106m,105g,104g}$Ag and $^{101}$Pd, $^{105,101m}$Rh reactions over
the energy range 33 50 MeV by using the stacked foil activation technique and
subsequent high-resolution gamma spectrometry. We present the first
experimental cross section data above 40 MeV for all of these reactions and the
first experimental cross section data for $^{nat}$Ag(d,x)$^{108m,104g}$Ag and
$^{105,103}$Rh. The experimental data are compared with results of the model
calculations performed with the ALICE D, EMPIRE D theoretical nuclear reaction
model codes and with the TALYS code results as available in the TENDL2014 and
2015 on-line libraries.
|
nucl-ex
|
excitation functions were measured for the natagdx105104cd 110m108m106m105g104gag and 101pd 105101mrh reactions over the energy range 33 50 mev by using the stacked foil activation technique and subsequent highresolution gamma spectrometry we present the first experimental cross section data above 40 mev for all of these reactions and the first experimental cross section data for natagdx108m104gag and 105103rh the experimental data are compared with results of the model calculations performed with the alice d empire d theoretical nuclear reaction model codes and with the talys code results as available in the tendl2014 and 2015 online libraries
|
[['excitation', 'functions', 'were', 'measured', 'for', 'the', 'natagdx105104cd', '110m108m106m105g104gag', 'and', '101pd', '105101mrh', 'reactions', 'over', 'the', 'energy', 'range', '33', '50', 'mev', 'by', 'using', 'the', 'stacked', 'foil', 'activation', 'technique', 'and', 'subsequent', 'highresolution', 'gamma', 'spectrometry', 'we', 'present', 'the', 'first', 'experimental', 'cross', 'section', 'data', 'above', '40', 'mev', 'for', 'all', 'of', 'these', 'reactions', 'and', 'the', 'first', 'experimental', 'cross', 'section', 'data', 'for', 'natagdx108m104gag', 'and', '105103rh', 'the', 'experimental', 'data', 'are', 'compared', 'with', 'results', 'of', 'the', 'model', 'calculations', 'performed', 'with', 'the', 'alice', 'd', 'empire', 'd', 'theoretical', 'nuclear', 'reaction', 'model', 'codes', 'and', 'with', 'the', 'talys', 'code', 'results', 'as', 'available', 'in', 'the', 'tendl2014', 'and', '2015', 'online', 'libraries']]
|
[0.01604370601413833, 0.11375262934182372, -0.031105512213588763, 0.04687069631744545, 0.05170129420642567, -0.12856003682635683, 0.058140901083658846, 0.4137382357493862, -0.21989695861382963, -0.38346776540217165, 0.022906077308017393, -0.3942036894303593, 0.012348200015437145, 0.24943889373949227, 0.1009632459967039, 0.16252680955925486, 0.17131690573264527, -0.005942686133414179, -0.025818063161120966, -0.23959071238289822, 0.2779827284304282, 0.1812722194264387, 0.24487048832720126, 0.14686121752199072, 0.048197630970677426, 0.029804047997938572, -0.06679066006032812, -0.09598130358198842, -0.18652712387431944, 0.11491511326160404, 0.30041984945361677, 0.09946670589436378, 0.10206671811353701, -0.41337497462262657, -0.1743953380590448, 0.024983312494561566, 0.06908980670518108, 0.1050807105883915, -0.08906611349372255, -0.26486450635347064, 0.10021817255355828, -0.2234828399678508, -0.02678928135607678, -0.05003370476661475, 0.016696853010536552, 0.06475881373530233, -0.2612404495600488, 0.06911483909013671, -0.051980810500886085, 0.11122679985875128, -0.14473402566163912, -0.24522437456135565, -0.027753889197381316, 0.08137089206458448, 0.015106415690772318, 0.05577213081926527, 0.14947036285065934, -0.053241497540211936, -0.14897394999042973, 0.3440514724435551, -0.058239884121896145, -0.08946970854834704, 0.11755627555424696, -0.13166885577899579, -0.11461149914072478, 0.16741684597026515, 0.1834731353958557, 0.11542752473666282, -0.15695554648454374, 0.057425699492271706, -0.012476615761253204, 0.1915794507201229, 0.05684964419700778, -0.05461657594807528, 0.0541978824479444, 0.18803679156961473, -0.10008252744568041, 0.06664992543577043, -0.19049126804284341, -0.04848473550301496, -0.33329840386184034, -0.0823204484154153, -0.09701915099355904, 0.012748058404323163, -0.032840379553777936, -0.02909569686872291, 0.35320385119744707, 0.07565443430628095, 0.2524173892215713, 0.04979032753188941, 0.3114625147728065, 0.027155058513456894, 0.08897769028208331, 0.07609106531714672, 0.25664586938180767, 0.16305332485545468, 0.13306588462968408, -0.17693005492757227, 0.04771987221377728, -0.0410542875313415]
|
1,803.07753
|
Sample Complexity of Sparse System Identification Problem
|
In this paper, we study the system identification problem for sparse linear
time-invariant systems. We propose a sparsity promoting block-regularized
estimator to identify the dynamics of the system with only a limited number of
input-state data samples. We characterize the properties of this estimator
under high-dimensional scaling, where the growth rate of the system dimension
is comparable to or even faster than that of the number of available sample
trajectories. In particular, using contemporary results on high-dimensional
statistics, we show that the proposed estimator results in a small element-wise
error, provided that the number of sample trajectories is above a threshold.
This threshold depends polynomially on the size of each block and the number of
nonzero elements at different rows of input and state matrices, but only
logarithmically on the system dimension. A by-product of this result is that
the number of sample trajectories required for sparse system identification is
significantly smaller than the dimension of the system. Furthermore, we show
that, unlike the recently celebrated least-squares estimators for system
identification problems, the method developed in this work is capable of
\textit{exact recovery} of the underlying sparsity structure of the system with
the aforementioned number of data samples. Extensive case studies on
synthetically generated systems, physical mass-spring networks, and multi-agent
systems are offered to demonstrate the effectiveness of the proposed method.
|
cs.SY stat.ML
|
in this paper we study the system identification problem for sparse linear timeinvariant systems we propose a sparsity promoting blockregularized estimator to identify the dynamics of the system with only a limited number of inputstate data samples we characterize the properties of this estimator under highdimensional scaling where the growth rate of the system dimension is comparable to or even faster than that of the number of available sample trajectories in particular using contemporary results on highdimensional statistics we show that the proposed estimator results in a small elementwise error provided that the number of sample trajectories is above a threshold this threshold depends polynomially on the size of each block and the number of nonzero elements at different rows of input and state matrices but only logarithmically on the system dimension a byproduct of this result is that the number of sample trajectories required for sparse system identification is significantly smaller than the dimension of the system furthermore we show that unlike the recently celebrated leastsquares estimators for system identification problems the method developed in this work is capable of textitexact recovery of the underlying sparsity structure of the system with the aforementioned number of data samples extensive case studies on synthetically generated systems physical massspring networks and multiagent systems are offered to demonstrate the effectiveness of the proposed method
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'system', 'identification', 'problem', 'for', 'sparse', 'linear', 'timeinvariant', 'systems', 'we', 'propose', 'a', 'sparsity', 'promoting', 'blockregularized', 'estimator', 'to', 'identify', 'the', 'dynamics', 'of', 'the', 'system', 'with', 'only', 'a', 'limited', 'number', 'of', 'inputstate', 'data', 'samples', 'we', 'characterize', 'the', 'properties', 'of', 'this', 'estimator', 'under', 'highdimensional', 'scaling', 'where', 'the', 'growth', 'rate', 'of', 'the', 'system', 'dimension', 'is', 'comparable', 'to', 'or', 'even', 'faster', 'than', 'that', 'of', 'the', 'number', 'of', 'available', 'sample', 'trajectories', 'in', 'particular', 'using', 'contemporary', 'results', 'on', 'highdimensional', 'statistics', 'we', 'show', 'that', 'the', 'proposed', 'estimator', 'results', 'in', 'a', 'small', 'elementwise', 'error', 'provided', 'that', 'the', 'number', 'of', 'sample', 'trajectories', 'is', 'above', 'a', 'threshold', 'this', 'threshold', 'depends', 'polynomially', 'on', 'the', 'size', 'of', 'each', 'block', 'and', 'the', 'number', 'of', 'nonzero', 'elements', 'at', 'different', 'rows', 'of', 'input', 'and', 'state', 'matrices', 'but', 'only', 'logarithmically', 'on', 'the', 'system', 'dimension', 'a', 'byproduct', 'of', 'this', 'result', 'is', 'that', 'the', 'number', 'of', 'sample', 'trajectories', 'required', 'for', 'sparse', 'system', 'identification', 'is', 'significantly', 'smaller', 'than', 'the', 'dimension', 'of', 'the', 'system', 'furthermore', 'we', 'show', 'that', 'unlike', 'the', 'recently', 'celebrated', 'leastsquares', 'estimators', 'for', 'system', 'identification', 'problems', 'the', 'method', 'developed', 'in', 'this', 'work', 'is', 'capable', 'of', 'textitexact', 'recovery', 'of', 'the', 'underlying', 'sparsity', 'structure', 'of', 'the', 'system', 'with', 'the', 'aforementioned', 'number', 'of', 'data', 'samples', 'extensive', 'case', 'studies', 'on', 'synthetically', 'generated', 'systems', 'physical', 'massspring', 'networks', 'and', 'multiagent', 'systems', 'are', 'offered', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']]
|
[-0.13234134107637643, 0.04923397710292854, -0.044488037422045386, 0.012759702570143748, -0.019069422431163153, -0.11504365516699512, 0.04392166997104968, 0.3326071601001207, -0.26897367293819446, -0.31151838931890036, 0.13528834230705383, -0.27229420723478226, -0.1801140357316895, 0.2261548105510883, -0.07483645879070867, 0.10825729448009622, 0.09888913307169622, 0.06888581458108754, -0.05424781715476208, -0.30276383899723774, 0.3322214771982875, 0.057074667758901014, 0.3026119536847215, -0.03968347893440461, 0.1190705998853611, 0.018401673381132157, -0.0002570245795967904, 0.03746027798783457, -0.09173559092533569, 0.12977872286573983, 0.20534615257426841, 0.16081258033042434, 0.3160984855113466, -0.3650412450878238, -0.2086412552130324, 0.1249265128005804, 0.14355755262341435, 0.12423835727174512, -0.03599670543335378, -0.2545494283168492, 0.1233885454077443, -0.1455844908995046, -0.10555605205749585, -0.074195931377736, -0.01715596281627024, 0.01761511696359693, -0.30926213880752174, 0.07996192144187675, 0.0757317443547601, 0.050335140903057025, -0.04502582863735204, -0.13680657359813764, 0.012518142722547055, 0.09974745427713391, 0.04399539976677096, -0.031389530984134495, 0.11457662428041328, -0.12372547153976153, -0.07880654070441696, 0.3346779806052589, -0.0198314233880162, -0.21293461855966597, 0.21808448996267873, -0.1687929810236462, -0.12785148031014779, 0.13593820061915637, 0.23976757564259144, 0.12088173657909713, -0.13038423983935818, 0.06343696341685824, -0.09156352358192883, 0.21549270514779809, 0.0015793129357255318, 0.05220993515950712, 0.0911898073211143, 0.21839391915656794, 0.11185983093878762, 0.1519619372228838, -0.08404757980659434, -0.06336463694672355, -0.27519811290125784, -0.12412874159212647, -0.25305208537928675, -0.01462448018454862, -0.10757280494786259, -0.15801962663588875, 0.4010522597850385, 0.1909449444321746, 0.21437069270336492, 0.09706269064759412, 0.31085870890793477, 0.092165610041808, 0.0602494493867694, 0.08824603139761497, 0.19597681936045938, 0.10532143957997588, 0.05139540951614353, -0.24225118531718512, 0.09520773492457175, 0.05888993657638573]
|
1,803.07754
|
Characterization of generic transversality
|
In this paper, the notion of generic transversality and its characterization
are given. The characterization is also a further improvement of the basic
transversality result and its strengthening which was given by John Mather.
|
math.GT
|
in this paper the notion of generic transversality and its characterization are given the characterization is also a further improvement of the basic transversality result and its strengthening which was given by john mather
|
[['in', 'this', 'paper', 'the', 'notion', 'of', 'generic', 'transversality', 'and', 'its', 'characterization', 'are', 'given', 'the', 'characterization', 'is', 'also', 'a', 'further', 'improvement', 'of', 'the', 'basic', 'transversality', 'result', 'and', 'its', 'strengthening', 'which', 'was', 'given', 'by', 'john', 'mather']]
|
[-0.1440759644679287, 0.059593459700836855, -0.12131025305236964, 0.022482123883331522, -0.08465851542046841, -0.08882473446154858, 0.04072781929212129, 0.267876829869826, -0.29341284032253656, -0.2889287678853554, 0.14555049595518915, -0.19212415880140135, -0.1885913507465054, 0.20918840462999308, -0.20093935210367336, 0.05773138766765923, 0.0782472029711832, 0.018907173208015805, -0.08946007424417664, -0.2912549078464508, 0.38270403137978387, 0.06787095928003135, 0.2284373679499635, 0.16951400830465205, 0.050489108749281836, 0.048822882379788685, -0.04945050730534336, 0.0500483004759778, -0.18350323884035735, 0.1891195759834612, 0.15918983261594, 0.19421286897405104, 0.2828058637678623, -0.2889543856110643, -0.16691093092017315, 0.10934092415332355, 0.025512398042551735, 0.04731018037230516, 0.0017220108934185084, -0.3116324348923038, 0.1524430289008545, -0.13266963199438417, -0.19444449838963063, -0.0706290073473664, 0.0328468483982279, 0.046003705219310874, -0.2242813741459566, 0.004470581537187921, 0.2458732424523024, 0.13461077952867045, -0.06925166830393102, -0.025035655153367448, -0.022970709244391936, 0.08667253764510593, 0.0277725035968401, 0.10336652262862224, 0.03846550909528399, -0.07521725316559348, -0.12285210945479133, 0.3422719835139373, -0.041559693787027806, -0.1924804477568935, 0.19250219934346044, -0.11834612375070505, -0.14696164274423876, 0.09767284077208709, 0.06351302701103337, 0.11725526357836583, -0.17329350053606665, 0.10585018375765204, -0.1302440948510433, -0.003524958429967656, 0.15562562560936546, 0.05455856507315355, 0.0997249025522786, 0.16967229910797493, 0.09392436766339575, 0.19143909730893724, -0.009643655489472783, -0.03864784740075907, -0.39321671272901926, -0.22070106579100385, -0.17021522813421838, 0.07358369360650506, -0.07114887749690645, -0.1638720451908953, 0.42933084295295615, 0.11667526146287427, 0.16879214231363115, 0.07704419333501444, 0.26650608604883447, 0.1315428700780852, -0.01680012866306831, 0.004280297510216341, 0.2401544165742748, 0.2206816997118842, 0.08887899656067877, -0.13505866494961083, 0.11326607571476523, 0.1430046840790002]
|
1,803.07755
|
Broadband Axion Dark Matter Haloscopes via Electric Sensing
|
The mass of axion dark matter is only weakly bounded by cosmological
observations, necessitating a variety of detection techniques over several
orders of magnitude of mass ranges. Axions haloscopes based on resonant
cavities have become the current standard to search for dark matter axions.
Such structures are inherently narrowband and for low masses the volume of the
required cavity becomes prohibitively large. Broadband low-mass detectors have
already been proposed using inductive magnetometer sensors and a gapped
toroidal solenoid magnet. In this work we propose an alternative, which uses
electric sensors in a conventional solenoidal magnet aligned in the laboratory
z-axis, as implemented in standard haloscope experiments. In the presence of
the DC magnetic field, the inverse Primakoff effect causes a time varying
permanent electric vacuum polarization in the z-direction to oscillate at the
axion Compton frequency, which induces an oscillating electromotive force. We
propose non-resonant techniques to detect this oscillating elctromotive force
by implementing a capacitive sensor or an electric dipole antenna coupled to a
low noise amplifier. We present the first experimental results and discuss the
foundations and potential of this proposal. Preliminary results constrain
$g_{a\gamma\gamma} >\sim2.35\times10^{-12}$ $\text{GeV}^{-1}$ in the mass range
of $2.08\times10^{-11}$ to $2.2\times10^{-11}$ eV, and demonstrate potential
sensitivity to axion-like dark matter with masses in the range of $10^{-12}$ to
$10^{-8}$ eV.
|
physics.ins-det gr-qc hep-ex hep-ph
|
the mass of axion dark matter is only weakly bounded by cosmological observations necessitating a variety of detection techniques over several orders of magnitude of mass ranges axions haloscopes based on resonant cavities have become the current standard to search for dark matter axions such structures are inherently narrowband and for low masses the volume of the required cavity becomes prohibitively large broadband lowmass detectors have already been proposed using inductive magnetometer sensors and a gapped toroidal solenoid magnet in this work we propose an alternative which uses electric sensors in a conventional solenoidal magnet aligned in the laboratory zaxis as implemented in standard haloscope experiments in the presence of the dc magnetic field the inverse primakoff effect causes a time varying permanent electric vacuum polarization in the zdirection to oscillate at the axion compton frequency which induces an oscillating electromotive force we propose nonresonant techniques to detect this oscillating elctromotive force by implementing a capacitive sensor or an electric dipole antenna coupled to a low noise amplifier we present the first experimental results and discuss the foundations and potential of this proposal preliminary results constrain g_agammagamma sim235times1012 textgev1 in the mass range of 208times1011 to 22times1011 ev and demonstrate potential sensitivity to axionlike dark matter with masses in the range of 1012 to 108 ev
|
[['the', 'mass', 'of', 'axion', 'dark', 'matter', 'is', 'only', 'weakly', 'bounded', 'by', 'cosmological', 'observations', 'necessitating', 'a', 'variety', 'of', 'detection', 'techniques', 'over', 'several', 'orders', 'of', 'magnitude', 'of', 'mass', 'ranges', 'axions', 'haloscopes', 'based', 'on', 'resonant', 'cavities', 'have', 'become', 'the', 'current', 'standard', 'to', 'search', 'for', 'dark', 'matter', 'axions', 'such', 'structures', 'are', 'inherently', 'narrowband', 'and', 'for', 'low', 'masses', 'the', 'volume', 'of', 'the', 'required', 'cavity', 'becomes', 'prohibitively', 'large', 'broadband', 'lowmass', 'detectors', 'have', 'already', 'been', 'proposed', 'using', 'inductive', 'magnetometer', 'sensors', 'and', 'a', 'gapped', 'toroidal', 'solenoid', 'magnet', 'in', 'this', 'work', 'we', 'propose', 'an', 'alternative', 'which', 'uses', 'electric', 'sensors', 'in', 'a', 'conventional', 'solenoidal', 'magnet', 'aligned', 'in', 'the', 'laboratory', 'zaxis', 'as', 'implemented', 'in', 'standard', 'haloscope', 'experiments', 'in', 'the', 'presence', 'of', 'the', 'dc', 'magnetic', 'field', 'the', 'inverse', 'primakoff', 'effect', 'causes', 'a', 'time', 'varying', 'permanent', 'electric', 'vacuum', 'polarization', 'in', 'the', 'zdirection', 'to', 'oscillate', 'at', 'the', 'axion', 'compton', 'frequency', 'which', 'induces', 'an', 'oscillating', 'electromotive', 'force', 'we', 'propose', 'nonresonant', 'techniques', 'to', 'detect', 'this', 'oscillating', 'elctromotive', 'force', 'by', 'implementing', 'a', 'capacitive', 'sensor', 'or', 'an', 'electric', 'dipole', 'antenna', 'coupled', 'to', 'a', 'low', 'noise', 'amplifier', 'we', 'present', 'the', 'first', 'experimental', 'results', 'and', 'discuss', 'the', 'foundations', 'and', 'potential', 'of', 'this', 'proposal', 'preliminary', 'results', 'constrain', 'g_agammagamma', 'sim235times1012', 'textgev1', 'in', 'the', 'mass', 'range', 'of', '208times1011', 'to', '22times1011', 'ev', 'and', 'demonstrate', 'potential', 'sensitivity', 'to', 'axionlike', 'dark', 'matter', 'with', 'masses', 'in', 'the', 'range', 'of', '1012', 'to', '108', 'ev']]
|
[-0.1700796137611609, 0.2129381062510237, -0.004257719635646746, 0.03187361797450278, -0.09004669434554274, -0.10313852323810636, 0.010925483311111575, 0.3846346050968738, -0.19664240981147613, -0.37739524254200196, 0.03489746171396261, -0.2412603543056131, -0.03604412844770928, 0.22838875371742093, 0.0030733458432964803, 0.03911700460097589, -0.009971189098565076, 0.003922260600314321, -0.02609666000670418, -0.18052040240826678, 0.25776088579946255, 0.06497877883510797, 0.26957534554621904, 0.059475898132598806, 0.11813926378428335, -0.03920882420782088, 0.018552036516774464, -0.022817745749613545, -0.09997531871523231, 0.05210835407642533, 0.2209493505086538, 0.028110543868808745, 0.21598906681974422, -0.459666885797517, -0.16986491394745654, 0.13974109788560993, 0.1370492680318283, 0.10629291302674578, -0.11032136715286504, -0.3153904669242801, 0.04756593299956255, -0.19640139858922545, -0.12066296271657598, -0.07128164256256408, -0.009330839277863044, 0.014215042846061078, -0.3042613805329065, 0.051281091706359416, -0.005597554008207191, 0.017474912054024603, -0.08212610212114962, -0.11479428301949354, 0.07601592228063757, -0.006458685432132598, 0.07073965219348245, 0.047323013605082065, 0.24819534650884603, -0.1522748227246653, -0.11020441835754997, 0.3553825255325594, -0.12892194858076872, -0.13433742717182115, 0.15720584328999188, -0.14561870710629643, -0.07930414935025343, 0.15774829835758955, 0.18440604895702012, 0.09874479592031848, -0.1506566263076527, 0.09125263136105338, 0.022861778578871058, 0.21539571073338812, 0.08297184396036393, 0.041017230121215796, 0.32074888924995254, 0.20471076714537015, 0.07426866052133776, 0.10766994750256302, -0.15647362701714004, -0.017860350479323293, -0.2800639218946486, -0.09958636484625286, -0.15330981914234298, 0.04333050758026152, -0.057652109350787885, -0.15807754408691732, 0.351622006531487, 0.1891093778366585, 0.1556938930681655, -0.03334375977724729, 0.3899685957676497, 0.09200456115181041, 0.10031346393356286, 0.00014566358011127648, 0.35740989935363676, 0.17629630927005296, 0.14715717812962564, -0.2372611099401692, -0.0741965769816596, -0.01973216582766361]
|
1,803.07756
|
Upper Measure Bounds of Nodal Sets of Solutions to the Bi-Harmonic
Equations on $C^{\infty}$ Riemannian Manifolds
|
In this paper, we consider the nodal set of a bi-harmonic function $u$ on an
$n$ dimensional $C^{\infty}$ Riemannian manifold $M$, that is, $u$ satisfies
the equation $\triangle_M^2u=0$ on $M$, where $\triangle_M$ is the Laplacian
operator on $M$. We first define the frequency function and the doubling index
for the bi-harmonic function $u$, and then establish their monotonicity
formulae and doubling conditions. With the help of the smallness propagation
and partitions, we show that, for some ball $B_r(x_0)\subseteq M$ with $r$
small enough, an upper bound for the measure of nodal set of the bi-harmonic
function $u$ can be controlled by $N^\alpha$, that is,
\mathcal{H}^{n-1}\left(\left\{x\in B_{r/2}(x_0)|u(x)=0\right\}\right)\leq
CN^{\alpha}r^{n-1}, where $N=\max\left\{C_0,N(x_0,r)\right\}$, $\alpha$, $C$
and $C_0$ both are positive constants depending only on $n$ and $M$. Here
$N(x_0,r)$ is the frequency function of $u$ centered at $x_0$ with radius $r$.
Furthermore, we derive that an upper measure for nodal sets of eigenfunctions
of the bi-harmonic operator on a $C^{\infty}$ compact Riemannian manifold
without boundary can be controlled by $\lambda^\beta$ for the corresponding
eigenvalue $\lambda^2$ and some positive constant $\beta$.
|
math.AP
|
in this paper we consider the nodal set of a biharmonic function u on an n dimensional cinfty riemannian manifold m that is u satisfies the equation triangle_m2u0 on m where triangle_m is the laplacian operator on m we first define the frequency function and the doubling index for the biharmonic function u and then establish their monotonicity formulae and doubling conditions with the help of the smallness propagation and partitions we show that for some ball b_rx_0subseteq m with r small enough an upper bound for the measure of nodal set of the biharmonic function u can be controlled by nalpha that is mathcalhn1leftleftxin b_r2x_0ux0rightrightleq cnalpharn1 where nmaxleftc_0nx_0rright alpha c and c_0 both are positive constants depending only on n and m here nx_0r is the frequency function of u centered at x_0 with radius r furthermore we derive that an upper measure for nodal sets of eigenfunctions of the biharmonic operator on a cinfty compact riemannian manifold without boundary can be controlled by lambdabeta for the corresponding eigenvalue lambda2 and some positive constant beta
|
[['in', 'this', 'paper', 'we', 'consider', 'the', 'nodal', 'set', 'of', 'a', 'biharmonic', 'function', 'u', 'on', 'an', 'n', 'dimensional', 'cinfty', 'riemannian', 'manifold', 'm', 'that', 'is', 'u', 'satisfies', 'the', 'equation', 'triangle_m2u0', 'on', 'm', 'where', 'triangle_m', 'is', 'the', 'laplacian', 'operator', 'on', 'm', 'we', 'first', 'define', 'the', 'frequency', 'function', 'and', 'the', 'doubling', 'index', 'for', 'the', 'biharmonic', 'function', 'u', 'and', 'then', 'establish', 'their', 'monotonicity', 'formulae', 'and', 'doubling', 'conditions', 'with', 'the', 'help', 'of', 'the', 'smallness', 'propagation', 'and', 'partitions', 'we', 'show', 'that', 'for', 'some', 'ball', 'b_rx_0subseteq', 'm', 'with', 'r', 'small', 'enough', 'an', 'upper', 'bound', 'for', 'the', 'measure', 'of', 'nodal', 'set', 'of', 'the', 'biharmonic', 'function', 'u', 'can', 'be', 'controlled', 'by', 'nalpha', 'that', 'is', 'mathcalhn1leftleftxin', 'b_r2x_0ux0rightrightleq', 'cnalpharn1', 'where', 'nmaxleftc_0nx_0rright', 'alpha', 'c', 'and', 'c_0', 'both', 'are', 'positive', 'constants', 'depending', 'only', 'on', 'n', 'and', 'm', 'here', 'nx_0r', 'is', 'the', 'frequency', 'function', 'of', 'u', 'centered', 'at', 'x_0', 'with', 'radius', 'r', 'furthermore', 'we', 'derive', 'that', 'an', 'upper', 'measure', 'for', 'nodal', 'sets', 'of', 'eigenfunctions', 'of', 'the', 'biharmonic', 'operator', 'on', 'a', 'cinfty', 'compact', 'riemannian', 'manifold', 'without', 'boundary', 'can', 'be', 'controlled', 'by', 'lambdabeta', 'for', 'the', 'corresponding', 'eigenvalue', 'lambda2', 'and', 'some', 'positive', 'constant', 'beta']]
|
[-0.18535036773842184, 0.11547926176661436, -0.011593280030259242, 0.02124456173693207, -0.08277712087839886, -0.16344671645423486, 0.0353240510428025, 0.36536885323792895, -0.26840953073059653, -0.2184039797755845, 0.11032060609917001, -0.31816428469028324, -0.10686366663209074, 0.18742759418784685, -0.04901422059351933, 0.05246594056232078, 0.037554468718423904, 0.10693699992927057, -0.08363745824406232, -0.195956335512511, 0.42928927505341735, -0.0622990144682782, 0.16698303565083603, 0.10390619208781227, 0.10058346567841779, -0.0439472940135082, 0.04299452226232028, -0.005622363668711235, -0.22885525796005995, 0.09874716339289166, 0.16383138565912045, 0.08490629039338923, 0.2757517117119971, -0.3508547056532864, -0.16569407221617266, 0.1681879810639657, 0.13204707994840906, -0.058931832578742786, 0.00047283322991071533, -0.2815240596204863, 0.1356003297384762, -0.03913537744388339, -0.17717201741678373, -0.06953619388929967, 0.11095284075764496, 0.052037565472779705, -0.3430363852419846, 0.05397342542363774, 0.09368315461116643, 0.03537242972933676, -0.08055095135932788, -0.15039601590528728, -0.05327571210606644, 0.10110195111926823, 0.0022156348561457847, 0.10217672488735323, 0.042744962215822725, -0.029211013488358212, -0.003469147364653292, 0.3244326629598315, -0.15600981094342256, -0.3012921274196179, 0.08340592753319513, -0.21448476541661962, -0.08937547111418098, 0.0592542327510836, 0.152582664569352, 0.16183634395045893, -0.08453603808274715, 0.2178646015710824, -0.07554508650459216, 0.15659292628351112, 0.11203968313999385, 0.00044413468068731684, 0.09897165686180372, 0.0812447249966984, 0.19368730065789783, 0.09883749231812544, -0.06325986698668982, 0.014258965158313956, -0.38809806383436635, -0.15784590288482528, -0.23192441229531097, 0.14540829225665047, -0.17460379717877436, -0.18733791805182895, 0.34485283106360365, 0.028396027920410103, 0.24883507334050678, 0.09582012404488134, 0.20342972718728042, 0.18022732042802436, -0.008293114858263704, 0.11561673263176567, 0.13663871355051274, 0.13909944098503774, 0.0443783489569926, -0.2285640615598476, -0.011997528557133461, 0.13785798108715208]
|
1,803.07757
|
Measuring the thermal conductivity and interfacial thermal resistance of
suspended MoS2 using electron beam self-heating technique
|
Establishment of a new technique or extension of an existing technique for
thermal and thermoelectric measurements to a more challenging system is an
important task to explore the thermal and thermoelectric properties of various
materials and systems. The bottleneck lies in the challenges in measuring the
thermal contact resistance. In this work, we applied electron beam self-heating
technique to derive the intrinsic thermal conductivity of suspended Molybdenum
Disulfide (MoS2) ribbons and the thermal contact resistance, with which the
interfacial thermal resistance between few-layer MoS2 and Pt electrodes was
calculated. The measured room temperature thermal conductivity of MoS2 is
around 30 W/mK, while the estimated interfacial thermal resistance is around
2*10-6 m2K/W. Our experiments extend a useful branch in application of this
technique for studying thermal properties of suspended layered ribbons and have
potential application in investigating the interfacial thermal resistance of
different 2D heterojunctions.
|
cond-mat.mes-hall
|
establishment of a new technique or extension of an existing technique for thermal and thermoelectric measurements to a more challenging system is an important task to explore the thermal and thermoelectric properties of various materials and systems the bottleneck lies in the challenges in measuring the thermal contact resistance in this work we applied electron beam selfheating technique to derive the intrinsic thermal conductivity of suspended molybdenum disulfide mos2 ribbons and the thermal contact resistance with which the interfacial thermal resistance between fewlayer mos2 and pt electrodes was calculated the measured room temperature thermal conductivity of mos2 is around 30 wmk while the estimated interfacial thermal resistance is around 2106 m2kw our experiments extend a useful branch in application of this technique for studying thermal properties of suspended layered ribbons and have potential application in investigating the interfacial thermal resistance of different 2d heterojunctions
|
[['establishment', 'of', 'a', 'new', 'technique', 'or', 'extension', 'of', 'an', 'existing', 'technique', 'for', 'thermal', 'and', 'thermoelectric', 'measurements', 'to', 'a', 'more', 'challenging', 'system', 'is', 'an', 'important', 'task', 'to', 'explore', 'the', 'thermal', 'and', 'thermoelectric', 'properties', 'of', 'various', 'materials', 'and', 'systems', 'the', 'bottleneck', 'lies', 'in', 'the', 'challenges', 'in', 'measuring', 'the', 'thermal', 'contact', 'resistance', 'in', 'this', 'work', 'we', 'applied', 'electron', 'beam', 'selfheating', 'technique', 'to', 'derive', 'the', 'intrinsic', 'thermal', 'conductivity', 'of', 'suspended', 'molybdenum', 'disulfide', 'mos2', 'ribbons', 'and', 'the', 'thermal', 'contact', 'resistance', 'with', 'which', 'the', 'interfacial', 'thermal', 'resistance', 'between', 'fewlayer', 'mos2', 'and', 'pt', 'electrodes', 'was', 'calculated', 'the', 'measured', 'room', 'temperature', 'thermal', 'conductivity', 'of', 'mos2', 'is', 'around', '30', 'wmk', 'while', 'the', 'estimated', 'interfacial', 'thermal', 'resistance', 'is', 'around', '2106', 'm2kw', 'our', 'experiments', 'extend', 'a', 'useful', 'branch', 'in', 'application', 'of', 'this', 'technique', 'for', 'studying', 'thermal', 'properties', 'of', 'suspended', 'layered', 'ribbons', 'and', 'have', 'potential', 'application', 'in', 'investigating', 'the', 'interfacial', 'thermal', 'resistance', 'of', 'different', '2d', 'heterojunctions']]
|
[-0.14544318193818778, 0.12267476644147893, -0.06330501209918617, -0.06127880029938145, -0.005459888176927861, -0.18311107019609255, 0.08133978424464455, 0.40386121184565127, -0.2862903127061145, -0.3145741703014614, 0.015813825900194287, -0.316846932297469, -0.13674633134602723, 0.2712167124263942, -0.012252894390258007, 0.08646171343409353, 0.016791351553466585, -0.1166431438258668, -0.05718537925470931, -0.1561546599033237, 0.2360528184670127, 0.10138966267307599, 0.35656389069562366, 0.1748792828552218, 0.04520315660597084, -0.027810044591509115, 0.06472261979878466, 0.07661950442222103, -0.18358262957190163, 0.0829613388729437, 0.2477834234208179, -0.1657332903188136, 0.20545497526957965, -0.447471480021098, -0.23085534912914024, 0.013255399137657756, 0.08522802324377052, 0.12552914948982005, -0.058595166449979134, -0.19080998887835043, 0.08215220955187558, -0.12712734789885063, -0.10736001506949025, -0.043439035425965104, 0.0007533535099355504, -0.07450026017169067, -0.18431948714391588, 0.11564276282943967, 0.039266822755760385, 0.06723040229573801, -0.10294232269936604, -0.17609167508312062, -0.0845228052761134, 0.10030012806560586, 0.03962931731560578, -0.018902398881942242, 0.3004598623309802, -0.15343613457581443, -0.08688424809952267, 0.3752582477560888, -0.06254572678557856, -0.06687887666824584, 0.17982241585721365, -0.1273462900975978, -0.038028390677128404, 0.1403885923654242, 0.1454435946798185, 0.11655434157000855, -0.23661281403878498, 0.031156859248262156, 0.033213001840825505, 0.11743920648384826, 0.09515680995375281, 0.06865446258274864, 0.2568224765095187, 0.27091945720652194, 0.01653231732941802, 0.19806603660415728, -0.1307594537178779, 0.05834086218641864, -0.1572165487458632, -0.2549292496082166, -0.1846004878106113, 0.12233637189880635, -0.11234573785724125, -0.22245145877564532, 0.4071457027587005, 0.1923377589490782, 0.14726301136478367, -0.039260302008187864, 0.31721177062879885, 0.0957470148245597, 0.08023679578683288, 0.01478759003051285, 0.26651817463183153, 0.21895589489981326, 0.17790201655750731, -0.2889734521142802, 0.09534470305758684, -0.037716379630486095]
|
1,803.07758
|
Torsional Oscillations in the Suns rotation contribute to the
Waldmeier-effect in Solar Cycles
|
Temporal variations in the Suns internal velocity field with a periodicity of
about 11 years have been observed over the last four decades. The period of
these torsional oscillations and their latitudinal propagation roughly
coincides with the period and equatorward propagation of sunspots which
originate from a magnetohydrodynamic dynamo mechanism operating in the Suns
interior. While the solar differential rotation plays an important role in this
dynamo mechanism by inducting the toroidal component of magnetic field, the
impact of torsional oscillations on the dynamo mechanism and hence the solar
cycle is not well understood. Here, we include the observed torsional
oscillations into a flux transport dynamo model of the solar cycle to
investigate their effect. We find that the overall amplitude of the solar cycle
does not change significantly on inclusion of torsional oscillations. However,
all the characteristics of the Waldmeier effect in the sunspot cycle are
qualitatively reproduced by varying only the amplitude of torsional
oscillations. The Waldmeier effect, first noted in 1935, includes the important
characteristic that the amplitude of sunspot cycles is anti-correlated to their
rise time; cycles with high initial rise rate tend to be stronger. This has
implications for solar cycle predictions. Our results suggest that the
Waldmeier effect could be a plausible outcome of cycle to cycle modulation of
torsional oscillations and provides a physical basis for sunspot cycle
forecasts based on torsional oscillation observations. We also provide a
theoretical explanation based on the magnetic induction equation thereby
connecting two apparently disparate phenomena.
|
astro-ph.SR
|
temporal variations in the suns internal velocity field with a periodicity of about 11 years have been observed over the last four decades the period of these torsional oscillations and their latitudinal propagation roughly coincides with the period and equatorward propagation of sunspots which originate from a magnetohydrodynamic dynamo mechanism operating in the suns interior while the solar differential rotation plays an important role in this dynamo mechanism by inducting the toroidal component of magnetic field the impact of torsional oscillations on the dynamo mechanism and hence the solar cycle is not well understood here we include the observed torsional oscillations into a flux transport dynamo model of the solar cycle to investigate their effect we find that the overall amplitude of the solar cycle does not change significantly on inclusion of torsional oscillations however all the characteristics of the waldmeier effect in the sunspot cycle are qualitatively reproduced by varying only the amplitude of torsional oscillations the waldmeier effect first noted in 1935 includes the important characteristic that the amplitude of sunspot cycles is anticorrelated to their rise time cycles with high initial rise rate tend to be stronger this has implications for solar cycle predictions our results suggest that the waldmeier effect could be a plausible outcome of cycle to cycle modulation of torsional oscillations and provides a physical basis for sunspot cycle forecasts based on torsional oscillation observations we also provide a theoretical explanation based on the magnetic induction equation thereby connecting two apparently disparate phenomena
|
[['temporal', 'variations', 'in', 'the', 'suns', 'internal', 'velocity', 'field', 'with', 'a', 'periodicity', 'of', 'about', '11', 'years', 'have', 'been', 'observed', 'over', 'the', 'last', 'four', 'decades', 'the', 'period', 'of', 'these', 'torsional', 'oscillations', 'and', 'their', 'latitudinal', 'propagation', 'roughly', 'coincides', 'with', 'the', 'period', 'and', 'equatorward', 'propagation', 'of', 'sunspots', 'which', 'originate', 'from', 'a', 'magnetohydrodynamic', 'dynamo', 'mechanism', 'operating', 'in', 'the', 'suns', 'interior', 'while', 'the', 'solar', 'differential', 'rotation', 'plays', 'an', 'important', 'role', 'in', 'this', 'dynamo', 'mechanism', 'by', 'inducting', 'the', 'toroidal', 'component', 'of', 'magnetic', 'field', 'the', 'impact', 'of', 'torsional', 'oscillations', 'on', 'the', 'dynamo', 'mechanism', 'and', 'hence', 'the', 'solar', 'cycle', 'is', 'not', 'well', 'understood', 'here', 'we', 'include', 'the', 'observed', 'torsional', 'oscillations', 'into', 'a', 'flux', 'transport', 'dynamo', 'model', 'of', 'the', 'solar', 'cycle', 'to', 'investigate', 'their', 'effect', 'we', 'find', 'that', 'the', 'overall', 'amplitude', 'of', 'the', 'solar', 'cycle', 'does', 'not', 'change', 'significantly', 'on', 'inclusion', 'of', 'torsional', 'oscillations', 'however', 'all', 'the', 'characteristics', 'of', 'the', 'waldmeier', 'effect', 'in', 'the', 'sunspot', 'cycle', 'are', 'qualitatively', 'reproduced', 'by', 'varying', 'only', 'the', 'amplitude', 'of', 'torsional', 'oscillations', 'the', 'waldmeier', 'effect', 'first', 'noted', 'in', '1935', 'includes', 'the', 'important', 'characteristic', 'that', 'the', 'amplitude', 'of', 'sunspot', 'cycles', 'is', 'anticorrelated', 'to', 'their', 'rise', 'time', 'cycles', 'with', 'high', 'initial', 'rise', 'rate', 'tend', 'to', 'be', 'stronger', 'this', 'has', 'implications', 'for', 'solar', 'cycle', 'predictions', 'our', 'results', 'suggest', 'that', 'the', 'waldmeier', 'effect', 'could', 'be', 'a', 'plausible', 'outcome', 'of', 'cycle', 'to', 'cycle', 'modulation', 'of', 'torsional', 'oscillations', 'and', 'provides', 'a', 'physical', 'basis', 'for', 'sunspot', 'cycle', 'forecasts', 'based', 'on', 'torsional', 'oscillation', 'observations', 'we', 'also', 'provide', 'a', 'theoretical', 'explanation', 'based', 'on', 'the', 'magnetic', 'induction', 'equation', 'thereby', 'connecting', 'two', 'apparently', 'disparate', 'phenomena']]
|
[-0.19485053322446275, 0.22868319985277466, -0.04532085871510956, 0.10226519167961845, -0.09400469893739226, -0.03553456541741768, 0.0439285101989905, 0.3340736764397128, -0.23262397074570737, -0.3457367667127924, 0.08239937014831043, -0.19033050309515084, -0.18108074641767816, 0.26384078422500507, -0.06494694998876817, -0.04026927011663536, 0.09350658258484923, 0.043620746873667925, 0.010109679217087516, -0.17456470020900827, 0.23038299146471133, 0.10730738808816097, 0.2474454575869064, 0.0020976631797431223, 0.0704817451054163, -0.09195632139996, -0.036168771724162406, 0.04139534088906394, -0.12175030443320274, 0.05561350904644493, 0.15286639861455822, 0.08284805696008794, 0.21612294220990205, -0.5095687532184054, -0.27469628451983014, 0.06462732744337729, 0.14676922934698353, 0.09239015144849548, 0.014750483354187036, -0.19038064101052632, 0.021482946721689183, -0.1152587404711187, -0.13913580187480432, 0.00546467986404821, 0.08999096083755878, 0.01835432097088568, -0.22960659895974947, 0.11851076333001387, 0.09171295958995654, 0.150011761080339, -0.11782870033800781, -0.0925776565168801, -0.0662271720338538, 0.13690155732583809, 0.13940070049854061, 0.036734911852074885, 0.14438413575022335, -0.07029081706657078, -0.12224621345367596, 0.35846991951289364, -0.09763792910459769, -0.07081136806497731, 0.1295535153799118, -0.22999976494655305, -0.12886619596671028, 0.15337293674181923, 0.14555418792827782, 0.05266287885082654, -0.08655483210758572, -0.012707434090632332, -0.03827491531010164, 0.1438319650029831, 0.08995993150936732, 0.02078933137876681, 0.29109462013610277, 0.1751301782523622, 0.0564119605315722, 0.05615386873648229, -0.16652182637747512, -0.08319908354607182, -0.28705164576024117, -0.07088941617506037, -0.05338571810333739, 0.0870613098411258, -0.0715458460082487, -0.1882468264168465, 0.4851524787146157, 0.13667336779919614, 0.1721370857054448, -0.012904670842676368, 0.2644615063638273, 0.11936297915720691, 0.08756635088651687, 0.0816388815832156, 0.357292565479725, 0.22090355621231908, 0.16182751436932874, -0.3202321485767747, 0.10142789573883675, 0.052824125730855216]
|
1,803.07759
|
Extension of activation cross section data of long lived products in
deuteron induced nuclear reactions on platinum up to 50 MeV
|
In the frame of a systematical study of light ion induced nuclear reactions
on platinum, activation cross sections for deuteron induced reactions were
investigated. Excitation functions were measured in the 20.8 - 49.2 MeV energy
range for the natPt(d,xn)191,192,193,194,195,196m2,196g,198g,199Au,
natPt(d,x)188,189,191,195m,197m,197gPt and natPt(d,x)189,190,192,194m2Ir
reactions by using the stacked foil irradiation technique. The experimental
results are compared with previous results from the literature and with the
theoretical predictions in the TENDL-2014 and TENDL-2015 libraries. The
applicability of the produced radio-tracers for wear measurements has been
presented.
|
nucl-ex
|
in the frame of a systematical study of light ion induced nuclear reactions on platinum activation cross sections for deuteron induced reactions were investigated excitation functions were measured in the 208 492 mev energy range for the natptdxn191192193194195196m2196g198g199au natptdx188189191195m197m197gpt and natptdx189190192194m2ir reactions by using the stacked foil irradiation technique the experimental results are compared with previous results from the literature and with the theoretical predictions in the tendl2014 and tendl2015 libraries the applicability of the produced radiotracers for wear measurements has been presented
|
[['in', 'the', 'frame', 'of', 'a', 'systematical', 'study', 'of', 'light', 'ion', 'induced', 'nuclear', 'reactions', 'on', 'platinum', 'activation', 'cross', 'sections', 'for', 'deuteron', 'induced', 'reactions', 'were', 'investigated', 'excitation', 'functions', 'were', 'measured', 'in', 'the', '208', '492', 'mev', 'energy', 'range', 'for', 'the', 'natptdxn191192193194195196m2196g198g199au', 'natptdx188189191195m197m197gpt', 'and', 'natptdx189190192194m2ir', 'reactions', 'by', 'using', 'the', 'stacked', 'foil', 'irradiation', 'technique', 'the', 'experimental', 'results', 'are', 'compared', 'with', 'previous', 'results', 'from', 'the', 'literature', 'and', 'with', 'the', 'theoretical', 'predictions', 'in', 'the', 'tendl2014', 'and', 'tendl2015', 'libraries', 'the', 'applicability', 'of', 'the', 'produced', 'radiotracers', 'for', 'wear', 'measurements', 'has', 'been', 'presented']]
|
[0.026285622679279187, 0.1476400702027604, -0.040455604439921446, 0.03207417887169868, 0.050124797662647325, -0.07230286448029802, 0.0417713023693068, 0.43301879409700633, -0.18023335789330303, -0.3448086100630462, -0.005332939546497073, -0.3882367186830379, 0.014910602028248832, 0.2543444483031635, 0.0462281506988802, 0.12663195789791643, 0.11509951342304703, -0.014306334208231419, -0.05147549812681973, -0.17000094782561065, 0.265238960518036, 0.14577727600699292, 0.2815687219146639, 0.1613060032017529, 0.03268693605205044, 0.019002803604234942, -0.05272145890048705, -0.03290404145373031, -0.1641657636675518, 0.11060801793355494, 0.2615599929675227, 0.03210278884798754, 0.13215687562478706, -0.43892725531477483, -0.22190597804728895, 0.03734156569698825, 0.06602859779377468, 0.11360664928797633, -0.13007857616321417, -0.26622602944262325, 0.09173859031870961, -0.18101176379714162, -0.047852522364701146, -0.04266228476772085, 0.012645297299604863, 0.12015736462999485, -0.25846892563859003, 0.05029123848653398, -0.0134592496593541, 0.12080774826463311, -0.12901972015970387, -0.23739957134239376, -0.027519833022961394, 0.05578883973066695, 0.05247144066961482, 0.04404234033136163, 0.22399570923298598, -0.07905717507237568, -0.132566296774894, 0.36482921700226145, -0.053404024767223744, -0.10700054101180285, 0.13219557034317403, -0.13651477569364942, -0.0997389511714573, 0.17075043281074614, 0.17853247962193564, 0.13860020770225673, -0.1960059171076864, 0.039922521656990284, 0.011887393647339196, 0.14159945322849127, 0.10740135040250606, -0.01575429699732922, 0.09245254665438551, 0.21587280165258563, -0.10094032805645839, 0.09550326035405306, -0.1638731589046074, -0.053532483498565854, -0.27523323126370086, -0.08526468257769011, -0.0983096985379234, 0.02046838346432196, 0.02045394762590149, -0.04484110928024165, 0.3860411743633449, 0.06595959104015492, 0.2150904313835781, -0.015485917998012156, 0.2864891896955669, 0.07580020678433357, 0.09392893203475979, 0.01093985391780734, 0.33940485017374156, 0.2066831732954597, 0.10190289274905809, -0.2314169231976848, 0.11093839762033894, -0.01571197109296918]
|
1,803.0776
|
An Accountable Anonymous Data Aggregation Scheme for Internet of Things
|
The Internet of Things (IoT) has become increasingly popular in people's
daily lives. The pervasive IoT devices are encouraged to share data with each
other in order to better serve the users. However, users are reluctant to share
sensitive data due to privacy concerns. In this paper, we study the anonymous
data aggregation for the IoT system, in which the IoT company servers, though
not fully trustworthy, are used to assist the aggregation. We propose an
efficient and accountable aggregation scheme that can preserve the data
anonymity. We analyze the communication and computation overheads of the
proposed scheme, and evaluate the total execution time and the per-user
communication overhead with extensive simulations. The results show that our
scheme is more efficient than the previous peer-shuffle protocol, especially
for data aggregation from multiple providers.
|
cs.CR
|
the internet of things iot has become increasingly popular in peoples daily lives the pervasive iot devices are encouraged to share data with each other in order to better serve the users however users are reluctant to share sensitive data due to privacy concerns in this paper we study the anonymous data aggregation for the iot system in which the iot company servers though not fully trustworthy are used to assist the aggregation we propose an efficient and accountable aggregation scheme that can preserve the data anonymity we analyze the communication and computation overheads of the proposed scheme and evaluate the total execution time and the peruser communication overhead with extensive simulations the results show that our scheme is more efficient than the previous peershuffle protocol especially for data aggregation from multiple providers
|
[['the', 'internet', 'of', 'things', 'iot', 'has', 'become', 'increasingly', 'popular', 'in', 'peoples', 'daily', 'lives', 'the', 'pervasive', 'iot', 'devices', 'are', 'encouraged', 'to', 'share', 'data', 'with', 'each', 'other', 'in', 'order', 'to', 'better', 'serve', 'the', 'users', 'however', 'users', 'are', 'reluctant', 'to', 'share', 'sensitive', 'data', 'due', 'to', 'privacy', 'concerns', 'in', 'this', 'paper', 'we', 'study', 'the', 'anonymous', 'data', 'aggregation', 'for', 'the', 'iot', 'system', 'in', 'which', 'the', 'iot', 'company', 'servers', 'though', 'not', 'fully', 'trustworthy', 'are', 'used', 'to', 'assist', 'the', 'aggregation', 'we', 'propose', 'an', 'efficient', 'and', 'accountable', 'aggregation', 'scheme', 'that', 'can', 'preserve', 'the', 'data', 'anonymity', 'we', 'analyze', 'the', 'communication', 'and', 'computation', 'overheads', 'of', 'the', 'proposed', 'scheme', 'and', 'evaluate', 'the', 'total', 'execution', 'time', 'and', 'the', 'peruser', 'communication', 'overhead', 'with', 'extensive', 'simulations', 'the', 'results', 'show', 'that', 'our', 'scheme', 'is', 'more', 'efficient', 'than', 'the', 'previous', 'peershuffle', 'protocol', 'especially', 'for', 'data', 'aggregation', 'from', 'multiple', 'providers']]
|
[-0.18568899522793028, -0.011403155871944777, -0.03541454727140566, 0.06849811940143506, -0.1088799240621456, -0.19081413311262926, 0.09781766054132304, 0.42130847644963954, -0.25048605656025535, -0.331529290034351, 0.11517519874244252, -0.32714084339694993, -0.13351167584010964, 0.18611974843820048, -0.14834871488446053, 0.06832977837995824, 0.07414875168108141, 0.03987988818941327, 0.04726902569404267, -0.35059514981482853, 0.30479318482067547, 0.08674898972226815, 0.3901717666762345, 0.06462354428191303, 0.016473482942356812, -0.014193098921995525, -0.0779451984792214, -0.057807054137811065, -0.0660651190984495, 0.18353268462691852, 0.37328681303188205, 0.21244543633656576, 0.3564866389514822, -0.48088748630305583, -0.17207254918122833, 0.11064458649012852, 0.18981229797866422, 0.09216075396486276, -0.06027541858036949, -0.309052163749143, 0.15695653856506175, -0.25041937423785304, -0.05914092930150659, -0.10579303103837777, -0.02213487412540637, 0.03521578349737507, -0.27368484388121445, -0.006441797364404369, -0.05392933300445844, 0.031231844480234115, -0.018270830660516036, -0.02803251022829279, -0.03143502053959916, 0.21171152597614282, 0.07513169012787385, -0.050438470469089225, 0.15916497184132988, -0.11338815538367657, -0.1346058235785952, 0.4054962205982795, 0.04036099215910795, -0.14916160098756803, 0.18271539448654617, -0.04256109166608164, -0.1576385628008707, 0.08735240511172875, 0.23938341421837156, 0.0622161517014981, -0.20143444921510914, -0.006022167908888536, 0.0017360388936305587, 0.18877329392302217, 0.004984236530479834, 0.11075261386224267, 0.1270607888952575, 0.20091582556734933, 0.13920233890795233, 0.06508664238120246, -0.028599642449989915, -0.13429800399833106, -0.1674505090380659, -0.18645564626168573, -0.17233933720016273, -0.006047585617400755, -0.09685105637066899, -0.08970106986464199, 0.32943919020690926, 0.2700154821839974, 0.14808954975821756, 0.0851018850375884, 0.42230713982699497, 0.034836442885782824, 0.1387641393494877, 0.18648549303355993, 0.149930850983682, -0.038909312401136216, 0.23669269675332488, -0.16138236176144952, 0.14418058819137514, -0.050821599938596286]
|
1,803.07761
|
The K\"ahler-Ricci flow on pseudoconvex domains
|
We establish the existence of K\"ahler-Ricci flow on pseudoconvex domains
with general initial metric without curvature bounds. Moreover we prove that
this flow is simultaneously complete, and its normalized version converge to
the complete K\"ahler-Einstein metric, which generalizes Topping's works on
surfaces.
|
math.DG
|
we establish the existence of kahlerricci flow on pseudoconvex domains with general initial metric without curvature bounds moreover we prove that this flow is simultaneously complete and its normalized version converge to the complete kahlereinstein metric which generalizes toppings works on surfaces
|
[['we', 'establish', 'the', 'existence', 'of', 'kahlerricci', 'flow', 'on', 'pseudoconvex', 'domains', 'with', 'general', 'initial', 'metric', 'without', 'curvature', 'bounds', 'moreover', 'we', 'prove', 'that', 'this', 'flow', 'is', 'simultaneously', 'complete', 'and', 'its', 'normalized', 'version', 'converge', 'to', 'the', 'complete', 'kahlereinstein', 'metric', 'which', 'generalizes', 'toppings', 'works', 'on', 'surfaces']]
|
[-0.1750465401537007, -0.007547131273895502, -0.13110326501053005, 0.061740367274199216, -0.14565982292628005, -0.1541009827716542, -0.04546237014056671, 0.3799917500554806, -0.2193287905372147, -0.1603835996329075, 0.12523395224430023, -0.28697255850281744, -0.15286344815866046, 0.18192137536104946, -0.21224912517659722, 0.04136346291523382, 0.1439703455460923, 0.07274588377081923, -0.11262746500627448, -0.3154540892878902, 0.46887342995476156, -0.050713627687877134, 0.3039522635185027, 0.19699409870164736, 0.11483372732376058, -0.0213321421650194, 0.04223323766408222, 0.06373413122214731, -0.2837730514703643, 0.13872670184909588, 0.19683799717486614, 0.11019964591001294, 0.20665619772903265, -0.3683044245643985, -0.2528496498818554, 0.20559084619439782, 0.08171735169543397, 0.04018300415537808, 0.001467748423151317, -0.31531814490223214, 0.15208435076333227, -0.008722704613492602, -0.20116740653646134, -0.12198463375014919, -0.05562788886683328, 0.053390621118957086, -0.22997527658229783, 0.05750977352172846, 0.17811678838916123, 0.015709218236484697, -0.10520476701813528, -0.046096243604552, -0.056212782859802246, 0.07674853794188016, 0.05106019733717576, 0.101909390229377, 0.08775984419376723, -0.039755693675639726, -0.06870247691958434, 0.284779989648433, -0.16028082681198916, -0.3019903813976617, 0.11752376838454179, -0.12316269691412647, -0.11770867868991834, 0.07879261774221613, 0.204477671533823, 0.2613279548074518, -0.04018719773462397, 0.11759713946126535, -0.11336442477823723, 0.08071247865224168, 0.1447231332505388, -0.030818883344874762, 0.06980318019521378, 0.11720568713332925, 0.28205515736980097, 0.13804058082556972, 0.032293356877441205, -0.12981764781510546, -0.3487541065329597, -0.171126181559105, -0.1561359950019756, 0.1678151497229313, -0.16445045072240255, -0.1974161577250232, 0.3843716716704269, 0.028311932570345345, 0.21291868228997504, 0.2130166864538166, 0.25455627381979, 0.015639626287988255, -0.02381413810265561, 0.214368430354322, 0.21350556745060853, 0.17489298684744253, 0.11549436990615158, -0.14294337930290826, 0.00314423154729108, 0.1955080401773254]
|
1,803.07762
|
Symmetry of entropy in higher rank diagonalizable actions and measure
classification
|
An important consequence of the theory of entropy of Z-actions is that the
events measurable with respect to the far future coincide (modulo null sets)
with those measurable with respect to the distant past, and that measuring the
entropy using the past will give the same value as measuring it using the
future. In this paper we show that for measures invariant under multiparameter
algebraic actions if the entropy attached to coarse Lyapunov foliations fail to
display a stronger symmetry property of a similar type this forces the measure
to be invariant under non-trivial unipotent groups. Some consequences of this
phenomenon are noted.
|
math.DS
|
an important consequence of the theory of entropy of zactions is that the events measurable with respect to the far future coincide modulo null sets with those measurable with respect to the distant past and that measuring the entropy using the past will give the same value as measuring it using the future in this paper we show that for measures invariant under multiparameter algebraic actions if the entropy attached to coarse lyapunov foliations fail to display a stronger symmetry property of a similar type this forces the measure to be invariant under nontrivial unipotent groups some consequences of this phenomenon are noted
|
[['an', 'important', 'consequence', 'of', 'the', 'theory', 'of', 'entropy', 'of', 'zactions', 'is', 'that', 'the', 'events', 'measurable', 'with', 'respect', 'to', 'the', 'far', 'future', 'coincide', 'modulo', 'null', 'sets', 'with', 'those', 'measurable', 'with', 'respect', 'to', 'the', 'distant', 'past', 'and', 'that', 'measuring', 'the', 'entropy', 'using', 'the', 'past', 'will', 'give', 'the', 'same', 'value', 'as', 'measuring', 'it', 'using', 'the', 'future', 'in', 'this', 'paper', 'we', 'show', 'that', 'for', 'measures', 'invariant', 'under', 'multiparameter', 'algebraic', 'actions', 'if', 'the', 'entropy', 'attached', 'to', 'coarse', 'lyapunov', 'foliations', 'fail', 'to', 'display', 'a', 'stronger', 'symmetry', 'property', 'of', 'a', 'similar', 'type', 'this', 'forces', 'the', 'measure', 'to', 'be', 'invariant', 'under', 'nontrivial', 'unipotent', 'groups', 'some', 'consequences', 'of', 'this', 'phenomenon', 'are', 'noted']]
|
[-0.1422389795307468, 0.13264889606103433, -0.13781503417068025, 0.09508794821681256, -0.06019301287540533, -0.12045995810620704, -0.011921028846205727, 0.33879658386328265, -0.3123362243398165, -0.2120497624030409, 0.11084756142916428, -0.2896125933055956, -0.1308187470631222, 0.2241420697836766, -0.12618041035475647, 0.05832429685589215, 0.044569032920018126, 0.12884416697022405, -0.10376807101730945, -0.22938560999283406, 0.38544871128679625, 0.0628084096262453, 0.2549275249441706, 0.04655778552156882, 0.0818327620571244, -0.0229989418497725, -0.013060214596990388, 0.0824860731700381, -0.154205071575331, 0.1280796266572315, 0.2435080268718664, 0.09600219696091072, 0.22621122125967957, -0.3739525990298434, -0.18069164092806214, 0.21523799321351988, 0.07267630228646171, 0.055087850212110476, -0.031009290973176656, -0.310857140269239, 0.1161342748040695, -0.14630595635559446, -0.1788412030171422, -0.08837108286007227, 0.051482615703083934, 0.015686098459059175, -0.21910467562582164, 0.06201584075658935, 0.07261360781176866, 0.0976973620369958, -0.06294994574329517, -0.05126555825389235, -0.04182248481196686, 0.1314649676668991, 0.11173784000193249, 0.049744939214540915, 0.1254359108172086, -0.06125512983405836, -0.12231184288664965, 0.36773058046921364, -0.0745605517142606, -0.22252511468450922, 0.20458274099125878, -0.1964269888867597, -0.1948255103271346, 0.08244357995227775, 0.118357276236548, 0.11050233131871351, -0.12426905761002699, 0.06068165509823655, -0.08354238269724024, 0.10098832460274033, 0.086492265868498, 0.09420281776579693, 0.18738673628732852, 0.07513646345621752, 0.12778343182979424, 0.13379050666371414, -0.010415054007785992, -0.06292215635032547, -0.35122990864102993, -0.17792629216824776, -0.1249542161008542, 0.10445743257595787, -0.06716365343650907, -0.16118024084581406, 0.367709231418241, 0.17211369937342294, 0.21563064179680472, 0.08816736793932188, 0.22957774837166794, 0.1164965110602653, 0.08858625306996508, 0.041557217184092526, 0.2416663264770409, 0.13448934640409876, 0.014922773320842716, -0.182388588569118, 0.0834055506732785, 0.0872977697606949]
|
1,803.07763
|
From Gauss to Kolmogorov: Localized Measures of Complexity for Ellipses
|
The Gaussian width is a fundamental quantity in probability, statistics and
geometry, known to underlie the intrinsic difficulty of estimation and
hypothesis testing. In this work, we show how the Gaussian width, when
localized to any given point of an ellipse, can be controlled by the Kolmogorov
width of a set similarly localized. This connection leads to an explicit
characterization of the estimation error of least-squares regression as a
function of the true regression vector within the ellipse. The rate of error
decay varies substantially as a function of location: as a concrete example, in
Sobolev ellipses of smoothness $\alpha$, we exhibit rates that vary from
$(\sigma^2)^{\frac{2 \alpha}{2 \alpha + 1}}$, corresponding to the classical
global rate, to the faster rate $(\sigma^2)^{\frac{4 \alpha}{4 \alpha + 1}}$.
We also show how the local Kolmogorov width can be related to local metric
entropy.
|
math.ST cs.IT math.IT stat.TH
|
the gaussian width is a fundamental quantity in probability statistics and geometry known to underlie the intrinsic difficulty of estimation and hypothesis testing in this work we show how the gaussian width when localized to any given point of an ellipse can be controlled by the kolmogorov width of a set similarly localized this connection leads to an explicit characterization of the estimation error of leastsquares regression as a function of the true regression vector within the ellipse the rate of error decay varies substantially as a function of location as a concrete example in sobolev ellipses of smoothness alpha we exhibit rates that vary from sigma2frac2 alpha2 alpha 1 corresponding to the classical global rate to the faster rate sigma2frac4 alpha4 alpha 1 we also show how the local kolmogorov width can be related to local metric entropy
|
[['the', 'gaussian', 'width', 'is', 'a', 'fundamental', 'quantity', 'in', 'probability', 'statistics', 'and', 'geometry', 'known', 'to', 'underlie', 'the', 'intrinsic', 'difficulty', 'of', 'estimation', 'and', 'hypothesis', 'testing', 'in', 'this', 'work', 'we', 'show', 'how', 'the', 'gaussian', 'width', 'when', 'localized', 'to', 'any', 'given', 'point', 'of', 'an', 'ellipse', 'can', 'be', 'controlled', 'by', 'the', 'kolmogorov', 'width', 'of', 'a', 'set', 'similarly', 'localized', 'this', 'connection', 'leads', 'to', 'an', 'explicit', 'characterization', 'of', 'the', 'estimation', 'error', 'of', 'leastsquares', 'regression', 'as', 'a', 'function', 'of', 'the', 'true', 'regression', 'vector', 'within', 'the', 'ellipse', 'the', 'rate', 'of', 'error', 'decay', 'varies', 'substantially', 'as', 'a', 'function', 'of', 'location', 'as', 'a', 'concrete', 'example', 'in', 'sobolev', 'ellipses', 'of', 'smoothness', 'alpha', 'we', 'exhibit', 'rates', 'that', 'vary', 'from', 'sigma2frac2', 'alpha2', 'alpha', '1', 'corresponding', 'to', 'the', 'classical', 'global', 'rate', 'to', 'the', 'faster', 'rate', 'sigma2frac4', 'alpha4', 'alpha', '1', 'we', 'also', 'show', 'how', 'the', 'local', 'kolmogorov', 'width', 'can', 'be', 'related', 'to', 'local', 'metric', 'entropy']]
|
[-0.084545459829434, 0.08806763449620054, -0.07211877519169646, 0.12712945938739165, -0.03704521538737318, -0.1344531432820661, 0.06005313948058544, 0.3633570164224527, -0.3459637510100801, -0.2709893122057084, 0.09527249000354732, -0.22874019486680083, -0.13738985478633295, 0.20271690541293716, -0.09152788363132, 0.09211120167135323, -0.004809467608013945, 0.07782038917805809, -0.09783046298157287, -0.22624871928081677, 0.30173595765619166, 0.07684264468015546, 0.2502675363997908, 0.008979608437359116, 0.04637166794498254, -0.015126573798810914, -0.009407590262347111, 0.005774487847509883, -0.18079883853564366, 0.11699173848287467, 0.1867803861149145, 0.1370569929059078, 0.2943221342743096, -0.32386730808465586, -0.18759311974918755, 0.12750987534625388, 0.17160808399360436, 0.07510996912436112, 0.023728757828174935, -0.262089648163354, 0.09071795073725337, -0.11649063759463003, -0.1622411515971605, -0.02221698724039334, 0.030533280821829815, 0.045395830415026116, -0.30862224061912213, 0.1533048817882379, 0.09868123008441317, 0.02159071613755757, -0.04398434212682837, -0.0984902661021826, -0.008608033328255923, 0.12321456819097172, 0.08098489694113768, 0.07916542432563257, 0.1420355241602953, -0.14025185537612894, -0.10162923015640492, 0.3106844270275566, -0.09891198231179239, -0.2622494927580285, 0.12607420237231864, -0.1638405590970749, -0.07725594351391044, 0.14933527358569695, 0.19062001236636247, 0.08571358615478133, -0.09398025660539797, 0.08274643474520205, -0.039309815500257875, 0.22686712666568482, 0.07406182307325113, 0.029785444562316594, 0.14041920604836874, 0.10820175250346371, 0.10120641302154229, 0.142909677364408, -0.138041705726289, -0.07858169646117918, -0.3474868864201716, -0.16259681340774357, -0.19124890435113143, 0.07336592875305481, -0.14955575533706633, -0.2003160083877181, 0.37311652261954154, 0.12434136689543711, 0.2535308612864057, 0.09134040807924458, 0.24863796798770663, 0.17272764720359604, 0.004378566780147979, 0.06773911530736589, 0.23595818631133458, 0.13270085532537723, 0.013495287616621622, -0.198421288732045, 0.10117283953951985, 0.0743368907906387]
|
1,803.07764
|
Estimating defectiveness of source code: A predictive model using GitHub
content
|
Two key contributions presented in this paper are: i) A method for building a
dataset containing source code features extracted from source files taken from
Open Source Software (OSS) and associated bug reports, ii) A predictive model
for estimating defectiveness of a given source code. These artifacts can be
useful for building tools and techniques pertaining to several automated
software engineering areas such as bug localization, code review, and
recommendation and program repair.
In order to achieve our goal, we first extract coding style information (e.g.
related to programming language constructs used in the source code) for source
code files present on GitHub. Then the information available in bug reports (if
any) associated with these source code files are extracted. Thus fetched un(/
semi)-structured information is then transformed into a structured knowledge
base. We considered more than 30400 source code files from 20 different GitHub
repositories with about 14950 associated bug reports across 4 bug tracking
portals. The source code files considered are written in four programming
languages (viz., C, C++, Java, and Python) and belong to different types of
applications.
A machine learning (ML) model for estimating the defectiveness of a given
input source code is then trained using the knowledge base. In order to pick
the best ML model, we evaluated 8 different ML algorithms such as Random
Forest, K Nearest Neighbour and SVM with around 50 parameter configurations to
compare their performance on our tasks. One of our findings shows that best
K-fold (with k=5) cross-validation results are obtained with the NuSVM
technique that gives a mean F1 score of 0.914.
|
cs.SE cs.LG
|
two key contributions presented in this paper are i a method for building a dataset containing source code features extracted from source files taken from open source software oss and associated bug reports ii a predictive model for estimating defectiveness of a given source code these artifacts can be useful for building tools and techniques pertaining to several automated software engineering areas such as bug localization code review and recommendation and program repair in order to achieve our goal we first extract coding style information eg related to programming language constructs used in the source code for source code files present on github then the information available in bug reports if any associated with these source code files are extracted thus fetched un semistructured information is then transformed into a structured knowledge base we considered more than 30400 source code files from 20 different github repositories with about 14950 associated bug reports across 4 bug tracking portals the source code files considered are written in four programming languages viz c c java and python and belong to different types of applications a machine learning ml model for estimating the defectiveness of a given input source code is then trained using the knowledge base in order to pick the best ml model we evaluated 8 different ml algorithms such as random forest k nearest neighbour and svm with around 50 parameter configurations to compare their performance on our tasks one of our findings shows that best kfold with k5 crossvalidation results are obtained with the nusvm technique that gives a mean f1 score of 0914
|
[['two', 'key', 'contributions', 'presented', 'in', 'this', 'paper', 'are', 'i', 'a', 'method', 'for', 'building', 'a', 'dataset', 'containing', 'source', 'code', 'features', 'extracted', 'from', 'source', 'files', 'taken', 'from', 'open', 'source', 'software', 'oss', 'and', 'associated', 'bug', 'reports', 'ii', 'a', 'predictive', 'model', 'for', 'estimating', 'defectiveness', 'of', 'a', 'given', 'source', 'code', 'these', 'artifacts', 'can', 'be', 'useful', 'for', 'building', 'tools', 'and', 'techniques', 'pertaining', 'to', 'several', 'automated', 'software', 'engineering', 'areas', 'such', 'as', 'bug', 'localization', 'code', 'review', 'and', 'recommendation', 'and', 'program', 'repair', 'in', 'order', 'to', 'achieve', 'our', 'goal', 'we', 'first', 'extract', 'coding', 'style', 'information', 'eg', 'related', 'to', 'programming', 'language', 'constructs', 'used', 'in', 'the', 'source', 'code', 'for', 'source', 'code', 'files', 'present', 'on', 'github', 'then', 'the', 'information', 'available', 'in', 'bug', 'reports', 'if', 'any', 'associated', 'with', 'these', 'source', 'code', 'files', 'are', 'extracted', 'thus', 'fetched', 'un', 'semistructured', 'information', 'is', 'then', 'transformed', 'into', 'a', 'structured', 'knowledge', 'base', 'we', 'considered', 'more', 'than', '30400', 'source', 'code', 'files', 'from', '20', 'different', 'github', 'repositories', 'with', 'about', '14950', 'associated', 'bug', 'reports', 'across', '4', 'bug', 'tracking', 'portals', 'the', 'source', 'code', 'files', 'considered', 'are', 'written', 'in', 'four', 'programming', 'languages', 'viz', 'c', 'c', 'java', 'and', 'python', 'and', 'belong', 'to', 'different', 'types', 'of', 'applications', 'a', 'machine', 'learning', 'ml', 'model', 'for', 'estimating', 'the', 'defectiveness', 'of', 'a', 'given', 'input', 'source', 'code', 'is', 'then', 'trained', 'using', 'the', 'knowledge', 'base', 'in', 'order', 'to', 'pick', 'the', 'best', 'ml', 'model', 'we', 'evaluated', '8', 'different', 'ml', 'algorithms', 'such', 'as', 'random', 'forest', 'k', 'nearest', 'neighbour', 'and', 'svm', 'with', 'around', '50', 'parameter', 'configurations', 'to', 'compare', 'their', 'performance', 'on', 'our', 'tasks', 'one', 'of', 'our', 'findings', 'shows', 'that', 'best', 'kfold', 'with', 'k5', 'crossvalidation', 'results', 'are', 'obtained', 'with', 'the', 'nusvm', 'technique', 'that', 'gives', 'a', 'mean', 'f1', 'score', 'of', '0914']]
|
[-0.05876704504024662, -0.02847686771324662, -0.037686984478797016, 0.0782840927879542, -0.09608112104651394, -0.2470738818521962, 0.0503153382112651, 0.4146791332022432, -0.26619475642962825, -0.36634602234433244, 0.12045422087614062, -0.32751643425916027, -0.07193862426381543, 0.23338042285307506, -0.05597041094031171, 0.07521376351747545, 0.12083292794821097, 0.04961722544854783, -0.050110473193072436, -0.29761339584985186, 0.29795058013361386, 0.058037958157464806, 0.2728813764910982, 0.026330678638322242, 0.05123852578809789, -0.006498605770699878, -0.11080961059885164, -0.032835630363582884, -0.08454463553037043, 0.1383822213428116, 0.3705122549146123, 0.28069605632816147, 0.2454357417778399, -0.34668999704967884, -0.1732167669553345, -0.006587289162192621, 0.13648185590559841, 0.12948237387321804, -0.026919497683112678, -0.2828947437870468, 0.13012054947226134, -0.19988097843958397, -0.03365758354262141, -0.035616317302247104, -0.01964126231385432, 0.01060115869494311, -0.26086590711528457, -0.03425842713380495, 0.02854229163660884, 0.12427495726996841, -0.04301421435110753, -0.18767378044211988, -0.022617154491767853, 0.19375029248769746, 0.03671610183675664, 0.11153769651082603, 0.14728450423333184, -0.09093686108727064, -0.150500100317142, 0.38263096513771966, -0.07645980242274378, -0.1939364854979396, 0.18812843609580013, 0.010687302222595809, -0.17571444692932947, 0.1065104917159212, 0.2408861373905305, 0.0852067973040896, -0.20414020716542017, 0.018098432651478372, 0.009088623546375522, 0.26329744837163616, 0.055862722325248526, -0.011610921419193763, 0.20473050395825332, 0.1670354098292287, -0.045250290976890394, 0.16930785465024115, -0.07441442238920308, -0.028858177256752725, -0.2662439177170424, -0.11736915924342016, -0.16212286601221976, -0.017807020869074184, -0.09694203422826445, -0.1756565407787878, 0.3977226846813341, 0.21763033851159616, 0.10533001247665955, 0.06097781143012676, 0.2912140936774871, -0.036083269414152, 0.12031521875421895, 0.1829030435946646, 0.07178459892238884, 0.005986604209238585, 0.10146077512674911, -0.1319345120157331, 0.08377361617550368, 0.03598114165403091]
|
1,803.07765
|
Atomic inner-shell radiation seeded free-electron lasers
|
In order to effectively improve the output quality of X-ray free electron
laser (XFEL), we theoretically propose an XFEL scheme seeded by atomic
inner-shell laser. As well known, an atomic inner-shell laser based on neutral
atoms and pumped by an XFEL has been experimentally demonstrated, which
produced sub-femtosecond X-ray pulses with increased temporal coherence. It
shows that, by using the inner-shell laser as a seed to modulate the electron
bunch, very stable and almost fully-coherent short-wavelength XFEL pulses can
be generated. The proposed scheme holds promising prospects in X-ray
wavelengths, and even shorter.
|
physics.acc-ph
|
in order to effectively improve the output quality of xray free electron laser xfel we theoretically propose an xfel scheme seeded by atomic innershell laser as well known an atomic innershell laser based on neutral atoms and pumped by an xfel has been experimentally demonstrated which produced subfemtosecond xray pulses with increased temporal coherence it shows that by using the innershell laser as a seed to modulate the electron bunch very stable and almost fullycoherent shortwavelength xfel pulses can be generated the proposed scheme holds promising prospects in xray wavelengths and even shorter
|
[['in', 'order', 'to', 'effectively', 'improve', 'the', 'output', 'quality', 'of', 'xray', 'free', 'electron', 'laser', 'xfel', 'we', 'theoretically', 'propose', 'an', 'xfel', 'scheme', 'seeded', 'by', 'atomic', 'innershell', 'laser', 'as', 'well', 'known', 'an', 'atomic', 'innershell', 'laser', 'based', 'on', 'neutral', 'atoms', 'and', 'pumped', 'by', 'an', 'xfel', 'has', 'been', 'experimentally', 'demonstrated', 'which', 'produced', 'subfemtosecond', 'xray', 'pulses', 'with', 'increased', 'temporal', 'coherence', 'it', 'shows', 'that', 'by', 'using', 'the', 'innershell', 'laser', 'as', 'a', 'seed', 'to', 'modulate', 'the', 'electron', 'bunch', 'very', 'stable', 'and', 'almost', 'fullycoherent', 'shortwavelength', 'xfel', 'pulses', 'can', 'be', 'generated', 'the', 'proposed', 'scheme', 'holds', 'promising', 'prospects', 'in', 'xray', 'wavelengths', 'and', 'even', 'shorter']]
|
[-0.026965862575678096, 0.26427259579503043, -0.03374954031139452, 0.08504522672130836, 0.05496350080976563, -0.17932656999947805, 0.03291129062493001, 0.5858464605144916, -0.2356278946612566, -0.29840281748423175, 0.003109953003204478, -0.24832587048251142, -0.006825333551293419, 0.30099369972063006, 0.029528659768402576, 0.11168643752092956, 0.029319877485914896, -0.10812506191833045, 0.051747812008264886, -0.21103293839992293, 0.22201394408901212, 0.19760721987013213, 0.33253050815834795, 0.0559886170060484, 0.17152204564822618, 0.05447619998707406, 0.042093540441685465, -0.08889234743972299, -0.07156905641828436, 0.10569409334904424, 0.27703748273623163, 0.06277554650710876, 0.2716168084892855, -0.4992645988090625, -0.25227244489736134, -0.009271424582919045, 0.17979045068064042, 0.12269293292931291, -0.13306160248760934, -0.26179203348013985, 0.03418387932282302, -0.20858232594866266, -0.13534768206638195, -0.06629562155613976, -0.016895635609304713, 0.0997270966269156, -0.26924307892719906, -0.06486032217220274, -0.008413843981425969, -0.00359991584999627, -0.06741067516787719, 0.030534714430330262, -0.011112196503647713, 0.0039729046064519115, -0.006894986265369, 0.07426222469857945, 0.18847389341962914, -0.09396954765042631, -0.1490407332687849, 0.3780707552157823, -0.1209663149953309, -0.0034542188088419615, 0.13886332177677221, -0.19453737350250844, -0.001255920134304512, 0.2308697860327459, 0.06219236949278462, 0.15704642970275173, -0.10801212327374567, -0.0059826007439965825, -0.012734858709717951, 0.32644484100002114, 0.24733823904347035, 0.14633738829614093, 0.20008203885968653, 0.19821269374956646, 0.07966285362158732, 0.17326959417707297, -0.14787730894030213, 0.05044713741674098, -0.19492555994500396, -0.04058803707080823, -0.17291263697458611, 0.0756346332798061, 0.02537149542949528, -0.11248374204601973, 0.4016033899446953, 0.14219430339853129, 0.055900514987047, -0.12850080678735168, 0.365503815753806, 0.1450890537366391, 0.01889568325182203, 0.006279445708959654, 0.2550094061561169, 0.10213985595782037, 0.07162393426762954, -0.26529619023604417, 0.024556122605078, 0.03618753437073]
|
1,803.07766
|
Activation cross-sections of longer lived radioisotopes of proton
induced nuclear reactions on terbium up to 65 MeV
|
Experimental cross sections are presented for the
159Tb(p,xn)153,155,157,159Dy, 152,153,155,156m2,m1,g,158Tb and 153,151Gd
nuclear reactions up to 65 MeV. The experimental results are compared with the
recently reported experimental data and with the results of the nuclear
reaction codes ALICE-IPPE, EMPIRE and TALYS as reported in the TENDL-2015
on-line library. Integral thick-target yields are also derived for the reaction
products used in practical applications and production routes are discussed.
|
nucl-ex
|
experimental cross sections are presented for the 159tbpxn153155157159dy 152153155156m2m1g158tb and 153151gd nuclear reactions up to 65 mev the experimental results are compared with the recently reported experimental data and with the results of the nuclear reaction codes aliceippe empire and talys as reported in the tendl2015 online library integral thicktarget yields are also derived for the reaction products used in practical applications and production routes are discussed
|
[['experimental', 'cross', 'sections', 'are', 'presented', 'for', 'the', '159tbpxn153155157159dy', '152153155156m2m1g158tb', 'and', '153151gd', 'nuclear', 'reactions', 'up', 'to', '65', 'mev', 'the', 'experimental', 'results', 'are', 'compared', 'with', 'the', 'recently', 'reported', 'experimental', 'data', 'and', 'with', 'the', 'results', 'of', 'the', 'nuclear', 'reaction', 'codes', 'aliceippe', 'empire', 'and', 'talys', 'as', 'reported', 'in', 'the', 'tendl2015', 'online', 'library', 'integral', 'thicktarget', 'yields', 'are', 'also', 'derived', 'for', 'the', 'reaction', 'products', 'used', 'in', 'practical', 'applications', 'and', 'production', 'routes', 'are', 'discussed']]
|
[0.014136940022581257, 0.09399378784291912, -0.016877223411029263, 0.08598413068830268, 0.026264117209848337, -0.10372390600969084, 0.0014391668373718858, 0.4059917749837041, -0.18852978567156242, -0.3244281866645906, 0.06292051873970195, -0.3752557012048783, -0.026211498799966648, 0.33015451207756996, 0.043830846407217905, 0.15973949059844017, 0.14877452190921758, 0.031354763712442946, -0.02309544221498072, -0.25731187206110917, 0.2571719010011293, 0.16794452333124354, 0.2322698593197856, 0.16981087785825366, 0.025520595316265826, -0.02004791307990672, -0.08779379158931988, -0.06837429740699008, -0.18817357160151005, 0.15722500468837097, 0.35334372708166484, 0.10408060380723327, 0.05628984171198681, -0.4117518741550157, -0.18237130521447398, 0.017924733387189917, 0.07971875427756459, 0.13900494648260064, -0.16178953659255058, -0.2821818934753537, 0.08516216301359236, -0.23399603317375295, -0.04381670989096165, -0.09200020630669314, 0.023006190298474394, 0.10880658362293616, -0.28721591614885256, 0.03815518994770173, -0.09450536005897447, 0.0645913772204949, -0.14097223365024547, -0.3168874872790184, -0.009587670210748911, 0.09264260208874475, 0.027299840570776723, 0.03235806339671399, 0.16520690788820502, -0.04919401965162251, -0.20556654014217202, 0.4120258525945246, -0.0035475554614095017, -0.11118464032915654, 0.15880085798926302, -0.08095078142650891, -0.13443771717720665, 0.17019738351518754, 0.16696883432450704, 0.08903875663236249, -0.17814447295131686, 0.04678088568584826, 0.01660202135099098, 0.08795024940263829, 0.05168879266420845, 0.0020463602268137038, 0.016781075843027793, 0.17832661784996162, -0.11238368756312411, 0.09902003009847249, -0.1174682014825521, -0.15406509964668658, -0.3105679731233977, -0.10486314217268955, -0.06862440261465963, 0.010660478055797284, -0.033052876117835694, -0.03286365928943269, 0.3190215205249842, 0.07001875833520899, 0.20414891274413094, 0.01609556603943929, 0.28669115994125605, 0.051163764741431805, 0.10485097781929653, 0.08959824504563585, 0.30700654978863895, 0.1942723021202255, 0.13839279759849887, -0.18649213571916334, 0.10388681176846148, -0.032103969180752756]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.