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.04267
|
Gravitational collapse and structure formation in an expanding universe
with dark energy
|
Observations show that the expansion of the Universe is accelerating. This
requires that the dominant constituent of matter in the Universe has some
unusual properties like negative pressure. This exotic component has been given
the name dark energy. We work with the simplest model of dark energy, the
cosmological constant introduced by Einstein. We study the evolution of
spherical over-densities in such a model and show that there is a minimum
over-density required for collapse: perturbations with a smaller amplitude do
not collapse. This threshold is interesting as even perturbations with a
positive over-density and negative energy do not collapse in finite time.
Further, we show that perturbations with an amplitude larger than, but
comparable to the threshold value, take a very long time to collapse. We
compare the solutions with the case when dark energy is absent.
|
physics.pop-ph astro-ph.CO gr-qc
|
observations show that the expansion of the universe is accelerating this requires that the dominant constituent of matter in the universe has some unusual properties like negative pressure this exotic component has been given the name dark energy we work with the simplest model of dark energy the cosmological constant introduced by einstein we study the evolution of spherical overdensities in such a model and show that there is a minimum overdensity required for collapse perturbations with a smaller amplitude do not collapse this threshold is interesting as even perturbations with a positive overdensity and negative energy do not collapse in finite time further we show that perturbations with an amplitude larger than but comparable to the threshold value take a very long time to collapse we compare the solutions with the case when dark energy is absent
|
[['observations', 'show', 'that', 'the', 'expansion', 'of', 'the', 'universe', 'is', 'accelerating', 'this', 'requires', 'that', 'the', 'dominant', 'constituent', 'of', 'matter', 'in', 'the', 'universe', 'has', 'some', 'unusual', 'properties', 'like', 'negative', 'pressure', 'this', 'exotic', 'component', 'has', 'been', 'given', 'the', 'name', 'dark', 'energy', 'we', 'work', 'with', 'the', 'simplest', 'model', 'of', 'dark', 'energy', 'the', 'cosmological', 'constant', 'introduced', 'by', 'einstein', 'we', 'study', 'the', 'evolution', 'of', 'spherical', 'overdensities', 'in', 'such', 'a', 'model', 'and', 'show', 'that', 'there', 'is', 'a', 'minimum', 'overdensity', 'required', 'for', 'collapse', 'perturbations', 'with', 'a', 'smaller', 'amplitude', 'do', 'not', 'collapse', 'this', 'threshold', 'is', 'interesting', 'as', 'even', 'perturbations', 'with', 'a', 'positive', 'overdensity', 'and', 'negative', 'energy', 'do', 'not', 'collapse', 'in', 'finite', 'time', 'further', 'we', 'show', 'that', 'perturbations', 'with', 'an', 'amplitude', 'larger', 'than', 'but', 'comparable', 'to', 'the', 'threshold', 'value', 'take', 'a', 'very', 'long', 'time', 'to', 'collapse', 'we', 'compare', 'the', 'solutions', 'with', 'the', 'case', 'when', 'dark', 'energy', 'is', 'absent']]
|
[-0.14775037869939284, 0.15161153339653063, -0.11248087004987874, 0.11969816457713023, -0.10228810636866567, -0.0952405097010289, -0.033862277743932995, 0.34645802943893045, -0.18504587804858127, -0.314857363174467, 0.07794590860240809, -0.25158176212605304, -0.11143573443742766, 0.131033867342816, 0.023168412367458983, -0.002670122890908649, 0.035846095997840166, 0.07775625557321515, -0.06056888071496202, -0.24823608002422945, 0.3486980554796215, 0.1036220789225637, 0.21711900006250842, 0.03246309760741997, 0.07828226157774527, -0.07765240727694354, 0.00921712899108188, 0.05643501548447471, -0.16731838442944497, 0.008008431818714176, 0.17634006588902423, 0.10240852264383726, 0.3009573233371223, -0.4037084219086429, -0.2565440309117548, 0.2019941551219402, 0.15977461506491122, 0.1592596272357564, -0.10059022748896825, -0.22704796013726003, 0.10095401956915748, -0.17591539433097764, -0.15108496189940776, -0.04123652074654735, 0.05053392390086167, 0.007104496618368379, -0.22002059137246208, 0.14208384447619724, 0.050298946457442595, -0.049348018165893744, -0.09814204026749222, -0.08694796171039343, -0.007788966160159612, 0.0285781366243179, 0.0877360601865592, 0.02357930471813576, 0.12436636101346517, -0.1674131378683302, -0.04259091280265779, 0.41839977920703264, -0.13740359344133732, -0.1513533452525735, 0.16094306112010626, -0.1806090979438707, -0.11915838179529468, 0.13354142668549027, 0.11178389583390368, 0.08157847484782932, -0.07943762766513247, 0.08395668283101522, -0.022898461887329493, 0.21435467187531185, 0.0875621103172096, 0.01888145012713537, 0.25863130817162816, 0.15869648893451507, 0.07426487158585772, 0.10888366518623155, -0.0638166704768504, -0.07829665893054419, -0.32724790767753037, -0.13127949236608719, -0.17499020746639132, 0.07091784716328181, -0.08936100533764398, -0.19881530257238858, 0.36273156083652924, 0.1361028437765882, 0.2176831983320037, 0.06063525958756066, 0.2981286139676239, 0.10865872009046565, 0.09896934588702963, 0.11830212085919482, 0.3021508621001714, 0.08599540339681604, 0.10743186321865389, -0.21922357596517744, 0.05445526040199658, -0.01963693880395073]
|
1,803.04268
|
Bending angle of light in equatorial plane of Kerr-Sen Black Hole
|
We study the gravitational lensing by a Kerr-Sen Black Hole arising in
heterotic string theory. A closed form expression for the bending angle of
light in equatorial plane of Kerr-Sen Black Hole is derived as a function of
impact parameter, spin and charge of the Black Hole. Results obtained are also
compared with the corresponding cases of Kerr Black Hole in general relativity.
It is observed that charge parameter behaves qualitatively similar as the spin
parameter for photons travelling in direct orbits while behaves differently for
photons in retrograde orbits around Black Hole. As the numerical value of the
Black Hole charge increases, bending angle becomes larger in strong field
limit. Further it is observed that this effect is more pronounced in case of
direct orbits in comparison to the retro orbits. For both the direct and retro
motion, the bending angle exceeds 2\pi, which in turn results in multiple loops
and formation of relativistic images.
|
gr-qc
|
we study the gravitational lensing by a kerrsen black hole arising in heterotic string theory a closed form expression for the bending angle of light in equatorial plane of kerrsen black hole is derived as a function of impact parameter spin and charge of the black hole results obtained are also compared with the corresponding cases of kerr black hole in general relativity it is observed that charge parameter behaves qualitatively similar as the spin parameter for photons travelling in direct orbits while behaves differently for photons in retrograde orbits around black hole as the numerical value of the black hole charge increases bending angle becomes larger in strong field limit further it is observed that this effect is more pronounced in case of direct orbits in comparison to the retro orbits for both the direct and retro motion the bending angle exceeds 2pi which in turn results in multiple loops and formation of relativistic images
|
[['we', 'study', 'the', 'gravitational', 'lensing', 'by', 'a', 'kerrsen', 'black', 'hole', 'arising', 'in', 'heterotic', 'string', 'theory', 'a', 'closed', 'form', 'expression', 'for', 'the', 'bending', 'angle', 'of', 'light', 'in', 'equatorial', 'plane', 'of', 'kerrsen', 'black', 'hole', 'is', 'derived', 'as', 'a', 'function', 'of', 'impact', 'parameter', 'spin', 'and', 'charge', 'of', 'the', 'black', 'hole', 'results', 'obtained', 'are', 'also', 'compared', 'with', 'the', 'corresponding', 'cases', 'of', 'kerr', 'black', 'hole', 'in', 'general', 'relativity', 'it', 'is', 'observed', 'that', 'charge', 'parameter', 'behaves', 'qualitatively', 'similar', 'as', 'the', 'spin', 'parameter', 'for', 'photons', 'travelling', 'in', 'direct', 'orbits', 'while', 'behaves', 'differently', 'for', 'photons', 'in', 'retrograde', 'orbits', 'around', 'black', 'hole', 'as', 'the', 'numerical', 'value', 'of', 'the', 'black', 'hole', 'charge', 'increases', 'bending', 'angle', 'becomes', 'larger', 'in', 'strong', 'field', 'limit', 'further', 'it', 'is', 'observed', 'that', 'this', 'effect', 'is', 'more', 'pronounced', 'in', 'case', 'of', 'direct', 'orbits', 'in', 'comparison', 'to', 'the', 'retro', 'orbits', 'for', 'both', 'the', 'direct', 'and', 'retro', 'motion', 'the', 'bending', 'angle', 'exceeds', '2pi', 'which', 'in', 'turn', 'results', 'in', 'multiple', 'loops', 'and', 'formation', 'of', 'relativistic', 'images']]
|
[-0.19895081101089884, 0.13821530195463522, -0.03924524104998758, 0.12473871510472889, -0.0714083675098104, -0.13248756488200086, 0.01175716156602646, 0.32057768955098415, -0.17693645959922996, -0.29030414685033834, 0.03570830314987315, -0.3281101594180561, -0.1011122584145946, 0.27167451987043023, -0.028595936302549373, 0.008617214625701308, 0.029716513264410865, 0.017387669834976967, -0.114378592871034, -0.14198080354029885, 0.32440341109087545, 0.07824180685789682, 0.21595353674955475, 0.007301850017542258, 0.06045888958630176, 0.05239431863204421, 0.05901551792302575, 0.08624908010981996, -0.15438947153849697, 0.017358939805163596, 0.20900666467003667, 0.040778510976964846, 0.16765388786272803, -0.3953719626312168, -0.21087467220898432, 0.026975262578791723, 0.1644979300043092, 0.17381892549784447, -0.10736321025717935, -0.25817359331845996, 0.06724927319700304, -0.21742660586292353, -0.195034721851325, 0.005454660429117771, 0.09947960124834655, -0.02999137005155297, -0.22335514115193525, 0.17172935647604157, 0.073983255875273, -0.05380281406001021, -0.10594877496791574, -0.04410562981129027, -0.10810394915871513, 0.08578080987372698, 0.19326088691536242, 0.06422431236700131, 0.21428643240450093, -0.13530945376260206, -0.10898494034504089, 0.378951785632242, -0.07012128858612134, -0.19774531826782876, 0.130628259827156, -0.2912925927905748, -0.06465540291798952, 0.16809068206482783, 0.14820273590680116, 0.20370473900738245, -0.08756788002136044, 0.09146443008667586, -0.03192395923915916, 0.1503152002532704, 0.15116186625957012, 0.07251205141782964, 0.36577844051405406, 0.11440296779171778, 0.04956874262335567, 0.150808405629598, -0.1261112902743312, -0.0971084246949221, -0.2617644545512471, -0.1268087689830468, -0.13419344761925273, 0.0853627142854608, -0.16612194616857615, -0.16722015929348671, 0.32771072597750345, 0.08228178897227806, 0.20665978455844408, -0.007171766183977851, 0.2763365895654529, 0.10140534023342368, 0.018137126369998813, 0.04978292270336682, 0.3781175141936192, 0.13910688292414236, 0.09731734792316835, -0.24868835009282264, -0.03635196269262964, 0.06001421844867321]
|
1,803.04269
|
A Hybrid Discontinuous Galerkin Scheme for Multi-scale Kinetic Equations
|
We develop a multi-dimensional hybrid discontinuous Galerkin method for
multi-scale kinetic equations. This method is based on moment realizability
matrices, a concept introduced by D. Levermore, W. Morokoff and B. Nadiga for
one dimensional problem. The main issue addressed in this paper is to provide a
simple indicator to select the most appropriate model and to apply a compact
numerical scheme to reduce the interface region between different models. We
also construct a numerical flux for the fluid model obtained as the asymptotic
limit of the flux of the kinetic equation. Finally we perform several numerical
simulations for time evolution and stationary problems.
|
math.NA
|
we develop a multidimensional hybrid discontinuous galerkin method for multiscale kinetic equations this method is based on moment realizability matrices a concept introduced by d levermore w morokoff and b nadiga for one dimensional problem the main issue addressed in this paper is to provide a simple indicator to select the most appropriate model and to apply a compact numerical scheme to reduce the interface region between different models we also construct a numerical flux for the fluid model obtained as the asymptotic limit of the flux of the kinetic equation finally we perform several numerical simulations for time evolution and stationary problems
|
[['we', 'develop', 'a', 'multidimensional', 'hybrid', 'discontinuous', 'galerkin', 'method', 'for', 'multiscale', 'kinetic', 'equations', 'this', 'method', 'is', 'based', 'on', 'moment', 'realizability', 'matrices', 'a', 'concept', 'introduced', 'by', 'd', 'levermore', 'w', 'morokoff', 'and', 'b', 'nadiga', 'for', 'one', 'dimensional', 'problem', 'the', 'main', 'issue', 'addressed', 'in', 'this', 'paper', 'is', 'to', 'provide', 'a', 'simple', 'indicator', 'to', 'select', 'the', 'most', 'appropriate', 'model', 'and', 'to', 'apply', 'a', 'compact', 'numerical', 'scheme', 'to', 'reduce', 'the', 'interface', 'region', 'between', 'different', 'models', 'we', 'also', 'construct', 'a', 'numerical', 'flux', 'for', 'the', 'fluid', 'model', 'obtained', 'as', 'the', 'asymptotic', 'limit', 'of', 'the', 'flux', 'of', 'the', 'kinetic', 'equation', 'finally', 'we', 'perform', 'several', 'numerical', 'simulations', 'for', 'time', 'evolution', 'and', 'stationary', 'problems']]
|
[-0.08635446146167446, 0.035835733351362226, -0.09852931029762667, 0.08146485551127859, -0.05786552969919573, -0.1330768847238678, 0.048708588921690894, 0.3449371459128538, -0.27004185272495973, -0.2840921743265768, 0.102226146643216, -0.20360321513755192, -0.14251721853224358, 0.19636903974771647, -0.03308031411114204, 0.08635260077253316, 0.06423705858455067, -0.030558607349400455, -0.0879385419245256, -0.19296738725745738, 0.33337435991235886, 0.04686180072476958, 0.2584621860728701, 0.029655711430281697, 0.14699937886383274, -0.0636120335346475, -0.058992608541410675, 0.04469149785651134, -0.17527049005096132, 0.11113140135565495, 0.22384319195483085, 0.08491865492259881, 0.30518171008639405, -0.4224811282543705, -0.2508031085483951, 0.08272128373771759, 0.12544461861621625, 0.11117568744420267, -0.05631695910573633, -0.23442226557042634, 0.10382729704205942, -0.19461495444031046, -0.1565484839473104, -0.09120839505599314, 0.001693108635447403, 0.00741431784659329, -0.3296563229754125, 0.09325805522408107, 0.03786873785170293, 0.008864258120924529, -0.06871145629176482, -0.08871965831154865, 0.015885585540960923, 0.068800591016511, 0.013616564628290067, 0.00983434828865056, 0.03918652255364721, -0.060013507254030395, -0.09676595668004144, 0.37118173232025437, -0.06724122469371074, -0.28648060379494533, 0.2015640371234737, -0.07559159247315314, -0.1369328841308851, 0.10827158358280022, 0.2099776488572064, 0.17550687051129224, -0.15886649610659126, 0.07138952184848875, -0.039601228056973456, 0.13760192403200977, 0.0018396811642785473, -0.04544721919084244, 0.1306795850857207, 0.20408009133753505, 0.06462193101570748, 0.15460323548350152, -0.08841808726503929, -0.10663892167832444, -0.3322389981903062, -0.16015063193027335, -0.17753759376925998, 0.010451473125099841, -0.09532769462788168, -0.19043617266792767, 0.38126139131519166, 0.2023167682017458, 0.15778685033800874, 0.06173130722790219, 0.2972869604876689, 0.16714227655879452, -0.037652137538874614, 0.0770900924275122, 0.18593300226153714, 0.1757372384729546, 0.13089870377950888, -0.23490850943703168, -0.013118144060199214, 0.19293360239457302]
|
1,803.0427
|
FDRC: Flow-Driven Rule Caching Optimization in Software Defined
Networking
|
With the sharp growth of cloud services and their possible combinations, the
scale of data center network traffic has an inevitable explosive increasing in
recent years. Software defined network (SDN) provides a scalable and flexible
structure to simplify network traffic management. It has been shown that
Ternary Content Addressable Memory (TCAM) management plays an important role on
the performance of SDN. However, previous literatures, in point of view on rule
placement strategies, are still insufficient to provide high scalability for
processing large flow sets with a limited TCAM size. So caching is a brand new
method for TCAM management which can provide better performance than rule
placement. In this paper, we propose FDRC, an efficient flow-driven rule
caching algorithm to optimize the cache replacement in SDN-based networks.
Different from the previous packet-driven caching algorithm, FDRC is
characterized by trying to deal with the challenges of limited cache size
constraint and unpredictable flows. In particular, we design a caching
algorithm with low-complexity to achieve high cache hit ratio by prefetching
and special replacement strategy for predictable and unpredictable flows,
respectively. By conducting extensive simulations, we demonstrate that our
proposed caching algorithm significantly outperforms FIFO and least recently
used (LRU) algorithms under various network settings.
|
cs.DC cs.NI
|
with the sharp growth of cloud services and their possible combinations the scale of data center network traffic has an inevitable explosive increasing in recent years software defined network sdn provides a scalable and flexible structure to simplify network traffic management it has been shown that ternary content addressable memory tcam management plays an important role on the performance of sdn however previous literatures in point of view on rule placement strategies are still insufficient to provide high scalability for processing large flow sets with a limited tcam size so caching is a brand new method for tcam management which can provide better performance than rule placement in this paper we propose fdrc an efficient flowdriven rule caching algorithm to optimize the cache replacement in sdnbased networks different from the previous packetdriven caching algorithm fdrc is characterized by trying to deal with the challenges of limited cache size constraint and unpredictable flows in particular we design a caching algorithm with lowcomplexity to achieve high cache hit ratio by prefetching and special replacement strategy for predictable and unpredictable flows respectively by conducting extensive simulations we demonstrate that our proposed caching algorithm significantly outperforms fifo and least recently used lru algorithms under various network settings
|
[['with', 'the', 'sharp', 'growth', 'of', 'cloud', 'services', 'and', 'their', 'possible', 'combinations', 'the', 'scale', 'of', 'data', 'center', 'network', 'traffic', 'has', 'an', 'inevitable', 'explosive', 'increasing', 'in', 'recent', 'years', 'software', 'defined', 'network', 'sdn', 'provides', 'a', 'scalable', 'and', 'flexible', 'structure', 'to', 'simplify', 'network', 'traffic', 'management', 'it', 'has', 'been', 'shown', 'that', 'ternary', 'content', 'addressable', 'memory', 'tcam', 'management', 'plays', 'an', 'important', 'role', 'on', 'the', 'performance', 'of', 'sdn', 'however', 'previous', 'literatures', 'in', 'point', 'of', 'view', 'on', 'rule', 'placement', 'strategies', 'are', 'still', 'insufficient', 'to', 'provide', 'high', 'scalability', 'for', 'processing', 'large', 'flow', 'sets', 'with', 'a', 'limited', 'tcam', 'size', 'so', 'caching', 'is', 'a', 'brand', 'new', 'method', 'for', 'tcam', 'management', 'which', 'can', 'provide', 'better', 'performance', 'than', 'rule', 'placement', 'in', 'this', 'paper', 'we', 'propose', 'fdrc', 'an', 'efficient', 'flowdriven', 'rule', 'caching', 'algorithm', 'to', 'optimize', 'the', 'cache', 'replacement', 'in', 'sdnbased', 'networks', 'different', 'from', 'the', 'previous', 'packetdriven', 'caching', 'algorithm', 'fdrc', 'is', 'characterized', 'by', 'trying', 'to', 'deal', 'with', 'the', 'challenges', 'of', 'limited', 'cache', 'size', 'constraint', 'and', 'unpredictable', 'flows', 'in', 'particular', 'we', 'design', 'a', 'caching', 'algorithm', 'with', 'lowcomplexity', 'to', 'achieve', 'high', 'cache', 'hit', 'ratio', 'by', 'prefetching', 'and', 'special', 'replacement', 'strategy', 'for', 'predictable', 'and', 'unpredictable', 'flows', 'respectively', 'by', 'conducting', 'extensive', 'simulations', 'we', 'demonstrate', 'that', 'our', 'proposed', 'caching', 'algorithm', 'significantly', 'outperforms', 'fifo', 'and', 'least', 'recently', 'used', 'lru', 'algorithms', 'under', 'various', 'network', 'settings']]
|
[-0.17186306180024985, -0.0001984627408819506, -0.04041799405356869, 0.018261800560285337, -0.09742498281877487, -0.22546773807960563, 0.1349666214961326, 0.4665054494491778, -0.2624137742165476, -0.3190623398986645, 0.1082562947360566, -0.22337258926709183, -0.16207493915193483, 0.1578328888863325, -0.16427148322109134, 0.1219835296086967, 0.07392135705324109, -0.03376218404533574, -0.02030057033902267, -0.31742794054676776, 0.2577653386257589, 0.1430617707321653, 0.4186826199106872, 0.060104930236411745, 0.07549755411513616, -0.023885889865341597, -0.05939023846003692, 0.015699918590253218, -0.08625743793360016, 0.12404147154564271, 0.3066665703151375, 0.21233561566099524, 0.30444003898766825, -0.45615341822849587, -0.2183983688754961, 0.07309101366554387, 0.1789156994584482, 0.06431289701897186, -0.07655213479767553, -0.24241722204023972, 0.1518245525797829, -0.24554001069278455, -0.03955470508662984, -0.11534887137648184, -0.0015885273227468134, 0.03545414168998832, -0.2945259690881358, -0.030890114929061383, 0.008971830017835601, 0.020559266731142996, -0.011213532479014248, -0.13936131819034928, 0.03099304408126045, 0.1313059641601285, 0.025154007234959863, 0.021996518821106294, 0.14663016464794054, -0.11599122102954425, -0.1655659698881209, 0.3857978749834001, 0.022225449828765703, -0.18709890990052372, 0.15934441614779643, 0.0007322038663551212, -0.16413812418933957, 0.15001759797392877, 0.24553065448591951, 0.08215580207295715, -0.17354252243909285, 0.022535479234647937, -0.03204064855293837, 0.16853105380912894, 0.07381103947409429, 0.07794161976897157, 0.1528509395918809, 0.3099572096101474, 0.16466222959570587, 0.1426572482904885, -0.06086966966977343, -0.1339455402366002, -0.15586581006180494, -0.12012038607150316, -0.17846029670618008, -0.0001442659553140402, -0.12989593262856944, -0.12616642630062416, 0.30235272192396223, 0.2010101091861725, 0.1524005397898145, 0.0900587916310178, 0.39330774118192496, 0.04626553394889925, 0.12654565434088, 0.17893590863794087, 0.12577149917604402, 0.004257229532813653, 0.22517988330451771, -0.19785626339144075, 0.14727466551878024, 0.006912459128070623]
|
1,803.04271
|
Super-resolution of Sentinel-2 images: Learning a globally applicable
deep neural network
|
The Sentinel-2 satellite mission delivers multi-spectral imagery with 13
spectral bands, acquired at three different spatial resolutions. The aim of
this research is to super-resolve the lower-resolution (20 m and 60 m Ground
Sampling Distance - GSD) bands to 10 m GSD, so as to obtain a complete data
cube at the maximal sensor resolution. We employ a state-of-the-art
convolutional neural network (CNN) to perform end-to-end upsampling, which is
trained with data at lower resolution, i.e., from 40->20 m, respectively
360->60 m GSD. In this way, one has access to a virtually infinite amount of
training data, by downsampling real Sentinel-2 images. We use data sampled
globally over a wide range of geographical locations, to obtain a network that
generalises across different climate zones and land-cover types, and can
super-resolve arbitrary Sentinel-2 images without the need of retraining. In
quantitative evaluations (at lower scale, where ground truth is available), our
network, which we call DSen2, outperforms the best competing approach by almost
50% in RMSE, while better preserving the spectral characteristics. It also
delivers visually convincing results at the full 10 m GSD. The code is
available at https://github.com/lanha/DSen2
|
cs.CV cs.LG
|
the sentinel2 satellite mission delivers multispectral imagery with 13 spectral bands acquired at three different spatial resolutions the aim of this research is to superresolve the lowerresolution 20 m and 60 m ground sampling distance gsd bands to 10 m gsd so as to obtain a complete data cube at the maximal sensor resolution we employ a stateoftheart convolutional neural network cnn to perform endtoend upsampling which is trained with data at lower resolution ie from 4020 m respectively 36060 m gsd in this way one has access to a virtually infinite amount of training data by downsampling real sentinel2 images we use data sampled globally over a wide range of geographical locations to obtain a network that generalises across different climate zones and landcover types and can superresolve arbitrary sentinel2 images without the need of retraining in quantitative evaluations at lower scale where ground truth is available our network which we call dsen2 outperforms the best competing approach by almost 50 in rmse while better preserving the spectral characteristics it also delivers visually convincing results at the full 10 m gsd the code is available at httpsgithubcomlanhadsen2
|
[['the', 'sentinel2', 'satellite', 'mission', 'delivers', 'multispectral', 'imagery', 'with', '13', 'spectral', 'bands', 'acquired', 'at', 'three', 'different', 'spatial', 'resolutions', 'the', 'aim', 'of', 'this', 'research', 'is', 'to', 'superresolve', 'the', 'lowerresolution', '20', 'm', 'and', '60', 'm', 'ground', 'sampling', 'distance', 'gsd', 'bands', 'to', '10', 'm', 'gsd', 'so', 'as', 'to', 'obtain', 'a', 'complete', 'data', 'cube', 'at', 'the', 'maximal', 'sensor', 'resolution', 'we', 'employ', 'a', 'stateoftheart', 'convolutional', 'neural', 'network', 'cnn', 'to', 'perform', 'endtoend', 'upsampling', 'which', 'is', 'trained', 'with', 'data', 'at', 'lower', 'resolution', 'ie', 'from', '4020', 'm', 'respectively', '36060', 'm', 'gsd', 'in', 'this', 'way', 'one', 'has', 'access', 'to', 'a', 'virtually', 'infinite', 'amount', 'of', 'training', 'data', 'by', 'downsampling', 'real', 'sentinel2', 'images', 'we', 'use', 'data', 'sampled', 'globally', 'over', 'a', 'wide', 'range', 'of', 'geographical', 'locations', 'to', 'obtain', 'a', 'network', 'that', 'generalises', 'across', 'different', 'climate', 'zones', 'and', 'landcover', 'types', 'and', 'can', 'superresolve', 'arbitrary', 'sentinel2', 'images', 'without', 'the', 'need', 'of', 'retraining', 'in', 'quantitative', 'evaluations', 'at', 'lower', 'scale', 'where', 'ground', 'truth', 'is', 'available', 'our', 'network', 'which', 'we', 'call', 'dsen2', 'outperforms', 'the', 'best', 'competing', 'approach', 'by', 'almost', '50', 'in', 'rmse', 'while', 'better', 'preserving', 'the', 'spectral', 'characteristics', 'it', 'also', 'delivers', 'visually', 'convincing', 'results', 'at', 'the', 'full', '10', 'm', 'gsd', 'the', 'code', 'is', 'available', 'at', 'httpsgithubcomlanhadsen2']]
|
[-0.07077352644472912, 0.034364180849563025, -0.04380266882378507, 0.060374938091263174, -0.060829582629171576, -0.14518874139474655, 0.04626654643326293, 0.45136529146819504, -0.2237326259699625, -0.40968004960466076, 0.10872605954284302, -0.2935497957357281, -0.07236640747586215, 0.18329373736538598, -0.10570766964008578, 0.04280704952732383, 0.13223715409655376, 0.025906692791377774, -0.08861472964297816, -0.2856181624131529, 0.2799765866745253, 0.07609236715613185, 0.30968912200549165, -0.017957149297502396, 0.1341608616447932, -0.040246739246051856, -0.03846541871883076, -0.03615110581402503, -0.11326545886337487, 0.12495877761897203, 0.31423329825236185, 0.16754410149013574, 0.25469114273987914, -0.3744622641922654, -0.21289640702810642, 0.07884870776151483, 0.12166595244622865, 0.06126662377721152, 0.032470666602681816, -0.2936932354712406, 0.12633778459921077, -0.1481996965361759, -0.04492914265374074, -0.0685466345739425, -0.007371809684696633, -0.037315496280978154, -0.2989618088949371, 0.0406044430941079, -0.004914197091617294, 0.13329024608372836, -0.06666994101141353, -0.1179856195970363, -0.05848602733977542, 0.18750874141130497, -0.039265218092682394, 0.077963347860763, 0.08029563888101965, -0.09006015361991485, -0.05595703512002286, 0.34381727402073303, -0.09344780028017388, -0.15567587409923608, 0.19946538876251294, -0.14401522366883787, -0.10271885175308262, 0.19178284341972826, 0.1399275125029522, 0.0801663155013041, -0.12093272080166718, 0.02473379460043853, -0.056476866119113324, 0.20826095516818602, 0.10425512274173467, 0.02503837160042462, 0.17010884241993865, 0.20206975264323723, 0.1092832680779031, 0.10996698278405174, -0.22270608260925556, -0.00959907868008658, -0.21513102015077665, -0.06500829585727204, -0.2280643268815569, 0.026041069616739815, -0.11717004284893502, -0.09056317158722998, 0.38226827588939183, 0.19295751979775927, 0.2237623100999642, 0.12826319163322222, 0.3505219288975806, -0.03082760698036165, 0.1416679560754297, 0.11194615696330329, 0.14324483869446292, 0.00550025923781701, 0.14736757627625421, -0.12314938473565554, -0.007437631850307052, 0.006241658803176235]
|
1,803.04272
|
Size of a minimal cutset in supercritical first passage percolation
|
We consider the standard model of i.i.d. first passage percolation on Z^d
given a distribution G on [0, +$\infty$] (including +$\infty$). We suppose that
G({0}) > 1 -- p\_c(d), i.e., the edges of positive passage time are in the
subcritical regime of percolation on Z^d. We consider a cylinder of basis an
hyperrectangle of dimension d -- 1 whose sides have length n and of height h(n)
with h(n) negligible compared to n (i.e., h(n)/n $\rightarrow$ 0 when n goes to
infinity). We study the maximal flow from the top to the bottom of this
cylinder. We already know that the maximal flow renormalized by n^(d--1)
converges towards the flow constant which is null in the case G({0}) > 1 --
p\_c (d). The study of maximal flow is associated with the study of sets of
edges of minimal capacity that cut the top from the bottom of the cylinder. If
we denote by $\psi$\_n the minimal cardinal of such a set of edges, we prove
here that $\psi$\_n /n^(d--1) converges almost surely towards a constant.
|
math.PR
|
we consider the standard model of iid first passage percolation on zd given a distribution g on 0 infty including infty we suppose that g0 1 p_cd ie the edges of positive passage time are in the subcritical regime of percolation on zd we consider a cylinder of basis an hyperrectangle of dimension d 1 whose sides have length n and of height hn with hn negligible compared to n ie hnn rightarrow 0 when n goes to infinity we study the maximal flow from the top to the bottom of this cylinder we already know that the maximal flow renormalized by nd1 converges towards the flow constant which is null in the case g0 1 p_c d the study of maximal flow is associated with the study of sets of edges of minimal capacity that cut the top from the bottom of the cylinder if we denote by psi_n the minimal cardinal of such a set of edges we prove here that psi_n nd1 converges almost surely towards a constant
|
[['we', 'consider', 'the', 'standard', 'model', 'of', 'iid', 'first', 'passage', 'percolation', 'on', 'zd', 'given', 'a', 'distribution', 'g', 'on', '0', 'infty', 'including', 'infty', 'we', 'suppose', 'that', 'g0', '1', 'p_cd', 'ie', 'the', 'edges', 'of', 'positive', 'passage', 'time', 'are', 'in', 'the', 'subcritical', 'regime', 'of', 'percolation', 'on', 'zd', 'we', 'consider', 'a', 'cylinder', 'of', 'basis', 'an', 'hyperrectangle', 'of', 'dimension', 'd', '1', 'whose', 'sides', 'have', 'length', 'n', 'and', 'of', 'height', 'hn', 'with', 'hn', 'negligible', 'compared', 'to', 'n', 'ie', 'hnn', 'rightarrow', '0', 'when', 'n', 'goes', 'to', 'infinity', 'we', 'study', 'the', 'maximal', 'flow', 'from', 'the', 'top', 'to', 'the', 'bottom', 'of', 'this', 'cylinder', 'we', 'already', 'know', 'that', 'the', 'maximal', 'flow', 'renormalized', 'by', 'nd1', 'converges', 'towards', 'the', 'flow', 'constant', 'which', 'is', 'null', 'in', 'the', 'case', 'g0', '1', 'p_c', 'd', 'the', 'study', 'of', 'maximal', 'flow', 'is', 'associated', 'with', 'the', 'study', 'of', 'sets', 'of', 'edges', 'of', 'minimal', 'capacity', 'that', 'cut', 'the', 'top', 'from', 'the', 'bottom', 'of', 'the', 'cylinder', 'if', 'we', 'denote', 'by', 'psi_n', 'the', 'minimal', 'cardinal', 'of', 'such', 'a', 'set', 'of', 'edges', 'we', 'prove', 'here', 'that', 'psi_n', 'nd1', 'converges', 'almost', 'surely', 'towards', 'a', 'constant']]
|
[-0.165079385716174, 0.18466133775527532, -0.02737011590547729, -0.01834449098971046, 0.011096495092024056, -0.1725905315177134, 0.05224537876794082, 0.3422548829888304, -0.29023151665010993, -0.16385344269669108, 0.09235904388516401, -0.3677576878571022, -0.08573264283147145, 0.11139505913029071, -0.02749460421793033, 0.03935138320234435, 0.044707623983008996, 0.1408351487017166, -0.017247920455574467, -0.23637322246911255, 0.3314400510998628, -0.05443826182718165, 0.20690579339589554, 0.051404275942310604, 0.062180342799806915, 0.009327075158229522, 0.03356037769270571, 0.018924510755919312, -0.24111952612599308, 0.04795983431000284, 0.14677022437004056, 0.07300324572912487, 0.2672426191332875, -0.38776802946677247, -0.15815620912968764, 0.1769025055146967, 0.17443567430818377, 0.0002635827264884672, 0.03383812691937391, -0.2266222886640404, 0.15376545804993888, -0.1116295863618279, -0.18886586498708752, 0.043370838897923626, 0.1021337309220468, 0.023199242805212475, -0.27960954611979383, 0.03975736329533508, 0.11926119446983202, 0.04988466943096784, 0.00040053859440206786, -0.160390051302353, -0.06190332303460883, 0.13875057754309014, 0.06684087420614948, 0.08318618291475652, 0.08019503847047774, -0.10998619899387901, -0.09147367801255825, 0.35717248953933345, -0.12589822392311623, -0.1915353021845875, 0.12822326453544244, -0.2380875452906329, -0.10860891357794056, 0.0968723872796311, 0.16652413428358037, 0.17021684733094178, -0.02176592224429032, 0.19411603105084274, -0.11972421081532446, 0.11796661776732871, 0.11811030216308104, -0.04958312020620756, 0.1024896926600595, 0.14976781729488955, 0.17056885258871954, 0.159107084061994, -0.08138569356902224, -0.04696692086549269, -0.383753560537919, -0.15610051870738206, -0.22046080000605978, 0.1600440084411387, -0.14941435837456127, -0.18843018890995727, 0.329298749768954, 0.10250790578712116, 0.27889029909339214, 0.14317252050761178, 0.22178544441771786, 0.10145418557458576, -0.0006808732467436651, 0.14786007722283337, 0.15084129471157554, 0.13109236464451737, -0.0038981667055329036, -0.17370861906242388, 0.0329917940741394, 0.1135901882100785]
|
1,803.04273
|
Morse index of multiplicity one min-max minimal hypersurfaces
|
In this paper, we prove that the Morse index of a multiplicity one, smooth,
min-max minimal hypersurface is generically equal to the dimension of the
homology class detected by the families used in the construction. This confirms
part of the program (\cite{marques-icm}, \cite{marques-neves-cycles},
\cite{marques-neves-index}, \cite{neves-icm}) proposed by the authors with the
goal of developing a Morse theory for the area functional.
|
math.DG math.AP
|
in this paper we prove that the morse index of a multiplicity one smooth minmax minimal hypersurface is generically equal to the dimension of the homology class detected by the families used in the construction this confirms part of the program citemarquesicm citemarquesnevescycles citemarquesnevesindex citenevesicm proposed by the authors with the goal of developing a morse theory for the area functional
|
[['in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'morse', 'index', 'of', 'a', 'multiplicity', 'one', 'smooth', 'minmax', 'minimal', 'hypersurface', 'is', 'generically', 'equal', 'to', 'the', 'dimension', 'of', 'the', 'homology', 'class', 'detected', 'by', 'the', 'families', 'used', 'in', 'the', 'construction', 'this', 'confirms', 'part', 'of', 'the', 'program', 'citemarquesicm', 'citemarquesnevescycles', 'citemarquesnevesindex', 'citenevesicm', 'proposed', 'by', 'the', 'authors', 'with', 'the', 'goal', 'of', 'developing', 'a', 'morse', 'theory', 'for', 'the', 'area', 'functional']]
|
[-0.1386144141535879, 0.03470148693508746, -0.11278528576357323, 0.0744463933627693, -0.013616750858266625, -0.09746892993714203, 0.0016522382941554512, 0.2628518517880717, -0.25006685818529184, -0.28804596634418295, 0.07975935659845147, -0.24013652181939074, -0.20144693095955932, 0.1696255681219331, -0.1560507306436959, 0.06942585009362615, 0.03741510143797649, 0.07890519640294083, -0.016285979331944856, -0.2681513517245389, 0.40424357303173136, 0.0018897859804462968, 0.22106103380945952, 0.08046350678788465, 0.05777839937230997, 0.03149528570244448, -0.03108661851371851, 0.05135565783763141, -0.19244225712540547, 0.24215717981324383, 0.30529251707750454, 0.08497669291274067, 0.2792940779278676, -0.3447393606694644, -0.20926586159029076, 0.17393996143354135, 0.08514617082638372, 0.04324414300029738, -0.03928383124845201, -0.23285826991655326, 0.1251891914248597, -0.15938089033098599, -0.24379376325298818, -0.0025516087679486525, 0.011682774724536821, -0.0037025449503409235, -0.200402803081823, -0.007003225859973514, 0.08825192187112152, 0.09021058003826622, -0.0549521175490921, -0.07937857466177982, -0.04765356109036427, 0.07484465840542198, 0.07657417797753097, 0.06462251060037759, 0.06454916190552085, -0.06848395026795435, -0.12976909530136668, 0.31524524859789954, -0.08318472880739392, -0.23472049943449205, 0.13660414666427592, -0.1204991292600569, -0.2027874211372252, 0.14303585795456902, 0.09610498733941074, 0.16231084709758298, -0.09315244962967802, 0.14721454299267447, -0.05853813777171206, 0.14910241765411278, 0.07966625499293993, -0.050375427258315314, 0.16131421257006495, 0.12875249678791875, 0.11674803621217347, 0.18286803098428145, -0.06345872545876262, -0.07383550481315244, -0.35571057980128545, -0.21906117307024256, -0.22553400236198254, 0.059851767380901595, -0.069798724684995, -0.1622485491005998, 0.4716978027697718, 0.06281661397467057, 0.14606602501385568, 0.14074989790587047, 0.2533066464310283, 0.08646266378172297, 0.061301282656035926, 0.08979972720701705, 0.21001365820860915, 0.13945749661019236, 0.064010557718575, -0.162161013907998, 0.004932458237785715, 0.20318932631951675]
|
1,803.04274
|
Quadratic and symmetric bilinear forms over finite fields and their
association schemes
|
Let $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ be the sets of quadratic forms
and symmetric bilinear forms on an $m$-dimensional vector space over
$\mathbb{F}_q$, respectively. The orbits of $\mathscr{Q}(m,q)$ and
$\mathscr{S}(m,q)$ under a natural group action induce two translation
association schemes, which are known to be dual to each other. We give explicit
expressions for the eigenvalues of these association schemes in terms of linear
combinations of generalised Krawtchouk polynomials, generalising earlier
results for odd $q$ to the more difficult case when $q$ is even. We then study
$d$-codes in these schemes, namely subsets $X$ of $\mathscr{Q}(m,q)$ or
$\mathscr{S}(m,q)$ with the property that, for all distinct $A,B\in X$, the
rank of $A-B$ is at least $d$. We prove tight bounds on the size of $d$-codes
and show that, when these bounds hold with equality, the inner distributions of
the subsets are often uniquely determined by their parameters. We also discuss
connections to classical error-correcting codes and show how the Hamming
distance distribution of large classes of codes over $\mathbb{F}_q$ can be
determined from the results of this paper.
|
math.CO cs.IT math.IT
|
let mathscrqmq and mathscrsmq be the sets of quadratic forms and symmetric bilinear forms on an mdimensional vector space over mathbbf_q respectively the orbits of mathscrqmq and mathscrsmq under a natural group action induce two translation association schemes which are known to be dual to each other we give explicit expressions for the eigenvalues of these association schemes in terms of linear combinations of generalised krawtchouk polynomials generalising earlier results for odd q to the more difficult case when q is even we then study dcodes in these schemes namely subsets x of mathscrqmq or mathscrsmq with the property that for all distinct abin x the rank of ab is at least d we prove tight bounds on the size of dcodes and show that when these bounds hold with equality the inner distributions of the subsets are often uniquely determined by their parameters we also discuss connections to classical errorcorrecting codes and show how the hamming distance distribution of large classes of codes over mathbbf_q can be determined from the results of this paper
|
[['let', 'mathscrqmq', 'and', 'mathscrsmq', 'be', 'the', 'sets', 'of', 'quadratic', 'forms', 'and', 'symmetric', 'bilinear', 'forms', 'on', 'an', 'mdimensional', 'vector', 'space', 'over', 'mathbbf_q', 'respectively', 'the', 'orbits', 'of', 'mathscrqmq', 'and', 'mathscrsmq', 'under', 'a', 'natural', 'group', 'action', 'induce', 'two', 'translation', 'association', 'schemes', 'which', 'are', 'known', 'to', 'be', 'dual', 'to', 'each', 'other', 'we', 'give', 'explicit', 'expressions', 'for', 'the', 'eigenvalues', 'of', 'these', 'association', 'schemes', 'in', 'terms', 'of', 'linear', 'combinations', 'of', 'generalised', 'krawtchouk', 'polynomials', 'generalising', 'earlier', 'results', 'for', 'odd', 'q', 'to', 'the', 'more', 'difficult', 'case', 'when', 'q', 'is', 'even', 'we', 'then', 'study', 'dcodes', 'in', 'these', 'schemes', 'namely', 'subsets', 'x', 'of', 'mathscrqmq', 'or', 'mathscrsmq', 'with', 'the', 'property', 'that', 'for', 'all', 'distinct', 'abin', 'x', 'the', 'rank', 'of', 'ab', 'is', 'at', 'least', 'd', 'we', 'prove', 'tight', 'bounds', 'on', 'the', 'size', 'of', 'dcodes', 'and', 'show', 'that', 'when', 'these', 'bounds', 'hold', 'with', 'equality', 'the', 'inner', 'distributions', 'of', 'the', 'subsets', 'are', 'often', 'uniquely', 'determined', 'by', 'their', 'parameters', 'we', 'also', 'discuss', 'connections', 'to', 'classical', 'errorcorrecting', 'codes', 'and', 'show', 'how', 'the', 'hamming', 'distance', 'distribution', 'of', 'large', 'classes', 'of', 'codes', 'over', 'mathbbf_q', 'can', 'be', 'determined', 'from', 'the', 'results', 'of', 'this', 'paper']]
|
[-0.17328288999718747, 0.11435096618395099, -0.060477532331964796, 0.05954691216416125, -0.03507990239986351, -0.1615174497690584, 0.024151976838308786, 0.3713076277556164, -0.31061426055218494, -0.2354480302945844, 0.08857134303942855, -0.2635051733335214, -0.13186421504377255, 0.23134727130910115, -0.07240331805178098, 0.01563032120000571, 0.032434330438928946, 0.094738162668821, -0.1352390229662082, -0.3271430401025074, 0.36831037132202515, -0.014122654596077545, 0.20450741560597505, 0.012880207580539198, 0.08400468482768961, 0.007336026874503919, -0.009809697568416596, 0.006177488715620711, -0.14919651306408924, 0.13338352807597922, 0.2663147274857121, 0.1363675008621067, 0.20320237934589386, -0.35463184641940254, -0.15717703194357455, 0.197750982914253, 0.13553321632157478, 0.026338240383858128, 0.01595749568019528, -0.24594203878726278, 0.16229577939092582, -0.14754594795139772, -0.09601254292863554, -0.07904719821842654, 0.05626936942006328, 0.06465385595602649, -0.31483267055558306, 0.013154870232933068, 0.0831753595545888, 0.07592698729996171, -0.06260581381519192, -0.1846605594828725, -0.0014085661939212254, 0.09572792006157604, 0.026404707386557546, 0.022708964756290827, 0.02038379356265068, -0.06351670830776648, -0.12238808021681118, 0.36284979907529696, -0.03540931812354497, -0.25003784343167873, 0.16036436445113006, -0.16161256843645658, -0.12365110598038882, 0.07658461247703859, 0.17909632146890675, 0.14485257248543867, -0.06700131098689911, 0.13833837469607327, -0.1123992667985814, 0.10816976819919157, 0.11201144662286554, 0.07808327406112636, 0.14096544676127712, 0.016854902279696295, 0.06602061431056687, 0.14482720166544563, -0.024264956888343608, -0.06793506682451282, -0.3235129058520709, -0.13358759740633624, -0.13853535151441715, 0.061342761300288005, -0.14407999906913443, -0.1332106099849833, 0.34889220134355126, 0.07754680496474196, 0.19374007335514762, 0.11602972492775214, 0.2225739169519927, 0.08232462026711021, 0.06712254545385284, 0.11284076462000875, 0.13388939437323383, 0.16453065761098903, -0.07626204319431314, -0.17199269429381406, 0.04201392072119883, 0.12206856291741133]
|
1,803.04275
|
Tile-and-trim micro-resonator array fabrication optimized for high
multiplexing factors
|
We present a superconducting micro-resonator array fabrication method that is
scalable, reconfigurable, and has been optimized for high multiplexing factors.
The method uses uniformly sized tiles patterned on stepper photolithography
reticles as the building blocks of an array. We demonstrate this technique on a
101-element microwave kinetic inductance detector (MKID) array made from a
titanium-nitride superconducting film. Characterization reveals 1.5\% maximum
fractional frequency spacing deviations caused primarily by material parameters
that vary smoothly across the wafer. However, local deviations exhibit a
Gaussian distribution in fractional frequency spacing with a standard deviation
of $2.7 \times 10^{-3}$. We exploit this finding to increase the yield of the
BLAST-TNG $250 \; \mu\text{m}$ production wafer by placing resonators in the
array close in both physical and frequency space. This array consists of 1836
polarization-sensitive MKIDs wired in three multiplexing groups. We present the
array design and show that the achieved yield is consistent with our model of
frequency collisions and is comparable to what has been achieved in other low
temperature detector technologies.
|
physics.ins-det cond-mat.supr-con
|
we present a superconducting microresonator array fabrication method that is scalable reconfigurable and has been optimized for high multiplexing factors the method uses uniformly sized tiles patterned on stepper photolithography reticles as the building blocks of an array we demonstrate this technique on a 101element microwave kinetic inductance detector mkid array made from a titaniumnitride superconducting film characterization reveals 15 maximum fractional frequency spacing deviations caused primarily by material parameters that vary smoothly across the wafer however local deviations exhibit a gaussian distribution in fractional frequency spacing with a standard deviation of 27 times 103 we exploit this finding to increase the yield of the blasttng 250 mutextm production wafer by placing resonators in the array close in both physical and frequency space this array consists of 1836 polarizationsensitive mkids wired in three multiplexing groups we present the array design and show that the achieved yield is consistent with our model of frequency collisions and is comparable to what has been achieved in other low temperature detector technologies
|
[['we', 'present', 'a', 'superconducting', 'microresonator', 'array', 'fabrication', 'method', 'that', 'is', 'scalable', 'reconfigurable', 'and', 'has', 'been', 'optimized', 'for', 'high', 'multiplexing', 'factors', 'the', 'method', 'uses', 'uniformly', 'sized', 'tiles', 'patterned', 'on', 'stepper', 'photolithography', 'reticles', 'as', 'the', 'building', 'blocks', 'of', 'an', 'array', 'we', 'demonstrate', 'this', 'technique', 'on', 'a', '101element', 'microwave', 'kinetic', 'inductance', 'detector', 'mkid', 'array', 'made', 'from', 'a', 'titaniumnitride', 'superconducting', 'film', 'characterization', 'reveals', '15', 'maximum', 'fractional', 'frequency', 'spacing', 'deviations', 'caused', 'primarily', 'by', 'material', 'parameters', 'that', 'vary', 'smoothly', 'across', 'the', 'wafer', 'however', 'local', 'deviations', 'exhibit', 'a', 'gaussian', 'distribution', 'in', 'fractional', 'frequency', 'spacing', 'with', 'a', 'standard', 'deviation', 'of', '27', 'times', '103', 'we', 'exploit', 'this', 'finding', 'to', 'increase', 'the', 'yield', 'of', 'the', 'blasttng', '250', 'mutextm', 'production', 'wafer', 'by', 'placing', 'resonators', 'in', 'the', 'array', 'close', 'in', 'both', 'physical', 'and', 'frequency', 'space', 'this', 'array', 'consists', 'of', '1836', 'polarizationsensitive', 'mkids', 'wired', 'in', 'three', 'multiplexing', 'groups', 'we', 'present', 'the', 'array', 'design', 'and', 'show', 'that', 'the', 'achieved', 'yield', 'is', 'consistent', 'with', 'our', 'model', 'of', 'frequency', 'collisions', 'and', 'is', 'comparable', 'to', 'what', 'has', 'been', 'achieved', 'in', 'other', 'low', 'temperature', 'detector', 'technologies']]
|
[-0.15681991746778184, 0.14747195113080355, -0.03086805555139141, -0.07318287180927414, -0.02839671506641814, -0.15846489929504334, 0.03744017293344319, 0.4553673592429743, -0.1937451779236456, -0.3520214708061911, 0.0921562613312054, -0.28273270607376133, -0.08168682609004507, 0.24311418486169978, -0.027575032886521644, 0.055334107148045875, 0.04241842970235206, -0.09605615919789703, -0.04879858284341508, -0.1636200602193004, 0.1879453019306333, 0.10743936113115535, 0.3698308568739568, 0.006108712660238506, 0.15324760025019296, -0.05535553606417793, -0.007055427358381966, -0.006939764593409498, -0.12061797509124013, 0.09598134158628695, 0.2726243059038667, 0.03157888522865363, 0.2133903674983296, -0.4132588819813836, -0.19175779765067869, 0.06501306756119053, 0.12302476387956258, 0.0643044311570071, -0.05142335773302601, -0.25213422849830464, 0.0784750394221586, -0.16650492268479822, -0.11811807134233594, 0.01514679829713451, -0.03176265508385308, 0.024958434303610933, -0.2547924309009574, 0.013023761538676468, 0.011639526349503592, 0.047228032901899954, 0.027693887004146284, -0.16481600257467074, 0.03956408032457378, 0.045572184780837, -0.0761271032374296, 0.02863985721263137, 0.1872212618185454, -0.03955519193690831, -0.08073472935869078, 0.3059244969164033, -0.08772194570811263, -0.14086177420987556, 0.15077007299636952, -0.17167708693150746, -0.06390888054247845, 0.17231130066709258, 0.18989608265706395, 0.027932946579334473, -0.18031799304860094, 0.05707387359134702, 0.028919852192861487, 0.2832556785777189, 0.15327712221222603, 0.10030075374142833, 0.24634981219003158, 0.2917343938403415, 0.07553174832544055, 0.1713753668987613, -0.1480616976939007, -0.0010908416371388607, -0.22601631883509368, -0.11849481641337366, -0.21607610961585025, 0.055310417878362966, -0.1151311998841134, -0.15866473236497133, 0.36923000134853085, 0.16894240988732642, 0.16250403059074228, 0.0383525158919279, 0.2990815341248211, 0.05690742985076125, 0.15998537869736867, 0.013452574933306819, 0.2805107447545953, 0.13856769089183085, 0.13086526198537055, -0.20036752545134534, -0.013267639391853598, -0.03230302038613752]
|
1,803.04276
|
Angle-based Shape Determination Theory of Planar Graphs with Application
to Formation Stabilization
|
This paper presents an angle-based approach for distributed formation shape
stabilization of multi-agent systems in the plane. We develop an angle rigidity
theory to study whether a planar framework can be determined by angles between
segments uniquely up to translations, rotations, scalings and reflections. The
proposed angle rigidity theory is applied to the formation stabilization
problem, where multiple single-integrator modeled agents cooperatively achieve
an angle-constrained formation. During the formation process, the global
coordinate system is unknown for each agent and wireless communications between
agents are not required. Moreover, by utilizing the advantage of high degrees
of freedom, we propose a distributed control law for agents to stabilize a
target formation shape with desired orientation and scale. Simulation examples
are performed for illustrating effectiveness of the proposed control
strategies.
|
cs.SY
|
this paper presents an anglebased approach for distributed formation shape stabilization of multiagent systems in the plane we develop an angle rigidity theory to study whether a planar framework can be determined by angles between segments uniquely up to translations rotations scalings and reflections the proposed angle rigidity theory is applied to the formation stabilization problem where multiple singleintegrator modeled agents cooperatively achieve an angleconstrained formation during the formation process the global coordinate system is unknown for each agent and wireless communications between agents are not required moreover by utilizing the advantage of high degrees of freedom we propose a distributed control law for agents to stabilize a target formation shape with desired orientation and scale simulation examples are performed for illustrating effectiveness of the proposed control strategies
|
[['this', 'paper', 'presents', 'an', 'anglebased', 'approach', 'for', 'distributed', 'formation', 'shape', 'stabilization', 'of', 'multiagent', 'systems', 'in', 'the', 'plane', 'we', 'develop', 'an', 'angle', 'rigidity', 'theory', 'to', 'study', 'whether', 'a', 'planar', 'framework', 'can', 'be', 'determined', 'by', 'angles', 'between', 'segments', 'uniquely', 'up', 'to', 'translations', 'rotations', 'scalings', 'and', 'reflections', 'the', 'proposed', 'angle', 'rigidity', 'theory', 'is', 'applied', 'to', 'the', 'formation', 'stabilization', 'problem', 'where', 'multiple', 'singleintegrator', 'modeled', 'agents', 'cooperatively', 'achieve', 'an', 'angleconstrained', 'formation', 'during', 'the', 'formation', 'process', 'the', 'global', 'coordinate', 'system', 'is', 'unknown', 'for', 'each', 'agent', 'and', 'wireless', 'communications', 'between', 'agents', 'are', 'not', 'required', 'moreover', 'by', 'utilizing', 'the', 'advantage', 'of', 'high', 'degrees', 'of', 'freedom', 'we', 'propose', 'a', 'distributed', 'control', 'law', 'for', 'agents', 'to', 'stabilize', 'a', 'target', 'formation', 'shape', 'with', 'desired', 'orientation', 'and', 'scale', 'simulation', 'examples', 'are', 'performed', 'for', 'illustrating', 'effectiveness', 'of', 'the', 'proposed', 'control', 'strategies']]
|
[-0.18290230212005554, 0.08649009076850689, -0.05681839747558115, -0.0157329535090156, -0.0738224981669191, -0.1434409009434603, 0.03175602592909854, 0.430416321993107, -0.3207055235398002, -0.3297293738432927, 0.06750948636727117, -0.18287329753002268, -0.16743900619621854, 0.12147752958844649, -0.1002718501331401, 0.04933747279937961, 0.010871068439882947, -0.015842183061977266, -0.01170555782118754, -0.2292732143905596, 0.2710433810716495, 0.07310909958414413, 0.2990490021475125, 0.009090453397220699, 0.14137979310908122, 0.05669597134635751, 0.03959520792341209, 0.01115923466568347, -0.1415168870207708, 0.11383655678491778, 0.27690823442389956, 0.11496313558745896, 0.27659995830254047, -0.4229503675524029, -0.2068312872779643, 0.08024250972084701, 0.15020398929482326, 0.09143004264478805, -0.057842461403197376, -0.291458210129349, 0.10060734432045138, -0.158901478676853, -0.17365281722595682, -0.06751781146158464, -0.012328558455919847, 0.04265763974945003, -0.31891517806070624, 0.02134460162051255, 0.031562057320115855, 0.07289367714474793, -0.09803998856659746, -0.0058683803499661735, 0.0009758861597219948, 0.1900253581625293, 0.01658870186997774, 0.00967009720079659, 0.1640866949746851, -0.0994924580136285, -0.17015575328696286, 0.3851199944183463, 0.04043896409893932, -0.24823979713232802, 0.16801646244493895, -0.07822418081195792, -0.1157252171633445, 0.1304517386124644, 0.23801918017852586, 0.14248709056602138, -0.16226844037737465, 0.023517169697242934, 0.005437726438685786, 0.21163739335315768, 0.06169893343758304, -0.01368722478946438, 0.21207974494609516, 0.18839405764447292, 0.14429186742927413, 0.13620873304080305, -0.050307968720971985, -0.15953871794772567, -0.27694624296827897, -0.09155631240719231, -0.15464945957955933, -0.002908522579559758, -0.08207332810309254, -0.08917922402906697, 0.3585569076385582, 0.12352712673509814, 0.18284305210545426, 0.07786133885929303, 0.30226966860936955, 0.06122437191879726, 0.034811467960025766, 0.0759617140829505, 0.22478855249755725, 0.10896438685085741, 0.0626442844295525, -0.25768291283384315, 0.10370181452708493, 0.049732896382920444]
|
1,803.04277
|
SDPMN: Privacy Preserving MapReduce Network Using SDN
|
MapReduce is a popular programming model and an associated implementation for
parallel processing big data in the distributed environment. Since large scaled
MapReduce data centers usually provide services to many users, it is an
essential problem to preserve the privacy between different applications in the
same network. In this paper, we propose SDPMN, a framework that using
\textit{software defined network} (SDN) to distinguish the network between each
application, which is a manageable and scalable method. We design this
framework based on the existing SDN structure and Hadoop networks. Since the
rule space of each SDN device is limited, we also propose the rule placement
optimization for this framework to maximize the hardware supported isolated
application networks. We state this problem in a general MapReduce network and
design a heuristic algorithm to find the solution. From the simulation based
evaluation, with our algorithm, the given network can support more privacy
preserving application networks with SDN switches.
|
cs.DC cs.NI
|
mapreduce is a popular programming model and an associated implementation for parallel processing big data in the distributed environment since large scaled mapreduce data centers usually provide services to many users it is an essential problem to preserve the privacy between different applications in the same network in this paper we propose sdpmn a framework that using textitsoftware defined network sdn to distinguish the network between each application which is a manageable and scalable method we design this framework based on the existing sdn structure and hadoop networks since the rule space of each sdn device is limited we also propose the rule placement optimization for this framework to maximize the hardware supported isolated application networks we state this problem in a general mapreduce network and design a heuristic algorithm to find the solution from the simulation based evaluation with our algorithm the given network can support more privacy preserving application networks with sdn switches
|
[['mapreduce', 'is', 'a', 'popular', 'programming', 'model', 'and', 'an', 'associated', 'implementation', 'for', 'parallel', 'processing', 'big', 'data', 'in', 'the', 'distributed', 'environment', 'since', 'large', 'scaled', 'mapreduce', 'data', 'centers', 'usually', 'provide', 'services', 'to', 'many', 'users', 'it', 'is', 'an', 'essential', 'problem', 'to', 'preserve', 'the', 'privacy', 'between', 'different', 'applications', 'in', 'the', 'same', 'network', 'in', 'this', 'paper', 'we', 'propose', 'sdpmn', 'a', 'framework', 'that', 'using', 'textitsoftware', 'defined', 'network', 'sdn', 'to', 'distinguish', 'the', 'network', 'between', 'each', 'application', 'which', 'is', 'a', 'manageable', 'and', 'scalable', 'method', 'we', 'design', 'this', 'framework', 'based', 'on', 'the', 'existing', 'sdn', 'structure', 'and', 'hadoop', 'networks', 'since', 'the', 'rule', 'space', 'of', 'each', 'sdn', 'device', 'is', 'limited', 'we', 'also', 'propose', 'the', 'rule', 'placement', 'optimization', 'for', 'this', 'framework', 'to', 'maximize', 'the', 'hardware', 'supported', 'isolated', 'application', 'networks', 'we', 'state', 'this', 'problem', 'in', 'a', 'general', 'mapreduce', 'network', 'and', 'design', 'a', 'heuristic', 'algorithm', 'to', 'find', 'the', 'solution', 'from', 'the', 'simulation', 'based', 'evaluation', 'with', 'our', 'algorithm', 'the', 'given', 'network', 'can', 'support', 'more', 'privacy', 'preserving', 'application', 'networks', 'with', 'sdn', 'switches']]
|
[-0.1516695953639273, -0.08100634806441734, -0.06864761245083915, 0.040584364217352974, -0.11782249727962064, -0.188189380105244, 0.07790142981095081, 0.43905400346623724, -0.3106161634029906, -0.3241882296948651, 0.09784828994751853, -0.21074349473054016, -0.2094062189811238, 0.17883550884427343, -0.10344275331362059, 0.1008924606980549, 0.0834700797853407, 0.007814978871964758, -0.02805655457694205, -0.272342119139187, 0.31039726266293527, 0.05646796016862579, 0.380138842906389, 0.046726825084001604, 0.08953734113396529, -0.007850885841678949, 0.014054232334803327, 0.016888716339333032, -0.06224635627381907, 0.19364438112368623, 0.30842312968798663, 0.2525130584135992, 0.3424927823723361, -0.45136432578555896, -0.15088128098636694, 0.09331470783617274, 0.15170616648628626, 0.09489821389034464, -0.047436891418590296, -0.2959001064604891, 0.1313484690511246, -0.21532575491194925, -0.036186500443328246, -0.0967164612953472, -0.03353838995707775, -0.000889671477945704, -0.28522807362016134, -0.05346694315522696, -0.016407820565041666, 0.015099493698430022, -0.031362509132770736, -0.05645059719544781, 0.028361800943921302, 0.1252831610633377, -0.01214441595054262, 0.05103840824563568, 0.17143063920738746, -0.06593575777814668, -0.1645408445250949, 0.3835432336367423, 0.024260111761833326, -0.21698241072152955, 0.14442429832468917, 0.023277616847361272, -0.20054641691054784, 0.05424570209602369, 0.25953063106025853, 0.10012563157372414, -0.20650762458996896, 0.06913627742704467, -0.02058235988335903, 0.16424211494782878, 0.004499213505244138, 0.011663815148518683, 0.16373391335623133, 0.30179545305839744, 0.14185275116994722, 0.1465488997915017, -0.03772377273641539, -0.12089773147592163, -0.24773051527030523, -0.15643430414786136, -0.20606175533136706, -0.017780277628475935, -0.12367757627994638, -0.18458816690942625, 0.3743414935485454, 0.21214579010467513, 0.18628210367808373, 0.10565442251714154, 0.4219622925970874, 0.0670262430010826, 0.13214648613596663, 0.18176181771445507, 0.12722214287317363, 0.03552690504561635, 0.19208975800684366, -0.16007335906318737, 0.08473425706866763, -0.005367410217040505]
|
1,803.04278
|
Survival of a planet in short-period Neptunian desert under effect of
photo-evaporation
|
Despite the identification of a great number of Jupiter-like and Earth-like
planets at close-in orbits, the number of "hot Neptunes" - the planets with
0.6-18 times of Neptune mass and orbital periods less than 3 days - turned out
to be very small. The corresponding region in the mass-period distribution was
assigned as the "short-period Neptunian desert". The common explanation of this
fact is that the gaseous planet with few Neptune masses would not survive in
the vicinity of host star due to intensive atmosphere outflow induced by
heating from stellar radiation. To check this hypothesis we performed numerical
simulations of atmosphere dynamics for a hot Neptune. We adopt the previously
developed self-consistent 1D model of hydrogen-helium atmosphere with
suprathermal electrons accounted. The mass-loss rates as a function of orbital
distances and stellar ages are presented. We conclude that the desert of
short-period Neptunes could not be entirely explained by evaporation of planet
atmosphere caused by the radiation from a host star. For the less massive
Neptune-like planet, the estimated upper limits of the mass loss may be
consistent with the photo-evaporation scenario, while the heavier Neptune-like
planets could not lose the significant mass through this mechanism. We also
found the significant differences between our numerical results and widely used
approximate estimates of the mass loss.
|
astro-ph.EP
|
despite the identification of a great number of jupiterlike and earthlike planets at closein orbits the number of hot neptunes the planets with 0618 times of neptune mass and orbital periods less than 3 days turned out to be very small the corresponding region in the massperiod distribution was assigned as the shortperiod neptunian desert the common explanation of this fact is that the gaseous planet with few neptune masses would not survive in the vicinity of host star due to intensive atmosphere outflow induced by heating from stellar radiation to check this hypothesis we performed numerical simulations of atmosphere dynamics for a hot neptune we adopt the previously developed selfconsistent 1d model of hydrogenhelium atmosphere with suprathermal electrons accounted the massloss rates as a function of orbital distances and stellar ages are presented we conclude that the desert of shortperiod neptunes could not be entirely explained by evaporation of planet atmosphere caused by the radiation from a host star for the less massive neptunelike planet the estimated upper limits of the mass loss may be consistent with the photoevaporation scenario while the heavier neptunelike planets could not lose the significant mass through this mechanism we also found the significant differences between our numerical results and widely used approximate estimates of the mass loss
|
[['despite', 'the', 'identification', 'of', 'a', 'great', 'number', 'of', 'jupiterlike', 'and', 'earthlike', 'planets', 'at', 'closein', 'orbits', 'the', 'number', 'of', 'hot', 'neptunes', 'the', 'planets', 'with', '0618', 'times', 'of', 'neptune', 'mass', 'and', 'orbital', 'periods', 'less', 'than', '3', 'days', 'turned', 'out', 'to', 'be', 'very', 'small', 'the', 'corresponding', 'region', 'in', 'the', 'massperiod', 'distribution', 'was', 'assigned', 'as', 'the', 'shortperiod', 'neptunian', 'desert', 'the', 'common', 'explanation', 'of', 'this', 'fact', 'is', 'that', 'the', 'gaseous', 'planet', 'with', 'few', 'neptune', 'masses', 'would', 'not', 'survive', 'in', 'the', 'vicinity', 'of', 'host', 'star', 'due', 'to', 'intensive', 'atmosphere', 'outflow', 'induced', 'by', 'heating', 'from', 'stellar', 'radiation', 'to', 'check', 'this', 'hypothesis', 'we', 'performed', 'numerical', 'simulations', 'of', 'atmosphere', 'dynamics', 'for', 'a', 'hot', 'neptune', 'we', 'adopt', 'the', 'previously', 'developed', 'selfconsistent', '1d', 'model', 'of', 'hydrogenhelium', 'atmosphere', 'with', 'suprathermal', 'electrons', 'accounted', 'the', 'massloss', 'rates', 'as', 'a', 'function', 'of', 'orbital', 'distances', 'and', 'stellar', 'ages', 'are', 'presented', 'we', 'conclude', 'that', 'the', 'desert', 'of', 'shortperiod', 'neptunes', 'could', 'not', 'be', 'entirely', 'explained', 'by', 'evaporation', 'of', 'planet', 'atmosphere', 'caused', 'by', 'the', 'radiation', 'from', 'a', 'host', 'star', 'for', 'the', 'less', 'massive', 'neptunelike', 'planet', 'the', 'estimated', 'upper', 'limits', 'of', 'the', 'mass', 'loss', 'may', 'be', 'consistent', 'with', 'the', 'photoevaporation', 'scenario', 'while', 'the', 'heavier', 'neptunelike', 'planets', 'could', 'not', 'lose', 'the', 'significant', 'mass', 'through', 'this', 'mechanism', 'we', 'also', 'found', 'the', 'significant', 'differences', 'between', 'our', 'numerical', 'results', 'and', 'widely', 'used', 'approximate', 'estimates', 'of', 'the', 'mass', 'loss']]
|
[-0.0928586040640894, 0.2025345718160611, -0.06269107793542669, 0.12602984503011663, -0.0761883762321287, -0.047792485580022366, 0.09318525263186649, 0.3460064907123065, -0.1470843168828532, -0.3850957622629738, 0.07121466969903646, -0.2517692239365647, -0.06936194854309764, 0.2030273973082288, -0.09256190611781209, 0.020799325129548175, 0.15777618363042684, -0.0566098738780515, -0.023354828037826396, -0.26200403774017905, 0.2665708951823953, 0.10108056148431464, 0.013855040136498407, 0.03779353193990956, 0.011253188840204972, -0.10485009052333744, -0.011959295345592164, -0.08553816036976195, -0.17685360814670206, 0.03047857268617671, 0.19244239637715238, 0.1061371171120206, 0.22518883034952472, -0.4113754220013115, -0.2524562540189929, 0.09121872099316636, 0.19749373044474833, 0.0389892187428652, -0.07575282006339272, -0.24428104994944774, 0.07566404425991681, -0.25126438481770197, -0.19886648370101004, 0.04376547804502683, 0.06499101838671437, -0.03353419045675067, -0.2798548748686248, 0.1204290214313192, 0.06882531689392908, 0.11439029115921857, -0.13212881613931854, -0.15726909372807593, -0.12770499584426076, 0.057301981692859535, 0.0892177158515143, 0.00904278916080491, 0.19652015389004182, -0.06206185595789559, -0.0033984239741933543, 0.4251529485396345, -0.10587970612095463, -0.05943595794699738, 0.2761542681728655, -0.2379372673931697, -0.0751567668206424, 0.1967095083940043, 0.1671371418991856, 0.14047532211672287, -0.1892265823264998, -0.03903332970727444, -0.032179835134960505, 0.18296757606445663, 0.09442611109622032, 0.04034159688913333, 0.4267740428804585, 0.15650745673936348, 0.01957887140859928, 0.04020551659621594, -0.1945913410245084, -0.08214892983212457, -0.158437375936148, -0.09298004875167395, -0.16662985584959736, 0.029957142327441594, -0.10085651995674011, -0.119097503613698, 0.3158996106369125, 0.1655812051748883, 0.1883198032307952, 0.01728464143402944, 0.3114324017062296, 0.096650575476407, 0.11984008781080978, 0.13289528529085742, 0.34832132099823, 0.15048158550025703, 0.06831181441949437, -0.2741273478409014, 0.1208984997280151, -0.012431975078530213]
|
1,803.04279
|
In-depth Assessment of an Interactive Graph-based Approach for the
Segmentation for Pancreatic Metastasis in Ultrasound Acquisitions of the
Liver with two Specialists in Internal Medicine
|
The manual outlining of hepatic metastasis in (US) ultrasound acquisitions
from patients suffering from pancreatic cancer is common practice. However,
such pure manual measurements are often very time consuming, and the results
repeatedly differ between the raters. In this contribution, we study the
in-depth assessment of an interactive graph-based approach for the segmentation
for pancreatic metastasis in US images of the liver with two specialists in
Internal Medicine. Thereby, evaluating the approach with over one hundred
different acquisitions of metastases. The two physicians or the algorithm had
never assessed the acquisitions before the evaluation. In summary, the
physicians first performed a pure manual outlining followed by an algorithmic
segmentation over one month later. As a result, the experts satisfied in up to
ninety percent of algorithmic segmentation results. Furthermore, the
algorithmic segmentation was much faster than manual outlining and achieved a
median Dice Similarity Coefficient (DSC) of over eighty percent. Ultimately,
the algorithm enables a fast and accurate segmentation of liver metastasis in
clinical US images, which can support the manual outlining in daily practice.
|
cs.CV
|
the manual outlining of hepatic metastasis in us ultrasound acquisitions from patients suffering from pancreatic cancer is common practice however such pure manual measurements are often very time consuming and the results repeatedly differ between the raters in this contribution we study the indepth assessment of an interactive graphbased approach for the segmentation for pancreatic metastasis in us images of the liver with two specialists in internal medicine thereby evaluating the approach with over one hundred different acquisitions of metastases the two physicians or the algorithm had never assessed the acquisitions before the evaluation in summary the physicians first performed a pure manual outlining followed by an algorithmic segmentation over one month later as a result the experts satisfied in up to ninety percent of algorithmic segmentation results furthermore the algorithmic segmentation was much faster than manual outlining and achieved a median dice similarity coefficient dsc of over eighty percent ultimately the algorithm enables a fast and accurate segmentation of liver metastasis in clinical us images which can support the manual outlining in daily practice
|
[['the', 'manual', 'outlining', 'of', 'hepatic', 'metastasis', 'in', 'us', 'ultrasound', 'acquisitions', 'from', 'patients', 'suffering', 'from', 'pancreatic', 'cancer', 'is', 'common', 'practice', 'however', 'such', 'pure', 'manual', 'measurements', 'are', 'often', 'very', 'time', 'consuming', 'and', 'the', 'results', 'repeatedly', 'differ', 'between', 'the', 'raters', 'in', 'this', 'contribution', 'we', 'study', 'the', 'indepth', 'assessment', 'of', 'an', 'interactive', 'graphbased', 'approach', 'for', 'the', 'segmentation', 'for', 'pancreatic', 'metastasis', 'in', 'us', 'images', 'of', 'the', 'liver', 'with', 'two', 'specialists', 'in', 'internal', 'medicine', 'thereby', 'evaluating', 'the', 'approach', 'with', 'over', 'one', 'hundred', 'different', 'acquisitions', 'of', 'metastases', 'the', 'two', 'physicians', 'or', 'the', 'algorithm', 'had', 'never', 'assessed', 'the', 'acquisitions', 'before', 'the', 'evaluation', 'in', 'summary', 'the', 'physicians', 'first', 'performed', 'a', 'pure', 'manual', 'outlining', 'followed', 'by', 'an', 'algorithmic', 'segmentation', 'over', 'one', 'month', 'later', 'as', 'a', 'result', 'the', 'experts', 'satisfied', 'in', 'up', 'to', 'ninety', 'percent', 'of', 'algorithmic', 'segmentation', 'results', 'furthermore', 'the', 'algorithmic', 'segmentation', 'was', 'much', 'faster', 'than', 'manual', 'outlining', 'and', 'achieved', 'a', 'median', 'dice', 'similarity', 'coefficient', 'dsc', 'of', 'over', 'eighty', 'percent', 'ultimately', 'the', 'algorithm', 'enables', 'a', 'fast', 'and', 'accurate', 'segmentation', 'of', 'liver', 'metastasis', 'in', 'clinical', 'us', 'images', 'which', 'can', 'support', 'the', 'manual', 'outlining', 'in', 'daily', 'practice']]
|
[0.02040100849898798, 0.03906669528373251, -0.0510268459229597, 0.041170679819104924, -0.07390359949586647, -0.12942336372715155, 0.07940927368721791, 0.419902323646737, -0.1636247324222599, -0.35126624152064323, 0.1162092812971345, -0.28731083502726895, -0.1310952043001141, 0.25606483826014614, -0.1606468136768256, 0.04025694625452161, 0.16127372031765325, 0.03548443086977516, -0.04151328914399658, -0.32056882710861306, 0.19673483298426228, 0.05062493729405105, 0.32008862753531764, 0.02151019858662039, 0.08848343642628087, 0.00413737182838044, -0.12523685899430087, -0.03535436789372138, -0.08381024935681905, 0.1486765664842512, 0.36381898697199566, 0.21753385863666025, 0.4051393657496997, -0.44977496749189283, -0.19401333636205112, 0.0637567095391153, 0.1724346629782979, 0.0867249226669914, 0.0068913207815161776, -0.3221013108481254, 0.04805555147784097, -0.15495826628591333, -0.03705519447768373, -0.07308245190020118, -0.024474213553060377, -0.07891360738381212, -0.25670063699728674, 0.15162755644215004, 0.0037510827210332667, 0.14740626708604396, -0.1027313699387014, -0.10225868666744126, 0.04094831935263106, 0.22383365278664444, 0.07436704906867816, 0.1044038013062839, 0.1778448926896921, -0.207744654059144, -0.15381458374605114, 0.33007078034004994, 0.04212576052531534, -0.1431717944304858, 0.19341755968119417, -0.09899705861295972, -0.13168093505980713, 0.19693736138088364, 0.14071413636473673, 0.13439300877574298, -0.18278470005041786, -0.1051278919151186, 0.04680921511458499, 0.17154508646045413, 0.1409219261338668, -0.11439420239999891, 0.14848333174096687, 0.256592008910541, -0.022686977208525475, 0.12968056924907226, -0.12020055471786431, -0.03283884876540729, -0.21915087416768075, -0.18389271362077644, -0.12778741175841007, 0.014569261062092016, -0.12305475196909225, -0.17439972642676108, 0.41741341888372385, 0.2021642567456833, 0.1292090528917366, 0.028757148436270655, 0.3475674272009305, -0.02952523868165112, 0.10571061243569212, -0.012045042115662779, 0.18997860178351403, -0.00018182798554854733, 0.12304241385909595, -0.17946929137089424, 0.14203403827443253, 0.05055742746418608]
|
1,803.0428
|
Calculating the density of solutions of equations related to the
P\'olya-Ostrowski group through Markov chains
|
Motivated by a problem in the theory of integer-valued polynomials, we
investigate the natural density of the solutions of equations of the form
$\theta_uu_q(n)+\theta_ww_q(n)+\theta_2\frac{n(n+1)}{2}+\theta_1n+\theta_0\equiv
0\bmod d$, where $d,q\geq 2$ are fixed integers,
$\theta_u,\theta_w,\theta_2,\theta_1,\theta_0$ are parameters and $u_q$ and
$w_q$ are functions related to the $q$-adic valuations of the numbers between 1
and $n$. We show that the number of solutions of this equation in $[0,N)$
satisfies a recurrence relation, with which we can associate to any pair
$(d,q)$ a stochastic matrix and a Markov chain. Using this interpretation, we
calculate the density for the case $\theta_u=\theta_2=0$ and for the case
$\theta_u=1$, $\theta_w=\theta_2=\theta_1=0$ and either $d|q$ or $d$ and $q$
are coprime.
|
math.NT math.AC
|
motivated by a problem in the theory of integervalued polynomials we investigate the natural density of the solutions of equations of the form theta_uu_qntheta_ww_qntheta_2fracnn12theta_1ntheta_0equiv 0bmod d where dqgeq 2 are fixed integers theta_utheta_wtheta_2theta_1theta_0 are parameters and u_q and w_q are functions related to the qadic valuations of the numbers between 1 and n we show that the number of solutions of this equation in 0n satisfies a recurrence relation with which we can associate to any pair dq a stochastic matrix and a markov chain using this interpretation we calculate the density for the case theta_utheta_20 and for the case theta_u1 theta_wtheta_2theta_10 and either dq or d and q are coprime
|
[['motivated', 'by', 'a', 'problem', 'in', 'the', 'theory', 'of', 'integervalued', 'polynomials', 'we', 'investigate', 'the', 'natural', 'density', 'of', 'the', 'solutions', 'of', 'equations', 'of', 'the', 'form', 'theta_uu_qntheta_ww_qntheta_2fracnn12theta_1ntheta_0equiv', '0bmod', 'd', 'where', 'dqgeq', '2', 'are', 'fixed', 'integers', 'theta_utheta_wtheta_2theta_1theta_0', 'are', 'parameters', 'and', 'u_q', 'and', 'w_q', 'are', 'functions', 'related', 'to', 'the', 'qadic', 'valuations', 'of', 'the', 'numbers', 'between', '1', 'and', 'n', 'we', 'show', 'that', 'the', 'number', 'of', 'solutions', 'of', 'this', 'equation', 'in', '0n', 'satisfies', 'a', 'recurrence', 'relation', 'with', 'which', 'we', 'can', 'associate', 'to', 'any', 'pair', 'dq', 'a', 'stochastic', 'matrix', 'and', 'a', 'markov', 'chain', 'using', 'this', 'interpretation', 'we', 'calculate', 'the', 'density', 'for', 'the', 'case', 'theta_utheta_20', 'and', 'for', 'the', 'case', 'theta_u1', 'theta_wtheta_2theta_10', 'and', 'either', 'dq', 'or', 'd', 'and', 'q', 'are', 'coprime']]
|
[-0.1881413288960735, 0.12073671549128798, -0.05296487268060446, 0.03970210892013991, -0.035904442945208684, -0.1406059225465959, 0.028582132809858125, 0.3124471425163882, -0.30665813544048715, -0.24491080790064118, 0.09183211047806814, -0.31456386032872474, -0.16096586550926217, 0.15321061946899414, -0.013805438032320056, 0.03733787092810067, -0.00603138266552168, 0.09908546279900922, -0.08597804687675446, -0.22637006441184965, 0.369227926475175, -0.05982724343462346, 0.16121760222505635, 0.00437555158098873, 0.10346404692861072, 0.011057954178585742, -0.012577988713299139, 0.0071229086114236945, -0.16279225887389587, 0.10746628633149577, 0.21648501328756817, 0.13766825662101978, 0.23631815953502575, -0.3825045193796261, -0.145738365177889, 0.18278256899569756, 0.13594674936897577, 0.04382429839796924, -0.0022799456715942, -0.20903394212767196, 0.15154965925746813, -0.1657748989539239, -0.13126655008482674, -0.055366022465302825, 0.07818797854437995, 0.10443341569939199, -0.3504462278752516, 0.05577713009328223, 0.07427822580883423, 0.041980042176034585, -0.07337788431099258, -0.14377831367668337, -0.01361012296939197, 0.06976064172564432, 0.029867747175068453, 0.021480859909878254, 0.008426015556324273, -0.1403633091965905, -0.1114822769483838, 0.35792751281629676, -0.07448392135735887, -0.26758020371198654, 0.1325902211560438, -0.1741829510876694, -0.14668890169391838, 0.0663867664630883, 0.12627741576691803, 0.16396641061426356, -0.06606116876579247, 0.15201983272261435, -0.0740802064381289, 0.13533931194195667, 0.08411612528233, 0.0028353061374778357, 0.158007710491522, 0.06476984640511756, 0.02902705298933702, 0.149197561146978, -0.03373022608530636, -0.07536979392730594, -0.3326608229141969, -0.1980185541592968, -0.18137655768973324, 0.09581705964340542, -0.10621502968528009, -0.14317777143934599, 0.36865888018152104, 0.10885950913648056, 0.24020305617999, 0.10593459605745291, 0.20544512550203273, 0.18299762335999942, -0.0010929014175557173, 0.07864105220113952, 0.11288455662389214, 0.17268423729155286, 0.027881157369567797, -0.1874204073772909, 0.0356512688091383, 0.12682727448946723]
|
1,803.04281
|
A Spectral Dichotomy Version of the Nonautonomous Markus--Yamabe
Conjecture
|
In this article we introduce a nonautonomous version of the Markus--Yamabe
conjecture from an exponential dichotomy spectrum point of view. We prove the
validity of this conjecture for the scalar and triangular case. Additionally we
show that the origin is a global attractor for an autonomous system by using
nonautonomous dynamical systems tools.
|
math.DS
|
in this article we introduce a nonautonomous version of the markusyamabe conjecture from an exponential dichotomy spectrum point of view we prove the validity of this conjecture for the scalar and triangular case additionally we show that the origin is a global attractor for an autonomous system by using nonautonomous dynamical systems tools
|
[['in', 'this', 'article', 'we', 'introduce', 'a', 'nonautonomous', 'version', 'of', 'the', 'markusyamabe', 'conjecture', 'from', 'an', 'exponential', 'dichotomy', 'spectrum', 'point', 'of', 'view', 'we', 'prove', 'the', 'validity', 'of', 'this', 'conjecture', 'for', 'the', 'scalar', 'and', 'triangular', 'case', 'additionally', 'we', 'show', 'that', 'the', 'origin', 'is', 'a', 'global', 'attractor', 'for', 'an', 'autonomous', 'system', 'by', 'using', 'nonautonomous', 'dynamical', 'systems', 'tools']]
|
[-0.18762185620715105, 0.017863844403281, -0.1511239113048914, 0.08229180680860256, -0.0032539825956776455, -0.10732146571522122, 0.012260997228605568, 0.2647533181457306, -0.2937610332133635, -0.20994293742444156, 0.13617450429152977, -0.25087935754256147, -0.2395705057062068, 0.21019171536812242, -0.0911544631323162, 0.0525515731951257, 0.05822673912450039, 0.006780781796342641, -0.029139015511697473, -0.2237429845471919, 0.4124575577113988, -0.010098843448707517, 0.19679276103962143, 0.05529336351901293, 0.08309702056829098, 0.03446996588488373, 0.04574030732630559, 0.0046003944029644975, -0.17752721344786893, 0.09684787286480642, 0.17102883955823994, 0.13137961050302213, 0.2904124174196765, -0.3683592463790808, -0.1905374877277832, 0.17518149896190977, 0.1546849474873183, 0.13948418007601263, -0.09205969507841147, -0.2938360993724035, 0.1257682333454349, -0.18439533646473275, -0.2660919951125628, -0.0664370088433882, 0.013277159160319364, 0.01482176925670707, -0.2607676200568676, 0.05266275228756779, 0.16051106226689815, 0.13677025891243005, -0.11923070257213318, 0.006793081481449025, 0.009952522427687105, 0.08279379097006793, 0.02376947974135994, -0.015782579331535776, 0.033389992888946576, -0.09274274355925198, -0.15226736266104468, 0.36178048882844316, -0.09751802154175304, -0.18317849143355522, 0.15031521778689907, -0.11093009538280796, -0.22886787122115493, 0.05844819761882975, 0.16043206408426589, 0.10986365281256302, -0.16507985500864825, 0.14689423120910092, -0.1352455928253959, 0.17997562488428984, 0.030067407635901617, -0.009579725800749828, 0.1874057800280598, 0.17101131244298984, 0.1456784398277413, 0.19883233600489372, -0.0030149361305378095, -0.10656732193387623, -0.3091013811985558, -0.169273693096947, -0.1337584788814398, 0.10368821100454848, -0.08856618870900865, -0.1533402662794545, 0.39904035156909023, 0.17197257934032745, 0.17006487673464812, 0.13548535209166696, 0.24721167398230084, 0.17015785312297632, -0.041749993058026964, 0.08693360964993327, 0.2033302326651536, 0.13308145803891402, 0.13356632459908724, -0.18346923319535013, -0.030771742053198152, 0.17142991524822307]
|
1,803.04282
|
Linear-Time In-Place DFS and BFS on the Word RAM
|
We present an in-place depth first search (DFS) and an in-place breadth first
search (BFS) that runs on a word RAM in linear time such that, if the adjacency
arrays of the input graph are given in a sorted order, the input is restored
after running the algorithm. To obtain our results we use properties of the
representation used to store the given graph and show several linear-time
in-place graph transformations from one representation into another.
|
cs.DS
|
we present an inplace depth first search dfs and an inplace breadth first search bfs that runs on a word ram in linear time such that if the adjacency arrays of the input graph are given in a sorted order the input is restored after running the algorithm to obtain our results we use properties of the representation used to store the given graph and show several lineartime inplace graph transformations from one representation into another
|
[['we', 'present', 'an', 'inplace', 'depth', 'first', 'search', 'dfs', 'and', 'an', 'inplace', 'breadth', 'first', 'search', 'bfs', 'that', 'runs', 'on', 'a', 'word', 'ram', 'in', 'linear', 'time', 'such', 'that', 'if', 'the', 'adjacency', 'arrays', 'of', 'the', 'input', 'graph', 'are', 'given', 'in', 'a', 'sorted', 'order', 'the', 'input', 'is', 'restored', 'after', 'running', 'the', 'algorithm', 'to', 'obtain', 'our', 'results', 'we', 'use', 'properties', 'of', 'the', 'representation', 'used', 'to', 'store', 'the', 'given', 'graph', 'and', 'show', 'several', 'lineartime', 'inplace', 'graph', 'transformations', 'from', 'one', 'representation', 'into', 'another']]
|
[-0.08747596071562887, 0.08090427983284156, -0.07674532413703243, 0.032974728802448804, -0.12504748579751895, -0.08463156577444782, 0.05509386386563021, 0.47427418043738917, -0.3562702610598583, -0.3339333994019973, 0.11748928421998005, -0.25604819280928687, -0.17635736821562445, 0.1556222029826849, -0.01579092219349389, 0.07969429982614729, 0.11169310899353341, 0.0968795026603498, -0.0380419705884139, -0.3027336486047716, 0.20858683831695662, 0.02464492153376341, 0.18130542781498088, -0.040945607433585746, 0.12198773089575728, 0.06061734152516644, -0.06467254828710697, 0.0010248044456698392, -0.09953685120260496, 0.07189121789691087, 0.2466473797899916, 0.2344837387423276, 0.2078644055137901, -0.4748993530918501, -0.11009986900822505, 0.12364377588719914, 0.13668325029338071, 0.14378247579167547, -0.07510345068447732, -0.2803576476626882, 0.1236895663222592, -0.10948366413159467, 0.013736079018072863, -0.088730693096295, 0.05856082295557778, -0.026041806258849408, -0.2583870206558219, -0.08523580113327817, 0.12476652171952944, -0.023129586228414586, -0.01208515003274538, -0.09766673583439306, 0.041358658912174995, 0.15373449054497637, -0.06582485452159553, 0.05444544632183878, 0.07776391264173742, -0.10232151054476976, -0.21058644695011408, 0.40586423114138215, -0.07210950226075702, -0.14903930892040462, 0.10846055880507552, -0.06914510721291758, -0.19732363426163302, 0.10517122938395723, 0.19850017055624017, 0.10611648443400075, -0.09044393791670077, 0.085365407847444, -0.06902143949838846, 0.2585546041740791, 0.09460908293993653, -0.0020840899516387204, 0.10587220690458228, 0.19309688131570032, 0.10898551119393424, 0.2067159519095807, -0.062299894074002576, -0.005096928081720283, -0.2896712361589858, -0.16170736559127508, -0.2482958003559983, -0.04901535952414729, -0.1800082757158395, -0.19032825528349923, 0.4498037795389169, 0.21175658268437378, 0.23052095037296808, 0.15243244594526723, 0.3292813786844674, 0.09641244620280831, 0.10311346680023953, 0.18216076562806083, 0.08871752966048294, 0.0792058837281442, 0.07424607474087297, -0.1762800089858693, 0.07505919102665135, 0.1382047903576964]
|
1,803.04283
|
Concentration in the flux approximation limit of Riemann solutions to
the extended Chaplygin gas equations with Coulomb-like friction
|
In this paper, two kinds of occurrence mechanism on the phenomenon of
concentration and the formation of delta shock waves are analyzed and
identified in the flux approximation limit of Riemann solutions to the extended
Chaplygin gas equations with Coulomb-like friction, whose special case can also
be seen as the model of the magnetogasdynamics with Coulomb-like friction.
Firstly, by introducing a transformation, the Riemann problem for the extended
Chaplygin gas equations with Coulomb-like friction is solved completely.
Secondly, we rigorously show that, as the pressure vanishes, any two-shock
Riemann solution to the nonhomogeneous extended Chaplygin gas equations tends
to a {\delta}-shock solution to the corresponding nonhomogeneous transportation
equations, and the intermediate density between the two shocks tends to a
weighted {\delta}-measure that forms the {\delta}-shock; any
two-rarefaction-wave Riemann solution to the nonhomogeneous extended Chaplygin
gas equations tends to a two-contact-discontinuity solution to the
correspongding nonhomogeneous transportation equations, and the nonvacuum
intermediate state between the two rarefaction waves tends to a vacuum state.
At last, we also show that, as the pressure approaches the generalized
Chaplygin pressure, any two-shock Riemann solution to the nonhomogeneous
extended Chaplygin gas equations tends to a delta-shock solution to the
correspongding nonhomogeneous generalized Chaplygin gas equations. In a word,
we have generalized all the results about the vanishing pressure limit now
available for homogeneous equations to the nonhomogeneous case.
|
math.AP
|
in this paper two kinds of occurrence mechanism on the phenomenon of concentration and the formation of delta shock waves are analyzed and identified in the flux approximation limit of riemann solutions to the extended chaplygin gas equations with coulomblike friction whose special case can also be seen as the model of the magnetogasdynamics with coulomblike friction firstly by introducing a transformation the riemann problem for the extended chaplygin gas equations with coulomblike friction is solved completely secondly we rigorously show that as the pressure vanishes any twoshock riemann solution to the nonhomogeneous extended chaplygin gas equations tends to a deltashock solution to the corresponding nonhomogeneous transportation equations and the intermediate density between the two shocks tends to a weighted deltameasure that forms the deltashock any tworarefactionwave riemann solution to the nonhomogeneous extended chaplygin gas equations tends to a twocontactdiscontinuity solution to the correspongding nonhomogeneous transportation equations and the nonvacuum intermediate state between the two rarefaction waves tends to a vacuum state at last we also show that as the pressure approaches the generalized chaplygin pressure any twoshock riemann solution to the nonhomogeneous extended chaplygin gas equations tends to a deltashock solution to the correspongding nonhomogeneous generalized chaplygin gas equations in a word we have generalized all the results about the vanishing pressure limit now available for homogeneous equations to the nonhomogeneous case
|
[['in', 'this', 'paper', 'two', 'kinds', 'of', 'occurrence', 'mechanism', 'on', 'the', 'phenomenon', 'of', 'concentration', 'and', 'the', 'formation', 'of', 'delta', 'shock', 'waves', 'are', 'analyzed', 'and', 'identified', 'in', 'the', 'flux', 'approximation', 'limit', 'of', 'riemann', 'solutions', 'to', 'the', 'extended', 'chaplygin', 'gas', 'equations', 'with', 'coulomblike', 'friction', 'whose', 'special', 'case', 'can', 'also', 'be', 'seen', 'as', 'the', 'model', 'of', 'the', 'magnetogasdynamics', 'with', 'coulomblike', 'friction', 'firstly', 'by', 'introducing', 'a', 'transformation', 'the', 'riemann', 'problem', 'for', 'the', 'extended', 'chaplygin', 'gas', 'equations', 'with', 'coulomblike', 'friction', 'is', 'solved', 'completely', 'secondly', 'we', 'rigorously', 'show', 'that', 'as', 'the', 'pressure', 'vanishes', 'any', 'twoshock', 'riemann', 'solution', 'to', 'the', 'nonhomogeneous', 'extended', 'chaplygin', 'gas', 'equations', 'tends', 'to', 'a', 'deltashock', 'solution', 'to', 'the', 'corresponding', 'nonhomogeneous', 'transportation', 'equations', 'and', 'the', 'intermediate', 'density', 'between', 'the', 'two', 'shocks', 'tends', 'to', 'a', 'weighted', 'deltameasure', 'that', 'forms', 'the', 'deltashock', 'any', 'tworarefactionwave', 'riemann', 'solution', 'to', 'the', 'nonhomogeneous', 'extended', 'chaplygin', 'gas', 'equations', 'tends', 'to', 'a', 'twocontactdiscontinuity', 'solution', 'to', 'the', 'correspongding', 'nonhomogeneous', 'transportation', 'equations', 'and', 'the', 'nonvacuum', 'intermediate', 'state', 'between', 'the', 'two', 'rarefaction', 'waves', 'tends', 'to', 'a', 'vacuum', 'state', 'at', 'last', 'we', 'also', 'show', 'that', 'as', 'the', 'pressure', 'approaches', 'the', 'generalized', 'chaplygin', 'pressure', 'any', 'twoshock', 'riemann', 'solution', 'to', 'the', 'nonhomogeneous', 'extended', 'chaplygin', 'gas', 'equations', 'tends', 'to', 'a', 'deltashock', 'solution', 'to', 'the', 'correspongding', 'nonhomogeneous', 'generalized', 'chaplygin', 'gas', 'equations', 'in', 'a', 'word', 'we', 'have', 'generalized', 'all', 'the', 'results', 'about', 'the', 'vanishing', 'pressure', 'limit', 'now', 'available', 'for', 'homogeneous', 'equations', 'to', 'the', 'nonhomogeneous', 'case']]
|
[-0.15724254245181907, 0.10984463932955722, -0.10464439253873108, 0.07781369461127642, -0.08083088817074895, -0.15287056836849924, -0.03795484669866379, 0.24660197306763043, -0.3128504651386968, -0.21635994871612638, 0.09517869960717772, -0.2771859365885823, -0.09366931462321769, 0.10658066301204433, 0.00768094098364765, 0.06724591971248049, -0.01283752511054362, 0.0015151255298405885, -0.10098270011129154, -0.2868431139102375, 0.37540732564573936, 0.03575928407861449, 0.22429228196005252, 0.052465200733224096, 0.14865402118937873, -0.09583576408595863, 0.05182109001378359, 0.03785813738544345, -0.1845582620647871, -0.00034020487272011285, 0.24316250472964548, 0.02383285986936905, 0.2727795397354798, -0.43717210188677363, -0.28350788134107874, 0.11112232481722127, 0.1558761818609624, 0.08980438168033619, -0.0031358792261347514, -0.292130131657574, 0.0005860519314989109, -0.2041083875281567, -0.2665734617568722, -0.012236376689873974, 0.002146308322500607, 0.06622527226996185, -0.23879186381924558, 0.14117196442389698, 0.0618017098358409, -0.08366223578341306, -0.2245447067665571, -0.06127462655475194, -0.05332397970751944, -0.00756171926305714, 0.08950323006296954, 0.026181375790937718, 0.08096799442586912, -0.15476542833348503, 0.0059885058276863265, 0.3965504426170479, -0.15569682944227348, -0.3208597498439882, 0.21412363128143955, -0.11110409322745082, -0.10712592651199719, 0.13717459513969846, 0.14934650498484683, 0.08600963855543259, -0.15053241961127656, 0.07805419431216168, -0.054738602963466707, 0.12054203056560998, 0.14502671566495504, -0.10468699881722304, 0.1928078118161383, 0.07552231987091627, 0.06978927581168881, 0.19344735605356453, -0.0634487876848487, -0.1477195730644532, -0.3296583049115725, -0.20247978491825053, -0.12278738193351521, 0.10043583823452619, -0.127582866372276, -0.20617766402323137, 0.279156284076585, 0.11360482080543244, 0.1268800802169029, 0.044316916772037404, 0.2656387647211721, 0.18334464568655345, 0.004348618329756639, 0.11477804489814761, 0.19234112623697994, 0.20554316266207023, 0.1523562033470212, -0.2356232473277487, 0.023925176208881155, 0.1447336364357563]
|
1,803.04284
|
Acoustic semimetal with Weyl points and surface states
|
Two-dimensional topological edge states, immunizing against defects and
disorders, have greatly revolutionized our scientific cognition on propagation
and scattering of acoustic waves. Recently, the similar states have been
predicted in three-dimensional acoustic systems consisting of chiral coupling
resonance cavities. However, the direct observation of topological surface
propagation, especially in a 3D acoustic system with simple scatterers but not
complicatedly coupling resonances, has still not been exploited. Here, we
design and fabricate a 3D acoustic semimetal composed of rotationally stacked
rods. This semimetal not only produces a linear Weyl degeneracy with a charge
of 1, but also yields a double Weyl point with a charge of 2. In its nontrivial
gaps, we discover the surface states associated with these Weyl points and
experimentally demonstrate the topologically protected one-way propagation of
acoustic waves. Due to its good fabricability and topological non-reciprocity,
this acoustic semimetal provides an excellent platform for the integration of
various acoustic devices, from a macroscopic scale to a nanoscale.
|
cond-mat.mtrl-sci
|
twodimensional topological edge states immunizing against defects and disorders have greatly revolutionized our scientific cognition on propagation and scattering of acoustic waves recently the similar states have been predicted in threedimensional acoustic systems consisting of chiral coupling resonance cavities however the direct observation of topological surface propagation especially in a 3d acoustic system with simple scatterers but not complicatedly coupling resonances has still not been exploited here we design and fabricate a 3d acoustic semimetal composed of rotationally stacked rods this semimetal not only produces a linear weyl degeneracy with a charge of 1 but also yields a double weyl point with a charge of 2 in its nontrivial gaps we discover the surface states associated with these weyl points and experimentally demonstrate the topologically protected oneway propagation of acoustic waves due to its good fabricability and topological nonreciprocity this acoustic semimetal provides an excellent platform for the integration of various acoustic devices from a macroscopic scale to a nanoscale
|
[['twodimensional', 'topological', 'edge', 'states', 'immunizing', 'against', 'defects', 'and', 'disorders', 'have', 'greatly', 'revolutionized', 'our', 'scientific', 'cognition', 'on', 'propagation', 'and', 'scattering', 'of', 'acoustic', 'waves', 'recently', 'the', 'similar', 'states', 'have', 'been', 'predicted', 'in', 'threedimensional', 'acoustic', 'systems', 'consisting', 'of', 'chiral', 'coupling', 'resonance', 'cavities', 'however', 'the', 'direct', 'observation', 'of', 'topological', 'surface', 'propagation', 'especially', 'in', 'a', '3d', 'acoustic', 'system', 'with', 'simple', 'scatterers', 'but', 'not', 'complicatedly', 'coupling', 'resonances', 'has', 'still', 'not', 'been', 'exploited', 'here', 'we', 'design', 'and', 'fabricate', 'a', '3d', 'acoustic', 'semimetal', 'composed', 'of', 'rotationally', 'stacked', 'rods', 'this', 'semimetal', 'not', 'only', 'produces', 'a', 'linear', 'weyl', 'degeneracy', 'with', 'a', 'charge', 'of', '1', 'but', 'also', 'yields', 'a', 'double', 'weyl', 'point', 'with', 'a', 'charge', 'of', '2', 'in', 'its', 'nontrivial', 'gaps', 'we', 'discover', 'the', 'surface', 'states', 'associated', 'with', 'these', 'weyl', 'points', 'and', 'experimentally', 'demonstrate', 'the', 'topologically', 'protected', 'oneway', 'propagation', 'of', 'acoustic', 'waves', 'due', 'to', 'its', 'good', 'fabricability', 'and', 'topological', 'nonreciprocity', 'this', 'acoustic', 'semimetal', 'provides', 'an', 'excellent', 'platform', 'for', 'the', 'integration', 'of', 'various', 'acoustic', 'devices', 'from', 'a', 'macroscopic', 'scale', 'to', 'a', 'nanoscale']]
|
[-0.20674492529763272, 0.19149857817838956, -0.04649555334036455, -0.003841597108029813, -0.11304874251502911, -0.18106090722740306, 0.04399096598239534, 0.38223556167030204, -0.24972609856968406, -0.26431936666416295, 0.02744120705957706, -0.316873442818727, -0.213337554244922, 0.19477066839312981, 0.013964509625140132, 0.11337424826342613, 0.019175084026635817, -0.016019403408779383, -0.05843021593982085, -0.14739271787539968, 0.29923707649255255, 0.008750995124306576, 0.37007093682604014, 0.052692635482727734, 0.07432974008228278, -0.026416274190312193, 0.06820590691728834, 0.036618450228212716, -0.0956363415978146, 0.11478959265203104, 0.25932677572229934, -0.04859922572739024, 0.19102024153730124, -0.4808405835017468, -0.28955634594924234, 0.028301973162783066, 0.1803027036345019, 0.1884404914160757, -0.14281373597614164, -0.35403119470724986, 0.09167958974893901, -0.14771120218595243, -0.12348974186133772, -0.07475766239968955, 0.005457353338880359, -0.052646567398512374, -0.16414299756493536, 0.058296121910043096, 0.04638614050118522, 0.07014807251592477, -0.06293842653550263, -0.040034276350553635, -0.0885902916589377, 0.09271585460717105, -0.004853479895131581, -0.007610336148162496, 0.0787368491262713, -0.12936188441220928, -0.15249968196540695, 0.4072092022079061, -0.030431856850818173, -0.1891915692608077, 0.23968359580667653, -0.13257580266481284, -0.04165711693916727, 0.15376321193264247, 0.16942061798401037, 0.06450703129195755, -0.09736459474401467, 0.07047917346620886, -0.017229099623249762, 0.1569077868555283, 0.053487390530172665, 0.09629667230512735, 0.30110349254272645, 0.19692956473467485, 0.04595927906855238, 0.103184303293318, -0.1263048216138978, 0.03831948897414753, -0.24847764979883935, -0.18382058584580854, -0.25005139125827347, 0.061710552273171, -0.023468281908356876, -0.24850468901015302, 0.45429331179907395, 0.12463349681025453, 0.1933236804544785, -0.022145500929393578, 0.25973664791434536, 0.07219560171181699, 0.10780730013554014, 0.06134808004347596, 0.2976507067170767, 0.14782701529644476, 0.08721431181912527, -0.23260938401228554, 0.006282831366472649, -0.008814546200534646]
|
1,803.04285
|
Many-body localization transition with power-law interactions:
Statistics of eigenstates
|
We study spectral and wavefunction statistics for many-body localization
transition in systems with long-range interactions decaying as $1/r^\alpha$
with an exponent $\alpha$ satisfying $ d \le \alpha \le 2d$, where $d$ is the
spatial dimensionality. We refine earlier arguments and show that the system
undergoes a localization transition as a function of the rescaled disorder $W^*
= W / L^{2d-\alpha} \ln L$, where $W$ is the disorder strength and $L$ the
system size. This transition has much in common with that on random regular
graphs. We further perform a detailed analysis of the inverse participation
ratio (IPR) of many-body wavefunctions, exploring how ergodic behavior in the
delocalized phase switches to fractal one at the critical point and on the
localized side of the transition. Our analytical results for the scaling of the
critical disorder $W$ with the system size $L$ and for the scaling of IPR in
the delocalized and localized phases are supported and corroborated by exact
diagonalization of spin chains.
|
cond-mat.dis-nn
|
we study spectral and wavefunction statistics for manybody localization transition in systems with longrange interactions decaying as 1ralpha with an exponent alpha satisfying d le alpha le 2d where d is the spatial dimensionality we refine earlier arguments and show that the system undergoes a localization transition as a function of the rescaled disorder w w l2dalpha ln l where w is the disorder strength and l the system size this transition has much in common with that on random regular graphs we further perform a detailed analysis of the inverse participation ratio ipr of manybody wavefunctions exploring how ergodic behavior in the delocalized phase switches to fractal one at the critical point and on the localized side of the transition our analytical results for the scaling of the critical disorder w with the system size l and for the scaling of ipr in the delocalized and localized phases are supported and corroborated by exact diagonalization of spin chains
|
[['we', 'study', 'spectral', 'and', 'wavefunction', 'statistics', 'for', 'manybody', 'localization', 'transition', 'in', 'systems', 'with', 'longrange', 'interactions', 'decaying', 'as', '1ralpha', 'with', 'an', 'exponent', 'alpha', 'satisfying', 'd', 'le', 'alpha', 'le', '2d', 'where', 'd', 'is', 'the', 'spatial', 'dimensionality', 'we', 'refine', 'earlier', 'arguments', 'and', 'show', 'that', 'the', 'system', 'undergoes', 'a', 'localization', 'transition', 'as', 'a', 'function', 'of', 'the', 'rescaled', 'disorder', 'w', 'w', 'l2dalpha', 'ln', 'l', 'where', 'w', 'is', 'the', 'disorder', 'strength', 'and', 'l', 'the', 'system', 'size', 'this', 'transition', 'has', 'much', 'in', 'common', 'with', 'that', 'on', 'random', 'regular', 'graphs', 'we', 'further', 'perform', 'a', 'detailed', 'analysis', 'of', 'the', 'inverse', 'participation', 'ratio', 'ipr', 'of', 'manybody', 'wavefunctions', 'exploring', 'how', 'ergodic', 'behavior', 'in', 'the', 'delocalized', 'phase', 'switches', 'to', 'fractal', 'one', 'at', 'the', 'critical', 'point', 'and', 'on', 'the', 'localized', 'side', 'of', 'the', 'transition', 'our', 'analytical', 'results', 'for', 'the', 'scaling', 'of', 'the', 'critical', 'disorder', 'w', 'with', 'the', 'system', 'size', 'l', 'and', 'for', 'the', 'scaling', 'of', 'ipr', 'in', 'the', 'delocalized', 'and', 'localized', 'phases', 'are', 'supported', 'and', 'corroborated', 'by', 'exact', 'diagonalization', 'of', 'spin', 'chains']]
|
[-0.1659120023280052, 0.2025623543172687, -0.05902708328477861, 0.04348358407371996, 0.03909681851591007, -0.19643677222613198, 0.07503888006410503, 0.34180147819150286, -0.2377177302643091, -0.22647909424562432, 0.050809741126302675, -0.3450582947794206, -0.14336141578033804, 0.12247450319059854, 0.07997868383963462, 0.06474674789159841, -0.004857455568883238, 0.046767040947157466, -0.10117465637541742, -0.1718021232186805, 0.3301112414426111, 0.04005138675352158, 0.2699084928542187, 0.057858281816014004, -0.011556084205903396, 0.04682218289507304, 0.03662901715953139, 0.01403782150893814, -0.19111494709565555, 0.05492436575785845, 0.18956261895202053, 0.030976031004315643, 0.23649324684203427, -0.33998767560041404, -0.1886800505109264, 0.06410204550204208, 0.21679303143173456, 0.06925332749003096, 3.112813227963221e-05, -0.3335009613280668, 0.07637936318929814, -0.13437796195473853, -0.15095701050956414, -0.0541670371931565, 0.10382107744299912, 0.03770727047967854, -0.29942591878573727, 0.12154258169304533, 0.10231672606100858, 0.06985187402755447, -0.014450937971882405, -0.10222864660944295, -0.03672991370446273, 0.14088156876888103, 0.041808067126158345, 0.02686501117688427, 0.12201235079961016, -0.11292675647242113, -0.09297082779481064, 0.3308998287914769, -0.03332516350164491, -0.16745291741069737, 0.2203880510870603, -0.18800604605431673, -0.13106501886114194, 0.1532904177976336, 0.13487999030695402, 0.08005515627229226, -0.04244870977856431, 0.13361055041770922, -0.005624816128158871, 0.20828141375902387, -0.0029791632145525345, 0.05712807677167503, 0.1479124860407761, 0.18255704276402232, 0.05716017742650112, 0.1495617727964197, -0.0735879200047414, -0.08379287731279678, -0.2786647661742342, -0.1546231003771418, -0.2776078058022098, 0.08621786500082669, -0.14122988483980903, -0.19291544992983625, 0.3759012505812924, 0.13232165329450082, 0.22740081929648884, 0.07296852777930142, 0.1800826178941746, 0.15589735865934834, -0.0025011369180452975, 0.043746529910359766, 0.19090525364308747, 0.12760224969338485, 0.09923469133474687, -0.2712337869408104, 0.01876391922241619, 0.09598208409645653]
|
1,803.04286
|
Extremely $^{54}$Cr- and $^{50}$Ti-rich presolar oxide grains in a
primitive meteorite: Formation in rare types of supernovae and implications
for the astrophysical context of solar system birth
|
We report the identification of 19 presolar oxide grains from the Orgueil CI
meteorite with substantial enrichments in $^{54}$Cr, with $^{54}$Cr/$^{52}$Cr
ratios ranging from 1.2 to 56 times the solar value. The most enriched grains
also exhibit enrichments at mass 50, most likely due in part to $^{50}$Ti, but
close-to-normal or depleted $^{53}$Cr/$^{52}$Cr ratios. There is a strong
inverse relationship between $^{54}$Cr enrichment and grain size; the most
extreme grains are all <80 nm in diameter. Comparison of the isotopic data with
predictions of nucleosynthesis calculations indicate that these grains most
likely originated in either rare, high-density Type Ia supernovae (SNIa), or in
electron-capture supernovae (ECSN) which may occur as the end stage of
evolution for stars of mass 8-10 M$_\odot$. This is the first evidence for
preserved presolar grains from either type of supernova. An ECSN origin is
attractive since these likely occur much more frequently than high-density
SNIa, and their evolutionary timescales ($\sim$20 Myr) are comparable to those
of molecular clouds. Self-pollution of the Sun's parent cloud from an ECSN may
explain the heterogeneous distribution of n-rich isotopic anomalies in
planetary materials, including a recently reported dichotomy in Mo isotopes in
the solar system. The stellar origins of three grains with solar
$^{54}$Cr/$^{52}$Cr, but anomalies in $^{50}$Cr or $^{53}$Cr, as well as of a
grain enriched in $^{57}$Fe, are unclear.
|
astro-ph.EP astro-ph.SR
|
we report the identification of 19 presolar oxide grains from the orgueil ci meteorite with substantial enrichments in 54cr with 54cr52cr ratios ranging from 12 to 56 times the solar value the most enriched grains also exhibit enrichments at mass 50 most likely due in part to 50ti but closetonormal or depleted 53cr52cr ratios there is a strong inverse relationship between 54cr enrichment and grain size the most extreme grains are all 80 nm in diameter comparison of the isotopic data with predictions of nucleosynthesis calculations indicate that these grains most likely originated in either rare highdensity type ia supernovae snia or in electroncapture supernovae ecsn which may occur as the end stage of evolution for stars of mass 810 m_odot this is the first evidence for preserved presolar grains from either type of supernova an ecsn origin is attractive since these likely occur much more frequently than highdensity snia and their evolutionary timescales sim20 myr are comparable to those of molecular clouds selfpollution of the suns parent cloud from an ecsn may explain the heterogeneous distribution of nrich isotopic anomalies in planetary materials including a recently reported dichotomy in mo isotopes in the solar system the stellar origins of three grains with solar 54cr52cr but anomalies in 50cr or 53cr as well as of a grain enriched in 57fe are unclear
|
[['we', 'report', 'the', 'identification', 'of', '19', 'presolar', 'oxide', 'grains', 'from', 'the', 'orgueil', 'ci', 'meteorite', 'with', 'substantial', 'enrichments', 'in', '54cr', 'with', '54cr52cr', 'ratios', 'ranging', 'from', '12', 'to', '56', 'times', 'the', 'solar', 'value', 'the', 'most', 'enriched', 'grains', 'also', 'exhibit', 'enrichments', 'at', 'mass', '50', 'most', 'likely', 'due', 'in', 'part', 'to', '50ti', 'but', 'closetonormal', 'or', 'depleted', '53cr52cr', 'ratios', 'there', 'is', 'a', 'strong', 'inverse', 'relationship', 'between', '54cr', 'enrichment', 'and', 'grain', 'size', 'the', 'most', 'extreme', 'grains', 'are', 'all', '80', 'nm', 'in', 'diameter', 'comparison', 'of', 'the', 'isotopic', 'data', 'with', 'predictions', 'of', 'nucleosynthesis', 'calculations', 'indicate', 'that', 'these', 'grains', 'most', 'likely', 'originated', 'in', 'either', 'rare', 'highdensity', 'type', 'ia', 'supernovae', 'snia', 'or', 'in', 'electroncapture', 'supernovae', 'ecsn', 'which', 'may', 'occur', 'as', 'the', 'end', 'stage', 'of', 'evolution', 'for', 'stars', 'of', 'mass', '810', 'm_odot', 'this', 'is', 'the', 'first', 'evidence', 'for', 'preserved', 'presolar', 'grains', 'from', 'either', 'type', 'of', 'supernova', 'an', 'ecsn', 'origin', 'is', 'attractive', 'since', 'these', 'likely', 'occur', 'much', 'more', 'frequently', 'than', 'highdensity', 'snia', 'and', 'their', 'evolutionary', 'timescales', 'sim20', 'myr', 'are', 'comparable', 'to', 'those', 'of', 'molecular', 'clouds', 'selfpollution', 'of', 'the', 'suns', 'parent', 'cloud', 'from', 'an', 'ecsn', 'may', 'explain', 'the', 'heterogeneous', 'distribution', 'of', 'nrich', 'isotopic', 'anomalies', 'in', 'planetary', 'materials', 'including', 'a', 'recently', 'reported', 'dichotomy', 'in', 'mo', 'isotopes', 'in', 'the', 'solar', 'system', 'the', 'stellar', 'origins', 'of', 'three', 'grains', 'with', 'solar', '54cr52cr', 'but', 'anomalies', 'in', '50cr', 'or', '53cr', 'as', 'well', 'as', 'of', 'a', 'grain', 'enriched', 'in', '57fe', 'are', 'unclear']]
|
[-0.03137574761164036, 0.19482366241400914, 0.006262975499372591, 0.0968523139716126, -0.005122337695634501, -0.07314049322369763, 0.05623590144095943, 0.3771290456897325, -0.1911008326569572, -0.3471197886170227, 0.05420208076882938, -0.32703608153387903, -0.024892649469389155, 0.158545031669465, -0.05288229570095692, -0.05443456438370049, 0.09640369905920869, -0.06501783708808943, -0.08201397365509448, -0.24128543412450448, 0.27336670407411556, 0.07185222719986499, 0.16566494905643842, -0.010393101940545338, -0.028287003197262742, -0.18967156732978765, -0.008749724868473342, -0.05167827914066782, -0.12379522877021042, 0.058796866667795586, 0.2446859759816355, 0.10945178382627835, 0.14607094624608924, -0.4540477360265372, -0.21745455376698042, 0.10873640735041011, 0.19762550277466123, 0.060897639850472016, -0.10100275123292125, -0.21683548533632843, 0.08721793524111325, -0.19060527178966863, -0.14916347444946454, 0.09835565895032646, 0.07802087195979601, 0.02923293382098729, -0.23699743021014993, 0.13698471883293348, 0.03586614199712957, 0.1151479624579224, -0.11997151695276526, -0.213763189207318, -0.07317043945526662, 0.024642518121452833, 0.07837306022411213, -0.007548862111500718, 0.1833427654536949, -0.08595436197726733, 0.0021461154249581425, 0.47357039346613666, -0.04813021768647807, 0.03956689269451255, 0.2790767499330369, -0.21299235680595632, -0.17866239542437887, 0.20703935526226733, 0.12798803257332605, 0.11698183855253526, -0.19022088168527593, -0.029009705978784373, 0.004215322977556339, 0.1800567373845049, 0.07802533559945667, 0.07831038349795563, 0.29226918650780465, 0.18848699165709232, -0.02366714487487281, 0.019214648689905352, -0.18758325667162848, -0.05529831090984358, -0.18510706304805352, -0.1598067744508047, -0.10509349034771069, 0.12222963535565544, -0.15034270359094742, -0.1600079790034215, 0.24855417930309406, 0.11624730479459024, 0.2247634444491599, -0.039632727321639485, 0.21762536987556483, -0.007272056623002176, 0.14909132579553194, 0.07386637986637652, 0.3089337979930199, 0.16481183738109062, 0.10741724391965281, -0.21057443628378678, 0.1904455698201094, -0.0038239767573858526]
|
1,803.04287
|
Fixed points in smooth Calogero-Moser spaces
|
We prove that every irreducible component of the fixed point variety under
the action of $d$-th roots of unity in a smooth Caloger-Moser space is
isomorphic to a Calogero-Moser space associated with another reflection group.
|
math.RT math.AG
|
we prove that every irreducible component of the fixed point variety under the action of dth roots of unity in a smooth calogermoser space is isomorphic to a calogeromoser space associated with another reflection group
|
[['we', 'prove', 'that', 'every', 'irreducible', 'component', 'of', 'the', 'fixed', 'point', 'variety', 'under', 'the', 'action', 'of', 'dth', 'roots', 'of', 'unity', 'in', 'a', 'smooth', 'calogermoser', 'space', 'is', 'isomorphic', 'to', 'a', 'calogeromoser', 'space', 'associated', 'with', 'another', 'reflection', 'group']]
|
[-0.23320316784083844, 0.08510984032680946, -0.13450082591069595, -0.042747683545374976, -0.12375133368186653, -0.1265607724498425, -0.014263367812548364, 0.33395614964621406, -0.3567355830754553, -0.09105431778090341, 0.11021418938346739, -0.27911369624946797, -0.1582246274953442, 0.18411725744871157, -0.12174329457006285, -0.05668407433799335, 0.05622199824345964, 0.17302444462797473, -0.12692911041501378, -0.248730284933533, 0.4328777138675962, -0.06998909755742976, 0.19754463263920374, -0.03343852099330564, 0.21120784426374095, 0.04330385308712721, 0.02984731714906437, -0.03835451845245968, -0.07309529657047409, 0.10845946081514869, 0.30359628639583075, 0.05470651748057987, 0.21842521650251, -0.29948461040704777, -0.15066555365920067, 0.2872002438775131, 0.12453091993229463, -0.05705769421266658, -0.013780730250956757, -0.21353189262694547, 0.1081514263259513, -0.20307566443724293, -0.24503744202000755, -0.006630175055137702, 0.06665815285273961, -0.0037512574877057755, -0.24677126349083015, -0.04091262330434152, 0.05873632316610643, 0.14161187264003924, -0.07921932736145598, -0.08201372316107154, -0.1078822878322431, 0.08978512851255281, -0.028484645931582366, 0.08643951775240047, 0.10752692090713285, -0.10432015558305596, -0.11328594764428479, 0.47152820974588394, -0.06065621764532157, -0.2689907012241227, 0.1514467941331012, -0.23783907014876604, -0.16950078822140183, 0.2361755035551531, 0.08790122308169625, 0.07727777822209256, 0.022685921804181167, 0.197934510239533, -0.15456041661756378, 0.10885285027740922, 0.07004609376724277, -0.055413294729909725, 0.13291621149650643, 0.05911856251103537, 0.12601354228765038, 0.14383516891726425, 0.011805906171710895, -0.02874115768021771, -0.3895359096782548, -0.2062039877953274, -0.1514656030972089, 0.12823176897530045, -0.14142089411616326, -0.16553027661783354, 0.3661470267655594, 0.06785979736596345, 0.21263872274596776, 0.10095763214464698, 0.22050282140927654, 0.12414470382167825, 0.06684361467404025, 0.06026507568198473, 0.061298730171152525, 0.18078773452767305, -0.11343469410868627, -0.1676856564690492, -0.026614982674696617, 0.20485267736283796]
|
1,803.04288
|
Structural changes in the hot Algol OGLE-LMC-DPV-097 and its disk
related to its long-cycle
|
Double Periodic Variables (DPVs) are hot Algols showing a long photometric
cycle of uncertain origin. We report the discovery of changes in the orbital
light curve of OGLE-LMC-DPV-097 which depend on the phase of its long
photometric cycle. During the ascending branch of the long-cycle the brightness
at the first quadrature is larger than during the second quadrature, during the
maximum of the long-cycle the brightness is basically the same at both
quadratures, during the descending branch the brightness at the second
quadrature is larger than during the first quadrature and during the minimum of
the long-cycle the secondary minimum disappears. We model the light curve at
different phases of the long-cycle and find that the data are consistent with
changes in the properties of the accretion disk and two disk spots. The disk's
size and temperature change with the long-cycle period. We find a smaller and
hotter disk at minimum and larger and cooler disk at maximum. The spot
temperatures, locations and angular sizes also show variability during the
long-cycle.
|
astro-ph.SR
|
double periodic variables dpvs are hot algols showing a long photometric cycle of uncertain origin we report the discovery of changes in the orbital light curve of oglelmcdpv097 which depend on the phase of its long photometric cycle during the ascending branch of the longcycle the brightness at the first quadrature is larger than during the second quadrature during the maximum of the longcycle the brightness is basically the same at both quadratures during the descending branch the brightness at the second quadrature is larger than during the first quadrature and during the minimum of the longcycle the secondary minimum disappears we model the light curve at different phases of the longcycle and find that the data are consistent with changes in the properties of the accretion disk and two disk spots the disks size and temperature change with the longcycle period we find a smaller and hotter disk at minimum and larger and cooler disk at maximum the spot temperatures locations and angular sizes also show variability during the longcycle
|
[['double', 'periodic', 'variables', 'dpvs', 'are', 'hot', 'algols', 'showing', 'a', 'long', 'photometric', 'cycle', 'of', 'uncertain', 'origin', 'we', 'report', 'the', 'discovery', 'of', 'changes', 'in', 'the', 'orbital', 'light', 'curve', 'of', 'oglelmcdpv097', 'which', 'depend', 'on', 'the', 'phase', 'of', 'its', 'long', 'photometric', 'cycle', 'during', 'the', 'ascending', 'branch', 'of', 'the', 'longcycle', 'the', 'brightness', 'at', 'the', 'first', 'quadrature', 'is', 'larger', 'than', 'during', 'the', 'second', 'quadrature', 'during', 'the', 'maximum', 'of', 'the', 'longcycle', 'the', 'brightness', 'is', 'basically', 'the', 'same', 'at', 'both', 'quadratures', 'during', 'the', 'descending', 'branch', 'the', 'brightness', 'at', 'the', 'second', 'quadrature', 'is', 'larger', 'than', 'during', 'the', 'first', 'quadrature', 'and', 'during', 'the', 'minimum', 'of', 'the', 'longcycle', 'the', 'secondary', 'minimum', 'disappears', 'we', 'model', 'the', 'light', 'curve', 'at', 'different', 'phases', 'of', 'the', 'longcycle', 'and', 'find', 'that', 'the', 'data', 'are', 'consistent', 'with', 'changes', 'in', 'the', 'properties', 'of', 'the', 'accretion', 'disk', 'and', 'two', 'disk', 'spots', 'the', 'disks', 'size', 'and', 'temperature', 'change', 'with', 'the', 'longcycle', 'period', 'we', 'find', 'a', 'smaller', 'and', 'hotter', 'disk', 'at', 'minimum', 'and', 'larger', 'and', 'cooler', 'disk', 'at', 'maximum', 'the', 'spot', 'temperatures', 'locations', 'and', 'angular', 'sizes', 'also', 'show', 'variability', 'during', 'the', 'longcycle']]
|
[-0.13279977610663457, 0.20021635455024592, -0.0881485787275083, 0.03890405424856855, -0.04740146053954959, -0.06075114406480947, 0.08867629082079101, 0.38048321455854045, -0.23861224060426192, -0.31727900635588036, 0.15251208245069445, -0.27901623319177066, -0.050925806998095464, 0.21076940330813693, -0.07310170373495888, -0.006124000813168309, 0.07154779891647836, 0.03539232314831358, -0.10545208254402763, -0.26368907366413624, 0.258326836183722, 0.0540355825687156, 0.19302951383596176, -0.0040437785771620625, 0.066311493470087, -0.024223911014440304, -0.038530546523500506, -0.06879220283316338, -0.12827217440443586, 0.023220836271973574, 0.12971757412203314, 0.06544452659950098, 0.20529106373296063, -0.3924280979944503, -0.19459892652641214, 0.10912186205387116, 0.1253473752986311, 0.058640223414883674, 0.053757818949901885, -0.1619827526196947, 0.07177695143310463, -0.11309492298237542, -0.15360109273563413, 0.07469719769980977, 0.08536156682735857, 0.03143539903137614, -0.2184575717731872, 0.10727205669818966, 0.05217869908220189, 0.13169099341201432, -0.07797123668236, -0.1259177276645513, -0.13004330991329077, 0.08576936712625491, 0.05404966471456539, 0.040336844623636674, 0.11140063258764499, -0.10665466054616606, -0.020602309962679796, 0.33934341172194654, -0.08798074810303447, 0.007446188238613745, 0.15242612097028863, -0.24630640150631627, -0.11763826552778482, 0.20422435068278846, 0.14577755210921167, 0.13831098351134535, -0.08862044199862901, -0.039653456936973856, 0.03299495614756939, 0.19069712461684557, 0.10000329038046081, 0.04586469059645691, 0.332849469737095, 0.1286538336521891, 0.0621037549996639, 0.17504836560076323, -0.2366823359598022, -0.10561367623946245, -0.29019152734818976, -0.091083165151341, -0.1699876977432081, -0.05049759953912786, -0.1613031411454465, -0.14376362751183264, 0.44379752770011477, 0.10667551358928903, 0.22266145784900906, 0.04772642385762404, 0.3264211561613004, 0.13708065302823397, 0.08151122686180957, 0.14514443011516157, 0.30552048015490396, 0.11201233050703784, 0.13385891994625768, -0.31769399842802054, 0.10473510488210355, 0.007125278677353087]
|
1,803.04289
|
Derived categories of character sheaves
|
We give a block decomposition of the dg category of character sheaves on a
simple and simply-connected complex reductive group $G$, similar to the one in
generalized Springer correspondence. As a corollary, we identify the category
of character sheaves on $G$ as the category of quasi-coherent sheaves on an
explicitly defined derived stack $\widehat{G}$.
|
math.RT
|
we give a block decomposition of the dg category of character sheaves on a simple and simplyconnected complex reductive group g similar to the one in generalized springer correspondence as a corollary we identify the category of character sheaves on g as the category of quasicoherent sheaves on an explicitly defined derived stack widehatg
|
[['we', 'give', 'a', 'block', 'decomposition', 'of', 'the', 'dg', 'category', 'of', 'character', 'sheaves', 'on', 'a', 'simple', 'and', 'simplyconnected', 'complex', 'reductive', 'group', 'g', 'similar', 'to', 'the', 'one', 'in', 'generalized', 'springer', 'correspondence', 'as', 'a', 'corollary', 'we', 'identify', 'the', 'category', 'of', 'character', 'sheaves', 'on', 'g', 'as', 'the', 'category', 'of', 'quasicoherent', 'sheaves', 'on', 'an', 'explicitly', 'defined', 'derived', 'stack', 'widehatg']]
|
[-0.19886291023619748, -0.06517363324760313, -0.13839261575291553, 0.07074119531790968, -0.15277117977556945, -0.1263876359789046, -0.004809406551497954, 0.3667007178344108, -0.43989098475625116, -0.1652713998703769, 0.07708751469531476, -0.13459900112960627, -0.14075579220015141, 0.21175622122569215, -0.2479940354651599, -0.16474369685682985, 0.059381075621651555, 0.16042419958480256, -0.039328670786710936, -0.2564106618778573, 0.4916561998392421, -0.06978219258814568, 0.3208551127808513, 0.03958475746697298, 0.13539551702086572, 0.03892306822429722, 0.008052121295973106, -0.043085571421586255, -0.11701519594363938, 0.1448671925355922, 0.39043630440546956, -0.009264666026596117, 0.13242757177903075, -0.39642810435206804, -0.10179474300929103, 0.1538857068280103, 0.11621423204498435, 0.013193448375979508, 0.017698447308416857, -0.32883395854797626, 0.09957855282765296, -0.27340341949214536, -0.08097101238349246, -0.04745696930007802, 0.11314030219283369, -0.00809177482949087, -0.1857623496023869, -0.05264282828903998, 0.023652947197357815, 0.14457245326290527, -0.11922286406021428, -0.08579290296054548, -0.12562994550292692, 0.07864572181090436, -0.1256152413164576, 0.04763165988993866, 0.11822060759489735, -0.11488107868246045, -0.11309760928054823, 0.4138392998871428, -0.1498116261187803, -0.2444144438745247, 0.1454445389573704, -0.07906403665051416, -0.13511498721695883, 0.09716732421441486, 0.06578956849666105, 0.2450163312152856, 0.08539798398743625, 0.15202673443450798, -0.21576555814869977, 0.06041317633180707, 0.07949602631507097, 0.010201391281077155, 0.08703977426652003, 0.14049085383130996, 0.026365573448991333, 0.0960884087253362, 0.0026915722862920826, 0.026017144874290184, -0.3951252657506201, -0.205132152436784, -0.09699835328178273, 0.20311426416177442, -0.11024052269419406, -0.22708059495521915, 0.4683009001115958, 0.046171443157449914, 0.20096629714869238, 0.1688565033212028, 0.18235804175061207, 0.01598929839329449, 0.03894692764583009, 0.002362102166646057, 0.0781571113469976, 0.31786383705696575, -0.12518057541887243, -0.057674027151531644, -0.045514841839947084, 0.31317249973546024]
|
1,803.0429
|
Interplay between polydispersity, inelasticity, and roughness in the
freely cooling regime of hard-disk granular gases
|
A polydisperse granular gas made of inelastic and rough hard disks is
considered. Focus is laid on the kinetic-theory derivation of the partial
energy production rates and the total cooling rate as functions of the partial
densities and temperatures (both translational and rotational) and of the
parameters of the mixture (masses, diameters, moments of inertia, and mutual
coefficients of normal and tangential restitution). The results are applied to
the homogeneous cooling state of the system and the associated nonequipartition
of energy among the different components and degrees of freedom. It is found
that disks typically present a stronger rotational-translational
nonequipartition but a weaker component-component nonequipartition than
spheres. A noteworthy "mimicry" effect is unveiled, according to which a
polydisperse gas of disks having common values of the coefficient of
restitution and of the reduced moment of inertia can be made indistinguishable
from a monodisperse gas in what concerns the degree of rotational-translational
energy nonequipartition. This effect requires the mass of a disk of component
$i$ to be approximately proportional to $2\sigma_i+\langle\sigma\rangle$, where
$\sigma_i$ is the diameter of the disk and $\langle\sigma\rangle$ is the mean
diameter.
|
cond-mat.soft cond-mat.stat-mech physics.flu-dyn
|
a polydisperse granular gas made of inelastic and rough hard disks is considered focus is laid on the kinetictheory derivation of the partial energy production rates and the total cooling rate as functions of the partial densities and temperatures both translational and rotational and of the parameters of the mixture masses diameters moments of inertia and mutual coefficients of normal and tangential restitution the results are applied to the homogeneous cooling state of the system and the associated nonequipartition of energy among the different components and degrees of freedom it is found that disks typically present a stronger rotationaltranslational nonequipartition but a weaker componentcomponent nonequipartition than spheres a noteworthy mimicry effect is unveiled according to which a polydisperse gas of disks having common values of the coefficient of restitution and of the reduced moment of inertia can be made indistinguishable from a monodisperse gas in what concerns the degree of rotationaltranslational energy nonequipartition this effect requires the mass of a disk of component i to be approximately proportional to 2sigma_ilanglesigmarangle where sigma_i is the diameter of the disk and langlesigmarangle is the mean diameter
|
[['a', 'polydisperse', 'granular', 'gas', 'made', 'of', 'inelastic', 'and', 'rough', 'hard', 'disks', 'is', 'considered', 'focus', 'is', 'laid', 'on', 'the', 'kinetictheory', 'derivation', 'of', 'the', 'partial', 'energy', 'production', 'rates', 'and', 'the', 'total', 'cooling', 'rate', 'as', 'functions', 'of', 'the', 'partial', 'densities', 'and', 'temperatures', 'both', 'translational', 'and', 'rotational', 'and', 'of', 'the', 'parameters', 'of', 'the', 'mixture', 'masses', 'diameters', 'moments', 'of', 'inertia', 'and', 'mutual', 'coefficients', 'of', 'normal', 'and', 'tangential', 'restitution', 'the', 'results', 'are', 'applied', 'to', 'the', 'homogeneous', 'cooling', 'state', 'of', 'the', 'system', 'and', 'the', 'associated', 'nonequipartition', 'of', 'energy', 'among', 'the', 'different', 'components', 'and', 'degrees', 'of', 'freedom', 'it', 'is', 'found', 'that', 'disks', 'typically', 'present', 'a', 'stronger', 'rotationaltranslational', 'nonequipartition', 'but', 'a', 'weaker', 'componentcomponent', 'nonequipartition', 'than', 'spheres', 'a', 'noteworthy', 'mimicry', 'effect', 'is', 'unveiled', 'according', 'to', 'which', 'a', 'polydisperse', 'gas', 'of', 'disks', 'having', 'common', 'values', 'of', 'the', 'coefficient', 'of', 'restitution', 'and', 'of', 'the', 'reduced', 'moment', 'of', 'inertia', 'can', 'be', 'made', 'indistinguishable', 'from', 'a', 'monodisperse', 'gas', 'in', 'what', 'concerns', 'the', 'degree', 'of', 'rotationaltranslational', 'energy', 'nonequipartition', 'this', 'effect', 'requires', 'the', 'mass', 'of', 'a', 'disk', 'of', 'component', 'i', 'to', 'be', 'approximately', 'proportional', 'to', '2sigma_ilanglesigmarangle', 'where', 'sigma_i', 'is', 'the', 'diameter', 'of', 'the', 'disk', 'and', 'langlesigmarangle', 'is', 'the', 'mean', 'diameter']]
|
[-0.1322114331299787, 0.19338420974627996, -0.07153855017539891, 0.03470774288199699, -0.03966255815300558, -0.07415684841440193, 0.005354665545682719, 0.3350889427781842, -0.2445553590282593, -0.289952730652518, 0.06294149369676853, -0.27301919610485187, -0.026458155602385586, 0.16576319838014358, -0.008751412032294896, 0.022120605027869184, 0.007591892968975826, 0.020245416245645853, -0.05061472453379103, -0.23609136734260144, 0.3163310695634029, 0.06979947625710578, 0.20869024447933004, 0.07200418766984552, 0.12776703436623563, -0.03926415810013538, -0.002936774759571283, 0.06464688926720115, -0.18303386923994716, 0.09359127365226684, 0.16559659861601317, 0.019461975517365466, 0.20824554403425083, -0.3930363353497891, -0.19301567767531827, 0.08724419922941457, 0.10232148777212498, 0.050251666558164446, 0.016349517252900035, -0.19624206797951566, 0.025190973335206715, -0.17040415730010425, -0.1694819124384814, -0.013272546625767764, 0.07138346586181976, 0.059638040741537134, -0.2667914054735185, 0.15706217680433457, 0.10199786674942575, 0.07269052827377691, -0.07516705902845977, -0.17149075364200195, -0.07570865109900606, 0.08695273904595524, 0.0887251153132868, -0.012575399734407336, 0.19119394457803726, -0.1615445209608879, -0.0021125107931976137, 0.4196811925599372, -0.03231793533856175, -0.18603392770759516, 0.22355835140774866, -0.17843883118469392, -0.06710229052619619, 0.19343343536001067, 0.17122995546858394, 0.12364024301775946, -0.145763706802237, 0.00462734432549441, -0.027382227617756022, 0.20602156209969216, 0.06756603533074587, 0.007317195910638055, 0.23548747418489266, 0.1335932019442975, 0.04593026521387811, 0.1481190631575473, -0.12364410818458514, -0.10500406970111346, -0.24604086307706413, -0.1895298012980045, -0.19108321055754568, 0.05436341216977031, -0.11417458258682138, -0.13575523282634094, 0.3184265606463529, 0.08108740102098026, 0.22241522291541524, 0.04945907986449119, 0.2973798399709247, 0.12430620224632138, 0.0736166626051232, 0.07645224330685828, 0.28499904421291183, 0.20019175275996492, 0.057114176852577414, -0.25216740055091597, 0.09712744849877289, 0.024767633341380733]
|
1,803.04291
|
Entity-Aware Language Model as an Unsupervised Reranker
|
In language modeling, it is difficult to incorporate entity relationships
from a knowledge-base. One solution is to use a reranker trained with global
features, in which global features are derived from n-best lists. However,
training such a reranker requires manually annotated n-best lists, which is
expensive to obtain. We propose a method based on the contrastive estimation
method that alleviates the need for such data. Experiments in the music domain
demonstrate that global features, as well as features extracted from an
external knowledge-base, can be incorporated into our reranker. Our final
model, a simple ensemble of a language model and reranker, achieves a 0.44\%
absolute word error rate improvement over an LSTM language model on the blind
test data.
|
cs.CL
|
in language modeling it is difficult to incorporate entity relationships from a knowledgebase one solution is to use a reranker trained with global features in which global features are derived from nbest lists however training such a reranker requires manually annotated nbest lists which is expensive to obtain we propose a method based on the contrastive estimation method that alleviates the need for such data experiments in the music domain demonstrate that global features as well as features extracted from an external knowledgebase can be incorporated into our reranker our final model a simple ensemble of a language model and reranker achieves a 044 absolute word error rate improvement over an lstm language model on the blind test data
|
[['in', 'language', 'modeling', 'it', 'is', 'difficult', 'to', 'incorporate', 'entity', 'relationships', 'from', 'a', 'knowledgebase', 'one', 'solution', 'is', 'to', 'use', 'a', 'reranker', 'trained', 'with', 'global', 'features', 'in', 'which', 'global', 'features', 'are', 'derived', 'from', 'nbest', 'lists', 'however', 'training', 'such', 'a', 'reranker', 'requires', 'manually', 'annotated', 'nbest', 'lists', 'which', 'is', 'expensive', 'to', 'obtain', 'we', 'propose', 'a', 'method', 'based', 'on', 'the', 'contrastive', 'estimation', 'method', 'that', 'alleviates', 'the', 'need', 'for', 'such', 'data', 'experiments', 'in', 'the', 'music', 'domain', 'demonstrate', 'that', 'global', 'features', 'as', 'well', 'as', 'features', 'extracted', 'from', 'an', 'external', 'knowledgebase', 'can', 'be', 'incorporated', 'into', 'our', 'reranker', 'our', 'final', 'model', 'a', 'simple', 'ensemble', 'of', 'a', 'language', 'model', 'and', 'reranker', 'achieves', 'a', '044', 'absolute', 'word', 'error', 'rate', 'improvement', 'over', 'an', 'lstm', 'language', 'model', 'on', 'the', 'blind', 'test', 'data']]
|
[0.005915680023677209, -0.03360118589949982, -0.08006560408506355, 0.11012712470182422, -0.13491216881059798, -0.16635245424812706, 0.07334297431726791, 0.43554935782772153, -0.28659120112845377, -0.3612921806600164, 0.08114588077223132, -0.3005373892569993, -0.12489207535042983, 0.20884316313831808, -0.10087051419462978, 0.05774007896998381, 0.16310679196661823, 0.08473907755453046, -0.05430520325899124, -0.23374022468298422, 0.2689242790914884, 0.04817531859705679, 0.31843344017691094, -0.019194021926676276, 0.1512457171725031, -0.06029927909976857, -0.03099749078817603, -0.023339855001394114, -0.02692855589770215, 0.14913375556719402, 0.2917585372376968, 0.23613688949996434, 0.29996127087403746, -0.38963153592835204, -0.22434427087516093, 0.06664641068450042, 0.12960687232156823, 0.15743877201442832, -0.02812523748862612, -0.34516289278457896, 0.09914466823909056, -0.17563461430934296, 0.05399680214331431, -0.14630330943291178, -0.03154263020093952, -0.010539096722402806, -0.3379182169466287, 0.06059529527849635, 0.09062778582393403, 0.0872886833820899, -0.05754162942865441, -0.10484039723215734, -0.0013155741245337144, 0.16276666529852302, 0.024615188953936287, 0.0979820875521405, 0.11232172812436934, -0.13876230967771105, -0.13013529077860989, 0.4017929695390102, -0.11764847672693118, -0.2521138107834556, 0.15839030166614426, 0.01885645982159787, -0.13002399086341762, 0.09886873186323322, 0.20010755720603116, 0.10016120592241778, -0.18865631863537455, 0.009150522557075503, -0.0665241210455341, 0.28645511115548994, 0.021850816257877135, -0.034479352459702794, 0.2082229162294402, 0.2507461571142453, -0.002616542947142064, 0.13755722155211447, -0.11634051592525549, -0.03325235900887828, -0.25079955694367406, -0.10507177544303802, -0.19384602583287394, -0.023220499421806394, -0.0932319963960116, -0.1650906699110887, 0.3837194400624286, 0.23754331726627817, 0.23796159338926068, 0.11281624080871522, 0.317205390994664, 0.030825481452673924, 0.15455105655020526, 0.07365376161442709, 0.13752719383498951, -0.03287312596793748, 0.08593216400051552, -0.13361560136760672, 0.09860236326451688, 0.08760044482896621]
|
1,803.04292
|
Geodabs: Trajectory Indexing Meets Fingerprinting at Scale
|
Finding trajectories and discovering motifs that are similar in large
datasets is a central problem for a wide range of applications. Solutions
addressing this problem usually rely on spatial indexing and on the computation
of a similarity measure in polynomial time. Although effective in the context
of sparse trajectory datasets, this approach is too expensive in the context of
dense datasets, where many trajectories potentially match with a given query.
In this paper, we apply fingerprinting, a copy-detection mechanism used in the
context of textual data, to trajectories. To this end, we fingerprint
trajectories with geodabs, a construction based on geohash aimed at trajectory
fingerprinting. We demonstrate that by relying on the properties of a space
filling curve geodabs can be used to build sharded inverted indexes. We show
how normalization affects precision and recall, two key measures in information
retrieval. We then demonstrate that the probabilistic nature of fingerprinting
has a marginal effect on the quality of the results. Finally, we evaluate our
method in terms of performances and show that, in contrast with existing
methods, it is not affected by the density of the trajectory dataset and that
it can be efficiently distributed.
|
cs.DS cs.DB cs.DC cs.IR
|
finding trajectories and discovering motifs that are similar in large datasets is a central problem for a wide range of applications solutions addressing this problem usually rely on spatial indexing and on the computation of a similarity measure in polynomial time although effective in the context of sparse trajectory datasets this approach is too expensive in the context of dense datasets where many trajectories potentially match with a given query in this paper we apply fingerprinting a copydetection mechanism used in the context of textual data to trajectories to this end we fingerprint trajectories with geodabs a construction based on geohash aimed at trajectory fingerprinting we demonstrate that by relying on the properties of a space filling curve geodabs can be used to build sharded inverted indexes we show how normalization affects precision and recall two key measures in information retrieval we then demonstrate that the probabilistic nature of fingerprinting has a marginal effect on the quality of the results finally we evaluate our method in terms of performances and show that in contrast with existing methods it is not affected by the density of the trajectory dataset and that it can be efficiently distributed
|
[['finding', 'trajectories', 'and', 'discovering', 'motifs', 'that', 'are', 'similar', 'in', 'large', 'datasets', 'is', 'a', 'central', 'problem', 'for', 'a', 'wide', 'range', 'of', 'applications', 'solutions', 'addressing', 'this', 'problem', 'usually', 'rely', 'on', 'spatial', 'indexing', 'and', 'on', 'the', 'computation', 'of', 'a', 'similarity', 'measure', 'in', 'polynomial', 'time', 'although', 'effective', 'in', 'the', 'context', 'of', 'sparse', 'trajectory', 'datasets', 'this', 'approach', 'is', 'too', 'expensive', 'in', 'the', 'context', 'of', 'dense', 'datasets', 'where', 'many', 'trajectories', 'potentially', 'match', 'with', 'a', 'given', 'query', 'in', 'this', 'paper', 'we', 'apply', 'fingerprinting', 'a', 'copydetection', 'mechanism', 'used', 'in', 'the', 'context', 'of', 'textual', 'data', 'to', 'trajectories', 'to', 'this', 'end', 'we', 'fingerprint', 'trajectories', 'with', 'geodabs', 'a', 'construction', 'based', 'on', 'geohash', 'aimed', 'at', 'trajectory', 'fingerprinting', 'we', 'demonstrate', 'that', 'by', 'relying', 'on', 'the', 'properties', 'of', 'a', 'space', 'filling', 'curve', 'geodabs', 'can', 'be', 'used', 'to', 'build', 'sharded', 'inverted', 'indexes', 'we', 'show', 'how', 'normalization', 'affects', 'precision', 'and', 'recall', 'two', 'key', 'measures', 'in', 'information', 'retrieval', 'we', 'then', 'demonstrate', 'that', 'the', 'probabilistic', 'nature', 'of', 'fingerprinting', 'has', 'a', 'marginal', 'effect', 'on', 'the', 'quality', 'of', 'the', 'results', 'finally', 'we', 'evaluate', 'our', 'method', 'in', 'terms', 'of', 'performances', 'and', 'show', 'that', 'in', 'contrast', 'with', 'existing', 'methods', 'it', 'is', 'not', 'affected', 'by', 'the', 'density', 'of', 'the', 'trajectory', 'dataset', 'and', 'that', 'it', 'can', 'be', 'efficiently', 'distributed']]
|
[-0.08768026402685791, 0.028363497515480656, -0.11361112456021753, 0.06338091280425336, -0.05696444861253743, -0.10106507486004072, 0.06149588635950446, 0.40425868512344704, -0.26150909973754705, -0.3324519975819082, 0.12072658625947952, -0.2562958728376543, -0.18444581787722805, 0.23595908647985198, -0.1178510774757342, 0.06281859974387771, 0.10370418657051535, 0.05998719130972555, -0.06735399607835764, -0.25732660896513454, 0.33558538355464407, 0.04032757301077557, 0.3129326772323111, 0.05361205588875843, 0.0855580038169137, -0.004097733301023254, -0.037581116306682816, 0.04879448294362495, -0.0921507927702881, 0.17323241498039957, 0.26817626204380457, 0.18589570859512605, 0.2730664337335232, -0.3796788136921047, -0.20443122212706535, 0.11555747142362331, 0.1620961619234246, 0.11349367598412148, -0.07242573692625835, -0.287887082095646, 0.10338562625596144, -0.12494758120252906, -0.053415564073172085, -0.12448639657426004, -0.005205244410414404, 0.02845057892712551, -0.26534747810364934, 0.05485975140785134, 0.020686444933138166, 0.040168873866302114, -0.030824558232173633, -0.056793476455065196, 0.048664664426420735, 0.14255850124512412, 0.026157163010187407, 0.025375141376571264, 0.11400593478174414, -0.142570957809653, -0.13872284774697619, 0.4002112608383565, -0.08871674829939973, -0.23591015490220948, 0.1928757862575973, -0.11239272089369479, -0.16742097615254656, 0.0980992811358495, 0.21412486387998797, 0.1522786022251239, -0.14248424741526833, 0.06569541010837081, -0.046381243114713776, 0.20297339542109208, 0.03854436319124943, 0.02643336564869969, 0.1863472570257727, 0.21212811858398103, 0.054280229537046885, 0.12548819754253296, -0.1050636588878812, -0.08562735514108984, -0.22578156976184496, -0.139835653812194, -0.20474179171287687, -0.03288020162403882, -0.08282749590178658, -0.14578300475113792, 0.4094824368924795, 0.2486406979126817, 0.23802960100389706, 0.05771536621129295, 0.3212023119510074, 0.06256219170078718, 0.07107723882957846, 0.09365431775222532, 0.18731079928905578, 0.010119776326367477, 0.09459102680072344, -0.18874056528572206, 0.09275757543946384, 0.049439254523652686]
|
1,803.04293
|
Uniform boundedness principle for non-linear operators on cones of
functions
|
We prove an uniform boundedness principle for the Lipschitz seminorm of
continuous, monotone, positively homogeneous and subadditive mappings on
suitable cones of functions. The result is applicable to several classes of
classically non-linear operators.
|
math.FA
|
we prove an uniform boundedness principle for the lipschitz seminorm of continuous monotone positively homogeneous and subadditive mappings on suitable cones of functions the result is applicable to several classes of classically nonlinear operators
|
[['we', 'prove', 'an', 'uniform', 'boundedness', 'principle', 'for', 'the', 'lipschitz', 'seminorm', 'of', 'continuous', 'monotone', 'positively', 'homogeneous', 'and', 'subadditive', 'mappings', 'on', 'suitable', 'cones', 'of', 'functions', 'the', 'result', 'is', 'applicable', 'to', 'several', 'classes', 'of', 'classically', 'nonlinear', 'operators']]
|
[-0.14584251331603704, 0.1227788368881139, -0.007117123137611677, 0.1557956845191417, -0.058700554723413116, -0.1362389572622145, -0.019154977149275297, 0.4048875949400313, -0.39137129343169574, -0.10101490572560579, 0.10518012802554842, -0.2423398082747179, -0.11554073404370095, 0.2732415430056041, -0.14038378652185202, 0.15502437620478518, -0.01493992388029309, -0.03547250704072854, -0.11291913601898533, -0.3042246498277082, 0.4760213652077843, -0.0882038706639672, 0.24245099890429309, 0.1351186548743178, 0.11148630209294531, 0.04272976260194007, -0.0518110138227177, 0.03416542596567203, -0.17131201128530152, 0.15854426667861202, 0.2377461605321835, 0.1202703780727461, 0.32715416327118874, -0.369305690695696, -0.16888831449015176, 0.22422024335109575, -0.0012389227802700857, -0.04325030390721034, -0.02818427820731064, -0.29966770506956997, 0.04838972148375914, -0.049544146667946785, -0.21017762302311466, -0.129169845734449, -0.002315901171909097, 0.11942087938351666, -0.37182275392115116, 0.07943326595020206, 0.19270954157828407, 0.034660786992925054, -0.1665960133404416, -0.04078223404255422, -0.035684723283766824, 0.03820423239513355, 0.008733389851198915, 0.06635920650681809, 0.09494101060280467, -0.02534143517122549, -0.13387267083367882, 0.3046954376896953, -0.08653197875794243, -0.32290089974070296, 0.18437633720938773, -0.14388712596915224, -0.1403968008235097, 0.07890425885424894, 0.1480713883853134, 0.26479702596278754, -0.15578359017586885, 0.1887461383097723, -0.1426776824929916, 0.12069382858188714, 0.08137614342986661, 0.07944517327910837, 0.04404656857471256, 0.029600855223286676, 0.31498650932574973, 0.1918632480151513, 0.11416188699385042, -0.08772382500362308, -0.36383255297208533, -0.14117640812936075, -0.14404923172996326, 0.0911300594041891, -0.14357524869153757, -0.2697044166133684, 0.3500512861372793, 0.009174427017569542, 0.11454771313925877, 0.20391477178782225, 0.16477198526263237, 0.15848335070425973, 0.014469409964102157, 0.031536170514300466, 0.18894600999705932, 0.2009516619693707, 0.05000690943287576, -0.0897753270520993, 0.039128418012029105, 0.19761334704783032]
|
1,803.04294
|
Imprints of relativistic effects on the asymmetry of the halo
cross-correlation function: from linear to non-linear scales
|
The apparent distribution of large-scale structures in the universe is
sensitive to the velocity/potential of the sources as well as the potential
along the line-of-sight through the mapping from real space to redshift space
(redshift-space distortions, RSD). Since odd multipoles of the halo
cross-correlation function vanish when considering standard Doppler RSD, the
dipole is a sensitive probe of relativistic and wide-angle effects. We build a
catalogue of ten million haloes (Milky-Way size to galaxy-cluster size) from
the full-sky light-cone of a new "RayGalGroupSims" N-body simulation which
covers a volume of ($2.625~h^{-1}$Gpc)$^3$ with $4096^3$ particles. Using
ray-tracing techniques, we find the null geodesics connecting all the sources
to the observer. We then self-consistently derive all the relativistic
contributions (in the weak-field approximation) to RSD: Doppler, transverse
Doppler, gravitational, lensing and integrated Sachs-Wolfe. It allows us, for
the first time, to disentangle all contributions to the dipole from linear to
non-linear scales. At large scale, we recover the linear predictions dominated
by a contribution from the divergence of neighbouring line-of-sights. While the
linear theory remains a reasonable approximation of the velocity contribution
to the dipole at non-linear scales it fails to reproduce the potential
contribution below $30-60~h^{-1}$Mpc (depending on the halo mass). At scales
smaller than $\sim 10~h^{-1}$Mpc, the dipole is dominated by the asymmetry
caused by the gravitational redshift. The transition between the two regimes is
mass dependent as well. We also identify a new non-trivial contribution from
the non-linear coupling between potential and velocity terms.
|
astro-ph.CO gr-qc
|
the apparent distribution of largescale structures in the universe is sensitive to the velocitypotential of the sources as well as the potential along the lineofsight through the mapping from real space to redshift space redshiftspace distortions rsd since odd multipoles of the halo crosscorrelation function vanish when considering standard doppler rsd the dipole is a sensitive probe of relativistic and wideangle effects we build a catalogue of ten million haloes milkyway size to galaxycluster size from the fullsky lightcone of a new raygalgroupsims nbody simulation which covers a volume of 2625h1gpc3 with 40963 particles using raytracing techniques we find the null geodesics connecting all the sources to the observer we then selfconsistently derive all the relativistic contributions in the weakfield approximation to rsd doppler transverse doppler gravitational lensing and integrated sachswolfe it allows us for the first time to disentangle all contributions to the dipole from linear to nonlinear scales at large scale we recover the linear predictions dominated by a contribution from the divergence of neighbouring lineofsights while the linear theory remains a reasonable approximation of the velocity contribution to the dipole at nonlinear scales it fails to reproduce the potential contribution below 3060h1mpc depending on the halo mass at scales smaller than sim 10h1mpc the dipole is dominated by the asymmetry caused by the gravitational redshift the transition between the two regimes is mass dependent as well we also identify a new nontrivial contribution from the nonlinear coupling between potential and velocity terms
|
[['the', 'apparent', 'distribution', 'of', 'largescale', 'structures', 'in', 'the', 'universe', 'is', 'sensitive', 'to', 'the', 'velocitypotential', 'of', 'the', 'sources', 'as', 'well', 'as', 'the', 'potential', 'along', 'the', 'lineofsight', 'through', 'the', 'mapping', 'from', 'real', 'space', 'to', 'redshift', 'space', 'redshiftspace', 'distortions', 'rsd', 'since', 'odd', 'multipoles', 'of', 'the', 'halo', 'crosscorrelation', 'function', 'vanish', 'when', 'considering', 'standard', 'doppler', 'rsd', 'the', 'dipole', 'is', 'a', 'sensitive', 'probe', 'of', 'relativistic', 'and', 'wideangle', 'effects', 'we', 'build', 'a', 'catalogue', 'of', 'ten', 'million', 'haloes', 'milkyway', 'size', 'to', 'galaxycluster', 'size', 'from', 'the', 'fullsky', 'lightcone', 'of', 'a', 'new', 'raygalgroupsims', 'nbody', 'simulation', 'which', 'covers', 'a', 'volume', 'of', '2625h1gpc3', 'with', '40963', 'particles', 'using', 'raytracing', 'techniques', 'we', 'find', 'the', 'null', 'geodesics', 'connecting', 'all', 'the', 'sources', 'to', 'the', 'observer', 'we', 'then', 'selfconsistently', 'derive', 'all', 'the', 'relativistic', 'contributions', 'in', 'the', 'weakfield', 'approximation', 'to', 'rsd', 'doppler', 'transverse', 'doppler', 'gravitational', 'lensing', 'and', 'integrated', 'sachswolfe', 'it', 'allows', 'us', 'for', 'the', 'first', 'time', 'to', 'disentangle', 'all', 'contributions', 'to', 'the', 'dipole', 'from', 'linear', 'to', 'nonlinear', 'scales', 'at', 'large', 'scale', 'we', 'recover', 'the', 'linear', 'predictions', 'dominated', 'by', 'a', 'contribution', 'from', 'the', 'divergence', 'of', 'neighbouring', 'lineofsights', 'while', 'the', 'linear', 'theory', 'remains', 'a', 'reasonable', 'approximation', 'of', 'the', 'velocity', 'contribution', 'to', 'the', 'dipole', 'at', 'nonlinear', 'scales', 'it', 'fails', 'to', 'reproduce', 'the', 'potential', 'contribution', 'below', '3060h1mpc', 'depending', 'on', 'the', 'halo', 'mass', 'at', 'scales', 'smaller', 'than', 'sim', '10h1mpc', 'the', 'dipole', 'is', 'dominated', 'by', 'the', 'asymmetry', 'caused', 'by', 'the', 'gravitational', 'redshift', 'the', 'transition', 'between', 'the', 'two', 'regimes', 'is', 'mass', 'dependent', 'as', 'well', 'we', 'also', 'identify', 'a', 'new', 'nontrivial', 'contribution', 'from', 'the', 'nonlinear', 'coupling', 'between', 'potential', 'and', 'velocity', 'terms']]
|
[-0.08791272711655325, 0.11913190561554525, -0.07924702587202653, 0.12311836316881408, -0.1131934305626037, -0.03547771314490002, -0.015358781200075475, 0.33137243403475886, -0.25497467848299116, -0.310875527972494, 0.0035067533810569113, -0.3144358126925856, -0.058844965543846404, 0.20314272225753613, 0.06754813468360826, 0.014875173527114325, -0.014040239420834898, -0.03749334850600605, -0.07411627933344023, -0.20391997526407488, 0.3303445281695636, 0.11090383866959644, 0.22005065807626267, 0.013400325041710714, 0.12106879963683857, -0.019854650742274303, -0.09118346072067622, 0.0699359053389404, -0.12642487773694838, 0.030531036571795813, 0.1852722337290506, 0.07373005813584194, 0.2245624494022676, -0.36073062941047157, -0.18040613885326715, 0.08770610806859322, 0.15954719297203027, 0.15824596661822254, -0.013931809113003036, -0.2918116413614874, 0.04129462474803171, -0.1514601308125079, -0.1482603869974336, -0.023561285705255605, 0.013677847810274313, 0.020334863762250015, -0.2648127775702795, 0.16264684162040582, -0.004357369717649253, 0.008876773547996913, -0.053121881040192234, -0.08317828007535008, -0.028116263847505627, 0.10765790271277882, 0.06836822180631609, 0.06674848219778096, 0.15639682481265513, -0.11887621477223194, -0.035349206432261436, 0.44567221830491255, -0.1114933936530652, -0.13447026181619706, 0.13315229876782775, -0.2208983095262723, -0.12017628663288783, 0.1520651281428377, 0.2086516416377642, 0.08524534248815241, -0.1326889942378149, 0.08555202440417387, 0.0373051600830922, 0.19384379724275383, 0.07166347843171521, 0.025579988559581, 0.2613170558301932, 0.084647146479827, 0.07584258354719235, 0.0987723075882397, -0.18263099313721307, -0.05353707700683004, -0.31567890967592627, -0.06185360132785868, -0.17641434879479967, 0.05598955488694478, -0.14332922917680307, -0.15446547789822432, 0.38732545242129157, 0.1597199029395499, 0.21763715937203046, 0.09544602436762041, 0.3679405266730777, 0.09239309082194501, 0.1153197474643003, 0.07497788084818104, 0.3102728391267275, 0.16831071228404676, 0.07463972505799822, -0.2616163437290325, 0.008717320985468643, 0.01281720376573503]
|
1,803.04295
|
Weighted model spaces and Schmidt subspaces of Hankel operators
|
For a bounded Hankel matrix $\Gamma$, we describe the structure of the
Schmidt subspaces of $\Gamma$, namely the eigenspaces of $\Gamma^* \Gamma$
corresponding to non zero eigenvalues. We prove that these subspaces are in
correspondence with weighted model spaces in the Hardy space on the unit
circle. Here we use the term "weighted model space" to describe the range of an
isometric multiplier acting on a model space. Further, we obtain similar
results for Hankel operators acting in the Hardy space on the real line.
Finally, we give a streamlined proof of the Adamyan-Arov-Krein theorem using
the language of weighted model spaces.
|
math.CV math.FA
|
for a bounded hankel matrix gamma we describe the structure of the schmidt subspaces of gamma namely the eigenspaces of gamma gamma corresponding to non zero eigenvalues we prove that these subspaces are in correspondence with weighted model spaces in the hardy space on the unit circle here we use the term weighted model space to describe the range of an isometric multiplier acting on a model space further we obtain similar results for hankel operators acting in the hardy space on the real line finally we give a streamlined proof of the adamyanarovkrein theorem using the language of weighted model spaces
|
[['for', 'a', 'bounded', 'hankel', 'matrix', 'gamma', 'we', 'describe', 'the', 'structure', 'of', 'the', 'schmidt', 'subspaces', 'of', 'gamma', 'namely', 'the', 'eigenspaces', 'of', 'gamma', 'gamma', 'corresponding', 'to', 'non', 'zero', 'eigenvalues', 'we', 'prove', 'that', 'these', 'subspaces', 'are', 'in', 'correspondence', 'with', 'weighted', 'model', 'spaces', 'in', 'the', 'hardy', 'space', 'on', 'the', 'unit', 'circle', 'here', 'we', 'use', 'the', 'term', 'weighted', 'model', 'space', 'to', 'describe', 'the', 'range', 'of', 'an', 'isometric', 'multiplier', 'acting', 'on', 'a', 'model', 'space', 'further', 'we', 'obtain', 'similar', 'results', 'for', 'hankel', 'operators', 'acting', 'in', 'the', 'hardy', 'space', 'on', 'the', 'real', 'line', 'finally', 'we', 'give', 'a', 'streamlined', 'proof', 'of', 'the', 'adamyanarovkrein', 'theorem', 'using', 'the', 'language', 'of', 'weighted', 'model', 'spaces']]
|
[-0.09775501350853957, 0.09815598263958236, -0.06312059390121232, 0.09110963651362587, -0.07742170153834, -0.053256528913134746, 0.03567361146640763, 0.38272867443076536, -0.31137431778159796, -0.16964413413741425, 0.11203319404625754, -0.2908358553734918, -0.16013066523580574, 0.2146617832283179, -0.084858209458545, 0.023370808656966568, 0.05552150462936683, 0.08899005189738876, -0.1312946258318227, -0.22965522854378922, 0.44315352100952, -0.01345136237282799, 0.18907387542090945, 0.030249538657931136, 0.098683996993464, 0.035118189818390155, -0.0548176155334302, -0.06476447898004313, -0.1865650079029472, 0.16295950730358633, 0.19701114710301673, 0.11624968694020793, 0.24479833731254308, -0.3777432166332123, -0.16772596283779279, 0.22627483722274466, 0.11420475414899342, -0.039070509821541755, 0.0026868740222234207, -0.31634854269670504, 0.031211166788696076, -0.13886244663530412, -0.11996165073166291, -0.11623296087753832, -0.004527004015650235, 0.011925599439635727, -0.296301175216464, 0.0251557963452868, 0.10858167912445817, 0.04423310331014149, -0.16102893344884484, -0.10626740187324364, 0.012748910168952802, 0.09435438155653138, -0.031168846596105425, 0.03303066887618864, 0.07637338957968443, -0.02053644058897215, -0.11252916343601457, 0.3511074177245153, -0.08972488765835342, -0.281604377078075, 0.10847158094539362, -0.184320456734128, -0.13536456731768945, 0.05382152266946493, 0.18108595418287257, 0.11900718107490856, -0.03668623048796173, 0.19531976761908143, -0.13745631974226996, 0.10169274012065109, 0.061274662586476875, 0.03777181902014669, 0.06647964973258329, 0.1018629562036664, 0.14454685782502388, 0.15521396468530463, -0.04934206906467557, -0.04604010660470664, -0.37798915270204636, -0.20119839567946746, -0.20655306465649867, 0.052717658832632734, -0.14569597782603666, -0.22554626950409776, 0.3861380919777587, 0.059986122523197065, 0.23106269626284712, 0.12734528392662897, 0.19062722110938207, 0.11946966649745316, 0.034506206733959856, 0.03439125050242771, 0.15985653712870737, 0.1989890377986811, 0.05181006118472593, -0.15136186248056738, -0.06190592225860147, 0.23330203269870253]
|
1,803.04296
|
Quantization bias for digital correlators
|
In radio interferometry, the quantization process introduces a bias in the
magnitude and phase of the measured correlations which translates into errors
in the measurement of source brightness and position in the sky, affecting both
the system calibration and image reconstruction. In this paper we investigate
the biasing effect of quantization in the measured correlation between
complex-valued inputs with a circularly symmetric Gaussian probability density
function (PDF), which is the typical case for radio astronomy applications. We
start by calculating the correlation between the input and quantization error
and its effect on the quantized variance, first in the case of a real-valued
quantizer with a zero mean Gaussian input and then in the case of a
complex-valued quantizer with a circularly symmetric Gaussian input. We
demonstrate that this input-error correlation is always negative for a
quantizer with an odd number of levels, while for an even number of levels this
correlation is positive in the low signal level regime. In both cases there is
an optimal interval for the input signal level for which this input-error
correlation is very weak and the model of additive uncorrelated quantization
noise provides a very accurate approximation. We determine the conditions under
which the magnitude and phase of the measured correlation have negligible bias
with respect to the unquantized values: we demonstrate that the magnitude bias
is negligible only if both unquantized inputs are optimally quantized (i.e.,
when the uncorrelated quantization error model is valid), while the phase bias
is negligible when 1) at least one of the inputs is optimally quantized, or
when 2) the correlation coefficient between the unquantized inputs is small.
Finally, we determine the implications of these results for radio
interferometry.
|
astro-ph.IM
|
in radio interferometry the quantization process introduces a bias in the magnitude and phase of the measured correlations which translates into errors in the measurement of source brightness and position in the sky affecting both the system calibration and image reconstruction in this paper we investigate the biasing effect of quantization in the measured correlation between complexvalued inputs with a circularly symmetric gaussian probability density function pdf which is the typical case for radio astronomy applications we start by calculating the correlation between the input and quantization error and its effect on the quantized variance first in the case of a realvalued quantizer with a zero mean gaussian input and then in the case of a complexvalued quantizer with a circularly symmetric gaussian input we demonstrate that this inputerror correlation is always negative for a quantizer with an odd number of levels while for an even number of levels this correlation is positive in the low signal level regime in both cases there is an optimal interval for the input signal level for which this inputerror correlation is very weak and the model of additive uncorrelated quantization noise provides a very accurate approximation we determine the conditions under which the magnitude and phase of the measured correlation have negligible bias with respect to the unquantized values we demonstrate that the magnitude bias is negligible only if both unquantized inputs are optimally quantized ie when the uncorrelated quantization error model is valid while the phase bias is negligible when 1 at least one of the inputs is optimally quantized or when 2 the correlation coefficient between the unquantized inputs is small finally we determine the implications of these results for radio interferometry
|
[['in', 'radio', 'interferometry', 'the', 'quantization', 'process', 'introduces', 'a', 'bias', 'in', 'the', 'magnitude', 'and', 'phase', 'of', 'the', 'measured', 'correlations', 'which', 'translates', 'into', 'errors', 'in', 'the', 'measurement', 'of', 'source', 'brightness', 'and', 'position', 'in', 'the', 'sky', 'affecting', 'both', 'the', 'system', 'calibration', 'and', 'image', 'reconstruction', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'biasing', 'effect', 'of', 'quantization', 'in', 'the', 'measured', 'correlation', 'between', 'complexvalued', 'inputs', 'with', 'a', 'circularly', 'symmetric', 'gaussian', 'probability', 'density', 'function', 'pdf', 'which', 'is', 'the', 'typical', 'case', 'for', 'radio', 'astronomy', 'applications', 'we', 'start', 'by', 'calculating', 'the', 'correlation', 'between', 'the', 'input', 'and', 'quantization', 'error', 'and', 'its', 'effect', 'on', 'the', 'quantized', 'variance', 'first', 'in', 'the', 'case', 'of', 'a', 'realvalued', 'quantizer', 'with', 'a', 'zero', 'mean', 'gaussian', 'input', 'and', 'then', 'in', 'the', 'case', 'of', 'a', 'complexvalued', 'quantizer', 'with', 'a', 'circularly', 'symmetric', 'gaussian', 'input', 'we', 'demonstrate', 'that', 'this', 'inputerror', 'correlation', 'is', 'always', 'negative', 'for', 'a', 'quantizer', 'with', 'an', 'odd', 'number', 'of', 'levels', 'while', 'for', 'an', 'even', 'number', 'of', 'levels', 'this', 'correlation', 'is', 'positive', 'in', 'the', 'low', 'signal', 'level', 'regime', 'in', 'both', 'cases', 'there', 'is', 'an', 'optimal', 'interval', 'for', 'the', 'input', 'signal', 'level', 'for', 'which', 'this', 'inputerror', 'correlation', 'is', 'very', 'weak', 'and', 'the', 'model', 'of', 'additive', 'uncorrelated', 'quantization', 'noise', 'provides', 'a', 'very', 'accurate', 'approximation', 'we', 'determine', 'the', 'conditions', 'under', 'which', 'the', 'magnitude', 'and', 'phase', 'of', 'the', 'measured', 'correlation', 'have', 'negligible', 'bias', 'with', 'respect', 'to', 'the', 'unquantized', 'values', 'we', 'demonstrate', 'that', 'the', 'magnitude', 'bias', 'is', 'negligible', 'only', 'if', 'both', 'unquantized', 'inputs', 'are', 'optimally', 'quantized', 'ie', 'when', 'the', 'uncorrelated', 'quantization', 'error', 'model', 'is', 'valid', 'while', 'the', 'phase', 'bias', 'is', 'negligible', 'when', '1', 'at', 'least', 'one', 'of', 'the', 'inputs', 'is', 'optimally', 'quantized', 'or', 'when', '2', 'the', 'correlation', 'coefficient', 'between', 'the', 'unquantized', 'inputs', 'is', 'small', 'finally', 'we', 'determine', 'the', 'implications', 'of', 'these', 'results', 'for', 'radio', 'interferometry']]
|
[-0.1450565819091107, 0.1285004269092917, -0.05981200550078651, 0.07466579427446017, -0.0017297921608799675, -0.14580010256386197, 0.04211236857875888, 0.4009938237781379, -0.2590225989643257, -0.29529576420414305, 0.09018758853553631, -0.27563975336477425, -0.14346817959730904, 0.16272945252520876, -0.04466367699247601, 0.04636796237175865, 0.026010989054610224, 0.05788514270667507, -0.09872299637545341, -0.24374672468070702, 0.3054011150920016, 0.08121184097422708, 0.3042888634702137, 0.006827213284250776, 0.12789984471181334, 0.018303670365476855, -0.032979652297259125, 0.02208221138928537, -0.050295419624610635, 0.03157747508524032, 0.22583027234748274, 0.0479912708570186, 0.2674520400579765, -0.35736928062386625, -0.18798185403268503, 0.12596027542733484, 0.10997559092888828, 0.12153541841327237, -0.048582475662471786, -0.25216747299888204, 0.10222225772520681, -0.13906026890127515, -0.045102018691051925, -0.01067540048217688, 0.031008181372477163, 0.01379880590587336, -0.338502449687824, 0.11173410208288273, 0.057212710670966616, 0.03246990216088124, -0.06676039409675172, -0.1309412452446524, 0.0230771653674623, 0.15133077316276153, 0.019036643350714696, 0.06223760563800926, 0.08297809002892612, -0.16382858733309427, -0.05198601445230726, 0.34059997029831185, -0.08354889211352534, -0.2506839415345568, 0.09336976709652119, -0.20313873654356607, -0.09184842395652953, 0.12156247677394993, 0.16657009862002828, 0.07040086506588858, -0.10202153614720315, 0.05065534672523368, 0.012461111264547006, 0.2155925931707759, 0.055589000330603676, 0.07460876980439282, 0.19625337965666287, 0.12478961192837526, 0.09947714891399868, 0.16657365037639055, -0.17045655120981984, -0.07294519188460029, -0.31471453618765627, -0.09371967992604932, -0.20359739494646856, 0.03393086088290538, -0.10383064695174962, -0.1595863862406282, 0.40400340482692726, 0.1627227873825151, 0.2128991831067322, 0.09924347837051664, 0.3708634566662559, 0.186038427912767, 0.025088688185084678, 0.053147414143433616, 0.24780529574908342, 0.14140795155154628, 0.045040839792339395, -0.21421022037224424, 0.0798693923546689, -0.017659806018014267]
|
1,803.04297
|
Optical Rotation of Levitated Spheres in High Vacuum
|
A circularly polarized laser beam is used to levitate and control the
rotation of microspheres in high vacuum. At low pressure, rotation frequencies
as high as 6 MHz are observed for birefringent vaterite spheres, limited by
centrifugal stresses. Due to the extremely low damping in high vacuum,
controlled optical rotation of amorphous SiO$_2$ spheres is also observed at
rates above several MHz. At $10^{-7}$ mbar, a damping time of $6\times10^4$ s
is measured for a $10\ \mu$m diameter SiO$_2$ sphere. No additional damping
mechanisms are observed above gas damping, indicating that even longer damping
times may be possible with operation at lower pressure. The controlled optical
rotation of microspheres at MHz frequencies with low damping, including for
materials that are not intrinsically birefringent, provides a new tool for
performing precision measurements using optically levitated systems.
|
physics.optics physics.ins-det quant-ph
|
a circularly polarized laser beam is used to levitate and control the rotation of microspheres in high vacuum at low pressure rotation frequencies as high as 6 mhz are observed for birefringent vaterite spheres limited by centrifugal stresses due to the extremely low damping in high vacuum controlled optical rotation of amorphous sio_2 spheres is also observed at rates above several mhz at 107 mbar a damping time of 6times104 s is measured for a 10 mum diameter sio_2 sphere no additional damping mechanisms are observed above gas damping indicating that even longer damping times may be possible with operation at lower pressure the controlled optical rotation of microspheres at mhz frequencies with low damping including for materials that are not intrinsically birefringent provides a new tool for performing precision measurements using optically levitated systems
|
[['a', 'circularly', 'polarized', 'laser', 'beam', 'is', 'used', 'to', 'levitate', 'and', 'control', 'the', 'rotation', 'of', 'microspheres', 'in', 'high', 'vacuum', 'at', 'low', 'pressure', 'rotation', 'frequencies', 'as', 'high', 'as', '6', 'mhz', 'are', 'observed', 'for', 'birefringent', 'vaterite', 'spheres', 'limited', 'by', 'centrifugal', 'stresses', 'due', 'to', 'the', 'extremely', 'low', 'damping', 'in', 'high', 'vacuum', 'controlled', 'optical', 'rotation', 'of', 'amorphous', 'sio_2', 'spheres', 'is', 'also', 'observed', 'at', 'rates', 'above', 'several', 'mhz', 'at', '107', 'mbar', 'a', 'damping', 'time', 'of', '6times104', 's', 'is', 'measured', 'for', 'a', '10', 'mum', 'diameter', 'sio_2', 'sphere', 'no', 'additional', 'damping', 'mechanisms', 'are', 'observed', 'above', 'gas', 'damping', 'indicating', 'that', 'even', 'longer', 'damping', 'times', 'may', 'be', 'possible', 'with', 'operation', 'at', 'lower', 'pressure', 'the', 'controlled', 'optical', 'rotation', 'of', 'microspheres', 'at', 'mhz', 'frequencies', 'with', 'low', 'damping', 'including', 'for', 'materials', 'that', 'are', 'not', 'intrinsically', 'birefringent', 'provides', 'a', 'new', 'tool', 'for', 'performing', 'precision', 'measurements', 'using', 'optically', 'levitated', 'systems']]
|
[-0.1379608630034555, 0.28432516737806574, -0.008499435897640607, -0.00402184669704487, -0.01924766111532571, -0.19047272237086738, 0.02225209618056262, 0.47551577736934025, -0.2134612341031984, -0.34590929492756173, 0.10131880039504419, -0.23444371201373912, -0.005680755560320837, 0.2761479126461954, -0.007301305924300794, 0.05001008451950771, -0.018201063628549927, -0.08224244624100349, -0.0172051850745144, -0.15408821177444662, 0.18106545119684328, 0.11936977377799513, 0.27669223172038243, 0.03619673819522615, 0.13898713943996915, -0.0991690727468166, 0.07429581997157247, -0.034907359153860146, -0.1417685193325505, 0.002724062823862941, 0.243427765864396, -0.07812028681100519, 0.20927164767420403, -0.40910568505663564, -0.2072213348522955, 0.01981243806356495, 0.10491225691857162, 0.13249664136932957, -0.06274373148378261, -0.20494568057668705, 0.07866538294625502, -0.11732963363605517, -0.18219453153303927, -0.05781689353795998, 0.06792942726363739, -0.0042900188136155955, -0.2640168034243052, 0.12677132866185814, 0.02818220591827951, 0.13948774545418996, -0.11153522771093305, -0.1096685683251255, -0.054906665240586905, 0.031136455876683747, 0.00621527457713253, 0.0491724853783294, 0.2507238722509808, -0.09867810364122744, -0.049184020832870844, 0.39543848589614583, -0.12692423541512754, -0.10021329840162287, 0.2229472675188272, -0.2422050534678554, -0.020334420418711724, 0.2900156664420609, 0.1748386771206882, 0.08235135454408549, -0.09865835011005401, -0.031149829528941256, 0.044416152769958396, 0.2395933302326335, 0.21922142361118285, 0.06919123695525169, 0.2548340218279649, 0.16022142457551564, 0.022996642951060225, 0.12240709263089768, -0.13788884809689114, 0.06336150788141552, -0.24165973941002178, -0.0864126386327876, -0.16746999061218015, 0.07633391994545323, -0.08743567410500772, -0.09325104658664377, 0.26544561023582464, 0.07439364393983312, 0.15267386204321629, 0.01715324329281295, 0.35516128854619133, 0.09065971632608799, 0.09433992115901438, 0.05385771755956941, 0.3476991621570455, 0.1778161424785611, 0.12105295255400793, -0.23559042217071963, 0.027777562500839983, -0.0664639094809967]
|
1,803.04298
|
Error estimates for the approximation of multibang control problems
|
This work is concerned with optimal control problems where the objective
functional consists of a tracking-type functional and an additional "multibang"
regularization functional that promotes optimal control taking values from a
given discrete set pointwise almost everywhere. Under a regularity condition on
the set where these discrete values are attained, error estimates for the
Moreau--Yosida approximation (which allows its solution by a semismooth Newton
method) and the discretization of the problem are derived. Numerical results
support the theoretical findings.
|
math.OC math.NA
|
this work is concerned with optimal control problems where the objective functional consists of a trackingtype functional and an additional multibang regularization functional that promotes optimal control taking values from a given discrete set pointwise almost everywhere under a regularity condition on the set where these discrete values are attained error estimates for the moreauyosida approximation which allows its solution by a semismooth newton method and the discretization of the problem are derived numerical results support the theoretical findings
|
[['this', 'work', 'is', 'concerned', 'with', 'optimal', 'control', 'problems', 'where', 'the', 'objective', 'functional', 'consists', 'of', 'a', 'trackingtype', 'functional', 'and', 'an', 'additional', 'multibang', 'regularization', 'functional', 'that', 'promotes', 'optimal', 'control', 'taking', 'values', 'from', 'a', 'given', 'discrete', 'set', 'pointwise', 'almost', 'everywhere', 'under', 'a', 'regularity', 'condition', 'on', 'the', 'set', 'where', 'these', 'discrete', 'values', 'are', 'attained', 'error', 'estimates', 'for', 'the', 'moreauyosida', 'approximation', 'which', 'allows', 'its', 'solution', 'by', 'a', 'semismooth', 'newton', 'method', 'and', 'the', 'discretization', 'of', 'the', 'problem', 'are', 'derived', 'numerical', 'results', 'support', 'the', 'theoretical', 'findings']]
|
[-0.11711923030611032, 0.002491734326609637, -0.10498997155959025, 0.045804307819941104, -0.0762753956234799, -0.12111781433057518, 0.09053914023724456, 0.34427883743475646, -0.3035225844046531, -0.26310838385819435, 0.1666436365996607, -0.24875834358886678, -0.15694662207403245, 0.22035317499681603, -0.10115407144603057, 0.1547365305935576, 0.08266085390156756, 0.03258782411471774, -0.07470700574310449, -0.26031581623008093, 0.32424137656553054, -0.0032296794203993603, 0.26790695406126386, 0.02784387931117239, 0.15040517707492632, -0.0024395040117013147, -0.006511331046334444, 0.048431164770124435, -0.15702098524483377, 0.1736828243607679, 0.24084277250445807, 0.08619586177519523, 0.40988516191450447, -0.4104447543728523, -0.20012911413915646, 0.06115743055796394, 0.09030968555882095, 0.047649503498970985, -0.06092810293641658, -0.25846427329815924, 0.1199771484049658, -0.0745047480494787, -0.12486795575405733, -0.09574134549937952, -0.07687087234658882, 0.05915157859980797, -0.40462740884275916, 0.07654824711155528, 0.027369875932494417, 0.0459209219731677, -0.18519218485930766, -0.12762028756193244, 0.005318538596232732, 0.08915292946860576, 0.06051771480960246, 0.045630479141926535, 0.08462539186271337, -0.07907935857283285, -0.07019622040649828, 0.34116000512567085, -0.026193591834714588, -0.29388558584898233, 0.13739409285316911, -0.06035988462062027, -0.12019863918137091, 0.13169641219055614, 0.12693905847099346, 0.14961785884000933, -0.15177211413780847, 0.15457639591738534, -0.057588632081229336, 0.14260962379212755, 0.026559683882320922, 0.0015973048135399437, 0.07317998449210651, 0.1446791664004708, 0.18491414678283036, 0.09597954747732729, -0.009148185875696631, -0.1257686201685992, -0.3818695027476702, -0.0928222284031411, -0.20112381510746977, 0.00776265083382336, -0.14194417229625217, -0.18651691381222543, 0.3650960081901688, 0.10615406067182238, 0.16901890844560397, 0.13300459760462102, 0.2834743550286079, 0.19628520283395817, -0.011708132203262394, 0.09617320129958291, 0.20204869285225868, 0.1278425979260833, 0.0478537386486259, -0.21882103258469263, 0.08081890049223335, 0.14356841469326845]
|
1,803.04299
|
Measurements of Absolute Branching Fractions for
$\Lambda^+_c\to\Xi^0K^+$ and $\Xi(1530)^0K^+$
|
We report the first measurements of absolute branching fractions for the
$W$-exchange-only processes $\Lambda^+_c\to\Xi^0K^+$ and
$\Lambda^+_c\to\Xi(1530)^0K^+$ with the double-tag technique, by analyzing an
$e^{+}e^{-}$ collision data sample, that corresponds to an integrated
luminosity of 567 pb$^{-1}$ collected at a center-of-mass energy of 4.6 GeV by
the BESIII detector. The branching fractions are measured to be
$\mathcal{B}(\Lambda^+_c\to\Xi^0K^+)=(5.90\pm0.86\pm0.39)\times10^{-3}$ and
$\mathcal{B}(\Lambda^+_c\to\Xi(1530)^0K^+)=(5.02\pm0.99\pm0.31)\times10^{-3}$,
where the first uncertainties are statistical and the second systematic. Our
results are more precise than the previous relative measurements.
|
hep-ex
|
we report the first measurements of absolute branching fractions for the wexchangeonly processes lambda_ctoxi0k and lambda_ctoxi15300k with the doubletag technique by analyzing an ee collision data sample that corresponds to an integrated luminosity of 567 pb1 collected at a centerofmass energy of 46 gev by the besiii detector the branching fractions are measured to be mathcalblambda_ctoxi0k590pm086pm039times103 and mathcalblambda_ctoxi15300k502pm099pm031times103 where the first uncertainties are statistical and the second systematic our results are more precise than the previous relative measurements
|
[['we', 'report', 'the', 'first', 'measurements', 'of', 'absolute', 'branching', 'fractions', 'for', 'the', 'wexchangeonly', 'processes', 'lambda_ctoxi0k', 'and', 'lambda_ctoxi15300k', 'with', 'the', 'doubletag', 'technique', 'by', 'analyzing', 'an', 'ee', 'collision', 'data', 'sample', 'that', 'corresponds', 'to', 'an', 'integrated', 'luminosity', 'of', '567', 'pb1', 'collected', 'at', 'a', 'centerofmass', 'energy', 'of', '46', 'gev', 'by', 'the', 'besiii', 'detector', 'the', 'branching', 'fractions', 'are', 'measured', 'to', 'be', 'mathcalblambda_ctoxi0k590pm086pm039times103', 'and', 'mathcalblambda_ctoxi15300k502pm099pm031times103', 'where', 'the', 'first', 'uncertainties', 'are', 'statistical', 'and', 'the', 'second', 'systematic', 'our', 'results', 'are', 'more', 'precise', 'than', 'the', 'previous', 'relative', 'measurements']]
|
[-0.04008126614793931, 0.14106447533233896, -0.08841511317567058, 0.032484704284125, -0.015842632703125886, -0.01781815224748156, 0.06128253403106985, 0.3646408766890838, -0.16938268729447298, -0.375590590989753, 0.06600046588414132, -0.39280534716807813, 0.08776020355624696, 0.24472023512568478, 0.032758179133477276, 0.12555108922342323, 0.12736731418089509, -0.004170647605437122, -0.066891338245637, -0.22517395037392232, 0.2461600777603788, 0.13405584508221444, 0.25068605058405496, 0.028839411899728114, 0.07921772679371428, -0.022427540001370115, -0.10753045699316753, -0.037126343078554086, -0.16042484828218745, 0.12694989719702415, 0.24153455607999716, 0.09853963829474906, 0.16982834089598428, -0.3355049198131158, -0.028697097992958272, 0.15291934178453193, 0.09967991008027775, 0.059484502019947524, 0.004548034460677714, -0.343623984681621, 0.12237687896911616, -0.16939576420524757, -0.06450747752128398, 0.0007068596091376592, 0.07682587597391581, -0.010034363244800535, -0.29260056560272224, 0.1278737148601715, -0.04406124060247524, 0.11190635892116044, -0.05967808292846974, -0.20668848995629646, -0.028126861533303172, 0.018052620704808873, 0.004447891697453412, 0.03899862571166548, 0.18988177260026745, -0.08568499825435551, -0.18590262606229685, 0.3430653862042786, -0.02730691664288465, -0.10036293767099205, 0.16254356486901436, -0.2105869491240137, -0.10555959104445495, 0.20664770765970014, 0.26914782649901225, 0.07527294106883546, -0.271623621503376, 0.0018246946960036987, 0.010969062590946073, 0.19087987719741586, 0.025900800718785557, 0.04359667563861976, 0.13425885566369924, 0.22126858112281061, 0.00799153697970387, 0.09796198299282217, -0.15214480409934505, -0.021265684971458292, -0.3923703227543004, -0.1354374725448146, -0.11052816151960256, 0.05427281123471178, -0.05328992351013306, -0.007126028840876606, 0.3203325877540222, 0.12153999198169116, 0.35440806044291145, 0.08272403014236934, 0.2882747351102633, 0.17569065104040943, 0.034589557302477834, 0.03727199888089672, 0.3328314724135889, 0.12749064936340876, 0.12619468230396919, -0.22244735565778084, 0.0460314000637768, -0.03485471525625007]
|
1,803.043
|
Neural Conditional Gradients
|
The move from hand-designed to learned optimizers in machine learning has
been quite successful for gradient-based and -free optimizers. When facing a
constrained problem, however, maintaining feasibility typically requires a
projection step, which might be computationally expensive and not
differentiable. We show how the design of projection-free convex optimization
algorithms can be cast as a learning problem based on Frank-Wolfe Networks:
recurrent networks implementing the Frank-Wolfe algorithm aka. conditional
gradients. This allows them to learn to exploit structure when, e.g.,
optimizing over rank-1 matrices. Our LSTM-learned optimizers outperform
hand-designed as well learned but unconstrained ones. We demonstrate this for
training support vector machines and softmax classifiers.
|
cs.LG stat.ML
|
the move from handdesigned to learned optimizers in machine learning has been quite successful for gradientbased and free optimizers when facing a constrained problem however maintaining feasibility typically requires a projection step which might be computationally expensive and not differentiable we show how the design of projectionfree convex optimization algorithms can be cast as a learning problem based on frankwolfe networks recurrent networks implementing the frankwolfe algorithm aka conditional gradients this allows them to learn to exploit structure when eg optimizing over rank1 matrices our lstmlearned optimizers outperform handdesigned as well learned but unconstrained ones we demonstrate this for training support vector machines and softmax classifiers
|
[['the', 'move', 'from', 'handdesigned', 'to', 'learned', 'optimizers', 'in', 'machine', 'learning', 'has', 'been', 'quite', 'successful', 'for', 'gradientbased', 'and', 'free', 'optimizers', 'when', 'facing', 'a', 'constrained', 'problem', 'however', 'maintaining', 'feasibility', 'typically', 'requires', 'a', 'projection', 'step', 'which', 'might', 'be', 'computationally', 'expensive', 'and', 'not', 'differentiable', 'we', 'show', 'how', 'the', 'design', 'of', 'projectionfree', 'convex', 'optimization', 'algorithms', 'can', 'be', 'cast', 'as', 'a', 'learning', 'problem', 'based', 'on', 'frankwolfe', 'networks', 'recurrent', 'networks', 'implementing', 'the', 'frankwolfe', 'algorithm', 'aka', 'conditional', 'gradients', 'this', 'allows', 'them', 'to', 'learn', 'to', 'exploit', 'structure', 'when', 'eg', 'optimizing', 'over', 'rank1', 'matrices', 'our', 'lstmlearned', 'optimizers', 'outperform', 'handdesigned', 'as', 'well', 'learned', 'but', 'unconstrained', 'ones', 'we', 'demonstrate', 'this', 'for', 'training', 'support', 'vector', 'machines', 'and', 'softmax', 'classifiers']]
|
[0.00018975470614220416, -0.023489109228276427, -0.07458833040270423, 0.1074709403616864, -0.16648465753311203, -0.2609837231581055, 0.05155796157639651, 0.5154183422880513, -0.35757764716233525, -0.30804161138921266, 0.1306380531916927, -0.19393559783334025, -0.20971352551354183, 0.1954783511104151, -0.15987926344608977, 0.16739999260753394, 0.13581010162542087, 0.004820109801810412, -0.16344279122671912, -0.344757525833501, 0.26259623311814806, 0.02179067896767741, 0.2860980421482098, -0.02883546216235984, 0.16767339419484847, 0.012368395913481003, 0.05166336110393916, 0.03079937019474095, 0.025014643353365715, 0.18183589408041112, 0.3390569278881663, 0.27371896577644206, 0.4104221587401948, -0.4453296460920856, -0.21016676296768266, 0.18532356654426882, 0.19412177372100164, 0.09595630766568883, -0.0181697749455149, -0.29109714820626237, 0.06775080964102277, -0.11285458298488742, 0.040299036469133125, -0.20873547080194665, -0.10229919256553763, 0.0062763400409104565, -0.3231671472506908, -0.017456918777454467, 0.07224532400058316, 0.005536974478690397, -0.045024543018856396, -0.16303084730392411, 0.03694859638455368, 0.07989706484257199, 0.04256382990805876, 0.08401886265104015, 0.1924410853934075, -0.1597713660254764, -0.18019989467159445, 0.35251952941928594, -0.022704449378042703, -0.2600150650189746, 0.1824196354729966, 0.05024310930499009, -0.17391319568047212, 0.09429851044856366, 0.2721541762795477, 0.1730883118186501, -0.14240285473892333, 0.05640330679016188, -0.04917750490463472, 0.1364172734586256, 0.028403926372439377, -0.008415805832261132, 0.15053689597130177, 0.23434122644276137, 0.13604301186721948, 0.14566694433091298, -0.046417227436489024, -0.11849674625943105, -0.17073331503641037, -0.0783617052027867, -0.2453823973380384, -0.011365487237898854, -0.07307860676512411, -0.16468274802748403, 0.35704321389396987, 0.19318194905118574, 0.22908526479843117, 0.1951887118419455, 0.3484016431672942, 0.04303030570680719, 0.14838524418217794, 0.18581828302260311, 0.2311240723955312, 0.0476161587229442, 0.13288381117329534, -0.15345902366874117, 0.1384325485809573, 0.08021439027395987]
|
1,803.04301
|
Dynamical evolution of stars and gas of young embedded stellar
sub-clusters
|
We present simulations of the dynamical evolution of young embedded star
clusters. Our initial conditions are directly derived from X-ray, infrared, and
radio observations of local systems, and our models evolve both gas and stars
simultaneously. Our regions begin with both clustered and extended
distributions of stars, and a gas distribution which can include a filamentary
structure in addition to gas surrounding the stellar subclusters. We find that
the regions become spherical, monolithic, and smooth quite quickly, and that
the dynamical evolution is dominated by the gravitational interactions between
the stars. In the absence of stellar feedback, the gas moves gently out of the
centre of our regions but does not have a significant impact on the motions of
the stars at the earliest stages of cluster formation. Our models at later
times are consistent with observations of similar regions in the local
neighbourhood. We conclude that the evolution of young proto-star clusters is
relatively insensitive to reasonable choices of initial conditions. Models with
more realism, such as an initial population of binary and multiple stars and
ongoing star formation, are the next step needed to confirm these findings.
|
astro-ph.GA astro-ph.SR
|
we present simulations of the dynamical evolution of young embedded star clusters our initial conditions are directly derived from xray infrared and radio observations of local systems and our models evolve both gas and stars simultaneously our regions begin with both clustered and extended distributions of stars and a gas distribution which can include a filamentary structure in addition to gas surrounding the stellar subclusters we find that the regions become spherical monolithic and smooth quite quickly and that the dynamical evolution is dominated by the gravitational interactions between the stars in the absence of stellar feedback the gas moves gently out of the centre of our regions but does not have a significant impact on the motions of the stars at the earliest stages of cluster formation our models at later times are consistent with observations of similar regions in the local neighbourhood we conclude that the evolution of young protostar clusters is relatively insensitive to reasonable choices of initial conditions models with more realism such as an initial population of binary and multiple stars and ongoing star formation are the next step needed to confirm these findings
|
[['we', 'present', 'simulations', 'of', 'the', 'dynamical', 'evolution', 'of', 'young', 'embedded', 'star', 'clusters', 'our', 'initial', 'conditions', 'are', 'directly', 'derived', 'from', 'xray', 'infrared', 'and', 'radio', 'observations', 'of', 'local', 'systems', 'and', 'our', 'models', 'evolve', 'both', 'gas', 'and', 'stars', 'simultaneously', 'our', 'regions', 'begin', 'with', 'both', 'clustered', 'and', 'extended', 'distributions', 'of', 'stars', 'and', 'a', 'gas', 'distribution', 'which', 'can', 'include', 'a', 'filamentary', 'structure', 'in', 'addition', 'to', 'gas', 'surrounding', 'the', 'stellar', 'subclusters', 'we', 'find', 'that', 'the', 'regions', 'become', 'spherical', 'monolithic', 'and', 'smooth', 'quite', 'quickly', 'and', 'that', 'the', 'dynamical', 'evolution', 'is', 'dominated', 'by', 'the', 'gravitational', 'interactions', 'between', 'the', 'stars', 'in', 'the', 'absence', 'of', 'stellar', 'feedback', 'the', 'gas', 'moves', 'gently', 'out', 'of', 'the', 'centre', 'of', 'our', 'regions', 'but', 'does', 'not', 'have', 'a', 'significant', 'impact', 'on', 'the', 'motions', 'of', 'the', 'stars', 'at', 'the', 'earliest', 'stages', 'of', 'cluster', 'formation', 'our', 'models', 'at', 'later', 'times', 'are', 'consistent', 'with', 'observations', 'of', 'similar', 'regions', 'in', 'the', 'local', 'neighbourhood', 'we', 'conclude', 'that', 'the', 'evolution', 'of', 'young', 'protostar', 'clusters', 'is', 'relatively', 'insensitive', 'to', 'reasonable', 'choices', 'of', 'initial', 'conditions', 'models', 'with', 'more', 'realism', 'such', 'as', 'an', 'initial', 'population', 'of', 'binary', 'and', 'multiple', 'stars', 'and', 'ongoing', 'star', 'formation', 'are', 'the', 'next', 'step', 'needed', 'to', 'confirm', 'these', 'findings']]
|
[-0.06854980136329436, 0.13542437073770017, -0.11379874977757465, 0.07665606803585967, -0.05194126614788301, -0.01575506935247205, 0.03891309238009391, 0.40756359245017093, -0.19284439459396896, -0.3284276916002411, 0.08497469602017195, -0.24463219236134104, -0.06992072490211478, 0.16713098428093842, -0.00888317386359814, -0.035308008634105874, 0.11232232001472127, -0.0450162619362196, -0.0629331865803728, -0.2830484404447907, 0.3685370708012549, 0.07217281755730115, 0.15586277622010106, -0.03891543698960314, 0.051601322434310405, -0.11170668826344862, -0.06931642627727891, 0.010261741957735646, -0.1262399664286277, 0.06421689674930854, 0.1970735995553638, 0.13270213011721219, 0.24997868064591394, -0.44018102772336787, -0.24120631130293957, 0.05736009850907115, 0.19486884301695875, 0.08481248198803909, -0.08776066932932254, -0.28029750298681577, 0.08511126358505516, -0.16528709314852244, -0.17178365044916669, 0.023864729551687128, 0.04201399393024899, 0.06879019048804284, -0.257282294240896, 0.12505867437856202, 0.04674616334658047, 0.020612799915763494, -0.12723285542855226, -0.07759414208195513, -0.080290429982746, 0.14385496399293915, -0.010781456446570773, 0.05036360767260982, 0.19382598014855165, -0.1722511873560805, -0.024808410412222936, 0.39551206677166556, -0.03630240642337532, -0.08086566868725986, 0.31034650925606017, -0.2141759706409796, -0.18282943395109325, 0.11601991527196434, 0.1470314201765827, 0.13959787013600505, -0.13589893770373362, -0.02040389583787324, -0.012162681072753258, 0.17741729260949546, 0.024623940883588696, 0.03882512779876826, 0.34597658013639154, 0.129712186966254, 0.02749510574716306, 0.11450457581190797, -0.15697431870952996, -0.11927419939822463, -0.25935854011605786, -0.08808039886835056, -0.1031873377074522, 0.02092290582345052, -0.12779950067730775, -0.13569053316799304, 0.3297401824547224, 0.11401682793872342, 0.22410812914844544, 0.04588552469217647, 0.2652019021968559, 0.06462285676096423, 0.10244193995647409, 0.12810206624541293, 0.2590021391598774, 0.15336131269639486, 0.08408523952371623, -0.25385590069114217, 0.0879297464366549, -0.03916438846977024]
|
1,803.04302
|
Indefinite Causal Order in a Quantum Switch
|
In quantum mechanics events can happen in no definite causal order: in
practice this can be verified by measuring a causal witness, in the same way
that an entanglement witness verifies entanglement. Indefinite causal order can
be observed in a quantum switch, where two operations act in a quantum
superposition of the two possible orders. Here we realise a photonic quantum
switch, where polarisation coherently controls the order of two operations,
$\hat{A}$ and $\hat{B}$, on the transverse spatial mode of the photons. Our
setup avoids the limitations of earlier implementations: the operations cannot
be distinguished by spatial or temporal position. We show that our quantum
switch has no definite causal order, by constructing a causal witness and
measuring its value to be 18 standard deviations beyond the definite-order
bound.
|
quant-ph
|
in quantum mechanics events can happen in no definite causal order in practice this can be verified by measuring a causal witness in the same way that an entanglement witness verifies entanglement indefinite causal order can be observed in a quantum switch where two operations act in a quantum superposition of the two possible orders here we realise a photonic quantum switch where polarisation coherently controls the order of two operations hata and hatb on the transverse spatial mode of the photons our setup avoids the limitations of earlier implementations the operations cannot be distinguished by spatial or temporal position we show that our quantum switch has no definite causal order by constructing a causal witness and measuring its value to be 18 standard deviations beyond the definiteorder bound
|
[['in', 'quantum', 'mechanics', 'events', 'can', 'happen', 'in', 'no', 'definite', 'causal', 'order', 'in', 'practice', 'this', 'can', 'be', 'verified', 'by', 'measuring', 'a', 'causal', 'witness', 'in', 'the', 'same', 'way', 'that', 'an', 'entanglement', 'witness', 'verifies', 'entanglement', 'indefinite', 'causal', 'order', 'can', 'be', 'observed', 'in', 'a', 'quantum', 'switch', 'where', 'two', 'operations', 'act', 'in', 'a', 'quantum', 'superposition', 'of', 'the', 'two', 'possible', 'orders', 'here', 'we', 'realise', 'a', 'photonic', 'quantum', 'switch', 'where', 'polarisation', 'coherently', 'controls', 'the', 'order', 'of', 'two', 'operations', 'hata', 'and', 'hatb', 'on', 'the', 'transverse', 'spatial', 'mode', 'of', 'the', 'photons', 'our', 'setup', 'avoids', 'the', 'limitations', 'of', 'earlier', 'implementations', 'the', 'operations', 'can', 'not', 'be', 'distinguished', 'by', 'spatial', 'or', 'temporal', 'position', 'we', 'show', 'that', 'our', 'quantum', 'switch', 'has', 'no', 'definite', 'causal', 'order', 'by', 'constructing', 'a', 'causal', 'witness', 'and', 'measuring', 'its', 'value', 'to', 'be', '18', 'standard', 'deviations', 'beyond', 'the', 'definiteorder', 'bound']]
|
[-0.15670207433056, 0.20921317192776825, -0.102539280664118, 0.08263806230117848, -0.05467688200847325, -0.16681271071668513, 0.04449238591148814, 0.3707080964403328, -0.2648599978189829, -0.28108222922310233, 0.07422947555296701, -0.23625881753342096, -0.12967401551797467, 0.19622604980480013, -0.041267329863048804, 0.059083178013566766, 0.02622618973471744, 0.054031959202414916, -0.0805064818479821, -0.22388845132014087, 0.2869010197374132, 0.014883880636134987, 0.2595702888527091, 0.026482365411785683, 0.10546178616901007, 0.006135576909999977, 0.0015800401727242986, 0.05329475185992701, -0.06741228803521647, 0.06906596273039431, 0.2877340725543656, 0.1390558286595281, 0.2731375119417848, -0.44874344667954036, -0.19571491557556067, 0.15129640572090713, 0.10940965318460336, 0.1599171284961608, 0.0029408018268976908, -0.3023919380132773, 0.035826979777162045, -0.1674999171423964, -0.10478582238605202, -0.092108219103931, -0.03954005777085012, -0.08914468694088418, -0.2460131858937558, 0.0550459410865293, 0.08536094286553056, 0.020999630960065498, 0.048199683361932234, 0.00359035678958708, 0.0006776986816941305, 0.11031847333629406, -0.05428260046124184, 0.02880967665434808, 0.12009545819212993, -0.07285603073736031, -0.2675366890580617, 0.33070984939041065, -0.03315789455389099, -0.22550001748577628, 0.1555277310138525, -0.16664056478847944, -0.09187117154694653, 0.05216721793575314, 0.1274409275862944, 0.0799138266882, -0.14495266489156652, 0.07220703561144137, -0.010312465927383118, 0.20848204888576685, 0.12189805919896493, 0.09617086454446233, 0.22685737844354423, 0.07967676924065102, 0.06367801070617612, 0.1299803089332413, -0.06127061599742823, -0.13956356496151262, -0.3396453110919904, -0.21452023958031075, -0.21878209447397043, 0.0827730862143343, -0.11237538810941218, -0.11555352779610674, 0.40077668536714345, 0.14100864953668282, 0.17665828187596197, -0.012371368440907709, 0.2884308244282192, 0.13578664405675706, 0.1098366513407912, 0.06592048555901346, 0.2795654668106315, 0.11732380520805082, 0.034801538925358026, -0.2336763571153662, 0.10772692465201714, -0.0012108318366890038]
|
1,803.04303
|
Learning unknown ODE models with Gaussian processes
|
In conventional ODE modelling coefficients of an equation driving the system
state forward in time are estimated. However, for many complex systems it is
practically impossible to determine the equations or interactions governing the
underlying dynamics. In these settings, parametric ODE model cannot be
formulated. Here, we overcome this issue by introducing a novel paradigm of
nonparametric ODE modelling that can learn the underlying dynamics of arbitrary
continuous-time systems without prior knowledge. We propose to learn
non-linear, unknown differential functions from state observations using
Gaussian process vector fields within the exact ODE formalism. We demonstrate
the model's capabilities to infer dynamics from sparse data and to simulate the
system forward into future.
|
stat.ML
|
in conventional ode modelling coefficients of an equation driving the system state forward in time are estimated however for many complex systems it is practically impossible to determine the equations or interactions governing the underlying dynamics in these settings parametric ode model cannot be formulated here we overcome this issue by introducing a novel paradigm of nonparametric ode modelling that can learn the underlying dynamics of arbitrary continuoustime systems without prior knowledge we propose to learn nonlinear unknown differential functions from state observations using gaussian process vector fields within the exact ode formalism we demonstrate the models capabilities to infer dynamics from sparse data and to simulate the system forward into future
|
[['in', 'conventional', 'ode', 'modelling', 'coefficients', 'of', 'an', 'equation', 'driving', 'the', 'system', 'state', 'forward', 'in', 'time', 'are', 'estimated', 'however', 'for', 'many', 'complex', 'systems', 'it', 'is', 'practically', 'impossible', 'to', 'determine', 'the', 'equations', 'or', 'interactions', 'governing', 'the', 'underlying', 'dynamics', 'in', 'these', 'settings', 'parametric', 'ode', 'model', 'can', 'not', 'be', 'formulated', 'here', 'we', 'overcome', 'this', 'issue', 'by', 'introducing', 'a', 'novel', 'paradigm', 'of', 'nonparametric', 'ode', 'modelling', 'that', 'can', 'learn', 'the', 'underlying', 'dynamics', 'of', 'arbitrary', 'continuoustime', 'systems', 'without', 'prior', 'knowledge', 'we', 'propose', 'to', 'learn', 'nonlinear', 'unknown', 'differential', 'functions', 'from', 'state', 'observations', 'using', 'gaussian', 'process', 'vector', 'fields', 'within', 'the', 'exact', 'ode', 'formalism', 'we', 'demonstrate', 'the', 'models', 'capabilities', 'to', 'infer', 'dynamics', 'from', 'sparse', 'data', 'and', 'to', 'simulate', 'the', 'system', 'forward', 'into', 'future']]
|
[-0.09267503901722685, 0.047174375023269426, -0.10413734985987318, 0.08929225558936156, -0.1278787745426582, -0.17274289651139252, -0.0003448347355016565, 0.3772851692891754, -0.3673605638333654, -0.2966178620143472, 0.10305836214580928, -0.21882765221747413, -0.1818881715581942, 0.17356639428360932, -0.037865552373345844, 0.12082272569805516, 0.05614930666587521, -0.0017381600120755952, -0.04517839578046274, -0.18648876898213232, 0.3211417864282838, 0.015451833597524504, 0.2503295943050324, -0.06836184287295405, 0.1709880066337064, 0.027122695683048363, -0.014828298385131411, -0.0399212495596931, -0.10263371004201977, 0.08635044947217128, 0.31558333011694994, 0.14947045931131042, 0.29210435455681477, -0.5012632985393294, -0.29347783969138314, 0.11543561132682438, 0.15947816846892238, 0.1598954332221827, 0.01478534072752943, -0.3005595100689185, 0.030691792827359177, -0.15432381681042961, -0.162727594249923, -0.13716740407610098, -0.052100136165251644, 0.001632460391981346, -0.2909471270158491, 0.07123252995048476, 0.06302239447605458, 0.01250900342994559, -0.09002481517175921, -0.054696987364523574, 0.004222603053250144, 0.09752459480608525, -0.006466905043750952, -0.014168361696389924, 0.11351829345556454, -0.15624394424597576, -0.1252020432580823, 0.34676208000051156, -0.07899872395333594, -0.2952173694523167, 0.17637058822190868, -0.10006401906680085, -0.12820435174847994, 0.1314889310768484, 0.2610085602618952, 0.10315608185771606, -0.25233355824695486, 0.08115968320763925, 0.013615906007785714, 0.2021238672159678, -0.031103869201615453, -0.04064440728882245, 0.17564918731331033, 0.18549493301775208, 0.008969664762715554, 0.09501013924487232, -0.03857770956129627, -0.18919310879695797, -0.24203256723693514, -0.09564456598608743, -0.15326988061197697, 0.053857189199430826, -0.08120659781211423, -0.1268902472274448, 0.3522121546361431, 0.24757717481393993, 0.18368318534365533, 0.042677500322296294, 0.31173782535227, 0.18320389445541443, 0.008402284145132697, 0.05365404653552491, 0.20990480508539924, 0.1266868369657942, 0.10140458544699756, -0.19080210534806272, 0.13178398850810738, 0.04070441745452385]
|
1,803.04304
|
Representation Learning and Recovery in the ReLU Model
|
Rectified linear units, or ReLUs, have become the preferred activation
function for artificial neural networks. In this paper we consider two basic
learning problems assuming that the underlying data follow a generative model
based on a ReLU-network -- a neural network with ReLU activations. As a
primarily theoretical study, we limit ourselves to a single-layer network. The
first problem we study corresponds to dictionary-learning in the presence of
nonlinearity (modeled by the ReLU functions). Given a set of observation
vectors $\mathbf{y}^i \in \mathbb{R}^d, i =1, 2, \dots , n$, we aim to recover
$d\times k$ matrix $A$ and the latent vectors $\{\mathbf{c}^i\} \subset
\mathbb{R}^k$ under the model $\mathbf{y}^i = \mathrm{ReLU}(A\mathbf{c}^i
+\mathbf{b})$, where $\mathbf{b}\in \mathbb{R}^d$ is a random bias. We show
that it is possible to recover the column space of $A$ within an error of
$O(d)$ (in Frobenius norm) under certain conditions on the probability
distribution of $\mathbf{b}$.
The second problem we consider is that of robust recovery of the signal in
the presence of outliers, i.e., large but sparse noise. In this setting we are
interested in recovering the latent vector $\mathbf{c}$ from its noisy
nonlinear sketches of the form $\mathbf{v} = \mathrm{ReLU}(A\mathbf{c}) +
\mathbf{e}+\mathbf{w}$, where $\mathbf{e} \in \mathbb{R}^d$ denotes the
outliers with sparsity $s$ and $\mathbf{w} \in \mathbb{R}^d$ denote the dense
but small noise. This line of work has recently been studied (Soltanolkotabi,
2017) without the presence of outliers. For this problem, we show that a
generalized LASSO algorithm is able to recover the signal $\mathbf{c} \in
\mathbb{R}^k$ within an $\ell_2$ error of $O(\sqrt{\frac{(k+s)\log d}{d}})$
when $A$ is a random Gaussian matrix.
|
stat.ML cs.IT cs.LG math.IT
|
rectified linear units or relus have become the preferred activation function for artificial neural networks in this paper we consider two basic learning problems assuming that the underlying data follow a generative model based on a relunetwork a neural network with relu activations as a primarily theoretical study we limit ourselves to a singlelayer network the first problem we study corresponds to dictionarylearning in the presence of nonlinearity modeled by the relu functions given a set of observation vectors mathbfyi in mathbbrd i 1 2 dots n we aim to recover dtimes k matrix a and the latent vectors mathbfci subset mathbbrk under the model mathbfyi mathrmreluamathbfci mathbfb where mathbfbin mathbbrd is a random bias we show that it is possible to recover the column space of a within an error of od in frobenius norm under certain conditions on the probability distribution of mathbfb the second problem we consider is that of robust recovery of the signal in the presence of outliers ie large but sparse noise in this setting we are interested in recovering the latent vector mathbfc from its noisy nonlinear sketches of the form mathbfv mathrmreluamathbfc mathbfemathbfw where mathbfe in mathbbrd denotes the outliers with sparsity s and mathbfw in mathbbrd denote the dense but small noise this line of work has recently been studied soltanolkotabi 2017 without the presence of outliers for this problem we show that a generalized lasso algorithm is able to recover the signal mathbfc in mathbbrk within an ell_2 error of osqrtfrackslog dd when a is a random gaussian matrix
|
[['rectified', 'linear', 'units', 'or', 'relus', 'have', 'become', 'the', 'preferred', 'activation', 'function', 'for', 'artificial', 'neural', 'networks', 'in', 'this', 'paper', 'we', 'consider', 'two', 'basic', 'learning', 'problems', 'assuming', 'that', 'the', 'underlying', 'data', 'follow', 'a', 'generative', 'model', 'based', 'on', 'a', 'relunetwork', 'a', 'neural', 'network', 'with', 'relu', 'activations', 'as', 'a', 'primarily', 'theoretical', 'study', 'we', 'limit', 'ourselves', 'to', 'a', 'singlelayer', 'network', 'the', 'first', 'problem', 'we', 'study', 'corresponds', 'to', 'dictionarylearning', 'in', 'the', 'presence', 'of', 'nonlinearity', 'modeled', 'by', 'the', 'relu', 'functions', 'given', 'a', 'set', 'of', 'observation', 'vectors', 'mathbfyi', 'in', 'mathbbrd', 'i', '1', '2', 'dots', 'n', 'we', 'aim', 'to', 'recover', 'dtimes', 'k', 'matrix', 'a', 'and', 'the', 'latent', 'vectors', 'mathbfci', 'subset', 'mathbbrk', 'under', 'the', 'model', 'mathbfyi', 'mathrmreluamathbfci', 'mathbfb', 'where', 'mathbfbin', 'mathbbrd', 'is', 'a', 'random', 'bias', 'we', 'show', 'that', 'it', 'is', 'possible', 'to', 'recover', 'the', 'column', 'space', 'of', 'a', 'within', 'an', 'error', 'of', 'od', 'in', 'frobenius', 'norm', 'under', 'certain', 'conditions', 'on', 'the', 'probability', 'distribution', 'of', 'mathbfb', 'the', 'second', 'problem', 'we', 'consider', 'is', 'that', 'of', 'robust', 'recovery', 'of', 'the', 'signal', 'in', 'the', 'presence', 'of', 'outliers', 'ie', 'large', 'but', 'sparse', 'noise', 'in', 'this', 'setting', 'we', 'are', 'interested', 'in', 'recovering', 'the', 'latent', 'vector', 'mathbfc', 'from', 'its', 'noisy', 'nonlinear', 'sketches', 'of', 'the', 'form', 'mathbfv', 'mathrmreluamathbfc', 'mathbfemathbfw', 'where', 'mathbfe', 'in', 'mathbbrd', 'denotes', 'the', 'outliers', 'with', 'sparsity', 's', 'and', 'mathbfw', 'in', 'mathbbrd', 'denote', 'the', 'dense', 'but', 'small', 'noise', 'this', 'line', 'of', 'work', 'has', 'recently', 'been', 'studied', 'soltanolkotabi', '2017', 'without', 'the', 'presence', 'of', 'outliers', 'for', 'this', 'problem', 'we', 'show', 'that', 'a', 'generalized', 'lasso', 'algorithm', 'is', 'able', 'to', 'recover', 'the', 'signal', 'mathbfc', 'in', 'mathbbrk', 'within', 'an', 'ell_2', 'error', 'of', 'osqrtfrackslog', 'dd', 'when', 'a', 'is', 'a', 'random', 'gaussian', 'matrix']]
|
[-0.11466044374942107, 0.0659902865809272, -0.012249249189889747, 0.03282364860079103, -0.049033466236858024, -0.14817945260992496, 0.032152450001578674, 0.4018144281691916, -0.3236796343902362, -0.20282985590257874, 0.08825748626490139, -0.273466886542294, -0.20565618009543016, 0.10953387686574373, -0.12168198384460993, 0.07916475081098422, 0.03822552923174087, 0.08548182794742937, -0.06925922040924586, -0.26227165119896184, 0.3269017535046534, -0.005394487392752328, 0.2336045951066938, -0.05611926628256379, 0.13566757952064526, 0.006045128565303804, 0.0001487176216739629, 0.0021789490173908972, -0.07942295847204237, 0.11477977745022462, 0.2487564064841348, 0.14015023500819335, 0.34025703290004344, -0.4108074014962074, -0.220484164488014, 0.18989370503861988, 0.11530089669857203, 0.0671000517455497, 0.0007532887273497643, -0.28692344400758246, 0.13082677099321569, -0.10889956027376539, -0.046716744453454064, -0.04718710448489421, 0.03194928278274361, 0.009672753494611705, -0.3664167294600269, 0.08133842540897489, 0.11032153236859206, 0.02596618638499566, -0.04977069083011768, -0.12883356195275805, 0.034965680137882746, 0.0672829045720319, 0.012154182447822735, 0.09170481093072642, 0.10487074429531479, -0.13172059587483842, -0.07056230652360393, 0.3588416825699073, -0.07825716874480898, -0.25641141877794227, 0.09602750806383455, -0.14272015371141836, -0.15570694027967022, 0.09008485835511237, 0.2277924986519215, 0.10350486574627991, -0.13201918960297165, 0.13633311136361462, -0.12085475925298866, 0.14726060040901223, 0.048761222744360566, -0.0019291711426968317, 0.11339883581321272, 0.16394904377918307, 0.09220601538277512, 0.15703046592222694, -0.12512142886222888, -0.03037563064860897, -0.2966660495684852, -0.096869857405499, -0.24563129628003236, 0.0607984920091454, -0.11870947030605286, -0.17362546976581808, 0.35991283512530137, 0.15412205951620958, 0.29165622749779785, 0.10574496427314385, 0.2721299878765075, 0.11150282820496599, 0.030144524459342754, 0.1043161820384234, 0.1522258789988146, 0.16286732972089557, 0.0434433994352788, -0.15839483779644878, 0.07477131213748917, 0.04288425876219417]
|
1,803.04305
|
Light Transport Simulation via Generalized Multiple Importance Sampling
|
Multiple importance sampling (MIS) is employed to reduce variance of
estimators, but when sampling and weighting are not suitable to the integrand,
the estimators would have extra variance. Therefore, robust light transport
simulation algorithms based on Monte Carlo sampling for different types of
scenes are still uncompleted. In this paper, we address this problem by present
a general method, named generalized multiple importance sampling (GMIS), to
enhance the robustness of light transport simulation based on MIS. GMIS
combines different sampling techniques and weighting functions, extending MIS
to a more generalized framework. Meanwhile, we implement the GMIS in common
renderers and illustrate how it increase the robustness of light transport
simulation. Experiments show that, by applying GMIS, we obtain better
convergence performance and lower variance, and increase the rendering of
ambient light and specular shadow effects apparently.
|
cs.GR
|
multiple importance sampling mis is employed to reduce variance of estimators but when sampling and weighting are not suitable to the integrand the estimators would have extra variance therefore robust light transport simulation algorithms based on monte carlo sampling for different types of scenes are still uncompleted in this paper we address this problem by present a general method named generalized multiple importance sampling gmis to enhance the robustness of light transport simulation based on mis gmis combines different sampling techniques and weighting functions extending mis to a more generalized framework meanwhile we implement the gmis in common renderers and illustrate how it increase the robustness of light transport simulation experiments show that by applying gmis we obtain better convergence performance and lower variance and increase the rendering of ambient light and specular shadow effects apparently
|
[['multiple', 'importance', 'sampling', 'mis', 'is', 'employed', 'to', 'reduce', 'variance', 'of', 'estimators', 'but', 'when', 'sampling', 'and', 'weighting', 'are', 'not', 'suitable', 'to', 'the', 'integrand', 'the', 'estimators', 'would', 'have', 'extra', 'variance', 'therefore', 'robust', 'light', 'transport', 'simulation', 'algorithms', 'based', 'on', 'monte', 'carlo', 'sampling', 'for', 'different', 'types', 'of', 'scenes', 'are', 'still', 'uncompleted', 'in', 'this', 'paper', 'we', 'address', 'this', 'problem', 'by', 'present', 'a', 'general', 'method', 'named', 'generalized', 'multiple', 'importance', 'sampling', 'gmis', 'to', 'enhance', 'the', 'robustness', 'of', 'light', 'transport', 'simulation', 'based', 'on', 'mis', 'gmis', 'combines', 'different', 'sampling', 'techniques', 'and', 'weighting', 'functions', 'extending', 'mis', 'to', 'a', 'more', 'generalized', 'framework', 'meanwhile', 'we', 'implement', 'the', 'gmis', 'in', 'common', 'renderers', 'and', 'illustrate', 'how', 'it', 'increase', 'the', 'robustness', 'of', 'light', 'transport', 'simulation', 'experiments', 'show', 'that', 'by', 'applying', 'gmis', 'we', 'obtain', 'better', 'convergence', 'performance', 'and', 'lower', 'variance', 'and', 'increase', 'the', 'rendering', 'of', 'ambient', 'light', 'and', 'specular', 'shadow', 'effects', 'apparently']]
|
[-0.060421100592494066, 0.08668296745129149, -0.12759405019802644, 0.10733959362979102, -0.07588906516834601, -0.1495996170252671, 0.07245081098517403, 0.4195955346667153, -0.26589123985510976, -0.3450324711636366, 0.1163756147502949, -0.2294033039635157, -0.1778689959576107, 0.2263050632986158, -0.14110930094166713, 0.0889211438856471, 0.08816428703036816, -0.08959196868304656, -0.07025515210219002, -0.2996711869765183, 0.2616226201746887, 0.10212394253261771, 0.36008878437774805, 0.029853787370323997, 0.11686408663552035, 0.05232400378137005, -0.07519366132670685, 0.042408136664615834, -0.09535846539272504, 0.12969754656617571, 0.2229221519699101, 0.1394868881582036, 0.2910593444591059, -0.39191454036763923, -0.23280811200247092, 0.1070574577726588, 0.18986229168470292, 0.08986411257030662, -0.0789887860083742, -0.23756738780888126, 0.07514118549742681, -0.13485610752832144, -0.06924838837756611, -0.13639315745026312, -0.0846985761582961, 0.031701178610948025, -0.29481859219682144, 0.06882065588519361, 0.013239445565405357, 0.02068312939338605, 0.02066041563076022, -0.15289278014011765, 0.03557966931325877, 0.09117858387424563, 0.03263930577582762, 0.005485205299919471, 0.12246993365903001, -0.08930421536719865, -0.15225190438521916, 0.331421696827473, -0.014041065231568235, -0.24845648521509514, 0.18037979673553148, -0.09019493563990931, -0.1249120682135553, 0.14307256483965936, 0.21046230543031605, 0.1300987472435843, -0.1643184590011515, 0.03209097020290381, -0.00033219394561670283, 0.10810614151962321, 0.04506906690521111, 0.048569329420655886, 0.12496917270404725, 0.19159678165520103, 0.09697505806209794, 0.147449277478325, -0.12056210006224266, -0.10754620367729598, -0.22573391136607182, -0.1157910806222764, -0.18793597821872132, -0.021124801557294525, -0.1281649463577624, -0.15691271610558033, 0.38568986826302376, 0.29544196412076845, 0.13730976952116608, 0.0868526065023616, 0.3587481675272369, 0.10457827098777189, 0.028679518371491748, 0.10450443416244953, 0.18895863927130396, 0.10738317428416956, 0.05011845725205015, -0.23455288263657542, 0.09950040728161934, 0.039860401445313234]
|
1,803.04306
|
On the classification of consistent boundary conditions for $
\mathit{f}(\mathit{R})$-Gravity
|
Using a completely covariant approach, we discuss the role of boundary
conditions (BCs) and the corresponding Gibbons--Hawking--York (GHY) terms in $
\mathit{f}(\mathit{R}) $-gravity in arbitrary dimensions. We show that $
f(\mathit{R}) $-gravity, as a higher derivative theory, is not described by a
degenerate Lagrangian, in its original form. Hence, without introducing
additional variables, one can not obtain consistent BCs, even by adding the GHY
terms (except for $f(\mathit{R})=R$).
However, following the Ostrogradsky approach, we can introduce a scalar field
in the framework of Brans-Dicke formalism to the system to have consistent BCs
by considering appropriate GHY terms. In addition to the Dirichlet BC, the GHY
terms for both Neumann and two types of mixed BCs are derived. We show the
remarkable result that the $f(\mathit{R})$-gravity is itself compatible with
one type of mixed BCs, in $D$ dimension, i.e. it doesn't require any GHY term.
For each BC, we rewrite the GHY term in terms of Arnowit-Deser-Misner (ADM)
variables.
|
gr-qc
|
using a completely covariant approach we discuss the role of boundary conditions bcs and the corresponding gibbonshawkingyork ghy terms in mathitfmathitr gravity in arbitrary dimensions we show that fmathitr gravity as a higher derivative theory is not described by a degenerate lagrangian in its original form hence without introducing additional variables one can not obtain consistent bcs even by adding the ghy terms except for fmathitrr however following the ostrogradsky approach we can introduce a scalar field in the framework of bransdicke formalism to the system to have consistent bcs by considering appropriate ghy terms in addition to the dirichlet bc the ghy terms for both neumann and two types of mixed bcs are derived we show the remarkable result that the fmathitrgravity is itself compatible with one type of mixed bcs in d dimension ie it doesnt require any ghy term for each bc we rewrite the ghy term in terms of arnowitdesermisner adm variables
|
[['using', 'a', 'completely', 'covariant', 'approach', 'we', 'discuss', 'the', 'role', 'of', 'boundary', 'conditions', 'bcs', 'and', 'the', 'corresponding', 'gibbonshawkingyork', 'ghy', 'terms', 'in', 'mathitfmathitr', 'gravity', 'in', 'arbitrary', 'dimensions', 'we', 'show', 'that', 'fmathitr', 'gravity', 'as', 'a', 'higher', 'derivative', 'theory', 'is', 'not', 'described', 'by', 'a', 'degenerate', 'lagrangian', 'in', 'its', 'original', 'form', 'hence', 'without', 'introducing', 'additional', 'variables', 'one', 'can', 'not', 'obtain', 'consistent', 'bcs', 'even', 'by', 'adding', 'the', 'ghy', 'terms', 'except', 'for', 'fmathitrr', 'however', 'following', 'the', 'ostrogradsky', 'approach', 'we', 'can', 'introduce', 'a', 'scalar', 'field', 'in', 'the', 'framework', 'of', 'bransdicke', 'formalism', 'to', 'the', 'system', 'to', 'have', 'consistent', 'bcs', 'by', 'considering', 'appropriate', 'ghy', 'terms', 'in', 'addition', 'to', 'the', 'dirichlet', 'bc', 'the', 'ghy', 'terms', 'for', 'both', 'neumann', 'and', 'two', 'types', 'of', 'mixed', 'bcs', 'are', 'derived', 'we', 'show', 'the', 'remarkable', 'result', 'that', 'the', 'fmathitrgravity', 'is', 'itself', 'compatible', 'with', 'one', 'type', 'of', 'mixed', 'bcs', 'in', 'd', 'dimension', 'ie', 'it', 'doesnt', 'require', 'any', 'ghy', 'term', 'for', 'each', 'bc', 'we', 'rewrite', 'the', 'ghy', 'term', 'in', 'terms', 'of', 'arnowitdesermisner', 'adm', 'variables']]
|
[-0.16520682391433034, 0.09555314759036143, -0.08279320926618275, 0.08411966258234388, -0.08086340758326581, -0.18482400152819933, 0.001506491862576677, 0.2691213095495909, -0.21877504438655265, -0.26652138249714247, 0.08201776680440968, -0.2207974000581053, -0.14294100056605918, 0.1319770387571231, -0.10723710889443878, 0.0014812790858867695, 0.031882456469886154, 0.10881529817980597, -0.13511422342799653, -0.2662030875510135, 0.3949151623235485, -0.03223782166567267, 0.21602548763236118, 0.031661439300761464, 0.08335079665647338, 0.03203872974117021, 0.009599131334647043, 0.07061723208005559, -0.108395045605162, 0.09226832129153738, 0.21897413863936155, 0.0693795897193031, 0.2319677230926687, -0.42743328995755964, -0.2607200248475304, 0.08273066221643856, 0.13048636397988295, 0.1172629647953004, 0.03790387354285413, -0.26241251141671706, 0.08269191661692342, -0.21185113084410004, -0.14904471211573295, -0.09350230420526388, -0.044218570205987434, -0.05615417222609583, -0.3060529329166408, 0.1291032413881124, 0.06927571163839655, 0.011776922030115364, -0.1158760693826287, -0.1367963092233554, -0.012738716053091828, 0.05489756928260333, 0.06419424001213829, 0.04409385315876528, 0.037520599866051545, -0.1537223118018137, -0.061821359982991604, 0.3812546688810435, -0.1426533002156567, -0.2707033490897804, 0.15341579097952224, -0.11543167191588424, -0.10181482775839946, 0.05648955596450302, 0.04747261069807539, 0.09470066072308267, -0.18044915847134907, 0.15709262491680492, -0.020408445703241948, 0.12439708511918685, 0.09489673803196541, 0.05871328719527714, 0.1840547477234377, 0.06875739020984682, 0.05525763068712063, 0.15262874184694414, -0.01582210077534103, -0.13099599971947884, -0.3939620656645949, -0.15821334121065828, -0.15507889631827246, 0.016552410299915957, -0.10540867724709539, -0.1572263175266986, 0.3431330670476182, 0.12269231812744741, 0.15050822098597588, 0.05411248820038229, 0.24213247509389524, 0.17502492441663162, 0.10024876691615332, 0.07865735394833918, 0.23192340178131465, 0.12699024765813932, 0.10930449838691471, -0.23638841219782977, 0.028976714651760282, 0.12009402285854252]
|
1,803.04307
|
The Everlasting Database: Statistical Validity at a Fair Price
|
The problem of handling adaptivity in data analysis, intentional or not,
permeates a variety of fields, including test-set overfitting in ML challenges
and the accumulation of invalid scientific discoveries. We propose a mechanism
for answering an arbitrarily long sequence of potentially adaptive statistical
queries, by charging a price for each query and using the proceeds to collect
additional samples. Crucially, we guarantee statistical validity without any
assumptions on how the queries are generated. We also ensure with high
probability that the cost for $M$ non-adaptive queries is $O(\log M)$, while
the cost to a potentially adaptive user who makes $M$ queries that do not
depend on any others is $O(\sqrt{M})$.
|
cs.LG
|
the problem of handling adaptivity in data analysis intentional or not permeates a variety of fields including testset overfitting in ml challenges and the accumulation of invalid scientific discoveries we propose a mechanism for answering an arbitrarily long sequence of potentially adaptive statistical queries by charging a price for each query and using the proceeds to collect additional samples crucially we guarantee statistical validity without any assumptions on how the queries are generated we also ensure with high probability that the cost for m nonadaptive queries is olog m while the cost to a potentially adaptive user who makes m queries that do not depend on any others is osqrtm
|
[['the', 'problem', 'of', 'handling', 'adaptivity', 'in', 'data', 'analysis', 'intentional', 'or', 'not', 'permeates', 'a', 'variety', 'of', 'fields', 'including', 'testset', 'overfitting', 'in', 'ml', 'challenges', 'and', 'the', 'accumulation', 'of', 'invalid', 'scientific', 'discoveries', 'we', 'propose', 'a', 'mechanism', 'for', 'answering', 'an', 'arbitrarily', 'long', 'sequence', 'of', 'potentially', 'adaptive', 'statistical', 'queries', 'by', 'charging', 'a', 'price', 'for', 'each', 'query', 'and', 'using', 'the', 'proceeds', 'to', 'collect', 'additional', 'samples', 'crucially', 'we', 'guarantee', 'statistical', 'validity', 'without', 'any', 'assumptions', 'on', 'how', 'the', 'queries', 'are', 'generated', 'we', 'also', 'ensure', 'with', 'high', 'probability', 'that', 'the', 'cost', 'for', 'm', 'nonadaptive', 'queries', 'is', 'olog', 'm', 'while', 'the', 'cost', 'to', 'a', 'potentially', 'adaptive', 'user', 'who', 'makes', 'm', 'queries', 'that', 'do', 'not', 'depend', 'on', 'any', 'others', 'is', 'osqrtm']]
|
[-0.1323870287160389, 0.05806480437128233, -0.06270671715451913, 0.09332499368835918, -0.1365824429572306, -0.19222328342836012, 0.1743414927284572, 0.3968530049568719, -0.26027605638585305, -0.37187736566940494, 0.10536357935899023, -0.2692444509149275, -0.10888059340332719, 0.18341880098345098, -0.14831377718735234, 0.06024455349066887, 0.07816142220558091, 0.018813519116321748, -0.02565832359144803, -0.34475697502811353, 0.2964079251449386, 0.08706034213643182, 0.24993796166540547, 0.03791923701170493, 0.08512850964378396, 0.038462158300998535, -0.04189456051575358, 0.0056850052920212465, -0.09607749776769196, 0.10491505375195465, 0.2959578818112442, 0.23304486654021522, 0.3752459487962452, -0.4274673188105226, -0.18486915628679773, 0.12112423217093403, 0.12064781747758388, 0.09037661926439879, -0.05353021408134902, -0.24808367675762963, 0.14201608200303534, -0.12079937263624743, -0.032384273515675556, -0.10475338062864135, 0.012936096494509415, 0.02955271318840625, -0.35312414993532004, -0.015205172417865304, 0.0919470671532591, 0.05018800413818099, -0.011558126670901071, -0.06612391432916576, 0.037422138562595304, 0.13724086080804807, 0.04532942404885861, 0.024490634720264512, 0.13350342409261926, -0.13520059827185998, -0.1515682548453862, 0.36147544531320985, -0.02229669530537318, -0.21769623055165124, 0.1835380135199309, -0.09231468060223216, -0.14646830136718397, 0.1367332017133859, 0.17704077117483724, 0.11453566606452859, -0.126151795651425, 0.1191391443992457, -0.020727198376235635, 0.22592508088458668, 0.07485063418491998, 0.050460562046447936, 0.15718843613497235, 0.16992507739500565, 0.11666508524742147, 0.05675645399394191, -0.04376016094941985, -0.039086519232527775, -0.25951275315813044, -0.1568824232217263, -0.21624411522961137, 0.046851888905670915, -0.1445241177197948, -0.1812498648227616, 0.31854893422092906, 0.20801360333677044, 0.19920675619082018, 0.10944702634323304, 0.31368275884200225, 0.0310789541172033, 0.06359042957086455, 0.1427708304995163, 0.12816390046341852, -0.01977258511945944, 0.08818834023338488, -0.1657521505702541, 0.1801405585328625, 0.010980943866624413]
|
1,803.04308
|
Perturbative generation of photon Lorentz violating terms from a
pseudo-tensor Lorentz-breaking extension of QED
|
We consider an extended QED with the addition of a dimension-five
Lorentz-breaking coupling between spinor and gauge fields, involving a
pseudo-tensor $\kappa^{\mu\nu\lambda\rho}$. The specific form of the Lorentz
violating coupling considered by us have been suggested in other works, and
some of its consequences at the classical level were already studied. Here, we
investigate the consequences of this specific form of Lorentz violation at the
quantum level, evaluating the one loop corrections to the gauge field two-point
function, both at zero and at finite temperature. We relate the terms that are
generated by quantum corrections with the photon sector of the Standard Model
Extension, discussing the possibility of establishing experimental bounds on
$k^{\mu\nu\rho\sigma}$. From the dispersion relations in the resulting theory,
we discuss its consistency from the causality viewpoint.
|
hep-th hep-ph
|
we consider an extended qed with the addition of a dimensionfive lorentzbreaking coupling between spinor and gauge fields involving a pseudotensor kappamunulambdarho the specific form of the lorentz violating coupling considered by us have been suggested in other works and some of its consequences at the classical level were already studied here we investigate the consequences of this specific form of lorentz violation at the quantum level evaluating the one loop corrections to the gauge field twopoint function both at zero and at finite temperature we relate the terms that are generated by quantum corrections with the photon sector of the standard model extension discussing the possibility of establishing experimental bounds on kmunurhosigma from the dispersion relations in the resulting theory we discuss its consistency from the causality viewpoint
|
[['we', 'consider', 'an', 'extended', 'qed', 'with', 'the', 'addition', 'of', 'a', 'dimensionfive', 'lorentzbreaking', 'coupling', 'between', 'spinor', 'and', 'gauge', 'fields', 'involving', 'a', 'pseudotensor', 'kappamunulambdarho', 'the', 'specific', 'form', 'of', 'the', 'lorentz', 'violating', 'coupling', 'considered', 'by', 'us', 'have', 'been', 'suggested', 'in', 'other', 'works', 'and', 'some', 'of', 'its', 'consequences', 'at', 'the', 'classical', 'level', 'were', 'already', 'studied', 'here', 'we', 'investigate', 'the', 'consequences', 'of', 'this', 'specific', 'form', 'of', 'lorentz', 'violation', 'at', 'the', 'quantum', 'level', 'evaluating', 'the', 'one', 'loop', 'corrections', 'to', 'the', 'gauge', 'field', 'twopoint', 'function', 'both', 'at', 'zero', 'and', 'at', 'finite', 'temperature', 'we', 'relate', 'the', 'terms', 'that', 'are', 'generated', 'by', 'quantum', 'corrections', 'with', 'the', 'photon', 'sector', 'of', 'the', 'standard', 'model', 'extension', 'discussing', 'the', 'possibility', 'of', 'establishing', 'experimental', 'bounds', 'on', 'kmunurhosigma', 'from', 'the', 'dispersion', 'relations', 'in', 'the', 'resulting', 'theory', 'we', 'discuss', 'its', 'consistency', 'from', 'the', 'causality', 'viewpoint']]
|
[-0.12427671255147833, 0.17609940650499348, -0.062111539289531274, 0.10111377406847025, -0.06557870113958172, -0.1036728743947749, 0.03791803693468499, 0.297759270420166, -0.2191134804610427, -0.28659362145186235, 0.05612032179533702, -0.27618213579439976, -0.12325265736678453, 0.1689325929454374, 0.0316565647541626, 0.03836059761618623, -0.04364266252973828, 0.07314887952323504, -0.11577788300951576, -0.22483477627264525, 0.3696550992170833, 0.04913034285492022, 0.26299759840196746, 0.1054999000268189, 0.09958100599038788, 0.003564408800645372, -0.03861407482607921, 0.025111500610135437, -0.12422527209150937, 0.10187297977239451, 0.15320251799210555, 0.07579551492404059, 0.21102368159175622, -0.42824192388408533, -0.2068406495661658, 0.0921358548134096, 0.0724503464857483, 0.13045459168809137, -0.04536673277488169, -0.3148108626840504, 0.03242779859913674, -0.1880874729011296, -0.15025845984194985, -0.08193081380491417, -0.03762926704591272, -0.057566093258911696, -0.23258540534421684, 0.07537167905793181, 0.016553654406021724, 0.06064744086892117, -0.020311728633177564, -0.09522952544172918, 0.005709543662864392, 0.11337158717875054, 0.11364086383887691, 0.0007235887189997052, 0.09830524239645112, -0.1955734772560018, -0.14918650179646734, 0.40556890550747837, -0.09767700204493728, -0.21048356095460927, 0.16977504994280226, -0.17519047318528752, -0.15933943712922533, 0.03656060964705085, 0.13082584114671927, 0.07660969324395295, -0.1542522830917962, 0.1930446433710983, -0.018301733061817923, 0.08707193920194486, 0.10301589734456319, 0.08596984882597027, 0.2136426037690771, 0.07867587737255091, -0.0062832639416987735, 0.15235982834238662, -0.05595058738254011, -0.12254321633830784, -0.416790074382828, -0.14693714739061803, -0.12004431545909487, 0.05285058868682291, -0.09058756785667556, -0.10718788556281594, 0.399743535049905, 0.16109162382575257, 0.16998750889512498, 0.04582184043852246, 0.2554715944813403, 0.18630261491162806, 0.10869770522658369, 0.036615400245105185, 0.31470764897452985, 0.17751773627929565, 0.0547149295874644, -0.2803365726731571, -0.006674434417697389, 0.07499888187318336]
|
1,803.04309
|
Electrical initialization of electron and nuclear spins in a single
quantum dot at zero magnetic field
|
The emission of circularly polarized light from a single quantum dot relies
on the injection of carriers with well-defined spin polarization. Here we
demonstrate single dot electroluminescence (EL) with a circular polarization
degree up to 35% at zero applied magnetic field. The injection of spin
polarized electrons is achieved by combining ultrathin CoFeB electrodes on top
of a spin-LED device with p-type InGaAs quantum dots in the active region. We
measure an Overhauser shift of several $\mu$eV at zero magnetic field for the
positively charged exciton (trion X$^+$) EL emission, which changes sign as we
reverse the injected electron spin orientation. This is a signature of dynamic
polarization of the nuclear spins in the quantum dot induced by the hyperfine
interaction with the electrically injected electron spin. This study paves the
way for electrical control of nuclear spin polarization in a single quantum dot
without any external magnetic field.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
the emission of circularly polarized light from a single quantum dot relies on the injection of carriers with welldefined spin polarization here we demonstrate single dot electroluminescence el with a circular polarization degree up to 35 at zero applied magnetic field the injection of spin polarized electrons is achieved by combining ultrathin cofeb electrodes on top of a spinled device with ptype ingaas quantum dots in the active region we measure an overhauser shift of several muev at zero magnetic field for the positively charged exciton trion x el emission which changes sign as we reverse the injected electron spin orientation this is a signature of dynamic polarization of the nuclear spins in the quantum dot induced by the hyperfine interaction with the electrically injected electron spin this study paves the way for electrical control of nuclear spin polarization in a single quantum dot without any external magnetic field
|
[['the', 'emission', 'of', 'circularly', 'polarized', 'light', 'from', 'a', 'single', 'quantum', 'dot', 'relies', 'on', 'the', 'injection', 'of', 'carriers', 'with', 'welldefined', 'spin', 'polarization', 'here', 'we', 'demonstrate', 'single', 'dot', 'electroluminescence', 'el', 'with', 'a', 'circular', 'polarization', 'degree', 'up', 'to', '35', 'at', 'zero', 'applied', 'magnetic', 'field', 'the', 'injection', 'of', 'spin', 'polarized', 'electrons', 'is', 'achieved', 'by', 'combining', 'ultrathin', 'cofeb', 'electrodes', 'on', 'top', 'of', 'a', 'spinled', 'device', 'with', 'ptype', 'ingaas', 'quantum', 'dots', 'in', 'the', 'active', 'region', 'we', 'measure', 'an', 'overhauser', 'shift', 'of', 'several', 'muev', 'at', 'zero', 'magnetic', 'field', 'for', 'the', 'positively', 'charged', 'exciton', 'trion', 'x', 'el', 'emission', 'which', 'changes', 'sign', 'as', 'we', 'reverse', 'the', 'injected', 'electron', 'spin', 'orientation', 'this', 'is', 'a', 'signature', 'of', 'dynamic', 'polarization', 'of', 'the', 'nuclear', 'spins', 'in', 'the', 'quantum', 'dot', 'induced', 'by', 'the', 'hyperfine', 'interaction', 'with', 'the', 'electrically', 'injected', 'electron', 'spin', 'this', 'study', 'paves', 'the', 'way', 'for', 'electrical', 'control', 'of', 'nuclear', 'spin', 'polarization', 'in', 'a', 'single', 'quantum', 'dot', 'without', 'any', 'external', 'magnetic', 'field']]
|
[-0.1631462526985838, 0.24253540889029127, 0.009476397986580062, -0.018728784498783617, 0.023608570719987853, -0.1872662255140459, 0.03461701813741468, 0.4389154999798176, -0.27216604801407396, -0.3132499855686754, -0.06628051947336644, -0.29181727172256816, 0.003989400260850487, 0.2338239469834222, 0.06673813654534087, -0.01095881884380075, -0.04046447009110711, -0.038507984607361705, -0.052057638664373615, -0.14605324667090888, 0.2840976656121382, 0.022071193325514563, 0.30197226841490243, 0.0984864522884256, 0.1305734454935429, 0.07718680822603005, 0.12271172133268125, -0.0007605553751548864, -0.06325425043852137, 0.08927280630963431, 0.20887796117044397, -0.09426348753298489, 0.1753708263296609, -0.4453574587347223, -0.16326750505749987, 0.01425693182887247, 0.11364794770043168, 0.18055127734621523, -0.12175934355637222, -0.3044277385389745, 0.03520043109287352, -0.14377746170208142, -0.10666936427517325, -0.008308798199732032, -0.009240727917167776, 0.008905456198266888, -0.25395510389450815, 0.06444906660014976, 0.07826462854793757, 0.05737317467870928, -0.041027770180805216, -0.06105290023721723, -0.05067132172743546, 0.05081152120111323, 0.00925940584591371, 0.11264412336195226, 0.29584841583324156, -0.12313448256131687, -0.21272294105799405, 0.26433517037337684, -0.11856724900012248, -0.12907283266360917, 0.08550139871307168, -0.28519933046335544, -0.019749980244860552, 0.16670458476237277, 0.12685979902744293, 0.1563244100985111, -0.1348322664681297, 0.09814716325041482, 0.004490411415346117, 0.20591532616507288, 0.06400733673007496, 0.10064294587995783, 0.3323618499812164, 0.17433536657751006, 0.08668160119762756, 0.14826196301165942, -0.20378488209411103, -0.032059417867207986, -0.21486797252194895, -0.1937995726102416, -0.2107583501184009, 0.21283714105718887, -0.06231502086336681, -0.1388849453881833, 0.4742241206941439, 0.09266192459145048, 0.13942020295200333, -0.11173134060199966, 0.3146716146198595, 0.12053384735552132, 0.04395056576483677, 0.02403763655398116, 0.27109214425987044, 0.256885670350502, 0.11358795205643712, -0.3527901847549908, 0.030788891567479843, -0.08244607425232311]
|
1,803.0431
|
Les Houches Lectures on Soft-Collinear Effective Theory
|
These lectures provide an introduction to Soft-Collinear Effective Theory. As
applications we discuss resummation for (i) soft-photon effects in QED, (ii)
event-shape variables and (iii) jet cross sections.
|
hep-ph
|
these lectures provide an introduction to softcollinear effective theory as applications we discuss resummation for i softphoton effects in qed ii eventshape variables and iii jet cross sections
|
[['these', 'lectures', 'provide', 'an', 'introduction', 'to', 'softcollinear', 'effective', 'theory', 'as', 'applications', 'we', 'discuss', 'resummation', 'for', 'i', 'softphoton', 'effects', 'in', 'qed', 'ii', 'eventshape', 'variables', 'and', 'iii', 'jet', 'cross', 'sections']]
|
[-0.006003224631837968, 0.1526786491787269, -0.11988097043441874, 0.21477191921855723, -0.07722098879250032, -0.12443438514934055, -0.0753299424499606, 0.3815778316264706, -0.1433073711315436, -0.25338915816142354, 0.007607330963115341, -0.3009172395603465, -0.05149141797197184, 0.10595719838914062, -0.03598694310390523, 0.041825361882469485, 0.02107163763139397, -0.0997719025378631, -0.07267873326782137, -0.23037455689960293, 0.3331259325579075, 0.09045583831279405, 0.1862303877382406, 0.22979789766083872, 0.06401152373291552, 0.15625931565383716, -0.15056625756967282, 0.003346831604306187, -0.16248168177636607, 0.07716175619446274, 0.38147499931177925, 0.10113299199396611, 0.16298684790464385, -0.4478688317217997, -0.08830005472659, -0.06508568132163159, 0.15469026901493116, 0.11726931861734816, -0.006168402398803404, -0.2461211739906243, -0.005803380627185106, -0.3265940271584051, -0.17384112919015543, -0.17448306479491293, 0.03283493160935385, -0.034367755720657964, -0.30973334663680624, -0.017096909500001596, -0.013885189878887363, 0.08773679176478513, 0.04799638991555964, -0.1702126142169748, 0.05618968208520008, -0.013023906853049994, 0.10974155472857612, 0.0041047800332307816, 0.23023083009424486, -0.24251894463252807, -0.2509835334827325, 0.3422456756234169, -0.05208501372752445, -0.12291202075513345, 0.09349391682605658, -0.09342623277500804, -0.1916718063044495, 0.11713058301912886, 0.31517494895628523, 0.13804923548429673, -0.17663628363516182, 0.1599151232658187, 0.1453868571136679, 0.09318354692576188, 0.04260741027870348, 0.10887530056892761, 0.12806845366555666, 0.07022406411124393, -0.07363561236499143, 0.01736588909157685, -0.08403757118087794, -0.11205771129711398, -0.5993231034704617, -0.12340055332086715, 0.02994954221815403, 0.08287970741678562, -0.10252817873125812, -0.15947473114023783, 0.2939112354735179, 0.1675381435613547, 0.23159996486252307, -0.013472891512459942, 0.31567661134925273, 0.21722963894301625, 0.019853572034792575, 0.0652878019027412, 0.2674179830189262, 0.21520893400468463, 0.106978077158731, -0.18951505163152302, -0.08269361606133836, 0.1887416335438112]
|
1,803.04311
|
Deep Learning in Mobile and Wireless Networking: A Survey
|
The rapid uptake of mobile devices and the rising popularity of mobile
applications and services pose unprecedented demands on mobile and wireless
networking infrastructure. Upcoming 5G systems are evolving to support
exploding mobile traffic volumes, agile management of network resource to
maximize user experience, and extraction of fine-grained real-time analytics.
Fulfilling these tasks is challenging, as mobile environments are increasingly
complex, heterogeneous, and evolving. One potential solution is to resort to
advanced machine learning techniques to help managing the rise in data volumes
and algorithm-driven applications. The recent success of deep learning
underpins new and powerful tools that tackle problems in this space.
In this paper we bridge the gap between deep learning and mobile and wireless
networking research, by presenting a comprehensive survey of the crossovers
between the two areas. We first briefly introduce essential background and
state-of-the-art in deep learning techniques with potential applications to
networking. We then discuss several techniques and platforms that facilitate
the efficient deployment of deep learning onto mobile systems. Subsequently, we
provide an encyclopedic review of mobile and wireless networking research based
on deep learning, which we categorize by different domains. Drawing from our
experience, we discuss how to tailor deep learning to mobile environments. We
complete this survey by pinpointing current challenges and open future
directions for research.
|
cs.NI cs.LG
|
the rapid uptake of mobile devices and the rising popularity of mobile applications and services pose unprecedented demands on mobile and wireless networking infrastructure upcoming 5g systems are evolving to support exploding mobile traffic volumes agile management of network resource to maximize user experience and extraction of finegrained realtime analytics fulfilling these tasks is challenging as mobile environments are increasingly complex heterogeneous and evolving one potential solution is to resort to advanced machine learning techniques to help managing the rise in data volumes and algorithmdriven applications the recent success of deep learning underpins new and powerful tools that tackle problems in this space in this paper we bridge the gap between deep learning and mobile and wireless networking research by presenting a comprehensive survey of the crossovers between the two areas we first briefly introduce essential background and stateoftheart in deep learning techniques with potential applications to networking we then discuss several techniques and platforms that facilitate the efficient deployment of deep learning onto mobile systems subsequently we provide an encyclopedic review of mobile and wireless networking research based on deep learning which we categorize by different domains drawing from our experience we discuss how to tailor deep learning to mobile environments we complete this survey by pinpointing current challenges and open future directions for research
|
[['the', 'rapid', 'uptake', 'of', 'mobile', 'devices', 'and', 'the', 'rising', 'popularity', 'of', 'mobile', 'applications', 'and', 'services', 'pose', 'unprecedented', 'demands', 'on', 'mobile', 'and', 'wireless', 'networking', 'infrastructure', 'upcoming', '5g', 'systems', 'are', 'evolving', 'to', 'support', 'exploding', 'mobile', 'traffic', 'volumes', 'agile', 'management', 'of', 'network', 'resource', 'to', 'maximize', 'user', 'experience', 'and', 'extraction', 'of', 'finegrained', 'realtime', 'analytics', 'fulfilling', 'these', 'tasks', 'is', 'challenging', 'as', 'mobile', 'environments', 'are', 'increasingly', 'complex', 'heterogeneous', 'and', 'evolving', 'one', 'potential', 'solution', 'is', 'to', 'resort', 'to', 'advanced', 'machine', 'learning', 'techniques', 'to', 'help', 'managing', 'the', 'rise', 'in', 'data', 'volumes', 'and', 'algorithmdriven', 'applications', 'the', 'recent', 'success', 'of', 'deep', 'learning', 'underpins', 'new', 'and', 'powerful', 'tools', 'that', 'tackle', 'problems', 'in', 'this', 'space', 'in', 'this', 'paper', 'we', 'bridge', 'the', 'gap', 'between', 'deep', 'learning', 'and', 'mobile', 'and', 'wireless', 'networking', 'research', 'by', 'presenting', 'a', 'comprehensive', 'survey', 'of', 'the', 'crossovers', 'between', 'the', 'two', 'areas', 'we', 'first', 'briefly', 'introduce', 'essential', 'background', 'and', 'stateoftheart', 'in', 'deep', 'learning', 'techniques', 'with', 'potential', 'applications', 'to', 'networking', 'we', 'then', 'discuss', 'several', 'techniques', 'and', 'platforms', 'that', 'facilitate', 'the', 'efficient', 'deployment', 'of', 'deep', 'learning', 'onto', 'mobile', 'systems', 'subsequently', 'we', 'provide', 'an', 'encyclopedic', 'review', 'of', 'mobile', 'and', 'wireless', 'networking', 'research', 'based', 'on', 'deep', 'learning', 'which', 'we', 'categorize', 'by', 'different', 'domains', 'drawing', 'from', 'our', 'experience', 'we', 'discuss', 'how', 'to', 'tailor', 'deep', 'learning', 'to', 'mobile', 'environments', 'we', 'complete', 'this', 'survey', 'by', 'pinpointing', 'current', 'challenges', 'and', 'open', 'future', 'directions', 'for', 'research']]
|
[-0.13016053452587653, 0.011705692903921806, -0.007879140519502538, 0.03720454211267039, -0.1427377486748069, -0.1892067717056273, 0.05203969282565932, 0.45822166004735565, -0.2715772581976597, -0.33005261017414916, 0.10734141221069472, -0.28416571344132535, -0.2181192590009973, 0.22884325543418527, -0.14246735594200868, 0.08606229594658578, 0.09127744258579763, -0.0334960077381294, -0.03519776480351101, -0.28173915048763676, 0.32061877700336344, 0.04073247736394276, 0.4006606341529362, 0.12144256096669576, 0.03918080006648476, -0.0016964370906525463, -0.06351021506297574, -0.03498611136954558, -0.11136196373445273, 0.2696365910922867, 0.4051232238351885, 0.2675145323823758, 0.3769156147631023, -0.4959817451976792, -0.2500683797918976, 0.07754544709610788, 0.18176229165315075, 0.05919319180463423, -0.10398980153183436, -0.35498109909153924, 0.07694349389310917, -0.23239715488765528, -0.09031414938005954, -0.11974308424504232, 0.022440886131436046, 0.06568769958836061, -0.20282808071459402, -0.07103064486161909, -0.03408473038494035, 0.07891670515743533, -0.054732253098403884, -0.06268175535714599, 0.09325763278617093, 0.20639606315159686, 0.037719359364860726, 0.032587791724061524, 0.16308011941146106, -0.22772247213503793, -0.15789328025992425, 0.3602741550022512, 0.02882591268496105, -0.09227895333767971, 0.24171220724087175, 0.017061106156217174, -0.1913316049419033, 0.04524693220392456, 0.323054835519374, 0.055524673259006466, -0.2121706096330416, 0.04128339121854407, 0.08097661303381082, 0.09766955113338083, 0.008285301275598747, 0.05278706240804038, 0.25176537927688547, 0.3040975257495625, 0.12006386735743878, 0.07511139664091859, -0.07799958015945137, -0.11996089743371596, -0.16329467622994412, -0.15229880410306915, -0.17238566426547347, 0.024915346164359815, -0.0607797284364669, -0.12577097104534646, 0.35225783905264474, 0.23145420523683746, 0.16120206991359332, 0.040668105610098725, 0.39192425578625667, 0.006759114536247647, 0.10804117428940824, 0.11917460279935901, 0.15246291256335098, 0.00814636569460466, 0.28450794500316046, -0.13928169649874758, 0.02256795762837606, -0.021780393066971254]
|
1,803.04312
|
Space-Efficient Bimachine Construction Based on the Equalizer
Accumulation Principle
|
Algorithms for building bimachines from functional transducers found in the
literature in a run of the bimachine imitate one successful path of the input
transducer. Each single bimachine output exactly corresponds to the output of a
single transducer transition. Here we introduce an alternative construction
principle where bimachine steps take alternative parallel transducer paths into
account, maximizing the possible output at each step using a joint view. The
size of both the deterministic left and right automaton of the bimachine is
restricted by $2^{\vert Q\vert}$ where $\vert Q\vert$ is the number of
transducer states. Other bimachine constructions lead to larger subautomata. As
a concrete example we present a class of real-time functional transducers with
$n+2$ states for which the standard bimachine construction generates a
bimachine with at least $\Theta(n!)$ states whereas the construction based on
the equalizer accumulation principle leads to $2^n + n +3$ states. Our
construction can be applied to rational functions from free monoids to "mge
monoids", a large class of monoids including free monoids, groups, and others
that is closed under Cartesian products.
|
cs.FL
|
algorithms for building bimachines from functional transducers found in the literature in a run of the bimachine imitate one successful path of the input transducer each single bimachine output exactly corresponds to the output of a single transducer transition here we introduce an alternative construction principle where bimachine steps take alternative parallel transducer paths into account maximizing the possible output at each step using a joint view the size of both the deterministic left and right automaton of the bimachine is restricted by 2vert qvert where vert qvert is the number of transducer states other bimachine constructions lead to larger subautomata as a concrete example we present a class of realtime functional transducers with n2 states for which the standard bimachine construction generates a bimachine with at least thetan states whereas the construction based on the equalizer accumulation principle leads to 2n n 3 states our construction can be applied to rational functions from free monoids to mge monoids a large class of monoids including free monoids groups and others that is closed under cartesian products
|
[['algorithms', 'for', 'building', 'bimachines', 'from', 'functional', 'transducers', 'found', 'in', 'the', 'literature', 'in', 'a', 'run', 'of', 'the', 'bimachine', 'imitate', 'one', 'successful', 'path', 'of', 'the', 'input', 'transducer', 'each', 'single', 'bimachine', 'output', 'exactly', 'corresponds', 'to', 'the', 'output', 'of', 'a', 'single', 'transducer', 'transition', 'here', 'we', 'introduce', 'an', 'alternative', 'construction', 'principle', 'where', 'bimachine', 'steps', 'take', 'alternative', 'parallel', 'transducer', 'paths', 'into', 'account', 'maximizing', 'the', 'possible', 'output', 'at', 'each', 'step', 'using', 'a', 'joint', 'view', 'the', 'size', 'of', 'both', 'the', 'deterministic', 'left', 'and', 'right', 'automaton', 'of', 'the', 'bimachine', 'is', 'restricted', 'by', '2vert', 'qvert', 'where', 'vert', 'qvert', 'is', 'the', 'number', 'of', 'transducer', 'states', 'other', 'bimachine', 'constructions', 'lead', 'to', 'larger', 'subautomata', 'as', 'a', 'concrete', 'example', 'we', 'present', 'a', 'class', 'of', 'realtime', 'functional', 'transducers', 'with', 'n2', 'states', 'for', 'which', 'the', 'standard', 'bimachine', 'construction', 'generates', 'a', 'bimachine', 'with', 'at', 'least', 'thetan', 'states', 'whereas', 'the', 'construction', 'based', 'on', 'the', 'equalizer', 'accumulation', 'principle', 'leads', 'to', '2n', 'n', '3', 'states', 'our', 'construction', 'can', 'be', 'applied', 'to', 'rational', 'functions', 'from', 'free', 'monoids', 'to', 'mge', 'monoids', 'a', 'large', 'class', 'of', 'monoids', 'including', 'free', 'monoids', 'groups', 'and', 'others', 'that', 'is', 'closed', 'under', 'cartesian', 'products']]
|
[-0.10169665299701192, 0.15922929459082225, -0.045890787384887305, 0.03138381239454763, -0.07590485164071999, -0.1815450704344306, 0.05246787756274998, 0.3501465245435348, -0.31267045521193504, -0.257092192995152, 0.06970598713516371, -0.2682130589281785, -0.09788394695877319, 0.19346471651419567, -0.05002188521458881, 0.028809594911000977, 0.0531644793711818, 0.08749945820820641, -0.03766454960996113, -0.2052801668561855, 0.2886645682620822, 0.012453136600909291, 0.28293375633495477, -0.03848478690259471, 0.14255632675317456, 0.020645841557769416, 0.03445834649532947, 0.005688235356144047, -0.11322318852531375, 0.10842950321430549, 0.3007790460681941, 0.13084314419279638, 0.2529666462288685, -0.44073976130047116, -0.14820533916300346, 0.12474791604266475, 0.09901956046226225, 0.1191536113929348, -0.007450110228554577, -0.241026567743359, 0.08618672193299556, -0.1595881380587601, -0.06084667752373081, -0.0037957852857047423, 0.03127040724792232, 0.00408401823941769, -0.299855950353075, -0.02154124477229517, 0.08781574007306743, 0.027055923288655765, -0.017380520868292778, -0.14915146355684092, -0.009111891765782684, 0.13260691172061112, -0.04421560834377272, 0.03329122612102097, 0.10127447517400316, -0.07360098124320237, -0.17258750677991636, 0.3619268870820975, -0.04555480706510861, -0.2223669930961457, 0.15802326100889183, -0.07519936854439664, -0.13170727268615037, 0.14781783091044323, 0.10755384514226735, 0.15184238547932982, -0.09075727794895412, 0.1116386832382713, -0.0808031851953337, 0.17082652670729667, 0.11164891824928365, 0.032633936390646795, 0.14351506707834039, 0.15351720426145488, 0.10436357224677727, 0.19499259016502143, -0.004542382037828305, -0.05153026281677634, -0.33849682355288824, -0.16055647413598945, -0.1506769342208012, 0.05916662123520264, -0.05629547288613744, -0.19270525602596902, 0.36103103652790275, 0.11870583358107706, 0.14968027315517038, 0.14086103924809865, 0.2701354850584243, 0.09145046440303067, 0.10295824538593347, 0.06090545128510102, 0.11488641069184537, 0.11402854998999765, 0.0035136096311377822, -0.16567590863799214, 0.038589349895381944, 0.13573384174143066]
|
1,803.04313
|
Verification of Turbulence Models for Flow in a Constricted Pipe at Low
Reynolds Number
|
Computational fluid dynamics (CFD) is a useful tool for prediction of
turbulence in aerodynamic and biomedical applications. The choice of
appropriate turbulence models is key to reaching accurate predictions. The
present investigation concentrated on the comparison of different turbulence
models for predicting the flow field downstream of a constricted pipe. This
geometry is relevant to arterial stenosis in patients with vascular diseases.
More specifically, the results of Unsteady Reynolds-Averaged Navier-Stokes
(URANS) and scale resolving simulation (SRS) turbulence models such as Large
Eddy Simulation (LES) and Detached Eddy Simulation (DES) were compared with
experimental measurements. Comparisons included the mean flow and fluctuations
downstream of the constriction. Results showed that the LES model was in better
agreement with the velocity measurements performed using a Laser Doppler
Anemometry (LDA). In addition, although URANS models predicted a wake region
size and mean flow velocities comparable to SRS turbulence models, no
small-scale vortical structures can be observed in the URANS solution due to
the nature of these models. Modeling of these structures would, however, be
helpful when more detailed flow behavior is needed such as in studies of
acoustic sources. Hence, LES would be an optimal turbulence model for the flow
under consideration, especially when sound generation would be of interest.
|
physics.flu-dyn physics.med-ph
|
computational fluid dynamics cfd is a useful tool for prediction of turbulence in aerodynamic and biomedical applications the choice of appropriate turbulence models is key to reaching accurate predictions the present investigation concentrated on the comparison of different turbulence models for predicting the flow field downstream of a constricted pipe this geometry is relevant to arterial stenosis in patients with vascular diseases more specifically the results of unsteady reynoldsaveraged navierstokes urans and scale resolving simulation srs turbulence models such as large eddy simulation les and detached eddy simulation des were compared with experimental measurements comparisons included the mean flow and fluctuations downstream of the constriction results showed that the les model was in better agreement with the velocity measurements performed using a laser doppler anemometry lda in addition although urans models predicted a wake region size and mean flow velocities comparable to srs turbulence models no smallscale vortical structures can be observed in the urans solution due to the nature of these models modeling of these structures would however be helpful when more detailed flow behavior is needed such as in studies of acoustic sources hence les would be an optimal turbulence model for the flow under consideration especially when sound generation would be of interest
|
[['computational', 'fluid', 'dynamics', 'cfd', 'is', 'a', 'useful', 'tool', 'for', 'prediction', 'of', 'turbulence', 'in', 'aerodynamic', 'and', 'biomedical', 'applications', 'the', 'choice', 'of', 'appropriate', 'turbulence', 'models', 'is', 'key', 'to', 'reaching', 'accurate', 'predictions', 'the', 'present', 'investigation', 'concentrated', 'on', 'the', 'comparison', 'of', 'different', 'turbulence', 'models', 'for', 'predicting', 'the', 'flow', 'field', 'downstream', 'of', 'a', 'constricted', 'pipe', 'this', 'geometry', 'is', 'relevant', 'to', 'arterial', 'stenosis', 'in', 'patients', 'with', 'vascular', 'diseases', 'more', 'specifically', 'the', 'results', 'of', 'unsteady', 'reynoldsaveraged', 'navierstokes', 'urans', 'and', 'scale', 'resolving', 'simulation', 'srs', 'turbulence', 'models', 'such', 'as', 'large', 'eddy', 'simulation', 'les', 'and', 'detached', 'eddy', 'simulation', 'des', 'were', 'compared', 'with', 'experimental', 'measurements', 'comparisons', 'included', 'the', 'mean', 'flow', 'and', 'fluctuations', 'downstream', 'of', 'the', 'constriction', 'results', 'showed', 'that', 'the', 'les', 'model', 'was', 'in', 'better', 'agreement', 'with', 'the', 'velocity', 'measurements', 'performed', 'using', 'a', 'laser', 'doppler', 'anemometry', 'lda', 'in', 'addition', 'although', 'urans', 'models', 'predicted', 'a', 'wake', 'region', 'size', 'and', 'mean', 'flow', 'velocities', 'comparable', 'to', 'srs', 'turbulence', 'models', 'no', 'smallscale', 'vortical', 'structures', 'can', 'be', 'observed', 'in', 'the', 'urans', 'solution', 'due', 'to', 'the', 'nature', 'of', 'these', 'models', 'modeling', 'of', 'these', 'structures', 'would', 'however', 'be', 'helpful', 'when', 'more', 'detailed', 'flow', 'behavior', 'is', 'needed', 'such', 'as', 'in', 'studies', 'of', 'acoustic', 'sources', 'hence', 'les', 'would', 'be', 'an', 'optimal', 'turbulence', 'model', 'for', 'the', 'flow', 'under', 'consideration', 'especially', 'when', 'sound', 'generation', 'would', 'be', 'of', 'interest']]
|
[-0.1061585777568025, 0.12880233270903085, -0.10476902142524248, 0.08160770598525471, -0.049448166093427365, -0.11280763483927268, -0.08247243041213312, 0.32810730069369365, -0.23570976608197738, -0.318908781525272, 0.1078183136132175, -0.24947571624350143, -0.10102384364304756, 0.2721028335989245, -0.044385245357085136, 0.11838411974033468, 0.1355265284101795, -0.04687983372465716, 0.0343563806065539, -0.15525457710796262, 0.24166204666750488, 0.14269225804465235, 0.33095758482904253, 0.024787986848573425, 0.06270592615858299, -0.10109687955836422, -0.06824149992723849, 0.08778200175859559, -0.17691967834270525, 0.07827704265211863, 0.2782154665884855, 0.038682706943414746, 0.2788027241165994, -0.4767976984001913, -0.32039654908195425, 0.03451821637380579, 0.18285220302923952, 0.12072902465650577, -0.015570474837288415, -0.2611193026752817, 0.10629275641957912, -0.1546576704267069, -0.07935246215464696, -0.0685139968313132, -0.01058759194492471, 0.04701889016511805, -0.29002112630546745, 0.142553309138324, 0.016569655765813224, 0.13588363015843394, -0.08758361359509455, -0.10230710052261219, -0.052007710102276464, 0.12941324461202897, 0.07712349409375394, 0.0235109613570882, 0.1687977047751825, -0.21938240574559795, -0.051687151540039125, 0.42617546154855235, -0.04705280070961679, -0.21484277543421942, 0.21950241227100775, -0.13012592471430748, -0.06594939915083566, 0.15612393364772817, 0.21247609118813449, 0.06016362926841361, -0.06657863307523301, -0.03307458411283945, -0.050341908329164214, 0.18093599019192377, 0.03568507868850839, -0.07472861387620107, 0.20563139989480458, 0.2186074026089469, 0.002867009672132836, 0.06865744050863443, -0.13875023110823942, -0.09478457271600667, -0.2602828379796176, -0.13057814240143398, -0.11020408068485196, 0.016061731466110254, -0.0998617659547695, -0.16048666956643484, 0.3495012635401296, 0.20737977124280432, 0.1280778109681458, 0.011284289292728945, 0.33068005082161317, 0.06563999789803135, 0.041688029221439896, 0.1116552997687922, 0.23725963123956495, 0.14695790427956207, 0.15396271701404843, -0.2244116823122276, 0.10263474035479164, 0.024058930892316463]
|
1,803.04314
|
Theoretical Bounds and Constructions of Codes in the Generalized Cayley
Metric
|
Permutation codes have recently garnered substantial research interest due to
their potential in various applications including cloud storage systems, genome
resequencing and flash memories. In this paper, we study the theoretical bounds
and constructions of permutation codes in the generalized Cayley metric. The
generalized Cayley metric captures the number of generalized transposition
errors in a permutation, and subsumes previously studied error types, including
transpositions and translocations, without imposing restrictions on the lengths
and positions of the translocated segments. Relying on the breakpoint analysis
proposed by Chee and Vu, we first propose a coding scheme that is order-optimal
albeit not constructive based on this method. We then develop another
construction of permutation codes in the generalized Cayley distance. This
scheme is both explicit and systematic. We also prove the existence of
order-optimal systematic codes and offer a concrete construction based on this
method. For the generalized Cayley metric, we prove that our coding schemes
have less redundancy than the existing codes based on interleaving when the
codelength is sufficiently large and the number of errors is relatively small.
|
cs.IT math.IT
|
permutation codes have recently garnered substantial research interest due to their potential in various applications including cloud storage systems genome resequencing and flash memories in this paper we study the theoretical bounds and constructions of permutation codes in the generalized cayley metric the generalized cayley metric captures the number of generalized transposition errors in a permutation and subsumes previously studied error types including transpositions and translocations without imposing restrictions on the lengths and positions of the translocated segments relying on the breakpoint analysis proposed by chee and vu we first propose a coding scheme that is orderoptimal albeit not constructive based on this method we then develop another construction of permutation codes in the generalized cayley distance this scheme is both explicit and systematic we also prove the existence of orderoptimal systematic codes and offer a concrete construction based on this method for the generalized cayley metric we prove that our coding schemes have less redundancy than the existing codes based on interleaving when the codelength is sufficiently large and the number of errors is relatively small
|
[['permutation', 'codes', 'have', 'recently', 'garnered', 'substantial', 'research', 'interest', 'due', 'to', 'their', 'potential', 'in', 'various', 'applications', 'including', 'cloud', 'storage', 'systems', 'genome', 'resequencing', 'and', 'flash', 'memories', 'in', 'this', 'paper', 'we', 'study', 'the', 'theoretical', 'bounds', 'and', 'constructions', 'of', 'permutation', 'codes', 'in', 'the', 'generalized', 'cayley', 'metric', 'the', 'generalized', 'cayley', 'metric', 'captures', 'the', 'number', 'of', 'generalized', 'transposition', 'errors', 'in', 'a', 'permutation', 'and', 'subsumes', 'previously', 'studied', 'error', 'types', 'including', 'transpositions', 'and', 'translocations', 'without', 'imposing', 'restrictions', 'on', 'the', 'lengths', 'and', 'positions', 'of', 'the', 'translocated', 'segments', 'relying', 'on', 'the', 'breakpoint', 'analysis', 'proposed', 'by', 'chee', 'and', 'vu', 'we', 'first', 'propose', 'a', 'coding', 'scheme', 'that', 'is', 'orderoptimal', 'albeit', 'not', 'constructive', 'based', 'on', 'this', 'method', 'we', 'then', 'develop', 'another', 'construction', 'of', 'permutation', 'codes', 'in', 'the', 'generalized', 'cayley', 'distance', 'this', 'scheme', 'is', 'both', 'explicit', 'and', 'systematic', 'we', 'also', 'prove', 'the', 'existence', 'of', 'orderoptimal', 'systematic', 'codes', 'and', 'offer', 'a', 'concrete', 'construction', 'based', 'on', 'this', 'method', 'for', 'the', 'generalized', 'cayley', 'metric', 'we', 'prove', 'that', 'our', 'coding', 'schemes', 'have', 'less', 'redundancy', 'than', 'the', 'existing', 'codes', 'based', 'on', 'interleaving', 'when', 'the', 'codelength', 'is', 'sufficiently', 'large', 'and', 'the', 'number', 'of', 'errors', 'is', 'relatively', 'small']]
|
[-0.15470993234697034, 0.0863807335019764, -0.06760772024570717, 0.0808180266949164, -0.05362895793560366, -0.17064743505075236, 0.10380491390127142, 0.38825842701319585, -0.2647537900461147, -0.27370028322467865, 0.1172634426413609, -0.24055792474172125, -0.19168900982029524, 0.20333980853106343, -0.15805015223637475, 0.08239272362841978, 0.07086028954235174, 0.04004081998199309, -0.11345844367245413, -0.29796318182627024, 0.3104393789228999, 0.08321860247873043, 0.32049852064389756, 0.06635030689991295, 0.07949167986184695, -0.005213321368131092, -0.0773205344360006, 0.005606961194531056, -0.15952055859499503, 0.13762392450550223, 0.2195914115199009, 0.1586997562040717, 0.23884142840696804, -0.38844757473443525, -0.21894545844949434, 0.13599676044400003, 0.1361312129518996, 0.1569569147334008, -0.08287410797764373, -0.2630586286185909, 0.13876271691688963, -0.20046775473418546, -0.018222954737201418, -0.0613781323309167, 0.02603949519337318, 0.04015848267755055, -0.25880223744954006, 0.0038457696027146115, 0.0879153991959947, 0.089046486011459, 0.013763908188958458, -0.1544676318522648, 0.06961587538724334, 0.09186664391207078, 0.02516053225003225, 0.012339647159527588, 0.04329449747883751, -0.011683425998925573, -0.14820736045501914, 0.3533148384142646, -0.001341145586023123, -0.2341209781898112, 0.1164347989534654, -0.05620408202863514, -0.18273858431895068, 0.09709365851387887, 0.18976899210789824, 0.13819554349733779, -0.1046177716548377, 0.10174844807275639, -0.06735174573884256, 0.15123699931756693, 0.1144320468476179, 0.08988484575828842, 0.09204265633650587, 0.1378162845990247, 0.07261081673678453, 0.18357438247816604, -0.06407324873347699, -0.09578745005294512, -0.2839590349414854, -0.10320222007648724, -0.17676695187360386, 0.0046523637079935, -0.14639398353468655, -0.19144386281903916, 0.38233207114510953, 0.1364928273731411, 0.13110772286486513, 0.12756735398591953, 0.2891665098190276, 0.03167728084536785, 0.11114070672505025, 0.13424326281594692, 0.14595835900597148, 0.16197732067535406, -0.005475757619245031, -0.18320492530599405, 0.0868850269533778, 0.13859557585085686]
|
1,803.04315
|
Power-Efficient Deployment of UAVs as Relays
|
Optimal deployment of unmanned aerial vehicles (UAVs) as communication relays
is studied for fixed-rate variable-power systems. The considered setup is a set
of ground transmitters (GTs) wishing to communicate with a set of ground
receivers (GRs) through the UAVs. Each GT-GR pair communicates through only one
selected UAV and have no direct link. Two different UAV selection scenarios are
studied: In centralized selection, a decision center assigns an optimal UAV
depending on the locations of all terminals. In distributed selection, a GT
selects its relaying UAV using only the local knowledge of its distances to the
UAVs. For both selection scenarios, the optimal tradeoff between the UAV and GT
power consumptions are determined using tools from quantization theory.
Specifically, the two extremal regimes of one UAV and very large number of UAVs
are analyzed for a path loss exponent of $2$. Numerical optimization of UAV
locations are also discussed. Simulations are provided to confirm the
analytical findings.
|
cs.IT eess.SP math.IT
|
optimal deployment of unmanned aerial vehicles uavs as communication relays is studied for fixedrate variablepower systems the considered setup is a set of ground transmitters gts wishing to communicate with a set of ground receivers grs through the uavs each gtgr pair communicates through only one selected uav and have no direct link two different uav selection scenarios are studied in centralized selection a decision center assigns an optimal uav depending on the locations of all terminals in distributed selection a gt selects its relaying uav using only the local knowledge of its distances to the uavs for both selection scenarios the optimal tradeoff between the uav and gt power consumptions are determined using tools from quantization theory specifically the two extremal regimes of one uav and very large number of uavs are analyzed for a path loss exponent of 2 numerical optimization of uav locations are also discussed simulations are provided to confirm the analytical findings
|
[['optimal', 'deployment', 'of', 'unmanned', 'aerial', 'vehicles', 'uavs', 'as', 'communication', 'relays', 'is', 'studied', 'for', 'fixedrate', 'variablepower', 'systems', 'the', 'considered', 'setup', 'is', 'a', 'set', 'of', 'ground', 'transmitters', 'gts', 'wishing', 'to', 'communicate', 'with', 'a', 'set', 'of', 'ground', 'receivers', 'grs', 'through', 'the', 'uavs', 'each', 'gtgr', 'pair', 'communicates', 'through', 'only', 'one', 'selected', 'uav', 'and', 'have', 'no', 'direct', 'link', 'two', 'different', 'uav', 'selection', 'scenarios', 'are', 'studied', 'in', 'centralized', 'selection', 'a', 'decision', 'center', 'assigns', 'an', 'optimal', 'uav', 'depending', 'on', 'the', 'locations', 'of', 'all', 'terminals', 'in', 'distributed', 'selection', 'a', 'gt', 'selects', 'its', 'relaying', 'uav', 'using', 'only', 'the', 'local', 'knowledge', 'of', 'its', 'distances', 'to', 'the', 'uavs', 'for', 'both', 'selection', 'scenarios', 'the', 'optimal', 'tradeoff', 'between', 'the', 'uav', 'and', 'gt', 'power', 'consumptions', 'are', 'determined', 'using', 'tools', 'from', 'quantization', 'theory', 'specifically', 'the', 'two', 'extremal', 'regimes', 'of', 'one', 'uav', 'and', 'very', 'large', 'number', 'of', 'uavs', 'are', 'analyzed', 'for', 'a', 'path', 'loss', 'exponent', 'of', '2', 'numerical', 'optimization', 'of', 'uav', 'locations', 'are', 'also', 'discussed', 'simulations', 'are', 'provided', 'to', 'confirm', 'the', 'analytical', 'findings']]
|
[-0.2811111207330419, 0.05341998081017781, -0.002763896874122081, 0.028483666324867835, -0.09178122281464898, -0.2706330634683611, 0.13575993349940907, 0.429403203569593, -0.24566870860515103, -0.29968015248136176, 0.10066981555803889, -0.26658904597523714, -0.1258280545202715, 0.17388776226209537, -0.10872457800733466, 0.07010436769980456, 0.06441263212792335, 0.08286091054399167, 0.031175349197057528, -0.23786214109390014, 0.26081210356581236, 0.0625730456168493, 0.3008916464333813, -0.02617639575994784, 0.12490336173063805, 0.0167488859590864, -0.0013617983869006556, -0.02043172554263184, -0.14325832892509718, 0.08011685632649929, 0.37140611965629844, 0.19831123329518782, 0.29037927922702605, -0.4122788733231925, -0.23490582250899847, 0.08807496338962548, 0.14789180173688837, 0.03926912330601725, -0.03423990506693841, -0.3234471777514104, 0.13479852572594198, -0.2263572751341628, -0.054095323188530824, 0.04170192637210411, -0.026969304049928342, 0.13124404504271825, -0.33212588384386993, -0.10061195148023656, -0.11952347649081099, 0.06073862267057261, -0.11969124331935159, -0.10530128760503665, -0.03846380597340965, 0.24932073077802816, 0.06323807467856715, -0.03079261395163954, 0.155553786513666, -0.08845198357237442, -0.14389982975253293, 0.38587450911441157, 0.0954594225412415, -0.2299908119244426, 0.17203607734230783, -0.04651112388218603, -0.09361648925489956, 0.14314004096142466, 0.2090700297346038, 0.11851691045467892, -0.17811518535318394, 0.02654254396723944, -0.030105941412189315, 0.10899583150842979, 0.08168999664185028, 0.05826915568266545, 0.17111269348857722, 0.19493575166430205, 0.21740385264668974, 0.0959992325444135, -0.14487765420438542, -0.1622996318334293, -0.2648615815586621, -0.08865907329224772, -0.2626807180601322, -0.030037077495287504, -0.105383385656563, -0.034256287557711346, 0.33744908107009025, 0.10873877594638015, 0.14996578181613116, 0.09691042996672614, 0.391753039136529, 0.06713837657833562, 0.0009721431310378737, 0.12431333742645238, 0.2383041481735305, 0.06513276457065537, 0.09377993797703135, -0.21395979128898152, 0.05897000346993727, 0.009661130631162274]
|
1,803.04316
|
Tailoring nonlinear processes for quantum optics with pulsed
temporal-mode encodings
|
The time-frequency degree of freedom is a powerful resource for implementing
high-dimensional quantum information processing. In particular,
field-orthogonal pulsed temporal modes offer a flexible framework compatible
with both long-distance fibre networks and integrated waveguide devices. In
order for this architecture to be fully utilised, techniques to reliably
generate diverse quantum states of light and accurately measure complex
temporal waveforms must be developed. To this end, nonlinear processes mediated
by spectrally shaped pump pulses in group-velocity engineered waveguides and
crystals provide a capable toolbox. In this review, we examine how tailoring
the phasematching conditions of parametric downconversion and sum-frequency
generation allows for highly pure single-photon generation, flexible
temporal-mode entanglement, and accurate measurement of time-frequency photon
states. We provide an overview of experimental progress towards these goals,
and summarise challenges that remain in the field.
|
quant-ph
|
the timefrequency degree of freedom is a powerful resource for implementing highdimensional quantum information processing in particular fieldorthogonal pulsed temporal modes offer a flexible framework compatible with both longdistance fibre networks and integrated waveguide devices in order for this architecture to be fully utilised techniques to reliably generate diverse quantum states of light and accurately measure complex temporal waveforms must be developed to this end nonlinear processes mediated by spectrally shaped pump pulses in groupvelocity engineered waveguides and crystals provide a capable toolbox in this review we examine how tailoring the phasematching conditions of parametric downconversion and sumfrequency generation allows for highly pure singlephoton generation flexible temporalmode entanglement and accurate measurement of timefrequency photon states we provide an overview of experimental progress towards these goals and summarise challenges that remain in the field
|
[['the', 'timefrequency', 'degree', 'of', 'freedom', 'is', 'a', 'powerful', 'resource', 'for', 'implementing', 'highdimensional', 'quantum', 'information', 'processing', 'in', 'particular', 'fieldorthogonal', 'pulsed', 'temporal', 'modes', 'offer', 'a', 'flexible', 'framework', 'compatible', 'with', 'both', 'longdistance', 'fibre', 'networks', 'and', 'integrated', 'waveguide', 'devices', 'in', 'order', 'for', 'this', 'architecture', 'to', 'be', 'fully', 'utilised', 'techniques', 'to', 'reliably', 'generate', 'diverse', 'quantum', 'states', 'of', 'light', 'and', 'accurately', 'measure', 'complex', 'temporal', 'waveforms', 'must', 'be', 'developed', 'to', 'this', 'end', 'nonlinear', 'processes', 'mediated', 'by', 'spectrally', 'shaped', 'pump', 'pulses', 'in', 'groupvelocity', 'engineered', 'waveguides', 'and', 'crystals', 'provide', 'a', 'capable', 'toolbox', 'in', 'this', 'review', 'we', 'examine', 'how', 'tailoring', 'the', 'phasematching', 'conditions', 'of', 'parametric', 'downconversion', 'and', 'sumfrequency', 'generation', 'allows', 'for', 'highly', 'pure', 'singlephoton', 'generation', 'flexible', 'temporalmode', 'entanglement', 'and', 'accurate', 'measurement', 'of', 'timefrequency', 'photon', 'states', 'we', 'provide', 'an', 'overview', 'of', 'experimental', 'progress', 'towards', 'these', 'goals', 'and', 'summarise', 'challenges', 'that', 'remain', 'in', 'the', 'field']]
|
[-0.11478637387149764, 0.17094632578741048, -0.0650498761298289, 0.03478768180541106, -0.07748410492764324, -0.20801214665818707, 0.0030195125312145266, 0.4898495546409062, -0.24556442918746094, -0.25366370789216536, 0.057379342558709696, -0.20717992385531184, -0.1303103533328364, 0.2534691298807642, -0.05339837015061422, 0.13535801627274072, 0.07141318388941481, -0.10525699058867977, 0.02140077175677551, -0.14473257307313325, 0.2608653414671491, 0.04417355650601754, 0.37701207054848956, 0.03779867439026615, 0.12437085392254692, 0.021708603965860784, -0.020501200288282076, -0.09041234192217847, -0.09686632773470653, 0.20542561663647316, 0.35227771077473136, 0.11039151209301519, 0.2617366524847378, -0.48240272250180516, -0.2490555032040868, 0.07782699273815169, 0.14462964326367342, 0.16072562197726606, -0.08718333883330058, -0.30616101637286575, 0.025213428999689456, -0.1565092646481191, -0.13991901840254423, -0.16648004618228265, -0.03393337826850243, -0.004426332467666274, -0.2756526731304768, 0.01081235973948711, 0.02891726037872521, 0.036595355869880074, 0.05996893076180162, 0.011455829395331386, 0.019415012861013804, 0.09964760106154963, -0.10702743286203902, -0.011409091390319225, 0.12425767551123731, -0.14973064333933958, -0.1724830144400099, 0.3519002430738804, -0.0686309076871905, -0.18724925159176906, 0.12796019828402178, -0.11116274092801587, -0.11727520509770042, 0.10512694604414746, 0.23071849939266317, 0.10456849773645513, -0.19200979269816912, -0.011161524126712317, 0.08099248308926485, 0.23687516724256644, 0.08076385509124712, 0.1941193300999589, 0.2538199217927019, 0.19993352482998675, 0.030674005656405108, 0.16849290260071761, -0.06201644822310908, -0.054003453102309425, -0.26356562874034833, -0.15187143616426887, -0.15960702203788368, 0.035123044243292476, -0.060287732290693986, -0.10466597978261132, 0.4602161359875218, 0.16507523834855906, 0.11072017161326161, 0.013218484377782596, 0.3236996894877376, 0.10205266466434289, 0.05925385285732582, 0.028237219336197564, 0.24741348557443799, 0.15695288805536142, 0.12160979268400181, -0.2028473981286756, 0.009441527930137358, -0.058888734573029206]
|
1,803.04317
|
A Brief Review of Current Lithium Ion Battery Technology and Potential
Solid State Battery Technologies
|
Solid state battery technology has recently garnered considerable interest
from companies including Toyota, BMW, Dyson, and others. The primary driver
behind the commercialization of solid state batteries (SSBs) is to enable the
use of lithium metal as the anode, as opposed to the currently used carbon
anode, which would result in ~20% energy density improvement. However, no
reported solid state battery to date meets all of the performance metrics of
state of the art liquid electrolyte lithium ion batteries (LIBs) and indeed
several solid state electrolyte (SSE) technologies may never reach parity with
current LIBs. We begin with a review of state of the art LIBs, including their
current performance characteristics, commercial trends in cost, and future
possibilities. We then discuss current SSB research by focusing on three
classes of solid state electrolytes: Sulfides, Polymers, and Oxides. We discuss
recent and ongoing commercialization attempts in the SSB field. Finally, we
conclude with our perspective and timeline for the future of commercial
batteries.
|
physics.app-ph cond-mat.mtrl-sci
|
solid state battery technology has recently garnered considerable interest from companies including toyota bmw dyson and others the primary driver behind the commercialization of solid state batteries ssbs is to enable the use of lithium metal as the anode as opposed to the currently used carbon anode which would result in 20 energy density improvement however no reported solid state battery to date meets all of the performance metrics of state of the art liquid electrolyte lithium ion batteries libs and indeed several solid state electrolyte sse technologies may never reach parity with current libs we begin with a review of state of the art libs including their current performance characteristics commercial trends in cost and future possibilities we then discuss current ssb research by focusing on three classes of solid state electrolytes sulfides polymers and oxides we discuss recent and ongoing commercialization attempts in the ssb field finally we conclude with our perspective and timeline for the future of commercial batteries
|
[['solid', 'state', 'battery', 'technology', 'has', 'recently', 'garnered', 'considerable', 'interest', 'from', 'companies', 'including', 'toyota', 'bmw', 'dyson', 'and', 'others', 'the', 'primary', 'driver', 'behind', 'the', 'commercialization', 'of', 'solid', 'state', 'batteries', 'ssbs', 'is', 'to', 'enable', 'the', 'use', 'of', 'lithium', 'metal', 'as', 'the', 'anode', 'as', 'opposed', 'to', 'the', 'currently', 'used', 'carbon', 'anode', 'which', 'would', 'result', 'in', '20', 'energy', 'density', 'improvement', 'however', 'no', 'reported', 'solid', 'state', 'battery', 'to', 'date', 'meets', 'all', 'of', 'the', 'performance', 'metrics', 'of', 'state', 'of', 'the', 'art', 'liquid', 'electrolyte', 'lithium', 'ion', 'batteries', 'libs', 'and', 'indeed', 'several', 'solid', 'state', 'electrolyte', 'sse', 'technologies', 'may', 'never', 'reach', 'parity', 'with', 'current', 'libs', 'we', 'begin', 'with', 'a', 'review', 'of', 'state', 'of', 'the', 'art', 'libs', 'including', 'their', 'current', 'performance', 'characteristics', 'commercial', 'trends', 'in', 'cost', 'and', 'future', 'possibilities', 'we', 'then', 'discuss', 'current', 'ssb', 'research', 'by', 'focusing', 'on', 'three', 'classes', 'of', 'solid', 'state', 'electrolytes', 'sulfides', 'polymers', 'and', 'oxides', 'we', 'discuss', 'recent', 'and', 'ongoing', 'commercialization', 'attempts', 'in', 'the', 'ssb', 'field', 'finally', 'we', 'conclude', 'with', 'our', 'perspective', 'and', 'timeline', 'for', 'the', 'future', 'of', 'commercial', 'batteries']]
|
[-0.07434960494513543, 0.13441014794466075, 0.024250566943571614, -0.058191448608902, -0.037072078985978425, -0.1636966055885739, 0.09403839756815154, 0.41282544245966424, -0.20244356437965674, -0.3064775864886879, 0.12902709162998138, -0.32568170729288715, -0.05921242507117122, 0.22150780548008137, -0.09423583757597953, 0.08670322473712817, 0.04501745094441705, 0.0019242056705816477, -0.09197003243061323, -0.23254654206979422, 0.23239426627068172, 0.09244021399515784, 0.3513865834676925, 0.1152159285582142, 0.060222592730833975, -0.09281196788292562, 0.0281554352072424, -0.016175104460368555, -0.1375910908405606, 0.11509122619445632, 0.30633160371885254, 0.09715655106292279, 0.26219918410995124, -0.5235123110038263, -0.25575465998715824, 0.0687672719143814, 0.07978942788803926, 0.13789363492518825, -0.15659809703608102, -0.25766170146604883, 0.02391098524920964, -0.27478549124121115, -0.1382046666924761, -0.04128786459432938, 0.020471339387801924, 0.056204124370174496, -0.16032026983929776, -0.0018739895492700146, 0.01863664545889162, 0.03220077694025764, -0.09015884659437026, -0.24940047185022937, -0.024947997195542686, 0.1098855397991698, 0.06148241720030107, -0.00244415484736731, 0.20869090951070834, -0.17519731958286067, -0.13255538023867425, 0.3662687181437641, -0.040887075941291075, -0.0833828371089314, 0.20839376709665414, -0.11268588891367853, -0.08549241487362226, 0.1064751528283972, 0.12858585467746045, 0.05868565904574446, -0.1562301326646573, 0.027005058095968662, 0.053040237161675816, 0.1556457554355645, 0.045868990040257754, 0.05912707302429035, 0.265942304805108, 0.28489705490488787, 0.02942907839530596, 0.0974624850802493, -0.08517390320991615, -0.09504609701315654, -0.1948639746312696, -0.2610920098334275, -0.12588053535350976, 0.07985600770198177, -0.004900997668615382, -0.15221394903750884, 0.3748840585603942, 0.16181475927630715, 0.050884646363556385, -0.059690366710038904, 0.2965549159741869, -0.0049605053442783285, 0.03239843011460049, 0.023840943699196718, 0.2624853223240302, 0.10861665174727225, 0.20070560809611457, -0.2244743084072216, 0.13731274171588642, -0.006859912700522806]
|
1,803.04318
|
On the longtime behavior of a viscous Cahn-Hilliard system with
convection and dynamic boundary conditions
|
In this paper, we study the longtime asymptotic behavior of a phase
separation process occurring in a three-dimensional domain containing a fluid
flow of given velocity. This process is modeled by a viscous convective
Cahn-Hilliard system, which consists of two nonlinearly coupled second-order
partial differential equations for the unknown quantities, the chemical
potential and an order parameter representing the scaled density of one of the
phases. In contrast to other contributions, in which zero Neumann boundary
conditions were are assumed for both the chemical potential and the order
parameter, we consider the case of dynamic boundary conditions, which model the
situation when another phase transition takes place on the boundary. The phase
transition processes in the bulk and on the boundary are driven by free
energies functionals that may be nondifferentiable and have derivatives only in
the sense of (possibly set-valued) subdifferentials. For the resulting
initial-boundary value system of Cahn-Hilliard type, general well-posedness
results have been established in a recent contribution by the same authors. In
the present paper, we investigate the asymptotic behavior of the solutions as
times approaches infinity. More precisely, we study the $\omega$-limit (in a
suitable topology) of every solution trajectory. Under the assumptions that the
viscosity coefficients are strictly positive and that at least one of the
underlying free energies is differentiable, we prove that the $\omega$-limit is
meaningful and that all of its elements are solutions to the corresponding
stationary system, where the component representing the chemical potential is a
constant.
|
math.AP
|
in this paper we study the longtime asymptotic behavior of a phase separation process occurring in a threedimensional domain containing a fluid flow of given velocity this process is modeled by a viscous convective cahnhilliard system which consists of two nonlinearly coupled secondorder partial differential equations for the unknown quantities the chemical potential and an order parameter representing the scaled density of one of the phases in contrast to other contributions in which zero neumann boundary conditions were are assumed for both the chemical potential and the order parameter we consider the case of dynamic boundary conditions which model the situation when another phase transition takes place on the boundary the phase transition processes in the bulk and on the boundary are driven by free energies functionals that may be nondifferentiable and have derivatives only in the sense of possibly setvalued subdifferentials for the resulting initialboundary value system of cahnhilliard type general wellposedness results have been established in a recent contribution by the same authors in the present paper we investigate the asymptotic behavior of the solutions as times approaches infinity more precisely we study the omegalimit in a suitable topology of every solution trajectory under the assumptions that the viscosity coefficients are strictly positive and that at least one of the underlying free energies is differentiable we prove that the omegalimit is meaningful and that all of its elements are solutions to the corresponding stationary system where the component representing the chemical potential is a constant
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'longtime', 'asymptotic', 'behavior', 'of', 'a', 'phase', 'separation', 'process', 'occurring', 'in', 'a', 'threedimensional', 'domain', 'containing', 'a', 'fluid', 'flow', 'of', 'given', 'velocity', 'this', 'process', 'is', 'modeled', 'by', 'a', 'viscous', 'convective', 'cahnhilliard', 'system', 'which', 'consists', 'of', 'two', 'nonlinearly', 'coupled', 'secondorder', 'partial', 'differential', 'equations', 'for', 'the', 'unknown', 'quantities', 'the', 'chemical', 'potential', 'and', 'an', 'order', 'parameter', 'representing', 'the', 'scaled', 'density', 'of', 'one', 'of', 'the', 'phases', 'in', 'contrast', 'to', 'other', 'contributions', 'in', 'which', 'zero', 'neumann', 'boundary', 'conditions', 'were', 'are', 'assumed', 'for', 'both', 'the', 'chemical', 'potential', 'and', 'the', 'order', 'parameter', 'we', 'consider', 'the', 'case', 'of', 'dynamic', 'boundary', 'conditions', 'which', 'model', 'the', 'situation', 'when', 'another', 'phase', 'transition', 'takes', 'place', 'on', 'the', 'boundary', 'the', 'phase', 'transition', 'processes', 'in', 'the', 'bulk', 'and', 'on', 'the', 'boundary', 'are', 'driven', 'by', 'free', 'energies', 'functionals', 'that', 'may', 'be', 'nondifferentiable', 'and', 'have', 'derivatives', 'only', 'in', 'the', 'sense', 'of', 'possibly', 'setvalued', 'subdifferentials', 'for', 'the', 'resulting', 'initialboundary', 'value', 'system', 'of', 'cahnhilliard', 'type', 'general', 'wellposedness', 'results', 'have', 'been', 'established', 'in', 'a', 'recent', 'contribution', 'by', 'the', 'same', 'authors', 'in', 'the', 'present', 'paper', 'we', 'investigate', 'the', 'asymptotic', 'behavior', 'of', 'the', 'solutions', 'as', 'times', 'approaches', 'infinity', 'more', 'precisely', 'we', 'study', 'the', 'omegalimit', 'in', 'a', 'suitable', 'topology', 'of', 'every', 'solution', 'trajectory', 'under', 'the', 'assumptions', 'that', 'the', 'viscosity', 'coefficients', 'are', 'strictly', 'positive', 'and', 'that', 'at', 'least', 'one', 'of', 'the', 'underlying', 'free', 'energies', 'is', 'differentiable', 'we', 'prove', 'that', 'the', 'omegalimit', 'is', 'meaningful', 'and', 'that', 'all', 'of', 'its', 'elements', 'are', 'solutions', 'to', 'the', 'corresponding', 'stationary', 'system', 'where', 'the', 'component', 'representing', 'the', 'chemical', 'potential', 'is', 'a', 'constant']]
|
[-0.15936034441188446, 0.12126588238774835, -0.08818872699415997, 0.019937898145085658, -0.04092798984669873, -0.10126543446229054, 0.0023338006760336852, 0.31190034381664444, -0.28497513715811224, -0.2263561384262223, 0.14096514767116908, -0.2916673652093428, -0.13420980824685472, 0.13749940008931766, -0.03401810718183726, 0.0726517956844825, 0.04108699100273039, 0.06601685609174553, -0.07150571951209021, -0.20677568151866302, 0.39046758146030897, -0.038011291218914, 0.2287747872444737, 0.031833213213633235, 0.09502155147045134, -0.057107277209813956, 0.023109748138035627, 0.050906575316947845, -0.16705886045118407, 0.06183922903797012, 0.22448918659632144, 0.034808789971869, 0.2787690970797831, -0.42951548018580893, -0.2457207757225524, 0.11596493063464398, 0.09848672183049534, 0.08370783477069561, -0.022559288619399574, -0.2585419862680062, 0.07835255616989273, -0.11969824393585264, -0.16683758566766857, -0.039597428176619924, 0.028597456976198234, 0.0434333576485213, -0.2952096072979543, 0.11316521275366245, 0.07403530811076524, 0.02347604473977376, -0.13426898201307289, -0.0879589248060245, -0.053845997894114934, 0.11725164239489481, 0.061007470088334084, 0.015319146692417261, 0.0955696961300934, -0.1362362706483255, -0.05325169640787413, 0.3713392227028425, -0.07493241451989845, -0.24443168320357497, 0.20988581760744998, -0.15992149686058352, -0.10499626430513163, 0.13351890359635687, 0.1605604449701816, 0.16342724246259963, -0.19168910941021633, 0.12465009188914845, -0.006132139922836079, 0.1411625728999012, 0.06536705166795234, -0.010392729274745698, 0.15149544600797024, 0.1580411656646563, 0.107956528932286, 0.14464481590152625, -0.04412258230344164, -0.1440629335271142, -0.34736805805099397, -0.16588582658314482, -0.15724537392129917, 0.028756276095429294, -0.10182057251434525, -0.19154910343182593, 0.3980983211715453, 0.14528691095888221, 0.20511549372633217, 0.03328477197914923, 0.2596454392809436, 0.18533889517901647, 0.004955733938685615, 0.06391700062154215, 0.22873899274833712, 0.12237907794439931, 0.12165810541826703, -0.21668044327351035, 0.09492053132106433, 0.107769517566413]
|
1,803.04319
|
Recognizing the Value of the Solar Gravitational Lens for Direct
Multipixel Imaging and Spectroscopy of an Exoplanet
|
The Solar Gravitational Lens (SGL) allows for major brightness amplification
($\sim 10^{11}$ at wavelength of $1~\mu$m) and extreme angular resolution
($\sim10^{-10}$ arcsec) within a narrow field of view. A meter-class telescope,
with a modest coronagraph to block solar light with 1e-6 suppression placed in
the focal area of the SGL, can image an exoplanet at a distance of 30 parsec
with few kilometer-scale resolution on its surface. Notably, spectroscopic
broadband SNR is $\sim 10^{-6}$ in two weeks of integration time, providing
this instrument with incredible remote sensing capabilities. A mission capable
of exploiting the remarkable optical properties of the SGL allows for direct
high-resolution imaging/spectroscopy of a potentially habitable exoplanet. Such
missions could allow exploration of exoplanets relying on the SGL capabilities
decades, if not centuries, earlier than possible with other extant
technologies.
|
astro-ph.IM astro-ph.EP gr-qc
|
the solar gravitational lens sgl allows for major brightness amplification sim 1011 at wavelength of 1mum and extreme angular resolution sim1010 arcsec within a narrow field of view a meterclass telescope with a modest coronagraph to block solar light with 1e6 suppression placed in the focal area of the sgl can image an exoplanet at a distance of 30 parsec with few kilometerscale resolution on its surface notably spectroscopic broadband snr is sim 106 in two weeks of integration time providing this instrument with incredible remote sensing capabilities a mission capable of exploiting the remarkable optical properties of the sgl allows for direct highresolution imagingspectroscopy of a potentially habitable exoplanet such missions could allow exploration of exoplanets relying on the sgl capabilities decades if not centuries earlier than possible with other extant technologies
|
[['the', 'solar', 'gravitational', 'lens', 'sgl', 'allows', 'for', 'major', 'brightness', 'amplification', 'sim', '1011', 'at', 'wavelength', 'of', '1mum', 'and', 'extreme', 'angular', 'resolution', 'sim1010', 'arcsec', 'within', 'a', 'narrow', 'field', 'of', 'view', 'a', 'meterclass', 'telescope', 'with', 'a', 'modest', 'coronagraph', 'to', 'block', 'solar', 'light', 'with', '1e6', 'suppression', 'placed', 'in', 'the', 'focal', 'area', 'of', 'the', 'sgl', 'can', 'image', 'an', 'exoplanet', 'at', 'a', 'distance', 'of', '30', 'parsec', 'with', 'few', 'kilometerscale', 'resolution', 'on', 'its', 'surface', 'notably', 'spectroscopic', 'broadband', 'snr', 'is', 'sim', '106', 'in', 'two', 'weeks', 'of', 'integration', 'time', 'providing', 'this', 'instrument', 'with', 'incredible', 'remote', 'sensing', 'capabilities', 'a', 'mission', 'capable', 'of', 'exploiting', 'the', 'remarkable', 'optical', 'properties', 'of', 'the', 'sgl', 'allows', 'for', 'direct', 'highresolution', 'imagingspectroscopy', 'of', 'a', 'potentially', 'habitable', 'exoplanet', 'such', 'missions', 'could', 'allow', 'exploration', 'of', 'exoplanets', 'relying', 'on', 'the', 'sgl', 'capabilities', 'decades', 'if', 'not', 'centuries', 'earlier', 'than', 'possible', 'with', 'other', 'extant', 'technologies']]
|
[-0.12146298402108084, 0.12705183037326065, -0.04994252014597107, -0.002381497122263326, -0.13845360491956984, -0.10137938916389096, 0.04692278115807059, 0.4012167675322608, -0.17880506962677814, -0.41348611585851897, 0.11998963005109024, -0.268711488193498, -0.05310082193827292, 0.28714303320441814, -0.08257240528079744, 0.06172768448792832, 0.12241977496209197, -0.06880058022741144, -0.06363033384646646, -0.2230826080006484, 0.20330745732950928, 0.17666007125316033, 0.16753488053791785, -0.007004011156303542, 0.13844633832419836, -0.00970259976846383, -0.05560443729435311, -0.03461459446943512, -0.1289184373397296, 0.10219434318937977, 0.27364092564413367, 0.16108828604473432, 0.27079707584728985, -0.4035348167215803, -0.23450979465772784, 0.04697971022862913, 0.14714615055380909, -0.017772044034156585, -0.0552514326335036, -0.27534913476924167, 0.05682666183106209, -0.15820026692507186, -0.19015690203952162, 0.05454497099538943, 0.021419036836727502, 0.0022422966277716974, -0.21683187993187317, 0.03125639485993555, -0.04290129721892955, 0.13821794366800136, -0.0768672109746087, -0.08751123890550316, 0.023260478169265155, 0.07733810097469311, -0.0266790803857988, 0.0694441339928881, 0.14691647952352477, -0.1086588729460783, -0.02755439156120209, 0.38673921091888186, -0.08672032102689066, 0.0016752489478348341, 0.21518861136794848, -0.2503885063657859, -0.08601740423477906, 0.20538884948911076, 0.1442456697936597, 0.1031835998156409, -0.12235796382944834, 0.03927131493959254, 0.027841332091956883, 0.23717181114094765, 0.11009280047120344, 0.13539814402846465, 0.35947312052270636, 0.22450573915699706, 0.11207464134103541, 0.04653580264491204, -0.3090732034884001, 0.015964783892242054, -0.20649413827323543, -0.12230198544141997, -0.13620995023616947, 0.10250748621303801, -0.16352592289145368, -0.09301641806820057, 0.3736931302801783, 0.1612766724783591, 0.13846684031580625, 0.03194363372789038, 0.3870324854725006, 0.004822652699877473, 0.1611312906383852, 0.008135489359694091, 0.35767167151198354, 0.12749987199843013, 0.1382313045301944, -0.15553732625387356, 0.01154601073620799, -0.02055210537273661]
|
1,803.0432
|
Kramers degeneracy and relaxation in vanadium, niobium and tantalum
clusters
|
In this work we use magnetic deflection of V, Nb, and Ta atomic clusters to
measure their magnetic moments. While only a few of the clusters show weak
magnetism, all odd-numbered clusters deflect due to the presence of a single
unpaired electron. Surprisingly, for majority of V and Nb clusters an
atomic-like behavior is found, which is a direct indication of the absence of
spin-lattice interaction. This is in agreement with Kramers degeneracy theorem
for systems with a half-integer spin. This purely quantum phenomenon is
surprisingly observed for large systems of more than 20 atoms, and also
indicates various quantum relaxation processes, via Raman two-phonon and Orbach
high-spin mechanisms. In heavier, Ta clusters, the relaxation is always
present, probably due to larger masses and thus lower phonon energies, as well
as increased spin-orbit coupling.
|
physics.atm-clus
|
in this work we use magnetic deflection of v nb and ta atomic clusters to measure their magnetic moments while only a few of the clusters show weak magnetism all oddnumbered clusters deflect due to the presence of a single unpaired electron surprisingly for majority of v and nb clusters an atomiclike behavior is found which is a direct indication of the absence of spinlattice interaction this is in agreement with kramers degeneracy theorem for systems with a halfinteger spin this purely quantum phenomenon is surprisingly observed for large systems of more than 20 atoms and also indicates various quantum relaxation processes via raman twophonon and orbach highspin mechanisms in heavier ta clusters the relaxation is always present probably due to larger masses and thus lower phonon energies as well as increased spinorbit coupling
|
[['in', 'this', 'work', 'we', 'use', 'magnetic', 'deflection', 'of', 'v', 'nb', 'and', 'ta', 'atomic', 'clusters', 'to', 'measure', 'their', 'magnetic', 'moments', 'while', 'only', 'a', 'few', 'of', 'the', 'clusters', 'show', 'weak', 'magnetism', 'all', 'oddnumbered', 'clusters', 'deflect', 'due', 'to', 'the', 'presence', 'of', 'a', 'single', 'unpaired', 'electron', 'surprisingly', 'for', 'majority', 'of', 'v', 'and', 'nb', 'clusters', 'an', 'atomiclike', 'behavior', 'is', 'found', 'which', 'is', 'a', 'direct', 'indication', 'of', 'the', 'absence', 'of', 'spinlattice', 'interaction', 'this', 'is', 'in', 'agreement', 'with', 'kramers', 'degeneracy', 'theorem', 'for', 'systems', 'with', 'a', 'halfinteger', 'spin', 'this', 'purely', 'quantum', 'phenomenon', 'is', 'surprisingly', 'observed', 'for', 'large', 'systems', 'of', 'more', 'than', '20', 'atoms', 'and', 'also', 'indicates', 'various', 'quantum', 'relaxation', 'processes', 'via', 'raman', 'twophonon', 'and', 'orbach', 'highspin', 'mechanisms', 'in', 'heavier', 'ta', 'clusters', 'the', 'relaxation', 'is', 'always', 'present', 'probably', 'due', 'to', 'larger', 'masses', 'and', 'thus', 'lower', 'phonon', 'energies', 'as', 'well', 'as', 'increased', 'spinorbit', 'coupling']]
|
[-0.12938105927888, 0.2291414227881582, 0.004336966027908806, 0.0931283381277584, -0.02576023960006493, -0.1320113770406582, 0.0908418462782014, 0.366888611980561, -0.24395157409998686, -0.32606085863158996, -0.03871512130413677, -0.31371974654551316, -0.07563254363668054, 0.1998784216694228, 0.06706628933854734, -0.04438397689694678, 0.03635988323671271, -0.01080634505049249, -0.04935818615564103, -0.21050463257176774, 0.26465364004165604, 0.05107330278004346, 0.2716957975644618, 0.08564447925717973, 0.033132310796862664, 0.011742379909047663, 0.10272648801276488, 0.007791800974388676, -0.0741996373720606, 0.08991441364380975, 0.2265443292350001, -0.03898135890989606, 0.23718248748171852, -0.41477207629593893, -0.17493126768646622, 0.061149215134583525, 0.19059677733587962, 0.18139236627594887, -0.07500521750886553, -0.2532390538088755, 0.06016150755640953, -0.15247516612584855, -0.12024870404362012, -0.07628693251606466, 0.0649535452057399, -0.013487079516557088, -0.2605190685630512, 0.14867237153086887, 0.09695377158532753, 0.09745606625758445, -0.08588656229870532, -0.13763153995039748, -0.04591629997420528, 0.04342471669799885, 0.059356504031318, 0.04447367580419879, 0.14200521767514743, -0.08725648015996428, -0.11134375500885436, 0.4001987643414803, -0.04907784415915028, -0.0910746450747716, 0.23796609544139632, -0.1897571950016279, -0.10767319625410349, 0.15450701905664668, 0.10576222252114606, 0.1152472419302855, -0.1507272195112683, 0.04623707516749612, -0.002256282820686031, 0.1898929363928054, 0.04086486453802061, 0.10215265146727498, 0.23974515053916223, 0.15080162868557026, 0.08029486980539427, 0.11891895391172104, -0.10498201806417931, -0.05907427755691834, -0.2134052559163477, -0.15010924809160572, -0.19745662325294688, 0.09955377313360544, -0.05764532287150305, -0.1535966999397905, 0.31055805944392817, 0.08410629182497957, 0.22693762561278558, -0.020999773844221692, 0.25636528027869426, 0.11609745908219284, 0.09156218426972766, 0.025916699113310383, 0.2842519082573812, 0.2135017384330172, 0.08189785461038795, -0.2893036732592606, 0.0670014141412424, -0.018547525309693457]
|
1,803.04321
|
Structure-based Sybil Detection in Social Networks via Local Rule-based
Propagation
|
Sybil detection in social networks is a basic security research problem.
Structure-based methods have been shown to be promising at detecting Sybils.
Existing structure-based methods can be classified into Random Walk (RW)-based
methods and Loop Belief Propagation (LBP)-based methods. RW-based methods
cannot leverage labeled Sybils and labeled benign users simultaneously, which
limits their detection accuracy, and/or they are not robust to noisy labels.
LBP-based methods are not scalable and cannot guarantee convergence. In this
work, we propose SybilSCAR, a novel structure-based method to detect Sybils in
social networks. SybilSCAR is Scalable, Convergent, Accurate, and Robust to
label noise. We first propose a framework to unify RW-based and LBP-based
methods. Under our framework, these methods can be viewed as iteratively
applying a (different) local rule to every user, which propagates label
information among a social graph. Second, we design a new local rule, which
SybilSCAR iteratively applies to every user to detect Sybils. We compare
SybilSCAR with state-of-the-art RW-based and LBP-based methods theoretically
and empirically. Theoretically, we show that, with proper parameter settings,
SybilSCAR has a tighter asymptotical bound on the number of Sybils that are
falsely accepted into a social network than existing structure-based methods.
Empirically, we perform evaluation using both social networks with synthesized
Sybils and a large-scale Twitter dataset (41.7M nodes and 1.2B edges) with real
Sybils. Our results show that 1) SybilSCAR is substantially more accurate and
more robust to label noise than state-of-the-art RW-based methods; 2) SybilSCAR
is more accurate and one order of magnitude more scalable than state-of-the-art
LBP-based methods.
|
cs.CR cs.SI
|
sybil detection in social networks is a basic security research problem structurebased methods have been shown to be promising at detecting sybils existing structurebased methods can be classified into random walk rwbased methods and loop belief propagation lbpbased methods rwbased methods cannot leverage labeled sybils and labeled benign users simultaneously which limits their detection accuracy andor they are not robust to noisy labels lbpbased methods are not scalable and cannot guarantee convergence in this work we propose sybilscar a novel structurebased method to detect sybils in social networks sybilscar is scalable convergent accurate and robust to label noise we first propose a framework to unify rwbased and lbpbased methods under our framework these methods can be viewed as iteratively applying a different local rule to every user which propagates label information among a social graph second we design a new local rule which sybilscar iteratively applies to every user to detect sybils we compare sybilscar with stateoftheart rwbased and lbpbased methods theoretically and empirically theoretically we show that with proper parameter settings sybilscar has a tighter asymptotical bound on the number of sybils that are falsely accepted into a social network than existing structurebased methods empirically we perform evaluation using both social networks with synthesized sybils and a largescale twitter dataset 417m nodes and 12b edges with real sybils our results show that 1 sybilscar is substantially more accurate and more robust to label noise than stateoftheart rwbased methods 2 sybilscar is more accurate and one order of magnitude more scalable than stateoftheart lbpbased methods
|
[['sybil', 'detection', 'in', 'social', 'networks', 'is', 'a', 'basic', 'security', 'research', 'problem', 'structurebased', 'methods', 'have', 'been', 'shown', 'to', 'be', 'promising', 'at', 'detecting', 'sybils', 'existing', 'structurebased', 'methods', 'can', 'be', 'classified', 'into', 'random', 'walk', 'rwbased', 'methods', 'and', 'loop', 'belief', 'propagation', 'lbpbased', 'methods', 'rwbased', 'methods', 'can', 'not', 'leverage', 'labeled', 'sybils', 'and', 'labeled', 'benign', 'users', 'simultaneously', 'which', 'limits', 'their', 'detection', 'accuracy', 'andor', 'they', 'are', 'not', 'robust', 'to', 'noisy', 'labels', 'lbpbased', 'methods', 'are', 'not', 'scalable', 'and', 'can', 'not', 'guarantee', 'convergence', 'in', 'this', 'work', 'we', 'propose', 'sybilscar', 'a', 'novel', 'structurebased', 'method', 'to', 'detect', 'sybils', 'in', 'social', 'networks', 'sybilscar', 'is', 'scalable', 'convergent', 'accurate', 'and', 'robust', 'to', 'label', 'noise', 'we', 'first', 'propose', 'a', 'framework', 'to', 'unify', 'rwbased', 'and', 'lbpbased', 'methods', 'under', 'our', 'framework', 'these', 'methods', 'can', 'be', 'viewed', 'as', 'iteratively', 'applying', 'a', 'different', 'local', 'rule', 'to', 'every', 'user', 'which', 'propagates', 'label', 'information', 'among', 'a', 'social', 'graph', 'second', 'we', 'design', 'a', 'new', 'local', 'rule', 'which', 'sybilscar', 'iteratively', 'applies', 'to', 'every', 'user', 'to', 'detect', 'sybils', 'we', 'compare', 'sybilscar', 'with', 'stateoftheart', 'rwbased', 'and', 'lbpbased', 'methods', 'theoretically', 'and', 'empirically', 'theoretically', 'we', 'show', 'that', 'with', 'proper', 'parameter', 'settings', 'sybilscar', 'has', 'a', 'tighter', 'asymptotical', 'bound', 'on', 'the', 'number', 'of', 'sybils', 'that', 'are', 'falsely', 'accepted', 'into', 'a', 'social', 'network', 'than', 'existing', 'structurebased', 'methods', 'empirically', 'we', 'perform', 'evaluation', 'using', 'both', 'social', 'networks', 'with', 'synthesized', 'sybils', 'and', 'a', 'largescale', 'twitter', 'dataset', '417m', 'nodes', 'and', '12b', 'edges', 'with', 'real', 'sybils', 'our', 'results', 'show', 'that', '1', 'sybilscar', 'is', 'substantially', 'more', 'accurate', 'and', 'more', 'robust', 'to', 'label', 'noise', 'than', 'stateoftheart', 'rwbased', 'methods', '2', 'sybilscar', 'is', 'more', 'accurate', 'and', 'one', 'order', 'of', 'magnitude', 'more', 'scalable', 'than', 'stateoftheart', 'lbpbased', 'methods']]
|
[-0.05459038684580264, 0.0065140191318278085, -0.06915246511016448, 0.10221943903911779, -0.14252198190661147, -0.22761357609851984, 0.0761136152217432, 0.482994282963773, -0.2241181377958128, -0.3070435779809486, 0.0568894776884008, -0.2938284184335771, -0.21536586077604625, 0.188218940198567, -0.11966416547329572, 0.06150190230619046, 0.11100166286269086, 0.042539364760159515, -0.04337783076107371, -0.3259692151247009, 0.24830328116968303, 0.029191611345595447, 0.3219020342312433, 0.03774486155430168, 0.08167133057577303, -0.0548624051234583, -0.019758864185860148, 0.07029533440640989, -0.07578750613762963, 0.1685444336872024, 0.31204583601629565, 0.21680384538922226, 0.3464497101595043, -0.4021424493428185, -0.23323266927400255, 0.14403399320144672, 0.1623772656203073, 0.15461263340228015, -0.004885787776174766, -0.3726940002434276, 0.16793904333826504, -0.19406607439123036, 0.006631623113207752, -0.193226972114644, -0.04728803383659397, 0.0020067349323653616, -0.30931456538564817, 0.051336118071048986, 0.027376445170602892, 0.01816131041778135, 0.01116756789815554, -0.12442985076631885, 0.01885315153595002, 0.13852421035153384, 0.017065647829440422, 0.02467726815984861, 0.14575354808812335, -0.11491028609452769, -0.19745232959212444, 0.3543672619280187, -0.030697577756143346, -0.20479913352119183, 0.20996887323508417, 0.0028649077281670543, -0.1527826705651023, 0.11197927131070173, 0.23158958257045015, 0.1828960537450257, -0.16517571043368662, -0.04016465719155349, -0.033268072003011184, 0.18280947472521802, 0.021920976370893186, 0.0004092721919732867, 0.11600070867825707, 0.209447544079012, 0.12193505149571138, 0.07183403578210346, -0.09112143882430246, -0.0436635923549602, -0.1535872770800779, -0.0844015735461312, -0.16894861375658365, -0.0047483655114319845, -0.10536389711097627, -0.1371776731797354, 0.36391804930826765, 0.2611713634159969, 0.15748775216979993, 0.11709713556547285, 0.3737825775278907, 0.0197699800069131, 0.09083910567369458, 0.15257508566355682, 0.1826700589426764, 0.022199590765012545, 0.0655371692027984, -0.1150448761483176, 0.13995899390079103, 0.04997092037683615]
|
1,803.04322
|
Charmonium states in strong magnetic fields
|
The medium modifications of the masses of the charmonium states (J/$\psi$,
$\psi$(3686) and $\psi$(3770)) in asymmetric nuclear matter in the presence of
strong magnetic fields are studied using an effective chiral model. The mass
modifications arise due to medium modifications of the scalar dilaton field,
which simulates the gluon condensates of QCD within the effective hadronic
model. The effects due to the magnetic field as well as isospin asymmetry are
observed to be appreciable at high densities for the charmonium states, which
can have consequences, e,g, in the production of the open charm mesons and the
charmonium states, in the asymmetric heavy ion collisions at the compressed
baryonic matter (CBM) experiments at the future facility at GSI. The presence
of magnetic field leads to Landau quantization of the energy levels of the
proton in the asymmetric nuclear matter. The effects of the anomalous magnetic
moments of the proton and neutron on the masses of the charmonium states are
studied and are observed to lead to larger masses of the charmonium states, as
compared to when these effects are not taken into account.
|
nucl-th hep-ph
|
the medium modifications of the masses of the charmonium states jpsi psi3686 and psi3770 in asymmetric nuclear matter in the presence of strong magnetic fields are studied using an effective chiral model the mass modifications arise due to medium modifications of the scalar dilaton field which simulates the gluon condensates of qcd within the effective hadronic model the effects due to the magnetic field as well as isospin asymmetry are observed to be appreciable at high densities for the charmonium states which can have consequences eg in the production of the open charm mesons and the charmonium states in the asymmetric heavy ion collisions at the compressed baryonic matter cbm experiments at the future facility at gsi the presence of magnetic field leads to landau quantization of the energy levels of the proton in the asymmetric nuclear matter the effects of the anomalous magnetic moments of the proton and neutron on the masses of the charmonium states are studied and are observed to lead to larger masses of the charmonium states as compared to when these effects are not taken into account
|
[['the', 'medium', 'modifications', 'of', 'the', 'masses', 'of', 'the', 'charmonium', 'states', 'jpsi', 'psi3686', 'and', 'psi3770', 'in', 'asymmetric', 'nuclear', 'matter', 'in', 'the', 'presence', 'of', 'strong', 'magnetic', 'fields', 'are', 'studied', 'using', 'an', 'effective', 'chiral', 'model', 'the', 'mass', 'modifications', 'arise', 'due', 'to', 'medium', 'modifications', 'of', 'the', 'scalar', 'dilaton', 'field', 'which', 'simulates', 'the', 'gluon', 'condensates', 'of', 'qcd', 'within', 'the', 'effective', 'hadronic', 'model', 'the', 'effects', 'due', 'to', 'the', 'magnetic', 'field', 'as', 'well', 'as', 'isospin', 'asymmetry', 'are', 'observed', 'to', 'be', 'appreciable', 'at', 'high', 'densities', 'for', 'the', 'charmonium', 'states', 'which', 'can', 'have', 'consequences', 'eg', 'in', 'the', 'production', 'of', 'the', 'open', 'charm', 'mesons', 'and', 'the', 'charmonium', 'states', 'in', 'the', 'asymmetric', 'heavy', 'ion', 'collisions', 'at', 'the', 'compressed', 'baryonic', 'matter', 'cbm', 'experiments', 'at', 'the', 'future', 'facility', 'at', 'gsi', 'the', 'presence', 'of', 'magnetic', 'field', 'leads', 'to', 'landau', 'quantization', 'of', 'the', 'energy', 'levels', 'of', 'the', 'proton', 'in', 'the', 'asymmetric', 'nuclear', 'matter', 'the', 'effects', 'of', 'the', 'anomalous', 'magnetic', 'moments', 'of', 'the', 'proton', 'and', 'neutron', 'on', 'the', 'masses', 'of', 'the', 'charmonium', 'states', 'are', 'studied', 'and', 'are', 'observed', 'to', 'lead', 'to', 'larger', 'masses', 'of', 'the', 'charmonium', 'states', 'as', 'compared', 'to', 'when', 'these', 'effects', 'are', 'not', 'taken', 'into', 'account']]
|
[-0.07023635498826279, 0.2821451763778056, -0.09525088267656719, 0.1524464752554515, -0.005521851141456064, -0.06821538935412888, 0.004103514315319954, 0.3163023212678976, -0.182808641968602, -0.2987906089958295, -0.006649541738315148, -0.3023104114140701, 0.04648000107576641, 0.09644650007536697, 0.0798926052808823, 0.07233608699311594, 0.02847472120045715, 0.05922048930129917, -0.046556390095297454, -0.1922780746168068, 0.349287611399112, 0.05801965979536852, 0.2198957317703209, 0.2055237830135521, 0.021652298155598916, -0.019077987600422393, 0.019916298857104584, -0.01179035834118642, -0.07089759908462388, 0.03348314954120804, 0.2215921383857686, 0.015430138008873705, 0.15259033976286485, -0.45793876363025915, -0.18230440879527193, 0.11044815152878412, 0.1298122127877982, 0.162098010389165, -0.07138214278313751, -0.3299545603356539, 0.07769884285181224, -0.17690593962158477, -0.14907305557178435, -0.08171156920610344, -0.018021369312639132, -0.002699893131688401, -0.30676136960040085, 0.1159578926402661, -0.039067067831478355, -0.0004889682423998858, -0.1020052623666393, -0.2297436180166327, -0.05495616981815956, 0.029957910142052194, 0.11240374828320365, 0.0695019990198089, 0.20972356650911803, -0.20980781600983292, -0.13483341811877256, 0.4360598480983914, -0.05127773968922486, -0.12133336762621344, 0.14840878016708142, -0.19946192418337688, -0.10153387507147432, 0.14700301511438338, 0.24474962695327762, 0.06044493947219062, -0.12946166454951577, 0.08297005790966348, -0.013042653491208842, 0.10941034367101815, 0.07711882920229582, 0.1395623015347295, 0.27232452103315474, 0.15301129639859998, -0.040294524953843884, 0.0805717503382846, -0.11564613073670234, -0.09731074878152787, -0.32811853982723105, -0.08235395477654842, -0.10862148129432411, 0.029836915961833247, -0.0459926113032782, -0.11595626657951501, 0.4088415198391406, 0.07629298790521756, 0.22864001824975955, -0.08670861883073595, 0.30673912193134917, 0.11049418942043353, 0.09897502155585604, 0.07839836777766122, 0.3187952904071618, 0.2445959955822308, 0.1529302477266046, -0.35244904512380876, 0.021460351994731924, -0.02166816634177179]
|
1,803.04323
|
The formation of astrophysical Mg-rich silicate dust
|
We present new results for ground-state candidate energies of Mg-rich olivine
(MRO) clusters and use the binding energies of these clusters to determine
their nucleation rates in stellar outflows, with particular interest in the en-
vironments of core-collapse supernovae (CCSNe). Low-lying structures of
clusters (Mg2SiO4)n 2 \le n \le 13 are determined from a modified minima
hopping algorithm using an empirical silicate potential in the Buckingham form.
These configurations are further refined and optimized using the den- sity
functional theory code Quantum Espresso. Utilizing atomistic nucleation theory,
we determine the critical size and nucleation rates of these clusters. We find
that configurations and binding energies in this regime are very dis- similar
from those of the bulk lattice. Clusters grow with SiO_4-MgO layering and
exhibit only global, rather than local, symmetries. When compared to classical
nucleation theory we find suppressed nucleation rates at most temperatures and
pressures, with enhanced nucleation rates at very large pressures. This implies
a slower progression of silicate dust formation in stellar environments than
previously assumed.
|
astro-ph.SR
|
we present new results for groundstate candidate energies of mgrich olivine mro clusters and use the binding energies of these clusters to determine their nucleation rates in stellar outflows with particular interest in the en vironments of corecollapse supernovae ccsne lowlying structures of clusters mg2sio4n 2 le n le 13 are determined from a modified minima hopping algorithm using an empirical silicate potential in the buckingham form these configurations are further refined and optimized using the den sity functional theory code quantum espresso utilizing atomistic nucleation theory we determine the critical size and nucleation rates of these clusters we find that configurations and binding energies in this regime are very dis similar from those of the bulk lattice clusters grow with sio_4mgo layering and exhibit only global rather than local symmetries when compared to classical nucleation theory we find suppressed nucleation rates at most temperatures and pressures with enhanced nucleation rates at very large pressures this implies a slower progression of silicate dust formation in stellar environments than previously assumed
|
[['we', 'present', 'new', 'results', 'for', 'groundstate', 'candidate', 'energies', 'of', 'mgrich', 'olivine', 'mro', 'clusters', 'and', 'use', 'the', 'binding', 'energies', 'of', 'these', 'clusters', 'to', 'determine', 'their', 'nucleation', 'rates', 'in', 'stellar', 'outflows', 'with', 'particular', 'interest', 'in', 'the', 'en', 'vironments', 'of', 'corecollapse', 'supernovae', 'ccsne', 'lowlying', 'structures', 'of', 'clusters', 'mg2sio4n', '2', 'le', 'n', 'le', '13', 'are', 'determined', 'from', 'a', 'modified', 'minima', 'hopping', 'algorithm', 'using', 'an', 'empirical', 'silicate', 'potential', 'in', 'the', 'buckingham', 'form', 'these', 'configurations', 'are', 'further', 'refined', 'and', 'optimized', 'using', 'the', 'den', 'sity', 'functional', 'theory', 'code', 'quantum', 'espresso', 'utilizing', 'atomistic', 'nucleation', 'theory', 'we', 'determine', 'the', 'critical', 'size', 'and', 'nucleation', 'rates', 'of', 'these', 'clusters', 'we', 'find', 'that', 'configurations', 'and', 'binding', 'energies', 'in', 'this', 'regime', 'are', 'very', 'dis', 'similar', 'from', 'those', 'of', 'the', 'bulk', 'lattice', 'clusters', 'grow', 'with', 'sio_4mgo', 'layering', 'and', 'exhibit', 'only', 'global', 'rather', 'than', 'local', 'symmetries', 'when', 'compared', 'to', 'classical', 'nucleation', 'theory', 'we', 'find', 'suppressed', 'nucleation', 'rates', 'at', 'most', 'temperatures', 'and', 'pressures', 'with', 'enhanced', 'nucleation', 'rates', 'at', 'very', 'large', 'pressures', 'this', 'implies', 'a', 'slower', 'progression', 'of', 'silicate', 'dust', 'formation', 'in', 'stellar', 'environments', 'than', 'previously', 'assumed']]
|
[-0.05248175668223443, 0.18847108325123868, -0.07483356560630623, 0.12418104382092413, 0.01740386629125806, -0.0944469033790652, 0.07244437664236962, 0.39806532777265874, -0.21959499717609188, -0.3167788094348967, 0.008649771539375888, -0.27833883781097607, -0.0863883748223927, 0.15562715369951494, 0.035679407371722184, -0.015152980899020004, 0.03222044500868076, -0.04600055936429772, -0.05902186886708581, -0.29480160607030603, 0.2754631342748347, 0.09364134412813753, 0.2470201550408484, 0.024656165048234657, -0.013760116216196806, -0.07174662597098215, 0.028827654752701878, 0.00255981551394045, -0.25415475685087563, 0.0936945799133785, 0.25014478552383845, 0.04322249936999496, 0.18755081852529934, -0.4503009707449439, -0.20758049685262633, 0.06611726967154996, 0.16757509347698288, 0.15849291473804153, -0.07453028805146808, -0.21853744054720653, 0.08948122988131545, -0.16037610523726145, -0.14538625258202825, -0.04513245856411711, 0.015747467394706286, 0.06285984547596848, -0.25749733977153627, 0.15843327837287932, -0.029191008342351922, 0.0934581122372277, -0.13901462403131637, -0.16359562798776847, -0.0736239168257592, 0.05107746910374238, 0.009058762184193658, 0.016018596336992826, 0.1914773542590127, -0.14440679602313808, -0.06254168425290706, 0.3939885347635446, -0.009449931626482782, -0.04840742717103191, 0.26696781190614144, -0.18032962934345476, -0.16719087678939104, 0.1954935578305921, 0.13091352355002822, 0.14725272724973762, -0.11288896845529918, 0.03486367674826081, 0.04755062936152705, 0.1668232781087567, 0.12520729398778724, 0.038527506830248824, 0.22457719954256314, 0.1674371676025968, 0.007836464158828164, 0.07772169507688614, -0.1253031503948004, -0.09755355567241947, -0.23446422186819557, -0.11624281387218459, -0.1617058950258854, 0.0713620817900111, -0.1525066070180891, -0.15145135181816574, 0.25260007404164597, 0.10147037351271138, 0.18212208922528578, 0.06879509852963506, 0.16486679558491635, 0.03629661678241755, 0.1116956315898409, 0.11781812771599919, 0.24644147770334326, 0.12676027592015035, 0.07599879928702812, -0.24336689126728003, 0.07120115248678799, 0.05154436906872172]
|
1,803.04324
|
A random matrix perspective of cultural structure: groups or
redundancies?
|
Recent studies have highlighted interesting structural properties of
empirical cultural states: collections of cultural traits sequences of real
individuals. Matrices of similarity between individuals may be constructed from
these states, allowing for further structural insights to be gained using
concepts from random matrix theory, approach first exploited in this study. For
generating random matrices that are appropriate as a structureless reference,
we propose a null model that enforces, on average, the empirical occurrence
frequency of each possible trait. With respect to this null model, the
empirical matrices show deviating eigenvalues, which may be signatures of
subtle cultural groups. However, they can conceivably also be artifacts of
arbitrary redundancies between cultural variables. We first study this
possibility in a highly simplified setting, using a toy model that enforces a
certain level of redundancy in a minimally-biased way, in parallel with another
toy model that enforces group structure. By analyzing and comparing cultural
states generated with these toy models, we show that a deviating eigenvalue can
indeed be a redundancy signature, which can be distinguished from a grouping
signature by evaluating the uniformity of the entries of the respective
eigenvector, as well as the uniformity-based compatibility with the null model.
For empirical data, the eigenvector uniformities of all deviating eigenvalues
are shown to be compatible with the null model, apparently suggesting that we
are not dealing with genuine group structure. However, we demonstrate that some
deviating eigenvalues might actually be due to authentic groups that are
internally non-uniform. A generic procedure for distinguishing such groups from
redundancy artifacts requires further research.
|
physics.soc-ph cond-mat.stat-mech cs.CY
|
recent studies have highlighted interesting structural properties of empirical cultural states collections of cultural traits sequences of real individuals matrices of similarity between individuals may be constructed from these states allowing for further structural insights to be gained using concepts from random matrix theory approach first exploited in this study for generating random matrices that are appropriate as a structureless reference we propose a null model that enforces on average the empirical occurrence frequency of each possible trait with respect to this null model the empirical matrices show deviating eigenvalues which may be signatures of subtle cultural groups however they can conceivably also be artifacts of arbitrary redundancies between cultural variables we first study this possibility in a highly simplified setting using a toy model that enforces a certain level of redundancy in a minimallybiased way in parallel with another toy model that enforces group structure by analyzing and comparing cultural states generated with these toy models we show that a deviating eigenvalue can indeed be a redundancy signature which can be distinguished from a grouping signature by evaluating the uniformity of the entries of the respective eigenvector as well as the uniformitybased compatibility with the null model for empirical data the eigenvector uniformities of all deviating eigenvalues are shown to be compatible with the null model apparently suggesting that we are not dealing with genuine group structure however we demonstrate that some deviating eigenvalues might actually be due to authentic groups that are internally nonuniform a generic procedure for distinguishing such groups from redundancy artifacts requires further research
|
[['recent', 'studies', 'have', 'highlighted', 'interesting', 'structural', 'properties', 'of', 'empirical', 'cultural', 'states', 'collections', 'of', 'cultural', 'traits', 'sequences', 'of', 'real', 'individuals', 'matrices', 'of', 'similarity', 'between', 'individuals', 'may', 'be', 'constructed', 'from', 'these', 'states', 'allowing', 'for', 'further', 'structural', 'insights', 'to', 'be', 'gained', 'using', 'concepts', 'from', 'random', 'matrix', 'theory', 'approach', 'first', 'exploited', 'in', 'this', 'study', 'for', 'generating', 'random', 'matrices', 'that', 'are', 'appropriate', 'as', 'a', 'structureless', 'reference', 'we', 'propose', 'a', 'null', 'model', 'that', 'enforces', 'on', 'average', 'the', 'empirical', 'occurrence', 'frequency', 'of', 'each', 'possible', 'trait', 'with', 'respect', 'to', 'this', 'null', 'model', 'the', 'empirical', 'matrices', 'show', 'deviating', 'eigenvalues', 'which', 'may', 'be', 'signatures', 'of', 'subtle', 'cultural', 'groups', 'however', 'they', 'can', 'conceivably', 'also', 'be', 'artifacts', 'of', 'arbitrary', 'redundancies', 'between', 'cultural', 'variables', 'we', 'first', 'study', 'this', 'possibility', 'in', 'a', 'highly', 'simplified', 'setting', 'using', 'a', 'toy', 'model', 'that', 'enforces', 'a', 'certain', 'level', 'of', 'redundancy', 'in', 'a', 'minimallybiased', 'way', 'in', 'parallel', 'with', 'another', 'toy', 'model', 'that', 'enforces', 'group', 'structure', 'by', 'analyzing', 'and', 'comparing', 'cultural', 'states', 'generated', 'with', 'these', 'toy', 'models', 'we', 'show', 'that', 'a', 'deviating', 'eigenvalue', 'can', 'indeed', 'be', 'a', 'redundancy', 'signature', 'which', 'can', 'be', 'distinguished', 'from', 'a', 'grouping', 'signature', 'by', 'evaluating', 'the', 'uniformity', 'of', 'the', 'entries', 'of', 'the', 'respective', 'eigenvector', 'as', 'well', 'as', 'the', 'uniformitybased', 'compatibility', 'with', 'the', 'null', 'model', 'for', 'empirical', 'data', 'the', 'eigenvector', 'uniformities', 'of', 'all', 'deviating', 'eigenvalues', 'are', 'shown', 'to', 'be', 'compatible', 'with', 'the', 'null', 'model', 'apparently', 'suggesting', 'that', 'we', 'are', 'not', 'dealing', 'with', 'genuine', 'group', 'structure', 'however', 'we', 'demonstrate', 'that', 'some', 'deviating', 'eigenvalues', 'might', 'actually', 'be', 'due', 'to', 'authentic', 'groups', 'that', 'are', 'internally', 'nonuniform', 'a', 'generic', 'procedure', 'for', 'distinguishing', 'such', 'groups', 'from', 'redundancy', 'artifacts', 'requires', 'further', 'research']]
|
[-0.10055145958451199, 0.11947830113335893, -0.12871483026673938, 0.10437239774870632, -0.08722275741043199, -0.1413361600759631, 0.05221167805646311, 0.40651003806580016, -0.27596550989635144, -0.2986586107756917, 0.08467282592192119, -0.2745645644164967, -0.2169542924867008, 0.15702737394470273, -0.07700745831153098, 0.00932936188094463, 0.08777122687800255, 0.043589374005200215, -0.07518133501398128, -0.20920178419566107, 0.34349095773364957, 0.052614650414107865, 0.27265746230241417, -0.005488694426223114, 0.06716705211447298, -0.03306387324277529, -0.03960670097250897, 0.07387796869675416, -0.028342227311306614, 0.14331826157546293, 0.27495157600041936, 0.17588459869034964, 0.2663963255843923, -0.4123012948697904, -0.22032880566285828, 0.1458074204199712, 0.14804109226430293, 0.12807705068457073, -0.05065482876450186, -0.32149482251721134, 0.11203553670281653, -0.15719454277647435, -0.12734001096345282, -0.11651799425660317, -0.02705681392314195, 0.009732948728485562, -0.27992288859657116, 0.08091609676244872, 0.051797753492105705, 0.08275209016845868, -0.04522604157908997, -0.12786293499251458, -0.032072821806877094, 0.1463673607575805, 0.0863077676173749, -0.034864102163535984, 0.11102934096711561, -0.08450502949016683, -0.13700050803296385, 0.37048405045752164, -0.0295515648607556, -0.2210772765570697, 0.19149601719693682, -0.12674240415991947, -0.1466273605082445, 0.07504793439343108, 0.15525849175128492, 0.057214536720430226, -0.1609303836169669, 0.05318193322709845, -0.07787385506098836, 0.16374382505678944, 0.0637377452119779, 0.03798586371126458, 0.23197642966546844, 0.11458489928301242, 0.03884914719883773, 0.12359164185198712, -0.0069981606012203, -0.09079868115637821, -0.2846284034781535, -0.1342828148841887, -0.17818743963535613, 0.059282198694232464, -0.13511063301511578, -0.16863901835197223, 0.400795461396154, 0.16795759015727485, 0.23797526173583497, 0.06057829254466301, 0.24086235537817013, 0.08490614645257374, 0.08301793394025038, 0.056148468078284414, 0.1694011852071133, 0.09166350122178807, 0.021278569777405564, -0.15436402620980516, 0.11850514908498769, 0.02643170072842056]
|
1,803.04325
|
Point Location in Dynamic Planar Subdivisions
|
We study the point location problem on dynamic planar subdivisions that
allows insertions and deletions of edges. In our problem, the underlying graph
of a subdivision is not necessarily connected. We present a data structure of
linear size for such a dynamic planar subdivision that supports sublinear-time
update and polylogarithmic-time query. Precisely, the amortized update time is
$O(\sqrt{n}\log n(\log\log n)^{3/2})$ and the query time is $O(\log n(\log\log
n)^2)$, where $n$ is the number of edges in the subdivision. This answers a
question posed by Snoeyink in the Handbook of Computational Geometry. When only
deletions of edges are allowed, the update time and query time are just
$O(\alpha(n))$ and $O(\log n)$, respectively.
|
cs.CG
|
we study the point location problem on dynamic planar subdivisions that allows insertions and deletions of edges in our problem the underlying graph of a subdivision is not necessarily connected we present a data structure of linear size for such a dynamic planar subdivision that supports sublineartime update and polylogarithmictime query precisely the amortized update time is osqrtnlog nloglog n32 and the query time is olog nloglog n2 where n is the number of edges in the subdivision this answers a question posed by snoeyink in the handbook of computational geometry when only deletions of edges are allowed the update time and query time are just oalphan and olog n respectively
|
[['we', 'study', 'the', 'point', 'location', 'problem', 'on', 'dynamic', 'planar', 'subdivisions', 'that', 'allows', 'insertions', 'and', 'deletions', 'of', 'edges', 'in', 'our', 'problem', 'the', 'underlying', 'graph', 'of', 'a', 'subdivision', 'is', 'not', 'necessarily', 'connected', 'we', 'present', 'a', 'data', 'structure', 'of', 'linear', 'size', 'for', 'such', 'a', 'dynamic', 'planar', 'subdivision', 'that', 'supports', 'sublineartime', 'update', 'and', 'polylogarithmictime', 'query', 'precisely', 'the', 'amortized', 'update', 'time', 'is', 'osqrtnlog', 'nloglog', 'n32', 'and', 'the', 'query', 'time', 'is', 'olog', 'nloglog', 'n2', 'where', 'n', 'is', 'the', 'number', 'of', 'edges', 'in', 'the', 'subdivision', 'this', 'answers', 'a', 'question', 'posed', 'by', 'snoeyink', 'in', 'the', 'handbook', 'of', 'computational', 'geometry', 'when', 'only', 'deletions', 'of', 'edges', 'are', 'allowed', 'the', 'update', 'time', 'and', 'query', 'time', 'are', 'just', 'oalphan', 'and', 'olog', 'n', 'respectively']]
|
[-0.18447081455205744, 0.09826127315560977, 0.012449090058604876, 0.03091031394223473, -0.10289336117991321, -0.16797786113713775, 0.1589013203739415, 0.3836397909064282, -0.29292391411758756, -0.3639479622848936, 0.10782707652165177, -0.31037971318863555, -0.14400407854836803, 0.050235888199159154, -0.12052901730629371, 0.07707104305023546, 0.07788746995087881, 0.06213645801904637, 0.04046469959975765, -0.33799065378843807, 0.22591952859373712, 0.011503837251750467, 0.1524908274982695, 0.04302209502438436, 0.007939050314939572, 0.05926416930952319, -0.047156013426714924, 0.051171964877662623, -0.13444257516747965, 0.04669890138750627, 0.2784594855195767, 0.18892122868465278, 0.23923295451252646, -0.4801840651780367, -0.10539084017645937, 0.1044690984055853, 0.16849369856923282, 0.07985119130839971, -0.0028333057867581243, -0.18427236860844534, 0.08529433651684641, -0.019734273245138628, -0.051925139200689086, 0.005674800606914335, 0.11259717950681308, -0.04187537492504595, -0.31446243716280087, -0.0071936645503113935, 0.11188428372413188, -0.01937051893522342, 0.029066785135377735, -0.09432215853552292, 0.014376049122966087, 0.11154456268749535, -0.08406272629141673, 0.10964425769634545, 0.04416604467084514, -0.07191631905021365, -0.19874598065743576, 0.3596836021673438, -0.008214776433568011, -0.17466829497333583, 0.08239369168625893, -0.14033593400591263, -0.19040735603020703, 0.13067808336167186, 0.17048539495020099, 0.18521893615540755, -0.06445167166600947, 0.20480271759558352, -0.11263888231520583, 0.1994354948078949, 0.149185342328237, 0.009228476998605975, 0.04529418187585097, 0.1952773127432174, 0.13015723212513033, 0.12962520610843156, -0.028519115802991362, -0.06598062053960455, -0.29429313510253624, -0.15394822762322588, -0.23845690307165454, 0.03163806194880545, -0.2196708289220214, -0.19924554484686605, 0.3893685734218305, 0.09422587932230116, 0.25902972252922013, 0.1695024237489781, 0.30566770353497147, 0.0592002794996055, 0.027253112730544968, 0.21091442309353534, 0.059327686234872355, 0.028607703504144207, 0.049940075230289684, -0.21430942343615061, 0.15305749950552913, 0.14236676838534237]
|
1,803.04326
|
Geometric Brauer residue via root stacks
|
We reinterpret the residue map for the Brauer group of a smooth variety using
a root stack construction and Weil restriction for algebraic stacks, and apply
the result to find a geometric representative of for the residue of a Brauer
class associated to a conic bundle, or more generally a Brauer-Severi bundle.
|
math.AG
|
we reinterpret the residue map for the brauer group of a smooth variety using a root stack construction and weil restriction for algebraic stacks and apply the result to find a geometric representative of for the residue of a brauer class associated to a conic bundle or more generally a brauerseveri bundle
|
[['we', 'reinterpret', 'the', 'residue', 'map', 'for', 'the', 'brauer', 'group', 'of', 'a', 'smooth', 'variety', 'using', 'a', 'root', 'stack', 'construction', 'and', 'weil', 'restriction', 'for', 'algebraic', 'stacks', 'and', 'apply', 'the', 'result', 'to', 'find', 'a', 'geometric', 'representative', 'of', 'for', 'the', 'residue', 'of', 'a', 'brauer', 'class', 'associated', 'to', 'a', 'conic', 'bundle', 'or', 'more', 'generally', 'a', 'brauerseveri', 'bundle']]
|
[-0.17306432889801307, -0.030303705143384062, -0.14082050789147615, 0.10745785761481294, -0.16449477167155307, -0.14138729825544244, 0.021978623466566205, 0.2969749995256559, -0.3621128899260209, -0.22131980089649844, 0.09161652936689699, -0.18008707780749178, -0.15535908835814694, 0.23557446828523937, -0.16389365737827924, -0.04623114109898989, 0.0178210036112712, 0.11796209954011899, -0.14955679413217765, -0.276957741262427, 0.4635462836863903, -0.05188715927159557, 0.24168118263164964, 0.01809336505875063, 0.1367528889184961, 0.07074531990712365, 0.014897907690073434, 0.020684312724579986, -0.10356244255896084, 0.14888626111384767, 0.3311410654255619, 0.04793980873476427, 0.16788748615922836, -0.36341869472884214, -0.1567116029904215, 0.21483578856210583, 0.09233997558028652, 0.07111807937662189, -0.03522656385729743, -0.22577112031061775, 0.14624150026625451, -0.19798586811297214, -0.17044232485708422, -0.05739112551180789, 0.05962844687299086, 0.01311003825125786, -0.2509828490885691, -0.09414099616249307, 0.06084423508638373, 0.1968783459518678, -0.08428712020843075, -0.10747397651385444, -0.08200377584076844, 0.028700850012962922, -0.05806599421283373, 0.07292301103007048, 0.15688414969302428, -0.12057336760111727, -0.09690000088169025, 0.35892873257398605, -0.09052067378965709, -0.2289373728697403, 0.09913612719481954, -0.07877179472528112, -0.1668624728738975, 0.2036993282739646, 0.12130088745974578, 0.18532702448562935, 0.022806035542788986, 0.13811833826744427, -0.13203711256098288, 0.06287644405920918, 0.045588220487563655, -0.0686929570331883, 0.12976185291504058, 0.08259408593249436, 0.08800313729219712, 0.14437066591702974, -0.04996968405612279, -0.05825439341984188, -0.37145006148001325, -0.2897611181749828, -0.06336525831228265, 0.18556357098098558, -0.08277557332621654, -0.22267912955094987, 0.4404090880953635, 0.045643189563774146, 0.24251896838988893, 0.20480077240454891, 0.20821417517100388, 0.015760757852918826, 0.11481014336459339, -0.021044395595359113, 0.0903075796354992, 0.2534369729244365, -0.0505788995561978, -0.10359026039861, -0.03167032900875291, 0.18147848492774826]
|
1,803.04327
|
New Algorithms for Weighted $k$-Domination and Total $k$-Domination
Problems in Proper Interval Graphs
|
Given a positive integer $k$, a $k$-dominating set in a graph $G$ is a set of
vertices such that every vertex not in the set has at least $k$ neighbors in
the set. A total $k$-dominating set, also known as a $k$-tuple total dominating
set, is a set of vertices such that every vertex of the graph has at least $k$
neighbors in the set. The problems of finding the minimum size of a
$k$-dominating, respectively total $k$-dominating set, in a given graph, are
referred to as $k$-domination, respectively total $k$-domination. These
generalizations of the classical domination and total domination problems are
known to be NP-hard in the class of chordal graphs, and, more specifically,
even in the classes of split graphs (both problems) and undirected path graphs
(in the case of total $k$-domination). On the other hand, it follows from
recent work of Kang et al.~(2017) that these two families of problems are
solvable in time $\mathcal{O}(|V(G)|^{6k+4})$ in the class of interval graphs.
We develop faster algorithms for $k$-domination and total $k$-domination in the
class of proper interval graphs, by means of reduction to a single shortest
path computation in a derived directed acyclic graph with
$\mathcal{O}(|V(G)|^{2k})$ nodes and $\mathcal{O}(|V(G)|^{4k})$ arcs. We show
that a suitable implementation, which avoids constructing all arcs of the
digraph, leads to a running time of $\mathcal{O}(|V(G)|^{3k})$. The algorithms
are also applicable to the weighted case.
|
cs.DS cs.DM math.CO
|
given a positive integer k a kdominating set in a graph g is a set of vertices such that every vertex not in the set has at least k neighbors in the set a total kdominating set also known as a ktuple total dominating set is a set of vertices such that every vertex of the graph has at least k neighbors in the set the problems of finding the minimum size of a kdominating respectively total kdominating set in a given graph are referred to as kdomination respectively total kdomination these generalizations of the classical domination and total domination problems are known to be nphard in the class of chordal graphs and more specifically even in the classes of split graphs both problems and undirected path graphs in the case of total kdomination on the other hand it follows from recent work of kang et al2017 that these two families of problems are solvable in time mathcalovg6k4 in the class of interval graphs we develop faster algorithms for kdomination and total kdomination in the class of proper interval graphs by means of reduction to a single shortest path computation in a derived directed acyclic graph with mathcalovg2k nodes and mathcalovg4k arcs we show that a suitable implementation which avoids constructing all arcs of the digraph leads to a running time of mathcalovg3k the algorithms are also applicable to the weighted case
|
[['given', 'a', 'positive', 'integer', 'k', 'a', 'kdominating', 'set', 'in', 'a', 'graph', 'g', 'is', 'a', 'set', 'of', 'vertices', 'such', 'that', 'every', 'vertex', 'not', 'in', 'the', 'set', 'has', 'at', 'least', 'k', 'neighbors', 'in', 'the', 'set', 'a', 'total', 'kdominating', 'set', 'also', 'known', 'as', 'a', 'ktuple', 'total', 'dominating', 'set', 'is', 'a', 'set', 'of', 'vertices', 'such', 'that', 'every', 'vertex', 'of', 'the', 'graph', 'has', 'at', 'least', 'k', 'neighbors', 'in', 'the', 'set', 'the', 'problems', 'of', 'finding', 'the', 'minimum', 'size', 'of', 'a', 'kdominating', 'respectively', 'total', 'kdominating', 'set', 'in', 'a', 'given', 'graph', 'are', 'referred', 'to', 'as', 'kdomination', 'respectively', 'total', 'kdomination', 'these', 'generalizations', 'of', 'the', 'classical', 'domination', 'and', 'total', 'domination', 'problems', 'are', 'known', 'to', 'be', 'nphard', 'in', 'the', 'class', 'of', 'chordal', 'graphs', 'and', 'more', 'specifically', 'even', 'in', 'the', 'classes', 'of', 'split', 'graphs', 'both', 'problems', 'and', 'undirected', 'path', 'graphs', 'in', 'the', 'case', 'of', 'total', 'kdomination', 'on', 'the', 'other', 'hand', 'it', 'follows', 'from', 'recent', 'work', 'of', 'kang', 'et', 'al2017', 'that', 'these', 'two', 'families', 'of', 'problems', 'are', 'solvable', 'in', 'time', 'mathcalovg6k4', 'in', 'the', 'class', 'of', 'interval', 'graphs', 'we', 'develop', 'faster', 'algorithms', 'for', 'kdomination', 'and', 'total', 'kdomination', 'in', 'the', 'class', 'of', 'proper', 'interval', 'graphs', 'by', 'means', 'of', 'reduction', 'to', 'a', 'single', 'shortest', 'path', 'computation', 'in', 'a', 'derived', 'directed', 'acyclic', 'graph', 'with', 'mathcalovg2k', 'nodes', 'and', 'mathcalovg4k', 'arcs', 'we', 'show', 'that', 'a', 'suitable', 'implementation', 'which', 'avoids', 'constructing', 'all', 'arcs', 'of', 'the', 'digraph', 'leads', 'to', 'a', 'running', 'time', 'of', 'mathcalovg3k', 'the', 'algorithms', 'are', 'also', 'applicable', 'to', 'the', 'weighted', 'case']]
|
[-0.17399955129267733, 0.09819082987929792, -0.006079653721188375, 0.027431191183144653, -0.11738983208615855, -0.09807437979983852, 0.08020463991111651, 0.37288816867441166, -0.286122070153636, -0.3518282678141667, 0.08450375779546193, -0.3418286103068998, -0.1297172044175105, 0.16761008777712846, -0.07861987037955387, 0.044121438012409364, 0.1185840781902682, 0.11682971366762854, 0.018368446763416982, -0.308474749165869, 0.29549004198072415, -0.05458830420965362, 0.15103282765158565, 0.07038741722052484, 0.10790341463258588, 0.030156904453689463, -0.007416704728823612, 0.14587481355441637, -0.14537777700688662, 0.09912013604607955, 0.2778899110710706, 0.1879247311388322, 0.29116111287945196, -0.36502278718986064, -0.1737862486645514, 0.2339411266321692, 0.08130293582533404, 0.05918497741201958, 0.04761594660158153, -0.18431560532904737, 0.1375125337130668, -0.11418404934004668, -0.05546542255232405, 0.039844421578955166, 0.13729816330535533, 0.03455889095723825, -0.27837747971429244, -0.0018606121345982772, 0.06929282645956335, -0.00020776872325337822, 0.030590074104685828, -0.19378522890129765, -0.039842175539346054, 0.0805236901444579, -0.05824833198717546, 0.07285648169814968, 0.02335599555966869, -0.11548589094360195, -0.21224564826779738, 0.38408627732362793, -0.018125700127137333, -0.14763817831203996, 0.13908795267854115, -0.09485334661388933, -0.18081010950998844, 0.12029732864660521, 0.16380852493743428, 0.196114805939591, -0.12328013119679924, 0.11140874262542766, -0.13141322351089402, 0.08219053755716518, 0.10720680571537007, 0.019289256528983906, 0.11449815267922914, 0.13526137687139245, 0.1978593512495424, 0.18571710122494933, -0.01032928686094748, -0.027808617494118056, -0.3159155618489246, -0.10263694247349345, -0.24327774468876764, 0.02941623456954084, -0.1605782234339067, -0.20978200785701343, 0.42682859140628, 0.1020900540223872, 0.2181447199198597, 0.15114917302669614, 0.2140727676696291, 0.09514941308927455, 0.056669296670231246, 0.20301075649382383, 0.12030968861858639, 0.162202165638742, -0.020959096166239886, -0.1765186625385755, 0.05177596575512118, 0.13013434220562903]
|
1,803.04328
|
Gorenstein Fano Generic Torus Orbit closures in $G/P$
|
Given a reductive group $G$ and a parabolic subgroup $P\subset G$, with
maximaltorus $T$, we consider (following Dabrowski's work) the closure $X$ of a
generic $T$-orbit in $G/P$, and determine in combinatorial termswhen the toric
variety $X$ is $\mathbb{Q}$-Gorenstein Fano, extending in this way the
classification of smooth Fano generic closures given by Voskresenski\u{\i} and
Klyachko. As an application, we apply the well known correspondence between
Gorenstein Fano toric varieties and reflexive polytopes in order to exhibit
which reflexive polytopes correspond to generic closures -- this list includes
the reflexive root polytopes.
|
math.AG math.CO math.GR math.RT
|
given a reductive group g and a parabolic subgroup psubset g with maximaltorus t we consider following dabrowskis work the closure x of a generic torbit in gp and determine in combinatorial termswhen the toric variety x is mathbbqgorenstein fano extending in this way the classification of smooth fano generic closures given by voskresenskiui and klyachko as an application we apply the well known correspondence between gorenstein fano toric varieties and reflexive polytopes in order to exhibit which reflexive polytopes correspond to generic closures this list includes the reflexive root polytopes
|
[['given', 'a', 'reductive', 'group', 'g', 'and', 'a', 'parabolic', 'subgroup', 'psubset', 'g', 'with', 'maximaltorus', 't', 'we', 'consider', 'following', 'dabrowskis', 'work', 'the', 'closure', 'x', 'of', 'a', 'generic', 'torbit', 'in', 'gp', 'and', 'determine', 'in', 'combinatorial', 'termswhen', 'the', 'toric', 'variety', 'x', 'is', 'mathbbqgorenstein', 'fano', 'extending', 'in', 'this', 'way', 'the', 'classification', 'of', 'smooth', 'fano', 'generic', 'closures', 'given', 'by', 'voskresenskiui', 'and', 'klyachko', 'as', 'an', 'application', 'we', 'apply', 'the', 'well', 'known', 'correspondence', 'between', 'gorenstein', 'fano', 'toric', 'varieties', 'and', 'reflexive', 'polytopes', 'in', 'order', 'to', 'exhibit', 'which', 'reflexive', 'polytopes', 'correspond', 'to', 'generic', 'closures', 'this', 'list', 'includes', 'the', 'reflexive', 'root', 'polytopes']]
|
[-0.16531856763388283, -0.025595292907878917, -0.060497418479909276, 0.0794815123755887, -0.11805830284191127, -0.20319986951389266, -0.017333071827041833, 0.34977264346790354, -0.3514481218140149, -0.186750705846035, 0.06716345283943652, -0.2401205116713589, -0.17695072129241785, 0.17157380839555778, -0.2542302355022085, -0.03569398466920988, 0.015125499741936272, 0.06927797323706644, -0.12909816267008203, -0.3438055604426402, 0.4354095842943273, -0.12245476328429174, 0.222144730579616, 0.06097746728284454, 0.12370170834368434, 0.054998402653092686, 0.042184759248894727, 0.03597006821920248, -0.19230673962738365, 0.13000274701996453, 0.3824841820380904, 0.06831269859420983, 0.12422901780386879, -0.3177219461437992, -0.11517904200114902, 0.23295349261686418, 0.10472502273676748, 0.030417636870300736, 0.012252602414016357, -0.23046697616915812, 0.08611728544929065, -0.19279520206724887, -0.2150964151528156, -0.1016158169368282, 0.07835608905191872, 0.025948675296438687, -0.23734084361190486, -0.03355428541544825, 0.1522828688890017, 0.18255623255390674, -0.008054311990483919, -0.0878688152350316, -0.08946649223534306, -0.007805228937120939, -0.08375579005355989, 0.07983330419731581, 0.036765868643256414, -0.07457518252935684, -0.17519900654654272, 0.40573509029028093, -0.043624033766470595, -0.20795693223110653, 0.14092361614827745, -0.18891134032111784, -0.13675039340953596, 0.158901090854091, 0.13446673610914414, 0.20196243600433014, -0.005846797716168856, 0.18359290074228987, -0.17930071914187548, -0.012181567716073583, 0.1063805853588168, -0.0414796156110242, 0.129468610068381, 0.15675887880868025, 0.0812996784992389, 0.11599424036897042, 0.02045934854752638, 0.02568307042714547, -0.3896924013864588, -0.13341140538581053, -0.11083418589656834, 0.19523983358257366, -0.11948148042574758, -0.16501609880519522, 0.39731352736072784, 0.0002378537848761136, 0.2378765410817736, 0.09512492181569211, 0.17531046736985445, -0.018684510989590886, 0.016131178970681503, 0.08483928360874415, 0.0904069503012579, 0.235932985820744, -0.10909235931731845, -0.1515453782207756, -0.02778865494342013, 0.21258609504862266]
|
1,803.04329
|
Semantic Parsing Natural Language into SPARQL: Improving Target Language
Representation with Neural Attention
|
Semantic parsing is the process of mapping a natural language sentence into a
formal representation of its meaning. In this work we use the neural network
approach to transform natural language sentence into a query to an ontology
database in the SPARQL language. This method does not rely on handcraft-rules,
high-quality lexicons, manually-built templates or other handmade complex
structures. Our approach is based on vector space model and neural networks.
The proposed model is based in two learning steps. The first step generates a
vector representation for the sentence in natural language and SPARQL query.
The second step uses this vector representation as input to a neural network
(LSTM with attention mechanism) to generate a model able to encode natural
language and decode SPARQL.
|
cs.CL
|
semantic parsing is the process of mapping a natural language sentence into a formal representation of its meaning in this work we use the neural network approach to transform natural language sentence into a query to an ontology database in the sparql language this method does not rely on handcraftrules highquality lexicons manuallybuilt templates or other handmade complex structures our approach is based on vector space model and neural networks the proposed model is based in two learning steps the first step generates a vector representation for the sentence in natural language and sparql query the second step uses this vector representation as input to a neural network lstm with attention mechanism to generate a model able to encode natural language and decode sparql
|
[['semantic', 'parsing', 'is', 'the', 'process', 'of', 'mapping', 'a', 'natural', 'language', 'sentence', 'into', 'a', 'formal', 'representation', 'of', 'its', 'meaning', 'in', 'this', 'work', 'we', 'use', 'the', 'neural', 'network', 'approach', 'to', 'transform', 'natural', 'language', 'sentence', 'into', 'a', 'query', 'to', 'an', 'ontology', 'database', 'in', 'the', 'sparql', 'language', 'this', 'method', 'does', 'not', 'rely', 'on', 'handcraftrules', 'highquality', 'lexicons', 'manuallybuilt', 'templates', 'or', 'other', 'handmade', 'complex', 'structures', 'our', 'approach', 'is', 'based', 'on', 'vector', 'space', 'model', 'and', 'neural', 'networks', 'the', 'proposed', 'model', 'is', 'based', 'in', 'two', 'learning', 'steps', 'the', 'first', 'step', 'generates', 'a', 'vector', 'representation', 'for', 'the', 'sentence', 'in', 'natural', 'language', 'and', 'sparql', 'query', 'the', 'second', 'step', 'uses', 'this', 'vector', 'representation', 'as', 'input', 'to', 'a', 'neural', 'network', 'lstm', 'with', 'attention', 'mechanism', 'to', 'generate', 'a', 'model', 'able', 'to', 'encode', 'natural', 'language', 'and', 'decode', 'sparql']]
|
[-0.01704978422246507, -0.040962604480317494, -0.08640663363001325, 0.09929441497525494, -0.23613087443604333, -0.1556087685481752, 0.07142293370008225, 0.471242029029021, -0.3459240512762097, -0.27893534487449245, -0.03020288092923946, -0.25832311741885594, -0.19453993417250115, 0.16505273950255675, -0.1081676697911939, 0.08713675919322862, 0.10740194761205739, 0.13758346407872732, -0.016108161937750755, -0.2444500265887282, 0.32467344640677825, -0.005116572221893756, 0.3344876007425034, -0.016508826680603574, 0.1617150553845663, -0.032754083320529, -0.031852522544318536, -0.1069474349031702, -0.016588390068166325, 0.22788724004000913, 0.3295549956516775, 0.28388893686723515, 0.30320322525031007, -0.44727178447742444, -0.21443026983866192, 0.061202289574764306, 0.1294761877487887, 0.13460553003108647, 0.023814113186595993, -0.35168742498413463, 0.11346262639777766, -0.16007695634101257, 0.11805720771586553, -0.14300469118246778, 0.025986943367227424, -0.08267652163650367, -0.2911850728169007, -0.06694565610349422, 0.2136847390716926, 0.06582635092562385, -0.049560812417394864, -0.0331223434883124, 0.007095245080503834, 0.13424216495010025, -0.012902656578903514, 0.16898923685590997, 0.11555705590891178, -0.1491616094045028, -0.1973909895994021, 0.41524031465170813, -0.07656223416236825, -0.28354652369486505, 0.1570568484116773, -0.00588869204988978, -0.20090153702290453, 0.0412780769154063, 0.23432795874408033, 0.1048313687044028, -0.18086613877867272, 0.07317384825036556, -0.06266959460421664, 0.25045823005837253, 0.06911067498254315, -0.010786192797002245, 0.21529770442513657, 0.29937308958014014, -0.02659139269962907, 0.1422568434838885, -0.0537954874061903, -0.07149715281900812, -0.23304421651047333, -0.16714744672148688, -0.18900263487346103, -0.0756656834778145, -0.10285831735143533, -0.21499236117376655, 0.4364577273906926, 0.2274011841623998, 0.218655906121445, 0.16475694208237968, 0.3447540948667457, 0.051490551467649026, 0.15973840901803713, 0.06534322103882423, 0.0357196885924481, 0.014564705531677751, 0.17325408668562647, -0.09304579900654956, 0.09724686678582956, 0.15307287700077304]
|
1,803.0433
|
A Uniformly Selected Sample of Low-Mass Black Holes in Seyfert 1
Galaxies. II. The SDSS DR7 Sample
|
A new sample of 204 low-mass black holes (LMBHs) in active galactic nuclei
(AGNs) is presented with black hole masses in the range of (1-20) * 10^5 M_sun.
The AGNs are selected from a systematic search among galaxies in the Seventh
Data Release (DR 7) of the Sloan Digital Sky Survey (SDSS), and careful
analyses of their optical spectra and precise measurement of spectral
parameters. Combining them with our previous sample selected from the SDSS DR 4
makes it the largest LMBH sample so far, totaling over 500 objects. Some of the
statistical properties of the combined LMBH AGN sample are briefly discussed,
in the context of exploring the low-mass end of the AGN population. Their X-ray
luminosities follow the extension of the previously known correlation with the
[O III] luminosity. The effective optical-to-X-ray spectral indices \alpha_OX,
albeit with a large scatter, are broadly consistent with the extension of the
relation with the near-UV luminosity L_2500\AA. Interestingly, a correlation of
\alpha_OX with black hole mass is also found in the sense that \alpha_OX is
statistically flatter (stronger X-ray relative to optical) for lower black hole
mass. Only 26 objects, mostly radio loud, were detected in radio at 20 cm in
the FIRST survey, giving a radio loud fraction of 4%. The host galaxies of
LMBHs have stellar masses in the range of 10^8.8-10^12.4 M_sun and optical
colors typical of Sbc spirals. They are dominated by young stellar populations
that seem to have undergone a continuous star formation history.
|
astro-ph.GA
|
a new sample of 204 lowmass black holes lmbhs in active galactic nuclei agns is presented with black hole masses in the range of 120 105 m_sun the agns are selected from a systematic search among galaxies in the seventh data release dr 7 of the sloan digital sky survey sdss and careful analyses of their optical spectra and precise measurement of spectral parameters combining them with our previous sample selected from the sdss dr 4 makes it the largest lmbh sample so far totaling over 500 objects some of the statistical properties of the combined lmbh agn sample are briefly discussed in the context of exploring the lowmass end of the agn population their xray luminosities follow the extension of the previously known correlation with the o iii luminosity the effective opticaltoxray spectral indices alpha_ox albeit with a large scatter are broadly consistent with the extension of the relation with the nearuv luminosity l_2500aa interestingly a correlation of alpha_ox with black hole mass is also found in the sense that alpha_ox is statistically flatter stronger xray relative to optical for lower black hole mass only 26 objects mostly radio loud were detected in radio at 20 cm in the first survey giving a radio loud fraction of 4 the host galaxies of lmbhs have stellar masses in the range of 108810124 m_sun and optical colors typical of sbc spirals they are dominated by young stellar populations that seem to have undergone a continuous star formation history
|
[['a', 'new', 'sample', 'of', '204', 'lowmass', 'black', 'holes', 'lmbhs', 'in', 'active', 'galactic', 'nuclei', 'agns', 'is', 'presented', 'with', 'black', 'hole', 'masses', 'in', 'the', 'range', 'of', '120', '105', 'm_sun', 'the', 'agns', 'are', 'selected', 'from', 'a', 'systematic', 'search', 'among', 'galaxies', 'in', 'the', 'seventh', 'data', 'release', 'dr', '7', 'of', 'the', 'sloan', 'digital', 'sky', 'survey', 'sdss', 'and', 'careful', 'analyses', 'of', 'their', 'optical', 'spectra', 'and', 'precise', 'measurement', 'of', 'spectral', 'parameters', 'combining', 'them', 'with', 'our', 'previous', 'sample', 'selected', 'from', 'the', 'sdss', 'dr', '4', 'makes', 'it', 'the', 'largest', 'lmbh', 'sample', 'so', 'far', 'totaling', 'over', '500', 'objects', 'some', 'of', 'the', 'statistical', 'properties', 'of', 'the', 'combined', 'lmbh', 'agn', 'sample', 'are', 'briefly', 'discussed', 'in', 'the', 'context', 'of', 'exploring', 'the', 'lowmass', 'end', 'of', 'the', 'agn', 'population', 'their', 'xray', 'luminosities', 'follow', 'the', 'extension', 'of', 'the', 'previously', 'known', 'correlation', 'with', 'the', 'o', 'iii', 'luminosity', 'the', 'effective', 'opticaltoxray', 'spectral', 'indices', 'alpha_ox', 'albeit', 'with', 'a', 'large', 'scatter', 'are', 'broadly', 'consistent', 'with', 'the', 'extension', 'of', 'the', 'relation', 'with', 'the', 'nearuv', 'luminosity', 'l_2500aa', 'interestingly', 'a', 'correlation', 'of', 'alpha_ox', 'with', 'black', 'hole', 'mass', 'is', 'also', 'found', 'in', 'the', 'sense', 'that', 'alpha_ox', 'is', 'statistically', 'flatter', 'stronger', 'xray', 'relative', 'to', 'optical', 'for', 'lower', 'black', 'hole', 'mass', 'only', '26', 'objects', 'mostly', 'radio', 'loud', 'were', 'detected', 'in', 'radio', 'at', '20', 'cm', 'in', 'the', 'first', 'survey', 'giving', 'a', 'radio', 'loud', 'fraction', 'of', '4', 'the', 'host', 'galaxies', 'of', 'lmbhs', 'have', 'stellar', 'masses', 'in', 'the', 'range', 'of', '108810124', 'm_sun', 'and', 'optical', 'colors', 'typical', 'of', 'sbc', 'spirals', 'they', 'are', 'dominated', 'by', 'young', 'stellar', 'populations', 'that', 'seem', 'to', 'have', 'undergone', 'a', 'continuous', 'star', 'formation', 'history']]
|
[-0.040147079116204964, 0.10105719228557222, -0.028232103692854588, 0.15275933741856582, -0.10426945368376758, -0.06306194568717566, 0.07912100961285014, 0.45545072858202507, -0.0956854586435397, -0.40464440250916106, 0.06711198756069378, -0.36155778359954105, 0.009715553328657669, 0.23346422272285106, -0.039021909043687505, -0.027526675372616837, 0.0022945461671072913, -0.1055808005114453, -0.06044873489787671, -0.2705964776725968, 0.305519615841017, 0.07113152895996123, 0.19054379556965687, -0.10706120745097268, 0.036180929442639634, -0.06950428504767321, -0.14615469175502968, -0.00302323517177053, -0.13065348373354302, 0.05474406760958839, 0.26852418217193086, 0.13548677491943867, 0.21700947133812637, -0.27556202353084075, -0.15947111369462305, 0.09171708448281844, 0.19331218464168645, 0.03566174810226713, -0.10466373912387246, -0.23934740359852422, 0.08673339178379919, -0.22699005364636501, -0.14091618735868777, 0.09723578743961218, 0.09067226111931394, 0.06853888973330932, -0.17514292839276932, 0.16539004514297215, 0.011679234287632229, 0.0971046245745789, -0.1317787439484126, -0.1207542607553025, -0.08873691561407723, 0.06568619742974083, 0.03977313688502133, 0.06067463480848123, 0.18515020810092772, -0.12184576521322317, -0.04501926276738141, 0.37039059535233126, -0.003897649715210145, 0.041208511082208195, 0.21823710147040234, -0.23580056381763512, -0.17045590000737196, 0.15921153907308594, 0.15820088762890439, 0.13031946183897214, -0.18711320725192326, 0.018671865761714805, -0.023357459502410593, 0.2545136966978304, 0.00536332533915075, 0.11506981189706637, 0.32427269264406433, 0.10296277313771429, 0.013773157684947848, 0.09012636387212535, -0.2042840279686348, 0.004173976646473484, -0.22215147077055702, -0.04653643711694203, -0.12955944487656934, 0.11416544382850721, -0.16127800669781217, -0.10551452866844307, 0.3465729445852803, 0.07728854961658507, 0.23005927442676866, 0.10154567604219827, 0.26686707905021073, 0.06947498759921424, 0.12917652230273113, 0.09653881527251598, 0.3831418114353244, 0.16655587686488552, 0.11091203321084472, -0.21967038638982536, 0.005743893404410093, -0.002427301061420829]
|
1,803.04331
|
Two infinite quantities and their surprising relationship
|
As early as the 17th century, Galileo Galilei wondered how to compare the
sizes of infinite sets. Fast forward almost four hundred years, and in the
summer of 2017, at the 6th European Set Theory Conference, a young model
theorist, Maryanthe Malliaris, and the well-known polymath, Saharon Shelah,
received the Hausdorff Medal for the most influential work in set theory
published in the last five years. Malliaris and Shelah made significant
breakthroughs both regarding a model theoretic classification problem (that is,
sorting certain objects into types), and proved that two well-studied infinite
quantities, $\mathfrak{p}$ and $\mathfrak{t}$, are in fact the same. This
latter result is the focus of our expository paper.
|
math.HO math.LO
|
as early as the 17th century galileo galilei wondered how to compare the sizes of infinite sets fast forward almost four hundred years and in the summer of 2017 at the 6th european set theory conference a young model theorist maryanthe malliaris and the wellknown polymath saharon shelah received the hausdorff medal for the most influential work in set theory published in the last five years malliaris and shelah made significant breakthroughs both regarding a model theoretic classification problem that is sorting certain objects into types and proved that two wellstudied infinite quantities mathfrakp and mathfrakt are in fact the same this latter result is the focus of our expository paper
|
[['as', 'early', 'as', 'the', '17th', 'century', 'galileo', 'galilei', 'wondered', 'how', 'to', 'compare', 'the', 'sizes', 'of', 'infinite', 'sets', 'fast', 'forward', 'almost', 'four', 'hundred', 'years', 'and', 'in', 'the', 'summer', 'of', '2017', 'at', 'the', '6th', 'european', 'set', 'theory', 'conference', 'a', 'young', 'model', 'theorist', 'maryanthe', 'malliaris', 'and', 'the', 'wellknown', 'polymath', 'saharon', 'shelah', 'received', 'the', 'hausdorff', 'medal', 'for', 'the', 'most', 'influential', 'work', 'in', 'set', 'theory', 'published', 'in', 'the', 'last', 'five', 'years', 'malliaris', 'and', 'shelah', 'made', 'significant', 'breakthroughs', 'both', 'regarding', 'a', 'model', 'theoretic', 'classification', 'problem', 'that', 'is', 'sorting', 'certain', 'objects', 'into', 'types', 'and', 'proved', 'that', 'two', 'wellstudied', 'infinite', 'quantities', 'mathfrakp', 'and', 'mathfrakt', 'are', 'in', 'fact', 'the', 'same', 'this', 'latter', 'result', 'is', 'the', 'focus', 'of', 'our', 'expository', 'paper']]
|
[-0.08890111853622577, 0.09979286888529632, -0.09528316860933873, 0.0883083770273846, -0.09835780711675232, -0.10327772598803593, 0.01509525246643038, 0.2886233223263513, -0.23816207612716508, -0.3149444172031839, 0.14575204778547315, -0.3140192847190933, -0.14855355746747756, 0.22313687631606377, -0.148651908532801, 0.011403092196930878, 0.08518118554705077, 0.05115758868527006, -0.010233071920546618, -0.38778570814227514, 0.2686079781333154, 0.045551532439210195, 0.2798639947802506, 0.03614230005239898, 0.09490450454071503, 0.005054970005188476, -0.09548345919783142, 0.005475666097746315, -0.1079095465815044, 0.14805308844873005, 0.2905177489939061, 0.15615379022942347, 0.32825003562664445, -0.3967373853337697, -0.15591789451851087, 0.08954918862860227, 0.08775770412334664, 0.050240359484980054, -0.01005559599196369, -0.28353706779466437, 0.05667684019268067, -0.20652157294944945, -0.13155181557363407, 0.024396003755232827, 0.12607139204205436, -0.049910215339200065, -0.13680198745675046, 0.004468418570997363, 0.09483005589043553, 0.12810440917118368, -0.041916778218001126, -0.17013616149567745, 0.025958152175669304, 0.1298040395009924, 0.08259648365730589, 0.051964148921384054, 0.023251491945914245, -0.08353340498552743, -0.1589068263134157, 0.37874775700779123, -0.028683482745493, -0.05312946103513241, 0.20546985583020036, -0.17566720282828266, -0.2236431573390622, 0.07803864384451034, 0.14495724128051238, 0.11767552456268195, -0.16484354034235532, 0.13442286540574225, -0.14458267655943266, 0.10157863371952607, 0.16555738002485174, -0.008775958528911526, 0.16128741754218937, 0.13653583433479072, 0.015747314551845193, 0.09480742926389212, -0.01680067870342596, -0.09632532049647786, -0.26982418919638307, -0.11151944351890548, -0.11197076883294027, 0.05085093260488727, -0.03551815424725646, -0.13495488134636122, 0.36583956713703547, 0.15635841143402188, 0.14193120566620068, 0.030456905598244207, 0.2528322421268306, 0.02371568701319947, 0.010307712184095924, 0.0753985784238797, 0.22285292949527502, 0.15545182637023655, 0.13618294659324667, -0.09029723783446984, 0.030569776486266742, 0.16701315542767672]
|
1,803.04332
|
A state of the art of urban reconstruction: street, street network,
vegetation, urban feature
|
World population is raising, especially the part of people living in cities.
With increased population and complex roles regarding their inhabitants and
their surroundings, cities concentrate difficulties for design, planning and
analysis. These tasks require a way to reconstruct/model a city. Traditionally,
much attention has been given to buildings reconstruction, yet an essential
part of city were neglected: streets. Streets reconstruction has been seldom
researched. Streets are also complex compositions of urban features, and have a
unique role for transportation (as they comprise roads). We aim at completing
the recent state of the art for building reconstruction (Musialski2012) by
considering all other aspect of urban reconstruction. We introduce the need for
city models. Because reconstruction always necessitates data, we first analyse
which data are available. We then expose a state of the art of street
reconstruction, street network reconstruction, urban features
reconstruction/modelling, vegetation , and urban objects
reconstruction/modelling.
Although reconstruction strategies vary widely, we can order them by the role
the model plays, from data driven approach, to model-based approach, to inverse
procedural modelling and model catalogue matching. The main challenges seems to
come from the complex nature of urban environment and from the limitations of
the available data. Urban features have strong relationships, between them, and
to their surrounding, as well as in hierarchical relations. Procedural
modelling has the power to express these relations, and could be applied to the
reconstruction of urban features via the Inverse Procedural Modelling paradigm.
|
cs.OH cs.CV
|
world population is raising especially the part of people living in cities with increased population and complex roles regarding their inhabitants and their surroundings cities concentrate difficulties for design planning and analysis these tasks require a way to reconstructmodel a city traditionally much attention has been given to buildings reconstruction yet an essential part of city were neglected streets streets reconstruction has been seldom researched streets are also complex compositions of urban features and have a unique role for transportation as they comprise roads we aim at completing the recent state of the art for building reconstruction musialski2012 by considering all other aspect of urban reconstruction we introduce the need for city models because reconstruction always necessitates data we first analyse which data are available we then expose a state of the art of street reconstruction street network reconstruction urban features reconstructionmodelling vegetation and urban objects reconstructionmodelling although reconstruction strategies vary widely we can order them by the role the model plays from data driven approach to modelbased approach to inverse procedural modelling and model catalogue matching the main challenges seems to come from the complex nature of urban environment and from the limitations of the available data urban features have strong relationships between them and to their surrounding as well as in hierarchical relations procedural modelling has the power to express these relations and could be applied to the reconstruction of urban features via the inverse procedural modelling paradigm
|
[['world', 'population', 'is', 'raising', 'especially', 'the', 'part', 'of', 'people', 'living', 'in', 'cities', 'with', 'increased', 'population', 'and', 'complex', 'roles', 'regarding', 'their', 'inhabitants', 'and', 'their', 'surroundings', 'cities', 'concentrate', 'difficulties', 'for', 'design', 'planning', 'and', 'analysis', 'these', 'tasks', 'require', 'a', 'way', 'to', 'reconstructmodel', 'a', 'city', 'traditionally', 'much', 'attention', 'has', 'been', 'given', 'to', 'buildings', 'reconstruction', 'yet', 'an', 'essential', 'part', 'of', 'city', 'were', 'neglected', 'streets', 'streets', 'reconstruction', 'has', 'been', 'seldom', 'researched', 'streets', 'are', 'also', 'complex', 'compositions', 'of', 'urban', 'features', 'and', 'have', 'a', 'unique', 'role', 'for', 'transportation', 'as', 'they', 'comprise', 'roads', 'we', 'aim', 'at', 'completing', 'the', 'recent', 'state', 'of', 'the', 'art', 'for', 'building', 'reconstruction', 'musialski2012', 'by', 'considering', 'all', 'other', 'aspect', 'of', 'urban', 'reconstruction', 'we', 'introduce', 'the', 'need', 'for', 'city', 'models', 'because', 'reconstruction', 'always', 'necessitates', 'data', 'we', 'first', 'analyse', 'which', 'data', 'are', 'available', 'we', 'then', 'expose', 'a', 'state', 'of', 'the', 'art', 'of', 'street', 'reconstruction', 'street', 'network', 'reconstruction', 'urban', 'features', 'reconstructionmodelling', 'vegetation', 'and', 'urban', 'objects', 'reconstructionmodelling', 'although', 'reconstruction', 'strategies', 'vary', 'widely', 'we', 'can', 'order', 'them', 'by', 'the', 'role', 'the', 'model', 'plays', 'from', 'data', 'driven', 'approach', 'to', 'modelbased', 'approach', 'to', 'inverse', 'procedural', 'modelling', 'and', 'model', 'catalogue', 'matching', 'the', 'main', 'challenges', 'seems', 'to', 'come', 'from', 'the', 'complex', 'nature', 'of', 'urban', 'environment', 'and', 'from', 'the', 'limitations', 'of', 'the', 'available', 'data', 'urban', 'features', 'have', 'strong', 'relationships', 'between', 'them', 'and', 'to', 'their', 'surrounding', 'as', 'well', 'as', 'in', 'hierarchical', 'relations', 'procedural', 'modelling', 'has', 'the', 'power', 'to', 'express', 'these', 'relations', 'and', 'could', 'be', 'applied', 'to', 'the', 'reconstruction', 'of', 'urban', 'features', 'via', 'the', 'inverse', 'procedural', 'modelling', 'paradigm']]
|
[-0.04488497801170432, 0.05787883895915248, -0.0945219359818404, 0.1036760902714963, -0.12001736797994177, -0.0867876825011651, 0.023237861144372214, 0.40083687258410755, -0.2512193682911348, -0.3861226361063388, 0.14034297302344584, -0.29695207881741226, -0.16782243384573198, 0.19241305758142685, -0.13443201517496825, 0.0665526628135151, 0.08456636748969223, -0.004559074325281811, 0.003185359043882118, -0.21282684176734065, 0.31752899665606477, 0.051718957457786145, 0.34312073301555496, 0.042590159950462184, 0.08382562027509266, -0.035380362054854494, -0.09733351162127693, 0.011117761265545673, -0.08656208859278103, 0.1786900640532406, 0.35721177420987643, 0.19098148151632335, 0.2727749831579878, -0.47193124449133117, -0.26139244103411574, 0.09705888278293029, 0.16031563052191336, 0.08987501000648096, -0.016466981529601517, -0.3120650360321279, 0.0637961413131206, -0.1735004676501977, -0.11277283400692287, -0.07729911363300851, 0.03407166336102695, 0.0002584019636388047, -0.1909411839225282, 0.04622730076973035, 0.043446192528235617, 0.11501039424516513, -0.03592473035826253, -0.12156925160611459, -0.04714224918674425, 0.2714495817041498, 0.03677385859931345, -0.01654276416352871, 0.1637698607321955, -0.19543377826507283, -0.10360395517476471, 0.4152632903039329, 0.03311348831728969, -0.18140814396536956, 0.2191780117627478, -0.0906166220108497, -0.14036971002706658, 0.05935300242745759, 0.23506345882394225, 0.04882171823247533, -0.17086327112264046, 0.029397954891773208, -0.020435881537535245, 0.11305834999568444, 0.05119091437012747, 0.0008288213896359933, 0.2260945437168229, 0.2392068344841206, 0.07654038594317449, 0.08389250925861465, -0.11959937724538376, -0.12224859405472732, -0.1907950772083033, -0.11889002447497983, -0.13341140511723915, -0.005597968176855721, -0.06855989963360579, -0.13931693824923644, 0.3873177781223588, 0.19447652030523108, 0.173202373277321, 0.019519552495231914, 0.3155787749673729, 0.04502982727594287, 0.102494150284733, 0.06963676983151205, 0.1633354800327097, 0.041798258832864504, 0.18128537736296402, -0.13710396620148982, 0.11839554561385925, 0.032262523198091836]
|
1,803.04333
|
Sequential superconductor-Bose insulator-Fermi insulator phase
transitions in two-dimensional a-WSi
|
A zero-temperature magnetic-field-driven superconductor to insulator
transition (SIT) in quasi-two-dimensional superconductors is expected to occur
when the applied magnetic-field crosses a certain critical value. A fundamental
question is whether this transition is due to the localization of Cooper pairs
or due to the destruction of them. Here we address this question by studying
the SIT in amorphous WSi. Transport measurements reveal the localization of
Cooper pairs at a quantum critical field B_c^1 (Bose-insulator), with a product
of the correlation length and dynamical exponents zv~4/3 near the quantum
critical point (QCP). Beyond B_c^1, superconducting fluctuations still persist
at finite temperatures. Above a second critical field B_c^2>B_c^1, the Cooper
pairs are destroyed and the film becomes a Fermi-insulator. The different
phases all merge at a tricritical point at finite temperatures with zv=2/3. Our
results suggest a sequential superconductor to Bose insulator to Fermi
insulator phase transition, which differs from the conventional scenario
involving a single quantum critical point.
|
cond-mat.supr-con
|
a zerotemperature magneticfielddriven superconductor to insulator transition sit in quasitwodimensional superconductors is expected to occur when the applied magneticfield crosses a certain critical value a fundamental question is whether this transition is due to the localization of cooper pairs or due to the destruction of them here we address this question by studying the sit in amorphous wsi transport measurements reveal the localization of cooper pairs at a quantum critical field b_c1 boseinsulator with a product of the correlation length and dynamical exponents zv43 near the quantum critical point qcp beyond b_c1 superconducting fluctuations still persist at finite temperatures above a second critical field b_c2b_c1 the cooper pairs are destroyed and the film becomes a fermiinsulator the different phases all merge at a tricritical point at finite temperatures with zv23 our results suggest a sequential superconductor to bose insulator to fermi insulator phase transition which differs from the conventional scenario involving a single quantum critical point
|
[['a', 'zerotemperature', 'magneticfielddriven', 'superconductor', 'to', 'insulator', 'transition', 'sit', 'in', 'quasitwodimensional', 'superconductors', 'is', 'expected', 'to', 'occur', 'when', 'the', 'applied', 'magneticfield', 'crosses', 'a', 'certain', 'critical', 'value', 'a', 'fundamental', 'question', 'is', 'whether', 'this', 'transition', 'is', 'due', 'to', 'the', 'localization', 'of', 'cooper', 'pairs', 'or', 'due', 'to', 'the', 'destruction', 'of', 'them', 'here', 'we', 'address', 'this', 'question', 'by', 'studying', 'the', 'sit', 'in', 'amorphous', 'wsi', 'transport', 'measurements', 'reveal', 'the', 'localization', 'of', 'cooper', 'pairs', 'at', 'a', 'quantum', 'critical', 'field', 'b_c1', 'boseinsulator', 'with', 'a', 'product', 'of', 'the', 'correlation', 'length', 'and', 'dynamical', 'exponents', 'zv43', 'near', 'the', 'quantum', 'critical', 'point', 'qcp', 'beyond', 'b_c1', 'superconducting', 'fluctuations', 'still', 'persist', 'at', 'finite', 'temperatures', 'above', 'a', 'second', 'critical', 'field', 'b_c2b_c1', 'the', 'cooper', 'pairs', 'are', 'destroyed', 'and', 'the', 'film', 'becomes', 'a', 'fermiinsulator', 'the', 'different', 'phases', 'all', 'merge', 'at', 'a', 'tricritical', 'point', 'at', 'finite', 'temperatures', 'with', 'zv23', 'our', 'results', 'suggest', 'a', 'sequential', 'superconductor', 'to', 'bose', 'insulator', 'to', 'fermi', 'insulator', 'phase', 'transition', 'which', 'differs', 'from', 'the', 'conventional', 'scenario', 'involving', 'a', 'single', 'quantum', 'critical', 'point']]
|
[-0.20954624692360493, 0.26467220572483363, -0.07187521956330598, 0.057632384856465886, 0.00022565872278927968, -0.20951904677585484, 0.1466717526473919, 0.2896819834432423, -0.2505713807610141, -0.23024098874865384, 0.007893766595716804, -0.3568435790917731, -0.09115482904541226, 0.16574268822175828, 0.041962958092104326, 0.03993821759023611, -0.06444450230676903, 0.027977581821314202, -0.15919443681475318, -0.22245316931279954, 0.38672828141427196, -0.017044283849779296, 0.3586939350896151, 0.11191654513707223, 0.010253047641514745, -0.037795044491005854, 0.16809487640271764, 0.017231393318672645, -0.16136536599192397, -0.02875589387952381, 0.2981516590884683, -0.10701715304140026, 0.23327190015428015, -0.3775043429325748, -0.22057095817321085, 0.07718258189339659, 0.1491973981514129, 0.1634410557280054, -0.04264384857533093, -0.3077693743236511, 0.07962912385967184, -0.10249497706459107, -0.12098076405614269, -0.028751662142870837, -0.026930376127152548, -0.059585514623326376, -0.24050811117064727, 0.08352428577865, 0.07394069807186865, 0.10189238569501861, -0.02144515732401945, -0.028965696633873595, -0.009672962633325465, 0.07853495876481356, 0.010295705593403873, 0.12028976257224351, 0.1782116565347606, -0.1677547407541609, -0.10012142582131944, 0.36076511557688873, -0.010294431912256343, -0.03519982063452041, 0.21727324033923917, -0.19854541748173501, -0.061081991179395986, 0.20040327208178327, 0.08112241896732852, 0.0736048483314449, -0.09375211154158915, 0.04201357243567187, -0.012959940002811764, 0.15373105095951534, 0.02254527018386994, 0.04053413951214378, 0.3457004089118136, 0.19891818210525772, 0.04662076828520227, 0.16030069025671295, -0.11720543238353631, -0.1239455127687693, -0.2633722900653517, -0.17423769312491333, -0.23517127364753615, 0.07369838719293229, -0.04196809706492473, -0.2240013409998046, 0.3637308432899465, 0.20943389482262686, 0.2404351937892964, -0.036601380262345024, 0.22629929116513853, 0.14595818030802127, 0.06552799559731826, 0.0586719279954617, 0.2348932825917045, 0.13947631114560322, 0.11936124628031972, -0.2640443823844987, 0.032381164733419156, 0.07985239353353568]
|
1,803.04334
|
Calculations of point defects in the layered MX2 (M=Mo, W; X=S, Te):
Substitution by the groups III, V and VII elements
|
Dopability in semiconductors plays a crucial role in device performance.
Using the first-principles density-functional theory calculations, we
investigate systematically the doping properties of layered MX2 (M= Mo, W; X=S,
Te) by replacing M or X with the groups III, V and VII elements. It is found
that the defect BM is hard to form in MX2 due to the large formation energy
originating from the crystal distortion, while AlM is easy to realize compared
to the former. In MoS2, WS2 and MoTe2, Al is the most desirable p-type dopant
under anion-rich conditions among the group III components, since AlM has
relatively low transition and formation energies. With respect to the doping of
the group V elements, it is found that the substitutions on the cation sites
have deeper defect levels than those on the anion sites due to the strong
electronegativity. AsTe and SbTe in MoTe2 and WTe2 are trend to form shallow
acceptors under cation-rich conditions, indicating high hole-concentrations for
p-type doping, whereas SbS in MoS2 and PTe in WTe2 are shown to be good p-type
candidates under cation-rich conditions. In despite of that the substitutions
of group VII on X site have low formation energies, the transition energies are
too high to achieve n-type MoS2 and WS2. Nevertheless, for MoTe2, the
substitutions with the group VII elements on the anion sites are suitable for
n-type doping on account of the shallow donor levels and low formation energies
under Mo-rich condition. As to WTe2, F is the only potential donor due to the
shallow transition energy of FTe. Our findings of filtering out unfavorable and
identifying favorable dopants in MX2 are very valuable for experimental
implementations.
|
cond-mat.mtrl-sci
|
dopability in semiconductors plays a crucial role in device performance using the firstprinciples densityfunctional theory calculations we investigate systematically the doping properties of layered mx2 m mo w xs te by replacing m or x with the groups iii v and vii elements it is found that the defect bm is hard to form in mx2 due to the large formation energy originating from the crystal distortion while alm is easy to realize compared to the former in mos2 ws2 and mote2 al is the most desirable ptype dopant under anionrich conditions among the group iii components since alm has relatively low transition and formation energies with respect to the doping of the group v elements it is found that the substitutions on the cation sites have deeper defect levels than those on the anion sites due to the strong electronegativity aste and sbte in mote2 and wte2 are trend to form shallow acceptors under cationrich conditions indicating high holeconcentrations for ptype doping whereas sbs in mos2 and pte in wte2 are shown to be good ptype candidates under cationrich conditions in despite of that the substitutions of group vii on x site have low formation energies the transition energies are too high to achieve ntype mos2 and ws2 nevertheless for mote2 the substitutions with the group vii elements on the anion sites are suitable for ntype doping on account of the shallow donor levels and low formation energies under morich condition as to wte2 f is the only potential donor due to the shallow transition energy of fte our findings of filtering out unfavorable and identifying favorable dopants in mx2 are very valuable for experimental implementations
|
[['dopability', 'in', 'semiconductors', 'plays', 'a', 'crucial', 'role', 'in', 'device', 'performance', 'using', 'the', 'firstprinciples', 'densityfunctional', 'theory', 'calculations', 'we', 'investigate', 'systematically', 'the', 'doping', 'properties', 'of', 'layered', 'mx2', 'm', 'mo', 'w', 'xs', 'te', 'by', 'replacing', 'm', 'or', 'x', 'with', 'the', 'groups', 'iii', 'v', 'and', 'vii', 'elements', 'it', 'is', 'found', 'that', 'the', 'defect', 'bm', 'is', 'hard', 'to', 'form', 'in', 'mx2', 'due', 'to', 'the', 'large', 'formation', 'energy', 'originating', 'from', 'the', 'crystal', 'distortion', 'while', 'alm', 'is', 'easy', 'to', 'realize', 'compared', 'to', 'the', 'former', 'in', 'mos2', 'ws2', 'and', 'mote2', 'al', 'is', 'the', 'most', 'desirable', 'ptype', 'dopant', 'under', 'anionrich', 'conditions', 'among', 'the', 'group', 'iii', 'components', 'since', 'alm', 'has', 'relatively', 'low', 'transition', 'and', 'formation', 'energies', 'with', 'respect', 'to', 'the', 'doping', 'of', 'the', 'group', 'v', 'elements', 'it', 'is', 'found', 'that', 'the', 'substitutions', 'on', 'the', 'cation', 'sites', 'have', 'deeper', 'defect', 'levels', 'than', 'those', 'on', 'the', 'anion', 'sites', 'due', 'to', 'the', 'strong', 'electronegativity', 'aste', 'and', 'sbte', 'in', 'mote2', 'and', 'wte2', 'are', 'trend', 'to', 'form', 'shallow', 'acceptors', 'under', 'cationrich', 'conditions', 'indicating', 'high', 'holeconcentrations', 'for', 'ptype', 'doping', 'whereas', 'sbs', 'in', 'mos2', 'and', 'pte', 'in', 'wte2', 'are', 'shown', 'to', 'be', 'good', 'ptype', 'candidates', 'under', 'cationrich', 'conditions', 'in', 'despite', 'of', 'that', 'the', 'substitutions', 'of', 'group', 'vii', 'on', 'x', 'site', 'have', 'low', 'formation', 'energies', 'the', 'transition', 'energies', 'are', 'too', 'high', 'to', 'achieve', 'ntype', 'mos2', 'and', 'ws2', 'nevertheless', 'for', 'mote2', 'the', 'substitutions', 'with', 'the', 'group', 'vii', 'elements', 'on', 'the', 'anion', 'sites', 'are', 'suitable', 'for', 'ntype', 'doping', 'on', 'account', 'of', 'the', 'shallow', 'donor', 'levels', 'and', 'low', 'formation', 'energies', 'under', 'morich', 'condition', 'as', 'to', 'wte2', 'f', 'is', 'the', 'only', 'potential', 'donor', 'due', 'to', 'the', 'shallow', 'transition', 'energy', 'of', 'fte', 'our', 'findings', 'of', 'filtering', 'out', 'unfavorable', 'and', 'identifying', 'favorable', 'dopants', 'in', 'mx2', 'are', 'very', 'valuable', 'for', 'experimental', 'implementations']]
|
[-0.08781558112475008, 0.10732350845814403, 0.022965230409694958, 0.03300974173658276, 0.011238465488405668, -0.20494162343632782, 0.13368757691422994, 0.4585560324676607, -0.2276633599807889, -0.3108815719115626, -0.008952924664332838, -0.3366142547804944, -0.10599774394242134, 0.15201872952935033, -0.009175517062663379, -0.030970378028973258, 0.018659858239549517, -0.04874102088085709, -0.10934135795445148, -0.23897687285326177, 0.26368803021763143, 0.11293576130589103, 0.3222673216963826, 0.08526599835978318, 0.0029830303345636947, -0.054064843139991874, 0.12097355352891405, 0.0033025993578081583, -0.11586216009978989, 0.0814077759284911, 0.28940120528462293, -0.07675592876787223, 0.23558662578728676, -0.43988552144354715, -0.1911764476987037, 0.002474330476974647, 0.09140928054779061, 0.10716496600708278, -0.125615629019559, -0.2398394848845464, 0.14505774860718987, -0.0978574296114346, -0.0675695821635759, -0.057208264963132034, 0.05840587595838418, 0.02437419866306884, -0.25394743110051543, 0.06179542644595197, 0.023141419491645655, 0.048172159947854946, -0.11646642648601348, -0.19315939485588293, -0.1392656646823565, 0.046888713079953334, 0.05346129264981642, 0.03439943007886899, 0.1784823632103996, -0.09666771561172485, -0.036934930086815664, 0.43678244072807965, -0.03597300235178011, -0.09189947451363711, 0.2307107982142441, -0.17684441608254436, -0.12110632792264767, 0.1807283723869626, 0.08080663245292823, 0.11104312298282383, -0.10929214147116689, 0.10756650898551626, 0.020450185718296102, 0.15054076979868114, 0.08073474277477086, 0.10926894443772434, 0.19743519817839247, 0.17713808908847833, 0.0680563544107966, 0.05601700595843463, -0.10120903959423032, 0.022041027274205396, -0.1710378007630199, -0.21855245098572762, -0.16559655002970927, 0.09269029745130195, -0.06828128224884349, -0.17285847547750863, 0.3544582740988338, 0.07841376654028784, 0.16916512003691908, -0.05581165257718985, 0.16951680697762428, 0.10143502225953216, 0.11632700376535501, 0.02063211639255394, 0.23774852835144983, 0.17740984351448988, 0.08463982515713458, -0.24688366539376944, 0.13988511852858873, 0.012693031756445277]
|
1,803.04335
|
A unified accretion-ejection paradigm for black hole X-ray binaries. II.
Observational signatures of jet-emitting disks
|
We elaborate on the paradigm proposed in Ferreira et al. (2006), where the
increase and decrease in the disk accretion rate is accompanied by a
modification of the disk magnetization $\mu \propto B_z^2/\dot{m}_{in}$, which
in turn determines the dominant torque allowing accretion. For $\mu>0.1$, the
accretion flow produces jets that vertically, carry away the disk angular
momentum (jet-emitting disk or JED). The goal of this paper is to investigate
the spectral signatures of the JED configurations. We have developed a
two-temperature plasma code that computes the disk local thermal equilibria,
taking into account the advection of energy in an iterative way. Our code
addresses optically thin-to-thick transitions, both radiation and gas supported
regimes and computes in a consistent way the emitted spectrum from a
steady-state disk. The optically thin emission is obtained using the BELM code,
which provides accurate spectra for bremsstrahlung and synchrotron emission
processes as well as for their local Comptonization. For a range in radius and
accretion rates, JEDs exhibit three thermal equilibria, one thermally unstable
and two stables. Due to the existence of two thermally stable solutions, a
hysteresis cycle is naturally obtained. However, standard outbursting X-ray
binary cycles cannot be reproduced. Another striking feature of JEDs is their
ability to reproduce luminous hard states. Showing that when the loss of
angular momentum and power in jets is consistently taken into account,
accretion disks have spectral signatures that are consistent with hard states,
even up to high luminosities. The reproduction of soft states being well
performed by standard accretion disks (SAD), this study argues for the
existence of hybrid disk configuration: JED and SAD. A study of such hybrid
configuration will be presented in a forthcoming paper III.
|
astro-ph.HE
|
we elaborate on the paradigm proposed in ferreira et al 2006 where the increase and decrease in the disk accretion rate is accompanied by a modification of the disk magnetization mu propto b_z2dotm_in which in turn determines the dominant torque allowing accretion for mu01 the accretion flow produces jets that vertically carry away the disk angular momentum jetemitting disk or jed the goal of this paper is to investigate the spectral signatures of the jed configurations we have developed a twotemperature plasma code that computes the disk local thermal equilibria taking into account the advection of energy in an iterative way our code addresses optically thintothick transitions both radiation and gas supported regimes and computes in a consistent way the emitted spectrum from a steadystate disk the optically thin emission is obtained using the belm code which provides accurate spectra for bremsstrahlung and synchrotron emission processes as well as for their local comptonization for a range in radius and accretion rates jeds exhibit three thermal equilibria one thermally unstable and two stables due to the existence of two thermally stable solutions a hysteresis cycle is naturally obtained however standard outbursting xray binary cycles cannot be reproduced another striking feature of jeds is their ability to reproduce luminous hard states showing that when the loss of angular momentum and power in jets is consistently taken into account accretion disks have spectral signatures that are consistent with hard states even up to high luminosities the reproduction of soft states being well performed by standard accretion disks sad this study argues for the existence of hybrid disk configuration jed and sad a study of such hybrid configuration will be presented in a forthcoming paper iii
|
[['we', 'elaborate', 'on', 'the', 'paradigm', 'proposed', 'in', 'ferreira', 'et', 'al', '2006', 'where', 'the', 'increase', 'and', 'decrease', 'in', 'the', 'disk', 'accretion', 'rate', 'is', 'accompanied', 'by', 'a', 'modification', 'of', 'the', 'disk', 'magnetization', 'mu', 'propto', 'b_z2dotm_in', 'which', 'in', 'turn', 'determines', 'the', 'dominant', 'torque', 'allowing', 'accretion', 'for', 'mu01', 'the', 'accretion', 'flow', 'produces', 'jets', 'that', 'vertically', 'carry', 'away', 'the', 'disk', 'angular', 'momentum', 'jetemitting', 'disk', 'or', 'jed', 'the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'investigate', 'the', 'spectral', 'signatures', 'of', 'the', 'jed', 'configurations', 'we', 'have', 'developed', 'a', 'twotemperature', 'plasma', 'code', 'that', 'computes', 'the', 'disk', 'local', 'thermal', 'equilibria', 'taking', 'into', 'account', 'the', 'advection', 'of', 'energy', 'in', 'an', 'iterative', 'way', 'our', 'code', 'addresses', 'optically', 'thintothick', 'transitions', 'both', 'radiation', 'and', 'gas', 'supported', 'regimes', 'and', 'computes', 'in', 'a', 'consistent', 'way', 'the', 'emitted', 'spectrum', 'from', 'a', 'steadystate', 'disk', 'the', 'optically', 'thin', 'emission', 'is', 'obtained', 'using', 'the', 'belm', 'code', 'which', 'provides', 'accurate', 'spectra', 'for', 'bremsstrahlung', 'and', 'synchrotron', 'emission', 'processes', 'as', 'well', 'as', 'for', 'their', 'local', 'comptonization', 'for', 'a', 'range', 'in', 'radius', 'and', 'accretion', 'rates', 'jeds', 'exhibit', 'three', 'thermal', 'equilibria', 'one', 'thermally', 'unstable', 'and', 'two', 'stables', 'due', 'to', 'the', 'existence', 'of', 'two', 'thermally', 'stable', 'solutions', 'a', 'hysteresis', 'cycle', 'is', 'naturally', 'obtained', 'however', 'standard', 'outbursting', 'xray', 'binary', 'cycles', 'can', 'not', 'be', 'reproduced', 'another', 'striking', 'feature', 'of', 'jeds', 'is', 'their', 'ability', 'to', 'reproduce', 'luminous', 'hard', 'states', 'showing', 'that', 'when', 'the', 'loss', 'of', 'angular', 'momentum', 'and', 'power', 'in', 'jets', 'is', 'consistently', 'taken', 'into', 'account', 'accretion', 'disks', 'have', 'spectral', 'signatures', 'that', 'are', 'consistent', 'with', 'hard', 'states', 'even', 'up', 'to', 'high', 'luminosities', 'the', 'reproduction', 'of', 'soft', 'states', 'being', 'well', 'performed', 'by', 'standard', 'accretion', 'disks', 'sad', 'this', 'study', 'argues', 'for', 'the', 'existence', 'of', 'hybrid', 'disk', 'configuration', 'jed', 'and', 'sad', 'a', 'study', 'of', 'such', 'hybrid', 'configuration', 'will', 'be', 'presented', 'in', 'a', 'forthcoming', 'paper', 'iii']]
|
[-0.0991070143361841, 0.12492798641702083, -0.0819457489591145, 0.09616237641049108, -0.04948381964760266, -0.1024668311229592, 0.0006395303586239386, 0.39389415855313986, -0.23379022347885, -0.30561127492435464, 0.07399725036453654, -0.2568147411707497, -0.025889702665697647, 0.2081274122327521, -0.0400662511335255, 0.023853740093937918, 0.05405463126249399, -0.10736279880538503, -0.003192424020163211, -0.15783154289486728, 0.3103414826017218, 0.10189668834872305, 0.17940242774784565, 0.016068962283326424, 0.0472825677979247, -0.05827384145542634, -0.035750575657988636, 0.021379564038653497, -0.1429931123240613, 0.03964908368031252, 0.22276785172144237, 0.08389185265193816, 0.19166483287647734, -0.41898807044078024, -0.23585350727608587, 0.0599947806938263, 0.168294209620279, 0.05549588951189403, -0.044616992352219643, -0.18349783127303848, 0.07458013077548231, -0.2145939127598422, -0.1368825630172159, -0.0461790738726744, 0.028000620167264945, -0.014279443878776582, -0.2757688988676689, 0.09879716720557986, 0.11485475259485035, 0.022736399825803232, -0.10797841895994767, -0.06339178167223877, -0.0900842587014468, 0.06864748604596076, 0.06299150663384923, 0.04052845960535984, 0.2013251710719565, -0.11424487790348029, -0.10531902823139817, 0.37177094181807335, -0.07739244660302944, -0.09349285623098448, 0.21027943055150414, -0.1733567748213389, -0.09892230969107978, 0.20110155803108343, 0.14772692990234101, 0.14230473983674094, -0.11244659051672991, 0.03351715065578655, -0.03684386566365834, 0.17509096068142851, 0.053591453013496805, 0.032370634459860596, 0.3161330020860553, 0.11639923999853287, 0.004407033353656185, 0.1626412843170102, -0.13067334527530944, -0.101734876327152, -0.24793118194782993, -0.11779717947276652, -0.14309785160852523, 0.07687132328163933, -0.0680847152171895, -0.1462367295992722, 0.3675299544198922, 0.08256562000133918, 0.24282960094564537, 0.01976030935894605, 0.33116908039685566, 0.12034174357582335, 0.0406996761551218, 0.17285200947020668, 0.31357601089436177, 0.1347955236115304, 0.11721941470248282, -0.26262266259371997, 0.07433786283676376, 0.033979191167240304]
|
1,803.04336
|
Lepton-pair production in association with a $b\bar{b}$ pair and the
determination of the $W$ boson mass
|
We perform a study of lepton-pair production in association with bottom
quarks at the LHC based on the predictions obtained at next-to-leading order in
QCD, both at fixed order and matched with a QCD parton shower. We consider a
comprehensive set of observables and estimate the associated theoretical
uncertainties by studying the dependence on the perturbative QCD scales
(renormalisation, factorisation and shower) and by comparing different
parton-shower models (Pythia8 and Herwig++) and matching schemes
(MadGraph5_aMC@NLO and POWHEG). Based on these results, we propose a simple
procedure to include bottom-quark effects in neutral-current Drell-Yan
production, going beyond the standard massless approximation. Focusing on the
inclusive lepton-pair transverse-momentum distribution $p_{\bot}^{l^+l^-}$, we
quantify the impact of such effects on the tuning of the simulation of
charged-current Drell-Yan observables and the $W$-boson mass determination.
|
hep-ph hep-ex
|
we perform a study of leptonpair production in association with bottom quarks at the lhc based on the predictions obtained at nexttoleading order in qcd both at fixed order and matched with a qcd parton shower we consider a comprehensive set of observables and estimate the associated theoretical uncertainties by studying the dependence on the perturbative qcd scales renormalisation factorisation and shower and by comparing different partonshower models pythia8 and herwig and matching schemes madgraph5_amcnlo and powheg based on these results we propose a simple procedure to include bottomquark effects in neutralcurrent drellyan production going beyond the standard massless approximation focusing on the inclusive leptonpair transversemomentum distribution p_botll we quantify the impact of such effects on the tuning of the simulation of chargedcurrent drellyan observables and the wboson mass determination
|
[['we', 'perform', 'a', 'study', 'of', 'leptonpair', 'production', 'in', 'association', 'with', 'bottom', 'quarks', 'at', 'the', 'lhc', 'based', 'on', 'the', 'predictions', 'obtained', 'at', 'nexttoleading', 'order', 'in', 'qcd', 'both', 'at', 'fixed', 'order', 'and', 'matched', 'with', 'a', 'qcd', 'parton', 'shower', 'we', 'consider', 'a', 'comprehensive', 'set', 'of', 'observables', 'and', 'estimate', 'the', 'associated', 'theoretical', 'uncertainties', 'by', 'studying', 'the', 'dependence', 'on', 'the', 'perturbative', 'qcd', 'scales', 'renormalisation', 'factorisation', 'and', 'shower', 'and', 'by', 'comparing', 'different', 'partonshower', 'models', 'pythia8', 'and', 'herwig', 'and', 'matching', 'schemes', 'madgraph5_amcnlo', 'and', 'powheg', 'based', 'on', 'these', 'results', 'we', 'propose', 'a', 'simple', 'procedure', 'to', 'include', 'bottomquark', 'effects', 'in', 'neutralcurrent', 'drellyan', 'production', 'going', 'beyond', 'the', 'standard', 'massless', 'approximation', 'focusing', 'on', 'the', 'inclusive', 'leptonpair', 'transversemomentum', 'distribution', 'p_botll', 'we', 'quantify', 'the', 'impact', 'of', 'such', 'effects', 'on', 'the', 'tuning', 'of', 'the', 'simulation', 'of', 'chargedcurrent', 'drellyan', 'observables', 'and', 'the', 'wboson', 'mass', 'determination']]
|
[-0.01506189416819649, 0.1607472146067104, -0.13014695945361904, 0.18030765548694966, -0.037122172478571996, -0.03737380475937497, 0.029742099963807205, 0.382131072726866, -0.15922743623332633, -0.2541210893469379, -0.011676085873709111, -0.3464091346967359, 0.06277513121888258, 0.10485965453445652, 0.09718981031833808, 0.15933855066018165, 0.1378277445919523, -0.053760491896334084, -0.11371275462758865, -0.2008350500277453, 0.34072755181858705, 0.0934803430135398, 0.22938946807800337, 0.1896231396542501, 0.087375157077295, 0.11792622673209728, -0.17543484507283816, -0.04885063969075333, -0.1728911613179154, 0.04691590127975557, 0.19396252607216163, 0.015144786515901254, 0.10895169320220287, -0.3744617958459281, -0.08027269403529606, 0.059884276879994675, 0.13649094748751137, 0.10845761631377214, -0.042392658501098204, -0.2814591997050384, 0.11336831488401101, -0.2914920437705609, -0.07519979617836373, -0.09243563042913903, -0.1300115919845222, -0.03318435905407392, -0.35823404914049733, 0.04959385539224559, -0.09712204009352267, 0.04470783661574472, 0.07920958128461773, -0.21052035644231726, -0.052525743190560116, 0.06289938852450876, 0.11629428285536854, 0.05564175473184094, 0.1806741787423921, -0.2040898172914, -0.2644294063423493, 0.4324886091342268, -0.049457096915273356, -0.18566241477798426, 0.14053353189324685, -0.21544013119279226, -0.1808232763175701, 0.08880521193175583, 0.29208944283801225, 0.10661636925367422, -0.18798024641970792, 0.1314606762530874, 0.033491649513327795, 0.1372997161730142, 0.05816872865539188, 0.03452548235763124, 0.17249730691429258, 0.24040616380931565, -0.06940937136090541, 0.042335523546911606, -0.10118168216991029, -0.1180542123309055, -0.4618260730924301, -0.03659046947768377, -0.054388277535868244, 0.03517027515665332, -0.1280745235804194, -0.16509901950958855, 0.39876576450963813, 0.1893110438466592, 0.2583923939355584, 0.07331376435964318, 0.3753761872631144, 0.09740021960485398, 0.04244022064863942, 0.06458079736939697, 0.25966660955617593, 0.1555801797513814, 0.10269255439079432, -0.29289171263546676, 0.0475661428194031, 0.13476668803432826]
|
1,803.04337
|
Replication study: Development and validation of deep learning algorithm
for detection of diabetic retinopathy in retinal fundus photographs
|
Replication studies are essential for validation of new methods, and are
crucial to maintain the high standards of scientific publications, and to use
the results in practice. We have attempted to replicate the main method in
'Development and validation of a deep learning algorithm for detection of
diabetic retinopathy in retinal fundus photographs' published in JAMA 2016;
316(22). We re-implemented the method since the source code is not available,
and we used publicly available data sets. The original study used non-public
fundus images from EyePACS and three hospitals in India for training. We used a
different EyePACS data set from Kaggle. The original study used the benchmark
data set Messidor-2 to evaluate the algorithm's performance. We used the same
data set. In the original study, ophthalmologists re-graded all images for
diabetic retinopathy, macular edema, and image gradability. There was one
diabetic retinopathy grade per image for our data sets, and we assessed image
gradability ourselves. Hyper-parameter settings were not described in the
original study. But some of these were later published. We were not able to
replicate the original study. Our algorithm's area under the receiver operating
curve (AUC) of 0.94 on the Kaggle EyePACS test set and 0.80 on Messidor-2 did
not come close to the reported AUC of 0.99 in the original study. This may be
caused by the use of a single grade per image, different data, or different not
described hyper-parameter settings. This study shows the challenges of
replicating deep learning, and the need for more replication studies to
validate deep learning methods, especially for medical image analysis.
Our source code and instructions are available at:
https://github.com/mikevoets/jama16-retina-replication
|
cs.CV
|
replication studies are essential for validation of new methods and are crucial to maintain the high standards of scientific publications and to use the results in practice we have attempted to replicate the main method in development and validation of a deep learning algorithm for detection of diabetic retinopathy in retinal fundus photographs published in jama 2016 31622 we reimplemented the method since the source code is not available and we used publicly available data sets the original study used nonpublic fundus images from eyepacs and three hospitals in india for training we used a different eyepacs data set from kaggle the original study used the benchmark data set messidor2 to evaluate the algorithms performance we used the same data set in the original study ophthalmologists regraded all images for diabetic retinopathy macular edema and image gradability there was one diabetic retinopathy grade per image for our data sets and we assessed image gradability ourselves hyperparameter settings were not described in the original study but some of these were later published we were not able to replicate the original study our algorithms area under the receiver operating curve auc of 094 on the kaggle eyepacs test set and 080 on messidor2 did not come close to the reported auc of 099 in the original study this may be caused by the use of a single grade per image different data or different not described hyperparameter settings this study shows the challenges of replicating deep learning and the need for more replication studies to validate deep learning methods especially for medical image analysis our source code and instructions are available at httpsgithubcommikevoetsjama16retinareplication
|
[['replication', 'studies', 'are', 'essential', 'for', 'validation', 'of', 'new', 'methods', 'and', 'are', 'crucial', 'to', 'maintain', 'the', 'high', 'standards', 'of', 'scientific', 'publications', 'and', 'to', 'use', 'the', 'results', 'in', 'practice', 'we', 'have', 'attempted', 'to', 'replicate', 'the', 'main', 'method', 'in', 'development', 'and', 'validation', 'of', 'a', 'deep', 'learning', 'algorithm', 'for', 'detection', 'of', 'diabetic', 'retinopathy', 'in', 'retinal', 'fundus', 'photographs', 'published', 'in', 'jama', '2016', '31622', 'we', 'reimplemented', 'the', 'method', 'since', 'the', 'source', 'code', 'is', 'not', 'available', 'and', 'we', 'used', 'publicly', 'available', 'data', 'sets', 'the', 'original', 'study', 'used', 'nonpublic', 'fundus', 'images', 'from', 'eyepacs', 'and', 'three', 'hospitals', 'in', 'india', 'for', 'training', 'we', 'used', 'a', 'different', 'eyepacs', 'data', 'set', 'from', 'kaggle', 'the', 'original', 'study', 'used', 'the', 'benchmark', 'data', 'set', 'messidor2', 'to', 'evaluate', 'the', 'algorithms', 'performance', 'we', 'used', 'the', 'same', 'data', 'set', 'in', 'the', 'original', 'study', 'ophthalmologists', 'regraded', 'all', 'images', 'for', 'diabetic', 'retinopathy', 'macular', 'edema', 'and', 'image', 'gradability', 'there', 'was', 'one', 'diabetic', 'retinopathy', 'grade', 'per', 'image', 'for', 'our', 'data', 'sets', 'and', 'we', 'assessed', 'image', 'gradability', 'ourselves', 'hyperparameter', 'settings', 'were', 'not', 'described', 'in', 'the', 'original', 'study', 'but', 'some', 'of', 'these', 'were', 'later', 'published', 'we', 'were', 'not', 'able', 'to', 'replicate', 'the', 'original', 'study', 'our', 'algorithms', 'area', 'under', 'the', 'receiver', 'operating', 'curve', 'auc', 'of', '094', 'on', 'the', 'kaggle', 'eyepacs', 'test', 'set', 'and', '080', 'on', 'messidor2', 'did', 'not', 'come', 'close', 'to', 'the', 'reported', 'auc', 'of', '099', 'in', 'the', 'original', 'study', 'this', 'may', 'be', 'caused', 'by', 'the', 'use', 'of', 'a', 'single', 'grade', 'per', 'image', 'different', 'data', 'or', 'different', 'not', 'described', 'hyperparameter', 'settings', 'this', 'study', 'shows', 'the', 'challenges', 'of', 'replicating', 'deep', 'learning', 'and', 'the', 'need', 'for', 'more', 'replication', 'studies', 'to', 'validate', 'deep', 'learning', 'methods', 'especially', 'for', 'medical', 'image', 'analysis', 'our', 'source', 'code', 'and', 'instructions', 'are', 'available', 'at', 'httpsgithubcommikevoetsjama16retinareplication']]
|
[-0.01061353064010872, -0.047749958069350826, -0.0513101205128224, 0.09187924847334161, -0.05605061954198951, -0.16218009933696262, 0.041324684855920314, 0.4157719764774455, -0.19069871663543067, -0.3477835022088112, 0.14125662802673064, -0.30392417660039056, -0.12738739062342233, 0.2577865749371721, -0.17293484319575636, 0.08682387091457508, 0.15009126571642542, 0.02177858282636879, -0.005405964140773267, -0.3491770297611006, 0.2690794992267637, 0.03656025216759347, 0.35648506200571256, 0.021793278656975206, 0.07784034388885602, -0.028766952755382193, -0.0769348164671976, -0.024798816374128445, -0.11759839893609314, 0.1495571641275078, 0.3340373747295847, 0.2344652672256238, 0.29932585150822716, -0.3942595342230192, -0.15790845906839854, 0.10144966344009469, 0.10784193015258227, 0.10251050058592993, -0.03292141656796807, -0.3032077385210677, 0.10209762538552172, -0.13616438532472216, -0.02708120904856316, -0.09339795109953318, -0.04492754847707605, -0.012343086966635533, -0.2601026320933711, 0.04462001313406386, -0.004381085873784539, 0.13851282187856565, -0.08476328599018122, -0.1614206526113352, -0.0005640081460860118, 0.19977893653637344, 0.036310226021464075, 0.06877653573769235, 0.13046226541900569, -0.14202646565112295, -0.11553129541015435, 0.3736344992981425, -0.0356774155411141, -0.14645452771153777, 0.2052414907362221, -0.09660356345190842, -0.1529515031112456, 0.0992453018504482, 0.2225864500864724, 0.09611809608015351, -0.19312887122952843, -0.021921974430383705, -0.011682043629313322, 0.1817721697235746, 0.06304846465748672, -0.07985065590250622, 0.12882494034781294, 0.20130146035786256, -0.0630678230278628, 0.1412823951065267, -0.1645960006075106, -0.012118898298857468, -0.23683871572865242, -0.13067832406386173, -0.161691248861117, -0.027150276174960936, -0.05427768479284736, -0.1292882876337639, 0.39716193722771076, 0.2332007358558791, 0.14808408398090606, 0.03169349600653745, 0.31411469173862744, -0.006527117506252546, 0.1275563639640297, 0.07158546962449677, 0.2041724877248394, -0.014304611872003284, 0.13547981111682894, -0.16563544095724933, 0.08724845214956965, 0.009004812563561197]
|
1,803.04338
|
Flickering in AGB stars: Probing the nature of accreting companions
|
Binary companions to asymptotic giant branch (AGB) stars are an important
aspect of their evolution. Few AGB companions have been detected, and in most
cases it is difficult to distinguish between main-sequence and white dwarf
companions. Detection of photometric flickering, a tracer of compact accretion
disks around white dwarfs, can help identify the nature of these companions. In
this work, we searched for flickering in four AGB stars suggested to have
likely accreting companions. We found no signs for flickering in two targets:
R~Aqr and V1016 Cyg. Flickering was detected in the other two stars: Mira and Y
Gem. We investigated the true nature of Mira's companion using three different
approaches. Our results for Mira strongly suggest that its companion is a white
dwarf.
|
astro-ph.SR
|
binary companions to asymptotic giant branch agb stars are an important aspect of their evolution few agb companions have been detected and in most cases it is difficult to distinguish between mainsequence and white dwarf companions detection of photometric flickering a tracer of compact accretion disks around white dwarfs can help identify the nature of these companions in this work we searched for flickering in four agb stars suggested to have likely accreting companions we found no signs for flickering in two targets raqr and v1016 cyg flickering was detected in the other two stars mira and y gem we investigated the true nature of miras companion using three different approaches our results for mira strongly suggest that its companion is a white dwarf
|
[['binary', 'companions', 'to', 'asymptotic', 'giant', 'branch', 'agb', 'stars', 'are', 'an', 'important', 'aspect', 'of', 'their', 'evolution', 'few', 'agb', 'companions', 'have', 'been', 'detected', 'and', 'in', 'most', 'cases', 'it', 'is', 'difficult', 'to', 'distinguish', 'between', 'mainsequence', 'and', 'white', 'dwarf', 'companions', 'detection', 'of', 'photometric', 'flickering', 'a', 'tracer', 'of', 'compact', 'accretion', 'disks', 'around', 'white', 'dwarfs', 'can', 'help', 'identify', 'the', 'nature', 'of', 'these', 'companions', 'in', 'this', 'work', 'we', 'searched', 'for', 'flickering', 'in', 'four', 'agb', 'stars', 'suggested', 'to', 'have', 'likely', 'accreting', 'companions', 'we', 'found', 'no', 'signs', 'for', 'flickering', 'in', 'two', 'targets', 'raqr', 'and', 'v1016', 'cyg', 'flickering', 'was', 'detected', 'in', 'the', 'other', 'two', 'stars', 'mira', 'and', 'y', 'gem', 'we', 'investigated', 'the', 'true', 'nature', 'of', 'miras', 'companion', 'using', 'three', 'different', 'approaches', 'our', 'results', 'for', 'mira', 'strongly', 'suggest', 'that', 'its', 'companion', 'is', 'a', 'white', 'dwarf']]
|
[-0.08275997311982318, 0.11668985927720248, -0.10180216008509563, 0.12493300311195445, -0.17720491085504372, -0.11025374831359197, 0.09034309376833763, 0.4478990903230217, -0.0940912384071342, -0.32522283302150606, 0.04651634243971903, -0.32080212056757956, -0.10971236485624458, 0.1957359716326483, -0.16373320816963063, -0.009510181552249695, 0.162665671271431, -0.07749533076814141, -0.022680118829541938, -0.34590393306339173, 0.29527882590693066, -0.05036723699867422, 0.007564673512583462, -0.12904291017723035, 0.0003439683421719365, -0.15944466551356926, -0.09350733364349216, -0.12473800486204561, -0.12174040780667021, -0.041745494487051796, 0.29439531558011545, 0.1264743379684453, 0.18247707354707446, -0.30843614735375574, -0.2542016189015372, 0.05508783740574509, 0.24037092226572576, -0.04002079526265341, -0.08978528673268431, -0.2608364337224256, 0.1476189091634119, -0.2242456352058041, -0.15196819500467643, 0.0555347975729624, 0.13325975795193173, 0.04477266855235022, -0.2194677214327503, 0.07511603457349678, 0.1486283334320396, 0.11066678231506329, -0.13991549103501882, -0.16314964660829523, -0.03276359074090312, 0.10348028257655782, 0.08953804727378718, 0.0474529111856307, 0.0952391545894003, -0.12392925000863105, -0.02195726265010189, 0.34662922072495006, -0.1316801658093293, -0.030088121547530277, 0.35854460924439796, -0.2056837495969139, -0.21085694713453665, 0.10503879811887334, 0.1436992708396742, 0.2219426127953258, -0.24503405799528932, -0.08472937606918679, 0.04558983022286519, 0.19988415178623262, 0.09109054223683519, 0.09208618202417089, 0.428816012576283, 0.13834385203227886, -0.03988652594190666, 0.09476140324959562, -0.32013562616960306, -0.050133286441517315, -0.14355480016731634, -0.11101781832039113, -0.1427079725336677, 0.07475481082200701, -0.12057923588843077, -0.13710901941498363, 0.31461360403412303, 0.11255828392449616, 0.19103164621439528, -0.05608074985656554, 0.26475021210536964, 0.0880392355857629, 0.06605934099733406, 0.1574058681575021, 0.3839799590045359, 0.22542180551019142, 0.09438212096267115, -0.24628636568815002, 0.12001064595599788, -0.0018437851099221687]
|
1,803.04339
|
Magnetic monopoles in pure $SU (2)$ Yang--Mills theory with a
gauge-invariant mass
|
In this paper, we show the existence of magnetic monopoles in the pure
$SU(2)$ Yang--Mills theory even in absence of scalar fields when the
gauge-invariant mass term is introduced. This result follows from the recent
proposal for obtaining the gauge field configurations in the Yang-Mills theory
from the solutions of the field equations in the "complementary" gauge-scalar
model with the radial length of the scalar field being fixed. The
gauge-invariant mass term is obtained through a change of variables and a
gauge-independent description of the Brout-Englert-Higgs mechanism which
neither relies on the spontaneous breaking of gauge symmetry nor on the
assumptions of the nonvanishing vacuum expectation value of the scalar field.
According to these procedures, we solve under the static and spherically
symmetric ansatz the field equations of the $SU(2)$ Yang-Mills theory coupled
with an adjoint scalar field whose radial degree of freedom is fixed, and
obtain a gauge field configuration of magnetic monopole with a minimum magnetic
charge in the massive $SU(2)$ Yang-Mills theory. We compare the magnetic
monopole obtained in this way in the massive Yang--Mills theory with the
Wu-Yang magnetic monopole in the pure Yang-Mills theory and the 't
Hooft-Polyakov magnetic monopole in the Georgi-Glashow model.
|
hep-th
|
in this paper we show the existence of magnetic monopoles in the pure su2 yangmills theory even in absence of scalar fields when the gaugeinvariant mass term is introduced this result follows from the recent proposal for obtaining the gauge field configurations in the yangmills theory from the solutions of the field equations in the complementary gaugescalar model with the radial length of the scalar field being fixed the gaugeinvariant mass term is obtained through a change of variables and a gaugeindependent description of the broutenglerthiggs mechanism which neither relies on the spontaneous breaking of gauge symmetry nor on the assumptions of the nonvanishing vacuum expectation value of the scalar field according to these procedures we solve under the static and spherically symmetric ansatz the field equations of the su2 yangmills theory coupled with an adjoint scalar field whose radial degree of freedom is fixed and obtain a gauge field configuration of magnetic monopole with a minimum magnetic charge in the massive su2 yangmills theory we compare the magnetic monopole obtained in this way in the massive yangmills theory with the wuyang magnetic monopole in the pure yangmills theory and the t hooftpolyakov magnetic monopole in the georgiglashow model
|
[['in', 'this', 'paper', 'we', 'show', 'the', 'existence', 'of', 'magnetic', 'monopoles', 'in', 'the', 'pure', 'su2', 'yangmills', 'theory', 'even', 'in', 'absence', 'of', 'scalar', 'fields', 'when', 'the', 'gaugeinvariant', 'mass', 'term', 'is', 'introduced', 'this', 'result', 'follows', 'from', 'the', 'recent', 'proposal', 'for', 'obtaining', 'the', 'gauge', 'field', 'configurations', 'in', 'the', 'yangmills', 'theory', 'from', 'the', 'solutions', 'of', 'the', 'field', 'equations', 'in', 'the', 'complementary', 'gaugescalar', 'model', 'with', 'the', 'radial', 'length', 'of', 'the', 'scalar', 'field', 'being', 'fixed', 'the', 'gaugeinvariant', 'mass', 'term', 'is', 'obtained', 'through', 'a', 'change', 'of', 'variables', 'and', 'a', 'gaugeindependent', 'description', 'of', 'the', 'broutenglerthiggs', 'mechanism', 'which', 'neither', 'relies', 'on', 'the', 'spontaneous', 'breaking', 'of', 'gauge', 'symmetry', 'nor', 'on', 'the', 'assumptions', 'of', 'the', 'nonvanishing', 'vacuum', 'expectation', 'value', 'of', 'the', 'scalar', 'field', 'according', 'to', 'these', 'procedures', 'we', 'solve', 'under', 'the', 'static', 'and', 'spherically', 'symmetric', 'ansatz', 'the', 'field', 'equations', 'of', 'the', 'su2', 'yangmills', 'theory', 'coupled', 'with', 'an', 'adjoint', 'scalar', 'field', 'whose', 'radial', 'degree', 'of', 'freedom', 'is', 'fixed', 'and', 'obtain', 'a', 'gauge', 'field', 'configuration', 'of', 'magnetic', 'monopole', 'with', 'a', 'minimum', 'magnetic', 'charge', 'in', 'the', 'massive', 'su2', 'yangmills', 'theory', 'we', 'compare', 'the', 'magnetic', 'monopole', 'obtained', 'in', 'this', 'way', 'in', 'the', 'massive', 'yangmills', 'theory', 'with', 'the', 'wuyang', 'magnetic', 'monopole', 'in', 'the', 'pure', 'yangmills', 'theory', 'and', 'the', 't', 'hooftpolyakov', 'magnetic', 'monopole', 'in', 'the', 'georgiglashow', 'model']]
|
[-0.17092879393357951, 0.20888664897353723, -0.07162013795839894, 0.06309162420056873, -0.06241912441328168, -0.08329193862669881, -0.0249033547568149, 0.2907642706206078, -0.1518445132100187, -0.29432621034302153, 0.0388059894561337, -0.22229819218323907, -0.1464631564086818, 0.0652174976017869, 0.009769056661606733, 4.78203628380694e-05, -0.03983627724222577, 0.12932903410389496, -0.11054261453126805, -0.2291426113531714, 0.36664140867139566, -0.009559124974936396, 0.2758468458120098, 0.03942607884294115, 0.11215202407162618, 0.03629560826636439, 0.005292235393645757, 0.031228605593136692, -0.10191123530118909, 0.07189384253517767, 0.13453701389111092, 0.05089667833283843, 0.16082771827967549, -0.44326751315077045, -0.2048552622831422, 0.0938600194780858, 0.1186214882445208, 0.1740418833758841, -0.04461280752942153, -0.2995347530632537, 0.07253091485384645, -0.1514510110088059, -0.2094498479548121, -0.0800643718155597, -0.02922811487223953, -0.05525308743999082, -0.3166826332301538, 0.10065428422876264, 0.0191215578538024, 0.08569596878173363, -0.12187276030984244, -0.07792980199558051, -0.07947583571684795, 0.03242443624404774, 0.17839177678591905, 0.12281104992699561, 0.12284717480499933, -0.2328968914717099, -0.12944939064011726, 0.34696299384287255, -0.12881989281708797, -0.22464555475261794, 0.11195280368734695, -0.15684087957541024, -0.13549887395496643, 0.10078777956785681, 0.10198465330308612, 0.1958540360134413, -0.13684990751621695, 0.23010751677457075, -0.06671495939810859, 0.13543646344236432, 0.05253932582935197, 0.02816415119017638, 0.26806557264609554, 0.08054153216024627, 0.056642205983250586, 0.12380636826709811, -0.01130932643213988, -0.16932416623271065, -0.39388122887177457, -0.13359681388185402, -0.14375078501811617, 0.11203266920990734, -0.14295738788020923, -0.20506724309007726, 0.39036941388621926, 0.1454077126059316, 0.11831852055187501, 0.007424333774550214, 0.2518016961695692, 0.14142174093548826, 0.08808276216276037, 0.06107893811033374, 0.28908872451918693, 0.27173216281348755, 0.13305109737665585, -0.29206557511047804, -0.14097324267776223, 0.1507585114102118]
|
1,803.0434
|
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in
Quantum Annealing
|
Despite rapid recent progress towards the development of quantum computers
capable of providing computational advantages over classical computers, it
seems likely that such computers will, initially at least, be required to run
in a hybrid quantum-classical regime. This realisation has led to interest in
hybrid quantum-classical algorithms allowing, for example, quantum computers to
solve large problems despite having very limited numbers of qubits. Here we
propose a hybrid paradigm for quantum annealers with the goal of mitigating a
different limitation of such devices: the need to embed problem instances
within the (often highly restricted) connectivity graph of the annealer. This
embedding process can be costly to perform and may destroy any computational
speedup. In order to solve many practical problems, it is moreover necessary to
perform many, often related, such embeddings. We will show how, for such
problems, a raw speedup that is negated by the embedding time can nonetheless
be exploited to give a real speedup. As a proof-of-concept example we present
an in-depth case study of a simple problem based on the maximum weight
independent set problem. Although we do not observe a quantum speedup
experimentally, the advantage of the hybrid approach is robustly verified,
showing how a potential quantum speedup may be exploited and encouraging
further efforts to apply the approach to problems of more practical interest.
|
cs.DS quant-ph
|
despite rapid recent progress towards the development of quantum computers capable of providing computational advantages over classical computers it seems likely that such computers will initially at least be required to run in a hybrid quantumclassical regime this realisation has led to interest in hybrid quantumclassical algorithms allowing for example quantum computers to solve large problems despite having very limited numbers of qubits here we propose a hybrid paradigm for quantum annealers with the goal of mitigating a different limitation of such devices the need to embed problem instances within the often highly restricted connectivity graph of the annealer this embedding process can be costly to perform and may destroy any computational speedup in order to solve many practical problems it is moreover necessary to perform many often related such embeddings we will show how for such problems a raw speedup that is negated by the embedding time can nonetheless be exploited to give a real speedup as a proofofconcept example we present an indepth case study of a simple problem based on the maximum weight independent set problem although we do not observe a quantum speedup experimentally the advantage of the hybrid approach is robustly verified showing how a potential quantum speedup may be exploited and encouraging further efforts to apply the approach to problems of more practical interest
|
[['despite', 'rapid', 'recent', 'progress', 'towards', 'the', 'development', 'of', 'quantum', 'computers', 'capable', 'of', 'providing', 'computational', 'advantages', 'over', 'classical', 'computers', 'it', 'seems', 'likely', 'that', 'such', 'computers', 'will', 'initially', 'at', 'least', 'be', 'required', 'to', 'run', 'in', 'a', 'hybrid', 'quantumclassical', 'regime', 'this', 'realisation', 'has', 'led', 'to', 'interest', 'in', 'hybrid', 'quantumclassical', 'algorithms', 'allowing', 'for', 'example', 'quantum', 'computers', 'to', 'solve', 'large', 'problems', 'despite', 'having', 'very', 'limited', 'numbers', 'of', 'qubits', 'here', 'we', 'propose', 'a', 'hybrid', 'paradigm', 'for', 'quantum', 'annealers', 'with', 'the', 'goal', 'of', 'mitigating', 'a', 'different', 'limitation', 'of', 'such', 'devices', 'the', 'need', 'to', 'embed', 'problem', 'instances', 'within', 'the', 'often', 'highly', 'restricted', 'connectivity', 'graph', 'of', 'the', 'annealer', 'this', 'embedding', 'process', 'can', 'be', 'costly', 'to', 'perform', 'and', 'may', 'destroy', 'any', 'computational', 'speedup', 'in', 'order', 'to', 'solve', 'many', 'practical', 'problems', 'it', 'is', 'moreover', 'necessary', 'to', 'perform', 'many', 'often', 'related', 'such', 'embeddings', 'we', 'will', 'show', 'how', 'for', 'such', 'problems', 'a', 'raw', 'speedup', 'that', 'is', 'negated', 'by', 'the', 'embedding', 'time', 'can', 'nonetheless', 'be', 'exploited', 'to', 'give', 'a', 'real', 'speedup', 'as', 'a', 'proofofconcept', 'example', 'we', 'present', 'an', 'indepth', 'case', 'study', 'of', 'a', 'simple', 'problem', 'based', 'on', 'the', 'maximum', 'weight', 'independent', 'set', 'problem', 'although', 'we', 'do', 'not', 'observe', 'a', 'quantum', 'speedup', 'experimentally', 'the', 'advantage', 'of', 'the', 'hybrid', 'approach', 'is', 'robustly', 'verified', 'showing', 'how', 'a', 'potential', 'quantum', 'speedup', 'may', 'be', 'exploited', 'and', 'encouraging', 'further', 'efforts', 'to', 'apply', 'the', 'approach', 'to', 'problems', 'of', 'more', 'practical', 'interest']]
|
[-0.10554275469251231, 0.05856079783942815, -0.09438121620861983, 0.05481695149928782, -0.11860161674716933, -0.17463251708964395, 0.05896594580051235, 0.3986065818674185, -0.29687921727414834, -0.3460240973688831, 0.11271187287427231, -0.2156409729653123, -0.18486469268417832, 0.2765945559669159, -0.11562320486168987, 0.1219061279965734, 0.1251191279745068, 0.009101127816194838, -0.06260165292875502, -0.2917338535640738, 0.23436777311726473, 0.04505780588740229, 0.27069927799219096, 0.0734493596849709, 0.07771236420693722, -0.047420424002815376, 0.047983804647810754, 0.04722224742819724, -0.06528034294374678, 0.1352512304655234, 0.3323798298200762, 0.16562302068047177, 0.36611018597825684, -0.486338945672932, -0.22312281701756134, 0.1656544607026841, 0.18388910356972535, 0.1609194326849485, -0.06670259744099563, -0.2399553876190277, 0.10672610431634398, -0.16694272887173361, -0.10382780993498851, -0.13943173364651473, -0.005904524011368101, -0.05572898491518572, -0.24440504614136774, 0.009803648838053711, 0.044372955951257606, 0.0037692978956990622, 0.05175478603599582, -0.0701157834677195, 0.115499369926031, 0.12191680898381906, -0.02307789910238088, 0.024290846060665155, 0.103133474804715, -0.11704783900482156, -0.19837569360494275, 0.4083306461943059, 0.002153035094009035, -0.2053069108980708, 0.2134189471639481, -0.050944694648073476, -0.15826535138555547, 0.09550036216070029, 0.1818434966460865, 0.10494629860913847, -0.13031261928104373, 0.0681311818681107, 0.012506176057186994, 0.1880552637115629, 0.007988086225867103, 0.06007520998404785, 0.19998057326857552, 0.2071538620363836, 0.08598116787774912, 0.1631448600314219, -0.02984539648009972, -0.1309573241805827, -0.23996349058791316, -0.18081186297720045, -0.2101318018786101, 0.08348318906401718, -0.05457653606254925, -0.14159950864162635, 0.35543800731697545, 0.22726998873060272, 0.17319134227423505, 0.04991810333237729, 0.3154551170343025, 0.08323776875523353, 0.09860826424502937, 0.08495733136290007, 0.1915475366203199, 0.08713518512456424, 0.10051387394494006, -0.19452540940943766, 0.06278249917734435, -0.015072927592237564]
|
1,803.04341
|
Stochastic perturbation theory to correct non-linearly parametrized
wavefunctions
|
We introduce an algorithm that can be used to perform stochastic perturbation
theory (sPT) to correct any non-linearly parametrized wavefunction that can be
optimized using orbital space Variational Monte Carlo (VMC). Although the
variational method gaurantees that the VMC energy can be systematically
improved the cost of doing so in practice is often prohibitive. The sPT
algorithm presented in this work represents an efficient way to improve the VMC
energies with a relatively small computational overhead. We demonstrate that
for the carbon dimer and Fe-porphyrin the sPT algorithm is able to capture
$>97\%$ and $>60\%$ respectively of the correlation energy missing from the
zeroth order wavefunction. Further, the sPT algorithm is also ideally suited
for massively parallel computations because it delivers super-linear speedup
with an increasing number of processors.
|
cond-mat.str-el physics.chem-ph physics.comp-ph
|
we introduce an algorithm that can be used to perform stochastic perturbation theory spt to correct any nonlinearly parametrized wavefunction that can be optimized using orbital space variational monte carlo vmc although the variational method gaurantees that the vmc energy can be systematically improved the cost of doing so in practice is often prohibitive the spt algorithm presented in this work represents an efficient way to improve the vmc energies with a relatively small computational overhead we demonstrate that for the carbon dimer and feporphyrin the spt algorithm is able to capture 97 and 60 respectively of the correlation energy missing from the zeroth order wavefunction further the spt algorithm is also ideally suited for massively parallel computations because it delivers superlinear speedup with an increasing number of processors
|
[['we', 'introduce', 'an', 'algorithm', 'that', 'can', 'be', 'used', 'to', 'perform', 'stochastic', 'perturbation', 'theory', 'spt', 'to', 'correct', 'any', 'nonlinearly', 'parametrized', 'wavefunction', 'that', 'can', 'be', 'optimized', 'using', 'orbital', 'space', 'variational', 'monte', 'carlo', 'vmc', 'although', 'the', 'variational', 'method', 'gaurantees', 'that', 'the', 'vmc', 'energy', 'can', 'be', 'systematically', 'improved', 'the', 'cost', 'of', 'doing', 'so', 'in', 'practice', 'is', 'often', 'prohibitive', 'the', 'spt', 'algorithm', 'presented', 'in', 'this', 'work', 'represents', 'an', 'efficient', 'way', 'to', 'improve', 'the', 'vmc', 'energies', 'with', 'a', 'relatively', 'small', 'computational', 'overhead', 'we', 'demonstrate', 'that', 'for', 'the', 'carbon', 'dimer', 'and', 'feporphyrin', 'the', 'spt', 'algorithm', 'is', 'able', 'to', 'capture', '97', 'and', '60', 'respectively', 'of', 'the', 'correlation', 'energy', 'missing', 'from', 'the', 'zeroth', 'order', 'wavefunction', 'further', 'the', 'spt', 'algorithm', 'is', 'also', 'ideally', 'suited', 'for', 'massively', 'parallel', 'computations', 'because', 'it', 'delivers', 'superlinear', 'speedup', 'with', 'an', 'increasing', 'number', 'of', 'processors']]
|
[-0.08542500318266279, 0.10399736019603587, -0.11692072740618804, 0.10339296930613964, -0.068505385356356, -0.12218710135798468, 0.059804739846573605, 0.39734497062804164, -0.268001520674127, -0.39043894459226336, 0.06223907565171, -0.21128482775863752, -0.14889960864544377, 0.19184508567401606, -0.030029094669707986, 0.08126362505578255, 0.11534987844422084, -0.02652437885313533, -0.09263028250601099, -0.31596919204570467, 0.2059928811734629, 0.1295707757158797, 0.2520998156694479, 0.014435210387951643, 0.08330945853259443, -0.007947900617682888, 0.025576242664467917, 0.04414686005063492, -0.10605364593667296, 0.14428479601304198, 0.2798197790023748, 0.10031187314857808, 0.26036113457277765, -0.4310117315847513, -0.14827374651416225, 0.10414460590903381, 0.19476918279271854, 0.17324807920652016, 0.0052710997496637725, -0.25041772501341014, 0.06570034064785686, -0.19733252091867517, -0.12403843145954689, -0.1809918561448567, -0.07096678726808277, -0.01868456684399483, -0.2746741551934749, 0.07619938207226228, -0.04502278618341268, 0.007006001377175021, -0.00922557860324087, -0.1292221662985493, -0.02845124073160538, 0.08773032940794216, -0.012943508714501107, 0.10786272344619845, 0.08232789984795937, -0.05635709687706458, -0.12362741605629567, 0.3813242472260613, -0.06040791313564622, -0.20809954906589995, 0.16813860415452153, -0.07375947945553163, -0.18388943399425395, 0.20111825696532, 0.13647789902021285, 0.11230989029385553, -0.16122984825254438, 0.09646736102651574, 0.02577447648297331, 0.21536040809655257, -0.01621273589544287, 0.01907189654785591, 0.12214442490520634, 0.17604722166000758, 0.12240221014231906, 0.14416782547225238, -0.119904863900801, -0.10770160765495411, -0.2507148880164984, -0.1837210471438634, -0.260193210698, -0.003589918697974825, -0.09117455778317707, -0.16593436105537784, 0.32027184256070923, 0.21418439115708074, 0.14141831720291181, 0.09938993730560639, 0.3335681739732508, 0.11954873289133228, 0.08577658867737813, 0.12617633517383953, 0.204653356621374, 0.07955546347900878, 0.07499709262065012, -0.24863566196696876, 0.02276863690913301, 0.03669036760413658]
|
1,803.04342
|
On the circular chromatic number of a subgraph of the Kneser graph
|
Let $n,k,r$ be positive integers with $n \geq rk$ and $r \geq 2$. Consider a
circle $C$ with~$n$ points~$1,\ldots,n$ in clockwise order. The $r$-stable
\emph{interlacing graph} $\text{IG}_{n,k}^{(r)}$ is the graph with vertices
corresponding to $k$-subsets $S$ of $\{1,...,n\}$ such that any two distinct
points in~$S$ have distance at least~$r$ around the circle, and edges
between~$k$-subsets $P$ and $Q$ if they \emph{interlace}: after removing the
points in~$P$ from $C$, the points in~$Q$ are in different connected
components. In this paper we prove that the circular chromatic number of
$\text{IG}_{n,k}^{(r)}$ is equal to $ n/k $ (hence the chromatic number is
$\lceil n/k \rceil$) and that its circular clique number is also $ n/k $.
Furthermore, we show that its independence number is $\binom{n-(r-1)k-1}{k-1}$,
thereby strengthening a result by Talbot.
|
math.CO
|
let nkr be positive integers with n geq rk and r geq 2 consider a circle c withn points1ldotsn in clockwise order the rstable emphinterlacing graph textig_nkr is the graph with vertices corresponding to ksubsets s of 1n such that any two distinct points ins have distance at leastr around the circle and edges betweenksubsets p and q if they emphinterlace after removing the points inp from c the points inq are in different connected components in this paper we prove that the circular chromatic number of textig_nkr is equal to nk hence the chromatic number is lceil nk rceil and that its circular clique number is also nk furthermore we show that its independence number is binomnr1k1k1 thereby strengthening a result by talbot
|
[['let', 'nkr', 'be', 'positive', 'integers', 'with', 'n', 'geq', 'rk', 'and', 'r', 'geq', '2', 'consider', 'a', 'circle', 'c', 'withn', 'points1ldotsn', 'in', 'clockwise', 'order', 'the', 'rstable', 'emphinterlacing', 'graph', 'textig_nkr', 'is', 'the', 'graph', 'with', 'vertices', 'corresponding', 'to', 'ksubsets', 's', 'of', '1n', 'such', 'that', 'any', 'two', 'distinct', 'points', 'ins', 'have', 'distance', 'at', 'leastr', 'around', 'the', 'circle', 'and', 'edges', 'betweenksubsets', 'p', 'and', 'q', 'if', 'they', 'emphinterlace', 'after', 'removing', 'the', 'points', 'inp', 'from', 'c', 'the', 'points', 'inq', 'are', 'in', 'different', 'connected', 'components', 'in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'circular', 'chromatic', 'number', 'of', 'textig_nkr', 'is', 'equal', 'to', 'nk', 'hence', 'the', 'chromatic', 'number', 'is', 'lceil', 'nk', 'rceil', 'and', 'that', 'its', 'circular', 'clique', 'number', 'is', 'also', 'nk', 'furthermore', 'we', 'show', 'that', 'its', 'independence', 'number', 'is', 'binomnr1k1k1', 'thereby', 'strengthening', 'a', 'result', 'by', 'talbot']]
|
[-0.2243227607024641, 0.17581528692871556, -0.02816561353392899, -0.025392706132622372, -0.04171927005518228, -0.21811124780375896, 0.04938384476228184, 0.36667335739937323, -0.26525371065684433, -0.29180379451156174, 0.05831610703748522, -0.38796409139216975, -0.11864704388928407, 0.08786668473099969, -0.07666991188206934, -0.01276186753389554, 0.024774874114945274, 0.10298987664282322, 0.027148922185758772, -0.30835035511198183, 0.2830322802644865, -0.07016754006276485, 0.12177469554469632, 0.04445912322061586, 0.05296041806537562, 0.028808220165203614, 0.04999089535679026, 0.06445442947984577, -0.16322634272515205, 0.05198445620721784, 0.2510603799581014, 0.15294883092905492, 0.24913025188163437, -0.3642486191980926, -0.11572990826519752, 0.23390804543481047, 0.1705747920626389, 0.0072824283771955505, 0.039972388833873614, -0.15768408947142548, 0.21501240728559487, -0.0707382413534576, -0.14303250320994393, 0.01918419562119605, 0.1701689911243538, 0.013294373771400544, -0.27946165614412166, -0.022863990340456126, 0.13115894042983137, 0.0670079261883451, 0.09359801826388414, -0.20119307577561843, -0.07199263972117854, 0.07926739765941326, -0.032082904554734906, 0.10866892284810029, 0.02860144581966873, -0.06065228308856102, -0.1253498309002868, 0.33730278944130987, -0.01854775381246421, -0.15309164769032263, 0.09912812207215305, -0.20740710954374536, -0.12494073243779612, 0.12666079359016671, 0.09756428538018773, 0.14926432629501254, -0.005287625007973662, 0.16578322041033092, -0.13525452599098006, 0.1513824147766392, 0.18338705079453388, 0.018987523167040842, 0.16896956515145198, 0.04515281163461121, 0.13987935338602633, 0.14463549910077086, -0.06801244632164337, 0.04982869032417135, -0.30982432903015406, -0.12726655605741866, -0.25262555562296946, 0.08699935473951287, -0.19829760945416136, -0.10923201225473192, 0.3555176994795429, 0.09769113413218794, 0.2492650827184191, 0.12308939567221136, 0.2527241693520597, 0.06332700810413246, 0.020815882657188922, 0.18445029001931884, 0.09950681691507585, 0.12823399325937096, -0.04601258792159758, -0.20901443557372187, 0.009925365941759584, 0.12478920503455246]
|
1,803.04343
|
Data-driven investigations of culinary patterns in traditional recipes
across the world
|
Cultures around the world have acquired unique culinary practices reflected
in traditional recipe compositions. Data-driven analysis has the potential to
provide interesting insights into the structure of recipes and organizational
principles of cuisines. We provide a curated compilation of 45772 traditional
recipes from over 22 regions across the world. Using this resource in
conjunction with data of flavor molecules from natural ingredients, we
implement data-driven investigations for probing flavor pairing patterns in
these recipes. Our analysis reveals non-random recipe compositions
characterized with either 'uniform' or 'contrasting' flavor blending and
identifies popularity of ingredients as a key contributing factor across all
cuisines. Thus we provide a framework for data-driven investigations of
culinary patterns in recipes which can be leveraged for applications aimed at
food design, generating novel flavor pairings and tweaking recipes for better
nutrition and health.
|
physics.soc-ph
|
cultures around the world have acquired unique culinary practices reflected in traditional recipe compositions datadriven analysis has the potential to provide interesting insights into the structure of recipes and organizational principles of cuisines we provide a curated compilation of 45772 traditional recipes from over 22 regions across the world using this resource in conjunction with data of flavor molecules from natural ingredients we implement datadriven investigations for probing flavor pairing patterns in these recipes our analysis reveals nonrandom recipe compositions characterized with either uniform or contrasting flavor blending and identifies popularity of ingredients as a key contributing factor across all cuisines thus we provide a framework for datadriven investigations of culinary patterns in recipes which can be leveraged for applications aimed at food design generating novel flavor pairings and tweaking recipes for better nutrition and health
|
[['cultures', 'around', 'the', 'world', 'have', 'acquired', 'unique', 'culinary', 'practices', 'reflected', 'in', 'traditional', 'recipe', 'compositions', 'datadriven', 'analysis', 'has', 'the', 'potential', 'to', 'provide', 'interesting', 'insights', 'into', 'the', 'structure', 'of', 'recipes', 'and', 'organizational', 'principles', 'of', 'cuisines', 'we', 'provide', 'a', 'curated', 'compilation', 'of', '45772', 'traditional', 'recipes', 'from', 'over', '22', 'regions', 'across', 'the', 'world', 'using', 'this', 'resource', 'in', 'conjunction', 'with', 'data', 'of', 'flavor', 'molecules', 'from', 'natural', 'ingredients', 'we', 'implement', 'datadriven', 'investigations', 'for', 'probing', 'flavor', 'pairing', 'patterns', 'in', 'these', 'recipes', 'our', 'analysis', 'reveals', 'nonrandom', 'recipe', 'compositions', 'characterized', 'with', 'either', 'uniform', 'or', 'contrasting', 'flavor', 'blending', 'and', 'identifies', 'popularity', 'of', 'ingredients', 'as', 'a', 'key', 'contributing', 'factor', 'across', 'all', 'cuisines', 'thus', 'we', 'provide', 'a', 'framework', 'for', 'datadriven', 'investigations', 'of', 'culinary', 'patterns', 'in', 'recipes', 'which', 'can', 'be', 'leveraged', 'for', 'applications', 'aimed', 'at', 'food', 'design', 'generating', 'novel', 'flavor', 'pairings', 'and', 'tweaking', 'recipes', 'for', 'better', 'nutrition', 'and', 'health']]
|
[-0.026072243097479696, 0.06091495753714332, -0.12303651535745572, 0.11084463759756613, -0.09076909726071689, -0.13051445632138187, 0.11625445378012955, 0.3948548147799792, -0.20757978310187658, -0.3398733590091406, 0.06640497397726264, -0.23269275516547538, -0.1415986520514168, 0.2194420967647737, -0.06790480486772678, -0.0009541784482145751, 0.025878667693447183, -0.09249443607167686, -0.04760990425668381, -0.21455873688682914, 0.314651284204727, 0.029883995776375134, 0.3438865960955068, 0.038837950976772444, 0.04852236119547376, -0.030075146902904467, -0.12487799931421048, -0.02795724733905108, -0.14147202290111668, 0.169468749680662, 0.3403982940388636, 0.2411580310617056, 0.23860269687483432, -0.4520435982832202, -0.2207867114752945, 0.054069132854541145, 0.14804354771212846, 0.11020987579788737, -0.09780276077282098, -0.27176690213382243, 0.04331200109725749, -0.17746414947668435, -0.12756734175124654, -0.1700502758121325, -0.040760834377121045, -0.0017439109902759944, -0.2790584531427292, 0.058647516714753926, 0.017291127752374718, 0.14098492470328455, -0.055912767036783474, -0.19166735442769195, -0.012523948647840708, 0.21468325560671037, 0.0476162473567658, -0.023109473450178348, 0.13803639153915423, -0.15438223452031336, -0.15445843489530187, 0.41262215343993847, -0.012516130053403752, -0.12007351220085251, 0.21595477949638195, -0.08110270279770096, -0.17853018726498165, 0.07412243561681223, 0.21490355440656897, 0.03938213876552052, -0.22489325766391294, 0.029601587260279942, -0.014959210980062683, 0.16083976158665286, 0.0560339271060743, 0.052141898277181166, 0.28026696218660585, 0.2346178127280264, 0.018838164170652077, 0.0720333408003811, -0.014062803787075811, -0.09887295087488988, -0.23046192251904696, -0.12842701772158896, -0.06652647072052652, 0.0469492648417751, -0.1098688080799076, -0.12466654063146389, 0.43864074028614497, 0.15162544873784536, 0.16869516507894905, -0.004896043519989622, 0.2772140629451584, -0.021330595082017005, 0.1268666006245271, 0.03714134840087758, 0.11307994749535014, 0.02776474564646681, 0.14383885439278352, -0.1583723072298906, 0.1120042961427114, 0.021981595495405296]
|
1,803.04344
|
Rapid generation of Mott insulators from arrays of noncondensed atoms
|
We theoretically analyze a scheme for a fast adiabatic transfer of cold atoms
from the atomic limit of isolated traps to a Mott-insulator close to the
superfluid phase. This gives access to the Bose-Hubbard physics without the
need of a prior Bose-Einstein condensate. The initial state can be prepared by
combining the deterministic assembly of atomic arrays with resolved Raman
sideband cooling. In the subsequent transfer the trap depth is reduced
significantly. We derive conditions for the adiabaticity of this process and
calculate optimal adiabatic ramp shapes. Using available experimental
parameters, we estimate the impact of heating due to photon scattering and
compute the fidelity of the transfer scheme. Finally, we discuss the particle
number scaling behavior of the method for preparing low-entropy states. Our
findings demonstrate the feasibility of the proposed scheme with
state-of-the-art technology.
|
cond-mat.quant-gas
|
we theoretically analyze a scheme for a fast adiabatic transfer of cold atoms from the atomic limit of isolated traps to a mottinsulator close to the superfluid phase this gives access to the bosehubbard physics without the need of a prior boseeinstein condensate the initial state can be prepared by combining the deterministic assembly of atomic arrays with resolved raman sideband cooling in the subsequent transfer the trap depth is reduced significantly we derive conditions for the adiabaticity of this process and calculate optimal adiabatic ramp shapes using available experimental parameters we estimate the impact of heating due to photon scattering and compute the fidelity of the transfer scheme finally we discuss the particle number scaling behavior of the method for preparing lowentropy states our findings demonstrate the feasibility of the proposed scheme with stateoftheart technology
|
[['we', 'theoretically', 'analyze', 'a', 'scheme', 'for', 'a', 'fast', 'adiabatic', 'transfer', 'of', 'cold', 'atoms', 'from', 'the', 'atomic', 'limit', 'of', 'isolated', 'traps', 'to', 'a', 'mottinsulator', 'close', 'to', 'the', 'superfluid', 'phase', 'this', 'gives', 'access', 'to', 'the', 'bosehubbard', 'physics', 'without', 'the', 'need', 'of', 'a', 'prior', 'boseeinstein', 'condensate', 'the', 'initial', 'state', 'can', 'be', 'prepared', 'by', 'combining', 'the', 'deterministic', 'assembly', 'of', 'atomic', 'arrays', 'with', 'resolved', 'raman', 'sideband', 'cooling', 'in', 'the', 'subsequent', 'transfer', 'the', 'trap', 'depth', 'is', 'reduced', 'significantly', 'we', 'derive', 'conditions', 'for', 'the', 'adiabaticity', 'of', 'this', 'process', 'and', 'calculate', 'optimal', 'adiabatic', 'ramp', 'shapes', 'using', 'available', 'experimental', 'parameters', 'we', 'estimate', 'the', 'impact', 'of', 'heating', 'due', 'to', 'photon', 'scattering', 'and', 'compute', 'the', 'fidelity', 'of', 'the', 'transfer', 'scheme', 'finally', 'we', 'discuss', 'the', 'particle', 'number', 'scaling', 'behavior', 'of', 'the', 'method', 'for', 'preparing', 'lowentropy', 'states', 'our', 'findings', 'demonstrate', 'the', 'feasibility', 'of', 'the', 'proposed', 'scheme', 'with', 'stateoftheart', 'technology']]
|
[-0.10208663403446895, 0.16802846794256338, -0.08847581779221347, 0.029450549926891386, 0.024563219285268775, -0.1403266017270439, 0.11502874727525256, 0.3876430613865309, -0.2584856332413277, -0.29806737478493767, 0.0533782755228458, -0.2180033532957382, -0.05107535743231625, 0.2076521399032893, 0.006939792682019556, 0.10430314452241873, 0.07727750130887966, -0.04758505318450796, -0.08435887841316049, -0.23406023224849967, 0.31197368726647895, 0.07734209869180203, 0.3169136530281428, 0.06428839104345944, 0.08782679279444411, 0.0012977945734746754, 0.02513750923304435, -0.06141805723617675, -0.16742706725113643, 0.10687271442550221, 0.20636103801285466, 0.07023040981798925, 0.22663074876661138, -0.4581636923830956, -0.2113245426707555, 0.08621582992525552, 0.15791677287094952, 0.2230106354554129, -0.07634981541538283, -0.27522799882161264, -0.011586764087790953, -0.19653145468328148, -0.15014666548556896, -0.11560261056429762, -0.020496047909974176, 0.033014081314510856, -0.29645629037815313, 0.06688904291128411, 0.03551528668065336, 0.011698190633015818, -0.06918036671156776, -0.03545304960126112, 0.025987652839188847, 0.09607749236473705, -0.06204533337650526, -0.0013761914074968767, 0.1846286649678779, -0.13978578725800617, -0.09261889191453948, 0.3704514326288036, -0.09090749340633492, -0.12175702835734495, 0.17906751322323758, -0.12941358397502506, -0.029250887256827864, 0.14511294494492605, 0.13882803848965147, 0.08381799256141462, -0.10870301975206959, 0.028716144750968155, -0.0049284795737441845, 0.18192945006440447, 0.06141218766980969, 0.04757782182252199, 0.2002437801865573, 0.19256760756594732, 0.03751966804745333, 0.212608561720117, -0.14349455869866207, -0.10340587450841934, -0.2578854142270489, -0.1445759500732974, -0.23038541857728406, 0.04052492645603385, -0.04747135831049116, -0.12360216795658584, 0.3803580124113336, 0.20546363510862542, 0.2083349121042856, 0.002611001953482628, 0.3505563905243488, 0.13810424376981031, 0.017961272297029877, 0.05300012300037505, 0.26862497857141804, 0.1370608656656901, 0.10481652179185082, -0.3487026358189349, 0.02755711047896458, 0.04249189016820096]
|
1,803.04345
|
Sparse 3D Topological Graphs for Micro-Aerial Vehicle Planning
|
Micro-Aerial Vehicles (MAVs) have the advantage of moving freely in 3D space.
However, creating compact and sparse map representations that can be
efficiently used for planning for such robots is still an open problem. In this
paper, we take maps built from noisy sensor data and construct a sparse graph
containing topological information that can be used for 3D planning. We use a
Euclidean Signed Distance Field, extract a 3D Generalized Voronoi Diagram
(GVD), and obtain a thin skeleton diagram representing the topological
structure of the environment. We then convert this skeleton diagram into a
sparse graph, which we show is resistant to noise and changes in resolution. We
demonstrate global planning over this graph, and the orders of magnitude
speed-up it offers over other common planning methods. We validate our planning
algorithm in real maps built onboard an MAV, using RGB-D sensing.
|
cs.RO
|
microaerial vehicles mavs have the advantage of moving freely in 3d space however creating compact and sparse map representations that can be efficiently used for planning for such robots is still an open problem in this paper we take maps built from noisy sensor data and construct a sparse graph containing topological information that can be used for 3d planning we use a euclidean signed distance field extract a 3d generalized voronoi diagram gvd and obtain a thin skeleton diagram representing the topological structure of the environment we then convert this skeleton diagram into a sparse graph which we show is resistant to noise and changes in resolution we demonstrate global planning over this graph and the orders of magnitude speedup it offers over other common planning methods we validate our planning algorithm in real maps built onboard an mav using rgbd sensing
|
[['microaerial', 'vehicles', 'mavs', 'have', 'the', 'advantage', 'of', 'moving', 'freely', 'in', '3d', 'space', 'however', 'creating', 'compact', 'and', 'sparse', 'map', 'representations', 'that', 'can', 'be', 'efficiently', 'used', 'for', 'planning', 'for', 'such', 'robots', 'is', 'still', 'an', 'open', 'problem', 'in', 'this', 'paper', 'we', 'take', 'maps', 'built', 'from', 'noisy', 'sensor', 'data', 'and', 'construct', 'a', 'sparse', 'graph', 'containing', 'topological', 'information', 'that', 'can', 'be', 'used', 'for', '3d', 'planning', 'we', 'use', 'a', 'euclidean', 'signed', 'distance', 'field', 'extract', 'a', '3d', 'generalized', 'voronoi', 'diagram', 'gvd', 'and', 'obtain', 'a', 'thin', 'skeleton', 'diagram', 'representing', 'the', 'topological', 'structure', 'of', 'the', 'environment', 'we', 'then', 'convert', 'this', 'skeleton', 'diagram', 'into', 'a', 'sparse', 'graph', 'which', 'we', 'show', 'is', 'resistant', 'to', 'noise', 'and', 'changes', 'in', 'resolution', 'we', 'demonstrate', 'global', 'planning', 'over', 'this', 'graph', 'and', 'the', 'orders', 'of', 'magnitude', 'speedup', 'it', 'offers', 'over', 'other', 'common', 'planning', 'methods', 'we', 'validate', 'our', 'planning', 'algorithm', 'in', 'real', 'maps', 'built', 'onboard', 'an', 'mav', 'using', 'rgbd', 'sensing']]
|
[-0.08565079834852758, 0.0584006039183538, -0.1038614641354009, 0.03310259308021229, -0.12056692569008605, -0.09257220342377578, 0.005281549078775439, 0.46448793836667407, -0.31975550699484095, -0.30201015843508333, 0.1137946899345314, -0.2533900908901115, -0.19601562735461792, 0.20821937784500472, -0.14694689604017389, 0.042016646222348186, 0.11887927335797699, 0.02820906146279686, -0.04650172346981464, -0.2153379102040105, 0.26478441738217445, -0.038358997922371164, 0.26245322668521137, -0.016425366986419197, 0.16909208270261988, 0.03765832460517962, -0.02315257077750105, 0.09406779415338053, -0.10451857691479707, 0.15283645130454773, 0.30161356202235534, 0.16552166304700858, 0.2147657547041878, -0.45196635760627424, -0.23181954370746455, 0.13112946690493296, 0.15868191671772644, 0.08864931261632591, -0.04719780421965606, -0.35245411749115096, 0.09135017177363584, -0.16573298660471672, -0.0625462911931889, -0.12584102178526507, 0.0012216975861977968, -0.021868636399357728, -0.290357859906988, -0.03744768128906201, -0.00043000628474865345, 0.07733527514953296, -0.06483229053030898, -0.03847739512387376, 0.016070167547078816, 0.2242704537402142, -0.08239441789960215, 0.09667184857986998, 0.1302795102266217, -0.12741847894760175, -0.1348917557389013, 0.40131641924381256, -0.023159219031840875, -0.21479066120708115, 0.15636887855280737, -0.0793739171711715, -0.14621325983125324, 0.14526526577171536, 0.22175748199484982, 0.1158924833065472, -0.1517233929594399, 0.08070273805935574, -0.0538930865330296, 0.1562959788337845, 0.054575347447429194, -0.016281258646997955, 0.17981825726777576, 0.23163982857201065, 0.1466089010635925, 0.172704772739199, -0.13172487477272085, -0.06532111268171428, -0.20273048073131514, -0.16517380437442472, -0.2000215711199086, -0.001588249810274456, -0.1412426594450827, -0.191381216185962, 0.38792716361048235, 0.2257325400018713, 0.1853875749568631, 0.05352301670033224, 0.36672303356699176, 0.04448409481022924, 0.07035660437939988, 0.12788422944975067, 0.14057886799784391, 0.04835209588461614, 0.08555610741700707, -0.14870276894270593, 0.023906175670754554, 0.08117519921486403]
|
1,803.04346
|
A second-order, discretely well-balanced finite volume scheme for Euler
equations with gravity
|
We present a well-balanced, second order, Godunov-type finite volume scheme
for compressible Euler equations with gravity. By construction, the scheme
admits a discrete stationary solution which is a second order accurate
approximation to the exact stationary solution. Such a scheme is useful for
problems involving complex equations of state and/or hydrostatic solutions
which are not known in closed form expression. No \'a priori knowledge of the
hydrostatic solution is required to achieve the well-balanced property. The
performance of the scheme is demonstrated on several test cases in terms of
preservation of hydrostatic solution and computation of small perturbations
around a hydrostatic solution.
|
math.NA cs.CE cs.NA physics.comp-ph
|
we present a wellbalanced second order godunovtype finite volume scheme for compressible euler equations with gravity by construction the scheme admits a discrete stationary solution which is a second order accurate approximation to the exact stationary solution such a scheme is useful for problems involving complex equations of state andor hydrostatic solutions which are not known in closed form expression no a priori knowledge of the hydrostatic solution is required to achieve the wellbalanced property the performance of the scheme is demonstrated on several test cases in terms of preservation of hydrostatic solution and computation of small perturbations around a hydrostatic solution
|
[['we', 'present', 'a', 'wellbalanced', 'second', 'order', 'godunovtype', 'finite', 'volume', 'scheme', 'for', 'compressible', 'euler', 'equations', 'with', 'gravity', 'by', 'construction', 'the', 'scheme', 'admits', 'a', 'discrete', 'stationary', 'solution', 'which', 'is', 'a', 'second', 'order', 'accurate', 'approximation', 'to', 'the', 'exact', 'stationary', 'solution', 'such', 'a', 'scheme', 'is', 'useful', 'for', 'problems', 'involving', 'complex', 'equations', 'of', 'state', 'andor', 'hydrostatic', 'solutions', 'which', 'are', 'not', 'known', 'in', 'closed', 'form', 'expression', 'no', 'a', 'priori', 'knowledge', 'of', 'the', 'hydrostatic', 'solution', 'is', 'required', 'to', 'achieve', 'the', 'wellbalanced', 'property', 'the', 'performance', 'of', 'the', 'scheme', 'is', 'demonstrated', 'on', 'several', 'test', 'cases', 'in', 'terms', 'of', 'preservation', 'of', 'hydrostatic', 'solution', 'and', 'computation', 'of', 'small', 'perturbations', 'around', 'a', 'hydrostatic', 'solution']]
|
[-0.17597869505156197, -0.003234686713446589, -0.08806842142789095, 0.05867438946448851, -0.07934202608999376, -0.12180366450190253, 0.041493768828884496, 0.2968747911098249, -0.2367883623422434, -0.28803872415686355, 0.1556632468150472, -0.22107844235256827, -0.0925367704053939, 0.18143949360020606, -0.03297400796373932, 0.14285906386908656, 0.07238355732532036, 0.04788463686903318, -0.11048805664576516, -0.24028657114261068, 0.32837212096224083, 0.00012757783691745762, 0.2906943608678001, 0.022453503098850157, 0.18746422765338244, -0.11724120495366115, 0.015221789052399496, 0.060400694808545353, -0.13430286291073643, 0.06088536860896092, 0.2389998891961238, 0.07725688435283362, 0.29934002972189705, -0.4075608490874954, -0.2223165216190882, 0.07353221250848625, 0.10732631034482562, 0.16767667083060553, -0.08978253175212327, -0.23321967256967635, 0.15463970575079905, -0.17734471246527106, -0.2003324515615389, -0.15822286565112426, -0.018893328582064484, 0.025195198261416425, -0.3325917712896697, 0.10701146419616599, 0.08264137026294609, -0.009908512919483817, -0.13226433432953177, -0.046278188571187796, 0.017554866286980754, 0.07670902017065707, 0.01352321724498681, 0.014194815337438793, 0.04307495352958201, -0.12089990445540524, -0.033796872972172924, 0.4641728920259458, -0.0865434317543701, -0.31148810880076067, 0.15106031519141705, -0.08984974383686979, -0.09534840504456238, 0.20087901695960148, 0.15224239658838248, 0.1928874676745823, -0.14573117485269904, 0.10075118560195609, -0.054063126629711515, 0.18790968525333002, 0.07989600422682569, -0.024867320959410612, 0.12468430966677546, 0.14659825635745244, 0.13623100885660297, 0.12016336857421123, -0.0247742394384855, -0.15735169435056912, -0.3246280650571719, -0.17396383054851777, -0.158357599375806, 0.058788603548486675, -0.10016833620551659, -0.24236743440668956, 0.3363538650348132, 0.09459703868510676, 0.07432794966278415, 0.06900760827029087, 0.347088113974999, 0.16851516196266839, -0.0026820252749922813, 0.12391527003024284, 0.1873919876456699, 0.16031363674932542, 0.09434173024469512, -0.21492229487037048, 0.07540040082462571, 0.17127904341574393]
|
1,803.04347
|
Classifying Online Dating Profiles on Tinder using FaceNet Facial
Embeddings
|
A method to produce personalized classification models to automatically
review online dating profiles on Tinder is proposed, based on the user's
historical preference. The method takes advantage of a FaceNet facial
classification model to extract features which may be related to facial
attractiveness. The embeddings from a FaceNet model were used as the features
to describe an individual's face. A user reviewed 8,545 online dating profiles.
For each reviewed online dating profile, a feature set was constructed from the
profile images which contained just one face. Two approaches are presented to
go from the set of features for each face, to a set of profile features. A
simple logistic regression trained on the embeddings from just 20 profiles
could obtain a 65% validation accuracy. A point of diminishing marginal returns
was identified to occur around 80 profiles, at which the model accuracy of 73%
would only improve marginally after reviewing a significant number of
additional profiles.
|
cs.CV cs.SI eess.IV stat.ML
|
a method to produce personalized classification models to automatically review online dating profiles on tinder is proposed based on the users historical preference the method takes advantage of a facenet facial classification model to extract features which may be related to facial attractiveness the embeddings from a facenet model were used as the features to describe an individuals face a user reviewed 8545 online dating profiles for each reviewed online dating profile a feature set was constructed from the profile images which contained just one face two approaches are presented to go from the set of features for each face to a set of profile features a simple logistic regression trained on the embeddings from just 20 profiles could obtain a 65 validation accuracy a point of diminishing marginal returns was identified to occur around 80 profiles at which the model accuracy of 73 would only improve marginally after reviewing a significant number of additional profiles
|
[['a', 'method', 'to', 'produce', 'personalized', 'classification', 'models', 'to', 'automatically', 'review', 'online', 'dating', 'profiles', 'on', 'tinder', 'is', 'proposed', 'based', 'on', 'the', 'users', 'historical', 'preference', 'the', 'method', 'takes', 'advantage', 'of', 'a', 'facenet', 'facial', 'classification', 'model', 'to', 'extract', 'features', 'which', 'may', 'be', 'related', 'to', 'facial', 'attractiveness', 'the', 'embeddings', 'from', 'a', 'facenet', 'model', 'were', 'used', 'as', 'the', 'features', 'to', 'describe', 'an', 'individuals', 'face', 'a', 'user', 'reviewed', '8545', 'online', 'dating', 'profiles', 'for', 'each', 'reviewed', 'online', 'dating', 'profile', 'a', 'feature', 'set', 'was', 'constructed', 'from', 'the', 'profile', 'images', 'which', 'contained', 'just', 'one', 'face', 'two', 'approaches', 'are', 'presented', 'to', 'go', 'from', 'the', 'set', 'of', 'features', 'for', 'each', 'face', 'to', 'a', 'set', 'of', 'profile', 'features', 'a', 'simple', 'logistic', 'regression', 'trained', 'on', 'the', 'embeddings', 'from', 'just', '20', 'profiles', 'could', 'obtain', 'a', '65', 'validation', 'accuracy', 'a', 'point', 'of', 'diminishing', 'marginal', 'returns', 'was', 'identified', 'to', 'occur', 'around', '80', 'profiles', 'at', 'which', 'the', 'model', 'accuracy', 'of', '73', 'would', 'only', 'improve', 'marginally', 'after', 'reviewing', 'a', 'significant', 'number', 'of', 'additional', 'profiles']]
|
[0.0038326343401305137, -0.04208240704676662, -0.10251968886042315, 0.08552893764985305, -0.10755224290394014, -0.20816231727479928, 0.07088387733806045, 0.3884498769597661, -0.24632551023856766, -0.3320362823538392, 0.10741150363708936, -0.3683417052270905, -0.11621658623278622, 0.1866844974022599, -0.10047127873666825, 0.022775911714040465, 0.09023796081948544, 0.09975363915906318, -0.050711911175054525, -0.3016606106392799, 0.2505050419018634, 0.04375998681831744, 0.30232131347781227, 0.020007596888969983, 0.11283514375287679, -0.030594765239455285, -0.06864610266451153, 0.015238636792186767, -0.06930484828884684, 0.14544048821966674, 0.26815019429676823, 0.20620347789879287, 0.2920348011978692, -0.36534831338907564, -0.22105521074225826, 0.0597725260822523, 0.129456683321886, 0.13361358777244364, -0.043058776788623826, -0.3375468763673017, 0.08517899366035576, -0.16585738484056728, -0.06499329670783012, -0.07113682408967326, 0.011357887645792817, -0.013026568987557004, -0.26957208939692784, 0.04016302154970265, 0.01826137592415175, 0.1044543451719707, -0.0811149719531738, -0.14175662647091572, -0.03170090617401706, 0.16464688067414587, 0.041016956351907746, 0.02637968100907822, 0.17767976347897801, -0.15981861480301426, -0.09834445356466477, 0.3867161201853906, -0.06810166772094466, -0.1659393270530047, 0.18136289595746466, -0.0356875084550871, -0.12246183673851192, 0.16448281999196737, 0.23537708259217682, 0.07525648241336907, -0.1804670838398799, -0.05580960274073145, -0.05847252585264223, 0.21457407573151643, 0.07447946802037017, -0.08071932221552537, 0.23187744265737673, 0.15018718882403786, 0.0022342834741838516, 0.10733512763099204, -0.15112458412956087, -0.04310570903603108, -0.2221798835322261, -0.09016923423435899, -0.13452813196213795, -0.006593892881796966, -0.09930651502142991, -0.1677952854909123, 0.4705062226903054, 0.17492571830103595, 0.2649208284073299, 0.08057209242721118, 0.2740505941873116, 0.04733104795966703, 0.11100024837519853, 0.06090147547393797, 0.17630508122665267, 0.013407192717216188, 0.1068399321408041, -0.11649063070672715, 0.1253169853165145, 0.08342433071004286]
|
1,803.04348
|
Focused ion beam direct writing of magnetic patterns with controlled
structural and magnetic properties
|
Focused ion beam irradiation of metastable Fe$_{78}$Ni$_{22}$ thin films
grown on Cu(100) substrates is used to create ferromagnetic,
body-centered-cubic patterns embedded into paramagnetic, face-centered-cubic
surrounding. The structural and magnetic phase transformation can be controlled
by varying parameters of the transforming gallium ion beam. The focused ion
beam parameters as ion dose, number of scans, and scanning direction can be
used not only to control a degree of transformation, but also to change the
otherwise four-fold in-plane magnetic anisotropy into the uniaxial anisotropy
along specific crystallographic direction. This change is associated with a
preferred growth of specific crystallographic domains. The possibility to
create magnetic patterns with continuous magnetization transitions and at the
same time to create patterns with periodical changes in magnetic anisotropy
makes this system an ideal candidate for rapid prototyping of a large variety
of nanostructured samples. Namely spin-wave waveguides and magnonic crystals
can be easily combined into complex devices in a single fabrication step.
|
physics.app-ph cond-mat.mes-hall
|
focused ion beam irradiation of metastable fe_78ni_22 thin films grown on cu100 substrates is used to create ferromagnetic bodycenteredcubic patterns embedded into paramagnetic facecenteredcubic surrounding the structural and magnetic phase transformation can be controlled by varying parameters of the transforming gallium ion beam the focused ion beam parameters as ion dose number of scans and scanning direction can be used not only to control a degree of transformation but also to change the otherwise fourfold inplane magnetic anisotropy into the uniaxial anisotropy along specific crystallographic direction this change is associated with a preferred growth of specific crystallographic domains the possibility to create magnetic patterns with continuous magnetization transitions and at the same time to create patterns with periodical changes in magnetic anisotropy makes this system an ideal candidate for rapid prototyping of a large variety of nanostructured samples namely spinwave waveguides and magnonic crystals can be easily combined into complex devices in a single fabrication step
|
[['focused', 'ion', 'beam', 'irradiation', 'of', 'metastable', 'fe_78ni_22', 'thin', 'films', 'grown', 'on', 'cu100', 'substrates', 'is', 'used', 'to', 'create', 'ferromagnetic', 'bodycenteredcubic', 'patterns', 'embedded', 'into', 'paramagnetic', 'facecenteredcubic', 'surrounding', 'the', 'structural', 'and', 'magnetic', 'phase', 'transformation', 'can', 'be', 'controlled', 'by', 'varying', 'parameters', 'of', 'the', 'transforming', 'gallium', 'ion', 'beam', 'the', 'focused', 'ion', 'beam', 'parameters', 'as', 'ion', 'dose', 'number', 'of', 'scans', 'and', 'scanning', 'direction', 'can', 'be', 'used', 'not', 'only', 'to', 'control', 'a', 'degree', 'of', 'transformation', 'but', 'also', 'to', 'change', 'the', 'otherwise', 'fourfold', 'inplane', 'magnetic', 'anisotropy', 'into', 'the', 'uniaxial', 'anisotropy', 'along', 'specific', 'crystallographic', 'direction', 'this', 'change', 'is', 'associated', 'with', 'a', 'preferred', 'growth', 'of', 'specific', 'crystallographic', 'domains', 'the', 'possibility', 'to', 'create', 'magnetic', 'patterns', 'with', 'continuous', 'magnetization', 'transitions', 'and', 'at', 'the', 'same', 'time', 'to', 'create', 'patterns', 'with', 'periodical', 'changes', 'in', 'magnetic', 'anisotropy', 'makes', 'this', 'system', 'an', 'ideal', 'candidate', 'for', 'rapid', 'prototyping', 'of', 'a', 'large', 'variety', 'of', 'nanostructured', 'samples', 'namely', 'spinwave', 'waveguides', 'and', 'magnonic', 'crystals', 'can', 'be', 'easily', 'combined', 'into', 'complex', 'devices', 'in', 'a', 'single', 'fabrication', 'step']]
|
[-0.1337772067200633, 0.24666234153677755, -0.03201318608236409, -0.055031147923681044, -0.11092307237727989, -0.17963688426440763, 0.022538929090144173, 0.49015655954698883, -0.31600655728290156, -0.320637687067351, 0.03517328401456677, -0.25757130922856664, -0.015614753254433913, 0.21351968429441895, 0.0257959027504248, 0.049151101413994064, -0.012850822264989537, -0.0885204715699318, -0.08536185276123785, -0.1838093606413402, 0.23324695196783832, 0.04836956301643964, 0.37265879883761366, 0.04140854371005609, 0.06295794278473384, 0.025028558909111927, 0.13088731348754898, 0.049798447194118654, -0.13059104060333582, 0.06276928232349042, 0.24512626103936663, -0.04355057165807774, 0.16685115272750056, -0.5134339039844852, -0.22193629600468182, 0.03172272628533744, 0.16841225515029604, 0.15716502400896243, -0.1085982984675455, -0.25929045157747405, 0.0470382678412622, -0.06830391905715524, -0.1436890823029605, -0.09232241533576481, -0.03650217381035609, 0.03807205956677095, -0.2676356597011158, 0.024105239075171054, 0.04611524796533969, 0.1363930567197742, -0.0780600350122005, -0.06272741467166211, -0.10128415615087555, 0.03927799180871056, 0.04806178088089631, 0.09795569939719093, 0.24268019621245443, -0.07206047412548815, -0.09209807036865142, 0.36828940887785244, -0.004360405581011887, -0.15340141080950778, 0.12574181674318688, -0.18196593911927794, -0.0868520429658313, 0.19496116675887137, 0.1940862787436814, 0.09665603566494199, -0.14749301139325385, 0.002141938095671996, 0.04657162202432031, 0.24270005198392733, 0.12148513769009901, 0.0003020607475792208, 0.25356708506362574, 0.20074183388628186, 0.03736189404021829, 0.1913788833576555, -0.11873196278315698, 0.006250788719062843, -0.19148835208146803, -0.1915174326784308, -0.17834668995572195, 0.04265894044027288, -0.0928104959649875, -0.20700219559873784, 0.4258866190309486, 0.08982782935622269, 0.16214849934763004, -0.13114236435372262, 0.2445208675100378, 0.03497822469686188, 0.11386729066650714, -0.032593418234178134, 0.19163369279835493, 0.14207261476755864, 0.1439421295865266, -0.25469915456168596, 0.13622204475705663, -0.05099304733016798]
|
1,803.04349
|
Linking ImageNet WordNet Synsets with Wikidata
|
The linkage of ImageNet WordNet synsets to Wikidata items will leverage deep
learning algorithm with access to a rich multilingual knowledge graph. Here I
will describe our on-going efforts in linking the two resources and issues
faced in matching the Wikidata and WordNet knowledge graphs. I show an example
on how the linkage can be used in a deep learning setting with real-time image
classification and labeling in a non-English language and discuss what
opportunities lies ahead.
|
cs.DL cs.CL
|
the linkage of imagenet wordnet synsets to wikidata items will leverage deep learning algorithm with access to a rich multilingual knowledge graph here i will describe our ongoing efforts in linking the two resources and issues faced in matching the wikidata and wordnet knowledge graphs i show an example on how the linkage can be used in a deep learning setting with realtime image classification and labeling in a nonenglish language and discuss what opportunities lies ahead
|
[['the', 'linkage', 'of', 'imagenet', 'wordnet', 'synsets', 'to', 'wikidata', 'items', 'will', 'leverage', 'deep', 'learning', 'algorithm', 'with', 'access', 'to', 'a', 'rich', 'multilingual', 'knowledge', 'graph', 'here', 'i', 'will', 'describe', 'our', 'ongoing', 'efforts', 'in', 'linking', 'the', 'two', 'resources', 'and', 'issues', 'faced', 'in', 'matching', 'the', 'wikidata', 'and', 'wordnet', 'knowledge', 'graphs', 'i', 'show', 'an', 'example', 'on', 'how', 'the', 'linkage', 'can', 'be', 'used', 'in', 'a', 'deep', 'learning', 'setting', 'with', 'realtime', 'image', 'classification', 'and', 'labeling', 'in', 'a', 'nonenglish', 'language', 'and', 'discuss', 'what', 'opportunities', 'lies', 'ahead']]
|
[-0.03969183928853312, -0.009264995130618079, -0.03378921021501739, 0.11617219855996792, -0.22088149301223942, -0.13751374608716116, 0.09452889700021062, 0.47456071264558025, -0.31951379717944506, -0.35498205707831815, 0.06677369313169416, -0.339340015266139, -0.16298520979894834, 0.14123194575212994, -0.18827493621834687, 0.008777656858520848, 0.1739128545991012, 0.07830411784786295, -0.015220609596361975, -0.3061407319313163, 0.31717431404954427, 0.013964957541743801, 0.3157812856899744, 0.07413451417119472, 0.0758301284006954, -0.06674574678400894, -0.10115501347493816, -0.028403699518991757, -0.09849561095334493, 0.2299085310357925, 0.4254292966314144, 0.3047381657320861, 0.3429607454651072, -0.40398782840022796, -0.1399267307156092, 0.07847172100483985, 0.15381607914029002, 0.10791844957471862, -0.03507175850046968, -0.37501535260318114, 0.03524988271181121, -0.2033251906539519, 0.025963233408893085, -0.1359033052894202, -0.00446579394886246, -0.004895822078521762, -0.23337744731401613, -0.07768062889188915, 0.09819308131352647, 0.09633157739919224, -0.020086694188270863, -0.10601431511753759, 0.0697159092335103, 0.2002978526454951, -0.01801629647515811, 0.08283070512962612, 0.10496554411222021, -0.2314882652362349, -0.24129821372206334, 0.3910815134983171, -0.03785625737547487, -0.16523114766006347, 0.19819957712157207, -0.021821233818863892, -0.2342212675139308, -0.0003846759194290483, 0.22886017749279544, 0.046273973643441095, -0.18153594967352782, 0.047756456131986404, -0.07073666327088685, 0.1989871130457946, 0.07529117965574872, -0.02833755255688901, 0.21743880902937093, 0.2902042499029791, 0.022456340413153558, 0.11011410484471443, -0.08260754982989232, -0.029635671054484784, -0.18513566178765584, -0.13156233956529337, -0.18697154178441344, -0.011265369785296452, -0.11967233321614346, -0.11462674846316313, 0.37003449353014495, 0.24521241992010506, 0.16592741133524225, 0.061423131282888836, 0.324332234619016, -0.08347562272797109, 0.12115668021626287, 0.1364340240909875, 0.10268088357595655, -0.005642931376184736, 0.161795947283458, -0.12263967793483238, 0.08309059162237137, 0.03124823047501313]
|
1,803.0435
|
Simultaneous nanopatterning and reduction of graphene oxide by
femtosecond laser pulses
|
This paper presents a novel one-step method for the periodical nanopatterning
and reduction of graphene oxide (GO). Self-organized periodic structures of
reduced graphene oxide (rGO) appear on GO surfaces upon processing with a
femtosecond laser at fluences slightly higher than the fluence needed for
reduction of the GO. This indicates that the periodic pattern is formed either
simultaneously with or due to the reduction of the GO. The laser-induced
reduction of GO was identified by sheet resistance measurements, Raman and
X-ray photoelectron spectroscopy. This fast and simple method to both reduce
and periodically structure GO offers a variety of possible applications in
printed and flexible electronics.
|
physics.app-ph nlin.PS
|
this paper presents a novel onestep method for the periodical nanopatterning and reduction of graphene oxide go selforganized periodic structures of reduced graphene oxide rgo appear on go surfaces upon processing with a femtosecond laser at fluences slightly higher than the fluence needed for reduction of the go this indicates that the periodic pattern is formed either simultaneously with or due to the reduction of the go the laserinduced reduction of go was identified by sheet resistance measurements raman and xray photoelectron spectroscopy this fast and simple method to both reduce and periodically structure go offers a variety of possible applications in printed and flexible electronics
|
[['this', 'paper', 'presents', 'a', 'novel', 'onestep', 'method', 'for', 'the', 'periodical', 'nanopatterning', 'and', 'reduction', 'of', 'graphene', 'oxide', 'go', 'selforganized', 'periodic', 'structures', 'of', 'reduced', 'graphene', 'oxide', 'rgo', 'appear', 'on', 'go', 'surfaces', 'upon', 'processing', 'with', 'a', 'femtosecond', 'laser', 'at', 'fluences', 'slightly', 'higher', 'than', 'the', 'fluence', 'needed', 'for', 'reduction', 'of', 'the', 'go', 'this', 'indicates', 'that', 'the', 'periodic', 'pattern', 'is', 'formed', 'either', 'simultaneously', 'with', 'or', 'due', 'to', 'the', 'reduction', 'of', 'the', 'go', 'the', 'laserinduced', 'reduction', 'of', 'go', 'was', 'identified', 'by', 'sheet', 'resistance', 'measurements', 'raman', 'and', 'xray', 'photoelectron', 'spectroscopy', 'this', 'fast', 'and', 'simple', 'method', 'to', 'both', 'reduce', 'and', 'periodically', 'structure', 'go', 'offers', 'a', 'variety', 'of', 'possible', 'applications', 'in', 'printed', 'and', 'flexible', 'electronics']]
|
[-0.07159762417036548, 0.14240461721454026, -0.05492307819900507, -0.023615819096723396, -0.023467445930571488, -0.1716308681434899, 0.10978247678755203, 0.42132806296477904, -0.28646266105461793, -0.3079118151041978, 0.0527033855784948, -0.2859380304741175, -0.1585675795224302, 0.2295074201395454, -0.04454328386411774, 0.04634081808968781, 0.03170943189465072, -0.09330086753141346, -0.0824998186199425, -0.2293703451967921, 0.20886651938781142, 0.08226176495400239, 0.34690518866134984, 0.04991402785856066, 0.06588719587142684, 0.023394018767471863, 0.01782125647548797, -0.014503905435426618, -0.11749932864267118, 0.14844645787566407, 0.2228053337015774, -0.010146209306768933, 0.240232811206161, -0.5312661885125738, -0.24713055047048432, -0.016371288486176503, 0.12913345249440028, 0.14246188410786245, -0.08084776809654322, -0.2165977879919393, 0.09687954001128674, -0.13209933986149305, -0.1478595295086292, -0.0755784050034324, -0.032127435406986274, -0.0027253622505462394, -0.193658059241606, 0.021534900927810737, 0.05821440135620816, 0.10234315810233073, -0.05486555694040122, -0.06432134054935063, -0.03452913917025621, 0.05034144315648965, 0.018616661932407262, 0.02811722139792763, 0.21276993732372262, -0.08265311614706901, -0.10615909662765433, 0.37514202755366294, -0.05896165357083895, -0.09782300507188511, 0.20804356846009503, -0.14131319403147571, -0.09045576205793417, 0.2353625527038327, 0.1312701180972651, 0.12567463521142755, -0.13751205462986552, 0.046499076241710804, 0.050786611685564496, 0.1937880352016468, 0.18674389204396954, 0.01978157283650395, 0.18013008960516122, 0.26731354373458877, 0.07822219017049614, 0.15481348223830485, -0.12863283022965813, 0.027571927006510174, -0.19354375445652963, -0.19505087021334133, -0.1267379783049999, 0.08731772456063344, -0.035495769968756065, -0.23024630443772898, 0.4097216079793519, 0.11965316676376563, 0.15828411658909522, -0.019557750581781257, 0.2952475158304398, 0.1255520042405411, 0.09684537829532516, -0.05478867517239502, 0.21280614977025972, 0.1140073633572649, 0.1404976496508099, -0.22026972304414608, 0.07210004243962378, -0.019242569599915646]
|
1,803.04351
|
idtracker.ai: Tracking all individuals in large collectives of unmarked
animals
|
Our understanding of collective animal behavior is limited by our ability to
track each of the individuals. We describe an algorithm and software,
idtracker.ai, that extracts from video all trajectories with correct identities
at a high accuracy for collectives of up to 100 individuals. It uses two deep
networks, one detecting when animals touch or cross and another one for animal
identification, trained adaptively to conditions and difficulty of the video.
|
cs.CV
|
our understanding of collective animal behavior is limited by our ability to track each of the individuals we describe an algorithm and software idtrackerai that extracts from video all trajectories with correct identities at a high accuracy for collectives of up to 100 individuals it uses two deep networks one detecting when animals touch or cross and another one for animal identification trained adaptively to conditions and difficulty of the video
|
[['our', 'understanding', 'of', 'collective', 'animal', 'behavior', 'is', 'limited', 'by', 'our', 'ability', 'to', 'track', 'each', 'of', 'the', 'individuals', 'we', 'describe', 'an', 'algorithm', 'and', 'software', 'idtrackerai', 'that', 'extracts', 'from', 'video', 'all', 'trajectories', 'with', 'correct', 'identities', 'at', 'a', 'high', 'accuracy', 'for', 'collectives', 'of', 'up', 'to', '100', 'individuals', 'it', 'uses', 'two', 'deep', 'networks', 'one', 'detecting', 'when', 'animals', 'touch', 'or', 'cross', 'and', 'another', 'one', 'for', 'animal', 'identification', 'trained', 'adaptively', 'to', 'conditions', 'and', 'difficulty', 'of', 'the', 'video']]
|
[-0.034940258280507154, 0.09631077310124446, -0.07940394847121622, 0.04828044831519947, -0.11799945771760706, -0.21178628838887173, 0.05036378972498434, 0.40031589502468706, -0.2573110650160483, -0.35004359858908823, 0.05226789996959269, -0.3214414156973362, -0.17578213982882776, 0.18443719597999006, -0.12294380738000785, 0.04560694135725498, 0.12076969950326852, 0.10583325520024768, 0.074704927721593, -0.29919922165572643, 0.26990409833711704, 0.028989856167546738, 0.304079378622451, 0.00953843454231641, 0.2102614727636267, 0.019040056484352266, -0.030778225105521934, -0.024561504713658776, -0.047586059301413894, 0.17649062416915381, 0.334055536453213, 0.18815487874006587, 0.34225209642733845, -0.4170370894617268, -0.1707242117662515, 0.07677769166018282, 0.15317122236426386, 0.13783357225890672, 0.01036904711675431, -0.3308919899298676, 0.1368822834853615, -0.13054717023457799, -0.10943654820189945, -0.11118027847592853, -0.004151500941121152, 0.028216956233206605, -0.23928640706996832, 0.014442637003958226, 0.027525630443623023, 0.08517409907653928, -0.055379878862627914, -0.06745583605287331, 0.003273719150040831, 0.2856828880783204, 0.08105768048803189, -0.007162268413230777, 0.1960296830495021, -0.20616549368548606, -0.12211544405935067, 0.37505637026915795, 0.0004992703175438302, -0.18820283996007806, 0.24837157701009085, -0.08573291793332569, -0.14984121073503048, 0.17090418563623513, 0.21001263263751752, 0.10251828315002577, -0.1861620861481892, -0.07547674502628589, -0.008071350386100157, 0.18583433526967252, 0.06527834442510669, -0.025061733814488563, 0.1800538759279464, 0.22156993650631712, 0.04565124691996191, 0.06667426024297518, -0.10480277772460665, -0.05138864823883133, -0.2071346072779436, -0.12081128669753005, -0.16001462177207162, -0.014498460785086665, -0.10845823720966499, -0.12628287180393402, 0.41794355371966957, 0.21005209467506836, 0.23005547381139227, 0.11903380301914045, 0.32685172657615374, -0.02282550965236234, 0.08356833857085023, 0.07466699397856635, 0.15110279831237028, -0.011435145681856999, 0.12090823925765497, -0.20745156497494982, 0.10912879724720759, 0.04450069460352617]
|
1,803.04352
|
Interacting polariton fluids in a monolayer of tungsten disulfide
|
Atomically thin transition metal dichalcogenides (TMDs) possess a number of
properties that make them attractive for realizing room-temperature polariton
devices. An ideal platform for manipulating polariton fluids within monolayer
TMDs is that of Bloch surface waves, which confine the electric field to a
small volume near the surface of a dielectric mirror. Here we demonstrate that
monolayer tungsten disulfide ($\text{WS}_2$) can sustain Bloch surface wave
polaritons (BSWPs) with a Rabi splitting of 43 meV and propagation constants
reaching 33 $\mu$m. In addition, we evidence strong polariton-polariton
nonlinearities within BSWPs, which manifest themselves as a reversible
blueshift of the lower polariton resonance by up to 12.9$\pm$0.5 meV. Such
nonlinearities are at the heart of polariton devices and have not yet been
demonstrated in TMD polaritons. As a proof of concept, we use the nonlinearity
to implement a nonlinear polariton source. Our results demonstrate that BSWPs
using TMDs can support long-range propagation combined with strong
nonlinearities, enabling potential applications in integrated optical
processing and polaritonic circuits.
|
cond-mat.quant-gas cond-mat.mes-hall
|
atomically thin transition metal dichalcogenides tmds possess a number of properties that make them attractive for realizing roomtemperature polariton devices an ideal platform for manipulating polariton fluids within monolayer tmds is that of bloch surface waves which confine the electric field to a small volume near the surface of a dielectric mirror here we demonstrate that monolayer tungsten disulfide textws_2 can sustain bloch surface wave polaritons bswps with a rabi splitting of 43 mev and propagation constants reaching 33 mum in addition we evidence strong polaritonpolariton nonlinearities within bswps which manifest themselves as a reversible blueshift of the lower polariton resonance by up to 129pm05 mev such nonlinearities are at the heart of polariton devices and have not yet been demonstrated in tmd polaritons as a proof of concept we use the nonlinearity to implement a nonlinear polariton source our results demonstrate that bswps using tmds can support longrange propagation combined with strong nonlinearities enabling potential applications in integrated optical processing and polaritonic circuits
|
[['atomically', 'thin', 'transition', 'metal', 'dichalcogenides', 'tmds', 'possess', 'a', 'number', 'of', 'properties', 'that', 'make', 'them', 'attractive', 'for', 'realizing', 'roomtemperature', 'polariton', 'devices', 'an', 'ideal', 'platform', 'for', 'manipulating', 'polariton', 'fluids', 'within', 'monolayer', 'tmds', 'is', 'that', 'of', 'bloch', 'surface', 'waves', 'which', 'confine', 'the', 'electric', 'field', 'to', 'a', 'small', 'volume', 'near', 'the', 'surface', 'of', 'a', 'dielectric', 'mirror', 'here', 'we', 'demonstrate', 'that', 'monolayer', 'tungsten', 'disulfide', 'textws_2', 'can', 'sustain', 'bloch', 'surface', 'wave', 'polaritons', 'bswps', 'with', 'a', 'rabi', 'splitting', 'of', '43', 'mev', 'and', 'propagation', 'constants', 'reaching', '33', 'mum', 'in', 'addition', 'we', 'evidence', 'strong', 'polaritonpolariton', 'nonlinearities', 'within', 'bswps', 'which', 'manifest', 'themselves', 'as', 'a', 'reversible', 'blueshift', 'of', 'the', 'lower', 'polariton', 'resonance', 'by', 'up', 'to', '129pm05', 'mev', 'such', 'nonlinearities', 'are', 'at', 'the', 'heart', 'of', 'polariton', 'devices', 'and', 'have', 'not', 'yet', 'been', 'demonstrated', 'in', 'tmd', 'polaritons', 'as', 'a', 'proof', 'of', 'concept', 'we', 'use', 'the', 'nonlinearity', 'to', 'implement', 'a', 'nonlinear', 'polariton', 'source', 'our', 'results', 'demonstrate', 'that', 'bswps', 'using', 'tmds', 'can', 'support', 'longrange', 'propagation', 'combined', 'with', 'strong', 'nonlinearities', 'enabling', 'potential', 'applications', 'in', 'integrated', 'optical', 'processing', 'and', 'polaritonic', 'circuits']]
|
[-0.13045809501609593, 0.19024096281681982, -0.034894173732746024, 0.003085245757024551, -0.08233855963565329, -0.1585586138707758, 0.0634220575469684, 0.48492457983256493, -0.2015877362156724, -0.24370948895438355, -0.027196675667648468, -0.28258579110519755, -0.16631069547140304, 0.25268446070854955, 0.060058912681271955, 0.0710477246960372, -0.012734674342712502, -0.13931070872364038, -0.019088527794214494, -0.15597524954473893, 0.24217203575082952, -0.019815401280482793, 0.34367671687972307, 0.16472875357341069, 0.09178324843423417, -0.03959311889542014, 0.1570635986511515, -0.03492047532496077, -0.12306454900546535, 0.1098587399141656, 0.28790811553775664, -0.09427659810422977, 0.2766763644126232, -0.47066148760280124, -0.24162735477273847, 0.004925782739092814, 0.16479395011319192, 0.20130001999765496, -0.1267092370752958, -0.30629638027411277, 0.030487824444095663, -0.12115482526779589, -0.1596171522775685, -0.1171037529682867, 0.01849848237592888, 0.025884013375796287, -0.2070701721107823, 0.03234918549783344, 0.062391025111234434, 0.03792179966874329, -0.03194497611458459, -0.0876077045744032, -0.09301601130268133, 0.028874949368153824, -0.03672181481616227, 0.02125939985925481, 0.16819177337212166, -0.16687758769811256, -0.12075015256054883, 0.37385871517615693, -0.11499805176446651, -0.10794334539591714, 0.1840682646021086, -0.1504676538533215, 0.017221418229495116, 0.17460373019868577, 0.21044718000008783, 0.08566363368263859, -0.13024465614400896, 0.05515532166715769, -0.004579525130400636, 0.19449205518366747, 0.13428405552447117, 0.1749397331567044, 0.27079338187144864, 0.20887819398769442, 0.03639783690838764, 0.1174557927117775, -0.07238398174376925, -0.00190137555523787, -0.2559053923152847, -0.21013875389011738, -0.22990282859227815, 0.10494712185880664, -0.0463477722826352, -0.2061740422504954, 0.39105962288140517, 0.10370352826322671, 0.15077818683521063, -0.004102098207955283, 0.2648615408372594, 0.12447528254433339, 0.1238366515421665, 0.04110946191221843, 0.32687485799837257, 0.17964738173400235, 0.09494232732012514, -0.23143368066478245, -0.002249923882500073, -0.020430884415457703]
|
1,803.04353
|
Partial Identifiability of Restricted Latent Class Models
|
Latent class models have wide applications in social and biological sciences.
In many applications, pre-specified restrictions are imposed on the parameter
space of latent class models, through a design matrix, to reflect
practitioners' assumptions about how the observed responses depend on subjects'
latent traits. Though widely used in various fields, such restricted latent
class models suffer from non-identifiability due to their discreteness nature
and complex structure of restrictions. This work addresses the fundamental
identifiability issue of restricted latent class models by developing a general
framework for strict and partial identifiability of the model parameters. Under
correct model specification, the developed identifiability conditions only
depend on the design matrix and are easily checkable, which provide useful
practical guidelines for designing statistically valid diagnostic tests.
Furthermore, the new theoretical framework is applied to establish, for the
first time, identifiability of several designs from cognitive diagnosis
applications.
|
math.ST stat.AP stat.TH
|
latent class models have wide applications in social and biological sciences in many applications prespecified restrictions are imposed on the parameter space of latent class models through a design matrix to reflect practitioners assumptions about how the observed responses depend on subjects latent traits though widely used in various fields such restricted latent class models suffer from nonidentifiability due to their discreteness nature and complex structure of restrictions this work addresses the fundamental identifiability issue of restricted latent class models by developing a general framework for strict and partial identifiability of the model parameters under correct model specification the developed identifiability conditions only depend on the design matrix and are easily checkable which provide useful practical guidelines for designing statistically valid diagnostic tests furthermore the new theoretical framework is applied to establish for the first time identifiability of several designs from cognitive diagnosis applications
|
[['latent', 'class', 'models', 'have', 'wide', 'applications', 'in', 'social', 'and', 'biological', 'sciences', 'in', 'many', 'applications', 'prespecified', 'restrictions', 'are', 'imposed', 'on', 'the', 'parameter', 'space', 'of', 'latent', 'class', 'models', 'through', 'a', 'design', 'matrix', 'to', 'reflect', 'practitioners', 'assumptions', 'about', 'how', 'the', 'observed', 'responses', 'depend', 'on', 'subjects', 'latent', 'traits', 'though', 'widely', 'used', 'in', 'various', 'fields', 'such', 'restricted', 'latent', 'class', 'models', 'suffer', 'from', 'nonidentifiability', 'due', 'to', 'their', 'discreteness', 'nature', 'and', 'complex', 'structure', 'of', 'restrictions', 'this', 'work', 'addresses', 'the', 'fundamental', 'identifiability', 'issue', 'of', 'restricted', 'latent', 'class', 'models', 'by', 'developing', 'a', 'general', 'framework', 'for', 'strict', 'and', 'partial', 'identifiability', 'of', 'the', 'model', 'parameters', 'under', 'correct', 'model', 'specification', 'the', 'developed', 'identifiability', 'conditions', 'only', 'depend', 'on', 'the', 'design', 'matrix', 'and', 'are', 'easily', 'checkable', 'which', 'provide', 'useful', 'practical', 'guidelines', 'for', 'designing', 'statistically', 'valid', 'diagnostic', 'tests', 'furthermore', 'the', 'new', 'theoretical', 'framework', 'is', 'applied', 'to', 'establish', 'for', 'the', 'first', 'time', 'identifiability', 'of', 'several', 'designs', 'from', 'cognitive', 'diagnosis', 'applications']]
|
[-0.04114915284440536, 0.062105570944064915, -0.03247708726363877, 0.11548875402917878, -0.18517305075753634, -0.20034419319320781, 0.055039068593436644, 0.38803003795651925, -0.28014352573275875, -0.32746195759520763, 0.13791443051902913, -0.1477118793312305, -0.20571474260133174, 0.2287778193228102, -0.10398299593362026, 0.12660904601216316, 0.07094583476686643, 0.005022690523320408, -0.054967889345587335, -0.24887535291782115, 0.33147148615939337, 0.030046379232468706, 0.35709981022713083, 0.02229047762254292, 0.0752304660790186, -9.737573337689455e-05, -0.039990362523692764, 0.010025861507933264, -0.15125824639108032, 0.13549566859081905, 0.3385318128773886, 0.22007491251537836, 0.34418270911717425, -0.4281304709270949, -0.3076873776800413, 0.13574468264899528, 0.059247862844333414, 0.059298732252500486, -0.02119036818152785, -0.29979163915979573, 0.05120444134809077, -0.12523872625832963, -0.06862391773999359, -0.14054982950923053, -0.04055495095963124, 0.008483008926203992, -0.302090465911331, 0.06832420200549273, 0.07679372165593021, 0.10342243363104192, -0.07993824587255302, -0.15152906898664595, 0.03988370964442664, 0.15244805274738205, 0.06722144014202058, -0.0701457154460109, 0.12910266994408126, -0.14950451446444882, -0.09682447992963716, 0.39695782642552835, 0.04502669300280912, -0.27239882639454055, 0.2098083372693509, -0.042337179439426914, -0.24347760171319047, 0.09078523460064186, 0.2584089946984831, 0.08703122006975011, -0.1913968699757081, 0.10860616905200812, -0.031061505895599514, 0.1608071390203097, 0.02498149426537566, 0.037281355647994334, 0.1822692577043199, 0.16155932447226304, 0.030697184572394082, 0.09409875942381202, -0.015376091499799967, -0.1042552625747501, -0.2864974882169109, -0.08804622231723948, -0.13919038258285987, -0.004040165851216039, -0.12170881895932932, -0.17851621775318766, 0.4166653172934376, 0.2359852574300021, 0.14925805929427347, 0.04616639078772601, 0.2340224476906264, 0.055523391884182476, 0.04835264315463266, 0.0386913217662368, 0.16483773037260915, 0.14953289431448663, 0.07572492432599473, -0.13579442469118577, 0.19981645765882503, -0.011123933852003474]
|
1,803.04354
|
Topical Community Detection in Event-based Social Network
|
Event-based services have recently witnessed a rapid growth driving the way
people explore and share information of interest. They host a huge amount of
users' activities including explicit RSVP, shared photos, comments and social
connections. Exploiting these activities to detect communities of similar users
is a challenging problem. In reality, a community in event-based social network
(ESBN) is a group of users not only sharing common events and friends, but also
having similar topical interests. However, such community could not be detected
by most of existing methods which mainly draw on link analysis in the network.
To address this problem, there is a need to capitalize on the semantics of
shared objects along with the structural properties, and to generate
overlapping communities rather than disjoint ones. In this paper, we propose to
leverage the users' activities around events with the aim to detect communities
based on topical clustering and link analysis that maximize a new form of
semantic modularity. We particularly highlight the difference between online
and offline social interactions, and the influence of event categories to
detect communities. Experimental results on real datasets showed that our
approach was able to detect semantically meaningful communities compared with
existing state of the art methods.
|
cs.SI cs.DS
|
eventbased services have recently witnessed a rapid growth driving the way people explore and share information of interest they host a huge amount of users activities including explicit rsvp shared photos comments and social connections exploiting these activities to detect communities of similar users is a challenging problem in reality a community in eventbased social network esbn is a group of users not only sharing common events and friends but also having similar topical interests however such community could not be detected by most of existing methods which mainly draw on link analysis in the network to address this problem there is a need to capitalize on the semantics of shared objects along with the structural properties and to generate overlapping communities rather than disjoint ones in this paper we propose to leverage the users activities around events with the aim to detect communities based on topical clustering and link analysis that maximize a new form of semantic modularity we particularly highlight the difference between online and offline social interactions and the influence of event categories to detect communities experimental results on real datasets showed that our approach was able to detect semantically meaningful communities compared with existing state of the art methods
|
[['eventbased', 'services', 'have', 'recently', 'witnessed', 'a', 'rapid', 'growth', 'driving', 'the', 'way', 'people', 'explore', 'and', 'share', 'information', 'of', 'interest', 'they', 'host', 'a', 'huge', 'amount', 'of', 'users', 'activities', 'including', 'explicit', 'rsvp', 'shared', 'photos', 'comments', 'and', 'social', 'connections', 'exploiting', 'these', 'activities', 'to', 'detect', 'communities', 'of', 'similar', 'users', 'is', 'a', 'challenging', 'problem', 'in', 'reality', 'a', 'community', 'in', 'eventbased', 'social', 'network', 'esbn', 'is', 'a', 'group', 'of', 'users', 'not', 'only', 'sharing', 'common', 'events', 'and', 'friends', 'but', 'also', 'having', 'similar', 'topical', 'interests', 'however', 'such', 'community', 'could', 'not', 'be', 'detected', 'by', 'most', 'of', 'existing', 'methods', 'which', 'mainly', 'draw', 'on', 'link', 'analysis', 'in', 'the', 'network', 'to', 'address', 'this', 'problem', 'there', 'is', 'a', 'need', 'to', 'capitalize', 'on', 'the', 'semantics', 'of', 'shared', 'objects', 'along', 'with', 'the', 'structural', 'properties', 'and', 'to', 'generate', 'overlapping', 'communities', 'rather', 'than', 'disjoint', 'ones', 'in', 'this', 'paper', 'we', 'propose', 'to', 'leverage', 'the', 'users', 'activities', 'around', 'events', 'with', 'the', 'aim', 'to', 'detect', 'communities', 'based', 'on', 'topical', 'clustering', 'and', 'link', 'analysis', 'that', 'maximize', 'a', 'new', 'form', 'of', 'semantic', 'modularity', 'we', 'particularly', 'highlight', 'the', 'difference', 'between', 'online', 'and', 'offline', 'social', 'interactions', 'and', 'the', 'influence', 'of', 'event', 'categories', 'to', 'detect', 'communities', 'experimental', 'results', 'on', 'real', 'datasets', 'showed', 'that', 'our', 'approach', 'was', 'able', 'to', 'detect', 'semantically', 'meaningful', 'communities', 'compared', 'with', 'existing', 'state', 'of', 'the', 'art', 'methods']]
|
[-0.1142043328105177, 0.026409219473826302, -0.07285554425722901, 0.10286835565907179, -0.18075530862869085, -0.14459069902796268, 0.08926726593048137, 0.44021749933305576, -0.24602960273312258, -0.36288184131320456, 0.06656711030115217, -0.34500319850492744, -0.2028595306334261, 0.13341876159083227, -0.11884839789213447, -0.01006726715610003, 0.12379640003517593, 0.09057965038556347, -0.007787397922602215, -0.2844546947629412, 0.330994793151662, 0.04340604325211238, 0.3275029100074276, 0.05845141301727894, 0.057999280289433304, -0.026942391241301256, -0.11320899332652219, 0.03415418685400066, -0.07844205394118971, 0.19685658730110062, 0.37849329798344045, 0.22282357555629667, 0.3370416409123947, -0.4377720160409808, -0.20397263091624632, 0.12716754077412742, 0.1396145070810793, 0.06979279438116401, -0.05808269443211726, -0.37658288336294415, 0.08683845615775168, -0.19073864593318118, -0.014999833278125152, -0.08841132993653121, 0.014857376149929323, 0.024543076240121028, -0.2073965769925035, 0.022066175528325942, 0.011075266596566111, 0.08235643991029425, -0.009042842106174419, -0.04542846568528157, 0.025338945925318736, 0.2107256467161368, 0.08954278194912627, -0.005415902897775505, 0.14907402308579387, -0.16693817449031664, -0.1614242274744095, 0.3798384672759267, 0.017156675081837824, -0.14725293144860332, 0.2683605166932448, -0.06764489474383904, -0.1787548444607286, 0.09942330659072071, 0.24749353412760072, 0.0706973224532523, -0.1832145101616694, -0.029047723718639923, -0.05727920332337997, 0.21229428755313084, 0.06088496799728289, 0.04645602818691439, 0.20642769532877547, 0.18871067462276925, 0.07553959577021623, 0.08437522981283578, -0.025374135403608035, -0.08413884525261081, -0.1448335243010949, -0.12611959862527392, -0.16908355476104164, -0.019516749897514157, -0.06536902295660958, -0.1470892199639019, 0.42618042938146133, 0.2109053561182711, 0.1896651841580204, 0.04914372986572158, 0.2825467132422658, -0.01992158874544306, 0.12281218932545053, 0.09939105174674809, 0.18148066819931316, 0.031074548604388692, 0.16235050071943735, -0.13110263346427, 0.15090187355019566, -0.009920412850754087]
|
1,803.04355
|
Efficient Communication over Cellular Networks with Network Coding in
Emergency Scenarios
|
Emergency communications requires reliability and flexibility for disaster
recovery and relief operation. Based upon existing commercial portable devices
(e.g., smartphones, tablets, laptops), we propose a network architecture that
uses cellular networks and WiFi connections to deliver large files in emergency
scenarios under the impairments of wireless channel such as packet losses and
intermittent connection issues. Network coding (NC) is exploited to improve the
delivery probability. We first review the state-of-the-art of NC for emergency
communications. Then, we present the proposed network architecture which
utilizes multiple radio interfaces of portable devices to support data
delivery. A random linear NC scheme is exploited at source to enhance the
reliability for content delivery against packet losses. Besides, an analytical
model for the successful decoding probability in linear NC is derived. Finally,
we evaluate the effectiveness of the proposed architecture with NC in terms of
the delivery ratio of content for intermittent connectivity scenarios.
|
cs.NI
|
emergency communications requires reliability and flexibility for disaster recovery and relief operation based upon existing commercial portable devices eg smartphones tablets laptops we propose a network architecture that uses cellular networks and wifi connections to deliver large files in emergency scenarios under the impairments of wireless channel such as packet losses and intermittent connection issues network coding nc is exploited to improve the delivery probability we first review the stateoftheart of nc for emergency communications then we present the proposed network architecture which utilizes multiple radio interfaces of portable devices to support data delivery a random linear nc scheme is exploited at source to enhance the reliability for content delivery against packet losses besides an analytical model for the successful decoding probability in linear nc is derived finally we evaluate the effectiveness of the proposed architecture with nc in terms of the delivery ratio of content for intermittent connectivity scenarios
|
[['emergency', 'communications', 'requires', 'reliability', 'and', 'flexibility', 'for', 'disaster', 'recovery', 'and', 'relief', 'operation', 'based', 'upon', 'existing', 'commercial', 'portable', 'devices', 'eg', 'smartphones', 'tablets', 'laptops', 'we', 'propose', 'a', 'network', 'architecture', 'that', 'uses', 'cellular', 'networks', 'and', 'wifi', 'connections', 'to', 'deliver', 'large', 'files', 'in', 'emergency', 'scenarios', 'under', 'the', 'impairments', 'of', 'wireless', 'channel', 'such', 'as', 'packet', 'losses', 'and', 'intermittent', 'connection', 'issues', 'network', 'coding', 'nc', 'is', 'exploited', 'to', 'improve', 'the', 'delivery', 'probability', 'we', 'first', 'review', 'the', 'stateoftheart', 'of', 'nc', 'for', 'emergency', 'communications', 'then', 'we', 'present', 'the', 'proposed', 'network', 'architecture', 'which', 'utilizes', 'multiple', 'radio', 'interfaces', 'of', 'portable', 'devices', 'to', 'support', 'data', 'delivery', 'a', 'random', 'linear', 'nc', 'scheme', 'is', 'exploited', 'at', 'source', 'to', 'enhance', 'the', 'reliability', 'for', 'content', 'delivery', 'against', 'packet', 'losses', 'besides', 'an', 'analytical', 'model', 'for', 'the', 'successful', 'decoding', 'probability', 'in', 'linear', 'nc', 'is', 'derived', 'finally', 'we', 'evaluate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'architecture', 'with', 'nc', 'in', 'terms', 'of', 'the', 'delivery', 'ratio', 'of', 'content', 'for', 'intermittent', 'connectivity', 'scenarios']]
|
[-0.2343629605633517, 0.005783522181930797, -0.0006190045674641928, 0.020033603014890104, -0.051655767997726795, -0.2288639398974677, 0.1119489426833267, 0.4242371693998575, -0.22724543831621608, -0.282022178688397, 0.1013542483941031, -0.2552164133172482, -0.22692300174074867, 0.1822576396772638, -0.16995677769649775, 0.1172178200345176, 0.03128413214193036, 0.020413019216308993, -0.023708000557186703, -0.27424817215651276, 0.24082484980269026, 0.11915217441196244, 0.4476071911491454, 0.09251332440787034, 0.07393046980878959, 0.03547604678509136, -0.028073509810492395, -0.07402710401685908, -0.051220956502414386, 0.13473483987230186, 0.3536272239436706, 0.24069040785854062, 0.24957148055856426, -0.5220430718734861, -0.28968689367175104, 0.038825821129139515, 0.1411700043628419, 0.042355037784048664, -0.07310376631096005, -0.2795636573185523, 0.13646310183297222, -0.29409959862940016, -0.060841223404471144, -0.03782051881154378, -0.006170964047002295, 0.0766102052728335, -0.32150909283508855, -0.022348703929844, -0.05730398039023082, 0.0047901376523077485, -0.03176277031132486, -0.05513978463131934, 0.037295205863192675, 0.17031931944501896, -0.008695936082707098, -0.01495138295305272, 0.18107644320465624, -0.14042819835434783, -0.1306139214973276, 0.3886125938470165, -0.007248244852526113, -0.18201332713166873, 0.1692089547329427, 0.020057927817106247, -0.11279917517676949, 0.12121464595198632, 0.30427666508903106, 0.03454660683404654, -0.1781688435624043, -0.005524173500016332, 0.0694880500342697, 0.17153345697248976, 0.06593583228687445, 0.13150854245759547, 0.139077162037914, 0.26867375734572607, 0.11286290862345293, 0.12645007706557712, -0.13713405860665565, -0.07853130243097742, -0.20022330774343572, -0.13631426262979707, -0.16351893736903245, -0.0034406887801984947, -0.10489501252731619, -0.0945406563486904, 0.35524585654733526, 0.19003283546306193, 0.08872322345773379, 0.11639484762912616, 0.430778889618814, 0.02421633617874856, 0.09142464672525724, 0.1194549816319098, 0.1453535452609261, 0.042340580344510576, 0.210144927042226, -0.16993272977881133, 0.11288484426215291, -0.011622163048014045]
|
1,803.04356
|
SPH simulations of the induced gravitational collapse scenario of long
gamma-ray bursts associated with supernovae
|
We present the first three-dimensional (3D) smoothed-particle-hydrodynamics
(SPH) simulations of the induced gravitational collapse (IGC) scenario of
long-duration gamma-ray bursts (GRBs) associated with supernovae (SNe). We
simulate the SN explosion of a carbon-oxygen core (CO$_{\rm core}$) forming a
binary system with a neutron star (NS) companion. We follow the evolution of
the SN ejecta, including their morphological structure, subjected to the
gravitational field of both the new NS ($\nu$NS) formed at the center of the
SN, and the one of the NS companion. We compute the accretion rate of the SN
ejecta onto the NS companion as well as onto the $\nu$NS from SN matter
fallback. We determine the fate of the binary system for a wide parameter space
including different CO$_{\rm core}$ and NS companion masses, orbital periods
and SN explosion geometry and energies. We identify, for selected NS nuclear
equations-of-state, the binary parameters leading the NS companion, by
hypercritical accretion, either to the mass-shedding limit, or to the secular
axisymmetric instability for gravitational collapse to a black hole (BH), or to
a more massive, fast rotating, stable NS. We also assess whether the binary
remains or not gravitationally bound after the SN explosion, hence exploring
the space of binary and SN explosion parameters leading to $\nu$NS-NS and
$\nu$NS-BH binaries. The consequences of our results for the modeling of long
GRBs, i.e. X-ray flashes and binary-driven hypernovae, are discussed.
|
astro-ph.HE gr-qc
|
we present the first threedimensional 3d smoothedparticlehydrodynamics sph simulations of the induced gravitational collapse igc scenario of longduration gammaray bursts grbs associated with supernovae sne we simulate the sn explosion of a carbonoxygen core co_rm core forming a binary system with a neutron star ns companion we follow the evolution of the sn ejecta including their morphological structure subjected to the gravitational field of both the new ns nuns formed at the center of the sn and the one of the ns companion we compute the accretion rate of the sn ejecta onto the ns companion as well as onto the nuns from sn matter fallback we determine the fate of the binary system for a wide parameter space including different co_rm core and ns companion masses orbital periods and sn explosion geometry and energies we identify for selected ns nuclear equationsofstate the binary parameters leading the ns companion by hypercritical accretion either to the massshedding limit or to the secular axisymmetric instability for gravitational collapse to a black hole bh or to a more massive fast rotating stable ns we also assess whether the binary remains or not gravitationally bound after the sn explosion hence exploring the space of binary and sn explosion parameters leading to nunsns and nunsbh binaries the consequences of our results for the modeling of long grbs ie xray flashes and binarydriven hypernovae are discussed
|
[['we', 'present', 'the', 'first', 'threedimensional', '3d', 'smoothedparticlehydrodynamics', 'sph', 'simulations', 'of', 'the', 'induced', 'gravitational', 'collapse', 'igc', 'scenario', 'of', 'longduration', 'gammaray', 'bursts', 'grbs', 'associated', 'with', 'supernovae', 'sne', 'we', 'simulate', 'the', 'sn', 'explosion', 'of', 'a', 'carbonoxygen', 'core', 'co_rm', 'core', 'forming', 'a', 'binary', 'system', 'with', 'a', 'neutron', 'star', 'ns', 'companion', 'we', 'follow', 'the', 'evolution', 'of', 'the', 'sn', 'ejecta', 'including', 'their', 'morphological', 'structure', 'subjected', 'to', 'the', 'gravitational', 'field', 'of', 'both', 'the', 'new', 'ns', 'nuns', 'formed', 'at', 'the', 'center', 'of', 'the', 'sn', 'and', 'the', 'one', 'of', 'the', 'ns', 'companion', 'we', 'compute', 'the', 'accretion', 'rate', 'of', 'the', 'sn', 'ejecta', 'onto', 'the', 'ns', 'companion', 'as', 'well', 'as', 'onto', 'the', 'nuns', 'from', 'sn', 'matter', 'fallback', 'we', 'determine', 'the', 'fate', 'of', 'the', 'binary', 'system', 'for', 'a', 'wide', 'parameter', 'space', 'including', 'different', 'co_rm', 'core', 'and', 'ns', 'companion', 'masses', 'orbital', 'periods', 'and', 'sn', 'explosion', 'geometry', 'and', 'energies', 'we', 'identify', 'for', 'selected', 'ns', 'nuclear', 'equationsofstate', 'the', 'binary', 'parameters', 'leading', 'the', 'ns', 'companion', 'by', 'hypercritical', 'accretion', 'either', 'to', 'the', 'massshedding', 'limit', 'or', 'to', 'the', 'secular', 'axisymmetric', 'instability', 'for', 'gravitational', 'collapse', 'to', 'a', 'black', 'hole', 'bh', 'or', 'to', 'a', 'more', 'massive', 'fast', 'rotating', 'stable', 'ns', 'we', 'also', 'assess', 'whether', 'the', 'binary', 'remains', 'or', 'not', 'gravitationally', 'bound', 'after', 'the', 'sn', 'explosion', 'hence', 'exploring', 'the', 'space', 'of', 'binary', 'and', 'sn', 'explosion', 'parameters', 'leading', 'to', 'nunsns', 'and', 'nunsbh', 'binaries', 'the', 'consequences', 'of', 'our', 'results', 'for', 'the', 'modeling', 'of', 'long', 'grbs', 'ie', 'xray', 'flashes', 'and', 'binarydriven', 'hypernovae', 'are', 'discussed']]
|
[-0.09749821139823261, 0.11933643548195903, -0.03614638656941488, 0.14837096879879633, -0.12658039404267216, -0.07675485075819061, 0.06970478494533158, 0.36318475357665303, -0.19737025376678885, -0.28306506045625784, 0.08742601581309971, -0.2575942696274611, -0.004047406872064529, 0.21704605625423587, 0.001407897607861199, -0.022762044970142215, 0.15604046154603884, -0.030268310979743928, -0.18093095680600718, -0.2634268153970448, 0.35832304177344204, 0.09610331737795812, 0.09146043924582109, -0.08344905173381496, 0.06915601304009263, -0.06341444738229671, 0.0068603955391026514, -0.08398023663163226, -0.18140504791466683, 0.005557675427234356, 0.16057268150350928, 0.18452386246593833, 0.15151546511435554, -0.42926732633720366, -0.2745044475315106, 0.09150626198204823, 0.15558691318514511, 0.10002457293203885, -0.09224138893688705, -0.26287048642488864, 0.10765566970548478, -0.3105342940145515, -0.15496639196001188, 0.09255488554889892, 0.07047162888748541, 0.08999589397653676, -0.20752526031528282, 0.12829633040816765, 0.08711449927629969, -0.048245203383103535, -0.13913720721999803, -0.019848427103154296, -0.056372631972312535, 0.03131359314756354, 0.07918379923559546, 0.04962809592906157, 0.12093605042083941, -0.13456725137164763, -0.009481111206441071, 0.44066436440896306, -0.02364111809558317, -0.006226818753292032, 0.2492653008493219, -0.19174648906725147, -0.11456671902877197, 0.16215170066182813, 0.1746476012498565, 0.15421716387643022, -0.12210903380177465, -0.04898727061242282, 0.04734982775622293, 0.18390148470133313, 0.07067071354596696, 0.02638257038983794, 0.3948892139576441, 0.1989305435211128, -0.04430047371281769, 0.10032460896968189, -0.22537383272158382, -0.023914899946631568, -0.23992256220356611, -0.1007651392599719, -0.14632220742121144, 0.15992592504916134, -0.1439361517177052, -0.1704333820890864, 0.3339201010020221, 0.04049045295176799, 0.18411551109257793, -0.01627077995554397, 0.22654559246158196, 0.06259936490657805, 0.04534575376524835, 0.12727324060560613, 0.32931188023812547, 0.20219893127438826, 0.11139546986362946, -0.29578333844639065, 0.05651412843195558, 0.07790811991486535]
|
1,803.04357
|
Learning the Base Distribution in Implicit Generative Models
|
Popular generative model learning methods such as Generative Adversarial
Networks (GANs), and Variational Autoencoders (VAE) enforce the latent
representation to follow simple distributions such as isotropic Gaussian. In
this paper, we argue that learning a complicated distribution over the latent
space of an auto-encoder enables more accurate modeling of complicated data
distributions. Based on this observation, we propose a two stage optimization
procedure which maximizes an approximate implicit density model. We
experimentally verify that our method outperforms GANs and VAEs on two image
datasets (MNIST, CELEB-A). We also show that our approach is amenable to
learning generative model for sequential data, by learning to generate speech
and music.
|
cs.LG cs.NE
|
popular generative model learning methods such as generative adversarial networks gans and variational autoencoders vae enforce the latent representation to follow simple distributions such as isotropic gaussian in this paper we argue that learning a complicated distribution over the latent space of an autoencoder enables more accurate modeling of complicated data distributions based on this observation we propose a two stage optimization procedure which maximizes an approximate implicit density model we experimentally verify that our method outperforms gans and vaes on two image datasets mnist celeba we also show that our approach is amenable to learning generative model for sequential data by learning to generate speech and music
|
[['popular', 'generative', 'model', 'learning', 'methods', 'such', 'as', 'generative', 'adversarial', 'networks', 'gans', 'and', 'variational', 'autoencoders', 'vae', 'enforce', 'the', 'latent', 'representation', 'to', 'follow', 'simple', 'distributions', 'such', 'as', 'isotropic', 'gaussian', 'in', 'this', 'paper', 'we', 'argue', 'that', 'learning', 'a', 'complicated', 'distribution', 'over', 'the', 'latent', 'space', 'of', 'an', 'autoencoder', 'enables', 'more', 'accurate', 'modeling', 'of', 'complicated', 'data', 'distributions', 'based', 'on', 'this', 'observation', 'we', 'propose', 'a', 'two', 'stage', 'optimization', 'procedure', 'which', 'maximizes', 'an', 'approximate', 'implicit', 'density', 'model', 'we', 'experimentally', 'verify', 'that', 'our', 'method', 'outperforms', 'gans', 'and', 'vaes', 'on', 'two', 'image', 'datasets', 'mnist', 'celeba', 'we', 'also', 'show', 'that', 'our', 'approach', 'is', 'amenable', 'to', 'learning', 'generative', 'model', 'for', 'sequential', 'data', 'by', 'learning', 'to', 'generate', 'speech', 'and', 'music']]
|
[0.04543324626003461, -0.023630816129163443, -0.14465909227038976, 0.15145646823738287, -0.1554065871578469, -0.1866956596624934, -0.004148739388997287, 0.5410026806165222, -0.2759341767868372, -0.3067513692383525, -0.006220970096937554, -0.24845942296087742, -0.2732074028398428, 0.17908155505278114, -0.1597624307377609, 0.11479486116311616, 0.14558847406361666, 0.011428400544294467, -0.08345925474013374, -0.2716775142622215, 0.33865886036612747, 0.020246143073395447, 0.40441522993906226, -0.06754970369446608, 0.19175157714764485, -0.024108288473346166, 0.009874184200910989, -0.06816910641053389, -0.06831959644579103, 0.21498456198497917, 0.29806933775587285, 0.25276253427512496, 0.35188724566682206, -0.4183028611975412, -0.2860959878372442, 0.12131376574850744, 0.1309946250953039, 0.1178742625506183, -0.03979564139566113, -0.3633380341688516, 0.05222378360297255, -0.20702966925239674, 0.0777208416386404, -0.24075793623234387, -0.0874131399517258, -0.04144788349394393, -0.3570096108683006, 0.06714188912748661, 0.13421462241698195, 0.03146995375519274, -0.06671180656283265, -0.11773353255854023, 0.010469047748268134, 0.07263523427752296, 0.04613337545823823, 0.05637341534667131, 0.09480322664172423, -0.168688370683985, -0.15686741244065128, 0.30217135489780317, -0.09987910657569214, -0.2305827287879462, 0.16686792153632268, 0.042219403704317905, -0.20147101467268336, 0.06657816411892849, 0.2608693326883777, 0.17176526292503155, -0.16871831684235344, -0.015765902307639072, -0.10127705140621401, 0.15622373182257568, -0.012787741201464087, -0.06890497245843073, 0.11180744899859375, 0.26944029564900257, 0.03171130239584104, 0.15232876508013793, -0.17082419838428636, -0.11004556848719302, -0.20810583454591255, -0.08399979328169138, -0.2638678694902747, -0.008024625040383803, -0.134059444017718, -0.19002062730767108, 0.37390544363814926, 0.2823010031823759, 0.22883394896915113, 0.17092292583482857, 0.3635964760453337, 0.030261335696128232, 0.06395602218927471, 0.13242551826233803, 0.11906386033041161, 0.04889887037764614, 0.07499831738446287, -0.1292256110356431, 0.11015834972797031, 0.02287509836713542]
|
1,803.04358
|
Quantitative Fundamental Theorem of Algebra
|
Using subresultants, we modify a recent real-algebraic proof due to Eisermann
of the Fundamental Theorem of Algebra ([FTA]) to obtain the following
quantitative information: in order to prove the [FTA] for polynomials of degree
$d$, the Intermediate Value Theorem ([IVT]) is requested to hold for real
polynomials of degree at most $d^2$. We also explain that the classical proof
due to Laplace requires [IVT] for real polynomials of exponential degree. These
quantitative results highlight the difference in nature of these two proofs.
|
math.AG
|
using subresultants we modify a recent realalgebraic proof due to eisermann of the fundamental theorem of algebra fta to obtain the following quantitative information in order to prove the fta for polynomials of degree d the intermediate value theorem ivt is requested to hold for real polynomials of degree at most d2 we also explain that the classical proof due to laplace requires ivt for real polynomials of exponential degree these quantitative results highlight the difference in nature of these two proofs
|
[['using', 'subresultants', 'we', 'modify', 'a', 'recent', 'realalgebraic', 'proof', 'due', 'to', 'eisermann', 'of', 'the', 'fundamental', 'theorem', 'of', 'algebra', 'fta', 'to', 'obtain', 'the', 'following', 'quantitative', 'information', 'in', 'order', 'to', 'prove', 'the', 'fta', 'for', 'polynomials', 'of', 'degree', 'd', 'the', 'intermediate', 'value', 'theorem', 'ivt', 'is', 'requested', 'to', 'hold', 'for', 'real', 'polynomials', 'of', 'degree', 'at', 'most', 'd2', 'we', 'also', 'explain', 'that', 'the', 'classical', 'proof', 'due', 'to', 'laplace', 'requires', 'ivt', 'for', 'real', 'polynomials', 'of', 'exponential', 'degree', 'these', 'quantitative', 'results', 'highlight', 'the', 'difference', 'in', 'nature', 'of', 'these', 'two', 'proofs']]
|
[-0.12174167984559928, 0.028199443485724125, -0.12384250768596625, 0.08322210712699084, -0.09473860212715297, -0.14429123226621346, 0.040937496936970914, 0.2820059811900847, -0.30013463479926716, -0.26827442519957334, 0.0980288665897849, -0.23150082621950566, -0.14105921030816873, 0.22962085933356388, -0.12180339304798442, 0.02753825137880063, 0.022499108028302833, 0.05079658986523566, -0.0494450099806006, -0.29111648754148584, 0.3341285834406934, -0.027463884792779003, 0.20412765681834483, 0.1372493327532827, 0.0816903288033223, 0.0296803112141788, -0.06816383970833224, -0.06881556623592609, -0.15328974344687063, 0.16229605330608604, 0.2838976087088401, 0.11707038638216057, 0.234544895356521, -0.3830920678177258, -0.1049065109024324, 0.17038409059821832, 0.1258454296692479, 0.08470662589548383, -0.0027572379884787087, -0.22997132055007102, 0.14125876069046195, -0.09278751553015686, -0.23899027376958146, -0.10624796506471751, 0.03819048631845451, 0.04229929207301721, -0.27861845973174926, 0.07835428941130308, 0.15021290993545114, 0.11789192087244152, -0.0026478356903237178, -0.15084727617582624, 0.023218055048435018, 0.07957220363158096, 0.03512290774464107, 0.02818214728514005, 0.02779454132542014, -0.09476338167924707, -0.13990193705369786, 0.32095023742081913, -0.01183129221672283, -0.18232776099679673, 0.17694681937161766, -0.172726677605746, -0.20164334699057224, 0.08231680172427398, 0.13230620722979217, 0.10074620879050798, -0.041463860117535035, 0.09852501981687255, -0.07766379736273027, 0.15573571754119744, 0.145085022103314, 0.058805040115058965, 0.09077680295776212, 0.046371862496726396, 0.05283494939936734, 0.13052046410569057, 0.023782932364222843, -0.11999292417270381, -0.30963823989760586, -0.20371918964040717, -0.20760936302519062, 0.09384717150568599, -0.1553581137176058, -0.1445338224605998, 0.38872178144207814, 0.14996515846138297, 0.17064513968553666, 0.1242469894904189, 0.23784710885530974, 0.1303979860073546, 0.03972403259050646, 0.021541883489212856, 0.19140720929632463, 0.21141103557424573, 0.09693184783455075, -0.15087289560200057, 0.07269273790468393, 0.18256091142482148]
|
1,803.04359
|
Probing Quartic Higgs Self-Interaction
|
The Higgs self-interactions play a crucial role for exploring the underlying
mechanism of electroweak symmetry breaking and the nature of the phase
transition involved. In this article, we propose to probe the quartic Higgs
self-interaction at lepton and hadron colliders, via the di-Higgs productions.
We analyze the contributions of the quartic Higgs coupling, including the
renormalization of the cubic Higgs coupling and the modification of the $VVhh$
form factor, to the vector-boson-fusion and the vector-boson associated
di-Higgs productions at one-loop level. Such an effect is independent of the
choice of gauge-fixing, if the quartic Higgs coupling is decoupled from the
other ones in the contexts considered. Notably, a combination of these two
di-Higgs productions is important for optimizing the collider sensitivities to
probe the quartic Higgs coupling. With this guideline, we explore the ILC and
CLIC sensitivities, and find that the ILC has a potential to measure the
quartic Higgs coupling, normalized by its SM value, with a precision of $\sim
\pm 25$ (500 GeV, 4 ab$^{-1}$ + 1 TeV, 2.5 ab$^{-1}$) and $\sim \pm20$ (500
GeV, 4 ab$^{-1}$ + 1 TeV, 8 ab$^{-1}$), at $1\sigma$ C.L., after marginalizing
the cubic Higgs coupling in the $\chi^2$ analysis. The dependence on the
renormalization scheme of the cubic Higgs coupling is discussed.
|
hep-ph hep-ex
|
the higgs selfinteractions play a crucial role for exploring the underlying mechanism of electroweak symmetry breaking and the nature of the phase transition involved in this article we propose to probe the quartic higgs selfinteraction at lepton and hadron colliders via the dihiggs productions we analyze the contributions of the quartic higgs coupling including the renormalization of the cubic higgs coupling and the modification of the vvhh form factor to the vectorbosonfusion and the vectorboson associated dihiggs productions at oneloop level such an effect is independent of the choice of gaugefixing if the quartic higgs coupling is decoupled from the other ones in the contexts considered notably a combination of these two dihiggs productions is important for optimizing the collider sensitivities to probe the quartic higgs coupling with this guideline we explore the ilc and clic sensitivities and find that the ilc has a potential to measure the quartic higgs coupling normalized by its sm value with a precision of sim pm 25 500 gev 4 ab1 1 tev 25 ab1 and sim pm20 500 gev 4 ab1 1 tev 8 ab1 at 1sigma cl after marginalizing the cubic higgs coupling in the chi2 analysis the dependence on the renormalization scheme of the cubic higgs coupling is discussed
|
[['the', 'higgs', 'selfinteractions', 'play', 'a', 'crucial', 'role', 'for', 'exploring', 'the', 'underlying', 'mechanism', 'of', 'electroweak', 'symmetry', 'breaking', 'and', 'the', 'nature', 'of', 'the', 'phase', 'transition', 'involved', 'in', 'this', 'article', 'we', 'propose', 'to', 'probe', 'the', 'quartic', 'higgs', 'selfinteraction', 'at', 'lepton', 'and', 'hadron', 'colliders', 'via', 'the', 'dihiggs', 'productions', 'we', 'analyze', 'the', 'contributions', 'of', 'the', 'quartic', 'higgs', 'coupling', 'including', 'the', 'renormalization', 'of', 'the', 'cubic', 'higgs', 'coupling', 'and', 'the', 'modification', 'of', 'the', 'vvhh', 'form', 'factor', 'to', 'the', 'vectorbosonfusion', 'and', 'the', 'vectorboson', 'associated', 'dihiggs', 'productions', 'at', 'oneloop', 'level', 'such', 'an', 'effect', 'is', 'independent', 'of', 'the', 'choice', 'of', 'gaugefixing', 'if', 'the', 'quartic', 'higgs', 'coupling', 'is', 'decoupled', 'from', 'the', 'other', 'ones', 'in', 'the', 'contexts', 'considered', 'notably', 'a', 'combination', 'of', 'these', 'two', 'dihiggs', 'productions', 'is', 'important', 'for', 'optimizing', 'the', 'collider', 'sensitivities', 'to', 'probe', 'the', 'quartic', 'higgs', 'coupling', 'with', 'this', 'guideline', 'we', 'explore', 'the', 'ilc', 'and', 'clic', 'sensitivities', 'and', 'find', 'that', 'the', 'ilc', 'has', 'a', 'potential', 'to', 'measure', 'the', 'quartic', 'higgs', 'coupling', 'normalized', 'by', 'its', 'sm', 'value', 'with', 'a', 'precision', 'of', 'sim', 'pm', '25', '500', 'gev', '4', 'ab1', '1', 'tev', '25', 'ab1', 'and', 'sim', 'pm20', '500', 'gev', '4', 'ab1', '1', 'tev', '8', 'ab1', 'at', '1sigma', 'cl', 'after', 'marginalizing', 'the', 'cubic', 'higgs', 'coupling', 'in', 'the', 'chi2', 'analysis', 'the', 'dependence', 'on', 'the', 'renormalization', 'scheme', 'of', 'the', 'cubic', 'higgs', 'coupling', 'is', 'discussed']]
|
[-0.11443298124924275, 0.21598376781079984, -0.014409058300840955, 0.14584978929241726, -0.07621183790839635, -0.19543789769970596, 0.0024383125844626473, 0.3111559596906703, -0.2434039988632741, -0.28986222377548426, 0.01502445384316021, -0.3236025796997218, -0.02342437898131231, 0.12634565374285628, 0.1313670685116309, 0.0471415344081134, 0.045393441227553503, -0.007753581184750566, -0.06419979555301744, -0.3089224882519025, 0.28643916403570285, 0.08353595162267223, 0.1799916855963182, 0.14758260721954194, 0.1054463947872976, 0.0311712713759894, 0.01956377506408339, -0.13411986203685117, -0.15432291474466042, 0.10209216021869977, 0.18693470347520466, 0.032411385711769145, 0.1830158892329424, -0.26626637855616325, -0.08683670938234382, 0.17016529426977145, 0.11515080832368067, 0.07907038224220742, -0.05986262752748399, -0.29219506252467486, 0.09975563149558954, -0.22118373265010843, -0.11947313520795433, -0.03411205676429045, -0.05627095566636014, -0.13115511771040753, -0.33019035844252076, 0.07099239195052248, -0.06725410116800609, 0.07848180536753856, 0.03804573891606056, -0.1695844088065384, -0.09428787677405545, -0.035878966143802524, 0.134583890133609, 0.039870093938868825, 0.16921361879044874, -0.21385334853682883, -0.16514948826303366, 0.4226887082555689, -0.12758345149744016, -0.13751229687141647, 0.14838017247026214, -0.18234456668813856, -0.14931437644211726, 0.1414512588794773, 0.23771727623758265, 0.018424403810198643, -0.15138744017055544, 0.22948856063689724, 0.06861836193358893, 0.18279731848004024, 0.08418529135031769, 0.0524592134332544, 0.2277684090927673, 0.21886771077151934, 0.049739485346855454, 0.052473320238697434, -0.10003635529210442, -0.04262828604819683, -0.4869554316526494, -0.10076698914277725, -0.03089981809339056, 0.07747760397628903, -0.1468568824634181, -0.04412467269923162, 0.41946407379598966, 0.1351099509987622, 0.25356654530556766, -0.011423133461413762, 0.25452230745353377, 0.11691604199194654, 0.10315964437694884, -0.01763802250745637, 0.38584924821267264, 0.1558318478738119, 0.10211060732343377, -0.25096583222218144, -0.024067651032685086, 0.05324188001955358]
|
1,803.0436
|
Beyond Gr\"obner Bases: Basis Selection for Minimal Solvers
|
Many computer vision applications require robust estimation of the underlying
geometry, in terms of camera motion and 3D structure of the scene. These robust
methods often rely on running minimal solvers in a RANSAC framework. In this
paper we show how we can make polynomial solvers based on the action matrix
method faster, by careful selection of the monomial bases. These monomial bases
have traditionally been based on a Gr\"obner basis for the polynomial ideal.
Here we describe how we can enumerate all such bases in an efficient way. We
also show that going beyond Gr\"obner bases leads to more efficient solvers in
many cases. We present a novel basis sampling scheme that we evaluate on a
number of problems.
|
cs.CV
|
many computer vision applications require robust estimation of the underlying geometry in terms of camera motion and 3d structure of the scene these robust methods often rely on running minimal solvers in a ransac framework in this paper we show how we can make polynomial solvers based on the action matrix method faster by careful selection of the monomial bases these monomial bases have traditionally been based on a grobner basis for the polynomial ideal here we describe how we can enumerate all such bases in an efficient way we also show that going beyond grobner bases leads to more efficient solvers in many cases we present a novel basis sampling scheme that we evaluate on a number of problems
|
[['many', 'computer', 'vision', 'applications', 'require', 'robust', 'estimation', 'of', 'the', 'underlying', 'geometry', 'in', 'terms', 'of', 'camera', 'motion', 'and', '3d', 'structure', 'of', 'the', 'scene', 'these', 'robust', 'methods', 'often', 'rely', 'on', 'running', 'minimal', 'solvers', 'in', 'a', 'ransac', 'framework', 'in', 'this', 'paper', 'we', 'show', 'how', 'we', 'can', 'make', 'polynomial', 'solvers', 'based', 'on', 'the', 'action', 'matrix', 'method', 'faster', 'by', 'careful', 'selection', 'of', 'the', 'monomial', 'bases', 'these', 'monomial', 'bases', 'have', 'traditionally', 'been', 'based', 'on', 'a', 'grobner', 'basis', 'for', 'the', 'polynomial', 'ideal', 'here', 'we', 'describe', 'how', 'we', 'can', 'enumerate', 'all', 'such', 'bases', 'in', 'an', 'efficient', 'way', 'we', 'also', 'show', 'that', 'going', 'beyond', 'grobner', 'bases', 'leads', 'to', 'more', 'efficient', 'solvers', 'in', 'many', 'cases', 'we', 'present', 'a', 'novel', 'basis', 'sampling', 'scheme', 'that', 'we', 'evaluate', 'on', 'a', 'number', 'of', 'problems']]
|
[-0.0861624969431432, 0.002402926171513779, -0.10416784877888859, 0.04104567566537298, -0.11111095612092564, -0.10585653949528932, -0.003129177400842309, 0.4380918032062861, -0.3024584620298507, -0.2787822427848975, 0.12332846530771349, -0.19085571566441406, -0.22951298326564332, 0.25645831756216164, -0.10948349176129947, 0.10128140452628334, 0.10942199337102163, 0.0008979539658563832, -0.1275918182839329, -0.29621945030327573, 0.3017735754450162, 0.033826645840114605, 0.28197269000811503, -0.010440413215352844, 0.10974085692632798, -0.0008666778293748696, -0.04687303637620062, 0.028046998582537223, -0.11773468812134524, 0.19320438905463863, 0.2955189365427941, 0.20031464134614604, 0.2895694034038267, -0.4979415204996864, -0.13518612228799612, 0.14562743121447663, 0.1890164859360084, 0.16290094999906918, -0.050722346399197704, -0.18608487923629582, 0.07568241762152562, -0.18848719350862667, -0.07913964329830682, -0.20462123130564577, -0.025037146208342166, -0.0035262969438917937, -0.2795756762755142, -0.0031169401600588268, 0.059096541195564595, 0.10572533985444656, 0.005666785336021955, -0.14021866583886247, 0.07212631781003438, 0.06041291099973023, -0.044439396902938216, -0.010621965090588976, 0.09591340081533417, -0.13819413355128443, -0.1906724580951656, 0.39449599497020243, -0.030868881839948396, -0.28659464200027285, 0.18689631280334046, -0.07520186536712573, -0.18108963368770978, 0.08061523418097447, 0.19846012725805243, 0.1849572111076365, -0.11488943916483549, 0.12120330224230808, -0.07969850674659634, 0.1634920519621422, 0.04966128820669837, 0.02276408302520091, 0.1669039750471711, 0.15423576816295584, 0.10044416451904302, 0.10443923966571068, -0.04395780677829559, -0.06834109338233248, -0.26233928875687224, -0.16171474513442566, -0.17691261432967925, 0.006549929602382084, -0.10243957806560502, -0.19862397348042576, 0.4238465693149616, 0.2635380195220932, 0.15094322504398103, 0.046026880457066, 0.31984205124123644, 0.06514169091824443, 0.06627856275687614, 0.09687733235380923, 0.19234321923383202, 0.060742125576750065, 0.027652464737184346, -0.16312042305459423, 0.0581182703259401, 0.148133229726227]
|
1,803.04361
|
First rare-earth phosphate aerogel: sol-gel synthesis of monolithic
ceric hydrogen phosphate aerogel
|
Since the late 1960s, ceric hydrogen phosphates have attracted the attention
of scientists due to remarkable ion exchange, sorption, proton-conduction and
catalytic properties. In this work, through the application of various
solvents, we, for the first time, have obtained monolithic aerogels based on
ceric hydrogen phosphates with high porosity (~99%) and extremely low density
(~10 microg/cm3). The composition and structure of aerogels were thoroughly
studied with XRD, TEM, SEM, XPS, low temperature nitrogen adsorption methods,
TGA/DSC, Fourier-transform infrared spectroscopy (FTIR) and small-angle neutron
scattering (SANS). The aerogels were found to belong to the fibrous macroporous
aerogels family.
|
cond-mat.mtrl-sci
|
since the late 1960s ceric hydrogen phosphates have attracted the attention of scientists due to remarkable ion exchange sorption protonconduction and catalytic properties in this work through the application of various solvents we for the first time have obtained monolithic aerogels based on ceric hydrogen phosphates with high porosity 99 and extremely low density 10 microgcm3 the composition and structure of aerogels were thoroughly studied with xrd tem sem xps low temperature nitrogen adsorption methods tgadsc fouriertransform infrared spectroscopy ftir and smallangle neutron scattering sans the aerogels were found to belong to the fibrous macroporous aerogels family
|
[['since', 'the', 'late', '1960s', 'ceric', 'hydrogen', 'phosphates', 'have', 'attracted', 'the', 'attention', 'of', 'scientists', 'due', 'to', 'remarkable', 'ion', 'exchange', 'sorption', 'protonconduction', 'and', 'catalytic', 'properties', 'in', 'this', 'work', 'through', 'the', 'application', 'of', 'various', 'solvents', 'we', 'for', 'the', 'first', 'time', 'have', 'obtained', 'monolithic', 'aerogels', 'based', 'on', 'ceric', 'hydrogen', 'phosphates', 'with', 'high', 'porosity', '99', 'and', 'extremely', 'low', 'density', '10', 'microgcm3', 'the', 'composition', 'and', 'structure', 'of', 'aerogels', 'were', 'thoroughly', 'studied', 'with', 'xrd', 'tem', 'sem', 'xps', 'low', 'temperature', 'nitrogen', 'adsorption', 'methods', 'tgadsc', 'fouriertransform', 'infrared', 'spectroscopy', 'ftir', 'and', 'smallangle', 'neutron', 'scattering', 'sans', 'the', 'aerogels', 'were', 'found', 'to', 'belong', 'to', 'the', 'fibrous', 'macroporous', 'aerogels', 'family']]
|
[0.018812212693181053, 0.18653324326125742, -0.06867932715534192, -0.03701611931825502, -4.328296864000352e-05, -0.11237203959456604, 0.027891317782316193, 0.4953365833346691, -0.2127168696505301, -0.3373843299721003, 0.04464487592644139, -0.35216169227319566, -0.11578211458602353, 0.1549222124057174, 0.011493450941760902, 0.12045937923350088, -0.004261395068960669, -0.10859879697470562, -0.0743757568390878, -0.25736533255574456, 0.20860784274713218, 0.1578096160310847, 0.3602032616491551, 0.10535082700232085, 0.0419382040417986, 0.015763796223125057, 0.005083272795435851, 0.005014749709516764, -0.1654468177838008, 0.11667776649372409, 0.29113830733315454, -0.03814882996147904, 0.1539406897512811, -0.49494910398093256, -0.27994069821484713, 0.013202199304942042, 0.0990305313987293, 0.04456665493426439, -0.1370144350031573, -0.21931783401953947, 0.03960555326193571, -0.14724552154581508, -0.1028791126218098, -0.10750296562100234, 0.008670328205208416, 0.05879968707449734, -0.16392774382699787, 0.07612968994426014, -0.03890156323272411, 0.14919228447884644, -0.15141020321449183, -0.20287336883152224, -0.05171141554677414, 0.04595302971448172, 0.04724233207778762, -0.046540305834597624, 0.2236790959065294, -0.059836369891063834, -0.004226523188307234, 0.36387232125359686, -0.04055703164624941, -0.02585192054570855, 0.2567407876764343, -0.20824665448162705, -0.141027263517532, 0.25132690857002593, 0.09553584974745045, 0.16366152676915668, -0.19458419160535256, 0.05834279873512139, 0.008252711287122625, 0.19184240593237875, 0.2182968603953233, 0.017137004920463685, 0.16860136481472696, 0.2172903843077264, -0.09114887221696098, 0.1317509020523373, -0.1784687093281916, 0.026175860988745546, -0.0549887321742616, -0.207005085979725, -0.1561177477301301, 0.04409190109404533, -0.0504663548825825, -0.2082078261579306, 0.29434424615465105, 0.03468830658770774, 0.1301248734007063, -0.068223851991048, 0.23444879516635253, 0.005934609920191376, 0.06270767958915752, -0.04670721303124953, 0.26863462934472965, 0.2219113901551084, 0.21784993497978733, -0.2716441901056501, 0.1410255619203267, -0.0029646904162212236]
|
1,803.04362
|
M-estimation in high-dimensional linear model
|
We mainly study the M-estimation method for the high-dimensional linear
regression model, and discuss the properties of M-estimator when the penalty
term is the local linear approximation. In fact, M-estimation method is a
framework, which covers the methods of the least absolute deviation, the
quantile regression, least squares regression and Huber regression. We show
that the proposed estimator possesses the good properties by applying certain
assumptions. In the part of numerical simulation, we select the appropriate
algorithm to show the good robustness of this method
|
math.PR math.ST stat.TH
|
we mainly study the mestimation method for the highdimensional linear regression model and discuss the properties of mestimator when the penalty term is the local linear approximation in fact mestimation method is a framework which covers the methods of the least absolute deviation the quantile regression least squares regression and huber regression we show that the proposed estimator possesses the good properties by applying certain assumptions in the part of numerical simulation we select the appropriate algorithm to show the good robustness of this method
|
[['we', 'mainly', 'study', 'the', 'mestimation', 'method', 'for', 'the', 'highdimensional', 'linear', 'regression', 'model', 'and', 'discuss', 'the', 'properties', 'of', 'mestimator', 'when', 'the', 'penalty', 'term', 'is', 'the', 'local', 'linear', 'approximation', 'in', 'fact', 'mestimation', 'method', 'is', 'a', 'framework', 'which', 'covers', 'the', 'methods', 'of', 'the', 'least', 'absolute', 'deviation', 'the', 'quantile', 'regression', 'least', 'squares', 'regression', 'and', 'huber', 'regression', 'we', 'show', 'that', 'the', 'proposed', 'estimator', 'possesses', 'the', 'good', 'properties', 'by', 'applying', 'certain', 'assumptions', 'in', 'the', 'part', 'of', 'numerical', 'simulation', 'we', 'select', 'the', 'appropriate', 'algorithm', 'to', 'show', 'the', 'good', 'robustness', 'of', 'this', 'method']]
|
[-0.038547878690502226, -0.08922477351392016, -0.1538243108374231, 0.12132314648068346, -0.06529213751063627, -0.16235381370848592, 0.02527382363400915, 0.4028927088879487, -0.31311935667386825, -0.2705244002808981, 0.14394920042387266, -0.26958839416175207, -0.22082110354129006, 0.16034766818835017, -0.12246342955485863, 0.14170840665259782, 0.07401476565967588, -0.012564037389615004, -0.10951884328387677, -0.32965534067548374, 0.2755813011680456, 0.04422288474572055, 0.2942917702116949, -0.026749606014174573, 0.1564275417367325, 0.05111592075075297, -0.050654077973655044, 0.036550736858728616, -0.11496162613184424, 0.14631930129492984, 0.23490216135978698, 0.12227950530017123, 0.4059466348413159, -0.28526088012491957, -0.20707145074711125, 0.123040638173766, 0.06298259891131346, 0.0698286463985877, 0.0028282188783016276, -0.22178490902571119, 0.08061965201050043, -0.1401611654307036, -0.122097421662115, -0.12326695749207454, -0.10311594953870072, 0.032313763807692075, -0.3660107704646447, 0.1354050497907926, 0.09890039634945638, 0.05272505584118121, -0.0521358811570441, -0.18149875843459193, 0.025058762493598112, 0.008241755229434655, 0.11484626528724809, -0.016444922712467173, 0.07352211485233377, -0.11767715837991358, -0.07055709577877732, 0.3189452843631015, -0.10112606674939503, -0.22921053399331867, 0.14081310499459504, -0.11713923150673508, -0.13417877436560743, 0.08225048932739917, 0.21166064850986005, 0.13158651840708713, -0.14897065503224868, 0.10898825798923259, -0.09381509575554553, 0.131695444136858, -0.015618030058548732, -0.050724230745040316, 0.07981971177984687, 0.2076089746044839, 0.11722422877107473, 0.13610238637775182, -0.14145120526116123, -0.06186141813283458, -0.3465223345467273, -0.1205069460796521, -0.2123171394362169, -0.07386510591296588, -0.18028743418775883, -0.20688585397951742, 0.4105515017338535, 0.19057134161977207, 0.17853228653616765, 0.12316535796887954, 0.3329325472169063, 0.1449049029389725, 0.024262067193494125, 0.10292508424643208, 0.23848305435522515, 0.1527849863803781, -0.028402892615207856, -0.2700188658035853, 0.09796539735980332, 0.1098915101850734]
|
1,803.04363
|
Information of Epileptic Mechanism and its Systemic Change-points in a
Zebrafish's Brain-wide Calcium Imaging Video Data
|
The epileptic mechanism is postulated as that an animal's neurons gradually
diminish their inhibition function coupled with enhanced excitation when an
epileptic event is approaching. Calcium imaging technique is designed to
directly record brain-wide neurons activity in order to discover the underlying
epileptic mechanism. In this paper, using one brain-wide calcium imaging video
of Zebrafish, we compute dynamic pattern information of the epileptic
mechanism, and devise three graphical displays to show the visible functional
aspect of epileptic mechanism over five inter-ictal periods. The foundation of
our data-driven computations for such dynamic patterns relies on one universal
phenomenon discovered across 696 informative pixels. This universality is that
each pixel's progressive 5-percentile process oscillates in an irregular
fashion at first, but, after the middle point of inter-ictal period, the
oscillation is replaced by a steady increasing trend. Such dynamic patterns are
collectively transformed into a visible systemic change-point as an early
warning signal (EWS) of an incoming epileptic event. We conclude through the
graphic displays that pattern information extracted from the calcium imaging
video realistically reveals the Zebrafish's authentic epileptic mechanism.
|
q-bio.NC
|
the epileptic mechanism is postulated as that an animals neurons gradually diminish their inhibition function coupled with enhanced excitation when an epileptic event is approaching calcium imaging technique is designed to directly record brainwide neurons activity in order to discover the underlying epileptic mechanism in this paper using one brainwide calcium imaging video of zebrafish we compute dynamic pattern information of the epileptic mechanism and devise three graphical displays to show the visible functional aspect of epileptic mechanism over five interictal periods the foundation of our datadriven computations for such dynamic patterns relies on one universal phenomenon discovered across 696 informative pixels this universality is that each pixels progressive 5percentile process oscillates in an irregular fashion at first but after the middle point of interictal period the oscillation is replaced by a steady increasing trend such dynamic patterns are collectively transformed into a visible systemic changepoint as an early warning signal ews of an incoming epileptic event we conclude through the graphic displays that pattern information extracted from the calcium imaging video realistically reveals the zebrafishs authentic epileptic mechanism
|
[['the', 'epileptic', 'mechanism', 'is', 'postulated', 'as', 'that', 'an', 'animals', 'neurons', 'gradually', 'diminish', 'their', 'inhibition', 'function', 'coupled', 'with', 'enhanced', 'excitation', 'when', 'an', 'epileptic', 'event', 'is', 'approaching', 'calcium', 'imaging', 'technique', 'is', 'designed', 'to', 'directly', 'record', 'brainwide', 'neurons', 'activity', 'in', 'order', 'to', 'discover', 'the', 'underlying', 'epileptic', 'mechanism', 'in', 'this', 'paper', 'using', 'one', 'brainwide', 'calcium', 'imaging', 'video', 'of', 'zebrafish', 'we', 'compute', 'dynamic', 'pattern', 'information', 'of', 'the', 'epileptic', 'mechanism', 'and', 'devise', 'three', 'graphical', 'displays', 'to', 'show', 'the', 'visible', 'functional', 'aspect', 'of', 'epileptic', 'mechanism', 'over', 'five', 'interictal', 'periods', 'the', 'foundation', 'of', 'our', 'datadriven', 'computations', 'for', 'such', 'dynamic', 'patterns', 'relies', 'on', 'one', 'universal', 'phenomenon', 'discovered', 'across', '696', 'informative', 'pixels', 'this', 'universality', 'is', 'that', 'each', 'pixels', 'progressive', '5percentile', 'process', 'oscillates', 'in', 'an', 'irregular', 'fashion', 'at', 'first', 'but', 'after', 'the', 'middle', 'point', 'of', 'interictal', 'period', 'the', 'oscillation', 'is', 'replaced', 'by', 'a', 'steady', 'increasing', 'trend', 'such', 'dynamic', 'patterns', 'are', 'collectively', 'transformed', 'into', 'a', 'visible', 'systemic', 'changepoint', 'as', 'an', 'early', 'warning', 'signal', 'ews', 'of', 'an', 'incoming', 'epileptic', 'event', 'we', 'conclude', 'through', 'the', 'graphic', 'displays', 'that', 'pattern', 'information', 'extracted', 'from', 'the', 'calcium', 'imaging', 'video', 'realistically', 'reveals', 'the', 'zebrafishs', 'authentic', 'epileptic', 'mechanism']]
|
[-0.10239046696426995, 0.1433241448952624, -0.08733760234128077, 0.08863645223637638, -0.07626168672162381, -0.15416541995396943, 0.041472458976825825, 0.4056548339189187, -0.278389610314161, -0.27886825909817153, 0.08909849763724932, -0.29123856785548247, -0.2597642683717056, 0.16336520340586647, -0.08652806899567878, -0.007253267275813046, 0.0691501314299223, 0.0681586190011729, 0.03771435566576135, -0.1858139200884263, 0.22448259382770303, 0.056124832273985445, 0.336297849741283, -0.01674397999232405, 0.12169650850786168, 0.0023278832432991835, -0.05463095006661809, -0.07057789455984165, -0.05458184736652471, 0.08327916042429259, 0.30707349941485007, 0.1864056655096565, 0.29625859394868354, -0.4554747399465924, -0.22989621339889055, 0.0869014741096834, 0.19209570467754614, 0.09281163951846394, -0.0314215378544105, -0.3103471798769962, 0.08485187171141517, -0.1134690160423601, -0.08369307588456261, -0.018865690064313035, 0.03389157832526926, -0.016821483148162494, -0.2890459814774699, 0.11289631090325754, 0.02316408889143194, 0.14315347267534542, -0.08065840294401506, -0.0209019201430963, -0.01934906671979998, 0.16970559935333349, 0.03549893886769639, 0.03647456589819382, 0.19612945318535974, -0.12935984940948278, -0.11943518077912793, 0.28289246328928497, -0.04575941812873588, -0.07925825030305829, 0.1698893564386984, -0.10700880855994216, -0.10551465630418166, 0.19564151333833343, 0.17891017921933422, 0.08825654004637697, -0.18378391085374704, -0.08405732757345187, 0.0016003220127581545, 0.2219775571598046, 0.060780347607443844, 0.015131590502033157, 0.23627633974479323, 0.2552210329181588, -0.0035428654312893875, 0.14320334632033377, -0.170646342756279, -0.06134684478047858, -0.2198928058548998, -0.09131531634275132, -0.12436842960776405, 0.003253577626310289, -0.102680433415883, -0.18229223549460177, 0.4393660581639309, 0.15095877160286802, 0.20134429074300642, 0.03146467360866052, 0.28089423004663394, 0.06750930124158668, 0.09997940255079504, 0.013753448766028362, 0.18409696858104194, 0.051579824862007594, 0.156909760735861, -0.21960429767842582, 0.15081890899258968, 0.027140696232175725]
|
1,803.04364
|
Maturation Trajectories of Cortical Resting-State Networks Depend on the
Mediating Frequency Band
|
The functional significance of resting state networks and their abnormal
manifestations in psychiatric disorders are firmly established, as is the
importance of the cortical rhythms in mediating these networks. Resting state
networks are known to undergo substantial reorganization from childhood to
adulthood, but whether distinct cortical rhythms, which are generated by
separable neural mechanisms and are often manifested abnormally in psychiatric
conditions, mediate maturation differentially, remains unknown. Using
magnetoencephalography (MEG) to map frequency band specific maturation of
resting state networks from age 7 to 29 in 162 participants (31 independent),
we found significant changes with age in networks mediated by the beta
(13-30Hz) and gamma (31-80Hz) bands. More specifically, gamma band mediated
networks followed an expected asymptotic trajectory, but beta band mediated
networks followed a linear trajectory. Network integration increased with age
in gamma band mediated networks, while local segregation increased with age in
beta band mediated networks. Spatially, the hubs that changed in importance
with age in the beta band mediated networks had relatively little overlap with
those that showed the greatest changes in the gamma band mediated networks.
These findings are relevant for our understanding of the neural mechanisms of
cortical maturation, in both typical and atypical development.
|
q-bio.NC cs.DM stat.ML
|
the functional significance of resting state networks and their abnormal manifestations in psychiatric disorders are firmly established as is the importance of the cortical rhythms in mediating these networks resting state networks are known to undergo substantial reorganization from childhood to adulthood but whether distinct cortical rhythms which are generated by separable neural mechanisms and are often manifested abnormally in psychiatric conditions mediate maturation differentially remains unknown using magnetoencephalography meg to map frequency band specific maturation of resting state networks from age 7 to 29 in 162 participants 31 independent we found significant changes with age in networks mediated by the beta 1330hz and gamma 3180hz bands more specifically gamma band mediated networks followed an expected asymptotic trajectory but beta band mediated networks followed a linear trajectory network integration increased with age in gamma band mediated networks while local segregation increased with age in beta band mediated networks spatially the hubs that changed in importance with age in the beta band mediated networks had relatively little overlap with those that showed the greatest changes in the gamma band mediated networks these findings are relevant for our understanding of the neural mechanisms of cortical maturation in both typical and atypical development
|
[['the', 'functional', 'significance', 'of', 'resting', 'state', 'networks', 'and', 'their', 'abnormal', 'manifestations', 'in', 'psychiatric', 'disorders', 'are', 'firmly', 'established', 'as', 'is', 'the', 'importance', 'of', 'the', 'cortical', 'rhythms', 'in', 'mediating', 'these', 'networks', 'resting', 'state', 'networks', 'are', 'known', 'to', 'undergo', 'substantial', 'reorganization', 'from', 'childhood', 'to', 'adulthood', 'but', 'whether', 'distinct', 'cortical', 'rhythms', 'which', 'are', 'generated', 'by', 'separable', 'neural', 'mechanisms', 'and', 'are', 'often', 'manifested', 'abnormally', 'in', 'psychiatric', 'conditions', 'mediate', 'maturation', 'differentially', 'remains', 'unknown', 'using', 'magnetoencephalography', 'meg', 'to', 'map', 'frequency', 'band', 'specific', 'maturation', 'of', 'resting', 'state', 'networks', 'from', 'age', '7', 'to', '29', 'in', '162', 'participants', '31', 'independent', 'we', 'found', 'significant', 'changes', 'with', 'age', 'in', 'networks', 'mediated', 'by', 'the', 'beta', '1330hz', 'and', 'gamma', '3180hz', 'bands', 'more', 'specifically', 'gamma', 'band', 'mediated', 'networks', 'followed', 'an', 'expected', 'asymptotic', 'trajectory', 'but', 'beta', 'band', 'mediated', 'networks', 'followed', 'a', 'linear', 'trajectory', 'network', 'integration', 'increased', 'with', 'age', 'in', 'gamma', 'band', 'mediated', 'networks', 'while', 'local', 'segregation', 'increased', 'with', 'age', 'in', 'beta', 'band', 'mediated', 'networks', 'spatially', 'the', 'hubs', 'that', 'changed', 'in', 'importance', 'with', 'age', 'in', 'the', 'beta', 'band', 'mediated', 'networks', 'had', 'relatively', 'little', 'overlap', 'with', 'those', 'that', 'showed', 'the', 'greatest', 'changes', 'in', 'the', 'gamma', 'band', 'mediated', 'networks', 'these', 'findings', 'are', 'relevant', 'for', 'our', 'understanding', 'of', 'the', 'neural', 'mechanisms', 'of', 'cortical', 'maturation', 'in', 'both', 'typical', 'and', 'atypical', 'development']]
|
[-0.11759691486532584, 0.2110986120428101, 0.010020170497209435, 0.0989876842329683, -0.021405917252508, -0.1620898421341083, 0.09183079889514531, 0.4461173312926684, -0.27480417618885483, -0.31173775343440774, 0.04310335329736141, -0.2657076955815269, -0.2652494308992637, 0.1619001248230537, -0.047347488601438024, -0.01738026895268698, 0.07033631586789559, 0.025321144789382063, 0.025520438514179504, -0.15871197700081863, 0.2767184076223974, 0.05821061854467097, 0.30819359999338186, 0.029592143710363995, 0.016872767514238756, -0.061479829095369865, -0.03624568088274129, -0.022181483583567155, -0.07294846947736758, 0.10817181555540453, 0.31574099793479865, 0.08984929365025818, 0.30084702137368496, -0.4746515742136222, -0.2549755890298672, 0.1361813006571005, 0.16344017960775567, 0.03640856053927123, -0.01635984584932848, -0.3402032033971574, 0.0628817885732831, -0.15247942536429623, -0.0821050487698592, -0.012792109079644873, 0.05318223631463362, -0.013002200961122383, -0.2340278497407909, 0.1729574959438219, -0.003097909588526671, 0.13353289871928142, -0.10506769648289797, -0.1287027179613954, -0.09454585864053418, 0.18544035672558226, 0.09677105745350038, 0.04945987994392224, 0.2092534251337062, -0.17610857991332357, -0.12593209566466154, 0.29050639372864606, -0.026536726604469797, -0.11002959862628933, 0.22318670306486463, -0.14067818553215175, -0.14097370543738244, 0.14483561702695855, 0.1669569815217395, 0.02627224073630071, -0.16401018122048822, -0.021407112040594596, 0.0930020141749257, 0.20154353911339334, 0.05798265420022712, 0.03309792939766376, 0.18723554485665653, 0.2301144046718349, -0.026322032401404072, 0.052753859608801024, -0.10570490381661614, -0.0806561976911105, -0.20781518925790382, -0.0744907094243293, -0.1391047904164427, 0.04487593136633737, -0.08191715153798489, -0.15017863542471796, 0.4133469263618492, 0.0581958191599397, 0.17566635636283517, 0.0478787845867272, 0.15811050376435037, 0.04859799972142686, 0.12349749493737225, 0.08383672242405626, 0.24280756770755457, 0.12751091335961276, 0.10870732682300825, -0.21356634938627284, 0.1604450667286386, -0.04151978832963534]
|
1,803.04365
|
The stochastic Cauchy problem driven by a cylindrical Levy process
|
In this work, we derive sufficient and necessary conditions for the existence
of a weak and mild solution of an abstract stochastic Cauchy problem driven by
an arbitrary cylindrical Levy process. Our approach requires to establish a
stochastic Fubini result for stochastic integrals with respect to cylindrical
Levy processes. This approach enables us to conclude that the solution process
has almost surely scalarly square integrable paths. Further properties of the
solution such as the Markov property and stochastic continuity are derived.
|
math.PR
|
in this work we derive sufficient and necessary conditions for the existence of a weak and mild solution of an abstract stochastic cauchy problem driven by an arbitrary cylindrical levy process our approach requires to establish a stochastic fubini result for stochastic integrals with respect to cylindrical levy processes this approach enables us to conclude that the solution process has almost surely scalarly square integrable paths further properties of the solution such as the markov property and stochastic continuity are derived
|
[['in', 'this', 'work', 'we', 'derive', 'sufficient', 'and', 'necessary', 'conditions', 'for', 'the', 'existence', 'of', 'a', 'weak', 'and', 'mild', 'solution', 'of', 'an', 'abstract', 'stochastic', 'cauchy', 'problem', 'driven', 'by', 'an', 'arbitrary', 'cylindrical', 'levy', 'process', 'our', 'approach', 'requires', 'to', 'establish', 'a', 'stochastic', 'fubini', 'result', 'for', 'stochastic', 'integrals', 'with', 'respect', 'to', 'cylindrical', 'levy', 'processes', 'this', 'approach', 'enables', 'us', 'to', 'conclude', 'that', 'the', 'solution', 'process', 'has', 'almost', 'surely', 'scalarly', 'square', 'integrable', 'paths', 'further', 'properties', 'of', 'the', 'solution', 'such', 'as', 'the', 'markov', 'property', 'and', 'stochastic', 'continuity', 'are', 'derived']]
|
[-0.09591746462486041, 0.06079023588703152, -0.10122234367386058, 0.07333669948764757, -0.09805826428576292, -0.10510458437334975, 0.017322983595623093, 0.3761262249109554, -0.33337701621672344, -0.21447914623566272, 0.1499954822378371, -0.21561901519695917, -0.17225763242530787, 0.17449619973158856, -0.09520639103756827, 0.1215007929533812, 0.0697028867147265, -0.019317994141422302, -0.035019466207926106, -0.21412912170966097, 0.34040778185922527, 0.03983157278716932, 0.24473368893894884, 0.01472793545079544, 0.1941881578223044, 0.013504598496688737, -0.0397893124760163, -0.01779704547866627, -0.19235494763945749, 0.08118047252337644, 0.19623780393122156, 0.10572242458569414, 0.3154201532518606, -0.4374232006972127, -0.16794089954576374, 0.1477387947789221, 0.12015351853592114, 0.08130399763216208, -0.041602336054230915, -0.30630684637085154, 0.0952418824588811, -0.12750359288888213, -0.2608742606136258, -0.10474258817784074, 0.013774386837066692, 0.06369811938615677, -0.35938344704976055, 0.07071987772647889, 0.1771318842369465, -0.0025028617776654384, -0.10160687562354186, -0.039652632302202194, 0.023431053606471346, 0.07657974419172531, 0.058684687646835994, -0.008403905845580645, 0.06134666121323352, -0.051146371111871654, -0.13366813150113793, 0.30337608607922806, -0.09401753060893374, -0.2807860489313801, 0.1897116769478875, -0.09924833297752488, -0.1448217618773565, 0.16669310205673546, 0.1276717398626109, 0.1490553332446718, -0.25126045289230936, 0.14492423010682456, -0.043044403155138834, 0.08544720006089106, 0.05748184245470681, 0.019104438023296772, 0.11713472159901335, 0.15386140197630466, 0.20482615528651227, 0.17568635742789435, -0.00012518465518951416, -0.1628685284026519, -0.3382771412416557, -0.17877914794479255, -0.12539530529376167, 0.12835984890935598, -0.12560120996976715, -0.24678559687540488, 0.3077721689859359, 0.16090815647700688, 0.1511969553122734, 0.13044353256025065, 0.20524151050658138, 0.19492961082501153, -0.05945025128024964, 0.0483980370271537, 0.14676789113860808, 0.19868075345746344, 0.13671728112033488, -0.16181486999949463, 0.08525810863845694, 0.11576759516847906]
|
1,803.04366
|
On pressure estimates for the Navier-Stokes equations
|
This paper presents a simple, general technique to prove finite element
method (FEM) pressure stability and convergence. Typically, pressure estimates
are ignored in the literature. However, full reliability of a numerical method
is not established unless the solution pair $(u,p)$ is treated. The simplicity
of the proposed technique puts pressure estimates within reach of many existing
and future numerical methods and lends itself to the numerical analyst's
toolbox.
|
math.NA
|
this paper presents a simple general technique to prove finite element method fem pressure stability and convergence typically pressure estimates are ignored in the literature however full reliability of a numerical method is not established unless the solution pair up is treated the simplicity of the proposed technique puts pressure estimates within reach of many existing and future numerical methods and lends itself to the numerical analysts toolbox
|
[['this', 'paper', 'presents', 'a', 'simple', 'general', 'technique', 'to', 'prove', 'finite', 'element', 'method', 'fem', 'pressure', 'stability', 'and', 'convergence', 'typically', 'pressure', 'estimates', 'are', 'ignored', 'in', 'the', 'literature', 'however', 'full', 'reliability', 'of', 'a', 'numerical', 'method', 'is', 'not', 'established', 'unless', 'the', 'solution', 'pair', 'up', 'is', 'treated', 'the', 'simplicity', 'of', 'the', 'proposed', 'technique', 'puts', 'pressure', 'estimates', 'within', 'reach', 'of', 'many', 'existing', 'and', 'future', 'numerical', 'methods', 'and', 'lends', 'itself', 'to', 'the', 'numerical', 'analysts', 'toolbox']]
|
[-0.07661969033891664, -0.022346982376321274, -0.11309816063765217, 0.028166644749409685, -0.10337646062116083, -0.13160255862235584, 0.06151357538457138, 0.3783586533904514, -0.2773875408148503, -0.2827113961102441, 0.14071887023986646, -0.22128424810601727, -0.10037741733386236, 0.2604786762693787, -0.0759812093593235, 0.12015830297433935, 0.1103155171526048, -0.001968250164816923, -0.10095962786512888, -0.2581813242012525, 0.23820586357375279, 0.07066416028229629, 0.2970906396067756, 0.11076053801704855, 0.06998171549810864, -0.06174121044493992, -0.07858714537338957, 0.05709478365572389, -0.14596421051015462, 0.11817445934695356, 0.26248758145854534, 0.13576360264286289, 0.3744795622632784, -0.4003780286978273, -0.23811290165245094, 0.06981926734614022, 0.16339123022386476, 0.12753378941937732, -0.09029726446126862, -0.24762554899515474, 0.12891048719842835, -0.1927591370391276, -0.1908851733759922, -0.14513397120240637, -0.06811013856135748, 0.01627958466483773, -0.3051304232726312, 0.10070314611691762, 0.05980930341619944, 0.050237567629665136, -0.0534768905969994, -0.11226278666564372, 0.029142231680452824, 0.08209368589279406, 0.07314217992483035, 0.01100522473536651, 0.10128007316961884, -0.04586658688768854, -0.047820644525071496, 0.39578927306951406, -0.025542049476986423, -0.2376581098908312, 0.21135807663941866, -0.11892000213265419, -0.10917595825295019, 0.15057587993386037, 0.1490432680310572, 0.1354657466222039, -0.155371253255426, 0.11410068339575767, 0.0011751678334001232, 0.15790581825079725, 0.02359686260152718, -0.04018729414554614, 0.12165019395487274, 0.21353243969326072, 0.09018595591923632, 0.087202986010679, -0.021330752642825246, -0.08511719410307705, -0.31359332284944896, -0.13817345917991855, -0.17040573517956278, -0.052486814137142464, -0.0758835031029936, -0.19526858101872838, 0.3281671784147072, 0.2232062476413215, 0.10669093448942636, 0.06372173001770587, 0.39903272360885134, 0.13378888582947718, 0.031245732844314155, 0.09219477730049916, 0.2569862015559064, 0.16136033624506502, 0.09632464603740065, -0.20812404654262698, 0.09374303367461406, 0.10516022303251221]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.