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,802.0806 | Shadows of spherically symmetric black holes and naked singularities | We compare shadows cast by Schwarzschild black holes with those produced by
two classes of naked singularities that result from gravitational collapse of
spherically symmetric matter. The latter models consist of an interior naked
singularity spacetime restricted to radii $r\leq R_b$, matched to Schwarzschild
spacetime outside the boundary radius $R_b$. While a black hole always has a
photon sphere and always casts a shadow, we find that the naked singularity
models have photon spheres only if a certain parameter $M_0$ that characterizes
these models satisfies $M_0\geq 2/3$, or equivalently, if $R_b\leq 3M$, where
$M$ is the total mass of the object. Such models do produce shadows. However,
models with $M_0<2/3$ (or $R_b>3M$) have no photon sphere and do not produce a
shadow. Instead, they produce an interesting `full-moon' image. These results
imply that the presence of a shadow does not by itself prove that a compact
object is necessarily a black hole. The object could be a naked singularity
with $M_0\geq 2/3$, and we will need other observational clues to distinguish
the two possibilities. On the other hand, the presence of a full-moon image
would certainly rule out a black hole and might suggest a naked singularity
with $M_0<2/3$. It would be worthwhile to generalize the present study, which
is restricted to spherically symmetric models, to rotating black holes and
naked singularities.
| astro-ph.HE gr-qc hep-th | we compare shadows cast by schwarzschild black holes with those produced by two classes of naked singularities that result from gravitational collapse of spherically symmetric matter the latter models consist of an interior naked singularity spacetime restricted to radii rleq r_b matched to schwarzschild spacetime outside the boundary radius r_b while a black hole always has a photon sphere and always casts a shadow we find that the naked singularity models have photon spheres only if a certain parameter m_0 that characterizes these models satisfies m_0geq 23 or equivalently if r_bleq 3m where m is the total mass of the object such models do produce shadows however models with m_023 or r_b3m have no photon sphere and do not produce a shadow instead they produce an interesting fullmoon image these results imply that the presence of a shadow does not by itself prove that a compact object is necessarily a black hole the object could be a naked singularity with m_0geq 23 and we will need other observational clues to distinguish the two possibilities on the other hand the presence of a fullmoon image would certainly rule out a black hole and might suggest a naked singularity with m_023 it would be worthwhile to generalize the present study which is restricted to spherically symmetric models to rotating black holes and naked singularities | [['we', 'compare', 'shadows', 'cast', 'by', 'schwarzschild', 'black', 'holes', 'with', 'those', 'produced', 'by', 'two', 'classes', 'of', 'naked', 'singularities', 'that', 'result', 'from', 'gravitational', 'collapse', 'of', 'spherically', 'symmetric', 'matter', 'the', 'latter', 'models', 'consist', 'of', 'an', 'interior', 'naked', 'singularity', 'spacetime', 'restricted', 'to', 'radii', 'rleq', 'r_b', 'matched', 'to', 'schwarzschild', 'spacetime', 'outside', 'the', 'boundary', 'radius', 'r_b', 'while', 'a', 'black', 'hole', 'always', 'has', 'a', 'photon', 'sphere', 'and', 'always', 'casts', 'a', 'shadow', 'we', 'find', 'that', 'the', 'naked', 'singularity', 'models', 'have', 'photon', 'spheres', 'only', 'if', 'a', 'certain', 'parameter', 'm_0', 'that', 'characterizes', 'these', 'models', 'satisfies', 'm_0geq', '23', 'or', 'equivalently', 'if', 'r_bleq', '3m', 'where', 'm', 'is', 'the', 'total', 'mass', 'of', 'the', 'object', 'such', 'models', 'do', 'produce', 'shadows', 'however', 'models', 'with', 'm_023', 'or', 'r_b3m', 'have', 'no', 'photon', 'sphere', 'and', 'do', 'not', 'produce', 'a', 'shadow', 'instead', 'they', 'produce', 'an', 'interesting', 'fullmoon', 'image', 'these', 'results', 'imply', 'that', 'the', 'presence', 'of', 'a', 'shadow', 'does', 'not', 'by', 'itself', 'prove', 'that', 'a', 'compact', 'object', 'is', 'necessarily', 'a', 'black', 'hole', 'the', 'object', 'could', 'be', 'a', 'naked', 'singularity', 'with', 'm_0geq', '23', 'and', 'we', 'will', 'need', 'other', 'observational', 'clues', 'to', 'distinguish', 'the', 'two', 'possibilities', 'on', 'the', 'other', 'hand', 'the', 'presence', 'of', 'a', 'fullmoon', 'image', 'would', 'certainly', 'rule', 'out', 'a', 'black', 'hole', 'and', 'might', 'suggest', 'a', 'naked', 'singularity', 'with', 'm_023', 'it', 'would', 'be', 'worthwhile', 'to', 'generalize', 'the', 'present', 'study', 'which', 'is', 'restricted', 'to', 'spherically', 'symmetric', 'models', 'to', 'rotating', 'black', 'holes', 'and', 'naked', 'singularities']] | [-0.12656964052951447, 0.07142124269322031, -0.12970383035415714, 0.13855493882416609, -0.1181466625313516, -0.20291931133936117, -0.017119473037045856, 0.3423399570499357, -0.15719555432830626, -0.2845055036175634, 0.1338708543184179, -0.32422670922931973, -0.08857290268901528, 0.18086698258519862, -0.10595985121498988, -0.011535884959071322, 0.06861413504251417, 0.06426729742196147, -0.11765703264056894, -0.21581173301307932, 0.40748552436276375, 0.05160446682647388, 0.16247837734004456, 0.02697143395899157, 0.0636530226458692, -0.023367618120068476, 0.016103236131904716, 0.08455375088292554, -0.13484910738962855, 0.016271888377593347, 0.19657674690309554, 0.14695745504879462, 0.20504377272488825, -0.4075362992265986, -0.23840687696011392, 0.16439870388583383, 0.17738345145523823, 0.1041028349713155, -0.08621502714878362, -0.27293423896103547, 0.12659192477494124, -0.20287508956311354, -0.1738442220763924, -0.015977878063158306, 0.05047540646955895, -0.03876527109915279, -0.20825291135153107, 0.08249559801468556, 0.13260269567992375, -0.09401668784644075, -0.09123585455516284, -0.028441210527455917, -0.059508122639575355, 0.08165195575889407, 0.0809103798658018, 0.03845562954773885, 0.1855726744160401, -0.1283656935082507, -0.10687374758870444, 0.36600320040964074, -0.030968351694388763, -0.21540721694516293, 0.19268297245003782, -0.24986804123855783, -0.07378683646244032, 0.16178229352873233, 0.09902845397570033, 0.20858052752144565, -0.09460163525956752, 0.08762006791975754, -0.057495716708082775, 0.21426138766589617, 0.145538549046722, 0.024140562344217433, 0.4243088180390057, 0.04665731262476011, 0.036411708479540214, 0.10964652278333367, -0.09451449257364773, -0.047421255994036245, -0.3079009736215489, -0.127821184453313, -0.13081597511363388, 0.12372601005268667, -0.13405142287949814, -0.2172411994887861, 0.26680525903173946, 0.08943520777123652, 0.21620756711086464, 0.009074839006104783, 0.24025747189649269, 0.03473186081639681, 0.09583767356579537, 0.09636152413872036, 0.32740660399819416, 0.0488619783190424, 0.07998797284327103, -0.15722788025568998, -0.023099358659237623, 0.07147535533402805] |
1,802.08061 | Algorithmic Collusion in Cournot Duopoly Market: Evidence from
Experimental Economics | Algorithmic collusion is an emerging concept in current artificial
intelligence age. Whether algorithmic collusion is a creditable threat remains
as an argument. In this paper, we propose an algorithm which can extort its
human rival to collude in a Cournot duopoly competing market. In experiments,
we show that, the algorithm can successfully extorted its human rival and gets
higher profit in long run, meanwhile the human rival will fully collude with
the algorithm. As a result, the social welfare declines rapidly and stably.
Both in theory and in experiment, our work confirms that, algorithmic collusion
can be a creditable threat. In application, we hope, the frameworks, the
algorithm design as well as the experiment environment illustrated in this
work, can be an incubator or a test bed for researchers and policymakers to
handle the emerging algorithmic collusion.
| econ.EM cs.GT stat.AP stat.ML | algorithmic collusion is an emerging concept in current artificial intelligence age whether algorithmic collusion is a creditable threat remains as an argument in this paper we propose an algorithm which can extort its human rival to collude in a cournot duopoly competing market in experiments we show that the algorithm can successfully extorted its human rival and gets higher profit in long run meanwhile the human rival will fully collude with the algorithm as a result the social welfare declines rapidly and stably both in theory and in experiment our work confirms that algorithmic collusion can be a creditable threat in application we hope the frameworks the algorithm design as well as the experiment environment illustrated in this work can be an incubator or a test bed for researchers and policymakers to handle the emerging algorithmic collusion | [['algorithmic', 'collusion', 'is', 'an', 'emerging', 'concept', 'in', 'current', 'artificial', 'intelligence', 'age', 'whether', 'algorithmic', 'collusion', 'is', 'a', 'creditable', 'threat', 'remains', 'as', 'an', 'argument', 'in', 'this', 'paper', 'we', 'propose', 'an', 'algorithm', 'which', 'can', 'extort', 'its', 'human', 'rival', 'to', 'collude', 'in', 'a', 'cournot', 'duopoly', 'competing', 'market', 'in', 'experiments', 'we', 'show', 'that', 'the', 'algorithm', 'can', 'successfully', 'extorted', 'its', 'human', 'rival', 'and', 'gets', 'higher', 'profit', 'in', 'long', 'run', 'meanwhile', 'the', 'human', 'rival', 'will', 'fully', 'collude', 'with', 'the', 'algorithm', 'as', 'a', 'result', 'the', 'social', 'welfare', 'declines', 'rapidly', 'and', 'stably', 'both', 'in', 'theory', 'and', 'in', 'experiment', 'our', 'work', 'confirms', 'that', 'algorithmic', 'collusion', 'can', 'be', 'a', 'creditable', 'threat', 'in', 'application', 'we', 'hope', 'the', 'frameworks', 'the', 'algorithm', 'design', 'as', 'well', 'as', 'the', 'experiment', 'environment', 'illustrated', 'in', 'this', 'work', 'can', 'be', 'an', 'incubator', 'or', 'a', 'test', 'bed', 'for', 'researchers', 'and', 'policymakers', 'to', 'handle', 'the', 'emerging', 'algorithmic', 'collusion']] | [-0.08207466471460922, 0.07089740555495476, -0.12662787239669876, 0.09545335843251772, -0.10420816757387537, -0.19155267608584836, 0.08277888937771101, 0.4005998947575469, -0.28101339652066065, -0.34997207427616506, 0.1262104765226147, -0.27362764988313704, -0.2345830859592431, 0.1762969732089379, -0.19647508728838362, 0.0197533490264665, 0.050016675353296756, 0.03180339780759395, 0.058199345226646125, -0.32423613528611467, 0.23555165628204122, 0.10112982409961713, 0.27686079460374247, 0.10963317535146523, 0.04077758676516276, -0.0419155657342772, 0.03341204338700182, 0.051037421415779084, -0.07155332040533455, 0.10374265852356877, 0.3486971272128251, 0.24748638911200138, 0.3896251878947677, -0.4365009309018633, -0.1682184477994109, 0.12276363421080853, 0.16533022119170604, 0.13283304007884855, -0.06020866715184906, -0.29922070384354277, 0.08009849506922417, -0.26440102752873346, -0.11110183089519576, -0.08685769799750928, -0.03349400172181263, -0.02941239459280897, -0.2793531866661985, -0.005179522020625882, 0.057242362606784274, 0.06986505266361158, -0.05288226867389098, -0.06615271363133456, 0.05508219966705998, 0.1739792025370715, 0.08247457099873025, 0.042945516172467786, 0.1557142658994588, -0.15683358189690969, -0.226869689184241, 0.3676258527454646, -0.06316397971172324, -0.1505803140873254, 0.18544042802429483, -0.02701497919213794, -0.11139680484227617, 0.025662334478350684, 0.20153570129974363, 0.08188438455930308, -0.14371009403839707, 0.03173818619175376, -0.06224482455838691, 0.18849287911400417, 0.02143213914720999, -0.032489352508705716, 0.18842201304847978, 0.22859399150783086, 0.12229705368586377, 0.1208655439567177, -0.009063454300356918, -0.10914818537490004, -0.20892600924023152, -0.17581831752185656, -0.15201393411125003, 0.03324348550043343, -0.07343449262064977, -0.12945248049457886, 0.34975185791742713, 0.20442267752471655, 0.12875471671577543, 0.0749320846679278, 0.35870588919394375, 0.022252689602764268, 0.021262738860540968, 0.10106806680286194, 0.22901886627625892, -0.021714467990129965, 0.1330047658891143, -0.16683048637830378, 0.1539475119104335, -0.026496589897707215] |
1,802.08062 | Analytic Continuation of $\zeta(s)$ Violates the Law of
Non-Contradiction (LNC) | The Dirichlet series of $\zeta(s)$ was long ago proven to be divergent
throughout half-plane $\text{Re}(s)\le1$. If also Riemann's proposition is
true, that there exists an "expression" of $\zeta(s)$ that is convergent at all
$s$ (except at $s=1$), then $\zeta(s)$ is both divergent and convergent
throughout half-plane $\text{Re}(s)\le1$ (except at $s=1$). This result
violates all three of Aristotle's "Laws of Thought": the Law of Identity (LOI),
the Law of the Excluded Middle (LEM), and the Law of Non-Contradition (LNC). In
classical and intuitionistic logics, the violation of LNC also triggers the
"Principle of Explosion" / \textit{Ex Contradictione Quodlibet} (ECQ). In
addition, the Hankel contour used in Riemann's analytic continuation of
$\zeta(s)$ violates Cauchy's integral theorem, providing another proof of the
invalidity of Riemann's $\zeta(s)$. Riemann's $\zeta(s)$ is one of the
$L$-functions, which are all invalid due to analytic continuation. This result
renders unsound all theorems (e.g. Modularity, Fermat's last) and conjectures
(e.g. BSD, Tate, Hodge, Yang-Mills) that assume that an $L$-function (e.g.
Riemann's $\zeta(s)$) is valid. We also show that the Riemann Hypothesis (RH)
is not "non-trivially true" in classical logic, intuitionistic logic, or
three-valued logics (3VLs) that assign a third truth-value to paradoxes
(Bochvar's 3VL, Priest's $LP$).
| math.GM | the dirichlet series of zetas was long ago proven to be divergent throughout halfplane textresle1 if also riemanns proposition is true that there exists an expression of zetas that is convergent at all s except at s1 then zetas is both divergent and convergent throughout halfplane textresle1 except at s1 this result violates all three of aristotles laws of thought the law of identity loi the law of the excluded middle lem and the law of noncontradition lnc in classical and intuitionistic logics the violation of lnc also triggers the principle of explosion textitex contradictione quodlibet ecq in addition the hankel contour used in riemanns analytic continuation of zetas violates cauchys integral theorem providing another proof of the invalidity of riemanns zetas riemanns zetas is one of the lfunctions which are all invalid due to analytic continuation this result renders unsound all theorems eg modularity fermats last and conjectures eg bsd tate hodge yangmills that assume that an lfunction eg riemanns zetas is valid we also show that the riemann hypothesis rh is not nontrivially true in classical logic intuitionistic logic or threevalued logics 3vls that assign a third truthvalue to paradoxes bochvars 3vl priests lp | [['the', 'dirichlet', 'series', 'of', 'zetas', 'was', 'long', 'ago', 'proven', 'to', 'be', 'divergent', 'throughout', 'halfplane', 'textresle1', 'if', 'also', 'riemanns', 'proposition', 'is', 'true', 'that', 'there', 'exists', 'an', 'expression', 'of', 'zetas', 'that', 'is', 'convergent', 'at', 'all', 's', 'except', 'at', 's1', 'then', 'zetas', 'is', 'both', 'divergent', 'and', 'convergent', 'throughout', 'halfplane', 'textresle1', 'except', 'at', 's1', 'this', 'result', 'violates', 'all', 'three', 'of', 'aristotles', 'laws', 'of', 'thought', 'the', 'law', 'of', 'identity', 'loi', 'the', 'law', 'of', 'the', 'excluded', 'middle', 'lem', 'and', 'the', 'law', 'of', 'noncontradition', 'lnc', 'in', 'classical', 'and', 'intuitionistic', 'logics', 'the', 'violation', 'of', 'lnc', 'also', 'triggers', 'the', 'principle', 'of', 'explosion', 'textitex', 'contradictione', 'quodlibet', 'ecq', 'in', 'addition', 'the', 'hankel', 'contour', 'used', 'in', 'riemanns', 'analytic', 'continuation', 'of', 'zetas', 'violates', 'cauchys', 'integral', 'theorem', 'providing', 'another', 'proof', 'of', 'the', 'invalidity', 'of', 'riemanns', 'zetas', 'riemanns', 'zetas', 'is', 'one', 'of', 'the', 'lfunctions', 'which', 'are', 'all', 'invalid', 'due', 'to', 'analytic', 'continuation', 'this', 'result', 'renders', 'unsound', 'all', 'theorems', 'eg', 'modularity', 'fermats', 'last', 'and', 'conjectures', 'eg', 'bsd', 'tate', 'hodge', 'yangmills', 'that', 'assume', 'that', 'an', 'lfunction', 'eg', 'riemanns', 'zetas', 'is', 'valid', 'we', 'also', 'show', 'that', 'the', 'riemann', 'hypothesis', 'rh', 'is', 'not', 'nontrivially', 'true', 'in', 'classical', 'logic', 'intuitionistic', 'logic', 'or', 'threevalued', 'logics', '3vls', 'that', 'assign', 'a', 'third', 'truthvalue', 'to', 'paradoxes', 'bochvars', '3vl', 'priests', 'lp']] | [-0.1748119002040574, 0.04636651512482401, -0.19099681901563176, 0.16787918163069263, -0.1318702363312397, -0.18018229176886577, 0.03901146308866344, 0.25795926814640147, -0.25948948273681616, -0.1763501016129912, 0.11497284095024779, -0.27321638736538784, -0.09134489631221171, 0.20895275364324412, -0.11814462091951143, 0.033473443050213436, -0.014099983526787981, 0.05798294142790375, -0.05691237536766542, -0.3191740270925775, 0.3103884957760336, -0.05005243030332383, 0.22020099263776233, 0.13689117278982565, 0.07955849721101384, 0.011427945766607842, 0.01479139890787857, -0.07468717698520295, -0.09040069324695862, 0.08559673797541234, 0.31691619726735604, 0.1368920678450238, 0.28298791329913514, -0.38819477273515923, -0.10582819649649085, 0.1149829224407397, 0.11426219702639774, -0.04597215488289419, 0.07114063772722763, -0.24378804373431695, 0.08011355675404605, -0.15468484156385617, -0.19412714832280048, -0.06737481817731229, 0.07308443884547583, -0.008635440795736575, -0.22704468641390718, 0.1240029655763123, 0.1555669845535208, 0.0768461184546588, -0.07218051244684609, -0.15358145274074067, -0.012068879795531747, 0.02885225229334855, 0.1679194217003271, 0.06511928965756424, 0.07625682040970161, -0.0868866694425898, -0.10425414263379203, 0.3092576765736181, -0.018172348326164645, -0.17034029358721994, 0.09855350183209691, -0.19112975703473523, -0.2153217640487359, 0.11944291218080455, -0.030114183879935395, 0.14563936974834646, -0.08160965291477701, 0.16247257156046255, -0.11695531461814113, 0.15728446991039963, 0.20574724540562817, -0.045207199107155836, 0.2072965935187996, 0.021320436231141524, 0.02669464012302419, 0.10079397970783431, 0.000908155068163834, -0.09146929548550693, -0.41002276661022313, -0.23366630424021018, -0.19448273372282052, 0.09199814331385482, -0.10252948278017963, -0.21829013441438003, 0.28301616491892784, 0.1227364321824449, 0.09378755519846602, 0.17334222972883334, 0.22415562175773576, 0.16453659961680098, 0.07305795980602621, 0.04285425784450675, 0.16928213283606858, 0.19158846237967728, 0.10751525761076698, -0.12221030450411259, 0.07275200061310359, 0.17822463099632865] |
1,802.08063 | Time-dependent nonlinear Jaynes-Cummings dynamics of a trapped ion | In quantum interaction problems with explicitly time-dependent interaction
Hamiltonians, the time ordering plays a crucial role for describing the quantum
evolution of the system under consideration. In such complex scenarios, exact
solutions of the dynamics are rarely available. Here we study the nonlinear
vibronic dynamics of a trapped ion, driven in the resolved sideband regime with
some small frequency mismatch. By describing the pump field in a quantized
manner, we are able to derive exact solutions for the dynamics of the system.
This eventually allows us to provide analytical solutions for various types of
time-dependent quantities. In particular, we study in some detail the
electronic and the motional quantum dynamics of the ion, as well as the time
evolution of the nonclassicality of the motional quantum state.
| quant-ph | in quantum interaction problems with explicitly timedependent interaction hamiltonians the time ordering plays a crucial role for describing the quantum evolution of the system under consideration in such complex scenarios exact solutions of the dynamics are rarely available here we study the nonlinear vibronic dynamics of a trapped ion driven in the resolved sideband regime with some small frequency mismatch by describing the pump field in a quantized manner we are able to derive exact solutions for the dynamics of the system this eventually allows us to provide analytical solutions for various types of timedependent quantities in particular we study in some detail the electronic and the motional quantum dynamics of the ion as well as the time evolution of the nonclassicality of the motional quantum state | [['in', 'quantum', 'interaction', 'problems', 'with', 'explicitly', 'timedependent', 'interaction', 'hamiltonians', 'the', 'time', 'ordering', 'plays', 'a', 'crucial', 'role', 'for', 'describing', 'the', 'quantum', 'evolution', 'of', 'the', 'system', 'under', 'consideration', 'in', 'such', 'complex', 'scenarios', 'exact', 'solutions', 'of', 'the', 'dynamics', 'are', 'rarely', 'available', 'here', 'we', 'study', 'the', 'nonlinear', 'vibronic', 'dynamics', 'of', 'a', 'trapped', 'ion', 'driven', 'in', 'the', 'resolved', 'sideband', 'regime', 'with', 'some', 'small', 'frequency', 'mismatch', 'by', 'describing', 'the', 'pump', 'field', 'in', 'a', 'quantized', 'manner', 'we', 'are', 'able', 'to', 'derive', 'exact', 'solutions', 'for', 'the', 'dynamics', 'of', 'the', 'system', 'this', 'eventually', 'allows', 'us', 'to', 'provide', 'analytical', 'solutions', 'for', 'various', 'types', 'of', 'timedependent', 'quantities', 'in', 'particular', 'we', 'study', 'in', 'some', 'detail', 'the', 'electronic', 'and', 'the', 'motional', 'quantum', 'dynamics', 'of', 'the', 'ion', 'as', 'well', 'as', 'the', 'time', 'evolution', 'of', 'the', 'nonclassicality', 'of', 'the', 'motional', 'quantum', 'state']] | [-0.16315817265353333, 0.1651316400852025, -0.05457257580261413, 0.0673591652307586, 0.011379938367314227, -0.1272029865635779, 0.009299848863019013, 0.34627734274258765, -0.26401680091755303, -0.2788176412270661, 0.06997856990375563, -0.23469650895711985, -0.14160817816274196, 0.1924925564580201, 0.026792999224069962, 0.0974113298066723, 0.04986631791345687, 0.015265997545289492, -0.026820932969626947, -0.1738803454999735, 0.3275744788876669, 0.0645848881401943, 0.24878416154313626, 0.040845432334788524, 0.10840618644115024, 0.0067824327458414855, 0.05623403983442736, 0.004568423896177312, -0.15747182693801762, 0.07955885027245596, 0.26457618075829936, 0.0655940584031733, 0.28249912119404536, -0.48861421688687146, -0.21800186479552172, 0.06221806719957843, 0.16360605214942453, 0.2298514776107833, -0.06481553513399053, -0.28102642000014855, -0.02179170702034094, -0.13984060676137763, -0.15590217018382638, -0.12311994716869741, 0.013726953854307708, 0.052607280150877206, -0.23589074846740268, 0.09954946358710176, 0.04395028104268631, 0.049457960847790874, -0.12004269100771484, -0.02291265170375897, 0.02397123743380295, 0.1616119917108142, 0.0015045190156679454, -0.041051687335404825, 0.1206523829894177, -0.15414892256353416, -0.09817864547903452, 0.40529661284810975, -0.07573402784104774, -0.22227680590737053, 0.17702620130354965, -0.15264479511630114, -0.10482317028112534, 0.09804073352674682, 0.1579733407894868, 0.1179580935753706, -0.16150175703333794, 0.09134151664421358, 0.007720864616246439, 0.14085665472727463, 0.02869478866868601, 0.12174326249977618, 0.20274529988899476, 0.1488440723734079, 0.02660040779581924, 0.17863684821911485, -0.061932079010005074, -0.19841777455193674, -0.32256766135885023, -0.15098832851811128, -0.14748973980560665, 0.07475343510860533, -0.06495616706003395, -0.15035220976244276, 0.4648533318939758, 0.16864796914160252, 0.16281248462628425, -0.031971200563629544, 0.26011204464346405, 0.17569094413605438, -0.013358769956682845, 0.02725046891425773, 0.25010890697952226, 0.15723590645847446, 0.11539201343094739, -0.3423905281540681, 0.04481982073827288, 0.0301304912308275] |
1,802.08064 | Computing the concurrency threshold of sound free-choice workflow nets | Workflow graphs extend classical flow charts with concurrent fork and join
nodes. They constitute the core of business processing languages such as BPMN
or UML Activity Diagrams. The activities of a workflow graph are executed by
humans or machines, generically called resources. If concurrent activities
cannot be executed in parallel by lack of resources, the time needed to execute
the workflow increases. We study the problem of computing the minimal number of
resources necessary to fully exploit the concurrency of a given workflow, and
execute it as fast as possible (i.e., as fast as with unlimited resources).
We model this problem using free-choice Petri nets, which are known to be
equivalent to workflow graphs. We analyze the computational complexity of two
versions of the problem: computing the resource and concurrency thresholds. We
use the results to design an algorithm to approximate the concurrency
threshold, and evaluate it on a benchmark suite of 642 industrial examples. We
show that it performs very well in practice: It always provides the exact
value, and never takes more than 30 milliseconds for any workflow, even for
those with a huge number of reachable markings.
| cs.LO | workflow graphs extend classical flow charts with concurrent fork and join nodes they constitute the core of business processing languages such as bpmn or uml activity diagrams the activities of a workflow graph are executed by humans or machines generically called resources if concurrent activities cannot be executed in parallel by lack of resources the time needed to execute the workflow increases we study the problem of computing the minimal number of resources necessary to fully exploit the concurrency of a given workflow and execute it as fast as possible ie as fast as with unlimited resources we model this problem using freechoice petri nets which are known to be equivalent to workflow graphs we analyze the computational complexity of two versions of the problem computing the resource and concurrency thresholds we use the results to design an algorithm to approximate the concurrency threshold and evaluate it on a benchmark suite of 642 industrial examples we show that it performs very well in practice it always provides the exact value and never takes more than 30 milliseconds for any workflow even for those with a huge number of reachable markings | [['workflow', 'graphs', 'extend', 'classical', 'flow', 'charts', 'with', 'concurrent', 'fork', 'and', 'join', 'nodes', 'they', 'constitute', 'the', 'core', 'of', 'business', 'processing', 'languages', 'such', 'as', 'bpmn', 'or', 'uml', 'activity', 'diagrams', 'the', 'activities', 'of', 'a', 'workflow', 'graph', 'are', 'executed', 'by', 'humans', 'or', 'machines', 'generically', 'called', 'resources', 'if', 'concurrent', 'activities', 'can', 'not', 'be', 'executed', 'in', 'parallel', 'by', 'lack', 'of', 'resources', 'the', 'time', 'needed', 'to', 'execute', 'the', 'workflow', 'increases', 'we', 'study', 'the', 'problem', 'of', 'computing', 'the', 'minimal', 'number', 'of', 'resources', 'necessary', 'to', 'fully', 'exploit', 'the', 'concurrency', 'of', 'a', 'given', 'workflow', 'and', 'execute', 'it', 'as', 'fast', 'as', 'possible', 'ie', 'as', 'fast', 'as', 'with', 'unlimited', 'resources', 'we', 'model', 'this', 'problem', 'using', 'freechoice', 'petri', 'nets', 'which', 'are', 'known', 'to', 'be', 'equivalent', 'to', 'workflow', 'graphs', 'we', 'analyze', 'the', 'computational', 'complexity', 'of', 'two', 'versions', 'of', 'the', 'problem', 'computing', 'the', 'resource', 'and', 'concurrency', 'thresholds', 'we', 'use', 'the', 'results', 'to', 'design', 'an', 'algorithm', 'to', 'approximate', 'the', 'concurrency', 'threshold', 'and', 'evaluate', 'it', 'on', 'a', 'benchmark', 'suite', 'of', '642', 'industrial', 'examples', 'we', 'show', 'that', 'it', 'performs', 'very', 'well', 'in', 'practice', 'it', 'always', 'provides', 'the', 'exact', 'value', 'and', 'never', 'takes', 'more', 'than', '30', 'milliseconds', 'for', 'any', 'workflow', 'even', 'for', 'those', 'with', 'a', 'huge', 'number', 'of', 'reachable', 'markings']] | [-0.13123688980612747, 0.06868019393416358, -0.03300675264491422, 0.08830703274744285, -0.12931029718730072, -0.15478477911067962, 0.09025498229829858, 0.40910654683982595, -0.2891899746945079, -0.38495313917671903, 0.12433263693548524, -0.2224014174066367, -0.11620766087069484, 0.21895454846766255, -0.11911394272221457, 0.08499149317945798, 0.11336469146939901, 0.06315013492011821, 0.006806708904317243, -0.27429807830327047, 0.23796876539910183, 0.03391444132692566, 0.2520009256626299, 0.022001382396239496, 0.04685946561259593, -0.006418309130593745, -0.011028641277768148, 0.03760591654487305, -0.0742804647399861, 0.1077146155166035, 0.34161089758232666, 0.2680812833260218, 0.29676071553630023, -0.4747867670826887, -0.12730279733568273, 0.1382760976518002, 0.1254787890881139, 0.08336026772444688, 0.038517368175634864, -0.25034011365523984, 0.10973762709852211, -0.20802167386270046, -0.06014991669393881, -0.11864089968014528, 0.010341804759840223, 0.014071344179759552, -0.23472793436126482, -0.03963024464694305, 0.07002494664904198, 0.07621282884968122, 0.0030232098889756576, -0.04952900941081099, -0.02923417760971056, 0.1594710819574356, -0.0176653578592201, 0.01789782938050077, 0.15157949610208576, -0.1272162623061291, -0.1977792587277543, 0.4105391175149701, 0.012734240453299598, -0.16649199413203913, 0.21670265904145014, -0.03446156554611605, -0.16440401435052582, 0.09978538213105122, 0.17899243996834568, 0.10998304205561417, -0.15803314465846555, 0.05059813552856669, 0.0030208214317784883, 0.18214331484272958, 0.06778482609204167, 0.008225228914171847, 0.1699521441587993, 0.22190866813414695, 0.09370863412906713, 0.18150530395424724, -0.004807521383087906, -0.10879554844574749, -0.26066672308943406, -0.17568546744655936, -0.1623234879859377, -0.02342668977858321, -0.06762867504131982, -0.20343486811838926, 0.35746684437800513, 0.18265212800552463, 0.1466573632585253, 0.14376615411150928, 0.36049345975341907, 0.06908018566169459, 0.13478941359698615, 0.17391089035480903, 0.11661518697446475, 0.025449560621158458, 0.1508806567292914, -0.1680282658716927, 0.09875167412829648, 0.03117525608995588] |
1,802.08065 | On monotonicity of FIFO-diverging junctions | This technical note concerns the dynamics of FIFO-diverging junctions in
compartmental models for traffic networks. Many strong results on the dynamical
behavior of such traffic networks rely on monotonicity of the underlying
dynamics. In road traffic modeling, a common model for diverging junctions is
based on the First-in, first-out principle. These type of junctions pose a
problem in the analysis of traffic dynamics, since their dynamics are not
monotone with respect to the positive orthant. However, this technical note
demonstrates that they are in fact monotone with respect to the partial order
induced by a particular, polyhedral cone.
| math.DS | this technical note concerns the dynamics of fifodiverging junctions in compartmental models for traffic networks many strong results on the dynamical behavior of such traffic networks rely on monotonicity of the underlying dynamics in road traffic modeling a common model for diverging junctions is based on the firstin firstout principle these type of junctions pose a problem in the analysis of traffic dynamics since their dynamics are not monotone with respect to the positive orthant however this technical note demonstrates that they are in fact monotone with respect to the partial order induced by a particular polyhedral cone | [['this', 'technical', 'note', 'concerns', 'the', 'dynamics', 'of', 'fifodiverging', 'junctions', 'in', 'compartmental', 'models', 'for', 'traffic', 'networks', 'many', 'strong', 'results', 'on', 'the', 'dynamical', 'behavior', 'of', 'such', 'traffic', 'networks', 'rely', 'on', 'monotonicity', 'of', 'the', 'underlying', 'dynamics', 'in', 'road', 'traffic', 'modeling', 'a', 'common', 'model', 'for', 'diverging', 'junctions', 'is', 'based', 'on', 'the', 'firstin', 'firstout', 'principle', 'these', 'type', 'of', 'junctions', 'pose', 'a', 'problem', 'in', 'the', 'analysis', 'of', 'traffic', 'dynamics', 'since', 'their', 'dynamics', 'are', 'not', 'monotone', 'with', 'respect', 'to', 'the', 'positive', 'orthant', 'however', 'this', 'technical', 'note', 'demonstrates', 'that', 'they', 'are', 'in', 'fact', 'monotone', 'with', 'respect', 'to', 'the', 'partial', 'order', 'induced', 'by', 'a', 'particular', 'polyhedral', 'cone']] | [-0.19135952412544452, 0.04579186795240978, -0.06444367740936961, 0.056778168011715965, -0.054430989404545, -0.1309953202822332, 0.037400473494889196, 0.382217914845372, -0.28442641524309964, -0.2514033372509149, 0.11609969603992307, -0.29384577895524266, -0.21225634177056976, 0.19517612305335394, -0.1397198867868901, 0.10405851908258557, 0.07273359876606114, 0.020668555985411303, -0.025276203842632013, -0.22285945908665733, 0.36841876564797055, -0.037320734568170665, 0.3044462794841258, 0.10706440243178729, 0.07882486534372125, -0.02753372323824112, -0.013851084319164151, 0.038594867768889464, -0.10069036592296432, 0.13597243438719667, 0.2544140212024282, 0.10200715497539369, 0.2731649548885864, -0.501762517967943, -0.2589221323774912, 0.12669187585448788, 0.09560988324012645, 0.08140953367134345, -0.014110071525774589, -0.2764355368652986, 0.0887382451982535, -0.10907439074776683, -0.12316421096299573, -0.039965401009954125, -0.016871731756819105, 0.08456704819445335, -0.23596115841904713, 0.03950069949856585, 0.1074041824847263, 0.0759194446655624, 0.019498307625139037, -0.0626935540055184, -0.03355024098274634, 0.10388905404270002, 0.08019459192501861, -0.014875967534422184, 0.09703573139057946, -0.14122165846590376, -0.12456286226197616, 0.3733279911762814, -0.028110444084885194, -0.23623201694608348, 0.19402886395937927, -0.09156497882333459, -0.18860724247684799, 0.1155661515838745, 0.20157371845441996, 0.12623519605006447, -0.17010894045233727, 0.05682699184519114, -0.06232340880621647, 0.12985714121731287, 0.034984140503268264, 0.03109248892221715, 0.17167238170069823, 0.2189845500739541, 0.13311676961818672, 0.06912608650877841, -0.01994118382722216, -0.15722360610529856, -0.2741880957421261, -0.0971196378802055, -0.1388866506497731, 0.08163645970482096, -0.08656275039928793, -0.19764804390748753, 0.39007943267117917, 0.16429022052469328, 0.16961620809971212, 0.12005776203400695, 0.29912271004976687, 0.08765922037442934, 0.01530445837319742, 0.04109499363958375, 0.16212244032757336, 0.11090429340604424, 0.1481795394361096, -0.23716843517535588, 0.1649658330764199, 0.04165710594754705] |
1,802.08066 | Reputation Systems for News on Twitter: A Large-Scale Study | Social networks offer a ready channel for fake and misleading news to spread
and exert influence. This paper examines the performance of different
reputation algorithms when applied to a large and statistically significant
portion of the news that are spread via Twitter. Our main result is that simple
algorithms based on the identity of the users spreading the news, as well as
the words appearing in the titles and descriptions of the linked articles, are
able to identify a large portion of fake or misleading news, while incurring
only very low (<1%) false positive rates for mainstream websites. We believe
that these algorithms can be used as the basis of practical, large-scale
systems for indicating to consumers which news sites deserve careful scrutiny
and skepticism.
| cs.SI | social networks offer a ready channel for fake and misleading news to spread and exert influence this paper examines the performance of different reputation algorithms when applied to a large and statistically significant portion of the news that are spread via twitter our main result is that simple algorithms based on the identity of the users spreading the news as well as the words appearing in the titles and descriptions of the linked articles are able to identify a large portion of fake or misleading news while incurring only very low 1 false positive rates for mainstream websites we believe that these algorithms can be used as the basis of practical largescale systems for indicating to consumers which news sites deserve careful scrutiny and skepticism | [['social', 'networks', 'offer', 'a', 'ready', 'channel', 'for', 'fake', 'and', 'misleading', 'news', 'to', 'spread', 'and', 'exert', 'influence', 'this', 'paper', 'examines', 'the', 'performance', 'of', 'different', 'reputation', 'algorithms', 'when', 'applied', 'to', 'a', 'large', 'and', 'statistically', 'significant', 'portion', 'of', 'the', 'news', 'that', 'are', 'spread', 'via', 'twitter', 'our', 'main', 'result', 'is', 'that', 'simple', 'algorithms', 'based', 'on', 'the', 'identity', 'of', 'the', 'users', 'spreading', 'the', 'news', 'as', 'well', 'as', 'the', 'words', 'appearing', 'in', 'the', 'titles', 'and', 'descriptions', 'of', 'the', 'linked', 'articles', 'are', 'able', 'to', 'identify', 'a', 'large', 'portion', 'of', 'fake', 'or', 'misleading', 'news', 'while', 'incurring', 'only', 'very', 'low', '1', 'false', 'positive', 'rates', 'for', 'mainstream', 'websites', 'we', 'believe', 'that', 'these', 'algorithms', 'can', 'be', 'used', 'as', 'the', 'basis', 'of', 'practical', 'largescale', 'systems', 'for', 'indicating', 'to', 'consumers', 'which', 'news', 'sites', 'deserve', 'careful', 'scrutiny', 'and', 'skepticism']] | [-0.09936514984071254, 0.03906539447046816, -0.04137084621936083, 0.1334611196964979, -0.14764216901734473, -0.1519735350459814, 0.12395599482301622, 0.4097282083183527, -0.2198449789583683, -0.30108568617329, 0.10085212435480208, -0.34220034480234607, -0.1681052091959864, 0.22063294278318063, -0.089491769105196, -0.017663650266826154, 0.09832315707486122, 0.04991175924241543, 0.0019309920724481344, -0.3546550041139126, 0.32590497652068734, 0.08790580203570425, 0.33188983679190276, 0.11363368451967835, 0.06603238655626774, -0.033487400278449056, -0.1061976491510868, 0.025638735637068748, -0.0652794053023099, 0.13929673409543467, 0.3589481537118554, 0.19577583280578256, 0.35714547998551277, -0.39367248098552227, -0.17122161220759152, 0.12247375866398215, 0.1547792215794325, 0.12949027149286121, -0.06475910146627575, -0.33716006483323874, 0.11239703390002251, -0.21655668859928848, -0.03771887642890215, -0.09969221365684644, 0.0276909983381629, 0.06208166938973591, -0.24107436853460967, 0.07306774270534515, 0.03609723331872374, 0.06533435080200434, 0.032578401174396275, -0.12220803589001297, -0.016059042517095803, 0.22172705694031902, 0.15202053019031883, -0.008094950477126986, 0.1605173481181264, -0.15543789765797555, -0.1283633647947572, 0.4190116781666875, -0.037028437342494724, -0.17941733992099762, 0.1945691071213223, -0.05214403386041522, -0.11881865391507745, 0.12249612895771861, 0.26804020887613295, 0.08229965911060572, -0.14674992404843215, -0.06506594818341546, -0.043396484039723876, 0.19225038582785056, 0.06655003182590008, 0.02468680841848254, 0.21601032103784382, 0.1258684838656336, 0.0634235634803772, 0.07491948347445578, -0.027718741884455084, -0.06963818266615271, -0.23489392210543156, -0.13692361088469623, -0.14476101760193705, 0.0659848824646324, -0.0954119508707663, -0.17593128978461028, 0.3851722934581339, 0.18843456624634564, 0.17563974153250456, 0.027971363089047373, 0.26222959814220664, -0.002254375485703349, 0.08099684711336158, 0.08454069632664322, 0.17591228766553105, -0.01751653047837317, 0.17697187207266687, -0.08977330900728703, 0.15345443443208934, -0.03546707916096784] |
1,802.08067 | Symmetry preserving degenerations of the generic symmetric matrix | One considers certain degenerations of the generic symmetric matrix over a
field $k$ of characteristic zero and the main structures related to the
determinant $f$ of the matrix, such as the ideal generated by its partial
derivatives, the polar map defined by these derivatives and its image $V(f)$,
the Hessian matrix, the ideal and the map given by the cofactors, and the dual
variety of $V(f)$.
| math.AC math.AG | one considers certain degenerations of the generic symmetric matrix over a field k of characteristic zero and the main structures related to the determinant f of the matrix such as the ideal generated by its partial derivatives the polar map defined by these derivatives and its image vf the hessian matrix the ideal and the map given by the cofactors and the dual variety of vf | [['one', 'considers', 'certain', 'degenerations', 'of', 'the', 'generic', 'symmetric', 'matrix', 'over', 'a', 'field', 'k', 'of', 'characteristic', 'zero', 'and', 'the', 'main', 'structures', 'related', 'to', 'the', 'determinant', 'f', 'of', 'the', 'matrix', 'such', 'as', 'the', 'ideal', 'generated', 'by', 'its', 'partial', 'derivatives', 'the', 'polar', 'map', 'defined', 'by', 'these', 'derivatives', 'and', 'its', 'image', 'vf', 'the', 'hessian', 'matrix', 'the', 'ideal', 'and', 'the', 'map', 'given', 'by', 'the', 'cofactors', 'and', 'the', 'dual', 'variety', 'of', 'vf']] | [-0.15820890508422797, 0.06103352626616305, -0.0003943990273965579, 0.020688107653492778, -0.03617778561557784, -0.08682541658565628, -0.029015699316832153, 0.30192616888124385, -0.37867019472248625, -0.19016104174608534, 0.16058278289821112, -0.24154395375852333, -0.20111836037231665, 0.12897663930374564, -0.013687816293289265, 0.06570091928094343, -0.005968403381605943, 0.13037082355356577, -0.1505999161833615, -0.25991642340015847, 0.40841415563993383, 0.004455515169397448, 0.22165845557482858, 0.025429768008038853, 0.1699273942010195, 0.031043486112277165, -0.03328855725880148, -0.008988666545712587, -0.1006351302264992, 0.1416517028013583, 0.24329567034587715, 0.14265133041154707, 0.20273143915233738, -0.3779750675188773, -0.1623972301851168, 0.1387837028173222, 0.04641387466284813, 0.0034600778652185745, -0.011528188687269434, -0.26704996721254604, 0.14126832208906612, -0.16538201396663985, -0.15019671007228846, -0.04685765144655086, 0.021531853410344796, 0.05361150462836535, -0.27642721205836895, 0.019530701408670706, 0.08605658578083174, 0.08342992902775719, -0.031183488839870377, -0.178724463274138, -0.06636974449043698, 0.10447158287702636, 0.031083952804858036, 0.061274608773546235, 0.11076396928084167, -0.16574562309225174, -0.03085834436316156, 0.38768875992602925, -0.11202737355999874, -0.2277292377795234, 0.15275958562834244, -0.15363366703615722, 0.0010817836066990187, 0.1476852287481906, 0.08490240418662627, 0.13249697527763518, -0.07018919715262724, 0.13757482272304708, -0.07017721567359386, 0.06484992379343814, 0.06526580740782348, -0.03483523137754563, 0.18064405713724255, 0.011141205742729433, 0.07333447640959287, 0.1344610187366153, -0.04927771510274121, -0.057958509123912365, -0.3225818494278373, -0.21654739779787083, -0.22257876113960237, 0.07338098721635161, -0.1460182980795666, -0.20403695992673887, 0.4767490675052007, 0.0589508315209638, 0.24086016451827053, 0.0162092401279193, 0.24555581082787478, 0.12499275847133531, 0.07459388630972667, 0.021112432703375816, 0.11906754441389983, 0.22166492314092023, 0.01411544688038923, -0.23491541021432955, 0.06465671238291895, 0.13866711089697978] |
1,802.08068 | Learning Hyperedge Replacement Grammars for Graph Generation | The discovery and analysis of network patterns are central to the scientific
enterprise. In the present work, we developed and evaluated a new approach that
learns the building blocks of graphs that can be used to understand and
generate new realistic graphs. Our key insight is that a graph's clique tree
encodes robust and precise information. We show that a Hyperedge Replacement
Grammar (HRG) can be extracted from the clique tree, and we develop a
fixed-size graph generation algorithm that can be used to produce new graphs of
a specified size. In experiments on large real-world graphs, we show that
graphs generated from the HRG approach exhibit a diverse range of properties
that are similar to those found in the original networks. In addition to graph
properties like degree or eigenvector centrality, what a graph "looks like"
ultimately depends on small details in local graph substructures that are
difficult to define at a global level. We show that the HRG model can also
preserve these local substructures when generating new graphs.
| cs.SI cs.FL | the discovery and analysis of network patterns are central to the scientific enterprise in the present work we developed and evaluated a new approach that learns the building blocks of graphs that can be used to understand and generate new realistic graphs our key insight is that a graphs clique tree encodes robust and precise information we show that a hyperedge replacement grammar hrg can be extracted from the clique tree and we develop a fixedsize graph generation algorithm that can be used to produce new graphs of a specified size in experiments on large realworld graphs we show that graphs generated from the hrg approach exhibit a diverse range of properties that are similar to those found in the original networks in addition to graph properties like degree or eigenvector centrality what a graph looks like ultimately depends on small details in local graph substructures that are difficult to define at a global level we show that the hrg model can also preserve these local substructures when generating new graphs | [['the', 'discovery', 'and', 'analysis', 'of', 'network', 'patterns', 'are', 'central', 'to', 'the', 'scientific', 'enterprise', 'in', 'the', 'present', 'work', 'we', 'developed', 'and', 'evaluated', 'a', 'new', 'approach', 'that', 'learns', 'the', 'building', 'blocks', 'of', 'graphs', 'that', 'can', 'be', 'used', 'to', 'understand', 'and', 'generate', 'new', 'realistic', 'graphs', 'our', 'key', 'insight', 'is', 'that', 'a', 'graphs', 'clique', 'tree', 'encodes', 'robust', 'and', 'precise', 'information', 'we', 'show', 'that', 'a', 'hyperedge', 'replacement', 'grammar', 'hrg', 'can', 'be', 'extracted', 'from', 'the', 'clique', 'tree', 'and', 'we', 'develop', 'a', 'fixedsize', 'graph', 'generation', 'algorithm', 'that', 'can', 'be', 'used', 'to', 'produce', 'new', 'graphs', 'of', 'a', 'specified', 'size', 'in', 'experiments', 'on', 'large', 'realworld', 'graphs', 'we', 'show', 'that', 'graphs', 'generated', 'from', 'the', 'hrg', 'approach', 'exhibit', 'a', 'diverse', 'range', 'of', 'properties', 'that', 'are', 'similar', 'to', 'those', 'found', 'in', 'the', 'original', 'networks', 'in', 'addition', 'to', 'graph', 'properties', 'like', 'degree', 'or', 'eigenvector', 'centrality', 'what', 'a', 'graph', 'looks', 'like', 'ultimately', 'depends', 'on', 'small', 'details', 'in', 'local', 'graph', 'substructures', 'that', 'are', 'difficult', 'to', 'define', 'at', 'a', 'global', 'level', 'we', 'show', 'that', 'the', 'hrg', 'model', 'can', 'also', 'preserve', 'these', 'local', 'substructures', 'when', 'generating', 'new', 'graphs']] | [-0.07482542017507449, 0.08463605420598597, -0.11036462546190062, 0.10638894526116353, -0.13776964701886413, -0.10622261286824151, 0.01470467387371811, 0.4151423226126976, -0.2884739135931197, -0.3367669311861306, 0.06889338926643634, -0.2697207762189863, -0.19616274929289537, 0.15800892462550897, -0.08682370358500739, 0.032318662030333706, 0.13670782762499967, 0.07639300469200165, -0.0027490745595389466, -0.22372777415616493, 0.31133179150777734, 0.027583570056186432, 0.25482388164259884, 0.07458706251590659, 0.07020365344414935, -0.029884554937274918, -0.014776475132546492, 0.10573792021533703, -0.13235653903491404, 0.1483526615104611, 0.2705181273453044, 0.193561321807949, 0.21931016582679766, -0.4205297946232801, -0.19856498893268668, 0.1527280233288456, 0.12601864128918197, 0.13140874889635681, -0.02415139040615606, -0.2682471827819007, 0.1765098183739887, -0.1485383139552354, -0.07103369169873976, -0.12922181652406808, -0.0101568973949996, 0.03127494713030846, -0.28802487856506953, 0.0010028074885928208, 0.07546414276013118, 0.005850894406590371, 0.0499746026879732, -0.1312851370285042, -0.0364432217027687, 0.15935478786810583, -0.06838697024787183, 0.02514551680998697, 0.1497315776160624, -0.13348072842246858, -0.1653349814263897, 0.39766369111378463, -0.043843252305213735, -0.15097541252533395, 0.17805817261970008, -0.1165708205009108, -0.22342718730010747, 0.076563839441198, 0.22818981892598128, 0.10724378229603607, -0.16635525484383173, 0.03494996751886003, -0.09730398109215393, 0.18995438043670784, 0.06255277884138301, 0.022728471523858824, 0.17234956902282977, 0.18192795001219533, 0.08804031739240153, 0.17145617134060318, -0.02430975117226409, -0.07334833050811151, -0.23799392414872933, -0.0908796549638548, -0.20844521157971818, -0.005143752811089899, -0.15170110998175185, -0.18633834200493218, 0.45122555557948846, 0.21629359437239884, 0.2405802192171894, 0.08339947701856625, 0.24819164200718596, 0.049100887378247464, 0.12188816222066756, 0.12938609458669498, 0.14752930467567074, 0.08152291077401555, 0.05502537682881219, -0.12837436603659994, 0.09534595222675313, 0.06228264951833377] |
1,802.08069 | Quasi-two-dimensional thermoelectricity in SnSe | Stannous selenide is a layered semiconductor that is a polar analogue of
black phosphorus, and of great interest as a thermoelectric material.
Unusually, hole doped SnSe supports a large Seebeck coefficient at high
conductivity, which has not been explained to date. Angle resolved
photo-emission spectroscopy, optical reflection spectroscopy and
magnetotransport measurements reveal a multiple-valley valence band structure
and a quasi two-dimensional dispersion, realizing a Hicks-Dresselhaus
thermoelectric contributing to the high Seebeck coefficient at high carrier
density. We further demonstrate that the hole accumulation layer in exfoliated
SnSe transistors exhibits a field effect mobility of up to
$250~\mathrm{cm^2/Vs}$ at $T=1.3~\mathrm{K}$. SnSe is thus found to be a high
quality, quasi two-dimensional semiconductor ideal for thermoelectric
applications.
| cond-mat.mtrl-sci cond-mat.mes-hall | stannous selenide is a layered semiconductor that is a polar analogue of black phosphorus and of great interest as a thermoelectric material unusually hole doped snse supports a large seebeck coefficient at high conductivity which has not been explained to date angle resolved photoemission spectroscopy optical reflection spectroscopy and magnetotransport measurements reveal a multiplevalley valence band structure and a quasi twodimensional dispersion realizing a hicksdresselhaus thermoelectric contributing to the high seebeck coefficient at high carrier density we further demonstrate that the hole accumulation layer in exfoliated snse transistors exhibits a field effect mobility of up to 250mathrmcm2vs at t13mathrmk snse is thus found to be a high quality quasi twodimensional semiconductor ideal for thermoelectric applications | [['stannous', 'selenide', 'is', 'a', 'layered', 'semiconductor', 'that', 'is', 'a', 'polar', 'analogue', 'of', 'black', 'phosphorus', 'and', 'of', 'great', 'interest', 'as', 'a', 'thermoelectric', 'material', 'unusually', 'hole', 'doped', 'snse', 'supports', 'a', 'large', 'seebeck', 'coefficient', 'at', 'high', 'conductivity', 'which', 'has', 'not', 'been', 'explained', 'to', 'date', 'angle', 'resolved', 'photoemission', 'spectroscopy', 'optical', 'reflection', 'spectroscopy', 'and', 'magnetotransport', 'measurements', 'reveal', 'a', 'multiplevalley', 'valence', 'band', 'structure', 'and', 'a', 'quasi', 'twodimensional', 'dispersion', 'realizing', 'a', 'hicksdresselhaus', 'thermoelectric', 'contributing', 'to', 'the', 'high', 'seebeck', 'coefficient', 'at', 'high', 'carrier', 'density', 'we', 'further', 'demonstrate', 'that', 'the', 'hole', 'accumulation', 'layer', 'in', 'exfoliated', 'snse', 'transistors', 'exhibits', 'a', 'field', 'effect', 'mobility', 'of', 'up', 'to', '250mathrmcm2vs', 'at', 't13mathrmk', 'snse', 'is', 'thus', 'found', 'to', 'be', 'a', 'high', 'quality', 'quasi', 'twodimensional', 'semiconductor', 'ideal', 'for', 'thermoelectric', 'applications']] | [-0.16889435096897862, 0.10113572496920824, -0.04634810862004418, -0.04203890809810466, -0.075208392620764, -0.21974613873118704, 0.10513685629279776, 0.4560031726787036, -0.27544750298627396, -0.27130196478895163, -0.000996793897568502, -0.3897927612574263, -0.14542821804061531, 0.26384926963100125, 0.01886271330612627, 0.06808398874815215, -0.036862817254256115, -0.1240838454655287, -0.13995156043039805, -0.18729542082258954, 0.18254830337722194, 0.11711002303795381, 0.3675571418197995, 0.1257366528438235, 0.09740472622215748, -0.03431807943535122, 0.1735843748616224, 0.0968889525033195, -0.13711074426074363, 0.07825686291537502, 0.32081315865401516, -0.22878391089298847, 0.21809238804377276, -0.3594331636940214, -0.28104738646440885, -0.09675993441011418, 0.12775387089138596, 0.11830026824556461, -0.1776416848307814, -0.18042727634945716, 0.11259077908471227, -0.20209448728710414, -0.10275038509756665, -0.10322319424965165, -0.010364168779712848, -0.07576131141659888, -0.23273093295124866, 0.10293019276789643, -0.012335917455228893, 0.06000432649479163, -0.09203030127947304, -0.11822288824220198, -0.09873884065415371, 0.02325899209403856, 0.018230660803700713, 0.009741775826974348, 0.19186385496604172, -0.1494266840100119, -0.10543163069100543, 0.39173952195454725, -0.08072019815444946, -0.04929634871236472, 0.13509677014821633, -0.2906771401874721, -0.057464824049648915, 0.19833175339312717, 0.13432195556604049, 0.10278665783222427, -0.14629933808729137, 0.08507565301684239, -0.05556317195613784, 0.19983474489470773, 0.09806157272012735, 0.1646620667539537, 0.35572517158632927, 0.23503960053335918, 0.011710255982523616, 0.11653133815429596, -0.14531444038095123, 0.11951578672424974, -0.10015453943051397, -0.26588348928330974, -0.26941531669475477, 0.19123388701343422, -0.08679864751347023, -0.22903433845759455, 0.39983699637549847, 0.1126204562754455, 0.1616235149770298, -0.11018555795837363, 0.23496935587080026, 0.13413887946570122, 0.10022283853031695, 0.02279393960383128, 0.25609923907640303, 0.20928858797997235, 0.14646688614209943, -0.2880331981715492, 0.10195091429843821, -0.027264803866009144] |
1,802.0807 | A New Foundation for Finitary Corecursion and Iterative Algebras | This paper contributes to a theory of the behaviour of "finite-state" systems
that is generic in the system type. We propose that such systems are modelled
as coalgebras with a finitely generated carrier for an endofunctor on a locally
finitely presentable category. Their behaviour gives rise to a new fixpoint of
the coalgebraic type functor called locally finite fixpoint (LFF). We prove
that if the given endofunctor is finitary and preserves monomorphisms then the
LFF always exists and is a subcoalgebra of the final coalgebra (unlike the
rational fixpoint previously studied by Ad\'amek, Milius, and Velebil).
Moreover, we show that the LFF is characterized by two universal properties:
(1) as the final locally finitely generated coalgebra, and (2) as the initial
fg-iterative algebra. As instances of the LFF we first obtain the known
instances of the rational fixpoint, e.g. regular languages, rational streams
and formal power-series, regular trees etc. Moreover, we obtain a number of new
examples, e.g. (realtime deterministic resp. non-deterministic) context-free
languages, constructively S-algebraic formal power-series (in general, the
behaviour of finite coalgebras under the coalgebraic language semantics arising
from the generalized powerset construction by Silva, Bonchi, Bonsangue, and
Rutten), and the monad of Courcelle's algebraic trees.
| cs.LO | this paper contributes to a theory of the behaviour of finitestate systems that is generic in the system type we propose that such systems are modelled as coalgebras with a finitely generated carrier for an endofunctor on a locally finitely presentable category their behaviour gives rise to a new fixpoint of the coalgebraic type functor called locally finite fixpoint lff we prove that if the given endofunctor is finitary and preserves monomorphisms then the lff always exists and is a subcoalgebra of the final coalgebra unlike the rational fixpoint previously studied by adamek milius and velebil moreover we show that the lff is characterized by two universal properties 1 as the final locally finitely generated coalgebra and 2 as the initial fgiterative algebra as instances of the lff we first obtain the known instances of the rational fixpoint eg regular languages rational streams and formal powerseries regular trees etc moreover we obtain a number of new examples eg realtime deterministic resp nondeterministic contextfree languages constructively salgebraic formal powerseries in general the behaviour of finite coalgebras under the coalgebraic language semantics arising from the generalized powerset construction by silva bonchi bonsangue and rutten and the monad of courcelles algebraic trees | [['this', 'paper', 'contributes', 'to', 'a', 'theory', 'of', 'the', 'behaviour', 'of', 'finitestate', 'systems', 'that', 'is', 'generic', 'in', 'the', 'system', 'type', 'we', 'propose', 'that', 'such', 'systems', 'are', 'modelled', 'as', 'coalgebras', 'with', 'a', 'finitely', 'generated', 'carrier', 'for', 'an', 'endofunctor', 'on', 'a', 'locally', 'finitely', 'presentable', 'category', 'their', 'behaviour', 'gives', 'rise', 'to', 'a', 'new', 'fixpoint', 'of', 'the', 'coalgebraic', 'type', 'functor', 'called', 'locally', 'finite', 'fixpoint', 'lff', 'we', 'prove', 'that', 'if', 'the', 'given', 'endofunctor', 'is', 'finitary', 'and', 'preserves', 'monomorphisms', 'then', 'the', 'lff', 'always', 'exists', 'and', 'is', 'a', 'subcoalgebra', 'of', 'the', 'final', 'coalgebra', 'unlike', 'the', 'rational', 'fixpoint', 'previously', 'studied', 'by', 'adamek', 'milius', 'and', 'velebil', 'moreover', 'we', 'show', 'that', 'the', 'lff', 'is', 'characterized', 'by', 'two', 'universal', 'properties', '1', 'as', 'the', 'final', 'locally', 'finitely', 'generated', 'coalgebra', 'and', '2', 'as', 'the', 'initial', 'fgiterative', 'algebra', 'as', 'instances', 'of', 'the', 'lff', 'we', 'first', 'obtain', 'the', 'known', 'instances', 'of', 'the', 'rational', 'fixpoint', 'eg', 'regular', 'languages', 'rational', 'streams', 'and', 'formal', 'powerseries', 'regular', 'trees', 'etc', 'moreover', 'we', 'obtain', 'a', 'number', 'of', 'new', 'examples', 'eg', 'realtime', 'deterministic', 'resp', 'nondeterministic', 'contextfree', 'languages', 'constructively', 'salgebraic', 'formal', 'powerseries', 'in', 'general', 'the', 'behaviour', 'of', 'finite', 'coalgebras', 'under', 'the', 'coalgebraic', 'language', 'semantics', 'arising', 'from', 'the', 'generalized', 'powerset', 'construction', 'by', 'silva', 'bonchi', 'bonsangue', 'and', 'rutten', 'and', 'the', 'monad', 'of', 'courcelles', 'algebraic', 'trees']] | [-0.1399716704606367, 0.0858105192993452, -0.08559177134854974, 0.10596245629322919, -0.13632265969089746, -0.1647432570671899, 0.03238187899675958, 0.34738941669823403, -0.4086982764984448, -0.17927121271752766, 0.08734466671426, -0.22702482670367113, -0.12916402946708505, 0.19747768586435294, -0.1477023800409536, 0.0012479077027117843, 0.05518435606458768, 0.11282264861646983, -0.051961381796766355, -0.23718437115155955, 0.40755001769689514, -0.038274297241338996, 0.21231369086101576, -0.0004325212670258497, 0.14881209032680973, 0.012302684868321881, -0.003871616919236589, 0.058614799094523495, -0.1338739161957871, 0.07930889767996475, 0.343385209362519, 0.17804119708891106, 0.23368775382181328, -0.3716522515538683, -0.07995805671237063, 0.1294109951438817, 0.10438277991060144, 0.06041290373706878, -0.018794093452403463, -0.29023031682617545, 0.1393048367226676, -0.255677344996085, -0.05694830761974214, -0.09299306419966412, 0.08469081992699486, 0.039861462509193396, -0.2506814756717883, -0.045484407832089645, 0.17642459212353234, 0.1093281414548909, -0.054595603256576176, -0.06674423581757465, -0.0923007508222165, 0.07043157725212008, -0.079085285969192, 0.009497943313007578, 0.10013352336153993, -0.06461727485500351, -0.18764887689636445, 0.34734354749189567, -0.062143983029831554, -0.1969846143578723, 0.19031668574960553, -0.0874128297968829, -0.1635463414170075, 0.1019204439332964, 0.03626718636729807, 0.16861110216309197, -0.09471173366285898, 0.21508799965858583, -0.1344816721172124, 0.1256219894887624, 0.12359093404067728, 0.03153607196932148, 0.11829483758913457, 0.13602284771546266, 0.04618873901731396, 0.17282492390639967, 0.09375262333595473, -0.06617451576707498, -0.3362569821849117, -0.13405941361647103, -0.06812097616703486, 0.06014928945250393, -0.07353532966765573, -0.24677152067971259, 0.37558546140884536, 0.0927640847391378, 0.13134993917928053, 0.2025331255440898, 0.25287017820173696, 0.0966088007639167, 0.028750958995477575, 0.06466794164666935, 0.10297119215829298, 0.15545600909044788, 0.039443467526819535, -0.11289392886706982, 0.0764553646349022, 0.21030680644609565] |
1,802.08071 | What happens if measure the electron spin twice? | The mainstream textbooks of quantum mechanics explains the quantum state
collapses into an eigenstate in the measurement, while other explanations such
as hidden variables and multi-universe deny the collapsing. Here we propose an
ideal thinking experiment on measuring the spin of an electron with 3 steps. It
is simple and straightforward, in short, to measure a spin-up electron in
x-axis, and then in z-axis. Whether there is a collapsing predicts different
results of the experiment. The future realistic experiment will show the
quantum state collapses or not in the measurement.
| physics.gen-ph quant-ph | the mainstream textbooks of quantum mechanics explains the quantum state collapses into an eigenstate in the measurement while other explanations such as hidden variables and multiuniverse deny the collapsing here we propose an ideal thinking experiment on measuring the spin of an electron with 3 steps it is simple and straightforward in short to measure a spinup electron in xaxis and then in zaxis whether there is a collapsing predicts different results of the experiment the future realistic experiment will show the quantum state collapses or not in the measurement | [['the', 'mainstream', 'textbooks', 'of', 'quantum', 'mechanics', 'explains', 'the', 'quantum', 'state', 'collapses', 'into', 'an', 'eigenstate', 'in', 'the', 'measurement', 'while', 'other', 'explanations', 'such', 'as', 'hidden', 'variables', 'and', 'multiuniverse', 'deny', 'the', 'collapsing', 'here', 'we', 'propose', 'an', 'ideal', 'thinking', 'experiment', 'on', 'measuring', 'the', 'spin', 'of', 'an', 'electron', 'with', '3', 'steps', 'it', 'is', 'simple', 'and', 'straightforward', 'in', 'short', 'to', 'measure', 'a', 'spinup', 'electron', 'in', 'xaxis', 'and', 'then', 'in', 'zaxis', 'whether', 'there', 'is', 'a', 'collapsing', 'predicts', 'different', 'results', 'of', 'the', 'experiment', 'the', 'future', 'realistic', 'experiment', 'will', 'show', 'the', 'quantum', 'state', 'collapses', 'or', 'not', 'in', 'the', 'measurement']] | [-0.09433889662226042, 0.2058103666787954, -0.09751105962528123, 0.08185989379934552, -0.04089753079331583, -0.16431224438258343, 0.032595044790974095, 0.3381933350736896, -0.2550552474955718, -0.27975478125218717, 0.051456658763345334, -0.30143374684784147, -0.08464729811918612, 0.16928171987076188, -0.035636645881459116, 0.02699373257346451, 0.059704620755898455, 0.06114595938060019, -0.09522111638863054, -0.19587637268834643, 0.29884772799495196, 0.05112620119341753, 0.27505092959747546, 0.07409803912871414, 0.11258504103041357, 0.002543839222441117, 0.018065420015611584, -0.002598881085092823, -0.1003898038215185, 0.02523531271662149, 0.2380920756711728, 0.16873843430334495, 0.25970105045319847, -0.49033572264015673, -0.15100941738734644, 0.07561485489519934, 0.12488321089703176, 0.15705758144095955, -0.05866850380423582, -0.2994392471387982, 0.02155720929084863, -0.16590405361105998, -0.13655735606120692, -0.045455494579962556, 0.03697656955983904, -0.052484586039402835, -0.20084586680038935, 0.06538728387095034, 0.11188992669598924, 0.029919193654010693, -0.04789665489871469, -0.053366476352999195, 0.05978633045322365, 0.09916646358712265, 0.024295892105955216, 0.04840552564192977, 0.14779445169390076, -0.13229537095046706, -0.17607638220716681, 0.4000965955563717, -0.05632689303666767, -0.19309502980775303, 0.17284677754570213, -0.17579431544161506, -0.10100147574105196, 0.044481384381651876, 0.0811642318757044, 0.07138819795929724, -0.10738643284421415, 0.032286994157281396, -0.04677764664714535, 0.185899816143016, 0.023734430140919156, 0.0037742262499199973, 0.28908196991930407, 0.1795160679715789, 0.05528969726421767, 0.09666460298532102, -0.10914707343973633, -0.13790096812364128, -0.3136035687186652, -0.23787661522833836, -0.2094529375537402, 0.11816341819568253, -0.02656823739930082, -0.1338660650058753, 0.3849162008613348, 0.15998281463980674, 0.21387678113662534, -0.031189632459750607, 0.31758800618764427, 0.10984448555520632, 0.028674005625200356, 0.0496128282095823, 0.25391915635102325, 0.10287540250768264, 0.07631586809487392, -0.20582576668821276, 0.07548607531934977, -0.026467731057588633] |
1,802.08072 | The fallacy of Schott energy-momentum | The incompatibility between Larmor's formula for radiation losses (at a rate
proportional to square of the acceleration of the electric charge) and the
radiation reaction (the rate of loss of momentum of the accelerated charge
proportional to its rate of change of acceleration) was recently shown to arise
because a proper distinction is not kept between radiation losses calculated in
terms of a retarded time and those expressed in terms of a "real time".
However, the occurrence of this disparity between two formulations is usually
reconciled in literature by proposing an acceleration-dependent Schott energy
lying somewhere in the nearby electromagnetic fields of an accelerated charge.
But nobody has yet unambiguously demonstrated where the Schott energy actually
lies in the fields. By scrutinizing electromagnetic fields of a uniformly
accelerated charge, a mathematically tractable case, we show that contrary to
the ideas prevalent in the literature, there is no evidence of any
acceleration-dependent Schott energy-momentum in the electromagnetic fields,
anywhere in the near vicinity of the charge or elsewhere. Accordingly, we
expose the fallacy of the Schott energy-momentum term, which should henceforth
be abandoned, in the electromagnetic radiation formulation.
| physics.gen-ph | the incompatibility between larmors formula for radiation losses at a rate proportional to square of the acceleration of the electric charge and the radiation reaction the rate of loss of momentum of the accelerated charge proportional to its rate of change of acceleration was recently shown to arise because a proper distinction is not kept between radiation losses calculated in terms of a retarded time and those expressed in terms of a real time however the occurrence of this disparity between two formulations is usually reconciled in literature by proposing an accelerationdependent schott energy lying somewhere in the nearby electromagnetic fields of an accelerated charge but nobody has yet unambiguously demonstrated where the schott energy actually lies in the fields by scrutinizing electromagnetic fields of a uniformly accelerated charge a mathematically tractable case we show that contrary to the ideas prevalent in the literature there is no evidence of any accelerationdependent schott energymomentum in the electromagnetic fields anywhere in the near vicinity of the charge or elsewhere accordingly we expose the fallacy of the schott energymomentum term which should henceforth be abandoned in the electromagnetic radiation formulation | [['the', 'incompatibility', 'between', 'larmors', 'formula', 'for', 'radiation', 'losses', 'at', 'a', 'rate', 'proportional', 'to', 'square', 'of', 'the', 'acceleration', 'of', 'the', 'electric', 'charge', 'and', 'the', 'radiation', 'reaction', 'the', 'rate', 'of', 'loss', 'of', 'momentum', 'of', 'the', 'accelerated', 'charge', 'proportional', 'to', 'its', 'rate', 'of', 'change', 'of', 'acceleration', 'was', 'recently', 'shown', 'to', 'arise', 'because', 'a', 'proper', 'distinction', 'is', 'not', 'kept', 'between', 'radiation', 'losses', 'calculated', 'in', 'terms', 'of', 'a', 'retarded', 'time', 'and', 'those', 'expressed', 'in', 'terms', 'of', 'a', 'real', 'time', 'however', 'the', 'occurrence', 'of', 'this', 'disparity', 'between', 'two', 'formulations', 'is', 'usually', 'reconciled', 'in', 'literature', 'by', 'proposing', 'an', 'accelerationdependent', 'schott', 'energy', 'lying', 'somewhere', 'in', 'the', 'nearby', 'electromagnetic', 'fields', 'of', 'an', 'accelerated', 'charge', 'but', 'nobody', 'has', 'yet', 'unambiguously', 'demonstrated', 'where', 'the', 'schott', 'energy', 'actually', 'lies', 'in', 'the', 'fields', 'by', 'scrutinizing', 'electromagnetic', 'fields', 'of', 'a', 'uniformly', 'accelerated', 'charge', 'a', 'mathematically', 'tractable', 'case', 'we', 'show', 'that', 'contrary', 'to', 'the', 'ideas', 'prevalent', 'in', 'the', 'literature', 'there', 'is', 'no', 'evidence', 'of', 'any', 'accelerationdependent', 'schott', 'energymomentum', 'in', 'the', 'electromagnetic', 'fields', 'anywhere', 'in', 'the', 'near', 'vicinity', 'of', 'the', 'charge', 'or', 'elsewhere', 'accordingly', 'we', 'expose', 'the', 'fallacy', 'of', 'the', 'schott', 'energymomentum', 'term', 'which', 'should', 'henceforth', 'be', 'abandoned', 'in', 'the', 'electromagnetic', 'radiation', 'formulation']] | [-0.15435216421532857, 0.1494174873629737, -0.06380714248398314, 0.08034334990773649, -0.05579303642286655, -0.056748506984110665, 0.019695542043045085, 0.3463807206620826, -0.23936697041346905, -0.2945462714004166, 0.021973489566437184, -0.2582643913369088, -0.09826476694542895, 0.16393672723577105, -0.05761862821119992, -0.0455992382276868, -0.023150956670922988, 0.07426811703904108, -0.06288964750511661, -0.17881038013775957, 0.30164803454732114, 0.11247991015113651, 0.2732373204413443, 0.11232206730774659, 0.11698497369272863, -0.0253849976651251, -0.02459329185897813, 0.042897244387450705, -0.06635791059343903, 0.056558587179982404, 0.23770827662578242, 0.08204008127627446, 0.28814533862091085, -0.4508410661635711, -0.20837284496581968, 0.1449237187320795, 0.12286665798339216, 0.0898487341414669, -0.06547977158598686, -0.22678357221056672, 0.018842928552312805, -0.17368733420729, -0.14869240323021848, 0.013774710213068255, 0.03998304646813783, 0.009887721241989675, -0.2448145004467451, 0.1226631582859047, 0.06020477016202428, 0.012108523912390414, -0.1033588540783889, -0.06999293995154574, -0.011651337333521581, 0.078474393700882, 0.14816734591812733, 0.07586106228879354, 0.12505239809808485, -0.15712561015721987, -0.0972015615303647, 0.3861369982879748, -0.051732966691295415, -0.20758773373280537, 0.14525733705713378, -0.1661014224086355, -0.035949466456186005, 0.16718697595225776, 0.11307550801952833, 0.11269808668807588, -0.18290752076567524, 0.08717148351410832, 0.013028168572700597, 0.11914792569618134, 0.11553581842883705, 0.04286193073369852, 0.24529126950883293, 0.06952916353164032, -0.0017903553979361757, 0.1066612224187951, -0.052624842774541304, -0.10016865787758707, -0.3456376256212034, -0.1724106039363831, -0.2306451040748407, 0.06522110434515803, -0.0470424943149431, -0.15689173790443822, 0.34913181296094037, 0.14994318029011555, 0.15859000023733327, -0.01376792781968865, 0.30508352669683053, 0.1433429694946178, 0.09802889209091264, 0.10541565552662639, 0.3520985173776168, 0.11995664299938848, 0.13666208726651208, -0.23393180566456387, 0.06890122674375693, 0.03442067620568575] |
1,802.08073 | The State-of-Play of Anomalous Microwave Emission (AME) Research | Anomalous Microwave Emission (AME) is a component of diffuse Galactic
radiation observed at frequencies in the range $\approx 10$-60 GHz. AME was
first detected in 1996 and recognised as an additional component of emission in
1997. Since then, AME has been observed by a range of experiments and in a
variety of environments. AME is spatially correlated with far-IR thermal dust
emission but cannot be explained by synchrotron or free-free emission
mechanisms, and is far in excess of the emission contributed by thermal dust
emission with the power-law opacity consistent with the observed emission at
sub-mm wavelengths. Polarization observations have shown that AME is very
weakly polarized ($\lesssim 1$%). The most natural explanation for AME is
rotational emission from ultra-small dust grains ("spinning dust"), first
postulated in 1957. Magnetic dipole radiation from thermal fluctuations in the
magnetization of magnetic grain materials may also be contributing to the AME,
particularly at higher frequencies ($\gtrsim 50$ GHz). AME is also an important
foreground for Cosmic Microwave Background analyses. This paper presents a
review and the current state-of-play in AME research, which was discussed in an
AME workshop held at ESTEC, The Netherlands, June 2016.
| astro-ph.GA | anomalous microwave emission ame is a component of diffuse galactic radiation observed at frequencies in the range approx 1060 ghz ame was first detected in 1996 and recognised as an additional component of emission in 1997 since then ame has been observed by a range of experiments and in a variety of environments ame is spatially correlated with farir thermal dust emission but cannot be explained by synchrotron or freefree emission mechanisms and is far in excess of the emission contributed by thermal dust emission with the powerlaw opacity consistent with the observed emission at submm wavelengths polarization observations have shown that ame is very weakly polarized lesssim 1 the most natural explanation for ame is rotational emission from ultrasmall dust grains spinning dust first postulated in 1957 magnetic dipole radiation from thermal fluctuations in the magnetization of magnetic grain materials may also be contributing to the ame particularly at higher frequencies gtrsim 50 ghz ame is also an important foreground for cosmic microwave background analyses this paper presents a review and the current stateofplay in ame research which was discussed in an ame workshop held at estec the netherlands june 2016 | [['anomalous', 'microwave', 'emission', 'ame', 'is', 'a', 'component', 'of', 'diffuse', 'galactic', 'radiation', 'observed', 'at', 'frequencies', 'in', 'the', 'range', 'approx', '1060', 'ghz', 'ame', 'was', 'first', 'detected', 'in', '1996', 'and', 'recognised', 'as', 'an', 'additional', 'component', 'of', 'emission', 'in', '1997', 'since', 'then', 'ame', 'has', 'been', 'observed', 'by', 'a', 'range', 'of', 'experiments', 'and', 'in', 'a', 'variety', 'of', 'environments', 'ame', 'is', 'spatially', 'correlated', 'with', 'farir', 'thermal', 'dust', 'emission', 'but', 'can', 'not', 'be', 'explained', 'by', 'synchrotron', 'or', 'freefree', 'emission', 'mechanisms', 'and', 'is', 'far', 'in', 'excess', 'of', 'the', 'emission', 'contributed', 'by', 'thermal', 'dust', 'emission', 'with', 'the', 'powerlaw', 'opacity', 'consistent', 'with', 'the', 'observed', 'emission', 'at', 'submm', 'wavelengths', 'polarization', 'observations', 'have', 'shown', 'that', 'ame', 'is', 'very', 'weakly', 'polarized', 'lesssim', '1', 'the', 'most', 'natural', 'explanation', 'for', 'ame', 'is', 'rotational', 'emission', 'from', 'ultrasmall', 'dust', 'grains', 'spinning', 'dust', 'first', 'postulated', 'in', '1957', 'magnetic', 'dipole', 'radiation', 'from', 'thermal', 'fluctuations', 'in', 'the', 'magnetization', 'of', 'magnetic', 'grain', 'materials', 'may', 'also', 'be', 'contributing', 'to', 'the', 'ame', 'particularly', 'at', 'higher', 'frequencies', 'gtrsim', '50', 'ghz', 'ame', 'is', 'also', 'an', 'important', 'foreground', 'for', 'cosmic', 'microwave', 'background', 'analyses', 'this', 'paper', 'presents', 'a', 'review', 'and', 'the', 'current', 'stateofplay', 'in', 'ame', 'research', 'which', 'was', 'discussed', 'in', 'an', 'ame', 'workshop', 'held', 'at', 'estec', 'the', 'netherlands', 'june', '2016']] | [-0.042079323534683986, 0.18178612337904573, -0.031032337911180246, 0.05606445912235358, -0.04919833724246322, -0.07804275255512039, -0.014621459743769568, 0.44715328025631607, -0.16673126476537922, -0.3250718153091536, 0.03868531466954058, -0.2999065806264601, -0.012268970682877503, 0.2060228337929099, 0.003224537818217262, -0.04978777008545876, -0.0789232958923094, -0.1390501933832032, 0.09783363668672489, -0.17819776626614234, 0.24019431833100194, 0.1755787907920118, 0.25882636082436267, 0.09223912486625825, 0.07296840179575763, -0.15515299240602567, -0.08272455957679388, -0.019272256822053652, -0.049998912044922385, 0.06364529022175702, 0.29767730461026076, 0.08381129718206164, 0.11572460920918577, -0.37469017707917374, -0.2749277264229022, 0.10616338125206919, 0.12847851904613586, 0.07565886477095773, -0.01226021334878169, -0.24933904249822567, -0.007720697382562018, -0.16432170698681148, -0.16708261369543229, 0.06194614863125025, 0.10906449747562874, -0.07630680849251803, -0.2331271303773974, 0.11067817561312647, 0.041779435445884396, 0.11871583486208692, -0.0981438237082936, -0.13576490908356695, -0.04366994657660447, 0.024050094017241008, 0.04355495866184356, 0.09196284460873964, 0.20772389481862774, -0.1088284486346917, -0.12490767106646672, 0.37052228752387845, -0.1341575056236858, 0.01049575065553654, 0.21093673326201193, -0.26788568558852904, -0.19791777044762662, 0.24971951656819633, 0.10265301740340267, 0.06130235736903463, -0.20718346892438907, 0.06728473866799807, -0.01654964351655508, 0.22034205245654448, 0.10091301854724104, 0.0797717674577143, 0.36812777516024653, 0.09674681768713829, 0.00022808930831767307, 0.18237361016751188, -0.21504948461370077, 0.023112888484320138, -0.2533032320619289, -0.06957633045991922, -0.20498136543877385, 0.11601867074697718, -0.07479608451800838, -0.100427442337453, 0.31675719316679835, 0.1398135252972376, 0.14790874243287058, -0.012347422354044587, 0.3217325387692351, 0.10153943244343584, 0.052883834214298986, 0.1472388623127093, 0.35301420962787233, 0.16558040124194426, 0.13851158064062474, -0.1989173729337684, 0.0820944680829901, -0.09730635955262794] |
1,802.08074 | A non-local linear dynamical system and violation of Bell's inequality | A simple classical non-local dynamical system with random initial conditions
and an output projecting the state variable on selected axes has been defined
to mimic a two-channel quantum coincidence experiment. Non-locality is
introduced by a parameter connecting the initial conditions to the selection of
the projection axes. The statistics of the results shows violations up to 100%
of the Bell's inequality, in the form of Clauser-Horne- Shimony-Holt (CHSH),
strongly depending on the non-locality parameter. Discussions on the
parallelism with Bohmian mechanics are given.
| physics.gen-ph quant-ph | a simple classical nonlocal dynamical system with random initial conditions and an output projecting the state variable on selected axes has been defined to mimic a twochannel quantum coincidence experiment nonlocality is introduced by a parameter connecting the initial conditions to the selection of the projection axes the statistics of the results shows violations up to 100 of the bells inequality in the form of clauserhorne shimonyholt chsh strongly depending on the nonlocality parameter discussions on the parallelism with bohmian mechanics are given | [['a', 'simple', 'classical', 'nonlocal', 'dynamical', 'system', 'with', 'random', 'initial', 'conditions', 'and', 'an', 'output', 'projecting', 'the', 'state', 'variable', 'on', 'selected', 'axes', 'has', 'been', 'defined', 'to', 'mimic', 'a', 'twochannel', 'quantum', 'coincidence', 'experiment', 'nonlocality', 'is', 'introduced', 'by', 'a', 'parameter', 'connecting', 'the', 'initial', 'conditions', 'to', 'the', 'selection', 'of', 'the', 'projection', 'axes', 'the', 'statistics', 'of', 'the', 'results', 'shows', 'violations', 'up', 'to', '100', 'of', 'the', 'bells', 'inequality', 'in', 'the', 'form', 'of', 'clauserhorne', 'shimonyholt', 'chsh', 'strongly', 'depending', 'on', 'the', 'nonlocality', 'parameter', 'discussions', 'on', 'the', 'parallelism', 'with', 'bohmian', 'mechanics', 'are', 'given']] | [-0.14205763599176596, 0.12697080279882889, -0.1191344112952853, 0.04368344181722666, -0.07646346816270636, -0.17745549740729763, 0.01728252183770897, 0.30800628913112166, -0.24729185294723366, -0.30471274555410915, 0.06023635263214024, -0.26564162919615825, -0.05297436054636974, 0.17687118281723885, -0.058720818209666306, 0.10823713800665445, 0.05897243865538479, 0.04720086258234138, -0.09153002649602457, -0.2653901500445677, 0.3276453247782206, 0.047270001984121866, 0.29117969152086026, 0.0061918827932237125, 0.11596470326469166, 0.03276426385145453, 0.0228619645917561, 0.03017029933852893, -0.12298649900433857, 0.07645706145274567, 0.15118745941577888, 0.15331326581526367, 0.29434738799975046, -0.37298520492310294, -0.17339967648930302, 0.09089974620629375, 0.043331714057386284, 0.10843711462235306, 0.003567203965958026, -0.3829060141451475, 0.004143904769656862, -0.10065911918709611, -0.15005335148719207, -0.033592068601581385, 0.014333602041006088, 0.005654935861324392, -0.2730111350169087, 0.10818711968661263, 0.047661832597308294, 0.050156310405127885, -0.014272117345571154, -0.05834737422779521, 0.0078037395028442876, 0.05583482938137178, -0.008455569279471003, 0.015189668707401923, 0.14574958072838987, -0.09471765024269499, -0.17094385968634812, 0.37946737255537655, 0.00039266224626860604, -0.2708086636848748, 0.17281156090065475, -0.14728583652730576, -0.12710289215873471, 0.06218914458494088, 0.10618183306963523, 0.05845251408541893, -0.1414047988307685, 0.05731761637754261, -0.06347784418158414, 0.18057631184460549, 0.08561377880935807, 0.06024950604158931, 0.17358951686268173, 0.11980103168114112, 0.05640751565806568, 0.13542287914996695, -0.07243370675310072, -0.18519700586472115, -0.36428338614088007, -0.1540263823528842, -0.2462267051706454, 0.08519762822585862, -0.11244861799751539, -0.1252073045229403, 0.3839503985846688, 0.11647332115766093, 0.21161343492340387, -0.006189409688842006, 0.2107204405062764, 0.1273243531880037, 0.06713984613647549, 0.020347250239333002, 0.28106511889661595, 0.17606993060752113, 0.08069461290497423, -0.24754168384526742, 0.09437211945215694, 0.04206502397839979] |
1,802.08075 | Octonions, triality, the exceptional Lie algebra F4, and polar actions
on the Cayley hyperbolic plane | Using octonions and the triality property of Spin(8), we find explicit
formulae for the Lie brackets of the exceptional simple real Lie algebras
$\mathfrak{f}_4$ and $\mathfrak{f}^*_4$, i.e. the Lie algebras of the isometry
groups of the Cayley projective plane and the Cayley hyperbolic plane. As an
application, we classify polar actions on the Cayley hyperbolic plane which
leave a totally geodesic subspace invariant.
| math.DG math.RA | using octonions and the triality property of spin8 we find explicit formulae for the lie brackets of the exceptional simple real lie algebras mathfrakf_4 and mathfrakf_4 ie the lie algebras of the isometry groups of the cayley projective plane and the cayley hyperbolic plane as an application we classify polar actions on the cayley hyperbolic plane which leave a totally geodesic subspace invariant | [['using', 'octonions', 'and', 'the', 'triality', 'property', 'of', 'spin8', 'we', 'find', 'explicit', 'formulae', 'for', 'the', 'lie', 'brackets', 'of', 'the', 'exceptional', 'simple', 'real', 'lie', 'algebras', 'mathfrakf_4', 'and', 'mathfrakf_4', 'ie', 'the', 'lie', 'algebras', 'of', 'the', 'isometry', 'groups', 'of', 'the', 'cayley', 'projective', 'plane', 'and', 'the', 'cayley', 'hyperbolic', 'plane', 'as', 'an', 'application', 'we', 'classify', 'polar', 'actions', 'on', 'the', 'cayley', 'hyperbolic', 'plane', 'which', 'leave', 'a', 'totally', 'geodesic', 'subspace', 'invariant']] | [-0.24414224313601615, 0.09388446631656114, -0.04031207890892845, 0.08777207378593702, -0.23309428058564663, -0.07748709840049582, -0.004021780166242804, 0.4102200764630522, -0.3136912663541143, -0.16268981989872242, 0.15378443777029002, -0.2514624523427633, -0.19205156413261734, 0.19944795110218583, -0.0911720069550303, -0.05771848843950364, 0.016600446498376272, 0.1752116168139591, -0.17080951622495102, -0.2833561579149867, 0.4095606447921859, -0.04711903234027208, 0.2301955995637746, -0.009244945210715136, 0.18195685940898126, 0.05725852315062805, 0.0085169170938787, -0.04911380165093948, -0.13477103754375425, 0.09948985866965755, 0.28188093845909906, 0.03728287586469262, 0.03125591838495836, -0.3363236489868353, -0.09501552981849287, 0.2301211146977804, 0.20728200242396386, 0.003445065600634922, -0.06850307840772624, -0.33739864438890466, 0.02865776815821254, -0.14330347763404014, -0.1915528095430798, -0.044075650103863266, 0.04301358772707837, -0.022771040125498698, -0.12885272669945919, 0.022818160635079184, 0.13492266120137794, 0.18857603298411482, -0.06533721725212499, -0.081771598744487, -0.10675922243131532, 0.10698004160815525, -0.08224799228270376, -0.005588161589075175, 0.12547207631850762, 0.01587444022741346, -0.16436733819344745, 0.44836109107921995, 0.06639286924508356, -0.2615977087915535, 0.0884612051341387, -0.17717811213954102, -0.20232014461523956, 0.12225938059153064, 0.13836587522001492, 0.15066378300506916, -0.046516002303669375, 0.2407426367234808, -0.1482603566218463, -0.037281034011689446, 0.1190263731552968, -0.07060169631482235, 0.13830102917586734, 0.03281345806040224, 0.09222551957068462, 0.12953695194381806, 0.06022144835220561, -0.01951960285031606, -0.3563530311609308, -0.19296072548373588, -0.08917397811144058, 0.13670483942601888, -0.2046493713012693, -0.24124034695578592, 0.4058308008289526, 0.044484580364373943, 0.17528417168392074, 0.13500564597317918, 0.18809758061690937, 0.026418264164397166, 0.12672842370848808, 0.06607043233123563, 0.1335599616406456, 0.29590624708327506, -0.11204247565922468, -0.13020245751572979, -0.1477377297031501, 0.24634525868746024] |
1,802.08076 | Expansion Trees with Cut | Herbrand's theorem is one of the most fundamental insights in logic. From the
syntactic point of view, it suggests a compact representation of proofs in
classical first- and higher-order logic by recording the information of which
instances have been chosen for which quantifiers.
This compact representation is known in the literature as Miller's expansion
tree proof. It is inherently analytic and hence corresponds to a cut-free
sequent calculus proof. Recently several extensions of such proof
representations to proofs with cuts have been proposed. These extensions are
based on graphical formalisms similar to proof nets and are limited to prenex
formulas.
In this paper we present a new syntactic approach that directly extends
Miller's expansion trees by cuts and covers also non-prenex formulas. We
describe a cut-elimination procedure for our expansion trees with cut that is
based on the natural reduction steps and show that it is weakly normalizing.
| math.LO | herbrands theorem is one of the most fundamental insights in logic from the syntactic point of view it suggests a compact representation of proofs in classical first and higherorder logic by recording the information of which instances have been chosen for which quantifiers this compact representation is known in the literature as millers expansion tree proof it is inherently analytic and hence corresponds to a cutfree sequent calculus proof recently several extensions of such proof representations to proofs with cuts have been proposed these extensions are based on graphical formalisms similar to proof nets and are limited to prenex formulas in this paper we present a new syntactic approach that directly extends millers expansion trees by cuts and covers also nonprenex formulas we describe a cutelimination procedure for our expansion trees with cut that is based on the natural reduction steps and show that it is weakly normalizing | [['herbrands', 'theorem', 'is', 'one', 'of', 'the', 'most', 'fundamental', 'insights', 'in', 'logic', 'from', 'the', 'syntactic', 'point', 'of', 'view', 'it', 'suggests', 'a', 'compact', 'representation', 'of', 'proofs', 'in', 'classical', 'first', 'and', 'higherorder', 'logic', 'by', 'recording', 'the', 'information', 'of', 'which', 'instances', 'have', 'been', 'chosen', 'for', 'which', 'quantifiers', 'this', 'compact', 'representation', 'is', 'known', 'in', 'the', 'literature', 'as', 'millers', 'expansion', 'tree', 'proof', 'it', 'is', 'inherently', 'analytic', 'and', 'hence', 'corresponds', 'to', 'a', 'cutfree', 'sequent', 'calculus', 'proof', 'recently', 'several', 'extensions', 'of', 'such', 'proof', 'representations', 'to', 'proofs', 'with', 'cuts', 'have', 'been', 'proposed', 'these', 'extensions', 'are', 'based', 'on', 'graphical', 'formalisms', 'similar', 'to', 'proof', 'nets', 'and', 'are', 'limited', 'to', 'prenex', 'formulas', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'syntactic', 'approach', 'that', 'directly', 'extends', 'millers', 'expansion', 'trees', 'by', 'cuts', 'and', 'covers', 'also', 'nonprenex', 'formulas', 'we', 'describe', 'a', 'cutelimination', 'procedure', 'for', 'our', 'expansion', 'trees', 'with', 'cut', 'that', 'is', 'based', 'on', 'the', 'natural', 'reduction', 'steps', 'and', 'show', 'that', 'it', 'is', 'weakly', 'normalizing']] | [-0.041217225341824815, 0.029963866009918117, -0.16670453717705566, 0.1090784365573986, -0.1940370355103467, -0.11682395903846703, 0.06760779403172106, 0.35784748663836335, -0.27095700333263045, -0.2794319214236394, 0.12029629450281956, -0.2483289980556111, -0.15977949947291809, 0.22196097499565096, -0.12596638748525307, 0.0284252836718224, 0.06833236020159077, 0.04432401475748299, -0.03940132213284488, -0.23187399086403987, 0.31914544098765113, -0.02767548695005275, 0.2436942451293706, 0.0721394565834261, 0.12170301366446389, 0.02643975940205761, -0.06479125525928228, 0.00515345115264928, -0.1148042900076689, 0.1572859349229524, 0.3069984499944022, 0.18058477493468672, 0.24704850554258587, -0.386828994985695, -0.15688967218974958, 0.07319221008219756, 0.13572113547864295, 0.15275672169219753, 0.002635859606655415, -0.2787174013304851, 0.11419534831421098, -0.15705311851500459, -0.05832949579013763, -0.1436117490489237, 0.05426435668266857, 0.014673592594320056, -0.2235580744486101, -0.011268269546161645, 0.2123446136373221, 0.082148024334094, 0.008050759308782683, -0.12732046870567845, 0.04147391085909378, 0.03742383519892354, -0.0015712897529246638, 0.028827839794512082, 0.07082814743389955, -0.07268684355202257, -0.1858023288313652, 0.32095229871117986, -0.018996666534803808, -0.21129079530097394, 0.1843172431722082, -0.08463644254575106, -0.2281059343462206, 0.09777218667944465, 0.07763294942127981, 0.16077860859789056, -0.1625194451441309, 0.12715848821736053, -0.07950884619070142, 0.15595939019525806, 0.15122891957966006, 0.04725449597085449, 0.15354587159723648, 0.1743185026382373, 0.04332790933108914, 0.15662474510561977, 0.03125390684943193, -0.11540625487907312, -0.3284952476419307, -0.16143860405537527, -0.13897041426782772, -0.015690298566934525, -0.1030167180605703, -0.20447166885935222, 0.35716686619609295, 0.15708025921619106, 0.15863467094400344, 0.1563605570275261, 0.3045674985010378, 0.13739531801862492, 0.13810801636301787, 0.05990814266614679, 0.15315723446877422, 0.18444472540333565, 0.06426684754409802, -0.0794493620452232, 0.08145112413960207, 0.1702517600969185] |
1,802.08077 | Discriminative Label Consistent Domain Adaptation | Domain adaptation (DA) is transfer learning which aims to learn an effective
predictor on target data from source data despite data distribution mismatch
between source and target. We present in this paper a novel unsupervised DA
method for cross-domain visual recognition which simultaneously optimizes the
three terms of a theoretically established error bound. Specifically, the
proposed DA method iteratively searches a latent shared feature subspace where
not only the divergence of data distributions between the source domain and the
target domain is decreased as most state-of-the-art DA methods do, but also the
inter-class distances are increased to facilitate discriminative learning.
Moreover, the proposed DA method sparsely regresses class labels from the
features achieved in the shared subspace while minimizing the prediction errors
on the source data and ensuring label consistency between source and target.
Data outliers are also accounted for to further avoid negative knowledge
transfer. Comprehensive experiments and in-depth analysis verify the
effectiveness of the proposed DA method which consistently outperforms the
state-of-the-art DA methods on standard DA benchmarks, i.e., 12 cross-domain
image classification tasks.
| cs.CV | domain adaptation da is transfer learning which aims to learn an effective predictor on target data from source data despite data distribution mismatch between source and target we present in this paper a novel unsupervised da method for crossdomain visual recognition which simultaneously optimizes the three terms of a theoretically established error bound specifically the proposed da method iteratively searches a latent shared feature subspace where not only the divergence of data distributions between the source domain and the target domain is decreased as most stateoftheart da methods do but also the interclass distances are increased to facilitate discriminative learning moreover the proposed da method sparsely regresses class labels from the features achieved in the shared subspace while minimizing the prediction errors on the source data and ensuring label consistency between source and target data outliers are also accounted for to further avoid negative knowledge transfer comprehensive experiments and indepth analysis verify the effectiveness of the proposed da method which consistently outperforms the stateoftheart da methods on standard da benchmarks ie 12 crossdomain image classification tasks | [['domain', 'adaptation', 'da', 'is', 'transfer', 'learning', 'which', 'aims', 'to', 'learn', 'an', 'effective', 'predictor', 'on', 'target', 'data', 'from', 'source', 'data', 'despite', 'data', 'distribution', 'mismatch', 'between', 'source', 'and', 'target', 'we', 'present', 'in', 'this', 'paper', 'a', 'novel', 'unsupervised', 'da', 'method', 'for', 'crossdomain', 'visual', 'recognition', 'which', 'simultaneously', 'optimizes', 'the', 'three', 'terms', 'of', 'a', 'theoretically', 'established', 'error', 'bound', 'specifically', 'the', 'proposed', 'da', 'method', 'iteratively', 'searches', 'a', 'latent', 'shared', 'feature', 'subspace', 'where', 'not', 'only', 'the', 'divergence', 'of', 'data', 'distributions', 'between', 'the', 'source', 'domain', 'and', 'the', 'target', 'domain', 'is', 'decreased', 'as', 'most', 'stateoftheart', 'da', 'methods', 'do', 'but', 'also', 'the', 'interclass', 'distances', 'are', 'increased', 'to', 'facilitate', 'discriminative', 'learning', 'moreover', 'the', 'proposed', 'da', 'method', 'sparsely', 'regresses', 'class', 'labels', 'from', 'the', 'features', 'achieved', 'in', 'the', 'shared', 'subspace', 'while', 'minimizing', 'the', 'prediction', 'errors', 'on', 'the', 'source', 'data', 'and', 'ensuring', 'label', 'consistency', 'between', 'source', 'and', 'target', 'data', 'outliers', 'are', 'also', 'accounted', 'for', 'to', 'further', 'avoid', 'negative', 'knowledge', 'transfer', 'comprehensive', 'experiments', 'and', 'indepth', 'analysis', 'verify', 'the', 'effectiveness', 'of', 'the', 'proposed', 'da', 'method', 'which', 'consistently', 'outperforms', 'the', 'stateoftheart', 'da', 'methods', 'on', 'standard', 'da', 'benchmarks', 'ie', '12', 'crossdomain', 'image', 'classification', 'tasks']] | [-0.004941627346190878, -0.030443801723777142, -0.07407540653498886, 0.08680909337404459, -0.1347302590015302, -0.15115531596132892, 0.08289808148071064, 0.45033909183588217, -0.2768320908422042, -0.3472060161663897, 0.06613245090226304, -0.2924212579065087, -0.11741070300128988, 0.17564241946026662, -0.13275220243998442, 0.07619501156957333, 0.16747722629224882, 0.0485197079886513, -0.08427603161279959, -0.26150725528201624, 0.3279279274945359, 0.049052700739015236, 0.41791761365443975, 0.01885655211993832, 0.14561649404640775, -0.02802555350089361, -0.0957573989097992, -0.05724479890936478, -0.030680998102318634, 0.16802510063015771, 0.3433337933039928, 0.21670224953876724, 0.28535075778332114, -0.3057549072956052, -0.24191463057650253, 0.0992444253404921, 0.1650167191427582, 0.08832769309347813, -0.042144516087401745, -0.33683995742731815, 0.0899256394398187, -0.14886227212264203, 0.03201945845979604, -0.13830762017592366, -0.0321865539140576, -0.005301839055887699, -0.33732045332329685, 0.08227235863573283, 0.13156814301890501, 0.05993958856825801, -0.09227598805988567, -0.1679022645032753, 0.008866053153972396, 0.17470202707574406, 0.050151163902641696, 0.08432025066576898, 0.09524736307205538, -0.1536835018817907, -0.10955183655592422, 0.3233476219201376, -0.09815177947960117, -0.24454698359477334, 0.201829131182008, -0.02666673607415181, -0.10461970529484627, 0.09454511866417968, 0.22587674159810625, 0.1490537301023406, -0.20607641845444133, 0.012766518662829185, 0.001931832050269639, 0.19317774538649246, 0.04826873669596601, -0.01880823444067077, 0.14620898563357929, 0.2200866332674526, 0.03785966779502236, 0.1040201601841876, -0.19088074700531169, -0.05335803728898596, -0.23569075075845997, -0.068258296562073, -0.24807861797903155, -0.10319861877881274, -0.0913819096375102, -0.11401442158810161, 0.36654163960536773, 0.20130385042152324, 0.21345801096785263, 0.07255993338648378, 0.34507226312152023, -0.001246820380401914, 0.08731742166657402, 0.14605760417180136, 0.17275049458244626, 0.024008126996870324, 0.10070563793388745, -0.23373736152742905, 0.08237649898298761, 0.04056929614373737] |
1,802.08078 | Distributions of countable models of quite o-minimal Ehrenfeucht
theories | We describe Rudin-Keisler preorders and distribution functions of numbers of
limit models for quite o-minimal Ehrenfeucht theories. Decomposition formulas
for these distributions are found.
| math.LO | we describe rudinkeisler preorders and distribution functions of numbers of limit models for quite ominimal ehrenfeucht theories decomposition formulas for these distributions are found | [['we', 'describe', 'rudinkeisler', 'preorders', 'and', 'distribution', 'functions', 'of', 'numbers', 'of', 'limit', 'models', 'for', 'quite', 'ominimal', 'ehrenfeucht', 'theories', 'decomposition', 'formulas', 'for', 'these', 'distributions', 'are', 'found']] | [-0.1398834204301238, 0.13477538297108063, -0.15497175610895889, 0.25222448601077, -0.021186213474720716, -0.08871043353186299, -0.006639785676573713, 0.37247981783002615, -0.27356130567689735, -0.2725940637368088, 0.04254884255351499, -0.2261962475410352, -0.08682368431861202, 0.2301934298981602, -0.0446575556385748, 0.06424017898583163, 0.009635182505007833, -0.038943977328017354, -0.06417818216141313, -0.22155709413345903, 0.35877557067821425, -0.10941683935622375, 0.2853980485039453, 0.017643688324217994, 0.039814277862509094, -0.04455244184161226, -0.026492205972317606, 0.01851562239850561, -0.22221136128064245, 0.11880810682972272, 0.3324973309131565, 0.2045270325616002, 0.14029118742716187, -0.41296469264974195, -0.13603589329674529, 0.13633922208100557, 0.14019239854921275, 0.03648212505504489, 0.07387552313351382, -0.2401297694304958, 0.09332042707440753, -0.20733763774236044, -0.15195276914164424, -0.21732750364268819, 0.1252600017663402, 0.12851597275584936, -0.27195146850620705, 0.040779760252917185, 0.09401183967323352, 0.11969499421926837, -0.0878321792697534, -0.2084469043960174, 0.0009832754731178284, 0.04090703961749872, 0.010097614761131505, -0.0879914066948307, 0.06928611789286758, -0.15504072975212088, -0.16873277397826314, 0.3311827938305214, -0.04485617638177549, -0.24442247999832034, 0.16500324197113514, -0.19596555239210525, -0.25415844002660987, 0.04572615011905631, 0.056603167516489826, 0.21165548398857936, -0.07149335827368002, 0.18576953198983878, -0.09832093430062135, 0.06838824925944209, 0.1691193947820769, 0.08070082458046575, 0.15249248539718488, 0.023016432610650856, -0.024388146741936605, 0.18051813822239637, 0.05515431659296155, -0.1284570205413426, -0.31499033359189826, -0.0681839669123292, -0.07160018150655863, 0.020143638723917928, -0.15156175927586446, -0.2657126223978897, 0.30687387927901, 0.1323746839091958, 0.12271058295542996, 0.25504391729676473, 0.14860172721091658, 0.13144362329815826, 0.03681167517788708, 0.049614758492680266, 0.07917642461446424, 0.27186067930112284, -0.017497729471263785, -0.01636377559043467, 0.07084515182456623, 0.19128881565605602] |
1,802.08079 | Frame-dragging effect in the field of non rotating body due to unit
gravimagnetic moment | Nonminimal spin-gravity interaction through unit gravimagnetic moment leads
to modified Mathisson-Papapetrou-Tulczyjew-Dixon equations with improved
behavior in the ultrarelativistic limit. We present exact Hamiltonian of the
resulting theory and compute an effective $\frac{1}{c^2}$\,-Hamiltonian and
leading post-Newtonian corrections to the trajectory and spin. Gravimagnetic
moment causes the same precession of spin ${\bf S}$ as a fictitious rotation of
the central body with angular momentum ${\bf J}=\frac{M}{m}{\bf S}$. So the
modified equations imply a number of qualitatively new effects, that could be
used to test experimentally, whether a rotating body in general relativity has
null or unit gravimagnetic moment.
| gr-qc hep-th | nonminimal spingravity interaction through unit gravimagnetic moment leads to modified mathissonpapapetroutulczyjewdixon equations with improved behavior in the ultrarelativistic limit we present exact hamiltonian of the resulting theory and compute an effective frac1c2hamiltonian and leading postnewtonian corrections to the trajectory and spin gravimagnetic moment causes the same precession of spin bf s as a fictitious rotation of the central body with angular momentum bf jfracmmbf s so the modified equations imply a number of qualitatively new effects that could be used to test experimentally whether a rotating body in general relativity has null or unit gravimagnetic moment | [['nonminimal', 'spingravity', 'interaction', 'through', 'unit', 'gravimagnetic', 'moment', 'leads', 'to', 'modified', 'mathissonpapapetroutulczyjewdixon', 'equations', 'with', 'improved', 'behavior', 'in', 'the', 'ultrarelativistic', 'limit', 'we', 'present', 'exact', 'hamiltonian', 'of', 'the', 'resulting', 'theory', 'and', 'compute', 'an', 'effective', 'frac1c2hamiltonian', 'and', 'leading', 'postnewtonian', 'corrections', 'to', 'the', 'trajectory', 'and', 'spin', 'gravimagnetic', 'moment', 'causes', 'the', 'same', 'precession', 'of', 'spin', 'bf', 's', 'as', 'a', 'fictitious', 'rotation', 'of', 'the', 'central', 'body', 'with', 'angular', 'momentum', 'bf', 'jfracmmbf', 's', 'so', 'the', 'modified', 'equations', 'imply', 'a', 'number', 'of', 'qualitatively', 'new', 'effects', 'that', 'could', 'be', 'used', 'to', 'test', 'experimentally', 'whether', 'a', 'rotating', 'body', 'in', 'general', 'relativity', 'has', 'null', 'or', 'unit', 'gravimagnetic', 'moment']] | [-0.17836761836735335, 0.15651685437525034, -0.08939342022417708, 0.06619420479933553, -0.10934110447526613, -0.1137879219827579, -0.022064108310510068, 0.2605841657533211, -0.23709194495917318, -0.30675707840697564, -0.009219328830751808, -0.2616582484519545, -0.0796670305884463, 0.1561441025562786, -0.025262952356183147, 0.041860948232537575, 0.03147239855891886, 0.07526067756314544, -0.10808083898278865, -0.1797088720152115, 0.2669283263732065, 0.07110042803663205, 0.194965875826459, 0.034678845626718184, 0.13623894483564383, 0.027177707980723775, 0.07194334315136075, 0.05752101483100906, -0.12613120402416594, 0.06799478001615152, 0.15052308296807052, 0.03514286237669752, 0.171785131948901, -0.46407963573298555, -0.16810564890979451, 0.0515072341225645, 0.12996967378607455, 0.1520275991766694, -0.04493984792188325, -0.2607523098964482, 0.01870705197228396, -0.22532193498448172, -0.20834709468119322, -0.10957357274526928, 0.0947838805298856, 0.014846583261114961, -0.3097303342074156, 0.11291647748866841, 0.10274121775093706, 0.01253167127179814, -0.07124346362902446, -0.08923895614211784, -0.038604763395925785, 0.06487378497617914, 0.14802401162624518, 0.11813607881281604, 0.11912469846751303, -0.08061596267717949, -0.11339924991269537, 0.42028359193949305, -0.12106223533455124, -0.2753133886949496, 0.12495061378440563, -0.21803870594049704, -0.09055429064926315, 0.10256151652627407, 0.19906930576891024, 0.15546618492597655, -0.16098189971687155, 0.12324984226328757, -0.0010620298934109667, 0.13664808819080365, 0.08093132556198125, -0.01397797741439253, 0.29390364396881236, 0.06576847171341564, 0.02264635396645741, 0.11671896435771177, -0.12052245405898925, -0.13295627977857563, -0.31494008880504903, -0.12101959244798909, -0.1669865518367473, 0.11508129108102715, -0.10713224847596065, -0.155541661700749, 0.3529857977570847, 0.15369153835010677, 0.14552147832124473, 0.01150270830344488, 0.24478230631335618, 0.14160864637604856, 0.07068559693846296, 0.09103903422092503, 0.2943935985875098, 0.18024996413472802, 0.0699843862193062, -0.311430747917992, 0.010631587742728757, 0.10285465556513915] |
1,802.0808 | Classification of Breast Cancer Histology using Deep Learning | Breast Cancer is a major cause of death worldwide among women. Hematoxylin
and Eosin (H&E) stained breast tissue samples from biopsies are observed under
microscopes for the primary diagnosis of breast cancer. In this paper, we
propose a deep learning-based method for classification of H&E stained breast
tissue images released for BACH challenge 2018 by fine-tuning Inception-v3
convolutional neural network (CNN) proposed by Szegedy et al. These images are
to be classified into four classes namely, i) normal tissue, ii) benign tumor,
iii) in-situ carcinoma and iv) invasive carcinoma. Our strategy is to extract
patches based on nuclei density instead of random or grid sampling, along with
rejection of patches that are not rich in nuclei (non-epithelial) regions for
training and testing. Every patch (nuclei-dense region) in an image is
classified in one of the four above mentioned categories. The class of the
entire image is determined using majority voting over the nuclear classes. We
obtained an average four class accuracy of 85% and an average two class
(non-cancer vs. carcinoma) accuracy of 93%, which improves upon a previous
benchmark by Araujo et al.
| cs.CV | breast cancer is a major cause of death worldwide among women hematoxylin and eosin he stained breast tissue samples from biopsies are observed under microscopes for the primary diagnosis of breast cancer in this paper we propose a deep learningbased method for classification of he stained breast tissue images released for bach challenge 2018 by finetuning inceptionv3 convolutional neural network cnn proposed by szegedy et al these images are to be classified into four classes namely i normal tissue ii benign tumor iii insitu carcinoma and iv invasive carcinoma our strategy is to extract patches based on nuclei density instead of random or grid sampling along with rejection of patches that are not rich in nuclei nonepithelial regions for training and testing every patch nucleidense region in an image is classified in one of the four above mentioned categories the class of the entire image is determined using majority voting over the nuclear classes we obtained an average four class accuracy of 85 and an average two class noncancer vs carcinoma accuracy of 93 which improves upon a previous benchmark by araujo et al | [['breast', 'cancer', 'is', 'a', 'major', 'cause', 'of', 'death', 'worldwide', 'among', 'women', 'hematoxylin', 'and', 'eosin', 'he', 'stained', 'breast', 'tissue', 'samples', 'from', 'biopsies', 'are', 'observed', 'under', 'microscopes', 'for', 'the', 'primary', 'diagnosis', 'of', 'breast', 'cancer', 'in', 'this', 'paper', 'we', 'propose', 'a', 'deep', 'learningbased', 'method', 'for', 'classification', 'of', 'he', 'stained', 'breast', 'tissue', 'images', 'released', 'for', 'bach', 'challenge', '2018', 'by', 'finetuning', 'inceptionv3', 'convolutional', 'neural', 'network', 'cnn', 'proposed', 'by', 'szegedy', 'et', 'al', 'these', 'images', 'are', 'to', 'be', 'classified', 'into', 'four', 'classes', 'namely', 'i', 'normal', 'tissue', 'ii', 'benign', 'tumor', 'iii', 'insitu', 'carcinoma', 'and', 'iv', 'invasive', 'carcinoma', 'our', 'strategy', 'is', 'to', 'extract', 'patches', 'based', 'on', 'nuclei', 'density', 'instead', 'of', 'random', 'or', 'grid', 'sampling', 'along', 'with', 'rejection', 'of', 'patches', 'that', 'are', 'not', 'rich', 'in', 'nuclei', 'nonepithelial', 'regions', 'for', 'training', 'and', 'testing', 'every', 'patch', 'nucleidense', 'region', 'in', 'an', 'image', 'is', 'classified', 'in', 'one', 'of', 'the', 'four', 'above', 'mentioned', 'categories', 'the', 'class', 'of', 'the', 'entire', 'image', 'is', 'determined', 'using', 'majority', 'voting', 'over', 'the', 'nuclear', 'classes', 'we', 'obtained', 'an', 'average', 'four', 'class', 'accuracy', 'of', '85', 'and', 'an', 'average', 'two', 'class', 'noncancer', 'vs', 'carcinoma', 'accuracy', 'of', '93', 'which', 'improves', 'upon', 'a', 'previous', 'benchmark', 'by', 'araujo', 'et', 'al']] | [0.02962641390603404, 0.028909635614551947, 0.02538689994509076, 0.03671042721671856, -0.012826999055815268, -0.17832004384567532, 0.04344865891143455, 0.40163601254839654, -0.14298978831189182, -0.3301225761616869, 0.06637994230054524, -0.31455055511669144, -0.17139762749058798, 0.2079372870595742, -0.1927075629971044, 0.011792624327686749, 0.07697338476562156, -0.021344226311667117, 0.034410684662461694, -0.35761366051284005, 0.2906042448088916, 0.019118729365860357, 0.363854403469384, -0.02053354724449781, 0.10375780435872282, -0.01866491547284218, -0.06583602885986872, 0.017566847849373738, -0.0646878719385563, 0.12304253055417276, 0.31522702622345067, 0.23200365978902063, 0.31319274990768226, -0.3986626833203635, -0.21833230532286177, 0.12289143099377935, 0.1553909554693766, 0.09685351444180584, -0.028470770963135043, -0.3366322711878968, 0.09629951696075335, -0.13508649490988597, -0.017179848511119956, -0.04459638580050483, 0.0242123825994965, -0.013754128017923334, -0.2867372898413073, 0.13422754472428625, 0.027502232082802187, 0.14390696707990144, -0.11182307684410281, -0.14687678407990262, -0.008075441242768787, 0.14528263812746525, -0.019343844134549888, 0.05900810705753719, 0.18288600119742293, -0.19105802166434313, -0.10881045199725982, 0.2898381171558707, 0.030514028527809735, -0.1163218093114575, 0.1792301814606577, -0.062448230295718374, -0.13610673432269102, 0.17143209342611954, 0.16180472783130276, 0.1270941707675325, -0.19029333837749948, -0.03909634273872803, -0.03733811682380562, 0.1550987193790766, 0.13603647751477801, -0.10371182704661655, 0.13345517959716924, 0.23181498468505565, -0.05211729088102232, 0.09816327371959482, -0.23018003485017138, 0.02605938794958702, -0.2141933369547497, -0.16437270994052536, -0.1118770590778645, 0.0014100455331832304, -0.07549914310316576, -0.1872324823852178, 0.4205422474705911, 0.09902568612309111, 0.18279572996339033, 0.05359749702396444, 0.249861252514625, -0.06010365466380001, 0.11889997393066822, 0.03296511418667141, 0.2050605454343975, 0.04961996382693402, 0.06987390590378768, -0.1856854716738031, 0.10555484590304831, 0.10330582659686455] |
1,802.08081 | Statistics of finite scale local Lyapunov exponents in fully developed
homogeneous isotropic turbulence | The present work analyzes the statistics of finite scale local Lyapunov
exponents of pairs of fluid particles trajectories in fully developed
incompressible homogeneous isotropic turbulence. According to the hypothesis of
fully developed chaos, this statistics is here analyzed assuming that the
entropy associated to the fluid kinematic state is maximum. The distribution of
the local Lyapunov exponents results to be an unsymmetrical uniform function in
a proper interval of variation. From this PDF, we determine the relationship
between average and maximum Lyapunov exponents, and the longitudinal velocity
correlation function. This link, which in turn leads to the closure of von
K\`arm\`an-Howarth and Corrsin equations, agrees with results of previous
works, supporting the proposed PDF calculation, at least for the purposes of
the energy cascade main effect estimation. Furthermore, through the property
that the Lyapunov vectors tend to align the direction of the maximum growth
rate of trajectories distance, we obtain the link between maximum and average
Lyapunov exponents in line with the previous results. To validate the proposed
theoretical results, we present different numerical simulations whose results
justify the hypotheses of the present analysis.
| physics.flu-dyn physics.class-ph | the present work analyzes the statistics of finite scale local lyapunov exponents of pairs of fluid particles trajectories in fully developed incompressible homogeneous isotropic turbulence according to the hypothesis of fully developed chaos this statistics is here analyzed assuming that the entropy associated to the fluid kinematic state is maximum the distribution of the local lyapunov exponents results to be an unsymmetrical uniform function in a proper interval of variation from this pdf we determine the relationship between average and maximum lyapunov exponents and the longitudinal velocity correlation function this link which in turn leads to the closure of von karmanhowarth and corrsin equations agrees with results of previous works supporting the proposed pdf calculation at least for the purposes of the energy cascade main effect estimation furthermore through the property that the lyapunov vectors tend to align the direction of the maximum growth rate of trajectories distance we obtain the link between maximum and average lyapunov exponents in line with the previous results to validate the proposed theoretical results we present different numerical simulations whose results justify the hypotheses of the present analysis | [['the', 'present', 'work', 'analyzes', 'the', 'statistics', 'of', 'finite', 'scale', 'local', 'lyapunov', 'exponents', 'of', 'pairs', 'of', 'fluid', 'particles', 'trajectories', 'in', 'fully', 'developed', 'incompressible', 'homogeneous', 'isotropic', 'turbulence', 'according', 'to', 'the', 'hypothesis', 'of', 'fully', 'developed', 'chaos', 'this', 'statistics', 'is', 'here', 'analyzed', 'assuming', 'that', 'the', 'entropy', 'associated', 'to', 'the', 'fluid', 'kinematic', 'state', 'is', 'maximum', 'the', 'distribution', 'of', 'the', 'local', 'lyapunov', 'exponents', 'results', 'to', 'be', 'an', 'unsymmetrical', 'uniform', 'function', 'in', 'a', 'proper', 'interval', 'of', 'variation', 'from', 'this', 'pdf', 'we', 'determine', 'the', 'relationship', 'between', 'average', 'and', 'maximum', 'lyapunov', 'exponents', 'and', 'the', 'longitudinal', 'velocity', 'correlation', 'function', 'this', 'link', 'which', 'in', 'turn', 'leads', 'to', 'the', 'closure', 'of', 'von', 'karmanhowarth', 'and', 'corrsin', 'equations', 'agrees', 'with', 'results', 'of', 'previous', 'works', 'supporting', 'the', 'proposed', 'pdf', 'calculation', 'at', 'least', 'for', 'the', 'purposes', 'of', 'the', 'energy', 'cascade', 'main', 'effect', 'estimation', 'furthermore', 'through', 'the', 'property', 'that', 'the', 'lyapunov', 'vectors', 'tend', 'to', 'align', 'the', 'direction', 'of', 'the', 'maximum', 'growth', 'rate', 'of', 'trajectories', 'distance', 'we', 'obtain', 'the', 'link', 'between', 'maximum', 'and', 'average', 'lyapunov', 'exponents', 'in', 'line', 'with', 'the', 'previous', 'results', 'to', 'validate', 'the', 'proposed', 'theoretical', 'results', 'we', 'present', 'different', 'numerical', 'simulations', 'whose', 'results', 'justify', 'the', 'hypotheses', 'of', 'the', 'present', 'analysis']] | [-0.1459769830107689, 0.097231363031824, -0.1522017700759613, 0.0463039728195366, -0.02921366592636332, -0.07672698459361488, 0.03465581509922429, 0.3100885330375446, -0.2707189527914718, -0.25414030176066066, 0.06787611531225317, -0.266031265548562, -0.11605922966365419, 0.18482053283925937, -0.01120046419142138, 0.11882003887212308, 0.03654446884351985, 0.025361081939595548, -0.0755515712890369, -0.2133857386589111, 0.32933559950754937, 0.08685563121031484, 0.33157057751795155, 0.0411026796361472, 0.08761131580736813, -0.012123171114818315, -0.07114535555466199, 0.05417961770197745, -0.22527391712332168, 0.10977022414115946, 0.19934214803177622, 0.09505689834021842, 0.2553146404477403, -0.3730502953631398, -0.2013235691651378, 0.09154774059045492, 0.14583006270518323, 0.06766633184325536, 0.006487882397461521, -0.2501397661399096, 0.11633079330204055, -0.15585141656312929, -0.16425677462551824, -0.025952490636289283, 0.021758974676903683, 0.07764575911120197, -0.28484934064782347, 0.15174185332928217, 0.05419139736256076, 0.08117413345177699, -0.08887906221460308, -0.08466986859338763, -0.02745450533794887, 0.13271468929989447, 0.08659408274821623, 0.016977544198237847, 0.1106283197295852, -0.08416311086393366, -0.12609316393924097, 0.30593907140681276, -0.06177350189524156, -0.23060468010574012, 0.18252927033007954, -0.17712645880174419, -0.09127590747622256, 0.12990322202676907, 0.16463848729187663, 0.07819888496811947, -0.13365615819297408, 0.025513091734509268, -0.054568746861110885, 0.16395881393818063, 0.017204199486118538, -0.017437573237617944, 0.1396367590717526, 0.09773483722592177, 0.0702840905363226, 0.1324765811321255, -0.09928135481269514, -0.14412894538026708, -0.3274551402605341, -0.16001391499910667, -0.20540848903803396, 0.0134866196597653, -0.11817322015659833, -0.16431270730580486, 0.40597405296284705, 0.16923391822665904, 0.20745362632663708, 0.1403777585611628, 0.2813598242507357, 0.1433608737526178, 0.00229423537435334, 0.10379914659500608, 0.2666606139847199, 0.17784655799977886, 0.0912577674860823, -0.24259745295579627, 0.08244036419985248, 0.10380048700734852] |
1,802.08082 | A gradient flow approach to relaxation rates for the multi-dimensional
Cahn-Hilliard equation | The aim of this paper is to study relaxation rates for the Cahn-Hilliard
equation in dimension larger than one. We follow the approach of Otto and
Westdickenberg based on the gradient flow structure of the equation and
establish differential and algebraic relationships between the energy, the
dissipation, and the squared $H^{--1}$ distance to a kink. This leads to a
scale separation of the dynamics into two different stages: a first fast phase
of the order $t^{ -- 1/2}$ where one sees convergence to some kink, followed by
a slow relaxation phase with rate $t^{-- 1/ 4}$ where convergence to the
centered kink is observed.
| math.AP | the aim of this paper is to study relaxation rates for the cahnhilliard equation in dimension larger than one we follow the approach of otto and westdickenberg based on the gradient flow structure of the equation and establish differential and algebraic relationships between the energy the dissipation and the squared h1 distance to a kink this leads to a scale separation of the dynamics into two different stages a first fast phase of the order t 12 where one sees convergence to some kink followed by a slow relaxation phase with rate t 1 4 where convergence to the centered kink is observed | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'study', 'relaxation', 'rates', 'for', 'the', 'cahnhilliard', 'equation', 'in', 'dimension', 'larger', 'than', 'one', 'we', 'follow', 'the', 'approach', 'of', 'otto', 'and', 'westdickenberg', 'based', 'on', 'the', 'gradient', 'flow', 'structure', 'of', 'the', 'equation', 'and', 'establish', 'differential', 'and', 'algebraic', 'relationships', 'between', 'the', 'energy', 'the', 'dissipation', 'and', 'the', 'squared', 'h1', 'distance', 'to', 'a', 'kink', 'this', 'leads', 'to', 'a', 'scale', 'separation', 'of', 'the', 'dynamics', 'into', 'two', 'different', 'stages', 'a', 'first', 'fast', 'phase', 'of', 'the', 'order', 't', '12', 'where', 'one', 'sees', 'convergence', 'to', 'some', 'kink', 'followed', 'by', 'a', 'slow', 'relaxation', 'phase', 'with', 'rate', 't', '1', '4', 'where', 'convergence', 'to', 'the', 'centered', 'kink', 'is', 'observed']] | [-0.14423267515172766, 0.12172109814523493, -0.10029168429251001, 0.05848240652076394, -0.05290626347046888, -0.10981108033261036, 0.018501474293744536, 0.29685086261444876, -0.3144968177725389, -0.27955583529998956, 0.11745135476970955, -0.2703437536900628, -0.10031742198410833, 0.16506483811134634, 0.015452110375847343, 0.04187814884104775, 0.0061578298602434035, 0.060653054747658156, -0.09809888181394165, -0.22020473879382232, 0.32741074473823156, 0.02782161087159393, 0.24375757363340048, 0.016736051754899395, 0.1274789111435558, -0.04332904195982638, 0.018726145016770918, -0.008337881054403713, -0.18407259627417163, 0.10215996380768788, 0.17245288466745354, 0.05768528045155108, 0.3091233514669776, -0.4077957992270155, -0.17949064049725105, 0.06412251412843635, 0.1526617611423858, 0.08391111953075504, -0.020627249200665616, -0.21727367077086085, 0.0921316672369693, -0.09929422166162324, -0.11686905096420674, -0.01094392527943676, 0.035159460621551404, 0.0321022067467673, -0.2787824346603672, 0.14414945178782768, 0.0980347658222704, 0.025728920863453044, -0.0659770180055311, -0.06479384350585887, -0.018227610194567336, 0.08703620347886085, 0.08733609715449506, 0.08528776942679966, 0.07287093930543193, -0.09461977688179722, -0.07437360015679693, 0.347588394782099, -0.10491717914619497, -0.16096425070924666, 0.2024669595519352, -0.1905451610874276, -0.07853895063213642, 0.15342538895139707, 0.18311775825212448, 0.14217600791073107, -0.13936182824517285, 0.03131848396236095, 0.06274650194761298, 0.17586573585867882, 0.0681287397277876, -0.011335931618887823, 0.1030767477090353, 0.22090807125804204, 0.09663166357565997, 0.13527036829878694, -0.1117888183256123, -0.14808337146289718, -0.31292905960033096, -0.17379577989233386, -0.14636411883153963, 0.06463308528165143, -0.10543062090274688, -0.12088771577635148, 0.4149012990133132, 0.11000433768534544, 0.26064164893141073, 0.06585526712989272, 0.26250008388775065, 0.1448508395442685, 0.029340588067233272, 0.1201495113692165, 0.22712760427384637, 0.16877073540750132, 0.14267117479020386, -0.2850642079528132, 0.021338100631007002, 0.13366361531130608] |
1,802.08083 | Applications of Optimal Control of a Nonconvex Sweeping Process to
Optimization of the Planar Crowd Motion Model | This paper concerns optimal control of a nonconvex perturbed sweeping process
and its applications to optimization of the planar crowd motion model of
traffic equilibria. The obtained theoretical results allow us to investigate a
dynamic optimization problem for the microscopic planar crown motion model with
finitely many participants and completely solve it analytically in the case of
two participants.
| math.OC | this paper concerns optimal control of a nonconvex perturbed sweeping process and its applications to optimization of the planar crowd motion model of traffic equilibria the obtained theoretical results allow us to investigate a dynamic optimization problem for the microscopic planar crown motion model with finitely many participants and completely solve it analytically in the case of two participants | [['this', 'paper', 'concerns', 'optimal', 'control', 'of', 'a', 'nonconvex', 'perturbed', 'sweeping', 'process', 'and', 'its', 'applications', 'to', 'optimization', 'of', 'the', 'planar', 'crowd', 'motion', 'model', 'of', 'traffic', 'equilibria', 'the', 'obtained', 'theoretical', 'results', 'allow', 'us', 'to', 'investigate', 'a', 'dynamic', 'optimization', 'problem', 'for', 'the', 'microscopic', 'planar', 'crown', 'motion', 'model', 'with', 'finitely', 'many', 'participants', 'and', 'completely', 'solve', 'it', 'analytically', 'in', 'the', 'case', 'of', 'two', 'participants']] | [-0.11264513650814355, 0.02885871106695573, -0.09603325639835607, 0.032408269227960126, -0.09925677352663824, -0.15374031052845766, 0.04919868692069046, 0.3704358675217224, -0.3478950994973213, -0.33030625368010696, 0.11109640169296793, -0.24282114884729292, -0.1795271954724123, 0.18002810448376558, -0.12526447988920292, 0.15570459907807377, 0.09970207853337466, 0.002382351697217357, 0.03470753722082255, -0.2569569869882474, 0.2656652990460269, -0.026037439293528006, 0.25951754575263775, 0.05814864815575844, 0.13322664512384494, 0.038641570349050275, 0.017114632131563404, 0.07029698415012178, -0.15148716512672855, 0.15790272584398105, 0.28383627698077996, 0.11728484672888861, 0.31879311972060953, -0.44087652641080194, -0.20048805885016918, 0.11179848484126693, 0.1325272143329099, 0.09186852199293799, -0.029109575896192404, -0.2691100264812614, 0.058737112840605996, -0.16709965356167847, -0.15600124315627045, -0.038870923142185654, -0.001241175023744167, 0.01602438672729847, -0.3071230987907719, 0.0481949812748422, 0.07273724702013246, 0.024414968061245094, -0.11299198402005042, -0.03290375988235918, 0.048778536508522805, 0.1761488587421886, 0.07264036996756489, -0.04012029160256103, 0.15208817229180013, -0.15672485049324647, -0.17679551345596123, 0.40218300877486246, 0.058780481040446184, -0.24344596601391244, 0.17950922890834636, -0.10615355906597639, -0.13083596398138395, 0.16326435462776887, 0.24706601072102785, 0.17973073532457573, -0.20061754883598473, 0.06934454648605531, -0.0842948084049937, 0.10208613763294988, 0.05427179935435623, -0.08447704551804622, 0.14501169255255894, 0.17157309698098797, 0.13756402310327295, 0.17800053248134584, 0.004415152231389183, -0.18519529328539464, -0.24249750786161017, -0.078421235984286, -0.12403216670756623, 0.018783068659289155, -0.07817520459243728, -0.17229720717296004, 0.4425100543046907, 0.1848702763949158, 0.15225823796591012, 0.05661975548176442, 0.3079220307201652, 0.09342479020735975, -0.05129070827338876, 0.08782376081414395, 0.21865708782669094, 0.12597544829092794, 0.14448356158021142, -0.25214289332013895, 0.040413140279824955, 0.045162459614418324] |
1,802.08084 | Jarzynski Equality and its Special Trajectory Ensemble Average
Demystified | The special trajectory ensemble average (TEA), denoted by a subscript 0, in
the Jarzynski Equality (JE) results in the Jensen inequality <R>_0 GT-EQ
delta(F) for the work R done on the system, and not the thermodynamic work
inequality <R> GT-EQ delta(F) since we find <R> NEQ <R>_0. Therefore, contrary
to the common belief, the Jensen inequality does not directly support the JE as
a nonequilibrium result. Jarzynski's microscopic treatment of the inclusive
energy considers only the external work d_eE_k but neglects the ubiquitous
change d_iE_k due to external-internal force imbalance, though d_iE_k's are
present even in a reversible process as we show. Because of this neglect, no
thermodynamic force necessary for dissipation is allowed. Thus the JE has no
built-in irreversibility, despite a time-dependent work protocol. We support
our claim by an explicit calculation, which shows that <R>_0 > delta(F) even
for a reversible process for which <R> = delta(F). This also confirms that <R>
and <R>_0 are different averages.
| cond-mat.stat-mech | the special trajectory ensemble average tea denoted by a subscript 0 in the jarzynski equality je results in the jensen inequality r_0 gteq deltaf for the work r done on the system and not the thermodynamic work inequality r gteq deltaf since we find r neq r_0 therefore contrary to the common belief the jensen inequality does not directly support the je as a nonequilibrium result jarzynskis microscopic treatment of the inclusive energy considers only the external work d_ee_k but neglects the ubiquitous change d_ie_k due to externalinternal force imbalance though d_ie_ks are present even in a reversible process as we show because of this neglect no thermodynamic force necessary for dissipation is allowed thus the je has no builtin irreversibility despite a timedependent work protocol we support our claim by an explicit calculation which shows that r_0 deltaf even for a reversible process for which r deltaf this also confirms that r and r_0 are different averages | [['the', 'special', 'trajectory', 'ensemble', 'average', 'tea', 'denoted', 'by', 'a', 'subscript', '0', 'in', 'the', 'jarzynski', 'equality', 'je', 'results', 'in', 'the', 'jensen', 'inequality', 'r_0', 'gteq', 'deltaf', 'for', 'the', 'work', 'r', 'done', 'on', 'the', 'system', 'and', 'not', 'the', 'thermodynamic', 'work', 'inequality', 'r', 'gteq', 'deltaf', 'since', 'we', 'find', 'r', 'neq', 'r_0', 'therefore', 'contrary', 'to', 'the', 'common', 'belief', 'the', 'jensen', 'inequality', 'does', 'not', 'directly', 'support', 'the', 'je', 'as', 'a', 'nonequilibrium', 'result', 'jarzynskis', 'microscopic', 'treatment', 'of', 'the', 'inclusive', 'energy', 'considers', 'only', 'the', 'external', 'work', 'd_ee_k', 'but', 'neglects', 'the', 'ubiquitous', 'change', 'd_ie_k', 'due', 'to', 'externalinternal', 'force', 'imbalance', 'though', 'd_ie_ks', 'are', 'present', 'even', 'in', 'a', 'reversible', 'process', 'as', 'we', 'show', 'because', 'of', 'this', 'neglect', 'no', 'thermodynamic', 'force', 'necessary', 'for', 'dissipation', 'is', 'allowed', 'thus', 'the', 'je', 'has', 'no', 'builtin', 'irreversibility', 'despite', 'a', 'timedependent', 'work', 'protocol', 'we', 'support', 'our', 'claim', 'by', 'an', 'explicit', 'calculation', 'which', 'shows', 'that', 'r_0', 'deltaf', 'even', 'for', 'a', 'reversible', 'process', 'for', 'which', 'r', 'deltaf', 'this', 'also', 'confirms', 'that', 'r', 'and', 'r_0', 'are', 'different', 'averages']] | [-0.14254630000172244, 0.09877337651790251, -0.0841966059570219, 0.06404442136839136, -0.01894781160095305, -0.18313916890388904, 0.0756643729914418, 0.3046104274446668, -0.2441150887437116, -0.2550669680501706, 0.02731919047358793, -0.24052069518027303, -0.11879653061186177, 0.20797524453305147, -0.08151242292175691, 0.03346601433692853, 0.03950009163959086, 0.04451360678744618, -0.02780405630348433, -0.1951197740831869, 0.2678967404447106, 0.06880739087458043, 0.25786324638532465, 0.11288978854723859, 0.037771896583947286, 0.0428139825893286, -0.013630161214059864, 0.05436029658710669, -0.16988453209703389, 0.031149159821687766, 0.21508551744464177, 0.12149982400135034, 0.2968369176355647, -0.3996153465636513, -0.21958854338580291, 0.12738322698529445, 0.1351643640112765, 0.09157585857429974, -0.001677205162944601, -0.18729642619762352, 0.06445485531668989, -0.18192487896200926, -0.13146500578880602, -0.07073246916829079, 0.08792574535081395, 0.007434560819163772, -0.31027153495613946, 0.14289448433536642, 0.16098014250994216, 0.10524455978979472, -0.03798291429396402, -0.10758044241297551, -0.010222521501751555, 0.042863614213488554, 0.061267886827075915, 0.08283986078858302, 0.15770776696150113, -0.06696310386463415, -0.0563087418943254, 0.33152306055668374, -0.025111390924495127, -0.19139162225807024, 0.13670370553687117, -0.13347089536841106, -0.16275249377160875, 0.06015326789796377, 0.05295398365630117, 0.11485609114839652, -0.16953259472753487, 0.13529560122459372, -0.04646654500781248, 0.17942163273022552, 0.08133325142956345, -0.022655374859003166, 0.12225097271741606, 0.04495924294871442, 0.053677886800560494, 0.08940786820093742, -0.0242147873219687, -0.11186945559441727, -0.35043560998404727, -0.1933120033377325, -0.22565993411143864, 0.10677337509772461, -0.0681370065326489, -0.1348983943355848, 0.3097328188269113, 0.17353837980943568, 0.1587916434197717, 0.07727202773855062, 0.2887477889121358, 0.10601053729552921, 0.042959108547721475, 0.11133291544027481, 0.24988392174390017, 0.1371514990384039, 0.12497155093192275, -0.23138693532011673, 0.10867771456395489, 0.03902358589146067] |
1,802.08085 | Precursors of gate oxide degradation in SiC power MOSFETs | Gate oxide degradation is more critical in Silicon-Carbide (SiC) MOSFETs than
in Silicon (Si) MOSFETs. This is because of the smaller gate oxide thickness
and the higher electric field that develops across the gate oxide in SiC
MOSFETs. While multiple precursors have been identified for monitoring the gate
oxide degradation in Si MOSFETs, very few precursors have been identified for
SiC MOSFETs. The purpose of this paper is to demonstrate that gate oxide
degradation precursors used in Si MOSFETs: a) threshold voltage, b) gate
plateau voltage and c) gate plateau time, can also be used as precursors for
SiC MOSFETS. Moreover, all three precursors are found to exhibit a simultaneous
increasing trend (during the stress time) leading to an increase in on-state
loss, switching loss and switching time of the SiC MOSFET. The existing studies
of gate oxide degradation mechanisms in SiC MOSFETs, and their effects on
threshold voltage and mobility were extended to correlate a variation of all
three precursors using analytical expressions. The increasing trends of
precursors were experimentally confirmed by inducing gate oxide degradation in
commercial SiC MOSFET samples.
| physics.gen-ph | gate oxide degradation is more critical in siliconcarbide sic mosfets than in silicon si mosfets this is because of the smaller gate oxide thickness and the higher electric field that develops across the gate oxide in sic mosfets while multiple precursors have been identified for monitoring the gate oxide degradation in si mosfets very few precursors have been identified for sic mosfets the purpose of this paper is to demonstrate that gate oxide degradation precursors used in si mosfets a threshold voltage b gate plateau voltage and c gate plateau time can also be used as precursors for sic mosfets moreover all three precursors are found to exhibit a simultaneous increasing trend during the stress time leading to an increase in onstate loss switching loss and switching time of the sic mosfet the existing studies of gate oxide degradation mechanisms in sic mosfets and their effects on threshold voltage and mobility were extended to correlate a variation of all three precursors using analytical expressions the increasing trends of precursors were experimentally confirmed by inducing gate oxide degradation in commercial sic mosfet samples | [['gate', 'oxide', 'degradation', 'is', 'more', 'critical', 'in', 'siliconcarbide', 'sic', 'mosfets', 'than', 'in', 'silicon', 'si', 'mosfets', 'this', 'is', 'because', 'of', 'the', 'smaller', 'gate', 'oxide', 'thickness', 'and', 'the', 'higher', 'electric', 'field', 'that', 'develops', 'across', 'the', 'gate', 'oxide', 'in', 'sic', 'mosfets', 'while', 'multiple', 'precursors', 'have', 'been', 'identified', 'for', 'monitoring', 'the', 'gate', 'oxide', 'degradation', 'in', 'si', 'mosfets', 'very', 'few', 'precursors', 'have', 'been', 'identified', 'for', 'sic', 'mosfets', 'the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'demonstrate', 'that', 'gate', 'oxide', 'degradation', 'precursors', 'used', 'in', 'si', 'mosfets', 'a', 'threshold', 'voltage', 'b', 'gate', 'plateau', 'voltage', 'and', 'c', 'gate', 'plateau', 'time', 'can', 'also', 'be', 'used', 'as', 'precursors', 'for', 'sic', 'mosfets', 'moreover', 'all', 'three', 'precursors', 'are', 'found', 'to', 'exhibit', 'a', 'simultaneous', 'increasing', 'trend', 'during', 'the', 'stress', 'time', 'leading', 'to', 'an', 'increase', 'in', 'onstate', 'loss', 'switching', 'loss', 'and', 'switching', 'time', 'of', 'the', 'sic', 'mosfet', 'the', 'existing', 'studies', 'of', 'gate', 'oxide', 'degradation', 'mechanisms', 'in', 'sic', 'mosfets', 'and', 'their', 'effects', 'on', 'threshold', 'voltage', 'and', 'mobility', 'were', 'extended', 'to', 'correlate', 'a', 'variation', 'of', 'all', 'three', 'precursors', 'using', 'analytical', 'expressions', 'the', 'increasing', 'trends', 'of', 'precursors', 'were', 'experimentally', 'confirmed', 'by', 'inducing', 'gate', 'oxide', 'degradation', 'in', 'commercial', 'sic', 'mosfet', 'samples']] | [-0.13904044825959808, 0.10907720647322763, 0.03259221222226068, -0.01628404216787133, 0.07273392380819052, -0.26038572199611953, 0.09381333590743572, 0.5058979161677288, -0.18541793919240052, -0.3284102603486115, 0.07263797413619173, -0.26869120625881376, -0.15882971169488444, 0.23403786674556373, -0.0648430545179808, 0.04196764466322058, -0.01988262562644105, -0.1424383509080284, -0.10964968996595817, -0.27646058870499934, 0.15352614491072658, 0.0938674638426484, 0.36330932327085635, 0.11791126631650624, -0.005785448016128042, -0.12161959543987945, 0.12089635692485659, 0.015852841722604993, -0.06790400889568136, 0.00471317663578992, 0.2974063898219246, -0.04659836473721233, 0.22182656135819442, -0.5336464202737661, -0.2296048495425986, -0.029634584456549158, 0.13482345314152733, 0.14288451973282332, -0.11950668008209035, -0.1991074002964504, 0.16204555486431244, -0.14826912907269466, -0.0310109725073594, 0.05080313328653574, 0.028047307863304453, -0.003319479105802212, -0.2390166836788182, 0.03712400186990495, 0.02554370139474126, 0.06969554265346992, -0.055675510846712926, -0.1994702516655837, -0.07701773155009844, 0.07301247307239483, 0.003997766956492521, 0.00400775281589601, 0.2954567120164878, -0.05721301815196217, -0.1353412107206308, 0.27749216927415027, -0.04700116279631262, -0.07052639366772312, 0.15928178536193957, -0.17319612166266068, -0.012330646204485833, 0.17566305512541924, 0.13528302267729816, 0.10433775103161019, -0.21587840199296537, 0.046946179918410096, 0.11898854211776179, 0.18688973333625183, 0.15452529745084326, 0.12285680165463178, 0.19915121001355185, 0.23257738475145384, 0.044068125734146646, 0.17779990651447755, -0.14182650438985778, 0.021470805450987358, -0.20175821174884082, -0.24735438404796686, -0.16421070857265208, 0.11237088811153975, -0.08057382254524523, -0.2292861295045241, 0.40168876470588555, 0.15750772480668684, 0.10932509419968822, -0.012077855272634355, 0.26916735172834616, 0.10232156967414174, 0.18010830330492283, -0.052011164639574975, 0.24423516284838154, 0.15783582759668008, 0.12241154804104264, -0.2377655344176014, 0.2344874429086653, -0.09648865644543708] |
1,802.08086 | Neural Gas based classification of Globular Clusters | Within scientific and real life problems, classification is a typical case of
extremely complex tasks in data-driven scenarios, especially if approached with
traditional techniques. Machine Learning supervised and unsupervised paradigms,
providing self-adaptive and semi-automatic methods, are able to navigate into
large volumes of data characterized by a multi-dimensional parameter space,
thus representing an ideal method to disentangle classes of objects in a
reliable and efficient way. In Astrophysics, the identification of candidate
Globular Clusters through deep, wide-field, single band images, is one of such
cases where self-adaptive methods demonstrated a high performance and
reliability. Here we experimented some variants of the known Neural Gas model,
exploring both supervised and unsupervised paradigms of Machine Learning for
the classification of Globular Clusters. Main scope of this work was to verify
the possibility to improve the computational efficiency of the methods to solve
complex data-driven problems, by exploiting the parallel programming with GPU
framework. By using the astrophysical playground, the goal was to
scientifically validate such kind of models for further applications extended
to other contexts.
| astro-ph.IM | within scientific and real life problems classification is a typical case of extremely complex tasks in datadriven scenarios especially if approached with traditional techniques machine learning supervised and unsupervised paradigms providing selfadaptive and semiautomatic methods are able to navigate into large volumes of data characterized by a multidimensional parameter space thus representing an ideal method to disentangle classes of objects in a reliable and efficient way in astrophysics the identification of candidate globular clusters through deep widefield single band images is one of such cases where selfadaptive methods demonstrated a high performance and reliability here we experimented some variants of the known neural gas model exploring both supervised and unsupervised paradigms of machine learning for the classification of globular clusters main scope of this work was to verify the possibility to improve the computational efficiency of the methods to solve complex datadriven problems by exploiting the parallel programming with gpu framework by using the astrophysical playground the goal was to scientifically validate such kind of models for further applications extended to other contexts | [['within', 'scientific', 'and', 'real', 'life', 'problems', 'classification', 'is', 'a', 'typical', 'case', 'of', 'extremely', 'complex', 'tasks', 'in', 'datadriven', 'scenarios', 'especially', 'if', 'approached', 'with', 'traditional', 'techniques', 'machine', 'learning', 'supervised', 'and', 'unsupervised', 'paradigms', 'providing', 'selfadaptive', 'and', 'semiautomatic', 'methods', 'are', 'able', 'to', 'navigate', 'into', 'large', 'volumes', 'of', 'data', 'characterized', 'by', 'a', 'multidimensional', 'parameter', 'space', 'thus', 'representing', 'an', 'ideal', 'method', 'to', 'disentangle', 'classes', 'of', 'objects', 'in', 'a', 'reliable', 'and', 'efficient', 'way', 'in', 'astrophysics', 'the', 'identification', 'of', 'candidate', 'globular', 'clusters', 'through', 'deep', 'widefield', 'single', 'band', 'images', 'is', 'one', 'of', 'such', 'cases', 'where', 'selfadaptive', 'methods', 'demonstrated', 'a', 'high', 'performance', 'and', 'reliability', 'here', 'we', 'experimented', 'some', 'variants', 'of', 'the', 'known', 'neural', 'gas', 'model', 'exploring', 'both', 'supervised', 'and', 'unsupervised', 'paradigms', 'of', 'machine', 'learning', 'for', 'the', 'classification', 'of', 'globular', 'clusters', 'main', 'scope', 'of', 'this', 'work', 'was', 'to', 'verify', 'the', 'possibility', 'to', 'improve', 'the', 'computational', 'efficiency', 'of', 'the', 'methods', 'to', 'solve', 'complex', 'datadriven', 'problems', 'by', 'exploiting', 'the', 'parallel', 'programming', 'with', 'gpu', 'framework', 'by', 'using', 'the', 'astrophysical', 'playground', 'the', 'goal', 'was', 'to', 'scientifically', 'validate', 'such', 'kind', 'of', 'models', 'for', 'further', 'applications', 'extended', 'to', 'other', 'contexts']] | [-0.016863302484146626, 0.007229167670014885, -0.05162744350042302, 0.08567472813836692, -0.13686310844038307, -0.1645536817114994, 0.048143767502772584, 0.40930581185428394, -0.2871399583574923, -0.37188965271663116, 0.07496025064499844, -0.22482662423476146, -0.15221261784348183, 0.2636880503221808, -0.09946947446701283, 0.0943605018392033, 0.11753502571780364, -0.010051354477881868, -0.055605081599098063, -0.28886734046085033, 0.2928243336036285, 0.045528795062584504, 0.3031664470162221, 0.0015878898355399253, 0.10802017295574284, -0.039317096831180114, -0.05705319669076128, 0.01672076692356487, -0.0886747914452558, 0.17667095894814938, 0.3775730199321899, 0.20343323884198086, 0.3379150194718327, -0.3811802457522795, -0.24287300095543524, 0.10642189677667432, 0.1834606190576794, 0.0728415513378864, -0.05231951882745101, -0.32477983980805675, 0.09302152478946318, -0.15725772895021203, -0.10444485316758927, -0.15560870221950587, 0.001137457944781148, 0.0017336913131478894, -0.25474192589155337, 0.03625639526421107, 0.04261951126976509, 0.07196834100937913, -0.06922171460303096, -0.09659749744702238, 0.07737626866948914, 0.13811612791365627, 0.027662726321036932, 0.025488592342425117, 0.12364463873525187, -0.20214252029895524, -0.18478092629021045, 0.40767138238156464, 0.0006714318313695102, -0.17651432546964615, 0.2786758763290339, -0.023934171831159923, -0.19674748790078941, 0.08304654086557771, 0.2290196846901423, 0.13533898753603932, -0.18169447513178766, 0.06864293274466982, 0.024972729357982303, 0.15766183456615948, 0.010598446919469734, -0.021781689103159817, 0.21710225389503224, 0.2908615925203944, 0.01885792313916124, 0.13653223758335953, -0.111195138612536, -0.07414258053833134, -0.17433768351470805, -0.14307391854619467, -0.16779345128082299, -0.046313585834295054, -0.09272628501841577, -0.1459061595095817, 0.3682975142984247, 0.1848762343904122, 0.1546251178790433, 0.031713922201208986, 0.3625889812122406, 0.018482637745758916, 0.10854180948438683, 0.08014749749186799, 0.1895289274669088, 0.08315982322768453, 0.11859761554521718, -0.16650596642099602, 0.04282896201842265, 0.01960369295943959] |
1,802.08087 | On Quantum Cosmology in Teleparallel Gravity | A quantum cosmology in teleparallel gravity is presented in this article.
Teleparallel gravity is used to perform such an analysis once in General
Relativity (GR) the concept of gravitational energy is misleading preventing
the establishment of a concise quantum cosmology. The Wheeler-DeWitt like
equation is obtained using the Weyl quantization and the teleparallel
expression of energy.
| gr-qc | a quantum cosmology in teleparallel gravity is presented in this article teleparallel gravity is used to perform such an analysis once in general relativity gr the concept of gravitational energy is misleading preventing the establishment of a concise quantum cosmology the wheelerdewitt like equation is obtained using the weyl quantization and the teleparallel expression of energy | [['a', 'quantum', 'cosmology', 'in', 'teleparallel', 'gravity', 'is', 'presented', 'in', 'this', 'article', 'teleparallel', 'gravity', 'is', 'used', 'to', 'perform', 'such', 'an', 'analysis', 'once', 'in', 'general', 'relativity', 'gr', 'the', 'concept', 'of', 'gravitational', 'energy', 'is', 'misleading', 'preventing', 'the', 'establishment', 'of', 'a', 'concise', 'quantum', 'cosmology', 'the', 'wheelerdewitt', 'like', 'equation', 'is', 'obtained', 'using', 'the', 'weyl', 'quantization', 'and', 'the', 'teleparallel', 'expression', 'of', 'energy']] | [-0.1817095623118803, 0.048426704275698285, -0.17560528415404925, 0.1639005518830215, -0.1636861295306257, -0.17979482842409716, -0.10933701252465003, 0.21449294100083144, -0.21324746859525995, -0.27164000997852, -0.011627592792917443, -0.22766152802588685, -0.15074956081142382, 0.15733409489205638, -0.1081811858124898, 0.022665803420490453, 0.016542281123942564, 0.08460271095723979, -0.09982679873272511, -0.23408678539895586, 0.3228269394686712, 0.18446607290284842, 0.25774142718208687, -0.00594516347960702, 0.09069966912336115, -0.023504827204825624, -0.024311652598303875, 0.042464071651920676, -0.19910680307241688, 0.03570618876256049, 0.2789612452990176, 0.14814546115563385, 0.2729389072961307, -0.41726186884833233, -0.285204512699108, 0.06168849511803793, 0.06738966604877662, 0.25344107932011994, -0.07459051142047558, -0.32652090235413717, 0.017390100135734037, -0.210914379650993, -0.12025202251970768, -0.031176333184703253, -0.01219742642050343, -0.16689136933668383, -0.14973905426450074, 0.13239129310282546, -0.008480481836678726, -0.017863050003403, -0.06727707851678133, -0.03940959445649891, 0.03659751818382314, 0.013941505774190384, 0.06800027886388957, 0.07064908176627276, 0.12005020350417388, -0.12867013581645942, -0.07981948674257312, 0.5154542704778058, -0.10567246873064765, -0.2614765322733937, 0.08051324025395193, -0.11411087777066443, -0.16433282680476882, 0.011640871076711587, 0.042757363723857064, 0.12920200181542896, -0.20490114429932355, 0.1742988637405298, 0.046826352523307184, 0.09447012718633882, 0.10392688349488058, 0.047140583293055115, 0.32010597915255595, 0.120405721561318, 0.010647174553014338, 0.08138012989158076, -0.049441756206631125, -0.1468915289733559, -0.4415168410466452, -0.23975834366865456, -0.18953412513032422, 0.11574038790214607, -0.13070095020287095, -0.19262148018294414, 0.36919012193435, 0.1299822764205081, 0.015660060652797774, 0.067670256198783, 0.2769104005502803, 0.1287320666285398, 0.01025002497148567, 0.04143371101235971, 0.3327609227438058, 0.2106739276787266, 0.16617286834766024, -0.23541249970107206, -0.07272994911597509, 0.0993965488617375] |
1,802.08088 | On relative separability in hypergraphs of models of theories | In the paper, notions of relative separability for hypergraphs of models of a
theory are defined. Properties of these notions and applications to ordered
theories are studied: characterizations of relative separability both in a
general case and for almost countably categorical quite o-minimal theories are
established.
| math.LO | in the paper notions of relative separability for hypergraphs of models of a theory are defined properties of these notions and applications to ordered theories are studied characterizations of relative separability both in a general case and for almost countably categorical quite ominimal theories are established | [['in', 'the', 'paper', 'notions', 'of', 'relative', 'separability', 'for', 'hypergraphs', 'of', 'models', 'of', 'a', 'theory', 'are', 'defined', 'properties', 'of', 'these', 'notions', 'and', 'applications', 'to', 'ordered', 'theories', 'are', 'studied', 'characterizations', 'of', 'relative', 'separability', 'both', 'in', 'a', 'general', 'case', 'and', 'for', 'almost', 'countably', 'categorical', 'quite', 'ominimal', 'theories', 'are', 'established']] | [-0.13221338900494511, 0.13013870665884536, -0.074234313630175, 0.1374289030411645, 0.005182515424878701, -0.1228843554854393, -0.04079144283035851, 0.381606798497555, -0.2808093625404265, -0.25816023920703196, 0.08504611344339894, -0.25310044000070775, -0.11997000970270323, 0.19143501547691616, -0.14222866001174503, 0.05416483004860904, -0.01768688798841575, 0.07189271575771272, -0.1442290293255254, -0.30219869987796183, 0.3733579011168331, -0.07801461033523083, 0.25135545894179656, 0.06397436202868172, 0.055351340545989246, -0.025366418215486665, -0.04894304911241583, 0.15518652931179688, -0.1906933374095546, 0.18842790113843005, 0.33527075013744645, 0.17055881841351156, 0.24680711928269136, -0.360814308008665, -0.20562874422530117, 0.12041257074831621, 0.08253712244534298, 0.033025452963319483, 0.03890013285791096, -0.2972496907054649, 0.11031299733313853, -0.15169283035008804, -0.10012751785309418, -0.1382795926993308, 0.04984006745254864, 0.03702521965960446, -0.2505849551247514, 0.04423169965815285, 0.15291080341589608, 0.15399307545031543, -0.10297821940975668, -0.07261201654024341, -0.003101170437572443, 0.050298071020971176, 0.02213894421963588, -0.07332149080162786, 0.0632222002858053, -0.14969132308159833, -0.20595985226859542, 0.39078073946597136, -0.008445213224900805, -0.2154411609618641, 0.25378262695006054, -0.11767276797605597, -0.23603247750914938, 0.020483081340384873, 0.10767888628027361, 0.219573478821827, -0.10177145712077618, 0.19554828210359276, -0.09548642328413932, 0.032674641490144575, 0.14677319824493126, 0.19123728781477953, 0.14495196738077895, 0.08304049969529329, 0.062134778511750956, 0.17010087908610053, 0.0950668689025485, -0.12221943943396858, -0.33302222645801044, -0.12311718382103287, -0.10680682228311249, 0.013188916491344571, -0.09297692864746078, -0.24898952591921325, 0.3696359086214848, 0.1185323474118891, 0.10423562525893035, 0.13409503816586474, 0.19990490540943068, 0.044443850020837526, -0.022807408842946523, 0.007616306852508822, 0.18805566895753145, 0.33659251783367083, -0.006455634335946777, -0.02327484301412883, 0.07196733964931058, 0.10720199536856102] |
1,802.08089 | Sampling as optimization in the space of measures: The Langevin dynamics
as a composite optimization problem | We study sampling as optimization in the space of measures. We focus on
gradient flow-based optimization with the Langevin dynamics as a case study. We
investigate the source of the bias of the unadjusted Langevin algorithm (ULA)
in discrete time, and consider how to remove or reduce the bias. We point out
the difficulty is that the heat flow is exactly solvable, but neither its
forward nor backward method is implementable in general, except for Gaussian
data. We propose the symmetrized Langevin algorithm (SLA), which should have a
smaller bias than ULA, at the price of implementing a proximal gradient step in
space. We show SLA is in fact consistent for Gaussian target measure, whereas
ULA is not. We also illustrate various algorithms explicitly for Gaussian
target measure, including gradient descent, proximal gradient, and
Forward-Backward, and show they are all consistent.
| math.OC cs.IT cs.LG math.IT stat.ML | we study sampling as optimization in the space of measures we focus on gradient flowbased optimization with the langevin dynamics as a case study we investigate the source of the bias of the unadjusted langevin algorithm ula in discrete time and consider how to remove or reduce the bias we point out the difficulty is that the heat flow is exactly solvable but neither its forward nor backward method is implementable in general except for gaussian data we propose the symmetrized langevin algorithm sla which should have a smaller bias than ula at the price of implementing a proximal gradient step in space we show sla is in fact consistent for gaussian target measure whereas ula is not we also illustrate various algorithms explicitly for gaussian target measure including gradient descent proximal gradient and forwardbackward and show they are all consistent | [['we', 'study', 'sampling', 'as', 'optimization', 'in', 'the', 'space', 'of', 'measures', 'we', 'focus', 'on', 'gradient', 'flowbased', 'optimization', 'with', 'the', 'langevin', 'dynamics', 'as', 'a', 'case', 'study', 'we', 'investigate', 'the', 'source', 'of', 'the', 'bias', 'of', 'the', 'unadjusted', 'langevin', 'algorithm', 'ula', 'in', 'discrete', 'time', 'and', 'consider', 'how', 'to', 'remove', 'or', 'reduce', 'the', 'bias', 'we', 'point', 'out', 'the', 'difficulty', 'is', 'that', 'the', 'heat', 'flow', 'is', 'exactly', 'solvable', 'but', 'neither', 'its', 'forward', 'nor', 'backward', 'method', 'is', 'implementable', 'in', 'general', 'except', 'for', 'gaussian', 'data', 'we', 'propose', 'the', 'symmetrized', 'langevin', 'algorithm', 'sla', 'which', 'should', 'have', 'a', 'smaller', 'bias', 'than', 'ula', 'at', 'the', 'price', 'of', 'implementing', 'a', 'proximal', 'gradient', 'step', 'in', 'space', 'we', 'show', 'sla', 'is', 'in', 'fact', 'consistent', 'for', 'gaussian', 'target', 'measure', 'whereas', 'ula', 'is', 'not', 'we', 'also', 'illustrate', 'various', 'algorithms', 'explicitly', 'for', 'gaussian', 'target', 'measure', 'including', 'gradient', 'descent', 'proximal', 'gradient', 'and', 'forwardbackward', 'and', 'show', 'they', 'are', 'all', 'consistent']] | [-0.09239877180315237, 0.04531232418875534, -0.11242357427782729, 0.1149487942861763, -0.07309963551501855, -0.17826174057570968, 0.04283798248209852, 0.47490052508969677, -0.2819500107793732, -0.2617659149295155, 0.11026879449346902, -0.2438963995916201, -0.1327828966635973, 0.19283294438463736, -0.08697852080502937, 0.053805829382068904, 0.04416429819473138, 0.03416130364813069, -0.08569703389418226, -0.240099025651621, 0.2779089522594256, 0.058369952907904664, 0.2726157604673785, 0.018578059637773755, 0.15098231980752147, -0.005567148488827367, -0.04303773347592206, 0.03620586014420441, -0.08042142464448442, 0.07146786802847942, 0.21506861765730254, 0.13012375522418118, 0.31518789890869553, -0.3848445912862712, -0.19590555894244727, 0.17027048435696263, 0.13303476580623405, 0.13656822525555967, -0.057727016482984395, -0.24014082898927444, 0.08064352399223741, -0.11755559528378624, -0.08538869372899281, -0.10406594124378253, -0.059376745715948705, 0.061253666686197965, -0.28113772757912836, 0.08722929264635924, 0.06300742384904982, 0.024635724751901084, -0.015581535561016846, -0.14699970884496308, 0.020085758036696055, 0.05681617265560578, 0.024261041119172905, 0.03529053332997446, 0.16032990054326487, -0.08821007456954119, -0.10217777480485235, 0.35579103668028794, -0.1157510812574517, -0.2768624393493994, 0.12990882975075738, -0.13508168324590364, -0.16813178419247798, 0.09309592413227238, 0.21061040827317545, 0.13736889962807086, -0.19974199165292877, 0.11195130579723442, -0.02645579650866013, 0.11536174778870294, 0.02862698909106618, -0.0445363765020181, 0.11384473146923574, 0.16036627106104337, 0.1832683070127048, 0.1597451695921362, -0.10237222687252104, -0.1739650145404252, -0.3081671500921989, -0.14905383720364856, -0.18268302256812785, -0.018333913809999637, -0.08782250519995892, -0.15219690394422686, 0.3438623228064137, 0.18251239358454097, 0.19509500356932694, 0.12186546218399857, 0.31516029080706287, 0.16099841446708227, 0.025074758393531467, 0.13335407934158194, 0.20013328140489228, 0.09305849825263235, 0.07849120852662951, -0.24252138213429547, 0.08252222377621958, 0.05971788228918792] |
1,802.0809 | Fano threefolds as equivariant compactifications of the vector group | In this article, we determine all equivariant compactifications of the
three-dimensional vector group $\mathbf{G}_a^3$ which are smooth Fano
threefolds with Picard number greater or equal than two.
| math.AG math.NT | in this article we determine all equivariant compactifications of the threedimensional vector group mathbfg_a3 which are smooth fano threefolds with picard number greater or equal than two | [['in', 'this', 'article', 'we', 'determine', 'all', 'equivariant', 'compactifications', 'of', 'the', 'threedimensional', 'vector', 'group', 'mathbfg_a3', 'which', 'are', 'smooth', 'fano', 'threefolds', 'with', 'picard', 'number', 'greater', 'or', 'equal', 'than', 'two']] | [-0.2051296315084283, 0.1007393437366073, 0.005681155921103289, 0.11495449431151009, -0.10463270195759833, -0.20839968839517006, -0.05292401814278072, 0.3461996917971052, -0.1817760095000267, -0.26446865921696794, 0.07790547623209512, -0.27448003524197984, -0.1752640103760104, 0.20111421201055726, -0.1765868323855102, -0.023929932315905508, -0.049890397009081565, 0.07964848741315879, -0.14962162188469216, -0.41424901010983517, 0.5092900392527764, -0.11494948055881721, 0.2632982476005474, -0.019611622475517485, 0.07976966068291894, -0.048328698988860615, -0.0182449365607821, -0.002237682660611776, -0.14791420290174967, 0.2171868999631932, 0.31582815658587676, -0.027737639342936184, 0.15665388422516677, -0.4112913046891873, -0.17155390490706152, 0.31682955803206336, 0.1660323940181675, 0.07321513947905399, 0.07892358179490727, -0.1771437941620556, 0.17376953642815351, -0.16325685528304, -0.17624232086997765, -0.07589126800974974, 0.01102546939196495, 0.04377288228044143, -0.16511328650925022, -0.05744242961876667, 0.003923947493044229, 0.23237363066380987, -0.044347558833228856, -0.11446411696334298, -0.10619140437875803, -0.002184046620431428, 0.07362560865182716, 0.06032141092090079, 0.08859304159593123, -0.11484004086993921, -0.10018251438696797, 0.3846036447928502, -0.053359065485262994, -0.2490869279449376, 0.1074766660682284, -0.20450754721577352, -0.11068490020429286, 0.21522537077992007, 0.13087737030134752, 0.23679873762795559, 0.03930346667766571, 0.07462048913853672, -0.12940326383194098, 0.09084946988150477, 0.11340950696299282, -0.004992255188811284, 0.0983306269447964, 0.07132810454529065, 0.13257921103817913, 0.061882618420685716, -0.03172499442902895, -0.03540188795886934, -0.4033048396500257, -0.20311478652561513, -0.08615856073671378, 0.24704506310920876, -0.1207911163353576, -0.1260202257679059, 0.43030967448766416, 0.03196424664929509, 0.2225969607153764, 0.09970098906286204, 0.26287007618408936, 0.003959991037845612, -0.020141039616786517, 0.08477931677883205, 0.16597664986665434, 0.1698139701755001, -0.12172969280240628, -0.11874577941265531, -0.12311754721360138, 0.20415609706049928] |
1,802.08091 | Deep Online Video Stabilization | Video stabilization technique is essential for most hand-held captured videos
due to high-frequency shakes. Several 2D-, 2.5D- and 3D-based stabilization
techniques are well studied, but to our knowledge, no solutions based on deep
neural networks had been proposed. The reason for this is mostly the shortage
of training data, as well as the challenge of modeling the problem using neural
networks. In this paper, we solve the video stabilization problem using a
convolutional neural network (ConvNet). Instead of dealing with offline
holistic camera path smoothing based on feature matching, we focus on
low-latency real-time camera path smoothing without explicitly representing the
camera path. Our network, called StabNet, learns a transformation for each
input unsteady frame progressively along the time-line, while creating a more
stable latent camera path. To train the network, we create a dataset of
synchronized steady/unsteady video pairs via a well designed hand-held
hardware. Experimental results shows that the proposed online method (without
using future frames) performs comparatively to traditional offline video
stabilization methods, while running about 30 times faster. Further, the
proposed StabNet is able to handle night-time and blurry videos, where existing
methods fail in robust feature matching.
| cs.GR | video stabilization technique is essential for most handheld captured videos due to highfrequency shakes several 2d 25d and 3dbased stabilization techniques are well studied but to our knowledge no solutions based on deep neural networks had been proposed the reason for this is mostly the shortage of training data as well as the challenge of modeling the problem using neural networks in this paper we solve the video stabilization problem using a convolutional neural network convnet instead of dealing with offline holistic camera path smoothing based on feature matching we focus on lowlatency realtime camera path smoothing without explicitly representing the camera path our network called stabnet learns a transformation for each input unsteady frame progressively along the timeline while creating a more stable latent camera path to train the network we create a dataset of synchronized steadyunsteady video pairs via a well designed handheld hardware experimental results shows that the proposed online method without using future frames performs comparatively to traditional offline video stabilization methods while running about 30 times faster further the proposed stabnet is able to handle nighttime and blurry videos where existing methods fail in robust feature matching | [['video', 'stabilization', 'technique', 'is', 'essential', 'for', 'most', 'handheld', 'captured', 'videos', 'due', 'to', 'highfrequency', 'shakes', 'several', '2d', '25d', 'and', '3dbased', 'stabilization', 'techniques', 'are', 'well', 'studied', 'but', 'to', 'our', 'knowledge', 'no', 'solutions', 'based', 'on', 'deep', 'neural', 'networks', 'had', 'been', 'proposed', 'the', 'reason', 'for', 'this', 'is', 'mostly', 'the', 'shortage', 'of', 'training', 'data', 'as', 'well', 'as', 'the', 'challenge', 'of', 'modeling', 'the', 'problem', 'using', 'neural', 'networks', 'in', 'this', 'paper', 'we', 'solve', 'the', 'video', 'stabilization', 'problem', 'using', 'a', 'convolutional', 'neural', 'network', 'convnet', 'instead', 'of', 'dealing', 'with', 'offline', 'holistic', 'camera', 'path', 'smoothing', 'based', 'on', 'feature', 'matching', 'we', 'focus', 'on', 'lowlatency', 'realtime', 'camera', 'path', 'smoothing', 'without', 'explicitly', 'representing', 'the', 'camera', 'path', 'our', 'network', 'called', 'stabnet', 'learns', 'a', 'transformation', 'for', 'each', 'input', 'unsteady', 'frame', 'progressively', 'along', 'the', 'timeline', 'while', 'creating', 'a', 'more', 'stable', 'latent', 'camera', 'path', 'to', 'train', 'the', 'network', 'we', 'create', 'a', 'dataset', 'of', 'synchronized', 'steadyunsteady', 'video', 'pairs', 'via', 'a', 'well', 'designed', 'handheld', 'hardware', 'experimental', 'results', 'shows', 'that', 'the', 'proposed', 'online', 'method', 'without', 'using', 'future', 'frames', 'performs', 'comparatively', 'to', 'traditional', 'offline', 'video', 'stabilization', 'methods', 'while', 'running', 'about', '30', 'times', 'faster', 'further', 'the', 'proposed', 'stabnet', 'is', 'able', 'to', 'handle', 'nighttime', 'and', 'blurry', 'videos', 'where', 'existing', 'methods', 'fail', 'in', 'robust', 'feature', 'matching']] | [-0.07310462121937522, 0.004608307726142046, -0.07425601490693608, 0.05449185296219136, -0.14421112748034495, -0.20387671395253978, -0.010949989278972345, 0.4885032698904213, -0.25384372717664133, -0.32820653592628474, 0.10922208020929247, -0.24794200729382665, -0.20181739564837986, 0.214045435089716, -0.17276541661091246, 0.13012052319858125, 0.16111441636641852, 0.02949667324459082, -0.029061604289654496, -0.2568202205051325, 0.27206346511742785, 0.05269433748770481, 0.34553432478324364, -0.01998170727226687, 0.1666532579349893, 0.010978939371355073, -0.06574357604902041, -0.0023696102489913374, -0.027434801532140944, 0.15623722237375515, 0.31550074153163127, 0.17095919359401848, 0.31582213781381907, -0.4798695386534459, -0.2503277358801202, 0.06824589240805883, 0.1572838713807103, 0.1257342666583626, -0.06027209932010584, -0.35005579289833183, 0.12279808200301455, -0.15476581088120217, 0.01899921137006267, -0.10888569583430102, -0.03222100152082643, -0.031041879506512104, -0.29200703632664765, 0.00020934563062359015, 0.03789622814235229, 0.05404958881462287, -0.07545514628046045, -0.055394508709248745, 0.022456469566953418, 0.17241254673878614, 0.025848721296642906, 0.08347425117451501, 0.12483603005346498, -0.19628984633967966, -0.12139762706693115, 0.3844417207482222, -0.04599097228753013, -0.1849523236680972, 0.17102495915697594, 0.02114932268159464, -0.11716060086986736, 0.15356254146287315, 0.21525464475179384, 0.15685858766695387, -0.17724068651073857, -0.031635436902778515, -0.026577122386937078, 0.20774174553195113, 0.07934183212683389, 0.007799904176423105, 0.15318290596830927, 0.28828369828529266, 0.0785871582893091, 0.13009093487267628, -0.18001512264171124, -0.08912438352004086, -0.19356802958975192, -0.06575112730191138, -0.2057204280060863, -0.04430506748980598, -0.09412834390884535, -0.14240794476507673, 0.4023378711095766, 0.23550175475446802, 0.19422540771591135, 0.12550838943815937, 0.40605627408153133, 0.00920046548310079, 0.1295738090139103, 0.10561855453997851, 0.15582931490039062, -0.025316866114735603, 0.19406293667607794, -0.15125284722062612, 0.05869250003444521, 0.08832270737038925] |
1,802.08092 | On structures in hypergraphs of models of a theory | We define and study structural properties of hypergraphs of models of a
theory including lattice ones. Characterizations for the lattice properties of
hypergraphs of models of a theory, as well as for structures on sets of
isomorphism types of models of a theory, are given.
| math.LO | we define and study structural properties of hypergraphs of models of a theory including lattice ones characterizations for the lattice properties of hypergraphs of models of a theory as well as for structures on sets of isomorphism types of models of a theory are given | [['we', 'define', 'and', 'study', 'structural', 'properties', 'of', 'hypergraphs', 'of', 'models', 'of', 'a', 'theory', 'including', 'lattice', 'ones', 'characterizations', 'for', 'the', 'lattice', 'properties', 'of', 'hypergraphs', 'of', 'models', 'of', 'a', 'theory', 'as', 'well', 'as', 'for', 'structures', 'on', 'sets', 'of', 'isomorphism', 'types', 'of', 'models', 'of', 'a', 'theory', 'are', 'given']] | [-0.10889217072269983, 0.0858866861090064, -0.08739371221098635, 0.06721061108012995, 0.007973442350824674, -0.07191567190198435, 0.035975621581181054, 0.37396705312033496, -0.2984026228388151, -0.3071144829504192, 0.11464327506514059, -0.29682914540171623, -0.18278828023208513, 0.19564705631799167, -0.02888814684831434, 0.05046719914923112, 0.02976867173694902, 0.04878940543987685, -0.10453803508232037, -0.21080705196751903, 0.3542502413503826, -0.020435185875329706, 0.22139088703940313, 0.05786254021028678, 0.05894752757416831, -0.016709256927586263, -0.0018077485780749055, 0.1266784108347363, -0.198621169415613, 0.2001222275197506, 0.1949796858870185, 0.16039783000532123, 0.18786411893864471, -0.4028714916565352, -0.2830493692515625, 0.07506624563700623, 0.05700879737527834, 0.11735041543013519, 0.01645210986284332, -0.2153456934624248, 0.12352335902137888, -0.1300921395421028, -0.12137674404722121, -0.11611269960800806, 0.026501378147966333, 0.12820577918965784, -0.2658254629207982, 0.0396115120086405, 0.10727549999590136, 0.14071989593406517, -0.11557996412739158, -0.1313573032617569, -0.025741653480670517, 0.11164807957700557, -0.010107178158230251, -0.07616920373402536, 0.030317957792431117, -0.22966810191671053, -0.2528121171726121, 0.463581028746234, -0.012483791593048308, -0.1570405351722406, 0.20319698221153684, -0.06464068678518137, -0.19563187583246164, -7.645022124052048e-05, 0.20584607200904026, 0.1939808214807676, -0.09500988227211767, 0.15285071016470383, -0.10790061151815786, 0.10041412071635326, 0.05052334803880917, 0.12695980270703633, 0.18529140944075254, 0.18848381750285625, 0.049557765418042736, 0.20236063218779035, 0.04504515616119736, -0.0798685820462803, -0.3125137229760488, -0.10753484157224497, -0.12785515886627966, 0.0467663048249152, -0.11342979277348302, -0.3005109042317296, 0.4514070844898621, 0.11111834651480118, 0.2357614488237434, 0.08781194647567139, 0.18180103402636533, 0.036299607794110976, 0.05185003545549181, -0.038580864626500344, 0.12694404335278603, 0.28826714663041964, -0.0414040466149648, -0.08959081499940819, 0.01512914907394184, 0.15461484582887755] |
1,802.08093 | SO(p,q)-Higgs bundles and higher Teichm\"uller components | Some connected components of a moduli space are mundane in the sense that
they are distinguished only by obvious topological invariants or have no
special characteristics. Others are more alluring and unusual either because
they are not detected by primary invariants, or because they have special
geometric significance, or both. In this paper we describe new examples of such
`exotic' components in moduli spaces of SO(p,q)-Higgs bundles on closed Riemann
surfaces or, equivalently, moduli spaces of surface group representations into
the Lie group SO(p,q). Furthermore, we discuss how these exotic components are
related to the notion of positive Anosov representations recently developed by
Guichard and Wienhard. We also provide a complete count of the connected
components of these moduli spaces (except for SO(2,q), with q> 3).
| math.AG math.DG math.GT | some connected components of a moduli space are mundane in the sense that they are distinguished only by obvious topological invariants or have no special characteristics others are more alluring and unusual either because they are not detected by primary invariants or because they have special geometric significance or both in this paper we describe new examples of such exotic components in moduli spaces of sopqhiggs bundles on closed riemann surfaces or equivalently moduli spaces of surface group representations into the lie group sopq furthermore we discuss how these exotic components are related to the notion of positive anosov representations recently developed by guichard and wienhard we also provide a complete count of the connected components of these moduli spaces except for so2q with q 3 | [['some', 'connected', 'components', 'of', 'a', 'moduli', 'space', 'are', 'mundane', 'in', 'the', 'sense', 'that', 'they', 'are', 'distinguished', 'only', 'by', 'obvious', 'topological', 'invariants', 'or', 'have', 'no', 'special', 'characteristics', 'others', 'are', 'more', 'alluring', 'and', 'unusual', 'either', 'because', 'they', 'are', 'not', 'detected', 'by', 'primary', 'invariants', 'or', 'because', 'they', 'have', 'special', 'geometric', 'significance', 'or', 'both', 'in', 'this', 'paper', 'we', 'describe', 'new', 'examples', 'of', 'such', 'exotic', 'components', 'in', 'moduli', 'spaces', 'of', 'sopqhiggs', 'bundles', 'on', 'closed', 'riemann', 'surfaces', 'or', 'equivalently', 'moduli', 'spaces', 'of', 'surface', 'group', 'representations', 'into', 'the', 'lie', 'group', 'sopq', 'furthermore', 'we', 'discuss', 'how', 'these', 'exotic', 'components', 'are', 'related', 'to', 'the', 'notion', 'of', 'positive', 'anosov', 'representations', 'recently', 'developed', 'by', 'guichard', 'and', 'wienhard', 'we', 'also', 'provide', 'a', 'complete', 'count', 'of', 'the', 'connected', 'components', 'of', 'these', 'moduli', 'spaces', 'except', 'for', 'so2q', 'with', 'q', '3']] | [-0.17396933193784206, 0.17069723481452093, -0.08648947340250016, 0.11027468642126768, -0.13571819919347763, -0.15893772744387388, -0.016173180176876484, 0.40836037522554397, -0.2622029497437179, -0.2528553064393345, 0.1496741472920403, -0.2567976344563067, -0.19768481989577413, 0.2115801073014736, -0.12993933385238052, -0.03135559243429452, 0.026196476507931946, 0.06124645533249713, -0.10718704465497285, -0.2919192257001996, 0.44379126800224183, -0.07433458679355681, 0.20282347466796635, 0.04023939160630107, 0.074273303065449, -0.02590807444602251, -0.05191205864679068, 0.038935404035961255, -0.11275869436032372, 0.153539361609146, 0.3026017757356167, 0.05930986024066806, 0.15972462015599012, -0.4178047717139125, -0.20665896729379893, 0.19753221087902784, 0.14615329483523964, -0.0009631984680891037, -0.01330427056516055, -0.2851848589852452, 0.10927709894720465, -0.12895681731775402, -0.1313707377463579, -0.15418902582419106, 0.04914245744142681, 0.03856571706756949, -0.10503972533717751, -0.0009670186212752015, 0.09129555698297918, 0.09645132348686457, -0.08341140016168357, -0.13221767917647959, -0.093776407526806, 0.09561050590826198, 0.035364691760391, -0.002209148191846907, 0.0852507361881435, -0.13099245191086084, -0.11642881147656589, 0.3740280838832259, -0.010848562741652131, -0.2561948779374361, 0.21147975845634936, -0.11374037059955298, -0.18288951501622797, 0.12716802361793816, 0.14912589308200405, 0.13218207431212067, -0.051498573545133694, 0.10496946819778531, -0.05381655813008547, 0.06774288480170071, 0.08780750591494144, 0.056631320065818724, 0.21617865672707556, 0.056643079586327076, 0.043248138291528446, 0.08369325766712427, 0.011124416941776872, -0.025760574836749584, -0.3387919372413307, -0.2076164221763611, -0.0872451298031956, 0.08547205614869018, -0.06654609907767735, -0.17644188884831966, 0.37919698722288014, 0.03713339608162641, 0.20700828357785941, 0.05661614892957732, 0.2262875889465213, 0.039611143607646226, 0.07680725177377462, 0.08419121315330266, 0.2074010189299006, 0.15851066423021257, -0.043211908314377066, -0.0777317367233336, 0.024116494923830032, 0.10849662327766418] |
1,802.08094 | On freedom and independence in hypergraphs of models of theories | Notions of freedom and independence for hypergraphs of models of a theory are
defined. Properties of these notions and their applications to some natural
classes of theories are studied.
| math.LO | notions of freedom and independence for hypergraphs of models of a theory are defined properties of these notions and their applications to some natural classes of theories are studied | [['notions', 'of', 'freedom', 'and', 'independence', 'for', 'hypergraphs', 'of', 'models', 'of', 'a', 'theory', 'are', 'defined', 'properties', 'of', 'these', 'notions', 'and', 'their', 'applications', 'to', 'some', 'natural', 'classes', 'of', 'theories', 'are', 'studied']] | [-0.14677841651478205, 0.15452907626228085, -0.065023315428146, 0.11748908540426657, -0.04219805815353476, -0.10851045121470916, -0.04187315912989514, 0.35262354135770224, -0.30630325757223986, -0.33808148356861084, 0.08104434859906805, -0.2818649400924814, -0.15803277306258678, 0.1774915275645667, -0.11700079471258254, 0.07345902527971514, -0.044585283909892214, 0.03467832481617044, -0.12631079072839227, -0.2891424933512663, 0.3488642678852996, -0.03400785655810915, 0.21700763985000807, 0.0847594759202209, 0.1033901780972193, -0.05253770912130331, -0.041197085078677226, 0.12644294501635536, -0.20634554708697672, 0.21958012419656434, 0.2529224393753072, 0.23672684204989466, 0.2692522183060646, -0.4033592780088556, -0.26635602367078437, 0.12251960714187088, 0.025207038294395495, 0.05261254169303795, 0.062479310444202914, -0.26500378475235453, 0.13236184620523248, -0.11654769577856722, -0.1377448232780243, -0.11672769923662317, 0.029449264872176893, 0.1153857971959073, -0.23456269155802398, -0.005756665494871037, 0.12931908313827267, 0.17174379787696847, -0.017385313062575358, -0.1308461694881834, -0.02916969138936236, 0.10825558430675802, 0.07329105906959238, -0.13390665501356125, 0.10011748841096615, -0.23590628398132735, -0.23257596662332272, 0.40119493026928654, 0.06095742472800715, -0.2285135072447231, 0.2734071671127759, -0.04818565025925636, -0.22770851885835672, -0.01712256825753841, 0.14903546744507962, 0.22477265139078273, -0.11671532446454311, 0.14984636849739813, -0.05848314458953923, 0.01978924170393368, 0.09932610270535124, 0.24114944002237812, 0.1911390357297556, 0.061027894888458584, 0.0013237623979562316, 0.13220854614186903, 0.0940167625787957, -0.1367876135326665, -0.31916579514228066, -0.11400100345028853, -0.098125118441109, -0.009778947505200732, -0.12498912085068477, -0.21472517487689338, 0.4243662265482648, 0.13719340959355106, 0.1512444937794373, 0.10737373166043183, 0.18533525901750245, 0.06219988088284073, 0.04335989913068198, -0.009695698539244717, 0.1687459989886426, 0.3242204849576128, -0.011474034138794604, -0.04842400030586226, 0.03204998956864764, 0.09299782258940154] |
1,802.08095 | Mapping Borel sets onto balls and self-similar sets by Lipschitz and
nearly Lipschitz maps | If $X$ is an analytic metric space satisfying a very mild doubling condition,
then for any finite Borel measure $\mu$ on $X$ there is a set $N\subseteq X$
such that $\mu(N)>0$, an ultrametric space $Z$ and a Lipschitz bijection
$\phi:N\to Z$ whose inverse is nearly Lipschitz, i.e., $\beta$-H\"older for all
$\beta<1$. As an application it is shown that a Borel set in a Euclidean space
maps onto $[0,1]^n$ by a nearly Lipschitz map if and only if it cannot be
covered by countably many sets of Hausdorff dimension strictly below $n$. The
argument extends to analytic metric spaces satisfying the mild condition.
Further generalization replaces cubes with self-similar sets, nearly Lipschitz
maps with nearly H\"older maps and integer dimension with arbitrary finite
dimension.
| math.CA | if x is an analytic metric space satisfying a very mild doubling condition then for any finite borel measure mu on x there is a set nsubseteq x such that mun0 an ultrametric space z and a lipschitz bijection phinto z whose inverse is nearly lipschitz ie betaholder for all beta1 as an application it is shown that a borel set in a euclidean space maps onto 01n by a nearly lipschitz map if and only if it cannot be covered by countably many sets of hausdorff dimension strictly below n the argument extends to analytic metric spaces satisfying the mild condition further generalization replaces cubes with selfsimilar sets nearly lipschitz maps with nearly holder maps and integer dimension with arbitrary finite dimension | [['if', 'x', 'is', 'an', 'analytic', 'metric', 'space', 'satisfying', 'a', 'very', 'mild', 'doubling', 'condition', 'then', 'for', 'any', 'finite', 'borel', 'measure', 'mu', 'on', 'x', 'there', 'is', 'a', 'set', 'nsubseteq', 'x', 'such', 'that', 'mun0', 'an', 'ultrametric', 'space', 'z', 'and', 'a', 'lipschitz', 'bijection', 'phinto', 'z', 'whose', 'inverse', 'is', 'nearly', 'lipschitz', 'ie', 'betaholder', 'for', 'all', 'beta1', 'as', 'an', 'application', 'it', 'is', 'shown', 'that', 'a', 'borel', 'set', 'in', 'a', 'euclidean', 'space', 'maps', 'onto', '01n', 'by', 'a', 'nearly', 'lipschitz', 'map', 'if', 'and', 'only', 'if', 'it', 'can', 'not', 'be', 'covered', 'by', 'countably', 'many', 'sets', 'of', 'hausdorff', 'dimension', 'strictly', 'below', 'n', 'the', 'argument', 'extends', 'to', 'analytic', 'metric', 'spaces', 'satisfying', 'the', 'mild', 'condition', 'further', 'generalization', 'replaces', 'cubes', 'with', 'selfsimilar', 'sets', 'nearly', 'lipschitz', 'maps', 'with', 'nearly', 'holder', 'maps', 'and', 'integer', 'dimension', 'with', 'arbitrary', 'finite', 'dimension']] | [-0.12501292439401, 0.14723577255293693, -0.05348170357869893, 0.0828261777296723, -0.06906447904865916, -0.1774547907743391, 0.0348603654457862, 0.4001186353616356, -0.32536140052465407, -0.12875454738827014, 0.13637434457886843, -0.30437069720157034, -0.09990750992769087, 0.22862305835161995, -0.10405130699045986, 0.05552872946879607, 0.0343335487622374, 0.06842035422010756, -0.09963480792409642, -0.2981467840320438, 0.4075109498741908, -0.07501713481799858, 0.19463224303189333, 0.026694761218154818, 0.20339445594501326, -0.02140174958120456, 0.007993633298551649, 0.07138605722405085, -0.1834945147067954, 0.04936217949763546, 0.2387918152096795, 0.13439722959807793, 0.26767512495682494, -0.25349724662255463, -0.18989792418461748, 0.26722156416200765, 0.10158910891571181, -0.0831655953079462, -0.012689231002392868, -0.2832800515253491, 0.1479575530648595, -0.07745915572575438, -0.14865933073972298, -0.08957540664142301, 0.10899701345772521, -0.027589559814385402, -0.35547718354614405, -0.031420757823691865, 0.14955276247810542, 0.06625394587562612, -0.0875391441253506, -0.059171677169549027, -0.10305270529541422, 0.04036011403460601, -0.024061318676222146, 0.2026573531632501, 0.06084194924441976, 0.011626669879609006, -0.07087469554120084, 0.3461226068808114, -0.08165031178604538, -0.3351611647361178, 0.18197563431430153, -0.24537800811988308, -0.14005094541736493, 0.1478223692762052, 0.07097833736882947, 0.10827621437488048, -0.07891484636343009, 0.27546233214235416, -0.15251984982940603, 0.17473393029010878, 0.15038191573315762, 0.012332867762846192, 0.10221825776492979, 0.08536530393592226, 0.24974959456821813, 0.11260676640559109, 0.04880592692406788, 0.0027298119351669117, -0.3841793893713871, -0.12328018822775381, -0.2043294851948333, 0.17172574670807877, -0.18335432405888796, -0.245504189048642, 0.24193220810086383, 0.010404472190099276, 0.23458084952071068, 0.16741589161120657, 0.23447850922773766, 0.08160770554743836, 0.015220828434808285, 0.11231651870397533, 0.055022407175473326, 0.15273171990004375, -0.01941612595692277, -0.050892303327696654, 0.03679165218358602, 0.16716373416148428] |
1,802.08096 | Anomaly inflow on QCD axial domain-walls and vortices | We study the chiral effective theory in the presence of QCD vortices. Gauge
invariance requires novel terms from vortex singularities in the gauged
Wess-Zumino-Witten action, which incorporate anomaly induced currents along the
vortices. We examine these terms for systems with QCD axial domain-walls
bounded by vortices (vortons) under magnetic fields. We discuss how the baryon
and the electric charge conservations are satisfied in these systems through
interplay between domain-walls and vortices, which manifests Callan-Harvey's
mechanism of the anomaly inflow.
| hep-ph hep-th | we study the chiral effective theory in the presence of qcd vortices gauge invariance requires novel terms from vortex singularities in the gauged wesszuminowitten action which incorporate anomaly induced currents along the vortices we examine these terms for systems with qcd axial domainwalls bounded by vortices vortons under magnetic fields we discuss how the baryon and the electric charge conservations are satisfied in these systems through interplay between domainwalls and vortices which manifests callanharveys mechanism of the anomaly inflow | [['we', 'study', 'the', 'chiral', 'effective', 'theory', 'in', 'the', 'presence', 'of', 'qcd', 'vortices', 'gauge', 'invariance', 'requires', 'novel', 'terms', 'from', 'vortex', 'singularities', 'in', 'the', 'gauged', 'wesszuminowitten', 'action', 'which', 'incorporate', 'anomaly', 'induced', 'currents', 'along', 'the', 'vortices', 'we', 'examine', 'these', 'terms', 'for', 'systems', 'with', 'qcd', 'axial', 'domainwalls', 'bounded', 'by', 'vortices', 'vortons', 'under', 'magnetic', 'fields', 'we', 'discuss', 'how', 'the', 'baryon', 'and', 'the', 'electric', 'charge', 'conservations', 'are', 'satisfied', 'in', 'these', 'systems', 'through', 'interplay', 'between', 'domainwalls', 'and', 'vortices', 'which', 'manifests', 'callanharveys', 'mechanism', 'of', 'the', 'anomaly', 'inflow']] | [-0.257300992991823, 0.24457974396407223, -0.016139685509141345, 0.08889752182697591, -0.0784860356675031, -0.06125679551265561, 0.0014602680144330056, 0.311653008326315, -0.21872895150087202, -0.2606623226728959, 0.04248181088284279, -0.25359618584983623, -0.1647524411479632, 0.06051915708499459, 4.4655723449511406e-08, 0.006780391714225213, -0.06824770554279287, 0.01615991424291562, -0.07245002513846908, -0.18173924987562573, 0.3718707530030933, -0.04762056143879771, 0.31527515744360596, 0.13685802637393443, 0.11748849611299542, -0.035830401916964315, -0.0005497665693744635, 0.03578029477443451, -0.13067439059989575, 0.06713715417740437, 0.1706964157294864, -0.05877580777861369, 0.07550185420311606, -0.537268667266919, -0.22381322447640392, 0.10386847099289298, 0.2076928017553515, 0.16901674650263232, -0.049055010008697324, -0.33530379903431123, 0.08311256553189686, -0.14496169210626528, -0.16448950095442483, -0.17008829885759416, -0.04142860262296521, 0.009111641616656039, -0.25754789693448216, 0.15152274003925506, 0.049000051703889116, 0.10526040425667396, -0.08312631767983429, -0.04698778665027557, -0.08011681470685662, 0.048449519012744226, 0.17469002987043217, 0.05824190193417076, 0.189085675122885, -0.26040642817194265, -0.17473248970241118, 0.39347053534136367, -0.06745726765634921, -0.20868599970036975, 0.11554358276920632, -0.13652002673524505, -0.10665282445589606, 0.09668007304963584, 0.13901006014874348, 0.10288492949583973, -0.11959278820536266, 0.11133940093881953, -0.04070361907808827, 0.05566589487865806, 0.09019178725802937, 0.06612626948537162, 0.3634105206777652, 0.10484418069991545, 0.04244349364979336, 0.13693567813756183, -0.049548832001164556, -0.13080244794344673, -0.40362224438920236, -0.08460992550811706, -0.10973647507265784, 0.04862685712914054, -0.05577575319815272, -0.11954362485677195, 0.37759456862337315, 0.16568411510581008, 0.17322333894023756, -0.04655783666739575, 0.24083122914322677, 0.1313412485835262, 0.13393642432175767, 0.06264634825101194, 0.2311481579165094, 0.2035164682296081, 0.15173097892712134, -0.3621732198889964, -0.09592745804156248, 0.15966561686852798] |
1,802.08097 | On residual categories for Grassmannians | We define and discuss some general properties of residual categories of
Lefschetz decompositions in triangulated categories. In the case of the derived
category of coherent sheaves on the Grassmannian $\text{G}(k,n)$ we conjecture
that the residual category associated with Fonarev's Lefschetz exceptional
collection is generated by a completely orthogonal exceptional collection. We
prove this conjecture for $k = p$, a prime number, modulo completeness of
Fonarev's collection (and for $p = 3$ we check this completeness).
| math.AG | we define and discuss some general properties of residual categories of lefschetz decompositions in triangulated categories in the case of the derived category of coherent sheaves on the grassmannian textgkn we conjecture that the residual category associated with fonarevs lefschetz exceptional collection is generated by a completely orthogonal exceptional collection we prove this conjecture for k p a prime number modulo completeness of fonarevs collection and for p 3 we check this completeness | [['we', 'define', 'and', 'discuss', 'some', 'general', 'properties', 'of', 'residual', 'categories', 'of', 'lefschetz', 'decompositions', 'in', 'triangulated', 'categories', 'in', 'the', 'case', 'of', 'the', 'derived', 'category', 'of', 'coherent', 'sheaves', 'on', 'the', 'grassmannian', 'textgkn', 'we', 'conjecture', 'that', 'the', 'residual', 'category', 'associated', 'with', 'fonarevs', 'lefschetz', 'exceptional', 'collection', 'is', 'generated', 'by', 'a', 'completely', 'orthogonal', 'exceptional', 'collection', 'we', 'prove', 'this', 'conjecture', 'for', 'k', 'p', 'a', 'prime', 'number', 'modulo', 'completeness', 'of', 'fonarevs', 'collection', 'and', 'for', 'p', '3', 'we', 'check', 'this', 'completeness']] | [-0.21813255322298833, 0.019407379520790916, -0.08168534208089114, 0.08572648210683838, -0.02525494813120791, -0.1335889923652368, 0.030524463579058646, 0.3643306158216936, -0.3594619173290474, -0.21698986531368325, 0.06125281708913722, -0.20570933438970573, -0.11277619781571308, 0.15586372748283403, -0.19040843701389218, -0.037244523406427886, 0.09331923472761576, 0.08563455987854728, -0.05123857989840742, -0.3399712358202253, 0.45937943809798787, -0.0715546111310167, 0.2389541477497135, 0.05191211413059916, 0.08597248700181288, 0.060859553821917094, -0.036421781578766445, 0.028379605204931328, -0.12517305073779425, 0.1856231289117464, 0.3058601970119136, 0.13843696322624705, 0.16770942251397564, -0.33209589775651693, -0.06879709792057319, 0.2051563629082271, 0.10947985782196545, 0.03749622605474932, -0.022363157701745098, -0.25817035222093443, 0.1860594032199255, -0.18371811490505935, -0.16521755665141558, -0.0916739933325776, 0.08407879918813706, 0.03884403315106673, -0.21248216755422097, -0.045191575324029794, 0.12268649483365672, 0.17512635687100037, -0.0956383858740862, -0.11031911692282717, -0.032743100891821086, 0.05340456451688494, -0.023473038993376705, -0.0297926751896739, 0.05577123503067664, -0.14150462059437163, -0.10312096560706517, 0.36120495977146283, -0.011660418007522821, -0.18937427837933812, 0.12631760931108146, -0.14205442554583506, -0.22368902636558882, 0.15462246943664337, 0.060334025350000174, 0.13521206989846957, -0.005704609730413982, 0.17306318642139168, -0.17871449356898667, 0.06624524940603546, 0.1623115459590086, 0.036060081592794245, 0.1471677815807717, 0.10487896154767701, 0.019761823776311107, 0.1853963247367314, -0.061224642077494146, 0.04874955036544374, -0.40496315245649644, -0.19740780819473522, -0.09474801381251642, 0.19826109171179787, -0.08548232298302796, -0.16707068353093096, 0.3729870348104409, 0.11861888395090188, 0.1759201483268823, 0.17566327202532972, 0.22713650974245475, 0.03774020242105637, 0.017978175170719625, 0.02466990585172815, 0.12607687721236807, 0.24726036800670304, -0.07704607805104129, -0.0993957138819886, -0.05516316035895475, 0.20877965514415076] |
1,802.08098 | Bloch functions on the unit ball of a Banach space | The space of Bloch functions on bounded symmetric domains is extended by
considering Bloch functions $f$ on the unit ball $B_E$ of finite and infinite
dimensional complex Banach spaces in two different ways: by extending the
classical Bloch space considering the boundness of $(1-\|x\|^2) \|f'(x)\|$ on
$B_E$ and by preserving the invariance of the correspondiing seminorm when we
compose with automorphisms $\phi$ of $B_E$. We study the connection between
these spaces proving that they are different in general and prove that all
bounded analytic functions on $B_{E}$ are Bloch functions in both ways.
| math.FA | the space of bloch functions on bounded symmetric domains is extended by considering bloch functions f on the unit ball b_e of finite and infinite dimensional complex banach spaces in two different ways by extending the classical bloch space considering the boundness of 1x2 fx on b_e and by preserving the invariance of the correspondiing seminorm when we compose with automorphisms phi of b_e we study the connection between these spaces proving that they are different in general and prove that all bounded analytic functions on b_e are bloch functions in both ways | [['the', 'space', 'of', 'bloch', 'functions', 'on', 'bounded', 'symmetric', 'domains', 'is', 'extended', 'by', 'considering', 'bloch', 'functions', 'f', 'on', 'the', 'unit', 'ball', 'b_e', 'of', 'finite', 'and', 'infinite', 'dimensional', 'complex', 'banach', 'spaces', 'in', 'two', 'different', 'ways', 'by', 'extending', 'the', 'classical', 'bloch', 'space', 'considering', 'the', 'boundness', 'of', '1x2', 'fx', 'on', 'b_e', 'and', 'by', 'preserving', 'the', 'invariance', 'of', 'the', 'correspondiing', 'seminorm', 'when', 'we', 'compose', 'with', 'automorphisms', 'phi', 'of', 'b_e', 'we', 'study', 'the', 'connection', 'between', 'these', 'spaces', 'proving', 'that', 'they', 'are', 'different', 'in', 'general', 'and', 'prove', 'that', 'all', 'bounded', 'analytic', 'functions', 'on', 'b_e', 'are', 'bloch', 'functions', 'in', 'both', 'ways']] | [-0.16402972088721784, 0.16494161223122122, -0.03310275275219718, 0.08167331685620846, -0.04781574082216653, -0.051389003607808896, 0.0021306980279800687, 0.40809947151042847, -0.30598955301810865, -0.18125405917753992, 0.09751849182952277, -0.25800256698351837, -0.1390661469612615, 0.22831091014465885, -0.05428719589405734, 0.04246202437207103, -0.02346980108110153, 0.035993431927636266, -0.15506492537552613, -0.289440312564535, 0.44034678595768206, -0.11088220689081303, 0.20474119107846334, 0.024928051148257826, 0.10350109730422011, 0.048883266721690154, -0.02170582733157536, -0.008171740634007501, -0.15980194110765614, 0.15678732264179573, 0.22072489462468936, 0.07206878449980413, 0.2806306755595395, -0.41438332898542285, -0.18265708094543737, 0.14598643081262708, 0.10279033427713843, -0.05236370931379497, 0.024533768607121285, -0.3111908137595848, 0.07324492651969194, -0.07480241266160231, -0.11672152248818589, -0.11345903566309615, 0.0432547727883186, 0.07904877872509963, -0.2301670007114096, 0.022912275501648368, 0.10571951828087153, 0.08036222746190817, -0.14637466085791265, -0.10779756050349375, -0.058052042038584856, 0.09512522978532259, 0.0005717181028676746, 0.10299456819041591, 0.060429727046183594, -0.03845707039228886, -0.0926860388489845, 0.34498270507901907, -0.058789180889067684, -0.3133865241366236, 0.16530104533202297, -0.2427013278786984, -0.09502497331603714, 0.039156877035882484, 0.13122113873048322, 0.13593990890734384, -0.04665153143429526, 0.24060484689834993, -0.10835554770639409, 0.07703913434069483, 0.1441848365407761, 0.03879235697082629, 0.13913848460398856, 0.030749243742320687, 0.13050756202162872, 0.1589962492150295, 0.021484835528890075, -0.12887255267781692, -0.3366650231182575, -0.13279100782212638, -0.19477661904681515, 0.06984280192536181, -0.14088324547961034, -0.17044636641588548, 0.401233787395303, -0.0008238499551383859, 0.19608894713303965, 0.08585058045371072, 0.22762770424900658, 0.11755957174033899, 0.053236200236310455, 0.057181684482518744, 0.1678500870526161, 0.15323676694559096, 0.00899578470473542, -0.16381615344131284, -0.038250955995982105, 0.14918741121294696] |
1,802.08099 | Zak phase and band inversion in dimerized one-dimensional locally
resonant metamaterials | Zak phase, which refers to the Berry's phase picked up by a particle moving
across the Brillouin zone, characterizes the topological properties of Bloch
bands in one-dimensional periodic system. Here the Zak phase in dimerized
one-dimensional locally resonant metamaterials is investigated. It is found
that there are some singular points in the bulk band across which the Bloch
states contribute {\pi} to the Zak phase, whereas while in the rest of the band
the contribution is nearly zero. These singular points associated with zero
reflection are caused by two different mechanisms: the dimerization-independent
anti-resonating of each branch, and the dimerization-dependent destructive
interference in multiple backscattering. The structure undergoes a topological
transition point in the band structure where the band inverts and the Zak
phase, which is determined by the numbers of singular points in the bulk band,
changes following a shift in dimerization parameter. Finally, the interface
state between two dimerized metamaterial structures with different topological
property in the first band gap is demonstrated experimentally. The
quasi-one-dimensional configuration of the system allows one to explore
topology-inspired new methods and applications in the sub-wavelength scale.
| cond-mat.mes-hall physics.app-ph | zak phase which refers to the berrys phase picked up by a particle moving across the brillouin zone characterizes the topological properties of bloch bands in onedimensional periodic system here the zak phase in dimerized onedimensional locally resonant metamaterials is investigated it is found that there are some singular points in the bulk band across which the bloch states contribute pi to the zak phase whereas while in the rest of the band the contribution is nearly zero these singular points associated with zero reflection are caused by two different mechanisms the dimerizationindependent antiresonating of each branch and the dimerizationdependent destructive interference in multiple backscattering the structure undergoes a topological transition point in the band structure where the band inverts and the zak phase which is determined by the numbers of singular points in the bulk band changes following a shift in dimerization parameter finally the interface state between two dimerized metamaterial structures with different topological property in the first band gap is demonstrated experimentally the quasionedimensional configuration of the system allows one to explore topologyinspired new methods and applications in the subwavelength scale | [['zak', 'phase', 'which', 'refers', 'to', 'the', 'berrys', 'phase', 'picked', 'up', 'by', 'a', 'particle', 'moving', 'across', 'the', 'brillouin', 'zone', 'characterizes', 'the', 'topological', 'properties', 'of', 'bloch', 'bands', 'in', 'onedimensional', 'periodic', 'system', 'here', 'the', 'zak', 'phase', 'in', 'dimerized', 'onedimensional', 'locally', 'resonant', 'metamaterials', 'is', 'investigated', 'it', 'is', 'found', 'that', 'there', 'are', 'some', 'singular', 'points', 'in', 'the', 'bulk', 'band', 'across', 'which', 'the', 'bloch', 'states', 'contribute', 'pi', 'to', 'the', 'zak', 'phase', 'whereas', 'while', 'in', 'the', 'rest', 'of', 'the', 'band', 'the', 'contribution', 'is', 'nearly', 'zero', 'these', 'singular', 'points', 'associated', 'with', 'zero', 'reflection', 'are', 'caused', 'by', 'two', 'different', 'mechanisms', 'the', 'dimerizationindependent', 'antiresonating', 'of', 'each', 'branch', 'and', 'the', 'dimerizationdependent', 'destructive', 'interference', 'in', 'multiple', 'backscattering', 'the', 'structure', 'undergoes', 'a', 'topological', 'transition', 'point', 'in', 'the', 'band', 'structure', 'where', 'the', 'band', 'inverts', 'and', 'the', 'zak', 'phase', 'which', 'is', 'determined', 'by', 'the', 'numbers', 'of', 'singular', 'points', 'in', 'the', 'bulk', 'band', 'changes', 'following', 'a', 'shift', 'in', 'dimerization', 'parameter', 'finally', 'the', 'interface', 'state', 'between', 'two', 'dimerized', 'metamaterial', 'structures', 'with', 'different', 'topological', 'property', 'in', 'the', 'first', 'band', 'gap', 'is', 'demonstrated', 'experimentally', 'the', 'quasionedimensional', 'configuration', 'of', 'the', 'system', 'allows', 'one', 'to', 'explore', 'topologyinspired', 'new', 'methods', 'and', 'applications', 'in', 'the', 'subwavelength', 'scale']] | [-0.23493480765674676, 0.21542171721424286, -0.06833690255621655, 0.0035610409789822166, -0.0371403536423006, -0.14285942181401576, 0.09682422506076464, 0.38493211848868264, -0.32870975616226333, -0.23128038721366062, 0.039017854535227846, -0.2929146667335267, -0.19259617748256358, 0.13619128829191646, 0.008187362925511681, 0.0525826878949172, -0.019450648786086176, -0.015057571309929093, -0.10869221683177684, -0.1478333707271506, 0.3646653637962623, -0.038410561019554736, 0.31205962738280907, 0.0425378365157586, 0.008421369576050589, -0.010240233718529149, 0.0687224850187906, -0.021173864168425403, -0.11179063331692304, 0.04195028346928464, 0.26564491741462715, -0.07703032686582043, 0.1901292176425664, -0.3922228607556058, -0.20283634431867137, 0.06793944519659918, 0.1280522449507973, 0.1024425645876262, -0.013100272013495366, -0.33069710184095635, 0.057775000078577755, -0.09644501923014306, -0.14125669974471547, -0.03464572476287786, -0.006042645587068465, -0.0414180070811805, -0.17025365856696023, 0.05612931654581593, 0.050393982507133235, 0.050184058744667304, -0.07999043012484132, -0.06903306046345582, -0.10869115862426244, 0.11573802749108937, 0.03648669902985502, 0.006137801949969596, 0.0810428059530548, -0.07750189420379078, -0.1144915391102485, 0.41280488600734516, -0.028048159659697883, -0.14464495577509903, 0.17053027471734417, -0.19335284790075902, -0.042856229588182436, 0.23914973771768724, 0.08091342265640075, 0.06189019742111365, -0.08998741355478868, 0.09871679648349527, 0.003935111722805433, 0.15030634310921112, 0.07707854255438885, 0.07156944739334803, 0.24648210698376513, 0.13759954513774977, 0.09309965720296734, 0.166327041387558, -0.13638492228379215, -0.11011090859667294, -0.2682370150490897, -0.1806227452173415, -0.25759115032204943, -0.023710801501551436, -0.062284218232525744, -0.22604098237999198, 0.47181729612768525, 0.10674729065762625, 0.22037733451385672, -0.059498953070012954, 0.2502336727662219, 0.13527667912518762, 0.05318711280771014, 0.06007181080575619, 0.2863878733214935, 0.13339126016427244, 0.10161290747605058, -0.25595382938627154, -0.0036630561937474543, 0.05479494838509709] |
1,802.081 | Negative differential resistance in Van der Waals heterostructures due
to moir\'{e}-induced spectral reconstruction | Formation of moir\'{e} superlattices is common in Van der Waals
heterostructures as a result of the mismatch between lattice constants and
misalignment of crystallographic directions of the constituent two-dimensional
crystals. We discuss theoretically electron transport in a Van der Waals
tunnelling transistor in which one of the electrodes is made of two crystals
forming a moir\'{e} superlattice at their interface. By investigating
structures containing either the aligned graphene/hexagonal boron nitride
heterostructure or twisted bilayer graphene, we show that negative differential
resistance is possible in such transistors as a consequence of the
superlattice-induced changes in the electronic density of states and without
the need of momentum conserving tunnelling present in high-quality exfoliated
devices.
| cond-mat.mes-hall | formation of moire superlattices is common in van der waals heterostructures as a result of the mismatch between lattice constants and misalignment of crystallographic directions of the constituent twodimensional crystals we discuss theoretically electron transport in a van der waals tunnelling transistor in which one of the electrodes is made of two crystals forming a moire superlattice at their interface by investigating structures containing either the aligned graphenehexagonal boron nitride heterostructure or twisted bilayer graphene we show that negative differential resistance is possible in such transistors as a consequence of the superlatticeinduced changes in the electronic density of states and without the need of momentum conserving tunnelling present in highquality exfoliated devices | [['formation', 'of', 'moire', 'superlattices', 'is', 'common', 'in', 'van', 'der', 'waals', 'heterostructures', 'as', 'a', 'result', 'of', 'the', 'mismatch', 'between', 'lattice', 'constants', 'and', 'misalignment', 'of', 'crystallographic', 'directions', 'of', 'the', 'constituent', 'twodimensional', 'crystals', 'we', 'discuss', 'theoretically', 'electron', 'transport', 'in', 'a', 'van', 'der', 'waals', 'tunnelling', 'transistor', 'in', 'which', 'one', 'of', 'the', 'electrodes', 'is', 'made', 'of', 'two', 'crystals', 'forming', 'a', 'moire', 'superlattice', 'at', 'their', 'interface', 'by', 'investigating', 'structures', 'containing', 'either', 'the', 'aligned', 'graphenehexagonal', 'boron', 'nitride', 'heterostructure', 'or', 'twisted', 'bilayer', 'graphene', 'we', 'show', 'that', 'negative', 'differential', 'resistance', 'is', 'possible', 'in', 'such', 'transistors', 'as', 'a', 'consequence', 'of', 'the', 'superlatticeinduced', 'changes', 'in', 'the', 'electronic', 'density', 'of', 'states', 'and', 'without', 'the', 'need', 'of', 'momentum', 'conserving', 'tunnelling', 'present', 'in', 'highquality', 'exfoliated', 'devices']] | [-0.24343576461875013, 0.15825132179140514, -0.01936626833880187, -0.026006653598285214, 0.005526154915319889, -0.18312417268420436, 0.0663135384009885, 0.4255180946784094, -0.2815847062405997, -0.28063612958482864, -0.10068522799286127, -0.33665167533659507, -0.19649734836379398, 0.18082615333800536, 0.02512040639079974, 0.057532133966950436, -0.00026051231959302513, -0.15318580540562315, -0.07940220852625705, -0.21889151573694626, 0.2997236705601348, 0.011592320361939659, 0.30584378658594297, 0.11057156931825116, 0.041658725859763636, 0.028578855292705287, 0.15018025358274048, 0.021592567791230977, -0.20800120348530982, 0.1139493854311695, 0.2387123023924817, -0.22311963815341837, 0.23416364289421057, -0.5245532070985064, -0.17805110937583127, -0.07910901666868345, 0.12225164633959398, 0.19059158615397923, -0.11294493418868765, -0.23340577541135385, 0.07248769727967945, -0.16005743309298331, -0.08298163146108502, -0.04172720921009646, -0.01780532814986405, 0.04942975285354935, -0.17851416624450525, 0.11086082498409919, 0.025344942700550228, 0.05807130105261292, -0.10101448765908572, -0.10571250033490287, -0.12651025545034958, 0.051789695465621274, -0.014676918182106289, -0.011027282773284242, 0.20979387313283432, -0.11813379309855268, -0.137537155632994, 0.4262894402158314, -0.0390780455033694, -0.12284973607165739, 0.15191505752175413, -0.17193148013705337, -0.042299565692831366, 0.07244922321634865, 0.07737815624568611, 0.060938455763139894, -0.14512903098615684, 0.0966584268306698, -0.016844822597964333, 0.1544935665603719, 0.21735220580012538, 0.08907153910175632, 0.30955870752222836, 0.19564216614318347, 0.04040088934873763, 0.12063813328443627, -0.09887935512233526, 0.012806160424848454, -0.18194889518365795, -0.2558048869499804, -0.25535875242868705, 0.13575441455967457, -0.05631413406782875, -0.3233602170034179, 0.39235486660618335, 0.07977205252141825, 0.18184116650497475, -0.11756728353274022, 0.24698356089564705, 0.03989683081454132, 0.1223388525104383, -0.06889203297240394, 0.24547249607608787, 0.16395578887022566, 0.10094546006959197, -0.2399986397732781, 0.06545722337822164, -0.0022491687206119032] |
1,802.08101 | Homotopical Quantum Field Theory | Algebraic quantum field theory and prefactorization algebra are two
mathematical approaches to quantum field theory. In this monograph, using a new
coend definition of the Boardman-Vogt construction of a colored operad, we
define homotopy algebraic quantum field theories and homotopy prefactorization
algebras and investigate their homotopy coherent structures. Homotopy coherent
diagrams, homotopy inverses, A-infinity-algebras, E-infinity-algebras, and
E-infinity-modules arise naturally in this context. In particular, each
homotopy algebraic quantum field theory has the structure of a homotopy
coherent diagram of A-infinity-algebras and satisfies a homotopy coherent
version of the causality axiom. When the time-slice axiom is defined for
algebraic quantum field theory, a homotopy coherent version of the time-slice
axiom is satisfied by each homotopy algebraic quantum field theory. Over each
topological space, every homotopy prefactorization algebra has the structure of
a homotopy coherent diagram of E-infinity-modules over an E-infinity-algebra.
To compare the two approaches, we construct a comparison morphism from the
colored operad for (homotopy) prefactorization algebras to the colored operad
for (homotopy) algebraic quantum field theories and study the induced
adjunctions on algebras.
| math-ph math.AT math.CT math.MP | algebraic quantum field theory and prefactorization algebra are two mathematical approaches to quantum field theory in this monograph using a new coend definition of the boardmanvogt construction of a colored operad we define homotopy algebraic quantum field theories and homotopy prefactorization algebras and investigate their homotopy coherent structures homotopy coherent diagrams homotopy inverses ainfinityalgebras einfinityalgebras and einfinitymodules arise naturally in this context in particular each homotopy algebraic quantum field theory has the structure of a homotopy coherent diagram of ainfinityalgebras and satisfies a homotopy coherent version of the causality axiom when the timeslice axiom is defined for algebraic quantum field theory a homotopy coherent version of the timeslice axiom is satisfied by each homotopy algebraic quantum field theory over each topological space every homotopy prefactorization algebra has the structure of a homotopy coherent diagram of einfinitymodules over an einfinityalgebra to compare the two approaches we construct a comparison morphism from the colored operad for homotopy prefactorization algebras to the colored operad for homotopy algebraic quantum field theories and study the induced adjunctions on algebras | [['algebraic', 'quantum', 'field', 'theory', 'and', 'prefactorization', 'algebra', 'are', 'two', 'mathematical', 'approaches', 'to', 'quantum', 'field', 'theory', 'in', 'this', 'monograph', 'using', 'a', 'new', 'coend', 'definition', 'of', 'the', 'boardmanvogt', 'construction', 'of', 'a', 'colored', 'operad', 'we', 'define', 'homotopy', 'algebraic', 'quantum', 'field', 'theories', 'and', 'homotopy', 'prefactorization', 'algebras', 'and', 'investigate', 'their', 'homotopy', 'coherent', 'structures', 'homotopy', 'coherent', 'diagrams', 'homotopy', 'inverses', 'ainfinityalgebras', 'einfinityalgebras', 'and', 'einfinitymodules', 'arise', 'naturally', 'in', 'this', 'context', 'in', 'particular', 'each', 'homotopy', 'algebraic', 'quantum', 'field', 'theory', 'has', 'the', 'structure', 'of', 'a', 'homotopy', 'coherent', 'diagram', 'of', 'ainfinityalgebras', 'and', 'satisfies', 'a', 'homotopy', 'coherent', 'version', 'of', 'the', 'causality', 'axiom', 'when', 'the', 'timeslice', 'axiom', 'is', 'defined', 'for', 'algebraic', 'quantum', 'field', 'theory', 'a', 'homotopy', 'coherent', 'version', 'of', 'the', 'timeslice', 'axiom', 'is', 'satisfied', 'by', 'each', 'homotopy', 'algebraic', 'quantum', 'field', 'theory', 'over', 'each', 'topological', 'space', 'every', 'homotopy', 'prefactorization', 'algebra', 'has', 'the', 'structure', 'of', 'a', 'homotopy', 'coherent', 'diagram', 'of', 'einfinitymodules', 'over', 'an', 'einfinityalgebra', 'to', 'compare', 'the', 'two', 'approaches', 'we', 'construct', 'a', 'comparison', 'morphism', 'from', 'the', 'colored', 'operad', 'for', 'homotopy', 'prefactorization', 'algebras', 'to', 'the', 'colored', 'operad', 'for', 'homotopy', 'algebraic', 'quantum', 'field', 'theories', 'and', 'study', 'the', 'induced', 'adjunctions', 'on', 'algebras']] | [-0.20555202458875582, 0.10402405579815796, -0.15200085398083663, 0.14753050912609872, -0.12828857875703012, -0.16769149398485966, -0.02037956182612106, 0.32607012167572974, -0.4226748433183221, -0.18056608198539298, 0.03815073061200297, -0.18707138999255704, -0.16145848216050687, 0.14289662610082066, -0.19347777055192958, -0.07372732915751198, 0.03000895377686795, 0.11854038229486083, -0.07193368524586892, -0.22478723936330747, 0.44858698811354664, -0.05735766137196847, 0.22679725176195087, -0.007462037245140356, 0.13712202359593528, 0.022332360252039506, 0.004021126367425656, 0.060557242770343744, -0.17391977172947543, 0.14692490430110516, 0.3482311826021246, 0.07870377198115046, 0.18810576881172464, -0.3705544261609355, -0.11010745995907414, 0.11369772521669373, 0.13635447606382728, 0.08015447953606353, -0.003265194154536242, -0.3212030807290884, 0.11113994517569047, -0.2241045645054649, -0.07588412571314941, -0.08520397300804582, 0.025827837742947262, -0.022161112639450413, -0.17465528228169527, -0.11405910668339964, 0.06525476521209758, 0.2083471078740652, -0.07108202028252622, 0.01726463980945375, -0.07233019670307198, 0.05927363634605974, -0.070806317291606, 0.059677444123115174, 0.15136153467567912, -0.1349208164987538, -0.236479146800497, 0.3744175064322703, -0.015490237763151527, -0.17485426463844145, 0.10489276241620674, -0.09339658099445788, -0.23465288330746048, 0.12214015859233983, -0.05697821668513557, 0.14010024864418322, -0.029475209023546674, 0.2923200731199947, -0.06579761319273315, 0.08300327938050031, 0.10749072137507884, 0.0537641895661021, 0.16004692759803113, 0.07811095486942898, 0.038627176685943544, 0.1505939834039001, 0.06524037172168712, -0.19036273349021726, -0.3408969293403275, -0.19451181247765334, -0.0486503934225766, 0.16775124654557336, -0.14691792566223097, -0.25776246625053534, 0.42086000890635394, 0.11221117789254469, 0.06575840439917931, 0.15083901260102936, 0.27133964563528185, 0.060076670562300614, 0.05746380242053419, -0.047206771316225915, 0.15669582337277996, 0.3817021739135003, 0.014009329505429111, -0.0919300421483486, -0.08969242704402217, 0.31344664401155625] |
1,802.08102 | Understanding the Performance of Ceph Block Storage for Hyper-Converged
Cloud with All Flash Storage | Hyper-converged cloud refers to an architecture that an operator runs compute
and storage services on the same set of physical servers. Although the
hyper-converged design comes with a number of benefits, it makes crucial
operational tasks, such as capacity planning and cost analysis, fairly
complicated. The problem becomes more onerous if we consider a complex
distributed system, such as Ceph, for the cloud with the proliferation of SSD
drives. In this paper, we aim to answer some of these questions based on
comprehensive microbenchmarks, and consequently better understand the behavior
of Ceph in a hyper-converged cloud with all-flash storage. We reported our
findings based on the study, devised a cost model and compared the cost of
hyper-converged architecture with dedicated storage architecture. Additionally
we summarized our experience based on the interactions with many teams at AT&T
in the past couple of years.
| cs.DC | hyperconverged cloud refers to an architecture that an operator runs compute and storage services on the same set of physical servers although the hyperconverged design comes with a number of benefits it makes crucial operational tasks such as capacity planning and cost analysis fairly complicated the problem becomes more onerous if we consider a complex distributed system such as ceph for the cloud with the proliferation of ssd drives in this paper we aim to answer some of these questions based on comprehensive microbenchmarks and consequently better understand the behavior of ceph in a hyperconverged cloud with allflash storage we reported our findings based on the study devised a cost model and compared the cost of hyperconverged architecture with dedicated storage architecture additionally we summarized our experience based on the interactions with many teams at att in the past couple of years | [['hyperconverged', 'cloud', 'refers', 'to', 'an', 'architecture', 'that', 'an', 'operator', 'runs', 'compute', 'and', 'storage', 'services', 'on', 'the', 'same', 'set', 'of', 'physical', 'servers', 'although', 'the', 'hyperconverged', 'design', 'comes', 'with', 'a', 'number', 'of', 'benefits', 'it', 'makes', 'crucial', 'operational', 'tasks', 'such', 'as', 'capacity', 'planning', 'and', 'cost', 'analysis', 'fairly', 'complicated', 'the', 'problem', 'becomes', 'more', 'onerous', 'if', 'we', 'consider', 'a', 'complex', 'distributed', 'system', 'such', 'as', 'ceph', 'for', 'the', 'cloud', 'with', 'the', 'proliferation', 'of', 'ssd', 'drives', 'in', 'this', 'paper', 'we', 'aim', 'to', 'answer', 'some', 'of', 'these', 'questions', 'based', 'on', 'comprehensive', 'microbenchmarks', 'and', 'consequently', 'better', 'understand', 'the', 'behavior', 'of', 'ceph', 'in', 'a', 'hyperconverged', 'cloud', 'with', 'allflash', 'storage', 'we', 'reported', 'our', 'findings', 'based', 'on', 'the', 'study', 'devised', 'a', 'cost', 'model', 'and', 'compared', 'the', 'cost', 'of', 'hyperconverged', 'architecture', 'with', 'dedicated', 'storage', 'architecture', 'additionally', 'we', 'summarized', 'our', 'experience', 'based', 'on', 'the', 'interactions', 'with', 'many', 'teams', 'at', 'att', 'in', 'the', 'past', 'couple', 'of', 'years']] | [-0.1401259623407255, 0.01712239670922199, -0.05166081063864215, 0.011820001700650376, -0.0630234819476191, -0.13564848612574204, 0.08736692213955086, 0.369451340268248, -0.24278364166236993, -0.32881350017769234, 0.10272310316828276, -0.27833526737948644, -0.15011900674033596, 0.2127394506455281, -0.1056513008595982, 0.07094283458698068, 0.08681865604299212, 0.04583715748297654, -0.01601290388457464, -0.27044418592392927, 0.2996863217657091, 0.10239100246362283, 0.2866092473465267, 0.07586949311268949, 0.07192139296280466, -0.0006324153928033693, -0.035635911108611126, -0.01531590988964472, -0.07742462473829043, 0.16442868990321893, 0.24757246889541268, 0.1857492496771082, 0.30732283688766854, -0.487761210256689, -0.1679498099566816, 0.07739924698490912, 0.1300736193374639, 0.03415500333296581, -0.0452836859946895, -0.22737089951168482, 0.06751595957788416, -0.2196029958997289, -0.08854746363047038, -0.08130299733382114, 0.019140682022520145, 0.011267172565772263, -0.2533524527684228, -0.022961868668421054, 0.013581602466882954, 0.062235996251742184, -0.059210601669382044, -0.11557669730604508, 0.03153409206465831, 0.1348379071314924, 0.020025478623742408, 0.02085892825705511, 0.1279083992957964, -0.13799418740361458, -0.12373872396772281, 0.4135333619303477, -0.007121548773130586, -0.15655272918536892, 0.22558394743910085, -0.054007365637209634, -0.1668507075330741, 0.06849491553099066, 0.22408358512682394, 0.08896024006707462, -0.1516764899027127, 0.041613859176950554, -0.0198837407851513, 0.1833195509553008, 0.004670460217773363, 0.07155583818233244, 0.17779853455000885, 0.26675743035952443, 0.08934566565472829, 0.15710478445226458, -0.0502524262549959, -0.13711486318686478, -0.2272395674782005, -0.1598633703657649, -0.16444927415626884, 0.028398625276372835, -0.06121447786129683, -0.13945932429723285, 0.3675753613868335, 0.20312805581365673, 0.20359409393900088, 0.07534115577221547, 0.3449305997321933, 0.05169948711296508, 0.11289163237490074, 0.13591855130827343, 0.1531851890598978, 0.011044211901425512, 0.1763228773800197, -0.2018014887957768, 0.08414929095203956, -0.0019890881068906157] |
1,802.08103 | Global entanglement and quantum phase transitions in the transverse XY
Heisenberg chain | We provide a study of various quantum phase transitions occurring in the XY
Heisenberg chain in a transverse magnetic field using the Meyer-Wallach (MW)
measure of (global) entanglement. Such a measure, while being readily
evaluated, is a multipartite measure of entanglement as opposed to more
commonly used bipartite measures. Consequently, we obtain analytic expression
of the measure for finite-size systems and show that it can be used to obtain
critical exponents via finite-size scaling with great accuracy for the Ising
universality class. We also calculate an analytic expression for the isotropic
(XX) model and show that global entanglement can precisely identify the
level-crossing points. The critical exponent for the isotropic transition is
obtained exactly from an analytic expression for global entanglement in the
thermodynamic limit. Next, the general behavior of the measure is calculated in
the thermodynamic limit considering the important role of symmetries for this
limit. The so-called oscillatory transition in the ferromagnetic regime can
only be characterized by the thermodynamic limit where global entanglement is
shown to be zero on the transition curve. Finally, the anisotropic transition
is explored where it is shown that global entanglement exhibits an interesting
behavior in the finite-size limit. In the thermodynamic limit, we show that
global entanglement shows a cusp singularity across the Ising and anisotropic
transition, while showing non-analytic behavior at the XX multicritical point.
It is concluded that global entanglement, despite its relative simplicity, can
be used to identify all the rich structure of the ground-state Heisenberg
chain.
| cond-mat.stat-mech quant-ph | we provide a study of various quantum phase transitions occurring in the xy heisenberg chain in a transverse magnetic field using the meyerwallach mw measure of global entanglement such a measure while being readily evaluated is a multipartite measure of entanglement as opposed to more commonly used bipartite measures consequently we obtain analytic expression of the measure for finitesize systems and show that it can be used to obtain critical exponents via finitesize scaling with great accuracy for the ising universality class we also calculate an analytic expression for the isotropic xx model and show that global entanglement can precisely identify the levelcrossing points the critical exponent for the isotropic transition is obtained exactly from an analytic expression for global entanglement in the thermodynamic limit next the general behavior of the measure is calculated in the thermodynamic limit considering the important role of symmetries for this limit the socalled oscillatory transition in the ferromagnetic regime can only be characterized by the thermodynamic limit where global entanglement is shown to be zero on the transition curve finally the anisotropic transition is explored where it is shown that global entanglement exhibits an interesting behavior in the finitesize limit in the thermodynamic limit we show that global entanglement shows a cusp singularity across the ising and anisotropic transition while showing nonanalytic behavior at the xx multicritical point it is concluded that global entanglement despite its relative simplicity can be used to identify all the rich structure of the groundstate heisenberg chain | [['we', 'provide', 'a', 'study', 'of', 'various', 'quantum', 'phase', 'transitions', 'occurring', 'in', 'the', 'xy', 'heisenberg', 'chain', 'in', 'a', 'transverse', 'magnetic', 'field', 'using', 'the', 'meyerwallach', 'mw', 'measure', 'of', 'global', 'entanglement', 'such', 'a', 'measure', 'while', 'being', 'readily', 'evaluated', 'is', 'a', 'multipartite', 'measure', 'of', 'entanglement', 'as', 'opposed', 'to', 'more', 'commonly', 'used', 'bipartite', 'measures', 'consequently', 'we', 'obtain', 'analytic', 'expression', 'of', 'the', 'measure', 'for', 'finitesize', 'systems', 'and', 'show', 'that', 'it', 'can', 'be', 'used', 'to', 'obtain', 'critical', 'exponents', 'via', 'finitesize', 'scaling', 'with', 'great', 'accuracy', 'for', 'the', 'ising', 'universality', 'class', 'we', 'also', 'calculate', 'an', 'analytic', 'expression', 'for', 'the', 'isotropic', 'xx', 'model', 'and', 'show', 'that', 'global', 'entanglement', 'can', 'precisely', 'identify', 'the', 'levelcrossing', 'points', 'the', 'critical', 'exponent', 'for', 'the', 'isotropic', 'transition', 'is', 'obtained', 'exactly', 'from', 'an', 'analytic', 'expression', 'for', 'global', 'entanglement', 'in', 'the', 'thermodynamic', 'limit', 'next', 'the', 'general', 'behavior', 'of', 'the', 'measure', 'is', 'calculated', 'in', 'the', 'thermodynamic', 'limit', 'considering', 'the', 'important', 'role', 'of', 'symmetries', 'for', 'this', 'limit', 'the', 'socalled', 'oscillatory', 'transition', 'in', 'the', 'ferromagnetic', 'regime', 'can', 'only', 'be', 'characterized', 'by', 'the', 'thermodynamic', 'limit', 'where', 'global', 'entanglement', 'is', 'shown', 'to', 'be', 'zero', 'on', 'the', 'transition', 'curve', 'finally', 'the', 'anisotropic', 'transition', 'is', 'explored', 'where', 'it', 'is', 'shown', 'that', 'global', 'entanglement', 'exhibits', 'an', 'interesting', 'behavior', 'in', 'the', 'finitesize', 'limit', 'in', 'the', 'thermodynamic', 'limit', 'we', 'show', 'that', 'global', 'entanglement', 'shows', 'a', 'cusp', 'singularity', 'across', 'the', 'ising', 'and', 'anisotropic', 'transition', 'while', 'showing', 'nonanalytic', 'behavior', 'at', 'the', 'xx', 'multicritical', 'point', 'it', 'is', 'concluded', 'that', 'global', 'entanglement', 'despite', 'its', 'relative', 'simplicity', 'can', 'be', 'used', 'to', 'identify', 'all', 'the', 'rich', 'structure', 'of', 'the', 'groundstate', 'heisenberg', 'chain']] | [-0.12693455770673726, 0.14419086186200963, -0.10938652923505288, 0.11521318010448839, 0.013148910096318897, -0.15106233064415714, 0.029523491619094726, 0.3366681586170847, -0.2434264906051178, -0.21418158261616144, 0.08575672029063196, -0.2998251206741007, -0.14907040903645177, 0.19212867013805907, 0.030760786042646353, 0.08163235438851482, -0.00554125098560396, 0.08947164651427526, -0.09585118013520484, -0.17664670500615162, 0.3058479662173458, 0.015789839260246335, 0.32640591473788055, 0.0887389415837524, 0.05847138041134449, -0.014240561357338822, 0.08632924098257659, 0.05080665556541193, -0.1899073906416825, 0.04668036725507268, 0.25055659291073457, 0.04078662990885336, 0.16792710122535937, -0.3551597928951284, -0.22449067373564768, 0.14752271270281786, 0.17107297922953993, 0.135474292926618, 0.015292883212403525, -0.29445668053062213, 0.047424837884430034, -0.1706611979527459, -0.16775684320976236, -0.13992641194378055, 0.021698260053169854, -0.00938795234739495, -0.26410433150111556, 0.10850906095384422, 0.084939216031143, 0.09268790206284218, -0.023374612971242787, -0.019893736468211208, -0.04385997737793537, 0.16683334827370522, 0.04046313310907628, 0.04174297648170332, 0.118844878679562, -0.12300929192908018, -0.09518135369627646, 0.3718827536983055, -0.07481834780816327, -0.16995168545878597, 0.16700066546975229, -0.19490774860042298, -0.14322660666056758, 0.09113650822884313, 0.09400566270004117, 0.06867714930370811, -0.1581532315826588, 0.10971049124289552, -0.0034784959026447106, 0.15532183179628542, 0.010195511443007196, 0.042926641696765494, 0.20872303836738632, 0.12507769399164845, 0.09107263379489942, 0.23978471481654373, -0.06614924150856114, -0.17046948687376215, -0.288584504591962, -0.18266815367889883, -0.2469877548334602, 0.1062455404331089, -0.15145142806390904, -0.1780494576695116, 0.38570788797111283, 0.15792938353069252, 0.19967167602942115, 0.03937912309031104, 0.21204166114518058, 0.17929422676764173, 0.03317268961907229, 0.07805974175590241, 0.286411237831588, 0.11779097679086149, 0.06610812750154911, -0.25856219094167765, 0.0595905996367125, 0.08115322362901943] |
1,802.08104 | Extended Bose-Hubbard Model with dipolar and contact interactions | We study the phase diagram of the one-dimensional boson gas trapped inside an
optical lattice with contact and dipolar interaction taking into account
next-nearest terms for both tunneling and interaction. Using the density matrix
renormalization group, we calculate how the locations of phase transitions
change with increasing dipolar interaction strength for average density $\rho =
1$. Furthermore, we show an emergence of pair-correlated phases for a large
dipolar interaction strength and $\rho \geq 2$, including a supersolid phase
with an incommensurate density wave ordering manifesting the corresponding
spontaneous breaking of the translational symmetry.
| cond-mat.quant-gas | we study the phase diagram of the onedimensional boson gas trapped inside an optical lattice with contact and dipolar interaction taking into account nextnearest terms for both tunneling and interaction using the density matrix renormalization group we calculate how the locations of phase transitions change with increasing dipolar interaction strength for average density rho 1 furthermore we show an emergence of paircorrelated phases for a large dipolar interaction strength and rho geq 2 including a supersolid phase with an incommensurate density wave ordering manifesting the corresponding spontaneous breaking of the translational symmetry | [['we', 'study', 'the', 'phase', 'diagram', 'of', 'the', 'onedimensional', 'boson', 'gas', 'trapped', 'inside', 'an', 'optical', 'lattice', 'with', 'contact', 'and', 'dipolar', 'interaction', 'taking', 'into', 'account', 'nextnearest', 'terms', 'for', 'both', 'tunneling', 'and', 'interaction', 'using', 'the', 'density', 'matrix', 'renormalization', 'group', 'we', 'calculate', 'how', 'the', 'locations', 'of', 'phase', 'transitions', 'change', 'with', 'increasing', 'dipolar', 'interaction', 'strength', 'for', 'average', 'density', 'rho', '1', 'furthermore', 'we', 'show', 'an', 'emergence', 'of', 'paircorrelated', 'phases', 'for', 'a', 'large', 'dipolar', 'interaction', 'strength', 'and', 'rho', 'geq', '2', 'including', 'a', 'supersolid', 'phase', 'with', 'an', 'incommensurate', 'density', 'wave', 'ordering', 'manifesting', 'the', 'corresponding', 'spontaneous', 'breaking', 'of', 'the', 'translational', 'symmetry']] | [-0.2302382569614565, 0.2851201998930027, -0.02597713661531958, 0.028911788300003693, -0.0012599611806723735, -0.11902385269818098, 0.05662639013936986, 0.3873912453570444, -0.24387114081005362, -0.26463877857136336, 0.002576061225820171, -0.29838891780894733, -0.13287146355065962, 0.04088790057753415, 0.1586840169329662, -0.038643267694050853, -0.04808570884431348, 0.018319983217541292, -0.15605122740453226, -0.16536188142946112, 0.30729275575393566, -0.019763670158167573, 0.2764349902433384, 0.11730560086384091, 0.050639276903973005, 0.08617816508099761, 0.09489633574697148, -0.004598344083996894, -0.17266471148468554, 0.017334764223525544, 0.14451326193470185, -0.05347978508950252, 0.15495717965835787, -0.4448593639080291, -0.2121876656386556, 0.11228347953115388, 0.1923318790656555, 0.13651811521824286, -0.06365700446084425, -0.37035853369667643, -0.043799141148591174, -0.22821189824532231, -0.15433305636068564, -0.11002003041136524, 0.05700535231533096, 0.034479048368824726, -0.2881318145411332, 0.1383087182134066, 0.016704660086163683, 0.11472937164311904, -0.11274092210173282, -0.07680286563244527, -0.05843421135796234, 0.09234896951112086, 0.03662610164357592, 0.069209143405517, 0.1363322268804515, -0.18493996530204362, -0.05631009197753409, 0.3954565861140904, -0.08757251755172468, -0.10660979280288777, 0.1665267732358821, -0.1622373434013001, -0.0850265545203634, 0.21343309800747945, 0.1458561719476205, 0.0052746811669076915, -0.05475567533310665, 0.05858087519743055, 0.019755262164202893, 0.2049291072202639, 0.010734576919197065, 0.032069824441113386, 0.2420164261661146, 0.1722625820674812, 0.03710823923187411, 0.15849294136885717, -0.14766890272174193, -0.12106652938983524, -0.30209805488424457, -0.15013976563173143, -0.19869572828199877, 0.020713880284070594, -0.13482383215302, -0.14411472898665006, 0.378103020803436, 0.114216916884407, 0.22049930475085325, 0.006028263596817851, 0.23070835079694085, 0.14135317586909008, 0.024885703526113346, 0.022615458041874936, 0.23395207044466035, 0.1967946938239038, 0.03422788394179762, -0.33512685984454077, -0.004830288786805519, 0.06593580625453994] |
1,802.08105 | Linear complexity of Ding-Helleseth generalized cyclotomic sequences of
order eight | During the last two decades, many kinds of periodic sequences with good
pseudo-random properties have been constructed from classical and generalized
cyclotomic classes, and used as keystreams for stream ciphers and secure
communications. Among them are a family DH-GCS$_{d}$ of generalized cyclotomic
sequences on the basis of Ding and Helleseth's generalized cyclotomy, of length
$pq$ and order $d=\mathrm{gcd}(p-1,q-1)$ for distinct odd primes $p$ and $q$.
The linear complexity (or linear span), as a valuable measure of
unpredictability, is precisely determined for DH-GCS$_{8}$ in this paper. Our
approach is based on Edemskiy and Antonova's computation method with the help
of explicit expressions of Gaussian classical cyclotomic numbers of order $8$.
Our result for $d=8$ is compatible with Yan's low bound $(pq-1)/2$ of the
linear complexity for any order $d$, which means high enough to resist security
attacks of the Berlekamp-Massey algorithm. Finally, we include SageMath codes
to illustrate the validity of our result by examples.
| math.NT cs.CR | during the last two decades many kinds of periodic sequences with good pseudorandom properties have been constructed from classical and generalized cyclotomic classes and used as keystreams for stream ciphers and secure communications among them are a family dhgcs_d of generalized cyclotomic sequences on the basis of ding and helleseths generalized cyclotomy of length pq and order dmathrmgcdp1q1 for distinct odd primes p and q the linear complexity or linear span as a valuable measure of unpredictability is precisely determined for dhgcs_8 in this paper our approach is based on edemskiy and antonovas computation method with the help of explicit expressions of gaussian classical cyclotomic numbers of order 8 our result for d8 is compatible with yans low bound pq12 of the linear complexity for any order d which means high enough to resist security attacks of the berlekampmassey algorithm finally we include sagemath codes to illustrate the validity of our result by examples | [['during', 'the', 'last', 'two', 'decades', 'many', 'kinds', 'of', 'periodic', 'sequences', 'with', 'good', 'pseudorandom', 'properties', 'have', 'been', 'constructed', 'from', 'classical', 'and', 'generalized', 'cyclotomic', 'classes', 'and', 'used', 'as', 'keystreams', 'for', 'stream', 'ciphers', 'and', 'secure', 'communications', 'among', 'them', 'are', 'a', 'family', 'dhgcs_d', 'of', 'generalized', 'cyclotomic', 'sequences', 'on', 'the', 'basis', 'of', 'ding', 'and', 'helleseths', 'generalized', 'cyclotomy', 'of', 'length', 'pq', 'and', 'order', 'dmathrmgcdp1q1', 'for', 'distinct', 'odd', 'primes', 'p', 'and', 'q', 'the', 'linear', 'complexity', 'or', 'linear', 'span', 'as', 'a', 'valuable', 'measure', 'of', 'unpredictability', 'is', 'precisely', 'determined', 'for', 'dhgcs_8', 'in', 'this', 'paper', 'our', 'approach', 'is', 'based', 'on', 'edemskiy', 'and', 'antonovas', 'computation', 'method', 'with', 'the', 'help', 'of', 'explicit', 'expressions', 'of', 'gaussian', 'classical', 'cyclotomic', 'numbers', 'of', 'order', '8', 'our', 'result', 'for', 'd8', 'is', 'compatible', 'with', 'yans', 'low', 'bound', 'pq12', 'of', 'the', 'linear', 'complexity', 'for', 'any', 'order', 'd', 'which', 'means', 'high', 'enough', 'to', 'resist', 'security', 'attacks', 'of', 'the', 'berlekampmassey', 'algorithm', 'finally', 'we', 'include', 'sagemath', 'codes', 'to', 'illustrate', 'the', 'validity', 'of', 'our', 'result', 'by', 'examples']] | [-0.14559451747403285, 0.07088707735434778, -0.0653986012235888, 0.07961701722406606, -0.04671065421693178, -0.16666251823708816, 0.02954669762324114, 0.3063277092516875, -0.27855046087171176, -0.31174542727200566, 0.11509145287296584, -0.23580301166618262, -0.17700651468004328, 0.26861404389539434, -0.07877635797175006, 0.12121719695199784, 0.008088757726835791, 0.057611588788269136, -0.05624955606244102, -0.3350610516185092, 0.32638440369073823, 0.02394525460801339, 0.23762944364618208, 0.001960313642681482, 0.08614924658428896, 0.02222174553301286, -0.031125394054027776, -0.022994628283069342, -0.14326268771814332, 0.15284447445584512, 0.2762796904772168, 0.13739960628555384, 0.25605435213829214, -0.3777200971018976, -0.16562471932077125, 0.12123039154637907, 0.137632832890754, 0.08631619315584996, -0.022070849907420878, -0.22793538875034633, 0.1653174978210528, -0.20235626026358758, -0.12272581439370893, -0.0955202427654955, 0.0411552252575151, 0.09533520792359235, -0.2994024773258905, 0.02875470482693935, 0.09375044923099513, 0.10799968831486546, -0.002650780585984624, -0.13486447661794168, 0.023914631407368124, 0.103439427193292, 0.026953755086602492, 0.004592241627924031, 0.023940352650636154, -0.04252647118158387, -0.16367925361516206, 0.35147197606990654, -0.03460662282894781, -0.17172204674519692, 0.16769945649335766, -0.08419870638691292, -0.15488782518297886, 0.12607194248876358, 0.1633121910051921, 0.11930931665984965, -0.06074489183673585, 0.1040609831616166, -0.05435577006003744, 0.15978283629787304, 0.13618109923019703, 0.07337623749343627, 0.14183736579001857, 0.07649242884252926, 0.029148396926954062, 0.15005773048206056, -0.030056798807227343, -0.07643514625237298, -0.2941907216429811, -0.16035463924817048, -0.1871724681239701, 0.03328181243803654, -0.11653977884241219, -0.1470891666170713, 0.3847497755447654, 0.11169733653534078, 0.14283593326832192, 0.10323194593798395, 0.2761232196699476, 0.07235656020222106, 0.06273545056968499, 0.07350022852069987, 0.1443701895611436, 0.17288298571774913, 0.016642818551485403, -0.14993925152599774, 0.05525329617493962, 0.12139599432703108] |
1,802.08106 | Greedy kernel methods for accelerating implicit integrators for
parametric ODEs | We present a novel acceleration method for the solution of parametric ODEs by
single-step implicit solvers by means of greedy kernel-based surrogate models.
In an offline phase, a set of trajectories is precomputed with a high-accuracy
ODE solver for a selected set of parameter samples, and used to train a kernel
model which predicts the next point in the trajectory as a function of the last
one. This model is cheap to evaluate, and it is used in an online phase for new
parameter samples to provide a good initialization point for the nonlinear
solver of the implicit integrator. The accuracy of the surrogate reflects into
a reduction of the number of iterations until convergence of the solver, thus
providing an overall speedup of the full simulation. Interestingly, in addition
to providing an acceleration, the accuracy of the solution is maintained, since
the ODE solver is still used to guarantee the required precision. Although the
method can be applied to a large variety of solvers and different ODEs, we will
present in details its use with the Implicit Euler method for the solution of
the Burgers equation, which results to be a meaningful test case to demonstrate
the method's features.
| math.NA | we present a novel acceleration method for the solution of parametric odes by singlestep implicit solvers by means of greedy kernelbased surrogate models in an offline phase a set of trajectories is precomputed with a highaccuracy ode solver for a selected set of parameter samples and used to train a kernel model which predicts the next point in the trajectory as a function of the last one this model is cheap to evaluate and it is used in an online phase for new parameter samples to provide a good initialization point for the nonlinear solver of the implicit integrator the accuracy of the surrogate reflects into a reduction of the number of iterations until convergence of the solver thus providing an overall speedup of the full simulation interestingly in addition to providing an acceleration the accuracy of the solution is maintained since the ode solver is still used to guarantee the required precision although the method can be applied to a large variety of solvers and different odes we will present in details its use with the implicit euler method for the solution of the burgers equation which results to be a meaningful test case to demonstrate the methods features | [['we', 'present', 'a', 'novel', 'acceleration', 'method', 'for', 'the', 'solution', 'of', 'parametric', 'odes', 'by', 'singlestep', 'implicit', 'solvers', 'by', 'means', 'of', 'greedy', 'kernelbased', 'surrogate', 'models', 'in', 'an', 'offline', 'phase', 'a', 'set', 'of', 'trajectories', 'is', 'precomputed', 'with', 'a', 'highaccuracy', 'ode', 'solver', 'for', 'a', 'selected', 'set', 'of', 'parameter', 'samples', 'and', 'used', 'to', 'train', 'a', 'kernel', 'model', 'which', 'predicts', 'the', 'next', 'point', 'in', 'the', 'trajectory', 'as', 'a', 'function', 'of', 'the', 'last', 'one', 'this', 'model', 'is', 'cheap', 'to', 'evaluate', 'and', 'it', 'is', 'used', 'in', 'an', 'online', 'phase', 'for', 'new', 'parameter', 'samples', 'to', 'provide', 'a', 'good', 'initialization', 'point', 'for', 'the', 'nonlinear', 'solver', 'of', 'the', 'implicit', 'integrator', 'the', 'accuracy', 'of', 'the', 'surrogate', 'reflects', 'into', 'a', 'reduction', 'of', 'the', 'number', 'of', 'iterations', 'until', 'convergence', 'of', 'the', 'solver', 'thus', 'providing', 'an', 'overall', 'speedup', 'of', 'the', 'full', 'simulation', 'interestingly', 'in', 'addition', 'to', 'providing', 'an', 'acceleration', 'the', 'accuracy', 'of', 'the', 'solution', 'is', 'maintained', 'since', 'the', 'ode', 'solver', 'is', 'still', 'used', 'to', 'guarantee', 'the', 'required', 'precision', 'although', 'the', 'method', 'can', 'be', 'applied', 'to', 'a', 'large', 'variety', 'of', 'solvers', 'and', 'different', 'odes', 'we', 'will', 'present', 'in', 'details', 'its', 'use', 'with', 'the', 'implicit', 'euler', 'method', 'for', 'the', 'solution', 'of', 'the', 'burgers', 'equation', 'which', 'results', 'to', 'be', 'a', 'meaningful', 'test', 'case', 'to', 'demonstrate', 'the', 'methods', 'features']] | [-0.0717311404501379, -0.029238148969307078, -0.1275132449856028, 0.04424802313209511, -0.07068336912081577, -0.12716304355621105, 0.05337147252052091, 0.35857496501877906, -0.2924922177195549, -0.33094081792980434, 0.11389198426739312, -0.23667512765205173, -0.11082055949838832, 0.24026003291946835, -0.032301460043527186, 0.12028633699723286, 0.09972540965420194, 0.023842633609456244, -0.09437448983429932, -0.2770450575533323, 0.2616578338202089, 0.07818490596488119, 0.23680655477684923, -0.0034963663283269853, 0.17901350529748014, -0.06228463241830468, 0.00581586598418653, 0.021086628839548212, -0.07436919279396534, 0.10193730181927094, 0.25013995844254167, 0.15023062468506396, 0.33145641776616686, -0.42225341037847103, -0.17866947368253022, 0.08169429515022784, 0.13752560688648374, 0.15549118633731268, -0.06173723036539741, -0.26288610022398645, 0.08962448610167485, -0.1542766676458996, -0.13724658969789744, -0.13808541419915854, -0.02815737132448703, 0.03723964335030814, -0.33299139848095366, 0.04876744439126924, 0.0364133355487138, 0.01795009257737547, -0.04389279482245911, -0.07766350110061467, 0.013584897101391108, 0.1042304703523405, 0.04056034222245217, 0.0463994401023956, 0.06306315970257856, -0.14233576543596427, -0.09248422003234737, 0.4054867547980393, -0.07759810543851926, -0.2637223157612607, 0.1739147661521565, -0.04941291601862759, -0.09804177592508495, 0.16975923023186623, 0.2129738670558436, 0.16199498369591311, -0.14560487248934806, 0.04631385798362317, -0.01052305217133835, 0.20739214852597798, -0.008214127798564732, -0.06907846899703145, 0.12634215571451932, 0.24904393341272224, 0.09839023669715971, 0.13751284542377107, -0.0725089898391161, -0.09394526416086592, -0.29516430385468995, -0.1827305426215753, -0.18785136590478943, -0.01345654772769194, -0.11854242425099074, -0.1940794589489815, 0.4153350154962391, 0.20380663939053192, 0.1847342598903924, 0.06798559685237705, 0.32762896465137603, 0.15580736483752844, 0.053103082475718114, 0.07703270176192746, 0.21981412633205763, 0.07728317664237692, 0.0987036059400998, -0.21065561627270654, 0.07820974532165564, 0.12660235116025434] |
1,802.08107 | Geometry of Multi-Flavor Galileon-Like Theories | We use Lie-algebraic arguments to classify Lorentz-invariant theories of
massless interacting scalars that feature coordinate-dependent redundant
symmetries of the Galileon type. We show that such theories are determined, up
to a set of low-energy effective couplings, by specifying an affine
representation of the Lie algebra of physical, non-redundant internal
symmetries and an invariant metric on its target space. This creates an
infinite catalog of theories relevant for both cosmology and high-energy
physics thanks to their special properties such as enhanced scaling of
scattering amplitudes in the soft limit.
| hep-th gr-qc | we use liealgebraic arguments to classify lorentzinvariant theories of massless interacting scalars that feature coordinatedependent redundant symmetries of the galileon type we show that such theories are determined up to a set of lowenergy effective couplings by specifying an affine representation of the lie algebra of physical nonredundant internal symmetries and an invariant metric on its target space this creates an infinite catalog of theories relevant for both cosmology and highenergy physics thanks to their special properties such as enhanced scaling of scattering amplitudes in the soft limit | [['we', 'use', 'liealgebraic', 'arguments', 'to', 'classify', 'lorentzinvariant', 'theories', 'of', 'massless', 'interacting', 'scalars', 'that', 'feature', 'coordinatedependent', 'redundant', 'symmetries', 'of', 'the', 'galileon', 'type', 'we', 'show', 'that', 'such', 'theories', 'are', 'determined', 'up', 'to', 'a', 'set', 'of', 'lowenergy', 'effective', 'couplings', 'by', 'specifying', 'an', 'affine', 'representation', 'of', 'the', 'lie', 'algebra', 'of', 'physical', 'nonredundant', 'internal', 'symmetries', 'and', 'an', 'invariant', 'metric', 'on', 'its', 'target', 'space', 'this', 'creates', 'an', 'infinite', 'catalog', 'of', 'theories', 'relevant', 'for', 'both', 'cosmology', 'and', 'highenergy', 'physics', 'thanks', 'to', 'their', 'special', 'properties', 'such', 'as', 'enhanced', 'scaling', 'of', 'scattering', 'amplitudes', 'in', 'the', 'soft', 'limit']] | [-0.13567015604878013, 0.18742058442727616, -0.07949549351310865, 0.11586964393262117, -0.14500924305651675, -0.1236438973785632, 0.008931046182459051, 0.3435631243681366, -0.26854677055962384, -0.28413798267402773, 0.03921941979867618, -0.26345167326243507, -0.15070498844777996, 0.13970554708926516, -0.032289319004948164, 0.03763889598551693, -0.033541598457800734, 0.07408734507837587, -0.10676096317845142, -0.23179833953988485, 0.3684667213925753, 0.042991556893949484, 0.23927953955981965, 0.003399475022557784, 0.15337739749917423, 0.04839493238383015, -0.051291075270538306, -0.019671628670039354, -0.09650792766826105, 0.12993796072656882, 0.24283157614924925, 0.10132154811237176, 0.1361533525315198, -0.39881668358363886, -0.2077189410867339, 0.08840428783283145, 0.17987307598708535, 0.11083426414353942, -0.005783574090773155, -0.3142870996062728, 0.016855895884377373, -0.19096057090527294, -0.2089894138572907, -0.15682829420653766, 0.021806284742937845, -0.06913761517286977, -0.22212708405938678, 0.022149068381126694, 0.0448561343787746, 0.07206309418490325, -0.09093718159089224, -0.046166918057927185, -0.0618022850645833, 0.0823155165628784, 0.06566271831450815, 0.009148158535191958, 0.12987473586426032, -0.2108139454053757, -0.14128493092721328, 0.4078385422657117, -0.04005274131618948, -0.2298962368311715, 0.19524718366499821, -0.11096496611770074, -0.21824929714784957, 0.10616867129151202, 0.14382274021309885, 0.11063381625122433, -0.16731011629400944, 0.1960225279789566, -0.027960415199314328, 0.09335886587558145, 0.07551090119258416, 0.11697648061354729, 0.24615582583514464, 0.10520745301619172, 0.018635467975400388, 0.09520526704463092, -0.0008813597219572825, -0.06770216427023777, -0.4129150134765289, -0.11032797094032337, -0.11668500854549083, 0.079752067693996, -0.16741348728398656, -0.1890654005269012, 0.351533656606493, 0.1522666147529063, 0.15546665105185556, 0.044897801242768764, 0.18624325924214313, 0.10605193907676122, 0.11197376645709896, 0.033020275629744654, 0.24160590519684114, 0.16143086267137816, 0.005517809732489034, -0.21165740765123206, -0.0885299922533291, 0.12535647778052159] |
1,802.08108 | Relativistic Brueckner-Hartree-Fock theory for neutron drops | Neutron drops confined in an external field are studied in the framework of
relativistic Brueckner-Hartree-Fock theory using the bare nucleon-nucleon
interaction. The ground state energies and radii of neutron drops with even
numbers from $N = 4$ to $N=50$ are calculated and compared with results
obtained from other nonrelativistic \textit{ab initio} calculations and from
relativistic density functional theory. Special attention has been paid to the
magic numbers and to the sub-shell closures. The single-particle energies are
investigated and the monopole effect of the tensor force on the evolutions of
the spin-orbit and the pseudospin-orbit splittings is discussed. The results
provide interesting insight of neutron rich systems and can form an important
guide for future density functionals.
| nucl-th | neutron drops confined in an external field are studied in the framework of relativistic bruecknerhartreefock theory using the bare nucleonnucleon interaction the ground state energies and radii of neutron drops with even numbers from n 4 to n50 are calculated and compared with results obtained from other nonrelativistic textitab initio calculations and from relativistic density functional theory special attention has been paid to the magic numbers and to the subshell closures the singleparticle energies are investigated and the monopole effect of the tensor force on the evolutions of the spinorbit and the pseudospinorbit splittings is discussed the results provide interesting insight of neutron rich systems and can form an important guide for future density functionals | [['neutron', 'drops', 'confined', 'in', 'an', 'external', 'field', 'are', 'studied', 'in', 'the', 'framework', 'of', 'relativistic', 'bruecknerhartreefock', 'theory', 'using', 'the', 'bare', 'nucleonnucleon', 'interaction', 'the', 'ground', 'state', 'energies', 'and', 'radii', 'of', 'neutron', 'drops', 'with', 'even', 'numbers', 'from', 'n', '4', 'to', 'n50', 'are', 'calculated', 'and', 'compared', 'with', 'results', 'obtained', 'from', 'other', 'nonrelativistic', 'textitab', 'initio', 'calculations', 'and', 'from', 'relativistic', 'density', 'functional', 'theory', 'special', 'attention', 'has', 'been', 'paid', 'to', 'the', 'magic', 'numbers', 'and', 'to', 'the', 'subshell', 'closures', 'the', 'singleparticle', 'energies', 'are', 'investigated', 'and', 'the', 'monopole', 'effect', 'of', 'the', 'tensor', 'force', 'on', 'the', 'evolutions', 'of', 'the', 'spinorbit', 'and', 'the', 'pseudospinorbit', 'splittings', 'is', 'discussed', 'the', 'results', 'provide', 'interesting', 'insight', 'of', 'neutron', 'rich', 'systems', 'and', 'can', 'form', 'an', 'important', 'guide', 'for', 'future', 'density', 'functionals']] | [-0.10072049841122782, 0.17757323755624543, -0.09579902775585651, 0.131870287208332, -0.011715426522752512, -0.08822512825869995, 0.0009274001294018134, 0.36196836232329194, -0.18848308825298496, -0.3365128274075687, -0.026064947897406376, -0.34091164812486136, -0.07008066661858364, 0.184915783604526, 0.0838515845734788, 0.056398668097656056, 0.067787653359625, 0.09003946135534258, -0.13200542798225323, -0.1651825099080072, 0.3306402955609171, 0.08663685373233064, 0.23480550215437845, 0.1131639515535663, 0.012567781924229601, 0.02183374857691967, 0.03739209064565923, 0.04396709400107679, -0.1412383564016478, 0.1112468656881348, 0.24897999802209517, 0.014666023917253251, 0.20498037099149888, -0.5162928040746761, -0.20298900890680355, 0.010636784338756748, 0.08966517111124551, 0.16340468902464794, -0.06294818991572475, -0.3169704134049623, 0.027279735641533753, -0.24325435638589704, -0.16863503993043433, -0.1445053693069064, 0.0382422724586871, 0.09421073624904713, -0.2198390716686845, 0.04652480783507876, -0.011069501675260456, 0.03738752992402347, -0.144147139438428, -0.23281648627117923, -0.03732750091863715, 0.07993398645649785, 0.09574020111163997, 0.0585238277223771, 0.14209528203405764, -0.15531738143181428, -0.07519123685424743, 0.4246855303969072, -0.018211467458826045, -0.13271153665593136, 0.15589925397551901, -0.16313693088823525, -0.1148726893507916, 0.15821686788441855, 0.13343443781258943, 0.14001406294334193, -0.10999723859131336, 0.12299768497975057, 0.006250229245051741, 0.14282614604428248, 0.05035176573159254, 0.03958902316896812, 0.21583884459636782, 0.16540314086874866, -0.04899034625521618, 0.08587406990776325, -0.12979998171289006, -0.13739418412923166, -0.2716951912309489, -0.06926636926667845, -0.1765639379863506, 0.04892146991079916, -0.056536024208712066, -0.11592200031180097, 0.32777587099446226, 0.07829909576912937, 0.13234296437889417, -0.014907247016368353, 0.2515127330046633, 0.12816576023545603, 0.050054821975367224, 0.04302022162237731, 0.3033690004488048, 0.24769909875669882, 0.03549763981819801, -0.2672583990062223, -0.004107745659902044, 0.050144767552695195] |
1,802.08109 | A Grand-Unified Nelson-Barr Model | We argue that the Nelson-Barr solution to the Strong CP Problem can be
naturally realized in an E$_6$ Grand-Unified Theory. The chiral SM fermions
reside in three generations of E$_6$ fundamentals together with heavy
vectorlike down quarks, leptons doublets and right-handed neutrinos. CP is
imposed on the Lagrangian and broken only spontaneously at high scales, leading
to a mixing between chiral and vectorlike fields that allows to solve the
Strong CP Problem through the Nelson-Barr mechanism. The main benefit of the
E$_6$ GUT structure is the predictivity in the SM fermion sector, and a perfect
fit to all SM observables can be obtained despite being over-constrained.
Definite predictions are made for the neutrino sector, with a Dirac CP phase
that is correlated to the CKM phase, allowing to test this model in the near
future.
| hep-ph | we argue that the nelsonbarr solution to the strong cp problem can be naturally realized in an e_6 grandunified theory the chiral sm fermions reside in three generations of e_6 fundamentals together with heavy vectorlike down quarks leptons doublets and righthanded neutrinos cp is imposed on the lagrangian and broken only spontaneously at high scales leading to a mixing between chiral and vectorlike fields that allows to solve the strong cp problem through the nelsonbarr mechanism the main benefit of the e_6 gut structure is the predictivity in the sm fermion sector and a perfect fit to all sm observables can be obtained despite being overconstrained definite predictions are made for the neutrino sector with a dirac cp phase that is correlated to the ckm phase allowing to test this model in the near future | [['we', 'argue', 'that', 'the', 'nelsonbarr', 'solution', 'to', 'the', 'strong', 'cp', 'problem', 'can', 'be', 'naturally', 'realized', 'in', 'an', 'e_6', 'grandunified', 'theory', 'the', 'chiral', 'sm', 'fermions', 'reside', 'in', 'three', 'generations', 'of', 'e_6', 'fundamentals', 'together', 'with', 'heavy', 'vectorlike', 'down', 'quarks', 'leptons', 'doublets', 'and', 'righthanded', 'neutrinos', 'cp', 'is', 'imposed', 'on', 'the', 'lagrangian', 'and', 'broken', 'only', 'spontaneously', 'at', 'high', 'scales', 'leading', 'to', 'a', 'mixing', 'between', 'chiral', 'and', 'vectorlike', 'fields', 'that', 'allows', 'to', 'solve', 'the', 'strong', 'cp', 'problem', 'through', 'the', 'nelsonbarr', 'mechanism', 'the', 'main', 'benefit', 'of', 'the', 'e_6', 'gut', 'structure', 'is', 'the', 'predictivity', 'in', 'the', 'sm', 'fermion', 'sector', 'and', 'a', 'perfect', 'fit', 'to', 'all', 'sm', 'observables', 'can', 'be', 'obtained', 'despite', 'being', 'overconstrained', 'definite', 'predictions', 'are', 'made', 'for', 'the', 'neutrino', 'sector', 'with', 'a', 'dirac', 'cp', 'phase', 'that', 'is', 'correlated', 'to', 'the', 'ckm', 'phase', 'allowing', 'to', 'test', 'this', 'model', 'in', 'the', 'near', 'future']] | [-0.12257369921663432, 0.29072885464077075, -0.03129058153954921, 0.13551146993930968, -0.1406892791079978, -0.20890283858817485, 0.050551853810988916, 0.31240752316769904, -0.2540998225548753, -0.29488562094737536, 0.03836158256701849, -0.2761245273278931, -0.04721543161301977, 0.04914139566977543, 0.012420757294253067, 0.019653844764387165, -0.005632049576551826, -0.012258458644565609, -0.10118584241890521, -0.2496106212562019, 0.25558488671495405, -0.019038538931420556, 0.2419919089310699, 0.08956642900421112, 0.05520667703046153, -0.05449704434722662, 0.04341184126032102, -0.08456125067271016, -0.025017719419783032, 0.08142569561799368, 0.1868653739026437, 0.049080720023010616, 0.08064629677165713, -0.4127538734977996, -0.16739861380170892, 0.16568291454610448, 0.16836587175795878, 0.11088876189077618, -0.08796162739378849, -0.321573323501205, 0.1142734039984471, -0.1872009786604731, -0.15433210865077046, -0.08721747699504097, -0.13034376281947416, -0.16189390242237736, -0.3710248718991082, 0.08560600222898992, -0.04824623736915075, 0.01472412482317951, 0.0387979015341477, -0.15609383952148534, -0.07377456426965417, 0.03838383342587837, 0.20655837798301407, 0.0036803474063398663, 0.0832821031463229, -0.1935776371181149, -0.15465644716319663, 0.47543695916732154, -0.09262425319584845, -0.17720232870153807, 0.16079436641496916, -0.15623692073341872, -0.178540953780477, 0.12068454726012769, 0.15391672072863138, 0.04484681964429371, -0.17844643788110395, 0.19355410447654625, -0.09571948599898153, 0.1539677243101997, 0.025116740105052788, 0.01139812605386531, 0.3241295883638991, 0.17115285094413493, 0.07723092157393693, -0.007749939314952051, -0.009227759799816541, -0.11918993570703876, -0.37575489366771997, -0.1324587619134777, -0.0951223595800844, 0.021598270676029777, -0.08823977372462481, -0.09172837221305127, 0.43782398884219154, 0.1410775540707012, 0.19979523351347006, 0.006993997911060298, 0.2535293155677479, 0.05909819863391695, 0.11733830779730514, 0.006745883089455742, 0.29772851718589666, 0.15127199362980684, 0.09970544709789532, -0.25491088393523736, -0.04232868144840554, 0.0960702923229999] |
1,802.0811 | Spin symmetry in the Dirac sea derived from the bare nucleon-nucleon
interaction | The spin symmetry in the Dirac sea has been investigated with relativistic
Brueckner-Hartree-Fock theory using the bare nucleon-nucleon interaction.
Taking the nucleus $^{16}$O as an example and comparing the theoretical results
with the data, the definition of the single-particle potential in the Dirac sea
is studied in detail. It is found that if the single-particle states in the
Dirac sea are treated as occupied states, the ground state properties are in
better agreement with experimental data. Moreover, in this case, the spin
symmetry in the Dirac sea is better conserved and it is more consistent with
the findings using phenomenological relativistic density functionals.
| nucl-th | the spin symmetry in the dirac sea has been investigated with relativistic bruecknerhartreefock theory using the bare nucleonnucleon interaction taking the nucleus 16o as an example and comparing the theoretical results with the data the definition of the singleparticle potential in the dirac sea is studied in detail it is found that if the singleparticle states in the dirac sea are treated as occupied states the ground state properties are in better agreement with experimental data moreover in this case the spin symmetry in the dirac sea is better conserved and it is more consistent with the findings using phenomenological relativistic density functionals | [['the', 'spin', 'symmetry', 'in', 'the', 'dirac', 'sea', 'has', 'been', 'investigated', 'with', 'relativistic', 'bruecknerhartreefock', 'theory', 'using', 'the', 'bare', 'nucleonnucleon', 'interaction', 'taking', 'the', 'nucleus', '16o', 'as', 'an', 'example', 'and', 'comparing', 'the', 'theoretical', 'results', 'with', 'the', 'data', 'the', 'definition', 'of', 'the', 'singleparticle', 'potential', 'in', 'the', 'dirac', 'sea', 'is', 'studied', 'in', 'detail', 'it', 'is', 'found', 'that', 'if', 'the', 'singleparticle', 'states', 'in', 'the', 'dirac', 'sea', 'are', 'treated', 'as', 'occupied', 'states', 'the', 'ground', 'state', 'properties', 'are', 'in', 'better', 'agreement', 'with', 'experimental', 'data', 'moreover', 'in', 'this', 'case', 'the', 'spin', 'symmetry', 'in', 'the', 'dirac', 'sea', 'is', 'better', 'conserved', 'and', 'it', 'is', 'more', 'consistent', 'with', 'the', 'findings', 'using', 'phenomenological', 'relativistic', 'density', 'functionals']] | [-0.0815027606463313, 0.2135373380644647, -0.10916291824677615, 0.1274613131151887, 0.022009316967456664, -0.0802006801970086, -0.00980034132727684, 0.3564691532186223, -0.15719366933499435, -0.2842339993527735, -0.005478310239392794, -0.380961137416872, -0.09440984879846423, 0.12433276723310785, 0.04789626435602753, 0.06027938978909289, 0.047525226455001, 0.06031477194532607, -0.1135646301678843, -0.20120361087464014, 0.3404408955937523, 0.07322700078445442, 0.27273002975321947, 0.11515042811607573, 0.02151670438255572, 0.021997953841951, 0.06262491806636303, -0.00026302952861901625, -0.06666584730916035, 0.060415244759602964, 0.24334310176522353, -0.00028797061164474605, 0.1724564009300858, -0.44759135599275235, -0.23386282307147818, 0.0074025719535075925, 0.12175655714914348, 0.14926495142642734, -0.07436325537898121, -0.34799535973766116, 0.012584025655122637, -0.218121490368927, -0.21340917220827446, -0.10857012168983522, -0.004103802958304442, -0.03085818365657051, -0.20862804166972637, 0.11004710341216002, -0.019881095816336066, 0.04196156050503543, -0.12584873989509257, -0.20400735601167946, -0.1347923230614911, 0.08650022193572475, 0.08769282037663517, 0.058558565089750346, 0.08874871747034774, -0.12488665009704102, -0.09230430234784207, 0.4431524813464544, -0.04777987186516662, -0.23084480183490652, 0.15037919028020166, -0.18311177137606208, -0.10178492180279737, 0.10120221398752725, 0.08027731695266675, 0.07560135767731851, -0.16439374149279687, 0.11540280283062529, -0.09339792919413015, 0.10358212280620649, 0.010107986375834177, 0.04099435875472303, 0.192683410091615, 0.22315275268086676, 0.024848531579002013, 0.0693997168276025, -0.11818258662355467, -0.1656055572234745, -0.28872064935061537, -0.09378911086439508, -0.24575628223150825, 0.018883277750257582, -0.020261965614904027, -0.10826393706470873, 0.42438382307266437, 0.11044495014781222, 0.15995533779281582, -0.029486115443185697, 0.26392840118445815, 0.14770675281252604, 0.04985936482898095, 0.07299155400482739, 0.2894742203858292, 0.1687822954557402, 0.07420354435057605, -0.26381645394145575, 0.012458248231198314, 0.019619051740025577] |
1,802.08111 | Local anti-correlation between star-formation rate and gas-phase
metallicity in disk galaxies | Using a representative sample of 14 star-forming dwarf galaxies in the local
Universe, we show the existence of a spaxel-to-spaxel anti-correlation between
the index N2 (log([NII]6583/Halpha)) and the Halpha flux. These two quantities
are commonly employed as proxies for gas-phase metallicity and star formation
rate (SFR), respectively. Thus, the observed N2 to Halpha relation may reflect
the existence of an anti-correlation between the metallicity of the gas forming
stars and the SFR it induces. Such an anti-correlation is to be expected if
variable external metal-poor gas fuels the star-formation process.
Alternatively, it can result from the contamination of the star-forming gas by
stellar winds and SNe, provided that intense outflows drive most of the metals
out of the star-forming regions. We also explore the possibility that the
observed anti-correlation is due to variations in the physical conditions of
the emitting gas, other than metallicity. Using alternative methods to compute
metallicity, as well as previous observations of HII regions and
photoionization models, we conclude that this possibility is unlikely. The
radial gradient of metallicity characterizing disk galaxies does not produce
the correlation either.
| astro-ph.GA | using a representative sample of 14 starforming dwarf galaxies in the local universe we show the existence of a spaxeltospaxel anticorrelation between the index n2 lognii6583halpha and the halpha flux these two quantities are commonly employed as proxies for gasphase metallicity and star formation rate sfr respectively thus the observed n2 to halpha relation may reflect the existence of an anticorrelation between the metallicity of the gas forming stars and the sfr it induces such an anticorrelation is to be expected if variable external metalpoor gas fuels the starformation process alternatively it can result from the contamination of the starforming gas by stellar winds and sne provided that intense outflows drive most of the metals out of the starforming regions we also explore the possibility that the observed anticorrelation is due to variations in the physical conditions of the emitting gas other than metallicity using alternative methods to compute metallicity as well as previous observations of hii regions and photoionization models we conclude that this possibility is unlikely the radial gradient of metallicity characterizing disk galaxies does not produce the correlation either | [['using', 'a', 'representative', 'sample', 'of', '14', 'starforming', 'dwarf', 'galaxies', 'in', 'the', 'local', 'universe', 'we', 'show', 'the', 'existence', 'of', 'a', 'spaxeltospaxel', 'anticorrelation', 'between', 'the', 'index', 'n2', 'lognii6583halpha', 'and', 'the', 'halpha', 'flux', 'these', 'two', 'quantities', 'are', 'commonly', 'employed', 'as', 'proxies', 'for', 'gasphase', 'metallicity', 'and', 'star', 'formation', 'rate', 'sfr', 'respectively', 'thus', 'the', 'observed', 'n2', 'to', 'halpha', 'relation', 'may', 'reflect', 'the', 'existence', 'of', 'an', 'anticorrelation', 'between', 'the', 'metallicity', 'of', 'the', 'gas', 'forming', 'stars', 'and', 'the', 'sfr', 'it', 'induces', 'such', 'an', 'anticorrelation', 'is', 'to', 'be', 'expected', 'if', 'variable', 'external', 'metalpoor', 'gas', 'fuels', 'the', 'starformation', 'process', 'alternatively', 'it', 'can', 'result', 'from', 'the', 'contamination', 'of', 'the', 'starforming', 'gas', 'by', 'stellar', 'winds', 'and', 'sne', 'provided', 'that', 'intense', 'outflows', 'drive', 'most', 'of', 'the', 'metals', 'out', 'of', 'the', 'starforming', 'regions', 'we', 'also', 'explore', 'the', 'possibility', 'that', 'the', 'observed', 'anticorrelation', 'is', 'due', 'to', 'variations', 'in', 'the', 'physical', 'conditions', 'of', 'the', 'emitting', 'gas', 'other', 'than', 'metallicity', 'using', 'alternative', 'methods', 'to', 'compute', 'metallicity', 'as', 'well', 'as', 'previous', 'observations', 'of', 'hii', 'regions', 'and', 'photoionization', 'models', 'we', 'conclude', 'that', 'this', 'possibility', 'is', 'unlikely', 'the', 'radial', 'gradient', 'of', 'metallicity', 'characterizing', 'disk', 'galaxies', 'does', 'not', 'produce', 'the', 'correlation', 'either']] | [-0.03901345955285554, 0.12026570291507394, -0.05315629417956289, 0.1596812485022484, -0.05238161569512967, -0.04137081426257889, 0.060004455122786265, 0.4710594506934285, -0.1580700532565566, -0.331797376068102, 0.019497249191368207, -0.27876292757896914, -0.04699083890170894, 0.1832333823510756, -0.03214638232150012, -0.05820388619257655, -0.0029242876270372006, -0.12158022392153119, -0.050211652233459365, -0.2908720124642261, 0.33428232031227606, 0.05902868077262408, 0.17477948282224437, -0.0026849196033759248, 0.03723781740085946, -0.19744137066623402, -0.06877550635642062, -0.02618716274672705, -0.15554097305216097, 0.014096796305643188, 0.23811943924093712, 0.15974836491772698, 0.22652889985022032, -0.36236207354922956, -0.2391678542467869, 0.10796520474056402, 0.2165113341503052, 0.02297706437918047, -0.10459447397669364, -0.20886064224824724, 0.010317612038407888, -0.16916310236556456, -0.16061104673167897, 0.06579279915377911, 0.040495907639463743, 0.04557160717279961, -0.26783185080469896, 0.1817905295373445, 0.0403296415907486, 0.09398192693996761, -0.10974236393214798, -0.0505458802735019, -0.12063175855695994, 0.07568727805822467, 0.04124595017492538, 0.0781866736477241, 0.2350836381031614, -0.1502670820375594, 0.012530355264445663, 0.399275072508802, -0.10621316820915025, -0.022607007541228085, 0.2819286554392117, -0.2109009354142472, -0.16021784231739325, 0.0843419925038082, 0.10863885746803134, 0.11134090955990056, -0.14935283659643675, -0.03342321031345313, -0.04365629041050043, 0.20447077231171232, 0.032289067906741464, 0.08461511632647468, 0.32126057687112025, 0.06678017277218816, 0.07759708780019234, 0.08366038169834711, -0.20138921236826313, -0.04175347543787211, -0.24869908033352758, -0.14117267562800812, -0.10623849159003132, 0.09800795388105649, -0.14940186837751146, -0.13318780007151265, 0.2975549668047784, 0.12958829639505387, 0.23468221766460273, 0.02865394573762185, 0.30646091238078144, 0.11708275556059865, 0.12047521926773092, 0.1257780527152742, 0.2994924192627271, 0.19950722632800333, 0.048519688570458026, -0.2992874829085647, 0.15584924712570178, 0.025083450098625486] |
1,802.08112 | Rational consumer decisions in a peak time rebate program | A rational behavior of a consumer is analyzed when the user participates in a
Peak Time Rebate (PTR) mechanism, which is a demand response (DR) incentive
program based on a baseline. A multi-stage stochastic programming is proposed
from the demand side in order to understand the rational decisions. The
consumer preferences are modeled as a risk-averse function under additive
uncertainty. The user chooses the optimal consumption profile to maximize his
economic benefits for each period. The stochastic optimization problem is
solved backward in time. A particular situation is developed when the System
Operator (SO) uses consumption of the previous interval as the
household-specific baseline for the DR program. It is found that a rational
consumer alters the baseline in order to increase the well-being when there is
an economic incentive. As results, whether the incentive is lower than the
retail price, the user shifts his load requirement to the baseline setting
period. On the other hand, if the incentive is greater than the regular energy
price, the optimal decision is that the user spends the maximum possible energy
in the baseline setting period and reduces the consumption at the PTR time.
This consumer behavior produces more energy consumption in total considering
all periods. In addition, the user with high uncertainty level in his energy
pattern should spend less energy than a predictable consumer when the incentive
is lower than the retail price.
| cs.SY | a rational behavior of a consumer is analyzed when the user participates in a peak time rebate ptr mechanism which is a demand response dr incentive program based on a baseline a multistage stochastic programming is proposed from the demand side in order to understand the rational decisions the consumer preferences are modeled as a riskaverse function under additive uncertainty the user chooses the optimal consumption profile to maximize his economic benefits for each period the stochastic optimization problem is solved backward in time a particular situation is developed when the system operator so uses consumption of the previous interval as the householdspecific baseline for the dr program it is found that a rational consumer alters the baseline in order to increase the wellbeing when there is an economic incentive as results whether the incentive is lower than the retail price the user shifts his load requirement to the baseline setting period on the other hand if the incentive is greater than the regular energy price the optimal decision is that the user spends the maximum possible energy in the baseline setting period and reduces the consumption at the ptr time this consumer behavior produces more energy consumption in total considering all periods in addition the user with high uncertainty level in his energy pattern should spend less energy than a predictable consumer when the incentive is lower than the retail price | [['a', 'rational', 'behavior', 'of', 'a', 'consumer', 'is', 'analyzed', 'when', 'the', 'user', 'participates', 'in', 'a', 'peak', 'time', 'rebate', 'ptr', 'mechanism', 'which', 'is', 'a', 'demand', 'response', 'dr', 'incentive', 'program', 'based', 'on', 'a', 'baseline', 'a', 'multistage', 'stochastic', 'programming', 'is', 'proposed', 'from', 'the', 'demand', 'side', 'in', 'order', 'to', 'understand', 'the', 'rational', 'decisions', 'the', 'consumer', 'preferences', 'are', 'modeled', 'as', 'a', 'riskaverse', 'function', 'under', 'additive', 'uncertainty', 'the', 'user', 'chooses', 'the', 'optimal', 'consumption', 'profile', 'to', 'maximize', 'his', 'economic', 'benefits', 'for', 'each', 'period', 'the', 'stochastic', 'optimization', 'problem', 'is', 'solved', 'backward', 'in', 'time', 'a', 'particular', 'situation', 'is', 'developed', 'when', 'the', 'system', 'operator', 'so', 'uses', 'consumption', 'of', 'the', 'previous', 'interval', 'as', 'the', 'householdspecific', 'baseline', 'for', 'the', 'dr', 'program', 'it', 'is', 'found', 'that', 'a', 'rational', 'consumer', 'alters', 'the', 'baseline', 'in', 'order', 'to', 'increase', 'the', 'wellbeing', 'when', 'there', 'is', 'an', 'economic', 'incentive', 'as', 'results', 'whether', 'the', 'incentive', 'is', 'lower', 'than', 'the', 'retail', 'price', 'the', 'user', 'shifts', 'his', 'load', 'requirement', 'to', 'the', 'baseline', 'setting', 'period', 'on', 'the', 'other', 'hand', 'if', 'the', 'incentive', 'is', 'greater', 'than', 'the', 'regular', 'energy', 'price', 'the', 'optimal', 'decision', 'is', 'that', 'the', 'user', 'spends', 'the', 'maximum', 'possible', 'energy', 'in', 'the', 'baseline', 'setting', 'period', 'and', 'reduces', 'the', 'consumption', 'at', 'the', 'ptr', 'time', 'this', 'consumer', 'behavior', 'produces', 'more', 'energy', 'consumption', 'in', 'total', 'considering', 'all', 'periods', 'in', 'addition', 'the', 'user', 'with', 'high', 'uncertainty', 'level', 'in', 'his', 'energy', 'pattern', 'should', 'spend', 'less', 'energy', 'than', 'a', 'predictable', 'consumer', 'when', 'the', 'incentive', 'is', 'lower', 'than', 'the', 'retail', 'price']] | [-0.13444738920921162, 0.05698656653654026, -0.08629188512641436, 0.10874412941002565, -0.14749390307563917, -0.18261292644522406, 0.1189256267142341, 0.39125519391004143, -0.2787643124780807, -0.29690076738950755, 0.10893443341264139, -0.29111756406106093, -0.1159151786760915, 0.17097005585825384, -0.1458594218517343, 0.01844351343584783, 0.03722926934080368, 0.11248502136788682, 0.012595272115260379, -0.313768287884773, 0.2534258183680507, 0.13755576982408826, 0.32854837598077535, 0.03261078927677036, 0.0965182780151082, 0.012253554964244559, 0.001858296896481193, -0.015402725442147358, -0.08439461517711402, 0.11275384475898352, 0.315981665964831, 0.13457761434394688, 0.38403203940518943, -0.41188554141622086, -0.16319765510930562, 0.1334965335410814, 0.03780324046033358, 0.024718022241571602, 0.0034649459822420877, -0.18888901953395956, 0.06671046056720183, -0.22369122926500581, -0.0750729829976053, 0.024127191563592457, 0.029084704566376032, 0.023471049848516588, -0.3267371847548268, 0.01992928021833365, 0.011605156816388944, 0.05285452582442012, -0.07348843700619358, -0.11981142677163385, -0.06353265371826755, 0.13389875943640456, 0.11196627111821254, 0.009888679976600276, 0.1617536669097099, -0.13429864071656292, -0.13997964990563141, 0.40875315683938207, -0.045588663933663606, -0.18431846536615323, 0.10560115421739169, -0.1115326254504624, -0.0786940196137956, 0.1452312987918655, 0.17814409966455588, 0.0866013720301, -0.15689379619197613, 0.04385118554139639, -0.037959046851343665, 0.2192837357898021, 0.07343875807538645, -0.00020928478404653794, 0.16475685981094224, 0.22482043210501698, 0.19324616834952685, 0.08829997783023824, -0.024633025290904106, -0.14707692759539892, -0.23339508783507656, -0.1350066853017905, -0.14519868459748064, 0.05186335149410612, -0.09031893704856345, -0.06923079114100891, 0.40171668178994546, 0.1180029245037021, 0.11950193016963216, 0.1388481983262844, 0.3553258138527344, 0.18161182754695238, 0.038084097530577406, 0.10430234939553391, 0.1843717877321687, -0.06394975012076567, 0.19113594525618663, -0.23883671178815088, 0.19584591682895502, 0.009542784318972975] |
1,802.08113 | Adaptive synchronisation of unknown nonlinear networked systems with
prescribed performance | This paper proposes an adaptive tracking control with prescribed performance
function for distributive cooperative control of highly nonlinear multi-agent
systems. The use of such approach confines the tracking error within a large
predefined set to a predefined smaller set. The key idea is to transform the
constrained system into unconstrained one through the transformation of the
output error. Agents' dynamics are assumed unknown, and the controller is
developed for a strongly connected structured network. The proposed controller
allows all agents to follow the trajectory of the leader node, while satisfying
the necessary dynamic requirements. The proposed approach guarantees uniform
ultimate boundedness for the transformed error as well as a bounded adaptive
estimate of the unknown parameters and dynamics. Simulations include two
examples to validate the robustness and smoothness of the proposed controller
against highly nonlinear heterogeneous multi-agent system with uncertain
time-variant parameters and external disturbances. Keywords: Prescribed
performance, Transformed error, Multi-agents, Distributed adaptive control,
Adaptive Consensus, Transient, Steady-state error, Semi-global asymptotic
stability, uniformly ultimately bounded, Nonlinear Networked Systems,
Distributed Control, Robustness.
| math.OC cs.SY math.DS | this paper proposes an adaptive tracking control with prescribed performance function for distributive cooperative control of highly nonlinear multiagent systems the use of such approach confines the tracking error within a large predefined set to a predefined smaller set the key idea is to transform the constrained system into unconstrained one through the transformation of the output error agents dynamics are assumed unknown and the controller is developed for a strongly connected structured network the proposed controller allows all agents to follow the trajectory of the leader node while satisfying the necessary dynamic requirements the proposed approach guarantees uniform ultimate boundedness for the transformed error as well as a bounded adaptive estimate of the unknown parameters and dynamics simulations include two examples to validate the robustness and smoothness of the proposed controller against highly nonlinear heterogeneous multiagent system with uncertain timevariant parameters and external disturbances keywords prescribed performance transformed error multiagents distributed adaptive control adaptive consensus transient steadystate error semiglobal asymptotic stability uniformly ultimately bounded nonlinear networked systems distributed control robustness | [['this', 'paper', 'proposes', 'an', 'adaptive', 'tracking', 'control', 'with', 'prescribed', 'performance', 'function', 'for', 'distributive', 'cooperative', 'control', 'of', 'highly', 'nonlinear', 'multiagent', 'systems', 'the', 'use', 'of', 'such', 'approach', 'confines', 'the', 'tracking', 'error', 'within', 'a', 'large', 'predefined', 'set', 'to', 'a', 'predefined', 'smaller', 'set', 'the', 'key', 'idea', 'is', 'to', 'transform', 'the', 'constrained', 'system', 'into', 'unconstrained', 'one', 'through', 'the', 'transformation', 'of', 'the', 'output', 'error', 'agents', 'dynamics', 'are', 'assumed', 'unknown', 'and', 'the', 'controller', 'is', 'developed', 'for', 'a', 'strongly', 'connected', 'structured', 'network', 'the', 'proposed', 'controller', 'allows', 'all', 'agents', 'to', 'follow', 'the', 'trajectory', 'of', 'the', 'leader', 'node', 'while', 'satisfying', 'the', 'necessary', 'dynamic', 'requirements', 'the', 'proposed', 'approach', 'guarantees', 'uniform', 'ultimate', 'boundedness', 'for', 'the', 'transformed', 'error', 'as', 'well', 'as', 'a', 'bounded', 'adaptive', 'estimate', 'of', 'the', 'unknown', 'parameters', 'and', 'dynamics', 'simulations', 'include', 'two', 'examples', 'to', 'validate', 'the', 'robustness', 'and', 'smoothness', 'of', 'the', 'proposed', 'controller', 'against', 'highly', 'nonlinear', 'heterogeneous', 'multiagent', 'system', 'with', 'uncertain', 'timevariant', 'parameters', 'and', 'external', 'disturbances', 'keywords', 'prescribed', 'performance', 'transformed', 'error', 'multiagents', 'distributed', 'adaptive', 'control', 'adaptive', 'consensus', 'transient', 'steadystate', 'error', 'semiglobal', 'asymptotic', 'stability', 'uniformly', 'ultimately', 'bounded', 'nonlinear', 'networked', 'systems', 'distributed', 'control', 'robustness']] | [-0.169831866501934, 0.02219507275552595, -0.035326635652924314, 0.0183818737522846, -0.08687756068144016, -0.21078407069704255, 0.03893702397768369, 0.3698078558633202, -0.33594549568206594, -0.3028298849757347, 0.14061501997724524, -0.18340171553742218, -0.1694061767404534, 0.1636489575908503, -0.1564260744122102, 0.21256209200259016, 0.05486589564794773, 0.042623974238549585, -0.00472223901936011, -0.2471870065650396, 0.2868556072458908, 0.06266016809934238, 0.3079987741347773, -0.08627547118104777, 0.18445722031684822, 0.03215763014496157, -0.005052537643704672, 0.024662315117723543, -0.09991403005211151, 0.1179349873411028, 0.25318076769407427, 0.1439317195888674, 0.39107355967774027, -0.4054947866192251, -0.20326126792892946, 0.09284934829900107, 0.15110629403654605, 0.06149161212031909, -0.0471604719202508, -0.34042982693641766, 0.108640334408251, -0.15716844344544306, -0.13235486930301577, -0.07990000178432909, -0.05405073213167706, 0.10282539044832266, -0.35853103069011233, 0.02348681462374063, 0.07055034443166935, 0.03685621146047324, -0.12625087881276972, -0.0626137904340826, -0.002541616930740706, 0.17818280622126176, -0.03839013475192199, 0.0028071418290206217, 0.19357601488934972, -0.07738263490991068, -0.1243532372874137, 0.3565094793945202, 0.006045904990873839, -0.2779410663273591, 0.1614068393154364, -0.03768870598304341, -0.09223442807608442, 0.15557800164740337, 0.2661118322346163, 0.09675595252257255, -0.1922846236647439, 0.032868096419768025, -0.0011018782293108122, 0.21963618544464092, -0.016509907020593597, 0.05346197231362263, 0.12476710950185092, 0.23351861668848678, 0.1858639795910458, 0.13377585076340284, -0.025486886339113717, -0.17505128004612694, -0.2886626596442745, -0.04246952486012066, -0.15699588069052312, -0.031687302318842786, -0.11619339548344097, -0.18002745539647097, 0.3842472819861961, 0.16502343943037573, 0.12149487081533897, 0.1362004056273366, 0.3632891004284223, 0.09903248587683829, 0.009275753345144423, 0.12369493661960315, 0.22399542684127627, 0.10624863074041294, 0.09735997991325955, -0.2766923789610291, 0.14080973449898393, 0.038726714630822286] |
1,802.08114 | Two-way sparsity for time-varying networks, with applications in
genomics | We propose a novel way of modelling time-varying networks, by inducing
two-way sparsity on local models of node connectivity. This two-way sparsity
separately promotes sparsity across time and sparsity across variables (within
time). Separation of these two types of sparsity is achieved through a novel
prior structure, which draws on ideas from the Bayesian lasso and from copula
modelling. We provide an efficient implementation of the proposed model via a
Gibbs sampler, and we apply the model to data from neural development. In doing
so, we demonstrate that the proposed model is able to identify changes in
genomic network structure that match current biological knowledge. Such changes
in genomic network structure can then be used by neuro-biologists to identify
potential targets for further experimental investigation.
| stat.ME | we propose a novel way of modelling timevarying networks by inducing twoway sparsity on local models of node connectivity this twoway sparsity separately promotes sparsity across time and sparsity across variables within time separation of these two types of sparsity is achieved through a novel prior structure which draws on ideas from the bayesian lasso and from copula modelling we provide an efficient implementation of the proposed model via a gibbs sampler and we apply the model to data from neural development in doing so we demonstrate that the proposed model is able to identify changes in genomic network structure that match current biological knowledge such changes in genomic network structure can then be used by neurobiologists to identify potential targets for further experimental investigation | [['we', 'propose', 'a', 'novel', 'way', 'of', 'modelling', 'timevarying', 'networks', 'by', 'inducing', 'twoway', 'sparsity', 'on', 'local', 'models', 'of', 'node', 'connectivity', 'this', 'twoway', 'sparsity', 'separately', 'promotes', 'sparsity', 'across', 'time', 'and', 'sparsity', 'across', 'variables', 'within', 'time', 'separation', 'of', 'these', 'two', 'types', 'of', 'sparsity', 'is', 'achieved', 'through', 'a', 'novel', 'prior', 'structure', 'which', 'draws', 'on', 'ideas', 'from', 'the', 'bayesian', 'lasso', 'and', 'from', 'copula', 'modelling', 'we', 'provide', 'an', 'efficient', 'implementation', 'of', 'the', 'proposed', 'model', 'via', 'a', 'gibbs', 'sampler', 'and', 'we', 'apply', 'the', 'model', 'to', 'data', 'from', 'neural', 'development', 'in', 'doing', 'so', 'we', 'demonstrate', 'that', 'the', 'proposed', 'model', 'is', 'able', 'to', 'identify', 'changes', 'in', 'genomic', 'network', 'structure', 'that', 'match', 'current', 'biological', 'knowledge', 'such', 'changes', 'in', 'genomic', 'network', 'structure', 'can', 'then', 'be', 'used', 'by', 'neurobiologists', 'to', 'identify', 'potential', 'targets', 'for', 'further', 'experimental', 'investigation']] | [-0.05065076791122556, 0.033414330360596066, -0.08679973862506449, 0.04770879000145942, -0.10675307701528072, -0.1483167786411941, 0.09092365595698357, 0.45952412259578707, -0.3480204314813018, -0.3083137332759798, 0.04851996867824346, -0.17848758038133383, -0.23728202454186975, 0.12486612271890044, -0.08362589411251246, 0.059124444369226696, 0.0662932806769386, 0.007837874533841386, -0.03415037108957768, -0.22222565455175936, 0.2990837183184922, 0.06983473865315318, 0.3289435530155897, -0.007454213440418243, 0.10838581084925682, 0.010968410402536393, -0.04209497606381774, -0.0019109679888933897, -0.11050436859449837, 0.16685783027030993, 0.29054294240605666, 0.23110734942927957, 0.3367147275414318, -0.45975465366244317, -0.29385653541982176, 0.08572866362333298, 0.13581367787718773, 0.11533591407164931, -0.040394649412482976, -0.3061953139863908, 0.08896751129254699, -0.1677936280965805, -0.014876344226300716, -0.16427202978171407, -0.08502368381246925, 0.02296431569010019, -0.31594650592235846, 0.07866142900288105, 0.041578295212239026, 0.05181749467924237, -0.05680936931073666, -0.10328887891606428, 0.0011179487146437167, 0.12698882868513464, 0.03722883837018162, -0.001781373232603073, 0.11356353658437729, -0.09990550627931953, -0.13561600852757694, 0.30854582679271697, -0.035725277058780196, -0.2180976560562849, 0.19969997713144402, -0.05804495955258608, -0.17255046874284743, 0.07025542907416821, 0.2461001331694424, 0.05164834947884083, -0.19570660634106024, 0.05452767215529457, -0.025960736699402333, 0.195435442911461, 0.03225603342242539, -0.016320078378543258, 0.1675528008788824, 0.2356322500705719, 0.09259180700033903, 0.1395791240585968, -0.13876672580093147, -0.08922789203748106, -0.23948922051489352, -0.09465232627093792, -0.19750303650647402, -0.029887581910938023, -0.12525575374031905, -0.13992189738154412, 0.43656358151882885, 0.23750839358195663, 0.2254068913385272, 0.07558404966117814, 0.30646922371536495, 0.019139371689409018, 0.10516530862823129, 0.07978051315248012, 0.1557402292434126, 0.09527805535122752, 0.07265231994912029, -0.18045314993523062, 0.15117119785025715, 0.01582173642516136] |
1,802.08115 | Novel differential quadrature element method for higher order strain
gradient elasticity theory | In this paper, we propose a novel and efficient differential quadrature
element based on Lagrange interpolation to solve a sixth order partial
differential equations encountered in non-classical beam theories. These
non-classical theories render displacement, slope and curvature as degrees of
freedom for an Euler-Bernoulli beam. A generalize scheme is presented herein to
implementation the multi-degrees degrees of freedom associated with these
non-classical theories in a simplified and efficient way. The proposed element
has displacement as the only degree of freedom in the domain, whereas, at the
boundaries it has displacement, slope and curvature. Further, we extend this
methodology and formulate two novel versions of plate element for gradient
elasticity theory. In the first version, Lagrange interpolation is assumed in
$x$ and $y$ directions and the second version is based on mixed interpolation,
with Lagrange interpolation in $x$ direction and Hermite interpolation in $y$
direction. The procedure to compute the modified weighting coefficients by
incorporating the classical and non-classical boundary conditions is explained.
The efficiency of the proposed elements is demonstrated through numerical
examples on static analysis of gradient elastic beams and plates for different
boundary conditions.
| cs.CE | in this paper we propose a novel and efficient differential quadrature element based on lagrange interpolation to solve a sixth order partial differential equations encountered in nonclassical beam theories these nonclassical theories render displacement slope and curvature as degrees of freedom for an eulerbernoulli beam a generalize scheme is presented herein to implementation the multidegrees degrees of freedom associated with these nonclassical theories in a simplified and efficient way the proposed element has displacement as the only degree of freedom in the domain whereas at the boundaries it has displacement slope and curvature further we extend this methodology and formulate two novel versions of plate element for gradient elasticity theory in the first version lagrange interpolation is assumed in x and y directions and the second version is based on mixed interpolation with lagrange interpolation in x direction and hermite interpolation in y direction the procedure to compute the modified weighting coefficients by incorporating the classical and nonclassical boundary conditions is explained the efficiency of the proposed elements is demonstrated through numerical examples on static analysis of gradient elastic beams and plates for different boundary conditions | [['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'and', 'efficient', 'differential', 'quadrature', 'element', 'based', 'on', 'lagrange', 'interpolation', 'to', 'solve', 'a', 'sixth', 'order', 'partial', 'differential', 'equations', 'encountered', 'in', 'nonclassical', 'beam', 'theories', 'these', 'nonclassical', 'theories', 'render', 'displacement', 'slope', 'and', 'curvature', 'as', 'degrees', 'of', 'freedom', 'for', 'an', 'eulerbernoulli', 'beam', 'a', 'generalize', 'scheme', 'is', 'presented', 'herein', 'to', 'implementation', 'the', 'multidegrees', 'degrees', 'of', 'freedom', 'associated', 'with', 'these', 'nonclassical', 'theories', 'in', 'a', 'simplified', 'and', 'efficient', 'way', 'the', 'proposed', 'element', 'has', 'displacement', 'as', 'the', 'only', 'degree', 'of', 'freedom', 'in', 'the', 'domain', 'whereas', 'at', 'the', 'boundaries', 'it', 'has', 'displacement', 'slope', 'and', 'curvature', 'further', 'we', 'extend', 'this', 'methodology', 'and', 'formulate', 'two', 'novel', 'versions', 'of', 'plate', 'element', 'for', 'gradient', 'elasticity', 'theory', 'in', 'the', 'first', 'version', 'lagrange', 'interpolation', 'is', 'assumed', 'in', 'x', 'and', 'y', 'directions', 'and', 'the', 'second', 'version', 'is', 'based', 'on', 'mixed', 'interpolation', 'with', 'lagrange', 'interpolation', 'in', 'x', 'direction', 'and', 'hermite', 'interpolation', 'in', 'y', 'direction', 'the', 'procedure', 'to', 'compute', 'the', 'modified', 'weighting', 'coefficients', 'by', 'incorporating', 'the', 'classical', 'and', 'nonclassical', 'boundary', 'conditions', 'is', 'explained', 'the', 'efficiency', 'of', 'the', 'proposed', 'elements', 'is', 'demonstrated', 'through', 'numerical', 'examples', 'on', 'static', 'analysis', 'of', 'gradient', 'elastic', 'beams', 'and', 'plates', 'for', 'different', 'boundary', 'conditions']] | [-0.1261108153554741, 0.0710830552678246, -0.11047829004875835, 0.022328036901746347, -0.08858095762139608, -0.14684595816558407, -0.0003182153174934048, 0.37911990677977925, -0.30443754335564954, -0.25366475921304477, 0.09783432447984915, -0.23013039222437767, -0.13786908591376437, 0.16326204066975944, -0.10057512247654539, 0.08413531150047977, 0.024782337345964005, -0.008067029714482643, -0.09624954279241783, -0.2143018647092044, 0.31863194747868007, 0.02827240883182454, 0.27460977182753626, 0.024168345024458745, 0.1656043484746929, 0.029573887411344757, -0.028959867900290016, 0.030402424892971434, -0.12273796894136936, 0.14099080550299095, 0.21568201904395415, 0.047515111865215405, 0.25243523006667934, -0.41245079466131745, -0.23026464049333847, 0.05333242156813221, 0.12342891646442705, 0.09043009358993982, -0.04769336379143179, -0.23922426908987984, 0.05485849167590821, -0.11310445286919706, -0.19171263518623047, -0.09931422570489988, -0.01275680345603295, 0.032323995219563605, -0.2936697486307352, 0.08748186921315287, 0.03197979667225242, 0.08289231501910235, -0.01897502173068783, -0.15149066961240223, 0.0011462523884850965, 0.008453258081659755, 0.01861896302040306, 0.019348478710819638, 0.06949132772147536, -0.08952201087333223, -0.10544558610111195, 0.3735422258595786, -0.05139127153570273, -0.29980487081031965, 0.14638081470113848, -0.10050802641568245, -0.09008182577228033, 0.10693244055108798, 0.1908699826253528, 0.17066064206136938, -0.13271672568929893, 0.08435109969896955, 0.00836799527400784, 0.16712400704366906, 0.1197054777094113, -0.006442713601294384, 0.13838076325864482, 0.09639794578255025, 0.11286109544885074, 0.14042724706658152, -0.08379171067825018, -0.12652182432832898, -0.3771884619528728, -0.20231470100391374, -0.16448515339163683, -0.02933566919302628, -0.10614718323177909, -0.1481696402113284, 0.3900931699305949, 0.1297802272323464, 0.11346984390289552, 0.015643445123988454, 0.30255507502419454, 0.14307814961304308, 0.038702050636094366, 0.043888731893422385, 0.22831403075527118, 0.20055583317173264, 0.11593091928510256, -0.22387265058635528, 0.024986880172985376, 0.16741196411882117] |
1,802.08116 | Demonstration of Bayesian quantum game on an ion trap quantum computer | We demonstrate a Bayesian quantum game on an ion trap quantum computer with
five qubits. The players share an entangled pair of qubits and perform
rotations on their qubit as the strategy choice. Two five-qubit circuits are
sufficient to run all 16 possible strategy choice sets in a game with four
possible strategies. The data are then parsed into player types randomly in
order to combine them classically into a Bayesian framework. We exhaustively
compute the possible strategies of the game so that the experimental data can
be used to solve for the Nash equilibria of the game directly. Then we compare
the payoff at the Nash equilibria and location of phase-change-like transitions
obtained from the experimental data to the theory, and study how it changes as
a function of the amount of entanglement.
| quant-ph | we demonstrate a bayesian quantum game on an ion trap quantum computer with five qubits the players share an entangled pair of qubits and perform rotations on their qubit as the strategy choice two fivequbit circuits are sufficient to run all 16 possible strategy choice sets in a game with four possible strategies the data are then parsed into player types randomly in order to combine them classically into a bayesian framework we exhaustively compute the possible strategies of the game so that the experimental data can be used to solve for the nash equilibria of the game directly then we compare the payoff at the nash equilibria and location of phasechangelike transitions obtained from the experimental data to the theory and study how it changes as a function of the amount of entanglement | [['we', 'demonstrate', 'a', 'bayesian', 'quantum', 'game', 'on', 'an', 'ion', 'trap', 'quantum', 'computer', 'with', 'five', 'qubits', 'the', 'players', 'share', 'an', 'entangled', 'pair', 'of', 'qubits', 'and', 'perform', 'rotations', 'on', 'their', 'qubit', 'as', 'the', 'strategy', 'choice', 'two', 'fivequbit', 'circuits', 'are', 'sufficient', 'to', 'run', 'all', '16', 'possible', 'strategy', 'choice', 'sets', 'in', 'a', 'game', 'with', 'four', 'possible', 'strategies', 'the', 'data', 'are', 'then', 'parsed', 'into', 'player', 'types', 'randomly', 'in', 'order', 'to', 'combine', 'them', 'classically', 'into', 'a', 'bayesian', 'framework', 'we', 'exhaustively', 'compute', 'the', 'possible', 'strategies', 'of', 'the', 'game', 'so', 'that', 'the', 'experimental', 'data', 'can', 'be', 'used', 'to', 'solve', 'for', 'the', 'nash', 'equilibria', 'of', 'the', 'game', 'directly', 'then', 'we', 'compare', 'the', 'payoff', 'at', 'the', 'nash', 'equilibria', 'and', 'location', 'of', 'phasechangelike', 'transitions', 'obtained', 'from', 'the', 'experimental', 'data', 'to', 'the', 'theory', 'and', 'study', 'how', 'it', 'changes', 'as', 'a', 'function', 'of', 'the', 'amount', 'of', 'entanglement']] | [-0.06843286423936934, 0.08469363245819836, -0.10545205272019918, 0.07822838578814346, -0.0031878252433178793, -0.20750972362851403, 0.11916688231390697, 0.41836051156926424, -0.28549457690853597, -0.3282789834284861, 0.07744724034415768, -0.29517586709917487, -0.11432630890329137, 0.13163145932656034, -0.051132879780143276, 0.07848263815171401, 0.08557411059527133, 0.04624345901254144, 0.01608044755009626, -0.31673146213607906, 0.3333736675497341, 0.010326332092299162, 0.26317791689775494, -0.015137875527913746, 0.10585212289387207, -0.02486645004578999, 0.016963737102092376, 0.041410093976506836, -0.14371751539639585, 0.08651375702256905, 0.2917930510007125, 0.2205911302392868, 0.2960375296949808, -0.4698837452981257, -0.12000288075375322, 0.13336163161924683, 0.09237975977305182, 0.17835317342542112, 0.005677682979564581, -0.2803140130398193, 0.04768415107706884, -0.178687719071522, -0.06299381834433827, -0.10768457842444566, -0.009377321175866782, -0.006221748733563923, -0.30397395991993353, -0.056983181786604394, -0.006734121037661133, 0.03780645641141144, -0.02863120054476019, -0.09220286982512116, -0.022030341995641925, 0.1905182752324114, -0.023500650602960048, -0.025949193148950774, 0.15607766244084315, -0.11009653333112374, -0.23359515269363956, 0.37347169503345523, -0.026971120587760175, -0.19661391688216673, 0.15890339495705202, -0.06588362461950321, -0.10821513020909651, 0.06895215583867148, 0.16537629678509289, 0.13726037314959935, -0.14365102870291785, 0.027696057200463333, -0.05189991069526965, 0.1932037242342111, 0.04437057254835963, 0.051492307310629835, 0.19194196637271715, 0.111858494464252, 0.12454669130265825, 0.16605349039211187, -0.05945239251298319, -0.18031844875689498, -0.29847019093629334, -0.13636765408826837, -0.1823701946059578, 0.022297086379721873, -0.08279211079858023, -0.12260960116177182, 0.40501218388571325, 0.15164344163814603, 0.1467385281339512, 0.053087652356738464, 0.284444005655727, 0.05896675780273736, 0.03551781544841728, 0.056675461817644816, 0.21982457872508163, 0.0960264289489058, 0.09838017159582753, -0.2456223127883824, 0.05412225581397463, 0.011147073014023104] |
1,802.08117 | Topological spaces of persistence modules and their properties | Persistence modules are a central algebraic object arising in topological
data analysis. The notion of interleaving provides a natural way to measure
distances between persistence modules. We consider various classes of
persistence modules, including many of those that have been previously studied,
and describe the relationships between them. In the cases where these classes
are sets, interleaving distance induces a topology. We undertake a systematic
study the resulting topological spaces and their basic topological properties.
| math.AT math.GN | persistence modules are a central algebraic object arising in topological data analysis the notion of interleaving provides a natural way to measure distances between persistence modules we consider various classes of persistence modules including many of those that have been previously studied and describe the relationships between them in the cases where these classes are sets interleaving distance induces a topology we undertake a systematic study the resulting topological spaces and their basic topological properties | [['persistence', 'modules', 'are', 'a', 'central', 'algebraic', 'object', 'arising', 'in', 'topological', 'data', 'analysis', 'the', 'notion', 'of', 'interleaving', 'provides', 'a', 'natural', 'way', 'to', 'measure', 'distances', 'between', 'persistence', 'modules', 'we', 'consider', 'various', 'classes', 'of', 'persistence', 'modules', 'including', 'many', 'of', 'those', 'that', 'have', 'been', 'previously', 'studied', 'and', 'describe', 'the', 'relationships', 'between', 'them', 'in', 'the', 'cases', 'where', 'these', 'classes', 'are', 'sets', 'interleaving', 'distance', 'induces', 'a', 'topology', 'we', 'undertake', 'a', 'systematic', 'study', 'the', 'resulting', 'topological', 'spaces', 'and', 'their', 'basic', 'topological', 'properties']] | [-0.20549408494184415, 0.0954813814163208, -0.09953611283252636, 0.15562821173574776, -0.06151733165606856, -0.09644091942658027, 0.013486674105127652, 0.40581902528802555, -0.3627697438063721, -0.2975652871467173, 0.08145469426798324, -0.26099742005268733, -0.17396128738919894, 0.2020784002666672, -0.08689776877562205, 0.011228612599273522, 0.04385032163312038, 0.021084765990575155, -0.11513980052744349, -0.21180881878205884, 0.39051764994859695, -0.022614928372204305, 0.27591237088044485, -0.01146502251426379, 0.05204417253068338, 0.0022062036332984765, -0.07894591678554813, 0.08538853199393391, -0.192940609632545, 0.19068757206201553, 0.2871631053586801, 0.10816204498832424, 0.22441573232150402, -0.3805443325638771, -0.19048104676107566, 0.15320695259918768, 0.07222495001119872, 0.07683129192756799, -0.015979933875302475, -0.29074215727547803, 0.14101123246364294, -0.1879470671589176, -0.05390663359935085, -0.11346177938083808, 0.07671849352618058, 0.061189741054549815, -0.1530268288527926, -0.003804301197330157, 0.07112167327975233, 0.14642934379788736, -0.044299635278681915, -0.0505946393419678, -0.017452422919062276, 0.20389318312207858, 0.017732633791553477, -0.03397028912169238, 0.10704688883076112, -0.10305787895806134, -0.18059866547584533, 0.34607661781211696, 0.02741459966947635, -0.19871636252229413, 0.2821836943365634, -0.10688605593517422, -0.14751990290358663, 0.05377723641693592, 0.12837215582529704, 0.0865960526963075, -0.14695285045852263, 0.12024440983776002, -0.06221645049750805, 0.07970605897406736, 0.06453827211943765, 0.15032930368557573, 0.1971036555369695, 0.1622758089036991, 0.06459005354049926, 0.20085358885427315, -0.0878636618986881, -0.09396239586407319, -0.2843272430201372, -0.18584086011474332, -0.05887194433249533, 0.024358851361709337, -0.08424950204750833, -0.1952875698854526, 0.4323880074173212, 0.1287890574305008, 0.24229304354637862, 0.087788997143507, 0.22051906092713278, 0.020338022286693257, 0.08106611689397444, 0.00284514678021272, 0.18692554638410608, 0.17371748986343544, 0.03273928246150414, -0.11450221731327474, 0.07199600192407767, 0.14085001981506745] |
1,802.08118 | The topological chiral homology of the spherical category | We consider the spherical DG category $Sph_G$ attached to an affine algebraic
group $G$. By definition, $Sph_G := IndCoh(LS_G(S^2))$ consists of ind-coherent
sheaves of the stack of $G$-local systems on the $2$-sphere $S^2$. The
$3$-dimensional version of the pair of pants endows $Sph_G$ with an
$E_3$-monoidal structure. More generally, for an algebraic stack $Y$
(satisfying some mild conditions) and $n \geq -1$, we can look at the
$E_{n+1}$-monoidal DG category $Sph(Y,n) := IndCoh_0((Y^{S^n})^\wedge_Y)$,
where $IndCoh_0$ is the sheaf theory introduced in [AG2] and [centerH]. % The
case of $Sph_G$ is recovered by setting $Y =BG$ and $n=2$.
The cobordism hypothesis associates to $Sph(Y,n)$ an $(n+1)$-dimensional
TQFT, whose value of a manifold $M^d$ of dimension $d \leq n+1$ (possibly with
boundary) is given by the {topological chiral homology} $\int_{M^d} Sph(Y,n)$.
% In this paper, we compute such homology (in virtually all cases): we have the
Stokes style formula $$ \int_{M^d} Sph(Y,n) \simeq IndCoh_0 ( (Y^{\partial(M^d
\times D^{n+1-d})})^\wedge_{Y^M} ) , $$ where the formal completion is
constructed using the obvious projection $\partial(M^d \times D^{n+1-d}) \to
M^d$.
The most interesting instance of this formula is for $Sph_G \simeq
Sph(BG,2)$, the original spherical category, and $X$ a Riemann surface. In this
case, we obtain a monoidal equivalence $\int_X Sph_G \simeq
H(LS_G^{Betti}(X))$, where $LS_G^{Betti}(X)$ is the stack of $G$-local systems
on the topological space underlying $X$ and $H$ is the sheaf theory introduced
in [centerH].
| math.RT math.AG math.CT math.QA | we consider the spherical dg category sph_g attached to an affine algebraic group g by definition sph_g indcohls_gs2 consists of indcoherent sheaves of the stack of glocal systems on the 2sphere s2 the 3dimensional version of the pair of pants endows sph_g with an e_3monoidal structure more generally for an algebraic stack y satisfying some mild conditions and n geq 1 we can look at the e_n1monoidal dg category sphyn indcoh_0ysnwedge_y where indcoh_0 is the sheaf theory introduced in ag2 and centerh the case of sph_g is recovered by setting y bg and n2 the cobordism hypothesis associates to sphyn an n1dimensional tqft whose value of a manifold md of dimension d leq n1 possibly with boundary is given by the topological chiral homology int_md sphyn in this paper we compute such homology in virtually all cases we have the stokes style formula int_md sphyn simeq indcoh_0 ypartialmd times dn1dwedge_ym where the formal completion is constructed using the obvious projection partialmd times dn1d to md the most interesting instance of this formula is for sph_g simeq sphbg2 the original spherical category and x a riemann surface in this case we obtain a monoidal equivalence int_x sph_g simeq hls_gbettix where ls_gbettix is the stack of glocal systems on the topological space underlying x and h is the sheaf theory introduced in centerh | [['we', 'consider', 'the', 'spherical', 'dg', 'category', 'sph_g', 'attached', 'to', 'an', 'affine', 'algebraic', 'group', 'g', 'by', 'definition', 'sph_g', 'indcohls_gs2', 'consists', 'of', 'indcoherent', 'sheaves', 'of', 'the', 'stack', 'of', 'glocal', 'systems', 'on', 'the', '2sphere', 's2', 'the', '3dimensional', 'version', 'of', 'the', 'pair', 'of', 'pants', 'endows', 'sph_g', 'with', 'an', 'e_3monoidal', 'structure', 'more', 'generally', 'for', 'an', 'algebraic', 'stack', 'y', 'satisfying', 'some', 'mild', 'conditions', 'and', 'n', 'geq', '1', 'we', 'can', 'look', 'at', 'the', 'e_n1monoidal', 'dg', 'category', 'sphyn', 'indcoh_0ysnwedge_y', 'where', 'indcoh_0', 'is', 'the', 'sheaf', 'theory', 'introduced', 'in', 'ag2', 'and', 'centerh', 'the', 'case', 'of', 'sph_g', 'is', 'recovered', 'by', 'setting', 'y', 'bg', 'and', 'n2', 'the', 'cobordism', 'hypothesis', 'associates', 'to', 'sphyn', 'an', 'n1dimensional', 'tqft', 'whose', 'value', 'of', 'a', 'manifold', 'md', 'of', 'dimension', 'd', 'leq', 'n1', 'possibly', 'with', 'boundary', 'is', 'given', 'by', 'the', 'topological', 'chiral', 'homology', 'int_md', 'sphyn', 'in', 'this', 'paper', 'we', 'compute', 'such', 'homology', 'in', 'virtually', 'all', 'cases', 'we', 'have', 'the', 'stokes', 'style', 'formula', 'int_md', 'sphyn', 'simeq', 'indcoh_0', 'ypartialmd', 'times', 'dn1dwedge_ym', 'where', 'the', 'formal', 'completion', 'is', 'constructed', 'using', 'the', 'obvious', 'projection', 'partialmd', 'times', 'dn1d', 'to', 'md', 'the', 'most', 'interesting', 'instance', 'of', 'this', 'formula', 'is', 'for', 'sph_g', 'simeq', 'sphbg2', 'the', 'original', 'spherical', 'category', 'and', 'x', 'a', 'riemann', 'surface', 'in', 'this', 'case', 'we', 'obtain', 'a', 'monoidal', 'equivalence', 'int_x', 'sph_g', 'simeq', 'hls_gbettix', 'where', 'ls_gbettix', 'is', 'the', 'stack', 'of', 'glocal', 'systems', 'on', 'the', 'topological', 'space', 'underlying', 'x', 'and', 'h', 'is', 'the', 'sheaf', 'theory', 'introduced', 'in', 'centerh']] | [-0.18540737453640402, 0.06304344384646837, -0.07554533553318869, 0.03631091767730301, -0.057046880368052014, -0.16569503262757743, -0.03528780533758668, 0.3332208510004349, -0.31233512950826015, -0.21085226738268473, 0.07580032815424013, -0.23916901488030584, -0.1321953236109431, 0.15246311353300424, -0.1648016491129894, -0.049281073991533406, 0.0022500028175201415, 0.10169300000787046, -0.10227768708193931, -0.2505882308075396, 0.3987526427817476, -0.03993050592686689, 0.22362885075420433, 0.017336937722147387, 0.11082096506987571, 0.029440921422849663, 0.014069921079217416, -0.0016770869278576249, -0.17151423815498584, 0.1274997130031789, 0.27416551641448783, 0.052287947209597584, 0.1549845284345222, -0.3828743248721402, -0.12769462153151193, 0.1424838695857747, 0.10101324317556824, -0.0006638439703166631, 0.02486858244546787, -0.2813524317370691, 0.14542837759283572, -0.16565016945299016, -0.1210410428580408, -0.022545395264922476, 0.10920956454185002, -0.04564832733012736, -0.24189579161238903, -0.018311634765910533, 0.07650743746746551, 0.08566120956161552, -0.05661035965735495, -0.09231651404429701, -0.0812845054458069, 0.05774741506776955, -0.009675463492064463, 0.10779152189463596, 0.09590516717848825, -0.11003980638491281, -0.07100781934808337, 0.3922670531684679, -0.07755208889698136, -0.2186909398730552, 0.13046381092749024, -0.1290867971963998, -0.16496094513465376, 0.1286282589723009, 0.035807697024817266, 0.18385484840666108, -0.01775863201171388, 0.22498872085770036, -0.11683320251291197, 0.11767730114047927, 0.07401262247460146, -0.01898933803963968, 0.13187051087152213, 0.13692524832845712, 0.07006124069505627, 0.12032531773187585, -0.061473664770578494, -0.045562804165278, -0.3517765557192558, -0.22821696544997394, -0.13092928636857928, 0.16602143744353717, -0.1131602592178359, -0.15258073800827796, 0.3430263933648045, 0.05364481487777084, 0.20375125795858456, 0.11417853476093881, 0.2291102535844616, 0.07645464696642924, 0.01498094189532019, 0.05055252842744356, 0.09907344375767256, 0.2053089244142814, -0.005639701415145514, -0.11902485672166507, -0.020285010178043853, 0.21767955398479222] |
1,802.08119 | Laser frequency stabilization using a transfer interferometer | We present a laser frequency stabilization system that uses a transfer
interferometer to stabilize slave lasers to a reference laser. Our
implementation uses off-the-shelf optical components along with
microcontroller-based digital feedback, and offers a simple, flexible and
robust way to stabilize multiple laser frequencies to better than 1 MHz.
| physics.atom-ph physics.ins-det | we present a laser frequency stabilization system that uses a transfer interferometer to stabilize slave lasers to a reference laser our implementation uses offtheshelf optical components along with microcontrollerbased digital feedback and offers a simple flexible and robust way to stabilize multiple laser frequencies to better than 1 mhz | [['we', 'present', 'a', 'laser', 'frequency', 'stabilization', 'system', 'that', 'uses', 'a', 'transfer', 'interferometer', 'to', 'stabilize', 'slave', 'lasers', 'to', 'a', 'reference', 'laser', 'our', 'implementation', 'uses', 'offtheshelf', 'optical', 'components', 'along', 'with', 'microcontrollerbased', 'digital', 'feedback', 'and', 'offers', 'a', 'simple', 'flexible', 'and', 'robust', 'way', 'to', 'stabilize', 'multiple', 'laser', 'frequencies', 'to', 'better', 'than', '1', 'mhz']] | [-0.143736225082444, 0.10919150261550534, -0.10012733404125486, -0.038832176647776245, -0.1485307770876252, -0.26261156023841126, 0.07269060372479488, 0.5433634522618079, -0.2348656851836309, -0.2668389383399365, 0.049425245310198894, -0.18572962783961272, -0.08343743560455587, 0.29711155723590327, -0.06602057194983472, 0.014920632411934892, 0.024644903220920538, -0.09603538323307828, 0.0005648613061603843, -0.10026086452512109, 0.1859501437759217, 0.1171603665832069, 0.3104267732943503, -0.12956700375189587, 0.21306185220007082, 0.006844470771599789, 0.05091417651167329, -0.11239645122407879, -0.06054385211535525, 0.1359841830040119, 0.2809525267696198, 0.05280261167458126, 0.3043424721275057, -0.39613876311222507, -0.21385030239364322, 0.0337166753122393, 0.12817397829126187, 0.2017130093953135, -0.09339726495803619, -0.24431935041116512, 0.07255097505237375, -0.2055208379668849, -0.1489607272669673, -0.10672313490008213, -0.04208684322063108, 0.07626365448933418, -0.3509174676003809, -0.06308067715441694, -0.011440889909863472, 0.04143111759378594, -0.02796236474104986, -0.042289290774366536, 0.022836594885139137, 0.09484856750588028, -0.1441299126160388, 0.12028894915568586, 0.1973683384665269, -0.01426398588287435, -0.11461824284182215, 0.3421343282739423, -0.12112225370858178, -0.14567399097188394, 0.24053082166581738, -0.09846063574053804, -0.023281341946056605, 0.16709805725674545, 0.16034936922013152, 0.05104860609720404, -0.09274438078448709, -0.07562166367115795, 0.09967239054718188, 0.3549800652402396, 0.11782632230267841, 0.09829918204863765, 0.20171218521284814, 0.24005094649536268, 0.10960924115411495, 0.1840960247138021, -0.08273243376681087, -0.060287629073599774, -0.20427044252128512, -0.08308790067248807, -0.12229646919105126, 0.026739394767399952, -0.001815403364384927, -0.11711860897627716, 0.4225984868042323, 0.20686527883291853, 0.10051491077305102, 0.04324991364336135, 0.48678230296592323, 0.07566713662675525, 0.10196565635198233, 0.022397565978522202, 0.22496480327479693, 0.12012001815042933, 0.13423533342322524, -0.21298167056271008, -0.08661254088641429, -0.0038129835560613747] |
1,802.0812 | Microscopic dynamics of superfluid $^4$He: a comprehensive study by
inelastic neutron scattering | The dynamic structure factor of superfluid $^4$He has been investigated at
very low temperatures by inelastic neutron scattering. The measurements combine
different incoming energies resulting in an unprecedentedly large dynamic range
with excellent energy resolution, covering wave vectors $Q$ up to 5 \AA$^{-1}$
and energies $\omega$ up to 15 meV. A detailed description of the dynamics of
superfluid $^4$He is obtained from saturated vapor pressure up to
solidification. The single-excitation spectrum is substantially modified at
high pressures, as the maxon energy exceeds the roton-roton decay threshold. A
highly structured multi-excitation spectrum is observed at low energies, where
clear thresholds and branches have been identified. Strong phonon emission
branches are observed when the phonon or roton group velocities exceed the
sound velocity. The spectrum is found to display strong multi-excitations
whenever the single-excitations face disintegration following Pitaevskii's type
a or b criteria. At intermediate energies, an interesting pattern in the
dynamic structure factor is observed in the vicinity of the recoil energy. All
these features, which evolve significantly with pressure, are in very good
agreement with the Dynamic Many-body calculations, even at the highest
densities, where the correlations are strongest.
| cond-mat.other | the dynamic structure factor of superfluid 4he has been investigated at very low temperatures by inelastic neutron scattering the measurements combine different incoming energies resulting in an unprecedentedly large dynamic range with excellent energy resolution covering wave vectors q up to 5 aa1 and energies omega up to 15 mev a detailed description of the dynamics of superfluid 4he is obtained from saturated vapor pressure up to solidification the singleexcitation spectrum is substantially modified at high pressures as the maxon energy exceeds the rotonroton decay threshold a highly structured multiexcitation spectrum is observed at low energies where clear thresholds and branches have been identified strong phonon emission branches are observed when the phonon or roton group velocities exceed the sound velocity the spectrum is found to display strong multiexcitations whenever the singleexcitations face disintegration following pitaevskiis type a or b criteria at intermediate energies an interesting pattern in the dynamic structure factor is observed in the vicinity of the recoil energy all these features which evolve significantly with pressure are in very good agreement with the dynamic manybody calculations even at the highest densities where the correlations are strongest | [['the', 'dynamic', 'structure', 'factor', 'of', 'superfluid', '4he', 'has', 'been', 'investigated', 'at', 'very', 'low', 'temperatures', 'by', 'inelastic', 'neutron', 'scattering', 'the', 'measurements', 'combine', 'different', 'incoming', 'energies', 'resulting', 'in', 'an', 'unprecedentedly', 'large', 'dynamic', 'range', 'with', 'excellent', 'energy', 'resolution', 'covering', 'wave', 'vectors', 'q', 'up', 'to', '5', 'aa1', 'and', 'energies', 'omega', 'up', 'to', '15', 'mev', 'a', 'detailed', 'description', 'of', 'the', 'dynamics', 'of', 'superfluid', '4he', 'is', 'obtained', 'from', 'saturated', 'vapor', 'pressure', 'up', 'to', 'solidification', 'the', 'singleexcitation', 'spectrum', 'is', 'substantially', 'modified', 'at', 'high', 'pressures', 'as', 'the', 'maxon', 'energy', 'exceeds', 'the', 'rotonroton', 'decay', 'threshold', 'a', 'highly', 'structured', 'multiexcitation', 'spectrum', 'is', 'observed', 'at', 'low', 'energies', 'where', 'clear', 'thresholds', 'and', 'branches', 'have', 'been', 'identified', 'strong', 'phonon', 'emission', 'branches', 'are', 'observed', 'when', 'the', 'phonon', 'or', 'roton', 'group', 'velocities', 'exceed', 'the', 'sound', 'velocity', 'the', 'spectrum', 'is', 'found', 'to', 'display', 'strong', 'multiexcitations', 'whenever', 'the', 'singleexcitations', 'face', 'disintegration', 'following', 'pitaevskiis', 'type', 'a', 'or', 'b', 'criteria', 'at', 'intermediate', 'energies', 'an', 'interesting', 'pattern', 'in', 'the', 'dynamic', 'structure', 'factor', 'is', 'observed', 'in', 'the', 'vicinity', 'of', 'the', 'recoil', 'energy', 'all', 'these', 'features', 'which', 'evolve', 'significantly', 'with', 'pressure', 'are', 'in', 'very', 'good', 'agreement', 'with', 'the', 'dynamic', 'manybody', 'calculations', 'even', 'at', 'the', 'highest', 'densities', 'where', 'the', 'correlations', 'are', 'strongest']] | [-0.1040356937865977, 0.2318886329824548, -0.06792749352853304, 0.060983387885429965, -0.013739652312842639, -0.11390837256437397, 0.034709490422267085, 0.3851283566265177, -0.2543362799360009, -0.32350934724453634, 0.00581026970413864, -0.31944846000111793, -0.0053028333362602495, 0.17182345553213652, 0.08444238179893751, 0.025296993834036652, 0.05531854203887163, 0.0680574047759736, -0.07326856903326247, -0.1463096786386794, 0.269252711142193, 0.10993222276159433, 0.3136194827816179, 0.09491033755776082, 0.07198953940232675, -0.04374093369152697, 0.055960678195040074, 0.017979400610471125, -0.16159075498831288, 0.029438817959969804, 0.2892387742026439, -0.011857823591418964, 0.20434820875825901, -0.37878315955380437, -0.2273490386764689, 0.05588458026559042, 0.13007275019528255, 0.11709148765188612, -0.026328514082237117, -0.2333417277312487, 0.08059809453690284, -0.15020530363444679, -0.15024939049736305, -0.07489453082133124, 0.039868166129435265, 0.022268176529446123, -0.230046110785371, 0.13010915344135376, -0.006150917896765575, 0.0607066843098124, -0.09998794447227571, -0.1605777608415973, -0.05357731865238278, 0.059792765926460795, 0.025506694605874437, 0.04309625098211391, 0.14209547064327185, -0.16008120618500216, -0.02428023666844413, 0.38959110117647594, -0.05257243985029798, -0.042510457236760404, 0.23081981424262288, -0.2164482345068527, -0.09886024992405881, 0.29691127604824963, 0.14451858672809095, 0.06576676205957248, -0.0987392763519736, 0.03642443305861595, -0.0025941961749565727, 0.1943823989350549, 0.13693761461794937, 0.0631134287677239, 0.21400925768689522, 0.15807565543562754, 0.008750612977065987, 0.07100010302258275, -0.1394133970431823, -0.0402251057431943, -0.24855690188355423, -0.060734014850490355, -0.15334616656107228, 0.037190092170109684, -0.07524430264593027, -0.11808869116989676, 0.3522257881229042, 0.061958007307933466, 0.23701237434751646, 0.007773174986278298, 0.2696782352442863, 0.17223140172114576, 0.06962043663152535, 0.09775422574070994, 0.29915320088646263, 0.1523565358797749, 0.10407965909188954, -0.2525856345253546, 0.040321629777330385, -0.024532255347347466] |
1,802.08121 | Micropolar modeling approach for periodic sandwich beams | We develop a micropolar Timoshenko beam theory and use it to model web-core
sandwich beams. The beam theory is derived by a vector approach and the general
displacement solution to the governing sixth-order equations is given. A
nodally-exact micropolar Timoshenko beam element is formulated using the
solution. Bending and shear stiffnesses for a micropolar web-core sandwich beam
are determined through unit cell analysis where the split of the shear forces
into symmetric and antisymmetric parts plays a pivotal role. Static bending of
web-core beams is studied using the micropolar model as well as modified
couple-stress and classical Timoshenko beams. The 1-D micropolar results are in
best agreement with 2-D web-core beam frame results. This is because the
micropolar beam allows antisymmetric shear deformation to emerge at locations
where the 2-D web-core deformations cannot be reduced to 1-D by considering
only symmetric shear behavior.
| physics.class-ph | we develop a micropolar timoshenko beam theory and use it to model webcore sandwich beams the beam theory is derived by a vector approach and the general displacement solution to the governing sixthorder equations is given a nodallyexact micropolar timoshenko beam element is formulated using the solution bending and shear stiffnesses for a micropolar webcore sandwich beam are determined through unit cell analysis where the split of the shear forces into symmetric and antisymmetric parts plays a pivotal role static bending of webcore beams is studied using the micropolar model as well as modified couplestress and classical timoshenko beams the 1d micropolar results are in best agreement with 2d webcore beam frame results this is because the micropolar beam allows antisymmetric shear deformation to emerge at locations where the 2d webcore deformations cannot be reduced to 1d by considering only symmetric shear behavior | [['we', 'develop', 'a', 'micropolar', 'timoshenko', 'beam', 'theory', 'and', 'use', 'it', 'to', 'model', 'webcore', 'sandwich', 'beams', 'the', 'beam', 'theory', 'is', 'derived', 'by', 'a', 'vector', 'approach', 'and', 'the', 'general', 'displacement', 'solution', 'to', 'the', 'governing', 'sixthorder', 'equations', 'is', 'given', 'a', 'nodallyexact', 'micropolar', 'timoshenko', 'beam', 'element', 'is', 'formulated', 'using', 'the', 'solution', 'bending', 'and', 'shear', 'stiffnesses', 'for', 'a', 'micropolar', 'webcore', 'sandwich', 'beam', 'are', 'determined', 'through', 'unit', 'cell', 'analysis', 'where', 'the', 'split', 'of', 'the', 'shear', 'forces', 'into', 'symmetric', 'and', 'antisymmetric', 'parts', 'plays', 'a', 'pivotal', 'role', 'static', 'bending', 'of', 'webcore', 'beams', 'is', 'studied', 'using', 'the', 'micropolar', 'model', 'as', 'well', 'as', 'modified', 'couplestress', 'and', 'classical', 'timoshenko', 'beams', 'the', '1d', 'micropolar', 'results', 'are', 'in', 'best', 'agreement', 'with', '2d', 'webcore', 'beam', 'frame', 'results', 'this', 'is', 'because', 'the', 'micropolar', 'beam', 'allows', 'antisymmetric', 'shear', 'deformation', 'to', 'emerge', 'at', 'locations', 'where', 'the', '2d', 'webcore', 'deformations', 'can', 'not', 'be', 'reduced', 'to', '1d', 'by', 'considering', 'only', 'symmetric', 'shear', 'behavior']] | [-0.1056753697746492, 0.13160253128596952, -0.05136379304503162, -0.0032160842817250666, -0.07493085309967294, -0.18451792902436914, -0.09840373251378745, 0.36980700539425015, -0.3034474336626855, -0.22268989148152457, 0.0803872217600058, -0.238803804352317, -0.13252014432988174, 0.15822219092177447, -0.00043913097465996974, 0.1100436017907166, 0.03211626590805949, -0.0539299704140977, -0.053952883400158934, -0.12439182751089126, 0.25989830914975987, 0.07494296811495002, 0.35835662750540287, 0.0009228460738187903, 0.12743393389403923, 0.05926813377666619, 0.03785141117193482, 0.07252448827184581, -0.17382770867927091, 0.07769065450264753, 0.22432564306756728, -0.007968562251360682, 0.1909670184880912, -0.44990295217326887, -0.23710731491837259, -0.0021431122131489373, 0.13228524300771263, 0.1479878789725733, 0.003896338348211786, -0.22980975617582983, 0.04434690792585717, -0.13513461010973457, -0.19862604489667224, -0.05457417624253597, -0.030407199675178194, 0.06286850574888758, -0.3037661219478122, 0.13057279172092937, 0.05720047108662946, 0.033769265490085854, -0.11770920381251189, -0.09787635846711513, -0.06400350946770213, 0.047776835547252136, 0.07269733014412329, 0.045582407883570326, 0.1497508799242038, -0.11524288926657836, -0.02851304422308515, 0.4794800804628359, -0.05421086133073468, -0.3128719855890808, 0.10635005715759015, -0.09914006470048058, -0.004444372661125202, 0.1328982752698988, 0.1745438582428334, 0.09767485609265057, -0.13829609695691747, 0.04166508110043091, -0.06513542209107143, 0.15050437283731502, 0.14809690196379707, -0.0816084123249642, 0.1913264132645372, 0.17846202318250506, 0.029271097166685165, 0.1728044367269971, -0.09438520069136382, -0.11927965991166453, -0.3306496132399652, -0.1174128794964481, -0.1332684051037043, 0.014385260070997316, -0.058453844775021614, -0.15829032871194862, 0.3812994977224853, 0.016639857967726077, 0.09588876717326629, 0.0341492267390648, 0.2725807358641047, 0.13048578473947733, 0.04176864952461182, 0.028744565807380617, 0.30542565031967067, 0.23415807413158718, 0.11154725985647133, -0.202393676447389, -0.01705834675918926, 0.13223890835823088] |
1,802.08122 | Harmonious Attention Network for Person Re-Identification | Existing person re-identification (re-id) methods either assume the
availability of well-aligned person bounding box images as model input or rely
on constrained attention selection mechanisms to calibrate misaligned images.
They are therefore sub-optimal for re-id matching in arbitrarily aligned person
images potentially with large human pose variations and unconstrained
auto-detection errors. In this work, we show the advantages of jointly learning
attention selection and feature representation in a Convolutional Neural
Network (CNN) by maximising the complementary information of different levels
of visual attention subject to re-id discriminative learning constraints.
Specifically, we formulate a novel Harmonious Attention CNN (HA-CNN) model for
joint learning of soft pixel attention and hard regional attention along with
simultaneous optimisation of feature representations, dedicated to optimise
person re-id in uncontrolled (misaligned) images. Extensive comparative
evaluations validate the superiority of this new HA-CNN model for person re-id
over a wide variety of state-of-the-art methods on three large-scale benchmarks
including CUHK03, Market-1501, and DukeMTMC-ReID.
| cs.CV | existing person reidentification reid methods either assume the availability of wellaligned person bounding box images as model input or rely on constrained attention selection mechanisms to calibrate misaligned images they are therefore suboptimal for reid matching in arbitrarily aligned person images potentially with large human pose variations and unconstrained autodetection errors in this work we show the advantages of jointly learning attention selection and feature representation in a convolutional neural network cnn by maximising the complementary information of different levels of visual attention subject to reid discriminative learning constraints specifically we formulate a novel harmonious attention cnn hacnn model for joint learning of soft pixel attention and hard regional attention along with simultaneous optimisation of feature representations dedicated to optimise person reid in uncontrolled misaligned images extensive comparative evaluations validate the superiority of this new hacnn model for person reid over a wide variety of stateoftheart methods on three largescale benchmarks including cuhk03 market1501 and dukemtmcreid | [['existing', 'person', 'reidentification', 'reid', 'methods', 'either', 'assume', 'the', 'availability', 'of', 'wellaligned', 'person', 'bounding', 'box', 'images', 'as', 'model', 'input', 'or', 'rely', 'on', 'constrained', 'attention', 'selection', 'mechanisms', 'to', 'calibrate', 'misaligned', 'images', 'they', 'are', 'therefore', 'suboptimal', 'for', 'reid', 'matching', 'in', 'arbitrarily', 'aligned', 'person', 'images', 'potentially', 'with', 'large', 'human', 'pose', 'variations', 'and', 'unconstrained', 'autodetection', 'errors', 'in', 'this', 'work', 'we', 'show', 'the', 'advantages', 'of', 'jointly', 'learning', 'attention', 'selection', 'and', 'feature', 'representation', 'in', 'a', 'convolutional', 'neural', 'network', 'cnn', 'by', 'maximising', 'the', 'complementary', 'information', 'of', 'different', 'levels', 'of', 'visual', 'attention', 'subject', 'to', 'reid', 'discriminative', 'learning', 'constraints', 'specifically', 'we', 'formulate', 'a', 'novel', 'harmonious', 'attention', 'cnn', 'hacnn', 'model', 'for', 'joint', 'learning', 'of', 'soft', 'pixel', 'attention', 'and', 'hard', 'regional', 'attention', 'along', 'with', 'simultaneous', 'optimisation', 'of', 'feature', 'representations', 'dedicated', 'to', 'optimise', 'person', 'reid', 'in', 'uncontrolled', 'misaligned', 'images', 'extensive', 'comparative', 'evaluations', 'validate', 'the', 'superiority', 'of', 'this', 'new', 'hacnn', 'model', 'for', 'person', 'reid', 'over', 'a', 'wide', 'variety', 'of', 'stateoftheart', 'methods', 'on', 'three', 'largescale', 'benchmarks', 'including', 'cuhk03', 'market1501', 'and', 'dukemtmcreid']] | [-0.033192439960291635, -0.08912318116416793, -0.016959402044968947, 0.05181150655254613, -0.1620194785351345, -0.26031768154625046, -0.01228899184868417, 0.505007427451866, -0.22656680437941829, -0.3637763002476135, 0.04985273021345885, -0.2711507487666412, -0.16407290876800704, 0.16530131844670645, -0.22199440086842515, 0.12942345148064316, 0.1959767455821736, -0.0033088503549081067, -0.06511128826184778, -0.3065828675768556, 0.2990962118566048, 0.016069251357565647, 0.3757850530303337, 0.00675883074820211, 0.1613765002588149, -0.0031831719029646417, -0.09523431274150922, -0.01166160451144346, -0.0597009125344044, 0.19908389659876657, 0.3377000934674175, 0.1928642444197669, 0.35387273741033315, -0.38274457259103656, -0.23707137063565942, 0.0796431596874707, 0.12691301784732126, 0.07907010132277553, -0.04683940176241245, -0.40467507339554365, 0.05319284411848753, -0.19652020270586945, 0.08576177087515689, -0.12708820584653455, -0.00568013392425106, -0.04058636555466317, -0.3190705754987702, 0.012177468770389239, 0.053842972906785656, 0.10123398753076598, -0.062163278660827694, -0.121430379385431, 0.03528072596104308, 0.19640516678881287, 0.0685907271834296, 0.05816375373941302, 0.1420789922998807, -0.2791547948175545, -0.1328842483367166, 0.3694757085608004, -0.04043476470873098, -0.24235517035734344, 0.21189539407473662, -0.012607446749613003, -0.18183447797661767, 0.12124739264821416, 0.2959723821652194, 0.14938006740571422, -0.13988140774830304, -0.007916568773919596, -0.11139176844304742, 0.145213996751881, 0.06987488482982017, 0.0009345999773736898, 0.23091840702592842, 0.23830800439993088, 0.03490331473415596, 0.11941301151686771, -0.19766982696200538, -0.08714529378838572, -0.13469331523451905, -0.007158219489244768, -0.19727932736610196, -0.05378394855742718, -0.09535883545426518, -0.12149824027286528, 0.43757493985671697, 0.24355253256561066, 0.2452131515102727, 0.10395432630774577, 0.375890916431105, -0.07249265935728569, 0.14671048869124867, 0.05385899094126925, 0.1869917291113744, -0.040699913891271595, 0.0980587730497158, -0.18889504960169654, 0.0652857600067222, 0.05493611488158682] |
1,802.08123 | Dual Shapiro steps of a phase-slip junction in the presence of a
parasitic capacitance | Bloch oscillations in a single Josephson junction in the phase-slip regime
relate current to frequency. They can be measured by applying a periodic drive
to a DC-biased, small Josephson junction. Phase-locking between the periodic
drive and the Bloch oscillations then gives rise to steps at constant current
in the I-V curves, also known as dual Shapiro steps. Unlike conventional
Shapiro steps, a measurement of these dual Shapiro steps is impeded by the
presence of a parasitic capacitance. This capacitance shunts the junction
resulting in a suppression of the amplitude of the Bloch oscillations. This
detrimental effect of the parasitic capacitance can be remedied by an on-chip
superinductance. Additionally, we introduce a large off-chip resistance to
provide the necessary dissipation. We investigate the resulting system by a set
of analytical and numerical methods. In particular, we obtain an explicit
analytical expression for the height of dual Shapiro steps as a function of the
ratio of the parasitic capacitance to the superinductance. Using this result,
we provide a quantitative estimate of the dual Shapiro step height. Our
calculations reveal that even in the presence of a parasitic capacitance, it
should be possible to observe Bloch oscillations with realistic experimental
parameters.
| cond-mat.mes-hall quant-ph | bloch oscillations in a single josephson junction in the phaseslip regime relate current to frequency they can be measured by applying a periodic drive to a dcbiased small josephson junction phaselocking between the periodic drive and the bloch oscillations then gives rise to steps at constant current in the iv curves also known as dual shapiro steps unlike conventional shapiro steps a measurement of these dual shapiro steps is impeded by the presence of a parasitic capacitance this capacitance shunts the junction resulting in a suppression of the amplitude of the bloch oscillations this detrimental effect of the parasitic capacitance can be remedied by an onchip superinductance additionally we introduce a large offchip resistance to provide the necessary dissipation we investigate the resulting system by a set of analytical and numerical methods in particular we obtain an explicit analytical expression for the height of dual shapiro steps as a function of the ratio of the parasitic capacitance to the superinductance using this result we provide a quantitative estimate of the dual shapiro step height our calculations reveal that even in the presence of a parasitic capacitance it should be possible to observe bloch oscillations with realistic experimental parameters | [['bloch', 'oscillations', 'in', 'a', 'single', 'josephson', 'junction', 'in', 'the', 'phaseslip', 'regime', 'relate', 'current', 'to', 'frequency', 'they', 'can', 'be', 'measured', 'by', 'applying', 'a', 'periodic', 'drive', 'to', 'a', 'dcbiased', 'small', 'josephson', 'junction', 'phaselocking', 'between', 'the', 'periodic', 'drive', 'and', 'the', 'bloch', 'oscillations', 'then', 'gives', 'rise', 'to', 'steps', 'at', 'constant', 'current', 'in', 'the', 'iv', 'curves', 'also', 'known', 'as', 'dual', 'shapiro', 'steps', 'unlike', 'conventional', 'shapiro', 'steps', 'a', 'measurement', 'of', 'these', 'dual', 'shapiro', 'steps', 'is', 'impeded', 'by', 'the', 'presence', 'of', 'a', 'parasitic', 'capacitance', 'this', 'capacitance', 'shunts', 'the', 'junction', 'resulting', 'in', 'a', 'suppression', 'of', 'the', 'amplitude', 'of', 'the', 'bloch', 'oscillations', 'this', 'detrimental', 'effect', 'of', 'the', 'parasitic', 'capacitance', 'can', 'be', 'remedied', 'by', 'an', 'onchip', 'superinductance', 'additionally', 'we', 'introduce', 'a', 'large', 'offchip', 'resistance', 'to', 'provide', 'the', 'necessary', 'dissipation', 'we', 'investigate', 'the', 'resulting', 'system', 'by', 'a', 'set', 'of', 'analytical', 'and', 'numerical', 'methods', 'in', 'particular', 'we', 'obtain', 'an', 'explicit', 'analytical', 'expression', 'for', 'the', 'height', 'of', 'dual', 'shapiro', 'steps', 'as', 'a', 'function', 'of', 'the', 'ratio', 'of', 'the', 'parasitic', 'capacitance', 'to', 'the', 'superinductance', 'using', 'this', 'result', 'we', 'provide', 'a', 'quantitative', 'estimate', 'of', 'the', 'dual', 'shapiro', 'step', 'height', 'our', 'calculations', 'reveal', 'that', 'even', 'in', 'the', 'presence', 'of', 'a', 'parasitic', 'capacitance', 'it', 'should', 'be', 'possible', 'to', 'observe', 'bloch', 'oscillations', 'with', 'realistic', 'experimental', 'parameters']] | [-0.2185251224066385, 0.1233038689173591, -0.044350189187404035, 0.02439408883043198, -0.061189065503916056, -0.15413709715563767, 0.09590418613633385, 0.31834705283564296, -0.24985455196689477, -0.2989949789791923, 0.03900043745619254, -0.21188058049624992, -0.17638215116628522, 0.25935616254256194, -0.06935418957157644, 0.020480491279746698, 0.04803822518354564, -0.03351055107736781, -0.04757467360380388, -0.18024731227243054, 0.2542360886658608, 0.04923020015268427, 0.2825198318207204, 0.06908665464090352, 0.05729047606717983, -0.039733082247719244, 0.03343518224140309, 0.06651782012553979, -0.13088034865884562, 0.027031942694024605, 0.23750422949517014, -0.0069609819911420345, 0.23693161749403285, -0.4963853298357189, -0.18132069937865994, 0.06902337265541927, 0.15487165912377854, 0.1856727293360922, -0.018982706145816153, -0.2666502512445805, 0.048826115894380656, -0.10600971263207759, -0.12427147203642461, -0.046510795465284825, 0.027535232307267083, 0.03819030946158249, -0.26967557054013014, 0.07017303271218546, 0.0562755577430844, 0.016588070496557823, -0.023312530014663935, -0.05185656437522149, 0.01054812453903559, 0.10342251036946445, -0.005068248589382027, 0.025198822848103715, 0.14007083950282045, -0.08066536365676615, -0.12346908710003275, 0.2745043647233303, -0.08664083920038221, -0.18078348894645882, 0.09957322752752314, -0.1502523179485867, -0.03298859008719599, 0.12981920900067898, 0.10583409217346196, 0.07272543903496681, -0.12474935593623245, 0.03130184085345874, 0.01370439018978916, 0.15096745091623326, 0.12316713690748345, 0.04200936234650211, 0.23077748096877276, 0.174053718973859, 0.06815445872706907, 0.15990938924340004, -0.14550956589583722, -0.024060836727695652, -0.3455794722246326, -0.1568972414554652, -0.1645174673611458, 0.10663599344064491, -0.06362399394900863, -0.20762992374166245, 0.441849424136859, 0.15931253789481942, 0.22287287288392432, 0.015445154105875209, 0.34950676753721904, 0.20664561088345393, 0.0987035930944569, -0.003188427429495737, 0.2588349864042054, 0.17439854659511697, 0.1222459965178536, -0.35135507045991043, 0.05487347476894619, 0.023937060949251507] |
1,802.08124 | Deterministic Quantum Network for Distributed Entanglement and Quantum
Computation | We propose a simple interaction protocol to be implemented on a scalable
quantum network, in which the quantum nodes consist of qubit systems confined
in cavities. The nodes are deterministically coupled by transmission and
reflection of a single photon, which is disentangled from the qubits at the end
of the coupling operation. This single photon can generate an entangling
controlled phase (C-PHASE) gate between any selected number of qubits in the
network. Our multi-qubit gate reaches a much higher fidelity compared to
schemes concatenating one-qubit and two-qubit gates; thus it forms an efficient
basis for universal quantum computing distributed over multiple processor
units. In our analysis we consider atomic qubits coupled to optical photons,
while the scheme can be readily generalized to other architectures, such as
superconducting qubit nodes coupled by microwave photons.
| quant-ph | we propose a simple interaction protocol to be implemented on a scalable quantum network in which the quantum nodes consist of qubit systems confined in cavities the nodes are deterministically coupled by transmission and reflection of a single photon which is disentangled from the qubits at the end of the coupling operation this single photon can generate an entangling controlled phase cphase gate between any selected number of qubits in the network our multiqubit gate reaches a much higher fidelity compared to schemes concatenating onequbit and twoqubit gates thus it forms an efficient basis for universal quantum computing distributed over multiple processor units in our analysis we consider atomic qubits coupled to optical photons while the scheme can be readily generalized to other architectures such as superconducting qubit nodes coupled by microwave photons | [['we', 'propose', 'a', 'simple', 'interaction', 'protocol', 'to', 'be', 'implemented', 'on', 'a', 'scalable', 'quantum', 'network', 'in', 'which', 'the', 'quantum', 'nodes', 'consist', 'of', 'qubit', 'systems', 'confined', 'in', 'cavities', 'the', 'nodes', 'are', 'deterministically', 'coupled', 'by', 'transmission', 'and', 'reflection', 'of', 'a', 'single', 'photon', 'which', 'is', 'disentangled', 'from', 'the', 'qubits', 'at', 'the', 'end', 'of', 'the', 'coupling', 'operation', 'this', 'single', 'photon', 'can', 'generate', 'an', 'entangling', 'controlled', 'phase', 'cphase', 'gate', 'between', 'any', 'selected', 'number', 'of', 'qubits', 'in', 'the', 'network', 'our', 'multiqubit', 'gate', 'reaches', 'a', 'much', 'higher', 'fidelity', 'compared', 'to', 'schemes', 'concatenating', 'onequbit', 'and', 'twoqubit', 'gates', 'thus', 'it', 'forms', 'an', 'efficient', 'basis', 'for', 'universal', 'quantum', 'computing', 'distributed', 'over', 'multiple', 'processor', 'units', 'in', 'our', 'analysis', 'we', 'consider', 'atomic', 'qubits', 'coupled', 'to', 'optical', 'photons', 'while', 'the', 'scheme', 'can', 'be', 'readily', 'generalized', 'to', 'other', 'architectures', 'such', 'as', 'superconducting', 'qubit', 'nodes', 'coupled', 'by', 'microwave', 'photons']] | [-0.19401843189016768, 0.20327500647649036, 0.006382262918930081, -0.05226853486724702, 0.04024004561588504, -0.30989579255587624, 0.10462887192151993, 0.4316848822260149, -0.24933854244033196, -0.3038044373497815, -0.007001225710531375, -0.2479325124216651, -0.06458319049753963, 0.25959041246206016, -0.0354624088447457, 0.09709535985904977, 0.0628536968681037, 0.011825234580196832, -0.06462148304164753, -0.27213605228615434, 0.2623310679074419, 0.03729348587348385, 0.3146177314964116, -0.03443405000997105, 0.12226270656696611, -0.012995232533859579, 0.08748400179473192, -0.0617545826108496, -0.015465799976434363, 0.11184951494083761, 0.29849377278408346, 0.06875470456058033, 0.22815907540682115, -0.49439997216196435, -0.18352996917175396, 0.08093905347465936, 0.15849062703380054, 0.20112198749136992, -0.00046132436053673354, -0.3240900190750179, 0.006909647965243548, -0.2162413189143443, -0.022422492833233866, -0.10078232464051448, -0.05237177357469734, -0.025274727504903494, -0.26175466472549097, 0.018858688564873057, 0.0023106170566122336, 0.00607161275968936, 0.06288521790253769, 0.04447609911623754, 0.020718421226829514, 0.10063617438238982, -0.17420986644079894, 0.023437469014267725, 0.20141413196557223, -0.08143181577184819, -0.18959777785072984, 0.3070672257502276, -0.015691107958275125, -0.19718635670448603, 0.14305140162096883, -0.043649799635115644, -0.08309446254927189, 0.06242332116637687, 0.17408103293816285, 0.09611788985172384, -0.15706950807383746, 0.030262353542064756, 0.012445160222792984, 0.2612160967130746, 0.06716449563286471, 0.14468682325564156, 0.22391204252012803, 0.14093874225434952, 0.096445974844851, 0.22169844337600753, -0.060037600284414294, -0.11303052174704696, -0.29766121696850595, -0.18743193280161882, -0.26855846706609754, 0.08134893307556867, -0.0996750148704286, -0.13203294288465067, 0.42740808782277473, 0.12129389949377514, 0.16639946070954875, -0.01140188382539366, 0.35612397530305206, 0.1367192646721378, 0.1536777547308545, 0.11581320514818444, 0.21554616492773807, 0.16251689954345724, 0.035837959350240804, -0.257287367451866, 0.012793746731363069, -0.021048655638933406] |
1,802.08125 | The non-linear onset of neutrino-driven convection in two and
three-dimensional core-collapse supernovae | A toy model of the post-shock region of core-collapse supernovae is used to
study the non-linear development of turbulent motions driven by convection in
the presence of advection. Our numerical simulations indicate that buoyant
perturbations of density are able to trigger self-sustained convection only
when the instability is not linearly stabilized by advection. Large amplitude
perturbations produced by strong shock oscillations or combustion
inhomogeneities before the collapse of the progenitor are efficiently shredded
through phase mixing and generate a turbulent cascade. Our model enables us to
investigate several physical arguments that had been proposed to explain the
impact of the dimensionality on the onset of explosions in global simulations
of core-collapse supernovae. Three-dimensional (3D) simulations are found to
lead to higher entropy values than two-dimensional (2D) ones. We attribute this
to greater turbulent mixing and dissipation of the kinetic energy into heat in
3D. Our results show that the increase of entropy is enhanced with finer
numerical resolution and larger perturbation amplitude.
| astro-ph.SR astro-ph.HE | a toy model of the postshock region of corecollapse supernovae is used to study the nonlinear development of turbulent motions driven by convection in the presence of advection our numerical simulations indicate that buoyant perturbations of density are able to trigger selfsustained convection only when the instability is not linearly stabilized by advection large amplitude perturbations produced by strong shock oscillations or combustion inhomogeneities before the collapse of the progenitor are efficiently shredded through phase mixing and generate a turbulent cascade our model enables us to investigate several physical arguments that had been proposed to explain the impact of the dimensionality on the onset of explosions in global simulations of corecollapse supernovae threedimensional 3d simulations are found to lead to higher entropy values than twodimensional 2d ones we attribute this to greater turbulent mixing and dissipation of the kinetic energy into heat in 3d our results show that the increase of entropy is enhanced with finer numerical resolution and larger perturbation amplitude | [['a', 'toy', 'model', 'of', 'the', 'postshock', 'region', 'of', 'corecollapse', 'supernovae', 'is', 'used', 'to', 'study', 'the', 'nonlinear', 'development', 'of', 'turbulent', 'motions', 'driven', 'by', 'convection', 'in', 'the', 'presence', 'of', 'advection', 'our', 'numerical', 'simulations', 'indicate', 'that', 'buoyant', 'perturbations', 'of', 'density', 'are', 'able', 'to', 'trigger', 'selfsustained', 'convection', 'only', 'when', 'the', 'instability', 'is', 'not', 'linearly', 'stabilized', 'by', 'advection', 'large', 'amplitude', 'perturbations', 'produced', 'by', 'strong', 'shock', 'oscillations', 'or', 'combustion', 'inhomogeneities', 'before', 'the', 'collapse', 'of', 'the', 'progenitor', 'are', 'efficiently', 'shredded', 'through', 'phase', 'mixing', 'and', 'generate', 'a', 'turbulent', 'cascade', 'our', 'model', 'enables', 'us', 'to', 'investigate', 'several', 'physical', 'arguments', 'that', 'had', 'been', 'proposed', 'to', 'explain', 'the', 'impact', 'of', 'the', 'dimensionality', 'on', 'the', 'onset', 'of', 'explosions', 'in', 'global', 'simulations', 'of', 'corecollapse', 'supernovae', 'threedimensional', '3d', 'simulations', 'are', 'found', 'to', 'lead', 'to', 'higher', 'entropy', 'values', 'than', 'twodimensional', '2d', 'ones', 'we', 'attribute', 'this', 'to', 'greater', 'turbulent', 'mixing', 'and', 'dissipation', 'of', 'the', 'kinetic', 'energy', 'into', 'heat', 'in', '3d', 'our', 'results', 'show', 'that', 'the', 'increase', 'of', 'entropy', 'is', 'enhanced', 'with', 'finer', 'numerical', 'resolution', 'and', 'larger', 'perturbation', 'amplitude']] | [-0.11074758521108716, 0.19538770369139075, -0.044485516739825225, 0.09333065185224476, -0.07342639163331945, -0.05719015354083644, -0.013800011904634259, 0.3164993973080943, -0.25108237223078805, -0.30384190748790624, 0.08030151328672712, -0.2519695347600421, -0.10015028758969066, 0.21721537878742603, 0.001475812395604149, 0.026111933588927733, 0.10261584262084791, -0.0623823087145057, -0.04881281692413958, -0.20956030241817375, 0.3196024859071146, 0.12377549555256134, 0.25954179726771, -0.0012793270554853442, 0.04768893872833247, -0.17342824529264306, -0.04719210551752721, 0.0275247229412658, -0.16230655646812706, 0.02793109817660333, 0.1626011059886451, 0.06223149846141215, 0.2569583148040153, -0.5046098844182713, -0.3472529661807197, 0.0694718560014196, 0.19537852684116383, 0.13901139622738148, -0.06516901131975895, -0.25997432571674844, 0.0931180815304411, -0.19434521970465596, -0.12104551248930763, -0.08182785688629259, 0.0073708734866001725, 0.03315403135773657, -0.29294672167721997, 0.1583772457699165, 0.0535371592228824, 0.03217200917065328, -0.06533922007944101, -0.013241390140014297, -0.1150724837674334, 0.062183950872650585, 0.08802454708500501, 0.0009970779079414996, 0.15545610233531965, -0.14338459786175703, -0.03249055370228526, 0.40368758774374003, -0.06701351562990983, -0.15891303588567232, 0.23486397731589315, -0.19952059789549237, -0.04892644006758928, 0.22781144139819698, 0.20209977768051127, 0.08213151933878292, -0.07090894898507862, -0.0471600144594925, -0.01066021364323082, 0.17302389014914724, 0.03718156447881304, -0.034301000197395036, 0.21766658200031538, 0.2066343330812675, 0.012375195556676682, 0.12020094019079144, -0.13768358955074986, -0.11469133588611896, -0.27546301670947376, -0.10190577769399058, -0.14587262919586566, 0.0726285260150038, -0.10388250284180416, -0.17223697850397315, 0.3649346771230346, 0.20230687684149562, 0.16521362212980972, -0.015297117539578013, 0.29701888582232283, 0.09833913979071687, 0.07175170496123394, 0.11424600002413363, 0.3103254657974582, 0.17990683641049, 0.13247700938724993, -0.2980427598626709, 0.06142165112585105, 0.08444226430053535] |
1,802.08126 | Time-parallel iterative solvers for parabolic evolution equations | We present original time-parallel algorithms for the solution of the implicit
Euler discretization of general linear parabolic evolution equations with
time-dependent self-adjoint spatial operators. Motivated by the inf-sup theory
of parabolic problems, we show that the standard nonsymmetric time-global
system can be equivalently reformulated as an original symmetric saddle-point
system that remains inf-sup stable with respect to the same natural parabolic
norms. We then propose and analyse an efficient and readily implementable
parallel-in-time preconditioner to be used with an inexact Uzawa method. The
proposed preconditioner is non-intrusive and easy to implement in practice, and
also features the key theoretical advantages of robust spectral bounds, leading
to convergence rates that are independent of the number of time-steps, final
time, or spatial mesh sizes, and also a theoretical parallel complexity that
grows only logarithmically with respect to the number of time-steps. Numerical
experiments with large-scale parallel computations show the effectiveness of
the method, along with its good weak and strong scaling properties.
| math.NA | we present original timeparallel algorithms for the solution of the implicit euler discretization of general linear parabolic evolution equations with timedependent selfadjoint spatial operators motivated by the infsup theory of parabolic problems we show that the standard nonsymmetric timeglobal system can be equivalently reformulated as an original symmetric saddlepoint system that remains infsup stable with respect to the same natural parabolic norms we then propose and analyse an efficient and readily implementable parallelintime preconditioner to be used with an inexact uzawa method the proposed preconditioner is nonintrusive and easy to implement in practice and also features the key theoretical advantages of robust spectral bounds leading to convergence rates that are independent of the number of timesteps final time or spatial mesh sizes and also a theoretical parallel complexity that grows only logarithmically with respect to the number of timesteps numerical experiments with largescale parallel computations show the effectiveness of the method along with its good weak and strong scaling properties | [['we', 'present', 'original', 'timeparallel', 'algorithms', 'for', 'the', 'solution', 'of', 'the', 'implicit', 'euler', 'discretization', 'of', 'general', 'linear', 'parabolic', 'evolution', 'equations', 'with', 'timedependent', 'selfadjoint', 'spatial', 'operators', 'motivated', 'by', 'the', 'infsup', 'theory', 'of', 'parabolic', 'problems', 'we', 'show', 'that', 'the', 'standard', 'nonsymmetric', 'timeglobal', 'system', 'can', 'be', 'equivalently', 'reformulated', 'as', 'an', 'original', 'symmetric', 'saddlepoint', 'system', 'that', 'remains', 'infsup', 'stable', 'with', 'respect', 'to', 'the', 'same', 'natural', 'parabolic', 'norms', 'we', 'then', 'propose', 'and', 'analyse', 'an', 'efficient', 'and', 'readily', 'implementable', 'parallelintime', 'preconditioner', 'to', 'be', 'used', 'with', 'an', 'inexact', 'uzawa', 'method', 'the', 'proposed', 'preconditioner', 'is', 'nonintrusive', 'and', 'easy', 'to', 'implement', 'in', 'practice', 'and', 'also', 'features', 'the', 'key', 'theoretical', 'advantages', 'of', 'robust', 'spectral', 'bounds', 'leading', 'to', 'convergence', 'rates', 'that', 'are', 'independent', 'of', 'the', 'number', 'of', 'timesteps', 'final', 'time', 'or', 'spatial', 'mesh', 'sizes', 'and', 'also', 'a', 'theoretical', 'parallel', 'complexity', 'that', 'grows', 'only', 'logarithmically', 'with', 'respect', 'to', 'the', 'number', 'of', 'timesteps', 'numerical', 'experiments', 'with', 'largescale', 'parallel', 'computations', 'show', 'the', 'effectiveness', 'of', 'the', 'method', 'along', 'with', 'its', 'good', 'weak', 'and', 'strong', 'scaling', 'properties']] | [-0.09703144834784325, 0.0338536003905574, -0.076968635013327, 0.04211934782579192, -0.08599713555449853, -0.17653108598315156, -0.01799683910285239, 0.38767245651688426, -0.34551887339912357, -0.2697017917387711, 0.12873730108185555, -0.20822043421467243, -0.11913037542981328, 0.1921690187344211, -0.08887602686008904, 0.13143955637096952, 0.10862966185377446, -0.013088994051213377, -0.1274506254878361, -0.27680567758361574, 0.3019214761327021, 0.07126030914369039, 0.26612504063086817, 0.015467360452748834, 0.10756875759689137, -0.05353227475279709, -0.015854499978013338, 0.053768107388168576, -0.08257584103939734, 0.12583028908993582, 0.2454613483736466, 0.0872224649301188, 0.31147872991277836, -0.4480524542159401, -0.1435552227878361, 0.08230741427978501, 0.16878754669451154, 0.11639680277730804, -0.06508569752331823, -0.27731274002726425, 0.1253047217905987, -0.13146737051138188, -0.1724378557235468, -0.1539573520596605, -0.022647719292581314, 0.06897362156305462, -0.3203209191560745, 0.08894646449510901, 0.043107128355768506, 0.022895633348525735, -0.05628940219394281, -0.10695406049853773, -0.00305954181967536, 0.06351292374165496, 0.06450352044043939, -0.01666608681844082, 0.05032786788942758, -0.053037774478434586, -0.1149493661010638, 0.37434000156936237, -0.09276995650288881, -0.2722979754442349, 0.19960443237214348, -0.06529374341771473, -0.09690951528173172, 0.1295136230721255, 0.18548523642239162, 0.18221621402153687, -0.09664553443071781, 0.109583745321288, -0.05774432322359644, 0.1955304766444897, 0.02774617087416118, 0.013212068692155299, 0.06475690581137314, 0.137071287100116, 0.14164208416332258, 0.12577697706001345, -0.017913567478535695, -0.13970512505729857, -0.30904689634917304, -0.15781855877139606, -0.16436410986061673, -0.01487482046632067, -0.16872515588420356, -0.2093874019505165, 0.37427543716912626, 0.1888009569287533, 0.15642826584371505, 0.11645888119819574, 0.3373812837176956, 0.15828136328418624, 0.04140772566242958, 0.11432871013839759, 0.18320005419809604, 0.15089138910407202, 0.0933052341642906, -0.2796717422490474, 0.043033475792617536, 0.13406614513423848] |
1,802.08127 | Mapping Analytic sets onto cubes by little Lipschitz functions | A mapping $f:X\to Y$ between metric spaces is called \emph{little Lipschitz}
if the quantity $$
\operatorname{lip}(f(x)=\liminf_{r\to0}\frac{\operatorname{diam}
f(B(x,r))}{r} $$ is finite for every $x\in X$.
We prove that if a compact (or, more generally, analytic) metric space has
packing dimension greater than $n$, then $X$ can be mapped onto an
$n$-dimensional cube by a little Lipschitz function.
The result requires two facts that are interesing in their own right. First,
an analytic metric space $X$ contains, for any $\varepsilon>0$, a compact
subset $S$ that embeds into an ultrametric space by a Lipschitz map, and
$\dim_P S\geq\dim_P X-\varepsilon$. Second, a little Lipschitz function on a
closed subset admits a little Lipschitz extension.
| math.CA | a mapping fxto y between metric spaces is called emphlittle lipschitz if the quantity operatornamelipfxliminf_rto0fracoperatornamediam fbxrr is finite for every xin x we prove that if a compact or more generally analytic metric space has packing dimension greater than n then x can be mapped onto an ndimensional cube by a little lipschitz function the result requires two facts that are interesing in their own right first an analytic metric space x contains for any varepsilon0 a compact subset s that embeds into an ultrametric space by a lipschitz map and dim_p sgeqdim_p xvarepsilon second a little lipschitz function on a closed subset admits a little lipschitz extension | [['a', 'mapping', 'fxto', 'y', 'between', 'metric', 'spaces', 'is', 'called', 'emphlittle', 'lipschitz', 'if', 'the', 'quantity', 'operatornamelipfxliminf_rto0fracoperatornamediam', 'fbxrr', 'is', 'finite', 'for', 'every', 'xin', 'x', 'we', 'prove', 'that', 'if', 'a', 'compact', 'or', 'more', 'generally', 'analytic', 'metric', 'space', 'has', 'packing', 'dimension', 'greater', 'than', 'n', 'then', 'x', 'can', 'be', 'mapped', 'onto', 'an', 'ndimensional', 'cube', 'by', 'a', 'little', 'lipschitz', 'function', 'the', 'result', 'requires', 'two', 'facts', 'that', 'are', 'interesing', 'in', 'their', 'own', 'right', 'first', 'an', 'analytic', 'metric', 'space', 'x', 'contains', 'for', 'any', 'varepsilon0', 'a', 'compact', 'subset', 's', 'that', 'embeds', 'into', 'an', 'ultrametric', 'space', 'by', 'a', 'lipschitz', 'map', 'and', 'dim_p', 'sgeqdim_p', 'xvarepsilon', 'second', 'a', 'little', 'lipschitz', 'function', 'on', 'a', 'closed', 'subset', 'admits', 'a', 'little', 'lipschitz', 'extension']] | [-0.15639682660576698, 0.10507174521164696, -0.0856771243807788, 0.08518488620309374, -0.1301453176375407, -0.15173079586552027, 0.02266441187552678, 0.43461187057591116, -0.30893879894238824, -0.10674388800711873, 0.11951027280324175, -0.32337742254961854, -0.1295283329896987, 0.20975357219755936, -0.12660260904857962, -0.03268972425632036, 0.022205035439513337, 0.11819704343528989, -0.12155166822888602, -0.24162740680353287, 0.37877473707955617, -0.10481560078019705, 0.14226299072974002, 0.027671009628997687, 0.21501148733883524, 0.00447469965743389, 0.03126359964237334, 0.05848994472678616, -0.17153843313497838, 0.07798920240468131, 0.23979435313958675, 0.16512497981490853, 0.33392777538392693, -0.3277408019759885, -0.2214093140613001, 0.25812699120545474, 0.10364652584897928, -0.06865230495504175, -0.04497753768947195, -0.28292644190458727, 0.13368552174562445, -0.09181448146745634, -0.12049743437315695, -0.06697185311126165, 0.14987893574512923, -0.05283344010464274, -0.3002092966881509, -0.046932692626097165, 0.12206255603366746, 0.0207993034273386, -0.08121587430091146, -0.06431816633378801, -0.10894881948255576, 0.08271224798674946, -0.07065917000783464, 0.26796634331045566, 0.07747928417554178, -0.0049124667933098795, -0.037989441999413356, 0.3535238178043913, -0.10340461158935235, -0.35489863630993146, 0.11569019359572288, -0.19727512419474527, -0.13866992644482076, 0.14573919190129694, 0.10529672297147605, 0.15588839973609608, -0.08950400758140649, 0.26613417566841235, -0.15370886585711, 0.21617117240720501, 0.07633736443508846, 0.019643467246518973, 0.10986458872391197, 0.13116332070561698, 0.20483071659691632, 0.13015765693070044, 0.03881326023838483, 0.006559906530198462, -0.34989904380619496, -0.18281794484265937, -0.1998179896080938, 0.16995332941937355, -0.18698343352508134, -0.1977425080168849, 0.26063469539020356, -0.015847826578045406, 0.24091274672313234, 0.1137817097433771, 0.2651443780453589, 0.05606979099012768, 0.005473124720783045, 0.12654530195196947, 0.06830265141951923, 0.10935786636904456, -0.039591447374102876, -0.05712346279128374, 0.07405493127701518, 0.18962259247648314] |
1,802.08128 | The moduli space of Fano manifolds with K\"ahler-Ricci solitons | We construct a canonical Hausdorff complex analytic moduli space of Fano
manifolds with K\"ahler-Ricci solitons. This naturally enlarges the moduli
space of Fano manifolds with K\"ahler-Einstein metrics, which was constructed
by Odaka and Li-Wang-Xu. We discover a moment map picture for K\"ahler-Ricci
solitons, and give complex analytic charts on the topological space consisting
of K\"ahler-Ricci solitons, by studying differential geometric aspects of this
infinite dimensional moment map. Some stacky words and arguments on
Gromov-Hausdorff convergence help to glue them together in the holomorphic
manner.
| math.DG math.AG | we construct a canonical hausdorff complex analytic moduli space of fano manifolds with kahlerricci solitons this naturally enlarges the moduli space of fano manifolds with kahlereinstein metrics which was constructed by odaka and liwangxu we discover a moment map picture for kahlerricci solitons and give complex analytic charts on the topological space consisting of kahlerricci solitons by studying differential geometric aspects of this infinite dimensional moment map some stacky words and arguments on gromovhausdorff convergence help to glue them together in the holomorphic manner | [['we', 'construct', 'a', 'canonical', 'hausdorff', 'complex', 'analytic', 'moduli', 'space', 'of', 'fano', 'manifolds', 'with', 'kahlerricci', 'solitons', 'this', 'naturally', 'enlarges', 'the', 'moduli', 'space', 'of', 'fano', 'manifolds', 'with', 'kahlereinstein', 'metrics', 'which', 'was', 'constructed', 'by', 'odaka', 'and', 'liwangxu', 'we', 'discover', 'a', 'moment', 'map', 'picture', 'for', 'kahlerricci', 'solitons', 'and', 'give', 'complex', 'analytic', 'charts', 'on', 'the', 'topological', 'space', 'consisting', 'of', 'kahlerricci', 'solitons', 'by', 'studying', 'differential', 'geometric', 'aspects', 'of', 'this', 'infinite', 'dimensional', 'moment', 'map', 'some', 'stacky', 'words', 'and', 'arguments', 'on', 'gromovhausdorff', 'convergence', 'help', 'to', 'glue', 'them', 'together', 'in', 'the', 'holomorphic', 'manner']] | [-0.22876354387725692, 0.04139401520187237, -0.14320858539340187, 0.17414489447655357, -0.14119911131011434, -0.12586310595633035, -0.007672493462450802, 0.3660194033066776, -0.25105759584490794, -0.1655334361537124, 0.08491361700980195, -0.26861213938703377, -0.21177093559000865, 0.17493013619986666, -0.1794466724596828, 0.02585286750312311, 0.06737560884331364, 0.03164165177528398, -0.11896039482699819, -0.3140071999416294, 0.5438718372641738, -0.05729861693254795, 0.2561338676745633, 0.05359741598255483, 0.15072323381900787, -0.04081175384863493, -0.000236594821228253, 0.006180593243544832, -0.2560640260218138, 0.179956707071109, 0.3069444676434778, 0.02440112987421004, 0.13551578715623144, -0.36073135402010115, -0.2266277240600482, 0.18127981308533483, 0.13833259278908372, 0.039015778007984434, 0.010100447045392301, -0.38093189271279126, 0.05043242573552254, -0.05998013586546463, -0.2205512515908803, -0.216368199847863, -0.0024535034569990203, 0.08972417335418692, -0.14426393052338657, -0.042244829731174265, 0.11509623131658657, 0.0831797579499747, -0.06508509218005508, -0.022792118180722715, -0.10803936278245535, 0.013157257103327527, 0.03537122332154358, 0.09653426765699882, 0.10960587261648602, -0.050754129727169764, -0.12061958773488021, 0.31257619562906674, -0.14436549534011317, -0.25869501103837805, 0.07012449496941843, -0.12164282351059008, -0.11349784100360899, 0.16731960070179214, 0.14424417457397443, 0.17977137400218882, -0.01629641832480858, 0.1452090110270733, -0.06946844569441066, 0.06746212675808425, 0.14486757618745408, 0.012429373417363828, 0.17008661024808233, 0.1564688494945147, 0.1600161447156086, 0.11748935025275113, 0.03711107615851348, -0.14054883828005157, -0.33550869736326744, -0.19537952570356878, -0.08545781171555261, 0.2125155547807689, -0.18745753778294094, -0.1835709977782814, 0.40061886553057885, -0.048490904061914794, 0.28269514656928646, 0.09928440826479346, 0.239406804756138, -0.006107787231364882, -0.013350411974656654, 0.055117845378187764, 0.15800414020819759, 0.2172791850865336, 0.09069627664242703, -0.1267374478938361, -0.108276673457978, 0.25698187593819505] |
1,802.08129 | Multimodal Explanations: Justifying Decisions and Pointing to the
Evidence | Deep models that are both effective and explainable are desirable in many
settings; prior explainable models have been unimodal, offering either
image-based visualization of attention weights or text-based generation of
post-hoc justifications. We propose a multimodal approach to explanation, and
argue that the two modalities provide complementary explanatory strengths. We
collect two new datasets to define and evaluate this task, and propose a novel
model which can provide joint textual rationale generation and attention
visualization. Our datasets define visual and textual justifications of a
classification decision for activity recognition tasks (ACT-X) and for visual
question answering tasks (VQA-X). We quantitatively show that training with the
textual explanations not only yields better textual justification models, but
also better localizes the evidence that supports the decision. We also
qualitatively show cases where visual explanation is more insightful than
textual explanation, and vice versa, supporting our thesis that multimodal
explanation models offer significant benefits over unimodal approaches.
| cs.AI cs.CL cs.CV | deep models that are both effective and explainable are desirable in many settings prior explainable models have been unimodal offering either imagebased visualization of attention weights or textbased generation of posthoc justifications we propose a multimodal approach to explanation and argue that the two modalities provide complementary explanatory strengths we collect two new datasets to define and evaluate this task and propose a novel model which can provide joint textual rationale generation and attention visualization our datasets define visual and textual justifications of a classification decision for activity recognition tasks actx and for visual question answering tasks vqax we quantitatively show that training with the textual explanations not only yields better textual justification models but also better localizes the evidence that supports the decision we also qualitatively show cases where visual explanation is more insightful than textual explanation and vice versa supporting our thesis that multimodal explanation models offer significant benefits over unimodal approaches | [['deep', 'models', 'that', 'are', 'both', 'effective', 'and', 'explainable', 'are', 'desirable', 'in', 'many', 'settings', 'prior', 'explainable', 'models', 'have', 'been', 'unimodal', 'offering', 'either', 'imagebased', 'visualization', 'of', 'attention', 'weights', 'or', 'textbased', 'generation', 'of', 'posthoc', 'justifications', 'we', 'propose', 'a', 'multimodal', 'approach', 'to', 'explanation', 'and', 'argue', 'that', 'the', 'two', 'modalities', 'provide', 'complementary', 'explanatory', 'strengths', 'we', 'collect', 'two', 'new', 'datasets', 'to', 'define', 'and', 'evaluate', 'this', 'task', 'and', 'propose', 'a', 'novel', 'model', 'which', 'can', 'provide', 'joint', 'textual', 'rationale', 'generation', 'and', 'attention', 'visualization', 'our', 'datasets', 'define', 'visual', 'and', 'textual', 'justifications', 'of', 'a', 'classification', 'decision', 'for', 'activity', 'recognition', 'tasks', 'actx', 'and', 'for', 'visual', 'question', 'answering', 'tasks', 'vqax', 'we', 'quantitatively', 'show', 'that', 'training', 'with', 'the', 'textual', 'explanations', 'not', 'only', 'yields', 'better', 'textual', 'justification', 'models', 'but', 'also', 'better', 'localizes', 'the', 'evidence', 'that', 'supports', 'the', 'decision', 'we', 'also', 'qualitatively', 'show', 'cases', 'where', 'visual', 'explanation', 'is', 'more', 'insightful', 'than', 'textual', 'explanation', 'and', 'vice', 'versa', 'supporting', 'our', 'thesis', 'that', 'multimodal', 'explanation', 'models', 'offer', 'significant', 'benefits', 'over', 'unimodal', 'approaches']] | [-0.012577440809561975, -0.013526556642080833, -0.10136390550768161, 0.15000012292666665, -0.2046847736822088, -0.24884161590202863, 0.05524609692613868, 0.4970558438620536, -0.20714607121715067, -0.31453852430959933, 0.015295749272256359, -0.2738985329123786, -0.24066775239961452, 0.19979259327930562, -0.1485984433271916, 0.014843163518782924, 0.13198109260863727, 0.03246141238224821, -0.035431221999483654, -0.27883328761512816, 0.2820553820263716, -0.0009893861165942831, 0.35050857592422785, 0.07969666107746413, 0.10766884939896484, -0.04483109531814561, -0.08431385544256545, -0.013499944200625608, -0.07309722343542091, 0.2156590267261064, 0.3585412212586817, 0.2857033447499442, 0.32943050114109235, -0.39070514422762237, -0.2773444437318378, 0.08480035267188975, 0.18584909331467417, 0.09478268929505325, -0.07237490330485313, -0.33409668719456864, 0.05922239928147177, -0.19295295617037933, 0.03641548311623921, -0.254743216769295, 0.047271711601543975, -0.054531330432974146, -0.2904933260455484, 0.05037410895958744, 0.16081576633687114, 0.13214676931890007, -0.07868692790176354, -0.13385466507216, 0.03700049879224179, 0.14652100284249078, 0.05773359766987828, 0.030753578984610785, 0.08572761607249846, -0.20393961230006633, -0.21430146368715022, 0.3631997260545058, -0.016729741722396333, -0.20778217495059947, 0.2690182572742011, -0.051608928197346554, -0.17328063035201208, 0.0486779988939673, 0.18659250366309768, 0.07961302432779442, -0.1568400715021234, -0.04445089789387447, -0.07355092803710232, 0.20261890652400802, 0.04130366621112901, 0.027933856043234177, 0.27206685745881665, 0.2508986721704014, -0.017277426225988473, 0.12430162724484903, -0.05495131358085238, -0.04655469721183181, -0.21725603339134478, -0.11617834836828943, -0.10607934172502627, -0.045390628946216906, -0.11227000886315687, -0.13533554435251097, 0.3761116995725756, 0.2952823185946281, 0.23208955656493607, 0.12532157687169007, 0.3619522673710937, 0.03996710282190417, 0.044430804547695504, 0.05579345563108564, 0.14005864228904125, -0.03524538475313997, 0.12427657436628163, -0.10129905648124739, 0.13159432710038826, 0.03583790363707379] |
1,802.0813 | A novel incentive-based demand response model for Cournot competition in
electricity markets | This paper presents an analysis of competition between generators when
incentive-based demand response is employed in an electricity market. Thermal
and hydropower generation are considered in the model. A smooth inverse demand
function is designed using a sigmoid and two linear functions for modeling the
consumer preferences under incentive-based demand response program. Generators
compete to sell energy bilaterally to consumers and system operator provides
transmission and arbitrage services. The profit of each agent is posed as an
optimization problem, then the competition result is found by solving
simultaneously Karush-Kuhn-Tucker conditions for all generators. A Nash-Cournot
equilibrium is found when the system operates normally and at peak demand times
when DR is required. Under this model, results show that DR diminishes the
energy consumption at peak periods, shifts the power requirement to off-peak
times and improves the net consumer surplus due to incentives received for
participating in DR program. However, the generators decrease their profit due
to the reduction of traded energy and market prices.
| cs.GT | this paper presents an analysis of competition between generators when incentivebased demand response is employed in an electricity market thermal and hydropower generation are considered in the model a smooth inverse demand function is designed using a sigmoid and two linear functions for modeling the consumer preferences under incentivebased demand response program generators compete to sell energy bilaterally to consumers and system operator provides transmission and arbitrage services the profit of each agent is posed as an optimization problem then the competition result is found by solving simultaneously karushkuhntucker conditions for all generators a nashcournot equilibrium is found when the system operates normally and at peak demand times when dr is required under this model results show that dr diminishes the energy consumption at peak periods shifts the power requirement to offpeak times and improves the net consumer surplus due to incentives received for participating in dr program however the generators decrease their profit due to the reduction of traded energy and market prices | [['this', 'paper', 'presents', 'an', 'analysis', 'of', 'competition', 'between', 'generators', 'when', 'incentivebased', 'demand', 'response', 'is', 'employed', 'in', 'an', 'electricity', 'market', 'thermal', 'and', 'hydropower', 'generation', 'are', 'considered', 'in', 'the', 'model', 'a', 'smooth', 'inverse', 'demand', 'function', 'is', 'designed', 'using', 'a', 'sigmoid', 'and', 'two', 'linear', 'functions', 'for', 'modeling', 'the', 'consumer', 'preferences', 'under', 'incentivebased', 'demand', 'response', 'program', 'generators', 'compete', 'to', 'sell', 'energy', 'bilaterally', 'to', 'consumers', 'and', 'system', 'operator', 'provides', 'transmission', 'and', 'arbitrage', 'services', 'the', 'profit', 'of', 'each', 'agent', 'is', 'posed', 'as', 'an', 'optimization', 'problem', 'then', 'the', 'competition', 'result', 'is', 'found', 'by', 'solving', 'simultaneously', 'karushkuhntucker', 'conditions', 'for', 'all', 'generators', 'a', 'nashcournot', 'equilibrium', 'is', 'found', 'when', 'the', 'system', 'operates', 'normally', 'and', 'at', 'peak', 'demand', 'times', 'when', 'dr', 'is', 'required', 'under', 'this', 'model', 'results', 'show', 'that', 'dr', 'diminishes', 'the', 'energy', 'consumption', 'at', 'peak', 'periods', 'shifts', 'the', 'power', 'requirement', 'to', 'offpeak', 'times', 'and', 'improves', 'the', 'net', 'consumer', 'surplus', 'due', 'to', 'incentives', 'received', 'for', 'participating', 'in', 'dr', 'program', 'however', 'the', 'generators', 'decrease', 'their', 'profit', 'due', 'to', 'the', 'reduction', 'of', 'traded', 'energy', 'and', 'market', 'prices']] | [-0.13007101661769854, 0.07285910281634864, -0.03777365308970485, 0.07828537288417177, -0.06839320596829965, -0.17020199847941445, 0.08437782794747518, 0.3961916988454305, -0.3033772303109489, -0.3086571870854397, 0.12924186585232525, -0.334616819559348, -0.0953668942021933, 0.1753577562361365, -0.13687580851724418, 0.029250411234409888, 0.035173637451385374, 0.01200060266291541, 0.03159059875888932, -0.28998018083412475, 0.24642706708414708, 0.1235945355601427, 0.36106858046430096, 0.07187051863463527, 0.12509813000697914, 0.02656947678273044, -0.00798489925346519, -0.010390345336551346, -0.07315029772645375, 0.11143172517768107, 0.3067289239928558, 0.12308521367745792, 0.3325043151796818, -0.45732746816172104, -0.12649210676176065, 0.14157809604459057, 0.03263699950752553, 0.009787034822582471, -0.012948693408028835, -0.1687121109287368, 0.05431604929617606, -0.24057050057255278, -0.07335800440164238, -0.04944563213531382, 0.026907826611976618, 0.05621823112170848, -0.37709629410741535, 0.019147022278403023, 0.014934042122260464, 0.05206172601405031, -0.11188371440043628, -0.09314638115721187, -0.07935852538964643, 0.12459343265037183, 0.1281003061775686, -0.02633628640721393, 0.13800796674154187, -0.14064404683289822, -0.13257230252237628, 0.40241527420514056, -0.028323593577824352, -0.14362843475721934, 0.10972707463064935, -0.0860454882218264, -0.06503862702350201, 0.14259117928322224, 0.20124248055763905, 0.04944957121809172, -0.1871505395434591, 0.048138311825956716, 0.0171703116275461, 0.18096024851831494, 0.05977834670069037, -0.0006145622024721489, 0.1862014288255922, 0.16427961632143706, 0.1833241941388157, 0.10981154253013523, 0.0013979139692354493, -0.1137535889269557, -0.23099715545668448, -0.11534988198843898, -0.1590359292792372, 0.03661970446729555, -0.05672804149665952, -0.08222486152847457, 0.3819912125401926, 0.11589970467498571, 0.12494815047830343, 0.11029668402554263, 0.331736102268645, 0.22290248895367812, 0.0376844000619291, 0.13310768963519212, 0.15582773793579602, -0.01575184739819478, 0.19577207257857593, -0.22978664901982085, 0.12571800755984264, 0.017650725498863654] |
1,802.08131 | Searching for the rules that govern hadron construction | Just as Quantum Electrodynamics describes how electrons are bound in atoms by
the electromagnetic force, mediated by exchange of photons, Quantum
Chromodynamics (QCD) describes how quarks are bound inside hadrons by the
strong force, mediated by exchange of gluons. At face value, QCD allows hadrons
constructed from increasingly many quarks to exist, just as atoms with
increasing numbers of electrons exist, yet such complex constructions seemed,
until recently, to not be present in nature. In what follows we describe
advances in the spectroscopy of mesons that are refining our understanding of
the rules for building hadrons from QCD.
| hep-ph hep-ex nucl-ex | just as quantum electrodynamics describes how electrons are bound in atoms by the electromagnetic force mediated by exchange of photons quantum chromodynamics qcd describes how quarks are bound inside hadrons by the strong force mediated by exchange of gluons at face value qcd allows hadrons constructed from increasingly many quarks to exist just as atoms with increasing numbers of electrons exist yet such complex constructions seemed until recently to not be present in nature in what follows we describe advances in the spectroscopy of mesons that are refining our understanding of the rules for building hadrons from qcd | [['just', 'as', 'quantum', 'electrodynamics', 'describes', 'how', 'electrons', 'are', 'bound', 'in', 'atoms', 'by', 'the', 'electromagnetic', 'force', 'mediated', 'by', 'exchange', 'of', 'photons', 'quantum', 'chromodynamics', 'qcd', 'describes', 'how', 'quarks', 'are', 'bound', 'inside', 'hadrons', 'by', 'the', 'strong', 'force', 'mediated', 'by', 'exchange', 'of', 'gluons', 'at', 'face', 'value', 'qcd', 'allows', 'hadrons', 'constructed', 'from', 'increasingly', 'many', 'quarks', 'to', 'exist', 'just', 'as', 'atoms', 'with', 'increasing', 'numbers', 'of', 'electrons', 'exist', 'yet', 'such', 'complex', 'constructions', 'seemed', 'until', 'recently', 'to', 'not', 'be', 'present', 'in', 'nature', 'in', 'what', 'follows', 'we', 'describe', 'advances', 'in', 'the', 'spectroscopy', 'of', 'mesons', 'that', 'are', 'refining', 'our', 'understanding', 'of', 'the', 'rules', 'for', 'building', 'hadrons', 'from', 'qcd']] | [-0.06142905499425014, 0.344326492455997, -0.09841880073523795, 0.10173378478051448, -0.04979010927015726, -0.13566964055050393, 0.04548614606622378, 0.3578904756553927, -0.19858377919133222, -0.2894619128913904, -0.03937840587174406, -0.3446380309928363, -0.07489465413215969, 0.1558743791692719, 0.026888196798497622, 0.0422336437777445, 0.04338751068547824, -0.008206848527913039, 0.008086082314103082, -0.21501757705118507, 0.32816351479280514, 0.01301556457622851, 0.2084287822493637, 0.16183299220841835, 0.04528371441387096, 0.046277653469884654, -0.0058554553626371285, -0.036208880219456493, -0.0678874221360887, 0.08338441943027536, 0.26743651021804127, 0.06036635973652331, 0.18367006917655163, -0.4831613773594097, -0.18965375273754553, 0.0781105971819132, 0.19314371421101637, 0.16744664395037961, -0.060661004547371854, -0.2723484331247758, 0.05190344468562161, -0.16642743263783275, -0.14912088956607847, -0.15942471969530594, -0.009921206351445645, 0.00522998774576248, -0.22309674947327762, 0.039725785737629145, 0.008523401063011617, 0.04664166659183268, 0.015263453436592517, -0.13527348533994993, 0.007010948594792613, 0.0844192960090479, 0.09133012666324229, 0.09461700673956348, 0.15771434329716222, -0.22339822151413075, -0.20401652662881783, 0.4469582350468453, -0.018623806612223993, -0.1484262846619347, 0.16710952804328835, -0.1483661449010655, -0.09678360162070021, 0.13370752999706345, 0.1541670284671139, 0.06955230889404762, -0.1859109129623643, 0.12320763904040641, -0.044759088737548004, 0.1550654475292077, 0.10904029979399044, 0.10700504562332847, 0.26904035396683884, 0.13610323605944916, -0.03376912224945156, 0.09456983792989952, 0.04514036107124114, -0.1576593923477494, -0.31035058570987717, -0.11577113018946114, -0.21739885373497192, 0.09635037288550236, -0.02710560654698068, -0.12476758799534671, 0.3136926642381491, 0.12179463542522673, 0.20788031462039466, -0.06398302241589646, 0.304145185343389, 0.07092579369188515, 0.08610906009087149, 0.10483684023956255, 0.32283793108974945, 0.18450487128515936, 0.1266921548248858, -0.20894736181219983, 0.0186935870395023, 0.130846704964583] |
1,802.08132 | Results of the first user program on the Homogenous Thermal Neutron
Source HOTNES (ENEA / INFN) | The HOmogeneous Thermal NEutron Source (HOTNES) is a new type of thermal
neutron irradiation assembly developed by the ENEA-INFN collaboration. The
facility is fully characterized in terms of neutron field and dosimetric
quantities, by either computational and experimental methods. This paper
reports the results of the first "HOTNES users program", carried out in 2016,
and covering a variety of thermal neutron active detectors such as
scintillators, solid-state, single crystal diamond and gaseous detectors.
| nucl-ex physics.ins-det | the homogeneous thermal neutron source hotnes is a new type of thermal neutron irradiation assembly developed by the eneainfn collaboration the facility is fully characterized in terms of neutron field and dosimetric quantities by either computational and experimental methods this paper reports the results of the first hotnes users program carried out in 2016 and covering a variety of thermal neutron active detectors such as scintillators solidstate single crystal diamond and gaseous detectors | [['the', 'homogeneous', 'thermal', 'neutron', 'source', 'hotnes', 'is', 'a', 'new', 'type', 'of', 'thermal', 'neutron', 'irradiation', 'assembly', 'developed', 'by', 'the', 'eneainfn', 'collaboration', 'the', 'facility', 'is', 'fully', 'characterized', 'in', 'terms', 'of', 'neutron', 'field', 'and', 'dosimetric', 'quantities', 'by', 'either', 'computational', 'and', 'experimental', 'methods', 'this', 'paper', 'reports', 'the', 'results', 'of', 'the', 'first', 'hotnes', 'users', 'program', 'carried', 'out', 'in', '2016', 'and', 'covering', 'a', 'variety', 'of', 'thermal', 'neutron', 'active', 'detectors', 'such', 'as', 'scintillators', 'solidstate', 'single', 'crystal', 'diamond', 'and', 'gaseous', 'detectors']] | [-0.055800605904577034, 0.17526539567458843, -0.07306261189015849, -0.012001767613193286, -0.0522930339976613, -0.09609688471204468, 0.06585970605623775, 0.36234833683286394, -0.22365341825144633, -0.3589926192669996, 0.09588485041832817, -0.3159712788515857, -0.03259764826257846, 0.23873913610087974, -0.010597142610432847, 0.09464953664158071, 0.09002765252121857, -0.020946576765605383, -0.07044570411422423, -0.21482846910533096, 0.3011217377281615, 0.15889167715130106, 0.285255117953888, 0.04330687682543482, 0.11459643674482192, 0.0004532815098562943, -0.0754032239384417, 0.025150168727019005, -0.11666115413286857, 0.04671823477172958, 0.3179666656202504, 0.09140533207516585, 0.1619527152340327, -0.474914875254035, -0.2220306788704225, 0.06740653320614781, 0.05693518752232194, 0.03717024466854387, -0.1273831092486424, -0.2611739474747862, 0.04596575790617083, -0.23456989081044283, -0.10559653067695243, -0.029425583221018313, -0.03703080782101357, 0.06132828535379044, -0.19851930330374412, -0.0038638246578297443, 0.031305286018843095, 0.04980906158951776, -0.09530595358062004, -0.1367778558649921, 0.05829835124313831, 0.052933416701853274, -0.0006227086763828993, 0.03629042113066784, 0.2207493772464139, -0.15057461000978947, -0.1201887395232916, 0.34448736198246477, -0.023575285941894564, -0.08660847418754461, 0.1767296756559517, -0.16436519272226308, -0.12638828892792975, 0.17940067062154413, 0.13033213462996562, 0.17105975296414858, -0.2405516125927014, 0.022901546865302536, -0.014933259386037076, 0.20253864174509154, 0.07350524081183331, 0.009766343661717006, 0.27951350291924815, 0.26799745692738464, -0.025730521251846637, 0.1535792754031718, -0.1679502334711807, 0.009947331914944308, -0.2871495000219771, -0.1571210165674399, -0.15647918760244336, 0.031043563929519482, -0.027146086036061334, -0.15040098783294006, 0.35345262451363463, 0.03266969147537436, 0.04255872251732009, -0.08286451584260379, 0.3041480186528393, 0.015808848689110682, 0.06171427188175065, 0.004579495482279786, 0.2844528239353427, 0.16084059899273728, 0.16655323622482163, -0.2758866079949907, 0.053779430487858396, 0.00027653820413563933] |
1,802.08133 | Reducibility for wave equations of finitely smooth potential with
periodic boundary conditions | In the present paper, the reducibility is derived for the wave equations with
finitely smooth and time-quasi-periodic potential subjects to periodic boundary
conditions. More exactly, the linear wave equation
$u_{tt}-u_{xx}+Mu+\varepsilon (V_0(\omega t)u_{xx}+V(\omega t, x)u)=0,\;x\in
\mathbb{R}/2\pi \mathbb{Z}$ can be reduced to a linear Hamiltonian system of a
constant coefficient operator which is of pure imaginary point spectrum set,
where $V$ is finitely smooth in $(t, x)$, quasi-periodic in time $t$ with
Diophantine frequency $\omega\in \mathbb{R}^{n},$ and $V_0$ is finitely smooth
and quasi-periodic in time $t$ with Diophantine frequency $\omega\in
\mathbb{R}^{n},$ Moreover, it is proved that the corresponding wave operator
possesses the property of pure point spectra and zero Lyapunov exponent.
| math.DS | in the present paper the reducibility is derived for the wave equations with finitely smooth and timequasiperiodic potential subjects to periodic boundary conditions more exactly the linear wave equation u_ttu_xxmuvarepsilon v_0omega tu_xxvomega t xu0xin mathbbr2pi mathbbz can be reduced to a linear hamiltonian system of a constant coefficient operator which is of pure imaginary point spectrum set where v is finitely smooth in t x quasiperiodic in time t with diophantine frequency omegain mathbbrn and v_0 is finitely smooth and quasiperiodic in time t with diophantine frequency omegain mathbbrn moreover it is proved that the corresponding wave operator possesses the property of pure point spectra and zero lyapunov exponent | [['in', 'the', 'present', 'paper', 'the', 'reducibility', 'is', 'derived', 'for', 'the', 'wave', 'equations', 'with', 'finitely', 'smooth', 'and', 'timequasiperiodic', 'potential', 'subjects', 'to', 'periodic', 'boundary', 'conditions', 'more', 'exactly', 'the', 'linear', 'wave', 'equation', 'u_ttu_xxmuvarepsilon', 'v_0omega', 'tu_xxvomega', 't', 'xu0xin', 'mathbbr2pi', 'mathbbz', 'can', 'be', 'reduced', 'to', 'a', 'linear', 'hamiltonian', 'system', 'of', 'a', 'constant', 'coefficient', 'operator', 'which', 'is', 'of', 'pure', 'imaginary', 'point', 'spectrum', 'set', 'where', 'v', 'is', 'finitely', 'smooth', 'in', 't', 'x', 'quasiperiodic', 'in', 'time', 't', 'with', 'diophantine', 'frequency', 'omegain', 'mathbbrn', 'and', 'v_0', 'is', 'finitely', 'smooth', 'and', 'quasiperiodic', 'in', 'time', 't', 'with', 'diophantine', 'frequency', 'omegain', 'mathbbrn', 'moreover', 'it', 'is', 'proved', 'that', 'the', 'corresponding', 'wave', 'operator', 'possesses', 'the', 'property', 'of', 'pure', 'point', 'spectra', 'and', 'zero', 'lyapunov', 'exponent']] | [-0.2283926848444112, 0.14862061193368087, -0.071981151388692, -0.034984964942781346, -0.09964444457298322, -0.20170831048772447, -0.024738367220076423, 0.3431929260137535, -0.348317363858223, -0.11628916057802383, 0.10204329801545967, -0.289071513073785, -0.12537603048715806, 0.20770459070446945, -0.04121282087372882, 0.1187210973174799, 0.03237377967286323, 0.1249802572807918, -0.07291864336556977, -0.23396872662539994, 0.347756561051522, -0.08980137974556003, 0.17110800157256778, 0.012413890770680848, 0.11413437930778378, -0.0372369710732961, 0.05589270922577097, -0.011592194034407536, -0.14111824915779012, -0.014037567958058345, 0.30384196590720897, 0.02916529615010534, 0.2659800530278257, -0.3510764247604779, -0.20333788265429792, 0.17330307736105863, 0.11559583247151403, -0.01013213681345362, 0.019276633057493848, -0.2786592292998518, 0.13432234284867134, -0.07985153067524411, -0.22817110432134496, -0.044957621528634, 0.16231901690009096, 0.03360619352066091, -0.34166642015888576, 0.12748203322158327, 0.09927929246443368, 0.07482196242504177, -0.10565663007575841, -0.08181771836687057, -0.08951186089599061, 0.026909792693775324, 0.021720705709109705, 0.11935848588390009, 0.06430529409664727, -0.023461396158451126, -0.062379922508262096, 0.3593459968144695, -0.12373905839132411, -0.2561722356559975, 0.12840698637910897, -0.21593393843975806, -0.07772848132909053, 0.167800615929688, 0.10606760814608562, 0.13446394901035263, -0.11568253589128809, 0.25898195684532677, -0.08571975934388493, 0.15551469641172194, 0.14682783826830842, 0.00988870618110966, 0.07708141253817649, 0.06462482688505025, 0.14214473549897472, 0.10243401462101333, 0.009742194709057609, -0.02847372118516692, -0.34241258249218975, -0.09521061615752323, -0.21169021322414103, 0.14784186447297024, -0.10777813914132171, -0.19379388981698348, 0.4096770747076897, 0.05885292739119558, 0.1617936075354616, 0.08985467805150187, 0.19864054814956728, 0.227406339461699, -0.029405585106550936, 0.09482438864984682, 0.10193312225663768, 0.15690163733836796, 0.09142989082528012, -0.21158227627165616, -0.04519267064031391, 0.13713491165212222] |
1,802.08134 | Multi-fluid approach to high-frequency waves in plasmas. III. Nonlinear
regime and plasma heating | The multi-fluid modelling of high-frequency waves in partially ionized
plasmas has shown that the behavior of magnetohydrodynamics waves in the linear
regime is heavily influenced by the collisional interaction between the
different species that form the plasma. Here, we go beyond linear theory and
study large-amplitude waves in partially ionized plasmas using a nonlinear
multi-fluid code. It is known that in fully ionized plasmas, nonlinear Alfv\'en
waves generate density and pressure perturbations. Those nonlinear effects are
more pronounced for standing oscillations than for propagating waves. By means
of numerical simulations and analytical approximations, we examine how the
collisional interaction between ions and neutrals affects the nonlinear
evolution. The friction due to collisions dissipates a fraction of the wave
energy, which is transformed into heat and consequently rises the temperature
of the plasma. As an application, we investigate frictional heating in a plasma
with physical conditions akin to those in a solar quiescent prominence.
| astro-ph.SR physics.plasm-ph | the multifluid modelling of highfrequency waves in partially ionized plasmas has shown that the behavior of magnetohydrodynamics waves in the linear regime is heavily influenced by the collisional interaction between the different species that form the plasma here we go beyond linear theory and study largeamplitude waves in partially ionized plasmas using a nonlinear multifluid code it is known that in fully ionized plasmas nonlinear alfven waves generate density and pressure perturbations those nonlinear effects are more pronounced for standing oscillations than for propagating waves by means of numerical simulations and analytical approximations we examine how the collisional interaction between ions and neutrals affects the nonlinear evolution the friction due to collisions dissipates a fraction of the wave energy which is transformed into heat and consequently rises the temperature of the plasma as an application we investigate frictional heating in a plasma with physical conditions akin to those in a solar quiescent prominence | [['the', 'multifluid', 'modelling', 'of', 'highfrequency', 'waves', 'in', 'partially', 'ionized', 'plasmas', 'has', 'shown', 'that', 'the', 'behavior', 'of', 'magnetohydrodynamics', 'waves', 'in', 'the', 'linear', 'regime', 'is', 'heavily', 'influenced', 'by', 'the', 'collisional', 'interaction', 'between', 'the', 'different', 'species', 'that', 'form', 'the', 'plasma', 'here', 'we', 'go', 'beyond', 'linear', 'theory', 'and', 'study', 'largeamplitude', 'waves', 'in', 'partially', 'ionized', 'plasmas', 'using', 'a', 'nonlinear', 'multifluid', 'code', 'it', 'is', 'known', 'that', 'in', 'fully', 'ionized', 'plasmas', 'nonlinear', 'alfven', 'waves', 'generate', 'density', 'and', 'pressure', 'perturbations', 'those', 'nonlinear', 'effects', 'are', 'more', 'pronounced', 'for', 'standing', 'oscillations', 'than', 'for', 'propagating', 'waves', 'by', 'means', 'of', 'numerical', 'simulations', 'and', 'analytical', 'approximations', 'we', 'examine', 'how', 'the', 'collisional', 'interaction', 'between', 'ions', 'and', 'neutrals', 'affects', 'the', 'nonlinear', 'evolution', 'the', 'friction', 'due', 'to', 'collisions', 'dissipates', 'a', 'fraction', 'of', 'the', 'wave', 'energy', 'which', 'is', 'transformed', 'into', 'heat', 'and', 'consequently', 'rises', 'the', 'temperature', 'of', 'the', 'plasma', 'as', 'an', 'application', 'we', 'investigate', 'frictional', 'heating', 'in', 'a', 'plasma', 'with', 'physical', 'conditions', 'akin', 'to', 'those', 'in', 'a', 'solar', 'quiescent', 'prominence']] | [-0.1286522713484124, 0.24722522310693854, -0.032065381232064726, 0.08891013419800407, -0.04102917222360916, -0.06200714235869693, -0.05552303994126204, 0.3212074853138986, -0.25589801308400684, -0.26111986962895767, 0.03498444554329016, -0.29030846020947626, -0.11013830486027633, 0.20286845037214507, 0.06695463891472862, 0.02876430482974921, 0.043690086188695694, -0.08311293715172831, -0.0010953290476250687, -0.13573501881492, 0.29935731701370255, 0.1245221096818378, 0.2156924493215199, 0.03907530456842258, 0.07329391756350269, -0.06838463427456327, -0.007276640749944289, 0.05628633226444519, -0.12857616766829771, 0.0038467153780895828, 0.22866427276260295, 0.041375923921579336, 0.2866142714621341, -0.5431404392435855, -0.3135949474193682, -0.02609422836898601, 0.17711196414018476, 0.13471000293631935, -0.049904410077241446, -0.22568915913404983, -0.03507555281329486, -0.1709572865819449, -0.14474750371662035, -0.01943248212094011, 0.04873675813143647, 0.061166847967375315, -0.28145587292737234, 0.1541787554476459, 0.06995947161397222, 0.011422971647013636, -0.10847413265663716, -0.011755816614121393, -0.09497010211149852, 0.026344113545705337, 0.06203985494809542, -0.015903118564108133, 0.18188138718235922, -0.15385849304760507, -0.0155040199223151, 0.41312695715844244, -0.09657313395034768, -0.17458818809074514, 0.26524663992907876, -0.20047233701726191, -0.061312934207224765, 0.20750012556151823, 0.21337666875055802, 0.10038949011100663, -0.13495837941497954, 0.03174190146329636, -0.05111365310390848, 0.15511914716388275, 0.11665557489541718, 0.007411923892552557, 0.2444465119358201, 0.1546899953041396, -0.009305869256529738, 0.13737315615050166, -0.061044162108861155, -0.055439503924324625, -0.2505087245290329, -0.10314463790098291, -0.105196987321369, 0.024124759739684094, -0.02888519394854799, -0.19787723349853956, 0.39373196202963345, 0.19197915499654045, 0.11825396987956528, -0.04467281430207948, 0.311105623865634, 0.1723396253902952, -0.017199895052494956, 0.1667655802337952, 0.32027044666176235, 0.2359415102275271, 0.12472946409994334, -0.28855712870379385, 0.04885707834881602, 0.04352675550739019] |
1,802.08135 | Optimal inventory management and order book modeling | We model the behavior of three agent classes acting dynamically in a limit
order book of a financial asset. Namely, we consider market makers (MM),
high-frequency trading (HFT) firms, and institutional brokers (IB). Given a
prior dynamic of the order book, similar to the one considered in the
Queue-Reactive models [14, 20, 21], the MM and the HFT define their trading
strategy by optimizing the expected utility of terminal wealth, while the IB
has a prescheduled task to sell or buy many shares of the considered asset. We
derive the variational partial differential equations that characterize the
value functions of the MM and HFT and explain how almost optimal control can be
deduced from them. We then provide a first illustration of the interactions
that can take place between these different market participants by simulating
the dynamic of an order book in which each of them plays his own (optimal)
strategy.
| q-fin.TR math.PR | we model the behavior of three agent classes acting dynamically in a limit order book of a financial asset namely we consider market makers mm highfrequency trading hft firms and institutional brokers ib given a prior dynamic of the order book similar to the one considered in the queuereactive models 14 20 21 the mm and the hft define their trading strategy by optimizing the expected utility of terminal wealth while the ib has a prescheduled task to sell or buy many shares of the considered asset we derive the variational partial differential equations that characterize the value functions of the mm and hft and explain how almost optimal control can be deduced from them we then provide a first illustration of the interactions that can take place between these different market participants by simulating the dynamic of an order book in which each of them plays his own optimal strategy | [['we', 'model', 'the', 'behavior', 'of', 'three', 'agent', 'classes', 'acting', 'dynamically', 'in', 'a', 'limit', 'order', 'book', 'of', 'a', 'financial', 'asset', 'namely', 'we', 'consider', 'market', 'makers', 'mm', 'highfrequency', 'trading', 'hft', 'firms', 'and', 'institutional', 'brokers', 'ib', 'given', 'a', 'prior', 'dynamic', 'of', 'the', 'order', 'book', 'similar', 'to', 'the', 'one', 'considered', 'in', 'the', 'queuereactive', 'models', '14', '20', '21', 'the', 'mm', 'and', 'the', 'hft', 'define', 'their', 'trading', 'strategy', 'by', 'optimizing', 'the', 'expected', 'utility', 'of', 'terminal', 'wealth', 'while', 'the', 'ib', 'has', 'a', 'prescheduled', 'task', 'to', 'sell', 'or', 'buy', 'many', 'shares', 'of', 'the', 'considered', 'asset', 'we', 'derive', 'the', 'variational', 'partial', 'differential', 'equations', 'that', 'characterize', 'the', 'value', 'functions', 'of', 'the', 'mm', 'and', 'hft', 'and', 'explain', 'how', 'almost', 'optimal', 'control', 'can', 'be', 'deduced', 'from', 'them', 'we', 'then', 'provide', 'a', 'first', 'illustration', 'of', 'the', 'interactions', 'that', 'can', 'take', 'place', 'between', 'these', 'different', 'market', 'participants', 'by', 'simulating', 'the', 'dynamic', 'of', 'an', 'order', 'book', 'in', 'which', 'each', 'of', 'them', 'plays', 'his', 'own', 'optimal', 'strategy']] | [-0.09564774739245574, 0.057172583361098074, -0.0971476080319068, 0.11354854519246146, -0.1102083084732294, -0.14519495283563932, 0.11679731332386534, 0.3888400994365414, -0.2821766104285295, -0.31266289330863706, 0.15776497781354312, -0.2879210776416585, -0.11679818607401103, 0.13546397846657782, -0.09457962068806713, -0.008179755785192052, 0.007828434103478988, 0.03919017199135851, 0.03066697996420165, -0.2938481878566866, 0.29915076019242404, 0.01775059869668136, 0.26747627100596827, 0.0176157493237406, 0.15009889219256972, -0.004883920142892748, -0.04526717185042799, 0.02764062013477087, -0.1419726616614692, 0.15625059935885172, 0.28804670016080003, 0.105418932462732, 0.3572391687830289, -0.4507181637454778, -0.13656636203328767, 0.10950739252225807, 0.06613177793721357, 0.025246947389872123, 0.05454767125037809, -0.24684911000852783, 0.052260369902166225, -0.2411661629580582, -0.1275551240891218, -0.03386511712645491, 0.005851386490588387, 0.0339539973573604, -0.27264798412720365, 0.0036137408281986913, 0.04898310377883414, 0.014945870137307794, -0.0835623648064211, -0.1217096191085875, -0.04108500183948005, 0.20875342429770777, 0.08895243005206188, -0.04382511937951979, 0.1390034055740883, -0.14312998169567437, -0.18078178901147718, 0.3871710896181563, -0.040534425073613725, -0.14841079061540466, 0.11870416986756027, -0.1233604808151722, -0.09818730568901325, 0.10172906888648868, 0.19601957911625503, 0.06070202104747295, -0.19835225050648053, 0.02156847829464823, -0.05173582672451933, 0.17264247671390573, 0.07785219984905173, -0.004319946503577133, 0.18005628982946897, 0.17520532032474875, 0.11516097758547403, 0.12908213384992753, -0.05004459124718172, -0.1480708067243298, -0.27775738965719937, -0.1509558731565873, -0.12014121678347389, 0.07555081733812888, -0.14900002347518845, -0.13779949499915042, 0.38023277955750623, 0.15742572489194573, 0.15279679746677477, 0.047045921101719915, 0.2579108797463899, 0.13372190127770106, -0.0014269171608611941, 0.09929964061787662, 0.21510694475844502, 0.0007723922313501438, 0.1687818391264106, -0.16706838998477905, 0.12310607921972405, 0.04115492844954133] |
1,802.08136 | High Seebeck coefficient and ultra-low lattice thermal conductivity in
Cs2InAgCl6 | The elastic, electronic and thermoelectric properties of indium-based
double-perovskite halide, Cs2InAgCl6 have been studied by first principles
study. The Cs2InAgCl6 is found to be elastically stable, ductile, anisotropic
and relatively low hard material. The calculated direct bandgap 3.67 eV by
TB-mBJ functional fairly agrees with the experimentally measured value 3.3 eV
but PBE functional underestimates the bandgap by 1.483 eV. The relaxation time
and lattice thermal conductivity have been calculated by using relaxation time
approximation (RTA) within the supercell approach. The lattice thermal
conductivity (\k{appa}l) is quite low (0.2 Wm-1K-1). The quite low phonon group
velocity in the large weighted phase space, and high anharmonicity (large
phonon scattering) are responsible for small \k{appa}l. The room temperature
Seebeck coefficient is 199 {\mu}VK-1. Such high Seebeck coefficient arises from
the combination of the flat conduction band and large bandgap. We obtain power
factors at 300K by using PBE and TB-mBJ potentials are ~29 and ~31 mWm-1K-2,
respectively and the corresponding thermoelectric figure of merit of Cs2BiAgCl6
are 0.71 and 0.72. However, the maximum ZT value obtained at 700K is ~0.74 by
TB-mBJ potential. The obtained results implies that Cs2InAgCl6 is a promising
material for thermoelectric device applications.
| cond-mat.mtrl-sci | the elastic electronic and thermoelectric properties of indiumbased doubleperovskite halide cs2inagcl6 have been studied by first principles study the cs2inagcl6 is found to be elastically stable ductile anisotropic and relatively low hard material the calculated direct bandgap 367 ev by tbmbj functional fairly agrees with the experimentally measured value 33 ev but pbe functional underestimates the bandgap by 1483 ev the relaxation time and lattice thermal conductivity have been calculated by using relaxation time approximation rta within the supercell approach the lattice thermal conductivity kappal is quite low 02 wm1k1 the quite low phonon group velocity in the large weighted phase space and high anharmonicity large phonon scattering are responsible for small kappal the room temperature seebeck coefficient is 199 muvk1 such high seebeck coefficient arises from the combination of the flat conduction band and large bandgap we obtain power factors at 300k by using pbe and tbmbj potentials are 29 and 31 mwm1k2 respectively and the corresponding thermoelectric figure of merit of cs2biagcl6 are 071 and 072 however the maximum zt value obtained at 700k is 074 by tbmbj potential the obtained results implies that cs2inagcl6 is a promising material for thermoelectric device applications | [['the', 'elastic', 'electronic', 'and', 'thermoelectric', 'properties', 'of', 'indiumbased', 'doubleperovskite', 'halide', 'cs2inagcl6', 'have', 'been', 'studied', 'by', 'first', 'principles', 'study', 'the', 'cs2inagcl6', 'is', 'found', 'to', 'be', 'elastically', 'stable', 'ductile', 'anisotropic', 'and', 'relatively', 'low', 'hard', 'material', 'the', 'calculated', 'direct', 'bandgap', '367', 'ev', 'by', 'tbmbj', 'functional', 'fairly', 'agrees', 'with', 'the', 'experimentally', 'measured', 'value', '33', 'ev', 'but', 'pbe', 'functional', 'underestimates', 'the', 'bandgap', 'by', '1483', 'ev', 'the', 'relaxation', 'time', 'and', 'lattice', 'thermal', 'conductivity', 'have', 'been', 'calculated', 'by', 'using', 'relaxation', 'time', 'approximation', 'rta', 'within', 'the', 'supercell', 'approach', 'the', 'lattice', 'thermal', 'conductivity', 'kappal', 'is', 'quite', 'low', '02', 'wm1k1', 'the', 'quite', 'low', 'phonon', 'group', 'velocity', 'in', 'the', 'large', 'weighted', 'phase', 'space', 'and', 'high', 'anharmonicity', 'large', 'phonon', 'scattering', 'are', 'responsible', 'for', 'small', 'kappal', 'the', 'room', 'temperature', 'seebeck', 'coefficient', 'is', '199', 'muvk1', 'such', 'high', 'seebeck', 'coefficient', 'arises', 'from', 'the', 'combination', 'of', 'the', 'flat', 'conduction', 'band', 'and', 'large', 'bandgap', 'we', 'obtain', 'power', 'factors', 'at', '300k', 'by', 'using', 'pbe', 'and', 'tbmbj', 'potentials', 'are', '29', 'and', '31', 'mwm1k2', 'respectively', 'and', 'the', 'corresponding', 'thermoelectric', 'figure', 'of', 'merit', 'of', 'cs2biagcl6', 'are', '071', 'and', '072', 'however', 'the', 'maximum', 'zt', 'value', 'obtained', 'at', '700k', 'is', '074', 'by', 'tbmbj', 'potential', 'the', 'obtained', 'results', 'implies', 'that', 'cs2inagcl6', 'is', 'a', 'promising', 'material', 'for', 'thermoelectric', 'device', 'applications']] | [-0.10548226844630991, 0.16133532650017457, -0.03904499360792262, -0.0012681681417365627, -0.019649970958479823, -0.14840084931947597, 0.08868567002025078, 0.4166049233916187, -0.2634482405042833, -0.32681926967967395, 0.026187053439327392, -0.3499331469743599, -0.08921501178716876, 0.23062999357623, 0.03128175811059581, 0.061818235246560625, 0.004298784217998846, -0.07372267242789883, -0.08670796989103223, -0.1875193798338476, 0.16556607005570428, 0.09705503459914212, 0.3272770620911315, 0.14772444423864184, 0.057670103891311005, -0.019103694648347488, 0.09862212505258773, 0.06557794740965431, -0.16798442981013706, 0.07115242482863904, 0.288884776099537, -0.1455250813496136, 0.20670477779985397, -0.3490979273217855, -0.1894542440326048, -0.01981842716598941, 0.036125355832802, 0.06400135127448275, -0.045322392810347306, -0.19554166395766853, 0.13413148107170367, -0.17464161148809673, -0.08860305114169173, -0.1129183375298228, 0.029180459852796048, -0.016126034205861044, -0.2075314020627591, 0.2001809529940953, -0.05990153726444762, 0.05863163417766888, -0.12444139388749932, -0.2718412152178869, -0.062360514311801604, 0.006437380831765453, 0.0382654688587489, 0.019434204472699345, 0.2038020426503469, -0.07786113684834942, -0.04819008553419838, 0.4532282546008985, -0.09409093778081161, -0.03626700154038809, 0.10815903222303569, -0.1654975401914496, -0.03791873736460645, 0.22823376604835935, 0.07429495680184324, 0.08913246887980855, -0.17552495719000852, 0.1019544327625892, 0.02748511930310753, 0.16939228014617236, 0.08731734195661721, 0.05947671641389234, 0.1744396959397865, 0.16793900016209498, 0.0003558851120820672, 0.08385011143310322, -0.11018654775863379, 0.018015143274300798, -0.18426164105467344, -0.13974470898182584, -0.2366643696303297, 0.10484852410430454, -0.16336723304806414, -0.12300124202408473, 0.3600901100621319, 0.0930255382518601, 0.16010501352866413, 0.016556384099512985, 0.20081299268304534, 0.1932331790533109, 0.07774164394317098, 0.07027599042309712, 0.31319048777030606, 0.16331060787365226, 0.1325007261247518, -0.2703976545629293, 0.0616642760290505, -0.011538915148907408] |
1,802.08137 | Scaling limits of discrete snakes with stable branching | We consider so-called discrete snakes obtained from size-conditioned critical
Bienaym\'e-Galton-Watson trees by assigning to each node a random spatial
position in such a way that the increments along each edge are i.i.d. When the
offspring distribution belongs to the domain of attraction of a stable law with
index $\alpha \in (1,2]$, we give a necessary and sufficient condition on the
tail distribution of the spatial increments for this spatial tree to converge,
in a functional sense, towards the Brownian snake driven by the $\alpha$-stable
L\'evy tree. We also study the case of heavier tails, and apply our result to
study the number of inversions of a uniformly random permutation indexed by the
tree.
| math.PR | we consider socalled discrete snakes obtained from sizeconditioned critical bienaymegaltonwatson trees by assigning to each node a random spatial position in such a way that the increments along each edge are iid when the offspring distribution belongs to the domain of attraction of a stable law with index alpha in 12 we give a necessary and sufficient condition on the tail distribution of the spatial increments for this spatial tree to converge in a functional sense towards the brownian snake driven by the alphastable levy tree we also study the case of heavier tails and apply our result to study the number of inversions of a uniformly random permutation indexed by the tree | [['we', 'consider', 'socalled', 'discrete', 'snakes', 'obtained', 'from', 'sizeconditioned', 'critical', 'bienaymegaltonwatson', 'trees', 'by', 'assigning', 'to', 'each', 'node', 'a', 'random', 'spatial', 'position', 'in', 'such', 'a', 'way', 'that', 'the', 'increments', 'along', 'each', 'edge', 'are', 'iid', 'when', 'the', 'offspring', 'distribution', 'belongs', 'to', 'the', 'domain', 'of', 'attraction', 'of', 'a', 'stable', 'law', 'with', 'index', 'alpha', 'in', '12', 'we', 'give', 'a', 'necessary', 'and', 'sufficient', 'condition', 'on', 'the', 'tail', 'distribution', 'of', 'the', 'spatial', 'increments', 'for', 'this', 'spatial', 'tree', 'to', 'converge', 'in', 'a', 'functional', 'sense', 'towards', 'the', 'brownian', 'snake', 'driven', 'by', 'the', 'alphastable', 'levy', 'tree', 'we', 'also', 'study', 'the', 'case', 'of', 'heavier', 'tails', 'and', 'apply', 'our', 'result', 'to', 'study', 'the', 'number', 'of', 'inversions', 'of', 'a', 'uniformly', 'random', 'permutation', 'indexed', 'by', 'the', 'tree']] | [-0.09035258359342281, 0.213418843166437, -0.10372263371495397, 0.05186460193259076, -0.05121791740280709, -0.12238583479691963, 0.09818440246869743, 0.38869547601955545, -0.300589843511781, -0.21935757995899102, 0.09034107945314775, -0.25722568127093837, -0.12372796031974888, 0.09594253192855311, -0.08040376532824212, 0.053631100902878516, 0.024584756316991325, 0.062158534062161507, 0.04491964022703802, -0.19826476776298868, 0.3283702029314424, 0.001103159863435264, 0.2558410190145618, -0.06228873152368968, 0.09058341978899469, 0.04147721877754001, -0.07346955022616644, 0.01723568971335356, -0.1581521548737328, 0.10256106482951768, 0.15576909316171492, 0.05209816043601937, 0.30488925823010504, -0.3574105792462693, -0.16914512852755642, 0.1700126182279616, 0.15758435062265821, 0.061932593442699205, -0.03508878158546785, -0.2991416394506814, 0.14873208087478165, -0.13777487018212145, -0.1969165179304712, 0.004204684866376088, 0.05750230564236907, 0.10120899580735047, -0.3179911726204279, 0.06596922615400606, 0.11796626367140561, 0.02452334048991491, -0.030132117789305215, -0.12862532387537481, -0.0435731904851439, 0.11679632746303728, 0.04226402072215153, 0.017899577368682782, 0.10625003615444127, -0.09554355233142685, -0.12985256619556043, 0.3373305475376713, -0.069096390453134, -0.2501179909928136, 0.1496972567568134, -0.20758535123968613, -0.17894404218532145, 0.12163759538088925, 0.1655338162672706, 0.10321095741041322, -0.14032733082694904, 0.08878465052423833, -0.05076933156565896, 0.09087292075855657, 0.11831425432215578, -0.022046301567960263, 0.17475209696151847, 0.12411498147204318, 0.15988632143957407, 0.19918146647978574, -0.09994085883850598, -0.12322169506556488, -0.31215614080429077, -0.14434732076811738, -0.23022027119960903, 0.049616505549887994, -0.17892996123217536, -0.2237575043275553, 0.39545543967480107, 0.13591851204234576, 0.2454115583428315, 0.15369255271382695, 0.20062231717331866, 0.1409561893695874, -0.02390628834421347, 0.08224072101958362, 0.05952556621092039, 0.14985055912776651, 0.07469578929262102, -0.13419553118416974, 0.11668688105419278, 0.08337270190947622] |
1,802.08138 | Reliable Intersection Control in Non-cooperative Environments | We propose a reliable intersection control mechanism for strategic autonomous
and connected vehicles (agents) in non-cooperative environments. Each agent has
access to his/her earliest possible and desired passing times, and reports a
passing time to the intersection manager, who allocates the intersection
temporally to the agents in a First-Come-First-Serve basis. However, the agents
might have conflicting interests and can take actions strategically. To this
end, we analyze the strategic behaviors of the agents and formulate Nash
equilibria for all possible scenarios. Furthermore, among all Nash equilibria
we identify a socially optimal equilibrium that leads to a fair intersection
allocation, and correspondingly we describe a strategy-proof intersection
mechanism, which achieves reliable intersection control such that the strategic
agents do not have any incentive to misreport their passing times
strategically.
| cs.AI cs.GT cs.SY | we propose a reliable intersection control mechanism for strategic autonomous and connected vehicles agents in noncooperative environments each agent has access to hisher earliest possible and desired passing times and reports a passing time to the intersection manager who allocates the intersection temporally to the agents in a firstcomefirstserve basis however the agents might have conflicting interests and can take actions strategically to this end we analyze the strategic behaviors of the agents and formulate nash equilibria for all possible scenarios furthermore among all nash equilibria we identify a socially optimal equilibrium that leads to a fair intersection allocation and correspondingly we describe a strategyproof intersection mechanism which achieves reliable intersection control such that the strategic agents do not have any incentive to misreport their passing times strategically | [['we', 'propose', 'a', 'reliable', 'intersection', 'control', 'mechanism', 'for', 'strategic', 'autonomous', 'and', 'connected', 'vehicles', 'agents', 'in', 'noncooperative', 'environments', 'each', 'agent', 'has', 'access', 'to', 'hisher', 'earliest', 'possible', 'and', 'desired', 'passing', 'times', 'and', 'reports', 'a', 'passing', 'time', 'to', 'the', 'intersection', 'manager', 'who', 'allocates', 'the', 'intersection', 'temporally', 'to', 'the', 'agents', 'in', 'a', 'firstcomefirstserve', 'basis', 'however', 'the', 'agents', 'might', 'have', 'conflicting', 'interests', 'and', 'can', 'take', 'actions', 'strategically', 'to', 'this', 'end', 'we', 'analyze', 'the', 'strategic', 'behaviors', 'of', 'the', 'agents', 'and', 'formulate', 'nash', 'equilibria', 'for', 'all', 'possible', 'scenarios', 'furthermore', 'among', 'all', 'nash', 'equilibria', 'we', 'identify', 'a', 'socially', 'optimal', 'equilibrium', 'that', 'leads', 'to', 'a', 'fair', 'intersection', 'allocation', 'and', 'correspondingly', 'we', 'describe', 'a', 'strategyproof', 'intersection', 'mechanism', 'which', 'achieves', 'reliable', 'intersection', 'control', 'such', 'that', 'the', 'strategic', 'agents', 'do', 'not', 'have', 'any', 'incentive', 'to', 'misreport', 'their', 'passing', 'times', 'strategically']] | [-0.22205796977414138, 0.026541356189227372, -0.1323613315835246, 0.061298833347791515, -0.13420661105919862, -0.23649308198264407, 0.20514428631304327, 0.46061062297667377, -0.2804459485487314, -0.26778058080526534, 0.056825863330232096, -0.2613506593479542, -0.11825718435284216, 0.023003035561487195, -0.1779802880009811, -0.005120169720612466, 0.03621590475586345, 0.05849046892762999, 0.09853417517206253, -0.31299630867579253, 0.2767349354617181, 0.02531729274778627, 0.29022341097152093, 0.0033533222740516067, 0.1344960705464473, 0.027450284037854544, 0.04470913346085581, 0.035533694179321174, -0.12381024485205216, 0.10885085141399031, 0.39411858102539554, 0.21128159754152875, 0.36827218299004016, -0.48547075845999643, -0.12442548960098065, 0.2102800159009348, 0.133202405020711, 0.07239734406266507, 0.009612407389795408, -0.2505015599199396, 0.11555117649913882, -0.22182579297805205, -0.0891387840056268, -0.08532517560524866, 0.0027865029533131747, 0.07798937579627818, -0.34166958038986195, -0.10757199564977782, 0.004529446345259203, 0.02777790576510597, -0.11008288831726531, -0.059535092035730486, -0.022725708338839468, 0.23848615423412411, 0.0249806652427651, -0.04724749536762829, 0.17869881099295526, -0.13819164905180514, -0.23245508399486425, 0.4257079424914991, 0.058394485276949126, -0.1316286835426581, 0.21806658104469534, -0.057212219460780034, -0.10969407315678836, 0.09574555970539222, 0.22453779757051961, 0.15464339018581086, -0.16285080723537249, -0.00648663374431635, -0.07879928593320074, 0.12861514768519555, 0.06151055388181703, 0.010775401380669791, 0.22198233714152593, 0.12304084084462374, 0.23647097880166257, 0.054760969296694384, 0.06407815667625982, -0.1909839226218537, -0.23422120105169597, -0.13535082529415376, -0.08222454456699779, 0.07552925187530946, -0.07539162346733974, -0.09763976107205963, 0.3608710131084081, 0.15624013632987044, 0.13962282455213426, 0.09517431767471862, 0.340947900833271, 0.04687475002720021, -0.006353591683364357, 0.17341013457189547, 0.21579021701472811, -0.043893501766433474, 0.08645465338167924, -0.19366808296763338, 0.1699365335625771, 3.8423164369305596e-05] |
1,802.08139 | Path-Specific Counterfactual Fairness | We consider the problem of learning fair decision systems in complex
scenarios in which a sensitive attribute might affect the decision along both
fair and unfair pathways. We introduce a causal approach to disregard effects
along unfair pathways that simplifies and generalizes previous literature. Our
method corrects observations adversely affected by the sensitive attribute, and
uses these to form a decision. This avoids disregarding fair information, and
does not require an often intractable computation of the path-specific effect.
We leverage recent developments in deep learning and approximate inference to
achieve a solution that is widely applicable to complex, non-linear scenarios.
| stat.ML | we consider the problem of learning fair decision systems in complex scenarios in which a sensitive attribute might affect the decision along both fair and unfair pathways we introduce a causal approach to disregard effects along unfair pathways that simplifies and generalizes previous literature our method corrects observations adversely affected by the sensitive attribute and uses these to form a decision this avoids disregarding fair information and does not require an often intractable computation of the pathspecific effect we leverage recent developments in deep learning and approximate inference to achieve a solution that is widely applicable to complex nonlinear scenarios | [['we', 'consider', 'the', 'problem', 'of', 'learning', 'fair', 'decision', 'systems', 'in', 'complex', 'scenarios', 'in', 'which', 'a', 'sensitive', 'attribute', 'might', 'affect', 'the', 'decision', 'along', 'both', 'fair', 'and', 'unfair', 'pathways', 'we', 'introduce', 'a', 'causal', 'approach', 'to', 'disregard', 'effects', 'along', 'unfair', 'pathways', 'that', 'simplifies', 'and', 'generalizes', 'previous', 'literature', 'our', 'method', 'corrects', 'observations', 'adversely', 'affected', 'by', 'the', 'sensitive', 'attribute', 'and', 'uses', 'these', 'to', 'form', 'a', 'decision', 'this', 'avoids', 'disregarding', 'fair', 'information', 'and', 'does', 'not', 'require', 'an', 'often', 'intractable', 'computation', 'of', 'the', 'pathspecific', 'effect', 'we', 'leverage', 'recent', 'developments', 'in', 'deep', 'learning', 'and', 'approximate', 'inference', 'to', 'achieve', 'a', 'solution', 'that', 'is', 'widely', 'applicable', 'to', 'complex', 'nonlinear', 'scenarios']] | [-0.09049043714534491, 0.030539826561143856, -0.08155298564117403, 0.11313481165794656, -0.17947369251400233, -0.1797999226488173, 0.10781267269980162, 0.4164688774803653, -0.2697276164358482, -0.2837396546220407, 0.06372936325264163, -0.22725935384631157, -0.19905898220837115, 0.1769133833271917, -0.17562572656635894, 0.04676904918625951, 0.1221788369549904, -0.0037092375429347156, -0.04085373367648572, -0.2426402757037431, 0.3210561837942805, 0.08390357856376796, 0.32756964972242714, 0.06612373009324074, 0.1057482682634145, 0.0643884553667158, -0.08826953362673522, 0.032344200303778055, -0.09626566550068674, 0.12406057556974702, 0.35157424544915555, 0.19702185939997435, 0.3450103093869984, -0.4470387322083116, -0.23458456429652869, 0.1383169711474329, 0.15717117966152727, 0.1529674912255723, 0.008459096094593405, -0.23825780691578985, 0.03733225055737421, -0.1577840037085116, -0.051675894029904156, -0.12252953003160655, -0.06240939722163603, -0.04060262886108831, -0.307452526432462, 0.09301831671968103, 0.060190650997683406, -0.0045230006147176025, -0.011024351394735277, -0.12199451011605561, 0.06946705932961778, 0.10437307038344443, 0.042812580283498394, 0.02608886809903197, 0.15217534344643355, -0.14078468476189301, -0.17603317697532475, 0.3578569355234504, 0.00721481746295467, -0.20828350006602706, 0.2075620924215764, -0.032058645533397795, -0.20784526045434176, 0.12383968299254774, 0.20512737033888698, 0.14221454735845326, -0.15779228636529297, 0.030957464605453424, -0.008165297494269908, 0.16214298851788045, 0.019848113590851427, 0.03548194449394941, 0.1885834336373955, 0.14920400123111904, 0.07384379846975207, 0.10848336631897837, -0.021854940964840353, -0.16856431684456766, -0.2094137021061033, -0.10934774394147098, -0.117081127949059, -0.017445485782664038, -0.07155085756836342, -0.16815942009910942, 0.31964304619235917, 0.2756938117183745, 0.20021222547627984, 0.04478415325167589, 0.3310125866997987, 0.06837510212906636, 0.10177680386230349, 0.09088402244873578, 0.2295083379931748, 0.05300095409154892, 0.1076255097752437, -0.2230951060168445, 0.20316594756790438, -0.03567657543811947] |
1,802.0814 | Scale-Chiral Effective Field Theory for Nuclear Interactions in the
Veneziano Limit | Following Golterman and Shamir, we develop scale-chiral perturbation theory
in the large $N_c$ and large $N_f$ Veneziano limit that incorporates both
light-quark baryons and hidden local symmetric bosons and derive a
leading-order scale symmetry Lagrangian applicable in nuclear physics. Some
applications in the medium-free space and baryonic matter are discussed.
| nucl-th hep-ph | following golterman and shamir we develop scalechiral perturbation theory in the large n_c and large n_f veneziano limit that incorporates both lightquark baryons and hidden local symmetric bosons and derive a leadingorder scale symmetry lagrangian applicable in nuclear physics some applications in the mediumfree space and baryonic matter are discussed | [['following', 'golterman', 'and', 'shamir', 'we', 'develop', 'scalechiral', 'perturbation', 'theory', 'in', 'the', 'large', 'n_c', 'and', 'large', 'n_f', 'veneziano', 'limit', 'that', 'incorporates', 'both', 'lightquark', 'baryons', 'and', 'hidden', 'local', 'symmetric', 'bosons', 'and', 'derive', 'a', 'leadingorder', 'scale', 'symmetry', 'lagrangian', 'applicable', 'in', 'nuclear', 'physics', 'some', 'applications', 'in', 'the', 'mediumfree', 'space', 'and', 'baryonic', 'matter', 'are', 'discussed']] | [-0.1117179381889196, 0.2670438779964663, -0.10827334561594287, 0.19608778825828008, -0.06856408846393532, -0.12264930714891122, 0.002517737170244206, 0.24863803804833062, -0.13533543775865467, -0.2579833189291613, 0.06010895919254316, -0.26191356903588286, -0.08810047043145311, 0.0180053545627743, -0.0023498203966538516, 0.09238626509524729, -0.049253745156587384, -0.010700618201980785, -0.04857518650800446, -0.20241557158605786, 0.31265112168953885, -0.06146238854497063, 0.23119046310989225, 0.11665355798085125, 0.06546064903389434, 0.06369894947286467, -0.07512783739069591, -0.02806123597986939, -0.13298040170923983, 0.06619264059985171, 0.23845342522943203, 0.03532587613302226, 0.16150582414500567, -0.43743550569313217, -0.18994323257356882, 0.09543349398109986, 0.16460342614968515, 0.17829270180010673, -0.07098492973113471, -0.29384600815876405, 0.05092573990779264, -0.2260260480284995, -0.18969179511222303, -0.1832515303596702, 0.0012752332449035377, -0.03548606355883637, -0.27930704408268237, 0.12155389818077793, -0.03442467904972787, 0.011635049322277916, -0.0005950217173263735, -0.17447593362232175, -0.002904937887678341, 0.03905039071580585, 0.09657686427995867, 0.05872591978357154, 0.1621090670862254, -0.21744940952606956, -0.07524166362626213, 0.457806586002817, -0.07185054682575319, -0.15052317834117127, 0.15591037135609254, -0.14368683576811941, -0.2208541470617816, 0.05212520796577541, 0.1964684340827243, 0.08180147084426515, -0.11606195715389081, 0.2639671456845648, -0.05691820945666761, 0.16630437231993264, 0.05646668382141055, 0.09314584501125679, 0.20039815230447114, 0.13413841762979115, -0.004597524485113669, 0.009795921531562902, -0.029471334459602226, -0.17122066220534699, -0.3987764109458242, -0.05242410564453018, -0.15895486889140947, 0.017838192809069037, -0.14528120728061125, -0.08089328961142776, 0.3253328206720857, 0.13396364613911327, 0.1932155051606004, 0.035838626481934775, 0.25015657969123245, 0.05936159949977787, 0.048717847911222856, 0.12297374137430167, 0.2631019794753971, 0.24495481156116847, 0.11271116553748749, -0.27003411569024377, -0.1626224011059242, 0.1491269074446921] |
1,802.08141 | Connecting KOSs and the LOD Cloud | This paper describes a specific project, the current situation leading to it,
its project design and first results. In particular, we will examine the
terminology employed in the Linked Open Data cloud and compare this to the
terminology employed in both the Universal Decimal Classification and the Basic
Concepts Classification. We will explore whether these classifications can
encourage greater consistency in LOD terminology. We thus hope to link the
largely distinct scholarly literatures that address LOD and KOSs.
| cs.DL | this paper describes a specific project the current situation leading to it its project design and first results in particular we will examine the terminology employed in the linked open data cloud and compare this to the terminology employed in both the universal decimal classification and the basic concepts classification we will explore whether these classifications can encourage greater consistency in lod terminology we thus hope to link the largely distinct scholarly literatures that address lod and koss | [['this', 'paper', 'describes', 'a', 'specific', 'project', 'the', 'current', 'situation', 'leading', 'to', 'it', 'its', 'project', 'design', 'and', 'first', 'results', 'in', 'particular', 'we', 'will', 'examine', 'the', 'terminology', 'employed', 'in', 'the', 'linked', 'open', 'data', 'cloud', 'and', 'compare', 'this', 'to', 'the', 'terminology', 'employed', 'in', 'both', 'the', 'universal', 'decimal', 'classification', 'and', 'the', 'basic', 'concepts', 'classification', 'we', 'will', 'explore', 'whether', 'these', 'classifications', 'can', 'encourage', 'greater', 'consistency', 'in', 'lod', 'terminology', 'we', 'thus', 'hope', 'to', 'link', 'the', 'largely', 'distinct', 'scholarly', 'literatures', 'that', 'address', 'lod', 'and', 'koss']] | [-0.07919382345743287, 0.0455949401948601, -0.06108297518669413, 0.10777540110015812, -0.12504010261275256, -0.09359695721799746, 0.07869030188512391, 0.3792978989629027, -0.292656572153553, -0.28921571464683765, 0.12758412905849326, -0.25348517554215133, -0.16541342666665187, 0.16232094367464575, -0.16181686414310184, 0.03156162446099094, 0.05623442550094273, 0.027980121061540186, -0.06919564951199274, -0.2891089520775355, 0.37650111737923747, 0.06502491374237415, 0.3380993033836906, 0.0920283536438663, -0.005746820349043283, -0.05222612603877982, -0.15093915306557065, -0.004883264006378177, -0.18402575675552213, 0.18424793634301004, 0.3215756601749513, 0.21753964927763894, 0.2808651852911004, -0.405003679343141, -0.12724525194901687, 0.08325756141223395, 0.18176792616932055, 0.1000321077265723, 0.005506229479438984, -0.2648658543252028, 0.08929646886789645, -0.19669318634670419, -0.13068964226075855, -0.11149965870218018, -0.004378924731356211, -0.021268080522974905, -0.15348278861254072, -0.01115659282853206, 0.06596658485814726, 0.03372138174465643, -0.05908632002776871, -0.09260599119349933, 0.07537628350277933, 0.19254524929998204, 0.03579656268135668, 0.0666083959587969, 0.06967431812499388, -0.15069729493907055, -0.14348202294264084, 0.3882443322203098, -0.019826667013172157, -0.17816552109061143, 0.2492679092937555, -0.11972170025229645, -0.1828618281855224, -0.010639758828358773, 0.19839716356140202, 0.03354824535497942, -0.22169711543485904, 0.025125697274910264, -0.004075928235975787, 0.15473835470411593, 0.06213361852002354, -0.014154182208212426, 0.2124929221179814, 0.16537110046304476, -0.00834564187635596, 0.13150861448659085, -0.030008536476928454, -0.0688907669003432, -0.27254293277525365, -0.15714982387203819, -0.12340658900733942, -0.00949619478211762, -0.009761618509237917, -0.12291838085422149, 0.42122312902640074, 0.26785995006782914, 0.15170112217609316, -0.001275282359132782, 0.30822618907460797, 0.022720654698041003, 0.0599082943980391, 0.07371128351690295, 0.19527207754361323, 0.05971132454056388, 0.15710698124260092, -0.15885544704416624, 0.04194864021160473, 0.01860168443706173] |
1,802.08142 | Fractional Cassini Coordinates | Introducing a set $\{\alpha_i\} \in R$ of fractional exponential powers of
focal distances an extension of symmetric Cassini-coordinates on the plane to
the asymmetric case is proposed which leads to a new set of fractional
generalized Cassini-coordinate systems. Orthogonality and classical limiting
cases are derived. An extension to cylindrically symmetric systems in $R^3$ is
investigated. The resulting asymmetric coordinate systems are well suited to
solve corresponding two- and three center problems in physics.
| physics.gen-ph | introducing a set alpha_i in r of fractional exponential powers of focal distances an extension of symmetric cassinicoordinates on the plane to the asymmetric case is proposed which leads to a new set of fractional generalized cassinicoordinate systems orthogonality and classical limiting cases are derived an extension to cylindrically symmetric systems in r3 is investigated the resulting asymmetric coordinate systems are well suited to solve corresponding two and three center problems in physics | [['introducing', 'a', 'set', 'alpha_i', 'in', 'r', 'of', 'fractional', 'exponential', 'powers', 'of', 'focal', 'distances', 'an', 'extension', 'of', 'symmetric', 'cassinicoordinates', 'on', 'the', 'plane', 'to', 'the', 'asymmetric', 'case', 'is', 'proposed', 'which', 'leads', 'to', 'a', 'new', 'set', 'of', 'fractional', 'generalized', 'cassinicoordinate', 'systems', 'orthogonality', 'and', 'classical', 'limiting', 'cases', 'are', 'derived', 'an', 'extension', 'to', 'cylindrically', 'symmetric', 'systems', 'in', 'r3', 'is', 'investigated', 'the', 'resulting', 'asymmetric', 'coordinate', 'systems', 'are', 'well', 'suited', 'to', 'solve', 'corresponding', 'two', 'and', 'three', 'center', 'problems', 'in', 'physics']] | [-0.17360766403849276, 0.031807086019347175, -0.032534019391931276, 0.07413342798089373, -0.07578155098640373, -0.15674684233438801, -0.04943458323898187, 0.34663589440391096, -0.3054062625537561, -0.2540631104969013, 0.12466965061874771, -0.2600817198301075, -0.12129785361844049, 0.21490418144934614, -0.05494795371712723, 0.042384221743215135, -0.04253252416285096, 0.03653778104295193, -0.10255247721789588, -0.21280870868653898, 0.3238294931574607, 0.00477457638587278, 0.24014830602411652, -0.016052400221077488, 0.09191019861945804, 0.011320986004520051, -0.014713673353929755, 0.04420089803516277, -0.10056740264605049, 0.13436800641545527, 0.22333360859520837, 0.05193495036850513, 0.22699262293606576, -0.3700053028788575, -0.17738345216854778, 0.15098744507511735, 0.15474066767894046, 0.06531995608845174, -0.02942768163801971, -0.2606730642892473, 0.0668939874100853, -0.15236852200649365, -0.22033984986671679, -0.016995751944987078, 0.06674319775906247, 0.059382775044199865, -0.3019564275065778, 0.07455391519781675, 0.09875667449513215, 0.022488801602379118, -0.04728468082530398, -0.14562812326869495, 0.023044234889388924, 0.044766175108109145, -0.02414532701655383, -0.002434131748397166, 0.06242551632933843, -0.06839443030963901, -0.13059773005571373, 0.4278999784253013, -0.014695381129186757, -0.27694025935447764, 0.19613530269404217, -0.12107576635784247, -0.06481000460015321, 0.10266843996942043, 0.20002591903780548, 0.14583788624584254, -0.1722693996320308, 0.1182010288950397, -0.05695087351167286, 0.09300613901446718, 0.09756821839952133, 0.018982516522978395, 0.18795307935543462, 0.09655837568087162, 0.10839532573976304, 0.19877748416972832, -0.06288119629156631, -0.19222844414360507, -0.31595175136143056, -0.1060655210429514, -0.1502839999001237, 0.02900614535672144, -0.0787977786127209, -0.1543726644111456, 0.37187500347868657, 0.06442273635020428, 0.17242016043172967, 0.02497046159311447, 0.2336745016853994, 0.14803768008083276, 0.036799676753219844, 0.05414484980264859, 0.17974490735312582, 0.18029432725423658, 0.0746535336546285, -0.1963493984035203, -0.03557390332694205, 0.07944374572826733] |
1,802.08143 | Stability and Optimal Control of Switching PDE-Dynamical Systems | Selected results for the stability and optimal control of abstract switched
systems in Banach and Hilbert space are reviewed. The dynamics are typically
given in a piecewise sense by a family of nonlinearly perturbed evolutions of
strongly continuous semigroups. Stability refers to characterizations of
asymptotic decay of solutions that holds uniformly for certain classes of
switching signals for time going to infinity. Optimal control refers to the
minimization of costs associated to solutions by appropriately selecting
switching signals. Selected numerical results verify and visualize some of the
available theory.
| math.OC math.AP math.DS | selected results for the stability and optimal control of abstract switched systems in banach and hilbert space are reviewed the dynamics are typically given in a piecewise sense by a family of nonlinearly perturbed evolutions of strongly continuous semigroups stability refers to characterizations of asymptotic decay of solutions that holds uniformly for certain classes of switching signals for time going to infinity optimal control refers to the minimization of costs associated to solutions by appropriately selecting switching signals selected numerical results verify and visualize some of the available theory | [['selected', 'results', 'for', 'the', 'stability', 'and', 'optimal', 'control', 'of', 'abstract', 'switched', 'systems', 'in', 'banach', 'and', 'hilbert', 'space', 'are', 'reviewed', 'the', 'dynamics', 'are', 'typically', 'given', 'in', 'a', 'piecewise', 'sense', 'by', 'a', 'family', 'of', 'nonlinearly', 'perturbed', 'evolutions', 'of', 'strongly', 'continuous', 'semigroups', 'stability', 'refers', 'to', 'characterizations', 'of', 'asymptotic', 'decay', 'of', 'solutions', 'that', 'holds', 'uniformly', 'for', 'certain', 'classes', 'of', 'switching', 'signals', 'for', 'time', 'going', 'to', 'infinity', 'optimal', 'control', 'refers', 'to', 'the', 'minimization', 'of', 'costs', 'associated', 'to', 'solutions', 'by', 'appropriately', 'selecting', 'switching', 'signals', 'selected', 'numerical', 'results', 'verify', 'and', 'visualize', 'some', 'of', 'the', 'available', 'theory']] | [-0.15250712820967094, 0.12498287776003728, -0.04987763797110888, 0.07404918667305721, -0.06053239048531886, -0.15980885893608746, 0.05281069994448904, 0.3644345712042257, -0.33307931145255487, -0.2231194916589374, 0.19118069652781894, -0.2726123147131352, -0.11412271223125163, 0.22237549042800087, -0.0829963270009736, 0.13082629085382383, 0.0432358345362159, 0.02922785192142042, -0.0851434935525248, -0.24241215256539833, 0.33748537681348034, 0.004482671074318082, 0.26743366403944707, -0.057077529473920884, 0.10810296026416898, 0.00699454712357079, -0.03687018460562725, 0.031865288875931666, -0.1566010779846529, 0.1249003182982848, 0.3090558178262429, 0.12394628533570284, 0.32723632005953723, -0.4117103476140104, -0.17789883552684208, 0.12643246102575842, 0.1255392333848423, 0.04175239526195807, -0.0621343164526847, -0.2942508722582225, 0.10477830808651581, -0.08381205107598158, -0.15172072544463733, -0.12107429356612474, 0.01575720582282945, 0.1257978987911444, -0.3074824071457882, 0.023314228061628476, 0.0739151720020376, 0.023608794864894967, -0.1499187434929308, -0.03979154224664475, -0.05264391852124186, 0.11405392415465766, 0.05713000119234739, -0.027691871987320902, 0.11816146101258444, -0.0791088209246819, -0.14400643457559179, 0.33917331778420806, -0.04030553995451126, -0.25097366912143954, 0.1766483848914504, -0.14231167634258443, -0.09917318529261046, 0.15052521801187416, 0.18949906680774822, 0.15562035803672639, -0.1485848164688168, 0.11442756160682988, 0.005821451105261117, 0.13273035424233026, 0.0703019192233012, 0.07043973450664054, 0.10203050197300952, 0.14602534715190865, 0.12546228592838632, 0.16617374599838022, 0.05389566191019532, -0.14819113292804595, -0.3387259844143802, -0.09115098440873154, -0.1566773195740547, 0.03729693642346544, -0.10044067400835292, -0.15656934073718076, 0.39647528428186696, 0.1100034915287508, 0.17479570358115237, 0.1130523750888121, 0.1982239798506659, 0.13722436521411613, -0.018494374526852972, 0.06386520775307096, 0.22284188694902696, 0.15452795371601588, 0.06808082056179475, -0.2102743209119928, 0.058824876972128834, 0.0913288366504725] |
1,802.08144 | A note on friezes of type $\Lambda_p$ | A frieze is an array of numbers obeying the unimodular rule. Coxeter showed
that a frieze with integer entries corresponds to a triangulation. Recently,
Holm and J{\o}rgenson introduced friezes of type $\Lambda_p$ which correspond
to $p$-angulations of a polygon. In this paper we explore the connection
between these two types of friezes; in particular we show that the friezes of
type $\Lambda_p$ for $p=4$ and $p=6$ contain integral friezes within them. We
also consider the relationships with Farey graphs.
| math.CO | a frieze is an array of numbers obeying the unimodular rule coxeter showed that a frieze with integer entries corresponds to a triangulation recently holm and jorgenson introduced friezes of type lambda_p which correspond to pangulations of a polygon in this paper we explore the connection between these two types of friezes in particular we show that the friezes of type lambda_p for p4 and p6 contain integral friezes within them we also consider the relationships with farey graphs | [['a', 'frieze', 'is', 'an', 'array', 'of', 'numbers', 'obeying', 'the', 'unimodular', 'rule', 'coxeter', 'showed', 'that', 'a', 'frieze', 'with', 'integer', 'entries', 'corresponds', 'to', 'a', 'triangulation', 'recently', 'holm', 'and', 'jorgenson', 'introduced', 'friezes', 'of', 'type', 'lambda_p', 'which', 'correspond', 'to', 'pangulations', 'of', 'a', 'polygon', 'in', 'this', 'paper', 'we', 'explore', 'the', 'connection', 'between', 'these', 'two', 'types', 'of', 'friezes', 'in', 'particular', 'we', 'show', 'that', 'the', 'friezes', 'of', 'type', 'lambda_p', 'for', 'p4', 'and', 'p6', 'contain', 'integral', 'friezes', 'within', 'them', 'we', 'also', 'consider', 'the', 'relationships', 'with', 'farey', 'graphs']] | [-0.19742433778658697, 0.109842075844173, -0.06330037706449063, 0.06527305221114355, -0.11319404489160338, -0.15588898670305557, 0.04254731886189054, 0.3403143013084802, -0.29962228839816174, -0.23894668552034262, 0.0834043010556481, -0.2886683852470751, -0.26697905007985573, 0.11153201113124908, -0.14483162349596904, -0.04379615611750397, 0.03242993227477315, 0.07284725904228943, -0.031057530572001314, -0.2862080514366161, 0.35349232087477667, -0.05514409251605408, 0.16517995290835447, -0.005845090963795215, 0.08348675220291119, 0.012858925611252271, -0.030535165267654613, 0.03251783303987188, -0.1901762591908123, 0.10851314590795885, 0.2563576297009293, 0.0826127389328012, 0.16880592354278587, -0.3599891671144604, -0.09118122011098917, 0.19198149638957804, 0.128630638022353, 0.04842518157284424, -0.010648021427325056, -0.24544803193428472, 0.09319406982711693, -0.1491984705782578, -0.1773030799872513, -0.01692692473342147, 0.12180542687390329, 0.08489420833183994, -0.29187383949520845, 0.040377155650345185, 0.10628112982015443, 0.06909920309399124, -0.004707916557222982, -0.15137606057562406, 0.007414719078076791, 0.06141927583685404, -0.03730522852856666, 0.0010508419120613534, -0.0667493009521284, -0.05596270145482938, -0.1912906058722093, 0.34833717150495774, 0.017079812333082096, -0.19787784431518726, 0.12672069602752034, -0.15144375341508207, -0.2378275724764489, 0.0827908237122848, 0.11206956791302448, 0.09703209043680867, -0.06341658457170558, 0.12291335544248312, -0.16404513132911694, 0.10623019479828168, 0.20803502638517773, -0.026093821853246022, 0.17307682646603523, 0.07845164158475833, 0.050689166028618435, 0.1978951541211786, -0.03070857197000598, -0.07404241231682746, -0.28484455630466154, -0.184792653987585, -0.13683542086966807, 0.08609605750328378, -0.1422030106360016, -0.21029240086297446, 0.35068896186502674, 0.09910593955789375, 0.22255612365146982, 0.1402083612946039, 0.10256581341765256, 0.058384497378823126, 0.07309505513197259, 0.045120643732532904, 0.10751561327731307, 0.20745426365115407, 0.04778640350633407, -0.16904806148237253, -0.03191533890446719, 0.21971415567117494] |
1,802.08145 | Localisation of Soft Charges, and Thermodynamics of Softly Hairy Black
Holes | Large gauge transformations (LGT) in asymptotically flat space are generated
by charges defined at asymptotic infinity. No method for unambiguously
localising these charges into the interior of spacetime has previously been
established. We determine what this method must be, and use it to find
localised expressions for the LGT charges. Applying the same principle to the
case of a charged black hole spacetime leads to angle-dependent generalisations
of the Smarr formula and the first law of black hole mechanics, both of which
have important thermodynamical implications. In particular, the presence of a
heat current intrinsic to the event horizon is observed.
| hep-th gr-qc | large gauge transformations lgt in asymptotically flat space are generated by charges defined at asymptotic infinity no method for unambiguously localising these charges into the interior of spacetime has previously been established we determine what this method must be and use it to find localised expressions for the lgt charges applying the same principle to the case of a charged black hole spacetime leads to angledependent generalisations of the smarr formula and the first law of black hole mechanics both of which have important thermodynamical implications in particular the presence of a heat current intrinsic to the event horizon is observed | [['large', 'gauge', 'transformations', 'lgt', 'in', 'asymptotically', 'flat', 'space', 'are', 'generated', 'by', 'charges', 'defined', 'at', 'asymptotic', 'infinity', 'no', 'method', 'for', 'unambiguously', 'localising', 'these', 'charges', 'into', 'the', 'interior', 'of', 'spacetime', 'has', 'previously', 'been', 'established', 'we', 'determine', 'what', 'this', 'method', 'must', 'be', 'and', 'use', 'it', 'to', 'find', 'localised', 'expressions', 'for', 'the', 'lgt', 'charges', 'applying', 'the', 'same', 'principle', 'to', 'the', 'case', 'of', 'a', 'charged', 'black', 'hole', 'spacetime', 'leads', 'to', 'angledependent', 'generalisations', 'of', 'the', 'smarr', 'formula', 'and', 'the', 'first', 'law', 'of', 'black', 'hole', 'mechanics', 'both', 'of', 'which', 'have', 'important', 'thermodynamical', 'implications', 'in', 'particular', 'the', 'presence', 'of', 'a', 'heat', 'current', 'intrinsic', 'to', 'the', 'event', 'horizon', 'is', 'observed']] | [-0.1012742576986957, 0.11027229111641645, -0.10042795832591629, 0.13895930296344922, -0.08067159562159588, -0.1385623470299167, 0.008669832782441805, 0.32879510139216583, -0.1784573923058734, -0.3053671309556167, 0.09316884200918571, -0.2807492437486601, -0.11316468356416957, 0.1622979179448863, -0.04912617410726772, 0.0377852515511141, -0.04437091133538818, 0.059891867944694095, -0.09388263098028775, -0.21389822044068635, 0.33301154979145026, 0.07833301882480852, 0.3068477012364581, 0.037940267229102334, 0.1359629967038999, -0.007602034129737185, -0.010078633568332633, 0.07985561182878054, -0.1436809647533268, 0.07620963667251981, 0.22614696769431086, 0.07699491984284676, 0.17568312017800342, -0.41554477068567924, -0.2291797002002892, 0.11991360500030736, 0.1610533117206011, 0.17206840441155358, -0.08754418637271565, -0.26749693795734336, 0.10051741503700061, -0.18823374510456872, -0.19166434989748798, -0.07994837016051654, 0.06516122420567393, -0.05181410136900031, -0.20959201472636202, 0.10940278537276357, 0.0802384097968219, -0.03262615578230655, -0.11604111781343818, -0.05178820364532236, -0.07210438791662455, 0.1509835885118435, 0.16459918407363688, -0.0008892842411699862, 0.13653521651475883, -0.06734163534255827, -0.11805020383758572, 0.33319423817983357, -0.01695864062092387, -0.24621787811122317, 0.1414813520767182, -0.22771897037873173, -0.127059730687317, 0.10860895359252423, 0.12264930815574261, 0.18173554002707606, -0.1869885621334214, 0.15032835178870227, -0.019217601728321303, 0.09216281412040243, 0.13022264800412525, 0.05237158734955373, 0.32905953438343977, 0.07348385483423008, 0.02932768309774744, 0.17025350979275744, -0.04842684934339901, -0.10137361456815264, -0.35165388454305063, -0.1873679348442814, -0.16228268052322217, 0.10236796443027878, -0.13203787831284133, -0.1737694481738133, 0.31054803098685635, 0.13213919840365795, 0.15237460833153513, 0.007341933080530034, 0.22117287012757642, 0.13596235744950205, 0.07893375361725541, 0.07392759340363417, 0.28122555054170956, 0.14177001830384062, 0.11568374912030327, -0.23512740756412692, -0.01693637979373631, 0.13073494187602314] |
1,802.08146 | The global geometry of surfaces with prescribed mean curvature in
$\mathbb{R}^3$ | We develop a global theory for complete hypersurfaces in $\mathbb{R}^{n+1}$
whose mean curvature is given as a prescribed function of its Gauss map. This
theory extends the usual one of constant mean curvature hypersurfaces in
$\mathbb{R}^{n+1}$, and also that of self-translating solitons of the mean
curvature flow. For the particular case $n=2$, we will obtain results regarding
a priori height and curvature estimates, non-existence of complete stable
surfaces, and classification of properly embedded surfaces with at most one
end.
| math.DG | we develop a global theory for complete hypersurfaces in mathbbrn1 whose mean curvature is given as a prescribed function of its gauss map this theory extends the usual one of constant mean curvature hypersurfaces in mathbbrn1 and also that of selftranslating solitons of the mean curvature flow for the particular case n2 we will obtain results regarding a priori height and curvature estimates nonexistence of complete stable surfaces and classification of properly embedded surfaces with at most one end | [['we', 'develop', 'a', 'global', 'theory', 'for', 'complete', 'hypersurfaces', 'in', 'mathbbrn1', 'whose', 'mean', 'curvature', 'is', 'given', 'as', 'a', 'prescribed', 'function', 'of', 'its', 'gauss', 'map', 'this', 'theory', 'extends', 'the', 'usual', 'one', 'of', 'constant', 'mean', 'curvature', 'hypersurfaces', 'in', 'mathbbrn1', 'and', 'also', 'that', 'of', 'selftranslating', 'solitons', 'of', 'the', 'mean', 'curvature', 'flow', 'for', 'the', 'particular', 'case', 'n2', 'we', 'will', 'obtain', 'results', 'regarding', 'a', 'priori', 'height', 'and', 'curvature', 'estimates', 'nonexistence', 'of', 'complete', 'stable', 'surfaces', 'and', 'classification', 'of', 'properly', 'embedded', 'surfaces', 'with', 'at', 'most', 'one', 'end']] | [-0.16401071672009515, 0.07723934706182609, -0.09241838928288486, 0.07442712191716308, -0.04580352992951116, -0.12735166259204286, -0.04595812508700816, 0.34311742557189134, -0.2199283927587698, -0.23188077209258004, 0.13715255491235118, -0.2832429861013271, -0.1511275386084107, 0.16636051471887417, -0.13806576495164935, 0.05425711225532585, 0.03625906765743901, 0.12981526263624052, -0.09156424316129635, -0.26864533391604317, 0.380917327702517, -0.027461340698071674, 0.1857365292255307, 0.12020595083632094, 0.11402864511348779, -0.012065673276451947, 0.029654918875120864, 0.06476799892615291, -0.27754813850361076, 0.17534882114327785, 0.17188514150749845, 0.06880103907536102, 0.25282778419094465, -0.39288411084326763, -0.2780729400088327, 0.17619524802423164, 0.12649782323661626, 0.07068804153712772, -0.03271628619183468, -0.2361047692048729, 0.11439924502061515, -0.02238335104399844, -0.24950633602381883, -0.04009550621237936, -0.008762280633555183, 0.016175480500523802, -0.21140578889016864, 0.12483656271677641, 0.11775986313867041, 0.10582986962097356, -0.10477124489224929, -0.09066223693846524, -0.08150502808887182, 0.11653529427639103, 0.035340056698651444, 0.08899560099161125, 0.0682842053673407, -0.12285538226118477, -0.062405932859718044, 0.345744073579583, -0.15653297071687028, -0.2669427134568178, 0.07788699187185097, -0.153281959457488, -0.0910777300065737, 0.1294735018871253, 0.19759807159204648, 0.20770517807406716, -0.05374233157055665, 0.11382025506574354, -0.02514980706280168, 0.10804054537151433, 0.12216540602849255, -0.039013122968800086, 0.1657376738465568, 0.08949456887048539, 0.1861822593815719, 0.10539460857988253, -0.0499531253649193, -0.08554267058078246, -0.4270401911079129, -0.2307916474941222, -0.15179681072241474, 0.10936529826537907, -0.1565937942678265, -0.22328363722072372, 0.39557908602719066, 0.004561814125863057, 0.20860651611715933, 0.15110607795075431, 0.26123517110083205, 0.054517544097196356, 0.0014553863077742767, 0.13038086933024887, 0.21524902914143815, 0.20477979914638908, 0.03998889726928518, -0.09806580118292683, -0.050302174154527576, 0.11821819670333326] |
1,802.08147 | Models of affine curves and Ga-actions | Using the approach of Barkatou and El Kaoui, we classify certain affine
curves over discrete valuation rings having a free additive group action. Our
classification generalizes results of Miyanishi in equi-characteristic 0.
| math.AG | using the approach of barkatou and el kaoui we classify certain affine curves over discrete valuation rings having a free additive group action our classification generalizes results of miyanishi in equicharacteristic 0 | [['using', 'the', 'approach', 'of', 'barkatou', 'and', 'el', 'kaoui', 'we', 'classify', 'certain', 'affine', 'curves', 'over', 'discrete', 'valuation', 'rings', 'having', 'a', 'free', 'additive', 'group', 'action', 'our', 'classification', 'generalizes', 'results', 'of', 'miyanishi', 'in', 'equicharacteristic', '0']] | [-0.17902872919415433, -0.03240300443333884, -0.15986454693290095, -0.0012994457812358937, -0.09762689011792341, -0.16427747785734634, -0.002229657272497813, 0.36986935113867125, -0.3265826547363152, -0.20193732579549153, 0.08062644966800386, -0.23358698760469754, -0.14625794564684233, 0.2674044660292566, -0.20641246490801374, -0.05304107678433259, -0.03737259948005279, 0.11141899054249128, -0.08389879803483685, -0.38244085647165776, 0.3215489272028208, -0.08579416202070812, 0.2436176860705018, -0.028232605444888273, 0.12546170560332637, 0.10494936172229548, -0.09439907675453772, 0.036323455596963566, -0.147444498554493, 0.12970219155152637, 0.3449406719688947, 0.0412317524664104, 0.22035128145168226, -0.29272884167730806, -0.21005241607005398, 0.21379066010316214, 0.06842091958969831, 0.026143299881368876, 0.006566766618440549, -0.2941125276188056, 0.13444171538576483, -0.21747860924030343, -0.11744627946366866, -0.08046187510093053, 0.0018423661589622498, 0.06408793382967512, -0.24705254131307205, 0.044506957723448676, 0.13153815508509675, 0.1891479301887254, -0.20834452123381197, -0.11394800020692249, -0.01117123553995043, 0.04381300436022381, -0.0175582954660058, 0.018987386514587947, 0.0891943584041049, -0.08325485837024947, -0.1730810650313894, 0.3329198562850555, -0.1417042431111137, -0.18420021378745635, 0.1623347593160967, -0.148950569704175, -0.11222786338378986, 0.14787554948901135, 0.1014258837637802, 0.17146276459097862, 0.0038109923092027507, 0.23217976363181758, -0.17434629201889038, 0.023932414874434472, 0.11174885767201582, -0.03757968141386906, 0.08348948744436105, 0.07900219500685732, 0.060372885502874854, 0.12148630890296772, -0.04552774362964555, -0.07480639442801476, -0.3483715994904439, -0.17242624022377034, -0.06389668164774776, 0.13566895149027308, -0.07962670933096282, -0.17727758440499505, 0.4415670658151309, 0.054291170462965964, 0.15133810522966087, 0.1858687457628548, 0.1764177806985875, 0.018621361212960135, 0.03711712644435465, 0.06990978342170516, 0.010073517837251226, 0.19937922723280888, -0.09130771649458135, -0.1525655755462746, -0.04046162962913513, 0.13028243745987614] |
1,802.08148 | LIDIOMS: A Multilingual Linked Idioms Data Set | In this paper, we describe the LIDIOMS data set, a multilingual RDF
representation of idioms currently containing five languages: English, German,
Italian, Portuguese, and Russian. The data set is intended to support natural
language processing applications by providing links between idioms across
languages. The underlying data was crawled and integrated from various sources.
To ensure the quality of the crawled data, all idioms were evaluated by at
least two native speakers. Herein, we present the model devised for structuring
the data. We also provide the details of linking LIDIOMS to well-known
multilingual data sets such as BabelNet. The resulting data set complies with
best practices according to Linguistic Linked Open Data Community.
| cs.CL | in this paper we describe the lidioms data set a multilingual rdf representation of idioms currently containing five languages english german italian portuguese and russian the data set is intended to support natural language processing applications by providing links between idioms across languages the underlying data was crawled and integrated from various sources to ensure the quality of the crawled data all idioms were evaluated by at least two native speakers herein we present the model devised for structuring the data we also provide the details of linking lidioms to wellknown multilingual data sets such as babelnet the resulting data set complies with best practices according to linguistic linked open data community | [['in', 'this', 'paper', 'we', 'describe', 'the', 'lidioms', 'data', 'set', 'a', 'multilingual', 'rdf', 'representation', 'of', 'idioms', 'currently', 'containing', 'five', 'languages', 'english', 'german', 'italian', 'portuguese', 'and', 'russian', 'the', 'data', 'set', 'is', 'intended', 'to', 'support', 'natural', 'language', 'processing', 'applications', 'by', 'providing', 'links', 'between', 'idioms', 'across', 'languages', 'the', 'underlying', 'data', 'was', 'crawled', 'and', 'integrated', 'from', 'various', 'sources', 'to', 'ensure', 'the', 'quality', 'of', 'the', 'crawled', 'data', 'all', 'idioms', 'were', 'evaluated', 'by', 'at', 'least', 'two', 'native', 'speakers', 'herein', 'we', 'present', 'the', 'model', 'devised', 'for', 'structuring', 'the', 'data', 'we', 'also', 'provide', 'the', 'details', 'of', 'linking', 'lidioms', 'to', 'wellknown', 'multilingual', 'data', 'sets', 'such', 'as', 'babelnet', 'the', 'resulting', 'data', 'set', 'complies', 'with', 'best', 'practices', 'according', 'to', 'linguistic', 'linked', 'open', 'data', 'community']] | [-0.06168344583870335, -0.009090158758176998, -0.03230435683137991, 0.1297286717729135, -0.19524770918175238, -0.08483392046499913, 0.08772483496736228, 0.38436091793277727, -0.2771534906530922, -0.3834155483637005, 0.09482968003721907, -0.36248401506719263, -0.07069699103859338, 0.22660301429939203, -0.09679417936554686, 0.035515763627534565, 0.1339739747260782, 0.04165010550085836, 0.03463296355171637, -0.2868127109482884, 0.3332969115073369, 0.035941487142223526, 0.37203485358675775, 0.0029504854486069898, 0.09226049377413637, -0.064951203124259, -0.11256027480756695, -0.04281251797385101, -0.09057705105197701, 0.20424484588015315, 0.42430136808278884, 0.30754341909831223, 0.2580630364785479, -0.4051425409757278, -0.11016837475313382, 0.012306950647722591, 0.06310569840610367, 0.08623098681934856, -0.0028581976890563964, -0.3608261623419821, 0.07510331493633038, -0.16566710286265748, 0.0015336720188232986, -0.10148430242287841, 0.026447069556029004, 0.013214946844817116, -0.2083936041845432, 0.0007512362861730667, 0.022429121916436336, 0.17358586976981977, -0.06026982854078101, -0.12724418991922654, -0.013170103973243386, 0.20012380366520532, 0.03989053844918751, 0.04249268262964589, 0.09196203078185632, -0.07396739462856203, -0.1744851832447404, 0.425195790793408, -0.04609621383927085, -0.17709129674317822, 0.21483603765002707, -0.05867833001750775, -0.17867510848763316, 0.04204044337384403, 0.20138656029647048, -0.0062110314696011215, -0.2725160629065199, 0.06748100733701987, -0.07147560722025281, 0.2243887435337952, 0.12833965314679185, -0.015140988085080277, 0.18213390185582368, 0.2281237524277954, -0.0797510459934446, 0.171228793094104, -0.051918084877119824, -0.04280816668813879, -0.24707499929089946, -0.11348554264669392, -0.15042628897671503, -0.06816687777807767, -0.08170187884745908, -0.15730563529174435, 0.40038844164122234, 0.2072328138715503, 0.11988927586512133, 0.05589193840781015, 0.27528862512924457, -0.044819267064105425, 0.12348969602872702, 0.12026496929624542, 0.06973498924212022, -0.03721012439451773, 0.1818502473983575, -0.08049489333378998, 0.08272261931349269, -0.017258971181912452] |
1,802.08149 | An homogenization approach for the inverse spectral problem of periodic
Schr\"odinger operators | We study the inverse spectral problem for periodic Schr\"odinger opera\-tors
of kind $- \frac{1}{2} \hbar^2 \Delta_x + V(x)$ on the flat torus $\Bbb T^n :=
(\Bbb R / 2 \pi \Bbb Z)^n$ with potentials $V \in C^{\infty} (\Bbb T^n)$. We
show that if two operators are isospectral for any $0 < \hbar \le 1$ then they
have the same effective Hamiltonian given by the periodic homogenization of
Hamilton-Jacobi equation. This result provides a necessary condition for the
isospectrality of these Schr\"odinger operators. We also provide a link between
our result and the spectral limit of quantum integrable systems.
| math-ph math.MP | we study the inverse spectral problem for periodic schrodinger operators of kind frac12 hbar2 delta_x vx on the flat torus bbb tn bbb r 2 pi bbb zn with potentials v in cinfty bbb tn we show that if two operators are isospectral for any 0 hbar le 1 then they have the same effective hamiltonian given by the periodic homogenization of hamiltonjacobi equation this result provides a necessary condition for the isospectrality of these schrodinger operators we also provide a link between our result and the spectral limit of quantum integrable systems | [['we', 'study', 'the', 'inverse', 'spectral', 'problem', 'for', 'periodic', 'schrodinger', 'operators', 'of', 'kind', 'frac12', 'hbar2', 'delta_x', 'vx', 'on', 'the', 'flat', 'torus', 'bbb', 'tn', 'bbb', 'r', '2', 'pi', 'bbb', 'zn', 'with', 'potentials', 'v', 'in', 'cinfty', 'bbb', 'tn', 'we', 'show', 'that', 'if', 'two', 'operators', 'are', 'isospectral', 'for', 'any', '0', 'hbar', 'le', '1', 'then', 'they', 'have', 'the', 'same', 'effective', 'hamiltonian', 'given', 'by', 'the', 'periodic', 'homogenization', 'of', 'hamiltonjacobi', 'equation', 'this', 'result', 'provides', 'a', 'necessary', 'condition', 'for', 'the', 'isospectrality', 'of', 'these', 'schrodinger', 'operators', 'we', 'also', 'provide', 'a', 'link', 'between', 'our', 'result', 'and', 'the', 'spectral', 'limit', 'of', 'quantum', 'integrable', 'systems']] | [-0.20995467229275613, 0.11403769100465441, -0.028057472041798055, 0.06113006223008157, -0.023904264441400928, -0.20447557677905406, -0.04460630577898795, 0.3493596074041179, -0.2670442612381071, -0.14959945584151654, 0.08072188422859956, -0.33892130478715865, -0.1370490601146093, 0.16327846872930726, -0.025897903052429037, 0.06891021676742101, 0.033371004801724224, 0.06216732376306418, -0.10655831681909941, -0.22207702825506848, 0.3913687144316012, -0.10004261566290973, 0.13607653820767038, 0.07739594952899322, 0.06119993699323987, 9.071743316067163e-05, 0.06697830235365257, -0.0723361586651174, -0.23591473786780293, 0.0612741323696169, 0.23562406596317087, 0.041888695725950824, 0.23117364126868467, -0.40135115650432407, -0.2058793656848451, 0.18309784406215274, 0.18144180317739805, -0.001962501615766556, -0.015255909539528833, -0.3044538955624786, 0.1110987740516242, -0.09381034557196882, -0.20455763959175638, -0.07000074990253935, 0.12972211314024784, 0.06049642860839364, -0.3101516098224668, 0.10420193943327734, 0.17222326655461584, 0.0774655991674511, -0.1141695370997793, -0.1053662990490275, -0.045352672970282934, 0.07283392930603637, -0.03456044598652791, 0.09100599333854212, 0.025795142276472942, -0.013410867792704412, -0.08138505904684945, 0.3734724818057911, -0.10140376508245946, -0.27115331880588045, 0.08965727275297526, -0.16633264529668995, -0.14941338756652447, 0.09622337549964907, 0.07926151926519089, 0.14993278177515154, -0.0902695236527311, 0.2517321327224284, -0.05408988402335234, 0.1265746342038275, 0.07006659114893565, 0.028264005983909293, 0.08467469189406163, 0.036402100466832676, 0.13163430849277985, 0.06574639312231974, 0.011263135162192166, -0.029663473002171967, -0.38665230355916486, -0.14189064152719033, -0.19221865450362524, 0.20302157898643805, -0.14467133231124946, -0.14904016519080526, 0.36415094638904255, 0.09554598691763096, 0.19053160361144492, 0.08200125095793748, 0.15154078150148032, 0.2089498167399377, 0.0019212819395526763, 0.08643117838449055, 0.12302971793018201, 0.15754700233528932, 0.10478699952864678, -0.20916450454763347, -0.1277177188525437, 0.1734859646067664] |
1,802.0815 | RDF2PT: Generating Brazilian Portuguese Texts from RDF Data | The generation of natural language from Resource Description Framework (RDF)
data has recently gained significant attention due to the continuous growth of
Linked Data. A number of these approaches generate natural language in
languages other than English, however, no work has been proposed to generate
Brazilian Portuguese texts out of RDF. We address this research gap by
presenting RDF2PT, an approach that verbalizes RDF data to Brazilian Portuguese
language. We evaluated RDF2PT in an open questionnaire with 44 native speakers
divided into experts and non-experts. Our results suggest that RDF2PT is able
to generate text which is similar to that generated by humans and can hence be
easily understood.
| cs.CL | the generation of natural language from resource description framework rdf data has recently gained significant attention due to the continuous growth of linked data a number of these approaches generate natural language in languages other than english however no work has been proposed to generate brazilian portuguese texts out of rdf we address this research gap by presenting rdf2pt an approach that verbalizes rdf data to brazilian portuguese language we evaluated rdf2pt in an open questionnaire with 44 native speakers divided into experts and nonexperts our results suggest that rdf2pt is able to generate text which is similar to that generated by humans and can hence be easily understood | [['the', 'generation', 'of', 'natural', 'language', 'from', 'resource', 'description', 'framework', 'rdf', 'data', 'has', 'recently', 'gained', 'significant', 'attention', 'due', 'to', 'the', 'continuous', 'growth', 'of', 'linked', 'data', 'a', 'number', 'of', 'these', 'approaches', 'generate', 'natural', 'language', 'in', 'languages', 'other', 'than', 'english', 'however', 'no', 'work', 'has', 'been', 'proposed', 'to', 'generate', 'brazilian', 'portuguese', 'texts', 'out', 'of', 'rdf', 'we', 'address', 'this', 'research', 'gap', 'by', 'presenting', 'rdf2pt', 'an', 'approach', 'that', 'verbalizes', 'rdf', 'data', 'to', 'brazilian', 'portuguese', 'language', 'we', 'evaluated', 'rdf2pt', 'in', 'an', 'open', 'questionnaire', 'with', '44', 'native', 'speakers', 'divided', 'into', 'experts', 'and', 'nonexperts', 'our', 'results', 'suggest', 'that', 'rdf2pt', 'is', 'able', 'to', 'generate', 'text', 'which', 'is', 'similar', 'to', 'that', 'generated', 'by', 'humans', 'and', 'can', 'hence', 'be', 'easily', 'understood']] | [-0.008401566342433432, 0.05268223260241535, -0.08625365664516317, 0.11430396406191264, -0.1633270984446561, -0.12384831171086128, 0.04315385193977919, 0.4193014063467099, -0.26470859926538887, -0.3580646937092145, 0.045169643003545284, -0.29820328464524615, -0.12010484732282176, 0.22514116783417262, -0.1506984387955594, 0.020888810330587957, 0.11240817967228833, 0.03402424199696354, 0.04196704550068481, -0.3054712678314428, 0.28925146981297684, 0.033517310415239386, 0.36086140595445476, 0.05890390585625061, 0.06667101322737937, -0.09763403640439113, -0.07859267163655238, 0.012089052138401678, -0.08537690275820582, 0.20778816074771048, 0.4088476745894662, 0.25876672379456944, 0.31268080782697155, -0.42352459222699207, -0.17720776255656448, 0.04550062272163039, 0.12718436115904264, 0.09528339049170932, -0.057849173365091835, -0.3711562211349331, 0.12180517675275311, -0.2081835552235134, 0.013441553977490575, -0.12981436876752586, 0.04560951704452573, -0.05343011314808219, -0.20173307785578934, 0.0017786559743668746, 0.11412086260625748, 0.12748044673180967, -0.034439477086481124, -0.11643078338130619, -0.010607426785605235, 0.16020049188820715, 0.09871728601434303, 0.10732437684459405, 0.08727859405971011, -0.1000460646469879, -0.17150608844261755, 0.40842602688267277, -0.045272943907211476, -0.19109596638871287, 0.19841576305744066, -0.06419120358596384, -0.1461087237327808, 0.07278369025637706, 0.2031484158511308, 0.025491098278305598, -0.23160999390745052, 0.04133648216547617, -0.07386932949992586, 0.252713903609051, 0.13144066219575945, -0.03667730156060619, 0.2196050101235785, 0.2022143657474468, -0.05026779660989565, 0.1657419017428765, -0.002622164362239548, -0.10319811197998072, -0.1569724343975799, -0.12269983392346788, -0.17919852931690575, -0.01648235775064677, -0.01621467502829748, -0.1355374543323975, 0.3842052665228645, 0.20888211644099405, 0.13547997742339415, 0.04801770876683467, 0.26384621720623086, 0.03787383925346485, 0.14519162483392628, 0.07317332599605261, 0.10402750924953984, -0.027154825440245785, 0.15448854503187318, -0.10498449785626252, 0.08821938228922793, -0.03346207291232767] |
1,802.08151 | New Results on Finite-Time Stability: Geometric Conditions and
Finite-Time Controllers | This paper presents novel controllers that yield finite-time stability for
linear systems. We first present a sufficient condition for the origin of a
scalar system to be finite-time stable. Then we present novel finite-time
controllers based on vector fields and barrier functions to demonstrate the
utility of this geometric condition. We also consider the general class of
linear controllable systems, and present a continuous feedback control law to
stabilize the system in finite time. Finally, we present simulation results for
each of these cases, showing the efficacy of the designed control laws.
| math.DS cs.SY | this paper presents novel controllers that yield finitetime stability for linear systems we first present a sufficient condition for the origin of a scalar system to be finitetime stable then we present novel finitetime controllers based on vector fields and barrier functions to demonstrate the utility of this geometric condition we also consider the general class of linear controllable systems and present a continuous feedback control law to stabilize the system in finite time finally we present simulation results for each of these cases showing the efficacy of the designed control laws | [['this', 'paper', 'presents', 'novel', 'controllers', 'that', 'yield', 'finitetime', 'stability', 'for', 'linear', 'systems', 'we', 'first', 'present', 'a', 'sufficient', 'condition', 'for', 'the', 'origin', 'of', 'a', 'scalar', 'system', 'to', 'be', 'finitetime', 'stable', 'then', 'we', 'present', 'novel', 'finitetime', 'controllers', 'based', 'on', 'vector', 'fields', 'and', 'barrier', 'functions', 'to', 'demonstrate', 'the', 'utility', 'of', 'this', 'geometric', 'condition', 'we', 'also', 'consider', 'the', 'general', 'class', 'of', 'linear', 'controllable', 'systems', 'and', 'present', 'a', 'continuous', 'feedback', 'control', 'law', 'to', 'stabilize', 'the', 'system', 'in', 'finite', 'time', 'finally', 'we', 'present', 'simulation', 'results', 'for', 'each', 'of', 'these', 'cases', 'showing', 'the', 'efficacy', 'of', 'the', 'designed', 'control', 'laws']] | [-0.17585254018448052, 0.049787958360115146, -0.1016443008708808, 0.019098308279037312, -0.06471669483605934, -0.16758074429716266, 0.05858463217610615, 0.3556546824174407, -0.2831415844645918, -0.2253925190003508, 0.1307851235982051, -0.17337151157730463, -0.20863332656090675, 0.2216512646384375, -0.08530703019198921, 0.13430050439606217, 0.024054123853009358, -0.0033296675436482156, -0.051325037393405146, -0.24602995608659947, 0.3746340697246563, 0.03295238680489685, 0.2577633012045661, 0.048502476988410904, 0.16356615943874678, -0.023862289452074987, 0.033854614778766, 0.045614063132530726, -0.18702426818922308, 0.10123477263740548, 0.22084804705303648, 0.127038807653741, 0.31361105758696795, -0.42494144485048624, -0.2010138309965639, 0.13767586150409086, 0.10730576844830268, 0.13185178202516196, -0.13056989013262943, -0.253760027420788, 0.1599523598991294, -0.1601803831796607, -0.1525649150489303, -0.1394465222813027, -0.012355212026032741, 0.06966821828556298, -0.3134027624948193, 0.06950485870038392, 0.07799742278344322, 0.05347933618189848, -0.12810191457443262, -0.029359444574726258, 0.029716717433589307, 0.11830518398757862, -0.029055683181428794, -0.0664392410190371, 0.11151886153358805, -0.0788943226678226, -0.15557512638548834, 0.3474572505903147, -0.05076206249308914, -0.23014918027784798, 0.17286850769153755, -0.1106274525999375, -0.13873717031927538, 0.05881552062118831, 0.2679381687194109, 0.16594417713768844, -0.17306609745339854, 0.03770100430499398, -0.010018235436924126, 0.17229093670966508, -0.03137427712942514, 0.03484765533674205, 0.1682443137827289, 0.18247263506561032, 0.14749081719745175, 0.21076362054293935, -0.02212895139667165, -0.11865623331750216, -0.3876144695703102, -0.1672871624139826, -0.10571219397546805, 0.007448536252764904, -0.055481745304385426, -0.1599945622779753, 0.4213358124556101, 0.17302756039830652, 0.1678703654780174, 0.1487609368531317, 0.3124317123514155, 0.16872951910899364, -0.008168705415142618, 0.0676028503044306, 0.25177339389515313, 0.08925156168761136, 0.12448809180995854, -0.2546573950878709, 0.03323019213680907, 0.053990266523728875] |
1,802.08152 | Room Temperature Intrinsic Ferromagnetism in Epitaxial Manganese
Selenide Films in the Monolayer Limit | Monolayer van der Waals (vdW) magnets provide an exciting opportunity for
exploring two-dimensional (2D) magnetism for scientific and technological
advances, but the intrinsic ferromagnetism has only been observed at low
temperatures. Here, we report the observation of room temperature
ferromagnetism in manganese selenide (MnSe$_x$) films grown by molecular beam
epitaxy (MBE). Magnetic and structural characterization provides strong
evidence that in the monolayer limit, the ferromagnetism originates from a vdW
manganese diselenide (MnSe$_2$) monolayer, while for thicker films it could
originate from a combination of vdW MnSe$_2$ and/or interfacial magnetism of
$\alpha$-MnSe(111). Magnetization measurements of monolayer MnSe$_x$ films on
GaSe and SnSe$_2$ epilayers show ferromagnetic ordering with large saturation
magnetization of ~ 4 Bohr magnetons per Mn, which is consistent with density
functional theory calculations predicting ferromagnetism in monolayer
1T-MnSe$_2$. Growing MnSe$_x$ films on GaSe up to high thickness (~ 40 nm)
produces $\alpha$-MnSe(111), and an enhanced magnetic moment (~ 2x) compared to
the monolayer MnSe$_x$ samples. Detailed structural characterization by
scanning transmission electron microscopy (STEM), scanning tunneling microscopy
(STM), and reflection high energy electron diffraction (RHEED) reveal an abrupt
and clean interface between GaSe(0001) and $\alpha$-MnSe(111). In particular,
the structure measured by STEM is consistent with the presence of a MnSe$_2$
monolayer at the interface. These results hold promise for potential
applications in energy efficient information storage and processing.
| cond-mat.mtrl-sci cond-mat.mes-hall | monolayer van der waals vdw magnets provide an exciting opportunity for exploring twodimensional 2d magnetism for scientific and technological advances but the intrinsic ferromagnetism has only been observed at low temperatures here we report the observation of room temperature ferromagnetism in manganese selenide mnse_x films grown by molecular beam epitaxy mbe magnetic and structural characterization provides strong evidence that in the monolayer limit the ferromagnetism originates from a vdw manganese diselenide mnse_2 monolayer while for thicker films it could originate from a combination of vdw mnse_2 andor interfacial magnetism of alphamnse111 magnetization measurements of monolayer mnse_x films on gase and snse_2 epilayers show ferromagnetic ordering with large saturation magnetization of 4 bohr magnetons per mn which is consistent with density functional theory calculations predicting ferromagnetism in monolayer 1tmnse_2 growing mnse_x films on gase up to high thickness 40 nm produces alphamnse111 and an enhanced magnetic moment 2x compared to the monolayer mnse_x samples detailed structural characterization by scanning transmission electron microscopy stem scanning tunneling microscopy stm and reflection high energy electron diffraction rheed reveal an abrupt and clean interface between gase0001 and alphamnse111 in particular the structure measured by stem is consistent with the presence of a mnse_2 monolayer at the interface these results hold promise for potential applications in energy efficient information storage and processing | [['monolayer', 'van', 'der', 'waals', 'vdw', 'magnets', 'provide', 'an', 'exciting', 'opportunity', 'for', 'exploring', 'twodimensional', '2d', 'magnetism', 'for', 'scientific', 'and', 'technological', 'advances', 'but', 'the', 'intrinsic', 'ferromagnetism', 'has', 'only', 'been', 'observed', 'at', 'low', 'temperatures', 'here', 'we', 'report', 'the', 'observation', 'of', 'room', 'temperature', 'ferromagnetism', 'in', 'manganese', 'selenide', 'mnse_x', 'films', 'grown', 'by', 'molecular', 'beam', 'epitaxy', 'mbe', 'magnetic', 'and', 'structural', 'characterization', 'provides', 'strong', 'evidence', 'that', 'in', 'the', 'monolayer', 'limit', 'the', 'ferromagnetism', 'originates', 'from', 'a', 'vdw', 'manganese', 'diselenide', 'mnse_2', 'monolayer', 'while', 'for', 'thicker', 'films', 'it', 'could', 'originate', 'from', 'a', 'combination', 'of', 'vdw', 'mnse_2', 'andor', 'interfacial', 'magnetism', 'of', 'alphamnse111', 'magnetization', 'measurements', 'of', 'monolayer', 'mnse_x', 'films', 'on', 'gase', 'and', 'snse_2', 'epilayers', 'show', 'ferromagnetic', 'ordering', 'with', 'large', 'saturation', 'magnetization', 'of', '4', 'bohr', 'magnetons', 'per', 'mn', 'which', 'is', 'consistent', 'with', 'density', 'functional', 'theory', 'calculations', 'predicting', 'ferromagnetism', 'in', 'monolayer', '1tmnse_2', 'growing', 'mnse_x', 'films', 'on', 'gase', 'up', 'to', 'high', 'thickness', '40', 'nm', 'produces', 'alphamnse111', 'and', 'an', 'enhanced', 'magnetic', 'moment', '2x', 'compared', 'to', 'the', 'monolayer', 'mnse_x', 'samples', 'detailed', 'structural', 'characterization', 'by', 'scanning', 'transmission', 'electron', 'microscopy', 'stem', 'scanning', 'tunneling', 'microscopy', 'stm', 'and', 'reflection', 'high', 'energy', 'electron', 'diffraction', 'rheed', 'reveal', 'an', 'abrupt', 'and', 'clean', 'interface', 'between', 'gase0001', 'and', 'alphamnse111', 'in', 'particular', 'the', 'structure', 'measured', 'by', 'stem', 'is', 'consistent', 'with', 'the', 'presence', 'of', 'a', 'mnse_2', 'monolayer', 'at', 'the', 'interface', 'these', 'results', 'hold', 'promise', 'for', 'potential', 'applications', 'in', 'energy', 'efficient', 'information', 'storage', 'and', 'processing']] | [-0.12737730781413903, 0.15446367942276312, -0.006905203014960356, -0.020299755079262655, 0.00088881108628055, -0.18093810708829958, 0.0861813594637739, 0.43476502488627833, -0.2527318001098095, -0.33962141944826624, -0.04858882960517429, -0.38418017833920143, -0.1176801890713624, 0.22177743022308347, 0.05313846009356953, 0.03416254952012465, -0.037928934048025685, -0.17654076500952998, -0.10459572355323862, -0.19379573666759756, 0.2074366599733715, 0.07317022233548635, 0.37059469414585505, 0.16419289089118078, 0.04992613661381477, 0.02087374828499089, 0.18225994478531996, 0.036994900384691554, -0.22953914441555226, 0.09046211424414242, 0.2638576689252965, -0.16546385336578084, 0.20153497220082295, -0.5301431970165991, -0.22859318093527284, -0.09627384230685986, 0.11033882982087774, 0.13425630696333302, -0.18187919986231915, -0.24447730339184473, 0.08647179510009205, -0.08394044906849686, -0.08097963487929621, -0.12024434617933791, -0.03957883956206736, 0.005752800602333133, -0.22540206335801588, 0.12463323114587813, 0.04793676351867268, 0.15197429992554348, -0.11942188929174548, -0.13300571636357736, -0.10887668872574152, 0.006184494482444721, 0.013869454551631777, 0.07802300742624989, 0.2247427611211402, -0.09679041328681111, -0.0878429800428659, 0.3412090041761713, -0.02845373487961696, 0.036243971820189576, 0.17092955557256284, -0.23629284071818726, -0.06751586604758958, 0.19857860563723284, 0.06888842161649089, 0.07879847158007672, -0.1544469463669969, 0.1001659050643951, 0.017129244914966, 0.2545868662908395, 0.13709748046968795, 0.10093942580300723, 0.27307028039228, 0.2407028884654125, 0.02802046568477831, 0.08448433006077866, -0.14172000829217452, 0.0407893933577759, -0.10965890060048376, -0.22661726805952673, -0.2304238221982372, 0.12882404873652437, -0.09230726418057109, -0.1927721491214062, 0.3193496497822316, 0.11992615683082596, 0.11722189911192928, -0.08818014629378862, 0.25293165795444117, 0.04605450192422859, 0.07918903485844107, -0.041076577305532644, 0.24497269263717336, 0.19213766635234564, 0.14728557255889385, -0.24311783316623525, 0.12978760958170502, -0.04771080726396432] |
1,802.08153 | From Vectors to Geometric Algebra | Geometric algebra is the natural outgrowth of the concept of a vector and the
addition of vectors. After reviewing the properties of the addition of vectors,
a multiplication of vectors is introduced in such a way that it encodes the
famous Pythagorean theorem. Synthetic proofs of theorems in Euclidean geometry
can then be replaced by powerful algebraic proofs. Whereas we largely limit our
attention to 2 and 3 dimensions, geometric algebra is applicable in any number
of dimensions, and in both Euclidean and non-Euclidean geometries.
| math.GM | geometric algebra is the natural outgrowth of the concept of a vector and the addition of vectors after reviewing the properties of the addition of vectors a multiplication of vectors is introduced in such a way that it encodes the famous pythagorean theorem synthetic proofs of theorems in euclidean geometry can then be replaced by powerful algebraic proofs whereas we largely limit our attention to 2 and 3 dimensions geometric algebra is applicable in any number of dimensions and in both euclidean and noneuclidean geometries | [['geometric', 'algebra', 'is', 'the', 'natural', 'outgrowth', 'of', 'the', 'concept', 'of', 'a', 'vector', 'and', 'the', 'addition', 'of', 'vectors', 'after', 'reviewing', 'the', 'properties', 'of', 'the', 'addition', 'of', 'vectors', 'a', 'multiplication', 'of', 'vectors', 'is', 'introduced', 'in', 'such', 'a', 'way', 'that', 'it', 'encodes', 'the', 'famous', 'pythagorean', 'theorem', 'synthetic', 'proofs', 'of', 'theorems', 'in', 'euclidean', 'geometry', 'can', 'then', 'be', 'replaced', 'by', 'powerful', 'algebraic', 'proofs', 'whereas', 'we', 'largely', 'limit', 'our', 'attention', 'to', '2', 'and', '3', 'dimensions', 'geometric', 'algebra', 'is', 'applicable', 'in', 'any', 'number', 'of', 'dimensions', 'and', 'in', 'both', 'euclidean', 'and', 'noneuclidean', 'geometries']] | [-0.09860672158983481, 0.1103180565926082, -0.09414246444973876, 0.07569367440883071, -0.09469340713146855, -0.11390599112286616, 0.0036630736992639655, 0.31612632864100093, -0.2978747433434953, -0.24181691691936816, 0.1394250476568499, -0.24425001387357684, -0.20792618047665148, 0.197344150821514, -0.1390795100151616, 0.017594236272441992, 0.004899498476194876, 0.07657244788373217, -0.10747821291306, -0.25482363608830116, 0.35704659267383465, -0.013030159309068147, 0.25022148979718195, 0.03279966630096383, 0.13678104856380208, 0.06498558794093483, -0.054687356285970004, 0.05749972479089218, -0.08856741440497845, 0.18694852301303078, 0.2290664732017938, 0.1549625474959612, 0.22105715507093598, -0.4054690661456655, -0.16985353977583786, 0.112259905544274, 0.14925735267427037, 0.09145365003496408, -0.020013635978102684, -0.2647571578183595, 0.09427938650855247, -0.09834940316812957, -0.1549509430797223, -0.09442359430523699, 0.06881078045870014, -0.01868484674350304, -0.2423168758272796, 0.022590673682005968, 0.17534846289302497, 0.09052931621451588, -0.04801674372900058, -0.09194870787426172, -0.019181311516748633, 0.07842022336142905, 0.01924301546121783, 0.05538900332963642, 0.09248894966371796, -0.09516095011495054, -0.16208470825872878, 0.3809119467349613, 0.015878509806797784, -0.2641997085774646, 0.15911796895020147, -0.12007749625207746, -0.1304590874515912, 0.06088042237850673, 0.13074250729645, 0.1294727676164578, -0.0921013211393181, 0.17881618683390757, -0.09074770805480725, 0.1040574794909095, 0.12449570337639135, 0.054298260380678316, 0.14952853852335143, 0.10384082829798846, 0.032832497150144156, 0.15666741781785865, -0.029476828977246496, -0.10181443824925844, -0.31771884292144986, -0.19026755370158593, -0.20007630294901044, 0.08284900862011402, -0.17083202325396568, -0.1435878062620759, 0.40533965994768284, 0.11539963547359494, 0.20681174784241355, 0.05100663925849778, 0.2768782952389516, 0.07495493553441894, 0.10865239256664234, 0.07268102418576532, 0.18589936581933322, 0.20383868242668754, 0.06296740584075451, -0.07432569642551243, 0.001188765636042637, 0.15324001299107776] |
1,802.08154 | Sliding Bidirectional Recurrent Neural Networks for Sequence Detection
in Communication Systems | The design and analysis of communication systems typically rely on the
development of mathematical models that describe the underlying communication
channel. However, in some systems, such as molecular communication systems
where chemical signals are used for transfer of information, the underlying
channel models are unknown. In these scenarios, a completely new approach to
design and analysis is required. In this work, we focus on one important aspect
of communication systems, the detection algorithms, and demonstrate that by
using tools from deep learning, it is possible to train detectors that perform
well without any knowledge of the underlying channel models. We propose a
technique we call sliding bidirectional recurrent neural network (SBRNN) for
real-time sequence detection. We evaluate this algorithm using experimental
data that is collected by a chemical communication platform, where the channel
model is unknown and difficult to model analytically. We show that deep
learning algorithms perform significantly better than a detector proposed in
previous works, and the SBRNN outperforms other techniques considered in this
work.
| eess.SP cs.IT cs.LG math.IT | the design and analysis of communication systems typically rely on the development of mathematical models that describe the underlying communication channel however in some systems such as molecular communication systems where chemical signals are used for transfer of information the underlying channel models are unknown in these scenarios a completely new approach to design and analysis is required in this work we focus on one important aspect of communication systems the detection algorithms and demonstrate that by using tools from deep learning it is possible to train detectors that perform well without any knowledge of the underlying channel models we propose a technique we call sliding bidirectional recurrent neural network sbrnn for realtime sequence detection we evaluate this algorithm using experimental data that is collected by a chemical communication platform where the channel model is unknown and difficult to model analytically we show that deep learning algorithms perform significantly better than a detector proposed in previous works and the sbrnn outperforms other techniques considered in this work | [['the', 'design', 'and', 'analysis', 'of', 'communication', 'systems', 'typically', 'rely', 'on', 'the', 'development', 'of', 'mathematical', 'models', 'that', 'describe', 'the', 'underlying', 'communication', 'channel', 'however', 'in', 'some', 'systems', 'such', 'as', 'molecular', 'communication', 'systems', 'where', 'chemical', 'signals', 'are', 'used', 'for', 'transfer', 'of', 'information', 'the', 'underlying', 'channel', 'models', 'are', 'unknown', 'in', 'these', 'scenarios', 'a', 'completely', 'new', 'approach', 'to', 'design', 'and', 'analysis', 'is', 'required', 'in', 'this', 'work', 'we', 'focus', 'on', 'one', 'important', 'aspect', 'of', 'communication', 'systems', 'the', 'detection', 'algorithms', 'and', 'demonstrate', 'that', 'by', 'using', 'tools', 'from', 'deep', 'learning', 'it', 'is', 'possible', 'to', 'train', 'detectors', 'that', 'perform', 'well', 'without', 'any', 'knowledge', 'of', 'the', 'underlying', 'channel', 'models', 'we', 'propose', 'a', 'technique', 'we', 'call', 'sliding', 'bidirectional', 'recurrent', 'neural', 'network', 'sbrnn', 'for', 'realtime', 'sequence', 'detection', 'we', 'evaluate', 'this', 'algorithm', 'using', 'experimental', 'data', 'that', 'is', 'collected', 'by', 'a', 'chemical', 'communication', 'platform', 'where', 'the', 'channel', 'model', 'is', 'unknown', 'and', 'difficult', 'to', 'model', 'analytically', 'we', 'show', 'that', 'deep', 'learning', 'algorithms', 'perform', 'significantly', 'better', 'than', 'a', 'detector', 'proposed', 'in', 'previous', 'works', 'and', 'the', 'sbrnn', 'outperforms', 'other', 'techniques', 'considered', 'in', 'this', 'work']] | [-0.10974994315598495, 0.017708744541435183, -0.08494075360390062, 0.06159043174395951, -0.07129662103594063, -0.21535109598635735, 0.05101912881981046, 0.43079918233153525, -0.25650738665421385, -0.32238050478839586, 0.12240690907915151, -0.22887402748295893, -0.2505795414487045, 0.2207616367558586, -0.07022101616676518, 0.11486341172765137, 0.11293400214527717, 0.036552471189597945, -0.032946791268765235, -0.22679851077145669, 0.3120915184346792, 0.05409117013147703, 0.3198310531017755, 0.017627517070933553, 0.08737029753204346, 0.006728544095140732, -0.05042931657566126, -0.04586505072963742, -0.10866572446588735, 0.14613507369053577, 0.2883649115970846, 0.2080388291136635, 0.26354761811497507, -0.44616354424171817, -0.2863323577975263, 0.10472911089368744, 0.15815819437409231, 0.12760136838623148, -0.04317840032731211, -0.27390707318230484, 0.09031082371606709, -0.18062213120332357, -0.011817307211458683, -0.09748049022094486, -0.03877210696813411, 0.009775360165063493, -0.2784476296106231, 0.024928325293641425, 0.06703767575906355, 0.03957129647944145, -0.03639810512115632, -0.10082967394633877, 0.055811745919075284, 0.15376514195001678, -0.013631013307716414, 0.020856174480722113, 0.1359540699245018, -0.16124378524480693, -0.17344159127107103, 0.35589763603569147, -0.05151950685813825, -0.21785300126310417, 0.2380884791554292, -0.03870633255668029, -0.16039980453031952, 0.0870639728633185, 0.2617608075236489, 0.12312474013598981, -0.1983053176412861, 0.03668453973058533, -0.008869353430847564, 0.191815506084125, -0.018335373613503788, 0.03503384177076692, 0.14494574011978276, 0.2783597872709621, 0.041798340563779464, 0.11118933062653286, -0.10867680545372074, -0.09666403011637768, -0.22031994418953518, -0.11881923538069436, -0.20387038477127647, -0.0152255288495342, -0.017664412320518314, -0.09913976531765775, 0.36656120094515293, 0.25714367384949843, 0.18113983766605218, 0.07327385472892198, 0.3969066746387921, 0.04195480878411898, 0.10340719027054346, 0.09891121978955177, 0.22625193232548435, 0.06161506991822295, 0.1226539818770782, -0.17342635013600868, 0.10539612335481954, -0.0009168513665745358] |
1,802.08155 | Topological Hochschild Homology of H(Z/p^k) | In this short note we study the topological Hoschschild homology of
Eilenberg-MacLane spectra for finite cyclic groups. In particular, we show that
the Eilenberg-MacLane spectrum H(Z/p^k) is a Thom spectrum for any prime p
(except, possibly, when p=k=2) and we also compute its topological Hoschshild
homology. This yields a short proof of the results obtained by Brun, and by
Pirashvili except for the anomalous case p=k=2.
| math.AT | in this short note we study the topological hoschschild homology of eilenbergmaclane spectra for finite cyclic groups in particular we show that the eilenbergmaclane spectrum hzpk is a thom spectrum for any prime p except possibly when pk2 and we also compute its topological hoschshild homology this yields a short proof of the results obtained by brun and by pirashvili except for the anomalous case pk2 | [['in', 'this', 'short', 'note', 'we', 'study', 'the', 'topological', 'hoschschild', 'homology', 'of', 'eilenbergmaclane', 'spectra', 'for', 'finite', 'cyclic', 'groups', 'in', 'particular', 'we', 'show', 'that', 'the', 'eilenbergmaclane', 'spectrum', 'hzpk', 'is', 'a', 'thom', 'spectrum', 'for', 'any', 'prime', 'p', 'except', 'possibly', 'when', 'pk2', 'and', 'we', 'also', 'compute', 'its', 'topological', 'hoschshild', 'homology', 'this', 'yields', 'a', 'short', 'proof', 'of', 'the', 'results', 'obtained', 'by', 'brun', 'and', 'by', 'pirashvili', 'except', 'for', 'the', 'anomalous', 'case', 'pk2']] | [-0.20889600932538982, 0.11597334719928247, -0.1208989258027739, 0.11050065079637404, -0.020375716780859327, -0.14563095694526085, 0.012630327678625547, 0.34439896044158747, -0.28078926546824357, -0.2235502391344025, 0.08187334273483544, -0.23340300488330068, -0.1773426387725132, 0.2286758387816094, -0.13154214289453295, -0.051461714834514415, 0.05935795506137231, 0.06974862356271062, -0.05439873648408268, -0.24667483145400645, 0.3733354626992156, 0.005266479512173978, 0.16391714185195427, 0.09733127573475478, 0.013084350804251337, 0.0404384237684546, -0.06070606672160682, 0.001729109649738622, -0.2000213385055383, 0.11139405526900811, 0.30867099590481273, -0.007480687047872279, 0.13187931795855837, -0.3079958626379569, -0.1604767596230857, 0.18344268290000776, 0.11790528408591709, 0.07503532971595488, -0.05040874917592321, -0.24158612070679072, 0.18736474305051304, -0.2206836977441396, -0.1155492276662872, -0.0831787113011593, 0.08180316685447617, 0.021041646980429218, -0.1901022739235371, 0.004824279522475239, 0.13478091308876636, 0.11867389764400228, -0.0887315848025508, -0.08535297149940142, 0.005064500362745353, 0.12115593589260243, 0.026248942465624876, -0.015883783181567513, 0.006479192953852434, -0.0895253520843292, -0.1400279870168084, 0.3932694849513826, -0.11277132252940819, -0.11593059506562967, 0.1060834007692479, -0.20076356461596867, -0.24445423276888, 0.15105957948854046, 0.023773528391584045, 0.16169338474523218, -0.006511549226291079, 0.1942132248391678, -0.09187242818168467, 0.10818151233806497, 0.07091246440356212, 0.025118433774286318, 0.12229876094571655, 0.05650025268366176, 0.0640803746997364, 0.18438908648825, -0.03962506992476327, 0.023330733756579104, -0.33121567172190497, -0.2172128108758775, -0.16891510366269993, 0.14872331907677036, -0.08669000614890902, -0.17674754637234386, 0.4416712008653179, 0.047751015554817894, 0.18899417925803436, 0.15606688613271608, 0.27130460026600056, 0.08888188827901132, 0.00813228107752308, 0.05172453840662326, 0.13372132856221425, 0.1522467791043695, 0.042654024333589606, -0.14997586735805113, -0.023037552611813658, 0.18079435073637537] |
1,802.08156 | Analysis of Fourier ptychographic microscopy with half of the captured
images | Fourier ptychography microscopy (FPM) is a new computational imaging
technique that can provide gigapixel images with both high resolution and a
wide field of view (FOV). However, time consuming of the data-acquisition
process is a critical issue. In this paper, we make an analysis on the FPM
imaging system with half number of the captured images. Based on the image
analysis of the conventional FPM system, we then compare the reconstructed
images with different number of captured data. Simulation and experiment
results show that the reconstructed image with half number captured data do not
show obvious resolution degradation compared to that with all the captured
data, except a contrast reduction. In particular in the case when the object is
close to phase-only/amplitude only, the quality of the reconstructed image with
half of the captured data is nearly as good as the one reconstructed with full
data.
| eess.IV physics.optics | fourier ptychography microscopy fpm is a new computational imaging technique that can provide gigapixel images with both high resolution and a wide field of view fov however time consuming of the dataacquisition process is a critical issue in this paper we make an analysis on the fpm imaging system with half number of the captured images based on the image analysis of the conventional fpm system we then compare the reconstructed images with different number of captured data simulation and experiment results show that the reconstructed image with half number captured data do not show obvious resolution degradation compared to that with all the captured data except a contrast reduction in particular in the case when the object is close to phaseonlyamplitude only the quality of the reconstructed image with half of the captured data is nearly as good as the one reconstructed with full data | [['fourier', 'ptychography', 'microscopy', 'fpm', 'is', 'a', 'new', 'computational', 'imaging', 'technique', 'that', 'can', 'provide', 'gigapixel', 'images', 'with', 'both', 'high', 'resolution', 'and', 'a', 'wide', 'field', 'of', 'view', 'fov', 'however', 'time', 'consuming', 'of', 'the', 'dataacquisition', 'process', 'is', 'a', 'critical', 'issue', 'in', 'this', 'paper', 'we', 'make', 'an', 'analysis', 'on', 'the', 'fpm', 'imaging', 'system', 'with', 'half', 'number', 'of', 'the', 'captured', 'images', 'based', 'on', 'the', 'image', 'analysis', 'of', 'the', 'conventional', 'fpm', 'system', 'we', 'then', 'compare', 'the', 'reconstructed', 'images', 'with', 'different', 'number', 'of', 'captured', 'data', 'simulation', 'and', 'experiment', 'results', 'show', 'that', 'the', 'reconstructed', 'image', 'with', 'half', 'number', 'captured', 'data', 'do', 'not', 'show', 'obvious', 'resolution', 'degradation', 'compared', 'to', 'that', 'with', 'all', 'the', 'captured', 'data', 'except', 'a', 'contrast', 'reduction', 'in', 'particular', 'in', 'the', 'case', 'when', 'the', 'object', 'is', 'close', 'to', 'phaseonlyamplitude', 'only', 'the', 'quality', 'of', 'the', 'reconstructed', 'image', 'with', 'half', 'of', 'the', 'captured', 'data', 'is', 'nearly', 'as', 'good', 'as', 'the', 'one', 'reconstructed', 'with', 'full', 'data']] | [-0.07767075483912024, 0.01039745140236658, -0.08504442803176313, 0.03658177419933179, -0.02317425812562478, -0.11576074316840747, -0.010194714681711048, 0.3866882646135215, -0.2528804739648155, -0.3924902399359592, 0.1466304774950098, -0.299669871916031, -0.12739992254766924, 0.23709148898929486, -0.1193065542791938, 0.05485859911824609, 0.15646864859194592, 0.055552619132253435, -0.07579205953516066, -0.2513283221179555, 0.284177292144761, 0.06430246141450159, 0.3111432447451456, -0.009020505174352177, 0.13264171537092148, 0.045464083732202135, -0.05269874422971545, 0.06584085920054851, -0.07090696842998773, 0.11201974847353995, 0.23986743739966687, 0.14868432322581265, 0.2277763835893109, -0.42991746404561504, -0.20319301160373565, 0.06898833475996949, 0.16048577109929815, 0.06100160586808262, -0.0893978662564066, -0.27870269099025635, 0.12690742478368738, -0.08476375217132014, -0.05867391929897512, -0.08395034921323431, -0.05958308240334535, -0.020208503823759483, -0.25799244327213744, 0.06767427826236035, 0.0021041035844848073, 0.09979441919653066, -0.0727548287892393, -0.060138769279201996, -0.01346608286016974, 0.1585301909172217, 0.024597882169122197, 0.09297753073965552, 0.10321218489251774, -0.1876517119544462, -0.06213209701156051, 0.3902176180918669, -0.060684191615417084, -0.1756508945904929, 0.19896136954073504, -0.2248043990726101, -0.08099886802956462, 0.19498358095257445, 0.13579167808277598, 0.11083925508026933, -0.12261278169633066, 0.02626519966730045, -0.06389317939796581, 0.24037362515669444, 0.054122895233590027, 0.04248650839295367, 0.13418501126098223, 0.21670287003226835, 0.023054331716085816, 0.13102711420185092, -0.21824066995257704, -0.023132681708525994, -0.24725923065080083, -0.14863080108730958, -0.24247359494148785, -0.010610735552798924, -0.06911704995617238, -0.13550651370194453, 0.38833887297660113, 0.19946532727315508, 0.24119076282508542, 0.04483455329860464, 0.3832351320262613, 0.08559682552445809, 0.10801234865753816, 0.002513995217480536, 0.20084137813156022, 0.038209020356037494, 0.14299518816365764, -0.16284712176641514, 0.0038472431663680693, -0.010264566184246334] |
1,802.08157 | High order time integrators for the simulation of charged particle
motion in magnetic quadrupoles | Magnetic quadrupoles are essential components of particle accelerators like
the Large Hadron Collider. In order to study numerically the stability of the
particle beam crossing a quadrupole, a large number of particle revolutions in
the accelerator must be simulated, thus leading to the necessity to preserve
numerically invariants of motion over a long time interval and to a substantial
computational cost, mostly related to the repeated evaluation of the magnetic
vector potential. In this paper, in order to reduce this cost, we first
consider a specific gauge transformation that allows to reduce significantly
the number of vector potential evaluations. We then analyze the sensitivity of
the numerical solution to the interpolation procedure required to compute
magnetic vector potential data from gridded precomputed values at the locations
required by high order time integration methods. Finally, we compare several
high order integration techniques, in order to assess their accuracy and
efficiency for these long term simulations. Explicit high order Lie methods are
considered, along with implicit high order symplectic integrators and
conventional explicit Runge Kutta methods. Among symplectic methods, high order
Lie integrators yield optimal results in terms of cost/accuracy ratios, but non
symplectic Runge Kutta methods perform remarkably well even in very long term
simulations. Furthermore, the accuracy of the field reconstruction and
interpolation techniques are shown to be limiting factors for the accuracy of
the particle tracking procedures.
| cs.CE cs.NA physics.acc-ph | magnetic quadrupoles are essential components of particle accelerators like the large hadron collider in order to study numerically the stability of the particle beam crossing a quadrupole a large number of particle revolutions in the accelerator must be simulated thus leading to the necessity to preserve numerically invariants of motion over a long time interval and to a substantial computational cost mostly related to the repeated evaluation of the magnetic vector potential in this paper in order to reduce this cost we first consider a specific gauge transformation that allows to reduce significantly the number of vector potential evaluations we then analyze the sensitivity of the numerical solution to the interpolation procedure required to compute magnetic vector potential data from gridded precomputed values at the locations required by high order time integration methods finally we compare several high order integration techniques in order to assess their accuracy and efficiency for these long term simulations explicit high order lie methods are considered along with implicit high order symplectic integrators and conventional explicit runge kutta methods among symplectic methods high order lie integrators yield optimal results in terms of costaccuracy ratios but non symplectic runge kutta methods perform remarkably well even in very long term simulations furthermore the accuracy of the field reconstruction and interpolation techniques are shown to be limiting factors for the accuracy of the particle tracking procedures | [['magnetic', 'quadrupoles', 'are', 'essential', 'components', 'of', 'particle', 'accelerators', 'like', 'the', 'large', 'hadron', 'collider', 'in', 'order', 'to', 'study', 'numerically', 'the', 'stability', 'of', 'the', 'particle', 'beam', 'crossing', 'a', 'quadrupole', 'a', 'large', 'number', 'of', 'particle', 'revolutions', 'in', 'the', 'accelerator', 'must', 'be', 'simulated', 'thus', 'leading', 'to', 'the', 'necessity', 'to', 'preserve', 'numerically', 'invariants', 'of', 'motion', 'over', 'a', 'long', 'time', 'interval', 'and', 'to', 'a', 'substantial', 'computational', 'cost', 'mostly', 'related', 'to', 'the', 'repeated', 'evaluation', 'of', 'the', 'magnetic', 'vector', 'potential', 'in', 'this', 'paper', 'in', 'order', 'to', 'reduce', 'this', 'cost', 'we', 'first', 'consider', 'a', 'specific', 'gauge', 'transformation', 'that', 'allows', 'to', 'reduce', 'significantly', 'the', 'number', 'of', 'vector', 'potential', 'evaluations', 'we', 'then', 'analyze', 'the', 'sensitivity', 'of', 'the', 'numerical', 'solution', 'to', 'the', 'interpolation', 'procedure', 'required', 'to', 'compute', 'magnetic', 'vector', 'potential', 'data', 'from', 'gridded', 'precomputed', 'values', 'at', 'the', 'locations', 'required', 'by', 'high', 'order', 'time', 'integration', 'methods', 'finally', 'we', 'compare', 'several', 'high', 'order', 'integration', 'techniques', 'in', 'order', 'to', 'assess', 'their', 'accuracy', 'and', 'efficiency', 'for', 'these', 'long', 'term', 'simulations', 'explicit', 'high', 'order', 'lie', 'methods', 'are', 'considered', 'along', 'with', 'implicit', 'high', 'order', 'symplectic', 'integrators', 'and', 'conventional', 'explicit', 'runge', 'kutta', 'methods', 'among', 'symplectic', 'methods', 'high', 'order', 'lie', 'integrators', 'yield', 'optimal', 'results', 'in', 'terms', 'of', 'costaccuracy', 'ratios', 'but', 'non', 'symplectic', 'runge', 'kutta', 'methods', 'perform', 'remarkably', 'well', 'even', 'in', 'very', 'long', 'term', 'simulations', 'furthermore', 'the', 'accuracy', 'of', 'the', 'field', 'reconstruction', 'and', 'interpolation', 'techniques', 'are', 'shown', 'to', 'be', 'limiting', 'factors', 'for', 'the', 'accuracy', 'of', 'the', 'particle', 'tracking', 'procedures']] | [-0.12196915099865005, 0.05644947509669388, -0.04777723835299216, 0.08995519121782038, -0.06593176973125849, -0.09233835876690583, 0.024265877298475652, 0.39981255642742963, -0.2552346024425341, -0.35873779920419974, 0.11654173619810312, -0.23671844384373622, -0.09250108113822837, 0.19183431603545487, -0.04526132168840584, 0.12862172840821012, 0.08457446902410307, 0.02910915903518336, -0.12214952166591263, -0.28363553410203995, 0.2628385508651183, 0.10179287054818001, 0.25770273330833826, 0.04876523354221462, 0.13562450863996914, -0.039166648647535524, -0.03697305188203851, 0.01793468059488652, -0.10715286576372532, 0.09927700270833284, 0.2578092092533776, 0.04294342699811973, 0.2781673360722172, -0.446121457735436, -0.16044752244692573, 0.12530864287155533, 0.16316254833394564, 0.11863787976714472, -0.026729533078635046, -0.2421454998435812, 0.09997383310978317, -0.17817380809400787, -0.1509433168904619, -0.18342041447881216, -0.026655878836448352, 0.08051620106408863, -0.27513349308272855, 0.05767422150610831, 0.01714218769675905, 0.05910887073709123, -0.04648746660192652, -0.1028342496372939, 0.016975837412470003, 0.11101201389152393, 0.08508454787538779, 0.04137514944886789, 0.09689285405788962, -0.13339979906378543, -0.13044705878322324, 0.4028934446866052, -0.059934556713223605, -0.25183088549723226, 0.19765411672925806, -0.1493818683819355, -0.11643574435239364, 0.1816288315090596, 0.2192646058627584, 0.11668478048280424, -0.10461960997424301, 0.06599100819214966, 0.08618951840387461, 0.13963656522447995, 0.0835830943042151, 0.00791867332953731, 0.13229236764457533, 0.1409334809827749, 0.07977280944961469, 0.0856209164352581, -0.10150774386956503, -0.10405543900254231, -0.2962582918014704, -0.16096573959619395, -0.1467679813504219, -0.011102604730280163, -0.1213274836750076, -0.13792945038393986, 0.39673964604081813, 0.1842929211276274, 0.16673492788175823, 0.06113110246185802, 0.34126641821900483, 0.1251904215263366, 0.0933958249940923, 0.047598597296631566, 0.20524311090284436, 0.1273860718785344, 0.1103891386285939, -0.24427060494015582, 0.0029093437203157103, 0.09414340222250311] |
1,802.08158 | Design of a 5 GeV Laser Plasma Accelerating Module in the Quasi-linear
Regime | Multi-GeV-class laser plasma accelerating modules are key components of laser
plasma accelerators, because they can be used as a booster of an upstream
plasma or conventional injector or as modular acceleration sections of a
multi-staged high energy plasma linac. Such a plasma module, operating in the
quasi-linear regime, has been designed for the 5 GeV laser plasma accelerator
stage (LPAS) of the EuPRAXIA project. The laser pulse ($\sim$150 TW, $\sim$ 15
J) is quasi-matched into a plasma channel ($n_{\rm p} = 1.5\times 10^{17}$
cm$^{-3}$, $L\sim$ 30 cm) and the bi-Gaussian electron beam is externally
injected into the wakefield. The beam emittance is preserved through the
acceleration by matching the beam size to the transverse focusing fields. And a
final energy spread of $<$1\% has been achieved by optimizing the beam loading
effect. Several methods have been proposed to reduce the slice energy spread
and are found to be effective. The simulations were conducted with the 3D PIC
code Warp in the Lorentz boosted frame.
| physics.acc-ph | multigevclass laser plasma accelerating modules are key components of laser plasma accelerators because they can be used as a booster of an upstream plasma or conventional injector or as modular acceleration sections of a multistaged high energy plasma linac such a plasma module operating in the quasilinear regime has been designed for the 5 gev laser plasma accelerator stage lpas of the eupraxia project the laser pulse sim150 tw sim 15 j is quasimatched into a plasma channel n_rm p 15times 1017 cm3 lsim 30 cm and the bigaussian electron beam is externally injected into the wakefield the beam emittance is preserved through the acceleration by matching the beam size to the transverse focusing fields and a final energy spread of 1 has been achieved by optimizing the beam loading effect several methods have been proposed to reduce the slice energy spread and are found to be effective the simulations were conducted with the 3d pic code warp in the lorentz boosted frame | [['multigevclass', 'laser', 'plasma', 'accelerating', 'modules', 'are', 'key', 'components', 'of', 'laser', 'plasma', 'accelerators', 'because', 'they', 'can', 'be', 'used', 'as', 'a', 'booster', 'of', 'an', 'upstream', 'plasma', 'or', 'conventional', 'injector', 'or', 'as', 'modular', 'acceleration', 'sections', 'of', 'a', 'multistaged', 'high', 'energy', 'plasma', 'linac', 'such', 'a', 'plasma', 'module', 'operating', 'in', 'the', 'quasilinear', 'regime', 'has', 'been', 'designed', 'for', 'the', '5', 'gev', 'laser', 'plasma', 'accelerator', 'stage', 'lpas', 'of', 'the', 'eupraxia', 'project', 'the', 'laser', 'pulse', 'sim150', 'tw', 'sim', '15', 'j', 'is', 'quasimatched', 'into', 'a', 'plasma', 'channel', 'n_rm', 'p', '15times', '1017', 'cm3', 'lsim', '30', 'cm', 'and', 'the', 'bigaussian', 'electron', 'beam', 'is', 'externally', 'injected', 'into', 'the', 'wakefield', 'the', 'beam', 'emittance', 'is', 'preserved', 'through', 'the', 'acceleration', 'by', 'matching', 'the', 'beam', 'size', 'to', 'the', 'transverse', 'focusing', 'fields', 'and', 'a', 'final', 'energy', 'spread', 'of', '1', 'has', 'been', 'achieved', 'by', 'optimizing', 'the', 'beam', 'loading', 'effect', 'several', 'methods', 'have', 'been', 'proposed', 'to', 'reduce', 'the', 'slice', 'energy', 'spread', 'and', 'are', 'found', 'to', 'be', 'effective', 'the', 'simulations', 'were', 'conducted', 'with', 'the', '3d', 'pic', 'code', 'warp', 'in', 'the', 'lorentz', 'boosted', 'frame']] | [-0.1072642154115258, 0.23137463118835072, -0.05747708214138872, 0.04701159938501761, 0.007020797107588523, -0.15764306672062053, -0.08850631160771485, 0.44103509423710546, -0.22128380360139638, -0.3475606617118631, 0.055810007204515684, -0.23663806356959657, 0.09766632865106409, 0.24790168577018454, 0.021369610002021425, 0.09303338674145827, 0.049100346702746815, -0.0545011252592902, -0.014021049658565418, -0.1748457221785757, 0.23816913370800824, 0.2112164408986613, 0.297145773193355, 0.07295338299865864, 0.1456091852680786, -0.05034430327055895, 0.02061477052163541, -0.04620401766035498, -0.08532591012600442, 0.009699170266549964, 0.23804494619415784, 0.08376282640163041, 0.281289170630658, -0.4357745623800279, -0.2477991983691456, 0.02818372224382362, 0.1764198655598097, 0.04670330534706482, -0.07472665026864928, -0.22007108876345713, 0.060381061076446904, -0.223387719753852, -0.126477551234377, 0.04955321667941507, -0.02091193654840546, 0.08483316707685128, -0.30447859555245693, -0.006575851892996059, 0.0014535049692386334, 0.04801513236420958, -0.015677143968583912, -0.11727369985086207, -0.0015272719912832568, 0.0034966781245174337, 0.042165203245576495, 0.13995543429165247, 0.2531355053059155, -0.11946651429770896, -0.05140865889742323, 0.3977630297821131, -0.03569388474910433, -0.12066729405536229, 0.1355730867398735, -0.20180419415108258, -0.014962783172981154, 0.22468962071764265, 0.1885739027671458, 0.062371749465602526, -0.12989833191259886, 0.047949843677353714, 0.012203257854865946, 0.17560186727776522, 0.1634403399845458, -0.018812984541949372, 0.20808714109629114, 0.20109284567640898, 0.024640844475363327, 0.10246326812681805, -0.16861967629932376, 0.03802928655055461, -0.2728338982072595, -0.1179996654535904, -0.11127173691490515, 0.043814371958975494, -0.0247554943246242, -0.05626724710216549, 0.449621571453508, 0.10598457603489761, 0.11798266009340838, -0.08488917500590501, 0.3371026147336277, 0.11833252667981599, 0.08557889662590457, 0.10286529208331005, 0.2748009001500673, 0.1459373870679403, 0.13863123448779632, -0.2196027131271057, -0.01686805353632995, 0.019306571470133913] |
1,802.08159 | Collaboratively Learning the Best Option, Using Bounded Memory | We consider multi-armed bandit problems in social groups wherein each
individual has bounded memory and shares the common goal of learning the best
arm/option. We say an individual learns the best option if eventually (as $t
\to \infty$) it pulls only the arm with the highest average reward. While this
goal is provably impossible for an isolated individual, we show that, in social
groups, this goal can be achieved easily with the aid of social persuasion,
i.e., communication. Specifically, we study the learning dynamics wherein an
individual sequentially decides on which arm to pull next based on not only its
private reward feedback but also the suggestions provided by randomly chosen
peers. Our learning dynamics are hard to analyze via explicit probabilistic
calculations due to the stochastic dependency induced by social interaction.
Instead, we employ the mean-field approximation method from statistical physics
and we show:
(1) With probability $\to 1$ as the social group size $N \to \infty $, every
individual in the social group learns the best option.
(2) Over an arbitrary finite time horizon $[0, T]$, with high probability (in
$N$), the fraction of individuals that prefer the best option grows to 1
exponentially fast as $t$ increases ($t\in [0, T]$).
A major innovation of our mean-filed analysis is a simple yet powerful
technique to deal with absorbing states in the interchange of limits $N \to
\infty$ and $t \to \infty $. The mean-field approximation method allows us to
approximate the probabilistic sample paths of our learning dynamics by a
deterministic and smooth trajectory that corresponds to the unique solution of
a well-behaved system of ordinary differential equations (ODEs). Such an
approximation is desired because the analysis of a system of ODEs is relatively
easier than that of the original stochastic system.
| cs.LG cs.DC | we consider multiarmed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best armoption we say an individual learns the best option if eventually as t to infty it pulls only the arm with the highest average reward while this goal is provably impossible for an isolated individual we show that in social groups this goal can be achieved easily with the aid of social persuasion ie communication specifically we study the learning dynamics wherein an individual sequentially decides on which arm to pull next based on not only its private reward feedback but also the suggestions provided by randomly chosen peers our learning dynamics are hard to analyze via explicit probabilistic calculations due to the stochastic dependency induced by social interaction instead we employ the meanfield approximation method from statistical physics and we show 1 with probability to 1 as the social group size n to infty every individual in the social group learns the best option 2 over an arbitrary finite time horizon 0 t with high probability in n the fraction of individuals that prefer the best option grows to 1 exponentially fast as t increases tin 0 t a major innovation of our meanfiled analysis is a simple yet powerful technique to deal with absorbing states in the interchange of limits n to infty and t to infty the meanfield approximation method allows us to approximate the probabilistic sample paths of our learning dynamics by a deterministic and smooth trajectory that corresponds to the unique solution of a wellbehaved system of ordinary differential equations odes such an approximation is desired because the analysis of a system of odes is relatively easier than that of the original stochastic system | [['we', 'consider', 'multiarmed', 'bandit', 'problems', 'in', 'social', 'groups', 'wherein', 'each', 'individual', 'has', 'bounded', 'memory', 'and', 'shares', 'the', 'common', 'goal', 'of', 'learning', 'the', 'best', 'armoption', 'we', 'say', 'an', 'individual', 'learns', 'the', 'best', 'option', 'if', 'eventually', 'as', 't', 'to', 'infty', 'it', 'pulls', 'only', 'the', 'arm', 'with', 'the', 'highest', 'average', 'reward', 'while', 'this', 'goal', 'is', 'provably', 'impossible', 'for', 'an', 'isolated', 'individual', 'we', 'show', 'that', 'in', 'social', 'groups', 'this', 'goal', 'can', 'be', 'achieved', 'easily', 'with', 'the', 'aid', 'of', 'social', 'persuasion', 'ie', 'communication', 'specifically', 'we', 'study', 'the', 'learning', 'dynamics', 'wherein', 'an', 'individual', 'sequentially', 'decides', 'on', 'which', 'arm', 'to', 'pull', 'next', 'based', 'on', 'not', 'only', 'its', 'private', 'reward', 'feedback', 'but', 'also', 'the', 'suggestions', 'provided', 'by', 'randomly', 'chosen', 'peers', 'our', 'learning', 'dynamics', 'are', 'hard', 'to', 'analyze', 'via', 'explicit', 'probabilistic', 'calculations', 'due', 'to', 'the', 'stochastic', 'dependency', 'induced', 'by', 'social', 'interaction', 'instead', 'we', 'employ', 'the', 'meanfield', 'approximation', 'method', 'from', 'statistical', 'physics', 'and', 'we', 'show', '1', 'with', 'probability', 'to', '1', 'as', 'the', 'social', 'group', 'size', 'n', 'to', 'infty', 'every', 'individual', 'in', 'the', 'social', 'group', 'learns', 'the', 'best', 'option', '2', 'over', 'an', 'arbitrary', 'finite', 'time', 'horizon', '0', 't', 'with', 'high', 'probability', 'in', 'n', 'the', 'fraction', 'of', 'individuals', 'that', 'prefer', 'the', 'best', 'option', 'grows', 'to', '1', 'exponentially', 'fast', 'as', 't', 'increases', 'tin', '0', 't', 'a', 'major', 'innovation', 'of', 'our', 'meanfiled', 'analysis', 'is', 'a', 'simple', 'yet', 'powerful', 'technique', 'to', 'deal', 'with', 'absorbing', 'states', 'in', 'the', 'interchange', 'of', 'limits', 'n', 'to', 'infty', 'and', 't', 'to', 'infty', 'the', 'meanfield', 'approximation', 'method', 'allows', 'us', 'to', 'approximate', 'the', 'probabilistic', 'sample', 'paths', 'of', 'our', 'learning', 'dynamics', 'by', 'a', 'deterministic', 'and', 'smooth', 'trajectory', 'that', 'corresponds', 'to', 'the', 'unique', 'solution', 'of', 'a', 'wellbehaved', 'system', 'of', 'ordinary', 'differential', 'equations', 'odes', 'such', 'an', 'approximation', 'is', 'desired', 'because', 'the', 'analysis', 'of', 'a', 'system', 'of', 'odes', 'is', 'relatively', 'easier', 'than', 'that', 'of', 'the', 'original', 'stochastic', 'system']] | [-0.0908781389259378, 0.07836882649630643, -0.08098036107203933, 0.06425709452214443, -0.116883153153449, -0.18550739116979525, 0.0975629598593589, 0.40214368172271553, -0.3192084680865055, -0.29026204571069886, 0.05937133161003039, -0.2925838735619183, -0.14142154691392025, 0.12910719455501443, -0.0669295401100383, 0.04952774853889648, 0.026151566601380755, 0.11211841402354744, -0.004080880456124, -0.2719403985404502, 0.28432541110201703, 0.048102179806618676, 0.24752099124980367, -0.033904707748554905, 0.13731600836805896, 0.019277302888484074, 0.004702956595336474, 0.011564044868717566, -0.1142467465135669, 0.09180558311470538, 0.2940030723733786, 0.14877330874256098, 0.3737501680364519, -0.41468670639495786, -0.14927316470474927, 0.12416450861166152, 0.16462803546749727, 0.09760310809980899, -0.009038832995966972, -0.2759861395241456, 0.09959784901582498, -0.17006985658197263, -0.12253103414478414, -0.05328596611523239, 0.02233362700022066, 0.035875421424343176, -0.29822002547629867, 0.004904031082151675, 0.07273498778327454, 0.003688351454186658, -0.03330146877716785, -0.09589299779502143, 0.0058181110483072574, 0.1601668101642601, 0.049103571474872196, 0.05163903373511207, 0.1305978879269734, -0.12453688025619368, -0.12518841572885187, 0.36462786018566784, -0.07706482522494658, -0.18697099139293036, 0.19241757709228935, -0.1312349800170876, -0.12884313322468086, 0.13728377365913638, 0.18004816866766252, 0.1407957499049911, -0.14235141857997657, 0.08996828129399836, -0.050049673127413714, 0.1947191449488702, 0.021980328675794743, -0.011567692454789103, 0.12063068427265297, 0.18962161065398514, 0.13334319397048622, 0.10626617615904077, -0.021850470075050938, -0.13283195556381466, -0.27786186934949647, -0.13123130044080572, -0.1745140110310551, 0.08360698194123198, -0.13070993356649122, -0.13103406619331784, 0.32991177730159865, 0.15464286640993738, 0.20579240121798673, 0.11727769660108957, 0.29443856601961776, 0.09822402788042907, 0.027504085309289817, 0.11097229848543015, 0.17093341859958464, 0.0682090304030227, 0.0740566758736584, -0.21628382065112597, 0.12508543690864982, 0.041626357484784514] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.