id
float64 706
1.8k
| title
stringlengths 1
343
| abstract
stringlengths 6
6.09k
| categories
stringlengths 5
125
| processed_abstract
stringlengths 2
5.96k
| tokenized_abstract
stringlengths 8
8.74k
| centroid
stringlengths 2.1k
2.17k
|
|---|---|---|---|---|---|---|
1,803.05267
|
$P_{c}$-like pentaquarks in hidden strange sector
|
Analogous to the work of hidden charm molecular pentaquarks, we study
possible hidden strange molecular pentaquarks composed of $\Sigma$ (or
$\Sigma^{*}$) and $K$ (or $K^{*}$) in the framework of quark delocalization
color screening model. Our results suggest that the $\Sigma K$, $\Sigma K^{*}$
and $\Sigma^{*} K^{*}$ with $IJ^{P}=\frac{1}{2}\frac{1}{2}^{-}$ and $\Sigma
K^{*}$, $\Sigma^{*} K$ and $\Sigma^{*} K^{*}$ with
$IJ^{P}=\frac{1}{2}\frac{3}{2}^{-}$ are all resonance states by coupling the
open channels. The molecular pentaquark $\Sigma^{*} K$ with quantum numbers
$IJ^{P}=\frac{1}{2}\frac{3}{2}^{-}$ can be seen as a strange partner of the
LHCb $P_{c}(4380)$ state, and it can be identified as the nucleon resonance
$N^{*}(1875)$ listed in PDG. The $\Sigma K^{*}$ with quantum numbers
$IJ^{P}=\frac{1}{2}\frac{3}{2}^{-}$ can be identified as the $N^{*}(2100)$,
which was experimentally observed in the $\phi$ photo-production.
|
hep-ph nucl-th
|
analogous to the work of hidden charm molecular pentaquarks we study possible hidden strange molecular pentaquarks composed of sigma or sigma and k or k in the framework of quark delocalization color screening model our results suggest that the sigma k sigma k and sigma k with ijpfrac12frac12 and sigma k sigma k and sigma k with ijpfrac12frac32 are all resonance states by coupling the open channels the molecular pentaquark sigma k with quantum numbers ijpfrac12frac32 can be seen as a strange partner of the lhcb p_c4380 state and it can be identified as the nucleon resonance n1875 listed in pdg the sigma k with quantum numbers ijpfrac12frac32 can be identified as the n2100 which was experimentally observed in the phi photoproduction
|
[['analogous', 'to', 'the', 'work', 'of', 'hidden', 'charm', 'molecular', 'pentaquarks', 'we', 'study', 'possible', 'hidden', 'strange', 'molecular', 'pentaquarks', 'composed', 'of', 'sigma', 'or', 'sigma', 'and', 'k', 'or', 'k', 'in', 'the', 'framework', 'of', 'quark', 'delocalization', 'color', 'screening', 'model', 'our', 'results', 'suggest', 'that', 'the', 'sigma', 'k', 'sigma', 'k', 'and', 'sigma', 'k', 'with', 'ijpfrac12frac12', 'and', 'sigma', 'k', 'sigma', 'k', 'and', 'sigma', 'k', 'with', 'ijpfrac12frac32', 'are', 'all', 'resonance', 'states', 'by', 'coupling', 'the', 'open', 'channels', 'the', 'molecular', 'pentaquark', 'sigma', 'k', 'with', 'quantum', 'numbers', 'ijpfrac12frac32', 'can', 'be', 'seen', 'as', 'a', 'strange', 'partner', 'of', 'the', 'lhcb', 'p_c4380', 'state', 'and', 'it', 'can', 'be', 'identified', 'as', 'the', 'nucleon', 'resonance', 'n1875', 'listed', 'in', 'pdg', 'the', 'sigma', 'k', 'with', 'quantum', 'numbers', 'ijpfrac12frac32', 'can', 'be', 'identified', 'as', 'the', 'n2100', 'which', 'was', 'experimentally', 'observed', 'in', 'the', 'phi', 'photoproduction']]
|
[-0.13583275979030723, 0.2634926855925871, -0.08591894771324562, 0.08391297560893307, -0.03417482227471865, -0.19377619701183654, 0.1091826148292681, 0.3244228420917653, -0.20923467423412795, -0.2903633800235169, -0.045485373966449735, -0.32548372933933556, -0.0653351887267791, 0.06714306955133403, 0.12422620273418417, 0.08407180426903993, 0.021438596800954873, 0.12424939340519264, 0.01171159244494605, -0.2190546578966266, 0.26076478508785983, -0.07373327945651532, 0.10921989721515454, 0.10073201066991391, -0.016553642324456747, -0.06454918783327396, 0.057837382653604975, -0.010067710293118249, -0.13169124810447702, 0.08259804158862141, 0.2872486574520465, 0.08344289095310325, 0.10933880396726087, -0.28501610888922513, -0.20416387455915064, 0.1055171387462515, 0.15979358241393055, 0.048586288947142536, 0.04355156736463801, -0.3709629159728604, 0.1835366786839556, -0.12010540235171879, -0.15941899194774672, -0.09625612440411278, 0.04801881104546083, -0.04688923332016638, -0.24857503474374448, 0.10244520017102722, 0.014386607759270417, 0.09502543863063016, 0.00273515432996075, -0.34443984862055227, -0.08807311833774563, 0.02336523941263926, 0.01771590207445566, 0.14418810387026548, 0.14592298833761086, -0.1604006539506853, -0.17236266131628275, 0.3903202504874015, -0.1276451624441153, -0.14754325200511095, 0.11943255002756627, -0.17249952618048087, -0.12373473140033932, 0.1249755532442292, 0.1317606880214096, 0.06615069313051779, -0.13578111776497123, 0.11158916028360798, -0.14569551001441441, 0.2191077398188212, 0.09201307385036152, 0.062176076245055466, 0.22645989045777842, 0.14800557738924322, -0.05155615811380519, 0.09989525564688388, -0.106052744448616, -0.06340855639091161, -0.3552216653084798, -0.1283797683994755, -0.09239466951809792, 0.11431281340370063, -0.013429861272707358, -0.03651166055351496, 0.30185610855629375, 0.021875850829365086, 0.2930682012811303, -0.03763117925321668, 0.195819731336087, 0.09818689345405245, 0.07037175663031084, 0.10127067884953678, 0.17208797994939504, 0.25219404570612103, 0.04952519697960743, -0.2875898298307145, -0.004946580595406126, -0.0342545101365213]
|
1,803.05268
|
Transparency by Design: Closing the Gap Between Performance and
Interpretability in Visual Reasoning
|
Visual question answering requires high-order reasoning about an image, which
is a fundamental capability needed by machine systems to follow complex
directives. Recently, modular networks have been shown to be an effective
framework for performing visual reasoning tasks. While modular networks were
initially designed with a degree of model transparency, their performance on
complex visual reasoning benchmarks was lacking. Current state-of-the-art
approaches do not provide an effective mechanism for understanding the
reasoning process. In this paper, we close the performance gap between
interpretable models and state-of-the-art visual reasoning methods. We propose
a set of visual-reasoning primitives which, when composed, manifest as a model
capable of performing complex reasoning tasks in an explicitly-interpretable
manner. The fidelity and interpretability of the primitives' outputs enable an
unparalleled ability to diagnose the strengths and weaknesses of the resulting
model. Critically, we show that these primitives are highly performant,
achieving state-of-the-art accuracy of 99.1% on the CLEVR dataset. We also show
that our model is able to effectively learn generalized representations when
provided a small amount of data containing novel object attributes. Using the
CoGenT generalization task, we show more than a 20 percentage point improvement
over the current state of the art.
|
cs.CV
|
visual question answering requires highorder reasoning about an image which is a fundamental capability needed by machine systems to follow complex directives recently modular networks have been shown to be an effective framework for performing visual reasoning tasks while modular networks were initially designed with a degree of model transparency their performance on complex visual reasoning benchmarks was lacking current stateoftheart approaches do not provide an effective mechanism for understanding the reasoning process in this paper we close the performance gap between interpretable models and stateoftheart visual reasoning methods we propose a set of visualreasoning primitives which when composed manifest as a model capable of performing complex reasoning tasks in an explicitlyinterpretable manner the fidelity and interpretability of the primitives outputs enable an unparalleled ability to diagnose the strengths and weaknesses of the resulting model critically we show that these primitives are highly performant achieving stateoftheart accuracy of 991 on the clevr dataset we also show that our model is able to effectively learn generalized representations when provided a small amount of data containing novel object attributes using the cogent generalization task we show more than a 20 percentage point improvement over the current state of the art
|
[['visual', 'question', 'answering', 'requires', 'highorder', 'reasoning', 'about', 'an', 'image', 'which', 'is', 'a', 'fundamental', 'capability', 'needed', 'by', 'machine', 'systems', 'to', 'follow', 'complex', 'directives', 'recently', 'modular', 'networks', 'have', 'been', 'shown', 'to', 'be', 'an', 'effective', 'framework', 'for', 'performing', 'visual', 'reasoning', 'tasks', 'while', 'modular', 'networks', 'were', 'initially', 'designed', 'with', 'a', 'degree', 'of', 'model', 'transparency', 'their', 'performance', 'on', 'complex', 'visual', 'reasoning', 'benchmarks', 'was', 'lacking', 'current', 'stateoftheart', 'approaches', 'do', 'not', 'provide', 'an', 'effective', 'mechanism', 'for', 'understanding', 'the', 'reasoning', 'process', 'in', 'this', 'paper', 'we', 'close', 'the', 'performance', 'gap', 'between', 'interpretable', 'models', 'and', 'stateoftheart', 'visual', 'reasoning', 'methods', 'we', 'propose', 'a', 'set', 'of', 'visualreasoning', 'primitives', 'which', 'when', 'composed', 'manifest', 'as', 'a', 'model', 'capable', 'of', 'performing', 'complex', 'reasoning', 'tasks', 'in', 'an', 'explicitlyinterpretable', 'manner', 'the', 'fidelity', 'and', 'interpretability', 'of', 'the', 'primitives', 'outputs', 'enable', 'an', 'unparalleled', 'ability', 'to', 'diagnose', 'the', 'strengths', 'and', 'weaknesses', 'of', 'the', 'resulting', 'model', 'critically', 'we', 'show', 'that', 'these', 'primitives', 'are', 'highly', 'performant', 'achieving', 'stateoftheart', 'accuracy', 'of', '991', 'on', 'the', 'clevr', 'dataset', 'we', 'also', 'show', 'that', 'our', 'model', 'is', 'able', 'to', 'effectively', 'learn', 'generalized', 'representations', 'when', 'provided', 'a', 'small', 'amount', 'of', 'data', 'containing', 'novel', 'object', 'attributes', 'using', 'the', 'cogent', 'generalization', 'task', 'we', 'show', 'more', 'than', 'a', '20', 'percentage', 'point', 'improvement', 'over', 'the', 'current', 'state', 'of', 'the', 'art']]
|
[-0.06939534251150505, -0.0005157568870790598, -0.06534452432034803, 0.06043026097419285, -0.11954007976408097, -0.15577290325463578, 0.03540569791636829, 0.4463136574557545, -0.24872552798300676, -0.38279800652051155, 0.035525405630992005, -0.23868356260461543, -0.18685191759259953, 0.22682227924221424, -0.1300245671965448, 0.10054531095226352, 0.1284522789985426, 0.06567446424460101, -0.054643177141064814, -0.2882260287997826, 0.29003450697824257, 0.0679574538662564, 0.3151291483081877, 0.054508747930914085, 0.130228157124924, -0.036941851306307526, 0.0053809398768305755, -0.01699321975038216, -0.042636016618453884, 0.20042508203246423, 0.30887416820125363, 0.20715910873176263, 0.30415221352762145, -0.4106857159786159, -0.21731256929758405, 0.07370409981480666, 0.14450690154418616, 0.0888258860213682, -0.014657402831995124, -0.34024030740886013, 0.09987618776195094, -0.19117611101230106, -0.034453179373652956, -0.20784679079922486, 0.004091570709774993, -0.038765693934247065, -0.26720639896740644, 0.002009533930894187, 0.114756985274096, 0.11698431628959655, -0.03491186141392824, -0.08717736540295716, 0.036407694348837345, 0.16625542173605193, -0.02624796465177645, 0.04936924926658655, 0.13473558918738082, -0.21592441553900932, -0.17981649709245362, 0.3743766658875274, -0.03828384149357812, -0.2300791859398691, 0.23381881629668025, -0.02563162907311807, -0.13417168206610675, 0.11147862180060118, 0.19268793272619536, 0.12550291204254846, -0.15461989505853793, 0.015632036219562443, -0.032934215342702, 0.24514159798513438, 0.027039926781851267, 0.01800397704165353, 0.22945951369866652, 0.2610248358271617, 0.011277942174905436, 0.1054250817758991, -0.07761893608091798, -0.08423674801407306, -0.19142502523264943, -0.11344119905237565, -0.10682408806597053, -0.017486948877432247, -0.07897118641378664, -0.12812421706703203, 0.3915488625097336, 0.26369758939004634, 0.20781345926795383, 0.10483662266392921, 0.3471836362281168, 0.05285739064478251, 0.09684128944681274, 0.09846123136379234, 0.18870840937241304, 0.03984690787940647, 0.09848837312180264, -0.16130767159974108, 0.10214164117184867, 0.013978464924047312]
|
1,803.05269
|
Tilting theory for Gorenstein rings in dimension one
|
For a $Z$-graded Gorenstein ring $R$, we study the stable category $CM^ZR$ of
$Z$-graded maximal Cohen-Macaulay $R$-modules, which is canonically triangle
equivalent to the singularity category of Buchweitz and Orlov. Its thick
subcategory given as the stable category of $CM_0^ZR$ is central in
representation theory since it enjoys Auslander-Reiten-Serre duality and has
almost split triangles. In the case $dim R=1$, we prove that the stable
category of $CM_0^ZR$ always admits a silting object, and that it admits a
tilting object if and only if either $R$ is regular or the $a$-invariant of $R$
is non-negative.
|
math.RT math.AC math.AG math.RA
|
for a zgraded gorenstein ring r we study the stable category cmzr of zgraded maximal cohenmacaulay rmodules which is canonically triangle equivalent to the singularity category of buchweitz and orlov its thick subcategory given as the stable category of cm_0zr is central in representation theory since it enjoys auslanderreitenserre duality and has almost split triangles in the case dim r1 we prove that the stable category of cm_0zr always admits a silting object and that it admits a tilting object if and only if either r is regular or the ainvariant of r is nonnegative
|
[['for', 'a', 'zgraded', 'gorenstein', 'ring', 'r', 'we', 'study', 'the', 'stable', 'category', 'cmzr', 'of', 'zgraded', 'maximal', 'cohenmacaulay', 'rmodules', 'which', 'is', 'canonically', 'triangle', 'equivalent', 'to', 'the', 'singularity', 'category', 'of', 'buchweitz', 'and', 'orlov', 'its', 'thick', 'subcategory', 'given', 'as', 'the', 'stable', 'category', 'of', 'cm_0zr', 'is', 'central', 'in', 'representation', 'theory', 'since', 'it', 'enjoys', 'auslanderreitenserre', 'duality', 'and', 'has', 'almost', 'split', 'triangles', 'in', 'the', 'case', 'dim', 'r1', 'we', 'prove', 'that', 'the', 'stable', 'category', 'of', 'cm_0zr', 'always', 'admits', 'a', 'silting', 'object', 'and', 'that', 'it', 'admits', 'a', 'tilting', 'object', 'if', 'and', 'only', 'if', 'either', 'r', 'is', 'regular', 'or', 'the', 'ainvariant', 'of', 'r', 'is', 'nonnegative']]
|
[-0.17968952290938942, -0.010290664436479847, -0.09184399392496753, 0.07080138555298057, -0.07504045681843718, -0.26399811316322497, -0.0996543105632824, 0.41080373269761655, -0.4027576139503783, -0.10145504380177174, 0.1235612684778951, -0.24750281542867095, -0.10513361357664178, 0.10516953568363173, -0.20332685165148187, -0.11858097318582912, 0.09671067685953208, 0.15961410188126368, -0.01880465959106664, -0.3015099268324755, 0.4271010818359043, -0.026324996957555413, 0.21470438239962927, 0.0311266418474798, 0.1488517618809755, 0.015821240514844327, 0.050564355503481165, 0.06385014554649428, -0.16993450557708786, 0.09691640570667664, 0.3269443667115091, 0.10800329591966347, 0.18209584593417247, -0.302604650531046, -0.03318139587293614, 0.22419788093807605, 0.15474415496170807, -0.011573322625206476, -0.01038280852103176, -0.25051477974905006, 0.21444596311046774, -0.23977334232448222, -0.13224308021816905, -0.04217569375088295, 0.20509549333703714, -0.04332458961976994, -0.27990573035696376, -0.0071936334473091165, 0.16845305983468398, 0.07725982357790069, -0.0686939651681274, -0.020228217079580484, -0.1591829015044393, 0.020306044226195048, -0.05852191962792978, 0.057220835699239275, 0.10863038203116138, -0.13130836561322212, -0.06431916077201674, 0.3607014255843811, -0.054641931860165284, -0.2043634353277202, 0.15202615186981447, -0.1921008352451231, -0.1003947329226431, 0.13971535417834643, -0.08089623641693494, 0.2221151355776813, 0.027159820361943036, 0.2745986224668981, -0.21765832240683036, 0.08066733713021276, 0.14244089909102564, 0.016103012564049644, 0.18392982981474762, 0.13411044132906003, 0.10383949582087602, 0.13818952645901794, -0.023354352932873662, 0.002188620904644767, -0.33599055715028076, -0.1808085951974595, -0.11926873900241904, 0.1543449131608173, -0.0925453840953216, -0.19486746122896836, 0.3730437211451827, 0.057928674578011694, 0.14416490861529402, 0.1278577267952202, 0.21590742909932856, 0.004197487954285692, 0.06425678725917261, 0.07447732570529966, 0.16494497485141588, 0.24166803205242524, -0.05118709684421237, -0.05296968476805877, -0.01627444041954292, 0.22373998537659645]
|
1,803.0527
|
Identifying KDM Model of JSP Pages
|
In this report, we propose our approach that identifies a KDM model of JSP
pages. Our approach is based on two main steps. The first one aims to reduce
the problem space by translating JSP pages into Java Servlets where we can use
existing tools to identify a KDM model. The second step aims to complete the
resulting KDM model by identifying dependencies of JSP tags that are not
codified by the translation step.
|
cs.SE
|
in this report we propose our approach that identifies a kdm model of jsp pages our approach is based on two main steps the first one aims to reduce the problem space by translating jsp pages into java servlets where we can use existing tools to identify a kdm model the second step aims to complete the resulting kdm model by identifying dependencies of jsp tags that are not codified by the translation step
|
[['in', 'this', 'report', 'we', 'propose', 'our', 'approach', 'that', 'identifies', 'a', 'kdm', 'model', 'of', 'jsp', 'pages', 'our', 'approach', 'is', 'based', 'on', 'two', 'main', 'steps', 'the', 'first', 'one', 'aims', 'to', 'reduce', 'the', 'problem', 'space', 'by', 'translating', 'jsp', 'pages', 'into', 'java', 'servlets', 'where', 'we', 'can', 'use', 'existing', 'tools', 'to', 'identify', 'a', 'kdm', 'model', 'the', 'second', 'step', 'aims', 'to', 'complete', 'the', 'resulting', 'kdm', 'model', 'by', 'identifying', 'dependencies', 'of', 'jsp', 'tags', 'that', 'are', 'not', 'codified', 'by', 'the', 'translation', 'step']]
|
[-0.07041277973031676, 0.007771127179227266, -0.08123319137942146, 0.04757703708585452, -0.13278844225774142, -0.13195456948282347, 0.09141120734007878, 0.35692696357649323, -0.2698977363824442, -0.35263759572360964, 0.06815172172296238, -0.2790266934001969, -0.16297393312797304, 0.16097039013559855, -0.0864242712803487, 0.03614069054507323, 0.061896637887568086, -0.008745992279334648, -0.0021668480507828092, -0.27391331733481306, 0.3458642469391831, 0.009497484632742565, 0.2808462252991425, 0.026103034716200183, 0.08790312098288858, 0.010350328888995824, -0.08686746960203792, -0.02348739739446083, -0.103118368570191, 0.19987196501539517, 0.2982558704333732, 0.20978777011780925, 0.32315179282749024, -0.40002081173195225, -0.16996533000791395, 0.01831986305203188, 0.12488495895160816, 0.13337232403431995, -0.011378338140422932, -0.30275167821830995, 0.14617055616769437, -0.14746174183548302, -0.011536023900466593, -0.09806959829419046, -0.024209688902152953, -0.027132278371199563, -0.20060122157195331, -0.009724500500974623, 0.11486677387477578, -0.009725614652238987, -0.03044737806398975, -0.08633400603021318, 0.01842627034371568, 0.17903073782076104, 0.026764879737842223, 0.06002806804797335, 0.08662462384263808, -0.07300467041283343, -0.16931401742496402, 0.4145018091878375, -0.06367412410877846, -0.20943617667197376, 0.15342372642968455, -0.014299129192541176, -0.18546602792559644, 0.05851422625316961, 0.20221019546325142, 0.14482660425474514, -0.2153965686794018, 0.03428076219593955, -0.03695879121487205, 0.21885469862939538, 0.0018557457645058733, -0.09558805414299304, 0.15626753940926613, 0.23156112558648898, 0.03316577440882857, 0.19133753528994685, -0.07643434569881474, -0.056454285966685495, -0.30324482338855396, -0.17405802178876223, -0.14395861136270813, -0.047349765679501686, -0.02219270104290666, -0.11881998823200529, 0.42672425110169965, 0.24297575885744616, 0.1920987618237583, 0.08304081772881988, 0.33648756493474485, 0.04372153266622509, 0.07735872808041529, 0.10761245679286485, 0.12968350036975904, -0.012608512370796824, 0.11937802801588299, -0.16316627892012694, 0.08951104023946903, 0.13935232191422098]
|
1,803.05271
|
Gabor Frames: Characterizations and Coarse Structure
|
This survey offers a systematic and streamlined exposition of the most
important characterizations of Gabor frames over a lattice. The goal is to
collect the most important characterizations of Gabor frames and offer a
systematic exposition of these structures. In the center of these
characterizations is the duality theorem for Gabor frames. Most
characterizations within the $L^2$-theory follow directly from this fundamental
duality. In particular, the celebrated characterizations of Janssen and
Ron-Shen are consequences of the duality theorem, and the characterization of
Zeevi and Zibulski for rational lattices also becomes a corollary. The novelty
is the streamlined sequence of proofs, so that most of the structure theory of
Gabor frames fits into a single, short article. The only prerequisite is the
thorough mastery of the Poisson summation formula and some basic facts about
frames and Riesz sequences.
|
math.FA
|
this survey offers a systematic and streamlined exposition of the most important characterizations of gabor frames over a lattice the goal is to collect the most important characterizations of gabor frames and offer a systematic exposition of these structures in the center of these characterizations is the duality theorem for gabor frames most characterizations within the l2theory follow directly from this fundamental duality in particular the celebrated characterizations of janssen and ronshen are consequences of the duality theorem and the characterization of zeevi and zibulski for rational lattices also becomes a corollary the novelty is the streamlined sequence of proofs so that most of the structure theory of gabor frames fits into a single short article the only prerequisite is the thorough mastery of the poisson summation formula and some basic facts about frames and riesz sequences
|
[['this', 'survey', 'offers', 'a', 'systematic', 'and', 'streamlined', 'exposition', 'of', 'the', 'most', 'important', 'characterizations', 'of', 'gabor', 'frames', 'over', 'a', 'lattice', 'the', 'goal', 'is', 'to', 'collect', 'the', 'most', 'important', 'characterizations', 'of', 'gabor', 'frames', 'and', 'offer', 'a', 'systematic', 'exposition', 'of', 'these', 'structures', 'in', 'the', 'center', 'of', 'these', 'characterizations', 'is', 'the', 'duality', 'theorem', 'for', 'gabor', 'frames', 'most', 'characterizations', 'within', 'the', 'l2theory', 'follow', 'directly', 'from', 'this', 'fundamental', 'duality', 'in', 'particular', 'the', 'celebrated', 'characterizations', 'of', 'janssen', 'and', 'ronshen', 'are', 'consequences', 'of', 'the', 'duality', 'theorem', 'and', 'the', 'characterization', 'of', 'zeevi', 'and', 'zibulski', 'for', 'rational', 'lattices', 'also', 'becomes', 'a', 'corollary', 'the', 'novelty', 'is', 'the', 'streamlined', 'sequence', 'of', 'proofs', 'so', 'that', 'most', 'of', 'the', 'structure', 'theory', 'of', 'gabor', 'frames', 'fits', 'into', 'a', 'single', 'short', 'article', 'the', 'only', 'prerequisite', 'is', 'the', 'thorough', 'mastery', 'of', 'the', 'poisson', 'summation', 'formula', 'and', 'some', 'basic', 'facts', 'about', 'frames', 'and', 'riesz', 'sequences']]
|
[-0.09410579725954449, 0.04452864772140268, -0.14323300749974271, 0.10123023012248963, -0.09643187459476073, -0.08772962100749068, 0.027600544299382496, 0.3659881582511041, -0.2882718564086484, -0.20229769840507822, 0.10401828261434704, -0.2726400954895379, -0.17597484825904863, 0.22896772657301934, -0.13521947256488012, 0.013783393860007088, 0.06739270389045808, 0.05534525693270981, -0.10404236750208143, -0.24436823453802123, 0.2947801189010908, 0.05118067804655498, 0.24747912900741487, 0.06011464279179242, 0.07182821601985351, 0.06670200857607757, -0.11083353340440869, -0.051272373451330865, -0.1720378468353374, 0.20134780899046317, 0.28299619163119455, 0.13969592228257918, 0.29454758825116134, -0.37980626330382244, -0.1440512007992605, 0.04964281920590164, 0.09133421134559766, 0.09461549084410174, -0.0564403044511838, -0.27662657499176396, 0.08825621012981762, -0.08985293898919788, -0.1044238307444817, -0.09346266609945279, 0.03820349053250324, 0.04917398443948889, -0.23916687430028105, 0.04217917313058826, 0.202650853419019, 0.1138244337087278, -0.09752778531230219, -0.08431996907764937, 0.0336364783853402, 0.11997066223856938, 0.031709180405253876, 0.020787561189054567, 0.05701751521487227, -0.09095729163313723, -0.09208374060108326, 0.4190138684558299, 0.0002926467260455384, -0.1694885902106762, 0.17057282770538756, -0.1333099316826145, -0.16961031798136367, 0.08756843785950504, 0.10560426104348153, 0.13472440907293382, -0.1639917056330459, 0.07131881581538918, -0.1151764612603823, 0.11836141494945075, 0.14167216115953019, 0.14770224473271382, 0.17798509485745692, 0.14372964420951628, 0.06605995538891019, 0.14747834040249205, -0.020850412352421487, -0.07994394389885094, -0.3763169956338756, -0.2014327285458635, -0.153743381759234, 0.0498171043171383, -0.10477858335252677, -0.15456101160174618, 0.41943129212321606, 0.11763033551259842, 0.16060156186679653, 0.07906349042690743, 0.24432693573522984, 0.054129164665937424, 0.07262429263637922, -0.01055941586759325, 0.17408104251615655, 0.22357603325337336, 0.0696728677404976, -0.06612454399103573, -0.024318654809201902, 0.17212967311634736]
|
1,803.05272
|
Vortex Solution of a Twisted Baby Skyrme Equation
|
We examine non-linear sigma (plus Skyrme term) model in flat space, in
particular with a twist, which comprises a twisted baby Skyrmion vortex
solution with an added dependence on a twist term $mkz$, where $z$ is the
vertical coordinate. We find that the solutions should have asymptotic form. We
also find that mass per unit length of string, $\mu$, increases roughly
linearly with $\zeta$, where $\zeta=4\lambda^2K_s(mk)^2$, $\lambda$ is scaling
constant, $K_s$ is Skyrme term, $m$ is integer and $k$ is wave number.
|
hep-th
|
we examine nonlinear sigma plus skyrme term model in flat space in particular with a twist which comprises a twisted baby skyrmion vortex solution with an added dependence on a twist term mkz where z is the vertical coordinate we find that the solutions should have asymptotic form we also find that mass per unit length of string mu increases roughly linearly with zeta where zeta4lambda2k_smk2 lambda is scaling constant k_s is skyrme term m is integer and k is wave number
|
[['we', 'examine', 'nonlinear', 'sigma', 'plus', 'skyrme', 'term', 'model', 'in', 'flat', 'space', 'in', 'particular', 'with', 'a', 'twist', 'which', 'comprises', 'a', 'twisted', 'baby', 'skyrmion', 'vortex', 'solution', 'with', 'an', 'added', 'dependence', 'on', 'a', 'twist', 'term', 'mkz', 'where', 'z', 'is', 'the', 'vertical', 'coordinate', 'we', 'find', 'that', 'the', 'solutions', 'should', 'have', 'asymptotic', 'form', 'we', 'also', 'find', 'that', 'mass', 'per', 'unit', 'length', 'of', 'string', 'mu', 'increases', 'roughly', 'linearly', 'with', 'zeta', 'where', 'zeta4lambda2k_smk2', 'lambda', 'is', 'scaling', 'constant', 'k_s', 'is', 'skyrme', 'term', 'm', 'is', 'integer', 'and', 'k', 'is', 'wave', 'number']]
|
[-0.22298288945522574, 0.17720776905156932, -0.0458268746101286, 0.04622619600684876, -0.11961802173934785, -0.16636595137440313, -0.010560788067609624, 0.3348073575783659, -0.2340511500283524, -0.25523509275898293, 0.02656842315753485, -0.3107092357872997, -0.11211650150563614, 0.10455029910246347, 0.017198080078046196, -0.017354744348537038, -0.009689397437291013, 0.11697399555303065, -0.06368571872259547, -0.23734635734401735, 0.3290576579187203, 0.0007992803038638315, 0.2026634713128945, 0.008516259790386683, 0.10509987061636315, -0.006091783248623948, 0.012027752953639, 0.03383258800848709, -0.21747959662249663, 0.01608237741517915, 0.1429230526799658, -0.016629365106101756, 0.21931657947047992, -0.37118484431670773, -0.17909341411274157, 0.09412232264416454, 0.16639791011672328, 0.07392602343037495, 0.010434908129815242, -0.16408314865749377, 0.11736483515504702, -0.1890449102875995, -0.16374852033303244, -0.04984885597900476, 0.1272922170371461, 0.030286515450656967, -0.30008798006370113, 0.103146449372066, -0.002556507935586535, 0.004793889452645808, -0.0948000359032763, -0.1527413584889821, -0.0717889174795997, 0.02296509452302147, 0.12165964364482343, 0.17727920418766177, 0.0973368693706522, -0.15059716206181933, -0.047557777150269646, 0.34965487668451706, -0.13602158935441647, -0.27595849792806454, 0.04887924754969132, -0.15596413845771256, -0.1238035066588638, 0.12461598979792109, 0.10262903292306963, 0.09077629899422143, -0.0590158900315011, 0.18940046960761034, -0.11924600945106552, 0.261548587086576, 0.10696848539382588, 0.0149151134321949, 0.20566335533182195, 0.15850088838775309, 0.09079248699888495, 0.16084377099702388, -0.12361696187441272, -0.10303682100349738, -0.3801516697132661, -0.13112192054244656, -0.12522015053732896, 0.10945906537282424, -0.1184111175723417, -0.18600912156434338, 0.3182704429412376, 0.013447607786935052, 0.2192479472253098, 0.08404786179394082, 0.21128385366848956, 0.15164463823362265, 0.13879077448394656, 0.09367041867571296, 0.1779273764954673, 0.11099975868156985, 0.06086913341179168, -0.22671136758462698, -0.05634253338140286, 0.13806817117204637]
|
1,803.05273
|
Self-optimized construction of transition rate matrices from accelerated
atomistic simulations with Bayesian uncertainty quantification
|
A massively parallel method to build large transition rate matrices from
temperature accelerated molecular dynamics trajectories is presented. Bayesian
Markov model analysis is used to estimate the expected residence time in the
known state space, providing crucial uncertainty quantification for higher
scale simulation schemes such as kinetic Monte Carlo or cluster dynamics. The
estimators are additionally used to optimize where exploration is performed and
the degree of temperature ac- celeration on the fly, giving an autonomous,
optimal procedure to explore the state space of complex systems. The method is
tested against exactly solvable models and used to explore the dynamics of C15
interstitial defects in iron. Our uncertainty quantification scheme allows for
accurate modeling of the evolution of these defects over timescales of several
seconds.
|
physics.comp-ph cond-mat.mtrl-sci
|
a massively parallel method to build large transition rate matrices from temperature accelerated molecular dynamics trajectories is presented bayesian markov model analysis is used to estimate the expected residence time in the known state space providing crucial uncertainty quantification for higher scale simulation schemes such as kinetic monte carlo or cluster dynamics the estimators are additionally used to optimize where exploration is performed and the degree of temperature ac celeration on the fly giving an autonomous optimal procedure to explore the state space of complex systems the method is tested against exactly solvable models and used to explore the dynamics of c15 interstitial defects in iron our uncertainty quantification scheme allows for accurate modeling of the evolution of these defects over timescales of several seconds
|
[['a', 'massively', 'parallel', 'method', 'to', 'build', 'large', 'transition', 'rate', 'matrices', 'from', 'temperature', 'accelerated', 'molecular', 'dynamics', 'trajectories', 'is', 'presented', 'bayesian', 'markov', 'model', 'analysis', 'is', 'used', 'to', 'estimate', 'the', 'expected', 'residence', 'time', 'in', 'the', 'known', 'state', 'space', 'providing', 'crucial', 'uncertainty', 'quantification', 'for', 'higher', 'scale', 'simulation', 'schemes', 'such', 'as', 'kinetic', 'monte', 'carlo', 'or', 'cluster', 'dynamics', 'the', 'estimators', 'are', 'additionally', 'used', 'to', 'optimize', 'where', 'exploration', 'is', 'performed', 'and', 'the', 'degree', 'of', 'temperature', 'ac', 'celeration', 'on', 'the', 'fly', 'giving', 'an', 'autonomous', 'optimal', 'procedure', 'to', 'explore', 'the', 'state', 'space', 'of', 'complex', 'systems', 'the', 'method', 'is', 'tested', 'against', 'exactly', 'solvable', 'models', 'and', 'used', 'to', 'explore', 'the', 'dynamics', 'of', 'c15', 'interstitial', 'defects', 'in', 'iron', 'our', 'uncertainty', 'quantification', 'scheme', 'allows', 'for', 'accurate', 'modeling', 'of', 'the', 'evolution', 'of', 'these', 'defects', 'over', 'timescales', 'of', 'several', 'seconds']]
|
[-0.08796078562145046, 0.0956308158132625, -0.07292673752583083, 0.09892080232666264, -0.026844774173843042, -0.11883267452902792, 0.04766135068700438, 0.40672638901178876, -0.28024495697219765, -0.3351239984171585, 0.0926336576512474, -0.2167470665976467, -0.07772244315926782, 0.2305572534903824, 0.01808706697662391, 0.10427779743387815, 0.05573506191402914, 0.0005838252198431761, -0.06346108833508145, -0.23995023518199882, 0.23706102064217352, 0.13011994207045063, 0.30026072488286565, -0.01611900901527054, 0.13249209473348944, -0.010224020562975878, -0.020598894370073874, 0.003729310085257185, -0.15322415369202294, 0.108315218114219, 0.2623553416524667, 0.10773929618223901, 0.26481607718573463, -0.4379084427210112, -0.24443927487628836, 0.12330412830980945, 0.15647874920133262, 0.14458563729591156, -0.002415327288608457, -0.2802080398110012, 0.020277225468758372, -0.1661926485705349, -0.1269635922696081, -0.12678960097705824, -0.016751315523569864, 0.009974405616371623, -0.2698053129870753, 0.09921724451029854, -0.019082127360536928, 0.054634632167753515, -0.055521391956004196, -0.1019380441641495, -0.020500532097949255, 0.13379897567586252, 0.005104029988644705, 0.021933454103888042, 0.17459401947205827, -0.056256330853718665, -0.14202254587754368, 0.3864113760571326, -0.045067157894898686, -0.17489485193284288, 0.1974945538789935, -0.10106174881401521, -0.12537556849495177, 0.1747956618351201, 0.21377063538098046, 0.1521855296506997, -0.1512670549263637, 0.04425287830940027, 0.05639505568861721, 0.19219590664180297, -0.04592411071738048, -0.019381329520500354, 0.1579632929398588, 0.23496762779541314, 0.06611334092374291, 0.12952827166525588, -0.10491325368263549, -0.17481419655227765, -0.2374032728004104, -0.14953342056915356, -0.16459225071969652, 0.010915373648223918, -0.11047401596888742, -0.1740559624177554, 0.35271063435647515, 0.22506192789766036, 0.15375754820378196, 0.04314398660977942, 0.28052066697273403, 0.0900507913170112, 0.029599569262861603, 0.07015188148755941, 0.17939665696523602, 0.12840949846131186, 0.07613355359118883, -0.259730840873559, 0.11178810634808015, 0.06965523626610276]
|
1,803.05274
|
Quasi-projectivity of even Artin groups
|
Even Artin groups generalize right-angled Artin groups by allowing the labels
in the defining graph to be even. In this paper a complete characterization of
quasi-projective even Artin groups is given in terms of their defining graphs.
Also, it is shown that quasi-projective even Artin groups are realizable by
K(pi,1) quasi-projective spaces.
|
math.GT
|
even artin groups generalize rightangled artin groups by allowing the labels in the defining graph to be even in this paper a complete characterization of quasiprojective even artin groups is given in terms of their defining graphs also it is shown that quasiprojective even artin groups are realizable by kpi1 quasiprojective spaces
|
[['even', 'artin', 'groups', 'generalize', 'rightangled', 'artin', 'groups', 'by', 'allowing', 'the', 'labels', 'in', 'the', 'defining', 'graph', 'to', 'be', 'even', 'in', 'this', 'paper', 'a', 'complete', 'characterization', 'of', 'quasiprojective', 'even', 'artin', 'groups', 'is', 'given', 'in', 'terms', 'of', 'their', 'defining', 'graphs', 'also', 'it', 'is', 'shown', 'that', 'quasiprojective', 'even', 'artin', 'groups', 'are', 'realizable', 'by', 'kpi1', 'quasiprojective', 'spaces']]
|
[-0.20020137085856943, 0.0943508996323754, -0.14317047474189445, 0.14581503687972705, -0.11675358259190734, -0.19669848385875902, -0.026347748700153224, 0.42111929004582077, -0.344925098407727, -0.24275038871341026, 0.09839284654858951, -0.17280920265385738, -0.13387440450829813, 0.23898386171696565, -0.27785618562036407, -0.10385299540268114, 0.06407606875738846, 0.08139611830791602, -0.06275985530989531, -0.425357710062459, 0.48169286678043693, -0.08112284630680314, 0.2325633560629705, 0.057629232738131225, 0.005740533887337034, 0.02392226034023154, -0.021820531925186515, 0.04912589021170369, -0.09724917752254651, 0.11419587940550767, 0.5127127124713018, -0.03277451354258049, 0.17801078423284566, -0.351411938524017, -0.15668095780823094, 0.286420020292728, 0.16396923774244407, 0.04818133261198035, -0.057329039089381695, -0.34145431926187414, 0.14188992720133123, -0.1924962354823947, -0.1289803316243566, -0.06742702575866133, 0.09347965292489299, -0.01395860554363865, -0.18091608256173247, -0.03751054069960866, 0.13624310359703556, 0.17868348365076459, -0.023280166868621912, -0.06216427332793291, -0.04977354940134459, 0.14952207203560436, -0.10223743119814362, 0.030931290059995193, 0.09052220805404851, -0.13934791358098245, -0.10058749259377901, 0.4565905538172676, 0.03268957983415861, -0.235866395290941, 0.08765616155086228, -0.215543323286021, -0.17414535643855253, 0.14225318230903491, 0.03481543166204714, 0.15900152463179368, -0.0037218374558366262, 0.1995060326030048, -0.1944373450600184, 0.055969540101404376, 0.1427138282183128, -0.05488119724815568, 0.08271355584908563, 0.11211602880547826, 0.12537921726023063, 0.1423873402908122, 0.1565059214257277, 0.11025586937075087, -0.3027545197938497, -0.1878085762548905, -0.10127683802364537, 0.13377147787608779, -0.15841267216735735, -0.16649168998600755, 0.4093169611520492, 0.05909630405501677, 0.08255133675769545, 0.20949885815095443, 0.19621131619295248, -0.03372870908620266, 0.05825616849604277, 0.07174029768122217, 0.07001247642060313, 0.2606395236664237, -0.15952643637473768, -0.02292977678231322, 0.07246768332641715, 0.20507706323853478]
|
1,803.05275
|
Biogeographical network analysis of plant species distribution in the
Mediterranean region
|
The delimitation of bioregions helps to understand historical and ecological
drivers of species distribution. In this work, we performed a network analysis
of the spatial distribution patterns of plants in south of France
(Languedoc-Roussillon and Provence-Alpes-C\^ote d'Azur) to analyze the
biogeographical structure of the French Mediterranean flora at different
scales. We used a network approach to identify and characterize biogeographical
regions, based on a large database containing 2.5 million of geolocalized plant
records corresponding to more than 3500 plant species. This methodology is
performed following five steps, from the biogeographical bipartite network
construction, to the identification of biogeographical regions under the form
of spatial network communities, the analysis of their interactions and the
identification of clusters of plant species based on the species contribution
to the biogeographical regions. First, we identified two sub-networks that
distinguish Mediterranean and temperate biota. Then, we separated eight
statistically significant bioregions that present a complex spatial structure.
Some of them are spatially well delimited, and match with particular geological
entities. On the other hand fuzzy transitions arise between adjacent bioregions
that share a common geological setting, but are spread along a climatic
gradient. The proposed network approach illustrates the biogeographical
structure of the flora in southern France, and provides precise insights into
the relationships between bioregions. This approach sheds light on ecological
drivers shaping the distribution of Mediterranean biota: the interplay between
a climatic gradient and geological substrate shapes biodiversity patterns.
Finally this work exemplifies why fragmented distributions are common in the
Mediterranean region, isolating groups of species that share a similar
eco-evolutionary history.
|
q-bio.PE q-bio.QM
|
the delimitation of bioregions helps to understand historical and ecological drivers of species distribution in this work we performed a network analysis of the spatial distribution patterns of plants in south of france languedocroussillon and provencealpescote dazur to analyze the biogeographical structure of the french mediterranean flora at different scales we used a network approach to identify and characterize biogeographical regions based on a large database containing 25 million of geolocalized plant records corresponding to more than 3500 plant species this methodology is performed following five steps from the biogeographical bipartite network construction to the identification of biogeographical regions under the form of spatial network communities the analysis of their interactions and the identification of clusters of plant species based on the species contribution to the biogeographical regions first we identified two subnetworks that distinguish mediterranean and temperate biota then we separated eight statistically significant bioregions that present a complex spatial structure some of them are spatially well delimited and match with particular geological entities on the other hand fuzzy transitions arise between adjacent bioregions that share a common geological setting but are spread along a climatic gradient the proposed network approach illustrates the biogeographical structure of the flora in southern france and provides precise insights into the relationships between bioregions this approach sheds light on ecological drivers shaping the distribution of mediterranean biota the interplay between a climatic gradient and geological substrate shapes biodiversity patterns finally this work exemplifies why fragmented distributions are common in the mediterranean region isolating groups of species that share a similar ecoevolutionary history
|
[['the', 'delimitation', 'of', 'bioregions', 'helps', 'to', 'understand', 'historical', 'and', 'ecological', 'drivers', 'of', 'species', 'distribution', 'in', 'this', 'work', 'we', 'performed', 'a', 'network', 'analysis', 'of', 'the', 'spatial', 'distribution', 'patterns', 'of', 'plants', 'in', 'south', 'of', 'france', 'languedocroussillon', 'and', 'provencealpescote', 'dazur', 'to', 'analyze', 'the', 'biogeographical', 'structure', 'of', 'the', 'french', 'mediterranean', 'flora', 'at', 'different', 'scales', 'we', 'used', 'a', 'network', 'approach', 'to', 'identify', 'and', 'characterize', 'biogeographical', 'regions', 'based', 'on', 'a', 'large', 'database', 'containing', '25', 'million', 'of', 'geolocalized', 'plant', 'records', 'corresponding', 'to', 'more', 'than', '3500', 'plant', 'species', 'this', 'methodology', 'is', 'performed', 'following', 'five', 'steps', 'from', 'the', 'biogeographical', 'bipartite', 'network', 'construction', 'to', 'the', 'identification', 'of', 'biogeographical', 'regions', 'under', 'the', 'form', 'of', 'spatial', 'network', 'communities', 'the', 'analysis', 'of', 'their', 'interactions', 'and', 'the', 'identification', 'of', 'clusters', 'of', 'plant', 'species', 'based', 'on', 'the', 'species', 'contribution', 'to', 'the', 'biogeographical', 'regions', 'first', 'we', 'identified', 'two', 'subnetworks', 'that', 'distinguish', 'mediterranean', 'and', 'temperate', 'biota', 'then', 'we', 'separated', 'eight', 'statistically', 'significant', 'bioregions', 'that', 'present', 'a', 'complex', 'spatial', 'structure', 'some', 'of', 'them', 'are', 'spatially', 'well', 'delimited', 'and', 'match', 'with', 'particular', 'geological', 'entities', 'on', 'the', 'other', 'hand', 'fuzzy', 'transitions', 'arise', 'between', 'adjacent', 'bioregions', 'that', 'share', 'a', 'common', 'geological', 'setting', 'but', 'are', 'spread', 'along', 'a', 'climatic', 'gradient', 'the', 'proposed', 'network', 'approach', 'illustrates', 'the', 'biogeographical', 'structure', 'of', 'the', 'flora', 'in', 'southern', 'france', 'and', 'provides', 'precise', 'insights', 'into', 'the', 'relationships', 'between', 'bioregions', 'this', 'approach', 'sheds', 'light', 'on', 'ecological', 'drivers', 'shaping', 'the', 'distribution', 'of', 'mediterranean', 'biota', 'the', 'interplay', 'between', 'a', 'climatic', 'gradient', 'and', 'geological', 'substrate', 'shapes', 'biodiversity', 'patterns', 'finally', 'this', 'work', 'exemplifies', 'why', 'fragmented', 'distributions', 'are', 'common', 'in', 'the', 'mediterranean', 'region', 'isolating', 'groups', 'of', 'species', 'that', 'share', 'a', 'similar', 'ecoevolutionary', 'history']]
|
[-0.09521996330946379, 0.09432496209058128, -0.10172489162009928, 0.10259847689269597, -0.053816996291026126, -0.0775344715702709, 0.048907008735057156, 0.3566075662433637, -0.23647817562095066, -0.31688587136697094, 0.08140054413439989, -0.3011584865791788, -0.18931190464382897, 0.1407313489514595, -0.05979481829633367, -0.05400954271555273, 0.05726702736802979, -0.025203490733071175, 0.029792787388496188, -0.2212092172225814, 0.3157005492028878, 0.04426572063633382, 0.31617016876277204, 0.016675064456875614, 0.1217092912741991, -0.07390113585132105, -0.08821124858893309, -0.013735408328042332, -0.11240609668221067, 0.1815284234043555, 0.28384987539274287, 0.18533459939434038, 0.2607838994531678, -0.4340352791176696, -0.21570044223799875, 0.1129152904978522, 0.12398884022709866, 0.04893688648279597, 0.009843883025521097, -0.2994386721873504, 0.02305456566903378, -0.13725246716895892, -0.11620394307177818, -0.005318343726345537, 0.00501678809922203, 0.02553036870844372, -0.21183066070600728, 0.08414689713718954, 0.0010799127911735717, 0.1408029837381631, -0.06081292364141154, -0.14574428794351552, -0.07646360083760383, 0.22316106707437494, 0.03235383192711448, -0.03877619962689941, 0.16377193079935207, -0.08886336231448394, -0.05302942159032116, 0.34729290021590686, -0.01377292277509073, -0.11619493340826974, 0.24286285179697978, -0.16196196396193732, -0.1771839064716249, 0.08934556006305354, 0.22742226112594083, 0.07671107777307383, -0.213180104281732, -0.02669231263116176, -0.06283310474646694, 0.15829310089291765, 0.11013519482035733, 0.002364674307213886, 0.23220112319883496, 0.23114492778543108, 0.07432899730649671, 0.11608812705806641, -0.14769429488187738, -0.14449965717010055, -0.21518390297260975, -0.10243408317989779, -0.0853688613980907, -0.03963797188595894, -0.09203383666445077, -0.15518695346246464, 0.45173136058901275, 0.14849742024195658, 0.19078803818730877, 0.004192965723037836, 0.26159907119341397, -0.06266908781763333, 0.06703846555489482, 0.048091575697223846, 0.15999584349204338, 0.09559512348276661, 0.12223633313152925, -0.20139986375828747, 0.13136914971869815, 0.007732102243367452]
|
1,803.05276
|
Existence of bound and ground states for fractional coupled systems in
$\mathbb{R}^{N}$
|
In this work we consider the following class of nonlocal linearly coupled
systems involving Schr\"{o}dinger equations with fractional laplacian $$
\left\{ \begin{array}{lr} (-\Delta)^{s_{1}} u+V_{1}(x)u=f_{1}(u)+\lambda(x)v, &
x\in\mathbb{R}^{N}, (-\Delta)^{s_{2}} v+V_{2}(x)v=f_{2}(v)+\lambda(x)u, &
x\in\mathbb{R}^{N}, \end{array} \right. $$ where $(-\Delta)^{s}$ denotes de
fractional Laplacian, $s_{1},s_{2}\in(0,1)$ and $N\geq2$. The coupling function
$\lambda:\mathbb{R}^{N} \rightarrow \mathbb{R}$ is related with the potentials
by $|\lambda(x)|\leq \delta\sqrt{V_{1}(x)V_{2}(x)}$, for some $\delta\in(0,1)$.
We deal with periodic and asymptotically periodic bounded potentials. On the
nonlinear terms $f_{1}$ and $f_{2}$, we assume "superlinear" at infinity and at
the origin. We use a variational approach to obtain the existence of bound and
ground states without assuming the well known Ambrosetti-Rabinowitz condition
at infinity. Moreover, we give a description of the ground states when the
coupling function goes to zero.
|
math.AP
|
in this work we consider the following class of nonlocal linearly coupled systems involving schrodinger equations with fractional laplacian left beginarraylr deltas_1 uv_1xuf_1ulambdaxv xinmathbbrn deltas_2 vv_2xvf_2vlambdaxu xinmathbbrn endarray right where deltas denotes de fractional laplacian s_1s_2in01 and ngeq2 the coupling function lambdamathbbrn rightarrow mathbbr is related with the potentials by lambdaxleq deltasqrtv_1xv_2x for some deltain01 we deal with periodic and asymptotically periodic bounded potentials on the nonlinear terms f_1 and f_2 we assume superlinear at infinity and at the origin we use a variational approach to obtain the existence of bound and ground states without assuming the well known ambrosettirabinowitz condition at infinity moreover we give a description of the ground states when the coupling function goes to zero
|
[['in', 'this', 'work', 'we', 'consider', 'the', 'following', 'class', 'of', 'nonlocal', 'linearly', 'coupled', 'systems', 'involving', 'schrodinger', 'equations', 'with', 'fractional', 'laplacian', 'left', 'beginarraylr', 'deltas_1', 'uv_1xuf_1ulambdaxv', 'xinmathbbrn', 'deltas_2', 'vv_2xvf_2vlambdaxu', 'xinmathbbrn', 'endarray', 'right', 'where', 'deltas', 'denotes', 'de', 'fractional', 'laplacian', 's_1s_2in01', 'and', 'ngeq2', 'the', 'coupling', 'function', 'lambdamathbbrn', 'rightarrow', 'mathbbr', 'is', 'related', 'with', 'the', 'potentials', 'by', 'lambdaxleq', 'deltasqrtv_1xv_2x', 'for', 'some', 'deltain01', 'we', 'deal', 'with', 'periodic', 'and', 'asymptotically', 'periodic', 'bounded', 'potentials', 'on', 'the', 'nonlinear', 'terms', 'f_1', 'and', 'f_2', 'we', 'assume', 'superlinear', 'at', 'infinity', 'and', 'at', 'the', 'origin', 'we', 'use', 'a', 'variational', 'approach', 'to', 'obtain', 'the', 'existence', 'of', 'bound', 'and', 'ground', 'states', 'without', 'assuming', 'the', 'well', 'known', 'ambrosettirabinowitz', 'condition', 'at', 'infinity', 'moreover', 'we', 'give', 'a', 'description', 'of', 'the', 'ground', 'states', 'when', 'the', 'coupling', 'function', 'goes', 'to', 'zero']]
|
[-0.14767442701850086, 0.10048410565858441, 0.00793581416447913, 0.030870209595637528, -0.0747619135779262, -0.19485973559286712, -0.02034506222116761, 0.3040728880608055, -0.2928921619396923, -0.19288906455039978, 0.1112498601401707, -0.3789475407601068, -0.12138420037782842, 0.11194499979111631, -0.010771490949472147, 0.08828962848513454, 0.007868700195103884, 0.09515108663721808, -0.05420299440655591, -0.17533223193355038, 0.3791752247738519, -0.10734378711120891, 0.18543261329510383, 0.07149377044489873, 0.10489397766754596, -0.0016076822482448602, 0.07890560837352366, -0.06619552386525486, -0.2365756489037137, 0.030382376281652666, 0.18238900202725614, 0.03413167053284789, 0.3103034646067369, -0.43719160092795, -0.16255568548720994, 0.18245116070050113, 0.14701512418105267, 0.03247215220471844, 0.002851320608377656, -0.3396168601216881, 0.09423108256929222, -0.08319552782008291, -0.21459592288010754, -0.05093881504061366, 0.02249641006762561, 0.05750531786179636, -0.35875398034945, 0.12977877574407362, 0.0810139461131517, -0.00023189400755135075, -0.12369373371724837, -0.1458714306645561, -0.011142304082958228, 0.04191527570037579, 0.027274905334966855, 0.07156896866009836, -0.00258473474033443, -0.09512702716165222, -0.06337460588630554, 0.32886236951786224, -0.1413800977378352, -0.2958575159011941, 0.14723724998891288, -0.18467971309603723, -0.11760553495592571, 0.04254125972095478, 0.12885751301031892, 0.1787696019871094, -0.0678764560212325, 0.21919668137135367, -0.021038672716323554, 0.12908108109591662, 0.13485602017733203, 0.03728209827594193, 0.06385524956359794, 0.0825355624401709, 0.16073560310594207, 0.1333974704432746, -0.0100768687531984, -0.07176198775206492, -0.36147467233240604, -0.10522701235822751, -0.17645576094011112, 0.15036155429398995, -0.058113233102501126, -0.1852968010519232, 0.36428411468763705, 0.07052815226364016, 0.19593382530313516, 0.12036230851455391, 0.2015268432816291, 0.20300747675355524, -0.027314682183454612, 0.09675549190848999, 0.13484554746459512, 0.16362629514229152, 0.11200706632059466, -0.2493205723356888, -0.014134162372751493, 0.09612559016217606]
|
1,803.05277
|
Constant delay algorithms for regular document spanners
|
Regular expressions and automata models with capture variables are core tools
in rule-based information extraction. These formalisms, also called regular
document spanners, use regular languages in order to locate the data that a
user wants to extract from a text document, and then store this data into
variables. Since document spanners can easily generate large outputs, it is
important to have good evaluation algorithms that can generate the extracted
data in a quick succession, and with relatively little precomputation time.
Towards this goal, we present a practical evaluation algorithm that allows
constant delay enumeration of a spanner's output after a precomputation phase
that is linear in the document. While the algorithm assumes that the spanner is
specified in a syntactic variant of variable set automata, we also study how it
can be applied when the spanner is specified by general variable set automata,
regex formulas, or spanner algebras. Finally, we study the related problem of
counting the number of outputs of a document spanner, providing a fine grained
analysis of the classes of document spanners that support efficient enumeration
of their results.
|
cs.DB cs.FL
|
regular expressions and automata models with capture variables are core tools in rulebased information extraction these formalisms also called regular document spanners use regular languages in order to locate the data that a user wants to extract from a text document and then store this data into variables since document spanners can easily generate large outputs it is important to have good evaluation algorithms that can generate the extracted data in a quick succession and with relatively little precomputation time towards this goal we present a practical evaluation algorithm that allows constant delay enumeration of a spanners output after a precomputation phase that is linear in the document while the algorithm assumes that the spanner is specified in a syntactic variant of variable set automata we also study how it can be applied when the spanner is specified by general variable set automata regex formulas or spanner algebras finally we study the related problem of counting the number of outputs of a document spanner providing a fine grained analysis of the classes of document spanners that support efficient enumeration of their results
|
[['regular', 'expressions', 'and', 'automata', 'models', 'with', 'capture', 'variables', 'are', 'core', 'tools', 'in', 'rulebased', 'information', 'extraction', 'these', 'formalisms', 'also', 'called', 'regular', 'document', 'spanners', 'use', 'regular', 'languages', 'in', 'order', 'to', 'locate', 'the', 'data', 'that', 'a', 'user', 'wants', 'to', 'extract', 'from', 'a', 'text', 'document', 'and', 'then', 'store', 'this', 'data', 'into', 'variables', 'since', 'document', 'spanners', 'can', 'easily', 'generate', 'large', 'outputs', 'it', 'is', 'important', 'to', 'have', 'good', 'evaluation', 'algorithms', 'that', 'can', 'generate', 'the', 'extracted', 'data', 'in', 'a', 'quick', 'succession', 'and', 'with', 'relatively', 'little', 'precomputation', 'time', 'towards', 'this', 'goal', 'we', 'present', 'a', 'practical', 'evaluation', 'algorithm', 'that', 'allows', 'constant', 'delay', 'enumeration', 'of', 'a', 'spanners', 'output', 'after', 'a', 'precomputation', 'phase', 'that', 'is', 'linear', 'in', 'the', 'document', 'while', 'the', 'algorithm', 'assumes', 'that', 'the', 'spanner', 'is', 'specified', 'in', 'a', 'syntactic', 'variant', 'of', 'variable', 'set', 'automata', 'we', 'also', 'study', 'how', 'it', 'can', 'be', 'applied', 'when', 'the', 'spanner', 'is', 'specified', 'by', 'general', 'variable', 'set', 'automata', 'regex', 'formulas', 'or', 'spanner', 'algebras', 'finally', 'we', 'study', 'the', 'related', 'problem', 'of', 'counting', 'the', 'number', 'of', 'outputs', 'of', 'a', 'document', 'spanner', 'providing', 'a', 'fine', 'grained', 'analysis', 'of', 'the', 'classes', 'of', 'document', 'spanners', 'that', 'support', 'efficient', 'enumeration', 'of', 'their', 'results']]
|
[-0.08920902648555017, 0.06201529704484638, -0.07774558674370112, 0.10606168121595837, -0.15551691070444637, -0.17858049993219038, 0.10454153694637161, 0.4195075889148719, -0.3016504451663203, -0.3244415358333224, 0.0944874447426288, -0.278195191132609, -0.1511543733905745, 0.171916688555739, -0.1174692313964812, 0.0749348106616238, 0.13067588841563071, 0.06315651676453814, -0.03232749446505005, -0.2815298019565519, 0.2892298591220854, 0.04717160941096493, 0.26051497762347314, 0.012249468068418267, 0.09274226114611847, -0.011864861020572728, -0.07449968990736774, 0.04057891948140933, -0.10821277285076276, 0.13439049107050727, 0.3576257007568859, 0.2375336303785034, 0.25041605653445964, -0.3982781947892323, -0.13716947178453576, 0.10951720358251216, 0.139122127585374, 0.14171304162156736, -0.010702425165608485, -0.24162078337682472, 0.10022647297879743, -0.14636286031352458, -0.009615999498087299, -0.1412286675166707, 0.06204295198300055, 0.01876264421562255, -0.2516407212914111, -0.033310122087221734, 0.11345910155188783, 0.027425804124264926, 0.0015095843249742598, -0.08108536791181765, 0.02683325463926399, 0.12248854328712556, -0.021982518009391133, 0.08118410997801451, 0.0837031911833437, -0.10395011388131284, -0.16096301758815382, 0.39872264655327405, -0.029706361123736806, -0.21358382461879116, 0.13030170799222784, -0.058273179413095774, -0.19130897618303136, 0.14012648168296277, 0.20371037838816808, 0.11831336440633634, -0.1484421495458394, 0.06928213972471664, -0.06922146775452727, 0.23116187596243326, 0.10585935030818232, 0.025745036028348586, 0.15795624014092507, 0.19069276780534822, 0.05580218536088468, 0.16937861768695125, -0.010183739594719885, -0.052664195567978404, -0.2767258980004424, -0.1202273889787618, -0.18274224294313732, -0.024784613589392872, -0.13997353290204165, -0.21997903953152861, 0.4261663353664207, 0.19791857332661544, 0.18374252624510387, 0.14609830749443742, 0.3062068867103125, 0.05968866984319622, 0.08470094150538648, 0.11608813406840725, 0.08322724176616828, 0.0625945242796001, 0.10035894131211175, -0.11680501249105833, 0.1135038541128429, 0.09955399569154687]
|
1,803.05278
|
Secure SWIPT for Directional Modulation Aided AF Relaying Networks
|
Secure wireless information and power transfer based on directional
modulation is conceived for amplify-and-forward (AF) relaying networks.
Explicitly, we first formulate a secrecy rate maximization (SRM) problem, which
can be decomposed into a twin-level optimization problem and solved by a
one-dimensional (1D) search and semidefinite relaxation (SDR) technique. Then
in order to reduce the search complexity, we formulate an optimization problem
based on maximizing the signal-to-leakage-AN-noise-ratio (Max-SLANR) criterion,
and transform it into a SDR problem. Additionally, the relaxation is proved to
be tight according to the classic Karush-Kuhn-Tucker (KKT) conditions. Finally,
to reduce the computational complexity, a successive convex approximation (SCA)
scheme is proposed to find a near-optimal solution. The complexity of the SCA
scheme is much lower than that of the SRM and the Max-SLANR schemes. Simulation
results demonstrate that the performance of the SCA scheme is very close to
that of the SRM scheme in terms of its secrecy rate and bit error rate (BER),
but much better than that of the zero forcing (ZF) scheme.
|
cs.IT math.IT
|
secure wireless information and power transfer based on directional modulation is conceived for amplifyandforward af relaying networks explicitly we first formulate a secrecy rate maximization srm problem which can be decomposed into a twinlevel optimization problem and solved by a onedimensional 1d search and semidefinite relaxation sdr technique then in order to reduce the search complexity we formulate an optimization problem based on maximizing the signaltoleakageannoiseratio maxslanr criterion and transform it into a sdr problem additionally the relaxation is proved to be tight according to the classic karushkuhntucker kkt conditions finally to reduce the computational complexity a successive convex approximation sca scheme is proposed to find a nearoptimal solution the complexity of the sca scheme is much lower than that of the srm and the maxslanr schemes simulation results demonstrate that the performance of the sca scheme is very close to that of the srm scheme in terms of its secrecy rate and bit error rate ber but much better than that of the zero forcing zf scheme
|
[['secure', 'wireless', 'information', 'and', 'power', 'transfer', 'based', 'on', 'directional', 'modulation', 'is', 'conceived', 'for', 'amplifyandforward', 'af', 'relaying', 'networks', 'explicitly', 'we', 'first', 'formulate', 'a', 'secrecy', 'rate', 'maximization', 'srm', 'problem', 'which', 'can', 'be', 'decomposed', 'into', 'a', 'twinlevel', 'optimization', 'problem', 'and', 'solved', 'by', 'a', 'onedimensional', '1d', 'search', 'and', 'semidefinite', 'relaxation', 'sdr', 'technique', 'then', 'in', 'order', 'to', 'reduce', 'the', 'search', 'complexity', 'we', 'formulate', 'an', 'optimization', 'problem', 'based', 'on', 'maximizing', 'the', 'signaltoleakageannoiseratio', 'maxslanr', 'criterion', 'and', 'transform', 'it', 'into', 'a', 'sdr', 'problem', 'additionally', 'the', 'relaxation', 'is', 'proved', 'to', 'be', 'tight', 'according', 'to', 'the', 'classic', 'karushkuhntucker', 'kkt', 'conditions', 'finally', 'to', 'reduce', 'the', 'computational', 'complexity', 'a', 'successive', 'convex', 'approximation', 'sca', 'scheme', 'is', 'proposed', 'to', 'find', 'a', 'nearoptimal', 'solution', 'the', 'complexity', 'of', 'the', 'sca', 'scheme', 'is', 'much', 'lower', 'than', 'that', 'of', 'the', 'srm', 'and', 'the', 'maxslanr', 'schemes', 'simulation', 'results', 'demonstrate', 'that', 'the', 'performance', 'of', 'the', 'sca', 'scheme', 'is', 'very', 'close', 'to', 'that', 'of', 'the', 'srm', 'scheme', 'in', 'terms', 'of', 'its', 'secrecy', 'rate', 'and', 'bit', 'error', 'rate', 'ber', 'but', 'much', 'better', 'than', 'that', 'of', 'the', 'zero', 'forcing', 'zf', 'scheme']]
|
[-0.16765813972437527, -0.055491809953886466, -0.09640268727330627, 0.08553758955336312, -0.06056896865044198, -0.2207812056905113, 0.12352712564283937, 0.3513416383847049, -0.32100186356138893, -0.25478662306261135, 0.1417847500230958, -0.20024541682541008, -0.19389657732156082, 0.20468106759689386, -0.0889102870260547, 0.089832613587865, 0.025684985207257476, 0.011868614033318875, -0.10716138434846227, -0.3210359860847636, 0.24149996077744063, 0.12369648811248381, 0.35481835411799073, 0.05464462125560314, 0.11201785001104304, -0.005651250989147939, 0.04259226274699336, 0.021762549883865952, -0.12595327407005952, 0.10014701995036066, 0.2919593908605393, 0.22809569673362848, 0.3122096639098145, -0.38801464214125964, -0.21946088468837666, 0.08470723317033134, 0.1555415074789624, 0.07730602939604646, -0.019116113344264194, -0.22532527341802672, 0.16297956762222074, -0.17489837775029604, 0.016266176384794186, -0.02927750808885321, -0.07517106045696248, 0.0064709952332522355, -0.37900832968355136, 0.0495735580078894, 0.05679884150896857, -0.021849358012820255, -0.07582824297246478, -0.11930034692802398, 0.055896249250508845, 0.05572974539600403, 0.049852394724616826, 0.058238953934760945, 0.07831827415403252, -0.04398597691707858, -0.12572983480889136, 0.37881117128975944, -0.03667186275206183, -0.26399090577189516, 0.14683348518972308, -0.05169222811975221, -0.05800846123375089, 0.22033465298733151, 0.23632824455569612, 0.13737098376902684, -0.16488567631260106, 0.031339143332599365, -0.042901890889014596, 0.20761235555894417, 0.04871381623329731, 0.07061328662965069, 0.08137376401885753, 0.19531677524195756, 0.21496248249782296, 0.18166600675719632, -0.08351136280703586, -0.13391384504531034, -0.1946084160732514, -0.15553474858816338, -0.23453032283294128, 0.009669975484096696, -0.10744722836836179, -0.062618282987032, 0.3536379517353253, 0.1253271518905488, 0.11824291841433633, 0.15535390228047263, 0.40846086193512127, 0.19174752149464017, 0.021168851063632203, 0.1282207712633308, 0.21973562349065592, 0.13055182099853438, 0.06691127996352252, -0.300142009742558, 0.05066867678272879, 0.11855655642816933]
|
1,803.05279
|
Sparse Sampling of Water Density Fluctuations near Liquid-Vapor
Coexistence
|
The free energetics of water density fluctuations in bulk water, at
interfaces, and in hydrophobic confinement inform the hydration of hydrophobic
solutes as well as their interactions and assembly. The characterization of
such free energetics is typically performed using enhanced sampling techniques
such as umbrella sampling. In umbrella sampling, order parameter distributions
obtained from adjacent biased simulations must overlap in order to estimate
free energy differences between biased ensembles. Many biased simulations are
typically required to ensure such overlap, which exacts a steep computational
cost. We recently introduced a sparse sampling method, which circumvents the
overlap requirement by using thermodynamic integration to estimate free energy
differences between biased ensembles. Here we build upon and generalize sparse
sampling for characterizing the free energetics of water density fluctuations
in systems near liquid-vapor coexistence. We also introduce sensible heuristics
for choosing the biasing potential parameters and strategies for adaptively
refining them, which facilitate the estimation of such free energetics
accurately and efficiently. We illustrate the method by characterizing the free
energetics of cavitation in a large volume in bulk water. We also use sparse
sampling to characterize the free energetics of capillary evaporation for water
confined between two hydrophobic plates. In both cases, sparse sampling is
nearly two orders of magnitude faster than umbrella sampling. Given its
efficiency, the sparse sampling method is particularly well suited for
characterizing free energy landscapes for systems wherein umbrella sampling is
prohibitively expensive.
|
cond-mat.stat-mech cond-mat.soft
|
the free energetics of water density fluctuations in bulk water at interfaces and in hydrophobic confinement inform the hydration of hydrophobic solutes as well as their interactions and assembly the characterization of such free energetics is typically performed using enhanced sampling techniques such as umbrella sampling in umbrella sampling order parameter distributions obtained from adjacent biased simulations must overlap in order to estimate free energy differences between biased ensembles many biased simulations are typically required to ensure such overlap which exacts a steep computational cost we recently introduced a sparse sampling method which circumvents the overlap requirement by using thermodynamic integration to estimate free energy differences between biased ensembles here we build upon and generalize sparse sampling for characterizing the free energetics of water density fluctuations in systems near liquidvapor coexistence we also introduce sensible heuristics for choosing the biasing potential parameters and strategies for adaptively refining them which facilitate the estimation of such free energetics accurately and efficiently we illustrate the method by characterizing the free energetics of cavitation in a large volume in bulk water we also use sparse sampling to characterize the free energetics of capillary evaporation for water confined between two hydrophobic plates in both cases sparse sampling is nearly two orders of magnitude faster than umbrella sampling given its efficiency the sparse sampling method is particularly well suited for characterizing free energy landscapes for systems wherein umbrella sampling is prohibitively expensive
|
[['the', 'free', 'energetics', 'of', 'water', 'density', 'fluctuations', 'in', 'bulk', 'water', 'at', 'interfaces', 'and', 'in', 'hydrophobic', 'confinement', 'inform', 'the', 'hydration', 'of', 'hydrophobic', 'solutes', 'as', 'well', 'as', 'their', 'interactions', 'and', 'assembly', 'the', 'characterization', 'of', 'such', 'free', 'energetics', 'is', 'typically', 'performed', 'using', 'enhanced', 'sampling', 'techniques', 'such', 'as', 'umbrella', 'sampling', 'in', 'umbrella', 'sampling', 'order', 'parameter', 'distributions', 'obtained', 'from', 'adjacent', 'biased', 'simulations', 'must', 'overlap', 'in', 'order', 'to', 'estimate', 'free', 'energy', 'differences', 'between', 'biased', 'ensembles', 'many', 'biased', 'simulations', 'are', 'typically', 'required', 'to', 'ensure', 'such', 'overlap', 'which', 'exacts', 'a', 'steep', 'computational', 'cost', 'we', 'recently', 'introduced', 'a', 'sparse', 'sampling', 'method', 'which', 'circumvents', 'the', 'overlap', 'requirement', 'by', 'using', 'thermodynamic', 'integration', 'to', 'estimate', 'free', 'energy', 'differences', 'between', 'biased', 'ensembles', 'here', 'we', 'build', 'upon', 'and', 'generalize', 'sparse', 'sampling', 'for', 'characterizing', 'the', 'free', 'energetics', 'of', 'water', 'density', 'fluctuations', 'in', 'systems', 'near', 'liquidvapor', 'coexistence', 'we', 'also', 'introduce', 'sensible', 'heuristics', 'for', 'choosing', 'the', 'biasing', 'potential', 'parameters', 'and', 'strategies', 'for', 'adaptively', 'refining', 'them', 'which', 'facilitate', 'the', 'estimation', 'of', 'such', 'free', 'energetics', 'accurately', 'and', 'efficiently', 'we', 'illustrate', 'the', 'method', 'by', 'characterizing', 'the', 'free', 'energetics', 'of', 'cavitation', 'in', 'a', 'large', 'volume', 'in', 'bulk', 'water', 'we', 'also', 'use', 'sparse', 'sampling', 'to', 'characterize', 'the', 'free', 'energetics', 'of', 'capillary', 'evaporation', 'for', 'water', 'confined', 'between', 'two', 'hydrophobic', 'plates', 'in', 'both', 'cases', 'sparse', 'sampling', 'is', 'nearly', 'two', 'orders', 'of', 'magnitude', 'faster', 'than', 'umbrella', 'sampling', 'given', 'its', 'efficiency', 'the', 'sparse', 'sampling', 'method', 'is', 'particularly', 'well', 'suited', 'for', 'characterizing', 'free', 'energy', 'landscapes', 'for', 'systems', 'wherein', 'umbrella', 'sampling', 'is', 'prohibitively', 'expensive']]
|
[-0.05962745533906855, 0.17721002611580258, -0.06314152936866484, 0.12652991232176122, -0.014261384565635757, -0.10947368960133043, 0.07328704548249873, 0.4321202709955179, -0.27142927484286916, -0.3564294381382859, 0.08122155083080959, -0.22182814330572925, -0.12176364048540009, 0.16324859661428984, -0.043678004742536886, 0.07661923597062646, 0.060416549925645026, -0.05542805089252228, -0.08065412937731568, -0.18806057613070706, 0.24330056150654977, 0.10372066254317129, 0.2900057925390853, 0.04302557603400832, 0.07444181928896519, 0.034015593042013126, -0.03612464849720709, 0.04525142820642232, -0.20336634939599593, 0.1327123810000465, 0.2595634871691276, 0.039684363869729185, 0.29738372963926185, -0.422996150819048, -0.24733092227429784, 0.1154139599204458, 0.13990484041722206, 0.1115449931515949, -0.04760560581176463, -0.21975147562354044, 0.028944292474711725, -0.14983433161140025, -0.1129090448819748, -0.09645081371941083, -0.05900220782101407, 0.08543468298049155, -0.2785518826024954, 0.11592121633589544, -0.023555744150298315, 0.0431391451847187, -0.04604872808470075, -0.13295885916972944, -0.042141259732750895, 0.1343344254369879, 0.026464731250968525, -0.02066004605987504, 0.20192622578055677, -0.12605841659918088, -0.0607209325732537, 0.37883408149836045, -0.013010209473947525, -0.22753751392069793, 0.2475606684969596, -0.10585934042751047, -0.12835009377528678, 0.20712949960666188, 0.13615636923350394, 0.10017294235235491, -0.1468658149518641, 0.029018975485765406, 0.060274341632020105, 0.1355060751498598, 0.1122942612357477, 0.0066309216929504936, 0.1896703222044349, 0.19787235142884113, 0.12011225748993654, 0.14295228246093325, -0.11222463898408577, -0.14149773050414327, -0.2291058848199624, -0.15398480750371749, -0.2449328743574462, 0.003939430474035315, -0.10950064654401612, -0.2067548914346844, 0.33688182723945226, 0.17667791914782818, 0.1288549950547611, 0.04698037022134779, 0.30296629791442004, 0.034135510555519805, 0.04484346398878527, 0.07890459358439607, 0.18481369265325573, 0.10970826898267398, 0.05621616395044346, -0.22959272195121383, 0.07507034296552667, 0.0623080733230227]
|
1,803.0528
|
Double origin of stochastic granular tribocharging
|
The mechanisms underlying triboelectric charging have a stochastic nature. We
investigate how this randomness affects the distributions of charges generated
on granular particles during either a single or many collisions. The charge
distributions we find in our experiments are wider than normal distributions
with an exponential decay of the probability, they are asymmetric, and exhibit
charges of both signs. Moreover, we find a linear correlation between the width
and mean of these distributions. We rationalize these findings with a model for
triboelectric charging which combines stochastic charge separation during
contact and stochastic charge recombination after separation of the surfaces.
Our results further imply that subsequent charging events are not statistically
independent.
|
cond-mat.soft
|
the mechanisms underlying triboelectric charging have a stochastic nature we investigate how this randomness affects the distributions of charges generated on granular particles during either a single or many collisions the charge distributions we find in our experiments are wider than normal distributions with an exponential decay of the probability they are asymmetric and exhibit charges of both signs moreover we find a linear correlation between the width and mean of these distributions we rationalize these findings with a model for triboelectric charging which combines stochastic charge separation during contact and stochastic charge recombination after separation of the surfaces our results further imply that subsequent charging events are not statistically independent
|
[['the', 'mechanisms', 'underlying', 'triboelectric', 'charging', 'have', 'a', 'stochastic', 'nature', 'we', 'investigate', 'how', 'this', 'randomness', 'affects', 'the', 'distributions', 'of', 'charges', 'generated', 'on', 'granular', 'particles', 'during', 'either', 'a', 'single', 'or', 'many', 'collisions', 'the', 'charge', 'distributions', 'we', 'find', 'in', 'our', 'experiments', 'are', 'wider', 'than', 'normal', 'distributions', 'with', 'an', 'exponential', 'decay', 'of', 'the', 'probability', 'they', 'are', 'asymmetric', 'and', 'exhibit', 'charges', 'of', 'both', 'signs', 'moreover', 'we', 'find', 'a', 'linear', 'correlation', 'between', 'the', 'width', 'and', 'mean', 'of', 'these', 'distributions', 'we', 'rationalize', 'these', 'findings', 'with', 'a', 'model', 'for', 'triboelectric', 'charging', 'which', 'combines', 'stochastic', 'charge', 'separation', 'during', 'contact', 'and', 'stochastic', 'charge', 'recombination', 'after', 'separation', 'of', 'the', 'surfaces', 'our', 'results', 'further', 'imply', 'that', 'subsequent', 'charging', 'events', 'are', 'not', 'statistically', 'independent']]
|
[-0.11217049995923901, 0.18934069845842738, -0.1170398132028142, 0.08262383276995204, 0.00997687503066216, -0.11657843307113729, 0.0489496346311392, 0.4197111045522196, -0.2621817298585901, -0.31406014207079336, 0.019675217263677436, -0.3096886419498169, -0.11047591355646046, 0.15706800833461923, -0.021617442403022234, -0.005975679318244393, 0.04552323344742527, -0.025614576259007055, -0.0759770144490307, -0.20149636473338883, 0.29298507518277644, 0.04241038483005386, 0.28970048617705835, 0.09527533117635595, 0.06483605593392575, 0.011691307149793918, -0.04729386821372418, 0.033010886143053975, -0.12875276270590205, 0.07658953752252273, 0.16293024460508213, 0.05705203351962982, 0.23619101969693024, -0.4669644589628185, -0.21401268275672788, 0.12761456257693032, 0.11812720915144267, 0.11052047416697852, -0.09419801351425515, -0.24035188154241927, 0.0756088548700686, -0.1626862120596474, -0.08711048586059127, -0.04882099682481976, 0.025315118206849507, 0.13503861710951487, -0.28675455344643713, 0.11091739804953807, 0.09443358368416493, 0.012272905243711697, -0.06739882864519484, -0.10916274591340674, -0.05096133704809053, 0.1107083418519815, 0.07669654253845078, -0.06986551744410315, 0.17545934868551716, -0.11754953985308036, -0.15575292947238545, 0.30284929545680145, -0.028324980346033944, -0.21774288827368804, 0.2178183759957015, -0.16459052381734993, -0.10712015153294815, 0.16773716476116632, 0.1901351333415421, 0.1261144453525409, -0.14894670670063379, 5.7286648436340396e-05, -0.015472766876153581, 0.15835848633569102, 0.03985903807496233, 0.041045817873767904, 0.25355244434631624, 0.15753520383323366, 0.045462585576109354, 0.1038617672386101, -0.11990295135550336, -0.15497040236368775, -0.3203707661580395, -0.12985078097941974, -0.1363355502284862, 0.053185594746521, -0.09213916573273374, -0.15736437429514555, 0.38016759381033816, 0.14522094962497553, 0.2425324183108436, 0.05473804854062126, 0.22365340325343716, 0.11825995142403822, 0.044942502981169266, 0.07417984051871908, 0.23203203078938295, 0.0935633639209308, 0.09827050753357308, -0.24212250453713643, 0.1288326002095264, -0.020633577318811738]
|
1,803.05281
|
The enough $g$-pairs property and denominator vectors of cluster
algebras
|
In this paper, we introduce the enough $g$-pairs property for a principal
coefficients cluster algebra, which can be understood as a strong version of
the sign-coherence of the $G$-matrices. Then we prove that any
skew-symmetrizable principal coefficients cluster algebra has the enough
$g$-pairs property. As an application, we prove the positivity of denominator
vectors for any skew-symmetrizable cluster algebra. In fact, we give complete
answers to some long standing conjectures on denominator vectors of cluster
variables (see Conjecture 1.1 below), which are proposed by Fomin and
Zelevinsky in [Compos. Math. 143(2007), 112-164].
In addition, we prove that the seeds whose clusters contain particular
cluster variables form a connected subgraph of the exchange graph of this
cluster algebra. Lastly, a criterion to distinguish whether particular cluster
variables belong to one common cluster is given.
|
math.RT math.AC math.RA
|
in this paper we introduce the enough gpairs property for a principal coefficients cluster algebra which can be understood as a strong version of the signcoherence of the gmatrices then we prove that any skewsymmetrizable principal coefficients cluster algebra has the enough gpairs property as an application we prove the positivity of denominator vectors for any skewsymmetrizable cluster algebra in fact we give complete answers to some long standing conjectures on denominator vectors of cluster variables see conjecture 11 below which are proposed by fomin and zelevinsky in compos math 1432007 112164 in addition we prove that the seeds whose clusters contain particular cluster variables form a connected subgraph of the exchange graph of this cluster algebra lastly a criterion to distinguish whether particular cluster variables belong to one common cluster is given
|
[['in', 'this', 'paper', 'we', 'introduce', 'the', 'enough', 'gpairs', 'property', 'for', 'a', 'principal', 'coefficients', 'cluster', 'algebra', 'which', 'can', 'be', 'understood', 'as', 'a', 'strong', 'version', 'of', 'the', 'signcoherence', 'of', 'the', 'gmatrices', 'then', 'we', 'prove', 'that', 'any', 'skewsymmetrizable', 'principal', 'coefficients', 'cluster', 'algebra', 'has', 'the', 'enough', 'gpairs', 'property', 'as', 'an', 'application', 'we', 'prove', 'the', 'positivity', 'of', 'denominator', 'vectors', 'for', 'any', 'skewsymmetrizable', 'cluster', 'algebra', 'in', 'fact', 'we', 'give', 'complete', 'answers', 'to', 'some', 'long', 'standing', 'conjectures', 'on', 'denominator', 'vectors', 'of', 'cluster', 'variables', 'see', 'conjecture', '11', 'below', 'which', 'are', 'proposed', 'by', 'fomin', 'and', 'zelevinsky', 'in', 'compos', 'math', '1432007', '112164', 'in', 'addition', 'we', 'prove', 'that', 'the', 'seeds', 'whose', 'clusters', 'contain', 'particular', 'cluster', 'variables', 'form', 'a', 'connected', 'subgraph', 'of', 'the', 'exchange', 'graph', 'of', 'this', 'cluster', 'algebra', 'lastly', 'a', 'criterion', 'to', 'distinguish', 'whether', 'particular', 'cluster', 'variables', 'belong', 'to', 'one', 'common', 'cluster', 'is', 'given']]
|
[-0.1495653445270794, 0.06297382349532742, -0.10020147827773832, 0.06249744216076148, -0.12158041942743798, -0.120662389558612, 0.044715529661412345, 0.35058934995122537, -0.3401651163905404, -0.23332671294315854, 0.12097327739537075, -0.21852420821949442, -0.1644535051447247, 0.135332633225329, -0.10931463934168334, -0.057254856665625825, 0.10220134939255462, 0.10596896653625233, -0.03212567068323607, -0.3379486940798033, 0.3587268116574678, -0.026810475617988418, 0.18184986315269508, 0.028657906734960454, 0.11210345063008188, 0.03641478830054473, -0.012438227088396786, 0.01130637737925925, -0.1454771970873494, 0.09263045249865852, 0.28040513637358366, 0.14261945610055488, 0.26529326310864726, -0.3592625708596511, -0.0955234307401195, 0.17304597578530434, 0.18464734223113619, 0.08104990347100152, -0.020071169627183437, -0.2303185911123989, 0.14449836980624353, -0.19604722431057509, -0.17952539719719413, -0.058170552273060526, 0.08396573282266391, 0.019790682159648597, -0.260858885737719, 0.10414727210539983, 0.10760683525808667, 0.05683395456885279, -0.06381294318609906, -0.12385651387473326, -0.015252204046705525, 0.08495934607944529, -0.05380264170048403, 0.06228492861855348, 0.07936397478880204, -0.08287828475706109, -0.15732219448234913, 0.32773385473832717, 0.022330671385328734, -0.17270408739790832, 0.16432778231572104, -0.1468157857933743, -0.25835394663007516, 0.019887214640283403, 0.10664591174714892, 0.08760336323691006, -0.1192073141089605, 0.1292677747849055, -0.16427089970644193, 0.1370939295490109, 0.12683820505875326, 0.02007002878635553, 0.14752261418287593, 0.024033470089966785, 0.07432879315589676, 0.16490622870810687, 0.002681688279382714, -0.020559299068937775, -0.3084533799915994, -0.17987301909784212, -0.17633604736934694, 0.08311292636457063, -0.12249967053820084, -0.21592746232103072, 0.34603477185698694, 0.11799028108806442, 0.19611088401559768, 0.08084490880519436, 0.14595095186231247, 0.10458937356824353, 0.10051762030765642, 0.09843940308800976, 0.13211249065774722, 0.2598990097034097, -0.0026443584551963644, -0.13744610002022664, 0.0424142612005719, 0.1488315109074656]
|
1,803.05282
|
What Should You Know Before Developing a Service Identification Approach
|
In this paper, we answer a set of research questions that are required to
develop service identification approach based on the analysis of object-
oriented software. Such research questions are: (1) what is a service, (2) how
are services different from software components, (3) what are types of
services, (4) what are existing service identification approaches that consider
service types into account, and (5) how to identify services based on the
object-oriented source code with respect to their types. Our methodology is
based on performing a literature review to identify the answers of these
research questions. Also, we propose a taxonomy of service types.
|
cs.SE
|
in this paper we answer a set of research questions that are required to develop service identification approach based on the analysis of object oriented software such research questions are 1 what is a service 2 how are services different from software components 3 what are types of services 4 what are existing service identification approaches that consider service types into account and 5 how to identify services based on the objectoriented source code with respect to their types our methodology is based on performing a literature review to identify the answers of these research questions also we propose a taxonomy of service types
|
[['in', 'this', 'paper', 'we', 'answer', 'a', 'set', 'of', 'research', 'questions', 'that', 'are', 'required', 'to', 'develop', 'service', 'identification', 'approach', 'based', 'on', 'the', 'analysis', 'of', 'object', 'oriented', 'software', 'such', 'research', 'questions', 'are', '1', 'what', 'is', 'a', 'service', '2', 'how', 'are', 'services', 'different', 'from', 'software', 'components', '3', 'what', 'are', 'types', 'of', 'services', '4', 'what', 'are', 'existing', 'service', 'identification', 'approaches', 'that', 'consider', 'service', 'types', 'into', 'account', 'and', '5', 'how', 'to', 'identify', 'services', 'based', 'on', 'the', 'objectoriented', 'source', 'code', 'with', 'respect', 'to', 'their', 'types', 'our', 'methodology', 'is', 'based', 'on', 'performing', 'a', 'literature', 'review', 'to', 'identify', 'the', 'answers', 'of', 'these', 'research', 'questions', 'also', 'we', 'propose', 'a', 'taxonomy', 'of', 'service', 'types']]
|
[-0.10206655925139785, 0.020273032159401246, -0.04729691051089993, 0.05988967450684868, -0.11636949507877804, -0.18634635680176032, 0.05150801900778718, 0.43685885361180854, -0.2377052652882412, -0.3829250529821505, 0.134395172022498, -0.2894831074562927, -0.13854139803711754, 0.2044221791102945, -0.11235328267167251, 0.01159615049031205, 0.05271099081549507, 0.022072311383313857, -0.04038627729348194, -0.32316694478728236, 0.37897545921329695, -0.016627418701178752, 0.330926616522797, 0.07460404589073732, 0.005330756987230136, -0.05393778811692475, -0.10664716557724975, -0.028572066722867582, -0.154427845349626, 0.21159419124831821, 0.3351497414092032, 0.2923213407048024, 0.3201148987819369, -0.40387936984188855, -0.1617404400693396, 0.01156090224125924, 0.13824731967179105, 0.05447448745298271, -0.003025315176973191, -0.27751608463810185, 0.13152282568738044, -0.2117042389447586, -0.07379222136044589, -0.06817859455119245, 0.005727968487637834, 0.05495600156539764, -0.20632453818017474, -0.07127656507593481, 0.050012216733123824, 0.10051771728635336, -0.06933133643066797, -0.09895103276581861, 0.0646632274505324, 0.1966942811357932, 0.07608298491832627, 0.016144784749485552, 0.15408440526404704, -0.09813858551877694, -0.18379314775721958, 0.4160865883414562, 0.041009968818308644, -0.20731871682577407, 0.2168568433911647, -0.015323039699489107, -0.2303260615254448, 0.059500795121913634, 0.23931630700826645, 0.08185359579510987, -0.23387680011980522, 0.019508467041864954, -0.026296547255837, 0.16999919711647984, 0.031343292109130956, 0.030265003478584383, 0.23500834020356146, 0.21458615079665413, 0.07257493439989887, 0.10166518095110615, -0.018811618315969378, -0.040095052072921626, -0.25192834677783627, -0.13570972330545863, -0.08242185355545818, 0.0316758336098596, -0.007125014953999198, -0.16950009430113894, 0.4250222865778666, 0.2440056975823469, 0.13980006731043643, 0.04132404505687121, 0.3448469736613333, 0.01692061392658126, 0.04499195118730243, 0.09980798654186611, 0.09807142414725743, -0.01705168280078886, 0.12085321656195447, -0.09029866085844472, 0.09540734736723468, 0.0362259732433953]
|
1,803.05283
|
Spinning probes and helices in AdS$_3$
|
We study extremal curves associated with a functional which is linear in the
curve's torsion. The functional in question is known to capture the properties
of entanglement entropy for two-dimensional conformal field theories with
chiral anomalies and has potential applications in elucidating the equilibrium
shape of elastic linear structures. We derive the equations that determine the
shape of its extremal curves in general ambient spaces in terms of geometric
quantities. We show that the solutions to these shape equations correspond to a
three-dimensional version of Mathisson's helical motions for the centers of
mass of spinning probes. Thereafter, we focus on the case of maximally
symmetric spaces, where solutions correspond to cylindrical helices and find
that the Lancret ratio of these equals the relative speed between the
Mathisson-Pirani and the Tulczyjew-Dixon observers. Finally, we construct all
possible helical motions in three-dimensional manifolds with constant negative
curvature. In particular, we discover a rich space of helices in AdS$_3$ which
we explore in detail.
|
hep-th gr-qc math-ph math.MP
|
we study extremal curves associated with a functional which is linear in the curves torsion the functional in question is known to capture the properties of entanglement entropy for twodimensional conformal field theories with chiral anomalies and has potential applications in elucidating the equilibrium shape of elastic linear structures we derive the equations that determine the shape of its extremal curves in general ambient spaces in terms of geometric quantities we show that the solutions to these shape equations correspond to a threedimensional version of mathissons helical motions for the centers of mass of spinning probes thereafter we focus on the case of maximally symmetric spaces where solutions correspond to cylindrical helices and find that the lancret ratio of these equals the relative speed between the mathissonpirani and the tulczyjewdixon observers finally we construct all possible helical motions in threedimensional manifolds with constant negative curvature in particular we discover a rich space of helices in ads_3 which we explore in detail
|
[['we', 'study', 'extremal', 'curves', 'associated', 'with', 'a', 'functional', 'which', 'is', 'linear', 'in', 'the', 'curves', 'torsion', 'the', 'functional', 'in', 'question', 'is', 'known', 'to', 'capture', 'the', 'properties', 'of', 'entanglement', 'entropy', 'for', 'twodimensional', 'conformal', 'field', 'theories', 'with', 'chiral', 'anomalies', 'and', 'has', 'potential', 'applications', 'in', 'elucidating', 'the', 'equilibrium', 'shape', 'of', 'elastic', 'linear', 'structures', 'we', 'derive', 'the', 'equations', 'that', 'determine', 'the', 'shape', 'of', 'its', 'extremal', 'curves', 'in', 'general', 'ambient', 'spaces', 'in', 'terms', 'of', 'geometric', 'quantities', 'we', 'show', 'that', 'the', 'solutions', 'to', 'these', 'shape', 'equations', 'correspond', 'to', 'a', 'threedimensional', 'version', 'of', 'mathissons', 'helical', 'motions', 'for', 'the', 'centers', 'of', 'mass', 'of', 'spinning', 'probes', 'thereafter', 'we', 'focus', 'on', 'the', 'case', 'of', 'maximally', 'symmetric', 'spaces', 'where', 'solutions', 'correspond', 'to', 'cylindrical', 'helices', 'and', 'find', 'that', 'the', 'lancret', 'ratio', 'of', 'these', 'equals', 'the', 'relative', 'speed', 'between', 'the', 'mathissonpirani', 'and', 'the', 'tulczyjewdixon', 'observers', 'finally', 'we', 'construct', 'all', 'possible', 'helical', 'motions', 'in', 'threedimensional', 'manifolds', 'with', 'constant', 'negative', 'curvature', 'in', 'particular', 'we', 'discover', 'a', 'rich', 'space', 'of', 'helices', 'in', 'ads_3', 'which', 'we', 'explore', 'in', 'detail']]
|
[-0.15786167243932142, 0.12461222218116745, -0.08078455013455824, 0.07469253473936988, -0.05709479868528433, -0.09829419723828323, -0.04282446803408675, 0.36216424363665284, -0.24888152887433534, -0.2442376766644884, 0.08150621735185268, -0.2769293526886031, -0.17903272053954425, 0.1661327768379124, -0.0607373516439111, 0.045025167334461005, -0.0048984711000230165, 0.06074027807335369, -0.13006352520496875, -0.21234752807067708, 0.3647226420318475, -0.010358225877280348, 0.24755807948095027, 0.02184814545107656, 0.10740344461992209, -0.010492707797675393, 0.007608635333599523, 0.06464384298869845, -0.22460871183443487, 0.13801463983254508, 0.21812385189987255, 0.06944404959576786, 0.14940010240825358, -0.41876477204496043, -0.2003765205387026, 0.12292068970491528, 0.10487767060985789, 0.11004893165663816, -0.02700376447101007, -0.24050549405947094, 0.06981011293828487, -0.09349972286727279, -0.20919604517694096, -0.10793744544498622, 0.0555288126670348, 0.04353090100339614, -0.1926887428504415, 0.0937733673315961, 0.05667153590788985, 0.04165210471837781, -0.13561279214409297, -0.039548244822799464, -0.05756544988398673, 0.08986577162577306, 0.08547737629851326, 0.0018728998911683448, 0.10134993879473768, -0.1615199042367749, -0.11970751472690608, 0.37702991903643124, -0.06760295336316631, -0.25031206429121083, 0.15735755678324495, -0.1808883320860332, -0.13629625614121324, 0.10151810321258381, 0.1884500599796411, 0.16007919227995443, -0.10567297661327757, 0.12534844321962738, -0.043505256338539765, 0.11576490979787195, 0.10075489192258828, 0.0351159718058625, 0.23185802010266343, 0.09227533052762737, 0.06589804245741107, 0.1841451385545952, -0.07964579028375737, -0.12065600907499174, -0.33059850172139704, -0.1954838474863209, -0.1065193520320463, 0.06620366839197231, -0.1219896633378994, -0.20896349825925425, 0.3938833128864644, 0.09169762501069272, 0.20858295422513037, 0.038074903399683536, 0.20358614551296342, 0.0687364669109229, 0.036422103525546846, 0.0997843174787704, 0.2770548875501845, 0.17870292435400187, 0.05377983612052049, -0.23074055843317182, -0.01784964481194038, 0.08877282550965901]
|
1,803.05284
|
A Unified View of False Discovery Rate Control: Reconciliation of
Bayesian and Frequentist Approaches
|
This paper explores the intrinsic connections between the Bayesian false
discovery rate (FDR) control procedures and their counterpart of frequentist
procedures. We attempt to offer a unified view of FDR control within and beyond
the setting of testing exchangeable hypotheses. Under the standard two-groups
model and the Oracle condition, we show that the Bayesian and the frequentist
methods can achieve asymptotically equivalent FDR control at arbitrary levels.
Built on this result, we further illustrate that rigorous post-fitting model
diagnosis is necessary and effective to ensure robust FDR controls for
parametric Bayesian approaches. Additionally, we show that the Bayesian FDR
control approaches are coherent and naturally extended to the setting beyond
testing exchangeable hypotheses. Particularly, we illustrate that $p$-values
are no longer the natural statistical instruments for optimal frequentist FDR
control in testing non-exchangeable hypotheses. Finally, we illustrate that
simple numerical recipes motivated by our theoretical results can be effective
in examining some key model assumptions commonly assumed in both Bayesian and
frequentist procedures (e.g., zero assumption).
|
stat.ME
|
this paper explores the intrinsic connections between the bayesian false discovery rate fdr control procedures and their counterpart of frequentist procedures we attempt to offer a unified view of fdr control within and beyond the setting of testing exchangeable hypotheses under the standard twogroups model and the oracle condition we show that the bayesian and the frequentist methods can achieve asymptotically equivalent fdr control at arbitrary levels built on this result we further illustrate that rigorous postfitting model diagnosis is necessary and effective to ensure robust fdr controls for parametric bayesian approaches additionally we show that the bayesian fdr control approaches are coherent and naturally extended to the setting beyond testing exchangeable hypotheses particularly we illustrate that pvalues are no longer the natural statistical instruments for optimal frequentist fdr control in testing nonexchangeable hypotheses finally we illustrate that simple numerical recipes motivated by our theoretical results can be effective in examining some key model assumptions commonly assumed in both bayesian and frequentist procedures eg zero assumption
|
[['this', 'paper', 'explores', 'the', 'intrinsic', 'connections', 'between', 'the', 'bayesian', 'false', 'discovery', 'rate', 'fdr', 'control', 'procedures', 'and', 'their', 'counterpart', 'of', 'frequentist', 'procedures', 'we', 'attempt', 'to', 'offer', 'a', 'unified', 'view', 'of', 'fdr', 'control', 'within', 'and', 'beyond', 'the', 'setting', 'of', 'testing', 'exchangeable', 'hypotheses', 'under', 'the', 'standard', 'twogroups', 'model', 'and', 'the', 'oracle', 'condition', 'we', 'show', 'that', 'the', 'bayesian', 'and', 'the', 'frequentist', 'methods', 'can', 'achieve', 'asymptotically', 'equivalent', 'fdr', 'control', 'at', 'arbitrary', 'levels', 'built', 'on', 'this', 'result', 'we', 'further', 'illustrate', 'that', 'rigorous', 'postfitting', 'model', 'diagnosis', 'is', 'necessary', 'and', 'effective', 'to', 'ensure', 'robust', 'fdr', 'controls', 'for', 'parametric', 'bayesian', 'approaches', 'additionally', 'we', 'show', 'that', 'the', 'bayesian', 'fdr', 'control', 'approaches', 'are', 'coherent', 'and', 'naturally', 'extended', 'to', 'the', 'setting', 'beyond', 'testing', 'exchangeable', 'hypotheses', 'particularly', 'we', 'illustrate', 'that', 'pvalues', 'are', 'no', 'longer', 'the', 'natural', 'statistical', 'instruments', 'for', 'optimal', 'frequentist', 'fdr', 'control', 'in', 'testing', 'nonexchangeable', 'hypotheses', 'finally', 'we', 'illustrate', 'that', 'simple', 'numerical', 'recipes', 'motivated', 'by', 'our', 'theoretical', 'results', 'can', 'be', 'effective', 'in', 'examining', 'some', 'key', 'model', 'assumptions', 'commonly', 'assumed', 'in', 'both', 'bayesian', 'and', 'frequentist', 'procedures', 'eg', 'zero', 'assumption']]
|
[-0.0438147570655653, 0.00879857771267945, -0.12620817446855434, 0.18827228891225814, -0.09996351484406853, -0.22907517178435668, 0.17185082375706937, 0.4125119321231702, -0.24153567003932866, -0.2932205474879028, 0.12607840809082105, -0.1655571585521102, -0.1622130779436592, 0.22084232344800098, -0.15780596574486205, 0.13354793088651742, 0.038825002205417014, -0.016956548598792517, -0.049400154330457254, -0.2804479235585666, 0.27780145204089807, 0.09606915371577171, 0.36379825029183516, -0.020656465263869685, 0.10531770115908744, 0.04584257869811898, -0.046282810305781436, 0.005655376488963763, -0.1713367790149994, 0.12599284248144338, 0.2975604084743695, 0.19726906157747814, 0.3577122931114652, -0.3802612443242899, -0.1959245677980961, 0.11139250540767204, 0.1505619949425719, 0.10203194784169847, -0.022774243911474267, -0.27874023148394894, 0.11178328994322907, -0.15510124277224707, -0.0809289263614284, -0.1377214784451732, -0.09451234178391821, -0.009434759755139098, -0.38545384536017524, 0.11186239239160028, 0.0731737374807849, 0.08622107961017525, -0.050828363390808755, -0.11011524949589688, 0.06096331222039281, 0.0613342213924184, 0.11936166651942062, -0.06638916329847593, 0.15012305810708892, -0.10522258114351919, -0.1928459557267188, 0.259146045656014, -0.022022026485523604, -0.22974778065514384, 0.2162009200137673, -0.08022654248175748, -0.17781922947333167, 0.04784081921715176, 0.14588928142223845, 0.10842653355899859, -0.23019714359419816, 0.11607102795511089, 0.0009897926003869736, 0.13899741673164748, 0.040987033869676066, 0.0028020023784571975, 0.17995258290320634, 0.16595026644398317, 0.07642419374632564, 0.09063239512245425, -0.08249982953720698, -0.12763239809763477, -0.35845643893222917, -0.12063124686775899, -0.10119709160574006, -0.019351688796428568, -0.1232687763270929, -0.1425381033949441, 0.3446948699483817, 0.2611860670085827, 0.1082070046302044, 0.1668451348637146, 0.29272543585040806, 0.09779699938583442, 0.0006506276726158279, 0.05417387168995585, 0.2701874133800933, 0.11050608677535571, -0.026266337270763787, -0.14454629238920683, 0.11598848409555626, -0.02684607929691221]
|
1,803.05285
|
An Acoustical Analogue of a Galactic-scale Gravitational-Wave Detector
|
By precisely monitoring the "ticks" of Nature's most precise clocks
(millisecond pulsars), scientists are trying to detect the "ripples in
spacetime" (gravitational waves) produced by the inspirals of supermassive
black holes in the centers of distant merging galaxies. Here we describe a
relatively simple demonstration that uses two metronomes and a microphone to
illustrate several techniques used by pulsar astronomers to search for
gravitational waves. An adapted version of this demonstration could be used as
an instructional laboratory investigation at the undergraduate level.
|
physics.ed-ph astro-ph.IM gr-qc
|
by precisely monitoring the ticks of natures most precise clocks millisecond pulsars scientists are trying to detect the ripples in spacetime gravitational waves produced by the inspirals of supermassive black holes in the centers of distant merging galaxies here we describe a relatively simple demonstration that uses two metronomes and a microphone to illustrate several techniques used by pulsar astronomers to search for gravitational waves an adapted version of this demonstration could be used as an instructional laboratory investigation at the undergraduate level
|
[['by', 'precisely', 'monitoring', 'the', 'ticks', 'of', 'natures', 'most', 'precise', 'clocks', 'millisecond', 'pulsars', 'scientists', 'are', 'trying', 'to', 'detect', 'the', 'ripples', 'in', 'spacetime', 'gravitational', 'waves', 'produced', 'by', 'the', 'inspirals', 'of', 'supermassive', 'black', 'holes', 'in', 'the', 'centers', 'of', 'distant', 'merging', 'galaxies', 'here', 'we', 'describe', 'a', 'relatively', 'simple', 'demonstration', 'that', 'uses', 'two', 'metronomes', 'and', 'a', 'microphone', 'to', 'illustrate', 'several', 'techniques', 'used', 'by', 'pulsar', 'astronomers', 'to', 'search', 'for', 'gravitational', 'waves', 'an', 'adapted', 'version', 'of', 'this', 'demonstration', 'could', 'be', 'used', 'as', 'an', 'instructional', 'laboratory', 'investigation', 'at', 'the', 'undergraduate', 'level']]
|
[-0.10329603260777138, 0.15540702950457638, -0.07678111310184271, 0.1386583854475182, -0.1550034044243126, -0.10163784580843815, 0.02585289697443326, 0.36730027811444665, -0.18109693665882146, -0.33068374403000594, 0.07235007686821003, -0.2806326930287732, -0.11496069423674819, 0.2997912392160485, -0.052059022086975444, 0.0024350055911387487, 0.06524466646762273, -0.04103183718566525, -0.002581099881397852, -0.21471884880752826, 0.26453755308974936, 0.1324294825555779, 0.17729624034836888, -0.08031830564141273, 0.11450540498796716, -0.029217824135087878, -0.028870619878352405, -0.03922850156135588, -0.11047654956095664, 0.09191357512700271, 0.3592096949189043, 0.1768784177242722, 0.27233776576951685, -0.48554641089166506, -0.18513573509506343, 0.06828738657017071, 0.1521018823511977, 0.16521301515770695, -0.0949596602088177, -0.37243981882705385, 0.04245155556015221, -0.21774283317422652, -0.17592277735224868, -0.02108688852244831, 0.03594300664781806, 0.03141388755448791, -0.15107657077037787, 0.007517432749091861, 0.012679736157290143, 0.049491805837949716, -0.06704449961354664, -0.005227296601936042, 0.06676136686029024, 0.12540670299161988, 0.0545165493455996, 0.024030769694419803, 0.1955893070392131, -0.077652151682358, -0.17848660740776953, 0.41244186783849024, -0.055852753031684695, -0.12498196658218302, 0.22909347161493568, -0.1855870000877788, -0.15681392292727728, 0.06873970072020788, 0.21775160517812853, 0.15175477776631532, -0.2038932825405016, -0.03484024955254295, 0.04317429013752255, 0.22027291073351649, 0.15358265105870564, 0.01675099295463009, 0.3882553100653262, 0.14633384801472638, 0.019867124164993144, 0.1093748476432008, -0.12542664079018026, 0.02439421157812677, -0.2472309714340302, -0.1134529695677829, -0.19064167164916912, 0.06921957301940904, -0.08346797798529508, -0.10584557586046586, 0.3656443345124822, 0.13828964400699878, 0.09345996336652393, -0.011430640660046813, 0.2984670505781201, 0.04698661193167454, 0.05406217295283743, 0.06878914949989104, 0.34134483887359546, 0.12000015698631394, 0.10983919910245003, -0.15971261307636433, 0.040103857416704476, 0.030839024493134165]
|
1,803.05286
|
Turbulence Modeling via the Fractional Laplacian
|
Herein, we derive the fractional Laplacian operator as a means to represent
the mean friction force arising in a turbulent flow: $ \rho \frac{D\bar{\bf
u}}{Dt} = -\nabla p + \mu_\alpha \nabla^2\bar{\bf u} + \rho C_\alpha
\iiint_{\!-\infty}^\infty
\frac{ \bar{\bf u}{\scriptstyle(t,{\bf x}')} - \bar{\bf
u}{\scriptstyle(t,{\bf x})} }{|{\bf x}'-{\bf x}|^{\alpha+3}} \,d{\bf x}' $,
where $\bar{\bf u}{\scriptstyle(t,{\bf x})}$ is the ensemble-averaged velocity
field, $\mu_\alpha$ is an enhanced molecular viscosity, and $C_\alpha$ is a
turbulent mixing coefficient (with units (length)$^\alpha$/(time)). The
derivation is grounded in Boltzmann kinetic theory, which presumes an
equilibrium probability distribution $f_\alpha^{eq}(t,{\bf x},{\bf u})$ of
particle speeds. While historically $f_\alpha^{eq}$ has been assumed to be the
Maxwell-Boltzmann distribution, we show that any member of the family of L\'evy
$\alpha$-stable distributions is a suitable alternative. If $\alpha=2$, then
$f^{eq}_\alpha$ is the Maxwell-Boltzmann distribution, with large particle
speeds very unlikely, and the Navier-Stokes equations are recovered (with
$\mu_\alpha = \mu$ and $C_\alpha = 0$). If $0 < \alpha < 2$, then
$f^{eq}_\alpha$ is a L\'evy $\alpha$-stable distribution, with "heavy tails"
that permit large velocity fluctuations, as in turbulence. For shear turbulent
flows, the choice of $\alpha = 1$ (Cauchy distribution for $f_\alpha^{eq}$)
leads to the logarithmic velocity profile known as the Law of the Wall. We also
present examples of 1D Couette flow and 2D boundary layer flow, and we discuss
turbulent transport within this kinetic theory framework. This work lays out a
new framework for turbulence modeling that may lead to new fundamental
understanding of turbulent flows.
|
physics.flu-dyn
|
herein we derive the fractional laplacian operator as a means to represent the mean friction force arising in a turbulent flow rho fracdbarbf udt nabla p mu_alpha nabla2barbf u rho c_alpha iiint_inftyinfty frac barbf uscriptstyletbf x barbf uscriptstyletbf x bf xbf xalpha3 dbf x where barbf uscriptstyletbf x is the ensembleaveraged velocity field mu_alpha is an enhanced molecular viscosity and c_alpha is a turbulent mixing coefficient with units lengthalphatime the derivation is grounded in boltzmann kinetic theory which presumes an equilibrium probability distribution f_alphaeqtbf xbf u of particle speeds while historically f_alphaeq has been assumed to be the maxwellboltzmann distribution we show that any member of the family of levy alphastable distributions is a suitable alternative if alpha2 then feq_alpha is the maxwellboltzmann distribution with large particle speeds very unlikely and the navierstokes equations are recovered with mu_alpha mu and c_alpha 0 if 0 alpha 2 then feq_alpha is a levy alphastable distribution with heavy tails that permit large velocity fluctuations as in turbulence for shear turbulent flows the choice of alpha 1 cauchy distribution for f_alphaeq leads to the logarithmic velocity profile known as the law of the wall we also present examples of 1d couette flow and 2d boundary layer flow and we discuss turbulent transport within this kinetic theory framework this work lays out a new framework for turbulence modeling that may lead to new fundamental understanding of turbulent flows
|
[['herein', 'we', 'derive', 'the', 'fractional', 'laplacian', 'operator', 'as', 'a', 'means', 'to', 'represent', 'the', 'mean', 'friction', 'force', 'arising', 'in', 'a', 'turbulent', 'flow', 'rho', 'fracdbarbf', 'udt', 'nabla', 'p', 'mu_alpha', 'nabla2barbf', 'u', 'rho', 'c_alpha', 'iiint_inftyinfty', 'frac', 'barbf', 'uscriptstyletbf', 'x', 'barbf', 'uscriptstyletbf', 'x', 'bf', 'xbf', 'xalpha3', 'dbf', 'x', 'where', 'barbf', 'uscriptstyletbf', 'x', 'is', 'the', 'ensembleaveraged', 'velocity', 'field', 'mu_alpha', 'is', 'an', 'enhanced', 'molecular', 'viscosity', 'and', 'c_alpha', 'is', 'a', 'turbulent', 'mixing', 'coefficient', 'with', 'units', 'lengthalphatime', 'the', 'derivation', 'is', 'grounded', 'in', 'boltzmann', 'kinetic', 'theory', 'which', 'presumes', 'an', 'equilibrium', 'probability', 'distribution', 'f_alphaeqtbf', 'xbf', 'u', 'of', 'particle', 'speeds', 'while', 'historically', 'f_alphaeq', 'has', 'been', 'assumed', 'to', 'be', 'the', 'maxwellboltzmann', 'distribution', 'we', 'show', 'that', 'any', 'member', 'of', 'the', 'family', 'of', 'levy', 'alphastable', 'distributions', 'is', 'a', 'suitable', 'alternative', 'if', 'alpha2', 'then', 'feq_alpha', 'is', 'the', 'maxwellboltzmann', 'distribution', 'with', 'large', 'particle', 'speeds', 'very', 'unlikely', 'and', 'the', 'navierstokes', 'equations', 'are', 'recovered', 'with', 'mu_alpha', 'mu', 'and', 'c_alpha', '0', 'if', '0', 'alpha', '2', 'then', 'feq_alpha', 'is', 'a', 'levy', 'alphastable', 'distribution', 'with', 'heavy', 'tails', 'that', 'permit', 'large', 'velocity', 'fluctuations', 'as', 'in', 'turbulence', 'for', 'shear', 'turbulent', 'flows', 'the', 'choice', 'of', 'alpha', '1', 'cauchy', 'distribution', 'for', 'f_alphaeq', 'leads', 'to', 'the', 'logarithmic', 'velocity', 'profile', 'known', 'as', 'the', 'law', 'of', 'the', 'wall', 'we', 'also', 'present', 'examples', 'of', '1d', 'couette', 'flow', 'and', '2d', 'boundary', 'layer', 'flow', 'and', 'we', 'discuss', 'turbulent', 'transport', 'within', 'this', 'kinetic', 'theory', 'framework', 'this', 'work', 'lays', 'out', 'a', 'new', 'framework', 'for', 'turbulence', 'modeling', 'that', 'may', 'lead', 'to', 'new', 'fundamental', 'understanding', 'of', 'turbulent', 'flows']]
|
[-0.14169583356620288, 0.19398667507467168, -0.1158186791573271, 0.026933216176104353, -0.05437531326939206, -0.15568168530649937, -0.03346201216302407, 0.3277704644313441, -0.3192642128320553, -0.20542845655088585, 0.02247661083671494, -0.2821227510484779, -0.08126944051470791, 0.12777378801005837, -0.04636491478771606, 0.07766150531876882, -0.004317673563752574, 0.00957027450621529, -0.02748608169555163, -0.13454220370669334, 0.28634139424453037, 0.006135731902090423, 0.23826253594780517, 0.010795251906415105, 0.11948249559649037, -0.08766700040482218, 0.0027641661124796746, 0.008556098163528827, -0.22570144436830492, 0.03852620488345924, 0.16213891405253064, 0.01966865933207887, 0.26870981526301757, -0.3571462429759214, -0.24111839571873492, 0.10511622531600547, 0.18367115283518562, 0.011590675136070247, -0.010650980999148263, -0.25059236805560275, 0.10091547944244715, -0.1839847090265676, -0.18412241605298402, -0.06716250317409267, 0.1255622820708391, 0.0724032652465681, -0.35567176731244865, 0.18887317967755124, 0.06647812776296763, 0.0469569233601136, -0.050857032007107617, -0.16035164230933305, -0.05539977715471801, 0.04814859104004476, 0.06955740204072587, 0.09655763412358014, 0.14810612833862413, -0.15312890385824668, -0.003371922096713642, 0.4056011650336994, -0.10271062693901092, -0.2666749645300176, 0.12486549024939989, -0.1957226418451544, -0.10846866851447008, 0.1316751471424116, 0.15499623223821812, 0.12440149349984927, -0.13057068312716055, 0.1266485155993893, -0.08222447682068695, 0.1526278115797479, 0.06062388935360239, -0.033960274176363055, 0.1495200149305666, 0.12144900414875537, 0.0856387414097694, 0.05780956108747426, -0.15106156316477254, -0.10995638258901379, -0.34825586442806394, -0.18511929607536695, -0.16446650818600048, 0.14763609595772195, -0.11850913458276956, -0.1640714777361042, 0.2785285486852241, 0.12259925396709949, 0.17935297092696392, 0.0779253502617561, 0.21627104452773593, 0.16139989637617322, -0.03774284845794396, 0.16052917368405167, 0.157648761692246, 0.1914271086312396, 0.1215785923946415, -0.18049714977188963, 0.04906527747529572, 0.08193742149538724]
|
1,803.05287
|
Resolution of the 300-Year-Old Vibrating String Controversy
|
The dispute about the well-known 1D vibrating string model and its solutions,
known as The Vibrating String Controversy, spanned the whole of 1700s and
involved a group of the most eminent scientists of the time. After that, the
model stood undisputed for over two centuries. In this study, it is shown that
not only this 300-year-old model cannot correspond to reality, but it is
theoretically not quite plausible, either. A new 2D model is developed removing
all the assumptions of the classical model. The result is a pair of non-linear
partial differential equations modeling 2D motions of a finite 1D string. A
theorem that can be used to determine the initial displacement functions from
the initial shape of the string is proven. The new model is capable of
representing initial conditions that cannot be handled in the classical model.
It also allows initially non-taut/non-slack strings and self-intersecting
shapes. The classical model and the non-taut strings emerge as special limit
cases. It is proven that pure transverse motions of a 1D string are possible
only in very rare cases. A theorem that sets the conditions for pure transverse
motions is also presented. Numerical studies of interesting cases are presented
in support of the new model. High-speed camera experiments are also conducted,
the results of which also support the new theory.
|
physics.gen-ph
|
the dispute about the wellknown 1d vibrating string model and its solutions known as the vibrating string controversy spanned the whole of 1700s and involved a group of the most eminent scientists of the time after that the model stood undisputed for over two centuries in this study it is shown that not only this 300yearold model cannot correspond to reality but it is theoretically not quite plausible either a new 2d model is developed removing all the assumptions of the classical model the result is a pair of nonlinear partial differential equations modeling 2d motions of a finite 1d string a theorem that can be used to determine the initial displacement functions from the initial shape of the string is proven the new model is capable of representing initial conditions that cannot be handled in the classical model it also allows initially nontautnonslack strings and selfintersecting shapes the classical model and the nontaut strings emerge as special limit cases it is proven that pure transverse motions of a 1d string are possible only in very rare cases a theorem that sets the conditions for pure transverse motions is also presented numerical studies of interesting cases are presented in support of the new model highspeed camera experiments are also conducted the results of which also support the new theory
|
[['the', 'dispute', 'about', 'the', 'wellknown', '1d', 'vibrating', 'string', 'model', 'and', 'its', 'solutions', 'known', 'as', 'the', 'vibrating', 'string', 'controversy', 'spanned', 'the', 'whole', 'of', '1700s', 'and', 'involved', 'a', 'group', 'of', 'the', 'most', 'eminent', 'scientists', 'of', 'the', 'time', 'after', 'that', 'the', 'model', 'stood', 'undisputed', 'for', 'over', 'two', 'centuries', 'in', 'this', 'study', 'it', 'is', 'shown', 'that', 'not', 'only', 'this', '300yearold', 'model', 'can', 'not', 'correspond', 'to', 'reality', 'but', 'it', 'is', 'theoretically', 'not', 'quite', 'plausible', 'either', 'a', 'new', '2d', 'model', 'is', 'developed', 'removing', 'all', 'the', 'assumptions', 'of', 'the', 'classical', 'model', 'the', 'result', 'is', 'a', 'pair', 'of', 'nonlinear', 'partial', 'differential', 'equations', 'modeling', '2d', 'motions', 'of', 'a', 'finite', '1d', 'string', 'a', 'theorem', 'that', 'can', 'be', 'used', 'to', 'determine', 'the', 'initial', 'displacement', 'functions', 'from', 'the', 'initial', 'shape', 'of', 'the', 'string', 'is', 'proven', 'the', 'new', 'model', 'is', 'capable', 'of', 'representing', 'initial', 'conditions', 'that', 'can', 'not', 'be', 'handled', 'in', 'the', 'classical', 'model', 'it', 'also', 'allows', 'initially', 'nontautnonslack', 'strings', 'and', 'selfintersecting', 'shapes', 'the', 'classical', 'model', 'and', 'the', 'nontaut', 'strings', 'emerge', 'as', 'special', 'limit', 'cases', 'it', 'is', 'proven', 'that', 'pure', 'transverse', 'motions', 'of', 'a', '1d', 'string', 'are', 'possible', 'only', 'in', 'very', 'rare', 'cases', 'a', 'theorem', 'that', 'sets', 'the', 'conditions', 'for', 'pure', 'transverse', 'motions', 'is', 'also', 'presented', 'numerical', 'studies', 'of', 'interesting', 'cases', 'are', 'presented', 'in', 'support', 'of', 'the', 'new', 'model', 'highspeed', 'camera', 'experiments', 'are', 'also', 'conducted', 'the', 'results', 'of', 'which', 'also', 'support', 'the', 'new', 'theory']]
|
[-0.10187289784779373, 0.12445711735508418, -0.11453196221907287, 0.10722474289896418, -0.06710958373137499, -0.16033155449398168, 0.009038587912521644, 0.34150528571819333, -0.26569585876856167, -0.2708990606521873, 0.1134527201469792, -0.23247845661216449, -0.15133436481770315, 0.240606272983318, -0.050151287609940934, 0.05540764758168809, 0.09206672780456013, 0.05161066130909337, -0.038559366320313024, -0.25303112352734697, 0.28483341621303054, 0.025379127776037614, 0.2756135821200006, 0.025939946170772967, 0.09542736542925714, -0.021882955046566246, -0.01902836845277651, 0.04975017863842899, -0.10862343251320042, 0.08138910547264566, 0.2097629429432287, 0.11536504140923216, 0.22277775753212914, -0.42716189288453427, -0.2387450597950387, 0.08942697988450952, 0.1329124327855329, 0.15093978041236514, -0.019122386705257916, -0.26115403221027084, 0.0924216221537458, -0.14339767239608303, -0.16273163085522718, -0.06023366453729944, 0.050491185262682314, 0.004966197262165141, -0.22804789883924487, 0.06952908603085384, 0.10004112533225623, 0.011038181879111144, -0.0724381897712794, -0.07068331735038526, -0.037301148302836096, 0.1292631557364374, 0.05757252137404208, 0.0401919594950991, 0.06930730440632597, -0.1503871120044698, -0.11232753809686052, 0.4081798092915026, -0.02934755238791562, -0.23371075141375466, 0.2126782805314415, -0.12690174926314757, -0.12363360241718896, 0.10545562854362014, 0.11742678832381828, 0.14698002315190148, -0.16978799932334385, 0.10143617808406313, -0.11308322910466083, 0.15897108859926903, 0.06809607145299956, -0.006583134401334475, 0.21221351617581496, 0.15293735495585625, 0.02321387661597585, 0.12329472911216693, -0.07187193533039937, -0.12731285762497901, -0.3336638412624385, -0.11985713686606927, -0.16446410647548787, 0.033632350911452225, -0.05912397152010126, -0.18782442354862408, 0.3698807111324649, 0.14310753025719472, 0.17314246076889567, 0.004441144621556786, 0.2623765187584646, 0.10073172712388138, 0.06478086246823951, 0.05811558453324033, 0.22920820580106482, 0.1316812081840825, 0.0896468713648881, -0.15697442204797785, 0.046863031263152756, 0.05700628658901202]
|
1,803.05288
|
Domain Adaptation on Graphs by Learning Aligned Graph Bases
|
A common assumption in semi-supervised learning with graph models is that the
class label function varies smoothly on the data graph, resulting in the rather
strict prior that the label function has low-frequency content. Meanwhile, in
many classification problems, the label function may vary abruptly in certain
graph regions, resulting in high-frequency components. Although the
semi-supervised estimation of class labels is an ill-posed problem in general,
in several applications it is possible to find a source graph on which the
label function has similar frequency content to that on the target graph where
the actual classification problem is defined. In this paper, we propose a
method for domain adaptation on graphs motivated by these observations. Our
algorithm is based on learning the spectrum of the label function in a source
graph with many labeled nodes, and transferring the information of the spectrum
to the target graph with fewer labeled nodes. While the frequency content of
the class label function can be identified through the graph Fourier transform,
it is not easy to transfer the Fourier coefficients directly between the two
graphs, since no one-to-one match exists between the Fourier basis vectors of
independently constructed graphs in the domain adaptation setting. We solve
this problem by learning a transformation between the Fourier bases of the two
graphs that flexibly ``aligns'' them. The unknown class label function on the
target graph is then reconstructed such that its spectrum matches that on the
source graph while also ensuring the consistency with the available labels. The
proposed method is tested in the classification of image, online product
review, and social network data sets. Comparative experiments suggest that the
proposed algorithm performs better than recent domain adaptation methods in the
literature in most settings.
|
stat.ML cs.LG
|
a common assumption in semisupervised learning with graph models is that the class label function varies smoothly on the data graph resulting in the rather strict prior that the label function has lowfrequency content meanwhile in many classification problems the label function may vary abruptly in certain graph regions resulting in highfrequency components although the semisupervised estimation of class labels is an illposed problem in general in several applications it is possible to find a source graph on which the label function has similar frequency content to that on the target graph where the actual classification problem is defined in this paper we propose a method for domain adaptation on graphs motivated by these observations our algorithm is based on learning the spectrum of the label function in a source graph with many labeled nodes and transferring the information of the spectrum to the target graph with fewer labeled nodes while the frequency content of the class label function can be identified through the graph fourier transform it is not easy to transfer the fourier coefficients directly between the two graphs since no onetoone match exists between the fourier basis vectors of independently constructed graphs in the domain adaptation setting we solve this problem by learning a transformation between the fourier bases of the two graphs that flexibly aligns them the unknown class label function on the target graph is then reconstructed such that its spectrum matches that on the source graph while also ensuring the consistency with the available labels the proposed method is tested in the classification of image online product review and social network data sets comparative experiments suggest that the proposed algorithm performs better than recent domain adaptation methods in the literature in most settings
|
[['a', 'common', 'assumption', 'in', 'semisupervised', 'learning', 'with', 'graph', 'models', 'is', 'that', 'the', 'class', 'label', 'function', 'varies', 'smoothly', 'on', 'the', 'data', 'graph', 'resulting', 'in', 'the', 'rather', 'strict', 'prior', 'that', 'the', 'label', 'function', 'has', 'lowfrequency', 'content', 'meanwhile', 'in', 'many', 'classification', 'problems', 'the', 'label', 'function', 'may', 'vary', 'abruptly', 'in', 'certain', 'graph', 'regions', 'resulting', 'in', 'highfrequency', 'components', 'although', 'the', 'semisupervised', 'estimation', 'of', 'class', 'labels', 'is', 'an', 'illposed', 'problem', 'in', 'general', 'in', 'several', 'applications', 'it', 'is', 'possible', 'to', 'find', 'a', 'source', 'graph', 'on', 'which', 'the', 'label', 'function', 'has', 'similar', 'frequency', 'content', 'to', 'that', 'on', 'the', 'target', 'graph', 'where', 'the', 'actual', 'classification', 'problem', 'is', 'defined', 'in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'for', 'domain', 'adaptation', 'on', 'graphs', 'motivated', 'by', 'these', 'observations', 'our', 'algorithm', 'is', 'based', 'on', 'learning', 'the', 'spectrum', 'of', 'the', 'label', 'function', 'in', 'a', 'source', 'graph', 'with', 'many', 'labeled', 'nodes', 'and', 'transferring', 'the', 'information', 'of', 'the', 'spectrum', 'to', 'the', 'target', 'graph', 'with', 'fewer', 'labeled', 'nodes', 'while', 'the', 'frequency', 'content', 'of', 'the', 'class', 'label', 'function', 'can', 'be', 'identified', 'through', 'the', 'graph', 'fourier', 'transform', 'it', 'is', 'not', 'easy', 'to', 'transfer', 'the', 'fourier', 'coefficients', 'directly', 'between', 'the', 'two', 'graphs', 'since', 'no', 'onetoone', 'match', 'exists', 'between', 'the', 'fourier', 'basis', 'vectors', 'of', 'independently', 'constructed', 'graphs', 'in', 'the', 'domain', 'adaptation', 'setting', 'we', 'solve', 'this', 'problem', 'by', 'learning', 'a', 'transformation', 'between', 'the', 'fourier', 'bases', 'of', 'the', 'two', 'graphs', 'that', 'flexibly', 'aligns', 'them', 'the', 'unknown', 'class', 'label', 'function', 'on', 'the', 'target', 'graph', 'is', 'then', 'reconstructed', 'such', 'that', 'its', 'spectrum', 'matches', 'that', 'on', 'the', 'source', 'graph', 'while', 'also', 'ensuring', 'the', 'consistency', 'with', 'the', 'available', 'labels', 'the', 'proposed', 'method', 'is', 'tested', 'in', 'the', 'classification', 'of', 'image', 'online', 'product', 'review', 'and', 'social', 'network', 'data', 'sets', 'comparative', 'experiments', 'suggest', 'that', 'the', 'proposed', 'algorithm', 'performs', 'better', 'than', 'recent', 'domain', 'adaptation', 'methods', 'in', 'the', 'literature', 'in', 'most', 'settings']]
|
[-0.06548386752028598, 0.028223307515306408, -0.05918750679603807, 0.05469717238373107, -0.13889238056581737, -0.11733786952556965, 0.045934006214467325, 0.4573246648979847, -0.304218865717136, -0.3256344913189206, 0.09132618451238027, -0.2811811016066883, -0.1662272733288163, 0.17020800622634485, -0.10654144986028297, 0.0511357201793824, 0.12040609729099233, 0.10240678554465253, -0.05319826644672094, -0.23791850451239027, 0.34455454072699104, 0.012599816827013263, 0.3241930262622291, 0.007554531783013762, 0.1035408121308112, 0.011486304973841848, -0.05171445497411551, 0.0010007069342218623, -0.06646095439283621, 0.12467155119470259, 0.30151445804072224, 0.20595177560666042, 0.28864214120265164, -0.36910314924505805, -0.2349528362394462, 0.16001470435884455, 0.12843158398513202, 0.07907800829468237, -0.024463420823235774, -0.2906915561294435, 0.09866224222306555, -0.11512787619631441, 0.007455351211414205, -0.050159001307220404, 0.009721545325302129, -0.004965092374131109, -0.28068535240402503, 0.04199232129860421, 0.06486915497014228, 0.020167425676864477, -0.048544726361501256, -0.10664898327160643, -0.0038460315355006284, 0.13458777768505176, 0.03767012814414336, 0.09190903924877682, 0.0953010997741409, -0.15851111643203247, -0.12531276392528085, 0.33780884074698164, -0.02444060578819237, -0.2474858342600619, 0.180076707211713, -0.09778877678665632, -0.16689420158484997, 0.09286473390636611, 0.17686769643888703, 0.13296293470828074, -0.14277777646404005, 0.0775242734404972, -0.08443577190986785, 0.18816924808388996, 0.05604289714520907, -0.003065295494282393, 0.13374060661142054, 0.17107076175546332, 0.1004546228588539, 0.1680192863177927, -0.07301340276823753, -0.04527737874482117, -0.24846695088918375, -0.087466413301825, -0.28966484787458213, -0.04480004880917105, -0.1516906886109172, -0.18733345490081113, 0.449185946962722, 0.15933092841741575, 0.22778850520725738, 0.06851661217577794, 0.30031106837059995, 0.08499999869990268, 0.09035093757097536, 0.1199314538324993, 0.16275429015070406, 0.0789258215047909, 0.09020371966315337, -0.16772834090278307, 0.09945249819852553, 0.06384175051016584]
|
1,803.05289
|
On the Security of Some Compact Keys for McEliece Scheme
|
In this paper we study the security of the key of compact McEliece schemes
based on alternant/Goppa codes with a non-trivial permutation group, in
particular quasi-cyclic alternant codes. We show that it is possible to reduce
the key-recovery problem on the original quasi-cyclic code to the same problem
on a smaller code derived from the public key. This result is obtained thanks
to the invariant code operation which gives the subcode whose elements are
fixed by a permutation in Perm(C). The fundamental advantage is that the
invariant subcode of an alternant code is an alternant code. This approach
improves the technique of Faugere, Otmani, Tillich, Perret and Portzamparc
which uses folded codes of alternant codes obtained by using supports globally
stable by an affine map. We use a simpler approach with a unified view on
quasi-cyclic alternant codes and we treat the case of automorphisms arising
from a non affine homography. In addition, we provide an efficient algorithm to
recover the full structure of the alternant code from the structure of the
invariant code.
|
cs.IT cs.CR math.IT
|
in this paper we study the security of the key of compact mceliece schemes based on alternantgoppa codes with a nontrivial permutation group in particular quasicyclic alternant codes we show that it is possible to reduce the keyrecovery problem on the original quasicyclic code to the same problem on a smaller code derived from the public key this result is obtained thanks to the invariant code operation which gives the subcode whose elements are fixed by a permutation in permc the fundamental advantage is that the invariant subcode of an alternant code is an alternant code this approach improves the technique of faugere otmani tillich perret and portzamparc which uses folded codes of alternant codes obtained by using supports globally stable by an affine map we use a simpler approach with a unified view on quasicyclic alternant codes and we treat the case of automorphisms arising from a non affine homography in addition we provide an efficient algorithm to recover the full structure of the alternant code from the structure of the invariant code
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'security', 'of', 'the', 'key', 'of', 'compact', 'mceliece', 'schemes', 'based', 'on', 'alternantgoppa', 'codes', 'with', 'a', 'nontrivial', 'permutation', 'group', 'in', 'particular', 'quasicyclic', 'alternant', 'codes', 'we', 'show', 'that', 'it', 'is', 'possible', 'to', 'reduce', 'the', 'keyrecovery', 'problem', 'on', 'the', 'original', 'quasicyclic', 'code', 'to', 'the', 'same', 'problem', 'on', 'a', 'smaller', 'code', 'derived', 'from', 'the', 'public', 'key', 'this', 'result', 'is', 'obtained', 'thanks', 'to', 'the', 'invariant', 'code', 'operation', 'which', 'gives', 'the', 'subcode', 'whose', 'elements', 'are', 'fixed', 'by', 'a', 'permutation', 'in', 'permc', 'the', 'fundamental', 'advantage', 'is', 'that', 'the', 'invariant', 'subcode', 'of', 'an', 'alternant', 'code', 'is', 'an', 'alternant', 'code', 'this', 'approach', 'improves', 'the', 'technique', 'of', 'faugere', 'otmani', 'tillich', 'perret', 'and', 'portzamparc', 'which', 'uses', 'folded', 'codes', 'of', 'alternant', 'codes', 'obtained', 'by', 'using', 'supports', 'globally', 'stable', 'by', 'an', 'affine', 'map', 'we', 'use', 'a', 'simpler', 'approach', 'with', 'a', 'unified', 'view', 'on', 'quasicyclic', 'alternant', 'codes', 'and', 'we', 'treat', 'the', 'case', 'of', 'automorphisms', 'arising', 'from', 'a', 'non', 'affine', 'homography', 'in', 'addition', 'we', 'provide', 'an', 'efficient', 'algorithm', 'to', 'recover', 'the', 'full', 'structure', 'of', 'the', 'alternant', 'code', 'from', 'the', 'structure', 'of', 'the', 'invariant', 'code']]
|
[-0.14844165273468224, 0.010978878063506486, -0.1014888653128642, 0.05673974907442339, -0.011958410158720716, -0.19546492012729597, 0.036970003158104614, 0.3452082592667195, -0.340263104251428, -0.24310339800468836, 0.12583046152708474, -0.20414812247437691, -0.17995013054582829, 0.22166111120104529, -0.13926742827160316, 0.06333367851677171, 0.07121086728552149, 0.01964533558726033, -0.14095549594252832, -0.28933176323934867, 0.371655808200063, 0.15794113689484837, 0.26506914690202266, -0.00977996160815421, 0.10062184045499746, 0.0169412223925155, -0.07147814637752609, -0.04315234993568115, -0.15712042818329644, 0.15259072417325248, 0.23028880832798518, 0.15973844364481538, 0.17229961805551602, -0.32935009068095983, -0.18896219690877683, 0.05509317443605338, 0.11639327428723026, 0.19930330166260968, -0.05938635701150225, -0.2352776432189306, 0.1451957424461286, -0.21706991437931508, -0.06055728736883628, -0.009649411170629034, -0.032207136695975795, -0.014648929226065152, -0.2580133533882718, -0.04569183858737829, 0.09488639582972429, 0.0834110505791784, -0.025105024728793324, -0.11284122029210479, 0.006971463149860066, 0.12673979257750842, -0.020843316563976963, 0.07992928197378651, 0.030734054927376495, -0.026967947533332377, -0.11929542044782195, 0.4082934434977714, -0.056014071594466246, -0.21204213544247094, 0.12491326098063449, -0.03689039597963119, -0.1482098743167014, 0.16128449665780087, 0.18854231473837288, 0.15980986786777512, -0.08054255364171355, 0.13586883946139452, -0.14437955242107836, 0.19048508315494186, 0.03146192405579819, 0.04632996670814634, 0.13506255788478064, 0.10039966131052634, 0.04483636171551563, 0.22079048301120513, -0.03339518997709305, -0.07040046061537561, -0.2736203486197873, -0.14818415168416824, -0.1674297380353711, 0.048564322036827166, -0.08874644760273218, -0.2026745085196014, 0.4246853217264714, 0.12383273621471, 0.12157168269582223, 0.08431815727047448, 0.27892536019133024, 0.006475236115715744, 0.1392709418585965, 0.15724534114376146, 0.12664740186794635, 0.15755478897927144, -0.044060796703489724, -0.21010246614881992, 0.04404121901491406, 0.15943855708955149]
|
1,803.0529
|
Optimization of Scheduling in Wireless Ad-Hoc Networks Using Matrix
Games
|
In this paper, we present a novel application of matrix game theory for
optimization of link scheduling in wireless ad-hoc networks. Optimum scheduling
is achieved by soft coloring of network graphs. Conventional coloring schemes
are based on assignment of one color to each region or equivalently each link
is member of just one partial topology. These algorithms based on coloring are
not optimal when links are not activated with the same rate. Soft coloring,
introduced in this paper, solves this problem and provide optimal solution for
any requested link usage rate. To define the game model for optimum scheduling,
first all possible components of the graph are identified. Components are
defined as sets of the wireless links can be activated simultaneously without
suffering from mutual interference. Then by switching between components with
appropriate frequencies (usage rate) optimum scheduling is achieved. We call
this kind of scheduling as soft coloring because any links can be member of
more than one partial topology, in different time segments. To simplify this
problem, we model relationship between link rates and components selection
frequencies by a matrix game which provides a simple and helpful tool to
simplify and solve the problem. This proposed game theoretic model is solved by
fictitious playing method. Simulation results prove the efficiency of the
proposed technique compared to conventional scheduling based on coloring
|
cs.NI cs.GT eess.SP
|
in this paper we present a novel application of matrix game theory for optimization of link scheduling in wireless adhoc networks optimum scheduling is achieved by soft coloring of network graphs conventional coloring schemes are based on assignment of one color to each region or equivalently each link is member of just one partial topology these algorithms based on coloring are not optimal when links are not activated with the same rate soft coloring introduced in this paper solves this problem and provide optimal solution for any requested link usage rate to define the game model for optimum scheduling first all possible components of the graph are identified components are defined as sets of the wireless links can be activated simultaneously without suffering from mutual interference then by switching between components with appropriate frequencies usage rate optimum scheduling is achieved we call this kind of scheduling as soft coloring because any links can be member of more than one partial topology in different time segments to simplify this problem we model relationship between link rates and components selection frequencies by a matrix game which provides a simple and helpful tool to simplify and solve the problem this proposed game theoretic model is solved by fictitious playing method simulation results prove the efficiency of the proposed technique compared to conventional scheduling based on coloring
|
[['in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'application', 'of', 'matrix', 'game', 'theory', 'for', 'optimization', 'of', 'link', 'scheduling', 'in', 'wireless', 'adhoc', 'networks', 'optimum', 'scheduling', 'is', 'achieved', 'by', 'soft', 'coloring', 'of', 'network', 'graphs', 'conventional', 'coloring', 'schemes', 'are', 'based', 'on', 'assignment', 'of', 'one', 'color', 'to', 'each', 'region', 'or', 'equivalently', 'each', 'link', 'is', 'member', 'of', 'just', 'one', 'partial', 'topology', 'these', 'algorithms', 'based', 'on', 'coloring', 'are', 'not', 'optimal', 'when', 'links', 'are', 'not', 'activated', 'with', 'the', 'same', 'rate', 'soft', 'coloring', 'introduced', 'in', 'this', 'paper', 'solves', 'this', 'problem', 'and', 'provide', 'optimal', 'solution', 'for', 'any', 'requested', 'link', 'usage', 'rate', 'to', 'define', 'the', 'game', 'model', 'for', 'optimum', 'scheduling', 'first', 'all', 'possible', 'components', 'of', 'the', 'graph', 'are', 'identified', 'components', 'are', 'defined', 'as', 'sets', 'of', 'the', 'wireless', 'links', 'can', 'be', 'activated', 'simultaneously', 'without', 'suffering', 'from', 'mutual', 'interference', 'then', 'by', 'switching', 'between', 'components', 'with', 'appropriate', 'frequencies', 'usage', 'rate', 'optimum', 'scheduling', 'is', 'achieved', 'we', 'call', 'this', 'kind', 'of', 'scheduling', 'as', 'soft', 'coloring', 'because', 'any', 'links', 'can', 'be', 'member', 'of', 'more', 'than', 'one', 'partial', 'topology', 'in', 'different', 'time', 'segments', 'to', 'simplify', 'this', 'problem', 'we', 'model', 'relationship', 'between', 'link', 'rates', 'and', 'components', 'selection', 'frequencies', 'by', 'a', 'matrix', 'game', 'which', 'provides', 'a', 'simple', 'and', 'helpful', 'tool', 'to', 'simplify', 'and', 'solve', 'the', 'problem', 'this', 'proposed', 'game', 'theoretic', 'model', 'is', 'solved', 'by', 'fictitious', 'playing', 'method', 'simulation', 'results', 'prove', 'the', 'efficiency', 'of', 'the', 'proposed', 'technique', 'compared', 'to', 'conventional', 'scheduling', 'based', 'on', 'coloring']]
|
[-0.17996541931212467, 0.03648759306182943, -0.06984275553559241, 0.045433450684435835, -0.12614697401491182, -0.21699581831284367, 0.12055838943068606, 0.42359953754552276, -0.29842445792446554, -0.3288329337397799, 0.10019243166770476, -0.2197331398195115, -0.19120834624674587, 0.14612635492343004, -0.13198946928931712, 0.05124928236149686, 0.0869519480372541, 0.040278224737175655, 0.013223203312816524, -0.24553696634396682, 0.3081396610743362, 0.024470190141734252, 0.2989343456305864, 0.05082394621771397, 0.08506703954043844, 0.04398147193213816, -0.029935859839093658, 0.04386613209159719, -0.10365167091968114, 0.0927951674675569, 0.30616955292482145, 0.17216385647784, 0.27966776148378514, -0.4202686178460383, -0.21414327410972706, 0.13692522425237927, 0.14937761641679656, 0.04819539407291137, -0.015291761224601321, -0.21540958964842216, 0.15013020140830963, -0.16773199702880864, -0.04032861326106995, -0.009714427882295954, -0.03528416068595938, 0.023454768474593827, -0.30234906895946495, 0.011834189588112148, -0.002932903876803782, 0.019509329481442947, -0.03461007116312337, -0.11538580542893855, 0.03377872389937529, 0.1551699091419588, 0.012421101657986941, 0.031182230826083054, 0.08768410976107478, -0.12014939367244931, -0.20775894208021897, 0.3857053837409001, -0.004945657751953643, -0.22407040149474625, 0.13798698624742173, -0.0013261386172453383, -0.14461652143135867, 0.13394660895978489, 0.16863872012021144, 0.12871673885281845, -0.17268967960008175, 0.011702026151780523, -0.04487939018154759, 0.16304558424504617, 0.08833210664955823, 0.04615469215512944, 0.14205187493924787, 0.18743457261685934, 0.1525780995251901, 0.17300070826310848, -0.016030609987742965, -0.10735445565490821, -0.2442768627705654, -0.10998738528910039, -0.18857164580777971, 0.005182000101703708, -0.10461907689209042, -0.1102651990031314, 0.3925238500177994, 0.1317257720542729, 0.1581304965607588, 0.09127870882023961, 0.33942489504747325, 0.12832731978378922, 0.0529798725770978, 0.12240097688870179, 0.17599594919533038, 0.10434879987676014, 0.08886644892778765, -0.20107128798456303, 0.10346680086089356, 0.11518584145233035]
|
1,803.05291
|
Qualitative analysis of differential equations
|
Here I introduce basic methods of qualitative analysis of differential
equations used in mathematical biology for people with minimal mathematical
background.
|
math.GM
|
here i introduce basic methods of qualitative analysis of differential equations used in mathematical biology for people with minimal mathematical background
|
[['here', 'i', 'introduce', 'basic', 'methods', 'of', 'qualitative', 'analysis', 'of', 'differential', 'equations', 'used', 'in', 'mathematical', 'biology', 'for', 'people', 'with', 'minimal', 'mathematical', 'background']]
|
[0.030346001808842022, -0.006574315151997975, -0.07720287773935568, 0.1281976859927887, -0.1455307657874766, -0.19069366361058893, -0.015306902162375905, 0.2724408986534746, -0.25770650644387516, -0.304945384817464, 0.03009356178587214, -0.2841351375959459, -0.27083822233336313, 0.18384340108327923, -0.2028319940104016, 0.10309966112531367, 0.0675921824184202, 0.011364606342145376, -0.03379879093595913, -0.1978191590890111, 0.32592499728447627, -0.040275530446143376, 0.23485680587501043, -0.02457096108368465, 0.18141293521260932, -0.0070245954252424695, -0.15720334773262343, 0.05246810739239057, -0.27597549841517494, 0.20926066851686864, 0.4040090063852923, 0.24177629518366994, 0.2987712752960977, -0.5534948241852579, -0.20380990841381608, 0.021054368998323168, 0.13461832879554658, 0.15830673740128987, -0.0688256686996846, -0.22884074092975684, 0.033479927196389155, -0.09747732031558241, -0.157993099796364, -0.12557101461459838, 0.028657664057044757, 0.04613869488682775, -0.14955630184461674, 0.09959686973265239, 0.03290938231207076, 0.2674923358219011, -0.032294441546712606, -0.1447216977054874, 0.03861226221280439, 0.11038062885581028, 0.047004640712181016, -0.10016964375972748, 0.10654136840076674, -0.15050944756893886, -0.18090716713950747, 0.3974269993958019, -0.08455124284539904, -0.28739241648110603, 0.210659213985006, -0.07588782589439125, -0.2514383942332296, 0.08469354148421969, 0.21577130559654462, 0.09935878962278366, -0.24004453673426593, 0.09291854447552136, -0.02551579794713429, 0.15882408814061255, 0.031214127139676185, -0.019604643008538654, 0.13162056471975075, 0.2374237213461172, -0.02227349951863289, 0.015096239479524749, 0.009547119694096702, -0.16168452817059698, -0.36346875060172307, -0.15049377864315397, -0.009483352857863619, 0.0673482333409733, -0.0749136599978166, -0.2135928346819821, 0.40798411394159, 0.21181842023950248, 0.026153929354179473, -0.002315415512947809, 0.28807800866308664, 0.09942537195803154, -0.048460926505781356, -0.01546223922854378, 0.15116549356441414, 0.20756833716517403, 0.21110561427970728, -0.1617942148642171, 0.032814279021251766, 0.07821359374516067]
|
1,803.05292
|
Lyapunov exponents and partial hyperbolicity of chain control sets on
flag manifolds
|
For a right-invariant control system on a flag manifold $\mathbb{F}_{\Theta}$
of a real semisimple Lie group, we relate the $\mathfrak{a}$-Lyapunov exponents
to the Lyapunov exponents of the system over regular points. Moreover, we adapt
the concept of partial hyperbolicity from the theory of smooth dynamical
systems to control-affine systems, and we completely characterize the partially
hyperbolic chain control sets on $\mathbb{F}_{\Theta}$.
|
math.DS
|
for a rightinvariant control system on a flag manifold mathbbf_theta of a real semisimple lie group we relate the mathfrakalyapunov exponents to the lyapunov exponents of the system over regular points moreover we adapt the concept of partial hyperbolicity from the theory of smooth dynamical systems to controlaffine systems and we completely characterize the partially hyperbolic chain control sets on mathbbf_theta
|
[['for', 'a', 'rightinvariant', 'control', 'system', 'on', 'a', 'flag', 'manifold', 'mathbbf_theta', 'of', 'a', 'real', 'semisimple', 'lie', 'group', 'we', 'relate', 'the', 'mathfrakalyapunov', 'exponents', 'to', 'the', 'lyapunov', 'exponents', 'of', 'the', 'system', 'over', 'regular', 'points', 'moreover', 'we', 'adapt', 'the', 'concept', 'of', 'partial', 'hyperbolicity', 'from', 'the', 'theory', 'of', 'smooth', 'dynamical', 'systems', 'to', 'controlaffine', 'systems', 'and', 'we', 'completely', 'characterize', 'the', 'partially', 'hyperbolic', 'chain', 'control', 'sets', 'on', 'mathbbf_theta']]
|
[-0.2556188874476557, 0.0540618192372394, -0.10758834338650622, 0.035315652450161245, -0.07624611346018982, -0.1273206217427224, 0.052059201690255956, 0.3050723995507598, -0.34615899815127765, -0.14103804714174878, 0.1655848925724497, -0.2537835521848294, -0.21773372885995898, 0.25490409935471314, -0.13748595306392888, 0.0820779052105379, 0.005101617297221874, 0.08493260065382667, -0.10369576499315686, -0.24340162940066437, 0.4804547011515061, -0.08498463201625593, 0.22143697826962533, 0.004682201025044096, 0.1604440686341118, 0.0282979234972776, 0.034297993398624764, 0.05095022077800642, -0.16965506882567344, 0.10645819125809418, 0.24340616278992644, 0.07537891617815556, 0.2230117297370051, -0.3254853380073247, -0.19645440133673878, 0.160076849917271, 0.10954303023854978, 0.05970259582431152, 0.024432425704335087, -0.3447542705669485, 0.1340487030864661, -0.16296993979606136, -0.1951295558507715, -0.09407651804363483, -0.008377872861054694, 0.037992918334002125, -0.23848132769866237, 0.0032224600396022715, 0.05581225701035723, 0.1420267240088112, -0.14158391241176888, 0.0008870980035963243, -0.05960639850397048, 0.1447117964271456, -0.0682790052338407, -0.04260055337036992, 0.14626944375802473, -0.009725471809988135, -0.14489904691561542, 0.36550356730304917, -0.010106000324695146, -0.2957923359414241, 0.21029726571628246, -0.19265374258674425, -0.13989422594775155, 0.1374291105131651, 0.24868917722126532, 0.13643284618918752, -0.09424028335267613, 0.15447888831539755, -0.058579657323144636, 0.14141534806775122, 0.0054247420856223345, -0.02241774906950264, 0.12594608750579686, 0.1153885373877811, 0.18160218963849134, 0.09641119520629532, 0.04382399060153242, -0.13892767379253074, -0.28696372685953975, -0.15263950211750665, -0.13028556092417445, 0.13091645459243065, -0.10536788492930194, -0.21303818514972025, 0.42713538350553476, 0.10050405040716089, 0.18645505398383427, 0.15649198571316383, 0.22324487107709565, 0.07968188532134357, 0.020808777001140446, 0.059004319301838505, 0.14644162140080128, 0.21537137373575363, 0.041589468916283984, -0.23203944298438728, -0.028763023494132633, 0.16138880940732256]
|
1,803.05293
|
Topologically protected edge states in small Rydberg systems
|
We propose a simple setup of Rydberg atoms in a honeycomb lattice which gives
rise to topologically protected edge states. The proposal is based on the
combination of dipolar exchange interaction, which couples the internal angular
momentum and the orbital degree of freedom of a Rydberg excitation, and a
static magnetic field breaking time reversal symmetry. We demonstrate that for
realistic experimental parameters, signatures of topologically protected edge
states are present in small systems with as few as 10 atoms. Our analysis paves
the way for the experimental realization of Rydberg systems characterized by a
topological invariant, providing a promising setup for future application in
quantum information.
|
cond-mat.quant-gas physics.atom-ph quant-ph
|
we propose a simple setup of rydberg atoms in a honeycomb lattice which gives rise to topologically protected edge states the proposal is based on the combination of dipolar exchange interaction which couples the internal angular momentum and the orbital degree of freedom of a rydberg excitation and a static magnetic field breaking time reversal symmetry we demonstrate that for realistic experimental parameters signatures of topologically protected edge states are present in small systems with as few as 10 atoms our analysis paves the way for the experimental realization of rydberg systems characterized by a topological invariant providing a promising setup for future application in quantum information
|
[['we', 'propose', 'a', 'simple', 'setup', 'of', 'rydberg', 'atoms', 'in', 'a', 'honeycomb', 'lattice', 'which', 'gives', 'rise', 'to', 'topologically', 'protected', 'edge', 'states', 'the', 'proposal', 'is', 'based', 'on', 'the', 'combination', 'of', 'dipolar', 'exchange', 'interaction', 'which', 'couples', 'the', 'internal', 'angular', 'momentum', 'and', 'the', 'orbital', 'degree', 'of', 'freedom', 'of', 'a', 'rydberg', 'excitation', 'and', 'a', 'static', 'magnetic', 'field', 'breaking', 'time', 'reversal', 'symmetry', 'we', 'demonstrate', 'that', 'for', 'realistic', 'experimental', 'parameters', 'signatures', 'of', 'topologically', 'protected', 'edge', 'states', 'are', 'present', 'in', 'small', 'systems', 'with', 'as', 'few', 'as', '10', 'atoms', 'our', 'analysis', 'paves', 'the', 'way', 'for', 'the', 'experimental', 'realization', 'of', 'rydberg', 'systems', 'characterized', 'by', 'a', 'topological', 'invariant', 'providing', 'a', 'promising', 'setup', 'for', 'future', 'application', 'in', 'quantum', 'information']]
|
[-0.23215724370348764, 0.23707405529985917, -0.048528657547224345, 0.0049464168254434015, -0.05388185721343366, -0.17515205596269012, 0.06882404899833916, 0.35983288169742744, -0.2205042375913151, -0.3199109924286952, 0.005814857747205577, -0.2570411511044079, -0.1194267511176311, 0.17476059579090258, 0.04605153993764353, 0.06144954768122635, 0.04509935490830549, -0.015903542910606784, -0.04755868544915221, -0.17366254193899788, 0.28282873805124903, 0.02537113755275539, 0.2962582788264779, 0.09030562314579141, 0.0881154196223714, 0.018342086082437536, 0.07779139060979691, -0.013527096466761883, -0.11032262201445171, 0.13815029919534816, 0.2117380622353309, -0.0032008021034161064, 0.17998065337730207, -0.47264217144905407, -0.1985870875814216, 0.0112741442710579, 0.13819394993735043, 0.22938130145553046, -0.12177146320714329, -0.33932569489823045, 0.012217126444534826, -0.2008435259145852, -0.15604757900114788, -0.16570198683015933, 0.021321221112238817, -0.04443553945693736, -0.2761022314760033, 0.068673492217802, 0.04419187543408893, 0.11316374893013005, -0.0640324488386651, -0.04232249040130491, -0.05722212551866667, 0.06108673403875154, -0.027169598068467506, 0.030435388253905994, 0.13691813741684414, -0.1260516583619239, -0.19055670115087076, 0.4147827235163651, -0.07362792851342428, -0.17046088021178948, 0.19560549601642677, -0.09424917566563899, -0.10949978012717808, 0.1010901009920706, 0.13906758891366353, 0.10530218614752744, -0.07952179277542039, 0.07164965041969668, -0.047670296027768996, 0.15963509795473557, 0.021715669252988054, 0.1751002822219281, 0.28550556812339645, 0.1740201054071294, 0.10593280354601757, 0.19164181094198862, -0.0916586478401811, -0.12777891395630958, -0.29617546512701803, -0.16661104202601257, -0.24287598697190113, 0.06417365731980443, -0.031822561804002815, -0.1432774394454661, 0.4751133772187701, 0.1296220879063933, 0.23625794330298483, -0.04513197952106804, 0.28580546621494346, 0.0726416307647286, 0.0681770854829767, 0.0282051046988187, 0.21808236411981563, 0.13509251616207588, 0.03646732792345302, -0.2556315690113632, 0.012501622771052209, 0.00490661978147158]
|
1,803.05294
|
A fluctuation theorem for time-series of signal-response models with the
backward transfer entropy
|
The irreversibility of trajectories in stochastic dynamical systems is linked
to the structure of their causal representation in terms of Bayesian networks.
We consider stochastic maps resulting from a time discretization with interval
\tau of signal-response models, and we find an integral fluctuation theorem
that sets the backward transfer entropy as a lower bound to the conditional
entropy production. We apply this to a linear signal-response model providing
analytical solutions, and to a nonlinear model of receptor-ligand systems. We
show that the observational time \tau has to be fine-tuned for an efficient
detection of the irreversibility in time-series.
|
physics.data-an cond-mat.stat-mech
|
the irreversibility of trajectories in stochastic dynamical systems is linked to the structure of their causal representation in terms of bayesian networks we consider stochastic maps resulting from a time discretization with interval tau of signalresponse models and we find an integral fluctuation theorem that sets the backward transfer entropy as a lower bound to the conditional entropy production we apply this to a linear signalresponse model providing analytical solutions and to a nonlinear model of receptorligand systems we show that the observational time tau has to be finetuned for an efficient detection of the irreversibility in timeseries
|
[['the', 'irreversibility', 'of', 'trajectories', 'in', 'stochastic', 'dynamical', 'systems', 'is', 'linked', 'to', 'the', 'structure', 'of', 'their', 'causal', 'representation', 'in', 'terms', 'of', 'bayesian', 'networks', 'we', 'consider', 'stochastic', 'maps', 'resulting', 'from', 'a', 'time', 'discretization', 'with', 'interval', 'tau', 'of', 'signalresponse', 'models', 'and', 'we', 'find', 'an', 'integral', 'fluctuation', 'theorem', 'that', 'sets', 'the', 'backward', 'transfer', 'entropy', 'as', 'a', 'lower', 'bound', 'to', 'the', 'conditional', 'entropy', 'production', 'we', 'apply', 'this', 'to', 'a', 'linear', 'signalresponse', 'model', 'providing', 'analytical', 'solutions', 'and', 'to', 'a', 'nonlinear', 'model', 'of', 'receptorligand', 'systems', 'we', 'show', 'that', 'the', 'observational', 'time', 'tau', 'has', 'to', 'be', 'finetuned', 'for', 'an', 'efficient', 'detection', 'of', 'the', 'irreversibility', 'in', 'timeseries']]
|
[-0.12416074914401587, 0.07957124669486135, -0.12532713048502195, 0.10484427929504261, -0.03668243537790009, -0.10791471883374247, 0.06184650416609508, 0.3361081511010321, -0.3265230115550589, -0.2526981569398955, 0.08609368074423995, -0.2721558673098227, -0.13717953153714843, 0.1986645791342254, -0.049600949164061825, 0.08262624190550069, 0.06826437599196726, 0.047832204808233955, -0.055833993622158865, -0.19927192179661968, 0.2924841722302443, 0.0540561369829336, 0.23115816106604012, 0.02666214439181649, 0.14122689229303173, -0.02849280622274596, -0.022494383433676914, 0.02788746499513485, -0.13571829623046772, 0.14916318623653177, 0.23237274990261, 0.15304603394387023, 0.25387355862232874, -0.4061490040538566, -0.24879163614835362, 0.14764544879542474, 0.1225941762018103, 0.14013698826334914, -0.007802674774916804, -0.27201899032735705, 0.06414565264142821, -0.1605013590971274, -0.07818492980940002, -0.09609870121301133, 0.03605897005229276, 0.006366608094195931, -0.30045576740296237, 0.12633531735449724, 0.07323910596593977, 0.05148547073607618, -0.0923747529575069, -0.03892356528881557, -0.033420681649324845, 0.09838416748585141, 0.04400958998808257, 0.004515131004154682, 0.08020587102510035, -0.12542725253935752, -0.16094737179453808, 0.31864606490244674, -0.12101566059187016, -0.23223349716210243, 0.186620108194041, -0.11991037813262367, -0.15746396847724992, 0.11028443124829507, 0.22561002374930803, 0.13824978476979446, -0.18942560758311017, 0.06921611702407007, -0.022053054947292015, 0.16832170773021954, -0.005476004016414589, 0.02008958299862867, 0.17042511234021918, 0.19062277135125608, 0.07467008865799526, 0.16272821881670543, -0.09184984145305898, -0.1446975002882584, -0.3139851891568729, -0.16756660180292282, -0.1349942307463106, 0.06160334288380204, -0.11702016547140523, -0.197238855349014, 0.3667546270643266, 0.17791067277632502, 0.2200797358456505, 0.1319812843718623, 0.2636391180662476, 0.2079303560063376, 0.03500914415677211, 0.0719630690196491, 0.20230613701159553, 0.14686107663057593, 0.11672038755056505, -0.22986491592078262, 0.07764433615583195, 0.08622107505608274]
|
1,803.05295
|
High-frequency elastic moduli of two-dimensional Yukawa fluids and
solids
|
An approach to calculate high-frequency bulk and shear modului of
two-dimensional (2D) weakly screened Yukawa fluids and solids is presented.
Elastic moduli are directly related to sound velocities and other important
characteristics of the system. In this article we discuss these relations and
present exemplary calculation of the longitudinal, transverse, and
instantaneous sound velocities and derive a differential equation for the
Einstein frequency. Simple analytical results presented demonstrate good
accuracy when compared with numerical calculations. The obtained results can be
particularly useful in the context of 2D colloidal and complex (dusty) plasma
monolayers.
|
physics.plasm-ph cond-mat.soft cond-mat.stat-mech
|
an approach to calculate highfrequency bulk and shear modului of twodimensional 2d weakly screened yukawa fluids and solids is presented elastic moduli are directly related to sound velocities and other important characteristics of the system in this article we discuss these relations and present exemplary calculation of the longitudinal transverse and instantaneous sound velocities and derive a differential equation for the einstein frequency simple analytical results presented demonstrate good accuracy when compared with numerical calculations the obtained results can be particularly useful in the context of 2d colloidal and complex dusty plasma monolayers
|
[['an', 'approach', 'to', 'calculate', 'highfrequency', 'bulk', 'and', 'shear', 'modului', 'of', 'twodimensional', '2d', 'weakly', 'screened', 'yukawa', 'fluids', 'and', 'solids', 'is', 'presented', 'elastic', 'moduli', 'are', 'directly', 'related', 'to', 'sound', 'velocities', 'and', 'other', 'important', 'characteristics', 'of', 'the', 'system', 'in', 'this', 'article', 'we', 'discuss', 'these', 'relations', 'and', 'present', 'exemplary', 'calculation', 'of', 'the', 'longitudinal', 'transverse', 'and', 'instantaneous', 'sound', 'velocities', 'and', 'derive', 'a', 'differential', 'equation', 'for', 'the', 'einstein', 'frequency', 'simple', 'analytical', 'results', 'presented', 'demonstrate', 'good', 'accuracy', 'when', 'compared', 'with', 'numerical', 'calculations', 'the', 'obtained', 'results', 'can', 'be', 'particularly', 'useful', 'in', 'the', 'context', 'of', '2d', 'colloidal', 'and', 'complex', 'dusty', 'plasma', 'monolayers']]
|
[-0.10618525035122571, 0.12788669558121118, -0.057301997260251286, 0.043905481001433065, -0.07380764542714409, -0.12769670823447243, -0.04432513197610641, 0.3835625216040922, -0.22957128035056446, -0.26909778728757217, 0.044715796367002084, -0.2583758173176371, -0.17341798553293894, 0.24580947431209293, 0.012168204117029824, 0.09614570836698555, 0.06501668734784724, -0.02511367114999777, -0.06883016540466444, -0.20499878700660623, 0.2711367334553, 0.03827378927203624, 0.3003173126818855, 0.0760304406209363, 0.08866671692205431, 0.0017982727908731802, -0.05855586664730926, 0.07664812935779439, -0.2072942490800494, 0.11570203087657042, 0.2640271991106641, -0.03792028736738164, 0.15953267028595766, -0.4432078071303018, -0.21289485867094735, -0.013255937308396982, 0.14543939835604522, 0.14802959899458548, -0.04767999491456937, -0.28279057314174005, 0.04989402757390686, -0.1646498664656816, -0.16544142033925038, -0.1488959500717971, 0.01638257805271955, 0.056313935964641605, -0.24057119494587506, 0.15234384110764318, 0.0033198710899223047, 0.04536169485127966, -0.11624250439522059, -0.11912315144360511, -0.04034696394354915, 0.07106191256879475, 0.064523673623942, -0.00806613496514847, 0.15023152828317785, -0.152102339868535, -0.0455998822581023, 0.45820696655984805, -0.07716650170851094, -0.20591826118407366, 0.24950576843896313, -0.14916489278371242, -0.05765983198627667, 0.12289834496281717, 0.20490612113676238, 0.11773569125216454, -0.16547913147018256, 0.022155259119007616, -0.02948052587073661, 0.13709308062148604, 0.048662964581086744, 0.022363857087760192, 0.2166611622695042, 0.15479900243277053, -0.05040323847155694, 0.1323927715971165, -0.07143155013656487, -0.05094529932324329, -0.2951187021099031, -0.18244775402126834, -0.14673043151750512, 0.0030707978876307607, -0.11380390794938253, -0.15868182749862014, 0.37527205977264955, 0.15254727939408558, 0.1594015733812146, 0.04663561666561493, 0.3027412104015441, 0.13639911061213555, -0.025752871125207646, 0.05866788706296812, 0.29673331422711036, 0.17168575648532208, 0.11567271372262874, -0.23237372710592236, -0.019212440129511222, 0.06572082681257439]
|
1,803.05296
|
Syneruptive sequential fragmentation of pyroclasts from fractal modeling
of grain size distributions of fall deposits: The Cretaio Tephra eruption
(Ischia Island, Italy)
|
In this work we used fractal statistics in order to decipher the mechanisms
acting during explosive volcanic eruptions by studying the grain size
distribution (GSD) of natural pyroclastic-fall deposits. The method was applied
to lithic-rich proximal deposits from a stratigraphic section of the Cretaio
Tephra eruption (Ischia Island, Italy). Analyses were performed separately on
bulk material, juvenile, and lithic fraction from each pyroclastic layer.
Results highlight that the bulk material is characterized by a single scaling
regime whereas two scaling regimes, with contrasting power-law exponents, are
observed for the juvenile and the lithic fractions. On the basis of these
results, we infer that the bulk material cannot be considered as a good proxy
for deducing eruption dynamics because it is the result of mixing of fragments
belonging to the lithic and juvenile fraction, both of which underwent
different events of fragmentation governed by different mechanisms. In
addition, results from fractal analyses of the lithic fraction suggest that it
likely experienced a fragmentation eventin which the efficiency of
fragmentation was larger for the coarser fragments relative to the finer ones.
On the contrary, we interpret the different scaling regimes observed for the
juvenile fraction as due to sequential events of fragmentation in the conduit,
possibly enhanced by the presence of lithic fragments in the eruptive mixture.
In particular, collisional events generated increasing amounts of finer
particles modifying the original juvenile GSDs and determining the development
of two scaling regimes in which the finer fragments record a higher efficiency
of fragmentation relative to the coarser ones. We further suggest that in
lithic-rich proximal fall deposits possible indications about the original GSDs
of the juvenile fraction might still reside in the coarser particles fraction.
|
physics.geo-ph
|
in this work we used fractal statistics in order to decipher the mechanisms acting during explosive volcanic eruptions by studying the grain size distribution gsd of natural pyroclasticfall deposits the method was applied to lithicrich proximal deposits from a stratigraphic section of the cretaio tephra eruption ischia island italy analyses were performed separately on bulk material juvenile and lithic fraction from each pyroclastic layer results highlight that the bulk material is characterized by a single scaling regime whereas two scaling regimes with contrasting powerlaw exponents are observed for the juvenile and the lithic fractions on the basis of these results we infer that the bulk material cannot be considered as a good proxy for deducing eruption dynamics because it is the result of mixing of fragments belonging to the lithic and juvenile fraction both of which underwent different events of fragmentation governed by different mechanisms in addition results from fractal analyses of the lithic fraction suggest that it likely experienced a fragmentation eventin which the efficiency of fragmentation was larger for the coarser fragments relative to the finer ones on the contrary we interpret the different scaling regimes observed for the juvenile fraction as due to sequential events of fragmentation in the conduit possibly enhanced by the presence of lithic fragments in the eruptive mixture in particular collisional events generated increasing amounts of finer particles modifying the original juvenile gsds and determining the development of two scaling regimes in which the finer fragments record a higher efficiency of fragmentation relative to the coarser ones we further suggest that in lithicrich proximal fall deposits possible indications about the original gsds of the juvenile fraction might still reside in the coarser particles fraction
|
[['in', 'this', 'work', 'we', 'used', 'fractal', 'statistics', 'in', 'order', 'to', 'decipher', 'the', 'mechanisms', 'acting', 'during', 'explosive', 'volcanic', 'eruptions', 'by', 'studying', 'the', 'grain', 'size', 'distribution', 'gsd', 'of', 'natural', 'pyroclasticfall', 'deposits', 'the', 'method', 'was', 'applied', 'to', 'lithicrich', 'proximal', 'deposits', 'from', 'a', 'stratigraphic', 'section', 'of', 'the', 'cretaio', 'tephra', 'eruption', 'ischia', 'island', 'italy', 'analyses', 'were', 'performed', 'separately', 'on', 'bulk', 'material', 'juvenile', 'and', 'lithic', 'fraction', 'from', 'each', 'pyroclastic', 'layer', 'results', 'highlight', 'that', 'the', 'bulk', 'material', 'is', 'characterized', 'by', 'a', 'single', 'scaling', 'regime', 'whereas', 'two', 'scaling', 'regimes', 'with', 'contrasting', 'powerlaw', 'exponents', 'are', 'observed', 'for', 'the', 'juvenile', 'and', 'the', 'lithic', 'fractions', 'on', 'the', 'basis', 'of', 'these', 'results', 'we', 'infer', 'that', 'the', 'bulk', 'material', 'can', 'not', 'be', 'considered', 'as', 'a', 'good', 'proxy', 'for', 'deducing', 'eruption', 'dynamics', 'because', 'it', 'is', 'the', 'result', 'of', 'mixing', 'of', 'fragments', 'belonging', 'to', 'the', 'lithic', 'and', 'juvenile', 'fraction', 'both', 'of', 'which', 'underwent', 'different', 'events', 'of', 'fragmentation', 'governed', 'by', 'different', 'mechanisms', 'in', 'addition', 'results', 'from', 'fractal', 'analyses', 'of', 'the', 'lithic', 'fraction', 'suggest', 'that', 'it', 'likely', 'experienced', 'a', 'fragmentation', 'eventin', 'which', 'the', 'efficiency', 'of', 'fragmentation', 'was', 'larger', 'for', 'the', 'coarser', 'fragments', 'relative', 'to', 'the', 'finer', 'ones', 'on', 'the', 'contrary', 'we', 'interpret', 'the', 'different', 'scaling', 'regimes', 'observed', 'for', 'the', 'juvenile', 'fraction', 'as', 'due', 'to', 'sequential', 'events', 'of', 'fragmentation', 'in', 'the', 'conduit', 'possibly', 'enhanced', 'by', 'the', 'presence', 'of', 'lithic', 'fragments', 'in', 'the', 'eruptive', 'mixture', 'in', 'particular', 'collisional', 'events', 'generated', 'increasing', 'amounts', 'of', 'finer', 'particles', 'modifying', 'the', 'original', 'juvenile', 'gsds', 'and', 'determining', 'the', 'development', 'of', 'two', 'scaling', 'regimes', 'in', 'which', 'the', 'finer', 'fragments', 'record', 'a', 'higher', 'efficiency', 'of', 'fragmentation', 'relative', 'to', 'the', 'coarser', 'ones', 'we', 'further', 'suggest', 'that', 'in', 'lithicrich', 'proximal', 'fall', 'deposits', 'possible', 'indications', 'about', 'the', 'original', 'gsds', 'of', 'the', 'juvenile', 'fraction', 'might', 'still', 'reside', 'in', 'the', 'coarser', 'particles', 'fraction']]
|
[-0.06819929722326704, 0.19890308187306197, -0.09737763944206362, 0.09497993396442142, -0.007483844572194055, -0.053846078151534395, 0.056031492801840395, 0.33099037398616127, -0.24210608727046515, -0.31734409943787845, 0.07451754658010583, -0.27540018472027045, -0.09171144240905635, 0.18311783357204817, -0.039039931317206324, 0.013198832756022684, 0.06648473258287381, -0.03701610772430036, -0.024547040279885746, -0.21645032079295265, 0.2901020469412961, 0.09289823680702557, 0.265578534084268, 0.02818120292989732, 0.04827273774569323, -0.062218303840930175, -0.03898332416187528, 0.0028259182985139078, -0.13907000148008639, 0.06542698257423715, 0.19546969955289462, 0.07789216165486319, 0.22991534335780822, -0.4322933988773435, -0.20332646933266563, 0.06996894907626569, 0.16928799668602673, 0.03624477207581664, -0.025825557594829733, -0.24179626294976564, 0.07506613416340041, -0.17189238596512577, -0.113204957828235, 0.009170645580623662, 0.031514335408578176, 0.039224424350683976, -0.24217845025196644, 0.13175581546251525, 0.05903006609999331, 0.04726847600223772, -0.08406702044927633, -0.12675036211407303, -0.09668877353515166, 0.13409709487621427, 0.09227946712316051, 0.007315612148446458, 0.20484952617853558, -0.13680394480949679, -0.06322872967355034, 0.37164776529511606, -0.02077284281853156, -0.11329063413612585, 0.2385682795492643, -0.20223277455552174, -0.14029818430653476, 0.2001736134304144, 0.17151394405609016, 0.08810363091328366, -0.14064646271202, -0.042325697001237894, -0.02034564898443906, 0.16281307970815834, 0.08803635128750213, 0.012686720014539705, 0.2030495081604576, 0.18304356209268047, -0.020918621292458812, 0.15426020578620786, -0.10916138130462046, -0.11926403519517191, -0.24526914470452507, -0.13848785174227174, -0.12438298516489889, 0.021025799836894912, -0.09107148516834931, -0.14777191588150787, 0.35429682871763885, 0.12760297223986108, 0.2382197021725268, 0.0056683584309724375, 0.22833984355284204, 0.057080802252173206, 0.11783311449685588, 0.03943811947251216, 0.23885833404769966, 0.0939261806668169, 0.11552975011824727, -0.2121602696726361, 0.17297005553440686, 0.06125255709090388]
|
1,803.05297
|
A quantitative analysis of the 2017 Honduran election and the argument
used to defend its outcome
|
The Honduran incumbent president and his administration recently declared
victory in an election riddled with irregularities and indicators of fraud.
Perhaps most curious, however, was a numerical anomaly: the primary challenger
carried a very significant lead of five percentage points more than half way
through the election but was ultimately defeated by the incumbent. The
incumbent (Hernandez) offered a plausible explanation for the surprising
turnaround in the ballots: his popularity is greater in remote areas of the
country but votes from remote areas were not counted until later in the
election. Here, we mathematically formalize this argument, which we will call
the Hernandez conjecture, and employ the resulting formulae together with
geodemographic data from Honduras to quantitatively assess the conjectures
veracity. When the departamentos were analyzed individually, three
sparsely-populated departamentos (of 18 total) showed small but non-negligible
probability of the conjectures veracity; however, when the country was analyzed
as a whole, the overall probability of the conjectures veracity was calculated
to be less than 0.0001 under a wide range of different assumptions. Results of
our three-pronged analysis, taken together, indicate a negligible probability
of a fair win by the incumbent.
|
stat.AP
|
the honduran incumbent president and his administration recently declared victory in an election riddled with irregularities and indicators of fraud perhaps most curious however was a numerical anomaly the primary challenger carried a very significant lead of five percentage points more than half way through the election but was ultimately defeated by the incumbent the incumbent hernandez offered a plausible explanation for the surprising turnaround in the ballots his popularity is greater in remote areas of the country but votes from remote areas were not counted until later in the election here we mathematically formalize this argument which we will call the hernandez conjecture and employ the resulting formulae together with geodemographic data from honduras to quantitatively assess the conjectures veracity when the departamentos were analyzed individually three sparselypopulated departamentos of 18 total showed small but nonnegligible probability of the conjectures veracity however when the country was analyzed as a whole the overall probability of the conjectures veracity was calculated to be less than 00001 under a wide range of different assumptions results of our threepronged analysis taken together indicate a negligible probability of a fair win by the incumbent
|
[['the', 'honduran', 'incumbent', 'president', 'and', 'his', 'administration', 'recently', 'declared', 'victory', 'in', 'an', 'election', 'riddled', 'with', 'irregularities', 'and', 'indicators', 'of', 'fraud', 'perhaps', 'most', 'curious', 'however', 'was', 'a', 'numerical', 'anomaly', 'the', 'primary', 'challenger', 'carried', 'a', 'very', 'significant', 'lead', 'of', 'five', 'percentage', 'points', 'more', 'than', 'half', 'way', 'through', 'the', 'election', 'but', 'was', 'ultimately', 'defeated', 'by', 'the', 'incumbent', 'the', 'incumbent', 'hernandez', 'offered', 'a', 'plausible', 'explanation', 'for', 'the', 'surprising', 'turnaround', 'in', 'the', 'ballots', 'his', 'popularity', 'is', 'greater', 'in', 'remote', 'areas', 'of', 'the', 'country', 'but', 'votes', 'from', 'remote', 'areas', 'were', 'not', 'counted', 'until', 'later', 'in', 'the', 'election', 'here', 'we', 'mathematically', 'formalize', 'this', 'argument', 'which', 'we', 'will', 'call', 'the', 'hernandez', 'conjecture', 'and', 'employ', 'the', 'resulting', 'formulae', 'together', 'with', 'geodemographic', 'data', 'from', 'honduras', 'to', 'quantitatively', 'assess', 'the', 'conjectures', 'veracity', 'when', 'the', 'departamentos', 'were', 'analyzed', 'individually', 'three', 'sparselypopulated', 'departamentos', 'of', '18', 'total', 'showed', 'small', 'but', 'nonnegligible', 'probability', 'of', 'the', 'conjectures', 'veracity', 'however', 'when', 'the', 'country', 'was', 'analyzed', 'as', 'a', 'whole', 'the', 'overall', 'probability', 'of', 'the', 'conjectures', 'veracity', 'was', 'calculated', 'to', 'be', 'less', 'than', '00001', 'under', 'a', 'wide', 'range', 'of', 'different', 'assumptions', 'results', 'of', 'our', 'threepronged', 'analysis', 'taken', 'together', 'indicate', 'a', 'negligible', 'probability', 'of', 'a', 'fair', 'win', 'by', 'the', 'incumbent']]
|
[-0.10862695752272014, 0.07244178549199642, -0.10881849980936759, 0.10720191689153366, -0.07151736281712584, -0.17854961746370415, 0.15077296856611488, 0.3045805660001734, -0.17453618126331186, -0.3460564157079823, 0.11155930164837861, -0.3037267124745995, -0.11883924559460962, 0.18378267979080026, -0.17182040033752427, 0.011227272699318109, 0.07136798475714609, 0.04638763152300704, -0.0013841381716731198, -0.3467554523818753, 0.25932646552374694, 0.09888028456296592, 0.2823155076731056, 0.08249282423390654, 0.04090091805123191, -0.013973111017821307, -0.08307128197440061, 0.010422857345659585, -0.09900827816423567, 0.09526146962033476, 0.28119349857184656, 0.17872421433501703, 0.3483239591798999, -0.41282559280846526, -0.15480637693414115, 0.09874060329169354, 0.11360455797211688, 0.06595449088039225, -0.017853025440764763, -0.31543720123622027, 0.08813149349285877, -0.21604304586382791, -0.1379752363225216, -0.0052596622950990095, 0.0647764630954374, 0.013887993798387004, -0.20530083030213248, 0.06320194292933068, 0.0016736854764229474, 0.09343678173285357, -0.06266151138277536, -0.1289600331428396, -0.03479649797878801, 0.16004374325132237, 0.10681761616098889, 0.011126766832331245, 0.09131052600030592, -0.11899236361570856, -0.1290358799674055, 0.36927232252842285, 0.010686512582345223, -0.10056930245771845, 0.1460327830795637, -0.16024391576404967, -0.14272849042321525, 0.11866600617248425, 0.09981427534812075, 0.07504288494128754, -0.1436832748077384, -0.021602494986715383, -0.0793929915317399, 0.1749771187320989, 0.13370227584874328, -0.04311926466727849, 0.20033930317762702, 0.10334703832351787, 0.047455192259687154, 0.09562946382952346, -0.07810551471221336, -0.09852586072037883, -0.2236448396647842, -0.141505216435096, -0.14953113845605553, 0.04978636658900196, -0.06448103348516926, -0.09660731514736531, 0.38141886742516634, 0.1283853859105272, 0.16523428035421886, 0.035512494094505465, 0.26627522710720725, 0.054800533914918646, 0.059954843180064846, 0.07500249959159123, 0.25383380011725115, 0.05855491133107938, 0.12532753652087125, -0.13776330765894548, 0.17590520597239806, -0.0005696683544366755]
|
1,803.05298
|
Dynamics of distorted skyrmions in strained chiral magnets
|
In this work, we study the microscopic dynamics of distorted skyrmions in
strained chiral magnets [K. Shibata et al., Nat. Nanotech. 10, 589 (2015)]
under gradient magnetic field or electric current by Landau-Lifshitz-Gilbert
simulations of the anisotropic spin model. It is observed that the dynamical
responses are also anisotropic, and the velocities of the distorted skyrmions
are periodically dependent on the directions of the external stimuli.
Furthermore, in addition to the uniform motion, our work also demonstrates
anti-phase harmonic vibrations of the two skyrmions in nanostripes, and the
frequencies are mainly determined by the exchange anisotropy. The simulated
results are well explained by Thiele theory, which may provide useful
information in understanding the dynamics of the distorted skyrmions in
strained chiral magnets.
|
physics.app-ph cond-mat.mes-hall
|
in this work we study the microscopic dynamics of distorted skyrmions in strained chiral magnets k shibata et al nat nanotech 10 589 2015 under gradient magnetic field or electric current by landaulifshitzgilbert simulations of the anisotropic spin model it is observed that the dynamical responses are also anisotropic and the velocities of the distorted skyrmions are periodically dependent on the directions of the external stimuli furthermore in addition to the uniform motion our work also demonstrates antiphase harmonic vibrations of the two skyrmions in nanostripes and the frequencies are mainly determined by the exchange anisotropy the simulated results are well explained by thiele theory which may provide useful information in understanding the dynamics of the distorted skyrmions in strained chiral magnets
|
[['in', 'this', 'work', 'we', 'study', 'the', 'microscopic', 'dynamics', 'of', 'distorted', 'skyrmions', 'in', 'strained', 'chiral', 'magnets', 'k', 'shibata', 'et', 'al', 'nat', 'nanotech', '10', '589', '2015', 'under', 'gradient', 'magnetic', 'field', 'or', 'electric', 'current', 'by', 'landaulifshitzgilbert', 'simulations', 'of', 'the', 'anisotropic', 'spin', 'model', 'it', 'is', 'observed', 'that', 'the', 'dynamical', 'responses', 'are', 'also', 'anisotropic', 'and', 'the', 'velocities', 'of', 'the', 'distorted', 'skyrmions', 'are', 'periodically', 'dependent', 'on', 'the', 'directions', 'of', 'the', 'external', 'stimuli', 'furthermore', 'in', 'addition', 'to', 'the', 'uniform', 'motion', 'our', 'work', 'also', 'demonstrates', 'antiphase', 'harmonic', 'vibrations', 'of', 'the', 'two', 'skyrmions', 'in', 'nanostripes', 'and', 'the', 'frequencies', 'are', 'mainly', 'determined', 'by', 'the', 'exchange', 'anisotropy', 'the', 'simulated', 'results', 'are', 'well', 'explained', 'by', 'thiele', 'theory', 'which', 'may', 'provide', 'useful', 'information', 'in', 'understanding', 'the', 'dynamics', 'of', 'the', 'distorted', 'skyrmions', 'in', 'strained', 'chiral', 'magnets']]
|
[-0.18009525650470962, 0.22973727494798846, -0.03891249495695849, 0.0019433508268328476, -0.06842032513107921, -0.060448655245069906, 0.0010059774065100146, 0.4299292688059514, -0.247102516726209, -0.3122167325460306, 0.043346247714028126, -0.2792983952199765, -0.16475690439625904, 0.1895803905847925, 0.014590169394724682, 0.003987364135071879, -0.03258152782237615, -0.019572014712154116, -0.013455472683312646, -0.24267903092073, 0.2278150961902298, 0.03090043502981912, 0.31636923918744825, 0.04421815706453225, 0.03633710490463332, 0.0044705389433952625, 0.04769428018251526, 0.04869308034110753, -0.16444219925401962, 0.08373283978826443, 0.17635365743495401, -0.10362787611141312, 0.16153583528481608, -0.4963059609633733, -0.21352454939032675, -0.030050705087783396, 0.1320488839868273, 0.17933063962893775, -0.06630460150085664, -0.3497755312299753, 0.07413868609907441, -0.12135983308868818, -0.14793191141387846, -0.13115012030437834, 0.021002757131144953, 0.0737762845819816, -0.23748776130378246, 0.1488620359942004, 0.13138929642589006, 0.0973580884899883, -0.13504288190609362, -0.10227660044691846, -0.06944318112657695, 0.03609444176039628, 0.04629087223018687, 0.08126007080494167, 0.17521695610990778, -0.11429773347994282, -0.15402998640125648, 0.36501945376006856, -0.031712989438302266, -0.1654739999563002, 0.13108661007823147, -0.16606047079654135, -0.08644875333659717, 0.09697486434444846, 0.15833727248990145, 0.13382562636168766, -0.15642737452948435, 0.08081548940676615, -0.020881724001870293, 0.12535059445759006, 0.06743878321569474, 0.00557454703013092, 0.2622778876283832, 0.13991997457399477, -0.020557089288886943, 0.1279552592895925, -0.09139599739650234, -0.09906780449377724, -0.21526741178956296, -0.0838036985121301, -0.2173726417612834, 0.03866400503645056, -0.07467645003253282, -0.11730464919638194, 0.4038515213350231, 0.17474245849603665, 0.15112203401971425, -0.0803143817131774, 0.253301721596785, 0.05784045648093137, 0.024399888029963266, 0.06497232502585919, 0.3067096407204622, 0.1738716436408796, 0.15978449821609575, -0.28322421852499247, 0.022146930666182372, -0.004672176788606849]
|
1,803.05299
|
Joint Modelling of Location, Scale and Skewness Parameters of the Skew
Laplace Normal Distribution
|
In this article, we propose joint location, scale and skewness models of the
skew Laplace normal (SLN) distribution as an alternative model for joint
modelling location, scale and skewness models of the skew-t-normal (STN)
distribution when the data set contains both asymmetric and heavy-tailed
observations. We obtain the maximum likelihood (ML) estimators for the
parameters of the joint location, scale and skewness models of the SLN
distribution using the expectation-maximization (EM) algorithm. The performance
of the proposed model is demonstrated by a simulation study and a real data
example.
|
math.ST stat.TH
|
in this article we propose joint location scale and skewness models of the skew laplace normal sln distribution as an alternative model for joint modelling location scale and skewness models of the skewtnormal stn distribution when the data set contains both asymmetric and heavytailed observations we obtain the maximum likelihood ml estimators for the parameters of the joint location scale and skewness models of the sln distribution using the expectationmaximization em algorithm the performance of the proposed model is demonstrated by a simulation study and a real data example
|
[['in', 'this', 'article', 'we', 'propose', 'joint', 'location', 'scale', 'and', 'skewness', 'models', 'of', 'the', 'skew', 'laplace', 'normal', 'sln', 'distribution', 'as', 'an', 'alternative', 'model', 'for', 'joint', 'modelling', 'location', 'scale', 'and', 'skewness', 'models', 'of', 'the', 'skewtnormal', 'stn', 'distribution', 'when', 'the', 'data', 'set', 'contains', 'both', 'asymmetric', 'and', 'heavytailed', 'observations', 'we', 'obtain', 'the', 'maximum', 'likelihood', 'ml', 'estimators', 'for', 'the', 'parameters', 'of', 'the', 'joint', 'location', 'scale', 'and', 'skewness', 'models', 'of', 'the', 'sln', 'distribution', 'using', 'the', 'expectationmaximization', 'em', 'algorithm', 'the', 'performance', 'of', 'the', 'proposed', 'model', 'is', 'demonstrated', 'by', 'a', 'simulation', 'study', 'and', 'a', 'real', 'data', 'example']]
|
[-0.0576930603181774, 0.0014286071192063073, -0.11323693647864275, 0.11763750393980775, -0.07530368858186359, -0.13276569894250398, 0.02089993960478089, 0.3847599485889077, -0.2696687516714023, -0.33606393078596075, 0.11884064530948474, -0.25225649270313705, -0.1549548476680436, 0.15580010241088035, -0.05020437279844456, 0.09139347655846822, 0.03223511281380938, 0.013025009454312649, -0.06072046036239375, -0.2017893249020827, 0.3027122440636793, 0.11905244263735684, 0.3752923823723739, -0.026521579119038175, 0.12180824122465723, 0.029107151066207072, -0.06954804616874423, -0.016644173105966976, -0.14713244791544805, 0.11815154921284622, 0.1636767646602328, 0.19117979282005268, 0.22153814316896553, -0.3477291609372266, -0.21472317472481253, 0.14980062510056252, 0.12759419047374235, 0.05374240407995372, -0.024372355398637326, -0.2826856325105341, 0.03432934709020297, -0.20383161238648675, -0.10298642509786243, -0.05198999249842018, 0.001982474027582529, 0.057036621736849404, -0.346529083379375, 0.12396945096869869, 0.033602230145003305, 0.0681835709203204, -0.045775240895719355, -0.15811963339166885, 0.0020632284973875026, 0.08008526531689726, 0.05246381574331529, -0.038731954993140374, 0.0979172833834706, -0.16132995671432582, -0.10071708251383495, 0.32465276738036086, -0.0769202130031772, -0.23225047848907046, 0.09030349220847711, -0.13089122287188235, -0.12593614466128533, 0.06559094003486363, 0.2248017848469317, 0.1122886503845538, -0.14326092721289155, 0.09418741665153489, -0.06904272353064946, 0.13444788933900947, -0.030771276469088414, -0.06574731423858214, 0.19323134546390397, 0.16670494621079837, 0.02926893584133888, 0.14167752918067641, -0.22721441011526622, -0.09537217424737966, -0.30301257326606323, -0.11638047817078503, -0.22129362380259077, -0.040589072593403136, -0.18574666598496234, -0.184321033900646, 0.439448489299552, 0.20907152861631897, 0.24789883645082061, 0.14443063343589363, 0.31971651181282307, 0.133189050330078, 0.00891865087165074, 0.09873708806910807, 0.1115953961006281, 0.10450977412190034, 0.03707639151252806, -0.18296147632645443, 0.12913182110324586, -0.00015567900316620415]
|
1,803.053
|
Accelerating infall and rotational spin-up in the hot molecular core
G31.41+0.31
|
As part of our effort to search for circumstellar disks around high-mass
stellar objects, we observed the well-known core G31.41+0.31 with ALMA at 1.4
mm with an angular resolution of~0.22" (~1700 au). The dust continuum emission
has been resolved into two cores namely Main and NE. The Main core, which has
the stronger emission and is the more chemically rich, has a diameter of ~5300
au, and is associated with two free-free continuum sources. The Main core looks
featureless and homogeneous in dust continuum emission and does not present any
hint of fragmentation. Each transition of CH3CN and CH3OCHO, both ground and
vibrationally excited, as well as those of CH3CN isotopologues, shows a clear
velocity gradient along the NE-SW direction, with velocity linearly increasing
with distance from the center, consistent with solid-body rotation. However,
when comparing the velocity field of transitions with different upper level
energies, the rotation velocity increases with increasing energy of the
transition, which suggests that the rotation speeds up towards the center.
Spectral lines towards the dust continuum peak show an inverse P-Cygni profile
that supports the existence of infall in the core. The infall velocity
increases with the energy of the transition suggesting that the infall is
accelerating towards the center of the core, consistent with gravitational
collapse. Despite the monolithic appearance of the Main core, the presence of
red-shifted absorption, the existence of two embedded free-free sources at the
center, and the rotational spin-up are consistent with an unstable core
undergoing fragmentation with infall and differential rotation due to
conservation of angular momentum. Therefore, the most likely explanation for
the monolithic morphology is that the large opacity of the dust emission
prevents the detection of any inhomogeneity in the core.
|
astro-ph.SR astro-ph.GA
|
as part of our effort to search for circumstellar disks around highmass stellar objects we observed the wellknown core g3141031 with alma at 14 mm with an angular resolution of022 1700 au the dust continuum emission has been resolved into two cores namely main and ne the main core which has the stronger emission and is the more chemically rich has a diameter of 5300 au and is associated with two freefree continuum sources the main core looks featureless and homogeneous in dust continuum emission and does not present any hint of fragmentation each transition of ch3cn and ch3ocho both ground and vibrationally excited as well as those of ch3cn isotopologues shows a clear velocity gradient along the nesw direction with velocity linearly increasing with distance from the center consistent with solidbody rotation however when comparing the velocity field of transitions with different upper level energies the rotation velocity increases with increasing energy of the transition which suggests that the rotation speeds up towards the center spectral lines towards the dust continuum peak show an inverse pcygni profile that supports the existence of infall in the core the infall velocity increases with the energy of the transition suggesting that the infall is accelerating towards the center of the core consistent with gravitational collapse despite the monolithic appearance of the main core the presence of redshifted absorption the existence of two embedded freefree sources at the center and the rotational spinup are consistent with an unstable core undergoing fragmentation with infall and differential rotation due to conservation of angular momentum therefore the most likely explanation for the monolithic morphology is that the large opacity of the dust emission prevents the detection of any inhomogeneity in the core
|
[['as', 'part', 'of', 'our', 'effort', 'to', 'search', 'for', 'circumstellar', 'disks', 'around', 'highmass', 'stellar', 'objects', 'we', 'observed', 'the', 'wellknown', 'core', 'g3141031', 'with', 'alma', 'at', '14', 'mm', 'with', 'an', 'angular', 'resolution', 'of022', '1700', 'au', 'the', 'dust', 'continuum', 'emission', 'has', 'been', 'resolved', 'into', 'two', 'cores', 'namely', 'main', 'and', 'ne', 'the', 'main', 'core', 'which', 'has', 'the', 'stronger', 'emission', 'and', 'is', 'the', 'more', 'chemically', 'rich', 'has', 'a', 'diameter', 'of', '5300', 'au', 'and', 'is', 'associated', 'with', 'two', 'freefree', 'continuum', 'sources', 'the', 'main', 'core', 'looks', 'featureless', 'and', 'homogeneous', 'in', 'dust', 'continuum', 'emission', 'and', 'does', 'not', 'present', 'any', 'hint', 'of', 'fragmentation', 'each', 'transition', 'of', 'ch3cn', 'and', 'ch3ocho', 'both', 'ground', 'and', 'vibrationally', 'excited', 'as', 'well', 'as', 'those', 'of', 'ch3cn', 'isotopologues', 'shows', 'a', 'clear', 'velocity', 'gradient', 'along', 'the', 'nesw', 'direction', 'with', 'velocity', 'linearly', 'increasing', 'with', 'distance', 'from', 'the', 'center', 'consistent', 'with', 'solidbody', 'rotation', 'however', 'when', 'comparing', 'the', 'velocity', 'field', 'of', 'transitions', 'with', 'different', 'upper', 'level', 'energies', 'the', 'rotation', 'velocity', 'increases', 'with', 'increasing', 'energy', 'of', 'the', 'transition', 'which', 'suggests', 'that', 'the', 'rotation', 'speeds', 'up', 'towards', 'the', 'center', 'spectral', 'lines', 'towards', 'the', 'dust', 'continuum', 'peak', 'show', 'an', 'inverse', 'pcygni', 'profile', 'that', 'supports', 'the', 'existence', 'of', 'infall', 'in', 'the', 'core', 'the', 'infall', 'velocity', 'increases', 'with', 'the', 'energy', 'of', 'the', 'transition', 'suggesting', 'that', 'the', 'infall', 'is', 'accelerating', 'towards', 'the', 'center', 'of', 'the', 'core', 'consistent', 'with', 'gravitational', 'collapse', 'despite', 'the', 'monolithic', 'appearance', 'of', 'the', 'main', 'core', 'the', 'presence', 'of', 'redshifted', 'absorption', 'the', 'existence', 'of', 'two', 'embedded', 'freefree', 'sources', 'at', 'the', 'center', 'and', 'the', 'rotational', 'spinup', 'are', 'consistent', 'with', 'an', 'unstable', 'core', 'undergoing', 'fragmentation', 'with', 'infall', 'and', 'differential', 'rotation', 'due', 'to', 'conservation', 'of', 'angular', 'momentum', 'therefore', 'the', 'most', 'likely', 'explanation', 'for', 'the', 'monolithic', 'morphology', 'is', 'that', 'the', 'large', 'opacity', 'of', 'the', 'dust', 'emission', 'prevents', 'the', 'detection', 'of', 'any', 'inhomogeneity', 'in', 'the', 'core']]
|
[-0.07839648596934255, 0.13131705667663227, -0.03659171554488096, 0.010419165859358353, -0.05839155862238585, -0.07140225298670039, -0.027231025968661955, 0.4264768473705963, -0.20258587981735585, -0.29925805580589854, 0.06733060207814305, -0.26560379722106614, 0.013680929906274142, 0.12036713779711965, 0.018574097116020552, -0.02934366253964407, 0.03773761836223696, -0.05569794940713205, -0.04210176617560679, -0.11204111579838291, 0.34315691237060125, 0.09494434727760227, 0.19814971965786657, 0.05088963751566776, 0.059798710649473626, -0.12424753275128049, -0.0366975653767504, -0.008674835996996415, -0.09172980865972166, 0.08396823182375285, 0.1921408374221963, 0.09814135601234483, 0.21487224609100897, -0.36422801971958396, -0.22148489839634286, 0.052845509478560926, 0.19619981731663932, 0.09547798289884732, -0.06243526319541209, -0.28453003837187824, 0.05008904326282311, -0.14334221211784895, -0.21894278571565162, 0.0736969556757494, 0.09497431462197646, 0.03206314489596703, -0.18584571361108765, 0.1421315822194804, 0.07005296399727007, 0.08278927569136661, -0.12738801866786129, -0.1370832696704096, -0.12958084253692312, 0.06824154745258407, 0.04816803332875695, 0.07962959042654308, 0.1985900638314585, -0.11641445837980299, -0.05739060889341329, 0.41690536044750426, -0.11180884452258939, -0.01781825883203725, 0.25880151224044856, -0.21299475437569382, -0.15795951870519243, 0.25501233138340085, 0.10557735783391092, 0.08464763768940445, -0.06431839111400972, -0.03608642302294213, -0.012134904804100332, 0.22701283391369018, 0.08396141938191201, 0.025863391488561767, 0.3323027884979781, 0.1246729897784494, 0.07656764366884569, 0.13500170755024443, -0.23369900340953711, -0.10606917527814706, -0.26688336223780523, -0.14007631172650706, -0.13571837615107366, 0.06118299286580734, -0.11924724213144816, -0.13445528339341348, 0.32090241874878606, 0.08908804956366095, 0.24454917576676644, 0.04992846310743245, 0.3282531983921664, 0.11370402221412708, 0.11605916934806788, 0.15058615065482037, 0.3056489480675705, 0.19236745903791305, 0.1198315814782849, -0.27229100785937094, 0.08158403194199006, -0.03045863498843749]
|
1,803.05301
|
Constructing balanced equations of motion for particles in general
relativity: the null gauge case
|
We present a convenient null gauge for the construction of the balanced
equations of motion. This null gauge has the property that the asymptotic
structure is intimately related to the interior one; in particular there is a
strong connexion between the field equation and the balanced equations of
motion. We present the balanced equations of motion in second order of the
acceleration. We solve the required components of the field equation at their
respective required orders, $G^2$ and $G^3$. We indicate how this approach can
be extended to higher orders.
|
gr-qc
|
we present a convenient null gauge for the construction of the balanced equations of motion this null gauge has the property that the asymptotic structure is intimately related to the interior one in particular there is a strong connexion between the field equation and the balanced equations of motion we present the balanced equations of motion in second order of the acceleration we solve the required components of the field equation at their respective required orders g2 and g3 we indicate how this approach can be extended to higher orders
|
[['we', 'present', 'a', 'convenient', 'null', 'gauge', 'for', 'the', 'construction', 'of', 'the', 'balanced', 'equations', 'of', 'motion', 'this', 'null', 'gauge', 'has', 'the', 'property', 'that', 'the', 'asymptotic', 'structure', 'is', 'intimately', 'related', 'to', 'the', 'interior', 'one', 'in', 'particular', 'there', 'is', 'a', 'strong', 'connexion', 'between', 'the', 'field', 'equation', 'and', 'the', 'balanced', 'equations', 'of', 'motion', 'we', 'present', 'the', 'balanced', 'equations', 'of', 'motion', 'in', 'second', 'order', 'of', 'the', 'acceleration', 'we', 'solve', 'the', 'required', 'components', 'of', 'the', 'field', 'equation', 'at', 'their', 'respective', 'required', 'orders', 'g2', 'and', 'g3', 'we', 'indicate', 'how', 'this', 'approach', 'can', 'be', 'extended', 'to', 'higher', 'orders']]
|
[-0.17639713506731722, 0.11324607602631052, -0.09279717911138302, 0.06806472275509602, -0.11175715635634131, -0.05745688701669375, -0.013407485802761382, 0.32990704463380904, -0.26090084846234984, -0.2697030792840653, 0.08127779584449146, -0.23640656247735023, -0.15763097056705092, 0.14066811855882405, -0.029507880782087645, 0.02350746655008859, 0.03478888313079046, 0.07972054951824248, -0.09242198161211693, -0.25900553490242195, 0.3523346208139426, 0.007153771062278085, 0.2416732023987505, 0.04361001770529482, 0.16430585111180943, -0.03289442233637803, -0.0025646848500602776, 0.05686714188713166, -0.14438919430483818, 0.15078606213339502, 0.1822164543904364, 0.09034371865499351, 0.22492991058000675, -0.42993574106237953, -0.15912636171528396, 0.1076577535416517, 0.1310381889860663, 0.11234083914508422, -0.009696426703723976, -0.24592664937178293, 0.09942621073892546, -0.1440793529773752, -0.20975029430507372, -0.08194485096674826, -0.006821407571745416, 0.014852669048640464, -0.23472334377066645, 0.09382695589835445, 0.0974019290982849, -0.006992587385078271, -0.08174909871175057, -0.06322530214674771, -0.008249146434374981, 0.10745425800948093, 0.07671250451304433, 0.03137539134153889, 0.02983332190455662, -0.15637297875040934, -0.1038325428406501, 0.42175848708074126, -0.08376138899863388, -0.24999100694225895, 0.19220757192104226, -0.1728166955212752, -0.12558750868257548, 0.1265467607157512, 0.13597267841299374, 0.16266265797118346, -0.13602728885663157, 0.10272069326989973, -0.0017708049052291446, 0.12278087637904618, 0.07482894712852108, -0.012834034461735023, 0.1925039141283681, 0.12711643362159117, 0.08802215669800514, 0.14343671197873645, -0.03862451202650037, -0.10112545173615217, -0.36175897683327396, -0.1831465305569711, -0.10525462963204417, 0.061393799343042905, -0.11291466569495646, -0.1491210717552652, 0.4024652181645959, 0.19375384736211143, 0.1448577880859375, -0.005946200356508295, 0.28019693043186433, 0.20128953545871708, 0.059503264472328336, 0.0828809914075666, 0.24709839516629775, 0.19026604223375518, 0.07144310192929373, -0.27026993509466085, 0.009255226913632618, 0.10292968138431509]
|
1,803.05302
|
Cosmological models with a hybrid scale factor in an extended gravity
theory
|
A general formalism to investigate Bianchi type $VI_h$ universes is developed
in an extended theory of gravity. A minimally coupled geometry and matter field
is considered with a rescaled function of $f(R,T)$ substituted in place of the
Ricci scalar $R$ in the geometrical action. Dynamical aspects of the models are
discussed by using a hybrid scale factor that behaves as power law in an
initial epoch and as an exponential form at late epoch. The power law behaviour
and the exponential behaviour appear as two extreme cases of the present model.
|
physics.gen-ph
|
a general formalism to investigate bianchi type vi_h universes is developed in an extended theory of gravity a minimally coupled geometry and matter field is considered with a rescaled function of frt substituted in place of the ricci scalar r in the geometrical action dynamical aspects of the models are discussed by using a hybrid scale factor that behaves as power law in an initial epoch and as an exponential form at late epoch the power law behaviour and the exponential behaviour appear as two extreme cases of the present model
|
[['a', 'general', 'formalism', 'to', 'investigate', 'bianchi', 'type', 'vi_h', 'universes', 'is', 'developed', 'in', 'an', 'extended', 'theory', 'of', 'gravity', 'a', 'minimally', 'coupled', 'geometry', 'and', 'matter', 'field', 'is', 'considered', 'with', 'a', 'rescaled', 'function', 'of', 'frt', 'substituted', 'in', 'place', 'of', 'the', 'ricci', 'scalar', 'r', 'in', 'the', 'geometrical', 'action', 'dynamical', 'aspects', 'of', 'the', 'models', 'are', 'discussed', 'by', 'using', 'a', 'hybrid', 'scale', 'factor', 'that', 'behaves', 'as', 'power', 'law', 'in', 'an', 'initial', 'epoch', 'and', 'as', 'an', 'exponential', 'form', 'at', 'late', 'epoch', 'the', 'power', 'law', 'behaviour', 'and', 'the', 'exponential', 'behaviour', 'appear', 'as', 'two', 'extreme', 'cases', 'of', 'the', 'present', 'model']]
|
[-0.14019208760665997, 0.13080484987985583, -0.13766654609999324, 0.08405211761978884, -0.052706288071451605, -0.17438111789294283, -0.0840392752261423, 0.28308564237226824, -0.21793169450976854, -0.27374825560088667, 0.0842292445793666, -0.24330119707795617, -0.13457476421371922, 0.1423103586171887, -0.016921646442714627, -0.02039010756249939, -0.06276598365230301, 0.06515190523158718, -0.032975853356829544, -0.23435461847623298, 0.33527609457359087, 0.0953814875651765, 0.2424674655034483, -0.034845621580933475, 0.08744036666230186, -0.05238588595414882, -0.01492079801775597, 0.07927608840145695, -0.15467135497449788, 0.026537064762253846, 0.1769851888215331, 0.10466366685967851, 0.24995163033056267, -0.42784575842689354, -0.2433145888825203, 0.08656942572158116, 0.1375249316045953, 0.06600791399346685, -0.05492392923314493, -0.2289270270452067, 0.04453341953026561, -0.2032336258523903, -0.21027399459789803, -0.024137372330117684, 0.03590705920814199, -0.006672247282260067, -0.2661434203836617, 0.12415836909581181, 0.05439383717820529, 0.019013590771694677, -0.07679258576839916, -0.05476709469451804, 0.009981164376118354, 0.0535405893697516, 0.07480295508419378, -0.00029922633401148924, 0.13342442146533137, -0.1738632963458588, -0.0736176907353533, 0.408233934706384, -0.16474197435852878, -0.16176990668447996, 0.1152735451584334, -0.11441496032505082, -0.14215085164715463, 0.03949871186453562, 0.1429924269790178, 0.15710092034362957, -0.16301684486065673, 0.17454730145502734, 0.032998460687819746, 0.1489228016522887, 0.05227998237299559, 0.023781666914026695, 0.24823082817697917, 0.1252962513059214, -0.0019865006113752395, 0.15338683538752926, -0.007811971366978609, -0.14716376750576463, -0.3634793594029251, -0.14342404121459, -0.15133914026012132, 0.09743108015998707, -0.16241242212021423, -0.18528294907166407, 0.3880107180896, 0.045835320182799635, 0.17755847619232404, 0.06284331593785313, 0.22009235876868224, 0.14360315347177355, 0.02311370108317543, 0.06817934146598058, 0.24740843852511146, 0.1506500120970656, 0.13702342134982265, -0.2067242173847722, -0.012612129526422615, 0.08636123795256756]
|
1,803.05303
|
Has the density of sources of gamma-ray burts been constant over the
last ten billion years ?
|
A generic tired-light mechanism is examined in which a photon, like any
particle moving in a medium, experiences friction, that is, a force resisting
its motion. If the velocity of light is assumed to be constant, this hypothesis
yields a Hubble-like law which is also a consequence of the Rh = ct cosmology.
Herein, it is used for estimating matter density as a function of redshift,
allowing to show that the density of sources of long gamma-ray bursts appears
to be nearly constant, up to z $\approx$ 4. Assuming that the later is a fair
probe of the former, this means that matter density has been roughly constant
over the last ten billion years, implying that, at least over this period,
matter has been in an overall state of equilibrium.
|
physics.gen-ph
|
a generic tiredlight mechanism is examined in which a photon like any particle moving in a medium experiences friction that is a force resisting its motion if the velocity of light is assumed to be constant this hypothesis yields a hubblelike law which is also a consequence of the rh ct cosmology herein it is used for estimating matter density as a function of redshift allowing to show that the density of sources of long gammaray bursts appears to be nearly constant up to z approx 4 assuming that the later is a fair probe of the former this means that matter density has been roughly constant over the last ten billion years implying that at least over this period matter has been in an overall state of equilibrium
|
[['a', 'generic', 'tiredlight', 'mechanism', 'is', 'examined', 'in', 'which', 'a', 'photon', 'like', 'any', 'particle', 'moving', 'in', 'a', 'medium', 'experiences', 'friction', 'that', 'is', 'a', 'force', 'resisting', 'its', 'motion', 'if', 'the', 'velocity', 'of', 'light', 'is', 'assumed', 'to', 'be', 'constant', 'this', 'hypothesis', 'yields', 'a', 'hubblelike', 'law', 'which', 'is', 'also', 'a', 'consequence', 'of', 'the', 'rh', 'ct', 'cosmology', 'herein', 'it', 'is', 'used', 'for', 'estimating', 'matter', 'density', 'as', 'a', 'function', 'of', 'redshift', 'allowing', 'to', 'show', 'that', 'the', 'density', 'of', 'sources', 'of', 'long', 'gammaray', 'bursts', 'appears', 'to', 'be', 'nearly', 'constant', 'up', 'to', 'z', 'approx', '4', 'assuming', 'that', 'the', 'later', 'is', 'a', 'fair', 'probe', 'of', 'the', 'former', 'this', 'means', 'that', 'matter', 'density', 'has', 'been', 'roughly', 'constant', 'over', 'the', 'last', 'ten', 'billion', 'years', 'implying', 'that', 'at', 'least', 'over', 'this', 'period', 'matter', 'has', 'been', 'in', 'an', 'overall', 'state', 'of', 'equilibrium']]
|
[-0.11080924462271645, 0.18428271987699713, -0.1636383318659929, 0.03632414308033682, -0.0420791776778624, -0.11464161693674418, 0.01820845849331028, 0.36867270769565835, -0.24796161503087036, -0.31604549269978854, 0.0788330453684438, -0.2608768511130366, -0.05876491428894359, 0.1973253103079592, -0.004088850684695004, -0.0023547434144249083, -0.0032098352576988612, 0.07160851186459032, -0.04472608546364976, -0.2693943012245866, 0.26448444162798657, 0.09765904180140617, 0.20927719950997234, 0.04661696165567264, 0.14012407003937996, -0.040994433509258105, -0.015469312571510744, 0.03650424838816935, -0.09801143781394137, 0.023733060817819004, 0.19802803817645523, 0.09115295237211814, 0.29092032017633895, -0.34142341793067177, -0.26122920548673284, 0.14469992689600633, 0.1470246173426971, 0.09786188330811758, -0.05618185780278241, -0.21085575486212074, 0.10170545815147257, -0.2054965483501207, -0.16320568906475408, 0.01733075182958481, 0.09825996332982367, -0.004825901155280628, -0.24897330113174032, 0.1268381074965704, 0.012474599191485795, -0.011903714821782223, -0.059772841272290884, -0.05877468605749598, 0.002304007909296788, 0.06474700045425358, 0.09789136613091064, 0.1128643750205867, 0.14083799721434886, -0.14324014487517492, -0.06120679350281062, 0.4122553659213144, -0.09763099659277602, -0.12134945238110169, 0.16703763857480253, -0.1633052684785437, -0.11415110477571223, 0.16589152534102458, 0.12955351488469818, 0.10650786816787973, -0.1609729201525681, 0.06710510367397653, -0.0717777879565752, 0.23219656112582185, 0.082583734325256, -0.014478142795607794, 0.2532255465612393, 0.16779532639829572, 0.09447031152838942, 0.0656634792162091, -0.1077956231563648, -0.057005674509663685, -0.29300901568458637, -0.18112003110356398, -0.18577994130075323, 0.10712579751834851, -0.0767686706705943, -0.1378079807171923, 0.36320842345526744, 0.08566611586499584, 0.19376897457409506, 0.031054172226292795, 0.2866612370811807, 0.1262337086828743, 0.08206836223864455, 0.1000806392394295, 0.2983006376253311, 0.12829842305265712, 0.08269244779890418, -0.15183717706204616, 0.08033487231781085, -0.010519656072941053]
|
1,803.05304
|
Gaussian Equation to Describe the Percent of Shadow Length in Satellite
Image
|
The shadow is a separated feature in the satellite images specially high
resolution images. It may be looked as a problem when it causes a loss in the
ground ray response to the shaded area, and may be, from other view, considered
as an indication to the height of the bodies or buildings, when it hidden due
to top view of the satellite image usually. The location of the object on the
earth affects its shadow length, direction and darkness. The ostensible sun
path in the sky also affects the shadow length and direction, it is depending
on the change of the rotation axis of planet about its center during the year.
And it is clear that the shadow is changing with the sun transmission in the
day times. The sun location needs complex equations, because there are several
angles describing its location with taking into consideration the location of
the shaded body on the earth spatially the latitude, and the shadow direction
and length depend on the sun location so it need more equations. Some
engineering purposes, and some engineers and designer can not process these
complex astronomy equations every time they need to calculate the shadow effect
on the urban region or garden for examples, or other architectural purposes, it
is unpractical process to estimate the shadow direction and length for civil
from these equation. So, we derived in this study a high accurate empirical
Gaussian equation to find shadow length percent in the limits of the study area
depends on single parameter which is the number of day during the year, and
calculating the percent of shadow, so we can calculate the shadow length
percent accurately in any day number by the suggested equation after knowing
the real building height.
|
physics.pop-ph physics.app-ph
|
the shadow is a separated feature in the satellite images specially high resolution images it may be looked as a problem when it causes a loss in the ground ray response to the shaded area and may be from other view considered as an indication to the height of the bodies or buildings when it hidden due to top view of the satellite image usually the location of the object on the earth affects its shadow length direction and darkness the ostensible sun path in the sky also affects the shadow length and direction it is depending on the change of the rotation axis of planet about its center during the year and it is clear that the shadow is changing with the sun transmission in the day times the sun location needs complex equations because there are several angles describing its location with taking into consideration the location of the shaded body on the earth spatially the latitude and the shadow direction and length depend on the sun location so it need more equations some engineering purposes and some engineers and designer can not process these complex astronomy equations every time they need to calculate the shadow effect on the urban region or garden for examples or other architectural purposes it is unpractical process to estimate the shadow direction and length for civil from these equation so we derived in this study a high accurate empirical gaussian equation to find shadow length percent in the limits of the study area depends on single parameter which is the number of day during the year and calculating the percent of shadow so we can calculate the shadow length percent accurately in any day number by the suggested equation after knowing the real building height
|
[['the', 'shadow', 'is', 'a', 'separated', 'feature', 'in', 'the', 'satellite', 'images', 'specially', 'high', 'resolution', 'images', 'it', 'may', 'be', 'looked', 'as', 'a', 'problem', 'when', 'it', 'causes', 'a', 'loss', 'in', 'the', 'ground', 'ray', 'response', 'to', 'the', 'shaded', 'area', 'and', 'may', 'be', 'from', 'other', 'view', 'considered', 'as', 'an', 'indication', 'to', 'the', 'height', 'of', 'the', 'bodies', 'or', 'buildings', 'when', 'it', 'hidden', 'due', 'to', 'top', 'view', 'of', 'the', 'satellite', 'image', 'usually', 'the', 'location', 'of', 'the', 'object', 'on', 'the', 'earth', 'affects', 'its', 'shadow', 'length', 'direction', 'and', 'darkness', 'the', 'ostensible', 'sun', 'path', 'in', 'the', 'sky', 'also', 'affects', 'the', 'shadow', 'length', 'and', 'direction', 'it', 'is', 'depending', 'on', 'the', 'change', 'of', 'the', 'rotation', 'axis', 'of', 'planet', 'about', 'its', 'center', 'during', 'the', 'year', 'and', 'it', 'is', 'clear', 'that', 'the', 'shadow', 'is', 'changing', 'with', 'the', 'sun', 'transmission', 'in', 'the', 'day', 'times', 'the', 'sun', 'location', 'needs', 'complex', 'equations', 'because', 'there', 'are', 'several', 'angles', 'describing', 'its', 'location', 'with', 'taking', 'into', 'consideration', 'the', 'location', 'of', 'the', 'shaded', 'body', 'on', 'the', 'earth', 'spatially', 'the', 'latitude', 'and', 'the', 'shadow', 'direction', 'and', 'length', 'depend', 'on', 'the', 'sun', 'location', 'so', 'it', 'need', 'more', 'equations', 'some', 'engineering', 'purposes', 'and', 'some', 'engineers', 'and', 'designer', 'can', 'not', 'process', 'these', 'complex', 'astronomy', 'equations', 'every', 'time', 'they', 'need', 'to', 'calculate', 'the', 'shadow', 'effect', 'on', 'the', 'urban', 'region', 'or', 'garden', 'for', 'examples', 'or', 'other', 'architectural', 'purposes', 'it', 'is', 'unpractical', 'process', 'to', 'estimate', 'the', 'shadow', 'direction', 'and', 'length', 'for', 'civil', 'from', 'these', 'equation', 'so', 'we', 'derived', 'in', 'this', 'study', 'a', 'high', 'accurate', 'empirical', 'gaussian', 'equation', 'to', 'find', 'shadow', 'length', 'percent', 'in', 'the', 'limits', 'of', 'the', 'study', 'area', 'depends', 'on', 'single', 'parameter', 'which', 'is', 'the', 'number', 'of', 'day', 'during', 'the', 'year', 'and', 'calculating', 'the', 'percent', 'of', 'shadow', 'so', 'we', 'can', 'calculate', 'the', 'shadow', 'length', 'percent', 'accurately', 'in', 'any', 'day', 'number', 'by', 'the', 'suggested', 'equation', 'after', 'knowing', 'the', 'real', 'building', 'height']]
|
[-0.09132969592032007, 0.11915499362233373, -0.05674047463231024, 0.07560192217219014, -0.09502180638872468, -0.07886261978574453, 0.0389691428448242, 0.3801454254283026, -0.2866787558059731, -0.35360117168276994, 0.1572200313497354, -0.29023406538488933, -0.13370725444185075, 0.21685635230866335, -0.08430428496323948, 0.004238519050958073, 0.053216299740200285, 0.08616095943910422, -0.05644129066642234, -0.2394609385862972, 0.26530010487769856, 0.09929961598646722, 0.24820590658675967, 0.05914560934201315, 0.0863265870488646, 0.038922855588152554, -0.04317566781835599, -0.002141598446784166, -0.09521961645052848, 0.07500172749045703, 0.20046169624851426, 0.13708544387593358, 0.22007103622716187, -0.426402887127123, -0.21580756638745807, 0.08915635798946532, 0.1289334408183973, 0.09188362373851253, -0.006285752990108647, -0.28429392650771135, 0.06788101392152875, -0.12691989461907247, -0.17624094054331754, 0.05166403969126807, 0.06931949008030518, -0.00888905270063277, -0.18969481862287457, 0.03228401203086336, 0.03610430974568917, 0.06356479028434932, -0.07264094230553625, -0.08798611668811049, -0.05161250050619893, 0.17292337882457262, 0.0958418470136694, 0.035280102737559445, 0.18108997583121486, -0.13768070675241967, -0.03636955820900506, 0.39846676818187327, -0.016922959424523515, -0.19381910810761993, 0.15826687831256805, -0.18821329895467354, -0.0838268063390316, 0.13734493449603688, 0.17370132302250332, 0.11892688199925418, -0.11090179556178537, 0.049358873953486544, -0.0397428411564475, 0.1910580340915903, 0.10295496174569779, -0.0034325826998939895, 0.2792188349257054, 0.13178952183231152, 0.10918546783373892, 0.10251897960105028, -0.18633969901893951, -0.0911995716680655, -0.256624995276281, -0.14740200437013967, -0.16366553011131013, 0.03793321035842295, -0.09897371148799845, -0.13878492909953843, 0.4031208160366313, 0.16821266202583476, 0.20526781353031512, -0.01325207859485922, 0.3137473158423913, 0.11462356941695023, 0.1005843293029853, 0.07219255323253203, 0.2367908382105304, 0.04381355215158034, 0.11083004217111718, -0.19186727435299458, 0.10998435398093313, 0.04744109188273244]
|
1,803.05305
|
Resonance Capture and Dynamics of 3-Planet Systems
|
We present a series of dynamical maps for fictitious 3-planets systems in
initially circular coplanar orbits. These maps have unveiled a rich resonant
structure involving two or three planets, as well as indicating possible
migration routes from secular to double resonances or pure 3-planet
commensurabilities. These structures are then compared to the present-day
orbital architecture of observed resonant chains. In a second part of the paper
we describe N-body simulations of type-I migration. Depending on the orbital
decay timescale, we show that 3-planet systems may be trapped in different
combinations of independent commensurabilities: (i) double resonances, (ii)
intersection between a 2-planet and a first-order 3-planet resonance, and (iii)
simultaneous libration in two first-order 3-planet resonances. These latter
outcomes are found for slow migrations, while double resonances are almost
always the final outcome in high-density disks. Finally, we discuss an
application to the TRAPPIST-1 system. We find that, for low migration rates and
planetary masses of the order of the estimated values, most 3-planet
sub-systems are able to reach the observed double resonances after following
evolutionary routes defined by pure 3-planet resonances. The final orbital
configuration shows resonance offsets comparable with present-day values
without the need of tidal dissipation. For the 8/5 resonance proposed to
dominate the dynamics of the two inner planets, we find little evidence of its
dynamical significance; instead, we propose that this relation between mean
motions could be a consequence of the interaction between a pure 3-planet
resonance and a 2-planet commensurability between planets c and d.
|
astro-ph.EP
|
we present a series of dynamical maps for fictitious 3planets systems in initially circular coplanar orbits these maps have unveiled a rich resonant structure involving two or three planets as well as indicating possible migration routes from secular to double resonances or pure 3planet commensurabilities these structures are then compared to the presentday orbital architecture of observed resonant chains in a second part of the paper we describe nbody simulations of typei migration depending on the orbital decay timescale we show that 3planet systems may be trapped in different combinations of independent commensurabilities i double resonances ii intersection between a 2planet and a firstorder 3planet resonance and iii simultaneous libration in two firstorder 3planet resonances these latter outcomes are found for slow migrations while double resonances are almost always the final outcome in highdensity disks finally we discuss an application to the trappist1 system we find that for low migration rates and planetary masses of the order of the estimated values most 3planet subsystems are able to reach the observed double resonances after following evolutionary routes defined by pure 3planet resonances the final orbital configuration shows resonance offsets comparable with presentday values without the need of tidal dissipation for the 85 resonance proposed to dominate the dynamics of the two inner planets we find little evidence of its dynamical significance instead we propose that this relation between mean motions could be a consequence of the interaction between a pure 3planet resonance and a 2planet commensurability between planets c and d
|
[['we', 'present', 'a', 'series', 'of', 'dynamical', 'maps', 'for', 'fictitious', '3planets', 'systems', 'in', 'initially', 'circular', 'coplanar', 'orbits', 'these', 'maps', 'have', 'unveiled', 'a', 'rich', 'resonant', 'structure', 'involving', 'two', 'or', 'three', 'planets', 'as', 'well', 'as', 'indicating', 'possible', 'migration', 'routes', 'from', 'secular', 'to', 'double', 'resonances', 'or', 'pure', '3planet', 'commensurabilities', 'these', 'structures', 'are', 'then', 'compared', 'to', 'the', 'presentday', 'orbital', 'architecture', 'of', 'observed', 'resonant', 'chains', 'in', 'a', 'second', 'part', 'of', 'the', 'paper', 'we', 'describe', 'nbody', 'simulations', 'of', 'typei', 'migration', 'depending', 'on', 'the', 'orbital', 'decay', 'timescale', 'we', 'show', 'that', '3planet', 'systems', 'may', 'be', 'trapped', 'in', 'different', 'combinations', 'of', 'independent', 'commensurabilities', 'i', 'double', 'resonances', 'ii', 'intersection', 'between', 'a', '2planet', 'and', 'a', 'firstorder', '3planet', 'resonance', 'and', 'iii', 'simultaneous', 'libration', 'in', 'two', 'firstorder', '3planet', 'resonances', 'these', 'latter', 'outcomes', 'are', 'found', 'for', 'slow', 'migrations', 'while', 'double', 'resonances', 'are', 'almost', 'always', 'the', 'final', 'outcome', 'in', 'highdensity', 'disks', 'finally', 'we', 'discuss', 'an', 'application', 'to', 'the', 'trappist1', 'system', 'we', 'find', 'that', 'for', 'low', 'migration', 'rates', 'and', 'planetary', 'masses', 'of', 'the', 'order', 'of', 'the', 'estimated', 'values', 'most', '3planet', 'subsystems', 'are', 'able', 'to', 'reach', 'the', 'observed', 'double', 'resonances', 'after', 'following', 'evolutionary', 'routes', 'defined', 'by', 'pure', '3planet', 'resonances', 'the', 'final', 'orbital', 'configuration', 'shows', 'resonance', 'offsets', 'comparable', 'with', 'presentday', 'values', 'without', 'the', 'need', 'of', 'tidal', 'dissipation', 'for', 'the', '85', 'resonance', 'proposed', 'to', 'dominate', 'the', 'dynamics', 'of', 'the', 'two', 'inner', 'planets', 'we', 'find', 'little', 'evidence', 'of', 'its', 'dynamical', 'significance', 'instead', 'we', 'propose', 'that', 'this', 'relation', 'between', 'mean', 'motions', 'could', 'be', 'a', 'consequence', 'of', 'the', 'interaction', 'between', 'a', 'pure', '3planet', 'resonance', 'and', 'a', '2planet', 'commensurability', 'between', 'planets', 'c', 'and', 'd']]
|
[-0.18313381963888237, 0.15541605524075672, -0.055890363966485106, 0.09056760727165615, -0.02960449496534724, -0.10609374060594742, 0.05888320846215683, 0.35661408038336284, -0.23441129658103782, -0.31802348220294496, 0.05643679211280836, -0.2526156283750472, -0.14075289787649808, 0.1796664073764081, 0.0019762768175445467, 0.03132186706744071, 0.12097247623292408, -0.0013115536257901404, -0.06149090330857956, -0.2059827746209094, 0.31214822853642354, -0.014482379121304748, 0.11019083754024861, -0.012678480759940025, 0.025836379112522435, -0.029887987754259063, 0.045301927622018685, -0.04111558109910852, -0.1678117995115498, 0.0614175279250735, 0.21482143655861635, 0.07373982364889567, 0.21493025538773392, -0.40744349507364375, -0.13910618555137372, 0.07423433107342646, 0.20269092308155384, 0.11006040470305284, -0.03258169369854362, -0.26270107676305, 0.06088856712028564, -0.1884235618187182, -0.14742756263777448, -0.05582529546278735, 0.07141456153453234, 0.024093590003305514, -0.2828707113592272, 0.10711440445301702, 0.09078260546984492, 0.09518525142402175, -0.11931970725387679, -0.13613985048795874, -0.07333816698449383, 0.09408529661455561, 0.01948066982608962, -0.04917278137604096, 0.16038636920644517, -0.06317374173806135, -0.1451588305214562, 0.3644463671820171, -0.09705010664403386, -0.13094211544796644, 0.26942051475237394, -0.21374604971256542, -0.11030376679965306, 0.14483275929237735, 0.18058876150070755, 0.1072211993229856, -0.14727191950580718, -0.0013610540888502251, 0.026243118479488844, 0.16502076582646513, 0.0965093752120558, 0.041022060136030235, 0.3162217744351196, 0.12045355245141859, 0.03709635048324848, 0.08687516108031822, -0.1451089147910341, -0.13762502806811933, -0.24286129317493235, -0.11585594681568488, -0.09862604593843162, 0.01658714635402383, -0.05298550967023059, -0.14411373593915539, 0.3610728088033247, 0.09354716954363816, 0.2465065977120974, 0.007574114148097345, 0.2606370278767845, 0.0997584849291193, 0.08628916515675131, 0.05587972867130545, 0.3284512155775325, 0.12365092607458163, 0.04160031080563893, -0.2778571725515116, 0.05361800495933472, -0.02819405510426914]
|
1,803.05306
|
On the Development of Testing Tool for a Satellite Gyro Sensor
|
Attitude determination and control system (ADCS) in a satellite takes an
important role to make sure that the satellite mission will be achieved. In the
development phase, the ADCS is required to pass whole testing levels, including
component level verification. As an important component in the ADCS, the gyro
sensors must meet in that requirement. However, the testing tool for the
component level test often rely on another satellite component. Since the
testing line is not directly connected to the gyro, some failures between those
components will be hard to be identified. This paper proposes a testing tool
that operates without involves any other satellite components. The proposed
testing tool consists of software and hardware part.
|
physics.ins-det astro-ph.IM
|
attitude determination and control system adcs in a satellite takes an important role to make sure that the satellite mission will be achieved in the development phase the adcs is required to pass whole testing levels including component level verification as an important component in the adcs the gyro sensors must meet in that requirement however the testing tool for the component level test often rely on another satellite component since the testing line is not directly connected to the gyro some failures between those components will be hard to be identified this paper proposes a testing tool that operates without involves any other satellite components the proposed testing tool consists of software and hardware part
|
[['attitude', 'determination', 'and', 'control', 'system', 'adcs', 'in', 'a', 'satellite', 'takes', 'an', 'important', 'role', 'to', 'make', 'sure', 'that', 'the', 'satellite', 'mission', 'will', 'be', 'achieved', 'in', 'the', 'development', 'phase', 'the', 'adcs', 'is', 'required', 'to', 'pass', 'whole', 'testing', 'levels', 'including', 'component', 'level', 'verification', 'as', 'an', 'important', 'component', 'in', 'the', 'adcs', 'the', 'gyro', 'sensors', 'must', 'meet', 'in', 'that', 'requirement', 'however', 'the', 'testing', 'tool', 'for', 'the', 'component', 'level', 'test', 'often', 'rely', 'on', 'another', 'satellite', 'component', 'since', 'the', 'testing', 'line', 'is', 'not', 'directly', 'connected', 'to', 'the', 'gyro', 'some', 'failures', 'between', 'those', 'components', 'will', 'be', 'hard', 'to', 'be', 'identified', 'this', 'paper', 'proposes', 'a', 'testing', 'tool', 'that', 'operates', 'without', 'involves', 'any', 'other', 'satellite', 'components', 'the', 'proposed', 'testing', 'tool', 'consists', 'of', 'software', 'and', 'hardware', 'part']]
|
[-0.1595070451851292, 0.0718207065327643, -0.09713000122554086, 0.0206365990422361, -0.10377118582756997, -0.1691304296656544, -0.002415120869610009, 0.358012892305851, -0.21924757508657358, -0.3358752710327249, 0.16290999929609323, -0.21372324821603453, -0.10546039068942954, 0.2544554945820108, -0.11717584704305849, 0.06364612704030527, 0.1101070219642836, 0.008311640958960071, 0.007812391256046449, -0.23870393682415758, 0.2710177216092767, 0.13341222966796365, 0.29454346441519286, -0.02427312481851349, 0.08746534965707567, 0.03070678255432446, -0.04574113323529861, -0.021604687525441164, -0.0199562491204139, 0.09092504092781194, 0.33548712821783705, 0.17321827432044365, 0.3133905663251363, -0.44425511588181915, -0.17378316992283638, 0.10758976208082208, 0.14006098667922398, 0.032290897589048434, -0.01905981662125198, -0.2589234483853817, 0.10758743950181865, -0.17624778090574747, -0.14754547795345044, -0.028395830942638988, -0.017414195547362083, -0.022864850585204387, -0.27379373538484475, -0.03068496845261162, 0.08124064886541074, 0.08034903947304099, -0.03623162835820353, -0.0773729376027216, 0.019879255500011916, 0.2197610086175324, 0.036515651963217634, 0.02703226590177831, 0.17186851532937125, -0.10055955273605048, -0.0768298032083388, 0.4049521100321977, -0.017377880801334334, -0.18528559000295555, 0.20708108514723977, -0.0658258588227909, -0.21442993344931766, 0.08877125121492507, 0.17003629939502168, 0.01165258064304061, -0.18127707499561124, 0.03942093842237353, 0.08043486209875293, 0.2688885015266915, 0.008738238471841183, 0.004004398661922535, 0.24853522332128267, 0.17200981397864185, 0.1243836648453876, 0.11319654137207244, -0.14236263926983972, -0.025371487250407065, -0.2587167726115099, -0.19488531469913392, -0.18412023256452562, -0.015347680355826641, -0.018377985099505167, -0.14456310002976258, 0.35405463243609875, 0.1813695839252965, 0.14328569789609774, 0.01635130860939108, 0.40847005675835857, 0.10322549365007254, 0.12270327936055074, 0.07177363669274953, 0.27721702701393075, 0.07451093670458468, 0.07916809341083442, -0.15472214437463191, 0.1219146353200656, 0.027358890208014255]
|
1,803.05307
|
Deep CNN based feature extractor for text-prompted speaker recognition
|
Deep learning is still not a very common tool in speaker verification field.
We study deep convolutional neural network performance in the text-prompted
speaker verification task. The prompted passphrase is segmented into word
states - i.e. digits -to test each digit utterance separately. We train a
single high-level feature extractor for all states and use cosine similarity
metric for scoring. The key feature of our network is the Max-Feature-Map
activation function, which acts as an embedded feature selector. By using
multitask learning scheme to train the high-level feature extractor we were
able to surpass the classic baseline systems in terms of quality and achieved
impressive results for such a novice approach, getting 2.85% EER on the RSR2015
evaluation set. Fusion of the proposed and the baseline systems improves this
result.
|
eess.AS cs.CL cs.LG cs.SD stat.ML
|
deep learning is still not a very common tool in speaker verification field we study deep convolutional neural network performance in the textprompted speaker verification task the prompted passphrase is segmented into word states ie digits to test each digit utterance separately we train a single highlevel feature extractor for all states and use cosine similarity metric for scoring the key feature of our network is the maxfeaturemap activation function which acts as an embedded feature selector by using multitask learning scheme to train the highlevel feature extractor we were able to surpass the classic baseline systems in terms of quality and achieved impressive results for such a novice approach getting 285 eer on the rsr2015 evaluation set fusion of the proposed and the baseline systems improves this result
|
[['deep', 'learning', 'is', 'still', 'not', 'a', 'very', 'common', 'tool', 'in', 'speaker', 'verification', 'field', 'we', 'study', 'deep', 'convolutional', 'neural', 'network', 'performance', 'in', 'the', 'textprompted', 'speaker', 'verification', 'task', 'the', 'prompted', 'passphrase', 'is', 'segmented', 'into', 'word', 'states', 'ie', 'digits', 'to', 'test', 'each', 'digit', 'utterance', 'separately', 'we', 'train', 'a', 'single', 'highlevel', 'feature', 'extractor', 'for', 'all', 'states', 'and', 'use', 'cosine', 'similarity', 'metric', 'for', 'scoring', 'the', 'key', 'feature', 'of', 'our', 'network', 'is', 'the', 'maxfeaturemap', 'activation', 'function', 'which', 'acts', 'as', 'an', 'embedded', 'feature', 'selector', 'by', 'using', 'multitask', 'learning', 'scheme', 'to', 'train', 'the', 'highlevel', 'feature', 'extractor', 'we', 'were', 'able', 'to', 'surpass', 'the', 'classic', 'baseline', 'systems', 'in', 'terms', 'of', 'quality', 'and', 'achieved', 'impressive', 'results', 'for', 'such', 'a', 'novice', 'approach', 'getting', '285', 'eer', 'on', 'the', 'rsr2015', 'evaluation', 'set', 'fusion', 'of', 'the', 'proposed', 'and', 'the', 'baseline', 'systems', 'improves', 'this', 'result']]
|
[-0.03284432988948538, -0.05124259350202465, -0.07912231132286252, 0.06024819409685733, -0.10245957120423554, -0.2169970171416935, 0.03487868973388686, 0.46859696415049257, -0.26468858802400064, -0.29593041742919013, 0.02356341191170941, -0.27101501768265734, -0.16107022325741127, 0.20438243285843782, -0.14088549216376123, 0.14415086565713864, 0.14809675617834728, 0.08337068170112616, -0.02955469731023186, -0.30011412578460295, 0.2966522155329585, 0.0663734825316169, 0.3851372848075698, 0.013101125140565273, 0.15894794217820163, -0.011737002468407809, -0.00014123484652373008, -0.08079408054072701, 0.011547606896783691, 0.15360737367245747, 0.3605539366235462, 0.216057001871377, 0.3310830343998532, -0.34676198213128373, -0.18966643770545488, 0.053644450372303254, 0.11445188030120335, 0.09254157422674325, -0.010545574555180792, -0.3759722808172228, 0.09720409595684032, -0.19882505376153858, 0.056093267259711865, -0.16338342823655694, -0.009735003449350188, -0.036736226315042586, -0.30426460884700646, 0.0032727709112805314, 0.13817037541321042, 0.06505143718823092, -0.05320187947108934, -0.13098040061595384, 0.05966551040546619, 0.194800697696337, 0.010868078208659426, 0.1277561403035179, 0.14031704611261375, -0.1980153025378968, -0.14086485085454115, 0.33726453471172135, -0.107825047467486, -0.20863285158702638, 0.1870742885148502, 0.013523134752176702, -0.15076507685444085, 0.07731913724273909, 0.23574379574711202, 0.09611127655080054, -0.1587357144599082, -0.049344182557888416, -0.055398929500370286, 0.24897891393629834, 0.08203588077458335, 1.478054400649853e-05, 0.17267368375360093, 0.2922803650253627, -0.014607785637053894, 0.15929399604465289, -0.1558236819710146, -0.02057911405699997, -0.22372163184627425, -0.12180395328960003, -0.20115938098115294, -0.029637954532404365, -0.09217028433306496, -0.1403679779759841, 0.42980179130890406, 0.1871158300054958, 0.21562143601113348, 0.12272566460615053, 0.3141890930419322, 0.04627939751219401, 0.15536762936244486, 0.09039016073029416, 0.2009926552636898, 0.0032150807546713622, 0.08349869052108261, -0.14567987866303156, 0.09299757426560973, 0.10719279847398866]
|
1,803.05308
|
A generalization of Croot-Lev-Pach's Lemma and a new upper bound for the
size of difference sets in polynomial rings
|
Croot, Lev and Pach used a new polynomial technique to give a new exponential
upper bound for the size of three-term progression-free subsets in the groups
$(\mathbb Z _4)^n$.
The main tool in proving their striking result is a simple lemma about
polynomials, which gives interesting new bounds for the size of subsets of the
vector space $({\mathbb Z _p})^n$.
Our main result is a generalization of this lemma. In the proof we combined
Tao's slice rank bounding method with Gr\"obner basis technique.
As an application, we improve Green's results and present new upper bounds
for the size of difference sets in polynomial rings. We give a new, more
concrete upper bound for the size of arithmetic progression-free subsets in
$({\mathbb Z _p})^n$.
|
math.CO math.NT
|
croot lev and pach used a new polynomial technique to give a new exponential upper bound for the size of threeterm progressionfree subsets in the groups mathbb z _4n the main tool in proving their striking result is a simple lemma about polynomials which gives interesting new bounds for the size of subsets of the vector space mathbb z _pn our main result is a generalization of this lemma in the proof we combined taos slice rank bounding method with grobner basis technique as an application we improve greens results and present new upper bounds for the size of difference sets in polynomial rings we give a new more concrete upper bound for the size of arithmetic progressionfree subsets in mathbb z _pn
|
[['croot', 'lev', 'and', 'pach', 'used', 'a', 'new', 'polynomial', 'technique', 'to', 'give', 'a', 'new', 'exponential', 'upper', 'bound', 'for', 'the', 'size', 'of', 'threeterm', 'progressionfree', 'subsets', 'in', 'the', 'groups', 'mathbb', 'z', '_4n', 'the', 'main', 'tool', 'in', 'proving', 'their', 'striking', 'result', 'is', 'a', 'simple', 'lemma', 'about', 'polynomials', 'which', 'gives', 'interesting', 'new', 'bounds', 'for', 'the', 'size', 'of', 'subsets', 'of', 'the', 'vector', 'space', 'mathbb', 'z', '_pn', 'our', 'main', 'result', 'is', 'a', 'generalization', 'of', 'this', 'lemma', 'in', 'the', 'proof', 'we', 'combined', 'taos', 'slice', 'rank', 'bounding', 'method', 'with', 'grobner', 'basis', 'technique', 'as', 'an', 'application', 'we', 'improve', 'greens', 'results', 'and', 'present', 'new', 'upper', 'bounds', 'for', 'the', 'size', 'of', 'difference', 'sets', 'in', 'polynomial', 'rings', 'we', 'give', 'a', 'new', 'more', 'concrete', 'upper', 'bound', 'for', 'the', 'size', 'of', 'arithmetic', 'progressionfree', 'subsets', 'in', 'mathbb', 'z', '_pn']]
|
[-0.13301647197527688, 0.046121234128745005, -0.12284899688112076, 0.09773232068076394, -0.0830210285055161, -0.11388913138586355, 0.09587493852414496, 0.2570320488045328, -0.2685683123255912, -0.24789345646506084, 0.0877157556623999, -0.21430832146834888, -0.11299854626146252, 0.28715823026618265, -0.12388726971951909, 0.04117814144577648, 0.01284501284788378, 0.012531383625292753, -0.04870380004333546, -0.34526408744640036, 0.2935934565259052, -0.012601873783974862, 0.21173943366214146, 0.09746407571279245, 0.046117495827483715, 0.02018237708625002, -0.04864087916498423, -0.07141017247793899, -0.23219555124762606, 0.17910398160809743, 0.23636745628671813, 0.15722720077658286, 0.26418265874772406, -0.3513839009721748, -0.07924070068731423, 0.15991157869289277, 0.1732947402175699, 0.08073177502669975, -0.06934567241889872, -0.2757864803663592, 0.0998092300915083, -0.12081901609256375, -0.19737070814523175, -0.060256708756883125, 0.06475164960462935, 0.03655588290593052, -0.3013637262228571, 0.03154157371580845, 0.1582674998408336, 0.09493518053335959, -0.01077397334480994, -0.19697518758933807, 0.045605764283462746, 0.0570653303961468, -0.028358033694113133, 0.09820287798332875, 0.032383831333346116, -0.04829214363107, -0.13845406040610347, 0.2888950269028056, -0.08742035870425037, -0.20088919195667154, 0.13829055413332783, -0.13171386734017584, -0.20483758905902505, 0.10086048022675954, 0.19700896931567885, 0.13589366750250623, -0.06377493123691834, 0.16818101092558507, -0.17172883743359174, 0.1389718093626873, 0.12397517930319318, 0.0740173648848183, 0.08991268755997851, 0.1332520297575803, 0.12990697096941656, 0.19434752442194608, -0.004208552277051523, 0.004600133800298952, -0.3386719215233795, -0.2078104850532655, -0.18035539914472182, 0.06369035790262163, -0.1839139015014478, -0.18709153398016437, 0.364257199136296, 0.09323753991171901, 0.19266530434356727, 0.14684752758962605, 0.2599012973168712, 0.09319778584081252, 0.05024614002456369, 0.08140169175743216, 0.11237763088257587, 0.2109217260807722, -0.014305801027775055, -0.09929590705175288, 0.039495642595641985, 0.24854985973797739]
|
1,803.05309
|
Direct sampling method for imaging small anomalies: real-data
experiments
|
A direct sampling method (DSM) is designed herein for a real-time detection
of small anomalies from scattering parameters measured by a small number of
dipole antennas. Applicability of the DSM is theoretically demonstrated by
proving that its indicator function can be represented in terms of an infinite
series of Bessel functions of integer order and the antenna locations.
Experiments using real-data then demonstrate both the effectiveness and
limitations of this method.
|
math.NA
|
a direct sampling method dsm is designed herein for a realtime detection of small anomalies from scattering parameters measured by a small number of dipole antennas applicability of the dsm is theoretically demonstrated by proving that its indicator function can be represented in terms of an infinite series of bessel functions of integer order and the antenna locations experiments using realdata then demonstrate both the effectiveness and limitations of this method
|
[['a', 'direct', 'sampling', 'method', 'dsm', 'is', 'designed', 'herein', 'for', 'a', 'realtime', 'detection', 'of', 'small', 'anomalies', 'from', 'scattering', 'parameters', 'measured', 'by', 'a', 'small', 'number', 'of', 'dipole', 'antennas', 'applicability', 'of', 'the', 'dsm', 'is', 'theoretically', 'demonstrated', 'by', 'proving', 'that', 'its', 'indicator', 'function', 'can', 'be', 'represented', 'in', 'terms', 'of', 'an', 'infinite', 'series', 'of', 'bessel', 'functions', 'of', 'integer', 'order', 'and', 'the', 'antenna', 'locations', 'experiments', 'using', 'realdata', 'then', 'demonstrate', 'both', 'the', 'effectiveness', 'and', 'limitations', 'of', 'this', 'method']]
|
[-0.11102707073105578, 0.08259021258166119, -0.05233739459441161, 0.024350847191387186, -0.050347586490318806, -0.07512867101796077, 0.0625281294046993, 0.3683866286046908, -0.2612036218879823, -0.31585744811667943, 0.1084536821696199, -0.25408845683428605, -0.2268325553118238, 0.23583131144479128, -0.011859075231871135, 0.10684992565074936, 0.0516243925921514, 0.013674860492243732, -0.058713100397013274, -0.23050499477253203, 0.26140283125544517, 0.057924718366489866, 0.29620002647271565, 0.08982095931669776, 0.12975528712292583, 0.0012841311309644034, -0.036996779642002264, 0.059893960854641985, -0.04080218471257544, 0.09651915386030582, 0.2777799055550877, 0.1453936729386685, 0.284870717569556, -0.39165655499927593, -0.19613449954965584, 0.07856065644817033, 0.1570350060396841, 0.05111116161701125, -0.0937339328934478, -0.32118801418429527, 0.10577456024147465, -0.1930787541942907, -0.1333853295597602, -0.11485676898975188, -0.0034294792083682307, 0.10323750161447785, -0.33739824827865394, 0.019485263635968447, -0.010166567874888718, 0.07024276089972593, -0.032355106266831954, -0.12934074379031507, 0.028878991774112826, 0.08880138071909757, 0.032065859582589964, -0.04614839389343077, 0.08513965118269791, -0.09006996147505099, -0.153119091626624, 0.3812836482727402, -0.064530999893257, -0.24886555481754558, 0.12387291951970734, -0.13886394760650123, -0.0604191218292944, 0.14077265093162078, 0.1854984697452943, 0.17162408102566087, -0.1389815017161235, 0.07266849545519274, -0.03933071292621989, 0.16418547512517428, 0.06497721809198634, -0.0060945130805944055, 0.19510830581699773, 0.2205976921864982, 0.04435054051548794, 0.1742376488515399, -0.14332281223590104, -0.017789940500605693, -0.29606760989769665, -0.13164545351009763, -0.31338737826322166, -0.026998390430505847, -0.10024375804047375, -0.13849038277870754, 0.38683974519896674, 0.1531931845418794, 0.17081056317826077, 0.05948060480746585, 0.3586224301809996, 0.15937891424285958, 0.07251912746316111, -0.002557170636374766, 0.19725141735931098, 0.11141506066663899, 0.028753348403203656, -0.245758721214706, 0.06639694673022334, 0.06065426821308866]
|
1,803.0531
|
Cosmic acceleration in screening hybrid quintessence model
|
A formalism for the appearance of dark energy in the matter dominated era,
leading to a persistent de Sitter expansion at the late time is proposed. Our
framework is a hybrid quintessence model with a non-minimal coupling to the
Ricci scalar. Coupling to the curvature triggers the dark energy evolution,
while the coupling of scalar fields drives this evolution to a de Sitter stable
fixed point. These occur via successive $Z_2$ symmetry breakings.
|
gr-qc
|
a formalism for the appearance of dark energy in the matter dominated era leading to a persistent de sitter expansion at the late time is proposed our framework is a hybrid quintessence model with a nonminimal coupling to the ricci scalar coupling to the curvature triggers the dark energy evolution while the coupling of scalar fields drives this evolution to a de sitter stable fixed point these occur via successive z_2 symmetry breakings
|
[['a', 'formalism', 'for', 'the', 'appearance', 'of', 'dark', 'energy', 'in', 'the', 'matter', 'dominated', 'era', 'leading', 'to', 'a', 'persistent', 'de', 'sitter', 'expansion', 'at', 'the', 'late', 'time', 'is', 'proposed', 'our', 'framework', 'is', 'a', 'hybrid', 'quintessence', 'model', 'with', 'a', 'nonminimal', 'coupling', 'to', 'the', 'ricci', 'scalar', 'coupling', 'to', 'the', 'curvature', 'triggers', 'the', 'dark', 'energy', 'evolution', 'while', 'the', 'coupling', 'of', 'scalar', 'fields', 'drives', 'this', 'evolution', 'to', 'a', 'de', 'sitter', 'stable', 'fixed', 'point', 'these', 'occur', 'via', 'successive', 'z_2', 'symmetry', 'breakings']]
|
[-0.2384697783304608, 0.2130761434872673, -0.16387501986478065, 0.11612927320465917, -0.12160458597227013, -0.1302845308952646, -0.06849566589377515, 0.26824019761271267, -0.21472974228736472, -0.3063118540465015, 0.032310108493133254, -0.2262330616326773, -0.08725058149597416, 0.059918582512780205, 0.0665014077564829, -0.02276220884531328, -0.04443962632180893, 0.039383171292098416, -0.037683410761393095, -0.22777605059314265, 0.34462252442488983, 0.09970352021747664, 0.2608455548458414, 0.01335695362968804, 0.11218659483432157, -0.05498727077414116, 0.036555259236555594, -0.054693850880003954, -0.16213916344185397, 0.013459773593875643, 0.18679906290394496, 0.04106209372120036, 0.23741917089520864, -0.4010079084091807, -0.25672191414784334, 0.18304222798587322, 0.1286039722290796, 0.14215842542264048, -0.11959395825556696, -0.329873329207097, 0.041395989068056624, -0.18712357227524665, -0.13769297413958542, -0.0519682509467414, -0.042136506898303144, -0.10815885456435204, -0.271427591420608, 0.13646605157306138, -0.006241296652436563, -0.08477317284448199, -0.08814240851095073, 0.001373536718932733, -0.10148801326381732, 0.006585015462430781, 0.15085561259502978, 0.05214341567216875, 0.14737294401099574, -0.162292312674403, -0.07971342610616287, 0.36458488400668315, -0.19549868495701112, -0.1312222268738567, 0.1554931787493294, -0.10030995482859546, -0.13876064578453973, 0.17495379573984504, 0.1156899443546897, 0.13636384872410268, -0.08708942329753445, 0.202293059405909, 0.1223468167630777, 0.1250010632406697, 0.09340697577963136, 0.008436360058361946, 0.3314506893288599, 0.1499008803232892, 0.04795464139737903, 0.07167518167590646, -0.023642159717744343, -0.20187655019841783, -0.38283390087419994, -0.17599514041903105, -0.14952275701415763, 0.06454894712118253, -0.15471668606496428, -0.1894270799518244, 0.4237767658005022, 0.06526820240414714, 0.17250791147880715, 0.03475870429346823, 0.2905233192372404, 0.07336582949748645, 0.04757688823475005, 0.08143297422115933, 0.31732146609064243, 0.12374202440148346, 0.18386762911670726, -0.29178849098668114, -0.08793250032483715, 0.09092460523601877]
|
1,803.05311
|
Geo-Network Coding Function Virtualization for Reliable Communication
over Satellite
|
In this paper, we propose a design solution for the implementation of
Virtualized Network Coding Functionality (VNCF) over a service coverage area.
Network Function Virtualization (NFV) and Network Coding (NC) architectural
designs are integrated as a toolbox of NC design domains so that NC can be
implemented over different underlying physical networks including satellite or
hybrid networks.
The design includes identifying theoretical limits of NC over wireless
networks in terms of achievable rate region and optimizing coding rates for
nodes that implement VNCF. The overall design target is to achieve a given
multicast transmission target reliability at receiver sides. In addition, the
optimization problem uses databases with geo-tagged link statistics and
geo-location information of network nodes in the deployment area for some
computational complexity/energy constraints.
Numerical results provide validation of our design solution on how network
conditions and system constraints impact the design and implementation of NC
and how VNCF allows reliable communication over wireless networks with
reliability and connectivity up to theoretical limits.
|
cs.NI
|
in this paper we propose a design solution for the implementation of virtualized network coding functionality vncf over a service coverage area network function virtualization nfv and network coding nc architectural designs are integrated as a toolbox of nc design domains so that nc can be implemented over different underlying physical networks including satellite or hybrid networks the design includes identifying theoretical limits of nc over wireless networks in terms of achievable rate region and optimizing coding rates for nodes that implement vncf the overall design target is to achieve a given multicast transmission target reliability at receiver sides in addition the optimization problem uses databases with geotagged link statistics and geolocation information of network nodes in the deployment area for some computational complexityenergy constraints numerical results provide validation of our design solution on how network conditions and system constraints impact the design and implementation of nc and how vncf allows reliable communication over wireless networks with reliability and connectivity up to theoretical limits
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'design', 'solution', 'for', 'the', 'implementation', 'of', 'virtualized', 'network', 'coding', 'functionality', 'vncf', 'over', 'a', 'service', 'coverage', 'area', 'network', 'function', 'virtualization', 'nfv', 'and', 'network', 'coding', 'nc', 'architectural', 'designs', 'are', 'integrated', 'as', 'a', 'toolbox', 'of', 'nc', 'design', 'domains', 'so', 'that', 'nc', 'can', 'be', 'implemented', 'over', 'different', 'underlying', 'physical', 'networks', 'including', 'satellite', 'or', 'hybrid', 'networks', 'the', 'design', 'includes', 'identifying', 'theoretical', 'limits', 'of', 'nc', 'over', 'wireless', 'networks', 'in', 'terms', 'of', 'achievable', 'rate', 'region', 'and', 'optimizing', 'coding', 'rates', 'for', 'nodes', 'that', 'implement', 'vncf', 'the', 'overall', 'design', 'target', 'is', 'to', 'achieve', 'a', 'given', 'multicast', 'transmission', 'target', 'reliability', 'at', 'receiver', 'sides', 'in', 'addition', 'the', 'optimization', 'problem', 'uses', 'databases', 'with', 'geotagged', 'link', 'statistics', 'and', 'geolocation', 'information', 'of', 'network', 'nodes', 'in', 'the', 'deployment', 'area', 'for', 'some', 'computational', 'complexityenergy', 'constraints', 'numerical', 'results', 'provide', 'validation', 'of', 'our', 'design', 'solution', 'on', 'how', 'network', 'conditions', 'and', 'system', 'constraints', 'impact', 'the', 'design', 'and', 'implementation', 'of', 'nc', 'and', 'how', 'vncf', 'allows', 'reliable', 'communication', 'over', 'wireless', 'networks', 'with', 'reliability', 'and', 'connectivity', 'up', 'to', 'theoretical', 'limits']]
|
[-0.20782962412304856, -0.06176413711163278, -0.011017597602548912, -0.01272847523760662, -0.05562952276393543, -0.20335168253196165, 0.11598615899731682, 0.4248367442400909, -0.2506207807183814, -0.3224178815111975, 0.0998447137424848, -0.21019206018241743, -0.2017812151990351, 0.18885064019215939, -0.1241895995501706, 0.09799251617775213, 0.06661505576086008, 0.0012136725282105131, -0.053102882782695815, -0.2818394068955655, 0.27889749397769387, 0.11632331920090629, 0.3828119828702848, 0.0836202440571977, 0.06770293715987012, -0.003403164130675555, -0.0232889945418831, -0.017013854161476247, -0.10944497673902617, 0.17705617260017883, 0.35569709773101144, 0.2484851314320566, 0.27314619305172216, -0.4354444427267174, -0.24719670442921435, 0.047568485516472005, 0.16390367929018074, 0.03454114565842905, -0.026776984243288043, -0.25863673078736144, 0.09742360145419242, -0.23674326947107455, -0.03645736250477883, -0.04792079615011737, -0.042026110381985005, 0.06474991457571098, -0.31863433402603025, -0.05600006437283352, -0.047404473181813955, 0.01980394245256767, -0.018414679445123493, -0.0960658005305903, 0.012417628094153994, 0.17396598544537425, -0.04111098214566845, 0.022572456940471487, 0.16933750061238287, -0.1400530661571988, -0.14682661145754114, 0.3466143028787766, 0.030627818255359592, -0.21758690152454413, 0.12832740371321197, -0.011374054375201737, -0.1454554624924082, 0.11441926046794543, 0.30365870078237145, 0.027356326782881666, -0.19428417209444418, 0.052082257684923, 0.01649083634209962, 0.18396395130620047, 0.07494677816077701, 0.13585472756002578, 0.15955199510504725, 0.2908047648386721, 0.1379553104830803, 0.12802707773070507, -0.0975056973191698, -0.1235973294531538, -0.2624053925252948, -0.11724844595068848, -0.17264500805148225, -0.0044524974283973685, -0.1456425427424363, -0.09639151821175784, 0.38437153296145193, 0.16105558742351966, 0.10729245577033243, 0.15899373108144005, 0.36714549080263026, 0.015630058465708346, 0.09842039418458207, 0.13576768446667978, 0.15916236654938873, 0.08393496541346372, 0.17204378683554247, -0.15017439921792208, 0.09228928612425147, -0.012255628084216805]
|
1,803.05312
|
Second Order Perturbative Effects on the Acoustic Geometry
|
In this work, we have studied the effect of higher order perturbations,
particularly the second order in details, on the sonic horizon. We have
considered two different schemes of perturbations which are velocity potential
perturbation and mass acceleration rate perturbation. These two schemes give us
qualitatively similar behaviour. We have found that the analogue gravity
formalism also holds for the higher order perturbations.
|
gr-qc astro-ph.HE
|
in this work we have studied the effect of higher order perturbations particularly the second order in details on the sonic horizon we have considered two different schemes of perturbations which are velocity potential perturbation and mass acceleration rate perturbation these two schemes give us qualitatively similar behaviour we have found that the analogue gravity formalism also holds for the higher order perturbations
|
[['in', 'this', 'work', 'we', 'have', 'studied', 'the', 'effect', 'of', 'higher', 'order', 'perturbations', 'particularly', 'the', 'second', 'order', 'in', 'details', 'on', 'the', 'sonic', 'horizon', 'we', 'have', 'considered', 'two', 'different', 'schemes', 'of', 'perturbations', 'which', 'are', 'velocity', 'potential', 'perturbation', 'and', 'mass', 'acceleration', 'rate', 'perturbation', 'these', 'two', 'schemes', 'give', 'us', 'qualitatively', 'similar', 'behaviour', 'we', 'have', 'found', 'that', 'the', 'analogue', 'gravity', 'formalism', 'also', 'holds', 'for', 'the', 'higher', 'order', 'perturbations']]
|
[-0.184320240030213, 0.10738926460700375, -0.13230765158576624, 0.12164979944530402, -0.03686521288066629, -0.09210810773647464, -0.06597652468120768, 0.34425522781731116, -0.18521285085894523, -0.2987227692372269, 0.10532687224876432, -0.2416560582535726, -0.154766148547568, 0.18110708324682145, -0.02140446359084712, 0.046354533705328195, -0.03680067519760794, 0.0662958392732969, -0.07738299169282001, -0.31129462322190643, 0.39224173897315584, 0.061523711412317224, 0.27236842689296553, 0.03284459162340869, 0.042612480546628674, -0.0789404182753984, -0.0029014787740177577, 0.0785652171406481, -0.2045369691716457, 0.05805154660409908, 0.1829519380082188, 0.02311477152305463, 0.27052238553998964, -0.44038135185837746, -0.2402110153528315, 0.08983596383283536, 0.1349344788828776, 0.18301828358034117, -0.07993420112382857, -0.2233807724560537, 0.08858904138296134, -0.23102063722520447, -0.155562059924243, -0.10339384085483967, 0.010963055068656566, -0.005312461225436155, -0.22206546188819976, 0.11509643335011788, 0.06815943470786488, -0.005473876682420571, -0.08220536622499662, -0.0753435671092972, -0.0022205964750832037, 0.12055605760819856, 0.10012688230545748, -0.02633954943083818, 0.09746808267479377, -0.05314356675149784, -0.08801771933212876, 0.3938523877471212, -0.11048853506208471, -0.20564342451296627, 0.20247170680926907, -0.22248601234177984, -0.15564128080205547, 0.09467311445180149, 0.1996107781453738, 0.16032800201090083, -0.09972511227464392, 0.05596615024380356, 0.04641497785609866, 0.1095216719891935, 0.1480573022161566, 0.08364347493394263, 0.16778214862717997, 0.078182079555792, 0.05147925202202584, 0.08977556692081548, -0.08313163530658044, -0.09760884542964281, -0.2993953609395595, -0.1013109000831762, -0.09586471298502551, -0.011262985655949229, -0.12087755267381749, -0.12147841386086795, 0.3883177688463576, 0.23233368877498878, 0.1689504718348857, 0.05028459580711252, 0.28326611611105146, 0.17741169412398622, 0.04765804832623828, 0.06637617346963712, 0.3169602197521026, 0.13345667246788268, 0.12333067254133759, -0.21755566684545816, 0.028505114668477622, 0.07948387726136143]
|
1,803.05313
|
Variable stars in NGC 4147 revisited: RR Lyrae stars new CCD VI
photometry and physical parameters
|
We have calculated the physical parameters of the RR Lyrae stars in the
globular cluster NGC~4147 via the Fourier decomposition of their light curves,
using new data and well-established semi-empirical calibrations and zero
points. The mean metallicity and distance estimated using the RRc stars are
[Fe/H]$_{ZW}=-1.72\pm0.15$ and $19.05\pm0.46$ kpc respectively. The star V18,
whose variability has been previously in dispute, is confirmed to be a variable
of the SR type with a period of about 24.8d, and it has been used to get and
independent distance estimate of the cluster. It is observed that the RRab and
RRc stars do not share the inter-mode region in the horizontal branch. The
cluster can be classified as of intermediate Oosterhoff type. Its horizontal
branch structure and metallicity make a good case for extragalactic origin. It
follows the distribution of Oo~I type globular clusters in the $M_V-$[Fe/H]
plane, as depicted from the RRc stars.
|
astro-ph.SR
|
we have calculated the physical parameters of the rr lyrae stars in the globular cluster ngc4147 via the fourier decomposition of their light curves using new data and wellestablished semiempirical calibrations and zero points the mean metallicity and distance estimated using the rrc stars are feh_zw172pm015 and 1905pm046 kpc respectively the star v18 whose variability has been previously in dispute is confirmed to be a variable of the sr type with a period of about 248d and it has been used to get and independent distance estimate of the cluster it is observed that the rrab and rrc stars do not share the intermode region in the horizontal branch the cluster can be classified as of intermediate oosterhoff type its horizontal branch structure and metallicity make a good case for extragalactic origin it follows the distribution of ooi type globular clusters in the m_vfeh plane as depicted from the rrc stars
|
[['we', 'have', 'calculated', 'the', 'physical', 'parameters', 'of', 'the', 'rr', 'lyrae', 'stars', 'in', 'the', 'globular', 'cluster', 'ngc4147', 'via', 'the', 'fourier', 'decomposition', 'of', 'their', 'light', 'curves', 'using', 'new', 'data', 'and', 'wellestablished', 'semiempirical', 'calibrations', 'and', 'zero', 'points', 'the', 'mean', 'metallicity', 'and', 'distance', 'estimated', 'using', 'the', 'rrc', 'stars', 'are', 'feh_zw172pm015', 'and', '1905pm046', 'kpc', 'respectively', 'the', 'star', 'v18', 'whose', 'variability', 'has', 'been', 'previously', 'in', 'dispute', 'is', 'confirmed', 'to', 'be', 'a', 'variable', 'of', 'the', 'sr', 'type', 'with', 'a', 'period', 'of', 'about', '248d', 'and', 'it', 'has', 'been', 'used', 'to', 'get', 'and', 'independent', 'distance', 'estimate', 'of', 'the', 'cluster', 'it', 'is', 'observed', 'that', 'the', 'rrab', 'and', 'rrc', 'stars', 'do', 'not', 'share', 'the', 'intermode', 'region', 'in', 'the', 'horizontal', 'branch', 'the', 'cluster', 'can', 'be', 'classified', 'as', 'of', 'intermediate', 'oosterhoff', 'type', 'its', 'horizontal', 'branch', 'structure', 'and', 'metallicity', 'make', 'a', 'good', 'case', 'for', 'extragalactic', 'origin', 'it', 'follows', 'the', 'distribution', 'of', 'ooi', 'type', 'globular', 'clusters', 'in', 'the', 'm_vfeh', 'plane', 'as', 'depicted', 'from', 'the', 'rrc', 'stars']]
|
[-0.046776242243746914, 0.09061120398703734, -0.1421270447206639, 0.11189790634710824, -0.12293864189659809, -0.08246070179822189, 0.13581135920739928, 0.4187441917301035, -0.20650050602140552, -0.3218387335564206, 0.04755367484216128, -0.2793961604993765, -0.061031868331669674, 0.20855336692770246, -0.0710439634571552, -0.039070096538880474, 0.07658205260871118, 0.032809059620283694, -0.018988992947590898, -0.2891409166876328, 0.28361482811508837, -0.030516775426309126, 0.1847536693925836, -0.09364217879538912, 0.05720114736872421, -0.08032152671873773, -0.06327529103106337, -0.010484751237898457, -0.11992936289805299, 0.06892529167401205, 0.19646911469737993, 0.15073795678274393, 0.1886767518126919, -0.30424723266877335, -0.2251396037536819, 0.0811327853854619, 0.257255858683097, 0.046869441334690363, -0.030627302434232062, -0.2560128416330712, 0.10081837390277053, -0.11863835034321765, -0.19827740874496244, 0.04553269283199797, 0.08788109798820651, 0.09148344451396846, -0.19243024539742556, 0.13311325345619196, 0.027589129290359768, 0.14072879404463126, -0.1025273124964553, -0.20212631234835807, -0.07217966720183082, 0.14716736217453874, 0.03377742823973602, 0.09359107252058325, 0.08140231918885696, -0.06866111021590274, -0.03233635373933076, 0.3917923006007359, -0.06765230899030457, -0.06566987681158241, 0.19125072357124415, -0.14112776313468078, -0.13654615654020894, 0.03711789825176472, 0.1173721839971587, 0.13696984195334166, -0.21593077195100296, 0.05382747969393726, -0.0009315112688052816, 0.18849411994998097, 0.08087782790333185, 0.06229606024971625, 0.2538867238402164, 0.10429485429230394, 0.006941183984951199, 0.07072964999872279, -0.25674413805067237, -0.0764906409031832, -0.25199436687794674, -0.11074912072029472, -0.13654245378934227, 0.021866546854393425, -0.1391554672998015, -0.18521777826177627, 0.34804634052030997, 0.04372481451857658, 0.1955862209885096, -0.014638050986757996, 0.22419903507190092, 0.1338733009927507, 0.1450636603907709, 0.11154533216894484, 0.33492720635215034, 0.24074484910309113, 0.08119883675913826, -0.24944506789760373, 0.09661152325000386, 0.04160228720549367]
|
1,803.05314
|
Cahn-Hilliard equation on the boundary with bulk condition of Allen-Cahn
type
|
The well-posedness for a system of partial differential equations and dynamic
boundary conditions is discussed. This system is a sort of transmission problem
between the dynamics in the bulk $\Omega $ and on the boundary $\Gamma$. The
Poisson equation for the chemical potential, the Allen-Cahn equation for the
order parameter in the bulk $\Omega$ are considered as auxiliary conditions for
solving the Cahn-Hilliard equation on the boundary $\Gamma$. Recently the
well-posedness for the equation and dynamic boundary condition, both of
Cahn-Hilliard type, was discussed. Based on this result, the existence of the
solution and its continuous dependence on the data are proved.
|
math.AP
|
the wellposedness for a system of partial differential equations and dynamic boundary conditions is discussed this system is a sort of transmission problem between the dynamics in the bulk omega and on the boundary gamma the poisson equation for the chemical potential the allencahn equation for the order parameter in the bulk omega are considered as auxiliary conditions for solving the cahnhilliard equation on the boundary gamma recently the wellposedness for the equation and dynamic boundary condition both of cahnhilliard type was discussed based on this result the existence of the solution and its continuous dependence on the data are proved
|
[['the', 'wellposedness', 'for', 'a', 'system', 'of', 'partial', 'differential', 'equations', 'and', 'dynamic', 'boundary', 'conditions', 'is', 'discussed', 'this', 'system', 'is', 'a', 'sort', 'of', 'transmission', 'problem', 'between', 'the', 'dynamics', 'in', 'the', 'bulk', 'omega', 'and', 'on', 'the', 'boundary', 'gamma', 'the', 'poisson', 'equation', 'for', 'the', 'chemical', 'potential', 'the', 'allencahn', 'equation', 'for', 'the', 'order', 'parameter', 'in', 'the', 'bulk', 'omega', 'are', 'considered', 'as', 'auxiliary', 'conditions', 'for', 'solving', 'the', 'cahnhilliard', 'equation', 'on', 'the', 'boundary', 'gamma', 'recently', 'the', 'wellposedness', 'for', 'the', 'equation', 'and', 'dynamic', 'boundary', 'condition', 'both', 'of', 'cahnhilliard', 'type', 'was', 'discussed', 'based', 'on', 'this', 'result', 'the', 'existence', 'of', 'the', 'solution', 'and', 'its', 'continuous', 'dependence', 'on', 'the', 'data', 'are', 'proved']]
|
[-0.17986958936815806, 0.056839700248830095, -0.0883344588386319, 0.03225648553470279, -0.09053896226929409, -0.10627869652621079, -0.0021705517803530883, 0.25265359425788175, -0.3059062296432434, -0.24792003613149766, 0.17180652261047744, -0.28014815305497975, -0.12351021115751107, 0.181183819638307, -0.022903313546782673, 0.12969451931035514, 0.046634184519326924, 0.060353506646939725, -0.060626284542060135, -0.19362433180950656, 0.41156602805793874, -0.04448968812011846, 0.2608590831191712, 0.08042544480597619, 0.11540667351339898, -0.020843282632419084, 0.017265036471630676, 0.001863959392919989, -0.20484447467952302, 0.04175911579248818, 0.1821840249721219, 0.020437758392884885, 0.2625051800272252, -0.4200830238659193, -0.27577441550865034, 0.05377133020504129, 0.07265374065367597, 0.06230300516443382, -0.04681093400196716, -0.3159099235983178, 0.07910273265148891, -0.05950832747310252, -0.19394818786416423, -0.0010302002255869384, 0.030969784880923754, 0.05422785553601709, -0.3108476719791346, 0.14423755786870376, 0.05044418079133081, 0.008165278935362355, -0.22025700007671362, -0.08789716195545648, -0.06439774577496665, 0.059056346705828856, 0.02069294636395972, -0.004517456180056428, 0.030443551313906612, -0.13862074393834364, -0.031911802353650924, 0.37967826981134345, -0.06724002856950248, -0.3117180469787062, 0.1726208989817354, -0.11376415672112662, -0.10806165062960717, 0.106274827314301, 0.14608136259277563, 0.15884010988001776, -0.20667896639684788, 0.1706268107403291, -0.016932468340354095, 0.11899641383033578, 0.07675004421299932, -0.03153631509751967, 0.05480475259926355, 0.2118856810392941, 0.12868808271676893, 0.12840979013333817, -0.04752939764299605, -0.12792043194709585, -0.37091056707471903, -0.17028581293871498, -0.1539470715319166, 0.03835635217100308, -0.124622035438211, -0.19141214339081014, 0.34958237053660474, 0.10963113347787669, 0.15137502302802952, 0.0008745840842844826, 0.24294621818283996, 0.2291909870633966, -0.03153825675294098, 0.047352099560643776, 0.1989582179501505, 0.19398258779299363, 0.19673477727366556, -0.3056432265894358, 0.07636684359115835, 0.14393763515710978]
|
1,803.05315
|
Extreme walking behavior and SDE boundary conditions in a 331-TC model
|
The solution of the phenomenological problems of technicolor (TC) models may
reside in the different dynamical behavior of the technifermions self-energy
appearing in walking (or quasi-conformal) theories. Motivated by recent results
where it is shown how the boundary conditions (bc) of the anharmonic oscillator
representation of the Schwinger-Dyson gap equation (SDE) to $SU(N)$ are
directly related with the mass anomalous dimensions, and different bc cause a
change in the ultraviolet asymptotic behavior of the self-energies, in this
work we verify that it is possible to have a hard technifermion self-energy in
TC models originated through radiative corrections coming from the interactions
mediated by the new massive neutral and charged gauge bosons, $Z'$ and
$U^{\pm\pm}$ in the context of a 331-TC model.
|
hep-ph
|
the solution of the phenomenological problems of technicolor tc models may reside in the different dynamical behavior of the technifermions selfenergy appearing in walking or quasiconformal theories motivated by recent results where it is shown how the boundary conditions bc of the anharmonic oscillator representation of the schwingerdyson gap equation sde to sun are directly related with the mass anomalous dimensions and different bc cause a change in the ultraviolet asymptotic behavior of the selfenergies in this work we verify that it is possible to have a hard technifermion selfenergy in tc models originated through radiative corrections coming from the interactions mediated by the new massive neutral and charged gauge bosons z and upmpm in the context of a 331tc model
|
[['the', 'solution', 'of', 'the', 'phenomenological', 'problems', 'of', 'technicolor', 'tc', 'models', 'may', 'reside', 'in', 'the', 'different', 'dynamical', 'behavior', 'of', 'the', 'technifermions', 'selfenergy', 'appearing', 'in', 'walking', 'or', 'quasiconformal', 'theories', 'motivated', 'by', 'recent', 'results', 'where', 'it', 'is', 'shown', 'how', 'the', 'boundary', 'conditions', 'bc', 'of', 'the', 'anharmonic', 'oscillator', 'representation', 'of', 'the', 'schwingerdyson', 'gap', 'equation', 'sde', 'to', 'sun', 'are', 'directly', 'related', 'with', 'the', 'mass', 'anomalous', 'dimensions', 'and', 'different', 'bc', 'cause', 'a', 'change', 'in', 'the', 'ultraviolet', 'asymptotic', 'behavior', 'of', 'the', 'selfenergies', 'in', 'this', 'work', 'we', 'verify', 'that', 'it', 'is', 'possible', 'to', 'have', 'a', 'hard', 'technifermion', 'selfenergy', 'in', 'tc', 'models', 'originated', 'through', 'radiative', 'corrections', 'coming', 'from', 'the', 'interactions', 'mediated', 'by', 'the', 'new', 'massive', 'neutral', 'and', 'charged', 'gauge', 'bosons', 'z', 'and', 'upmpm', 'in', 'the', 'context', 'of', 'a', '331tc', 'model']]
|
[-0.11955698067028889, 0.2019195864104251, -0.07691641593512888, 0.08443562542147026, -0.0631046101642663, -0.14899883761379806, 0.04013001816660291, 0.32022594887481515, -0.22886258815689123, -0.27611377433787626, 0.044630987927740236, -0.3192077028181623, -0.1638840476942186, 0.11484494102148324, -0.012841833724068994, 0.05876676380603003, 0.0011353422026736896, 0.04148040388069045, -0.0694863611754977, -0.23306545444388538, 0.34586000626421526, -0.0016222815772815912, 0.22578601930838296, 0.09417009044696867, 0.029311729583325757, -0.033554887383424936, 0.005449466493387683, -0.021737015262214828, -0.10589360770753031, 0.07816727308897857, 0.18816765283016507, 0.023052774440152805, 0.19157341701866856, -0.39401560536577923, -0.24137115166248643, 0.07987362024288218, 0.16832226778169265, 0.1126015192257757, -0.05487781656248605, -0.30468035407634375, 0.029066036674467957, -0.17291181613182446, -0.16101278941941394, -0.027835125854911925, -0.03444084314582478, -0.05376278041732818, -0.28008251949878676, 0.12548659463068706, 0.007973647143001113, 0.027924442408457713, -0.06455455561160665, -0.10704697011148229, -0.06407756614303138, 0.09137650373970949, 0.1531953047207721, 0.03259855026120962, 0.1261679941373525, -0.21811269662546448, -0.12201648228997443, 0.4003092360471477, -0.08324434775213453, -0.17212027048363404, 0.22841624425285878, -0.15557412328902914, -0.13073686266145787, 0.14544127908136165, 0.16387144858291483, 0.11273068096097402, -0.2066122651366251, 0.1668570155357089, -0.028238076821337416, 0.11596253957059391, 0.033693130276784174, 0.033227552018057896, 0.222904517409243, 0.13860867706229205, -0.04480026280233527, 0.11136760292066057, -0.004013830186415683, -0.12366085815754085, -0.321311579363718, -0.11737911300459768, -0.12168820353788364, 0.04125693126384975, -0.079234537625115, -0.14740924487362944, 0.3743302678892843, 0.18941477339170842, 0.20546307154351987, 0.00961206786866699, 0.2334002259993503, 0.14027070981145157, 0.11050831830958609, 0.04665030060852526, 0.28565511445685077, 0.14927256444054304, 0.11527626491895243, -0.2742873863532294, -0.023323406180672097, 0.10336312827333308]
|
1,803.05316
|
Seven Sketches in Compositionality: An Invitation to Applied Category
Theory
|
This book is an invitation to discover advanced topics in category theory
through concrete, real-world examples. It aims to give a tour: a gentle, quick
introduction to guide later exploration. The tour takes place over seven
sketches, each pairing an evocative application, such as databases, electric
circuits, or dynamical systems, with the exploration of a categorical
structure, such as adjoint functors, enriched categories, or toposes.
No prior knowledge of category theory is assumed.
A feedback form for typos, comments, questions, and suggestions is available
here:
https://docs.google.com/document/d/160G9OFcP5DWT8Stn7TxdVx83DJnnf7d5GML0_FOD5Wg/edit
|
math.CT
|
this book is an invitation to discover advanced topics in category theory through concrete realworld examples it aims to give a tour a gentle quick introduction to guide later exploration the tour takes place over seven sketches each pairing an evocative application such as databases electric circuits or dynamical systems with the exploration of a categorical structure such as adjoint functors enriched categories or toposes no prior knowledge of category theory is assumed a feedback form for typos comments questions and suggestions is available here httpsdocsgooglecomdocumentd160g9ofcp5dwt8stn7txdvx83djnnf7d5gml0_fod5wgedit
|
[['this', 'book', 'is', 'an', 'invitation', 'to', 'discover', 'advanced', 'topics', 'in', 'category', 'theory', 'through', 'concrete', 'realworld', 'examples', 'it', 'aims', 'to', 'give', 'a', 'tour', 'a', 'gentle', 'quick', 'introduction', 'to', 'guide', 'later', 'exploration', 'the', 'tour', 'takes', 'place', 'over', 'seven', 'sketches', 'each', 'pairing', 'an', 'evocative', 'application', 'such', 'as', 'databases', 'electric', 'circuits', 'or', 'dynamical', 'systems', 'with', 'the', 'exploration', 'of', 'a', 'categorical', 'structure', 'such', 'as', 'adjoint', 'functors', 'enriched', 'categories', 'or', 'toposes', 'no', 'prior', 'knowledge', 'of', 'category', 'theory', 'is', 'assumed', 'a', 'feedback', 'form', 'for', 'typos', 'comments', 'questions', 'and', 'suggestions', 'is', 'available', 'here', 'httpsdocsgooglecomdocumentd160g9ofcp5dwt8stn7txdvx83djnnf7d5gml0_fod5wgedit']]
|
[-0.11519652955124483, 0.05611047554138007, -0.10843640150064054, 0.12031836541753044, -0.19401955345974248, -0.15396684125093196, 0.04046579276978531, 0.39078712266157656, -0.31342950439190165, -0.33655460818725474, 0.08904063539880822, -0.26480460832741193, -0.16693033733240822, 0.16059128029052824, -0.15166939006680075, -0.07349358958959142, 0.09481815833543591, 0.10522221428725649, -0.041682596964871185, -0.2990089473711765, 0.3129679390886689, 0.06712310447028894, 0.2258159181705731, 0.014310782819109805, 0.06073053369165042, 0.00424450109986698, -0.0641904377433307, -0.009791502661948257, -0.1422252287800588, 0.09978517739869217, 0.359094937518239, 0.17316788718761766, 0.3188776385422577, -0.45180510635323384, -0.1578446531175252, 0.0469595523112837, 0.08840530085760881, 0.13716542954720995, -0.07050237867378575, -0.33069984270807573, 0.01893762362134807, -0.23213878895758705, -0.06192313480355284, -0.09767200739861437, 0.0966864886091036, -0.016347174270156434, -0.2555952913600349, -0.1068942857796655, 0.09976581305861199, 0.13091556417810565, -0.060094016153872123, -0.10099329057642642, 0.01835815417854225, 0.13573733815539848, -0.007948058146490331, 0.050340338018448914, 0.16800465233185713, -0.16035581380950617, -0.1721642801647677, 0.3807281888144858, 0.018550505331607865, -0.12496200561085168, 0.19370875001665863, 0.00017686810905990355, -0.1388604213072754, 0.12115474329056108, 0.1236890724476646, 0.1210930507082273, -0.13037106743260451, 0.08269965547232834, -0.06601462351048694, 0.16583835411652484, 0.0624834122684072, 0.007218756788300679, 0.2455410373150645, 0.20880550930331296, 0.04957176409387851, 0.10266211899545263, 0.05222179134211996, -0.08171208180925425, -0.33142358090947655, -0.16444040374720797, -0.06726629288100144, 0.0891383654821445, -0.019946662355590995, -0.1955702084609691, 0.33316767298726035, 0.16888133356457247, 0.16998083861544727, 0.024351309204254958, 0.2994375556707382, 0.02121626875253723, 0.06144830179332263, 0.02355594845926937, 0.10443283552851747, 0.1405404309687369, 0.1168330589953043, -0.018712964319788358, 0.05809595874675057, 0.11661861930830021]
|
1,803.05317
|
Langevin equation in systems with also negative temperatures
|
We discuss how to derive a Langevin equation (LE) in non standard systems,
i.e. when the kinetic part of the Hamiltonian is not the usual quadratic
function. This generalization allows to consider also cases with negative
absolute temperature. We first give some phenomenological arguments suggesting
the shape of the viscous drift, replacing the usual linear viscous damping, and
its relation with the diffusion coefficient modulating the white noise term. As
a second step, we implement a procedure to reconstruct the drift and the
diffusion term of the LE from the time-series of the momentum of a heavy
particle embedded in a large Hamiltonian system. The results of our
reconstruction are in good agreement with the phenomenological arguments.
Applying the method to systems with negative temperature, we can observe that
also in this case there is a suitable Langevin equation, obtained with a
precise protocol, able to reproduce in a proper way the statistical features of
the slow variables. In other words, even in this context, systems with negative
temperature do not show any pathology.
|
cond-mat.stat-mech
|
we discuss how to derive a langevin equation le in non standard systems ie when the kinetic part of the hamiltonian is not the usual quadratic function this generalization allows to consider also cases with negative absolute temperature we first give some phenomenological arguments suggesting the shape of the viscous drift replacing the usual linear viscous damping and its relation with the diffusion coefficient modulating the white noise term as a second step we implement a procedure to reconstruct the drift and the diffusion term of the le from the timeseries of the momentum of a heavy particle embedded in a large hamiltonian system the results of our reconstruction are in good agreement with the phenomenological arguments applying the method to systems with negative temperature we can observe that also in this case there is a suitable langevin equation obtained with a precise protocol able to reproduce in a proper way the statistical features of the slow variables in other words even in this context systems with negative temperature do not show any pathology
|
[['we', 'discuss', 'how', 'to', 'derive', 'a', 'langevin', 'equation', 'le', 'in', 'non', 'standard', 'systems', 'ie', 'when', 'the', 'kinetic', 'part', 'of', 'the', 'hamiltonian', 'is', 'not', 'the', 'usual', 'quadratic', 'function', 'this', 'generalization', 'allows', 'to', 'consider', 'also', 'cases', 'with', 'negative', 'absolute', 'temperature', 'we', 'first', 'give', 'some', 'phenomenological', 'arguments', 'suggesting', 'the', 'shape', 'of', 'the', 'viscous', 'drift', 'replacing', 'the', 'usual', 'linear', 'viscous', 'damping', 'and', 'its', 'relation', 'with', 'the', 'diffusion', 'coefficient', 'modulating', 'the', 'white', 'noise', 'term', 'as', 'a', 'second', 'step', 'we', 'implement', 'a', 'procedure', 'to', 'reconstruct', 'the', 'drift', 'and', 'the', 'diffusion', 'term', 'of', 'the', 'le', 'from', 'the', 'timeseries', 'of', 'the', 'momentum', 'of', 'a', 'heavy', 'particle', 'embedded', 'in', 'a', 'large', 'hamiltonian', 'system', 'the', 'results', 'of', 'our', 'reconstruction', 'are', 'in', 'good', 'agreement', 'with', 'the', 'phenomenological', 'arguments', 'applying', 'the', 'method', 'to', 'systems', 'with', 'negative', 'temperature', 'we', 'can', 'observe', 'that', 'also', 'in', 'this', 'case', 'there', 'is', 'a', 'suitable', 'langevin', 'equation', 'obtained', 'with', 'a', 'precise', 'protocol', 'able', 'to', 'reproduce', 'in', 'a', 'proper', 'way', 'the', 'statistical', 'features', 'of', 'the', 'slow', 'variables', 'in', 'other', 'words', 'even', 'in', 'this', 'context', 'systems', 'with', 'negative', 'temperature', 'do', 'not', 'show', 'any', 'pathology']]
|
[-0.10659874781388147, 0.10517419135363923, -0.10943847818931715, 0.0648811833722913, -0.0733984259877825, -0.14476416291850994, 0.019543934767348586, 0.333761156777498, -0.28575089508426726, -0.2824042105549497, 0.06274004952798748, -0.27847585691302684, -0.1463539866239569, 0.18737172858619625, -0.06784522090168756, 0.031645816595269494, 0.06314200439808848, 0.055495978901416984, -0.08051628128347126, -0.21630538319339226, 0.31007605494467017, 0.04757746677723949, 0.20626563571752102, 0.01990402425136203, 0.12464426625412943, -0.004367044389558335, -0.01875931584415422, 0.0320162432685145, -0.15527969960732307, 0.06709798465043991, 0.19374672543299626, 0.032675966074497534, 0.2554912298567186, -0.3913946617608783, -0.2418399669963267, 0.11031227239846499, 0.11920503214611833, 0.15524930303284748, -0.044574132499595485, -0.22469947035237076, 0.05082775081772807, -0.16040051422060478, -0.1605271324194197, -0.08916930994554155, 0.002579851209817604, 0.02908704583479584, -0.28257165337115225, 0.1361911740490562, 0.10028860932911864, 0.02485717331026159, -0.06534939568962142, -0.10713691889755321, 0.001454028251431026, 0.08763331463162376, 0.05329837968730871, 0.02352994850411176, 0.10438694461013308, -0.1297934629597123, -0.07278414148216446, 0.38005195504312683, -0.12607074782771496, -0.2499134283567693, 0.18935952612851886, -0.17173003989014904, -0.11371648434854659, 0.0979079455739401, 0.1357002191984191, 0.1115883872523133, -0.1642656023926055, 0.07819111009654268, -0.004057535042600899, 0.17397602720871225, 0.018369812074106658, -0.006801309048349704, 0.15140186867344824, 0.13977196920614945, 0.045264788718637206, 0.1218897366037207, -0.06901472975080432, -0.10064020878153629, -0.33715801372931437, -0.16392008938904232, -0.16315816912864303, 0.05017039819366979, -0.10479047981237366, -0.17633202892909464, 0.3667077525336852, 0.17523415083996952, 0.2292654908197964, 0.07053565117798147, 0.29243957411347965, 0.17076817129460303, 0.05792197325513109, 0.06368479170520715, 0.2306408160749151, 0.1373365500195209, 0.145955518672869, -0.24362584122676728, 0.04965754828667375, 0.05267719979094871]
|
1,803.05318
|
On the structure theory of \L ukasiewicz near semirings
|
In a previous article by two of the present authors and S. Bonzio, \L
ukasiewicz near semirings were introduced and it was proven that basic algebras
can be represented (precisely, are term equivalent to) as near semirings. In
the same work it has been shown that the variety of \L ukasiewicz near
semirings is congruence regular. In other words, every congruence is uniquely
determined by its $0$-coset. Thus, it seems natural to wonder wether it could
be possible to provide a set-theoretical characterization of these cosets. This
article addresses this question and shows that kernels can be neatly described
in terms of two simple conditions. As an application, we obtain a concise
characterization of ideals in \L ukasiewicz semirings. Finally, we close this
article with a rather general Cantor-Bernstein type theorem for the variety of
involutive idempotent integral near semirings.
|
math.LO
|
in a previous article by two of the present authors and s bonzio l ukasiewicz near semirings were introduced and it was proven that basic algebras can be represented precisely are term equivalent to as near semirings in the same work it has been shown that the variety of l ukasiewicz near semirings is congruence regular in other words every congruence is uniquely determined by its 0coset thus it seems natural to wonder wether it could be possible to provide a settheoretical characterization of these cosets this article addresses this question and shows that kernels can be neatly described in terms of two simple conditions as an application we obtain a concise characterization of ideals in l ukasiewicz semirings finally we close this article with a rather general cantorbernstein type theorem for the variety of involutive idempotent integral near semirings
|
[['in', 'a', 'previous', 'article', 'by', 'two', 'of', 'the', 'present', 'authors', 'and', 's', 'bonzio', 'l', 'ukasiewicz', 'near', 'semirings', 'were', 'introduced', 'and', 'it', 'was', 'proven', 'that', 'basic', 'algebras', 'can', 'be', 'represented', 'precisely', 'are', 'term', 'equivalent', 'to', 'as', 'near', 'semirings', 'in', 'the', 'same', 'work', 'it', 'has', 'been', 'shown', 'that', 'the', 'variety', 'of', 'l', 'ukasiewicz', 'near', 'semirings', 'is', 'congruence', 'regular', 'in', 'other', 'words', 'every', 'congruence', 'is', 'uniquely', 'determined', 'by', 'its', '0coset', 'thus', 'it', 'seems', 'natural', 'to', 'wonder', 'wether', 'it', 'could', 'be', 'possible', 'to', 'provide', 'a', 'settheoretical', 'characterization', 'of', 'these', 'cosets', 'this', 'article', 'addresses', 'this', 'question', 'and', 'shows', 'that', 'kernels', 'can', 'be', 'neatly', 'described', 'in', 'terms', 'of', 'two', 'simple', 'conditions', 'as', 'an', 'application', 'we', 'obtain', 'a', 'concise', 'characterization', 'of', 'ideals', 'in', 'l', 'ukasiewicz', 'semirings', 'finally', 'we', 'close', 'this', 'article', 'with', 'a', 'rather', 'general', 'cantorbernstein', 'type', 'theorem', 'for', 'the', 'variety', 'of', 'involutive', 'idempotent', 'integral', 'near', 'semirings']]
|
[-0.12432421306468736, 0.0713071677391122, -0.07659291847021846, 0.11620029751666942, -0.12320964931733096, -0.14786886457232354, 0.0008406609792829207, 0.3713360674733269, -0.35826565501739044, -0.23160174229870673, 0.11277507808805187, -0.25120657026443793, -0.1629364132894662, 0.22885246145365207, -0.14625942213562035, -0.009688089635860904, 0.041593193450261016, 0.1096257653302071, -0.07634538316810706, -0.2734765493972362, 0.33872168523299956, 0.031835345357346036, 0.19298860431561057, 0.06626549014902633, 0.04378942348420674, -0.012084049267181452, -0.034337233404453466, 0.0695426189340651, -0.16883367685970396, 0.09261634386569748, 0.35137989179676643, 0.12364875386718768, 0.23872805901033722, -0.3554523552224239, -0.1273222746550227, 0.13838560232197514, 0.16081121316064906, 0.020837021275192324, 0.023464864889240784, -0.2456183222770367, 0.13405047512956578, -0.19327390034500833, -0.1660841533144855, -0.107026836656007, 0.08148863293446493, 0.007853281795573623, -0.2423556707242666, -0.016479203302035297, 0.16512013020911726, 0.11359435816605885, -0.013258179880010532, -0.10100212117633445, 0.02021130209154301, 0.05015317241971692, -0.013549599921384799, 0.04062081923019951, 0.05690289731095275, -0.033199711373764214, -0.13852185677345571, 0.3709024091021738, -0.03714836629291497, -0.2069156815176003, 0.17144265428077485, -0.13372446738008031, -0.14031816154475446, 0.09416158804906181, 0.03420981345023366, 0.13059967939836392, -0.1737306772856096, 0.15607136228478022, -0.1623572542710041, 0.07369717360015257, 0.14683723850243224, 0.05245420418593668, 0.1903971957019193, 0.12000598207848362, 0.047954977010849165, 0.15142151358178008, 0.05363906253520669, -0.012428292470218183, -0.32296182224661973, -0.1797474678133385, -0.11569230970116737, 0.08369750048681769, -0.005052848846969647, -0.16754436390065297, 0.38568754180375003, 0.12578371786714895, 0.15981678387987008, 0.06342245629934622, 0.21049005056873127, 0.11297193508210551, 0.07544086488348473, 0.059390047517861574, 0.163116972066759, 0.17841372445758863, 0.0453098945663837, -0.0961408784167598, 0.03866764764382463, 0.1338333048236867]
|
1,803.05319
|
Euler-Lagrangian approach to 3D stochastic Euler equations
|
3D stochastic Euler equations with a special form of multiplicative noise are
considered. A Constantin-Iyer type representation in Euler-Lagrangian form is
given, based on stochastic characteristics. Local existence and uniqueness of
solutions in suitable Hoelder spaces is proved from the Euler-Lagrangian
formulation.
|
math.PR
|
3d stochastic euler equations with a special form of multiplicative noise are considered a constantiniyer type representation in eulerlagrangian form is given based on stochastic characteristics local existence and uniqueness of solutions in suitable hoelder spaces is proved from the eulerlagrangian formulation
|
[['3d', 'stochastic', 'euler', 'equations', 'with', 'a', 'special', 'form', 'of', 'multiplicative', 'noise', 'are', 'considered', 'a', 'constantiniyer', 'type', 'representation', 'in', 'eulerlagrangian', 'form', 'is', 'given', 'based', 'on', 'stochastic', 'characteristics', 'local', 'existence', 'and', 'uniqueness', 'of', 'solutions', 'in', 'suitable', 'hoelder', 'spaces', 'is', 'proved', 'from', 'the', 'eulerlagrangian', 'formulation']]
|
[-0.15667156879568384, -0.004536739151392665, -0.08101159906280893, 0.0955178825062744, -0.12546012156997763, -0.14459830821890915, -0.07300325785763562, 0.24622732600463287, -0.3020441003498577, -0.19239236037468627, 0.13905361295300758, -0.2207809965614052, -0.20277587413078263, 0.193450402601489, -0.11515188853566845, 0.0707581627980939, 0.0459461543221204, 0.04322579658279816, -0.11450061182092343, -0.20829244504594022, 0.3913950098767167, -0.08547207826216306, 0.26041704524929327, -0.06986335707118824, 0.19102236814796925, -0.03203137054862011, -0.047153605902124016, 0.05109767535967486, -0.131036286419701, 0.07979297157310482, 0.2311169330385469, 0.050480820925995, 0.31559652444862185, -0.430194929685621, -0.2020458897708782, 0.10894117351355297, 0.06943354355254476, 0.06297243060544133, -0.06966268928954378, -0.33013954971517834, 0.09813938666844652, -0.0891150092883479, -0.17421577014916, -0.09196476794646255, 0.015025112112717969, 0.1513091233958091, -0.33814755228481125, 0.10975780615228273, 0.08639609018185486, 0.022636181142713343, -0.18172881777753078, -0.09467070097369808, -0.02622731402516365, 0.03175084054514411, -0.006095858706560518, -0.013915763341910428, 0.038978572779645525, -0.13296178728342056, -0.0762661398676712, 0.37087773882030023, -0.1086736620581221, -0.36995303125808104, 0.14695933732270663, -0.07987341091835073, -0.15020825097426063, 0.16991524426321986, 0.14043057378425838, 0.1549646214892467, -0.1755024191834742, 0.17585913819077956, -0.07870445693177837, 0.09659732159759317, 0.10421357484578732, 0.019558907952159643, 0.06790502899370733, 0.16770182940221967, 0.11974256096540817, 0.11341414256353996, 0.0027899173409899787, -0.17676570768041225, -0.34596942081337884, -0.13257831169314505, -0.14475039867240758, 0.16421936243949903, -0.11902258865544961, -0.21617888379842043, 0.3332521373827365, 0.0681742870115808, 0.10804958764596709, 0.1047174438745493, 0.21075408728349776, 0.1957495326752819, -0.0433764440850133, 0.10503413568117789, 0.14637505759795508, 0.21481710142411647, 0.12211972356419123, -0.1463439982229223, 0.09149356046137178, 0.28390833156715545]
|
1,803.0532
|
Efficient Realization of Givens Rotation through Algorithm-Architecture
Co-design for Acceleration of QR Factorization
|
We present efficient realization of Generalized Givens Rotation (GGR) based
QR factorization that achieves 3-100x better performance in terms of
Gflops/watt over state-of-the-art realizations on multicore, and General
Purpose Graphics Processing Units (GPGPUs). GGR is an improvement over
classical Givens Rotation (GR) operation that can annihilate multiple elements
of rows and columns of an input matrix simultaneously. GGR takes 33% lesser
multiplications compared to GR. For custom implementation of GGR, we identify
macro operations in GGR and realize them on a Reconfigurable Data-path (RDP)
tightly coupled to pipeline of a Processing Element (PE). In PE, GGR attains
speed-up of 1.1x over Modified Householder Transform (MHT) presented in the
literature. For parallel realization of GGR, we use REDEFINE, a scalable
massively parallel Coarse-grained Reconfigurable Architecture, and show that
the speed-up attained is commensurate with the hardware resources in REDEFINE.
GGR also outperforms General Matrix Multiplication (gemm) by 10% in-terms of
Gflops/watt which is counter-intuitive.
|
cs.DC cs.AR cs.MS
|
we present efficient realization of generalized givens rotation ggr based qr factorization that achieves 3100x better performance in terms of gflopswatt over stateoftheart realizations on multicore and general purpose graphics processing units gpgpus ggr is an improvement over classical givens rotation gr operation that can annihilate multiple elements of rows and columns of an input matrix simultaneously ggr takes 33 lesser multiplications compared to gr for custom implementation of ggr we identify macro operations in ggr and realize them on a reconfigurable datapath rdp tightly coupled to pipeline of a processing element pe in pe ggr attains speedup of 11x over modified householder transform mht presented in the literature for parallel realization of ggr we use redefine a scalable massively parallel coarsegrained reconfigurable architecture and show that the speedup attained is commensurate with the hardware resources in redefine ggr also outperforms general matrix multiplication gemm by 10 interms of gflopswatt which is counterintuitive
|
[['we', 'present', 'efficient', 'realization', 'of', 'generalized', 'givens', 'rotation', 'ggr', 'based', 'qr', 'factorization', 'that', 'achieves', '3100x', 'better', 'performance', 'in', 'terms', 'of', 'gflopswatt', 'over', 'stateoftheart', 'realizations', 'on', 'multicore', 'and', 'general', 'purpose', 'graphics', 'processing', 'units', 'gpgpus', 'ggr', 'is', 'an', 'improvement', 'over', 'classical', 'givens', 'rotation', 'gr', 'operation', 'that', 'can', 'annihilate', 'multiple', 'elements', 'of', 'rows', 'and', 'columns', 'of', 'an', 'input', 'matrix', 'simultaneously', 'ggr', 'takes', '33', 'lesser', 'multiplications', 'compared', 'to', 'gr', 'for', 'custom', 'implementation', 'of', 'ggr', 'we', 'identify', 'macro', 'operations', 'in', 'ggr', 'and', 'realize', 'them', 'on', 'a', 'reconfigurable', 'datapath', 'rdp', 'tightly', 'coupled', 'to', 'pipeline', 'of', 'a', 'processing', 'element', 'pe', 'in', 'pe', 'ggr', 'attains', 'speedup', 'of', '11x', 'over', 'modified', 'householder', 'transform', 'mht', 'presented', 'in', 'the', 'literature', 'for', 'parallel', 'realization', 'of', 'ggr', 'we', 'use', 'redefine', 'a', 'scalable', 'massively', 'parallel', 'coarsegrained', 'reconfigurable', 'architecture', 'and', 'show', 'that', 'the', 'speedup', 'attained', 'is', 'commensurate', 'with', 'the', 'hardware', 'resources', 'in', 'redefine', 'ggr', 'also', 'outperforms', 'general', 'matrix', 'multiplication', 'gemm', 'by', '10', 'interms', 'of', 'gflopswatt', 'which', 'is', 'counterintuitive']]
|
[-0.15755453441402337, 0.0447993524830963, -0.054009094826668796, -0.01674621174874789, -0.1099653318654562, -0.19606763163373167, 0.007032728815255196, 0.4198372312515092, -0.2729679733563803, -0.30663624848851834, 0.07468100591550435, -0.2031131427118357, -0.15832982502998724, 0.24140300973943485, -0.13549009379992066, 0.03818487579395112, 0.08075809626921239, -0.0011094500231066424, -0.14448621259898095, -0.31435444735382734, 0.14996337574925028, 0.08899312032199784, 0.334640167720959, -0.0445305657309578, 0.13777445934063412, 0.01074051473130423, -0.04321078755387325, -0.04228462455150867, 0.002051011561984763, 0.1382417001203928, 0.26400990220473003, 0.20338406034831055, 0.2450497750649351, -0.4413710124668126, -0.0929650935393415, 0.03213534996566044, 0.1462075251436449, 0.0342540695986061, -0.04675214850545959, -0.22038930143523766, 0.13421478837124978, -0.2255274811300057, -0.020731206024433242, -0.12129924056046691, 0.010660280096712276, -0.004031650489962071, -0.2723928773285527, 0.03393451675085663, 0.022852279481747628, 0.059060593968943545, 0.0510380832527421, -0.1555559866752255, 0.0844415599468017, 0.03085774284370832, -0.09993547717826196, 0.06218056292518189, 0.1471591104973892, -0.06906062047806029, -0.17969100180351616, 0.4117391802566616, -0.09066361242807225, -0.17985985470448596, 0.11955019138756477, -0.049638879719886495, -0.13365343396282314, 0.10675429607631247, 0.20001290491046875, 0.09361426575771092, -0.09386137727721545, 0.0851603757718725, -0.02643025015774918, 0.23693411060345457, 0.13357865281929998, 0.018385168968387388, 0.13993612118218535, 0.1880381819301922, 0.058735909715515414, 0.13080264686998003, -0.07325450917816947, -0.11945955853719313, -0.242070333124215, -0.22635787888736414, -0.1615988722340645, 0.01153184635270583, -0.12335207516987698, -0.13498447200369187, 0.3727948247932976, 0.16746911152049984, 0.11391429041242718, 0.11083755894613109, 0.35951877159899787, 0.02900752771529369, 0.18245744373110173, 0.1472507627546101, 0.10309060598650065, 0.1002147073174312, 0.12135217817749915, -0.18622248077544531, -0.01010487909508428, 0.031192252761684358]
|
1,803.05321
|
Selective population of a large-angular-momentum state in an optical
lattice
|
We propose a method to selectively populate a large angular momentum state of
ultracold atoms (each with an orbital angular momentum $l \approx 2 \hbar$) in
the Mott regime of a two-dimensional optical lattice. This is done by
periodically modulating the lattice amplitude and implementing an additional
rectangular lattice of shorter wavelength at an angle of $\pi/4$. The specific
pulse sequences are designed using a four-level model for each well and are
implemented sequentially. The results are confirmed with numerical simulations
of the full Schroedinger equation. The methods of this paper are another step
in constructing a modular toolbox of operations for creating higher orbital
states in optical lattices.
|
quant-ph cond-mat.quant-gas
|
we propose a method to selectively populate a large angular momentum state of ultracold atoms each with an orbital angular momentum l approx 2 hbar in the mott regime of a twodimensional optical lattice this is done by periodically modulating the lattice amplitude and implementing an additional rectangular lattice of shorter wavelength at an angle of pi4 the specific pulse sequences are designed using a fourlevel model for each well and are implemented sequentially the results are confirmed with numerical simulations of the full schroedinger equation the methods of this paper are another step in constructing a modular toolbox of operations for creating higher orbital states in optical lattices
|
[['we', 'propose', 'a', 'method', 'to', 'selectively', 'populate', 'a', 'large', 'angular', 'momentum', 'state', 'of', 'ultracold', 'atoms', 'each', 'with', 'an', 'orbital', 'angular', 'momentum', 'l', 'approx', '2', 'hbar', 'in', 'the', 'mott', 'regime', 'of', 'a', 'twodimensional', 'optical', 'lattice', 'this', 'is', 'done', 'by', 'periodically', 'modulating', 'the', 'lattice', 'amplitude', 'and', 'implementing', 'an', 'additional', 'rectangular', 'lattice', 'of', 'shorter', 'wavelength', 'at', 'an', 'angle', 'of', 'pi4', 'the', 'specific', 'pulse', 'sequences', 'are', 'designed', 'using', 'a', 'fourlevel', 'model', 'for', 'each', 'well', 'and', 'are', 'implemented', 'sequentially', 'the', 'results', 'are', 'confirmed', 'with', 'numerical', 'simulations', 'of', 'the', 'full', 'schroedinger', 'equation', 'the', 'methods', 'of', 'this', 'paper', 'are', 'another', 'step', 'in', 'constructing', 'a', 'modular', 'toolbox', 'of', 'operations', 'for', 'creating', 'higher', 'orbital', 'states', 'in', 'optical', 'lattices']]
|
[-0.17485192661823004, 0.21772524500797064, -0.042131281989720576, -0.008758248659833377, -0.023728452648523204, -0.17292157389702054, 0.042630242458288344, 0.44062354401984344, -0.2636333708288233, -0.2537670411391679, 0.05103487756697102, -0.25452597820575973, -0.05993008202394693, 0.22343404788241952, 0.02034947546967946, 0.07966149710289655, 0.06604031899115156, -0.0368433093925545, -0.09031624117478464, -0.21782702679207566, 0.2759217233295604, 0.07097606424566939, 0.22364495908243393, -0.010721584328091404, 0.10490431783532878, 0.02786327514865803, 0.014453665430255986, -0.04667221002041473, -0.13532726624083424, 0.11563770356534664, 0.20705739656300925, -0.023213496763865814, 0.2622305477003849, -0.420479232086501, -0.1653035656109008, 0.03831764346911409, 0.1779189674662204, 0.19187140402409736, -0.029263625252530526, -0.27966288531011124, -6.085494960393381e-05, -0.1712939018029036, -0.16786201056434746, -0.09431536118457214, 0.027487954671639916, 0.0314424179426027, -0.2810728444008652, 0.04506443153827562, 0.04072857455354731, 0.10514782070088277, -0.056073915469673795, -0.10108622482234458, -0.040665625442896, 0.06615328206573912, -0.05791485683304694, 0.07213649200061935, 0.07728621146188827, -0.09924416933336867, -0.1252170104187392, 0.3923439922990329, -0.03185095861041491, -0.19557380771110638, 0.11649758619076889, -0.1508894407942276, -0.066523776479373, 0.14297912367235083, 0.1343500152798455, 0.12363196402753986, -0.12095292784922987, 0.05211047121908926, -0.05494792856075246, 0.21928786649048293, 0.07992442122258998, 0.06409443309957828, 0.24579508377478346, 0.18109930873049612, 0.029516018927631334, 0.16229030327794544, -0.11390094101907464, -0.07399050100202408, -0.26664542296576665, -0.13203250531346425, -0.23197929667086775, 0.028441245103716303, -0.07700277142063287, -0.12109192832316477, 0.40503372050343306, 0.10832731312350691, 0.22223307121408367, -0.0036687912897916015, 0.2963698344270981, 0.15091682138314488, 0.06723253161180764, 0.06098957433912117, 0.1915869817475216, 0.10452634253573322, 0.09573086867655772, -0.24796963357921997, -0.05073019315343384, 0.07100410956821036]
|
1,803.05322
|
Effects of localized spatial variations on the uniform persistence and
spreading speeds of time periodic two species competition systems
|
The current paper is devoted to the study of two species competition systems
of the form \begin{equation*} \begin{cases} u_t(t,x)= \mathcal{A}
u+u(a_1(t,x)-b_1(t,x)u-c_1(t,x)v),\quad x\in\RR\cr v_t(t,x)= \mathcal{A} v+
v(a_2(t,x)-b_2(t,x)u-c_2(t,x) v),\quad x\in\RR \end{cases} \end{equation*}
where $\mathcal{A}u=u_{xx}$, or
$(\mathcal{A}u)(t,x)=\int_{\RR}\kappa(y-x)u(t,y)dy-u(t,x)$ ($\kappa(\cdot)$ is
a smooth non-negative convolution kernel supported on an interval centered at
the origin), $a_i(t+T,x)=a_i(t,x)$, $b_i(t+T,x)=b_i(t,x)$,
$c_i(t+T,x)=c_i(t,x)$, and $a_i$, $b_i$, and $c_i$ ($i=1,2$) are spatially
homogeneous when $|x|\gg 1$, that is, $a_i(t,x)=a_i^0(t)$, $b_i(t,x)=b_i^0(t)$,
$c_i(t,x)=c_i^0(t)$ for some $a_i^0(t)$, $b_i^0(t)$, $c_i^0(t)$, and $|x|\gg
1$. Such a system can be viewed as a time periodic competition system subject
to certain localized spatial variations. We, in particular, study the effects
of localized spatial variations on the uniform persistence and spreading speeds
of the system. Among others, it is proved that any localized spatial variation
does not affect the uniform persistence of the system, does not slow down the
spreading speeds of the system, and under some linear determinant condition,
does not speed up the spreading speeds.
|
math.AP
|
the current paper is devoted to the study of two species competition systems of the form beginequation begincases u_ttx mathcala uua_1txb_1txuc_1txvquad xinrrcr v_ttx mathcala v va_2txb_2txuc_2tx vquad xinrr endcases endequation where mathcalauu_xx or mathcalautxint_rrkappayxutydyutx kappacdot is a smooth nonnegative convolution kernel supported on an interval centered at the origin a_ittxa_itx b_ittxb_itx c_ittxc_itx and a_i b_i and c_i i12 are spatially homogeneous when xgg 1 that is a_itxa_i0t b_itxb_i0t c_itxc_i0t for some a_i0t b_i0t c_i0t and xgg 1 such a system can be viewed as a time periodic competition system subject to certain localized spatial variations we in particular study the effects of localized spatial variations on the uniform persistence and spreading speeds of the system among others it is proved that any localized spatial variation does not affect the uniform persistence of the system does not slow down the spreading speeds of the system and under some linear determinant condition does not speed up the spreading speeds
|
[['the', 'current', 'paper', 'is', 'devoted', 'to', 'the', 'study', 'of', 'two', 'species', 'competition', 'systems', 'of', 'the', 'form', 'beginequation', 'begincases', 'u_ttx', 'mathcala', 'uua_1txb_1txuc_1txvquad', 'xinrrcr', 'v_ttx', 'mathcala', 'v', 'va_2txb_2txuc_2tx', 'vquad', 'xinrr', 'endcases', 'endequation', 'where', 'mathcalauu_xx', 'or', 'mathcalautxint_rrkappayxutydyutx', 'kappacdot', 'is', 'a', 'smooth', 'nonnegative', 'convolution', 'kernel', 'supported', 'on', 'an', 'interval', 'centered', 'at', 'the', 'origin', 'a_ittxa_itx', 'b_ittxb_itx', 'c_ittxc_itx', 'and', 'a_i', 'b_i', 'and', 'c_i', 'i12', 'are', 'spatially', 'homogeneous', 'when', 'xgg', '1', 'that', 'is', 'a_itxa_i0t', 'b_itxb_i0t', 'c_itxc_i0t', 'for', 'some', 'a_i0t', 'b_i0t', 'c_i0t', 'and', 'xgg', '1', 'such', 'a', 'system', 'can', 'be', 'viewed', 'as', 'a', 'time', 'periodic', 'competition', 'system', 'subject', 'to', 'certain', 'localized', 'spatial', 'variations', 'we', 'in', 'particular', 'study', 'the', 'effects', 'of', 'localized', 'spatial', 'variations', 'on', 'the', 'uniform', 'persistence', 'and', 'spreading', 'speeds', 'of', 'the', 'system', 'among', 'others', 'it', 'is', 'proved', 'that', 'any', 'localized', 'spatial', 'variation', 'does', 'not', 'affect', 'the', 'uniform', 'persistence', 'of', 'the', 'system', 'does', 'not', 'slow', 'down', 'the', 'spreading', 'speeds', 'of', 'the', 'system', 'and', 'under', 'some', 'linear', 'determinant', 'condition', 'does', 'not', 'speed', 'up', 'the', 'spreading', 'speeds']]
|
[-0.214424020416445, 0.14028206353484932, -0.01863449408920656, 0.03318658194390776, -0.03652296927858063, -0.18125083149752494, -0.01960673888646093, 0.3636032515238944, -0.3197908075995368, -0.16270419927447927, 0.14112851672835997, -0.29257655938377053, -0.11597452753076075, 0.15243444462950012, -0.06541685998211984, 0.0165446116103248, 0.035171275015370984, 0.07988874261642692, -0.03678336162321109, -0.22474593607283352, 0.34051170429255034, -0.04912927685633784, 0.2354279209142752, 0.08390904090445984, 0.11179400089350965, -0.01569205312989652, 0.039936076420888623, 0.01923362740563403, -0.15899983129563336, 0.040874150432579276, 0.1691949657573224, 0.10465186223029259, 0.3077992552509464, -0.4156045027130799, -0.1922172837657854, 0.16397964975481732, 0.19476819573399082, 0.017972666977924837, 0.03804106098283987, -0.275234510070182, 0.09951123713160591, -0.10403391406636872, -0.1629752212860655, -0.017371377204176332, 0.07285685009128756, 0.08221596085781352, -0.3250174075130561, 0.105872855046027, 0.1261779779213206, 0.05706772073038029, -0.05629077000650678, -0.11135671513151753, -0.03581266898809255, 0.1286866334788317, 0.01825945417014815, 0.05952990965803804, 0.08114035602444582, -0.09508997771768368, -0.029499373753829827, 0.37380790559695565, -0.0743598588666939, -0.24463873135475375, 0.18750279078179663, -0.1825048409187965, -0.10242520918124925, 0.127343961639035, 0.1697083894488328, 0.12925899482044062, -0.11853279306634125, 0.0902160626359572, -0.043388327963904835, 0.21039001519244044, 0.09408056128120197, 0.037244935052656976, 0.14968671446009504, 0.1071292626095279, 0.1077453401475716, 0.06256197495369253, -0.06002700855124661, -0.08288581891105973, -0.3183623151116663, -0.11252846378538249, -0.15599432311911912, 0.09287873114718428, -0.07396308957084448, -0.1723629045266685, 0.36703215602939454, 0.09902925144507475, 0.1967013220892375, 0.051971890216650565, 0.2017584952003182, 0.13389711934493573, 0.0037239182660047956, 0.0869809549851276, 0.13007726729051847, 0.1023335197870117, 0.11922211686430646, -0.23442174261938378, 0.1032876816893117, 0.056515614576880625]
|
1,803.05323
|
Superradiant Undulator Radiation for Selective THz Control Experiments
at XFELs
|
The generation of frequency-tunable, narrow-bandwidth and
carrier-envelope-phase stable THz pulses with fields in the MV/cm regime that
can be appropriately timed to the femtosecond X-ray pulses from
free-electron-lasers is of highest scientific interest. It will enable to
follow the electronic and structural dynamics stimulated by (non)linear
selective excitations of matter on few femtosecond time and {\AA}ngstrom length
scales. In this article, a scheme based on superradiant undulator radiation
generated just after the XFEL is proposed. The concept utilizes cutting edge
superconducting undulator technology and provides THz pulses in a frequency
range between 3 and 30 THz with exceptional THz pulse energies. Relevant
aspects for realization and operation are discussed point by point on the
example of the European XFEL.
|
physics.acc-ph
|
the generation of frequencytunable narrowbandwidth and carrierenvelopephase stable thz pulses with fields in the mvcm regime that can be appropriately timed to the femtosecond xray pulses from freeelectronlasers is of highest scientific interest it will enable to follow the electronic and structural dynamics stimulated by nonlinear selective excitations of matter on few femtosecond time and aangstrom length scales in this article a scheme based on superradiant undulator radiation generated just after the xfel is proposed the concept utilizes cutting edge superconducting undulator technology and provides thz pulses in a frequency range between 3 and 30 thz with exceptional thz pulse energies relevant aspects for realization and operation are discussed point by point on the example of the european xfel
|
[['the', 'generation', 'of', 'frequencytunable', 'narrowbandwidth', 'and', 'carrierenvelopephase', 'stable', 'thz', 'pulses', 'with', 'fields', 'in', 'the', 'mvcm', 'regime', 'that', 'can', 'be', 'appropriately', 'timed', 'to', 'the', 'femtosecond', 'xray', 'pulses', 'from', 'freeelectronlasers', 'is', 'of', 'highest', 'scientific', 'interest', 'it', 'will', 'enable', 'to', 'follow', 'the', 'electronic', 'and', 'structural', 'dynamics', 'stimulated', 'by', 'nonlinear', 'selective', 'excitations', 'of', 'matter', 'on', 'few', 'femtosecond', 'time', 'and', 'aangstrom', 'length', 'scales', 'in', 'this', 'article', 'a', 'scheme', 'based', 'on', 'superradiant', 'undulator', 'radiation', 'generated', 'just', 'after', 'the', 'xfel', 'is', 'proposed', 'the', 'concept', 'utilizes', 'cutting', 'edge', 'superconducting', 'undulator', 'technology', 'and', 'provides', 'thz', 'pulses', 'in', 'a', 'frequency', 'range', 'between', '3', 'and', '30', 'thz', 'with', 'exceptional', 'thz', 'pulse', 'energies', 'relevant', 'aspects', 'for', 'realization', 'and', 'operation', 'are', 'discussed', 'point', 'by', 'point', 'on', 'the', 'example', 'of', 'the', 'european', 'xfel']]
|
[-0.1322313245119793, 0.24748092726021692, -0.046732340524552246, 0.000984825799437318, -0.04294935297886176, -0.1358713370732212, 0.060418369297423405, 0.5216208280635481, -0.2376199478886145, -0.27704846120181204, 0.06505783379347917, -0.25333387400180163, -0.06861002652068474, 0.31903424775306166, 0.011001001771523798, 0.05433752614723033, 0.024869203926044508, -0.05791840092239886, 0.023555067430461655, -0.1457443055422867, 0.2583613014787811, 0.11683906735304524, 0.3320312746761351, 0.0466136686678021, 0.1337701381387643, 0.019503215415904128, 0.033020291657445314, -0.10950842317381576, -0.09067702494169627, 0.09108256016263128, 0.32397418866959254, 0.04180518722067736, 0.2790966248765838, -0.43930958277162385, -0.22911491313902269, 0.013982942958847628, 0.08359792944975197, 0.10787263564851542, -0.0550447595785098, -0.2637647526698704, 0.06297741309904001, -0.15900476460399873, -0.10963468587401659, -0.020612886607913033, 0.001976114639057582, 0.09571156790088706, -0.23045856758126473, -0.02720374707915202, 0.008961522854872424, 0.0464019275646062, -0.019634112437889605, -0.010306372475505126, 0.02545975271158484, 0.018807830879887362, 0.006348359253758392, 0.030556778791321425, 0.16384171516029947, -0.11905619034645375, -0.14861726615296192, 0.359598767575847, -0.03575959409187947, -0.008490950182205489, 0.12358508657413621, -0.19293430013124274, -0.03268210931892405, 0.20957816880540686, 0.11714312614248909, 0.12666855340025254, -0.11361144007669817, 0.03817819116515804, 0.04665631958197396, 0.2633407536229831, 0.18023330107440844, 0.12145000136801738, 0.2467787368027415, 0.22688559898734875, 0.05839894943236679, 0.15104652311801597, -0.11691275014573348, -0.02563313575962386, -0.2812657104501845, -0.05975204732801233, -0.17919164008320065, 0.07697847691176757, -0.024149346399412516, -0.09871997951115129, 0.4873126577537939, 0.1659208116700732, 0.06259497622920185, -0.05510304346015411, 0.29608757047573525, 0.1354389834734259, 0.04602680104479444, 0.01137119167124336, 0.2525486250587997, 0.13507113205914645, 0.13034610004563416, -0.21960808520455757, -0.03781724824206199, 0.01097337159469035]
|
1,803.05324
|
Jumps of Milnor numbers of Brieskorn-Pham singularities in
non-degenerate families
|
The jump of the Milnor number of an isolated singularity $f_{0}$ is the
minimal non-zero difference between the Milnor numbers of $f_{0}$ and one of
its deformation $(f_{s}).$ In the case $f_{s}$ are non-degenerate singularities
we call the jump non-degenerate. We give a formula (an inductive algorithm
using diophantine equations) for the non-degenerate jump of $f_{0}$ in the case
$f_{0}$ is a convenient singularity with only one $(n-1)$-dimensional face of
its Newton diagram which equivalently (in our problem) can be replaced by the
Brieskorn-Pham singularities.
|
math.AG
|
the jump of the milnor number of an isolated singularity f_0 is the minimal nonzero difference between the milnor numbers of f_0 and one of its deformation f_s in the case f_s are nondegenerate singularities we call the jump nondegenerate we give a formula an inductive algorithm using diophantine equations for the nondegenerate jump of f_0 in the case f_0 is a convenient singularity with only one n1dimensional face of its newton diagram which equivalently in our problem can be replaced by the brieskornpham singularities
|
[['the', 'jump', 'of', 'the', 'milnor', 'number', 'of', 'an', 'isolated', 'singularity', 'f_0', 'is', 'the', 'minimal', 'nonzero', 'difference', 'between', 'the', 'milnor', 'numbers', 'of', 'f_0', 'and', 'one', 'of', 'its', 'deformation', 'f_s', 'in', 'the', 'case', 'f_s', 'are', 'nondegenerate', 'singularities', 'we', 'call', 'the', 'jump', 'nondegenerate', 'we', 'give', 'a', 'formula', 'an', 'inductive', 'algorithm', 'using', 'diophantine', 'equations', 'for', 'the', 'nondegenerate', 'jump', 'of', 'f_0', 'in', 'the', 'case', 'f_0', 'is', 'a', 'convenient', 'singularity', 'with', 'only', 'one', 'n1dimensional', 'face', 'of', 'its', 'newton', 'diagram', 'which', 'equivalently', 'in', 'our', 'problem', 'can', 'be', 'replaced', 'by', 'the', 'brieskornpham', 'singularities']]
|
[-0.24041402198593406, 0.06890675306409214, -0.11342897110563867, 0.04856322017936584, -0.07752749128815006, -0.17646612569908884, 0.021494509008548716, 0.276972455580664, -0.3034729192362112, -0.14242134570171508, 0.09765662312206319, -0.27862168784965485, -0.12776224418159793, 0.20201334519421352, -0.10134074158747407, 0.031761941498638514, 0.029556449615013074, 0.11761717315598884, -0.10025164867367814, -0.2869501915267285, 0.39627278186380865, -0.07744721500750851, 0.1866284660392386, 0.043655768813401025, 0.130788242689553, -0.02335395723553922, 0.05569724512889105, -0.03095434485551189, -0.16947806561091805, 0.07744374673895757, 0.24730492782888605, 0.06692624886465423, 0.22255965541390813, -0.3433124429381946, -0.09680455719285151, 0.20574561636347105, 0.12440697474076468, 0.06080296620699194, 0.02695510433438946, -0.2053596151390058, 0.1090581320116625, -0.13658861130311648, -0.23322124712936143, -0.04375913069747826, 0.022775530016652362, 0.035271865721134575, -0.257383541728589, 0.08298547557171654, 0.09269456219147233, 0.105151234665776, -0.0073021720464834395, -0.0906801971990396, -0.06307219100075172, 0.07895040758063689, 0.02782794945215916, 0.05770904611357871, 0.06765471389517189, -0.14301737886990476, -0.0678117973072564, 0.3711528518620659, -0.0962340894209988, -0.2704536813585197, 0.07732425336452091, -0.16124851261539494, -0.1018835663138067, 0.19208088706740561, 0.05371303141993635, 0.16624303366988896, -0.05258819979122457, 0.16862711061874186, -0.038045995112727674, 0.07938039085882552, 0.16481821801623, -0.04810264497885809, 0.19503694851608838, 0.09212777233299087, 0.054820078337455495, 0.14748310651493204, -0.03659108519992408, -0.06415641020764323, -0.400065611828776, -0.17958422861787873, -0.19659111519508501, 0.11546620228053893, -0.14287967100064955, -0.22695669919690664, 0.3752108210149933, 0.017643819437088336, 0.25213041172965484, 0.05841322509599302, 0.25506955367677353, 0.1813444676822709, 0.0031575190944268423, 0.02245230933322626, 0.16408217458930963, 0.16047903963583796, 0.024440343853305367, -0.2216239410397761, -0.006191336429294418, 0.14100815659279334]
|
1,803.05325
|
Berry curvature and symmetry broken induced Hall effect in MoS2
|
Inversion symmetry breaking and spin-orbit coupling lead to valley and spin
Hall effect in MoS2. Because of the large valley separation in momentum space,
the valley index is expected to be robust. In this paper, quantum Hall effect
in MoS2 originated from Berry curvature is analyzed after review of symmetry
structure and spin-orbit coupling Hamiltonian of MoS2. Finally an expression
and rough calculation is given for valley and spin Hall effect.
|
cond-mat.mes-hall
|
inversion symmetry breaking and spinorbit coupling lead to valley and spin hall effect in mos2 because of the large valley separation in momentum space the valley index is expected to be robust in this paper quantum hall effect in mos2 originated from berry curvature is analyzed after review of symmetry structure and spinorbit coupling hamiltonian of mos2 finally an expression and rough calculation is given for valley and spin hall effect
|
[['inversion', 'symmetry', 'breaking', 'and', 'spinorbit', 'coupling', 'lead', 'to', 'valley', 'and', 'spin', 'hall', 'effect', 'in', 'mos2', 'because', 'of', 'the', 'large', 'valley', 'separation', 'in', 'momentum', 'space', 'the', 'valley', 'index', 'is', 'expected', 'to', 'be', 'robust', 'in', 'this', 'paper', 'quantum', 'hall', 'effect', 'in', 'mos2', 'originated', 'from', 'berry', 'curvature', 'is', 'analyzed', 'after', 'review', 'of', 'symmetry', 'structure', 'and', 'spinorbit', 'coupling', 'hamiltonian', 'of', 'mos2', 'finally', 'an', 'expression', 'and', 'rough', 'calculation', 'is', 'given', 'for', 'valley', 'and', 'spin', 'hall', 'effect']]
|
[-0.20203726502581382, 0.22584077049047574, -0.060107070145944894, 0.01851549286487132, -0.08497501387667487, -0.15881269440894397, 0.02799562514844862, 0.38052462442764934, -0.30610734418454305, -0.3247207243152907, -0.01600990901556863, -0.2427274206338424, -0.2267258180908754, 0.16439784394288567, -0.02452690557340606, -0.009804663973086526, -0.05660226786325515, -0.16686022733534936, -0.09898696595993103, -0.1636683351891509, 0.29948311194147864, 0.011452689902975, 0.3062016020043635, 0.14016418237711342, 0.0636210515176956, 0.03388634435242226, 0.0758884444727864, 0.0005824701974502909, -0.11349848782460034, 0.011292595521245204, 0.2097582891189926, -0.18315720209248468, 0.17352735019341425, -0.4272784590458786, -0.1140747900238969, -0.012985933526143642, 0.09950520133625873, 0.2508797243132558, -0.09542387970526453, -0.311125991892227, 0.010768455276134568, -0.19862187138273263, -0.09524778205848916, -0.07594780280241664, 0.07961180676299502, -0.17410374586273666, -0.2364273077183613, 0.12289472352582174, 0.06259015213016053, 0.1089428961932869, -0.04328500696549743, -0.14328841566973904, -0.18366898265732845, 0.05691917950261227, 0.11189919314347208, 0.043986875071964214, 0.16607609646014448, -0.15187267570520266, -0.18431141009082047, 0.38550133819521315, -0.059709520860489876, -0.17540915668482931, 0.06468400052210814, -0.22205712740689937, -0.07880582638793218, 0.13382216464255897, 0.16896372721825634, 0.07595448004422893, -0.0879399428598281, 0.12294611319961866, 0.01587787569618561, 0.10620302563979173, 0.023585544020252328, 0.17287608472184396, 0.2885908071791202, 0.14530813958968075, 0.11070887989923686, 0.1340060732114247, -0.15383969009263623, -0.06803639938818737, -0.23241554494474975, -0.2101492057751182, -0.3185820214083077, 0.1804384261658284, -0.05690399712114759, -0.1282664446920996, 0.4381575185451394, 0.14245397249945033, 0.140519162472731, -0.05028654667745593, 0.25408013595897755, 0.15694532876598163, 0.10193405824411712, 0.006064466774647294, 0.29775222602077356, 0.2254344408046192, 0.08336943509319508, -0.3590908670096173, 0.04737002572412012, -0.005548980021455758]
|
1,803.05326
|
$C^*$-rigidity of dynamical systems and \'etale groupoids
|
This is some lecture notes I wrote for the masterclass \emph{Rigidity of
$C^*$-algebras associated to dynamics} held at the University of Copenhagen
October 16-20, 2017.
The notes is attempt to give an introduction to how \'etale groupoids can be
used to obtain $C^*$-rigidity result for topological dynamical systems.
|
math.OA math.DS math.FA
|
this is some lecture notes i wrote for the masterclass emphrigidity of calgebras associated to dynamics held at the university of copenhagen october 1620 2017 the notes is attempt to give an introduction to how etale groupoids can be used to obtain crigidity result for topological dynamical systems
|
[['this', 'is', 'some', 'lecture', 'notes', 'i', 'wrote', 'for', 'the', 'masterclass', 'emphrigidity', 'of', 'calgebras', 'associated', 'to', 'dynamics', 'held', 'at', 'the', 'university', 'of', 'copenhagen', 'october', '1620', '2017', 'the', 'notes', 'is', 'attempt', 'to', 'give', 'an', 'introduction', 'to', 'how', 'etale', 'groupoids', 'can', 'be', 'used', 'to', 'obtain', 'crigidity', 'result', 'for', 'topological', 'dynamical', 'systems']]
|
[-0.08042932392415056, 0.12166234762983724, -0.18219850241067878, 0.09908883037055506, -0.13947497272586568, -0.13986074337190849, -0.042960113984473206, 0.29560685774034007, -0.24367391608378036, -0.3382619658603947, 0.14921622230928946, -0.2979323869531459, -0.13358570702691028, 0.1743919726144126, -0.25162006090296074, -0.060083104059734244, 0.06409034769340577, 0.03026863457040584, -0.07618390106932914, -0.3523189419424756, 0.3150217026828768, 0.11781752914031769, 0.2119750619489462, 0.09968299287906353, 0.0976542675511, -0.04259570175781846, -0.004327306563549853, -0.07739671628842963, -0.16509238662237816, 0.12150482647120953, 0.422030129569008, 0.09658782104862497, 0.2631082003738018, -0.4525650389333989, -0.045552164742207905, 0.03972401915296437, 0.01215303054158675, 0.08297425103274748, 0.030246476652695142, -0.35613993428488994, 0.019966668568234494, -0.1925229485285409, -0.13180322528995098, -0.0336681640845664, 0.09333404441899125, -0.03411819461851995, -0.14662510798649586, 0.0003388077218798881, 0.08807293258971495, 0.1810403704405465, -0.040429806239541344, -0.08371619368962785, 0.03214493809030094, 0.17025107736922207, -0.02802466903317799, 0.07390460482937225, 0.1093108010815179, -0.008930069647055673, -0.19994244324241547, 0.39859871669335567, -0.0248968320319112, -0.050083576939365965, 0.17756502266893995, -0.0918739896287468, -0.21669259707522678, 0.100492836748983, 0.2024369976146424, 0.06337588201177881, -0.12023463470742424, 0.06203525331109128, -0.02485213532580677, 0.14760925604941996, 0.044854290070051844, -0.024011807119909752, 0.20694023874053297, 0.049856732611821844, -0.03679006871707896, 0.06777553739610742, 0.014527522729699836, -0.07242003147629031, -0.3704844372386628, -0.1672823734660732, -0.1014457867936568, 0.1441199324153205, 0.10819342560531135, -0.12864322417435495, 0.37697547178794727, 0.22124096635293136, 0.12101099616352548, 0.0032535812351852655, 0.12858928379384763, 0.11386136243000944, -0.02818290348922675, 0.05890341809495015, 0.19220249342268947, 0.21820484244443, 0.1781752226438294, -0.04828230182620439, -0.028481003233885513, 0.2245705751305882]
|
1,803.05327
|
Model-independent exoplanet transit spectroscopy
|
We propose a new data analysis method for obtaining transmission spectra of
exoplanet atmospheres and brightness variation across the stellar disk from
transit observations. The new method is capable of recovering exoplanet
atmosphere absorption spectra and stellar specific intensities without relying
on theoretical models of stars and planets. We fit both stellar specific
intensity and planetary radius simultaneously directly to transit light curves.
This allows stellar models to be removed from the data analysis. Furthermore,
we use a data-quality weighted filtering technique to achieve an optimal
trade-off between spectral resolution and reconstruction fidelity homogenising
the signal to noise ratio across the wavelength range. Such approach is more
efficient than conventional data binning onto a low resolution wavelength grid.
We demonstrate that our analysis is capable of re-producing results achieved by
using explicit quadratic limb darkening equation, and that the filtering
technique helps eliminating spurious spectral features in regions with strong
telluric absorption. The method is applied to the VLT FORS2 observations of the
exoplanets GJ 1214 b and WASP-49 b, and our results are in agreement with
previous studies. Comparisons between obtained stellar specific intensity and
numerical models indicates that the method is capable of accurately
reconstructing the specific intensity. The proposed method enables more robust
characterization of exoplanetary atmospheres by separating derivation of
planetary transmission and stellar specific intensity spectra (that is
model-independent) from chemical and physical interpretation.
|
astro-ph.SR astro-ph.EP astro-ph.IM
|
we propose a new data analysis method for obtaining transmission spectra of exoplanet atmospheres and brightness variation across the stellar disk from transit observations the new method is capable of recovering exoplanet atmosphere absorption spectra and stellar specific intensities without relying on theoretical models of stars and planets we fit both stellar specific intensity and planetary radius simultaneously directly to transit light curves this allows stellar models to be removed from the data analysis furthermore we use a dataquality weighted filtering technique to achieve an optimal tradeoff between spectral resolution and reconstruction fidelity homogenising the signal to noise ratio across the wavelength range such approach is more efficient than conventional data binning onto a low resolution wavelength grid we demonstrate that our analysis is capable of reproducing results achieved by using explicit quadratic limb darkening equation and that the filtering technique helps eliminating spurious spectral features in regions with strong telluric absorption the method is applied to the vlt fors2 observations of the exoplanets gj 1214 b and wasp49 b and our results are in agreement with previous studies comparisons between obtained stellar specific intensity and numerical models indicates that the method is capable of accurately reconstructing the specific intensity the proposed method enables more robust characterization of exoplanetary atmospheres by separating derivation of planetary transmission and stellar specific intensity spectra that is modelindependent from chemical and physical interpretation
|
[['we', 'propose', 'a', 'new', 'data', 'analysis', 'method', 'for', 'obtaining', 'transmission', 'spectra', 'of', 'exoplanet', 'atmospheres', 'and', 'brightness', 'variation', 'across', 'the', 'stellar', 'disk', 'from', 'transit', 'observations', 'the', 'new', 'method', 'is', 'capable', 'of', 'recovering', 'exoplanet', 'atmosphere', 'absorption', 'spectra', 'and', 'stellar', 'specific', 'intensities', 'without', 'relying', 'on', 'theoretical', 'models', 'of', 'stars', 'and', 'planets', 'we', 'fit', 'both', 'stellar', 'specific', 'intensity', 'and', 'planetary', 'radius', 'simultaneously', 'directly', 'to', 'transit', 'light', 'curves', 'this', 'allows', 'stellar', 'models', 'to', 'be', 'removed', 'from', 'the', 'data', 'analysis', 'furthermore', 'we', 'use', 'a', 'dataquality', 'weighted', 'filtering', 'technique', 'to', 'achieve', 'an', 'optimal', 'tradeoff', 'between', 'spectral', 'resolution', 'and', 'reconstruction', 'fidelity', 'homogenising', 'the', 'signal', 'to', 'noise', 'ratio', 'across', 'the', 'wavelength', 'range', 'such', 'approach', 'is', 'more', 'efficient', 'than', 'conventional', 'data', 'binning', 'onto', 'a', 'low', 'resolution', 'wavelength', 'grid', 'we', 'demonstrate', 'that', 'our', 'analysis', 'is', 'capable', 'of', 'reproducing', 'results', 'achieved', 'by', 'using', 'explicit', 'quadratic', 'limb', 'darkening', 'equation', 'and', 'that', 'the', 'filtering', 'technique', 'helps', 'eliminating', 'spurious', 'spectral', 'features', 'in', 'regions', 'with', 'strong', 'telluric', 'absorption', 'the', 'method', 'is', 'applied', 'to', 'the', 'vlt', 'fors2', 'observations', 'of', 'the', 'exoplanets', 'gj', '1214', 'b', 'and', 'wasp49', 'b', 'and', 'our', 'results', 'are', 'in', 'agreement', 'with', 'previous', 'studies', 'comparisons', 'between', 'obtained', 'stellar', 'specific', 'intensity', 'and', 'numerical', 'models', 'indicates', 'that', 'the', 'method', 'is', 'capable', 'of', 'accurately', 'reconstructing', 'the', 'specific', 'intensity', 'the', 'proposed', 'method', 'enables', 'more', 'robust', 'characterization', 'of', 'exoplanetary', 'atmospheres', 'by', 'separating', 'derivation', 'of', 'planetary', 'transmission', 'and', 'stellar', 'specific', 'intensity', 'spectra', 'that', 'is', 'modelindependent', 'from', 'chemical', 'and', 'physical', 'interpretation']]
|
[-0.02937361963731786, 0.045820087974844805, -0.0958845296256472, 0.06634745598256214, -0.12435280818463705, -0.13494106139743692, 0.06998087931576888, 0.43750957840459836, -0.18260326150267925, -0.38639273812514463, 0.05326419736575905, -0.26956280700230256, -0.11737073114239428, 0.2616814955243918, -0.09057503367070613, 0.08784397446507726, 0.13140725134363537, -0.1025799687048949, -0.03716185061448136, -0.21421217659232106, 0.2872890009622061, 0.10296868859265634, 0.19119757019373787, 0.006671391242472496, 0.05111417857834492, -0.006188452252447117, -0.110913288061747, -0.041462685034140606, -0.15249032276953514, 0.11032539991637505, 0.25153004138957136, 0.17483983921419877, 0.181576852216975, -0.343656805821788, -0.2754373523288744, 0.05249693205449974, 0.14415956345716224, 0.07451209459274877, -0.049773992743982635, -0.24936214226855202, 0.06530856597389798, -0.10286171770884399, -0.11457325201623923, -0.08048774097948518, -0.016332694403288325, 0.006336413819533996, -0.315341920811504, 0.09270053709537913, 0.020146014148523975, 0.14625060338502563, -0.1272874758954073, -0.1096210404783162, -0.054321461271771176, 0.11352325707072124, -0.021957563417841677, -0.00465574364674999, 0.12557087610330836, -0.08933552313803422, -0.020759214681683017, 0.3666857256753346, -0.14105658791889386, -0.09735266265650504, 0.20219178040111316, -0.17616704040040226, -0.09235645547574264, 0.1746726635136, 0.16135245493987338, 0.13597216434353823, -0.1650557895496032, -0.0003797390522876567, -0.007134893998060392, 0.22835040764525272, 0.07656065737381253, 0.03908243391676943, 0.28162590175557994, 0.1313432623046617, 0.052419803924777235, 0.07782311199357994, -0.25126558475249233, -0.03433905633809004, -0.2031788717036229, -0.08492553986275496, -0.16514494056624307, -0.004791309809979198, -0.1491656651689013, -0.10987872607684715, 0.4056752174828348, 0.19589679574678545, 0.19694311343597076, 0.06288152993895627, 0.39502325979382713, 0.12214150608112571, 0.07432947058167601, 0.06303545103436865, 0.2447230478618538, 0.16159375195745299, 0.11091003616800019, -0.2699979091323424, 0.06298564644693092, 0.005300093938364733]
|
1,803.05328
|
Volumes of 3-ball quotients as intersection numbers
|
We give an explicit description of the 3-ball quotients constructed by
Couwenberg-Heckman-Looijenga, and deduce the value of their orbifold Euler
characteristics. For each lattice, we also give a presentation in terms of
generators and relations.
|
math.AG math.DG
|
we give an explicit description of the 3ball quotients constructed by couwenbergheckmanlooijenga and deduce the value of their orbifold euler characteristics for each lattice we also give a presentation in terms of generators and relations
|
[['we', 'give', 'an', 'explicit', 'description', 'of', 'the', '3ball', 'quotients', 'constructed', 'by', 'couwenbergheckmanlooijenga', 'and', 'deduce', 'the', 'value', 'of', 'their', 'orbifold', 'euler', 'characteristics', 'for', 'each', 'lattice', 'we', 'also', 'give', 'a', 'presentation', 'in', 'terms', 'of', 'generators', 'and', 'relations']]
|
[-0.17044372042374953, 0.04704932902116395, -0.10964142717421055, 0.08169586762253728, -0.09105124010571412, -0.07355554262176156, 0.008757884294859, 0.31433181571108954, -0.262652143104268, -0.2562187979796103, 0.10963262786223953, -0.25008935886435213, -0.14337123406252691, 0.20787740371056965, -0.09510032194001335, -0.053585809575659886, 0.04860419173325811, 0.07934558407536575, -0.14204829446971418, -0.26568852082959243, 0.3548991176432797, 0.004042984239224876, 0.21072056623441832, 0.06881230313863074, 0.177948409079441, 0.012620808370411397, -0.05834251599652426, -0.018822058556335314, -0.2848206058942846, 0.14382082921053682, 0.255926071533135, 0.06552475946290152, 0.0840427041053772, -0.4452297766293798, -0.0896825249972088, 0.10589877651738269, 0.12203539623213666, 0.07690018234508378, -0.04348561851989611, -0.23313526234456472, 0.07879031492131097, -0.21292556298763624, -0.18960224354107466, -0.11213286173130785, 0.05512982090669019, 0.06646498053201608, -0.2090426818999861, -0.03157980088892925, 0.09272707578326975, 0.17283243568214987, -0.06909778112811701, -0.11797309041222824, -0.034391040727496144, 0.14743352853027838, 0.008112502630267825, -0.0507021868069257, 0.03046093372894185, -0.14754074737429618, -0.16167122289272293, 0.40200475677847863, -0.019679865720016617, -0.25986687993364677, 0.09332860504010958, -0.10530235771355885, -0.11728145855345896, 0.09760692457535437, 0.08762513358877706, 0.09436586680156844, -0.06691805943181472, 0.12271227905460234, -0.11143879398171391, 0.054446903722626824, 0.08174634855240584, 0.05079608322786433, 0.13889748038990157, 0.05103578948016677, 0.04056031528328146, 0.19563689382879862, 0.052107337063976696, -0.030441481566854885, -0.41760289232645714, -0.21492948331204909, -0.10279372440917152, 0.14688819072076253, -0.138753622596518, -0.2019420615796532, 0.419593066402844, 0.07196700760562505, 0.24556102145995412, 0.14185957514813968, 0.2051518868122782, 0.14882815070450306, 0.0003819854065243687, 0.05527710538091404, 0.11495690731597798, 0.14897253013748143, -0.017000613946999824, -0.16119425036179433, -0.006831095780112914, 0.29290054576205354]
|
1,803.05329
|
Revealing neutral bremsstrahlung in two-phase argon electroluminescence
|
Proportional electroluminescence (EL) in noble gases has long been used in
two-phase detectors for dark matter search, to record ionization signals
induced by particle scattering in the noble-gas liquid (S2 signals). Until
recently, it was believed that proportional electroluminescence was fully due
to VUV emission of noble gas excimers produced in atomic collisions with
excited atoms, the latter being in turn produced by drifting electrons. In this
work we consider an additional mechanism of proportional electroluminescence,
namely that of bremsstrahlung of drifting electrons scattered on neutral atoms
(so-called neutral bremsstrahlung); it is systemically studied here both
theoretically and experimentally. In particular, the absolute EL yield has for
the first time been measured in pure gaseous argon in the two-phase mode, using
a dedicated two-phase detector with EL gap optically read out by cryogenic PMTs
and SiPMs. We show that the neutral bremsstrahlung effect can explain two
intriguing observations in EL radiation: that of the substantial contribution
of the non-VUV spectral component, extending from the UV to NIR, and that of
the photon emission at lower electric fields, below the Ar excitation
threshold. Possible applications of neutral bremsstrahlung effect in two-phase
dark matter detectors are discussed.
|
physics.ins-det astro-ph.IM hep-ex
|
proportional electroluminescence el in noble gases has long been used in twophase detectors for dark matter search to record ionization signals induced by particle scattering in the noblegas liquid s2 signals until recently it was believed that proportional electroluminescence was fully due to vuv emission of noble gas excimers produced in atomic collisions with excited atoms the latter being in turn produced by drifting electrons in this work we consider an additional mechanism of proportional electroluminescence namely that of bremsstrahlung of drifting electrons scattered on neutral atoms socalled neutral bremsstrahlung it is systemically studied here both theoretically and experimentally in particular the absolute el yield has for the first time been measured in pure gaseous argon in the twophase mode using a dedicated twophase detector with el gap optically read out by cryogenic pmts and sipms we show that the neutral bremsstrahlung effect can explain two intriguing observations in el radiation that of the substantial contribution of the nonvuv spectral component extending from the uv to nir and that of the photon emission at lower electric fields below the ar excitation threshold possible applications of neutral bremsstrahlung effect in twophase dark matter detectors are discussed
|
[['proportional', 'electroluminescence', 'el', 'in', 'noble', 'gases', 'has', 'long', 'been', 'used', 'in', 'twophase', 'detectors', 'for', 'dark', 'matter', 'search', 'to', 'record', 'ionization', 'signals', 'induced', 'by', 'particle', 'scattering', 'in', 'the', 'noblegas', 'liquid', 's2', 'signals', 'until', 'recently', 'it', 'was', 'believed', 'that', 'proportional', 'electroluminescence', 'was', 'fully', 'due', 'to', 'vuv', 'emission', 'of', 'noble', 'gas', 'excimers', 'produced', 'in', 'atomic', 'collisions', 'with', 'excited', 'atoms', 'the', 'latter', 'being', 'in', 'turn', 'produced', 'by', 'drifting', 'electrons', 'in', 'this', 'work', 'we', 'consider', 'an', 'additional', 'mechanism', 'of', 'proportional', 'electroluminescence', 'namely', 'that', 'of', 'bremsstrahlung', 'of', 'drifting', 'electrons', 'scattered', 'on', 'neutral', 'atoms', 'socalled', 'neutral', 'bremsstrahlung', 'it', 'is', 'systemically', 'studied', 'here', 'both', 'theoretically', 'and', 'experimentally', 'in', 'particular', 'the', 'absolute', 'el', 'yield', 'has', 'for', 'the', 'first', 'time', 'been', 'measured', 'in', 'pure', 'gaseous', 'argon', 'in', 'the', 'twophase', 'mode', 'using', 'a', 'dedicated', 'twophase', 'detector', 'with', 'el', 'gap', 'optically', 'read', 'out', 'by', 'cryogenic', 'pmts', 'and', 'sipms', 'we', 'show', 'that', 'the', 'neutral', 'bremsstrahlung', 'effect', 'can', 'explain', 'two', 'intriguing', 'observations', 'in', 'el', 'radiation', 'that', 'of', 'the', 'substantial', 'contribution', 'of', 'the', 'nonvuv', 'spectral', 'component', 'extending', 'from', 'the', 'uv', 'to', 'nir', 'and', 'that', 'of', 'the', 'photon', 'emission', 'at', 'lower', 'electric', 'fields', 'below', 'the', 'ar', 'excitation', 'threshold', 'possible', 'applications', 'of', 'neutral', 'bremsstrahlung', 'effect', 'in', 'twophase', 'dark', 'matter', 'detectors', 'are', 'discussed']]
|
[-0.023846222212215742, 0.24106299354200764, -0.059313400923155055, 0.05806782698640839, 0.02369856705936866, -0.143627077811517, -0.015764699513331436, 0.39814465135718, -0.20354737755245506, -0.32239566293473426, -0.010079736207038737, -0.3504050611983985, -0.02904458065302326, 0.1610387737868736, 0.00467623438901053, 0.029422793893191294, -0.028341745345208506, -0.06750626558055862, 0.021940791751078974, -0.2016139976763859, 0.22378031214317068, 0.1427515194655802, 0.2624539426504037, 0.09676478145023187, 0.09614892445552425, -0.036707085595490074, -0.04078636331609092, -0.02982990163115737, -0.08820923356050536, 0.007457769570352796, 0.28296792221924244, 0.028449553658421604, 0.1592075797681434, -0.47342585953764427, -0.21893473583010908, 0.12220742666664032, 0.14962057827804714, 0.03919107301805455, -0.13629950197855345, -0.272160474000833, 0.0020514043203244607, -0.18898757575796202, -0.1036963510613602, 0.03016221285200654, 0.02918158259529334, 0.02463108406458886, -0.21421853059377427, 0.06184752841348736, 0.036838517994739306, -0.023458780634861728, -0.0644347306364813, -0.10392871934156388, 0.008927931703436068, -0.01593047010604865, 0.04731392052012663, -0.018713224331776683, 0.22865008740948561, -0.14771172504287022, -0.09381963442533445, 0.3432686742920524, -0.1691383984966729, -0.06532171524058168, 0.200558196580133, -0.1966007721837228, -0.0682382176479456, 0.28712705787844384, 0.12148552962507193, 0.11407159015249747, -0.18391029536365888, 0.0666516284377744, -0.036381556193989056, 0.1670254855398805, 0.1302460391098299, 0.060829693953005165, 0.24908935834582036, 0.1772464047287567, 0.016021286722463675, 0.1374080854259097, -0.18510697223066996, -0.03823853528204684, -0.25739444981938087, -0.1742187792196488, -0.15869929194495153, 0.02853386171869389, 0.04976050070933222, -0.10855052286209778, 0.35689966765065223, 0.11282200795861008, 0.14158735184046703, -0.09766532854200938, 0.32481291842623017, 0.10571493427597511, 0.05418521378768417, 0.020849251412810424, 0.3583572787543138, 0.17269555635415226, 0.1308538818039382, -0.27524172300353456, 0.056950715239135884, -0.005088366139441347]
|
1,803.0533
|
The local and global dynamics of a cancer tumor growth and chemotherapy
treatment model
|
In this paper, we studied phase-space analysis of a certain mathematical
model of tumor growth with an immune responses and chemotherapy therapy.
Mathematical modelling of this process is viewed as a potentially powerful tool
in the development of improved treatment regimens. Mathematical analysis of the
model equations with multipoint initial condition, regarding nature of
equilibria, local and global stability have been investigated. We studied some
features of behavior of one of three-dimensional tumor growth models with
dynamics described in terms of densities of three cells populations: tumor
cells, healthy host cells and effector immune cells. We found sufficient
conditions, under which trajectories from the positive domain of feasible
multipoint initial conditions tend to one of equilibrium points. The addition
of a drug term to the system can move the solution trajectory into a desirable
basin of attraction. We show that the solutions of the model with a
time-varying drug term approach can be evaluated more fruitful way and down to
earth style from the point of practical importance than the solutions of the
system without drug treatment, in the condition of stimulated immune processes,
only.
|
math.DS
|
in this paper we studied phasespace analysis of a certain mathematical model of tumor growth with an immune responses and chemotherapy therapy mathematical modelling of this process is viewed as a potentially powerful tool in the development of improved treatment regimens mathematical analysis of the model equations with multipoint initial condition regarding nature of equilibria local and global stability have been investigated we studied some features of behavior of one of threedimensional tumor growth models with dynamics described in terms of densities of three cells populations tumor cells healthy host cells and effector immune cells we found sufficient conditions under which trajectories from the positive domain of feasible multipoint initial conditions tend to one of equilibrium points the addition of a drug term to the system can move the solution trajectory into a desirable basin of attraction we show that the solutions of the model with a timevarying drug term approach can be evaluated more fruitful way and down to earth style from the point of practical importance than the solutions of the system without drug treatment in the condition of stimulated immune processes only
|
[['in', 'this', 'paper', 'we', 'studied', 'phasespace', 'analysis', 'of', 'a', 'certain', 'mathematical', 'model', 'of', 'tumor', 'growth', 'with', 'an', 'immune', 'responses', 'and', 'chemotherapy', 'therapy', 'mathematical', 'modelling', 'of', 'this', 'process', 'is', 'viewed', 'as', 'a', 'potentially', 'powerful', 'tool', 'in', 'the', 'development', 'of', 'improved', 'treatment', 'regimens', 'mathematical', 'analysis', 'of', 'the', 'model', 'equations', 'with', 'multipoint', 'initial', 'condition', 'regarding', 'nature', 'of', 'equilibria', 'local', 'and', 'global', 'stability', 'have', 'been', 'investigated', 'we', 'studied', 'some', 'features', 'of', 'behavior', 'of', 'one', 'of', 'threedimensional', 'tumor', 'growth', 'models', 'with', 'dynamics', 'described', 'in', 'terms', 'of', 'densities', 'of', 'three', 'cells', 'populations', 'tumor', 'cells', 'healthy', 'host', 'cells', 'and', 'effector', 'immune', 'cells', 'we', 'found', 'sufficient', 'conditions', 'under', 'which', 'trajectories', 'from', 'the', 'positive', 'domain', 'of', 'feasible', 'multipoint', 'initial', 'conditions', 'tend', 'to', 'one', 'of', 'equilibrium', 'points', 'the', 'addition', 'of', 'a', 'drug', 'term', 'to', 'the', 'system', 'can', 'move', 'the', 'solution', 'trajectory', 'into', 'a', 'desirable', 'basin', 'of', 'attraction', 'we', 'show', 'that', 'the', 'solutions', 'of', 'the', 'model', 'with', 'a', 'timevarying', 'drug', 'term', 'approach', 'can', 'be', 'evaluated', 'more', 'fruitful', 'way', 'and', 'down', 'to', 'earth', 'style', 'from', 'the', 'point', 'of', 'practical', 'importance', 'than', 'the', 'solutions', 'of', 'the', 'system', 'without', 'drug', 'treatment', 'in', 'the', 'condition', 'of', 'stimulated', 'immune', 'processes', 'only']]
|
[-0.09206163580340611, 0.08357429033518152, -0.10258583695803945, 0.05293347097881574, -0.02637866433407809, -0.15505016401561128, 0.07171798969707074, 0.31190039651418056, -0.23461703652062932, -0.25453254770789596, 0.10725110260599821, -0.23641538837471524, -0.21523318820305773, 0.1691717997382118, -0.08413626125736816, 0.06274654322580711, 0.07413334934846372, 0.011442939738264761, 0.020059817111925095, -0.22836198484952988, 0.28384620520991044, 0.038555235204261705, 0.28755708718672396, 0.019705526457432457, 0.11619380626928162, -0.02675080647994135, -0.00032166302380328245, 0.03700231923847585, -0.15400387374640953, 0.11763425833621138, 0.25290402335178097, 0.16969843797159154, 0.3340283552763631, -0.493097106236461, -0.25689756549089343, 0.11231850061087391, 0.1450418017030618, 0.12439654997008777, -0.05194794364577172, -0.2600157450783897, 0.07946404054056148, -0.1530372186412884, -0.19954769374752368, -0.06265202968104465, -0.006723418728624647, 0.03382416068689545, -0.2975814581169067, 0.09212490878495816, 0.05549147172604461, 0.08516333152011439, -0.1485511259352033, -0.09635035307398318, -0.051558305036175894, 0.1698323740271499, 0.0884358043101226, -0.010612215341471538, 0.16659447209708192, -0.17455970174884675, -0.08564508674112527, 0.36807270740737785, -0.009391705418474392, -0.22747637106080515, 0.22850447643447566, -0.13444526581899138, -0.06921568533808396, 0.14078629891312605, 0.19641389489626965, 0.1396587538004324, -0.22934305812672687, 0.0126883795120316, 0.022246843772764143, 0.1321471269527211, 0.06482170764356851, 0.007129584950067707, 0.18755950715292144, 0.2167201266498179, 0.055743794730939975, 0.12358604571844979, -0.0550540026079083, -0.11830544382887515, -0.2545668102083476, -0.14556226315027154, -0.09205461612248139, 0.05237807761877775, -0.07614659704236515, -0.1955064938403666, 0.42298576209341754, 0.12985657984642562, 0.14140669673026815, 0.02603314353996334, 0.24611096025721446, 0.07664060723823117, 0.058363439414549516, -0.014246737156566736, 0.17299761175432846, 0.09829351008315948, 0.10505550165685851, -0.25148409632462504, 0.1237484505123182, 0.05114655115364774]
|
1,803.05331
|
Asymptotic limits and optimal control for the Cahn-Hilliard system with
convection and dynamic boundary conditions
|
In this paper, we study initial-boundary value problems for the
Cahn--Hilliard system with convection and nonconvex potential, where dynamic
boundary conditions are assumed for both the associated order parameter and the
corresponding chemical potential. While recent works addressed the case of
viscous Cahn--Hilliard systems, the `pure' nonviscous case is investigated
here. In its first part, the paper deals with the asymptotic behavior of the
solutions as time approaches infinity. It is shown that the $\omega$-limit of
any trajectory can be characterized in terms of stationary solutions, provided
the initial data are sufficiently smooth. The second part of the paper deals
with the optimal control of the system by the fluid velocity. Results
concerning existence and first-order necessary optimality conditions are
proved. Here, we have to restrict ourselves to the case of everywhere defined
smooth potentials. In both parts of the paper, we start from corresponding
known results for the viscous case, derive sufficiently strong estimates that
are uniform with respect to the (positive) viscosity parameter, and then let
the viscosity tend to zero to establish the sought results for the nonviscous
case.
|
math.OC
|
in this paper we study initialboundary value problems for the cahnhilliard system with convection and nonconvex potential where dynamic boundary conditions are assumed for both the associated order parameter and the corresponding chemical potential while recent works addressed the case of viscous cahnhilliard systems the pure nonviscous case is investigated here in its first part the paper deals with the asymptotic behavior of the solutions as time approaches infinity it is shown that the omegalimit of any trajectory can be characterized in terms of stationary solutions provided the initial data are sufficiently smooth the second part of the paper deals with the optimal control of the system by the fluid velocity results concerning existence and firstorder necessary optimality conditions are proved here we have to restrict ourselves to the case of everywhere defined smooth potentials in both parts of the paper we start from corresponding known results for the viscous case derive sufficiently strong estimates that are uniform with respect to the positive viscosity parameter and then let the viscosity tend to zero to establish the sought results for the nonviscous case
|
[['in', 'this', 'paper', 'we', 'study', 'initialboundary', 'value', 'problems', 'for', 'the', 'cahnhilliard', 'system', 'with', 'convection', 'and', 'nonconvex', 'potential', 'where', 'dynamic', 'boundary', 'conditions', 'are', 'assumed', 'for', 'both', 'the', 'associated', 'order', 'parameter', 'and', 'the', 'corresponding', 'chemical', 'potential', 'while', 'recent', 'works', 'addressed', 'the', 'case', 'of', 'viscous', 'cahnhilliard', 'systems', 'the', 'pure', 'nonviscous', 'case', 'is', 'investigated', 'here', 'in', 'its', 'first', 'part', 'the', 'paper', 'deals', 'with', 'the', 'asymptotic', 'behavior', 'of', 'the', 'solutions', 'as', 'time', 'approaches', 'infinity', 'it', 'is', 'shown', 'that', 'the', 'omegalimit', 'of', 'any', 'trajectory', 'can', 'be', 'characterized', 'in', 'terms', 'of', 'stationary', 'solutions', 'provided', 'the', 'initial', 'data', 'are', 'sufficiently', 'smooth', 'the', 'second', 'part', 'of', 'the', 'paper', 'deals', 'with', 'the', 'optimal', 'control', 'of', 'the', 'system', 'by', 'the', 'fluid', 'velocity', 'results', 'concerning', 'existence', 'and', 'firstorder', 'necessary', 'optimality', 'conditions', 'are', 'proved', 'here', 'we', 'have', 'to', 'restrict', 'ourselves', 'to', 'the', 'case', 'of', 'everywhere', 'defined', 'smooth', 'potentials', 'in', 'both', 'parts', 'of', 'the', 'paper', 'we', 'start', 'from', 'corresponding', 'known', 'results', 'for', 'the', 'viscous', 'case', 'derive', 'sufficiently', 'strong', 'estimates', 'that', 'are', 'uniform', 'with', 'respect', 'to', 'the', 'positive', 'viscosity', 'parameter', 'and', 'then', 'let', 'the', 'viscosity', 'tend', 'to', 'zero', 'to', 'establish', 'the', 'sought', 'results', 'for', 'the', 'nonviscous', 'case']]
|
[-0.1485140045924409, 0.0736248644227469, -0.0595055846318316, 0.014703214478776228, -0.05931095610075927, -0.12563895895964577, -0.020407601559002484, 0.30111423637820306, -0.26725223502220974, -0.23321773093942152, 0.16624276501454086, -0.2736205165351199, -0.1259181087857092, 0.16838141948951837, -0.08187489826641567, 0.1145481117358201, 0.053109761115143095, 0.05700102935616787, -0.05367866026206904, -0.24297912922754353, 0.38939238996449654, -0.006614200371716704, 0.22261988866567653, 0.0584178988151457, 0.07205074166611686, -0.05666982574173464, -0.008974664874635841, 0.06792981376497914, -0.20885088832341814, 0.054278954272516645, 0.24973067025664253, 0.043786706981136576, 0.2926718336785888, -0.43809951991252194, -0.2165945776134402, 0.13968950136792385, 0.14035680925903413, 0.08754816282813048, -0.03117470758721478, -0.25081507941313946, 0.1191697842467085, -0.12469093108698112, -0.20252774832616713, -0.06964198133017827, 0.018707373330451468, 0.06700158150128478, -0.3122979157046507, 0.10574323547349035, 0.09202054402903541, 0.005234976759651205, -0.17536390608798325, -0.0867984624014103, -0.02920046333443619, 0.11222105164843314, 0.10296605033339462, 0.01785876826897448, 0.05007607738518125, -0.14694482640869874, -0.045087353218919955, 0.39293581838361347, -0.07593528640899132, -0.2564191187291846, 0.2201016694588771, -0.151160505792167, -0.0715460477238214, 0.09972969191097705, 0.16482172898723038, 0.16902112636387676, -0.1454242488125801, 0.12731832057457662, -0.02294774726480962, 0.12361119532507363, 0.061537717683957174, -0.01812106689213069, 0.1313595334272627, 0.1358810717823332, 0.11319982429971448, 0.17647611456833637, -0.04209961886386576, -0.13023965592639378, -0.35077611965915334, -0.12926937404324065, -0.17415454281509374, 0.016217861099393813, -0.06836720616371207, -0.15305479344509537, 0.36047411342867863, 0.14451729439987013, 0.17891086473968904, 0.10513475260333988, 0.2644917215885861, 0.15831562462147672, -0.03565844626084052, 0.0799414407702388, 0.2530811657990933, 0.15187951477863673, 0.1577892794880177, -0.21913958037963552, 0.07522173539753287, 0.07858625814257252]
|
1,803.05332
|
Semi-implicit second order schemes for numerical solution of level set
advection equation on Cartesian grids
|
A new parametric class of semi-implicit numerical schemes for a level set
advection equation on Cartesian grids is derived and analyzed. An accuracy and
a stability study is provided for a linear advection equation with a variable
velocity using partial Lax-Wendroff procedure and numerical von Neumann
stability analysis. The obtained semi-implicit kappa-scheme is 2nd order
accurate in space and time in any dimensional case when using a dimension by
dimension extension of the one-dimensional scheme that is not the case for
analogous fully explicit or fully implicit kappa-schemes. A further improvement
is obtained by using so-called Corner Transport Upwind extension in
two-dimensional case. The extended semi-implicit kappa-scheme with a specific
(velocity dependent) value of kappa is 3rd order accurate in space and time for
a constant advection velocity, and it is unconditional stable according to the
numerical von Neumann stability analysis for the linear advection equation in
general.
|
math.NA cs.NA
|
a new parametric class of semiimplicit numerical schemes for a level set advection equation on cartesian grids is derived and analyzed an accuracy and a stability study is provided for a linear advection equation with a variable velocity using partial laxwendroff procedure and numerical von neumann stability analysis the obtained semiimplicit kappascheme is 2nd order accurate in space and time in any dimensional case when using a dimension by dimension extension of the onedimensional scheme that is not the case for analogous fully explicit or fully implicit kappaschemes a further improvement is obtained by using socalled corner transport upwind extension in twodimensional case the extended semiimplicit kappascheme with a specific velocity dependent value of kappa is 3rd order accurate in space and time for a constant advection velocity and it is unconditional stable according to the numerical von neumann stability analysis for the linear advection equation in general
|
[['a', 'new', 'parametric', 'class', 'of', 'semiimplicit', 'numerical', 'schemes', 'for', 'a', 'level', 'set', 'advection', 'equation', 'on', 'cartesian', 'grids', 'is', 'derived', 'and', 'analyzed', 'an', 'accuracy', 'and', 'a', 'stability', 'study', 'is', 'provided', 'for', 'a', 'linear', 'advection', 'equation', 'with', 'a', 'variable', 'velocity', 'using', 'partial', 'laxwendroff', 'procedure', 'and', 'numerical', 'von', 'neumann', 'stability', 'analysis', 'the', 'obtained', 'semiimplicit', 'kappascheme', 'is', '2nd', 'order', 'accurate', 'in', 'space', 'and', 'time', 'in', 'any', 'dimensional', 'case', 'when', 'using', 'a', 'dimension', 'by', 'dimension', 'extension', 'of', 'the', 'onedimensional', 'scheme', 'that', 'is', 'not', 'the', 'case', 'for', 'analogous', 'fully', 'explicit', 'or', 'fully', 'implicit', 'kappaschemes', 'a', 'further', 'improvement', 'is', 'obtained', 'by', 'using', 'socalled', 'corner', 'transport', 'upwind', 'extension', 'in', 'twodimensional', 'case', 'the', 'extended', 'semiimplicit', 'kappascheme', 'with', 'a', 'specific', 'velocity', 'dependent', 'value', 'of', 'kappa', 'is', '3rd', 'order', 'accurate', 'in', 'space', 'and', 'time', 'for', 'a', 'constant', 'advection', 'velocity', 'and', 'it', 'is', 'unconditional', 'stable', 'according', 'to', 'the', 'numerical', 'von', 'neumann', 'stability', 'analysis', 'for', 'the', 'linear', 'advection', 'equation', 'in', 'general']]
|
[-0.11288599792842557, 0.05451770264706432, -0.07065216373956325, 0.026398220843141328, -0.08502573449620787, -0.15337900948222905, 0.004056195563757095, 0.3227974386207861, -0.25812794875708367, -0.21375100437526395, 0.16804367295691275, -0.22359989182136597, -0.07346879239954358, 0.23311619759461252, -0.031868812301810705, 0.10375169120399522, 0.07063682084795417, 0.008036396016373116, -0.08593017902370974, -0.2409073622472787, 0.33097757914437764, 0.03651322642353927, 0.26129185625028856, -0.007632055250154871, 0.14521358815991148, -0.03650136368323852, -0.050529045109846155, 0.0948277044554576, -0.15776695107565408, 0.08137535352099902, 0.20543722572521034, -0.013735160877814099, 0.29898083109058576, -0.36772909090968264, -0.2622496039673154, 0.050687205824101356, 0.138569733672807, 0.11642963329621521, -0.059848364129770217, -0.26116783839181623, 0.07002577658815524, -0.19337544827975434, -0.1599442993392091, -0.11773586630517123, 0.027979788269062025, 0.0237013604761209, -0.3393912092389754, 0.15889320416901845, 0.061451766034904994, 0.0935197698069597, -0.09110667766863798, -0.058890878982354136, -0.044982358852882875, 0.0418322631179713, -0.03448389571153743, -0.013099060467322402, 0.006616310229157509, -0.06033598970001933, -0.07418245066679557, 0.39924608675254586, -0.1180918780678161, -0.3251411416219408, 0.15430937449409798, -0.11958100243161122, -0.06608396343772813, 0.14629859829536912, 0.15109253421958005, 0.1524373120812671, -0.0970707114673652, 0.11942358788650888, -0.03798680736360197, 0.19138638874762184, 0.04618320664783724, -0.06878072524967534, 0.061454386836817476, 0.17737817944369602, 0.12991673861737965, 0.1063242237254673, -0.05421262084138991, -0.14238534697971375, -0.34287589328477575, -0.20461975748323658, -0.1597897457402377, 0.02264464777812352, -0.11361881781592775, -0.1621832560223597, 0.35261528919930357, 0.09184151108277293, 0.12359982032683633, 0.06218995935074529, 0.34469101416124476, 0.2024402552701851, -0.004534481699122306, 0.12203114908695424, 0.1877347255271359, 0.16416425563610432, 0.11720293066876174, -0.24738407321591058, 0.04027812710969525, 0.2170774027876252]
|
1,803.05333
|
Observability of the Efimov spectrum in an electron-atom-atom system
|
The bound states of a system consisting of two heavy identical atoms and one
light electron interacting through the finite-range pairwise potentials are
explored, focusing on their dependence on the electron-atom scattering length.
In the case of an exact resonance in the electron-atom interaction, the binding
energy of an electron yields an effective $1/r^{2}$ potential for the relative
motion of the atoms; One major finding is a universal potential that depends on
the polarization length which goes beyond the Efimov region. An analytic
expression for that potential is extracted from numerical calculations. The
spectrum of the e+Rb+Rb system produced by the electron-atom polarization
interaction exhibits three main sections, a non-universal transition region, a
quasi-Efimov region, and a densely packed Efimov region.
|
cond-mat.quant-gas physics.atm-clus physics.atom-ph
|
the bound states of a system consisting of two heavy identical atoms and one light electron interacting through the finiterange pairwise potentials are explored focusing on their dependence on the electronatom scattering length in the case of an exact resonance in the electronatom interaction the binding energy of an electron yields an effective 1r2 potential for the relative motion of the atoms one major finding is a universal potential that depends on the polarization length which goes beyond the efimov region an analytic expression for that potential is extracted from numerical calculations the spectrum of the erbrb system produced by the electronatom polarization interaction exhibits three main sections a nonuniversal transition region a quasiefimov region and a densely packed efimov region
|
[['the', 'bound', 'states', 'of', 'a', 'system', 'consisting', 'of', 'two', 'heavy', 'identical', 'atoms', 'and', 'one', 'light', 'electron', 'interacting', 'through', 'the', 'finiterange', 'pairwise', 'potentials', 'are', 'explored', 'focusing', 'on', 'their', 'dependence', 'on', 'the', 'electronatom', 'scattering', 'length', 'in', 'the', 'case', 'of', 'an', 'exact', 'resonance', 'in', 'the', 'electronatom', 'interaction', 'the', 'binding', 'energy', 'of', 'an', 'electron', 'yields', 'an', 'effective', '1r2', 'potential', 'for', 'the', 'relative', 'motion', 'of', 'the', 'atoms', 'one', 'major', 'finding', 'is', 'a', 'universal', 'potential', 'that', 'depends', 'on', 'the', 'polarization', 'length', 'which', 'goes', 'beyond', 'the', 'efimov', 'region', 'an', 'analytic', 'expression', 'for', 'that', 'potential', 'is', 'extracted', 'from', 'numerical', 'calculations', 'the', 'spectrum', 'of', 'the', 'erbrb', 'system', 'produced', 'by', 'the', 'electronatom', 'polarization', 'interaction', 'exhibits', 'three', 'main', 'sections', 'a', 'nonuniversal', 'transition', 'region', 'a', 'quasiefimov', 'region', 'and', 'a', 'densely', 'packed', 'efimov', 'region']]
|
[-0.1558963806219712, 0.17972222295004733, -0.06878949982943718, 0.0752437208806548, 0.04823162069372019, -0.1462728930167666, 0.012703096494078636, 0.321738665719994, -0.23235925197789148, -0.24860636296705538, -0.04141839889285131, -0.35777097347215947, -0.0994184453464935, 0.19423762461397515, 0.09060182962312262, 0.019132119878351752, 0.03249041120983472, 0.08242705228401959, -0.03485060305170277, -0.16339991910054402, 0.3418826660798753, 0.06734403340975527, 0.23636397634859846, 0.14426164894106508, 0.06653743842225365, 0.07084923933510583, 0.06979112323185727, -0.028562428257545503, -0.12563975563553112, 0.1432780951878815, 0.15424126068994934, 0.006514260694071525, 0.20474512809339693, -0.4003567919369881, -0.18828556115324258, 0.05707427954199497, 0.20671522412879564, 0.14533809316833698, -0.06528499412170354, -0.280057871328792, -0.043174426791359896, -0.17876169985520238, -0.15993724332461054, -0.01947238787366938, 0.06206681228735868, 0.020028717831528486, -0.28428846142966957, 0.07689246015516579, 0.02449219654777191, 0.035585946655289774, -0.11491576486321933, -0.11421645759847485, 0.005139210081400992, 0.10419082727690204, 0.027946235051969488, 0.018818278851754525, 0.19014012560584903, -0.13467032915106467, -0.06883181177251854, 0.37984306220466096, -0.07524406165275879, -0.14398607745484895, 0.19189167902374468, -0.15377338332351015, -0.057213474761600755, 0.1979602115745304, 0.1618913811056272, 0.10193849689945453, -0.15631284967784873, 0.11889577822802792, -0.03789264357359219, 0.1936789224836036, 0.06205542927789854, 0.03688070282512227, 0.21893323385821922, 0.18270819872116842, 0.02679048534952292, 0.12790834609450413, -0.11614043220384594, -0.13542727978915728, -0.32307373782416354, -0.09672249132178395, -0.20908933890858242, 0.0035794149456201355, -0.08429059793193386, -0.17719292022804378, 0.39604452812746793, 0.060294970697840726, 0.2328761302545166, -0.011210700967583899, 0.29389817710230204, 0.12908569380578375, 0.06639232236829375, 0.016898468230702297, 0.29396296012364015, 0.1348211074662747, 0.0337383413546476, -0.29103440759867866, 0.02839331954968076, 0.0538185439679083]
|
1,803.05334
|
A Statistical Mechanical Approach for the Parametrization of the
Coupling in a Fast-Slow System
|
Constructing accurate, flexible, and efficient parametrizations is one of the
great challenges in the numerical modelling of geophysical fluids. We consider
here the simple yet paradigmatic case of a Lorenz 84 model forced by a Lorenz
63 model and derive a parametrization using a recently developed statistical
mechanical methodology based on the Ruelle response theory. We derive an
expression for the deterministic and the stochastic component of the
parametrization and we show that the approach allows for dealing seamlessly
with the case of the Lorenz 63 being a fast as well as a slow forcing compared
to the characteristic time scales of the Lorenz 84 model. We test our results
using both standard metrics based on the moments of the variables of interest
as well as Wasserstein distance between the projected measure of the original
system on the Lorenz 84 model variables and the measure of the parametrized
one. By testing our methods on reduced phase spaces obtained by projection, we
find support to the idea that comparisons based on the Wasserstein distance
might be of relevance in many applications despite the curse of dimensionality.
|
cond-mat.stat-mech math.DS nlin.CD physics.ao-ph
|
constructing accurate flexible and efficient parametrizations is one of the great challenges in the numerical modelling of geophysical fluids we consider here the simple yet paradigmatic case of a lorenz 84 model forced by a lorenz 63 model and derive a parametrization using a recently developed statistical mechanical methodology based on the ruelle response theory we derive an expression for the deterministic and the stochastic component of the parametrization and we show that the approach allows for dealing seamlessly with the case of the lorenz 63 being a fast as well as a slow forcing compared to the characteristic time scales of the lorenz 84 model we test our results using both standard metrics based on the moments of the variables of interest as well as wasserstein distance between the projected measure of the original system on the lorenz 84 model variables and the measure of the parametrized one by testing our methods on reduced phase spaces obtained by projection we find support to the idea that comparisons based on the wasserstein distance might be of relevance in many applications despite the curse of dimensionality
|
[['constructing', 'accurate', 'flexible', 'and', 'efficient', 'parametrizations', 'is', 'one', 'of', 'the', 'great', 'challenges', 'in', 'the', 'numerical', 'modelling', 'of', 'geophysical', 'fluids', 'we', 'consider', 'here', 'the', 'simple', 'yet', 'paradigmatic', 'case', 'of', 'a', 'lorenz', '84', 'model', 'forced', 'by', 'a', 'lorenz', '63', 'model', 'and', 'derive', 'a', 'parametrization', 'using', 'a', 'recently', 'developed', 'statistical', 'mechanical', 'methodology', 'based', 'on', 'the', 'ruelle', 'response', 'theory', 'we', 'derive', 'an', 'expression', 'for', 'the', 'deterministic', 'and', 'the', 'stochastic', 'component', 'of', 'the', 'parametrization', 'and', 'we', 'show', 'that', 'the', 'approach', 'allows', 'for', 'dealing', 'seamlessly', 'with', 'the', 'case', 'of', 'the', 'lorenz', '63', 'being', 'a', 'fast', 'as', 'well', 'as', 'a', 'slow', 'forcing', 'compared', 'to', 'the', 'characteristic', 'time', 'scales', 'of', 'the', 'lorenz', '84', 'model', 'we', 'test', 'our', 'results', 'using', 'both', 'standard', 'metrics', 'based', 'on', 'the', 'moments', 'of', 'the', 'variables', 'of', 'interest', 'as', 'well', 'as', 'wasserstein', 'distance', 'between', 'the', 'projected', 'measure', 'of', 'the', 'original', 'system', 'on', 'the', 'lorenz', '84', 'model', 'variables', 'and', 'the', 'measure', 'of', 'the', 'parametrized', 'one', 'by', 'testing', 'our', 'methods', 'on', 'reduced', 'phase', 'spaces', 'obtained', 'by', 'projection', 'we', 'find', 'support', 'to', 'the', 'idea', 'that', 'comparisons', 'based', 'on', 'the', 'wasserstein', 'distance', 'might', 'be', 'of', 'relevance', 'in', 'many', 'applications', 'despite', 'the', 'curse', 'of', 'dimensionality']]
|
[-0.08170002790016903, 0.04581950808178344, -0.08583850075767653, 0.0678781772844141, -0.025359396304230432, -0.11878866843023413, 0.055590985513392935, 0.29819153735565174, -0.24625867630128523, -0.30877680794612783, 0.09972338582376471, -0.24341020310380987, -0.18678878291786924, 0.252199176238296, -0.058600105571787096, 0.08949283975604418, 0.04697354739670315, 0.009087736168372872, -0.07625013513087824, -0.207309797145678, 0.29180157728543554, 0.0642070596137814, 0.2870190480950515, 0.002777837433323667, 0.15962471697932562, -0.0027630169183720608, -0.06278163587605279, 0.04153863313431675, -0.1111050898464856, 0.1291609482965558, 0.17037688803330467, 0.12814283615884345, 0.2797498676170771, -0.38988057796818176, -0.2420379418527355, 0.07817843908041312, 0.09084225514938274, 0.10711398713190008, -0.01646715472641124, -0.29042124316549384, 0.03272261291968863, -0.17247603106236942, -0.1465748672732278, -0.11562600075896527, 0.02922079279370656, 0.05244724160261654, -0.26708409560693275, 0.08213166851499999, 0.0470664135331439, 0.07980735528005942, -0.07011645573594079, -0.11663983111282357, -0.0017447257666168986, 0.09243231094316454, 0.05429493281046382, 0.02788034379985687, 0.10597118745130059, -0.08638253691983787, -0.12118152576196636, 0.40529138885337757, -0.1016262491951017, -0.2471258966805967, 0.2368480091096481, -0.08941539980383036, -0.13148407923007333, 0.06437671761810339, 0.19996631323687128, 0.1200726801479185, -0.1523261333752826, 0.07480499845948323, -0.04523191755964748, 0.14369464012026484, 0.02116618896708698, -0.008249960708859805, 0.1418104799011269, 0.18930732190350977, 0.04133869365228944, 0.13667498126286207, -0.11269251809493211, -0.1291700488658043, -0.2922668069601059, -0.1538997971083862, -0.2004886801379758, 0.027893970577625205, -0.1248162098753587, -0.15603432999672118, 0.4186161577399518, 0.16868751707511978, 0.22626587241585996, 0.08330036587761463, 0.2999137307139667, 0.11643330329852934, 0.028007801901234464, 0.07932234887486776, 0.2510753487136114, 0.14579467101249138, 0.06709564214295431, -0.19467971169270223, 0.046251887865867966, 0.08552070517797727]
|
1,803.05335
|
Fast and Parallel Runge-Kutta Approximation of Fractional Evolution
Equations
|
We consider a linear inhomogeneous fractional evolution equation which is
obtained from a Cauchy problem by replacing its first-order time derivative
with Caputo's fractional derivative. The operator in the fractional evolution
equation is assumed to be sectorial. By using the inverse Laplace transform a
solution to the fractional evolution equation is obtained which can be written
as a convolution. Based on $L$-stable Runge-Kutta methods a convolution
quadrature is derived which allows a stable approximation of the solution.
Here, the convolution quadrature weights are represented as contour integrals.
On discretising these integrals, we are able to give an algorithm which
computes the solution after $N$ time steps with step size $h$ up to an
arbitrary accuracy $\varepsilon$. For this purpose the algorithm only requires
$\mathcal{O}(N)$ Runge-Kutta steps for a large number of scalar linear
inhomogeneous ordinary differential equations and the solutions of
$\mathcal{O}(\log(N)\log(\frac{1}{\varepsilon}))$ linear systems what can be
done in parallel. In numerical examples we illustrate the algorithm's
performance.
|
math.NA
|
we consider a linear inhomogeneous fractional evolution equation which is obtained from a cauchy problem by replacing its firstorder time derivative with caputos fractional derivative the operator in the fractional evolution equation is assumed to be sectorial by using the inverse laplace transform a solution to the fractional evolution equation is obtained which can be written as a convolution based on lstable rungekutta methods a convolution quadrature is derived which allows a stable approximation of the solution here the convolution quadrature weights are represented as contour integrals on discretising these integrals we are able to give an algorithm which computes the solution after n time steps with step size h up to an arbitrary accuracy varepsilon for this purpose the algorithm only requires mathcalon rungekutta steps for a large number of scalar linear inhomogeneous ordinary differential equations and the solutions of mathcalolognlogfrac1varepsilon linear systems what can be done in parallel in numerical examples we illustrate the algorithms performance
|
[['we', 'consider', 'a', 'linear', 'inhomogeneous', 'fractional', 'evolution', 'equation', 'which', 'is', 'obtained', 'from', 'a', 'cauchy', 'problem', 'by', 'replacing', 'its', 'firstorder', 'time', 'derivative', 'with', 'caputos', 'fractional', 'derivative', 'the', 'operator', 'in', 'the', 'fractional', 'evolution', 'equation', 'is', 'assumed', 'to', 'be', 'sectorial', 'by', 'using', 'the', 'inverse', 'laplace', 'transform', 'a', 'solution', 'to', 'the', 'fractional', 'evolution', 'equation', 'is', 'obtained', 'which', 'can', 'be', 'written', 'as', 'a', 'convolution', 'based', 'on', 'lstable', 'rungekutta', 'methods', 'a', 'convolution', 'quadrature', 'is', 'derived', 'which', 'allows', 'a', 'stable', 'approximation', 'of', 'the', 'solution', 'here', 'the', 'convolution', 'quadrature', 'weights', 'are', 'represented', 'as', 'contour', 'integrals', 'on', 'discretising', 'these', 'integrals', 'we', 'are', 'able', 'to', 'give', 'an', 'algorithm', 'which', 'computes', 'the', 'solution', 'after', 'n', 'time', 'steps', 'with', 'step', 'size', 'h', 'up', 'to', 'an', 'arbitrary', 'accuracy', 'varepsilon', 'for', 'this', 'purpose', 'the', 'algorithm', 'only', 'requires', 'mathcalon', 'rungekutta', 'steps', 'for', 'a', 'large', 'number', 'of', 'scalar', 'linear', 'inhomogeneous', 'ordinary', 'differential', 'equations', 'and', 'the', 'solutions', 'of', 'mathcalolognlogfrac1varepsilon', 'linear', 'systems', 'what', 'can', 'be', 'done', 'in', 'parallel', 'in', 'numerical', 'examples', 'we', 'illustrate', 'the', 'algorithms', 'performance']]
|
[-0.1173005479441327, 0.04476477703021003, -0.10279631218872964, 0.0516039664570871, -0.11136023523463945, -0.12104624326512882, -0.02064112464120244, 0.36276300236060743, -0.33036947436630726, -0.2695217745224382, 0.15223188920222389, -0.25972372432438445, -0.14497710715673098, 0.19141072844552576, -0.03783323981793253, 0.12914102195256397, 0.06515530969392935, 0.03389508122056248, -0.10999702153561317, -0.2726908795947838, 0.3020731718412891, -0.010762679506283087, 0.17301864497167813, -0.04983735774127636, 0.16099675448153875, -0.053000712584834665, -0.0526408228465611, 0.006935792070499082, -0.10781089886933992, 0.08928488633242454, 0.2572136835720105, 0.049242761152185455, 0.3050474240236981, -0.4446022067052923, -0.1708040034760288, 0.08340602002705738, 0.16715296336811533, 0.09434776059144241, -0.01047082529640549, -0.29202091478102005, 0.05315912013301021, -0.1376710730148296, -0.15288542009961265, -0.11169751492109459, 0.02475462558495391, 0.05333572090455112, -0.3273026218384231, 0.08800153945021, 0.05591829667449187, -0.020197514426793642, -0.06273127904949283, -0.11606204486600342, 0.03495240602701618, 0.03560602737021199, -0.0038446221777955723, 0.012674242777121106, 0.042410765056777155, -0.08770353708766211, -0.11416584103009338, 0.3606270408957817, -0.13133032472394882, -0.32390982904441795, 0.06292838323268161, -0.09029204241344171, -0.08810864687766762, 0.14974410611079766, 0.15633973820063812, 0.20243529517464576, -0.15232489072083003, 0.13268982446389155, 0.007232452226672203, 0.17896281441993964, 0.09056107496403774, -0.04002378732381258, 0.08162166262609041, 0.14177109790034592, 0.11112124759668282, 0.14949013067151354, -0.035834195142742366, -0.14731542648047588, -0.3378676615750334, -0.19284025616469277, -0.20413562870335283, 0.06680059106427298, -0.13118983217606625, -0.1870021665362036, 0.36049909254975, 0.10342897919368498, 0.16375183738222357, 0.10318082505926063, 0.29689038158720654, 0.2875513139990556, 0.04956741991399485, 0.08283465333241423, 0.12777384441007805, 0.1449605729890643, 0.12189563173447754, -0.21935406926156253, 0.046656184559865935, 0.19281239857434468]
|
1,803.05336
|
Capturing the influence of geopolitical ties from Wikipedia with reduced
Google matrix
|
Interactions between countries originate from diverse aspects such as
geographic proximity, trade, socio-cultural habits, language, religions, etc.
Geopolitics studies the influence of a country's geographic space on its
political power and its relationships with other countries.
This work reveals the potential of Wikipedia mining for geopolitical study.
Actually, Wikipedia offers solid knowledge and strong correlations among
countries by linking web pages together for different types of information
(e.g. economical, historical, political, and many others). The major finding of
this paper is to show that meaningful results on the influence of country ties
can be extracted from the hyperlinked structure of Wikipedia. We leverage a
novel stochastic matrix representation of Markov chains of complex directed
networks called the reduced Google matrix theory. For a selected small size set
of nodes, the reduced Google matrix concentrates direct and indirect links of
the million-node sized Wikipedia network into a small Perron-Frobenius matrix
keeping the PageRank probabilities of the global Wikipedia network. We perform
a novel sensitivity analysis that leverages this reduced Google matrix to
characterize the influence of relationships between countries from the global
network. We apply this analysis to two chosen sets of countries (i.e. the set
of 27 European Union countries and a set of 40 top worldwide countries). We
show that with our sensitivity analysis we can exhibit easily very meaningful
information on geopolitics from five different Wikipedia editions (English,
Arabic, Russian, French and German).
|
cs.SI physics.soc-ph
|
interactions between countries originate from diverse aspects such as geographic proximity trade sociocultural habits language religions etc geopolitics studies the influence of a countrys geographic space on its political power and its relationships with other countries this work reveals the potential of wikipedia mining for geopolitical study actually wikipedia offers solid knowledge and strong correlations among countries by linking web pages together for different types of information eg economical historical political and many others the major finding of this paper is to show that meaningful results on the influence of country ties can be extracted from the hyperlinked structure of wikipedia we leverage a novel stochastic matrix representation of markov chains of complex directed networks called the reduced google matrix theory for a selected small size set of nodes the reduced google matrix concentrates direct and indirect links of the millionnode sized wikipedia network into a small perronfrobenius matrix keeping the pagerank probabilities of the global wikipedia network we perform a novel sensitivity analysis that leverages this reduced google matrix to characterize the influence of relationships between countries from the global network we apply this analysis to two chosen sets of countries ie the set of 27 european union countries and a set of 40 top worldwide countries we show that with our sensitivity analysis we can exhibit easily very meaningful information on geopolitics from five different wikipedia editions english arabic russian french and german
|
[['interactions', 'between', 'countries', 'originate', 'from', 'diverse', 'aspects', 'such', 'as', 'geographic', 'proximity', 'trade', 'sociocultural', 'habits', 'language', 'religions', 'etc', 'geopolitics', 'studies', 'the', 'influence', 'of', 'a', 'countrys', 'geographic', 'space', 'on', 'its', 'political', 'power', 'and', 'its', 'relationships', 'with', 'other', 'countries', 'this', 'work', 'reveals', 'the', 'potential', 'of', 'wikipedia', 'mining', 'for', 'geopolitical', 'study', 'actually', 'wikipedia', 'offers', 'solid', 'knowledge', 'and', 'strong', 'correlations', 'among', 'countries', 'by', 'linking', 'web', 'pages', 'together', 'for', 'different', 'types', 'of', 'information', 'eg', 'economical', 'historical', 'political', 'and', 'many', 'others', 'the', 'major', 'finding', 'of', 'this', 'paper', 'is', 'to', 'show', 'that', 'meaningful', 'results', 'on', 'the', 'influence', 'of', 'country', 'ties', 'can', 'be', 'extracted', 'from', 'the', 'hyperlinked', 'structure', 'of', 'wikipedia', 'we', 'leverage', 'a', 'novel', 'stochastic', 'matrix', 'representation', 'of', 'markov', 'chains', 'of', 'complex', 'directed', 'networks', 'called', 'the', 'reduced', 'google', 'matrix', 'theory', 'for', 'a', 'selected', 'small', 'size', 'set', 'of', 'nodes', 'the', 'reduced', 'google', 'matrix', 'concentrates', 'direct', 'and', 'indirect', 'links', 'of', 'the', 'millionnode', 'sized', 'wikipedia', 'network', 'into', 'a', 'small', 'perronfrobenius', 'matrix', 'keeping', 'the', 'pagerank', 'probabilities', 'of', 'the', 'global', 'wikipedia', 'network', 'we', 'perform', 'a', 'novel', 'sensitivity', 'analysis', 'that', 'leverages', 'this', 'reduced', 'google', 'matrix', 'to', 'characterize', 'the', 'influence', 'of', 'relationships', 'between', 'countries', 'from', 'the', 'global', 'network', 'we', 'apply', 'this', 'analysis', 'to', 'two', 'chosen', 'sets', 'of', 'countries', 'ie', 'the', 'set', 'of', '27', 'european', 'union', 'countries', 'and', 'a', 'set', 'of', '40', 'top', 'worldwide', 'countries', 'we', 'show', 'that', 'with', 'our', 'sensitivity', 'analysis', 'we', 'can', 'exhibit', 'easily', 'very', 'meaningful', 'information', 'on', 'geopolitics', 'from', 'five', 'different', 'wikipedia', 'editions', 'english', 'arabic', 'russian', 'french', 'and', 'german']]
|
[-0.08838232362325839, 0.06434214815715368, -0.034898910402231156, 0.11686621245759678, -0.1299859141257215, -0.08759212179872346, 0.13165425475330111, 0.3761881043302252, -0.29392962598618355, -0.32356949680128155, 0.058801913526939587, -0.3768765108144664, -0.1815367948694868, 0.16525469572937235, -0.06947938594719434, -0.04489093301421467, 0.10486029019935968, 0.05716136317115594, -0.033142922141965715, -0.25403856840579114, 0.33226460268067076, 0.03733216350442393, 0.35315511556580026, 0.05660161666294679, 0.07133864948743994, -0.01972962624413219, -0.12987367307291703, 0.02645535673983296, -0.08369110259595897, 0.21395987319918547, 0.34961774547366387, 0.2426828924546692, 0.3206658219968147, -0.4167511639363588, -0.1575439980729146, 0.09613550522146706, 0.07925110864062902, 0.07086969973380737, 0.024002549771041153, -0.36877728832707285, 0.05979085350854996, -0.25204645575598833, -0.03445528892086858, -0.07659196950931181, 0.03616703136011641, 0.044008120584321464, -0.20244052581603025, 0.05035310274069296, 0.013704794945016979, 0.12438648086278997, 0.018616727841621702, -0.14915405478169944, -0.041256045132003566, 0.2549045968206322, 0.07835361264111038, -0.037706524651358896, 0.18011826307790235, -0.10866982673017427, -0.1388440590163574, 0.3595239378313752, -0.030909995519694814, -0.13268572755047725, 0.1734990644724445, -0.09185177848297865, -0.20384071770896936, 0.038333075935456984, 0.24831158323015304, 0.023637223329910254, -0.18875365499629976, 0.026028202080286722, -0.1025597870032838, 0.19365618480765756, 0.09349011936165551, -0.009054026225621396, 0.19460267141619894, 0.20724314127830748, 0.07431042334238226, 0.11474603458969951, -0.05018286913425285, -0.11960693229128547, -0.18465456993794663, -0.11154088083496119, -0.1609404647985394, 0.033907046949272934, -0.18095004260961084, -0.1753686869318815, 0.430397153812203, 0.1477263219218622, 0.1396977303430755, 0.03312639297070378, 0.25043865264928405, -0.045627823460443404, 0.07482108310610551, 0.08857921566814184, 0.14281720473292342, 0.027104169511771265, 0.19073673164115307, -0.11997014847385915, 0.1314368519763601, 0.030415375979537976]
|
1,803.05337
|
Learning to Recognize Musical Genre from Audio
|
We here summarize our experience running a challenge with open data for
musical genre recognition. Those notes motivate the task and the challenge
design, show some statistics about the submissions, and present the results.
|
cs.SD cs.IR cs.LG eess.AS stat.ML
|
we here summarize our experience running a challenge with open data for musical genre recognition those notes motivate the task and the challenge design show some statistics about the submissions and present the results
|
[['we', 'here', 'summarize', 'our', 'experience', 'running', 'a', 'challenge', 'with', 'open', 'data', 'for', 'musical', 'genre', 'recognition', 'those', 'notes', 'motivate', 'the', 'task', 'and', 'the', 'challenge', 'design', 'show', 'some', 'statistics', 'about', 'the', 'submissions', 'and', 'present', 'the', 'results']]
|
[-0.05752462789635448, 0.037524772629908776, -0.0936682695413337, 0.05107079621623544, -0.15278214227189035, -0.09572108209078364, 0.031081112012650597, 0.3934769422254142, -0.19023837329929366, -0.4395129107596243, 0.15560900188489435, -0.3201423875768395, -0.23771775113966534, 0.23778150394997177, -0.163735197048963, 0.0573280656381565, 0.22698606463039622, 0.049898060915224696, -0.04204118821550818, -0.35125263577655835, 0.2994984787998392, 0.02590446302886395, 0.30738366336342604, 0.10308779474786099, 0.08114742253811154, -0.061948756358641034, -0.11583899314898778, -0.1247471224016729, -0.15874918462599025, 0.19333445779321826, 0.38327360996866927, 0.20724994345458553, 0.3438116315313998, -0.40394824129693646, -0.09780177731505212, -0.026987654516500804, 0.05221642866073286, 0.1367405089275802, -0.12216074083356515, -0.3408572909915272, 0.05997792257489089, -0.1391090024536585, -0.04552535123794394, -0.08038114035940346, -0.018435969127013403, -0.023589818587745812, -0.17404984047307687, -0.012913718710050863, 0.0882729765794733, 0.11511086496551905, -0.04522655009264674, -0.17601389479001656, 0.13315444662208287, 0.21152479915112696, 0.07816898236599039, 0.05607525015468983, 0.10701551081557922, -0.20170034907470621, -0.2141831218100646, 0.41764753739185195, -0.044330784804461634, -0.17258433822323294, 0.13519910365507445, -0.06549591417698299, -0.23837926340125062, -0.013855451444054352, 0.22728380826575792, 0.06282628856270629, -0.13093604613095522, -0.023129637671552378, -0.040587997774898264, 0.2134658125167548, 0.016130625385010394, -0.0023192431887283046, 0.22855762189582868, 0.24941355439231677, -0.06314515734694022, 0.10317222974674009, -0.04890378465985551, -0.03098804840598913, -0.2768995266079026, -0.12037792464937358, -0.1477047160048695, -0.0005285681006224716, -0.01758142225084799, -0.09692735512576559, 0.4305002675117815, 0.30258958567591276, 0.15887114186497295, 0.14149857030304916, 0.27599256103584435, -0.027614290726727202, -0.020043916123754838, 0.0951609488504747, 0.14333609729981298, -0.04511666352696279, 0.201713810017442, -0.1694539922344334, 0.04130613165633643, -0.0016044329112286076]
|
1,803.05338
|
Efficient first principles simulation of electron scattering factors for
transmission electron microscopy
|
Electron microscopy is a powerful tool for studying the properties of
materials down to their atomic structure. In many cases, the quantitative
interpretation of images requires simulations based on atomistic structure
models. These typically use the independent atom approximation that neglects
bonding effects, which may, however, be measurable and of physical interest.
Since all electrons and the nuclear cores contribute to the scattering
potential, simulations that go beyond this approximation have relied on
computationally highly demanding all-electron calculations. Here, we describe a
new method to generate ab initio electrostatic potentials when describing the
core electrons by projector functions. Combined with an interface to
quantitative image simulations, this implementation enables an easy and fast
means to model electron microscopy images. We compare simulated transmission
electron microscopy images and diffraction patterns to experimental data,
showing an accuracy equivalent to earlier all-electron calculations at a much
lower computational cost.
|
cond-mat.mtrl-sci
|
electron microscopy is a powerful tool for studying the properties of materials down to their atomic structure in many cases the quantitative interpretation of images requires simulations based on atomistic structure models these typically use the independent atom approximation that neglects bonding effects which may however be measurable and of physical interest since all electrons and the nuclear cores contribute to the scattering potential simulations that go beyond this approximation have relied on computationally highly demanding allelectron calculations here we describe a new method to generate ab initio electrostatic potentials when describing the core electrons by projector functions combined with an interface to quantitative image simulations this implementation enables an easy and fast means to model electron microscopy images we compare simulated transmission electron microscopy images and diffraction patterns to experimental data showing an accuracy equivalent to earlier allelectron calculations at a much lower computational cost
|
[['electron', 'microscopy', 'is', 'a', 'powerful', 'tool', 'for', 'studying', 'the', 'properties', 'of', 'materials', 'down', 'to', 'their', 'atomic', 'structure', 'in', 'many', 'cases', 'the', 'quantitative', 'interpretation', 'of', 'images', 'requires', 'simulations', 'based', 'on', 'atomistic', 'structure', 'models', 'these', 'typically', 'use', 'the', 'independent', 'atom', 'approximation', 'that', 'neglects', 'bonding', 'effects', 'which', 'may', 'however', 'be', 'measurable', 'and', 'of', 'physical', 'interest', 'since', 'all', 'electrons', 'and', 'the', 'nuclear', 'cores', 'contribute', 'to', 'the', 'scattering', 'potential', 'simulations', 'that', 'go', 'beyond', 'this', 'approximation', 'have', 'relied', 'on', 'computationally', 'highly', 'demanding', 'allelectron', 'calculations', 'here', 'we', 'describe', 'a', 'new', 'method', 'to', 'generate', 'ab', 'initio', 'electrostatic', 'potentials', 'when', 'describing', 'the', 'core', 'electrons', 'by', 'projector', 'functions', 'combined', 'with', 'an', 'interface', 'to', 'quantitative', 'image', 'simulations', 'this', 'implementation', 'enables', 'an', 'easy', 'and', 'fast', 'means', 'to', 'model', 'electron', 'microscopy', 'images', 'we', 'compare', 'simulated', 'transmission', 'electron', 'microscopy', 'images', 'and', 'diffraction', 'patterns', 'to', 'experimental', 'data', 'showing', 'an', 'accuracy', 'equivalent', 'to', 'earlier', 'allelectron', 'calculations', 'at', 'a', 'much', 'lower', 'computational', 'cost']]
|
[-0.03828211285254427, 0.06316181967201984, -0.11129492913270751, 0.11210170834985472, -0.04528604627408291, -0.1267858661220039, 0.05565042051443613, 0.4478291999676252, -0.2580039446108196, -0.3140678110704693, 0.012833336230258981, -0.3070086388280998, -0.13015389242624123, 0.22189811104430165, 0.02652256301770063, 0.08597315765585598, 0.08435290530706717, -0.08668757395257484, -0.08614673449104486, -0.19373947637608555, 0.23301997146495834, 0.14274297484630488, 0.2828273342584247, 0.0967358378884829, 0.06754956538996289, 0.035571225596693894, -0.001535533946517804, 0.026416715712227028, -0.1289638054716817, 0.1515778659696193, 0.24791354021450288, 0.050668017927918835, 0.24497733754564352, -0.5666480094117865, -0.23133655163229838, -0.006756589446561283, 0.16071747683151305, 0.14621046594621562, -0.09236151792191939, -0.23715068953596566, 0.03949972069965778, -0.1198329509854674, -0.12334602545908563, -0.1889707699708309, -0.004274149882218047, 0.01778912699457628, -0.2706513021273653, 0.07306891672906453, -0.036013545994710634, 0.07532740888404676, -0.09381274132006993, -0.08777505075335758, 0.025383244274975094, 0.08116468827240966, -0.011097836763078142, 0.05183301190845668, 0.18119828617726516, -0.11578475427933432, -0.10632343694235977, 0.41363320551327853, -0.008439831299330937, -0.1860398149806751, 0.2523585392037815, -0.14963853874001398, -0.11306911751576891, 0.17129529649646927, 0.12061354061524855, 0.11295371488604235, -0.1719083338175551, 0.06244441461334745, -0.024684258955148086, 0.22797855570248954, 0.0539869379000228, 0.03446029432832378, 0.17172307132628478, 0.16582310634939484, 0.012428687477551324, 0.07288271519084372, -0.10929465867668288, -0.0704380337129768, -0.2011150814854374, -0.12922206377508502, -0.21150533329736926, 0.04145406378586203, -0.05309683928937549, -0.1942580979706541, 0.37279234963711605, 0.2074342281597488, 0.13268886222057555, -0.011836513378561717, 0.3628913770455306, 0.08486209535486486, 0.07169706383815724, 0.004793404633408948, 0.21340783646215417, 0.1529947270667946, 0.04816994804263829, -0.22422723464304198, 0.046511829357868545, 0.02597717964090407]
|
1,803.05339
|
Predicting Oral Disintegrating Tablet Formulations by Neural Network
Techniques
|
Oral Disintegrating Tablets (ODTs) is a novel dosage form that can be
dissolved on the tongue within 3min or less especially for geriatric and
pediatric patients. Current ODT formulation studies usually rely on the
personal experience of pharmaceutical experts and trial-and-error in the
laboratory, which is inefficient and time-consuming. The aim of current
research was to establish the prediction model of ODT formulations with direct
compression process by Artificial Neural Network (ANN) and Deep Neural Network
(DNN) techniques. 145 formulation data were extracted from Web of Science. All
data sets were divided into three parts: training set (105 data), validation
set (20) and testing set (20). ANN and DNN were compared for the prediction of
the disintegrating time. The accuracy of the ANN model has reached 85.60%,
80.00% and 75.00% on the training set, validation set and testing set
respectively, whereas that of the DNN model was 85.60%, 85.00% and 80.00%,
respectively. Compared with the ANN, DNN showed the better prediction for ODT
formulations. It is the first time that deep neural network with the improved
dataset selection algorithm is applied to formulation prediction on small data.
The proposed predictive approach could evaluate the critical parameters about
quality control of formulation, and guide research and process development. The
implementation of this prediction model could effectively reduce drug product
development timeline and material usage, and proactively facilitate the
development of a robust drug product.
|
stat.ML cs.AI cs.LG
|
oral disintegrating tablets odts is a novel dosage form that can be dissolved on the tongue within 3min or less especially for geriatric and pediatric patients current odt formulation studies usually rely on the personal experience of pharmaceutical experts and trialanderror in the laboratory which is inefficient and timeconsuming the aim of current research was to establish the prediction model of odt formulations with direct compression process by artificial neural network ann and deep neural network dnn techniques 145 formulation data were extracted from web of science all data sets were divided into three parts training set 105 data validation set 20 and testing set 20 ann and dnn were compared for the prediction of the disintegrating time the accuracy of the ann model has reached 8560 8000 and 7500 on the training set validation set and testing set respectively whereas that of the dnn model was 8560 8500 and 8000 respectively compared with the ann dnn showed the better prediction for odt formulations it is the first time that deep neural network with the improved dataset selection algorithm is applied to formulation prediction on small data the proposed predictive approach could evaluate the critical parameters about quality control of formulation and guide research and process development the implementation of this prediction model could effectively reduce drug product development timeline and material usage and proactively facilitate the development of a robust drug product
|
[['oral', 'disintegrating', 'tablets', 'odts', 'is', 'a', 'novel', 'dosage', 'form', 'that', 'can', 'be', 'dissolved', 'on', 'the', 'tongue', 'within', '3min', 'or', 'less', 'especially', 'for', 'geriatric', 'and', 'pediatric', 'patients', 'current', 'odt', 'formulation', 'studies', 'usually', 'rely', 'on', 'the', 'personal', 'experience', 'of', 'pharmaceutical', 'experts', 'and', 'trialanderror', 'in', 'the', 'laboratory', 'which', 'is', 'inefficient', 'and', 'timeconsuming', 'the', 'aim', 'of', 'current', 'research', 'was', 'to', 'establish', 'the', 'prediction', 'model', 'of', 'odt', 'formulations', 'with', 'direct', 'compression', 'process', 'by', 'artificial', 'neural', 'network', 'ann', 'and', 'deep', 'neural', 'network', 'dnn', 'techniques', '145', 'formulation', 'data', 'were', 'extracted', 'from', 'web', 'of', 'science', 'all', 'data', 'sets', 'were', 'divided', 'into', 'three', 'parts', 'training', 'set', '105', 'data', 'validation', 'set', '20', 'and', 'testing', 'set', '20', 'ann', 'and', 'dnn', 'were', 'compared', 'for', 'the', 'prediction', 'of', 'the', 'disintegrating', 'time', 'the', 'accuracy', 'of', 'the', 'ann', 'model', 'has', 'reached', '8560', '8000', 'and', '7500', 'on', 'the', 'training', 'set', 'validation', 'set', 'and', 'testing', 'set', 'respectively', 'whereas', 'that', 'of', 'the', 'dnn', 'model', 'was', '8560', '8500', 'and', '8000', 'respectively', 'compared', 'with', 'the', 'ann', 'dnn', 'showed', 'the', 'better', 'prediction', 'for', 'odt', 'formulations', 'it', 'is', 'the', 'first', 'time', 'that', 'deep', 'neural', 'network', 'with', 'the', 'improved', 'dataset', 'selection', 'algorithm', 'is', 'applied', 'to', 'formulation', 'prediction', 'on', 'small', 'data', 'the', 'proposed', 'predictive', 'approach', 'could', 'evaluate', 'the', 'critical', 'parameters', 'about', 'quality', 'control', 'of', 'formulation', 'and', 'guide', 'research', 'and', 'process', 'development', 'the', 'implementation', 'of', 'this', 'prediction', 'model', 'could', 'effectively', 'reduce', 'drug', 'product', 'development', 'timeline', 'and', 'material', 'usage', 'and', 'proactively', 'facilitate', 'the', 'development', 'of', 'a', 'robust', 'drug', 'product']]
|
[-0.012899128206122618, 0.03335750854348117, -0.022338868039196512, 0.0257254353436941, -0.09291942412682781, -0.15385637397261023, 0.07501401887925391, 0.39358074299071905, -0.21693346615138895, -0.3857732665905471, 0.13038735994415254, -0.281529695325777, -0.15111644127914173, 0.21723715954478345, -0.08927123661927104, 0.08898671222114896, 0.14141286646184265, 0.014360684905507607, -0.009705299036819246, -0.29344058224278224, 0.23082962659796402, 0.07306948467233375, 0.3754352314671848, 0.021094896264857554, 0.09319738719866356, -0.03242140074333103, -0.06864792086059042, -0.030009970552231553, -0.07114411830380876, 0.1532476411520572, 0.28171069274991106, 0.21417102982689226, 0.3383868525522354, -0.44479826142309936, -0.21250647315715168, 0.06523113661683548, 0.10934928369716422, 0.07315720630622191, 0.00822849583598378, -0.3247072177160999, 0.10009562579745596, -0.1644450385342463, -0.018311882749511316, -0.10516936549295981, 0.009014849504657509, -0.025960582916501877, -0.3084078761486909, 0.04565665292053673, 0.020382270591889882, 0.11611387877698859, -0.10113625442639429, -0.1590459663682976, -0.0054113628258082, 0.14319005667169485, 0.024939139036701596, 0.10359995226270935, 0.1833574704329979, -0.14181562067279507, -0.09717244479212571, 0.34490641735461885, -0.029822646664431345, -0.1538325274218019, 0.19235067252771226, -0.03536174256249746, -0.10414259841068935, 0.1287904442469408, 0.24923883392616655, 0.07263960027301208, -0.19954305676969164, -0.01733599651884086, 0.01221858902765817, 0.1781463993560055, 0.05300246378546984, -0.06820743998565038, 0.16371632044836557, 0.2890032773668116, -0.022153037008567356, 0.09338166304003222, -0.14115569263634178, -0.058474326667273056, -0.2095225497080392, -0.13145052459800527, -0.14823556208964922, 0.0006861177805278983, -0.10955509833757941, -0.13199667299158258, 0.3876319087233427, 0.19233789178643584, 0.14869715672921696, 0.07272778164832984, 0.3023901589585718, 0.02196766248764571, 0.12682731385903184, 0.07275943513717745, 0.21366932713255302, 0.04121597339217732, 0.1371918921298408, -0.1568168711135954, 0.12184897818284117, 0.034898410867738386]
|
1,803.0534
|
Measurement-based adaptation protocol with quantum reinforcement
learning
|
Machine learning employs dynamical algorithms that mimic the human capacity
to learn, where the reinforcement learning ones are among the most similar to
humans in this respect. On the other hand, adaptability is an essential aspect
to perform any task efficiently in a changing environment, and it is
fundamental for many purposes, such as natural selection. Here, we propose an
algorithm based on successive measurements to adapt one quantum state to a
reference unknown state, in the sense of achieving maximum overlap. The
protocol naturally provides many identical copies of the reference state, such
that in each measurement iteration more information about it is obtained. In
our protocol, we consider a system composed of three parts, the "environment"
system, which provides the reference state copies; the register, which is an
auxiliary subsystem that interacts with the environment to acquire information
from it; and the agent, which corresponds to the quantum state that is adapted
by digital feedback with input corresponding to the outcome of the measurements
on the register. With this proposal we can achieve an average fidelity between
the environment and the agent of more than $90\% $ with less than $30$
iterations of the protocol. In addition, we extend the formalism to $ d
$-dimensional states, reaching an average fidelity of around $80\% $ in less
than $400$ iterations for $d=$ 11, for a variety of genuinely quantum and
semiclassical states. This work paves the way for the development of quantum
reinforcement learning protocols using quantum data and for the future
deployment of semi-autonomous quantum systems.
|
quant-ph cond-mat.mes-hall cs.AI cs.LG stat.ML
|
machine learning employs dynamical algorithms that mimic the human capacity to learn where the reinforcement learning ones are among the most similar to humans in this respect on the other hand adaptability is an essential aspect to perform any task efficiently in a changing environment and it is fundamental for many purposes such as natural selection here we propose an algorithm based on successive measurements to adapt one quantum state to a reference unknown state in the sense of achieving maximum overlap the protocol naturally provides many identical copies of the reference state such that in each measurement iteration more information about it is obtained in our protocol we consider a system composed of three parts the environment system which provides the reference state copies the register which is an auxiliary subsystem that interacts with the environment to acquire information from it and the agent which corresponds to the quantum state that is adapted by digital feedback with input corresponding to the outcome of the measurements on the register with this proposal we can achieve an average fidelity between the environment and the agent of more than 90 with less than 30 iterations of the protocol in addition we extend the formalism to d dimensional states reaching an average fidelity of around 80 in less than 400 iterations for d 11 for a variety of genuinely quantum and semiclassical states this work paves the way for the development of quantum reinforcement learning protocols using quantum data and for the future deployment of semiautonomous quantum systems
|
[['machine', 'learning', 'employs', 'dynamical', 'algorithms', 'that', 'mimic', 'the', 'human', 'capacity', 'to', 'learn', 'where', 'the', 'reinforcement', 'learning', 'ones', 'are', 'among', 'the', 'most', 'similar', 'to', 'humans', 'in', 'this', 'respect', 'on', 'the', 'other', 'hand', 'adaptability', 'is', 'an', 'essential', 'aspect', 'to', 'perform', 'any', 'task', 'efficiently', 'in', 'a', 'changing', 'environment', 'and', 'it', 'is', 'fundamental', 'for', 'many', 'purposes', 'such', 'as', 'natural', 'selection', 'here', 'we', 'propose', 'an', 'algorithm', 'based', 'on', 'successive', 'measurements', 'to', 'adapt', 'one', 'quantum', 'state', 'to', 'a', 'reference', 'unknown', 'state', 'in', 'the', 'sense', 'of', 'achieving', 'maximum', 'overlap', 'the', 'protocol', 'naturally', 'provides', 'many', 'identical', 'copies', 'of', 'the', 'reference', 'state', 'such', 'that', 'in', 'each', 'measurement', 'iteration', 'more', 'information', 'about', 'it', 'is', 'obtained', 'in', 'our', 'protocol', 'we', 'consider', 'a', 'system', 'composed', 'of', 'three', 'parts', 'the', 'environment', 'system', 'which', 'provides', 'the', 'reference', 'state', 'copies', 'the', 'register', 'which', 'is', 'an', 'auxiliary', 'subsystem', 'that', 'interacts', 'with', 'the', 'environment', 'to', 'acquire', 'information', 'from', 'it', 'and', 'the', 'agent', 'which', 'corresponds', 'to', 'the', 'quantum', 'state', 'that', 'is', 'adapted', 'by', 'digital', 'feedback', 'with', 'input', 'corresponding', 'to', 'the', 'outcome', 'of', 'the', 'measurements', 'on', 'the', 'register', 'with', 'this', 'proposal', 'we', 'can', 'achieve', 'an', 'average', 'fidelity', 'between', 'the', 'environment', 'and', 'the', 'agent', 'of', 'more', 'than', '90', 'with', 'less', 'than', '30', 'iterations', 'of', 'the', 'protocol', 'in', 'addition', 'we', 'extend', 'the', 'formalism', 'to', 'd', 'dimensional', 'states', 'reaching', 'an', 'average', 'fidelity', 'of', 'around', '80', 'in', 'less', 'than', '400', 'iterations', 'for', 'd', '11', 'for', 'a', 'variety', 'of', 'genuinely', 'quantum', 'and', 'semiclassical', 'states', 'this', 'work', 'paves', 'the', 'way', 'for', 'the', 'development', 'of', 'quantum', 'reinforcement', 'learning', 'protocols', 'using', 'quantum', 'data', 'and', 'for', 'the', 'future', 'deployment', 'of', 'semiautonomous', 'quantum', 'systems']]
|
[-0.09156984656446558, 0.10703725968059563, -0.08285521796594063, 0.007855955061192315, -0.03874056822182063, -0.18421777183162596, 0.06106854424191018, 0.3793040284969132, -0.24504329048361922, -0.3363168829515595, 0.074439775056717, -0.27096402554170174, -0.11783751207495145, 0.2173004040165859, -0.09334216104162966, 0.06289035959726236, 0.07378989813904113, 0.10413926956335119, -0.041248647388363, -0.24960565197500675, 0.3011294081642785, 0.05719240327803966, 0.27612121626917346, -0.0321932079106131, 0.1263926913080664, 0.03326988835458406, 0.026510745473206043, -0.02420542733880746, -0.06296451080284611, 0.13455692551363552, 0.27272737375917094, 0.1771975119479512, 0.3080609199828377, -0.40425177524482614, -0.1779359078473028, 0.105905256853165, 0.12365400093908915, 0.1469379082550386, -0.010483002452312184, -0.29748266008773855, 0.07607796753450827, -0.17096150728300963, -0.08093185829290865, -0.08391122581145051, -0.007081173048080767, -0.051625853327841115, -0.27453895048694865, 0.018583905254947203, 0.040917956711172, 0.039855033830356074, -0.04617804538049991, -0.07201088232572611, 0.030385803258703912, 0.16859636151998797, -0.026713671385054934, 0.07535159195152422, 0.1607163706874274, -0.14709553125296723, -0.14922936351686789, 0.3744432887683312, -0.032951648589440476, -0.20637391914577022, 0.21777240092427852, -0.08906513616561379, -0.11663642436284206, 0.08679878472478367, 0.16762902573602476, 0.11439010635858365, -0.14880682503548906, 0.015502587872712562, -0.015550111824938772, 0.20889194369790892, 0.01974744192374797, 0.0784806421720514, 0.15908767060541054, 0.18980251637044335, 0.1120399692109512, 0.1506895014634995, -0.06163222158017258, -0.15923617283868438, -0.25901477144455864, -0.19180669424424515, -0.19761184611010785, 0.04607364963329233, -0.07746492221046412, -0.11956403445773164, 0.3756427782916409, 0.21048081109332212, 0.2115127465226596, 0.04697833691550163, 0.33169592567080375, 0.07489652296290825, 0.07009267563767294, 0.10716921228312833, 0.21231966348200598, 0.08714059483278178, 0.10584432860361595, -0.2151965684175272, 0.08751259843873627, 0.00020435897669955795]
|
1,803.05341
|
All local gauge invariants for perturbations of the Kerr spacetime
|
We present two complex scalar gauge invariants for perturbations of the Kerr
spacetime defined covariantly in terms of the Killing vectors and the conformal
Killing-Yano tensor of the background together with the linearized curvature
and its first derivatives. These invariants are in particular sensitive to
variations of the Kerr parameters. Together with the Teukolsky scalars and the
linearized Ricci tensor they form a minimal set that generates all local gauge
invariants. We also present curvature invariants that reduce to the gauge
invariants in linearized theory.
|
gr-qc
|
we present two complex scalar gauge invariants for perturbations of the kerr spacetime defined covariantly in terms of the killing vectors and the conformal killingyano tensor of the background together with the linearized curvature and its first derivatives these invariants are in particular sensitive to variations of the kerr parameters together with the teukolsky scalars and the linearized ricci tensor they form a minimal set that generates all local gauge invariants we also present curvature invariants that reduce to the gauge invariants in linearized theory
|
[['we', 'present', 'two', 'complex', 'scalar', 'gauge', 'invariants', 'for', 'perturbations', 'of', 'the', 'kerr', 'spacetime', 'defined', 'covariantly', 'in', 'terms', 'of', 'the', 'killing', 'vectors', 'and', 'the', 'conformal', 'killingyano', 'tensor', 'of', 'the', 'background', 'together', 'with', 'the', 'linearized', 'curvature', 'and', 'its', 'first', 'derivatives', 'these', 'invariants', 'are', 'in', 'particular', 'sensitive', 'to', 'variations', 'of', 'the', 'kerr', 'parameters', 'together', 'with', 'the', 'teukolsky', 'scalars', 'and', 'the', 'linearized', 'ricci', 'tensor', 'they', 'form', 'a', 'minimal', 'set', 'that', 'generates', 'all', 'local', 'gauge', 'invariants', 'we', 'also', 'present', 'curvature', 'invariants', 'that', 'reduce', 'to', 'the', 'gauge', 'invariants', 'in', 'linearized', 'theory']]
|
[-0.2348969604655662, 0.15958481560296872, -0.05503705972257782, 0.06410226882983218, -0.17111427540178684, -0.11322302537326537, -0.14222429133266867, 0.2898815560264184, -0.242435402417665, -0.23199884935336954, 0.08725232165683444, -0.2908692164456143, -0.2036773806766552, 0.08055904761833303, -0.02485563532613656, 0.07548969790051856, 0.0014837852487450138, 0.08841848032110754, -0.12808162798036765, -0.27952395714819434, 0.4390838187680963, 0.026574974660487735, 0.2101065462044276, 0.02406823117943371, 0.1613336766576942, -0.03198177942129619, -0.03752039793659659, 0.03586201666689971, -0.13429663711148726, 0.1401401332963039, 0.2136927724492339, 0.08546668029225925, 0.11106574068612912, -0.43433318867841186, -0.18573703528244925, 0.09260262944461668, 0.10524924006860922, 0.11765179402359269, -0.004935813328141675, -0.3345032943960498, 0.12390937455655897, -0.09789841051816064, -0.1604743126047063, -0.1808802444679553, -0.01624811059411834, -0.06682869877447101, -0.2136903177782455, 0.08822219467906775, 0.037267365996890206, 0.02702380111988853, -0.1260514395106036, -0.060016453457201885, -0.12604019409045578, 0.05060935027568656, 0.14189002072055112, 0.01943445475772023, 0.11938016431077439, -0.14654868018320377, -0.10260050869957708, 0.36669125966727734, -0.16605965442517223, -0.3566583979463972, 0.08120033229865573, -0.1239285422489047, -0.15161073582027765, 0.06757025000474909, 0.15061777839984963, 0.19406604771228397, -0.1287652522462475, 0.17696434216477963, 0.008577488899669226, 0.08179694465635454, 0.1278056846548091, 0.06393142284496742, 0.20748812057735289, -0.07442726918277057, 0.05542098793255932, 0.12886746346073993, 0.007225142046809197, -0.0906269950353924, -0.4375713725738666, -0.20589261111419868, -0.10782643671777538, 0.10185211745693404, -0.22358134409690084, -0.1811869633219698, 0.4714499880587134, 0.10092542591857423, 0.13696483429658282, 0.11086853703155237, 0.24949128656264613, 0.09774553288092755, 0.10602706998915357, 0.11950270214172846, 0.2927890799665714, 0.22354674893705284, 0.09629887566381298, -0.2122327610521632, -0.11206569931305507, 0.1656011515899616]
|
1,803.05342
|
Zassenhaus Conjecture on torsion units holds for $\text{SL}(2,p)$ and
$\text{SL}(2,p^2)$
|
H.J. Zassenhaus conjectured that any unit of finite order and augmentation
$1$ in the integral group ring $\mathbb{Z}G$ of a finite group $G$ is conjugate
in the rational group algebra $\mathbb{Q}G$ to an element of $G$. We prove the
Zassenhaus Conjecture for the groups $\text{SL}(2,p)$ and $\text{SL}(2,p^2)$
with $p$ a prime number. This is the first infinite family of non-solvable
groups for which the Zassenhaus Conjecture has been proved. We also prove that
if $G=\text{SL}(2,p^f)$, with $f$ arbitrary and $u$ is a torsion unit of
$\mathbb{Z}G$ with augmentation $1$ and order coprime with $p$ then $u$ is
conjugate in $\mathbb{Q}G$ to an element of $G$. By known results, this reduces
the proof of the Zassenhaus Conjecture for this groups to prove that every unit
of $\mathbb{Z}G$ of order multiple of $p$ and augmentation $1$ has actually
order $p$.
|
math.GR
|
hj zassenhaus conjectured that any unit of finite order and augmentation 1 in the integral group ring mathbbzg of a finite group g is conjugate in the rational group algebra mathbbqg to an element of g we prove the zassenhaus conjecture for the groups textsl2p and textsl2p2 with p a prime number this is the first infinite family of nonsolvable groups for which the zassenhaus conjecture has been proved we also prove that if gtextsl2pf with f arbitrary and u is a torsion unit of mathbbzg with augmentation 1 and order coprime with p then u is conjugate in mathbbqg to an element of g by known results this reduces the proof of the zassenhaus conjecture for this groups to prove that every unit of mathbbzg of order multiple of p and augmentation 1 has actually order p
|
[['hj', 'zassenhaus', 'conjectured', 'that', 'any', 'unit', 'of', 'finite', 'order', 'and', 'augmentation', '1', 'in', 'the', 'integral', 'group', 'ring', 'mathbbzg', 'of', 'a', 'finite', 'group', 'g', 'is', 'conjugate', 'in', 'the', 'rational', 'group', 'algebra', 'mathbbqg', 'to', 'an', 'element', 'of', 'g', 'we', 'prove', 'the', 'zassenhaus', 'conjecture', 'for', 'the', 'groups', 'textsl2p', 'and', 'textsl2p2', 'with', 'p', 'a', 'prime', 'number', 'this', 'is', 'the', 'first', 'infinite', 'family', 'of', 'nonsolvable', 'groups', 'for', 'which', 'the', 'zassenhaus', 'conjecture', 'has', 'been', 'proved', 'we', 'also', 'prove', 'that', 'if', 'gtextsl2pf', 'with', 'f', 'arbitrary', 'and', 'u', 'is', 'a', 'torsion', 'unit', 'of', 'mathbbzg', 'with', 'augmentation', '1', 'and', 'order', 'coprime', 'with', 'p', 'then', 'u', 'is', 'conjugate', 'in', 'mathbbqg', 'to', 'an', 'element', 'of', 'g', 'by', 'known', 'results', 'this', 'reduces', 'the', 'proof', 'of', 'the', 'zassenhaus', 'conjecture', 'for', 'this', 'groups', 'to', 'prove', 'that', 'every', 'unit', 'of', 'mathbbzg', 'of', 'order', 'multiple', 'of', 'p', 'and', 'augmentation', '1', 'has', 'actually', 'order', 'p']]
|
[-0.2087486802979752, 0.08910916566145952, -0.11374894846230746, -0.025302909393104967, -0.09731247808646273, -0.12923412204685586, 0.006416111129025618, 0.3383091017189953, -0.33092330245784035, -0.2427947187796235, 0.0799045168320407, -0.2580220704915485, -0.11200581795624372, 0.1670628322702315, -0.11167036222500934, -0.012769885390514026, 0.027809347239909347, 0.16400162067126345, -0.052735875538308864, -0.33759878664105025, 0.3552995368355402, -0.07052929807730295, 0.16937111431249866, 0.04715881638090919, 0.12691098034243892, 0.025189692704696898, -0.003946102238087742, -0.002591269677159963, -0.14678307805394677, 0.11494040587847984, 0.2858391805379479, 0.04161535414556662, 0.3035096823065369, -0.33736707764328455, -0.1598849103561844, 0.2212640370906296, 0.13997899944445602, -0.0035028483830737297, -0.0550588620464421, -0.20978349976724497, 0.22494276086627332, -0.21265064804228367, -0.16749987079658443, -0.04289622401335725, 0.15101771499892627, 0.007632186562167825, -0.317151063632358, -0.025151214145201568, 0.12180461831632312, 0.10966521113835, -0.017134351862801447, -0.12824406683858897, -0.03214277222890545, 0.09280061494145128, 0.00167817374760354, 0.08950835830549261, -0.002587412912139876, -0.045592812888531224, -0.120701982891532, 0.39618729998107516, -0.04938636587380811, -0.18417578919066324, 0.10226915157227605, -0.20847001630054027, -0.19225509197071747, 0.10848099464481628, 0.0387150542224171, 0.1385943624087506, -0.0028940610311649463, 0.21759773751643177, -0.1452477034802238, 0.10366444043918616, 0.09375907982941027, -0.0862726459607344, 0.04104522619637902, 0.05911014787335363, 0.13644639267780198, 0.11619445593441251, -0.0023811629904365098, 0.0809348162677553, -0.352182787453704, -0.23988810365122779, -0.17868794249715628, 0.1109376022592187, -0.09775543184379651, -0.15236207262474905, 0.33906901183503646, 0.08055367146929106, 0.11658259608127453, 0.1170117724419537, 0.21514376101118546, 0.11386132173895559, 0.09558766604642625, 0.09821316355632412, 0.07029882160325845, 0.2310707536853712, -0.08825826860826325, -0.20599032733934344, -0.020533445249829026, 0.20682730675433522]
|
1,803.05343
|
Generalized Bernstein operators defined by increasing nodes
|
We study certain generalizations of the classical Bernstein operators,
defined via increasing sequences of nodes. Such operators are required to fix
two functions, $f_0$ and $f_1$, such that $f_0 > 0$ and $f_1/ f_0$ is
increasing on an interval $[a,b]$. A characterization regarding when this can
be done is presented. From it we obtain, under rather general circumstances,
the following necessary condition for existence: if nodes are
non-{\guillemotleft}decreasing, then $(f_1/f_0)^\prime >0 $ on $(a,b)$, while
if nodes are strictly increasing, then $(f_1/f_0)^\prime >0 $ on $[a,b]$.
|
math.CA
|
we study certain generalizations of the classical bernstein operators defined via increasing sequences of nodes such operators are required to fix two functions f_0 and f_1 such that f_0 0 and f_1 f_0 is increasing on an interval ab a characterization regarding when this can be done is presented from it we obtain under rather general circumstances the following necessary condition for existence if nodes are nonguillemotleftdecreasing then f_1f_0prime 0 on ab while if nodes are strictly increasing then f_1f_0prime 0 on ab
|
[['we', 'study', 'certain', 'generalizations', 'of', 'the', 'classical', 'bernstein', 'operators', 'defined', 'via', 'increasing', 'sequences', 'of', 'nodes', 'such', 'operators', 'are', 'required', 'to', 'fix', 'two', 'functions', 'f_0', 'and', 'f_1', 'such', 'that', 'f_0', '0', 'and', 'f_1', 'f_0', 'is', 'increasing', 'on', 'an', 'interval', 'ab', 'a', 'characterization', 'regarding', 'when', 'this', 'can', 'be', 'done', 'is', 'presented', 'from', 'it', 'we', 'obtain', 'under', 'rather', 'general', 'circumstances', 'the', 'following', 'necessary', 'condition', 'for', 'existence', 'if', 'nodes', 'are', 'nonguillemotleftdecreasing', 'then', 'f_1f_0prime', '0', 'on', 'ab', 'while', 'if', 'nodes', 'are', 'strictly', 'increasing', 'then', 'f_1f_0prime', '0', 'on', 'ab']]
|
[-0.17125818813947263, 0.16366573659634015, -0.03295031196903438, 0.05826914088829653, -0.03997724553337321, -0.16244702255353333, 0.06647818343190011, 0.4114755702670664, -0.30454792170785366, -0.17669215865898877, 0.1120704529574141, -0.2870265529956669, -0.14126994502730666, 0.21042562270304188, -0.03699124954873696, 0.034811469889245925, 0.06934385844506323, 0.10323794648866169, -0.09352173492661678, -0.24701445701066405, 0.36451492515625433, -0.06059975576354191, 0.18823273750022054, 0.059802945786941564, 0.030929741502040996, 0.021431799104902893, 0.01488535274984315, -0.0060155922546982765, -0.19586383574396676, 0.046759156766347586, 0.2292900713160634, 0.14967678223038092, 0.2862116976175457, -0.389866563398391, -0.13104940203484147, 0.18458220016036647, 0.14989419722114689, 0.024570454833155963, 0.023418187072093134, -0.23359082597307862, 0.21008010540972463, -0.08637225697166287, -0.10386828323826194, -0.09379281511064619, 0.06416974729509092, 0.09547644853228121, -0.35612533016246745, 0.04376875918824226, 0.055873604188673195, 0.09125805088551715, -0.060999192454619336, -0.17040124815393937, -0.02879067259491421, 0.09879102703307581, 0.04233331364230253, 0.10572891871852334, 0.06817270809551701, -0.08622851372638252, -0.05129172507440671, 0.3350428745499812, -0.026329190708929674, -0.27333018926437946, 0.1540243893978186, -0.1496269227936864, -0.15103285175282508, 0.04527805154793896, 0.09923784948477987, 0.1412888426508289, -0.09656947742714692, 0.12240310731431236, -0.04999862834229134, 0.1433616272872314, 0.1324180068273563, 0.02732001888580271, 0.1459295516309794, 0.06923364085087087, 0.11544571615377208, 0.11334413121076067, 0.031190803172648884, -0.038095980719663206, -0.35092621981166305, -0.1335279908729717, -0.18210063194856047, 0.10647376859560609, -0.06181015987494902, -0.14525807620957493, 0.37028290482703596, 0.10074220994356438, 0.19167874979320915, 0.0829142271715682, 0.23594201433006673, 0.1727350065833889, 0.017115638866380324, 0.05127883924869821, 0.1467424132861197, 0.13207150725647807, -0.019274563962244428, -0.1401623104669852, 0.05812899434240535, 0.045580832893028854]
|
1,803.05344
|
Viscosity bound versus the universal relaxation bound
|
For gauge theories with an Einstein gravity dual, the AdS/CFT correspondence
predicts a universal value for the ratio of the shear viscosity to the entropy
density, $\eta/s=1/4\pi$. The holographic calculations have motivated the
formulation of the celebrated KSS conjecture, according to which all fluids
conform to the lower bound $\eta/s \geq 1/4\pi$. The bound on $\eta/s$ may be
regarded as a lower bound on the {\it relaxation} properties of perturbed
fluids and it has been the focus of much recent attention. In particular, it
was argued that for a class of field theories with Gauss-Bonnet gravity dual,
the shear viscosity to entropy density ratio, $\eta/s$, could violate the
conjectured KSS bound. In the present paper we argue that the proposed
violations of the KSS bound are strongly constrained by Bekenstein's
generalized second law (GSL) of thermodynamics. In particular, it is shown that
physical consistency of the Gauss-Bonnet theory with the GSL requires its
coupling constant to be bounded by $\lambda_{GB}\lesssim 0.063$. We further
argue that the genuine physical bound on the relaxation properties of
physically consistent fluids is $\Im\omega(k>2\pi T)>\pi T$, where $\omega$ and
$k$ are respectively the proper frequency and the wavenumber of a perturbation
mode in the fluid.
|
hep-th
|
for gauge theories with an einstein gravity dual the adscft correspondence predicts a universal value for the ratio of the shear viscosity to the entropy density etas14pi the holographic calculations have motivated the formulation of the celebrated kss conjecture according to which all fluids conform to the lower bound etas geq 14pi the bound on etas may be regarded as a lower bound on the it relaxation properties of perturbed fluids and it has been the focus of much recent attention in particular it was argued that for a class of field theories with gaussbonnet gravity dual the shear viscosity to entropy density ratio etas could violate the conjectured kss bound in the present paper we argue that the proposed violations of the kss bound are strongly constrained by bekensteins generalized second law gsl of thermodynamics in particular it is shown that physical consistency of the gaussbonnet theory with the gsl requires its coupling constant to be bounded by lambda_gblesssim 0063 we further argue that the genuine physical bound on the relaxation properties of physically consistent fluids is imomegak2pi tpi t where omega and k are respectively the proper frequency and the wavenumber of a perturbation mode in the fluid
|
[['for', 'gauge', 'theories', 'with', 'an', 'einstein', 'gravity', 'dual', 'the', 'adscft', 'correspondence', 'predicts', 'a', 'universal', 'value', 'for', 'the', 'ratio', 'of', 'the', 'shear', 'viscosity', 'to', 'the', 'entropy', 'density', 'etas14pi', 'the', 'holographic', 'calculations', 'have', 'motivated', 'the', 'formulation', 'of', 'the', 'celebrated', 'kss', 'conjecture', 'according', 'to', 'which', 'all', 'fluids', 'conform', 'to', 'the', 'lower', 'bound', 'etas', 'geq', '14pi', 'the', 'bound', 'on', 'etas', 'may', 'be', 'regarded', 'as', 'a', 'lower', 'bound', 'on', 'the', 'it', 'relaxation', 'properties', 'of', 'perturbed', 'fluids', 'and', 'it', 'has', 'been', 'the', 'focus', 'of', 'much', 'recent', 'attention', 'in', 'particular', 'it', 'was', 'argued', 'that', 'for', 'a', 'class', 'of', 'field', 'theories', 'with', 'gaussbonnet', 'gravity', 'dual', 'the', 'shear', 'viscosity', 'to', 'entropy', 'density', 'ratio', 'etas', 'could', 'violate', 'the', 'conjectured', 'kss', 'bound', 'in', 'the', 'present', 'paper', 'we', 'argue', 'that', 'the', 'proposed', 'violations', 'of', 'the', 'kss', 'bound', 'are', 'strongly', 'constrained', 'by', 'bekensteins', 'generalized', 'second', 'law', 'gsl', 'of', 'thermodynamics', 'in', 'particular', 'it', 'is', 'shown', 'that', 'physical', 'consistency', 'of', 'the', 'gaussbonnet', 'theory', 'with', 'the', 'gsl', 'requires', 'its', 'coupling', 'constant', 'to', 'be', 'bounded', 'by', 'lambda_gblesssim', '0063', 'we', 'further', 'argue', 'that', 'the', 'genuine', 'physical', 'bound', 'on', 'the', 'relaxation', 'properties', 'of', 'physically', 'consistent', 'fluids', 'is', 'imomegak2pi', 'tpi', 't', 'where', 'omega', 'and', 'k', 'are', 'respectively', 'the', 'proper', 'frequency', 'and', 'the', 'wavenumber', 'of', 'a', 'perturbation', 'mode', 'in', 'the', 'fluid']]
|
[-0.1583652719449619, 0.1753726088556707, -0.14761500581252304, 0.05816674120653646, -0.07241081773312856, -0.16037065433479394, 0.0080922926791398, 0.21232667952456108, -0.20276466456495904, -0.2932133202140003, 0.05779315255737553, -0.2621256814307693, -0.11029353186916184, 0.15700161465939905, -0.048025721709968314, 0.08926604009871936, -0.04345675112239809, 0.08194808106671905, -0.06265434948727489, -0.26688978780587813, 0.30684486072218853, 0.07738761917271679, 0.3082528120468869, 0.134542796257507, 0.043328384250270746, -0.05921640167379695, 0.0466221581363693, 0.08728724438546435, -0.23002687856308632, 0.0707084548828954, 0.2032231834782946, 0.10653114215484961, 0.20022384090010414, -0.3800089019327189, -0.25964726519070075, 0.07449406343559274, 0.10016731578607413, 0.08949268411908468, -0.0003256061005010975, -0.23274730922503753, 0.06355629342777486, -0.17662411335164285, -0.11795082709792004, -0.0697071261826263, 0.06746578386648455, -0.06384430597583303, -0.26491931728745877, 0.17650784117362528, 0.0641550640975398, -0.036228457650716826, -0.0804956227269334, -0.10268898752536813, -0.0348638630051147, 0.012532754728307177, 0.12418353440700983, 0.07121970186085262, 0.1150753262212895, -0.15538528270201024, -0.0577260849584656, 0.3672421471582669, -0.09051946052491214, -0.20240041520916904, 0.18147289611321563, -0.1626467620036706, -0.16619730946570258, 0.07405185087518108, 0.10575451776785118, 0.16548059055555378, -0.11002809846023512, 0.13088918841859054, -0.07665823953757721, 0.16261516254385838, 0.0967463752104327, 0.05008788578296927, 0.2371309896263134, 0.09296327057903671, 0.0647242451721633, 0.14568648621501082, -0.020373585924383892, -0.09998412351970645, -0.35210089104701625, -0.1690108470349441, -0.22186424764742807, 0.08052817169421662, -0.14308907788206007, -0.12808827830597905, 0.2777413229523885, 0.12276806665238726, 0.1699803891683449, 0.11382726247415342, 0.21491952683903615, 0.15929232709606017, 0.05640104370523301, 0.11947447425601157, 0.3519276189758922, 0.20527238827057634, 0.09580475146496537, -0.2711728961794047, 0.03328263450406887, 0.13843011890908155]
|
1,803.05345
|
The ngVLA's Role in Exoplanet Science: Constraining Exo-Space Weather
|
Radio observations are currently the only way to explore accelerated
particles in cool stellar environments. We describe how a next generation VLA
can contribute to the understanding of the stellar contribution to exo-space
weather. This area holds both academic and popular interest, and is expected to
grow in the next several decades.
|
astro-ph.SR astro-ph.EP
|
radio observations are currently the only way to explore accelerated particles in cool stellar environments we describe how a next generation vla can contribute to the understanding of the stellar contribution to exospace weather this area holds both academic and popular interest and is expected to grow in the next several decades
|
[['radio', 'observations', 'are', 'currently', 'the', 'only', 'way', 'to', 'explore', 'accelerated', 'particles', 'in', 'cool', 'stellar', 'environments', 'we', 'describe', 'how', 'a', 'next', 'generation', 'vla', 'can', 'contribute', 'to', 'the', 'understanding', 'of', 'the', 'stellar', 'contribution', 'to', 'exospace', 'weather', 'this', 'area', 'holds', 'both', 'academic', 'and', 'popular', 'interest', 'and', 'is', 'expected', 'to', 'grow', 'in', 'the', 'next', 'several', 'decades']]
|
[-0.06450012951301268, 0.1833004085526157, -0.022891128668561578, 0.12811127913972506, -0.13467286989236107, -0.033838972834368736, 0.011304870091127949, 0.42925577198799986, -0.22177956502239865, -0.3414229961971824, 0.1138329372714417, -0.26750799314154744, -0.1020704836029416, 0.23104343324219093, -0.07878873810673562, -0.02615098548659052, 0.06757650488557723, -0.04382046347913834, -0.009637507448832575, -0.3123807040974498, 0.2336121084383474, 0.10509729156127343, 0.2210718841614345, 0.0444164033800077, 0.032425512094050646, -0.11523632819835956, -0.10334582182650383, -0.024394800026829425, -0.10277574063422015, 0.137452340672518, 0.32181561702432543, 0.18435141290179813, 0.29204942110496074, -0.4360995950678793, -0.2285027835303201, 0.1039309395620456, 0.1735876995192554, 0.08511379852783509, -0.07329000944558245, -0.2105143801488269, 0.05449492043520037, -0.20250616075757605, -0.17517394880549267, -0.01997147615139301, 0.03370675077446951, 0.024839019511861037, -0.218777048204524, 0.02232076829442611, 0.009834039633950362, -0.00012699935513620192, -0.06741182703990489, -0.06988225347147538, 0.029479071614332497, 0.1930061884743806, 0.0787968783093115, 0.06542904670081603, 0.1624088233164422, -0.15676782748554474, -0.07873114836939539, 0.42233858658717227, -0.0581377985027547, -0.06524996246354511, 0.27014267012978405, -0.20984256649031663, -0.19792035959052065, 0.05419179890304804, 0.25635016107788455, 0.08456123187743987, -0.1767692410100538, 0.0464867261001088, -0.0108422473556577, 0.15142158490534013, 0.0339117583935149, 0.04536064003388254, 0.3024212779262318, 0.16843823864697838, 0.07889921581283069, 0.12444687405457863, -0.16832400672137737, -0.08868190970343466, -0.19369781028049496, -0.14353665573379168, -0.13389419595925853, 0.05313269743839136, -0.04434060797827372, -0.10689546228744663, 0.40756137496590295, 0.22088271636480036, 0.1425409023023139, 0.03374795751789442, 0.3426983047169275, 0.036215111540514044, 0.09378416514776361, 0.11160543749932773, 0.29816987107579523, 0.11231440850175343, 0.15183140400152367, -0.15265651421549803, 0.0822822185089955, -0.004246728100742285]
|
1,803.05346
|
Design of thermo-piezoelectric microstructured bending actuators via
multi-field asymptotic homogenization
|
The use of integrated MicroElectroMechanical systems (MEMS) is recently
spread thanks to their improved sensitivity, accuracy and reliability. Accurate
preliminary computations born from the need of high precision in the
manufacturing process of such devices. Piezoelectric materials are broadly
employed in this field as direct converters between mechanical and electrical
signals and some of these piezoelectric materials show pyroelectric features,
which involve thermo-electrical interactions. Pyroelectric bending actuators
are analyzed in the present study in plane conditions. They consists of active
PZT layers with in-plane polarization and a microstructured composite layer
characterized by a periodic microstructure where PZT fibers with an out of
plane polarization are immersed in a polymeric matrix. The constitutive law of
the composite layer at the macroscale has been determined by means of a
multi-field asymptotic homogenization technique, recently developed for
thermo-piezoelectric materials. Overall constitutive equations characterizing
the behavior of the microstructured layer at the macroscale have been derived
and the closed form of the overall constitutive tensors has been provided for
the equivalent first-order (Cauchy) homogenized continuum. Deflection of
unimorph and bimorph bender actuators has been investigated in relation to
their geometrical features, exploiting the out of plane piezoelectric
properties of the composite layer, which modify the stiffness of the entire
bender. An accurate description of benders behavior at the structural length
scale is of fundamental importance in order to design devices with high
performances. In this regard, the influence of the microstructure on the global
response of the actuator is investigated in the present study in order to
understand how the composite material can be tailored to meet specific design
requirements.
|
physics.app-ph
|
the use of integrated microelectromechanical systems mems is recently spread thanks to their improved sensitivity accuracy and reliability accurate preliminary computations born from the need of high precision in the manufacturing process of such devices piezoelectric materials are broadly employed in this field as direct converters between mechanical and electrical signals and some of these piezoelectric materials show pyroelectric features which involve thermoelectrical interactions pyroelectric bending actuators are analyzed in the present study in plane conditions they consists of active pzt layers with inplane polarization and a microstructured composite layer characterized by a periodic microstructure where pzt fibers with an out of plane polarization are immersed in a polymeric matrix the constitutive law of the composite layer at the macroscale has been determined by means of a multifield asymptotic homogenization technique recently developed for thermopiezoelectric materials overall constitutive equations characterizing the behavior of the microstructured layer at the macroscale have been derived and the closed form of the overall constitutive tensors has been provided for the equivalent firstorder cauchy homogenized continuum deflection of unimorph and bimorph bender actuators has been investigated in relation to their geometrical features exploiting the out of plane piezoelectric properties of the composite layer which modify the stiffness of the entire bender an accurate description of benders behavior at the structural length scale is of fundamental importance in order to design devices with high performances in this regard the influence of the microstructure on the global response of the actuator is investigated in the present study in order to understand how the composite material can be tailored to meet specific design requirements
|
[['the', 'use', 'of', 'integrated', 'microelectromechanical', 'systems', 'mems', 'is', 'recently', 'spread', 'thanks', 'to', 'their', 'improved', 'sensitivity', 'accuracy', 'and', 'reliability', 'accurate', 'preliminary', 'computations', 'born', 'from', 'the', 'need', 'of', 'high', 'precision', 'in', 'the', 'manufacturing', 'process', 'of', 'such', 'devices', 'piezoelectric', 'materials', 'are', 'broadly', 'employed', 'in', 'this', 'field', 'as', 'direct', 'converters', 'between', 'mechanical', 'and', 'electrical', 'signals', 'and', 'some', 'of', 'these', 'piezoelectric', 'materials', 'show', 'pyroelectric', 'features', 'which', 'involve', 'thermoelectrical', 'interactions', 'pyroelectric', 'bending', 'actuators', 'are', 'analyzed', 'in', 'the', 'present', 'study', 'in', 'plane', 'conditions', 'they', 'consists', 'of', 'active', 'pzt', 'layers', 'with', 'inplane', 'polarization', 'and', 'a', 'microstructured', 'composite', 'layer', 'characterized', 'by', 'a', 'periodic', 'microstructure', 'where', 'pzt', 'fibers', 'with', 'an', 'out', 'of', 'plane', 'polarization', 'are', 'immersed', 'in', 'a', 'polymeric', 'matrix', 'the', 'constitutive', 'law', 'of', 'the', 'composite', 'layer', 'at', 'the', 'macroscale', 'has', 'been', 'determined', 'by', 'means', 'of', 'a', 'multifield', 'asymptotic', 'homogenization', 'technique', 'recently', 'developed', 'for', 'thermopiezoelectric', 'materials', 'overall', 'constitutive', 'equations', 'characterizing', 'the', 'behavior', 'of', 'the', 'microstructured', 'layer', 'at', 'the', 'macroscale', 'have', 'been', 'derived', 'and', 'the', 'closed', 'form', 'of', 'the', 'overall', 'constitutive', 'tensors', 'has', 'been', 'provided', 'for', 'the', 'equivalent', 'firstorder', 'cauchy', 'homogenized', 'continuum', 'deflection', 'of', 'unimorph', 'and', 'bimorph', 'bender', 'actuators', 'has', 'been', 'investigated', 'in', 'relation', 'to', 'their', 'geometrical', 'features', 'exploiting', 'the', 'out', 'of', 'plane', 'piezoelectric', 'properties', 'of', 'the', 'composite', 'layer', 'which', 'modify', 'the', 'stiffness', 'of', 'the', 'entire', 'bender', 'an', 'accurate', 'description', 'of', 'benders', 'behavior', 'at', 'the', 'structural', 'length', 'scale', 'is', 'of', 'fundamental', 'importance', 'in', 'order', 'to', 'design', 'devices', 'with', 'high', 'performances', 'in', 'this', 'regard', 'the', 'influence', 'of', 'the', 'microstructure', 'on', 'the', 'global', 'response', 'of', 'the', 'actuator', 'is', 'investigated', 'in', 'the', 'present', 'study', 'in', 'order', 'to', 'understand', 'how', 'the', 'composite', 'material', 'can', 'be', 'tailored', 'to', 'meet', 'specific', 'design', 'requirements']]
|
[-0.13572634659607447, 0.10786812186680353, -0.06292691017932323, -0.05391228953959454, -0.08929594164488441, -0.11990828846782361, -0.017111704384936303, 0.40581055672726396, -0.2753701453171247, -0.3018716814959506, 0.09426645655978726, -0.2610671848771303, -0.1753612621616798, 0.1916335970692506, -0.03978078173223008, 0.12559386537969025, -0.015486071921645127, -0.03014491137671002, -0.06021966527182623, -0.1912672540060929, 0.25408019381575286, 0.06951311153049271, 0.3328179694027781, 0.02330193175161681, 0.11255972980694479, -0.0070907413416231675, 0.0184091300786046, 0.05209676041990998, -0.13442512456271233, 0.13206284084255016, 0.25968385196580185, -0.013824215462205537, 0.22607237365710633, -0.4772878359142465, -0.2406997260845718, 0.025008393606791895, 0.09773618364741912, 0.05698615551668671, -0.03874296667609914, -0.23985318814326698, 0.09859599511731755, -0.13034770052851827, -0.1561854791201988, -0.07896669244016238, 0.008965888951823934, 0.06788597620184053, -0.23452642699703574, 0.035745685647601604, 0.041157322855504004, 0.09076177940314113, -0.06741159332964206, -0.11906562979989262, -0.03697611207749243, 0.12015730313865017, 0.03348660711308736, -0.051149242928438594, 0.17163824332987354, -0.14056005162384475, -0.04523317725574033, 0.3832399209989517, -0.015318447724866652, -0.1969227773920328, 0.143808345914074, -0.11016953734250626, -0.07257415897809992, 0.15574517236779106, 0.20876012452892168, 0.0806770740086215, -0.214127089503701, 0.05840266463002825, 0.03077138542677417, 0.18544277639298481, 0.07994968362618238, 0.04085775356471651, 0.21407872065372596, 0.22973411137575045, -0.004752280871660773, 0.1774975198032652, -0.06017512908654295, -0.01949946115421357, -0.25742843829930556, -0.17516288012749018, -0.17804407688946053, 0.033465254714070455, -0.10418215326331626, -0.17251773055812175, 0.39131914768773696, 0.12536351251241507, 0.12593358239709315, -0.007738663164094429, 0.2725276848011135, 0.10257671357293006, 0.09914132252434325, -0.002247905293409007, 0.35942834209984564, 0.18147654547558914, 0.1490607506570858, -0.234068641965595, 0.10260390386401648, 0.03965655629475474]
|
1,803.05347
|
Illumination-aware Faster R-CNN for Robust Multispectral Pedestrian
Detection
|
Multispectral images of color-thermal pairs have shown more effective than a
single color channel for pedestrian detection, especially under challenging
illumination conditions. However, there is still a lack of studies on how to
fuse the two modalities effectively. In this paper, we deeply compare six
different convolutional network fusion architectures and analyse their
adaptations, enabling a vanilla architecture to obtain detection performances
comparable to the state-of-the-art results. Further, we discover that
pedestrian detection confidences from color or thermal images are correlated
with illumination conditions. With this in mind, we propose an
Illumination-aware Faster R-CNN (IAF RCNN). Specifically, an Illumination-aware
Network is introduced to give an illumination measure of the input image. Then
we adaptively merge color and thermal sub-networks via a gate function defined
over the illumination value. The experimental results on KAIST Multispectral
Pedestrian Benchmark validate the effectiveness of the proposed IAF R-CNN.
|
cs.CV
|
multispectral images of colorthermal pairs have shown more effective than a single color channel for pedestrian detection especially under challenging illumination conditions however there is still a lack of studies on how to fuse the two modalities effectively in this paper we deeply compare six different convolutional network fusion architectures and analyse their adaptations enabling a vanilla architecture to obtain detection performances comparable to the stateoftheart results further we discover that pedestrian detection confidences from color or thermal images are correlated with illumination conditions with this in mind we propose an illuminationaware faster rcnn iaf rcnn specifically an illuminationaware network is introduced to give an illumination measure of the input image then we adaptively merge color and thermal subnetworks via a gate function defined over the illumination value the experimental results on kaist multispectral pedestrian benchmark validate the effectiveness of the proposed iaf rcnn
|
[['multispectral', 'images', 'of', 'colorthermal', 'pairs', 'have', 'shown', 'more', 'effective', 'than', 'a', 'single', 'color', 'channel', 'for', 'pedestrian', 'detection', 'especially', 'under', 'challenging', 'illumination', 'conditions', 'however', 'there', 'is', 'still', 'a', 'lack', 'of', 'studies', 'on', 'how', 'to', 'fuse', 'the', 'two', 'modalities', 'effectively', 'in', 'this', 'paper', 'we', 'deeply', 'compare', 'six', 'different', 'convolutional', 'network', 'fusion', 'architectures', 'and', 'analyse', 'their', 'adaptations', 'enabling', 'a', 'vanilla', 'architecture', 'to', 'obtain', 'detection', 'performances', 'comparable', 'to', 'the', 'stateoftheart', 'results', 'further', 'we', 'discover', 'that', 'pedestrian', 'detection', 'confidences', 'from', 'color', 'or', 'thermal', 'images', 'are', 'correlated', 'with', 'illumination', 'conditions', 'with', 'this', 'in', 'mind', 'we', 'propose', 'an', 'illuminationaware', 'faster', 'rcnn', 'iaf', 'rcnn', 'specifically', 'an', 'illuminationaware', 'network', 'is', 'introduced', 'to', 'give', 'an', 'illumination', 'measure', 'of', 'the', 'input', 'image', 'then', 'we', 'adaptively', 'merge', 'color', 'and', 'thermal', 'subnetworks', 'via', 'a', 'gate', 'function', 'defined', 'over', 'the', 'illumination', 'value', 'the', 'experimental', 'results', 'on', 'kaist', 'multispectral', 'pedestrian', 'benchmark', 'validate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'iaf', 'rcnn']]
|
[-0.043386746841072514, 0.014424237868259335, -0.08636440205960892, 0.038098730241421484, -0.04633104331120588, -0.18790142720734532, -0.01795241613204793, 0.49918328439230686, -0.22138811480188808, -0.3045740958459519, 0.08009145737925245, -0.2553619614287794, -0.17969326955149068, 0.18471350481284302, -0.18949286692525044, 0.0777471307632546, 0.13516004164735754, 0.04062338278570271, -0.07381695339788351, -0.2870402502325865, 0.2756708388272152, 0.03732690523814905, 0.3518557630111366, 0.04943308334633174, 0.11963178469454283, -0.03427594789414556, -0.0425907952753319, -0.01840563800179406, -0.06852129650803102, 0.13238762620505976, 0.2553143351236228, 0.1621932144882483, 0.24725928257538618, -0.44225664470683446, -0.21969912336468436, 0.07406094577163458, 0.12069627561873489, 0.07152550929987972, -0.05775674772206645, -0.369545330742856, 0.10506847327562062, -0.1665443662941534, 0.022269730390842443, -0.11039322087137432, -0.004773621374115973, -0.03774380653044795, -0.30772854556073925, -0.002059810423052876, 0.030034798028116875, 0.03630224836768804, -0.06294256896578375, -0.1054691351411646, 0.020965266616207425, 0.14332228331253505, 0.009109831109831852, 0.043079110829589456, 0.1688034922874474, -0.241183098120667, -0.13140431717054438, 0.3390602951523786, -0.07544734000305277, -0.19762340429649278, 0.25530010613269283, -0.03377257732648428, -0.09460127869152002, 0.12211156353172097, 0.2059537022318805, 0.16692482248775764, -0.1797990252465739, -0.07679940702090808, -0.07867403527785058, 0.17809828613409318, 0.0924520656772583, 0.04365857280269786, 0.17166573430860896, 0.2722891865141846, 0.06594472064089577, 0.1868385744649083, -0.23727613804744674, -0.025707011182720844, -0.18663511996180263, -0.09196522295755054, -0.13767695107165126, -0.028246623089445845, -0.08038261645108012, -0.12076777012076821, 0.44605905604320806, 0.2812208615087129, 0.2401664762813077, 0.10192928486666479, 0.3816852878886633, 0.02943914446497818, 0.11453861530163566, 0.0627661376038177, 0.20180739413530052, 0.020102430846529094, 0.0894581687667609, -0.18429846408568532, 0.04828170899438535, 0.054560406934600195]
|
1,803.05348
|
Asymptotic Analysis of Unsteady Neutron Transport Equation
|
Consider the unsteady neutron transport equation with diffusive boundary
condition in 2D convex domains. We establish the diffusive limit with both
initial layer and boundary layer corrections. The major difficulty is the lack
of regularity in the boundary layer with geometric correction. Our contribution
relies on a detailed analysis of asymptotic expansions inspired by the
compatibility condition and an intricate $L^{2m}-L^{\infty}$ framework which
yields stronger remainder estimates.
|
math.AP
|
consider the unsteady neutron transport equation with diffusive boundary condition in 2d convex domains we establish the diffusive limit with both initial layer and boundary layer corrections the major difficulty is the lack of regularity in the boundary layer with geometric correction our contribution relies on a detailed analysis of asymptotic expansions inspired by the compatibility condition and an intricate l2mlinfty framework which yields stronger remainder estimates
|
[['consider', 'the', 'unsteady', 'neutron', 'transport', 'equation', 'with', 'diffusive', 'boundary', 'condition', 'in', '2d', 'convex', 'domains', 'we', 'establish', 'the', 'diffusive', 'limit', 'with', 'both', 'initial', 'layer', 'and', 'boundary', 'layer', 'corrections', 'the', 'major', 'difficulty', 'is', 'the', 'lack', 'of', 'regularity', 'in', 'the', 'boundary', 'layer', 'with', 'geometric', 'correction', 'our', 'contribution', 'relies', 'on', 'a', 'detailed', 'analysis', 'of', 'asymptotic', 'expansions', 'inspired', 'by', 'the', 'compatibility', 'condition', 'and', 'an', 'intricate', 'l2mlinfty', 'framework', 'which', 'yields', 'stronger', 'remainder', 'estimates']]
|
[-0.15011360652661368, 0.049949056029523056, -0.10753600247927121, 0.05183629584046943, -0.09867966049976314, -0.12111379409820508, 0.028696349328522806, 0.2797176033369641, -0.2798019495667584, -0.27297526850962817, 0.13628927793756906, -0.25421071165839015, -0.11840829208715638, 0.15772982845221883, -0.07860201218429563, 0.09259688385776174, 0.12320669600740075, -0.0408166497389772, -0.07898174821218448, -0.15780921975922174, 0.4072837220755086, 0.0015832403216010599, 0.32029190845787525, 0.10219624676262098, 0.08611901713980001, -0.0007183258004708966, -0.016569549141368316, -0.02390032678620139, -0.1836987812794856, 0.12772636479044805, 0.15304957333006966, -0.04252305352337547, 0.24858384155459815, -0.5040737245676677, -0.23698744416904094, -0.0005897375991317763, 0.12778132999621666, 0.07566326744541693, -0.05173393049270415, -0.2624350508480375, 0.06919509631498202, -0.09530978705456007, -0.17469251983618336, -0.03112964740773635, -0.04639114308129273, 0.007614921792340812, -0.31820252095696644, 0.14002036025275044, 0.13456145983967763, 0.05446441117118099, -0.11177647312574868, -0.10202591707790966, -0.029030318841087952, 0.10160278290537979, 0.08389820104444039, 0.009934810518440026, 0.0847114927184059, -0.17203128111979632, -0.026561651198165632, 0.31424145474195925, -0.062323518722915826, -0.24616071442837145, 0.20120996917917658, -0.1552979150411687, -0.08697006959857335, 0.11803965313610301, 0.11068223608282408, 0.14557535680872735, -0.16850782978459636, 0.11464635764922836, -0.021001950721256435, 0.13661080408396561, 0.06351019721478224, 0.012924540120719084, 0.12001011762490023, 0.20726799079453323, 0.11632982350246453, 0.1834921940549541, -0.07953759252941653, -0.12667410571906548, -0.36779951022020474, -0.13591631971310073, -0.136620206678453, 0.05953089617116293, -0.17304489136032358, -0.22744205981882207, 0.316626115674292, 0.12330025214868695, 0.17682561372474545, 0.0597011287220573, 0.2986362188943286, 0.17057680545823037, 0.01526664287102089, 0.10001014286318599, 0.22487080323773978, 0.18796922905551297, 0.12090869974900982, -0.23696084462328634, 0.10909183171174641, 0.17436550989218835]
|
1,803.05349
|
Dispersion relation formalism for the two-photon exchange correction to
elastic muon-proton scattering: elastic intermediate state
|
We evaluate the two-photon exchange correction to the unpolarized cross
section in the elastic muon-proton scattering within dispersion relations. One
of the six independent invariant amplitudes requires a subtraction. We fix the
subtraction function to the model estimate of the full two-photon exchange at
one of three MUSE beam energies and make a prediction for the two other
energies. Additionally, we present single and double polarization observables
accounting for the lepton mass.
|
hep-ph nucl-ex nucl-th
|
we evaluate the twophoton exchange correction to the unpolarized cross section in the elastic muonproton scattering within dispersion relations one of the six independent invariant amplitudes requires a subtraction we fix the subtraction function to the model estimate of the full twophoton exchange at one of three muse beam energies and make a prediction for the two other energies additionally we present single and double polarization observables accounting for the lepton mass
|
[['we', 'evaluate', 'the', 'twophoton', 'exchange', 'correction', 'to', 'the', 'unpolarized', 'cross', 'section', 'in', 'the', 'elastic', 'muonproton', 'scattering', 'within', 'dispersion', 'relations', 'one', 'of', 'the', 'six', 'independent', 'invariant', 'amplitudes', 'requires', 'a', 'subtraction', 'we', 'fix', 'the', 'subtraction', 'function', 'to', 'the', 'model', 'estimate', 'of', 'the', 'full', 'twophoton', 'exchange', 'at', 'one', 'of', 'three', 'muse', 'beam', 'energies', 'and', 'make', 'a', 'prediction', 'for', 'the', 'two', 'other', 'energies', 'additionally', 'we', 'present', 'single', 'and', 'double', 'polarization', 'observables', 'accounting', 'for', 'the', 'lepton', 'mass']]
|
[-0.11169813303018196, 0.13292982940199888, -0.08680528621900724, 0.1445707620199149, -0.004550812817696068, -0.12099189090076834, 0.04509106868580501, 0.3954083314165473, -0.22701598221384403, -0.2920414592889655, -0.03286522735692819, -0.3313256834064507, -0.01075222930861249, 0.16418519736746223, 0.11224919959527647, 0.08174685204479222, 0.04416806263745659, -0.005445792326807148, -0.08466160541461755, -0.19704205334548736, 0.345814471741, 0.04090513438374425, 0.23625826937819105, 0.12893658534934124, 0.1111640748115153, 0.16168528012672645, -0.10284920189426178, -0.08362369256145838, -0.10999778961478215, 0.11520118583899198, 0.20239381631836295, 0.030427258653212955, 0.12429282824612325, -0.36533022470151383, -0.10435591392322546, 0.08937583290066363, 0.11137891897103852, 0.16642313252022076, -0.015405445754165865, -0.19865829983933103, -0.015163802160208838, -0.20970506112401685, -0.15669549426012155, -0.0665005137044419, -0.015598631845528467, -0.03559195697824988, -0.31247808141375166, 0.0737340525827474, -0.0679908046214324, -0.01408599015525801, -0.04955148931670313, -0.14370154914083993, -0.03368986471387972, 0.10794706796554641, 0.03065341891973124, 0.010551969837656038, 0.14434488934542364, -0.15572074397712438, -0.1288654484184614, 0.3733476738982265, -0.08769486047094688, -0.1839475479339146, 0.08209566662036297, -0.21381457437140247, -0.15830602680863295, 0.170132501813997, 0.18390891390542188, 0.07430834539506274, -0.20165200739736772, 0.05367750407215984, 0.014919779565793255, 0.19266839382342166, 0.10820872718532984, 0.04301417991518974, 0.17043547411190552, 0.14266155063847286, -0.02045176155095558, 0.09239518376044645, -0.2023790097898907, -0.06542513071710548, -0.3844176483495782, -0.11601422281172644, -0.07099095030247958, 0.052415188738248415, -0.09649653383490255, -0.13147185192469302, 0.39411456480674034, 0.12879009806137118, 0.23188335629593995, 0.021410719452736277, 0.39177038618880844, 0.14204587886666153, 0.11824483562183256, 0.007320359161692775, 0.33428470618350226, 0.15374098554214774, 0.06165306440865, -0.24883173859497118, 0.018938497245673917, 0.03073352993103779]
|
1,803.0535
|
Optimal Bounds for Johnson-Lindenstrauss Transformations
|
In 1984, Johnson and Lindenstrauss proved that any finite set of data in a
high-dimensional space can be projected to a lower-dimensional space while
preserving the pairwise Euclidean distance between points up to a bounded
relative error. If the desired dimension of the image is too small, however,
Kane, Meka, and Nelson (2011) and Jayram and Woodruff (2013) independently
proved that such a projection does not exist. In this paper, we provide a
precise asymptotic threshold for the dimension of the image, above which, there
exists a projection preserving the Euclidean distance, but, below which, there
does not exist such a projection.
|
cs.DM math.PR
|
in 1984 johnson and lindenstrauss proved that any finite set of data in a highdimensional space can be projected to a lowerdimensional space while preserving the pairwise euclidean distance between points up to a bounded relative error if the desired dimension of the image is too small however kane meka and nelson 2011 and jayram and woodruff 2013 independently proved that such a projection does not exist in this paper we provide a precise asymptotic threshold for the dimension of the image above which there exists a projection preserving the euclidean distance but below which there does not exist such a projection
|
[['in', '1984', 'johnson', 'and', 'lindenstrauss', 'proved', 'that', 'any', 'finite', 'set', 'of', 'data', 'in', 'a', 'highdimensional', 'space', 'can', 'be', 'projected', 'to', 'a', 'lowerdimensional', 'space', 'while', 'preserving', 'the', 'pairwise', 'euclidean', 'distance', 'between', 'points', 'up', 'to', 'a', 'bounded', 'relative', 'error', 'if', 'the', 'desired', 'dimension', 'of', 'the', 'image', 'is', 'too', 'small', 'however', 'kane', 'meka', 'and', 'nelson', '2011', 'and', 'jayram', 'and', 'woodruff', '2013', 'independently', 'proved', 'that', 'such', 'a', 'projection', 'does', 'not', 'exist', 'in', 'this', 'paper', 'we', 'provide', 'a', 'precise', 'asymptotic', 'threshold', 'for', 'the', 'dimension', 'of', 'the', 'image', 'above', 'which', 'there', 'exists', 'a', 'projection', 'preserving', 'the', 'euclidean', 'distance', 'but', 'below', 'which', 'there', 'does', 'not', 'exist', 'such', 'a', 'projection']]
|
[-0.09799409547921124, 0.09980501427872143, -0.09150837467727709, 0.07254846638762484, -0.04782030214646868, -0.14153021015683373, 0.08540895253114, 0.3488476356016655, -0.2660038583117592, -0.27764812404490713, 0.12330117147055217, -0.26206096533375484, -0.1242257462855538, 0.16815384511160208, -0.17345913878514194, 0.07544742520971626, 0.05760594988789629, 0.03893125615814272, -0.11744306412269818, -0.2977015379378024, 0.28832677324466843, -0.0017440289843316172, 0.2291109988433948, 0.05835788539044705, 0.16688522546867127, 0.019420830319908346, -0.01071686735011491, 0.06124605660899725, -0.13587219505094325, 0.11126836891486949, 0.26877422472570484, 0.14582526671481044, 0.2678037280600299, -0.32252940811289876, -0.2013190836262177, 0.20772262223010116, 0.1329390495380971, 0.08785568253484134, -0.029098002349629122, -0.2971795634549184, 0.10362410929747949, -0.09341814874799229, -0.08824838356881895, -0.0727545670964116, 0.09884507380261578, -0.036144600256104206, -0.278087270911783, 0.05221488858189653, 0.16036707372668565, 0.05752110843747562, -0.004193800713812166, -0.0822272398121034, -0.05398476728028161, 0.12856634743009493, -0.018010812713399382, 0.1372427442795871, 0.032992731059636626, -0.0445476310743092, -0.06717062038460783, 0.35540394397342906, -0.038924925823641175, -0.22515671433625267, 0.2190943803893877, -0.1478488567506657, -0.1127911895951804, 0.10359502138624735, 0.12523619618778134, 0.08536923469293077, -0.10101857634635605, 0.1931792327417426, -0.11034888284755688, 0.1736019954870583, 0.14924296670063747, 0.021945615440570547, 0.10323374560468045, 0.07385404013992086, 0.16313670238699107, 0.044720113121073546, -0.07849987297702361, -0.050660612093576904, -0.3152061991630962, -0.1595346921275646, -0.2658412800736579, 0.060590129913180135, -0.08875740436761749, -0.1883933841086486, 0.32361624701240777, 0.10357677364292756, 0.2546038662320843, 0.06068796841838561, 0.24941660599970242, 0.07938944250610588, 0.06123592472616948, 0.1897941272404483, 0.2427411636100242, 0.0897368217325386, 0.02390175698297646, -0.1454441986701853, 0.036576218195442184, 0.12369173690810795]
|
1,803.05351
|
Symmetries on manifolds: Generalizations of the Radial Lemma of Strauss
|
For a compact subgroup $G$ of the group of isometries acting on a Riemannian
manifold $M$ we investigate subspaces of Besov and Triebel-Lizorkin type which
are invariant with respect to the group action. Our main aim is to extend the
classical Strauss lemma under suitable assumptions on the Riemannian manifold
by proving that $G$-invariance of functions implies certain decay properties
and better local smoothness. As an application we obtain inequalities of
Caffarelli-Kohn-Nirenberg type for $G$-invariant functions. Our results
generalize those obtained by Skrzypczak. The main tool in our investigations
are atomic decompositions adapted to the $G$-action in combination with trace
theorems.
|
math.FA
|
for a compact subgroup g of the group of isometries acting on a riemannian manifold m we investigate subspaces of besov and triebellizorkin type which are invariant with respect to the group action our main aim is to extend the classical strauss lemma under suitable assumptions on the riemannian manifold by proving that ginvariance of functions implies certain decay properties and better local smoothness as an application we obtain inequalities of caffarellikohnnirenberg type for ginvariant functions our results generalize those obtained by skrzypczak the main tool in our investigations are atomic decompositions adapted to the gaction in combination with trace theorems
|
[['for', 'a', 'compact', 'subgroup', 'g', 'of', 'the', 'group', 'of', 'isometries', 'acting', 'on', 'a', 'riemannian', 'manifold', 'm', 'we', 'investigate', 'subspaces', 'of', 'besov', 'and', 'triebellizorkin', 'type', 'which', 'are', 'invariant', 'with', 'respect', 'to', 'the', 'group', 'action', 'our', 'main', 'aim', 'is', 'to', 'extend', 'the', 'classical', 'strauss', 'lemma', 'under', 'suitable', 'assumptions', 'on', 'the', 'riemannian', 'manifold', 'by', 'proving', 'that', 'ginvariance', 'of', 'functions', 'implies', 'certain', 'decay', 'properties', 'and', 'better', 'local', 'smoothness', 'as', 'an', 'application', 'we', 'obtain', 'inequalities', 'of', 'caffarellikohnnirenberg', 'type', 'for', 'ginvariant', 'functions', 'our', 'results', 'generalize', 'those', 'obtained', 'by', 'skrzypczak', 'the', 'main', 'tool', 'in', 'our', 'investigations', 'are', 'atomic', 'decompositions', 'adapted', 'to', 'the', 'gaction', 'in', 'combination', 'with', 'trace', 'theorems']]
|
[-0.11373747044789263, 0.04627722478831892, -0.10207858861949627, 0.09671407710820769, -0.11271179781876284, -0.10709438396912843, -0.005449752284140133, 0.3510862898155309, -0.2807335503915749, -0.22813015156206537, 0.14178559201248545, -0.23710084798063455, -0.1171041737624103, 0.24113987129651895, -0.14536459254340664, 0.038465934021785705, 0.06048944177069139, 0.04148711646114024, -0.1325317022948535, -0.24386051425359923, 0.47236340887623257, -0.018885023215333793, 0.23034576031075107, 0.022564583969196434, 0.0598238721895631, 0.015426350222660763, -0.04914801608826412, -0.036469182036448236, -0.18927139338224927, 0.1487840221930623, 0.22463416544222595, 0.07448400767280323, 0.24701962771244568, -0.374862095709927, -0.2011384248991709, 0.15809123537106679, 0.0746635752407336, -0.023373937502844572, -0.037483380466588945, -0.3627443091372157, 0.11888560158025363, -0.06431595108351938, -0.20982388086100617, -0.12484110364376909, -0.00637543756090621, 0.06107477602977675, -0.2885353526672219, 0.035786501675991726, 0.1416397157060628, 0.0567358621628955, -0.1204995214155331, -0.11742003965145438, -0.0024873598289703674, 0.09243212647662305, 0.012303384461228063, 0.08385843882742937, 0.13034599549644213, -0.028258032857043907, -0.1254078740632106, 0.34675145846339733, -0.12574659268565402, -0.2767585475426536, 0.16606345212105478, -0.1436832297390493, -0.20153539369602014, 0.04203626408822613, 0.11977108375233884, 0.16702244686202541, -0.08877983341675878, 0.16426900829451324, -0.09559998173949004, 0.08505344435591067, 0.06199760661266818, 0.0724936887336028, 0.03849850165989656, 0.10196715903855713, 0.1742509114141069, 0.14021461099008153, 0.040536940420544385, -0.035177145148673566, -0.34878288860442025, -0.17873306664647443, -0.1464797976279244, 0.1478596757832306, -0.14745427773185396, -0.13501569153833212, 0.35559333349107813, 0.04980765544235393, 0.1635573859831392, 0.1307462441774159, 0.1847041870587238, 0.044040210236159, 0.0633590034356728, 0.08336447709525871, 0.16166072393223496, 0.2599202204763078, -0.013886959393425742, -0.15336613739278204, -0.012580227231293326, 0.21173988781998507]
|
1,803.05352
|
Probing the critical point of the Jaynes-Cummings second-order
dissipative quantum phase transition
|
We highlight the importance of quantum fluctuations in organizing a
dissipative quantum phase transition for the driven Jaynes-Cummings interaction
with variable qubit-cavity detuning. The system response presents a substantial
difference from the predictions of the semiclassical theory, the extent of
which is revealed in the properties of quantum bistability, and visualized with
the help of quasi-distribution functions for the cavity field, subject to an
appropriate scale parameter. States anticipated by the neoclassical theory of
radiation coexist in the quantum picture, following the occurrence of
spontaneous dressed-state polarization and phase bistability at resonance.
|
quant-ph cond-mat.mes-hall
|
we highlight the importance of quantum fluctuations in organizing a dissipative quantum phase transition for the driven jaynescummings interaction with variable qubitcavity detuning the system response presents a substantial difference from the predictions of the semiclassical theory the extent of which is revealed in the properties of quantum bistability and visualized with the help of quasidistribution functions for the cavity field subject to an appropriate scale parameter states anticipated by the neoclassical theory of radiation coexist in the quantum picture following the occurrence of spontaneous dressedstate polarization and phase bistability at resonance
|
[['we', 'highlight', 'the', 'importance', 'of', 'quantum', 'fluctuations', 'in', 'organizing', 'a', 'dissipative', 'quantum', 'phase', 'transition', 'for', 'the', 'driven', 'jaynescummings', 'interaction', 'with', 'variable', 'qubitcavity', 'detuning', 'the', 'system', 'response', 'presents', 'a', 'substantial', 'difference', 'from', 'the', 'predictions', 'of', 'the', 'semiclassical', 'theory', 'the', 'extent', 'of', 'which', 'is', 'revealed', 'in', 'the', 'properties', 'of', 'quantum', 'bistability', 'and', 'visualized', 'with', 'the', 'help', 'of', 'quasidistribution', 'functions', 'for', 'the', 'cavity', 'field', 'subject', 'to', 'an', 'appropriate', 'scale', 'parameter', 'states', 'anticipated', 'by', 'the', 'neoclassical', 'theory', 'of', 'radiation', 'coexist', 'in', 'the', 'quantum', 'picture', 'following', 'the', 'occurrence', 'of', 'spontaneous', 'dressedstate', 'polarization', 'and', 'phase', 'bistability', 'at', 'resonance']]
|
[-0.1682799644464546, 0.2221252378596704, -0.08471797131832041, 0.049566200859692836, -0.0014508976398602776, -0.11991059876543106, 0.055585271313168996, 0.3153788644577498, -0.2606570403111856, -0.24621552220829154, 0.0021531503690588897, -0.27020395202967135, -0.15201850456145147, 0.1800758100580424, 0.011108476774888519, 0.06869904528392236, -0.006510888408545567, 0.005821076330587106, -0.006680944290406921, -0.12172721676609438, 0.3364077331194573, 0.059217075594579394, 0.3077499809998857, 0.04988203821678484, 0.06893106589964389, -0.0053058945550614935, 0.054712883399232574, 0.0020646284759530554, -0.12416122132234032, 0.07007083655828508, 0.2350955340896136, 0.030405003324393994, 0.2713433188669708, -0.4532043752791967, -0.2364107268614411, 0.03856977450651238, 0.12042442439933834, 0.16967933305979543, -0.05185969542388035, -0.3246622193888154, -0.05110173819791627, -0.15930755508294248, -0.1759908448084784, -0.07137339051721779, 0.0010071151305253254, 0.004114472438864734, -0.26577824353159446, 0.10725952174676501, 0.055709032281099455, 0.09866048840036534, -0.04845347190680711, -0.011210424596514635, -0.009333747965486153, 0.107623075813298, -0.006452732711888688, 0.025377388100858534, 0.15333395359187346, -0.18648992568689762, -0.14296319567517418, 0.36431333759759105, -0.07553261165942429, -0.14289266824008615, 0.12613189574735967, -0.1924436810861706, -0.05031640423239087, 0.1455437032677962, 0.1250628568814136, 0.05686358331814003, -0.09201681706548223, 0.0636017570087342, 0.06628741107314177, 0.19293665746226907, 0.023097603220578647, 0.11513850122244786, 0.244928813129461, 0.15788144187029937, -0.004407832490118301, 0.17989029797077502, -0.06487706251462678, -0.2312649457877421, -0.3292785862298763, -0.10670458217930939, -0.1770715487604637, 0.06695925372996894, -0.08720568560396635, -0.16962195623605308, 0.4451521717659805, 0.17465452663600445, 0.17594852964596255, -0.05359648565291022, 0.23874399669812588, 0.18340811673450566, 0.04916819684085962, -0.01578847791635148, 0.32437060810828017, 0.19747424793034873, 0.11938669316409885, -0.3597447871478558, 0.04342244342273182, 0.01337558949244735]
|
1,803.05353
|
MedShare: Medical Resource Sharing among Autonomous Healthcare Providers
|
Legacy Electronic Health Records (EHRs) systems were not developed with the
level of connectivity expected from them nowadays. Therefore, interoperability
weakness inherent in the legacy systems can result in poor patient care and
waste of financial resources. Large hospitals are less likely to share their
data with external hospitals due to economic and political reasons. Motivated
by these facts, we aim to provide a set of software implementation guidelines,
i.e., MedShare to deal with interoperability issues among disconnected
healthcare systems. The proposed integrated architecture includes: 1) a data
extractor to fetch legacy medical data from a hemodialysis center, 2)
converting it to a common data model, 3) indexing patient information using the
HashMap technique, and 4) a set of services and tools that can be installed as
a coherent environment on top of stand-alone EHRs systems. Our work enabled
three cooperating but autonomous hospitals to mutually exchange medical data
and helped them develop a common reference architecture. It lets stakeholders
retain control over their patient data, winning the trust and confidence much
needed towards a successful deployment of MedShare. Security concerns were
effectively addressed that also included patient consent in the data exchange
process. Thereby, the implemented toolset offered a collaborative environment
to share EHRs by the healthcare providers.
|
cs.SE
|
legacy electronic health records ehrs systems were not developed with the level of connectivity expected from them nowadays therefore interoperability weakness inherent in the legacy systems can result in poor patient care and waste of financial resources large hospitals are less likely to share their data with external hospitals due to economic and political reasons motivated by these facts we aim to provide a set of software implementation guidelines ie medshare to deal with interoperability issues among disconnected healthcare systems the proposed integrated architecture includes 1 a data extractor to fetch legacy medical data from a hemodialysis center 2 converting it to a common data model 3 indexing patient information using the hashmap technique and 4 a set of services and tools that can be installed as a coherent environment on top of standalone ehrs systems our work enabled three cooperating but autonomous hospitals to mutually exchange medical data and helped them develop a common reference architecture it lets stakeholders retain control over their patient data winning the trust and confidence much needed towards a successful deployment of medshare security concerns were effectively addressed that also included patient consent in the data exchange process thereby the implemented toolset offered a collaborative environment to share ehrs by the healthcare providers
|
[['legacy', 'electronic', 'health', 'records', 'ehrs', 'systems', 'were', 'not', 'developed', 'with', 'the', 'level', 'of', 'connectivity', 'expected', 'from', 'them', 'nowadays', 'therefore', 'interoperability', 'weakness', 'inherent', 'in', 'the', 'legacy', 'systems', 'can', 'result', 'in', 'poor', 'patient', 'care', 'and', 'waste', 'of', 'financial', 'resources', 'large', 'hospitals', 'are', 'less', 'likely', 'to', 'share', 'their', 'data', 'with', 'external', 'hospitals', 'due', 'to', 'economic', 'and', 'political', 'reasons', 'motivated', 'by', 'these', 'facts', 'we', 'aim', 'to', 'provide', 'a', 'set', 'of', 'software', 'implementation', 'guidelines', 'ie', 'medshare', 'to', 'deal', 'with', 'interoperability', 'issues', 'among', 'disconnected', 'healthcare', 'systems', 'the', 'proposed', 'integrated', 'architecture', 'includes', '1', 'a', 'data', 'extractor', 'to', 'fetch', 'legacy', 'medical', 'data', 'from', 'a', 'hemodialysis', 'center', '2', 'converting', 'it', 'to', 'a', 'common', 'data', 'model', '3', 'indexing', 'patient', 'information', 'using', 'the', 'hashmap', 'technique', 'and', '4', 'a', 'set', 'of', 'services', 'and', 'tools', 'that', 'can', 'be', 'installed', 'as', 'a', 'coherent', 'environment', 'on', 'top', 'of', 'standalone', 'ehrs', 'systems', 'our', 'work', 'enabled', 'three', 'cooperating', 'but', 'autonomous', 'hospitals', 'to', 'mutually', 'exchange', 'medical', 'data', 'and', 'helped', 'them', 'develop', 'a', 'common', 'reference', 'architecture', 'it', 'lets', 'stakeholders', 'retain', 'control', 'over', 'their', 'patient', 'data', 'winning', 'the', 'trust', 'and', 'confidence', 'much', 'needed', 'towards', 'a', 'successful', 'deployment', 'of', 'medshare', 'security', 'concerns', 'were', 'effectively', 'addressed', 'that', 'also', 'included', 'patient', 'consent', 'in', 'the', 'data', 'exchange', 'process', 'thereby', 'the', 'implemented', 'toolset', 'offered', 'a', 'collaborative', 'environment', 'to', 'share', 'ehrs', 'by', 'the', 'healthcare', 'providers']]
|
[-0.1136610329831279, 0.005037481848543818, -0.04387744445380872, 0.09504811902725918, -0.1360733955420409, -0.18542691918080945, 0.13669220846851618, 0.3892801077606934, -0.24765761402996203, -0.3613705747598077, 0.1467784776660903, -0.3379181993410932, -0.08089193431558811, 0.19544701973565184, -0.15128963837285536, 0.057956743700592554, 0.10501702675212726, 0.00588041786864531, 0.04903211309820373, -0.3089210930827426, 0.281152688998738, 0.05617493198386583, 0.3689784922097918, 0.04688081492045985, 0.05778889419076946, 0.012477484676372079, -0.06983933291732541, -0.04141505173118152, -0.03911984711581699, 0.20028477228355132, 0.43496600664740664, 0.24740505536104943, 0.39252339511006634, -0.4682053857057997, -0.15716869359919622, 0.06728389851287803, 0.1247081282019934, 0.06441349721653838, -0.029486204631450286, -0.3174459428359185, 0.0579956017301228, -0.25665915775501613, -0.12627931096075665, -0.11408901849741261, -0.03915781150802996, -0.001417850860783342, -0.25791355437775443, -0.015175677950237425, -0.01702304095034352, 0.1251388965445815, -0.0586765801310268, -0.09512844833418799, -0.04947338420083945, 0.23989279973713423, 0.0313214770583515, 0.01661146082194834, 0.17436861285111344, -0.12343340212009052, -0.13322701602631692, 0.39182240292610765, 0.06236086041300368, -0.1439329941567142, 0.20874841721927367, -0.05856304956618154, -0.15602060906742746, 0.08177430020505111, 0.23430690574301496, -0.010258152104195917, -0.2782082157169957, 0.006568525929695665, 0.06894577969570906, 0.1830403591230403, 0.024826643233485882, 0.03805631213116197, 0.19161586250908655, 0.17960779292698842, 0.05292922512908439, 0.07881761593371178, -0.027112666851201193, -0.08513036428824139, -0.1753334841822066, -0.12413022530183775, -0.12900196162060365, 0.03820373659262047, -0.05173683607822524, -0.13207924092025722, 0.34712426239868754, 0.21184831580771044, 0.09736035122011688, -0.007672873352771824, 0.3592823888536868, -0.035118848701246146, 0.15848371960466853, 0.1039356997358676, 0.11574870341760332, 0.0039705992179009525, 0.21719639669161164, -0.12643933006408578, 0.12250653396414828, -0.06849139086671571]
|
1,803.05354
|
Observations of fast-moving features in the debris disk of AU Mic on a
three-year timescale: Confirmation and new discoveries
|
The nearby and young M star AU Mic is surrounded by a debris disk in which we
previously identified a series of large-scale arch-like structures that have
never been seen before in any other debris disk and that move outward at high
velocities. We initiated a monitoring program with the following objectives: 1)
track the location of the structures and better constrain their projected
speeds, 2) search for new features emerging closer in, and ultimately 3)
understand the mechanism responsible for the motion and production of the disk
features. AU Mic was observed at 11 different epochs between August 2014 and
October 2017 with the IR camera and spectrograph of SPHERE. These high-contrast
imaging data were processed with a variety of angular, spectral, and
polarimetric differential imaging techniques to reveal the faintest structures
in the disk. We measured the projected separations of the features in a
systematic way for all epochs. We also applied the very same measurements to
older observations from the Hubble Space Telescope (HST) with the visible
cameras STIS and ACS. The main outcomes of this work are 1) the recovery of the
five southeastern broad arch-like structures we identified in our first study,
and confirmation of their fast motion (projected speed in the range 4-12 km/s);
2) the confirmation that the very first structures observed in 2004 with ACS
are indeed connected to those observed later with STIS and now SPHERE; 3) the
discovery of two new very compact structures at the northwest side of the disk
(at 0.40" and 0.55" in May 2015) that move to the southeast at low speed; and
4) the identification of a new arch-like structure that might be emerging at
the southeast side at about 0.4" from the star (as of May 2016). Abridged.
|
astro-ph.EP astro-ph.IM
|
the nearby and young m star au mic is surrounded by a debris disk in which we previously identified a series of largescale archlike structures that have never been seen before in any other debris disk and that move outward at high velocities we initiated a monitoring program with the following objectives 1 track the location of the structures and better constrain their projected speeds 2 search for new features emerging closer in and ultimately 3 understand the mechanism responsible for the motion and production of the disk features au mic was observed at 11 different epochs between august 2014 and october 2017 with the ir camera and spectrograph of sphere these highcontrast imaging data were processed with a variety of angular spectral and polarimetric differential imaging techniques to reveal the faintest structures in the disk we measured the projected separations of the features in a systematic way for all epochs we also applied the very same measurements to older observations from the hubble space telescope hst with the visible cameras stis and acs the main outcomes of this work are 1 the recovery of the five southeastern broad archlike structures we identified in our first study and confirmation of their fast motion projected speed in the range 412 kms 2 the confirmation that the very first structures observed in 2004 with acs are indeed connected to those observed later with stis and now sphere 3 the discovery of two new very compact structures at the northwest side of the disk at 040 and 055 in may 2015 that move to the southeast at low speed and 4 the identification of a new archlike structure that might be emerging at the southeast side at about 04 from the star as of may 2016 abridged
|
[['the', 'nearby', 'and', 'young', 'm', 'star', 'au', 'mic', 'is', 'surrounded', 'by', 'a', 'debris', 'disk', 'in', 'which', 'we', 'previously', 'identified', 'a', 'series', 'of', 'largescale', 'archlike', 'structures', 'that', 'have', 'never', 'been', 'seen', 'before', 'in', 'any', 'other', 'debris', 'disk', 'and', 'that', 'move', 'outward', 'at', 'high', 'velocities', 'we', 'initiated', 'a', 'monitoring', 'program', 'with', 'the', 'following', 'objectives', '1', 'track', 'the', 'location', 'of', 'the', 'structures', 'and', 'better', 'constrain', 'their', 'projected', 'speeds', '2', 'search', 'for', 'new', 'features', 'emerging', 'closer', 'in', 'and', 'ultimately', '3', 'understand', 'the', 'mechanism', 'responsible', 'for', 'the', 'motion', 'and', 'production', 'of', 'the', 'disk', 'features', 'au', 'mic', 'was', 'observed', 'at', '11', 'different', 'epochs', 'between', 'august', '2014', 'and', 'october', '2017', 'with', 'the', 'ir', 'camera', 'and', 'spectrograph', 'of', 'sphere', 'these', 'highcontrast', 'imaging', 'data', 'were', 'processed', 'with', 'a', 'variety', 'of', 'angular', 'spectral', 'and', 'polarimetric', 'differential', 'imaging', 'techniques', 'to', 'reveal', 'the', 'faintest', 'structures', 'in', 'the', 'disk', 'we', 'measured', 'the', 'projected', 'separations', 'of', 'the', 'features', 'in', 'a', 'systematic', 'way', 'for', 'all', 'epochs', 'we', 'also', 'applied', 'the', 'very', 'same', 'measurements', 'to', 'older', 'observations', 'from', 'the', 'hubble', 'space', 'telescope', 'hst', 'with', 'the', 'visible', 'cameras', 'stis', 'and', 'acs', 'the', 'main', 'outcomes', 'of', 'this', 'work', 'are', '1', 'the', 'recovery', 'of', 'the', 'five', 'southeastern', 'broad', 'archlike', 'structures', 'we', 'identified', 'in', 'our', 'first', 'study', 'and', 'confirmation', 'of', 'their', 'fast', 'motion', 'projected', 'speed', 'in', 'the', 'range', '412', 'kms', '2', 'the', 'confirmation', 'that', 'the', 'very', 'first', 'structures', 'observed', 'in', '2004', 'with', 'acs', 'are', 'indeed', 'connected', 'to', 'those', 'observed', 'later', 'with', 'stis', 'and', 'now', 'sphere', '3', 'the', 'discovery', 'of', 'two', 'new', 'very', 'compact', 'structures', 'at', 'the', 'northwest', 'side', 'of', 'the', 'disk', 'at', '040', 'and', '055', 'in', 'may', '2015', 'that', 'move', 'to', 'the', 'southeast', 'at', 'low', 'speed', 'and', '4', 'the', 'identification', 'of', 'a', 'new', 'archlike', 'structure', 'that', 'might', 'be', 'emerging', 'at', 'the', 'southeast', 'side', 'at', 'about', '04', 'from', 'the', 'star', 'as', 'of', 'may', '2016', 'abridged']]
|
[-0.07136533587860565, 0.09289138377042247, -0.10422708954009526, 0.027248508334128174, -0.08851356600129305, -0.0931645889247199, 0.006166866182216576, 0.4050147724116132, -0.23952721865043095, -0.3795564412060162, 0.12340356612484585, -0.27741145632498215, -0.08523102939567612, 0.19415211780266012, -0.037429250433857295, -0.01432128054831101, 0.07861495484577391, -0.04004464245189083, -0.05515569468665564, -0.24122657443263207, 0.266167597640084, 0.08869646025542803, 0.17275981460246542, -0.014920963093220276, 0.07485031637166735, -0.05738016470239599, -0.07599756508795576, -0.001356831062082233, -0.13265664131065524, 0.10096639725157902, 0.23637540982465963, 0.1164297320876828, 0.22791180029419586, -0.38383570693902114, -0.17663930155260435, 0.023882923739626496, 0.1549969040897602, 0.023195693093957064, -0.033040079860263, -0.3088479312580256, 0.09143158316176281, -0.13136451197019935, -0.16473531457722237, 0.06330383824007142, 0.06369071957009027, 0.006118426590818962, -0.19907940862079462, 0.07752743335573405, 0.024199750450230678, 0.10318154384632322, -0.12586557208227792, -0.11818520619603647, -0.05567001796218243, 0.12467164282376568, -0.0032464824371407327, 0.07876999713527989, 0.11086381001233243, -0.13632421963531396, -0.09623296469209247, 0.35064593551214784, -0.06499929165746383, -0.015307742476678725, 0.2631566582269789, -0.247166612330859, -0.1751332180768562, 0.1692322149776163, 0.1798882094793161, 0.11982514318648954, -0.12733787611514158, 0.007724966733778991, -0.017895443233515638, 0.18794242022353141, 0.099640550852126, 0.045309355422271554, 0.2790329685057735, 0.12061289978509794, 0.047577671225968315, 0.08227761017358988, -0.26631685540073735, -0.04873715175892271, -0.2487224123708359, -0.15362645746968992, -0.1211772411970618, 0.016123650393600822, -0.08364356544515598, -0.07790203493874089, 0.3588341621153031, 0.11760302694264141, 0.2480779554802595, 0.0021169873253049543, 0.2795395612602635, 0.0334166582284945, 0.12545319307804564, 0.12027220057836753, 0.30861479889001175, 0.11138240017034874, 0.15981669565440998, -0.16591451442871738, 0.03830790312708412, -0.019529232110663437]
|
1,803.05355
|
FEVER: a large-scale dataset for Fact Extraction and VERification
|
In this paper we introduce a new publicly available dataset for verification
against textual sources, FEVER: Fact Extraction and VERification. It consists
of 185,445 claims generated by altering sentences extracted from Wikipedia and
subsequently verified without knowledge of the sentence they were derived from.
The claims are classified as Supported, Refuted or NotEnoughInfo by annotators
achieving 0.6841 in Fleiss $\kappa$. For the first two classes, the annotators
also recorded the sentence(s) forming the necessary evidence for their
judgment. To characterize the challenge of the dataset presented, we develop a
pipeline approach and compare it to suitably designed oracles. The best
accuracy we achieve on labeling a claim accompanied by the correct evidence is
31.87%, while if we ignore the evidence we achieve 50.91%. Thus we believe that
FEVER is a challenging testbed that will help stimulate progress on claim
verification against textual sources.
|
cs.CL
|
in this paper we introduce a new publicly available dataset for verification against textual sources fever fact extraction and verification it consists of 185445 claims generated by altering sentences extracted from wikipedia and subsequently verified without knowledge of the sentence they were derived from the claims are classified as supported refuted or notenoughinfo by annotators achieving 06841 in fleiss kappa for the first two classes the annotators also recorded the sentences forming the necessary evidence for their judgment to characterize the challenge of the dataset presented we develop a pipeline approach and compare it to suitably designed oracles the best accuracy we achieve on labeling a claim accompanied by the correct evidence is 3187 while if we ignore the evidence we achieve 5091 thus we believe that fever is a challenging testbed that will help stimulate progress on claim verification against textual sources
|
[['in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'publicly', 'available', 'dataset', 'for', 'verification', 'against', 'textual', 'sources', 'fever', 'fact', 'extraction', 'and', 'verification', 'it', 'consists', 'of', '185445', 'claims', 'generated', 'by', 'altering', 'sentences', 'extracted', 'from', 'wikipedia', 'and', 'subsequently', 'verified', 'without', 'knowledge', 'of', 'the', 'sentence', 'they', 'were', 'derived', 'from', 'the', 'claims', 'are', 'classified', 'as', 'supported', 'refuted', 'or', 'notenoughinfo', 'by', 'annotators', 'achieving', '06841', 'in', 'fleiss', 'kappa', 'for', 'the', 'first', 'two', 'classes', 'the', 'annotators', 'also', 'recorded', 'the', 'sentences', 'forming', 'the', 'necessary', 'evidence', 'for', 'their', 'judgment', 'to', 'characterize', 'the', 'challenge', 'of', 'the', 'dataset', 'presented', 'we', 'develop', 'a', 'pipeline', 'approach', 'and', 'compare', 'it', 'to', 'suitably', 'designed', 'oracles', 'the', 'best', 'accuracy', 'we', 'achieve', 'on', 'labeling', 'a', 'claim', 'accompanied', 'by', 'the', 'correct', 'evidence', 'is', '3187', 'while', 'if', 'we', 'ignore', 'the', 'evidence', 'we', 'achieve', '5091', 'thus', 'we', 'believe', 'that', 'fever', 'is', 'a', 'challenging', 'testbed', 'that', 'will', 'help', 'stimulate', 'progress', 'on', 'claim', 'verification', 'against', 'textual', 'sources']]
|
[-0.0656260003855819, 0.00714197306873372, -0.05973155749621835, 0.1015857479995606, -0.12155633162108868, -0.1316524830572035, 0.11329400627007097, 0.4389220084689123, -0.18989283091177905, -0.34937212345645813, 0.09042838476020434, -0.3121634037539798, -0.13120252247661843, 0.22182865526330026, -0.11016464939028242, 0.04100824581598523, 0.14090922551168414, 0.012743923696689308, 0.025935129560768114, -0.2895407172839368, 0.32744913054358243, 0.034742766719338666, 0.31899042674306316, 0.05964587777037255, 0.0955619848669799, -0.05076311285995001, -0.11878150133212118, 0.009837618444359651, -0.1163242070989413, 0.1472063272083382, 0.31360864796995247, 0.22909892788904646, 0.29675054277359664, -0.3967262843464855, -0.16081564551402888, 0.05930275888008874, 0.11791658094730637, 0.1293304498293811, -0.06366506162656974, -0.37929813279328445, 0.1396315890656662, -0.17676169734047115, -0.055864870798073875, -0.13522764651553473, 0.010427800945285028, -0.03885279049677094, -0.24522199503819112, 0.03165108592221411, 0.0919200305548245, 0.09955863403768217, -0.0555202879434805, -0.09488916901504471, 0.0022496049577900527, 0.17197515705284275, 0.053831352325441846, 0.035114570946116544, 0.08679420387934907, -0.1453529940612179, -0.17621065617749726, 0.37509999918261966, -0.06532251217273356, -0.18719104785526539, 0.17363916197621745, -0.05767411423547968, -0.15349362777328512, 0.07909772186845976, 0.13778495800810575, 0.09499702901055995, -0.16433744409026402, -0.03462038653941798, -0.041071430408229276, 0.2321271245388219, 0.08045605105436306, -0.031973019143716044, 0.23015280195042817, 0.19430072171899088, -0.042931955161140754, 0.16714595692626533, -0.061100483651062215, 0.001686578788573643, -0.2936987532302737, -0.1173501821017287, -0.20194393355249815, -0.009424418795609126, -0.008231528565295238, -0.10107751615450847, 0.34794471080306183, 0.26448213976440804, 0.14410544834677538, 0.09358566177135375, 0.299007267412478, 0.012114278670488754, 0.07402458007576583, 0.08810853729038125, 0.21437603938835162, -0.0013485412813559936, 0.08692266372453938, -0.14426673645405166, 0.16346572372674886, 0.0182324697222751]
|
1,803.05356
|
Hyperfine Paschen-Back regime of Potassium D$_2$ line observed by
Doppler-free spectroscopy
|
Selective reflection of a laser radiation from an interface formed by a
dielectric window and a potassium atomic vapour confined in a nano-cell with
$350~$nm gap thickness is implemented for the first time to study the atomic
transitions of K D$_2$ line in external magnetic fields. In moderate
$B$-fields, there are 44 individual Zeeman transitions which reduce to two
groups (one formed by $\sigma^+$ the other one by $\sigma^-$
circularly-polarised light), each containing eight atomic transitions, as the
magnetic field increases. Each of these groups contains one so-called "guiding"
transition whose particularities are to have a probability (intensity) as well
as a frequency shift slope (in MHz/G) that are constant in the whole range of
$0 - 10~$kG magnetic fields. In the case of $\pi$-polarised laser radiation,
among eight transitions two are forbidden at $B = 0$, yet their probabilities
undergo a giant modification under the influence of a magnetic field. We
demonstrate that for $B$-fields $> 165~$G a complete hyperfine Paschen-Back
regime is observed. Other peculiarities of K D$_2$ line behaviour in magnetic
field are also presented. We show a very good agreement between theoretical
calculations and experiments. The recording of the hyperfine Paschen-Back
regime of K D$_2$ line with high spectral resolution is demonstrated for the
first time.
|
physics.atom-ph
|
selective reflection of a laser radiation from an interface formed by a dielectric window and a potassium atomic vapour confined in a nanocell with 350nm gap thickness is implemented for the first time to study the atomic transitions of k d_2 line in external magnetic fields in moderate bfields there are 44 individual zeeman transitions which reduce to two groups one formed by sigma the other one by sigma circularlypolarised light each containing eight atomic transitions as the magnetic field increases each of these groups contains one socalled guiding transition whose particularities are to have a probability intensity as well as a frequency shift slope in mhzg that are constant in the whole range of 0 10kg magnetic fields in the case of pipolarised laser radiation among eight transitions two are forbidden at b 0 yet their probabilities undergo a giant modification under the influence of a magnetic field we demonstrate that for bfields 165g a complete hyperfine paschenback regime is observed other peculiarities of k d_2 line behaviour in magnetic field are also presented we show a very good agreement between theoretical calculations and experiments the recording of the hyperfine paschenback regime of k d_2 line with high spectral resolution is demonstrated for the first time
|
[['selective', 'reflection', 'of', 'a', 'laser', 'radiation', 'from', 'an', 'interface', 'formed', 'by', 'a', 'dielectric', 'window', 'and', 'a', 'potassium', 'atomic', 'vapour', 'confined', 'in', 'a', 'nanocell', 'with', '350nm', 'gap', 'thickness', 'is', 'implemented', 'for', 'the', 'first', 'time', 'to', 'study', 'the', 'atomic', 'transitions', 'of', 'k', 'd_2', 'line', 'in', 'external', 'magnetic', 'fields', 'in', 'moderate', 'bfields', 'there', 'are', '44', 'individual', 'zeeman', 'transitions', 'which', 'reduce', 'to', 'two', 'groups', 'one', 'formed', 'by', 'sigma', 'the', 'other', 'one', 'by', 'sigma', 'circularlypolarised', 'light', 'each', 'containing', 'eight', 'atomic', 'transitions', 'as', 'the', 'magnetic', 'field', 'increases', 'each', 'of', 'these', 'groups', 'contains', 'one', 'socalled', 'guiding', 'transition', 'whose', 'particularities', 'are', 'to', 'have', 'a', 'probability', 'intensity', 'as', 'well', 'as', 'a', 'frequency', 'shift', 'slope', 'in', 'mhzg', 'that', 'are', 'constant', 'in', 'the', 'whole', 'range', 'of', '0', '10kg', 'magnetic', 'fields', 'in', 'the', 'case', 'of', 'pipolarised', 'laser', 'radiation', 'among', 'eight', 'transitions', 'two', 'are', 'forbidden', 'at', 'b', '0', 'yet', 'their', 'probabilities', 'undergo', 'a', 'giant', 'modification', 'under', 'the', 'influence', 'of', 'a', 'magnetic', 'field', 'we', 'demonstrate', 'that', 'for', 'bfields', '165g', 'a', 'complete', 'hyperfine', 'paschenback', 'regime', 'is', 'observed', 'other', 'peculiarities', 'of', 'k', 'd_2', 'line', 'behaviour', 'in', 'magnetic', 'field', 'are', 'also', 'presented', 'we', 'show', 'a', 'very', 'good', 'agreement', 'between', 'theoretical', 'calculations', 'and', 'experiments', 'the', 'recording', 'of', 'the', 'hyperfine', 'paschenback', 'regime', 'of', 'k', 'd_2', 'line', 'with', 'high', 'spectral', 'resolution', 'is', 'demonstrated', 'for', 'the', 'first', 'time']]
|
[-0.170094935568731, 0.20285018330827503, 0.0005124812230195214, 0.00863789530732192, -0.01070589292908042, -0.1422398496146609, 0.05738126450252333, 0.45773085084993664, -0.2057343867380263, -0.3113860781554405, 0.019691372174974076, -0.24930972069411017, -0.06071983988328678, 0.17694467820522444, 0.06435095901010422, -0.03018458730473024, -0.010676644227705987, 0.04174051499221383, -0.04302181680587393, -0.16049304050279828, 0.29774947358613335, 0.00684728562014132, 0.23931879027769332, 0.04230348936526287, 0.034845546346793814, -0.05344670178573124, 0.03733401589277314, 0.035267714197497545, -0.11299455448816155, 0.039622880116377664, 0.2476349646884312, 0.0188217395280556, 0.2345645942111931, -0.39238674242231175, -0.2126455506803922, 0.05630373257757505, 0.12358068118365936, 0.11742236483558195, -0.0568361879803422, -0.2693565034546049, 0.03054642982258484, -0.08694861465106753, -0.12314254843925194, -0.033756490983068946, 0.041558573414889596, 0.037962958719808516, -0.26438256295216156, 0.037869358750872266, 0.0391516360573516, 0.13820558162714872, -0.07223087879034078, -0.12605597560362117, -0.02704699592690215, 0.11532340596157421, 0.0145184833045322, 0.04944454485652741, 0.1601494168010881, -0.114630577548708, -0.09092614072397714, 0.38697077734623014, -0.13607222271697006, -0.0919880673289299, 0.16197757328315296, -0.21719452183262059, -0.13217933250026118, 0.23197269639590892, 0.10129882521563914, 0.1280763926484236, -0.0940827054102201, 0.07130933161200274, -0.016620657329515714, 0.18162164969324338, 0.12396170770317862, 0.054723271216150865, 0.21441001296952003, 0.13160136590779917, 0.004627737951487666, 0.13352613470960045, -0.13767953740557792, -0.048594645106392664, -0.2807805266126241, -0.1363098408163684, -0.15485465330321616, 0.05697808399024169, -0.05596559648955718, -0.14268715673966742, 0.35436013386607534, 0.08965766168676498, 0.22664367758282802, -0.04298984186735186, 0.2763472892230422, 0.10683384898016457, 0.05696495475344042, 0.018847841329918038, 0.27027638851687674, 0.2050401534714804, 0.08472860326490751, -0.26624786518173427, 0.011608965186084189, -0.009934116292406987]
|
1,803.05357
|
Interplay between epidermal stem cell dynamics and dermal deformations
|
We introduce a particle-based model of self-replicating cells on a deformable
substrate composed of the dermis and the basement membrane and investigate the
relationship between dermal deformations and stem cell pattering on it. We show
that our model reproduces the formation of dermal papillae, protuberances
directing from the dermis to the epidermis, and the preferential stem cell
distributions on the tips of the dermal papillae, which the basic buckling
mechanism fails to explain. We argue that cell-type-dependent adhesion strength
of the cells to the basement membrane is crucial factors of these patterns.
|
q-bio.TO nlin.AO q-bio.CB
|
we introduce a particlebased model of selfreplicating cells on a deformable substrate composed of the dermis and the basement membrane and investigate the relationship between dermal deformations and stem cell pattering on it we show that our model reproduces the formation of dermal papillae protuberances directing from the dermis to the epidermis and the preferential stem cell distributions on the tips of the dermal papillae which the basic buckling mechanism fails to explain we argue that celltypedependent adhesion strength of the cells to the basement membrane is crucial factors of these patterns
|
[['we', 'introduce', 'a', 'particlebased', 'model', 'of', 'selfreplicating', 'cells', 'on', 'a', 'deformable', 'substrate', 'composed', 'of', 'the', 'dermis', 'and', 'the', 'basement', 'membrane', 'and', 'investigate', 'the', 'relationship', 'between', 'dermal', 'deformations', 'and', 'stem', 'cell', 'pattering', 'on', 'it', 'we', 'show', 'that', 'our', 'model', 'reproduces', 'the', 'formation', 'of', 'dermal', 'papillae', 'protuberances', 'directing', 'from', 'the', 'dermis', 'to', 'the', 'epidermis', 'and', 'the', 'preferential', 'stem', 'cell', 'distributions', 'on', 'the', 'tips', 'of', 'the', 'dermal', 'papillae', 'which', 'the', 'basic', 'buckling', 'mechanism', 'fails', 'to', 'explain', 'we', 'argue', 'that', 'celltypedependent', 'adhesion', 'strength', 'of', 'the', 'cells', 'to', 'the', 'basement', 'membrane', 'is', 'crucial', 'factors', 'of', 'these', 'patterns']]
|
[-0.0695764971078261, 0.12246365907376858, -0.04070879844428938, 0.023275651285875137, -0.007318349181582312, -0.09676905431794924, 0.052163815402149497, 0.3587628735208904, -0.29463073513010046, -0.22642615427273316, 0.018442123243073514, -0.2604994940479378, -0.2886238505367886, 0.13816867823518075, -0.11099696722250063, -0.04167687550320157, 0.020303674968430302, -0.036137586050144915, 0.08145750454591158, -0.15107300032728485, 0.2769478649555982, 0.05476558246332538, 0.33978432871319436, 0.07603900599713018, 0.16266942215868488, -0.016495109551105197, 0.03742682442560301, 0.011018173022011479, -0.19530426950918658, 0.16891508482417072, 0.13400701942577303, 0.07110099408489007, 0.2292328135437936, -0.5129765044324673, -0.21390270730378208, 0.03261481622070238, 0.12219984539538868, 0.09632706181318909, -0.025915309731787132, -0.20013689323441014, 0.08767421716430153, -0.1122982876354849, -0.11829557860587406, -0.005652968249805681, -0.02001801643336376, 0.08665908253905209, -0.21740884102105706, 0.08664141892798367, 0.058215531469373916, 0.03508210044538418, -0.10617614367076166, -0.08561646865660345, -0.08040894548777122, 0.18620758646955857, 0.048699182857360156, -0.02251842733124619, 0.24232543345827323, -0.13286042389470143, -0.06619617447338916, 0.37890981719061567, 0.04349874355062679, -0.17650707983565364, 0.23330637140220012, -0.16456198114083037, -0.06499080192604727, 0.09608714678580617, 0.17428529416057434, 0.06994223304202903, -0.10377759270620747, -0.010564500448079063, -0.05381210324524615, 0.1522813860511223, 0.11372258831429613, -0.09068946434942247, 0.2043888647887078, 0.2520102383057167, -0.02617900840078409, 0.12495641125581013, -0.13151659165857013, -0.07877699918737942, -0.2632361567335505, -0.18287998806316774, -0.10264939824528582, 0.0044806442980828524, -0.08260860065814456, -0.21797528032694463, 0.3862663967391619, 0.08808477163048727, 0.21471858442668895, 0.043751677192471264, 0.21416615951130843, -0.037201474086831804, 0.13968379480334428, -0.03599355963396502, 0.2039965953311936, 0.14301686266252955, 0.08051172430514471, -0.2954237124150885, 0.11388856501083125, 0.06276170249035644]
|
1,803.05358
|
Effective spin-spin interactions in bilayers of Rydberg atoms and polar
molecules
|
We show that indirect spin-spin interactions between effective spin-1/2
systems can be realized in two parallel 1D optical lattices loaded with polar
molecules and/or Rydberg atoms. The effective spin can be encoded into
low-energy rotational states of polar molecules or long-lived states of Rydberg
atoms, tightly trapped in a deep optical lattice. The spin-spin interactions
can be mediated by Rydberg atoms, placed in a parallel shallow optical lattice,
interacting with the effective spins by charge-dipole (for polar molecules) or
dipole-dipole (for Rydberg atoms) interaction. Indirect XX, Ising and XXZ
interactions with interaction coefficients $J^{\bot}$ and $J^{zz}$ sign varying
with interspin distance can be realized, in particular, the $J_{1}-J_{2}$ XXZ
model with frustrated ferro-(antiferro-)magnetic nearest (next-nearest)
neighbor interactions.
|
quant-ph cond-mat.quant-gas
|
we show that indirect spinspin interactions between effective spin12 systems can be realized in two parallel 1d optical lattices loaded with polar molecules andor rydberg atoms the effective spin can be encoded into lowenergy rotational states of polar molecules or longlived states of rydberg atoms tightly trapped in a deep optical lattice the spinspin interactions can be mediated by rydberg atoms placed in a parallel shallow optical lattice interacting with the effective spins by chargedipole for polar molecules or dipoledipole for rydberg atoms interaction indirect xx ising and xxz interactions with interaction coefficients jbot and jzz sign varying with interspin distance can be realized in particular the j_1j_2 xxz model with frustrated ferroantiferromagnetic nearest nextnearest neighbor interactions
|
[['we', 'show', 'that', 'indirect', 'spinspin', 'interactions', 'between', 'effective', 'spin12', 'systems', 'can', 'be', 'realized', 'in', 'two', 'parallel', '1d', 'optical', 'lattices', 'loaded', 'with', 'polar', 'molecules', 'andor', 'rydberg', 'atoms', 'the', 'effective', 'spin', 'can', 'be', 'encoded', 'into', 'lowenergy', 'rotational', 'states', 'of', 'polar', 'molecules', 'or', 'longlived', 'states', 'of', 'rydberg', 'atoms', 'tightly', 'trapped', 'in', 'a', 'deep', 'optical', 'lattice', 'the', 'spinspin', 'interactions', 'can', 'be', 'mediated', 'by', 'rydberg', 'atoms', 'placed', 'in', 'a', 'parallel', 'shallow', 'optical', 'lattice', 'interacting', 'with', 'the', 'effective', 'spins', 'by', 'chargedipole', 'for', 'polar', 'molecules', 'or', 'dipoledipole', 'for', 'rydberg', 'atoms', 'interaction', 'indirect', 'xx', 'ising', 'and', 'xxz', 'interactions', 'with', 'interaction', 'coefficients', 'jbot', 'and', 'jzz', 'sign', 'varying', 'with', 'interspin', 'distance', 'can', 'be', 'realized', 'in', 'particular', 'the', 'j_1j_2', 'xxz', 'model', 'with', 'frustrated', 'ferroantiferromagnetic', 'nearest', 'nextnearest', 'neighbor', 'interactions']]
|
[-0.22433716876675253, 0.35222579822268174, 0.08926808741551055, 0.060283449850976466, 0.012361353595295678, -0.300073256643246, 0.018475641686793255, 0.48890865341476775, -0.2692845482379198, -0.23347739045022298, -0.06569628126352378, -0.3241111900171508, -0.03919851323589683, 0.09724946379378115, 0.20919198865455615, -0.03493643577979959, 0.06059245496593497, -0.03207416184570478, -0.0549584764805015, -0.25603394088861736, 0.19551721983374118, 0.015618135004415704, 0.20372209152125795, 0.12119530616733043, 0.03803038904848306, 0.10083729117379889, 0.20990767507287472, -0.03788440574122512, -0.0862589933163532, 0.17295666373759994, 0.24156159265068075, -0.15838248985212133, 0.11175683987043473, -0.5365304957913316, -0.19709565453231334, 0.082871631719172, 0.2521265344451303, 0.24369952431677477, -0.025806008565300347, -0.4002037811376478, -0.17343510128557682, -0.21260971436681955, -0.09735879513141496, -0.13753411156510043, 0.015444929509059242, 0.09259884481358788, -0.3056212756539816, 0.11660931222368558, 0.05281783340336836, 0.1376282073719346, -0.06147174330266274, -0.07217224194141833, -0.017336029130155625, 0.0504663475687899, -0.04192256959985294, 0.07590503770372142, 0.17064310596122043, -0.11661020464101887, -0.14461685174509234, 0.40095026660710575, -0.15841906956680443, -0.16975863975999148, 0.2312958562422706, -0.08288829789051542, -0.06147012025441812, 0.09607076243213986, 0.15763675035989802, 0.03573193769578053, -0.15523516837831425, 0.11279876940660989, -0.02994609670308621, 0.2173873528190281, 0.026345246317593947, 0.09455101698960947, 0.3337046430810638, 0.11580292450709512, 0.01467614695429802, 0.2129256999079624, -0.09332606177169668, -0.17413355844176334, -0.12205005176264144, -0.10804646611618607, -0.2966027192973896, 0.045368300030088946, -0.09094181208967474, -0.103690035669538, 0.34821603851413113, 0.06815448694093072, 0.17248474751477655, -0.10022302593468972, 0.2015228184385468, 0.03396374314375546, 0.08346596594910016, 0.034376914975354854, 0.2937977723149664, 0.1751501394800194, -0.03993947975661444, -0.33186594506968625, 0.007982744806972536, 0.07782319500414736]
|
1,803.05359
|
Lie-algebraic classification of effective theories with enhanced soft
limits
|
A great deal of effort has recently been invested in developing methods of
calculating scattering amplitudes that bypass the traditional construction
based on Lagrangians and Feynman rules. Motivated by this progress, we
investigate the long-wavelength behavior of scattering amplitudes of massless
scalar particles: Nambu-Goldstone (NG) bosons. The low-energy dynamics of NG
bosons is governed by the underlying spontaneously broken symmetry, which
likewise allows one to bypass the Lagrangian and connect the scaling of the
scattering amplitudes directly to the Lie algebra of the symmetry generators.
We focus on theories with enhanced soft limits, where the scattering amplitudes
scale with a higher power of momentum than expected based on the mere existence
of Adler's zero. Our approach is complementary to that developed recently by
Cheung et al., and in the first step we reproduce their result. That is, as far
as Lorentz-invariant theories with a single physical NG boson are concerned, we
find no other nontrivial theories featuring enhanced soft limits beyond the
already well-known ones: the Galileon and the Dirac-Born-Infeld (DBI) scalar.
Next, we show that in a certain sense, these theories do not admit a nontrivial
generalization to non-Abelian internal symmetries. Namely, for compact internal
symmetry groups, all NG bosons featuring enhanced soft limits necessarily
belong to the center of the group. For noncompact symmetry groups such as the
ISO($n$) group featured by some multi-Galileon theories, these NG bosons then
necessarily belong to an Abelian normal subgroup. The Lie-algebraic consistency
constraints admit two infinite classes of solutions, generalizing the known
multi-Galileon and multi-flavor DBI theories.
|
hep-th gr-qc
|
a great deal of effort has recently been invested in developing methods of calculating scattering amplitudes that bypass the traditional construction based on lagrangians and feynman rules motivated by this progress we investigate the longwavelength behavior of scattering amplitudes of massless scalar particles nambugoldstone ng bosons the lowenergy dynamics of ng bosons is governed by the underlying spontaneously broken symmetry which likewise allows one to bypass the lagrangian and connect the scaling of the scattering amplitudes directly to the lie algebra of the symmetry generators we focus on theories with enhanced soft limits where the scattering amplitudes scale with a higher power of momentum than expected based on the mere existence of adlers zero our approach is complementary to that developed recently by cheung et al and in the first step we reproduce their result that is as far as lorentzinvariant theories with a single physical ng boson are concerned we find no other nontrivial theories featuring enhanced soft limits beyond the already wellknown ones the galileon and the diracborninfeld dbi scalar next we show that in a certain sense these theories do not admit a nontrivial generalization to nonabelian internal symmetries namely for compact internal symmetry groups all ng bosons featuring enhanced soft limits necessarily belong to the center of the group for noncompact symmetry groups such as the ison group featured by some multigalileon theories these ng bosons then necessarily belong to an abelian normal subgroup the liealgebraic consistency constraints admit two infinite classes of solutions generalizing the known multigalileon and multiflavor dbi theories
|
[['a', 'great', 'deal', 'of', 'effort', 'has', 'recently', 'been', 'invested', 'in', 'developing', 'methods', 'of', 'calculating', 'scattering', 'amplitudes', 'that', 'bypass', 'the', 'traditional', 'construction', 'based', 'on', 'lagrangians', 'and', 'feynman', 'rules', 'motivated', 'by', 'this', 'progress', 'we', 'investigate', 'the', 'longwavelength', 'behavior', 'of', 'scattering', 'amplitudes', 'of', 'massless', 'scalar', 'particles', 'nambugoldstone', 'ng', 'bosons', 'the', 'lowenergy', 'dynamics', 'of', 'ng', 'bosons', 'is', 'governed', 'by', 'the', 'underlying', 'spontaneously', 'broken', 'symmetry', 'which', 'likewise', 'allows', 'one', 'to', 'bypass', 'the', 'lagrangian', 'and', 'connect', 'the', 'scaling', 'of', 'the', 'scattering', 'amplitudes', 'directly', 'to', 'the', 'lie', 'algebra', 'of', 'the', 'symmetry', 'generators', 'we', 'focus', 'on', 'theories', 'with', 'enhanced', 'soft', 'limits', 'where', 'the', 'scattering', 'amplitudes', 'scale', 'with', 'a', 'higher', 'power', 'of', 'momentum', 'than', 'expected', 'based', 'on', 'the', 'mere', 'existence', 'of', 'adlers', 'zero', 'our', 'approach', 'is', 'complementary', 'to', 'that', 'developed', 'recently', 'by', 'cheung', 'et', 'al', 'and', 'in', 'the', 'first', 'step', 'we', 'reproduce', 'their', 'result', 'that', 'is', 'as', 'far', 'as', 'lorentzinvariant', 'theories', 'with', 'a', 'single', 'physical', 'ng', 'boson', 'are', 'concerned', 'we', 'find', 'no', 'other', 'nontrivial', 'theories', 'featuring', 'enhanced', 'soft', 'limits', 'beyond', 'the', 'already', 'wellknown', 'ones', 'the', 'galileon', 'and', 'the', 'diracborninfeld', 'dbi', 'scalar', 'next', 'we', 'show', 'that', 'in', 'a', 'certain', 'sense', 'these', 'theories', 'do', 'not', 'admit', 'a', 'nontrivial', 'generalization', 'to', 'nonabelian', 'internal', 'symmetries', 'namely', 'for', 'compact', 'internal', 'symmetry', 'groups', 'all', 'ng', 'bosons', 'featuring', 'enhanced', 'soft', 'limits', 'necessarily', 'belong', 'to', 'the', 'center', 'of', 'the', 'group', 'for', 'noncompact', 'symmetry', 'groups', 'such', 'as', 'the', 'ison', 'group', 'featured', 'by', 'some', 'multigalileon', 'theories', 'these', 'ng', 'bosons', 'then', 'necessarily', 'belong', 'to', 'an', 'abelian', 'normal', 'subgroup', 'the', 'liealgebraic', 'consistency', 'constraints', 'admit', 'two', 'infinite', 'classes', 'of', 'solutions', 'generalizing', 'the', 'known', 'multigalileon', 'and', 'multiflavor', 'dbi', 'theories']]
|
[-0.1348795784288086, 0.2102518646793783, -0.0838347799613075, 0.10292342001321231, -0.1410096518447972, -0.14749196660250163, 0.00985396190026222, 0.31409094449918484, -0.19544317564941593, -0.2814616802861565, 0.06162431637676491, -0.2593413379409526, -0.15280006277762936, 0.1364242912463851, -0.030240566013162606, 0.033731937818629376, -0.031252424989361316, 0.05479422426287783, -0.06875448363916803, -0.2449289512442192, 0.33954414899562835, 0.012986874110538338, 0.2806769007111143, 0.011749662759939383, 0.08698112735737595, 0.029236346609650354, -0.02390770587589941, -0.005567931840687379, -0.11629490400866871, 0.11034361637030088, 0.1977906070346762, 0.04242263827686088, 0.1652491443794588, -0.42976948176146834, -0.219793201290031, 0.1337047551046453, 0.17569376658684632, 0.10947313564020078, -0.024095943585507484, -0.30969220992847113, 0.05586255840080412, -0.18771597147588182, -0.17093932572788617, -0.10124345173153415, 0.008159060877005686, -0.0530046644257709, -0.21912197749588813, 0.07168102490959427, 0.06282450753042212, 0.04142033784256682, -0.031205517064563537, -0.08482078021825146, -0.08069290451112465, 0.048638132444466464, 0.11157517576361897, 0.007680803986659157, 0.09788685642195105, -0.18661528615029965, -0.1780083243224908, 0.4064981064220774, -0.07147678428856352, -0.19587731159936084, 0.1960044930337972, -0.1214573088036559, -0.22641768621360825, 0.1415347698543883, 0.11155721406930752, 0.11400852766928438, -0.11621387189006782, 0.18941521094416203, -0.044447390971981804, 0.11438276132867031, 0.08225476545885613, 0.06350190643502174, 0.20838432884829672, 0.10108163195218367, 0.02421480958309985, 0.09174082949698459, 0.017373732864143676, -0.10230758429065645, -0.36132650017088963, -0.10615885881986742, -0.1170395432532132, 0.06940272683738158, -0.06831143097241466, -0.15241995341466463, 0.36023863145601354, 0.12238236512348522, 0.1683629648579199, 0.08175261958376723, 0.2136695247500029, 0.1346943969347194, 0.12758183167215975, 0.05604452077136557, 0.2868278682695973, 0.1721418287729648, 0.0256510819781397, -0.20269711521495992, -0.07400033179965249, 0.13307022712979233]
|
1,803.0536
|
On the irreducible components of the compactified Jacobian of a ribbon
|
In this paper we study the irreducible components of the compactified
Jacobian of a ribbon $X$ of arithmetic genus $g$ over a smooth curve
$X_{\mathrm{red}}$ of genus $\bar{g}$. We prove that when $g\geq 4\bar{g}-2$
the moduli space of rank $2$ semistable vector bundles over $X_{\mathrm{red}}$
is not an irreducible component and we determine the irreducible components in
which it is contained. This answers a question of D. Chen and J.L. Kass in [CK]
and completes their results.
|
math.AG
|
in this paper we study the irreducible components of the compactified jacobian of a ribbon x of arithmetic genus g over a smooth curve x_mathrmred of genus barg we prove that when ggeq 4barg2 the moduli space of rank 2 semistable vector bundles over x_mathrmred is not an irreducible component and we determine the irreducible components in which it is contained this answers a question of d chen and jl kass in ck and completes their results
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'irreducible', 'components', 'of', 'the', 'compactified', 'jacobian', 'of', 'a', 'ribbon', 'x', 'of', 'arithmetic', 'genus', 'g', 'over', 'a', 'smooth', 'curve', 'x_mathrmred', 'of', 'genus', 'barg', 'we', 'prove', 'that', 'when', 'ggeq', '4barg2', 'the', 'moduli', 'space', 'of', 'rank', '2', 'semistable', 'vector', 'bundles', 'over', 'x_mathrmred', 'is', 'not', 'an', 'irreducible', 'component', 'and', 'we', 'determine', 'the', 'irreducible', 'components', 'in', 'which', 'it', 'is', 'contained', 'this', 'answers', 'a', 'question', 'of', 'd', 'chen', 'and', 'jl', 'kass', 'in', 'ck', 'and', 'completes', 'their', 'results']]
|
[-0.22571388214222482, 0.09040904947894002, -0.10989604215766932, -0.014399478035802776, -0.06310359321257754, -0.1422101252246648, -0.00341461443914906, 0.3582451236276963, -0.2956163091836749, -0.1780269861321997, 0.07564123716941606, -0.23771203129955037, -0.16229836461511818, 0.19017134776898986, -0.18473504322606163, -0.036742922824782295, 0.06181726587080472, 0.08030046577993277, -0.08887810653667091, -0.38984458168616165, 0.41359794477151857, -0.10092399106990244, 0.1645745759628512, 0.10280544998602488, 0.13886171079718987, 0.03648734306979522, -0.01713366439012257, -0.052893651814933086, -0.1331022448647599, 0.17484830232648607, 0.3489694959056136, 0.09444471205446266, 0.16516438261228236, -0.2941742635306877, -0.1774701964538041, 0.2651165314773853, 0.1470234887989087, -0.04090538377263206, 0.09820651698140176, -0.20450750438848864, 0.12142942615507825, -0.14205139207125111, -0.1748835172856579, -0.04397506317174112, 0.14041560366151956, -0.05092441143681975, -0.19386444757440807, -0.03153870210705979, 0.16187542052687826, 0.16313254597873703, -0.05667770957272198, -0.12707821365345168, -0.0811084225849324, 0.03500436779899787, 0.026011392291685618, 0.14638660057460437, 0.02201855557064551, -0.1409962221011016, -0.07146947161370032, 0.32257978416777944, -0.09088092533292601, -0.20654899049298586, 0.09074173914268613, -0.14751521387212985, -0.14874218867909214, 0.14589170304856994, 0.13959966082679662, 0.19164847430334161, 0.03778717008862185, 0.2187688009462609, -0.13335797321554776, 0.13570649239763216, 0.08114961137549914, -0.08710940686255894, 0.1273845154603289, 0.086167208642724, 0.045621806898624696, 0.10301494982559234, -0.025472313190835552, 0.054411784242335205, -0.37880729780708616, -0.2524812575933096, -0.11944396465991598, 0.17129253636045866, -0.10670590094181338, -0.16161899553372752, 0.4885737426969147, 0.054722562658827044, 0.23674220542700306, 0.1164575492982073, 0.23476863391949115, 0.005178327571499992, -0.00795903120731079, 0.14773234850852876, 0.12699326905547767, 0.22176445148432175, -0.07166507237628605, -0.113281953560717, -0.018424577822254318, 0.1919687814016298]
|
1,803.05361
|
Approximating Generalized Network Design under (Dis)economies of Scale
with Applications to Energy Efficiency
|
In a generalized network design (GND) problem, a set of resources are
assigned to multiple communication requests. Each request contributes its
weight to the resources it uses and the total load on a resource is then
translated to the cost it incurs via a resource specific cost function. For
example, a request may be to establish a virtual circuit, thus contributing to
the load on each edge in the circuit. Motivated by energy efficiency
applications, recently, there is a growing interest in GND using cost functions
that exhibit (dis)economies of scale ((D)oS), namely, cost functions that
appear subadditive for small loads and superadditive for larger loads.
The current paper advances the existing literature on approximation
algorithms for GND problems with (D)oS cost functions in various aspects: (1)
we present a generic approximation framework that yields approximation results
for a much wider family of requests in both directed and undirected graphs; (2)
our framework allows for unrelated weights, thus providing the first
non-trivial approximation for the problem of scheduling unrelated parallel
machines with (D)oS cost functions; (3) our framework is fully combinatorial
and runs in strongly polynomial time; (4) the family of (D)oS cost functions
considered in the current paper is more general than the one considered in the
existing literature, providing a more accurate abstraction for practical energy
conservation scenarios; and (5) we obtain the first approximation ratio for GND
with (D)oS cost functions that depends only on the parameters of the resources'
technology and does not grow with the number of resources, the number of
requests, or their weights. The design of our framework relies heavily on
Roughgarden's smoothness toolbox (JACM 2015), thus demonstrating the possible
usefulness of this toolbox in the area of approximation algorithms.
|
cs.GT cs.DS
|
in a generalized network design gnd problem a set of resources are assigned to multiple communication requests each request contributes its weight to the resources it uses and the total load on a resource is then translated to the cost it incurs via a resource specific cost function for example a request may be to establish a virtual circuit thus contributing to the load on each edge in the circuit motivated by energy efficiency applications recently there is a growing interest in gnd using cost functions that exhibit diseconomies of scale dos namely cost functions that appear subadditive for small loads and superadditive for larger loads the current paper advances the existing literature on approximation algorithms for gnd problems with dos cost functions in various aspects 1 we present a generic approximation framework that yields approximation results for a much wider family of requests in both directed and undirected graphs 2 our framework allows for unrelated weights thus providing the first nontrivial approximation for the problem of scheduling unrelated parallel machines with dos cost functions 3 our framework is fully combinatorial and runs in strongly polynomial time 4 the family of dos cost functions considered in the current paper is more general than the one considered in the existing literature providing a more accurate abstraction for practical energy conservation scenarios and 5 we obtain the first approximation ratio for gnd with dos cost functions that depends only on the parameters of the resources technology and does not grow with the number of resources the number of requests or their weights the design of our framework relies heavily on roughgardens smoothness toolbox jacm 2015 thus demonstrating the possible usefulness of this toolbox in the area of approximation algorithms
|
[['in', 'a', 'generalized', 'network', 'design', 'gnd', 'problem', 'a', 'set', 'of', 'resources', 'are', 'assigned', 'to', 'multiple', 'communication', 'requests', 'each', 'request', 'contributes', 'its', 'weight', 'to', 'the', 'resources', 'it', 'uses', 'and', 'the', 'total', 'load', 'on', 'a', 'resource', 'is', 'then', 'translated', 'to', 'the', 'cost', 'it', 'incurs', 'via', 'a', 'resource', 'specific', 'cost', 'function', 'for', 'example', 'a', 'request', 'may', 'be', 'to', 'establish', 'a', 'virtual', 'circuit', 'thus', 'contributing', 'to', 'the', 'load', 'on', 'each', 'edge', 'in', 'the', 'circuit', 'motivated', 'by', 'energy', 'efficiency', 'applications', 'recently', 'there', 'is', 'a', 'growing', 'interest', 'in', 'gnd', 'using', 'cost', 'functions', 'that', 'exhibit', 'diseconomies', 'of', 'scale', 'dos', 'namely', 'cost', 'functions', 'that', 'appear', 'subadditive', 'for', 'small', 'loads', 'and', 'superadditive', 'for', 'larger', 'loads', 'the', 'current', 'paper', 'advances', 'the', 'existing', 'literature', 'on', 'approximation', 'algorithms', 'for', 'gnd', 'problems', 'with', 'dos', 'cost', 'functions', 'in', 'various', 'aspects', '1', 'we', 'present', 'a', 'generic', 'approximation', 'framework', 'that', 'yields', 'approximation', 'results', 'for', 'a', 'much', 'wider', 'family', 'of', 'requests', 'in', 'both', 'directed', 'and', 'undirected', 'graphs', '2', 'our', 'framework', 'allows', 'for', 'unrelated', 'weights', 'thus', 'providing', 'the', 'first', 'nontrivial', 'approximation', 'for', 'the', 'problem', 'of', 'scheduling', 'unrelated', 'parallel', 'machines', 'with', 'dos', 'cost', 'functions', '3', 'our', 'framework', 'is', 'fully', 'combinatorial', 'and', 'runs', 'in', 'strongly', 'polynomial', 'time', '4', 'the', 'family', 'of', 'dos', 'cost', 'functions', 'considered', 'in', 'the', 'current', 'paper', 'is', 'more', 'general', 'than', 'the', 'one', 'considered', 'in', 'the', 'existing', 'literature', 'providing', 'a', 'more', 'accurate', 'abstraction', 'for', 'practical', 'energy', 'conservation', 'scenarios', 'and', '5', 'we', 'obtain', 'the', 'first', 'approximation', 'ratio', 'for', 'gnd', 'with', 'dos', 'cost', 'functions', 'that', 'depends', 'only', 'on', 'the', 'parameters', 'of', 'the', 'resources', 'technology', 'and', 'does', 'not', 'grow', 'with', 'the', 'number', 'of', 'resources', 'the', 'number', 'of', 'requests', 'or', 'their', 'weights', 'the', 'design', 'of', 'our', 'framework', 'relies', 'heavily', 'on', 'roughgardens', 'smoothness', 'toolbox', 'jacm', '2015', 'thus', 'demonstrating', 'the', 'possible', 'usefulness', 'of', 'this', 'toolbox', 'in', 'the', 'area', 'of', 'approximation', 'algorithms']]
|
[-0.15095856643885452, 0.056852928843861936, -0.04349973227647019, 0.04446566442493349, -0.07059799884007886, -0.1663274693469929, 0.10764856490011258, 0.3632027532211513, -0.2568787337420346, -0.32738353549064714, 0.08490021392591103, -0.2446126487173115, -0.13513601920608015, 0.20224079076616086, -0.08794251432437904, 0.09235442789918046, 0.05729103494818462, 0.019688029815718686, -0.02100418444954809, -0.2853533280899794, 0.3033354358426344, 0.07483714025667203, 0.3124391787433153, 0.09488856798777752, 0.05831988599092151, 0.021197420927835466, -0.012115093599518158, 0.03224449806387507, -0.09933492394039677, 0.1474114717949727, 0.2852708679633637, 0.17742604629756423, 0.33450179993262585, -0.4420012945263851, -0.2003231987905549, 0.11101747354012281, 0.09027098019312067, 0.0776740887887023, -0.02373474143384242, -0.19206919831155642, 0.08854941966803907, -0.18605234131999054, -0.08911849087175591, -0.06414816526936218, 0.020412783106003696, 0.0397025511213919, -0.2832504670100793, 0.029430379240874213, 0.017666606469410845, 0.0008826135034682651, -0.0485119502462093, -0.15975079042974938, 0.0170328317332578, 0.10909170774947398, -0.0033267582555784997, 0.045599418633880305, 0.11660975400838702, -0.13026998787939886, -0.14447692186548944, 0.37986888958567927, 0.0020156511490842495, -0.2298849841798023, 0.1733811618241024, -0.06453681365466751, -0.16858888587846263, 0.11930035504282092, 0.20034902245138905, 0.10276955299773854, -0.1346065763814881, 0.09032113263537646, -0.01932700285006587, 0.15845637692735637, 0.04745946973984094, 0.06760407356932298, 0.11524626113902713, 0.18393974191304752, 0.13749985430062706, 0.15004723091432923, -0.012694120492286435, -0.09715167204999504, -0.26717189317005313, -0.14170807854791426, -0.22032824426667136, 0.008395901416359024, -0.09904238702828723, -0.1604528744909458, 0.41199981943032465, 0.12584212520659718, 0.1764212464256608, 0.1570667459885833, 0.3302219453874573, 0.12785961154207648, 0.08907938586590156, 0.1659125352086895, 0.15261031410945677, 0.04565126862448319, 0.11897214026618684, -0.1642723336616265, 0.10774273325018634, 0.042771648892237175]
|
1,803.05362
|
Real-time System Modeling and Verification through Labeled Transition
System Analyser (LTSA)
|
With the advancement of software engineering in recent years, the model
checking techniques are widely applied in various areas to do the verification
for the system model. However, it is difficult to apply the model checking to
verify requirements due to lacking the details of the design. Unlike other
model checking tools, LTSA provides the structure diagram, which can bridge the
gap between the requirements and the design. In this paper, we demonstrate the
abilities of LTSA shipped with the classic case study of the steam boiler
system. The structure diagram of LTSA can specify the interactions between the
controller and the steam boiler, which can be derived from UML requirements
model such as system sequence diagram of the steam boiler system. The start-up
design model of LTSA can be generated from the structure diagram. Furthermore,
we provide a variation law of the steam rate to avoid the issue of state space
explosion and show how explicitly and implicitly model the time that reflects
the difference between system modeling and the physical world. Finally, the
derived model is verified against the required properties. Our work
demonstrates the potential power of integrating UML with model checking tools
in requirement elicitation, system design, and verification.
|
cs.SE
|
with the advancement of software engineering in recent years the model checking techniques are widely applied in various areas to do the verification for the system model however it is difficult to apply the model checking to verify requirements due to lacking the details of the design unlike other model checking tools ltsa provides the structure diagram which can bridge the gap between the requirements and the design in this paper we demonstrate the abilities of ltsa shipped with the classic case study of the steam boiler system the structure diagram of ltsa can specify the interactions between the controller and the steam boiler which can be derived from uml requirements model such as system sequence diagram of the steam boiler system the startup design model of ltsa can be generated from the structure diagram furthermore we provide a variation law of the steam rate to avoid the issue of state space explosion and show how explicitly and implicitly model the time that reflects the difference between system modeling and the physical world finally the derived model is verified against the required properties our work demonstrates the potential power of integrating uml with model checking tools in requirement elicitation system design and verification
|
[['with', 'the', 'advancement', 'of', 'software', 'engineering', 'in', 'recent', 'years', 'the', 'model', 'checking', 'techniques', 'are', 'widely', 'applied', 'in', 'various', 'areas', 'to', 'do', 'the', 'verification', 'for', 'the', 'system', 'model', 'however', 'it', 'is', 'difficult', 'to', 'apply', 'the', 'model', 'checking', 'to', 'verify', 'requirements', 'due', 'to', 'lacking', 'the', 'details', 'of', 'the', 'design', 'unlike', 'other', 'model', 'checking', 'tools', 'ltsa', 'provides', 'the', 'structure', 'diagram', 'which', 'can', 'bridge', 'the', 'gap', 'between', 'the', 'requirements', 'and', 'the', 'design', 'in', 'this', 'paper', 'we', 'demonstrate', 'the', 'abilities', 'of', 'ltsa', 'shipped', 'with', 'the', 'classic', 'case', 'study', 'of', 'the', 'steam', 'boiler', 'system', 'the', 'structure', 'diagram', 'of', 'ltsa', 'can', 'specify', 'the', 'interactions', 'between', 'the', 'controller', 'and', 'the', 'steam', 'boiler', 'which', 'can', 'be', 'derived', 'from', 'uml', 'requirements', 'model', 'such', 'as', 'system', 'sequence', 'diagram', 'of', 'the', 'steam', 'boiler', 'system', 'the', 'startup', 'design', 'model', 'of', 'ltsa', 'can', 'be', 'generated', 'from', 'the', 'structure', 'diagram', 'furthermore', 'we', 'provide', 'a', 'variation', 'law', 'of', 'the', 'steam', 'rate', 'to', 'avoid', 'the', 'issue', 'of', 'state', 'space', 'explosion', 'and', 'show', 'how', 'explicitly', 'and', 'implicitly', 'model', 'the', 'time', 'that', 'reflects', 'the', 'difference', 'between', 'system', 'modeling', 'and', 'the', 'physical', 'world', 'finally', 'the', 'derived', 'model', 'is', 'verified', 'against', 'the', 'required', 'properties', 'our', 'work', 'demonstrates', 'the', 'potential', 'power', 'of', 'integrating', 'uml', 'with', 'model', 'checking', 'tools', 'in', 'requirement', 'elicitation', 'system', 'design', 'and', 'verification']]
|
[-0.08145953874044083, 0.023877972258103487, -0.09483740589463294, 0.04766172229649563, -0.06659465290037135, -0.1416068246821515, 0.05582167965295757, 0.3582691542363813, -0.2989602667563985, -0.3642652206824808, 0.12769620228969386, -0.2136882184522933, -0.17193158784321524, 0.1988484982459627, -0.07458237022175247, 0.06970178211174373, 0.06524036589578674, -0.0014751760116743905, -0.043431426970783636, -0.2090965030322613, 0.2976691341807543, 0.0608439291437418, 0.3174360021879997, 0.046676800574813715, 0.0590721985848226, -0.015861956748464533, 0.0003706862429716611, -0.007866089136065603, -0.10551159209681456, 0.12603990423201764, 0.23696303937419, 0.196929142412413, 0.23819492777277315, -0.432752601242638, -0.22369243336263403, 0.09020699855981605, 0.1081205814941488, 0.0828275033720113, -0.010833494658834241, -0.26923201769806004, 0.0840827978028012, -0.23830160108140297, -0.11673258209894663, -0.06914138114205998, -0.02991338077533458, 0.024601731116011168, -0.23218019975875756, -0.015543356677746685, 0.07969871033418906, 0.051844214639750315, -0.06200005447381896, -0.05544449853036424, -0.06201142363945307, 0.1874634556752157, 0.03556197131766015, -0.0036156954871160276, 0.1267103580161562, -0.14310302661406105, -0.10072075585023789, 0.41891123584283546, -0.026337792692313733, -0.16839017491934483, 0.20203193189608382, -0.07720609799800486, -0.1209534918132417, 0.07179016080510624, 0.1618989247598185, 0.05354864989239476, -0.18314580010620676, 0.08923289528273716, 0.01923937480346176, 0.22265897681386085, -0.01869991276897215, -0.025749431172927172, 0.20540819109275277, 0.2421633671014914, 0.004130774036536149, 0.18623409317857975, -0.04299589018440654, -0.12230070818013745, -0.27926915814971615, -0.16942686840359653, -0.1221157417450848, -0.05215547094809745, -0.051090612418157065, -0.1463367365363164, 0.39002239717666076, 0.22606347713692876, 0.13263315767545272, 0.0459298289328208, 0.3373803977712328, 0.10983201926757623, 0.06337658960023537, 0.04532275715466644, 0.23032478241736226, 0.08068374122993038, 0.1521690144568333, -0.2336903988685358, 0.13520622216314168, 0.05747592934577042]
|
1,803.05363
|
A new exactly integrable hypergeometric potential for the Schr\"odinger
equation
|
We introduce a new exactly integrable potential for the Schr\"odinger
equation for which the solution of the problem may be expressed in terms of the
Gauss hypergeometric functions. This is a potential step with variable height
and steepness. We present the general solution of the problem, discuss the
transmission of a quantum particle above the barrier, and derive explicit
expressions for the reflection and transmission coefficients.
|
quant-ph
|
we introduce a new exactly integrable potential for the schrodinger equation for which the solution of the problem may be expressed in terms of the gauss hypergeometric functions this is a potential step with variable height and steepness we present the general solution of the problem discuss the transmission of a quantum particle above the barrier and derive explicit expressions for the reflection and transmission coefficients
|
[['we', 'introduce', 'a', 'new', 'exactly', 'integrable', 'potential', 'for', 'the', 'schrodinger', 'equation', 'for', 'which', 'the', 'solution', 'of', 'the', 'problem', 'may', 'be', 'expressed', 'in', 'terms', 'of', 'the', 'gauss', 'hypergeometric', 'functions', 'this', 'is', 'a', 'potential', 'step', 'with', 'variable', 'height', 'and', 'steepness', 'we', 'present', 'the', 'general', 'solution', 'of', 'the', 'problem', 'discuss', 'the', 'transmission', 'of', 'a', 'quantum', 'particle', 'above', 'the', 'barrier', 'and', 'derive', 'explicit', 'expressions', 'for', 'the', 'reflection', 'and', 'transmission', 'coefficients']]
|
[-0.13986566860341665, 0.03707534004228585, -0.06621839367135456, 0.06910591445524585, -0.0675784073008055, -0.1523727038945777, 0.03424620441386871, 0.3072331740210454, -0.30729627546811983, -0.2511149196405754, 0.10988880029816012, -0.2547095496362696, -0.174713978646182, 0.19524834839676536, -0.011480372889447168, 0.08712242207856792, 0.02015353369554787, 0.05604092198226488, -0.08291051083837044, -0.21470557461901935, 0.3503489837784207, 0.01306043524880696, 0.19056187413463538, 0.12701292927235816, 0.16172784365092716, 0.026538073438022173, 0.01865059870408114, -0.04140729469839822, -0.17268412831860283, 0.1277688541696548, 0.22644600387888425, 0.08425462124587009, 0.24178295418845885, -0.3997127632081339, -0.2250108851373873, 0.09232127144368309, 0.16751394112978948, 0.12397529283771291, -0.06856496440190257, -0.24216512122163267, 0.016666499735561734, -0.14425202337037207, -0.22465647918270956, -0.02535916358288942, 0.012180368550065341, 0.08308559088883075, -0.2996213006377785, 0.12302342066400204, 0.015439999466197509, 0.01236377251475598, -0.11075347578717452, -0.09819445463962796, 0.05382271919568831, 0.08992187527121243, 0.010050742276662, -0.013088594395385095, 0.04638697178046586, -0.161409427737288, -0.07218446008240183, 0.3964895347387276, -0.0570489123364854, -0.2763328423554247, 0.07711317953230305, -0.12023580659914648, -0.07381048403454549, 0.0923040011954127, 0.15677714644169266, 0.13915076920988434, -0.16415296360906778, 0.1197931993175933, -0.031016644922959986, 0.12312474781929543, 0.1142839745082187, 0.007260943816756039, 0.1782886190622142, 0.07851883917200295, 0.09117369844126656, 0.18311724629584755, -0.05918405419497779, -0.09884287494545181, -0.3822368356314572, -0.2277722402306443, -0.1472957384916795, 0.06076937237980239, -0.12702228454806822, -0.20751144989591205, 0.46808619932694867, 0.10921478581396073, 0.17285046005395777, 0.11396559220773986, 0.24761622881686146, 0.3188131437778021, 0.01627086866364786, 0.03194257261400873, 0.1779483836144209, 0.12774812406860292, 0.10603700399003697, -0.2293664013656477, 0.03424807757872975, 0.11101668767602832]
|
1,803.05364
|
Temporal Correlation of Interference in Vehicular Networks with
Shifted-Exponential Time Headways
|
We consider a one-dimensional vehicular network where the time headway (time
difference between successive vehicles as they pass a point on the roadway)
follows the shifted-exponential distribution. We show that neglecting the
impact of shift in the deployment model, which degenerates the distribution of
vehicles to a Poisson Point Process, overestimates the temporal correlation of
interference at the origin. The estimation error becomes large at high traffic
conditions and small time-lags.
|
cs.NI
|
we consider a onedimensional vehicular network where the time headway time difference between successive vehicles as they pass a point on the roadway follows the shiftedexponential distribution we show that neglecting the impact of shift in the deployment model which degenerates the distribution of vehicles to a poisson point process overestimates the temporal correlation of interference at the origin the estimation error becomes large at high traffic conditions and small timelags
|
[['we', 'consider', 'a', 'onedimensional', 'vehicular', 'network', 'where', 'the', 'time', 'headway', 'time', 'difference', 'between', 'successive', 'vehicles', 'as', 'they', 'pass', 'a', 'point', 'on', 'the', 'roadway', 'follows', 'the', 'shiftedexponential', 'distribution', 'we', 'show', 'that', 'neglecting', 'the', 'impact', 'of', 'shift', 'in', 'the', 'deployment', 'model', 'which', 'degenerates', 'the', 'distribution', 'of', 'vehicles', 'to', 'a', 'poisson', 'point', 'process', 'overestimates', 'the', 'temporal', 'correlation', 'of', 'interference', 'at', 'the', 'origin', 'the', 'estimation', 'error', 'becomes', 'large', 'at', 'high', 'traffic', 'conditions', 'and', 'small', 'timelags']]
|
[-0.20629485506298287, 0.09735793275758624, -0.08852711683139206, 0.0981631139835112, -0.010184882637778564, -0.11369472181291453, 0.1229282647038677, 0.37487748927835907, -0.28305110468396116, -0.27331702833596083, 0.08335143879022715, -0.2804875936359167, -0.11940463339643818, 0.12225930231423783, -0.08477594130007284, 0.0367573544383049, 0.07523458446376026, 0.032429380368973526, -0.0717076468065248, -0.18533045870717615, 0.3160608720433499, 0.04787525229954294, 0.3433695549677525, 0.06349509382354361, 0.13534861044692142, 0.020037026523745487, -0.015789940248110465, -0.012276671509191926, -0.07435823228328704, 0.032927216323358675, 0.2126079061409525, 0.08135976072267763, 0.28418511439646993, -0.43557233262940176, -0.2510535384794431, 0.13523801248520612, 0.1240634339362649, 0.06809693700467635, 0.01705192125103037, -0.2901298134720751, 0.07199703651879515, -0.1650596127778824, -0.12955426551135524, 0.05372206103056669, 0.018839942677212614, 0.07516960361972451, -0.29153871701232026, 0.057551735466612235, 0.012059699131974152, 0.03860521748595472, -0.006033421524002084, -0.06926785930991172, -0.026934280572459102, 0.19790907077092146, 0.07931151909246442, -0.01218552098476461, 0.15206730909579033, -0.12821957934980413, -0.05774709508405067, 0.40100631131125347, -0.05984223097828882, -0.17537144752485412, 0.14036037254679415, -0.1545934337590422, -0.1212472653016448, 0.14524910505861044, 0.23915598236822655, 0.055403897086424486, -0.1155650766832488, 0.01990799086883531, -0.00027872627334935327, 0.13999507835708624, 0.08166490329229938, 0.006318385772673147, 0.19012285631948284, 0.21594284709010805, 0.14808489072269626, 0.07702475502820952, -0.21239567878323473, -0.15323245534008104, -0.31846777174089635, -0.11625198977999389, -0.21509175677118555, 0.019873677496798338, -0.13322290464815784, -0.1589424233151866, 0.3647089172221188, 0.17422154288339828, 0.24608959119234766, 0.10416099884314463, 0.3304828020877072, 0.17603451657341793, 0.021984415953712803, 0.12500930985968028, 0.17689671850364122, 0.03989002591198576, 0.16633847148623318, -0.23223077323553817, 0.11522944795766048, 0.007255001808516681]
|
1,803.05365
|
The Hsu-Harn-Mu-Zhang-Zhu group key establishment protocol is insecure
|
A significant security vulnerability in a recently published group key
establishment protocol is described. This vulnerability allows a malicious
insider to fraudulently establish a group key with an innocent victim, with the
key chosen by the attacker. This shortcoming is sufficiently serious that the
protocol should not be used.
|
cs.CR
|
a significant security vulnerability in a recently published group key establishment protocol is described this vulnerability allows a malicious insider to fraudulently establish a group key with an innocent victim with the key chosen by the attacker this shortcoming is sufficiently serious that the protocol should not be used
|
[['a', 'significant', 'security', 'vulnerability', 'in', 'a', 'recently', 'published', 'group', 'key', 'establishment', 'protocol', 'is', 'described', 'this', 'vulnerability', 'allows', 'a', 'malicious', 'insider', 'to', 'fraudulently', 'establish', 'a', 'group', 'key', 'with', 'an', 'innocent', 'victim', 'with', 'the', 'key', 'chosen', 'by', 'the', 'attacker', 'this', 'shortcoming', 'is', 'sufficiently', 'serious', 'that', 'the', 'protocol', 'should', 'not', 'be', 'used']]
|
[-0.21336723264539614, 0.010799026070950882, -0.1318757957778871, 0.06218798415890584, -0.10436175953752051, -0.30145446917352575, 0.13385031698271632, 0.2995359608903527, -0.26329905772581697, -0.2892361618190383, 0.09878772800584557, -0.22269530897544124, -0.15445261164859403, 0.15212691148432592, -0.24991572182625532, 0.08589072577888146, -0.0012938946019858122, 0.03170810211061811, 0.07712614800645194, -0.29272769290643436, 0.3484092839838316, 0.12417425502402087, 0.30509828609259176, 0.08532346195230882, 0.03373566238830487, 0.025387270249969635, -0.007450308941770345, -0.011920628564742705, -0.07486478278663829, 0.09167114563751966, 0.3563171080313623, 0.1484760392922908, 0.44901282534313697, -0.3775993485469371, -0.21934946389713636, 0.16868823076947592, 0.14378283837383302, 0.1549876513890922, -0.10576204182386088, -0.3436740698525682, 0.13088053232058883, -0.3312270111249139, -0.15993737239235392, -0.0579486446804367, -0.03659274936459648, -0.011981854060043892, -0.20211535642738454, -0.05981307676362727, 0.025959629837113123, 0.04727604744645456, 0.060140368100595275, -0.011845026960751662, 0.021254000971869875, 0.21948746879934333, 0.05009831257727152, 0.06319909846934024, 0.14882719652572027, -0.04681751272679927, -0.14132420747773722, 0.37245892225473654, -0.02606953026649232, -0.1468189727359762, 0.11060814916466673, 0.007233699987409636, -0.16161555414631343, 0.1105578104131079, 0.14330480546535304, 0.02609686041250825, -0.1947455826254251, -0.016853963956085256, -0.08784928209691618, 0.27587849778744084, -0.011037737363949418, -0.004195239152371262, 0.16904825241848206, 0.16819228426902555, 0.10546583843339856, 0.0941584209673844, -0.03915712836897001, -0.07183037620658676, -0.2892889653642972, -0.16664004998165183, -0.1839777186202506, 0.1010768694932267, -0.05527541651584519, -0.10694968417131652, 0.3704715338535607, 0.21639008854981512, 0.13310378819005564, -0.024537160449350875, 0.3830731944181025, 0.0148554631935743, 0.13665386873375004, 0.1425060122370875, 0.20835957664530724, 0.05118505360345201, 0.08418600047783305, -0.11472302556891616, 0.29236570023931563, 0.02695110971884181]
|
1,803.05366
|
Imaginary part of Hall conductivity in tilted doped Weyl semimetal with
both broken time reversal and inversion symmetry
|
We consider a Weyl semimetal (WSM) with finite doping and tilt within a
continuum model Hamiltonian with both broken time reversal and inversion
symmetry. We calculate the absorptive part of the anomalous AC Hall
conductivity as a function of photon energy ($\Omega$) for both type I and type
II Weyl semimetal. For a given Weyl node, changing the sign of its chirality or
of its tilt changes the sign of its contribution to the absorptive Hall
conductivity with no change in magnitude. For a noncentrosymmetric system we
find that there are ranges of photon energies for which only the positive or
only the negative chirality node contributes to the imaginary (absorptive) part
of the Hall conductivity. There are also other photon energies where both
chirality contribute and there can be other ranges of $\Omega$ where there is
no absorption associated with the AC Hall conductivity in type I and regions
where it is instead constant for type II. We comment on implications for the
absorption of circular polarized light.
|
cond-mat.str-el cond-mat.mes-hall
|
we consider a weyl semimetal wsm with finite doping and tilt within a continuum model hamiltonian with both broken time reversal and inversion symmetry we calculate the absorptive part of the anomalous ac hall conductivity as a function of photon energy omega for both type i and type ii weyl semimetal for a given weyl node changing the sign of its chirality or of its tilt changes the sign of its contribution to the absorptive hall conductivity with no change in magnitude for a noncentrosymmetric system we find that there are ranges of photon energies for which only the positive or only the negative chirality node contributes to the imaginary absorptive part of the hall conductivity there are also other photon energies where both chirality contribute and there can be other ranges of omega where there is no absorption associated with the ac hall conductivity in type i and regions where it is instead constant for type ii we comment on implications for the absorption of circular polarized light
|
[['we', 'consider', 'a', 'weyl', 'semimetal', 'wsm', 'with', 'finite', 'doping', 'and', 'tilt', 'within', 'a', 'continuum', 'model', 'hamiltonian', 'with', 'both', 'broken', 'time', 'reversal', 'and', 'inversion', 'symmetry', 'we', 'calculate', 'the', 'absorptive', 'part', 'of', 'the', 'anomalous', 'ac', 'hall', 'conductivity', 'as', 'a', 'function', 'of', 'photon', 'energy', 'omega', 'for', 'both', 'type', 'i', 'and', 'type', 'ii', 'weyl', 'semimetal', 'for', 'a', 'given', 'weyl', 'node', 'changing', 'the', 'sign', 'of', 'its', 'chirality', 'or', 'of', 'its', 'tilt', 'changes', 'the', 'sign', 'of', 'its', 'contribution', 'to', 'the', 'absorptive', 'hall', 'conductivity', 'with', 'no', 'change', 'in', 'magnitude', 'for', 'a', 'noncentrosymmetric', 'system', 'we', 'find', 'that', 'there', 'are', 'ranges', 'of', 'photon', 'energies', 'for', 'which', 'only', 'the', 'positive', 'or', 'only', 'the', 'negative', 'chirality', 'node', 'contributes', 'to', 'the', 'imaginary', 'absorptive', 'part', 'of', 'the', 'hall', 'conductivity', 'there', 'are', 'also', 'other', 'photon', 'energies', 'where', 'both', 'chirality', 'contribute', 'and', 'there', 'can', 'be', 'other', 'ranges', 'of', 'omega', 'where', 'there', 'is', 'no', 'absorption', 'associated', 'with', 'the', 'ac', 'hall', 'conductivity', 'in', 'type', 'i', 'and', 'regions', 'where', 'it', 'is', 'instead', 'constant', 'for', 'type', 'ii', 'we', 'comment', 'on', 'implications', 'for', 'the', 'absorption', 'of', 'circular', 'polarized', 'light']]
|
[-0.17656396690083767, 0.18641201556610637, -0.004519341615464031, -0.022301865161600463, -0.10485612207847322, -0.21554838192577547, 0.07237451583747724, 0.39917266368865967, -0.2583212653524931, -0.2508908005420273, 0.047938199012578855, -0.31886865609716736, -0.11525353699503742, 0.147098963479539, 0.023333268955118468, -0.024391841774010072, -0.053035543553707515, 0.023566044981387504, -0.0767344361014069, -0.16825586132093515, 0.3338765844085513, -0.048847132695827786, 0.24632469434484003, 0.105771543229751, 0.054085189371215474, 0.0160788751810723, 0.027648446403620158, 0.06503156466222197, -0.08314695784560516, 0.022513797668956795, 0.21106255356464865, -0.06121920139291847, 0.16561623883141569, -0.38101971693910086, -0.15836850698409083, 0.11366377632855576, 0.10316565477691547, 0.107857317428832, -0.0811368720771293, -0.24729802084745034, 0.06502746685460409, -0.15439540965306248, -0.14529342423661573, -0.031077316284356032, 0.08025624115879719, -0.05876287531531994, -0.24354989473437946, 0.12039203850463578, 0.041962719734581794, 0.07267828451017656, -0.09669006320705759, -0.1427358793798757, -0.09577906430291133, 0.07910008327870151, 0.08633191205599737, 0.0038366530017552554, 0.12882314232583075, -0.1719756283791813, -0.1287816777279788, 0.4007275014696918, -0.05993588906699053, -0.1627355822962681, 0.12214301510289664, -0.20818203382370387, -0.08652581053389204, 0.1566491587164663, 0.12030917827657164, 0.07447866242400994, -0.0517565187717066, 0.11500739537492206, -0.02887229881106088, 0.14483440685576413, 0.05255685717049303, 0.07580359664348853, 0.2345942473094139, 0.1052355187278263, 0.07454448493373905, 0.11197658164217275, -0.13825279516863676, 0.0032177995656170614, -0.3507348034508835, -0.1884588608463135, -0.21351173477655155, 0.08401105019743361, -0.07074420768538553, -0.20443521521037675, 0.43135390997197504, 0.10719555769303053, 0.18836592919931652, -0.00758240024694214, 0.2616682741405255, 0.19620890954417072, 0.09641111732361364, 0.07646223229835548, 0.2722954084964458, 0.12757089477206013, 0.1562111722966711, -0.31856625464320537, 0.06209541736005326, 0.011470511687930519]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.