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.07067
|
Setting up a Reinforcement Learning Task with a Real-World Robot
|
Reinforcement learning is a promising approach to developing hard-to-engineer
adaptive solutions for complex and diverse robotic tasks. However, learning
with real-world robots is often unreliable and difficult, which resulted in
their low adoption in reinforcement learning research. This difficulty is
worsened by the lack of guidelines for setting up learning tasks with robots.
In this work, we develop a learning task with a UR5 robotic arm to bring to
light some key elements of a task setup and study their contributions to the
challenges with robots. We find that learning performance can be highly
sensitive to the setup, and thus oversights and omissions in setup details can
make effective learning, reproducibility, and fair comparison hard. Our study
suggests some mitigating steps to help future experimenters avoid difficulties
and pitfalls. We show that highly reliable and repeatable experiments can be
performed in our setup, indicating the possibility of reinforcement learning
research extensively based on real-world robots.
|
cs.LG cs.AI cs.RO stat.ML
|
reinforcement learning is a promising approach to developing hardtoengineer adaptive solutions for complex and diverse robotic tasks however learning with realworld robots is often unreliable and difficult which resulted in their low adoption in reinforcement learning research this difficulty is worsened by the lack of guidelines for setting up learning tasks with robots in this work we develop a learning task with a ur5 robotic arm to bring to light some key elements of a task setup and study their contributions to the challenges with robots we find that learning performance can be highly sensitive to the setup and thus oversights and omissions in setup details can make effective learning reproducibility and fair comparison hard our study suggests some mitigating steps to help future experimenters avoid difficulties and pitfalls we show that highly reliable and repeatable experiments can be performed in our setup indicating the possibility of reinforcement learning research extensively based on realworld robots
|
[['reinforcement', 'learning', 'is', 'a', 'promising', 'approach', 'to', 'developing', 'hardtoengineer', 'adaptive', 'solutions', 'for', 'complex', 'and', 'diverse', 'robotic', 'tasks', 'however', 'learning', 'with', 'realworld', 'robots', 'is', 'often', 'unreliable', 'and', 'difficult', 'which', 'resulted', 'in', 'their', 'low', 'adoption', 'in', 'reinforcement', 'learning', 'research', 'this', 'difficulty', 'is', 'worsened', 'by', 'the', 'lack', 'of', 'guidelines', 'for', 'setting', 'up', 'learning', 'tasks', 'with', 'robots', 'in', 'this', 'work', 'we', 'develop', 'a', 'learning', 'task', 'with', 'a', 'ur5', 'robotic', 'arm', 'to', 'bring', 'to', 'light', 'some', 'key', 'elements', 'of', 'a', 'task', 'setup', 'and', 'study', 'their', 'contributions', 'to', 'the', 'challenges', 'with', 'robots', 'we', 'find', 'that', 'learning', 'performance', 'can', 'be', 'highly', 'sensitive', 'to', 'the', 'setup', 'and', 'thus', 'oversights', 'and', 'omissions', 'in', 'setup', 'details', 'can', 'make', 'effective', 'learning', 'reproducibility', 'and', 'fair', 'comparison', 'hard', 'our', 'study', 'suggests', 'some', 'mitigating', 'steps', 'to', 'help', 'future', 'experimenters', 'avoid', 'difficulties', 'and', 'pitfalls', 'we', 'show', 'that', 'highly', 'reliable', 'and', 'repeatable', 'experiments', 'can', 'be', 'performed', 'in', 'our', 'setup', 'indicating', 'the', 'possibility', 'of', 'reinforcement', 'learning', 'research', 'extensively', 'based', 'on', 'realworld', 'robots']]
|
[-0.05675248080292299, 0.038377894970056205, -0.08618402002415583, 0.02219833987470196, -0.1848493050980418, -0.20231589100545866, 0.056559004232759114, 0.49300745799653717, -0.22794427127916028, -0.37390396945594656, 0.08835327385338144, -0.22079990441342454, -0.20978490356885066, 0.23420987360469706, -0.18722220993745928, 0.11272650320300615, 0.1585524248914769, -0.02429217664682149, -0.02388428694375053, -0.2635032726306613, 0.27595603558107873, 0.05687597011482077, 0.3138557947724574, 0.08169818558585044, 0.09072114230593206, -0.029260061999900847, -0.006687303923384904, -0.011097424022563092, -0.05933922432790519, 0.19313589158746136, 0.4174729530070606, 0.16711912993885963, 0.38309669377306454, -0.4271066559043217, -0.19446268287039808, 0.12407123666655805, 0.14526241691178315, 0.10638147056353726, -0.07142663006625416, -0.3280997291425025, 0.07792329486699884, -0.15941701688979112, -0.08994081876748665, -0.17201187432170603, -0.027038755394252285, -0.022796093388951232, -0.28074494587838067, -0.04719385274972422, 0.02421893907239201, 0.07868835935217945, -0.005631262820528506, -0.09179322308763958, 0.12194764677604492, 0.1692342838036598, 0.08582465076598327, 0.0363661470405709, 0.18020840635063587, -0.18628962923071118, -0.16453469487499783, 0.39359652205648554, 0.02172638609394576, -0.18304201483969537, 0.2398081912383945, -0.03474474564049538, -0.18280468292098928, 0.05961811960396635, 0.2321126846832453, 0.12808632905093814, -0.18673221950643007, -0.010107052683121186, 0.032087564794951444, 0.15379349137777343, 0.001408792450092733, -0.025792083890455498, 0.19331304580971068, 0.25781766855000676, 0.05400735386284431, 0.10622612983683825, -0.04060258142885982, -0.10691883875958186, -0.21519335829229516, -0.1252164983341029, -0.12899812062379795, -0.01108498734651835, -0.06908182766479017, -0.08130091517088729, 0.3222006122270212, 0.24922985049242807, 0.19846026650886958, 0.05819164302469195, 0.3684364227311952, 0.007271912706752804, 0.083853001681734, 0.09273985707028709, 0.2323564865959766, 0.013095623922425432, 0.1652830955602664, -0.21249192511789838, 0.10795487514387078, -0.07085650557555355]
|
1,803.07068
|
D$^2$: Decentralized Training over Decentralized Data
|
While training a machine learning model using multiple workers, each of which
collects data from their own data sources, it would be most useful when the
data collected from different workers can be {\em unique} and {\em different}.
Ironically, recent analysis of decentralized parallel stochastic gradient
descent (D-PSGD) relies on the assumption that the data hosted on different
workers are {\em not too different}. In this paper, we ask the question: {\em
Can we design a decentralized parallel stochastic gradient descent algorithm
that is less sensitive to the data variance across workers?} In this paper, we
present D$^2$, a novel decentralized parallel stochastic gradient descent
algorithm designed for large data variance \xr{among workers} (imprecisely,
"decentralized" data). The core of D$^2$ is a variance blackuction extension of
the standard D-PSGD algorithm, which improves the convergence rate from
$O\left({\sigma \over \sqrt{nT}} + {(n\zeta^2)^{\frac{1}{3}} \over
T^{2/3}}\right)$ to $O\left({\sigma \over \sqrt{nT}}\right)$ where $\zeta^{2}$
denotes the variance among data on different workers. As a result, D$^2$ is
robust to data variance among workers. We empirically evaluated D$^2$ on image
classification tasks where each worker has access to only the data of a limited
set of labels, and find that D$^2$ significantly outperforms D-PSGD.
|
cs.DC cs.LG stat.ML
|
while training a machine learning model using multiple workers each of which collects data from their own data sources it would be most useful when the data collected from different workers can be em unique and em different ironically recent analysis of decentralized parallel stochastic gradient descent dpsgd relies on the assumption that the data hosted on different workers are em not too different in this paper we ask the question em can we design a decentralized parallel stochastic gradient descent algorithm that is less sensitive to the data variance across workers in this paper we present d2 a novel decentralized parallel stochastic gradient descent algorithm designed for large data variance xramong workers imprecisely decentralized data the core of d2 is a variance blackuction extension of the standard dpsgd algorithm which improves the convergence rate from oleftsigma over sqrtnt nzeta2frac13 over t23right to oleftsigma over sqrtntright where zeta2 denotes the variance among data on different workers as a result d2 is robust to data variance among workers we empirically evaluated d2 on image classification tasks where each worker has access to only the data of a limited set of labels and find that d2 significantly outperforms dpsgd
|
[['while', 'training', 'a', 'machine', 'learning', 'model', 'using', 'multiple', 'workers', 'each', 'of', 'which', 'collects', 'data', 'from', 'their', 'own', 'data', 'sources', 'it', 'would', 'be', 'most', 'useful', 'when', 'the', 'data', 'collected', 'from', 'different', 'workers', 'can', 'be', 'em', 'unique', 'and', 'em', 'different', 'ironically', 'recent', 'analysis', 'of', 'decentralized', 'parallel', 'stochastic', 'gradient', 'descent', 'dpsgd', 'relies', 'on', 'the', 'assumption', 'that', 'the', 'data', 'hosted', 'on', 'different', 'workers', 'are', 'em', 'not', 'too', 'different', 'in', 'this', 'paper', 'we', 'ask', 'the', 'question', 'em', 'can', 'we', 'design', 'a', 'decentralized', 'parallel', 'stochastic', 'gradient', 'descent', 'algorithm', 'that', 'is', 'less', 'sensitive', 'to', 'the', 'data', 'variance', 'across', 'workers', 'in', 'this', 'paper', 'we', 'present', 'd2', 'a', 'novel', 'decentralized', 'parallel', 'stochastic', 'gradient', 'descent', 'algorithm', 'designed', 'for', 'large', 'data', 'variance', 'xramong', 'workers', 'imprecisely', 'decentralized', 'data', 'the', 'core', 'of', 'd2', 'is', 'a', 'variance', 'blackuction', 'extension', 'of', 'the', 'standard', 'dpsgd', 'algorithm', 'which', 'improves', 'the', 'convergence', 'rate', 'from', 'oleftsigma', 'over', 'sqrtnt', 'nzeta2frac13', 'over', 't23right', 'to', 'oleftsigma', 'over', 'sqrtntright', 'where', 'zeta2', 'denotes', 'the', 'variance', 'among', 'data', 'on', 'different', 'workers', 'as', 'a', 'result', 'd2', 'is', 'robust', 'to', 'data', 'variance', 'among', 'workers', 'we', 'empirically', 'evaluated', 'd2', 'on', 'image', 'classification', 'tasks', 'where', 'each', 'worker', 'has', 'access', 'to', 'only', 'the', 'data', 'of', 'a', 'limited', 'set', 'of', 'labels', 'and', 'find', 'that', 'd2', 'significantly', 'outperforms', 'dpsgd']]
|
[-0.09616784475572211, 0.02868899175358054, -0.07580979109349611, 0.04659623019152174, -0.12741571341053043, -0.1969590713747924, 0.0844398912023998, 0.40461971673526265, -0.2974994615878371, -0.32110572176936425, 0.10601237789378501, -0.285631775581523, -0.10784258777520767, 0.19374796525991864, -0.14994134274924076, 0.035430148697923866, 0.10011627312296217, 0.04652211723089414, 0.005073401928683253, -0.3334416066051314, 0.25588670679441605, 0.05698320451192558, 0.343062932784424, -0.04574653704552666, 0.1308283024381748, -0.0062732416425684565, -0.034664202480895544, 0.030555423856467794, -0.05719644217441735, 0.1357981055411265, 0.2948559363127539, 0.22694544546600234, 0.3484992970957568, -0.4062505899732442, -0.13391685705435905, 0.16332565340409547, 0.17458953212802666, 0.10586273969690266, -0.02577754951229221, -0.27101193156681563, 0.10363048816369357, -0.12286863330457555, 0.018796352252952363, -0.09467583365346256, -0.03674717064897873, 0.028956052317516877, -0.31967189832541504, 0.06455480799961247, 0.021661949016791034, 0.07678752867367095, -0.03877592482175188, -0.14062992563030044, 0.03419517849719054, 0.11176765998534392, 0.0701651868036654, 0.04892264570256597, 0.14876188217221123, -0.10361189773799484, -0.13580681303957184, 0.3398540316982881, -0.06071802253932937, -0.1818648279595532, 0.17504560766055396, -0.06650510605939321, -0.18398225050615638, 0.10257051365548059, 0.2404466106675835, 0.15299127786420286, -0.18051414688180606, 0.0658795341647132, -0.07148262989266138, 0.16489120578197272, 0.012472311913427946, -0.03401694451826379, 0.10453373390298924, 0.15554958414408918, 0.12053078748806575, 0.10004782807449565, -0.08822968576201483, -0.11184374102097201, -0.23469116142736504, -0.10902913586775723, -0.23913568540623314, 0.011927191647900097, -0.1366383019024445, -0.11715322876759608, 0.3578864108924264, 0.21146094123342712, 0.21635769264968602, 0.10350873528866367, 0.36431005549077927, 0.04587343430619895, 0.09185154936889088, 0.17121237934272932, 0.14603400715675793, 0.022454294447149886, 0.13154325401594275, -0.19531739744186205, 0.12048932378927833, -0.0014549055773960917]
|
1,803.07069
|
Testing normality via a distributional fixed point property in the Stein
characterization
|
We propose two families of tests for the classical goodness-of-fit problem to
univariate normality. The new procedures are based on $L^2$-distances of the
empirical zero-bias transformation to the normal distribution or the empirical
distribution of the data, respectively. Weak convergence results are derived
under the null hypothesis, under fixed alternatives as well as under contiguous
alternatives. Empirical critical values are provided and a comparative
finite-sample power study shows the competitiveness to classical procedures.
|
stat.ME
|
we propose two families of tests for the classical goodnessoffit problem to univariate normality the new procedures are based on l2distances of the empirical zerobias transformation to the normal distribution or the empirical distribution of the data respectively weak convergence results are derived under the null hypothesis under fixed alternatives as well as under contiguous alternatives empirical critical values are provided and a comparative finitesample power study shows the competitiveness to classical procedures
|
[['we', 'propose', 'two', 'families', 'of', 'tests', 'for', 'the', 'classical', 'goodnessoffit', 'problem', 'to', 'univariate', 'normality', 'the', 'new', 'procedures', 'are', 'based', 'on', 'l2distances', 'of', 'the', 'empirical', 'zerobias', 'transformation', 'to', 'the', 'normal', 'distribution', 'or', 'the', 'empirical', 'distribution', 'of', 'the', 'data', 'respectively', 'weak', 'convergence', 'results', 'are', 'derived', 'under', 'the', 'null', 'hypothesis', 'under', 'fixed', 'alternatives', 'as', 'well', 'as', 'under', 'contiguous', 'alternatives', 'empirical', 'critical', 'values', 'are', 'provided', 'and', 'a', 'comparative', 'finitesample', 'power', 'study', 'shows', 'the', 'competitiveness', 'to', 'classical', 'procedures']]
|
[-0.07351973378546026, -0.02314911890545324, -0.13764782656902727, 0.13861246767999247, -0.03831114765728683, -0.13797928202157356, 0.09469814719759846, 0.3903735584183915, -0.22836425198890029, -0.2787060613476046, 0.12239351469308954, -0.27957391983842195, -0.11219143060240129, 0.2493229116829852, -0.0763463430259734, 0.16013566079116523, 0.037790006476339615, 0.0024449056244059786, -0.11115850062964305, -0.3090002329586303, 0.32066689556694195, 0.0727848288768979, 0.4087846310018268, -0.039542321127692674, 0.03696763770788755, -0.012651544051525528, -0.01627340581114978, 0.027231018129123808, -0.14668528015776347, 0.07941765754566567, 0.1848658525499783, 0.19220737922196723, 0.31284914206560344, -0.3632742607430236, -0.14554726379630092, 0.13272712359281436, 0.09012782402186693, -0.0015286113556525478, -0.030891688822845174, -0.2757311935396227, 0.11500553976846477, -0.09857506914804243, -0.1198215343900127, -0.1297341268637205, -0.07457577957682414, 0.1023504135218028, -0.36542955389220827, 0.1423522992354514, 0.061096383834398055, 0.13261660330048572, -0.0437029086576443, -0.18651355902524028, 0.05984370667193953, 0.08278839171813061, 0.1673980743292566, -0.09878576586775686, 0.11820113664127771, -0.07218370025288569, -0.12928456180307962, 0.317454948402584, -0.06955112941477014, -0.21609080679816742, 0.20591371639134132, -0.11348560846678607, -0.13657751159219403, 0.03212380510027686, 0.12416650462028099, 0.08607700067151287, -0.15863412979684055, 0.06273420163899124, -0.06536297967070587, 0.07641914464239899, 0.03352932580300186, -0.014409420348397673, 0.18361388484960142, 0.13928241762396407, 0.07473086633349527, 0.17422454428144615, -0.13063303731726356, -0.1227691733941742, -0.3545144962095847, -0.12662288209755126, -0.1677203423005516, 0.015681927806812608, -0.14875931268512457, -0.21955782880572833, 0.37945605411309086, 0.15084105791214675, 0.16219107296368848, 0.1548398328205086, 0.281409802808337, 0.108602113827221, 0.0033567548946362652, 0.05758546281299771, 0.22148759943777568, 0.13851726260546543, -0.005563780518682444, -0.16288349216752876, 0.11682719545525001, 0.02860764861234451]
|
1,803.0707
|
An entropy current in superspace
|
We construct an entropy current using a supersymmetric formulation of the
low-energy effective action for the Schwinger-Keldysh generating functional. We
define an entropy current quantum mechanically by coupling it to an external
source. It is given by the bottom component of an entropy current superfield
which is conserved in superspace, but when restricted to real space satisfies a
non-conservation law. Our analysis is valid in the probe limit which allows us
to fully treat quantum fluctuations.
|
hep-th cond-mat.stat-mech
|
we construct an entropy current using a supersymmetric formulation of the lowenergy effective action for the schwingerkeldysh generating functional we define an entropy current quantum mechanically by coupling it to an external source it is given by the bottom component of an entropy current superfield which is conserved in superspace but when restricted to real space satisfies a nonconservation law our analysis is valid in the probe limit which allows us to fully treat quantum fluctuations
|
[['we', 'construct', 'an', 'entropy', 'current', 'using', 'a', 'supersymmetric', 'formulation', 'of', 'the', 'lowenergy', 'effective', 'action', 'for', 'the', 'schwingerkeldysh', 'generating', 'functional', 'we', 'define', 'an', 'entropy', 'current', 'quantum', 'mechanically', 'by', 'coupling', 'it', 'to', 'an', 'external', 'source', 'it', 'is', 'given', 'by', 'the', 'bottom', 'component', 'of', 'an', 'entropy', 'current', 'superfield', 'which', 'is', 'conserved', 'in', 'superspace', 'but', 'when', 'restricted', 'to', 'real', 'space', 'satisfies', 'a', 'nonconservation', 'law', 'our', 'analysis', 'is', 'valid', 'in', 'the', 'probe', 'limit', 'which', 'allows', 'us', 'to', 'fully', 'treat', 'quantum', 'fluctuations']]
|
[-0.11309590475866571, 0.17040873720007335, -0.09840449130799818, 0.07627359331481305, -0.08079940084318973, -0.1354951574589665, 0.005836974896833692, 0.2761950352026983, -0.27229821088870887, -0.2524611229830618, 0.03959478227740252, -0.28900771121525876, -0.1045782160761423, 0.15607434737888215, -0.06157959576720666, 0.05057091702167925, -0.0156815125803022, 0.07587162720186538, -0.03174482872188827, -0.20415626773855797, 0.31024093686995147, 0.05176997610894767, 0.29349943991799493, 0.07877183931659122, 0.1479760151613798, 0.04373507739020217, 0.028175351969701678, 0.023884138980448416, -0.10608068906922678, 0.1278319861494789, 0.21854401331725776, 0.0959459266986845, 0.17453754493525545, -0.42722669143327757, -0.2110832839910137, 0.08311797652736698, 0.12725634876589634, 0.15980635084346623, 0.0019865532062555615, -0.2665853080780883, 0.050635785538409105, -0.2060253622598554, -0.15625502912964867, -0.1766630449136229, 0.037032479359033074, -0.12427535200319988, -0.2945969115795666, 0.07204986565959284, 0.018578041920830544, 0.0220665678038801, -0.06124558968631869, 0.012495198449438536, -0.015348075420326112, 0.1094846134460807, 0.04131007817341015, 0.09281871908560309, 0.1864029505584193, -0.14443639747332782, -0.09593527528187751, 0.35348734039029006, -0.10087570166337843, -0.2808103069515997, 0.12422527982485726, -0.08882864152914599, -0.15939960305235887, 0.07577988113457411, 0.06733203756524936, 0.15196641322769497, -0.21757772943333534, 0.16531000002042243, -0.007488318063367747, 0.18533651009171367, 0.01472404378613359, 0.003884600181328623, 0.24132040106633212, 0.11888803798693086, 0.11065636402437169, 0.1770598287632885, -0.04264294036271933, -0.14785558884767325, -0.39891934347657587, -0.1940141778782402, -0.1922280778556964, 0.11986211099275879, -0.06788562319707125, -0.19529601927282975, 0.38066838854482693, 0.1803965490605486, 0.1524419336469452, 0.06339489663399658, 0.29291803292672786, 0.2198195641838921, 0.08713936072921283, 0.06560993762564306, 0.2317125856521, 0.1837789514316491, 0.06471361504181435, -0.2356045451015234, -0.03627231960969144, 0.10224761441349983]
|
1,803.07071
|
The degree-diameter problem for circulant graphs of degrees 10 and 11 -
extended version
|
This paper considers the degree-diameter problem for undirected circulant
graphs. For degrees 10 and 11 newly discovered families of circulant graphs of
arbitrary diameter are presented which are largest known and are conjectured to
be extremal. They are also the largest-known Abelian Cayley graphs of these
degrees. For each such family the order of every graph in the family is defined
by a quintic polynomial function of the diameter which is specific to the
family. The elements of the generating set for each graph are similarly defined
by a set of polynomials in the diameter. The existence of the graphs in the
degree 10 families has been proved for all diameters. These graphs are
consistent with a conjecture on the order of extremal Abelian Cayley and
circulant graphs of any degree and diameter.
This is the extended version of the paper, including the proof steps for
degree 10 graphs covering all diameter classes and an appendix listing
additional tables of generating sets.
|
math.CO
|
this paper considers the degreediameter problem for undirected circulant graphs for degrees 10 and 11 newly discovered families of circulant graphs of arbitrary diameter are presented which are largest known and are conjectured to be extremal they are also the largestknown abelian cayley graphs of these degrees for each such family the order of every graph in the family is defined by a quintic polynomial function of the diameter which is specific to the family the elements of the generating set for each graph are similarly defined by a set of polynomials in the diameter the existence of the graphs in the degree 10 families has been proved for all diameters these graphs are consistent with a conjecture on the order of extremal abelian cayley and circulant graphs of any degree and diameter this is the extended version of the paper including the proof steps for degree 10 graphs covering all diameter classes and an appendix listing additional tables of generating sets
|
[['this', 'paper', 'considers', 'the', 'degreediameter', 'problem', 'for', 'undirected', 'circulant', 'graphs', 'for', 'degrees', '10', 'and', '11', 'newly', 'discovered', 'families', 'of', 'circulant', 'graphs', 'of', 'arbitrary', 'diameter', 'are', 'presented', 'which', 'are', 'largest', 'known', 'and', 'are', 'conjectured', 'to', 'be', 'extremal', 'they', 'are', 'also', 'the', 'largestknown', 'abelian', 'cayley', 'graphs', 'of', 'these', 'degrees', 'for', 'each', 'such', 'family', 'the', 'order', 'of', 'every', 'graph', 'in', 'the', 'family', 'is', 'defined', 'by', 'a', 'quintic', 'polynomial', 'function', 'of', 'the', 'diameter', 'which', 'is', 'specific', 'to', 'the', 'family', 'the', 'elements', 'of', 'the', 'generating', 'set', 'for', 'each', 'graph', 'are', 'similarly', 'defined', 'by', 'a', 'set', 'of', 'polynomials', 'in', 'the', 'diameter', 'the', 'existence', 'of', 'the', 'graphs', 'in', 'the', 'degree', '10', 'families', 'has', 'been', 'proved', 'for', 'all', 'diameters', 'these', 'graphs', 'are', 'consistent', 'with', 'a', 'conjecture', 'on', 'the', 'order', 'of', 'extremal', 'abelian', 'cayley', 'and', 'circulant', 'graphs', 'of', 'any', 'degree', 'and', 'diameter', 'this', 'is', 'the', 'extended', 'version', 'of', 'the', 'paper', 'including', 'the', 'proof', 'steps', 'for', 'degree', '10', 'graphs', 'covering', 'all', 'diameter', 'classes', 'and', 'an', 'appendix', 'listing', 'additional', 'tables', 'of', 'generating', 'sets']]
|
[-0.17220528783589045, 0.1344824181125761, 0.02430824520101088, 0.03071275170421031, -0.0790775984624019, -0.08594162748571231, -0.03915796578595681, 0.3698652251941725, -0.268730450253818, -0.35473306138091576, 0.14962425200132687, -0.304611170894368, -0.1311099382763821, 0.17640274927390287, -0.07793596504915574, 0.05294212828773892, 0.06817357210292024, 0.09763853778912229, -0.01123762881941515, -0.32446318036285143, 0.34829831691979435, -0.019538275498364652, 0.151928351226014, 0.07183599069436884, 0.08700681323914425, 0.0028387729359808035, -0.018622868677011187, 0.07043261915699851, -0.16598811499074517, 0.1567840979294273, 0.247722466470477, 0.12032267341089452, 0.18299181723492855, -0.30306424354604355, -0.17357869013733238, 0.211140957499727, 0.09676542103012896, 0.07918849547454358, 0.02258976337410255, -0.2244655310772128, 0.13625463871111781, -0.12702467210215923, -0.166304951890875, -0.020216046504225142, 0.09324175053166214, 0.07475818743963974, -0.26321009866118156, -0.027562574344804303, 0.11723960566721996, 0.09054176778943272, 0.04512886289414597, -0.18819809501400644, -0.019636259888593823, 0.10130855000595221, -0.0587794052202671, 0.0013350321222906528, -0.006963727336669028, -0.07158659436444965, -0.17533609868021485, 0.3466769520700215, 0.03695329997590194, -0.1769152006354206, 0.11091452227870685, -0.1171738054742169, -0.1863324309392653, 0.12829881141205196, 0.15181603991811204, 0.17957049376701484, -0.12673015159450657, 0.12423367459169352, -0.12304790297187633, 0.1250847890735922, 0.17135294131147935, 0.027132111436670055, 0.1442867116366299, 0.11529661900716724, 0.10202796723670471, 0.20152797407010767, -0.00909694288249897, -0.046002722958461466, -0.31104256514089634, -0.13696919574752242, -0.20923287672950938, 0.06407294357021959, -0.20542208935806214, -0.20973397859644075, 0.4779329521130331, 0.05985153430462916, 0.15967948201997495, 0.13394221938967196, 0.1686813404685268, 0.045796072103483715, 0.09188820813603191, 0.15262971627844138, 0.15235281621123323, 0.2114745304841687, -0.03336264967906827, -0.09924479132888388, 0.0669032901587682, 0.14816090451287373]
|
1,803.07072
|
Towards resolution of anisotropic cosmological singularity in infinite
derivative gravity
|
In this paper, we will show that the equations of motion of the quadratic in
curvature, ghost free, infinite derivative theory of gravity will not permit an
anisotropic collapse of a homogeneous Universe for a Kasner-type vacuum
solution.
|
gr-qc astro-ph.CO hep-th
|
in this paper we will show that the equations of motion of the quadratic in curvature ghost free infinite derivative theory of gravity will not permit an anisotropic collapse of a homogeneous universe for a kasnertype vacuum solution
|
[['in', 'this', 'paper', 'we', 'will', 'show', 'that', 'the', 'equations', 'of', 'motion', 'of', 'the', 'quadratic', 'in', 'curvature', 'ghost', 'free', 'infinite', 'derivative', 'theory', 'of', 'gravity', 'will', 'not', 'permit', 'an', 'anisotropic', 'collapse', 'of', 'a', 'homogeneous', 'universe', 'for', 'a', 'kasnertype', 'vacuum', 'solution']]
|
[-0.19409140315838158, 0.16594420105416488, -0.1534590781145533, 0.0647551701741146, -0.13189811759481304, -0.05606985490426029, -0.09505955586945147, 0.29893993022606563, -0.24322221175105752, -0.20052596456738875, 0.08272043974016254, -0.22861079053070985, -0.16175092158741072, 0.1361716798702745, -0.07187612935606587, -0.0005023920001756204, 0.03832404222339392, 0.09156857514263768, -0.09046361643796492, -0.273911055569586, 0.3835894764817663, 0.034908983341761325, 0.19450526645309046, 0.04570125533561958, 0.15223623181105053, -0.048809413773644915, 0.006353277541500957, 0.10382957459966603, -0.21461616300362757, 0.07863030477279895, 0.20988011156748, 0.08018441914923881, 0.29260739272362307, -0.4424718418403676, -0.23575493448266857, 0.12981196436540862, 0.17147671544042073, 0.18163551047052207, -0.06768235447816551, -0.23296553401374503, 0.03949597974516157, -0.1859417957694907, -0.2352718927309309, -0.058317276600160096, -0.016992180510178992, -0.03685970746568943, -0.24069961967976078, 0.1349483700959306, 0.054547199023593416, -0.03998756450355837, -0.17887311992480567, -0.017134747860070906, 0.00886580605353964, 0.010304181027765336, 0.044469298151517775, -0.01160207089330805, 0.04246387140531289, -0.19345105541747457, -0.07913722362565367, 0.3925977404180326, -0.19429006008431315, -0.26060487707390595, 0.09957598559068222, -0.19012584380413355, -0.12556785599965797, 0.1291280145671025, 0.13923001568764448, 0.1731223939476829, -0.17091193952058492, 0.18545477923103854, 0.003883864687706687, 0.13588381710609324, 0.10529684231273438, -0.005410049662092014, 0.2569246237215243, 0.07640611257796225, 0.1074876326234325, 0.127563408673986, 0.010582230544011844, -0.09456394759840087, -0.44331040826479073, -0.23615159856547652, -0.15315056352042838, 0.1238397598717711, -0.13002965480432307, -0.28498005278800664, 0.32501362425912367, 0.13924060957996467, 0.051676987474294084, 0.052578497861855124, 0.23183050991869286, 0.08612469252885173, 0.018995504936595495, 0.05302064973664911, 0.28643919360872944, 0.10532671476003568, 0.1354000796502652, -0.23955286161876038, -0.07666659193407548, 0.07869022866514952]
|
1,803.07073
|
On recovery of sequences from subsequences: the case of non-periodic
spectrum gaps
|
The paper investigates recoverability of sequences from their periodic
subsequences and offers some modification of the approach suggested in papers
arXiv:1605.00414 and arXiv:1803.02233. It is shown that there exists a class of
sequences that is everywhere dense in the class of all square-summable
sequences and such that its members can be recovered from their periodic
subsequences. This recoverability is associated with certain spectrum
degeneracy of a new kind.
|
cs.IT math.IT
|
the paper investigates recoverability of sequences from their periodic subsequences and offers some modification of the approach suggested in papers arxiv160500414 and arxiv180302233 it is shown that there exists a class of sequences that is everywhere dense in the class of all squaresummable sequences and such that its members can be recovered from their periodic subsequences this recoverability is associated with certain spectrum degeneracy of a new kind
|
[['the', 'paper', 'investigates', 'recoverability', 'of', 'sequences', 'from', 'their', 'periodic', 'subsequences', 'and', 'offers', 'some', 'modification', 'of', 'the', 'approach', 'suggested', 'in', 'papers', 'arxiv160500414', 'and', 'arxiv180302233', 'it', 'is', 'shown', 'that', 'there', 'exists', 'a', 'class', 'of', 'sequences', 'that', 'is', 'everywhere', 'dense', 'in', 'the', 'class', 'of', 'all', 'squaresummable', 'sequences', 'and', 'such', 'that', 'its', 'members', 'can', 'be', 'recovered', 'from', 'their', 'periodic', 'subsequences', 'this', 'recoverability', 'is', 'associated', 'with', 'certain', 'spectrum', 'degeneracy', 'of', 'a', 'new', 'kind']]
|
[-0.1778163030782404, 0.11338444158547756, -0.09147360926550446, 0.053834853916090324, -0.03880385675636882, -0.07082048586964833, 0.045580850033950286, 0.3875002973346096, -0.3451339683185021, -0.24717051417312838, 0.12474428882441399, -0.2860767494774226, -0.21881376834812039, 0.21434952292563111, -0.12523314375853675, 0.061066499416483566, 0.11456420137123628, 0.08284813222108466, -0.04791409600257986, -0.23733016340570015, 0.35865605546330864, -0.014308201769987742, 0.22543443051152723, -0.0076485706253372355, 0.07170467461092454, -0.03746100894711686, -0.03747742901781969, 0.02990563456533533, -0.11833372645626448, 0.13375566000909064, 0.2147778090033116, 0.19281550547616047, 0.28972741292620247, -0.3089769353074106, -0.19151668941997219, 0.1780975031610014, 0.13477320964871484, 0.08589056709950621, -0.08707824996390352, -0.2339952497489073, 0.17842854249509843, -0.12890167345264644, -0.1293104333153954, -0.07970535781968272, 0.043378579768944873, 0.10258678115452781, -0.28560377516304003, 0.059870099147894616, 0.13532854334423036, 0.03984358480595278, -0.048996080254613786, -0.07589226447497353, -0.0006126699630509723, 0.1629933472652214, 0.1101669619692433, 0.03545899871934318, 0.020384463418105788, -0.07459459646788398, -0.07710657447971629, 0.4048873742647243, -0.038326105512114184, -0.1855882816581112, 0.2139629524934924, -0.14219914687176546, -0.18080657003729633, 0.1632591179769599, 0.07628522124705893, 0.12534216114065863, -0.15725999082805533, 0.10137339446880629, -0.09080260430434436, 0.1613674662781484, 0.13067448101091114, 0.09858750798175055, 0.22411133449129533, 0.10438889582556757, 0.10129724836654284, 0.1611941403508271, -0.04295124733118538, -0.04663647325342578, -0.279975958620057, -0.1270864189771766, -0.20219756321537055, 0.05500786998450304, -0.05351477061953064, -0.21240401108683948, 0.4208625159931905, 0.11446080002298747, 0.17283474607393146, 0.08822152633784396, 0.1791271993830433, 0.09515500093711483, 0.06062791037027526, 0.05330356455295149, 0.15636772418502282, 0.1107143497898836, 0.053543137344108385, -0.15704571224297537, 0.08195542118681426, 0.07187733091555085]
|
1,803.07074
|
On Time-Varying Amplitude HGARCH Mode
|
The HGARCH model allows long-memory impact in volatilities. A new HGARCH
model with time-varying amplitude is considered in this paper. We show the
stability of the model as well. A score test is introduced to check the
time-varying behavior in amplitude. Some value-at-risk tests are applied to
evaluate the forecastings. Simulations are provided which provide further
support to the proposed model. We have also have shown the competative
performance of our model in forecasting, by compairing it with HGARH and
FIGARCH models for some period of SP500 indices.
|
math.ST stat.TH
|
the hgarch model allows longmemory impact in volatilities a new hgarch model with timevarying amplitude is considered in this paper we show the stability of the model as well a score test is introduced to check the timevarying behavior in amplitude some valueatrisk tests are applied to evaluate the forecastings simulations are provided which provide further support to the proposed model we have also have shown the competative performance of our model in forecasting by compairing it with hgarh and figarch models for some period of sp500 indices
|
[['the', 'hgarch', 'model', 'allows', 'longmemory', 'impact', 'in', 'volatilities', 'a', 'new', 'hgarch', 'model', 'with', 'timevarying', 'amplitude', 'is', 'considered', 'in', 'this', 'paper', 'we', 'show', 'the', 'stability', 'of', 'the', 'model', 'as', 'well', 'a', 'score', 'test', 'is', 'introduced', 'to', 'check', 'the', 'timevarying', 'behavior', 'in', 'amplitude', 'some', 'valueatrisk', 'tests', 'are', 'applied', 'to', 'evaluate', 'the', 'forecastings', 'simulations', 'are', 'provided', 'which', 'provide', 'further', 'support', 'to', 'the', 'proposed', 'model', 'we', 'have', 'also', 'have', 'shown', 'the', 'competative', 'performance', 'of', 'our', 'model', 'in', 'forecasting', 'by', 'compairing', 'it', 'with', 'hgarh', 'and', 'figarch', 'models', 'for', 'some', 'period', 'of', 'sp500', 'indices']]
|
[-0.05988054180080525, 0.05140040106162792, -0.11527189231909267, 0.09396342063896222, -0.030352482822064947, -0.13673147738615915, 0.020510110920351907, 0.40967955163157566, -0.21297532111042883, -0.3154556326477266, 0.1396831979736595, -0.2435648080627732, -0.20627899745070352, 0.2225258919125048, -0.08464380728489743, 0.10230799507713173, 0.04081503758434116, 0.04487218782511574, 0.008744343149861911, -0.3017718102555813, 0.23944089853590944, 0.1070870476229707, 0.2927821844975214, 0.04555564416322585, 0.05340231708023788, -0.05972127034896758, -0.05148098244872682, 0.03455693685881248, -0.11779238220599549, 0.07280371450569208, 0.19562646715033824, 0.135741895888137, 0.28208659016867965, -0.37918827251145026, -0.2633058397758116, 0.10444177746227602, 0.06880816152864476, 0.05737201707500101, -0.011427804850405308, -0.2840907032169947, 0.07803234828795057, -0.23695888346424554, -0.1141059002555089, -0.1394574576080209, 0.0014411567301466698, 0.07714396202652829, -0.3471233376824274, 0.0797761398819758, 0.02857958433564707, 0.03551651191011798, -0.08987560839372369, -0.10139474900802825, -0.004758855305248644, 0.11648526231377818, 0.12946594482509238, -0.02940238538061882, 0.03378107674170013, -0.08813991048293424, -0.153762297798516, 0.36615063068343373, -0.1006949355509189, -0.26017758186633994, 0.15756714980049832, -0.12268862871328233, -0.13298535964837888, 0.02671719077270387, 0.227999344683911, 0.06262305487006216, -0.14558355095682712, 0.045683755561363, -0.034399052390476643, 0.1564439440418671, 0.013276204421389394, -0.02925364420999114, 0.1694838671927999, 0.21177892241536117, 0.005519046990496174, 0.17715154495090246, -0.1277409062448253, -0.11115626932871414, -0.2918504548327225, -0.11290938851264555, -0.10988074789823192, -0.03830036126281612, -0.09718541637408723, -0.16398203616114276, 0.4579317903191578, 0.26449204801877096, 0.19302146327568265, 0.1093372169146655, 0.276982676797183, 0.15594549290267978, 0.026998598394928238, 0.06743867114958603, 0.24694894458999198, 0.09585678836660141, 0.08453777586904968, -0.17704531614861746, 0.1378967938092878, 0.019668916768462556]
|
1,803.07075
|
Dynamic magneto-optic coupling in a ferromagnetic nematic liquid crystal
|
Hydrodynamics of complex fuids with multiple order parameters is governed by
a set of dynamic equations with many material constants, of which only some are
easily measurable. We present a unique example of a dynamic magneto-optic
coupling in a ferromagnetic nematic liquid, in which long-range orientational
order of liquid crystalline molecules is accompanied by long-range magnetic
order of magnetic nanoplatelets. We investigate the dynamics of the
magneto-optic response experimentally and theoretically and find out that it is
significantly affected by the dissipative dynamic cross-coupling between the
nematic and magnetic order parameters. The cross-coupling coefficient
determined by fitting the experimental results with a macroscopic theory is of
the same order of magnitude as the dissipative coefficient (rotational
viscosity) that governs the reorientation of pure liquid crystals.
|
cond-mat.soft
|
hydrodynamics of complex fuids with multiple order parameters is governed by a set of dynamic equations with many material constants of which only some are easily measurable we present a unique example of a dynamic magnetooptic coupling in a ferromagnetic nematic liquid in which longrange orientational order of liquid crystalline molecules is accompanied by longrange magnetic order of magnetic nanoplatelets we investigate the dynamics of the magnetooptic response experimentally and theoretically and find out that it is significantly affected by the dissipative dynamic crosscoupling between the nematic and magnetic order parameters the crosscoupling coefficient determined by fitting the experimental results with a macroscopic theory is of the same order of magnitude as the dissipative coefficient rotational viscosity that governs the reorientation of pure liquid crystals
|
[['hydrodynamics', 'of', 'complex', 'fuids', 'with', 'multiple', 'order', 'parameters', 'is', 'governed', 'by', 'a', 'set', 'of', 'dynamic', 'equations', 'with', 'many', 'material', 'constants', 'of', 'which', 'only', 'some', 'are', 'easily', 'measurable', 'we', 'present', 'a', 'unique', 'example', 'of', 'a', 'dynamic', 'magnetooptic', 'coupling', 'in', 'a', 'ferromagnetic', 'nematic', 'liquid', 'in', 'which', 'longrange', 'orientational', 'order', 'of', 'liquid', 'crystalline', 'molecules', 'is', 'accompanied', 'by', 'longrange', 'magnetic', 'order', 'of', 'magnetic', 'nanoplatelets', 'we', 'investigate', 'the', 'dynamics', 'of', 'the', 'magnetooptic', 'response', 'experimentally', 'and', 'theoretically', 'and', 'find', 'out', 'that', 'it', 'is', 'significantly', 'affected', 'by', 'the', 'dissipative', 'dynamic', 'crosscoupling', 'between', 'the', 'nematic', 'and', 'magnetic', 'order', 'parameters', 'the', 'crosscoupling', 'coefficient', 'determined', 'by', 'fitting', 'the', 'experimental', 'results', 'with', 'a', 'macroscopic', 'theory', 'is', 'of', 'the', 'same', 'order', 'of', 'magnitude', 'as', 'the', 'dissipative', 'coefficient', 'rotational', 'viscosity', 'that', 'governs', 'the', 'reorientation', 'of', 'pure', 'liquid', 'crystals']]
|
[-0.1849527857415378, 0.24485700115934014, -0.04153767507523298, -0.029975503351539375, -0.05910876135528088, -0.1049836126305163, -0.015307880676351488, 0.35878081257641314, -0.291227526396513, -0.3119398119747639, 0.03731553395977244, -0.2693006243184209, -0.16394921028614043, 0.14841398833692074, 0.07587124467641115, 0.06400086819194258, -0.06606656260415912, -0.006948214832693338, -0.07384771272912621, -0.17996550424396993, 0.2825019162707031, -0.0022443899512290953, 0.24719664611667394, 0.06454462215304374, 0.12787903545796872, -0.01723214789479971, 0.057868743628263476, 0.08730411227792502, -0.18758461390121375, 0.059175873205065725, 0.22892988545633852, -0.10245481838285923, 0.19175803811266087, -0.4351234052479267, -0.23099045581370592, 0.043863434690982105, 0.08137137918546795, 0.13508279654290528, -0.021135894872248172, -0.27743548188731076, 0.030008783746510743, -0.15630479290336372, -0.1466651048026979, -0.16150604205019772, 0.003271911516785622, 0.059793041900964454, -0.28790981543064115, 0.1411001095920801, 0.09601237298548222, 0.0915133727164939, -0.09186494098976254, -0.04952530612424016, -0.06423761032707989, 0.06359430401958525, 0.07618370078410953, 0.025606540124863388, 0.15796498896926642, -0.16416767213866115, -0.10365785970166326, 0.41526310220360757, -0.06998005411494523, -0.16536611680011265, 0.1656959532741457, -0.18724377468787134, -0.04713466936722398, 0.20643870509974657, 0.134446615152061, 0.1140537072904408, -0.1549283083677292, 0.03531251104408875, -0.030992598421871662, 0.22853974438458682, 0.040000183027004824, 0.034143702544271945, 0.2238065706267953, 0.21363203854113816, 0.003967851928900927, 0.1470024076816626, -0.06722701596305705, -0.10090668978914619, -0.24955777901643889, -0.16266045599803328, -0.20182829280756415, 0.025709830798208714, -0.12506746605003718, -0.1558040602710098, 0.3978429461568594, 0.14309054308384656, 0.14448885390907526, -0.049493879167363045, 0.25305267234891654, 0.09512922054354567, 0.055124306328594684, 0.003182754907757044, 0.29810283599910326, 0.159728304579854, 0.0947040936909616, -0.3208278923742473, 0.12560579026862978, 0.040946102035231885]
|
1,803.07076
|
Voltage-induced thin-film superconductivity in high magnetic fields
|
We predict that superconductivity in thin films can be stabilized in high
magnetic fields if the superconductor is driven out of equilibrium by a DC
voltage bias. For realistic material parameters and temperatures, we show that
superconductivity is restored in fields many times larger than the
Chandrasekhar-Clogston limit. After motivating the effect analytically, we
perform rigorous numerical calculations to corroborate the findings, and
present concrete experimental signatures. On the technical side, we also
introduce a new form for the nonequilibrium kinetic equations, which
generalizes and simplifies previous formulations of the problem.
|
cond-mat.supr-con
|
we predict that superconductivity in thin films can be stabilized in high magnetic fields if the superconductor is driven out of equilibrium by a dc voltage bias for realistic material parameters and temperatures we show that superconductivity is restored in fields many times larger than the chandrasekharclogston limit after motivating the effect analytically we perform rigorous numerical calculations to corroborate the findings and present concrete experimental signatures on the technical side we also introduce a new form for the nonequilibrium kinetic equations which generalizes and simplifies previous formulations of the problem
|
[['we', 'predict', 'that', 'superconductivity', 'in', 'thin', 'films', 'can', 'be', 'stabilized', 'in', 'high', 'magnetic', 'fields', 'if', 'the', 'superconductor', 'is', 'driven', 'out', 'of', 'equilibrium', 'by', 'a', 'dc', 'voltage', 'bias', 'for', 'realistic', 'material', 'parameters', 'and', 'temperatures', 'we', 'show', 'that', 'superconductivity', 'is', 'restored', 'in', 'fields', 'many', 'times', 'larger', 'than', 'the', 'chandrasekharclogston', 'limit', 'after', 'motivating', 'the', 'effect', 'analytically', 'we', 'perform', 'rigorous', 'numerical', 'calculations', 'to', 'corroborate', 'the', 'findings', 'and', 'present', 'concrete', 'experimental', 'signatures', 'on', 'the', 'technical', 'side', 'we', 'also', 'introduce', 'a', 'new', 'form', 'for', 'the', 'nonequilibrium', 'kinetic', 'equations', 'which', 'generalizes', 'and', 'simplifies', 'previous', 'formulations', 'of', 'the', 'problem']]
|
[-0.1382141006997899, 0.15649116909960387, -0.07098688958929135, 0.05043004017456302, -0.06948923268406601, -0.12842812750406646, 0.08794348372484219, 0.37119434076453467, -0.22070056807434002, -0.27199668877829725, 0.06279238795600627, -0.25389855212127727, -0.13117423086621605, 0.24772529807299948, -0.021958079705894976, 0.011999963731556148, 0.014172402494535833, -0.051055323862813536, -0.11182801868091082, -0.23566221800673712, 0.30319085039689647, 0.030239238690298337, 0.2948371167243509, 0.1172306684234722, 0.04836315069613712, -0.052647019045652596, 0.06527292568768774, 0.08593874946645982, -0.1732322011319831, 0.004389413600470257, 0.2358968936720515, -0.010895876249728294, 0.2392441678362397, -0.5056978633197454, -0.24951717690411176, 0.03385037352116062, 0.12508562740173887, 0.17708784000113975, -0.08027855988085311, -0.2594176938880112, 0.10306773682964127, -0.1393644320522691, -0.12449126863841908, -0.13652344439741593, -0.016878592863597056, -0.020599289292566846, -0.2975303747449428, 0.10980954885215416, 0.046752832750636304, 0.07224668696281887, -0.0829639094574684, -0.13475271274596656, -0.020705486207709206, 0.04769125559327581, 0.06138245381585516, 0.02038518023666936, 0.16287149814888835, -0.1375982227561238, -0.08557125332939265, 0.3266026528531706, -0.0634561597971197, -0.14782201048437055, 0.16730677392998977, -0.13043662775717266, -0.1342426981920233, 0.12421408642574654, 0.12186004758229131, 0.12484801493093863, -0.13415771185492092, 0.07175616742492971, -0.04705835851216382, 0.1716218006766432, 0.009642605516281757, 0.005065935768780636, 0.21949858869333844, 0.20249313624719015, 0.031943617234451716, 0.1801169726237716, -0.04172568914357696, -0.06589720089111355, -0.29501907130355365, -0.14738689431060964, -0.15679930100360742, 0.05824938091541548, -0.06318289082408447, -0.12722163643319528, 0.3800460900369377, 0.2686475130299536, 0.1561189354448528, 0.009903907715752312, 0.2868857045995665, 0.14354101087959423, 0.04638959078507109, 0.05754084043763834, 0.26733060984022833, 0.15261358854995405, 0.10316358674794134, -0.23175504150964155, 0.044960406731691334, 0.020777608966454864]
|
1,803.07077
|
Synergies between intensity maps of hydrogen lines
|
We study synergies between HI 21cm and H$\alpha$ intensity map observations,
focusing on SKA1-like and SPHEREx-like surveys. We forecast how well such a
combination can measure features in the angular power spectrum on the largest
scales, that arise from primordial non-Gaussianity and from general
relativistic effects. For the first time we consider Doppler, Sachs-Wolfe and
integrated SW effects separately. We confirm that the single-tracer surveys on
their own cannot detect general relativistic effects and can constrain the
non-Gaussianity parameter $f_{\rm NL}$ only slightly better than Planck. Using
the multi-tracer technique, constraints on $f_{\rm NL}$ can be pushed down to
$\sim1$. Amongst the general relativistic effects, the Doppler term is
detectable with the multi-tracer. The Sachs-Wolfe terms and the integrated SW
effect are still not detectable.
|
astro-ph.CO
|
we study synergies between hi 21cm and halpha intensity map observations focusing on ska1like and spherexlike surveys we forecast how well such a combination can measure features in the angular power spectrum on the largest scales that arise from primordial nongaussianity and from general relativistic effects for the first time we consider doppler sachswolfe and integrated sw effects separately we confirm that the singletracer surveys on their own cannot detect general relativistic effects and can constrain the nongaussianity parameter f_rm nl only slightly better than planck using the multitracer technique constraints on f_rm nl can be pushed down to sim1 amongst the general relativistic effects the doppler term is detectable with the multitracer the sachswolfe terms and the integrated sw effect are still not detectable
|
[['we', 'study', 'synergies', 'between', 'hi', '21cm', 'and', 'halpha', 'intensity', 'map', 'observations', 'focusing', 'on', 'ska1like', 'and', 'spherexlike', 'surveys', 'we', 'forecast', 'how', 'well', 'such', 'a', 'combination', 'can', 'measure', 'features', 'in', 'the', 'angular', 'power', 'spectrum', 'on', 'the', 'largest', 'scales', 'that', 'arise', 'from', 'primordial', 'nongaussianity', 'and', 'from', 'general', 'relativistic', 'effects', 'for', 'the', 'first', 'time', 'we', 'consider', 'doppler', 'sachswolfe', 'and', 'integrated', 'sw', 'effects', 'separately', 'we', 'confirm', 'that', 'the', 'singletracer', 'surveys', 'on', 'their', 'own', 'can', 'not', 'detect', 'general', 'relativistic', 'effects', 'and', 'can', 'constrain', 'the', 'nongaussianity', 'parameter', 'f_rm', 'nl', 'only', 'slightly', 'better', 'than', 'planck', 'using', 'the', 'multitracer', 'technique', 'constraints', 'on', 'f_rm', 'nl', 'can', 'be', 'pushed', 'down', 'to', 'sim1', 'amongst', 'the', 'general', 'relativistic', 'effects', 'the', 'doppler', 'term', 'is', 'detectable', 'with', 'the', 'multitracer', 'the', 'sachswolfe', 'terms', 'and', 'the', 'integrated', 'sw', 'effect', 'are', 'still', 'not', 'detectable']]
|
[-0.06941394674879942, 0.10551731241866946, -0.0753388475192966, 0.17335620043788016, -0.13516741744693248, -0.08396011819281886, -0.03963584839666803, 0.3647500649995862, -0.26667355995384917, -0.32653062733551186, 0.08036302069048097, -0.31557310659498455, -0.09868621560294301, 0.2326096793403849, 0.02189968138437478, -0.0184742372614217, 0.02184833688736563, -0.08752935662707914, -0.06042583992764834, -0.22267431618773467, 0.3016526770717915, 0.17153101693463302, 0.21151563021234207, 0.04414809663074031, 0.04302354774347717, -0.08787765640449981, -0.12330967038325334, 0.09897506054520848, -0.12749525377465384, 0.04306275867566001, 0.18343236269297888, 0.1593388433290285, 0.20047734745387588, -0.39501652425162553, -0.22360598255087802, 0.1454938761814828, 0.1706923000522018, 0.13114475786325433, 0.01845054397164213, -0.34116469335652166, -0.006621044072099105, -0.17605652006703518, -0.05627434874223845, -0.06307961361955912, -0.005939301193481491, 0.01560772291944182, -0.257011461364586, 0.1563928174249257, -0.0036892736313729395, 0.021140728108284455, -0.04190463593582653, -0.09994080096517029, -0.03816033143272263, 0.05601681534185885, -0.0074204665283867785, 0.023877696686183975, 0.19049839869201665, -0.1294166536235641, -0.04777574599269898, 0.4365522661171253, -0.17984692924320342, -0.11869955228851928, 0.10869557903178277, -0.2137868761670806, -0.19935964204506168, 0.04804888561803607, 0.23066305589952296, 0.05660114068567993, -0.09363069714257313, 0.06892763265697736, 0.056350796896543716, 0.26006331577927116, 0.06013586361997671, 0.10028091128943713, 0.3101426543946746, 0.03989478687365209, 0.08757509122182044, 0.08734808904926232, -0.21644180059816026, 0.015171947768859325, -0.2657662270409468, -0.040080264128083666, -0.1357817845043516, 0.06869432229136545, -0.12610513692456035, -0.06679954336986187, 0.3849994857014427, 0.20126255006048707, 0.1844464265807126, 0.08101308924115953, 0.34485619187715555, 0.1694433171144356, 0.10433209425255266, 0.05259627299082856, 0.33515573875047266, 0.09879087463712259, 0.07364607896024902, -0.25996790936351905, 0.058183438741722174, -0.030431157729077722]
|
1,803.07078
|
Higher Order Harmonics in the Light Curves of Eccentric Planetary
Systems
|
As a planet orbits, it causes periodic modulations in the light curve of its
host star. Due to the combined effects of the planet raising tides on the host
star, relativistic beaming of the starlight, and reflection of light off the
planet's surface, these modulations occur at the planet's orbital frequency, as
well as integer multiples of this frequency. In particular, planets on
eccentric orbits induce third and higher-order harmonics in the stellar light
curve which cannot be explained by circular-orbit models. Even at moderate
eccentricities, such as those typical of Solar System planets, these harmonics
are detectable in current and future photometric data. We present an analysis
of the harmonics caused by tides, beaming, and reflection in eccentric
planetary systems. We explore the dependence of these signals on the parameters
of the system, and we discuss prospects for current and future observations of
these signals, particularly by the NASA TESS mission. Finally, we present
publicly available code for computation of light curves with tidal, beaming,
and reflection signals, OoT.
|
astro-ph.EP astro-ph.IM astro-ph.SR
|
as a planet orbits it causes periodic modulations in the light curve of its host star due to the combined effects of the planet raising tides on the host star relativistic beaming of the starlight and reflection of light off the planets surface these modulations occur at the planets orbital frequency as well as integer multiples of this frequency in particular planets on eccentric orbits induce third and higherorder harmonics in the stellar light curve which cannot be explained by circularorbit models even at moderate eccentricities such as those typical of solar system planets these harmonics are detectable in current and future photometric data we present an analysis of the harmonics caused by tides beaming and reflection in eccentric planetary systems we explore the dependence of these signals on the parameters of the system and we discuss prospects for current and future observations of these signals particularly by the nasa tess mission finally we present publicly available code for computation of light curves with tidal beaming and reflection signals oot
|
[['as', 'a', 'planet', 'orbits', 'it', 'causes', 'periodic', 'modulations', 'in', 'the', 'light', 'curve', 'of', 'its', 'host', 'star', 'due', 'to', 'the', 'combined', 'effects', 'of', 'the', 'planet', 'raising', 'tides', 'on', 'the', 'host', 'star', 'relativistic', 'beaming', 'of', 'the', 'starlight', 'and', 'reflection', 'of', 'light', 'off', 'the', 'planets', 'surface', 'these', 'modulations', 'occur', 'at', 'the', 'planets', 'orbital', 'frequency', 'as', 'well', 'as', 'integer', 'multiples', 'of', 'this', 'frequency', 'in', 'particular', 'planets', 'on', 'eccentric', 'orbits', 'induce', 'third', 'and', 'higherorder', 'harmonics', 'in', 'the', 'stellar', 'light', 'curve', 'which', 'can', 'not', 'be', 'explained', 'by', 'circularorbit', 'models', 'even', 'at', 'moderate', 'eccentricities', 'such', 'as', 'those', 'typical', 'of', 'solar', 'system', 'planets', 'these', 'harmonics', 'are', 'detectable', 'in', 'current', 'and', 'future', 'photometric', 'data', 'we', 'present', 'an', 'analysis', 'of', 'the', 'harmonics', 'caused', 'by', 'tides', 'beaming', 'and', 'reflection', 'in', 'eccentric', 'planetary', 'systems', 'we', 'explore', 'the', 'dependence', 'of', 'these', 'signals', 'on', 'the', 'parameters', 'of', 'the', 'system', 'and', 'we', 'discuss', 'prospects', 'for', 'current', 'and', 'future', 'observations', 'of', 'these', 'signals', 'particularly', 'by', 'the', 'nasa', 'tess', 'mission', 'finally', 'we', 'present', 'publicly', 'available', 'code', 'for', 'computation', 'of', 'light', 'curves', 'with', 'tidal', 'beaming', 'and', 'reflection', 'signals', 'oot']]
|
[-0.184808843257178, 0.1843381436707279, -0.08137208044703244, 0.08880786950174414, -0.11771241238351628, -0.06903421043892179, 0.05802451117013238, 0.3673100737277527, -0.22320431863279108, -0.3409769384909356, 0.12053941091051466, -0.28313943651935075, -0.13457805479261262, 0.2828587896206923, -0.08423438301287477, 0.05501213872618701, 0.12530591722839235, -0.060909725558176114, -0.03638481092503109, -0.23707810428799592, 0.30053860043333464, 0.0767158770073227, 0.04289271745269802, 0.0011964707515523796, 0.015506247641948972, 0.017460943898186088, -0.03480762463438798, -0.06515211814589668, -0.12816626239773593, 0.053046509677990836, 0.22860318370128466, 0.1107123042592964, 0.14474233684037424, -0.4111906977163421, -0.22800144185012544, 0.04813029974350455, 0.12224564889931985, 0.08092228152410655, -0.056186245953152227, -0.27863947079075796, 0.03607617494750942, -0.20918605974412452, -0.18534964990253391, -0.015666167616669894, 0.06951756940403006, 0.062056328747312574, -0.22931201574910018, 0.07800299402977182, 0.0939601778402674, 0.14765577184646364, -0.12677573066882855, -0.11692507991741537, -0.0881955215819071, 0.05868516577004689, 0.0682410004641316, 0.0030622339156614236, 0.14701897716108842, -0.08879810404332017, -0.06754794641675656, 0.4597621411629762, -0.10102963291022829, -0.07433038492474639, 0.18344883075833582, -0.2559095702504423, -0.0881571669256783, 0.11902939818516287, 0.2610675328198755, 0.11456516209978894, -0.11085759980838245, -0.014857425972239295, 0.050321187437321356, 0.16761810834143767, 0.10329203893926148, 0.08422791602550216, 0.41237167265723673, 0.10204730203990656, 0.03610247870830939, 0.06535058502211338, -0.21308064937989135, 0.014602529609368907, -0.21637023613707854, -0.0734891302635817, -0.14714590966570795, -0.003342164841709299, -0.10044956693845482, -0.11065143585880423, 0.4005076570262076, 0.1406164179577857, 0.15996901189761334, 0.0026304938759632974, 0.33662160175814354, 0.13585390461260202, 0.08766277627583746, 0.09264578450095366, 0.33143530059088433, 0.1099846767076449, 0.06507716690903606, -0.2817850480215591, 0.0702748764769245, -0.03739430952397834]
|
1,803.07079
|
A numerical formulation of resummation in effective field theory
|
In this article we show how the resummation of infrared and collinear
logarithms within Soft-Collinear Effective Theory (SCET) can be formulated in a
way that makes it suitable for a Monte-Carlo implementation. This is done by
applying the techniques developed for automated resummation using the branching
formalism, which have resulted in the general resummation approach CAESAR/ARES.
This work builds a connection between the two resummation approaches, and paves
the way to automated resummation in SCET. As a case study we consider the
resummation of the thrust distribution in electron-positron collisions at
next-to-leading logarithm (NLL). However, the results presented here are easily
generalizable to more complicated observables and processes as well as to
higher orders in the logarithmic accuracy.
|
hep-ph
|
in this article we show how the resummation of infrared and collinear logarithms within softcollinear effective theory scet can be formulated in a way that makes it suitable for a montecarlo implementation this is done by applying the techniques developed for automated resummation using the branching formalism which have resulted in the general resummation approach caesarares this work builds a connection between the two resummation approaches and paves the way to automated resummation in scet as a case study we consider the resummation of the thrust distribution in electronpositron collisions at nexttoleading logarithm nll however the results presented here are easily generalizable to more complicated observables and processes as well as to higher orders in the logarithmic accuracy
|
[['in', 'this', 'article', 'we', 'show', 'how', 'the', 'resummation', 'of', 'infrared', 'and', 'collinear', 'logarithms', 'within', 'softcollinear', 'effective', 'theory', 'scet', 'can', 'be', 'formulated', 'in', 'a', 'way', 'that', 'makes', 'it', 'suitable', 'for', 'a', 'montecarlo', 'implementation', 'this', 'is', 'done', 'by', 'applying', 'the', 'techniques', 'developed', 'for', 'automated', 'resummation', 'using', 'the', 'branching', 'formalism', 'which', 'have', 'resulted', 'in', 'the', 'general', 'resummation', 'approach', 'caesarares', 'this', 'work', 'builds', 'a', 'connection', 'between', 'the', 'two', 'resummation', 'approaches', 'and', 'paves', 'the', 'way', 'to', 'automated', 'resummation', 'in', 'scet', 'as', 'a', 'case', 'study', 'we', 'consider', 'the', 'resummation', 'of', 'the', 'thrust', 'distribution', 'in', 'electronpositron', 'collisions', 'at', 'nexttoleading', 'logarithm', 'nll', 'however', 'the', 'results', 'presented', 'here', 'are', 'easily', 'generalizable', 'to', 'more', 'complicated', 'observables', 'and', 'processes', 'as', 'well', 'as', 'to', 'higher', 'orders', 'in', 'the', 'logarithmic', 'accuracy']]
|
[-0.06378089707955702, 0.08134780553145668, -0.19450033688320753, 0.13428392269425732, -0.0424960138849341, -0.048499614392351516, 0.01068319619904893, 0.38302922466944933, -0.18539894195114318, -0.2768468056908912, 0.01942844780233617, -0.26057945355836654, -0.11521734981837435, 0.1722435360022176, -0.028821312338332686, 0.13048689934210136, 0.04149800981593947, -0.05628645862253685, -0.06563083429693475, -0.2300073494318809, 0.3118280571980927, 0.07597351531124014, 0.21904763754688075, 0.1424910529819118, 0.0628639895759491, 0.0927324099585605, -0.07106627529471093, 0.019664275945506543, -0.09790129758822821, 0.1223298252272145, 0.34804299268990946, 0.03994137147425586, 0.23017682721261254, -0.3592572174429034, -0.14790726673558482, 0.014569870005242335, 0.21359940140675276, 0.13540712599025673, -0.009480016507655103, -0.22319712047863147, 0.08055057679899992, -0.29790454775763625, -0.1721766835086557, -0.19685148224871382, -0.05065938034373471, -0.05612061837684108, -0.3057204407329361, 0.03542056034043487, 0.03407493060052745, 0.018686203142771356, 0.07615880815423706, -0.0872976078848856, 0.03579481484559484, 0.0646196062811929, 0.08696879610582454, 0.08542963643120523, 0.14486382973010245, -0.1840869401030354, -0.20882997759737265, 0.39578858071054596, -0.06535985704081562, -0.18107072880658776, 0.14055735371911374, -0.16242840939050174, -0.19853280705566972, 0.11619779342610358, 0.19656559891011724, 0.19727279686241642, -0.21484020049882752, 0.14703795850191376, 0.04882038162591366, 0.1084023936587967, 0.10035540355154528, 0.015550131975716919, 0.11876054898573038, 0.1909374010980002, 0.00877573790275452, 0.12142881168884376, -0.034871478823737964, -0.12325923894651425, -0.39747874814475703, -0.10700260336552751, -0.08609607594055879, 0.029212405507126425, -0.09811817187953713, -0.1318872353165514, 0.34682592790589756, 0.23276620276638457, 0.23345998821095523, 0.09136730751806758, 0.38973898983472943, 0.18491619909440893, 0.11420592181702964, 0.06866064299252203, 0.2642028487156121, 0.10863687965270673, 0.08649504268701133, -0.19607302019050202, 0.01636994699151534, 0.11989888260698217]
|
1,803.0708
|
Phonon-polariton mediated thermal radiation and heat transfer among
molecules and macroscopic bodies: nonlocal electromagnetic response at
mesoscopic scales
|
Thermal radiative phenomena can be strongly influenced by the coupling of
phonons and long-range electromagnetic fields at infrared frequencies.
Typically employed macroscopic descriptions of thermal fluctuations tend to
ignore atomistic effects that become relevant at nanometric scales, whereas
purely microscopic treatments ignore long-range, geometry-dependent
electromagnetic effects. We describe a mesoscopic framework for modeling
thermal fluctuation phenomena among molecules in the vicinity of macroscopic
bodies, conjoining atomistic treatments of electronic and vibrational
fluctuations obtained from ab-initio density functional theory in the former
with continuum descriptions of electromagnetic scattering in the latter. The
interplay of these effects becomes particularly important at mesoscopic scales,
where phonon polaritons can be strongly influenced by the finite sizes, shapes,
and non-local/many-body response of the bodies to electromagnetic fluctuations.
We show that even in small but especially in elongated low-dimensional
molecular systems, such effects can modify thermal emission and heat transfer
by orders of magnitude and produce qualitatively different behavior compared to
predictions based on local, dipolar, or pairwise approximations valid only in
dilute media.
|
cond-mat.mes-hall
|
thermal radiative phenomena can be strongly influenced by the coupling of phonons and longrange electromagnetic fields at infrared frequencies typically employed macroscopic descriptions of thermal fluctuations tend to ignore atomistic effects that become relevant at nanometric scales whereas purely microscopic treatments ignore longrange geometrydependent electromagnetic effects we describe a mesoscopic framework for modeling thermal fluctuation phenomena among molecules in the vicinity of macroscopic bodies conjoining atomistic treatments of electronic and vibrational fluctuations obtained from abinitio density functional theory in the former with continuum descriptions of electromagnetic scattering in the latter the interplay of these effects becomes particularly important at mesoscopic scales where phonon polaritons can be strongly influenced by the finite sizes shapes and nonlocalmanybody response of the bodies to electromagnetic fluctuations we show that even in small but especially in elongated lowdimensional molecular systems such effects can modify thermal emission and heat transfer by orders of magnitude and produce qualitatively different behavior compared to predictions based on local dipolar or pairwise approximations valid only in dilute media
|
[['thermal', 'radiative', 'phenomena', 'can', 'be', 'strongly', 'influenced', 'by', 'the', 'coupling', 'of', 'phonons', 'and', 'longrange', 'electromagnetic', 'fields', 'at', 'infrared', 'frequencies', 'typically', 'employed', 'macroscopic', 'descriptions', 'of', 'thermal', 'fluctuations', 'tend', 'to', 'ignore', 'atomistic', 'effects', 'that', 'become', 'relevant', 'at', 'nanometric', 'scales', 'whereas', 'purely', 'microscopic', 'treatments', 'ignore', 'longrange', 'geometrydependent', 'electromagnetic', 'effects', 'we', 'describe', 'a', 'mesoscopic', 'framework', 'for', 'modeling', 'thermal', 'fluctuation', 'phenomena', 'among', 'molecules', 'in', 'the', 'vicinity', 'of', 'macroscopic', 'bodies', 'conjoining', 'atomistic', 'treatments', 'of', 'electronic', 'and', 'vibrational', 'fluctuations', 'obtained', 'from', 'abinitio', 'density', 'functional', 'theory', 'in', 'the', 'former', 'with', 'continuum', 'descriptions', 'of', 'electromagnetic', 'scattering', 'in', 'the', 'latter', 'the', 'interplay', 'of', 'these', 'effects', 'becomes', 'particularly', 'important', 'at', 'mesoscopic', 'scales', 'where', 'phonon', 'polaritons', 'can', 'be', 'strongly', 'influenced', 'by', 'the', 'finite', 'sizes', 'shapes', 'and', 'nonlocalmanybody', 'response', 'of', 'the', 'bodies', 'to', 'electromagnetic', 'fluctuations', 'we', 'show', 'that', 'even', 'in', 'small', 'but', 'especially', 'in', 'elongated', 'lowdimensional', 'molecular', 'systems', 'such', 'effects', 'can', 'modify', 'thermal', 'emission', 'and', 'heat', 'transfer', 'by', 'orders', 'of', 'magnitude', 'and', 'produce', 'qualitatively', 'different', 'behavior', 'compared', 'to', 'predictions', 'based', 'on', 'local', 'dipolar', 'or', 'pairwise', 'approximations', 'valid', 'only', 'in', 'dilute', 'media']]
|
[-0.11353985335912087, 0.24680746912755475, -0.09432789521894144, 0.11440532529046257, -0.03392224919195928, -0.09764171829781756, -0.01816289745128998, 0.3565909772509051, -0.26872240800499736, -0.27973502807940975, -0.017967434977822584, -0.3193708989953254, -0.13096041328128719, 0.17756492582924976, 0.06750552075452165, 0.009402672749035015, 0.0022378358878418357, -0.060378193990522605, -0.028805667260511147, -0.14002161847516717, 0.28672065673128305, 0.0656723482645825, 0.2941126439798467, 0.10140537603306556, 0.04323685757221911, 0.013228984775501275, -0.0015904706732710143, 0.10453826579973548, -0.1209644779503174, 0.07864815189397174, 0.2914211056724994, -0.08893507581572244, 0.22867466657336044, -0.5538135484351726, -0.27886094169710024, 0.05625841356737227, 0.16033617880691714, 0.17302878776531733, 0.019396989533125596, -0.25666996241619666, -0.00654259019163242, -0.10970390978698691, -0.1239564085668887, -0.11928337437942803, 0.022319592373769084, 0.046397583457379196, -0.23515337470550826, 0.15656680103829188, 0.04384623227284072, 0.0752016940672776, -0.07571814608380957, -0.10998029909710104, -0.02324310213628554, 0.09905500784599987, 0.04418942339517578, -0.04102325380060398, 0.25989122378701224, -0.16711380338006301, -0.0718815013568313, 0.427348412305652, -0.07092315606176183, -0.1789953907084523, 0.2484778492686389, -0.18859940632051247, -0.07807516919527047, 0.20378858491243002, 0.17274019453384562, 0.1052615433334635, -0.1508467592087067, 0.03599979516089487, 0.06444759492017886, 0.17833655681684166, 0.04996348169498413, 0.14264800974229228, 0.26699567743727637, 0.1560605628622283, -0.04802063443212809, 0.11518097441074644, -0.05180465590371192, -0.11608575852476284, -0.23459378159242475, -0.04597142453216195, -0.20090719377259517, 0.07360733380753123, -0.09128261304209162, -0.17941642516138573, 0.3393930511961797, 0.18953764608128465, 0.1322375103095156, -0.007076759902135787, 0.28122477267428253, 0.07939889644478966, 0.07040119248659846, 0.061302952080808895, 0.29029536405146056, 0.13781961718641086, 0.0658279949698798, -0.30259778501025353, 0.07599788650864746, -0.0003279083461394745]
|
1,803.07081
|
Emergent spin-$1$ Haldane gap and ferroelectricity in a frustrated
spin-$1/2$ ladder
|
We report experimental and theoretical evidence that
Rb$_2$Cu$_2$Mo$_3$O$_{12}$ has a nonmagnetic tetramer ground state of a two-leg
ladder comprising antiferromagnetically coupled frustrated spin-$1/2$ chains
and exhibits a Haldane spin gap of emergent spin-1 pairs. Three spin
excitations split from the spin-1 triplet by a Dzyaloshinskii-Moriya
interaction are identified in inelastic neutron-scattering and electron spin
resonance spectra. A tiny magnetic field generates ferroelectricity without
closing the spin gap, indicating a novel class of ferroelectricity induced by a
vector spin chirality order.
|
cond-mat.str-el
|
we report experimental and theoretical evidence that rb_2cu_2mo_3o_12 has a nonmagnetic tetramer ground state of a twoleg ladder comprising antiferromagnetically coupled frustrated spin12 chains and exhibits a haldane spin gap of emergent spin1 pairs three spin excitations split from the spin1 triplet by a dzyaloshinskiimoriya interaction are identified in inelastic neutronscattering and electron spin resonance spectra a tiny magnetic field generates ferroelectricity without closing the spin gap indicating a novel class of ferroelectricity induced by a vector spin chirality order
|
[['we', 'report', 'experimental', 'and', 'theoretical', 'evidence', 'that', 'rb_2cu_2mo_3o_12', 'has', 'a', 'nonmagnetic', 'tetramer', 'ground', 'state', 'of', 'a', 'twoleg', 'ladder', 'comprising', 'antiferromagnetically', 'coupled', 'frustrated', 'spin12', 'chains', 'and', 'exhibits', 'a', 'haldane', 'spin', 'gap', 'of', 'emergent', 'spin1', 'pairs', 'three', 'spin', 'excitations', 'split', 'from', 'the', 'spin1', 'triplet', 'by', 'a', 'dzyaloshinskiimoriya', 'interaction', 'are', 'identified', 'in', 'inelastic', 'neutronscattering', 'and', 'electron', 'spin', 'resonance', 'spectra', 'a', 'tiny', 'magnetic', 'field', 'generates', 'ferroelectricity', 'without', 'closing', 'the', 'spin', 'gap', 'indicating', 'a', 'novel', 'class', 'of', 'ferroelectricity', 'induced', 'by', 'a', 'vector', 'spin', 'chirality', 'order']]
|
[-0.2840811700851191, 0.3419596840598388, 0.04847369315102697, 0.04560028950800188, -0.11751813135342673, -0.18772396150161513, 0.040173352160491047, 0.41950528296874834, -0.20847486185375602, -0.2650084821128985, -0.06139691095304443, -0.37437120560789483, -0.07523766165832058, 0.08705295211984776, 0.21037028475257102, -0.032879368343856186, -0.0015622368664480746, -0.0029364638263359665, -0.11959285025659483, -0.148979783107643, 0.2743245715275407, -0.07386025951709599, 0.28583039531949905, 0.09348374717519618, 0.09982025368954055, 0.06593561357294675, 0.21904302946932147, -0.02652350813150406, -0.1383335888070178, 0.06600996314664372, 0.23139781379213673, -0.16856281985528768, 0.1138697739224881, -0.41281144389649854, -0.1614098003716208, -0.0033411439973860977, 0.17187208727264078, 0.22779356878018006, -0.10923655321530532, -0.3822666555410251, -0.050950876672868614, -0.23714249855838715, -0.10992738575441763, -0.17662823720966117, -0.08282146497949724, -0.06611571086104959, -0.26127332975156603, 0.1437656675465405, 0.15896647290792315, 0.14732135501690208, -0.1173785961989779, -0.15439370526000856, -0.11175392215372995, -0.02015849809977226, 0.052335802279412744, 0.07861149961245247, 0.10584419326041825, -0.11052891257677402, -0.2665555828716606, 0.2831238723068964, -0.10500472861094749, -0.08252118213567883, 0.12354420143528841, -0.14689230354852043, -0.09268002437602263, 0.193317230604589, 0.04979353668531985, 0.04670028685941361, -0.1729676619055681, 0.09727563948617898, -0.0765708320774138, 0.20611354690481676, -0.05836499227734748, 0.0842782713662018, 0.37981037015561014, 0.2262909334793221, 0.03531030069570988, 0.20947261245455592, -0.16247736326477025, -0.1250170984363649, -0.1735117151401937, -0.16121913747629152, -0.26194483661674894, 0.0978559679548198, 0.0015068701357449754, -0.16610636062687262, 0.4371089992229827, 0.12938050384400412, 0.19099642726470165, -0.11734039162984118, 0.18238218252663502, 0.0147922623436898, 0.05528508354909718, 0.022614400477323215, 0.24485651708673686, 0.24413920424412935, 0.06842392356338678, -0.3467017447896069, 0.02257391806342639, 0.010887612932128832]
|
1,803.07082
|
A new strong-lensing galaxy at z=0.066: Another elliptical galaxy with a
lightweight IMF
|
We report the discovery of a new low-redshift galaxy-scale gravitational
lens, identified from a systematic search of publicly available MUSE
observations. The lens galaxy, 2MASXJ04035024-0239275, is a giant elliptical at
$z$ = 0.06604 with a velocity dispersion of $\sigma$ = 314 km s$^{-1}$. The
lensed source has a redshift of 0.19165 and forms a pair of bright images
either side of the lens centre. The Einstein radius is 1.5 arcsec, projecting
to 1.8 kpc, which is just one quarter of the galaxy effective radius. After
correcting for an estimated 19 per cent dark matter contribution, we find that
the stellar mass-to-light ratio from lensing is consistent with that expected
for a Milky Way initial mass function (IMF). Combining the new system with
three previously-studied low-redshift lenses of similar $\sigma$, the derived
mean mass excess factor (relative to a Kroupa IMF) is $\langle\alpha\rangle$ =
1.09$\pm$0.08. With all four systems, the intrinsic scatter in $\alpha$ for
massive elliptical galaxies can be limited to $<0.32$, at 90 per cent
confidence.
|
astro-ph.GA
|
we report the discovery of a new lowredshift galaxyscale gravitational lens identified from a systematic search of publicly available muse observations the lens galaxy 2masxj040350240239275 is a giant elliptical at z 006604 with a velocity dispersion of sigma 314 km s1 the lensed source has a redshift of 019165 and forms a pair of bright images either side of the lens centre the einstein radius is 15 arcsec projecting to 18 kpc which is just one quarter of the galaxy effective radius after correcting for an estimated 19 per cent dark matter contribution we find that the stellar masstolight ratio from lensing is consistent with that expected for a milky way initial mass function imf combining the new system with three previouslystudied lowredshift lenses of similar sigma the derived mean mass excess factor relative to a kroupa imf is langlealpharangle 109pm008 with all four systems the intrinsic scatter in alpha for massive elliptical galaxies can be limited to 032 at 90 per cent confidence
|
[['we', 'report', 'the', 'discovery', 'of', 'a', 'new', 'lowredshift', 'galaxyscale', 'gravitational', 'lens', 'identified', 'from', 'a', 'systematic', 'search', 'of', 'publicly', 'available', 'muse', 'observations', 'the', 'lens', 'galaxy', '2masxj040350240239275', 'is', 'a', 'giant', 'elliptical', 'at', 'z', '006604', 'with', 'a', 'velocity', 'dispersion', 'of', 'sigma', '314', 'km', 's1', 'the', 'lensed', 'source', 'has', 'a', 'redshift', 'of', '019165', 'and', 'forms', 'a', 'pair', 'of', 'bright', 'images', 'either', 'side', 'of', 'the', 'lens', 'centre', 'the', 'einstein', 'radius', 'is', '15', 'arcsec', 'projecting', 'to', '18', 'kpc', 'which', 'is', 'just', 'one', 'quarter', 'of', 'the', 'galaxy', 'effective', 'radius', 'after', 'correcting', 'for', 'an', 'estimated', '19', 'per', 'cent', 'dark', 'matter', 'contribution', 'we', 'find', 'that', 'the', 'stellar', 'masstolight', 'ratio', 'from', 'lensing', 'is', 'consistent', 'with', 'that', 'expected', 'for', 'a', 'milky', 'way', 'initial', 'mass', 'function', 'imf', 'combining', 'the', 'new', 'system', 'with', 'three', 'previouslystudied', 'lowredshift', 'lenses', 'of', 'similar', 'sigma', 'the', 'derived', 'mean', 'mass', 'excess', 'factor', 'relative', 'to', 'a', 'kroupa', 'imf', 'is', 'langlealpharangle', '109pm008', 'with', 'all', 'four', 'systems', 'the', 'intrinsic', 'scatter', 'in', 'alpha', 'for', 'massive', 'elliptical', 'galaxies', 'can', 'be', 'limited', 'to', '032', 'at', '90', 'per', 'cent', 'confidence']]
|
[-0.09858613559220619, 0.06572927127867928, -0.0753332864414057, 0.09485902954786196, -0.11069021778585354, -0.09405650147793335, 0.02572114357385058, 0.38958672663700655, -0.12017902547388144, -0.3922692513409651, 0.017319133258483273, -0.33479094770063395, 0.006755726977175324, 0.21061708402831647, -0.009302254914490611, -0.0004946607539910565, 0.05436299672444005, -0.053419294405388854, -0.090723328695705, -0.3051847424475277, 0.29371511863116995, 0.0733976765131613, 0.1401440481239426, -0.07070065464358777, 0.12901344987616506, -0.06736631393461905, -0.07071347582979866, -0.014628686690293017, -0.1693407765553229, 0.05409622796278142, 0.17729806856094105, 0.11959780867463388, 0.24509562103446783, -0.23435250097452281, -0.16265329653572924, 0.06322832795375455, 0.19898523146040598, 0.06230058002142154, -0.08547285353800035, -0.2988022051007727, 0.0901893611481917, -0.197764855891513, -0.20267800229701138, 0.15073740900839744, 0.05056771144355829, 0.006286565952424733, -0.21425328158140886, 0.2230590180112796, -0.03431562134686165, 0.08578197977288901, -0.08626227390530677, -0.1393133669691863, -0.06968234364622794, 0.03620984609701536, -0.0070402947614707475, 0.13905657265106883, 0.2091387097442628, -0.14563522321090056, 0.009601526170289554, 0.4243521247873282, -0.09012234196763884, -0.042688218187013606, 0.14826909888611883, -0.2093122386602017, -0.16234761881554183, 0.1474155705750176, 0.17719577987343013, 0.062431560805852306, -0.1910647843794534, 0.008316227454185462, -0.03843997467533281, 0.3134786474969496, 0.0570314565978054, 0.028161193015904654, 0.37074711986776415, 0.10776530085834411, 0.06653798209304142, 0.04909611551849605, -0.25639538236735565, 0.012615450818981952, -0.27814700299253065, -0.09075601062731548, -0.12618036844925778, 0.12775152935734335, -0.1848882533515234, -0.10491031540393736, 0.3119742061690949, 0.08394732577843392, 0.23874766576402592, 0.10852013106616039, 0.30455683352449126, 0.09749419250087696, 0.14448818045305148, 0.0775662728031781, 0.3443418316683679, 0.16527840040284414, 0.007800240049859122, -0.1633163896395163, -0.008623205491417797, -0.015361130873104499]
|
1,803.07083
|
Consequences of Giant Impacts on Early Uranus for Rotation, Internal
Structure, Debris, and Atmospheric Erosion
|
We perform a suite of smoothed particle hydrodynamics simulations to
investigate in detail the results of a giant impact on the young Uranus. We
study the internal structure, rotation rate, and atmospheric retention of the
post-impact planet, as well as the composition of material ejected into orbit.
Most of the material from the impactor's rocky core falls in to the core of the
target. However, for higher angular momentum impacts, significant amounts
become embedded anisotropically as lumps in the ice layer. Furthermore, most of
the impactor's ice and energy is deposited in a hot, high-entropy shell at a
radius of ~3 Earth radii. This could explain Uranus' observed lack of heat flow
from the interior and be relevant for understanding its asymmetric magnetic
field. We verify the results from the single previous study of lower resolution
simulations that an impactor with a mass of at least 2 Earth masses can produce
sufficiently rapid rotation in the post-impact Uranus for a range of angular
momenta. At least 90% of the atmosphere remains bound to the final planet after
the collision, but over half can be ejected beyond the Roche radius by a 2 or 3
Earth mass impactor. This atmospheric erosion peaks for intermediate impactor
angular momenta (~3*10^36 kg m^2 s^-1). Rock is more efficiently placed into
orbit and made available for satellite formation by 2 Earth mass impactors than
3 Earth mass ones, because it requires tidal disruption that is suppressed by
the more massive impactors.
|
astro-ph.EP
|
we perform a suite of smoothed particle hydrodynamics simulations to investigate in detail the results of a giant impact on the young uranus we study the internal structure rotation rate and atmospheric retention of the postimpact planet as well as the composition of material ejected into orbit most of the material from the impactors rocky core falls in to the core of the target however for higher angular momentum impacts significant amounts become embedded anisotropically as lumps in the ice layer furthermore most of the impactors ice and energy is deposited in a hot highentropy shell at a radius of 3 earth radii this could explain uranus observed lack of heat flow from the interior and be relevant for understanding its asymmetric magnetic field we verify the results from the single previous study of lower resolution simulations that an impactor with a mass of at least 2 earth masses can produce sufficiently rapid rotation in the postimpact uranus for a range of angular momenta at least 90 of the atmosphere remains bound to the final planet after the collision but over half can be ejected beyond the roche radius by a 2 or 3 earth mass impactor this atmospheric erosion peaks for intermediate impactor angular momenta 31036 kg m2 s1 rock is more efficiently placed into orbit and made available for satellite formation by 2 earth mass impactors than 3 earth mass ones because it requires tidal disruption that is suppressed by the more massive impactors
|
[['we', 'perform', 'a', 'suite', 'of', 'smoothed', 'particle', 'hydrodynamics', 'simulations', 'to', 'investigate', 'in', 'detail', 'the', 'results', 'of', 'a', 'giant', 'impact', 'on', 'the', 'young', 'uranus', 'we', 'study', 'the', 'internal', 'structure', 'rotation', 'rate', 'and', 'atmospheric', 'retention', 'of', 'the', 'postimpact', 'planet', 'as', 'well', 'as', 'the', 'composition', 'of', 'material', 'ejected', 'into', 'orbit', 'most', 'of', 'the', 'material', 'from', 'the', 'impactors', 'rocky', 'core', 'falls', 'in', 'to', 'the', 'core', 'of', 'the', 'target', 'however', 'for', 'higher', 'angular', 'momentum', 'impacts', 'significant', 'amounts', 'become', 'embedded', 'anisotropically', 'as', 'lumps', 'in', 'the', 'ice', 'layer', 'furthermore', 'most', 'of', 'the', 'impactors', 'ice', 'and', 'energy', 'is', 'deposited', 'in', 'a', 'hot', 'highentropy', 'shell', 'at', 'a', 'radius', 'of', '3', 'earth', 'radii', 'this', 'could', 'explain', 'uranus', 'observed', 'lack', 'of', 'heat', 'flow', 'from', 'the', 'interior', 'and', 'be', 'relevant', 'for', 'understanding', 'its', 'asymmetric', 'magnetic', 'field', 'we', 'verify', 'the', 'results', 'from', 'the', 'single', 'previous', 'study', 'of', 'lower', 'resolution', 'simulations', 'that', 'an', 'impactor', 'with', 'a', 'mass', 'of', 'at', 'least', '2', 'earth', 'masses', 'can', 'produce', 'sufficiently', 'rapid', 'rotation', 'in', 'the', 'postimpact', 'uranus', 'for', 'a', 'range', 'of', 'angular', 'momenta', 'at', 'least', '90', 'of', 'the', 'atmosphere', 'remains', 'bound', 'to', 'the', 'final', 'planet', 'after', 'the', 'collision', 'but', 'over', 'half', 'can', 'be', 'ejected', 'beyond', 'the', 'roche', 'radius', 'by', 'a', '2', 'or', '3', 'earth', 'mass', 'impactor', 'this', 'atmospheric', 'erosion', 'peaks', 'for', 'intermediate', 'impactor', 'angular', 'momenta', '31036', 'kg', 'm2', 's1', 'rock', 'is', 'more', 'efficiently', 'placed', 'into', 'orbit', 'and', 'made', 'available', 'for', 'satellite', 'formation', 'by', '2', 'earth', 'mass', 'impactors', 'than', '3', 'earth', 'mass', 'ones', 'because', 'it', 'requires', 'tidal', 'disruption', 'that', 'is', 'suppressed', 'by', 'the', 'more', 'massive', 'impactors']]
|
[-0.09076479673195555, 0.21332770940159895, -0.06457181618910054, 0.0827760219635746, -0.04898554279031802, -0.02274321592507922, 0.016724871646384802, 0.3439648081909637, -0.18530298119163788, -0.3861590233764478, 0.11194866298251234, -0.26635079512904797, -0.03216099979412951, 0.19653140737494568, -0.03473668275020864, -0.005106852589203615, 0.1311590759858147, 0.014326039091588891, -0.08256336333733812, -0.22028297246433795, 0.28095928759561206, 0.12357551892078956, 0.09531228989837881, 0.053830742303814204, 0.07504241570108094, -0.06566887937286603, 0.008116711872720103, -0.04122678721513675, -0.15997246789813696, 0.055346548352960726, 0.18216873256641689, 0.10481232306824959, 0.20343205781311405, -0.4447488428986802, -0.21983488709950932, 0.03753298980003337, 0.15559298714660869, 0.05351453927198273, -0.07211675840674671, -0.21855062681573387, 0.07904234455746352, -0.24491143824475609, -0.19613365616877468, 0.04157948073246801, 0.090117688969785, -0.02983230212465765, -0.24176293418680944, 0.09726676180179478, 0.07964257782334652, 0.08033607327759418, -0.12093195304113002, -0.1741244657601857, -0.12437673651005085, 0.08676923921863948, 0.09011147478864141, 0.011080269134432382, 0.2246604294288067, -0.10642857130863989, 0.028362338955761218, 0.44193885036154973, -0.054765133244491525, -0.08816487783071947, 0.22766559953440207, -0.24311638608650893, -0.06073792677429714, 0.2179310724481332, 0.2114079500553293, 0.11771240128318267, -0.13795407145707012, -0.00702255963994076, -0.03051639054711832, 0.18821950905709242, 0.11716660222760877, 0.006632518491764762, 0.3626410020496316, 0.20129052610801798, 0.06538719064936194, 0.07000941490013228, -0.2111302656739266, -0.05819541300048253, -0.1847886322750425, -0.15857539912911456, -0.17227013136203193, 0.05719909043222362, -0.11320481207958251, -0.10687295791018298, 0.3185605829301271, 0.12080217841442446, 0.2115074681916407, 0.0009315117271807121, 0.29849291415695023, 0.022503200668024317, 0.1110644523662572, 0.13297511138193005, 0.3033135754493426, 0.13240533650434594, 0.11202634397124378, -0.22861275882080045, 0.08183260024240127, 0.027055836960255188]
|
1,803.07084
|
Recovering the Physical Properties of Molecular Gas in Galaxies from CO
SLED Modeling
|
Modeling of the spectral line energy distribution (SLED) of the CO molecule
can reveal the physical conditions (temperature, density) of molecular gas in
Galactic clouds and other galaxies. Recently, the Herschel Space Observatory
and ALMA have offered, for the first time, a comprehensive view of the
rotational J = 4-3 through J = 13-12 lines, which arise from a complex, diverse
range of physical conditions that must be simplified to one, two, or three
components when modeled. Here we investigate the recoverability of physical
conditions from SLEDs produced by galaxy evolution simulations containing a
large dynamical range in physical properties. These simulated SLEDs were
generally fit well by one component of gas whose properties largely resemble or
slightly underestimate the luminosity-weighted properties of the simulations
when clumping due to non-thermal velocity dispersion is taken into account. If
only modeling the first three rotational lines, the median values of the
marginalized parameter distributions better represent the luminosity-weighted
properties of the simulations, but the uncertainties in the fitted parameters
are nearly an order of magnitude, compared to approximately 0.2 dex in the
"best-case" scenario of a fully sampled SLED through J = 10-9. This study
demonstrates that while common CO SLED modeling techniques cannot reveal the
underlying complexities of the molecular gas, they can distinguish bulk
luminosity-weighted properties that vary with star formation surface densities
and galaxy evolution, if a sufficient number of lines are detected and modeled.
|
astro-ph.GA
|
modeling of the spectral line energy distribution sled of the co molecule can reveal the physical conditions temperature density of molecular gas in galactic clouds and other galaxies recently the herschel space observatory and alma have offered for the first time a comprehensive view of the rotational j 43 through j 1312 lines which arise from a complex diverse range of physical conditions that must be simplified to one two or three components when modeled here we investigate the recoverability of physical conditions from sleds produced by galaxy evolution simulations containing a large dynamical range in physical properties these simulated sleds were generally fit well by one component of gas whose properties largely resemble or slightly underestimate the luminosityweighted properties of the simulations when clumping due to nonthermal velocity dispersion is taken into account if only modeling the first three rotational lines the median values of the marginalized parameter distributions better represent the luminosityweighted properties of the simulations but the uncertainties in the fitted parameters are nearly an order of magnitude compared to approximately 02 dex in the bestcase scenario of a fully sampled sled through j 109 this study demonstrates that while common co sled modeling techniques cannot reveal the underlying complexities of the molecular gas they can distinguish bulk luminosityweighted properties that vary with star formation surface densities and galaxy evolution if a sufficient number of lines are detected and modeled
|
[['modeling', 'of', 'the', 'spectral', 'line', 'energy', 'distribution', 'sled', 'of', 'the', 'co', 'molecule', 'can', 'reveal', 'the', 'physical', 'conditions', 'temperature', 'density', 'of', 'molecular', 'gas', 'in', 'galactic', 'clouds', 'and', 'other', 'galaxies', 'recently', 'the', 'herschel', 'space', 'observatory', 'and', 'alma', 'have', 'offered', 'for', 'the', 'first', 'time', 'a', 'comprehensive', 'view', 'of', 'the', 'rotational', 'j', '43', 'through', 'j', '1312', 'lines', 'which', 'arise', 'from', 'a', 'complex', 'diverse', 'range', 'of', 'physical', 'conditions', 'that', 'must', 'be', 'simplified', 'to', 'one', 'two', 'or', 'three', 'components', 'when', 'modeled', 'here', 'we', 'investigate', 'the', 'recoverability', 'of', 'physical', 'conditions', 'from', 'sleds', 'produced', 'by', 'galaxy', 'evolution', 'simulations', 'containing', 'a', 'large', 'dynamical', 'range', 'in', 'physical', 'properties', 'these', 'simulated', 'sleds', 'were', 'generally', 'fit', 'well', 'by', 'one', 'component', 'of', 'gas', 'whose', 'properties', 'largely', 'resemble', 'or', 'slightly', 'underestimate', 'the', 'luminosityweighted', 'properties', 'of', 'the', 'simulations', 'when', 'clumping', 'due', 'to', 'nonthermal', 'velocity', 'dispersion', 'is', 'taken', 'into', 'account', 'if', 'only', 'modeling', 'the', 'first', 'three', 'rotational', 'lines', 'the', 'median', 'values', 'of', 'the', 'marginalized', 'parameter', 'distributions', 'better', 'represent', 'the', 'luminosityweighted', 'properties', 'of', 'the', 'simulations', 'but', 'the', 'uncertainties', 'in', 'the', 'fitted', 'parameters', 'are', 'nearly', 'an', 'order', 'of', 'magnitude', 'compared', 'to', 'approximately', '02', 'dex', 'in', 'the', 'bestcase', 'scenario', 'of', 'a', 'fully', 'sampled', 'sled', 'through', 'j', '109', 'this', 'study', 'demonstrates', 'that', 'while', 'common', 'co', 'sled', 'modeling', 'techniques', 'can', 'not', 'reveal', 'the', 'underlying', 'complexities', 'of', 'the', 'molecular', 'gas', 'they', 'can', 'distinguish', 'bulk', 'luminosityweighted', 'properties', 'that', 'vary', 'with', 'star', 'formation', 'surface', 'densities', 'and', 'galaxy', 'evolution', 'if', 'a', 'sufficient', 'number', 'of', 'lines', 'are', 'detected', 'and', 'modeled']]
|
[-0.06756527865261763, 0.10287627156752482, -0.06378816556718805, 0.06537605898502545, -0.028271418610840447, -0.06952075892910123, 0.01995531229240597, 0.416570540660849, -0.22165416315014863, -0.36954600929927367, 0.061772036276614435, -0.23949591608113077, -0.04130954585365482, 0.1737703314015212, 0.018603068615238253, -0.011924505441160534, 0.03881718398621067, -0.09051524576110144, -0.07048939465710288, -0.22826376625725503, 0.2999886704825709, 0.05983761370054677, 0.2063235883996772, -0.001651866560499383, 0.055870294448537514, -0.10698832032911511, -0.06390536528848843, 0.025535766960546557, -0.1696464890592946, 0.0521873589963294, 0.21596945559856698, 0.10753715814600706, 0.2159087843257679, -0.4007854089857294, -0.2755857911458414, 0.08614333117038457, 0.17250300973701554, 0.031935801282306164, 0.0009200328097974237, -0.246716911962224, 0.03854671440238499, -0.14973587435411495, -0.17658173337650412, -0.0028471825952824745, 0.007194223272431101, 0.06643178188426094, -0.23443960877429917, 0.12141316170748483, 0.014097440437713249, 0.09897100683162387, -0.10095313910800868, -0.14290454505711922, -0.12724306113902542, 0.11039877544544263, -0.005035423517473933, 0.003948298485901875, 0.18755659902106142, -0.1243860886629241, -0.02454731568522974, 0.4366157258608036, -0.07355337450728537, -0.11802737268540385, 0.23104781746211597, -0.19354105410544187, -0.17110911682128715, 0.18165307167248848, 0.1399758255425602, 0.08771279789049688, -0.16528411905152393, 0.019967052393541154, -0.031014496082953442, 0.22021090167845225, 0.03223678794426796, 0.056944533186675146, 0.27856916021162637, 0.08261939852387032, 0.005262483205589312, 0.0786419019364736, -0.17574441238330343, -0.11206300382534218, -0.23365659160244986, -0.10663463287334093, -0.16928441739943612, 0.08177618812288319, -0.11130713041982232, -0.10304037280157845, 0.36203867849559546, 0.13473224180101806, 0.25592170412349713, 0.027054623384267475, 0.3069609413241856, 0.10408294205747855, 0.06774766734725612, 0.08988204101721446, 0.249148124415511, 0.15014940122854856, 0.05717921736311868, -0.22601444574926668, 0.10149745841243933, -0.021509389251243707]
|
1,803.07085
|
Maximal extensions and singularities in inflationary spacetimes
|
Extendibility of inflationary spacetimes with flat spatial geometry is
investigated. We find that the past boundary of an inflationary spacetime
becomes a so-called parallely propagated curvature singularity if the ratio
$\dot{H}/a^2$ diverges at the boundary, where $\dot{H}$ and $a$ represent the
time derivative of the Hubble parameter and the scale factor, respectively. On
the other hand, if the ratio $\dot{H}/a^2$ converges, then the past boundary is
regular and continuously extendible. We also develop a method to judge the
continuous ($C^0$)extendibility of spacetime in the case of slow-roll inflation
driven by a canonical scalar field. As applications of this method, we find
that Starobinsky inflation has a $C^0$ parallely propagated curvature
singularity, but a small field inflation model with a Higgs-like potential does
not. We also find that an inflationary solution in a modified gravity theory
with limited curvature invariants is free of such a singularity and is smoothly
extendible.
|
gr-qc astro-ph.CO hep-th math-ph math.MP
|
extendibility of inflationary spacetimes with flat spatial geometry is investigated we find that the past boundary of an inflationary spacetime becomes a socalled parallely propagated curvature singularity if the ratio dotha2 diverges at the boundary where doth and a represent the time derivative of the hubble parameter and the scale factor respectively on the other hand if the ratio dotha2 converges then the past boundary is regular and continuously extendible we also develop a method to judge the continuous c0extendibility of spacetime in the case of slowroll inflation driven by a canonical scalar field as applications of this method we find that starobinsky inflation has a c0 parallely propagated curvature singularity but a small field inflation model with a higgslike potential does not we also find that an inflationary solution in a modified gravity theory with limited curvature invariants is free of such a singularity and is smoothly extendible
|
[['extendibility', 'of', 'inflationary', 'spacetimes', 'with', 'flat', 'spatial', 'geometry', 'is', 'investigated', 'we', 'find', 'that', 'the', 'past', 'boundary', 'of', 'an', 'inflationary', 'spacetime', 'becomes', 'a', 'socalled', 'parallely', 'propagated', 'curvature', 'singularity', 'if', 'the', 'ratio', 'dotha2', 'diverges', 'at', 'the', 'boundary', 'where', 'doth', 'and', 'a', 'represent', 'the', 'time', 'derivative', 'of', 'the', 'hubble', 'parameter', 'and', 'the', 'scale', 'factor', 'respectively', 'on', 'the', 'other', 'hand', 'if', 'the', 'ratio', 'dotha2', 'converges', 'then', 'the', 'past', 'boundary', 'is', 'regular', 'and', 'continuously', 'extendible', 'we', 'also', 'develop', 'a', 'method', 'to', 'judge', 'the', 'continuous', 'c0extendibility', 'of', 'spacetime', 'in', 'the', 'case', 'of', 'slowroll', 'inflation', 'driven', 'by', 'a', 'canonical', 'scalar', 'field', 'as', 'applications', 'of', 'this', 'method', 'we', 'find', 'that', 'starobinsky', 'inflation', 'has', 'a', 'c0', 'parallely', 'propagated', 'curvature', 'singularity', 'but', 'a', 'small', 'field', 'inflation', 'model', 'with', 'a', 'higgslike', 'potential', 'does', 'not', 'we', 'also', 'find', 'that', 'an', 'inflationary', 'solution', 'in', 'a', 'modified', 'gravity', 'theory', 'with', 'limited', 'curvature', 'invariants', 'is', 'free', 'of', 'such', 'a', 'singularity', 'and', 'is', 'smoothly', 'extendible']]
|
[-0.17290017586871217, 0.1442986590907772, -0.13511490867367934, 0.06733802428440357, -0.10848223841238817, -0.2033732100979948, -0.0657809258810219, 0.33222448449479797, -0.24740961861911498, -0.20559208174092594, 0.11289247330469526, -0.2353896470612859, -0.15135693006306786, 0.13782336909247384, -0.06235676867670494, 0.015140567965604595, 0.025261399622413343, 0.10583462369028632, -0.07389307234273611, -0.24547676937271878, 0.3643432821207744, 0.061518786634535416, 0.20477030278910716, 0.04270631175692359, 0.1127022615385127, -0.07381538950761601, 0.032691056466954825, 0.06797066670268366, -0.2013470007557472, 0.041238316089195544, 0.15262031362851292, 0.11095191728027078, 0.27216153128761544, -0.37910277222933836, -0.2669714708136369, 0.15806390406653184, 0.1393552540134868, 0.11199866139572369, -0.03286799658743716, -0.27572602075556524, 0.06186641032051228, -0.14084522208607156, -0.15897911576209717, -0.052510572828620365, 0.02826779071171449, -0.06714585627595039, -0.27256764948355316, 0.09283475489443334, 0.0015294583871552389, -0.009098272512296904, -0.07280232458955876, -0.0023649025338459504, -0.06583931376800349, 0.027747023372260267, 0.11601267285463208, 0.09048156716146391, 0.12771901375397224, -0.14331435500676043, -0.05750481459736339, 0.3528327642595523, -0.14146813408516296, -0.20425347492660154, 0.10587446716588551, -0.16836727377384492, -0.12149747240369858, 0.08823561529717988, 0.09217102987945322, 0.1448195689128176, -0.08031635931756807, 0.2143946160380537, 0.03905270720611977, 0.1728390823564913, 0.12200275254244469, -0.02982420778246469, 0.2566598118314749, 0.10779922674346255, 0.10339589965568013, 0.11950592116224706, -0.059309131669977755, -0.11417117116977588, -0.4000144137375771, -0.15188167916215345, -0.17801332231196385, 0.07450943017764773, -0.18382126799655427, -0.2501379944709423, 0.39197594729213886, 0.12375536014338674, 0.21165942799057558, 0.06169277467216327, 0.26956668912037596, 0.11992670443109939, 0.04120993970140611, 0.12062272076711875, 0.2857249186323216, 0.09039408970011832, 0.12988902069149819, -0.18102570098493095, -0.029468509850207054, 0.06023567904756494]
|
1,803.07086
|
Cosmological Aspects of the Clockwork Axion
|
The clockwork axion refers to a family of aligned multi-axion models that
lead to an exponential hierarchy between the scale of Peccei-Quinn symmetry
breaking and the scale of the axion decay constant. The clockworking can bring
the Peccei-Quinn-scale particles to within reach of collider experiments.In
this work we are interested in whether cosmological observations impose any new
constraints on the clockwork axion. If the universe reheats above the scale of
Peccei-Quinn breaking, then the ensuing cosmological phase transition produces
a network of topological defects, which have a qualitatively different behavior
from the string-wall network in the usual axion models. We estimate the relic
abundances of axion dark matter and dark radiation that arise from the emission
of axions by the defect network, and we infer a constraint on the scale of
Peccei-Quinn breaking and the mass spectrum. We find that the defect
contribution to the axion dark matter relic abundance is generally negligible.
However, the defect production of relativistic axion dark radiation becomes
significant if the scale of Peccei-Quinn symmetry breaking is larger than $100
\, {\rm TeV}$, and measurements of $\Delta N_{\rm eff}$ provide a new probe of
this class of models.
|
hep-ph astro-ph.CO
|
the clockwork axion refers to a family of aligned multiaxion models that lead to an exponential hierarchy between the scale of pecceiquinn symmetry breaking and the scale of the axion decay constant the clockworking can bring the pecceiquinnscale particles to within reach of collider experimentsin this work we are interested in whether cosmological observations impose any new constraints on the clockwork axion if the universe reheats above the scale of pecceiquinn breaking then the ensuing cosmological phase transition produces a network of topological defects which have a qualitatively different behavior from the stringwall network in the usual axion models we estimate the relic abundances of axion dark matter and dark radiation that arise from the emission of axions by the defect network and we infer a constraint on the scale of pecceiquinn breaking and the mass spectrum we find that the defect contribution to the axion dark matter relic abundance is generally negligible however the defect production of relativistic axion dark radiation becomes significant if the scale of pecceiquinn symmetry breaking is larger than 100 rm tev and measurements of delta n_rm eff provide a new probe of this class of models
|
[['the', 'clockwork', 'axion', 'refers', 'to', 'a', 'family', 'of', 'aligned', 'multiaxion', 'models', 'that', 'lead', 'to', 'an', 'exponential', 'hierarchy', 'between', 'the', 'scale', 'of', 'pecceiquinn', 'symmetry', 'breaking', 'and', 'the', 'scale', 'of', 'the', 'axion', 'decay', 'constant', 'the', 'clockworking', 'can', 'bring', 'the', 'pecceiquinnscale', 'particles', 'to', 'within', 'reach', 'of', 'collider', 'experimentsin', 'this', 'work', 'we', 'are', 'interested', 'in', 'whether', 'cosmological', 'observations', 'impose', 'any', 'new', 'constraints', 'on', 'the', 'clockwork', 'axion', 'if', 'the', 'universe', 'reheats', 'above', 'the', 'scale', 'of', 'pecceiquinn', 'breaking', 'then', 'the', 'ensuing', 'cosmological', 'phase', 'transition', 'produces', 'a', 'network', 'of', 'topological', 'defects', 'which', 'have', 'a', 'qualitatively', 'different', 'behavior', 'from', 'the', 'stringwall', 'network', 'in', 'the', 'usual', 'axion', 'models', 'we', 'estimate', 'the', 'relic', 'abundances', 'of', 'axion', 'dark', 'matter', 'and', 'dark', 'radiation', 'that', 'arise', 'from', 'the', 'emission', 'of', 'axions', 'by', 'the', 'defect', 'network', 'and', 'we', 'infer', 'a', 'constraint', 'on', 'the', 'scale', 'of', 'pecceiquinn', 'breaking', 'and', 'the', 'mass', 'spectrum', 'we', 'find', 'that', 'the', 'defect', 'contribution', 'to', 'the', 'axion', 'dark', 'matter', 'relic', 'abundance', 'is', 'generally', 'negligible', 'however', 'the', 'defect', 'production', 'of', 'relativistic', 'axion', 'dark', 'radiation', 'becomes', 'significant', 'if', 'the', 'scale', 'of', 'pecceiquinn', 'symmetry', 'breaking', 'is', 'larger', 'than', '100', 'rm', 'tev', 'and', 'measurements', 'of', 'delta', 'n_rm', 'eff', 'provide', 'a', 'new', 'probe', 'of', 'this', 'class', 'of', 'models']]
|
[-0.14717636675402326, 0.23835287594648483, -0.0829489332636034, 0.15055973969497963, -0.12134630935523953, -0.11619450738776083, 0.003409067087953812, 0.29776964520937516, -0.252335013628104, -0.37863628486367434, 0.056825691399066465, -0.231123356158404, -0.021427751226215867, 0.11303498188131735, 0.043181778028558354, -0.006083688165036667, -0.022451369937411265, 0.016248017984693625, -0.042471412803340505, -0.2034828761469965, 0.33248116321766774, 0.0668731159175207, 0.21751742162006465, 0.0734487038742947, 0.061075481103341045, -0.11659719783469642, 0.0149474411973068, -0.055462328287601274, -0.15026121746536533, 0.07892475211747775, 0.13815359039809233, 0.11831495331134648, 0.14679366797698956, -0.42409801889995213, -0.21527927216926687, 0.19817702644259522, 0.14847268652121878, 0.14515766335810584, -0.08821688250203519, -0.31136853749324617, 0.08083421508046357, -0.18676235701300595, -0.09310285677692216, -0.001761380076947573, -0.025112661207094787, -0.07917031048441697, -0.27719631881306045, 0.11466544127385868, -0.023283216634789775, -0.04424919076999159, -0.05489779258220408, -0.0658406027960346, -0.05273065221691994, -0.01475238102904864, 0.1686250480431083, 0.01687529694141918, 0.2057243939525889, -0.21308519134518544, -0.08043810628403567, 0.47962030862108807, -0.13256489378070815, -0.08877374517584317, 0.10974990426268624, -0.13536841971707825, -0.20198885179860027, 0.14624385169927814, 0.15631695919621147, 0.07699414236642617, -0.0861135051144581, 0.16140455022595185, -0.046804822513245435, 0.23602170014484344, 0.05105049841865701, 0.05768488580606094, 0.3351398395619502, 0.19153715373678623, 0.09391817249737582, 0.051532104801337575, -0.08058744039337494, -0.06422100730338379, -0.37088992409653176, -0.11481484588431684, -0.13765931617419577, 0.06641841227384775, -0.12876457856366055, -0.13940360846831218, 0.3734592521857274, 0.168818558051594, 0.2231015123868067, 0.047334914145329476, 0.25050012037635927, 0.0824673306972009, 0.08983962666810073, 0.02593152440002948, 0.324207836075833, 0.10993341650250123, 0.10520837555002226, -0.279127027786729, -0.030232400855809253, 0.026052133359113022]
|
1,803.07087
|
Confronting phantom inflation with Planck data
|
The latest Planck results are in excellent agreement with the theoretical
expectations predicted from standard normal inflation based on slow-roll
approximation which assumes equation-of-state $\omega \geq-1$. In this work, we
study the phantom inflation ($\omega<-1$) as an alternative cosmological model
within the slow-climb approximation using two hybrid inflationary fields. We
perform Chain Monte Carlo analysis to determine the posterior distribution and
best fit values for the cosmological parameters using Planck data and show that
current CMB data does not discriminate between normal and phantom inflation.
Interestingly, unlike in normal inflation, $\omega$ in phantom induced
inflation evolves very slowly away from $-1$ during the inflation. Furthermore,
in contrast to the standard normal inflation for which only upper bound on
tensor-to-scalar ratio $r$ are possible, we obtain both upper and lower bounds
for the two hybrid fields in the phantom scenario. Finally, we discuss
prospects of future high precision polarization measurements and show that it
may be possible to establish the dominance of one model over the other.
|
astro-ph.CO
|
the latest planck results are in excellent agreement with the theoretical expectations predicted from standard normal inflation based on slowroll approximation which assumes equationofstate omega geq1 in this work we study the phantom inflation omega1 as an alternative cosmological model within the slowclimb approximation using two hybrid inflationary fields we perform chain monte carlo analysis to determine the posterior distribution and best fit values for the cosmological parameters using planck data and show that current cmb data does not discriminate between normal and phantom inflation interestingly unlike in normal inflation omega in phantom induced inflation evolves very slowly away from 1 during the inflation furthermore in contrast to the standard normal inflation for which only upper bound on tensortoscalar ratio r are possible we obtain both upper and lower bounds for the two hybrid fields in the phantom scenario finally we discuss prospects of future high precision polarization measurements and show that it may be possible to establish the dominance of one model over the other
|
[['the', 'latest', 'planck', 'results', 'are', 'in', 'excellent', 'agreement', 'with', 'the', 'theoretical', 'expectations', 'predicted', 'from', 'standard', 'normal', 'inflation', 'based', 'on', 'slowroll', 'approximation', 'which', 'assumes', 'equationofstate', 'omega', 'geq1', 'in', 'this', 'work', 'we', 'study', 'the', 'phantom', 'inflation', 'omega1', 'as', 'an', 'alternative', 'cosmological', 'model', 'within', 'the', 'slowclimb', 'approximation', 'using', 'two', 'hybrid', 'inflationary', 'fields', 'we', 'perform', 'chain', 'monte', 'carlo', 'analysis', 'to', 'determine', 'the', 'posterior', 'distribution', 'and', 'best', 'fit', 'values', 'for', 'the', 'cosmological', 'parameters', 'using', 'planck', 'data', 'and', 'show', 'that', 'current', 'cmb', 'data', 'does', 'not', 'discriminate', 'between', 'normal', 'and', 'phantom', 'inflation', 'interestingly', 'unlike', 'in', 'normal', 'inflation', 'omega', 'in', 'phantom', 'induced', 'inflation', 'evolves', 'very', 'slowly', 'away', 'from', '1', 'during', 'the', 'inflation', 'furthermore', 'in', 'contrast', 'to', 'the', 'standard', 'normal', 'inflation', 'for', 'which', 'only', 'upper', 'bound', 'on', 'tensortoscalar', 'ratio', 'r', 'are', 'possible', 'we', 'obtain', 'both', 'upper', 'and', 'lower', 'bounds', 'for', 'the', 'two', 'hybrid', 'fields', 'in', 'the', 'phantom', 'scenario', 'finally', 'we', 'discuss', 'prospects', 'of', 'future', 'high', 'precision', 'polarization', 'measurements', 'and', 'show', 'that', 'it', 'may', 'be', 'possible', 'to', 'establish', 'the', 'dominance', 'of', 'one', 'model', 'over', 'the', 'other']]
|
[-0.09349807842041959, 0.13619683609620992, -0.10051282177199468, 0.1296297678565183, -0.08250125822695818, -0.1738323737754289, 0.016793329629934194, 0.35252390512914367, -0.2186160774449959, -0.33229632067465875, 0.08345540387866397, -0.24797765192660418, -0.07525324166441957, 0.21849732880452366, 0.0009144415151130295, 0.020901721512112118, 0.053612002872184594, 0.03873218441748935, -0.05435396480924365, -0.25118545187129215, 0.2700854131712042, 0.09779705162244764, 0.28276723555543204, -0.027318281022775354, 0.01899152234140219, -0.06855929305099628, -0.0033226256851445544, -0.015303809268251908, -0.2491008975658615, 0.05667233860515284, 0.17553882492057077, 0.15365286153374297, 0.18417377159648546, -0.4217671613434725, -0.22327308669389986, 0.17785740782026993, 0.13830344623349833, 0.11146728168382788, -0.03111399288825465, -0.24275429264331858, 0.06565050168604956, -0.17443950711361442, -0.06877210017463023, -0.08035603487073924, -0.04119648573299249, -0.03577377972701056, -0.3220033683419002, 0.12328761037100446, -0.024579779641476996, -0.012581391195470299, -0.08671629053159532, -0.13072582921154347, -0.014987562478265978, 0.02143252718572815, 0.09962630897661615, 0.04676873678143954, 0.10795725694307211, -0.16356420150718115, -0.08324524690255974, 0.3363280538695328, -0.20066066643004446, -0.12900914393337162, 0.12425266296715673, -0.1941509529327353, -0.14949402498984427, 0.05047582127153873, 0.10486141016960822, 0.07761717303797151, -0.09155012491356694, 0.1520678604766021, 0.04225412388120524, 0.1579094012437219, 0.08225457626677146, -0.036235653019596636, 0.2666134999556975, 0.1415429747465885, 0.03386653149782708, 0.09616441726790402, -0.09295822149283732, -0.1282104385233569, -0.37496127394789996, -0.0896414211404397, -0.17459360193955062, 0.02349827686601643, -0.1647296383323423, -0.16795971112411334, 0.35628635960094857, 0.19501346479378712, 0.2432430704378269, 0.09885403059324194, 0.321519916958994, 0.06469500755580763, -0.01470997142182155, 0.052105037173764274, 0.3435675125117555, 0.09230117805189256, 0.07395947087542012, -0.18285388690842824, 0.016643362712453712, -0.02682616216638549]
|
1,803.07088
|
Interferometric Imaging Directly with Closure Phases and Closure
Amplitudes
|
Interferometric imaging now achieves angular resolutions as fine as 10
microarcsec, probing scales that are inaccessible to single telescopes.
Traditional synthesis imaging methods require calibrated visibilities; however,
interferometric calibration is challenging, especially at high frequencies.
Nevertheless, most studies present only a single image of their data after a
process of "self-calibration," an iterative procedure where the initial image
and calibration assumptions can significantly influence the final image. We
present a method for efficient interferometric imaging directly using only
closure amplitudes and closure phases, which are immune to station-based
calibration errors. Closure-only imaging provides results that are as
non-committal as possible and allows for reconstructing an image independently
from separate amplitude and phase self-calibration. While closure-only imaging
eliminates some image information (e.g., the total image flux density and the
image centroid), this information can be recovered through a small number of
additional constraints. We demonstrate that closure-only imaging can produce
high fidelity results, even for sparse arrays such as the Event Horizon
Telescope, and that the resulting images are independent of the level of
systematic amplitude error. We apply closure imaging to VLBA and ALMA data and
show that it is capable of matching or exceeding the performance of traditional
self-calibration and CLEAN for these data sets.
|
astro-ph.IM astro-ph.HE
|
interferometric imaging now achieves angular resolutions as fine as 10 microarcsec probing scales that are inaccessible to single telescopes traditional synthesis imaging methods require calibrated visibilities however interferometric calibration is challenging especially at high frequencies nevertheless most studies present only a single image of their data after a process of selfcalibration an iterative procedure where the initial image and calibration assumptions can significantly influence the final image we present a method for efficient interferometric imaging directly using only closure amplitudes and closure phases which are immune to stationbased calibration errors closureonly imaging provides results that are as noncommittal as possible and allows for reconstructing an image independently from separate amplitude and phase selfcalibration while closureonly imaging eliminates some image information eg the total image flux density and the image centroid this information can be recovered through a small number of additional constraints we demonstrate that closureonly imaging can produce high fidelity results even for sparse arrays such as the event horizon telescope and that the resulting images are independent of the level of systematic amplitude error we apply closure imaging to vlba and alma data and show that it is capable of matching or exceeding the performance of traditional selfcalibration and clean for these data sets
|
[['interferometric', 'imaging', 'now', 'achieves', 'angular', 'resolutions', 'as', 'fine', 'as', '10', 'microarcsec', 'probing', 'scales', 'that', 'are', 'inaccessible', 'to', 'single', 'telescopes', 'traditional', 'synthesis', 'imaging', 'methods', 'require', 'calibrated', 'visibilities', 'however', 'interferometric', 'calibration', 'is', 'challenging', 'especially', 'at', 'high', 'frequencies', 'nevertheless', 'most', 'studies', 'present', 'only', 'a', 'single', 'image', 'of', 'their', 'data', 'after', 'a', 'process', 'of', 'selfcalibration', 'an', 'iterative', 'procedure', 'where', 'the', 'initial', 'image', 'and', 'calibration', 'assumptions', 'can', 'significantly', 'influence', 'the', 'final', 'image', 'we', 'present', 'a', 'method', 'for', 'efficient', 'interferometric', 'imaging', 'directly', 'using', 'only', 'closure', 'amplitudes', 'and', 'closure', 'phases', 'which', 'are', 'immune', 'to', 'stationbased', 'calibration', 'errors', 'closureonly', 'imaging', 'provides', 'results', 'that', 'are', 'as', 'noncommittal', 'as', 'possible', 'and', 'allows', 'for', 'reconstructing', 'an', 'image', 'independently', 'from', 'separate', 'amplitude', 'and', 'phase', 'selfcalibration', 'while', 'closureonly', 'imaging', 'eliminates', 'some', 'image', 'information', 'eg', 'the', 'total', 'image', 'flux', 'density', 'and', 'the', 'image', 'centroid', 'this', 'information', 'can', 'be', 'recovered', 'through', 'a', 'small', 'number', 'of', 'additional', 'constraints', 'we', 'demonstrate', 'that', 'closureonly', 'imaging', 'can', 'produce', 'high', 'fidelity', 'results', 'even', 'for', 'sparse', 'arrays', 'such', 'as', 'the', 'event', 'horizon', 'telescope', 'and', 'that', 'the', 'resulting', 'images', 'are', 'independent', 'of', 'the', 'level', 'of', 'systematic', 'amplitude', 'error', 'we', 'apply', 'closure', 'imaging', 'to', 'vlba', 'and', 'alma', 'data', 'and', 'show', 'that', 'it', 'is', 'capable', 'of', 'matching', 'or', 'exceeding', 'the', 'performance', 'of', 'traditional', 'selfcalibration', 'and', 'clean', 'for', 'these', 'data', 'sets']]
|
[-0.07361444408973697, 0.07745102034936528, -0.07361649917845514, 0.08091613029567102, -0.08468803487496578, -0.1375413997092022, 0.01330630208175738, 0.44027212622023904, -0.2468598482896375, -0.37375160281374614, 0.18289187877185786, -0.2507544869740829, -0.09961403587163942, 0.24401762314904843, -0.08600622610623035, 0.075556095677385, 0.16084338495625383, -0.04884593359655836, -0.09164925431747903, -0.18641588329654007, 0.2479671811757302, 0.09583145507511873, 0.27314439070528573, -0.017701949116104797, 0.14719436444891437, 0.009841227447342815, -0.07979937161003055, 0.0310310723273608, -0.06269197868163053, 0.07412531885580675, 0.3079386501001122, 0.19240958433853575, 0.19938940521401977, -0.40448343355516064, -0.20159915506102832, 0.07820031743685125, 0.1648500971611249, 0.11421349842439844, -0.03726060262619002, -0.27668462275048195, 0.06223853853547005, -0.0952696646495894, -0.06676700492279301, -0.12214915970683966, -0.019156787573310175, 0.002801962127599377, -0.3040361628557998, 0.09252504529476673, -0.002199814600634922, 0.06310818878847889, -0.058782989321134134, -0.11157289992800905, -0.0001151570129135931, 0.15373647533689436, -0.04329788620096012, 0.06683116497144723, 0.14531918498461396, -0.1733568958764064, -0.07324468401753462, 0.3372500029039904, -0.052677519766396834, -0.15459852456341236, 0.17317573188406243, -0.1452875198645645, -0.14381945517266767, 0.18153301637294222, 0.13913679613564525, 0.09980516278894745, -0.14393972574498107, 0.01604775498475364, 0.015990477436769176, 0.24123346729733014, 0.08945563482346683, 0.09519199788846185, 0.19533121944472953, 0.18187646250999465, 0.07075696317388595, 0.09954003148511034, -0.2740317051484277, 0.011331402061188376, -0.25850214795164256, -0.09741448508394719, -0.19590258413419417, 0.018977773836949496, -0.10136332248897886, -0.1363023350578145, 0.3513355343919067, 0.2172458272396804, 0.17824603474780337, 0.06207426486014687, 0.4091080959199123, 0.05174841671827186, 0.11667333731486562, 0.0020385725667826757, 0.2577685096660839, 0.07138781032628985, 0.07121819401644758, -0.18733644186975706, 0.035089677940032364, -0.014366212232011252]
|
1,803.07089
|
Device-independent quantum key distribution with single-photon sources
|
Device-independent quantum key distribution protocols allow two honest users
to establish a secret key with minimal levels of trust on the provider, as
security is proven without any assumption on the inner working of the devices
used for the distribution. Unfortunately, the implementation of these protocols
is challenging, as it requires the observation of a large Bell-inequality
violation between the two distant users. Here, we introduce novel photonic
protocols for device-independent quantum key distribution exploiting
single-photon sources and heralding-type architectures. The heralding process
is designed so that transmission losses become irrelevant for security. We then
show how the use of single-photon sources for entanglement distribution in
these architectures, instead of standard entangled-pair generation schemes,
provides significant improvements on the attainable key rates and distances
over previous proposals. Given the current progress in single-photon sources,
our work opens up a promising avenue for device-independent quantum key
distribution implementations.
|
quant-ph
|
deviceindependent quantum key distribution protocols allow two honest users to establish a secret key with minimal levels of trust on the provider as security is proven without any assumption on the inner working of the devices used for the distribution unfortunately the implementation of these protocols is challenging as it requires the observation of a large bellinequality violation between the two distant users here we introduce novel photonic protocols for deviceindependent quantum key distribution exploiting singlephoton sources and heraldingtype architectures the heralding process is designed so that transmission losses become irrelevant for security we then show how the use of singlephoton sources for entanglement distribution in these architectures instead of standard entangledpair generation schemes provides significant improvements on the attainable key rates and distances over previous proposals given the current progress in singlephoton sources our work opens up a promising avenue for deviceindependent quantum key distribution implementations
|
[['deviceindependent', 'quantum', 'key', 'distribution', 'protocols', 'allow', 'two', 'honest', 'users', 'to', 'establish', 'a', 'secret', 'key', 'with', 'minimal', 'levels', 'of', 'trust', 'on', 'the', 'provider', 'as', 'security', 'is', 'proven', 'without', 'any', 'assumption', 'on', 'the', 'inner', 'working', 'of', 'the', 'devices', 'used', 'for', 'the', 'distribution', 'unfortunately', 'the', 'implementation', 'of', 'these', 'protocols', 'is', 'challenging', 'as', 'it', 'requires', 'the', 'observation', 'of', 'a', 'large', 'bellinequality', 'violation', 'between', 'the', 'two', 'distant', 'users', 'here', 'we', 'introduce', 'novel', 'photonic', 'protocols', 'for', 'deviceindependent', 'quantum', 'key', 'distribution', 'exploiting', 'singlephoton', 'sources', 'and', 'heraldingtype', 'architectures', 'the', 'heralding', 'process', 'is', 'designed', 'so', 'that', 'transmission', 'losses', 'become', 'irrelevant', 'for', 'security', 'we', 'then', 'show', 'how', 'the', 'use', 'of', 'singlephoton', 'sources', 'for', 'entanglement', 'distribution', 'in', 'these', 'architectures', 'instead', 'of', 'standard', 'entangledpair', 'generation', 'schemes', 'provides', 'significant', 'improvements', 'on', 'the', 'attainable', 'key', 'rates', 'and', 'distances', 'over', 'previous', 'proposals', 'given', 'the', 'current', 'progress', 'in', 'singlephoton', 'sources', 'our', 'work', 'opens', 'up', 'a', 'promising', 'avenue', 'for', 'deviceindependent', 'quantum', 'key', 'distribution', 'implementations']]
|
[-0.15194746690215416, 0.0693143018974272, -0.06308090728580033, 0.06412202177483005, -0.015317852104924722, -0.24813072140047915, 0.10292759412829446, 0.3993797852906513, -0.22470716139212352, -0.2882464585047572, 0.03601683507998767, -0.23660200367496692, -0.07209363979150299, 0.2719527151920412, -0.09831931351122689, 0.18086646429633033, 0.046939662357868804, -0.04313438749483034, -0.02543940699072427, -0.28131908787516496, 0.3504499170398148, 0.07967729571718749, 0.38176596710420124, 0.08080605042090461, 0.11021361973181316, 0.0027730182476647914, -0.019825732329069343, -0.11657423904238984, -0.10747351024918017, 0.1758291826659992, 0.2934314642828723, 0.1734042511447588, 0.3295798193510265, -0.41639748477211147, -0.20879427291459263, 0.10647988158010252, 0.15126495733968787, 0.1585441561597591, -0.08956477333144093, -0.3167554105277977, 0.05871173443770266, -0.20563920280156173, -0.09031184692219241, -0.09321427318932926, -0.04514985364201568, -0.011458987252123347, -0.24846370001833834, 0.025330125587061048, 0.024856355706517255, 0.01758541820621858, 0.07006977510840667, -0.05833952489615201, 0.08019482981802717, 0.19281386751490198, -0.05235900653367511, -0.02763258670903232, 0.144473610211033, -0.13897344991819907, -0.21294030669936273, 0.3588135182500294, -0.026612202618558164, -0.17188618962225594, 0.15997611337073453, -0.06651801583101999, -0.1563989680295504, 0.04675856552227107, 0.1587739044940737, 0.09299521904744923, -0.14235601555045746, 0.02692401736946011, -0.004381662158116902, 0.2049330584960033, 0.0520981599270583, 0.20183177807444885, 0.2232348645514209, 0.1536665752287699, 0.12479204770332292, 0.12380514590209987, -0.10126895455751976, -0.13419343016671706, -0.3220873330376902, -0.2047025865053101, -0.2237982265236596, 0.08481902530901644, -0.09405398637049174, -0.10268630406999489, 0.36227867030219674, 0.22844448768253095, 0.12187941554831723, 0.039691400463247914, 0.38608839655652233, 0.047834266477092234, 0.10788159238091631, 0.11475898686171293, 0.23526659544416997, 0.08453125321650751, 0.09060800388018435, -0.1470523369753708, 0.17096635458308387, -0.040575023940668684]
|
1,803.0709
|
Black Hole Disks in Galactic Nuclei
|
Gravitational torques among objects orbiting a supermassive black hole drive
the rapid reorientation of orbital planes in nuclear star clusters (NSCs), a
process known as vector resonant relaxation. In this Letter, we determine the
statistical equilibrium of systems with a distribution of masses, semimajor
axes, and eccentricities. We average the interaction over the apsidal
precession time and construct a Monte Carlo Markov chain method to sample the
microcanonical ensemble of the NSC. We examine the case of NSCs formed by 16
episodes of star formation or globular cluster infall. We find that the massive
stars and stellar mass black holes form a warped disk, while low mass stars
resemble a spherical distribution with a possible net rotation. This explains
the origin of the clockwise disk in the Galactic center and predicts a
population of black holes (BHs) embedded within this structure. The rate of
mergers among massive stars, tidal disruption events of massive stars by BHs,
and BH-BH mergers are highly increased in such disks. The first two may explain
the origin of the observed G1 and G2 clouds, the latter may be important for
gravitational wave detections with LIGO and VIRGO. More generally, black holes
are expected to settle in disks in all dense spherical stellar systems
assembled by mergers of smaller systems including globular clusters.
|
astro-ph.GA astro-ph.HE cond-mat.stat-mech gr-qc
|
gravitational torques among objects orbiting a supermassive black hole drive the rapid reorientation of orbital planes in nuclear star clusters nscs a process known as vector resonant relaxation in this letter we determine the statistical equilibrium of systems with a distribution of masses semimajor axes and eccentricities we average the interaction over the apsidal precession time and construct a monte carlo markov chain method to sample the microcanonical ensemble of the nsc we examine the case of nscs formed by 16 episodes of star formation or globular cluster infall we find that the massive stars and stellar mass black holes form a warped disk while low mass stars resemble a spherical distribution with a possible net rotation this explains the origin of the clockwise disk in the galactic center and predicts a population of black holes bhs embedded within this structure the rate of mergers among massive stars tidal disruption events of massive stars by bhs and bhbh mergers are highly increased in such disks the first two may explain the origin of the observed g1 and g2 clouds the latter may be important for gravitational wave detections with ligo and virgo more generally black holes are expected to settle in disks in all dense spherical stellar systems assembled by mergers of smaller systems including globular clusters
|
[['gravitational', 'torques', 'among', 'objects', 'orbiting', 'a', 'supermassive', 'black', 'hole', 'drive', 'the', 'rapid', 'reorientation', 'of', 'orbital', 'planes', 'in', 'nuclear', 'star', 'clusters', 'nscs', 'a', 'process', 'known', 'as', 'vector', 'resonant', 'relaxation', 'in', 'this', 'letter', 'we', 'determine', 'the', 'statistical', 'equilibrium', 'of', 'systems', 'with', 'a', 'distribution', 'of', 'masses', 'semimajor', 'axes', 'and', 'eccentricities', 'we', 'average', 'the', 'interaction', 'over', 'the', 'apsidal', 'precession', 'time', 'and', 'construct', 'a', 'monte', 'carlo', 'markov', 'chain', 'method', 'to', 'sample', 'the', 'microcanonical', 'ensemble', 'of', 'the', 'nsc', 'we', 'examine', 'the', 'case', 'of', 'nscs', 'formed', 'by', '16', 'episodes', 'of', 'star', 'formation', 'or', 'globular', 'cluster', 'infall', 'we', 'find', 'that', 'the', 'massive', 'stars', 'and', 'stellar', 'mass', 'black', 'holes', 'form', 'a', 'warped', 'disk', 'while', 'low', 'mass', 'stars', 'resemble', 'a', 'spherical', 'distribution', 'with', 'a', 'possible', 'net', 'rotation', 'this', 'explains', 'the', 'origin', 'of', 'the', 'clockwise', 'disk', 'in', 'the', 'galactic', 'center', 'and', 'predicts', 'a', 'population', 'of', 'black', 'holes', 'bhs', 'embedded', 'within', 'this', 'structure', 'the', 'rate', 'of', 'mergers', 'among', 'massive', 'stars', 'tidal', 'disruption', 'events', 'of', 'massive', 'stars', 'by', 'bhs', 'and', 'bhbh', 'mergers', 'are', 'highly', 'increased', 'in', 'such', 'disks', 'the', 'first', 'two', 'may', 'explain', 'the', 'origin', 'of', 'the', 'observed', 'g1', 'and', 'g2', 'clouds', 'the', 'latter', 'may', 'be', 'important', 'for', 'gravitational', 'wave', 'detections', 'with', 'ligo', 'and', 'virgo', 'more', 'generally', 'black', 'holes', 'are', 'expected', 'to', 'settle', 'in', 'disks', 'in', 'all', 'dense', 'spherical', 'stellar', 'systems', 'assembled', 'by', 'mergers', 'of', 'smaller', 'systems', 'including', 'globular', 'clusters']]
|
[-0.16840261995979083, 0.15308233049230366, -0.03634306795955185, 0.16280639505695046, -0.07786055800316143, -0.0029190948945448697, 0.027343659526518276, 0.3708019691008714, -0.14314020616334996, -0.3308666696265546, 0.032502546396818925, -0.2902416884126614, -0.04604607510534952, 0.1895672751489752, -0.016309707824136495, -0.015863639238711084, 0.10317672945104094, -0.0475563334326865, -0.07503537528891725, -0.27204046611221344, 0.3269551302851414, 0.05712762376302124, 0.0846604222114185, -0.1198757036164197, 0.06349785302332195, -0.04936129618318073, 0.014673401882726063, -0.03772651584344714, -0.1684334797191947, 0.03665251979949854, 0.2223744479693099, 0.14358155936440495, 0.20717192757960565, -0.40465776857898933, -0.20261036593430518, 0.07739108225195518, 0.22920407136807794, 0.11713542653385052, -0.14263752746120287, -0.24780771591752115, 0.08414759061273513, -0.2740399522732617, -0.19634031659541523, 0.0543099323068724, 0.09212435948692503, 0.04851953241912957, -0.21329173683816532, 0.1833615693390318, 0.10382620280625703, -0.009392853113844099, -0.13568324646762303, -0.06403184664963577, -0.08688479029328867, 0.05789518577887887, 0.08296471011375875, 0.06855293380714575, 0.2547585104982699, -0.09009281385792978, -0.10058755848196245, 0.4029470199363924, -0.02250761243735745, -0.05760336635325293, 0.2454196177412271, -0.29304330128841616, -0.1711229808834566, 0.10880304419345432, 0.21732066337379716, 0.17946738549529614, -0.18398198291022558, -0.006239492569171313, 0.027909272208808244, 0.18257769837134308, 0.09482344230830085, 0.04043098500273126, 0.4662023118701399, 0.13133229837433139, 0.01735996128508418, 0.10110528741733596, -0.17063237730336422, -0.10516874767943984, -0.16650207083852542, -0.11490804525542885, -0.14188946813424355, 0.09243619926873335, -0.16997291053671332, -0.13954891914218526, 0.27642968507196053, 0.05428242546649884, 0.22401634838286152, 0.031514360157403803, 0.2673913572280616, 0.042641310641984134, 0.11835856843430738, 0.14484141577970802, 0.321640690803648, 0.20086266564887686, 0.042402540687106825, -0.28147495775118747, 0.05199175998826044, 0.003427462183713724]
|
1,803.07091
|
Spin-Dependent Conductance in a Junction with Dresselhaus Spin-Orbit
Coupling
|
We studied spin-dependent conductance in a normal metal (NM)/NM junction with
Dresselhaus spin-orbit coupling (DSOC) and magnetization. As a reference, we
also studied the spin-dependent conductance in such a junction with Rashba
spin-orbit coupling (RSOC). Using a standard scattering method, we calculated
the gate-voltage dependence of the spin-dependent conductances in DSOC and
RSOC. In addition, we calculated the gate-voltage dependence of the
conductances in a ferromagnetic metal (FM)/NM junction with spin-orbit coupling
and magnetization, which we call ferromagnetic spin-orbit metal (FSOM). From
these results, we discuss the relation between these conductance in the
presence of DSOC and that in the presence of RSOC. We found that conductance in
DSOC is the same as that in RSOC for the NM/FSOM junction. In addition, we
found that in the FM/FSOM junction, the conductance in DSOC is the same as that
in RSOC only when the FM magnetization is along the out-of-plane direction.
|
cond-mat.mes-hall
|
we studied spindependent conductance in a normal metal nmnm junction with dresselhaus spinorbit coupling dsoc and magnetization as a reference we also studied the spindependent conductance in such a junction with rashba spinorbit coupling rsoc using a standard scattering method we calculated the gatevoltage dependence of the spindependent conductances in dsoc and rsoc in addition we calculated the gatevoltage dependence of the conductances in a ferromagnetic metal fmnm junction with spinorbit coupling and magnetization which we call ferromagnetic spinorbit metal fsom from these results we discuss the relation between these conductance in the presence of dsoc and that in the presence of rsoc we found that conductance in dsoc is the same as that in rsoc for the nmfsom junction in addition we found that in the fmfsom junction the conductance in dsoc is the same as that in rsoc only when the fm magnetization is along the outofplane direction
|
[['we', 'studied', 'spindependent', 'conductance', 'in', 'a', 'normal', 'metal', 'nmnm', 'junction', 'with', 'dresselhaus', 'spinorbit', 'coupling', 'dsoc', 'and', 'magnetization', 'as', 'a', 'reference', 'we', 'also', 'studied', 'the', 'spindependent', 'conductance', 'in', 'such', 'a', 'junction', 'with', 'rashba', 'spinorbit', 'coupling', 'rsoc', 'using', 'a', 'standard', 'scattering', 'method', 'we', 'calculated', 'the', 'gatevoltage', 'dependence', 'of', 'the', 'spindependent', 'conductances', 'in', 'dsoc', 'and', 'rsoc', 'in', 'addition', 'we', 'calculated', 'the', 'gatevoltage', 'dependence', 'of', 'the', 'conductances', 'in', 'a', 'ferromagnetic', 'metal', 'fmnm', 'junction', 'with', 'spinorbit', 'coupling', 'and', 'magnetization', 'which', 'we', 'call', 'ferromagnetic', 'spinorbit', 'metal', 'fsom', 'from', 'these', 'results', 'we', 'discuss', 'the', 'relation', 'between', 'these', 'conductance', 'in', 'the', 'presence', 'of', 'dsoc', 'and', 'that', 'in', 'the', 'presence', 'of', 'rsoc', 'we', 'found', 'that', 'conductance', 'in', 'dsoc', 'is', 'the', 'same', 'as', 'that', 'in', 'rsoc', 'for', 'the', 'nmfsom', 'junction', 'in', 'addition', 'we', 'found', 'that', 'in', 'the', 'fmfsom', 'junction', 'the', 'conductance', 'in', 'dsoc', 'is', 'the', 'same', 'as', 'that', 'in', 'rsoc', 'only', 'when', 'the', 'fm', 'magnetization', 'is', 'along', 'the', 'outofplane', 'direction']]
|
[-0.27205236627384516, 0.14514450452981048, 0.0032986910494209147, 0.014552135361821017, -0.017219422042978053, -0.1838226679832909, 0.058697024867141324, 0.42748098159018827, -0.26017584452773035, -0.2707919293624938, -0.12070937402194784, -0.2957217107102478, -0.16686501191789602, 0.20379149890029613, 0.06648746205075663, -0.05523451138287783, -0.03901544459667817, -0.06400167635407578, -0.10376728870145673, -0.18694976411861222, 0.2941965357508181, -0.0733665244774196, 0.28142721672244625, 0.15347951630345819, 0.006884156859346798, 0.02435196819240037, 0.18526053869919407, 0.09290171008150024, -0.13986719350872417, -0.016126717972968305, 0.22159275596764977, -0.2367429042957267, 0.12650295290272354, -0.45657731401322244, -0.08875973951578343, -0.010176902782602781, 0.13513246245783608, 0.18741345737164294, -0.05292337478398263, -0.29336878554705453, 0.021230147872753694, -0.1586028733639186, -0.06815456975802626, -0.043704799778734135, 0.010686450395543052, 0.01869047777157049, -0.2871212360075339, 0.09456931340779799, 0.056647053127791606, 0.0597071188698415, -0.04871075823396242, -0.12010494938086984, -0.13732637803317332, 0.046836758386636736, 0.08076982145185019, 0.03180353980207322, 0.15411105867357272, -0.12413187551179103, -0.09311270108446479, 0.30103396462137194, -0.1800141922399389, -0.15911317059174687, 0.09603569970852664, -0.2307399844269262, -0.06772392763768886, 0.06364865481004524, 0.10008105878452105, 0.06443546656329109, -0.17473973749020552, 0.13852438220570534, -0.019144400117956862, 0.1101814635116987, 0.06397664028086833, 0.07226893048872854, 0.2289812930663224, 0.20384228426399228, 0.053079165647370224, 0.12718944794016884, -0.18793991643644006, -0.037286934366791834, -0.25273695076201236, -0.1573101664468849, -0.23810574670201864, 0.10936869926699976, -0.08958209869507257, -0.1883296747090054, 0.41010027157054063, 0.2155310715402977, 0.20159348829643053, -0.03159076134360642, 0.2892206574023581, 0.1720342344127684, 0.11408635632445414, 0.020542742969582275, 0.29200848741900354, 0.2275226944043827, 0.11844895185814017, -0.3804651636386379, 0.116874653396203, -0.040480552409097655]
|
1,803.07092
|
A Case Study of On-the-Fly Wide-Field Radio Imaging Applied to the
Gravitational-wave Event GW 151226
|
We apply a newly-developed On-the-Fly mosaicing technique on the NSF's Karl
G. Jansky Very Large Array (VLA) at 3 GHz in order to carry out a sensitive
search for an afterglow from the Advanced LIGO binary black hole merger event
GW 151226. In three epochs between 1.5 and 6 months post-merger we observed a
100 sq. deg region, with more than 80% of the survey region having a RMS
sensitivity of better than 150 uJy/beam, in the northern hemisphere having a
merger containment probability of 10%. The data were processed in
near-real-time, and analyzed to search for transients and variables. No
transients were found but we have demonstrated the ability to conduct blind
searches in a time-frequency phase space where the predicted afterglow signals
are strongest. If the gravitational wave event is contained within our survey
region, the upper limit on any late-time radio afterglow from the merger event
at an assumed mean distance of 440 Mpc is about 1e29 erg/s/Hz. Approximately
1.5% of the radio sources in the field showed variability at a level of 30%,
and can be attributed to normal activity from active galactic nuclei. The low
rate of false positives in the radio sky suggests that wide-field imaging
searches at a few Gigahertz can be an efficient and competitive search
strategy. We discuss our search method in the context of the recent afterglow
detection from GW 170817 and radio follow-up in future gravitational wave
observing runs.
|
astro-ph.HE astro-ph.IM
|
we apply a newlydeveloped onthefly mosaicing technique on the nsfs karl g jansky very large array vla at 3 ghz in order to carry out a sensitive search for an afterglow from the advanced ligo binary black hole merger event gw 151226 in three epochs between 15 and 6 months postmerger we observed a 100 sq deg region with more than 80 of the survey region having a rms sensitivity of better than 150 ujybeam in the northern hemisphere having a merger containment probability of 10 the data were processed in nearrealtime and analyzed to search for transients and variables no transients were found but we have demonstrated the ability to conduct blind searches in a timefrequency phase space where the predicted afterglow signals are strongest if the gravitational wave event is contained within our survey region the upper limit on any latetime radio afterglow from the merger event at an assumed mean distance of 440 mpc is about 1e29 ergshz approximately 15 of the radio sources in the field showed variability at a level of 30 and can be attributed to normal activity from active galactic nuclei the low rate of false positives in the radio sky suggests that widefield imaging searches at a few gigahertz can be an efficient and competitive search strategy we discuss our search method in the context of the recent afterglow detection from gw 170817 and radio followup in future gravitational wave observing runs
|
[['we', 'apply', 'a', 'newlydeveloped', 'onthefly', 'mosaicing', 'technique', 'on', 'the', 'nsfs', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'vla', 'at', '3', 'ghz', 'in', 'order', 'to', 'carry', 'out', 'a', 'sensitive', 'search', 'for', 'an', 'afterglow', 'from', 'the', 'advanced', 'ligo', 'binary', 'black', 'hole', 'merger', 'event', 'gw', '151226', 'in', 'three', 'epochs', 'between', '15', 'and', '6', 'months', 'postmerger', 'we', 'observed', 'a', '100', 'sq', 'deg', 'region', 'with', 'more', 'than', '80', 'of', 'the', 'survey', 'region', 'having', 'a', 'rms', 'sensitivity', 'of', 'better', 'than', '150', 'ujybeam', 'in', 'the', 'northern', 'hemisphere', 'having', 'a', 'merger', 'containment', 'probability', 'of', '10', 'the', 'data', 'were', 'processed', 'in', 'nearrealtime', 'and', 'analyzed', 'to', 'search', 'for', 'transients', 'and', 'variables', 'no', 'transients', 'were', 'found', 'but', 'we', 'have', 'demonstrated', 'the', 'ability', 'to', 'conduct', 'blind', 'searches', 'in', 'a', 'timefrequency', 'phase', 'space', 'where', 'the', 'predicted', 'afterglow', 'signals', 'are', 'strongest', 'if', 'the', 'gravitational', 'wave', 'event', 'is', 'contained', 'within', 'our', 'survey', 'region', 'the', 'upper', 'limit', 'on', 'any', 'latetime', 'radio', 'afterglow', 'from', 'the', 'merger', 'event', 'at', 'an', 'assumed', 'mean', 'distance', 'of', '440', 'mpc', 'is', 'about', '1e29', 'ergshz', 'approximately', '15', 'of', 'the', 'radio', 'sources', 'in', 'the', 'field', 'showed', 'variability', 'at', 'a', 'level', 'of', '30', 'and', 'can', 'be', 'attributed', 'to', 'normal', 'activity', 'from', 'active', 'galactic', 'nuclei', 'the', 'low', 'rate', 'of', 'false', 'positives', 'in', 'the', 'radio', 'sky', 'suggests', 'that', 'widefield', 'imaging', 'searches', 'at', 'a', 'few', 'gigahertz', 'can', 'be', 'an', 'efficient', 'and', 'competitive', 'search', 'strategy', 'we', 'discuss', 'our', 'search', 'method', 'in', 'the', 'context', 'of', 'the', 'recent', 'afterglow', 'detection', 'from', 'gw', '170817', 'and', 'radio', 'followup', 'in', 'future', 'gravitational', 'wave', 'observing', 'runs']]
|
[-0.10070588633461738, 0.09186661921188109, -0.05353942924217942, 0.10632378006606208, -0.1107202805239164, -0.06274137696891557, 0.08249945542484056, 0.4220682191934126, -0.15444217886348877, -0.36224042636652787, 0.13451734052262812, -0.32361769579583777, -0.06678183684901645, 0.24565341654233636, 0.023676220470830837, -0.035927459687324394, 0.09550965579595262, -0.03192048793037732, -0.05407503373280633, -0.227906203995614, 0.18637415737806198, 0.14519138372755455, 0.19812595310116496, -0.049750466020486786, 0.09137057455518516, -0.036307484926267834, -0.10694221432398383, -0.0348238899276718, -0.08828995033112126, 0.010406516072301504, 0.2990260867479568, 0.17420084880044062, 0.21799538118454317, -0.36758917314048933, -0.20115211664524396, 0.1022790983125257, 0.13817361223627814, 0.06085735506506656, -0.04008782153086941, -0.3411443427500975, 0.10743713443007437, -0.21412758343455304, -0.12035977618749409, 0.06800019346410409, 0.052333562703521845, 0.023735225846758114, -0.20941969358245843, 0.10046283140933762, -0.043584514547061796, 0.0660890094886175, -0.07432606391472897, -0.08979418353410437, 0.026831383181464236, 0.0438594587360664, 0.011907625828947251, 0.138054140134894, 0.13014034338836306, -0.12963259163855886, -0.10460632811494482, 0.3553851753647905, -0.07782503517531343, 0.002738842030521482, 0.19802909843613936, -0.23410174670279957, -0.1828805262358704, 0.2322696355045385, 0.20187512283325001, 0.12331253412218454, -0.14966363294321733, 0.012048167395429724, 0.03553308060230241, 0.2539885906638422, 0.09956022081217573, 0.04730300904921023, 0.3081922529730946, 0.16638978215147895, 0.07966116736546004, 0.12156159893590181, -0.29307245559296763, 0.0269789404507416, -0.26674246546584374, -0.06280631091212854, -0.15132346987181033, 0.09643757490011921, -0.11734390254678147, -0.06728926973858809, 0.3988087315830247, 0.12490689062396995, 0.15207786410367893, 0.06566327884769028, 0.27586702015444947, 0.03328687247315732, 0.07797574185339423, 0.12169149785186165, 0.3584136602507594, 0.09260768300543229, 0.11033783191620992, -0.14409018998849205, 0.029579396693831465, -0.026785095072894668]
|
1,803.07093
|
Stationary bound-state scalar configurations supported by
rapidly-spinning exotic compact objects
|
Some quantum-gravity theories suggest that the absorbing horizon of a
classical black hole should be replaced by a reflective surface which is
located a microscopic distance above the would-be classical horizon. Instead of
an absorbing black hole, the resulting horizonless spacetime describes a
reflective exotic compact object. Motivated by this intriguing prediction, in
the present paper we explore the physical properties of exotic compact objects
which are linearly coupled to stationary bound-state massive scalar field
configurations. In particular, solving the Klein-Gordon wave equation for a
stationary scalar field of proper mass $\mu$ and spheroidal harmonic indices
$(l,m)$ in the background of a rapidly-rotating exotic compact object of mass
$M$ and angular momentum $J=Ma$, we derive a compact analytical formula for the
{\it discrete} radii $\{r_{\text{c}}(\mu,l,m,M,a;n)\}$ of the exotic compact
objects which can support the stationary bound-state massive scalar field
configurations. We confirm our analytical results by direct numerical
computations.
|
gr-qc astro-ph.HE hep-th
|
some quantumgravity theories suggest that the absorbing horizon of a classical black hole should be replaced by a reflective surface which is located a microscopic distance above the wouldbe classical horizon instead of an absorbing black hole the resulting horizonless spacetime describes a reflective exotic compact object motivated by this intriguing prediction in the present paper we explore the physical properties of exotic compact objects which are linearly coupled to stationary boundstate massive scalar field configurations in particular solving the kleingordon wave equation for a stationary scalar field of proper mass mu and spheroidal harmonic indices lm in the background of a rapidlyrotating exotic compact object of mass m and angular momentum jma we derive a compact analytical formula for the it discrete radii r_textcmulmman of the exotic compact objects which can support the stationary boundstate massive scalar field configurations we confirm our analytical results by direct numerical computations
|
[['some', 'quantumgravity', 'theories', 'suggest', 'that', 'the', 'absorbing', 'horizon', 'of', 'a', 'classical', 'black', 'hole', 'should', 'be', 'replaced', 'by', 'a', 'reflective', 'surface', 'which', 'is', 'located', 'a', 'microscopic', 'distance', 'above', 'the', 'wouldbe', 'classical', 'horizon', 'instead', 'of', 'an', 'absorbing', 'black', 'hole', 'the', 'resulting', 'horizonless', 'spacetime', 'describes', 'a', 'reflective', 'exotic', 'compact', 'object', 'motivated', 'by', 'this', 'intriguing', 'prediction', 'in', 'the', 'present', 'paper', 'we', 'explore', 'the', 'physical', 'properties', 'of', 'exotic', 'compact', 'objects', 'which', 'are', 'linearly', 'coupled', 'to', 'stationary', 'boundstate', 'massive', 'scalar', 'field', 'configurations', 'in', 'particular', 'solving', 'the', 'kleingordon', 'wave', 'equation', 'for', 'a', 'stationary', 'scalar', 'field', 'of', 'proper', 'mass', 'mu', 'and', 'spheroidal', 'harmonic', 'indices', 'lm', 'in', 'the', 'background', 'of', 'a', 'rapidlyrotating', 'exotic', 'compact', 'object', 'of', 'mass', 'm', 'and', 'angular', 'momentum', 'jma', 'we', 'derive', 'a', 'compact', 'analytical', 'formula', 'for', 'the', 'it', 'discrete', 'radii', 'r_textcmulmman', 'of', 'the', 'exotic', 'compact', 'objects', 'which', 'can', 'support', 'the', 'stationary', 'boundstate', 'massive', 'scalar', 'field', 'configurations', 'we', 'confirm', 'our', 'analytical', 'results', 'by', 'direct', 'numerical', 'computations']]
|
[-0.17536139826975036, 0.15626050055593746, -0.1117842589376016, 0.1387876414369817, -0.14149624394643046, -0.13512938950884132, 0.0027036680281476897, 0.32931875723187587, -0.13621282572952426, -0.27874751050792934, 0.08121984210919363, -0.24445007221672582, -0.10132521670940961, 0.1909478371958972, -0.035596126193382045, 0.051078154271267155, 0.02663780221553532, 0.05479663571443509, -0.1066885662903833, -0.16034937127748178, 0.4087181194257495, 0.025912527831875393, 0.17930350175152557, -0.01724376600405604, 0.1092951019338609, -0.012422804597991745, -0.007576280219615689, 0.03635734592790942, -0.14256409277087997, 0.11102269407097451, 0.20770016959490809, 0.08165383013594593, 0.18665827290670997, -0.3889800235629082, -0.25795889832866, 0.07731742334451426, 0.16184714528090144, 0.11891332094327899, -0.11794430946906072, -0.34249919871925505, 0.08274217161807748, -0.17738013464730937, -0.25817441391267787, -0.03984770679223427, 0.07552075651836128, -0.0023725463606014447, -0.23329529755220219, 0.08636864335661616, 0.06433090835894659, -0.047874053427320276, -0.12724104680662118, -0.07593217407781128, -0.04156775139051968, 0.035884618331250305, 0.06105759608353027, 0.026054778274359508, 0.17044990032760277, -0.1331590689872895, -0.09849863399899364, 0.3425663444087715, -0.04597577902510435, -0.2193571983622639, 0.1930858040027119, -0.18259553882809407, -0.1007373493473121, 0.17062307718741657, 0.1734912015145292, 0.20516003148529577, -0.1565441409317852, 0.139195416843978, -0.06240275112125075, 0.15049565565847867, 0.09347448695916682, 0.07580146832923354, 0.3758053931665632, 0.133573999080958, 0.028409032528666226, 0.12882134192890637, -0.054817397642182186, -0.10374714902325256, -0.34257958161430685, -0.17231407752803313, -0.16475554421619587, 0.11183545429987528, -0.14111116924834424, -0.183327247948713, 0.3128020409746347, 0.07479815114670232, 0.15782616607140046, 0.01501263103784515, 0.26505518508634557, 0.11838868176926405, 0.02137849274141764, 0.10725901090552577, 0.27678130760673286, 0.16104298301207884, 0.07725015284833373, -0.2396956852800842, -0.11471896671463509, 0.06511996739946709]
|
1,803.07094
|
Evolution of the Black Hole Mass Function in Star Clusters from Multiple
Mergers
|
We investigate the effects of black hole mergers in star clusters on the
black hole mass function. As black holes are not produced in pair-instability
supernovae, it is suggested that there is a dearth of high mass stellar black
holes. This dearth generates a gap in the upper end of the black hole mass
function. Meanwhile, parameter fitting of X-ray binaries suggests the existence
of a gap in the mass function under 5 solar masses. We show, through evolving a
coagulation equation, that black hole mergers can appreciably fill the upper
mass gap, and that the lower mass gap generates potentially observable features
at larger mass scales. We also explore the importance of ejections in such
systems and whether dynamical clusters can be formation sites of intermediate
mass black hole seeds.
|
astro-ph.HE gr-qc
|
we investigate the effects of black hole mergers in star clusters on the black hole mass function as black holes are not produced in pairinstability supernovae it is suggested that there is a dearth of high mass stellar black holes this dearth generates a gap in the upper end of the black hole mass function meanwhile parameter fitting of xray binaries suggests the existence of a gap in the mass function under 5 solar masses we show through evolving a coagulation equation that black hole mergers can appreciably fill the upper mass gap and that the lower mass gap generates potentially observable features at larger mass scales we also explore the importance of ejections in such systems and whether dynamical clusters can be formation sites of intermediate mass black hole seeds
|
[['we', 'investigate', 'the', 'effects', 'of', 'black', 'hole', 'mergers', 'in', 'star', 'clusters', 'on', 'the', 'black', 'hole', 'mass', 'function', 'as', 'black', 'holes', 'are', 'not', 'produced', 'in', 'pairinstability', 'supernovae', 'it', 'is', 'suggested', 'that', 'there', 'is', 'a', 'dearth', 'of', 'high', 'mass', 'stellar', 'black', 'holes', 'this', 'dearth', 'generates', 'a', 'gap', 'in', 'the', 'upper', 'end', 'of', 'the', 'black', 'hole', 'mass', 'function', 'meanwhile', 'parameter', 'fitting', 'of', 'xray', 'binaries', 'suggests', 'the', 'existence', 'of', 'a', 'gap', 'in', 'the', 'mass', 'function', 'under', '5', 'solar', 'masses', 'we', 'show', 'through', 'evolving', 'a', 'coagulation', 'equation', 'that', 'black', 'hole', 'mergers', 'can', 'appreciably', 'fill', 'the', 'upper', 'mass', 'gap', 'and', 'that', 'the', 'lower', 'mass', 'gap', 'generates', 'potentially', 'observable', 'features', 'at', 'larger', 'mass', 'scales', 'we', 'also', 'explore', 'the', 'importance', 'of', 'ejections', 'in', 'such', 'systems', 'and', 'whether', 'dynamical', 'clusters', 'can', 'be', 'formation', 'sites', 'of', 'intermediate', 'mass', 'black', 'hole', 'seeds']]
|
[-0.14398666904912194, 0.17277286533899036, -0.04101371221628239, 0.22023214556664256, -0.07096116272874801, -0.04497097740891809, 0.07086786062577526, 0.3543638056712865, -0.14874383879697506, -0.3871400776027723, 0.06390474484575813, -0.31681792777145407, -0.055157878678754144, 0.21436197833932993, -0.023639459427828698, -0.007757694858574231, 0.07555946627745533, -0.03539439916383219, -0.1372957750852753, -0.22670850925545655, 0.4102043309853277, 0.09077834238419095, 0.13032160116402247, 0.02613996789134854, 0.04667618686247987, -0.08462992090134676, 0.0443874690148496, -0.008397194771504897, -0.1883956452480936, -0.007448336725476027, 0.20464386748868033, 0.15494407603218582, 0.2487681897371325, -0.3368290781064798, -0.2337942212990677, 0.0678429760195258, 0.22502518952504255, 0.11017374547983996, -0.2150589214426373, -0.18842796996975217, 0.0920831997032839, -0.27809119661061366, -0.15234905211894795, 0.07534436782722483, 0.07861368887069571, -0.013812003401285819, -0.23589779694301596, 0.19956784864389054, 0.04440487108396843, -0.11514337755826778, -0.14833819574164583, -0.05385011821302749, -0.12500928509056228, 0.08218051093623384, 0.1151277712077073, 0.0277088652436003, 0.23007892176707964, -0.1127795308369802, -0.06259267817372242, 0.33672616026499347, -0.040142683186994876, -0.09518239996751472, 0.22016772393222528, -0.2823213245648578, -0.14284592734663995, 0.10734225196038721, 0.21089508391575504, 0.1732061403156578, -0.17098253602446375, 0.05313661188253323, -0.0019835329948718313, 0.25384913422771593, 0.09950757733695494, 0.07671674244009839, 0.4721707585374363, 0.18641428089298961, 0.016361312656343437, 0.10102210306821974, -0.10266099240851255, -0.01717998401283194, -0.1894248007611862, -0.12327541083182769, -0.18073282780779795, 0.11601950661983529, -0.16730071708736835, -0.18091633918744918, 0.2875582012063504, 0.11215683040813408, 0.26339194049902315, 0.009590890342085302, 0.21387886832129852, 0.1036403366632916, 0.10512837845625939, 0.1343004510361161, 0.3512833624481017, 0.1223257176119493, 0.0838009084055897, -0.2617648835844922, 0.025595976580076545, 0.07427852486352657]
|
1,803.07095
|
A Cosmological Solution to the Impossibly Early Galaxy Problem
|
To understand the formation and evolution of galaxies at redshifts z < 10,
one must invariably introduce specific models (e.g., for the star formation) in
order to fully interpret the data. Unfortunately, this tends to render the
analysis compliant to the theory and its assumptions, so consensus is still
somewhat elusive. Nonetheless, the surprisingly early appearance of massive
galaxies challenges the standard model, and the halo mass function estimated
from galaxy surveys at z > 4 appears to be inconsistent with the predictions of
LCDM, giving rise to what has been termed "The Impossibly Early Galaxy Problem"
by some workers in the field. A simple resolution to this question may not be
forthcoming. The situation with the halos themselves, however, is more
straightforward and, in this paper, we use linear perturbation theory to derive
the halo mass function over the redshift range z < 10 for the R_h=ct universe.
We use this predicted halo distribution to demonstrate that both its dependence
on mass and its very weak dependence on redshift are compatible with the data.
The difficulties with LCDM may eventually be overcome with refinements to the
underlying theory of star formation and galaxy evolution within the halos. For
now, however, we demonstrate that the unexpected early formation of structure
may also simply be due to an incorrect choice of the cosmology, rather than to
yet unknown astrophysical issues associated with the condensation of mass
fluctuations and subsequent galaxy formation.
|
astro-ph.CO astro-ph.GA gr-qc hep-ph
|
to understand the formation and evolution of galaxies at redshifts z 10 one must invariably introduce specific models eg for the star formation in order to fully interpret the data unfortunately this tends to render the analysis compliant to the theory and its assumptions so consensus is still somewhat elusive nonetheless the surprisingly early appearance of massive galaxies challenges the standard model and the halo mass function estimated from galaxy surveys at z 4 appears to be inconsistent with the predictions of lcdm giving rise to what has been termed the impossibly early galaxy problem by some workers in the field a simple resolution to this question may not be forthcoming the situation with the halos themselves however is more straightforward and in this paper we use linear perturbation theory to derive the halo mass function over the redshift range z 10 for the r_hct universe we use this predicted halo distribution to demonstrate that both its dependence on mass and its very weak dependence on redshift are compatible with the data the difficulties with lcdm may eventually be overcome with refinements to the underlying theory of star formation and galaxy evolution within the halos for now however we demonstrate that the unexpected early formation of structure may also simply be due to an incorrect choice of the cosmology rather than to yet unknown astrophysical issues associated with the condensation of mass fluctuations and subsequent galaxy formation
|
[['to', 'understand', 'the', 'formation', 'and', 'evolution', 'of', 'galaxies', 'at', 'redshifts', 'z', '10', 'one', 'must', 'invariably', 'introduce', 'specific', 'models', 'eg', 'for', 'the', 'star', 'formation', 'in', 'order', 'to', 'fully', 'interpret', 'the', 'data', 'unfortunately', 'this', 'tends', 'to', 'render', 'the', 'analysis', 'compliant', 'to', 'the', 'theory', 'and', 'its', 'assumptions', 'so', 'consensus', 'is', 'still', 'somewhat', 'elusive', 'nonetheless', 'the', 'surprisingly', 'early', 'appearance', 'of', 'massive', 'galaxies', 'challenges', 'the', 'standard', 'model', 'and', 'the', 'halo', 'mass', 'function', 'estimated', 'from', 'galaxy', 'surveys', 'at', 'z', '4', 'appears', 'to', 'be', 'inconsistent', 'with', 'the', 'predictions', 'of', 'lcdm', 'giving', 'rise', 'to', 'what', 'has', 'been', 'termed', 'the', 'impossibly', 'early', 'galaxy', 'problem', 'by', 'some', 'workers', 'in', 'the', 'field', 'a', 'simple', 'resolution', 'to', 'this', 'question', 'may', 'not', 'be', 'forthcoming', 'the', 'situation', 'with', 'the', 'halos', 'themselves', 'however', 'is', 'more', 'straightforward', 'and', 'in', 'this', 'paper', 'we', 'use', 'linear', 'perturbation', 'theory', 'to', 'derive', 'the', 'halo', 'mass', 'function', 'over', 'the', 'redshift', 'range', 'z', '10', 'for', 'the', 'r_hct', 'universe', 'we', 'use', 'this', 'predicted', 'halo', 'distribution', 'to', 'demonstrate', 'that', 'both', 'its', 'dependence', 'on', 'mass', 'and', 'its', 'very', 'weak', 'dependence', 'on', 'redshift', 'are', 'compatible', 'with', 'the', 'data', 'the', 'difficulties', 'with', 'lcdm', 'may', 'eventually', 'be', 'overcome', 'with', 'refinements', 'to', 'the', 'underlying', 'theory', 'of', 'star', 'formation', 'and', 'galaxy', 'evolution', 'within', 'the', 'halos', 'for', 'now', 'however', 'we', 'demonstrate', 'that', 'the', 'unexpected', 'early', 'formation', 'of', 'structure', 'may', 'also', 'simply', 'be', 'due', 'to', 'an', 'incorrect', 'choice', 'of', 'the', 'cosmology', 'rather', 'than', 'to', 'yet', 'unknown', 'astrophysical', 'issues', 'associated', 'with', 'the', 'condensation', 'of', 'mass', 'fluctuations', 'and', 'subsequent', 'galaxy', 'formation']]
|
[-0.0544920867807055, 0.09247336129984329, -0.1040766681617108, 0.13381972115089968, -0.1378787109178377, -0.0719806781187968, 0.0136360547943473, 0.38386658111484995, -0.22261469154461494, -0.3559742820717371, 0.09704217500935548, -0.24494399547278253, -0.07097892320758117, 0.1577469927861988, -0.049644409220091966, -0.007417329799979218, 0.033304375081562795, -0.007912920702461012, -0.06552865855577047, -0.3021965317805357, 0.3321929849813916, 0.1182742313420958, 0.20718854008574542, 0.017863931067539418, 0.05784305004218303, -0.07124388609513767, -0.05095838530790768, -0.009404560006793416, -0.16801927746441814, 0.04736422004255777, 0.24588606162419466, 0.13561287711975942, 0.26364271349140017, -0.3914051494651517, -0.21009245390693346, 0.11035900256097443, 0.2049247178689057, 0.1269598980974563, -0.07599427908805606, -0.25260315058366806, 0.1029831285766259, -0.18354963240059455, -0.16389846832212454, -0.0038457118967112807, -0.00018018595520642738, -0.025112378044556904, -0.23037242168046826, 0.14840722751382734, 0.01673594514843281, 0.012738689511055558, -0.04407264341704375, -0.05710466633028182, -0.03390242413613741, 0.0760609405400145, 0.0732366761820438, 0.07335866200993081, 0.1527032257914386, -0.1803075856222665, -0.04530640197465911, 0.4373626342349792, -0.03491667065975003, -0.10435256266434488, 0.2321397452939396, -0.20111572929905563, -0.17314872343214976, 0.08536975976287973, 0.13741863313409056, 0.05816116863232939, -0.15490355958326088, 0.04239411932737507, 0.024021464237650534, 0.1895966827083489, 0.02892726313476038, 0.025733417342367823, 0.3023353823252368, 0.1363622002791857, 0.05155553955404001, 0.03313569397221512, -0.07862428308367328, -0.06751005845105094, -0.24797737062368386, -0.08266105168825212, -0.13827145525317183, 0.08358210661967495, -0.09752986908018174, -0.15152589166890593, 0.35131187413186465, 0.17585026436807827, 0.263732228506718, 0.08786606385062139, 0.2860621682423234, 0.09009526726786825, 0.10687810052697103, 0.054303553765875444, 0.2675600048703022, 0.15159791886299565, 0.07675490129634911, -0.2102046601134372, 0.09983161469908698, -0.03517548557968205]
|
1,803.07096
|
Beating the Rayleigh Limit Using Two-Photon Interference
|
Multiparameter estimation theory offers a general framework to explore
imaging techniques beyond the Rayleigh limit. While optimal measurements of
single parameters characterizing a composite light source are now well
understood, simultaneous determination of multiple parameters poses a much
greater challenge that in general requires implementation of collective
measurements. Here we show, theoretically and experimentally, that
Hong-Ou-Mandel interference followed by spatially resolved detection of photons
provides precise information on both the separation and the centroid for a pair
of point emitters, avoiding trade-offs inherent to single-photon measurements.
|
quant-ph
|
multiparameter estimation theory offers a general framework to explore imaging techniques beyond the rayleigh limit while optimal measurements of single parameters characterizing a composite light source are now well understood simultaneous determination of multiple parameters poses a much greater challenge that in general requires implementation of collective measurements here we show theoretically and experimentally that hongoumandel interference followed by spatially resolved detection of photons provides precise information on both the separation and the centroid for a pair of point emitters avoiding tradeoffs inherent to singlephoton measurements
|
[['multiparameter', 'estimation', 'theory', 'offers', 'a', 'general', 'framework', 'to', 'explore', 'imaging', 'techniques', 'beyond', 'the', 'rayleigh', 'limit', 'while', 'optimal', 'measurements', 'of', 'single', 'parameters', 'characterizing', 'a', 'composite', 'light', 'source', 'are', 'now', 'well', 'understood', 'simultaneous', 'determination', 'of', 'multiple', 'parameters', 'poses', 'a', 'much', 'greater', 'challenge', 'that', 'in', 'general', 'requires', 'implementation', 'of', 'collective', 'measurements', 'here', 'we', 'show', 'theoretically', 'and', 'experimentally', 'that', 'hongoumandel', 'interference', 'followed', 'by', 'spatially', 'resolved', 'detection', 'of', 'photons', 'provides', 'precise', 'information', 'on', 'both', 'the', 'separation', 'and', 'the', 'centroid', 'for', 'a', 'pair', 'of', 'point', 'emitters', 'avoiding', 'tradeoffs', 'inherent', 'to', 'singlephoton', 'measurements']]
|
[-0.14290591881632111, 0.10536645999893027, -0.0710985877897677, 0.08084881546511856, -0.052573324573702764, -0.20057566816983527, 0.11628484164857371, 0.39453534394242734, -0.25942129805294234, -0.34646129859394803, 0.049915730962692216, -0.2515252906569215, -0.1178185130160865, 0.23768379260666755, -0.04962046485026042, 0.09397145523689687, 0.07883445383049548, -0.06201577402088185, -0.08474457102860215, -0.12880816089590405, 0.2583893718208771, 0.09096915658216836, 0.322330373485551, 0.06044599926099181, 0.14267695892797133, 0.08827361208928186, -0.08164948819010237, -0.017545661190524697, -0.12818753922464418, 0.11942940226994282, 0.25619542855616434, 0.1267831807707025, 0.25082422899580453, -0.3830679401722845, -0.2552328695987113, 0.07730458579892509, 0.19036016567220349, 0.14210339285823148, -0.05531379782600155, -0.27444840538813625, 0.02035518813618394, -0.08061782871697877, -0.13424004776251697, -0.077248957614566, -0.014031746164830617, -0.03137428303815013, -0.2821520862689372, 0.09564253863293765, 0.005240948270765393, 0.053526065648035255, 0.003891945161401879, -0.054937742274189585, 0.0675221612855662, 0.11097406802244138, -0.04025429376295421, -0.022826571917691982, 0.13311838607173845, -0.15538860665266077, -0.1503475856192973, 0.37277576892615055, -0.056533777802034696, -0.17094212270146886, 0.1587713228885171, -0.14278539416629302, -0.12150975224172134, 0.14699055941039046, 0.15280677945634655, 0.1317486475156837, -0.18062481111413692, 0.015240671756125033, -0.013723498502702908, 0.20094384940856863, 0.058202369793773044, 0.16106941133770053, 0.22453139750503523, 0.2034252952069564, 0.04505010118144889, 0.11946305126319964, -0.15507485076167815, -0.09342937019848546, -0.2703306862473932, -0.11087757918907892, -0.17600585284188044, 0.025454597396039686, -0.071614307042436, -0.12818929483724195, 0.3715302787482912, 0.15682437753867964, 0.17231914457096176, 0.01950430629644976, 0.3819983916703698, 0.09020749707625053, 0.03111711185598789, -0.01322595332749188, 0.31993853932836763, 0.13641124729305332, 0.0376103034237573, -0.21101738467980394, 0.06013655145977472, -0.048873029245865035]
|
1,803.07097
|
$\tilde{O}(n^{1/3})$-Space Algorithm for the Grid Graph Reachability
Problem
|
The directed graph reachability problem takes as input an $n$-vertex directed
graph $G=(V,E)$, and two distinguished vertices $s$ and $t$. The problem is to
determine whether there exists a path from $s$ to $t$ in $G$. This is a
canonical complete problem for class NL. Asano et al. proposed an
$\tilde{O}(\sqrt{n})$ space and polynomial time algorithm for the directed grid
and planar graph reachability problem. The main result of this paper is to show
that the directed graph reachability problem restricted to grid graphs can be
solved in polynomial time using only $\tilde{O}(n^{1/3})$ space.
|
cs.DS
|
the directed graph reachability problem takes as input an nvertex directed graph gve and two distinguished vertices s and t the problem is to determine whether there exists a path from s to t in g this is a canonical complete problem for class nl asano et al proposed an tildeosqrtn space and polynomial time algorithm for the directed grid and planar graph reachability problem the main result of this paper is to show that the directed graph reachability problem restricted to grid graphs can be solved in polynomial time using only tildeon13 space
|
[['the', 'directed', 'graph', 'reachability', 'problem', 'takes', 'as', 'input', 'an', 'nvertex', 'directed', 'graph', 'gve', 'and', 'two', 'distinguished', 'vertices', 's', 'and', 't', 'the', 'problem', 'is', 'to', 'determine', 'whether', 'there', 'exists', 'a', 'path', 'from', 's', 'to', 't', 'in', 'g', 'this', 'is', 'a', 'canonical', 'complete', 'problem', 'for', 'class', 'nl', 'asano', 'et', 'al', 'proposed', 'an', 'tildeosqrtn', 'space', 'and', 'polynomial', 'time', 'algorithm', 'for', 'the', 'directed', 'grid', 'and', 'planar', 'graph', 'reachability', 'problem', 'the', 'main', 'result', 'of', 'this', 'paper', 'is', 'to', 'show', 'that', 'the', 'directed', 'graph', 'reachability', 'problem', 'restricted', 'to', 'grid', 'graphs', 'can', 'be', 'solved', 'in', 'polynomial', 'time', 'using', 'only', 'tildeon13', 'space']]
|
[-0.1540010839284576, 0.09398971743011064, -0.019629058358754885, 0.02544595328768953, -0.15722392787760558, -0.1581162190599803, 0.0507823504876603, 0.41106963106133837, -0.37096297304626513, -0.3596989565251514, 0.042308382793983565, -0.26971330323276366, -0.13541821641054877, 0.1283013302983934, -0.11487966471728175, 0.09295830491216893, 0.15032969280443292, 0.07197428262851974, 0.05222957777701556, -0.25367755294861666, 0.2824713939979197, -0.028337263383288333, 0.14080087614661835, 0.06994704284923191, 0.11606634140232618, 0.05201833805643973, 0.021326724509213198, 0.140615249765378, -0.16277310008994622, 0.025610628833825838, 0.3205158284820735, 0.2186379225954334, 0.24787241240289618, -0.39476501178789014, -0.1924605013287448, 0.27125733846085187, 0.13477327535919686, 0.04948633717264029, 0.06018220753151369, -0.2337979605381793, 0.11745520196393741, -0.08582747188654352, -0.01974084281778716, 0.054259723944074294, 0.14720177521651728, -0.05953729463780814, -0.32839852756761173, -0.04621922693393649, 0.14118483859768255, 0.01865594836690047, 0.0619667676931366, -0.10752500858692889, -0.04059874428376714, 0.10104196971440886, -0.1077602503974823, 0.1607700950129235, -0.0034142267949720645, -0.060209027323079235, -0.23259250464987882, 0.3802287692719318, -0.002676278828306401, -0.1687623007926456, 0.07169011265950952, -0.05701577312194128, -0.19891269298448683, 0.10029903428747933, 0.16236967209013217, 0.20170914221237948, -0.12027106300322091, 0.1728100059132904, -0.14045687200144885, 0.13181629149798066, 0.08014570527333528, -0.07871601238668441, 0.07837562538484331, 0.17431498546539706, 0.21222463520640072, 0.1905132279709041, 0.05326163488628462, -0.020047987209994622, -0.2509039158615819, -0.10467119401994537, -0.2627676207909083, 0.02153905444937025, -0.16556533231793785, -0.18589891494311234, 0.3969342151676562, 0.11202054807638868, 0.2007966032648023, 0.15291097546194463, 0.23666060395276253, 0.12704706262732718, -0.047107287410131475, 0.20866149107608548, 0.08417433409139197, 0.1528629883529341, 0.07166789855530604, -0.21086108912168902, 0.08904343405292627, 0.1886436822130642]
|
1,803.07098
|
"Thinking Quantum": Lectures on Quantum Theory
|
We present a conceptually clear introduction to quantum theory, deriving the
theory from scratch from the point of view of quantum information. Different
subsets of these lectures were taught to a wide variety of audiences, including
exceptional high-school students in the International Summer School for Young
Physicists (ISSYP) at Perimeter Institute, 2nd-year physics undergraduates at
the University of Toronto, and 4th-year physics and math undergraduate and
graduate students at Brock University. The lectures are completely
self-contained, including all the necessary mathematical background: complex
numbers, linear algebra, and probability theory. They cover topics such as the
axioms of quantum theory, qubits, superposition, entanglement, the uncertainty
principle, quantum gates, unitary transformations and evolution,
interpretations of quantum mechanics, the no-cloning theorem, quantum
teleportation, quantum algorithms, Hamiltonians, the Schrodinger equation,
canonical and path integral quantization, quantum harmonic oscillators,
wavefunctions, and much more. The lectures also contain 163 computational
exercises and proof-based problems.
|
physics.pop-ph quant-ph
|
we present a conceptually clear introduction to quantum theory deriving the theory from scratch from the point of view of quantum information different subsets of these lectures were taught to a wide variety of audiences including exceptional highschool students in the international summer school for young physicists issyp at perimeter institute 2ndyear physics undergraduates at the university of toronto and 4thyear physics and math undergraduate and graduate students at brock university the lectures are completely selfcontained including all the necessary mathematical background complex numbers linear algebra and probability theory they cover topics such as the axioms of quantum theory qubits superposition entanglement the uncertainty principle quantum gates unitary transformations and evolution interpretations of quantum mechanics the nocloning theorem quantum teleportation quantum algorithms hamiltonians the schrodinger equation canonical and path integral quantization quantum harmonic oscillators wavefunctions and much more the lectures also contain 163 computational exercises and proofbased problems
|
[['we', 'present', 'a', 'conceptually', 'clear', 'introduction', 'to', 'quantum', 'theory', 'deriving', 'the', 'theory', 'from', 'scratch', 'from', 'the', 'point', 'of', 'view', 'of', 'quantum', 'information', 'different', 'subsets', 'of', 'these', 'lectures', 'were', 'taught', 'to', 'a', 'wide', 'variety', 'of', 'audiences', 'including', 'exceptional', 'highschool', 'students', 'in', 'the', 'international', 'summer', 'school', 'for', 'young', 'physicists', 'issyp', 'at', 'perimeter', 'institute', '2ndyear', 'physics', 'undergraduates', 'at', 'the', 'university', 'of', 'toronto', 'and', '4thyear', 'physics', 'and', 'math', 'undergraduate', 'and', 'graduate', 'students', 'at', 'brock', 'university', 'the', 'lectures', 'are', 'completely', 'selfcontained', 'including', 'all', 'the', 'necessary', 'mathematical', 'background', 'complex', 'numbers', 'linear', 'algebra', 'and', 'probability', 'theory', 'they', 'cover', 'topics', 'such', 'as', 'the', 'axioms', 'of', 'quantum', 'theory', 'qubits', 'superposition', 'entanglement', 'the', 'uncertainty', 'principle', 'quantum', 'gates', 'unitary', 'transformations', 'and', 'evolution', 'interpretations', 'of', 'quantum', 'mechanics', 'the', 'nocloning', 'theorem', 'quantum', 'teleportation', 'quantum', 'algorithms', 'hamiltonians', 'the', 'schrodinger', 'equation', 'canonical', 'and', 'path', 'integral', 'quantization', 'quantum', 'harmonic', 'oscillators', 'wavefunctions', 'and', 'much', 'more', 'the', 'lectures', 'also', 'contain', '163', 'computational', 'exercises', 'and', 'proofbased', 'problems']]
|
[-0.02792307481025185, 0.2066806405975387, -0.14990254090456614, 0.10750075202949089, -0.12003366639837623, -0.22357427051676246, 0.03098189563426221, 0.2634990253533911, -0.2391980201019986, -0.3601283080169353, 0.06068918469747336, -0.3040237923666578, -0.15932465229054976, 0.22091507639350563, -0.11799742736500399, 0.07101573887891297, 0.0996091360643763, 0.021718046338907605, -0.09236890819838978, -0.3197314460039267, 0.2596674280698764, 0.08263555284396841, 0.2942665701988956, 0.035499009168867404, 0.1396678018712856, 0.024235129040055748, -0.021591663860780156, -0.05155202960274343, -0.13411153443157672, 0.13637685090753024, 0.43377347558672574, 0.15693108119504076, 0.32012147136546415, -0.44708401501692574, -0.13731993873892673, 0.01481544888449897, 0.005042007286101579, 0.1510370402500547, 0.01349991832745406, -0.3625872059115048, -0.053762542952257526, -0.16436174248891144, -0.13060900004066783, -0.04856157158822592, 0.009407685241051789, -0.04238286868765436, -0.12327892996113876, 0.03700790448608037, 0.04632090054059016, 0.2346992629548085, 0.009055573953082785, -0.14286341216929, 0.05110445093877357, 0.1363444508149706, -0.08808363954504503, -0.0067918831691274354, 0.15910987044074412, -0.16362980418710102, -0.21434616621198324, 0.40285953728739043, 0.07634566421580405, -0.12885738839234773, 0.1879560010571932, -0.14492300035881586, -0.16749813890180967, 0.03923108620280079, 0.18373701073518345, 0.08252078980078985, -0.15775218721768208, 0.16179526621186785, 0.020559799131648293, 0.11541784895877033, 0.11318227505825203, 0.05884902008552233, 0.2503931300263503, 0.0389001568650891, -0.009769118468052354, 0.055322414459981796, 0.04576747721574943, -0.2231511107035752, -0.4038337127401911, -0.17198939972460783, -0.18614209460913492, 0.13042664669197182, -0.010972206762606471, -0.13931025121489476, 0.3844718974380722, 0.10408152354447621, 0.016133040186531583, 0.018642646437189703, 0.1941396579306958, 0.11664779199656614, 0.0015451661869080673, 0.07788988626722632, 0.1295375604648143, 0.22445002054185445, 0.1565624819137156, -0.11972869043880753, -0.07764396380697344, 0.14227044524560714]
|
1,803.07099
|
Varieties of coarse spaces
|
A class $\mathfrak{M}$ of coarse spaces is called a variety if $\mathfrak{M}$
is closed under formation of subspaces, coarse images and products. We classify
the varieties of coarse spaces and, in particular, show that if a variety
$\mathfrak{M}$ contains an unbounded metric space then $\mathfrak{M}$ is the
variety of all coarse spaces.
|
math.GN
|
a class mathfrakm of coarse spaces is called a variety if mathfrakm is closed under formation of subspaces coarse images and products we classify the varieties of coarse spaces and in particular show that if a variety mathfrakm contains an unbounded metric space then mathfrakm is the variety of all coarse spaces
|
[['a', 'class', 'mathfrakm', 'of', 'coarse', 'spaces', 'is', 'called', 'a', 'variety', 'if', 'mathfrakm', 'is', 'closed', 'under', 'formation', 'of', 'subspaces', 'coarse', 'images', 'and', 'products', 'we', 'classify', 'the', 'varieties', 'of', 'coarse', 'spaces', 'and', 'in', 'particular', 'show', 'that', 'if', 'a', 'variety', 'mathfrakm', 'contains', 'an', 'unbounded', 'metric', 'space', 'then', 'mathfrakm', 'is', 'the', 'variety', 'of', 'all', 'coarse', 'spaces']]
|
[-0.15694864912746617, 0.12684575913506427, -0.07548569762506165, 0.0909032815543469, -0.0697590479752622, -0.09314859609227054, -0.10687584028794216, 0.41864673535411173, -0.4099584590070523, -0.08794196661060247, 0.12797389109842838, -0.2186511512308453, -0.12780777998089504, 0.2026887665896748, -0.21131304366729006, -0.08126379734872338, 0.09878331759514716, 0.08200998396541063, -0.12112069460832012, -0.3315150417530766, 0.527184366606749, -0.09015684506784265, 0.24347477674914095, 0.007065854101361206, 0.2017314167908178, -0.03436898311170248, 0.038416760006489664, 0.09788645254929389, -0.1922068619937468, 0.13289993048573917, 0.2855385086284234, 0.16756365419580385, 0.2953260658452144, -0.28780481588238704, -0.18711823787396917, 0.27832208810230863, 0.09538123631276764, -0.0128614384537706, 0.003160587135845652, -0.27169847341540915, 0.1591851073138129, -0.15254345665184352, -0.06803474466029841, -0.16082755728768042, 0.08620443039511044, -0.032141415832134396, -0.3322350949837038, -0.09855183923187164, 0.052826826711400196, 0.13916438680070525, -0.1158954744728712, 0.0014296812184441548, -0.12491660160370745, 0.09828737042306994, -0.10550291416718839, 0.061781777474187456, 0.12998960306867957, -0.07408633869748044, -0.07146118651144207, 0.431856412297258, -0.04466843818171093, -0.2976014436974835, 0.17222342821053013, -0.20167368191939133, -0.15962066909728143, 0.15888459135133487, 0.11338454578071833, 0.15867561735929206, -0.0037293228356597517, 0.2244746231523235, -0.1813604421197222, 0.09051717076307306, 0.04115580038454097, 0.07788091053505643, 0.10126667900476605, 0.16371945777567676, 0.1656050737409924, 0.10826302201558764, -0.035088859068659634, 0.02773751420430087, -0.34475082545899427, -0.18831193174880284, -0.16016916837767126, 0.12596244101699156, -0.1595359890572861, -0.2526808119773005, 0.3470189640065655, 0.003406206795121901, 0.2049524121774504, 0.06973407800810841, 0.20815596716979948, -0.057312922982069164, -0.003648122915854821, 0.1038846106787857, 0.04666823854383368, 0.14346963258531803, -0.04290589552301054, -0.060854961594136864, 0.004485669169718256, 0.21679304839255145]
|
1,803.071
|
VGAN-Based Image Representation Learning for Privacy-Preserving Facial
Expression Recognition
|
Reliable facial expression recognition plays a critical role in human-machine
interactions. However, most of the facial expression analysis methodologies
proposed to date pay little or no attention to the protection of a user's
privacy. In this paper, we propose a Privacy-Preserving Representation-Learning
Variational Generative Adversarial Network (PPRL-VGAN) to learn an image
representation that is explicitly disentangled from the identity information.
At the same time, this representation is discriminative from the standpoint of
facial expression recognition and generative as it allows expression-equivalent
face image synthesis. We evaluate the proposed model on two public datasets
under various threat scenarios. Quantitative and qualitative results
demonstrate that our approach strikes a balance between the preservation of
privacy and data utility. We further demonstrate that our model can be
effectively applied to other tasks such as expression morphing and image
completion.
|
cs.CV
|
reliable facial expression recognition plays a critical role in humanmachine interactions however most of the facial expression analysis methodologies proposed to date pay little or no attention to the protection of a users privacy in this paper we propose a privacypreserving representationlearning variational generative adversarial network pprlvgan to learn an image representation that is explicitly disentangled from the identity information at the same time this representation is discriminative from the standpoint of facial expression recognition and generative as it allows expressionequivalent face image synthesis we evaluate the proposed model on two public datasets under various threat scenarios quantitative and qualitative results demonstrate that our approach strikes a balance between the preservation of privacy and data utility we further demonstrate that our model can be effectively applied to other tasks such as expression morphing and image completion
|
[['reliable', 'facial', 'expression', 'recognition', 'plays', 'a', 'critical', 'role', 'in', 'humanmachine', 'interactions', 'however', 'most', 'of', 'the', 'facial', 'expression', 'analysis', 'methodologies', 'proposed', 'to', 'date', 'pay', 'little', 'or', 'no', 'attention', 'to', 'the', 'protection', 'of', 'a', 'users', 'privacy', 'in', 'this', 'paper', 'we', 'propose', 'a', 'privacypreserving', 'representationlearning', 'variational', 'generative', 'adversarial', 'network', 'pprlvgan', 'to', 'learn', 'an', 'image', 'representation', 'that', 'is', 'explicitly', 'disentangled', 'from', 'the', 'identity', 'information', 'at', 'the', 'same', 'time', 'this', 'representation', 'is', 'discriminative', 'from', 'the', 'standpoint', 'of', 'facial', 'expression', 'recognition', 'and', 'generative', 'as', 'it', 'allows', 'expressionequivalent', 'face', 'image', 'synthesis', 'we', 'evaluate', 'the', 'proposed', 'model', 'on', 'two', 'public', 'datasets', 'under', 'various', 'threat', 'scenarios', 'quantitative', 'and', 'qualitative', 'results', 'demonstrate', 'that', 'our', 'approach', 'strikes', 'a', 'balance', 'between', 'the', 'preservation', 'of', 'privacy', 'and', 'data', 'utility', 'we', 'further', 'demonstrate', 'that', 'our', 'model', 'can', 'be', 'effectively', 'applied', 'to', 'other', 'tasks', 'such', 'as', 'expression', 'morphing', 'and', 'image', 'completion']]
|
[-0.05072095972979302, -0.08219436147680712, -0.10069422516494002, 0.1049162134729715, -0.106649445672172, -0.1942212917640416, 0.0266671499746518, 0.43609212969999706, -0.255376742726171, -0.3357772393040915, 0.06456724379329817, -0.295072484902326, -0.26101794732394, 0.1756577017706638, -0.1790847132406406, 0.077081753967031, 0.105210777792607, 0.08023254617131245, -0.02465431933198298, -0.2328071523068556, 0.30871268219675924, 0.02881221123797291, 0.3884732565397758, 0.09588193563777439, 0.12266888675964507, -0.01676557517311633, -0.011339191512427111, -0.045375444788186906, -0.06942943505739312, 0.18894824309973046, 0.33977722744943933, 0.2473175653096622, 0.3134258082136512, -0.4274517947376998, -0.2064697589280445, 0.08348125053931084, 0.13026495595113374, 0.154077898197631, -0.11398181136534202, -0.343963684950288, 0.06145491042376822, -0.20240182965410067, 0.02398279978400235, -0.17716407056970856, -0.016440691676602434, -0.08150396614297252, -0.31538808110878985, 0.020198937880792724, 0.09252766805089344, 0.10462399030715894, -0.08093882766560957, -0.06269886846299659, -0.02536187101843586, 0.2393870700633765, 0.09501643503022228, 0.04193559680533693, 0.14872321881329528, -0.2216156232096372, -0.12035301910520448, 0.38814925608127865, -0.05058215359580328, -0.2320755985912992, 0.16856202063039502, -0.031116002753599367, -0.1786592982139494, 0.0693240142887019, 0.23730244318634938, 0.09986105539710886, -0.19868090160802673, 0.012357952439837824, -0.0623403912159934, 0.19403301900489006, 0.04578660795492912, 0.0007535094636798239, 0.16761415779117994, 0.20499570247953508, 0.04476167866265151, 0.16248548992886902, -0.1373048978979324, -0.07751271661558647, -0.2208581619041124, -0.10346849568000537, -0.1704730034958738, -0.0047402493125731264, -0.11720270037941231, -0.11320295492884332, 0.419856946004916, 0.25762355966326683, 0.1951128308107006, 0.10015423286275299, 0.3882997988014301, 0.044634894652069726, 0.09573938003602202, 0.04852379222205882, 0.16127667702046403, -0.01484236482933942, 0.11190393299156272, -0.18752588006561802, 0.14092568450940968, 0.04211111497411977]
|
1,803.07101
|
Internal spin resistance of spin batteries
|
For spin batteries we introduce the concept of internal spin resistance which
quantifies the amount of backflow from the load to the battery. It allows to
relate through a Thevenin-Norton relation, spin current sources to spin
accumulation sources. The value of the internal spin resistance is derived
explicitly for several spin batteries based on spin injection, ferromagnetic
resonance or spin Hall effect.
|
cond-mat.mes-hall
|
for spin batteries we introduce the concept of internal spin resistance which quantifies the amount of backflow from the load to the battery it allows to relate through a theveninnorton relation spin current sources to spin accumulation sources the value of the internal spin resistance is derived explicitly for several spin batteries based on spin injection ferromagnetic resonance or spin hall effect
|
[['for', 'spin', 'batteries', 'we', 'introduce', 'the', 'concept', 'of', 'internal', 'spin', 'resistance', 'which', 'quantifies', 'the', 'amount', 'of', 'backflow', 'from', 'the', 'load', 'to', 'the', 'battery', 'it', 'allows', 'to', 'relate', 'through', 'a', 'theveninnorton', 'relation', 'spin', 'current', 'sources', 'to', 'spin', 'accumulation', 'sources', 'the', 'value', 'of', 'the', 'internal', 'spin', 'resistance', 'is', 'derived', 'explicitly', 'for', 'several', 'spin', 'batteries', 'based', 'on', 'spin', 'injection', 'ferromagnetic', 'resonance', 'or', 'spin', 'hall', 'effect']]
|
[-0.17478348595685647, 0.2275101171317892, -0.0034760280100048567, -0.007428070612358632, -0.10641543472521618, -0.11538935900803228, 0.06352023975770982, 0.3507828267260653, -0.289441707315015, -0.3065335213160906, 0.023583065084807696, -0.2939908227878031, -0.046130825738712654, 0.2554259031350709, -0.0025122059875580132, 0.0010241440756887687, -0.04418969231840895, 0.02208864911398316, -0.09225743639542432, -0.1415217992521395, 0.2990496521968333, 0.04365168221020063, 0.33291725938009925, 0.10998956027028502, 0.17124351010215086, 0.027928349789094607, 0.08519955119881474, 0.010223325189264094, -0.130387695948975, 0.08021975777180651, 0.21916958359909838, -0.01819546704684369, 0.16188699141389035, -0.48375243284418934, -0.21690130465831914, 0.05738483184612677, 0.04463749441898382, 0.2062923318007961, -0.025527501251685937, -0.23115050017100866, 0.028839471635454503, -0.28242751188408277, -0.09441676070593054, -0.06636044430569364, 0.018700844527138244, -0.037772154076727196, -0.22444815973400092, 0.12502986174382147, 0.10307440051778419, 0.047954955550490834, -0.07563491402380931, -0.14197895453754264, -0.10904791847359939, 0.11066385332998804, 0.05645853227202888, -0.026002337850752424, 0.2575666364740397, -0.12120873026061253, -0.19215710874986605, 0.2641401505784788, -0.019886215538030765, -0.22577483475696844, 0.12992426090431017, -0.1747843874618411, -0.035175765227129466, 0.10382170333969788, 0.13699721355662972, 0.053380711294222075, -0.17399432710142898, -0.02129836714841792, 0.05662902133142362, 0.14958032611833855, 0.01448740874279718, 0.08466019879904438, 0.3197204377196851, 0.1863080584978471, 0.1317272770188016, 0.17340691311315434, -0.20652408449391482, -0.07815686845388568, -0.20195843633569655, -0.21376037307572168, -0.24006442125642397, 0.19478220784212233, -0.0407459558155693, -0.12675789899200385, 0.41582043694912413, 0.22724531003136617, 0.11022432837024575, -0.014805333022806854, 0.30817400413702745, 0.11732203942402954, 0.09234909933121478, 0.04151502383689656, 0.19531386686092028, 0.234968696873574, 0.13386145301285338, -0.3972996734120868, 0.1412872331995578, 0.004167631629197935]
|
1,803.07102
|
Learning non-Gaussian Time Series using the Box-Cox Gaussian Process
|
Gaussian processes (GPs) are Bayesian nonparametric generative models that
provide interpretability of hyperparameters, admit closed-form expressions for
training and inference, and are able to accurately represent uncertainty. To
model general non-Gaussian data with complex correlation structure, GPs can be
paired with an expressive covariance kernel and then fed into a nonlinear
transformation (or warping). However, overparametrising the kernel and the
warping is known to, respectively, hinder gradient-based training and make the
predictions computationally expensive. We remedy this issue by (i) training the
model using derivative-free global-optimisation techniques so as to find
meaningful maxima of the model likelihood, and (ii) proposing a warping
function based on the celebrated Box-Cox transformation that requires minimal
numerical approximations---unlike existing warped GP models. We validate the
proposed approach by first showing that predictions can be computed
analytically, and then on a learning, reconstruction and forecasting experiment
using real-world datasets.
|
stat.ML cs.LG
|
gaussian processes gps are bayesian nonparametric generative models that provide interpretability of hyperparameters admit closedform expressions for training and inference and are able to accurately represent uncertainty to model general nongaussian data with complex correlation structure gps can be paired with an expressive covariance kernel and then fed into a nonlinear transformation or warping however overparametrising the kernel and the warping is known to respectively hinder gradientbased training and make the predictions computationally expensive we remedy this issue by i training the model using derivativefree globaloptimisation techniques so as to find meaningful maxima of the model likelihood and ii proposing a warping function based on the celebrated boxcox transformation that requires minimal numerical approximationsunlike existing warped gp models we validate the proposed approach by first showing that predictions can be computed analytically and then on a learning reconstruction and forecasting experiment using realworld datasets
|
[['gaussian', 'processes', 'gps', 'are', 'bayesian', 'nonparametric', 'generative', 'models', 'that', 'provide', 'interpretability', 'of', 'hyperparameters', 'admit', 'closedform', 'expressions', 'for', 'training', 'and', 'inference', 'and', 'are', 'able', 'to', 'accurately', 'represent', 'uncertainty', 'to', 'model', 'general', 'nongaussian', 'data', 'with', 'complex', 'correlation', 'structure', 'gps', 'can', 'be', 'paired', 'with', 'an', 'expressive', 'covariance', 'kernel', 'and', 'then', 'fed', 'into', 'a', 'nonlinear', 'transformation', 'or', 'warping', 'however', 'overparametrising', 'the', 'kernel', 'and', 'the', 'warping', 'is', 'known', 'to', 'respectively', 'hinder', 'gradientbased', 'training', 'and', 'make', 'the', 'predictions', 'computationally', 'expensive', 'we', 'remedy', 'this', 'issue', 'by', 'i', 'training', 'the', 'model', 'using', 'derivativefree', 'globaloptimisation', 'techniques', 'so', 'as', 'to', 'find', 'meaningful', 'maxima', 'of', 'the', 'model', 'likelihood', 'and', 'ii', 'proposing', 'a', 'warping', 'function', 'based', 'on', 'the', 'celebrated', 'boxcox', 'transformation', 'that', 'requires', 'minimal', 'numerical', 'approximationsunlike', 'existing', 'warped', 'gp', 'models', 'we', 'validate', 'the', 'proposed', 'approach', 'by', 'first', 'showing', 'that', 'predictions', 'can', 'be', 'computed', 'analytically', 'and', 'then', 'on', 'a', 'learning', 'reconstruction', 'and', 'forecasting', 'experiment', 'using', 'realworld', 'datasets']]
|
[0.01969652312497298, -0.012367684457592289, -0.08433509628446971, 0.14428638893919368, -0.150865065062696, -0.2177242951018485, 0.02840808524373681, 0.4578766272905289, -0.2836803265497194, -0.32007028552181754, 0.10255186568205872, -0.23768859959276828, -0.2316255223299938, 0.17925067095363395, -0.0736371614666431, 0.12204421827477133, 0.10284463562821006, -0.029708258574622094, -0.11314583030126407, -0.2570124210703933, 0.28978307823260835, 0.08093048846150966, 0.29945467673374193, -0.03013816277879614, 0.13183076818496756, -0.023574139168221795, -0.04838031008080018, 0.002017480525987368, -0.0813354124514372, 0.1453026629990984, 0.2765324862650864, 0.21375587107679733, 0.2794325902665047, -0.43639720974371154, -0.23732536106043436, 0.11360331103354296, 0.15727337205399436, 0.089696884777084, -0.0072609100305865, -0.3257133507414173, 0.03422472539443708, -0.16751379255496018, -0.021352693002591742, -0.23239016102904336, -0.039474699580183265, -0.005330492900056989, -0.368811204863121, 0.10230958409266215, 0.05248784255203361, 0.023175810301900968, -0.04209913954085915, -0.09917442485316927, -0.009262739763271513, 0.07737044243188244, 0.04449468890727966, 0.004220704574481393, 0.10059914388858997, -0.11989116594228391, -0.13165183079962334, 0.3439140778384997, -0.06457924409208039, -0.2725544121340974, 0.16085099112981407, -0.04391847875180608, -0.13703316986455139, 0.09612606339493489, 0.23083972196418343, 0.10471188003223733, -0.17875694696410024, 0.04844117639190022, -0.0036393734098062024, 0.14753278436845974, 0.017689001574742454, -0.06329912807031185, 0.1604136478928651, 0.1948375857653136, 0.03159916457878624, 0.12421723170922606, -0.1411731199209466, -0.10050298675980604, -0.2648731768923871, -0.0796709348718431, -0.2108339247762734, -0.0006325255009405156, -0.13179914038942084, -0.17992953654933483, 0.38297912075864615, 0.2114145787076113, 0.22333989715441427, 0.1643839170991159, 0.35843574872623524, 0.1283380065554198, 0.0847065131318696, 0.10883778069293827, 0.19452799961766795, 0.051237747403429755, 0.028928302433209638, -0.14627728925056835, 0.11726501577447915, 0.032943259643932396]
|
1,803.07103
|
Divisors on matroids and their volumes
|
The classical volume polynomial in algebraic geometry measures the degrees of
ample (and nef) divisors on a smooth projective variety. We introduce an
analogous volume polynomial for matroids, and give a complete combinatorial
formula. For a realizable matroid, we thus obtain an explicit formula for the
classical volume polynomial of the associated wonderful compactification. We
then introduce a new invariant called the volume of a matroid as a particular
specialization of its volume polynomial, and discuss its algebro-geometric and
combinatorial properties in connection to graded linear series on blow-ups of
projective spaces.
|
math.CO math.AC math.AG
|
the classical volume polynomial in algebraic geometry measures the degrees of ample and nef divisors on a smooth projective variety we introduce an analogous volume polynomial for matroids and give a complete combinatorial formula for a realizable matroid we thus obtain an explicit formula for the classical volume polynomial of the associated wonderful compactification we then introduce a new invariant called the volume of a matroid as a particular specialization of its volume polynomial and discuss its algebrogeometric and combinatorial properties in connection to graded linear series on blowups of projective spaces
|
[['the', 'classical', 'volume', 'polynomial', 'in', 'algebraic', 'geometry', 'measures', 'the', 'degrees', 'of', 'ample', 'and', 'nef', 'divisors', 'on', 'a', 'smooth', 'projective', 'variety', 'we', 'introduce', 'an', 'analogous', 'volume', 'polynomial', 'for', 'matroids', 'and', 'give', 'a', 'complete', 'combinatorial', 'formula', 'for', 'a', 'realizable', 'matroid', 'we', 'thus', 'obtain', 'an', 'explicit', 'formula', 'for', 'the', 'classical', 'volume', 'polynomial', 'of', 'the', 'associated', 'wonderful', 'compactification', 'we', 'then', 'introduce', 'a', 'new', 'invariant', 'called', 'the', 'volume', 'of', 'a', 'matroid', 'as', 'a', 'particular', 'specialization', 'of', 'its', 'volume', 'polynomial', 'and', 'discuss', 'its', 'algebrogeometric', 'and', 'combinatorial', 'properties', 'in', 'connection', 'to', 'graded', 'linear', 'series', 'on', 'blowups', 'of', 'projective', 'spaces']]
|
[-0.17572163683159844, 0.015800497801177225, -0.09577773407142123, 0.11217737695424938, -0.1518788240323572, -0.1211971003845658, 0.020357577173221533, 0.28277775770782126, -0.3697144134860972, -0.1562836548166714, 0.12643043070578563, -0.17820711204599912, -0.18062217863094385, 0.23585682698404012, -0.20196629459362314, 0.012553508488370268, 0.0011133450518726654, 0.07906816793484209, -0.15398551698039545, -0.3209451207354584, 0.40794621444428747, -0.009873933710522302, 0.20003750475386725, 0.1123045283805012, 0.20305170663429992, 0.03181207884588967, -0.024401280036924974, 0.04561302867596564, -0.2361446678152551, 0.17636309515522874, 0.30798499932026735, 0.14966585409685806, 0.15456899705990826, -0.3948899600148687, -0.09708407408375617, 0.21978943949848737, 0.10181762793344325, 0.03622693731955698, -0.027861850197001804, -0.20150052158809875, 0.04378028478189979, -0.1553482787719037, -0.2043647436151767, -0.13376785179033227, 0.06948986959279231, 0.025762266479432583, -0.23670799548373275, -0.05252690152163901, 0.06538447822727587, 0.20370476780985686, 0.004387686188514952, -0.0853205609841414, -0.0054579997313735275, -0.007184213184265663, -0.06874660057339656, 0.04227907554266731, 0.06654272339327018, -0.09255974813435308, -0.14100757636555025, 0.3624763462247084, -0.023551098627807653, -0.254004478616559, 0.11484502909360858, -0.11573434790150951, -0.15744092117276284, 0.1593416251555976, 0.15261739413456424, 0.16444732305472312, -0.0049495408615178385, 0.17853653684774737, -0.17358113368264522, 0.051939569626246455, 0.10443128498888615, 0.020784247772889616, 0.13540355150547365, 0.08898744598263875, 0.1186017563070535, 0.19628891494800843, 0.03633928329762294, -0.066146813712017, -0.3667863243178505, -0.26081431465243676, -0.15369434189557543, 0.1715665570480506, -0.22221766701714724, -0.24487238356074237, 0.40070286144644185, -0.009865541756406183, 0.2098433143540245, 0.18493710629358565, 0.25512772857252025, 0.03392867916946947, -0.0008169581820054547, -0.0003698531180144409, 0.10826628432487664, 0.23063865970091327, 0.01488889525037097, -0.1395601252696234, 0.00882550397363957, 0.2484710217382678]
|
1,803.07104
|
New perspectives on the supernova remnant Puppis A based on a radio
polarization study
|
We present a polarization study towards the supernova remnant (SNR) Puppis A
based on original observations performed with the Australia Telescope Compact
Array (ATCA). Based on the analysis of a feature detected outside the SNR shell
(called `the tail' throughout the paper), it was possible to disentangle the
emission with origin in Puppis A itself from that coming from the foreground
Vela SNR. We found a very low polarization fraction, of about 3 percent on
average. The upper limit of the magnetic field component parallel to the line
of sight is estimated to be B$_\parallel \sim$ 20 $\mu$G. The statistical
behavior of the magnetic vectors shows two preferential directions, almost
perpendicular to each other, which are approximately aligned with the flat
edges of Puppis A. A third, narrow peak oriented perpendicular to the Galactic
plane suggests the existence of an interstellar magnetic field locally aligned
in this direction. There is evidence that the magnetic vectors along the shell
are aligned with the shock front direction. The low polarization fraction and
the statistical behavior of the magnetic vectors are compatible with a scenario
where the SNR evolves inside a stellar wind bubble with a box-like morphology,
produced by the interaction of the different stellar winds, one of them
magnetized, launched by the SN progenitor. This scenario can furthermore
explain the morphology of Puppis A, rendering little support to the previously
accepted picture which involved strong density gradients to explain the flat,
eastern edge of the shell.
|
astro-ph.HE astro-ph.GA astro-ph.SR
|
we present a polarization study towards the supernova remnant snr puppis a based on original observations performed with the australia telescope compact array atca based on the analysis of a feature detected outside the snr shell called the tail throughout the paper it was possible to disentangle the emission with origin in puppis a itself from that coming from the foreground vela snr we found a very low polarization fraction of about 3 percent on average the upper limit of the magnetic field component parallel to the line of sight is estimated to be b_parallel sim 20 mug the statistical behavior of the magnetic vectors shows two preferential directions almost perpendicular to each other which are approximately aligned with the flat edges of puppis a a third narrow peak oriented perpendicular to the galactic plane suggests the existence of an interstellar magnetic field locally aligned in this direction there is evidence that the magnetic vectors along the shell are aligned with the shock front direction the low polarization fraction and the statistical behavior of the magnetic vectors are compatible with a scenario where the snr evolves inside a stellar wind bubble with a boxlike morphology produced by the interaction of the different stellar winds one of them magnetized launched by the sn progenitor this scenario can furthermore explain the morphology of puppis a rendering little support to the previously accepted picture which involved strong density gradients to explain the flat eastern edge of the shell
|
[['we', 'present', 'a', 'polarization', 'study', 'towards', 'the', 'supernova', 'remnant', 'snr', 'puppis', 'a', 'based', 'on', 'original', 'observations', 'performed', 'with', 'the', 'australia', 'telescope', 'compact', 'array', 'atca', 'based', 'on', 'the', 'analysis', 'of', 'a', 'feature', 'detected', 'outside', 'the', 'snr', 'shell', 'called', 'the', 'tail', 'throughout', 'the', 'paper', 'it', 'was', 'possible', 'to', 'disentangle', 'the', 'emission', 'with', 'origin', 'in', 'puppis', 'a', 'itself', 'from', 'that', 'coming', 'from', 'the', 'foreground', 'vela', 'snr', 'we', 'found', 'a', 'very', 'low', 'polarization', 'fraction', 'of', 'about', '3', 'percent', 'on', 'average', 'the', 'upper', 'limit', 'of', 'the', 'magnetic', 'field', 'component', 'parallel', 'to', 'the', 'line', 'of', 'sight', 'is', 'estimated', 'to', 'be', 'b_parallel', 'sim', '20', 'mug', 'the', 'statistical', 'behavior', 'of', 'the', 'magnetic', 'vectors', 'shows', 'two', 'preferential', 'directions', 'almost', 'perpendicular', 'to', 'each', 'other', 'which', 'are', 'approximately', 'aligned', 'with', 'the', 'flat', 'edges', 'of', 'puppis', 'a', 'a', 'third', 'narrow', 'peak', 'oriented', 'perpendicular', 'to', 'the', 'galactic', 'plane', 'suggests', 'the', 'existence', 'of', 'an', 'interstellar', 'magnetic', 'field', 'locally', 'aligned', 'in', 'this', 'direction', 'there', 'is', 'evidence', 'that', 'the', 'magnetic', 'vectors', 'along', 'the', 'shell', 'are', 'aligned', 'with', 'the', 'shock', 'front', 'direction', 'the', 'low', 'polarization', 'fraction', 'and', 'the', 'statistical', 'behavior', 'of', 'the', 'magnetic', 'vectors', 'are', 'compatible', 'with', 'a', 'scenario', 'where', 'the', 'snr', 'evolves', 'inside', 'a', 'stellar', 'wind', 'bubble', 'with', 'a', 'boxlike', 'morphology', 'produced', 'by', 'the', 'interaction', 'of', 'the', 'different', 'stellar', 'winds', 'one', 'of', 'them', 'magnetized', 'launched', 'by', 'the', 'sn', 'progenitor', 'this', 'scenario', 'can', 'furthermore', 'explain', 'the', 'morphology', 'of', 'puppis', 'a', 'rendering', 'little', 'support', 'to', 'the', 'previously', 'accepted', 'picture', 'which', 'involved', 'strong', 'density', 'gradients', 'to', 'explain', 'the', 'flat', 'eastern', 'edge', 'of', 'the', 'shell']]
|
[-0.15373080668576555, 0.10770825785329347, -0.049338404714529, 0.042907738218996294, -0.12269114384389654, -0.08021692964224601, 0.03300615069313849, 0.434598174531545, -0.23518396735533464, -0.2934657119775229, 0.05960300775073773, -0.2638189567519086, -0.035193997142570356, 0.15996501722886247, 0.03671666606431393, -0.0949582032327141, 0.053175222748244294, -0.007847913146513154, -0.047814360738979, -0.19482510831986308, 0.28791253426378327, 0.10645077916964585, 0.24658219974335968, -0.0006755709671890553, 0.08617364599165145, -0.09200053567123809, -0.01106538115525428, 0.021243937960374455, -0.07076806334466246, 0.08930317843713019, 0.18084560109555425, 0.09995194794610143, 0.1922382602623601, -0.3980136526805558, -0.21093749636641645, 0.04649693295549678, 0.17754777938089505, 0.038567092289615953, -0.0444497883182057, -0.2875453798480484, 0.07998781528666007, -0.15882291026717546, -0.2295689856728577, 0.10198181859236591, 0.017993176766737763, 0.022134067833765734, -0.21093718808676515, 0.08918531116440284, 0.03808492310036316, 0.061967130601097244, -0.10373594161237076, -0.10732162341960155, -0.054502792985710716, 0.05326662714574106, 0.09580459415304418, 0.13196433739527605, 0.151235817583772, -0.1190669789294904, -0.032868214195347106, 0.3749091264012517, -0.06256620795466006, -0.08353154267355496, 0.19153915549419365, -0.23322121023784906, -0.1366732448196913, 0.19607190624145523, 0.15881508872939312, 0.08142791776157611, -0.11280089428610339, 0.020232731076337548, -0.05889744143030245, 0.18923878476940742, 0.04893807686713277, 0.002988842619512924, 0.30397883621709687, 0.11416994374772838, 0.03849564550482497, 0.17252773796089413, -0.23890860534988212, -0.050854511996398545, -0.2677741284976352, -0.11498302407372667, -0.1557741240241888, 0.07486632738965658, -0.14276871472633948, -0.17543249683839515, 0.3730090096364824, 0.11430338639956043, 0.23312516480836334, -0.014460246229297197, 0.32206412817978736, 0.056081857202498586, 0.06944365614801835, 0.14099487884882458, 0.31262637584337166, 0.18990479615821065, 0.1070889928349655, -0.20201859265751188, 0.10479816517659596, -0.01084028515033424]
|
1,803.07105
|
A New Bound on Hrushovski's Algorithm for Computing the Galois Group of
a Linear Differential Equation
|
The complexity of computing the Galois group of a linear differential
equation is of general interest. In a recent work, Feng gave the first degree
bound on Hrushovski's algorithm for computing the Galois group of a linear
differential equation. This bound is the degree bound of the polynomials used
in the first step of the algorithm for finding a proto-Galois group and is
sextuply exponential in the order of the differential equation. In this paper,
we use Szanto's algorithm of triangular representation for algebraic sets to
analyze the complexity of computing the Galois group of a linear differential
equation and we give a new bound which is triple exponential in the order of
the given differential equation.
|
math.AC cs.SC math.AG
|
the complexity of computing the galois group of a linear differential equation is of general interest in a recent work feng gave the first degree bound on hrushovskis algorithm for computing the galois group of a linear differential equation this bound is the degree bound of the polynomials used in the first step of the algorithm for finding a protogalois group and is sextuply exponential in the order of the differential equation in this paper we use szantos algorithm of triangular representation for algebraic sets to analyze the complexity of computing the galois group of a linear differential equation and we give a new bound which is triple exponential in the order of the given differential equation
|
[['the', 'complexity', 'of', 'computing', 'the', 'galois', 'group', 'of', 'a', 'linear', 'differential', 'equation', 'is', 'of', 'general', 'interest', 'in', 'a', 'recent', 'work', 'feng', 'gave', 'the', 'first', 'degree', 'bound', 'on', 'hrushovskis', 'algorithm', 'for', 'computing', 'the', 'galois', 'group', 'of', 'a', 'linear', 'differential', 'equation', 'this', 'bound', 'is', 'the', 'degree', 'bound', 'of', 'the', 'polynomials', 'used', 'in', 'the', 'first', 'step', 'of', 'the', 'algorithm', 'for', 'finding', 'a', 'protogalois', 'group', 'and', 'is', 'sextuply', 'exponential', 'in', 'the', 'order', 'of', 'the', 'differential', 'equation', 'in', 'this', 'paper', 'we', 'use', 'szantos', 'algorithm', 'of', 'triangular', 'representation', 'for', 'algebraic', 'sets', 'to', 'analyze', 'the', 'complexity', 'of', 'computing', 'the', 'galois', 'group', 'of', 'a', 'linear', 'differential', 'equation', 'and', 'we', 'give', 'a', 'new', 'bound', 'which', 'is', 'triple', 'exponential', 'in', 'the', 'order', 'of', 'the', 'given', 'differential', 'equation']]
|
[-0.1884189000920109, 0.014014000364619753, -0.15784132732483355, 0.02484802899112844, -0.1135837620853082, -0.08722645069432, 0.022140315034345763, 0.23408246198264154, -0.3242043281338461, -0.3143363459886092, 0.08260560574151737, -0.24874082204440365, -0.18376471243960701, 0.20715965278770612, -0.08257463266668112, 0.10359776589371587, 0.001546948889027471, 0.12561725713312627, -0.08780912733839258, -0.31492280845084913, 0.3670329843222609, 0.0015023149307007374, 0.19976210786110682, 0.01204315106505933, 0.15267378589057404, -0.0015731858332519947, -0.040618829540503415, -0.025872608209433764, -0.165668868581238, 0.185972392939679, 0.2736002889664277, 0.08881405267621512, 0.2644415171816945, -0.37445887032410374, -0.103598026101194, 0.1408499227958205, 0.1319308067429001, 0.1364076103883512, -0.0718635521798759, -0.24867317448167697, 0.07474651835129961, -0.1514541218525467, -0.15019011219315556, -0.028871981238784348, 0.052286936917706674, 0.031215715149174567, -0.2722485025534811, 0.0519023054279387, 0.0935564842156094, 0.09493779028239457, -0.029339338240780583, -0.11043122614450429, 0.03305336140177172, 0.04893695292184534, -0.04345176395676706, 0.02145995964984531, 0.01573542104629071, -0.1255297159411661, -0.13217194393763076, 0.36561290825838627, -0.1032245138194412, -0.19806188496396593, 0.07159461985625651, -0.14264334013037708, -0.18872621925345257, 0.12807504703169284, 0.2134482350240907, 0.1584928226697704, -0.10385893786164081, 0.1850610895153216, -0.11877824377430522, 0.12423832078423837, 0.04248101274766352, -0.01044299144692638, 0.03908636724252416, 0.16724323873286662, 0.1307034060885401, 0.1348548920015278, -0.002731194547579988, -0.08739007688734843, -0.31639896755957087, -0.23375148472538138, -0.1549512843236975, 0.03312150506788622, -0.11588972726325586, -0.1738875840102201, 0.4235838679191859, 0.08093985053508178, 0.16722342951790145, 0.10968854434727489, 0.2703883381155522, 0.21633651878117868, 0.006388538023052008, 0.08656131443605536, 0.1640439845378632, 0.2293851647849964, 0.038658269434033526, -0.24170832679323528, 0.05789564602056761, 0.17373520512862697]
|
1,803.07106
|
On the Terminal Rotation Rates of Giant Planets
|
Within the general framework of core-nucleated accretion theory of giant
planet formation, the conglomeration of massive gaseous envelopes is
facilitated by a transient period of rapid accumulation of nebular material.
While the concurrent buildup of angular momentum is expected to leave newly
formed planets spinning at near-breakup velocities, Jupiter and Saturn, as well
as super-Jovian long-period extrasolar planets, are observed to rotate well
below criticality. In this work, we demonstrate that the large luminosity of a
young giant planet simultaneously leads to the generation of a strong planetary
magnetic field, as well as thermal ionization of the circumplanetary disk. The
ensuing magnetic coupling between the planetary interior and the
quasi-Keplerian motion of the disk results in efficient braking of planetary
rotation, with hydrodynamic circulation of gas within the Hill sphere playing
the key role of expelling spin angular momentum to the circumstellar nebula.
Our results place early-stage giant planet and stellar rotation within the same
evolutionary framework, and motivate further exploration of magnetohydrodynamic
phenomena in the context of the final stages of giant planet formation.
|
astro-ph.EP
|
within the general framework of corenucleated accretion theory of giant planet formation the conglomeration of massive gaseous envelopes is facilitated by a transient period of rapid accumulation of nebular material while the concurrent buildup of angular momentum is expected to leave newly formed planets spinning at nearbreakup velocities jupiter and saturn as well as superjovian longperiod extrasolar planets are observed to rotate well below criticality in this work we demonstrate that the large luminosity of a young giant planet simultaneously leads to the generation of a strong planetary magnetic field as well as thermal ionization of the circumplanetary disk the ensuing magnetic coupling between the planetary interior and the quasikeplerian motion of the disk results in efficient braking of planetary rotation with hydrodynamic circulation of gas within the hill sphere playing the key role of expelling spin angular momentum to the circumstellar nebula our results place earlystage giant planet and stellar rotation within the same evolutionary framework and motivate further exploration of magnetohydrodynamic phenomena in the context of the final stages of giant planet formation
|
[['within', 'the', 'general', 'framework', 'of', 'corenucleated', 'accretion', 'theory', 'of', 'giant', 'planet', 'formation', 'the', 'conglomeration', 'of', 'massive', 'gaseous', 'envelopes', 'is', 'facilitated', 'by', 'a', 'transient', 'period', 'of', 'rapid', 'accumulation', 'of', 'nebular', 'material', 'while', 'the', 'concurrent', 'buildup', 'of', 'angular', 'momentum', 'is', 'expected', 'to', 'leave', 'newly', 'formed', 'planets', 'spinning', 'at', 'nearbreakup', 'velocities', 'jupiter', 'and', 'saturn', 'as', 'well', 'as', 'superjovian', 'longperiod', 'extrasolar', 'planets', 'are', 'observed', 'to', 'rotate', 'well', 'below', 'criticality', 'in', 'this', 'work', 'we', 'demonstrate', 'that', 'the', 'large', 'luminosity', 'of', 'a', 'young', 'giant', 'planet', 'simultaneously', 'leads', 'to', 'the', 'generation', 'of', 'a', 'strong', 'planetary', 'magnetic', 'field', 'as', 'well', 'as', 'thermal', 'ionization', 'of', 'the', 'circumplanetary', 'disk', 'the', 'ensuing', 'magnetic', 'coupling', 'between', 'the', 'planetary', 'interior', 'and', 'the', 'quasikeplerian', 'motion', 'of', 'the', 'disk', 'results', 'in', 'efficient', 'braking', 'of', 'planetary', 'rotation', 'with', 'hydrodynamic', 'circulation', 'of', 'gas', 'within', 'the', 'hill', 'sphere', 'playing', 'the', 'key', 'role', 'of', 'expelling', 'spin', 'angular', 'momentum', 'to', 'the', 'circumstellar', 'nebula', 'our', 'results', 'place', 'earlystage', 'giant', 'planet', 'and', 'stellar', 'rotation', 'within', 'the', 'same', 'evolutionary', 'framework', 'and', 'motivate', 'further', 'exploration', 'of', 'magnetohydrodynamic', 'phenomena', 'in', 'the', 'context', 'of', 'the', 'final', 'stages', 'of', 'giant', 'planet', 'formation']]
|
[-0.13009413733313394, 0.1775350961302008, -0.052605129211608856, 0.04968272865683373, -0.11371454928336398, 0.004924230062003647, 0.009625563664095742, 0.31238473983215437, -0.1854525411501527, -0.36367136047487814, 0.060354652949608865, -0.17627788745532078, -0.0944098556227982, 0.1810536819669817, -0.04769903554847198, 0.024995282042239393, 0.10877322437241674, -0.08501094285930906, -0.009973678199042166, -0.2261458805775536, 0.3027991686575115, 0.09738766330693449, 0.04141108694353274, 0.0022561509029141494, 0.042827309372701815, -0.07637451616515006, -0.005263096150842362, -0.08407565996050835, -0.19336873836969193, 0.039912908460412705, 0.20407855166920594, 0.09675876418926886, 0.22177274565524255, -0.44493435520146574, -0.20688717220510755, -0.013482269482753639, 0.19976582870685627, 0.06552682119421661, -0.06945326727415835, -0.24472708840987512, 0.04873812729758876, -0.2391995791026524, -0.23037819075797286, 0.021503646517438548, 0.08720980971319867, 0.021729621059327787, -0.2717658272172723, 0.11939783396365654, 0.1398232696997002, 0.11712374036666005, -0.14799873335286975, -0.09451198479360236, -0.14082994669143642, 0.09922814614538636, 0.07788235354925616, 0.042449971503977266, 0.23902831013946396, -0.1252723957372031, -0.04902263767485108, 0.4098466945432925, -0.09894158860934632, -0.014292133705956596, 0.2653971738927066, -0.2752544615231454, -0.10156779965385794, 0.1622837261150458, 0.2074287221101778, 0.14441926482333137, -0.13303171311106002, -0.01907440882841391, -0.025655156025396926, 0.11855226317021464, 0.08322157621516713, 0.06147510082627247, 0.46081596633153304, 0.18624332657483006, 0.0354900689023946, 0.10169261059723794, -0.226340815531356, -0.14173086592661482, -0.17910156082894121, -0.16374965073008624, -0.1619062611686864, 0.053343502915065205, -0.12022497107374615, -0.15039732820221355, 0.3256735996070451, 0.10948454751766154, 0.18370278533015932, -0.0179193099002753, 0.33550619810819626, 0.07420240772555449, 0.114477668428278, 0.1380093713743346, 0.33676357543495083, 0.19959773586397725, 0.14123480569704303, -0.34310176891407795, 0.09352141151470797, 0.015222168067869331]
|
1,803.07107
|
Computational performance of a projection and rescaling algorithm
|
This paper documents a computational implementation of a {\em projection and
rescaling algorithm} for finding most interior solutions to the pair of
feasibility problems \[ \text{find} \; x\in L\cap\mathbb{R}^n_{+} \;\;\;\;
\text{ and } \; \;\;\;\; \text{find} \; \hat x\in L^\perp\cap\mathbb{R}^n_{+},
\] where $L$ denotes a linear subspace in $\mathbb{R}^n$ and $L^\perp$ denotes
its orthogonal complement. The projection and rescaling algorithm is a recently
developed method that combines a {\em basic procedure} involving only low-cost
operations with a periodic {\em rescaling step.} We give a full description of
a MATLAB implementation of this algorithm and present multiple sets of
numerical experiments on synthetic problem instances with varied levels of
conditioning. Our computational experiments provide promising evidence of the
effectiveness of the projection and rescaling algorithm.
Our MATLAB code is publicly available. Furthermore, the simplicity of the
algorithm makes a computational implementation in other environments completely
straightforward.
|
math.OC
|
this paper documents a computational implementation of a em projection and rescaling algorithm for finding most interior solutions to the pair of feasibility problems textfind xin lcapmathbbrn_ text and textfind hat xin lperpcapmathbbrn_ where l denotes a linear subspace in mathbbrn and lperp denotes its orthogonal complement the projection and rescaling algorithm is a recently developed method that combines a em basic procedure involving only lowcost operations with a periodic em rescaling step we give a full description of a matlab implementation of this algorithm and present multiple sets of numerical experiments on synthetic problem instances with varied levels of conditioning our computational experiments provide promising evidence of the effectiveness of the projection and rescaling algorithm our matlab code is publicly available furthermore the simplicity of the algorithm makes a computational implementation in other environments completely straightforward
|
[['this', 'paper', 'documents', 'a', 'computational', 'implementation', 'of', 'a', 'em', 'projection', 'and', 'rescaling', 'algorithm', 'for', 'finding', 'most', 'interior', 'solutions', 'to', 'the', 'pair', 'of', 'feasibility', 'problems', 'textfind', 'xin', 'lcapmathbbrn_', 'text', 'and', 'textfind', 'hat', 'xin', 'lperpcapmathbbrn_', 'where', 'l', 'denotes', 'a', 'linear', 'subspace', 'in', 'mathbbrn', 'and', 'lperp', 'denotes', 'its', 'orthogonal', 'complement', 'the', 'projection', 'and', 'rescaling', 'algorithm', 'is', 'a', 'recently', 'developed', 'method', 'that', 'combines', 'a', 'em', 'basic', 'procedure', 'involving', 'only', 'lowcost', 'operations', 'with', 'a', 'periodic', 'em', 'rescaling', 'step', 'we', 'give', 'a', 'full', 'description', 'of', 'a', 'matlab', 'implementation', 'of', 'this', 'algorithm', 'and', 'present', 'multiple', 'sets', 'of', 'numerical', 'experiments', 'on', 'synthetic', 'problem', 'instances', 'with', 'varied', 'levels', 'of', 'conditioning', 'our', 'computational', 'experiments', 'provide', 'promising', 'evidence', 'of', 'the', 'effectiveness', 'of', 'the', 'projection', 'and', 'rescaling', 'algorithm', 'our', 'matlab', 'code', 'is', 'publicly', 'available', 'furthermore', 'the', 'simplicity', 'of', 'the', 'algorithm', 'makes', 'a', 'computational', 'implementation', 'in', 'other', 'environments', 'completely', 'straightforward']]
|
[-0.12815959841288901, -0.01791294712435316, -0.07146343904098978, -0.008243466684749972, -0.10532713437763354, -0.16672260945455897, 0.06863522908426131, 0.39018600287812727, -0.27139607696983686, -0.27747768731787803, 0.11445598280988634, -0.26519574240815863, -0.16500547688833817, 0.22374695578107126, -0.04941528382952567, 0.09492770922930774, 0.15127334946559534, -0.007880071183037083, -0.09434647212943269, -0.2522086573005826, 0.2419536165582637, 0.0456105667821787, 0.2579135691695329, 0.013493230200752064, 0.1729284239243026, -0.008960200673728078, -0.07257821228424156, 0.008743931658359037, -0.09712811182107543, 0.12118139337593069, 0.2452302249700383, 0.23410715902120702, 0.3270962161184461, -0.36548429920717523, -0.13261506032302148, 0.08719471950187452, 0.14286417584797298, 0.0830052148401996, -0.07483871790356245, -0.2765384953193091, 0.09067604351374838, -0.13460672001733823, -0.10130609388428706, -0.1093680246008767, 0.032881560369774146, 0.003761796818839179, -0.3152101811469981, 0.012205467800851222, 0.04529880220242948, 0.045904665978418455, -0.024547699482732072, -0.13750415109787825, 0.05014013511784099, 0.0545296180544904, -0.024078084305963584, 0.07456202946637791, 0.09924020781699154, -0.04985466020319749, -0.14013113717686523, 0.40628650162575974, -0.031395594492830615, -0.24186221822509887, 0.1760092469001258, -0.05714940111739216, -0.14239390054890128, 0.1198215146307592, 0.16467084799875953, 0.14808265454722225, -0.11284778528777814, 0.15383558633857994, -0.07571719986283117, 0.13801144937191295, 0.045265117953358976, -0.014646869963379923, 0.07610782102629957, 0.20638850264647907, 0.07971203950130278, 0.14348564191454055, -0.055865110643208024, -0.03959655758441874, -0.34015596875084425, -0.1583537027860681, -0.2283797280276539, -0.010478655440318915, -0.10599788159964157, -0.1978438569508769, 0.38640336364559413, 0.17674644231382344, 0.17477713595661853, 0.087403169225177, 0.3584445522994631, 0.044701732455373365, 0.0055060805338952275, 0.12732728541380278, 0.09660651576015408, 0.09557071261418362, 0.06573207346308563, -0.22228863729957354, 0.029332339649813043, 0.11887321852975422]
|
1,803.07108
|
The State of the Solar Wind, Magnetosphere, and Ionosphere During the
Maunder Minimum
|
Both direct observations and reconstructions from various datasets, suggest
that conditions were radically different during the Maunder Minimum (MM) than
during the space era. Using an MHD model, we develop a set of feasible
solutions to infer the properties of the solar wind during this interval.
Additionally, we use these results to drive a global magnetospheric model.
Finally, using the 2008/2009 solar minimum as an upper limit for MM conditions,
we use results from the International Reference Ionosphere (ILI) model to
speculate on the state of the ionosphere. The results describe interplanetary,
magnetospheric, and ionospheric conditions that were substantially different
than today. For example: (1) the solar wind density and magnetic field strength
were an order of magnitude lower; (2) the Earth's magnetopause and shock
standoff distances were a factor of two larger; and (3) the maximum electron
density in the ionosphere was substantially lower.
|
physics.space-ph astro-ph.SR
|
both direct observations and reconstructions from various datasets suggest that conditions were radically different during the maunder minimum mm than during the space era using an mhd model we develop a set of feasible solutions to infer the properties of the solar wind during this interval additionally we use these results to drive a global magnetospheric model finally using the 20082009 solar minimum as an upper limit for mm conditions we use results from the international reference ionosphere ili model to speculate on the state of the ionosphere the results describe interplanetary magnetospheric and ionospheric conditions that were substantially different than today for example 1 the solar wind density and magnetic field strength were an order of magnitude lower 2 the earths magnetopause and shock standoff distances were a factor of two larger and 3 the maximum electron density in the ionosphere was substantially lower
|
[['both', 'direct', 'observations', 'and', 'reconstructions', 'from', 'various', 'datasets', 'suggest', 'that', 'conditions', 'were', 'radically', 'different', 'during', 'the', 'maunder', 'minimum', 'mm', 'than', 'during', 'the', 'space', 'era', 'using', 'an', 'mhd', 'model', 'we', 'develop', 'a', 'set', 'of', 'feasible', 'solutions', 'to', 'infer', 'the', 'properties', 'of', 'the', 'solar', 'wind', 'during', 'this', 'interval', 'additionally', 'we', 'use', 'these', 'results', 'to', 'drive', 'a', 'global', 'magnetospheric', 'model', 'finally', 'using', 'the', '20082009', 'solar', 'minimum', 'as', 'an', 'upper', 'limit', 'for', 'mm', 'conditions', 'we', 'use', 'results', 'from', 'the', 'international', 'reference', 'ionosphere', 'ili', 'model', 'to', 'speculate', 'on', 'the', 'state', 'of', 'the', 'ionosphere', 'the', 'results', 'describe', 'interplanetary', 'magnetospheric', 'and', 'ionospheric', 'conditions', 'that', 'were', 'substantially', 'different', 'than', 'today', 'for', 'example', '1', 'the', 'solar', 'wind', 'density', 'and', 'magnetic', 'field', 'strength', 'were', 'an', 'order', 'of', 'magnitude', 'lower', '2', 'the', 'earths', 'magnetopause', 'and', 'shock', 'standoff', 'distances', 'were', 'a', 'factor', 'of', 'two', 'larger', 'and', '3', 'the', 'maximum', 'electron', 'density', 'in', 'the', 'ionosphere', 'was', 'substantially', 'lower']]
|
[-0.08741002821459852, 0.18105435494989847, -0.026624916837518584, 0.1022137433796286, -0.04774773370307481, -0.026632239322724013, 0.01472184093958088, 0.3661254725483214, -0.21031588986515998, -0.3937244736814293, 0.13841284710255547, -0.24281493364351578, -0.11417566295713186, 0.2572851159304766, -0.02082284968828076, 0.01826375803813852, 0.08715128668037982, -0.010579158089541156, -0.08392719974869799, -0.1931552812264397, 0.23654419379629965, 0.129495217182256, 0.22262718722481153, 0.03496346501312379, 0.06477716935092005, -0.09988235048066568, 0.004002582517870027, 0.005681566267619551, -0.17333594448272346, 0.0871446889760936, 0.16986138027257702, 0.160500853460539, 0.23799841991095835, -0.5278746664524079, -0.2495069468458151, 0.026316844602918315, 0.09331919196109961, 0.048490529646394484, 0.012459436787196018, -0.2476465805305232, 0.07122645882110851, -0.17906995387426738, -0.118984012646151, 0.04519221056252718, 0.02079756600091812, 0.02298869381433931, -0.317144862485343, 0.0521220740765847, 0.003089835432133284, 0.1169653852917816, -0.1695240663107613, -0.1257960326536077, -0.04355288992780421, 0.12070423871407221, 0.08266344794377299, 0.05559206130625359, 0.16745193834127536, -0.11476813741188882, -0.06354822398902013, 0.34058136133284406, -0.0889691753607998, -0.06761479341457116, 0.21098929529945398, -0.22198774002749344, -0.09487671165341705, 0.1589642443340914, 0.18838807293695622, 0.07365554678093257, -0.14404000334887251, 0.0004293471843742862, -0.04119993004755213, 0.17327749849907284, 0.09289004919440325, -0.017233601631596686, 0.21927890436531142, 0.11866157981727658, 0.10458554658910324, 0.1163288837250579, -0.22561321795058983, -0.024837935555340914, -0.24513109335996983, -0.11423314930549984, -0.11807962729884633, 0.01316628351903938, -0.13320752418818804, -0.1180007240092703, 0.42351746759216846, 0.23974548609734608, 0.15731279582170576, 0.012132558435330103, 0.3015312543203091, 0.11136965731425805, 0.0102816138769789, 0.1414331922275496, 0.31619608513368613, 0.10617341067449286, 0.13050303781276634, -0.19871057779207055, 0.08225866775831271, 0.06677486185819424]
|
1,803.07109
|
Sensitivity of a low threshold directional detector to CNO-cycle solar
neutrinos
|
A first measurement of neutrinos from the CNO fusion cycle in the Sun would
allow a resolution to the current solar metallicity problem. Detection of these
low-energy neutrinos requires a low-threshold detector, while discrimination
from radioactive backgrounds in the region of interest is significantly
enhanced via directional sensitivity. This combination can be achieved in a
water-based liquid scintillator target, which offers enhanced energy resolution
beyond a standard water Cherenkov detector. We study the sensitivity of such a
detector to CNO neutrinos under various detector and background scenarios, and
draw conclusions about the requirements for such a detector to successfully
measure the CNO neutrino flux. A detector designed to measure CNO neutrinos
could also achieve a few-percent measurement of pep neutrinos.
|
physics.ins-det astro-ph.SR hep-ex nucl-ex
|
a first measurement of neutrinos from the cno fusion cycle in the sun would allow a resolution to the current solar metallicity problem detection of these lowenergy neutrinos requires a lowthreshold detector while discrimination from radioactive backgrounds in the region of interest is significantly enhanced via directional sensitivity this combination can be achieved in a waterbased liquid scintillator target which offers enhanced energy resolution beyond a standard water cherenkov detector we study the sensitivity of such a detector to cno neutrinos under various detector and background scenarios and draw conclusions about the requirements for such a detector to successfully measure the cno neutrino flux a detector designed to measure cno neutrinos could also achieve a fewpercent measurement of pep neutrinos
|
[['a', 'first', 'measurement', 'of', 'neutrinos', 'from', 'the', 'cno', 'fusion', 'cycle', 'in', 'the', 'sun', 'would', 'allow', 'a', 'resolution', 'to', 'the', 'current', 'solar', 'metallicity', 'problem', 'detection', 'of', 'these', 'lowenergy', 'neutrinos', 'requires', 'a', 'lowthreshold', 'detector', 'while', 'discrimination', 'from', 'radioactive', 'backgrounds', 'in', 'the', 'region', 'of', 'interest', 'is', 'significantly', 'enhanced', 'via', 'directional', 'sensitivity', 'this', 'combination', 'can', 'be', 'achieved', 'in', 'a', 'waterbased', 'liquid', 'scintillator', 'target', 'which', 'offers', 'enhanced', 'energy', 'resolution', 'beyond', 'a', 'standard', 'water', 'cherenkov', 'detector', 'we', 'study', 'the', 'sensitivity', 'of', 'such', 'a', 'detector', 'to', 'cno', 'neutrinos', 'under', 'various', 'detector', 'and', 'background', 'scenarios', 'and', 'draw', 'conclusions', 'about', 'the', 'requirements', 'for', 'such', 'a', 'detector', 'to', 'successfully', 'measure', 'the', 'cno', 'neutrino', 'flux', 'a', 'detector', 'designed', 'to', 'measure', 'cno', 'neutrinos', 'could', 'also', 'achieve', 'a', 'fewpercent', 'measurement', 'of', 'pep', 'neutrinos']]
|
[-0.029703893802070523, 0.2118304586969316, -0.05596694045974194, 0.12797970689522722, -0.01876302419696003, -0.11656074489389236, 0.07475814191081251, 0.3655154178074251, -0.194206340436358, -0.38319230155514866, 0.044788379093127634, -0.3283999142314618, -0.0032021283986978233, 0.18678858951898292, -0.07430205521159224, 0.05519051048128555, 0.14382832186820452, 0.025514173513511196, -0.09754886492543544, -0.17465156609735763, 0.19495767616899684, 0.2122453418560326, 0.2815669101042052, 0.07359228715989351, 0.13822704529350935, -0.0927538478805218, -0.062086628148487456, -0.046370897969851894, -0.04112406843923964, 0.06030518431895568, 0.3069032902906959, 0.18344629753846675, 0.10148848542012275, -0.42938189683482053, -0.2346290701534599, 0.1620589942089282, 0.1256050831153213, 0.05751448454587565, -0.12470942115566383, -0.3273293737011651, 0.05303449362205962, -0.21006757831200956, -0.12119542042103906, 0.03183422855605992, -0.09714141250782025, -0.03506035055591686, -0.2948321442430218, -0.010293456675572087, -0.0017202699207700789, 0.008535607416221561, -0.004041733592748642, -0.13137329995515756, 0.04166543232568074, 0.05335613263693328, 0.06317542221659096, -0.042307999479817227, 0.20679983075048464, -0.17156185506028124, -0.045586715320435664, 0.3795073949421445, -0.1015209207039637, -0.13277945338437955, 0.1678069885315684, -0.18619585623188564, -0.11766762305245114, 0.22128349595780794, 0.19505259570044775, 0.07091477239349236, -0.24285673991932225, 0.010929203494257914, 0.013567508287572612, 0.21058131011280543, 0.07760181350943943, 0.052621776207039755, 0.2877609180053696, 0.2924550795772423, 0.14831460961868287, 0.013311662672397992, -0.2427851593781573, 0.05092602478883539, -0.30946376791689545, -0.16793110308838852, -0.0765426710267396, 0.10708795651444233, -0.05375605209628702, -0.06810980937443674, 0.41018629716709254, 0.1525553239004997, 0.12337480480976713, -0.04003044783506387, 0.30750555960306275, 0.017925979220308363, 0.07011715105327312, -0.03335077549563721, 0.36900965121264256, 0.15637826531116542, 0.1259673053728572, -0.2386203400635471, 0.05860940431011841, 0.0426239992591339]
|
1,803.0711
|
Weak values in collision theory
|
Weak measurements have an increasing number of applications in contemporary
quantum mechanics. They were originally described as a weak interaction that
slightly entangled the translational degrees of freedom of a particle to its
spin, yielding surprising results after post-selection. That description often
ignores the kinetic energy of the particle and its movement in three
dimensions. Here, we include these elements and re-obtain the weak values
within the context of collision theory by two different approaches, and prove
that the results are compatible with each other and with the results from the
traditional approach. To provide a more complete description of the
Stern-Gerlach apparatus, we use weak vectors, a generalization of the weak
values.
|
quant-ph
|
weak measurements have an increasing number of applications in contemporary quantum mechanics they were originally described as a weak interaction that slightly entangled the translational degrees of freedom of a particle to its spin yielding surprising results after postselection that description often ignores the kinetic energy of the particle and its movement in three dimensions here we include these elements and reobtain the weak values within the context of collision theory by two different approaches and prove that the results are compatible with each other and with the results from the traditional approach to provide a more complete description of the sterngerlach apparatus we use weak vectors a generalization of the weak values
|
[['weak', 'measurements', 'have', 'an', 'increasing', 'number', 'of', 'applications', 'in', 'contemporary', 'quantum', 'mechanics', 'they', 'were', 'originally', 'described', 'as', 'a', 'weak', 'interaction', 'that', 'slightly', 'entangled', 'the', 'translational', 'degrees', 'of', 'freedom', 'of', 'a', 'particle', 'to', 'its', 'spin', 'yielding', 'surprising', 'results', 'after', 'postselection', 'that', 'description', 'often', 'ignores', 'the', 'kinetic', 'energy', 'of', 'the', 'particle', 'and', 'its', 'movement', 'in', 'three', 'dimensions', 'here', 'we', 'include', 'these', 'elements', 'and', 'reobtain', 'the', 'weak', 'values', 'within', 'the', 'context', 'of', 'collision', 'theory', 'by', 'two', 'different', 'approaches', 'and', 'prove', 'that', 'the', 'results', 'are', 'compatible', 'with', 'each', 'other', 'and', 'with', 'the', 'results', 'from', 'the', 'traditional', 'approach', 'to', 'provide', 'a', 'more', 'complete', 'description', 'of', 'the', 'sterngerlach', 'apparatus', 'we', 'use', 'weak', 'vectors', 'a', 'generalization', 'of', 'the', 'weak', 'values']]
|
[-0.09548537716562076, 0.16767945701158007, -0.08200678553646512, 0.04574646613873805, -0.03282291672926033, -0.1312122410704151, 0.0013258346280214928, 0.3342640756637649, -0.24520285743231005, -0.3083666003977806, 0.04767942418080581, -0.2761190361384533, -0.11189169060043265, 0.20858266433099268, -0.031933247373414644, 0.020754686830023437, 0.0818746873812206, 0.0677606500749604, -0.09529942519596028, -0.222335537945011, 0.3069739171419194, 0.05135528443574872, 0.2674459577125983, 0.04099730228329391, 0.12271060318216286, 0.050190200907615036, -0.011712912717356092, 0.07502545900148365, -0.12474771723684605, 0.1380446782970257, 0.2004483212862139, 0.09523925097634504, 0.2643209318022565, -0.43906978757606935, -0.207723788307172, 0.06353634742368837, 0.07596516242329097, 0.16689957605790248, -0.03812289357675235, -0.2913672983959581, 0.06108167364501056, -0.17606590194133134, -0.1527322624290807, -0.1010604286154287, -0.007123480213031305, 0.04892822203795071, -0.2354163141288605, 0.08966260758615964, 0.0964523355962824, 0.0633403431750119, -0.047776380222109435, -0.10959242291303467, 0.003038154688325867, 0.11336294349398365, 0.05733727378589389, -0.009562220255456931, 0.10200583993300663, -0.1610810055554045, -0.1514989380617585, 0.37890016927128345, -0.04395062819255137, -0.21648380768576028, 0.2524299887256219, -0.12399980672676347, -0.12313389728686451, 0.10829769171345814, 0.10418095375386487, 0.09789110129221087, -0.13351998912516685, 0.05931417783110586, -0.05202885234184497, 0.14095529234778564, 0.05260942965968454, 0.09592582982453822, 0.19000853922277838, 0.10602286842082982, 0.03763109932043713, 0.09682194877310812, -0.06898623259853473, -0.12661275865543073, -0.3304644271451156, -0.1564301551995486, -0.17875757978701617, 0.04015062028641062, -0.10052647453112594, -0.13114148271228887, 0.3801806324318183, 0.15957951151654617, 0.212772906605418, 0.029338837749596718, 0.2881183735037272, 0.10977776905529993, 0.05574129488467511, 0.012868606429794325, 0.287971330209083, 0.1553238909815199, 0.10141078540972903, -0.18803226946033044, 0.02049781065805098, 0.05628006163555964]
|
1,803.07111
|
Reheating through the Higgs amplified by spinodal instabilities and
gravitational creation of gravitons
|
It is shown that a positive non-minimal coupling of the Higgs field to
gravity can solve the two problems in inflation models in which
postinflationary universe is dominated by an energy with stiff equation of
state such as a kination, namely, overproduction of gravitons in gravitational
reheating scenario, and overproduction of curvature perturbation from Higgs
condensation. Furthermore, we argue that the non-minimal coupling parameter can
be constrained more stringently with the progress in observations of
large-scale structure and cosmic microwave background.
|
gr-qc astro-ph.CO hep-ph
|
it is shown that a positive nonminimal coupling of the higgs field to gravity can solve the two problems in inflation models in which postinflationary universe is dominated by an energy with stiff equation of state such as a kination namely overproduction of gravitons in gravitational reheating scenario and overproduction of curvature perturbation from higgs condensation furthermore we argue that the nonminimal coupling parameter can be constrained more stringently with the progress in observations of largescale structure and cosmic microwave background
|
[['it', 'is', 'shown', 'that', 'a', 'positive', 'nonminimal', 'coupling', 'of', 'the', 'higgs', 'field', 'to', 'gravity', 'can', 'solve', 'the', 'two', 'problems', 'in', 'inflation', 'models', 'in', 'which', 'postinflationary', 'universe', 'is', 'dominated', 'by', 'an', 'energy', 'with', 'stiff', 'equation', 'of', 'state', 'such', 'as', 'a', 'kination', 'namely', 'overproduction', 'of', 'gravitons', 'in', 'gravitational', 'reheating', 'scenario', 'and', 'overproduction', 'of', 'curvature', 'perturbation', 'from', 'higgs', 'condensation', 'furthermore', 'we', 'argue', 'that', 'the', 'nonminimal', 'coupling', 'parameter', 'can', 'be', 'constrained', 'more', 'stringently', 'with', 'the', 'progress', 'in', 'observations', 'of', 'largescale', 'structure', 'and', 'cosmic', 'microwave', 'background']]
|
[-0.1694630365272593, 0.24711704540032647, -0.07787108426499698, 0.1151836484492423, -0.12402413422126829, -0.15193135709696548, -0.09338749866978621, 0.29095695581701064, -0.2461217017326918, -0.32943409508853044, 0.07606557032300366, -0.23599309461797807, -0.10088809025416404, 0.14547154475233437, 0.021293211849061428, -0.008466809597096326, 0.021141178676007705, 0.017777904793390153, 0.002094322027937498, -0.27500995942448947, 0.3610587633548327, 0.09538341309001416, 0.1760016218299207, 0.0559439469922196, 0.07505214239332687, -0.12912241048984413, 0.034521916381048935, 0.02642857178867461, -0.12029090829076458, 0.041879252424279666, 0.19973035362739738, 0.14517365901926418, 0.20849877343237125, -0.41513861830771703, -0.3045633896311492, 0.19295323044521573, 0.1715660897531995, 0.16009266481786552, -0.05565297177415715, -0.2949514714771031, 0.015750628896057606, -0.18752776668119578, -0.07796489988902101, -0.06204333407861859, -0.04276628415588933, -0.12011096672511395, -0.29723608138307034, 0.13291489491152955, -0.04488901985682731, -0.07234533750854524, -0.07353046091480388, -0.02684617402422943, -0.055248423743947055, -0.06124948922912648, 0.18214343556628368, 0.04237126935428629, 0.1322290920479982, -0.24123940884170156, -0.08425613341099916, 0.4071312799681852, -0.2113711874311169, -0.13951007382265856, 0.11059971237670124, -0.12850274053045813, -0.1648512490749083, 0.11130585550491548, 0.1452273336816924, 0.12014314415002311, -0.132100742081048, 0.206183992347818, 0.07048589545359582, 0.17306316570367342, 0.09686028316938951, -0.0009496951889660624, 0.3319945103592343, 0.16653430278206038, 0.06725809900205076, 0.08045817883886443, -0.004319474796684068, -0.09441434138420003, -0.37309392596836444, -0.1066995065452324, -0.14036366959205931, 0.10975645730892818, -0.15668001454747513, -0.16955341543696165, 0.3336614209836648, 0.14849414077391962, 0.1952772357351618, 0.0005804206759174481, 0.2825042449489788, 0.0842669412240754, 0.04417835456896918, 0.05382234385857979, 0.375538674355657, 0.17908004241829154, 0.10995780008868027, -0.25463607633359914, -0.021763215456617836, 0.015865474444940502]
|
1,803.07112
|
How sharply does the Anderson model depict a single-electron transistor?
|
The single-impurity Anderson model has been the focus of theoretical studies
of molecular junctions and the single-electron transistor, a nanostructured
device comprising a quantum dot that bridges two otherwise decoupled metallic
leads. The low-temperature transport properties of the model are controlled by
the ground-state occupation of the quantum dot, a circumstance that recent
density-functional approaches have explored. Here we show that the ground-state
dot occupation also parametrizes a linear mapping between the thermal
dependence of the zero-bias conductance and a universal function of the
temperature scaled by the Kondo temperature. Careful measurements by Grobis and
co-workers are very accurately fitted by the universal mapping. Nonetheless,
the dot occupation and an asymmetry parameter extracted from the same mapping
are relatively distant from the expected values. We conclude that mathematical
results derived from the model Hamiltonian reproduce accurately the universal
physical properties of the device. In contrast, non-universal features cannot
be reproduced quantitatively. To circumvent this limitation, \emph{ab initio}
studies of the device at high energies seem necessary, to accurately define the
model Hamiltonian. Our conclusion reinforces findings by Gross and coworkers,
who applied time-dependent density-functional theory to show that, to describe
the low-energy properties of molecular junctions, one must be able to describe
the high-energy regime.
|
cond-mat.str-el cond-mat.mes-hall
|
the singleimpurity anderson model has been the focus of theoretical studies of molecular junctions and the singleelectron transistor a nanostructured device comprising a quantum dot that bridges two otherwise decoupled metallic leads the lowtemperature transport properties of the model are controlled by the groundstate occupation of the quantum dot a circumstance that recent densityfunctional approaches have explored here we show that the groundstate dot occupation also parametrizes a linear mapping between the thermal dependence of the zerobias conductance and a universal function of the temperature scaled by the kondo temperature careful measurements by grobis and coworkers are very accurately fitted by the universal mapping nonetheless the dot occupation and an asymmetry parameter extracted from the same mapping are relatively distant from the expected values we conclude that mathematical results derived from the model hamiltonian reproduce accurately the universal physical properties of the device in contrast nonuniversal features cannot be reproduced quantitatively to circumvent this limitation emphab initio studies of the device at high energies seem necessary to accurately define the model hamiltonian our conclusion reinforces findings by gross and coworkers who applied timedependent densityfunctional theory to show that to describe the lowenergy properties of molecular junctions one must be able to describe the highenergy regime
|
[['the', 'singleimpurity', 'anderson', 'model', 'has', 'been', 'the', 'focus', 'of', 'theoretical', 'studies', 'of', 'molecular', 'junctions', 'and', 'the', 'singleelectron', 'transistor', 'a', 'nanostructured', 'device', 'comprising', 'a', 'quantum', 'dot', 'that', 'bridges', 'two', 'otherwise', 'decoupled', 'metallic', 'leads', 'the', 'lowtemperature', 'transport', 'properties', 'of', 'the', 'model', 'are', 'controlled', 'by', 'the', 'groundstate', 'occupation', 'of', 'the', 'quantum', 'dot', 'a', 'circumstance', 'that', 'recent', 'densityfunctional', 'approaches', 'have', 'explored', 'here', 'we', 'show', 'that', 'the', 'groundstate', 'dot', 'occupation', 'also', 'parametrizes', 'a', 'linear', 'mapping', 'between', 'the', 'thermal', 'dependence', 'of', 'the', 'zerobias', 'conductance', 'and', 'a', 'universal', 'function', 'of', 'the', 'temperature', 'scaled', 'by', 'the', 'kondo', 'temperature', 'careful', 'measurements', 'by', 'grobis', 'and', 'coworkers', 'are', 'very', 'accurately', 'fitted', 'by', 'the', 'universal', 'mapping', 'nonetheless', 'the', 'dot', 'occupation', 'and', 'an', 'asymmetry', 'parameter', 'extracted', 'from', 'the', 'same', 'mapping', 'are', 'relatively', 'distant', 'from', 'the', 'expected', 'values', 'we', 'conclude', 'that', 'mathematical', 'results', 'derived', 'from', 'the', 'model', 'hamiltonian', 'reproduce', 'accurately', 'the', 'universal', 'physical', 'properties', 'of', 'the', 'device', 'in', 'contrast', 'nonuniversal', 'features', 'can', 'not', 'be', 'reproduced', 'quantitatively', 'to', 'circumvent', 'this', 'limitation', 'emphab', 'initio', 'studies', 'of', 'the', 'device', 'at', 'high', 'energies', 'seem', 'necessary', 'to', 'accurately', 'define', 'the', 'model', 'hamiltonian', 'our', 'conclusion', 'reinforces', 'findings', 'by', 'gross', 'and', 'coworkers', 'who', 'applied', 'timedependent', 'densityfunctional', 'theory', 'to', 'show', 'that', 'to', 'describe', 'the', 'lowenergy', 'properties', 'of', 'molecular', 'junctions', 'one', 'must', 'be', 'able', 'to', 'describe', 'the', 'highenergy', 'regime']]
|
[-0.08612047595897598, 0.12705709042500352, -0.10820701455061392, 0.07199072122698787, -0.0085174757703321, -0.18662734686556023, 0.0766216110199599, 0.35332464715806633, -0.2573807395926518, -0.31122523626630627, -0.02111419567486226, -0.2935033599936926, -0.14956491714923376, 0.2110412942498309, -0.009736790344482514, 0.05746173813095083, 0.0198489738704932, -0.04787959957540762, -0.07003097416742182, -0.1786513123320552, 0.2794888529892466, 0.055219085273764484, 0.2818694710708791, 0.08517237791632552, 0.038723788876086476, -0.0294995518661425, 0.05776232642621347, 0.04222277974051128, -0.1767994373375564, 0.0902266741253254, 0.25094116393749305, -0.023968563411702833, 0.21499583837916939, -0.47173342966451876, -0.23193617677088918, 0.01589154124078227, 0.1270220905337937, 0.136930256164292, -0.013780492571432415, -0.2765425590071373, 0.05168282181001836, -0.17071494289060554, -0.13719900665611665, -0.11120171456075297, -0.01742877662636158, 0.03380657034931795, -0.21620205009992166, 0.08317977799338334, 0.016551960583367362, 0.02507170726795022, -0.041404642760980784, -0.07385402616431437, -0.03951387439354709, 0.11010984698219634, -0.006777941951210179, 0.0156754363396364, 0.20495895092580013, -0.10451430937661449, -0.10916509776398903, 0.35560845024429444, -0.057255054426538506, -0.12761269989082727, 0.16487343234191762, -0.1834735587193835, -0.12780891000293196, 0.10251212904638633, 0.07519780142664365, 0.09295830430417526, -0.1945173086780237, 0.12039724385689535, -0.050666414751534966, 0.16809149308175575, -0.012474814938699327, 0.0412404996342957, 0.24242931374053403, 0.1407465485492494, -0.014300025498676228, 0.09937795015824277, -0.09521523639105442, -0.10917232291909253, -0.26046267245873445, -0.10870942115420248, -0.2541062670805287, 0.09458924667212669, -0.05065491065438326, -0.15299081453235774, 0.42908471789006597, 0.19334938565905138, 0.22467322537970796, 0.0070312669318987105, 0.27114477291953093, 0.16087160012571186, 0.06665948611661428, 0.009035498989609684, 0.25275058009230145, 0.1660961255135878, 0.0541267144718781, -0.31491446568539777, 0.07263394836166011, -0.005107483658485296]
|
1,803.07113
|
Zero-Shot Detection
|
As we move towards large-scale object detection, it is unrealistic to expect
annotated training data, in the form of bounding box annotations around
objects, for all object classes at sufficient scale, and so methods capable of
unseen object detection are required. We propose a novel zero-shot method based
on training an end-to-end model that fuses semantic attribute prediction with
visual features to propose object bounding boxes for seen and unseen classes.
While we utilize semantic features during training, our method is agnostic to
semantic information for unseen classes at test-time. Our method retains the
efficiency and effectiveness of YOLOv2 for objects seen during training, while
improving its performance for novel and unseen objects. The ability of
state-of-art detection methods to learn discriminative object features to
reject background proposals also limits their performance for unseen objects.
We posit that, to detect unseen objects, we must incorporate semantic
information into the visual domain so that the learned visual features reflect
this information and leads to improved recall rates for unseen objects. We test
our method on PASCAL VOC and MS COCO dataset and observed significant
improvements on the average precision of unseen classes.
|
cs.CV
|
as we move towards largescale object detection it is unrealistic to expect annotated training data in the form of bounding box annotations around objects for all object classes at sufficient scale and so methods capable of unseen object detection are required we propose a novel zeroshot method based on training an endtoend model that fuses semantic attribute prediction with visual features to propose object bounding boxes for seen and unseen classes while we utilize semantic features during training our method is agnostic to semantic information for unseen classes at testtime our method retains the efficiency and effectiveness of yolov2 for objects seen during training while improving its performance for novel and unseen objects the ability of stateofart detection methods to learn discriminative object features to reject background proposals also limits their performance for unseen objects we posit that to detect unseen objects we must incorporate semantic information into the visual domain so that the learned visual features reflect this information and leads to improved recall rates for unseen objects we test our method on pascal voc and ms coco dataset and observed significant improvements on the average precision of unseen classes
|
[['as', 'we', 'move', 'towards', 'largescale', 'object', 'detection', 'it', 'is', 'unrealistic', 'to', 'expect', 'annotated', 'training', 'data', 'in', 'the', 'form', 'of', 'bounding', 'box', 'annotations', 'around', 'objects', 'for', 'all', 'object', 'classes', 'at', 'sufficient', 'scale', 'and', 'so', 'methods', 'capable', 'of', 'unseen', 'object', 'detection', 'are', 'required', 'we', 'propose', 'a', 'novel', 'zeroshot', 'method', 'based', 'on', 'training', 'an', 'endtoend', 'model', 'that', 'fuses', 'semantic', 'attribute', 'prediction', 'with', 'visual', 'features', 'to', 'propose', 'object', 'bounding', 'boxes', 'for', 'seen', 'and', 'unseen', 'classes', 'while', 'we', 'utilize', 'semantic', 'features', 'during', 'training', 'our', 'method', 'is', 'agnostic', 'to', 'semantic', 'information', 'for', 'unseen', 'classes', 'at', 'testtime', 'our', 'method', 'retains', 'the', 'efficiency', 'and', 'effectiveness', 'of', 'yolov2', 'for', 'objects', 'seen', 'during', 'training', 'while', 'improving', 'its', 'performance', 'for', 'novel', 'and', 'unseen', 'objects', 'the', 'ability', 'of', 'stateofart', 'detection', 'methods', 'to', 'learn', 'discriminative', 'object', 'features', 'to', 'reject', 'background', 'proposals', 'also', 'limits', 'their', 'performance', 'for', 'unseen', 'objects', 'we', 'posit', 'that', 'to', 'detect', 'unseen', 'objects', 'we', 'must', 'incorporate', 'semantic', 'information', 'into', 'the', 'visual', 'domain', 'so', 'that', 'the', 'learned', 'visual', 'features', 'reflect', 'this', 'information', 'and', 'leads', 'to', 'improved', 'recall', 'rates', 'for', 'unseen', 'objects', 'we', 'test', 'our', 'method', 'on', 'pascal', 'voc', 'and', 'ms', 'coco', 'dataset', 'and', 'observed', 'significant', 'improvements', 'on', 'the', 'average', 'precision', 'of', 'unseen', 'classes']]
|
[0.0037591159330005635, -0.023592404805959435, -0.05848839849170239, 0.09358712869052682, -0.17807016992961003, -0.17727421686974845, 0.0698101495609604, 0.47390797006756225, -0.2037985494277435, -0.4436491486660317, 0.03106195717338102, -0.2674241599913916, -0.11541216007795878, 0.20189043018279393, -0.20589093033785888, 0.08545430347351454, 0.19034754632513834, 0.09051632789495104, -0.10219758721214782, -0.3013115968087113, 0.3147830835992168, 0.041992244691007735, 0.2934331396528817, 0.026076049712140368, 0.18649075985447314, -0.10738941639691045, -0.056775338205396736, -0.02974797593653982, -0.02398931866212893, 0.19749693212060365, 0.32066835936997573, 0.23937501896328794, 0.24892332399000672, -0.3591584536437121, -0.2225472793807105, 0.07982930869927035, 0.13456483702882344, 0.10654654019848682, -0.040864526620866114, -0.4539937354704726, 0.136557052321537, -0.16205695240772988, 0.03397249416399416, -0.16726591189255383, 0.024525869393926016, -0.060045029583426085, -0.2901914920072749, 0.05834368364053476, 0.16328626547827926, 0.0538596224749256, -0.10739204793722315, -0.08806250998213966, 0.040078972991682706, 0.22015033394868697, 0.022423055741560515, 0.039573298338727525, 0.16886150257671692, -0.2564329641410369, -0.1408831401635449, 0.3668816694209635, -0.054620988977858456, -0.208442178564585, 0.27445150921925787, -0.0534773929854026, -0.14824664908466148, 0.13236485590368352, 0.26503231553897183, 0.17059111753381126, -0.13690393352003388, -0.05426988868482889, -0.04748586138237404, 0.18990669759838838, 0.06114430582462883, 0.0294017106445789, 0.2494604632243787, 0.2461820070617174, 0.021300846676668882, 0.19158357692911676, -0.23831175729152088, -0.0019092356044974627, -0.2239278808933395, -0.11107157511607359, -0.17268621416443092, -0.08126126543413945, -0.10411716401231103, -0.1257872277909935, 0.36314416548763817, 0.3281316327696656, 0.2557243498844334, 0.1508762759670947, 0.33930632113284037, -0.04924575834570413, 0.15355470560671497, 0.09064351901148704, 0.1899641435642127, -0.06047805271438123, 0.11096882720658292, -0.15132857950682221, 0.11813270703631, 0.082233212632249]
|
1,803.07114
|
Slipknotting in Random Diagrams
|
The presence of slipknots in configurations of proteins and DNA has been
shown to affect their functionality, or alter it entirely. Historically,
polymers are modeled as polygonal chains in space. As an alternative to space
curves, we provide a framework for working with subknots inside of knot
diagrams via knotoid diagrams. We prove using a pattern theorem for knot
diagrams that not only are almost all knot diagrams slipknotted, almost all
unknot diagrams are slipknotted. This proves in the random diagram model a
conjecture yet unproven in random space curve models. We also discuss
conjectures on the enumeration of knotoid diagrams.
|
math.GT math.CO
|
the presence of slipknots in configurations of proteins and dna has been shown to affect their functionality or alter it entirely historically polymers are modeled as polygonal chains in space as an alternative to space curves we provide a framework for working with subknots inside of knot diagrams via knotoid diagrams we prove using a pattern theorem for knot diagrams that not only are almost all knot diagrams slipknotted almost all unknot diagrams are slipknotted this proves in the random diagram model a conjecture yet unproven in random space curve models we also discuss conjectures on the enumeration of knotoid diagrams
|
[['the', 'presence', 'of', 'slipknots', 'in', 'configurations', 'of', 'proteins', 'and', 'dna', 'has', 'been', 'shown', 'to', 'affect', 'their', 'functionality', 'or', 'alter', 'it', 'entirely', 'historically', 'polymers', 'are', 'modeled', 'as', 'polygonal', 'chains', 'in', 'space', 'as', 'an', 'alternative', 'to', 'space', 'curves', 'we', 'provide', 'a', 'framework', 'for', 'working', 'with', 'subknots', 'inside', 'of', 'knot', 'diagrams', 'via', 'knotoid', 'diagrams', 'we', 'prove', 'using', 'a', 'pattern', 'theorem', 'for', 'knot', 'diagrams', 'that', 'not', 'only', 'are', 'almost', 'all', 'knot', 'diagrams', 'slipknotted', 'almost', 'all', 'unknot', 'diagrams', 'are', 'slipknotted', 'this', 'proves', 'in', 'the', 'random', 'diagram', 'model', 'a', 'conjecture', 'yet', 'unproven', 'in', 'random', 'space', 'curve', 'models', 'we', 'also', 'discuss', 'conjectures', 'on', 'the', 'enumeration', 'of', 'knotoid', 'diagrams']]
|
[-0.18975480514630788, 0.13417382213914866, -0.13998725719284266, 0.12421062991037318, -0.07215748262610666, -0.15026756546612144, 0.0896224994775162, 0.45044981984763727, -0.24360793749136583, -0.288892818272722, 0.09754481244528172, -0.2254357787789967, -0.1953624041147568, 0.21049851746944598, -0.10444419038463004, -0.020379032198415727, 0.06366200877201496, 0.021229438291570382, -0.047375288599512864, -0.27245423459799545, 0.27754252598079265, -0.05286659678558306, 0.20623097824388925, 0.06823528898471244, 0.04737520667876364, 0.02376397644473734, -0.025606792857300262, 0.03940983102757873, -0.17577469122528672, 0.07838264005068614, 0.23167587829949315, 0.11042129938794794, 0.0949207573977052, -0.3783982798590192, -0.21355101320065786, 0.15181870860218696, 0.22739923970874196, 0.10091754722846102, 0.01658423346282002, -0.22978240986145576, 0.08711846762013678, -0.13975710972041197, -0.1714879829645613, -0.09094697041915165, 0.022981529118141577, 0.04084227608554825, -0.14272929052822292, -0.018322721173884633, 0.06460140522117121, 0.1234259613200414, -0.013920356723841051, -0.09975562308325756, -0.028027928215736637, 0.15262713253602614, 0.009079476123514148, 0.03978866951929747, 0.08787336030841938, -0.16063150561804293, -0.16433397549375586, 0.37315452923732145, -0.025836740667950744, -0.2290987661773605, 0.15588770657350137, -0.12015961350074836, -0.20174282573030464, 0.18844043144633119, 0.06886896315239827, 0.11499975576559651, -0.13585034369167928, 0.1229100646445176, -0.08806464455223509, 0.11222107231388895, 0.09913024707811371, -0.004976285096466997, 0.23411928503108875, 0.10542789046481556, 0.012545259170500296, 0.2153081549343425, -0.010669139230490796, -0.13202164567322755, -0.27214444839699686, -0.19395881532976517, -0.11977063484575447, 0.000530824245919464, -0.09352924381557981, -0.2748901050508721, 0.32471544045137657, 0.06508737099499498, 0.16674941087828246, 0.07340335664582885, 0.2531678291579366, 0.03327619965539827, 0.07905279170978358, 0.054178450874300024, 0.17684677935191145, 0.15003177765946912, 0.019069777863404275, -0.11457056052773734, 0.0912535072028713, 0.1630880587867328]
|
1,803.07115
|
Continuous Time Multi-stage Stochastic Reserve and Unit Commitment
|
In this paper we introduce a continuous time multi stage stochastic
optimization for scheduling generating units, their commitment, reserve
capacities and their continuous time generation profiles in the day-ahead
wholesale electricity market. Our formulation approximates the solution of a
variational problem, in which the balance, generation capacity and ramping
constraints are in continuous time. Due to the greater accuracy of our
representation of ramping events this approach improves the system reliability
and lowers the real-time cost.
|
math.OC
|
in this paper we introduce a continuous time multi stage stochastic optimization for scheduling generating units their commitment reserve capacities and their continuous time generation profiles in the dayahead wholesale electricity market our formulation approximates the solution of a variational problem in which the balance generation capacity and ramping constraints are in continuous time due to the greater accuracy of our representation of ramping events this approach improves the system reliability and lowers the realtime cost
|
[['in', 'this', 'paper', 'we', 'introduce', 'a', 'continuous', 'time', 'multi', 'stage', 'stochastic', 'optimization', 'for', 'scheduling', 'generating', 'units', 'their', 'commitment', 'reserve', 'capacities', 'and', 'their', 'continuous', 'time', 'generation', 'profiles', 'in', 'the', 'dayahead', 'wholesale', 'electricity', 'market', 'our', 'formulation', 'approximates', 'the', 'solution', 'of', 'a', 'variational', 'problem', 'in', 'which', 'the', 'balance', 'generation', 'capacity', 'and', 'ramping', 'constraints', 'are', 'in', 'continuous', 'time', 'due', 'to', 'the', 'greater', 'accuracy', 'of', 'our', 'representation', 'of', 'ramping', 'events', 'this', 'approach', 'improves', 'the', 'system', 'reliability', 'and', 'lowers', 'the', 'realtime', 'cost']]
|
[-0.16126801694228657, 0.06149472945712899, -0.02464005780577856, 0.0626879257033579, -0.057797721145968685, -0.10820606494886115, 0.16779060053522699, 0.3790006475327046, -0.3271206223013762, -0.32170367205368455, 0.14373128546254807, -0.2481778127043263, -0.09233348062690838, 0.17817426271319978, -0.1447602767791403, 0.10866172949930555, 0.06796392711724988, -0.012895221929188426, -0.023185040107101054, -0.28040632763938783, 0.22355606412594697, 0.10392764878557309, 0.3407987458386311, 0.06240998476890749, 0.14793995309523061, 0.007206764179404433, -0.019860068140061277, -0.040041166140183215, -0.06221245335549802, 0.1860271197219845, 0.2395054357812593, 0.1718745860026071, 0.3885298444595384, -0.46913519609523446, -0.2231115051300118, 0.13554279541743822, 0.03524739875444395, 0.029846310151410045, -0.025895232607389948, -0.18789591168445585, 0.016678707496459156, -0.23389922860568682, -0.048716122459154576, -0.08619321786222588, -0.031649876869969853, 0.04997457426629568, -0.3410833951477942, 0.08402980427796904, 0.023898074967100433, 0.0004720354673305624, -0.1443903719773516, -0.035940751235772804, -0.024340947729988807, 0.14027618614981244, 0.03796546213255313, 0.018921608019522147, 0.12265610812372822, -0.14533214733053587, -0.16140271545583873, 0.4103320906257355, -0.04789711364336606, -0.20962889105277627, 0.11632776458894736, -0.10267426138498674, -0.14838261372336237, 0.12850212619492882, 0.2521277821475738, 0.12498004679984756, -0.17710652862871556, 0.04356367859490044, 0.04029269810569914, 0.16851046201650446, 0.04855974841446273, 0.007508100034963144, 0.16096280672354624, 0.2370039992169232, 0.15457832575530597, 0.16598758214202367, -0.04789552493265977, -0.19457140599230402, -0.25588107191785975, -0.1537089760010866, -0.16599285546200057, -0.00694950864846377, -0.09521214363695962, -0.10459103723310124, 0.41799238265344973, 0.19023237835101195, 0.11000638969830777, 0.18274511394740425, 0.3856491913136683, 0.20678617524926698, 0.005500738086227916, 0.12073459603063959, 0.14769168576305292, -0.011879686955485101, 0.23055095525801575, -0.2650831459292309, 0.10486002638016974, 0.053734286026538985]
|
1,803.07116
|
Learning to Generate Wikipedia Summaries for Underserved Languages from
Wikidata
|
While Wikipedia exists in 287 languages, its content is unevenly distributed
among them. In this work, we investigate the generation of open domain
Wikipedia summaries in underserved languages using structured data from
Wikidata. To this end, we propose a neural network architecture equipped with
copy actions that learns to generate single-sentence and comprehensible textual
summaries from Wikidata triples. We demonstrate the effectiveness of the
proposed approach by evaluating it against a set of baselines on two languages
of different natures: Arabic, a morphological rich language with a larger
vocabulary than English, and Esperanto, a constructed language known for its
easy acquisition.
|
cs.CL
|
while wikipedia exists in 287 languages its content is unevenly distributed among them in this work we investigate the generation of open domain wikipedia summaries in underserved languages using structured data from wikidata to this end we propose a neural network architecture equipped with copy actions that learns to generate singlesentence and comprehensible textual summaries from wikidata triples we demonstrate the effectiveness of the proposed approach by evaluating it against a set of baselines on two languages of different natures arabic a morphological rich language with a larger vocabulary than english and esperanto a constructed language known for its easy acquisition
|
[['while', 'wikipedia', 'exists', 'in', '287', 'languages', 'its', 'content', 'is', 'unevenly', 'distributed', 'among', 'them', 'in', 'this', 'work', 'we', 'investigate', 'the', 'generation', 'of', 'open', 'domain', 'wikipedia', 'summaries', 'in', 'underserved', 'languages', 'using', 'structured', 'data', 'from', 'wikidata', 'to', 'this', 'end', 'we', 'propose', 'a', 'neural', 'network', 'architecture', 'equipped', 'with', 'copy', 'actions', 'that', 'learns', 'to', 'generate', 'singlesentence', 'and', 'comprehensible', 'textual', 'summaries', 'from', 'wikidata', 'triples', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'approach', 'by', 'evaluating', 'it', 'against', 'a', 'set', 'of', 'baselines', 'on', 'two', 'languages', 'of', 'different', 'natures', 'arabic', 'a', 'morphological', 'rich', 'language', 'with', 'a', 'larger', 'vocabulary', 'than', 'english', 'and', 'esperanto', 'a', 'constructed', 'language', 'known', 'for', 'its', 'easy', 'acquisition']]
|
[-0.06477541096467009, 0.014489344766105312, -0.03592318339771269, 0.126358389548985, -0.17423429946405905, -0.12618063549317493, 0.10257017649802389, 0.47409564677146404, -0.2668376936355956, -0.3321205666104313, 0.027090284937651515, -0.3340502404838358, -0.1304046206111734, 0.1992734546339748, -0.12968228045057986, -0.016513539926554677, 0.1450659372327425, 0.05784139216019966, -0.030029247065379034, -0.2664920034274311, 0.3384404502576217, -0.026940683838865248, 0.33933526117557494, -0.03953845881497358, 0.12901249632705003, -0.05624880202317444, -0.07609755266457796, -0.03141476673714927, -0.05232173568457607, 0.23451464087010757, 0.39074964001129314, 0.2921986423241491, 0.30272665718515024, -0.36260439878753803, -0.14949664318620567, 0.016247663938551034, 0.09225788429704504, 0.11107277952936838, -0.035030348021260434, -0.37881626905055055, 0.09974907365360178, -0.22303770982319177, 0.049617374449562615, -0.1151447511361082, 0.050582393870163375, -0.01011283162838346, -0.20752875448554975, -0.006898415966494249, 0.08943383716563187, 0.1315680217288324, -0.028390673498650737, -0.09338487608192286, 0.008285111980512738, 0.1712854996756973, 0.040535534360897865, 0.08154969834860894, 0.0854269404023065, -0.11947429198299138, -0.17596874151627837, 0.40646052080215794, -0.07311828116644842, -0.2114268847381567, 0.22642228681833879, -0.044861794753682495, -0.1637571926717416, 0.03965805460800334, 0.20844344361131956, 0.0957124892917305, -0.20656233332073776, 0.043243275172685704, -0.07009259898141765, 0.27187549381742787, 0.115236157952522, -0.001053688582032919, 0.21135734999091318, 0.2701331230599691, -0.02592284600296528, 0.20684901524408913, -0.02140120633141285, -0.03510466759729356, -0.1875141224187642, -0.10435770254923345, -0.16083787731932347, -0.01418026002460519, -0.09569968846551659, -0.18355385987733555, 0.4297694463541012, 0.2292972176663098, 0.14441098962532412, 0.1307516419190434, 0.31313423992544964, -0.07323861977942449, 0.13584623380222977, 0.12642799138026958, 0.030364680583450463, -0.0363651156669833, 0.16554933863618218, -0.1201979817913633, 0.09845083668864894, 0.029992140737352985]
|
1,803.07117
|
Entanglement rates for Renyi, Tsallis and other entropies
|
We provide an upper bound on the maximal entropy rate at which the entropy of
the expected density operator of a given ensemble of two states changes under
nonlocal unitary evolution. A large class of entropy measures in considered,
which includes Renyi and Tsallis entropies. The result is derived from a
general bound on the trace-norm of a commutator, which can be expected to find
other implementations. We apply this result to bound the maximal rate at which
quantum dynamics can generate entanglement in a bipartite closed system with
Renyi and Tsallis entanglement entropy taken as measures of entanglement in the
system.
|
math-ph math.MP
|
we provide an upper bound on the maximal entropy rate at which the entropy of the expected density operator of a given ensemble of two states changes under nonlocal unitary evolution a large class of entropy measures in considered which includes renyi and tsallis entropies the result is derived from a general bound on the tracenorm of a commutator which can be expected to find other implementations we apply this result to bound the maximal rate at which quantum dynamics can generate entanglement in a bipartite closed system with renyi and tsallis entanglement entropy taken as measures of entanglement in the system
|
[['we', 'provide', 'an', 'upper', 'bound', 'on', 'the', 'maximal', 'entropy', 'rate', 'at', 'which', 'the', 'entropy', 'of', 'the', 'expected', 'density', 'operator', 'of', 'a', 'given', 'ensemble', 'of', 'two', 'states', 'changes', 'under', 'nonlocal', 'unitary', 'evolution', 'a', 'large', 'class', 'of', 'entropy', 'measures', 'in', 'considered', 'which', 'includes', 'renyi', 'and', 'tsallis', 'entropies', 'the', 'result', 'is', 'derived', 'from', 'a', 'general', 'bound', 'on', 'the', 'tracenorm', 'of', 'a', 'commutator', 'which', 'can', 'be', 'expected', 'to', 'find', 'other', 'implementations', 'we', 'apply', 'this', 'result', 'to', 'bound', 'the', 'maximal', 'rate', 'at', 'which', 'quantum', 'dynamics', 'can', 'generate', 'entanglement', 'in', 'a', 'bipartite', 'closed', 'system', 'with', 'renyi', 'and', 'tsallis', 'entanglement', 'entropy', 'taken', 'as', 'measures', 'of', 'entanglement', 'in', 'the', 'system']]
|
[-0.11728191457907944, 0.183066038119375, -0.1439894914818818, 0.09288133559383306, 0.0742188617221865, -0.15663207069897622, 0.041578544600519775, 0.24841341764355698, -0.25444004749514015, -0.2561431401089637, 0.06949068537306077, -0.32317352348792494, -0.07815301956554108, 0.21750334373620503, -0.09241936245348815, 0.12132353193181403, 0.03541627062676365, 0.15337256935691032, -0.09994641099097755, -0.2536033586069357, 0.3324147042973588, 0.052647995291159065, 0.2981972964845744, 0.12326617361509752, 0.07561303046075445, -0.024098029780183352, 0.03102893306983306, 0.03520523368805537, -0.19976027170196176, 0.1431145188502092, 0.23960437070505292, 0.16995410536708055, 0.22137367732676805, -0.3536045858271274, -0.21678210335655831, 0.14989949997934496, 0.0805789044437309, 0.11543600138404644, 0.005609116697336967, -0.27493114168664406, -0.007175209699198604, -0.23126052680662743, -0.10630848344561517, -0.07314188152040337, 0.02489680795035526, -0.033360803358864, -0.3105161818401778, 0.14894607603577348, 0.10636458903044353, 0.029174127092975302, -0.042504675873536985, -0.048554304965506945, -0.037951276034993285, 0.09275897830158618, 0.007609360401664733, 0.010215207895003808, 0.13091335345205724, -0.08619406929766923, -0.13275335608141534, 0.3010252042326565, -0.11753447268468638, -0.2161330444071734, 0.14537709560724632, -0.15482876700002188, -0.12626478588208556, 0.04707505826966143, 0.1717462097522894, 0.14787837052626499, -0.1497016659910407, 0.0644921895799081, -0.05035340255149184, 0.14362013960878053, 0.03546940743484918, 0.1546705423873694, 0.1686631532901825, 0.026835754591350753, 0.1301110487969994, 0.26106365094379086, -0.030668125492429324, -0.16289727533619633, -0.3330707082926643, -0.19013968439186082, -0.2639489915751505, 0.10739120850156919, -0.12379666100976322, -0.1629673603776039, 0.3810146021492341, 0.09905424835069068, 0.2002651535394583, 0.09282426679890383, 0.22148565776353957, 0.18038612489894434, 0.05953363742788925, 0.12849887043657696, 0.20582546387780823, 0.14254554016880838, 0.019455142237026903, -0.24945751706357389, 0.07346861364260572, 0.1448806901850427]
|
1,803.07118
|
Model theory and ultraproducts
|
The article motivates recent work on saturation of ultrapowers from a general
mathematical point of view.
|
math.LO
|
the article motivates recent work on saturation of ultrapowers from a general mathematical point of view
|
[['the', 'article', 'motivates', 'recent', 'work', 'on', 'saturation', 'of', 'ultrapowers', 'from', 'a', 'general', 'mathematical', 'point', 'of', 'view']]
|
[-0.02347774733789265, 0.0033647266682237387, -0.15121421143703628, -0.03172102535609156, -0.15111038566101342, -0.02772467417526059, 0.13802134574507363, 0.22219316783593968, -0.25470178105751984, -0.2345564418938011, 0.06374264082114678, -0.2725281612656545, -0.2361990613862872, 0.19808919075876474, -0.19552308597485535, 0.06355777569115162, 0.05739700573030859, 0.04489084525266662, -0.09437490269192494, -0.1711155769880861, 0.4593549201526912, 0.10007385886274278, 0.3086071936413646, 0.10562179773114622, 0.06845310074277222, 0.054870358551852405, -0.09793342894408852, 0.06599098762671929, -0.21139065938768908, 0.20679320604540408, 0.23652634781319648, 0.1466308944800403, 0.32004883978515863, -0.47423592722043395, -0.23343732440844178, 0.06548395042773336, 0.08820699859643355, 0.15812376467511058, -0.06647396178595955, -0.2193635226576589, 0.03381929825991392, -0.161254461389035, -0.16232371643127408, -0.020641935640014708, -0.00014774565352126956, -0.0003693128237500787, -0.22733545332448557, -0.01048774376977235, 0.1692852324922569, 0.16907284583430737, 0.020478864083997905, -0.16041160368331475, 0.10147221700754017, 0.0016995569749269634, 0.08553861771360971, 0.09642116105533205, 0.14108023355947807, -0.14798227744176984, -0.1150390199618414, 0.34747771779075265, 0.04107721906621009, -0.07364273513667285, 0.2218317436054349, -0.12402324704453349, -0.2484490908391308, 0.09354480006732047, 0.2160689825686859, 0.13014141301391646, -0.13798689236864448, 0.1959582446143031, -0.11986915802117437, 0.07351875506901706, 0.06585055257892236, 0.038787504181527765, 0.24932925251778215, 0.23309284663992003, 0.06549600814469159, 0.1130318219657056, 0.0007629942410858348, -0.16615221736719832, -0.3704933982808143, -0.1258868543081917, -0.12949266177020036, 0.16989478282630444, -0.02011313464026898, -0.09600875992327929, 0.4585237791761756, 0.2175537282600999, 0.19716512691229582, 0.12438558600842953, 0.2578975760843605, 0.048172192939091474, -0.07310446467454312, -0.0532001000829041, 0.20478290296159685, 0.1644441225216724, 0.13539793016389012, -0.07473971402214374, -0.0013527417249861173, 0.07867497717961669]
|
1,803.07119
|
Supervised learning of time-independent Hamiltonians for gate design
|
We present a general framework to tackle the problem of finding
time-independent dynamics generating target unitary evolutions. We show that
this problem is equivalently stated as a set of conditions over the spectrum of
the time-independent gate generator, thus transforming the task to an inverse
eigenvalue problem. We illustrate our methodology by identifying suitable
time-independent generators implementing Toffoli and Fredkin gates without the
need for ancillae or effective evolutions. We show how the same conditions can
be used to solve the problem numerically, via supervised learning techniques.
In turn, this allows us to solve problems that are not amenable, in general, to
direct analytical solution, providing at the same time a high degree of
flexibility over the types of gate-design problems that can be approached. As a
significant example, we find generators for the Toffoli gate using only
diagonal pairwise interactions, which are easier to implement in some
experimental architectures. To showcase the flexibility of the supervised
learning approach, we give an example of a nontrivial four-qubit gate that is
implementable using only diagonal, pairwise interactions.
|
quant-ph
|
we present a general framework to tackle the problem of finding timeindependent dynamics generating target unitary evolutions we show that this problem is equivalently stated as a set of conditions over the spectrum of the timeindependent gate generator thus transforming the task to an inverse eigenvalue problem we illustrate our methodology by identifying suitable timeindependent generators implementing toffoli and fredkin gates without the need for ancillae or effective evolutions we show how the same conditions can be used to solve the problem numerically via supervised learning techniques in turn this allows us to solve problems that are not amenable in general to direct analytical solution providing at the same time a high degree of flexibility over the types of gatedesign problems that can be approached as a significant example we find generators for the toffoli gate using only diagonal pairwise interactions which are easier to implement in some experimental architectures to showcase the flexibility of the supervised learning approach we give an example of a nontrivial fourqubit gate that is implementable using only diagonal pairwise interactions
|
[['we', 'present', 'a', 'general', 'framework', 'to', 'tackle', 'the', 'problem', 'of', 'finding', 'timeindependent', 'dynamics', 'generating', 'target', 'unitary', 'evolutions', 'we', 'show', 'that', 'this', 'problem', 'is', 'equivalently', 'stated', 'as', 'a', 'set', 'of', 'conditions', 'over', 'the', 'spectrum', 'of', 'the', 'timeindependent', 'gate', 'generator', 'thus', 'transforming', 'the', 'task', 'to', 'an', 'inverse', 'eigenvalue', 'problem', 'we', 'illustrate', 'our', 'methodology', 'by', 'identifying', 'suitable', 'timeindependent', 'generators', 'implementing', 'toffoli', 'and', 'fredkin', 'gates', 'without', 'the', 'need', 'for', 'ancillae', 'or', 'effective', 'evolutions', 'we', 'show', 'how', 'the', 'same', 'conditions', 'can', 'be', 'used', 'to', 'solve', 'the', 'problem', 'numerically', 'via', 'supervised', 'learning', 'techniques', 'in', 'turn', 'this', 'allows', 'us', 'to', 'solve', 'problems', 'that', 'are', 'not', 'amenable', 'in', 'general', 'to', 'direct', 'analytical', 'solution', 'providing', 'at', 'the', 'same', 'time', 'a', 'high', 'degree', 'of', 'flexibility', 'over', 'the', 'types', 'of', 'gatedesign', 'problems', 'that', 'can', 'be', 'approached', 'as', 'a', 'significant', 'example', 'we', 'find', 'generators', 'for', 'the', 'toffoli', 'gate', 'using', 'only', 'diagonal', 'pairwise', 'interactions', 'which', 'are', 'easier', 'to', 'implement', 'in', 'some', 'experimental', 'architectures', 'to', 'showcase', 'the', 'flexibility', 'of', 'the', 'supervised', 'learning', 'approach', 'we', 'give', 'an', 'example', 'of', 'a', 'nontrivial', 'fourqubit', 'gate', 'that', 'is', 'implementable', 'using', 'only', 'diagonal', 'pairwise', 'interactions']]
|
[-0.10071941045645093, 0.0689151472240753, -0.06164993206637778, 0.07030439221167138, -0.082730628605932, -0.20524958759280187, 0.042619257381718074, 0.42251327959554535, -0.2889357330596873, -0.31116937357400143, 0.088689897587922, -0.2071064776901455, -0.15673809705169073, 0.24735821730191154, -0.06311710393156059, 0.09396989122565304, 0.10130056885071098, 0.008502885060650962, -0.12363107366753476, -0.2804464976822159, 0.29187517576717903, 0.02482465054307665, 0.252862805418138, 0.05254397526582969, 0.11891950472391077, 0.0017302012629806995, 0.04034492436929473, 0.012401004981781755, -0.06760956772087541, 0.11682975878140756, 0.30657227997402, 0.16325353894914899, 0.27648511415081367, -0.44053894745984246, -0.1759822084568441, 0.13819183947518468, 0.14434003149159252, 0.17481526735837438, -0.03937646392998951, -0.28676615459578375, 0.08112776676725064, -0.18020689416751598, -0.1045533264162285, -0.1516803902387619, -0.0029187616113839406, -0.031324125549622946, -0.3111178698164544, 0.041015538660243954, 0.0690575893861907, 0.016068053559533186, -0.03292386714535366, -0.04636727088397103, 0.04542153303112303, 0.140296256230878, -0.030857848855001587, -0.008191347841971687, 0.11405903455136078, -0.09744875580471542, -0.16470676769369416, 0.3640712022249188, -0.026951598509081773, -0.25376999433551517, 0.16046806693609272, -0.03199920604005456, -0.1312328223471663, 0.0676980694037463, 0.17193721462573325, 0.1425510342738458, -0.17253070676433188, 0.10032408024816375, -0.028625162169337273, 0.17109985868978714, 0.03962045444175601, -0.017168166240278098, 0.14936688752445793, 0.1363904505489128, 0.09675365393715245, 0.19309500917659275, 0.0055779744631477765, -0.08484615259803832, -0.30451006839317935, -0.13351333364844323, -0.20026357680293067, 0.05306270771934318, -0.077052002947395, -0.15434197774156927, 0.42749445995582, 0.2021341641127531, 0.17895653753674456, 0.07974293569435499, 0.30752322386285025, 0.14496757224343518, 0.07575152762566827, 0.0798933620880624, 0.17565664017456584, 0.10281142803175108, 0.025532186008723718, -0.23180059040697026, 0.04466538265879665, 0.06080712116772442]
|
1,803.0712
|
On Semi-Rational Groups
|
A finite group is called semi-rational if the distribution induced on it by
any word map is a virtual character. Amit and Vishne give a sufficient
condition for a group to be semi-rational, and ask whether it is also
necessary. We answer this in the negative, by exhibiting two new criteria for
semi-rationality, each giving rise to an infinite family of semi-rational
groups which do not satisfy the Amit-Vishne condition. On the other hand, we
use recent work of Lubotzky to show that for finite simple groups the
Amit-Vishne condition is indeed necessary, and we use this to construct the
first known example of an infinite family of non-semi-rational groups.
|
math.GR math.RT
|
a finite group is called semirational if the distribution induced on it by any word map is a virtual character amit and vishne give a sufficient condition for a group to be semirational and ask whether it is also necessary we answer this in the negative by exhibiting two new criteria for semirationality each giving rise to an infinite family of semirational groups which do not satisfy the amitvishne condition on the other hand we use recent work of lubotzky to show that for finite simple groups the amitvishne condition is indeed necessary and we use this to construct the first known example of an infinite family of nonsemirational groups
|
[['a', 'finite', 'group', 'is', 'called', 'semirational', 'if', 'the', 'distribution', 'induced', 'on', 'it', 'by', 'any', 'word', 'map', 'is', 'a', 'virtual', 'character', 'amit', 'and', 'vishne', 'give', 'a', 'sufficient', 'condition', 'for', 'a', 'group', 'to', 'be', 'semirational', 'and', 'ask', 'whether', 'it', 'is', 'also', 'necessary', 'we', 'answer', 'this', 'in', 'the', 'negative', 'by', 'exhibiting', 'two', 'new', 'criteria', 'for', 'semirationality', 'each', 'giving', 'rise', 'to', 'an', 'infinite', 'family', 'of', 'semirational', 'groups', 'which', 'do', 'not', 'satisfy', 'the', 'amitvishne', 'condition', 'on', 'the', 'other', 'hand', 'we', 'use', 'recent', 'work', 'of', 'lubotzky', 'to', 'show', 'that', 'for', 'finite', 'simple', 'groups', 'the', 'amitvishne', 'condition', 'is', 'indeed', 'necessary', 'and', 'we', 'use', 'this', 'to', 'construct', 'the', 'first', 'known', 'example', 'of', 'an', 'infinite', 'family', 'of', 'nonsemirational', 'groups']]
|
[-0.12111982678607949, 0.127336835192422, -0.1306980075578223, 0.098245231239213, -0.15044456024935363, -0.159531406777085, 0.039260890361202776, 0.36867376107652233, -0.27311105555679016, -0.24799949710942665, 0.1267609110284368, -0.2274774808858363, -0.18838054415295427, 0.225174765876837, -0.09685458966425427, -0.038233814696245386, 0.02679556420178346, 0.10636677093944459, -0.03587784277899015, -0.29148938182196665, 0.38257375399951105, -0.019129269835451303, 0.254037302180703, 0.09668544533152906, 0.13251484402472963, -0.008509479827722008, 0.01270127064715368, 0.018055905781264574, -0.1755735665590108, 0.09297287052954142, 0.21887558565984638, 0.12051581408617631, 0.2636158705407859, -0.3647907725974636, -0.16091772247509994, 0.19280058820182808, 0.10590464717550378, 0.11730617777123731, -0.07285449408952428, -0.24327257087559634, 0.15704815414786902, -0.1782815374586652, -0.1441687239017689, -0.0756071036558528, 0.0484030297561988, -0.002917599978522872, -0.26868705736156906, 0.007400990843515896, 0.13188020137296813, 0.05109593553363152, -0.05812550130528661, -0.042743347897106466, 0.0060259778193145425, 0.14085835483768638, -0.012323043161650962, -0.004107527759910192, -0.0038123823645225953, -0.07423659656218798, -0.10424376766742119, 0.38437714471969364, -0.051884500046243086, -0.24145505333073297, 0.19308168904082673, -0.12250383085799667, -0.17969034797564712, 0.10782073439924784, 0.11524332306822235, 0.12783886049434823, -0.11297108704786536, 0.07762844301595458, -0.13614787831726782, 0.13502912849346, 0.07650908866440351, -0.02011897011203164, 0.13524565141085745, 0.07769636836184084, 0.14223672922498565, 0.1407610518799629, 0.03321114980246661, 0.004093419127869156, -0.34233355044193986, -0.1931205996452778, -0.1491336818753724, 0.0740075234065924, -0.018621709475206992, -0.22347610080746477, 0.3729892522799519, 0.11583837449445196, 0.20750511909246375, 0.07232085173567405, 0.2079777182694876, 0.10646715142296294, 0.049956036356785985, 0.06492725202708312, 0.12329388104098023, 0.13100109309977237, -0.022411385700458062, -0.15518891449385094, 0.044745998370311804, 0.14123711851864773]
|
1,803.07121
|
Quantized Angular Momentum in Topological Optical Systems
|
The Chern index characterizes the topological phases of nonreciprocal
photonic systems. Unlike in electronic systems, the photonic Chern number has
no clear physical meaning, except that it determines the net number of
unidirectional edge states supported by an interface with a trivial mirror.
Here, we fill in this gap by demonstrating that the photonic Chern number can
be understood as a quantum of the light-angular momentum in a photonic
insulator cavity. It is proven that for a large cavity, when the discrete
spectrum can be approximated by a continuum, the spectral density of the
thermal fluctuation-induced angular momentum is precisely quantized in the
band-gaps of the bulk states. The nontrivial expectation of the light angular
momentum is due to a circulation of thermal energy in closed orbits.
Remarkably, this result can be extended to systems without a topological
classification, and in such a case the "quantum" of the angular momentum
density is determined by the net number of unidirectional edge states supported
by the cavity walls.
|
physics.optics
|
the chern index characterizes the topological phases of nonreciprocal photonic systems unlike in electronic systems the photonic chern number has no clear physical meaning except that it determines the net number of unidirectional edge states supported by an interface with a trivial mirror here we fill in this gap by demonstrating that the photonic chern number can be understood as a quantum of the lightangular momentum in a photonic insulator cavity it is proven that for a large cavity when the discrete spectrum can be approximated by a continuum the spectral density of the thermal fluctuationinduced angular momentum is precisely quantized in the bandgaps of the bulk states the nontrivial expectation of the light angular momentum is due to a circulation of thermal energy in closed orbits remarkably this result can be extended to systems without a topological classification and in such a case the quantum of the angular momentum density is determined by the net number of unidirectional edge states supported by the cavity walls
|
[['the', 'chern', 'index', 'characterizes', 'the', 'topological', 'phases', 'of', 'nonreciprocal', 'photonic', 'systems', 'unlike', 'in', 'electronic', 'systems', 'the', 'photonic', 'chern', 'number', 'has', 'no', 'clear', 'physical', 'meaning', 'except', 'that', 'it', 'determines', 'the', 'net', 'number', 'of', 'unidirectional', 'edge', 'states', 'supported', 'by', 'an', 'interface', 'with', 'a', 'trivial', 'mirror', 'here', 'we', 'fill', 'in', 'this', 'gap', 'by', 'demonstrating', 'that', 'the', 'photonic', 'chern', 'number', 'can', 'be', 'understood', 'as', 'a', 'quantum', 'of', 'the', 'lightangular', 'momentum', 'in', 'a', 'photonic', 'insulator', 'cavity', 'it', 'is', 'proven', 'that', 'for', 'a', 'large', 'cavity', 'when', 'the', 'discrete', 'spectrum', 'can', 'be', 'approximated', 'by', 'a', 'continuum', 'the', 'spectral', 'density', 'of', 'the', 'thermal', 'fluctuationinduced', 'angular', 'momentum', 'is', 'precisely', 'quantized', 'in', 'the', 'bandgaps', 'of', 'the', 'bulk', 'states', 'the', 'nontrivial', 'expectation', 'of', 'the', 'light', 'angular', 'momentum', 'is', 'due', 'to', 'a', 'circulation', 'of', 'thermal', 'energy', 'in', 'closed', 'orbits', 'remarkably', 'this', 'result', 'can', 'be', 'extended', 'to', 'systems', 'without', 'a', 'topological', 'classification', 'and', 'in', 'such', 'a', 'case', 'the', 'quantum', 'of', 'the', 'angular', 'momentum', 'density', 'is', 'determined', 'by', 'the', 'net', 'number', 'of', 'unidirectional', 'edge', 'states', 'supported', 'by', 'the', 'cavity', 'walls']]
|
[-0.22983964667514417, 0.22728002898714322, -0.08742974914723274, 0.022043687213833135, -0.03772158291981076, -0.1241572984466047, 0.05423939057527054, 0.3679314463879123, -0.25930047506434756, -0.2966027874048009, 0.03091959435718529, -0.2450378737130174, -0.13313700668937103, 0.18582623536860796, -0.04235960003835234, 0.08394852054559372, 0.011638161041914966, -0.0020066318236234963, -0.04481774760607743, -0.14271405273625118, 0.32675811374475333, 0.013895485126836733, 0.2740686886266551, 0.08398050613080461, 0.0498541529036381, -0.01912773974014051, 0.04612900373017923, 0.06109946309800514, -0.09128598181286537, 0.09177543189073208, 0.2537427237102141, -0.04114482214279247, 0.2186204289650601, -0.42652838081121447, -0.22602143248712475, 0.08460551133153565, 0.125478103435175, 0.14263093980508998, -0.03712883484267601, -0.2732632088263265, 0.07634563669350676, -0.18096541512870426, -0.15987521707729407, -0.0817082335466914, 0.026767916119459903, -0.029876532972874965, -0.18657847293934812, 0.06995744654683, 0.07826360905768745, 0.04173270597291941, -0.0455190455710346, -0.045357505226451336, -0.1406804061410102, 0.06736925344042848, -0.004034994062826489, 0.011969274229892163, 0.11009010454978455, -0.16388965123756366, -0.14307692320735166, 0.3811523575787291, -0.05303947860092828, -0.21407513732820835, 0.14398153034236394, -0.15346274078112787, -0.024087919593986238, 0.17492384382551818, 0.11557135086958155, 0.07572287730872632, -0.06155559906469672, 0.09651316105437494, -0.08799347433430904, 0.18639377213054986, 0.0523011606553513, 0.11016673239611202, 0.289837223646993, 0.1253234230532226, 0.08638294560439659, 0.16495897988365454, -0.08250948502823259, -0.07498341046668815, -0.2786299448347453, -0.22926171655047006, -0.3157289736537319, 0.08822009578685869, -0.053687057277155954, -0.1715103188416723, 0.44342826262511537, 0.06907217063108516, 0.21353629127878582, -0.007968521523148272, 0.3006713837526287, 0.17554150437865632, 0.09598947994156995, 0.09465510144699224, 0.2828370334975647, 0.1589836763345044, 0.09855615332384002, -0.26010825271633536, 0.01910208819688044, 0.020840171975732753]
|
1,803.07122
|
A Hybrid Quantum Memory Enabled Network at Room Temperature
|
Quantum memory capable of storage and retrieval of flying photons on demand
is crucial for developing quantum information technologies. However, the
devices needed for long-distance links are quite different from those
envisioned for local processing. Here, we present the first hybrid quantum
memory enabled network by demonstrating the interconnection and simultaneous
operation of two types of quantum memory: an atomic-ensemble-based memory and
an all-optical loop memory. The former generates and stores single atomic
excitations that can then be converted to single photons; and the latter maps
incoming photons in and out on demand, at room-temperature and with a broad
acceptance bandwidth. Interfacing these two types of quantum memories, we
observe a well-preserved quantum cross-correlation, reaching a value of 22, and
a violation of the Cauchy-Schwarz inequality up to 549 standard deviations.
Furthermore, we demonstrate the creation and storage of a fully operable
heralded photon chain state that can achieve memory-built-in combining,
swapping, splitting, tuning and chopping single photons in a chain temporally.
Such a quantum network allows atomic excitations to be generated, stored, and
converted to broadband photons, which are then transferred to the next node,
stored, and faithfully retrieved, all at high speed and in a programmable
fashion.
|
quant-ph physics.optics
|
quantum memory capable of storage and retrieval of flying photons on demand is crucial for developing quantum information technologies however the devices needed for longdistance links are quite different from those envisioned for local processing here we present the first hybrid quantum memory enabled network by demonstrating the interconnection and simultaneous operation of two types of quantum memory an atomicensemblebased memory and an alloptical loop memory the former generates and stores single atomic excitations that can then be converted to single photons and the latter maps incoming photons in and out on demand at roomtemperature and with a broad acceptance bandwidth interfacing these two types of quantum memories we observe a wellpreserved quantum crosscorrelation reaching a value of 22 and a violation of the cauchyschwarz inequality up to 549 standard deviations furthermore we demonstrate the creation and storage of a fully operable heralded photon chain state that can achieve memorybuiltin combining swapping splitting tuning and chopping single photons in a chain temporally such a quantum network allows atomic excitations to be generated stored and converted to broadband photons which are then transferred to the next node stored and faithfully retrieved all at high speed and in a programmable fashion
|
[['quantum', 'memory', 'capable', 'of', 'storage', 'and', 'retrieval', 'of', 'flying', 'photons', 'on', 'demand', 'is', 'crucial', 'for', 'developing', 'quantum', 'information', 'technologies', 'however', 'the', 'devices', 'needed', 'for', 'longdistance', 'links', 'are', 'quite', 'different', 'from', 'those', 'envisioned', 'for', 'local', 'processing', 'here', 'we', 'present', 'the', 'first', 'hybrid', 'quantum', 'memory', 'enabled', 'network', 'by', 'demonstrating', 'the', 'interconnection', 'and', 'simultaneous', 'operation', 'of', 'two', 'types', 'of', 'quantum', 'memory', 'an', 'atomicensemblebased', 'memory', 'and', 'an', 'alloptical', 'loop', 'memory', 'the', 'former', 'generates', 'and', 'stores', 'single', 'atomic', 'excitations', 'that', 'can', 'then', 'be', 'converted', 'to', 'single', 'photons', 'and', 'the', 'latter', 'maps', 'incoming', 'photons', 'in', 'and', 'out', 'on', 'demand', 'at', 'roomtemperature', 'and', 'with', 'a', 'broad', 'acceptance', 'bandwidth', 'interfacing', 'these', 'two', 'types', 'of', 'quantum', 'memories', 'we', 'observe', 'a', 'wellpreserved', 'quantum', 'crosscorrelation', 'reaching', 'a', 'value', 'of', '22', 'and', 'a', 'violation', 'of', 'the', 'cauchyschwarz', 'inequality', 'up', 'to', '549', 'standard', 'deviations', 'furthermore', 'we', 'demonstrate', 'the', 'creation', 'and', 'storage', 'of', 'a', 'fully', 'operable', 'heralded', 'photon', 'chain', 'state', 'that', 'can', 'achieve', 'memorybuiltin', 'combining', 'swapping', 'splitting', 'tuning', 'and', 'chopping', 'single', 'photons', 'in', 'a', 'chain', 'temporally', 'such', 'a', 'quantum', 'network', 'allows', 'atomic', 'excitations', 'to', 'be', 'generated', 'stored', 'and', 'converted', 'to', 'broadband', 'photons', 'which', 'are', 'then', 'transferred', 'to', 'the', 'next', 'node', 'stored', 'and', 'faithfully', 'retrieved', 'all', 'at', 'high', 'speed', 'and', 'in', 'a', 'programmable', 'fashion']]
|
[-0.1428396371704752, 0.20536458577547395, -0.023014496543886837, 0.01230991902456012, -0.020486223450838354, -0.20735318376447517, 0.08768517749964726, 0.4122988680716265, -0.30508114134591785, -0.32477748306524573, 0.06132506057819954, -0.28580129571910773, -0.044502197308559914, 0.23741165011406246, -0.02474153055127409, 0.08052773777344922, 0.06297760282883025, 0.0065352076786861875, -0.016715544071330718, -0.20187803639705773, 0.23681717669365532, 0.06130242986766847, 0.33758329365383644, 0.042288673869945635, 0.15652009696556218, 0.019882509616589307, 0.00046755976015419674, -0.028440950354890464, -0.031204882127628543, 0.1638865529864114, 0.24742247778075663, 0.10853498334986995, 0.22852504349812264, -0.4863553571825226, -0.19416413884939193, 0.09034806772927763, 0.13725423458681413, 0.14335344437770828, -0.06483062864469383, -0.2946222337489628, 0.061787634744600514, -0.19652547653661007, -0.027119465697850124, -0.11976356399857034, -0.011236466354492939, -0.008316572991345604, -0.2732909523292252, -0.0033651668663051996, 0.02200469107357103, 0.008980357593790901, 0.014576970725193868, -0.007368048304936501, 0.00586384560705887, 0.1408351167537874, -0.10341846810611473, -0.0032332039472289533, 0.15258660460022663, -0.1439052755512871, -0.18609724849264955, 0.35825259842900464, -0.046599997448290444, -0.13023785494780638, 0.151821907531503, -0.09068140510182753, -0.09371213578957725, 0.10384021004229183, 0.1534518252457304, 0.07034814913728923, -0.15465147852147412, 0.007471557135983004, 0.046185161499776924, 0.23033964873239812, 0.09511057514405687, 0.16727486408945888, 0.23972563360667212, 0.14547605733528282, 0.05568656502903035, 0.1765384234361894, -0.1231478092994428, -0.12186677993105893, -0.2868615256780006, -0.19563094526882085, -0.22292880226465206, 0.09002841208506414, -0.06686230822761174, -0.1018634200274869, 0.39114146902592795, 0.14268927083844343, 0.15636217969497948, 0.028819386631537304, 0.33394894460122093, 0.10769114908621166, 0.11921136798878022, 0.0961692359603029, 0.20646312829069416, 0.09897418609688605, 0.1497007330851347, -0.20008163609556062, 0.027541517777453093, -0.02907653202918932]
|
1,803.07123
|
Fundamentals of Wireless Information and Power Transfer: From RF Energy
Harvester Models to Signal and System Designs
|
Radio waves carry both energy and information simultaneously. Nevertheless,
Radio-Frequency (RF) transmission of these quantities have traditionally been
treated separately. Currently, we are experiencing a paradigm shift in wireless
network design, namely unifying wireless transmission of information and power
so as to make the best use of the RF spectrum and radiations as well as the
network infrastructure for the dual purpose of communicating and energizing. In
this paper, we review and discuss recent progress on laying the foundations of
the envisioned dual purpose networks by establishing a signal theory and design
for Wireless Information and Power Transmission (WIPT) and identifying the
fundamental tradeoff between conveying information and power wirelessly. We
start with an overview of WIPT challenges and technologies, namely Simultaneous
Wireless Information and Power Transfer (SWIPT),Wirelessly Powered
Communication Network (WPCN), and Wirelessly Powered Backscatter Communication
(WPBC). We then characterize energy harvesters and show how WIPT signal and
system designs crucially revolve around the underlying energy harvester model.
To that end, we highlight three different energy harvester models, namely one
linear model and two nonlinear models, and show how WIPT designs differ for
each of them in single-user and multi-user deployments. Topics discussed
include rate-energy region characterization, transmitter and receiver
architecture, waveform design, modulation, beamforming and input distribution
optimizations, resource allocation, and RF spectrum use. We discuss and check
the validity of the different energy harvester models and the resulting signal
theory and design based on circuit simulations, prototyping and
experimentation. We also point out numerous directions that are promising for
future research.
|
cs.IT eess.SP math.IT
|
radio waves carry both energy and information simultaneously nevertheless radiofrequency rf transmission of these quantities have traditionally been treated separately currently we are experiencing a paradigm shift in wireless network design namely unifying wireless transmission of information and power so as to make the best use of the rf spectrum and radiations as well as the network infrastructure for the dual purpose of communicating and energizing in this paper we review and discuss recent progress on laying the foundations of the envisioned dual purpose networks by establishing a signal theory and design for wireless information and power transmission wipt and identifying the fundamental tradeoff between conveying information and power wirelessly we start with an overview of wipt challenges and technologies namely simultaneous wireless information and power transfer swiptwirelessly powered communication network wpcn and wirelessly powered backscatter communication wpbc we then characterize energy harvesters and show how wipt signal and system designs crucially revolve around the underlying energy harvester model to that end we highlight three different energy harvester models namely one linear model and two nonlinear models and show how wipt designs differ for each of them in singleuser and multiuser deployments topics discussed include rateenergy region characterization transmitter and receiver architecture waveform design modulation beamforming and input distribution optimizations resource allocation and rf spectrum use we discuss and check the validity of the different energy harvester models and the resulting signal theory and design based on circuit simulations prototyping and experimentation we also point out numerous directions that are promising for future research
|
[['radio', 'waves', 'carry', 'both', 'energy', 'and', 'information', 'simultaneously', 'nevertheless', 'radiofrequency', 'rf', 'transmission', 'of', 'these', 'quantities', 'have', 'traditionally', 'been', 'treated', 'separately', 'currently', 'we', 'are', 'experiencing', 'a', 'paradigm', 'shift', 'in', 'wireless', 'network', 'design', 'namely', 'unifying', 'wireless', 'transmission', 'of', 'information', 'and', 'power', 'so', 'as', 'to', 'make', 'the', 'best', 'use', 'of', 'the', 'rf', 'spectrum', 'and', 'radiations', 'as', 'well', 'as', 'the', 'network', 'infrastructure', 'for', 'the', 'dual', 'purpose', 'of', 'communicating', 'and', 'energizing', 'in', 'this', 'paper', 'we', 'review', 'and', 'discuss', 'recent', 'progress', 'on', 'laying', 'the', 'foundations', 'of', 'the', 'envisioned', 'dual', 'purpose', 'networks', 'by', 'establishing', 'a', 'signal', 'theory', 'and', 'design', 'for', 'wireless', 'information', 'and', 'power', 'transmission', 'wipt', 'and', 'identifying', 'the', 'fundamental', 'tradeoff', 'between', 'conveying', 'information', 'and', 'power', 'wirelessly', 'we', 'start', 'with', 'an', 'overview', 'of', 'wipt', 'challenges', 'and', 'technologies', 'namely', 'simultaneous', 'wireless', 'information', 'and', 'power', 'transfer', 'swiptwirelessly', 'powered', 'communication', 'network', 'wpcn', 'and', 'wirelessly', 'powered', 'backscatter', 'communication', 'wpbc', 'we', 'then', 'characterize', 'energy', 'harvesters', 'and', 'show', 'how', 'wipt', 'signal', 'and', 'system', 'designs', 'crucially', 'revolve', 'around', 'the', 'underlying', 'energy', 'harvester', 'model', 'to', 'that', 'end', 'we', 'highlight', 'three', 'different', 'energy', 'harvester', 'models', 'namely', 'one', 'linear', 'model', 'and', 'two', 'nonlinear', 'models', 'and', 'show', 'how', 'wipt', 'designs', 'differ', 'for', 'each', 'of', 'them', 'in', 'singleuser', 'and', 'multiuser', 'deployments', 'topics', 'discussed', 'include', 'rateenergy', 'region', 'characterization', 'transmitter', 'and', 'receiver', 'architecture', 'waveform', 'design', 'modulation', 'beamforming', 'and', 'input', 'distribution', 'optimizations', 'resource', 'allocation', 'and', 'rf', 'spectrum', 'use', 'we', 'discuss', 'and', 'check', 'the', 'validity', 'of', 'the', 'different', 'energy', 'harvester', 'models', 'and', 'the', 'resulting', 'signal', 'theory', 'and', 'design', 'based', 'on', 'circuit', 'simulations', 'prototyping', 'and', 'experimentation', 'we', 'also', 'point', 'out', 'numerous', 'directions', 'that', 'are', 'promising', 'for', 'future', 'research']]
|
[-0.19951613263913573, 0.037745757415495435, -0.008499371506303196, 0.018320838932505634, -0.09465157717862994, -0.24363366854579552, 0.05278824005237313, 0.41044780011693743, -0.2650392044688991, -0.3001994944781271, 0.1177745651432567, -0.2695766640093137, -0.20749879992942477, 0.20812652730097692, -0.06290865187515254, 0.0687380695159698, 0.03690431401360846, -0.006894982542305183, 0.00016756495322825998, -0.1597278501975107, 0.2959636881240743, 0.14836231432026878, 0.38364939310329343, 0.06279562468863213, 0.08933613434797562, 0.018441000647783985, -0.05774023002607144, -0.06919506515133315, -0.12358196147112682, 0.13085821678626383, 0.3404125398699568, 0.22511795028333695, 0.264788067430302, -0.4837378500169327, -0.28199850902211643, 0.09581996746459726, 0.1387669515760115, 0.046765354342331644, -0.07001382444815879, -0.2254980318910873, 0.07853428429253068, -0.2420140499388983, -0.03654756385965545, -0.034902117562732426, -0.06625483245239133, 0.09168647268541771, -0.2645276755466321, -0.030005745108772193, 0.015759741115681056, 0.045984455578492976, -0.07130301114366842, -0.10548137262483816, 0.026008857647877318, 0.1683318550084633, 0.013072819019237113, -0.04866364807959852, 0.14062569157327176, -0.12141522645339252, -0.134904236863128, 0.3509679923612595, 0.032902511880317106, -0.16745189346350994, 0.14747770479328107, -0.05223449243309911, -0.12171093260468142, 0.06026503603846541, 0.2475787184326339, 0.038171067416496306, -0.1981464179781203, 0.014791826124435564, 0.07944698547926021, 0.15441053599110444, 0.07343012393220316, 0.1423716208890169, 0.24587828190279426, 0.2001561743580909, 0.08129115894955874, 0.12784690614108718, -0.10835798517370637, -0.10967066525868159, -0.24555121470066046, -0.11652751263091157, -0.19506976856544556, 0.020133006671745432, -0.03690690289411635, -0.04515917344697983, 0.41285383908749645, 0.1636113743951154, 0.11073504102861752, 0.05218523403210013, 0.4165654077292181, 0.07572504139934177, 0.03051489907806452, 0.12892128391331245, 0.2300628376425255, 0.1240040969348369, 0.16738262563840792, -0.18383078484044466, -0.022074311428239547, -0.03470898536586096]
|
1,803.07124
|
Optical transparency and electrical conductivity of single-wall carbon
nanotubes and of intermediate filaments of porcine M\"uller cells
|
In the present study, we continue investigation of the high-contrast vision
in the inverted retina of the vertebrates eyes. We report a method of
separation and purification of porcine (Sus scrofa domestica) intermediate
filaments (IFs), extracted from the retinal M\"uller cells (MCs). We also
report experimental and theoretical methods of measurements and calculations of
the reduced resistivity and light transmission by the IFs and single-wall
carbon nanotubes (SWCNTs). The measured reduced resistivity values were
(3.1+-0.3)*10^-4 and (2.8+-0.2)*10^-4 Ohm m^-1 cm^2, respectively, being quite
close to those of typical metals. We report a method for measuring the light
energy transmission by the intermediate filaments and single-wall carbon
nanotubes. We found that these structures efficiently transfer light energy
along its axis, with the light reemitted at the other end of the structure. We
also report spectral selectivity of the IFs. The reported results demonstrate
that the assumptions we made in deducing the theory of high-contrast vision in
an inverted retina were correct and fully supported by the presently reported
experimental results.
|
cond-mat.mes-hall q-bio.BM
|
in the present study we continue investigation of the highcontrast vision in the inverted retina of the vertebrates eyes we report a method of separation and purification of porcine sus scrofa domestica intermediate filaments ifs extracted from the retinal muller cells mcs we also report experimental and theoretical methods of measurements and calculations of the reduced resistivity and light transmission by the ifs and singlewall carbon nanotubes swcnts the measured reduced resistivity values were 3103104 and 2802104 ohm m1 cm2 respectively being quite close to those of typical metals we report a method for measuring the light energy transmission by the intermediate filaments and singlewall carbon nanotubes we found that these structures efficiently transfer light energy along its axis with the light reemitted at the other end of the structure we also report spectral selectivity of the ifs the reported results demonstrate that the assumptions we made in deducing the theory of highcontrast vision in an inverted retina were correct and fully supported by the presently reported experimental results
|
[['in', 'the', 'present', 'study', 'we', 'continue', 'investigation', 'of', 'the', 'highcontrast', 'vision', 'in', 'the', 'inverted', 'retina', 'of', 'the', 'vertebrates', 'eyes', 'we', 'report', 'a', 'method', 'of', 'separation', 'and', 'purification', 'of', 'porcine', 'sus', 'scrofa', 'domestica', 'intermediate', 'filaments', 'ifs', 'extracted', 'from', 'the', 'retinal', 'muller', 'cells', 'mcs', 'we', 'also', 'report', 'experimental', 'and', 'theoretical', 'methods', 'of', 'measurements', 'and', 'calculations', 'of', 'the', 'reduced', 'resistivity', 'and', 'light', 'transmission', 'by', 'the', 'ifs', 'and', 'singlewall', 'carbon', 'nanotubes', 'swcnts', 'the', 'measured', 'reduced', 'resistivity', 'values', 'were', '3103104', 'and', '2802104', 'ohm', 'm1', 'cm2', 'respectively', 'being', 'quite', 'close', 'to', 'those', 'of', 'typical', 'metals', 'we', 'report', 'a', 'method', 'for', 'measuring', 'the', 'light', 'energy', 'transmission', 'by', 'the', 'intermediate', 'filaments', 'and', 'singlewall', 'carbon', 'nanotubes', 'we', 'found', 'that', 'these', 'structures', 'efficiently', 'transfer', 'light', 'energy', 'along', 'its', 'axis', 'with', 'the', 'light', 'reemitted', 'at', 'the', 'other', 'end', 'of', 'the', 'structure', 'we', 'also', 'report', 'spectral', 'selectivity', 'of', 'the', 'ifs', 'the', 'reported', 'results', 'demonstrate', 'that', 'the', 'assumptions', 'we', 'made', 'in', 'deducing', 'the', 'theory', 'of', 'highcontrast', 'vision', 'in', 'an', 'inverted', 'retina', 'were', 'correct', 'and', 'fully', 'supported', 'by', 'the', 'presently', 'reported', 'experimental', 'results']]
|
[-0.10413405534063437, 0.1243757586736606, -0.047984155479141255, -0.007904873133608789, 0.004435398294167085, -0.11935527266398298, 0.06306326536701597, 0.4704740917705225, -0.2252007918432355, -0.31746308002903156, 0.06793895105153999, -0.30016829229778413, -0.1673065679542946, 0.2089612228499556, -0.02841450083210613, 0.05353112111236745, 0.11030214607264056, -0.03878867029297081, -0.033776032611389055, -0.19917771386575292, 0.24750498827885498, 0.0651791161151998, 0.302105248320114, 0.07124996952373873, 0.06429882707130728, -0.03529805854019342, -0.04142420494851346, 0.004968251992602635, -0.15430322161145424, 0.1538133709098805, 0.22909777179134613, 0.032676160770157975, 0.17889396330221755, -0.44739812763802933, -0.19101328587893285, 0.01645862612816872, 0.14947533512657338, 0.08488640510053798, -0.0731203203682195, -0.28132439359147665, 0.09729488814306078, -0.10095600325783545, -0.12279048425738107, -0.022534716932921472, -0.026644252395878237, 0.04005626183652291, -0.20301429775409457, 0.07112334145719863, 0.0034886483385255843, 0.10969612693416737, -0.13236300039711887, -0.13987643766132268, -0.03843531515678589, 0.11445234083838648, 0.021308310668576847, -0.03480109556747431, 0.2070062502117997, -0.13372689350084824, -0.08655996888198636, 0.34653474836412707, -0.06629992453945857, -0.07866268635755687, 0.17228692620428224, -0.19232039615850557, -0.10276399099014022, 0.14512013582456293, 0.11544856505016937, 0.12240251392464746, -0.15464018893491646, -0.005649836790381056, -0.048503678615176765, 0.18241877931268943, 0.08154257304514899, 0.03415811718582656, 0.19671690820180104, 0.19344005064798914, -0.03522241999197638, 0.1340368191369414, -0.17473502958080533, 0.014950079146321073, -0.23361754689478512, -0.1829732158334192, -0.14975748737765984, 0.052206810384593676, -0.0514563194892341, -0.12457514899133733, 0.3932182062755932, 0.13837069669230417, 0.1995000270308193, 0.037151319082036165, 0.31184134237242467, 0.06706647268059014, 0.08581509579142386, 0.019995634393258528, 0.29708535020287274, 0.15628539544078662, 0.15182991178819175, -0.2593066632789983, 0.0438602092591199, -0.019389315065222255]
|
1,803.07125
|
Local Binary Pattern Networks
|
Memory and computation efficient deep learning architec- tures are crucial to
continued proliferation of machine learning capabili- ties to new platforms and
systems. Binarization of operations in convo- lutional neural networks has
shown promising results in reducing model size and computing efficiency. In
this paper, we tackle the problem us- ing a strategy different from the
existing literature by proposing local binary pattern networks or LBPNet, that
is able to learn and perform binary operations in an end-to-end fashion.
LBPNet1 uses local binary comparisons and random projection in place of
conventional convolu- tion (or approximation of convolution) operations. These
operations can be implemented efficiently on different platforms including
direct hard- ware implementation. We applied LBPNet and its variants on
standard benchmarks. The results are promising across benchmarks while provid-
ing an important means to improve memory and speed efficiency that is
particularly suited for small footprint devices and hardware accelerators.
|
cs.CV
|
memory and computation efficient deep learning architec tures are crucial to continued proliferation of machine learning capabili ties to new platforms and systems binarization of operations in convo lutional neural networks has shown promising results in reducing model size and computing efficiency in this paper we tackle the problem us ing a strategy different from the existing literature by proposing local binary pattern networks or lbpnet that is able to learn and perform binary operations in an endtoend fashion lbpnet1 uses local binary comparisons and random projection in place of conventional convolu tion or approximation of convolution operations these operations can be implemented efficiently on different platforms including direct hard ware implementation we applied lbpnet and its variants on standard benchmarks the results are promising across benchmarks while provid ing an important means to improve memory and speed efficiency that is particularly suited for small footprint devices and hardware accelerators
|
[['memory', 'and', 'computation', 'efficient', 'deep', 'learning', 'architec', 'tures', 'are', 'crucial', 'to', 'continued', 'proliferation', 'of', 'machine', 'learning', 'capabili', 'ties', 'to', 'new', 'platforms', 'and', 'systems', 'binarization', 'of', 'operations', 'in', 'convo', 'lutional', 'neural', 'networks', 'has', 'shown', 'promising', 'results', 'in', 'reducing', 'model', 'size', 'and', 'computing', 'efficiency', 'in', 'this', 'paper', 'we', 'tackle', 'the', 'problem', 'us', 'ing', 'a', 'strategy', 'different', 'from', 'the', 'existing', 'literature', 'by', 'proposing', 'local', 'binary', 'pattern', 'networks', 'or', 'lbpnet', 'that', 'is', 'able', 'to', 'learn', 'and', 'perform', 'binary', 'operations', 'in', 'an', 'endtoend', 'fashion', 'lbpnet1', 'uses', 'local', 'binary', 'comparisons', 'and', 'random', 'projection', 'in', 'place', 'of', 'conventional', 'convolu', 'tion', 'or', 'approximation', 'of', 'convolution', 'operations', 'these', 'operations', 'can', 'be', 'implemented', 'efficiently', 'on', 'different', 'platforms', 'including', 'direct', 'hard', 'ware', 'implementation', 'we', 'applied', 'lbpnet', 'and', 'its', 'variants', 'on', 'standard', 'benchmarks', 'the', 'results', 'are', 'promising', 'across', 'benchmarks', 'while', 'provid', 'ing', 'an', 'important', 'means', 'to', 'improve', 'memory', 'and', 'speed', 'efficiency', 'that', 'is', 'particularly', 'suited', 'for', 'small', 'footprint', 'devices', 'and', 'hardware', 'accelerators']]
|
[-0.09666701762044758, 0.023838593041060223, -0.05358265655287478, 0.060335208113266994, -0.09242614606803615, -0.18175151460000302, 0.06472945785666624, 0.4441132679173391, -0.29396313925158896, -0.33103660573187754, 0.11525655678100247, -0.2280540590282938, -0.18383288471194062, 0.2530788755736454, -0.1170127857761531, 0.13490994269473236, 0.11165784790470865, -0.018696977744159633, -0.07629951360824434, -0.28392809033728755, 0.2391965393286377, 0.08813159601353843, 0.33120264254720905, 0.02247942144638055, 0.09562749259671426, 0.009239563217692792, -0.04209403358463657, -0.0029560851191540493, -0.03268970327488903, 0.1714083120818505, 0.2955903398058033, 0.17979060157444582, 0.2953647430348274, -0.49301913163739525, -0.1867114429311087, 0.10196892671806942, 0.16753319787237894, 0.08217908763358599, -0.04497777310531739, -0.27030431475468003, 0.09695152669015966, -0.19947105098184045, -0.0036313131367684062, -0.1828673879411837, 0.0041886341860932486, 0.03338630986041134, -0.264305429626017, 0.005553950571569882, 0.04756568262213203, -0.0015139149642256025, -0.007722703215832765, -0.11571576605129937, 0.08268534104110137, 0.15856393216152306, -0.025980290996663477, 0.04651588410671724, 0.14305824773028902, -0.15961620359432768, -0.19074678627378627, 0.36685388252037027, -0.03170353275594582, -0.16867040167562664, 0.24889436647398014, 0.014511458052653973, -0.16413309410922483, 0.0728715388181066, 0.264320256501079, 0.11426139343848886, -0.15626361742392436, 0.052633871640117, 0.03462544343855283, 0.17585620117590647, 0.04424784574274943, 0.03765651931641751, 0.17843521920300714, 0.25528534878147385, 0.05151744083380199, 0.14370572859698855, -0.09403212261960318, -0.11252960951501274, -0.15164303778804686, -0.12297475623438926, -0.16483951576551653, -0.030482316976490873, -0.08538167850072145, -0.13054812114160708, 0.347887550302054, 0.1982563521620524, 0.15937899735960345, 0.07904697509386022, 0.3742106426156394, 0.04971705756328796, 0.1761253351945277, 0.13224973405826174, 0.16700593931345295, 0.06216378510157795, 0.14106848837380387, -0.16087134644765508, 0.07844252461784404, 0.042127249188312926]
|
1,803.07126
|
Dancing Honey bee Robot Elicits Dance-Following and Recruits Foragers
|
The honey bee dance communication system is one of the most popular examples
of animal communication. Forager bees communicate the flight vector towards
food, water, or resin sources to nestmates by performing a stereotypical motion
pattern on the comb surface in the darkness of the hive. Bees that actively
follow the circles of the dancer, so called dance-followers, may decode the
message and fly according to the indicated vector that refers to the sun
compass and their visual odometer. We investigated the dance communication
system with a honeybee robot that reproduced the waggle dance pattern for a
flight vector chosen by the experimenter. The dancing robot, called RoboBee,
generated multiple cues contained in the biological dance pattern and elicited
natural dance-following behavior in live bees. By tracking the flight
trajectory of departing bees after following the dancing robot via harmonic
radar we confirmed that bees used information obtained from the robotic dance
to adjust their flight path. This is the first report on successful dance
following and subsequent flight performance of bees recruited by a biomimetic
robot.
|
cs.RO
|
the honey bee dance communication system is one of the most popular examples of animal communication forager bees communicate the flight vector towards food water or resin sources to nestmates by performing a stereotypical motion pattern on the comb surface in the darkness of the hive bees that actively follow the circles of the dancer so called dancefollowers may decode the message and fly according to the indicated vector that refers to the sun compass and their visual odometer we investigated the dance communication system with a honeybee robot that reproduced the waggle dance pattern for a flight vector chosen by the experimenter the dancing robot called robobee generated multiple cues contained in the biological dance pattern and elicited natural dancefollowing behavior in live bees by tracking the flight trajectory of departing bees after following the dancing robot via harmonic radar we confirmed that bees used information obtained from the robotic dance to adjust their flight path this is the first report on successful dance following and subsequent flight performance of bees recruited by a biomimetic robot
|
[['the', 'honey', 'bee', 'dance', 'communication', 'system', 'is', 'one', 'of', 'the', 'most', 'popular', 'examples', 'of', 'animal', 'communication', 'forager', 'bees', 'communicate', 'the', 'flight', 'vector', 'towards', 'food', 'water', 'or', 'resin', 'sources', 'to', 'nestmates', 'by', 'performing', 'a', 'stereotypical', 'motion', 'pattern', 'on', 'the', 'comb', 'surface', 'in', 'the', 'darkness', 'of', 'the', 'hive', 'bees', 'that', 'actively', 'follow', 'the', 'circles', 'of', 'the', 'dancer', 'so', 'called', 'dancefollowers', 'may', 'decode', 'the', 'message', 'and', 'fly', 'according', 'to', 'the', 'indicated', 'vector', 'that', 'refers', 'to', 'the', 'sun', 'compass', 'and', 'their', 'visual', 'odometer', 'we', 'investigated', 'the', 'dance', 'communication', 'system', 'with', 'a', 'honeybee', 'robot', 'that', 'reproduced', 'the', 'waggle', 'dance', 'pattern', 'for', 'a', 'flight', 'vector', 'chosen', 'by', 'the', 'experimenter', 'the', 'dancing', 'robot', 'called', 'robobee', 'generated', 'multiple', 'cues', 'contained', 'in', 'the', 'biological', 'dance', 'pattern', 'and', 'elicited', 'natural', 'dancefollowing', 'behavior', 'in', 'live', 'bees', 'by', 'tracking', 'the', 'flight', 'trajectory', 'of', 'departing', 'bees', 'after', 'following', 'the', 'dancing', 'robot', 'via', 'harmonic', 'radar', 'we', 'confirmed', 'that', 'bees', 'used', 'information', 'obtained', 'from', 'the', 'robotic', 'dance', 'to', 'adjust', 'their', 'flight', 'path', 'this', 'is', 'the', 'first', 'report', 'on', 'successful', 'dance', 'following', 'and', 'subsequent', 'flight', 'performance', 'of', 'bees', 'recruited', 'by', 'a', 'biomimetic', 'robot']]
|
[-0.10740206287685386, 0.16154710691617588, -0.11218766929776121, -0.0035127381133129715, -0.11782026875244946, -0.19097629444668304, 0.055423140627514016, 0.41232924330337295, -0.27687060020813165, -0.3076429401588594, 0.07326009528291273, -0.291251344402888, -0.22470861939504613, 0.15937373807637728, -0.1559388450525211, 0.05566342138677258, 0.105822393269246, 0.07941291253510649, 0.117594968047175, -0.20376476908106647, 0.21059625307312127, 0.04039271171044173, 0.24926653385012484, -0.0714646003251874, 0.19411535998645785, 0.055410867059153726, -0.03418841361517793, -0.06784366030984822, -0.09019029874909246, 0.11679168034682115, 0.23674773676026528, 0.19955898321437082, 0.254949802744213, -0.45240983330569734, -0.18805502147692116, 0.08586700303190999, 0.17200140251200005, 0.04875751277271273, -0.050898203806041396, -0.40609170222419433, 0.0717354848386784, -0.12477177838479094, -0.11913300552753325, -0.01653597627274007, 0.006532751955091953, 0.06979174091582369, -0.19712452820134913, -0.04294828146203667, 0.02306474658764963, 0.13894201768796366, -0.0629307978810614, -0.04762148797570931, -0.05625458497918029, 0.25975673527579923, 0.0500995116589334, 0.04377051634411595, 0.24107869792242545, -0.14193384940388087, -0.17842359136757924, 0.4160420212830449, 0.0008020475868071461, -0.14990077386663733, 0.18934792688721255, -0.09739109181167407, -0.07142921375249908, 0.11352339016284323, 0.20644900055826995, 0.09932439807727504, -0.18486139619316178, -0.07305482641831254, -0.025347966761007135, 0.1520972656134259, 0.12035884601920414, -0.08498417991802268, 0.18092838421066046, 0.20274576537268257, 0.06850327526743727, 0.09188675369944252, -0.09828060523114414, -0.1260567406920352, -0.1677498897024425, -0.15515359963060238, -0.16469109813674707, -0.052119652357958686, -0.04960755984822085, -0.09013070355018268, 0.4032727061053631, 0.15504980086276693, 0.14558584503187189, 0.07098304351053104, 0.3157128222502806, -0.04538006505704131, 0.06902492395869789, 0.05144702028563439, 0.20693573887170902, -0.0329970555358577, 0.19699458312778467, -0.25683752303486745, 0.1323903946596701, 0.05087476179282042]
|
1,803.07127
|
Impulsive Control for G-AIMD Dynamics with Relaxed and Hard Constraints
|
Motivated by various applications from Internet congestion control to power
control in smart grids and electric vehicle charging, we study Generalized
Additive Increase Multiplicative Decrease (G-AIMD) dynamics under impulsive
control in continuous time with the time average alpha-fairness criterion. We
first show that the control under relaxed constraints can be described by a
threshold. Then, we propose a Whittle-type index heuristic for the hard
constraint problem. We prove that in the homogeneous case the index policy is
asymptotically optimal when the number of users is large.
|
math.OC cs.NI
|
motivated by various applications from internet congestion control to power control in smart grids and electric vehicle charging we study generalized additive increase multiplicative decrease gaimd dynamics under impulsive control in continuous time with the time average alphafairness criterion we first show that the control under relaxed constraints can be described by a threshold then we propose a whittletype index heuristic for the hard constraint problem we prove that in the homogeneous case the index policy is asymptotically optimal when the number of users is large
|
[['motivated', 'by', 'various', 'applications', 'from', 'internet', 'congestion', 'control', 'to', 'power', 'control', 'in', 'smart', 'grids', 'and', 'electric', 'vehicle', 'charging', 'we', 'study', 'generalized', 'additive', 'increase', 'multiplicative', 'decrease', 'gaimd', 'dynamics', 'under', 'impulsive', 'control', 'in', 'continuous', 'time', 'with', 'the', 'time', 'average', 'alphafairness', 'criterion', 'we', 'first', 'show', 'that', 'the', 'control', 'under', 'relaxed', 'constraints', 'can', 'be', 'described', 'by', 'a', 'threshold', 'then', 'we', 'propose', 'a', 'whittletype', 'index', 'heuristic', 'for', 'the', 'hard', 'constraint', 'problem', 'we', 'prove', 'that', 'in', 'the', 'homogeneous', 'case', 'the', 'index', 'policy', 'is', 'asymptotically', 'optimal', 'when', 'the', 'number', 'of', 'users', 'is', 'large']]
|
[-0.16418429801569265, 0.11614833221058635, -0.056225970031364876, 0.05272245110450861, -0.07740480325677816, -0.1747658423969851, 0.10197599070037112, 0.3995293771081111, -0.32008801177144053, -0.3337868866784608, 0.12956261190941887, -0.20554819433018565, -0.17997043787994804, 0.19482099770513528, -0.15764230293605258, 0.09918339954250875, 0.0011375364409211804, 0.01882861666381359, -0.005048489083042916, -0.2527721414232955, 0.2829043766428881, 0.047806395747808414, 0.31764590127722303, 0.04761572753983166, 0.08380788344990886, 0.03818369292078869, -0.0032163443728624023, 0.08731261970584883, -0.12852839592327228, 0.06419005343991825, 0.2694059964707669, 0.11727893899523598, 0.3326724784777445, -0.4220224897212842, -0.22463740546475439, 0.1482113475623705, 0.08628784235402503, 0.04841183624504244, -0.058602499051074335, -0.23161733166095527, 0.16303855682011037, -0.2157007912393002, -0.11263841658501941, -0.028350923703435588, -0.004446478757788154, 0.07596043137669126, -0.3436061453512486, 0.03784342259168625, 0.017789250776609953, 0.005527501635472564, -0.11153711779590915, -0.03789686766617438, 0.028059663057929892, 0.11178820219664724, 0.052022693418514204, -0.04166085987269659, 0.15666469540446998, -0.10824624682393144, -0.13484007463626124, 0.35779314667863005, -0.058569674867698374, -0.20514968329054467, 0.07299455150085336, -0.06189320338479079, -0.13178339546327206, 0.12051983430214665, 0.22640863603309674, 0.11462165880948305, -0.14525782100339282, 0.08510547153153525, -0.04004155792953337, 0.18489506788113538, 0.06833068429328062, -0.0031851184876252187, 0.11095720991930541, 0.16681197025703595, 0.2376009179827045, 0.1915289527229855, -0.028393229502527154, -0.12131522343877484, -0.26058730129152535, -0.09195708378272897, -0.1444013817482354, 0.07355132779681726, -0.11717835916736957, -0.10641612367677118, 0.3551128069377121, 0.13495006544844193, 0.13465226969736463, 0.11014949700192493, 0.3266345812336487, 0.2018586384022937, -0.018996289301225367, 0.1433717884671162, 0.18311508264365223, 0.04875232703874216, 0.12075529462274383, -0.23338545862420956, 0.07049240966546623, 0.045244524485486395]
|
1,803.07128
|
Quantum machine learning in feature Hilbert spaces
|
The basic idea of quantum computing is surprisingly similar to that of kernel
methods in machine learning, namely to efficiently perform computations in an
intractably large Hilbert space. In this paper we explore some theoretical
foundations of this link and show how it opens up a new avenue for the design
of quantum machine learning algorithms. We interpret the process of encoding
inputs in a quantum state as a nonlinear feature map that maps data to quantum
Hilbert space. A quantum computer can now analyse the input data in this
feature space. Based on this link, we discuss two approaches for building a
quantum model for classification. In the first approach, the quantum device
estimates inner products of quantum states to compute a classically intractable
kernel. This kernel can be fed into any classical kernel method such as a
support vector machine. In the second approach, we can use a variational
quantum circuit as a linear model that classifies data explicitly in Hilbert
space. We illustrate these ideas with a feature map based on squeezing in a
continuous-variable system, and visualise the working principle with
$2$-dimensional mini-benchmark datasets.
|
quant-ph
|
the basic idea of quantum computing is surprisingly similar to that of kernel methods in machine learning namely to efficiently perform computations in an intractably large hilbert space in this paper we explore some theoretical foundations of this link and show how it opens up a new avenue for the design of quantum machine learning algorithms we interpret the process of encoding inputs in a quantum state as a nonlinear feature map that maps data to quantum hilbert space a quantum computer can now analyse the input data in this feature space based on this link we discuss two approaches for building a quantum model for classification in the first approach the quantum device estimates inner products of quantum states to compute a classically intractable kernel this kernel can be fed into any classical kernel method such as a support vector machine in the second approach we can use a variational quantum circuit as a linear model that classifies data explicitly in hilbert space we illustrate these ideas with a feature map based on squeezing in a continuousvariable system and visualise the working principle with 2dimensional minibenchmark datasets
|
[['the', 'basic', 'idea', 'of', 'quantum', 'computing', 'is', 'surprisingly', 'similar', 'to', 'that', 'of', 'kernel', 'methods', 'in', 'machine', 'learning', 'namely', 'to', 'efficiently', 'perform', 'computations', 'in', 'an', 'intractably', 'large', 'hilbert', 'space', 'in', 'this', 'paper', 'we', 'explore', 'some', 'theoretical', 'foundations', 'of', 'this', 'link', 'and', 'show', 'how', 'it', 'opens', 'up', 'a', 'new', 'avenue', 'for', 'the', 'design', 'of', 'quantum', 'machine', 'learning', 'algorithms', 'we', 'interpret', 'the', 'process', 'of', 'encoding', 'inputs', 'in', 'a', 'quantum', 'state', 'as', 'a', 'nonlinear', 'feature', 'map', 'that', 'maps', 'data', 'to', 'quantum', 'hilbert', 'space', 'a', 'quantum', 'computer', 'can', 'now', 'analyse', 'the', 'input', 'data', 'in', 'this', 'feature', 'space', 'based', 'on', 'this', 'link', 'we', 'discuss', 'two', 'approaches', 'for', 'building', 'a', 'quantum', 'model', 'for', 'classification', 'in', 'the', 'first', 'approach', 'the', 'quantum', 'device', 'estimates', 'inner', 'products', 'of', 'quantum', 'states', 'to', 'compute', 'a', 'classically', 'intractable', 'kernel', 'this', 'kernel', 'can', 'be', 'fed', 'into', 'any', 'classical', 'kernel', 'method', 'such', 'as', 'a', 'support', 'vector', 'machine', 'in', 'the', 'second', 'approach', 'we', 'can', 'use', 'a', 'variational', 'quantum', 'circuit', 'as', 'a', 'linear', 'model', 'that', 'classifies', 'data', 'explicitly', 'in', 'hilbert', 'space', 'we', 'illustrate', 'these', 'ideas', 'with', 'a', 'feature', 'map', 'based', 'on', 'squeezing', 'in', 'a', 'continuousvariable', 'system', 'and', 'visualise', 'the', 'working', 'principle', 'with', '2dimensional', 'minibenchmark', 'datasets']]
|
[-0.06787009238897958, 0.0794230592219977, -0.13209091711298807, 0.0787967385386633, -0.08181124302822558, -0.16186202806296116, 0.05419221516626384, 0.37399613157532274, -0.32212640817232313, -0.24963358631556765, 0.09114589242832387, -0.22289945507785655, -0.21304242227059655, 0.26216845229307917, -0.08207537234078514, 0.12822678793759587, 0.08804373560911592, 0.03320058589965543, -0.08866047382947397, -0.2547470961683704, 0.34895123504998693, 0.021959357414977315, 0.27775665981440434, -0.0007484132376683746, 0.13310577136023657, -0.0068482252013406415, -0.0075988136935371525, -0.025083985772945065, -0.09904074160139205, 0.1862647997860966, 0.32194948344825103, 0.17214873765052402, 0.31364477451711414, -0.4125541921027682, -0.22822921939273888, 0.10539192872191655, 0.12602742809184733, 0.15653365222047105, -0.016854240641839564, -0.29170043882540364, 0.04634345068476776, -0.1784767871647874, -0.06678663612527644, -0.1748994489828091, -0.033993662265253896, -0.056741159366951746, -0.23983417922521338, -0.006678398890311227, 0.08136125084438099, 0.03980856319082612, -0.030163406878759597, -0.042196890465631326, 0.07314615632733579, 0.1148587336992835, -0.07046531814289494, 0.048230395363494355, 0.11672130099592362, -0.15450803034958793, -0.19481900515424505, 0.3598813334589495, -0.07881604834680102, -0.22754763345667386, 0.17028147119401213, -0.06899548380730305, -0.16639758213572603, 0.036355102579184076, 0.2315289558454312, 0.08618233871352386, -0.12867661569277472, 0.11669580217881656, -0.04914243021770754, 0.15418520191295898, -0.0038359563182641, 0.03341400826332423, 0.17364250081666013, 0.17221494745351076, 0.06057666347207711, 0.18758249466050975, -0.08767804170256471, -0.14795455782310687, -0.3094240178199694, -0.23865659413411017, -0.23621859461228478, 0.04258290440078207, -0.08537840269450571, -0.1677103706431341, 0.388023223050616, 0.18842645399714447, 0.24473739041384052, 0.05257067280366424, 0.3242426297980993, 0.098513119727657, 0.08561768822053219, 0.10058803447985394, 0.17823619185402156, 0.11930673688968872, 0.07653010661967775, -0.1750241669175342, 0.006635405480572804, 0.0786841199571456]
|
1,803.07129
|
Characters for Complex Bundles and their Connections
|
The paper combines several fortunate mini miracles to achieve its two
objectives. These were woven together in a several year's effort to answer a
question raised by Iz Singer a decade ago. Our answer is accessible to the
topologist, to the differential geometer and to the analyst who appreciates the
statement of the Index theorem of Atiyah,Patodi,Singer for manifolds with
boundary. The mini miracles are these: a] The Conner Floyd miracle that complex
bordism tensored over the Todd genus and the Bott miracle that stable complex
vector bundles respectively satisfy the axioms of a generalized homology theory
and of a generalized cohomology theory. b] That these theories, with the
covariant and contravariant geometric representations indicated, stably almost
complex (SAC) manifolds modulo product relations and stable complex bundles,
are not only related by Alexander duality but they are also related by
Pontryagin duality. c] The abstract corollary of b] that stable complex bundles
have a complete system of numerical invariants and that these can be computed
by integrals of chern weil characteristic forms over manifolds with boundary
reduced modulo integers, thanks to the APS Index Theorem. d] The adiabatic
limit argument of the appendix to the last section showing a direct sum
connection on the total space of a riemannian family of Riemannian manifolds
with connection is Chern Simons equivalent in the limit to the Levi Civita
connection of the direct sum metric. This allows the invariants to be described
by the eta invariants of odd SAC manifolds reduced mod integers.
|
math.KT math.AT math.DG math.FA math.OA
|
the paper combines several fortunate mini miracles to achieve its two objectives these were woven together in a several years effort to answer a question raised by iz singer a decade ago our answer is accessible to the topologist to the differential geometer and to the analyst who appreciates the statement of the index theorem of atiyahpatodisinger for manifolds with boundary the mini miracles are these a the conner floyd miracle that complex bordism tensored over the todd genus and the bott miracle that stable complex vector bundles respectively satisfy the axioms of a generalized homology theory and of a generalized cohomology theory b that these theories with the covariant and contravariant geometric representations indicated stably almost complex sac manifolds modulo product relations and stable complex bundles are not only related by alexander duality but they are also related by pontryagin duality c the abstract corollary of b that stable complex bundles have a complete system of numerical invariants and that these can be computed by integrals of chern weil characteristic forms over manifolds with boundary reduced modulo integers thanks to the aps index theorem d the adiabatic limit argument of the appendix to the last section showing a direct sum connection on the total space of a riemannian family of riemannian manifolds with connection is chern simons equivalent in the limit to the levi civita connection of the direct sum metric this allows the invariants to be described by the eta invariants of odd sac manifolds reduced mod integers
|
[['the', 'paper', 'combines', 'several', 'fortunate', 'mini', 'miracles', 'to', 'achieve', 'its', 'two', 'objectives', 'these', 'were', 'woven', 'together', 'in', 'a', 'several', 'years', 'effort', 'to', 'answer', 'a', 'question', 'raised', 'by', 'iz', 'singer', 'a', 'decade', 'ago', 'our', 'answer', 'is', 'accessible', 'to', 'the', 'topologist', 'to', 'the', 'differential', 'geometer', 'and', 'to', 'the', 'analyst', 'who', 'appreciates', 'the', 'statement', 'of', 'the', 'index', 'theorem', 'of', 'atiyahpatodisinger', 'for', 'manifolds', 'with', 'boundary', 'the', 'mini', 'miracles', 'are', 'these', 'a', 'the', 'conner', 'floyd', 'miracle', 'that', 'complex', 'bordism', 'tensored', 'over', 'the', 'todd', 'genus', 'and', 'the', 'bott', 'miracle', 'that', 'stable', 'complex', 'vector', 'bundles', 'respectively', 'satisfy', 'the', 'axioms', 'of', 'a', 'generalized', 'homology', 'theory', 'and', 'of', 'a', 'generalized', 'cohomology', 'theory', 'b', 'that', 'these', 'theories', 'with', 'the', 'covariant', 'and', 'contravariant', 'geometric', 'representations', 'indicated', 'stably', 'almost', 'complex', 'sac', 'manifolds', 'modulo', 'product', 'relations', 'and', 'stable', 'complex', 'bundles', 'are', 'not', 'only', 'related', 'by', 'alexander', 'duality', 'but', 'they', 'are', 'also', 'related', 'by', 'pontryagin', 'duality', 'c', 'the', 'abstract', 'corollary', 'of', 'b', 'that', 'stable', 'complex', 'bundles', 'have', 'a', 'complete', 'system', 'of', 'numerical', 'invariants', 'and', 'that', 'these', 'can', 'be', 'computed', 'by', 'integrals', 'of', 'chern', 'weil', 'characteristic', 'forms', 'over', 'manifolds', 'with', 'boundary', 'reduced', 'modulo', 'integers', 'thanks', 'to', 'the', 'aps', 'index', 'theorem', 'd', 'the', 'adiabatic', 'limit', 'argument', 'of', 'the', 'appendix', 'to', 'the', 'last', 'section', 'showing', 'a', 'direct', 'sum', 'connection', 'on', 'the', 'total', 'space', 'of', 'a', 'riemannian', 'family', 'of', 'riemannian', 'manifolds', 'with', 'connection', 'is', 'chern', 'simons', 'equivalent', 'in', 'the', 'limit', 'to', 'the', 'levi', 'civita', 'connection', 'of', 'the', 'direct', 'sum', 'metric', 'this', 'allows', 'the', 'invariants', 'to', 'be', 'described', 'by', 'the', 'eta', 'invariants', 'of', 'odd', 'sac', 'manifolds', 'reduced', 'mod', 'integers']]
|
[-0.19151931343110182, 0.10424579176364511, -0.10423096665087714, 0.09814156159752957, -0.11286678078423543, -0.1798610017778928, 0.010413310879067215, 0.311935599051775, -0.3012784989644216, -0.2894022129868797, 0.09321607541279815, -0.24281137562026112, -0.17848772449553552, 0.1722001530609681, -0.15232767654306079, 0.025713150523907793, 0.0561273436896114, 0.05915070267816833, -0.08858674650181489, -0.3235181276256361, 0.40901643515893643, -0.003410331866083046, 0.18837184411189314, 0.08065748717832233, 0.09700787691100235, -0.01432664684827877, -0.03935905976078836, 0.016614003604288254, -0.14100574435137075, 0.16027015907667488, 0.30621349231815004, 0.06678587368064856, 0.17577211811379287, -0.37526554616701596, -0.14294593319966342, 0.1443705020900666, 0.08162950129943888, -0.032802653577492895, 0.051398308534852145, -0.3018308520115104, 0.12309702672046773, -0.1597438730153603, -0.14771245522836007, -0.10933237202581482, 0.06126230282252692, -0.019425728115913306, -0.1992659439551588, 0.004010809994892715, 0.09885234380492484, 0.0934667724379185, -0.06734630431634857, -0.08639575935241928, -0.07122275645350926, 0.06138251558784021, 0.04845106675426529, 0.051290080970504796, 0.08603404317870288, -0.06835522539946381, -0.16502937054388733, 0.33567189409427467, -0.06030109589826234, -0.2159273739769516, 0.1242496205911474, -0.1095811185337244, -0.15822498643972788, 0.14640951866141882, 0.06991405335271798, 0.1604417229854842, -0.023044503881150938, 0.14148347261392752, -0.11410138573185223, 0.07711804015955834, 0.13193303483714122, -0.03524287324772781, 0.16666766296488694, 0.039500548431358064, 0.07414497720462412, 0.07934790748605378, 0.034062998951880266, -0.08870383428716397, -0.3229529752235216, -0.23366915369331537, -0.1164690248208143, 0.15947360135658117, -0.0951543262972446, -0.1371529961881942, 0.38659048897548987, 0.036506115795528316, 0.16882244099574875, 0.132357252347255, 0.248447213385976, 0.07878690160426169, 0.06488252134832842, 0.0381741175378007, 0.18833396764093194, 0.25928762124058413, 0.0622832907581642, -0.11214936152848613, -0.04517836854737028, 0.188068459485564]
|
1,803.0713
|
A promise checked is a promise kept: Inspection Testing
|
Occasionally, developers need to ensure that the compiler treats their code
in a specific way that is only visible by inspecting intermediate or final
compilation artifacts. This is particularly common with carefully crafted
compositional libraries, where certain usage patterns are expected to trigger
an intricate sequence of compiler optimizations -- stream fusion is a
well-known example.
The developer of such a library has to manually inspect build artifacts and
check for the expected properties. Because this is too tedious to do often, it
will likely go unnoticed if the property is broken by a change to the library
code, its dependencies or the compiler. The lack of automation has led to
released versions of such libraries breaking their documented promises.
This indicates that there is an unrecognized need for a new testing paradigm,
inspection testing, where the programmer declaratively describes non-functional
properties of an compilation artifact and the compiler checks these properties.
We define inspection testing abstractly, implement it in the context of Haskell
and show that it increases the quality of such libraries.
|
cs.PL
|
occasionally developers need to ensure that the compiler treats their code in a specific way that is only visible by inspecting intermediate or final compilation artifacts this is particularly common with carefully crafted compositional libraries where certain usage patterns are expected to trigger an intricate sequence of compiler optimizations stream fusion is a wellknown example the developer of such a library has to manually inspect build artifacts and check for the expected properties because this is too tedious to do often it will likely go unnoticed if the property is broken by a change to the library code its dependencies or the compiler the lack of automation has led to released versions of such libraries breaking their documented promises this indicates that there is an unrecognized need for a new testing paradigm inspection testing where the programmer declaratively describes nonfunctional properties of an compilation artifact and the compiler checks these properties we define inspection testing abstractly implement it in the context of haskell and show that it increases the quality of such libraries
|
[['occasionally', 'developers', 'need', 'to', 'ensure', 'that', 'the', 'compiler', 'treats', 'their', 'code', 'in', 'a', 'specific', 'way', 'that', 'is', 'only', 'visible', 'by', 'inspecting', 'intermediate', 'or', 'final', 'compilation', 'artifacts', 'this', 'is', 'particularly', 'common', 'with', 'carefully', 'crafted', 'compositional', 'libraries', 'where', 'certain', 'usage', 'patterns', 'are', 'expected', 'to', 'trigger', 'an', 'intricate', 'sequence', 'of', 'compiler', 'optimizations', 'stream', 'fusion', 'is', 'a', 'wellknown', 'example', 'the', 'developer', 'of', 'such', 'a', 'library', 'has', 'to', 'manually', 'inspect', 'build', 'artifacts', 'and', 'check', 'for', 'the', 'expected', 'properties', 'because', 'this', 'is', 'too', 'tedious', 'to', 'do', 'often', 'it', 'will', 'likely', 'go', 'unnoticed', 'if', 'the', 'property', 'is', 'broken', 'by', 'a', 'change', 'to', 'the', 'library', 'code', 'its', 'dependencies', 'or', 'the', 'compiler', 'the', 'lack', 'of', 'automation', 'has', 'led', 'to', 'released', 'versions', 'of', 'such', 'libraries', 'breaking', 'their', 'documented', 'promises', 'this', 'indicates', 'that', 'there', 'is', 'an', 'unrecognized', 'need', 'for', 'a', 'new', 'testing', 'paradigm', 'inspection', 'testing', 'where', 'the', 'programmer', 'declaratively', 'describes', 'nonfunctional', 'properties', 'of', 'an', 'compilation', 'artifact', 'and', 'the', 'compiler', 'checks', 'these', 'properties', 'we', 'define', 'inspection', 'testing', 'abstractly', 'implement', 'it', 'in', 'the', 'context', 'of', 'haskell', 'and', 'show', 'that', 'it', 'increases', 'the', 'quality', 'of', 'such', 'libraries']]
|
[-0.09551392586072745, 0.037747195969868017, -0.09324691208574727, 0.11602038184834935, -0.162782173689907, -0.16228850947348455, 0.06978394655508091, 0.40808407861114926, -0.30744574372952727, -0.37113572034791026, 0.11627436036949255, -0.23290767455931127, -0.12170190701390364, 0.1943465220544089, -0.10918752890284782, 0.05594094737595744, 0.09732824749504404, -0.0008433219018483782, -0.05940602180166382, -0.2478408382645663, 0.27579971930722713, 0.07894576648034887, 0.2618383771285342, 0.0387361881678461, 0.01276843428121869, -0.014103086896757515, -0.05717549585828805, -0.033934358259759885, -0.05145792193482684, 0.08929427294868093, 0.2973111809010623, 0.25752068884304663, 0.32235600245373613, -0.4193037868062885, -0.1420163491934624, 0.05205190743217406, 0.14584306431120003, 0.11113590991253712, -0.06761069564051883, -0.2603248983320129, 0.12903333834044076, -0.20008081983239256, -0.09931245688523968, -0.1339022347089872, 0.012868086782531716, -0.010904358176385305, -0.22648136125812898, -0.060744833365362676, 0.09608963029889789, 0.09609652585699896, 0.020323568761851395, -0.058737581840721684, -0.05998472215047892, 0.17598178749634869, 0.06480780020733014, 0.047761825957696215, 0.1567921561587365, -0.12067609869019058, -0.07775572233502295, 0.41249621135177295, 0.035441509074857186, -0.1604605827459021, 0.23209524519789987, -0.014193148045353807, -0.19441054022761273, 0.09764590135619389, 0.1289847985056708, 0.0723529381150443, -0.1870581128101559, 0.09674634272939218, 0.02655752073176679, 0.2470689848485279, 0.05584313481073084, 0.01507548262052927, 0.2154395041093661, 0.15748741563323432, -0.009012915015037608, 0.17091696820560995, -0.0051718759215894465, -0.03267679792274371, -0.30622942205935694, -0.16166299573587242, -0.12478424952435442, 0.0005985775510269093, -0.027875959229634702, -0.24029066002418992, 0.3578112575661585, 0.18999647670556694, 0.1077281084595345, 0.03355674283186006, 0.34157427630893283, 0.05888361584548596, 0.20410150603385846, 0.09570777204662906, 0.17623632377002799, 0.006103292366656653, 0.11987432881091543, -0.17576189304034445, 0.1603014622034365, 0.006913371131630248]
|
1,803.07131
|
Automated Curriculum Learning by Rewarding Temporally Rare Events
|
Reward shaping allows reinforcement learning (RL) agents to accelerate
learning by receiving additional reward signals. However, these signals can be
difficult to design manually, especially for complex RL tasks. We propose a
simple and general approach that determines the reward of pre-defined events by
their rarity alone. Here events become less rewarding as they are experienced
more often, which encourages the agent to continually explore new types of
events as it learns. The adaptiveness of this reward function results in a form
of automated curriculum learning that does not have to be specified by the
experimenter. We demonstrate that this \emph{Rarity of Events} (RoE) approach
enables the agent to succeed in challenging VizDoom scenarios without access to
the extrinsic reward from the environment. Furthermore, the results demonstrate
that RoE learns a more versatile policy that adapts well to critical changes in
the environment. Rewarding events based on their rarity could help in many
unsolved RL environments that are characterized by sparse extrinsic rewards but
a plethora of known event types.
|
cs.AI
|
reward shaping allows reinforcement learning rl agents to accelerate learning by receiving additional reward signals however these signals can be difficult to design manually especially for complex rl tasks we propose a simple and general approach that determines the reward of predefined events by their rarity alone here events become less rewarding as they are experienced more often which encourages the agent to continually explore new types of events as it learns the adaptiveness of this reward function results in a form of automated curriculum learning that does not have to be specified by the experimenter we demonstrate that this emphrarity of events roe approach enables the agent to succeed in challenging vizdoom scenarios without access to the extrinsic reward from the environment furthermore the results demonstrate that roe learns a more versatile policy that adapts well to critical changes in the environment rewarding events based on their rarity could help in many unsolved rl environments that are characterized by sparse extrinsic rewards but a plethora of known event types
|
[['reward', 'shaping', 'allows', 'reinforcement', 'learning', 'rl', 'agents', 'to', 'accelerate', 'learning', 'by', 'receiving', 'additional', 'reward', 'signals', 'however', 'these', 'signals', 'can', 'be', 'difficult', 'to', 'design', 'manually', 'especially', 'for', 'complex', 'rl', 'tasks', 'we', 'propose', 'a', 'simple', 'and', 'general', 'approach', 'that', 'determines', 'the', 'reward', 'of', 'predefined', 'events', 'by', 'their', 'rarity', 'alone', 'here', 'events', 'become', 'less', 'rewarding', 'as', 'they', 'are', 'experienced', 'more', 'often', 'which', 'encourages', 'the', 'agent', 'to', 'continually', 'explore', 'new', 'types', 'of', 'events', 'as', 'it', 'learns', 'the', 'adaptiveness', 'of', 'this', 'reward', 'function', 'results', 'in', 'a', 'form', 'of', 'automated', 'curriculum', 'learning', 'that', 'does', 'not', 'have', 'to', 'be', 'specified', 'by', 'the', 'experimenter', 'we', 'demonstrate', 'that', 'this', 'emphrarity', 'of', 'events', 'roe', 'approach', 'enables', 'the', 'agent', 'to', 'succeed', 'in', 'challenging', 'vizdoom', 'scenarios', 'without', 'access', 'to', 'the', 'extrinsic', 'reward', 'from', 'the', 'environment', 'furthermore', 'the', 'results', 'demonstrate', 'that', 'roe', 'learns', 'a', 'more', 'versatile', 'policy', 'that', 'adapts', 'well', 'to', 'critical', 'changes', 'in', 'the', 'environment', 'rewarding', 'events', 'based', 'on', 'their', 'rarity', 'could', 'help', 'in', 'many', 'unsolved', 'rl', 'environments', 'that', 'are', 'characterized', 'by', 'sparse', 'extrinsic', 'rewards', 'but', 'a', 'plethora', 'of', 'known', 'event', 'types']]
|
[-0.05515964038686595, 0.08881090453015805, -0.08180106431796882, 0.11588910353485737, -0.19767967615546603, -0.17568526135415896, 0.07907260122441015, 0.490385949479405, -0.2666839161369751, -0.3519819317572921, 0.06318054076066494, -0.22137773295696728, -0.22106294469500082, 0.1935565168004946, -0.1745569928957028, 0.022591332888462136, 0.06665705758013994, 0.042854758026353884, -0.016660889980559562, -0.26061444267073985, 0.3129901640122679, 0.06408717196721297, 0.25145409823555126, -0.01939767938570158, 0.13313588941436724, 0.003969603369684791, -0.006965191627042533, -0.004124905395365634, -0.01876168906922554, 0.11341789167222999, 0.36490193702219903, 0.2241804449014454, 0.38531831676173495, -0.4260465364969341, -0.20616767757858795, 0.130033265309513, 0.13932501108071507, 0.08781228035797928, -0.07303128085810741, -0.34781217768501776, 0.08020183347584404, -0.18135272284154091, -0.039135441490064635, -0.13805088911139402, -0.01638308002685125, 0.008818159209834357, -0.3015249905881841, -0.003551741477829465, 0.08452953730045801, -0.00645163280272184, -0.033270391808153194, -0.06747288884906395, 0.013265137768697722, 0.17903792448121414, 0.06665731589282317, 0.03247716128771033, 0.2119773570200175, -0.19579094875681066, -0.1698583377740131, 0.35677838561362063, 0.013840310234223774, -0.18507707737849133, 0.24008683373837472, -0.09156458464467666, -0.1195280836184217, 0.15055803003990967, 0.2487270004700142, 0.12369185680600665, -0.18823368771674356, 0.0023392174312343392, -0.002424959184260234, 0.15782381866138273, 0.012229267550500099, 0.02356300959825108, 0.18672231035362158, 0.1804447209423948, 0.08616512268884989, 0.09045238343905107, -0.028454569999139603, -0.09825275907535437, -0.20698504877819532, -0.10496512742316318, -0.18478423950796913, 0.03239934733862501, -0.08001751132774754, -0.10961829734822878, 0.3624058582395668, 0.23085323934713323, 0.21379773228941762, 0.0893965624224604, 0.3196052017693336, 0.06436224070587057, 0.10615381144383955, 0.10475336696357417, 0.20951691288886778, -0.024537562749475328, 0.11008824616086466, -0.1893881911648845, 0.20953016685040876, -0.01597819561910259]
|
1,803.07132
|
A Bernstein type theorem for minimal hypersurfaces via Gauss maps
|
Let $M$ be an $n$-dimensional smooth oriented complete embedded minimal
hypersurface in $\mathbb{R}^{n+1}$ with Euclidean volume growth. We show that
if the image under the Gauss map of $M$ avoids some neighborhood of a
half-equator, then $M$ must be an affine hyperplane.
|
math.DG
|
let m be an ndimensional smooth oriented complete embedded minimal hypersurface in mathbbrn1 with euclidean volume growth we show that if the image under the gauss map of m avoids some neighborhood of a halfequator then m must be an affine hyperplane
|
[['let', 'm', 'be', 'an', 'ndimensional', 'smooth', 'oriented', 'complete', 'embedded', 'minimal', 'hypersurface', 'in', 'mathbbrn1', 'with', 'euclidean', 'volume', 'growth', 'we', 'show', 'that', 'if', 'the', 'image', 'under', 'the', 'gauss', 'map', 'of', 'm', 'avoids', 'some', 'neighborhood', 'of', 'a', 'halfequator', 'then', 'm', 'must', 'be', 'an', 'affine', 'hyperplane']]
|
[-0.20345679890909574, 0.07714328406699479, -0.0665803816873671, -0.03824638275191097, -0.07287666444643968, -0.1269259413181827, -0.07215582965532454, 0.3795017133943918, -0.3000557186400018, -0.1767502107498486, 0.12561720077845653, -0.25962577324088026, -0.1345253321682898, 0.16702844245109436, -0.23375195816795274, -0.03513304106664003, 0.06420030272225054, 0.12317282579294066, -0.11612407658135564, -0.32859655128928217, 0.4018259172032519, -0.09131961786074609, 0.15908793414511332, 0.033274570938551844, 0.1534893698819981, 0.009338002742790594, 0.07223523024287892, 0.10848220166886544, -0.2044041406928644, 0.11698813177645206, 0.2440507041244972, 0.15588355891224814, 0.2108069169619007, -0.43083362990036245, -0.19847137399199533, 0.2888493022722442, 0.17393452973706966, -0.08505062559028952, -0.05610651045855952, -0.2624781205795887, 0.1718843231522819, -0.0022502581520778375, -0.21404531450442424, -0.009297063760175483, 0.06617668743540601, -0.034272153536709614, -0.26915929589147974, -0.046475531590148444, 0.11853658632806889, 0.09531052253867794, -0.040282128378748894, -0.053750976374963434, -0.12575133492397825, 0.049286063510652, -0.09588755594521034, 0.21471202839165926, 0.1204719890885782, -0.00462074141676833, -0.04472046555587795, 0.38080484456405406, -0.10244827322298433, -0.338995774571852, 0.04679349923460949, -0.18877054882667413, -0.08324585820934395, 0.1565687487855917, 0.1649607521731679, 0.14754221249916932, -0.0849972777068615, 0.24573998018338278, -0.11612419929446244, 0.1307582394106359, 0.11264068442510396, -0.08752051210485218, 0.20291445177139306, 0.09435776339434995, 0.18995471278250944, 0.13119080622265933, -0.05401709203313037, 0.018376362578171056, -0.4061498406865611, -0.25675717303983686, -0.18315130324534526, 0.21453668271395854, -0.22120776865631342, -0.1839835705780765, 0.2577849894353166, -0.03833745810680273, 0.2743598900326505, 0.11481265909969807, 0.22983353257906147, 0.028004445862479327, 0.0320536747302224, 0.17154144193613674, 0.03942893719564692, 0.12714712317215232, -0.075965263108473, -0.10269795418944119, -0.041173741653016425, 0.1424498430612247]
|
1,803.07133
|
Neural Text Generation: Past, Present and Beyond
|
This paper presents a systematic survey on recent development of neural text
generation models. Specifically, we start from recurrent neural network
language models with the traditional maximum likelihood estimation training
scheme and point out its shortcoming for text generation. We thus introduce the
recently proposed methods for text generation based on reinforcement learning,
re-parametrization tricks and generative adversarial nets (GAN) techniques. We
compare different properties of these models and the corresponding techniques
to handle their common problems such as gradient vanishing and generation
diversity. Finally, we conduct a benchmarking experiment with different types
of neural text generation models on two well-known datasets and discuss the
empirical results along with the aforementioned model properties.
|
cs.CL cs.AI cs.LG
|
this paper presents a systematic survey on recent development of neural text generation models specifically we start from recurrent neural network language models with the traditional maximum likelihood estimation training scheme and point out its shortcoming for text generation we thus introduce the recently proposed methods for text generation based on reinforcement learning reparametrization tricks and generative adversarial nets gan techniques we compare different properties of these models and the corresponding techniques to handle their common problems such as gradient vanishing and generation diversity finally we conduct a benchmarking experiment with different types of neural text generation models on two wellknown datasets and discuss the empirical results along with the aforementioned model properties
|
[['this', 'paper', 'presents', 'a', 'systematic', 'survey', 'on', 'recent', 'development', 'of', 'neural', 'text', 'generation', 'models', 'specifically', 'we', 'start', 'from', 'recurrent', 'neural', 'network', 'language', 'models', 'with', 'the', 'traditional', 'maximum', 'likelihood', 'estimation', 'training', 'scheme', 'and', 'point', 'out', 'its', 'shortcoming', 'for', 'text', 'generation', 'we', 'thus', 'introduce', 'the', 'recently', 'proposed', 'methods', 'for', 'text', 'generation', 'based', 'on', 'reinforcement', 'learning', 'reparametrization', 'tricks', 'and', 'generative', 'adversarial', 'nets', 'gan', 'techniques', 'we', 'compare', 'different', 'properties', 'of', 'these', 'models', 'and', 'the', 'corresponding', 'techniques', 'to', 'handle', 'their', 'common', 'problems', 'such', 'as', 'gradient', 'vanishing', 'and', 'generation', 'diversity', 'finally', 'we', 'conduct', 'a', 'benchmarking', 'experiment', 'with', 'different', 'types', 'of', 'neural', 'text', 'generation', 'models', 'on', 'two', 'wellknown', 'datasets', 'and', 'discuss', 'the', 'empirical', 'results', 'along', 'with', 'the', 'aforementioned', 'model', 'properties']]
|
[-0.018334715342791998, -0.005644541399644078, -0.023790673624757116, 0.09289638848719806, -0.10904957509426548, -0.1652583339647184, 0.04364830670173618, 0.4639811776908098, -0.29664296813028973, -0.30783226693757865, 0.08733285853095286, -0.29293893927922554, -0.23155591495549388, 0.203887310239643, -0.11466364709833489, 0.1328295008480277, 0.13061583697779383, -0.017841485145592452, -0.08831468875627074, -0.28189921642620674, 0.35373372743647974, 0.022698378289299728, 0.3850878405001476, 0.0007080540093964181, 0.14320344791904224, -0.06082241488126131, -0.0610316631619085, -0.035445539030427756, -0.11736631034914635, 0.21013372661174992, 0.2523036673887833, 0.2353254004661818, 0.32967180480142083, -0.43546900809206796, -0.27456769437026396, 0.10228020057444816, 0.11335610711547356, 0.1388859779985294, -0.06936053576903929, -0.3113016573036403, 0.10309158900620795, -0.18167721160761682, 0.017302284064595545, -0.15344228867474383, -0.05493164433380671, 0.04679767772621286, -0.2685958792123762, 0.006153726480505635, 0.10982568279749393, 0.08935520659505794, -0.018756601870867664, -0.13997815231845687, 0.06418933606071942, 0.10702884610561011, 0.06829955633544256, 0.0351222859885115, 0.08309658087400587, -0.1832492052581557, -0.2050071711357337, 0.33112129776746824, -0.08365746091616513, -0.19845786297913287, 0.20993645474792713, 0.03997434082284438, -0.19782972645294744, -0.011183818680671068, 0.2684983366449256, 0.14013919216968054, -0.15474043639409726, 0.005250613000635387, 0.0034874640466991515, 0.1419825098795128, 0.01677823923857866, -0.014513630698258841, 0.19649688320943212, 0.2676838981028877, 0.0025578748179286453, 0.15706152243712768, -0.15659801215469113, -0.10240694215990999, -0.24243726020378054, -0.07607128715917336, -0.14106036858649645, -0.006958662796007321, -0.10070342754682966, -0.1603698307087859, 0.4342218514901637, 0.2704454518945278, 0.19880458008110588, 0.15916620554254118, 0.35736910218529533, 0.042691332868102574, 0.10402367795834037, 0.052303922490373383, 0.15847761044999897, 0.054602887720463025, 0.1590099676339104, -0.14747697717831593, 0.06763279816832196, 0.08870007612215008]
|
1,803.07134
|
Valence and Spin fluctuations in Mn-doped ferroelectric BaTiO3
|
We study Mn substitution for Ti in BaTiO3 with and without compensating
oxygen vacancies using density functional theory (DFT) in combination with
dynamical mean field theory (DMFT). We find strong charge and spin
fluctuations. Without compensating oxygen vacancies, the ground state is found
to be a quantum superposition of two distinct atomic valences, 3d4 and 3d5.
Introducing a compensating oxygen vacancy at a neighboring site reduces both
charge and spin fluctuations due to the reduction of electron hopping from Mn
to its ligands. As a consequence, valence fluctuations are reduced, and is
closely fixed to the high spin 3d5 state. Here we show that inclusion of charge
and spin fluctuations is necessary to obtain an accurate ground state of
transition metal doped ferroelectrics.
|
cond-mat.mtrl-sci cond-mat.str-el
|
we study mn substitution for ti in batio3 with and without compensating oxygen vacancies using density functional theory dft in combination with dynamical mean field theory dmft we find strong charge and spin fluctuations without compensating oxygen vacancies the ground state is found to be a quantum superposition of two distinct atomic valences 3d4 and 3d5 introducing a compensating oxygen vacancy at a neighboring site reduces both charge and spin fluctuations due to the reduction of electron hopping from mn to its ligands as a consequence valence fluctuations are reduced and is closely fixed to the high spin 3d5 state here we show that inclusion of charge and spin fluctuations is necessary to obtain an accurate ground state of transition metal doped ferroelectrics
|
[['we', 'study', 'mn', 'substitution', 'for', 'ti', 'in', 'batio3', 'with', 'and', 'without', 'compensating', 'oxygen', 'vacancies', 'using', 'density', 'functional', 'theory', 'dft', 'in', 'combination', 'with', 'dynamical', 'mean', 'field', 'theory', 'dmft', 'we', 'find', 'strong', 'charge', 'and', 'spin', 'fluctuations', 'without', 'compensating', 'oxygen', 'vacancies', 'the', 'ground', 'state', 'is', 'found', 'to', 'be', 'a', 'quantum', 'superposition', 'of', 'two', 'distinct', 'atomic', 'valences', '3d4', 'and', '3d5', 'introducing', 'a', 'compensating', 'oxygen', 'vacancy', 'at', 'a', 'neighboring', 'site', 'reduces', 'both', 'charge', 'and', 'spin', 'fluctuations', 'due', 'to', 'the', 'reduction', 'of', 'electron', 'hopping', 'from', 'mn', 'to', 'its', 'ligands', 'as', 'a', 'consequence', 'valence', 'fluctuations', 'are', 'reduced', 'and', 'is', 'closely', 'fixed', 'to', 'the', 'high', 'spin', '3d5', 'state', 'here', 'we', 'show', 'that', 'inclusion', 'of', 'charge', 'and', 'spin', 'fluctuations', 'is', 'necessary', 'to', 'obtain', 'an', 'accurate', 'ground', 'state', 'of', 'transition', 'metal', 'doped', 'ferroelectrics']]
|
[-0.11258074550414307, 0.2552769861982168, 0.027038161023032505, 0.05543248032170492, 0.056817090121756605, -0.1467785168130602, 0.109522999455486, 0.4056976268264821, -0.26124457541956825, -0.29731517145031594, -0.03855851942075159, -0.37439173991542035, -0.07768085971853234, 0.049467588665069846, 0.01589645714143185, -0.056702659465845795, -0.03462673939491918, -0.028721257135635468, -0.15433932092973993, -0.18328881738290978, 0.26365838871087605, 0.036770604867904594, 0.30950409056414374, 0.10487102857427444, 0.05231732235676268, 0.041667061043918374, 0.12369724728424496, 0.0667005336059757, -0.11451743961137018, 0.08612806666301699, 0.2571128249278186, -0.07071341419918084, 0.19816507924938712, -0.4975918249295252, -0.20092129084372484, 0.002580531314393975, 0.10142283370657786, 0.2615922431999106, -0.103273858056911, -0.2698967284030788, 0.06804162820392265, -0.16176523401485227, -0.13180683770148857, -0.12777095361484017, -0.01827838638611895, 0.02103389758340791, -0.2944202144304669, 0.12866557533975798, 0.046596242715197626, 0.09682971822870214, -0.14683184872392746, -0.14587395966083297, -0.16415022971199417, 0.06492734996495934, 0.05112277109334927, 0.08790421640742721, 0.1971585437678164, -0.06855429256925495, -0.10194760811234999, 0.34748907225221637, -0.07729257551888837, -0.13330387923018477, 0.15281524520927692, -0.18402943248781034, -0.08487588595750371, 0.17806911398088787, 0.052966653812313226, 0.0992436774748915, -0.12103750304568832, 0.08454338192080367, 0.06767320612774844, 0.23012127502389798, 0.030158765125656274, 0.11412679570219744, 0.23484645717270006, 0.1463595991575621, 0.10951442655168353, 0.1008725630533995, -0.1336874737351285, -0.0817340021078452, -0.1917371663105924, -0.21116662555555454, -0.2242030037029427, 0.08861850874453056, -0.09071162278973119, -0.1938586967686812, 0.3434343507051528, 0.10747475428809601, 0.13495860104751964, -0.09375741697726696, 0.200936878951857, 0.12429408637363827, 0.03124510711513278, -0.00343454033855682, 0.17406251612195095, 0.20953644594041312, 0.060956086334961704, -0.3347889706435636, 0.06486454942240948, 0.05155998389179841]
|
1,803.07135
|
Fast Micron-Scale 3D Printing with a Resonant-Scanning Two-Photon
Microscope
|
3D printing allows rapid fabrication of complex objects from digital designs.
One 3D-printing process, direct laser writing, polymerises a light-sensitive
material by steering a focused laser beam through the shape of the object to be
created. The highest-resolution direct laser writing systems use a femtosecond
laser to effect two-photon polymerisation. The focal (polymerisation) point is
steered over the shape of the desired object with mechanised stages or
galvanometer-controlled mirrors. Here we report a new high-resolution direct
laser writing system that employs a resonant mirror scanner to achieve a
significant increase in printing speed over galvanometer- or piezo-based
methods while maintaining resolution on the order of a micron. This printer is
based on a software modification to a commerically available resonant-scanning
two-photon microscope. We demonstrate the complete process chain from hardware
configuration and control software to the printing of objects of approximately
$400\times 400\times 350\;\mu$m, and validate performance with objective
benchmarks. Released under an open-source license, this work makes micro-scale
3D printing available the large community of two-photon microscope users, and
paves the way toward widespread availability of precision-printed devices.
|
physics.app-ph physics.ins-det physics.optics
|
3d printing allows rapid fabrication of complex objects from digital designs one 3dprinting process direct laser writing polymerises a lightsensitive material by steering a focused laser beam through the shape of the object to be created the highestresolution direct laser writing systems use a femtosecond laser to effect twophoton polymerisation the focal polymerisation point is steered over the shape of the desired object with mechanised stages or galvanometercontrolled mirrors here we report a new highresolution direct laser writing system that employs a resonant mirror scanner to achieve a significant increase in printing speed over galvanometer or piezobased methods while maintaining resolution on the order of a micron this printer is based on a software modification to a commerically available resonantscanning twophoton microscope we demonstrate the complete process chain from hardware configuration and control software to the printing of objects of approximately 400times 400times 350mum and validate performance with objective benchmarks released under an opensource license this work makes microscale 3d printing available the large community of twophoton microscope users and paves the way toward widespread availability of precisionprinted devices
|
[['3d', 'printing', 'allows', 'rapid', 'fabrication', 'of', 'complex', 'objects', 'from', 'digital', 'designs', 'one', '3dprinting', 'process', 'direct', 'laser', 'writing', 'polymerises', 'a', 'lightsensitive', 'material', 'by', 'steering', 'a', 'focused', 'laser', 'beam', 'through', 'the', 'shape', 'of', 'the', 'object', 'to', 'be', 'created', 'the', 'highestresolution', 'direct', 'laser', 'writing', 'systems', 'use', 'a', 'femtosecond', 'laser', 'to', 'effect', 'twophoton', 'polymerisation', 'the', 'focal', 'polymerisation', 'point', 'is', 'steered', 'over', 'the', 'shape', 'of', 'the', 'desired', 'object', 'with', 'mechanised', 'stages', 'or', 'galvanometercontrolled', 'mirrors', 'here', 'we', 'report', 'a', 'new', 'highresolution', 'direct', 'laser', 'writing', 'system', 'that', 'employs', 'a', 'resonant', 'mirror', 'scanner', 'to', 'achieve', 'a', 'significant', 'increase', 'in', 'printing', 'speed', 'over', 'galvanometer', 'or', 'piezobased', 'methods', 'while', 'maintaining', 'resolution', 'on', 'the', 'order', 'of', 'a', 'micron', 'this', 'printer', 'is', 'based', 'on', 'a', 'software', 'modification', 'to', 'a', 'commerically', 'available', 'resonantscanning', 'twophoton', 'microscope', 'we', 'demonstrate', 'the', 'complete', 'process', 'chain', 'from', 'hardware', 'configuration', 'and', 'control', 'software', 'to', 'the', 'printing', 'of', 'objects', 'of', 'approximately', '400times', '400times', '350mum', 'and', 'validate', 'performance', 'with', 'objective', 'benchmarks', 'released', 'under', 'an', 'opensource', 'license', 'this', 'work', 'makes', 'microscale', '3d', 'printing', 'available', 'the', 'large', 'community', 'of', 'twophoton', 'microscope', 'users', 'and', 'paves', 'the', 'way', 'toward', 'widespread', 'availability', 'of', 'precisionprinted', 'devices']]
|
[-0.09372093415626653, 0.06963839405662087, -0.08260073125863049, -0.06496279202781417, -0.09656695088080933, -0.1775831163839324, 0.03347932511531462, 0.4871199364434777, -0.23438814939726468, -0.32396170271915853, 0.06455528804954314, -0.2382199403445803, -0.08786732729018337, 0.26989106281466696, -0.08425313859607357, 0.11517425182388524, 0.1108087131301361, -0.09115820104186288, -0.020372765210074927, -0.17587870900785668, 0.25890500967342384, 0.11432428975088921, 0.326700140517528, 0.03070577474228898, 0.17051821240732673, 0.03425848159111022, -0.007621687551626581, -0.06562170346578411, -0.11410810047178697, 0.14177971444835596, 0.24687655711535775, 0.10958810311586009, 0.2657428964692561, -0.4537657718739413, -0.17972335023967, 0.0023393480909982903, 0.11860991280116787, 0.149996414948847, -0.09922338960856479, -0.31146026072173105, 0.057995596262653264, -0.1817427378772311, -0.11251693713602225, -0.03728496336503993, -0.041187207513311175, 0.022316807942569922, -0.24242300241970258, -0.06247399739834959, 0.0025513760470973618, 0.12901279667858034, -0.003736809713074889, -0.02235646084465108, -0.013143147694517595, 0.11586535144516541, -0.053062409495280766, 0.03934837368483833, 0.2265935972106853, -0.16829633581414388, -0.12297108785028575, 0.4011201275320121, -0.039051979141595174, -0.12195016597559126, 0.18843655608126064, -0.12651427097502838, -0.031618488871767, 0.1963964136091271, 0.17717901274098913, 0.15399977834787587, -0.1667512768470397, 0.007031271459919675, 0.04208794687040193, 0.2821311276627104, 0.14009282772962242, 0.0035458984031110485, 0.21851076146000942, 0.25481406028646264, 0.04099091023443579, 0.18273135894879894, -0.11841798488778212, -0.024784863554260888, -0.22270413159764227, -0.20022474014808592, -0.17614005514382886, 0.05021718625420694, -0.025157773334211993, -0.15353695583136784, 0.36135967953313636, 0.18138722309118496, 0.10910376860905503, -0.015046678576349264, 0.41252918687859025, 0.008306672863899111, 0.12107588927331515, -0.024252193958385487, 0.19284443570720838, 0.05083937414469617, 0.16615705201509973, -0.1817575399602381, 0.04844982490331107, -0.0038901956918827025]
|
1,803.07136
|
Dynamic Natural Language Processing with Recurrence Quantification
Analysis
|
Writing and reading are dynamic processes. As an author composes a text, a
sequence of words is produced. This sequence is one that, the author hopes,
causes a revisitation of certain thoughts and ideas in others. These processes
of composition and revisitation by readers are ordered in time. This means that
text itself can be investigated under the lens of dynamical systems. A common
technique for analyzing the behavior of dynamical systems, known as recurrence
quantification analysis (RQA), can be used as a method for analyzing sequential
structure of text. RQA treats text as a sequential measurement, much like a
time series, and can thus be seen as a kind of dynamic natural language
processing (NLP). The extension has several benefits. Because it is part of a
suite of time series analysis tools, many measures can be extracted in one
common framework. Secondly, the measures have a close relationship with some
commonly used measures from natural language processing. Finally, using
recurrence analysis offers an opportunity expand analysis of text by developing
theoretical descriptions derived from complex dynamic systems. We showcase an
example analysis on 8,000 texts from the Gutenberg Project, compare it to
well-known NLP approaches, and describe an R package (crqanlp) that can be used
in conjunction with R library crqa.
|
cs.CL
|
writing and reading are dynamic processes as an author composes a text a sequence of words is produced this sequence is one that the author hopes causes a revisitation of certain thoughts and ideas in others these processes of composition and revisitation by readers are ordered in time this means that text itself can be investigated under the lens of dynamical systems a common technique for analyzing the behavior of dynamical systems known as recurrence quantification analysis rqa can be used as a method for analyzing sequential structure of text rqa treats text as a sequential measurement much like a time series and can thus be seen as a kind of dynamic natural language processing nlp the extension has several benefits because it is part of a suite of time series analysis tools many measures can be extracted in one common framework secondly the measures have a close relationship with some commonly used measures from natural language processing finally using recurrence analysis offers an opportunity expand analysis of text by developing theoretical descriptions derived from complex dynamic systems we showcase an example analysis on 8000 texts from the gutenberg project compare it to wellknown nlp approaches and describe an r package crqanlp that can be used in conjunction with r library crqa
|
[['writing', 'and', 'reading', 'are', 'dynamic', 'processes', 'as', 'an', 'author', 'composes', 'a', 'text', 'a', 'sequence', 'of', 'words', 'is', 'produced', 'this', 'sequence', 'is', 'one', 'that', 'the', 'author', 'hopes', 'causes', 'a', 'revisitation', 'of', 'certain', 'thoughts', 'and', 'ideas', 'in', 'others', 'these', 'processes', 'of', 'composition', 'and', 'revisitation', 'by', 'readers', 'are', 'ordered', 'in', 'time', 'this', 'means', 'that', 'text', 'itself', 'can', 'be', 'investigated', 'under', 'the', 'lens', 'of', 'dynamical', 'systems', 'a', 'common', 'technique', 'for', 'analyzing', 'the', 'behavior', 'of', 'dynamical', 'systems', 'known', 'as', 'recurrence', 'quantification', 'analysis', 'rqa', 'can', 'be', 'used', 'as', 'a', 'method', 'for', 'analyzing', 'sequential', 'structure', 'of', 'text', 'rqa', 'treats', 'text', 'as', 'a', 'sequential', 'measurement', 'much', 'like', 'a', 'time', 'series', 'and', 'can', 'thus', 'be', 'seen', 'as', 'a', 'kind', 'of', 'dynamic', 'natural', 'language', 'processing', 'nlp', 'the', 'extension', 'has', 'several', 'benefits', 'because', 'it', 'is', 'part', 'of', 'a', 'suite', 'of', 'time', 'series', 'analysis', 'tools', 'many', 'measures', 'can', 'be', 'extracted', 'in', 'one', 'common', 'framework', 'secondly', 'the', 'measures', 'have', 'a', 'close', 'relationship', 'with', 'some', 'commonly', 'used', 'measures', 'from', 'natural', 'language', 'processing', 'finally', 'using', 'recurrence', 'analysis', 'offers', 'an', 'opportunity', 'expand', 'analysis', 'of', 'text', 'by', 'developing', 'theoretical', 'descriptions', 'derived', 'from', 'complex', 'dynamic', 'systems', 'we', 'showcase', 'an', 'example', 'analysis', 'on', '8000', 'texts', 'from', 'the', 'gutenberg', 'project', 'compare', 'it', 'to', 'wellknown', 'nlp', 'approaches', 'and', 'describe', 'an', 'r', 'package', 'crqanlp', 'that', 'can', 'be', 'used', 'in', 'conjunction', 'with', 'r', 'library', 'crqa']]
|
[-0.07518762940834983, 0.03799112787899468, -0.136673210547096, 0.10675958194163014, -0.10311061206551807, -0.12425378107871878, 0.0050350033592044315, 0.3654867586154508, -0.32139834277420104, -0.29885672818719283, 0.13386291984945395, -0.290102356629914, -0.17327845432840827, 0.26478105770910637, -0.05942080536707176, 0.051155016147884674, 0.0817916291816628, 0.05134510381094299, -0.037146252573918, -0.20958305611297207, 0.2794182737053359, 0.03872222937555251, 0.25786577496827706, 0.003393210595091849, 0.059001382563916425, -0.0007744653137197709, -0.08359575220185081, 0.023561631002732647, -0.08626829747822201, 0.12951152186876083, 0.318700383471378, 0.23112078116306267, 0.30750345017306363, -0.38659537102479785, -0.21840980505323593, 0.04729132313265849, 0.1599464940295612, 0.10298226553487692, -0.04076301736726262, -0.29870342904640035, 0.09076326907202999, -0.17769710915670753, -0.05644239000071246, -0.13034636083156118, 0.027217388656255195, 0.035986672643289606, -0.23565699362832726, 0.02343422803758551, 0.09853737195070957, 0.12320201415392036, -0.005699673570445363, -0.08862072416643008, 0.05151367081567575, 0.16551543376518862, 0.045143967407746725, 0.0545413765054355, 0.11709304402639728, -0.08016349024346796, -0.15496034302055764, 0.41598265141389945, -0.07805480635465648, -0.19090525772404895, 0.21316902550771585, -0.061619498740751476, -0.18136318950468047, 0.07046644958574766, 0.1837208546522643, 0.10915319344924843, -0.20410561438465616, 0.05874328067365116, -0.027473963605089916, 0.20832669577821736, 0.08978079375590228, 0.016659687387964455, 0.21751074964551353, 0.20473275768848676, -0.023875833945006784, 0.14341401378900007, -0.02513472718502267, -0.07372146722269178, -0.24185075888121102, -0.1750201610804169, -0.15860569994715681, 0.023788056976351692, -0.07508116498884967, -0.13951400197574523, 0.3798385238654523, 0.16080679844897153, 0.17960110836181242, 0.03508066624304792, 0.288654437315125, 0.09993971985272657, 0.07532977113848932, 0.023307907041956746, 0.10479934778579254, 0.0846787441998579, 0.13886399593058601, -0.11013841545937574, 0.10022632681799973, 0.059302278951039955]
|
1,803.07137
|
2D Hydrogenated graphene-like borophene as a high capacity anode
material for improved Li/Na ion batteries: A first principles study
|
Fast-growing electronics industry and future energy storage needs have
encouraged the design of rechargeable batteries with higher storage capacities,
and longer life times. In this regard, two-dimensional (2D) materials,
specifically boron and carbon nanosheets, have garnered enthusiasm due to their
fascinating electronic, optical, mechanical and chemical properties. Recently,
a hydrogen boride (HB) nanosheet was successfully fabricated showing remarkable
stability and superior physical properties. Motivated by this experimental
study, we used first principle electronic structure calculations to study the
feasibility of this nanosheet to serve as an anode material for Li/Na/Ca/Mg/Al
ion batteries. Most active adsorption sites for single adatoms were evaluated
and next adatoms were gradually inserted into the anode surface accordingly.
The charge transfer, electronic density of sates, storage capacity, structural
stability, open-circuit potential and diffusion energy barriers were explored.
Our theoretical study predicts that HB shows outstanding electrode properties
for Li and Na ion batteries. The intercalation of both Li and Na adatoms into
the HB monolayer can lead to a high identical storage capacity of 1133.8 mAh/g
which is promising compared to the capacities of the traditional anode
materials; such as graphite (372 mAh/g) and TiO2 (200 mAh/g), and other 2D
materials; such as germanene (369 mAh/g), stanene (226 mAh/g), and phosphorene
(432.8 mAh/g) nanosheets. These results may open a new horizon for the design
of rechargeable batteries with higher storage capacitates.
|
physics.app-ph physics.comp-ph
|
fastgrowing electronics industry and future energy storage needs have encouraged the design of rechargeable batteries with higher storage capacities and longer life times in this regard twodimensional 2d materials specifically boron and carbon nanosheets have garnered enthusiasm due to their fascinating electronic optical mechanical and chemical properties recently a hydrogen boride hb nanosheet was successfully fabricated showing remarkable stability and superior physical properties motivated by this experimental study we used first principle electronic structure calculations to study the feasibility of this nanosheet to serve as an anode material for linacamgal ion batteries most active adsorption sites for single adatoms were evaluated and next adatoms were gradually inserted into the anode surface accordingly the charge transfer electronic density of sates storage capacity structural stability opencircuit potential and diffusion energy barriers were explored our theoretical study predicts that hb shows outstanding electrode properties for li and na ion batteries the intercalation of both li and na adatoms into the hb monolayer can lead to a high identical storage capacity of 11338 mahg which is promising compared to the capacities of the traditional anode materials such as graphite 372 mahg and tio2 200 mahg and other 2d materials such as germanene 369 mahg stanene 226 mahg and phosphorene 4328 mahg nanosheets these results may open a new horizon for the design of rechargeable batteries with higher storage capacitates
|
[['fastgrowing', 'electronics', 'industry', 'and', 'future', 'energy', 'storage', 'needs', 'have', 'encouraged', 'the', 'design', 'of', 'rechargeable', 'batteries', 'with', 'higher', 'storage', 'capacities', 'and', 'longer', 'life', 'times', 'in', 'this', 'regard', 'twodimensional', '2d', 'materials', 'specifically', 'boron', 'and', 'carbon', 'nanosheets', 'have', 'garnered', 'enthusiasm', 'due', 'to', 'their', 'fascinating', 'electronic', 'optical', 'mechanical', 'and', 'chemical', 'properties', 'recently', 'a', 'hydrogen', 'boride', 'hb', 'nanosheet', 'was', 'successfully', 'fabricated', 'showing', 'remarkable', 'stability', 'and', 'superior', 'physical', 'properties', 'motivated', 'by', 'this', 'experimental', 'study', 'we', 'used', 'first', 'principle', 'electronic', 'structure', 'calculations', 'to', 'study', 'the', 'feasibility', 'of', 'this', 'nanosheet', 'to', 'serve', 'as', 'an', 'anode', 'material', 'for', 'linacamgal', 'ion', 'batteries', 'most', 'active', 'adsorption', 'sites', 'for', 'single', 'adatoms', 'were', 'evaluated', 'and', 'next', 'adatoms', 'were', 'gradually', 'inserted', 'into', 'the', 'anode', 'surface', 'accordingly', 'the', 'charge', 'transfer', 'electronic', 'density', 'of', 'sates', 'storage', 'capacity', 'structural', 'stability', 'opencircuit', 'potential', 'and', 'diffusion', 'energy', 'barriers', 'were', 'explored', 'our', 'theoretical', 'study', 'predicts', 'that', 'hb', 'shows', 'outstanding', 'electrode', 'properties', 'for', 'li', 'and', 'na', 'ion', 'batteries', 'the', 'intercalation', 'of', 'both', 'li', 'and', 'na', 'adatoms', 'into', 'the', 'hb', 'monolayer', 'can', 'lead', 'to', 'a', 'high', 'identical', 'storage', 'capacity', 'of', '11338', 'mahg', 'which', 'is', 'promising', 'compared', 'to', 'the', 'capacities', 'of', 'the', 'traditional', 'anode', 'materials', 'such', 'as', 'graphite', '372', 'mahg', 'and', 'tio2', '200', 'mahg', 'and', 'other', '2d', 'materials', 'such', 'as', 'germanene', '369', 'mahg', 'stanene', '226', 'mahg', 'and', 'phosphorene', '4328', 'mahg', 'nanosheets', 'these', 'results', 'may', 'open', 'a', 'new', 'horizon', 'for', 'the', 'design', 'of', 'rechargeable', 'batteries', 'with', 'higher', 'storage', 'capacitates']]
|
[-0.08218716235928304, 0.12193878533639176, 0.042535693104994145, -0.044168126635828656, 0.010664456860583139, -0.25384885918273176, 0.1320395291597494, 0.451549131718224, -0.2365653714258856, -0.3293371856482847, 0.03687424242983223, -0.35518266042332036, -0.09228025138066298, 0.18023630512701305, -0.0567519850565365, 0.07933335080010631, 0.042805762079700285, -0.09345032379233459, -0.04953319063869503, -0.23155434371174494, 0.15328069790203241, 0.15477280917564804, 0.3711852424976108, 0.17619677733132674, -0.012307776586991224, -0.08784689566297499, 0.11643116977866486, 0.017377600178377476, -0.17736137764978382, 0.15718174397957782, 0.27825570804366156, -0.040372395765761175, 0.2466426907724604, -0.51691654632163, -0.28091858041249385, 0.004657152672487889, 0.10767186877456793, 0.0906484411177078, -0.1646956284930803, -0.2218324201575552, 0.10597838445464403, -0.17531065015981978, -0.09043482771118032, -0.06078000685486656, 0.02278473955574888, 0.07514680908651541, -0.17848485887679588, 0.022662898375994073, -0.0033055538642409836, 0.06430371426810627, -0.15517298190283474, -0.2318058265246687, -0.13104267717903792, 0.07267113032274589, -0.00969438139892845, -0.03396076699128855, 0.24821191201011789, -0.06689133443574662, -0.07488055729330412, 0.4193462615166854, -0.027817272130248233, -0.043492215344201925, 0.19466756211753883, -0.1057576880394165, -0.06596107417254021, 0.13597824091246621, 0.1295590333817569, 0.08389062106154219, -0.1978879073343442, 0.032594736510749726, 0.053118325149897505, 0.13715003078347898, 0.11485517768155598, 0.113121577337852, 0.23593378024032483, 0.2619531181602996, 0.03248707905234727, 0.12569183583713212, -0.10996691338355523, -0.0036220685473529464, -0.1065050884617737, -0.30670481168230934, -0.17546814797779048, 0.10028673230978023, -0.07457076101295221, -0.1635087682376721, 0.36630429733308595, 0.09889559409890863, 0.11860157510821973, -0.08537097703570677, 0.2286991047608662, 0.01958279601799754, 0.09636620601019674, 0.050064862805852726, 0.2354618775251646, 0.17317234409964596, 0.19585121103153644, -0.2329717446308229, 0.09940558250116951, -0.02685528945354787]
|
1,803.07138
|
Fear Universality and Doubt in Asset price movements
|
We take a look the changes of different asset prices over variable periods,
using both traditional and spectral methods, and discover universality
phenomena which hold (in some cases) across asset classes.
|
q-fin.MF math.SP
|
we take a look the changes of different asset prices over variable periods using both traditional and spectral methods and discover universality phenomena which hold in some cases across asset classes
|
[['we', 'take', 'a', 'look', 'the', 'changes', 'of', 'different', 'asset', 'prices', 'over', 'variable', 'periods', 'using', 'both', 'traditional', 'and', 'spectral', 'methods', 'and', 'discover', 'universality', 'phenomena', 'which', 'hold', 'in', 'some', 'cases', 'across', 'asset', 'classes']]
|
[-0.0718097141493232, 0.07968086313696639, -0.15478727251907148, 0.18729942364077415, -0.0731521470532302, -0.20009186838362966, 0.11608580551711062, 0.43800513344185965, -0.3021545708329687, -0.2606411381444383, 0.15628032271765294, -0.2297163937933698, -0.0982691450645366, 0.24790220148861408, -0.088368724701145, -0.000640804530121386, 0.024316872500123515, -0.06435151731655482, -0.050340110556252544, -0.27993666825275265, 0.2951375738747658, -0.10370906286181943, 0.26715483534480294, -0.01781359038526012, 0.09048555693739364, -0.0029983948934973487, -0.049848298842628154, 0.04798679876617943, -0.1328611174267867, 0.09823370532479114, 0.32483890769071877, 0.09244055198805948, 0.2950678631332853, -0.4180267648846512, -0.273183518539994, 0.18726373331681376, 0.001989257401756702, 0.027902683644976105, 0.06121219141829398, -0.238583090564897, -0.0012916388711141002, -0.19873829938531404, -0.08145210821361791, -0.10458469808462166, 0.034865025971685684, 0.10032816693907784, -0.2575738198694683, 0.05825894006205002, 0.06945514889253725, 0.07992163063177178, -0.08387697067472243, -0.1582812898221516, 0.04792644053457245, 0.22238860645842168, 0.17128595823962842, -0.11422325532522894, 0.13337921480377835, -0.1412782048986804, -0.20153124579378673, 0.39776593765183804, -0.0258347884781899, -0.1315171611044676, 0.2019985955332466, -0.1945815836229632, -0.1819137671902295, 0.09889326869480071, 0.19832594903005707, 0.09258383824940651, -0.13138102992407738, 0.04602368301787083, -0.026609670160518538, 0.15177815413523105, 0.08192546402044114, 0.07921766417641793, 0.22404676726869038, 0.10155681223278085, 0.05431351088543212, 0.09622395612419612, -0.11240005066558238, -0.18064821099922543, -0.259286192996848, -0.14417903900386825, -0.07816083332703959, 0.02075497316376817, -0.16350754197112344, -0.18086571769127924, 0.4901741550814721, 0.20205702452409652, 0.17908242149578948, 0.11867914379916093, 0.18321637112286784, 0.12164148435957971, 0.04961787010993688, 0.1184889153246918, 0.13355778496160411, 0.0017896828151518298, 0.19310064389625745, -0.10283446492206666, 0.15856593543843878, 0.0030548270611513045]
|
1,803.07139
|
English-Catalan Neural Machine Translation in the Biomedical Domain
through the cascade approach
|
This paper describes the methodology followed to build a neural machine
translation system in the biomedical domain for the English-Catalan language
pair. This task can be considered a low-resourced task from the point of view
of the domain and the language pair. To face this task, this paper reports
experiments on a cascade pivot strategy through Spanish for the neural machine
translation using the English-Spanish SCIELO and Spanish-Catalan El Peri\'odico
database. To test the final performance of the system, we have created a new
test data set for English-Catalan in the biomedical domain which is freely
available on request.
|
cs.CL cs.AI
|
this paper describes the methodology followed to build a neural machine translation system in the biomedical domain for the englishcatalan language pair this task can be considered a lowresourced task from the point of view of the domain and the language pair to face this task this paper reports experiments on a cascade pivot strategy through spanish for the neural machine translation using the englishspanish scielo and spanishcatalan el periodico database to test the final performance of the system we have created a new test data set for englishcatalan in the biomedical domain which is freely available on request
|
[['this', 'paper', 'describes', 'the', 'methodology', 'followed', 'to', 'build', 'a', 'neural', 'machine', 'translation', 'system', 'in', 'the', 'biomedical', 'domain', 'for', 'the', 'englishcatalan', 'language', 'pair', 'this', 'task', 'can', 'be', 'considered', 'a', 'lowresourced', 'task', 'from', 'the', 'point', 'of', 'view', 'of', 'the', 'domain', 'and', 'the', 'language', 'pair', 'to', 'face', 'this', 'task', 'this', 'paper', 'reports', 'experiments', 'on', 'a', 'cascade', 'pivot', 'strategy', 'through', 'spanish', 'for', 'the', 'neural', 'machine', 'translation', 'using', 'the', 'englishspanish', 'scielo', 'and', 'spanishcatalan', 'el', 'periodico', 'database', 'to', 'test', 'the', 'final', 'performance', 'of', 'the', 'system', 'we', 'have', 'created', 'a', 'new', 'test', 'data', 'set', 'for', 'englishcatalan', 'in', 'the', 'biomedical', 'domain', 'which', 'is', 'freely', 'available', 'on', 'request']]
|
[-0.06468916751052203, 0.00422935255460049, -0.0738266402634939, 0.012613633526244054, -0.11412050063770852, -0.10923878115258719, 0.07340438653420853, 0.39102043799663844, -0.3008114424779227, -0.3140772512084559, 0.0774893979125313, -0.2725666466904314, -0.1184740954127751, 0.24201546481957562, -0.10162191043951009, 0.09245883678300551, 0.16658887956536522, 0.069498758388095, 0.015320513044532977, -0.2627919936258542, 0.324104399939901, 0.031223018438016115, 0.38683265063323474, 0.02271059442703661, 0.11577187706103646, -0.014110855350123816, -0.037466110504771534, -0.047445620616015635, -0.07208569775776644, 0.18117225294638623, 0.30391186968619494, 0.2422209811298863, 0.30784157226842485, -0.3722132187336683, -0.16027199363237934, 0.07215987302264885, 0.11448525409704369, 0.12798651192018665, -0.03916205457583266, -0.33994741553538727, 0.11380640424689964, -0.18979101830015058, 0.016441380502165932, -0.06871862282094203, 0.00337380301207304, -0.03300637609178298, -0.26120913995086753, -0.020640424773783275, 0.11306107006476898, 0.12541639825427217, -0.030839793930614465, -0.0759276410148136, 0.03853301662510555, 0.1562704273278972, 0.043458433270356374, 0.13434550255340966, 0.12566858387895322, -0.1440984302543496, -0.15810615069686287, 0.4062124537009942, -0.07190325656709702, -0.24184126239024886, 0.20823222005641776, -0.048538056207134535, -0.17455339384216226, 0.022385594601693905, 0.2695997853346757, 0.08439210588112474, -0.22102501252666115, 0.04978182070986613, -0.04018480550301702, 0.211679077446522, 0.0642618393409066, -0.07845199870582865, 0.21595452024209263, 0.28368522993435985, -0.023889550931849763, 0.17048766382504255, -0.10738203348779567, -0.0384827036802706, -0.26669770200785836, -0.17125145193177127, -0.20494253790300143, -0.043679575229945936, -0.0026689475938359176, -0.16243017398213086, 0.4200735385872816, 0.18432405204267094, 0.15804549206636453, 0.06459876612245448, 0.28884707916724056, 0.032162248984279454, 0.07569726762410842, 0.04705406784043206, 0.15018099461020412, -0.05848636802678046, 0.1982755645815479, -0.16434581347643154, 0.04063063726123226, 0.06221606868172162]
|
1,803.0714
|
Visual Psychophysics for Making Face Recognition Algorithms More
Explainable
|
Scientific fields that are interested in faces have developed their own sets
of concepts and procedures for understanding how a target model system (be it a
person or algorithm) perceives a face under varying conditions. In computer
vision, this has largely been in the form of dataset evaluation for recognition
tasks where summary statistics are used to measure progress. While aggregate
performance has continued to improve, understanding individual causes of
failure has been difficult, as it is not always clear why a particular face
fails to be recognized, or why an impostor is recognized by an algorithm.
Importantly, other fields studying vision have addressed this via the use of
visual psychophysics: the controlled manipulation of stimuli and careful study
of the responses they evoke in a model system. In this paper, we suggest that
visual psychophysics is a viable methodology for making face recognition
algorithms more explainable. A comprehensive set of procedures is developed for
assessing face recognition algorithm behavior, which is then deployed over
state-of-the-art convolutional neural networks and more basic, yet still widely
used, shallow and handcrafted feature-based approaches.
|
cs.CV
|
scientific fields that are interested in faces have developed their own sets of concepts and procedures for understanding how a target model system be it a person or algorithm perceives a face under varying conditions in computer vision this has largely been in the form of dataset evaluation for recognition tasks where summary statistics are used to measure progress while aggregate performance has continued to improve understanding individual causes of failure has been difficult as it is not always clear why a particular face fails to be recognized or why an impostor is recognized by an algorithm importantly other fields studying vision have addressed this via the use of visual psychophysics the controlled manipulation of stimuli and careful study of the responses they evoke in a model system in this paper we suggest that visual psychophysics is a viable methodology for making face recognition algorithms more explainable a comprehensive set of procedures is developed for assessing face recognition algorithm behavior which is then deployed over stateoftheart convolutional neural networks and more basic yet still widely used shallow and handcrafted featurebased approaches
|
[['scientific', 'fields', 'that', 'are', 'interested', 'in', 'faces', 'have', 'developed', 'their', 'own', 'sets', 'of', 'concepts', 'and', 'procedures', 'for', 'understanding', 'how', 'a', 'target', 'model', 'system', 'be', 'it', 'a', 'person', 'or', 'algorithm', 'perceives', 'a', 'face', 'under', 'varying', 'conditions', 'in', 'computer', 'vision', 'this', 'has', 'largely', 'been', 'in', 'the', 'form', 'of', 'dataset', 'evaluation', 'for', 'recognition', 'tasks', 'where', 'summary', 'statistics', 'are', 'used', 'to', 'measure', 'progress', 'while', 'aggregate', 'performance', 'has', 'continued', 'to', 'improve', 'understanding', 'individual', 'causes', 'of', 'failure', 'has', 'been', 'difficult', 'as', 'it', 'is', 'not', 'always', 'clear', 'why', 'a', 'particular', 'face', 'fails', 'to', 'be', 'recognized', 'or', 'why', 'an', 'impostor', 'is', 'recognized', 'by', 'an', 'algorithm', 'importantly', 'other', 'fields', 'studying', 'vision', 'have', 'addressed', 'this', 'via', 'the', 'use', 'of', 'visual', 'psychophysics', 'the', 'controlled', 'manipulation', 'of', 'stimuli', 'and', 'careful', 'study', 'of', 'the', 'responses', 'they', 'evoke', 'in', 'a', 'model', 'system', 'in', 'this', 'paper', 'we', 'suggest', 'that', 'visual', 'psychophysics', 'is', 'a', 'viable', 'methodology', 'for', 'making', 'face', 'recognition', 'algorithms', 'more', 'explainable', 'a', 'comprehensive', 'set', 'of', 'procedures', 'is', 'developed', 'for', 'assessing', 'face', 'recognition', 'algorithm', 'behavior', 'which', 'is', 'then', 'deployed', 'over', 'stateoftheart', 'convolutional', 'neural', 'networks', 'and', 'more', 'basic', 'yet', 'still', 'widely', 'used', 'shallow', 'and', 'handcrafted', 'featurebased', 'approaches']]
|
[-0.042706330698202184, 0.012947418985699267, -0.11390378977074314, 0.07270244863759005, -0.10552404825164015, -0.21504358568830798, -0.006443593498622968, 0.4669686934154337, -0.23788271114620566, -0.3080301844638397, 0.11704227025170415, -0.23272481121802033, -0.23768587009878367, 0.2337578489182733, -0.17326303788085176, 0.08342432086896254, 0.11114197897014738, 0.07555358044195983, -0.021055361103570057, -0.2996235298744058, 0.26095157245673156, 0.04401808583501788, 0.32990248329443495, 0.043701132402809345, 0.08644507871554825, -0.04741560342562133, -0.02735776122973316, 0.03126809268659855, -0.06205866045682905, 0.14570394491690639, 0.3291185513982621, 0.23112230637825984, 0.35369279709559714, -0.43328354553993564, -0.23031384180922534, 0.11863060655504547, 0.17686115780289577, 0.10798260879890031, -0.05692232599757221, -0.3100728115262412, 0.09703580415080873, -0.16725051150662382, -0.043702185388078185, -0.14675849595348972, 0.04587889461680341, -0.0452430300464087, -0.2397305640631268, 0.0029249941127487966, 0.08866248413076552, 0.13768659394172675, -0.022018883231955257, -0.09526396573660123, 0.07073973983047704, 0.2070756141065481, 0.05232922555280602, 0.0627464734504092, 0.14854764239090748, -0.22384420175295713, -0.14962177395432139, 0.4145848706457249, 0.003804786627319801, -0.21696679689406895, 0.2252974878785648, -0.05276945315671889, -0.16699555188093274, 0.09697564894163682, 0.21776083674158345, 0.11082498760037227, -0.21331425329145476, 0.01980422903238204, -0.03831124269707097, 0.168128641404582, 0.04481440875164712, -0.005312590268106092, 0.25163207050973746, 0.2581168681715013, 0.020740307711877792, 0.10415277589023761, -0.06322576197183263, -0.046034274162282104, -0.16873498673638257, -0.11024768439569196, -0.17445007737890628, -0.024245878705900878, -0.008533340790990782, -0.15537877601329547, 0.3910785124827567, 0.22723066075113268, 0.16416578260327572, 0.036292096690624664, 0.335847570818144, 0.06069344673339517, 0.10706469928524173, 0.04281526688712736, 0.21537122622361274, 0.030969662222630492, 0.12889660300380804, -0.1385659703171879, 0.15352173181101475, 0.036876816081284486]
|
1,803.07141
|
Quantifying the Contributions of Training Data and Algorithm Logic to
the Performance of Automated Cause-assignment Algorithms for Verbal Autopsy
|
A verbal autopsy (VA) consists of a survey with a relative or close contact
of a person who has recently died. VA surveys are commonly used to infer likely
causes of death for individuals when deaths happen outside of hospitals or
healthcare facilities. Several statistical and algorithmic methods are
available to assign cause of death using VA surveys. Each of these methods
require as inputs some information about the joint distribution of symptoms and
causes. In this note, we examine the generalizability of this symptom-cause
information by comparing different automated coding methods using various
combinations of inputs and evaluation data. VA algorithm performance is
affected by both the specific SCI themselves and the logic of a given
algorithm. Using a variety of performance metrics for all existing VA
algorithms, we demonstrate that in general the adequacy of the information
about the joint distribution between symptoms and cause affects performance at
least as much or more than algorithm logic.
|
stat.AP stat.OT
|
a verbal autopsy va consists of a survey with a relative or close contact of a person who has recently died va surveys are commonly used to infer likely causes of death for individuals when deaths happen outside of hospitals or healthcare facilities several statistical and algorithmic methods are available to assign cause of death using va surveys each of these methods require as inputs some information about the joint distribution of symptoms and causes in this note we examine the generalizability of this symptomcause information by comparing different automated coding methods using various combinations of inputs and evaluation data va algorithm performance is affected by both the specific sci themselves and the logic of a given algorithm using a variety of performance metrics for all existing va algorithms we demonstrate that in general the adequacy of the information about the joint distribution between symptoms and cause affects performance at least as much or more than algorithm logic
|
[['a', 'verbal', 'autopsy', 'va', 'consists', 'of', 'a', 'survey', 'with', 'a', 'relative', 'or', 'close', 'contact', 'of', 'a', 'person', 'who', 'has', 'recently', 'died', 'va', 'surveys', 'are', 'commonly', 'used', 'to', 'infer', 'likely', 'causes', 'of', 'death', 'for', 'individuals', 'when', 'deaths', 'happen', 'outside', 'of', 'hospitals', 'or', 'healthcare', 'facilities', 'several', 'statistical', 'and', 'algorithmic', 'methods', 'are', 'available', 'to', 'assign', 'cause', 'of', 'death', 'using', 'va', 'surveys', 'each', 'of', 'these', 'methods', 'require', 'as', 'inputs', 'some', 'information', 'about', 'the', 'joint', 'distribution', 'of', 'symptoms', 'and', 'causes', 'in', 'this', 'note', 'we', 'examine', 'the', 'generalizability', 'of', 'this', 'symptomcause', 'information', 'by', 'comparing', 'different', 'automated', 'coding', 'methods', 'using', 'various', 'combinations', 'of', 'inputs', 'and', 'evaluation', 'data', 'va', 'algorithm', 'performance', 'is', 'affected', 'by', 'both', 'the', 'specific', 'sci', 'themselves', 'and', 'the', 'logic', 'of', 'a', 'given', 'algorithm', 'using', 'a', 'variety', 'of', 'performance', 'metrics', 'for', 'all', 'existing', 'va', 'algorithms', 'we', 'demonstrate', 'that', 'in', 'general', 'the', 'adequacy', 'of', 'the', 'information', 'about', 'the', 'joint', 'distribution', 'between', 'symptoms', 'and', 'cause', 'affects', 'performance', 'at', 'least', 'as', 'much', 'or', 'more', 'than', 'algorithm', 'logic']]
|
[-0.05716706127459242, 0.02151344634094246, -0.06951242810779601, 0.10280954594513295, -0.10237724454124357, -0.1536835963381039, 0.09387715850292355, 0.38571145303642296, -0.20818406049233334, -0.3317745796339527, 0.1312601842256085, -0.30830519449760674, -0.14801332318657048, 0.20868758984936317, -0.13040208090452632, 0.03545710210136737, 0.10013358481821551, 0.07064754375891322, -0.051819948027218884, -0.28086645960004014, 0.2888889988902126, 0.02348357369636844, 0.28770204409208017, 0.01862995538587688, 0.08282590609349334, 0.010226788619165398, -0.08385068492720699, 0.03528832673884121, -0.08678549212711503, 0.12198519464107646, 0.29265364582626635, 0.25112640712511053, 0.37401532379993396, -0.39512944685971474, -0.18783218087331885, 0.12924763068681358, 0.12161608439704083, 0.11113723422026937, 0.028644103540095004, -0.3247408006372891, 0.07309432168473388, -0.1893932290114225, -0.06248295766295521, -0.06753753302589201, 0.0021868237667972117, 0.07098238710551315, -0.27249785969449075, 0.09109579105594545, 0.02057030159783747, 0.13551584668576147, -0.022375047817873726, -0.13916612585048505, 0.008188303532583081, 0.18818677981791182, 0.07213140855347559, 0.029154314271731978, 0.13202158694458047, -0.16035518222110298, -0.1528994092587263, 0.37670978846823333, -0.014016140837116303, -0.17548356285900069, 0.19790055248649066, -0.09992955598659861, -0.127638123662561, 0.10127599829300692, 0.2017963159930222, 0.08275673092064109, -0.17042988847696836, -0.0271650835857608, 0.024633466046611974, 0.15123195759692543, 0.09843948391521243, 0.029855518227007098, 0.1882904807956901, 0.16999539554973317, 0.01670968450997381, 0.0920979222460727, -0.08308302726786418, -0.0676003009003771, -0.23287650803993842, -0.12247195252021596, -0.13137322019824202, -0.004577545277109951, -0.06615867601215593, -0.1411376293855393, 0.394395240398634, 0.205332417051537, 0.1509049737538288, 0.05007968188684647, 0.3056768411829783, 0.02248479424572437, 0.09688468628628238, 0.09714370438751949, 0.18332653758979914, 0.06539539777626326, 0.07823314319014739, -0.1902903840005113, 0.15879863044128392, -0.017509929364203078]
|
1,803.07142
|
On the optimization of conservation law models at a junction with inflow
and flow distribution controls
|
The paper proposes a general framework to analyze control problems for
conservation law models on a network. Namely we consider a general class of
junction distribution controls and inflow controls and we establish the
compactness in $L^1$ of a class of flux-traces of solutions. We then derive the
existence of solutions for two optimization problems: (I) the maximization of
an integral functional depending on the flux-traces of solutions evaluated at
points of the incoming and outgoing edges; (II) the minimization of the total
variation of the optimal solutions of problem (I). Finally we provide an
equivalent variational formulation of the min-max problem (II) and we discuss
some numerical simulations for a junction with two incoming and two outgoing
edges.
|
math.AP
|
the paper proposes a general framework to analyze control problems for conservation law models on a network namely we consider a general class of junction distribution controls and inflow controls and we establish the compactness in l1 of a class of fluxtraces of solutions we then derive the existence of solutions for two optimization problems i the maximization of an integral functional depending on the fluxtraces of solutions evaluated at points of the incoming and outgoing edges ii the minimization of the total variation of the optimal solutions of problem i finally we provide an equivalent variational formulation of the minmax problem ii and we discuss some numerical simulations for a junction with two incoming and two outgoing edges
|
[['the', 'paper', 'proposes', 'a', 'general', 'framework', 'to', 'analyze', 'control', 'problems', 'for', 'conservation', 'law', 'models', 'on', 'a', 'network', 'namely', 'we', 'consider', 'a', 'general', 'class', 'of', 'junction', 'distribution', 'controls', 'and', 'inflow', 'controls', 'and', 'we', 'establish', 'the', 'compactness', 'in', 'l1', 'of', 'a', 'class', 'of', 'fluxtraces', 'of', 'solutions', 'we', 'then', 'derive', 'the', 'existence', 'of', 'solutions', 'for', 'two', 'optimization', 'problems', 'i', 'the', 'maximization', 'of', 'an', 'integral', 'functional', 'depending', 'on', 'the', 'fluxtraces', 'of', 'solutions', 'evaluated', 'at', 'points', 'of', 'the', 'incoming', 'and', 'outgoing', 'edges', 'ii', 'the', 'minimization', 'of', 'the', 'total', 'variation', 'of', 'the', 'optimal', 'solutions', 'of', 'problem', 'i', 'finally', 'we', 'provide', 'an', 'equivalent', 'variational', 'formulation', 'of', 'the', 'minmax', 'problem', 'ii', 'and', 'we', 'discuss', 'some', 'numerical', 'simulations', 'for', 'a', 'junction', 'with', 'two', 'incoming', 'and', 'two', 'outgoing', 'edges']]
|
[-0.16982683515510497, -0.005349000225104312, -0.05250590372209748, 0.07547280179639147, -0.058244383981467314, -0.13949251513625693, 0.05892848939949281, 0.33398985561843103, -0.2884257924524096, -0.3026279206546899, 0.12283973497215213, -0.2968318900212837, -0.13958632545227295, 0.13835556577676192, -0.05287900435117384, 0.06986984862890254, 0.060135697098210074, 0.0143016715572339, -0.09968762760026714, -0.18890104614572328, 0.39299891506616247, -0.03965003357038029, 0.2637901423323868, 0.07653157105350979, 0.17147730368101954, 0.014288615171686133, -0.006542817494457859, 0.060937942629560635, -0.19330224091123438, 0.15812475367799464, 0.1857989471873458, 0.16717023812393603, 0.3159665706981387, -0.4600005799697505, -0.178753408889931, 0.10939084198803474, 0.1269365983067924, 0.0864896838290569, -0.0370665365515643, -0.22222971918586737, 0.10015141121987413, -0.11912580525391123, -0.11779914249498875, -0.007267727635991879, 9.421403639209576e-05, 0.0846480297195351, -0.32375958974226415, 0.04885761271047796, 0.025260186650686793, 0.0015838322046602892, -0.16041911788619098, -0.08372564036220026, 0.02392398633966302, 0.07985144064853239, 0.07161749170547844, -0.047517645666296154, 0.06184395140387181, -0.15113987727886719, -0.119820866574589, 0.34634678167665106, -0.04524606314505665, -0.24488832967148888, 0.152481452235554, -0.06072875785514012, -0.12432452800890638, 0.07955651704229924, 0.20214518531659442, 0.19594296506282916, -0.158701973903574, 0.06708635141203403, -0.06161925884393545, 0.09447525560250904, 0.045625556013586685, 0.0129064249051894, 0.14534348195506275, 0.14489779840263292, 0.17167896735601318, 0.19027705416759938, -0.10453672503304277, -0.10875386973190257, -0.3750467705540359, -0.17650485190793744, -0.1483452992243135, 0.03862239433548007, -0.10966462625574189, -0.16716451454573336, 0.438297079064143, 0.13186413817242998, 0.18675001642197117, 0.10537095219852069, 0.24720872679136247, 0.18678868760983658, -0.03538773275720768, 0.11040273046869244, 0.21400183571913503, 0.11850437895657542, 0.08165858357221398, -0.24793261520238194, 0.02828801369979086, 0.09735209553733341]
|
1,803.07143
|
Communication reduction in distributed optimization via estimation of
the proximal operator
|
We introduce a reduced-communication distributed optimization scheme based on
estimating the solution to a proximal minimization problem. Our proposed setup
involves a group of agents coordinated by a central entity, altogether
operating in a collaborative framework. The agents solve proximal minimization
problems that are hidden from the central coordinator. The scheme enables the
coordinator to construct a convex set within which the agents' optimizers
reside, and to iteratively refine the set every time that an agent is queried.
We analyze the quality of the constructed sets by showing their connections to
the {\epsilon}-subdifferential of a convex function and characterize their
size. We prove convergence results related to the solution of such distributed
optimization problems and we devise a communication criterion that embeds the
proposed scheme in the Alternating Direction Method of Multipliers (ADMM). The
developed scheme demonstrates significant communication reduction when applied
to a microgrid setting.
|
math.OC
|
we introduce a reducedcommunication distributed optimization scheme based on estimating the solution to a proximal minimization problem our proposed setup involves a group of agents coordinated by a central entity altogether operating in a collaborative framework the agents solve proximal minimization problems that are hidden from the central coordinator the scheme enables the coordinator to construct a convex set within which the agents optimizers reside and to iteratively refine the set every time that an agent is queried we analyze the quality of the constructed sets by showing their connections to the epsilonsubdifferential of a convex function and characterize their size we prove convergence results related to the solution of such distributed optimization problems and we devise a communication criterion that embeds the proposed scheme in the alternating direction method of multipliers admm the developed scheme demonstrates significant communication reduction when applied to a microgrid setting
|
[['we', 'introduce', 'a', 'reducedcommunication', 'distributed', 'optimization', 'scheme', 'based', 'on', 'estimating', 'the', 'solution', 'to', 'a', 'proximal', 'minimization', 'problem', 'our', 'proposed', 'setup', 'involves', 'a', 'group', 'of', 'agents', 'coordinated', 'by', 'a', 'central', 'entity', 'altogether', 'operating', 'in', 'a', 'collaborative', 'framework', 'the', 'agents', 'solve', 'proximal', 'minimization', 'problems', 'that', 'are', 'hidden', 'from', 'the', 'central', 'coordinator', 'the', 'scheme', 'enables', 'the', 'coordinator', 'to', 'construct', 'a', 'convex', 'set', 'within', 'which', 'the', 'agents', 'optimizers', 'reside', 'and', 'to', 'iteratively', 'refine', 'the', 'set', 'every', 'time', 'that', 'an', 'agent', 'is', 'queried', 'we', 'analyze', 'the', 'quality', 'of', 'the', 'constructed', 'sets', 'by', 'showing', 'their', 'connections', 'to', 'the', 'epsilonsubdifferential', 'of', 'a', 'convex', 'function', 'and', 'characterize', 'their', 'size', 'we', 'prove', 'convergence', 'results', 'related', 'to', 'the', 'solution', 'of', 'such', 'distributed', 'optimization', 'problems', 'and', 'we', 'devise', 'a', 'communication', 'criterion', 'that', 'embeds', 'the', 'proposed', 'scheme', 'in', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'the', 'developed', 'scheme', 'demonstrates', 'significant', 'communication', 'reduction', 'when', 'applied', 'to', 'a', 'microgrid', 'setting']]
|
[-0.15235265052841238, -0.04187486755153855, -0.09534753733796292, 0.039408382237888874, -0.07789814678695181, -0.1662992842591785, 0.11861280525295899, 0.40602287236472656, -0.3450805756552466, -0.27689358952680027, 0.10324692943069184, -0.22871651199871096, -0.15547687644138933, 0.1562268152383381, -0.133553541739118, 0.06343324116013688, 0.06964709487069269, 0.013671217486262321, -0.054935957640730615, -0.28535508404100507, 0.2760087428999872, 0.002207138273736526, 0.2874346733285949, 0.00784208716434258, 0.17280004128872956, 0.0379419188689569, -0.004474535125211395, 0.04088385486654166, -0.06874388878084198, 0.18703850918080145, 0.3029405768061506, 0.20003888932827474, 0.3957149714552637, -0.40691133097259746, -0.1678558214021654, 0.13600824076425413, 0.13947008548561354, 0.07209769769908925, -0.07092656114315293, -0.2703890647305625, 0.11180140084490695, -0.16627313750956593, -0.08321299068429025, -0.07317624654026766, -0.08632469588152036, 0.04450556020541438, -0.33872305253071006, -0.00670125868315969, 0.03219751053297057, -0.007069014354833755, -0.1020073941812433, -0.05916538340248296, 0.04726366724272997, 0.10164772193850789, 0.031826909032553946, 0.04817585449922701, 0.16176775127352247, -0.046311647244247384, -0.1676208736182287, 0.3664345854058348, 0.00041328662894023904, -0.2389757774095854, 0.15990012995417005, -0.0264891195913841, -0.14270757219015523, 0.10619754227649035, 0.2250181691110905, 0.17830598336034295, -0.1727170796604257, 0.07175513864535003, -0.08252247622043922, 0.16054192724605573, 0.00499089650873994, -0.03394954147074243, 0.10347450566638647, 0.17322172566060104, 0.2209108373407146, 0.1699883974572756, -0.03881316515135354, -0.12378441468924926, -0.27145458254401156, -0.13768197463118825, -0.20340568668626505, -0.04384900149086426, -0.11000582569023867, -0.12916774722137328, 0.400366538978515, 0.16156074734854287, 0.1730508005631895, 0.10001380231054821, 0.31097115388718144, 0.09290570213624019, 0.08158216694377941, 0.15269029478638851, 0.18389258236736702, 0.09883953633653964, 0.08051791481095655, -0.25132607400601986, 0.05818305362722483, 0.14809381556376044]
|
1,803.07144
|
Synthesis and Characterization of Copper Doped Zinc Oxide Thin Films for
CO Gas Sensing
|
Objective of this work was to synthesize Copper doped Zinc Oxide (CZO) films
and optimization of process parameters by varying molarity of zinc acetate
dehydrate from 0.5 M to 1.0 M, concentration of copper acetate monohydrate from
1% to 5 % and annealing temperature from 200 C to 300 C to measure the
sensitivity of CZO films for CO (Carbon Monoxide) gas. The concentration of CO
gas was maintained at 5 ppm and operating temperature of 250 oC was used for
sensing. Analysis for sensitivity showed highest grading for parametric
combination of 0.75 molarity, 3% copper concentration and 300 C annealing
temperature with surface roughness of 3.90 nm and grain size of 256 nm. TEM
image revealed the crystalline grain size was 5 nm. ANOVA showed that annealing
temperature influenced the sensitivity by 69.06 % .
|
physics.app-ph cond-mat.mtrl-sci
|
objective of this work was to synthesize copper doped zinc oxide czo films and optimization of process parameters by varying molarity of zinc acetate dehydrate from 05 m to 10 m concentration of copper acetate monohydrate from 1 to 5 and annealing temperature from 200 c to 300 c to measure the sensitivity of czo films for co carbon monoxide gas the concentration of co gas was maintained at 5 ppm and operating temperature of 250 oc was used for sensing analysis for sensitivity showed highest grading for parametric combination of 075 molarity 3 copper concentration and 300 c annealing temperature with surface roughness of 390 nm and grain size of 256 nm tem image revealed the crystalline grain size was 5 nm anova showed that annealing temperature influenced the sensitivity by 6906
|
[['objective', 'of', 'this', 'work', 'was', 'to', 'synthesize', 'copper', 'doped', 'zinc', 'oxide', 'czo', 'films', 'and', 'optimization', 'of', 'process', 'parameters', 'by', 'varying', 'molarity', 'of', 'zinc', 'acetate', 'dehydrate', 'from', '05', 'm', 'to', '10', 'm', 'concentration', 'of', 'copper', 'acetate', 'monohydrate', 'from', '1', 'to', '5', 'and', 'annealing', 'temperature', 'from', '200', 'c', 'to', '300', 'c', 'to', 'measure', 'the', 'sensitivity', 'of', 'czo', 'films', 'for', 'co', 'carbon', 'monoxide', 'gas', 'the', 'concentration', 'of', 'co', 'gas', 'was', 'maintained', 'at', '5', 'ppm', 'and', 'operating', 'temperature', 'of', '250', 'oc', 'was', 'used', 'for', 'sensing', 'analysis', 'for', 'sensitivity', 'showed', 'highest', 'grading', 'for', 'parametric', 'combination', 'of', '075', 'molarity', '3', 'copper', 'concentration', 'and', '300', 'c', 'annealing', 'temperature', 'with', 'surface', 'roughness', 'of', '390', 'nm', 'and', 'grain', 'size', 'of', '256', 'nm', 'tem', 'image', 'revealed', 'the', 'crystalline', 'grain', 'size', 'was', '5', 'nm', 'anova', 'showed', 'that', 'annealing', 'temperature', 'influenced', 'the', 'sensitivity', 'by', '6906']]
|
[-0.004885796444741021, 0.19545910177597156, 0.01960385009067867, -0.08190663951436915, 0.08867025074097469, -0.18171695216248432, 0.11043158904508207, 0.4610848801605629, -0.2301950046164689, -0.4082408396661225, 0.06945283961425902, -0.33628347923866275, 0.019227840249765326, 0.1730231905151441, -0.00708018200891798, 0.05400270469324438, -0.04917365091739956, -0.11525266596370122, -0.08343810423552482, -0.2647145922740244, 0.18055995279626752, 0.10016636517001175, 0.3019819779138109, 0.09974290195686715, 0.04108637548095871, -0.06795857788529247, 0.08546187684899478, -0.030982873487201603, -0.20948750124019475, 0.04906209490515969, 0.24775498190358508, -0.026216443596323104, 0.17781658831870917, -0.3839665504214777, -0.19478775305447704, -0.032382693656748444, 0.08587771850271207, 0.029511862547334396, -0.06301546340568387, -0.1914484208964771, 0.12254500642346543, -0.0615215968961517, -0.13623566668000864, 0.0435748460797847, 0.04416382784433098, -0.005785111824727871, -0.2655730162761315, 0.09137834477323023, 0.02384009010645307, 0.2057094242367329, -0.10782035240536612, -0.2636948033098385, -0.1395754733045275, -0.0017682667609981515, -0.02351821789003831, 0.07688674145857945, 0.32197074703589984, 0.00753706173131694, 0.005547480216729596, 0.3095545393241054, -0.11480523236660344, 0.017673186315788014, 0.1927910763205904, -0.16797242620536548, -0.026796424955495186, 0.27498047290877864, 0.08731333450696459, 0.11097894361768285, -0.1783032495401461, 0.036924848519530235, 0.05850754316656314, 0.3307130882749334, 0.21255614038443926, -0.02345625208831872, 0.16107556100222142, 0.23583508203878548, -0.005341266867507136, 0.13537425525084307, -0.21765279002614657, 0.05903358023373805, -0.12110550922983693, -0.2428790490975547, -0.15952969468057607, 0.10554282864552189, -0.15845555356634466, -0.13738006531176242, 0.3138406979004768, 0.1148623159846686, 0.1460061662364751, -0.03002107222423409, 0.1606777913402766, -0.021486339041130675, 0.08373432147147303, -0.013822134485411825, 0.19796680911641681, 0.20186683490773608, 0.14953021631068128, -0.2582893231336846, 0.11521665543092019, -0.03867132996939207]
|
1,803.07145
|
Discovery of a Very Large (~20 kpc) Galaxy at z=3.72
|
We report the discovery and spectroscopic confirmation of a very large
star-forming Lyman Break galaxy, G6025, at z_spec=3.721+/-0.003. In the
rest-frame ~2100A, G6025 subtends ~24 kpc in physical extent when measured from
the 1.5-sigma isophote, in agreement with the parametric size measurements
which yield the half-light radius of 4.9+/-0.5 kpc and the semi-major axis of
12.5+/-0.1 kpc. G6025 is also very UV-luminous (~5L*(z~4}) and young (~140+/-60
Myr). Despite its unusual size and luminosity, the stellar population
parameters and dust reddening (M_star~M*(z~4)$, and E(B-V)=0.18+/-0.05)
estimated from the integrated light, are similar to those of smaller galaxies
at comparable redshifts. The ground-based morphology and spectroscopy show two
dominant components, both located off-center, embedded in more diffuse
emission. We speculate that G6025 may be a scaled-up version of chain galaxies
seen in deep HST imaging, or alternatively, a nearly equal-mass merger
involving two super-L* galaxies in its early stage. G6025 lies close to but not
within a known massive protocluster at z=3.78. We find four companions within 6
Mpc from G6025, two of which lie within 1.6 Mpc. While the limited sensitivity
of the existing spectroscopy does not allow us to robustly characterize the
local environment of G6025, it likely resides in a locally overdense
environment. The luminosity, size, and youth of G6025 make it uniquely suited
to study the early formation of massive galaxies in the universe.
|
astro-ph.GA
|
we report the discovery and spectroscopic confirmation of a very large starforming lyman break galaxy g6025 at z_spec37210003 in the restframe 2100a g6025 subtends 24 kpc in physical extent when measured from the 15sigma isophote in agreement with the parametric size measurements which yield the halflight radius of 4905 kpc and the semimajor axis of 12501 kpc g6025 is also very uvluminous 5lz4 and young 14060 myr despite its unusual size and luminosity the stellar population parameters and dust reddening m_starmz4 and ebv018005 estimated from the integrated light are similar to those of smaller galaxies at comparable redshifts the groundbased morphology and spectroscopy show two dominant components both located offcenter embedded in more diffuse emission we speculate that g6025 may be a scaledup version of chain galaxies seen in deep hst imaging or alternatively a nearly equalmass merger involving two superl galaxies in its early stage g6025 lies close to but not within a known massive protocluster at z378 we find four companions within 6 mpc from g6025 two of which lie within 16 mpc while the limited sensitivity of the existing spectroscopy does not allow us to robustly characterize the local environment of g6025 it likely resides in a locally overdense environment the luminosity size and youth of g6025 make it uniquely suited to study the early formation of massive galaxies in the universe
|
[['we', 'report', 'the', 'discovery', 'and', 'spectroscopic', 'confirmation', 'of', 'a', 'very', 'large', 'starforming', 'lyman', 'break', 'galaxy', 'g6025', 'at', 'z_spec37210003', 'in', 'the', 'restframe', '2100a', 'g6025', 'subtends', '24', 'kpc', 'in', 'physical', 'extent', 'when', 'measured', 'from', 'the', '15sigma', 'isophote', 'in', 'agreement', 'with', 'the', 'parametric', 'size', 'measurements', 'which', 'yield', 'the', 'halflight', 'radius', 'of', '4905', 'kpc', 'and', 'the', 'semimajor', 'axis', 'of', '12501', 'kpc', 'g6025', 'is', 'also', 'very', 'uvluminous', '5lz4', 'and', 'young', '14060', 'myr', 'despite', 'its', 'unusual', 'size', 'and', 'luminosity', 'the', 'stellar', 'population', 'parameters', 'and', 'dust', 'reddening', 'm_starmz4', 'and', 'ebv018005', 'estimated', 'from', 'the', 'integrated', 'light', 'are', 'similar', 'to', 'those', 'of', 'smaller', 'galaxies', 'at', 'comparable', 'redshifts', 'the', 'groundbased', 'morphology', 'and', 'spectroscopy', 'show', 'two', 'dominant', 'components', 'both', 'located', 'offcenter', 'embedded', 'in', 'more', 'diffuse', 'emission', 'we', 'speculate', 'that', 'g6025', 'may', 'be', 'a', 'scaledup', 'version', 'of', 'chain', 'galaxies', 'seen', 'in', 'deep', 'hst', 'imaging', 'or', 'alternatively', 'a', 'nearly', 'equalmass', 'merger', 'involving', 'two', 'superl', 'galaxies', 'in', 'its', 'early', 'stage', 'g6025', 'lies', 'close', 'to', 'but', 'not', 'within', 'a', 'known', 'massive', 'protocluster', 'at', 'z378', 'we', 'find', 'four', 'companions', 'within', '6', 'mpc', 'from', 'g6025', 'two', 'of', 'which', 'lie', 'within', '16', 'mpc', 'while', 'the', 'limited', 'sensitivity', 'of', 'the', 'existing', 'spectroscopy', 'does', 'not', 'allow', 'us', 'to', 'robustly', 'characterize', 'the', 'local', 'environment', 'of', 'g6025', 'it', 'likely', 'resides', 'in', 'a', 'locally', 'overdense', 'environment', 'the', 'luminosity', 'size', 'and', 'youth', 'of', 'g6025', 'make', 'it', 'uniquely', 'suited', 'to', 'study', 'the', 'early', 'formation', 'of', 'massive', 'galaxies', 'in', 'the', 'universe']]
|
[-0.051188346945406, 0.08697372936956962, -0.07425263483497885, 0.10141649760235066, -0.08785937054400345, -0.08181048768211997, 0.025194237914262552, 0.44692811364745766, -0.13960512552822377, -0.3502704949388581, 0.07274486465285177, -0.27283797357317213, -0.01252204778793049, 0.17969170870358117, -0.017960866436003902, -0.055597631262362106, 0.0658092043549788, -0.0702582607399844, -0.047082223785152734, -0.27132438716461477, 0.259401271452329, 0.07511180026490512, 0.14430123562001826, -0.0409022468219464, 0.0603812303488499, -0.08435875631671416, -0.07131290534073444, -0.029279438763736718, -0.13880699637474322, 0.03597175682066566, 0.26217918155912295, 0.11250219035524583, 0.24259092654607178, -0.3297927439865154, -0.14744107629717565, 0.08288145166647959, 0.24756882871900285, 0.041093934956114, -0.04426440928370878, -0.2805513250024577, 0.0662846786403505, -0.15588515568825026, -0.22442090797156508, 0.12030193408573484, 0.04176798677458192, -0.007583141534252324, -0.1855199237913108, 0.18355374652685807, -0.005338009252118522, 0.09174870203899901, -0.09139144537575578, -0.0881941764752814, -0.07349501765431828, 0.05658968331247744, -0.02466035440933251, 0.0932359255829929, 0.21673491803826206, -0.13956855302290297, -0.0011656839864045245, 0.4059040274828874, -0.03858360457598888, 0.020950217710776806, 0.27798275749117546, -0.2469004016661424, -0.1734855703897946, 0.14199841641799507, 0.16341334560318432, 0.10943962610648593, -0.16393200685964868, 0.007605240173843873, 0.0032064784795672457, 0.256548945373568, 0.038199700302474444, 0.09543920653067611, 0.33752623619726313, 0.11946141787816465, 0.048709897084872736, 0.07352620550894827, -0.22215370476741583, -0.04409201817011916, -0.22987350359374512, -0.0800550492093598, -0.12636051790827396, 0.10887532855004763, -0.16201303100743447, -0.11420703290485291, 0.3105966944208858, 0.14479602942571423, 0.24410703634920483, 0.08547991502296162, 0.26902304024946305, 0.02335121515067509, 0.1822197240163585, 0.14304354183873685, 0.350204130308488, 0.1580653081729596, 0.029896650183302124, -0.21820557366387086, 0.056990439731044014, -0.046022753327793105]
|
1,803.07146
|
Supercongruences for polynomial analogs of the Ap\'ery numbers
|
We consider a family of polynomial analogs of the Ap\'ery numbers, which
includes $q$-analogs of Krattenthaler--Rivoal--Zudilin and Zheng, and show that
the supercongruences that Gessel and Mimura established for the Ap\'ery numbers
generalize to these polynomials. Our proof relies on polynomial analogs of
classical binomial congruences of Wolstenholme and Ljunggren. We further
indicate that this approach generalizes to other supercongruence results.
|
math.NT math.CO
|
we consider a family of polynomial analogs of the apery numbers which includes qanalogs of krattenthalerrivoalzudilin and zheng and show that the supercongruences that gessel and mimura established for the apery numbers generalize to these polynomials our proof relies on polynomial analogs of classical binomial congruences of wolstenholme and ljunggren we further indicate that this approach generalizes to other supercongruence results
|
[['we', 'consider', 'a', 'family', 'of', 'polynomial', 'analogs', 'of', 'the', 'apery', 'numbers', 'which', 'includes', 'qanalogs', 'of', 'krattenthalerrivoalzudilin', 'and', 'zheng', 'and', 'show', 'that', 'the', 'supercongruences', 'that', 'gessel', 'and', 'mimura', 'established', 'for', 'the', 'apery', 'numbers', 'generalize', 'to', 'these', 'polynomials', 'our', 'proof', 'relies', 'on', 'polynomial', 'analogs', 'of', 'classical', 'binomial', 'congruences', 'of', 'wolstenholme', 'and', 'ljunggren', 'we', 'further', 'indicate', 'that', 'this', 'approach', 'generalizes', 'to', 'other', 'supercongruence', 'results']]
|
[-0.16038470330337684, 0.027006958308629692, -0.11665178937837481, 0.10163655228874026, -0.11535314414650202, -0.09766670500393956, 0.03362979665398598, 0.22967853470084568, -0.2906231141261136, -0.26126213270860416, 0.06992448418362376, -0.2659226999928554, -0.2331685827113688, 0.3260127949217955, -0.13667039149440824, 0.055838711540369936, 0.028422477546458443, -0.03099267597620686, -0.038400052363673845, -0.354214467422571, 0.34997197464108465, -0.030695213936269283, 0.18277881199804444, 0.04138833009637892, 0.07490608798495184, 0.014431788479366029, -0.06334622713426749, -0.06272335487107436, -0.19496566735312323, 0.17011196281140048, 0.25410561507257323, 0.13109416930625836, 0.19538232991471888, -0.34630030412226914, -0.09769997437639782, 0.13192252739487836, 0.1315057166541616, 0.021879814508914328, -0.023968522854071733, -0.2541162805321316, 0.12040105963048214, -0.1566179017458732, -0.19457782441750168, -0.12721901411811512, 0.039020232887317735, 0.16385204171140988, -0.32544646120319765, 0.0674294357188046, 0.18735913236935933, 0.09845426646061242, -0.01113192195771262, -0.24132298415061088, 0.054830943525303155, -0.002371877843203644, 0.019973929633852094, -0.06593570488039405, -0.024517557467333972, -0.04878853447832322, -0.2400998269673437, 0.31574074359280835, 0.0018511491672446331, -0.1799331156226496, 0.15269000693224372, -0.18020659446095427, -0.26423123261580866, 0.032585143701483806, 0.07730306624434888, 0.15939950464914243, 0.011773986276239157, 0.0774622073979117, -0.20385292099478344, 0.06105624115249763, 0.21323153314491114, 0.00028891582818080984, 0.07988198320478355, -0.035028569493442775, -0.013351690055181583, 0.2030668657942442, 0.03349584412062541, -0.09575140898426374, -0.2826888101097817, -0.24813418804357448, -0.1848743769340217, 0.09433761144367357, -0.0963522914670951, -0.1630243953395014, 0.3673670947551727, 0.17403186834708323, 0.13917981330305337, 0.20623719578337235, 0.16986305351213862, 0.07595870326622389, 0.01275406342659456, 0.030188093163693943, 0.12054825083663066, 0.22303293691948056, 0.03838426397026827, -0.12473604322876782, 0.005707998566019039, 0.2362060019435982]
|
1,803.07147
|
Fermi theory of beta decay: A first attempt at electroweak unification
|
The purpose of this study, mainly historical and pedagogical, is to
investigate the physical-mathematical similitudes of the spectroscopic and beta
decay Fermi theories. Both theories were formulated using quantum perturbative
theory that allowed obtaining equations whose algebraic structure and physical
interpretation suggest that the two phenomena occur according to the same
mechanism. Fermi, therefore, could have guessed well in advance of the times
that the two theories could be unified into a single physical-mathematical
model that led to different results depending on the considered energy. The
electroweak unification found its full realization only in the 1960s within the
Standard Model that, however, is mainly based on a mathematical approach.
Retracing the reasoning made by Fermi facilitates the understanding of the
physical foundations that underlie the unification of the electromagnetic and
weak forces.
|
physics.hist-ph
|
the purpose of this study mainly historical and pedagogical is to investigate the physicalmathematical similitudes of the spectroscopic and beta decay fermi theories both theories were formulated using quantum perturbative theory that allowed obtaining equations whose algebraic structure and physical interpretation suggest that the two phenomena occur according to the same mechanism fermi therefore could have guessed well in advance of the times that the two theories could be unified into a single physicalmathematical model that led to different results depending on the considered energy the electroweak unification found its full realization only in the 1960s within the standard model that however is mainly based on a mathematical approach retracing the reasoning made by fermi facilitates the understanding of the physical foundations that underlie the unification of the electromagnetic and weak forces
|
[['the', 'purpose', 'of', 'this', 'study', 'mainly', 'historical', 'and', 'pedagogical', 'is', 'to', 'investigate', 'the', 'physicalmathematical', 'similitudes', 'of', 'the', 'spectroscopic', 'and', 'beta', 'decay', 'fermi', 'theories', 'both', 'theories', 'were', 'formulated', 'using', 'quantum', 'perturbative', 'theory', 'that', 'allowed', 'obtaining', 'equations', 'whose', 'algebraic', 'structure', 'and', 'physical', 'interpretation', 'suggest', 'that', 'the', 'two', 'phenomena', 'occur', 'according', 'to', 'the', 'same', 'mechanism', 'fermi', 'therefore', 'could', 'have', 'guessed', 'well', 'in', 'advance', 'of', 'the', 'times', 'that', 'the', 'two', 'theories', 'could', 'be', 'unified', 'into', 'a', 'single', 'physicalmathematical', 'model', 'that', 'led', 'to', 'different', 'results', 'depending', 'on', 'the', 'considered', 'energy', 'the', 'electroweak', 'unification', 'found', 'its', 'full', 'realization', 'only', 'in', 'the', '1960s', 'within', 'the', 'standard', 'model', 'that', 'however', 'is', 'mainly', 'based', 'on', 'a', 'mathematical', 'approach', 'retracing', 'the', 'reasoning', 'made', 'by', 'fermi', 'facilitates', 'the', 'understanding', 'of', 'the', 'physical', 'foundations', 'that', 'underlie', 'the', 'unification', 'of', 'the', 'electromagnetic', 'and', 'weak', 'forces']]
|
[-0.10163063693890405, 0.13762297581838953, -0.12067819842857054, 0.1075689714326114, -0.0934451237306789, -0.13749426742662874, 0.04149136380962745, 0.30264063733700436, -0.23911052809633088, -0.3025043807768573, 0.058207872923407136, -0.20764365840957247, -0.15162398829124868, 0.1972169412095382, -0.010389984206113062, 0.022520456677849517, 0.01332810586918089, 0.02774129450236532, -0.08313343321523545, -0.22783245424789406, 0.3140517613854062, 0.07121775305219644, 0.3014041854043943, 0.08020522429212702, 0.08840491597639454, -0.012335277317712704, -0.03876604219708084, 0.006980128266535978, -0.10999457269479701, 0.1325653982736791, 0.21903515110942395, 0.0980361191658162, 0.2495335160003213, -0.47303432967005804, -0.2398620057060863, 0.04112055229559315, 0.12454585250198955, 0.10195797997099969, -0.024553654561962256, -0.3030497913008951, 0.05038992595765387, -0.16244678050420727, -0.11977235652915569, -0.06099931843169598, -0.01567830156295024, -0.01819852245601148, -0.18459773109387959, 0.02697361518000958, 0.05247162269855229, 0.04424596184187315, -0.08527855521551277, -0.10123666655536825, -0.0035893474158718054, 0.11141676232077632, 0.08875714038114177, 0.021191934033677997, 0.11968451413188384, -0.14576764301587405, -0.14957124084960952, 0.43335815552960744, -0.026032027954263896, -0.16470861401952183, 0.20835987662818903, -0.15600056544997531, -0.15699250015049157, 0.09988927482062894, 0.12415999972092157, 0.08606391139046261, -0.16775496464767706, 0.12891033356550685, -0.02571754609975456, 0.14946488889329362, 0.025929403683579894, 0.03968289613751977, 0.266524095349296, 0.15694878582673316, -0.03552396797441003, 0.05994994029011154, -0.031820716064733766, -0.15217847262057616, -0.3438132530586286, -0.13017947731758328, -0.12796143903114804, 0.06533955458629255, -0.039476329972592684, -0.14824779090210513, 0.4001135420773856, 0.16700096443210813, 0.19474350623292566, 0.012825427315846988, 0.24486076577820562, 0.10301473729178366, 0.06454745479718302, 0.0066552738814304275, 0.3022087225690484, 0.11775015252571779, 0.07065896749863344, -0.21197343221689208, 0.06286811035842578, 0.09526590285752194]
|
1,803.07148
|
Optical Receiver with Helicity Dependent Switching of Magnetization
|
In this work, we propose helicity-dependent switching (HDS) of magnetization
of Co/Pt for energy efficient optical receiver. Designing a low power optical
receiver for optical-to-electrical signal conversion has proven to be very
challenging. Current day receivers use a photodiode that produces a
photocurrent in response to input optical signals, and power hungry
trans-impedance amplifiers are required to amplify the small photocurrents.
Here, we propose light helicity induced switching of magnetization to overcome
the requirement of photodiodes and subsequent trans-impedance amplification by
sensing the change in magnetization with a magnetic tunnel junction (MTJ).
Magnetization switching of a thin ferromagnet layer using circularly polarized
laser pulses have recently been demonstrated which shows one-to-one
correspondence between light helicity and the magnetization state. We propose
to utilize this phenomena by using digital input dependent circularly polarized
laser pulses to directly switch the magnetization state of a thin Co/Pt
ferromagnet layer at the receiver. The Co/Pt layer is used as the free layer of
an MTJ, the resistance of which is modified by the laser pulses. With the
one-to-one dependence between input data and output magnetization state, the
MTJ resistance is directly converted to digital output signal. Our device to
circuit level simulation results indicate that, HDS based optical receiver
consumes only 0.124 pJ/bit energy, which is much lower than existing
techniques.
|
physics.app-ph cond-mat.mes-hall cond-mat.mtrl-sci
|
in this work we propose helicitydependent switching hds of magnetization of copt for energy efficient optical receiver designing a low power optical receiver for opticaltoelectrical signal conversion has proven to be very challenging current day receivers use a photodiode that produces a photocurrent in response to input optical signals and power hungry transimpedance amplifiers are required to amplify the small photocurrents here we propose light helicity induced switching of magnetization to overcome the requirement of photodiodes and subsequent transimpedance amplification by sensing the change in magnetization with a magnetic tunnel junction mtj magnetization switching of a thin ferromagnet layer using circularly polarized laser pulses have recently been demonstrated which shows onetoone correspondence between light helicity and the magnetization state we propose to utilize this phenomena by using digital input dependent circularly polarized laser pulses to directly switch the magnetization state of a thin copt ferromagnet layer at the receiver the copt layer is used as the free layer of an mtj the resistance of which is modified by the laser pulses with the onetoone dependence between input data and output magnetization state the mtj resistance is directly converted to digital output signal our device to circuit level simulation results indicate that hds based optical receiver consumes only 0124 pjbit energy which is much lower than existing techniques
|
[['in', 'this', 'work', 'we', 'propose', 'helicitydependent', 'switching', 'hds', 'of', 'magnetization', 'of', 'copt', 'for', 'energy', 'efficient', 'optical', 'receiver', 'designing', 'a', 'low', 'power', 'optical', 'receiver', 'for', 'opticaltoelectrical', 'signal', 'conversion', 'has', 'proven', 'to', 'be', 'very', 'challenging', 'current', 'day', 'receivers', 'use', 'a', 'photodiode', 'that', 'produces', 'a', 'photocurrent', 'in', 'response', 'to', 'input', 'optical', 'signals', 'and', 'power', 'hungry', 'transimpedance', 'amplifiers', 'are', 'required', 'to', 'amplify', 'the', 'small', 'photocurrents', 'here', 'we', 'propose', 'light', 'helicity', 'induced', 'switching', 'of', 'magnetization', 'to', 'overcome', 'the', 'requirement', 'of', 'photodiodes', 'and', 'subsequent', 'transimpedance', 'amplification', 'by', 'sensing', 'the', 'change', 'in', 'magnetization', 'with', 'a', 'magnetic', 'tunnel', 'junction', 'mtj', 'magnetization', 'switching', 'of', 'a', 'thin', 'ferromagnet', 'layer', 'using', 'circularly', 'polarized', 'laser', 'pulses', 'have', 'recently', 'been', 'demonstrated', 'which', 'shows', 'onetoone', 'correspondence', 'between', 'light', 'helicity', 'and', 'the', 'magnetization', 'state', 'we', 'propose', 'to', 'utilize', 'this', 'phenomena', 'by', 'using', 'digital', 'input', 'dependent', 'circularly', 'polarized', 'laser', 'pulses', 'to', 'directly', 'switch', 'the', 'magnetization', 'state', 'of', 'a', 'thin', 'copt', 'ferromagnet', 'layer', 'at', 'the', 'receiver', 'the', 'copt', 'layer', 'is', 'used', 'as', 'the', 'free', 'layer', 'of', 'an', 'mtj', 'the', 'resistance', 'of', 'which', 'is', 'modified', 'by', 'the', 'laser', 'pulses', 'with', 'the', 'onetoone', 'dependence', 'between', 'input', 'data', 'and', 'output', 'magnetization', 'state', 'the', 'mtj', 'resistance', 'is', 'directly', 'converted', 'to', 'digital', 'output', 'signal', 'our', 'device', 'to', 'circuit', 'level', 'simulation', 'results', 'indicate', 'that', 'hds', 'based', 'optical', 'receiver', 'consumes', 'only', '0124', 'pjbit', 'energy', 'which', 'is', 'much', 'lower', 'than', 'existing', 'techniques']]
|
[-0.17288423052340884, 0.14849146036706137, -0.04690059455549387, -0.023901977030182694, -0.10297704465292429, -0.20725863549025722, 0.0736580506580869, 0.48490140181086305, -0.2902051383942743, -0.3234881157149917, 0.022469534862181385, -0.2570657297509641, -0.0834939974877331, 0.25740514360668676, -0.02897696233942487, 0.04339009704720658, -0.005093056897413895, -0.07213656163092033, -0.0027670605078099235, -0.16576679983747103, 0.2254571751669942, 0.05749529619241983, 0.3963618990407252, 0.005950921285931828, 0.15667396809418646, -0.019615451073540107, 0.11139380654120552, -0.05301495166849517, -0.06315290978241954, 0.05209592430775101, 0.27497686551291545, -0.030008800264473678, 0.17147187692272017, -0.516628685171291, -0.21055955445385335, 0.0440046973612314, 0.08609828151535019, 0.13197923962011812, -0.08042460731938825, -0.23906713809972535, 0.0832741735739127, -0.13732234646098404, -0.02129080217956106, -0.04570701004173349, -0.033753745060431245, 0.03699734908623046, -0.2949011737726466, 0.01823310195017726, 0.043177492713796034, 0.06629044915874562, -0.00924852563600455, -0.07420867429976459, -0.08243973705218031, 0.0643631956979422, 0.0012397907292341582, 0.08497551785342605, 0.20264980478280906, -0.10829039130784777, -0.11957457111767505, 0.25141146929273683, -0.08107835106469298, -0.11370446379532531, 0.0765463081971755, -0.17540683007403707, -0.009021838693471822, 0.17138302196160576, 0.16894053515424515, 0.10119136809028068, -0.16278146072140626, 0.0030095948418441404, 0.04427632473115187, 0.2639414893338792, 0.10237843234119894, 0.08694553996268917, 0.21853147794101987, 0.21913786152214637, 0.05640707338713796, 0.19806623404839158, -0.18368096454449917, -0.0033216765397206843, -0.19738786794274213, -0.11985392894269684, -0.22167405355743172, 0.10997173022736327, -0.02417698708574249, -0.1249706287168756, 0.4304178009788218, 0.17119819209760717, 0.12033735568450618, -0.0014792353761503645, 0.4151354929183348, 0.1696757460463672, 0.07954296928375514, 0.05072105809411008, 0.2688276492373606, 0.19813958212651725, 0.18388809969507625, -0.255631469217481, 0.08452807986156045, -0.05202625747255054]
|
1,803.07149
|
Fundamental Solutions and Gegenbauer Expansions of Helmholtz Operators
in Riemannian Spaces of Constant Curvature
|
We perform global and local analysis of oscillatory and damped spherically
symmetric fundamental solutions for Helmholtz operators
$\big({-}\Delta\pm\beta^2\big)$ in $d$-dimensional, $R$-radius hyperbolic
${\mathbf H}_R^d$ and hyperspherical ${\mathbf S}_R^d$ geometry, which
represent Riemannian manifolds with positive constant and negative constant
sectional curvature respectively. In particular, we compute closed-form
expressions for fundamental solutions of $\big({-}\Delta \pm \beta^2\big)$ on
${\mathbf H}_R^d$, $\big({-}\Delta+\beta^2\big)$ on ${\mathbf S}_R^d$, and
present two candidate fundamental solutions for $\big({-}\Delta-\beta^2\big)$
on ${\mathbf S}_R^d$. Flat-space limits, with their corresponding asymptotic
representations, are used to restrict proportionality constants for these
fundamental solutions. In order to accomplish this, we summarize and derive new
large degree asymptotics for associated Legendre and Ferrers functions of the
first and second kind. Furthermore, we prove that our fundamental solutions on
the hyperboloid are unique due to their decay at infinity. To derive Gegenbauer
polynomial expansions of our fundamental solutions for Helmholtz operators on
hyperspheres and hyperboloids, we derive a collection of infinite series
addition theorems for Ferrers and associated Legendre functions which are
generalizations and extensions of the addition theorem for Gegenbauer
polynomials. Using these addition theorems, in geodesic polar coordinates for
dimensions greater than or equal to three, we compute Gegenbauer polynomial
expansions for these fundamental solutions, and azimuthal Fourier expansions in
two-dimensions.
|
math.AP math.CA math.DG
|
we perform global and local analysis of oscillatory and damped spherically symmetric fundamental solutions for helmholtz operators bigdeltapmbeta2big in ddimensional rradius hyperbolic mathbf h_rd and hyperspherical mathbf s_rd geometry which represent riemannian manifolds with positive constant and negative constant sectional curvature respectively in particular we compute closedform expressions for fundamental solutions of bigdelta pm beta2big on mathbf h_rd bigdeltabeta2big on mathbf s_rd and present two candidate fundamental solutions for bigdeltabeta2big on mathbf s_rd flatspace limits with their corresponding asymptotic representations are used to restrict proportionality constants for these fundamental solutions in order to accomplish this we summarize and derive new large degree asymptotics for associated legendre and ferrers functions of the first and second kind furthermore we prove that our fundamental solutions on the hyperboloid are unique due to their decay at infinity to derive gegenbauer polynomial expansions of our fundamental solutions for helmholtz operators on hyperspheres and hyperboloids we derive a collection of infinite series addition theorems for ferrers and associated legendre functions which are generalizations and extensions of the addition theorem for gegenbauer polynomials using these addition theorems in geodesic polar coordinates for dimensions greater than or equal to three we compute gegenbauer polynomial expansions for these fundamental solutions and azimuthal fourier expansions in twodimensions
|
[['we', 'perform', 'global', 'and', 'local', 'analysis', 'of', 'oscillatory', 'and', 'damped', 'spherically', 'symmetric', 'fundamental', 'solutions', 'for', 'helmholtz', 'operators', 'bigdeltapmbeta2big', 'in', 'ddimensional', 'rradius', 'hyperbolic', 'mathbf', 'h_rd', 'and', 'hyperspherical', 'mathbf', 's_rd', 'geometry', 'which', 'represent', 'riemannian', 'manifolds', 'with', 'positive', 'constant', 'and', 'negative', 'constant', 'sectional', 'curvature', 'respectively', 'in', 'particular', 'we', 'compute', 'closedform', 'expressions', 'for', 'fundamental', 'solutions', 'of', 'bigdelta', 'pm', 'beta2big', 'on', 'mathbf', 'h_rd', 'bigdeltabeta2big', 'on', 'mathbf', 's_rd', 'and', 'present', 'two', 'candidate', 'fundamental', 'solutions', 'for', 'bigdeltabeta2big', 'on', 'mathbf', 's_rd', 'flatspace', 'limits', 'with', 'their', 'corresponding', 'asymptotic', 'representations', 'are', 'used', 'to', 'restrict', 'proportionality', 'constants', 'for', 'these', 'fundamental', 'solutions', 'in', 'order', 'to', 'accomplish', 'this', 'we', 'summarize', 'and', 'derive', 'new', 'large', 'degree', 'asymptotics', 'for', 'associated', 'legendre', 'and', 'ferrers', 'functions', 'of', 'the', 'first', 'and', 'second', 'kind', 'furthermore', 'we', 'prove', 'that', 'our', 'fundamental', 'solutions', 'on', 'the', 'hyperboloid', 'are', 'unique', 'due', 'to', 'their', 'decay', 'at', 'infinity', 'to', 'derive', 'gegenbauer', 'polynomial', 'expansions', 'of', 'our', 'fundamental', 'solutions', 'for', 'helmholtz', 'operators', 'on', 'hyperspheres', 'and', 'hyperboloids', 'we', 'derive', 'a', 'collection', 'of', 'infinite', 'series', 'addition', 'theorems', 'for', 'ferrers', 'and', 'associated', 'legendre', 'functions', 'which', 'are', 'generalizations', 'and', 'extensions', 'of', 'the', 'addition', 'theorem', 'for', 'gegenbauer', 'polynomials', 'using', 'these', 'addition', 'theorems', 'in', 'geodesic', 'polar', 'coordinates', 'for', 'dimensions', 'greater', 'than', 'or', 'equal', 'to', 'three', 'we', 'compute', 'gegenbauer', 'polynomial', 'expansions', 'for', 'these', 'fundamental', 'solutions', 'and', 'azimuthal', 'fourier', 'expansions', 'in', 'twodimensions']]
|
[-0.13119665891932908, 0.06189643000298879, -0.037370399571955204, 0.06985104862839188, -0.10772754048780347, -0.1411585955491373, -0.017470785234799953, 0.327763087892284, -0.2452989145595029, -0.1879532620153246, 0.1367670736954413, -0.3025098798138585, -0.15278054883736022, 0.20263964987003166, -0.04157890885864472, 0.09182319093254668, -0.00025670658866527364, 0.06243260259466681, -0.12547329652113887, -0.21871541427744934, 0.35773629122483197, -0.05868618331463841, 0.21848282575102254, 0.030535269364140076, 0.1322384044645002, -0.018451048173033516, -0.04177115451247983, -0.05236521091275102, -0.23740502787654466, 0.16249631166884407, 0.24762336314836544, 0.06890484158601844, 0.17557323520275675, -0.42278351077800663, -0.10685852012453388, 0.15971506358267953, 0.21540465496656536, 0.02672403442976876, -0.0096728578030331, -0.25243870220123904, 0.09398439159531109, -0.10445872089075242, -0.2057497906081601, -0.17809400621764548, 0.05782298975570859, 0.0747792031152628, -0.2734669103630035, 0.1011921012037392, 0.06544230629421252, 0.05932518793154156, -0.11487727860262181, -0.16988889961989959, 0.043404799133112924, 0.09335544418928153, 0.04214089928862097, -0.004252940368264061, 0.014051259717723327, -0.07488597527642119, -0.10105158211674949, 0.3657693904986726, -0.07522218447708263, -0.3139762563398687, 0.13162544558684236, -0.19291633740530825, -0.17034809040461682, 0.07138069268936913, 0.21555657335904552, 0.17444619870587108, -0.07885768984569543, 0.14461578802548497, -0.0176777069141801, 0.08151236158304509, 0.19921853216550317, 0.046963284887947994, 0.1492113533768043, -0.008647607355633408, 0.07879277533707928, 0.13535554985983753, -0.006404090718776265, -0.11967206489415237, -0.3593871667262964, -0.1834404889693419, -0.17375317242938274, 0.09290512285481406, -0.20915370940639688, -0.19407682078635663, 0.367299297523328, 0.048639443791031245, 0.14783664459631365, 0.14283435775397985, 0.2271841247427041, 0.1604189824424997, 0.009060070933357103, 0.09577602880603786, 0.17889146203295656, 0.19832440532641996, 0.06781687303932744, -0.15358249124255963, -0.031283310658544006, 0.21032206893815145]
|
1,803.0715
|
A Perturbative Density Matrix Renormalization Group Algorithm for Large
Active Spaces
|
We describe a low cost alternative to the standard variational DMRG (density
matrix renormalization group) algorithm that is analogous to the combination of
selected configuration interaction plus perturbation theory (SCI+PT). We denote
the resulting method p-DMRG (perturbative DMRG) to distinguish it from the
standard variational DMRG. p-DMRG is expected to be useful for systems with
very large active spaces, for which variational DMRG becomes too expensive.
Similar to SCI+PT, in p-DMRG a zeroth-order wavefunction is first obtained by a
standard DMRG calculation, but with a small bond dimension. Then, the residual
correlation is recovered by a second-order perturbative treatment. We discuss
the choice of partitioning for the perturbation theory, which is crucial for
its accuracy and robustness. To circumvent the problem of a large bond
dimension in the first-order wavefunction, we use a sum of matrix product
states (MPS) to expand the first-order wavefunction, yielding substantial
savings in computational cost and memory. We also propose extrapolation schemes
to reduce the errors in the zeroth- and first-order wavefunctions. Numerical
results for Cr 2 with a (28e,76o) active space and 1,3-butadiene with a
(22e,82o) active space reveal that p-DMRG provides ground state energies of a
similar quality to variational DMRG with very large bond dimensions, but at a
significantly lower computational cost. This suggests that p-DMRG will be an
efficient tool for benchmark studies in the future.
|
physics.chem-ph
|
we describe a low cost alternative to the standard variational dmrg density matrix renormalization group algorithm that is analogous to the combination of selected configuration interaction plus perturbation theory scipt we denote the resulting method pdmrg perturbative dmrg to distinguish it from the standard variational dmrg pdmrg is expected to be useful for systems with very large active spaces for which variational dmrg becomes too expensive similar to scipt in pdmrg a zerothorder wavefunction is first obtained by a standard dmrg calculation but with a small bond dimension then the residual correlation is recovered by a secondorder perturbative treatment we discuss the choice of partitioning for the perturbation theory which is crucial for its accuracy and robustness to circumvent the problem of a large bond dimension in the firstorder wavefunction we use a sum of matrix product states mps to expand the firstorder wavefunction yielding substantial savings in computational cost and memory we also propose extrapolation schemes to reduce the errors in the zeroth and firstorder wavefunctions numerical results for cr 2 with a 28e76o active space and 13butadiene with a 22e82o active space reveal that pdmrg provides ground state energies of a similar quality to variational dmrg with very large bond dimensions but at a significantly lower computational cost this suggests that pdmrg will be an efficient tool for benchmark studies in the future
|
[['we', 'describe', 'a', 'low', 'cost', 'alternative', 'to', 'the', 'standard', 'variational', 'dmrg', 'density', 'matrix', 'renormalization', 'group', 'algorithm', 'that', 'is', 'analogous', 'to', 'the', 'combination', 'of', 'selected', 'configuration', 'interaction', 'plus', 'perturbation', 'theory', 'scipt', 'we', 'denote', 'the', 'resulting', 'method', 'pdmrg', 'perturbative', 'dmrg', 'to', 'distinguish', 'it', 'from', 'the', 'standard', 'variational', 'dmrg', 'pdmrg', 'is', 'expected', 'to', 'be', 'useful', 'for', 'systems', 'with', 'very', 'large', 'active', 'spaces', 'for', 'which', 'variational', 'dmrg', 'becomes', 'too', 'expensive', 'similar', 'to', 'scipt', 'in', 'pdmrg', 'a', 'zerothorder', 'wavefunction', 'is', 'first', 'obtained', 'by', 'a', 'standard', 'dmrg', 'calculation', 'but', 'with', 'a', 'small', 'bond', 'dimension', 'then', 'the', 'residual', 'correlation', 'is', 'recovered', 'by', 'a', 'secondorder', 'perturbative', 'treatment', 'we', 'discuss', 'the', 'choice', 'of', 'partitioning', 'for', 'the', 'perturbation', 'theory', 'which', 'is', 'crucial', 'for', 'its', 'accuracy', 'and', 'robustness', 'to', 'circumvent', 'the', 'problem', 'of', 'a', 'large', 'bond', 'dimension', 'in', 'the', 'firstorder', 'wavefunction', 'we', 'use', 'a', 'sum', 'of', 'matrix', 'product', 'states', 'mps', 'to', 'expand', 'the', 'firstorder', 'wavefunction', 'yielding', 'substantial', 'savings', 'in', 'computational', 'cost', 'and', 'memory', 'we', 'also', 'propose', 'extrapolation', 'schemes', 'to', 'reduce', 'the', 'errors', 'in', 'the', 'zeroth', 'and', 'firstorder', 'wavefunctions', 'numerical', 'results', 'for', 'cr', '2', 'with', 'a', '28e76o', 'active', 'space', 'and', '13butadiene', 'with', 'a', '22e82o', 'active', 'space', 'reveal', 'that', 'pdmrg', 'provides', 'ground', 'state', 'energies', 'of', 'a', 'similar', 'quality', 'to', 'variational', 'dmrg', 'with', 'very', 'large', 'bond', 'dimensions', 'but', 'at', 'a', 'significantly', 'lower', 'computational', 'cost', 'this', 'suggests', 'that', 'pdmrg', 'will', 'be', 'an', 'efficient', 'tool', 'for', 'benchmark', 'studies', 'in', 'the', 'future']]
|
[-0.08816330087064593, 0.11573756750251907, -0.10698143113720572, 0.0990414961380252, -0.046469619574564684, -0.12565784644740063, 0.08488455702491711, 0.36596757237592975, -0.2520927860869339, -0.2843441643006257, 0.0870236211526945, -0.25319089134312256, -0.12887362171621883, 0.14321325669017446, -0.012323202982511185, 0.05390633256000791, 0.08334809762601661, 0.012550953450102815, -0.15401260666017172, -0.22497676925351648, 0.2742606321569928, 0.08623406506139296, 0.2674241293405027, 0.050403518355725443, 0.06177461939353951, 0.008306589958413896, 0.015168363838698884, 0.04947765708908363, -0.09115755806999819, 0.15776134373296719, 0.28823898924220714, 0.07754621784122687, 0.2887683340782359, -0.4145714420007702, -0.20630704055366958, 0.05670169480903521, 0.14008032354079525, 0.1680995031287346, -0.034185529682296434, -0.2854333072416147, 0.06459698775268004, -0.23530301780806542, -0.15063109090846724, -0.17460812682736818, -0.01215136608917991, -0.04495661490495692, -0.2960499476083571, 0.0944450059893796, -0.04188912549204661, 0.0074608418837661655, -0.02403217796141459, -0.1316705623439332, 0.017368111607715554, 0.09224170001278467, 0.045859617561974236, 0.07859070319418976, 0.08339987693320774, -0.11530195719065203, -0.08859719000245778, 0.3999951355184567, -0.06125724461346831, -0.20650864322353743, 0.19605831777449376, -0.10461806270348675, -0.16333809908167607, 0.15073254409907766, 0.1405464140645637, 0.10583016728746338, -0.089053591907686, 0.09278726882453506, -0.0006419771892962581, 0.20399378861271147, -0.009695739949931184, 0.008310347891357891, 0.08579814191159636, 0.15540453001785165, 0.12503501179741855, 0.13265196729990827, -0.07299208952897814, -0.12939748129932782, -0.282329000692764, -0.16627609558251782, -0.23074194637329498, 0.042631775237687304, -0.1179705351247132, -0.1841469780727378, 0.36402052671256646, 0.1430180289106216, 0.16715511980538184, 0.08340615768046687, 0.2975930089206852, 0.14529289620005573, 0.0689666192342287, 0.07825480023455886, 0.21749788386709315, 0.1340656081147121, 0.031106962044870828, -0.23926902672052552, 0.024225702762131776, 0.11571673512020532]
|
1,803.07151
|
Highly sensitive electromechanical piezoresistive pressure sensors based
on large-area layered PtSe$_{2}$ films
|
Two-dimensional (2D) layered materials are ideal for micro- and
nanoelectromechanical systems (MEMS/NEMS) due to their ultimate thinness.
Platinum diselenide (PtSe$_{2}$), an exciting and unexplored 2D transition
metal dichalcogenides (TMD) material, is particularly interesting because its
scalable and low temperature growth process is compatible with silicon
technology. Here, we explore the potential of thin PtSe$_{2}$ films as
electromechanical piezoresistive sensors. All experiments have been conducted
with semimetallic PtSe$_{2}$ films grown by thermally assisted conversion of Pt
at a CMOS-compatible temperature of 400{\deg}C. We report high negative gauge
factors of up to -84.8 obtained experimentally from PtSe$_{2}$ strain gauges in
a bending cantilever beam setup. Integrated NEMS piezoresistive pressure
sensors with freestanding PMMA/PtSe$_{2}$ membranes confirm the negative gauge
factor and exhibit very high sensitivity, outperforming previously reported
values by orders of magnitude. We employ density functional theory (DFT)
calculations to understand the origin of the measured negative gauge factor.
Our results suggest PtSe$_{2}$ as a very promising candidate for future NEMS
applications, including integration into CMOS production lines.
|
cond-mat.mtrl-sci cond-mat.mes-hall
|
twodimensional 2d layered materials are ideal for micro and nanoelectromechanical systems memsnems due to their ultimate thinness platinum diselenide ptse_2 an exciting and unexplored 2d transition metal dichalcogenides tmd material is particularly interesting because its scalable and low temperature growth process is compatible with silicon technology here we explore the potential of thin ptse_2 films as electromechanical piezoresistive sensors all experiments have been conducted with semimetallic ptse_2 films grown by thermally assisted conversion of pt at a cmoscompatible temperature of 400degc we report high negative gauge factors of up to 848 obtained experimentally from ptse_2 strain gauges in a bending cantilever beam setup integrated nems piezoresistive pressure sensors with freestanding pmmaptse_2 membranes confirm the negative gauge factor and exhibit very high sensitivity outperforming previously reported values by orders of magnitude we employ density functional theory dft calculations to understand the origin of the measured negative gauge factor our results suggest ptse_2 as a very promising candidate for future nems applications including integration into cmos production lines
|
[['twodimensional', '2d', 'layered', 'materials', 'are', 'ideal', 'for', 'micro', 'and', 'nanoelectromechanical', 'systems', 'memsnems', 'due', 'to', 'their', 'ultimate', 'thinness', 'platinum', 'diselenide', 'ptse_2', 'an', 'exciting', 'and', 'unexplored', '2d', 'transition', 'metal', 'dichalcogenides', 'tmd', 'material', 'is', 'particularly', 'interesting', 'because', 'its', 'scalable', 'and', 'low', 'temperature', 'growth', 'process', 'is', 'compatible', 'with', 'silicon', 'technology', 'here', 'we', 'explore', 'the', 'potential', 'of', 'thin', 'ptse_2', 'films', 'as', 'electromechanical', 'piezoresistive', 'sensors', 'all', 'experiments', 'have', 'been', 'conducted', 'with', 'semimetallic', 'ptse_2', 'films', 'grown', 'by', 'thermally', 'assisted', 'conversion', 'of', 'pt', 'at', 'a', 'cmoscompatible', 'temperature', 'of', '400degc', 'we', 'report', 'high', 'negative', 'gauge', 'factors', 'of', 'up', 'to', '848', 'obtained', 'experimentally', 'from', 'ptse_2', 'strain', 'gauges', 'in', 'a', 'bending', 'cantilever', 'beam', 'setup', 'integrated', 'nems', 'piezoresistive', 'pressure', 'sensors', 'with', 'freestanding', 'pmmaptse_2', 'membranes', 'confirm', 'the', 'negative', 'gauge', 'factor', 'and', 'exhibit', 'very', 'high', 'sensitivity', 'outperforming', 'previously', 'reported', 'values', 'by', 'orders', 'of', 'magnitude', 'we', 'employ', 'density', 'functional', 'theory', 'dft', 'calculations', 'to', 'understand', 'the', 'origin', 'of', 'the', 'measured', 'negative', 'gauge', 'factor', 'our', 'results', 'suggest', 'ptse_2', 'as', 'a', 'very', 'promising', 'candidate', 'for', 'future', 'nems', 'applications', 'including', 'integration', 'into', 'cmos', 'production', 'lines']]
|
[-0.11402489831530009, 0.18287101707669948, 2.9551466418938203e-05, -0.07908319732817869, -0.0486662784580734, -0.21376855835657227, 0.06576342003518772, 0.4688301588860199, -0.20621306420388547, -0.3135317113278716, 0.03555695374115286, -0.3143249019839321, -0.14397091962305378, 0.24602562705986203, 0.020119161201132968, 0.12066539122597808, -0.017924997214735908, -0.1519603323840508, -0.06684583842923696, -0.17247619576907405, 0.20536373878236522, 0.09633616004703623, 0.3878143902458815, 0.09199687144577955, 0.1077080541502007, -0.08048299472976589, 0.09522987072899317, 0.019890071025513337, -0.19105006363207588, 0.0971851974556392, 0.2958329452709718, -0.12801344240168958, 0.2207432157755124, -0.4591699648084063, -0.23578652035071035, -0.03393649184709471, 0.09716496126810935, 0.10494059061800892, -0.16246699598250966, -0.2706525357553002, 0.10441368804807126, -0.14968265047240437, -0.1315809604732997, -0.12461927110879598, -0.002835974074674375, -0.025880919065270007, -0.20490489938952536, 0.05294566093097356, -0.03445777217998649, 0.08115900676502585, -0.07344695416519023, -0.18088360130363568, -0.06129144617977242, 0.04163429483376217, 0.027107595734008956, 0.009165089585197468, 0.2690246328288181, -0.14206878576484142, -0.14130881143112978, 0.3945974408790018, -0.06138025059110739, -0.06425270430292145, 0.200083686891153, -0.16047896935364628, -0.07611204500902782, 0.13861003169846353, 0.1639962855394873, 0.10902474498178696, -0.15767123681690656, 0.0711159203795956, 0.06762528531041674, 0.16632005482150072, 0.10875310716078138, 0.11973575711969964, 0.25380943245395565, 0.2769901137453306, -0.0070794900930416065, 0.12390800369585948, -0.07218357555737549, 0.027189994651372687, -0.1949567068481084, -0.22153406472396897, -0.1824324834195784, 0.12194439424519342, -0.09686198345999318, -0.2012441952430615, 0.3303182465475843, 0.1389381616715003, 0.1440136720059496, -0.05073242822633774, 0.24972026081981533, 0.08343306882800816, 0.14060428743815107, -0.05398765199845939, 0.3072541061203193, 0.18680198989300564, 0.13043763082567955, -0.19828981921203773, 0.04842735193669796, -0.06058622430586679]
|
1,803.07152
|
Exploring the predictability of range-based volatility estimators using
RNNs
|
We investigate the predictability of several range-based stock volatility
estimators, and compare them to the standard close-to-close estimator which is
most commonly acknowledged as the volatility. The patterns of volatility
changes are analyzed using LSTM recurrent neural networks, which are a state of
the art method of sequence learning. We implement the analysis on all current
constituents of the Dow Jones Industrial Average index, and report averaged
evaluation results. We find that changes in the values of range-based
estimators are more predictable than that of the estimator using daily closing
values only.
|
q-fin.CP q-fin.ST stat.ML
|
we investigate the predictability of several rangebased stock volatility estimators and compare them to the standard closetoclose estimator which is most commonly acknowledged as the volatility the patterns of volatility changes are analyzed using lstm recurrent neural networks which are a state of the art method of sequence learning we implement the analysis on all current constituents of the dow jones industrial average index and report averaged evaluation results we find that changes in the values of rangebased estimators are more predictable than that of the estimator using daily closing values only
|
[['we', 'investigate', 'the', 'predictability', 'of', 'several', 'rangebased', 'stock', 'volatility', 'estimators', 'and', 'compare', 'them', 'to', 'the', 'standard', 'closetoclose', 'estimator', 'which', 'is', 'most', 'commonly', 'acknowledged', 'as', 'the', 'volatility', 'the', 'patterns', 'of', 'volatility', 'changes', 'are', 'analyzed', 'using', 'lstm', 'recurrent', 'neural', 'networks', 'which', 'are', 'a', 'state', 'of', 'the', 'art', 'method', 'of', 'sequence', 'learning', 'we', 'implement', 'the', 'analysis', 'on', 'all', 'current', 'constituents', 'of', 'the', 'dow', 'jones', 'industrial', 'average', 'index', 'and', 'report', 'averaged', 'evaluation', 'results', 'we', 'find', 'that', 'changes', 'in', 'the', 'values', 'of', 'rangebased', 'estimators', 'are', 'more', 'predictable', 'than', 'that', 'of', 'the', 'estimator', 'using', 'daily', 'closing', 'values', 'only']]
|
[-0.07190476805560168, 0.054489493037440946, -0.08690913148469977, 0.1394921764283656, -0.031170385516156536, -0.12449788785754488, 0.026744737224602192, 0.46133664864432683, -0.23286154489212024, -0.3006639099055594, 0.16803840585027383, -0.2944277730389181, -0.2099685338991029, 0.24898319564514107, -0.11571824609987684, 0.05495312042402584, 0.06622230530726714, 0.014076169805376085, -0.06756789341139105, -0.30578466357438117, 0.23731251765595196, 0.03239478173558242, 0.3319209622689983, -0.027518428186630153, 0.11039399891416286, -0.03506492785495389, -0.08414421871222638, -0.016054422973276496, -0.09593483461351722, 0.17905127891012504, 0.23535520619723005, 0.09826283420405381, 0.31252693574220597, -0.3834089440917903, -0.19355213660542125, 0.13110906419415885, 0.07644872114978281, 0.031118075489347984, 0.0600347689327024, -0.2691042894436108, 0.07911293670166653, -0.20718236965930684, -0.02262813039124012, -0.1318303083867899, 0.017729339046547048, 0.06200573258460141, -0.27019721532629415, 0.10968501331632609, 0.01096214841703301, 0.07667623030547574, -0.04163274151569867, -0.15937844191033107, -0.027502953310261716, 0.13470815515636905, 0.12257417834589032, -0.0502262690391105, 0.1924562546793003, -0.15134814701933455, -0.17505333158136396, 0.3057985288592485, -0.11540636725056594, -0.16044324507506993, 0.12696083307593733, -0.12666809722617434, -0.12356703867112379, 0.06401096302811261, 0.19588378781022933, 0.08099617840016035, -0.17507559820436513, -0.0022670621024240014, -0.06619797675911296, 0.17439349702620818, 0.05111048751316228, 0.0038149081538994233, 0.1343511246288052, 0.21790698588221938, 0.053843705966086175, 0.10705454198766377, -0.13203064713065493, -0.13675498366765268, -0.23669773599920937, -0.13663510197343734, -0.18308448820287915, -0.008544819510112016, -0.16625037714602314, -0.1989108059519472, 0.4605907480959054, 0.24475177135932577, 0.15880278298932904, 0.1348525531984006, 0.29673121226849136, 0.1056500212532458, 0.03693665369608245, 0.13584788127259895, 0.18958561860823206, 0.048200649731270556, 0.13032160966994835, -0.16047792505104463, 0.1994785713390089, 0.03307955526071345]
|
1,803.07153
|
Mechanisms for producing a working knowledge: Enacting, orchestrating
and organizing
|
Given that knowledge (intensive) work takes place immersed in truly
heterogenous networks of knowledge representations (codified, narrative,
embedded in routines, inscribed in artefacts), our analysis is geared towards
how the transformation of these resources are enacted in the practise of
everyday, knowledge work. First, we discuss the work, strategies and mechanisms
implied in rendering knowledge as credible, trustworthy and relevant. Second,
we analyse how sediments of historically superimposed layers of knowledge
representations need to be enacted through selective repetitions, omittance and
highlighting to preserve it as living knowledge. Third, supplementing the more
cognitivelly oriented aspects of knowledge work, we discuss how codified
knowledge representations organise, coordinate and delegate work. Empirically,
we study clinical work in large hospitals, a type of work, we argue, that
unduely has been left out of traditional listings of knowledge work
|
cs.CY
|
given that knowledge intensive work takes place immersed in truly heterogenous networks of knowledge representations codified narrative embedded in routines inscribed in artefacts our analysis is geared towards how the transformation of these resources are enacted in the practise of everyday knowledge work first we discuss the work strategies and mechanisms implied in rendering knowledge as credible trustworthy and relevant second we analyse how sediments of historically superimposed layers of knowledge representations need to be enacted through selective repetitions omittance and highlighting to preserve it as living knowledge third supplementing the more cognitivelly oriented aspects of knowledge work we discuss how codified knowledge representations organise coordinate and delegate work empirically we study clinical work in large hospitals a type of work we argue that unduely has been left out of traditional listings of knowledge work
|
[['given', 'that', 'knowledge', 'intensive', 'work', 'takes', 'place', 'immersed', 'in', 'truly', 'heterogenous', 'networks', 'of', 'knowledge', 'representations', 'codified', 'narrative', 'embedded', 'in', 'routines', 'inscribed', 'in', 'artefacts', 'our', 'analysis', 'is', 'geared', 'towards', 'how', 'the', 'transformation', 'of', 'these', 'resources', 'are', 'enacted', 'in', 'the', 'practise', 'of', 'everyday', 'knowledge', 'work', 'first', 'we', 'discuss', 'the', 'work', 'strategies', 'and', 'mechanisms', 'implied', 'in', 'rendering', 'knowledge', 'as', 'credible', 'trustworthy', 'and', 'relevant', 'second', 'we', 'analyse', 'how', 'sediments', 'of', 'historically', 'superimposed', 'layers', 'of', 'knowledge', 'representations', 'need', 'to', 'be', 'enacted', 'through', 'selective', 'repetitions', 'omittance', 'and', 'highlighting', 'to', 'preserve', 'it', 'as', 'living', 'knowledge', 'third', 'supplementing', 'the', 'more', 'cognitivelly', 'oriented', 'aspects', 'of', 'knowledge', 'work', 'we', 'discuss', 'how', 'codified', 'knowledge', 'representations', 'organise', 'coordinate', 'and', 'delegate', 'work', 'empirically', 'we', 'study', 'clinical', 'work', 'in', 'large', 'hospitals', 'a', 'type', 'of', 'work', 'we', 'argue', 'that', 'unduely', 'has', 'been', 'left', 'out', 'of', 'traditional', 'listings', 'of', 'knowledge', 'work']]
|
[-0.06416498572229498, 0.053205675963676514, -0.06626722109819153, 0.04051325719670525, -0.16842718996611752, -0.09486627532694404, 0.08707614854342283, 0.41485582145729233, -0.23537174876975386, -0.33064942865779523, 0.09895687044556148, -0.2519652568139976, -0.20612138064396113, 0.1593913953135112, -0.13020318870461833, -0.005883271007665566, 0.07264024012632794, 0.020092736369461045, -0.031920979275627245, -0.2561096768069984, 0.33979340711314426, 0.04053658324370819, 0.3075009447319391, 0.046698525813198125, 0.06163676847402651, -0.007338551298498099, -0.1263057948055124, -0.05104169516327014, -0.10314517480522986, 0.17642681358235054, 0.3463304051709242, 0.21119116415633798, 0.31705615925427555, -0.4982763681616774, -0.20068217075562902, 0.08617060818128232, 0.18089538207277656, 0.10742645813642364, -0.02297992683315555, -0.2775426598784822, 0.04442365567507993, -0.18899427154766663, -0.10643608463031792, -0.14509004778123663, -0.003256080647636401, -0.04042979205181276, -0.19232665568842253, 0.005949761511146789, 0.14534774995443964, 0.10260402094537771, -0.059205235298933054, -0.08306496642193847, 0.019654634702316997, 0.23279034452428832, 0.05542599541289186, 0.015646414346362752, 0.15415011682806717, -0.13459155381888263, -0.14033268728202447, 0.38566385209560394, -0.007397843419777271, -0.1892041935186301, 0.16123678453732282, -0.08685653720443186, -0.20907719246693013, 0.04606540262335001, 0.22383237695601538, 0.12187330395725549, -0.20249716174277596, 0.04978147653085565, -0.020666938103539378, 0.17803500196984023, 0.09449003258005793, 0.03799751587518442, 0.2082405599128259, 0.20676507402379485, -0.018276351085632928, 0.11015568025098567, -0.01104121315258002, -0.11944440966542054, -0.2559685598502174, -0.1741738944013316, -0.1834721177189674, 0.02673236270263595, -0.009059472037111655, -0.11013974465037647, 0.36069210535055374, 0.23545308853149471, 0.14707740337440842, 0.025518754192564944, 0.32447018465937527, -0.01289509681028951, 0.08290273664673244, 0.0847565986310601, 0.1708218248042845, 0.03825183438235208, 0.13223797262513212, -0.10504381361971539, 0.11977535597209756, 0.007212006648008088]
|
1,803.07154
|
Lines in metric spaces: universal lines counted with multiplicity
|
The line generated by two distinct points, $x$ and $y$, in a finite metric
space $M=(V,d)$, denoted by $\overline{xy}^M$, is the set of points given by
$$\overline{xy}^M:=\{z\in V: d(x,y)=|d(x,z)\pm d(z,y)|\}.$$ A 2-set $\{x,y\}$
such that $\overline{xy}^M=V$ is called a universal pair and its associated
line a universal line.
Chen and Chv\'atal conjectured that in any finite metric space either there
is a universal line or there are at least $|V|$ different (non-universal)
lines. Chv\'atal proved that this is indeed the case when the metric space has
distances in the set $\{0,1,2\}$.
Aboulker et al. proposed the following strengthening for Chen and Chv\'atal
conjecture in the context of metric spaces induced by finite graphs. The number
of lines plus the number of universal pairs is at least the number of point of
the space.
In this work we first prove that metric spaces with distances in the set
$\{0,1,2\}$ satisfy this stronger conjecture. We also prove that for metric
spaces induced by bipartite graphs the number of lines plus the number of
bridges of the graph is at least the number its vertices, unless the graph is
$C_4$ or $K_{2,3}$.
|
math.CO
|
the line generated by two distinct points x and y in a finite metric space mvd denoted by overlinexym is the set of points given by overlinexymzin v dxydxzpm dzy a 2set xy such that overlinexymv is called a universal pair and its associated line a universal line chen and chvatal conjectured that in any finite metric space either there is a universal line or there are at least v different nonuniversal lines chvatal proved that this is indeed the case when the metric space has distances in the set 012 aboulker et al proposed the following strengthening for chen and chvatal conjecture in the context of metric spaces induced by finite graphs the number of lines plus the number of universal pairs is at least the number of point of the space in this work we first prove that metric spaces with distances in the set 012 satisfy this stronger conjecture we also prove that for metric spaces induced by bipartite graphs the number of lines plus the number of bridges of the graph is at least the number its vertices unless the graph is c_4 or k_23
|
[['the', 'line', 'generated', 'by', 'two', 'distinct', 'points', 'x', 'and', 'y', 'in', 'a', 'finite', 'metric', 'space', 'mvd', 'denoted', 'by', 'overlinexym', 'is', 'the', 'set', 'of', 'points', 'given', 'by', 'overlinexymzin', 'v', 'dxydxzpm', 'dzy', 'a', '2set', 'xy', 'such', 'that', 'overlinexymv', 'is', 'called', 'a', 'universal', 'pair', 'and', 'its', 'associated', 'line', 'a', 'universal', 'line', 'chen', 'and', 'chvatal', 'conjectured', 'that', 'in', 'any', 'finite', 'metric', 'space', 'either', 'there', 'is', 'a', 'universal', 'line', 'or', 'there', 'are', 'at', 'least', 'v', 'different', 'nonuniversal', 'lines', 'chvatal', 'proved', 'that', 'this', 'is', 'indeed', 'the', 'case', 'when', 'the', 'metric', 'space', 'has', 'distances', 'in', 'the', 'set', '012', 'aboulker', 'et', 'al', 'proposed', 'the', 'following', 'strengthening', 'for', 'chen', 'and', 'chvatal', 'conjecture', 'in', 'the', 'context', 'of', 'metric', 'spaces', 'induced', 'by', 'finite', 'graphs', 'the', 'number', 'of', 'lines', 'plus', 'the', 'number', 'of', 'universal', 'pairs', 'is', 'at', 'least', 'the', 'number', 'of', 'point', 'of', 'the', 'space', 'in', 'this', 'work', 'we', 'first', 'prove', 'that', 'metric', 'spaces', 'with', 'distances', 'in', 'the', 'set', '012', 'satisfy', 'this', 'stronger', 'conjecture', 'we', 'also', 'prove', 'that', 'for', 'metric', 'spaces', 'induced', 'by', 'bipartite', 'graphs', 'the', 'number', 'of', 'lines', 'plus', 'the', 'number', 'of', 'bridges', 'of', 'the', 'graph', 'is', 'at', 'least', 'the', 'number', 'its', 'vertices', 'unless', 'the', 'graph', 'is', 'c_4', 'or', 'k_23']]
|
[-0.18274163758463186, 0.13941023634422733, -0.027510514166509813, 0.02874620454436492, -0.05048337029090718, -0.12596619030227885, 0.055259416254399264, 0.35205631039571017, -0.25076034110616485, -0.27600895836139505, 0.054178912178663864, -0.31841085990384704, -0.13015808147611097, 0.1526435875338907, -0.08877595831670435, 0.004145411675183467, 0.03539047471713275, 0.0636995069394486, -0.035125768911751475, -0.28808067361577466, 0.39304772063927806, -0.039583400160114725, 0.21269988490056005, 0.06640134665750615, 0.10437798456784905, 0.012471740747257529, -0.00715288020538814, 0.1155796177709303, -0.127968752364169, 0.08891047142020872, 0.21885352771547015, 0.14887354453347382, 0.2642997052500267, -0.3112823134288192, -0.20446903110512168, 0.21554725302848965, 0.08679350726964438, 0.02595816588449373, 0.009912050706233182, -0.25148842974601354, 0.15153352664615144, -0.10369911842534076, -0.12105603957467753, 0.0102847764197656, 0.11461647356602202, -0.008913695716056163, -0.2428686097340213, -0.014392285654732563, 0.12430310804072929, 0.06884707715716618, 0.027784624872172415, -0.1058441803451506, -0.08312557325774358, 0.06597799759907977, -0.004136460075286501, 0.12616122405502803, 0.014038646293793927, -0.06790733463561122, -0.13598963163246441, 0.36125997129989706, -0.046410419618832355, -0.166080548602622, 0.1530317896034356, -0.141689042497487, -0.15329456151432722, 0.1279298026878994, 0.08248622877821933, 0.13241514738436547, -0.07529120476267606, 0.16186965828250244, -0.12079154848343814, 0.09748095877638781, 0.1177703439202362, 0.009929046600439546, 0.14460269683394986, 0.0715660041921934, 0.1238989120415088, 0.11726991182323494, -0.04919767519111148, -0.02591388628238549, -0.34655010803481157, -0.15951496990316588, -0.2463591840388962, 0.04734900234768208, -0.13675977461800515, -0.18231563742048582, 0.3538825900835471, 0.0617597077558141, 0.26595538978464267, 0.06339361450670328, 0.21576329718505882, 0.09289419275584172, 0.013678834100415848, 0.14963405151375692, 0.18417708879670777, 0.1420180524545013, 0.000489976901798914, -0.15904340140379802, 0.060536494208423865, 0.1843270841155849]
|
1,803.07155
|
Field Effect Transistors based on Networks of Highly Aligned, Chemically
Synthesized N=7 Armchair Graphene Nanoribbons
|
We report on the experimental demonstration and electrical characterization
of N = 7 armchair graphene nanoribbon (7-AGNR) field effect transistors. The
back-gated transistors are fabricated from atomically precise and highly
aligned 7-AGNRs, synthesized with a bottom-up approach. The large area transfer
process holds the promise of scalable device fabrication with atomically
precise nanoribbons. The channels of the FETs are approximately 30 times longer
than the average nanoribbon length of 30 nm to 40 nm. The density of the GNRs
is high, so that transport can be assumed well-above the percolation threshold.
The long channel transistors exhibit a maximum I$_{ON}$/I$_{OFF}$ current ratio
of 87.5.
|
cond-mat.mes-hall
|
we report on the experimental demonstration and electrical characterization of n 7 armchair graphene nanoribbon 7agnr field effect transistors the backgated transistors are fabricated from atomically precise and highly aligned 7agnrs synthesized with a bottomup approach the large area transfer process holds the promise of scalable device fabrication with atomically precise nanoribbons the channels of the fets are approximately 30 times longer than the average nanoribbon length of 30 nm to 40 nm the density of the gnrs is high so that transport can be assumed wellabove the percolation threshold the long channel transistors exhibit a maximum i_oni_off current ratio of 875
|
[['we', 'report', 'on', 'the', 'experimental', 'demonstration', 'and', 'electrical', 'characterization', 'of', 'n', '7', 'armchair', 'graphene', 'nanoribbon', '7agnr', 'field', 'effect', 'transistors', 'the', 'backgated', 'transistors', 'are', 'fabricated', 'from', 'atomically', 'precise', 'and', 'highly', 'aligned', '7agnrs', 'synthesized', 'with', 'a', 'bottomup', 'approach', 'the', 'large', 'area', 'transfer', 'process', 'holds', 'the', 'promise', 'of', 'scalable', 'device', 'fabrication', 'with', 'atomically', 'precise', 'nanoribbons', 'the', 'channels', 'of', 'the', 'fets', 'are', 'approximately', '30', 'times', 'longer', 'than', 'the', 'average', 'nanoribbon', 'length', 'of', '30', 'nm', 'to', '40', 'nm', 'the', 'density', 'of', 'the', 'gnrs', 'is', 'high', 'so', 'that', 'transport', 'can', 'be', 'assumed', 'wellabove', 'the', 'percolation', 'threshold', 'the', 'long', 'channel', 'transistors', 'exhibit', 'a', 'maximum', 'i_oni_off', 'current', 'ratio', 'of', '875']]
|
[-0.19937656529067432, 0.16207715482610807, 0.00529905071701197, -0.07511292125018729, 0.023913975001550188, -0.24130924933192813, 0.07453033268707347, 0.5039281864814898, -0.2050489012024128, -0.3429653862851909, 0.02417357643043586, -0.2917002638728887, -0.09464063421610798, 0.22120973197560684, -0.004789058046013701, 0.10031614942001361, 0.07750714758374527, -0.11371734017944511, -0.04281825968292633, -0.20443617246643292, 0.14551811563946745, 0.07291823617803554, 0.3968426885046795, 0.1290265672392778, 0.052689718959086085, -0.018171655183073645, 0.11440227872363347, 0.007059004762684744, -0.17297540482068857, 0.10323767134447254, 0.2132436135440252, -0.12194901878269863, 0.204755011471171, -0.4785557110045178, -0.17455394553961048, -0.04582551331715841, 0.15929152277713715, 0.15021112947222576, -0.034110614624760095, -0.23379026031048566, 0.18343065597582608, -0.12235388955941387, -0.04006081771598581, 0.057276811870728056, 0.039400917227955204, -0.01442654211731518, -0.20642379278718842, 0.06808125990666632, 0.006940487397871181, 0.0747833909768173, -0.026375986564922713, -0.2003406061306961, -0.05007590704461144, 0.04652577741802031, -0.0529381763603762, 0.027028027602343584, 0.29263809035696525, -0.1168471146466247, -0.11984772640554343, 0.3144063742867872, -0.052036539490098434, -0.07280530528548886, 0.11447561410878894, -0.19935134071776844, 0.015993713871484586, 0.1780181214984908, 0.09382979553558078, 0.17123802811564767, -0.17066535712037162, 0.05259601201967099, 0.0011813023125332798, 0.2134221951048091, 0.1226186841160205, 0.13339923600227954, 0.25242547647954494, 0.26497546852310644, 0.059379474752966094, 0.10975456898506987, -0.14797711984811387, 0.03543799580074847, -0.20410183690460948, -0.19807621801281164, -0.18170612182025342, 0.20073157085411653, -0.12374877819635074, -0.2058067803143286, 0.3893634750891258, 0.17683766839350118, 0.16870784495190225, 0.0731555609096426, 0.2628759961967886, 0.09898996155015101, 0.13983198485391982, -0.005997181162420733, 0.231930286258313, 0.20480019218110315, 0.12189772000134576, -0.1718274591531714, 0.09893024233443772, -0.12008419578812797]
|
1,803.07156
|
State and Parameter Estimation for Natural Gas Pipeline Networks using
Transient State Data
|
We formulate two estimation problems for pipeline systems in which
measurements of compressible gas flow through a network of pipes is affected by
time-varying injections, withdrawals, and compression. We consider a state
estimation problem that is then extended to a joint state and parameter
estimation problem that can be used for data assimilation. In both
formulations, the flow dynamics are described on each pipe by space- and
time-dependent density and mass flux that evolve according to a system of
coupled partial differential equations, in which momentum dissipation is
modelled using the Darcy-Wiesbach friction approximation. These dynamics are
first spatially discretized to obtain a system of nonlinear ordinary
differential equations on which state and parameter estimation formulations are
given as nonlinear least squares problems. A rapid, scalable computational
method for performing a nonlinear least squares estimation is developed.
Extensive simulations and computational experiments on multiple pipeline test
networks demonstrate the effectiveness of the formulations in obtaining state
and parameter estimates in the presence of measurement and process noise.
|
cs.SY
|
we formulate two estimation problems for pipeline systems in which measurements of compressible gas flow through a network of pipes is affected by timevarying injections withdrawals and compression we consider a state estimation problem that is then extended to a joint state and parameter estimation problem that can be used for data assimilation in both formulations the flow dynamics are described on each pipe by space and timedependent density and mass flux that evolve according to a system of coupled partial differential equations in which momentum dissipation is modelled using the darcywiesbach friction approximation these dynamics are first spatially discretized to obtain a system of nonlinear ordinary differential equations on which state and parameter estimation formulations are given as nonlinear least squares problems a rapid scalable computational method for performing a nonlinear least squares estimation is developed extensive simulations and computational experiments on multiple pipeline test networks demonstrate the effectiveness of the formulations in obtaining state and parameter estimates in the presence of measurement and process noise
|
[['we', 'formulate', 'two', 'estimation', 'problems', 'for', 'pipeline', 'systems', 'in', 'which', 'measurements', 'of', 'compressible', 'gas', 'flow', 'through', 'a', 'network', 'of', 'pipes', 'is', 'affected', 'by', 'timevarying', 'injections', 'withdrawals', 'and', 'compression', 'we', 'consider', 'a', 'state', 'estimation', 'problem', 'that', 'is', 'then', 'extended', 'to', 'a', 'joint', 'state', 'and', 'parameter', 'estimation', 'problem', 'that', 'can', 'be', 'used', 'for', 'data', 'assimilation', 'in', 'both', 'formulations', 'the', 'flow', 'dynamics', 'are', 'described', 'on', 'each', 'pipe', 'by', 'space', 'and', 'timedependent', 'density', 'and', 'mass', 'flux', 'that', 'evolve', 'according', 'to', 'a', 'system', 'of', 'coupled', 'partial', 'differential', 'equations', 'in', 'which', 'momentum', 'dissipation', 'is', 'modelled', 'using', 'the', 'darcywiesbach', 'friction', 'approximation', 'these', 'dynamics', 'are', 'first', 'spatially', 'discretized', 'to', 'obtain', 'a', 'system', 'of', 'nonlinear', 'ordinary', 'differential', 'equations', 'on', 'which', 'state', 'and', 'parameter', 'estimation', 'formulations', 'are', 'given', 'as', 'nonlinear', 'least', 'squares', 'problems', 'a', 'rapid', 'scalable', 'computational', 'method', 'for', 'performing', 'a', 'nonlinear', 'least', 'squares', 'estimation', 'is', 'developed', 'extensive', 'simulations', 'and', 'computational', 'experiments', 'on', 'multiple', 'pipeline', 'test', 'networks', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'formulations', 'in', 'obtaining', 'state', 'and', 'parameter', 'estimates', 'in', 'the', 'presence', 'of', 'measurement', 'and', 'process', 'noise']]
|
[-0.12296066212458032, 0.07045225393453455, -0.07429894144052124, 0.02213523674625716, -0.043502331082989655, -0.15367369775391038, -0.01296147992778345, 0.34648001497521635, -0.2862149477958769, -0.3202296089162175, 0.17969568685210502, -0.2620669450577214, -0.1311937712496904, 0.20434874909963593, -0.05025882763978857, 0.13251239858870675, 0.11926920534706259, -0.024655950187666184, -0.07925439046286271, -0.22122395998680494, 0.30468912376090884, 0.010233710738774165, 0.26162276969639114, -0.02810624442119376, 0.1799081778693776, -0.003834566085302013, -0.040697299721033635, 0.0817954194163872, -0.11478056050257593, 0.08788302214675953, 0.2546705573457798, 0.10419543055783823, 0.29982966092886426, -0.4369061911276665, -0.2765433711437396, 0.0683174648754164, 0.14735647630653378, 0.09872804757232878, -0.01820167115221855, -0.282188701336777, 0.027652100728633982, -0.1574194091540503, -0.07217292462374611, -0.10544697657306061, -0.02888648850136403, 0.018244220412347512, -0.3349759868705219, 0.13037335308105966, 0.002038544415586056, 0.0024913959387487857, -0.10739487804842732, -0.0820576233539663, -0.009127453948561865, 0.08703151780407853, 0.001726271283598224, -0.012657856091812074, 0.12074972557027387, -0.14514905683617724, -0.1060739733778075, 0.36224458725696584, -0.07484433565187795, -0.29469530968309704, 0.1571927199375827, -0.07745057232790144, -0.11932612638303404, 0.14594709529283356, 0.263973395777754, 0.12733555973384036, -0.16987198249420085, 0.02415305146592822, -0.025867325950172698, 0.1808877944601251, 0.011360378760608834, -0.04720730435226606, 0.15299194533355445, 0.20248533105646002, 0.10103108906481661, 0.12765364519093209, -0.09553328633493553, -0.1409800187095506, -0.27382512999094, -0.12478700308732307, -0.166411355092942, -0.0042816742494455485, -0.07525323997746104, -0.1555790736575622, 0.35480269455036756, 0.1509607399446351, 0.17014643933107876, 0.04309210214407621, 0.34568633591610354, 0.17590704833925982, -0.014416100300220122, 0.09936795628584742, 0.20820663604571157, 0.16745661037794526, 0.09007787440219019, -0.2503547566825053, 0.06221155922702817, 0.0798179408933698]
|
1,803.07157
|
The nested materiality of environmental monitoring
|
Present knowledge about the marine ecosystem on the Norwegian Continental
Shelf towards the Arctic is sparse. These areas are vast, remote and subject to
harsh weather conditions. We report from a three-year case study of an ongoing
effort for real-time, subsea environmental monitoring by an oil and gas
operator. The facts about the subsea environment are anything but neutral; they
are intrinsically caught up with the material means by which they are known.
The marine ecosystem is monitored through a network of sensors, communication
links, visualisation and analysis tools. Our concept of nested materiality
draws heavily on perspectives in sociomateriality but highlights (i) the
distributed and interconnected infrastructure of the material means (as opposed
to artefact-centric) and (ii) in-the-making (as opposed to black-boxed)
technology.
|
cs.CY
|
present knowledge about the marine ecosystem on the norwegian continental shelf towards the arctic is sparse these areas are vast remote and subject to harsh weather conditions we report from a threeyear case study of an ongoing effort for realtime subsea environmental monitoring by an oil and gas operator the facts about the subsea environment are anything but neutral they are intrinsically caught up with the material means by which they are known the marine ecosystem is monitored through a network of sensors communication links visualisation and analysis tools our concept of nested materiality draws heavily on perspectives in sociomateriality but highlights i the distributed and interconnected infrastructure of the material means as opposed to artefactcentric and ii inthemaking as opposed to blackboxed technology
|
[['present', 'knowledge', 'about', 'the', 'marine', 'ecosystem', 'on', 'the', 'norwegian', 'continental', 'shelf', 'towards', 'the', 'arctic', 'is', 'sparse', 'these', 'areas', 'are', 'vast', 'remote', 'and', 'subject', 'to', 'harsh', 'weather', 'conditions', 'we', 'report', 'from', 'a', 'threeyear', 'case', 'study', 'of', 'an', 'ongoing', 'effort', 'for', 'realtime', 'subsea', 'environmental', 'monitoring', 'by', 'an', 'oil', 'and', 'gas', 'operator', 'the', 'facts', 'about', 'the', 'subsea', 'environment', 'are', 'anything', 'but', 'neutral', 'they', 'are', 'intrinsically', 'caught', 'up', 'with', 'the', 'material', 'means', 'by', 'which', 'they', 'are', 'known', 'the', 'marine', 'ecosystem', 'is', 'monitored', 'through', 'a', 'network', 'of', 'sensors', 'communication', 'links', 'visualisation', 'and', 'analysis', 'tools', 'our', 'concept', 'of', 'nested', 'materiality', 'draws', 'heavily', 'on', 'perspectives', 'in', 'sociomateriality', 'but', 'highlights', 'i', 'the', 'distributed', 'and', 'interconnected', 'infrastructure', 'of', 'the', 'material', 'means', 'as', 'opposed', 'to', 'artefactcentric', 'and', 'ii', 'inthemaking', 'as', 'opposed', 'to', 'blackboxed', 'technology']]
|
[-0.09844965847344914, 0.11189846608346367, -0.04003727618449678, 0.02190429111069534, -0.07453674237282636, -0.09838333303729693, 0.06960024096188136, 0.38666957299768306, -0.2440681263882046, -0.3370244666235521, 0.22030912831251043, -0.30542147959737725, -0.15378675211880666, 0.2267128773033619, -0.128987543835395, 0.019428333521742995, 0.057146172693076855, -0.021076793146009246, 0.03349297806659403, -0.226404792588437, 0.2665163277852116, 0.08494508634709443, 0.2816066338370244, 0.045153216497662164, 0.06992689033116524, -0.028576980214954043, -0.12086022891647492, -0.05345973582880106, -0.07939725579538694, 0.13421199890532687, 0.29915310150633256, 0.17819205490717044, 0.31240991670638324, -0.4936594194111725, -0.21722605754621327, 0.06601669485777771, 0.11510028265135284, 0.04978690836869646, -0.03983834865211975, -0.35302323222276755, -0.0010652617551386357, -0.18713507715146988, -0.1462379311521848, -0.045704247947530044, -0.0064706700063349365, 0.038666191993979734, -0.210890241729309, 0.014979439911743005, 0.02163754552602768, 0.1375168164094627, -0.048810520011466, -0.09908539965593567, -0.030707962863380088, 0.19112706432739893, 0.04310069493949413, -0.016789072571555153, 0.2223039942405497, -0.1459778909261028, -0.0577949519501999, 0.3671602806212225, 0.014298344554845244, -0.1111476229338829, 0.2564150059595704, -0.08552687697811052, -0.11358345901438345, 0.09463681497921546, 0.19930073608023424, 0.04833032013023816, -0.210397039623543, 0.02993106390495086, -0.04263793742284179, 0.16430182633339427, 0.010768234925732638, 0.024915368808433414, 0.2523735123065611, 0.22152925836853682, 0.12513093710877002, 0.11898798188970734, -0.06709571810594449, -0.10851660050296535, -0.2227490546851186, -0.14392519082951669, -0.13219846129068175, 0.03576403512949279, -0.029556719164611424, -0.14274388438401123, 0.3394897713791579, 0.1368674453231506, 0.13275698811436693, -0.007177588660852052, 0.3218643211682017, -4.1501632464739185e-05, 0.08058733558670307, 0.09153887571301311, 0.18927948199367772, 0.06535062662005657, 0.19583971002527203, -0.12207115796045401, 0.14849048430332915, -0.019463859987445174]
|
1,803.07158
|
A fully implicit, conservative, non-linear, electromagnetic hybrid
particle-ion/fluid-electron algorithm
|
The quasi-neutral hybrid model with kinetic ions and fluid electrons is a
promising approach for bridging the inherent multi-scale nature of many
problems in space and laboratory plasmas. Here, a novel, implicit,
particle-in-cell based scheme for the hybrid model is derived for
multi-dimensional electromagnetic problems with multiple ion species, which
features global mass, momentum and energy conservation. The scheme includes
sub-cycling and orbit averaging of the ions, with cell-centered finite
differences and implicit midpoint time advance. To reduce discrete particle
noise, the scheme allows arbitrary-order shape functions for the particle-mesh
interpolations and the application of conservative binomial smoothing. The
algorithm is verified for a number of test problems to demonstrate the
correctness of the implementation, the unique conservation properties, and the
favorable stability properties of the new scheme. In particular, there is no
indication of unstable growth of the finite-grid instability for a population
of cold ions drifting through a uniform spatial mesh, in a set-up where several
commonly used non-conservative schemes are highly unstable.
|
physics.plasm-ph physics.comp-ph physics.space-ph
|
the quasineutral hybrid model with kinetic ions and fluid electrons is a promising approach for bridging the inherent multiscale nature of many problems in space and laboratory plasmas here a novel implicit particleincell based scheme for the hybrid model is derived for multidimensional electromagnetic problems with multiple ion species which features global mass momentum and energy conservation the scheme includes subcycling and orbit averaging of the ions with cellcentered finite differences and implicit midpoint time advance to reduce discrete particle noise the scheme allows arbitraryorder shape functions for the particlemesh interpolations and the application of conservative binomial smoothing the algorithm is verified for a number of test problems to demonstrate the correctness of the implementation the unique conservation properties and the favorable stability properties of the new scheme in particular there is no indication of unstable growth of the finitegrid instability for a population of cold ions drifting through a uniform spatial mesh in a setup where several commonly used nonconservative schemes are highly unstable
|
[['the', 'quasineutral', 'hybrid', 'model', 'with', 'kinetic', 'ions', 'and', 'fluid', 'electrons', 'is', 'a', 'promising', 'approach', 'for', 'bridging', 'the', 'inherent', 'multiscale', 'nature', 'of', 'many', 'problems', 'in', 'space', 'and', 'laboratory', 'plasmas', 'here', 'a', 'novel', 'implicit', 'particleincell', 'based', 'scheme', 'for', 'the', 'hybrid', 'model', 'is', 'derived', 'for', 'multidimensional', 'electromagnetic', 'problems', 'with', 'multiple', 'ion', 'species', 'which', 'features', 'global', 'mass', 'momentum', 'and', 'energy', 'conservation', 'the', 'scheme', 'includes', 'subcycling', 'and', 'orbit', 'averaging', 'of', 'the', 'ions', 'with', 'cellcentered', 'finite', 'differences', 'and', 'implicit', 'midpoint', 'time', 'advance', 'to', 'reduce', 'discrete', 'particle', 'noise', 'the', 'scheme', 'allows', 'arbitraryorder', 'shape', 'functions', 'for', 'the', 'particlemesh', 'interpolations', 'and', 'the', 'application', 'of', 'conservative', 'binomial', 'smoothing', 'the', 'algorithm', 'is', 'verified', 'for', 'a', 'number', 'of', 'test', 'problems', 'to', 'demonstrate', 'the', 'correctness', 'of', 'the', 'implementation', 'the', 'unique', 'conservation', 'properties', 'and', 'the', 'favorable', 'stability', 'properties', 'of', 'the', 'new', 'scheme', 'in', 'particular', 'there', 'is', 'no', 'indication', 'of', 'unstable', 'growth', 'of', 'the', 'finitegrid', 'instability', 'for', 'a', 'population', 'of', 'cold', 'ions', 'drifting', 'through', 'a', 'uniform', 'spatial', 'mesh', 'in', 'a', 'setup', 'where', 'several', 'commonly', 'used', 'nonconservative', 'schemes', 'are', 'highly', 'unstable']]
|
[-0.11440701516935738, 0.08697835636245678, -0.08750606644273985, 0.08317175840890807, -0.04046487159709015, -0.1437491433490522, 0.010693940927456246, 0.35760425158106246, -0.27086108620846416, -0.29387307162652154, 0.056301623321970265, -0.20901182351114653, -0.06793839524772655, 0.202777861322918, -0.011597631104494922, 0.1073962302850815, 0.07611036124758468, -0.057564609505168, -0.04831428309226772, -0.17704308686051062, 0.2995449090774012, 0.10087268597804146, 0.28552639322843765, 0.03423004194088962, 0.17068131373579068, -0.029087021726853693, -0.030888996150901134, 0.024317163476974577, -0.09938369806083601, 0.10273970153591619, 0.1999544152214828, 0.05911914998219667, 0.3117638801497112, -0.4356546729700867, -0.2571367566678219, 0.05909488910650153, 0.13978908869804155, 0.13320626173574454, -0.11237702493324433, -0.22683955305653467, 0.058155368492518345, -0.17353909787304542, -0.14888239470196934, -0.07647030653216218, -0.007291632894676451, 0.09723997125068463, -0.3311729855074479, 0.10780337532959515, 0.05932464980997327, 0.03811020705786466, -0.07902273568984905, -0.09017755814385033, -0.02911824326417068, 0.06228564080509653, 0.024659930984631588, -0.023961654205511256, 0.0999369776762295, -0.08393082311575688, -0.1081649267750724, 0.4299954086735209, -0.03564061671097922, -0.2573644267395139, 0.21799708923563452, -0.08327391444671355, -0.11798481113936116, 0.18008274265860275, 0.1730685435212785, 0.14985350035301342, -0.12362898519495502, 0.07040495651798244, -0.024922855147274166, 0.16333771300216496, 0.043174385785965656, 0.037116348927289745, 0.15844161849520055, 0.1903584370341311, 0.0732973830078064, 0.10319057493564664, -0.0982044866949564, -0.14392983561620207, -0.29838930530134283, -0.18441186008248023, -0.16282833085349965, -0.053987062737777286, -0.10464196176006936, -0.19437650397488074, 0.37723611741887175, 0.15308640528755638, 0.1221964873441654, -0.0002643535468761423, 0.33588266534810296, 0.1120802267985532, 0.00790943908107626, 0.0966845096724971, 0.19464435513633893, 0.15101558751165411, 0.10739319863240802, -0.26178053250854333, 0.036590565274265116, 0.11719826496882]
|
1,803.07159
|
Transition from normal to ballistic diffusion in a one-dimensional
impact system
|
We characterize a transition from normal to ballistic diffusion in a bouncing
ball dynamics. The system is composed of a particle, or an ensemble of
non-interacting particles, experiencing elastic collisions with a heavy and
periodically moving wall under the influence of a constant gravitational field.
The dynamics lead to a mixed phase space where chaotic orbits have a free path
to move along the velocity axis, presenting a normal diffusion behavior.
Depending on the control parameter, one can observe the presence of featured
resonances, known as accelerator modes, that lead to a ballistic growth of
velocity. Through statistical and numerical analysis of the velocity of the
particle, we are able to characterize a transition between the two regimes,
where transport properties were used to characterize the scenario of the
ballistic regime. Also, in an analysis of the probability of an orbit to reach
an accelerator mode as a function of the velocity, we observe a competition
between the normal and ballistic transport in the mid range velocity.
|
cond-mat.stat-mech nlin.CD
|
we characterize a transition from normal to ballistic diffusion in a bouncing ball dynamics the system is composed of a particle or an ensemble of noninteracting particles experiencing elastic collisions with a heavy and periodically moving wall under the influence of a constant gravitational field the dynamics lead to a mixed phase space where chaotic orbits have a free path to move along the velocity axis presenting a normal diffusion behavior depending on the control parameter one can observe the presence of featured resonances known as accelerator modes that lead to a ballistic growth of velocity through statistical and numerical analysis of the velocity of the particle we are able to characterize a transition between the two regimes where transport properties were used to characterize the scenario of the ballistic regime also in an analysis of the probability of an orbit to reach an accelerator mode as a function of the velocity we observe a competition between the normal and ballistic transport in the mid range velocity
|
[['we', 'characterize', 'a', 'transition', 'from', 'normal', 'to', 'ballistic', 'diffusion', 'in', 'a', 'bouncing', 'ball', 'dynamics', 'the', 'system', 'is', 'composed', 'of', 'a', 'particle', 'or', 'an', 'ensemble', 'of', 'noninteracting', 'particles', 'experiencing', 'elastic', 'collisions', 'with', 'a', 'heavy', 'and', 'periodically', 'moving', 'wall', 'under', 'the', 'influence', 'of', 'a', 'constant', 'gravitational', 'field', 'the', 'dynamics', 'lead', 'to', 'a', 'mixed', 'phase', 'space', 'where', 'chaotic', 'orbits', 'have', 'a', 'free', 'path', 'to', 'move', 'along', 'the', 'velocity', 'axis', 'presenting', 'a', 'normal', 'diffusion', 'behavior', 'depending', 'on', 'the', 'control', 'parameter', 'one', 'can', 'observe', 'the', 'presence', 'of', 'featured', 'resonances', 'known', 'as', 'accelerator', 'modes', 'that', 'lead', 'to', 'a', 'ballistic', 'growth', 'of', 'velocity', 'through', 'statistical', 'and', 'numerical', 'analysis', 'of', 'the', 'velocity', 'of', 'the', 'particle', 'we', 'are', 'able', 'to', 'characterize', 'a', 'transition', 'between', 'the', 'two', 'regimes', 'where', 'transport', 'properties', 'were', 'used', 'to', 'characterize', 'the', 'scenario', 'of', 'the', 'ballistic', 'regime', 'also', 'in', 'an', 'analysis', 'of', 'the', 'probability', 'of', 'an', 'orbit', 'to', 'reach', 'an', 'accelerator', 'mode', 'as', 'a', 'function', 'of', 'the', 'velocity', 'we', 'observe', 'a', 'competition', 'between', 'the', 'normal', 'and', 'ballistic', 'transport', 'in', 'the', 'mid', 'range', 'velocity']]
|
[-0.15905279482151577, 0.20035367532428297, -0.13363022614593903, -0.010907495137120034, -0.027449546075108164, -0.10994554182352821, 0.030174590555726535, 0.3378443681121899, -0.30549620567614627, -0.24941948710377523, 0.053987048182240545, -0.28212489561640663, -0.09939953761626995, 0.20153947646902529, 0.006703555985482153, 0.01880057303870688, 0.03171199099732351, 0.05123013024801154, -0.05558657607002306, -0.15286517021675666, 0.2897562225945963, 0.029600591711075364, 0.2484315827009296, 0.010675313069365228, 0.10079542595982373, -0.00736741547216243, 0.052701660194908254, 0.03607305613660789, -0.1697369227703876, 0.037015741500162805, 0.16654902346666434, 0.0068799888458616005, 0.2651352185399054, -0.4236067838487243, -0.2049711005433538, 0.09085776512775971, 0.17363307984478907, 0.09972570159522716, -0.06571020358060849, -0.2632040754741359, 0.01863995359716993, -0.16407854640912153, -0.18888494531306144, -0.0077391667235754205, 0.02057888807274379, 0.04900557652964887, -0.2700365266600947, 0.10094511803796564, 0.04311396442576797, 0.0431023496063705, -0.054546239559990384, -0.028174606561075205, -0.027372550611066335, 0.12795492905627065, 0.059252611861960174, -0.003619762731459505, 0.1757466457409486, -0.1430043254673626, -0.10175557442366363, 0.4007913384720415, -0.0985510547737407, -0.1983337686118296, 0.2318157286321867, -0.18675730749685876, -0.03105194860522797, 0.16439755112462548, 0.2216440270916966, 0.09541569565963781, -0.14123833577934944, 0.029883831225316078, -0.014058925175877611, 0.13800768614649037, 0.062072650225509604, 0.012969260904268769, 0.23317466399474326, 0.1846179293613591, 0.06976444639605721, 0.13157908879443556, -0.15474708952862926, -0.1289059656510453, -0.2950304736031922, -0.1691388973943934, -0.1513322484433793, 0.03748421716604181, -0.05776556100235195, -0.21161321999538624, 0.3972227526968066, 0.12391421735052488, 0.2509017629760825, 0.00582220891635575, 0.2531623377340628, 0.11000703746929742, 0.010698574830772366, 0.0819876891613832, 0.2745493713412211, 0.13920509443244714, 0.09807525267880299, -0.26199132383266543, 0.04729129396682929, 0.00980802828691409]
|
1,803.0716
|
Microwave Vortex Beam Launcher Design
|
A novel design for a vectorial vortex beam launcher in the microwave regime
is devised. The beam is formed by launching a single guided transverse electric
(TE) mode of a metallic circular waveguide into free-space. Excitation is
achieved by the mean of an inserted coaxial loop antenna. Modal expansion
coefficients are computed, and the resulting electric and magnetic fields are
determined. The effect of the antenna location inside the waveguide on its
effective input impedance is modelled using transmission-line relations and
location for optimal matching is established. The analytical results are
confirmed using multi-level fast multipole method full-wave simulations.
|
physics.app-ph eess.SP physics.class-ph
|
a novel design for a vectorial vortex beam launcher in the microwave regime is devised the beam is formed by launching a single guided transverse electric te mode of a metallic circular waveguide into freespace excitation is achieved by the mean of an inserted coaxial loop antenna modal expansion coefficients are computed and the resulting electric and magnetic fields are determined the effect of the antenna location inside the waveguide on its effective input impedance is modelled using transmissionline relations and location for optimal matching is established the analytical results are confirmed using multilevel fast multipole method fullwave simulations
|
[['a', 'novel', 'design', 'for', 'a', 'vectorial', 'vortex', 'beam', 'launcher', 'in', 'the', 'microwave', 'regime', 'is', 'devised', 'the', 'beam', 'is', 'formed', 'by', 'launching', 'a', 'single', 'guided', 'transverse', 'electric', 'te', 'mode', 'of', 'a', 'metallic', 'circular', 'waveguide', 'into', 'freespace', 'excitation', 'is', 'achieved', 'by', 'the', 'mean', 'of', 'an', 'inserted', 'coaxial', 'loop', 'antenna', 'modal', 'expansion', 'coefficients', 'are', 'computed', 'and', 'the', 'resulting', 'electric', 'and', 'magnetic', 'fields', 'are', 'determined', 'the', 'effect', 'of', 'the', 'antenna', 'location', 'inside', 'the', 'waveguide', 'on', 'its', 'effective', 'input', 'impedance', 'is', 'modelled', 'using', 'transmissionline', 'relations', 'and', 'location', 'for', 'optimal', 'matching', 'is', 'established', 'the', 'analytical', 'results', 'are', 'confirmed', 'using', 'multilevel', 'fast', 'multipole', 'method', 'fullwave', 'simulations']]
|
[-0.19897838891248662, 0.14820090653224863, -0.025775162550159776, -0.012455337524479913, -0.08910489041649859, -0.1575797238608239, -0.0018400683472252855, 0.47348542887755113, -0.20912366085732825, -0.2700555370650207, 0.025204071765818462, -0.24263273224686133, -0.08814912900414477, 0.24382385596012077, 0.05475494329525967, 0.10081372974768829, 0.023594474328230277, -0.009053858443906512, -0.010596979536454786, -0.1034089317124906, 0.25255739071754496, 0.09363755362221238, 0.36492219107517165, 0.022606275955713684, 0.13050549922774385, 0.03145328146932327, -0.006782401795263844, 0.043834438349938755, -0.10014145356612374, 0.10433918898901667, 0.20829118572344835, 0.0438470685374782, 0.19841577310227987, -0.4680880078801302, -0.200241701564554, -0.048870687918605826, 0.1858329893691898, 0.11509565515161464, -0.0797802444625025, -0.28031584513232566, 0.0709156733514233, -0.11475859354767534, -0.16071871558505327, -0.01707747969023808, -0.05859079000756445, 0.03250096063982141, -0.3385557791105274, 0.003585173676408959, 0.03091896198939231, 0.0715239674718392, -0.021959618412456805, -0.07933962733203762, -0.022017683777393715, 0.0664448825315563, -0.05619775938726209, 0.016807014536526468, 0.18852572389549077, -0.0904572446680054, -0.10162434208611346, 0.34431235517629166, -0.047115112984120244, -0.2036105328662241, 0.05584546385539903, -0.13773246758354057, 0.0638579849772287, 0.17632222240508505, 0.16773761476794577, 0.10984663552407062, -0.14653849371266786, 0.05227425448523571, -0.003982261350058546, 0.16772278467183838, 0.16859297699182096, -0.0053871600662894325, 0.2580136534842578, 0.1931374790170465, -0.007601168559337354, 0.2030729031862898, -0.137776184589555, -0.02872443713031408, -0.25621402882641614, -0.08099466813681176, -0.2289821964772677, -0.035117959782405936, -0.09436018509990794, -0.18152515519165782, 0.38403578104470115, 0.05505489371952159, 0.1140068569147108, -0.020983700058422983, 0.3985859899584091, 0.18439661014373554, 0.06134572683955834, 0.06217835077338598, 0.3114253234005336, 0.20366594784733172, 0.09527793127309644, -0.29583401013297417, -0.00663753465109627, 0.05599393014034087]
|
1,803.07161
|
Two-Point Functions in ABJM Matrix Model
|
We introduce non-trivial two-point functions of the super Schur polynomials
in the ABJM matrix model and study their exact values with the Fermi gas
formalism. We find that, although defined non-trivially, these two-point
functions enjoy two simple relations with the one-point functions. One of them
is associated with the Littlewood-Richardson rule, while the other is more
novel. With plenty of data, we also revisit the one-point functions and study
how the diagonal BPS indices are split asymmetrically by the degree difference.
|
hep-th
|
we introduce nontrivial twopoint functions of the super schur polynomials in the abjm matrix model and study their exact values with the fermi gas formalism we find that although defined nontrivially these twopoint functions enjoy two simple relations with the onepoint functions one of them is associated with the littlewoodrichardson rule while the other is more novel with plenty of data we also revisit the onepoint functions and study how the diagonal bps indices are split asymmetrically by the degree difference
|
[['we', 'introduce', 'nontrivial', 'twopoint', 'functions', 'of', 'the', 'super', 'schur', 'polynomials', 'in', 'the', 'abjm', 'matrix', 'model', 'and', 'study', 'their', 'exact', 'values', 'with', 'the', 'fermi', 'gas', 'formalism', 'we', 'find', 'that', 'although', 'defined', 'nontrivially', 'these', 'twopoint', 'functions', 'enjoy', 'two', 'simple', 'relations', 'with', 'the', 'onepoint', 'functions', 'one', 'of', 'them', 'is', 'associated', 'with', 'the', 'littlewoodrichardson', 'rule', 'while', 'the', 'other', 'is', 'more', 'novel', 'with', 'plenty', 'of', 'data', 'we', 'also', 'revisit', 'the', 'onepoint', 'functions', 'and', 'study', 'how', 'the', 'diagonal', 'bps', 'indices', 'are', 'split', 'asymmetrically', 'by', 'the', 'degree', 'difference']]
|
[-0.12218028851885372, 0.12547812162737512, -0.08214053845056045, 0.11681572986115632, -0.06165552755564819, -0.13527645878953698, 0.011797066628473041, 0.3743181201617843, -0.2368801855309694, -0.22448431532600044, 0.07589694744200204, -0.2877946437370998, -0.2202290909387815, 0.14549668821618306, 0.012466887115604348, 0.02481954247438504, -0.008224125434127118, 0.012346712119279452, -0.1836374481237367, -0.27775868660494407, 0.4135592369546677, 0.006216093196453136, 0.27677175701584344, 0.04384441918371544, 0.065654324466811, 0.01099393474811941, -0.07888337356659274, -0.019348580286734633, -0.1334477903377617, 0.14362141845552365, 0.20384313146595234, 0.11038451889000925, 0.18349276018547422, -0.403772598684386, -0.12011272632689388, 0.14818262451408823, 0.12573622820760916, 0.04592151323011444, 0.013434925825690081, -0.21866744466378918, 0.04538340546351708, -0.1860602531902978, -0.18200422873732025, -0.11001965146293335, -0.012526409985083673, 0.046018360245162274, -0.2143156557418636, 0.10397906852979501, 0.01289408683868838, 0.017965168870387623, -0.0073915482556194435, -0.16050652362245285, -0.06480758782637155, 0.12006090374456511, 0.05310991016521268, 0.026528687699249497, 0.09069149117387923, -0.15022905321538815, -0.12068494156945819, 0.32993876568133723, -0.02914275316360556, -0.26741592749309395, 0.15419581394504617, -0.21826840346725082, -0.1563897924900147, 0.05742376989880462, 0.07024463317874405, 0.12602595118288365, -0.1346299662772152, 0.12340539542492479, -0.124216883259331, 0.0942636805365184, 0.06031503193195403, 0.05300533399560753, 0.2189600257731882, 0.0017492065786809466, 0.04321310192024634, 0.20988089756330153, -0.02292471256985237, -0.09651329372952014, -0.3216586547133363, -0.12395052720881879, -0.14750174122552076, 0.024176659844355818, -0.14692382847877322, -0.2264862761453346, 0.43354586893577635, 0.09588026901546085, 0.2195082924466718, 0.14660795930956985, 0.2362192593583906, 0.18451297848864837, 0.10551583686165143, 0.06581053805801972, 0.17683620468632857, 0.15881108703310198, 0.038517430082630415, -0.22388187031318035, -0.01783787256773607, 0.16744346431468005]
|
1,803.07162
|
Bohr-Sommerfeld Lagrangian submanifolds as minima of convex functions
|
We prove that every closed Bohr-Sommerfeld Lagrangian submanifold $Q$ of a
symplectic/K\"ahler manifold $X$ can be realised as a Morse-Bott minimum for
some 'convex' exhausting function defined in the complement of a
symplectic/complex hyperplane section $Y$. In the K\"ahler case, 'convex' means
strictly plurisubharmonic while, in the symplectic case, it refers to the
existence of a Liouville pseudogradient. In particular, $Q\subset X\setminus Y$
is a regular Lagrangian submanifold in the sense of Eliashberg-Ganatra-Lazarev.
|
math.SG
|
we prove that every closed bohrsommerfeld lagrangian submanifold q of a symplectickahler manifold x can be realised as a morsebott minimum for some convex exhausting function defined in the complement of a symplecticcomplex hyperplane section y in the kahler case convex means strictly plurisubharmonic while in the symplectic case it refers to the existence of a liouville pseudogradient in particular qsubset xsetminus y is a regular lagrangian submanifold in the sense of eliashbergganatralazarev
|
[['we', 'prove', 'that', 'every', 'closed', 'bohrsommerfeld', 'lagrangian', 'submanifold', 'q', 'of', 'a', 'symplectickahler', 'manifold', 'x', 'can', 'be', 'realised', 'as', 'a', 'morsebott', 'minimum', 'for', 'some', 'convex', 'exhausting', 'function', 'defined', 'in', 'the', 'complement', 'of', 'a', 'symplecticcomplex', 'hyperplane', 'section', 'y', 'in', 'the', 'kahler', 'case', 'convex', 'means', 'strictly', 'plurisubharmonic', 'while', 'in', 'the', 'symplectic', 'case', 'it', 'refers', 'to', 'the', 'existence', 'of', 'a', 'liouville', 'pseudogradient', 'in', 'particular', 'qsubset', 'xsetminus', 'y', 'is', 'a', 'regular', 'lagrangian', 'submanifold', 'in', 'the', 'sense', 'of', 'eliashbergganatralazarev']]
|
[-0.24605460770835635, 0.037571912850918515, -0.080557849204966, 0.10761243281719673, -0.07829712081168379, -0.16912989086205407, 0.005151003359683923, 0.3188332315767184, -0.3079893469810486, -0.1189835689695818, 0.06272056051363636, -0.26670678803431136, -0.16067060521537704, 0.14554888967956817, -0.19319316678281342, 0.035051005739452586, 0.08205247949808836, 0.11884809397826238, -0.1229221492839445, -0.25449877697974443, 0.4005359585862607, -0.11321969273766237, 0.14704619121870824, 0.10695853999017604, 0.148202540406159, 0.03320330708021564, 0.08694570176303387, 0.04509798466627087, -0.17308668509244204, 0.08365763860887715, 0.314125948698659, 0.12763545168231108, 0.23418853926871505, -0.3416346374545745, -0.1746353968977928, 0.22450142236027334, 0.15886609743881439, -0.0687597121012264, -0.004361437570436725, -0.2597831015275525, 0.09675618426076003, -0.07806566031649709, -0.23191604972151772, -0.04723962574665035, 0.05701727215200662, 0.02314700254022942, -0.2649815779977611, -0.02466056958156904, 0.1393926344412778, 0.07313408588192293, -0.04497442492949111, -0.0782541579699942, -0.12614211908408574, -0.0065375079766714144, -0.007200368058069476, 0.22194451578626676, 0.1296327144564462, -0.020217751684997762, -0.05829999949284164, 0.36508726312645845, -0.1140578715662871, -0.3777585866195815, 0.052783548018695524, -0.17674961922291135, -0.16238503325730563, 0.14873097274186356, 0.07426655971046005, 0.21634726557281933, -0.0924677467971508, 0.2829509806287076, -0.12130081289713936, 0.031100468330883552, 0.12568052101082036, -0.016729209232809288, 0.12064073075141225, 0.12494485147596736, 0.20880549447610974, 0.11473406686148208, 0.01651703105973346, -0.07345313211636884, -0.4022763465132032, -0.2273810550304396, -0.1832104139096503, 0.1952724878942328, -0.11153329272721228, -0.18833784821576305, 0.3289705189211028, -0.04521189942024648, 0.22698641867776, 0.10852629660761783, 0.21466786906655347, 0.045267332942291565, 0.0106110816887979, 0.09957642806028681, 0.159560182074035, 0.19237349553898508, 0.0004544923115255577, -0.10299888903142086, -0.022950857811208283, 0.1877441404586924]
|
1,803.07163
|
Additional Exoplanet Science Enabled by FINESSE
|
FINESSE, a NASA MIDEX mission in Step 2, would conduct a large, uniform
survey of exoplanet atmospheres and create a statistically significant sample
for comparative planetology. FINESSE's technical capabilities, driven by a
scientific program to study planetary formation and climate mechanisms, enable
additional exoplanet science presented here.
|
astro-ph.EP
|
finesse a nasa midex mission in step 2 would conduct a large uniform survey of exoplanet atmospheres and create a statistically significant sample for comparative planetology finesses technical capabilities driven by a scientific program to study planetary formation and climate mechanisms enable additional exoplanet science presented here
|
[['finesse', 'a', 'nasa', 'midex', 'mission', 'in', 'step', '2', 'would', 'conduct', 'a', 'large', 'uniform', 'survey', 'of', 'exoplanet', 'atmospheres', 'and', 'create', 'a', 'statistically', 'significant', 'sample', 'for', 'comparative', 'planetology', 'finesses', 'technical', 'capabilities', 'driven', 'by', 'a', 'scientific', 'program', 'to', 'study', 'planetary', 'formation', 'and', 'climate', 'mechanisms', 'enable', 'additional', 'exoplanet', 'science', 'presented', 'here']]
|
[-0.094997084798648, 0.09905411968839929, -0.0980373805269916, 0.043891244507246116, -0.17086369735486012, -0.06497702084759131, 0.10777673323420768, 0.36098985072780165, -0.16359624311209042, -0.41580524466476065, 0.10923600274861414, -0.25166175040872174, -0.12491567864360169, 0.24491559513943625, -0.09759713950111194, 0.10360304769524868, 0.2006675076096299, -0.17422301536227794, 0.08854197706789413, -0.2763248389943483, 0.20795005817521126, 0.1779993897938031, 0.14589877445448904, -0.005936178636360675, 0.0339769500238385, -0.07451029355697175, -0.15308950216251802, -0.04697775904168474, -0.23655665764941813, 0.10037599466344778, 0.36913133594901004, 0.21678376348411782, 0.36204661991684994, -0.3862150426589614, -0.2260641459018943, 0.045155103397654724, 0.09694499418416873, 0.021924295086175837, -0.12698943193684867, -0.2629402951991304, 0.013583602044394518, -0.21774978820789367, -0.17369784007562286, -0.09875685818235766, 0.05262673124076521, -0.0020696948173436077, -0.27508935647362726, -0.06624933407503239, 0.052053786299013076, 0.27036468924439333, -0.11470447982998287, -0.13617834583558935, -0.02486299418230006, 0.11744153495640197, -0.06358304407764623, 0.04585696486855283, 0.13587140367227665, -0.11319659178719875, -0.079633552323472, 0.40465369555068775, -0.09016483128467138, -0.002960504765840287, 0.22103135099763327, -0.17629965112366258, -0.15469168725007393, 0.10950228796053202, 0.2725105962141397, 0.07951651244087422, -0.19756493943327286, 0.012842501144598615, 0.01955525939689672, 0.24679854643986898, 0.021592255860091523, 0.018299388634833567, 0.3835941017308134, 0.2160402361620614, 0.12544614583887953, 0.14768800025241094, -0.1597808163137512, -0.037879548654792476, -0.20963747171342045, -0.18328723265848895, -0.1172618155189334, 0.048259275915854154, -0.0008124713185292847, -0.1273186919186512, 0.370049736700318, 0.19593082074115567, 0.02940098986406117, -0.035014743024998525, 0.33852465646935903, -0.0672232581381785, 0.05930460081931124, -0.00830434641226175, 0.2736197266569163, 0.08046240938649057, 0.17124759508891307, -0.20596557487040124, 0.0590765069318103, -0.07409099145158332]
|
1,803.07164
|
Adversarial Generalized Method of Moments
|
We provide an approach for learning deep neural net representations of models
described via conditional moment restrictions. Conditional moment restrictions
are widely used, as they are the language by which social scientists describe
the assumptions they make to enable causal inference. We formulate the problem
of estimating the underling model as a zero-sum game between a modeler and an
adversary and apply adversarial training. Our approach is similar in nature to
Generative Adversarial Networks (GAN), though here the modeler is learning a
representation of a function that satisfies a continuum of moment conditions
and the adversary is identifying violating moments. We outline ways of
constructing effective adversaries in practice, including kernels centered by
k-means clustering, and random forests. We examine the practical performance of
our approach in the setting of non-parametric instrumental variable regression.
|
econ.EM cs.GT cs.LG math.ST stat.ML stat.TH
|
we provide an approach for learning deep neural net representations of models described via conditional moment restrictions conditional moment restrictions are widely used as they are the language by which social scientists describe the assumptions they make to enable causal inference we formulate the problem of estimating the underling model as a zerosum game between a modeler and an adversary and apply adversarial training our approach is similar in nature to generative adversarial networks gan though here the modeler is learning a representation of a function that satisfies a continuum of moment conditions and the adversary is identifying violating moments we outline ways of constructing effective adversaries in practice including kernels centered by kmeans clustering and random forests we examine the practical performance of our approach in the setting of nonparametric instrumental variable regression
|
[['we', 'provide', 'an', 'approach', 'for', 'learning', 'deep', 'neural', 'net', 'representations', 'of', 'models', 'described', 'via', 'conditional', 'moment', 'restrictions', 'conditional', 'moment', 'restrictions', 'are', 'widely', 'used', 'as', 'they', 'are', 'the', 'language', 'by', 'which', 'social', 'scientists', 'describe', 'the', 'assumptions', 'they', 'make', 'to', 'enable', 'causal', 'inference', 'we', 'formulate', 'the', 'problem', 'of', 'estimating', 'the', 'underling', 'model', 'as', 'a', 'zerosum', 'game', 'between', 'a', 'modeler', 'and', 'an', 'adversary', 'and', 'apply', 'adversarial', 'training', 'our', 'approach', 'is', 'similar', 'in', 'nature', 'to', 'generative', 'adversarial', 'networks', 'gan', 'though', 'here', 'the', 'modeler', 'is', 'learning', 'a', 'representation', 'of', 'a', 'function', 'that', 'satisfies', 'a', 'continuum', 'of', 'moment', 'conditions', 'and', 'the', 'adversary', 'is', 'identifying', 'violating', 'moments', 'we', 'outline', 'ways', 'of', 'constructing', 'effective', 'adversaries', 'in', 'practice', 'including', 'kernels', 'centered', 'by', 'kmeans', 'clustering', 'and', 'random', 'forests', 'we', 'examine', 'the', 'practical', 'performance', 'of', 'our', 'approach', 'in', 'the', 'setting', 'of', 'nonparametric', 'instrumental', 'variable', 'regression']]
|
[-0.03973413977438389, 0.022603713198601435, -0.11427714882084905, 0.15886474200854522, -0.13115923693090845, -0.18556549308001438, 0.058884261904020255, 0.43901111657293374, -0.2780155544377752, -0.31086246213361396, 0.06940544075280455, -0.2362220189464626, -0.21450527129111005, 0.12893790845609784, -0.13792541156759236, 0.08828989441033953, 0.053017606618188655, 0.022322860124404542, -0.01891423377500319, -0.29426391083319714, 0.33055679470217275, 0.034228727191733546, 0.28241539407702193, -0.013009828868071869, 0.14044188310169795, 0.028721182933772234, 0.0008229792270976216, 0.011953750993611652, -0.08768949919727105, 0.17292124221758196, 0.30227111916027033, 0.2272027481899861, 0.35712238583095207, -0.4253395520143711, -0.22666750607817476, 0.13779098925236336, 0.08750927956069389, 0.1239374124005423, -0.020300374154362883, -0.3261859819107105, 0.07254468351116043, -0.15797505107249565, -0.030830598867206432, -0.15596616394651025, -0.046274677196990195, 0.019350410484250135, -0.35760733945931156, 0.022012243803839003, 0.1235553928956723, 0.08155011461436082, -0.02660131496168784, -0.1109058575795046, 0.04827214509801272, 0.11849522048176558, 0.06274923985587683, 0.018559142339817394, 0.1331477529549999, -0.18411063102861075, -0.17748751236932048, 0.3351051221017851, -0.043952682806151125, -0.23071681823144466, 0.14875348219509, -0.02013895743345814, -0.17850882728208803, 0.025505833630102562, 0.24927546507192413, 0.1266624599542302, -0.19438579796080185, 0.08866899858630452, -0.04793026045819661, 0.1328797248555278, 0.026085802275729156, -0.012216467589292842, 0.17448065314726877, 0.20970469031225777, 0.07134067767591619, 0.15348814635749544, -0.09211763266279403, -0.09629844480416556, -0.27593560947744705, -0.10303737849011016, -0.20998358139212228, 0.02177793811137941, -0.13590567240295168, -0.18577619565914927, 0.3748337588092284, 0.23080995522175374, 0.19104779968663715, 0.12872511563464695, 0.3055829084947455, 0.0944545414965989, 0.052439621199659114, 0.11654558583812566, 0.1796986760237991, 0.13084967315732154, 0.06436751118805538, -0.13703288768988048, 0.1677646718053981, 0.053326080111897926]
|
1,803.07165
|
Dynamics of one-dimensional quantum droplets
|
The structure and dynamics of one-dimensional binary Bose gases forming
quantum droplets is studied by solving the corresponding amended
Gross-Pitaevskii equation. Two physically different regimes are identified,
corresponding to small droplets of an approximately Gaussian shape and large
`puddles' with a broad flat-top plateau. Small droplets collide
quasi-elastically, featuring the soliton-like behavior. On the other hand,
large colliding droplets may merge or suffer fragmentation, depending on their
relative velocity. The frequency of a breathing excited state of droplets, as
predicted by the dynamical variational approximation based on the Gaussian
ansatz, is found to be in good agreement with numerical results. Finally, the
stability diagram for a single droplet with respect to shape excitations with a
given wave number is drawn, being consistent with preservation of the Weber
number for large droplets.
|
cond-mat.quant-gas
|
the structure and dynamics of onedimensional binary bose gases forming quantum droplets is studied by solving the corresponding amended grosspitaevskii equation two physically different regimes are identified corresponding to small droplets of an approximately gaussian shape and large puddles with a broad flattop plateau small droplets collide quasielastically featuring the solitonlike behavior on the other hand large colliding droplets may merge or suffer fragmentation depending on their relative velocity the frequency of a breathing excited state of droplets as predicted by the dynamical variational approximation based on the gaussian ansatz is found to be in good agreement with numerical results finally the stability diagram for a single droplet with respect to shape excitations with a given wave number is drawn being consistent with preservation of the weber number for large droplets
|
[['the', 'structure', 'and', 'dynamics', 'of', 'onedimensional', 'binary', 'bose', 'gases', 'forming', 'quantum', 'droplets', 'is', 'studied', 'by', 'solving', 'the', 'corresponding', 'amended', 'grosspitaevskii', 'equation', 'two', 'physically', 'different', 'regimes', 'are', 'identified', 'corresponding', 'to', 'small', 'droplets', 'of', 'an', 'approximately', 'gaussian', 'shape', 'and', 'large', 'puddles', 'with', 'a', 'broad', 'flattop', 'plateau', 'small', 'droplets', 'collide', 'quasielastically', 'featuring', 'the', 'solitonlike', 'behavior', 'on', 'the', 'other', 'hand', 'large', 'colliding', 'droplets', 'may', 'merge', 'or', 'suffer', 'fragmentation', 'depending', 'on', 'their', 'relative', 'velocity', 'the', 'frequency', 'of', 'a', 'breathing', 'excited', 'state', 'of', 'droplets', 'as', 'predicted', 'by', 'the', 'dynamical', 'variational', 'approximation', 'based', 'on', 'the', 'gaussian', 'ansatz', 'is', 'found', 'to', 'be', 'in', 'good', 'agreement', 'with', 'numerical', 'results', 'finally', 'the', 'stability', 'diagram', 'for', 'a', 'single', 'droplet', 'with', 'respect', 'to', 'shape', 'excitations', 'with', 'a', 'given', 'wave', 'number', 'is', 'drawn', 'being', 'consistent', 'with', 'preservation', 'of', 'the', 'weber', 'number', 'for', 'large', 'droplets']]
|
[-0.1379567622940255, 0.22743558846620704, -0.10867646352196013, 0.03125766348289255, -0.040851634038427405, -0.163772045312101, -0.0035530713667652307, 0.33508693548417046, -0.21321846291650343, -0.28256569159233175, 0.055284191074937525, -0.2832517533932763, -0.06267466287498312, 0.17464616796435461, 0.001887081224713048, 0.08180097073231263, 0.05981049251934613, 0.008887204551315716, -0.0742270200564846, -0.19866566689692097, 0.3313706301664578, 0.02562447687618093, 0.2859731080945411, 0.014056441960643038, 0.08168616311141212, -0.040217402032114394, 0.05419736949838911, 0.053451245703969065, -0.18607714039963166, 0.054317722367193864, 0.2012084770169223, -0.004322828744531019, 0.2343319966440011, -0.44753167373021596, -0.2101318609353354, 0.058201456275406, 0.1780496945583354, 0.16216974807832077, -0.05979727868271551, -0.33346494218736233, 0.023548358639005486, -0.16188672192053485, -0.20741960515076194, -0.06342162448514736, 0.029646315290729242, 0.12122079887683325, -0.22590864130041655, 0.114377920060838, -0.0009219124423893603, 0.0249305548882183, -0.0718875573805839, -0.09536899421328522, -0.06436869981325452, 0.04929791999987917, 0.04248010726709573, 0.01091942842161098, 0.1556767940535459, -0.15925520266413348, -0.05076264707684403, 0.39453649615072683, -0.058126213460474606, -0.191552912489376, 0.2203039440472134, -0.1546533688732231, -0.035170013927463585, 0.23122827072613625, 0.15701770544885693, 0.09804133481509586, -0.06789294386750001, -0.017413284580706696, -0.06350967071171519, 0.18881817042489024, 0.12471423075953854, 0.013759179321108369, 0.24672136007886353, 0.18983237193684085, 0.0007510391305705518, 0.15342201597638472, -0.11321602495678679, -0.193284661062986, -0.25381390800173503, -0.07532873559358373, -0.21534381036909708, 0.01766029033729476, -0.10428442255009983, -0.20452444890926358, 0.3407855276711541, 0.04810066633228611, 0.24031476069327073, 0.03283819000641922, 0.23140301762276705, 0.12194698832783393, 0.021099371204636137, 0.05603142802511121, 0.23582296298802582, 0.137582546786071, 0.07410307108239761, -0.2568048715017352, 0.044729981935789226, 0.03420305754527279]
|
1,803.07166
|
Latent Space Modeling of Multidimensional Networks with Application to
the Exchange of Votes in Eurovision Song Contest
|
The Eurovision Song Contest is a popular TV singing competition held annually
among country members of the European Broadcasting Union. In this competition,
each member can be both contestant and jury, as it can participate with a song
and/or vote for other countries' tunes. Throughout the years, the voting system
has repeatedly been accused of being biased by the presence of tactical voting,
according to which votes would represent strategic interests rather than actual
musical preferences of the voting countries. In this work, we develop a latent
space model to investigate the presence of a latent structure underlying the
exchange of votes. Focusing on the period from 1998 to 2015, we represent the
vote exchange as a multivariate network: each edition is a network, where
countries are the nodes and two countries are linked by an edge if one voted
for the other. The different networks are taken to be independent replicates of
a common latent space capturing the overall relationships among the countries.
Proximity denotes similarity, and countries close in the latent space are
assumed to be more likely to exchange votes. Therefore, if the exchange of
votes depends on the similarity between countries, the quality of the competing
songs might not be a relevant factor in the determination of the voting
preferences, and this would suggest the presence of bias. A Bayesian
hierarchical modelling approach is employed to model the probability of a
connection between any two countries as a function of their distance in the
latent space, and of network-specific parameters and edge-specific covariates.
The inferred latent space is found to be relevant in the determination of edge
probabilities, however, the positions of the countries in such space only
partially correspond to their actual geographical positions.
|
stat.AP
|
the eurovision song contest is a popular tv singing competition held annually among country members of the european broadcasting union in this competition each member can be both contestant and jury as it can participate with a song andor vote for other countries tunes throughout the years the voting system has repeatedly been accused of being biased by the presence of tactical voting according to which votes would represent strategic interests rather than actual musical preferences of the voting countries in this work we develop a latent space model to investigate the presence of a latent structure underlying the exchange of votes focusing on the period from 1998 to 2015 we represent the vote exchange as a multivariate network each edition is a network where countries are the nodes and two countries are linked by an edge if one voted for the other the different networks are taken to be independent replicates of a common latent space capturing the overall relationships among the countries proximity denotes similarity and countries close in the latent space are assumed to be more likely to exchange votes therefore if the exchange of votes depends on the similarity between countries the quality of the competing songs might not be a relevant factor in the determination of the voting preferences and this would suggest the presence of bias a bayesian hierarchical modelling approach is employed to model the probability of a connection between any two countries as a function of their distance in the latent space and of networkspecific parameters and edgespecific covariates the inferred latent space is found to be relevant in the determination of edge probabilities however the positions of the countries in such space only partially correspond to their actual geographical positions
|
[['the', 'eurovision', 'song', 'contest', 'is', 'a', 'popular', 'tv', 'singing', 'competition', 'held', 'annually', 'among', 'country', 'members', 'of', 'the', 'european', 'broadcasting', 'union', 'in', 'this', 'competition', 'each', 'member', 'can', 'be', 'both', 'contestant', 'and', 'jury', 'as', 'it', 'can', 'participate', 'with', 'a', 'song', 'andor', 'vote', 'for', 'other', 'countries', 'tunes', 'throughout', 'the', 'years', 'the', 'voting', 'system', 'has', 'repeatedly', 'been', 'accused', 'of', 'being', 'biased', 'by', 'the', 'presence', 'of', 'tactical', 'voting', 'according', 'to', 'which', 'votes', 'would', 'represent', 'strategic', 'interests', 'rather', 'than', 'actual', 'musical', 'preferences', 'of', 'the', 'voting', 'countries', 'in', 'this', 'work', 'we', 'develop', 'a', 'latent', 'space', 'model', 'to', 'investigate', 'the', 'presence', 'of', 'a', 'latent', 'structure', 'underlying', 'the', 'exchange', 'of', 'votes', 'focusing', 'on', 'the', 'period', 'from', '1998', 'to', '2015', 'we', 'represent', 'the', 'vote', 'exchange', 'as', 'a', 'multivariate', 'network', 'each', 'edition', 'is', 'a', 'network', 'where', 'countries', 'are', 'the', 'nodes', 'and', 'two', 'countries', 'are', 'linked', 'by', 'an', 'edge', 'if', 'one', 'voted', 'for', 'the', 'other', 'the', 'different', 'networks', 'are', 'taken', 'to', 'be', 'independent', 'replicates', 'of', 'a', 'common', 'latent', 'space', 'capturing', 'the', 'overall', 'relationships', 'among', 'the', 'countries', 'proximity', 'denotes', 'similarity', 'and', 'countries', 'close', 'in', 'the', 'latent', 'space', 'are', 'assumed', 'to', 'be', 'more', 'likely', 'to', 'exchange', 'votes', 'therefore', 'if', 'the', 'exchange', 'of', 'votes', 'depends', 'on', 'the', 'similarity', 'between', 'countries', 'the', 'quality', 'of', 'the', 'competing', 'songs', 'might', 'not', 'be', 'a', 'relevant', 'factor', 'in', 'the', 'determination', 'of', 'the', 'voting', 'preferences', 'and', 'this', 'would', 'suggest', 'the', 'presence', 'of', 'bias', 'a', 'bayesian', 'hierarchical', 'modelling', 'approach', 'is', 'employed', 'to', 'model', 'the', 'probability', 'of', 'a', 'connection', 'between', 'any', 'two', 'countries', 'as', 'a', 'function', 'of', 'their', 'distance', 'in', 'the', 'latent', 'space', 'and', 'of', 'networkspecific', 'parameters', 'and', 'edgespecific', 'covariates', 'the', 'inferred', 'latent', 'space', 'is', 'found', 'to', 'be', 'relevant', 'in', 'the', 'determination', 'of', 'edge', 'probabilities', 'however', 'the', 'positions', 'of', 'the', 'countries', 'in', 'such', 'space', 'only', 'partially', 'correspond', 'to', 'their', 'actual', 'geographical', 'positions']]
|
[-0.10234227899428147, 0.09401864747305934, -0.07218292204721163, 0.09351415871795601, -0.12144094826347455, -0.1395256080210312, 0.13416530448414876, 0.38400102308129563, -0.2674363784018298, -0.32239205722461833, 0.07538136607156841, -0.3225839037035679, -0.1289099554779414, 0.11980006298425713, -0.10429438445024244, -0.03926198175547574, 0.04516884608127364, 0.07936838530906344, -0.001536977031045822, -0.3195192162906203, 0.3160425260756487, 0.04752691416311558, 0.297366259684045, -0.02765568873642019, 0.0620100150580895, 0.02305808456882087, -0.08033587612124292, 0.01777477465667355, -0.06571719657176957, 0.1539641339323809, 0.329979797789769, 0.15355739865153864, 0.3553056196772065, -0.37120441670906584, -0.18076432677417684, 0.1279675151164757, 0.07016929106667612, 0.052754953835130534, 0.06526934259600742, -0.3217163850202074, 0.021694638900689227, -0.21453006500797184, -0.04859786119737427, -0.04293246169302252, 0.04053195816654854, 0.04787792688901101, -0.26109429809468665, 0.06450232965420533, -0.0020537309740931054, 0.04614658329867884, -0.038941456668826535, -0.12359363279687273, -0.07173356473297654, 0.22547568505707238, 0.07535981782389785, 0.008107163435795624, 0.1260671657703456, -0.13602997871860217, -0.13838874715602728, 0.3949963720398552, 0.006634820808298405, -0.1538976504158061, 0.16457130305672862, -0.12160022178774371, -0.13873455557121434, 0.051126652722694885, 0.20861885358602014, 0.05923570884997106, -0.16993428666203422, -0.005001200425477254, -0.0966207055064002, 0.17368454772658376, 0.07897686240324513, -0.022955705008911014, 0.23947843318244372, 0.16059655661027633, 0.07341046212321618, 0.07720973300441429, -0.09115504795704746, -0.1385454453486034, -0.20390056178721383, -0.13669870770939185, -0.18169994982101256, -0.019461230206443077, -0.11405815446665139, -0.15531172215371397, 0.41473916534472993, 0.1303995707069095, 0.20357792558805907, -0.005169643270041936, 0.23909180644886716, 0.0460506005862818, 0.08123439629659883, 0.0953659755790084, 0.20248095514768394, 0.04175288791310648, 0.10173811856335009, -0.15391913009404645, 0.21787226172228533, 0.018469108565900616]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.