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.08167
|
A Staggered Explicit-Implicit Finite Element Formulation for
Electroactive Polymers
|
Electroactive polymers such as dielectric elastomers (DEs) have attracted
significant attention in recent years. Computational techniques to solve the
coupled electromechanical system of equations for this class of materials have
universally centered around fully coupled monolithic formulations, which while
generating good accuracy requires significant computational expense. However,
this has significantly hindered the ability to solve large scale, fully
three-dimensional problems involving complex deformations and electromechanical
instabilities of DEs. In this work, we provide theoretical basis for the
effectiveness and accuracy of staggered explicit-implicit finite element
formulations for this class of electromechanically coupled materials, and
elicit the simplicity of the resulting staggered formulation. We demonstrate
the stability and accuracy of the staggered approach by solving complex
electromechanically coupled problems involving electroactive polymers, where we
focus on problems involving electromechanical instabilities such as creasing,
wrinkling, and bursting drops. In all examples, essentially identical results
to the fully monolithic solution are obtained, showing the accuracy of the
staggered approach at a significantly reduced computational cost.
|
physics.comp-ph
|
electroactive polymers such as dielectric elastomers des have attracted significant attention in recent years computational techniques to solve the coupled electromechanical system of equations for this class of materials have universally centered around fully coupled monolithic formulations which while generating good accuracy requires significant computational expense however this has significantly hindered the ability to solve large scale fully threedimensional problems involving complex deformations and electromechanical instabilities of des in this work we provide theoretical basis for the effectiveness and accuracy of staggered explicitimplicit finite element formulations for this class of electromechanically coupled materials and elicit the simplicity of the resulting staggered formulation we demonstrate the stability and accuracy of the staggered approach by solving complex electromechanically coupled problems involving electroactive polymers where we focus on problems involving electromechanical instabilities such as creasing wrinkling and bursting drops in all examples essentially identical results to the fully monolithic solution are obtained showing the accuracy of the staggered approach at a significantly reduced computational cost
|
[['electroactive', 'polymers', 'such', 'as', 'dielectric', 'elastomers', 'des', 'have', 'attracted', 'significant', 'attention', 'in', 'recent', 'years', 'computational', 'techniques', 'to', 'solve', 'the', 'coupled', 'electromechanical', 'system', 'of', 'equations', 'for', 'this', 'class', 'of', 'materials', 'have', 'universally', 'centered', 'around', 'fully', 'coupled', 'monolithic', 'formulations', 'which', 'while', 'generating', 'good', 'accuracy', 'requires', 'significant', 'computational', 'expense', 'however', 'this', 'has', 'significantly', 'hindered', 'the', 'ability', 'to', 'solve', 'large', 'scale', 'fully', 'threedimensional', 'problems', 'involving', 'complex', 'deformations', 'and', 'electromechanical', 'instabilities', 'of', 'des', 'in', 'this', 'work', 'we', 'provide', 'theoretical', 'basis', 'for', 'the', 'effectiveness', 'and', 'accuracy', 'of', 'staggered', 'explicitimplicit', 'finite', 'element', 'formulations', 'for', 'this', 'class', 'of', 'electromechanically', 'coupled', 'materials', 'and', 'elicit', 'the', 'simplicity', 'of', 'the', 'resulting', 'staggered', 'formulation', 'we', 'demonstrate', 'the', 'stability', 'and', 'accuracy', 'of', 'the', 'staggered', 'approach', 'by', 'solving', 'complex', 'electromechanically', 'coupled', 'problems', 'involving', 'electroactive', 'polymers', 'where', 'we', 'focus', 'on', 'problems', 'involving', 'electromechanical', 'instabilities', 'such', 'as', 'creasing', 'wrinkling', 'and', 'bursting', 'drops', 'in', 'all', 'examples', 'essentially', 'identical', 'results', 'to', 'the', 'fully', 'monolithic', 'solution', 'are', 'obtained', 'showing', 'the', 'accuracy', 'of', 'the', 'staggered', 'approach', 'at', 'a', 'significantly', 'reduced', 'computational', 'cost']]
|
[-0.09962319076222217, 0.07813522863678957, -0.0085720663321101, -0.035320135948742615, -0.07857685299147564, -0.15671192592349087, -0.0070493907623142464, 0.3705271243025767, -0.25473643474591273, -0.33178123617314814, 0.09087373415815908, -0.2609835173532275, -0.17264307664281883, 0.1999979798256615, -0.06364607995801409, 0.1278576327568311, 0.10192893778353378, -0.07894256700927615, -0.08147348519479339, -0.2424655327297471, 0.2531014236795463, 0.024480149632802716, 0.317467256023744, 0.06608692072274416, 0.12935793995900355, -0.05663654057130815, 0.027344422524128064, 0.08346319214849054, -0.09932936879484282, 0.14628352610578324, 0.28420527413901353, 0.0051571191892165824, 0.3040918684966954, -0.48875074884221875, -0.2570391381159425, 0.07098096826567923, 0.14991307059406406, 0.13615902903113214, -0.07171181283882577, -0.24117867414333663, 0.07793858584180405, -0.16464854594331557, -0.13161621127208625, -0.1409743827923115, -0.028483674220487844, 0.033498526219189466, -0.24429796721188374, 0.09465458796842506, 0.04793593383474666, 0.08283207455741955, -0.052748353896018715, -0.13550985078571687, 0.008404618494189631, 0.062311333152867944, 0.04046426018280334, 0.00810243890988698, 0.10160296683970058, -0.16204010725975682, -0.11539537622305898, 0.42382808433224756, -0.023752504320136834, -0.2322580745547182, 0.23262712260690965, -0.05697762746547843, -0.1338796235109323, 0.16565836092779113, 0.22718025877910816, 0.13786859115597183, -0.10835929692113473, 0.0904758610100813, 0.025411606744725118, 0.1810117114254814, 0.05217586705794581, 0.03950053800966729, 0.1717245904268858, 0.25046550193485334, 0.03594066875837283, 0.1347338573584609, -0.002942846385175707, -0.135419884157643, -0.2103459914042442, -0.1280412751905344, -0.15098580006397916, 0.018810996167752662, -0.08247578517779246, -0.20855168725743337, 0.3833091488498964, 0.15547400329658692, 0.09868852086767646, 0.06313243372161746, 0.2752572173643627, 0.08203377446337937, 0.07218031542459043, 0.027685511165965394, 0.27735648038013794, 0.11554807613684255, 0.12306073195887385, -0.2798883955470102, 0.016221044229395274, 0.056839717293365136]
|
1,803.08168
|
Neutron Energy Dependence of Delayed Neutron Yields and its Assessments
|
Incident neutron energy dependence of delayed neutron yields of uranium and
plutonium isotopes is investigated. A summation calculation of decay and
fission yield data is employed, and the energy dependence of the latter part is
considered in a phenomenological way. Our calculation systematically reproduces
the energy dependence of delayed neutron yields by introducing an energy
dependence of the most probable charge and the odd-even effect. The calculated
fission yields are assessed by comparison with JENDL/FPY-2011, delayed neutron
activities, and decay heats. Although the fission yields in this work are
optimized to delayed neutron yields, the calculated decay heats are in good
agreement with the experimental data. Comparison of the fission yields
calculated in this work and JENDL/FPY-2011 gave an important insight for the
evaluation of the next JENDL nuclear data.
|
nucl-th
|
incident neutron energy dependence of delayed neutron yields of uranium and plutonium isotopes is investigated a summation calculation of decay and fission yield data is employed and the energy dependence of the latter part is considered in a phenomenological way our calculation systematically reproduces the energy dependence of delayed neutron yields by introducing an energy dependence of the most probable charge and the oddeven effect the calculated fission yields are assessed by comparison with jendlfpy2011 delayed neutron activities and decay heats although the fission yields in this work are optimized to delayed neutron yields the calculated decay heats are in good agreement with the experimental data comparison of the fission yields calculated in this work and jendlfpy2011 gave an important insight for the evaluation of the next jendl nuclear data
|
[['incident', 'neutron', 'energy', 'dependence', 'of', 'delayed', 'neutron', 'yields', 'of', 'uranium', 'and', 'plutonium', 'isotopes', 'is', 'investigated', 'a', 'summation', 'calculation', 'of', 'decay', 'and', 'fission', 'yield', 'data', 'is', 'employed', 'and', 'the', 'energy', 'dependence', 'of', 'the', 'latter', 'part', 'is', 'considered', 'in', 'a', 'phenomenological', 'way', 'our', 'calculation', 'systematically', 'reproduces', 'the', 'energy', 'dependence', 'of', 'delayed', 'neutron', 'yields', 'by', 'introducing', 'an', 'energy', 'dependence', 'of', 'the', 'most', 'probable', 'charge', 'and', 'the', 'oddeven', 'effect', 'the', 'calculated', 'fission', 'yields', 'are', 'assessed', 'by', 'comparison', 'with', 'jendlfpy2011', 'delayed', 'neutron', 'activities', 'and', 'decay', 'heats', 'although', 'the', 'fission', 'yields', 'in', 'this', 'work', 'are', 'optimized', 'to', 'delayed', 'neutron', 'yields', 'the', 'calculated', 'decay', 'heats', 'are', 'in', 'good', 'agreement', 'with', 'the', 'experimental', 'data', 'comparison', 'of', 'the', 'fission', 'yields', 'calculated', 'in', 'this', 'work', 'and', 'jendlfpy2011', 'gave', 'an', 'important', 'insight', 'for', 'the', 'evaluation', 'of', 'the', 'next', 'jendl', 'nuclear', 'data']]
|
[-0.04650419140307349, 0.16078865892836802, -0.10620437835314078, 0.13011073896359449, -0.02350229055264208, -0.059796470326546114, 0.04965299258401501, 0.3412385903066024, -0.1801554227467932, -0.33719971470418386, -0.03172602892118448, -0.3311928998591611, 0.008014758728677407, 0.23627575740101747, 0.035082938089999516, 0.017932190036844986, 0.10534921672660857, 0.08068424894554482, -0.10516767542503658, -0.16794186051720317, 0.30505133376391314, 0.17447636561701074, 0.2648107199202059, 0.10139320688904263, 0.042989350199604814, 0.02072031691113807, -0.06887767182342941, -0.05731647104403237, -0.16648056560734403, 0.09061454010225134, 0.245149657028378, 0.07057285495466203, 0.13814987107252819, -0.44091797569126356, -0.1936376556986943, 0.09624412633274915, 0.119661392771377, 0.11048164651583647, -0.1462376013660105, -0.1978416894125985, 0.05101098690829531, -0.23073948040837422, -0.11339425413825666, -0.09720439939701464, 0.021450060877668875, 0.08677754986274522, -0.293324091246177, 0.11319156677654973, 0.007296880110516213, 0.019666461506858468, -0.14026439315603056, -0.209591529564932, -0.026028063641206245, 0.07523479102383135, 0.1259694848286017, 0.02000588466762565, 0.1722688433364965, -0.06957816288013419, -0.080642867305869, 0.376477102690842, -0.028323887842816475, -0.09140308942806996, 0.06390452725463547, -0.15141913009938435, -0.09651323402795242, 0.22071303003758658, 0.05434072655043565, 0.12790216400753707, -0.18379082772298716, 0.00402483141169796, 0.017889967406517826, 0.17665672432667634, 0.07243772639412782, 0.051798579211606466, 0.15091962307633366, 0.2612408664808754, -0.059175965576287126, 0.14083522821601946, -0.134798794042581, -0.13590284231759142, -0.29875853149496834, -0.09578311986842891, -0.11814202635650872, 0.038135860464535654, -0.05185243908567827, -0.116255291641437, 0.39088110689772293, 0.03343614008190343, 0.1770938860681781, -0.011045404093238176, 0.27404499135445803, 0.1418014935852625, 0.04834772007779975, 0.01644752446372877, 0.31052345820535265, 0.19627043280706857, 0.10780861758030369, -0.32449679125602415, 0.14746459131856682, -0.004156085353315575]
|
1,803.08169
|
Financial Contagion in a Generalized Stochastic Block Model
|
One of the most defining features of the global financial network is its
inherent complex and intertwined structure. From the perspective of systemic
risk it is important to understand the influence of this network structure on
default contagion. Using sparse random graphs to model the financial network,
asymptotic methods turned out powerful to analytically describe the contagion
process and to make statements about resilience. So far, however, they have
been limited to so-called {\em rank one} models in which informally the only
network parameter is the degree sequence (see (Amini et. al. 2016) and
(Detering et. al. 2019) for example) and the contagion process can be described
by a one dimensional fix-point equation. These networks fail to account for a
pronounced block structure such as core/periphery or a network composed of
different connected blocks for different countries. We present a much more
general model here, where we distinguish vertices (institutions) of different
types and let edge probabilities and exposures depend on the types of both, the
receiving and the sending vertex plus additional parameters. Our main result
allows to compute explicitly the systemic damage caused by some initial local
shock event, and we derive a complete characterisation of resilient
respectively non-resilient financial systems. This is the first instance that
default contagion is rigorously studied in a model outside the class of rank
one models and several technical challenges arise. Moreover, in contrast to
previous work, in which networks could be classified as resilient or non
resilient, independent of the distribution of the shock, information about the
shock becomes important in our model and a more refined resilience condition
arises. Among other applications of our theory we derive resilience conditions
for the global network based on subnetwork conditions only.
|
q-fin.RM math.PR
|
one of the most defining features of the global financial network is its inherent complex and intertwined structure from the perspective of systemic risk it is important to understand the influence of this network structure on default contagion using sparse random graphs to model the financial network asymptotic methods turned out powerful to analytically describe the contagion process and to make statements about resilience so far however they have been limited to socalled em rank one models in which informally the only network parameter is the degree sequence see amini et al 2016 and detering et al 2019 for example and the contagion process can be described by a one dimensional fixpoint equation these networks fail to account for a pronounced block structure such as coreperiphery or a network composed of different connected blocks for different countries we present a much more general model here where we distinguish vertices institutions of different types and let edge probabilities and exposures depend on the types of both the receiving and the sending vertex plus additional parameters our main result allows to compute explicitly the systemic damage caused by some initial local shock event and we derive a complete characterisation of resilient respectively nonresilient financial systems this is the first instance that default contagion is rigorously studied in a model outside the class of rank one models and several technical challenges arise moreover in contrast to previous work in which networks could be classified as resilient or non resilient independent of the distribution of the shock information about the shock becomes important in our model and a more refined resilience condition arises among other applications of our theory we derive resilience conditions for the global network based on subnetwork conditions only
|
[['one', 'of', 'the', 'most', 'defining', 'features', 'of', 'the', 'global', 'financial', 'network', 'is', 'its', 'inherent', 'complex', 'and', 'intertwined', 'structure', 'from', 'the', 'perspective', 'of', 'systemic', 'risk', 'it', 'is', 'important', 'to', 'understand', 'the', 'influence', 'of', 'this', 'network', 'structure', 'on', 'default', 'contagion', 'using', 'sparse', 'random', 'graphs', 'to', 'model', 'the', 'financial', 'network', 'asymptotic', 'methods', 'turned', 'out', 'powerful', 'to', 'analytically', 'describe', 'the', 'contagion', 'process', 'and', 'to', 'make', 'statements', 'about', 'resilience', 'so', 'far', 'however', 'they', 'have', 'been', 'limited', 'to', 'socalled', 'em', 'rank', 'one', 'models', 'in', 'which', 'informally', 'the', 'only', 'network', 'parameter', 'is', 'the', 'degree', 'sequence', 'see', 'amini', 'et', 'al', '2016', 'and', 'detering', 'et', 'al', '2019', 'for', 'example', 'and', 'the', 'contagion', 'process', 'can', 'be', 'described', 'by', 'a', 'one', 'dimensional', 'fixpoint', 'equation', 'these', 'networks', 'fail', 'to', 'account', 'for', 'a', 'pronounced', 'block', 'structure', 'such', 'as', 'coreperiphery', 'or', 'a', 'network', 'composed', 'of', 'different', 'connected', 'blocks', 'for', 'different', 'countries', 'we', 'present', 'a', 'much', 'more', 'general', 'model', 'here', 'where', 'we', 'distinguish', 'vertices', 'institutions', 'of', 'different', 'types', 'and', 'let', 'edge', 'probabilities', 'and', 'exposures', 'depend', 'on', 'the', 'types', 'of', 'both', 'the', 'receiving', 'and', 'the', 'sending', 'vertex', 'plus', 'additional', 'parameters', 'our', 'main', 'result', 'allows', 'to', 'compute', 'explicitly', 'the', 'systemic', 'damage', 'caused', 'by', 'some', 'initial', 'local', 'shock', 'event', 'and', 'we', 'derive', 'a', 'complete', 'characterisation', 'of', 'resilient', 'respectively', 'nonresilient', 'financial', 'systems', 'this', 'is', 'the', 'first', 'instance', 'that', 'default', 'contagion', 'is', 'rigorously', 'studied', 'in', 'a', 'model', 'outside', 'the', 'class', 'of', 'rank', 'one', 'models', 'and', 'several', 'technical', 'challenges', 'arise', 'moreover', 'in', 'contrast', 'to', 'previous', 'work', 'in', 'which', 'networks', 'could', 'be', 'classified', 'as', 'resilient', 'or', 'non', 'resilient', 'independent', 'of', 'the', 'distribution', 'of', 'the', 'shock', 'information', 'about', 'the', 'shock', 'becomes', 'important', 'in', 'our', 'model', 'and', 'a', 'more', 'refined', 'resilience', 'condition', 'arises', 'among', 'other', 'applications', 'of', 'our', 'theory', 'we', 'derive', 'resilience', 'conditions', 'for', 'the', 'global', 'network', 'based', 'on', 'subnetwork', 'conditions', 'only']]
|
[-0.09862479602655182, 0.04383518234404771, -0.0627165906243221, 0.10006982151008276, -0.09044998095740762, -0.15648001172167705, 0.05372114017206643, 0.3653852706223415, -0.27377076202213363, -0.28754369559850324, 0.11903831402597566, -0.25828006031939427, -0.20538986280953142, 0.15258115890698723, -0.08620230380838367, 0.02448064159137077, 0.04763017190930203, 0.031501811239479, 0.010578790185113117, -0.2609453671198105, 0.3371870905746631, 0.06400247223335334, 0.2654859226493924, 0.03377660529733431, 0.07990993779535545, 8.092728282814969e-05, -0.04745142634646506, 0.04584023289103385, -0.1143664353717419, 0.12236081678963848, 0.2643479001938776, 0.1546944921273397, 0.3173858607731409, -0.45273556990568437, -0.24969965007272954, 0.13483079923284386, 0.08409174092970659, 0.10286713192368799, 0.05497145673285647, -0.2933328442992675, 0.0793149264505821, -0.21102651379089227, -0.12223461091105473, -0.06543444143364835, 0.031037443147920306, 0.009355740278118812, -0.2761806924630667, 0.050967277350546694, 0.0869660307134044, 0.0297288015624346, -0.004596015475146823, -0.1048205327773986, -0.05969182954929146, 0.1496929364337323, 0.029047741494074082, -0.0037132609876534715, 0.13141967748772054, -0.12754763256976376, -0.11746494524941037, 0.35684791486872564, 0.004659830698036047, -0.15798149254409927, 0.21185281627767583, -0.08512585175804509, -0.17670725241225563, 0.09694651635331247, 0.20675094895862295, 0.08808167521190385, -0.15587075175421364, 0.029139555521409365, -0.03886536219342245, 0.137667937626298, 0.06889574337533257, 0.030400541259944503, 0.15761395097582015, 0.1742563314073904, 0.08332350009602887, 0.12045558331512363, -0.051580627998483175, -0.11079405224517001, -0.258449507306106, -0.09776635493155089, -0.14535469405323864, 0.04443443743820312, -0.11510915875397153, -0.16607855236358968, 0.43115733608681356, 0.17891543016112685, 0.19699724622959927, 0.028473784593388257, 0.2813560779819765, 0.09365876896009953, 0.05107669708503975, 0.10384572638589759, 0.20390779084904453, 0.10342704289339691, 0.07513601032737967, -0.12544017000438626, 0.16128629142132941, 0.041857931962502856]
|
1,803.0817
|
Mislearning from Censored Data: The Gambler's Fallacy and Other
Correlational Mistakes in Optimal-Stopping Problems
|
I study endogenous learning dynamics for people who misperceive intertemporal
correlations in random sequences. Biased agents face an optimal-stopping
problem. They are uncertain about the underlying distribution and learn its
parameters from predecessors. Agents stop when early draws are "good enough,"
so predecessors' experiences contain negative streaks but not positive streaks.
When agents wrongly expect systematic reversals (the "gambler's fallacy"), they
understate the likelihood of consecutive below-average draws, converge to
over-pessimistic beliefs about the distribution's mean, and stop too early.
Agents uncertain about the distribution's variance overestimate it to an extent
that depends on predecessors' stopping thresholds. I also analyze how other
misperceptions of intertemporal correlation interact with endogenous data
censoring.
|
q-fin.EC cs.GT econ.TH
|
i study endogenous learning dynamics for people who misperceive intertemporal correlations in random sequences biased agents face an optimalstopping problem they are uncertain about the underlying distribution and learn its parameters from predecessors agents stop when early draws are good enough so predecessors experiences contain negative streaks but not positive streaks when agents wrongly expect systematic reversals the gamblers fallacy they understate the likelihood of consecutive belowaverage draws converge to overpessimistic beliefs about the distributions mean and stop too early agents uncertain about the distributions variance overestimate it to an extent that depends on predecessors stopping thresholds i also analyze how other misperceptions of intertemporal correlation interact with endogenous data censoring
|
[['i', 'study', 'endogenous', 'learning', 'dynamics', 'for', 'people', 'who', 'misperceive', 'intertemporal', 'correlations', 'in', 'random', 'sequences', 'biased', 'agents', 'face', 'an', 'optimalstopping', 'problem', 'they', 'are', 'uncertain', 'about', 'the', 'underlying', 'distribution', 'and', 'learn', 'its', 'parameters', 'from', 'predecessors', 'agents', 'stop', 'when', 'early', 'draws', 'are', 'good', 'enough', 'so', 'predecessors', 'experiences', 'contain', 'negative', 'streaks', 'but', 'not', 'positive', 'streaks', 'when', 'agents', 'wrongly', 'expect', 'systematic', 'reversals', 'the', 'gamblers', 'fallacy', 'they', 'understate', 'the', 'likelihood', 'of', 'consecutive', 'belowaverage', 'draws', 'converge', 'to', 'overpessimistic', 'beliefs', 'about', 'the', 'distributions', 'mean', 'and', 'stop', 'too', 'early', 'agents', 'uncertain', 'about', 'the', 'distributions', 'variance', 'overestimate', 'it', 'to', 'an', 'extent', 'that', 'depends', 'on', 'predecessors', 'stopping', 'thresholds', 'i', 'also', 'analyze', 'how', 'other', 'misperceptions', 'of', 'intertemporal', 'correlation', 'interact', 'with', 'endogenous', 'data', 'censoring']]
|
[-0.040660664677323606, 0.14770439681411848, -0.12653474378484217, 0.19361403010446918, -0.1728193159299818, -0.21409914532507007, 0.09781917940126732, 0.4544751215048812, -0.29378946071321316, -0.2966172677210786, 0.08794482266107066, -0.34624700739302416, -0.11132922753564675, 0.0655504554086788, -0.1904907572083175, -0.01846441346358254, 0.10454572030046785, 0.05931984139818021, 0.04538672287017107, -0.35605994833802634, 0.2530704088096338, 0.08348640787669204, 0.2461727800652046, -0.06812210207572207, 0.0926100750644268, 0.0186748840179379, -0.052100228941576045, -0.015642268617044795, -0.10804455291687522, 0.04531039605657993, 0.26569042695178224, 0.19593399555253035, 0.37221580136736687, -0.45658051131123845, -0.13751509813168508, 0.1709634451978755, 0.14317860409024763, 0.06966542986390943, 0.021141716466412285, -0.2972211453216997, 0.020273639354854822, -0.13997372071766717, -0.08829771998253735, -0.0328934590882537, 0.05595635521140965, 0.0918471077676672, -0.2750549261373552, 0.08087147971355907, 0.0602445690781513, 0.07582860996269367, -0.028303464549720627, -0.16994987909936093, -0.01634734787724235, 0.1832291718641169, 0.14562368414957416, -0.05187867291335186, 0.20151100389405407, -0.19638600893191654, -0.1122434202153024, 0.31299442206932737, 0.015094600812616673, -0.19225834259255367, 0.17238742918919095, -0.14701719083399936, -0.11692142479640262, 0.1348768055015667, 0.1993831359442662, 0.08702238345603373, -0.11607683091133367, -0.03367435355268588, -0.017469156692227858, 0.19266652210022917, 0.08025138969109817, 0.002434729255566543, 0.231341841022103, 0.07968277032698759, 0.11865683079443194, 0.001541198295308277, -0.015004608684896746, -0.1869170286650346, -0.22986452774229374, -0.031530573422258554, -0.13797749816016716, 0.06025469880352664, -0.11408764337671032, -0.1619700215477761, 0.28559383912519976, 0.2427123873028904, 0.1938297906975177, 0.10327779434367337, 0.24516974660483273, 0.05032487083861435, 0.00760742951375009, 0.10387544192966412, 0.1928228620746681, 0.04999723311841742, 0.1033987405244261, -0.19626038985284552, 0.2576538937589662, -0.05321072463623502]
|
1,803.08171
|
Emotional Attachment Framework for People-Oriented Software
|
In organizational and commercial settings, people often have clear roles and
workflows against which functional and non-functional requirements can be
extracted. However, in more social settings, such as platforms for enhancing
social interaction, successful applications are driven more by using emotional
engagement than functionality, and the drivers of user engagement are difficult
to identify. A key challenge is to understand people's emotional goals so that
they can be incorporated into the design. This paper proposes a novel framework
called the Emotional Attachment Framework, which is based on existing models
and theories of emotional attachment. Its aim is to facilitate the process of
getting a deeper insight into emotional goals in software engineering. To
demonstrate the framework in use, emotional goals are elicited for a software
application that aims to provide help for homeless people. To measure the
effectiveness and efficiency of the proposed technique in this study, a series
of evaluations are undertaken: a semi-controlled experiment, a comparison
analysis, and domain expert and end-user evaluation. The results indicate that
the Emotional Attachment Framework has the potential to give better insight
during analysis of emotional goals.
|
cs.SE
|
in organizational and commercial settings people often have clear roles and workflows against which functional and nonfunctional requirements can be extracted however in more social settings such as platforms for enhancing social interaction successful applications are driven more by using emotional engagement than functionality and the drivers of user engagement are difficult to identify a key challenge is to understand peoples emotional goals so that they can be incorporated into the design this paper proposes a novel framework called the emotional attachment framework which is based on existing models and theories of emotional attachment its aim is to facilitate the process of getting a deeper insight into emotional goals in software engineering to demonstrate the framework in use emotional goals are elicited for a software application that aims to provide help for homeless people to measure the effectiveness and efficiency of the proposed technique in this study a series of evaluations are undertaken a semicontrolled experiment a comparison analysis and domain expert and enduser evaluation the results indicate that the emotional attachment framework has the potential to give better insight during analysis of emotional goals
|
[['in', 'organizational', 'and', 'commercial', 'settings', 'people', 'often', 'have', 'clear', 'roles', 'and', 'workflows', 'against', 'which', 'functional', 'and', 'nonfunctional', 'requirements', 'can', 'be', 'extracted', 'however', 'in', 'more', 'social', 'settings', 'such', 'as', 'platforms', 'for', 'enhancing', 'social', 'interaction', 'successful', 'applications', 'are', 'driven', 'more', 'by', 'using', 'emotional', 'engagement', 'than', 'functionality', 'and', 'the', 'drivers', 'of', 'user', 'engagement', 'are', 'difficult', 'to', 'identify', 'a', 'key', 'challenge', 'is', 'to', 'understand', 'peoples', 'emotional', 'goals', 'so', 'that', 'they', 'can', 'be', 'incorporated', 'into', 'the', 'design', 'this', 'paper', 'proposes', 'a', 'novel', 'framework', 'called', 'the', 'emotional', 'attachment', 'framework', 'which', 'is', 'based', 'on', 'existing', 'models', 'and', 'theories', 'of', 'emotional', 'attachment', 'its', 'aim', 'is', 'to', 'facilitate', 'the', 'process', 'of', 'getting', 'a', 'deeper', 'insight', 'into', 'emotional', 'goals', 'in', 'software', 'engineering', 'to', 'demonstrate', 'the', 'framework', 'in', 'use', 'emotional', 'goals', 'are', 'elicited', 'for', 'a', 'software', 'application', 'that', 'aims', 'to', 'provide', 'help', 'for', 'homeless', 'people', 'to', 'measure', 'the', 'effectiveness', 'and', 'efficiency', 'of', 'the', 'proposed', 'technique', 'in', 'this', 'study', 'a', 'series', 'of', 'evaluations', 'are', 'undertaken', 'a', 'semicontrolled', 'experiment', 'a', 'comparison', 'analysis', 'and', 'domain', 'expert', 'and', 'enduser', 'evaluation', 'the', 'results', 'indicate', 'that', 'the', 'emotional', 'attachment', 'framework', 'has', 'the', 'potential', 'to', 'give', 'better', 'insight', 'during', 'analysis', 'of', 'emotional', 'goals']]
|
[-0.04117070113652912, 0.03894427963519854, -0.11162158570558582, 0.10176155567344959, -0.14647985671067348, -0.15614013804588467, 0.052519306552747606, 0.43574234469206596, -0.18890445196160252, -0.35493702835241414, 0.05951755746386682, -0.2715549391603259, -0.23126899248555952, 0.19902257185490074, -0.10547949359802854, 0.03111007824602142, 0.0627267439039829, 0.024999156464100055, 0.030630087250281813, -0.2615347083799703, 0.31268878319124466, 0.06416910803249187, 0.3592533366919151, 0.11201799092573904, 0.048243155925656145, -0.022019468653762368, -0.05387460068374386, -0.009305965169045046, -0.07572877588968961, 0.2044865186224975, 0.3766007410543985, 0.24780518586656242, 0.4035564865714506, -0.45536450771412446, -0.20457876612604392, 0.04081277738062098, 0.13260494611661314, 0.05680153865250759, -0.03974105175486487, -0.35148261913665285, 0.09839618828403257, -0.2072378550795332, -0.06600140915100422, -0.1489852781384758, -0.02486430227588204, 0.014951207123332373, -0.25834610064655705, -0.02913695500019062, 0.059497989542053445, 0.10757286147639641, -0.05471588217757096, -0.09724048050829089, 0.006970670792962546, 0.24480732894786025, 0.06754333255973863, 0.013906215309322326, 0.18073871132978442, -0.17499110690803957, -0.17429658779418905, 0.4047802010976264, 0.0006990143936728482, -0.19469031648781232, 0.23674189238606588, -0.057825661309913776, -0.1412720014239945, 0.07966601451018664, 0.27086342049195716, 0.04680826002731919, -0.20654221923272734, -0.030413391675962055, 0.03398969945113134, 0.19902385386091698, 0.013834524586222276, 0.008722928367838587, 0.20513011918165316, 0.2459406499426974, 0.05349800558684839, 0.11986900064537463, 0.0280672659092765, -0.08138171357891026, -0.21428526252882718, -0.18515921091033227, -0.12164098821560164, -0.010775635668086697, -0.033579603740414, -0.09060780544330002, 0.4131151479985261, 0.21356196978392647, 0.14234009357270502, 0.03075153796817176, 0.3144239714450162, 0.033054180478084956, 0.06674255471000873, 0.022098034751884963, 0.16546635002241997, 0.008484118619336463, 0.16684903882939936, -0.16732963347179897, 0.1805658239375233, 0.00995917633459296]
|
1,803.08172
|
Coexistence of Triple Nodal Points, Nodal Links, and Unusual Flat Bands
in intermetallic ${\cal A}$Pd$_3$ (${\cal A}$=Pb, Sn)
|
We investigate the electronic structure and several properties, and
topological character, of the cubic time-reversal invariant intermetallic
compounds PbPd$_3$ and SnPd$_3$ using density functional theory based methods.
These compounds have a dispersionless band along the $\Gamma-X$ line, forming
the top of the Pd $4d$ bands and lying within a few meV of the Fermi level
$E_F$. Effects of the flat band on transport and optical properties have been
inspected by varying the doping concentration treated with the virtual crystal
approximation for substitution on the Pb site. In the absence of spin-orbit
coupling (SOC), we find triple nodal points and three-dimensional nodal loops,
which are known to lead to surface bands and drumhead states, respectively,
which we discuss for PbPd$_3$. SOC removes degeneracy in most of the zone,
providing a topological index $Z_2$=1 on the $k_z=0$ plane that indicates a
topological character on that plane. The isovalent and isostructural compound
SnPd$_3$ shows only minor differences in its electronic structures, so it is
expected to display similar electronic, transport, and topological properties.
|
cond-mat.mtrl-sci
|
we investigate the electronic structure and several properties and topological character of the cubic timereversal invariant intermetallic compounds pbpd_3 and snpd_3 using density functional theory based methods these compounds have a dispersionless band along the gammax line forming the top of the pd 4d bands and lying within a few mev of the fermi level e_f effects of the flat band on transport and optical properties have been inspected by varying the doping concentration treated with the virtual crystal approximation for substitution on the pb site in the absence of spinorbit coupling soc we find triple nodal points and threedimensional nodal loops which are known to lead to surface bands and drumhead states respectively which we discuss for pbpd_3 soc removes degeneracy in most of the zone providing a topological index z_21 on the k_z0 plane that indicates a topological character on that plane the isovalent and isostructural compound snpd_3 shows only minor differences in its electronic structures so it is expected to display similar electronic transport and topological properties
|
[['we', 'investigate', 'the', 'electronic', 'structure', 'and', 'several', 'properties', 'and', 'topological', 'character', 'of', 'the', 'cubic', 'timereversal', 'invariant', 'intermetallic', 'compounds', 'pbpd_3', 'and', 'snpd_3', 'using', 'density', 'functional', 'theory', 'based', 'methods', 'these', 'compounds', 'have', 'a', 'dispersionless', 'band', 'along', 'the', 'gammax', 'line', 'forming', 'the', 'top', 'of', 'the', 'pd', '4d', 'bands', 'and', 'lying', 'within', 'a', 'few', 'mev', 'of', 'the', 'fermi', 'level', 'e_f', 'effects', 'of', 'the', 'flat', 'band', 'on', 'transport', 'and', 'optical', 'properties', 'have', 'been', 'inspected', 'by', 'varying', 'the', 'doping', 'concentration', 'treated', 'with', 'the', 'virtual', 'crystal', 'approximation', 'for', 'substitution', 'on', 'the', 'pb', 'site', 'in', 'the', 'absence', 'of', 'spinorbit', 'coupling', 'soc', 'we', 'find', 'triple', 'nodal', 'points', 'and', 'threedimensional', 'nodal', 'loops', 'which', 'are', 'known', 'to', 'lead', 'to', 'surface', 'bands', 'and', 'drumhead', 'states', 'respectively', 'which', 'we', 'discuss', 'for', 'pbpd_3', 'soc', 'removes', 'degeneracy', 'in', 'most', 'of', 'the', 'zone', 'providing', 'a', 'topological', 'index', 'z_21', 'on', 'the', 'k_z0', 'plane', 'that', 'indicates', 'a', 'topological', 'character', 'on', 'that', 'plane', 'the', 'isovalent', 'and', 'isostructural', 'compound', 'snpd_3', 'shows', 'only', 'minor', 'differences', 'in', 'its', 'electronic', 'structures', 'so', 'it', 'is', 'expected', 'to', 'display', 'similar', 'electronic', 'transport', 'and', 'topological', 'properties']]
|
[-0.202633224293051, 0.12757977982281696, -0.029824135460363454, 0.053191035296571584, -0.03700511254519589, -0.1358557976950633, 0.13968243282667014, 0.4045768818630085, -0.2673543898135575, -0.2769796164020481, 0.0004596046897223646, -0.3490785724730287, -0.14680665459326772, 0.15767208985557937, 0.042783272273734026, 0.010273433607057613, -0.02300376341543553, -0.04593644407367423, -0.1421091302427048, -0.20681925725994116, 0.3289525470197066, 0.009829610953646073, 0.2985006746350709, 0.09296015259411455, 0.007660481629259211, 0.00026197333578917997, 0.11396058915037079, 0.022962980011635156, -0.13204961005748736, 0.1162429565703356, 0.2419947218500549, -0.10447318456977246, 0.1501767327125375, -0.4112374569031309, -0.2165840370861073, -0.02607679484111919, 0.08422265214710889, 0.09652405550720237, -0.06357914077241468, -0.2924176663025675, 0.08528091040361359, -0.11869805979792096, -0.12469182527870927, -0.08593749227170575, -0.017864640782508684, -0.000794519204646349, -0.14485166285429654, 0.07279708522024105, 0.04430620166815324, 0.12692875817350774, -0.1079420795606685, -0.15865828623400485, -0.17363236470608018, 0.06252380191483142, 0.052822809165669046, 0.011387194468428, 0.11092979532241519, -0.08510629881274359, -0.10143705389563398, 0.42586993991049477, -0.036770014468221424, -0.1302629447393456, 0.1895617185671062, -0.17821752094714172, -0.12776457587627313, 0.1685071590732424, 0.130475854343687, 0.07392619329039007, -0.07112927652414361, 0.14318109303818038, -0.011001012443020626, 0.16847081625615304, 0.05170763685530702, 0.10160154316305037, 0.2459269854722612, 0.13317531230578938, 0.05182413608452911, 0.10653584641236138, -0.16114062171833343, -0.05339126285244094, -0.22672452979597701, -0.19677076105544544, -0.1953673752428717, 0.04703656543068677, -0.04047608661178867, -0.23688077610771519, 0.4462305770384664, 0.08581857376869387, 0.20151014279445117, -0.07930839973563575, 0.15568118308480067, 0.11768403685306682, 0.09537932444195521, 0.06703643848648272, 0.24920528493989932, 0.14352994744738856, 0.04770266386702746, -0.25311533270785247, 0.05704440193879137, 0.0508323119496029]
|
1,803.08173
|
Clear and Cloudy Exoplanet Forecasts for JWST: Maps, Retrieved
Composition and Constraints on Formation with MIRI and NIRCam
|
The James Webb Space Telescope (JWST) will measure exoplanet transmission and
eclipse spectroscopy at un-precedented precisions to better understand planet
structure, dynamics, chemistry and formation. These are essential tools on the
march towards biosignature searches on potentially habitable planets. We
explore a range of exoplanet atmospheric conditions and forecast the expected
results with JWST. We take realistic CHIMERA models that match existing Spitzer
and HST results and simulate the spectra achievable with the JWST MIRI + NIRCam
Guaranteed Time Observations (GTO) survey. We then retrieve atmospheric
parameters from these spectra to estimate the precision to which the planets'
atmospheric compositions can be measured. We find that emission spectra have
well-constrained unimodal solutions but transmission spectra near 10X solar
abundance and solar C/O ratios can suffer from bimodal solutions. Broad
wavelength coverage as well as higher precision data can resolve bimodal
solutions and provide dramatically better atmospheric parameter constraints. We
find that metallicities can be measured to within 20% to 170%, which approaches
the precisions on Solar System planets, and C/O ratios can be constrained to
~10% to 60%, assuming that observers can leverage short wavelength data to
select the correct solution from the bimodal posteriors. These compositional
precisions are sufficient to validate or refute predictions from disk formation
models on final atmospheric abundances as long as their history is not erased
by planet evolution processes. We also show the extent to which eclipse mapping
with JWST is possible on our brightest system HD 189733 b.
|
astro-ph.EP
|
the james webb space telescope jwst will measure exoplanet transmission and eclipse spectroscopy at unprecedented precisions to better understand planet structure dynamics chemistry and formation these are essential tools on the march towards biosignature searches on potentially habitable planets we explore a range of exoplanet atmospheric conditions and forecast the expected results with jwst we take realistic chimera models that match existing spitzer and hst results and simulate the spectra achievable with the jwst miri nircam guaranteed time observations gto survey we then retrieve atmospheric parameters from these spectra to estimate the precision to which the planets atmospheric compositions can be measured we find that emission spectra have wellconstrained unimodal solutions but transmission spectra near 10x solar abundance and solar co ratios can suffer from bimodal solutions broad wavelength coverage as well as higher precision data can resolve bimodal solutions and provide dramatically better atmospheric parameter constraints we find that metallicities can be measured to within 20 to 170 which approaches the precisions on solar system planets and co ratios can be constrained to 10 to 60 assuming that observers can leverage short wavelength data to select the correct solution from the bimodal posteriors these compositional precisions are sufficient to validate or refute predictions from disk formation models on final atmospheric abundances as long as their history is not erased by planet evolution processes we also show the extent to which eclipse mapping with jwst is possible on our brightest system hd 189733 b
|
[['the', 'james', 'webb', 'space', 'telescope', 'jwst', 'will', 'measure', 'exoplanet', 'transmission', 'and', 'eclipse', 'spectroscopy', 'at', 'unprecedented', 'precisions', 'to', 'better', 'understand', 'planet', 'structure', 'dynamics', 'chemistry', 'and', 'formation', 'these', 'are', 'essential', 'tools', 'on', 'the', 'march', 'towards', 'biosignature', 'searches', 'on', 'potentially', 'habitable', 'planets', 'we', 'explore', 'a', 'range', 'of', 'exoplanet', 'atmospheric', 'conditions', 'and', 'forecast', 'the', 'expected', 'results', 'with', 'jwst', 'we', 'take', 'realistic', 'chimera', 'models', 'that', 'match', 'existing', 'spitzer', 'and', 'hst', 'results', 'and', 'simulate', 'the', 'spectra', 'achievable', 'with', 'the', 'jwst', 'miri', 'nircam', 'guaranteed', 'time', 'observations', 'gto', 'survey', 'we', 'then', 'retrieve', 'atmospheric', 'parameters', 'from', 'these', 'spectra', 'to', 'estimate', 'the', 'precision', 'to', 'which', 'the', 'planets', 'atmospheric', 'compositions', 'can', 'be', 'measured', 'we', 'find', 'that', 'emission', 'spectra', 'have', 'wellconstrained', 'unimodal', 'solutions', 'but', 'transmission', 'spectra', 'near', '10x', 'solar', 'abundance', 'and', 'solar', 'co', 'ratios', 'can', 'suffer', 'from', 'bimodal', 'solutions', 'broad', 'wavelength', 'coverage', 'as', 'well', 'as', 'higher', 'precision', 'data', 'can', 'resolve', 'bimodal', 'solutions', 'and', 'provide', 'dramatically', 'better', 'atmospheric', 'parameter', 'constraints', 'we', 'find', 'that', 'metallicities', 'can', 'be', 'measured', 'to', 'within', '20', 'to', '170', 'which', 'approaches', 'the', 'precisions', 'on', 'solar', 'system', 'planets', 'and', 'co', 'ratios', 'can', 'be', 'constrained', 'to', '10', 'to', '60', 'assuming', 'that', 'observers', 'can', 'leverage', 'short', 'wavelength', 'data', 'to', 'select', 'the', 'correct', 'solution', 'from', 'the', 'bimodal', 'posteriors', 'these', 'compositional', 'precisions', 'are', 'sufficient', 'to', 'validate', 'or', 'refute', 'predictions', 'from', 'disk', 'formation', 'models', 'on', 'final', 'atmospheric', 'abundances', 'as', 'long', 'as', 'their', 'history', 'is', 'not', 'erased', 'by', 'planet', 'evolution', 'processes', 'we', 'also', 'show', 'the', 'extent', 'to', 'which', 'eclipse', 'mapping', 'with', 'jwst', 'is', 'possible', 'on', 'our', 'brightest', 'system', 'hd', '189733', 'b']]
|
[-0.02650107848019049, 0.13358896815019553, -0.06458955924751879, 0.11241576906468254, -0.12247923627012929, -0.11926087248711617, 0.06355008701068639, 0.43524000009323366, -0.2126382906295237, -0.40631753592522907, 0.125741858529614, -0.2793770351310711, -0.07495090940783036, 0.21008645651812405, -0.08379207012412139, 0.05810578643166857, 0.1549336625259278, -0.11301197667143853, -0.04608328450975947, -0.2890255317601497, 0.23001551066742842, 0.13766179338396245, 0.11825884589851456, -0.003645701344376888, 0.010841467220252227, -0.1158596782789558, -0.052523602177121785, -0.04564810629571944, -0.22365390275069227, 0.01838962376865818, 0.2902480273055293, 0.19541114649437674, 0.1518948509436116, -0.36990589059538165, -0.23822116923993683, 0.08195465839597717, 0.17728000997742696, 0.02185081809303021, 0.025815799921563996, -0.298904857895963, 0.05535374565592005, -0.14470617820940088, -0.15344111497521584, -0.058771084284135064, -0.008355717249138311, 0.016146430205630107, -0.29491203547680567, 0.023687306089592967, -0.03705904640822259, 0.10986071426543545, -0.15927343095030605, -0.14269468181236497, -0.09840505799234722, 0.13552716982667334, -0.04736831101978228, 0.013932090166757708, 0.14890417815224252, -0.07987854233942926, -0.04243438396952115, 0.402416426438426, -0.16395353823213182, -0.04503698630227906, 0.23937470594146212, -0.2413248284781909, -0.1278467955655556, 0.1464503694494583, 0.18849896889401324, 0.10477023767536414, -0.1541134105333543, -0.008063735407452694, -0.002632444266413079, 0.23460124557089732, 0.06585003334273141, 0.10789040947804365, 0.34664780822903163, 0.12644870176846468, 0.08933897635309773, 0.016465733073495296, -0.22962222030657328, -0.05048765416174066, -0.18539413040290115, -0.12146132246049152, -0.11504902206094111, 0.06756073450694694, -0.09817555503009391, -0.0798899801202275, 0.3421263369563662, 0.22679952408528703, 0.18003021171230624, 0.08420361457134933, 0.3304375101903789, 0.07500803588482086, 0.10464319201509781, 0.029191462880336357, 0.3081831969626126, 0.09660951913426034, 0.1265381878073953, -0.2096381333759665, 0.11424960706623455, -0.03683717446745236]
|
1,803.08174
|
Development of a Mach-Zehnder Modulator Photonic Local Oscillator Source
|
This paper describes the development of a photonic local oscillator (LO)
source based on a 3-stage Mach-Zehnder modulator (MZM) device. The MZM laser
synthesizer demonstrates the feasibility of providing the photonic reference LO
for the Atacama Large Millimeter Array telescope located in Chile. This MZM
approach to generating an LO by radio RF modulation of a monochromatic optical
source provides the merits of wide frequency coverage of 4-130 GHz, tuning
speed of about 0.2 seconds, and residual integrated phase noise performance of
0.3 degrees RMS at 100 GHz.
|
astro-ph.IM physics.optics
|
this paper describes the development of a photonic local oscillator lo source based on a 3stage machzehnder modulator mzm device the mzm laser synthesizer demonstrates the feasibility of providing the photonic reference lo for the atacama large millimeter array telescope located in chile this mzm approach to generating an lo by radio rf modulation of a monochromatic optical source provides the merits of wide frequency coverage of 4130 ghz tuning speed of about 02 seconds and residual integrated phase noise performance of 03 degrees rms at 100 ghz
|
[['this', 'paper', 'describes', 'the', 'development', 'of', 'a', 'photonic', 'local', 'oscillator', 'lo', 'source', 'based', 'on', 'a', '3stage', 'machzehnder', 'modulator', 'mzm', 'device', 'the', 'mzm', 'laser', 'synthesizer', 'demonstrates', 'the', 'feasibility', 'of', 'providing', 'the', 'photonic', 'reference', 'lo', 'for', 'the', 'atacama', 'large', 'millimeter', 'array', 'telescope', 'located', 'in', 'chile', 'this', 'mzm', 'approach', 'to', 'generating', 'an', 'lo', 'by', 'radio', 'rf', 'modulation', 'of', 'a', 'monochromatic', 'optical', 'source', 'provides', 'the', 'merits', 'of', 'wide', 'frequency', 'coverage', 'of', '4130', 'ghz', 'tuning', 'speed', 'of', 'about', '02', 'seconds', 'and', 'residual', 'integrated', 'phase', 'noise', 'performance', 'of', '03', 'degrees', 'rms', 'at', '100', 'ghz']]
|
[-0.21271930035965686, 0.1344521042683482, -0.022880834283899854, -0.056910317862110045, -0.05329639700093222, -0.15697707114106213, 0.06763215452056928, 0.46077079664577136, -0.1760234001558274, -0.3347233996557241, 0.0708092373666163, -0.24002736290408808, -0.05535918644587086, 0.2400758562937633, -0.0374739350835708, 0.027644772628925486, 0.05031862953712169, -0.14942869696427474, -0.03406667922205419, -0.14081498868340117, 0.15423146247419275, 0.16724138688931073, 0.3829841747964648, 0.0013092669912359931, 0.16552323072259736, -0.04192644079342823, -0.009217360760720278, -0.10735788093138994, -0.05841371468903327, 0.08376127676191655, 0.30049206177831034, 0.046139639167284426, 0.2538528364887249, -0.3407538360916078, -0.1571110587313094, 0.020085066009249367, 0.10640694651572796, 0.08885747320230374, 0.0035887103695131373, -0.33164285197430715, 0.043848892229355195, -0.19441652586895294, -0.1982485963751308, 0.0693171789065342, -0.016877643785185435, 0.010604458046145737, -0.207588798916814, 0.01696497136303647, -0.03631998288487508, 0.10442427254152294, 0.0008953652471642603, -0.12885726927991278, -0.0013140992655693976, 0.04516795418881388, -0.16414373363791543, 0.10015010431842794, 0.12754288694651966, -0.08366103351264345, -0.10818256943655963, 0.3161976413684897, -0.12136707717383449, -0.04245731060721234, 0.08886341178863817, -0.17097808759320865, -0.05129249768850224, 0.18572968316518448, 0.1977867339393759, 0.017959981207571796, -0.1348934583299772, 0.016219899735006038, 0.07332697127607059, 0.34048441460948775, 0.15728012274485081, 0.1772630658709783, 0.25456225224611856, 0.24597666177644648, 0.09195175239900974, 0.18783367836625653, -0.2513287077222644, -0.0024760986614803023, -0.30040209962647746, -0.08538666675502266, -0.1986437278524549, 0.06484277093444359, -0.10529999097856159, -0.13390420652417975, 0.4516492340375077, 0.1571153446063611, 0.09707842306868936, 0.026096116814931684, 0.37700022477656603, 0.06701054641003297, 0.08518394925208254, 0.010886608104390854, 0.28619571300011803, 0.12432197733009658, 0.15876751524840735, -0.2368767490763937, -0.050400998911672185, -0.05016310475978323]
|
1,803.08175
|
Limits on turbulent propagation of energy in cool-core clusters of
galaxies
|
We place constraints on the propagation velocity of bulk turbulence within
the intracluster medium of three clusters and an elliptical galaxy. Using
Reflection Grating Spectrometer measurements of turbulent line broadening, we
show that for these clusters, the 90% upper limit on turbulent velocities when
accounting for instrumental broadening is too low to propagate energy radially
to the cooling radius of the clusters within the required cooling time. In this
way, we extend previous Hitomi-based analysis on the Perseus cluster to more
clusters, with the intention of applying these results to a future, more
extensive catalog. These results constrain models of turbulent heating in AGN
feedback by requiring a mechanism which can not only provide sufficient energy
to offset radiative cooling, but resupply that energy rapidly enough to balance
cooling at each cluster radius.
|
astro-ph.HE astro-ph.GA
|
we place constraints on the propagation velocity of bulk turbulence within the intracluster medium of three clusters and an elliptical galaxy using reflection grating spectrometer measurements of turbulent line broadening we show that for these clusters the 90 upper limit on turbulent velocities when accounting for instrumental broadening is too low to propagate energy radially to the cooling radius of the clusters within the required cooling time in this way we extend previous hitomibased analysis on the perseus cluster to more clusters with the intention of applying these results to a future more extensive catalog these results constrain models of turbulent heating in agn feedback by requiring a mechanism which can not only provide sufficient energy to offset radiative cooling but resupply that energy rapidly enough to balance cooling at each cluster radius
|
[['we', 'place', 'constraints', 'on', 'the', 'propagation', 'velocity', 'of', 'bulk', 'turbulence', 'within', 'the', 'intracluster', 'medium', 'of', 'three', 'clusters', 'and', 'an', 'elliptical', 'galaxy', 'using', 'reflection', 'grating', 'spectrometer', 'measurements', 'of', 'turbulent', 'line', 'broadening', 'we', 'show', 'that', 'for', 'these', 'clusters', 'the', '90', 'upper', 'limit', 'on', 'turbulent', 'velocities', 'when', 'accounting', 'for', 'instrumental', 'broadening', 'is', 'too', 'low', 'to', 'propagate', 'energy', 'radially', 'to', 'the', 'cooling', 'radius', 'of', 'the', 'clusters', 'within', 'the', 'required', 'cooling', 'time', 'in', 'this', 'way', 'we', 'extend', 'previous', 'hitomibased', 'analysis', 'on', 'the', 'perseus', 'cluster', 'to', 'more', 'clusters', 'with', 'the', 'intention', 'of', 'applying', 'these', 'results', 'to', 'a', 'future', 'more', 'extensive', 'catalog', 'these', 'results', 'constrain', 'models', 'of', 'turbulent', 'heating', 'in', 'agn', 'feedback', 'by', 'requiring', 'a', 'mechanism', 'which', 'can', 'not', 'only', 'provide', 'sufficient', 'energy', 'to', 'offset', 'radiative', 'cooling', 'but', 'resupply', 'that', 'energy', 'rapidly', 'enough', 'to', 'balance', 'cooling', 'at', 'each', 'cluster', 'radius']]
|
[-0.0830959382989077, 0.15405498432786166, -0.0871557693568651, 0.06798972381335316, -0.10748614813377516, -0.05226618919352239, 0.08982638723241645, 0.44110524065256346, -0.20716165955121996, -0.35702485803190165, 0.05019828198551708, -0.23715808772778307, 0.028830490736502477, 0.23466375852215357, 0.019813730367318247, 0.0003154295299089316, 0.06520898407677922, -0.04155668144173405, -0.014471466852366135, -0.244044586314086, 0.2953786491160634, 0.14570759667902056, 0.21805443273941902, 0.03740473573491203, 0.03997473885079451, -0.08074176814019059, -0.057333567379056614, 0.015700417324710128, -0.16879178728380462, 0.055470662551339374, 0.20156818767428017, 0.07281890843120037, 0.2613878200451533, -0.4452432848823567, -0.2675841376397081, 0.07138954664255973, 0.2225727067592688, 0.09656255784934867, -0.05922103264729782, -0.2552387385318677, 0.05302879278160893, -0.17173183428398756, -0.15218310553763964, -0.006398419659076767, 0.006589194466924351, 0.03485838547816677, -0.2412177825762862, 0.13578971650338534, 0.0634418965571306, 0.02465474242004954, -0.1308374896444465, -0.061306236609887106, -0.04711476495404812, 0.07809097503570339, 0.0010649200165503178, 0.012612847356318856, 0.2184774328136083, -0.1365529369848611, 0.00813464577676672, 0.40283831283732346, -0.03815398237907864, -0.09459257185826021, 0.2051825264511122, -0.2130935269072352, -0.14085744426472846, 0.16727839492413102, 0.19853064865156106, 0.062835293358975, -0.14064805665299046, -0.041089346794857796, -0.018696176013415396, 0.208642870300647, 0.037557529931125995, 0.030995381225335277, 0.2439823902042752, 0.12039868134095079, 0.07982618121296224, 0.10255206442282845, -0.18774057973606625, -0.04916134153520971, -0.2801372300212582, -0.07997545784085312, -0.12100761444448974, 0.0427559919005558, -0.10446750936016817, -0.1136906435148734, 0.29971376370469277, 0.1692349869779057, 0.19585228273927263, 0.052485821580789474, 0.3529542362402109, 0.10215544734180157, 0.09705911311109296, 0.1554036040818601, 0.28632365227818035, 0.19119804379509084, 0.09055388045398462, -0.26505431487704767, 0.03467080511935902, -0.00237044835265613]
|
1,803.08176
|
Moduli identification methods in Type II compactifications
|
Recent work on four dimensional effective descriptions of the heterotic
string has identified the moduli of such systems as being given by kernels of
maps between ordinary Dolbeault cohomology groups. The maps involved are
defined by the supergravity data of the background solutions. Such structure is
seen both in the case of Calabi-Yau compactifications with non-trivial
constraints on moduli arising from the gauge bundle and in the case of some
non-Kahler compactifications of the theory. This description of the moduli has
allowed the explicit computation of the moduli stabilization effects of a wide
range of non-trivial gauge bundles on Calabi-Yau three-folds. In this paper we
examine to what extent the ideas and techniques used in this work can be
extended to the case of Type IIB string theory. Certain simplifications arise
in the Type IIB case in comparison to the heterotic situation. However,
complications also arise due to the richer supergravity data of the theory
inducing a more involved map structure. We illustrate our discussion with
several concrete examples of compactification of Type IIB string theory on
conformal CICY three-folds with flux.
|
hep-th
|
recent work on four dimensional effective descriptions of the heterotic string has identified the moduli of such systems as being given by kernels of maps between ordinary dolbeault cohomology groups the maps involved are defined by the supergravity data of the background solutions such structure is seen both in the case of calabiyau compactifications with nontrivial constraints on moduli arising from the gauge bundle and in the case of some nonkahler compactifications of the theory this description of the moduli has allowed the explicit computation of the moduli stabilization effects of a wide range of nontrivial gauge bundles on calabiyau threefolds in this paper we examine to what extent the ideas and techniques used in this work can be extended to the case of type iib string theory certain simplifications arise in the type iib case in comparison to the heterotic situation however complications also arise due to the richer supergravity data of the theory inducing a more involved map structure we illustrate our discussion with several concrete examples of compactification of type iib string theory on conformal cicy threefolds with flux
|
[['recent', 'work', 'on', 'four', 'dimensional', 'effective', 'descriptions', 'of', 'the', 'heterotic', 'string', 'has', 'identified', 'the', 'moduli', 'of', 'such', 'systems', 'as', 'being', 'given', 'by', 'kernels', 'of', 'maps', 'between', 'ordinary', 'dolbeault', 'cohomology', 'groups', 'the', 'maps', 'involved', 'are', 'defined', 'by', 'the', 'supergravity', 'data', 'of', 'the', 'background', 'solutions', 'such', 'structure', 'is', 'seen', 'both', 'in', 'the', 'case', 'of', 'calabiyau', 'compactifications', 'with', 'nontrivial', 'constraints', 'on', 'moduli', 'arising', 'from', 'the', 'gauge', 'bundle', 'and', 'in', 'the', 'case', 'of', 'some', 'nonkahler', 'compactifications', 'of', 'the', 'theory', 'this', 'description', 'of', 'the', 'moduli', 'has', 'allowed', 'the', 'explicit', 'computation', 'of', 'the', 'moduli', 'stabilization', 'effects', 'of', 'a', 'wide', 'range', 'of', 'nontrivial', 'gauge', 'bundles', 'on', 'calabiyau', 'threefolds', 'in', 'this', 'paper', 'we', 'examine', 'to', 'what', 'extent', 'the', 'ideas', 'and', 'techniques', 'used', 'in', 'this', 'work', 'can', 'be', 'extended', 'to', 'the', 'case', 'of', 'type', 'iib', 'string', 'theory', 'certain', 'simplifications', 'arise', 'in', 'the', 'type', 'iib', 'case', 'in', 'comparison', 'to', 'the', 'heterotic', 'situation', 'however', 'complications', 'also', 'arise', 'due', 'to', 'the', 'richer', 'supergravity', 'data', 'of', 'the', 'theory', 'inducing', 'a', 'more', 'involved', 'map', 'structure', 'we', 'illustrate', 'our', 'discussion', 'with', 'several', 'concrete', 'examples', 'of', 'compactification', 'of', 'type', 'iib', 'string', 'theory', 'on', 'conformal', 'cicy', 'threefolds', 'with', 'flux']]
|
[-0.1499260033776339, 0.06705222816486679, -0.04333556814318789, 0.13148483402059916, -0.10790054138319996, -0.11600416666920205, 0.005034654868822954, 0.3073716561084838, -0.2306400953285437, -0.27642891847062856, 0.13286357175349003, -0.24425413928015138, -0.19766257989609226, 0.18817363196477335, -0.150000132157072, -0.013421514649762885, 0.005460496234533551, 0.02287961656974813, -0.1292501388675441, -0.32893966233733896, 0.44586293607090527, 0.002472250153144929, 0.2805492481431709, 0.03591766686096869, 0.07001537161464752, -0.047095671450593866, -0.048454642205327685, -0.00420367693692282, -0.140144569885696, 0.19039295929366376, 0.29085071706264226, 0.07406571824461795, 0.10887320273304595, -0.46518582360471017, -0.2533441788035926, 0.15682038573732415, 0.13914848037273878, 0.13590341677331458, 0.0021677121060617666, -0.2669168330145652, 0.04492999971613984, -0.1565183677933189, -0.148964030971331, -0.08971879711364406, 0.001625961069514013, -0.018564522315640576, -0.17556341980637696, 0.005507902310685265, 0.02063724057042746, 0.08602452373316327, -0.06340279182480586, -0.06221357683055, -0.08454004061474864, 0.05261156447794657, 0.14489409473218065, 0.04068075923267035, 0.10223879757756879, -0.19355783512954797, -0.13502406541022707, 0.3820246093609667, -0.05059156199958134, -0.20567184509095418, 0.1513399094813964, -0.09810377646667454, -0.20048344168290086, 0.12634333511200416, 0.10912683418092246, 0.1889875018866835, -0.05187192830771392, 0.213992216040324, -0.04300235064219233, 0.08866432550744471, 0.0787545555133045, 0.05221066854390121, 0.1859257258935371, 0.14563420451768153, 0.02441734702845749, 0.12197121539201772, -0.03019956707862298, -0.12479422436924753, -0.43559266590375123, -0.10271982499334327, -0.052510328558887674, 0.1654787424051172, -0.13750735571039302, -0.1787726562316683, 0.3899496373884216, 0.07211900979802102, 0.2135204185608897, 0.04218749368721926, 0.17634334008127533, 0.0397365145144759, 0.0747157763740928, -0.023241326303712534, 0.2103562777899372, 0.18980331263750547, 0.07843253133207007, -0.17249552465548001, -0.09966785452970825, 0.17466222352839514]
|
1,803.08177
|
Viewport-Driven Rate-Distortion Optimized 360{\deg} Video Streaming
|
The growing popularity of virtual and augmented reality communications and
360{\deg} video streaming is moving video communication systems into much more
dynamic and resource-limited operating settings. The enormous data volume of
360{\deg} videos requires an efficient use of network bandwidth to maintain the
desired quality of experience for the end user. To this end, we propose a
framework for viewport-driven rate-distortion optimized 360{\deg} video
streaming that integrates the user view navigation pattern and the
spatiotemporal rate-distortion characteristics of the 360{\deg} video content
to maximize the delivered user quality of experience for the given
network/system resources. The framework comprises a methodology for
constructing dynamic heat maps that capture the likelihood of navigating
different spatial segments of a 360{\deg} video over time by the user, an
analysis and characterization of its spatiotemporal rate-distortion
characteristics that leverage preprocessed spatial tilling of the 360{\deg}
view sphere, and an optimization problem formulation that characterizes the
delivered user quality of experience given the user navigation patterns,
360{\deg} video encoding decisions, and the available system/network resources.
Our experimental results demonstrate the advantages of our framework over the
conventional approach of streaming a monolithic uniformly encoded 360{\deg}
video and a state-of-the-art reference method. Considerable video quality gains
of 4 - 5 dB are demonstrated in the case of two popular 4K 360{\deg} videos.
|
cs.MM
|
the growing popularity of virtual and augmented reality communications and 360deg video streaming is moving video communication systems into much more dynamic and resourcelimited operating settings the enormous data volume of 360deg videos requires an efficient use of network bandwidth to maintain the desired quality of experience for the end user to this end we propose a framework for viewportdriven ratedistortion optimized 360deg video streaming that integrates the user view navigation pattern and the spatiotemporal ratedistortion characteristics of the 360deg video content to maximize the delivered user quality of experience for the given networksystem resources the framework comprises a methodology for constructing dynamic heat maps that capture the likelihood of navigating different spatial segments of a 360deg video over time by the user an analysis and characterization of its spatiotemporal ratedistortion characteristics that leverage preprocessed spatial tilling of the 360deg view sphere and an optimization problem formulation that characterizes the delivered user quality of experience given the user navigation patterns 360deg video encoding decisions and the available systemnetwork resources our experimental results demonstrate the advantages of our framework over the conventional approach of streaming a monolithic uniformly encoded 360deg video and a stateoftheart reference method considerable video quality gains of 4 5 db are demonstrated in the case of two popular 4k 360deg videos
|
[['the', 'growing', 'popularity', 'of', 'virtual', 'and', 'augmented', 'reality', 'communications', 'and', '360deg', 'video', 'streaming', 'is', 'moving', 'video', 'communication', 'systems', 'into', 'much', 'more', 'dynamic', 'and', 'resourcelimited', 'operating', 'settings', 'the', 'enormous', 'data', 'volume', 'of', '360deg', 'videos', 'requires', 'an', 'efficient', 'use', 'of', 'network', 'bandwidth', 'to', 'maintain', 'the', 'desired', 'quality', 'of', 'experience', 'for', 'the', 'end', 'user', 'to', 'this', 'end', 'we', 'propose', 'a', 'framework', 'for', 'viewportdriven', 'ratedistortion', 'optimized', '360deg', 'video', 'streaming', 'that', 'integrates', 'the', 'user', 'view', 'navigation', 'pattern', 'and', 'the', 'spatiotemporal', 'ratedistortion', 'characteristics', 'of', 'the', '360deg', 'video', 'content', 'to', 'maximize', 'the', 'delivered', 'user', 'quality', 'of', 'experience', 'for', 'the', 'given', 'networksystem', 'resources', 'the', 'framework', 'comprises', 'a', 'methodology', 'for', 'constructing', 'dynamic', 'heat', 'maps', 'that', 'capture', 'the', 'likelihood', 'of', 'navigating', 'different', 'spatial', 'segments', 'of', 'a', '360deg', 'video', 'over', 'time', 'by', 'the', 'user', 'an', 'analysis', 'and', 'characterization', 'of', 'its', 'spatiotemporal', 'ratedistortion', 'characteristics', 'that', 'leverage', 'preprocessed', 'spatial', 'tilling', 'of', 'the', '360deg', 'view', 'sphere', 'and', 'an', 'optimization', 'problem', 'formulation', 'that', 'characterizes', 'the', 'delivered', 'user', 'quality', 'of', 'experience', 'given', 'the', 'user', 'navigation', 'patterns', '360deg', 'video', 'encoding', 'decisions', 'and', 'the', 'available', 'systemnetwork', 'resources', 'our', 'experimental', 'results', 'demonstrate', 'the', 'advantages', 'of', 'our', 'framework', 'over', 'the', 'conventional', 'approach', 'of', 'streaming', 'a', 'monolithic', 'uniformly', 'encoded', '360deg', 'video', 'and', 'a', 'stateoftheart', 'reference', 'method', 'considerable', 'video', 'quality', 'gains', 'of', '4', '5', 'db', 'are', 'demonstrated', 'in', 'the', 'case', 'of', 'two', 'popular', '4k', '360deg', 'videos']]
|
[-0.14496038597842933, 0.007026758700070165, -0.07346348663553666, 0.009273293357501381, -0.10780282062147324, -0.13292445517829243, 0.038061951909857575, 0.44971663887285346, -0.27577569793415435, -0.3307703535703686, 0.05558777214149322, -0.28122299479682583, -0.1547814566052797, 0.18081776408359443, -0.17793347055127764, 0.07653991478551576, 0.11027965047374651, 0.07526038310786276, -0.036929101244021226, -0.28347366883461383, 0.2411158579430362, 0.047819655803495675, 0.4105412594635278, 0.01954398726133003, 0.1563190598994211, 0.03551914891683534, -0.08346975716581277, -0.0030201515629755165, -0.08874989547217772, 0.19640474363453067, 0.32799159218358553, 0.2638236232602889, 0.32621208859675993, -0.42306552208536324, -0.24185175743059947, -0.012127024153582928, 0.14812038597205027, 0.039347909803621434, -0.09841024166038448, -0.34808972460147153, 0.12186881211934991, -0.1780660989345603, 0.004916967430165241, -0.04093108757981651, -0.034647830576587345, -0.005977694814698109, -0.3194930375999466, -0.03379856361632381, 0.024370098490956553, 0.07406075765771605, -0.08341689967998343, -0.026998293720697765, 0.018368275381483456, 0.23612674764220679, 0.02234279400209998, 0.055771361076453994, 0.157705261217545, -0.18417308972022933, -0.1139377729892201, 0.43378843247043014, -0.01398850923571824, -0.19028219791908277, 0.17604782882089157, -0.042951492418345255, -0.04531908450621706, 0.21265778844619956, 0.2863346624885514, 0.11529402166463752, -0.17334215515580081, 0.005229561498070851, -0.04663171242565022, 0.21851376586503204, 0.10961532255693149, 0.07915429909320734, 0.19600174960159472, 0.2512448482056506, 0.07785509551005765, 0.13445392640619824, -0.1165641386887297, -0.09083911027953523, -0.1965935774791933, -0.13425722797246764, -0.21144726819036555, -0.061801173461058234, -0.15924595441764122, -0.1134052928145401, 0.40105517355171233, 0.1971401098709536, 0.1508806759604116, 0.11986698947242191, 0.40972482875625105, 0.007984398239649726, 0.046967375577732, 0.08083995638450528, 0.07995924933689924, -0.046422181175679623, 0.24074624604777262, -0.14550167138321918, 0.033763538086036514, 0.024535036782659062]
|
1,803.08178
|
Boosted Density Estimation Remastered
|
There has recently been a steady increase in the number iterative approaches
to density estimation. However, an accompanying burst of formal convergence
guarantees has not followed; all results pay the price of heavy assumptions
which are often unrealistic or hard to check. The Generative Adversarial
Network (GAN) literature --- seemingly orthogonal to the aforementioned pursuit
--- has had the side effect of a renewed interest in variational divergence
minimisation (notably $f$-GAN). We show that by introducing a weak learning
assumption (in the sense of the classical boosting framework) we are able to
import some recent results from the GAN literature to develop an iterative
boosted density estimation algorithm, including formal convergence results with
rates, that does not suffer the shortcomings other approaches. We show that the
density fit is an exponential family, and as part of our analysis obtain an
improved variational characterisation of $f$-GAN.
|
cs.LG cs.IT math.IT stat.ML
|
there has recently been a steady increase in the number iterative approaches to density estimation however an accompanying burst of formal convergence guarantees has not followed all results pay the price of heavy assumptions which are often unrealistic or hard to check the generative adversarial network gan literature seemingly orthogonal to the aforementioned pursuit has had the side effect of a renewed interest in variational divergence minimisation notably fgan we show that by introducing a weak learning assumption in the sense of the classical boosting framework we are able to import some recent results from the gan literature to develop an iterative boosted density estimation algorithm including formal convergence results with rates that does not suffer the shortcomings other approaches we show that the density fit is an exponential family and as part of our analysis obtain an improved variational characterisation of fgan
|
[['there', 'has', 'recently', 'been', 'a', 'steady', 'increase', 'in', 'the', 'number', 'iterative', 'approaches', 'to', 'density', 'estimation', 'however', 'an', 'accompanying', 'burst', 'of', 'formal', 'convergence', 'guarantees', 'has', 'not', 'followed', 'all', 'results', 'pay', 'the', 'price', 'of', 'heavy', 'assumptions', 'which', 'are', 'often', 'unrealistic', 'or', 'hard', 'to', 'check', 'the', 'generative', 'adversarial', 'network', 'gan', 'literature', 'seemingly', 'orthogonal', 'to', 'the', 'aforementioned', 'pursuit', 'has', 'had', 'the', 'side', 'effect', 'of', 'a', 'renewed', 'interest', 'in', 'variational', 'divergence', 'minimisation', 'notably', 'fgan', 'we', 'show', 'that', 'by', 'introducing', 'a', 'weak', 'learning', 'assumption', 'in', 'the', 'sense', 'of', 'the', 'classical', 'boosting', 'framework', 'we', 'are', 'able', 'to', 'import', 'some', 'recent', 'results', 'from', 'the', 'gan', 'literature', 'to', 'develop', 'an', 'iterative', 'boosted', 'density', 'estimation', 'algorithm', 'including', 'formal', 'convergence', 'results', 'with', 'rates', 'that', 'does', 'not', 'suffer', 'the', 'shortcomings', 'other', 'approaches', 'we', 'show', 'that', 'the', 'density', 'fit', 'is', 'an', 'exponential', 'family', 'and', 'as', 'part', 'of', 'our', 'analysis', 'obtain', 'an', 'improved', 'variational', 'characterisation', 'of', 'fgan']]
|
[-0.04724310182191275, 0.015447843914698497, -0.12702567824585873, 0.07002373215403747, -0.10750856743864975, -0.14748691014906432, 0.03565480300857054, 0.4135832460401775, -0.2594098461388083, -0.3034661852956548, 0.10939325396967986, -0.2568985640520712, -0.16393039750596314, 0.16810694076218544, -0.14675051823154195, 0.10605344147310702, 0.08513870888953, 0.03306641871064016, -0.11577693707557148, -0.26782812521275184, 0.27677313519977165, 0.07256798163525291, 0.3380379003042785, 0.03991127085963173, 0.08375700951026349, -0.018801167542179982, -0.028531028088051955, 0.026855784044210258, -0.12024563112229204, 0.1331257846245503, 0.24334973323002615, 0.16765269468590566, 0.35900825559050886, -0.42687684817929994, -0.2594314130557167, 0.13226503273797827, 0.1560994518490938, 0.13635694629828596, -0.09104897266895334, -0.2500791526253016, 0.09298772242089565, -0.1886317401870408, -0.08216711588959386, -0.12518029427807126, -0.04453941272128816, 0.025307535150713593, -0.28967388531101956, 0.04842417655590844, 0.11885182903688792, 0.020237614703527487, -0.028793577267625534, -0.14393680458041755, 0.025366768301171544, 0.08018788307664225, 0.14181357019880486, 0.047226172425764636, 0.10226051786172015, -0.137317571795539, -0.1401562815738868, 0.30552419017262794, -0.07885127874104293, -0.17407444381306494, 0.2002051346316621, -0.06570917323648513, -0.19447680725553235, 0.14055038292052133, 0.1531478702188372, 0.09279183785533256, -0.1395758680048418, 0.0860190551228971, -0.0542930040852056, 0.1419624097358722, 0.03682172859178765, 0.024674417128643163, 0.12316574513182774, 0.12944685809731066, 0.08331063023110578, 0.11488753501724751, -0.08105457931027546, -0.12083012254426738, -0.2604699874023249, -0.09267921294443883, -0.16877568445503843, 0.033631399628206424, -0.06523944263766158, -0.19641505339072196, 0.3452931476848109, 0.16570231953588593, 0.2026116694144618, 0.0763560135016817, 0.3165885861572269, 0.13432454945636796, 0.04872718325106205, 0.11249798912345554, 0.28352562181584023, 0.11103311715276351, 0.06795034739612178, -0.1593571235466475, 0.13680737348797672, 0.0719456045719033]
|
1,803.08179
|
Protocol architectures for IoT domains
|
In this work we discuss proxy architectures which interconnect IoT domains
running CoAP with the rest of Internet including micro datacenters and other
domains building scalable hierarchical architectures. We assume that CoAP
domain is terminated by an IoT proxy with cache, and we investigate several
design issues with respect to successful data transmission, round trip delay
and energy consumption. We present performance data for the case when proxy
autonomously maintains data freshness which clearly point to efficient design
choices.
|
cs.NI
|
in this work we discuss proxy architectures which interconnect iot domains running coap with the rest of internet including micro datacenters and other domains building scalable hierarchical architectures we assume that coap domain is terminated by an iot proxy with cache and we investigate several design issues with respect to successful data transmission round trip delay and energy consumption we present performance data for the case when proxy autonomously maintains data freshness which clearly point to efficient design choices
|
[['in', 'this', 'work', 'we', 'discuss', 'proxy', 'architectures', 'which', 'interconnect', 'iot', 'domains', 'running', 'coap', 'with', 'the', 'rest', 'of', 'internet', 'including', 'micro', 'datacenters', 'and', 'other', 'domains', 'building', 'scalable', 'hierarchical', 'architectures', 'we', 'assume', 'that', 'coap', 'domain', 'is', 'terminated', 'by', 'an', 'iot', 'proxy', 'with', 'cache', 'and', 'we', 'investigate', 'several', 'design', 'issues', 'with', 'respect', 'to', 'successful', 'data', 'transmission', 'round', 'trip', 'delay', 'and', 'energy', 'consumption', 'we', 'present', 'performance', 'data', 'for', 'the', 'case', 'when', 'proxy', 'autonomously', 'maintains', 'data', 'freshness', 'which', 'clearly', 'point', 'to', 'efficient', 'design', 'choices']]
|
[-0.199814526479149, 0.00185866078934367, -0.0016850192347376406, -0.007638541981577873, -0.1314171536094686, -0.22756695401960914, 0.08441665758897515, 0.47712619687560237, -0.2742628951415514, -0.3592073216870769, 0.1469802808508725, -0.2669449455776735, -0.12041617831719238, 0.18159659121987187, -0.1272080041279521, 0.07843878434947398, 0.08797762925701423, -0.02701442147593332, -0.030462865885700796, -0.26713525949641354, 0.3162204924428576, 0.09622723612156284, 0.4073373677822042, 0.054765283919965164, 0.06213606407577054, -0.0284718230817632, -0.01067595022636218, -0.06990751262188336, -0.11003858658613687, 0.12624503712205193, 0.32811753522557546, 0.20614118397801737, 0.29830857521936865, -0.500914031545384, -0.1824538563083433, 0.08344065139801064, 0.14629629754190204, 0.026720599769437803, -0.08422029198035362, -0.26684236778476855, 0.10258925511631407, -0.22232122113338754, -0.09095448651056312, -0.06708027112380235, 0.0002162425772911763, 0.03839432240664205, -0.23616783879697323, -0.040899948169819164, -0.06186532584620239, 0.006385143903744278, -0.04284200255605805, -0.06166547707494207, 0.010075468687882906, 0.15709729995350116, 0.03011878508237438, -0.0034320954870008216, 0.18774835797191797, -0.0946738599649265, -0.15269199764367805, 0.37626029730220384, -0.006244892637610812, -0.14719367255987245, 0.15712914403079997, 0.005019779028253088, -0.15677325365051062, -0.018924036145776132, 0.21698142690112507, 0.043947527185082436, -0.18328698849267933, -0.007739701339992683, 0.05091349200545987, 0.1950881424189775, 0.05081256913445607, 0.08161536623617704, 0.15847421337591036, 0.29342301090578016, 0.1515672591019752, 0.1281956761988481, -0.08123649218225781, -0.12624009047992987, -0.21244861512103036, -0.1592121953350975, -0.15234639292842225, -0.003760926566923721, -0.11525008082334572, -0.12388636025635502, 0.35713989477416, 0.18694354867845586, 0.1964509915295234, 0.11149556955169368, 0.4205790606291988, 0.02686773629599734, 0.1408916445201428, 0.19249513992874684, 0.11296568039946164, -0.04150865702371148, 0.2245427961461246, -0.17197613721076824, 0.06898238392593929, -0.06289345062856527]
|
1,803.0818
|
A polynomial Ansatz for Norm-conserving Pseudopotentials
|
We show that efficient norm-conserving pseudopotentials for electronic
structure calculations can be obtained from a polynomial Ansatz for the
potential. Our pseudopotential is a polynomial of degree ten in the radial
variable and fulfills the same smoothness conditions imposed by the
Troullier-Martins method [Phys. Rev. B 43, 1993 (1991)] where pseudopotentials
are represented by a polynomial of degree twenty-two. We compare our method to
the Troullier-Martins approach in electronic structure calculations for diamond
and iron in the bcc structure and find that the two methods perform equally
well in calculations of the total energy. However, first and second derivatives
of the total energy with respect to atomic coordinates converge significantly
faster with the plane wave cutoff if the standard Troullier-Martins potentials
are replaced by the pseudopotentials introduced here.
|
cond-mat.mtrl-sci physics.chem-ph physics.comp-ph
|
we show that efficient normconserving pseudopotentials for electronic structure calculations can be obtained from a polynomial ansatz for the potential our pseudopotential is a polynomial of degree ten in the radial variable and fulfills the same smoothness conditions imposed by the troulliermartins method phys rev b 43 1993 1991 where pseudopotentials are represented by a polynomial of degree twentytwo we compare our method to the troulliermartins approach in electronic structure calculations for diamond and iron in the bcc structure and find that the two methods perform equally well in calculations of the total energy however first and second derivatives of the total energy with respect to atomic coordinates converge significantly faster with the plane wave cutoff if the standard troulliermartins potentials are replaced by the pseudopotentials introduced here
|
[['we', 'show', 'that', 'efficient', 'normconserving', 'pseudopotentials', 'for', 'electronic', 'structure', 'calculations', 'can', 'be', 'obtained', 'from', 'a', 'polynomial', 'ansatz', 'for', 'the', 'potential', 'our', 'pseudopotential', 'is', 'a', 'polynomial', 'of', 'degree', 'ten', 'in', 'the', 'radial', 'variable', 'and', 'fulfills', 'the', 'same', 'smoothness', 'conditions', 'imposed', 'by', 'the', 'troulliermartins', 'method', 'phys', 'rev', 'b', '43', '1993', '1991', 'where', 'pseudopotentials', 'are', 'represented', 'by', 'a', 'polynomial', 'of', 'degree', 'twentytwo', 'we', 'compare', 'our', 'method', 'to', 'the', 'troulliermartins', 'approach', 'in', 'electronic', 'structure', 'calculations', 'for', 'diamond', 'and', 'iron', 'in', 'the', 'bcc', 'structure', 'and', 'find', 'that', 'the', 'two', 'methods', 'perform', 'equally', 'well', 'in', 'calculations', 'of', 'the', 'total', 'energy', 'however', 'first', 'and', 'second', 'derivatives', 'of', 'the', 'total', 'energy', 'with', 'respect', 'to', 'atomic', 'coordinates', 'converge', 'significantly', 'faster', 'with', 'the', 'plane', 'wave', 'cutoff', 'if', 'the', 'standard', 'troulliermartins', 'potentials', 'are', 'replaced', 'by', 'the', 'pseudopotentials', 'introduced', 'here']]
|
[-0.06432696627598489, 0.07718710814515362, -0.06551705829770071, 0.016632270898298884, -0.01751331572631898, -0.08945342443257687, 0.05152774043563113, 0.3907491269928869, -0.23101951840362744, -0.30844039899466225, 0.015010343897301937, -0.26893176983867306, -0.12852208863205306, 0.17227325483509048, 0.02234891109583259, 0.0639171777656884, 0.03749347613302234, -0.009235708730557235, -0.12753250184687204, -0.2736350409086299, 0.26272200606763363, 0.07511920467004529, 0.2305601856969588, 0.05929500061029103, 0.05140520157874562, 0.0037871273852942977, -0.001882882759673521, 0.028374840381729882, -0.14034285502987132, 0.11534174345069914, 0.19630657556990627, 0.044208154402440414, 0.24170044827042148, -0.4346544243617245, -0.202141395828221, 0.04539843157908763, 0.07668148876837222, 0.11503326096135424, 0.013313749492226634, -0.2611749670759309, 0.08030575427437725, -0.17715490576506454, -0.17655884005580447, -0.15150923104738467, 0.022476974918390624, 0.0709423183097897, -0.2915265381266181, 0.1226109955314314, 0.014128481118859781, 0.04831261886675975, -0.09404357988751144, -0.15405168044162565, -0.06219819383795766, -0.007643321765499422, -0.021254589555610437, 0.07782314856922312, 0.07630439127387945, -0.05768815197006916, -0.10137702733482001, 0.4163926347682718, -0.06956948424340226, -0.20333842899708543, 0.1474995457137993, -0.10986778130609309, -0.12729130297157099, 0.11637415920085914, 0.10833379724499537, 0.13265296880854294, -0.14262313191420617, 0.1288530661331606, -0.02529657291404419, 0.17579278909397544, 0.11307592884986661, 0.008637010341772111, 0.09852501716522966, 0.07551162724848837, 0.04121716423105681, 0.09583484834274714, -0.09913827486525406, -0.10156520631426247, -0.28319327294957475, -0.1372556246401473, -0.23295047719602735, 0.009794211241000994, -0.0786015824628521, -0.16103995091543766, 0.40818045841297135, 0.12148592879748321, 0.17812293850874994, 0.018974382597662043, 0.25230863076831156, 0.124438266897414, 0.07155763830314754, 0.11459358444335521, 0.26173144880885957, 0.14531647064541175, 0.045522360247559845, -0.21956121822245223, 0.04179094550272566, 0.09056383595270745]
|
1,803.08181
|
CalibNet: Geometrically Supervised Extrinsic Calibration using 3D
Spatial Transformer Networks
|
3D LiDARs and 2D cameras are increasingly being used alongside each other in
sensor rigs for perception tasks. Before these sensors can be used to gather
meaningful data, however, their extrinsics (and intrinsics) need to be
accurately calibrated, as the performance of the sensor rig is extremely
sensitive to these calibration parameters. A vast majority of existing
calibration techniques require significant amounts of data and/or calibration
targets and human effort, severely impacting their applicability in large-scale
production systems. We address this gap with CalibNet: a self-supervised deep
network capable of automatically estimating the 6-DoF rigid body transformation
between a 3D LiDAR and a 2D camera in real-time. CalibNet alleviates the need
for calibration targets, thereby resulting in significant savings in
calibration efforts. During training, the network only takes as input a LiDAR
point cloud, the corresponding monocular image, and the camera calibration
matrix K. At train time, we do not impose direct supervision (i.e., we do not
directly regress to the calibration parameters, for example). Instead, we train
the network to predict calibration parameters that maximize the geometric and
photometric consistency of the input images and point clouds. CalibNet learns
to iteratively solve the underlying geometric problem and accurately predicts
extrinsic calibration parameters for a wide range of mis-calibrations, without
requiring retraining or domain adaptation. The project page is hosted at
https://epiception.github.io/CalibNet
|
cs.RO cs.CV
|
3d lidars and 2d cameras are increasingly being used alongside each other in sensor rigs for perception tasks before these sensors can be used to gather meaningful data however their extrinsics and intrinsics need to be accurately calibrated as the performance of the sensor rig is extremely sensitive to these calibration parameters a vast majority of existing calibration techniques require significant amounts of data andor calibration targets and human effort severely impacting their applicability in largescale production systems we address this gap with calibnet a selfsupervised deep network capable of automatically estimating the 6dof rigid body transformation between a 3d lidar and a 2d camera in realtime calibnet alleviates the need for calibration targets thereby resulting in significant savings in calibration efforts during training the network only takes as input a lidar point cloud the corresponding monocular image and the camera calibration matrix k at train time we do not impose direct supervision ie we do not directly regress to the calibration parameters for example instead we train the network to predict calibration parameters that maximize the geometric and photometric consistency of the input images and point clouds calibnet learns to iteratively solve the underlying geometric problem and accurately predicts extrinsic calibration parameters for a wide range of miscalibrations without requiring retraining or domain adaptation the project page is hosted at httpsepiceptiongithubiocalibnet
|
[['3d', 'lidars', 'and', '2d', 'cameras', 'are', 'increasingly', 'being', 'used', 'alongside', 'each', 'other', 'in', 'sensor', 'rigs', 'for', 'perception', 'tasks', 'before', 'these', 'sensors', 'can', 'be', 'used', 'to', 'gather', 'meaningful', 'data', 'however', 'their', 'extrinsics', 'and', 'intrinsics', 'need', 'to', 'be', 'accurately', 'calibrated', 'as', 'the', 'performance', 'of', 'the', 'sensor', 'rig', 'is', 'extremely', 'sensitive', 'to', 'these', 'calibration', 'parameters', 'a', 'vast', 'majority', 'of', 'existing', 'calibration', 'techniques', 'require', 'significant', 'amounts', 'of', 'data', 'andor', 'calibration', 'targets', 'and', 'human', 'effort', 'severely', 'impacting', 'their', 'applicability', 'in', 'largescale', 'production', 'systems', 'we', 'address', 'this', 'gap', 'with', 'calibnet', 'a', 'selfsupervised', 'deep', 'network', 'capable', 'of', 'automatically', 'estimating', 'the', '6dof', 'rigid', 'body', 'transformation', 'between', 'a', '3d', 'lidar', 'and', 'a', '2d', 'camera', 'in', 'realtime', 'calibnet', 'alleviates', 'the', 'need', 'for', 'calibration', 'targets', 'thereby', 'resulting', 'in', 'significant', 'savings', 'in', 'calibration', 'efforts', 'during', 'training', 'the', 'network', 'only', 'takes', 'as', 'input', 'a', 'lidar', 'point', 'cloud', 'the', 'corresponding', 'monocular', 'image', 'and', 'the', 'camera', 'calibration', 'matrix', 'k', 'at', 'train', 'time', 'we', 'do', 'not', 'impose', 'direct', 'supervision', 'ie', 'we', 'do', 'not', 'directly', 'regress', 'to', 'the', 'calibration', 'parameters', 'for', 'example', 'instead', 'we', 'train', 'the', 'network', 'to', 'predict', 'calibration', 'parameters', 'that', 'maximize', 'the', 'geometric', 'and', 'photometric', 'consistency', 'of', 'the', 'input', 'images', 'and', 'point', 'clouds', 'calibnet', 'learns', 'to', 'iteratively', 'solve', 'the', 'underlying', 'geometric', 'problem', 'and', 'accurately', 'predicts', 'extrinsic', 'calibration', 'parameters', 'for', 'a', 'wide', 'range', 'of', 'miscalibrations', 'without', 'requiring', 'retraining', 'or', 'domain', 'adaptation', 'the', 'project', 'page', 'is', 'hosted', 'at', 'httpsepiceptiongithubiocalibnet']]
|
[-0.037421742472162636, 0.03500281238124113, -0.040086324164241724, 0.04409731607262405, -0.150011560063153, -0.1729219545356252, 0.05612674431176856, 0.4574586829996075, -0.26004845461046155, -0.41223356777124787, 0.11828746453446166, -0.2609925212473503, -0.10489798369949725, 0.1925309496000409, -0.16927524515671064, 0.1353269664665938, 0.155821434288836, -0.015121206325817515, -0.07024837410479615, -0.2207726565665904, 0.2681876387870447, 0.045234196420245676, 0.3037934572562914, -0.014956077311018652, 0.15027663684503006, 0.030568608823655682, -0.07150374982527204, -0.01936758493697694, -0.05313450863643745, 0.12716950730219567, 0.3200040800369937, 0.1690194372786209, 0.2505062149477784, -0.4592463693824935, -0.22553165084682406, 0.1285157707763243, 0.13421177750093524, 0.0953909585591067, -0.02718066445562396, -0.3039657973303375, 0.07400779971768233, -0.1429300165766935, -0.05494007421657443, -0.09736403409624472, -0.0044521953291471374, -0.00038601636928929525, -0.30407113987232814, 0.009834081223495807, -0.010612785704010589, 0.07547925056304931, -0.0852056089471179, -0.07036834867110221, -0.00326246882640672, 0.23936458236791872, -0.016582566150464117, 0.05447388446244242, 0.1914082620774438, -0.20089689537906616, -0.033333301815648815, 0.39409223886376077, -0.02103943778784014, -0.2132111040240323, 0.18266420332101088, -0.05606027014807544, -0.1278056794989177, 0.1406943172020626, 0.22007385950577868, 0.08186705316607416, -0.18665016994729575, 0.008786034073670056, 0.02775407670997083, 0.207955157008837, 0.029472890050700782, 0.00013842531585727227, 0.2206636033444242, 0.19623626651697454, 0.06825867286586965, 0.08508422811415088, -0.20278455199493858, -0.02649670453022488, -0.23856821476312523, -0.09897682099518451, -0.1973167986228046, -0.005276000008532058, -0.10022518111231461, -0.12350644740297205, 0.35794067995845, 0.2512590325490402, 0.20885277886726808, 0.0644038551614027, 0.3849574884865433, 0.016325441480942324, 0.1478243970584696, 0.047896926083856005, 0.2370711623294152, -0.01109853041783605, 0.13872389233332466, -0.16025124941264618, 0.09100674821688286, 0.01769639060472731]
|
1,803.08182
|
Enforcing constraints for interpolation and extrapolation in Generative
Adversarial Networks
|
We suggest ways to enforce given constraints in the output of a Generative
Adversarial Network (GAN) generator both for interpolation and extrapolation
(prediction). For the case of dynamical systems, given a time series, we wish
to train GAN generators that can be used to predict trajectories starting from
a given initial condition. In this setting, the constraints can be in algebraic
and/or differential form. Even though we are predominantly interested in the
case of extrapolation, we will see that the tasks of interpolation and
extrapolation are related. However, they need to be treated differently.
For the case of interpolation, the incorporation of constraints is built into
the training of the GAN. The incorporation of the constraints respects the
primary game-theoretic setup of a GAN so it can be combined with existing
algorithms. However, it can exacerbate the problem of instability during
training that is well-known for GANs. We suggest adding small noise to the
constraints as a simple remedy that has performed well in our numerical
experiments.
The case of extrapolation (prediction) is more involved. During training, the
GAN generator learns to interpolate a noisy version of the data and we enforce
the constraints. This approach has connections with model reduction that we can
utilize to improve the efficiency and accuracy of the training. Depending on
the form of the constraints, we may enforce them also during prediction through
a projection step. We provide examples of linear and nonlinear systems of
differential equations to illustrate the various constructions.
|
cs.LG stat.ML
|
we suggest ways to enforce given constraints in the output of a generative adversarial network gan generator both for interpolation and extrapolation prediction for the case of dynamical systems given a time series we wish to train gan generators that can be used to predict trajectories starting from a given initial condition in this setting the constraints can be in algebraic andor differential form even though we are predominantly interested in the case of extrapolation we will see that the tasks of interpolation and extrapolation are related however they need to be treated differently for the case of interpolation the incorporation of constraints is built into the training of the gan the incorporation of the constraints respects the primary gametheoretic setup of a gan so it can be combined with existing algorithms however it can exacerbate the problem of instability during training that is wellknown for gans we suggest adding small noise to the constraints as a simple remedy that has performed well in our numerical experiments the case of extrapolation prediction is more involved during training the gan generator learns to interpolate a noisy version of the data and we enforce the constraints this approach has connections with model reduction that we can utilize to improve the efficiency and accuracy of the training depending on the form of the constraints we may enforce them also during prediction through a projection step we provide examples of linear and nonlinear systems of differential equations to illustrate the various constructions
|
[['we', 'suggest', 'ways', 'to', 'enforce', 'given', 'constraints', 'in', 'the', 'output', 'of', 'a', 'generative', 'adversarial', 'network', 'gan', 'generator', 'both', 'for', 'interpolation', 'and', 'extrapolation', 'prediction', 'for', 'the', 'case', 'of', 'dynamical', 'systems', 'given', 'a', 'time', 'series', 'we', 'wish', 'to', 'train', 'gan', 'generators', 'that', 'can', 'be', 'used', 'to', 'predict', 'trajectories', 'starting', 'from', 'a', 'given', 'initial', 'condition', 'in', 'this', 'setting', 'the', 'constraints', 'can', 'be', 'in', 'algebraic', 'andor', 'differential', 'form', 'even', 'though', 'we', 'are', 'predominantly', 'interested', 'in', 'the', 'case', 'of', 'extrapolation', 'we', 'will', 'see', 'that', 'the', 'tasks', 'of', 'interpolation', 'and', 'extrapolation', 'are', 'related', 'however', 'they', 'need', 'to', 'be', 'treated', 'differently', 'for', 'the', 'case', 'of', 'interpolation', 'the', 'incorporation', 'of', 'constraints', 'is', 'built', 'into', 'the', 'training', 'of', 'the', 'gan', 'the', 'incorporation', 'of', 'the', 'constraints', 'respects', 'the', 'primary', 'gametheoretic', 'setup', 'of', 'a', 'gan', 'so', 'it', 'can', 'be', 'combined', 'with', 'existing', 'algorithms', 'however', 'it', 'can', 'exacerbate', 'the', 'problem', 'of', 'instability', 'during', 'training', 'that', 'is', 'wellknown', 'for', 'gans', 'we', 'suggest', 'adding', 'small', 'noise', 'to', 'the', 'constraints', 'as', 'a', 'simple', 'remedy', 'that', 'has', 'performed', 'well', 'in', 'our', 'numerical', 'experiments', 'the', 'case', 'of', 'extrapolation', 'prediction', 'is', 'more', 'involved', 'during', 'training', 'the', 'gan', 'generator', 'learns', 'to', 'interpolate', 'a', 'noisy', 'version', 'of', 'the', 'data', 'and', 'we', 'enforce', 'the', 'constraints', 'this', 'approach', 'has', 'connections', 'with', 'model', 'reduction', 'that', 'we', 'can', 'utilize', 'to', 'improve', 'the', 'efficiency', 'and', 'accuracy', 'of', 'the', 'training', 'depending', 'on', 'the', 'form', 'of', 'the', 'constraints', 'we', 'may', 'enforce', 'them', 'also', 'during', 'prediction', 'through', 'a', 'projection', 'step', 'we', 'provide', 'examples', 'of', 'linear', 'and', 'nonlinear', 'systems', 'of', 'differential', 'equations', 'to', 'illustrate', 'the', 'various', 'constructions']]
|
[-0.059715516528681734, 0.0484901127206432, -0.09391582199098211, 0.09095227083842826, -0.1049481982143686, -0.13711876066959267, 0.042995320158942994, 0.39121982265984817, -0.2883871252303042, -0.33855108479638735, 0.11622283099296188, -0.257682851861201, -0.16416922958113342, 0.18829186895633146, -0.11437290823725503, 0.07959027677368853, 0.10725108898364968, 0.015196970630284105, -0.1044986608758336, -0.2782208511198405, 0.32709978657470445, 0.05424330028754118, 0.25995374425509643, 0.019881700811457712, 0.10329118497423723, -0.025105710197690752, -0.009016296554041365, 0.01914174810677181, -0.0767580319931855, 0.1380802876867106, 0.2521410522223901, 0.1567837932933828, 0.27937923358648176, -0.4721032175490813, -0.22416690087336447, 0.1138955699580331, 0.12990372787199675, 0.14999818616929733, -0.037668721879761564, -0.2561651645923003, 0.09921770539057756, -0.1382531516766551, -0.04763796021988157, -0.1140474185437685, -0.05862738487321035, 0.031923583797892674, -0.3573544306395155, 0.022427775756143326, 0.088707213203311, 0.00046404972747569125, -0.06802404939099366, -0.076003392581873, -0.03283377639778454, 0.1415195305974433, 0.05831172768986078, 0.026352050676641446, 0.11094089694773673, -0.1278432252602802, -0.11066628650822226, 0.38732281911577426, -0.05941475472448679, -0.23465003324505937, 0.1757018877068467, -0.08489917216619718, -0.1543427955954441, 0.06433967909599174, 0.22235082695260644, 0.11456850322716608, -0.13009077721207793, 0.05878965849420168, -0.01752547733720407, 0.14597227477239474, 0.03574237714788216, -0.00218342118445904, 0.14249319128406746, 0.1884602281572898, 0.054517360292412644, 0.16069469279083873, -0.07756761337288716, -0.08614134789780609, -0.3064698754455857, -0.11156000071505626, -0.16980920391694282, 0.021305978790135873, -0.06828956310833277, -0.12119251481377549, 0.3830923640907126, 0.20139079389487197, 0.23976888834318566, 0.07710674781476208, 0.29456317772518004, 0.13633679587914113, 0.1003983803591015, 0.05016433892043067, 0.24068665872431255, 0.07304774884757917, 0.09443180558962687, -0.17139240461420419, 0.09654620492778297, 0.0365465035701486]
|
1,803.08183
|
Activation cross-section measurement of proton induced reactions on
cerium
|
In the framework of a systematic study of proton induced nuclear reactions on
lanthanides we have measured the excitation functions on natural cerium for the
production of 142,139,138m,137Pr, 141,139,137m,137g,135Ce and 133La up to 65
MeV proton energy using the activation method with stacked-foil irradiation
technique and high-resolution gamma-ray spectrometry. The cross-sections of the
investigated reactions were compared with the data retrieved from the
TENDL-2014 and TENDL-2015 libraries, based on the latest version of the TALYS
code system. No earlier experimental data were found in the literature. The
measured cross-section data are important for further improvement of nuclear
reaction models and for practical applications in nuclear medicine, other
labeling and activation studies.
|
nucl-ex
|
in the framework of a systematic study of proton induced nuclear reactions on lanthanides we have measured the excitation functions on natural cerium for the production of 142139138m137pr 141139137m137g135ce and 133la up to 65 mev proton energy using the activation method with stackedfoil irradiation technique and highresolution gammaray spectrometry the crosssections of the investigated reactions were compared with the data retrieved from the tendl2014 and tendl2015 libraries based on the latest version of the talys code system no earlier experimental data were found in the literature the measured crosssection data are important for further improvement of nuclear reaction models and for practical applications in nuclear medicine other labeling and activation studies
|
[['in', 'the', 'framework', 'of', 'a', 'systematic', 'study', 'of', 'proton', 'induced', 'nuclear', 'reactions', 'on', 'lanthanides', 'we', 'have', 'measured', 'the', 'excitation', 'functions', 'on', 'natural', 'cerium', 'for', 'the', 'production', 'of', '142139138m137pr', '141139137m137g135ce', 'and', '133la', 'up', 'to', '65', 'mev', 'proton', 'energy', 'using', 'the', 'activation', 'method', 'with', 'stackedfoil', 'irradiation', 'technique', 'and', 'highresolution', 'gammaray', 'spectrometry', 'the', 'crosssections', 'of', 'the', 'investigated', 'reactions', 'were', 'compared', 'with', 'the', 'data', 'retrieved', 'from', 'the', 'tendl2014', 'and', 'tendl2015', 'libraries', 'based', 'on', 'the', 'latest', 'version', 'of', 'the', 'talys', 'code', 'system', 'no', 'earlier', 'experimental', 'data', 'were', 'found', 'in', 'the', 'literature', 'the', 'measured', 'crosssection', 'data', 'are', 'important', 'for', 'further', 'improvement', 'of', 'nuclear', 'reaction', 'models', 'and', 'for', 'practical', 'applications', 'in', 'nuclear', 'medicine', 'other', 'labeling', 'and', 'activation', 'studies']]
|
[0.03348679644260726, 0.10584078621495208, -0.04298392268257652, 0.08179256227508255, 0.03039391542899149, -0.08707590054596749, 0.05200307349537696, 0.4124221413507374, -0.20172311053739503, -0.35227699598314566, 0.034667221535586774, -0.36506266869741294, -0.001993382930618907, 0.2820790783019412, 0.03818793688129651, 0.11814767328184952, 0.12611523431452384, 0.02085513796939284, -0.05284367927239029, -0.1867657797154757, 0.29769052506462934, 0.15379371125157068, 0.2785608616375595, 0.13997159681257304, 0.054207322276301505, 0.006510161935702103, -0.06667671497182819, -0.07208767296626754, -0.14713248447942281, 0.14947408705163712, 0.26015437187546453, 0.11495161012515699, 0.14068707723358492, -0.4310689036768579, -0.22648300956657003, 0.06892156999968334, 0.08617791171621429, 0.10074231439962163, -0.13013786712657113, -0.2580203137386146, 0.06196497616768225, -0.20123249961387948, -0.047939314378784334, -0.06997852689595124, 0.008804387993973876, 0.0878609131162969, -0.2603896797267259, 0.06007241232132693, -0.05049220791274528, 0.13163454615545178, -0.1424256429960524, -0.23225702050915245, -0.015497179313161231, 0.07786948035616394, 0.04464076469660899, 0.06055718318077548, 0.19244397500393176, -0.10316247798912569, -0.13446314708081955, 0.3713528943598407, -0.03695627070168768, -0.08720089866856642, 0.1395246786078216, -0.13410555708452787, -0.1742558880407927, 0.15136407884777686, 0.199335937413874, 0.12982401145096664, -0.19713460177571915, 0.05621376926017447, 0.01898730823923962, 0.17209921903489583, 0.07627025268408, -0.005254905120845576, 0.08240541210558283, 0.219414565904459, -0.06637933594601896, 0.0930724069417386, -0.15803924431263922, -0.05506312319957608, -0.25227108707976176, -0.09872678275980534, -0.10857075879803149, 0.02852433609750566, -0.026845534711647908, -0.08074260529113608, 0.36596681853465807, 0.09659225919600063, 0.18236734815915928, -0.04114044540553191, 0.30194699415646564, 0.052562997996841276, 0.11370784582980319, 0.014664193025764521, 0.26456360554818165, 0.16030393714307373, 0.12523588283978607, -0.25173805523749204, 0.09167633910979563, -0.022820816409492163]
|
1,803.08184
|
Generalized Optimization of High Capacity Compressive Imaging Systems
|
One of the greatest challenges in applying compressive sensing (CS) signal
processing techniques to electromagnetic imaging applications is designing a
sensing matrix that has good reconstruction capabilities. Compressive reflector
antennas (CRA) are a class of antennas that have been shown to provide enhanced
image reconstruction performance over traditional reflector antennas (TRA) when
CS techniques are employed. In this paper, we present a unified CRA design
method, which considers both the sensing capacity and efficiency of the
antenna, and can be used for both compressive imaging and multiple-input
multiple-output (MIMO) communication applications. The unified design method is
assessed for a CRA configuration in which dielectric scatterers are added to
the surface of a TRA. The design results demonstrate the ability of the unified
design method to enhance the CS reconstruction capabilities of the CRA.
|
eess.IV math.OC
|
one of the greatest challenges in applying compressive sensing cs signal processing techniques to electromagnetic imaging applications is designing a sensing matrix that has good reconstruction capabilities compressive reflector antennas cra are a class of antennas that have been shown to provide enhanced image reconstruction performance over traditional reflector antennas tra when cs techniques are employed in this paper we present a unified cra design method which considers both the sensing capacity and efficiency of the antenna and can be used for both compressive imaging and multipleinput multipleoutput mimo communication applications the unified design method is assessed for a cra configuration in which dielectric scatterers are added to the surface of a tra the design results demonstrate the ability of the unified design method to enhance the cs reconstruction capabilities of the cra
|
[['one', 'of', 'the', 'greatest', 'challenges', 'in', 'applying', 'compressive', 'sensing', 'cs', 'signal', 'processing', 'techniques', 'to', 'electromagnetic', 'imaging', 'applications', 'is', 'designing', 'a', 'sensing', 'matrix', 'that', 'has', 'good', 'reconstruction', 'capabilities', 'compressive', 'reflector', 'antennas', 'cra', 'are', 'a', 'class', 'of', 'antennas', 'that', 'have', 'been', 'shown', 'to', 'provide', 'enhanced', 'image', 'reconstruction', 'performance', 'over', 'traditional', 'reflector', 'antennas', 'tra', 'when', 'cs', 'techniques', 'are', 'employed', 'in', 'this', 'paper', 'we', 'present', 'a', 'unified', 'cra', 'design', 'method', 'which', 'considers', 'both', 'the', 'sensing', 'capacity', 'and', 'efficiency', 'of', 'the', 'antenna', 'and', 'can', 'be', 'used', 'for', 'both', 'compressive', 'imaging', 'and', 'multipleinput', 'multipleoutput', 'mimo', 'communication', 'applications', 'the', 'unified', 'design', 'method', 'is', 'assessed', 'for', 'a', 'cra', 'configuration', 'in', 'which', 'dielectric', 'scatterers', 'are', 'added', 'to', 'the', 'surface', 'of', 'a', 'tra', 'the', 'design', 'results', 'demonstrate', 'the', 'ability', 'of', 'the', 'unified', 'design', 'method', 'to', 'enhance', 'the', 'cs', 'reconstruction', 'capabilities', 'of', 'the', 'cra']]
|
[-0.14461105631198734, 0.012560895780675617, -0.027937852196339378, -0.06130093820585652, -0.08879259246037363, -0.21670737170397228, 0.006550340528978049, 0.4205739476921079, -0.2657384057669319, -0.26730004875549584, 0.1135435452346893, -0.23098232426253476, -0.2543774881746788, 0.16949313226387017, -0.13622592971835257, 0.09130221892400343, 0.07309574251504321, -0.028816393481810837, -0.05822380494564436, -0.18623153744107881, 0.1967144231066892, 0.12794547774513862, 0.36914108673292667, 0.0004575289855886223, 0.06291856288321708, 0.008503835266666081, 0.002594998956717467, 0.003219283437986571, -0.05329099001725733, 0.16314315507923693, 0.3859161834575628, 0.22139533315860999, 0.25990731323389965, -0.4141158713658053, -0.29867947495829567, 0.021308954073382274, 0.18082373280120187, 0.03125118988888212, -0.15185643087274261, -0.26989824106370597, 0.1474662904445558, -0.17821354664778127, -0.047968842981985414, -0.02925758498118616, -0.07749276865217694, 0.018006974733189532, -0.3738329947498956, -0.03978572747341, 0.008318771223040452, 0.025355556909751175, -0.0651698158318667, -0.16790625418683416, 0.12352403433279212, 0.10315180730877298, -0.029236633453126017, 0.011410990911991076, 0.14857557230748067, -0.11801421302510776, -0.0983481867960129, 0.3832426084891746, -0.03503939511842633, -0.22274753253178714, 0.20523800438136927, -0.0957546463897942, -0.11063646587466162, 0.1845648417151288, 0.25078814924883663, 0.12349052408612088, -0.16374168119840132, 0.07980415036532454, 0.022466352832664672, 0.19434029735008576, 0.07197051122784615, 0.12139466009803004, 0.16567676767874928, 0.22582010956852228, 0.09363511225201637, 0.16601299926729635, -0.21575737483379312, -0.028669193628615232, -0.1539523611055281, -0.19904384707429804, -0.23570908712489264, -0.03525763652042339, -0.0836073077302181, -0.08617274767147637, 0.36663517451151867, 0.16934322574547023, 0.09253361125833783, 0.022560752856482128, 0.42312325890126984, 0.07384367450578068, 0.1083933282223411, 0.028613892882796272, 0.2746400744706756, 0.19453198691003754, 0.14612523460309057, -0.20414134495737576, -0.0381788689699164, -0.02191460785575043]
|
1,803.08185
|
The Zeldovich approximation and wide-angle redshift-space distortions
|
The contribution of line-of-sight peculiar velocities to the observed
redshift of objects breaks the translational symmetry of the underlying theory,
modifying the predicted 2-point functions. These `wide angle effects' have
mostly been studied using linear perturbation theory in the context of the
multipoles of the correlation function and power spectrum. In this work we
present the first calculation of wide angle terms in the Zeldovich
approximation, which is known to be more accurate than linear theory on scales
probed by the next generation of galaxy surveys. We present the exact result
for dark matter and perturbatively biased tracers as well as the small angle
expansion of the configuration- and Fourier-space two-point functions and the
connection to the multi-frequency angular power spectrum. We compare different
definitions of the line-of-sight direction and discuss how to translate between
them. We show that wide angle terms can reach tens of percent of the total
signal in a measurement at low redshift in some approximations, and that a
generic feature of wide angle effects is to slightly shift the Baryon Acoustic
Oscillation scale.
|
astro-ph.CO
|
the contribution of lineofsight peculiar velocities to the observed redshift of objects breaks the translational symmetry of the underlying theory modifying the predicted 2point functions these wide angle effects have mostly been studied using linear perturbation theory in the context of the multipoles of the correlation function and power spectrum in this work we present the first calculation of wide angle terms in the zeldovich approximation which is known to be more accurate than linear theory on scales probed by the next generation of galaxy surveys we present the exact result for dark matter and perturbatively biased tracers as well as the small angle expansion of the configuration and fourierspace twopoint functions and the connection to the multifrequency angular power spectrum we compare different definitions of the lineofsight direction and discuss how to translate between them we show that wide angle terms can reach tens of percent of the total signal in a measurement at low redshift in some approximations and that a generic feature of wide angle effects is to slightly shift the baryon acoustic oscillation scale
|
[['the', 'contribution', 'of', 'lineofsight', 'peculiar', 'velocities', 'to', 'the', 'observed', 'redshift', 'of', 'objects', 'breaks', 'the', 'translational', 'symmetry', 'of', 'the', 'underlying', 'theory', 'modifying', 'the', 'predicted', '2point', 'functions', 'these', 'wide', 'angle', 'effects', 'have', 'mostly', 'been', 'studied', 'using', 'linear', 'perturbation', 'theory', 'in', 'the', 'context', 'of', 'the', 'multipoles', 'of', 'the', 'correlation', 'function', 'and', 'power', 'spectrum', 'in', 'this', 'work', 'we', 'present', 'the', 'first', 'calculation', 'of', 'wide', 'angle', 'terms', 'in', 'the', 'zeldovich', 'approximation', 'which', 'is', 'known', 'to', 'be', 'more', 'accurate', 'than', 'linear', 'theory', 'on', 'scales', 'probed', 'by', 'the', 'next', 'generation', 'of', 'galaxy', 'surveys', 'we', 'present', 'the', 'exact', 'result', 'for', 'dark', 'matter', 'and', 'perturbatively', 'biased', 'tracers', 'as', 'well', 'as', 'the', 'small', 'angle', 'expansion', 'of', 'the', 'configuration', 'and', 'fourierspace', 'twopoint', 'functions', 'and', 'the', 'connection', 'to', 'the', 'multifrequency', 'angular', 'power', 'spectrum', 'we', 'compare', 'different', 'definitions', 'of', 'the', 'lineofsight', 'direction', 'and', 'discuss', 'how', 'to', 'translate', 'between', 'them', 'we', 'show', 'that', 'wide', 'angle', 'terms', 'can', 'reach', 'tens', 'of', 'percent', 'of', 'the', 'total', 'signal', 'in', 'a', 'measurement', 'at', 'low', 'redshift', 'in', 'some', 'approximations', 'and', 'that', 'a', 'generic', 'feature', 'of', 'wide', 'angle', 'effects', 'is', 'to', 'slightly', 'shift', 'the', 'baryon', 'acoustic', 'oscillation', 'scale']]
|
[-0.12108680295033297, 0.12438829094851704, -0.07408250766031946, 0.1026696188799158, -0.0905299861300632, -0.043540085209376606, 0.009471957623799007, 0.3585329563984794, -0.27110344721946156, -0.33410266572295616, 0.046468119539210595, -0.25823473604395986, -0.1010154729599154, 0.18447156355643038, 0.04130497806067212, 0.03148551435167954, -0.0010715046887066256, -0.029495514998620565, -0.11249240489759656, -0.1938682799835773, 0.31097043148409365, 0.1103630039011641, 0.2615521155151256, 0.05647851694165991, 0.10433825598558767, 0.0014806876633985994, -0.07394566972153994, 0.05445033557297076, -0.1455095185159367, 0.06161131225055439, 0.23350798216350166, 0.08212856957531964, 0.211181659409724, -0.3712959724813281, -0.21130691372444121, 0.08389492410861657, 0.15345193817034322, 0.13862637917738763, -0.021100560986463717, -0.2558434588280036, 0.06586465425527749, -0.18875694200736629, -0.16042391064294267, -0.06631147837020415, 0.005715496208926851, 0.03212233629663674, -0.20881811708860684, 0.15973802596681197, -0.002137429603464441, 0.04341946099099986, -0.03968760882062168, -0.11203024669006216, -0.020330875574380913, 0.11048684512484777, 0.07082080169518092, 0.04456110875478035, 0.13416971409924883, -0.16270284831466342, -0.05699097061643555, 0.4119424932195512, -0.10237440331997624, -0.162196720688698, 0.1391187962667828, -0.21847305722335836, -0.12802226401295178, 0.07918187214082546, 0.20037345516003585, 0.1310024133862488, -0.11454811477719733, 0.05918345954534048, -0.011977021711920336, 0.1789878914054232, 0.07617860432358438, 0.07479301382392825, 0.2313490488028201, 0.08134219520646828, 0.07158472008474716, 0.09854574207925458, -0.15072962919559482, -0.06360254700170055, -0.3017316617259986, -0.06532091251043066, -0.17139068482904118, 0.03335547392316074, -0.1179152320767295, -0.1466868722590937, 0.44537103452374427, 0.1517423542734403, 0.2285423438703076, 0.08645756254064212, 0.3358627869610235, 0.13735768764660422, 0.09218718846108806, 0.014095537160429057, 0.31769908916841527, 0.16444266995407245, 0.08578317989909164, -0.2158295744035937, 0.032443155146732384, 0.028120722857126024]
|
1,803.08186
|
Sensing Matrix Design via Capacity Maximization for Block Compressive
Sensing Applications
|
It is well established in the compressive sensing (CS) literature that
sensing matrices whose elements are drawn from independent random distributions
exhibit enhanced reconstruction capabilities. In many CS applications, such as
electromagnetic imaging, practical limitations on the measurement system
prevent one from generating sensing matrices in this fashion. Although one can
usually randomized the measurements to some degree, these sensing matrices do
not achieve the same reconstruction performance as the truly randomized sensing
matrices. In this paper, we present a novel method, based upon capacity
maximization, for designing sensing matrices with enhanced block-sparse signal
reconstruction capabilities. Through several numerical examples, we demonstrate
how our method significantly enhances reconstruction performance.
|
math.OC cs.IT eess.SP math.IT
|
it is well established in the compressive sensing cs literature that sensing matrices whose elements are drawn from independent random distributions exhibit enhanced reconstruction capabilities in many cs applications such as electromagnetic imaging practical limitations on the measurement system prevent one from generating sensing matrices in this fashion although one can usually randomized the measurements to some degree these sensing matrices do not achieve the same reconstruction performance as the truly randomized sensing matrices in this paper we present a novel method based upon capacity maximization for designing sensing matrices with enhanced blocksparse signal reconstruction capabilities through several numerical examples we demonstrate how our method significantly enhances reconstruction performance
|
[['it', 'is', 'well', 'established', 'in', 'the', 'compressive', 'sensing', 'cs', 'literature', 'that', 'sensing', 'matrices', 'whose', 'elements', 'are', 'drawn', 'from', 'independent', 'random', 'distributions', 'exhibit', 'enhanced', 'reconstruction', 'capabilities', 'in', 'many', 'cs', 'applications', 'such', 'as', 'electromagnetic', 'imaging', 'practical', 'limitations', 'on', 'the', 'measurement', 'system', 'prevent', 'one', 'from', 'generating', 'sensing', 'matrices', 'in', 'this', 'fashion', 'although', 'one', 'can', 'usually', 'randomized', 'the', 'measurements', 'to', 'some', 'degree', 'these', 'sensing', 'matrices', 'do', 'not', 'achieve', 'the', 'same', 'reconstruction', 'performance', 'as', 'the', 'truly', 'randomized', 'sensing', 'matrices', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'method', 'based', 'upon', 'capacity', 'maximization', 'for', 'designing', 'sensing', 'matrices', 'with', 'enhanced', 'blocksparse', 'signal', 'reconstruction', 'capabilities', 'through', 'several', 'numerical', 'examples', 'we', 'demonstrate', 'how', 'our', 'method', 'significantly', 'enhances', 'reconstruction', 'performance']]
|
[-0.07413384453350798, 0.08233256306106207, -0.020571639556266844, -0.03143050838283203, -0.04687553141778762, -0.17287330684431512, 0.028386480256129023, 0.4259835929703822, -0.32338193578457614, -0.30542291408199645, 0.15932321031962376, -0.2580444977678564, -0.2645545493183367, 0.195673292751612, -0.13775813454386154, 0.12750889454784572, 0.09556497441532108, 0.0050683274006453945, -0.13818703732589996, -0.23090320688868882, 0.21430357694284086, 0.10303618763616189, 0.35907757255769923, -0.002097504016934732, 0.0687664572807422, 0.04301882867803883, -0.03326693953040543, 0.005427896634701195, -0.033030002474383806, 0.12107724655385411, 0.3231418576869054, 0.21998583518248413, 0.25178382781103525, -0.43461214359678807, -0.26730776391069005, 0.11744248245868387, 0.20080424172145853, 0.12376793520097885, -0.1934859851437168, -0.27923303834854735, 0.09306829131780825, -0.1485498342183771, -0.018488469798493824, -0.12341247128168924, -0.10483273270117667, 0.003099149494611342, -0.3286253541725081, 0.04475418650844228, 0.02173911204343713, 0.03167079659093411, -0.048281714713218016, -0.18919664610566042, 0.14046227309528156, 0.12936754515736337, -0.018443987218859613, -0.033231082818804124, 0.18974349934846982, -0.0996360651285755, -0.13270607139966492, 0.35344674305802365, -0.02982220444304937, -0.24120841787940045, 0.2016309566407063, -0.11689282523963702, -0.1717105271645027, 0.15194965874532734, 0.2104656212373611, 0.1070525205241294, -0.14090983924742173, 0.05309407943603369, -0.03464237381832315, 0.14824892340415935, 0.03588253526666432, 0.11245495071121996, 0.11483641065776758, 0.1300164363838288, 0.12745319961072502, 0.11006803940255366, -0.07103910679296685, -0.04756681728304936, -0.19471415559496355, -0.10728054490247997, -0.27545928194213215, 0.009604688714725102, -0.12150818007502068, -0.15424244025499995, 0.38766973176885633, 0.2425345297744754, 0.1887498501124322, 0.0438881939524836, 0.40623243328252245, 0.05204032020805694, 0.07344618433693406, 0.046232024647739775, 0.24665473129973028, 0.16931528590380326, 0.13143006459288642, -0.17352494481660494, 0.07586562198185183, 0.02162987529086547]
|
1,803.08187
|
Nonmonotonic bias dependence of local spin accumulation signals in
ferromagnet/semiconductor lateral spin-valve devices
|
We find extraordinary behavior of the local two-terminal spin accumulation
signals in ferromagnet (FM)/semiconductor (SC) lateral spin-valve devices. With
respect to the bias voltage applied between two FM/SC Schottky tunnel contacts,
the local spin-accumulation signal can show nonmonotonic variations, including
a sign inversion. A part of the nonmonotonic features can be understood
qualitatively by considering the rapid reduction in the spin polarization of
the FM/SC interfaces with increasing bias voltage. In addition to the sign
inversion of the FM/SC interface spin polarization, the influence of the
spin-drift effect in the SC layer and the nonlinear electrical spin conversion
at a biased FM/SC contact are discussed.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
we find extraordinary behavior of the local twoterminal spin accumulation signals in ferromagnet fmsemiconductor sc lateral spinvalve devices with respect to the bias voltage applied between two fmsc schottky tunnel contacts the local spinaccumulation signal can show nonmonotonic variations including a sign inversion a part of the nonmonotonic features can be understood qualitatively by considering the rapid reduction in the spin polarization of the fmsc interfaces with increasing bias voltage in addition to the sign inversion of the fmsc interface spin polarization the influence of the spindrift effect in the sc layer and the nonlinear electrical spin conversion at a biased fmsc contact are discussed
|
[['we', 'find', 'extraordinary', 'behavior', 'of', 'the', 'local', 'twoterminal', 'spin', 'accumulation', 'signals', 'in', 'ferromagnet', 'fmsemiconductor', 'sc', 'lateral', 'spinvalve', 'devices', 'with', 'respect', 'to', 'the', 'bias', 'voltage', 'applied', 'between', 'two', 'fmsc', 'schottky', 'tunnel', 'contacts', 'the', 'local', 'spinaccumulation', 'signal', 'can', 'show', 'nonmonotonic', 'variations', 'including', 'a', 'sign', 'inversion', 'a', 'part', 'of', 'the', 'nonmonotonic', 'features', 'can', 'be', 'understood', 'qualitatively', 'by', 'considering', 'the', 'rapid', 'reduction', 'in', 'the', 'spin', 'polarization', 'of', 'the', 'fmsc', 'interfaces', 'with', 'increasing', 'bias', 'voltage', 'in', 'addition', 'to', 'the', 'sign', 'inversion', 'of', 'the', 'fmsc', 'interface', 'spin', 'polarization', 'the', 'influence', 'of', 'the', 'spindrift', 'effect', 'in', 'the', 'sc', 'layer', 'and', 'the', 'nonlinear', 'electrical', 'spin', 'conversion', 'at', 'a', 'biased', 'fmsc', 'contact', 'are', 'discussed']]
|
[-0.22372442467626438, 0.1274712006606668, -0.023460011409360517, 0.02882526295250553, -0.06728776157336328, -0.16658229860522358, 0.04123147593322888, 0.39327374730006004, -0.31804881754864767, -0.32860109155593004, 0.0035291477332560764, -0.27989942742312707, -0.1352788215159502, 0.19490571007148352, 0.015322163456924331, -0.012174931829523982, -0.04189839705065327, -0.06679451952968697, -0.12408430342227944, -0.152711666832244, 0.2533444637631618, -0.0005803115381090675, 0.3596934187949355, 0.10891681700691726, 0.06190056346121778, 0.017362987337796724, 0.08344939826689299, 0.09373235326368833, -0.0610708313343088, 0.007348233996664436, 0.25895844372803145, -0.12549893615667898, 0.1634808611169964, -0.47415523136993054, -0.17505380988699717, 0.0253636849031431, 0.09837073410038376, 0.18371996200345095, -0.08320796957411306, -0.2647580248891439, 0.058731850598332955, -0.1446309867450624, -0.0812860385228561, 0.01909056724528375, -0.008298772857388824, 0.04075822028222955, -0.26608381926724056, 0.11950777780300784, 0.09912976879825436, 0.1042891715029345, -0.001334722996582006, -0.11357210281766156, -0.10282132476658641, 0.09498267346434747, 0.04996430930383142, 0.013972274054890698, 0.2193827920105055, -0.1487534865330073, -0.14479627170898382, 0.24492492982484762, -0.09261748852271551, -0.16583441055461184, 0.13371356455292732, -0.20180505468935064, -0.01029555138327109, 0.10526966741670249, 0.14421459459202382, 0.05072418869093277, -0.15885455258986325, 0.05349567088522288, 0.07227781636061743, 0.14838563152634113, 0.05481256655354089, 0.018097617114143608, 0.2654458301376949, 0.19007686460481107, 0.09241834999903024, 0.18072548733676053, -0.1642037591336349, -0.039106185864476325, -0.22959606638980704, -0.14796944403821982, -0.17546557881688538, 0.08766135381697451, -0.09248675456260969, -0.17443030725405054, 0.47592832413908925, 0.18528619165378576, 0.19683174565163197, -0.05241595523757408, 0.27936765204355557, 0.18090362826959022, 0.10259301565786444, -0.004449833283942301, 0.2399541713044192, 0.17421992103460707, 0.1536865082922057, -0.38357622788549917, 0.18122539931944417, -0.06444071767313714]
|
1,803.08188
|
Using mm-Waves for Secret Key Establishment
|
The fact that Millimeter Wave (mmWave) communication needs to be directional
is usually perceived as a challenge; in this paper we argue that it enables
efficient secret key sharing that are unconditionally secure from passive
eavesdroppers, by building on packet erasures. We showcase the potential of our
approach in two setups: mmWave-based WiFi networks and vehicle platooning. We
show that in the first case, we can establish a few hundred secret bits with
minimal changes to standard communication protocol; while in both cases, with
the right choice of parameters, we can potentially establish keys in the order
of tenths of Mbps. These first results are based on some simplifying
assumptions, yet we believe they give incentives to further explore such
techniques.
|
cs.CR
|
the fact that millimeter wave mmwave communication needs to be directional is usually perceived as a challenge in this paper we argue that it enables efficient secret key sharing that are unconditionally secure from passive eavesdroppers by building on packet erasures we showcase the potential of our approach in two setups mmwavebased wifi networks and vehicle platooning we show that in the first case we can establish a few hundred secret bits with minimal changes to standard communication protocol while in both cases with the right choice of parameters we can potentially establish keys in the order of tenths of mbps these first results are based on some simplifying assumptions yet we believe they give incentives to further explore such techniques
|
[['the', 'fact', 'that', 'millimeter', 'wave', 'mmwave', 'communication', 'needs', 'to', 'be', 'directional', 'is', 'usually', 'perceived', 'as', 'a', 'challenge', 'in', 'this', 'paper', 'we', 'argue', 'that', 'it', 'enables', 'efficient', 'secret', 'key', 'sharing', 'that', 'are', 'unconditionally', 'secure', 'from', 'passive', 'eavesdroppers', 'by', 'building', 'on', 'packet', 'erasures', 'we', 'showcase', 'the', 'potential', 'of', 'our', 'approach', 'in', 'two', 'setups', 'mmwavebased', 'wifi', 'networks', 'and', 'vehicle', 'platooning', 'we', 'show', 'that', 'in', 'the', 'first', 'case', 'we', 'can', 'establish', 'a', 'few', 'hundred', 'secret', 'bits', 'with', 'minimal', 'changes', 'to', 'standard', 'communication', 'protocol', 'while', 'in', 'both', 'cases', 'with', 'the', 'right', 'choice', 'of', 'parameters', 'we', 'can', 'potentially', 'establish', 'keys', 'in', 'the', 'order', 'of', 'tenths', 'of', 'mbps', 'these', 'first', 'results', 'are', 'based', 'on', 'some', 'simplifying', 'assumptions', 'yet', 'we', 'believe', 'they', 'give', 'incentives', 'to', 'further', 'explore', 'such', 'techniques']]
|
[-0.2006450376015403, 0.0552562451315274, -0.04363288186213448, 0.042605157624564544, -0.060511527710001574, -0.21668918178347515, 0.09789523046967874, 0.43345016315348506, -0.2716118255899526, -0.30750688264083126, 0.11396150088441859, -0.24423236792429912, -0.19288051814949217, 0.20955930142624934, -0.14441316849205735, 0.07936452731705648, 0.04376244939351839, 0.01156515634256946, -0.01758625050564104, -0.28846781098183766, 0.31168802351159747, 0.034666476159333444, 0.27536610573961223, 0.07817574614304895, 0.05390833970159292, -0.031615979804018556, -0.020569508083257054, -0.08189444279880323, -0.10953432268945092, 0.12056871188554599, 0.3109622180677396, 0.15485700459242607, 0.3045209191031446, -0.47460239161236967, -0.23460664758304797, 0.10465818333770495, 0.173296801234049, 0.1507928890872685, -0.0634044418438561, -0.2729843035147887, 0.14926532445829516, -0.21771110448416722, -0.08314096773127941, -0.07177922907016002, -0.058844316396708334, 0.05648206183561778, -0.28820937051445494, 0.006637879618451245, 0.0027522932014558926, 0.0074417402290485124, 0.0031892316923900084, -0.0427743933309824, 0.04194924756037918, 0.16055802807927685, 0.0490906563345035, -0.022995296125357955, 0.09966730974876314, -0.09492420001640485, -0.12805684648207888, 0.3996328066588064, -0.037382952173332845, -0.19504032351369086, 0.16484461603339853, -0.09908538133344683, -0.13235293414582275, 0.05612249028905533, 0.19234983571073858, 0.07628771827040502, -0.14717175807680719, -0.007516539151961184, -0.056550297502612056, 0.21689470143111284, 0.0723193267144817, 0.1255502253549543, 0.1593829763452869, 0.16016547270273127, 0.11921216674968754, 0.09767237303428321, -0.08979430760464761, -0.09819496249441396, -0.2842070938064909, -0.1648901643824171, -0.19873044526681674, 0.044654905763820335, -0.09664670556140506, -0.052005959686261316, 0.3711383117099239, 0.2436708166564176, 0.13919232619449126, 0.08929552305643716, 0.37572071216384734, 0.0491286659851855, 0.07758732607264902, 0.13603206812827426, 0.24269323779990673, 0.037190094515142484, 0.09001557931711912, -0.10448155772375821, 0.10871854209348805, 0.0015989973725489348]
|
1,803.08189
|
Can Decentralized Status Update Achieve Universally Near-Optimal
Age-of-Information in Wireless Multiaccess Channels?
|
In an Internet-of-Things system where status data are collected from sensors
and actuators for time-critical applications, the freshness of data is vital
and can be quantified by the recently proposed age-of-information (AoI) metric.
In this paper, we first consider a general scenario where multiple terminals
share a common channel to transmit or receive randomly generated status
packets. The optimal scheduling problem to minimize AoI is formulated as a
restless multi-armed bandit problem. To solve the problem efficiently, we
derive the Whittle's index in closed-form and establish the indexability
thereof. Compared with existing work, we extend the index policy for AoI
optimization to incorporate stochastic packet arrivals and optimal packet
management (buffering the latest packet). Inspired by the index policy which
has near-optimal performance but is centralized by nature, a decentralized
status update scheme, i.e., the index-prioritized random access policy (IPRA),
is further proposed, achieving universally near-optimal AoI performance and
outperforming state-of-the-arts in the literature.
|
cs.IT cs.NI math.IT
|
in an internetofthings system where status data are collected from sensors and actuators for timecritical applications the freshness of data is vital and can be quantified by the recently proposed ageofinformation aoi metric in this paper we first consider a general scenario where multiple terminals share a common channel to transmit or receive randomly generated status packets the optimal scheduling problem to minimize aoi is formulated as a restless multiarmed bandit problem to solve the problem efficiently we derive the whittles index in closedform and establish the indexability thereof compared with existing work we extend the index policy for aoi optimization to incorporate stochastic packet arrivals and optimal packet management buffering the latest packet inspired by the index policy which has nearoptimal performance but is centralized by nature a decentralized status update scheme ie the indexprioritized random access policy ipra is further proposed achieving universally nearoptimal aoi performance and outperforming stateofthearts in the literature
|
[['in', 'an', 'internetofthings', 'system', 'where', 'status', 'data', 'are', 'collected', 'from', 'sensors', 'and', 'actuators', 'for', 'timecritical', 'applications', 'the', 'freshness', 'of', 'data', 'is', 'vital', 'and', 'can', 'be', 'quantified', 'by', 'the', 'recently', 'proposed', 'ageofinformation', 'aoi', 'metric', 'in', 'this', 'paper', 'we', 'first', 'consider', 'a', 'general', 'scenario', 'where', 'multiple', 'terminals', 'share', 'a', 'common', 'channel', 'to', 'transmit', 'or', 'receive', 'randomly', 'generated', 'status', 'packets', 'the', 'optimal', 'scheduling', 'problem', 'to', 'minimize', 'aoi', 'is', 'formulated', 'as', 'a', 'restless', 'multiarmed', 'bandit', 'problem', 'to', 'solve', 'the', 'problem', 'efficiently', 'we', 'derive', 'the', 'whittles', 'index', 'in', 'closedform', 'and', 'establish', 'the', 'indexability', 'thereof', 'compared', 'with', 'existing', 'work', 'we', 'extend', 'the', 'index', 'policy', 'for', 'aoi', 'optimization', 'to', 'incorporate', 'stochastic', 'packet', 'arrivals', 'and', 'optimal', 'packet', 'management', 'buffering', 'the', 'latest', 'packet', 'inspired', 'by', 'the', 'index', 'policy', 'which', 'has', 'nearoptimal', 'performance', 'but', 'is', 'centralized', 'by', 'nature', 'a', 'decentralized', 'status', 'update', 'scheme', 'ie', 'the', 'indexprioritized', 'random', 'access', 'policy', 'ipra', 'is', 'further', 'proposed', 'achieving', 'universally', 'nearoptimal', 'aoi', 'performance', 'and', 'outperforming', 'stateofthearts', 'in', 'the', 'literature']]
|
[-0.18105251376216888, -0.009460847347566559, -0.036868085072216526, 0.03961204459789626, -0.13441804048948383, -0.22780329373199493, 0.14322131094109194, 0.41715291929186177, -0.3111309477474271, -0.3150086189056502, 0.13824689212733096, -0.26219578302391855, -0.17446064968489258, 0.14004927325846725, -0.2044318149185672, 0.1291923818889221, 0.054575578208498066, 0.06040255325129501, 0.004706386632230868, -0.2821154315039932, 0.26207944566053093, 0.11228276622530661, 0.37284976902638417, 0.015019910592328463, 0.11446434734955944, 0.056523123181633356, -0.018363811704483323, -0.0039435783202000155, -0.09833964561575588, 0.0649430856321583, 0.35354980744274433, 0.23742229090758452, 0.32533051859048245, -0.4209422229021009, -0.24364022213251846, 0.11942476797680444, 0.1388636891916624, 0.05723300453284633, -0.05940370434913539, -0.2868235369494773, 0.12492826364254334, -0.22678591242354168, -0.023084257484266634, 0.02684016328758413, -0.04586536731221713, 0.037040711791058514, -0.3661443479604235, 0.031918806877863394, -0.05594471369343074, -0.02889126439051899, -0.09056069671580765, -0.11512663571537766, 0.06489590723312606, 0.15873176824013507, 0.07029269319824188, 0.029228271328304942, 0.11204266772600883, -0.09097002556480124, -0.21551879991974793, 0.361168293601, -0.0022286672932463453, -0.20405522848810315, 0.0768205329295597, 0.004980984863849651, -0.11486705195305771, 0.09432721439454901, 0.27991875476130335, 0.12616345903983242, -0.22370236559991577, 0.03734232866516227, -0.039771435423493755, 0.14951091220810717, 0.07350478860194255, 0.09091470362258597, 0.08430097543934703, 0.20770169311129538, 0.18238264754855713, 0.1668433768201411, -0.03073459380539134, -0.1515940279993964, -0.19693561167476123, -0.10219386860262603, -0.19245872119024984, 0.003955151076967779, -0.09151935139332061, -0.06763724486441597, 0.34425500097100475, 0.16651298309443519, 0.14519979536999017, 0.13665297412463637, 0.38329997345020894, 0.1327595565893908, -0.009318069745954984, 0.20215889954277755, 0.1785080831461145, 0.04389095537235813, 0.16602638098227449, -0.217692990510075, 0.14490826042540567, 0.011834071397683337]
|
1,803.0819
|
Deep Pose Consensus Networks
|
In this paper, we address the problem of estimating a 3D human pose from a
single image, which is important but difficult to solve due to many reasons,
such as self-occlusions, wild appearance changes, and inherent ambiguities of
3D estimation from a 2D cue. These difficulties make the problem ill-posed,
which have become requiring increasingly complex estimators to enhance the
performance. On the other hand, most existing methods try to handle this
problem based on a single complex estimator, which might not be good solutions.
In this paper, to resolve this issue, we propose a
multiple-partial-hypothesis-based framework for the problem of estimating 3D
human pose from a single image, which can be fine-tuned in an end-to-end
fashion. We first select several joint groups from a human joint model using
the proposed sampling scheme, and estimate the 3D poses of each joint group
separately based on deep neural networks. After that, they are aggregated to
obtain the final 3D poses using the proposed robust optimization formula. The
overall procedure can be fine-tuned in an end-to-end fashion, resulting in
better performance. In the experiments, the proposed framework shows the
state-of-the-art performances on popular benchmark data sets, namely Human3.6M
and HumanEva, which demonstrate the effectiveness of the proposed framework.
|
cs.CV
|
in this paper we address the problem of estimating a 3d human pose from a single image which is important but difficult to solve due to many reasons such as selfocclusions wild appearance changes and inherent ambiguities of 3d estimation from a 2d cue these difficulties make the problem illposed which have become requiring increasingly complex estimators to enhance the performance on the other hand most existing methods try to handle this problem based on a single complex estimator which might not be good solutions in this paper to resolve this issue we propose a multiplepartialhypothesisbased framework for the problem of estimating 3d human pose from a single image which can be finetuned in an endtoend fashion we first select several joint groups from a human joint model using the proposed sampling scheme and estimate the 3d poses of each joint group separately based on deep neural networks after that they are aggregated to obtain the final 3d poses using the proposed robust optimization formula the overall procedure can be finetuned in an endtoend fashion resulting in better performance in the experiments the proposed framework shows the stateoftheart performances on popular benchmark data sets namely human36m and humaneva which demonstrate the effectiveness of the proposed framework
|
[['in', 'this', 'paper', 'we', 'address', 'the', 'problem', 'of', 'estimating', 'a', '3d', 'human', 'pose', 'from', 'a', 'single', 'image', 'which', 'is', 'important', 'but', 'difficult', 'to', 'solve', 'due', 'to', 'many', 'reasons', 'such', 'as', 'selfocclusions', 'wild', 'appearance', 'changes', 'and', 'inherent', 'ambiguities', 'of', '3d', 'estimation', 'from', 'a', '2d', 'cue', 'these', 'difficulties', 'make', 'the', 'problem', 'illposed', 'which', 'have', 'become', 'requiring', 'increasingly', 'complex', 'estimators', 'to', 'enhance', 'the', 'performance', 'on', 'the', 'other', 'hand', 'most', 'existing', 'methods', 'try', 'to', 'handle', 'this', 'problem', 'based', 'on', 'a', 'single', 'complex', 'estimator', 'which', 'might', 'not', 'be', 'good', 'solutions', 'in', 'this', 'paper', 'to', 'resolve', 'this', 'issue', 'we', 'propose', 'a', 'multiplepartialhypothesisbased', 'framework', 'for', 'the', 'problem', 'of', 'estimating', '3d', 'human', 'pose', 'from', 'a', 'single', 'image', 'which', 'can', 'be', 'finetuned', 'in', 'an', 'endtoend', 'fashion', 'we', 'first', 'select', 'several', 'joint', 'groups', 'from', 'a', 'human', 'joint', 'model', 'using', 'the', 'proposed', 'sampling', 'scheme', 'and', 'estimate', 'the', '3d', 'poses', 'of', 'each', 'joint', 'group', 'separately', 'based', 'on', 'deep', 'neural', 'networks', 'after', 'that', 'they', 'are', 'aggregated', 'to', 'obtain', 'the', 'final', '3d', 'poses', 'using', 'the', 'proposed', 'robust', 'optimization', 'formula', 'the', 'overall', 'procedure', 'can', 'be', 'finetuned', 'in', 'an', 'endtoend', 'fashion', 'resulting', 'in', 'better', 'performance', 'in', 'the', 'experiments', 'the', 'proposed', 'framework', 'shows', 'the', 'stateoftheart', 'performances', 'on', 'popular', 'benchmark', 'data', 'sets', 'namely', 'human36m', 'and', 'humaneva', 'which', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'framework']]
|
[-0.0176959361733369, -0.051953236657484414, -0.07830468016698477, 0.06502328191815716, -0.09286007411300955, -0.16953938593860807, 0.005738436125173438, 0.41621361947277696, -0.27445384356045593, -0.35589134256787053, 0.11508567167684526, -0.23403651066487882, -0.22677749807225178, 0.20630997475832927, -0.17738044726003596, 0.1130827398499383, 0.14019256915908487, 0.024902302338798508, -0.08512578695592266, -0.25736798590259263, 0.3117250457076674, 0.033658886193042255, 0.3461900302367966, 0.024563931523844965, 0.1300338922028725, -0.009054248124679051, -0.027342619257411216, 0.026418075671919235, -0.05993498812742651, 0.19608492808606015, 0.2869099423448305, 0.157353925332498, 0.31729109705164577, -0.4368157961814687, -0.22738984765984663, 0.1188210702512595, 0.1755891211103739, 0.13784285649237019, -0.05262944280601493, -0.3313574064114108, 0.09515989815316549, -0.16105702847991957, -0.013929608893558019, -0.10259503456423195, -0.0584615617286323, -0.05692796600903044, -0.2985713468484081, 0.061007087413085304, 0.02700588122214668, 0.0144935784316281, -0.06948307759423808, -0.09302349878906659, 0.051277498049070926, 0.19490900092826383, 0.06711814342543665, 0.04333864434071385, 0.10399362498485461, -0.1664426501590486, -0.12096368059652245, 0.40648994936448773, -0.016803156838343457, -0.2633235188450937, 0.18817882433351946, -0.04650099339963096, -0.16303265311687096, 0.11405962925495171, 0.23980240513139017, 0.14591830814542622, -0.16921772533607465, 0.025157045894699942, -0.06305078196271163, 0.17259172655460311, 0.007539607203997127, -0.016431970669527358, 0.19257688860000088, 0.2232164210810258, 0.05465418154050074, 0.127974160374199, -0.1546098817980326, -0.05275206963145515, -0.20007281390859222, -0.10665198980785179, -0.1687255655222277, -0.025738033578978147, -0.07934139845871492, -0.1668110684217692, 0.4078985091577612, 0.2605388093592099, 0.24701600793930817, 0.06295725057503526, 0.36314010774580446, 0.0741152675964347, 0.06919241618143576, 0.06388143107590334, 0.1996598395314522, -0.008503930863538166, 0.0867654231490522, -0.19397412639838166, 0.08505355365994591, 0.06178022863161636]
|
1,803.08191
|
Hyperbolic Blockade: Suppression of the Photonic Density of States and
the Spontaneous Emission Rate at the Interface with Conducting Medium
|
Surface scattering of free electrons strongly modifies the electromagnetic
response near the interface. Due to the inherent anisotropy of the surface
scattering that necessarily reverses the normal the interface component of the
electron velocity while its tangential component may remain the same, a thin
layer near a high-quality interface shows strong dielectric anisotropy. The
formation of the resulting hyperbolic dispersion layers near the
metal-dielectric interface strongly modifies the local density of states, and
leads to orders of magnitude changes in all associated phenomena.
|
physics.optics
|
surface scattering of free electrons strongly modifies the electromagnetic response near the interface due to the inherent anisotropy of the surface scattering that necessarily reverses the normal the interface component of the electron velocity while its tangential component may remain the same a thin layer near a highquality interface shows strong dielectric anisotropy the formation of the resulting hyperbolic dispersion layers near the metaldielectric interface strongly modifies the local density of states and leads to orders of magnitude changes in all associated phenomena
|
[['surface', 'scattering', 'of', 'free', 'electrons', 'strongly', 'modifies', 'the', 'electromagnetic', 'response', 'near', 'the', 'interface', 'due', 'to', 'the', 'inherent', 'anisotropy', 'of', 'the', 'surface', 'scattering', 'that', 'necessarily', 'reverses', 'the', 'normal', 'the', 'interface', 'component', 'of', 'the', 'electron', 'velocity', 'while', 'its', 'tangential', 'component', 'may', 'remain', 'the', 'same', 'a', 'thin', 'layer', 'near', 'a', 'highquality', 'interface', 'shows', 'strong', 'dielectric', 'anisotropy', 'the', 'formation', 'of', 'the', 'resulting', 'hyperbolic', 'dispersion', 'layers', 'near', 'the', 'metaldielectric', 'interface', 'strongly', 'modifies', 'the', 'local', 'density', 'of', 'states', 'and', 'leads', 'to', 'orders', 'of', 'magnitude', 'changes', 'in', 'all', 'associated', 'phenomena']]
|
[-0.20257954749402152, 0.18698909137599978, -0.06803971980642302, 0.003991042028170034, -0.08646563716030803, -0.07992320795577154, -0.013555137873963868, 0.3560051100485655, -0.3424482118585203, -0.2844654590968626, -0.0115086227747982, -0.31034599989652634, -0.10655528433194542, 0.16850914500923042, 0.05135230130953602, -0.015207466916938549, -0.005718810321112354, -0.027501141472932804, -0.11150461941093476, -0.13529773182460073, 0.33333298619359686, 0.04557412100888519, 0.3634177506648857, 0.12476010841642876, 0.046398438726473284, 0.05351800968062626, 0.0466105288332216, 0.05026011512311826, -0.09560042883717267, 0.11828543791270055, 0.18252217769622803, -0.119592620747119, 0.1960529465654708, -0.4764183185635561, -0.22094103623271347, -0.022563364822417498, 0.14075598701924444, 0.09881758567293634, -0.06888436394356505, -0.2350723477058023, 0.017391870345314402, -0.0700124738547188, -0.22264619558735424, 0.03626112056424819, -0.027196391519293726, 0.015675529646154224, -0.21336150868215137, 0.1394912855901632, 0.1034192453834217, 0.008738213608669767, -0.11102726080606366, -0.055602589941931416, -0.1500564177341041, 0.08134176463719053, 0.06853852426655681, 0.03459368441927146, 0.2141294614646825, -0.19228324874203248, 0.0022974056921091423, 0.3669519296970712, -0.08503962642546878, -0.11253477170984878, 0.2456389170866572, -0.2281678901558899, 0.025029927778270948, 0.24642462375102542, 0.17772001616028418, 0.07000178707965526, -0.09913643292454352, 0.10776229681242369, 0.014618278934104166, 0.19162371834313655, 0.09031331527933299, 0.04136760567079287, 0.2740765850183116, 0.11194462780504072, 0.099087443202734, 0.1248420003173222, -0.1440394933073198, -0.011746034665728908, -0.27686069988791484, -0.182097622608564, -0.14964183426815567, -0.017439941690494138, -0.10955372693526266, -0.26599323213751236, 0.4293966755125088, 0.10114483035264918, 0.18337613557386828, -0.04230422257299883, 0.2673053444497826, 0.14702987058595923, 0.09695288016606705, 0.1158020355688206, 0.307750884465963, 0.1763005367682192, 0.087483680459386, -0.3245207500329847, 0.14670890792979893, -0.01675695205298084]
|
1,803.08192
|
Relative singularity categories II: DG models
|
We study the relationship between singularity categories and relative
singularity categories and discuss constructions of differential graded
algebras of relative singularity categories. As consequences, we obtain
structural results, which are known or generalise known results, on singularity
categories of algebras with radical square zero, of non-commutative
deformations of Kleinian singularities, of $SL_3(\mathbb{C})$-quotient
singularities and of Gorenstein toric threefolds.
|
math.AG math.CT math.RT
|
we study the relationship between singularity categories and relative singularity categories and discuss constructions of differential graded algebras of relative singularity categories as consequences we obtain structural results which are known or generalise known results on singularity categories of algebras with radical square zero of noncommutative deformations of kleinian singularities of sl_3mathbbcquotient singularities and of gorenstein toric threefolds
|
[['we', 'study', 'the', 'relationship', 'between', 'singularity', 'categories', 'and', 'relative', 'singularity', 'categories', 'and', 'discuss', 'constructions', 'of', 'differential', 'graded', 'algebras', 'of', 'relative', 'singularity', 'categories', 'as', 'consequences', 'we', 'obtain', 'structural', 'results', 'which', 'are', 'known', 'or', 'generalise', 'known', 'results', 'on', 'singularity', 'categories', 'of', 'algebras', 'with', 'radical', 'square', 'zero', 'of', 'noncommutative', 'deformations', 'of', 'kleinian', 'singularities', 'of', 'sl_3mathbbcquotient', 'singularities', 'and', 'of', 'gorenstein', 'toric', 'threefolds']]
|
[-0.17829033276556353, -0.0859180850001346, -0.1077502469221751, 0.16901253167082342, -0.0801156384772376, -0.21600369605840297, -0.10716673668694536, 0.3295874971112138, -0.34975697547850904, -0.16920326702427446, 0.12789401413644091, -0.3036177036630219, -0.16934000103113553, 0.1256637385139536, -0.24213169204692045, -0.07544233985735398, 0.06275927584226194, 0.07978561366172998, -0.19427586596851287, -0.35092423893429603, 0.5902741617408761, -0.0021534123000476442, 0.22438698828122333, 0.10651061168806464, 0.10448157489953334, -0.01912842226100334, -0.044987691631704047, 0.03901307454757523, -0.27229272515365954, 0.09054603597574067, 0.34728662225238066, 0.006229819721754706, 0.11005401127693946, -0.3730602640854685, -0.07643720811527026, 0.1564574248214628, 0.1559462041692122, 0.07767562238752776, 0.0031475553660767906, -0.29962776073565084, 0.07196824327764804, -0.22234590475962154, -0.17630399623068801, -0.08624641290097906, 0.05536828466217246, 0.07723029151869316, -0.13343975552472107, 0.06385585289089042, 0.11455492759577873, 0.21044806353421064, -0.09266234984163914, -0.06207479030024587, -0.11244763409833244, 0.05910578896618334, 0.01430130452571208, -0.09418655285333986, 0.14063032872550058, -0.16312634022579642, -0.24185410976050453, 0.3264150803320502, 0.008618868307390233, -0.17188604177678363, 0.17103542926672258, -0.1916034840570207, -0.10447986940281433, 0.11641691667599637, 0.0020940474054792473, 0.17034839361644627, 0.032608996308817154, 0.16834820524009206, -0.03863341426640226, -0.01421359852936707, 0.21286716319522575, 0.059370236144515504, 0.16319205578449264, 0.08604142716840694, 0.022424670892130388, 0.12923383908019515, 0.006128914650170165, -0.05893427715687849, -0.4227802478299852, -0.1817386402797542, -0.020304665929360085, 0.18940228236871853, -0.13901675238377179, -0.22282871457119063, 0.3887715800420234, 0.06432794998481609, 0.2296569778077435, 0.12197264782439002, 0.1681218138924522, -0.04117034300712444, 0.09518350327485486, -0.05656657532968542, 0.1328566125716622, 0.2947539687156677, -0.056741569803929644, -0.07911259962017075, -0.06568370007076546, 0.22655023696521917]
|
1,803.08193
|
The Epistemology of Nondeterminism
|
This paper proposes new semantics for nondeterministic program execution,
replacing the standard relational semantics for propositional dynamic logic
(PDL). Under these new semantics, program execution is represented as
fundamentally deterministic (i.e., functional), while nondeterminism emerges as
an epistemic relationship between the agent and the system: intuitively, the
nondeterministic outcomes of a given process are precisely those that cannot be
ruled out in advance. We formalize these notions using topology and the
framework of dynamic topological logic (DTL). We show that DTL can be used to
interpret the language of PDL in a manner that captures the intuition above,
and moreover that continuous functions in this setting correspond exactly to
deterministic processes. We also prove that certain axiomatizations of PDL
remain sound and complete with respect to the corresponding classes of dynamic
topological models. Finally, we extend the framework to incorporate knowledge
using the machinery of subset space logic, and show that the topological
interpretation of public announcements coincides exactly with a natural
interpretation of test programs.
|
cs.LO
|
this paper proposes new semantics for nondeterministic program execution replacing the standard relational semantics for propositional dynamic logic pdl under these new semantics program execution is represented as fundamentally deterministic ie functional while nondeterminism emerges as an epistemic relationship between the agent and the system intuitively the nondeterministic outcomes of a given process are precisely those that cannot be ruled out in advance we formalize these notions using topology and the framework of dynamic topological logic dtl we show that dtl can be used to interpret the language of pdl in a manner that captures the intuition above and moreover that continuous functions in this setting correspond exactly to deterministic processes we also prove that certain axiomatizations of pdl remain sound and complete with respect to the corresponding classes of dynamic topological models finally we extend the framework to incorporate knowledge using the machinery of subset space logic and show that the topological interpretation of public announcements coincides exactly with a natural interpretation of test programs
|
[['this', 'paper', 'proposes', 'new', 'semantics', 'for', 'nondeterministic', 'program', 'execution', 'replacing', 'the', 'standard', 'relational', 'semantics', 'for', 'propositional', 'dynamic', 'logic', 'pdl', 'under', 'these', 'new', 'semantics', 'program', 'execution', 'is', 'represented', 'as', 'fundamentally', 'deterministic', 'ie', 'functional', 'while', 'nondeterminism', 'emerges', 'as', 'an', 'epistemic', 'relationship', 'between', 'the', 'agent', 'and', 'the', 'system', 'intuitively', 'the', 'nondeterministic', 'outcomes', 'of', 'a', 'given', 'process', 'are', 'precisely', 'those', 'that', 'can', 'not', 'be', 'ruled', 'out', 'in', 'advance', 'we', 'formalize', 'these', 'notions', 'using', 'topology', 'and', 'the', 'framework', 'of', 'dynamic', 'topological', 'logic', 'dtl', 'we', 'show', 'that', 'dtl', 'can', 'be', 'used', 'to', 'interpret', 'the', 'language', 'of', 'pdl', 'in', 'a', 'manner', 'that', 'captures', 'the', 'intuition', 'above', 'and', 'moreover', 'that', 'continuous', 'functions', 'in', 'this', 'setting', 'correspond', 'exactly', 'to', 'deterministic', 'processes', 'we', 'also', 'prove', 'that', 'certain', 'axiomatizations', 'of', 'pdl', 'remain', 'sound', 'and', 'complete', 'with', 'respect', 'to', 'the', 'corresponding', 'classes', 'of', 'dynamic', 'topological', 'models', 'finally', 'we', 'extend', 'the', 'framework', 'to', 'incorporate', 'knowledge', 'using', 'the', 'machinery', 'of', 'subset', 'space', 'logic', 'and', 'show', 'that', 'the', 'topological', 'interpretation', 'of', 'public', 'announcements', 'coincides', 'exactly', 'with', 'a', 'natural', 'interpretation', 'of', 'test', 'programs']]
|
[-0.084329205860724, 0.06455497533331478, -0.10260555983247782, 0.12045336189416168, -0.14828368804757736, -0.1554093100493049, 0.08212116520787717, 0.39536971393638026, -0.3511079749772827, -0.28824329712953767, 0.049180557857222945, -0.20931901112979578, -0.15972628789078333, 0.172766516375506, -0.1453305320280275, 0.06521451618790092, 0.02809932423353998, 0.045470843218478885, -0.05200102610212422, -0.20632797744666076, 0.32265047085036463, -0.018639081251155026, 0.22610684474762863, 0.016539404630552264, 0.09804585010571751, 0.036487024184037556, 0.012070636169303175, 0.10325226190964926, -0.09027408642691218, 0.12388016379153925, 0.33214132687241876, 0.25978671631379846, 0.2656537546674459, -0.44381262767993046, -0.16099346791042718, 0.08893876719082187, 0.05849325644900788, 0.09493547533833963, 0.06449092965723646, -0.3186694911575157, 0.08619063427047191, -0.1939084695228292, -0.0536265918541655, -0.14451553273254525, 0.00449177915854993, -0.013976389197507193, -0.22979257783007634, -0.0316624696142372, 0.17445408053623657, 0.08786970426044065, -0.060108470599429156, -0.05088311294773398, -0.018118443151567867, 0.09498330098325888, -0.019050369468764376, 0.010267896081382287, 0.11129925559863203, -0.07324331021772887, -0.25567646961224205, 0.36190067867965936, -0.03368253646938487, -0.19518623969512072, 0.19122685954772203, -0.08729522313342658, -0.18436591454689574, 0.0733742934852437, 0.1334067865436573, 0.10614354741162882, -0.15881699967354224, 0.11290139334191272, -0.07731726305687543, 0.21767442493872372, 0.09133582176573708, 0.08514344867341175, 0.20106228600774786, 0.1947594653615661, 0.0498519874412098, 0.17240030192707326, 0.05993580650315135, -0.15581190229733727, -0.36217190031084917, -0.18473031900650236, -0.08794671103419613, -0.027002224620500673, -0.057380249497496726, -0.18418422423883113, 0.3603152643476507, 0.21544187200885867, 0.1540404425342818, 0.18975986330630537, 0.28483373511995297, 0.11796419276621661, 0.04479999967410179, 0.06104450352618214, 0.14146239974697727, 0.08272098980754793, 0.11339003774114399, -0.1642236247425899, 0.16097855202095238, 0.06451661488693765]
|
1,803.08194
|
Activation cross sections of Proton Induced Nuclear Reactions on
neodymium up to 65 MeV
|
In the frame of a systematic study of the activation cross sections of
charged particle induced nuclear reactions on rare earths for production of
therapeutic radionuclides, proton induced reactions on neodymium were measured
up to 65 MeV energy, above 45 MeV for the first time. The excitation functions
of the natNd(p,x)150,149,148m,148g,146,144,143,141Pm,
149,147,141,140,139m,138Nd, 142,138mPr and 139gCe nuclear reactions were
assessed by using stacked foil activation technique and high resolution
gamma-spectrometry. The excitation functions were compared to the theoretical
predictions, available in the TENDL-2015 library based on latest version of the
TALYS code. The application of the data for medical isotope production is
shortly discussed.
|
nucl-ex
|
in the frame of a systematic study of the activation cross sections of charged particle induced nuclear reactions on rare earths for production of therapeutic radionuclides proton induced reactions on neodymium were measured up to 65 mev energy above 45 mev for the first time the excitation functions of the natndpx150149148m148g146144143141pm 149147141140139m138nd 142138mpr and 139gce nuclear reactions were assessed by using stacked foil activation technique and high resolution gammaspectrometry the excitation functions were compared to the theoretical predictions available in the tendl2015 library based on latest version of the talys code the application of the data for medical isotope production is shortly discussed
|
[['in', 'the', 'frame', 'of', 'a', 'systematic', 'study', 'of', 'the', 'activation', 'cross', 'sections', 'of', 'charged', 'particle', 'induced', 'nuclear', 'reactions', 'on', 'rare', 'earths', 'for', 'production', 'of', 'therapeutic', 'radionuclides', 'proton', 'induced', 'reactions', 'on', 'neodymium', 'were', 'measured', 'up', 'to', '65', 'mev', 'energy', 'above', '45', 'mev', 'for', 'the', 'first', 'time', 'the', 'excitation', 'functions', 'of', 'the', 'natndpx150149148m148g146144143141pm', '149147141140139m138nd', '142138mpr', 'and', '139gce', 'nuclear', 'reactions', 'were', 'assessed', 'by', 'using', 'stacked', 'foil', 'activation', 'technique', 'and', 'high', 'resolution', 'gammaspectrometry', 'the', 'excitation', 'functions', 'were', 'compared', 'to', 'the', 'theoretical', 'predictions', 'available', 'in', 'the', 'tendl2015', 'library', 'based', 'on', 'latest', 'version', 'of', 'the', 'talys', 'code', 'the', 'application', 'of', 'the', 'data', 'for', 'medical', 'isotope', 'production', 'is', 'shortly', 'discussed']]
|
[0.02598398349087949, 0.18757001796003545, -0.0075972050333141606, 0.10164882744206209, 0.045664787821053064, -0.06866183813668392, 0.0583207593534631, 0.3964221021442702, -0.2062611583846085, -0.31828542249371305, 0.0035499471093932487, -0.3586139813009085, 0.045230888728654446, 0.2308123457254936, 0.0507123322241394, 0.10021046395742833, 0.11192389241786617, 0.03267404071591569, -0.03381667629641603, -0.18195136907425793, 0.27546538851891805, 0.20200035786914705, 0.2642426288150477, 0.16047265843460054, 0.07072885836018343, 0.005666137915198701, -0.05397266636230992, -0.09775618455288085, -0.15399271930506772, 0.12114889403297142, 0.2512039780743759, 0.10005584062368732, 0.13839717244616512, -0.4417538624633141, -0.17289105722694798, 0.03938570389091366, 0.07756088654313123, 0.09117589559584781, -0.12178626661588711, -0.2653289564856977, 0.08437054891214528, -0.20149977246506345, -0.06502877620067636, -0.0533940378068523, 0.01269550201723545, 0.09872421561834412, -0.24993557304219163, 0.06664188706193759, -0.06296716446075777, 0.1330380382797107, -0.14568973232455779, -0.2420367795522466, -0.0242325224292775, 0.049212844421466194, 0.037127586276825476, 0.05340055138992165, 0.2471746787278339, -0.0926564095043248, -0.1246649966095433, 0.3712465232520392, -0.058120689868710634, -0.09112851627904808, 0.10997033574750101, -0.14228249220365677, -0.13110678583957405, 0.2026932229372588, 0.20920612795673538, 0.1505531577694446, -0.21416302606689208, 0.03051297862736527, 0.06567066148713682, 0.15092682181340125, 0.12550833599284442, -0.029094930263142093, 0.10911339229076272, 0.2392666370977149, -0.08545532224304749, 0.09705672601139116, -0.1838619989093694, -0.05575123464105406, -0.3076547878145268, -0.1368011376641766, -0.10017522295344282, 0.054624898573195545, 0.002658424772277493, -0.09376759197788709, 0.39583946442269163, 0.061032254803888124, 0.18681095320392738, -0.031737211677763194, 0.295329997823997, 0.05987187604316407, 0.08842236836319742, -0.007391351712585399, 0.28243551220782476, 0.18094417731738602, 0.10972286116877439, -0.23896659034388987, 0.10017535281414637, 0.00921980151671427]
|
1,803.08195
|
Extrapolating quantum observables with machine learning: Inferring
multiple phase transitions from properties of a single phase
|
We present a machine-learning method for predicting sharp transitions in a
Hamiltonian phase diagram by extrapolating the properties of quantum systems.
The method is based on Gaussian Process regression with a combination of
kernels chosen through an iterative procedure maximizing the predicting power
of the kernels. The method is capable of extrapolating across the transition
lines. The calculations within a given phase can be used to predict not only
the closest sharp transition, but also a transition removed from the available
data by a separate phase. This makes the present method particularly valuable
for searching phase transitions in the parts of the parameter space that cannot
be probed experimentally or theoretically.
|
cond-mat.other cond-mat.str-el quant-ph
|
we present a machinelearning method for predicting sharp transitions in a hamiltonian phase diagram by extrapolating the properties of quantum systems the method is based on gaussian process regression with a combination of kernels chosen through an iterative procedure maximizing the predicting power of the kernels the method is capable of extrapolating across the transition lines the calculations within a given phase can be used to predict not only the closest sharp transition but also a transition removed from the available data by a separate phase this makes the present method particularly valuable for searching phase transitions in the parts of the parameter space that cannot be probed experimentally or theoretically
|
[['we', 'present', 'a', 'machinelearning', 'method', 'for', 'predicting', 'sharp', 'transitions', 'in', 'a', 'hamiltonian', 'phase', 'diagram', 'by', 'extrapolating', 'the', 'properties', 'of', 'quantum', 'systems', 'the', 'method', 'is', 'based', 'on', 'gaussian', 'process', 'regression', 'with', 'a', 'combination', 'of', 'kernels', 'chosen', 'through', 'an', 'iterative', 'procedure', 'maximizing', 'the', 'predicting', 'power', 'of', 'the', 'kernels', 'the', 'method', 'is', 'capable', 'of', 'extrapolating', 'across', 'the', 'transition', 'lines', 'the', 'calculations', 'within', 'a', 'given', 'phase', 'can', 'be', 'used', 'to', 'predict', 'not', 'only', 'the', 'closest', 'sharp', 'transition', 'but', 'also', 'a', 'transition', 'removed', 'from', 'the', 'available', 'data', 'by', 'a', 'separate', 'phase', 'this', 'makes', 'the', 'present', 'method', 'particularly', 'valuable', 'for', 'searching', 'phase', 'transitions', 'in', 'the', 'parts', 'of', 'the', 'parameter', 'space', 'that', 'can', 'not', 'be', 'probed', 'experimentally', 'or', 'theoretically']]
|
[-0.0737385056797523, 0.11420128303780075, -0.12171195450355299, 0.05914295049772785, -0.041483418084681034, -0.13503865680624066, 0.1154581143044717, 0.39750450869489995, -0.2555001402007682, -0.28303495183354244, 0.09988254641107883, -0.25707916489253485, -0.1557867149926356, 0.20016078486722627, 0.017309245468433283, 0.06171130834679518, 0.04801127085063074, 0.015187339782382228, -0.11337694213684049, -0.1752140626111733, 0.3185896282416901, 0.05294001613531561, 0.2699021476686799, 0.028192428809623898, 0.05922899684498718, -0.01857747376197949, 0.012070935681029888, 0.018966043351091293, -0.11357007161788195, 0.0836085552665671, 0.2656870882534089, 0.11173132154882685, 0.24655147199518979, -0.376976682347179, -0.23794986528810114, 0.12360429636776514, 0.14703185680472025, 0.12334656959865242, -0.05019601279075557, -0.30506303765079273, 0.03405934123189321, -0.11165120807709172, -0.1004044567733737, -0.1309144402995506, -0.043029053369536996, -0.0068414570497615, -0.29042921582004055, 0.06985544847572912, 0.026047550890195583, 0.03137792565127841, -0.042005523197336254, -0.07484588534758327, -0.001050963972894741, 0.14012854247994255, -0.03691229031729953, 0.0411512182493295, 0.11498975941296001, -0.10973463297913051, -0.0968816339487343, 0.39451846230908166, -0.0793927916778817, -0.1673244407762208, 0.14261804664316255, -0.12161405128218965, -0.11935099112452008, 0.19252718496136367, 0.1620267868191669, 0.1652224489828638, -0.16963548245673468, 0.03173269852829565, 0.02232926764658519, 0.1845554481198113, -0.021481624253543226, -0.03317090892440839, 0.22234298267202185, 0.1819712134643591, 0.018156241802249236, 0.1701994709858679, -0.11450589797667428, -0.08536937717768264, -0.2920479196888794, -0.12909103227554755, -0.26010918501664754, -0.040451544174564855, -0.09578582443230386, -0.17040957305912993, 0.414643513367212, 0.17890844812167675, 0.2566357461536037, 0.01565705133102061, 0.30740326598502826, 0.15299737323948648, 0.07908011199158084, 0.06348588836096626, 0.26185668059042655, 0.08547221702506899, 0.07732333831206363, -0.20403550110599358, 0.12238109976169653, 0.0724914596565733]
|
1,803.08196
|
Distortion of Magnetic Fields in a Starless Core III:
Polarization--Extinction Relationship in FeSt 1-457
|
The relationship between dust polarization and extinction was determined for
the cold dense starless molecular cloud core FeSt 1-457 based on the background
star polarimetry of dichroic extinction at near-infrared wavelengths. Owing to
the known (three-dimensional) magnetic field structure, the observed
polarizations from the core were corrected by considering (a) the subtraction
of the ambient polarization component, (b) the depolarization effect of
inclined distorted magnetic fields, and (c) the magnetic inclination angle of
the core. After these corrections, a linear relationship between polarization
and extinction was obtained for the core in the range up to $A_V \approx 20$
mag. The initial polarization vs. extinction diagram changed dramatically after
the corrections of (a) to (c), with the correlation coefficient being refined
from 0.71 to 0.79. These corrections should affect the theoretical
interpretation of the observational data. The slope of the finally obtained
polarization--extinction relationship is $P_H / E_{H-K_s} = 11.00 \pm 0.72$
$\%$ ${\rm mag}^{-1}$, which is close to the statistically estimated upper
limit of the interstellar polarization efficiency (Jones 1989). This
consistency suggests that the upper limit of interstellar polarization
efficiency might be determined by the observational viewing angle toward
polarized astronomical objects.
|
astro-ph.GA
|
the relationship between dust polarization and extinction was determined for the cold dense starless molecular cloud core fest 1457 based on the background star polarimetry of dichroic extinction at nearinfrared wavelengths owing to the known threedimensional magnetic field structure the observed polarizations from the core were corrected by considering a the subtraction of the ambient polarization component b the depolarization effect of inclined distorted magnetic fields and c the magnetic inclination angle of the core after these corrections a linear relationship between polarization and extinction was obtained for the core in the range up to a_v approx 20 mag the initial polarization vs extinction diagram changed dramatically after the corrections of a to c with the correlation coefficient being refined from 071 to 079 these corrections should affect the theoretical interpretation of the observational data the slope of the finally obtained polarizationextinction relationship is p_h e_hk_s 1100 pm 072 rm mag1 which is close to the statistically estimated upper limit of the interstellar polarization efficiency jones 1989 this consistency suggests that the upper limit of interstellar polarization efficiency might be determined by the observational viewing angle toward polarized astronomical objects
|
[['the', 'relationship', 'between', 'dust', 'polarization', 'and', 'extinction', 'was', 'determined', 'for', 'the', 'cold', 'dense', 'starless', 'molecular', 'cloud', 'core', 'fest', '1457', 'based', 'on', 'the', 'background', 'star', 'polarimetry', 'of', 'dichroic', 'extinction', 'at', 'nearinfrared', 'wavelengths', 'owing', 'to', 'the', 'known', 'threedimensional', 'magnetic', 'field', 'structure', 'the', 'observed', 'polarizations', 'from', 'the', 'core', 'were', 'corrected', 'by', 'considering', 'a', 'the', 'subtraction', 'of', 'the', 'ambient', 'polarization', 'component', 'b', 'the', 'depolarization', 'effect', 'of', 'inclined', 'distorted', 'magnetic', 'fields', 'and', 'c', 'the', 'magnetic', 'inclination', 'angle', 'of', 'the', 'core', 'after', 'these', 'corrections', 'a', 'linear', 'relationship', 'between', 'polarization', 'and', 'extinction', 'was', 'obtained', 'for', 'the', 'core', 'in', 'the', 'range', 'up', 'to', 'a_v', 'approx', '20', 'mag', 'the', 'initial', 'polarization', 'vs', 'extinction', 'diagram', 'changed', 'dramatically', 'after', 'the', 'corrections', 'of', 'a', 'to', 'c', 'with', 'the', 'correlation', 'coefficient', 'being', 'refined', 'from', '071', 'to', '079', 'these', 'corrections', 'should', 'affect', 'the', 'theoretical', 'interpretation', 'of', 'the', 'observational', 'data', 'the', 'slope', 'of', 'the', 'finally', 'obtained', 'polarizationextinction', 'relationship', 'is', 'p_h', 'e_hk_s', '1100', 'pm', '072', 'rm', 'mag1', 'which', 'is', 'close', 'to', 'the', 'statistically', 'estimated', 'upper', 'limit', 'of', 'the', 'interstellar', 'polarization', 'efficiency', 'jones', '1989', 'this', 'consistency', 'suggests', 'that', 'the', 'upper', 'limit', 'of', 'interstellar', 'polarization', 'efficiency', 'might', 'be', 'determined', 'by', 'the', 'observational', 'viewing', 'angle', 'toward', 'polarized', 'astronomical', 'objects']]
|
[-0.09512057386467511, 0.13826598515957, -0.07324614558131137, 0.0522578282546787, -0.041471019981706395, -0.06314482724175174, 0.07748381185167014, 0.42308771392290895, -0.24965133486771363, -0.3585256375743948, 0.049446777646656476, -0.26881812999775495, -0.012754900061446143, 0.16345445531856348, -0.0025049592033920295, -0.008531825631817288, -0.0032972190733454093, -0.07531450627287453, -0.06691708639908106, -0.19789834414668223, 0.2593580609078499, 0.10426634269707064, 0.23257568136877455, 0.05386767260968051, 0.053023885961165626, -0.04981724037590655, -0.07027144416419918, 0.018481182597671696, -0.14170054187447834, 0.08993902764570444, 0.16823222944909272, 0.07022195512755833, 0.11742831193569532, -0.32374939535858427, -0.17399620270713212, 0.05210379262001531, 0.11559075234021912, 0.027405516920051477, 0.002540743800172424, -0.27859780528741157, 0.03060054108302327, -0.12312395008716812, -0.18612551738686384, 0.05670218818394982, 0.10548583159106784, -0.013459044558174432, -0.2609212242684233, 0.11938672720335741, -0.007221459784480604, 0.11549900654755858, -0.09313096908079659, -0.16459639847125027, -0.10604544290331529, 0.08073404047544055, 0.02091318910800297, 0.11990908612348536, 0.18163281494870465, -0.15434497676076406, -0.0036114227627973726, 0.38952016609502915, -0.09146168089175766, -0.03883903968597495, 0.1277283401305272, -0.22604495700092075, -0.10704698661178787, 0.196586247305683, 0.1342404360407369, 0.08200535524458169, -0.10710509402331886, 0.0314283033704727, 0.003718677115567187, 0.20724397867316122, 0.10781185173905118, 0.02969306243330914, 0.31160475499928, 0.08557183482991333, -0.01111943121910333, 0.11952098016069826, -0.2234878630607706, -0.041031097601901025, -0.25644333610073367, -0.08933226178410127, -0.1136614010035199, 0.11264905505417351, -0.1787076189423115, -0.08575500803442296, 0.322474984972282, 0.13899406308724366, 0.2042765488979367, 0.03245815074881241, 0.308187161431093, 0.1101455969706257, 0.07005309943138235, 0.07858886271764702, 0.3817317075655855, 0.23138358809754866, 0.11578504057747233, -0.25873806888728024, 0.11455784681837688, -0.011365742150178932]
|
1,803.08197
|
Study of activation cross sections of deuteron induced reactions on
erbium in the 32-50 MeV energy range
|
Activation cross sections of the natEr(d,x)163,165,166,167,168,170Tm and
natEr(d,x)171,161Er nuclear reactions have been measured in the 32-50 MeV
energy range, above 40 MeV for the first time. The activation method with
stacked foil irradiation technique and gamma-ray spectroscopy were used. The
experimental cross sections were compared with the theoretical predictions in
the TENDL-2015 library.
|
nucl-ex
|
activation cross sections of the naterdx163165166167168170tm and naterdx171161er nuclear reactions have been measured in the 3250 mev energy range above 40 mev for the first time the activation method with stacked foil irradiation technique and gammaray spectroscopy were used the experimental cross sections were compared with the theoretical predictions in the tendl2015 library
|
[['activation', 'cross', 'sections', 'of', 'the', 'naterdx163165166167168170tm', 'and', 'naterdx171161er', 'nuclear', 'reactions', 'have', 'been', 'measured', 'in', 'the', '3250', 'mev', 'energy', 'range', 'above', '40', 'mev', 'for', 'the', 'first', 'time', 'the', 'activation', 'method', 'with', 'stacked', 'foil', 'irradiation', 'technique', 'and', 'gammaray', 'spectroscopy', 'were', 'used', 'the', 'experimental', 'cross', 'sections', 'were', 'compared', 'with', 'the', 'theoretical', 'predictions', 'in', 'the', 'tendl2015', 'library']]
|
[0.07617542259029898, 0.13971296007580616, -0.04803531412400451, 0.08892358960035969, 0.045505187002823265, -0.09789936173497242, 0.03286538221508119, 0.4856220182834887, -0.1950183194130659, -0.41292514568012134, -0.05406809980323648, -0.3860748537140442, 0.048056530008348176, 0.258664336662703, 0.10658484867171329, 0.17204042693928762, 0.09742895025285143, 0.0035531853928285487, -0.031321606854451636, -0.20472555644992813, 0.23263369265067227, 0.17613162637195168, 0.2834364029706693, 0.17175811724554674, 0.0430906598739253, -0.011526249481511175, -0.020953476191589646, -0.09101386879589043, -0.1614549122568147, 0.09666171567697152, 0.29377281797282834, 0.003409551287654276, 0.12830963970034145, -0.408173892245281, -0.20269516296684742, 0.05805412258076317, 0.07782353917319401, 0.06121586794124953, -0.07564251088336402, -0.2604815017651109, 0.08425614595705387, -0.20623190774052752, -0.04128874946549973, -0.04207758408258943, -0.01492686994264231, 0.09946623218117975, -0.20016164518892765, 0.07684898119894605, -0.08450006006979476, 0.08045546374484605, -0.17491230138522737, -0.24188807413128077, -0.02397245063683858, 0.056083127819732126, 0.030762796162390242, 0.0421506403671468, 0.21385417820191852, -0.05173272168373361, -0.129615547354607, 0.3213549123383036, -0.04904141284379305, -0.05296216185624693, 0.09140394072906644, -0.13481524272584447, -0.10101511847118244, 0.2515206760270338, 0.17347609503742525, 0.1423491021143455, -0.1781851878462761, 0.04303785174509839, 0.04591846593893042, 0.19842582429740943, 0.12099665197014224, -0.059848361073390526, 0.08377471626462306, 0.2472006471841322, -0.08759478970394269, 0.04066329947261907, -0.26593803181586895, -0.020894614504832848, -0.2947454757111914, -0.10270310593221117, -0.06183468838971035, 0.048177281298729425, 0.013148956457906239, -0.04543492922961127, 0.37706617864907954, 0.07118037490941145, 0.2634408093404536, 0.02449096461721495, 0.30632188330934035, 0.10951559779727284, 0.1304723673463598, 0.016351576328423677, 0.3514840429027875, 0.20832614966796018, 0.14837024530724569, -0.18129127834211378, 0.08758319924384647, -0.024621269912185037]
|
1,803.08198
|
SUCAG: Stochastic Unbiased Curvature-aided Gradient Method for
Distributed Optimization
|
We propose and analyze a new stochastic gradient method, which we call
Stochastic Unbiased Curvature-aided Gradient (SUCAG), for finite sum
optimization problems. SUCAG constitutes an unbiased total gradient tracking
technique that uses Hessian information to accelerate con- vergence. We analyze
our method under the general asynchronous model of computation, in which each
function is selected infinitely often with possibly unbounded (but sublinear)
delay. For strongly convex problems, we establish linear convergence for the
SUCAG method. When the initialization point is sufficiently close to the
optimal solution, the established convergence rate is only dependent on the
condition number of the problem, making it strictly faster than the known rate
for the SAGA method. Furthermore, we describe a Markov-driven approach of
implementing the SUCAG method in a distributed asynchronous multi-agent
setting, via gossiping along a random walk on an undirected communication
graph. We show that our analysis applies as long as the graph is connected and,
notably, establishes an asymptotic linear convergence rate that is robust to
the graph topology. Numerical results demonstrate the merits of our algorithm
over existing methods.
|
math.OC stat.ML
|
we propose and analyze a new stochastic gradient method which we call stochastic unbiased curvatureaided gradient sucag for finite sum optimization problems sucag constitutes an unbiased total gradient tracking technique that uses hessian information to accelerate con vergence we analyze our method under the general asynchronous model of computation in which each function is selected infinitely often with possibly unbounded but sublinear delay for strongly convex problems we establish linear convergence for the sucag method when the initialization point is sufficiently close to the optimal solution the established convergence rate is only dependent on the condition number of the problem making it strictly faster than the known rate for the saga method furthermore we describe a markovdriven approach of implementing the sucag method in a distributed asynchronous multiagent setting via gossiping along a random walk on an undirected communication graph we show that our analysis applies as long as the graph is connected and notably establishes an asymptotic linear convergence rate that is robust to the graph topology numerical results demonstrate the merits of our algorithm over existing methods
|
[['we', 'propose', 'and', 'analyze', 'a', 'new', 'stochastic', 'gradient', 'method', 'which', 'we', 'call', 'stochastic', 'unbiased', 'curvatureaided', 'gradient', 'sucag', 'for', 'finite', 'sum', 'optimization', 'problems', 'sucag', 'constitutes', 'an', 'unbiased', 'total', 'gradient', 'tracking', 'technique', 'that', 'uses', 'hessian', 'information', 'to', 'accelerate', 'con', 'vergence', 'we', 'analyze', 'our', 'method', 'under', 'the', 'general', 'asynchronous', 'model', 'of', 'computation', 'in', 'which', 'each', 'function', 'is', 'selected', 'infinitely', 'often', 'with', 'possibly', 'unbounded', 'but', 'sublinear', 'delay', 'for', 'strongly', 'convex', 'problems', 'we', 'establish', 'linear', 'convergence', 'for', 'the', 'sucag', 'method', 'when', 'the', 'initialization', 'point', 'is', 'sufficiently', 'close', 'to', 'the', 'optimal', 'solution', 'the', 'established', 'convergence', 'rate', 'is', 'only', 'dependent', 'on', 'the', 'condition', 'number', 'of', 'the', 'problem', 'making', 'it', 'strictly', 'faster', 'than', 'the', 'known', 'rate', 'for', 'the', 'saga', 'method', 'furthermore', 'we', 'describe', 'a', 'markovdriven', 'approach', 'of', 'implementing', 'the', 'sucag', 'method', 'in', 'a', 'distributed', 'asynchronous', 'multiagent', 'setting', 'via', 'gossiping', 'along', 'a', 'random', 'walk', 'on', 'an', 'undirected', 'communication', 'graph', 'we', 'show', 'that', 'our', 'analysis', 'applies', 'as', 'long', 'as', 'the', 'graph', 'is', 'connected', 'and', 'notably', 'establishes', 'an', 'asymptotic', 'linear', 'convergence', 'rate', 'that', 'is', 'robust', 'to', 'the', 'graph', 'topology', 'numerical', 'results', 'demonstrate', 'the', 'merits', 'of', 'our', 'algorithm', 'over', 'existing', 'methods']]
|
[-0.11989656360061274, 0.007174958270471517, -0.09476596502105841, 0.05963245849190489, -0.07880081968078537, -0.1603385175112635, 0.0598728366175227, 0.4192266356869695, -0.3169869967328196, -0.2513547306252497, 0.1330972237399978, -0.22627605420401256, -0.1796693055199857, 0.21674243044081992, -0.10293060620403666, 0.07881601527856474, 0.08981200054633233, 0.04765595233308549, -0.05820152043820139, -0.2818796439670233, 0.24344434773384624, 0.029502324810973632, 0.2937336626378924, 0.014741895655941825, 0.16356303098904534, 0.03663162137198607, -0.02309426615600673, 0.03508207016347206, -0.10530508566758788, 0.11652074529190307, 0.2336788305887178, 0.1590968821893624, 0.3521843382910815, -0.38425185247272087, -0.17637648677003434, 0.1347830435738564, 0.1540137085840603, 0.12320066631504785, -0.06497691613177277, -0.22931771178656582, 0.12678707606718992, -0.13194655096995528, -0.09684330919297056, -0.10155369394741366, -0.037472744239494205, 0.058865564173542675, -0.3450265166171816, 0.07045111348891757, 0.0780542998292138, 0.0062698906711355015, -0.03895621167317954, -0.09897882008619, 0.04824328146681315, 0.058557129477306395, 0.03110387317608686, 0.04518416193653987, 0.10539568193371962, -0.06531753973365667, -0.13390806249049858, 0.3144383318015908, -0.07933298142646829, -0.22122606162630606, 0.17083151552700596, -0.04890336070126027, -0.1525271784310135, 0.12004629863436554, 0.20642723280444658, 0.2068523808194094, -0.14614366205041937, 0.0901342429766128, -0.05394219572320999, 0.14518692329335628, -0.0013605207636471041, 0.0034932181192692787, 0.07151728813939341, 0.1948351097813797, 0.23954218290118354, 0.16260361288062014, -0.04187364086477358, -0.16217288696678, -0.2753802549167212, -0.12961965880691587, -0.20349098066406932, 0.008981726687595122, -0.15388309590899768, -0.18718305914505814, 0.35841681265136166, 0.16309628643166127, 0.1714761116112886, 0.15684895760842776, 0.3357804562906954, 0.11941842641746835, 0.010885272282332685, 0.16692076692765767, 0.1893810421657445, 0.13941081635277258, 0.0795913425403689, -0.23135897972008862, 0.11546116276366866, 0.1228060390004951]
|
1,803.08199
|
Low-Frequency Carbon Recombination Lines in the Orion Molecular Cloud
Complex
|
We detail tentative detections of low-frequency carbon radio recombination
lines from within the Orion molecular cloud complex observed at 99-129 MHz.
These tentative detections include one alpha transition and one beta transition
over three locations and are located within the diffuse regions of dust
observed in the infrared at 100umm, the Halpha emission detected in the
optical, and the synchrotron radiation observed in the radio. With these
observations, we are able to study the radiation mechanism transition from
collisionally pumped to radiatively pumped within the HII regions of the Orion
molecular cloud complex.
|
astro-ph.GA
|
we detail tentative detections of lowfrequency carbon radio recombination lines from within the orion molecular cloud complex observed at 99129 mhz these tentative detections include one alpha transition and one beta transition over three locations and are located within the diffuse regions of dust observed in the infrared at 100umm the halpha emission detected in the optical and the synchrotron radiation observed in the radio with these observations we are able to study the radiation mechanism transition from collisionally pumped to radiatively pumped within the hii regions of the orion molecular cloud complex
|
[['we', 'detail', 'tentative', 'detections', 'of', 'lowfrequency', 'carbon', 'radio', 'recombination', 'lines', 'from', 'within', 'the', 'orion', 'molecular', 'cloud', 'complex', 'observed', 'at', '99129', 'mhz', 'these', 'tentative', 'detections', 'include', 'one', 'alpha', 'transition', 'and', 'one', 'beta', 'transition', 'over', 'three', 'locations', 'and', 'are', 'located', 'within', 'the', 'diffuse', 'regions', 'of', 'dust', 'observed', 'in', 'the', 'infrared', 'at', '100umm', 'the', 'halpha', 'emission', 'detected', 'in', 'the', 'optical', 'and', 'the', 'synchrotron', 'radiation', 'observed', 'in', 'the', 'radio', 'with', 'these', 'observations', 'we', 'are', 'able', 'to', 'study', 'the', 'radiation', 'mechanism', 'transition', 'from', 'collisionally', 'pumped', 'to', 'radiatively', 'pumped', 'within', 'the', 'hii', 'regions', 'of', 'the', 'orion', 'molecular', 'cloud', 'complex']]
|
[-0.048063341194115906, 0.13752814793311383, 0.05290716384922195, 0.031899841299847416, -0.008566837595856708, -0.07448508957927318, 0.08255556916170147, 0.5111223698958106, -0.17314977392696007, -0.28081368481861835, 0.014038315697056849, -0.3045493069550265, -0.031039769815675834, 0.12351257111826587, 0.08865801425417885, -0.06723010509639331, -0.03799449335138374, -0.12901684907062547, 0.04037055450965493, -0.11948214700121594, 0.28402365841295407, 0.07444721059468777, 0.17672633567986928, 0.020851800506732063, 0.013820335329712732, -0.20976778839552856, -0.07002497555526055, -0.08176105307496112, -0.1320842005484535, 0.0724942536427356, 0.2798098804753112, 0.09783187617912241, 0.1611466762475649, -0.4139755019796607, -0.230872801616383, 0.06857094851211118, 0.1950583472220308, 0.029919276783323807, -0.028906741698333266, -0.3214536317138244, 0.0033191519070659642, -0.14014027152291458, -0.17978764400291053, 0.11360710857780246, 0.019296105166532747, 0.02831835880541526, -0.21091621136292815, 0.0999015417030972, -0.08269346931205213, 0.09296944053114756, -0.13035304597376482, -0.0900302603132213, -0.04408813342856972, 0.07305185191343418, -0.02589162912108409, 0.05040113047605543, 0.26069758181541186, -0.1303912866860628, -0.05223179805983344, 0.4117179568452032, -0.09897562507641218, 0.048088132079852665, 0.24845330984048222, -0.30099486274664977, -0.22480464979257112, 0.29935024508639524, 0.09703121906774037, 0.10950520548352, -0.12010539236033092, -0.03725517091895555, -0.01865557625727809, 0.1662910900524129, 0.08613697515102103, 0.10329731203534681, 0.3508088979465158, 0.07293677983967506, -0.037665596009110625, 0.1744793516149714, -0.31373967359895294, -0.08467763534787556, -0.269827376200777, -0.048201306368750724, -0.109832698226218, 0.05959972026302358, -0.06936932224024255, -0.09716016891331453, 0.34655290016013646, 0.12867644750108215, 0.1596856334489649, -0.0025274211758464253, 0.35373218977601145, 0.10054532439528924, 0.11506605241447687, 0.13988415627618847, 0.32394220493733883, 0.13615875099988087, 0.12393850067240672, -0.24843246467998656, 0.04020878536444481, -0.04825707690527096]
|
1,803.082
|
Randomness and Permutations in Coordinate Descent Methods
|
We consider coordinate descent (CD) methods with exact line search on convex
quadratic problems. Our main focus is to study the performance of the CD method
that use random permutations in each epoch and compare it to the performance of
the CD methods that use deterministic orders and random sampling with
replacement. We focus on a class of convex quadratic problems with a diagonally
dominant Hessian matrix, for which we show that using random permutations
instead of random with-replacement sampling improves the performance of the CD
method in the worst-case. Furthermore, we prove that as the Hessian matrix
becomes more diagonally dominant, the performance improvement attained by using
random permutations increases. We also show that for this problem class, using
any fixed deterministic order yields a superior performance than using random
permutations. We present detailed theoretical analyses with respect to three
different convergence criteria that are used in the literature and support our
theoretical results with numerical experiments.
|
math.OC
|
we consider coordinate descent cd methods with exact line search on convex quadratic problems our main focus is to study the performance of the cd method that use random permutations in each epoch and compare it to the performance of the cd methods that use deterministic orders and random sampling with replacement we focus on a class of convex quadratic problems with a diagonally dominant hessian matrix for which we show that using random permutations instead of random withreplacement sampling improves the performance of the cd method in the worstcase furthermore we prove that as the hessian matrix becomes more diagonally dominant the performance improvement attained by using random permutations increases we also show that for this problem class using any fixed deterministic order yields a superior performance than using random permutations we present detailed theoretical analyses with respect to three different convergence criteria that are used in the literature and support our theoretical results with numerical experiments
|
[['we', 'consider', 'coordinate', 'descent', 'cd', 'methods', 'with', 'exact', 'line', 'search', 'on', 'convex', 'quadratic', 'problems', 'our', 'main', 'focus', 'is', 'to', 'study', 'the', 'performance', 'of', 'the', 'cd', 'method', 'that', 'use', 'random', 'permutations', 'in', 'each', 'epoch', 'and', 'compare', 'it', 'to', 'the', 'performance', 'of', 'the', 'cd', 'methods', 'that', 'use', 'deterministic', 'orders', 'and', 'random', 'sampling', 'with', 'replacement', 'we', 'focus', 'on', 'a', 'class', 'of', 'convex', 'quadratic', 'problems', 'with', 'a', 'diagonally', 'dominant', 'hessian', 'matrix', 'for', 'which', 'we', 'show', 'that', 'using', 'random', 'permutations', 'instead', 'of', 'random', 'withreplacement', 'sampling', 'improves', 'the', 'performance', 'of', 'the', 'cd', 'method', 'in', 'the', 'worstcase', 'furthermore', 'we', 'prove', 'that', 'as', 'the', 'hessian', 'matrix', 'becomes', 'more', 'diagonally', 'dominant', 'the', 'performance', 'improvement', 'attained', 'by', 'using', 'random', 'permutations', 'increases', 'we', 'also', 'show', 'that', 'for', 'this', 'problem', 'class', 'using', 'any', 'fixed', 'deterministic', 'order', 'yields', 'a', 'superior', 'performance', 'than', 'using', 'random', 'permutations', 'we', 'present', 'detailed', 'theoretical', 'analyses', 'with', 'respect', 'to', 'three', 'different', 'convergence', 'criteria', 'that', 'are', 'used', 'in', 'the', 'literature', 'and', 'support', 'our', 'theoretical', 'results', 'with', 'numerical', 'experiments']]
|
[-0.06220329041177218, 0.02882434869526968, -0.05290690277809206, 0.032951594436470465, -0.06369857269757769, -0.12825292478244799, 0.06047479181014048, 0.43427436923773227, -0.24934586324387148, -0.22516144209473593, 0.10239735329184751, -0.266852194561234, -0.194374762151296, 0.2234566015754296, -0.06938112413958658, 0.07282761370621715, 0.11566207275425285, 0.021886601660966495, -0.13796527917449705, -0.33398327215639523, 0.30028923089274123, 0.039042821513559624, 0.27342451186379113, -0.01944328708680276, 0.0739752546400775, 0.02378894529258243, -0.02679598143271206, 0.0508506674455078, -0.10272858980031835, 0.11368183237927836, 0.23596392792967869, 0.15024013915010787, 0.3039590089782318, -0.37957985132131017, -0.16102158221640164, 0.15426311567366782, 0.14360224874984898, 0.10286456478179043, -0.09871012208398647, -0.2359928433146752, 0.14507927422049233, -0.12491250002927654, -0.06753195130672966, -0.07258066868326993, -0.06198869367967112, 0.07875956907054951, -0.3303438090200571, 0.04152614875277357, 0.08311092058090563, 0.05924389770113026, -0.010902602193122612, -0.19819390169002965, 0.04625788693687631, 0.06431434771835898, 0.044728786268334965, 0.022053058496440608, 0.09654791326898657, -0.04303325585655491, -0.18312091257163807, 0.37556757954173264, -0.0937636531555113, -0.24564448623517174, 0.172264249004347, -0.0986470152090504, -0.16731845782395552, 0.12065358848098807, 0.18403227700368513, 0.16033848617343774, -0.09413612392860689, 0.07762968399351215, -0.06809507714012708, 0.15292811653682892, 0.04605748833457739, -0.010706725117715098, 0.07190044720722008, 0.1579685387130874, 0.14996386793901836, 0.17717757908099838, -0.06801919518274409, -0.12052650785934227, -0.2651179282914234, -0.11094946670861726, -0.19734175891697972, -0.003150806855115615, -0.1525406890009608, -0.17067004387160833, 0.3953307456089349, 0.19458563639959203, 0.193787005488301, 0.15529059594028477, 0.3041092206877244, 0.10781821335114751, 0.02556885116568474, 0.0987781672296409, 0.18021832202572988, 0.12854732619156425, 0.025543496926326917, -0.2337701295449434, 0.06952753873200074, 0.1057682139445332]
|
1,803.08201
|
$L(\mathbb{R})$ with Determinacy Satisfies the Suslin Hypothesis
|
The Suslin hypothesis states that there are no nonseparable complete dense
linear orderings without endpoints which have the countable chain condition.
$\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$ proves the Suslin
hypothesis. In particular, if $L(\mathbb{R}) \models \mathsf{AD}$, then
$L(\mathbb{R})$ satisfies the Suslin hypothesis, which answers a question of
Foreman.
|
math.LO
|
the suslin hypothesis states that there are no nonseparable complete dense linear orderings without endpoints which have the countable chain condition mathsfzf ad v lmathscrpmathbbr proves the suslin hypothesis in particular if lmathbbr models mathsfad then lmathbbr satisfies the suslin hypothesis which answers a question of foreman
|
[['the', 'suslin', 'hypothesis', 'states', 'that', 'there', 'are', 'no', 'nonseparable', 'complete', 'dense', 'linear', 'orderings', 'without', 'endpoints', 'which', 'have', 'the', 'countable', 'chain', 'condition', 'mathsfzf', 'ad', 'v', 'lmathscrpmathbbr', 'proves', 'the', 'suslin', 'hypothesis', 'in', 'particular', 'if', 'lmathbbr', 'models', 'mathsfad', 'then', 'lmathbbr', 'satisfies', 'the', 'suslin', 'hypothesis', 'which', 'answers', 'a', 'question', 'of', 'foreman']]
|
[-0.19668922341488143, 0.1364607032824387, -0.08809635671786964, 0.13900378812104464, -0.08525611305648977, -0.20087703443231417, 0.06959667793930845, 0.3297718545134635, -0.27804096054999117, -0.14594170465035008, 0.07186369444590379, -0.2519241265997172, -0.09111618859931192, 0.10809251948561956, -0.11591598609502012, 0.03046851170229468, 0.13765645088588305, 0.06768799441410824, 0.038125718968543915, -0.30926027643850984, 0.373820166826803, -0.0726896743835049, 0.2622331214494052, 0.07556286247130087, 0.0927801019254517, 0.005800761916535966, 0.021796332652422975, 0.016669311560690403, -0.159057686566852, 0.014971405832453611, 0.2566180449568802, 0.21180122175273744, 0.30551678814152455, -0.3582022463149847, -0.206400718262538, 0.2247136687027647, 0.015339802603851607, -0.04953870048964436, 0.011440846157517838, -0.2856164464845936, 0.18713781421885212, -0.13190749446128278, -0.12283104921671305, -0.026677305542645937, 0.11010609638500721, -0.0495174435918477, -0.3257275469838939, 0.04256910248411859, 0.24426381610968012, 0.1072919126352335, -0.0676142914874598, -0.02850584809648547, -0.08648732046973198, 0.010631850672925406, 0.011398862096223426, 0.07205687270083642, -0.005727903917431831, -0.04090692885616358, -0.13734593386068306, 0.30678302077378367, -0.06571472868164803, -0.20957465605913078, 0.1798163716225548, -0.12217332005619685, -0.2395218932292761, 0.07870121657392605, -0.05569870976057458, 0.11091889486588696, -0.06964473529381955, 0.23768467095462567, -0.20297340715819218, 0.12280813994956144, 0.1804936076514423, -0.04239161597178417, 0.14223757063216985, 0.01553073677511767, 0.06303500125006317, 0.05008081140670371, 0.05184241752833762, -0.018754270452847506, -0.3072560651604324, -0.1441894279436228, -0.11282810485584939, 0.13858520745874403, -0.04409057873875854, -0.21375798971015722, 0.28014594572100865, 0.09074690217399388, 0.1296579392745774, 0.11934884798594136, 0.18047931294472136, 0.049981521472255604, 0.0012230953459251433, 0.13181016879512908, 0.11266055157249595, 0.18219242155789694, -0.053777113477600384, -0.09700509771070581, 0.1280914145791804, 0.16206811291185466]
|
1,803.08202
|
Person Following by Autonomous Robots: A Categorical Overview
|
A wide range of human-robot collaborative applications in diverse domains
such as manufacturing, health care, the entertainment industry, and social
interactions, require an autonomous robot to follow its human companion.
Different working environments and applications pose diverse challenges by
adding constraints on the choice of sensors, the degree of autonomy, and
dynamics of a person-following robot. Researchers have addressed these
challenges in many ways and contributed to the development of a large body of
literature. This paper provides a comprehensive overview of the literature by
categorizing different aspects of person-following by autonomous robots. Also,
the corresponding operational challenges are identified based on various design
choices for ground, underwater, and aerial scenarios. In addition,
state-of-the-art methods for perception, planning, control, and interaction are
elaborately discussed and their applicability in varied operational scenarios
are presented. Then, some of the prominent methods are qualitatively compared,
corresponding practicalities are illustrated, and their feasibility is analyzed
for various use-cases. Furthermore, several prospective application areas are
identified, and open problems are highlighted for future research.
|
cs.RO
|
a wide range of humanrobot collaborative applications in diverse domains such as manufacturing health care the entertainment industry and social interactions require an autonomous robot to follow its human companion different working environments and applications pose diverse challenges by adding constraints on the choice of sensors the degree of autonomy and dynamics of a personfollowing robot researchers have addressed these challenges in many ways and contributed to the development of a large body of literature this paper provides a comprehensive overview of the literature by categorizing different aspects of personfollowing by autonomous robots also the corresponding operational challenges are identified based on various design choices for ground underwater and aerial scenarios in addition stateoftheart methods for perception planning control and interaction are elaborately discussed and their applicability in varied operational scenarios are presented then some of the prominent methods are qualitatively compared corresponding practicalities are illustrated and their feasibility is analyzed for various usecases furthermore several prospective application areas are identified and open problems are highlighted for future research
|
[['a', 'wide', 'range', 'of', 'humanrobot', 'collaborative', 'applications', 'in', 'diverse', 'domains', 'such', 'as', 'manufacturing', 'health', 'care', 'the', 'entertainment', 'industry', 'and', 'social', 'interactions', 'require', 'an', 'autonomous', 'robot', 'to', 'follow', 'its', 'human', 'companion', 'different', 'working', 'environments', 'and', 'applications', 'pose', 'diverse', 'challenges', 'by', 'adding', 'constraints', 'on', 'the', 'choice', 'of', 'sensors', 'the', 'degree', 'of', 'autonomy', 'and', 'dynamics', 'of', 'a', 'personfollowing', 'robot', 'researchers', 'have', 'addressed', 'these', 'challenges', 'in', 'many', 'ways', 'and', 'contributed', 'to', 'the', 'development', 'of', 'a', 'large', 'body', 'of', 'literature', 'this', 'paper', 'provides', 'a', 'comprehensive', 'overview', 'of', 'the', 'literature', 'by', 'categorizing', 'different', 'aspects', 'of', 'personfollowing', 'by', 'autonomous', 'robots', 'also', 'the', 'corresponding', 'operational', 'challenges', 'are', 'identified', 'based', 'on', 'various', 'design', 'choices', 'for', 'ground', 'underwater', 'and', 'aerial', 'scenarios', 'in', 'addition', 'stateoftheart', 'methods', 'for', 'perception', 'planning', 'control', 'and', 'interaction', 'are', 'elaborately', 'discussed', 'and', 'their', 'applicability', 'in', 'varied', 'operational', 'scenarios', 'are', 'presented', 'then', 'some', 'of', 'the', 'prominent', 'methods', 'are', 'qualitatively', 'compared', 'corresponding', 'practicalities', 'are', 'illustrated', 'and', 'their', 'feasibility', 'is', 'analyzed', 'for', 'various', 'usecases', 'furthermore', 'several', 'prospective', 'application', 'areas', 'are', 'identified', 'and', 'open', 'problems', 'are', 'highlighted', 'for', 'future', 'research']]
|
[-0.11613654387099835, 0.0650172962976688, -0.0033220006951164387, 0.04729900476216021, -0.10909011920155612, -0.14124184976538232, -0.013557247768022388, 0.43547741198789575, -0.22004202418140845, -0.380022191869173, 0.15213464114335393, -0.2690670803415137, -0.19482150281260827, 0.27894273879631104, -0.14659217413526007, 0.10375076132194937, 0.10535598859402859, -0.0022043254209715805, -0.020580967394690848, -0.2520921851290825, 0.2865829067820583, -0.009761411571194848, 0.304497851110426, 0.08320546146164352, 0.08175720595183063, -0.015763867640878983, -0.06661350806215834, 0.020910741535467122, -0.10922396416105971, 0.18292330936974885, 0.3792647129098305, 0.19661349731826497, 0.35058686674801176, -0.4360582012080861, -0.23631910120923363, 0.03972136847462929, 0.13380294218087782, 0.04770611690546938, -0.08497804465067912, -0.3674905964390871, 0.05352444759072334, -0.2202895008464808, -0.12534468459288875, -0.0975454198563378, 0.03871661236699291, 0.07191541853979855, -0.2143778963360244, -0.04241302885093537, -0.01093385802367723, 0.1473608458816202, -0.07784092867493206, -0.16254954724042806, 0.04429803533942444, 0.23569532677818447, 0.076015197815552, -0.04215508241493612, 0.19351395440405, -0.2061079972616012, -0.1721916013302471, 0.42279069452451734, 0.07613217240076757, -0.18562252730780146, 0.2626463851158111, -0.013281368000800917, -0.1600175345634406, 0.04782087826532518, 0.2370593175626622, 0.08557479286811755, -0.22044227177187978, 0.06264329908804656, 0.04114914482248903, 0.07200933053384083, 0.03665693939111368, 0.04647845030946289, 0.2113039899885119, 0.23558199238924388, 0.06782273448059827, 0.1049645915794783, -0.028196799956418262, -0.12824526777725198, -0.2492682831849858, -0.09570669985103036, -0.11251614540661992, -0.05238405561972476, -0.0659991206738416, -0.07563784932243654, 0.39741680184992667, 0.22077061130625508, 0.14530934980083368, -0.016528811539114806, 0.328538468826986, 0.024746478757609106, 0.041400355537851416, 0.0027816955641143492, 0.21443654711774415, 0.020173822857249907, 0.17961277876468934, -0.16859230560300772, 0.07794134334443573, -0.06256006984597819]
|
1,803.08203
|
Residual Networks: Lyapunov Stability and Convex Decomposition
|
While training error of most deep neural networks degrades as the depth of
the network increases, residual networks appear to be an exception. We show
that the main reason for this is the Lyapunov stability of the gradient descent
algorithm: for an arbitrarily chosen step size, the equilibria of the gradient
descent are most likely to remain stable for the parametrization of residual
networks. We then present an architecture with a pair of residual networks to
approximate a large class of functions by decomposing them into a convex and a
concave part. Some parameters of this model are shown to change little during
training, and this imperfect optimization prevents overfitting the data and
leads to solutions with small Lipschitz constants, while providing clues about
the generalization of other deep networks.
|
cs.LG cs.NE math.DS math.OC stat.ML
|
while training error of most deep neural networks degrades as the depth of the network increases residual networks appear to be an exception we show that the main reason for this is the lyapunov stability of the gradient descent algorithm for an arbitrarily chosen step size the equilibria of the gradient descent are most likely to remain stable for the parametrization of residual networks we then present an architecture with a pair of residual networks to approximate a large class of functions by decomposing them into a convex and a concave part some parameters of this model are shown to change little during training and this imperfect optimization prevents overfitting the data and leads to solutions with small lipschitz constants while providing clues about the generalization of other deep networks
|
[['while', 'training', 'error', 'of', 'most', 'deep', 'neural', 'networks', 'degrades', 'as', 'the', 'depth', 'of', 'the', 'network', 'increases', 'residual', 'networks', 'appear', 'to', 'be', 'an', 'exception', 'we', 'show', 'that', 'the', 'main', 'reason', 'for', 'this', 'is', 'the', 'lyapunov', 'stability', 'of', 'the', 'gradient', 'descent', 'algorithm', 'for', 'an', 'arbitrarily', 'chosen', 'step', 'size', 'the', 'equilibria', 'of', 'the', 'gradient', 'descent', 'are', 'most', 'likely', 'to', 'remain', 'stable', 'for', 'the', 'parametrization', 'of', 'residual', 'networks', 'we', 'then', 'present', 'an', 'architecture', 'with', 'a', 'pair', 'of', 'residual', 'networks', 'to', 'approximate', 'a', 'large', 'class', 'of', 'functions', 'by', 'decomposing', 'them', 'into', 'a', 'convex', 'and', 'a', 'concave', 'part', 'some', 'parameters', 'of', 'this', 'model', 'are', 'shown', 'to', 'change', 'little', 'during', 'training', 'and', 'this', 'imperfect', 'optimization', 'prevents', 'overfitting', 'the', 'data', 'and', 'leads', 'to', 'solutions', 'with', 'small', 'lipschitz', 'constants', 'while', 'providing', 'clues', 'about', 'the', 'generalization', 'of', 'other', 'deep', 'networks']]
|
[-0.1118307441052121, 0.033323251014875356, -0.057549213487296726, 0.06535795552190393, -0.07007944698696239, -0.15779376692640093, 0.021827344169231273, 0.40875315382503546, -0.3488899443316488, -0.2877209363720165, 0.11553465610799882, -0.2458813959410271, -0.1833912274809196, 0.16825556566473096, -0.11450501370575064, 0.07339169938797847, 0.10307973859330209, 0.02528273156629159, -0.07682494093269969, -0.2936992151949268, 0.3174434254787719, 0.07130446073626025, 0.2669335633677502, 0.03594390484146201, 0.11837206872699496, -0.05967329115105363, 0.00832226944442552, 0.01619276521781173, -0.0490331646577173, 0.17159802680118727, 0.2371329608731545, 0.1573708096662393, 0.3469218085484149, -0.4283851250218084, -0.21652719211549712, 0.16108538470087716, 0.13939672327206398, 0.15253587246406825, -0.020239783286188657, -0.2580468517208758, 0.12576056450175552, -0.12292655592497725, -0.10134052664686281, -0.10349257983124027, -0.008342700449933405, 0.040041465648055934, -0.30009611243238815, 0.036003035776173836, 0.09697385552930288, 0.032729932222215354, -0.06594282289823661, -0.14041881462415823, -0.01990649550794982, 0.13076512109344968, 0.0729113586864864, 0.060774672794370696, 0.11031208152237992, -0.18762041875967184, -0.055080174944865015, 0.3314067296468868, -0.04866549402045516, -0.19365127011417196, 0.1574417977119223, -0.027956253317041466, -0.14138169737931233, 0.12957814925063688, 0.21350876791760898, 0.12728870309029633, -0.1492241173481139, 0.01605989062630285, -0.00806601679382416, 0.16941591694664496, 0.02196743588608045, 0.015098007814958691, 0.15183947709783052, 0.20678842442754944, 0.14276242010438672, 0.16642260856595106, -0.10248977833342417, -0.10900841203446572, -0.2799129161518067, -0.1116082772684212, -0.1718438455870805, 0.025858339853584766, -0.13365972268074983, -0.18857057615465378, 0.3904651599577986, 0.11866981959006248, 0.2698690203448328, 0.152220485968372, 0.3019032852258533, 0.07999608528782398, 0.12394289842878396, 0.10763618923866979, 0.25261828545234705, 0.10710615538812887, 0.08216907520993398, -0.19220550097838546, 0.12013413147741141, 0.048350229397272834]
|
1,803.08204
|
Refractive index in generalized superconductors with Born-Infeld
electrodynamics
|
We investigate, in the probe limit, the negative refraction in the
generalized superconductors with the Born-Infeld electrodynamics. We observe
that the system has a negative Depine-Lakhtakia index in the superconducting
phase at small frequencies and the greater the Born-Infeld corrections the
larger the range of frequencies or the range of temperatures for which the
negative refraction occurs. Furthermore, we find that the tunable Born-Infeld
parameter can be used to improve the propagation of light in the holographic
setup. Our analysis indicates that the Born-Infeld electrodynamics plays an
important role in determining the optical properties of the boundary theory.
|
hep-th gr-qc physics.optics
|
we investigate in the probe limit the negative refraction in the generalized superconductors with the borninfeld electrodynamics we observe that the system has a negative depinelakhtakia index in the superconducting phase at small frequencies and the greater the borninfeld corrections the larger the range of frequencies or the range of temperatures for which the negative refraction occurs furthermore we find that the tunable borninfeld parameter can be used to improve the propagation of light in the holographic setup our analysis indicates that the borninfeld electrodynamics plays an important role in determining the optical properties of the boundary theory
|
[['we', 'investigate', 'in', 'the', 'probe', 'limit', 'the', 'negative', 'refraction', 'in', 'the', 'generalized', 'superconductors', 'with', 'the', 'borninfeld', 'electrodynamics', 'we', 'observe', 'that', 'the', 'system', 'has', 'a', 'negative', 'depinelakhtakia', 'index', 'in', 'the', 'superconducting', 'phase', 'at', 'small', 'frequencies', 'and', 'the', 'greater', 'the', 'borninfeld', 'corrections', 'the', 'larger', 'the', 'range', 'of', 'frequencies', 'or', 'the', 'range', 'of', 'temperatures', 'for', 'which', 'the', 'negative', 'refraction', 'occurs', 'furthermore', 'we', 'find', 'that', 'the', 'tunable', 'borninfeld', 'parameter', 'can', 'be', 'used', 'to', 'improve', 'the', 'propagation', 'of', 'light', 'in', 'the', 'holographic', 'setup', 'our', 'analysis', 'indicates', 'that', 'the', 'borninfeld', 'electrodynamics', 'plays', 'an', 'important', 'role', 'in', 'determining', 'the', 'optical', 'properties', 'of', 'the', 'boundary', 'theory']]
|
[-0.14793760625987637, 0.1760439527785579, -0.06440468849994395, 0.05396135667414994, -0.061078002723884216, -0.13166528617564058, 0.014169872782373687, 0.32243195862262225, -0.1971726540716042, -0.3083493608069055, 0.024904253069377904, -0.291657827081805, -0.16317808568449121, 0.2038052831467583, 0.00012594760319560157, 0.010912892104563664, -0.07846442099791454, 0.026032696591514373, -0.07261672127773339, -0.17426871623349738, 0.3496488417517774, 0.06278583921886487, 0.3039861200472378, 0.097846323305893, 0.06824771074426113, -0.01740630088155443, 0.049891810465071885, 0.04449430546172115, -0.15879925023798525, 0.06216409801011335, 0.219411582579095, -0.003795144103030313, 0.23513408548825857, -0.3782575342195983, -0.29857190780113546, 0.10161768908764483, 0.1352213633470047, 0.12303961071123996, -0.06549177143475687, -0.23227041689869093, 0.05170773015338547, -0.14123064281932096, -0.16869533811790907, -0.030853505645479475, 0.010903237549093912, -0.05730195269368741, -0.25844087512042296, 0.057058468128421476, 0.039070110815596214, 0.008079485915487215, -0.06069351541001958, -0.08853438310681519, 0.007425983557572627, 0.10510665451043419, 0.0616922503270741, -0.019897924584089493, 0.11620022464847686, -0.1736276825635732, -0.06911102438117472, 0.39647224020897126, -0.11785545124795896, -0.14852315356612814, 0.12248810260955777, -0.21309415829856168, -0.07161442782226189, 0.11515195558693413, 0.16777072897256942, 0.12957994492572486, -0.05149874186181292, 0.09531119652033061, -0.012484051186201751, 0.2019394982691702, 0.08531176139201437, 0.08024272437169387, 0.23784284221426566, 0.1418233097979932, 0.00989275256513941, 0.1709378165637181, -0.08630849807214334, -0.043659838795547884, -0.3267795599721448, -0.18217950731002708, -0.11850814542219955, 0.030653596217791568, -0.1833891810524712, -0.18261680098212496, 0.3837880634949828, 0.2019219798824693, 0.13223257222764043, -0.030810409632977098, 0.23784160123643827, 0.20307462283514668, 0.07982698534330239, 0.04656774677070124, 0.3699523269600349, 0.14050622721563796, 0.15195319416210512, -0.3257144035305828, -0.0024054023337417413, 0.019831948459851652]
|
1,803.08205
|
Update Thresholds of More Accurate Time Stamp for Event Reconstruction
|
Many systems rely on reliable timestamps to determine the time of a
particular action or event. This is especially true in digital investigations
where investigators are attempting to determine when a suspect actually
committed an action. The challenge, however, is that objects are not updated at
the exact moment that an event occurs, but within some time-span after the
actual event. In this work we define a simple model of digital systems with
objects that have associated timestamps. The model is used to predict object
update patterns for objects with associated timestamps, and make predictions
about these update time-spans. Through empirical studies of digital systems, we
show that timestamp update patterns are not instantaneous. We then provide a
method for calculating the distribution of timestamp updates on a particular
system to determine more accurate action instance times.
|
cs.CY
|
many systems rely on reliable timestamps to determine the time of a particular action or event this is especially true in digital investigations where investigators are attempting to determine when a suspect actually committed an action the challenge however is that objects are not updated at the exact moment that an event occurs but within some timespan after the actual event in this work we define a simple model of digital systems with objects that have associated timestamps the model is used to predict object update patterns for objects with associated timestamps and make predictions about these update timespans through empirical studies of digital systems we show that timestamp update patterns are not instantaneous we then provide a method for calculating the distribution of timestamp updates on a particular system to determine more accurate action instance times
|
[['many', 'systems', 'rely', 'on', 'reliable', 'timestamps', 'to', 'determine', 'the', 'time', 'of', 'a', 'particular', 'action', 'or', 'event', 'this', 'is', 'especially', 'true', 'in', 'digital', 'investigations', 'where', 'investigators', 'are', 'attempting', 'to', 'determine', 'when', 'a', 'suspect', 'actually', 'committed', 'an', 'action', 'the', 'challenge', 'however', 'is', 'that', 'objects', 'are', 'not', 'updated', 'at', 'the', 'exact', 'moment', 'that', 'an', 'event', 'occurs', 'but', 'within', 'some', 'timespan', 'after', 'the', 'actual', 'event', 'in', 'this', 'work', 'we', 'define', 'a', 'simple', 'model', 'of', 'digital', 'systems', 'with', 'objects', 'that', 'have', 'associated', 'timestamps', 'the', 'model', 'is', 'used', 'to', 'predict', 'object', 'update', 'patterns', 'for', 'objects', 'with', 'associated', 'timestamps', 'and', 'make', 'predictions', 'about', 'these', 'update', 'timespans', 'through', 'empirical', 'studies', 'of', 'digital', 'systems', 'we', 'show', 'that', 'timestamp', 'update', 'patterns', 'are', 'not', 'instantaneous', 'we', 'then', 'provide', 'a', 'method', 'for', 'calculating', 'the', 'distribution', 'of', 'timestamp', 'updates', 'on', 'a', 'particular', 'system', 'to', 'determine', 'more', 'accurate', 'action', 'instance', 'times']]
|
[-0.11056346357137264, 0.06099430823305207, -0.09845013721050681, 0.10518634983977425, -0.10815108850441982, -0.13641153354483254, 0.09109530819581659, 0.43303101999263693, -0.22198830823325655, -0.31823481072121074, 0.1646526908165483, -0.27668247655727457, -0.13266161419145328, 0.21442398550770633, -0.10578175666945966, 0.013731975883354236, 0.11857370118080318, 0.12581082066732635, -0.04774313040560343, -0.26037884317338467, 0.2765446146882146, 0.050990726088384425, 0.23285154320544352, -0.030828365508847645, 0.11507574470890482, 0.011523719851512217, -0.08114789437203512, -0.014824198375381258, -0.08876337573194815, 0.1088649682417509, 0.2489038629076668, 0.1730634606083053, 0.23352065967926144, -0.4578533702985431, -0.17741554377967642, 0.1365814517884359, 0.13481088751505543, 0.15462818338062417, -0.03321706951669346, -0.26590994862758005, 0.13877020976132284, -0.19843097743544266, -0.09987921012165263, -0.07719510123405578, 0.06942286363456153, 0.03404409906412237, -0.27057106705997686, 0.040441830815869745, 0.03736290782961967, 0.06482694374676114, -0.06969300586811818, -0.04644125946423542, 0.019909599279291437, 0.18879986583041944, 0.03512567191989752, 0.02500066507172628, 0.14199008973464913, -0.12650764447018287, -0.12839279227964853, 0.39583083140888137, 0.0023000817321050557, -0.18478933952911927, 0.17481772530565623, -0.1323904417536772, -0.16028883704069294, 0.12273023208861586, 0.19695332808841537, 0.12010029227180528, -0.18717250733580662, -0.0037263741952122398, -0.03161494749645791, 0.22002017612052388, 0.013930094118202853, 0.024292817604422135, 0.22601935343585744, 0.14816149357318822, 0.0579911928482007, 0.06568822089623469, -0.07048779438559075, -0.09303514904131854, -0.274481996547186, -0.13098070939421147, -0.1582328489145441, 0.008831984696809516, -0.0328207136654205, -0.15979607284313788, 0.3490391901293158, 0.24565392306387207, 0.22194412826257928, 0.06959871317763018, 0.2980478798926393, 0.10832158787971376, 0.07371866163274232, 0.0686910766963745, 0.1871827335828103, 0.017572389662360948, 0.08831163710934946, -0.15183110391877483, 0.14606857311701144, 0.05480302631664668]
|
1,803.08206
|
Construction of low-dimensional system reproducing low-Reynolds-number
turbulence by machine learning
|
In a dissipative system, there exists the (global) attractor which has finite
fractal dimensions. The flow on the attractor can be parametrized by a finite
number of parameters (Temmam 1987). Using machine learning we demonstrate how
to construct precise low-dimensional governing equations which are valid in
some range of Reynolds number for low-Reynolds-number turbulence in plane
Couette flow.
|
physics.flu-dyn
|
in a dissipative system there exists the global attractor which has finite fractal dimensions the flow on the attractor can be parametrized by a finite number of parameters temmam 1987 using machine learning we demonstrate how to construct precise lowdimensional governing equations which are valid in some range of reynolds number for lowreynoldsnumber turbulence in plane couette flow
|
[['in', 'a', 'dissipative', 'system', 'there', 'exists', 'the', 'global', 'attractor', 'which', 'has', 'finite', 'fractal', 'dimensions', 'the', 'flow', 'on', 'the', 'attractor', 'can', 'be', 'parametrized', 'by', 'a', 'finite', 'number', 'of', 'parameters', 'temmam', '1987', 'using', 'machine', 'learning', 'we', 'demonstrate', 'how', 'to', 'construct', 'precise', 'lowdimensional', 'governing', 'equations', 'which', 'are', 'valid', 'in', 'some', 'range', 'of', 'reynolds', 'number', 'for', 'lowreynoldsnumber', 'turbulence', 'in', 'plane', 'couette', 'flow']]
|
[-0.17278078479463593, 0.17881388659180517, -0.10884690850058146, 0.025590957771463876, -0.061292333266975585, -0.1050598906483828, -0.03714015810309272, 0.2623830635688807, -0.2995963603209116, -0.2525455531533481, 0.09096856082977499, -0.21232905854846826, -0.1357054820839773, 0.2614081373536273, -0.06324917865557629, 0.13547708399659186, 0.033010009267743216, 0.023039228017360233, -0.0052049885618320685, -0.21890113246218676, 0.3273814084629218, -0.05546864484877963, 0.2776020364345689, -0.02248079290515498, 0.15879072201552621, -0.07843362038808041, 0.04263937853995645, 0.10916530754286469, -0.2233134102680835, 0.05837063543629228, 0.29668331771564116, 0.09958080921256751, 0.26382134449586536, -0.4107009654766635, -0.2944862978827012, 0.12402903554928407, 0.19424610682191296, 0.12318529338543222, -0.033354602731649946, -0.2291998856031058, 0.10779505641722496, -0.15417757273749694, -0.13898802304378988, -0.16391899238193505, 0.07906853034275405, 0.05252547122603446, -0.2518817111523005, 0.09114144708176977, 0.058002578176296594, 0.14342195307018987, -0.0421559201439091, -0.01513253945424303, -0.07001931991493493, 0.1256650533085983, 0.032533327636325306, 0.02257472642681055, 0.10819156806948677, -0.1334164835708706, -0.06132070630331311, 0.3807065679708071, -0.05356092420570029, -0.3025538785579173, 0.20292633588899645, -0.13649732388327257, -0.09867550203119192, 0.13835053750428192, 0.25128059067943115, 0.07294289391945329, -0.10860752302074902, 0.1328913342174992, -0.1410529843711278, 0.16174772752677663, 0.09909348329529166, -0.0709790707598522, 0.17261650741688514, 0.2082444753563195, 0.08144366219966558, 0.12186956542682949, -0.04510884566269325, -0.1523596278285575, -0.31157445499526437, -0.08948097159481493, -0.18482781339869753, 0.08075578172544115, -0.1572386900600242, -0.19779288664198758, 0.3782449832610917, 0.1494354518710456, 0.19020026843798787, 0.02431076434195826, 0.23716384226970963, 0.13924749661237001, 0.0031446518801283418, 0.18021519326915345, 0.2578609443393234, 0.13683519867379546, 0.11670329804908026, -0.20682488960262976, 0.013354310651489516, 0.16737702689868839]
|
1,803.08207
|
Positive-unlabeled convolutional neural networks for particle picking in
cryo-electron micrographs
|
Cryo-electron microscopy (cryoEM) is an increasingly popular method for
protein structure determination. However, identifying a sufficient number of
particles for analysis (often >100,000) can take months of manual effort.
Current computational approaches are limited by high false positive rates and
require significant ad-hoc post-processing, especially for unusually shaped
particles. To address this shortcoming, we develop Topaz, an efficient and
accurate particle picking pipeline using neural networks trained with few
labeled particles by newly leveraging the remaining unlabeled particles through
the framework of positive-unlabeled (PU) learning. Remarkably, despite using
minimal labeled particles, Topaz allows us to improve reconstruction resolution
by up to 0.15 {\AA} over published particles on three public cryoEM datasets
without any post-processing. Furthermore, we show that our novel
generalized-expectation criteria approach to PU learning outperforms existing
general PU learning approaches when applied to particle detection, especially
for challenging datasets of non-globular proteins. We expect Topaz to be an
essential component of cryoEM analysis.
|
q-bio.QM cs.CV stat.ML
|
cryoelectron microscopy cryoem is an increasingly popular method for protein structure determination however identifying a sufficient number of particles for analysis often 100000 can take months of manual effort current computational approaches are limited by high false positive rates and require significant adhoc postprocessing especially for unusually shaped particles to address this shortcoming we develop topaz an efficient and accurate particle picking pipeline using neural networks trained with few labeled particles by newly leveraging the remaining unlabeled particles through the framework of positiveunlabeled pu learning remarkably despite using minimal labeled particles topaz allows us to improve reconstruction resolution by up to 015 aa over published particles on three public cryoem datasets without any postprocessing furthermore we show that our novel generalizedexpectation criteria approach to pu learning outperforms existing general pu learning approaches when applied to particle detection especially for challenging datasets of nonglobular proteins we expect topaz to be an essential component of cryoem analysis
|
[['cryoelectron', 'microscopy', 'cryoem', 'is', 'an', 'increasingly', 'popular', 'method', 'for', 'protein', 'structure', 'determination', 'however', 'identifying', 'a', 'sufficient', 'number', 'of', 'particles', 'for', 'analysis', 'often', '100000', 'can', 'take', 'months', 'of', 'manual', 'effort', 'current', 'computational', 'approaches', 'are', 'limited', 'by', 'high', 'false', 'positive', 'rates', 'and', 'require', 'significant', 'adhoc', 'postprocessing', 'especially', 'for', 'unusually', 'shaped', 'particles', 'to', 'address', 'this', 'shortcoming', 'we', 'develop', 'topaz', 'an', 'efficient', 'and', 'accurate', 'particle', 'picking', 'pipeline', 'using', 'neural', 'networks', 'trained', 'with', 'few', 'labeled', 'particles', 'by', 'newly', 'leveraging', 'the', 'remaining', 'unlabeled', 'particles', 'through', 'the', 'framework', 'of', 'positiveunlabeled', 'pu', 'learning', 'remarkably', 'despite', 'using', 'minimal', 'labeled', 'particles', 'topaz', 'allows', 'us', 'to', 'improve', 'reconstruction', 'resolution', 'by', 'up', 'to', '015', 'aa', 'over', 'published', 'particles', 'on', 'three', 'public', 'cryoem', 'datasets', 'without', 'any', 'postprocessing', 'furthermore', 'we', 'show', 'that', 'our', 'novel', 'generalizedexpectation', 'criteria', 'approach', 'to', 'pu', 'learning', 'outperforms', 'existing', 'general', 'pu', 'learning', 'approaches', 'when', 'applied', 'to', 'particle', 'detection', 'especially', 'for', 'challenging', 'datasets', 'of', 'nonglobular', 'proteins', 'we', 'expect', 'topaz', 'to', 'be', 'an', 'essential', 'component', 'of', 'cryoem', 'analysis']]
|
[-0.017774024016522113, 0.04772051862466493, -0.03252030857929997, 0.06733256649968573, -0.0818528499183385, -0.22476045037102368, 0.0571351951764561, 0.4313590926775599, -0.22425649057331135, -0.4034096132963896, 0.034125860838685185, -0.2931421308998312, -0.12186530539218117, 0.20458886690979544, -0.11655230643349437, 0.09911882421427887, 0.19400700784951838, -0.0023349596132688664, -0.02248241097873284, -0.27437166992294926, 0.2583949423343357, 0.09822627162146899, 0.3110254233143006, 0.04110057804173504, 0.12513943564213714, 0.037556994249861614, -0.07112388156454864, 0.007013471383187506, -0.09219165356226572, 0.16746956374484048, 0.30705899231781075, 0.17087503510536442, 0.3070384256033458, -0.44094597919558, -0.2385911463928756, 0.1453912961311955, 0.2152787190862, 0.12959807824052025, -0.0808160999079168, -0.2948658317738377, 0.11120138462218973, -0.1612406408268155, -0.037548657263601744, -0.18503002648308775, -0.027119120820334144, -0.02379752243062469, -0.2905691730887994, 0.07910002549209334, 0.009375227481321571, 0.10788055412392163, -0.05949542265776484, -0.1221868672424903, 0.0683588611945096, 0.1466304232007626, 0.05776989215443191, 0.03211659726495033, 0.16261060197542426, -0.1546689407866497, -0.1259601884521544, 0.3572887104016796, -0.02141523859433197, -0.1860072591031591, 0.2350361008909257, -0.03575136573464774, -0.1815471603729902, 0.2117763402981355, 0.20143739272516184, 0.13995007818467378, -0.19616986521349664, 0.020878086736261407, 0.014326219297823758, 0.21808186165678003, 0.061479712363174246, -0.03807436381550384, 0.17273122493825926, 0.23624470410887546, 0.04205040183995722, 0.09613051806390895, -0.16036348728298702, -0.02731677348987242, -0.15613726334755912, -0.11366397779146925, -0.2184481745573625, 0.010706158081720906, -0.08077437001157985, -0.1455185887102476, 0.3396152486793356, 0.2125492219674687, 0.17755071975494693, 0.06987227752707363, 0.3579484401270747, -0.008002468260017291, 0.1032722825205151, 0.06080177391337511, 0.16791356352821382, 0.03917683511698509, 0.11211379550114348, -0.15797017577098182, 0.06333106972834132, 0.02342714360166414]
|
1,803.08208
|
Single-Shot Bidirectional Pyramid Networks for High-Quality Object
Detection
|
Recent years have witnessed many exciting achievements for object detection
using deep learning techniques. Despite achieving significant progresses, most
existing detectors are designed to detect objects with relatively low-quality
prediction of locations, i.e., often trained with the threshold of Intersection
over Union (IoU) set to 0.5 by default, which can yield low-quality or even
noisy detections. It remains an open challenge for how to devise and train a
high-quality detector that can achieve more precise localization (i.e.,
IoU$>$0.5) without sacrificing the detection performance. In this paper, we
propose a novel single-shot detection framework of Bidirectional Pyramid
Networks (BPN) towards high-quality object detection, which consists of two
novel components: (i) a Bidirectional Feature Pyramid structure for more
effective and robust feature representations; and (ii) a Cascade Anchor
Refinement to gradually refine the quality of predesigned anchors for more
effective training. Our experiments showed that the proposed BPN achieves the
best performances among all the single-stage object detectors on both PASCAL
VOC and MS COCO datasets, especially for high-quality detections.
|
cs.CV
|
recent years have witnessed many exciting achievements for object detection using deep learning techniques despite achieving significant progresses most existing detectors are designed to detect objects with relatively lowquality prediction of locations ie often trained with the threshold of intersection over union iou set to 05 by default which can yield lowquality or even noisy detections it remains an open challenge for how to devise and train a highquality detector that can achieve more precise localization ie iou05 without sacrificing the detection performance in this paper we propose a novel singleshot detection framework of bidirectional pyramid networks bpn towards highquality object detection which consists of two novel components i a bidirectional feature pyramid structure for more effective and robust feature representations and ii a cascade anchor refinement to gradually refine the quality of predesigned anchors for more effective training our experiments showed that the proposed bpn achieves the best performances among all the singlestage object detectors on both pascal voc and ms coco datasets especially for highquality detections
|
[['recent', 'years', 'have', 'witnessed', 'many', 'exciting', 'achievements', 'for', 'object', 'detection', 'using', 'deep', 'learning', 'techniques', 'despite', 'achieving', 'significant', 'progresses', 'most', 'existing', 'detectors', 'are', 'designed', 'to', 'detect', 'objects', 'with', 'relatively', 'lowquality', 'prediction', 'of', 'locations', 'ie', 'often', 'trained', 'with', 'the', 'threshold', 'of', 'intersection', 'over', 'union', 'iou', 'set', 'to', '05', 'by', 'default', 'which', 'can', 'yield', 'lowquality', 'or', 'even', 'noisy', 'detections', 'it', 'remains', 'an', 'open', 'challenge', 'for', 'how', 'to', 'devise', 'and', 'train', 'a', 'highquality', 'detector', 'that', 'can', 'achieve', 'more', 'precise', 'localization', 'ie', 'iou05', 'without', 'sacrificing', 'the', 'detection', 'performance', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'singleshot', 'detection', 'framework', 'of', 'bidirectional', 'pyramid', 'networks', 'bpn', 'towards', 'highquality', 'object', 'detection', 'which', 'consists', 'of', 'two', 'novel', 'components', 'i', 'a', 'bidirectional', 'feature', 'pyramid', 'structure', 'for', 'more', 'effective', 'and', 'robust', 'feature', 'representations', 'and', 'ii', 'a', 'cascade', 'anchor', 'refinement', 'to', 'gradually', 'refine', 'the', 'quality', 'of', 'predesigned', 'anchors', 'for', 'more', 'effective', 'training', 'our', 'experiments', 'showed', 'that', 'the', 'proposed', 'bpn', 'achieves', 'the', 'best', 'performances', 'among', 'all', 'the', 'singlestage', 'object', 'detectors', 'on', 'both', 'pascal', 'voc', 'and', 'ms', 'coco', 'datasets', 'especially', 'for', 'highquality', 'detections']]
|
[-0.06679302785342732, 0.015489338022398115, -0.02985310906259912, 0.005067594289433903, -0.09215963373311545, -0.20451493939234244, 0.044852426649952405, 0.4684369216957492, -0.20978170163960136, -0.38526989681601614, 0.08709726059003482, -0.2890402577360144, -0.1495401350015211, 0.22905695248216748, -0.13225543132420808, 0.09048269922541131, 0.19414161883495346, 0.01730926765106663, -0.07870313811245232, -0.2931894614343102, 0.2553979814426226, 0.07223639704554041, 0.3770847756716752, 0.012149059927525992, 0.15444831920977303, -0.026651796744021024, -0.03553327326216696, 0.003230291064605563, -0.011592913828291763, 0.20495222753728043, 0.32753652236323305, 0.16878670006209684, 0.2874456478595109, -0.39976330790257436, -0.2186696217423249, 0.08228802779399438, 0.15978246143444658, 0.09247454756518483, -0.07983740137792039, -0.3526381217640362, 0.12903187593478643, -0.1646967285374057, 0.012036335007475779, -0.13084350791578545, 0.018132024151858633, -0.03661731911633543, -0.26723504636867507, 0.013123180064397813, 0.06982774820602583, 0.03720216027706371, -0.02479854814881113, -0.11746473894817029, 0.06120573062572383, 0.16535124430449646, -0.035738302523013715, 0.05742875888140615, 0.10980151492849963, -0.2385254839008596, -0.1526146029222556, 0.3350787403809275, -0.07599586412494634, -0.15016034674763815, 0.2255406290471197, -0.0498926079536448, -0.14058657276617018, 0.1564407695090387, 0.19974976008434495, 0.14443571745936654, -0.135727339385504, -0.04982434591964378, -0.02434075088937304, 0.1957155333672968, 0.09621012772288463, 0.02345007560132239, 0.22433334153527562, 0.2772144241855218, 0.08375325952450052, 0.11772038616535593, -0.22703948367002258, -0.02127400663274223, -0.2010369732122712, -0.09704943702794601, -0.147736706039701, -0.017130372220438398, -0.06308843551759892, -0.1564002492880549, 0.40140031372938684, 0.231321124828415, 0.22369638303417466, 0.11325517299718887, 0.33449081530024904, -0.01877933002798888, 0.11890139602526219, 0.08518904048815637, 0.24954293666666785, -0.00841972164804127, 0.06839735741820466, -0.1188133161404856, 0.09622689833220452, 0.039529499645250106]
|
1,803.08209
|
Development of a Steel Bridge Climbing Robot
|
Motivated by a high demand for automated inspection of civil infrastructure,
this work presents a new design and development of a tank-like robot for
structural health monitoring. Unlike most existing magnetic wheeled mobile
robot designs, which may be suitable for climbing on flat steel surface, our
proposed tank-like robot design uses reciprocating mechanism and roller-chains
to make it capable of climbing on different structural shapes (e.g., cylinder,
cube) with coated or non-coated steel surfaces. The proposed robot is able to
transition from one surface to the other (e.g., from flat surface to curving
surface).
Taking into account of several strict considerations (including tight
dimension, efficient adhesion and climbing flexibility) to adapt with various
shapes of steel structures, a prototype tank-like robot incorporating multiple
sensors (hall-effects, sonars, inertial measurement unit and camera), has been
developed. Rigorous analysis of robot kinematics, adhesion force, sliding
failure and turn-over failure has been conducted to demonstrate the stability
of the proposed design. Mechanical and magnetic force analysis together with
sliding/turn-over failure investigation can serve as an useful framework for
designing various steel climbing robots in the future. Experimental results and
field deployments confirm the adhesion and climbing capability of the developed
robot.
|
cs.RO
|
motivated by a high demand for automated inspection of civil infrastructure this work presents a new design and development of a tanklike robot for structural health monitoring unlike most existing magnetic wheeled mobile robot designs which may be suitable for climbing on flat steel surface our proposed tanklike robot design uses reciprocating mechanism and rollerchains to make it capable of climbing on different structural shapes eg cylinder cube with coated or noncoated steel surfaces the proposed robot is able to transition from one surface to the other eg from flat surface to curving surface taking into account of several strict considerations including tight dimension efficient adhesion and climbing flexibility to adapt with various shapes of steel structures a prototype tanklike robot incorporating multiple sensors halleffects sonars inertial measurement unit and camera has been developed rigorous analysis of robot kinematics adhesion force sliding failure and turnover failure has been conducted to demonstrate the stability of the proposed design mechanical and magnetic force analysis together with slidingturnover failure investigation can serve as an useful framework for designing various steel climbing robots in the future experimental results and field deployments confirm the adhesion and climbing capability of the developed robot
|
[['motivated', 'by', 'a', 'high', 'demand', 'for', 'automated', 'inspection', 'of', 'civil', 'infrastructure', 'this', 'work', 'presents', 'a', 'new', 'design', 'and', 'development', 'of', 'a', 'tanklike', 'robot', 'for', 'structural', 'health', 'monitoring', 'unlike', 'most', 'existing', 'magnetic', 'wheeled', 'mobile', 'robot', 'designs', 'which', 'may', 'be', 'suitable', 'for', 'climbing', 'on', 'flat', 'steel', 'surface', 'our', 'proposed', 'tanklike', 'robot', 'design', 'uses', 'reciprocating', 'mechanism', 'and', 'rollerchains', 'to', 'make', 'it', 'capable', 'of', 'climbing', 'on', 'different', 'structural', 'shapes', 'eg', 'cylinder', 'cube', 'with', 'coated', 'or', 'noncoated', 'steel', 'surfaces', 'the', 'proposed', 'robot', 'is', 'able', 'to', 'transition', 'from', 'one', 'surface', 'to', 'the', 'other', 'eg', 'from', 'flat', 'surface', 'to', 'curving', 'surface', 'taking', 'into', 'account', 'of', 'several', 'strict', 'considerations', 'including', 'tight', 'dimension', 'efficient', 'adhesion', 'and', 'climbing', 'flexibility', 'to', 'adapt', 'with', 'various', 'shapes', 'of', 'steel', 'structures', 'a', 'prototype', 'tanklike', 'robot', 'incorporating', 'multiple', 'sensors', 'halleffects', 'sonars', 'inertial', 'measurement', 'unit', 'and', 'camera', 'has', 'been', 'developed', 'rigorous', 'analysis', 'of', 'robot', 'kinematics', 'adhesion', 'force', 'sliding', 'failure', 'and', 'turnover', 'failure', 'has', 'been', 'conducted', 'to', 'demonstrate', 'the', 'stability', 'of', 'the', 'proposed', 'design', 'mechanical', 'and', 'magnetic', 'force', 'analysis', 'together', 'with', 'slidingturnover', 'failure', 'investigation', 'can', 'serve', 'as', 'an', 'useful', 'framework', 'for', 'designing', 'various', 'steel', 'climbing', 'robots', 'in', 'the', 'future', 'experimental', 'results', 'and', 'field', 'deployments', 'confirm', 'the', 'adhesion', 'and', 'climbing', 'capability', 'of', 'the', 'developed', 'robot']]
|
[-0.10119489477419284, 0.06742859097053933, -0.09431811080304618, -0.027302828320354876, -0.14394784413431724, -0.2000707990739533, 0.02214952358212706, 0.4445277838823722, -0.20403202041352322, -0.3556168343759017, 0.09022666894789957, -0.21061330721425564, -0.19336805798559806, 0.24061753737173744, -0.12597017155326518, 0.1317545748273746, 0.07646061540293247, -0.03891151605447581, 0.011622028029283759, -0.1788915426946802, 0.21969697995833842, 0.07990838574082351, 0.333587042617698, 0.0763128607236233, 0.11564097710712284, 0.04662343181343269, 0.027404233443637176, 0.03423037565284476, -0.1370766584618322, 0.14283555785083624, 0.26301771014467956, 0.08963407006849218, 0.28478136830771167, -0.4966844710780634, -0.23850221670629965, 0.047084417452162, 0.0912551211900397, 0.037971617833389565, -0.0677638197420933, -0.33740465761613603, 0.0943939200291631, -0.17072272356407545, -0.14120866640347307, -0.08638630979127351, 0.007916790733867585, 0.018235466941067775, -0.22585121614704887, -0.04977428121732298, 0.022882288321552646, 0.11640780569851092, -0.11355203445088695, -0.09766344396762319, -0.024836219563965024, 0.18917045316037231, 0.040829299069393775, -0.009485443109483217, 0.26306897231027215, -0.09165265636888247, -0.10302294153940969, 0.3891024483216581, 0.0498274229260638, -0.16972359165383658, 0.24085874999537296, -0.050231029356340155, -0.09200175980480445, 0.14256954509956934, 0.22490945264466644, 0.05395900864650966, -0.15976766599630265, -0.009437956878454569, 0.04975649679425297, 0.13203882180471166, 0.095526803835756, -0.07318754950850319, 0.2058391113160658, 0.2812901576740917, 0.10082797673962933, 0.14471761567953773, -0.10756810673166872, -0.07599552641334684, -0.23805440606857822, -0.17911749113874376, -0.12872585021415436, -0.020252764113391414, -0.07062952267426095, -0.1623719141292914, 0.3419972202961439, 0.1371627018082474, 0.16551215866503796, 0.04489100330866892, 0.32921101504423145, -0.024084867290269162, 0.1231446521531925, 0.024969864082786727, 0.23379111431116603, 0.06104093657796914, 0.11977972011993994, -0.20319245018055374, 0.07242939224437878, 0.033618057797154044]
|
1,803.0821
|
Formulas for non-holomorphic Eisenstein series and for the Riemann zeta
function at odd integers
|
New expressions are given for the Fourier expansions of non-holomorphic
Eisenstein series with weight $k$. Among other applications, this leads to
non-holomorphic analogs of formulas of Ramanujan, Grosswald and Berndt
containing Eichler integrals of holomorphic Eisenstein series.
|
math.NT
|
new expressions are given for the fourier expansions of nonholomorphic eisenstein series with weight k among other applications this leads to nonholomorphic analogs of formulas of ramanujan grosswald and berndt containing eichler integrals of holomorphic eisenstein series
|
[['new', 'expressions', 'are', 'given', 'for', 'the', 'fourier', 'expansions', 'of', 'nonholomorphic', 'eisenstein', 'series', 'with', 'weight', 'k', 'among', 'other', 'applications', 'this', 'leads', 'to', 'nonholomorphic', 'analogs', 'of', 'formulas', 'of', 'ramanujan', 'grosswald', 'and', 'berndt', 'containing', 'eichler', 'integrals', 'of', 'holomorphic', 'eisenstein', 'series']]
|
[-0.26879952133943635, 0.0017332547835798727, -0.122145915352222, 0.059178801082048774, -0.18611189418394739, -0.09082742589008477, -0.007131750161837165, 0.2665980498099493, -0.27918202124742997, -0.2269581113424566, 0.04409363850330313, -0.3403847273439169, -0.22562214328596988, 0.30533825357755023, -0.04160770099770161, 0.08191370180187126, -0.005216948907925851, 0.05009846994653344, -0.12271549632876283, -0.4125406478221218, 0.34410748454845613, -0.01604883844912466, 0.08874751340287428, -0.04056652174848649, 0.0027087779405216375, -0.014792827074415982, -0.1100102283526212, -0.25289446532001925, -0.1260614484652049, 0.26157615608018303, 0.3666216146019805, -0.01573958418642481, 0.23350221891370085, -0.4285850077867508, -0.05536591998922328, 0.10973467385499841, 0.14707219001785335, -0.0844316934235394, 0.06892936203318338, -0.23013547280182442, 0.010257624555379152, -0.17767750481531644, -0.15623956081819618, -0.25667059920831686, 0.08106311426187555, 0.08988727137653364, -0.31252394192334676, 0.13998157832409358, 0.04657163046714333, 0.17574627593987519, -0.09074975882605132, -0.24093273126830658, 0.05537059046845469, 0.03904628038354632, 0.09172613954999381, -0.08001379519959705, -0.009239350574918918, -0.1447648510737862, -0.14613900256032744, 0.3132879137992859, -0.10114573670822817, -0.14159079651451772, 0.05396432178612384, -0.2677571104787704, -0.25376603422531235, 0.18819980199138323, 0.08841176234030475, 0.16045178705826402, -0.08800474776782924, 0.16844888362457924, -0.06782575481985179, -0.03869435651641753, 0.32550626138173455, -0.0057156321385668386, 0.14888084198658666, -0.10738707163060705, -0.050664394279010594, 0.20803953239131565, 0.0456668282341626, -0.01041646565621098, -0.38287127452592057, -0.21820338419638574, -0.14921096986573604, 0.1105111874639988, -0.1401496266476493, -0.2830935445510679, 0.42914086238791543, 0.004241307447147038, 0.20160780153754684, 0.17838687555760974, 0.14718888171935557, 0.21159131887058416, 0.136604734023826, -0.05227208949832453, 0.0009410321298572752, 0.22956341065259445, 0.0012233595156835185, -0.08365333183125283, -0.06078208315739175, 0.282831715588044]
|
1,803.08211
|
Low Level RF Control for the PIP-II Accelerator
|
The PIP-II accelerator is a proposed upgrade to the Fermilab accelerator
complex that will replace the existing, 400 MeV room temperature LINAC with an
800 MeV superconducting LINAC. Part of this upgrade includes a new injection
scheme into the booster that levies tight requirements on the LLRF control
system for the cavities. In this paper we discuss the challenges of the PIP-II
accelerator and the present status of the LLRF system for this project.
|
physics.acc-ph
|
the pipii accelerator is a proposed upgrade to the fermilab accelerator complex that will replace the existing 400 mev room temperature linac with an 800 mev superconducting linac part of this upgrade includes a new injection scheme into the booster that levies tight requirements on the llrf control system for the cavities in this paper we discuss the challenges of the pipii accelerator and the present status of the llrf system for this project
|
[['the', 'pipii', 'accelerator', 'is', 'a', 'proposed', 'upgrade', 'to', 'the', 'fermilab', 'accelerator', 'complex', 'that', 'will', 'replace', 'the', 'existing', '400', 'mev', 'room', 'temperature', 'linac', 'with', 'an', '800', 'mev', 'superconducting', 'linac', 'part', 'of', 'this', 'upgrade', 'includes', 'a', 'new', 'injection', 'scheme', 'into', 'the', 'booster', 'that', 'levies', 'tight', 'requirements', 'on', 'the', 'llrf', 'control', 'system', 'for', 'the', 'cavities', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'challenges', 'of', 'the', 'pipii', 'accelerator', 'and', 'the', 'present', 'status', 'of', 'the', 'llrf', 'system', 'for', 'this', 'project']]
|
[-0.12204655442336523, 0.1619860012215213, -0.04124639248727141, -0.011630705664739819, -0.03395257980603649, -0.16355533138974696, 0.005899153824429959, 0.3599033822884431, -0.2072127089911216, -0.30241383186768034, 0.09676829907206215, -0.2798691244884017, 0.026360062428441754, 0.28558483281852426, -0.03580872218653157, 0.08352359940574781, 0.11061253295456236, -0.03844605371783916, -0.06799226812703686, -0.22174860358338905, 0.2889182974043227, 0.20333805698838486, 0.3496049484049247, 0.11861355449198871, 0.16011199902592077, -0.06513746145080675, 0.07425073702895157, -0.16357862269757567, -0.060137849333546614, 0.08629288628533785, 0.30682936460377547, 0.1563633928968999, 0.2865051891201654, -0.42492380056127504, -0.11807696160080063, 0.04541188976224009, 0.0993200732124466, 0.02831362481103153, -0.0979284570580726, -0.2392174053710659, 0.08274775017304598, -0.27895998229851593, -0.21276957720417428, 0.04097078462458543, -0.08015496355034663, 0.029426437928467185, -0.23452549905994455, -0.11922428226790617, 0.0435630015626147, 0.048339475953095665, -0.05332404721175899, -0.15597536813505497, 0.13194133146238085, 0.005050306862874611, -0.03784489994428146, 0.11643493301360994, 0.15296456545616524, -0.08406554758737518, -0.1142341483988472, 0.3287591436449942, 0.0067547808992802294, -0.04115631453994963, 0.11725535282449848, -0.1668261699881908, -0.07707157314478143, 0.08568985286999393, 0.2370860580782834, -0.009193771285936236, -0.21239704088735822, 0.05827830956440192, 0.04222691520998204, 0.20640641903957804, 0.047323293279151656, -0.020136021883101075, 0.18957218915425442, 0.32725342234747634, 0.12366443611303898, 0.15994297606694335, -0.129769390345098, 0.011180502526160027, -0.41480755883998965, -0.15632658259238344, -0.07301564352284814, 0.007366152917588684, 0.09956836104538525, -0.06903788654410557, 0.49885728221395126, 0.1947354179228077, 0.10810681083868887, -0.039416993442746635, 0.39010715952797514, 0.027511016516065277, 0.11457911294545173, 0.06569425917129863, 0.27648902428965716, 0.06359076800730985, 0.22385514805068238, -0.28526362081410717, -0.03824004610824223, -0.009837934111773566]
|
1,803.08212
|
Characterising knotting properties of polymers in nanochannels
|
Using a lattice model of polymers in a tube, we define one way to
characterise different configurations of a given knot as either "local" or
"non-local" and, for several ring polymer models, we provide both theoretical
and numerical evidence that, at equilibrium, the non-local configurations are
more likely than the local ones. These characterisations are based on a
standard approach for measuring the "size" of a knot within a knotted polymer
chain. The method involves associating knot-types to subarcs of the chain, and
then identifying a knotted subarc with minimal arclength; this arclength is
then the knot-size. If the resulting knot-size is small relative to the whole
length of the chain, then the knot is considered to be localised or "local". If
on the other hand the knot-size is comparable to the length of the chain, then
the knot is considered to be "non-local".
Using this definition, we establish that all but exponentially few
sufficiently long self-avoiding polygons (closed chains) in a tubular
sublattice of the simple cubic lattice are "non-locally" knotted. This is shown
to also hold for the case when the same polygons are subject to an external
tensile force, as well as in the extreme case when they are as compact as
possible (no empty lattice sites). We also provide numerical evidence for small
tube sizes that at equilibrium non-local knotting is more likely than local
knotting, regardless of the strength of the stretching or compressing force. We
note however that because of the tube confinement, the occurrence of non-local
knotting in walks (open chains) is significantly different than for polygons.
The relevance of these results to recent experiments involving DNA knots in
solid-state nanopores is also discussed.
|
math.CO cond-mat.soft cond-mat.stat-mech math.GN
|
using a lattice model of polymers in a tube we define one way to characterise different configurations of a given knot as either local or nonlocal and for several ring polymer models we provide both theoretical and numerical evidence that at equilibrium the nonlocal configurations are more likely than the local ones these characterisations are based on a standard approach for measuring the size of a knot within a knotted polymer chain the method involves associating knottypes to subarcs of the chain and then identifying a knotted subarc with minimal arclength this arclength is then the knotsize if the resulting knotsize is small relative to the whole length of the chain then the knot is considered to be localised or local if on the other hand the knotsize is comparable to the length of the chain then the knot is considered to be nonlocal using this definition we establish that all but exponentially few sufficiently long selfavoiding polygons closed chains in a tubular sublattice of the simple cubic lattice are nonlocally knotted this is shown to also hold for the case when the same polygons are subject to an external tensile force as well as in the extreme case when they are as compact as possible no empty lattice sites we also provide numerical evidence for small tube sizes that at equilibrium nonlocal knotting is more likely than local knotting regardless of the strength of the stretching or compressing force we note however that because of the tube confinement the occurrence of nonlocal knotting in walks open chains is significantly different than for polygons the relevance of these results to recent experiments involving dna knots in solidstate nanopores is also discussed
|
[['using', 'a', 'lattice', 'model', 'of', 'polymers', 'in', 'a', 'tube', 'we', 'define', 'one', 'way', 'to', 'characterise', 'different', 'configurations', 'of', 'a', 'given', 'knot', 'as', 'either', 'local', 'or', 'nonlocal', 'and', 'for', 'several', 'ring', 'polymer', 'models', 'we', 'provide', 'both', 'theoretical', 'and', 'numerical', 'evidence', 'that', 'at', 'equilibrium', 'the', 'nonlocal', 'configurations', 'are', 'more', 'likely', 'than', 'the', 'local', 'ones', 'these', 'characterisations', 'are', 'based', 'on', 'a', 'standard', 'approach', 'for', 'measuring', 'the', 'size', 'of', 'a', 'knot', 'within', 'a', 'knotted', 'polymer', 'chain', 'the', 'method', 'involves', 'associating', 'knottypes', 'to', 'subarcs', 'of', 'the', 'chain', 'and', 'then', 'identifying', 'a', 'knotted', 'subarc', 'with', 'minimal', 'arclength', 'this', 'arclength', 'is', 'then', 'the', 'knotsize', 'if', 'the', 'resulting', 'knotsize', 'is', 'small', 'relative', 'to', 'the', 'whole', 'length', 'of', 'the', 'chain', 'then', 'the', 'knot', 'is', 'considered', 'to', 'be', 'localised', 'or', 'local', 'if', 'on', 'the', 'other', 'hand', 'the', 'knotsize', 'is', 'comparable', 'to', 'the', 'length', 'of', 'the', 'chain', 'then', 'the', 'knot', 'is', 'considered', 'to', 'be', 'nonlocal', 'using', 'this', 'definition', 'we', 'establish', 'that', 'all', 'but', 'exponentially', 'few', 'sufficiently', 'long', 'selfavoiding', 'polygons', 'closed', 'chains', 'in', 'a', 'tubular', 'sublattice', 'of', 'the', 'simple', 'cubic', 'lattice', 'are', 'nonlocally', 'knotted', 'this', 'is', 'shown', 'to', 'also', 'hold', 'for', 'the', 'case', 'when', 'the', 'same', 'polygons', 'are', 'subject', 'to', 'an', 'external', 'tensile', 'force', 'as', 'well', 'as', 'in', 'the', 'extreme', 'case', 'when', 'they', 'are', 'as', 'compact', 'as', 'possible', 'no', 'empty', 'lattice', 'sites', 'we', 'also', 'provide', 'numerical', 'evidence', 'for', 'small', 'tube', 'sizes', 'that', 'at', 'equilibrium', 'nonlocal', 'knotting', 'is', 'more', 'likely', 'than', 'local', 'knotting', 'regardless', 'of', 'the', 'strength', 'of', 'the', 'stretching', 'or', 'compressing', 'force', 'we', 'note', 'however', 'that', 'because', 'of', 'the', 'tube', 'confinement', 'the', 'occurrence', 'of', 'nonlocal', 'knotting', 'in', 'walks', 'open', 'chains', 'is', 'significantly', 'different', 'than', 'for', 'polygons', 'the', 'relevance', 'of', 'these', 'results', 'to', 'recent', 'experiments', 'involving', 'dna', 'knots', 'in', 'solidstate', 'nanopores', 'is', 'also', 'discussed']]
|
[-0.13867634195693038, 0.16414527453728495, -0.051747133517970466, 0.07122663873929663, -0.06136360586720652, -0.17218390027659813, 0.01194721290043422, 0.4145899335537771, -0.2731247302976304, -0.23549689222459813, 0.11014392852043134, -0.26208431856108033, -0.123855323900768, 0.19388665133488497, -0.02703910621099307, 0.009999227053984733, 0.059652903321797825, 0.06851375536415227, -0.03908925428591569, -0.2432411869347561, 0.2793774820905777, 0.0342155896784139, 0.22793831147469712, 0.08390791962488688, 0.05069272744169991, -0.02254731824920912, 0.02741284182162157, 0.0894253587408457, -0.17553804873740383, 0.12483745199897385, 0.18022397055648462, 0.031998912822122555, 0.21122848570147262, -0.45732182165208674, -0.200909698633976, 0.12565353895604078, 0.15436984747315624, 0.1354188642198486, -0.002192541850152858, -0.24192763193360797, 0.11229470172973899, -0.12049560616412366, -0.14997037366099122, -0.04314981377350965, 0.06912368927317272, 0.06688377177800119, -0.2222424371833248, 0.05938513303647466, 0.07336742136615482, 0.06604044500937951, -0.030921296197422114, -0.07642516301213098, -0.03407432096095623, 0.11276994414781387, 0.05829653698144414, 0.05082900308105828, 0.13732396308831604, -0.1260145510413817, -0.09850231383461505, 0.4040391898048776, -0.033863654711032205, -0.2368741109102432, 0.21598529680486536, -0.12606325438079824, -0.13782463139754586, 0.139098985698573, 0.07893470944878313, 0.12976004584592635, -0.12371508175326329, 0.04041903206982949, -0.0760801426733711, 0.1399300222297565, 0.08410753370096374, 0.012192993544990064, 0.2035070101763787, 0.1537513230519835, 0.10338202986011831, 0.19933985586664807, -0.07440323021562238, -0.1205944856032147, -0.3044256271586554, -0.1694429432108466, -0.18066509137404085, 0.06099803323574763, -0.1041688456265027, -0.2102546695818351, 0.3753298230053458, 0.10136234094265352, 0.1881105942468691, 0.07593442369917673, 0.24280081923851476, 0.058081804351032974, 0.08385980223870969, 0.05351699363007875, 0.1986889123434334, 0.10609904940522807, 0.011348079453039514, -0.18391898899946163, 0.047516754557312066, 0.08917066948571509]
|
1,803.08213
|
Engineering giant magnetic anisotropy in single-molecule magnets by
dimerizing heavy transition-metal atoms
|
Search for single-molecule magnets with large magnetic anisotropy energy
(MAE) is essential for the development of molecular spintronics devices used at
room temperature. Through systematic first-principles calculations, we found
that an Os-Os or Ir-Ir dimer embedded in the (5,5'-Br2-Salophen) molecule gives
rise to large MAE of 41.6 or 51.4 meV which is large enough to hold the spin
orientation at room temperature. Analysis of electronic structures reveals that
the top Os and Ir atoms are most responsible for the spin moments and large
MAEs of the molecules.
|
cond-mat.mes-hall
|
search for singlemolecule magnets with large magnetic anisotropy energy mae is essential for the development of molecular spintronics devices used at room temperature through systematic firstprinciples calculations we found that an osos or irir dimer embedded in the 55br2salophen molecule gives rise to large mae of 416 or 514 mev which is large enough to hold the spin orientation at room temperature analysis of electronic structures reveals that the top os and ir atoms are most responsible for the spin moments and large maes of the molecules
|
[['search', 'for', 'singlemolecule', 'magnets', 'with', 'large', 'magnetic', 'anisotropy', 'energy', 'mae', 'is', 'essential', 'for', 'the', 'development', 'of', 'molecular', 'spintronics', 'devices', 'used', 'at', 'room', 'temperature', 'through', 'systematic', 'firstprinciples', 'calculations', 'we', 'found', 'that', 'an', 'osos', 'or', 'irir', 'dimer', 'embedded', 'in', 'the', '55br2salophen', 'molecule', 'gives', 'rise', 'to', 'large', 'mae', 'of', '416', 'or', '514', 'mev', 'which', 'is', 'large', 'enough', 'to', 'hold', 'the', 'spin', 'orientation', 'at', 'room', 'temperature', 'analysis', 'of', 'electronic', 'structures', 'reveals', 'that', 'the', 'top', 'os', 'and', 'ir', 'atoms', 'are', 'most', 'responsible', 'for', 'the', 'spin', 'moments', 'and', 'large', 'maes', 'of', 'the', 'molecules']]
|
[-0.14703563310552475, 0.1846971331060347, -0.002779418293949823, 0.035718984322535785, -0.016381972224714214, -0.10804240936738287, 0.04217396568247052, 0.4153607471867703, -0.2171206787339585, -0.34470390343258894, -0.004423713031344029, -0.32853207788105276, -0.05822449648038073, 0.2072130388980948, 0.10344164646880398, -0.008505744975991547, 0.013924530393249073, -0.024176298142519106, -0.040760715735729695, -0.17325283177630152, 0.19958421702599585, 0.08987941940553314, 0.29832252815669014, 0.1716329733148044, 0.06544155597708426, -0.0076753819269279756, 0.12819317173007008, -0.012320230758294116, -0.13303575465583573, 0.13880279395989206, 0.2881019629191521, -0.09387024013368889, 0.18705852692784353, -0.46231391846180653, -0.12107702383776954, 0.03480442209970639, 0.10789439312269002, 0.18337586508430323, -0.08591167495005932, -0.23305015573494656, 0.10979344649781841, -0.10636511204634296, -0.13544933622967598, -0.15323889666767573, 0.015973421723343605, 0.00781232753205438, -0.2317948517887745, 0.08532444251224745, 0.04773997055734833, 0.14803646441180526, -0.08423854447417313, -0.2182019943977858, -0.06625635632811937, 0.07336808070215549, 0.04129127511039896, 0.08100758067353866, 0.2134752818112543, -0.09316322743841231, -0.0918142931795744, 0.4043797549986562, -0.053549976418401264, -0.05957726542404745, 0.17128505548638248, -0.1655978585964307, -0.13320987988371663, 0.19887867279697297, 0.1280147404637361, 0.10169003455531458, -0.15012090773386663, 0.0755691638765965, 0.06216830124118809, 0.23641932069399763, 0.022260971990045765, 0.0803773969379362, 0.2630757120719483, 0.17850975302416225, 0.057755614676902635, 0.1096118219348407, -0.18071221077251573, -0.06845575980679673, -0.2022448790281318, -0.18849212573408042, -0.23233608576079268, 0.09846744505650645, -0.09504364312289358, -0.18934913674845946, 0.3577676123592916, 0.14772738876406016, 0.15315928484643485, -0.07726146343440293, 0.2078811841865265, 0.05447380035725791, 0.13955283797952497, 0.044214582268343586, 0.225385396329816, 0.15302437219530518, 0.1018108231378286, -0.2697192744221972, 0.08333818491569958, -0.04390313938736569]
|
1,803.08214
|
A time machine for free fall into the past
|
Inspired by some recent works of Tippett-Tsang and Mallary-Khanna-Price, we
present a new spacetime model containing closed timelike curves (CTCs). This
model is obtained postulating an ad hoc Lorentzian metric on $\mathbb{R}^4$,
which differs from the Minkowski metric only inside a spacetime region bounded
by two concentric tori. The resulting spacetime is topologically trivial, free
of curvature singularities and is both time and space orientable; besides, the
inner region enclosed by the smaller torus is flat and displays geodesic CTCs.
Our model shares some similarities with the time machine of Ori and Soen but it
has the advantage of a higher symmetry in the metric, allowing for the explicit
computation of a class of geodesics. The most remarkable feature emerging from
this computation is the presence of future-oriented timelike geodesics starting
from a point in the outer Minkowskian region, moving to the inner spacetime
region with CTCs, and then returning to the initial spatial position at an
earlier time; this means that time travel to the past can be performed by free
fall across our time machine. The amount of time travelled into the past is
determined quantitatively; this amount can be made arbitrarily large keeping
non-large the proper duration of the travel. An important drawback of the model
is the violation of the classical energy conditions, a common feature of many
time machines. Other problems emerge from our computations of the required
(negative) energy densities and of the tidal accelerations; these are small
only if the time machine is gigantic.
|
gr-qc hep-th
|
inspired by some recent works of tippetttsang and mallarykhannaprice we present a new spacetime model containing closed timelike curves ctcs this model is obtained postulating an ad hoc lorentzian metric on mathbbr4 which differs from the minkowski metric only inside a spacetime region bounded by two concentric tori the resulting spacetime is topologically trivial free of curvature singularities and is both time and space orientable besides the inner region enclosed by the smaller torus is flat and displays geodesic ctcs our model shares some similarities with the time machine of ori and soen but it has the advantage of a higher symmetry in the metric allowing for the explicit computation of a class of geodesics the most remarkable feature emerging from this computation is the presence of futureoriented timelike geodesics starting from a point in the outer minkowskian region moving to the inner spacetime region with ctcs and then returning to the initial spatial position at an earlier time this means that time travel to the past can be performed by free fall across our time machine the amount of time travelled into the past is determined quantitatively this amount can be made arbitrarily large keeping nonlarge the proper duration of the travel an important drawback of the model is the violation of the classical energy conditions a common feature of many time machines other problems emerge from our computations of the required negative energy densities and of the tidal accelerations these are small only if the time machine is gigantic
|
[['inspired', 'by', 'some', 'recent', 'works', 'of', 'tippetttsang', 'and', 'mallarykhannaprice', 'we', 'present', 'a', 'new', 'spacetime', 'model', 'containing', 'closed', 'timelike', 'curves', 'ctcs', 'this', 'model', 'is', 'obtained', 'postulating', 'an', 'ad', 'hoc', 'lorentzian', 'metric', 'on', 'mathbbr4', 'which', 'differs', 'from', 'the', 'minkowski', 'metric', 'only', 'inside', 'a', 'spacetime', 'region', 'bounded', 'by', 'two', 'concentric', 'tori', 'the', 'resulting', 'spacetime', 'is', 'topologically', 'trivial', 'free', 'of', 'curvature', 'singularities', 'and', 'is', 'both', 'time', 'and', 'space', 'orientable', 'besides', 'the', 'inner', 'region', 'enclosed', 'by', 'the', 'smaller', 'torus', 'is', 'flat', 'and', 'displays', 'geodesic', 'ctcs', 'our', 'model', 'shares', 'some', 'similarities', 'with', 'the', 'time', 'machine', 'of', 'ori', 'and', 'soen', 'but', 'it', 'has', 'the', 'advantage', 'of', 'a', 'higher', 'symmetry', 'in', 'the', 'metric', 'allowing', 'for', 'the', 'explicit', 'computation', 'of', 'a', 'class', 'of', 'geodesics', 'the', 'most', 'remarkable', 'feature', 'emerging', 'from', 'this', 'computation', 'is', 'the', 'presence', 'of', 'futureoriented', 'timelike', 'geodesics', 'starting', 'from', 'a', 'point', 'in', 'the', 'outer', 'minkowskian', 'region', 'moving', 'to', 'the', 'inner', 'spacetime', 'region', 'with', 'ctcs', 'and', 'then', 'returning', 'to', 'the', 'initial', 'spatial', 'position', 'at', 'an', 'earlier', 'time', 'this', 'means', 'that', 'time', 'travel', 'to', 'the', 'past', 'can', 'be', 'performed', 'by', 'free', 'fall', 'across', 'our', 'time', 'machine', 'the', 'amount', 'of', 'time', 'travelled', 'into', 'the', 'past', 'is', 'determined', 'quantitatively', 'this', 'amount', 'can', 'be', 'made', 'arbitrarily', 'large', 'keeping', 'nonlarge', 'the', 'proper', 'duration', 'of', 'the', 'travel', 'an', 'important', 'drawback', 'of', 'the', 'model', 'is', 'the', 'violation', 'of', 'the', 'classical', 'energy', 'conditions', 'a', 'common', 'feature', 'of', 'many', 'time', 'machines', 'other', 'problems', 'emerge', 'from', 'our', 'computations', 'of', 'the', 'required', 'negative', 'energy', 'densities', 'and', 'of', 'the', 'tidal', 'accelerations', 'these', 'are', 'small', 'only', 'if', 'the', 'time', 'machine', 'is', 'gigantic']]
|
[-0.1592798133615654, 0.1386758848362778, -0.10954824039494739, 0.05022686090500605, -0.09106536862260152, -0.12416845092159365, 0.01661252153175038, 0.36059909398036616, -0.2616665694668266, -0.28692950825385316, 0.086005541506306, -0.27266911713541636, -0.08943654302669118, 0.19793407512723557, -0.08626604678283911, 0.04175331847410792, 0.05373021922376563, 0.0855169728184269, -0.06824292595809957, -0.23065100605749794, 0.3439990017242024, 0.05476523180972905, 0.245831060861688, 0.027090648182615217, 0.1113652908557748, -0.03117042940979328, -0.025987466594444647, 0.05307019202424976, -0.0958319682505692, 0.11460527500293533, 0.20928177324258873, 0.12546429665986403, 0.2498582724853599, -0.4388453127185424, -0.27300554265469057, 0.12739582892578666, 0.14207384986483731, 0.09144344904991393, -0.026439771127995976, -0.30525203977876736, 0.047557721841111476, -0.10521236347361287, -0.16367786433998374, -0.018072147282861894, 0.05136157373330676, -0.05148922015852746, -0.17382184007475454, 0.07295821922185321, 0.06954603857593611, 0.03717126277666877, -0.06826579692067518, -0.04690948983789572, -0.031205010651085045, 0.1309605502033411, 0.10188841784366237, 0.07320246674428363, 0.11610674284137561, -0.0949835990721758, -0.07850996981517622, 0.366166201145989, -0.03630352090676165, -0.20320423694189935, 0.16958566564238525, -0.15829978945041676, -0.06069413951932332, 0.16082897573153698, 0.13444104176502855, 0.15111773090276046, -0.12467131524857494, 0.13031859754142538, -0.04347336862889689, 0.12629652593433652, 0.10067496939013983, 0.02110092877598119, 0.22490013332384068, 0.12001860327079832, 0.03353696934209438, 0.11101783337207669, -0.10264894436536011, -0.14501155752992828, -0.35570872169844203, -0.17168708702158783, -0.16495578988800727, 0.0624416402687559, -0.15126913246111204, -0.16452367981940869, 0.37780515397260445, 0.07400136489224914, 0.22007282476800855, 0.06231865135698406, 0.305984775171495, 0.07136194455022397, 0.09070370944626178, 0.1588380624096082, 0.2471883338690649, 0.0531601189737088, 0.08019872693600313, -0.18476625663066853, 0.04191148891198194, 0.06641881090059366]
|
1,803.08215
|
Implementing Tidal and Gravitational Wave Energy Losses in Few-body
Codes: A Fast and Easy Drag Force Model
|
We present a drag force model for evolving chaotic few-body interactions with
the inclusion of orbital energy losses, such as tidal dissipation and
gravitational wave (GW) emission. The main effect from such losses is the
formation of two-body captures, that for compact objects result in GW mergers,
and for stars lead to either compact binaries, mergers or disruptions. Studying
the inclusion of energy loss terms in few-body interactions is therefore likely
to be important for modeling and understanding the variety of transients that
soon will be observed by current and upcoming surveys. However, including
especially tides in few-body codes has been shown to be technically difficult
and computationally heavy, which has lead to very few systematic tidal studies.
In this paper we derive a drag force term that can be used to model the effects
from tidal, as well as other, energy losses in few-body interactions, if the
two-body orbit averaged energy loss is known a priori. This drag force model is
very fast to evolve, and gives results in agreement with other approaches,
including the impulsive and affine tide approximations.
|
astro-ph.HE
|
we present a drag force model for evolving chaotic fewbody interactions with the inclusion of orbital energy losses such as tidal dissipation and gravitational wave gw emission the main effect from such losses is the formation of twobody captures that for compact objects result in gw mergers and for stars lead to either compact binaries mergers or disruptions studying the inclusion of energy loss terms in fewbody interactions is therefore likely to be important for modeling and understanding the variety of transients that soon will be observed by current and upcoming surveys however including especially tides in fewbody codes has been shown to be technically difficult and computationally heavy which has lead to very few systematic tidal studies in this paper we derive a drag force term that can be used to model the effects from tidal as well as other energy losses in fewbody interactions if the twobody orbit averaged energy loss is known a priori this drag force model is very fast to evolve and gives results in agreement with other approaches including the impulsive and affine tide approximations
|
[['we', 'present', 'a', 'drag', 'force', 'model', 'for', 'evolving', 'chaotic', 'fewbody', 'interactions', 'with', 'the', 'inclusion', 'of', 'orbital', 'energy', 'losses', 'such', 'as', 'tidal', 'dissipation', 'and', 'gravitational', 'wave', 'gw', 'emission', 'the', 'main', 'effect', 'from', 'such', 'losses', 'is', 'the', 'formation', 'of', 'twobody', 'captures', 'that', 'for', 'compact', 'objects', 'result', 'in', 'gw', 'mergers', 'and', 'for', 'stars', 'lead', 'to', 'either', 'compact', 'binaries', 'mergers', 'or', 'disruptions', 'studying', 'the', 'inclusion', 'of', 'energy', 'loss', 'terms', 'in', 'fewbody', 'interactions', 'is', 'therefore', 'likely', 'to', 'be', 'important', 'for', 'modeling', 'and', 'understanding', 'the', 'variety', 'of', 'transients', 'that', 'soon', 'will', 'be', 'observed', 'by', 'current', 'and', 'upcoming', 'surveys', 'however', 'including', 'especially', 'tides', 'in', 'fewbody', 'codes', 'has', 'been', 'shown', 'to', 'be', 'technically', 'difficult', 'and', 'computationally', 'heavy', 'which', 'has', 'lead', 'to', 'very', 'few', 'systematic', 'tidal', 'studies', 'in', 'this', 'paper', 'we', 'derive', 'a', 'drag', 'force', 'term', 'that', 'can', 'be', 'used', 'to', 'model', 'the', 'effects', 'from', 'tidal', 'as', 'well', 'as', 'other', 'energy', 'losses', 'in', 'fewbody', 'interactions', 'if', 'the', 'twobody', 'orbit', 'averaged', 'energy', 'loss', 'is', 'known', 'a', 'priori', 'this', 'drag', 'force', 'model', 'is', 'very', 'fast', 'to', 'evolve', 'and', 'gives', 'results', 'in', 'agreement', 'with', 'other', 'approaches', 'including', 'the', 'impulsive', 'and', 'affine', 'tide', 'approximations']]
|
[-0.13467152184582937, 0.14502651773094719, -0.09410790781051857, 0.14984064723766352, -0.08472830117988858, -0.09291374796322284, -0.019857080489299284, 0.3521690834622357, -0.263714050852246, -0.3221692840841429, 0.05296051748050634, -0.2818295459458553, -0.14056753219640428, 0.2526536864390628, -0.028884309989744953, 0.03798099249107403, 0.13730836621079162, -0.016421754546051857, -0.03743897543227022, -0.21029092869412627, 0.3149222458908283, 0.10757764224837744, 0.12765633188784944, 0.07986573705408537, 0.028682472400408422, -0.008020128491360344, -0.0006768324113970633, 0.01941174320691363, -0.09374696753583224, 0.04004463989246451, 0.26732081835523497, 0.07262740673584792, 0.24487596841333487, -0.45371371529769994, -0.2657214566288279, 0.10037920243352477, 0.15455727421200077, 0.15430357104916, -0.07679421326804145, -0.2616362803054778, 0.011897607613869465, -0.2674439178383523, -0.13411066667704188, -0.09926087347255474, 0.08607338415812546, 0.0664935192802036, -0.28414222070026257, 0.1304952874335908, 0.07346978668349882, -0.008984362516161156, -0.1026876390080652, -0.07961261084180091, -0.006138219597147397, 0.09762672793753034, 0.10661918112496171, 0.07712744027170358, 0.165050215069822, -0.13630872161271698, -0.06931019414895477, 0.4562358462472976, -0.06703575835331699, -0.16247642642782373, 0.25499901572726047, -0.13961827020014209, -0.11296319948169738, 0.14062263544401904, 0.21603449736335906, 0.07873913881662224, -0.1757526607355566, 0.02143393585603756, 0.05830193604273498, 0.13054035953889237, 0.05366375461961683, 0.07628423679430772, 0.2737494956866648, 0.1741166801799027, 0.04471661976296763, 0.08225162837780416, -0.11941055518199396, -0.07589373152538394, -0.23649982003834696, -0.061105168625218434, -0.14846089081221275, 0.09276767478101612, -0.028032102068395414, -0.15372786291753385, 0.32250578542631014, 0.14558783048784452, 0.1680093010146562, 0.01624874280860843, 0.33022712846672503, 0.12810240871303855, 0.1081435367701709, 0.07998342398626122, 0.34400687315784273, 0.1283422271008423, 0.03231017352261925, -0.2310652793333634, 0.08519902337440263, 0.020834164524152463]
|
1,803.08216
|
Varieties with nef diagonal
|
For a smooth projective variety $X$, we consider when the diagonal $\Delta_X$
is nef as a cycle on $X\times X$. In particular, we give a classification of
complete intersections and smooth del Pezzo varieties where the diagonal is
nef. We also study the nefness of the diagonal for spherical varieties.
|
math.AG
|
for a smooth projective variety x we consider when the diagonal delta_x is nef as a cycle on xtimes x in particular we give a classification of complete intersections and smooth del pezzo varieties where the diagonal is nef we also study the nefness of the diagonal for spherical varieties
|
[['for', 'a', 'smooth', 'projective', 'variety', 'x', 'we', 'consider', 'when', 'the', 'diagonal', 'delta_x', 'is', 'nef', 'as', 'a', 'cycle', 'on', 'xtimes', 'x', 'in', 'particular', 'we', 'give', 'a', 'classification', 'of', 'complete', 'intersections', 'and', 'smooth', 'del', 'pezzo', 'varieties', 'where', 'the', 'diagonal', 'is', 'nef', 'we', 'also', 'study', 'the', 'nefness', 'of', 'the', 'diagonal', 'for', 'spherical', 'varieties']]
|
[-0.241092391833663, -0.003768473174422979, -0.027899543941020965, 0.0860203672433272, -0.03265976934693754, -0.21730599609203638, 0.0038622674718499185, 0.34422886796295643, -0.2512289657257497, -0.060703792665153744, 0.11966612670337781, -0.26095714980736373, -0.1444540655426681, 0.1984496786445379, -0.2113621363893617, -0.04601166650652885, 0.012065439517609775, 0.06759512414690107, -0.20094727331772447, -0.36415032532531766, 0.49416452705860137, -0.11480020659044385, 0.23833167608827352, 0.12214861437678337, 0.15402726031839847, 0.039309564642608166, 0.10308299362659454, -0.026279824078083037, -0.13234005445614458, 0.09012189015746117, 0.35525884553790094, 0.09715301684103907, 0.11578662101179361, -0.3760649064183235, -0.1464126546587795, 0.3221340983733535, 0.08996402629651129, 0.00016872238367795944, 0.027635460558813066, -0.2015086028724909, 0.07429101519752294, -0.11961944200098515, -0.22636480443179607, -0.11321708686649799, 0.09383768338710069, 0.06477779449429363, -0.23343124585226177, -0.053279539985232986, 0.12638839852064848, 0.19027136093005537, 0.038285486567765474, -0.12603884663432838, -0.15039473228156566, 0.0068013395351590586, -0.04988895238144323, 0.07786410338710993, 0.0632601275946945, -0.06184170326218009, -0.042207427569665015, 0.37499419823288915, -0.10098702994175256, -0.24075487315654753, 0.06126484152860939, -0.1708808209747076, -0.1515295923128724, 0.14818943919613958, 0.1656584868952632, 0.25772200266830625, 0.04748262521199649, 0.21167652569594794, -0.1662647845596075, 0.009171414952725172, 0.061832081777974966, -0.08506670936942101, 0.1306109002046287, 0.15240155496634544, 0.1109548265300691, 0.0814463510364294, -0.08275713125709444, 0.01089264927431941, -0.43146974995732307, -0.2118188107572496, -0.08186424658168107, 0.2681886474043131, -0.13112516098626656, -0.1839393873885274, 0.4225961188971996, -0.025535691902041434, 0.2661052520945668, 0.11863328179344534, 0.2503284192830324, -0.03894279781961814, -0.054745766741689295, 0.025606185065116735, 0.1346124939620495, 0.20762942757457495, -0.05530395324341953, -0.1051847665105015, -0.006771731784101576, 0.2071753296814859]
|
1,803.08217
|
Invariant Wide Bandgaps in Honeycomb Monolayer and Single-Walled
Nanotubes of IIB-VI Semiconductors
|
Search for low-dimensional materials with unique electronic properties is
important for the development of electronic devices in nano scale. Through
systematic first-principles calculations, we found that the band gaps of the
two-dimensional honeycomb monolayers and one-dimensional single-walled
nanotubes of IIB-VI semiconductors (ZnO, CdO, ZnS and CdS) are nearly
chirality-independent and weakly diameter-dependent. Based on analysis of the
electronic structures, it was found that the conduction band minimum is
contributed by the spherically symmetric $s$ orbitals of cations and the
valence band maximum is dominated by the in-plane $(d_{xy}-p_y)$ and
$(d_{x^2-y^2}-p_x)$ hybridizations. These electronic states are robust against
radius curvature, resulting in the invariant feature of the band gaps for the
structures changing from honeycomb monolayer to single-walled nanotubes. The
band gaps of these materials range from 2.3 eV to 4.7 eV, which is of potential
applications in electronic devices and optoelectronic devices. Our studies show
that searching for and designing specific electronic structures can facilitate
the process of exploring novel nanomaterials for future applications.
|
cond-mat.mtrl-sci
|
search for lowdimensional materials with unique electronic properties is important for the development of electronic devices in nano scale through systematic firstprinciples calculations we found that the band gaps of the twodimensional honeycomb monolayers and onedimensional singlewalled nanotubes of iibvi semiconductors zno cdo zns and cds are nearly chiralityindependent and weakly diameterdependent based on analysis of the electronic structures it was found that the conduction band minimum is contributed by the spherically symmetric s orbitals of cations and the valence band maximum is dominated by the inplane d_xyp_y and d_x2y2p_x hybridizations these electronic states are robust against radius curvature resulting in the invariant feature of the band gaps for the structures changing from honeycomb monolayer to singlewalled nanotubes the band gaps of these materials range from 23 ev to 47 ev which is of potential applications in electronic devices and optoelectronic devices our studies show that searching for and designing specific electronic structures can facilitate the process of exploring novel nanomaterials for future applications
|
[['search', 'for', 'lowdimensional', 'materials', 'with', 'unique', 'electronic', 'properties', 'is', 'important', 'for', 'the', 'development', 'of', 'electronic', 'devices', 'in', 'nano', 'scale', 'through', 'systematic', 'firstprinciples', 'calculations', 'we', 'found', 'that', 'the', 'band', 'gaps', 'of', 'the', 'twodimensional', 'honeycomb', 'monolayers', 'and', 'onedimensional', 'singlewalled', 'nanotubes', 'of', 'iibvi', 'semiconductors', 'zno', 'cdo', 'zns', 'and', 'cds', 'are', 'nearly', 'chiralityindependent', 'and', 'weakly', 'diameterdependent', 'based', 'on', 'analysis', 'of', 'the', 'electronic', 'structures', 'it', 'was', 'found', 'that', 'the', 'conduction', 'band', 'minimum', 'is', 'contributed', 'by', 'the', 'spherically', 'symmetric', 's', 'orbitals', 'of', 'cations', 'and', 'the', 'valence', 'band', 'maximum', 'is', 'dominated', 'by', 'the', 'inplane', 'd_xyp_y', 'and', 'd_x2y2p_x', 'hybridizations', 'these', 'electronic', 'states', 'are', 'robust', 'against', 'radius', 'curvature', 'resulting', 'in', 'the', 'invariant', 'feature', 'of', 'the', 'band', 'gaps', 'for', 'the', 'structures', 'changing', 'from', 'honeycomb', 'monolayer', 'to', 'singlewalled', 'nanotubes', 'the', 'band', 'gaps', 'of', 'these', 'materials', 'range', 'from', '23', 'ev', 'to', '47', 'ev', 'which', 'is', 'of', 'potential', 'applications', 'in', 'electronic', 'devices', 'and', 'optoelectronic', 'devices', 'our', 'studies', 'show', 'that', 'searching', 'for', 'and', 'designing', 'specific', 'electronic', 'structures', 'can', 'facilitate', 'the', 'process', 'of', 'exploring', 'novel', 'nanomaterials', 'for', 'future', 'applications']]
|
[-0.13192322048125787, 0.14067609308403917, 0.012637852579064201, 0.0023354546884206684, -0.01575891117681749, -0.12527762831159633, 0.09794591149548068, 0.48742538923834217, -0.27919437771925004, -0.30701534181134776, 0.017008828503094264, -0.34893791253562084, -0.17418022314959672, 0.1948568680716562, 0.06370986981200985, 0.052041031140834096, 0.050893289162195286, -0.14875671611189317, -0.07834863305470208, -0.14962244655907853, 0.27068628373672254, 0.07908813298636233, 0.33449415328504983, 0.13790537780441808, -0.030755106525612065, -0.006099221722979564, 0.09385705579188652, 0.00855518748285249, -0.15276591436545459, 0.18635440086763994, 0.3001736418533255, -0.10783309918333543, 0.2304869505460374, -0.46931987497955563, -0.22084019618923775, -0.015256838806089945, 0.10541739581021829, 0.11975578736382886, -0.08810512468990055, -0.28985560657456516, 0.1208529831852502, -0.11377765706274659, -0.07569958742942617, -0.09893633830943145, 0.027467164967674762, 0.022040693505550733, -0.18630742910318077, 0.07018231613037643, 0.0026539340426097622, 0.05442290118185156, -0.14616581329091788, -0.21022686746146063, -0.12377015420788666, 0.06524961036484456, 0.017630916339658142, -0.04104727580561303, 0.20658199154422618, -0.10738451114157214, -0.14365669908002018, 0.4615845595835708, -0.018550098506966605, -0.06796572959574405, 0.1526700463349698, -0.12295711240149103, -0.05984246033767704, 0.1558130389865255, 0.12416265962528997, 0.10935737953986972, -0.15921035870560446, 0.10939845177672396, 0.011661324961278297, 0.17925641779638682, 0.03757356982387137, 0.13488792601856403, 0.26988651947758624, 0.20306743742912658, 0.07908443884371082, 0.09772023552213796, -0.11450397186417831, -0.016950234352771078, -0.15745958559637074, -0.2174296158424113, -0.24350769306474832, 0.07046051073775743, -0.07000429527188316, -0.23013576132943853, 0.4682311992626637, 0.08687356208074562, 0.11310464544221759, -0.06544651361837169, 0.17180746502708644, 0.06826168617553777, 0.09875530560384504, 0.04340003699471708, 0.25651919141528196, 0.136480428520008, 0.07976943318062694, -0.21772278264252237, 0.044916115954401904, -0.04264911060454324]
|
1,803.08218
|
Causal Inference for Survival Analysis
|
In this paper, we propose the use of causal inference techniques for survival
function estimation and prediction for subgroups of the data, upto individual
units. Tree ensemble methods, specifically random forests were modified for
this purpose. A real world healthcare dataset was used with about 1800 patients
with breast cancer, which has multiple patient covariates as well as disease
free survival days (DFS) and a death event binary indicator (y). We use the
type of cancer curative intervention as the treatment variable (T=0 or 1,
binary treatment case in our example). The algorithm is a 2 step approach. In
step 1, we estimate heterogeneous treatment effects using a causalTree with the
DFS as the dependent variable. Next, in step 2, for each selected leaf of the
causalTree with distinctly different average treatment effect (with respect to
survival), we fit a survival forest to all the patients in that leaf, one
forest each for treatment T=0 as well as T=1 to get estimated patient level
survival curves for each treatment (more generally, any model can be used at
this step). Then, we subtract the patient level survival curves to get the
differential survival curve for a given patient, to compare the survival
function as a result of the 2 treatments. The path to a selected leaf also
gives us the combination of patient features and their values which are
causally important for the treatment effect difference at the leaf.
|
econ.EM
|
in this paper we propose the use of causal inference techniques for survival function estimation and prediction for subgroups of the data upto individual units tree ensemble methods specifically random forests were modified for this purpose a real world healthcare dataset was used with about 1800 patients with breast cancer which has multiple patient covariates as well as disease free survival days dfs and a death event binary indicator y we use the type of cancer curative intervention as the treatment variable t0 or 1 binary treatment case in our example the algorithm is a 2 step approach in step 1 we estimate heterogeneous treatment effects using a causaltree with the dfs as the dependent variable next in step 2 for each selected leaf of the causaltree with distinctly different average treatment effect with respect to survival we fit a survival forest to all the patients in that leaf one forest each for treatment t0 as well as t1 to get estimated patient level survival curves for each treatment more generally any model can be used at this step then we subtract the patient level survival curves to get the differential survival curve for a given patient to compare the survival function as a result of the 2 treatments the path to a selected leaf also gives us the combination of patient features and their values which are causally important for the treatment effect difference at the leaf
|
[['in', 'this', 'paper', 'we', 'propose', 'the', 'use', 'of', 'causal', 'inference', 'techniques', 'for', 'survival', 'function', 'estimation', 'and', 'prediction', 'for', 'subgroups', 'of', 'the', 'data', 'upto', 'individual', 'units', 'tree', 'ensemble', 'methods', 'specifically', 'random', 'forests', 'were', 'modified', 'for', 'this', 'purpose', 'a', 'real', 'world', 'healthcare', 'dataset', 'was', 'used', 'with', 'about', '1800', 'patients', 'with', 'breast', 'cancer', 'which', 'has', 'multiple', 'patient', 'covariates', 'as', 'well', 'as', 'disease', 'free', 'survival', 'days', 'dfs', 'and', 'a', 'death', 'event', 'binary', 'indicator', 'y', 'we', 'use', 'the', 'type', 'of', 'cancer', 'curative', 'intervention', 'as', 'the', 'treatment', 'variable', 't0', 'or', '1', 'binary', 'treatment', 'case', 'in', 'our', 'example', 'the', 'algorithm', 'is', 'a', '2', 'step', 'approach', 'in', 'step', '1', 'we', 'estimate', 'heterogeneous', 'treatment', 'effects', 'using', 'a', 'causaltree', 'with', 'the', 'dfs', 'as', 'the', 'dependent', 'variable', 'next', 'in', 'step', '2', 'for', 'each', 'selected', 'leaf', 'of', 'the', 'causaltree', 'with', 'distinctly', 'different', 'average', 'treatment', 'effect', 'with', 'respect', 'to', 'survival', 'we', 'fit', 'a', 'survival', 'forest', 'to', 'all', 'the', 'patients', 'in', 'that', 'leaf', 'one', 'forest', 'each', 'for', 'treatment', 't0', 'as', 'well', 'as', 't1', 'to', 'get', 'estimated', 'patient', 'level', 'survival', 'curves', 'for', 'each', 'treatment', 'more', 'generally', 'any', 'model', 'can', 'be', 'used', 'at', 'this', 'step', 'then', 'we', 'subtract', 'the', 'patient', 'level', 'survival', 'curves', 'to', 'get', 'the', 'differential', 'survival', 'curve', 'for', 'a', 'given', 'patient', 'to', 'compare', 'the', 'survival', 'function', 'as', 'a', 'result', 'of', 'the', '2', 'treatments', 'the', 'path', 'to', 'a', 'selected', 'leaf', 'also', 'gives', 'us', 'the', 'combination', 'of', 'patient', 'features', 'and', 'their', 'values', 'which', 'are', 'causally', 'important', 'for', 'the', 'treatment', 'effect', 'difference', 'at', 'the', 'leaf']]
|
[-0.012526139675913836, 0.0784098303174379, -0.09409182133267523, 0.1023505044162818, -0.054748364858392434, -0.16559834734505138, 0.10058862493931853, 0.39946845913763646, -0.20540399505299026, -0.28212210308820584, 0.12461032136886033, -0.305102788906355, -0.12448068852787955, 0.1767135318112165, -0.08766148240582709, 0.04865681978444011, 0.10106223017782352, 0.09147599483327151, 0.005220999867237031, -0.29521722164226033, 0.29653855445557986, 0.02849223666382417, 0.27026306408047046, -0.02865063597377137, 0.0957725138755681, 0.09143287470067014, -0.03715142268456629, 0.011748372100123946, -0.11031794598414509, 0.08035593727303637, 0.3131506167336414, 0.18157384656685388, 0.3239730850998628, -0.3725383995609926, -0.2440818235045299, 0.13324848277360138, 0.13689333242877244, 0.12341409289883351, 0.016065069484823852, -0.22094567696232412, 0.0585415567699583, -0.1692026173222368, -0.12821606186542156, -0.028530068415852452, 0.023420719335139808, -0.02095382375508484, -0.31196962804849243, 0.1098904243671144, -0.004718259497845577, 0.08965259335019578, -0.10306353695045414, -0.14987147443358573, -0.01692060879293545, 0.1968756726184777, 0.052704118210447445, 0.07104677217050605, 0.15453743140836704, -0.11224421504707376, -0.12343943910919904, 0.3442710533351401, -0.043810816754002946, -0.1945515675193993, 0.15770112817822876, -0.1439734094744643, -0.15053796676832046, 0.09361334635098702, 0.20753426679362685, 0.11958898001516206, -0.19015490783031208, -0.055066050437498064, 0.03856901263608992, 0.12224613812799423, 0.05817995383700166, -0.05360161796630502, 0.13506900205887223, 0.20098196629284865, 0.043471269962630406, 0.0994305317097746, -0.15596554236155066, -0.02486772744292867, -0.2950381630209326, -0.17358353750196176, -0.10192569178752049, 0.04554634152860302, -0.121995874390342, -0.2002954742880104, 0.4034924426321256, 0.1406747137543635, 0.2177859180275414, 0.0993300694192886, 0.27345827557304403, 0.09279170360562186, 0.07112536997577744, 0.014427250656654459, 0.10571321296768058, 0.07413070418112773, 0.0320715306453028, -0.20574922680063568, 0.15560401812337843, 0.0325213018222712]
|
1,803.08219
|
Large Perpendicular Magnetocrystalline Anisotropy at Fe/Pb(001)
interface
|
Search for ultrathin magnetic film with large perpendicular
magnetocrystalline anisotropy (PMA) has been inspired for years by the
continuous miniaturization of magnetic units in spintronics devices. The common
magnetic materials used in research and applications are based on Fe because
the pure Fe metal is the best yet simple magnetic material from nature. Through
systematic first-principles calculations, we explored the possibility to
produce large PMA with ultrathin Fe on non-noble and non-magnetic Pb(001)
substrate. Interestingly, huge magnetocrystalline anisotropy energy (MAE) of
7.6 meV was found in Pb/Fe/Pb(001) sandwich structure with only half monolayer
Fe. Analysis of electronic structures reveals that the magnetic proximity
effect at the interface is responsible for this significant enhancement of MAE.
The MAE further increases to 13.6 meV with triply repeated capping Pb and
intermediate Fe layers. Furthermore, the MAE can be tuned conveniently by
charge injection.
|
cond-mat.mtrl-sci
|
search for ultrathin magnetic film with large perpendicular magnetocrystalline anisotropy pma has been inspired for years by the continuous miniaturization of magnetic units in spintronics devices the common magnetic materials used in research and applications are based on fe because the pure fe metal is the best yet simple magnetic material from nature through systematic firstprinciples calculations we explored the possibility to produce large pma with ultrathin fe on nonnoble and nonmagnetic pb001 substrate interestingly huge magnetocrystalline anisotropy energy mae of 76 mev was found in pbfepb001 sandwich structure with only half monolayer fe analysis of electronic structures reveals that the magnetic proximity effect at the interface is responsible for this significant enhancement of mae the mae further increases to 136 mev with triply repeated capping pb and intermediate fe layers furthermore the mae can be tuned conveniently by charge injection
|
[['search', 'for', 'ultrathin', 'magnetic', 'film', 'with', 'large', 'perpendicular', 'magnetocrystalline', 'anisotropy', 'pma', 'has', 'been', 'inspired', 'for', 'years', 'by', 'the', 'continuous', 'miniaturization', 'of', 'magnetic', 'units', 'in', 'spintronics', 'devices', 'the', 'common', 'magnetic', 'materials', 'used', 'in', 'research', 'and', 'applications', 'are', 'based', 'on', 'fe', 'because', 'the', 'pure', 'fe', 'metal', 'is', 'the', 'best', 'yet', 'simple', 'magnetic', 'material', 'from', 'nature', 'through', 'systematic', 'firstprinciples', 'calculations', 'we', 'explored', 'the', 'possibility', 'to', 'produce', 'large', 'pma', 'with', 'ultrathin', 'fe', 'on', 'nonnoble', 'and', 'nonmagnetic', 'pb001', 'substrate', 'interestingly', 'huge', 'magnetocrystalline', 'anisotropy', 'energy', 'mae', 'of', '76', 'mev', 'was', 'found', 'in', 'pbfepb001', 'sandwich', 'structure', 'with', 'only', 'half', 'monolayer', 'fe', 'analysis', 'of', 'electronic', 'structures', 'reveals', 'that', 'the', 'magnetic', 'proximity', 'effect', 'at', 'the', 'interface', 'is', 'responsible', 'for', 'this', 'significant', 'enhancement', 'of', 'mae', 'the', 'mae', 'further', 'increases', 'to', '136', 'mev', 'with', 'triply', 'repeated', 'capping', 'pb', 'and', 'intermediate', 'fe', 'layers', 'furthermore', 'the', 'mae', 'can', 'be', 'tuned', 'conveniently', 'by', 'charge', 'injection']]
|
[-0.12077831333878336, 0.16314117263386146, 0.06392940173005994, 0.014457983231982685, -0.08040842333374706, -0.10216432518372648, 0.07722542256120217, 0.48153046668647864, -0.282659212418785, -0.4076875658880035, -0.0415232199195625, -0.31083901905917005, -0.0837505862666227, 0.20675213368468845, 0.06996925122928706, -0.016130876827904646, 0.014508375191136444, -0.09778639041775128, -0.0853443995441424, -0.2049088305609448, 0.22905922146755264, 0.08256612123717158, 0.3652926624062464, 0.12174622618204665, 0.0063507227041162285, -0.028369249824581923, 0.14902716192329746, 0.043436393905565036, -0.1156971132626783, 0.11658581779103913, 0.2348732544886444, -0.15399264313930497, 0.2222300394599011, -0.4757741716918167, -0.18301075694055746, -0.0164677143723389, 0.13675822288538295, 0.1420094084075029, -0.11570485160190264, -0.2532028931816169, 0.13691719645205483, -0.1154438565759886, -0.07855263574996531, -0.10105981016548338, 0.006375669746277787, 0.01557081342145479, -0.22939447659819903, 0.07452234693320481, 0.05271799030140873, 0.1488471198931195, -0.11800081383241358, -0.20037721027452632, -0.12223960885697667, 0.009244539592374893, 0.11187441872764486, 0.07760229806261633, 0.1951766244216199, -0.052429321393698936, -0.10774295033364416, 0.36640490845462187, -0.043369715924461864, -0.06060624120777084, 0.11055028397362117, -0.1499618849199493, -0.08047051156352596, 0.20581975307235187, 0.14312624996745785, 0.09744606282990828, -0.14591422014435915, 0.10641666600127242, 0.05935678979873543, 0.24854130076961392, 0.02094410764549276, 0.03929630328948013, 0.250852947384655, 0.20920715842014112, 0.018047765059825437, 0.12499291991828371, -0.1812929106045434, 0.015478936387493992, -0.16020265068832062, -0.19777235642691954, -0.21944661725064565, 0.09327950340230018, -0.11901042508407372, -0.2078972542859453, 0.35716154867123223, 0.16618973982567303, 0.1378697422885825, -0.16284639668766504, 0.23454623693506493, 0.05669731973744125, 0.12544549206814481, 0.0415710670431312, 0.3174226190710588, 0.1866133671032814, 0.1547366098949699, -0.22914696509427251, 0.15479657221786516, -0.016134792203485643]
|
1,803.0822
|
Matrix Product States for Quantum Stochastic Modelling
|
In stochastic modeling, there has been a significant effort towards finding
predictive models that predict a stochastic process' future using minimal
information from its past. Meanwhile, in condensed matter physics, matrix
product states (MPS) are known as a particularly efficient representation of 1D
spin chains. In this Letter, we associate each stochastic process with a
suitable quantum state of a spin chain. We then show that the optimal
predictive model for the process leads directly to an MPS representation of the
associated quantum state. Conversely, MPS methods offer a systematic
construction of the best known quantum predictive models. This connection
allows an improved method for computing the quantum memory needed for
generating optimal predictions. We prove that this memory coincides with the
entanglement of the associated spin chain across the past-future bipartition.
|
quant-ph cond-mat.stat-mech
|
in stochastic modeling there has been a significant effort towards finding predictive models that predict a stochastic process future using minimal information from its past meanwhile in condensed matter physics matrix product states mps are known as a particularly efficient representation of 1d spin chains in this letter we associate each stochastic process with a suitable quantum state of a spin chain we then show that the optimal predictive model for the process leads directly to an mps representation of the associated quantum state conversely mps methods offer a systematic construction of the best known quantum predictive models this connection allows an improved method for computing the quantum memory needed for generating optimal predictions we prove that this memory coincides with the entanglement of the associated spin chain across the pastfuture bipartition
|
[['in', 'stochastic', 'modeling', 'there', 'has', 'been', 'a', 'significant', 'effort', 'towards', 'finding', 'predictive', 'models', 'that', 'predict', 'a', 'stochastic', 'process', 'future', 'using', 'minimal', 'information', 'from', 'its', 'past', 'meanwhile', 'in', 'condensed', 'matter', 'physics', 'matrix', 'product', 'states', 'mps', 'are', 'known', 'as', 'a', 'particularly', 'efficient', 'representation', 'of', '1d', 'spin', 'chains', 'in', 'this', 'letter', 'we', 'associate', 'each', 'stochastic', 'process', 'with', 'a', 'suitable', 'quantum', 'state', 'of', 'a', 'spin', 'chain', 'we', 'then', 'show', 'that', 'the', 'optimal', 'predictive', 'model', 'for', 'the', 'process', 'leads', 'directly', 'to', 'an', 'mps', 'representation', 'of', 'the', 'associated', 'quantum', 'state', 'conversely', 'mps', 'methods', 'offer', 'a', 'systematic', 'construction', 'of', 'the', 'best', 'known', 'quantum', 'predictive', 'models', 'this', 'connection', 'allows', 'an', 'improved', 'method', 'for', 'computing', 'the', 'quantum', 'memory', 'needed', 'for', 'generating', 'optimal', 'predictions', 'we', 'prove', 'that', 'this', 'memory', 'coincides', 'with', 'the', 'entanglement', 'of', 'the', 'associated', 'spin', 'chain', 'across', 'the', 'pastfuture', 'bipartition']]
|
[-0.09621512467944712, 0.12092505507440143, -0.09933478845226945, 0.06730289895603798, -0.042949179018085655, -0.16274222813080996, 0.06039340480558828, 0.3865221357996096, -0.2938122949280748, -0.26181918187296216, 0.09445752180082226, -0.2391560004767653, -0.15157422053303118, 0.19200892703939285, -0.0268430625979735, 0.10414544290776548, 0.086645424450663, 0.07951022516653845, -0.11155934364598413, -0.1874463397614432, 0.2674573611319912, 0.07122758872256699, 0.29367700819751585, -0.0025003202961560228, 0.13883794862142002, -0.0023571189746937967, -0.016204857929331025, -0.019679356962583508, -0.12056232426750119, 0.16377363610037277, 0.2719926532915424, 0.12591279249031548, 0.2676508382287328, -0.4445483746627967, -0.22838032186877116, 0.1380954384574469, 0.1385021494469115, 0.17811830486453167, -0.06320671948152735, -0.25113314512242196, 0.033774275789090265, -0.24926210519730707, -0.13465912714177233, -0.11522041078282971, -0.0013240977493820317, -0.05578556214900208, -0.2630060559251543, 0.06642855022271926, 0.07468060350793441, -0.007520658676653649, -0.017308732460757408, -0.10645231887588813, 0.0006800168193876743, 0.13011383093103315, -0.01964354781221394, 0.03945297215603094, 0.0946012956097327, -0.15233863182330618, -0.21075514961161057, 0.3267260451279016, -0.06223027283064739, -0.20076069354686435, 0.1681438364603585, -0.07935049972200597, -0.17228861209569554, 0.09957977533904892, 0.1532757846695004, 0.08630047223414294, -0.1651662428321839, 0.10010300652533205, -0.052561720734405695, 0.17402585168989995, -0.027726183564289276, 0.061701294179356686, 0.23465340801825127, 0.20103357632020066, 0.0938070899080203, 0.1651830495490382, -0.05652003556712192, -0.17690384672305576, -0.25681011751294136, -0.2091373416463312, -0.20451244715756425, 0.06876902949156691, -0.10214979846954741, -0.16655502515795612, 0.4144821953395325, 0.18370927417445823, 0.16161123995852628, 0.07528655677059291, 0.25378708171686437, 0.1223292161955738, 0.03615049874254813, 0.07988811050061927, 0.17239172716808476, 0.14833920048620325, 0.058610473039814016, -0.24151953147674882, 0.0991797281048176, 0.025752754275207266]
|
1,803.08221
|
A Topological Approach to Secure Message Dissemination in Vehicular
Networks
|
Secure message dissemination is an important issue in vehicular networks,
especially considering the vulnerability of vehicle to vehicle message
dissemination to malicious attacks. Traditional security mechanisms, largely
based on message encryption and key management, can only guarantee secure
message exchanges between known source and destination pairs. In vehicular
networks however, every vehicle may learn its surrounding environment and
contributes as a source, while in the meantime act as a destination or a relay
of information from other vehicles, message exchanges often occur between
"stranger" vehicles. For secure message dissemination in vehicular networks
against insider attackers, who may tamper the content of the disseminated
messages, ensuring the consistency and integrity of the transmitted messages
becomes a major concern that traditional message encryption and key management
based approaches fall short to provide. In this paper, by incorporating the
underlying network topology information, we propose an optimal decision
algorithm that is able to maximize the chance of making a correct decision on
the message content, assuming the prior knowledge of the percentage of
malicious vehicles in the network. Furthermore, a novel heuristic decision
algorithm is proposed that can make decisions without the aforementioned
knowledge of the percentage of malicious vehicles. Simulations are conducted to
compare the security performance achieved by our proposed decision algorithms
with that achieved by existing ones that do not consider or only partially
consider the topological information, to verify the effectiveness of the
algorithms. Our results show that by incorporating the network topology
information, the security performance can be much improved. This work shed
light on the optimum algorithm design for secure message dissemination.
|
cs.IT cs.CR math.IT
|
secure message dissemination is an important issue in vehicular networks especially considering the vulnerability of vehicle to vehicle message dissemination to malicious attacks traditional security mechanisms largely based on message encryption and key management can only guarantee secure message exchanges between known source and destination pairs in vehicular networks however every vehicle may learn its surrounding environment and contributes as a source while in the meantime act as a destination or a relay of information from other vehicles message exchanges often occur between stranger vehicles for secure message dissemination in vehicular networks against insider attackers who may tamper the content of the disseminated messages ensuring the consistency and integrity of the transmitted messages becomes a major concern that traditional message encryption and key management based approaches fall short to provide in this paper by incorporating the underlying network topology information we propose an optimal decision algorithm that is able to maximize the chance of making a correct decision on the message content assuming the prior knowledge of the percentage of malicious vehicles in the network furthermore a novel heuristic decision algorithm is proposed that can make decisions without the aforementioned knowledge of the percentage of malicious vehicles simulations are conducted to compare the security performance achieved by our proposed decision algorithms with that achieved by existing ones that do not consider or only partially consider the topological information to verify the effectiveness of the algorithms our results show that by incorporating the network topology information the security performance can be much improved this work shed light on the optimum algorithm design for secure message dissemination
|
[['secure', 'message', 'dissemination', 'is', 'an', 'important', 'issue', 'in', 'vehicular', 'networks', 'especially', 'considering', 'the', 'vulnerability', 'of', 'vehicle', 'to', 'vehicle', 'message', 'dissemination', 'to', 'malicious', 'attacks', 'traditional', 'security', 'mechanisms', 'largely', 'based', 'on', 'message', 'encryption', 'and', 'key', 'management', 'can', 'only', 'guarantee', 'secure', 'message', 'exchanges', 'between', 'known', 'source', 'and', 'destination', 'pairs', 'in', 'vehicular', 'networks', 'however', 'every', 'vehicle', 'may', 'learn', 'its', 'surrounding', 'environment', 'and', 'contributes', 'as', 'a', 'source', 'while', 'in', 'the', 'meantime', 'act', 'as', 'a', 'destination', 'or', 'a', 'relay', 'of', 'information', 'from', 'other', 'vehicles', 'message', 'exchanges', 'often', 'occur', 'between', 'stranger', 'vehicles', 'for', 'secure', 'message', 'dissemination', 'in', 'vehicular', 'networks', 'against', 'insider', 'attackers', 'who', 'may', 'tamper', 'the', 'content', 'of', 'the', 'disseminated', 'messages', 'ensuring', 'the', 'consistency', 'and', 'integrity', 'of', 'the', 'transmitted', 'messages', 'becomes', 'a', 'major', 'concern', 'that', 'traditional', 'message', 'encryption', 'and', 'key', 'management', 'based', 'approaches', 'fall', 'short', 'to', 'provide', 'in', 'this', 'paper', 'by', 'incorporating', 'the', 'underlying', 'network', 'topology', 'information', 'we', 'propose', 'an', 'optimal', 'decision', 'algorithm', 'that', 'is', 'able', 'to', 'maximize', 'the', 'chance', 'of', 'making', 'a', 'correct', 'decision', 'on', 'the', 'message', 'content', 'assuming', 'the', 'prior', 'knowledge', 'of', 'the', 'percentage', 'of', 'malicious', 'vehicles', 'in', 'the', 'network', 'furthermore', 'a', 'novel', 'heuristic', 'decision', 'algorithm', 'is', 'proposed', 'that', 'can', 'make', 'decisions', 'without', 'the', 'aforementioned', 'knowledge', 'of', 'the', 'percentage', 'of', 'malicious', 'vehicles', 'simulations', 'are', 'conducted', 'to', 'compare', 'the', 'security', 'performance', 'achieved', 'by', 'our', 'proposed', 'decision', 'algorithms', 'with', 'that', 'achieved', 'by', 'existing', 'ones', 'that', 'do', 'not', 'consider', 'or', 'only', 'partially', 'consider', 'the', 'topological', 'information', 'to', 'verify', 'the', 'effectiveness', 'of', 'the', 'algorithms', 'our', 'results', 'show', 'that', 'by', 'incorporating', 'the', 'network', 'topology', 'information', 'the', 'security', 'performance', 'can', 'be', 'much', 'improved', 'this', 'work', 'shed', 'light', 'on', 'the', 'optimum', 'algorithm', 'design', 'for', 'secure', 'message', 'dissemination']]
|
[-0.21430044270401716, -0.014477182178700976, -0.05744890834222425, 0.062007773270443926, -0.11333465736166065, -0.260011782864425, 0.16517549201468323, 0.4059475382034368, -0.2725943701640474, -0.305940698621408, 0.12001342616957736, -0.2774806031693687, -0.16712441341160744, 0.13965435989051705, -0.18656358282380509, 0.07610748708489755, 0.06493221361954468, 0.07867075399822943, 0.03445319719436877, -0.3187850710101215, 0.2975193584706845, 0.08531389984671238, 0.3501378195931397, 0.0839600266502151, 0.07983657100396055, 0.05288369237392578, -0.05512442006553822, -0.0635377450966944, -0.05471335421837998, 0.11442678348547868, 0.35471441586027447, 0.26139299505618663, 0.3258020809588005, -0.45028747569820143, -0.2442013817909613, 0.09139900933819349, 0.1748729026032928, 0.11326934987204676, -0.041594449746563046, -0.3585097832113223, 0.13583989824027806, -0.2268112193336183, -0.03845220817580274, -0.03753228553412658, -0.07428341650289817, 0.03613986644612731, -0.25595977929122044, -0.04867699571779736, 0.025176052157854976, 0.02491460382094923, 0.013015132482198752, -0.04240510067990366, -0.020809221652529714, 0.23166236471042106, 0.06893957398902133, 0.010042465919242153, 0.18135099910739985, -0.148805846231726, -0.18511320219709063, 0.38632219159044323, 0.020718017129122086, -0.18274289119707526, 0.12704245435196976, 0.03529068129664322, -0.11014496548690796, 0.139630988806943, 0.2558235630217307, 0.061865806851957764, -0.2023333791081073, -0.03048933822033435, -0.01940195329645473, 0.22324706276984146, 0.0543575230572935, 0.0719813808377059, 0.16288760613940023, 0.18756362532775075, 0.13273885324333776, 0.09138577365610784, -0.06487533469543845, -0.12750538156350266, -0.20198139065068285, -0.1369472538147403, -0.2071022551102599, 0.007268493897600082, -0.11377885862454587, -0.08201085098536975, 0.3432328987163755, 0.24166194335030355, 0.12186475801018049, 0.08812358079583578, 0.4228833165863213, -0.010534727982825266, 0.05268254568404957, 0.20977697588925093, 0.20645169014998555, 0.02754266358327718, 0.14960198280366382, -0.15311815709903626, 0.24140413955890766, 0.010950725602934945]
|
1,803.08222
|
Sparse Convolution-based Markov Models for Nonlinear Fluid Flows
|
Data-driven modeling for nonlinear fluid flows using sparse convolution-based
mapping into a feature space where the dynamics are Markov linear is explored
in this article. The underlying principle of low-order models for fluid systems
is identifying convolutions to a feature space where the system evolution (a)
is simpler and efficient to model and (b) the predictions can be reconstructed
accurately through deconvolution. Such methods are useful when real-time models
from sensor data are needed for online decision making. The Markov linear
approximation is popular as it allows us to leverage the vast linear systems
machinery. Examples include the Koopman operator approximation techniques and
evolutionary kernel methods in machine learning. The success of these models in
approximating nonlinear dynamical systems is tied to the effectiveness of the
convolution map in accomplishing both (a) and (b) mentioned above. To assess
this, we perform in-depth study of two classes of sparse convolution operators:
(i) a pure data-driven POD-convolution that uses left singular vectors of the
data snapshots - a staple of Koopman approximation methods and (ii) a sparse
Gaussian Process (sGP) convolution that combines sparse sampling with a
Gaussian kernel embedding an implicit feature map to an inner product
reproducing kernel Hilbert space.
|
physics.flu-dyn
|
datadriven modeling for nonlinear fluid flows using sparse convolutionbased mapping into a feature space where the dynamics are markov linear is explored in this article the underlying principle of loworder models for fluid systems is identifying convolutions to a feature space where the system evolution a is simpler and efficient to model and b the predictions can be reconstructed accurately through deconvolution such methods are useful when realtime models from sensor data are needed for online decision making the markov linear approximation is popular as it allows us to leverage the vast linear systems machinery examples include the koopman operator approximation techniques and evolutionary kernel methods in machine learning the success of these models in approximating nonlinear dynamical systems is tied to the effectiveness of the convolution map in accomplishing both a and b mentioned above to assess this we perform indepth study of two classes of sparse convolution operators i a pure datadriven podconvolution that uses left singular vectors of the data snapshots a staple of koopman approximation methods and ii a sparse gaussian process sgp convolution that combines sparse sampling with a gaussian kernel embedding an implicit feature map to an inner product reproducing kernel hilbert space
|
[['datadriven', 'modeling', 'for', 'nonlinear', 'fluid', 'flows', 'using', 'sparse', 'convolutionbased', 'mapping', 'into', 'a', 'feature', 'space', 'where', 'the', 'dynamics', 'are', 'markov', 'linear', 'is', 'explored', 'in', 'this', 'article', 'the', 'underlying', 'principle', 'of', 'loworder', 'models', 'for', 'fluid', 'systems', 'is', 'identifying', 'convolutions', 'to', 'a', 'feature', 'space', 'where', 'the', 'system', 'evolution', 'a', 'is', 'simpler', 'and', 'efficient', 'to', 'model', 'and', 'b', 'the', 'predictions', 'can', 'be', 'reconstructed', 'accurately', 'through', 'deconvolution', 'such', 'methods', 'are', 'useful', 'when', 'realtime', 'models', 'from', 'sensor', 'data', 'are', 'needed', 'for', 'online', 'decision', 'making', 'the', 'markov', 'linear', 'approximation', 'is', 'popular', 'as', 'it', 'allows', 'us', 'to', 'leverage', 'the', 'vast', 'linear', 'systems', 'machinery', 'examples', 'include', 'the', 'koopman', 'operator', 'approximation', 'techniques', 'and', 'evolutionary', 'kernel', 'methods', 'in', 'machine', 'learning', 'the', 'success', 'of', 'these', 'models', 'in', 'approximating', 'nonlinear', 'dynamical', 'systems', 'is', 'tied', 'to', 'the', 'effectiveness', 'of', 'the', 'convolution', 'map', 'in', 'accomplishing', 'both', 'a', 'and', 'b', 'mentioned', 'above', 'to', 'assess', 'this', 'we', 'perform', 'indepth', 'study', 'of', 'two', 'classes', 'of', 'sparse', 'convolution', 'operators', 'i', 'a', 'pure', 'datadriven', 'podconvolution', 'that', 'uses', 'left', 'singular', 'vectors', 'of', 'the', 'data', 'snapshots', 'a', 'staple', 'of', 'koopman', 'approximation', 'methods', 'and', 'ii', 'a', 'sparse', 'gaussian', 'process', 'sgp', 'convolution', 'that', 'combines', 'sparse', 'sampling', 'with', 'a', 'gaussian', 'kernel', 'embedding', 'an', 'implicit', 'feature', 'map', 'to', 'an', 'inner', 'product', 'reproducing', 'kernel', 'hilbert', 'space']]
|
[-0.031207452269477978, 0.039564170232754096, -0.09883611180673758, 0.10094355051663143, -0.11212543514909956, -0.14248877813812638, -0.005741196053074391, 0.4077942272944545, -0.3467289419524898, -0.22342829421313123, 0.13574169088032148, -0.25238112667512275, -0.1864448816614282, 0.18160524212807003, -0.061421100348892685, 0.1387744943112737, 0.10218505771134538, 0.005404434057488812, -0.09577397950172349, -0.20405296697939812, 0.33520692871939956, 0.057077158529386676, 0.2604517865164036, -0.06786764054817872, 0.14381108346343455, 0.011581442329439928, -0.0899690294478352, -0.02402840360027216, -0.0675769018746749, 0.1703045729199669, 0.3201078912867767, 0.17534509440883994, 0.3342201886228239, -0.3916978740857707, -0.2423054572298295, 0.12272120366399789, 0.14306375712410294, 0.07920456394515556, 0.013084291414630533, -0.2842794908163599, 0.05479284555467805, -0.1601277243703453, -0.050261194055730644, -0.16940265777756017, -0.0212221643675796, 0.005000444779388907, -0.3510793256749766, 0.050825047240865354, 0.08849736665404341, 0.03761773415655368, -0.05493891681691472, -0.09676570828293798, 0.02930713614985121, 0.11198983650205944, -0.020690342940118473, 0.02540064683405099, 0.12757178357225546, -0.1372668076555875, -0.11787780476828115, 0.3527613157333543, -0.07688026064848104, -0.24836089814580375, 0.20923059918880085, -0.07282033000221344, -0.15264577078844674, 0.12694141454112745, 0.22819398794584259, 0.10843936315351965, -0.169160096463762, 0.1141017246588646, -0.041070209627952235, 0.13637481581518482, -0.011163406765483545, -0.018776473549260486, 0.13636742958874262, 0.20745782783805308, 0.06658348994037945, 0.10971308748662294, -0.07556417860523468, -0.1267370979978957, -0.25309330078236986, -0.13713654153980315, -0.19681945388943822, -0.017623472162122567, -0.12845126306718965, -0.19686567233499103, 0.3938807184182371, 0.16254647060137506, 0.20669234601540887, 0.0653747376301467, 0.32288842414849145, 0.1340466409708806, 0.05707863277127741, 0.10587916852943975, 0.16248998288100472, 0.1586197176195606, 0.07901791133447503, -0.16551798407865612, 0.05428984375656441, 0.11890887698356176]
|
1,803.08223
|
Goos-H\"anchen shifts due to 2D materials with complex conductivity
|
We investigate theoretically the Goos-H\"anchen (GH) shift of a p-polarized
terahertz beam incident on a 2D material surface with complex conductivity.
Taking monolayer graphene to be the model material, we determine the dependence
of GH shifts on the Fermi level and incident frequency. Both spatial and
angular GH shifts are present. For both GH shifts in general, we find that
increasing the Fermi level shifts the incident angle at which the maximum GH
shifts arise. Moreover, we see that at higher frequencies, the amount of beam
shift decreases with the Fermi level when the incident frequency is changed. At
lower frequencies, however, the shift becomes proportional with the Fermi
level. Upon obtaining the measurable shifts, the angular GH shift dominates the
spatial GH shift given appropriate experimental parameters. Our results may
pave the way for these material's use in optoelectronics devices, and
fundamentally, to determine properties of 2D materials with complex
conductivity.
|
physics.optics cond-mat.mtrl-sci
|
we investigate theoretically the gooshanchen gh shift of a ppolarized terahertz beam incident on a 2d material surface with complex conductivity taking monolayer graphene to be the model material we determine the dependence of gh shifts on the fermi level and incident frequency both spatial and angular gh shifts are present for both gh shifts in general we find that increasing the fermi level shifts the incident angle at which the maximum gh shifts arise moreover we see that at higher frequencies the amount of beam shift decreases with the fermi level when the incident frequency is changed at lower frequencies however the shift becomes proportional with the fermi level upon obtaining the measurable shifts the angular gh shift dominates the spatial gh shift given appropriate experimental parameters our results may pave the way for these materials use in optoelectronics devices and fundamentally to determine properties of 2d materials with complex conductivity
|
[['we', 'investigate', 'theoretically', 'the', 'gooshanchen', 'gh', 'shift', 'of', 'a', 'ppolarized', 'terahertz', 'beam', 'incident', 'on', 'a', '2d', 'material', 'surface', 'with', 'complex', 'conductivity', 'taking', 'monolayer', 'graphene', 'to', 'be', 'the', 'model', 'material', 'we', 'determine', 'the', 'dependence', 'of', 'gh', 'shifts', 'on', 'the', 'fermi', 'level', 'and', 'incident', 'frequency', 'both', 'spatial', 'and', 'angular', 'gh', 'shifts', 'are', 'present', 'for', 'both', 'gh', 'shifts', 'in', 'general', 'we', 'find', 'that', 'increasing', 'the', 'fermi', 'level', 'shifts', 'the', 'incident', 'angle', 'at', 'which', 'the', 'maximum', 'gh', 'shifts', 'arise', 'moreover', 'we', 'see', 'that', 'at', 'higher', 'frequencies', 'the', 'amount', 'of', 'beam', 'shift', 'decreases', 'with', 'the', 'fermi', 'level', 'when', 'the', 'incident', 'frequency', 'is', 'changed', 'at', 'lower', 'frequencies', 'however', 'the', 'shift', 'becomes', 'proportional', 'with', 'the', 'fermi', 'level', 'upon', 'obtaining', 'the', 'measurable', 'shifts', 'the', 'angular', 'gh', 'shift', 'dominates', 'the', 'spatial', 'gh', 'shift', 'given', 'appropriate', 'experimental', 'parameters', 'our', 'results', 'may', 'pave', 'the', 'way', 'for', 'these', 'materials', 'use', 'in', 'optoelectronics', 'devices', 'and', 'fundamentally', 'to', 'determine', 'properties', 'of', '2d', 'materials', 'with', 'complex', 'conductivity']]
|
[-0.1638525930251681, 0.2480215900240613, -0.03642251397372762, 0.014431566428883295, -0.10258364278553544, -0.10851588427995969, 0.07823974746861495, 0.48465777176285263, -0.2737550919164756, -0.2704966204106121, -0.012276798911012807, -0.3130053525275894, -0.12471438163744383, 0.22542382604871436, 0.006949074241626812, -0.007794590918102155, 0.028922824905940184, -0.00981666254320819, -0.1163647103331689, -0.12746913046698624, 0.3299375218461807, 0.08784096551397325, 0.34756710695862575, 0.10322323909617569, 0.06746108931685357, 0.021016876691168074, 0.03816053216455897, 0.007769563664241056, -0.14986727720689055, 0.11183951166458428, 0.24287269818351456, -0.060554647611417364, 0.1564962840315466, -0.3513058134305634, -0.24284470409743095, 0.07144848547422473, 0.08357989163931434, 0.13675347932133408, -0.04013915957368322, -0.25922057468836246, -0.006055716474197413, -0.10387721578866292, -0.15698141036055427, -0.01624183454029997, 0.053336307375789864, 0.009375981939803367, -0.18734255343013884, 0.058972135020763074, 0.02199960198241139, 0.06473499027503606, -0.085145532010804, -0.17377662825578896, -0.08971804124762696, 0.10131039049137096, -0.004216263653545052, 0.021886986481963265, 0.1604651739012058, -0.1046809564937384, -0.04664280116680617, 0.4453926521206373, -0.08620280525830917, -0.165654352755825, 0.10895119511712294, -0.26991980024582807, -0.04307340886627667, 0.1808338825266171, 0.1745535383111258, 0.07808301822852197, -0.017643507009875305, 0.07208618656065817, 0.02770359060530992, 0.16699185877683034, 0.1545802713708805, 0.08202998003176426, 0.23404081177125735, 0.13075733442919477, 0.12855336286960856, 0.10900764247650697, -0.13095116574550048, 0.03912731501776235, -0.2602974287246501, -0.11142318947914694, -0.17126779145818496, 0.02861801488478178, -0.05163182680294803, -0.14947512210346758, 0.4131057165734666, 0.14462746911771032, 0.21935457453793406, 0.017081089618793493, 0.27431597753035786, 0.22375169999079508, 0.0764185423521619, 0.028337177443685697, 0.2637378688423747, 0.12777381104502925, 0.08810388084844147, -0.29024668218335137, 0.019284304954405678, -0.017965703105897103]
|
1,803.08224
|
Ulam Floating Body
|
We study a new construction of bodies from a given convex body in
$\mathbb{R}^{n}$ which are isomorphic to (weighted) floating bodies. We
establish several properties of this new construction, including its relation
to $p$-affine surface areas. We show that these bodies are related to Ulam's
long-standing floating body problem which asks whether Euclidean balls are the
only bodies that can float, without turning, in any orientation.
|
math.MG
|
we study a new construction of bodies from a given convex body in mathbbrn which are isomorphic to weighted floating bodies we establish several properties of this new construction including its relation to paffine surface areas we show that these bodies are related to ulams longstanding floating body problem which asks whether euclidean balls are the only bodies that can float without turning in any orientation
|
[['we', 'study', 'a', 'new', 'construction', 'of', 'bodies', 'from', 'a', 'given', 'convex', 'body', 'in', 'mathbbrn', 'which', 'are', 'isomorphic', 'to', 'weighted', 'floating', 'bodies', 'we', 'establish', 'several', 'properties', 'of', 'this', 'new', 'construction', 'including', 'its', 'relation', 'to', 'paffine', 'surface', 'areas', 'we', 'show', 'that', 'these', 'bodies', 'are', 'related', 'to', 'ulams', 'longstanding', 'floating', 'body', 'problem', 'which', 'asks', 'whether', 'euclidean', 'balls', 'are', 'the', 'only', 'bodies', 'that', 'can', 'float', 'without', 'turning', 'in', 'any', 'orientation']]
|
[-0.1271683108061552, 0.11451507490974935, -0.09281417877046448, 0.03474327021853462, -0.11187944750329762, -0.09818036395661307, 0.042287408458915626, 0.33825991830478114, -0.332376700628436, -0.2623005645406066, 0.13418030904281433, -0.3097336265879373, -0.209363504990258, 0.22433004614360857, -0.2281084958548573, 0.07733368829764059, 0.07338961264626546, 0.01455577290758039, -0.10819826497357678, -0.25084407221716404, 0.33943871250658325, -0.09611573021604934, 0.13820055171240572, 0.08056298061979539, 0.0653503194987548, -0.001782745641762493, 0.04042641009966081, 0.07610174841388609, -0.17891136963722107, 0.19198517182270403, 0.24107208828244245, 0.1534900010111883, 0.23094928757266395, -0.4528942981904203, -0.201044972836936, 0.1749798217435565, 0.0807273993833047, 0.0684589490005182, -0.06341974957930771, -0.23672636841056924, 0.11532595273897503, -0.09549635389085973, -0.18144631227760605, -0.03496179857051395, 0.0670613685171261, 0.031105478093112735, -0.20499248839350362, 0.017416840355673976, 0.11837247143160891, 0.048693781958497835, -0.13180200484136798, -0.12488839442305492, 0.01903845086891317, 0.15421971640634266, 0.05158112741385897, 0.0781877197670948, 0.15420161498089632, -0.06280900366872436, -0.10871566269744301, 0.43397172410605533, 0.0288868995072941, -0.27765227907873463, 0.23837870794037977, -0.19426436691234508, -0.0977314436370789, 0.08083489416590468, 0.23192738178609448, 0.15940858213456743, -0.1657126134501375, 0.08811511318058227, -0.14312538490489576, 0.1267868774576169, 0.15106357380776017, -0.030456679689726145, 0.25627618872871, 0.09866683058102023, 0.13616820366234716, 0.18342577869241888, -0.048201991358038154, -0.10278587000952526, -0.3330088724015337, -0.18680202054427797, -0.18375537308836074, 0.03474376028911634, -0.06754843528721143, -0.20871954761484326, 0.2918153794228353, 0.08626980446702377, 0.18429114916150205, 0.06781632927683831, 0.22938415207758997, 0.004534132171873794, 0.06813045528322233, 0.09908593951188253, 0.2047569379951297, 0.08833149122074246, -0.02401184718209234, -0.1550790198803456, 0.012316831387579441, 0.1277703111285739]
|
1,803.08225
|
PersonLab: Person Pose Estimation and Instance Segmentation with a
Bottom-Up, Part-Based, Geometric Embedding Model
|
We present a box-free bottom-up approach for the tasks of pose estimation and
instance segmentation of people in multi-person images using an efficient
single-shot model. The proposed PersonLab model tackles both semantic-level
reasoning and object-part associations using part-based modeling. Our model
employs a convolutional network which learns to detect individual keypoints and
predict their relative displacements, allowing us to group keypoints into
person pose instances. Further, we propose a part-induced geometric embedding
descriptor which allows us to associate semantic person pixels with their
corresponding person instance, delivering instance-level person segmentations.
Our system is based on a fully-convolutional architecture and allows for
efficient inference, with runtime essentially independent of the number of
people present in the scene. Trained on COCO data alone, our system achieves
COCO test-dev keypoint average precision of 0.665 using single-scale inference
and 0.687 using multi-scale inference, significantly outperforming all previous
bottom-up pose estimation systems. We are also the first bottom-up method to
report competitive results for the person class in the COCO instance
segmentation task, achieving a person category average precision of 0.417.
|
cs.CV
|
we present a boxfree bottomup approach for the tasks of pose estimation and instance segmentation of people in multiperson images using an efficient singleshot model the proposed personlab model tackles both semanticlevel reasoning and objectpart associations using partbased modeling our model employs a convolutional network which learns to detect individual keypoints and predict their relative displacements allowing us to group keypoints into person pose instances further we propose a partinduced geometric embedding descriptor which allows us to associate semantic person pixels with their corresponding person instance delivering instancelevel person segmentations our system is based on a fullyconvolutional architecture and allows for efficient inference with runtime essentially independent of the number of people present in the scene trained on coco data alone our system achieves coco testdev keypoint average precision of 0665 using singlescale inference and 0687 using multiscale inference significantly outperforming all previous bottomup pose estimation systems we are also the first bottomup method to report competitive results for the person class in the coco instance segmentation task achieving a person category average precision of 0417
|
[['we', 'present', 'a', 'boxfree', 'bottomup', 'approach', 'for', 'the', 'tasks', 'of', 'pose', 'estimation', 'and', 'instance', 'segmentation', 'of', 'people', 'in', 'multiperson', 'images', 'using', 'an', 'efficient', 'singleshot', 'model', 'the', 'proposed', 'personlab', 'model', 'tackles', 'both', 'semanticlevel', 'reasoning', 'and', 'objectpart', 'associations', 'using', 'partbased', 'modeling', 'our', 'model', 'employs', 'a', 'convolutional', 'network', 'which', 'learns', 'to', 'detect', 'individual', 'keypoints', 'and', 'predict', 'their', 'relative', 'displacements', 'allowing', 'us', 'to', 'group', 'keypoints', 'into', 'person', 'pose', 'instances', 'further', 'we', 'propose', 'a', 'partinduced', 'geometric', 'embedding', 'descriptor', 'which', 'allows', 'us', 'to', 'associate', 'semantic', 'person', 'pixels', 'with', 'their', 'corresponding', 'person', 'instance', 'delivering', 'instancelevel', 'person', 'segmentations', 'our', 'system', 'is', 'based', 'on', 'a', 'fullyconvolutional', 'architecture', 'and', 'allows', 'for', 'efficient', 'inference', 'with', 'runtime', 'essentially', 'independent', 'of', 'the', 'number', 'of', 'people', 'present', 'in', 'the', 'scene', 'trained', 'on', 'coco', 'data', 'alone', 'our', 'system', 'achieves', 'coco', 'testdev', 'keypoint', 'average', 'precision', 'of', '0665', 'using', 'singlescale', 'inference', 'and', '0687', 'using', 'multiscale', 'inference', 'significantly', 'outperforming', 'all', 'previous', 'bottomup', 'pose', 'estimation', 'systems', 'we', 'are', 'also', 'the', 'first', 'bottomup', 'method', 'to', 'report', 'competitive', 'results', 'for', 'the', 'person', 'class', 'in', 'the', 'coco', 'instance', 'segmentation', 'task', 'achieving', 'a', 'person', 'category', 'average', 'precision', 'of', '0417']]
|
[-0.022946770951815347, -0.06736704380097705, -0.09004277407293977, 0.014862719045096007, -0.12821158810890135, -0.22243018983190374, 0.044638228286434545, 0.4758694785394076, -0.21025018368287798, -0.4014363696824253, 0.014603769084347164, -0.2517742215081406, -0.14760814190336174, 0.16952165700845162, -0.20010383148015493, 0.1067171083693258, 0.19292210461369935, 0.066358676890848, -0.0525370718564063, -0.27266784425221946, 0.2564271474849282, 0.007499172750623584, 0.33019794346064846, -0.003513963639364723, 0.2022450313872437, 0.00898269734801617, -0.05038196875073145, -0.015432138015473036, -0.04442011279752478, 0.24242903998476922, 0.30786889147637897, 0.21095564931046826, 0.27899449529204345, -0.3743410086036509, -0.17445591766039997, 0.05330317366243787, 0.1263968564860652, 0.12303405506347946, -0.010752793222482753, -0.44502361101028376, 0.08315270762578342, -0.17326960778348363, 0.06958598113279639, -0.15279203351866993, -0.026476072687844104, -0.08906712185462258, -0.324947035166225, 0.09865404629653907, 0.04660126509575067, 0.04797179654046807, -0.06866502027751371, -0.09641290758803724, 0.046540478969832634, 0.23989168879430675, -0.035688397736353204, 0.06187414186010729, 0.17795196845905445, -0.22756037576866978, -0.14870672520099348, 0.3796098964353431, -0.04214060355268548, -0.20856192413006905, 0.18270693026682244, -0.022514837847839544, -0.16998111793900586, 0.10467731834771489, 0.2256114300867984, 0.18046040634888444, -0.1508125235660357, -0.037348550122912244, -0.09938568507746465, 0.226498560872295, 0.045511893252438373, -0.04180873794793394, 0.20156459795039233, 0.2983563794819046, 0.052778574557318166, 0.12520161790993992, -0.23515046597996758, -0.0422902078518504, -0.1878613468819443, -0.12031887368046049, -0.14680285149488081, -0.070852735249401, -0.14141484377648333, -0.1430091159983479, 0.4303145150013397, 0.31657110361350066, 0.20951062426606268, 0.1841554734357929, 0.32760945002069275, -0.026791283935496873, 0.08723539586927247, 0.08739182469199513, 0.14024328616396606, -0.027817126874935764, 0.09441725609486255, -0.16807454728556398, 0.09835440487159428, 0.14023906783055448]
|
1,803.08226
|
Vanishing pseudogap around $(\pi,0)$ in an electron-doped
high-$\mathrm{T_{c}}$ superconductor: a simple picture
|
Recent ARPES measurement on electron-doped cuprate
$\mathrm{Pr}_{1.3-x}\mathrm{La}_{0.7}\mathrm{Ce}_{x}\mathrm{CuO}_{4}$ finds
that the pseudogap along the boundary of the antiferromagnetic Brillouin
zone(AFBZ) exhibits dramatic momentum dependence. In particular, the pseudogap
vanishes in a finite region around the anti-nodal point, in which a single
broadened peak emerges at the un-renormalized quasiparticle energy. Such an
observation is argued to be inconsistent with the antiferromagnetic(AFM)
band-folding picture, which predicts a constant pseudogap along the AFBZ
boundary. On the other hand, it is claimed that the experimental results are
consistent with the prediction of the cluster dynamical mean field
theory(CDMFT) simulation on the Hubbard model, in which the pseudogap is
interpreted as a s-wave splitting between the Hubbard bands and the in-gap
states. Here we show that the observed momentum dependence of the pseudogap is
indeed consistent with AFM band-folding picture, provided that we assume the
existence of a strongly momentum dependent quasiparticle scattering rate. More
specifically, we show that the quasiparticle scattering rate acts to reduce the
spectral gap induced by AFM band-folding effect. The new quasiparticle poles
corresponding to the AF-split bands can even be totally eliminated when the
scattering rate exceeds the bare band folding gap, leaving the system with a
single pole at the un-renormalized quasiparticle energy. We predict that the
pseudogap should close in a square root fashion as we move toward $(\pi,0)$
along the AFBZ boundary. Our results illustrates again that the quasiparticle
scattering rate can play a much more profound role than simply broadening the
quasiparticle peak in the quasiparticle dynamics of strongly correlated
electron systems.
|
cond-mat.str-el cond-mat.supr-con
|
recent arpes measurement on electrondoped cuprate mathrmpr_13xmathrmla_07mathrmce_xmathrmcuo_4 finds that the pseudogap along the boundary of the antiferromagnetic brillouin zoneafbz exhibits dramatic momentum dependence in particular the pseudogap vanishes in a finite region around the antinodal point in which a single broadened peak emerges at the unrenormalized quasiparticle energy such an observation is argued to be inconsistent with the antiferromagneticafm bandfolding picture which predicts a constant pseudogap along the afbz boundary on the other hand it is claimed that the experimental results are consistent with the prediction of the cluster dynamical mean field theorycdmft simulation on the hubbard model in which the pseudogap is interpreted as a swave splitting between the hubbard bands and the ingap states here we show that the observed momentum dependence of the pseudogap is indeed consistent with afm bandfolding picture provided that we assume the existence of a strongly momentum dependent quasiparticle scattering rate more specifically we show that the quasiparticle scattering rate acts to reduce the spectral gap induced by afm bandfolding effect the new quasiparticle poles corresponding to the afsplit bands can even be totally eliminated when the scattering rate exceeds the bare band folding gap leaving the system with a single pole at the unrenormalized quasiparticle energy we predict that the pseudogap should close in a square root fashion as we move toward pi0 along the afbz boundary our results illustrates again that the quasiparticle scattering rate can play a much more profound role than simply broadening the quasiparticle peak in the quasiparticle dynamics of strongly correlated electron systems
|
[['recent', 'arpes', 'measurement', 'on', 'electrondoped', 'cuprate', 'mathrmpr_13xmathrmla_07mathrmce_xmathrmcuo_4', 'finds', 'that', 'the', 'pseudogap', 'along', 'the', 'boundary', 'of', 'the', 'antiferromagnetic', 'brillouin', 'zoneafbz', 'exhibits', 'dramatic', 'momentum', 'dependence', 'in', 'particular', 'the', 'pseudogap', 'vanishes', 'in', 'a', 'finite', 'region', 'around', 'the', 'antinodal', 'point', 'in', 'which', 'a', 'single', 'broadened', 'peak', 'emerges', 'at', 'the', 'unrenormalized', 'quasiparticle', 'energy', 'such', 'an', 'observation', 'is', 'argued', 'to', 'be', 'inconsistent', 'with', 'the', 'antiferromagneticafm', 'bandfolding', 'picture', 'which', 'predicts', 'a', 'constant', 'pseudogap', 'along', 'the', 'afbz', 'boundary', 'on', 'the', 'other', 'hand', 'it', 'is', 'claimed', 'that', 'the', 'experimental', 'results', 'are', 'consistent', 'with', 'the', 'prediction', 'of', 'the', 'cluster', 'dynamical', 'mean', 'field', 'theorycdmft', 'simulation', 'on', 'the', 'hubbard', 'model', 'in', 'which', 'the', 'pseudogap', 'is', 'interpreted', 'as', 'a', 'swave', 'splitting', 'between', 'the', 'hubbard', 'bands', 'and', 'the', 'ingap', 'states', 'here', 'we', 'show', 'that', 'the', 'observed', 'momentum', 'dependence', 'of', 'the', 'pseudogap', 'is', 'indeed', 'consistent', 'with', 'afm', 'bandfolding', 'picture', 'provided', 'that', 'we', 'assume', 'the', 'existence', 'of', 'a', 'strongly', 'momentum', 'dependent', 'quasiparticle', 'scattering', 'rate', 'more', 'specifically', 'we', 'show', 'that', 'the', 'quasiparticle', 'scattering', 'rate', 'acts', 'to', 'reduce', 'the', 'spectral', 'gap', 'induced', 'by', 'afm', 'bandfolding', 'effect', 'the', 'new', 'quasiparticle', 'poles', 'corresponding', 'to', 'the', 'afsplit', 'bands', 'can', 'even', 'be', 'totally', 'eliminated', 'when', 'the', 'scattering', 'rate', 'exceeds', 'the', 'bare', 'band', 'folding', 'gap', 'leaving', 'the', 'system', 'with', 'a', 'single', 'pole', 'at', 'the', 'unrenormalized', 'quasiparticle', 'energy', 'we', 'predict', 'that', 'the', 'pseudogap', 'should', 'close', 'in', 'a', 'square', 'root', 'fashion', 'as', 'we', 'move', 'toward', 'pi0', 'along', 'the', 'afbz', 'boundary', 'our', 'results', 'illustrates', 'again', 'that', 'the', 'quasiparticle', 'scattering', 'rate', 'can', 'play', 'a', 'much', 'more', 'profound', 'role', 'than', 'simply', 'broadening', 'the', 'quasiparticle', 'peak', 'in', 'the', 'quasiparticle', 'dynamics', 'of', 'strongly', 'correlated', 'electron', 'systems']]
|
[-0.16922099427560286, 0.20882615367176302, -0.1206749649247199, 0.09874714305624366, -0.06526766328366533, -0.12327373107860146, 0.10414602979186124, 0.36371012808873304, -0.26091176742643474, -0.22414195173538276, -0.03164246536820544, -0.3520560816063413, -0.1098741980903368, 0.16170839285052988, 0.015104570115490499, -0.016052175438888962, 0.024998588641802412, 0.026392281923021767, -0.12030749546922004, -0.19025958741373855, 0.34842931972548646, 0.06793122777404885, 0.2975941054996044, 0.12906957588145612, 0.012507225883873327, 0.05308698587182407, 0.07786906009451264, 0.0065096807980259495, -0.13164629537569122, 0.027364246566393708, 0.26588650731488117, -0.08004093143602996, 0.2005454039178966, -0.38275111873545464, -0.22899292545399577, 0.019586702904826593, 0.19697899092358376, 0.13447842863850326, -0.03705540135082889, -0.27196702928031014, 0.03327971027927503, -0.1489583062052372, -0.15173486899145663, -0.04636121108954299, -0.04129718984006017, -0.05141657045377152, -0.21533518932050183, 0.15039185103812505, 0.0430341188361386, 0.032061778962434756, -0.11230118330180024, -0.1258177836111466, -0.091503855791719, 0.03212567264829034, 0.06962189472202833, 0.10527554074568408, 0.13948904408792417, -0.10999335088057532, -0.08800953687473555, 0.34583778077337357, -0.0796594594511488, -0.09277303233033135, 0.14397702422658248, -0.22010328139304108, -0.06532951203703377, 0.19316693609358654, 0.054231690218864335, 0.049366749933041215, -0.09280714862971864, 0.0700114852402799, -0.06432356281411125, 0.18183562642442422, 0.037727255548816174, 0.09191865407277845, 0.24188119656173512, 0.1818617532188664, 0.07714680309540459, 0.08754093635070603, -0.14792901678343437, -0.10126046640687578, -0.29055863428520895, -0.10592311464406232, -0.22401953845964892, 0.036794388025656294, -0.05268653871029355, -0.18467329024145054, 0.39058952777838657, 0.1431763973225662, 0.25970008499765146, -0.017003263707645978, 0.230367501436304, 0.1825277799211945, 0.09113988456443795, 0.10281302538397352, 0.24871346358919427, 0.10622134947380613, 0.09181656134832236, -0.32960322988912505, 0.05920692058226985, 0.006351254887819764]
|
1,803.08227
|
Giant Magnetoresistance in Hubbard Chains
|
We use numerically unbiased methods to show that the one-dimensional Hubbard
model with periodically distributed on-site interactions already contains the
minimal ingredients to display the phenomenon of magnetoresistance; i.e., by
applying an external magnetic field, a dramatic enhancement on the charge
transport is achieved. We reach this conclusion based on the computation of the
Drude weight and of the single-particle density of states, applying twisted
boundary condition averaging to reduce finite-size effects. The known picture
that describes the giant magnetoresistance, by interpreting the scattering
amplitudes of parallel or antiparallel polarized currents with local
magnetizations, is obtained without having to resort to different entities;
itinerant and localized charges are indistinguishable.
|
cond-mat.str-el cond-mat.quant-gas
|
we use numerically unbiased methods to show that the onedimensional hubbard model with periodically distributed onsite interactions already contains the minimal ingredients to display the phenomenon of magnetoresistance ie by applying an external magnetic field a dramatic enhancement on the charge transport is achieved we reach this conclusion based on the computation of the drude weight and of the singleparticle density of states applying twisted boundary condition averaging to reduce finitesize effects the known picture that describes the giant magnetoresistance by interpreting the scattering amplitudes of parallel or antiparallel polarized currents with local magnetizations is obtained without having to resort to different entities itinerant and localized charges are indistinguishable
|
[['we', 'use', 'numerically', 'unbiased', 'methods', 'to', 'show', 'that', 'the', 'onedimensional', 'hubbard', 'model', 'with', 'periodically', 'distributed', 'onsite', 'interactions', 'already', 'contains', 'the', 'minimal', 'ingredients', 'to', 'display', 'the', 'phenomenon', 'of', 'magnetoresistance', 'ie', 'by', 'applying', 'an', 'external', 'magnetic', 'field', 'a', 'dramatic', 'enhancement', 'on', 'the', 'charge', 'transport', 'is', 'achieved', 'we', 'reach', 'this', 'conclusion', 'based', 'on', 'the', 'computation', 'of', 'the', 'drude', 'weight', 'and', 'of', 'the', 'singleparticle', 'density', 'of', 'states', 'applying', 'twisted', 'boundary', 'condition', 'averaging', 'to', 'reduce', 'finitesize', 'effects', 'the', 'known', 'picture', 'that', 'describes', 'the', 'giant', 'magnetoresistance', 'by', 'interpreting', 'the', 'scattering', 'amplitudes', 'of', 'parallel', 'or', 'antiparallel', 'polarized', 'currents', 'with', 'local', 'magnetizations', 'is', 'obtained', 'without', 'having', 'to', 'resort', 'to', 'different', 'entities', 'itinerant', 'and', 'localized', 'charges', 'are', 'indistinguishable']]
|
[-0.18059068008853602, 0.1764544567437426, -0.04097658542995213, 0.05949353300346865, -0.057899211755517974, -0.13971916064961787, 0.04484602421257269, 0.39112403464648837, -0.23856540312274965, -0.28986505350661934, -0.000771667428075447, -0.28812550410730847, -0.1080167866894044, 0.16498476437745838, 0.012858664719606835, 0.0013672538238381027, 0.030862686399438784, -0.006935350485829586, -0.08861174865053334, -0.23582937497722514, 0.32226883275156687, 0.01217707808673117, 0.31307737036274935, 0.055375611724613936, 0.059737748594595755, 0.05380613553346297, 0.04098345821834417, 0.04666543399077763, -0.08694644870918454, 0.097887199471914, 0.1900495646025883, -0.0504115958404519, 0.18487611455509628, -0.4892135522106167, -0.19123125035281574, 0.05419850772473141, 0.15139152324510688, 0.1620390941004414, -0.0269228809314498, -0.2792293223287534, 0.04762054321894405, -0.144440626078328, -0.17765100046548002, -0.11502156579234732, -0.02640670894136772, 0.007814707238773961, -0.28825597724142493, 0.12571128069875984, 0.059324388507616906, 0.07799198903536442, -0.06957697811100734, -0.11743556436390505, -0.06039948243681991, 0.094934480232742, 0.061734722272510034, 0.028664075689381757, 0.15246669020196166, -0.13138927902931288, -0.1362288870769681, 0.306817990986186, -0.06621641999349819, -0.17764617956855971, 0.17397070899306702, -0.15320435302639637, -0.059591675442088085, 0.14888127180486022, 0.09353270133906001, 0.07371656331789056, -0.16707017211352448, 0.08258376213392978, -0.001460469435738109, 0.14123258042259254, 0.05293028981535943, 0.035671693512127484, 0.23053121131229634, 0.13891203976407168, 0.055739675426360116, 0.1526610051204852, -0.09847128904988528, -0.10567114299265754, -0.2519228943290377, -0.10126208309340504, -0.2333462828462687, 0.09048736696088806, -0.06295392939947982, -0.21841282813613294, 0.38618012018066, 0.18769010428100005, 0.1903076724431247, -0.003440122278150889, 0.27835013401169123, 0.16256832578347638, 0.09965758358871718, 0.08892354086776255, 0.23222928327602257, 0.1679613779474118, 0.08322176785174108, -0.2898569669437791, 0.030062746188502947, 0.06197089278310059]
|
1,803.08228
|
SCISPACE: A Scientific Collaboration Workspace for File Systems in
Geo-Distributed HPC Data Centers
|
Future terabit networks are committed to dramatically improving big data
motion between geographically dispersed HPC data centers.The scientific
community takes advantage of the terabit networks such as DOE's ESnet and
accelerates the trend to build a small world of collaboration between
geospatial HPC data centers. It improves information and resource sharing for
joint simulation and analysis between the HPC data centers. In this paper, we
propose to build SCISPACE (Scientific Collaboration Workspace) for
collaborative data centers. It provides a global view of information shared
from multiple geo-distributed HPC data centers under a single workspace.
SCISPACE supports native data-access to gain high-performance when data read or
write is required in native data center namespace. It is accomplished by
integrating a metadata export protocol. To optimize scientific collaborations
across HPC data centers, SCISPACE implements search and discovery service. To
evaluate, we configured two geo-distributed small-scale HPC data centers
connected via high-speed Infiniband network, equipped with LustreFS. We show
the feasibility of SCISPACE using real scientific datasets and applications.
The evaluation results show average 36\% performance boost when the proposed
native-data access is employed in collaborations.
|
cs.DC
|
future terabit networks are committed to dramatically improving big data motion between geographically dispersed hpc data centersthe scientific community takes advantage of the terabit networks such as does esnet and accelerates the trend to build a small world of collaboration between geospatial hpc data centers it improves information and resource sharing for joint simulation and analysis between the hpc data centers in this paper we propose to build scispace scientific collaboration workspace for collaborative data centers it provides a global view of information shared from multiple geodistributed hpc data centers under a single workspace scispace supports native dataaccess to gain highperformance when data read or write is required in native data center namespace it is accomplished by integrating a metadata export protocol to optimize scientific collaborations across hpc data centers scispace implements search and discovery service to evaluate we configured two geodistributed smallscale hpc data centers connected via highspeed infiniband network equipped with lustrefs we show the feasibility of scispace using real scientific datasets and applications the evaluation results show average 36 performance boost when the proposed nativedata access is employed in collaborations
|
[['future', 'terabit', 'networks', 'are', 'committed', 'to', 'dramatically', 'improving', 'big', 'data', 'motion', 'between', 'geographically', 'dispersed', 'hpc', 'data', 'centersthe', 'scientific', 'community', 'takes', 'advantage', 'of', 'the', 'terabit', 'networks', 'such', 'as', 'does', 'esnet', 'and', 'accelerates', 'the', 'trend', 'to', 'build', 'a', 'small', 'world', 'of', 'collaboration', 'between', 'geospatial', 'hpc', 'data', 'centers', 'it', 'improves', 'information', 'and', 'resource', 'sharing', 'for', 'joint', 'simulation', 'and', 'analysis', 'between', 'the', 'hpc', 'data', 'centers', 'in', 'this', 'paper', 'we', 'propose', 'to', 'build', 'scispace', 'scientific', 'collaboration', 'workspace', 'for', 'collaborative', 'data', 'centers', 'it', 'provides', 'a', 'global', 'view', 'of', 'information', 'shared', 'from', 'multiple', 'geodistributed', 'hpc', 'data', 'centers', 'under', 'a', 'single', 'workspace', 'scispace', 'supports', 'native', 'dataaccess', 'to', 'gain', 'highperformance', 'when', 'data', 'read', 'or', 'write', 'is', 'required', 'in', 'native', 'data', 'center', 'namespace', 'it', 'is', 'accomplished', 'by', 'integrating', 'a', 'metadata', 'export', 'protocol', 'to', 'optimize', 'scientific', 'collaborations', 'across', 'hpc', 'data', 'centers', 'scispace', 'implements', 'search', 'and', 'discovery', 'service', 'to', 'evaluate', 'we', 'configured', 'two', 'geodistributed', 'smallscale', 'hpc', 'data', 'centers', 'connected', 'via', 'highspeed', 'infiniband', 'network', 'equipped', 'with', 'lustrefs', 'we', 'show', 'the', 'feasibility', 'of', 'scispace', 'using', 'real', 'scientific', 'datasets', 'and', 'applications', 'the', 'evaluation', 'results', 'show', 'average', '36', 'performance', 'boost', 'when', 'the', 'proposed', 'nativedata', 'access', 'is', 'employed', 'in', 'collaborations']]
|
[-0.15323157304535723, 0.0016520192148163915, -0.050254861516360605, 0.018402954301564023, -0.11137097858591005, -0.1462442303697268, 0.09568299283596894, 0.43060865510552604, -0.26011167974211274, -0.39000462748162035, 0.08001837854842758, -0.30853172611742696, -0.08437800156858025, 0.2038824148501994, -0.07891874206511097, 0.08269170264506506, 0.1815743354200903, -0.009982436275782271, -0.0053286608360293836, -0.28373338228298556, 0.27728360839990074, 0.11344307983915011, 0.4313239805555592, 0.05638337628754218, 0.060123637687259666, 0.02759086698966308, -0.08447173010726046, -0.039366894821351806, -0.04822153271832374, 0.17318323891142628, 0.36047139330637745, 0.2780230298276163, 0.31561058754515314, -0.4553585042556127, -0.11823638286441565, 0.11033826791163948, 0.15113306810380892, 0.03329659081654326, -0.0710753607945258, -0.32621299507639684, 0.10403640869998425, -0.20680805727218587, -0.07963243864942342, -0.11587903463837898, -0.00914010403988262, 0.026669382583349943, -0.25921841355868513, -0.021157354494142862, -0.06587792128169288, 0.0789333751011226, -0.03439514369238168, -0.07054230475591289, -0.007387740974728432, 0.19449845349526085, -0.028968970683248094, 0.046984204593657826, 0.19821842472948548, -0.09392377411289393, -0.15309646155995627, 0.36419177699264965, 0.012660901240694026, -0.13399501972987007, 0.16902150974557217, -0.06232611312783168, -0.1750660547831406, 0.050842939341479605, 0.24095439162532178, -0.013168147294264701, -0.2144602874017437, 0.06986820986850135, 0.036897700052294466, 0.1715270948337598, 0.0566221168756278, 0.011421685665603339, 0.1895639674854465, 0.2744223673698596, 0.06912816409280317, 0.12623633351856067, -0.08188995924008648, -0.13084739057036737, -0.14148658518970478, -0.13613457920986952, -0.20701643166960113, -0.00910449495422654, -0.09881072313898281, -0.11143231788753635, 0.3092321210851272, 0.18189931924247907, 0.14973830160064003, 0.05139136034073696, 0.37020655863194, -0.058508904821064786, 0.18624326952008738, 0.18347965556248608, 0.12242599112279196, -0.025996913581103502, 0.23359193494543434, -0.14140323421840245, 0.03446389858533318, -0.08713138500590706]
|
1,803.08229
|
Pair of Dual Wavelet Frames on Local Fields
|
In this paper, an algorithm based on polyphase matrix for constructing a pair
of orthogonal wavelet frames is suggested, and a general form for all
orthogonal tight wavelet frames on local fields of positive characteristic is
described. Moreover, we investigate their properties by means of the Fourier
transform.
|
math.FA
|
in this paper an algorithm based on polyphase matrix for constructing a pair of orthogonal wavelet frames is suggested and a general form for all orthogonal tight wavelet frames on local fields of positive characteristic is described moreover we investigate their properties by means of the fourier transform
|
[['in', 'this', 'paper', 'an', 'algorithm', 'based', 'on', 'polyphase', 'matrix', 'for', 'constructing', 'a', 'pair', 'of', 'orthogonal', 'wavelet', 'frames', 'is', 'suggested', 'and', 'a', 'general', 'form', 'for', 'all', 'orthogonal', 'tight', 'wavelet', 'frames', 'on', 'local', 'fields', 'of', 'positive', 'characteristic', 'is', 'described', 'moreover', 'we', 'investigate', 'their', 'properties', 'by', 'means', 'of', 'the', 'fourier', 'transform']]
|
[-0.15187785881001523, 0.06132089536095009, -0.1144687020375083, 0.06035063304443611, -0.05313338542570515, -0.07411247165873647, -0.009185802189070577, 0.4410314598741631, -0.2758697613608092, -0.16918039818604788, 0.09970856030849973, -0.18584829991838583, -0.23297116973359758, 0.24158006293388704, -0.055021929050174855, 0.07355911195433389, 0.014586526216589846, 0.06161014516449844, -0.13095892339091128, -0.23461289494298398, 0.33813850946413976, 0.06827734550461173, 0.29595371696632355, -0.08253205656850089, 0.13608028487457582, 0.08118013656348921, -0.13632504595443606, -0.019939042375578236, -0.09117258683545515, 0.17002269804652315, 0.20817076848470606, 0.15804937126813456, 0.25873835547827184, -0.3995671554002911, -0.15288681115877503, 0.1022549667977728, 0.1360576250978435, 0.03829233669966925, -0.08548861966119148, -0.2748455844121054, 0.12314034177688882, -0.08126060575402032, -0.06767778018062624, -0.12168352188018616, 0.025752712283671524, 0.04286939970916137, -0.34669052735747147, 0.06324064529811342, 0.11877356569796878, 0.09125650809922566, -0.08027426518674474, -0.10231891146152823, 0.09886671211764526, 0.06664376879537788, -0.023317324531186994, 0.0025472025517956354, 0.048149823502171785, -0.009051058824600963, -0.10997614224712986, 0.38879062126701075, -0.08421402597256626, -0.2628426813413777, 0.14706388946797233, -0.1032021935194886, -0.1149916730937548, 0.0902871123883718, 0.1934014383199004, 0.12152346953128774, -0.17063610019007078, 0.11052367971948722, -0.10302092351776082, 0.13331421934223422, 0.15360028302529827, 0.08913548738564714, 0.1602199236707141, 0.07609204763624196, 0.09214318097413828, 0.14552738935647844, -0.04961263596972761, -0.01577355296467431, -0.27407288054625195, -0.19790797808673233, -0.2797160864211037, -0.02087363573082257, -0.09110242645177398, -0.1841240045032464, 0.49761311579398654, 0.04816657374612987, 0.20103303859165558, 0.075560871414685, 0.26705663884058595, 0.15900371328461915, 0.03530759488057811, 0.07534946597297676, 0.16406920237932354, 0.17466457867703866, 0.0036049630725756288, -0.151949900512894, -0.031086490217906732, 0.16570193930723084]
|
1,803.0823
|
The radio telescope search for the resonant conversion of cold dark
matter axions from the magnetized astrophysical sources
|
We study the conditions for the adiabatic resonant conversion of the cold
dark matter (CDM) axions into photons in existence of the astrophysically
sourced strong magnetic fields such as those in the neutron star magnetosphere.
We demonstrate the possibility that the forthcoming radio telescopes such as
the SKA (Square Kilometre Array) can probe those photon signals from the CDM
axions.
|
hep-ph astro-ph.CO astro-ph.HE
|
we study the conditions for the adiabatic resonant conversion of the cold dark matter cdm axions into photons in existence of the astrophysically sourced strong magnetic fields such as those in the neutron star magnetosphere we demonstrate the possibility that the forthcoming radio telescopes such as the ska square kilometre array can probe those photon signals from the cdm axions
|
[['we', 'study', 'the', 'conditions', 'for', 'the', 'adiabatic', 'resonant', 'conversion', 'of', 'the', 'cold', 'dark', 'matter', 'cdm', 'axions', 'into', 'photons', 'in', 'existence', 'of', 'the', 'astrophysically', 'sourced', 'strong', 'magnetic', 'fields', 'such', 'as', 'those', 'in', 'the', 'neutron', 'star', 'magnetosphere', 'we', 'demonstrate', 'the', 'possibility', 'that', 'the', 'forthcoming', 'radio', 'telescopes', 'such', 'as', 'the', 'ska', 'square', 'kilometre', 'array', 'can', 'probe', 'those', 'photon', 'signals', 'from', 'the', 'cdm', 'axions']]
|
[-0.15531789585947992, 0.24641042751415324, -0.021689836867153645, 0.18014696404958766, -0.12756561187949653, -0.01655886120473345, -0.041315265279263255, 0.3496094635066887, -0.23211930685987076, -0.36272254002590976, 0.0641241438415212, -0.2864903443182508, -0.021683989216883977, 0.24382062113533418, 0.10091381962411106, 0.0020523994384954373, 0.031732588556284705, -0.06024831620355447, 0.02315090870251879, -0.18880876597443905, 0.2662323376784722, 0.12032312507120271, 0.18597399949406584, 0.0047214270608189205, 0.05941382193317016, -0.09253614709402123, -0.007806173789625366, -0.0902390797312061, -0.12483570340227743, -0.02016795313296219, 0.24931244092682997, 0.15578208489265913, 0.15655860687062764, -0.49457566949228443, -0.22291824851805966, 0.19475188017822803, 0.15170486844144762, 0.10321073482433955, -0.0969258237319688, -0.35500057609751823, 0.0011143376274655263, -0.20047007746373613, -0.13460583970881998, -0.0074138720830281574, -0.062119622303483384, 0.07607847358643388, -0.2423962014707892, 0.04947001381466786, -0.018360233483448004, -0.08226907815163334, -0.11541046149407824, -0.10310084501591822, 0.039649880460153025, -0.016479939684116592, 0.05708707630013426, 0.0031000952585600317, 0.21685927325549226, -0.23803997617214917, -0.08874473651812878, 0.44410821911296805, -0.16980005599713574, -0.04044300887423257, 0.15877345080176988, -0.23801298088704545, -0.14893150868980834, 0.11316718322535356, 0.1563535897837331, 0.05285123209080969, -0.09425747192775209, 0.07248837454244494, -0.04805463115529467, 0.20480342727775375, 0.12211082337113718, 0.11652932270274809, 0.4543151061361035, 0.17413300873401263, 0.0728052960243076, 0.12529280898937334, -0.16894838241860272, 0.01473475161474198, -0.30483586686023045, -0.09626380819827318, -0.17947186365102727, 0.08649512651997308, -0.1259550043847412, -0.11535647788550704, 0.32858204884299386, 0.13138355649231623, 0.08442739676684141, -0.044138795665154856, 0.3642972298897803, 0.03747964100524162, 0.0405183003594478, 0.0019610196662445865, 0.38992628070215385, 0.17966517084278166, 0.10242474178473154, -0.2602970121544786, -0.0937226688489318, -0.04321496145178874]
|
1,803.08231
|
Single-layer graphdiyne on Pt(111): Improved catalysis confined under
two-dimensional overlayer
|
In recent years, two-dimensional confined catalysis, i.e. the enhanced
catalytic reactions in confined spaces between metal surface and
two-dimensional overlayer, makes a hit and opens up a new way to enhance the
performance of catalysts. In this work, graphdiyne overlayer was proposed as a
more excellent material than graphene or hexagonal boron nitride for
two-dimensional confined catalysis. Density functional theory calculations
revealed the superiority of graphdiyne overlayer originated from the steric
hindrance effect which increases the catalytic ability and lowers the reaction
barriers. Moreover, with the big triangle holes as natural gas tunnels,
graphdiyne possesses higher efficiency for the transit of gaseous reactants and
products than graphene or hexagonal boron nitride. The results in this work
would benefit future development two-dimensional confined catalysis.
|
cond-mat.mtrl-sci
|
in recent years twodimensional confined catalysis ie the enhanced catalytic reactions in confined spaces between metal surface and twodimensional overlayer makes a hit and opens up a new way to enhance the performance of catalysts in this work graphdiyne overlayer was proposed as a more excellent material than graphene or hexagonal boron nitride for twodimensional confined catalysis density functional theory calculations revealed the superiority of graphdiyne overlayer originated from the steric hindrance effect which increases the catalytic ability and lowers the reaction barriers moreover with the big triangle holes as natural gas tunnels graphdiyne possesses higher efficiency for the transit of gaseous reactants and products than graphene or hexagonal boron nitride the results in this work would benefit future development twodimensional confined catalysis
|
[['in', 'recent', 'years', 'twodimensional', 'confined', 'catalysis', 'ie', 'the', 'enhanced', 'catalytic', 'reactions', 'in', 'confined', 'spaces', 'between', 'metal', 'surface', 'and', 'twodimensional', 'overlayer', 'makes', 'a', 'hit', 'and', 'opens', 'up', 'a', 'new', 'way', 'to', 'enhance', 'the', 'performance', 'of', 'catalysts', 'in', 'this', 'work', 'graphdiyne', 'overlayer', 'was', 'proposed', 'as', 'a', 'more', 'excellent', 'material', 'than', 'graphene', 'or', 'hexagonal', 'boron', 'nitride', 'for', 'twodimensional', 'confined', 'catalysis', 'density', 'functional', 'theory', 'calculations', 'revealed', 'the', 'superiority', 'of', 'graphdiyne', 'overlayer', 'originated', 'from', 'the', 'steric', 'hindrance', 'effect', 'which', 'increases', 'the', 'catalytic', 'ability', 'and', 'lowers', 'the', 'reaction', 'barriers', 'moreover', 'with', 'the', 'big', 'triangle', 'holes', 'as', 'natural', 'gas', 'tunnels', 'graphdiyne', 'possesses', 'higher', 'efficiency', 'for', 'the', 'transit', 'of', 'gaseous', 'reactants', 'and', 'products', 'than', 'graphene', 'or', 'hexagonal', 'boron', 'nitride', 'the', 'results', 'in', 'this', 'work', 'would', 'benefit', 'future', 'development', 'twodimensional', 'confined', 'catalysis']]
|
[-0.0732943824813247, 0.15326767033571756, 0.03166951721215174, -0.0248635357938616, -0.0015892801670039573, -0.15737778892952617, 0.10764358766146034, 0.4161386515839192, -0.2488415250327529, -0.2870102953203628, -0.04325858129158131, -0.3492664603925333, -0.18215395034029624, 0.17278052136733582, -0.004359314978175714, 0.05183673718171876, 0.05466344383757228, -0.10809231488927593, -0.07579158176242079, -0.20507245312437294, 0.21875942498824097, 0.13096775468893168, 0.354551853203192, 0.1688233920774324, -0.009208856578310573, -0.04987973269222804, 0.10956659359948301, 0.008023935127851925, -0.15869529082650902, 0.15062173439295795, 0.2199187005181017, -0.10835270807752764, 0.2332313904251025, -0.544662473677862, -0.25957924286585027, 0.03328273268946545, 0.1698723483255239, 0.11035516419981765, -0.18681169384051724, -0.24890106486353447, 0.04604572956630112, -0.17972028210032276, -0.12814485704208292, -0.05356789730599044, 0.022354936942730736, -0.019091150636322857, -0.22592843785064248, 0.08045730659950191, 0.04545964959751421, 0.044458912858184395, -0.10854043764614962, -0.14770754022766056, -0.12939621636083698, 0.07578728736162459, 0.03390059134794202, 0.02763687638775067, 0.30379103003372626, -0.0937297201291393, -0.09186089350425494, 0.4512356470179994, -0.03696092231529462, -0.08693365414808618, 0.2267346377825228, -0.16453142999766046, -0.07623634369768452, 0.19899158918760657, 0.13451592898189385, 0.11422831394967085, -0.130478386853337, 0.08929348235563715, -0.0024421075406310154, 0.11743452448428161, 0.16411099641970017, 0.04329701754211531, 0.24875530252816172, 0.29904570400230285, 0.07507618674175526, 0.14163868082497966, -0.08768980010465635, -0.07141392060689916, -0.12054528783613104, -0.2873112712797474, -0.16799492205929, 0.07552544680817765, -0.06446222514926826, -0.21639249396578566, 0.3272699289765906, 0.08318677007758278, 0.13028880458976316, -0.07344682245019339, 0.2442679740504205, 0.001232185641424806, 0.11661816483772383, -0.02161130534742421, 0.24877764204350428, 0.18026236760452752, 0.12816304182330887, -0.1996348473807509, 0.0956122211636824, 0.0021741445331523814]
|
1,803.08232
|
A Primary Exploration to Quasi-Two-Dimensional Rare-Earth Ferromagnetic
Particles: Holmium-Doped MoS2 Sheet as Room-Temperature Magnetic
Semiconductor
|
Recently, two-dimensional materials and nanoparticles with robust
ferromagnetism are even of great interest to explore basic physics in nanoscale
spintronics. More importantly, room-temperature magnetic semiconducting
materials with high Curie temperature is essential for developing
next-generation spintronic and quantum computing devices. Here, we develop a
theoretical model on the basis of density functional theory calculations and
the Ruderman-Kittel-Kasuya-Yoshida theory to predict the thermal stability of
two-dimensional magnetic materials. Compared with other rare-earth (dysprosium
(Dy) and erbium (Er)) and 3d (copper (Cu)) impurities, holmium-doped (Ho-doped)
single-layer 1H-MoS2 is proposed as promising semiconductor with robust
magnetism. The calculations at the level of hybrid HSE06 functional predict a
Curie temperature much higher than room temperature. Ho-doped MoS2 sheet
possesses fully spin-polarized valence and conduction bands, which is a
prerequisite for flexible spintronic applications.
|
cond-mat.mtrl-sci
|
recently twodimensional materials and nanoparticles with robust ferromagnetism are even of great interest to explore basic physics in nanoscale spintronics more importantly roomtemperature magnetic semiconducting materials with high curie temperature is essential for developing nextgeneration spintronic and quantum computing devices here we develop a theoretical model on the basis of density functional theory calculations and the rudermankittelkasuyayoshida theory to predict the thermal stability of twodimensional magnetic materials compared with other rareearth dysprosium dy and erbium er and 3d copper cu impurities holmiumdoped hodoped singlelayer 1hmos2 is proposed as promising semiconductor with robust magnetism the calculations at the level of hybrid hse06 functional predict a curie temperature much higher than room temperature hodoped mos2 sheet possesses fully spinpolarized valence and conduction bands which is a prerequisite for flexible spintronic applications
|
[['recently', 'twodimensional', 'materials', 'and', 'nanoparticles', 'with', 'robust', 'ferromagnetism', 'are', 'even', 'of', 'great', 'interest', 'to', 'explore', 'basic', 'physics', 'in', 'nanoscale', 'spintronics', 'more', 'importantly', 'roomtemperature', 'magnetic', 'semiconducting', 'materials', 'with', 'high', 'curie', 'temperature', 'is', 'essential', 'for', 'developing', 'nextgeneration', 'spintronic', 'and', 'quantum', 'computing', 'devices', 'here', 'we', 'develop', 'a', 'theoretical', 'model', 'on', 'the', 'basis', 'of', 'density', 'functional', 'theory', 'calculations', 'and', 'the', 'rudermankittelkasuyayoshida', 'theory', 'to', 'predict', 'the', 'thermal', 'stability', 'of', 'twodimensional', 'magnetic', 'materials', 'compared', 'with', 'other', 'rareearth', 'dysprosium', 'dy', 'and', 'erbium', 'er', 'and', '3d', 'copper', 'cu', 'impurities', 'holmiumdoped', 'hodoped', 'singlelayer', '1hmos2', 'is', 'proposed', 'as', 'promising', 'semiconductor', 'with', 'robust', 'magnetism', 'the', 'calculations', 'at', 'the', 'level', 'of', 'hybrid', 'hse06', 'functional', 'predict', 'a', 'curie', 'temperature', 'much', 'higher', 'than', 'room', 'temperature', 'hodoped', 'mos2', 'sheet', 'possesses', 'fully', 'spinpolarized', 'valence', 'and', 'conduction', 'bands', 'which', 'is', 'a', 'prerequisite', 'for', 'flexible', 'spintronic', 'applications']]
|
[-0.08586787704345104, 0.18079067156594691, 0.020062272793554242, 0.007739469451258802, -0.024416727121061986, -0.23880818468104634, 0.08033207310215822, 0.4344127880675452, -0.22223267023865548, -0.2894077138783085, -0.03488757781174388, -0.3591275544807551, -0.15730086303619106, 0.20766035646444098, 0.053761579011315626, 0.08342736853759676, -0.03607919862094734, -0.0873498615941831, -0.10892376845004037, -0.17179467504481888, 0.1790801347676842, 0.09716500018192972, 0.3904614668775586, 0.11771401230038868, 0.013835477402492885, -0.025239495156306982, 0.18797698387477016, 0.021867359966217054, -0.14909326682702936, 0.1669341853841962, 0.32972831957943977, -0.16363180182977682, 0.2593245383218995, -0.5244123787722654, -0.2798396559415518, -0.03254078387319515, 0.06827742697316266, 0.16166646539447052, -0.1678629212137099, -0.24075072340201586, 0.12336455575293964, -0.1439165851093888, -0.11771488522116136, -0.21265606219798977, -0.0015400075612382756, -0.00254561104959557, -0.23900307369019305, 0.06566455491471089, 0.014583985984606284, 0.10909488778466651, -0.12791180193559581, -0.20430516075557245, -0.08897060990917481, 0.0031031053771989215, -0.016186832832837745, 0.0626033888845649, 0.22437280248702754, -0.10940012406735193, -0.11233438229158757, 0.4017279473621221, -0.02534431303975575, -0.037294489279803306, 0.1901891550865941, -0.17222222132841125, -0.08595713458230926, 0.09792915498098684, 0.1152814572103255, 0.12644842037162374, -0.16560762159762873, 0.10688504756018076, 0.05656255539303409, 0.17378578056204355, -0.020225338693264695, 0.14206664937285943, 0.311978348342347, 0.30004863569971235, 0.03806734285183391, 0.09054711884551031, -0.11588250973912341, -0.02136875074800281, -0.13739545298148953, -0.24657450366528735, -0.2554745231163762, 0.05905813279946054, -0.08693911135219784, -0.2330393612695237, 0.3852226324527273, 0.18506761782965253, 0.07329092332668277, -0.08340413574524785, 0.2700133069994904, 0.0961599253655766, 0.08507001725032866, 0.006527015706524253, 0.23764353910357588, 0.2301668917061761, 0.15024001520526195, -0.21800342191468983, 0.08200641298141803, -0.016812819358800347]
|
1,803.08233
|
Observation of the possible chiral edge mode in Bi1-xSbx
|
After the classification of topological states of matter has been clarified
for non-interacting electron systems, the theoretical connection between
gapless boundary modes and nontrivial bulk topological structures, and their
evolutions as a function of dimensions are now well understood. However, such
dimensional hierarchy has not been well established experimentally although
some indirect evidences were reported, for example, such as the half-quantized
Hall conductance via quantum Hall effect and extrapolation in the
quantum-oscillation measurement. In this paper, we report the appearance of the
possible chiral edge mode from the surface state of topological insulators
under magnetic fields, confirming the dimensional hierarchy in three
dimensional topological insulators. Applying laser pulses to the surface state
of Bi1-xSbx, we find that the sign of voltage relaxation in one edge becomes
opposite to that in the other edge only when magnetic fields are applied to the
topological insulating phase. We show that this sign difference originates from
the chirality of edge states, based on coupled time-dependent Poisson and
Boltzmann equations.
|
cond-mat.str-el
|
after the classification of topological states of matter has been clarified for noninteracting electron systems the theoretical connection between gapless boundary modes and nontrivial bulk topological structures and their evolutions as a function of dimensions are now well understood however such dimensional hierarchy has not been well established experimentally although some indirect evidences were reported for example such as the halfquantized hall conductance via quantum hall effect and extrapolation in the quantumoscillation measurement in this paper we report the appearance of the possible chiral edge mode from the surface state of topological insulators under magnetic fields confirming the dimensional hierarchy in three dimensional topological insulators applying laser pulses to the surface state of bi1xsbx we find that the sign of voltage relaxation in one edge becomes opposite to that in the other edge only when magnetic fields are applied to the topological insulating phase we show that this sign difference originates from the chirality of edge states based on coupled timedependent poisson and boltzmann equations
|
[['after', 'the', 'classification', 'of', 'topological', 'states', 'of', 'matter', 'has', 'been', 'clarified', 'for', 'noninteracting', 'electron', 'systems', 'the', 'theoretical', 'connection', 'between', 'gapless', 'boundary', 'modes', 'and', 'nontrivial', 'bulk', 'topological', 'structures', 'and', 'their', 'evolutions', 'as', 'a', 'function', 'of', 'dimensions', 'are', 'now', 'well', 'understood', 'however', 'such', 'dimensional', 'hierarchy', 'has', 'not', 'been', 'well', 'established', 'experimentally', 'although', 'some', 'indirect', 'evidences', 'were', 'reported', 'for', 'example', 'such', 'as', 'the', 'halfquantized', 'hall', 'conductance', 'via', 'quantum', 'hall', 'effect', 'and', 'extrapolation', 'in', 'the', 'quantumoscillation', 'measurement', 'in', 'this', 'paper', 'we', 'report', 'the', 'appearance', 'of', 'the', 'possible', 'chiral', 'edge', 'mode', 'from', 'the', 'surface', 'state', 'of', 'topological', 'insulators', 'under', 'magnetic', 'fields', 'confirming', 'the', 'dimensional', 'hierarchy', 'in', 'three', 'dimensional', 'topological', 'insulators', 'applying', 'laser', 'pulses', 'to', 'the', 'surface', 'state', 'of', 'bi1xsbx', 'we', 'find', 'that', 'the', 'sign', 'of', 'voltage', 'relaxation', 'in', 'one', 'edge', 'becomes', 'opposite', 'to', 'that', 'in', 'the', 'other', 'edge', 'only', 'when', 'magnetic', 'fields', 'are', 'applied', 'to', 'the', 'topological', 'insulating', 'phase', 'we', 'show', 'that', 'this', 'sign', 'difference', 'originates', 'from', 'the', 'chirality', 'of', 'edge', 'states', 'based', 'on', 'coupled', 'timedependent', 'poisson', 'and', 'boltzmann', 'equations']]
|
[-0.17330848015280384, 0.21894289972542813, -0.06715421476739004, 0.031490725136333796, -0.056638643698710384, -0.1523819272180624, 0.04774179798903677, 0.3784319878584056, -0.26632475166045355, -0.2937889145405004, 0.07240273386846777, -0.2812184462606004, -0.17670970884377532, 0.1740981703253717, 0.010834092226330982, 0.09919791777590008, -0.015488474979770905, 0.007859638573206736, -0.09252582504731519, -0.20077086210702405, 0.3427087956079931, -0.04663578623863445, 0.324275395195141, 0.08813123545630581, 0.044099593935816576, -0.021009104044148415, 0.05684231415983628, 0.07186743183287256, -0.11218487767597032, 0.019191556434485724, 0.2492756917677594, -0.06651152420963627, 0.16505951248955997, -0.47737153780957065, -0.23327160628343172, 0.031058926022414005, 0.12621372870705796, 0.15488061609141754, -0.08543282700208665, -0.3097452315360759, 0.06605847586002765, -0.15118571831985855, -0.10175939193842086, -0.09550171587051767, 0.02685903323757829, -0.06298557585740293, -0.19272350479749906, 0.12332110832812208, 0.06482565142919845, 0.07327954399427682, -0.08691932761082144, -0.12273313873306368, -0.0987959990136777, 0.10025763412916355, 0.07036765064112842, 0.010415394633839076, 0.09817103116180409, -0.17250468441824054, -0.19220407175069507, 0.3430300931248701, -0.05025886554186317, -0.1487500710638635, 0.23070926671480815, -0.17851469840741518, -0.09568575439043343, 0.10066093305182276, 0.09781342094877, 0.07888259368130203, -0.08035086549044178, 0.09869246071797202, -0.04505990303869387, 0.12063081809742884, 0.049332144842341996, 0.08793029625420318, 0.26938483989374207, 0.1493893891403621, 0.08265406597179897, 0.15533476023772505, -0.11562439527814135, -0.0714289347277813, -0.2597450606073394, -0.1907284084030173, -0.24238534114856244, 0.07890852277853286, 0.008387671798030197, -0.19449003482745453, 0.44984640835812595, 0.14312834916953845, 0.18494151909130088, -0.057923816004768015, 0.26494786167855966, 0.15929939212757305, 0.05410423486662859, 0.04504304898084339, 0.2706654801074006, 0.1855149437391171, 0.07898852012374184, -0.266139469487649, 0.03294484459876196, 0.05478243398564783]
|
1,803.08234
|
A WISE Survey of New Star Clusters in the Central Plane Region of the
Milky Way
|
We present the discovery of new star clusters in the central plane region
($|l|<30\deg$ and $|b|<6\deg$) of the Milky Way. In order to overcome the
extinction problem and the spatial limit of previous surveys, we use the
Wide-field Infrared Survey Explorer (WISE) data to find clusters. We also use
other infrared survey data in the archive for additional analysis. We find 923
new clusters, of which 202 clusters are embedded clusters. These clusters are
concentrated toward the Galactic plane and show a symmetric distribution with
respect to the Galactic latitude. The embedded clusters show a stronger
concentration to the Galactic plane than the non-embedded clusters. The new
clusters are found more in the first Galactic quadrant, while previously known
clusters are found more in the fourth Galactic quadrant. The spatial
distribution of the combined sample of known clusters and new clusters is
approximately symmetric with respect to the Galactic longitude. We estimate
reddenings, distances, and relative ages of the 15 class A clusters using
theoretical isochrones. Ten of them are relatively old (age $>800$ Myr) and
five are young (age $\approx4$ Myr).
|
astro-ph.GA
|
we present the discovery of new star clusters in the central plane region l30deg and b6deg of the milky way in order to overcome the extinction problem and the spatial limit of previous surveys we use the widefield infrared survey explorer wise data to find clusters we also use other infrared survey data in the archive for additional analysis we find 923 new clusters of which 202 clusters are embedded clusters these clusters are concentrated toward the galactic plane and show a symmetric distribution with respect to the galactic latitude the embedded clusters show a stronger concentration to the galactic plane than the nonembedded clusters the new clusters are found more in the first galactic quadrant while previously known clusters are found more in the fourth galactic quadrant the spatial distribution of the combined sample of known clusters and new clusters is approximately symmetric with respect to the galactic longitude we estimate reddenings distances and relative ages of the 15 class a clusters using theoretical isochrones ten of them are relatively old age 800 myr and five are young age approx4 myr
|
[['we', 'present', 'the', 'discovery', 'of', 'new', 'star', 'clusters', 'in', 'the', 'central', 'plane', 'region', 'l30deg', 'and', 'b6deg', 'of', 'the', 'milky', 'way', 'in', 'order', 'to', 'overcome', 'the', 'extinction', 'problem', 'and', 'the', 'spatial', 'limit', 'of', 'previous', 'surveys', 'we', 'use', 'the', 'widefield', 'infrared', 'survey', 'explorer', 'wise', 'data', 'to', 'find', 'clusters', 'we', 'also', 'use', 'other', 'infrared', 'survey', 'data', 'in', 'the', 'archive', 'for', 'additional', 'analysis', 'we', 'find', '923', 'new', 'clusters', 'of', 'which', '202', 'clusters', 'are', 'embedded', 'clusters', 'these', 'clusters', 'are', 'concentrated', 'toward', 'the', 'galactic', 'plane', 'and', 'show', 'a', 'symmetric', 'distribution', 'with', 'respect', 'to', 'the', 'galactic', 'latitude', 'the', 'embedded', 'clusters', 'show', 'a', 'stronger', 'concentration', 'to', 'the', 'galactic', 'plane', 'than', 'the', 'nonembedded', 'clusters', 'the', 'new', 'clusters', 'are', 'found', 'more', 'in', 'the', 'first', 'galactic', 'quadrant', 'while', 'previously', 'known', 'clusters', 'are', 'found', 'more', 'in', 'the', 'fourth', 'galactic', 'quadrant', 'the', 'spatial', 'distribution', 'of', 'the', 'combined', 'sample', 'of', 'known', 'clusters', 'and', 'new', 'clusters', 'is', 'approximately', 'symmetric', 'with', 'respect', 'to', 'the', 'galactic', 'longitude', 'we', 'estimate', 'reddenings', 'distances', 'and', 'relative', 'ages', 'of', 'the', '15', 'class', 'a', 'clusters', 'using', 'theoretical', 'isochrones', 'ten', 'of', 'them', 'are', 'relatively', 'old', 'age', '800', 'myr', 'and', 'five', 'are', 'young', 'age', 'approx4', 'myr']]
|
[-0.060085759266956265, 0.08220560888332722, -0.06212511128818009, 0.10557490389457086, -0.11398532493580235, 0.015449442249820542, 0.08494080738318847, 0.44174061688846644, -0.20826376435856297, -0.38302442681324766, 0.05893792515911306, -0.33389349053652434, -0.014858090312629219, 0.18865059217108796, -0.02407439327197412, -0.051075414818125, 0.0426193978212959, -0.024120139873982795, -0.00038550076337315103, -0.30825334875355603, 0.2861948168556108, 0.04485085332838211, 0.16042053045252164, -0.09188511417998588, 0.029178736714687382, -0.10468933296786076, -0.11251898928036018, 0.006812153826596328, -0.1767434677461584, 0.12227995112218035, 0.22109986469020954, 0.10964992210315283, 0.21402302824953848, -0.3237206726461615, -0.1828126575314126, 0.08822734659995617, 0.23219222699173658, 0.06018381453703225, -0.1143522289234602, -0.2909438798759771, 0.09663998842424615, -0.14036751924422236, -0.2375735452788424, 0.06749802967790741, 0.04822207279297528, 0.07369874673477472, -0.18244121015812811, 0.15182709870509448, -0.015214466182211124, 0.10292147611941915, -0.1210478065941915, -0.18371404128056534, -0.01981581668549562, 0.13419953593212433, -0.03200827370325711, 0.09958548385145667, 0.14104986510391332, -0.11588541107401458, -0.035025707163040154, 0.38021810203070305, -0.010617667233885925, -0.006152115036728303, 0.2304296148183578, -0.2166250512178843, -0.19957813725019521, 0.08711919778808745, 0.17663694058869095, 0.14890383137904561, -0.2425402014822447, 0.04325589914330235, -0.03272038551551696, 0.21969390371222647, 0.0723856125767883, 0.03071674910111569, 0.27002713986214516, 0.10584033765567682, 0.12029742822051048, 0.1506543660369825, -0.26395603387056366, -0.11291291449204195, -0.21797801460556232, -0.0775635852195446, -0.07663782024871846, 0.018842119769224105, -0.16878566646756146, -0.12003291829988279, 0.30304299035618976, 0.10429013536687302, 0.21739103791329017, 0.07806761239241108, 0.25519771454083984, 0.014515564356318247, 0.14167848983728096, 0.12387222879777215, 0.2793416637330424, 0.15733419790946318, 0.060950460648858784, -0.17299289285084388, 0.03193100177533719, -0.026910727592320206]
|
1,803.08235
|
Bayesian analysis of bulk viscous matter dominated universe
|
In our previous works, we have analyzed the evolution of bulk viscous matter
dominated universe with a more general form for bulk viscous coefficient,
$\zeta=\zeta_{0}+\zeta_{1}\frac{\dot{a}}{a}+\zeta_{2}\frac{\ddot{a}}{\dot{a}}$
and also carried out the dynamical system analysis. We found that the model
reasonably describes the evolution of the universe if the viscous coefficient
is a constant. In the present work we are contrasting this model with the
standard $\Lambda$CDM model of the universe using the Bayesian method. We have
shown that, even though the viscous model gives a reasonable back ground
evolution of the universe, the Bayes factor of the model indicates that, it is
not so superior over the $\Lambda$CDM model, but have a slight advantage over
it.
|
gr-qc
|
in our previous works we have analyzed the evolution of bulk viscous matter dominated universe with a more general form for bulk viscous coefficient zetazeta_0zeta_1fracdotaazeta_2fracddotadota and also carried out the dynamical system analysis we found that the model reasonably describes the evolution of the universe if the viscous coefficient is a constant in the present work we are contrasting this model with the standard lambdacdm model of the universe using the bayesian method we have shown that even though the viscous model gives a reasonable back ground evolution of the universe the bayes factor of the model indicates that it is not so superior over the lambdacdm model but have a slight advantage over it
|
[['in', 'our', 'previous', 'works', 'we', 'have', 'analyzed', 'the', 'evolution', 'of', 'bulk', 'viscous', 'matter', 'dominated', 'universe', 'with', 'a', 'more', 'general', 'form', 'for', 'bulk', 'viscous', 'coefficient', 'zetazeta_0zeta_1fracdotaazeta_2fracddotadota', 'and', 'also', 'carried', 'out', 'the', 'dynamical', 'system', 'analysis', 'we', 'found', 'that', 'the', 'model', 'reasonably', 'describes', 'the', 'evolution', 'of', 'the', 'universe', 'if', 'the', 'viscous', 'coefficient', 'is', 'a', 'constant', 'in', 'the', 'present', 'work', 'we', 'are', 'contrasting', 'this', 'model', 'with', 'the', 'standard', 'lambdacdm', 'model', 'of', 'the', 'universe', 'using', 'the', 'bayesian', 'method', 'we', 'have', 'shown', 'that', 'even', 'though', 'the', 'viscous', 'model', 'gives', 'a', 'reasonable', 'back', 'ground', 'evolution', 'of', 'the', 'universe', 'the', 'bayes', 'factor', 'of', 'the', 'model', 'indicates', 'that', 'it', 'is', 'not', 'so', 'superior', 'over', 'the', 'lambdacdm', 'model', 'but', 'have', 'a', 'slight', 'advantage', 'over', 'it']]
|
[-0.09042911947165665, 0.05500798156942453, -0.1696742592019993, 0.0627729129260651, -0.041663409619216336, -0.11055124372656441, -0.012336715281810285, 0.35650844388363656, -0.23719468319445455, -0.2892444187008343, 0.040779221960212705, -0.2471574663527702, -0.13225844192416653, 0.18925916279355684, 0.015192885213253791, 0.013990178785956743, 0.058938552043400705, 0.02066301321406571, -0.04262871032972869, -0.2977389575925803, 0.3117726791911481, 0.10747096895877468, 0.256021363583083, -0.0034385646301272666, 0.09477009233740862, -0.07286610451257347, -0.04811792284773107, 0.08214824645077451, -0.15975194168168583, 0.04602878990076613, 0.15873240941334843, 0.08703372121192188, 0.25516665353145646, -0.404607839490238, -0.2860920822264202, 0.10835930466521204, 0.1385251229522717, 0.15018133035648548, -0.027205003922414074, -0.2223339706757351, 0.07385077573800165, -0.23237829687269895, -0.10083442142135218, -0.06708216970978435, -0.012136799904207388, -0.06028378837366115, -0.21891719244600258, 0.17098555907279278, 0.07395054647783757, -0.014288318662070915, -0.1073917828708593, -0.10590078083904493, -0.02584537144611475, 0.060807692936801334, 0.09679894406438332, 0.039249946816677324, 0.10953251195646692, -0.14170318804150284, -0.03353665376964368, 0.4263725371606517, -0.14302685129836104, -0.18035295330755935, 0.16569688305944988, -0.18173412086540147, -0.10568995893271149, 0.10888447024320301, 0.09983699755710468, 0.10580576971794169, -0.14747708479530716, 0.10439235895919091, -0.08699593875197727, 0.1761622471416271, -0.004543131629920058, -0.03736814835850198, 0.22658177425986842, 0.2245296722016575, -0.002317875111067112, 0.0993207476322392, -0.04317492490946805, -0.13325373252461614, -0.3153013224844216, -0.13741259760501093, -0.15373701273806786, 0.04485116751464758, -0.11831768962394817, -0.16082242745451686, 0.38222463843780324, 0.17832793706309116, 0.1949893989959699, 0.07379785429669969, 0.28910746686814126, 0.09178348096994389, 0.05874107792981688, 0.12465163350836456, 0.3260166920362073, 0.08765339283190929, 0.12298595118377227, -0.21925569728441668, 0.09433300213953644, 0.007169348449168498]
|
1,803.08236
|
Isometries on Banach algebras of $C(Y)$-valued maps
|
We propose a unified approach to the study of isometries on algebras of
vector-valued Lipschitz maps and those of continuously differentiable maps by
means of the notion of natural $C(Y)$-valuezations that take values in unital
commutative $C^*$-algebras. A precise proof of a theorem of Jarosz \cite{ja} is
exhibited.
|
math.FA
|
we propose a unified approach to the study of isometries on algebras of vectorvalued lipschitz maps and those of continuously differentiable maps by means of the notion of natural cyvaluezations that take values in unital commutative calgebras a precise proof of a theorem of jarosz citeja is exhibited
|
[['we', 'propose', 'a', 'unified', 'approach', 'to', 'the', 'study', 'of', 'isometries', 'on', 'algebras', 'of', 'vectorvalued', 'lipschitz', 'maps', 'and', 'those', 'of', 'continuously', 'differentiable', 'maps', 'by', 'means', 'of', 'the', 'notion', 'of', 'natural', 'cyvaluezations', 'that', 'take', 'values', 'in', 'unital', 'commutative', 'calgebras', 'a', 'precise', 'proof', 'of', 'a', 'theorem', 'of', 'jarosz', 'citeja', 'is', 'exhibited']]
|
[-0.12097919470967178, 0.05379386803985614, -0.11026970769845597, 0.06618184766620802, -0.09026767422809549, -0.12350679724477232, 0.015481042189766531, 0.36547255516052246, -0.3337538378697861, -0.19130337015604196, 0.0926946085730932, -0.23375878905948333, -0.14921943709740174, 0.22314583789557219, -0.20102373901349696, 0.01223976230634751, 0.03392349592531505, 0.054019096044256636, -0.1517177474958336, -0.1911232348622592, 0.44369858956855274, -0.02990913517145521, 0.18697423255071044, 0.053788050482778446, 0.1696998931305564, 0.02851629510278935, -0.08420845562511164, 0.018234789756167193, -0.17145578513183232, 0.16584808496839326, 0.2882612072299589, 0.09854986899755085, 0.31658475943233655, -0.35745221323779097, -0.14271012420320642, 0.17844493160753147, 0.05520162524898415, -0.007831510166516122, -0.030102384269095794, -0.32972002405997203, 0.06308880013049296, -0.16998758501089786, -0.0981075183549167, -0.13520499610382578, 0.025798287850035274, 0.004218340403420608, -0.30557058589613956, 0.046508280236435974, 0.18544955808750313, 0.1307197535187816, -0.13421218664101933, -0.006328516123492433, -0.05398709808334546, 0.07969505391488581, -0.04621995542623589, 0.047869710489581135, 0.15822084297668998, -0.02491310336019682, -0.14621788715822218, 0.3159891255199909, -0.060589944093447666, -0.208160858358378, 0.13888156999145512, -0.18910702547746833, -0.18623267604119104, 0.09052441155780917, 0.11485939412175314, 0.18030898082677438, -0.12048020036688642, 0.17810196858582736, -0.15301240829791388, 0.08189713217965934, 0.05367319735840125, 0.04886162154497984, 0.11950338891018993, 0.11200814349981754, 0.1146828683913159, 0.19201721856370568, 0.1072690981976769, -0.04142783460733683, -0.32182158529758453, -0.15866109659976285, -0.11857849530592236, 0.13909829401350376, -0.12062033119772146, -0.19464640155353624, 0.42476706320176955, 0.11975191170147256, 0.22492026424278383, 0.1673701494000852, 0.23506732511779535, 0.061942885224909885, 0.09668751041728842, -0.016909809530024297, 0.1505587534452586, 0.249986947762132, 0.04578640531627056, -0.04491237858715265, -0.011492306396932057, 0.22564431111854705]
|
1,803.08237
|
Highly efficient laser-driven Compton gamma-ray source
|
The recent advancement of high-intensity lasers has made all-optical Compton
scattering become a promising way to produce ultra-short brilliant
$\gamma$-rays in an ultra-compact system. However, so far achieved Compton
$\gamma$-ray sources are severely limited by low conversion efficiency (lower
than $10^{-5}$) and spectral intensity ($\sim10^{4}$ ${\rm photons/0.1\%BW}$).
Here we present a highly efficient gamma photon emitter obtained by irradiating
a high-intensity laser pulse on a miniature plasma device consisting of a
plasma lens and a plasma mirror. This concept exploits strong spatiotemporal
laser-shaping process and high-charge electron acceleration process in the
plasma lens, as well as an efficient nonlinear Compton scattering process
enabled by the plasma mirror. Our particle-in-cell simulations demonstrate that
in this novel scheme, brilliant $\gamma$-rays with very high conversion
efficiency (higher than $10^{-2}$) and spectral intensity ($\sim10^{9}$ ${\rm
photons/0.1\%BW}$) can be achieved by employing currently available
petawatt-class lasers with intensity of $10^{21}$ ${\rm W/cm^2}$. Such
efficient and intense $\gamma$-ray sources would find applications in
wide-ranging areas.
|
physics.plasm-ph
|
the recent advancement of highintensity lasers has made alloptical compton scattering become a promising way to produce ultrashort brilliant gammarays in an ultracompact system however so far achieved compton gammaray sources are severely limited by low conversion efficiency lower than 105 and spectral intensity sim104 rm photons01bw here we present a highly efficient gamma photon emitter obtained by irradiating a highintensity laser pulse on a miniature plasma device consisting of a plasma lens and a plasma mirror this concept exploits strong spatiotemporal lasershaping process and highcharge electron acceleration process in the plasma lens as well as an efficient nonlinear compton scattering process enabled by the plasma mirror our particleincell simulations demonstrate that in this novel scheme brilliant gammarays with very high conversion efficiency higher than 102 and spectral intensity sim109 rm photons01bw can be achieved by employing currently available petawattclass lasers with intensity of 1021 rm wcm2 such efficient and intense gammaray sources would find applications in wideranging areas
|
[['the', 'recent', 'advancement', 'of', 'highintensity', 'lasers', 'has', 'made', 'alloptical', 'compton', 'scattering', 'become', 'a', 'promising', 'way', 'to', 'produce', 'ultrashort', 'brilliant', 'gammarays', 'in', 'an', 'ultracompact', 'system', 'however', 'so', 'far', 'achieved', 'compton', 'gammaray', 'sources', 'are', 'severely', 'limited', 'by', 'low', 'conversion', 'efficiency', 'lower', 'than', '105', 'and', 'spectral', 'intensity', 'sim104', 'rm', 'photons01bw', 'here', 'we', 'present', 'a', 'highly', 'efficient', 'gamma', 'photon', 'emitter', 'obtained', 'by', 'irradiating', 'a', 'highintensity', 'laser', 'pulse', 'on', 'a', 'miniature', 'plasma', 'device', 'consisting', 'of', 'a', 'plasma', 'lens', 'and', 'a', 'plasma', 'mirror', 'this', 'concept', 'exploits', 'strong', 'spatiotemporal', 'lasershaping', 'process', 'and', 'highcharge', 'electron', 'acceleration', 'process', 'in', 'the', 'plasma', 'lens', 'as', 'well', 'as', 'an', 'efficient', 'nonlinear', 'compton', 'scattering', 'process', 'enabled', 'by', 'the', 'plasma', 'mirror', 'our', 'particleincell', 'simulations', 'demonstrate', 'that', 'in', 'this', 'novel', 'scheme', 'brilliant', 'gammarays', 'with', 'very', 'high', 'conversion', 'efficiency', 'higher', 'than', '102', 'and', 'spectral', 'intensity', 'sim109', 'rm', 'photons01bw', 'can', 'be', 'achieved', 'by', 'employing', 'currently', 'available', 'petawattclass', 'lasers', 'with', 'intensity', 'of', '1021', 'rm', 'wcm2', 'such', 'efficient', 'and', 'intense', 'gammaray', 'sources', 'would', 'find', 'applications', 'in', 'wideranging', 'areas']]
|
[-0.06421936456358825, 0.2188276613046466, -0.01884563286633541, 0.08330057238810276, -0.047095029013386615, -0.13294734050092907, -0.0001974273622274781, 0.5199922076545846, -0.18876990731447363, -0.33186571253463626, 0.027044735854873672, -0.2595931776241065, -0.00640833956332734, 0.33179360501862204, -0.023123625528592713, 0.06041059033491482, 0.03891973559840176, -0.13468468017452276, 0.03251970991475854, -0.11938130212141775, 0.2115484536312019, 0.18815293002766198, 0.3235333020416781, 0.0646024453244769, 0.1557183762615284, -0.017341088621670237, 0.0036876189898556243, -0.09796564651127809, -0.043522971559258834, 0.11390961953647769, 0.2567851893627682, 0.07337916114230235, 0.23472691333303466, -0.45309110826406723, -0.29804707060639674, 0.02905529491918293, 0.20493693724095535, 0.03731883426184933, -0.15530382412357424, -0.27229622095966566, 0.0178240995737724, -0.22025001834098917, -0.13536874045026848, 0.003176205999737319, 0.02317004168453889, 0.05119744057167107, -0.26642092627783615, -0.0019021794298448814, -0.012191189544794794, 0.009923195735049935, 0.010521899695726087, -0.04284749269703379, 0.0564290614058383, -0.0393090301054494, -0.01315479052834398, 0.09602903807237266, 0.21354849030598042, -0.17397848413272116, -0.10154914504920061, 0.39279880305716336, -0.07646381576304496, -0.041047054945897214, 0.18239068820959148, -0.1939037517280294, -0.0828762262647685, 0.2748940623490713, 0.1503870683384146, 0.14926815198626942, -0.12101595212693493, 0.003058300780256291, 0.029651633493650038, 0.2284469541090612, 0.1254010555268719, 0.1005692223373514, 0.24551753194417614, 0.22449554637065516, 0.025286466157875765, 0.11634610086091413, -0.15446375347584343, 0.06965595797205773, -0.21913433652550268, -0.07427620517615324, -0.15339015194032796, 0.1274408094289426, -0.05008938096309579, -0.0865988001482597, 0.3297865566916162, 0.1450893825206619, 0.12713400093623653, -0.07115397070241997, 0.3691108324863494, 0.153923861410033, 0.01739370590971353, 0.049995656781949296, 0.3152220708747896, 0.14558590307998925, 0.11372449624841699, -0.1876528086946704, -0.00874831751272536, -0.0393743133948495]
|
1,803.08238
|
Generic immersions and totally real embeddings
|
We show that, for a closed orientable n-manifold, with n not congruent to 3
modulo 4, the existence of a CR-regular embedding into complex (n-1)-space
ensures the existence of a totally real embedding into complex n-space. This
implies that a closed orientable (4k+1)-manifold with non-vanishing Kervaire
semi-characteristic possesses no CR-regular embedding into complex 4k-space. We
also pay special attention to the cases of CR-regular embeddings of spheres and
of simply-connected 5-manifolds.
|
math.GT math.CV math.DG
|
we show that for a closed orientable nmanifold with n not congruent to 3 modulo 4 the existence of a crregular embedding into complex n1space ensures the existence of a totally real embedding into complex nspace this implies that a closed orientable 4k1manifold with nonvanishing kervaire semicharacteristic possesses no crregular embedding into complex 4kspace we also pay special attention to the cases of crregular embeddings of spheres and of simplyconnected 5manifolds
|
[['we', 'show', 'that', 'for', 'a', 'closed', 'orientable', 'nmanifold', 'with', 'n', 'not', 'congruent', 'to', '3', 'modulo', '4', 'the', 'existence', 'of', 'a', 'crregular', 'embedding', 'into', 'complex', 'n1space', 'ensures', 'the', 'existence', 'of', 'a', 'totally', 'real', 'embedding', 'into', 'complex', 'nspace', 'this', 'implies', 'that', 'a', 'closed', 'orientable', '4k1manifold', 'with', 'nonvanishing', 'kervaire', 'semicharacteristic', 'possesses', 'no', 'crregular', 'embedding', 'into', 'complex', '4kspace', 'we', 'also', 'pay', 'special', 'attention', 'to', 'the', 'cases', 'of', 'crregular', 'embeddings', 'of', 'spheres', 'and', 'of', 'simplyconnected', '5manifolds']]
|
[-0.20455497704392325, 0.07759643340672272, -0.06256144796835555, 0.08013552774007068, -0.12359313746455355, -0.19310379504779543, -0.01916042350880478, 0.37169785338683403, -0.22478079514416016, -0.21347877429798245, 0.06523112309556725, -0.28528034358042414, -0.1841501373986619, 0.1688561015188748, -0.12337816429688879, -0.07048655255441216, 0.07682231191437745, 0.10850117656577757, -0.08822459553408882, -0.29533499384811823, 0.4008512797333516, -0.15062977211293427, 0.16352884981450558, 0.10380620713197235, 0.16972821355675874, 0.026396191388746534, 0.05820128290603558, 0.06841804693046298, -0.14288528334535827, 0.14891380908143154, 0.26519355117815774, 0.09140223722257045, 0.16122652532235868, -0.41542832056681317, -0.2103246772337867, 0.26451894593681546, 0.16222901291389397, -0.05254999309292306, -0.06559219830871924, -0.2785194368520077, 0.13744674474540827, -0.06095056322173796, -0.14636604844228082, -0.10307752154092642, 0.09525512988962558, -0.08484056197862694, -0.19784572796788122, -0.054916381532667154, 0.20882189961528216, 0.07186756420718587, -0.09533355026033477, -0.07573507373909587, -0.07926691508433525, 0.11735798598037682, -0.010435642620575602, 0.07894262769327, 0.033792403418624745, -0.05924919563129652, -0.07759573398346918, 0.3919634155497171, -0.061180411203615906, -0.3332166870705027, 0.11164626093122407, -0.15107185455660024, -0.21939138360861418, 0.21420551429037005, 0.13296900796231584, 0.12418065222817054, -0.0031071112666657004, 0.21555460156599546, -0.13122608199499655, 0.14960237960263656, 0.12398670960649633, -0.06511730746116381, 0.1514981572745719, 0.11689049191772938, 0.1131571772950364, 0.18107834909840123, 0.026050535206129585, -0.05980361776723378, -0.3150447907898089, -0.2503951921303203, -0.09170203975003645, 0.225772579855402, -0.13566724830488439, -0.20507281574596098, 0.36635307354879554, -0.04389160157491764, 0.22057013055714575, 0.1395930714527334, 0.2600620673442988, -0.04223535008107623, 0.08691811606800859, 0.1314351971031747, 0.09073577089694099, 0.15678279188232144, -0.05565120360773543, -0.07746685150524844, -0.0848455812505352, 0.14069022146472032]
|
1,803.08239
|
Normal hierarchy neutrino mass model revisited with leptogenesis
|
We have studied the scenario of baryogenesis via leptogenesis in an $A_4$
flavor symmetric framework considering type I seesaw as the origin of neutrino
mass. Because of the presence of the fifth generation right handed neutrino the
model naturally generates non-zero reactor mixing angle. We have considered two
vev alignments for the extra flavon $\eta$ and studied the consequences in
detail. As a whole the additional flavon along with the extra right handed
neutrinos allow us to study thermal leptogenesis by the decay of the lightest
right handed neutrino present in the model. We have computed the
matter-antimatter asymmetry for both flavor dependent and flavor independent
leptogenesis by considering a considerably wider range of right handed neutrino
mass. Finally, we correlate the baryon asymmetry of the universe (BAU) with the
model parameters and light neutrino masses.
|
hep-ph
|
we have studied the scenario of baryogenesis via leptogenesis in an a_4 flavor symmetric framework considering type i seesaw as the origin of neutrino mass because of the presence of the fifth generation right handed neutrino the model naturally generates nonzero reactor mixing angle we have considered two vev alignments for the extra flavon eta and studied the consequences in detail as a whole the additional flavon along with the extra right handed neutrinos allow us to study thermal leptogenesis by the decay of the lightest right handed neutrino present in the model we have computed the matterantimatter asymmetry for both flavor dependent and flavor independent leptogenesis by considering a considerably wider range of right handed neutrino mass finally we correlate the baryon asymmetry of the universe bau with the model parameters and light neutrino masses
|
[['we', 'have', 'studied', 'the', 'scenario', 'of', 'baryogenesis', 'via', 'leptogenesis', 'in', 'an', 'a_4', 'flavor', 'symmetric', 'framework', 'considering', 'type', 'i', 'seesaw', 'as', 'the', 'origin', 'of', 'neutrino', 'mass', 'because', 'of', 'the', 'presence', 'of', 'the', 'fifth', 'generation', 'right', 'handed', 'neutrino', 'the', 'model', 'naturally', 'generates', 'nonzero', 'reactor', 'mixing', 'angle', 'we', 'have', 'considered', 'two', 'vev', 'alignments', 'for', 'the', 'extra', 'flavon', 'eta', 'and', 'studied', 'the', 'consequences', 'in', 'detail', 'as', 'a', 'whole', 'the', 'additional', 'flavon', 'along', 'with', 'the', 'extra', 'right', 'handed', 'neutrinos', 'allow', 'us', 'to', 'study', 'thermal', 'leptogenesis', 'by', 'the', 'decay', 'of', 'the', 'lightest', 'right', 'handed', 'neutrino', 'present', 'in', 'the', 'model', 'we', 'have', 'computed', 'the', 'matterantimatter', 'asymmetry', 'for', 'both', 'flavor', 'dependent', 'and', 'flavor', 'independent', 'leptogenesis', 'by', 'considering', 'a', 'considerably', 'wider', 'range', 'of', 'right', 'handed', 'neutrino', 'mass', 'finally', 'we', 'correlate', 'the', 'baryon', 'asymmetry', 'of', 'the', 'universe', 'bau', 'with', 'the', 'model', 'parameters', 'and', 'light', 'neutrino', 'masses']]
|
[-0.11144086962346644, 0.3140416905423669, 0.038581134872990384, 0.18209689693963704, -0.11103909963961034, -0.18404102316537105, 0.031380346864941254, 0.3401288869414095, -0.24508271762169898, -0.2769798347769264, 0.05240056156745756, -0.2304541239350596, 0.009952510772135985, 0.10552789605914287, 0.07677886367481038, -0.03376588013591519, -0.020903857479638913, -0.02173028898815734, -0.04781874348426594, -0.231657463899704, 0.30835429504890377, 0.055540555529981196, 0.20737695349517332, 0.07623676600290791, 0.11219368515508797, -0.07687882145675008, -0.06529066610314391, -0.14694028193651534, -0.08118482977699708, 0.020919550924137345, 0.09020905106273644, 0.11085769735992097, 0.06814687110497342, -0.4065369928584379, -0.1766839812249493, 0.23536932215210982, 0.19541540728909346, 0.07117718553362305, -0.1447409475547508, -0.30600951940697785, 0.07520186019075267, -0.2608087455035489, -0.14064734913271798, -0.03892598591268966, -0.06153257115853622, -0.12689678989494602, -0.3461935132783016, 0.11966824544908698, -0.06885359345880501, -0.0415355443221736, -0.033682746864060926, -0.1969732843212756, -0.05892690866911674, 0.02965541555065155, 0.24437404093623627, -0.10370325837250087, 0.1120481956831474, -0.18656903831973015, -0.09784778707441599, 0.4519222910406397, -0.08658012820909361, -0.15907890663605512, 0.037254944864852244, -0.178462694536018, -0.13606977006694412, 0.04469617023235461, 0.13960641940031884, 0.06777233068201252, -0.1562100095119711, 0.17712714842405952, -0.12818399709923303, 0.11538532021821833, 0.10067666696062695, 0.025947055697221968, 0.33623147363473166, 0.1970960935783189, 0.0684189794033848, -0.014583450892721029, -0.07773986340651069, -0.04456302125061698, -0.41724185693516014, -0.09544649030602373, -0.054390767085886395, 0.0559963545670411, -0.11139175372152428, -0.09687935789321166, 0.526248011902413, 0.154376745573245, 0.25025971572133987, -0.022629901588730076, 0.2991920018513851, 0.07279689396176871, 0.08157204811954323, -0.028157706495703143, 0.28088433549547676, 0.1584579219308901, 0.1710201667053351, -0.3069705154544756, 0.025515195338384193, 0.08975841590162258]
|
1,803.0824
|
An Analysis of Neural Language Modeling at Multiple Scales
|
Many of the leading approaches in language modeling introduce novel, complex
and specialized architectures. We take existing state-of-the-art word level
language models based on LSTMs and QRNNs and extend them to both larger
vocabularies as well as character-level granularity. When properly tuned, LSTMs
and QRNNs achieve state-of-the-art results on character-level (Penn Treebank,
enwik8) and word-level (WikiText-103) datasets, respectively. Results are
obtained in only 12 hours (WikiText-103) to 2 days (enwik8) using a single
modern GPU.
|
cs.CL cs.AI cs.NE
|
many of the leading approaches in language modeling introduce novel complex and specialized architectures we take existing stateoftheart word level language models based on lstms and qrnns and extend them to both larger vocabularies as well as characterlevel granularity when properly tuned lstms and qrnns achieve stateoftheart results on characterlevel penn treebank enwik8 and wordlevel wikitext103 datasets respectively results are obtained in only 12 hours wikitext103 to 2 days enwik8 using a single modern gpu
|
[['many', 'of', 'the', 'leading', 'approaches', 'in', 'language', 'modeling', 'introduce', 'novel', 'complex', 'and', 'specialized', 'architectures', 'we', 'take', 'existing', 'stateoftheart', 'word', 'level', 'language', 'models', 'based', 'on', 'lstms', 'and', 'qrnns', 'and', 'extend', 'them', 'to', 'both', 'larger', 'vocabularies', 'as', 'well', 'as', 'characterlevel', 'granularity', 'when', 'properly', 'tuned', 'lstms', 'and', 'qrnns', 'achieve', 'stateoftheart', 'results', 'on', 'characterlevel', 'penn', 'treebank', 'enwik8', 'and', 'wordlevel', 'wikitext103', 'datasets', 'respectively', 'results', 'are', 'obtained', 'in', 'only', '12', 'hours', 'wikitext103', 'to', '2', 'days', 'enwik8', 'using', 'a', 'single', 'modern', 'gpu']]
|
[0.0029223135486245153, -0.0005826357876261075, 0.00897058766335249, 0.12336094252765178, -0.12848528110111754, -0.2235628313012421, 0.051230907949308555, 0.4997341525306304, -0.23046256528546413, -0.37981818184256555, 0.03838439734342198, -0.29033755787648263, -0.11569303708150983, 0.2628136235599717, -0.09714191963275273, 0.07029063737640778, 0.2083559446160992, 0.05229113896687825, -0.09084889895748346, -0.35275220265922447, 0.2341178662640353, 0.02423285458392153, 0.33185574824611347, 0.025715327598154546, 0.13086852408751534, -0.08044007926558455, -0.014806294574712714, -0.08382220325370629, -0.04431430836518606, 0.16045200934012732, 0.3081926966915004, 0.15069985343764225, 0.2745712345962723, -0.4524670027568936, -0.2063312084817638, -0.018414237486819425, 0.11756008402133981, 0.0610449731584716, 0.06377038925575713, -0.3595523235450188, 0.12298964435234666, -0.21547538290421167, 0.16172170978970826, -0.20600908269484838, -0.01989322672287623, 0.016680982448160648, -0.21343689052698514, 0.04007714342325926, 0.14940267549982916, 0.10099041144053142, -0.026882896075646083, -0.22116107504814864, 0.030779760129128895, 0.15779822215942355, -0.02147744254519542, 0.10611187294319582, 0.106101069804281, -0.1654712010221556, -0.24029994977017244, 0.3713905629515648, -0.1463587337297698, -0.20428658969700336, 0.23760627313517035, -0.02111578975493709, -0.17338148818040888, 0.005666782682140668, 0.22079142537588875, 0.09268039798907314, -0.09666746583864248, 0.03536669553179915, 0.005724659816672404, 0.2744860811283191, 0.11212254233347872, -0.016318139905730885, 0.1549335341155529, 0.33045581996130446, -0.1001899257589442, 0.06790890453383326, -0.12273578938135567, -0.0624058894192179, -0.11633526971563697, -0.05400388218462467, -0.09556701023539063, -0.04675779220958551, -0.11246487082816504, -0.11443113235135872, 0.37461925161381565, 0.24258422042864064, 0.18546821917096773, 0.1800029372299711, 0.34466367011268934, -0.016739373992507658, 0.18703703109174966, 0.11746657824143768, 0.11358982688436906, -0.03314809280137221, 0.1325070675338308, -0.10118719247169793, 0.021759482737009724, 0.04294901459167401]
|
1,803.08241
|
The Structural Origin of Hydration Repulsive Force
|
In our recent works, based on the structural studies on water and interfacial
water (topmost water layer at the solute/water interface), hydration free
energy is derived and utilized to investigate the physical origin of
hydrophobic interactions. In this study, it is extended to investigate the
structural origin of hydration repulsive force. As a solute is embedded into
water, it mainly affects the structure of interfacial water, which is dependent
on the geometric shape of solute. Therefore, hydrophobic interactions may be
related to the surface roughness of solute. According to this study, hydration
repulsive force can reasonably be ascribed to the effects of surface roughness
of solutes on hydrophobic interactions. Additionally, hydration repulsive force
can only be expected as the size of surface roughness being less than Rc
(critical radius), which is in correspondence with the initial solvation
process as discussed in our recent work. Additionally, this can be demonstrated
by potential of mean force (PMF) calculated using molecular dynamics
simulations.
|
physics.chem-ph
|
in our recent works based on the structural studies on water and interfacial water topmost water layer at the solutewater interface hydration free energy is derived and utilized to investigate the physical origin of hydrophobic interactions in this study it is extended to investigate the structural origin of hydration repulsive force as a solute is embedded into water it mainly affects the structure of interfacial water which is dependent on the geometric shape of solute therefore hydrophobic interactions may be related to the surface roughness of solute according to this study hydration repulsive force can reasonably be ascribed to the effects of surface roughness of solutes on hydrophobic interactions additionally hydration repulsive force can only be expected as the size of surface roughness being less than rc critical radius which is in correspondence with the initial solvation process as discussed in our recent work additionally this can be demonstrated by potential of mean force pmf calculated using molecular dynamics simulations
|
[['in', 'our', 'recent', 'works', 'based', 'on', 'the', 'structural', 'studies', 'on', 'water', 'and', 'interfacial', 'water', 'topmost', 'water', 'layer', 'at', 'the', 'solutewater', 'interface', 'hydration', 'free', 'energy', 'is', 'derived', 'and', 'utilized', 'to', 'investigate', 'the', 'physical', 'origin', 'of', 'hydrophobic', 'interactions', 'in', 'this', 'study', 'it', 'is', 'extended', 'to', 'investigate', 'the', 'structural', 'origin', 'of', 'hydration', 'repulsive', 'force', 'as', 'a', 'solute', 'is', 'embedded', 'into', 'water', 'it', 'mainly', 'affects', 'the', 'structure', 'of', 'interfacial', 'water', 'which', 'is', 'dependent', 'on', 'the', 'geometric', 'shape', 'of', 'solute', 'therefore', 'hydrophobic', 'interactions', 'may', 'be', 'related', 'to', 'the', 'surface', 'roughness', 'of', 'solute', 'according', 'to', 'this', 'study', 'hydration', 'repulsive', 'force', 'can', 'reasonably', 'be', 'ascribed', 'to', 'the', 'effects', 'of', 'surface', 'roughness', 'of', 'solutes', 'on', 'hydrophobic', 'interactions', 'additionally', 'hydration', 'repulsive', 'force', 'can', 'only', 'be', 'expected', 'as', 'the', 'size', 'of', 'surface', 'roughness', 'being', 'less', 'than', 'rc', 'critical', 'radius', 'which', 'is', 'in', 'correspondence', 'with', 'the', 'initial', 'solvation', 'process', 'as', 'discussed', 'in', 'our', 'recent', 'work', 'additionally', 'this', 'can', 'be', 'demonstrated', 'by', 'potential', 'of', 'mean', 'force', 'pmf', 'calculated', 'using', 'molecular', 'dynamics', 'simulations']]
|
[-0.0858758854912594, 0.1724091070238501, -0.12179137697930856, 0.05749416461663941, -0.014291858533397317, -0.12359694675251376, 0.006497917670640163, 0.369722165632993, -0.28660388035641515, -0.3086225041770376, 0.004258385286084377, -0.26525069570634513, -0.1671044082264416, 0.11672465125157032, -0.010075738481828012, -0.0043021406381740235, 0.015944121674692724, -0.022157617498305627, 0.011101702597807161, -0.19243305680283812, 0.2874526259498452, 0.11370346022449666, 0.23138334508403205, 0.23760649275500328, 0.012547435576561839, -0.029606376933224966, 0.03981693508794706, 0.06997656469861795, -0.20255546896660234, 0.12947120338212698, 0.21039877240982605, -0.07622042219736613, 0.22220567346957978, -0.5046378884115257, -0.2973356430185959, 0.038892362877959386, 0.12050540432101116, 0.1267474971435149, -0.02026579914672766, -0.26195495998981644, 0.022283167589921504, -0.11169266478245846, -0.13365440757770558, -0.02409452628780855, 0.017723798140650615, 0.07640828504227101, -0.18455631206052203, 0.13441244696005014, 0.030979442367970476, 0.07944029027712532, -0.12302167197340168, -0.15155831627780572, -0.09883847306482493, 0.1182725662660232, 0.09529595289332064, 0.04524262901104521, 0.2900554173218552, -0.1138841726075043, 0.01495662451197859, 0.43282088851556183, -0.05654914868400738, -0.21190735268755817, 0.2558164256857708, -0.12241054297192022, -0.04717775776225608, 0.195039238766185, 0.17772608981176746, 0.0845451181550743, -0.18413877208113263, 0.034617524594796126, -0.0003201836974767502, 0.23925701659100013, 0.10702705777366646, -0.037916386808501554, 0.23298127788002604, 0.23050651318626478, 0.060903082543518394, 0.15700456743652466, -0.1161238379747374, -0.11013980026473291, -0.23086172173498198, -0.18480116277278286, -0.2377311585165444, 0.013383537337358576, -0.08204544202144462, -0.18525937773520126, 0.3245042143971659, 0.1166677758032165, 0.12547252650838345, -2.7046946343034508e-06, 0.2519080165584455, 0.03259758645654074, 0.0965353225619765, -0.0014534559595631436, 0.27161344988271596, 0.1249807412721566, 0.06446600769559155, -0.2928793012863025, 0.16577205083303853, 0.05956117565365275]
|
1,803.08242
|
Electron-Doping Induced Semiconductor to Metal Transitions in ZrSe2
Layers via Copper Atomic Intercalation
|
Atomic intercalation in two dimensional (2D) layered materials can engineer
the electronic structure at the atomic scale, bringing out tunable physical and
chemical properties which are quite distinct in comparison with pristine one.
Among them, electron-doped engineering induced by intercalation is an efficient
route to modulate electronic states in 2D layers. Herein, we demonstrate a
semiconducting to the metallic phase transition in zirconium diselenide (ZrSe2)
single crystal via controllable incorporation of copper (Cu) atoms. Combined
with first-principles density functional theory (DFT) calculations, our angle
resolved photoemission spectroscopy (ARPES) characterizations clearly revealed
the emergence of conduction band dispersion at M/L point of Brillouin zone due
to Cu-induced electron doping in ZrSe2 interlayers. Moreover, the field-effect
transistor (FET) fabricated on ZrSe2 displayed a n-type semiconducting
transport behavior, while the Cu-intercalated ZrSe2 posed linear Ids vs Vds
curves with metallic character shows n-type doping. The atomic intercalation
approach has high potential for realizing transparent electron-doping systems
for many specific 2D-based nano-electronics.
|
cond-mat.str-el cond-mat.mtrl-sci
|
atomic intercalation in two dimensional 2d layered materials can engineer the electronic structure at the atomic scale bringing out tunable physical and chemical properties which are quite distinct in comparison with pristine one among them electrondoped engineering induced by intercalation is an efficient route to modulate electronic states in 2d layers herein we demonstrate a semiconducting to the metallic phase transition in zirconium diselenide zrse2 single crystal via controllable incorporation of copper cu atoms combined with firstprinciples density functional theory dft calculations our angle resolved photoemission spectroscopy arpes characterizations clearly revealed the emergence of conduction band dispersion at ml point of brillouin zone due to cuinduced electron doping in zrse2 interlayers moreover the fieldeffect transistor fet fabricated on zrse2 displayed a ntype semiconducting transport behavior while the cuintercalated zrse2 posed linear ids vs vds curves with metallic character shows ntype doping the atomic intercalation approach has high potential for realizing transparent electrondoping systems for many specific 2dbased nanoelectronics
|
[['atomic', 'intercalation', 'in', 'two', 'dimensional', '2d', 'layered', 'materials', 'can', 'engineer', 'the', 'electronic', 'structure', 'at', 'the', 'atomic', 'scale', 'bringing', 'out', 'tunable', 'physical', 'and', 'chemical', 'properties', 'which', 'are', 'quite', 'distinct', 'in', 'comparison', 'with', 'pristine', 'one', 'among', 'them', 'electrondoped', 'engineering', 'induced', 'by', 'intercalation', 'is', 'an', 'efficient', 'route', 'to', 'modulate', 'electronic', 'states', 'in', '2d', 'layers', 'herein', 'we', 'demonstrate', 'a', 'semiconducting', 'to', 'the', 'metallic', 'phase', 'transition', 'in', 'zirconium', 'diselenide', 'zrse2', 'single', 'crystal', 'via', 'controllable', 'incorporation', 'of', 'copper', 'cu', 'atoms', 'combined', 'with', 'firstprinciples', 'density', 'functional', 'theory', 'dft', 'calculations', 'our', 'angle', 'resolved', 'photoemission', 'spectroscopy', 'arpes', 'characterizations', 'clearly', 'revealed', 'the', 'emergence', 'of', 'conduction', 'band', 'dispersion', 'at', 'ml', 'point', 'of', 'brillouin', 'zone', 'due', 'to', 'cuinduced', 'electron', 'doping', 'in', 'zrse2', 'interlayers', 'moreover', 'the', 'fieldeffect', 'transistor', 'fet', 'fabricated', 'on', 'zrse2', 'displayed', 'a', 'ntype', 'semiconducting', 'transport', 'behavior', 'while', 'the', 'cuintercalated', 'zrse2', 'posed', 'linear', 'ids', 'vs', 'vds', 'curves', 'with', 'metallic', 'character', 'shows', 'ntype', 'doping', 'the', 'atomic', 'intercalation', 'approach', 'has', 'high', 'potential', 'for', 'realizing', 'transparent', 'electrondoping', 'systems', 'for', 'many', 'specific', '2dbased', 'nanoelectronics']]
|
[-0.13267786952938082, 0.15594142109468428, -0.012718813609526362, -0.05549657568143963, -0.010534499547904051, -0.26289168700039434, 0.15743963345163206, 0.4709317925728009, -0.2839524854811592, -0.2749813365620337, -0.09076397155214078, -0.3737428157437074, -0.15930850027553453, 0.17838104152086756, 0.03647492107451905, 0.034730079279983374, -0.03736737740220195, -0.1813106974380539, -0.1574531571933693, -0.17873095556698693, 0.23358335241651798, 0.0494404183612264, 0.37201427541013005, 0.10556090242948525, 0.011616457821679731, -0.010172395872635931, 0.1670430310842687, 0.004839626756862183, -0.1471773239282362, 0.09819543057326169, 0.3537315184816341, -0.19678800874680746, 0.2030466880039253, -0.48898322848438086, -0.26481798588875916, -0.11113863455001236, 0.1246140481759735, 0.13421995105970463, -0.1352539330365761, -0.26653788382440946, 0.058887922120298246, -0.10917840123359303, -0.10074236902372935, -0.11674171322190403, -0.047739319971915856, -0.04338332155720873, -0.16318644831418297, 0.046309065470498505, -0.016989631604851237, 0.11132700863927772, -0.1432834050140662, -0.14956848740229925, -0.13127393337980478, 0.006702327885653211, -0.03435802248548245, 0.006965807208030992, 0.2402311252419766, -0.05578100385942498, -0.09632313946155902, 0.36078254013216193, -0.01646042384702382, -0.045851831790059805, 0.1910345504381635, -0.16291631972844584, -0.07044084387966962, 0.16086642655597033, 0.0549486136042566, 0.08693438321440422, -0.15384330721373105, 0.08493741470664634, 0.009755370707974675, 0.19567070366564956, 0.12437973896784213, 0.1346654415431232, 0.25440031549409975, 0.25231501750966323, 0.023469743125444233, 0.07469727631062976, -0.12963614578722074, 0.01033989559192965, -0.1228934947306974, -0.23450070501399475, -0.21790385103483884, 0.11215830986429288, -0.07118298063970899, -0.23145184863971757, 0.4033340350842646, 0.10690828755210946, 0.12490630375598616, -0.1383948908961095, 0.2156822507894492, 0.08638817646439022, 0.08123776138925194, -0.02158971988342561, 0.2221808982010978, 0.17931318445694103, 0.10542584638423699, -0.2915345610184241, 0.1142518877175554, -0.01328763310632468]
|
1,803.08243
|
Speech Dereverberation Using Fully Convolutional Networks
|
Speech derverberation using a single microphone is addressed in this paper.
Motivated by the recent success of the fully convolutional networks (FCN) in
many image processing applications, we investigate their applicability to
enhance the speech signal represented by short-time Fourier transform (STFT)
images. We present two variations: a "U-Net" which is an encoder-decoder
network with skip connections and a generative adversarial network (GAN) with
U-Net as generator, which yields a more intuitive cost function for training.
To evaluate our method we used the data from the REVERB challenge, and compared
our results to other methods under the same conditions. We have found that our
method outperforms the competing methods in most cases.
|
eess.AS cs.SD
|
speech derverberation using a single microphone is addressed in this paper motivated by the recent success of the fully convolutional networks fcn in many image processing applications we investigate their applicability to enhance the speech signal represented by shorttime fourier transform stft images we present two variations a unet which is an encoderdecoder network with skip connections and a generative adversarial network gan with unet as generator which yields a more intuitive cost function for training to evaluate our method we used the data from the reverb challenge and compared our results to other methods under the same conditions we have found that our method outperforms the competing methods in most cases
|
[['speech', 'derverberation', 'using', 'a', 'single', 'microphone', 'is', 'addressed', 'in', 'this', 'paper', 'motivated', 'by', 'the', 'recent', 'success', 'of', 'the', 'fully', 'convolutional', 'networks', 'fcn', 'in', 'many', 'image', 'processing', 'applications', 'we', 'investigate', 'their', 'applicability', 'to', 'enhance', 'the', 'speech', 'signal', 'represented', 'by', 'shorttime', 'fourier', 'transform', 'stft', 'images', 'we', 'present', 'two', 'variations', 'a', 'unet', 'which', 'is', 'an', 'encoderdecoder', 'network', 'with', 'skip', 'connections', 'and', 'a', 'generative', 'adversarial', 'network', 'gan', 'with', 'unet', 'as', 'generator', 'which', 'yields', 'a', 'more', 'intuitive', 'cost', 'function', 'for', 'training', 'to', 'evaluate', 'our', 'method', 'we', 'used', 'the', 'data', 'from', 'the', 'reverb', 'challenge', 'and', 'compared', 'our', 'results', 'to', 'other', 'methods', 'under', 'the', 'same', 'conditions', 'we', 'have', 'found', 'that', 'our', 'method', 'outperforms', 'the', 'competing', 'methods', 'in', 'most', 'cases']]
|
[-0.02851080676637221, -0.03777191628424581, -0.07000940930735958, 0.06174277091033857, -0.06585193947922471, -0.1617302590611953, -0.013063054650325564, 0.49128140052696606, -0.2616910548001813, -0.27791726911075515, 0.06480518210079386, -0.266982446365931, -0.2682783599640872, 0.22087351225006083, -0.1638875050042328, 0.11834837891987886, 0.14136141085124634, 0.028979873685334046, -0.08234303984172256, -0.2888895958401934, 0.27502371263921027, 0.02389499297583694, 0.35738258935544676, -0.0011946369358574393, 0.11780130829313887, -0.04420471494715359, -0.02473407413135073, -0.04313745318065664, -0.052693460067759816, 0.1797453065377635, 0.2926379459897509, 0.17716354562959694, 0.3128931663955587, -0.45482527268295353, -0.27189371163478576, 0.08993108102397339, 0.12491539452929755, 0.10695557421081708, -0.0637324712023418, -0.37053343565580815, 0.11017679568245872, -0.17207272479159608, 0.050961133038629314, -0.11454963513968831, -0.06382942948435845, -0.003909082525317465, -0.2968899540200427, 0.041621145800695765, 0.07252201066260133, 0.029247058286994428, -0.03691126390880494, -0.09770844827263474, 0.04052268762166637, 0.146193315090427, 0.048764313923547395, 0.09467048875081378, 0.11516492128338632, -0.1724295978562729, -0.14911033625521505, 0.34365148206350504, -0.09892657980624889, -0.2395602964173671, 0.18751200290212222, -0.033192772472797484, -0.15124166535993888, 0.09307467841820137, 0.20193709569840548, 0.12718365284790462, -0.18468267636726032, -0.010439429817058414, -0.020057341218128934, 0.1833154274201071, 0.06002412861011721, -0.001285871234932193, 0.10682390307848183, 0.27145846656246764, 0.012540600590328141, 0.19128593500663718, -0.17099856753909104, -0.02913053205912211, -0.20717937548787477, -0.0851866743959453, -0.24229654763732944, -0.0527801393648727, -0.08263740977581784, -0.1390525579687443, 0.4551071641832456, 0.24422428005601507, 0.21833933410780118, 0.13253545798654962, 0.358696335641382, 0.045224333171489405, 0.14374698246283843, 0.06852808361034002, 0.18269132054620632, 0.07317415912434258, 0.13916223308256082, -0.1530508126639803, 0.07622524574168262, 0.048260460884587186]
|
1,803.08244
|
Unsupervised Adversarial Learning of 3D Human Pose from 2D Joint
Locations
|
The task of three-dimensional (3D) human pose estimation from a single image
can be divided into two parts: (1) Two-dimensional (2D) human joint detection
from the image and (2) estimating a 3D pose from the 2D joints. Herein, we
focus on the second part, i.e., a 3D pose estimation from 2D joint locations.
The problem with existing methods is that they require either (1) a 3D pose
dataset or (2) 2D joint locations in consecutive frames taken from a video
sequence. We aim to solve these problems. For the first time, we propose a
method that learns a 3D human pose without any 3D datasets. Our method can
predict a 3D pose from 2D joint locations in a single image. Our system is
based on the generative adversarial networks, and the networks are trained in
an unsupervised manner. Our primary idea is that, if the network can predict a
3D human pose correctly, the 3D pose that is projected onto a 2D plane should
not collapse even if it is rotated perpendicularly. We evaluated the
performance of our method using Human3.6M and the MPII dataset and showed that
our network can predict a 3D pose well even if the 3D dataset is not available
during training.
|
cs.CV
|
the task of threedimensional 3d human pose estimation from a single image can be divided into two parts 1 twodimensional 2d human joint detection from the image and 2 estimating a 3d pose from the 2d joints herein we focus on the second part ie a 3d pose estimation from 2d joint locations the problem with existing methods is that they require either 1 a 3d pose dataset or 2 2d joint locations in consecutive frames taken from a video sequence we aim to solve these problems for the first time we propose a method that learns a 3d human pose without any 3d datasets our method can predict a 3d pose from 2d joint locations in a single image our system is based on the generative adversarial networks and the networks are trained in an unsupervised manner our primary idea is that if the network can predict a 3d human pose correctly the 3d pose that is projected onto a 2d plane should not collapse even if it is rotated perpendicularly we evaluated the performance of our method using human36m and the mpii dataset and showed that our network can predict a 3d pose well even if the 3d dataset is not available during training
|
[['the', 'task', 'of', 'threedimensional', '3d', 'human', 'pose', 'estimation', 'from', 'a', 'single', 'image', 'can', 'be', 'divided', 'into', 'two', 'parts', '1', 'twodimensional', '2d', 'human', 'joint', 'detection', 'from', 'the', 'image', 'and', '2', 'estimating', 'a', '3d', 'pose', 'from', 'the', '2d', 'joints', 'herein', 'we', 'focus', 'on', 'the', 'second', 'part', 'ie', 'a', '3d', 'pose', 'estimation', 'from', '2d', 'joint', 'locations', 'the', 'problem', 'with', 'existing', 'methods', 'is', 'that', 'they', 'require', 'either', '1', 'a', '3d', 'pose', 'dataset', 'or', '2', '2d', 'joint', 'locations', 'in', 'consecutive', 'frames', 'taken', 'from', 'a', 'video', 'sequence', 'we', 'aim', 'to', 'solve', 'these', 'problems', 'for', 'the', 'first', 'time', 'we', 'propose', 'a', 'method', 'that', 'learns', 'a', '3d', 'human', 'pose', 'without', 'any', '3d', 'datasets', 'our', 'method', 'can', 'predict', 'a', '3d', 'pose', 'from', '2d', 'joint', 'locations', 'in', 'a', 'single', 'image', 'our', 'system', 'is', 'based', 'on', 'the', 'generative', 'adversarial', 'networks', 'and', 'the', 'networks', 'are', 'trained', 'in', 'an', 'unsupervised', 'manner', 'our', 'primary', 'idea', 'is', 'that', 'if', 'the', 'network', 'can', 'predict', 'a', '3d', 'human', 'pose', 'correctly', 'the', '3d', 'pose', 'that', 'is', 'projected', 'onto', 'a', '2d', 'plane', 'should', 'not', 'collapse', 'even', 'if', 'it', 'is', 'rotated', 'perpendicularly', 'we', 'evaluated', 'the', 'performance', 'of', 'our', 'method', 'using', 'human36m', 'and', 'the', 'mpii', 'dataset', 'and', 'showed', 'that', 'our', 'network', 'can', 'predict', 'a', '3d', 'pose', 'well', 'even', 'if', 'the', '3d', 'dataset', 'is', 'not', 'available', 'during', 'training']]
|
[-0.027718081238489706, -0.016089660383902776, -0.03898629328254068, 0.013292979320185711, -0.06134634592018805, -0.17727116933002054, -0.04407026629965047, 0.458011628716316, -0.2552387025591565, -0.3518811524031883, 0.0951672771146512, -0.2715766483203517, -0.21496603912696496, 0.18654419091028315, -0.16715579247949824, 0.09149866956071386, 0.17849401457379888, 0.051022389535204445, -0.08523192307387661, -0.22948783537648726, 0.3196429300632834, -0.04535184464715783, 0.3122664062663443, -0.02580433914401722, 0.13234531084410123, -0.010959858184418126, 0.0021416263261219955, 0.032345738993207154, -0.04720924749326337, 0.17432449804223368, 0.2375936140973139, 0.18085654804627727, 0.2766677479178292, -0.4671898931479624, -0.24921504869713512, 0.06547613815377348, 0.1440727868189728, 0.1593111525296072, -0.06605836272395658, -0.3787438697995419, 0.09778844071235689, -0.11694817441838874, 0.014966949463360807, -0.06549010654341755, -0.03683106780495241, -0.05067130768201449, -0.3194900580808448, 0.06789471852385158, 0.05425331536714367, 0.02907847158737408, -0.09937555746071366, -0.06707623217015266, -0.0338190155017904, 0.2705055254418855, -0.008111048103264958, 0.10224251222606857, 0.13080690408383217, -0.20505824721942756, -0.10904198707741442, 0.42804025732957335, -0.00914575365141432, -0.2773843270373865, 0.1817633225141744, -0.09864958958955734, -0.11629623804666392, 0.1387833656688917, 0.23791330262738308, 0.14665171525269313, -0.12019637286509342, 0.004455659819938677, -0.12311848276068718, 0.23296006572279102, -0.014169635723607198, -0.10947582171551738, 0.25159532674085305, 0.21860138292523842, 0.02547741671165144, 0.11661802603381695, -0.26780680070622165, 0.007515804010253508, -0.20735590549601804, -0.12877417643762473, -0.25582256734436737, 0.0030065490549161253, -0.09146019935272227, -0.14671306282132685, 0.4245232802869987, 0.22960294981586557, 0.25014146417040306, 0.11028281705526327, 0.37378618153698234, 0.012665210721801821, 0.08387246971539655, 0.07420242774877833, 0.1808990147620331, -0.06952549010239432, 0.09477512196194633, -0.15131569820474855, 0.054595588966390315, 0.09743561411448257]
|
1,803.08245
|
Joint Quantum-State and Measurement Tomography with Incomplete
Measurements
|
Estimation of quantum states and measurements is crucial for the
implementation of quantum information protocols. The standard method for each
is quantum tomography. However, quantum tomography suffers from systematic
errors caused by imperfect knowledge of the system. We present a procedure to
simultaneously characterize quantum states and measurements that mitigates
systematic errors by use of a single high-fidelity state preparation and a
limited set of high-fidelity unitary operations. Such states and operations are
typical of many state-of-the-art systems. For this situation we design a set of
experiments and an optimization algorithm that alternates between maximizing
the likelihood with respect to the states and measurements to produce estimates
of each. In some cases, the procedure does not enable unique estimation of the
states. For these cases, we show how one may identify a set of density matrices
compatible with the measurements and use a semi-definite program to place
bounds on the state's expectation values. We demonstrate the procedure on data
from a simulated experiment with two trapped ions.
|
quant-ph
|
estimation of quantum states and measurements is crucial for the implementation of quantum information protocols the standard method for each is quantum tomography however quantum tomography suffers from systematic errors caused by imperfect knowledge of the system we present a procedure to simultaneously characterize quantum states and measurements that mitigates systematic errors by use of a single highfidelity state preparation and a limited set of highfidelity unitary operations such states and operations are typical of many stateoftheart systems for this situation we design a set of experiments and an optimization algorithm that alternates between maximizing the likelihood with respect to the states and measurements to produce estimates of each in some cases the procedure does not enable unique estimation of the states for these cases we show how one may identify a set of density matrices compatible with the measurements and use a semidefinite program to place bounds on the states expectation values we demonstrate the procedure on data from a simulated experiment with two trapped ions
|
[['estimation', 'of', 'quantum', 'states', 'and', 'measurements', 'is', 'crucial', 'for', 'the', 'implementation', 'of', 'quantum', 'information', 'protocols', 'the', 'standard', 'method', 'for', 'each', 'is', 'quantum', 'tomography', 'however', 'quantum', 'tomography', 'suffers', 'from', 'systematic', 'errors', 'caused', 'by', 'imperfect', 'knowledge', 'of', 'the', 'system', 'we', 'present', 'a', 'procedure', 'to', 'simultaneously', 'characterize', 'quantum', 'states', 'and', 'measurements', 'that', 'mitigates', 'systematic', 'errors', 'by', 'use', 'of', 'a', 'single', 'highfidelity', 'state', 'preparation', 'and', 'a', 'limited', 'set', 'of', 'highfidelity', 'unitary', 'operations', 'such', 'states', 'and', 'operations', 'are', 'typical', 'of', 'many', 'stateoftheart', 'systems', 'for', 'this', 'situation', 'we', 'design', 'a', 'set', 'of', 'experiments', 'and', 'an', 'optimization', 'algorithm', 'that', 'alternates', 'between', 'maximizing', 'the', 'likelihood', 'with', 'respect', 'to', 'the', 'states', 'and', 'measurements', 'to', 'produce', 'estimates', 'of', 'each', 'in', 'some', 'cases', 'the', 'procedure', 'does', 'not', 'enable', 'unique', 'estimation', 'of', 'the', 'states', 'for', 'these', 'cases', 'we', 'show', 'how', 'one', 'may', 'identify', 'a', 'set', 'of', 'density', 'matrices', 'compatible', 'with', 'the', 'measurements', 'and', 'use', 'a', 'semidefinite', 'program', 'to', 'place', 'bounds', 'on', 'the', 'states', 'expectation', 'values', 'we', 'demonstrate', 'the', 'procedure', 'on', 'data', 'from', 'a', 'simulated', 'experiment', 'with', 'two', 'trapped', 'ions']]
|
[-0.09989739469430983, 0.10012367942510242, -0.06832201860727977, 0.028767806686276938, 0.009405366752943593, -0.15938051439498266, 0.10490560415619148, 0.3676506611602214, -0.25260182830970734, -0.3277869719616695, 0.1263759062492322, -0.2871840356927209, -0.11440828156275508, 0.248204537260229, -0.07489299181706556, 0.12269587446400453, 0.1408335040407088, 0.0012791059440012999, -0.1276245683900075, -0.2103883960579862, 0.30695602444034004, 0.039871026363787046, 0.2936867051283846, 0.005816342933716888, 0.12889789444781996, 0.025971904919834105, -0.003982775599255177, 0.015559466791486133, -0.10008173845166377, 0.11457788804894548, 0.25434051970058974, 0.17720106281451659, 0.2754501964238857, -0.4347464735870679, -0.177074916556221, 0.12228189756770334, 0.08529206218398706, 0.19088660823432227, -0.04377526356727108, -0.3007802007452189, 0.04679607959118432, -0.138821836371354, -0.06157155098215102, -0.12888074859218326, -0.04457535970019188, -0.028841870143301338, -0.3146952694497339, 0.06276082976241625, 0.014820161893194218, 0.022364594371331308, -0.030726291225319672, -0.09016043348391234, 0.03380231941425559, 0.14256938456830953, -0.045549513563000694, -0.013689161956932084, 0.14108721059774923, -0.12182926088236942, -0.17635990605650548, 0.35238062365058653, -0.028220840264111757, -0.20260407955491702, 0.16784652181438164, -0.1083931601439006, -0.13729446400709808, 0.09310644310146213, 0.1724569123195802, 0.11798933508086526, -0.12102849605286907, 0.04191225065332475, -0.018694020175475428, 0.19187338641303742, -0.01680736581120127, 0.06961633205625736, 0.18299739563859954, 0.11586516433601786, 0.10437260705853595, 0.13366697270640668, -0.1128445327097918, -0.09263630475413924, -0.31577775286633275, -0.1674664629843577, -0.21011830055333316, 0.020505003214337653, -0.04063119422750684, -0.15072314266999348, 0.40593826098222574, 0.18143656787749737, 0.20799333965238517, 0.027213071477125414, 0.3353546873337316, 0.08816572974258574, 0.05150170104221223, 0.07814128639617053, 0.218270381132711, 0.14164031858550397, 0.03165417399904328, -0.23347929500400305, 0.09082786922627491, -0.012074608598350587]
|
1,803.08246
|
Time-resolved quantum spin transport through an Aharonov-Casher ring
|
After obtaining an exact analytical time-varying solution for the
Aharonov-Casher conducting ring embedded in a textured static/dynamic electric
field, we investigate the spin-resolved quantum transport in the structure. It
is shown that the interference patterns are governed by not only the
Aharonov-Casher geometry phase but also the instantaneous phase difference of
spin precession through different traveling paths. This dynamic phase is
determined by the strength of applied electric field and can have substantial
effects on the charge/spin conductances, especially in the weak field regime as
the period of spin precession comparable to that of the orbital motion. Our
studies suggest that a low-frequency normal electric field with moderate
strength possesses more degrees of freedom for manipulating the spin
interference of incident electrons.
|
cond-mat.mes-hall
|
after obtaining an exact analytical timevarying solution for the aharonovcasher conducting ring embedded in a textured staticdynamic electric field we investigate the spinresolved quantum transport in the structure it is shown that the interference patterns are governed by not only the aharonovcasher geometry phase but also the instantaneous phase difference of spin precession through different traveling paths this dynamic phase is determined by the strength of applied electric field and can have substantial effects on the chargespin conductances especially in the weak field regime as the period of spin precession comparable to that of the orbital motion our studies suggest that a lowfrequency normal electric field with moderate strength possesses more degrees of freedom for manipulating the spin interference of incident electrons
|
[['after', 'obtaining', 'an', 'exact', 'analytical', 'timevarying', 'solution', 'for', 'the', 'aharonovcasher', 'conducting', 'ring', 'embedded', 'in', 'a', 'textured', 'staticdynamic', 'electric', 'field', 'we', 'investigate', 'the', 'spinresolved', 'quantum', 'transport', 'in', 'the', 'structure', 'it', 'is', 'shown', 'that', 'the', 'interference', 'patterns', 'are', 'governed', 'by', 'not', 'only', 'the', 'aharonovcasher', 'geometry', 'phase', 'but', 'also', 'the', 'instantaneous', 'phase', 'difference', 'of', 'spin', 'precession', 'through', 'different', 'traveling', 'paths', 'this', 'dynamic', 'phase', 'is', 'determined', 'by', 'the', 'strength', 'of', 'applied', 'electric', 'field', 'and', 'can', 'have', 'substantial', 'effects', 'on', 'the', 'chargespin', 'conductances', 'especially', 'in', 'the', 'weak', 'field', 'regime', 'as', 'the', 'period', 'of', 'spin', 'precession', 'comparable', 'to', 'that', 'of', 'the', 'orbital', 'motion', 'our', 'studies', 'suggest', 'that', 'a', 'lowfrequency', 'normal', 'electric', 'field', 'with', 'moderate', 'strength', 'possesses', 'more', 'degrees', 'of', 'freedom', 'for', 'manipulating', 'the', 'spin', 'interference', 'of', 'incident', 'electrons']]
|
[-0.25825476306719614, 0.21384691505907122, -0.06049074582205933, 0.028706278626188696, -0.06267700739563672, -0.11233820237952177, 0.025875509342514588, 0.38155544610297093, -0.2757048312437217, -0.29070192754848817, 0.02142613098792518, -0.22194267813971297, -0.15249667228123204, 0.20178743588860285, 0.009699050619526476, -0.031221615037972442, 0.007320654807520695, 0.01706715608321008, -0.0661505572431049, -0.16012024504445554, 0.2768203830528364, 0.024509608328579086, 0.30559316459188207, 0.04521759238750597, 0.08083528172240027, 0.07386926757782454, 0.06424028424381042, 0.07803502648335989, -0.09259895253519777, 0.02987392576502972, 0.20891992436324963, -0.02917057356308596, 0.17482603538292843, -0.47933606049961974, -0.21497069477088382, 0.03013046631650602, 0.1361680761872806, 0.15987081180677795, -0.07863495137018141, -0.3045427791514724, 0.025997234460206884, -0.14078696095193813, -0.13913897963142458, -0.0805348483387564, 0.04645686660374164, 0.03530129073493061, -0.2601326275955634, 0.09161851064804903, 0.0665665425352569, 0.07278718921493312, -0.060068846292809015, -0.09515255722064586, -0.043486775473508314, 0.09874772775124331, 0.06752270737044574, 0.05674794422783202, 0.14303133072647395, -0.1658817709664066, -0.11910575680190423, 0.33131907397087235, -0.07081078837976837, -0.1955334851639937, 0.13149068624804133, -0.21318801378709126, -0.013723717666551715, 0.19242596077602966, 0.1435380835910557, 0.1179490798672081, -0.1464494627821221, 0.07386178383937671, -0.006905526623175648, 0.16401108493360492, 0.057394257864960635, 0.06384950330801552, 0.28386048687102855, 0.12409018973255011, 0.07228437183662433, 0.14267870600594848, -0.13270991334699278, -0.12646929318200775, -0.24687621853940311, -0.11022295212262448, -0.19528896660070683, 0.0640248925059883, -0.08897434494667592, -0.1567491992063282, 0.44068225155599783, 0.15757361506436357, 0.12303810038405363, -0.05029133804234081, 0.30408532178548514, 0.15965001992346933, 0.03966504884618964, 0.059622471978445155, 0.3132828350377376, 0.19397994724758824, 0.09788948847896985, -0.33526573345813226, 0.07948132651690089, -0.02154684650757518]
|
1,803.08247
|
Statistical approach to flow stress and generalized Hall-Petch law for
equilibrium polycrystalline materials
|
A theory of flow stress, including the yield strength is proposed for the
class of PC materials with equilibrium defect structure (EDS), which is
established in the PC material after series of $N_0$ similar treatments of
severe plastic deformation at fixed temperature T and characterized by
stabilized scalar dislocation density (SDD) and average grain size d. We
calculate both the stationary SDD $\rho(b,d,T)$ and suggest a way to calculate
$\varepsilon$-evolution of an equilibrium SDD $\rho_{\varepsilon}$ in PC sample
under quasy-static loading depending on the average size $d$ of a grain in the
range of $10^{-8}- 10^{-2}$ m, on grain boundaries orientation. The analytical
dependence is realized within a disclination-dislocation mechanism in
approximation of single dislocation ensemble for given phase and T. It is based
on a statistical model of Boltzmann-like distribution (smoothly dependent on a
strain ${\varepsilon}$) for discrete energy spectrum in each grain of a
single-mode one-phase PC material with respect to quasi-stationary levels under
plastic loading with the highest level equal to the energy of dislocation with
maximal length. The difference of equilibrium SDD, $\rho_{\varepsilon}- \rho$,
leads to a flow stress from the Taylor strain hardening mechanism containing
(for $\varepsilon$ = $0.002$) the normal and anomalous Hall-Petch relations for
coarse and nanocrystalline grains, respectively, and gains a maximum at floe
stress values for an extreme size containing $d_0$ of order $10^{-8}- 10^{-7}$
m. The maximum undergoes a shift to the region of larger grains for decreasing
temperatures, revealing temperature-dimension effect. Coincidence is well
established between the theoretical and experimental data on ${\sigma}_y$ for
the materials with EDS with BCC (${\alpha}$-Fe), FCC (Cu, Al, Ni) and HCP
(${\alpha}$-Ti, Zr) crystal lattices with closely packed grains at T=300K.
|
cond-mat.mtrl-sci cond-mat.mes-hall cond-mat.soft cond-mat.stat-mech
|
a theory of flow stress including the yield strength is proposed for the class of pc materials with equilibrium defect structure eds which is established in the pc material after series of n_0 similar treatments of severe plastic deformation at fixed temperature t and characterized by stabilized scalar dislocation density sdd and average grain size d we calculate both the stationary sdd rhobdt and suggest a way to calculate varepsilonevolution of an equilibrium sdd rho_varepsilon in pc sample under quasystatic loading depending on the average size d of a grain in the range of 108 102 m on grain boundaries orientation the analytical dependence is realized within a disclinationdislocation mechanism in approximation of single dislocation ensemble for given phase and t it is based on a statistical model of boltzmannlike distribution smoothly dependent on a strain varepsilon for discrete energy spectrum in each grain of a singlemode onephase pc material with respect to quasistationary levels under plastic loading with the highest level equal to the energy of dislocation with maximal length the difference of equilibrium sdd rho_varepsilon rho leads to a flow stress from the taylor strain hardening mechanism containing for varepsilon 0002 the normal and anomalous hallpetch relations for coarse and nanocrystalline grains respectively and gains a maximum at floe stress values for an extreme size containing d_0 of order 108 107 m the maximum undergoes a shift to the region of larger grains for decreasing temperatures revealing temperaturedimension effect coincidence is well established between the theoretical and experimental data on sigma_y for the materials with eds with bcc alphafe fcc cu al ni and hcp alphati zr crystal lattices with closely packed grains at t300k
|
[['a', 'theory', 'of', 'flow', 'stress', 'including', 'the', 'yield', 'strength', 'is', 'proposed', 'for', 'the', 'class', 'of', 'pc', 'materials', 'with', 'equilibrium', 'defect', 'structure', 'eds', 'which', 'is', 'established', 'in', 'the', 'pc', 'material', 'after', 'series', 'of', 'n_0', 'similar', 'treatments', 'of', 'severe', 'plastic', 'deformation', 'at', 'fixed', 'temperature', 't', 'and', 'characterized', 'by', 'stabilized', 'scalar', 'dislocation', 'density', 'sdd', 'and', 'average', 'grain', 'size', 'd', 'we', 'calculate', 'both', 'the', 'stationary', 'sdd', 'rhobdt', 'and', 'suggest', 'a', 'way', 'to', 'calculate', 'varepsilonevolution', 'of', 'an', 'equilibrium', 'sdd', 'rho_varepsilon', 'in', 'pc', 'sample', 'under', 'quasystatic', 'loading', 'depending', 'on', 'the', 'average', 'size', 'd', 'of', 'a', 'grain', 'in', 'the', 'range', 'of', '108', '102', 'm', 'on', 'grain', 'boundaries', 'orientation', 'the', 'analytical', 'dependence', 'is', 'realized', 'within', 'a', 'disclinationdislocation', 'mechanism', 'in', 'approximation', 'of', 'single', 'dislocation', 'ensemble', 'for', 'given', 'phase', 'and', 't', 'it', 'is', 'based', 'on', 'a', 'statistical', 'model', 'of', 'boltzmannlike', 'distribution', 'smoothly', 'dependent', 'on', 'a', 'strain', 'varepsilon', 'for', 'discrete', 'energy', 'spectrum', 'in', 'each', 'grain', 'of', 'a', 'singlemode', 'onephase', 'pc', 'material', 'with', 'respect', 'to', 'quasistationary', 'levels', 'under', 'plastic', 'loading', 'with', 'the', 'highest', 'level', 'equal', 'to', 'the', 'energy', 'of', 'dislocation', 'with', 'maximal', 'length', 'the', 'difference', 'of', 'equilibrium', 'sdd', 'rho_varepsilon', 'rho', 'leads', 'to', 'a', 'flow', 'stress', 'from', 'the', 'taylor', 'strain', 'hardening', 'mechanism', 'containing', 'for', 'varepsilon', '0002', 'the', 'normal', 'and', 'anomalous', 'hallpetch', 'relations', 'for', 'coarse', 'and', 'nanocrystalline', 'grains', 'respectively', 'and', 'gains', 'a', 'maximum', 'at', 'floe', 'stress', 'values', 'for', 'an', 'extreme', 'size', 'containing', 'd_0', 'of', 'order', '108', '107', 'm', 'the', 'maximum', 'undergoes', 'a', 'shift', 'to', 'the', 'region', 'of', 'larger', 'grains', 'for', 'decreasing', 'temperatures', 'revealing', 'temperaturedimension', 'effect', 'coincidence', 'is', 'well', 'established', 'between', 'the', 'theoretical', 'and', 'experimental', 'data', 'on', 'sigma_y', 'for', 'the', 'materials', 'with', 'eds', 'with', 'bcc', 'alphafe', 'fcc', 'cu', 'al', 'ni', 'and', 'hcp', 'alphati', 'zr', 'crystal', 'lattices', 'with', 'closely', 'packed', 'grains', 'at', 't300k']]
|
[-0.0976990887960282, 0.19334622178158659, -0.05714425555748569, -0.036063599071520215, 0.021330868795356603, -0.11532504941586762, 0.06544927487608648, 0.38280681939795613, -0.24347214152872124, -0.3154889830991177, 0.046260266234800354, -0.2867088416858357, -0.03318202128267491, 0.14447871580469998, 0.007833575598637895, 0.04711433287727285, -0.006279264147023615, 0.015867170361375697, -0.1031055270543541, -0.21135176988344243, 0.2549174081539283, 0.08133242094738628, 0.31585724856909914, 0.04159639029346769, 0.0929761062918046, -0.03037119931550211, 0.042121726956632785, 0.049494731467241176, -0.2025785201763296, 0.06053325079847127, 0.19732875750068, -0.033396779124707204, 0.20112999238720958, -0.4176983231615636, -0.2055647479437004, 0.04332254843800055, 0.08317764203649644, 0.061270629586086964, -0.012943412617246127, -0.2028992031238672, 0.1192482423303933, -0.12622833043916912, -0.13812065023247508, 0.0195898313939003, 0.09345037894843913, 0.010683927378576139, -0.3034683754151903, 0.15127088481847964, 0.03788827876226552, 0.09067415238635423, -0.11064722110955592, -0.16558874663229184, -0.07640369208991829, 0.023132876900276374, 0.023660001208447606, 0.026957424370052382, 0.1982051403973695, -0.07984129139068126, -0.02162116196268471, 0.40005526664968144, -0.05791819961065331, -0.12574055827195374, 0.1555795838315081, -0.16469631218334305, -0.06703900844920152, 0.20559367846598273, 0.15975282447363817, 0.08309396042365252, -0.09737710541423225, 0.05443174196967876, 0.0017150272722253302, 0.201562305645305, 0.10337237723048448, -0.007029794645324514, 0.1893966549413402, 0.1929829868758508, 0.0577074932773351, 0.13642073544050456, -0.1329241155707517, -0.07515444716131349, -0.2848055486409815, -0.1431255558760741, -0.18550484172951923, 0.06452373493469649, -0.18741900016854796, -0.19503367167935187, 0.3053856507459012, 0.060677770118619426, 0.21683276865651885, 0.03322715631314649, 0.1936587812481722, 0.07901508595986183, 0.05746121559358846, 0.09293378895124667, 0.20956388427037062, 0.18069816520737197, 0.08930742144516177, -0.26394546801320223, 0.09217851907049086, 0.03874507140768829]
|
1,803.08248
|
Controlling systematic frequency uncertainties at the $10^{-19}$ level
in linear Coulomb crystals
|
Trapped ions are ideally suited for precision spectroscopy, as is evident
from the remarkably low systematic uncertainties of single-ion clocks. The
major weakness of these clocks is the long averaging time, necessitated by the
low signal of a single atom. An increased number of ions can overcome this
limitation and allow for the implementation of novel clock schemes. However,
this presents the challenge to maintain the excellent control over systematic
shifts of a single particle in spatially extended and strongly coupled
many-body systems. We measure and deduce systematic frequency uncertainties
related to spectroscopy with ion chains in a newly developed rf trap array
designed for precision spectroscopy on simultaneously trapped ion ensembles.
For the example of an In${}^+$ clock, sympathetically cooled with Yb${}^+$
ions, we show in our system that the expected systematic frequency
uncertainties related to multi-ion operation can be below $1\times10^{-19}$.
Our results pave the way to advanced spectroscopy schemes such as entangled
clock spectroscopy and cascaded clock operation.
|
physics.atom-ph quant-ph
|
trapped ions are ideally suited for precision spectroscopy as is evident from the remarkably low systematic uncertainties of singleion clocks the major weakness of these clocks is the long averaging time necessitated by the low signal of a single atom an increased number of ions can overcome this limitation and allow for the implementation of novel clock schemes however this presents the challenge to maintain the excellent control over systematic shifts of a single particle in spatially extended and strongly coupled manybody systems we measure and deduce systematic frequency uncertainties related to spectroscopy with ion chains in a newly developed rf trap array designed for precision spectroscopy on simultaneously trapped ion ensembles for the example of an in clock sympathetically cooled with yb ions we show in our system that the expected systematic frequency uncertainties related to multiion operation can be below 1times1019 our results pave the way to advanced spectroscopy schemes such as entangled clock spectroscopy and cascaded clock operation
|
[['trapped', 'ions', 'are', 'ideally', 'suited', 'for', 'precision', 'spectroscopy', 'as', 'is', 'evident', 'from', 'the', 'remarkably', 'low', 'systematic', 'uncertainties', 'of', 'singleion', 'clocks', 'the', 'major', 'weakness', 'of', 'these', 'clocks', 'is', 'the', 'long', 'averaging', 'time', 'necessitated', 'by', 'the', 'low', 'signal', 'of', 'a', 'single', 'atom', 'an', 'increased', 'number', 'of', 'ions', 'can', 'overcome', 'this', 'limitation', 'and', 'allow', 'for', 'the', 'implementation', 'of', 'novel', 'clock', 'schemes', 'however', 'this', 'presents', 'the', 'challenge', 'to', 'maintain', 'the', 'excellent', 'control', 'over', 'systematic', 'shifts', 'of', 'a', 'single', 'particle', 'in', 'spatially', 'extended', 'and', 'strongly', 'coupled', 'manybody', 'systems', 'we', 'measure', 'and', 'deduce', 'systematic', 'frequency', 'uncertainties', 'related', 'to', 'spectroscopy', 'with', 'ion', 'chains', 'in', 'a', 'newly', 'developed', 'rf', 'trap', 'array', 'designed', 'for', 'precision', 'spectroscopy', 'on', 'simultaneously', 'trapped', 'ion', 'ensembles', 'for', 'the', 'example', 'of', 'an', 'in', 'clock', 'sympathetically', 'cooled', 'with', 'yb', 'ions', 'we', 'show', 'in', 'our', 'system', 'that', 'the', 'expected', 'systematic', 'frequency', 'uncertainties', 'related', 'to', 'multiion', 'operation', 'can', 'be', 'below', '1times1019', 'our', 'results', 'pave', 'the', 'way', 'to', 'advanced', 'spectroscopy', 'schemes', 'such', 'as', 'entangled', 'clock', 'spectroscopy', 'and', 'cascaded', 'clock', 'operation']]
|
[-0.10931318175331083, 0.19099702571698765, 0.0006768306578445878, -0.004997157665281932, 0.025078201947028037, -0.18445395509081874, 0.09393743408832306, 0.4294907826039454, -0.26342674753171685, -0.3142828798118215, 0.06807061512983456, -0.26155025281174027, -0.016742877430797363, 0.25249090291898096, -0.05510315729843117, 0.0927822767432941, 0.0746879340062693, -0.014950185160945106, -0.04452577271709878, -0.15826491127079872, 0.20913678354739865, 0.16529148711203973, 0.2869579816896538, 0.035806545877817626, 0.10247965165275086, -0.00978083086998335, 0.006798596083770813, -0.014494072870056359, -0.07769545111162567, 0.11347221341331183, 0.27927030854343626, 0.04952820475785906, 0.25532223627850503, -0.4405854123048716, -0.21722941098283538, 0.08191848024060684, 0.17150691141785115, 0.1993812389573464, -0.08041115101265593, -0.2917460590277029, -0.015321192372104397, -0.1788481675111544, -0.16397411600391595, -0.12339779553842378, -0.026635304972621964, 0.07346533111264779, -0.2447467526675474, 0.06533858042010772, 0.01693175815664787, 0.10116451242302331, -0.05368336807554645, -0.08423878503775352, 0.0736023405977519, 0.09854408897320677, -0.059204431797337274, 0.032564167841482236, 0.1493778220617924, -0.03125512633206589, -0.12152760490913939, 0.4072662958794314, -0.10977849240200768, -0.11461525655898225, 0.1772868421640224, -0.15012053128112085, -0.14348959296027788, 0.12993762201357703, 0.15580559564575044, 0.09491524204715901, -0.14842551095578935, 0.009550300934742443, 0.06582541184742814, 0.24819423442205554, 0.057430270243644346, 0.11475675925901681, 0.2298215366842121, 0.19102800969809572, 0.07149052225459679, 0.11646645574455196, -0.12804004730893911, -0.06104602557693764, -0.24670773497869417, -0.13471655992961704, -0.1563252621729459, 0.017753079915361375, -0.024500736818860013, -0.11222806899455486, 0.35405647647653865, 0.17759041296699957, 0.13514273123300824, -0.04035201611327042, 0.34660954272767863, 0.10389426745537969, 0.09343273255190239, -0.011767320514234327, 0.260401499313042, 0.16476099306619177, 0.0914401365058122, -0.29530140937896016, 0.010847559589198473, -0.018919939707432474]
|
1,803.08249
|
On a fourth order nonlinear Helmholtz equation
|
In this paper, we study the mixed dispersion fourth order nonlinear Helmholtz
equation $\Delta^2 u -\beta \Delta u + \alpha u= \Gamma|u|^{p-2} u$ in $\mathbb
R^N$ for positive, bounded and $\mathbb Z^N$-periodic functions $\Gamma$. Using
the dual method of Evequoz and Weth, we find solutions to this equation and
establish some of their qualitative properties.
|
math.AP
|
in this paper we study the mixed dispersion fourth order nonlinear helmholtz equation delta2 u beta delta u alpha u gammaup2 u in mathbb rn for positive bounded and mathbb znperiodic functions gamma using the dual method of evequoz and weth we find solutions to this equation and establish some of their qualitative properties
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'mixed', 'dispersion', 'fourth', 'order', 'nonlinear', 'helmholtz', 'equation', 'delta2', 'u', 'beta', 'delta', 'u', 'alpha', 'u', 'gammaup2', 'u', 'in', 'mathbb', 'rn', 'for', 'positive', 'bounded', 'and', 'mathbb', 'znperiodic', 'functions', 'gamma', 'using', 'the', 'dual', 'method', 'of', 'evequoz', 'and', 'weth', 'we', 'find', 'solutions', 'to', 'this', 'equation', 'and', 'establish', 'some', 'of', 'their', 'qualitative', 'properties']]
|
[-0.15780706373134665, 0.03536129604075469, 0.002023184964177655, 0.02564144950798329, -0.08193617949590963, -0.14816191763270134, 0.007287406602271777, 0.3180966395154303, -0.37493686341479715, -0.17503871900193832, 0.03981162709476171, -0.3806938797819848, -0.1357237801467087, 0.13758242911860055, 0.00019824303978798437, 0.08962679822363105, -0.018924121142310256, 0.04855160126645191, -0.1495634589033822, -0.19735485428542482, 0.3497068073381396, -0.17620708545049033, 0.13678815635834254, 0.08326573070942186, 0.06897719850873246, -0.04712902822111752, 0.005945598231811149, -0.019208806439065466, -0.3101590119539669, 0.0915249893259184, 0.19169761866385884, 0.024100147744677232, 0.32498916530726, -0.3634217369059722, -0.19009539207407072, 0.20428289364402494, 0.14585398892671161, -0.047143295772519765, -0.03326373600273156, -0.2962003354640568, 0.09214503332680347, -0.11019798390129033, -0.24771957019088314, -0.050499722726789174, 0.09602340216766678, 0.11134898265841983, -0.34044020929757285, 0.15205117846455643, 0.09016403936616638, -0.01958461014517382, -0.11865845634875928, -0.17884182904426957, -0.02606078756712925, 0.04351456326377742, 0.014962374360537996, 0.13636393554043025, -0.06077717317669999, -0.10543575253812414, 0.02450409991776242, 0.3793460851462156, -0.12893455182704344, -0.2728798262701899, 0.07605255347694836, -0.23048995305126643, -0.12812508489279187, 0.04416132483667895, 0.16474975062095942, 0.18938789502078412, -0.11951038219472941, 0.26082677869514254, -0.04334786805488607, 0.16002443677508363, 0.10298398060395438, 0.007889082783139219, 0.020400843747398433, 0.07880635022678796, 0.08546861651919636, 0.10476366581176133, -0.020499309789681553, 0.004959802955900337, -0.39000417083940087, -0.1277675116252081, -0.09357472257140804, 0.1067102781734338, -0.11323888977794387, -0.18797629684502004, 0.34516694447865676, 0.09295214885188376, 0.1330064636673413, 0.06454460085917484, 0.15779961762475034, 0.20431848604451208, -0.08700610292326733, 0.09117851503120333, 0.1254992184403818, 0.1688746243130927, 0.12631566751310053, -0.29057970173729986, -0.04581725635730168, 0.1805696474743765]
|
1,803.0825
|
Coverage Enhancement for mmWave Communications using Passive Reflectors
|
Millimeter wave (mmWave) technology is expected to dominate the future 5G
networks mainly due to large spectrum available at these frequencies. However,
coverage deteriorates significantly at mmWave frequencies due to higher path
loss, especially for the non-line-of-sight (NLOS) scenarios. In this work, we
explore the use of passive reflectors for improving mmWave signal coverage in
NLOS indoor areas. Measurements are carried out using the PXI-based mmWave
transceiver platforms from National Instruments operating at 28 GHz, and the
results are compared with the outcomes of ray tracing (RT) simulations in a
similar environment. For both the measurements and RT simulations, different
shapes of metallic passive reflectors are used to observe the coverage (signal
strength) statistics on a receiver grid in an NLOS area. For a square metallic
sheet reflector of size 24 by 24 in and 33 by 33 in , we observe a significant
increase in the received power in the NLOS region, with a median gain of 20 dB
when compared to no reflector case. The cylindrical reflector shows more
uniform coverage on the receiver grid as compared to flat reflectors that are
more directional.
|
eess.SP cs.NI physics.app-ph
|
millimeter wave mmwave technology is expected to dominate the future 5g networks mainly due to large spectrum available at these frequencies however coverage deteriorates significantly at mmwave frequencies due to higher path loss especially for the nonlineofsight nlos scenarios in this work we explore the use of passive reflectors for improving mmwave signal coverage in nlos indoor areas measurements are carried out using the pxibased mmwave transceiver platforms from national instruments operating at 28 ghz and the results are compared with the outcomes of ray tracing rt simulations in a similar environment for both the measurements and rt simulations different shapes of metallic passive reflectors are used to observe the coverage signal strength statistics on a receiver grid in an nlos area for a square metallic sheet reflector of size 24 by 24 in and 33 by 33 in we observe a significant increase in the received power in the nlos region with a median gain of 20 db when compared to no reflector case the cylindrical reflector shows more uniform coverage on the receiver grid as compared to flat reflectors that are more directional
|
[['millimeter', 'wave', 'mmwave', 'technology', 'is', 'expected', 'to', 'dominate', 'the', 'future', '5g', 'networks', 'mainly', 'due', 'to', 'large', 'spectrum', 'available', 'at', 'these', 'frequencies', 'however', 'coverage', 'deteriorates', 'significantly', 'at', 'mmwave', 'frequencies', 'due', 'to', 'higher', 'path', 'loss', 'especially', 'for', 'the', 'nonlineofsight', 'nlos', 'scenarios', 'in', 'this', 'work', 'we', 'explore', 'the', 'use', 'of', 'passive', 'reflectors', 'for', 'improving', 'mmwave', 'signal', 'coverage', 'in', 'nlos', 'indoor', 'areas', 'measurements', 'are', 'carried', 'out', 'using', 'the', 'pxibased', 'mmwave', 'transceiver', 'platforms', 'from', 'national', 'instruments', 'operating', 'at', '28', 'ghz', 'and', 'the', 'results', 'are', 'compared', 'with', 'the', 'outcomes', 'of', 'ray', 'tracing', 'rt', 'simulations', 'in', 'a', 'similar', 'environment', 'for', 'both', 'the', 'measurements', 'and', 'rt', 'simulations', 'different', 'shapes', 'of', 'metallic', 'passive', 'reflectors', 'are', 'used', 'to', 'observe', 'the', 'coverage', 'signal', 'strength', 'statistics', 'on', 'a', 'receiver', 'grid', 'in', 'an', 'nlos', 'area', 'for', 'a', 'square', 'metallic', 'sheet', 'reflector', 'of', 'size', '24', 'by', '24', 'in', 'and', '33', 'by', '33', 'in', 'we', 'observe', 'a', 'significant', 'increase', 'in', 'the', 'received', 'power', 'in', 'the', 'nlos', 'region', 'with', 'a', 'median', 'gain', 'of', '20', 'db', 'when', 'compared', 'to', 'no', 'reflector', 'case', 'the', 'cylindrical', 'reflector', 'shows', 'more', 'uniform', 'coverage', 'on', 'the', 'receiver', 'grid', 'as', 'compared', 'to', 'flat', 'reflectors', 'that', 'are', 'more', 'directional']]
|
[-0.16860456902751417, 0.061809755628374936, 0.03328515373868868, 0.00723664109714066, -0.023424162391482085, -0.15652407258597162, 0.0577334619887077, 0.4671947129333959, -0.17398811600160907, -0.3128279473072009, 0.09936761047751845, -0.2997676283601955, -0.1222182939476941, 0.23498334558794537, -0.0736127268535948, 0.033709714154769164, 0.05571491722746388, -0.06813029501126552, -0.04773269978771998, -0.17508790120178752, 0.22122655904209038, 0.17215441394744077, 0.36716451124369126, 0.026756874079380752, 0.04053106774865781, -0.02162435932499964, -0.061008230823537575, -0.004085017018318784, -0.0701954445242771, 0.05082900255270626, 0.33877278819715645, 0.07255623799637365, 0.23476569145745801, -0.41640810089428787, -0.26206593812394596, 0.05704863899660742, 0.13463211350608617, 0.04903067149216835, -0.025708786315827518, -0.285547045965517, 0.10350868113828651, -0.17140169514586096, -0.09847173199602327, 0.09655916420287332, -0.0435195101966636, 0.044801081122663476, -0.2568467962403741, 0.03153641923310478, -0.034089918369832245, 0.09580875861043435, -0.033445917017398526, -0.15416469775094732, -0.008765351379027023, 0.1292239868282353, -0.01594633305111252, -0.0062559091798586606, 0.1279567216507807, -0.13522443271738113, -0.047655655361544945, 0.40501759764890227, -0.0490071112821486, -0.18666417220020262, 0.20243391277314082, -0.20202187622603757, -0.05301852663282973, 0.234488568152301, 0.26754245773949864, 0.0423210271072331, -0.1275772685505375, -0.006565902663999662, 0.020401523096829213, 0.16506192315390092, 0.13048571686300894, 0.08597483609185513, 0.2062978812191036, 0.1793242547314351, 0.13967073187940632, 0.11582333166164893, -0.22087884088725093, -0.04719313069843971, -0.20803613691975403, -0.09944623457419727, -0.18223806022180486, 0.037974548504834, -0.11615469183245454, -0.09244081329771965, 0.35700474217858, 0.16679251719387653, 0.12870545657452845, 0.10597133086285675, 0.3698062302807913, 0.0756713150875167, 0.09908793417929226, 0.08353199194053836, 0.3067183469665115, 0.11001617632522855, 0.18038597864443032, -0.15740151893418364, 0.009345361843968378, -0.12171186164335307]
|
1,803.08251
|
Life in the "Matrix": Human Mobility Patterns in the Cyber Space
|
With the wide adoption of the multi-community setting in many popular social
media platforms, the increasing user engagements across multiple online
communities warrant research attention. In this paper, we introduce a novel
analogy between the movements in the cyber space and the physical space. This
analogy implies a new way of studying human online activities by modelling the
activities across online communities in a similar fashion as the movements
among locations. First, we quantitatively validate the analogy by comparing
several important properties of human online activities and physical movements.
Our experiments reveal striking similarities between the cyber space and the
physical space. Next, inspired by the established methodology on human mobility
in the physical space, we propose a framework to study human "mobility" across
online platforms. We discover three interesting patterns of user engagements in
online communities. Furthermore, our experiments indicate that people with
different mobility patterns also exhibit divergent preferences to online
communities. This work not only attempts to achieve a better understanding of
human online activities, but also intends to open a promising research
direction with rich implications and applications.
|
cs.SI cs.CY
|
with the wide adoption of the multicommunity setting in many popular social media platforms the increasing user engagements across multiple online communities warrant research attention in this paper we introduce a novel analogy between the movements in the cyber space and the physical space this analogy implies a new way of studying human online activities by modelling the activities across online communities in a similar fashion as the movements among locations first we quantitatively validate the analogy by comparing several important properties of human online activities and physical movements our experiments reveal striking similarities between the cyber space and the physical space next inspired by the established methodology on human mobility in the physical space we propose a framework to study human mobility across online platforms we discover three interesting patterns of user engagements in online communities furthermore our experiments indicate that people with different mobility patterns also exhibit divergent preferences to online communities this work not only attempts to achieve a better understanding of human online activities but also intends to open a promising research direction with rich implications and applications
|
[['with', 'the', 'wide', 'adoption', 'of', 'the', 'multicommunity', 'setting', 'in', 'many', 'popular', 'social', 'media', 'platforms', 'the', 'increasing', 'user', 'engagements', 'across', 'multiple', 'online', 'communities', 'warrant', 'research', 'attention', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'novel', 'analogy', 'between', 'the', 'movements', 'in', 'the', 'cyber', 'space', 'and', 'the', 'physical', 'space', 'this', 'analogy', 'implies', 'a', 'new', 'way', 'of', 'studying', 'human', 'online', 'activities', 'by', 'modelling', 'the', 'activities', 'across', 'online', 'communities', 'in', 'a', 'similar', 'fashion', 'as', 'the', 'movements', 'among', 'locations', 'first', 'we', 'quantitatively', 'validate', 'the', 'analogy', 'by', 'comparing', 'several', 'important', 'properties', 'of', 'human', 'online', 'activities', 'and', 'physical', 'movements', 'our', 'experiments', 'reveal', 'striking', 'similarities', 'between', 'the', 'cyber', 'space', 'and', 'the', 'physical', 'space', 'next', 'inspired', 'by', 'the', 'established', 'methodology', 'on', 'human', 'mobility', 'in', 'the', 'physical', 'space', 'we', 'propose', 'a', 'framework', 'to', 'study', 'human', 'mobility', 'across', 'online', 'platforms', 'we', 'discover', 'three', 'interesting', 'patterns', 'of', 'user', 'engagements', 'in', 'online', 'communities', 'furthermore', 'our', 'experiments', 'indicate', 'that', 'people', 'with', 'different', 'mobility', 'patterns', 'also', 'exhibit', 'divergent', 'preferences', 'to', 'online', 'communities', 'this', 'work', 'not', 'only', 'attempts', 'to', 'achieve', 'a', 'better', 'understanding', 'of', 'human', 'online', 'activities', 'but', 'also', 'intends', 'to', 'open', 'a', 'promising', 'research', 'direction', 'with', 'rich', 'implications', 'and', 'applications']]
|
[-0.09737529401324567, 0.07125757169778009, -0.07960105330713994, 0.08805554325514535, -0.1525845071914923, -0.12427679730603564, 0.08807597640622919, 0.4495455308684281, -0.24262587633751498, -0.3487305056641472, 0.046126051571803516, -0.29311059081957647, -0.29456946504517245, 0.1916387793838282, -0.10391287226229906, 0.026119357527612328, 0.058999452929288806, 0.03902068696174116, -0.005561004072580624, -0.25534343096416584, 0.2911264752933326, 0.05451832982650088, 0.3464151103724981, 0.0661775164541553, 0.06095540756615554, -0.00013323155472280232, -0.08203681179189257, 0.027340752854757778, -0.11667331675942098, 0.21508394965932673, 0.3651832237655481, 0.17983264317684858, 0.39468132219134044, -0.41779198694032627, -0.23872509531185523, 0.07376547264713017, 0.15400152394015873, 0.06153143325354904, -0.09208721499685403, -0.37865266183923396, 0.03615939212389863, -0.19020756389587545, -0.0814333091973542, -0.09159909108408042, 0.01118202159145417, 0.002946923745944482, -0.20373041431578184, 0.0012929191717565838, 0.0028532485063136608, 0.11848842633560627, -0.05346248674610691, -0.047760305350523564, 0.06426862835288265, 0.2541877499622917, 0.12221091874084528, -0.02175597398692824, 0.16148580301675822, -0.15562472254252777, -0.18685068644501351, 0.38550385740677734, 0.006428831396048766, -0.14754401887850171, 0.26571075045145476, -0.10576328032414664, -0.1663737964450515, 0.0615815606459484, 0.2718182605880589, 0.0775176109336726, -0.1948474745092156, -0.0029658022423653483, -0.07844237294585372, 0.1571415109460109, 0.038947850197123796, 0.022802600761169342, 0.20910275204025291, 0.23593424067699484, 0.06531483424120009, 0.10839932621200825, 0.0021031219038887172, -0.11982536051872668, -0.19405123743178723, -0.1493641946689932, -0.11768396215380303, -0.028333578359736718, -0.10960186343444357, -0.11006727980214406, 0.4245698712638242, 0.2228555220056448, 0.20342099613265088, 0.0279582650140043, 0.3067403004688958, -0.054925590627545304, 0.06295564458040255, 0.09410710162534328, 0.1555613525733761, -0.034701638495559795, 0.21432824576897855, -0.1883867412759503, 0.13580995429163942, -0.027529241016984066]
|
1,803.08252
|
Temporal and Spatial Characteristics of mmWave Propagation Channels for
UAVs
|
Unmanned aerial vehicles~(UAVs) are envisioned to be an integral part of
future 5G communication systems. The agile nature of UAVs for serving users at
different locations can help to dynamically optimize coverage and
quality-of-service (QoS) in future networks. %However, there is very limited
literature available for mmWave communications using UAVs. In this work, we
explore the small scale temporal and spatial characteristics of mmWave
air-to-ground~(AG) line-of-sight~(LOS) propagation channels at $28$~GHz in
different environmental scenarios: dense-urban, suburban, rural, and over sea
using omni-directional antennas employing Wireless InSite ray tracing software.
We classify the received multipath components~(MPCs) into persistent and
non-persistent components. The small scale temporal and spatial characteristics
of the AG propagation channel are found to be dependent on the scatterer
properties: number, distribution, and geometry. Additionally, clustering of
MPCs in the time and spatial domain for different environments is found to be
dependent on the scatterer properties and receiver sensitivity. When the height
of the UAV is comparable to the height of the scatterers, we observe large
temporal and angular spreads.
|
eess.SP
|
unmanned aerial vehiclesuavs are envisioned to be an integral part of future 5g communication systems the agile nature of uavs for serving users at different locations can help to dynamically optimize coverage and qualityofservice qos in future networks however there is very limited literature available for mmwave communications using uavs in this work we explore the small scale temporal and spatial characteristics of mmwave airtogroundag lineofsightlos propagation channels at 28ghz in different environmental scenarios denseurban suburban rural and over sea using omnidirectional antennas employing wireless insite ray tracing software we classify the received multipath componentsmpcs into persistent and nonpersistent components the small scale temporal and spatial characteristics of the ag propagation channel are found to be dependent on the scatterer properties number distribution and geometry additionally clustering of mpcs in the time and spatial domain for different environments is found to be dependent on the scatterer properties and receiver sensitivity when the height of the uav is comparable to the height of the scatterers we observe large temporal and angular spreads
|
[['unmanned', 'aerial', 'vehiclesuavs', 'are', 'envisioned', 'to', 'be', 'an', 'integral', 'part', 'of', 'future', '5g', 'communication', 'systems', 'the', 'agile', 'nature', 'of', 'uavs', 'for', 'serving', 'users', 'at', 'different', 'locations', 'can', 'help', 'to', 'dynamically', 'optimize', 'coverage', 'and', 'qualityofservice', 'qos', 'in', 'future', 'networks', 'however', 'there', 'is', 'very', 'limited', 'literature', 'available', 'for', 'mmwave', 'communications', 'using', 'uavs', 'in', 'this', 'work', 'we', 'explore', 'the', 'small', 'scale', 'temporal', 'and', 'spatial', 'characteristics', 'of', 'mmwave', 'airtogroundag', 'lineofsightlos', 'propagation', 'channels', 'at', '28ghz', 'in', 'different', 'environmental', 'scenarios', 'denseurban', 'suburban', 'rural', 'and', 'over', 'sea', 'using', 'omnidirectional', 'antennas', 'employing', 'wireless', 'insite', 'ray', 'tracing', 'software', 'we', 'classify', 'the', 'received', 'multipath', 'componentsmpcs', 'into', 'persistent', 'and', 'nonpersistent', 'components', 'the', 'small', 'scale', 'temporal', 'and', 'spatial', 'characteristics', 'of', 'the', 'ag', 'propagation', 'channel', 'are', 'found', 'to', 'be', 'dependent', 'on', 'the', 'scatterer', 'properties', 'number', 'distribution', 'and', 'geometry', 'additionally', 'clustering', 'of', 'mpcs', 'in', 'the', 'time', 'and', 'spatial', 'domain', 'for', 'different', 'environments', 'is', 'found', 'to', 'be', 'dependent', 'on', 'the', 'scatterer', 'properties', 'and', 'receiver', 'sensitivity', 'when', 'the', 'height', 'of', 'the', 'uav', 'is', 'comparable', 'to', 'the', 'height', 'of', 'the', 'scatterers', 'we', 'observe', 'large', 'temporal', 'and', 'angular', 'spreads']]
|
[-0.23083465938534903, 0.10018146937197223, -0.014527123376547572, 0.05538599484414984, -0.07724478949669254, -0.15518793875789158, 0.012677562466530824, 0.4671618859227522, -0.27221199372188604, -0.31864858741299756, 0.08116243085304993, -0.25355688543395555, -0.12968847467507943, 0.1702347343818408, -0.08355833827630134, 0.051488946427251714, 0.03703193112658, -0.014629659854459116, 0.0035585997646698357, -0.19938884824738803, 0.2777279877589163, 0.11703058596173055, 0.3475908059991492, 0.07432440186833895, 0.07956131911101605, 0.012577759089363537, -0.04821635409067553, -0.014316697689109897, -0.07205104967754569, 0.09257114453084138, 0.3382181085124387, 0.14267007564825668, 0.23267908720299602, -0.45766485364636383, -0.2830478467035994, 0.06824868805257671, 0.18009731606811746, 0.028657326934836715, 0.005000930822297302, -0.34260965583015635, 0.11857299808712946, -0.18418556917458773, -0.12027482219960496, 0.033174313638493956, 0.0007362042031957801, 0.10465388429976707, -0.24877580710271574, -0.013674007448177022, -0.07917952171179006, 0.08456274823857898, -0.04989497738410663, -0.0875596058266013, -0.004316279967596014, 0.20399642122382752, 0.04108335221318124, -0.03906493324432971, 0.12773916034689958, -0.13107499169362485, -0.045115259825251997, 0.3803477746333523, 0.009013989275456014, -0.22011379952576146, 0.2077773641616089, -0.1284646454659229, -0.09470124262054058, 0.145761383927416, 0.2879839517335346, 0.06769309158953109, -0.17126553644700024, 0.019310139411014046, 0.028213506460705973, 0.16525445282122636, 0.1097008862409247, 0.13024577364418094, 0.20928609353232097, 0.22354293969622532, 0.1394536116209806, 0.07650596240159484, -0.18763546716332077, -0.08412875892897417, -0.19823347751320486, -0.09270534027614687, -0.21776305861120304, 0.004011305203347142, -0.10170430388693986, -0.08403635602262073, 0.40082993795422006, 0.1681798427332058, 0.1400214584364769, 0.07453400230693354, 0.3592279752357358, 0.06959959288921588, 0.0849706812730867, 0.10008398235595999, 0.18623577309660164, 0.053344388660716724, 0.1748303946532612, -0.1852832839106131, 0.07072492485675899, -0.06850616861252586]
|
1,803.08253
|
Electrical half-wave rectification at ferroelectric domain walls
|
Ferroelectric domain walls represent multifunctional 2D-elements with great
potential for novel device paradigms at the nanoscale. Improper ferroelectrics
display particularly promising types of domain walls, which, due to their
unique robustness, are the ideal template for imposing specific electronic
behavior. Chemical doping, for instance, induces p- or n-type characteristics
and electric fields reversibly switch between resistive and conductive
domain-wall states. Here, we demonstrate diode-like conversion of
alternating-current (AC) into direct-current (DC) output based on neutral
180$^{\circ}$ domain walls in improper ferroelectric ErMnO$_3$. By combining
scanning probe and dielectric spectroscopy, we show that the rectification
occurs for frequencies at which the domain walls are fixed to their equilibrium
position. The practical frequency regime and magnitude of the output is
controlled by the bulk conductivity. Using density functional theory we
attribute the transport behavior at the neutral walls to an accumulation of
oxygen defects. Our study reveals domain walls acting as 2D half-wave
rectifiers, extending domain-wall-based nanoelectronic applications into the
realm of AC technology.
|
cond-mat.mtrl-sci
|
ferroelectric domain walls represent multifunctional 2delements with great potential for novel device paradigms at the nanoscale improper ferroelectrics display particularly promising types of domain walls which due to their unique robustness are the ideal template for imposing specific electronic behavior chemical doping for instance induces p or ntype characteristics and electric fields reversibly switch between resistive and conductive domainwall states here we demonstrate diodelike conversion of alternatingcurrent ac into directcurrent dc output based on neutral 180circ domain walls in improper ferroelectric ermno_3 by combining scanning probe and dielectric spectroscopy we show that the rectification occurs for frequencies at which the domain walls are fixed to their equilibrium position the practical frequency regime and magnitude of the output is controlled by the bulk conductivity using density functional theory we attribute the transport behavior at the neutral walls to an accumulation of oxygen defects our study reveals domain walls acting as 2d halfwave rectifiers extending domainwallbased nanoelectronic applications into the realm of ac technology
|
[['ferroelectric', 'domain', 'walls', 'represent', 'multifunctional', '2delements', 'with', 'great', 'potential', 'for', 'novel', 'device', 'paradigms', 'at', 'the', 'nanoscale', 'improper', 'ferroelectrics', 'display', 'particularly', 'promising', 'types', 'of', 'domain', 'walls', 'which', 'due', 'to', 'their', 'unique', 'robustness', 'are', 'the', 'ideal', 'template', 'for', 'imposing', 'specific', 'electronic', 'behavior', 'chemical', 'doping', 'for', 'instance', 'induces', 'p', 'or', 'ntype', 'characteristics', 'and', 'electric', 'fields', 'reversibly', 'switch', 'between', 'resistive', 'and', 'conductive', 'domainwall', 'states', 'here', 'we', 'demonstrate', 'diodelike', 'conversion', 'of', 'alternatingcurrent', 'ac', 'into', 'directcurrent', 'dc', 'output', 'based', 'on', 'neutral', '180circ', 'domain', 'walls', 'in', 'improper', 'ferroelectric', 'ermno_3', 'by', 'combining', 'scanning', 'probe', 'and', 'dielectric', 'spectroscopy', 'we', 'show', 'that', 'the', 'rectification', 'occurs', 'for', 'frequencies', 'at', 'which', 'the', 'domain', 'walls', 'are', 'fixed', 'to', 'their', 'equilibrium', 'position', 'the', 'practical', 'frequency', 'regime', 'and', 'magnitude', 'of', 'the', 'output', 'is', 'controlled', 'by', 'the', 'bulk', 'conductivity', 'using', 'density', 'functional', 'theory', 'we', 'attribute', 'the', 'transport', 'behavior', 'at', 'the', 'neutral', 'walls', 'to', 'an', 'accumulation', 'of', 'oxygen', 'defects', 'our', 'study', 'reveals', 'domain', 'walls', 'acting', 'as', '2d', 'halfwave', 'rectifiers', 'extending', 'domainwallbased', 'nanoelectronic', 'applications', 'into', 'the', 'realm', 'of', 'ac', 'technology']]
|
[-0.149778344186879, 0.14015273699005096, -0.015783002681058388, -0.07365544852966975, -0.10155626722056164, -0.17691786793170508, 0.09860779972304445, 0.46404468198740706, -0.30739797863520696, -0.2666616911670158, 0.03399962150478759, -0.25774906149353854, -0.12358048560838245, 0.21065090454663643, -0.0037194590688204416, 0.015043046915475627, -0.05964046410105613, -0.09838896083952108, -0.03990328839368343, -0.09579013597208613, 0.24422435073459647, -0.04487482261278534, 0.40030791520528636, 0.0937503861402225, 0.0735706005054555, -0.024120782123103462, 0.08937876143706788, 0.04517974370153424, -0.12527111015682613, 0.07768907324918575, 0.25986918618451366, -0.07688451909911327, 0.20649480842262136, -0.5116671887515634, -0.23549377652151243, 0.030533285065735213, 0.11291423167885854, 0.12634469416268715, -0.10149718347722839, -0.2809676218420695, 0.09343918432591494, -0.0805393917405087, -0.12290321969317261, -0.10293015363041937, 0.004257923324725458, 0.03144788600559352, -0.247661027983583, 0.07527429009758815, 0.056205490202735534, 0.07878772793945087, -0.11104088722473669, -0.14195892344928862, -0.05523669603859184, 0.10043472302672656, 0.0013610612332057323, 0.038240206482826, 0.2580242622961863, -0.1549048316317917, -0.14099614122327161, 0.3261392348307121, -0.032031353473408804, -0.16213639284287412, 0.19560824621538198, -0.1691556743299878, -0.0021187630012018247, 0.11710220685240275, 0.14300958797486024, 0.10658961135506491, -0.16733134391584567, 0.08761660950562067, 0.08721822428282766, 0.15432240691336785, 0.14066293800209204, 0.09051242440950519, 0.29808019250862716, 0.21743792632698827, 0.059859771982865025, 0.2102961330905973, -0.09989783097375242, -0.02134215472387555, -0.24100654055375276, -0.1615603827822213, -0.19516174221608024, 0.06685222817515457, -0.08026880819620912, -0.1987519208428606, 0.3897485443801613, 0.13244878933253418, 0.1250510065590743, -0.06820149585656729, 0.2949421263606467, 0.08435845847953088, 0.08285727866300562, 0.0027337020880583186, 0.20426861986066708, 0.13257651933561432, 0.16720095029829637, -0.305174676914011, 0.054918715561109575, -0.024397994609266196]
|
1,803.08254
|
Exact Boundary Observability and Controllability of the Wave Equation in
an Interval with two Moving Endpoints
|
We study the wave equation in an interval with two linearly moving endpoints.
We give the exact solution by a series formula, then we show that the energy of
the solution decay at the rate $1/t$. We also establish observability results,
at one or two endpoints, in a sharp time. Moreover, using the Hilbert
uniqueness method, we derive exact boundary controllability results.
|
math.AP math.FA
|
we study the wave equation in an interval with two linearly moving endpoints we give the exact solution by a series formula then we show that the energy of the solution decay at the rate 1t we also establish observability results at one or two endpoints in a sharp time moreover using the hilbert uniqueness method we derive exact boundary controllability results
|
[['we', 'study', 'the', 'wave', 'equation', 'in', 'an', 'interval', 'with', 'two', 'linearly', 'moving', 'endpoints', 'we', 'give', 'the', 'exact', 'solution', 'by', 'a', 'series', 'formula', 'then', 'we', 'show', 'that', 'the', 'energy', 'of', 'the', 'solution', 'decay', 'at', 'the', 'rate', '1t', 'we', 'also', 'establish', 'observability', 'results', 'at', 'one', 'or', 'two', 'endpoints', 'in', 'a', 'sharp', 'time', 'moreover', 'using', 'the', 'hilbert', 'uniqueness', 'method', 'we', 'derive', 'exact', 'boundary', 'controllability', 'results']]
|
[-0.16391622886857798, 0.052689996182086744, -0.10235869434602078, 0.061696806637149666, -0.021542741849477732, -0.12673592872376885, 0.05455942193727805, 0.3803987590776336, -0.2871285213059896, -0.2170945916910686, 0.15687866674570908, -0.2989520275544736, -0.1187147666257055, 0.1820177329223483, 0.030340364743624965, 0.07501989136630248, 0.08870771810817983, 0.10124663310876537, -0.09909005325302601, -0.22446480272112473, 0.3370789394924237, -0.0393096755574187, 0.2526349709369242, 0.09052431362590962, 0.1043647947390714, -0.0046470329548502646, 0.028085627202545444, -0.0008737352346220325, -0.2495315917886112, 0.059461720881142446, 0.19226182196214195, 0.09437571372836828, 0.27450408149630795, -0.45128335274996295, -0.11542717991546998, 0.10056759839156462, 0.1396701926921284, 0.12016405396523976, -0.09396070709842588, -0.2729574196160801, 0.08756579912357754, -0.10098674005618499, -0.21109635036649002, -0.04046043402124797, -0.012482094007634347, 0.038309088213399296, -0.27638005378145364, 0.10493221644250181, 0.03925875285940786, -0.0013083673848380004, -0.1710585179408231, -0.03843840493655373, 0.028518309591398124, 0.0704705550282773, 0.08464555365724429, -0.00355287664757681, 0.01646068344463504, -0.07628186314456886, -0.11135485398042347, 0.26335571132480134, -0.13090658238844857, -0.24752221692113147, 0.1797891383570048, -0.18437418120072013, -0.1192767356574956, 0.1236664650120562, 0.13160395730407007, 0.16172910860228923, -0.1450092948432411, 0.09332831420995776, -0.06477025185590572, 0.13038650390902354, 0.09893894368301957, 0.028158010212674497, 0.10185392236998005, 0.11790618279408063, 0.12696713805499096, 0.19008097374781727, -0.0703693931103654, -0.07260550615648108, -0.3818741297769931, -0.20583422990485786, -0.16980034075376968, 0.050529957573153005, -0.12402390396492856, -0.15208925650785526, 0.40309256116949743, 0.14856474057981564, 0.23952181853594318, 0.15275680221196625, 0.27054286727140986, 0.2168841562984932, -0.049886031519441355, 0.12892591400492576, 0.20250724448311713, 0.09362405620800753, 0.0882723352631494, -0.2259674949962045, 0.009999224247651236, 0.1843140349918676]
|
1,803.08255
|
A non-homogeneous hidden Markov model for partially observed
longitudinal responses
|
Dropout represents a typical issue to be addressed when dealing with
longitudinal studies. If the mechanism leading to missing information is
non-ignorable, inference based on the observed data only may be severely
biased. A frequent strategy to obtain reliable parameter estimates is based on
the use of individual-specific random coefficients that help capture sources of
unobserved heterogeneity and, at the same time, define a reasonable structure
of dependence between the longitudinal and the missing data process. We refer
to elements in this class as random coefficient based dropout models (RCBDMs).
We propose a dynamic, semi-parametric, version of the standard RCBDM to deal
with discrete time to event. Time-varying random coefficients that evolve over
time according to a non-homogeneous hidden Markov chain are considered to model
dependence between longitudinal responses recorded from the same subject. A
separate set of random coefficients is considered to model dependence between
missing data indicators. Last, the joint distribution of the random
coefficients in the two equations helps describe the dependence between the two
processes. To ensure model flexibility and avoid unverifiable assumptions, we
leave the joint distribution of the random coefficients unspecified and
estimate it via nonparametric maximum likelihood. The proposal is applied to
data from the Leiden 85+ study on the evolution of cognitive functioning in the
elderly.
|
stat.ME
|
dropout represents a typical issue to be addressed when dealing with longitudinal studies if the mechanism leading to missing information is nonignorable inference based on the observed data only may be severely biased a frequent strategy to obtain reliable parameter estimates is based on the use of individualspecific random coefficients that help capture sources of unobserved heterogeneity and at the same time define a reasonable structure of dependence between the longitudinal and the missing data process we refer to elements in this class as random coefficient based dropout models rcbdms we propose a dynamic semiparametric version of the standard rcbdm to deal with discrete time to event timevarying random coefficients that evolve over time according to a nonhomogeneous hidden markov chain are considered to model dependence between longitudinal responses recorded from the same subject a separate set of random coefficients is considered to model dependence between missing data indicators last the joint distribution of the random coefficients in the two equations helps describe the dependence between the two processes to ensure model flexibility and avoid unverifiable assumptions we leave the joint distribution of the random coefficients unspecified and estimate it via nonparametric maximum likelihood the proposal is applied to data from the leiden 85 study on the evolution of cognitive functioning in the elderly
|
[['dropout', 'represents', 'a', 'typical', 'issue', 'to', 'be', 'addressed', 'when', 'dealing', 'with', 'longitudinal', 'studies', 'if', 'the', 'mechanism', 'leading', 'to', 'missing', 'information', 'is', 'nonignorable', 'inference', 'based', 'on', 'the', 'observed', 'data', 'only', 'may', 'be', 'severely', 'biased', 'a', 'frequent', 'strategy', 'to', 'obtain', 'reliable', 'parameter', 'estimates', 'is', 'based', 'on', 'the', 'use', 'of', 'individualspecific', 'random', 'coefficients', 'that', 'help', 'capture', 'sources', 'of', 'unobserved', 'heterogeneity', 'and', 'at', 'the', 'same', 'time', 'define', 'a', 'reasonable', 'structure', 'of', 'dependence', 'between', 'the', 'longitudinal', 'and', 'the', 'missing', 'data', 'process', 'we', 'refer', 'to', 'elements', 'in', 'this', 'class', 'as', 'random', 'coefficient', 'based', 'dropout', 'models', 'rcbdms', 'we', 'propose', 'a', 'dynamic', 'semiparametric', 'version', 'of', 'the', 'standard', 'rcbdm', 'to', 'deal', 'with', 'discrete', 'time', 'to', 'event', 'timevarying', 'random', 'coefficients', 'that', 'evolve', 'over', 'time', 'according', 'to', 'a', 'nonhomogeneous', 'hidden', 'markov', 'chain', 'are', 'considered', 'to', 'model', 'dependence', 'between', 'longitudinal', 'responses', 'recorded', 'from', 'the', 'same', 'subject', 'a', 'separate', 'set', 'of', 'random', 'coefficients', 'is', 'considered', 'to', 'model', 'dependence', 'between', 'missing', 'data', 'indicators', 'last', 'the', 'joint', 'distribution', 'of', 'the', 'random', 'coefficients', 'in', 'the', 'two', 'equations', 'helps', 'describe', 'the', 'dependence', 'between', 'the', 'two', 'processes', 'to', 'ensure', 'model', 'flexibility', 'and', 'avoid', 'unverifiable', 'assumptions', 'we', 'leave', 'the', 'joint', 'distribution', 'of', 'the', 'random', 'coefficients', 'unspecified', 'and', 'estimate', 'it', 'via', 'nonparametric', 'maximum', 'likelihood', 'the', 'proposal', 'is', 'applied', 'to', 'data', 'from', 'the', 'leiden', '85', 'study', 'on', 'the', 'evolution', 'of', 'cognitive', 'functioning', 'in', 'the', 'elderly']]
|
[-0.07927317566563429, 0.09689441888663426, -0.09673403350434284, 0.10103499837224554, -0.13713866271043443, -0.1454723066527326, 0.06651486667698987, 0.38127668073646864, -0.28727511036262476, -0.3048052101106084, 0.100560453908742, -0.2612243358678413, -0.1097224334549743, 0.14209658254645238, -0.06553371557921944, 0.06385780595471414, 0.04827388096600771, 0.031876787933727446, -0.034466272384754186, -0.24317635691676395, 0.29269314771034877, 0.07698871003615423, 0.3274852107015421, -0.012609331399632865, 0.1315837789015001, 0.053530416853356896, -0.09605311376991559, -0.013580639661326268, -0.0929648232153306, 0.0946132165625832, 0.23372009207729927, 0.11010625001640534, 0.31690678839628883, -0.42064627416361616, -0.230708238554521, 0.1375813200303248, 0.09550232494871554, 0.08801870411116397, 0.008902946386029417, -0.24988278142123851, 0.07775442385859348, -0.1519509061274804, -0.09503811161376466, -0.04194120092554686, -0.013521231605478053, 0.031883005165925495, -0.34005842205682846, 0.12425010225226013, 0.02272458855317519, 0.04089797724956506, -0.04889500149380732, -0.09433449276465976, -0.005276278295018271, 0.13966531151390024, 0.09154747187460328, 0.0033287071982038403, 0.10775941856126389, -0.10695429427114334, -0.10950915642381417, 0.3440835993508545, -0.07368305771730242, -0.25150641012620534, 0.17062668829501765, -0.1367360204084829, -0.1716162598283329, 0.1005082210604945, 0.24455939879957236, 0.08248951647596495, -0.20428205031045232, 0.029481475170095504, -0.004234937799409173, 0.1609358344982677, 0.0071850166137699244, 0.009564438197796917, 0.16462271391273528, 0.14493212481809095, 0.0331695977497389, 0.13090534435413814, -0.10850994065700467, -0.112350909584114, -0.27573102391939963, -0.08267420861553752, -0.1857786785420206, 0.027071134118090895, -0.10592888994334608, -0.18498651997130233, 0.3905450862784044, 0.21133309014081997, 0.2794239184130554, 0.06125468236969714, 0.264951707994047, 0.12451376083735563, 0.05968989533337079, 0.052074381454522665, 0.1528669013499001, 0.13569872998105326, 0.08516922230966266, -0.18568057893063733, 0.18111977286039377, 0.0025831137471920194]
|
1,803.08256
|
Sensing the Chinese Diaspora: How Mobile Apps Can Provide Insights into
Global Migration Flows
|
Many countries today have "country-centric mobile apps" which are mobile apps
that are primarily used by residents of a specific country. Many of these
country-centric apps also include a location-based service which takes
advantage of the smartphone's API access to the smartphone's current GPS
location. In this paper, we investigate how such country-centric apps with
location-based services can be employed to study the diaspora associated with
ethnic and cultural groups. Our methodology combines GPS hacking, automated
task tools for mobile phones, and OCR to generate migration statistics for
diaspora. As a case study, we apply our methodology to WeChat, an enormously
popular app within China and among ethnic Chinese worldwide. Using WeChat, we
collect data about the Chinese diaspora in 32 cities. The combined data
provides interesting insights to the modern Chinese diaspora and how it has
changed in recent years.
|
cs.SI
|
many countries today have countrycentric mobile apps which are mobile apps that are primarily used by residents of a specific country many of these countrycentric apps also include a locationbased service which takes advantage of the smartphones api access to the smartphones current gps location in this paper we investigate how such countrycentric apps with locationbased services can be employed to study the diaspora associated with ethnic and cultural groups our methodology combines gps hacking automated task tools for mobile phones and ocr to generate migration statistics for diaspora as a case study we apply our methodology to wechat an enormously popular app within china and among ethnic chinese worldwide using wechat we collect data about the chinese diaspora in 32 cities the combined data provides interesting insights to the modern chinese diaspora and how it has changed in recent years
|
[['many', 'countries', 'today', 'have', 'countrycentric', 'mobile', 'apps', 'which', 'are', 'mobile', 'apps', 'that', 'are', 'primarily', 'used', 'by', 'residents', 'of', 'a', 'specific', 'country', 'many', 'of', 'these', 'countrycentric', 'apps', 'also', 'include', 'a', 'locationbased', 'service', 'which', 'takes', 'advantage', 'of', 'the', 'smartphones', 'api', 'access', 'to', 'the', 'smartphones', 'current', 'gps', 'location', 'in', 'this', 'paper', 'we', 'investigate', 'how', 'such', 'countrycentric', 'apps', 'with', 'locationbased', 'services', 'can', 'be', 'employed', 'to', 'study', 'the', 'diaspora', 'associated', 'with', 'ethnic', 'and', 'cultural', 'groups', 'our', 'methodology', 'combines', 'gps', 'hacking', 'automated', 'task', 'tools', 'for', 'mobile', 'phones', 'and', 'ocr', 'to', 'generate', 'migration', 'statistics', 'for', 'diaspora', 'as', 'a', 'case', 'study', 'we', 'apply', 'our', 'methodology', 'to', 'wechat', 'an', 'enormously', 'popular', 'app', 'within', 'china', 'and', 'among', 'ethnic', 'chinese', 'worldwide', 'using', 'wechat', 'we', 'collect', 'data', 'about', 'the', 'chinese', 'diaspora', 'in', '32', 'cities', 'the', 'combined', 'data', 'provides', 'interesting', 'insights', 'to', 'the', 'modern', 'chinese', 'diaspora', 'and', 'how', 'it', 'has', 'changed', 'in', 'recent', 'years']]
|
[-0.07706211863006367, 0.011615619529967513, -0.08020824462122528, 0.11909947877482294, -0.14349225593948775, -0.15056728515179552, 0.09667594059979781, 0.40048552394335996, -0.23348683138635565, -0.35022270308265874, 0.1312918898456314, -0.364067456176412, -0.16678241894213838, 0.2686162654125521, -0.16108575846227083, -0.019449117223580257, 0.07326649324902405, 0.0360668106417416, 0.06657402681728415, -0.29906926617184854, 0.2672787833470085, 0.035565149468982406, 0.3504101514869125, 0.05486423098184961, 0.03347871405074987, -0.003073217112782365, -0.09509736553481812, -0.06353263928495506, -0.07125948584690758, 0.21584488705778165, 0.39016373256545067, 0.22068579704665864, 0.36914361682092994, -0.4536257335480223, -0.1623248057902282, 0.07198084350212985, 0.17397487255354935, 0.06769757278441907, -0.07833659683902425, -0.3798024532045007, 0.112061080900153, -0.31535549074451025, -0.09767460863680598, -0.08158337734210311, 0.04888394835953277, 0.0538906269464873, -0.19802286368646124, -0.030229831448176557, -0.05821150744082869, 0.13871165059163426, -0.0025997864567932297, -0.10083327722134637, 0.0001719120018025662, 0.29046419850411886, 0.1296717094799094, -0.05932187022482778, 0.1934256641803547, -0.11294053854207765, -0.1620028374009891, 0.36393562806043644, 0.024711174474276128, -0.08449058499557117, 0.2035485013216364, -0.05917581029117425, -0.20876178281143942, 0.04314007664905161, 0.2818385325884116, 0.04586880928869789, -0.22867635256736307, 0.026480423086752178, -0.05351167291529552, 0.167352804550835, 0.06884462449283517, 0.003983530483839386, 0.19232878622975438, 0.2146635809087637, 0.05608196675212697, 0.05454501586863837, -0.08710121162812035, -0.07510248242368829, -0.11140403677899298, -0.15515192008266845, -0.13724056217515618, 0.04334862216488055, -0.07056456003032612, -0.13462819971296117, 0.3904574646462574, 0.2509554753754765, 0.06171578325410473, 0.009875504090285576, 0.3165904788931184, -0.02038781797919581, 0.16100638964153985, 0.1291586897259162, 0.10626209125002013, -0.061315292424806364, 0.26866997538979914, -0.0814826351141306, 0.10940403721447214, -0.025290613039561833]
|
1,803.08257
|
The Rokhlin property for inclusions of C*-algebras
|
Let $P \subset A$ be an inclusion of $\sigma$-unital C*-algebras with a
finite index in the sense of Izumi. Then we introduce the Rokhlin property for
a conditional expectation $E$ from $A$ onto $P$ and show that if $A$ is simple
and satisfies any of the property $(1) \sim (12)$ listed in the below, and $E$
has the Rokhlin property, then so does $P$.
(1) Simplicity;(2) Nuclearity;(3) C*-algebras that absorb a given strongly
self-absorbing C*-algebra $\mathcal{D}$; (4)C*-algebras of stable rank one; (5)
C*-algebras of real rank zero;(6) C*-algebras of nuclear dimension at most $n$,
where $n \in Z^+$; (7)C*-algebras of decomposition rank at most $n$, where $n
\in Z^+$; (8) Separable simple C*-algebras that are stably isomorphic to AF
algebras; (9) Separable simple C*-algebras that are stably isomorphic to AI
algebras; (10) Separable simple C*-algebras that are stably isomorphic to AT
algebras; (11) Separable simple C*-algebras that are stably isomorphic to
sequential direct limits of one dimensional NCCW complexes; (12) Separable
C*-algebras with strict comparison of positive elements. In particular, when
$\alpha : G \rightarrow \rm{Aut}(A)$ is an action of a finite group $G$ on $A$
with the Rokhlin property in the sense of Nawata, the properties $(1) \sim
(12)$ are inherited to the fixed point algebra $A^\alpha$ and the crossed
product algebra $A \rtimes_\alpha G$ from $A$.
|
math.OA
|
let p subset a be an inclusion of sigmaunital calgebras with a finite index in the sense of izumi then we introduce the rokhlin property for a conditional expectation e from a onto p and show that if a is simple and satisfies any of the property 1 sim 12 listed in the below and e has the rokhlin property then so does p 1 simplicity2 nuclearity3 calgebras that absorb a given strongly selfabsorbing calgebra mathcald 4calgebras of stable rank one 5 calgebras of real rank zero6 calgebras of nuclear dimension at most n where n in z 7calgebras of decomposition rank at most n where n in z 8 separable simple calgebras that are stably isomorphic to af algebras 9 separable simple calgebras that are stably isomorphic to ai algebras 10 separable simple calgebras that are stably isomorphic to at algebras 11 separable simple calgebras that are stably isomorphic to sequential direct limits of one dimensional nccw complexes 12 separable calgebras with strict comparison of positive elements in particular when alpha g rightarrow rmauta is an action of a finite group g on a with the rokhlin property in the sense of nawata the properties 1 sim 12 are inherited to the fixed point algebra aalpha and the crossed product algebra a rtimes_alpha g from a
|
[['let', 'p', 'subset', 'a', 'be', 'an', 'inclusion', 'of', 'sigmaunital', 'calgebras', 'with', 'a', 'finite', 'index', 'in', 'the', 'sense', 'of', 'izumi', 'then', 'we', 'introduce', 'the', 'rokhlin', 'property', 'for', 'a', 'conditional', 'expectation', 'e', 'from', 'a', 'onto', 'p', 'and', 'show', 'that', 'if', 'a', 'is', 'simple', 'and', 'satisfies', 'any', 'of', 'the', 'property', '1', 'sim', '12', 'listed', 'in', 'the', 'below', 'and', 'e', 'has', 'the', 'rokhlin', 'property', 'then', 'so', 'does', 'p', '1', 'simplicity2', 'nuclearity3', 'calgebras', 'that', 'absorb', 'a', 'given', 'strongly', 'selfabsorbing', 'calgebra', 'mathcald', '4calgebras', 'of', 'stable', 'rank', 'one', '5', 'calgebras', 'of', 'real', 'rank', 'zero6', 'calgebras', 'of', 'nuclear', 'dimension', 'at', 'most', 'n', 'where', 'n', 'in', 'z', '7calgebras', 'of', 'decomposition', 'rank', 'at', 'most', 'n', 'where', 'n', 'in', 'z', '8', 'separable', 'simple', 'calgebras', 'that', 'are', 'stably', 'isomorphic', 'to', 'af', 'algebras', '9', 'separable', 'simple', 'calgebras', 'that', 'are', 'stably', 'isomorphic', 'to', 'ai', 'algebras', '10', 'separable', 'simple', 'calgebras', 'that', 'are', 'stably', 'isomorphic', 'to', 'at', 'algebras', '11', 'separable', 'simple', 'calgebras', 'that', 'are', 'stably', 'isomorphic', 'to', 'sequential', 'direct', 'limits', 'of', 'one', 'dimensional', 'nccw', 'complexes', '12', 'separable', 'calgebras', 'with', 'strict', 'comparison', 'of', 'positive', 'elements', 'in', 'particular', 'when', 'alpha', 'g', 'rightarrow', 'rmauta', 'is', 'an', 'action', 'of', 'a', 'finite', 'group', 'g', 'on', 'a', 'with', 'the', 'rokhlin', 'property', 'in', 'the', 'sense', 'of', 'nawata', 'the', 'properties', '1', 'sim', '12', 'are', 'inherited', 'to', 'the', 'fixed', 'point', 'algebra', 'aalpha', 'and', 'the', 'crossed', 'product', 'algebra', 'a', 'rtimes_alpha', 'g', 'from', 'a']]
|
[-0.1121160283406658, 0.18749320727424867, -0.061762556263744404, 0.020710896777863044, -0.06081140937032046, -0.19960730729880632, -0.017392206272790076, 0.40715168926189543, -0.360509558344123, -0.15850508327361956, 0.09274380898072221, -0.31240513292251604, -0.06520054458035818, 0.14756813187536152, -0.12206631696284241, -0.06438320934203105, 0.07125124924069147, 0.19094847900113224, -0.11314189184351683, -0.2623713506061266, 0.38494167266020735, -0.05591655983722005, 0.16405161586259073, 0.029376513549474, 0.09330432980555282, 0.005641241856382815, 0.03977713632172247, 0.03539096426673375, -0.13859055448488733, 0.06436263826141637, 0.31235337328448254, 0.10382222068182664, 0.28323311487574715, -0.3135632045558208, -0.08902790541517862, 0.23914042288013757, 0.09469151360940595, -0.07765056079935494, -0.020036152306330608, -0.240762083683057, 0.15467409448868097, -0.27203397122233824, -0.08388054479129824, -0.06772896526872414, 0.14228748510011263, -0.05855549603118009, -0.3100674200794214, -0.0001624398453765818, 0.13616225389560677, 0.1078679646736108, -0.07045515922065912, -0.10137123570852512, -0.11180581590072451, 0.05565089752836378, -0.08616582211989786, 0.047811660583746744, 0.13297455593219723, -0.036030237501608796, -0.14398091611169914, 0.36314722115032694, -0.029901212246832547, -0.17331280849291392, 0.1835426186990452, -0.2424810590813934, -0.20539574001770095, 0.1650792952490114, 0.042844486544217686, 0.1455160028314145, 0.0003743123147119128, 0.23017716130586033, -0.1375447356192311, 0.12262914467327654, 0.04089658482880795, 0.004118795274928989, 0.05562011166630198, 0.0650425819642577, 0.11532144374832051, 0.08869433253551105, 0.07964270179362977, 0.05294957666512208, -0.33073052264290964, -0.12223330126872277, -0.14341109900479315, 0.19554361554913188, -0.11160100797995134, -0.14770184512475232, 0.33412787678620615, 0.06366004707745246, 0.2116407049230578, 0.09584450313680191, 0.2076563637381446, 0.03705140421723161, 0.06944018133140917, 0.11531654985453846, 0.15299459943168253, 0.30206716544396506, -0.07803219876812674, -0.10327092033338632, -0.053424250273810814, 0.1983672536234261]
|
1,803.08258
|
Reversion of Quantum Walks via interventions on coin space
|
In this study we show a way of achieving the reverse evolution of
n-dimensional quantum walks by introducing interventions on the coin degree of
freedom during the forward progression of the coin-walker system. Only a single
intervention is required to reverse a quantum walker on a line to its initial
positon and the number of interventions increases with the dimensionality of
the walk. We present an analytical treatment to prove these results. This
reversion scheme can be used to generate periodic bounded quantum walks and to
control the locations where particle can be found with highest probability.
From the point of view of quantum computations and simulations, this scheme
could be useful in resetting quantum operations and implementing certain
quantum gates.
|
quant-ph
|
in this study we show a way of achieving the reverse evolution of ndimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coinwalker system only a single intervention is required to reverse a quantum walker on a line to its initial positon and the number of interventions increases with the dimensionality of the walk we present an analytical treatment to prove these results this reversion scheme can be used to generate periodic bounded quantum walks and to control the locations where particle can be found with highest probability from the point of view of quantum computations and simulations this scheme could be useful in resetting quantum operations and implementing certain quantum gates
|
[['in', 'this', 'study', 'we', 'show', 'a', 'way', 'of', 'achieving', 'the', 'reverse', 'evolution', 'of', 'ndimensional', 'quantum', 'walks', 'by', 'introducing', 'interventions', 'on', 'the', 'coin', 'degree', 'of', 'freedom', 'during', 'the', 'forward', 'progression', 'of', 'the', 'coinwalker', 'system', 'only', 'a', 'single', 'intervention', 'is', 'required', 'to', 'reverse', 'a', 'quantum', 'walker', 'on', 'a', 'line', 'to', 'its', 'initial', 'positon', 'and', 'the', 'number', 'of', 'interventions', 'increases', 'with', 'the', 'dimensionality', 'of', 'the', 'walk', 'we', 'present', 'an', 'analytical', 'treatment', 'to', 'prove', 'these', 'results', 'this', 'reversion', 'scheme', 'can', 'be', 'used', 'to', 'generate', 'periodic', 'bounded', 'quantum', 'walks', 'and', 'to', 'control', 'the', 'locations', 'where', 'particle', 'can', 'be', 'found', 'with', 'highest', 'probability', 'from', 'the', 'point', 'of', 'view', 'of', 'quantum', 'computations', 'and', 'simulations', 'this', 'scheme', 'could', 'be', 'useful', 'in', 'resetting', 'quantum', 'operations', 'and', 'implementing', 'certain', 'quantum', 'gates']]
|
[-0.12828324930665413, 0.16947156755931478, -0.09975818509220584, 0.002726459808355151, -0.02592946870314065, -0.17857016088471803, 0.1011353694806876, 0.37656871087787563, -0.27335406475015417, -0.27356840692044904, 0.09552309442069074, -0.22319157218391245, -0.15304927848864439, 0.2026527753717474, -0.09829926047443359, 0.08988294196998207, 0.06730944770753906, 0.03816193669133874, -0.026426955495074907, -0.2799888224695032, 0.25957812022510146, 0.05709690114190756, 0.24278851206152707, 0.03093474947420249, 0.11377978927555903, 0.02546328826314839, 0.008836578435364588, 0.02018872901320088, -0.1301467369319217, 0.10479954316873442, 0.2292013851971912, 0.11504187939634686, 0.29418565838574623, -0.4442381379083915, -0.2071715666535349, 0.11593979868791567, 0.13416143415942172, 0.20381349655376238, -0.037722842620631816, -0.308017946518034, 0.07570613428857947, -0.13767818557322198, -0.14947516329909774, -0.053549115452723006, -0.022773298508033526, 0.021238526276963154, -0.27846637682042524, 0.019366506664159375, 0.05130711201268579, 0.06256181931350195, 0.021614993846405698, -0.030342079574927256, 0.010598537585243952, 0.15116537402457103, -0.03293162154440031, 0.03801535025492988, 0.14960756645997803, -0.1299483626037028, -0.20265306431168983, 0.3730937676381104, -0.0004021226224481813, -0.2199173304290811, 0.1509874332734684, -0.15134120901684808, -0.09590853066958126, 0.08534873346220856, 0.1822976312842528, 0.10340362567115914, -0.11480765201705546, 0.058377775548349234, 0.014069658375060386, 0.15249739096366247, 0.04854689927171331, 0.03261595015791206, 0.18179248112026786, 0.11297958866839321, 0.10259285510694685, 0.1658174475291282, -0.07948136342350733, -0.1666350875065223, -0.32680202301299155, -0.20720247083251203, -0.19516028613544817, 0.11876550839428814, -0.12224816751025602, -0.16109458503336455, 0.4023171203455206, 0.16877595052673397, 0.18294669822443368, 0.05030036637028448, 0.2556561640125107, 0.1642020017154946, 0.03550490640365511, 0.07708574870932262, 0.15495802134406284, 0.10177232646806673, 0.0695769048242037, -0.23903590076110395, 0.09882804047516432, 0.0500906851908244]
|
1,803.08259
|
Reference-Frame-Independent Measurement-Device-Independent Quantum Key
Distribution with Uncharacterized Qubits
|
We propose a reference-frame-independent measurement-device-independent
quantum key distribution with uncharacterized quantum bits. We show the
security of the protocol. The protocol can also be useful for a channel that
has a very low bit error rate but suffers a large, uncontrolled (but slow),
unitary rotation.
|
quant-ph
|
we propose a referenceframeindependent measurementdeviceindependent quantum key distribution with uncharacterized quantum bits we show the security of the protocol the protocol can also be useful for a channel that has a very low bit error rate but suffers a large uncontrolled but slow unitary rotation
|
[['we', 'propose', 'a', 'referenceframeindependent', 'measurementdeviceindependent', 'quantum', 'key', 'distribution', 'with', 'uncharacterized', 'quantum', 'bits', 'we', 'show', 'the', 'security', 'of', 'the', 'protocol', 'the', 'protocol', 'can', 'also', 'be', 'useful', 'for', 'a', 'channel', 'that', 'has', 'a', 'very', 'low', 'bit', 'error', 'rate', 'but', 'suffers', 'a', 'large', 'uncontrolled', 'but', 'slow', 'unitary', 'rotation']]
|
[-0.23499626959156658, 0.1528129278889133, -0.14082896378305224, 0.061110710338430685, 0.03443458722386923, -0.32236534497804115, 0.13107610851940182, 0.3582124084027277, -0.270755171113544, -0.26442157841391034, 0.10080398538460335, -0.15644468143582344, -0.13041461745484006, 0.2399491392282976, -0.2222666173759434, 0.14044743755625355, 0.08290777651386129, 0.023456845722264714, -0.06314192593822049, -0.2507008193888598, 0.2653316893511348, 0.09442636450856096, 0.32317646965384483, 0.02836838960647583, 0.1544648182681865, -0.024134651250723334, 0.048291403769205016, -0.07819090162714322, -0.09195542214001762, 0.06134404074400664, 0.26711867137087714, 0.15884279803269438, 0.2946885861456394, -0.3714747542929318, -0.21188139249053267, 0.08655299117995632, 0.17467031745860975, 0.2726718240727981, -0.13973511850668324, -0.2726697475132015, 0.11471965457830165, -0.2509176673160659, -0.05749436306456725, -0.09897138006571267, -0.02201231900188658, -0.029060186704413758, -0.2867857199990087, 0.08951175357150432, 0.04301643531847124, 0.021602222123571362, 0.10608362584478326, -0.03037453316307316, 0.06896156430658366, 0.18107559392228723, -0.034118195028147766, 0.05734315865880085, 0.15793186316473617, -0.11863136013141937, -0.1196719071517388, 0.36075655584120087, -0.04921896565291617, -0.1951545109765397, 0.11188407473188515, -0.11585015073004697, -0.13107226195020807, 0.09976449120375845, 0.17209685053676366, 0.07364323594503933, -0.1229799133621984, 0.04629965719003748, -0.04497489465607537, 0.2851510023077329, -0.0028483958914875982, 0.18551308602715533, 0.14534083230731387, 0.1073716155356831, 0.07263214704063203, 0.13462491049689965, -0.16604568055934377, -0.15043545319802232, -0.2726282715021322, -0.19958966029031824, -0.24597770989769036, 0.1348013423797157, -0.10160929350596336, -0.12499011608047618, 0.34285057569957444, 0.1515205412068301, 0.1835760900957717, 0.047836582962837486, 0.3833810145656268, 0.11733295833174553, 0.0778802918891112, 0.1532313460070226, 0.19964906407727134, 0.10118294786661863, 0.07553975495199362, -0.18971687459076444, 0.18358980815650688, -0.027051545100079642]
|
1,803.0826
|
High density carriers at a strongly coupled graphene-topological
insulator interface
|
We report on a strongly coupled bilayer graphene (BLG) - \bise\ device with a
junction resistance of less than 1.5 k$\Omega\mu$m$^2$. This device exhibits
unique behavior at the interface, which cannot be attributed to either material
in absence of the other. We observe quantum oscillations in the
magnetoresistance of the junction, indicating the presence of well-resolved
Landau levels due to hole carriers of unknown origin with a very large Fermi
surface. These carriers, found only at the interface, could conceivably arise
due to significant hole doping of the bilayer graphene with charge transfer on
the order of 2$\times$10$^{13}$ cm$^{-2}$, or due to twist angle dependent
mini-band transport.
|
cond-mat.mes-hall
|
we report on a strongly coupled bilayer graphene blg bise device with a junction resistance of less than 15 komegamum2 this device exhibits unique behavior at the interface which cannot be attributed to either material in absence of the other we observe quantum oscillations in the magnetoresistance of the junction indicating the presence of wellresolved landau levels due to hole carriers of unknown origin with a very large fermi surface these carriers found only at the interface could conceivably arise due to significant hole doping of the bilayer graphene with charge transfer on the order of 2times1013 cm2 or due to twist angle dependent miniband transport
|
[['we', 'report', 'on', 'a', 'strongly', 'coupled', 'bilayer', 'graphene', 'blg', 'bise', 'device', 'with', 'a', 'junction', 'resistance', 'of', 'less', 'than', '15', 'komegamum2', 'this', 'device', 'exhibits', 'unique', 'behavior', 'at', 'the', 'interface', 'which', 'can', 'not', 'be', 'attributed', 'to', 'either', 'material', 'in', 'absence', 'of', 'the', 'other', 'we', 'observe', 'quantum', 'oscillations', 'in', 'the', 'magnetoresistance', 'of', 'the', 'junction', 'indicating', 'the', 'presence', 'of', 'wellresolved', 'landau', 'levels', 'due', 'to', 'hole', 'carriers', 'of', 'unknown', 'origin', 'with', 'a', 'very', 'large', 'fermi', 'surface', 'these', 'carriers', 'found', 'only', 'at', 'the', 'interface', 'could', 'conceivably', 'arise', 'due', 'to', 'significant', 'hole', 'doping', 'of', 'the', 'bilayer', 'graphene', 'with', 'charge', 'transfer', 'on', 'the', 'order', 'of', '2times1013', 'cm2', 'or', 'due', 'to', 'twist', 'angle', 'dependent', 'miniband', 'transport']]
|
[-0.21755716301039488, 0.15934616741593752, -0.017840513942119118, -0.011935435354091644, -0.022603910607851555, -0.21298281498096674, 0.0858855237313938, 0.3554113972322824, -0.25068969689918874, -0.35643046594738403, -0.004613914951860522, -0.3079064916993413, -0.12544999867198972, 0.18623583045544398, -0.03199086431563488, -0.040554916294657184, 0.009620545676770124, -0.056875534155449575, -0.06924671293279835, -0.16719015439641532, 0.3013499347388605, 0.04732375139714367, 0.30587356500153506, 0.13440548877501599, 0.060227505941048406, -0.026152709551225197, 0.10843147672973921, 0.04206132495375437, -0.10709550917035983, 0.04527855463430425, 0.2402491666676877, -0.18354186689846705, 0.18836520410743413, -0.48358685069795804, -0.18761066638942914, -0.011140654089851914, 0.15691907105044783, 0.15413491633638007, -0.07423261192270389, -0.2525359015459212, 0.07303286651062353, -0.1509031658561326, -0.1134575439582222, -0.013584197129484128, -0.027642443810946472, -0.051025594599875754, -0.17496978653873377, 0.13282366466891266, 0.012700747106676904, 0.033391268694312005, -0.0671096893863004, -0.11184974190034842, -0.10981251944779097, 0.04476721968369071, 0.09523421306398079, 0.044809628495615775, 0.22313227211603912, -0.14058584785067138, -0.07986136796562193, 0.3649204831013334, -0.06720082671340734, -0.12369729174196581, 0.23002270502952216, -0.2735990929965661, -0.023013393742807, 0.19287518840109077, 0.1288783965397313, 0.08062958290635078, -0.140146517969459, 0.05467159434865777, 0.010073916473051656, 0.20299365036363634, 0.08904438455824122, 0.10312176813919828, 0.31720470992204186, 0.15401538504966508, 0.07261666148970618, 0.11185106120635886, -0.15870210837799115, -0.0015640840060556324, -0.20638016668783726, -0.15012184952638138, -0.18577911438437822, 0.15351201534920228, -0.05215224232002397, -0.23645903119625888, 0.41621574612386597, 0.14302112692183702, 0.20128456492708108, -0.07618965878190526, 0.2066353848639214, 0.15248789512944, 0.12340426610382361, 0.03652983347702528, 0.24181198058802217, 0.12807360602647205, 0.12409634719315533, -0.2897521674624322, 0.10958309587152135, -0.06166443928519142]
|
1,803.08261
|
Inverse Scattering Method I. Methodological part with an example:
Soliton solution of the Sine-Gordon Equation
|
The aim of this paper is to introduce the Inverse Scattering Method for later
studies of some problems in nonlinear dynamics, and describe the kink solution
of the Sine Gordon Equation using the Inverse Scattering Method as a
methodological example, the soliton solution is well known.
|
nlin.SI
|
the aim of this paper is to introduce the inverse scattering method for later studies of some problems in nonlinear dynamics and describe the kink solution of the sine gordon equation using the inverse scattering method as a methodological example the soliton solution is well known
|
[['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'introduce', 'the', 'inverse', 'scattering', 'method', 'for', 'later', 'studies', 'of', 'some', 'problems', 'in', 'nonlinear', 'dynamics', 'and', 'describe', 'the', 'kink', 'solution', 'of', 'the', 'sine', 'gordon', 'equation', 'using', 'the', 'inverse', 'scattering', 'method', 'as', 'a', 'methodological', 'example', 'the', 'soliton', 'solution', 'is', 'well', 'known']]
|
[-0.07677196701178732, 0.01661990024149418, -0.10563997657078764, 0.11996126858993313, -0.12614598975557348, -0.10421785223297775, -0.03607653342339251, 0.33449983742573985, -0.3127079430319693, -0.25525593644250993, 0.16538526037576326, -0.29772666444920975, -0.2569395753190569, 0.21898040430539328, 0.015580747600482859, 0.13424401309179224, 0.04767914525354686, 0.014267637212153362, -0.04503650385279046, -0.17762581402253683, 0.3546781814859613, 0.04076935136285813, 0.24806074146181345, 0.07027583838561954, 0.11575016134378055, 0.01113602474493825, -0.04422757185428687, -0.028119366413549236, -0.14207775387710528, 0.09261559306279472, 0.23560907875450895, 0.11900704378343147, 0.27320376470806484, -0.38589352199240873, -0.22109289692066933, 0.03904519040066668, 0.18270901193761308, 0.16289410913747776, -0.06610552237733551, -0.2645935873581987, 0.01660843653118481, -0.11976145305063414, -0.21924081396655706, -0.052653219824170934, 0.017253673767023112, 0.0472716981869029, -0.2180272683136813, 0.10601246314447212, 0.09377220150275642, -0.02012456524307313, -0.11846790576110715, -0.0799955792279671, 0.07921778551889988, 0.036988449566390205, 0.10100299199921606, -0.0023935187668742046, 0.03252782737431319, -0.14254520269131046, -0.1274799907822972, 0.39967548032291234, -0.07686491452319466, -0.2205594886580239, 0.13369890517028776, -0.0952035222283524, -0.061235775786411505, 0.11742746147691556, 0.18201253077258234, 0.1765357905128242, -0.18812927387087888, 0.11829910299654686, -0.07089924712098487, 0.107216350612757, 0.0803893502832026, -0.06262616076223228, 0.1235964571773682, 0.24097801979793154, 0.053866702476111444, 0.1780910780450896, -0.0678885706052508, -0.06742151227334271, -0.32520242614428635, -0.1688645423349479, -0.1673799060517922, 0.058169698018742645, -0.038791601262346376, -0.19917484538872604, 0.40487482236779254, 0.15119666217461877, 0.16441911207916943, 0.014753348720462425, 0.2969519347964745, 0.21311969477835152, 0.007717648571681069, 0.04622456967911642, 0.19683885899607761, 0.18213604231688962, 0.15567476595448249, -0.28040044868121977, -0.005891127430874369, 0.1286174540569925]
|
1,803.08262
|
Dynamic Morphologies and Stability of Droplet Interface Bilayers
|
We develop a theoretical framework for understanding dynamic morphologies and
stability of droplet interface bilayers (DIBs), accounting for lipid kinetics
in the monolayers and bilayer, and droplet evaporation due to imbalance between
osmotic and Laplace pressures. Our theory quantitatively describes distinct
pathways observed in experiments when DIBs become unstable. We find that when
the timescale for lipid desorption is slow compared to droplet evaporation, the
lipid bilayer will grow and the droplets approach a hemispherical shape. In
contrast, when lipid desorption is fast, the bilayer area will shrink and the
droplets eventually detach. Our model also suggests there is a critical size
below which DIBs cannot be stable, which may explain experimental difficulties
in miniaturising the DIB platform.
|
cond-mat.soft physics.bio-ph physics.chem-ph
|
we develop a theoretical framework for understanding dynamic morphologies and stability of droplet interface bilayers dibs accounting for lipid kinetics in the monolayers and bilayer and droplet evaporation due to imbalance between osmotic and laplace pressures our theory quantitatively describes distinct pathways observed in experiments when dibs become unstable we find that when the timescale for lipid desorption is slow compared to droplet evaporation the lipid bilayer will grow and the droplets approach a hemispherical shape in contrast when lipid desorption is fast the bilayer area will shrink and the droplets eventually detach our model also suggests there is a critical size below which dibs cannot be stable which may explain experimental difficulties in miniaturising the dib platform
|
[['we', 'develop', 'a', 'theoretical', 'framework', 'for', 'understanding', 'dynamic', 'morphologies', 'and', 'stability', 'of', 'droplet', 'interface', 'bilayers', 'dibs', 'accounting', 'for', 'lipid', 'kinetics', 'in', 'the', 'monolayers', 'and', 'bilayer', 'and', 'droplet', 'evaporation', 'due', 'to', 'imbalance', 'between', 'osmotic', 'and', 'laplace', 'pressures', 'our', 'theory', 'quantitatively', 'describes', 'distinct', 'pathways', 'observed', 'in', 'experiments', 'when', 'dibs', 'become', 'unstable', 'we', 'find', 'that', 'when', 'the', 'timescale', 'for', 'lipid', 'desorption', 'is', 'slow', 'compared', 'to', 'droplet', 'evaporation', 'the', 'lipid', 'bilayer', 'will', 'grow', 'and', 'the', 'droplets', 'approach', 'a', 'hemispherical', 'shape', 'in', 'contrast', 'when', 'lipid', 'desorption', 'is', 'fast', 'the', 'bilayer', 'area', 'will', 'shrink', 'and', 'the', 'droplets', 'eventually', 'detach', 'our', 'model', 'also', 'suggests', 'there', 'is', 'a', 'critical', 'size', 'below', 'which', 'dibs', 'can', 'not', 'be', 'stable', 'which', 'may', 'explain', 'experimental', 'difficulties', 'in', 'miniaturising', 'the', 'dib', 'platform']]
|
[-0.07744810876231324, 0.21530415441533077, -0.11337814405876195, 0.04582871813465194, -0.011701582804701086, -0.18089885864075336, 0.03276137548984202, 0.4135899162077803, -0.2578237307084314, -0.2599042827841605, -0.0016817049462727067, -0.2672201050800603, -0.18229119776416633, 0.15994526234936854, -0.053923303888858125, 0.010970068065512735, 0.03499438515785387, -0.11868003422741667, 0.037708287310818114, -0.21376893975598327, 0.21739271868975296, 0.012689363306104127, 0.2908875983902964, 0.2001373929650349, 0.005048324981451792, -0.08252059741703383, 0.07924322707783747, 0.047145107543979915, -0.24974391094668644, 0.0670376030365163, 0.2695634275560378, -0.039569117586617755, 0.21927152960403365, -0.48002547754953473, -0.2433421727648731, 0.03089613804072773, 0.20541335861751084, 0.17427007214884446, -0.07353281409512234, -0.24755170760810438, 0.06302493123211346, -0.1319626418052841, -0.12722036978861284, -0.05361237891819486, 0.052318908270227456, 0.015431482597427854, -0.23586018437961653, 0.1542980860387492, 0.02680540574177847, 0.06319006974414243, -0.16701294791932075, -0.09558654550309549, -0.08655157573994691, 0.08853730967961906, 0.0913330892237077, -0.01959392328359881, 0.2967417028622102, -0.10953996805237386, -0.020349799519231132, 0.39467358359893373, -0.026476673126788967, -0.14299395080592672, 0.2237076696040014, -0.18044795138935038, -0.08474583707560422, 0.20912750759083082, 0.14724951299791367, 0.08888449086570892, -0.11754351458499915, -0.013743849328158707, -0.019344291349841378, 0.2330652692599885, 0.10603184448910277, -0.043939014111440314, 0.30247785165211405, 0.23305087135532493, 0.05024647120765205, 0.13886099875316624, -0.11612818920116683, -0.11573653452698204, -0.19250643906436102, -0.1976084234202833, -0.128557915369175, 0.014811763538060498, -0.07340115348939681, -0.2018235438755887, 0.33332307508878284, 0.12768033078291563, 0.19359382079377518, 0.04587674590017078, 0.28215990944418234, 0.025319128358930004, 0.07127272815964485, 0.022734820870366896, 0.23150193111150194, 0.1085328543953345, 0.13334665498775194, -0.25732799030650977, 0.1357539529153501, -0.004689794720418878]
|
1,803.08263
|
Galaxy interactions in loose galaxy groups: KAT-7 and VLA HI
Observations of the IC 1459 group
|
We report on the results from deep HI observations, performed with the Karoo
Array Telescope and with the Karl G. Jansky Very Large Array of the loose
galaxy group centred on the early-type galaxy IC 1459. The main result from our
observations is the detection of a nearly continuous, 500-kpc long HI tail
which crosses the entire group. Earlier observations with the Australia
Telescope Compact Array had shown the presence of a large HI tail in this
galaxy group, but because of the much larger coverage of the new data, the full
extent of this tail is now visible. The HI mass of this structure is 3.1 +- 0.3
10^9 Msun . Based on its morphology and kinematics, we conclude that the tail
consists of gas stripped from NGC 7418 through tidal interactions, with
ram-pressure affects playing at most a minor role. Optical images of the IC
1459 group do not show many indications that galaxy interactions are common in
this group. The HI data reveal a very different picture and show that almost
all gas-rich galaxies in the IC 1459 group have a distorted HI distribution
indicating that many interactions are occurring in this group. This high number
of interactions shows that the processes that drive galaxy transformation are
also occurring in fairly loose galaxy groups.
|
astro-ph.GA
|
we report on the results from deep hi observations performed with the karoo array telescope and with the karl g jansky very large array of the loose galaxy group centred on the earlytype galaxy ic 1459 the main result from our observations is the detection of a nearly continuous 500kpc long hi tail which crosses the entire group earlier observations with the australia telescope compact array had shown the presence of a large hi tail in this galaxy group but because of the much larger coverage of the new data the full extent of this tail is now visible the hi mass of this structure is 31 03 109 msun based on its morphology and kinematics we conclude that the tail consists of gas stripped from ngc 7418 through tidal interactions with rampressure affects playing at most a minor role optical images of the ic 1459 group do not show many indications that galaxy interactions are common in this group the hi data reveal a very different picture and show that almost all gasrich galaxies in the ic 1459 group have a distorted hi distribution indicating that many interactions are occurring in this group this high number of interactions shows that the processes that drive galaxy transformation are also occurring in fairly loose galaxy groups
|
[['we', 'report', 'on', 'the', 'results', 'from', 'deep', 'hi', 'observations', 'performed', 'with', 'the', 'karoo', 'array', 'telescope', 'and', 'with', 'the', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'of', 'the', 'loose', 'galaxy', 'group', 'centred', 'on', 'the', 'earlytype', 'galaxy', 'ic', '1459', 'the', 'main', 'result', 'from', 'our', 'observations', 'is', 'the', 'detection', 'of', 'a', 'nearly', 'continuous', '500kpc', 'long', 'hi', 'tail', 'which', 'crosses', 'the', 'entire', 'group', 'earlier', 'observations', 'with', 'the', 'australia', 'telescope', 'compact', 'array', 'had', 'shown', 'the', 'presence', 'of', 'a', 'large', 'hi', 'tail', 'in', 'this', 'galaxy', 'group', 'but', 'because', 'of', 'the', 'much', 'larger', 'coverage', 'of', 'the', 'new', 'data', 'the', 'full', 'extent', 'of', 'this', 'tail', 'is', 'now', 'visible', 'the', 'hi', 'mass', 'of', 'this', 'structure', 'is', '31', '03', '109', 'msun', 'based', 'on', 'its', 'morphology', 'and', 'kinematics', 'we', 'conclude', 'that', 'the', 'tail', 'consists', 'of', 'gas', 'stripped', 'from', 'ngc', '7418', 'through', 'tidal', 'interactions', 'with', 'rampressure', 'affects', 'playing', 'at', 'most', 'a', 'minor', 'role', 'optical', 'images', 'of', 'the', 'ic', '1459', 'group', 'do', 'not', 'show', 'many', 'indications', 'that', 'galaxy', 'interactions', 'are', 'common', 'in', 'this', 'group', 'the', 'hi', 'data', 'reveal', 'a', 'very', 'different', 'picture', 'and', 'show', 'that', 'almost', 'all', 'gasrich', 'galaxies', 'in', 'the', 'ic', '1459', 'group', 'have', 'a', 'distorted', 'hi', 'distribution', 'indicating', 'that', 'many', 'interactions', 'are', 'occurring', 'in', 'this', 'group', 'this', 'high', 'number', 'of', 'interactions', 'shows', 'that', 'the', 'processes', 'that', 'drive', 'galaxy', 'transformation', 'are', 'also', 'occurring', 'in', 'fairly', 'loose', 'galaxy', 'groups']]
|
[-0.1273217895986014, 0.06937571961735917, -0.09304366068221455, 0.05631722473961756, -0.10706468021367178, -0.038809404314257376, 0.00415489106698958, 0.4518200049566668, -0.14765263400582035, -0.31626725164783553, 0.08906139722472967, -0.2868859785175774, -0.1026003226756963, 0.18856776469376285, 0.00022580624493055565, -0.09349936201794852, 0.10552037794922674, -0.06157881242526305, -0.035219633316101374, -0.2705439292306966, 0.2982616485843738, 0.0921390034159548, 0.20615284452106544, -0.022099019132749458, 0.08541242582831791, -0.0716124608278881, -0.09153964490748855, -0.04065962774072622, -0.08953060471705908, 0.035048244878389805, 0.24912985663882695, 0.08175012653390336, 0.2417710873395811, -0.3758789356732958, -0.18774900975695347, 0.06694905905061141, 0.1836573978127955, 0.032282833102549056, -0.10202929299530508, -0.3373706839393911, 0.05207281984432146, -0.2175673537725193, -0.16732152209855441, 0.09693246219864894, 0.02402412602298915, 0.043430350302870194, -0.18009201601326336, 0.13442570218363936, 0.02514918358390068, 0.09076114205513583, -0.0559106212114742, -0.10439840924904444, -0.017488970676826875, 0.10924689938086843, 0.007844867688322137, 0.07049050629788707, 0.17290440276914903, -0.15393444139098877, 0.03981059693818002, 0.41942637032547664, -0.05324859101281956, 0.015193795802634816, 0.256422359699405, -0.2708184721771368, -0.24383391922036576, 0.15268606185739816, 0.15343753888358383, 0.06064574564617604, -0.13437747776705966, 0.06864099470102553, -0.11469467941801562, 0.21051548882604165, 0.0188767493009394, 0.049286679265517094, 0.2542272453218005, 0.1162050637232443, 0.0737029786692759, 0.09305411904378859, -0.18469808032671206, -0.008063153424408546, -0.22534837104423447, -0.0736694562357179, -0.155873612900871, 0.09474384651396174, -0.13357441274233997, -0.12168147047090908, 0.3361959714940641, 0.0927158411722197, 0.24043174900526051, 0.07447159011025242, 0.2739319098117047, 0.008566149797961982, 0.15955380763544505, 0.10942133939716706, 0.277190935642047, 0.15987196200592227, 0.020749852330922042, -0.21759491958222243, 0.06842762090179116, -0.02688130560969977]
|
1,803.08264
|
IMHOTEP - Virtual Reality Framework for Surgical Applications
|
Purpose: The data which is available to surgeons before, during and after
surgery is steadily increasing in quantity as well as diversity. When planning
a patient's treatment, this large amount of information can be difficult to
interpret. To aid in processing the information, new methods need to be found
to present multi-modal patient data, ideally combining textual, imagery,
temporal and 3D data in a holistic and context-aware system. Methods: We
present an open-source framework which allows handling of patient data in a
virtual reality (VR) environment. By using VR technology, the workspace
available to the surgeon is maximized and 3D patient data is rendered in
stereo, which increases depth perception. The framework organizes the data into
workspaces and contains tools which allow users to control, manipulate and
enhance the data. Due to the framework's modular design, it can easily be
adapted and extended for various clinical applications. Results: The framework
was evaluated by clinical personnel (77 participants). The majority of the
group stated that a complex surgical situation is easier to comprehend by using
the framework, and that it is very well suited for education. Furthermore, the
application to various clinical scenarios - including the simulation of
excitation-propagation in the human atrium - demonstrated the framework's
adaptability. As a feasibility study, the framework was used during the
planning phase of the surgical removal of a large central carcinoma from a
patient's liver. Conclusion: The clinical evaluation showed a large potential
and high acceptance for the VR environment in a medical context. The various
applications confirmed that the framework is easily extended and can be used in
real-time simulation as well as for the manipulation of complex anatomical
structures.
|
cs.HC
|
purpose the data which is available to surgeons before during and after surgery is steadily increasing in quantity as well as diversity when planning a patients treatment this large amount of information can be difficult to interpret to aid in processing the information new methods need to be found to present multimodal patient data ideally combining textual imagery temporal and 3d data in a holistic and contextaware system methods we present an opensource framework which allows handling of patient data in a virtual reality vr environment by using vr technology the workspace available to the surgeon is maximized and 3d patient data is rendered in stereo which increases depth perception the framework organizes the data into workspaces and contains tools which allow users to control manipulate and enhance the data due to the frameworks modular design it can easily be adapted and extended for various clinical applications results the framework was evaluated by clinical personnel 77 participants the majority of the group stated that a complex surgical situation is easier to comprehend by using the framework and that it is very well suited for education furthermore the application to various clinical scenarios including the simulation of excitationpropagation in the human atrium demonstrated the frameworks adaptability as a feasibility study the framework was used during the planning phase of the surgical removal of a large central carcinoma from a patients liver conclusion the clinical evaluation showed a large potential and high acceptance for the vr environment in a medical context the various applications confirmed that the framework is easily extended and can be used in realtime simulation as well as for the manipulation of complex anatomical structures
|
[['purpose', 'the', 'data', 'which', 'is', 'available', 'to', 'surgeons', 'before', 'during', 'and', 'after', 'surgery', 'is', 'steadily', 'increasing', 'in', 'quantity', 'as', 'well', 'as', 'diversity', 'when', 'planning', 'a', 'patients', 'treatment', 'this', 'large', 'amount', 'of', 'information', 'can', 'be', 'difficult', 'to', 'interpret', 'to', 'aid', 'in', 'processing', 'the', 'information', 'new', 'methods', 'need', 'to', 'be', 'found', 'to', 'present', 'multimodal', 'patient', 'data', 'ideally', 'combining', 'textual', 'imagery', 'temporal', 'and', '3d', 'data', 'in', 'a', 'holistic', 'and', 'contextaware', 'system', 'methods', 'we', 'present', 'an', 'opensource', 'framework', 'which', 'allows', 'handling', 'of', 'patient', 'data', 'in', 'a', 'virtual', 'reality', 'vr', 'environment', 'by', 'using', 'vr', 'technology', 'the', 'workspace', 'available', 'to', 'the', 'surgeon', 'is', 'maximized', 'and', '3d', 'patient', 'data', 'is', 'rendered', 'in', 'stereo', 'which', 'increases', 'depth', 'perception', 'the', 'framework', 'organizes', 'the', 'data', 'into', 'workspaces', 'and', 'contains', 'tools', 'which', 'allow', 'users', 'to', 'control', 'manipulate', 'and', 'enhance', 'the', 'data', 'due', 'to', 'the', 'frameworks', 'modular', 'design', 'it', 'can', 'easily', 'be', 'adapted', 'and', 'extended', 'for', 'various', 'clinical', 'applications', 'results', 'the', 'framework', 'was', 'evaluated', 'by', 'clinical', 'personnel', '77', 'participants', 'the', 'majority', 'of', 'the', 'group', 'stated', 'that', 'a', 'complex', 'surgical', 'situation', 'is', 'easier', 'to', 'comprehend', 'by', 'using', 'the', 'framework', 'and', 'that', 'it', 'is', 'very', 'well', 'suited', 'for', 'education', 'furthermore', 'the', 'application', 'to', 'various', 'clinical', 'scenarios', 'including', 'the', 'simulation', 'of', 'excitationpropagation', 'in', 'the', 'human', 'atrium', 'demonstrated', 'the', 'frameworks', 'adaptability', 'as', 'a', 'feasibility', 'study', 'the', 'framework', 'was', 'used', 'during', 'the', 'planning', 'phase', 'of', 'the', 'surgical', 'removal', 'of', 'a', 'large', 'central', 'carcinoma', 'from', 'a', 'patients', 'liver', 'conclusion', 'the', 'clinical', 'evaluation', 'showed', 'a', 'large', 'potential', 'and', 'high', 'acceptance', 'for', 'the', 'vr', 'environment', 'in', 'a', 'medical', 'context', 'the', 'various', 'applications', 'confirmed', 'that', 'the', 'framework', 'is', 'easily', 'extended', 'and', 'can', 'be', 'used', 'in', 'realtime', 'simulation', 'as', 'well', 'as', 'for', 'the', 'manipulation', 'of', 'complex', 'anatomical', 'structures']]
|
[-0.02602168788307939, 0.042731425987651825, -0.08128242194313895, 0.0856029761351899, -0.09574960819022223, -0.1420227290181951, 0.025732153100384906, 0.413732888197357, -0.23760805095461282, -0.35374994605440985, 0.14614747721024535, -0.24171634835873687, -0.16348259219053116, 0.23659449224148624, -0.1570654661115259, 0.08317878717429597, 0.12780305305580525, 0.03568857638758015, 0.0006322260082445362, -0.22729671342256055, 0.2546641741532155, 0.05581641218625009, 0.33718298308212646, 0.07461167757230049, 0.06337571796622465, 0.0555821894151582, -0.03149499504562383, 0.03273430986160582, -0.0471282711303105, 0.14779019961472262, 0.3710613513619385, 0.23670970850200815, 0.31679149473086, -0.4418555027856068, -0.2236928604335778, 0.05642531255090778, 0.13572420413267205, 0.09252230549231172, -0.046459523463113744, -0.34630136574872517, 0.08506553615358743, -0.18677495106335051, -0.09243615281683477, -0.11244775255634026, -0.0026560207405550915, -0.020878179758279162, -0.299735262428241, 0.023787372034381738, -0.03042748392009261, 0.1153889840688895, -0.09003069020659578, -0.04621833872261711, -0.007875092121433806, 0.2257831507621714, 0.03209662783975628, 0.07626835070762106, 0.1533214274759997, -0.15749681120897135, -0.11191468893635002, 0.4174114562858912, 0.021140813631936907, -0.1827647279456935, 0.21059355060612275, -0.07539434897628698, -0.10671483917553401, 0.11784224612384357, 0.21328062369742176, 0.10438166217963127, -0.21634927421411373, 0.011664963537742469, 0.04102933478076011, 0.16422226389785383, 0.012935184866020626, -0.03725408689118922, 0.17970661355436526, 0.2180981372207911, 0.003392062812874263, 0.14326230893673544, -0.10735762583261187, -0.05349134858528321, -0.23376698601652277, -0.19653197821822357, -0.14696423051243818, -0.03669860486406833, -0.07511853651598689, -0.11838924782519991, 0.3688265117054636, 0.20192333541630597, 0.15893589971163732, 0.009272234665060585, 0.3550708229501139, 0.032995081916954154, 0.14422047631899743, 0.029213443485681306, 0.15118847795211796, 0.020073703917302985, 0.17852177279408682, -0.18051398985257203, 0.10079958508129824, -0.02487356121334332]
|
1,803.08265
|
The generating function of planar Eulerian orientations
|
The enumeration of planar maps equipped with an Eulerian orientation has
attracted attention in both combinatorics and theoretical physics since at
least 2000. The case of 4-valent maps is particularly interesting: these
orientations are in bijection with properly 3-coloured quadrangulations, while
in physics they correspond to configurations of the ice model.
We solve both problems -- namely the enumeration of planar Eulerian
orientations and of 4-valent planar Eulerian orientations -- by expressing the
associated generating functions as the inverses (for the composition of series)
of simple hypergeometric series. Using these expressions, we derive the
asymptotic behaviour of the number of planar Eulerian orientations, thus
proving earlier predictions of Kostov, Zinn-Justin, Elvey Price and Guttmann.
This behaviour, $\mu^n /(n \log n)^2$, prevents the associated generating
functions from being D-finite. Still, these generating functions are
differentially algebraic, as they satisfy non-linear differential equations of
order $2$. Differential algebraicity has recently been proved for other map
problems, in particular for maps equipped with a Potts model.
Our solutions mix recursive and bijective ingredients. In particular, a
preliminary bijection transforms our oriented maps into maps carrying a height
function on their vertices. In the 4-valent case, we also observe an unexpected
connection with the enumeration of maps equipped with a spanning tree that is
internally inactive in the sense of Tutte. This connection remains to be
explained combinatorially.
|
math.CO
|
the enumeration of planar maps equipped with an eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000 the case of 4valent maps is particularly interesting these orientations are in bijection with properly 3coloured quadrangulations while in physics they correspond to configurations of the ice model we solve both problems namely the enumeration of planar eulerian orientations and of 4valent planar eulerian orientations by expressing the associated generating functions as the inverses for the composition of series of simple hypergeometric series using these expressions we derive the asymptotic behaviour of the number of planar eulerian orientations thus proving earlier predictions of kostov zinnjustin elvey price and guttmann this behaviour mun n log n2 prevents the associated generating functions from being dfinite still these generating functions are differentially algebraic as they satisfy nonlinear differential equations of order 2 differential algebraicity has recently been proved for other map problems in particular for maps equipped with a potts model our solutions mix recursive and bijective ingredients in particular a preliminary bijection transforms our oriented maps into maps carrying a height function on their vertices in the 4valent case we also observe an unexpected connection with the enumeration of maps equipped with a spanning tree that is internally inactive in the sense of tutte this connection remains to be explained combinatorially
|
[['the', 'enumeration', 'of', 'planar', 'maps', 'equipped', 'with', 'an', 'eulerian', 'orientation', 'has', 'attracted', 'attention', 'in', 'both', 'combinatorics', 'and', 'theoretical', 'physics', 'since', 'at', 'least', '2000', 'the', 'case', 'of', '4valent', 'maps', 'is', 'particularly', 'interesting', 'these', 'orientations', 'are', 'in', 'bijection', 'with', 'properly', '3coloured', 'quadrangulations', 'while', 'in', 'physics', 'they', 'correspond', 'to', 'configurations', 'of', 'the', 'ice', 'model', 'we', 'solve', 'both', 'problems', 'namely', 'the', 'enumeration', 'of', 'planar', 'eulerian', 'orientations', 'and', 'of', '4valent', 'planar', 'eulerian', 'orientations', 'by', 'expressing', 'the', 'associated', 'generating', 'functions', 'as', 'the', 'inverses', 'for', 'the', 'composition', 'of', 'series', 'of', 'simple', 'hypergeometric', 'series', 'using', 'these', 'expressions', 'we', 'derive', 'the', 'asymptotic', 'behaviour', 'of', 'the', 'number', 'of', 'planar', 'eulerian', 'orientations', 'thus', 'proving', 'earlier', 'predictions', 'of', 'kostov', 'zinnjustin', 'elvey', 'price', 'and', 'guttmann', 'this', 'behaviour', 'mun', 'n', 'log', 'n2', 'prevents', 'the', 'associated', 'generating', 'functions', 'from', 'being', 'dfinite', 'still', 'these', 'generating', 'functions', 'are', 'differentially', 'algebraic', 'as', 'they', 'satisfy', 'nonlinear', 'differential', 'equations', 'of', 'order', '2', 'differential', 'algebraicity', 'has', 'recently', 'been', 'proved', 'for', 'other', 'map', 'problems', 'in', 'particular', 'for', 'maps', 'equipped', 'with', 'a', 'potts', 'model', 'our', 'solutions', 'mix', 'recursive', 'and', 'bijective', 'ingredients', 'in', 'particular', 'a', 'preliminary', 'bijection', 'transforms', 'our', 'oriented', 'maps', 'into', 'maps', 'carrying', 'a', 'height', 'function', 'on', 'their', 'vertices', 'in', 'the', '4valent', 'case', 'we', 'also', 'observe', 'an', 'unexpected', 'connection', 'with', 'the', 'enumeration', 'of', 'maps', 'equipped', 'with', 'a', 'spanning', 'tree', 'that', 'is', 'internally', 'inactive', 'in', 'the', 'sense', 'of', 'tutte', 'this', 'connection', 'remains', 'to', 'be', 'explained', 'combinatorially']]
|
[-0.14525233048469469, 0.1045237842409153, -0.05743764483631163, 0.07167115267597948, -0.09122716207731499, -0.12390928345888313, -0.011129125704087013, 0.38086516099952467, -0.2858984172038683, -0.3028934498894875, 0.08398008115886715, -0.2969651799838636, -0.18316137253273093, 0.184490374760382, -0.07133363695537073, 0.039161959280601254, 0.035358023461021855, 0.007962581895426658, -0.07144494500323051, -0.25401411236398663, 0.29759506096144744, -0.011623899005690582, 0.21582263650064992, -0.000563874239169432, 0.12391654490514309, 0.01336621457281021, -0.049457733071360706, 0.04765807311956632, -0.15913624603347248, 0.11895112744537793, 0.2745008237851674, 0.09358152062042166, 0.15983831819054162, -0.41995160872057685, -0.13595919669352943, 0.1258697632059657, 0.13607038746322442, 0.05254849920057738, -0.04785093408324482, -0.20978253338764088, 0.05739762843086076, -0.10732267589236681, -0.14292729272490273, -0.05840607462935487, 0.05703873315255044, 0.07440754134662037, -0.24995917690405833, 0.008726827297607286, 0.09711877707543685, 0.10416181841907324, 0.0007759912310345141, -0.134555274084931, -0.06417281157126423, 0.13197528696438557, -0.0135478587332287, 0.058867342894416454, 0.023858136307802136, -0.1497735903051585, -0.14961001651869388, 0.3554170631689791, -0.0025818923185895537, -0.24605200930005489, 0.1792166792319843, -0.14267024782705395, -0.21159312891567386, 0.13531175857658467, 0.1235385314283294, 0.14733568294926197, -0.1030275816984403, 0.1286627316659915, -0.11824517676235931, 0.07154485409946615, 0.15922624671755872, -0.027494300761559294, 0.21372810811040358, 0.08464276046851414, 0.07550640360186744, 0.205010117908502, 0.004138225454065898, -0.11930938919150688, -0.2812349236869502, -0.12408003776452221, -0.1436548523392978, 0.04529765535702263, -0.13529318148387193, -0.20896815924538611, 0.37982570081612105, 0.09493412295929514, 0.2011776569292025, 0.14664120339194303, 0.22365483478116233, 0.10881268852116431, 0.04514261824631963, 0.051909304586369796, 0.13941327267330628, 0.21176757858391868, 0.04447631988299345, -0.13379640314179922, 0.08199172552434804, 0.16852187524376883]
|
1,803.08266
|
Local approximation operators on box meshes
|
This paper analyzes the approximation properties of spaces of piece-wise
tensor product polynomials over box meshes with a focus on application to
IsoGeometric Analysis (IGA). The errors are measured in Lebesgue norms.
Estimates of different types are considered: local and global, with full or
reduced Sobolev seminorms. Attention is also paid to the dependence on the
degree and exponential convergence is proved for the approximation of analytic
functions.
|
math.NA
|
this paper analyzes the approximation properties of spaces of piecewise tensor product polynomials over box meshes with a focus on application to isogeometric analysis iga the errors are measured in lebesgue norms estimates of different types are considered local and global with full or reduced sobolev seminorms attention is also paid to the dependence on the degree and exponential convergence is proved for the approximation of analytic functions
|
[['this', 'paper', 'analyzes', 'the', 'approximation', 'properties', 'of', 'spaces', 'of', 'piecewise', 'tensor', 'product', 'polynomials', 'over', 'box', 'meshes', 'with', 'a', 'focus', 'on', 'application', 'to', 'isogeometric', 'analysis', 'iga', 'the', 'errors', 'are', 'measured', 'in', 'lebesgue', 'norms', 'estimates', 'of', 'different', 'types', 'are', 'considered', 'local', 'and', 'global', 'with', 'full', 'or', 'reduced', 'sobolev', 'seminorms', 'attention', 'is', 'also', 'paid', 'to', 'the', 'dependence', 'on', 'the', 'degree', 'and', 'exponential', 'convergence', 'is', 'proved', 'for', 'the', 'approximation', 'of', 'analytic', 'functions']]
|
[-0.09556797000250834, 0.009248425827964264, -0.07242552431382458, 0.1013494189708795, -0.0622204697197851, -0.07462277210673646, -0.01706377590616124, 0.3794312369324924, -0.28889217224958186, -0.1987732504357529, 0.15562186209204168, -0.26780214300379157, -0.10741590326035615, 0.19060792790054726, -0.09581571686602033, 0.11453499656636268, 0.04337404473849079, 0.017913334338706646, -0.1597847698174198, -0.2883593338979956, 0.38533922745024457, 0.006604014156276689, 0.287574329344994, 0.04322761766311219, 0.07376347082283567, -0.03504089799517875, -0.1061429274336928, 0.018156060577466097, -0.17981776314349296, 0.17441763503559152, 0.2253603516420459, 0.06383735996753197, 0.3341778997633168, -0.3918224598883706, -0.18994582868660526, 0.14409891577601872, 0.12129357222960714, 0.01175846710034153, -0.010701245148940122, -0.2739447413615006, 0.0902895823271726, -0.13922485954197542, -0.143665150148616, -0.14244969652773923, 0.0035730943987693858, 0.11403787388082813, -0.3420376135858105, 0.053694981817577224, 0.06931235637132298, 0.11893998722627978, -0.10766151580302154, -0.14240631504970439, -0.0024207631769754432, 0.0760982326225049, 0.06726117828614353, 0.03101662955219474, 0.06614828594576787, -0.05109393501804922, -0.06376893955166452, 0.37257311705445106, -0.036474213141071445, -0.33431580115232945, 0.12945789586314382, -0.16889407890437938, -0.10941964904229869, 0.07836625536711996, 0.21761146812316248, 0.1422718015828115, -0.06911777302294093, 0.17229117648778758, -0.008977087570683044, 0.1264791465295917, 0.09824101698091801, 0.06310552890029024, 0.022879158369238106, 0.11634739581324324, 0.1405908105593613, 0.14861431966967167, 0.0051889494737706095, -0.13706966331279974, -0.30902576375314417, -0.1091843530371347, -0.16833220342489177, 0.012710720096947625, -0.17515587375237374, -0.2528442187809988, 0.4124549468705321, 0.05034879013649462, 0.13986824980255572, 0.11134026408442022, 0.29235024837886586, 0.11662046807845507, 0.0424908869625891, 0.052995375054867025, 0.20716278271420913, 0.18435250061071096, 0.07713393996955882, -0.1443457018262159, 0.10586305725497797, 0.2099304781843196]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.