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.06267
|
Consistent sets of lines with no colorful incidence
|
We consider incidences among colored sets of lines in $\mathbb{R}^d$ and
examine whether the existence of certain concurrences between lines of $k$
colors force the existence of at least one concurrence between lines of $k+1$
colors. This question is relevant for problems in 3D reconstruction in computer
vision.
|
cs.CG cs.CV math.CO
|
we consider incidences among colored sets of lines in mathbbrd and examine whether the existence of certain concurrences between lines of k colors force the existence of at least one concurrence between lines of k1 colors this question is relevant for problems in 3d reconstruction in computer vision
|
[['we', 'consider', 'incidences', 'among', 'colored', 'sets', 'of', 'lines', 'in', 'mathbbrd', 'and', 'examine', 'whether', 'the', 'existence', 'of', 'certain', 'concurrences', 'between', 'lines', 'of', 'k', 'colors', 'force', 'the', 'existence', 'of', 'at', 'least', 'one', 'concurrence', 'between', 'lines', 'of', 'k1', 'colors', 'this', 'question', 'is', 'relevant', 'for', 'problems', 'in', '3d', 'reconstruction', 'in', 'computer', 'vision']]
|
[-0.17974227387458086, 0.10002270810461293, -0.004634048566610242, 0.027242918537619214, 0.023377493266404297, -0.18603751560052237, 0.03232820993677402, 0.388487698432679, -0.23717459997472665, -0.3375275996901716, 0.01569581166889596, -0.33127258834429085, -0.1014704160625115, 0.14362202860259762, -0.0762350905764227, -0.011682226128565768, 0.044029889608888574, 0.024493849196005613, -0.015484928211662918, -0.28814994759644225, 0.3382567578810267, -0.11636586598857927, 0.19931995390409915, 0.07805464439055261, 0.030283670697826892, -0.0004151164709279935, 0.004476816859096289, 0.03715601629422357, -0.17516613790454963, 0.09894345123514843, 0.3053705695589694, 0.19837363273836672, 0.25603317978554213, -0.37162095203530043, -0.1705174406330722, 0.2077679312399899, 0.12493212001087765, 0.04787798534380272, 0.016880201602665085, -0.21344295695113638, 0.07363195382155634, 0.03382769789701948, -0.145104734391983, 0.030913586194704596, 0.13107210960394391, 0.004526511310056473, -0.24444503523409367, 0.0617102516698651, 0.04684956438237956, 0.17613019191776402, -0.007208465947769582, -0.10964225902959394, -0.029219526768429205, 0.152687909353214, 0.0024163898609306975, 0.0008778163270714382, 0.019766217902846012, -0.2235093512911893, -0.16420536026513824, 0.3878938361691932, -0.018928921897895634, -0.1604277776204981, 0.21598131931386888, -0.13701560097979382, -0.16489817399997264, 0.11853386283231278, 0.16861720146456113, 0.14958582694331804, -0.1003831386139306, 0.061460651747135366, -0.12647381509304978, 0.11440515723855545, 0.18255871817624816, 0.053315396425508275, 0.2480059071094729, 0.06135284958872944, 0.1274688113674832, 0.1888583363094464, -0.0869743049746224, -0.0215580531124336, -0.3187072376604192, -0.1342985169030726, -0.19861765407646695, 0.0331622836868822, -0.1262617250901409, -0.14560909456728646, 0.37093807857794064, 0.17641938998713158, 0.22475006276120743, 0.004422015064240743, 0.28528789174742997, 0.04439254203073991, -0.00981239955096195, 0.08821383831673302, 0.17868423661760366, 0.16800158866681159, 0.020652406577331323, -0.234855992612817, 0.007026448457812269, 0.1530544037814252]
|
1,803.06268
|
On the critical energy required for homogeneous nucleation in bubble
chambers employed in dark matter searches
|
Two equations for the calculation of the critical energy required for
homogeneous nucleation in a superheated liquid, and the related critical radius
of the nucleated vapour bubble, are obtained, the former by the direct
application of the first law of thermodynamics, the latter by considering that
the bubble formation implies the overcoming of a barrier of the free enthalpy
potential. Comparisons with the currently used relationships demonstrate that
the sensitivity of the bubble chambers employed in dark matter searches can be
sometimes notably overestimated.
|
hep-ex hep-ph
|
two equations for the calculation of the critical energy required for homogeneous nucleation in a superheated liquid and the related critical radius of the nucleated vapour bubble are obtained the former by the direct application of the first law of thermodynamics the latter by considering that the bubble formation implies the overcoming of a barrier of the free enthalpy potential comparisons with the currently used relationships demonstrate that the sensitivity of the bubble chambers employed in dark matter searches can be sometimes notably overestimated
|
[['two', 'equations', 'for', 'the', 'calculation', 'of', 'the', 'critical', 'energy', 'required', 'for', 'homogeneous', 'nucleation', 'in', 'a', 'superheated', 'liquid', 'and', 'the', 'related', 'critical', 'radius', 'of', 'the', 'nucleated', 'vapour', 'bubble', 'are', 'obtained', 'the', 'former', 'by', 'the', 'direct', 'application', 'of', 'the', 'first', 'law', 'of', 'thermodynamics', 'the', 'latter', 'by', 'considering', 'that', 'the', 'bubble', 'formation', 'implies', 'the', 'overcoming', 'of', 'a', 'barrier', 'of', 'the', 'free', 'enthalpy', 'potential', 'comparisons', 'with', 'the', 'currently', 'used', 'relationships', 'demonstrate', 'that', 'the', 'sensitivity', 'of', 'the', 'bubble', 'chambers', 'employed', 'in', 'dark', 'matter', 'searches', 'can', 'be', 'sometimes', 'notably', 'overestimated']]
|
[-0.08653884993622168, 0.15904696874453553, -0.09702375996857882, 0.07913693690872085, -0.00038763454705033275, -0.07516612920777074, 0.06120461791579146, 0.2690416034311056, -0.23179485123338445, -0.3255817588596117, 0.11512176866693023, -0.24839493148915825, -0.06046755549253985, 0.19448349227951395, 0.0352796873817819, 0.04681230276556952, -0.0060826678804698445, 0.022775967774491403, -0.04574052723667895, -0.2254581773138073, 0.3122786119846361, 0.07832791819237173, 0.276371154623727, 0.10983375346265911, 0.05378473961138211, -0.05290841069238793, -0.045341717156892024, 0.04595224298758521, -0.21763608316489677, 0.09665654034775105, 0.21214905767036335, 0.044054484427241344, 0.21579696659630695, -0.47212083398231436, -0.2387989729953309, 0.10752756428527868, 0.14113714211686915, 0.08277350877012525, -0.10041802007305835, -0.26231844286390005, 0.028578825139751036, -0.17982870037667453, -0.1871170542404971, -0.005944671308887857, -0.02155564019908308, 0.06372078691042372, -0.20917173876382766, 0.13513566386176362, 0.02288431374888335, -0.02463370873149307, -0.1019683400047056, -0.11127344035499152, -0.04161276528611779, 0.07425992073313821, 0.05114177808198812, -0.010973161123859296, 0.2099684922889407, -0.18814921901364523, -0.07745440934585142, 0.40651953497546767, -0.06513474627752744, -0.12240859974796574, 0.17796740272370654, -0.15972001866681412, -0.0628293601219498, 0.19457748971018146, 0.06441964503721379, 0.10351483771825899, -0.13456793212597923, 0.05596351694423772, 0.017037992311608314, 0.14594252046108955, 0.11470229167025536, -0.04302407662561607, 0.25049838645749595, 0.20644162448921374, 0.049612564411723896, 0.13910727695301398, -0.11579560662531072, -0.1321683298197708, -0.34329186040642007, -0.20047618400227898, -0.1902541945067545, -0.012232234679339897, -0.12169050578657854, -0.15047783307021573, 0.3303340563905381, 0.1065549842203923, 0.13777449246983797, -0.029008042372186623, 0.2682150301878296, 0.08287684426509909, 0.08735100065712773, 0.023802256566428003, 0.3106901062641382, 0.12569710177679858, 0.10968288879043289, -0.27011669107845854, 0.09099517710551265, 0.05068738489145679]
|
1,803.06269
|
Crystal growth in nano-confinement: Subcritical cavity formation and
viscosity effects
|
We report on the modeling of the formation of a cavity at the surface of
crystals confined by a flat wall during growth in solution. Using a continuum
thin film model, we discuss two phenomena that could be observed when
decreasing the thickness of the liquid film between the crystal and the wall
down to the nanoscale. First, in the presence of an attractive van der Waals
contribution to the disjoining pressure, the formation of the cavity becomes
sub-critical, i.e., discontinuous. In addition, there is a minimum
supersaturation required to form a cavity. Second, when the thickness of the
liquid film between the crystal and the substrate reaches the nanoscale,
viscosity becomes relevant and hinders the formation of the cavity. We
demonstrate that there is a critical value of the viscosity above which no
cavity will form. The critical viscosity increases as the square of the
thickness of the liquid film. A quantitative discussion of model materials such
as Calcite, Sodium Chlorate, Glucose and Sucrose is provided.
|
cond-mat.soft
|
we report on the modeling of the formation of a cavity at the surface of crystals confined by a flat wall during growth in solution using a continuum thin film model we discuss two phenomena that could be observed when decreasing the thickness of the liquid film between the crystal and the wall down to the nanoscale first in the presence of an attractive van der waals contribution to the disjoining pressure the formation of the cavity becomes subcritical ie discontinuous in addition there is a minimum supersaturation required to form a cavity second when the thickness of the liquid film between the crystal and the substrate reaches the nanoscale viscosity becomes relevant and hinders the formation of the cavity we demonstrate that there is a critical value of the viscosity above which no cavity will form the critical viscosity increases as the square of the thickness of the liquid film a quantitative discussion of model materials such as calcite sodium chlorate glucose and sucrose is provided
|
[['we', 'report', 'on', 'the', 'modeling', 'of', 'the', 'formation', 'of', 'a', 'cavity', 'at', 'the', 'surface', 'of', 'crystals', 'confined', 'by', 'a', 'flat', 'wall', 'during', 'growth', 'in', 'solution', 'using', 'a', 'continuum', 'thin', 'film', 'model', 'we', 'discuss', 'two', 'phenomena', 'that', 'could', 'be', 'observed', 'when', 'decreasing', 'the', 'thickness', 'of', 'the', 'liquid', 'film', 'between', 'the', 'crystal', 'and', 'the', 'wall', 'down', 'to', 'the', 'nanoscale', 'first', 'in', 'the', 'presence', 'of', 'an', 'attractive', 'van', 'der', 'waals', 'contribution', 'to', 'the', 'disjoining', 'pressure', 'the', 'formation', 'of', 'the', 'cavity', 'becomes', 'subcritical', 'ie', 'discontinuous', 'in', 'addition', 'there', 'is', 'a', 'minimum', 'supersaturation', 'required', 'to', 'form', 'a', 'cavity', 'second', 'when', 'the', 'thickness', 'of', 'the', 'liquid', 'film', 'between', 'the', 'crystal', 'and', 'the', 'substrate', 'reaches', 'the', 'nanoscale', 'viscosity', 'becomes', 'relevant', 'and', 'hinders', 'the', 'formation', 'of', 'the', 'cavity', 'we', 'demonstrate', 'that', 'there', 'is', 'a', 'critical', 'value', 'of', 'the', 'viscosity', 'above', 'which', 'no', 'cavity', 'will', 'form', 'the', 'critical', 'viscosity', 'increases', 'as', 'the', 'square', 'of', 'the', 'thickness', 'of', 'the', 'liquid', 'film', 'a', 'quantitative', 'discussion', 'of', 'model', 'materials', 'such', 'as', 'calcite', 'sodium', 'chlorate', 'glucose', 'and', 'sucrose', 'is', 'provided']]
|
[-0.136192438680634, 0.1736864213460344, -0.04951268060601311, -0.04569877937371971, -0.01730171853152221, -0.10896023365384537, 0.05423576947549793, 0.3517528550077542, -0.2639183248253818, -0.2732446079949631, 0.0814133282851227, -0.29823943915146733, -0.10557334950963358, 0.18301406179270344, 0.006032833570898873, 0.03843953502280805, -0.03803465688185666, -0.028990529416251683, -0.05627495203373541, -0.17010956589679072, 0.2961071413930528, 0.03802494834453247, 0.3026984161390605, 0.1515372959760291, 0.08149136295597889, -0.05832136976734361, 0.09990837244584622, 0.04517708872974722, -0.2170202946796641, 0.05576686571703521, 0.21074908788170957, -0.05968693748373025, 0.2852811643151109, -0.4714965406515284, -0.21335210147018205, 0.0338028372959185, 0.11152546180371742, 0.13629347818951026, -0.07280765823018877, -0.21056764726499153, 0.036613322953375695, -0.12814034011722458, -0.15325381098493576, 0.0059916529620434355, 0.018031767630826926, 0.016368976700597882, -0.2182005567822611, 0.10962228559816402, 0.06950308909098768, 0.04505184681494971, -0.11159914111283546, -0.07958520098706473, -0.09669457790636998, 0.09162860991423503, 0.05209547882721185, 0.04148240834139957, 0.2192970568308618, -0.2015580515322153, 0.0014053437005572334, 0.39246974928962614, -0.07370127853588898, -0.11371460926445748, 0.20594913609504342, -0.179810216766085, 0.00011531741990607433, 0.1785402892068207, 0.1298223222406514, 0.0735748693581202, -0.09237249861251769, 0.03744899108866508, -0.024689235978252337, 0.2563801601649022, 0.11738582370903142, -0.03173297171656622, 0.24547642559749994, 0.283147485410895, 0.042593776468678325, 0.1977085534331227, -0.12223149085289124, -0.04354645470770711, -0.2858668616610373, -0.22526529924330596, -0.1841173543968422, 0.022598787224823665, -0.12391270042646643, -0.24163057545233452, 0.34120690628668726, 0.09703603208421947, 0.15369724314436764, -0.021578015892732956, 0.23841775537044657, 0.08700454572855612, 0.06891345996465423, 0.011364668487810982, 0.3142818743139952, 0.14795311694842078, 0.12491275526976707, -0.29443452957181765, 0.08506951009586988, 0.024926848224403258]
|
1,803.0627
|
Dirichlet problems for fully nonlinear equations with \lq subquadratic
\lq Hamiltonians
|
For a class of fully nonlinear equations having second order operators which
may be singular or degenerate when the gradient of the solutions vanishes, and
having first order terms with power growth, we prove the existence and
uniqueness of suitably defined viscosity solution of Dirichlet problem and we
further show that it is a Lipschitz continuous function.
|
math.AP
|
for a class of fully nonlinear equations having second order operators which may be singular or degenerate when the gradient of the solutions vanishes and having first order terms with power growth we prove the existence and uniqueness of suitably defined viscosity solution of dirichlet problem and we further show that it is a lipschitz continuous function
|
[['for', 'a', 'class', 'of', 'fully', 'nonlinear', 'equations', 'having', 'second', 'order', 'operators', 'which', 'may', 'be', 'singular', 'or', 'degenerate', 'when', 'the', 'gradient', 'of', 'the', 'solutions', 'vanishes', 'and', 'having', 'first', 'order', 'terms', 'with', 'power', 'growth', 'we', 'prove', 'the', 'existence', 'and', 'uniqueness', 'of', 'suitably', 'defined', 'viscosity', 'solution', 'of', 'dirichlet', 'problem', 'and', 'we', 'further', 'show', 'that', 'it', 'is', 'a', 'lipschitz', 'continuous', 'function']]
|
[-0.1464054695771713, 0.07427473401389363, -0.06744768030189893, 0.0010662616634937493, -0.10566618507973065, -0.10894325609204539, -0.03290570012636875, 0.2981158040153484, -0.3508670394096458, -0.21256024596330367, 0.19729514746403878, -0.2868761349665491, -0.15057798408445688, 0.1375329630212499, -0.02219250085845328, 0.11374014593137984, 0.03708707309213646, 0.048567467197579775, -0.09731147116818056, -0.2587528939505941, 0.42171110395799605, -0.07477414862889993, 0.20615835672473176, 0.07185198925435543, 0.15401265128074507, -0.0568248017347957, 0.04200764470161837, 0.06894357232867103, -0.13771673019124264, 0.1026199464992571, 0.22857631528913452, 0.03868468366808405, 0.33771485462784767, -0.38501253302552196, -0.20192052450096398, 0.1946269881405067, 0.10537615472352818, 0.06342571077402681, -0.03531803388818445, -0.23711022398058781, 0.15246992737969808, -0.14850897168773308, -0.19721261607156249, -0.11375787092797589, -0.02175411049341946, 0.08865223425387389, -0.35771134861728604, 0.13015785899111315, 0.11504434422475465, -0.015076073507467905, -0.16536199021267525, -0.045588916118599866, -0.05774809713393711, 0.07372797698266559, 0.06305436351287522, 0.016598217834702188, 0.013448460607609729, -0.13658056592797502, -0.0712355579037154, 0.344013772141025, -0.10781155705958474, -0.2871671882049556, 0.15848775717772937, -0.16093212675728036, -0.09368588639782709, 0.08160502192351901, 0.15795156471594646, 0.197949708970427, -0.1084168072304333, 0.136349261482042, -0.030061013318532913, 0.1536851508967709, 0.09894623293688423, 0.0019467289298119252, 0.12303732945011896, 0.12027537140161976, 0.1988251442007982, 0.15640775298724244, 0.007108615057771666, -0.0891166539830074, -0.36792718277623254, -0.17744126859970652, -0.1508640089121304, 0.1078426160424817, -0.11129677148557293, -0.24615836048727496, 0.39294444109525595, 0.06610109569839806, 0.18219038587586397, 0.12667916017674366, 0.23140997952667244, 0.2625742617733123, 0.01920582262570398, 0.09750076409698905, 0.2018403526755017, 0.12631952006108405, 0.09542671015910935, -0.18674646488343888, 0.07984260354485166, 0.14896391047851035]
|
1,803.06271
|
Maximal ideals in rings of real measurable functions
|
Let $ M (X)$ be the ring of all real measurable functions on a measurable
space $(X, \mathscr{A})$. In this article, we show that every ideal of $M(X)$
is a $Z^{\circ}$-ideal. Also, we give several characterizations of maximal
ideals of $M(X)$, mostly in terms of certain lattice-theoretic properties of
$\mathscr{A}$. The notion of $T$-measurable space is introduced. Next, we show
that for every measurable space $(X,\mathscr{A})$ there exists a $T$-measurable
space $(Y,\mathscr{A}^{\prime})$ such that $M(X)\cong M(Y)$ as rings. The
notion of compact measurable space is introduced. Next, we prove that if $(X,
\mathscr{A})$ and $(Y, \mathfrak{M^{\prime}})$ are two compact $T$-measurable
spaces, then $X\cong Y$ as measurable spaces if and only if $M(X)\cong M (Y)$
as rings.
|
math.GN math.FA
|
let m x be the ring of all real measurable functions on a measurable space x mathscra in this article we show that every ideal of mx is a zcircideal also we give several characterizations of maximal ideals of mx mostly in terms of certain latticetheoretic properties of mathscra the notion of tmeasurable space is introduced next we show that for every measurable space xmathscra there exists a tmeasurable space ymathscraprime such that mxcong my as rings the notion of compact measurable space is introduced next we prove that if x mathscra and y mathfrakmprime are two compact tmeasurable spaces then xcong y as measurable spaces if and only if mxcong m y as rings
|
[['let', 'm', 'x', 'be', 'the', 'ring', 'of', 'all', 'real', 'measurable', 'functions', 'on', 'a', 'measurable', 'space', 'x', 'mathscra', 'in', 'this', 'article', 'we', 'show', 'that', 'every', 'ideal', 'of', 'mx', 'is', 'a', 'zcircideal', 'also', 'we', 'give', 'several', 'characterizations', 'of', 'maximal', 'ideals', 'of', 'mx', 'mostly', 'in', 'terms', 'of', 'certain', 'latticetheoretic', 'properties', 'of', 'mathscra', 'the', 'notion', 'of', 'tmeasurable', 'space', 'is', 'introduced', 'next', 'we', 'show', 'that', 'for', 'every', 'measurable', 'space', 'xmathscra', 'there', 'exists', 'a', 'tmeasurable', 'space', 'ymathscraprime', 'such', 'that', 'mxcong', 'my', 'as', 'rings', 'the', 'notion', 'of', 'compact', 'measurable', 'space', 'is', 'introduced', 'next', 'we', 'prove', 'that', 'if', 'x', 'mathscra', 'and', 'y', 'mathfrakmprime', 'are', 'two', 'compact', 'tmeasurable', 'spaces', 'then', 'xcong', 'y', 'as', 'measurable', 'spaces', 'if', 'and', 'only', 'if', 'mxcong', 'm', 'y', 'as', 'rings']]
|
[-0.19121617756106637, 0.14211719579656015, -0.06071877655869519, 0.07050878111146051, -0.044598306905986235, -0.10559006162749773, -0.0243847485314208, 0.41499805074523793, -0.3278213600543412, -0.12528569370148365, 0.10174170120153576, -0.2512294878759845, -0.13991727026348763, 0.21461124404502863, -0.1405681601090526, -0.06969680214216085, 0.040923268847506154, 0.10675337755925615, -0.14206631981175055, -0.29555743028494447, 0.4102139218287034, -0.09328965133225375, 0.14294905829328028, 0.01730485906671013, 0.17709782357242973, 0.014669896725734526, 0.006334651159969243, 0.07523501821110999, -0.21701010847596494, 0.12264349325983362, 0.27581284051253036, 0.15180956431114198, 0.2706586971886943, -0.291547936410114, -0.13652129361659965, 0.2534690537320619, 0.07936990914696997, -0.12026526019485159, -0.02000526619799943, -0.25468870043246583, 0.15797341600568457, -0.16344037091528826, -0.0906331102956425, -0.0954799756323072, 0.1644516015901569, 0.047141549626195975, -0.2944493004798212, -0.05981146169387185, 0.13460472663017836, 0.0469386326149106, -0.04748548309064724, -0.08948846863244067, -0.12287773443385959, 0.051310448928482154, -0.03737971410790289, 0.13137204835445365, 0.07903484651205045, 0.003979447469199923, -0.10992397778159516, 0.36390880453823643, -0.1160655440254645, -0.22389470928094604, 0.11278055911375717, -0.264489127212966, -0.15816303371790458, 0.08668934990736571, 0.07575251417742535, 0.1705015282569961, -0.06283878651870922, 0.22865437501935626, -0.20947351284663784, 0.11100932423829693, 0.08910277419384907, 0.11976028296419165, 0.1499936813657934, 0.11755574873902581, 0.14544059064011725, 0.08285776342328807, -0.004127191640013321, 0.082749959459232, -0.4107317676090381, -0.2412172023545612, -0.17375448024514215, 0.1293774876489558, -0.051812012258398515, -0.1675032309764488, 0.2898284299256788, 0.09507329542274502, 0.21212843460115519, 0.04759821451523087, 0.19406575774668122, 0.03626137258252129, 0.006418011098338122, 0.06013936896766112, 0.08038992955434052, 0.16060916942290285, 0.0027038570027798415, -0.06833861883814361, 0.03595353476914831, 0.14896277739581737]
|
1,803.06272
|
Graph Partition Neural Networks for Semi-Supervised Classification
|
We present graph partition neural networks (GPNN), an extension of graph
neural networks (GNNs) able to handle extremely large graphs. GPNNs alternate
between locally propagating information between nodes in small subgraphs and
globally propagating information between the subgraphs. To efficiently
partition graphs, we experiment with several partitioning algorithms and also
propose a novel variant for fast processing of large scale graphs. We
extensively test our model on a variety of semi-supervised node classification
tasks. Experimental results indicate that GPNNs are either superior or
comparable to state-of-the-art methods on a wide variety of datasets for
graph-based semi-supervised classification. We also show that GPNNs can achieve
similar performance as standard GNNs with fewer propagation steps.
|
cs.LG stat.ML
|
we present graph partition neural networks gpnn an extension of graph neural networks gnns able to handle extremely large graphs gpnns alternate between locally propagating information between nodes in small subgraphs and globally propagating information between the subgraphs to efficiently partition graphs we experiment with several partitioning algorithms and also propose a novel variant for fast processing of large scale graphs we extensively test our model on a variety of semisupervised node classification tasks experimental results indicate that gpnns are either superior or comparable to stateoftheart methods on a wide variety of datasets for graphbased semisupervised classification we also show that gpnns can achieve similar performance as standard gnns with fewer propagation steps
|
[['we', 'present', 'graph', 'partition', 'neural', 'networks', 'gpnn', 'an', 'extension', 'of', 'graph', 'neural', 'networks', 'gnns', 'able', 'to', 'handle', 'extremely', 'large', 'graphs', 'gpnns', 'alternate', 'between', 'locally', 'propagating', 'information', 'between', 'nodes', 'in', 'small', 'subgraphs', 'and', 'globally', 'propagating', 'information', 'between', 'the', 'subgraphs', 'to', 'efficiently', 'partition', 'graphs', 'we', 'experiment', 'with', 'several', 'partitioning', 'algorithms', 'and', 'also', 'propose', 'a', 'novel', 'variant', 'for', 'fast', 'processing', 'of', 'large', 'scale', 'graphs', 'we', 'extensively', 'test', 'our', 'model', 'on', 'a', 'variety', 'of', 'semisupervised', 'node', 'classification', 'tasks', 'experimental', 'results', 'indicate', 'that', 'gpnns', 'are', 'either', 'superior', 'or', 'comparable', 'to', 'stateoftheart', 'methods', 'on', 'a', 'wide', 'variety', 'of', 'datasets', 'for', 'graphbased', 'semisupervised', 'classification', 'we', 'also', 'show', 'that', 'gpnns', 'can', 'achieve', 'similar', 'performance', 'as', 'standard', 'gnns', 'with', 'fewer', 'propagation', 'steps']]
|
[-0.08712685308048287, 0.01538669284697379, -0.032309477592497006, 0.08429015764092977, -0.12884972613836448, -0.1741007002280712, 0.030083312527317784, 0.49535262683587794, -0.2758065965109035, -0.3563741317613306, 0.06505936269949199, -0.27482495660506256, -0.21107586075250984, 0.19421361640211096, -0.11004674746819763, 0.07596194377350332, 0.20403860728112172, 0.04312289943011988, -0.029560209305511904, -0.2720141159561133, 0.2569633930060287, 0.022733590461569222, 0.33844400747819287, 0.05317629287349044, 0.10443610764125082, -0.030033689678391127, 0.017854959421700477, 0.07924204918893829, -0.07380124615503793, 0.14155454740373302, 0.31248865507345286, 0.18092886077802098, 0.26783950580696086, -0.4386420503662553, -0.23392792655344624, 0.18077522028542528, 0.16588907500737207, 0.12379063640433195, -0.035107039139746166, -0.31025001650420636, 0.13027741254381506, -0.1565754701820227, 0.04663121786001509, -0.17556829232953292, -0.019473364333564464, 0.019845588790022035, -0.27576615022437695, 0.018558634502248657, 0.05474389181884451, 0.03368313807532587, 0.026716815616803623, -0.12073887200135969, 0.04136598677028267, 0.10817969479779424, -0.03689122094620283, 0.0603601456407573, 0.08044770659994235, -0.15282040004478356, -0.22161868709114801, 0.3213421680626616, -0.07182726897381708, -0.20442694550858134, 0.24252965870783127, -0.01789274460515543, -0.20227351914102262, 0.08668444933682944, 0.2692272103375104, 0.1529017987009962, -0.13302294224030875, -0.0023456813769612826, -0.068744997403263, 0.16703095379392657, 0.05619509567185182, 0.01274694048011968, 0.13814672287265087, 0.2612960780435036, 0.09920310055161208, 0.1742501695644506, -0.09104714282186685, -0.05860213362570621, -0.2000113780140481, -0.0747901236275788, -0.20366139607339173, -0.019890863827503887, -0.20858865507761948, -0.19843536762487704, 0.4194014956927405, 0.20624089270286197, 0.22369349115750695, 0.14960603692478178, 0.3077660930235829, -0.03936214565785717, 0.11699246634127555, 0.1704818301595154, 0.12370122252320624, 0.08346057057677381, 0.05295357034764195, -0.13396862197040985, 0.03048889131689098, 0.0613589463096145]
|
1,803.06273
|
Donor and Acceptor Characteristics of Native Point Defects in GaN
|
The semiconducting behaviour and optoelectronic response of gallium nitride
is governed by point defect processes, which, despite many years of research,
remain poorly understood. The key difficulty in the description of the dominant
charged defects is determining a consistent position of the corresponding
defect levels, which is difficult to derive using standard supercell
calculations. In a complementary approach, we take advantage of the embedded
cluster methodology that provides direct access to a common zero of the
electrostatic potential for all point defects in all charge states. Charged
defects polarise a host dielectric material with long-range forces that
strongly affect the outcome of defect simulations; to account for the
polarisation we couple embedding with the hybrid quantum mechanical/molecular
mechanical (QM/MM) approach and investigate the structure, formation and
ionisation energies, and equilibrium concentrations of native point defects in
wurtzite GaN at a chemically accurate hybrid-density-functional-theory level. N
vacancies are the most thermodynamically favourable native defects in GaN,
which contribute to the n-type character of as-grown GaN but are not the main
source, a result that is consistent with experiment. Our calculations show no
native point defects can form thermodynamically stable acceptor states. GaN can
be easily doped n-type, but, in equilibrium conditions at moderate temperatures
acceptor dopants will be compensated by N vacancies and no significant hole
concentrations will be observed, indicating non-equilibrium processes must
dominate in p-type GaN. We identify spectroscopic signatures of native defects
in the infrared, visible and ultraviolet luminescence ranges and complementary
spectroscopies. Crucially, we calculate the effective-mass-like-state levels
associated with electrons and holes bound in diffuse orbitals...
|
cond-mat.mtrl-sci
|
the semiconducting behaviour and optoelectronic response of gallium nitride is governed by point defect processes which despite many years of research remain poorly understood the key difficulty in the description of the dominant charged defects is determining a consistent position of the corresponding defect levels which is difficult to derive using standard supercell calculations in a complementary approach we take advantage of the embedded cluster methodology that provides direct access to a common zero of the electrostatic potential for all point defects in all charge states charged defects polarise a host dielectric material with longrange forces that strongly affect the outcome of defect simulations to account for the polarisation we couple embedding with the hybrid quantum mechanicalmolecular mechanical qmmm approach and investigate the structure formation and ionisation energies and equilibrium concentrations of native point defects in wurtzite gan at a chemically accurate hybriddensityfunctionaltheory level n vacancies are the most thermodynamically favourable native defects in gan which contribute to the ntype character of asgrown gan but are not the main source a result that is consistent with experiment our calculations show no native point defects can form thermodynamically stable acceptor states gan can be easily doped ntype but in equilibrium conditions at moderate temperatures acceptor dopants will be compensated by n vacancies and no significant hole concentrations will be observed indicating nonequilibrium processes must dominate in ptype gan we identify spectroscopic signatures of native defects in the infrared visible and ultraviolet luminescence ranges and complementary spectroscopies crucially we calculate the effectivemasslikestate levels associated with electrons and holes bound in diffuse orbitals
|
[['the', 'semiconducting', 'behaviour', 'and', 'optoelectronic', 'response', 'of', 'gallium', 'nitride', 'is', 'governed', 'by', 'point', 'defect', 'processes', 'which', 'despite', 'many', 'years', 'of', 'research', 'remain', 'poorly', 'understood', 'the', 'key', 'difficulty', 'in', 'the', 'description', 'of', 'the', 'dominant', 'charged', 'defects', 'is', 'determining', 'a', 'consistent', 'position', 'of', 'the', 'corresponding', 'defect', 'levels', 'which', 'is', 'difficult', 'to', 'derive', 'using', 'standard', 'supercell', 'calculations', 'in', 'a', 'complementary', 'approach', 'we', 'take', 'advantage', 'of', 'the', 'embedded', 'cluster', 'methodology', 'that', 'provides', 'direct', 'access', 'to', 'a', 'common', 'zero', 'of', 'the', 'electrostatic', 'potential', 'for', 'all', 'point', 'defects', 'in', 'all', 'charge', 'states', 'charged', 'defects', 'polarise', 'a', 'host', 'dielectric', 'material', 'with', 'longrange', 'forces', 'that', 'strongly', 'affect', 'the', 'outcome', 'of', 'defect', 'simulations', 'to', 'account', 'for', 'the', 'polarisation', 'we', 'couple', 'embedding', 'with', 'the', 'hybrid', 'quantum', 'mechanicalmolecular', 'mechanical', 'qmmm', 'approach', 'and', 'investigate', 'the', 'structure', 'formation', 'and', 'ionisation', 'energies', 'and', 'equilibrium', 'concentrations', 'of', 'native', 'point', 'defects', 'in', 'wurtzite', 'gan', 'at', 'a', 'chemically', 'accurate', 'hybriddensityfunctionaltheory', 'level', 'n', 'vacancies', 'are', 'the', 'most', 'thermodynamically', 'favourable', 'native', 'defects', 'in', 'gan', 'which', 'contribute', 'to', 'the', 'ntype', 'character', 'of', 'asgrown', 'gan', 'but', 'are', 'not', 'the', 'main', 'source', 'a', 'result', 'that', 'is', 'consistent', 'with', 'experiment', 'our', 'calculations', 'show', 'no', 'native', 'point', 'defects', 'can', 'form', 'thermodynamically', 'stable', 'acceptor', 'states', 'gan', 'can', 'be', 'easily', 'doped', 'ntype', 'but', 'in', 'equilibrium', 'conditions', 'at', 'moderate', 'temperatures', 'acceptor', 'dopants', 'will', 'be', 'compensated', 'by', 'n', 'vacancies', 'and', 'no', 'significant', 'hole', 'concentrations', 'will', 'be', 'observed', 'indicating', 'nonequilibrium', 'processes', 'must', 'dominate', 'in', 'ptype', 'gan', 'we', 'identify', 'spectroscopic', 'signatures', 'of', 'native', 'defects', 'in', 'the', 'infrared', 'visible', 'and', 'ultraviolet', 'luminescence', 'ranges', 'and', 'complementary', 'spectroscopies', 'crucially', 'we', 'calculate', 'the', 'effectivemasslikestate', 'levels', 'associated', 'with', 'electrons', 'and', 'holes', 'bound', 'in', 'diffuse', 'orbitals']]
|
[-0.07938177332231529, 0.16469450829895357, -0.04450462724789688, 0.06830748950111835, 0.03384922854439897, -0.1761956421636738, 0.07512949340049062, 0.4386872641395691, -0.23188258091469707, -0.2877046604850149, -0.018694352544031952, -0.3279522682906511, -0.11384940692115315, 0.11854472808524526, -0.015437787488940381, -0.014340937612740712, 0.04484288734186189, -0.07124382329589413, -0.05715815371350032, -0.21014212860000256, 0.27244057101305835, 0.08040070112807272, 0.31056484167983883, 0.10126534834345749, 0.012388489732533231, -0.0286932175738968, 0.08497427558605812, 0.021587093405844283, -0.12345033192728143, 0.10745261591471562, 0.2992911795253483, -0.03505494783798507, 0.21569710120860155, -0.4843299803287946, -0.2171881362712805, 0.030381871224922495, 0.13740301693251805, 0.17487476026691684, -0.11633469081436854, -0.25285417591979686, 0.10379649944875981, -0.0865764066409103, -0.12664895596085549, -0.06686258838352271, -0.026410578616173727, -0.005520474434832053, -0.2245791421315629, 0.08912235809726525, 0.03876411499701036, 0.025080342929755688, -0.1425085290102288, -0.12973689700498484, -0.12293244663142246, 0.0899548925384482, 0.01549863002385742, 0.009432927070590739, 0.25234383069494987, -0.10080284690267818, -0.11148636674782796, 0.38405031237621295, -0.03681707058044136, -0.1283390273013136, 0.20504172533920192, -0.170470972155589, -0.12019600750799038, 0.20136092434991007, 0.10878886326032063, 0.139038199463195, -0.17848769223787678, 0.09609813001160257, 0.051641540574325004, 0.18640521022738427, 0.06445920651385113, 0.11315015251946801, 0.28070348256101557, 0.17715283994501557, 0.033920564629857666, 0.10266536592673726, -0.09578163546128532, -0.06102333745428238, -0.23693582790275647, -0.19820971862437128, -0.18999656270774326, 0.0909717928265901, -0.07561553466075566, -0.20805877668046674, 0.365979985449492, 0.13059929110896737, 0.16019653298500872, -0.06038232757520407, 0.20863876467132808, 0.07920376976506291, 0.08521586803488376, 0.030912166512787862, 0.24586771120400305, 0.11701276876635185, 0.051514223124109956, -0.24903054900517932, 0.09577159881284966, -0.011582576883180687]
|
1,803.06274
|
Frequency-modulated SSFP with radial sampling and subspace
reconstruction: A time-efficient alternative to phase-cycled bSSFP
|
Purpose: A novel subspace-based reconstruction method for frequency-modulated
balanced steady-state free precession (fmSSFP) MRI is presented. In this work,
suitable data acquisition schemes, subspace sizes, and efficiencies for banding
removal are investigated.
Theory and Methods: By combining a fmSSFP MRI sequence with a 3D
stack-of-stars trajectory, scan efficiency is maximized as spectral information
is obtained without intermediate preparation phases. A memory-efficient
reconstruction routine is implemented by introducing the low-frequency Fourier
transform as a subspace which allows for the formulation of a convex
reconstruction problem. The removal of banding artifacts is investigated by
comparing the proposed acquisition and reconstruction technique to phase-cycled
bSSFP MRI. Aliasing properties of different undersampling schemes are analyzed
and water/fat separation is demonstrated by reweighting the reconstructed
subspace coefficients to generate virtual spectral responses in a
post-processing step.
Results: A simple root-of-sum-of-squares combination of the reconstructed
subspace coefficients yields high-SNR images with the characteristic bSSFP
contrast but without banding artifacts. Compared to Golden-Angle trajectories,
turn-based sampling schemes were superior in minimizing aliasing across
reconstructed subspace coefficients. Water/fat separated images of the human
knee were obtained by reweighting subspace coefficients.
Conclusion: The novel subspace-based fmSSFP MRI technique emerges as a
time-efficient alternative to phase-cycled bSSFP. The method does not need
intermediate preparation phases, offers high SNR and avoids banding artifacts.
Reweighting of the reconstructed subspace coefficients allows for generating
virtual spectral responses with applications to water/fat separation.
|
physics.med-ph
|
purpose a novel subspacebased reconstruction method for frequencymodulated balanced steadystate free precession fmssfp mri is presented in this work suitable data acquisition schemes subspace sizes and efficiencies for banding removal are investigated theory and methods by combining a fmssfp mri sequence with a 3d stackofstars trajectory scan efficiency is maximized as spectral information is obtained without intermediate preparation phases a memoryefficient reconstruction routine is implemented by introducing the lowfrequency fourier transform as a subspace which allows for the formulation of a convex reconstruction problem the removal of banding artifacts is investigated by comparing the proposed acquisition and reconstruction technique to phasecycled bssfp mri aliasing properties of different undersampling schemes are analyzed and waterfat separation is demonstrated by reweighting the reconstructed subspace coefficients to generate virtual spectral responses in a postprocessing step results a simple rootofsumofsquares combination of the reconstructed subspace coefficients yields highsnr images with the characteristic bssfp contrast but without banding artifacts compared to goldenangle trajectories turnbased sampling schemes were superior in minimizing aliasing across reconstructed subspace coefficients waterfat separated images of the human knee were obtained by reweighting subspace coefficients conclusion the novel subspacebased fmssfp mri technique emerges as a timeefficient alternative to phasecycled bssfp the method does not need intermediate preparation phases offers high snr and avoids banding artifacts reweighting of the reconstructed subspace coefficients allows for generating virtual spectral responses with applications to waterfat separation
|
[['purpose', 'a', 'novel', 'subspacebased', 'reconstruction', 'method', 'for', 'frequencymodulated', 'balanced', 'steadystate', 'free', 'precession', 'fmssfp', 'mri', 'is', 'presented', 'in', 'this', 'work', 'suitable', 'data', 'acquisition', 'schemes', 'subspace', 'sizes', 'and', 'efficiencies', 'for', 'banding', 'removal', 'are', 'investigated', 'theory', 'and', 'methods', 'by', 'combining', 'a', 'fmssfp', 'mri', 'sequence', 'with', 'a', '3d', 'stackofstars', 'trajectory', 'scan', 'efficiency', 'is', 'maximized', 'as', 'spectral', 'information', 'is', 'obtained', 'without', 'intermediate', 'preparation', 'phases', 'a', 'memoryefficient', 'reconstruction', 'routine', 'is', 'implemented', 'by', 'introducing', 'the', 'lowfrequency', 'fourier', 'transform', 'as', 'a', 'subspace', 'which', 'allows', 'for', 'the', 'formulation', 'of', 'a', 'convex', 'reconstruction', 'problem', 'the', 'removal', 'of', 'banding', 'artifacts', 'is', 'investigated', 'by', 'comparing', 'the', 'proposed', 'acquisition', 'and', 'reconstruction', 'technique', 'to', 'phasecycled', 'bssfp', 'mri', 'aliasing', 'properties', 'of', 'different', 'undersampling', 'schemes', 'are', 'analyzed', 'and', 'waterfat', 'separation', 'is', 'demonstrated', 'by', 'reweighting', 'the', 'reconstructed', 'subspace', 'coefficients', 'to', 'generate', 'virtual', 'spectral', 'responses', 'in', 'a', 'postprocessing', 'step', 'results', 'a', 'simple', 'rootofsumofsquares', 'combination', 'of', 'the', 'reconstructed', 'subspace', 'coefficients', 'yields', 'highsnr', 'images', 'with', 'the', 'characteristic', 'bssfp', 'contrast', 'but', 'without', 'banding', 'artifacts', 'compared', 'to', 'goldenangle', 'trajectories', 'turnbased', 'sampling', 'schemes', 'were', 'superior', 'in', 'minimizing', 'aliasing', 'across', 'reconstructed', 'subspace', 'coefficients', 'waterfat', 'separated', 'images', 'of', 'the', 'human', 'knee', 'were', 'obtained', 'by', 'reweighting', 'subspace', 'coefficients', 'conclusion', 'the', 'novel', 'subspacebased', 'fmssfp', 'mri', 'technique', 'emerges', 'as', 'a', 'timeefficient', 'alternative', 'to', 'phasecycled', 'bssfp', 'the', 'method', 'does', 'not', 'need', 'intermediate', 'preparation', 'phases', 'offers', 'high', 'snr', 'and', 'avoids', 'banding', 'artifacts', 'reweighting', 'of', 'the', 'reconstructed', 'subspace', 'coefficients', 'allows', 'for', 'generating', 'virtual', 'spectral', 'responses', 'with', 'applications', 'to', 'waterfat', 'separation']]
|
[-0.08621385506670183, 0.07150195554998347, -0.10639746286824248, 0.062431378272107686, -0.05881382658101192, -0.1580778438831774, -0.012783036018528931, 0.40764517822027996, -0.28983981721718605, -0.2667291655734957, 0.11220838152136785, -0.21160866741702836, -0.12816360929164428, 0.19841508833806354, -0.12545178804366075, 0.12307736532924705, 0.1534290309515392, -0.07147862503534831, -0.12381134482086759, -0.19402183718478824, 0.24187168235980827, 0.07409693636943787, 0.34185711915567846, -0.05808723001794208, 0.13312673921612736, 0.04626244657964237, -0.08876450712657184, 0.019716492406859798, -0.09201612095410078, 0.0767716476545025, 0.2945805365252534, 0.15705808869969215, 0.26680732629208576, -0.36754011054110963, -0.25035337935353624, 0.06206433548661778, 0.19406628000266882, 0.11307445711852154, -0.07362208455278038, -0.2768044414948508, 0.12302574336873408, -0.11243072535484565, -0.05784938651924781, -0.16165739179297559, -0.09198391563382148, -0.03806115601787196, -0.3492072617023822, 0.1367646834601767, 0.03453937030575825, 0.07955076216436956, -0.075214793402517, -0.11992387450607862, 0.033910602245003904, 0.09423935370794641, -0.0025263253562480604, 0.06410671385376415, 0.15492396145886722, -0.11327180677039204, -0.12054253754817311, 0.3286057748905658, -0.023096504267346163, -0.24132145589678075, 0.17484515398024839, -0.08920089632905055, -0.07201314612911268, 0.2209974476218322, 0.13069704774200983, 0.11899458887752982, -0.15136528328073412, 0.026171681132436307, 0.04583438919264298, 0.16471898112044, 0.10727663961083254, 0.02418297753230328, 0.09027114131237639, 0.1491115695144571, 0.04724000120178554, 0.1518661627055675, -0.17566561502802477, -0.008840968820065392, -0.21071810463850082, -0.10455438905777123, -0.23901864989467853, -0.024509068766630886, -0.08628737133544806, -0.16505796781490814, 0.405500086786488, 0.11592515086086409, 0.20021738451885035, 0.022735093397550935, 0.3973890641860106, 0.071673607433703, 0.06702341775344234, 0.026424282755587856, 0.17227014730015713, 0.10838552316089699, 0.09387409746737141, -0.23181308940922768, 0.07095346027894955, 0.12090451357422585]
|
1,803.06275
|
Growth monitoring with sub-monolayer sensitivity via real time thermal
conductance measurements
|
Growth monitoring during the early stages of film formation is of prime
importance to understand the growth process, the microstructure and thus the
overall layer properties. In this work, we demonstrate that phonons can be used
as sensitive probes to monitor real time evolution of film microstructure
during growth, from incipient clustering to continuous film formation. For that
purpose, a silicon nitride membrane-based sensor has been fabricated to measure
in-plane thermal conductivity of thin film samples. Operating with the
3{\omega}-V\"olklein method at low frequencies, the sensor shows an exceptional
resolution down to {\Delta}({\kappa}*t)=0.065 nm*W/(m*K), enabling accurate
measurements. Validation of the sensor performance is done with organic and
metallic thin films. In both cases, at early stages of growth, we observe an
initial reduction of the effective thermal conductance of the supporting
amorphous membrane, K, related with the surface phonon scattering enhanced by
the incipient nanoclusters formation. As clusters develop, K reaches a minimum
at the percolation threshold. Subsequent island percolation produces a sharp
increase of the conductance and once the surface coverage is completed K
increases linearly with thickness The thermal conductivity of the deposited
films is obtained from the variation of K with thickness.
|
physics.app-ph
|
growth monitoring during the early stages of film formation is of prime importance to understand the growth process the microstructure and thus the overall layer properties in this work we demonstrate that phonons can be used as sensitive probes to monitor real time evolution of film microstructure during growth from incipient clustering to continuous film formation for that purpose a silicon nitride membranebased sensor has been fabricated to measure inplane thermal conductivity of thin film samples operating with the 3omegavolklein method at low frequencies the sensor shows an exceptional resolution down to deltakappat0065 nmwmk enabling accurate measurements validation of the sensor performance is done with organic and metallic thin films in both cases at early stages of growth we observe an initial reduction of the effective thermal conductance of the supporting amorphous membrane k related with the surface phonon scattering enhanced by the incipient nanoclusters formation as clusters develop k reaches a minimum at the percolation threshold subsequent island percolation produces a sharp increase of the conductance and once the surface coverage is completed k increases linearly with thickness the thermal conductivity of the deposited films is obtained from the variation of k with thickness
|
[['growth', 'monitoring', 'during', 'the', 'early', 'stages', 'of', 'film', 'formation', 'is', 'of', 'prime', 'importance', 'to', 'understand', 'the', 'growth', 'process', 'the', 'microstructure', 'and', 'thus', 'the', 'overall', 'layer', 'properties', 'in', 'this', 'work', 'we', 'demonstrate', 'that', 'phonons', 'can', 'be', 'used', 'as', 'sensitive', 'probes', 'to', 'monitor', 'real', 'time', 'evolution', 'of', 'film', 'microstructure', 'during', 'growth', 'from', 'incipient', 'clustering', 'to', 'continuous', 'film', 'formation', 'for', 'that', 'purpose', 'a', 'silicon', 'nitride', 'membranebased', 'sensor', 'has', 'been', 'fabricated', 'to', 'measure', 'inplane', 'thermal', 'conductivity', 'of', 'thin', 'film', 'samples', 'operating', 'with', 'the', '3omegavolklein', 'method', 'at', 'low', 'frequencies', 'the', 'sensor', 'shows', 'an', 'exceptional', 'resolution', 'down', 'to', 'deltakappat0065', 'nmwmk', 'enabling', 'accurate', 'measurements', 'validation', 'of', 'the', 'sensor', 'performance', 'is', 'done', 'with', 'organic', 'and', 'metallic', 'thin', 'films', 'in', 'both', 'cases', 'at', 'early', 'stages', 'of', 'growth', 'we', 'observe', 'an', 'initial', 'reduction', 'of', 'the', 'effective', 'thermal', 'conductance', 'of', 'the', 'supporting', 'amorphous', 'membrane', 'k', 'related', 'with', 'the', 'surface', 'phonon', 'scattering', 'enhanced', 'by', 'the', 'incipient', 'nanoclusters', 'formation', 'as', 'clusters', 'develop', 'k', 'reaches', 'a', 'minimum', 'at', 'the', 'percolation', 'threshold', 'subsequent', 'island', 'percolation', 'produces', 'a', 'sharp', 'increase', 'of', 'the', 'conductance', 'and', 'once', 'the', 'surface', 'coverage', 'is', 'completed', 'k', 'increases', 'linearly', 'with', 'thickness', 'the', 'thermal', 'conductivity', 'of', 'the', 'deposited', 'films', 'is', 'obtained', 'from', 'the', 'variation', 'of', 'k', 'with', 'thickness']]
|
[-0.1020559516218782, 0.1697634922082519, -0.07533683847941575, -0.06993140967243978, -0.013496210044346904, -0.10609618229257951, 0.05327001490513794, 0.41434678437629674, -0.2601209887507139, -0.31749154338467633, 0.08304444957684609, -0.3038959702050003, -0.08897510288807098, 0.1838920977509891, -0.005323521880200133, 0.0423326818319841, 0.018815100761761034, -0.04167341656041875, -0.02617923448512253, -0.2509459113304426, 0.25087697652876767, 0.1083361180111145, 0.36234063882147893, 0.0852235298176917, 0.0480123239516009, -0.013707331612143511, 0.05736413408400646, 0.02416898430668842, -0.18883750012211445, 0.044647382590483176, 0.27207728631037753, -0.05211089670410729, 0.21539555632625706, -0.47488566854735836, -0.23048861032111745, 0.01457190534529218, 0.13070896301511917, 0.08889353933773236, -0.05779171415573122, -0.1946725273010088, 0.10278608179942239, -0.08852306128998559, -0.1427685832265221, -0.005919026269111782, 0.031466347222703916, -0.023520678475809593, -0.24541077941163772, 0.09577469586580871, 0.0335246355534764, 0.0693002584084752, -0.09054402101416296, -0.10267665420421206, -0.10594831303630296, 0.10783205318754578, 0.024247905583706597, 0.0240189919986733, 0.25926269819319714, -0.11623215834151779, -0.06128837966025458, 0.318177797646058, -0.07239233095909488, -0.02145271879271604, 0.18964700191281736, -0.1847598300288761, -0.04776322163115765, 0.22061399635883086, 0.16114979447676583, 0.10234466130593016, -0.1303879118616654, 0.03259278620483504, 0.07182349810076023, 0.2177220443445549, 0.10335743551483272, 0.02149164215734345, 0.22805440286416948, 0.30427212570490764, 0.040960162986569536, 0.18685570695136752, -0.1341637249085276, 0.016559322169390118, -0.220085980273628, -0.17221711776975704, -0.1995914367119743, 0.0813181155311516, -0.13011557667027773, -0.21119347364340987, 0.35867727240838576, 0.12476539301345231, 0.19383600850900015, -0.007075700906473988, 0.2553448798862519, 0.07874710794142932, 0.08857878056248107, 0.010857012963242596, 0.23826360946986824, 0.1714513076355312, 0.13508598388352766, -0.27265914761665044, 0.140436350536523, -0.01584222479626381]
|
1,803.06276
|
Two-Layered Falsification of Hybrid Systems guided by Monte Carlo Tree
Search
|
Few real-world hybrid systems are amenable to formal verification, due to
their complexity and black box components. Optimization-based falsification---a
methodology of search-based testing that employs stochastic optimization---is
attracting attention as an alternative quality assurance method. Inspired by
the recent works that advocate coverage and exploration in falsification, we
introduce a two-layered optimization framework that uses Monte Carlo tree
search (MCTS), a popular machine learning technique with solid mathematical and
empirical foundations. MCTS is used in the upper layer of our framework; it
guides the lower layer of local hill-climbing optimization, thus balancing
exploration and exploitation in a disciplined manner.
|
cs.SY
|
few realworld hybrid systems are amenable to formal verification due to their complexity and black box components optimizationbased falsificationa methodology of searchbased testing that employs stochastic optimizationis attracting attention as an alternative quality assurance method inspired by the recent works that advocate coverage and exploration in falsification we introduce a twolayered optimization framework that uses monte carlo tree search mcts a popular machine learning technique with solid mathematical and empirical foundations mcts is used in the upper layer of our framework it guides the lower layer of local hillclimbing optimization thus balancing exploration and exploitation in a disciplined manner
|
[['few', 'realworld', 'hybrid', 'systems', 'are', 'amenable', 'to', 'formal', 'verification', 'due', 'to', 'their', 'complexity', 'and', 'black', 'box', 'components', 'optimizationbased', 'falsificationa', 'methodology', 'of', 'searchbased', 'testing', 'that', 'employs', 'stochastic', 'optimizationis', 'attracting', 'attention', 'as', 'an', 'alternative', 'quality', 'assurance', 'method', 'inspired', 'by', 'the', 'recent', 'works', 'that', 'advocate', 'coverage', 'and', 'exploration', 'in', 'falsification', 'we', 'introduce', 'a', 'twolayered', 'optimization', 'framework', 'that', 'uses', 'monte', 'carlo', 'tree', 'search', 'mcts', 'a', 'popular', 'machine', 'learning', 'technique', 'with', 'solid', 'mathematical', 'and', 'empirical', 'foundations', 'mcts', 'is', 'used', 'in', 'the', 'upper', 'layer', 'of', 'our', 'framework', 'it', 'guides', 'the', 'lower', 'layer', 'of', 'local', 'hillclimbing', 'optimization', 'thus', 'balancing', 'exploration', 'and', 'exploitation', 'in', 'a', 'disciplined', 'manner']]
|
[-0.049936115266467185, -0.00555018477064447, -0.12666121404137962, 0.07667502626499459, -0.16192896043900976, -0.1794908785203606, 0.12748595484359593, 0.4249643301303239, -0.2571210678397995, -0.35582487277456165, 0.08894084469468054, -0.2239115154898735, -0.20334240970845074, 0.19253220721916056, -0.10342578735855437, 0.1553678937717197, 0.11015007513354427, -0.07254000088756847, -0.034259895220418106, -0.23289850531097925, 0.23766537726443915, 0.11334410609350991, 0.3596006317313799, -0.025724795944604677, 0.09234094116164698, 0.062001581481398685, -0.03727426923020532, 0.022112031246429867, -0.12622794324462241, 0.2122685598442331, 0.30567492110673916, 0.251862991975678, 0.3936129472765726, -0.429246631230122, -0.22500722112071692, 0.06117551706697715, 0.14196506177870913, 0.08685439358316555, -0.12995172966722898, -0.27482224224116075, 0.06299034394947908, -0.21534680459677175, -0.030168691686037735, -0.16654859217287032, -0.04113498315234313, -0.027674755532793777, -0.28656474929110903, -0.03266621293192826, 0.08352088623862598, 0.06118035568710484, 0.010944735537254318, -0.13359639111704663, 0.03465296240816296, 0.06808868818196286, 0.030238967620498818, 0.07231300478781928, 0.17905024714172654, -0.09001430330471587, -0.2171668828628266, 0.34165067392756643, -0.02881780472228822, -0.19161212977895647, 0.24943018128576966, 0.03769891807022169, -0.18512281322774968, 0.1261727064511902, 0.23943567479547767, 0.16743419694320597, -0.1816785630011528, 0.0965553084796429, -0.0013307963891588536, 0.1543108169133439, -0.013231687319762622, -0.030184889562696833, 0.17455474461534434, 0.31082707758724076, 0.1281000473649816, 0.1562396254601706, -0.045195350289037546, -0.17387797783570574, -0.21172757070396364, -0.1461502545676434, -0.1617227070244778, -0.04284286397250043, -0.09317378604666993, -0.19691345421117298, 0.3180524587016745, 0.21143298965792373, 0.11426242646405992, 0.10477839212278961, 0.38356897697697595, 0.048044516272919696, 0.05318759467942429, 0.11713771500442292, 0.20541769306453847, 0.05500927411221428, 0.11806141359481923, -0.1536229051236716, 0.10145482038430985, 0.11214192791784316]
|
1,803.06277
|
Extreme Events: Mechanisms and Prediction
|
Extreme events, such as rogue waves, earthquakes and stock market crashes,
occur spontaneously in many dynamical systems. Because of their usually adverse
consequences, quantification, prediction and mitigation of extreme events are
highly desirable. Here, we review several aspects of extreme events in
phenomena described by high-dimensional, chaotic dynamical systems. We
specially focus on two pressing aspects of the problem: (i) Mechanisms
underlying the formation of extreme events and (ii) Real-time prediction of
extreme events. For each aspect, we explore methods relying on models, data or
both. We discuss the strengths and limitations of each approach as well as
possible future research directions.
|
nlin.CD math.DS physics.ao-ph physics.flu-dyn
|
extreme events such as rogue waves earthquakes and stock market crashes occur spontaneously in many dynamical systems because of their usually adverse consequences quantification prediction and mitigation of extreme events are highly desirable here we review several aspects of extreme events in phenomena described by highdimensional chaotic dynamical systems we specially focus on two pressing aspects of the problem i mechanisms underlying the formation of extreme events and ii realtime prediction of extreme events for each aspect we explore methods relying on models data or both we discuss the strengths and limitations of each approach as well as possible future research directions
|
[['extreme', 'events', 'such', 'as', 'rogue', 'waves', 'earthquakes', 'and', 'stock', 'market', 'crashes', 'occur', 'spontaneously', 'in', 'many', 'dynamical', 'systems', 'because', 'of', 'their', 'usually', 'adverse', 'consequences', 'quantification', 'prediction', 'and', 'mitigation', 'of', 'extreme', 'events', 'are', 'highly', 'desirable', 'here', 'we', 'review', 'several', 'aspects', 'of', 'extreme', 'events', 'in', 'phenomena', 'described', 'by', 'highdimensional', 'chaotic', 'dynamical', 'systems', 'we', 'specially', 'focus', 'on', 'two', 'pressing', 'aspects', 'of', 'the', 'problem', 'i', 'mechanisms', 'underlying', 'the', 'formation', 'of', 'extreme', 'events', 'and', 'ii', 'realtime', 'prediction', 'of', 'extreme', 'events', 'for', 'each', 'aspect', 'we', 'explore', 'methods', 'relying', 'on', 'models', 'data', 'or', 'both', 'we', 'discuss', 'the', 'strengths', 'and', 'limitations', 'of', 'each', 'approach', 'as', 'well', 'as', 'possible', 'future', 'research', 'directions']]
|
[-0.13226819914016946, 0.13185790520818794, -0.030425352414193398, 0.18867177429024642, -0.05915934779663004, -0.12533150383444758, 0.04496182047524581, 0.37848769842336577, -0.22029571070828857, -0.30299310974192384, 0.19735179371063544, -0.3055236159559047, -0.2333601781226439, 0.2155901057458501, -0.0871144019788606, 0.08913405019534278, 0.07501339012021929, -0.01112220625338309, -0.021192307339173138, -0.20193426923680247, 0.3197834107148297, 0.06273582126653078, 0.3014140913819931, 0.02863253916011137, 0.0984186081948471, 0.009169965557863606, -0.06514705346632457, 0.012874876872599856, -0.1050094278302733, 0.07227395975154222, 0.28182860051314423, 0.1774204995063152, 0.32375290375842036, -0.487972003864307, -0.2698407851287401, 0.12310405413382779, 0.11028106039043005, 0.07335384642047917, -0.03136084872690559, -0.2873767088258676, 0.013580877972451751, -0.1670318666535119, -0.12514514203512056, -0.0693360560701466, 0.05195668216009496, 0.06382995547598921, -0.23227871848525955, 0.0822278755128055, 0.06152504704283167, 0.08659707096989687, -0.04684517312767532, -0.08068320182079047, 0.008165570558048785, 0.12632300808121832, 0.13818708927754095, -0.10648498335606693, 0.17835434959909202, -0.1833373601730986, -0.21583189287533364, 0.440257443261205, 0.003918469173596332, -0.11915575125820789, 0.2681871111568648, -0.14075431920241052, -0.19899788179307007, 0.06937224448512436, 0.266708424466653, 0.11135304403746975, -0.14799447654399508, -0.02101779154120367, 0.07488408994258326, 0.07185395786940467, 0.050719292428088834, 0.10636136642150472, 0.27743641944492564, 0.24574923846761093, 0.000405069341878498, 0.06193786885762843, -0.10240955682763574, -0.11132184787728715, -0.26118815349707125, -0.06913102071677499, -0.0910981072902716, -0.005972327125788319, -0.07878494680649144, -0.17537752462222295, 0.3924094370255868, 0.2349511953207719, 0.2121059589964502, -0.07400793092343591, 0.28451962836598066, 0.08243496650852737, 0.000737207985081363, 0.023703756383802815, 0.21970291423392208, 0.02221703441932286, 0.10180502375770434, -0.15165047652508115, 0.1286531825705121, 0.0013871134861427195]
|
1,803.06278
|
Particle-in-Cell Modeling of Laser Thomson Scattering in Low-Density
Plasmas at Elevated Laser Intensities
|
Incoherent Thomson scattering is a non-intrusive technique commonly used for
measuring local plasma density. Within low-density, low-temperature plasma's
and for sufficient laser intensity, the laser may perturb the local electron
density via the ponderomotive force, causing the diagnostic to become intrusive
and leading to erroneous results. A theoretical model for this effect is
validated numerically via kinetic simulations of a quasi-neutral plasma using
the Particle-in-Cell technique.
|
physics.plasm-ph
|
incoherent thomson scattering is a nonintrusive technique commonly used for measuring local plasma density within lowdensity lowtemperature plasmas and for sufficient laser intensity the laser may perturb the local electron density via the ponderomotive force causing the diagnostic to become intrusive and leading to erroneous results a theoretical model for this effect is validated numerically via kinetic simulations of a quasineutral plasma using the particleincell technique
|
[['incoherent', 'thomson', 'scattering', 'is', 'a', 'nonintrusive', 'technique', 'commonly', 'used', 'for', 'measuring', 'local', 'plasma', 'density', 'within', 'lowdensity', 'lowtemperature', 'plasmas', 'and', 'for', 'sufficient', 'laser', 'intensity', 'the', 'laser', 'may', 'perturb', 'the', 'local', 'electron', 'density', 'via', 'the', 'ponderomotive', 'force', 'causing', 'the', 'diagnostic', 'to', 'become', 'intrusive', 'and', 'leading', 'to', 'erroneous', 'results', 'a', 'theoretical', 'model', 'for', 'this', 'effect', 'is', 'validated', 'numerically', 'via', 'kinetic', 'simulations', 'of', 'a', 'quasineutral', 'plasma', 'using', 'the', 'particleincell', 'technique']]
|
[-0.05958465033097926, 0.18594641227867792, -0.12021220593526254, 0.10603444693984013, -0.00031643439874504554, -0.11988345460938007, 0.0016539998592413735, 0.3723768839951266, -0.2452383192298426, -0.27049313059471775, 0.007920709918394234, -0.22317185383431162, -0.05782313640652732, 0.2560634919209406, 0.037564931490289215, 0.10521234602977832, -0.00807110240301964, -0.07932723683276863, -0.007190646702480136, -0.13151719851532218, 0.25383093321667705, 0.19126775096678597, 0.3137744151225144, 0.09673967373303392, 0.07951751934138662, 0.013071717129963818, -0.0419118368687729, 0.05083798312416272, -0.11603013553196267, 0.04032708307248399, 0.23095194279625447, 0.02658845444040542, 0.2881355279153495, -0.5334213570763082, -0.2987120053166467, -0.0011295545987333312, 0.16489505204795438, 0.15254984562158247, -0.09289897225486736, -0.2389573909370511, -0.0013405547025754597, -0.1899542640753542, -0.1510029604048186, -0.08367607873074259, -0.017636243599664533, 0.06469760567062732, -0.3919638780256112, 0.12610533191455583, -0.02484400724201943, 0.04512389472713976, -0.04046145667124427, -0.005248843875685425, 0.008671371372077952, 0.01881352740967872, 0.008916244297076693, 0.05598427930310594, 0.24859572382587375, -0.11604366358016815, -0.00597130957370003, 0.3675285160936641, -0.09238850376145406, -0.14698996965660516, 0.21718134563134023, -0.13888128196369065, -0.03281688666196935, 0.24078819231892173, 0.12960432526464996, 0.11202756009173975, -0.1748256863193643, 0.012002109336511543, -0.012610398502808741, 0.1532915115469333, 0.10548029974399303, -0.026688585516460465, 0.212917799440523, 0.16729123541859514, 0.008564129330669388, 0.13090450528684552, -0.1649941830387847, -0.02963708308666493, -0.23301168852909046, -0.09054221441461281, -0.16736777711687892, 0.02755462624499518, -0.03822847730153819, -0.17837287903283583, 0.35359461700797756, 0.2327093937889334, 0.07921323427140262, -0.07697565516344074, 0.43207843974232674, 0.17154040384709582, -0.01777415645505464, 0.0591205238068307, 0.27637085813859646, 0.2142343639650128, 0.10419672418555076, -0.2835925748204869, 0.052724219456484374, 0.0932933823134976]
|
1,803.06279
|
On the uniqueness of the steady-state solution of the
Lindblad-Gorini-Kossakowski-Sudarshan equation
|
The aims of this paper are two. The first is to give a brief review of the
most relevant theoretical results concerning the uniqueness of the steady-state
solution of the Lindblad-Gorini-Kossakowski-Sudarshan master equation and the
criteria which guarantee relaxingness and irreducibility of dynamical
semigroups. In particular, we test and discuss their physical meaning by
considering their applicability to the characterisation of the simplest open
quantum system \emph{i.e.} a two-level system coupled to a bath of harmonic
oscillators at zero temperature. The second aim is to provide a set of
sufficient conditions which guarantees the uniqueness of the steady-state
solution and its attractivity. Starting from simple assumptions, we derive
simple criteria that can be efficiently exploited to characterise the behavior
of dissipative systems of spins and bosons (with truncated Fock space), and a
wide variety of other open quantum systems recently studied.
|
quant-ph
|
the aims of this paper are two the first is to give a brief review of the most relevant theoretical results concerning the uniqueness of the steadystate solution of the lindbladgorinikossakowskisudarshan master equation and the criteria which guarantee relaxingness and irreducibility of dynamical semigroups in particular we test and discuss their physical meaning by considering their applicability to the characterisation of the simplest open quantum system emphie a twolevel system coupled to a bath of harmonic oscillators at zero temperature the second aim is to provide a set of sufficient conditions which guarantees the uniqueness of the steadystate solution and its attractivity starting from simple assumptions we derive simple criteria that can be efficiently exploited to characterise the behavior of dissipative systems of spins and bosons with truncated fock space and a wide variety of other open quantum systems recently studied
|
[['the', 'aims', 'of', 'this', 'paper', 'are', 'two', 'the', 'first', 'is', 'to', 'give', 'a', 'brief', 'review', 'of', 'the', 'most', 'relevant', 'theoretical', 'results', 'concerning', 'the', 'uniqueness', 'of', 'the', 'steadystate', 'solution', 'of', 'the', 'lindbladgorinikossakowskisudarshan', 'master', 'equation', 'and', 'the', 'criteria', 'which', 'guarantee', 'relaxingness', 'and', 'irreducibility', 'of', 'dynamical', 'semigroups', 'in', 'particular', 'we', 'test', 'and', 'discuss', 'their', 'physical', 'meaning', 'by', 'considering', 'their', 'applicability', 'to', 'the', 'characterisation', 'of', 'the', 'simplest', 'open', 'quantum', 'system', 'emphie', 'a', 'twolevel', 'system', 'coupled', 'to', 'a', 'bath', 'of', 'harmonic', 'oscillators', 'at', 'zero', 'temperature', 'the', 'second', 'aim', 'is', 'to', 'provide', 'a', 'set', 'of', 'sufficient', 'conditions', 'which', 'guarantees', 'the', 'uniqueness', 'of', 'the', 'steadystate', 'solution', 'and', 'its', 'attractivity', 'starting', 'from', 'simple', 'assumptions', 'we', 'derive', 'simple', 'criteria', 'that', 'can', 'be', 'efficiently', 'exploited', 'to', 'characterise', 'the', 'behavior', 'of', 'dissipative', 'systems', 'of', 'spins', 'and', 'bosons', 'with', 'truncated', 'fock', 'space', 'and', 'a', 'wide', 'variety', 'of', 'other', 'open', 'quantum', 'systems', 'recently', 'studied']]
|
[-0.13693562196232648, 0.08209870977112822, -0.1033401385438796, 0.049650799318906855, -0.05664457293502022, -0.1460420867778267, 0.05225531691635068, 0.30849626155824755, -0.26529721302238274, -0.25734738395850865, 0.13044838897679537, -0.23402178021509656, -0.12720140425585505, 0.20388171190174845, -0.04238938483938896, 0.09558284336662509, 0.0617919056173816, 0.057231725175344056, -0.07567877714562384, -0.24965614708988063, 0.3533015300706322, 0.021198512723321003, 0.23970770230349286, 0.06477132082829694, 0.12636367933784456, -0.024602775532323463, 0.006836179049229987, -0.0035442901478339953, -0.1725238619170511, 0.1086947174957223, 0.22291984592678307, 0.13160700472942788, 0.28149436810891404, -0.41839667842488926, -0.16771620687217914, 0.11088776447066515, 0.1029301721421774, 0.13994180792172126, -0.03226277668968349, -0.2858281612476642, 0.07667565694507614, -0.16155393664865828, -0.19926619131064457, -0.11128151722640979, -0.00017103916302108936, 0.064511022649424, -0.24878156732553416, 0.05174688104432907, 0.10880894132403209, 0.050405445850367166, -0.09270188488022646, -0.04868423935903652, 0.003837139963795491, 0.13790987605872235, 0.0009598091124094647, -0.038460550753553834, 0.09569788901570836, -0.12874921561527006, -0.11117677545014153, 0.4049039836637944, -0.05909411617883032, -0.19817953111885264, 0.2570976333134881, -0.1376168608645366, -0.11704960612834786, 0.09022904668177525, 0.1616622418996027, 0.1173608978278935, -0.232018273062468, 0.09982381201359249, -0.04090546688949354, 0.11744329352568326, 0.02315460406779814, 0.08963575498234454, 0.1864577622853032, 0.1643416381243402, 0.06362701570213163, 0.18457756736340913, 0.0097161515099968, -0.12900456908768673, -0.3352690078586126, -0.1591894001986416, -0.1639061055729072, 0.07701163528580889, -0.06034552365170437, -0.166419837268726, 0.43610955964733694, 0.17808121458540183, 0.1791589344456363, 0.04204421534819408, 0.2506889121727549, 0.14904957670743976, -0.039156831179968696, 0.03763012047321033, 0.22959321226067037, 0.20267510657506935, 0.07371656920948474, -0.23775945792143005, 0.018938867827515592, 0.0715067828335404]
|
1,803.0628
|
Doping and tilting on optics in noncentrosymmetric multi-Weyl semimetals
|
Weyl semimetal (WSM) feature tilted Dirac cones and can be type I or II
depending on the magnitude of the tilt parameter ($C$). The boundary between
the two types is at $C=1$ where the cones are tipped and there is a Lifshitz
transition. The topological charge of a WSM is one. In multi-Weyl it can be two
or more depending on the value of the winding number $J$. We calculate the
absorptive part of the AC optical conductivity both along the tilt direction
($\sigma_{zz}$) and perpendicular to it ($\sigma_{xx}$) as a function of the
tilt ($C$) and chemical potential ($\mu$). For zero tilt there is a
discontinuous rise in both $\sigma_{xx}$ and $\sigma_{zz}$ at photon energy
$\Omega=2\mu$ followed by the usual linear in $\Omega$ law for $\sigma_{xx}$ at
$J=1,2$ and $\sigma_{zz}$ at $J=1$. For $J=2$ and $\sigma_{zz}$ the interband
background is constant rather than linear in $\Omega$. For type I there is a
readjustment of optical spectral weight as the tilt is increased. The
absorption starts from zero at $2\mu/(1+C)$ and then rises in a quasilinear
fashion till it merge with the usual undoped untilted interband background at
$2\mu/(1-C)$. The discontinuous rise at twice the chemical potential of the
untilted case is lost. For type II the interband background of the undoped
untilted case is never recovered. For noncentrosymmetric materials the energies
of a pair of opposite chirality Weyl nodes become shifted by $\pm Q_{0}$ and
this leads to two separate absorption edges corresponding to the effective
chemical potential of each of the two nodes at $2(\mu+\chi Q_{0})$ depending on
chirality $\chi=\pm$. We provide analytic expressions for the conductivity in
this case which depend only on the ratio $Q_{0}/\mu$ and tilt when plotted
against $\Omega/\mu$. The signature of finite energy shift $Q_{0}$ is more
pronounced for $\sigma_{zz}$ and $J=2$ than for the other cases.
|
cond-mat.str-el
|
weyl semimetal wsm feature tilted dirac cones and can be type i or ii depending on the magnitude of the tilt parameter c the boundary between the two types is at c1 where the cones are tipped and there is a lifshitz transition the topological charge of a wsm is one in multiweyl it can be two or more depending on the value of the winding number j we calculate the absorptive part of the ac optical conductivity both along the tilt direction sigma_zz and perpendicular to it sigma_xx as a function of the tilt c and chemical potential mu for zero tilt there is a discontinuous rise in both sigma_xx and sigma_zz at photon energy omega2mu followed by the usual linear in omega law for sigma_xx at j12 and sigma_zz at j1 for j2 and sigma_zz the interband background is constant rather than linear in omega for type i there is a readjustment of optical spectral weight as the tilt is increased the absorption starts from zero at 2mu1c and then rises in a quasilinear fashion till it merge with the usual undoped untilted interband background at 2mu1c the discontinuous rise at twice the chemical potential of the untilted case is lost for type ii the interband background of the undoped untilted case is never recovered for noncentrosymmetric materials the energies of a pair of opposite chirality weyl nodes become shifted by pm q_0 and this leads to two separate absorption edges corresponding to the effective chemical potential of each of the two nodes at 2muchi q_0 depending on chirality chipm we provide analytic expressions for the conductivity in this case which depend only on the ratio q_0mu and tilt when plotted against omegamu the signature of finite energy shift q_0 is more pronounced for sigma_zz and j2 than for the other cases
|
[['weyl', 'semimetal', 'wsm', 'feature', 'tilted', 'dirac', 'cones', 'and', 'can', 'be', 'type', 'i', 'or', 'ii', 'depending', 'on', 'the', 'magnitude', 'of', 'the', 'tilt', 'parameter', 'c', 'the', 'boundary', 'between', 'the', 'two', 'types', 'is', 'at', 'c1', 'where', 'the', 'cones', 'are', 'tipped', 'and', 'there', 'is', 'a', 'lifshitz', 'transition', 'the', 'topological', 'charge', 'of', 'a', 'wsm', 'is', 'one', 'in', 'multiweyl', 'it', 'can', 'be', 'two', 'or', 'more', 'depending', 'on', 'the', 'value', 'of', 'the', 'winding', 'number', 'j', 'we', 'calculate', 'the', 'absorptive', 'part', 'of', 'the', 'ac', 'optical', 'conductivity', 'both', 'along', 'the', 'tilt', 'direction', 'sigma_zz', 'and', 'perpendicular', 'to', 'it', 'sigma_xx', 'as', 'a', 'function', 'of', 'the', 'tilt', 'c', 'and', 'chemical', 'potential', 'mu', 'for', 'zero', 'tilt', 'there', 'is', 'a', 'discontinuous', 'rise', 'in', 'both', 'sigma_xx', 'and', 'sigma_zz', 'at', 'photon', 'energy', 'omega2mu', 'followed', 'by', 'the', 'usual', 'linear', 'in', 'omega', 'law', 'for', 'sigma_xx', 'at', 'j12', 'and', 'sigma_zz', 'at', 'j1', 'for', 'j2', 'and', 'sigma_zz', 'the', 'interband', 'background', 'is', 'constant', 'rather', 'than', 'linear', 'in', 'omega', 'for', 'type', 'i', 'there', 'is', 'a', 'readjustment', 'of', 'optical', 'spectral', 'weight', 'as', 'the', 'tilt', 'is', 'increased', 'the', 'absorption', 'starts', 'from', 'zero', 'at', '2mu1c', 'and', 'then', 'rises', 'in', 'a', 'quasilinear', 'fashion', 'till', 'it', 'merge', 'with', 'the', 'usual', 'undoped', 'untilted', 'interband', 'background', 'at', '2mu1c', 'the', 'discontinuous', 'rise', 'at', 'twice', 'the', 'chemical', 'potential', 'of', 'the', 'untilted', 'case', 'is', 'lost', 'for', 'type', 'ii', 'the', 'interband', 'background', 'of', 'the', 'undoped', 'untilted', 'case', 'is', 'never', 'recovered', 'for', 'noncentrosymmetric', 'materials', 'the', 'energies', 'of', 'a', 'pair', 'of', 'opposite', 'chirality', 'weyl', 'nodes', 'become', 'shifted', 'by', 'pm', 'q_0', 'and', 'this', 'leads', 'to', 'two', 'separate', 'absorption', 'edges', 'corresponding', 'to', 'the', 'effective', 'chemical', 'potential', 'of', 'each', 'of', 'the', 'two', 'nodes', 'at', '2muchi', 'q_0', 'depending', 'on', 'chirality', 'chipm', 'we', 'provide', 'analytic', 'expressions', 'for', 'the', 'conductivity', 'in', 'this', 'case', 'which', 'depend', 'only', 'on', 'the', 'ratio', 'q_0mu', 'and', 'tilt', 'when', 'plotted', 'against', 'omegamu', 'the', 'signature', 'of', 'finite', 'energy', 'shift', 'q_0', 'is', 'more', 'pronounced', 'for', 'sigma_zz', 'and', 'j2', 'than', 'for', 'the', 'other', 'cases']]
|
[-0.16689408555187685, 0.18355080498231383, -0.018665805121067674, -0.0036038198102620682, -0.06833631198706859, -0.19423060624994162, 0.04672649559638086, 0.3743788753091093, -0.25483476415815387, -0.24086710421623891, 0.0392250053601707, -0.3370599506304515, -0.08080608243851559, 0.16415451136635723, 0.03300958582788806, -0.044247710262035896, -0.045659382919466314, 0.04505941945131647, -0.0905133637795879, -0.18213138984999835, 0.31716951661833553, -0.009944197207838795, 0.2641752905257702, 0.06176010133187757, 0.03160474371000732, -0.011533035120356791, 0.04668852510584836, 0.03689409462921531, -0.12370544009807716, 0.011729967899552008, 0.21193862210703784, -0.060947983812254206, 0.20937873850916092, -0.34715643483073916, -0.14369185446110558, 0.09917594896891095, 0.1387606510552998, 0.10411196331809708, -0.018936367149960817, -0.2371651780422478, 0.07837188031904424, -0.11416066605769049, -0.15012993514195183, -0.012541431432938744, 0.057841759038011364, -0.02676451118370163, -0.27823012867275887, 0.1396570709656829, 0.03563119159749768, 0.06881919350898684, -0.08168662731289664, -0.16089630702566543, -0.12060422899534795, 0.06388153503136942, 0.07371695569921191, 0.07539161692068205, 0.10354043666217289, -0.1201981469509145, -0.05019010299852548, 0.3978511734996427, -0.0706257145853992, -0.16583130763451193, 0.14635201136816767, -0.17253215178959447, -0.06946261684070762, 0.16278283454300244, 0.09978104409852055, 0.0907188744435718, -0.04505463978876227, 0.10451571577260532, 0.035193868097070494, 0.12771582641455043, 0.09162384265080642, 0.030962577095896903, 0.24219793488075303, 0.09686479786237473, 0.10496022202889045, 0.10038868027833546, -0.12374195740340171, -0.033129378898617466, -0.3206483133598215, -0.16323136727334964, -0.21000006018373119, 0.0655953633617672, -0.11245549827866469, -0.1775133599259308, 0.41738270422487356, 0.08381767510234014, 0.22833493800154797, 0.005537271107608113, 0.2748047607377745, 0.1745428777109819, 0.07017180277560262, 0.06857791202560216, 0.2865238485080704, 0.1242659846468701, 0.13338001780398814, -0.2524884578602133, 0.046269173590317646, 0.04124453786548763]
|
1,803.06281
|
Description of 2-local derivations on some Lie rings of skew-adjoint
matrices
|
In the present paper we prove that every 2-local inner derivation on the Lie
ring of skew-symmetric matrices over a commutative ring is an inner derivation.
We also apply our technique to various Lie algebras of infinite dimensional
skew-adjoint matrix-valued maps on a set and prove that every 2-local spatial
derivation on such algebras is a spatial derivation.
|
math.RA math.OA
|
in the present paper we prove that every 2local inner derivation on the lie ring of skewsymmetric matrices over a commutative ring is an inner derivation we also apply our technique to various lie algebras of infinite dimensional skewadjoint matrixvalued maps on a set and prove that every 2local spatial derivation on such algebras is a spatial derivation
|
[['in', 'the', 'present', 'paper', 'we', 'prove', 'that', 'every', '2local', 'inner', 'derivation', 'on', 'the', 'lie', 'ring', 'of', 'skewsymmetric', 'matrices', 'over', 'a', 'commutative', 'ring', 'is', 'an', 'inner', 'derivation', 'we', 'also', 'apply', 'our', 'technique', 'to', 'various', 'lie', 'algebras', 'of', 'infinite', 'dimensional', 'skewadjoint', 'matrixvalued', 'maps', 'on', 'a', 'set', 'and', 'prove', 'that', 'every', '2local', 'spatial', 'derivation', 'on', 'such', 'algebras', 'is', 'a', 'spatial', 'derivation']]
|
[-0.19213299657186045, -0.009435117587694048, -0.0866220630223638, -0.005344783385476932, -0.12208895873406837, -0.11414568284365895, -0.08995213845527955, 0.39475416970150223, -0.3121026611790575, -0.11919436165420659, 0.13019526611555945, -0.22823528430007142, -0.17535031445581337, 0.2079737600228139, -0.10786338218744716, -0.09425014418606036, 0.0862474122630625, 0.12914691117174668, -0.16349193348613536, -0.22248052357061734, 0.43413160697974523, -0.015398747793495142, 0.14075250549498816, 0.030465168974779803, 0.1762044898089792, 0.06470832668630214, -0.06815037422749246, -0.0017951745861049357, -0.1855734029941859, 0.11507629778171921, 0.27778651995648596, 0.07470552353108109, 0.2506501142192504, -0.3759986728154813, -0.11089321577536135, 0.17121973802367674, 0.16109290420768205, 0.05110529445689814, -0.05077160209826804, -0.24367736992907935, 0.08702020165671048, -0.24476295189353928, -0.13342052567268498, -0.05523101466804229, 0.09989609118101411, -0.05166323877999495, -0.2860773232893954, 0.015119776221550198, 0.16844218494049434, 0.14031489723329915, -0.10490701860619774, -0.0926626365760277, -0.01843360554756083, 0.040988738833252214, -0.16903361752789853, -0.03312532032101319, 0.1571616933757343, 0.06574829229279643, -0.1424638414273745, 0.29369522070769094, -0.012456224348139146, -0.2466466454146751, 0.16006537610343818, -0.219572591049404, -0.19433421580570526, 0.0750236813990592, 0.08587932878912523, 0.14585728252884642, -0.10271293254858203, 0.23846855174232243, -0.22183736066879897, 0.12481971946544945, 0.08165813330560923, 0.033041906478846896, 0.14940946417507425, 0.10123237187107062, 0.1666388543942895, 0.1327157369975386, 0.060106040359924326, -0.030330625780183692, -0.3926061923647749, -0.17990677604644462, -0.1756831474184733, 0.13856519566013895, -0.1513568555917651, -0.19261278584599495, 0.41019577603658725, 0.15910835268180656, 0.16805726996269718, 0.14893430587032747, 0.25422158970593894, 0.10787592002954374, 0.10944517794193635, 0.08194473279832766, 0.09430284117316377, 0.2937216116115451, -0.0021715322690052464, -0.15243379259482026, -0.06985235795507143, 0.23674949584528804]
|
1,803.06282
|
A mullti- or many- objective evolutionary algorithm with global loop
update
|
Multi- or many-objective evolutionary algorithm- s(MOEAs), especially the
decomposition-based MOEAs have been widely concerned in recent years. The
decomposition-based MOEAs emphasize convergence and diversity in a simple model
and have made a great success in dealing with theoretical and practical multi-
or many-objective optimization problems. In this paper, we focus on update
strategies of the decomposition- based MOEAs, and their criteria for comparing
solutions. Three disadvantages of the decomposition-based MOEAs with local
update strategies and several existing criteria for comparing solutions are
analyzed and discussed. And a global loop update strategy and two hybrid
criteria are suggested. Subsequently, an evolutionary algorithm with the global
loop update is implement- ed and compared to several of the best multi- or
many-objective optimization algorithms on two famous unconstraint test suites
with up to 15 objectives. Experimental results demonstrate that unlike
evolutionary algorithms with local update strategies, the population of our
algorithm does not degenerate at any generation of its evolution, which
guarantees the diversity of the resulting population. In addition, our
algorithm wins in most instances of the two test suites, indicating that it is
very compet- itive in terms of convergence and diversity. Running results of
our algorithm with different criteria for comparing solutions are also
compared. Their differences are very significant, indicating that the
performance of our algorithm is affected by the criterion it adopts.
|
cs.NE
|
multi or manyobjective evolutionary algorithm smoeas especially the decompositionbased moeas have been widely concerned in recent years the decompositionbased moeas emphasize convergence and diversity in a simple model and have made a great success in dealing with theoretical and practical multi or manyobjective optimization problems in this paper we focus on update strategies of the decomposition based moeas and their criteria for comparing solutions three disadvantages of the decompositionbased moeas with local update strategies and several existing criteria for comparing solutions are analyzed and discussed and a global loop update strategy and two hybrid criteria are suggested subsequently an evolutionary algorithm with the global loop update is implement ed and compared to several of the best multi or manyobjective optimization algorithms on two famous unconstraint test suites with up to 15 objectives experimental results demonstrate that unlike evolutionary algorithms with local update strategies the population of our algorithm does not degenerate at any generation of its evolution which guarantees the diversity of the resulting population in addition our algorithm wins in most instances of the two test suites indicating that it is very compet itive in terms of convergence and diversity running results of our algorithm with different criteria for comparing solutions are also compared their differences are very significant indicating that the performance of our algorithm is affected by the criterion it adopts
|
[['multi', 'or', 'manyobjective', 'evolutionary', 'algorithm', 'smoeas', 'especially', 'the', 'decompositionbased', 'moeas', 'have', 'been', 'widely', 'concerned', 'in', 'recent', 'years', 'the', 'decompositionbased', 'moeas', 'emphasize', 'convergence', 'and', 'diversity', 'in', 'a', 'simple', 'model', 'and', 'have', 'made', 'a', 'great', 'success', 'in', 'dealing', 'with', 'theoretical', 'and', 'practical', 'multi', 'or', 'manyobjective', 'optimization', 'problems', 'in', 'this', 'paper', 'we', 'focus', 'on', 'update', 'strategies', 'of', 'the', 'decomposition', 'based', 'moeas', 'and', 'their', 'criteria', 'for', 'comparing', 'solutions', 'three', 'disadvantages', 'of', 'the', 'decompositionbased', 'moeas', 'with', 'local', 'update', 'strategies', 'and', 'several', 'existing', 'criteria', 'for', 'comparing', 'solutions', 'are', 'analyzed', 'and', 'discussed', 'and', 'a', 'global', 'loop', 'update', 'strategy', 'and', 'two', 'hybrid', 'criteria', 'are', 'suggested', 'subsequently', 'an', 'evolutionary', 'algorithm', 'with', 'the', 'global', 'loop', 'update', 'is', 'implement', 'ed', 'and', 'compared', 'to', 'several', 'of', 'the', 'best', 'multi', 'or', 'manyobjective', 'optimization', 'algorithms', 'on', 'two', 'famous', 'unconstraint', 'test', 'suites', 'with', 'up', 'to', '15', 'objectives', 'experimental', 'results', 'demonstrate', 'that', 'unlike', 'evolutionary', 'algorithms', 'with', 'local', 'update', 'strategies', 'the', 'population', 'of', 'our', 'algorithm', 'does', 'not', 'degenerate', 'at', 'any', 'generation', 'of', 'its', 'evolution', 'which', 'guarantees', 'the', 'diversity', 'of', 'the', 'resulting', 'population', 'in', 'addition', 'our', 'algorithm', 'wins', 'in', 'most', 'instances', 'of', 'the', 'two', 'test', 'suites', 'indicating', 'that', 'it', 'is', 'very', 'compet', 'itive', 'in', 'terms', 'of', 'convergence', 'and', 'diversity', 'running', 'results', 'of', 'our', 'algorithm', 'with', 'different', 'criteria', 'for', 'comparing', 'solutions', 'are', 'also', 'compared', 'their', 'differences', 'are', 'very', 'significant', 'indicating', 'that', 'the', 'performance', 'of', 'our', 'algorithm', 'is', 'affected', 'by', 'the', 'criterion', 'it', 'adopts']]
|
[-0.06272463804228348, -0.02318267818892465, -0.1063792323148264, 0.07124766519333567, -0.050693331769801814, -0.1774696314808082, 0.05626118715867182, 0.43302994599012107, -0.21598902970042735, -0.3635554515362323, 0.15822066473858515, -0.22152568344110707, -0.1658517585890074, 0.21176615603863858, -0.07080668537994964, 0.08984093127487991, 0.09920524159416992, -0.012635616484928775, -0.06694821224690557, -0.32825543515610733, 0.2845180407669899, 0.043867129501613984, 0.29428692054326505, -0.003394751650121835, 0.09786283214277507, -0.04895611412336563, -0.08411021288987752, 0.05145390005992004, -0.10160897584651835, 0.1063877092789741, 0.2294900578924933, 0.2214492954028485, 0.33770969750040825, -0.3887400607419041, -0.16308660339878722, 0.1082934253358257, 0.16283045707297772, 0.1051372581351389, -0.07699813346193919, -0.23283963505312935, 0.10927034636355333, -0.14588723742447138, -0.053935414757123344, -0.07315215123093662, -0.03374404532977523, 0.0727772145146118, -0.28658121004742615, 0.008848959446736812, 0.02333145448938012, 0.022820314575985143, -0.07774994063646289, -0.21321346080517983, 0.032460996841273466, 0.0948322067700058, 0.0707278715772764, 0.009580477470162886, 0.07433553986636258, -0.1204247486254259, -0.23010146108415053, 0.38431699498376165, -0.026730120893114724, -0.18581119712207755, 0.24246591578556542, -0.0369167312474183, -0.17287378453204896, 0.11198942597770879, 0.16833641829266976, 0.165642380785734, -0.14120888758947872, 0.04480931694936091, -0.005111697982830994, 0.12702424912126148, 0.02791633971899681, 0.030997555644192674, 0.14351913767136834, 0.21894309580061785, 0.07942662930728549, 0.09115752469022498, -0.04634831473913027, -0.1733817485085613, -0.20559266733576184, -0.10500684655313422, -0.13869112460697824, -0.07177935265363057, -0.1112420512482614, -0.1338841793555263, 0.4180457927664188, 0.17834608495310955, 0.15799598246057694, 0.09003751065533792, 0.32159173250332607, 0.05982010195195373, 0.03694223310856876, 0.11135929108540704, 0.26325098299872346, 0.07287664818556493, 0.09831050512808803, -0.24722562335129525, 0.10818033424250127, 0.05152768220242243]
|
1,803.06283
|
On hadron deformation: a model independent extraction of EMR from pion
photoproduction data
|
The multipole content of pion photoproduction at the $\Delta^+ (1232)$
resonance has been extracted from a data set dominated by recent Mainz
Microtron (MAMI) precision measurements. The analysis has been carried out in
the Athens Model Independent Analysis Scheme (AMIAS), thus eliminating any
model bias. The benchmark quantity for nucleon deformation, $EMR = E2/M1 =
E_{1+}^{3/2}/M_{1+}^{3/2}$, was determined to be $-2.5 \pm 0.4_{stat+syst}$,
thus reconfirming in a model independent way that the conjecture of baryon
deformation is valid. The derived multipole amplitudes provide stringent
constraints on QCD simulations and QCD inspired models striving to describe
hadronic structure. They are in good agreement with phenomenological models
which explicitly incorporate pionic degrees of freedom and with lattice QCD
calculations.
|
nucl-ex
|
the multipole content of pion photoproduction at the delta 1232 resonance has been extracted from a data set dominated by recent mainz microtron mami precision measurements the analysis has been carried out in the athens model independent analysis scheme amias thus eliminating any model bias the benchmark quantity for nucleon deformation emr e2m1 e_132m_132 was determined to be 25 pm 04_statsyst thus reconfirming in a model independent way that the conjecture of baryon deformation is valid the derived multipole amplitudes provide stringent constraints on qcd simulations and qcd inspired models striving to describe hadronic structure they are in good agreement with phenomenological models which explicitly incorporate pionic degrees of freedom and with lattice qcd calculations
|
[['the', 'multipole', 'content', 'of', 'pion', 'photoproduction', 'at', 'the', 'delta', '1232', 'resonance', 'has', 'been', 'extracted', 'from', 'a', 'data', 'set', 'dominated', 'by', 'recent', 'mainz', 'microtron', 'mami', 'precision', 'measurements', 'the', 'analysis', 'has', 'been', 'carried', 'out', 'in', 'the', 'athens', 'model', 'independent', 'analysis', 'scheme', 'amias', 'thus', 'eliminating', 'any', 'model', 'bias', 'the', 'benchmark', 'quantity', 'for', 'nucleon', 'deformation', 'emr', 'e2m1', 'e_132m_132', 'was', 'determined', 'to', 'be', '25', 'pm', '04_statsyst', 'thus', 'reconfirming', 'in', 'a', 'model', 'independent', 'way', 'that', 'the', 'conjecture', 'of', 'baryon', 'deformation', 'is', 'valid', 'the', 'derived', 'multipole', 'amplitudes', 'provide', 'stringent', 'constraints', 'on', 'qcd', 'simulations', 'and', 'qcd', 'inspired', 'models', 'striving', 'to', 'describe', 'hadronic', 'structure', 'they', 'are', 'in', 'good', 'agreement', 'with', 'phenomenological', 'models', 'which', 'explicitly', 'incorporate', 'pionic', 'degrees', 'of', 'freedom', 'and', 'with', 'lattice', 'qcd', 'calculations']]
|
[-0.07494298058182858, 0.1515026715361571, -0.13078326970726187, 0.04787208278049443, -0.06973036580545976, -0.12531217696985839, 0.056761716090686684, 0.3277851181945442, -0.16163294284761084, -0.2928641644693845, -0.004753549479203612, -0.33788185424698863, -0.015160143569078856, 0.15055534148803063, 0.0674238429297652, 0.10064687980524371, 0.07937220591367676, 0.010352577789804066, -0.03940718954293041, -0.21135102750360554, 0.2531879475274313, 0.11374001596452651, 0.2702879188499883, 0.120616374924713, 0.08297654412289159, -0.00035341806293555855, -0.08245620491040821, -0.019306382781978434, -0.16174952814437138, 0.07153760384360279, 0.2571885543780744, 0.07556915523335482, 0.1292218878984748, -0.38208797519235355, -0.20874893147523094, 0.07877065898207701, 0.14482326947762508, 0.1347424383800625, -0.0103020908824061, -0.28104855507546295, 0.09327201370924579, -0.2141404930353824, -0.15216049856498046, -0.16850456811355807, -0.006832386224852067, -0.04234300513104824, -0.3143079692927453, 0.08970894011569959, -0.07533353135253476, 0.08984384294005628, -0.03995870054180248, -0.24013379913861904, -0.005814835853643913, 0.06802278166673913, 0.06182389711524335, 0.12586947421304287, 0.13021628489816742, -0.13416730515057204, -0.11919491350047076, 0.4189909560980885, -0.002206125687107246, -0.1620318135584033, 0.06763348270689788, -0.17805166730855024, -0.18125366139332805, 0.13136905121856032, 0.15135386294944922, 0.05930418624600346, -0.20807660267270062, 0.12055656661596809, -0.04744109560002004, 0.21328926821593688, 0.09783066075039715, 0.01544113473216457, 0.21417709245692643, 0.18188974765681587, -0.08107956830181379, 0.031004623517155053, -0.06603717143993527, -0.08741338744726593, -0.3274549585973135, 0.001754609591830357, -0.14759445923743192, 0.05844106133697571, -0.08186818978237194, -0.06622750441486065, 0.3383413532582888, 0.11878875915303135, 0.19577080138703495, -0.025543410103331294, 0.31914369841889206, 0.09674903519971366, 0.09325497284213126, 0.037786660217309156, 0.280721159511765, 0.1988699690838534, 0.11000583608906749, -0.2229290127577013, 0.010075881208738197, 0.05763791338334569]
|
1,803.06284
|
Oriented cobordism of random manifolds
|
We introduce a general framework allowing the systematic study of random
manifolds. In order to do so, we will put ourselves in a more general context
than usual by allowing the underlying probability space to be non commutative.
We introduce in this paper the oriented cobordism groups of random manifolds,
which we compute in dimensions 0 and 1, and we prove the surjectivity of the
corresponding Thom-Pontryagin homomorphism. Non commutative and usual
(commutative) random manifolds are naturally related in this setting since two
commutative random manifolds can be cobordant through a non commutative one,
even if they are not cobordant as usual random manifolds. The main interest of
our approach is that expected characteristic numbers can be generalized to the
non commutative case and remain naturally invariant up to cobordism. This
includes Hirzebruch signature, Pontryagin numbers and, more generally, the
expected index of random elliptic differential operators
|
math.DS
|
we introduce a general framework allowing the systematic study of random manifolds in order to do so we will put ourselves in a more general context than usual by allowing the underlying probability space to be non commutative we introduce in this paper the oriented cobordism groups of random manifolds which we compute in dimensions 0 and 1 and we prove the surjectivity of the corresponding thompontryagin homomorphism non commutative and usual commutative random manifolds are naturally related in this setting since two commutative random manifolds can be cobordant through a non commutative one even if they are not cobordant as usual random manifolds the main interest of our approach is that expected characteristic numbers can be generalized to the non commutative case and remain naturally invariant up to cobordism this includes hirzebruch signature pontryagin numbers and more generally the expected index of random elliptic differential operators
|
[['we', 'introduce', 'a', 'general', 'framework', 'allowing', 'the', 'systematic', 'study', 'of', 'random', 'manifolds', 'in', 'order', 'to', 'do', 'so', 'we', 'will', 'put', 'ourselves', 'in', 'a', 'more', 'general', 'context', 'than', 'usual', 'by', 'allowing', 'the', 'underlying', 'probability', 'space', 'to', 'be', 'non', 'commutative', 'we', 'introduce', 'in', 'this', 'paper', 'the', 'oriented', 'cobordism', 'groups', 'of', 'random', 'manifolds', 'which', 'we', 'compute', 'in', 'dimensions', '0', 'and', '1', 'and', 'we', 'prove', 'the', 'surjectivity', 'of', 'the', 'corresponding', 'thompontryagin', 'homomorphism', 'non', 'commutative', 'and', 'usual', 'commutative', 'random', 'manifolds', 'are', 'naturally', 'related', 'in', 'this', 'setting', 'since', 'two', 'commutative', 'random', 'manifolds', 'can', 'be', 'cobordant', 'through', 'a', 'non', 'commutative', 'one', 'even', 'if', 'they', 'are', 'not', 'cobordant', 'as', 'usual', 'random', 'manifolds', 'the', 'main', 'interest', 'of', 'our', 'approach', 'is', 'that', 'expected', 'characteristic', 'numbers', 'can', 'be', 'generalized', 'to', 'the', 'non', 'commutative', 'case', 'and', 'remain', 'naturally', 'invariant', 'up', 'to', 'cobordism', 'this', 'includes', 'hirzebruch', 'signature', 'pontryagin', 'numbers', 'and', 'more', 'generally', 'the', 'expected', 'index', 'of', 'random', 'elliptic', 'differential', 'operators']]
|
[-0.16026411722063355, 0.13104722846206915, -0.09884650390340041, 0.13907420825474728, -0.10991917505751887, -0.17825076127845846, -0.03340507752488508, 0.3403487028713555, -0.3265332493242131, -0.2310190700976918, 0.10000626047776552, -0.24269706443309375, -0.16216924980805855, 0.17622560819001767, -0.1858480040379481, -0.01066548092616084, 0.012683592369933038, 0.08545453106499698, -0.08102308016522367, -0.2723634940961197, 0.43707564353228434, -0.023526057603367134, 0.19743923775928274, 0.014810785756459178, 0.028902632793513676, 0.010068375065488971, -0.046546915562006914, 0.07022521306408971, -0.11795395933122937, 0.11917572583339803, 0.32075626109025046, 0.023956741625762046, 0.21244270620510392, -0.3979883150593059, -0.15285247335312505, 0.2316571043466205, 0.1349031077634084, 0.060591224039592204, 0.019765780639654496, -0.2754767607173512, 0.11621032054982569, -0.17751247048926577, -0.13083992199653327, -0.12331529644681523, -0.012237577539651769, -0.006577666207417616, -0.25345490310558005, 0.012178597652850903, 0.12940159986076288, 0.06479114752058705, -0.025306037542639836, -0.06610879266462352, -0.016014646574510388, 0.09108469130675474, 0.003976893709328229, 0.021708256354529974, 0.10989313550637908, -0.02728456457317743, -0.13179867704437204, 0.40082708906943665, -0.06590518045643017, -0.27556061284131794, 0.1466278046710825, -0.19365316195962057, -0.19715551964377295, 0.11625148534570655, 0.1267339187125637, 0.19828674128304605, -0.08331873136891885, 0.15422209682164725, -0.08385937537819352, 0.08057702015862124, 0.07074753159325417, 0.020187263416081718, 0.15203062305226922, 0.04569514780241537, 0.12502989506712567, 0.1413813286519941, 0.007567940630682119, -0.11161836524085741, -0.32705414929261356, -0.17750029549423657, -0.10342429707477456, 0.1860078655563858, -0.09768504324982705, -0.17056959655856688, 0.38383072740653507, 0.11248039785287764, 0.1722331213547963, 0.14355443822369873, 0.25135039797448233, 0.09184149966881394, 0.044449347830441306, 0.07139709364775926, 0.1507408805414779, 0.2047730065413355, 0.04468189515109646, -0.05133751186554971, -0.014701711776194303, 0.14095370543878272]
|
1,803.06285
|
Visible Light-Activated Photosensitization of Hybridization of Far-red
Fluorescent Protein and Silk
|
Fluorescent proteins often result in phototoxicity and cytotoxicity, in
particular because some red fluorescent proteins (RFP) produce and release
reactive oxygen species (ROS). The photogeneration of ROS is considered as a
detrimental side effect in cellular imaging or is proactively utilized for
ablating cancerous tissue. As ancient textiles or biomaterials, silk produced
by silkworms can directly be used as fabrics or be processed into materials and
structures to host other functional nanomaterials. We report that transgenic
fusion of far-red fluorescent protein (mKate2) with silk provides a
photosensitizer hybridization platform for photoinducible control of ROS.
Taking advantage of green (visible) light activation, native and regenerated
mKate2 silk can produce and release superoxide and singlet oxygen, in a
comparable manner of visible light-driven plasmonic photocatalysis. Thus, the
genetic expression of mKate2 in silk offers immediately exploitable and
scalable photocatalyst-like biomaterials. We further envision that mKate2 silk
could potentially rule out hazardous concerns associated with foreign
semiconductor photocatalytic nanomaterials.
|
physics.chem-ph physics.optics
|
fluorescent proteins often result in phototoxicity and cytotoxicity in particular because some red fluorescent proteins rfp produce and release reactive oxygen species ros the photogeneration of ros is considered as a detrimental side effect in cellular imaging or is proactively utilized for ablating cancerous tissue as ancient textiles or biomaterials silk produced by silkworms can directly be used as fabrics or be processed into materials and structures to host other functional nanomaterials we report that transgenic fusion of farred fluorescent protein mkate2 with silk provides a photosensitizer hybridization platform for photoinducible control of ros taking advantage of green visible light activation native and regenerated mkate2 silk can produce and release superoxide and singlet oxygen in a comparable manner of visible lightdriven plasmonic photocatalysis thus the genetic expression of mkate2 in silk offers immediately exploitable and scalable photocatalystlike biomaterials we further envision that mkate2 silk could potentially rule out hazardous concerns associated with foreign semiconductor photocatalytic nanomaterials
|
[['fluorescent', 'proteins', 'often', 'result', 'in', 'phototoxicity', 'and', 'cytotoxicity', 'in', 'particular', 'because', 'some', 'red', 'fluorescent', 'proteins', 'rfp', 'produce', 'and', 'release', 'reactive', 'oxygen', 'species', 'ros', 'the', 'photogeneration', 'of', 'ros', 'is', 'considered', 'as', 'a', 'detrimental', 'side', 'effect', 'in', 'cellular', 'imaging', 'or', 'is', 'proactively', 'utilized', 'for', 'ablating', 'cancerous', 'tissue', 'as', 'ancient', 'textiles', 'or', 'biomaterials', 'silk', 'produced', 'by', 'silkworms', 'can', 'directly', 'be', 'used', 'as', 'fabrics', 'or', 'be', 'processed', 'into', 'materials', 'and', 'structures', 'to', 'host', 'other', 'functional', 'nanomaterials', 'we', 'report', 'that', 'transgenic', 'fusion', 'of', 'farred', 'fluorescent', 'protein', 'mkate2', 'with', 'silk', 'provides', 'a', 'photosensitizer', 'hybridization', 'platform', 'for', 'photoinducible', 'control', 'of', 'ros', 'taking', 'advantage', 'of', 'green', 'visible', 'light', 'activation', 'native', 'and', 'regenerated', 'mkate2', 'silk', 'can', 'produce', 'and', 'release', 'superoxide', 'and', 'singlet', 'oxygen', 'in', 'a', 'comparable', 'manner', 'of', 'visible', 'lightdriven', 'plasmonic', 'photocatalysis', 'thus', 'the', 'genetic', 'expression', 'of', 'mkate2', 'in', 'silk', 'offers', 'immediately', 'exploitable', 'and', 'scalable', 'photocatalystlike', 'biomaterials', 'we', 'further', 'envision', 'that', 'mkate2', 'silk', 'could', 'potentially', 'rule', 'out', 'hazardous', 'concerns', 'associated', 'with', 'foreign', 'semiconductor', 'photocatalytic', 'nanomaterials']]
|
[-0.046302124886816134, 0.15194878238405474, -0.022130776446288317, 0.02661179977444798, -0.07582499512647783, -0.19758505478282185, 0.04961639738891249, 0.4393462360489602, -0.2610976666461652, -0.27244821845803385, 0.047536523229734715, -0.2889310977348656, -0.21817777334640923, 0.22510693603259163, -0.09379454973622475, -0.01907314468491701, 0.07125995454783217, -0.10475851771318251, 0.1489757987270375, -0.15405849448642603, 0.1412113990415545, 0.11256373307387667, 0.29926264892922705, 0.11489424583642116, 0.060203435562940597, -0.022242492847783745, 0.018748141748159575, -0.042515786567069835, -0.0739386266503929, 0.17508756668836462, 0.3265963949603972, 0.10164882996259561, 0.24514309870188727, -0.5139396939353615, -0.25540291480841787, 0.06280832013626601, 0.20999690759440068, 0.13608069440313414, -0.1260874992072144, -0.2708810829843571, 0.07305398944984465, -0.16182378278185425, -0.09804707470356054, -0.06412165338672648, -0.030030894809968622, 0.04087303175052226, -0.2095124695413545, 0.08072998238045698, -0.0028906584807878565, 0.07518265579273206, -0.1044342910210462, -0.12666106511978736, -0.1367232358095303, 0.12423601549794423, -0.0014224608171597318, -0.01823074874632499, 0.32606682556626554, -0.11727817509980763, -0.07948782079810508, 0.39149459389348823, -0.05130728981891355, -0.09775794618549982, 0.20820182288412517, -0.058581350751683796, -0.09834897212967203, 0.18001760933182986, 0.13227884119355235, 0.11524104026261887, -0.2242761087524735, -0.013657470078137552, 0.06736073317196452, 0.16951128133128282, 0.15411703080985867, 0.07041481882942463, 0.21844647069814693, 0.22471242978274092, -0.0011645662370046565, 0.16545423329084977, -0.06458384818831167, 0.030030224790334018, -0.11088758970008177, -0.2513250804512329, -0.09989101052043801, 0.09773312773923785, -0.013874628783597038, -0.1865034756004153, 0.32796453861702307, 0.06701860822823957, 0.11139415500737312, -0.05535768758919504, 0.2659557723604581, -0.05907392548016741, 0.16125384235683846, -0.08117553695817203, 0.17740990381381244, 0.05306538973107106, 0.13433822262362619, -0.2298854669370366, 0.1724615804120606, -0.009837928056120385]
|
1,803.06286
|
Nonequilibrium phase transitions of sheared colloidal microphases:
Results from dynamical density functional theory
|
By means of classical density functional theory and its dynamical extension,
we consider a colloidal fluid with spherically-symmetric competing
interactions, which are well known to exhibit a rich bulk phase behavior. This
includes complex three-dimensional periodically ordered cluster phases such as
lamellae, two-dimensional hexagonally packed cylinders, gyroid structures or
spherical micelles. While the bulk phase behavior has been studied extensively
in earlier work, in this paper we focus on such structures confined between
planar repulsive walls under shear flow. For sufficiently high shear rates, we
observe that microphase separation can become fully suppressed. For lower shear
rates, however, we find that e.g. the gyroid structure undergoes a kinetic
phase transition to a hexagonally packed cylindrical phase, which is found
experimentally and theoretically in amphiphilic block copolymer systems. As
such, besides the known similarities between the latter and colloidal systems
regarding the equilibrium phase behavior, our work reveals further intriguing
non-equilibrium relations between copolymer melts and colloidal fluids with
competing interactions.
|
cond-mat.soft
|
by means of classical density functional theory and its dynamical extension we consider a colloidal fluid with sphericallysymmetric competing interactions which are well known to exhibit a rich bulk phase behavior this includes complex threedimensional periodically ordered cluster phases such as lamellae twodimensional hexagonally packed cylinders gyroid structures or spherical micelles while the bulk phase behavior has been studied extensively in earlier work in this paper we focus on such structures confined between planar repulsive walls under shear flow for sufficiently high shear rates we observe that microphase separation can become fully suppressed for lower shear rates however we find that eg the gyroid structure undergoes a kinetic phase transition to a hexagonally packed cylindrical phase which is found experimentally and theoretically in amphiphilic block copolymer systems as such besides the known similarities between the latter and colloidal systems regarding the equilibrium phase behavior our work reveals further intriguing nonequilibrium relations between copolymer melts and colloidal fluids with competing interactions
|
[['by', 'means', 'of', 'classical', 'density', 'functional', 'theory', 'and', 'its', 'dynamical', 'extension', 'we', 'consider', 'a', 'colloidal', 'fluid', 'with', 'sphericallysymmetric', 'competing', 'interactions', 'which', 'are', 'well', 'known', 'to', 'exhibit', 'a', 'rich', 'bulk', 'phase', 'behavior', 'this', 'includes', 'complex', 'threedimensional', 'periodically', 'ordered', 'cluster', 'phases', 'such', 'as', 'lamellae', 'twodimensional', 'hexagonally', 'packed', 'cylinders', 'gyroid', 'structures', 'or', 'spherical', 'micelles', 'while', 'the', 'bulk', 'phase', 'behavior', 'has', 'been', 'studied', 'extensively', 'in', 'earlier', 'work', 'in', 'this', 'paper', 'we', 'focus', 'on', 'such', 'structures', 'confined', 'between', 'planar', 'repulsive', 'walls', 'under', 'shear', 'flow', 'for', 'sufficiently', 'high', 'shear', 'rates', 'we', 'observe', 'that', 'microphase', 'separation', 'can', 'become', 'fully', 'suppressed', 'for', 'lower', 'shear', 'rates', 'however', 'we', 'find', 'that', 'eg', 'the', 'gyroid', 'structure', 'undergoes', 'a', 'kinetic', 'phase', 'transition', 'to', 'a', 'hexagonally', 'packed', 'cylindrical', 'phase', 'which', 'is', 'found', 'experimentally', 'and', 'theoretically', 'in', 'amphiphilic', 'block', 'copolymer', 'systems', 'as', 'such', 'besides', 'the', 'known', 'similarities', 'between', 'the', 'latter', 'and', 'colloidal', 'systems', 'regarding', 'the', 'equilibrium', 'phase', 'behavior', 'our', 'work', 'reveals', 'further', 'intriguing', 'nonequilibrium', 'relations', 'between', 'copolymer', 'melts', 'and', 'colloidal', 'fluids', 'with', 'competing', 'interactions']]
|
[-0.17320105325725307, 0.23928800330031663, -0.09051920182319009, 0.020705980576894944, -0.014042328817595262, -0.15355090059529175, -0.009084023047762457, 0.4143661569920368, -0.2793215800833423, -0.2681930737628136, 0.05559795576118631, -0.27524742995155976, -0.22923516130977079, 0.09260856632463402, 0.04419527820537041, 0.06902409000285843, -0.010656154604657787, -0.04897940250084502, -0.0999249621105264, -0.1693531176279066, 0.2559411001653643, -0.0009252091345842928, 0.318688288606063, 0.021929544359954888, 0.03664667583252594, -0.001185500667861561, 0.09590313737571705, 0.1154819015879184, -0.23962283805640255, 0.022092211996641707, 0.2486698175256606, -0.0773196063193609, 0.1677641057758592, -0.48350248076603747, -0.27002020639863533, 0.07436788305058144, 0.17738026030738183, 0.12584351612167666, -0.11083971542175278, -0.25699278177053203, 0.03253805040876614, -0.16992892362759449, -0.12364475943322759, -0.0906837206101045, 0.025735417954274455, 0.056512609307901585, -0.20479498375098046, 0.16764006740995682, 0.08987040021147549, 0.060726180010533426, -0.06865735111714458, -0.06008929159725085, -0.0630798932077596, 0.08462390352069633, 0.03894661899612402, -0.002075243143190164, 0.1726863308052998, -0.1159554127658339, -0.060624853971239644, 0.4107061268296093, -0.01417416962867719, -0.15895037487789523, 0.29890208756551145, -0.14642546616387336, -0.11041733114980161, 0.16421798334049525, 0.15427015275345185, 0.11206046876468463, -0.13050645568764593, 0.04761307117878459, -0.023805802947754272, 0.19396883280714974, 0.08858862811612198, 0.009385866508819164, 0.2710115440946538, 0.23628721967688762, 0.017963645662530326, 0.23636068573105148, -0.04572279750282178, -0.19029617947307997, -0.15719537439290435, -0.14959184741892387, -0.16139987732458394, -0.00017509711906313897, -0.08450551687747065, -0.25188742723548785, 0.2974133397568949, 0.04381039746112947, 0.18791883628000505, 0.0162071334416396, 0.2238611256732838, -0.019710377170849825, 0.029887067119125275, 0.034261058704578316, 0.2737559423039784, 0.1597703983381507, 0.1199714705828228, -0.21224551329796668, 0.07237903971545165, 0.06193326555658132]
|
1,803.06287
|
Reduced Basis Kriging for Big Spatial Fields
|
In spatial statistics, a common method for prediction over a Gaussian random
field (GRF) is maximum likelihood estimation combined with kriging. For massive
data sets, kriging is computationally intensive, both in terms of CPU time and
memory, and so fixed rank kriging has been proposed as a solution. The method
however still involves operations on large matrices, so we develop an
alteration to this method by utilizing the approximations made in fixed rank
kriging combined with restricted maximum likelihood estimation and sparse
matrix methodology. Experiments show that our methodology can provide
additional gains in computational efficiency over fixed-rank kriging without
loss of accuracy in prediction. The methodology is applied to climate data
archived by the United States National Climate Data Center, with very good
results.
|
stat.ME stat.AP stat.CO
|
in spatial statistics a common method for prediction over a gaussian random field grf is maximum likelihood estimation combined with kriging for massive data sets kriging is computationally intensive both in terms of cpu time and memory and so fixed rank kriging has been proposed as a solution the method however still involves operations on large matrices so we develop an alteration to this method by utilizing the approximations made in fixed rank kriging combined with restricted maximum likelihood estimation and sparse matrix methodology experiments show that our methodology can provide additional gains in computational efficiency over fixedrank kriging without loss of accuracy in prediction the methodology is applied to climate data archived by the united states national climate data center with very good results
|
[['in', 'spatial', 'statistics', 'a', 'common', 'method', 'for', 'prediction', 'over', 'a', 'gaussian', 'random', 'field', 'grf', 'is', 'maximum', 'likelihood', 'estimation', 'combined', 'with', 'kriging', 'for', 'massive', 'data', 'sets', 'kriging', 'is', 'computationally', 'intensive', 'both', 'in', 'terms', 'of', 'cpu', 'time', 'and', 'memory', 'and', 'so', 'fixed', 'rank', 'kriging', 'has', 'been', 'proposed', 'as', 'a', 'solution', 'the', 'method', 'however', 'still', 'involves', 'operations', 'on', 'large', 'matrices', 'so', 'we', 'develop', 'an', 'alteration', 'to', 'this', 'method', 'by', 'utilizing', 'the', 'approximations', 'made', 'in', 'fixed', 'rank', 'kriging', 'combined', 'with', 'restricted', 'maximum', 'likelihood', 'estimation', 'and', 'sparse', 'matrix', 'methodology', 'experiments', 'show', 'that', 'our', 'methodology', 'can', 'provide', 'additional', 'gains', 'in', 'computational', 'efficiency', 'over', 'fixedrank', 'kriging', 'without', 'loss', 'of', 'accuracy', 'in', 'prediction', 'the', 'methodology', 'is', 'applied', 'to', 'climate', 'data', 'archived', 'by', 'the', 'united', 'states', 'national', 'climate', 'data', 'center', 'with', 'very', 'good', 'results']]
|
[-0.037196272619068625, -0.0022546149332774803, -0.09459087264537812, 0.06692197493091226, -0.04872835457697511, -0.14171805039420723, 0.08725166373699904, 0.424038133084774, -0.22287126166373492, -0.3351169208288193, 0.1471505350349471, -0.2379750872030854, -0.14484209115803243, 0.2071678019464016, -0.12301957618445158, 0.15508261518040672, 0.13738204842805862, 0.012165946809807792, -0.08899536934681236, -0.3252712609190494, 0.23264052603393792, 0.12601419299840927, 0.3406891663819551, -0.02600172410905361, 0.11366693847160786, 0.016335692167282104, -0.0825913500227034, 0.0157161260554567, -0.04049038855760591, 0.14465787537954747, 0.30964949725568297, 0.2027525461325422, 0.3548512447923422, -0.4225878322869539, -0.255938205242157, 0.12001518749305978, 0.09936041115783155, 0.0768309943638742, -0.03306359227467328, -0.2466956216543913, 0.05666885314136744, -0.18857658734172583, -0.07000729961320758, -0.17073140570521356, -0.03038383945915848, -0.021841504496522248, -0.3603993139711674, 0.07938816497847438, -0.02439930705726147, 0.1177223317027092, -0.0130942946895957, -0.17517127668112517, 0.008674678741022944, 0.06364021922275424, 0.05338730527274311, 0.026646580153144896, 0.08306789937056601, -0.09142883638106286, -0.10195824965834617, 0.3350040023997426, -0.0900286863297224, -0.2524711249768734, 0.16421748935058714, -0.11108389447629452, -0.13109219124075025, 0.14172705732285976, 0.21797681145370007, 0.06665702574746683, -0.14992429582774638, 0.0901049242191948, -0.03260209005698562, 0.17411071192473174, 0.02680998229049146, -0.05689873946132138, 0.15640575529122724, 0.2066833688467741, 0.10457718067616224, 0.10565874369256198, -0.13606809297762812, -0.09226253154873848, -0.20863115765713156, -0.0981687498614192, -0.256961439833045, -0.033966632053256035, -0.16246553665737157, -0.17512971426546572, 0.37449085687845945, 0.18753399921953678, 0.16444125559553505, 0.09687322731316089, 0.35933796226233244, 0.08312686141952873, 0.10297837733477354, 0.12110590460896492, 0.16507065004482865, 0.11548028090037406, 0.07141712482832373, -0.16834074766281992, 0.1019795775860548, 0.033878047924488786]
|
1,803.06288
|
ORGaNICs: A Theory of Working Memory in Brains and Machines
|
Working memory is a cognitive process that is responsible for temporarily
holding and manipulating information. Most of the empirical neuroscience
research on working memory has focused on measuring sustained activity in
prefrontal cortex (PFC) and/or parietal cortex during simple delayed-response
tasks, and most of the models of working memory have been based on neural
integrators. But working memory means much more than just holding a piece of
information online. We describe a new theory of working memory, based on a
recurrent neural circuit that we call ORGaNICs (Oscillatory Recurrent GAted
Neural Integrator Circuits). ORGaNICs are a variety of Long Short Term Memory
units (LSTMs), imported from machine learning and artificial intelligence.
ORGaNICs can be used to explain the complex dynamics of delay-period activity
in prefrontal cortex (PFC) during a working memory task. The theory is
analytically tractable so that we can characterize the dynamics, and the theory
provides a means for reading out information from the dynamically varying
responses at any point in time, in spite of the complex dynamics. ORGaNICs can
be implemented with a biophysical (electrical circuit) model of pyramidal
cells, combined with shunting inhibition via a thalamocortical loop. Although
introduced as a computational theory of working memory, ORGaNICs are also
applicable to models of sensory processing, motor preparation and motor
control. ORGaNICs offer computational advantages compared to other varieties of
LSTMs that are commonly used in AI applications. Consequently, ORGaNICs are a
framework for canonical computation in brains and machines.
|
cs.AI q-bio.NC
|
working memory is a cognitive process that is responsible for temporarily holding and manipulating information most of the empirical neuroscience research on working memory has focused on measuring sustained activity in prefrontal cortex pfc andor parietal cortex during simple delayedresponse tasks and most of the models of working memory have been based on neural integrators but working memory means much more than just holding a piece of information online we describe a new theory of working memory based on a recurrent neural circuit that we call organics oscillatory recurrent gated neural integrator circuits organics are a variety of long short term memory units lstms imported from machine learning and artificial intelligence organics can be used to explain the complex dynamics of delayperiod activity in prefrontal cortex pfc during a working memory task the theory is analytically tractable so that we can characterize the dynamics and the theory provides a means for reading out information from the dynamically varying responses at any point in time in spite of the complex dynamics organics can be implemented with a biophysical electrical circuit model of pyramidal cells combined with shunting inhibition via a thalamocortical loop although introduced as a computational theory of working memory organics are also applicable to models of sensory processing motor preparation and motor control organics offer computational advantages compared to other varieties of lstms that are commonly used in ai applications consequently organics are a framework for canonical computation in brains and machines
|
[['working', 'memory', 'is', 'a', 'cognitive', 'process', 'that', 'is', 'responsible', 'for', 'temporarily', 'holding', 'and', 'manipulating', 'information', 'most', 'of', 'the', 'empirical', 'neuroscience', 'research', 'on', 'working', 'memory', 'has', 'focused', 'on', 'measuring', 'sustained', 'activity', 'in', 'prefrontal', 'cortex', 'pfc', 'andor', 'parietal', 'cortex', 'during', 'simple', 'delayedresponse', 'tasks', 'and', 'most', 'of', 'the', 'models', 'of', 'working', 'memory', 'have', 'been', 'based', 'on', 'neural', 'integrators', 'but', 'working', 'memory', 'means', 'much', 'more', 'than', 'just', 'holding', 'a', 'piece', 'of', 'information', 'online', 'we', 'describe', 'a', 'new', 'theory', 'of', 'working', 'memory', 'based', 'on', 'a', 'recurrent', 'neural', 'circuit', 'that', 'we', 'call', 'organics', 'oscillatory', 'recurrent', 'gated', 'neural', 'integrator', 'circuits', 'organics', 'are', 'a', 'variety', 'of', 'long', 'short', 'term', 'memory', 'units', 'lstms', 'imported', 'from', 'machine', 'learning', 'and', 'artificial', 'intelligence', 'organics', 'can', 'be', 'used', 'to', 'explain', 'the', 'complex', 'dynamics', 'of', 'delayperiod', 'activity', 'in', 'prefrontal', 'cortex', 'pfc', 'during', 'a', 'working', 'memory', 'task', 'the', 'theory', 'is', 'analytically', 'tractable', 'so', 'that', 'we', 'can', 'characterize', 'the', 'dynamics', 'and', 'the', 'theory', 'provides', 'a', 'means', 'for', 'reading', 'out', 'information', 'from', 'the', 'dynamically', 'varying', 'responses', 'at', 'any', 'point', 'in', 'time', 'in', 'spite', 'of', 'the', 'complex', 'dynamics', 'organics', 'can', 'be', 'implemented', 'with', 'a', 'biophysical', 'electrical', 'circuit', 'model', 'of', 'pyramidal', 'cells', 'combined', 'with', 'shunting', 'inhibition', 'via', 'a', 'thalamocortical', 'loop', 'although', 'introduced', 'as', 'a', 'computational', 'theory', 'of', 'working', 'memory', 'organics', 'are', 'also', 'applicable', 'to', 'models', 'of', 'sensory', 'processing', 'motor', 'preparation', 'and', 'motor', 'control', 'organics', 'offer', 'computational', 'advantages', 'compared', 'to', 'other', 'varieties', 'of', 'lstms', 'that', 'are', 'commonly', 'used', 'in', 'ai', 'applications', 'consequently', 'organics', 'are', 'a', 'framework', 'for', 'canonical', 'computation', 'in', 'brains', 'and', 'machines']]
|
[-0.114556316872508, 0.1362949322940032, -0.067298364336699, 0.05640421041143442, -0.09728300493428893, -0.21079735193378388, 0.03354097656418736, 0.43645760442489656, -0.2708177305187999, -0.2868420580272559, 0.08637162405974329, -0.22107832650683001, -0.2586481035889911, 0.23191344208099504, -0.12024005542640165, 0.03158928380595111, 0.063308661556281, 0.05359088386026408, 0.011676589524952107, -0.23246483066548204, 0.19442359212432367, 0.06407224473686449, 0.2809456937740599, -0.02079637271556926, 0.1282699461885669, -0.07559956088894013, 0.01276724798029049, -0.01937126725355619, -0.031013331950243167, 0.18556322123907523, 0.30146871504018924, 0.11846692953935024, 0.3257803276482645, -0.5824451922396531, -0.29771680196387795, 0.0586753508976479, 0.12382642900343227, 0.0927719972289604, -0.02505278123932247, -0.257217631250218, 0.05459013088207539, -0.1730908417042453, -0.01204820583416033, -0.14148898801399942, 0.02165302660130737, 0.01067069085740921, -0.2354643151929208, 0.006899454912409395, 0.06438317716070832, 0.14192687435639845, -0.059837836265965866, -0.08301615260040998, -0.002511200852522093, 0.15030015089560717, -0.017166276969655277, 0.04097005040954829, 0.221347172393394, -0.18925970482554952, -0.1662394945312647, 0.33384173282874263, -0.03516213994317918, -0.19816529921051193, 0.19545704171378397, -0.06240751754774623, -0.16600082178998166, 0.09893350067637335, 0.19888676085636886, 0.05234119355779033, -0.18289231049105587, 0.0429885444898908, 0.0228097084262389, 0.19883787549736995, 0.06612690991318217, 0.03377952991648581, 0.20503526947294898, 0.29781219577011014, -0.04690717866053009, 0.136172327129663, -0.0703913906330235, -0.1579979353978519, -0.19803817292938156, -0.13755289788132813, -0.15428280344916917, 0.04196464664136597, -0.06438130180748021, -0.1137648369852237, 0.3853355620164594, 0.140650912985994, 0.14410833301625497, 0.09152484725873591, 0.289227306200346, 0.05511796521167831, 0.17603308930452063, 0.09493565823881853, 0.14950325990702445, 0.1092765465904321, 0.1512811796573528, -0.2125159124756827, 0.14429305509687787, 0.009622934432816208]
|
1,803.06289
|
Spinodal superlattices of topological insulators
|
Spinodal decomposition is proposed for stabilizing self-assembled interfaces
between topological insulators (TIs) by combining layers of iso-structural and
iso-valent TlBi$X_2$ ($X$=S, Se, Te) materials. The composition range for
gapless states is addressed concurrently to the study of thermodynamically
driven boundaries. By tailoring composition, the TlBiS$_2$-TlBiTe$_2$ system
might produce both spinodal superlattices and two dimensional eutectic
microstructures, either concurrently or separately. The dimensions and
topological nature of the metallic channels are determined by following the
spatial distribution of the charge density and the spin-texture. The results
validate the proof of concept for obtaining spontaneously forming
two-dimensional TI-conducting channels embedded into three-dimensional
insulating environments without any vacuum interfaces. Since spinodal
decomposition is a controllable kinetic phenomenon, its leverage could become
the long-sought enabler for effective TI technological deployment.
|
cond-mat.mtrl-sci
|
spinodal decomposition is proposed for stabilizing selfassembled interfaces between topological insulators tis by combining layers of isostructural and isovalent tlbix_2 xs se te materials the composition range for gapless states is addressed concurrently to the study of thermodynamically driven boundaries by tailoring composition the tlbis_2tlbite_2 system might produce both spinodal superlattices and two dimensional eutectic microstructures either concurrently or separately the dimensions and topological nature of the metallic channels are determined by following the spatial distribution of the charge density and the spintexture the results validate the proof of concept for obtaining spontaneously forming twodimensional ticonducting channels embedded into threedimensional insulating environments without any vacuum interfaces since spinodal decomposition is a controllable kinetic phenomenon its leverage could become the longsought enabler for effective ti technological deployment
|
[['spinodal', 'decomposition', 'is', 'proposed', 'for', 'stabilizing', 'selfassembled', 'interfaces', 'between', 'topological', 'insulators', 'tis', 'by', 'combining', 'layers', 'of', 'isostructural', 'and', 'isovalent', 'tlbix_2', 'xs', 'se', 'te', 'materials', 'the', 'composition', 'range', 'for', 'gapless', 'states', 'is', 'addressed', 'concurrently', 'to', 'the', 'study', 'of', 'thermodynamically', 'driven', 'boundaries', 'by', 'tailoring', 'composition', 'the', 'tlbis_2tlbite_2', 'system', 'might', 'produce', 'both', 'spinodal', 'superlattices', 'and', 'two', 'dimensional', 'eutectic', 'microstructures', 'either', 'concurrently', 'or', 'separately', 'the', 'dimensions', 'and', 'topological', 'nature', 'of', 'the', 'metallic', 'channels', 'are', 'determined', 'by', 'following', 'the', 'spatial', 'distribution', 'of', 'the', 'charge', 'density', 'and', 'the', 'spintexture', 'the', 'results', 'validate', 'the', 'proof', 'of', 'concept', 'for', 'obtaining', 'spontaneously', 'forming', 'twodimensional', 'ticonducting', 'channels', 'embedded', 'into', 'threedimensional', 'insulating', 'environments', 'without', 'any', 'vacuum', 'interfaces', 'since', 'spinodal', 'decomposition', 'is', 'a', 'controllable', 'kinetic', 'phenomenon', 'its', 'leverage', 'could', 'become', 'the', 'longsought', 'enabler', 'for', 'effective', 'ti', 'technological', 'deployment']]
|
[-0.19041166756857908, 0.22305248754714885, -0.04163603542462712, -0.0124491369361133, -0.023857913545197656, -0.19255283206791407, 0.06381164548633199, 0.375224860167251, -0.2711704716296686, -0.25025312746724776, 0.04505666914290839, -0.2666571255653135, -0.13463873010046118, 0.1342807339763479, 0.027009870860755684, 0.040347430708401764, -0.03291144363033856, -0.1518512929079964, -0.09207693244435734, -0.1786677580375615, 0.3163097775240819, -0.017691122056989587, 0.35157341480202553, 0.0764994124117713, 0.02325845107571372, -0.016442072572141524, 0.08889463903652804, 0.013913075822675902, -0.15098257730700895, 0.08136009079199509, 0.2936319726436669, -0.028577215647542727, 0.17968704258730153, -0.4732103892001173, -0.28294290448238535, 0.022716888391803348, 0.16407475710730068, 0.08792965590668421, -0.1228266766317369, -0.31495010732643064, 0.1171894169228542, -0.11802014704012583, -0.11464392657076279, -0.10035358643395856, -0.025666608899501304, -0.04694797094317994, -0.24029407774158304, 0.04151414787362052, 0.08460558364693556, 0.06463499648699296, -0.1324633168621785, -0.13137885811644787, -0.1367894228127214, 0.08306817759782256, -0.0011613434302665654, -0.0124990482994866, 0.18572652424805827, -0.11883686111955725, -0.11584286501860216, 0.3693062789295049, 0.022554947042672503, -0.1412023513010119, 0.22846113502859108, -0.10115276165907422, -0.05869761982279259, 0.18424561288538238, 0.120235065910815, 0.07829371057150344, -0.13985919613849312, 0.09398481802406511, 0.040329691926730915, 0.16353128172997985, 0.059286065493530084, 0.08219157459004031, 0.3028990423058971, 0.21000010266687885, 0.056990050455375064, 0.14373339177297068, -0.04943836009084818, -0.0715147701595279, -0.18852151506730624, -0.2653147932667766, -0.24590404970841784, 0.02264367514139702, -0.08875825032056685, -0.20348245718501387, 0.37326850914471454, 0.082469563786177, 0.1380605237885198, -0.06193009647540748, 0.24355940673980983, 0.06571030210245461, 0.04204444234792684, 0.019971030589658767, 0.2107589279861009, 0.15324523638100213, 0.14283155374916182, -0.23399639558497695, 0.11132408786309703, 0.08319739361421295]
|
1,803.0629
|
Theory of Single Charge Exchange Heavy Ion Reactions
|
The theory of heavy ion single charge exchange reactions is reformulated. In
momentum space the reaction amplitude factorizes into a product of projectile
and target transition form factors, folded with the nucleon-nucleon isovector
interaction and a distortion coefficient which accounts for initial and final
state ion-ion elastic interactions. The multipole structure of the transition
form factors is studied in detail for Fermi-type non-spin flip and
Gamow-Teller-type spin flip transitions, also serving to establish the
connection to nuclear beta decay. The reaction kernel is evaluated for central
and rank-2 tensor interactions. Initial and final state elastic ion-ion
interaction are shown to be dominated by the imaginary part of the optical
potential allowing to evaluate the reaction coefficients in the strong
absorption limit, realized by the black disk approximation. In that limit the
distortion coefficient is evaluated in closed form, revealing the relation to
the total reaction cross section and the geometry of the transition form
factors. It is shown that at small momentum transfer distortion effects reduce
to a simple scaling factor, allowing to define reduced forward-angle cross
section which is given by nuclear matrix elements of beta decay-type. The
response function formalism is used to describe nuclear charge changing
transitions. Spectral distributions obtained by a self-consistent HFB and QRPA
approach are discussed for $\tau_\pm$ excitations of $^{18}O$ and $^{40}Ca$,
respectively, and compared to spectroscopic data. The interplay of nuclear
structure and reaction dynamics is illustrated for the single charge exchange
reaction $^{18}O+^{40}Ca \to ^{18}F+^{40}K$ at $T_{lab}=270$ MeV.
|
nucl-th
|
the theory of heavy ion single charge exchange reactions is reformulated in momentum space the reaction amplitude factorizes into a product of projectile and target transition form factors folded with the nucleonnucleon isovector interaction and a distortion coefficient which accounts for initial and final state ionion elastic interactions the multipole structure of the transition form factors is studied in detail for fermitype nonspin flip and gamowtellertype spin flip transitions also serving to establish the connection to nuclear beta decay the reaction kernel is evaluated for central and rank2 tensor interactions initial and final state elastic ionion interaction are shown to be dominated by the imaginary part of the optical potential allowing to evaluate the reaction coefficients in the strong absorption limit realized by the black disk approximation in that limit the distortion coefficient is evaluated in closed form revealing the relation to the total reaction cross section and the geometry of the transition form factors it is shown that at small momentum transfer distortion effects reduce to a simple scaling factor allowing to define reduced forwardangle cross section which is given by nuclear matrix elements of beta decaytype the response function formalism is used to describe nuclear charge changing transitions spectral distributions obtained by a selfconsistent hfb and qrpa approach are discussed for tau_pm excitations of 18o and 40ca respectively and compared to spectroscopic data the interplay of nuclear structure and reaction dynamics is illustrated for the single charge exchange reaction 18o40ca to 18f40k at t_lab270 mev
|
[['the', 'theory', 'of', 'heavy', 'ion', 'single', 'charge', 'exchange', 'reactions', 'is', 'reformulated', 'in', 'momentum', 'space', 'the', 'reaction', 'amplitude', 'factorizes', 'into', 'a', 'product', 'of', 'projectile', 'and', 'target', 'transition', 'form', 'factors', 'folded', 'with', 'the', 'nucleonnucleon', 'isovector', 'interaction', 'and', 'a', 'distortion', 'coefficient', 'which', 'accounts', 'for', 'initial', 'and', 'final', 'state', 'ionion', 'elastic', 'interactions', 'the', 'multipole', 'structure', 'of', 'the', 'transition', 'form', 'factors', 'is', 'studied', 'in', 'detail', 'for', 'fermitype', 'nonspin', 'flip', 'and', 'gamowtellertype', 'spin', 'flip', 'transitions', 'also', 'serving', 'to', 'establish', 'the', 'connection', 'to', 'nuclear', 'beta', 'decay', 'the', 'reaction', 'kernel', 'is', 'evaluated', 'for', 'central', 'and', 'rank2', 'tensor', 'interactions', 'initial', 'and', 'final', 'state', 'elastic', 'ionion', 'interaction', 'are', 'shown', 'to', 'be', 'dominated', 'by', 'the', 'imaginary', 'part', 'of', 'the', 'optical', 'potential', 'allowing', 'to', 'evaluate', 'the', 'reaction', 'coefficients', 'in', 'the', 'strong', 'absorption', 'limit', 'realized', 'by', 'the', 'black', 'disk', 'approximation', 'in', 'that', 'limit', 'the', 'distortion', 'coefficient', 'is', 'evaluated', 'in', 'closed', 'form', 'revealing', 'the', 'relation', 'to', 'the', 'total', 'reaction', 'cross', 'section', 'and', 'the', 'geometry', 'of', 'the', 'transition', 'form', 'factors', 'it', 'is', 'shown', 'that', 'at', 'small', 'momentum', 'transfer', 'distortion', 'effects', 'reduce', 'to', 'a', 'simple', 'scaling', 'factor', 'allowing', 'to', 'define', 'reduced', 'forwardangle', 'cross', 'section', 'which', 'is', 'given', 'by', 'nuclear', 'matrix', 'elements', 'of', 'beta', 'decaytype', 'the', 'response', 'function', 'formalism', 'is', 'used', 'to', 'describe', 'nuclear', 'charge', 'changing', 'transitions', 'spectral', 'distributions', 'obtained', 'by', 'a', 'selfconsistent', 'hfb', 'and', 'qrpa', 'approach', 'are', 'discussed', 'for', 'tau_pm', 'excitations', 'of', '18o', 'and', '40ca', 'respectively', 'and', 'compared', 'to', 'spectroscopic', 'data', 'the', 'interplay', 'of', 'nuclear', 'structure', 'and', 'reaction', 'dynamics', 'is', 'illustrated', 'for', 'the', 'single', 'charge', 'exchange', 'reaction', '18o40ca', 'to', '18f40k', 'at', 't_lab270', 'mev']]
|
[-0.10228847135279956, 0.17959563770243292, -0.05826211162797777, 0.09719368420472299, -0.0075726741250583315, -0.10828754352022407, 0.019918834709623683, 0.34323637075568914, -0.26080037832045505, -0.25353193245904804, -0.028994863743150277, -0.30515713250808757, -0.07416800423544437, 0.10652169532338042, 0.08751791123676386, 0.03736084922304982, 0.039608676804789175, 0.0404819261566295, -0.07899758399659652, -0.15986047698452652, 0.3371429224153636, 0.08903178335033327, 0.25605966340857766, 0.13016324631348558, 0.08264959298520744, 0.06264043458710605, 0.009332382772692743, -0.026438277368189444, -0.12242903976698565, 0.08420097635227251, 0.26391877579491263, 0.02891972607278089, 0.13549022117453347, -0.40853061375242694, -0.17720193426994751, 0.060997407171499644, 0.12727796511701595, 0.11851863662325184, -0.037241412560003254, -0.26822300705246227, 0.02876618402385356, -0.22143921578004036, -0.129559309411518, -0.11656528147638856, 0.08053256093271445, 0.018340696556754257, -0.3158251662674425, 0.09242702926949353, 0.009494230453952104, 0.0029831601138161534, -0.10230438192777427, -0.16522367536799346, -0.039171589413895404, 0.11142345237327211, 0.0555993933843855, 0.05542829141012152, 0.20617614389462358, -0.11798899274564577, -0.05709725556082625, 0.38321805143644533, -0.04804970088142733, -0.19235278625010585, 0.09175796031093401, -0.1651575162857311, -0.07552858706038644, 0.19448715316921228, 0.17716445864600786, 0.08759898940338888, -0.17006862425933297, 0.08681491821541532, 0.07042938039576781, 0.15850158581118123, 0.09109916176489812, 0.014735919917807167, 0.12490654404087322, 0.15371349319401714, -0.009201879116779369, 0.11610749459097501, -0.08911791376179322, -0.14601961836513944, -0.296620062885829, -0.11105970046836598, -0.1562589256163809, 0.0753331597886765, -0.06766815037772475, -0.12409960115189499, 0.35484829481399843, 0.01681352998973196, 0.2230305395248622, -0.03306807180648141, 0.28062795471196894, 0.15349811830255108, 0.08788168290342538, 0.04584611270484733, 0.28725746316943557, 0.23105095135749398, 0.05816751326829073, -0.28693701320619097, 0.08260949207814755, 0.06915681095652038]
|
1,803.06291
|
Secure Wireless Powered and Cooperative Jamming D2D Communications
|
This paper investigates a secure wireless-powered device-to-device (D2D)
communication network in the presence of multiple eavesdroppers, where a hybrid
base station (BS) in a cellular network not only provides power wirelessly for
the D2D transmitter to guarantee power efficiency for the D2D network, but also
serves as a cooperative jammer (CJ) to interfere with the eavesdroppers. The
cellular and D2D networks can belong to different service providers, which
means that the D2D transmitter would need to pay for the energy service
released by the hybrid BS to guarantee secure D2D communication. In order to
exploit the hierarchical interaction between the BS and the D2D transmitter, we
first formulate a Stackelberg game based energy trading scheme, where the
quadratic energy cost model is considered. Then, a non-energy trading based
Stackelberg game is investigated to study the reversed roles of the BS and the
D2D users. For comparison, we also formulate and resolve the social welfare
optimization problem. We derive the closed-form Stackelberg equilibriums of the
formulated games and the optimal solutions for the social welfare optimization
problem. Simulation results are provided to validate our proposed schemes to
highlight the importance of energy trading interaction between cellular and D2D
networks.
|
cs.IT math.IT
|
this paper investigates a secure wirelesspowered devicetodevice d2d communication network in the presence of multiple eavesdroppers where a hybrid base station bs in a cellular network not only provides power wirelessly for the d2d transmitter to guarantee power efficiency for the d2d network but also serves as a cooperative jammer cj to interfere with the eavesdroppers the cellular and d2d networks can belong to different service providers which means that the d2d transmitter would need to pay for the energy service released by the hybrid bs to guarantee secure d2d communication in order to exploit the hierarchical interaction between the bs and the d2d transmitter we first formulate a stackelberg game based energy trading scheme where the quadratic energy cost model is considered then a nonenergy trading based stackelberg game is investigated to study the reversed roles of the bs and the d2d users for comparison we also formulate and resolve the social welfare optimization problem we derive the closedform stackelberg equilibriums of the formulated games and the optimal solutions for the social welfare optimization problem simulation results are provided to validate our proposed schemes to highlight the importance of energy trading interaction between cellular and d2d networks
|
[['this', 'paper', 'investigates', 'a', 'secure', 'wirelesspowered', 'devicetodevice', 'd2d', 'communication', 'network', 'in', 'the', 'presence', 'of', 'multiple', 'eavesdroppers', 'where', 'a', 'hybrid', 'base', 'station', 'bs', 'in', 'a', 'cellular', 'network', 'not', 'only', 'provides', 'power', 'wirelessly', 'for', 'the', 'd2d', 'transmitter', 'to', 'guarantee', 'power', 'efficiency', 'for', 'the', 'd2d', 'network', 'but', 'also', 'serves', 'as', 'a', 'cooperative', 'jammer', 'cj', 'to', 'interfere', 'with', 'the', 'eavesdroppers', 'the', 'cellular', 'and', 'd2d', 'networks', 'can', 'belong', 'to', 'different', 'service', 'providers', 'which', 'means', 'that', 'the', 'd2d', 'transmitter', 'would', 'need', 'to', 'pay', 'for', 'the', 'energy', 'service', 'released', 'by', 'the', 'hybrid', 'bs', 'to', 'guarantee', 'secure', 'd2d', 'communication', 'in', 'order', 'to', 'exploit', 'the', 'hierarchical', 'interaction', 'between', 'the', 'bs', 'and', 'the', 'd2d', 'transmitter', 'we', 'first', 'formulate', 'a', 'stackelberg', 'game', 'based', 'energy', 'trading', 'scheme', 'where', 'the', 'quadratic', 'energy', 'cost', 'model', 'is', 'considered', 'then', 'a', 'nonenergy', 'trading', 'based', 'stackelberg', 'game', 'is', 'investigated', 'to', 'study', 'the', 'reversed', 'roles', 'of', 'the', 'bs', 'and', 'the', 'd2d', 'users', 'for', 'comparison', 'we', 'also', 'formulate', 'and', 'resolve', 'the', 'social', 'welfare', 'optimization', 'problem', 'we', 'derive', 'the', 'closedform', 'stackelberg', 'equilibriums', 'of', 'the', 'formulated', 'games', 'and', 'the', 'optimal', 'solutions', 'for', 'the', 'social', 'welfare', 'optimization', 'problem', 'simulation', 'results', 'are', 'provided', 'to', 'validate', 'our', 'proposed', 'schemes', 'to', 'highlight', 'the', 'importance', 'of', 'energy', 'trading', 'interaction', 'between', 'cellular', 'and', 'd2d', 'networks']]
|
[-0.2788922613037743, -0.05869010170319616, -0.02679374034873991, 0.0747045135484759, -0.1012504867794265, -0.2827279643376706, 0.2197662193517464, 0.3848928062461618, -0.2923530696625492, -0.2653375113013956, 0.016166072000744706, -0.24767925689053355, -0.2033700477755205, 0.03102211092335332, -0.11669548569632826, 0.015786454483697362, 0.03619790670016282, 0.042847466862036124, 0.08297189810599032, -0.25324551449298405, 0.3050188901675442, 0.1352203513955406, 0.3795764200633975, 0.09027662289074877, 0.06004106417072542, 0.01511138799333371, 0.0031970838564589167, -0.04756818830054441, -0.13838100571772866, 0.11169446948821647, 0.40583186524960146, 0.20156292556408756, 0.3661099329680167, -0.4587493118115071, -0.2354819673381633, 0.1399854068465606, 0.1597161394422827, 0.017644613427980193, -0.03468583329966424, -0.2902675609885141, 0.1567492869440372, -0.30154184728973743, -0.011968965054198045, 0.024651639016505068, -0.11586385405613016, 0.10997358528836018, -0.39995919189867424, -0.025463612691523987, -0.07279456103799131, -0.0041330507674226255, -0.07600151210131989, -0.06585661688527901, -0.032705112613238996, 0.21357482509461767, 0.04162766898199069, -0.08238514727381331, 0.10794349165569822, -0.09679700909158911, -0.1606266778809103, 0.4075870525557548, 0.03725557612205827, -0.21207901111079586, 0.12800679217278488, -0.02188187819962023, -0.11036642345439907, 0.09899570718830959, 0.2597142790486528, 0.03539975060648614, -0.22140714491487037, 0.010560875366361943, -0.032880132968509286, 0.1609875766955542, 0.07553359111441732, 0.11258029036524922, 0.12985695550051246, 0.23011673670356173, 0.2225161814366025, 0.10298622420382206, -0.05652172246952588, -0.1749737610448989, -0.20824104240381705, -0.13728062638241534, -0.24086658819343407, 0.019996382571910297, -0.09241897183499238, -0.020512367107181087, 0.3661026703894003, 0.0922519498589364, 0.04881877372408229, 0.1459162393967019, 0.3963599570819901, 0.1056461010029483, 0.012192577751579158, 0.15925264412612475, 0.2287140571899745, 0.07153525243329843, 0.22121879859883903, -0.23940681838642128, 0.05579941540678982, 0.007094430972379867]
|
1,803.06292
|
Search for high-mass resonances in dilepton final states in
proton-proton collisions at $\sqrt{s}=$ 13 TeV
|
A search is presented for new high-mass resonances decaying into electron or
muon pairs. The search uses proton-proton collision data at a centre-of-mass
energy of 13 TeV collected by the CMS experiment at the LHC in 2016,
corresponding to an integrated luminosity of 36 fb$^{-1}$. Observations are in
agreement with standard model expectations. Upper limits on the product of a
new resonance production cross section and branching fraction to dileptons are
calculated in a model-independent manner. This permits the interpretation of
the limits in models predicting a narrow dielectron or dimuon resonance. A scan
of different intrinsic width hypotheses is performed. Limits are set on the
masses of various hypothetical particles. For the Z$'_\mathrm{SSM}$
(Z$'_{\psi}$) particle, which arises in the sequential standard model
(superstring-inspired model), a lower mass limit of 4.50 (3.90) TeV is set at
95% confidence level. The lightest Kaluza-Klein graviton arising in the
Randall-Sundrum model of extra dimensions, with coupling parameters
$k/\overline{M}_\mathrm{Pl}$ of 0.01, 0.05, and 0.10, is excluded at 95%
confidence level below 2.10, 3.65, and 4.25 TeV, respectively. In a simplified
model of dark matter production via a vector or axial vector mediator, limits
at 95% confidence level are obtained on the masses of the dark matter particle
and its mediator.
|
hep-ex
|
a search is presented for new highmass resonances decaying into electron or muon pairs the search uses protonproton collision data at a centreofmass energy of 13 tev collected by the cms experiment at the lhc in 2016 corresponding to an integrated luminosity of 36 fb1 observations are in agreement with standard model expectations upper limits on the product of a new resonance production cross section and branching fraction to dileptons are calculated in a modelindependent manner this permits the interpretation of the limits in models predicting a narrow dielectron or dimuon resonance a scan of different intrinsic width hypotheses is performed limits are set on the masses of various hypothetical particles for the z_mathrmssm z_psi particle which arises in the sequential standard model superstringinspired model a lower mass limit of 450 390 tev is set at 95 confidence level the lightest kaluzaklein graviton arising in the randallsundrum model of extra dimensions with coupling parameters koverlinem_mathrmpl of 001 005 and 010 is excluded at 95 confidence level below 210 365 and 425 tev respectively in a simplified model of dark matter production via a vector or axial vector mediator limits at 95 confidence level are obtained on the masses of the dark matter particle and its mediator
|
[['a', 'search', 'is', 'presented', 'for', 'new', 'highmass', 'resonances', 'decaying', 'into', 'electron', 'or', 'muon', 'pairs', 'the', 'search', 'uses', 'protonproton', 'collision', 'data', 'at', 'a', 'centreofmass', 'energy', 'of', '13', 'tev', 'collected', 'by', 'the', 'cms', 'experiment', 'at', 'the', 'lhc', 'in', '2016', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '36', 'fb1', 'observations', 'are', 'in', 'agreement', 'with', 'standard', 'model', 'expectations', 'upper', 'limits', 'on', 'the', 'product', 'of', 'a', 'new', 'resonance', 'production', 'cross', 'section', 'and', 'branching', 'fraction', 'to', 'dileptons', 'are', 'calculated', 'in', 'a', 'modelindependent', 'manner', 'this', 'permits', 'the', 'interpretation', 'of', 'the', 'limits', 'in', 'models', 'predicting', 'a', 'narrow', 'dielectron', 'or', 'dimuon', 'resonance', 'a', 'scan', 'of', 'different', 'intrinsic', 'width', 'hypotheses', 'is', 'performed', 'limits', 'are', 'set', 'on', 'the', 'masses', 'of', 'various', 'hypothetical', 'particles', 'for', 'the', 'z_mathrmssm', 'z_psi', 'particle', 'which', 'arises', 'in', 'the', 'sequential', 'standard', 'model', 'superstringinspired', 'model', 'a', 'lower', 'mass', 'limit', 'of', '450', '390', 'tev', 'is', 'set', 'at', '95', 'confidence', 'level', 'the', 'lightest', 'kaluzaklein', 'graviton', 'arising', 'in', 'the', 'randallsundrum', 'model', 'of', 'extra', 'dimensions', 'with', 'coupling', 'parameters', 'koverlinem_mathrmpl', 'of', '001', '005', 'and', '010', 'is', 'excluded', 'at', '95', 'confidence', 'level', 'below', '210', '365', 'and', '425', 'tev', 'respectively', 'in', 'a', 'simplified', 'model', 'of', 'dark', 'matter', 'production', 'via', 'a', 'vector', 'or', 'axial', 'vector', 'mediator', 'limits', 'at', '95', 'confidence', 'level', 'are', 'obtained', 'on', 'the', 'masses', 'of', 'the', 'dark', 'matter', 'particle', 'and', 'its', 'mediator']]
|
[-0.07904265941739673, 0.22180678760867123, -0.03605201779694365, 0.15988433159967294, -0.04493499523392174, -0.12571286512993093, 0.08248710077846559, 0.30781828227407504, -0.14470919078306818, -0.4034941018718045, 0.02384989340846404, -0.34278139860664564, 0.11600248671091366, 0.17153847752615992, 0.0804303040478106, 0.07082758907188956, 0.09743451039376384, 0.04470719776298033, -0.015798285510390996, -0.20982175924213284, 0.24263625543354442, 0.08504657019384024, 0.23571105779875523, 0.10696236072789606, 0.10184390196497212, 0.001780980778290186, -0.010749335700742583, -0.1133160185841162, -0.1437895198852369, 0.09902036666824687, 0.1933028892962661, 0.06566277627674182, 0.14111157390306756, -0.2987923933352094, -0.0901241942592783, 0.12476001922495482, 0.14889259623113746, 0.03065060118849321, -0.042324043917696834, -0.3385488351102828, 0.11782149750421324, -0.20717515516568333, -0.09647691397496112, 0.054301169216519264, -0.01714527116088969, -0.11409522497617616, -0.31871944279750675, 0.15651841812380932, -0.05399822825338782, 0.07181191776705928, -0.0849136365958058, -0.21285475936332127, -0.09179132067677906, -0.056552431313320994, 0.05457896230992202, 0.03530384255047865, 0.21917308023108578, -0.14652307518138002, -0.18509988547529935, 0.35607266276166205, -0.11681924700373557, -0.16604182417275562, 0.21778671476172237, -0.17583151088754942, -0.12613197364276502, 0.19314997004708503, 0.26820788774525794, 0.04967945051016059, -0.2300541731608441, 0.14529669783078134, -0.025667885516020582, 0.21510855417085312, 0.08009614236397306, 0.03744902282512446, 0.287887072050944, 0.24732710342490818, -0.015625989423474162, 0.04216591229707729, -0.1697434528083427, -0.059102540579056596, -0.41059883989666296, -0.08265925904554201, -0.07978644400335304, 0.03176869539680278, -0.09403375985481345, -0.05922343407916587, 0.35768297667637833, 0.10615078384601852, 0.3159039868405316, 0.06556632254533924, 0.27359434292174695, 0.13536133732967556, 0.05208095977559867, 0.035143767821988685, 0.345723695614625, 0.12961246950165708, 0.09681663822961925, -0.13126625076799495, -0.03515583201561396, 0.026035850842642348]
|
1,803.06293
|
Measurement of e+e- --> D Dbar Cross Sections at the psi(3770) Resonance
|
We report new measurements of the cross sections for the production of D Dbar
final states at the psi(3770) resonance. Our data sample consists of an
integrated luminosity of 2.93/fb of e+e- annihilation data produced by the
BEPCII collider and collected and analyzed with the BESIII detector. We
exclusively reconstruct three D0 and six D+ hadronic decay modes and use the
ratio of the yield of fully reconstructed D Dbar events ("double tags") to the
yield of all reconstructed D or Dbar mesons ("single tags") to determine the
number of D0 D0bar and D+D- events, benefiting from the cancellation of many
systematic uncertainties. Combining these yields with an independent
determination of the integrated luminosity of the data sample, we find the
cross sections to be \sigma(e+e- --> D0 D0bar)=(3.615 +- 0.010 +- 0.038) nb and
\sigma(e+e- --> D+D-)=(2.830 +- 0.011 +- 0.026) nb, where the uncertainties are
statistical and systematic, respectively.
|
hep-ex
|
we report new measurements of the cross sections for the production of d dbar final states at the psi3770 resonance our data sample consists of an integrated luminosity of 293fb of ee annihilation data produced by the bepcii collider and collected and analyzed with the besiii detector we exclusively reconstruct three d0 and six d hadronic decay modes and use the ratio of the yield of fully reconstructed d dbar events double tags to the yield of all reconstructed d or dbar mesons single tags to determine the number of d0 d0bar and dd events benefiting from the cancellation of many systematic uncertainties combining these yields with an independent determination of the integrated luminosity of the data sample we find the cross sections to be sigmaee d0 d0bar3615 0010 0038 nb and sigmaee dd2830 0011 0026 nb where the uncertainties are statistical and systematic respectively
|
[['we', 'report', 'new', 'measurements', 'of', 'the', 'cross', 'sections', 'for', 'the', 'production', 'of', 'd', 'dbar', 'final', 'states', 'at', 'the', 'psi3770', 'resonance', 'our', 'data', 'sample', 'consists', 'of', 'an', 'integrated', 'luminosity', 'of', '293fb', 'of', 'ee', 'annihilation', 'data', 'produced', 'by', 'the', 'bepcii', 'collider', 'and', 'collected', 'and', 'analyzed', 'with', 'the', 'besiii', 'detector', 'we', 'exclusively', 'reconstruct', 'three', 'd0', 'and', 'six', 'd', 'hadronic', 'decay', 'modes', 'and', 'use', 'the', 'ratio', 'of', 'the', 'yield', 'of', 'fully', 'reconstructed', 'd', 'dbar', 'events', 'double', 'tags', 'to', 'the', 'yield', 'of', 'all', 'reconstructed', 'd', 'or', 'dbar', 'mesons', 'single', 'tags', 'to', 'determine', 'the', 'number', 'of', 'd0', 'd0bar', 'and', 'dd', 'events', 'benefiting', 'from', 'the', 'cancellation', 'of', 'many', 'systematic', 'uncertainties', 'combining', 'these', 'yields', 'with', 'an', 'independent', 'determination', 'of', 'the', 'integrated', 'luminosity', 'of', 'the', 'data', 'sample', 'we', 'find', 'the', 'cross', 'sections', 'to', 'be', 'sigmaee', 'd0', 'd0bar3615', '0010', '0038', 'nb', 'and', 'sigmaee', 'dd2830', '0011', '0026', 'nb', 'where', 'the', 'uncertainties', 'are', 'statistical', 'and', 'systematic', 'respectively']]
|
[-0.07408161779117942, 0.12298319206272193, -0.06631941542121202, 0.07590847360101384, 0.012393991292362481, -0.09289873674393855, 0.051146309494867294, 0.2983675519870201, -0.2137809689746986, -0.3226029444420317, -0.020516954206625446, -0.444306724403106, 0.08164629709585504, 0.16361269180361235, 0.06230606975584802, 0.13024085656490544, 0.15535304420234136, -0.009762000751642274, -0.06385330842729185, -0.20664398334871217, 0.2779281895778234, 0.03465340110722562, 0.24109067885257618, 0.08136427636310772, 0.03241978396750121, 0.022530274157425468, -0.10979335533223823, -0.07446903170702952, -0.15422222655738743, 0.10375107965033672, 0.2618290065889391, 0.14610320042434902, 0.06410935390609461, -0.34849188913553086, -0.02837745124854567, 0.1468936956166224, 0.15736015750633053, 0.033732437576219756, -0.014903091087701246, -0.36118699242623237, 0.1517317103431888, -0.15813705571730372, -0.04154502132474642, -0.007071746073820642, 0.04123037677048377, -0.07872384632478507, -0.34054084982014665, 0.10631061392724776, -0.061128799135806565, 0.07285275286175048, -0.02088086591200562, -0.26741733689280883, -0.06264358001898869, 0.023766601607400243, 0.02799144114488998, 0.079145156416032, 0.19389018515767661, -0.0790619275296553, -0.1723181184653429, 0.3096155069643815, -0.06283271115627402, -0.13030307052630774, 0.13576750167068358, -0.19465081525218844, -0.07540418152225165, 0.2059922000904843, 0.2649489969120059, 0.04820050820905033, -0.22439868784260372, 0.05120877599922455, 0.04386375859563409, 0.19703042248598443, 0.06418828752455892, 0.09795864741481893, 0.14049547581448102, 0.222503370238127, -0.05580533022088864, 0.03066620821523493, -0.2066616981067288, 0.02028615369041726, -0.4076169739988908, -0.11963585058627256, -0.07706982531571682, 0.07669864739471732, -0.04845615046709189, -0.10042051036684761, 0.34215045635076896, 0.03714343939553684, 0.36704189815676547, 0.0034095241399613066, 0.2673492263740217, 0.0848823347896285, 0.03166443337690459, 0.05558602486990809, 0.33693383372073965, 0.18073148287104732, 0.09465003863324839, -0.28395439824581303, 0.0445820659392474, -0.03525203192921381]
|
1,803.06294
|
SDN for End-Nodes: Scenario Analysis and Architectural Guidelines
|
The advent of SDN has brought a plethora of new architectures and controller
designs for many use-cases and scenarios. Existing SDN deployments focus on
campus, datacenter and WAN networks. However, little research efforts have been
devoted to the scenario of effectively controlling a full deployment of
end-nodes (e.g. smartphones) that are transient and scattered across the
Internet. In this paper, we present a rigorous analysis of the challenges
associated with an SDN architecture for end-nodes, show that such challenges
are not found in existing SDN scenarios, and provide practical design
guidelines to address them. Then, and following these guidelines we present a
reference architecture based on a decentralized, distributed and symmetric
controller with a connectionless pull-oriented southbound and an intent-driven
northbound. Finally, we measure a proof-of-concept deployment to assess the
validity of the analysis as well as the architecture.
|
cs.NI
|
the advent of sdn has brought a plethora of new architectures and controller designs for many usecases and scenarios existing sdn deployments focus on campus datacenter and wan networks however little research efforts have been devoted to the scenario of effectively controlling a full deployment of endnodes eg smartphones that are transient and scattered across the internet in this paper we present a rigorous analysis of the challenges associated with an sdn architecture for endnodes show that such challenges are not found in existing sdn scenarios and provide practical design guidelines to address them then and following these guidelines we present a reference architecture based on a decentralized distributed and symmetric controller with a connectionless pulloriented southbound and an intentdriven northbound finally we measure a proofofconcept deployment to assess the validity of the analysis as well as the architecture
|
[['the', 'advent', 'of', 'sdn', 'has', 'brought', 'a', 'plethora', 'of', 'new', 'architectures', 'and', 'controller', 'designs', 'for', 'many', 'usecases', 'and', 'scenarios', 'existing', 'sdn', 'deployments', 'focus', 'on', 'campus', 'datacenter', 'and', 'wan', 'networks', 'however', 'little', 'research', 'efforts', 'have', 'been', 'devoted', 'to', 'the', 'scenario', 'of', 'effectively', 'controlling', 'a', 'full', 'deployment', 'of', 'endnodes', 'eg', 'smartphones', 'that', 'are', 'transient', 'and', 'scattered', 'across', 'the', 'internet', 'in', 'this', 'paper', 'we', 'present', 'a', 'rigorous', 'analysis', 'of', 'the', 'challenges', 'associated', 'with', 'an', 'sdn', 'architecture', 'for', 'endnodes', 'show', 'that', 'such', 'challenges', 'are', 'not', 'found', 'in', 'existing', 'sdn', 'scenarios', 'and', 'provide', 'practical', 'design', 'guidelines', 'to', 'address', 'them', 'then', 'and', 'following', 'these', 'guidelines', 'we', 'present', 'a', 'reference', 'architecture', 'based', 'on', 'a', 'decentralized', 'distributed', 'and', 'symmetric', 'controller', 'with', 'a', 'connectionless', 'pulloriented', 'southbound', 'and', 'an', 'intentdriven', 'northbound', 'finally', 'we', 'measure', 'a', 'proofofconcept', 'deployment', 'to', 'assess', 'the', 'validity', 'of', 'the', 'analysis', 'as', 'well', 'as', 'the', 'architecture']]
|
[-0.1720413521045214, -0.04020080175807353, -0.02271565583187842, -0.009202394954839816, -0.10468454988686925, -0.17394506963595313, 0.06842548472647059, 0.4275227321522569, -0.22956142079656142, -0.308204982241099, 0.1552141466718439, -0.23528820592026314, -0.22410017431095025, 0.2465189499406647, -0.11648844431467137, 0.10589940243325856, 0.06718096075865039, -0.028375382835757544, -0.0345831630092087, -0.24105264349792996, 0.30594394120207585, 0.04529656124824699, 0.3596967705729397, 0.10948100084027643, 0.06728936130279525, -0.062428962013575444, -0.02749991245112334, -0.013397851850103289, -0.09851189761264946, 0.1590724283604998, 0.31437498513255674, 0.22304435212838117, 0.36384542066141634, -0.46217484125038133, -0.2136680258737102, 0.04797134120833047, 0.17294163048387604, 0.06213113885835139, -0.09133695942744015, -0.3306521879046829, 0.12677213959531844, -0.26827943794103, -0.11269379388133105, -0.08261309295062513, 0.002613181958695615, 0.05986905204944557, -0.23242008920255913, -0.08963699634764752, -0.009019431613052577, 0.06344141418889274, -0.03397319936295495, -0.09569252864797566, 0.02881619885706608, 0.15858008303207066, 0.014507011001433388, -0.0005527227984428623, 0.14157049724641835, -0.10914158710808813, -0.1721883959232075, 0.3646983055085161, 0.05080788346461231, -0.18029820542768948, 0.19306438509544807, 0.0032256126512576195, -0.17890962229423008, 0.01394110922123829, 0.2546866193981365, 0.060888356456098004, -0.20094724504334893, 0.06631403005287649, 0.007292078799027678, 0.14303369462119592, 0.00015904086669159197, 0.05388970405583943, 0.21843099803111454, 0.28685479631552296, 0.11761520141786658, 0.11448461293875084, -0.06358658625250581, -0.10786211396139252, -0.24775603284590272, -0.13830078371382407, -0.12839030321130027, 0.001988783091358521, -0.035871126915899235, -0.14048855283542325, 0.40757898125036135, 0.21263223667595074, 0.1578792089521613, 0.074638828045279, 0.39351465631901783, 0.003173668710786822, 0.11847207789142772, 0.11491670408014236, 0.19107267156882335, 0.02529500768839443, 0.19384589005452002, -0.13085205527319893, 0.061879040017370546, -0.05416043936172976]
|
1,803.06295
|
High-dimensional Stochastic Inversion via Adjoint Models and Machine
Learning
|
Performing stochastic inversion on a computationally expensive forward
simulation model with a high-dimensional uncertain parameter space (e.g. a
spatial random field) is computationally prohibitive even with gradient
information provided. Moreover, the `nonlinear' mapping from parameters to
observables generally gives rise to non-Gaussian posteriors even with Gaussian
priors, thus hampering the use of efficient inversion algorithms designed for
models with Gaussian assumptions. In this paper, we propose a novel Bayesian
stochastic inversion methodology, characterized by a tight coupling between a
gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel
principal component analysis (KPCA). This approach addresses the
`curse-of-dimensionality' via KPCA to identify a low-dimensional feature space
within the high-dimensional and nonlinearly correlated spatial random field.
Moreover, non-Gaussian full posterior probability distribution functions are
estimated via an efficient LMCMC method on both the projected low-dimensional
feature space and the recovered high-dimensional parameter space. We
demonstrate this computational framework by integrating and adapting recent
developments such as data-driven statistics-on-manifolds constructions and
reduction-through-projection techniques to solve inverse problems in linear
elasticity.
|
stat.CO
|
performing stochastic inversion on a computationally expensive forward simulation model with a highdimensional uncertain parameter space eg a spatial random field is computationally prohibitive even with gradient information provided moreover the nonlinear mapping from parameters to observables generally gives rise to nongaussian posteriors even with gaussian priors thus hampering the use of efficient inversion algorithms designed for models with gaussian assumptions in this paper we propose a novel bayesian stochastic inversion methodology characterized by a tight coupling between a gradientbased langevin markov chain monte carlo lmcmc method and a kernel principal component analysis kpca this approach addresses the curseofdimensionality via kpca to identify a lowdimensional feature space within the highdimensional and nonlinearly correlated spatial random field moreover nongaussian full posterior probability distribution functions are estimated via an efficient lmcmc method on both the projected lowdimensional feature space and the recovered highdimensional parameter space we demonstrate this computational framework by integrating and adapting recent developments such as datadriven statisticsonmanifolds constructions and reductionthroughprojection techniques to solve inverse problems in linear elasticity
|
[['performing', 'stochastic', 'inversion', 'on', 'a', 'computationally', 'expensive', 'forward', 'simulation', 'model', 'with', 'a', 'highdimensional', 'uncertain', 'parameter', 'space', 'eg', 'a', 'spatial', 'random', 'field', 'is', 'computationally', 'prohibitive', 'even', 'with', 'gradient', 'information', 'provided', 'moreover', 'the', 'nonlinear', 'mapping', 'from', 'parameters', 'to', 'observables', 'generally', 'gives', 'rise', 'to', 'nongaussian', 'posteriors', 'even', 'with', 'gaussian', 'priors', 'thus', 'hampering', 'the', 'use', 'of', 'efficient', 'inversion', 'algorithms', 'designed', 'for', 'models', 'with', 'gaussian', 'assumptions', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'bayesian', 'stochastic', 'inversion', 'methodology', 'characterized', 'by', 'a', 'tight', 'coupling', 'between', 'a', 'gradientbased', 'langevin', 'markov', 'chain', 'monte', 'carlo', 'lmcmc', 'method', 'and', 'a', 'kernel', 'principal', 'component', 'analysis', 'kpca', 'this', 'approach', 'addresses', 'the', 'curseofdimensionality', 'via', 'kpca', 'to', 'identify', 'a', 'lowdimensional', 'feature', 'space', 'within', 'the', 'highdimensional', 'and', 'nonlinearly', 'correlated', 'spatial', 'random', 'field', 'moreover', 'nongaussian', 'full', 'posterior', 'probability', 'distribution', 'functions', 'are', 'estimated', 'via', 'an', 'efficient', 'lmcmc', 'method', 'on', 'both', 'the', 'projected', 'lowdimensional', 'feature', 'space', 'and', 'the', 'recovered', 'highdimensional', 'parameter', 'space', 'we', 'demonstrate', 'this', 'computational', 'framework', 'by', 'integrating', 'and', 'adapting', 'recent', 'developments', 'such', 'as', 'datadriven', 'statisticsonmanifolds', 'constructions', 'and', 'reductionthroughprojection', 'techniques', 'to', 'solve', 'inverse', 'problems', 'in', 'linear', 'elasticity']]
|
[-0.03852747785012153, 0.06272556929872018, -0.08357894551714487, 0.11462327853183854, -0.11627295260515177, -0.18017838196546743, 0.04448301886758682, 0.43083464963869617, -0.3339829007332975, -0.28739928464038356, 0.11703155799768865, -0.17500175376789587, -0.1979378396983851, 0.19290519374084067, -0.048006111816644215, 0.13846388816706498, 0.08123261147658482, -0.07580291370889454, -0.13141497050158002, -0.19874945859227217, 0.2867552865691709, 0.08442147739908912, 0.3070315415829872, -0.09558422512967478, 0.17056180297707518, 0.055520010856685766, -0.07996125141948913, 0.019557677713843685, -0.1082142462445931, 0.1864022846418348, 0.28786239767207666, 0.1303449671475612, 0.34844572860747575, -0.40035856868507286, -0.26974342974241483, 0.13326234854616675, 0.1531925594475593, 0.14044332571158355, -0.02586996232893205, -0.31592049295590685, 0.014005543666919976, -0.1345772487238388, -0.08128369103157611, -0.194201968912261, -0.06377359689777773, -0.01682853193276308, -0.35472081826689345, 0.10592545056997826, 0.03637901788972544, 0.043481849266611264, 0.0030896042036174824, -0.10405755267958298, 0.02424253220528816, 0.017831018883170503, 0.029288363157573976, 0.021876185220158235, 0.11819938861228751, -0.10163043877250995, -0.11303706154523586, 0.31430930868920054, -0.05979283275223817, -0.28502575322195434, 0.173004516403219, -0.04642142439049415, -0.17322127093899656, 0.1581615583082153, 0.22295488035024116, 0.1325057637383879, -0.16730587299574506, 0.13409374261550097, 0.006074891535029041, 0.16439028516073118, -0.04516208775651952, -0.018086723681313522, 0.14682657452808184, 0.18623463579763969, 0.10228180201533674, 0.1419974285008555, -0.11551655523309654, -0.14986788774558316, -0.25651720457738547, -0.09747735954482448, -0.23559897094964982, -0.0029569041795294844, -0.16919004447594158, -0.1996479237565037, 0.3582754776163986, 0.19339045569579894, 0.22699408436504503, 0.09146093802851145, 0.3472388892335761, 0.13253332681206026, 0.009739196959840641, 0.11135563970063672, 0.14127571956593205, 0.15022285041032415, 0.05587523941119964, -0.1747131365725319, 0.07768646224303115, 0.05804809415430734]
|
1,803.06296
|
Mass-invariance of the iron enrichment in the hot haloes of massive
ellipticals, groups, and clusters of galaxies
|
X-ray measurements find systematically lower Fe abundances in the X-ray
emitting haloes pervading groups ($kT\lesssim1.7$ keV) than in clusters of
galaxies. These results have been difficult to reconcile with theoretical
predictions. However, models using incomplete atomic data or the assumption of
isothermal plasmas may have biased the best fit Fe abundance in groups and
giant elliptical galaxies low. In this work, we take advantage of a major
update of the atomic code in the spectral fitting package SPEX to re-evaluate
the Fe abundance in 43 clusters, groups, and elliptical galaxies (the CHEERS
sample) in a self-consistent analysis and within a common radius of
0.1$r_{500}$. For the first time, we report a remarkably similar average Fe
enrichment in all these systems. Unlike previous results, this strongly
suggests that metals are synthesised and transported in these haloes with the
same average efficiency across two orders of magnitude in total mass. We show
that the previous metallicity measurements in low temperature systems were
biased low due to incomplete atomic data in the spectral fitting codes. The
reasons for such a code-related Fe bias, also implying previously unconsidered
biases in the emission measure and temperature structure, are discussed.
|
astro-ph.GA
|
xray measurements find systematically lower fe abundances in the xray emitting haloes pervading groups ktlesssim17 kev than in clusters of galaxies these results have been difficult to reconcile with theoretical predictions however models using incomplete atomic data or the assumption of isothermal plasmas may have biased the best fit fe abundance in groups and giant elliptical galaxies low in this work we take advantage of a major update of the atomic code in the spectral fitting package spex to reevaluate the fe abundance in 43 clusters groups and elliptical galaxies the cheers sample in a selfconsistent analysis and within a common radius of 01r_500 for the first time we report a remarkably similar average fe enrichment in all these systems unlike previous results this strongly suggests that metals are synthesised and transported in these haloes with the same average efficiency across two orders of magnitude in total mass we show that the previous metallicity measurements in low temperature systems were biased low due to incomplete atomic data in the spectral fitting codes the reasons for such a coderelated fe bias also implying previously unconsidered biases in the emission measure and temperature structure are discussed
|
[['xray', 'measurements', 'find', 'systematically', 'lower', 'fe', 'abundances', 'in', 'the', 'xray', 'emitting', 'haloes', 'pervading', 'groups', 'ktlesssim17', 'kev', 'than', 'in', 'clusters', 'of', 'galaxies', 'these', 'results', 'have', 'been', 'difficult', 'to', 'reconcile', 'with', 'theoretical', 'predictions', 'however', 'models', 'using', 'incomplete', 'atomic', 'data', 'or', 'the', 'assumption', 'of', 'isothermal', 'plasmas', 'may', 'have', 'biased', 'the', 'best', 'fit', 'fe', 'abundance', 'in', 'groups', 'and', 'giant', 'elliptical', 'galaxies', 'low', 'in', 'this', 'work', 'we', 'take', 'advantage', 'of', 'a', 'major', 'update', 'of', 'the', 'atomic', 'code', 'in', 'the', 'spectral', 'fitting', 'package', 'spex', 'to', 'reevaluate', 'the', 'fe', 'abundance', 'in', '43', 'clusters', 'groups', 'and', 'elliptical', 'galaxies', 'the', 'cheers', 'sample', 'in', 'a', 'selfconsistent', 'analysis', 'and', 'within', 'a', 'common', 'radius', 'of', '01r_500', 'for', 'the', 'first', 'time', 'we', 'report', 'a', 'remarkably', 'similar', 'average', 'fe', 'enrichment', 'in', 'all', 'these', 'systems', 'unlike', 'previous', 'results', 'this', 'strongly', 'suggests', 'that', 'metals', 'are', 'synthesised', 'and', 'transported', 'in', 'these', 'haloes', 'with', 'the', 'same', 'average', 'efficiency', 'across', 'two', 'orders', 'of', 'magnitude', 'in', 'total', 'mass', 'we', 'show', 'that', 'the', 'previous', 'metallicity', 'measurements', 'in', 'low', 'temperature', 'systems', 'were', 'biased', 'low', 'due', 'to', 'incomplete', 'atomic', 'data', 'in', 'the', 'spectral', 'fitting', 'codes', 'the', 'reasons', 'for', 'such', 'a', 'coderelated', 'fe', 'bias', 'also', 'implying', 'previously', 'unconsidered', 'biases', 'in', 'the', 'emission', 'measure', 'and', 'temperature', 'structure', 'are', 'discussed']]
|
[-0.0435877001194361, 0.08706245854167112, -0.05518488640761158, 0.10334348262525357, -0.028495736652985215, -0.0727207352926295, 0.0669126919140884, 0.46596029289260815, -0.1601068389500142, -0.38603486167266965, 0.0341112247666994, -0.30363332342070254, -0.011721357799009033, 0.17567040112195778, -0.024738759950802585, -0.0011979306837019976, 0.04172306763211964, -0.072768689969962, -0.0935029467897645, -0.27964494920161087, 0.2852191677739029, 0.08813635034312028, 0.24529379067826085, -0.012669316053991983, -0.0007652948999445167, -0.08967898748718046, -0.08119203185318231, 0.03987850398213292, -0.1353220320941091, 0.06582905637636334, 0.2576568385517059, 0.06709840624989738, 0.2056655528564685, -0.4024626438183911, -0.2262178732717075, 0.06401307141641155, 0.19332108081531865, 0.09227978396059673, -0.10304329543820738, -0.21155193104884043, 0.051132782761442286, -0.1578691962446707, -0.1212906865015005, 0.009920187590372128, 0.02155692854770071, 0.05317252171820049, -0.21378790559447225, 0.14876210015412047, 0.038597060330478904, 0.09907151229951221, -0.11274168662566808, -0.17279008697369136, -0.02794179427291965, 0.061542952635742644, 0.015563425889316326, -0.00905832031397343, 0.16706047063901983, -0.07968487648516505, -0.05543312613008311, 0.3880799867523213, -0.08337657740450292, -0.03748150789639718, 0.20707835115414733, -0.21902856338419951, -0.21430736213369528, 0.14055234088664292, 0.14125786794587233, 0.10837204713023614, -0.15895553752034175, 0.036216544704226784, -0.02845629054415137, 0.21862190615259655, 0.029374629688390996, 0.039742901453185674, 0.241870621170771, 0.10549122335093368, 0.006884448337586946, 0.07261847331331713, -0.13319685071534573, -0.02885434921821191, -0.19257793633490414, -0.13486709703768915, -0.12653371252539122, 0.04430351530557649, -0.11381523236400426, -0.14393862569583385, 0.338015730605548, 0.1811767395441469, 0.2466314817647799, 0.009229966316676533, 0.3314326898738121, 0.07473488887626445, 0.1103117787794569, 0.10347835862679251, 0.2834067959144401, 0.16549390487853088, 0.06427255233832814, -0.2293415087436491, 0.10317812513191409, -0.021366548657776246]
|
1,803.06297
|
Mass-Metallicity Relation from Cosmological Hydrodynamical Simulations
and X-ray Observations of Galaxy Groups and Clusters
|
Recent X-ray observations of galaxy clusters show that the distribution of
intra-cluster medium (ICM) metallicity is remarkably uniform in space and time.
In this paper, we analyse a large sample of simulated objects, from poor groups
to rich clusters, to study the dependence of the metallicity and related
quantities on the mass of the systems. The simulations are performed with an
improved version of the Smoothed-Particle-Hydrodynamics \texttt{GADGET-3} code
and consider various astrophysical processes including radiative cooling, metal
enrichment and feedback from stars and active galactic nuclei (AGN). The
scaling between the metallicity and the temperature obtained in the simulations
agrees well in trend and evolution with the observational results obtained from
two data samples characterised by a wide range of masses and a large redshift
coverage. We find that the iron abundance in the cluster core ($r<0.1R_{500}$)
does not correlate with the temperature nor presents a significant evolution.
The scale invariance is confirmed when the metallicity is related directly to
the total mass. The slope of the best-fitting relations is shallow
($\beta\sim-0.1$) in the innermost regions ($r<0.5R_{500}$) and consistent with
zero outside. We investigate the impact of the AGN feedback and find that it
plays a key role in producing a constant value of the outskirts metallicity
from groups to clusters. This finding additionally supports the picture of
early enrichment.
|
astro-ph.GA astro-ph.CO
|
recent xray observations of galaxy clusters show that the distribution of intracluster medium icm metallicity is remarkably uniform in space and time in this paper we analyse a large sample of simulated objects from poor groups to rich clusters to study the dependence of the metallicity and related quantities on the mass of the systems the simulations are performed with an improved version of the smoothedparticlehydrodynamics textttgadget3 code and consider various astrophysical processes including radiative cooling metal enrichment and feedback from stars and active galactic nuclei agn the scaling between the metallicity and the temperature obtained in the simulations agrees well in trend and evolution with the observational results obtained from two data samples characterised by a wide range of masses and a large redshift coverage we find that the iron abundance in the cluster core r01r_500 does not correlate with the temperature nor presents a significant evolution the scale invariance is confirmed when the metallicity is related directly to the total mass the slope of the bestfitting relations is shallow betasim01 in the innermost regions r05r_500 and consistent with zero outside we investigate the impact of the agn feedback and find that it plays a key role in producing a constant value of the outskirts metallicity from groups to clusters this finding additionally supports the picture of early enrichment
|
[['recent', 'xray', 'observations', 'of', 'galaxy', 'clusters', 'show', 'that', 'the', 'distribution', 'of', 'intracluster', 'medium', 'icm', 'metallicity', 'is', 'remarkably', 'uniform', 'in', 'space', 'and', 'time', 'in', 'this', 'paper', 'we', 'analyse', 'a', 'large', 'sample', 'of', 'simulated', 'objects', 'from', 'poor', 'groups', 'to', 'rich', 'clusters', 'to', 'study', 'the', 'dependence', 'of', 'the', 'metallicity', 'and', 'related', 'quantities', 'on', 'the', 'mass', 'of', 'the', 'systems', 'the', 'simulations', 'are', 'performed', 'with', 'an', 'improved', 'version', 'of', 'the', 'smoothedparticlehydrodynamics', 'textttgadget3', 'code', 'and', 'consider', 'various', 'astrophysical', 'processes', 'including', 'radiative', 'cooling', 'metal', 'enrichment', 'and', 'feedback', 'from', 'stars', 'and', 'active', 'galactic', 'nuclei', 'agn', 'the', 'scaling', 'between', 'the', 'metallicity', 'and', 'the', 'temperature', 'obtained', 'in', 'the', 'simulations', 'agrees', 'well', 'in', 'trend', 'and', 'evolution', 'with', 'the', 'observational', 'results', 'obtained', 'from', 'two', 'data', 'samples', 'characterised', 'by', 'a', 'wide', 'range', 'of', 'masses', 'and', 'a', 'large', 'redshift', 'coverage', 'we', 'find', 'that', 'the', 'iron', 'abundance', 'in', 'the', 'cluster', 'core', 'r01r_500', 'does', 'not', 'correlate', 'with', 'the', 'temperature', 'nor', 'presents', 'a', 'significant', 'evolution', 'the', 'scale', 'invariance', 'is', 'confirmed', 'when', 'the', 'metallicity', 'is', 'related', 'directly', 'to', 'the', 'total', 'mass', 'the', 'slope', 'of', 'the', 'bestfitting', 'relations', 'is', 'shallow', 'betasim01', 'in', 'the', 'innermost', 'regions', 'r05r_500', 'and', 'consistent', 'with', 'zero', 'outside', 'we', 'investigate', 'the', 'impact', 'of', 'the', 'agn', 'feedback', 'and', 'find', 'that', 'it', 'plays', 'a', 'key', 'role', 'in', 'producing', 'a', 'constant', 'value', 'of', 'the', 'outskirts', 'metallicity', 'from', 'groups', 'to', 'clusters', 'this', 'finding', 'additionally', 'supports', 'the', 'picture', 'of', 'early', 'enrichment']]
|
[-0.06300800143637592, 0.11486858628045916, -0.07413940249049726, 0.09624386966094824, -0.04830217209409629, -0.01927778222576577, 0.07462185967543283, 0.40008244989439845, -0.19829711465906627, -0.3631294812000339, 0.05292138760032011, -0.28457029029528647, -0.03517327196917635, 0.20798030285664867, -0.0214579263486451, -0.01784903091794587, 0.047005777361509564, -0.0413656602893887, -0.076372461299966, -0.2308048080643251, 0.35893568173115553, 0.10575526007839169, 0.23492984091070765, 0.010318055508024473, 0.05869889956590702, -0.07760144457979887, -0.09154408478126344, 0.042736464685461856, -0.15353270580275152, 0.036823071728846385, 0.21039010206381878, 0.11479813679707823, 0.22499486028337506, -0.3549044811794644, -0.23154144991120254, 0.07710909918791407, 0.17205912729884773, 0.08306002346540077, -0.13900312042797278, -0.2225091686791361, 0.04075095778292356, -0.16510964702562583, -0.16480297386954557, 0.03902559277722267, 0.015256626992831352, 0.047856917236374474, -0.24331800147666838, 0.15016928763846712, 0.015488860008190386, 0.06832917592557217, -0.11412218007737668, -0.09848044840920786, -0.06272703745344188, 0.1316558492508193, 0.04016781364367085, 0.03675254761657453, 0.17118466795310033, -0.1435622350653392, -0.01183755493602129, 0.41169563732196196, -0.06908731207389522, -0.036450416174678445, 0.23713624539905814, -0.2201004319574201, -0.16607734659272763, 0.09374009614111856, 0.17565818523063273, 0.09491164113946811, -0.14029354949330067, 0.05447630762905141, -0.03935683447505451, 0.22666136133974996, -0.01386679251704158, 0.02882823347620918, 0.25951372574437065, 0.14959961657910348, 0.029309009469148738, 0.09906587021746587, -0.12927739438493047, -0.08566520677629376, -0.24837563695446416, -0.1225076319576517, -0.11857999120386215, 0.03870253484482991, -0.1491477775285872, -0.15857558115924433, 0.3373923444046846, 0.13222613346685344, 0.2530817547813058, 0.06459269856201934, 0.2819113170521127, 0.07681594477617182, 0.10748466504177216, 0.10613761889571496, 0.28000259881459727, 0.18297373593776245, 0.0803737318244573, -0.2906060875220983, 0.09772893931141072, -0.0009709602616365171]
|
1,803.06298
|
Spectroscopic characterisation of the stellar content of ultra diffuse
galaxies
|
Understanding the peculiar properties of Ultra Diffuse Galaxies (UDGs) via
spectroscopic analysis is a challenging task requiring very deep observations
and exquisite data reduction. In this work we perform one of the most complete
characterisations of the stellar component of UDGs to date using deep optical
spectroscopic data from OSIRIS at GTC. We measure radial and rotation
velocities, star formation histories (SFH) and mean population parameters, such
as ages and metallicities, for a sample of five UDG candidates in the Coma
cluster. From the radial velocities, we confirm the Coma membership of these
galaxies. We find that their rotation properties, if detected at all, are
compatible with dwarf-like galaxies. The SFHs of the UDG are dominated by old
(~ 7 Gyr), metal-poor ([M/H] ~ -1.1) and alpha-enhanced ([Mg/Fe] ~ 0.4)
populations followed by a smooth or episodic decline which halted ~ 2 Gyr ago,
possibly a sign of cluster-induced quenching. We find no obvious correlation
between individual SFH shapes and any UDG morphological properties. The
recovered stellar properties for UDGs are similar to those found for DDO44, a
local UDG analogue resolved into stars. We conclude that the UDGs in our sample
are extended dwarfs whose properties are likely the outcome of both internal
processes, such as bursty SFHs and/or high-spin haloes, as well as
environmental effects within the Coma cluster.
|
astro-ph.GA
|
understanding the peculiar properties of ultra diffuse galaxies udgs via spectroscopic analysis is a challenging task requiring very deep observations and exquisite data reduction in this work we perform one of the most complete characterisations of the stellar component of udgs to date using deep optical spectroscopic data from osiris at gtc we measure radial and rotation velocities star formation histories sfh and mean population parameters such as ages and metallicities for a sample of five udg candidates in the coma cluster from the radial velocities we confirm the coma membership of these galaxies we find that their rotation properties if detected at all are compatible with dwarflike galaxies the sfhs of the udg are dominated by old 7 gyr metalpoor mh 11 and alphaenhanced mgfe 04 populations followed by a smooth or episodic decline which halted 2 gyr ago possibly a sign of clusterinduced quenching we find no obvious correlation between individual sfh shapes and any udg morphological properties the recovered stellar properties for udgs are similar to those found for ddo44 a local udg analogue resolved into stars we conclude that the udgs in our sample are extended dwarfs whose properties are likely the outcome of both internal processes such as bursty sfhs andor highspin haloes as well as environmental effects within the coma cluster
|
[['understanding', 'the', 'peculiar', 'properties', 'of', 'ultra', 'diffuse', 'galaxies', 'udgs', 'via', 'spectroscopic', 'analysis', 'is', 'a', 'challenging', 'task', 'requiring', 'very', 'deep', 'observations', 'and', 'exquisite', 'data', 'reduction', 'in', 'this', 'work', 'we', 'perform', 'one', 'of', 'the', 'most', 'complete', 'characterisations', 'of', 'the', 'stellar', 'component', 'of', 'udgs', 'to', 'date', 'using', 'deep', 'optical', 'spectroscopic', 'data', 'from', 'osiris', 'at', 'gtc', 'we', 'measure', 'radial', 'and', 'rotation', 'velocities', 'star', 'formation', 'histories', 'sfh', 'and', 'mean', 'population', 'parameters', 'such', 'as', 'ages', 'and', 'metallicities', 'for', 'a', 'sample', 'of', 'five', 'udg', 'candidates', 'in', 'the', 'coma', 'cluster', 'from', 'the', 'radial', 'velocities', 'we', 'confirm', 'the', 'coma', 'membership', 'of', 'these', 'galaxies', 'we', 'find', 'that', 'their', 'rotation', 'properties', 'if', 'detected', 'at', 'all', 'are', 'compatible', 'with', 'dwarflike', 'galaxies', 'the', 'sfhs', 'of', 'the', 'udg', 'are', 'dominated', 'by', 'old', '7', 'gyr', 'metalpoor', 'mh', '11', 'and', 'alphaenhanced', 'mgfe', '04', 'populations', 'followed', 'by', 'a', 'smooth', 'or', 'episodic', 'decline', 'which', 'halted', '2', 'gyr', 'ago', 'possibly', 'a', 'sign', 'of', 'clusterinduced', 'quenching', 'we', 'find', 'no', 'obvious', 'correlation', 'between', 'individual', 'sfh', 'shapes', 'and', 'any', 'udg', 'morphological', 'properties', 'the', 'recovered', 'stellar', 'properties', 'for', 'udgs', 'are', 'similar', 'to', 'those', 'found', 'for', 'ddo44', 'a', 'local', 'udg', 'analogue', 'resolved', 'into', 'stars', 'we', 'conclude', 'that', 'the', 'udgs', 'in', 'our', 'sample', 'are', 'extended', 'dwarfs', 'whose', 'properties', 'are', 'likely', 'the', 'outcome', 'of', 'both', 'internal', 'processes', 'such', 'as', 'bursty', 'sfhs', 'andor', 'highspin', 'haloes', 'as', 'well', 'as', 'environmental', 'effects', 'within', 'the', 'coma', 'cluster']]
|
[-0.033083294638194365, 0.10478967171020737, -0.12106192419906298, 0.12816329526152753, -0.08951784123361867, -0.03622456395586583, 0.05485789067447743, 0.48381197475720933, -0.14504211550323112, -0.38376730701924744, 0.02776913141750211, -0.26450237554813466, -0.0487402407184226, 0.17663708178155887, -0.05179663830863801, -0.033507599016278124, 0.10152920487675868, -0.07742748906930333, -0.03599001058003938, -0.3357816575060723, 0.2898948942675912, 0.011481455105307516, 0.12819890297889228, -0.10985344541334216, 0.053728675762672096, -0.10058896815482621, -0.1016576860007757, -0.0032476789493989283, -0.17208054493759997, 0.014858235617936482, 0.2448777771471197, 0.13816471506352215, 0.2178485841653417, -0.35041546894092285, -0.20868789073343233, 0.07153177398851374, 0.2240956938259029, 0.055739686812578876, -0.11597682313976405, -0.28969105156159997, 0.0842186950956158, -0.15589541602291784, -0.1883918458610893, 0.05848859715563018, 0.06118819837497058, 0.029292140452165483, -0.19705345501805643, 0.22759372097266245, 0.03177074913293861, 0.15248918043415186, -0.1476560772254726, -0.12407371635046628, -0.09124003526055112, 0.0975032677940492, -0.032650702788541736, 0.040385405245464516, 0.19657786134287097, -0.15578192435655622, -0.02009210797441986, 0.4028305315631463, -0.06665335830767043, 0.025270704616693788, 0.26778357659041674, -0.18913584464542946, -0.2192839534335216, 0.07345463631233128, 0.13351490668317278, 0.11881249713870237, -0.18537812032801215, -0.004845746509057002, -0.01747826229746578, 0.19700303829751462, 0.03436153789677481, 0.08317928071711041, 0.30704083802470344, 0.0989213537710208, 0.03866356264420008, 0.0410987838720774, -0.2053295122588285, -0.029529402377985178, -0.19826558816637244, -0.08216994830615355, -0.09249994712656424, 0.0895775081745396, -0.1522507548117892, -0.11178872174227156, 0.3306711396580124, 0.07009149078510553, 0.2560293703653296, 0.10614104662734311, 0.29011289311212396, 0.03548450201743364, 0.16750772168145253, 0.11226624903383918, 0.25300861553885556, 0.21128136303473247, 0.01150511270002698, -0.24276047072175908, 0.10870962475280574, -0.031552997860877265]
|
1,803.06299
|
On the existence of a scalar pressure field in the Br\"odinger problem
|
This work deals with the entropic regularization of the Brenier problem for
perfect incompressible fluids introduced by Arnaudon, Cruzeiro, L\'eonard and
Zambrini. We show that as in the original setting, there exists a scalar
pressure field which is interpreted as the Lagrange multiplier associated to
the incompressibility constraint. The proof goes through a reformulation of the
problem in PDE terms.
|
math.AP math.OC math.PR
|
this work deals with the entropic regularization of the brenier problem for perfect incompressible fluids introduced by arnaudon cruzeiro leonard and zambrini we show that as in the original setting there exists a scalar pressure field which is interpreted as the lagrange multiplier associated to the incompressibility constraint the proof goes through a reformulation of the problem in pde terms
|
[['this', 'work', 'deals', 'with', 'the', 'entropic', 'regularization', 'of', 'the', 'brenier', 'problem', 'for', 'perfect', 'incompressible', 'fluids', 'introduced', 'by', 'arnaudon', 'cruzeiro', 'leonard', 'and', 'zambrini', 'we', 'show', 'that', 'as', 'in', 'the', 'original', 'setting', 'there', 'exists', 'a', 'scalar', 'pressure', 'field', 'which', 'is', 'interpreted', 'as', 'the', 'lagrange', 'multiplier', 'associated', 'to', 'the', 'incompressibility', 'constraint', 'the', 'proof', 'goes', 'through', 'a', 'reformulation', 'of', 'the', 'problem', 'in', 'pde', 'terms']]
|
[-0.14923407090038565, 0.06525668045663732, -0.08771119396186482, 0.03437108729602927, -0.07995990190213009, -0.14125283624408608, -0.020063583849597784, 0.22185502180798075, -0.3273065189862529, -0.28314944950200743, 0.08174002017841626, -0.2406709050854384, -0.15740767164329478, 0.1350284303396435, -0.13726394910807327, 0.07662973180413246, 0.024607111336821218, 0.03928436089928116, -0.0708146564291506, -0.20497170608427565, 0.35462726390589094, 0.02827694022759669, 0.20254221066074857, 0.06099288724757478, 0.19021324589217115, 0.04101415582877284, -0.0015176495821294137, 0.09045739326689203, -0.16626945977413463, 0.05821343534626067, 0.2466784222761832, 0.07734854039499316, 0.3250665830100997, -0.37426360690240135, -0.2363556958577138, 0.09535032499707856, 0.12357339177722648, 0.05042513970421801, -0.056636198992067475, -0.2625260130518069, 0.05592622368012445, -0.16089413714421502, -0.13494513801819943, -0.0306248837229559, -0.015813206817749573, -0.019549892875918393, -0.2950568892756256, 0.12913954862535504, 0.12517329622691464, 0.04443415107552783, -0.11490918081885172, -0.0981377427371503, 0.004729093731207363, -0.00554453747315427, 0.11371392167520598, 0.07585792606933263, 0.049205382536086494, -0.1209172968539583, -0.10539958052834401, 0.3937844297517154, -0.07785897010590061, -0.27487897228891567, 0.14744214168986527, -0.005688945597069243, -0.09210244020036722, 0.09044631093077488, 0.09666822877538911, 0.11859694517896337, -0.12410729187461784, 0.15851246361853555, -0.12027505587912717, 0.11756936294594937, 0.1162376330565598, -0.036984460925588665, 0.11305536080341218, 0.09545870112566972, 0.12573845810809378, 0.19271689574470965, 0.006466553963807617, -0.11903428489942167, -0.346037081521699, -0.21667706649119067, -0.20101706019081808, 0.04659603073624736, -0.07904995152291693, -0.17217595870527674, 0.3315024284677485, 0.10710154704639088, 0.15518065807172807, 0.03970260714709569, 0.2636216737949526, 0.15671874309290137, 9.647566110874384e-05, 0.07696070774631986, 0.2611106982517798, 0.2199898028028024, 0.1459032106528974, -0.21490469607287796, 0.009368506202008575, 0.19793498410322405]
|
1,803.063
|
Combining Symbolic Execution and Model Checking to Verify MPI Programs
|
Message passing is the standard paradigm of programming in high-performance
computing. However, verifying Message Passing Interface (MPI) programs is
challenging, due to the complex program features (such as non-determinism and
non-blocking operations). In this work, we present MPI symbolic verifier
(MPI-SV), the first symbolic execution based tool for automatically verifying
MPI programs with non-blocking operations. MPI-SV combines symbolic execution
and model checking in a synergistic way to tackle the challenges in MPI program
verification. The synergy improves the scalability and enlarges the scope of
verifiable properties. We have implemented MPI-SV (footnote:
https://mpi-sv.github.io) and evaluated it with 111 real-world MPI verification
tasks. The pure symbolic execution-based technique successfully verifies 61 out
of the 111 tasks (55\%) within one hour, while in comparison, MPI-SV verifies
100 tasks (90\%). On average, compared with pure symbolic execution, MPI-SV
achieves 19x speedups on verifying the satisfaction of the critical property
and 5x speedups on finding violations.
|
cs.PL
|
message passing is the standard paradigm of programming in highperformance computing however verifying message passing interface mpi programs is challenging due to the complex program features such as nondeterminism and nonblocking operations in this work we present mpi symbolic verifier mpisv the first symbolic execution based tool for automatically verifying mpi programs with nonblocking operations mpisv combines symbolic execution and model checking in a synergistic way to tackle the challenges in mpi program verification the synergy improves the scalability and enlarges the scope of verifiable properties we have implemented mpisv footnote httpsmpisvgithubio and evaluated it with 111 realworld mpi verification tasks the pure symbolic executionbased technique successfully verifies 61 out of the 111 tasks 55 within one hour while in comparison mpisv verifies 100 tasks 90 on average compared with pure symbolic execution mpisv achieves 19x speedups on verifying the satisfaction of the critical property and 5x speedups on finding violations
|
[['message', 'passing', 'is', 'the', 'standard', 'paradigm', 'of', 'programming', 'in', 'highperformance', 'computing', 'however', 'verifying', 'message', 'passing', 'interface', 'mpi', 'programs', 'is', 'challenging', 'due', 'to', 'the', 'complex', 'program', 'features', 'such', 'as', 'nondeterminism', 'and', 'nonblocking', 'operations', 'in', 'this', 'work', 'we', 'present', 'mpi', 'symbolic', 'verifier', 'mpisv', 'the', 'first', 'symbolic', 'execution', 'based', 'tool', 'for', 'automatically', 'verifying', 'mpi', 'programs', 'with', 'nonblocking', 'operations', 'mpisv', 'combines', 'symbolic', 'execution', 'and', 'model', 'checking', 'in', 'a', 'synergistic', 'way', 'to', 'tackle', 'the', 'challenges', 'in', 'mpi', 'program', 'verification', 'the', 'synergy', 'improves', 'the', 'scalability', 'and', 'enlarges', 'the', 'scope', 'of', 'verifiable', 'properties', 'we', 'have', 'implemented', 'mpisv', 'footnote', 'httpsmpisvgithubio', 'and', 'evaluated', 'it', 'with', '111', 'realworld', 'mpi', 'verification', 'tasks', 'the', 'pure', 'symbolic', 'executionbased', 'technique', 'successfully', 'verifies', '61', 'out', 'of', 'the', '111', 'tasks', '55', 'within', 'one', 'hour', 'while', 'in', 'comparison', 'mpisv', 'verifies', '100', 'tasks', '90', 'on', 'average', 'compared', 'with', 'pure', 'symbolic', 'execution', 'mpisv', 'achieves', '19x', 'speedups', 'on', 'verifying', 'the', 'satisfaction', 'of', 'the', 'critical', 'property', 'and', '5x', 'speedups', 'on', 'finding', 'violations']]
|
[-0.1653344929528733, -0.055963430106639865, -0.0735046180865417, 0.05133843365202968, -0.08440818561861912, -0.20531452320205668, 0.09870750590072323, 0.3726059937477112, -0.28021735630619027, -0.4059375642923017, 0.11346679804148152, -0.21424408685105542, -0.060025705151104676, 0.2329230802692473, -0.07502754630055279, 0.16451616204033295, 0.13524856173122923, -0.03926526906279226, -0.07218456396464414, -0.281198669699952, 0.17883622869228324, 0.049740608961631856, 0.2774555669290324, 0.07316488340186576, 0.09293070711195468, 0.056094179577582205, -0.022759751656558365, -0.04576548209724327, -0.014458648604340851, 0.10842439156025648, 0.3065241589645545, 0.29031102449012297, 0.280567166901504, -0.4176943815375368, -0.06901300888663779, 0.008360792819100122, 0.10286067379948993, 0.07052220513888945, 0.002773309248344352, -0.3066955447290093, 0.13679596600821242, -0.1819500007480383, -0.0061234734766185284, -0.12115779821450512, -0.018072079805036386, -0.03679486172467781, -0.22161915560563406, -0.03476243086275645, 0.08098307934356853, 0.13763996326830238, 0.05718796173731486, -0.09254568033541243, 0.02244790212561687, 0.0802487260568887, -0.01769979921868071, 0.047511981685335436, 0.19367868090048432, -0.06342192023371657, -0.26224953183050576, 0.4125685595348477, -0.037949842164913816, -0.1414806467263649, 0.21530409415562948, -0.0048753781554599605, -0.22520372665176788, 0.12454285395331681, 0.17059607391478493, 0.10573650670509475, -0.13745088584565868, 0.12283564444437313, 0.013683510087430477, 0.2527359029681732, 0.09751863059742998, 0.005215748020758231, 0.15434090138995088, 0.23758723992854358, 0.00838538536025832, 0.18890737403960278, -0.010912242229096591, -0.14681616694356003, -0.22489714013412596, -0.20822243452693026, -0.13329639876571794, -0.07449556801778574, -0.11088776074922256, -0.10798387499060481, 0.3621948129559557, 0.23042441891506316, 0.06851481339622599, 0.1562800012722922, 0.3963227899869283, 0.021975419082834076, 0.1101295093803977, 0.19893790176138282, 0.14652482081825535, 0.04980256080627441, 0.16539694161697602, -0.2140833367810895, 0.12925082458959272, 0.015921253667523463]
|
1,803.06301
|
Improved Part Segmentation Performance by Optimising Realism of
Synthetic Images using Cycle Generative Adversarial Networks
|
In this paper we report on improved part segmentation performance using
convolutional neural networks to reduce the dependency on the large amount of
manually annotated empirical images. This was achieved by optimising the visual
realism of synthetic agricultural images.In Part I, a cycle consistent
generative adversarial network was applied to synthetic and empirical images
with the objective to generate more realistic synthetic images by translating
them to the empirical domain. We first hypothesise and confirm that plant part
image features such as color and texture become more similar to the empirical
domain after translation of the synthetic images.Results confirm this with an
improved mean color distribution correlation with the empirical data prior of
0.62 and post translation of 0.90. Furthermore, the mean image features of
contrast, homogeneity, energy and entropy moved closer to the empirical mean,
post translation. In Part II, 7 experiments were performed using convolutional
neural networks with different combinations of synthetic, synthetic translated
to empirical and empirical images. We hypothesised that the translated images
can be used for (i) improved learning of empirical images, and (ii) that
learning without any fine-tuning with empirical images is improved by
bootstrapping with translated images over bootstrapping with synthetic images.
Results confirm our second and third hypotheses. First a maximum
intersection-over-union performance was achieved of 0.52 when bootstrapping
with translated images and fine-tuning with empirical images; an 8% increase
compared to only using synthetic images. Second, training without any empirical
fine-tuning resulted in an average IOU of 0.31; a 55% performance increase over
previous methods that only used synthetic images.
|
cs.CV
|
in this paper we report on improved part segmentation performance using convolutional neural networks to reduce the dependency on the large amount of manually annotated empirical images this was achieved by optimising the visual realism of synthetic agricultural imagesin part i a cycle consistent generative adversarial network was applied to synthetic and empirical images with the objective to generate more realistic synthetic images by translating them to the empirical domain we first hypothesise and confirm that plant part image features such as color and texture become more similar to the empirical domain after translation of the synthetic imagesresults confirm this with an improved mean color distribution correlation with the empirical data prior of 062 and post translation of 090 furthermore the mean image features of contrast homogeneity energy and entropy moved closer to the empirical mean post translation in part ii 7 experiments were performed using convolutional neural networks with different combinations of synthetic synthetic translated to empirical and empirical images we hypothesised that the translated images can be used for i improved learning of empirical images and ii that learning without any finetuning with empirical images is improved by bootstrapping with translated images over bootstrapping with synthetic images results confirm our second and third hypotheses first a maximum intersectionoverunion performance was achieved of 052 when bootstrapping with translated images and finetuning with empirical images an 8 increase compared to only using synthetic images second training without any empirical finetuning resulted in an average iou of 031 a 55 performance increase over previous methods that only used synthetic images
|
[['in', 'this', 'paper', 'we', 'report', 'on', 'improved', 'part', 'segmentation', 'performance', 'using', 'convolutional', 'neural', 'networks', 'to', 'reduce', 'the', 'dependency', 'on', 'the', 'large', 'amount', 'of', 'manually', 'annotated', 'empirical', 'images', 'this', 'was', 'achieved', 'by', 'optimising', 'the', 'visual', 'realism', 'of', 'synthetic', 'agricultural', 'imagesin', 'part', 'i', 'a', 'cycle', 'consistent', 'generative', 'adversarial', 'network', 'was', 'applied', 'to', 'synthetic', 'and', 'empirical', 'images', 'with', 'the', 'objective', 'to', 'generate', 'more', 'realistic', 'synthetic', 'images', 'by', 'translating', 'them', 'to', 'the', 'empirical', 'domain', 'we', 'first', 'hypothesise', 'and', 'confirm', 'that', 'plant', 'part', 'image', 'features', 'such', 'as', 'color', 'and', 'texture', 'become', 'more', 'similar', 'to', 'the', 'empirical', 'domain', 'after', 'translation', 'of', 'the', 'synthetic', 'imagesresults', 'confirm', 'this', 'with', 'an', 'improved', 'mean', 'color', 'distribution', 'correlation', 'with', 'the', 'empirical', 'data', 'prior', 'of', '062', 'and', 'post', 'translation', 'of', '090', 'furthermore', 'the', 'mean', 'image', 'features', 'of', 'contrast', 'homogeneity', 'energy', 'and', 'entropy', 'moved', 'closer', 'to', 'the', 'empirical', 'mean', 'post', 'translation', 'in', 'part', 'ii', '7', 'experiments', 'were', 'performed', 'using', 'convolutional', 'neural', 'networks', 'with', 'different', 'combinations', 'of', 'synthetic', 'synthetic', 'translated', 'to', 'empirical', 'and', 'empirical', 'images', 'we', 'hypothesised', 'that', 'the', 'translated', 'images', 'can', 'be', 'used', 'for', 'i', 'improved', 'learning', 'of', 'empirical', 'images', 'and', 'ii', 'that', 'learning', 'without', 'any', 'finetuning', 'with', 'empirical', 'images', 'is', 'improved', 'by', 'bootstrapping', 'with', 'translated', 'images', 'over', 'bootstrapping', 'with', 'synthetic', 'images', 'results', 'confirm', 'our', 'second', 'and', 'third', 'hypotheses', 'first', 'a', 'maximum', 'intersectionoverunion', 'performance', 'was', 'achieved', 'of', '052', 'when', 'bootstrapping', 'with', 'translated', 'images', 'and', 'finetuning', 'with', 'empirical', 'images', 'an', '8', 'increase', 'compared', 'to', 'only', 'using', 'synthetic', 'images', 'second', 'training', 'without', 'any', 'empirical', 'finetuning', 'resulted', 'in', 'an', 'average', 'iou', 'of', '031', 'a', '55', 'performance', 'increase', 'over', 'previous', 'methods', 'that', 'only', 'used', 'synthetic', 'images']]
|
[0.02492604845892927, -0.012788250113130355, -0.06662214944696833, 0.0806390190932019, -0.05569449062242584, -0.123958834344088, 0.05587800002165947, 0.4848244660858845, -0.2272730086237019, -0.40568789945872025, 0.08224089276596051, -0.2943822660432883, -0.1381151600480946, 0.19558942378967886, -0.1507190353536704, 0.09127237784040933, 0.16404982490551678, 0.017777221303527033, -0.06115028511213009, -0.32947746259449123, 0.2800742208717622, 0.049142019350312705, 0.3554195853296754, 0.011698556340628037, 0.09898931294491933, -0.060747668919579466, -0.06043275835736142, 0.020824782708713914, -0.03434324583957827, 0.2020790882989793, 0.21693978730549443, 0.19465336814349474, 0.268287164372096, -0.4145017202885807, -0.22204389163588947, 0.11784547358722419, 0.14037264194908053, 0.0552377083816867, -0.06343768223140536, -0.3543989970023895, 0.10141566508204149, -0.10976997486590011, 0.0004362265521646008, -0.10567075735347908, 0.0033076077400952175, -0.011106855411293678, -0.3250523396219892, 0.07262825096015234, 0.04600125518555269, 0.18159626891959257, -0.08946718705561763, -0.14600055035683795, -0.03486625243306824, 0.16991000645579643, 0.030965047308186056, 0.08417886356794269, 0.1189771607146389, -0.16264634660617522, -0.1243810790422636, 0.3306215327637371, -0.12677439853960518, -0.17451716592283142, 0.17411930029832778, -0.05357430842091409, -0.097176409046736, 0.1194509339731822, 0.1943845887674748, 0.07720199856878251, -0.14179742481324203, -0.03815406943015328, -0.038416161239796943, 0.23381970749893624, 0.058627230576383915, -0.08290883592264943, 0.1649932260146769, 0.204209031004733, -0.0410175518885836, 0.18451362314079925, -0.20089001064795672, -0.03076950161782808, -0.23573043479678013, -0.0949519155510925, -0.22327522514117232, 0.015865191354329677, -0.14551045211132882, -0.11017927972513229, 0.38426226382540873, 0.22494535350291303, 0.23902130264305155, 0.12489513773832095, 0.33766485458373474, 0.031974437612274934, 0.1392936263618767, 0.04433411707453675, 0.22265566855329702, 0.020546042757440906, 0.12314360558303288, -0.1561466839740706, 0.0674912334824082, -0.0026888742685577897]
|
1,803.06302
|
Electron-mediated phonon-phonon coupling drives the vibrational
relaxation of CO on Cu(100)
|
We bring forth a consistent theory for the electron-mediated vibrational
intermode coupling that clarifies the microscopic mechanism behind the
vibrational relaxation of adsorbates on metal surfaces. Our analysis points out
the inability of state-of-the-art nonadiabatic theories to quantitatively
reproduce the experimental linewidth of the CO internal stretch mode on Cu(100)
and it emphasizes the crucial role of the electron-mediated phonon-phonon
coupling in this regard. The results demonstrate a strong electron-mediated
coupling between the internal stretch and low-energy CO modes, but also a
significant role of surface motion. Our nonadiabatic theory is also able to
explain the temperature dependence of the internal stretch phonon linewidth,
thus far considered a sign of the direct anharmonic coupling.
|
cond-mat.mtrl-sci
|
we bring forth a consistent theory for the electronmediated vibrational intermode coupling that clarifies the microscopic mechanism behind the vibrational relaxation of adsorbates on metal surfaces our analysis points out the inability of stateoftheart nonadiabatic theories to quantitatively reproduce the experimental linewidth of the co internal stretch mode on cu100 and it emphasizes the crucial role of the electronmediated phononphonon coupling in this regard the results demonstrate a strong electronmediated coupling between the internal stretch and lowenergy co modes but also a significant role of surface motion our nonadiabatic theory is also able to explain the temperature dependence of the internal stretch phonon linewidth thus far considered a sign of the direct anharmonic coupling
|
[['we', 'bring', 'forth', 'a', 'consistent', 'theory', 'for', 'the', 'electronmediated', 'vibrational', 'intermode', 'coupling', 'that', 'clarifies', 'the', 'microscopic', 'mechanism', 'behind', 'the', 'vibrational', 'relaxation', 'of', 'adsorbates', 'on', 'metal', 'surfaces', 'our', 'analysis', 'points', 'out', 'the', 'inability', 'of', 'stateoftheart', 'nonadiabatic', 'theories', 'to', 'quantitatively', 'reproduce', 'the', 'experimental', 'linewidth', 'of', 'the', 'co', 'internal', 'stretch', 'mode', 'on', 'cu100', 'and', 'it', 'emphasizes', 'the', 'crucial', 'role', 'of', 'the', 'electronmediated', 'phononphonon', 'coupling', 'in', 'this', 'regard', 'the', 'results', 'demonstrate', 'a', 'strong', 'electronmediated', 'coupling', 'between', 'the', 'internal', 'stretch', 'and', 'lowenergy', 'co', 'modes', 'but', 'also', 'a', 'significant', 'role', 'of', 'surface', 'motion', 'our', 'nonadiabatic', 'theory', 'is', 'also', 'able', 'to', 'explain', 'the', 'temperature', 'dependence', 'of', 'the', 'internal', 'stretch', 'phonon', 'linewidth', 'thus', 'far', 'considered', 'a', 'sign', 'of', 'the', 'direct', 'anharmonic', 'coupling']]
|
[-0.153408781267915, 0.14702434639299386, -0.06836241321115379, 0.0626541575572143, -0.07645062788536675, -0.11024088963147319, 0.11865673748277977, 0.380730881175974, -0.26443165785371603, -0.260954809946972, -0.0729891529905185, -0.26842183668754604, -0.15914300236047557, 0.16297872084307305, 0.04393530155025553, -0.03186536628115726, 0.025553804008380036, -0.04625283853608396, -0.016761258977726755, -0.15037742447671726, 0.2561619899198903, 0.11054960966289959, 0.33172936623164434, 0.1749131597799102, 0.04710576701255744, -0.037637915085437464, 0.03991344315408353, -0.03385477010446617, -0.1615858110990462, 0.10799240273844223, 0.21887974967983992, -0.06525201125380893, 0.22368746813746138, -0.4824931118800713, -0.2204706643855101, 0.0022447330860845874, 0.13677329321702322, 0.1851697751819238, -0.01228260687805647, -0.23666679136977906, -0.04892268707452897, -0.1023818406811507, -0.12554965251260192, -0.13113788327430947, 0.0248004075041727, -0.02651600149182374, -0.20137248261016794, 0.11839594868810341, 0.1101567421696688, 0.07061792112551957, -0.09171138014930316, -0.10337899005440832, -0.1041812740129484, 0.10483495079454754, 0.09400206058196266, 0.033144176038995124, 0.18880569064385144, -0.08657485172928621, -0.06648113594080012, 0.39140202521689627, -0.11388666436827757, -0.13083778723273753, 0.2038667606202101, -0.12608829807702518, -0.10445787975352192, 0.1593191930697414, 0.10326133347361495, 0.07578764159412107, -0.09968874414794539, 0.0696326122086152, 0.03957881212741006, 0.21111095254717951, 0.062568144039496, 0.10032506206219918, 0.23155989833666304, 0.166822740959265, 0.010806766984036617, 0.10696772398762078, -0.10075247954789615, -0.096285113045668, -0.2961957669232792, -0.12337076039412957, -0.1676787776970039, 0.060216713176934014, -0.10803630204489373, -0.14104561876963106, 0.39167495030632016, 0.15712968398931257, 0.1916283429477756, -0.0102457734102612, 0.28673708506271633, 0.0895618624564489, 0.0789465886099558, 0.00321691986908646, 0.36144876707214535, 0.22845522877188368, 0.04597926114506105, -0.43316389555152374, 0.06450405100507564, 0.0012918619394073623]
|
1,803.06303
|
Optimal control of light propagation and exciton transfer in arrays of
molecular-like noble-metal clusters
|
We demonstrate theoretically the possibility of optimal control of light
propagation and exciton transfer in arrays constructed of subnanometer sized
noble-metal clusters by using phase-shaped laser pulses and analyze the
mechanism underlying this process. The theoretical approach for simulation of
light propagation in the arrays is based on the numerical solution of the
coupled time-dependent Schr\"odinger equation and the classical electric field
propagation in an iterative self-consistent manner. The electronic eigenstates
of individual clusters and the dipole couplings are obtained from ab initio
TDDFT calculations. The total electric field is propagated along the array by
coupling an external excitation electric field with the electric fields
produced by all clusters. A genetic algorithm is used to determine optimal
pulse shapes which drive the excitation in a desired direction. The described
theoretical approach is applied to control the light propagation and exciton
transfer dynamics into a T-shaped structure built of seven Ag8 clusters. We
demonstrate that a selective switching of light localization is possible in
$\sim$5 nm sized cluster arrays which might serve as a building block for
plasmonic devices with an ultrafast operation regime
|
physics.atm-clus
|
we demonstrate theoretically the possibility of optimal control of light propagation and exciton transfer in arrays constructed of subnanometer sized noblemetal clusters by using phaseshaped laser pulses and analyze the mechanism underlying this process the theoretical approach for simulation of light propagation in the arrays is based on the numerical solution of the coupled timedependent schrodinger equation and the classical electric field propagation in an iterative selfconsistent manner the electronic eigenstates of individual clusters and the dipole couplings are obtained from ab initio tddft calculations the total electric field is propagated along the array by coupling an external excitation electric field with the electric fields produced by all clusters a genetic algorithm is used to determine optimal pulse shapes which drive the excitation in a desired direction the described theoretical approach is applied to control the light propagation and exciton transfer dynamics into a tshaped structure built of seven ag8 clusters we demonstrate that a selective switching of light localization is possible in sim5 nm sized cluster arrays which might serve as a building block for plasmonic devices with an ultrafast operation regime
|
[['we', 'demonstrate', 'theoretically', 'the', 'possibility', 'of', 'optimal', 'control', 'of', 'light', 'propagation', 'and', 'exciton', 'transfer', 'in', 'arrays', 'constructed', 'of', 'subnanometer', 'sized', 'noblemetal', 'clusters', 'by', 'using', 'phaseshaped', 'laser', 'pulses', 'and', 'analyze', 'the', 'mechanism', 'underlying', 'this', 'process', 'the', 'theoretical', 'approach', 'for', 'simulation', 'of', 'light', 'propagation', 'in', 'the', 'arrays', 'is', 'based', 'on', 'the', 'numerical', 'solution', 'of', 'the', 'coupled', 'timedependent', 'schrodinger', 'equation', 'and', 'the', 'classical', 'electric', 'field', 'propagation', 'in', 'an', 'iterative', 'selfconsistent', 'manner', 'the', 'electronic', 'eigenstates', 'of', 'individual', 'clusters', 'and', 'the', 'dipole', 'couplings', 'are', 'obtained', 'from', 'ab', 'initio', 'tddft', 'calculations', 'the', 'total', 'electric', 'field', 'is', 'propagated', 'along', 'the', 'array', 'by', 'coupling', 'an', 'external', 'excitation', 'electric', 'field', 'with', 'the', 'electric', 'fields', 'produced', 'by', 'all', 'clusters', 'a', 'genetic', 'algorithm', 'is', 'used', 'to', 'determine', 'optimal', 'pulse', 'shapes', 'which', 'drive', 'the', 'excitation', 'in', 'a', 'desired', 'direction', 'the', 'described', 'theoretical', 'approach', 'is', 'applied', 'to', 'control', 'the', 'light', 'propagation', 'and', 'exciton', 'transfer', 'dynamics', 'into', 'a', 'tshaped', 'structure', 'built', 'of', 'seven', 'ag8', 'clusters', 'we', 'demonstrate', 'that', 'a', 'selective', 'switching', 'of', 'light', 'localization', 'is', 'possible', 'in', 'sim5', 'nm', 'sized', 'cluster', 'arrays', 'which', 'might', 'serve', 'as', 'a', 'building', 'block', 'for', 'plasmonic', 'devices', 'with', 'an', 'ultrafast', 'operation', 'regime']]
|
[-0.15596371638885403, 0.14988750253717995, -0.0663653926074423, 0.02681340048878825, -0.027966362909045438, -0.11764799483161378, 0.03802133002318442, 0.46759485167318154, -0.2831101828858584, -0.3181490388668173, 0.021244577861360307, -0.24624266925365101, -0.12785864062031607, 0.2112217837264045, 0.06386196806612374, 0.04852959208969528, 0.04637791329942347, -0.041340975632000676, 0.006684328107979497, -0.16735694438326532, 0.23259477351106458, 0.06737965263556152, 0.3193509409224594, 0.014178705606404897, 0.09725602703158753, 0.0430279601768144, 0.04482523255369365, -0.010118689318315464, -0.08057523454024723, 0.13340640583479837, 0.20965473121927622, 0.03850377686731108, 0.24229474378632035, -0.4906356107689195, -0.2225762208593321, 0.007385079250645384, 0.18030087763678979, 0.17322988806108197, -0.10459670266916893, -0.28988415960754665, 0.03883473842614586, -0.11702237820897538, -0.15655164306100322, -0.04903949162881863, -0.010202272953132965, 0.08042003484545174, -0.2805722401222178, 0.017727041586332922, -0.00896052638443627, 0.024661529332981127, -0.08959077403518936, -0.07702182225370012, 0.002772486297884485, 0.07781898433465388, -0.020929607886540868, 0.02487031028063579, 0.19888220310907115, -0.10298787156544667, -0.1291797326514395, 0.3610853710426734, -0.07187753146358224, -0.154553531464394, 0.12199899411100157, -0.11820940356407376, -0.022966721270407376, 0.16361461472595212, 0.1802042407600291, 0.14477829202231798, -0.17511359333642118, 0.06573125241925731, 0.013773405358993582, 0.2007012593631561, 0.06377140551314249, 0.0443557304877706, 0.23441379052167247, 0.20213294586494238, 0.04082626776237573, 0.13654896092682994, -0.10892755418227842, -0.08780666840614655, -0.24406170249394663, -0.09698023280169774, -0.1895825998342064, 0.07363673445709808, -0.07618535317665741, -0.1704292100686951, 0.43134647040566493, 0.15341942814776194, 0.12169238184527545, -0.013509908265045301, 0.30262412711118275, 0.12764574675296259, 0.056979477212375416, 0.043903926942640774, 0.27137107074588207, 0.19854337520958795, 0.07509032715429234, -0.30197718777280597, 0.004546799391231776, -0.0009602259354893589]
|
1,803.06304
|
"Cultural additivity" and how the values and norms of Confucianism,
Buddhism, and Taoism co-exist, interact, and influence Vietnamese society: A
Bayesian analysis of long-standing folktales, using R and Stan
|
Every year, the Vietnamese people reportedly burned about 50,000 tons of joss
papers, which took the form of not only bank notes, but iPhones, cars, clothes,
even housekeepers, in hope of pleasing the dead. The practice was mistakenly
attributed to traditional Buddhist teachings but originated in fact from China,
which most Vietnamese were not aware of. In other aspects of life, there were
many similar examples of Vietnamese so ready and comfortable with adding new
norms, values, and beliefs, even contradictory ones, to their culture. This
phenomenon, dubbed "cultural additivity", prompted us to study the
co-existence, interaction, and influences among core values and norms of the
Three Teachings--Confucianism, Buddhism, and Taoism--as shown through
Vietnamese folktales. By applying Bayesian logistic regression, we evaluated
the possibility of whether the key message of a story was dominated by a
religion (dependent variables), as affected by the appearance of values and
anti-values pertaining to the Three Teachings in the story (independent
variables).
|
stat.AP
|
every year the vietnamese people reportedly burned about 50000 tons of joss papers which took the form of not only bank notes but iphones cars clothes even housekeepers in hope of pleasing the dead the practice was mistakenly attributed to traditional buddhist teachings but originated in fact from china which most vietnamese were not aware of in other aspects of life there were many similar examples of vietnamese so ready and comfortable with adding new norms values and beliefs even contradictory ones to their culture this phenomenon dubbed cultural additivity prompted us to study the coexistence interaction and influences among core values and norms of the three teachingsconfucianism buddhism and taoismas shown through vietnamese folktales by applying bayesian logistic regression we evaluated the possibility of whether the key message of a story was dominated by a religion dependent variables as affected by the appearance of values and antivalues pertaining to the three teachings in the story independent variables
|
[['every', 'year', 'the', 'vietnamese', 'people', 'reportedly', 'burned', 'about', '50000', 'tons', 'of', 'joss', 'papers', 'which', 'took', 'the', 'form', 'of', 'not', 'only', 'bank', 'notes', 'but', 'iphones', 'cars', 'clothes', 'even', 'housekeepers', 'in', 'hope', 'of', 'pleasing', 'the', 'dead', 'the', 'practice', 'was', 'mistakenly', 'attributed', 'to', 'traditional', 'buddhist', 'teachings', 'but', 'originated', 'in', 'fact', 'from', 'china', 'which', 'most', 'vietnamese', 'were', 'not', 'aware', 'of', 'in', 'other', 'aspects', 'of', 'life', 'there', 'were', 'many', 'similar', 'examples', 'of', 'vietnamese', 'so', 'ready', 'and', 'comfortable', 'with', 'adding', 'new', 'norms', 'values', 'and', 'beliefs', 'even', 'contradictory', 'ones', 'to', 'their', 'culture', 'this', 'phenomenon', 'dubbed', 'cultural', 'additivity', 'prompted', 'us', 'to', 'study', 'the', 'coexistence', 'interaction', 'and', 'influences', 'among', 'core', 'values', 'and', 'norms', 'of', 'the', 'three', 'teachingsconfucianism', 'buddhism', 'and', 'taoismas', 'shown', 'through', 'vietnamese', 'folktales', 'by', 'applying', 'bayesian', 'logistic', 'regression', 'we', 'evaluated', 'the', 'possibility', 'of', 'whether', 'the', 'key', 'message', 'of', 'a', 'story', 'was', 'dominated', 'by', 'a', 'religion', 'dependent', 'variables', 'as', 'affected', 'by', 'the', 'appearance', 'of', 'values', 'and', 'antivalues', 'pertaining', 'to', 'the', 'three', 'teachings', 'in', 'the', 'story', 'independent', 'variables']]
|
[-0.04830412436261555, 0.11218995256228494, -0.0881253840489346, 0.09682963575446651, -0.1172231821125591, -0.1488159373946875, 0.07182921740897726, 0.33130862586829185, -0.22695956903270917, -0.33054209889408637, 0.11080478349445061, -0.3217487392838222, -0.16214869766157458, 0.1670814916830171, -0.13486345975913785, -0.014698322524952357, 0.07599274014189307, 0.0523212599876494, -0.00029011588700889767, -0.3066495757794927, 0.3026629686113689, 0.046230250583430936, 0.27742797015658155, 0.04194784127236283, 0.09037306883021609, -0.01539167976793047, -0.09083699908216375, 0.0013187258502819225, -0.05811623391519942, 0.10772065286125455, 0.3151737871438464, 0.1922126195235983, 0.3533883785387477, -0.4282109294494526, -0.15719151007942855, 0.09818457615525499, 0.12235957053308556, 0.0383157180274486, -0.006486309117746431, -0.33183527387702816, 0.04518872207822883, -0.18824602837384039, -0.07596402753797638, -0.046843822799054545, 0.02993402846290597, 0.006024520965739057, -0.19121534015541872, 0.05532785370800789, 0.07651984398313738, 0.09864292818109517, -0.06054059571024127, -0.1678474054054974, -0.016301510401989346, 0.18373904527465862, 0.11681558907957287, 0.00070445072782746, 0.12239059302978544, -0.13961795895729312, -0.1164983951958356, 0.38414517804593235, -0.024160611304127937, -0.11563354953788992, 0.19167130847322428, -0.1367620073603587, -0.14618998057475047, 0.0991657541553768, 0.13365265460950987, 0.08446887838060804, -0.1730293978199169, -0.021003974198708433, -0.031387167601478014, 0.17367548572410552, 0.1424546178926218, -0.015779956671796352, 0.2230383112433959, 0.12939857908935806, -0.03060415524470789, 0.0649029542015436, -0.022143371245981036, -0.11174381093436538, -0.2117752274891434, -0.1360195202952517, -0.1436742612148647, 0.029044757558028336, -0.04065723083372826, -0.12908322614441511, 0.38601930334396034, 0.1771953250614128, 0.1569707653157915, -0.013839224371575302, 0.2300241901539266, -0.004341448931622186, 0.11838649370399147, 0.07745132133267917, 0.20928152714396356, 0.050227145756619025, 0.15869742981158197, -0.10288812404452345, 0.16732257120492686, 0.010012748388138103]
|
1,803.06305
|
C-LSTM: Enabling Efficient LSTM using Structured Compression Techniques
on FPGAs
|
Recently, significant accuracy improvement has been achieved for acoustic
recognition systems by increasing the model size of Long Short-Term Memory
(LSTM) networks. Unfortunately, the ever-increasing size of LSTM model leads to
inefficient designs on FPGAs due to the limited on-chip resources. The previous
work proposes to use a pruning based compression technique to reduce the model
size and thus speedups the inference on FPGAs. However, the random nature of
the pruning technique transforms the dense matrices of the model to highly
unstructured sparse ones, which leads to unbalanced computation and irregular
memory accesses and thus hurts the overall performance and energy efficiency.
In contrast, we propose to use a structured compression technique which could
not only reduce the LSTM model size but also eliminate the irregularities of
computation and memory accesses. This approach employs block-circulant instead
of sparse matrices to compress weight matrices and reduces the storage
requirement from $\mathcal{O}(k^2)$ to $\mathcal{O}(k)$. Fast Fourier Transform
algorithm is utilized to further accelerate the inference by reducing the
computational complexity from $\mathcal{O}(k^2)$ to
$\mathcal{O}(k\text{log}k)$. The datapath and activation functions are
quantized as 16-bit to improve the resource utilization. More importantly, we
propose a comprehensive framework called C-LSTM to automatically optimize and
implement a wide range of LSTM variants on FPGAs. According to the experimental
results, C-LSTM achieves up to 18.8X and 33.5X gains for performance and energy
efficiency compared with the state-of-the-art LSTM implementation under the
same experimental setup, and the accuracy degradation is very small.
|
cs.LG cs.AR
|
recently significant accuracy improvement has been achieved for acoustic recognition systems by increasing the model size of long shortterm memory lstm networks unfortunately the everincreasing size of lstm model leads to inefficient designs on fpgas due to the limited onchip resources the previous work proposes to use a pruning based compression technique to reduce the model size and thus speedups the inference on fpgas however the random nature of the pruning technique transforms the dense matrices of the model to highly unstructured sparse ones which leads to unbalanced computation and irregular memory accesses and thus hurts the overall performance and energy efficiency in contrast we propose to use a structured compression technique which could not only reduce the lstm model size but also eliminate the irregularities of computation and memory accesses this approach employs blockcirculant instead of sparse matrices to compress weight matrices and reduces the storage requirement from mathcalok2 to mathcalok fast fourier transform algorithm is utilized to further accelerate the inference by reducing the computational complexity from mathcalok2 to mathcaloktextlogk the datapath and activation functions are quantized as 16bit to improve the resource utilization more importantly we propose a comprehensive framework called clstm to automatically optimize and implement a wide range of lstm variants on fpgas according to the experimental results clstm achieves up to 188x and 335x gains for performance and energy efficiency compared with the stateoftheart lstm implementation under the same experimental setup and the accuracy degradation is very small
|
[['recently', 'significant', 'accuracy', 'improvement', 'has', 'been', 'achieved', 'for', 'acoustic', 'recognition', 'systems', 'by', 'increasing', 'the', 'model', 'size', 'of', 'long', 'shortterm', 'memory', 'lstm', 'networks', 'unfortunately', 'the', 'everincreasing', 'size', 'of', 'lstm', 'model', 'leads', 'to', 'inefficient', 'designs', 'on', 'fpgas', 'due', 'to', 'the', 'limited', 'onchip', 'resources', 'the', 'previous', 'work', 'proposes', 'to', 'use', 'a', 'pruning', 'based', 'compression', 'technique', 'to', 'reduce', 'the', 'model', 'size', 'and', 'thus', 'speedups', 'the', 'inference', 'on', 'fpgas', 'however', 'the', 'random', 'nature', 'of', 'the', 'pruning', 'technique', 'transforms', 'the', 'dense', 'matrices', 'of', 'the', 'model', 'to', 'highly', 'unstructured', 'sparse', 'ones', 'which', 'leads', 'to', 'unbalanced', 'computation', 'and', 'irregular', 'memory', 'accesses', 'and', 'thus', 'hurts', 'the', 'overall', 'performance', 'and', 'energy', 'efficiency', 'in', 'contrast', 'we', 'propose', 'to', 'use', 'a', 'structured', 'compression', 'technique', 'which', 'could', 'not', 'only', 'reduce', 'the', 'lstm', 'model', 'size', 'but', 'also', 'eliminate', 'the', 'irregularities', 'of', 'computation', 'and', 'memory', 'accesses', 'this', 'approach', 'employs', 'blockcirculant', 'instead', 'of', 'sparse', 'matrices', 'to', 'compress', 'weight', 'matrices', 'and', 'reduces', 'the', 'storage', 'requirement', 'from', 'mathcalok2', 'to', 'mathcalok', 'fast', 'fourier', 'transform', 'algorithm', 'is', 'utilized', 'to', 'further', 'accelerate', 'the', 'inference', 'by', 'reducing', 'the', 'computational', 'complexity', 'from', 'mathcalok2', 'to', 'mathcaloktextlogk', 'the', 'datapath', 'and', 'activation', 'functions', 'are', 'quantized', 'as', '16bit', 'to', 'improve', 'the', 'resource', 'utilization', 'more', 'importantly', 'we', 'propose', 'a', 'comprehensive', 'framework', 'called', 'clstm', 'to', 'automatically', 'optimize', 'and', 'implement', 'a', 'wide', 'range', 'of', 'lstm', 'variants', 'on', 'fpgas', 'according', 'to', 'the', 'experimental', 'results', 'clstm', 'achieves', 'up', 'to', '188x', 'and', '335x', 'gains', 'for', 'performance', 'and', 'energy', 'efficiency', 'compared', 'with', 'the', 'stateoftheart', 'lstm', 'implementation', 'under', 'the', 'same', 'experimental', 'setup', 'and', 'the', 'accuracy', 'degradation', 'is', 'very', 'small']]
|
[-0.0744274328834729, 0.03974707407444036, -0.026598654436218047, 0.04014571149847026, -0.10558545745182706, -0.17544572773347009, 0.10653926823404135, 0.42991850760096834, -0.2831767454078707, -0.35700886234973417, 0.08990896938907764, -0.21752650616110855, -0.14911923648719966, 0.20312262465066327, -0.13666284384367278, 0.1200288646502799, 0.11953060983349782, 0.009597776957142217, -0.08909892607374016, -0.30638264309754015, 0.18184427693254349, 0.16359782172560197, 0.37540581822298713, 0.021245833999318887, 0.11494955764812924, -0.03265485195568627, -0.04111047521189118, -0.040414232189490036, -0.0074293640687582525, 0.1741832898199342, 0.23923343993893426, 0.1391949108328392, 0.30289054254680503, -0.4670541685275517, -0.22419961766171737, 0.08942063288334216, 0.14969287710858478, 0.09721123001439674, -0.008562722180390834, -0.24333422306028515, 0.14167144306098725, -0.20169700179403624, -0.00665634818359653, -0.15942472295583945, -0.004412434274462125, 0.012025528619765339, -0.3019113416891715, 0.0457993604959408, 0.07046120018211359, -0.02702511996668435, -0.01731425305901876, -0.1265087803590007, 0.06180058807691103, 0.1118278805460178, 0.004338600648628911, 0.0454091891502436, 0.1217726761517714, -0.1313962794104166, -0.12638946032901274, 0.3506926822116699, -0.03663647197586913, -0.22666220012685107, 0.18596640972061182, -0.0177085544799041, -0.11173348518521274, 0.1497123968348881, 0.2512240531326357, 0.058165587341853446, -0.12258016130465751, 0.060124417638678596, 0.035660910195017936, 0.22073069726661837, 0.08273546058535808, 0.07061970324054577, 0.11582720855393938, 0.26109956878071255, 0.06226263222133903, 0.18780168749998744, -0.11432668639402992, -0.09470944080107625, -0.1690775786137162, -0.1114173687615768, -0.19854464134224595, -0.004037566483926503, -0.11300006958819526, -0.15312548836884457, 0.3973831685909159, 0.2307737579789492, 0.19227601847847098, 0.1396441344998746, 0.3836348760308876, 0.05787031634766763, 0.1893728281819567, 0.12763789983242133, 0.13342098104554959, 0.09091190649273793, 0.1521417757931467, -0.23772649330964227, 0.08320577069114665, 0.03582499776346149]
|
1,803.06306
|
Block minimal bases $\ell$-ifications of matrix polynomials
|
The standard way of solving a polynomial eigenvalue problem associated with a
matrix polynomial starts by embedding the matrix coefficients of the polynomial
into a matrix pencil, known as a strong linearization. This process transforms
the problem into an equivalent generalized eigenvalue problem. However, there
are some situations in which is more convenient to replace linearizations by
other low degree matrix polynomials. This has motivated the idea of a strong
$\ell$-ification of a matrix polynomial, which is a matrix polynomial of degree
$\ell$ having the same finite and infinite elementary divisors, and the same
numbers of left and right minimal indices as the original matrix polynomial. We
present in this work a novel method for constructing strong $\ell$-ifications
of matrix polynomials of size $m\times n$ and grade $d$ when $\ell< d$, and
$\ell$ divides $nd$ or $md$. This method is based on a family called "strong
block minimal bases matrix polynomials", and relies heavily on properties of
dual minimal bases. We show how strong block minimal bases $\ell$-ifications
can be constructed from the coefficients of a given matrix polynomial
$P(\lambda)$. We also show that these $\ell$-ifications satisfy many desirable
properties for numerical applications: they are strong $\ell$-ifications
regardless of whether $P(\lambda)$ is regular or singular, the minimal indices
of the $\ell$-ifications are related to those of $P(\lambda)$ via constant
uniform shifts, and eigenvectors and minimal bases of $P(\lambda)$ can be
recovered from those of any of the strong block minimal bases
$\ell$-ifications. In the special case where $\ell$ divides $d$, we introduce a
subfamily of strong block minimal bases matrix polynomials named "block
Kronecker matrix polynomials", which is shown to be a fruitful source of
companion $\ell$-ifications.
|
math.NA
|
the standard way of solving a polynomial eigenvalue problem associated with a matrix polynomial starts by embedding the matrix coefficients of the polynomial into a matrix pencil known as a strong linearization this process transforms the problem into an equivalent generalized eigenvalue problem however there are some situations in which is more convenient to replace linearizations by other low degree matrix polynomials this has motivated the idea of a strong ellification of a matrix polynomial which is a matrix polynomial of degree ell having the same finite and infinite elementary divisors and the same numbers of left and right minimal indices as the original matrix polynomial we present in this work a novel method for constructing strong ellifications of matrix polynomials of size mtimes n and grade d when ell d and ell divides nd or md this method is based on a family called strong block minimal bases matrix polynomials and relies heavily on properties of dual minimal bases we show how strong block minimal bases ellifications can be constructed from the coefficients of a given matrix polynomial plambda we also show that these ellifications satisfy many desirable properties for numerical applications they are strong ellifications regardless of whether plambda is regular or singular the minimal indices of the ellifications are related to those of plambda via constant uniform shifts and eigenvectors and minimal bases of plambda can be recovered from those of any of the strong block minimal bases ellifications in the special case where ell divides d we introduce a subfamily of strong block minimal bases matrix polynomials named block kronecker matrix polynomials which is shown to be a fruitful source of companion ellifications
|
[['the', 'standard', 'way', 'of', 'solving', 'a', 'polynomial', 'eigenvalue', 'problem', 'associated', 'with', 'a', 'matrix', 'polynomial', 'starts', 'by', 'embedding', 'the', 'matrix', 'coefficients', 'of', 'the', 'polynomial', 'into', 'a', 'matrix', 'pencil', 'known', 'as', 'a', 'strong', 'linearization', 'this', 'process', 'transforms', 'the', 'problem', 'into', 'an', 'equivalent', 'generalized', 'eigenvalue', 'problem', 'however', 'there', 'are', 'some', 'situations', 'in', 'which', 'is', 'more', 'convenient', 'to', 'replace', 'linearizations', 'by', 'other', 'low', 'degree', 'matrix', 'polynomials', 'this', 'has', 'motivated', 'the', 'idea', 'of', 'a', 'strong', 'ellification', 'of', 'a', 'matrix', 'polynomial', 'which', 'is', 'a', 'matrix', 'polynomial', 'of', 'degree', 'ell', 'having', 'the', 'same', 'finite', 'and', 'infinite', 'elementary', 'divisors', 'and', 'the', 'same', 'numbers', 'of', 'left', 'and', 'right', 'minimal', 'indices', 'as', 'the', 'original', 'matrix', 'polynomial', 'we', 'present', 'in', 'this', 'work', 'a', 'novel', 'method', 'for', 'constructing', 'strong', 'ellifications', 'of', 'matrix', 'polynomials', 'of', 'size', 'mtimes', 'n', 'and', 'grade', 'd', 'when', 'ell', 'd', 'and', 'ell', 'divides', 'nd', 'or', 'md', 'this', 'method', 'is', 'based', 'on', 'a', 'family', 'called', 'strong', 'block', 'minimal', 'bases', 'matrix', 'polynomials', 'and', 'relies', 'heavily', 'on', 'properties', 'of', 'dual', 'minimal', 'bases', 'we', 'show', 'how', 'strong', 'block', 'minimal', 'bases', 'ellifications', 'can', 'be', 'constructed', 'from', 'the', 'coefficients', 'of', 'a', 'given', 'matrix', 'polynomial', 'plambda', 'we', 'also', 'show', 'that', 'these', 'ellifications', 'satisfy', 'many', 'desirable', 'properties', 'for', 'numerical', 'applications', 'they', 'are', 'strong', 'ellifications', 'regardless', 'of', 'whether', 'plambda', 'is', 'regular', 'or', 'singular', 'the', 'minimal', 'indices', 'of', 'the', 'ellifications', 'are', 'related', 'to', 'those', 'of', 'plambda', 'via', 'constant', 'uniform', 'shifts', 'and', 'eigenvectors', 'and', 'minimal', 'bases', 'of', 'plambda', 'can', 'be', 'recovered', 'from', 'those', 'of', 'any', 'of', 'the', 'strong', 'block', 'minimal', 'bases', 'ellifications', 'in', 'the', 'special', 'case', 'where', 'ell', 'divides', 'd', 'we', 'introduce', 'a', 'subfamily', 'of', 'strong', 'block', 'minimal', 'bases', 'matrix', 'polynomials', 'named', 'block', 'kronecker', 'matrix', 'polynomials', 'which', 'is', 'shown', 'to', 'be', 'a', 'fruitful', 'source', 'of', 'companion', 'ellifications']]
|
[-0.1421082496268184, 0.0988298823350611, -0.047310610148813645, 0.04903344240186604, -0.08810463640838861, -0.18013959325890355, -0.020735570301036167, 0.3144601448859334, -0.3553880048656856, -0.19170007546472662, 0.12556097166661495, -0.26637646284657074, -0.1878112971773018, 0.1441376493151927, -0.04225811889455637, 0.07670472895504658, 0.06373647139962453, 0.07475988131641857, -0.12621016268654547, -0.2506000199598943, 0.3223583301561229, 0.030484046593278188, 0.2012206861167845, 0.020655204045009676, 0.11963448614984859, 0.0021838569452159026, -0.025259850391217035, -0.003248264623086375, -0.09491078805574825, 0.1349860732603334, 0.2665512044926675, 0.1644465162617151, 0.23287593452965955, -0.3961492018027749, -0.11843824604717806, 0.21307934971991926, 0.15813688837018686, 0.062012193199593425, -0.010389930937056336, -0.20741585761792825, 0.15290366306847183, -0.14589075455435768, -0.1551583104200379, -0.06321163373135219, 0.027527519165528164, 0.016508159038967147, -0.3566700996266214, 0.03927876912879032, 0.09862919458581491, 0.07173350194068995, 0.04118378669282401, -0.19457601807803077, 0.03436615837852232, 0.055630506147123664, -0.00923416764983514, -0.010642962209167571, 0.04215701637009582, -0.07081608314131006, -0.07776947323794373, 0.3731794076371141, -0.0436398630965138, -0.2742324577079622, 0.11304289630247744, -0.12420048358234903, -0.1436325250603662, 0.10750338520782425, 0.12718745199324638, 0.14736686180436492, -0.08795605867619699, 0.17366922544309155, -0.14227673374301342, 0.16955475031905926, 0.10286800623014031, 0.023835515408416948, 0.12624670448460842, 0.03408049351921547, 0.0845223579600719, 0.13892487524853117, 0.03724373162565215, -0.04896333072139522, -0.29421439079403044, -0.15358163934286737, -0.22962625029611164, 0.08100727717279724, -0.1807565739691856, -0.19597983556841198, 0.4145872686730718, 0.05527202558068269, 0.22448876918552424, 0.07702344092616092, 0.21218103025821358, 0.11481423234013968, 0.061315242225255494, 0.060638927225870776, 0.1323038824765215, 0.20057001218640175, -0.00891378407100962, -0.17563004742669855, 0.07769552434438214, 0.18144135283380208]
|
1,803.06307
|
Exchange-correlation functionals of i-DFT for asymmetrically coupled
leads
|
A recently proposed density functional approach for steady-state transport
through nanoscale systems (called i-DFT) is used to investigate junctions which
are asymmetrically coupled to the leads and biased with asymmetric voltage
drops. In the latter case, the system can simply be transformed to a physically
equivalent one with symmetric voltage drop by a total energy shift of the
entire system. For the former case, known exchange correlation gate and bias
functionals have to be generalized to take into account the asymmetric coupling
to the leads. We show how differential conductance spectra of the constant
interaction model evolve with increasing asymmetry of both voltage drops and
coupling to the leads.
|
cond-mat.mes-hall cond-mat.str-el
|
a recently proposed density functional approach for steadystate transport through nanoscale systems called idft is used to investigate junctions which are asymmetrically coupled to the leads and biased with asymmetric voltage drops in the latter case the system can simply be transformed to a physically equivalent one with symmetric voltage drop by a total energy shift of the entire system for the former case known exchange correlation gate and bias functionals have to be generalized to take into account the asymmetric coupling to the leads we show how differential conductance spectra of the constant interaction model evolve with increasing asymmetry of both voltage drops and coupling to the leads
|
[['a', 'recently', 'proposed', 'density', 'functional', 'approach', 'for', 'steadystate', 'transport', 'through', 'nanoscale', 'systems', 'called', 'idft', 'is', 'used', 'to', 'investigate', 'junctions', 'which', 'are', 'asymmetrically', 'coupled', 'to', 'the', 'leads', 'and', 'biased', 'with', 'asymmetric', 'voltage', 'drops', 'in', 'the', 'latter', 'case', 'the', 'system', 'can', 'simply', 'be', 'transformed', 'to', 'a', 'physically', 'equivalent', 'one', 'with', 'symmetric', 'voltage', 'drop', 'by', 'a', 'total', 'energy', 'shift', 'of', 'the', 'entire', 'system', 'for', 'the', 'former', 'case', 'known', 'exchange', 'correlation', 'gate', 'and', 'bias', 'functionals', 'have', 'to', 'be', 'generalized', 'to', 'take', 'into', 'account', 'the', 'asymmetric', 'coupling', 'to', 'the', 'leads', 'we', 'show', 'how', 'differential', 'conductance', 'spectra', 'of', 'the', 'constant', 'interaction', 'model', 'evolve', 'with', 'increasing', 'asymmetry', 'of', 'both', 'voltage', 'drops', 'and', 'coupling', 'to', 'the', 'leads']]
|
[-0.14457606435368914, 0.11183272926307736, -0.08701471093435421, 0.034156954048389414, -0.041655240324112254, -0.2050772549524698, 0.038115892882903166, 0.3691774334399662, -0.2869440013662391, -0.33216395530285775, 0.026447927014295592, -0.2734489887589674, -0.11409447570288674, 0.18344318765480447, -0.012632657312403579, -0.002259171627666972, 0.013587747286116584, 0.0027692611756469677, -0.055217774302929366, -0.20920618823430406, 0.2972187891414543, 0.029685787773806465, 0.3109926325738977, 0.06990846849277342, 0.07713461740779767, -0.008063021088189898, 0.049175746221983924, 0.0895539868682828, -0.09054679755087293, 0.07182657613564249, 0.20782427362074493, -0.02853679553597072, 0.22979301720037373, -0.44502858357897046, -0.2060551307070146, 0.09421158482171349, 0.13395898926302519, 0.13204164261643458, -0.03255122456562902, -0.261601038866702, 0.045368117910442415, -0.19674655224341864, -0.09722910087914505, -0.06662138845822817, 0.01596856687149597, 0.06513620600309394, -0.28404388234976236, 0.12462988791457556, 0.02985581672011336, -0.059227470334174984, -0.03715450590937783, -0.07590944348373066, -0.059976294474385745, 0.10811108999555598, 0.018413426624739184, 0.027290829957180886, 0.1764907805706212, -0.07832509858123617, -0.05027323986837264, 0.33213974610654584, -0.09129907048538054, -0.21479955189135097, 0.1419327136624707, -0.12771873677217768, -0.026411896622782455, 0.14220162497944447, 0.1694525401107967, 0.07227919102270464, -0.1691890191799457, 0.05801079275968715, 0.03125164612867109, 0.16461913529975733, 0.04276337613855753, -0.0019302632330720304, 0.22707451014446284, 0.14462318620858117, 0.09860430680078651, 0.19457365691858353, -0.06776321487962653, -0.12941298248468464, -0.2426587107736583, -0.11854194795046377, -0.10940224099306202, 0.07292572235039205, -0.039617077810203856, -0.1717302383077459, 0.4203388716922988, 0.14817194715398577, 0.21485665524292977, 0.03265405689695115, 0.278330285102129, 0.23517058577832825, 0.10943635652021189, 0.021863123111495183, 0.24111867609749968, 0.18659616509717333, 0.09968748505423786, -0.2772674866986179, 0.07464247270393262, -0.0196483848902713]
|
1,803.06308
|
Actions of nonamenable groups on $\mathcal{Z}$-stable $C^*$-algebras
|
We study strongly outer actions of discrete groups on C*-algebras in relation
to (non)amenability. In contrast to related results for amenable groups, where
uniqueness of strongly outer actions on the Jiang-Su algebra is expected, we
show that uniqueness fails for all nonamenable groups, and that the failure is
drastic. Our main result implies that if $G$ contains a copy of the free group,
then there exist uncountable many, non-cocycle conjugate strongly outer actions
of $G$ on any Jiang-Su stable tracial C*-algebra. Similar conclusions apply for
outer actions on McDuff tracial von Neumann algebras. We moreover show that $G$
is amenable if and only if the Bernoulli shift on a finite strongly
self-absorbing C*-algebra absorbs the trivial action on the Jiang-Su algebra.
Our methods consist in a careful study of weak containments of the Koopman
representations of different Bernoulli-type actions.
|
math.OA math.FA
|
we study strongly outer actions of discrete groups on calgebras in relation to nonamenability in contrast to related results for amenable groups where uniqueness of strongly outer actions on the jiangsu algebra is expected we show that uniqueness fails for all nonamenable groups and that the failure is drastic our main result implies that if g contains a copy of the free group then there exist uncountable many noncocycle conjugate strongly outer actions of g on any jiangsu stable tracial calgebra similar conclusions apply for outer actions on mcduff tracial von neumann algebras we moreover show that g is amenable if and only if the bernoulli shift on a finite strongly selfabsorbing calgebra absorbs the trivial action on the jiangsu algebra our methods consist in a careful study of weak containments of the koopman representations of different bernoullitype actions
|
[['we', 'study', 'strongly', 'outer', 'actions', 'of', 'discrete', 'groups', 'on', 'calgebras', 'in', 'relation', 'to', 'nonamenability', 'in', 'contrast', 'to', 'related', 'results', 'for', 'amenable', 'groups', 'where', 'uniqueness', 'of', 'strongly', 'outer', 'actions', 'on', 'the', 'jiangsu', 'algebra', 'is', 'expected', 'we', 'show', 'that', 'uniqueness', 'fails', 'for', 'all', 'nonamenable', 'groups', 'and', 'that', 'the', 'failure', 'is', 'drastic', 'our', 'main', 'result', 'implies', 'that', 'if', 'g', 'contains', 'a', 'copy', 'of', 'the', 'free', 'group', 'then', 'there', 'exist', 'uncountable', 'many', 'noncocycle', 'conjugate', 'strongly', 'outer', 'actions', 'of', 'g', 'on', 'any', 'jiangsu', 'stable', 'tracial', 'calgebra', 'similar', 'conclusions', 'apply', 'for', 'outer', 'actions', 'on', 'mcduff', 'tracial', 'von', 'neumann', 'algebras', 'we', 'moreover', 'show', 'that', 'g', 'is', 'amenable', 'if', 'and', 'only', 'if', 'the', 'bernoulli', 'shift', 'on', 'a', 'finite', 'strongly', 'selfabsorbing', 'calgebra', 'absorbs', 'the', 'trivial', 'action', 'on', 'the', 'jiangsu', 'algebra', 'our', 'methods', 'consist', 'in', 'a', 'careful', 'study', 'of', 'weak', 'containments', 'of', 'the', 'koopman', 'representations', 'of', 'different', 'bernoullitype', 'actions']]
|
[-0.12164977526546811, 0.16667794180060772, -0.10717248450629681, 0.030783362584456585, -0.12998782577354917, -0.15125250802023618, 0.017052864032737213, 0.42036289586216585, -0.2991427984289664, -0.13032728105217298, 0.1396606010393233, -0.28917440979091596, -0.12305977945919518, 0.21100197325078704, -0.19852711204037393, -0.059855215820959574, 0.1475228004102267, 0.17596676224748864, -0.0872467052854812, -0.23406337944978325, 0.4249027634856941, -0.07834958231994521, 0.22280247050853405, 0.044420350483692375, 0.08030261218601423, 0.02718567563448664, -0.006572642249495743, 0.019486662680484195, -0.1430767459550742, 0.07873918340213114, 0.272046650357866, 0.09435062039067312, 0.27048772746837774, -0.3505804816381537, -0.13464286404313425, 0.19645928210920569, 0.09332230871730893, -0.04170013436873397, -0.07113088100391488, -0.28045075507239914, 0.11338223505550794, -0.2517080770337723, -0.07489111900946005, -0.07687683747210305, 0.07977784524182621, -0.05215465027098577, -0.23311382680863357, 0.04403163532859632, 0.15723313735596997, 0.06871119258831516, -0.11735484322948421, -0.055580947005437864, -0.11361817484587539, 0.1304167245930101, -0.022137927874694947, -0.020288145466935453, 0.16879713342679167, -0.04414491802801566, -0.10803468161925887, 0.3866197920250271, -0.046582291576100124, -0.17962382630639367, 0.24800309129126316, -0.24866551753274238, -0.2519844927751332, 0.13063587270435884, 0.06575139357353287, 0.15185724131062814, 0.009069253392383564, 0.1953479559654906, -0.1773090192029695, 0.14832368176413713, 0.03234652348077126, 0.0017717155567604861, 0.07818328164410678, 0.04765267597625313, 0.18548073797116538, 0.1170126727041822, 0.14853618148523348, 0.01663233432918787, -0.3370688511259693, -0.13447122081189597, -0.12091965462071085, 0.11987512533405541, -0.07548957629269157, -0.19396040881916934, 0.3585651751688058, 0.12950486035870135, 0.12927511798237992, 0.09900887799239885, 0.2185882490141679, 0.06443576720248399, 0.06664166450098478, 0.13251974645050632, 0.1510181172898294, 0.25769572555951825, -0.1025612874696929, -0.21578611088405772, -0.002240743260267827, 0.20309851714577393]
|
1,803.06309
|
Modified dipole-dipole interaction and dissipation in an atomic ensemble
near surfaces
|
We study how the radiative properties of a dense ensemble of atoms can be
modified when they are placed near or between metallic or dielectric surfaces.
If the average separation between the atoms is comparable or smaller than the
wavelength of the scattered photons, the coupling to the radiation field
induces long-range coherent interactions based on the interatomic exchange of
virtual photons. Moreover, the incoherent scattering of photons back to the
electromagnetic field is known to be a many-body process, characterized by the
appearance of superradiant and subradiant emission modes. By changing the
radiation field properties, in this case by considering a layered medium where
the atoms are near metallic or dielectric surfaces, these scattering properties
can be dramatically modified. We perform a detailed study of these effects,
with focus on experimentally relevant parameter regimes. We finish with a
specific application in the context of quantum information storage, where the
presence of a nearby surface is shown to increase the storage time of an atomic
excitation that is transported across a one-dimensional chain.
|
quant-ph cond-mat.quant-gas
|
we study how the radiative properties of a dense ensemble of atoms can be modified when they are placed near or between metallic or dielectric surfaces if the average separation between the atoms is comparable or smaller than the wavelength of the scattered photons the coupling to the radiation field induces longrange coherent interactions based on the interatomic exchange of virtual photons moreover the incoherent scattering of photons back to the electromagnetic field is known to be a manybody process characterized by the appearance of superradiant and subradiant emission modes by changing the radiation field properties in this case by considering a layered medium where the atoms are near metallic or dielectric surfaces these scattering properties can be dramatically modified we perform a detailed study of these effects with focus on experimentally relevant parameter regimes we finish with a specific application in the context of quantum information storage where the presence of a nearby surface is shown to increase the storage time of an atomic excitation that is transported across a onedimensional chain
|
[['we', 'study', 'how', 'the', 'radiative', 'properties', 'of', 'a', 'dense', 'ensemble', 'of', 'atoms', 'can', 'be', 'modified', 'when', 'they', 'are', 'placed', 'near', 'or', 'between', 'metallic', 'or', 'dielectric', 'surfaces', 'if', 'the', 'average', 'separation', 'between', 'the', 'atoms', 'is', 'comparable', 'or', 'smaller', 'than', 'the', 'wavelength', 'of', 'the', 'scattered', 'photons', 'the', 'coupling', 'to', 'the', 'radiation', 'field', 'induces', 'longrange', 'coherent', 'interactions', 'based', 'on', 'the', 'interatomic', 'exchange', 'of', 'virtual', 'photons', 'moreover', 'the', 'incoherent', 'scattering', 'of', 'photons', 'back', 'to', 'the', 'electromagnetic', 'field', 'is', 'known', 'to', 'be', 'a', 'manybody', 'process', 'characterized', 'by', 'the', 'appearance', 'of', 'superradiant', 'and', 'subradiant', 'emission', 'modes', 'by', 'changing', 'the', 'radiation', 'field', 'properties', 'in', 'this', 'case', 'by', 'considering', 'a', 'layered', 'medium', 'where', 'the', 'atoms', 'are', 'near', 'metallic', 'or', 'dielectric', 'surfaces', 'these', 'scattering', 'properties', 'can', 'be', 'dramatically', 'modified', 'we', 'perform', 'a', 'detailed', 'study', 'of', 'these', 'effects', 'with', 'focus', 'on', 'experimentally', 'relevant', 'parameter', 'regimes', 'we', 'finish', 'with', 'a', 'specific', 'application', 'in', 'the', 'context', 'of', 'quantum', 'information', 'storage', 'where', 'the', 'presence', 'of', 'a', 'nearby', 'surface', 'is', 'shown', 'to', 'increase', 'the', 'storage', 'time', 'of', 'an', 'atomic', 'excitation', 'that', 'is', 'transported', 'across', 'a', 'onedimensional', 'chain']]
|
[-0.1352192933632147, 0.23888015870155963, -0.04987098818537561, 0.03610590813690778, -0.020446453439986946, -0.12409415539903189, 0.04122037493564576, 0.4061229701417719, -0.2799347216974018, -0.2789263520658964, 0.02832177744214719, -0.30950911991726177, -0.09114818461508506, 0.18207414505863292, 0.03784666400176683, -0.018453658806988456, 0.01696721161446518, 0.007049107280791322, -0.0577685748317112, -0.1958053341711403, 0.34026156672723373, 0.07935385733527922, 0.265906127597706, 0.08233535592847993, 0.03528196833532497, 0.02608049669534485, 0.05004852548284682, 0.017006575712002814, -0.09706761062871483, 0.09941251629242145, 0.21060415026274204, 0.010030532533769237, 0.21272674163082086, -0.48423161181066765, -0.22710706059877475, 0.0947991640615207, 0.156034114060155, 0.1315636600265441, -0.04398426431301185, -0.2944379723805805, 0.00523735830463426, -0.11439351831439, -0.12402553465809522, -0.03556185368868398, -0.0018492407075296334, 0.0401562584962459, -0.24718515272386846, 0.04488361609905872, 0.05348052027853303, 0.041252763435847495, -0.04548440794487392, -0.019298489173239022, -0.01823018063155859, 0.090708250461336, 0.021115202795696644, -0.00616506373609357, 0.19461781353652047, -0.15447837881329388, -0.06197403971848719, 0.3993544102985563, -0.09215125865264287, -0.16285386277534972, 0.20588358515211397, -0.1490840411938813, -0.00967870973053286, 0.18267847401913623, 0.17419681709456242, 0.13222391818074047, -0.13019867485425787, 0.065949669322793, -0.013520132545704786, 0.19177160827517697, 0.08729875593236244, 0.11001301541752209, 0.2488695738010776, 0.16100713541069084, 0.0070837018796043585, 0.1943046147887988, -0.10621844955144323, -0.08911569564296418, -0.2552382246499634, -0.15360710091856605, -0.2088860988272408, 0.06768680932377115, -0.06054089028934, -0.15741861071165064, 0.364692980208235, 0.1188175137701727, 0.18485571249291258, -0.04097923910870443, 0.29977667946206954, 0.12417301409231833, 0.07540464057517103, 0.04855868162996421, 0.29919598078505927, 0.1380243371738756, 0.054005302764701446, -0.2720239784008678, 0.04156643913983438, -0.0023907136772301674]
|
1,803.0631
|
Yangian Symmetry for the Action of Planar N=4 Super Yang-Mills and N=6
Super Chern-Simons Theories
|
In this article we establish the notion of classical Yangian symmetry for
planar N=4 supersymmetric Yang-Mills theory and for related planar gauge
theories. After revisiting Yangian invariance for the equations of motion, we
describe how the bi-local generators act on the action of the model such that
the latter becomes exactly invariant. In particular, we elaborate on the
relevance of the planar limit and how to act non-linearly with bi-local
generators on the cyclic action.
|
hep-th math-ph math.MP
|
in this article we establish the notion of classical yangian symmetry for planar n4 supersymmetric yangmills theory and for related planar gauge theories after revisiting yangian invariance for the equations of motion we describe how the bilocal generators act on the action of the model such that the latter becomes exactly invariant in particular we elaborate on the relevance of the planar limit and how to act nonlinearly with bilocal generators on the cyclic action
|
[['in', 'this', 'article', 'we', 'establish', 'the', 'notion', 'of', 'classical', 'yangian', 'symmetry', 'for', 'planar', 'n4', 'supersymmetric', 'yangmills', 'theory', 'and', 'for', 'related', 'planar', 'gauge', 'theories', 'after', 'revisiting', 'yangian', 'invariance', 'for', 'the', 'equations', 'of', 'motion', 'we', 'describe', 'how', 'the', 'bilocal', 'generators', 'act', 'on', 'the', 'action', 'of', 'the', 'model', 'such', 'that', 'the', 'latter', 'becomes', 'exactly', 'invariant', 'in', 'particular', 'we', 'elaborate', 'on', 'the', 'relevance', 'of', 'the', 'planar', 'limit', 'and', 'how', 'to', 'act', 'nonlinearly', 'with', 'bilocal', 'generators', 'on', 'the', 'cyclic', 'action']]
|
[-0.11691102717382212, 0.1995933921635151, -0.04708974854710202, 0.06049799313613524, -0.09666529335081578, -0.10478948379556338, -0.029384404689384004, 0.34642132895688216, -0.2260659432411194, -0.22105788315335909, 0.08573048658824216, -0.24829959449668726, -0.22714231848716737, 0.13130797224429747, -0.08777205422520637, 0.050366875051210326, 0.01562689719721675, 0.1260600011640539, -0.10492501313177248, -0.2415866536522905, 0.34807026432827115, 0.011820674613118172, 0.30935177529851593, 0.038420506175607445, 0.14023795881619056, 0.1084797101902465, 0.011443060369541248, -0.008290853686630725, -0.12485058985388604, 0.1364824417916437, 0.1933147921351095, 0.06024850053091844, 0.08462307672947646, -0.47524460514386496, -0.15334892861545085, 0.09101976389686267, 0.12951909999052683, 0.14686621891955534, 0.001892845731539031, -0.2754113154982527, 0.029500035600115857, -0.18988425825412075, -0.19721641980266819, -0.0718581328416864, 0.0064593696035444735, -0.07928164184093475, -0.20277534609815726, 0.053342414675280454, 0.10861934099346399, 0.07641249908755222, -0.032994622637828194, -0.009817636767402292, -0.06515755770417551, 0.10746528231849273, 0.09064526110421867, 0.011890006475150585, 0.12179056014399975, -0.18839405900177855, -0.17303458131849767, 0.40989212701718014, -0.05786130608369907, -0.2762190048396587, 0.1648529558442533, -0.13497781226333852, -0.25572444605330624, -0.004357695163538059, 0.14979290928070743, 0.15862187733873725, -0.10542341782401006, 0.23635964861605316, -0.08096520888308684, 0.056855143917103605, 0.09201742869709657, 0.03957307200257977, 0.18786101176093023, 0.0977656982311358, 0.07430372921129068, 0.17590726661185424, 0.048227627516413726, -0.15325366569062074, -0.445079457561175, -0.13751062321166196, -0.08683416183106601, 0.10749300064208607, -0.10340679875846642, -0.15854929000139237, 0.40041076093291245, 0.19820958703989164, 0.13799893611421188, 0.07970119433477521, 0.16478876778235038, 0.16359007136275372, 0.09463121678680181, 0.03262533620310326, 0.21110039881120127, 0.1708147766192754, 0.02383061212177078, -0.2948008778815468, -0.1033658957729737, 0.24029218681156636]
|
1,803.06311
|
Experimental Demonstration of Non-Destructive Discrimination of
Arbitrary Set of Orthogonal Quantum States Using 5-qubit IBM Quantum Computer
on Cloud
|
A protocol for non-destructive descrimination of arbitrary set of orthogonal
quantum states was proposed by V. S. Manu et al., using an algorithm based on
quantum phase estimation. IBM Corporation has released a superconductivity
based 5-qubit (5-qubit transmon bowtie chip 3 and IBM 5-qubit real processor)
quantum computer named Quantum Experience and placed it on cloud. In this paper
we take advantage of the online availability of those real quantum
processors(ibmqx2 amd ibmqx4) and carry out the above protocol that has
experimentally demonstrated earlier using NMR quantum processor. Here, we set
up experiments for arbitrary one-qubit and two-qubit orthogonal quantum states.
The experiment confirmed that the arbitrary orthogonal quantum states can be
discriminate in a nondestructive manner with a high fidelity. We compare the
outcomes of those experiments which are done by ibmqx2 and ibmqx4 processors.
Here, we also show the state tomography for the single qubit experiments.
|
quant-ph
|
a protocol for nondestructive descrimination of arbitrary set of orthogonal quantum states was proposed by v s manu et al using an algorithm based on quantum phase estimation ibm corporation has released a superconductivity based 5qubit 5qubit transmon bowtie chip 3 and ibm 5qubit real processor quantum computer named quantum experience and placed it on cloud in this paper we take advantage of the online availability of those real quantum processorsibmqx2 amd ibmqx4 and carry out the above protocol that has experimentally demonstrated earlier using nmr quantum processor here we set up experiments for arbitrary onequbit and twoqubit orthogonal quantum states the experiment confirmed that the arbitrary orthogonal quantum states can be discriminate in a nondestructive manner with a high fidelity we compare the outcomes of those experiments which are done by ibmqx2 and ibmqx4 processors here we also show the state tomography for the single qubit experiments
|
[['a', 'protocol', 'for', 'nondestructive', 'descrimination', 'of', 'arbitrary', 'set', 'of', 'orthogonal', 'quantum', 'states', 'was', 'proposed', 'by', 'v', 's', 'manu', 'et', 'al', 'using', 'an', 'algorithm', 'based', 'on', 'quantum', 'phase', 'estimation', 'ibm', 'corporation', 'has', 'released', 'a', 'superconductivity', 'based', '5qubit', '5qubit', 'transmon', 'bowtie', 'chip', '3', 'and', 'ibm', '5qubit', 'real', 'processor', 'quantum', 'computer', 'named', 'quantum', 'experience', 'and', 'placed', 'it', 'on', 'cloud', 'in', 'this', 'paper', 'we', 'take', 'advantage', 'of', 'the', 'online', 'availability', 'of', 'those', 'real', 'quantum', 'processorsibmqx2', 'amd', 'ibmqx4', 'and', 'carry', 'out', 'the', 'above', 'protocol', 'that', 'has', 'experimentally', 'demonstrated', 'earlier', 'using', 'nmr', 'quantum', 'processor', 'here', 'we', 'set', 'up', 'experiments', 'for', 'arbitrary', 'onequbit', 'and', 'twoqubit', 'orthogonal', 'quantum', 'states', 'the', 'experiment', 'confirmed', 'that', 'the', 'arbitrary', 'orthogonal', 'quantum', 'states', 'can', 'be', 'discriminate', 'in', 'a', 'nondestructive', 'manner', 'with', 'a', 'high', 'fidelity', 'we', 'compare', 'the', 'outcomes', 'of', 'those', 'experiments', 'which', 'are', 'done', 'by', 'ibmqx2', 'and', 'ibmqx4', 'processors', 'here', 'we', 'also', 'show', 'the', 'state', 'tomography', 'for', 'the', 'single', 'qubit', 'experiments']]
|
[-0.1445473454699948, 0.14937686652741958, -0.07069242593575398, -0.045301135862246156, 0.015758574985224625, -0.2447984884782084, 0.0854811736294229, 0.40276529038774556, -0.16311434739237202, -0.30784644312385856, 0.05427327532449673, -0.26146514185318914, -0.13932243242281778, 0.2803542152079272, -0.005476984876240122, 0.17267324106832002, 0.11730256615977348, 0.021609175709429485, -0.05283581980921585, -0.3080374221863418, 0.259547078577352, 0.0515072052784521, 0.3240351274898597, 0.029931489948247528, 0.13134528611433402, 0.0059497008421297735, 0.05991633560986194, -0.030555454692963897, -0.07767325025262584, 0.08547797616418644, 0.27093549381363496, 0.1434363193360382, 0.23577887942564899, -0.46042361209361715, -0.16000511382288973, 0.0805542599538277, 0.12011738039617395, 0.14940365771522168, -0.07807303836151701, -0.3745913061602362, 0.0634122789387816, -0.22640607571550483, -0.029792875070767156, -0.12197675001646938, -0.004769449453030167, -0.04244703420855362, -0.24712434067101827, 0.005331363946255618, -0.004546821144698509, 0.09843367910943926, 0.01840065678838512, -0.07189382792867977, 0.08165175038036601, 0.09601354887709021, -0.18314240694302938, 0.04583500989648546, 0.16546257976121428, -0.03929905525232055, -0.24901405778424493, 0.3221966085762813, -0.017995239511646072, -0.1690138875089329, 0.1371746755991902, -0.07146327094785099, -0.11368883030633603, 0.014160003113271348, 0.1347459144745793, 0.06853109325185933, -0.11235115291101151, 0.10082368924210233, -0.05283855911633321, 0.2079404442988593, 0.05382614895853952, 0.04298718106483334, 0.1459620665718705, 0.12032707729537426, 0.008486867126013185, 0.20160557890294825, -0.10401123994479662, -0.14779205094452882, -0.2491195623345416, -0.22536909348524078, -0.27813142186576695, 0.07740987528693573, -0.011347802708644002, -0.10755022158525114, 0.38245320579615133, 0.1429549873581734, 0.14207478840995966, -0.018017234755198248, 0.32408498037799166, 0.07618991280925974, 0.07342191757955428, 0.09258013332969156, 0.20748053570117417, 0.12728147042016016, 0.07247421133235611, -0.26136916117935344, 0.031107810361246612, -0.014937721008177975]
|
1,803.06312
|
EVA$^2$: Exploiting Temporal Redundancy in Live Computer Vision
|
Hardware support for deep convolutional neural networks (CNNs) is critical to
advanced computer vision in mobile and embedded devices. Current designs,
however, accelerate generic CNNs; they do not exploit the unique
characteristics of real-time vision. We propose to use the temporal redundancy
in natural video to avoid unnecessary computation on most frames. A new
algorithm, activation motion compensation, detects changes in the visual input
and incrementally updates a previously-computed output. The technique takes
inspiration from video compression and applies well-known motion estimation
techniques to adapt to visual changes. We use an adaptive key frame rate to
control the trade-off between efficiency and vision quality as the input
changes. We implement the technique in hardware as an extension to existing
state-of-the-art CNN accelerator designs. The new unit reduces the average
energy per frame by 54.2%, 61.7%, and 87.6% for three CNNs with less than 1%
loss in vision accuracy.
|
cs.CV eess.IV
|
hardware support for deep convolutional neural networks cnns is critical to advanced computer vision in mobile and embedded devices current designs however accelerate generic cnns they do not exploit the unique characteristics of realtime vision we propose to use the temporal redundancy in natural video to avoid unnecessary computation on most frames a new algorithm activation motion compensation detects changes in the visual input and incrementally updates a previouslycomputed output the technique takes inspiration from video compression and applies wellknown motion estimation techniques to adapt to visual changes we use an adaptive key frame rate to control the tradeoff between efficiency and vision quality as the input changes we implement the technique in hardware as an extension to existing stateoftheart cnn accelerator designs the new unit reduces the average energy per frame by 542 617 and 876 for three cnns with less than 1 loss in vision accuracy
|
[['hardware', 'support', 'for', 'deep', 'convolutional', 'neural', 'networks', 'cnns', 'is', 'critical', 'to', 'advanced', 'computer', 'vision', 'in', 'mobile', 'and', 'embedded', 'devices', 'current', 'designs', 'however', 'accelerate', 'generic', 'cnns', 'they', 'do', 'not', 'exploit', 'the', 'unique', 'characteristics', 'of', 'realtime', 'vision', 'we', 'propose', 'to', 'use', 'the', 'temporal', 'redundancy', 'in', 'natural', 'video', 'to', 'avoid', 'unnecessary', 'computation', 'on', 'most', 'frames', 'a', 'new', 'algorithm', 'activation', 'motion', 'compensation', 'detects', 'changes', 'in', 'the', 'visual', 'input', 'and', 'incrementally', 'updates', 'a', 'previouslycomputed', 'output', 'the', 'technique', 'takes', 'inspiration', 'from', 'video', 'compression', 'and', 'applies', 'wellknown', 'motion', 'estimation', 'techniques', 'to', 'adapt', 'to', 'visual', 'changes', 'we', 'use', 'an', 'adaptive', 'key', 'frame', 'rate', 'to', 'control', 'the', 'tradeoff', 'between', 'efficiency', 'and', 'vision', 'quality', 'as', 'the', 'input', 'changes', 'we', 'implement', 'the', 'technique', 'in', 'hardware', 'as', 'an', 'extension', 'to', 'existing', 'stateoftheart', 'cnn', 'accelerator', 'designs', 'the', 'new', 'unit', 'reduces', 'the', 'average', 'energy', 'per', 'frame', 'by', '542', '617', 'and', '876', 'for', 'three', 'cnns', 'with', 'less', 'than', '1', 'loss', 'in', 'vision', 'accuracy']]
|
[-0.09469137790084288, -0.002297927787318209, -0.03831904763717683, 0.052556886062391, -0.11872017569210683, -0.1992069158917041, 0.009456535736791085, 0.4676524068014948, -0.2911700093969262, -0.3616120297134527, 0.06021183009795857, -0.2303645574122768, -0.19840179280868755, 0.21541658700978686, -0.226866459387246, 0.13360713323266749, 0.11920301781218448, 0.046539188397267985, -0.08513681580882042, -0.2707826210487936, 0.2097595670768626, 0.09473647873174569, 0.3520947187144712, -0.02324370396436771, 0.1349350795031028, 0.01875730212368826, -0.018188405473641044, -0.059365646532938084, -0.05860530884898696, 0.18023874162202913, 0.30263856582727433, 0.21661063114093063, 0.33780674833483443, -0.452795085204589, -0.23189992806874216, 0.07253262407863764, 0.16246090224642004, 0.09096133480724765, -0.04120434609295272, -0.270886096043034, 0.10600728989654296, -0.1673979743122677, 0.00879713261629395, -0.11692819506444377, -0.005350887989373626, 0.00015152960691626208, -0.2754319444160304, -0.0018051550597757906, 0.055491748781925115, 0.057234244402246295, -0.05952160708998358, -0.07280817723556145, 0.0562412201354557, 0.18606876002347753, -0.02354156959178933, 0.0947699278083353, 0.19471049655191097, -0.18623603500954405, -0.15454612905946183, 0.35827763467976775, -0.03437446305306858, -0.20638922304292587, 0.207285131791896, -0.002800332656054682, -0.14841905875269928, 0.14504504498924958, 0.26474507938680314, 0.058461469189087685, -0.14184892717182535, -0.002190263361773907, 0.07031608795482866, 0.2184196352153211, 0.09178133067561665, 0.036797006540566786, 0.1759444321128162, 0.2342009087017662, 0.07139829499332385, 0.12298024890982118, -0.1546953355268547, -0.06548497911992583, -0.19583385614159116, -0.1256738330750424, -0.1783990621302478, -0.03937256111552218, -0.10257885400534252, -0.10497061840126391, 0.38725278697706556, 0.25401879647570486, 0.18903230039428012, 0.10019357319342324, 0.406950343286971, 0.02792391133010136, 0.17146053899243172, 0.12280939432251192, 0.1873400550110681, 0.025530832685920334, 0.20110439764323165, -0.18225847436445514, 0.03361138525557377, 0.06957865525190435]
|
1,803.06313
|
Error Analysis of an Incremental POD Algorithm for PDE Simulation Data
|
In our earlier work [Fareed et al., Comput. Math. Appl. 75 (2018), no. 6,
1942-1960], we proposed an incremental SVD algorithm with respect to a weighted
inner product to compute the proper orthogonal decomposition (POD) of a set of
simulation data for a partial differential equation (PDE) without storing the
data. In this work, we perform an error analysis of the incremental SVD
algorithm. We also modify the algorithm to incrementally update both the SVD
and an error bound when a new column of data is added. We show the algorithm
produces the exact SVD of an approximate data matrix, and the operator norm
error between the approximate and exact data matrices is bounded above by the
computed error bound. This error bound also allows us to bound the error in the
incrementally computed singular values and singular vectors. We illustrate our
analysis with numerical results for three simulation data sets from a 1D
FitzHugh-Nagumo PDE system with various choices of the algorithm truncation
tolerances.
|
math.NA
|
in our earlier work fareed et al comput math appl 75 2018 no 6 19421960 we proposed an incremental svd algorithm with respect to a weighted inner product to compute the proper orthogonal decomposition pod of a set of simulation data for a partial differential equation pde without storing the data in this work we perform an error analysis of the incremental svd algorithm we also modify the algorithm to incrementally update both the svd and an error bound when a new column of data is added we show the algorithm produces the exact svd of an approximate data matrix and the operator norm error between the approximate and exact data matrices is bounded above by the computed error bound this error bound also allows us to bound the error in the incrementally computed singular values and singular vectors we illustrate our analysis with numerical results for three simulation data sets from a 1d fitzhughnagumo pde system with various choices of the algorithm truncation tolerances
|
[['in', 'our', 'earlier', 'work', 'fareed', 'et', 'al', 'comput', 'math', 'appl', '75', '2018', 'no', '6', '19421960', 'we', 'proposed', 'an', 'incremental', 'svd', 'algorithm', 'with', 'respect', 'to', 'a', 'weighted', 'inner', 'product', 'to', 'compute', 'the', 'proper', 'orthogonal', 'decomposition', 'pod', 'of', 'a', 'set', 'of', 'simulation', 'data', 'for', 'a', 'partial', 'differential', 'equation', 'pde', 'without', 'storing', 'the', 'data', 'in', 'this', 'work', 'we', 'perform', 'an', 'error', 'analysis', 'of', 'the', 'incremental', 'svd', 'algorithm', 'we', 'also', 'modify', 'the', 'algorithm', 'to', 'incrementally', 'update', 'both', 'the', 'svd', 'and', 'an', 'error', 'bound', 'when', 'a', 'new', 'column', 'of', 'data', 'is', 'added', 'we', 'show', 'the', 'algorithm', 'produces', 'the', 'exact', 'svd', 'of', 'an', 'approximate', 'data', 'matrix', 'and', 'the', 'operator', 'norm', 'error', 'between', 'the', 'approximate', 'and', 'exact', 'data', 'matrices', 'is', 'bounded', 'above', 'by', 'the', 'computed', 'error', 'bound', 'this', 'error', 'bound', 'also', 'allows', 'us', 'to', 'bound', 'the', 'error', 'in', 'the', 'incrementally', 'computed', 'singular', 'values', 'and', 'singular', 'vectors', 'we', 'illustrate', 'our', 'analysis', 'with', 'numerical', 'results', 'for', 'three', 'simulation', 'data', 'sets', 'from', 'a', '1d', 'fitzhughnagumo', 'pde', 'system', 'with', 'various', 'choices', 'of', 'the', 'algorithm', 'truncation', 'tolerances']]
|
[-0.08087936624816042, -0.028031018250864684, -0.09749189543875614, 0.020933496718654878, -0.07636877600720689, -0.10083589157228147, 0.08401635226056528, 0.3577649882006133, -0.2754144789708173, -0.32802553362808723, 0.14895171580687622, -0.27398323203285974, -0.16483487673332356, 0.18384701774478462, -0.09838228600036833, 0.13394959008921456, 0.12483871943728736, 0.014536094982491268, -0.12732396114537595, -0.2828270083656135, 0.28516159001223607, 0.08669419105713216, 0.24161085144450967, -0.02333942522506224, 0.12061989979469931, -0.01993672529869696, -0.07496837064612405, -0.03367753624573259, -0.14602976732893042, 0.15416691324422194, 0.24637597121663987, 0.16264798480765952, 0.2933889848945742, -0.3990208970074273, -0.1154316936225339, 0.1224876644684036, 0.1362978531107695, 0.15937488018735055, 0.008289871371688287, -0.2981246131717976, 0.10142755816994875, -0.17691116096120488, -0.1003040601727924, -0.10278118751725994, 0.003886866754640831, -0.02435981413132391, -0.3749756523425137, 0.08842801293208225, 0.06722861080447588, 0.0335404917382081, -0.08462930226197146, -0.18184343346843118, 0.00023506917530796462, 0.0569792371409291, -0.007968952642193784, 0.031975217386394555, 0.07115162759619348, -0.035550511126446485, -0.13371581082557973, 0.29102878670488125, -0.06031123535747589, -0.2472889843265429, 0.10478440304772436, -0.04392023076034762, -0.1143628263794617, 0.1621034015569996, 0.2047385286619784, 0.10156115277333219, -0.11654077059393991, 0.09591648913777084, -0.08105542704440151, 0.16714199652975323, 0.054908409646135165, -0.02831962170790698, 0.020653183060623935, 0.13105020161141054, 0.12346527276652082, 0.11536957649085557, -0.07199365951183703, -0.07896243431069745, -0.28948120737985417, -0.1382083218084774, -0.224112517268974, -0.015441904562965401, -0.18019434794168662, -0.18393508562006833, 0.3740656514440669, 0.18394972028587858, 0.2076668011515967, 0.11401902404299542, 0.33787195873589604, 0.13947844518246086, -0.004696098367677876, 0.1749772748401377, 0.20083520028374494, 0.14975748512968193, 0.09520745392820221, -0.23260113945876482, 0.02514775346770334, 0.13236197845128642]
|
1,803.06314
|
Potential Impact of Global Navigation Satellite Services on Total Power
HI Intensity Mapping Surveys
|
Future total-power single-dish HI intensity mapping (HI IM) surveys have the
potential to provide unprecedented insight into late time ($z < 1$) cosmology
that are competitive with Stage IV dark energy surveys. However, redshifts
between $0 < z < 0.2$ lie within the transmission bands of global navigation
satellite services (GNSS), and even at higher redshifts out-of-band leakage
from GNSS satellites may be problematic. We estimate the impact of GNSS
satellites on future single-dish HI IM surveys using realistic estimates of
both the total power and spectral structure of GNSS signals convolved with a
model SKA beam. Using a simulated SKA HI IM survey covering 30000 sq. deg. of
sky and 200 dishes, we compare the integrated GNSS emission on the sky with the
expected HI signal. It is found that for frequencies $> 950$ MHz the emission
from GNSS satellites will exceed the expected HI signal for all angular scales
to which the SKA is sensitive when operating in single-dish mode.
|
astro-ph.IM astro-ph.CO
|
future totalpower singledish hi intensity mapping hi im surveys have the potential to provide unprecedented insight into late time z 1 cosmology that are competitive with stage iv dark energy surveys however redshifts between 0 z 02 lie within the transmission bands of global navigation satellite services gnss and even at higher redshifts outofband leakage from gnss satellites may be problematic we estimate the impact of gnss satellites on future singledish hi im surveys using realistic estimates of both the total power and spectral structure of gnss signals convolved with a model ska beam using a simulated ska hi im survey covering 30000 sq deg of sky and 200 dishes we compare the integrated gnss emission on the sky with the expected hi signal it is found that for frequencies 950 mhz the emission from gnss satellites will exceed the expected hi signal for all angular scales to which the ska is sensitive when operating in singledish mode
|
[['future', 'totalpower', 'singledish', 'hi', 'intensity', 'mapping', 'hi', 'im', 'surveys', 'have', 'the', 'potential', 'to', 'provide', 'unprecedented', 'insight', 'into', 'late', 'time', 'z', '1', 'cosmology', 'that', 'are', 'competitive', 'with', 'stage', 'iv', 'dark', 'energy', 'surveys', 'however', 'redshifts', 'between', '0', 'z', '02', 'lie', 'within', 'the', 'transmission', 'bands', 'of', 'global', 'navigation', 'satellite', 'services', 'gnss', 'and', 'even', 'at', 'higher', 'redshifts', 'outofband', 'leakage', 'from', 'gnss', 'satellites', 'may', 'be', 'problematic', 'we', 'estimate', 'the', 'impact', 'of', 'gnss', 'satellites', 'on', 'future', 'singledish', 'hi', 'im', 'surveys', 'using', 'realistic', 'estimates', 'of', 'both', 'the', 'total', 'power', 'and', 'spectral', 'structure', 'of', 'gnss', 'signals', 'convolved', 'with', 'a', 'model', 'ska', 'beam', 'using', 'a', 'simulated', 'ska', 'hi', 'im', 'survey', 'covering', '30000', 'sq', 'deg', 'of', 'sky', 'and', '200', 'dishes', 'we', 'compare', 'the', 'integrated', 'gnss', 'emission', 'on', 'the', 'sky', 'with', 'the', 'expected', 'hi', 'signal', 'it', 'is', 'found', 'that', 'for', 'frequencies', '950', 'mhz', 'the', 'emission', 'from', 'gnss', 'satellites', 'will', 'exceed', 'the', 'expected', 'hi', 'signal', 'for', 'all', 'angular', 'scales', 'to', 'which', 'the', 'ska', 'is', 'sensitive', 'when', 'operating', 'in', 'singledish', 'mode']]
|
[-0.10759784937895174, 0.0407010524605896, -0.02192448086659365, 0.08950390356822717, -0.09619871147354192, -0.1129420972812355, 0.008755784215040127, 0.4430624898994648, -0.17553623073404254, -0.30657331095536866, 0.1493644037488789, -0.34444259690663104, -0.03151864274972283, 0.23926979325611522, 0.02521251588971413, 0.0043921243470115, 0.05009415013350169, -0.13831048309224617, -0.03319795546416618, -0.23579925429842236, 0.19718850836160745, 0.1769656533422538, 0.21840773535232189, -0.04901294420101927, 0.11687245338719009, -0.09989486519936944, -0.13897605248007783, -0.04612192323820406, -0.15294509688460436, 0.015482470409390575, 0.3529621518741633, 0.1911989174299885, 0.1760064288178058, -0.3529364600589004, -0.18556432384714672, 0.11536316144504125, 0.17768086363632185, 0.03214828610712002, -0.010439177534448667, -0.3649731710629797, 0.04447203377612478, -0.21625190195804345, -0.14321915940912086, 0.05515377781032644, -0.0008068899741938597, 0.09628764424646934, -0.22162496592500247, 0.10682159030951466, -0.07795510924796285, 0.12582235330055597, -0.09371033595739334, -0.12801675295421877, -0.04647171211022223, 0.10659479335944398, -0.035986503827108565, 0.08294919236560198, 0.2132440204348981, -0.1461949177569698, 0.007364641200114466, 0.4307199485918295, -0.11170191036926323, -0.031907090255578016, 0.1531019665984602, -0.2594835687800063, -0.16641664008987195, 0.18063695056885598, 0.19365384556718548, -0.04019681394212184, -0.12041588166451946, 0.03533408874122697, 0.021431168946555428, 0.2740306771630009, 0.07368833410606684, 0.11493785079875135, 0.3270965345716693, 0.08728490034088822, 0.18396898802175315, 0.013715112377385479, -0.3065394328621988, 0.03831934061305173, -0.19504756679356133, -0.06640650761826554, -0.1562981803419254, 0.11559207066068355, -0.12367330430360302, -0.02172921432028937, 0.353170491541335, 0.19034132257448746, 0.16743915934628464, 0.11568904641494036, 0.44877819596683677, 0.058822392559716406, 0.11064633574407501, 0.036834553812477216, 0.2906839292720432, 0.08134860886537906, 0.13741219550654105, -0.15244512540241115, -0.009547503724034075, -0.07577938199503041]
|
1,803.06315
|
Benchmarks for cyber-physical systems: A modular model library for
building automation systems (Extended version)
|
Building Automation Systems (BAS) are exemplars of Cyber-Physical Systems
(CPS), incorporating digital control architectures over underlying continuous
physical processes. We provide a modular model library for BAS drawn from
expertise developed on a real BAS setup. The library allows to build models
comprising of either physical quantities or digital control modules.% which are
composable. The structure, operation, and dynamics of the model can be complex,
incorporating (i) stochasticity, (ii) non-linearities, (iii) numerous
continuous variables or discrete states, (iv) various input and output signals,
and (v) a large number of possible discrete configurations. The modular
composition of BAS components can generate useful CPS benchmarks. We display
this use by means of three realistic case studies, where corresponding models
are built and engaged with different analysis goals. The benchmarks, the model
library and data collected from the BAS setup at the University of Oxford, are
kept on-line at https://github.com/natchi92/BASBenchmarks.
|
cs.SY
|
building automation systems bas are exemplars of cyberphysical systems cps incorporating digital control architectures over underlying continuous physical processes we provide a modular model library for bas drawn from expertise developed on a real bas setup the library allows to build models comprising of either physical quantities or digital control modules which are composable the structure operation and dynamics of the model can be complex incorporating i stochasticity ii nonlinearities iii numerous continuous variables or discrete states iv various input and output signals and v a large number of possible discrete configurations the modular composition of bas components can generate useful cps benchmarks we display this use by means of three realistic case studies where corresponding models are built and engaged with different analysis goals the benchmarks the model library and data collected from the bas setup at the university of oxford are kept online at httpsgithubcomnatchi92basbenchmarks
|
[['building', 'automation', 'systems', 'bas', 'are', 'exemplars', 'of', 'cyberphysical', 'systems', 'cps', 'incorporating', 'digital', 'control', 'architectures', 'over', 'underlying', 'continuous', 'physical', 'processes', 'we', 'provide', 'a', 'modular', 'model', 'library', 'for', 'bas', 'drawn', 'from', 'expertise', 'developed', 'on', 'a', 'real', 'bas', 'setup', 'the', 'library', 'allows', 'to', 'build', 'models', 'comprising', 'of', 'either', 'physical', 'quantities', 'or', 'digital', 'control', 'modules', 'which', 'are', 'composable', 'the', 'structure', 'operation', 'and', 'dynamics', 'of', 'the', 'model', 'can', 'be', 'complex', 'incorporating', 'i', 'stochasticity', 'ii', 'nonlinearities', 'iii', 'numerous', 'continuous', 'variables', 'or', 'discrete', 'states', 'iv', 'various', 'input', 'and', 'output', 'signals', 'and', 'v', 'a', 'large', 'number', 'of', 'possible', 'discrete', 'configurations', 'the', 'modular', 'composition', 'of', 'bas', 'components', 'can', 'generate', 'useful', 'cps', 'benchmarks', 'we', 'display', 'this', 'use', 'by', 'means', 'of', 'three', 'realistic', 'case', 'studies', 'where', 'corresponding', 'models', 'are', 'built', 'and', 'engaged', 'with', 'different', 'analysis', 'goals', 'the', 'benchmarks', 'the', 'model', 'library', 'and', 'data', 'collected', 'from', 'the', 'bas', 'setup', 'at', 'the', 'university', 'of', 'oxford', 'are', 'kept', 'online', 'at', 'httpsgithubcomnatchi92basbenchmarks']]
|
[-0.09282003318805611, 0.06684085166269964, -0.060339042787720794, 0.01760720856701445, -0.07944572532600531, -0.19111263542436063, 0.01883145398779275, 0.3768900099325262, -0.26544837181636594, -0.34850386315829135, 0.12310704699245421, -0.2684432603882296, -0.13461196019588523, 0.2360317145126604, -0.037757110919214125, 0.08165075407963093, 0.0501898186638543, -0.04462761893905923, -0.024390565356230107, -0.21780313178737432, 0.29937811155025273, 0.001679136365180044, 0.3069475818750742, -0.0464994000902476, 0.10552915347794276, 0.005807417228001438, -0.0578563511865979, -0.015457655708241749, -0.05182254326462822, 0.14388993906282999, 0.29448789236206946, 0.18338933246120911, 0.26698191897873447, -0.4444664940237999, -0.18931801992864028, 0.09657465370949231, 0.07450169169229187, 0.08223413667491676, -0.04264009391254273, -0.3014416601875644, 0.053891936379280705, -0.18496648499053225, -0.0803391744178554, -0.0955661969763316, -0.004941221482399731, 0.06275776699336871, -0.2902611381336823, -0.01992381999049055, 0.018499124429606488, 0.12006792786996812, -0.0478991091953852, -0.14004342799546987, -0.06589784620932546, 0.18919375060087912, -0.07346952201604001, -0.03682135744977181, 0.18680686675560698, -0.12017515871621197, -0.15087947810438704, 0.38167290616627425, -0.005995014379413364, -0.17489832870930128, 0.23924901378970936, -0.052957771232747156, -0.1585116121273692, 0.0838997102875186, 0.2490816154128119, 0.08573685621217608, -0.18892401764336783, 0.10167534974019349, 0.011485500809774823, 0.1959944213868106, -0.0028215793969288265, 0.029790633616407644, 0.21869255677710786, 0.20883705715125758, -0.026576696622812538, 0.12405617744901078, -0.027867436920705712, -0.1226848195213665, -0.28865236714474335, -0.09492662524141066, -0.1281053462824848, 0.0016198112726632558, -0.04421770379251453, -0.14100310305286556, 0.4017174845172271, 0.14364850095613566, 0.15399304326394037, 0.036486121970196954, 0.30419821800562, 0.06431441028819304, 0.11115970412805064, 0.06837728483066575, 0.12339806466918336, 0.03802236985919155, 0.14880757715014026, -0.13033105175916668, 0.06472734767267455, -0.01809958771209245]
|
1,803.06316
|
Temporal Gaussian Mixture Layer for Videos
|
We introduce a new convolutional layer named the Temporal Gaussian Mixture
(TGM) layer and present how it can be used to efficiently capture longer-term
temporal information in continuous activity videos. The TGM layer is a temporal
convolutional layer governed by a much smaller set of parameters (e.g.,
location/variance of Gaussians) that are fully differentiable. We present our
fully convolutional video models with multiple TGM layers for activity
detection. The extensive experiments on multiple datasets, including Charades
and MultiTHUMOS, confirm the effectiveness of TGM layers, significantly
outperforming the state-of-the-arts.
|
cs.CV
|
we introduce a new convolutional layer named the temporal gaussian mixture tgm layer and present how it can be used to efficiently capture longerterm temporal information in continuous activity videos the tgm layer is a temporal convolutional layer governed by a much smaller set of parameters eg locationvariance of gaussians that are fully differentiable we present our fully convolutional video models with multiple tgm layers for activity detection the extensive experiments on multiple datasets including charades and multithumos confirm the effectiveness of tgm layers significantly outperforming the stateofthearts
|
[['we', 'introduce', 'a', 'new', 'convolutional', 'layer', 'named', 'the', 'temporal', 'gaussian', 'mixture', 'tgm', 'layer', 'and', 'present', 'how', 'it', 'can', 'be', 'used', 'to', 'efficiently', 'capture', 'longerterm', 'temporal', 'information', 'in', 'continuous', 'activity', 'videos', 'the', 'tgm', 'layer', 'is', 'a', 'temporal', 'convolutional', 'layer', 'governed', 'by', 'a', 'much', 'smaller', 'set', 'of', 'parameters', 'eg', 'locationvariance', 'of', 'gaussians', 'that', 'are', 'fully', 'differentiable', 'we', 'present', 'our', 'fully', 'convolutional', 'video', 'models', 'with', 'multiple', 'tgm', 'layers', 'for', 'activity', 'detection', 'the', 'extensive', 'experiments', 'on', 'multiple', 'datasets', 'including', 'charades', 'and', 'multithumos', 'confirm', 'the', 'effectiveness', 'of', 'tgm', 'layers', 'significantly', 'outperforming', 'the', 'stateofthearts']]
|
[-0.046379594496269334, 0.06650411667323661, -0.026185802023472458, 0.032715240007683895, -0.07623353699521943, -0.17165222383457526, -0.011726648263076598, 0.4691864312037654, -0.28633408646109976, -0.31582469026418936, 0.07712144617542582, -0.26217336696974036, -0.20490800456315195, 0.14368867175118333, -0.08208732822396118, 0.07529537157883504, 0.1440073325480709, 0.011086219414565498, -0.04060954633490022, -0.25876462937937517, 0.3242989310502321, 0.03389663130430312, 0.32100099460061254, 0.02314063275016138, 0.1504968786986823, -0.05035349133627853, -0.046221131854958235, -0.00975234279858655, -0.031333405800560495, 0.17044484539856686, 0.2564273904010887, 0.14012254912395503, 0.2755179475222168, -0.4780243285985171, -0.3318947257631962, 0.013721662838461584, 0.14510602722176613, 0.06206351598800326, -0.012566584007528171, -0.37150230427839975, 0.11466256982577301, -0.17819688995850497, 0.06422030298713723, -0.1421710611695702, -0.06980060005089504, -0.015794540380780726, -0.3197843901620343, 0.07566460272586294, 0.068852176575322, 0.04428783841109995, -0.03730926975265317, -0.098498468297994, -0.02948853554974856, 0.16779610448805937, -0.015880593136167048, 0.04262294880804959, 0.13523966796567727, -0.1836402802085825, -0.11261758600875478, 0.29956254326663484, -0.1291394906316552, -0.22249626179075874, 0.2355993726536974, -0.028650019144580496, -0.10752925287996387, 0.10956445501731901, 0.2391561389440435, 0.1746835102214767, -0.1382124134200229, -0.04880895442195536, -0.09935519188621092, 0.26840540534420604, 0.04776546320524709, 0.012553637167545914, 0.19784117368017806, 0.30082488731192103, -0.02600440571362945, 0.16665660425747647, -0.19433488147386788, -0.0854053180343632, -0.19858095222340105, -0.08136822211545432, -0.14551544616576925, -0.08398885087206445, -0.12228715002781647, -0.13491355721977935, 0.4743650572738428, 0.22931326354650416, 0.22894446810589697, 0.13017042784084534, 0.3119158039576021, 0.017173982246935462, 0.16844608217220883, 0.11176630743276114, 0.17065844726588192, 0.02134231189212323, 0.11789350824473405, -0.12634136349540845, 0.10366536043691395, 0.08056030418167169]
|
1,803.06317
|
A local characterization of crystals for the quantum queer superalgebra
|
We define operators on semistandard shifted tableaux and use Stembridge's
local characterization for regular graphs to prove they define a crystal
structure. This gives a new proof that Schur $P$-polynomials are Schur
positive. We define queer crystal operators (also called odd Kashiwara
operators) to construct a connected queer crystal on semistandard shifted
tableaux of a given shape. Using the tensor rule for queer crystals, this
provides a new proof that products of Schur $P$-polynomials are Schur
$P$-positive. Finally, to facilitate applications of queer crystals in the
context of Schur $P$-positivity, we give local axioms for queer regular graphs,
generalizing Stembridge's axioms, that partially characterize queer crystals.
|
math.CO math.RT
|
we define operators on semistandard shifted tableaux and use stembridges local characterization for regular graphs to prove they define a crystal structure this gives a new proof that schur ppolynomials are schur positive we define queer crystal operators also called odd kashiwara operators to construct a connected queer crystal on semistandard shifted tableaux of a given shape using the tensor rule for queer crystals this provides a new proof that products of schur ppolynomials are schur ppositive finally to facilitate applications of queer crystals in the context of schur ppositivity we give local axioms for queer regular graphs generalizing stembridges axioms that partially characterize queer crystals
|
[['we', 'define', 'operators', 'on', 'semistandard', 'shifted', 'tableaux', 'and', 'use', 'stembridges', 'local', 'characterization', 'for', 'regular', 'graphs', 'to', 'prove', 'they', 'define', 'a', 'crystal', 'structure', 'this', 'gives', 'a', 'new', 'proof', 'that', 'schur', 'ppolynomials', 'are', 'schur', 'positive', 'we', 'define', 'queer', 'crystal', 'operators', 'also', 'called', 'odd', 'kashiwara', 'operators', 'to', 'construct', 'a', 'connected', 'queer', 'crystal', 'on', 'semistandard', 'shifted', 'tableaux', 'of', 'a', 'given', 'shape', 'using', 'the', 'tensor', 'rule', 'for', 'queer', 'crystals', 'this', 'provides', 'a', 'new', 'proof', 'that', 'products', 'of', 'schur', 'ppolynomials', 'are', 'schur', 'ppositive', 'finally', 'to', 'facilitate', 'applications', 'of', 'queer', 'crystals', 'in', 'the', 'context', 'of', 'schur', 'ppositivity', 'we', 'give', 'local', 'axioms', 'for', 'queer', 'regular', 'graphs', 'generalizing', 'stembridges', 'axioms', 'that', 'partially', 'characterize', 'queer', 'crystals']]
|
[-0.12998120884305603, 0.11108028758668674, -0.08978586013973602, 0.07057096571705462, -0.20565694124868386, -0.17401277739993948, 0.04027545566776029, 0.3838971691944127, -0.3247731404273577, -0.14225330416833595, 0.06181327725281798, -0.1919905746548946, -0.18205855574177685, 0.151817697196988, -0.15973819159893846, -0.03794669794173525, 0.009677454038470422, 0.021032133223137486, -0.13706063640519167, -0.22416146992011662, 0.3481249021858258, -0.011173081232832288, 0.24207158145090601, 0.021841396487599134, 0.09661729423821254, 0.04660620776945198, -0.008855910374308532, -0.01157680714397498, -0.21007350764015223, 0.18296905453887963, 0.31458633049294565, 0.09683855556013098, 0.17480915995920956, -0.38926699200539655, -0.010054244339149797, 0.15851299024520898, 0.17088787800210686, 0.02271449990254247, -0.06342116756065977, -0.2716202117186391, 0.07578796975068608, -0.2235149708356849, -0.16984594484158563, -0.1229332423821654, 0.006683215189215569, 0.03619213600836273, -0.2960379605411051, -0.03129196696599532, 0.1315850941464305, 0.09369207384012077, -0.037788133901315475, -0.17114361536355233, 0.02192245742288541, 0.019127992342032912, -0.18304030542736346, -0.019877493661555973, 0.1017778833431877, -0.06451915646683565, -0.24513681888369457, 0.32423413342374535, 0.04897692269933375, -0.24833358983720108, 0.06250683332679195, -0.17494455679267082, -0.22070298861395918, 0.0779881587972478, 0.02681411848291491, 0.13956678413592702, -0.054167143447557464, 0.14978482832479784, -0.20200396593624972, 0.07717103851115648, 0.19384876821400984, 0.04971873252443917, 0.14019146909550675, 0.03760659120063174, 0.044997429611372215, 0.24716011350447276, 0.10078730349833111, -0.02333762645139359, -0.29042717470910473, -0.2526257905959732, -0.12341616677893501, 0.09604466141570571, -0.11985636483600587, -0.3054696165622686, 0.40154854606459234, 0.05323535179442568, 0.10570132029341657, 0.1512614302952194, 0.10895990589326073, 0.08641253360810708, 0.15607679010597322, -0.05466081007803298, 0.08361399506947975, 0.31708679746678275, 0.03922268437256791, -0.10944536937629136, -0.018162240500491606, 0.28940374856234863]
|
1,803.06318
|
Holographic meson decays via worldsheet instantons
|
We study meson decays using instanton methods in two string models. The first
model is the old string model in flat space which combines strings and massive
particles and the second is the holographic, Sakai-Sugimoto model. Using the
the old string model, we reproduce the QCD formula for the probability of
splitting of the QCD flux tube derived by Casher-Neuberger-Nussinov (CNN). In
the holographic model we construct a string worldsheet instanton which
interpolates between a single and double string configuration, which determines
the decay from one to two dual mesonic particles. The resulting probability for
meson decay incorporates both the effects of finite meson size as well as
back-reaction of the produced quarks on the QCD flux tube. In the limit of very
large strings the probability for a split reduces to the CNN formula. A
byproduct of our analysis is the analysis of the moduli space of a generic
double concentric Wilson loop with circles which are separated in the
holographic direction of the confining background.
|
hep-th hep-ph
|
we study meson decays using instanton methods in two string models the first model is the old string model in flat space which combines strings and massive particles and the second is the holographic sakaisugimoto model using the the old string model we reproduce the qcd formula for the probability of splitting of the qcd flux tube derived by casherneubergernussinov cnn in the holographic model we construct a string worldsheet instanton which interpolates between a single and double string configuration which determines the decay from one to two dual mesonic particles the resulting probability for meson decay incorporates both the effects of finite meson size as well as backreaction of the produced quarks on the qcd flux tube in the limit of very large strings the probability for a split reduces to the cnn formula a byproduct of our analysis is the analysis of the moduli space of a generic double concentric wilson loop with circles which are separated in the holographic direction of the confining background
|
[['we', 'study', 'meson', 'decays', 'using', 'instanton', 'methods', 'in', 'two', 'string', 'models', 'the', 'first', 'model', 'is', 'the', 'old', 'string', 'model', 'in', 'flat', 'space', 'which', 'combines', 'strings', 'and', 'massive', 'particles', 'and', 'the', 'second', 'is', 'the', 'holographic', 'sakaisugimoto', 'model', 'using', 'the', 'the', 'old', 'string', 'model', 'we', 'reproduce', 'the', 'qcd', 'formula', 'for', 'the', 'probability', 'of', 'splitting', 'of', 'the', 'qcd', 'flux', 'tube', 'derived', 'by', 'casherneubergernussinov', 'cnn', 'in', 'the', 'holographic', 'model', 'we', 'construct', 'a', 'string', 'worldsheet', 'instanton', 'which', 'interpolates', 'between', 'a', 'single', 'and', 'double', 'string', 'configuration', 'which', 'determines', 'the', 'decay', 'from', 'one', 'to', 'two', 'dual', 'mesonic', 'particles', 'the', 'resulting', 'probability', 'for', 'meson', 'decay', 'incorporates', 'both', 'the', 'effects', 'of', 'finite', 'meson', 'size', 'as', 'well', 'as', 'backreaction', 'of', 'the', 'produced', 'quarks', 'on', 'the', 'qcd', 'flux', 'tube', 'in', 'the', 'limit', 'of', 'very', 'large', 'strings', 'the', 'probability', 'for', 'a', 'split', 'reduces', 'to', 'the', 'cnn', 'formula', 'a', 'byproduct', 'of', 'our', 'analysis', 'is', 'the', 'analysis', 'of', 'the', 'moduli', 'space', 'of', 'a', 'generic', 'double', 'concentric', 'wilson', 'loop', 'with', 'circles', 'which', 'are', 'separated', 'in', 'the', 'holographic', 'direction', 'of', 'the', 'confining', 'background']]
|
[-0.0997183952278581, 0.1937943696737267, -0.11811524592564408, 0.14247518951698845, -0.039513242369270826, -0.1231781804754612, 0.038891795056967444, 0.2973195030522275, -0.1920506386731538, -0.23343086227177115, 0.020704589073731374, -0.2788927650979597, -0.08011798116544869, 0.12066280025377286, 0.00012446595748594725, 0.051217376114239536, 0.032625167589937616, 0.06757541011502764, -0.07689496831048324, -0.2274123336544754, 0.3440070739058015, 0.014120142228048608, 0.2809750366232257, 0.08175462362053523, 0.09896175929693034, 0.0095365026514102, -0.043720679478271, 0.018562065622227893, -0.11226951778047235, 0.11936570847118048, 0.15989381579797682, 0.07683316399679935, 0.10097008209720433, -0.4168394912505545, -0.21433140885039983, 0.09706775515329048, 0.1915174106736275, 0.15055004537318756, 0.0057310139141830965, -0.2648616335480979, 0.07782486834456717, -0.17314961374490465, -0.12490072821446481, -0.041346191337433114, -0.010487322537060154, -0.024823662122229046, -0.26238036208157706, 0.04526597758367972, -0.01355915720376792, -0.03304058171707733, -0.049841337997174585, -0.10304007866049567, -0.01603871008594442, 0.10416572256271828, 0.12591503432416076, 0.11133813715668911, 0.12290585418834901, -0.1973240173376917, -0.13000963998576962, 0.3801068797797324, -0.10951268311985488, -0.20298537344065865, 0.10200542680139328, -0.12523589401887394, -0.12370990859681225, 0.1250399653962445, 0.12434504509844582, 0.1320495407983481, -0.11970302624998233, 0.16338494805379278, -0.0696954231131373, 0.14866973480689397, 0.09421017345501087, 0.025785922448723072, 0.2754846484041268, 0.19317092834929767, -0.023214030477880353, 0.18630537371072603, -0.11526514493989343, -0.16726628373410687, -0.40622366870562715, -0.13008797347281936, -0.14672693529121397, 0.0504359734779033, -0.1523735699246824, -0.23138773924368153, 0.3922553864442351, 0.049598844902847994, 0.2458649154202676, 0.06530005876704242, 0.28628428363387126, 0.08092630939790979, 0.07507407970316933, 0.07025201601700026, 0.23110299751917124, 0.16800851760998772, 0.10665818771167872, -0.2712410357011081, -0.0896038730623178, 0.19634754203978072]
|
1,803.06319
|
Overcoming correlation fluctuations in two-photon interference
experiments with differently bright and independently blinking remote quantum
emitters
|
As a fundamental building block for quantum computation and communication
protocols, the correct verification of the two-photon interference (TPI)
contrast between two independent quantum light sources is of utmost importance.
Here, we experimentally demonstrate how frequently present blinking dynamics
and changes in emitter brightness critically affect the Hong-Ou-Mandel-type
(HOM) correlation histograms of remote TPI experiments measured via the
commonly utilized setup configuration. We further exploit this qualitative and
quantitative explanation of the observed correlation dynamics to establish an
alternative interferometer configuration, which is overcoming the discussed
temporal fluctuations, giving rise to an error-free determination of the remote
TPI visibility. We prove full knowledge of the obtained correlation by
reproducing the measured correlation statistics via Monte-Carlo simulations. As
exemplary system, we make use of two pairs of remote semiconductor quantum
dots, however, the same conclusions apply for TPI experiments with flying
qubits from any kind of remote solid state quantum emitters.
|
cond-mat.mes-hall quant-ph
|
as a fundamental building block for quantum computation and communication protocols the correct verification of the twophoton interference tpi contrast between two independent quantum light sources is of utmost importance here we experimentally demonstrate how frequently present blinking dynamics and changes in emitter brightness critically affect the hongoumandeltype hom correlation histograms of remote tpi experiments measured via the commonly utilized setup configuration we further exploit this qualitative and quantitative explanation of the observed correlation dynamics to establish an alternative interferometer configuration which is overcoming the discussed temporal fluctuations giving rise to an errorfree determination of the remote tpi visibility we prove full knowledge of the obtained correlation by reproducing the measured correlation statistics via montecarlo simulations as exemplary system we make use of two pairs of remote semiconductor quantum dots however the same conclusions apply for tpi experiments with flying qubits from any kind of remote solid state quantum emitters
|
[['as', 'a', 'fundamental', 'building', 'block', 'for', 'quantum', 'computation', 'and', 'communication', 'protocols', 'the', 'correct', 'verification', 'of', 'the', 'twophoton', 'interference', 'tpi', 'contrast', 'between', 'two', 'independent', 'quantum', 'light', 'sources', 'is', 'of', 'utmost', 'importance', 'here', 'we', 'experimentally', 'demonstrate', 'how', 'frequently', 'present', 'blinking', 'dynamics', 'and', 'changes', 'in', 'emitter', 'brightness', 'critically', 'affect', 'the', 'hongoumandeltype', 'hom', 'correlation', 'histograms', 'of', 'remote', 'tpi', 'experiments', 'measured', 'via', 'the', 'commonly', 'utilized', 'setup', 'configuration', 'we', 'further', 'exploit', 'this', 'qualitative', 'and', 'quantitative', 'explanation', 'of', 'the', 'observed', 'correlation', 'dynamics', 'to', 'establish', 'an', 'alternative', 'interferometer', 'configuration', 'which', 'is', 'overcoming', 'the', 'discussed', 'temporal', 'fluctuations', 'giving', 'rise', 'to', 'an', 'errorfree', 'determination', 'of', 'the', 'remote', 'tpi', 'visibility', 'we', 'prove', 'full', 'knowledge', 'of', 'the', 'obtained', 'correlation', 'by', 'reproducing', 'the', 'measured', 'correlation', 'statistics', 'via', 'montecarlo', 'simulations', 'as', 'exemplary', 'system', 'we', 'make', 'use', 'of', 'two', 'pairs', 'of', 'remote', 'semiconductor', 'quantum', 'dots', 'however', 'the', 'same', 'conclusions', 'apply', 'for', 'tpi', 'experiments', 'with', 'flying', 'qubits', 'from', 'any', 'kind', 'of', 'remote', 'solid', 'state', 'quantum', 'emitters']]
|
[-0.13658167889341713, 0.131617665233595, -0.07826454112306237, 0.0891003145223173, 0.013486483790911734, -0.17794857614673673, 0.05740609792682032, 0.4120570217818022, -0.23867988302061954, -0.32442783935616415, 0.03901540814200416, -0.2557299290411174, -0.15021854251623154, 0.2320255698480954, -0.01717595061888763, 0.09661967058976491, 0.08605765323154628, -0.01289469736473014, -0.04901180734780307, -0.1618023507312561, 0.264419417513224, 0.08765506114965925, 0.3418790451499323, 0.06104532915322731, 0.09709602293868859, 0.06565954191144556, -0.04263407832632462, -0.045223092827169846, -0.11614999776007608, 0.0883749055765899, 0.27316414636870223, 0.11099573864635506, 0.21231632273644208, -0.45348218381404876, -0.18544154677229624, 0.09711601152317599, 0.15497867112630048, 0.1289083905929389, -0.057738638781011105, -0.32543242638309794, -0.003709727292880416, -0.13976530349929817, -0.08939276894864936, -0.06663446557708085, -0.01417170321510639, 0.005511460434645414, -0.2385189105415096, 0.05334938360145316, 0.011919692408603926, 0.07007809625938535, 0.02325877690066894, -0.03432511857012287, 0.04965486743176977, 0.18352929242964214, -0.06297010822532077, -0.014669321146793663, 0.15663775518594775, -0.0923485366612052, -0.1964785417014112, 0.3375983469607309, -0.04074326218416294, -0.13231943373257915, 0.16928897060453893, -0.13713151656712094, -0.10634085718542337, 0.06473496080220988, 0.12524852374879022, 0.08356172963414187, -0.13332329300387452, -0.0094369834207464, 0.006316749059284726, 0.21577125223974386, 0.07182926397460203, 0.1522347139380872, 0.20890923173477252, 0.14271975252622118, 0.0170347327614824, 0.16470292031144101, -0.14159956804166238, -0.13069683724393447, -0.293632667241618, -0.1875576695924004, -0.22539071269954244, 0.05832185286407669, -0.06418316442179882, -0.13212056575148987, 0.3609054883134862, 0.19727886491843188, 0.17670041831831138, -0.0016634957344892124, 0.3421577130878965, 0.09058049911477914, 0.026015816846241553, -0.009598105701928338, 0.2675611998653039, 0.17645822837172698, 0.08009739264535408, -0.2680299569061026, 0.08937473385594785, -0.022511206593674917]
|
1,803.0632
|
Synchronisation of Partial Multi-Matchings via Non-negative
Factorisations
|
In this work we study permutation synchronisation for the challenging case of
partial permutations, which plays an important role for the problem of matching
multiple objects (e.g. images or shapes). The term synchronisation refers to
the property that the set of pairwise matchings is cycle-consistent, i.e. in
the full matching case all compositions of pairwise matchings over cycles must
be equal to the identity. Motivated by clustering and matrix factorisation
perspectives of cycle-consistency, we derive an algorithm to tackle the
permutation synchronisation problem based on non-negative factorisations. In
order to deal with the inherent non-convexity of the permutation
synchronisation problem, we use an initialisation procedure based on a novel
rotation scheme applied to the solution of the spectral relaxation. Moreover,
this rotation scheme facilitates a convenient Euclidean projection to obtain a
binary solution after solving our relaxed problem. In contrast to
state-of-the-art methods, our approach is guaranteed to produce
cycle-consistent results. We experimentally demonstrate the efficacy of our
method and show that it achieves better results compared to existing methods.
|
cs.CV math.OC stat.ML
|
in this work we study permutation synchronisation for the challenging case of partial permutations which plays an important role for the problem of matching multiple objects eg images or shapes the term synchronisation refers to the property that the set of pairwise matchings is cycleconsistent ie in the full matching case all compositions of pairwise matchings over cycles must be equal to the identity motivated by clustering and matrix factorisation perspectives of cycleconsistency we derive an algorithm to tackle the permutation synchronisation problem based on nonnegative factorisations in order to deal with the inherent nonconvexity of the permutation synchronisation problem we use an initialisation procedure based on a novel rotation scheme applied to the solution of the spectral relaxation moreover this rotation scheme facilitates a convenient euclidean projection to obtain a binary solution after solving our relaxed problem in contrast to stateoftheart methods our approach is guaranteed to produce cycleconsistent results we experimentally demonstrate the efficacy of our method and show that it achieves better results compared to existing methods
|
[['in', 'this', 'work', 'we', 'study', 'permutation', 'synchronisation', 'for', 'the', 'challenging', 'case', 'of', 'partial', 'permutations', 'which', 'plays', 'an', 'important', 'role', 'for', 'the', 'problem', 'of', 'matching', 'multiple', 'objects', 'eg', 'images', 'or', 'shapes', 'the', 'term', 'synchronisation', 'refers', 'to', 'the', 'property', 'that', 'the', 'set', 'of', 'pairwise', 'matchings', 'is', 'cycleconsistent', 'ie', 'in', 'the', 'full', 'matching', 'case', 'all', 'compositions', 'of', 'pairwise', 'matchings', 'over', 'cycles', 'must', 'be', 'equal', 'to', 'the', 'identity', 'motivated', 'by', 'clustering', 'and', 'matrix', 'factorisation', 'perspectives', 'of', 'cycleconsistency', 'we', 'derive', 'an', 'algorithm', 'to', 'tackle', 'the', 'permutation', 'synchronisation', 'problem', 'based', 'on', 'nonnegative', 'factorisations', 'in', 'order', 'to', 'deal', 'with', 'the', 'inherent', 'nonconvexity', 'of', 'the', 'permutation', 'synchronisation', 'problem', 'we', 'use', 'an', 'initialisation', 'procedure', 'based', 'on', 'a', 'novel', 'rotation', 'scheme', 'applied', 'to', 'the', 'solution', 'of', 'the', 'spectral', 'relaxation', 'moreover', 'this', 'rotation', 'scheme', 'facilitates', 'a', 'convenient', 'euclidean', 'projection', 'to', 'obtain', 'a', 'binary', 'solution', 'after', 'solving', 'our', 'relaxed', 'problem', 'in', 'contrast', 'to', 'stateoftheart', 'methods', 'our', 'approach', 'is', 'guaranteed', 'to', 'produce', 'cycleconsistent', 'results', 'we', 'experimentally', 'demonstrate', 'the', 'efficacy', 'of', 'our', 'method', 'and', 'show', 'that', 'it', 'achieves', 'better', 'results', 'compared', 'to', 'existing', 'methods']]
|
[-0.11175280078588164, -0.0022874425443553583, -0.08042575759977541, 0.060265291068593366, -0.0830625178429353, -0.11258408785797655, 0.03781704632565379, 0.39361217082752026, -0.3082684931304196, -0.3108128886176821, 0.09172624309875947, -0.2366911066476913, -0.18434251128997214, 0.16533191588652485, -0.13281387842246606, 0.08680497815640753, 0.1026050304665285, 0.02105779034523841, -0.0914442398092326, -0.2854897287729032, 0.32156828004620314, 0.023029407475362806, 0.3061429806601475, 0.021799716158934376, 0.13046738996225246, 0.029615921149139895, -0.026859932532534003, 0.025001977451200433, -0.0840179049071808, 0.13893103116904112, 0.2496574008179938, 0.18104122224647332, 0.2629118376028012, -0.4043819056933417, -0.1671509825164, 0.15411086996250292, 0.14606477645771948, 0.12569629156838774, -0.04461011158932439, -0.2583263926543569, 0.1308774902485311, -0.1580241728135768, -0.07527800575446557, -0.10398337204858442, -0.006990793045363663, -0.02814260411884307, -0.3376504866741872, 0.05282289426061599, 0.09398804114693228, 0.015218258929877158, -0.045695382238858766, -0.09477116528021938, 0.06895721379174467, 0.12209063362850643, 0.04689852541915196, 0.03219616066198796, 0.047228062319952774, -0.08731017803554149, -0.1617696611847564, 0.4097441840752521, -0.022899260035688606, -0.23279265783836736, 0.16276818797649706, -0.053404842848506044, -0.15488090980798006, 0.11437660797553904, 0.17086565190487923, 0.18403239377144287, -0.1189837937914383, 0.04066815129755175, -0.07325029738233699, 0.167564950488946, 0.07310645201736514, 0.008677697003654698, 0.14852361629634878, 0.179641019432422, 0.13304087454453112, 0.16815078782520312, -0.05717714280985734, -0.08929606454501696, -0.2165316956805969, -0.10877114918137736, -0.17401729201665148, -0.009821344532675165, -0.11490100558833494, -0.16515567166224013, 0.3995919400430199, 0.19938349049833265, 0.20683347164132795, 0.10115456078817849, 0.31755998919115347, 0.0882708014058367, 0.04811909162603757, 0.04661447740680374, 0.16625185862649233, 0.13039996070266865, 0.041446846787584944, -0.25209289224106163, 0.06248859087251784, 0.12548569264438222]
|
1,803.06321
|
A particle-based variational approach to Bayesian Non-negative Matrix
Factorization
|
Bayesian Non-negative Matrix Factorization (NMF) is a promising approach for
understanding uncertainty and structure in matrix data. However, a large volume
of applied work optimizes traditional non-Bayesian NMF objectives that fail to
provide a principled understanding of the non-identifiability inherent in NMF--
an issue ideally addressed by a Bayesian approach. Despite their suitability,
current Bayesian NMF approaches have failed to gain popularity in an applied
setting; they sacrifice flexibility in modeling for tractable computation, tend
to get stuck in local modes, and require many thousands of samples for
meaningful uncertainty estimates. We address these issues through a
particle-based variational approach to Bayesian NMF that only requires the
joint likelihood to be differentiable for tractability, uses a novel
initialization technique to identify multiple modes in the posterior, and
allows domain experts to inspect a `small' set of factorizations that
faithfully represent the posterior. We introduce and employ a class of
likelihood and prior distributions for NMF that formulate a Bayesian model
using popular non-Bayesian NMF objectives. On several real datasets, we obtain
better particle approximations to the Bayesian NMF posterior in less time than
baselines and demonstrate the significant role that multimodality plays in
NMF-related tasks.
|
stat.ML
|
bayesian nonnegative matrix factorization nmf is a promising approach for understanding uncertainty and structure in matrix data however a large volume of applied work optimizes traditional nonbayesian nmf objectives that fail to provide a principled understanding of the nonidentifiability inherent in nmf an issue ideally addressed by a bayesian approach despite their suitability current bayesian nmf approaches have failed to gain popularity in an applied setting they sacrifice flexibility in modeling for tractable computation tend to get stuck in local modes and require many thousands of samples for meaningful uncertainty estimates we address these issues through a particlebased variational approach to bayesian nmf that only requires the joint likelihood to be differentiable for tractability uses a novel initialization technique to identify multiple modes in the posterior and allows domain experts to inspect a small set of factorizations that faithfully represent the posterior we introduce and employ a class of likelihood and prior distributions for nmf that formulate a bayesian model using popular nonbayesian nmf objectives on several real datasets we obtain better particle approximations to the bayesian nmf posterior in less time than baselines and demonstrate the significant role that multimodality plays in nmfrelated tasks
|
[['bayesian', 'nonnegative', 'matrix', 'factorization', 'nmf', 'is', 'a', 'promising', 'approach', 'for', 'understanding', 'uncertainty', 'and', 'structure', 'in', 'matrix', 'data', 'however', 'a', 'large', 'volume', 'of', 'applied', 'work', 'optimizes', 'traditional', 'nonbayesian', 'nmf', 'objectives', 'that', 'fail', 'to', 'provide', 'a', 'principled', 'understanding', 'of', 'the', 'nonidentifiability', 'inherent', 'in', 'nmf', 'an', 'issue', 'ideally', 'addressed', 'by', 'a', 'bayesian', 'approach', 'despite', 'their', 'suitability', 'current', 'bayesian', 'nmf', 'approaches', 'have', 'failed', 'to', 'gain', 'popularity', 'in', 'an', 'applied', 'setting', 'they', 'sacrifice', 'flexibility', 'in', 'modeling', 'for', 'tractable', 'computation', 'tend', 'to', 'get', 'stuck', 'in', 'local', 'modes', 'and', 'require', 'many', 'thousands', 'of', 'samples', 'for', 'meaningful', 'uncertainty', 'estimates', 'we', 'address', 'these', 'issues', 'through', 'a', 'particlebased', 'variational', 'approach', 'to', 'bayesian', 'nmf', 'that', 'only', 'requires', 'the', 'joint', 'likelihood', 'to', 'be', 'differentiable', 'for', 'tractability', 'uses', 'a', 'novel', 'initialization', 'technique', 'to', 'identify', 'multiple', 'modes', 'in', 'the', 'posterior', 'and', 'allows', 'domain', 'experts', 'to', 'inspect', 'a', 'small', 'set', 'of', 'factorizations', 'that', 'faithfully', 'represent', 'the', 'posterior', 'we', 'introduce', 'and', 'employ', 'a', 'class', 'of', 'likelihood', 'and', 'prior', 'distributions', 'for', 'nmf', 'that', 'formulate', 'a', 'bayesian', 'model', 'using', 'popular', 'nonbayesian', 'nmf', 'objectives', 'on', 'several', 'real', 'datasets', 'we', 'obtain', 'better', 'particle', 'approximations', 'to', 'the', 'bayesian', 'nmf', 'posterior', 'in', 'less', 'time', 'than', 'baselines', 'and', 'demonstrate', 'the', 'significant', 'role', 'that', 'multimodality', 'plays', 'in', 'nmfrelated', 'tasks']]
|
[-0.006577730849871326, -0.052707682568765936, -0.12667619416096546, 0.13955175071701495, -0.15308134731135725, -0.17678114728157207, 0.05279333777869716, 0.45004479685010984, -0.2852986159196757, -0.3375243806212987, 0.08923053132134884, -0.21838886008338976, -0.1407979993754518, 0.125810964932526, -0.12114267617439463, 0.1393048558696221, 0.13115029803059572, -0.024853199483801554, -0.09990237914109795, -0.23483916137549912, 0.2824263807923831, 0.04582270227862311, 0.32438523816808906, -0.002204126342362964, 0.12493504599917718, 0.03341990770032802, -0.0394060306896734, 0.019598281807890257, -0.08525600284311743, 0.15546809676818588, 0.3461324136965841, 0.2518228060414669, 0.40398332381083335, -0.4325539344086398, -0.23796444468574657, 0.15481130166258902, 0.16172096459315033, 0.0838518797357107, -0.019527162482827595, -0.2637217888253328, 0.08353101493809949, -0.1867179759494845, -0.040146685847484494, -0.20359640990230302, -0.045895130018290785, -0.04089644080455194, -0.34134254948213244, 0.10308213116356277, 0.04193602405373276, -8.098378335845839e-05, -0.0045460021203100566, -0.19435559427989743, 0.09307993019597374, 0.10652678628144882, 0.07228540844276797, 0.002474894132657149, 0.1082123867116062, -0.14165786007832082, -0.1352688716184444, 0.3391483525035077, -0.02527729579952327, -0.26344661398421126, 0.1787021983890151, -0.036173658006219675, -0.19622307402662664, 0.13131551451971465, 0.22415455020292058, 0.12461676689575321, -0.17483375782714725, 0.04144482070054456, -0.015311905484737771, 0.1715204044228381, -0.001993497696791574, -0.00620905442139195, 0.1742670634550225, 0.2223842918522387, 0.09963560588363818, 0.09920838742532537, -0.08986739295213148, -0.10187016586657882, -0.18796423585280134, -0.11631246308343648, -0.2184637219059406, -0.006342580249729883, -0.13372657407683047, -0.18992698499716856, 0.3885104191182277, 0.25086309599147666, 0.2170529801172886, 0.12166822476062886, 0.3418087785410666, 0.04564187393624866, 0.06300575381802567, 0.07666660322730919, 0.1961724575838199, 0.12916797939351923, 0.08433892419945795, -0.13538168283952304, 0.11638503548924417, 0.006352672473402675]
|
1,803.06322
|
Computing performability measures in Markov chains by means of matrix
functions
|
We discuss the efficient computation of performance, reliability, and
availability measures for Markov chains; these metrics, and the ones obtained
by combining them, are often called performability measures. We show that this
computational problem can be recasted as the evaluation of a bilinear forms
induced by appropriate matrix functions, and thus solved by leveraging the fast
methods available for this task. We provide a comprehensive analysis of the
theory required to translate the problem from the language of Markov chains to
the one of matrix functions. The advantages of this new formulation are
discussed, and it is shown that this setting allows to easily study the
sensitivities of the measures with respect to the model parameters. Numerical
experiments confirm the effectiveness of our approach; the tests we have run
show that we can outperform the solvers available in state of the art
commercial packages on a representative set of large scale examples.
|
math.NA cs.NA
|
we discuss the efficient computation of performance reliability and availability measures for markov chains these metrics and the ones obtained by combining them are often called performability measures we show that this computational problem can be recasted as the evaluation of a bilinear forms induced by appropriate matrix functions and thus solved by leveraging the fast methods available for this task we provide a comprehensive analysis of the theory required to translate the problem from the language of markov chains to the one of matrix functions the advantages of this new formulation are discussed and it is shown that this setting allows to easily study the sensitivities of the measures with respect to the model parameters numerical experiments confirm the effectiveness of our approach the tests we have run show that we can outperform the solvers available in state of the art commercial packages on a representative set of large scale examples
|
[['we', 'discuss', 'the', 'efficient', 'computation', 'of', 'performance', 'reliability', 'and', 'availability', 'measures', 'for', 'markov', 'chains', 'these', 'metrics', 'and', 'the', 'ones', 'obtained', 'by', 'combining', 'them', 'are', 'often', 'called', 'performability', 'measures', 'we', 'show', 'that', 'this', 'computational', 'problem', 'can', 'be', 'recasted', 'as', 'the', 'evaluation', 'of', 'a', 'bilinear', 'forms', 'induced', 'by', 'appropriate', 'matrix', 'functions', 'and', 'thus', 'solved', 'by', 'leveraging', 'the', 'fast', 'methods', 'available', 'for', 'this', 'task', 'we', 'provide', 'a', 'comprehensive', 'analysis', 'of', 'the', 'theory', 'required', 'to', 'translate', 'the', 'problem', 'from', 'the', 'language', 'of', 'markov', 'chains', 'to', 'the', 'one', 'of', 'matrix', 'functions', 'the', 'advantages', 'of', 'this', 'new', 'formulation', 'are', 'discussed', 'and', 'it', 'is', 'shown', 'that', 'this', 'setting', 'allows', 'to', 'easily', 'study', 'the', 'sensitivities', 'of', 'the', 'measures', 'with', 'respect', 'to', 'the', 'model', 'parameters', 'numerical', 'experiments', 'confirm', 'the', 'effectiveness', 'of', 'our', 'approach', 'the', 'tests', 'we', 'have', 'run', 'show', 'that', 'we', 'can', 'outperform', 'the', 'solvers', 'available', 'in', 'state', 'of', 'the', 'art', 'commercial', 'packages', 'on', 'a', 'representative', 'set', 'of', 'large', 'scale', 'examples']]
|
[-0.07652060963492228, 0.03534220353781405, -0.06198211619630456, 0.07488230365944266, -0.05761792300587618, -0.1035702429500433, 0.04615265866902375, 0.39635831123757126, -0.27826185136004106, -0.3010294444412514, 0.15190570703922085, -0.2694701630099237, -0.15511058372641473, 0.2563571325353175, -0.04224551314052262, 0.08985775473870729, 0.13213942783247484, 0.010761261776918362, -0.10723499230133664, -0.26273336309915113, 0.3111259648790828, 0.05633220556927355, 0.29840676985239906, 0.061415846989563615, 0.10660447054511965, -0.030762340159670106, -0.051717073037779254, 0.04289711414879237, -0.12260191903006719, 0.17983141430733285, 0.26051070797257125, 0.2043036123749947, 0.27731996730558184, -0.4193892602833282, -0.1994232301918888, 0.09135231267703746, 0.09795313875043862, 0.10760496751295011, -0.01903466187726927, -0.30533064294630957, 0.10848788996410899, -0.182024174150827, -0.08790754262468238, -0.14833889736818442, -0.056267260953685956, 0.0416916268249655, -0.2810772755972146, 0.02043228470383359, 0.029738032239133884, 0.024165380157922443, -0.02733941143876444, -0.13776493934289502, 0.04104383482818345, 0.12146330582235303, 0.06332921063126139, -0.015701601788781484, 0.09905122882245403, -0.10715944430098477, -0.156571924943771, 0.36303475033798205, -0.07561478106263646, -0.2578867643851003, 0.20757335465474935, -0.07272271585258606, -0.147529402407695, 0.0837027394997054, 0.17160343174136392, 0.1303512424500169, -0.14750172790924185, 0.09288922502922728, -0.043372931439080276, 0.16243391123747355, -0.010842606102079643, 0.010796465570915882, 0.14010361919874986, 0.17898851119006345, 0.04989914946398992, 0.18219892414038585, -0.03227977423433147, -0.10060404286578935, -0.2737850889036628, -0.16030019375275037, -0.18391213985159993, -0.02014557691693067, -0.08634635420649399, -0.13835979357195596, 0.4075726644062486, 0.212611936305429, 0.16300868379001163, 0.09760262542342964, 0.3108106199284329, 0.1216950747085847, 0.08079558947141968, 0.06863710768543808, 0.19270290810259452, 0.08609478908903456, 0.06244144304104051, -0.20327306850843965, 0.07447565624055355, 0.051598665172174436]
|
1,803.06323
|
Minimal space with non-minimal square
|
We completely solve the problem whether the product of two compact metric
spaces admitting minimal maps also admits a minimal map. Recently Boro\'nski,
Clark and Oprocha gave a negative answer in the particular case when
homeomorphisms rather than continuous maps are considered. In the present paper
we show that there is a metric continuum $X$ admitting a minimal map, in fact a
minimal homeomorphism, such that $X\times X$ does not admit any minimal map.
|
math.DS
|
we completely solve the problem whether the product of two compact metric spaces admitting minimal maps also admits a minimal map recently boronski clark and oprocha gave a negative answer in the particular case when homeomorphisms rather than continuous maps are considered in the present paper we show that there is a metric continuum x admitting a minimal map in fact a minimal homeomorphism such that xtimes x does not admit any minimal map
|
[['we', 'completely', 'solve', 'the', 'problem', 'whether', 'the', 'product', 'of', 'two', 'compact', 'metric', 'spaces', 'admitting', 'minimal', 'maps', 'also', 'admits', 'a', 'minimal', 'map', 'recently', 'boronski', 'clark', 'and', 'oprocha', 'gave', 'a', 'negative', 'answer', 'in', 'the', 'particular', 'case', 'when', 'homeomorphisms', 'rather', 'than', 'continuous', 'maps', 'are', 'considered', 'in', 'the', 'present', 'paper', 'we', 'show', 'that', 'there', 'is', 'a', 'metric', 'continuum', 'x', 'admitting', 'a', 'minimal', 'map', 'in', 'fact', 'a', 'minimal', 'homeomorphism', 'such', 'that', 'xtimes', 'x', 'does', 'not', 'admit', 'any', 'minimal', 'map']]
|
[-0.15162839417741314, 0.07272424313482152, -0.05262301483969778, 0.10300634082642779, -0.09544126260770511, -0.17936923048037984, 0.017400148348589363, 0.3898700037397036, -0.2649540533247876, -0.18284599329919032, 0.12502948719966672, -0.30402435464401767, -0.21124460948758747, 0.17760888053333923, -0.16868409604369983, 0.0018703562705075904, 0.06534583895939262, 0.06805180314264886, -0.14066764588582598, -0.23082139835795004, 0.423369398777539, -0.050746150863395165, 0.2015836262080359, 0.081676077939672, 0.22664258491936817, -0.04780324161920237, -0.024989040026262607, 0.06015891787653457, -0.1704544026326079, 0.06534903854839759, 0.2510706627971097, 0.1486029028318414, 0.21035051009018127, -0.3470427607479569, -0.22115226183724526, 0.2979610081640876, 0.09018585597458359, 0.0030883091106398467, -0.059218913929103174, -0.20590039916425842, 0.09384868265295478, -0.11096882617917575, -0.0978574864821483, -0.09000715271454968, 0.07012186439274108, -0.07808643301362045, -0.25109129373545513, -0.01611433479630337, 0.17355024905824293, 0.0719540473073721, -0.05935006929969747, 0.0018995761463086898, -0.07382266583839713, 0.09782431596030532, -0.04244801753521979, 0.1621945076303123, 0.06085235802839472, -0.03529304680605865, -0.1131640831455078, 0.3900757980060904, -0.12784026564861972, -0.34148009376574867, 0.16399517534173105, -0.1701274575754898, -0.1892441856572787, 0.12030606349923788, 0.05631566126767087, 0.1581794528116405, -0.09820560911731724, 0.22519691435744577, -0.18743953090926554, 0.16189599539191551, 0.08868870216306962, -0.020070237719951426, 0.13506176163863443, 0.07908311192813801, 0.18950681471304126, 0.1492823832413207, 0.03402830167890412, -0.02231482791711181, -0.32378342882921435, -0.15586592085429862, -0.08961918614549588, 0.14215334802439392, -0.09205016967731254, -0.22418375550577901, 0.36725777351897054, 0.04643566475516147, 0.21812251332688004, 0.1160373365736171, 0.2167826235702593, 0.061939956757482394, 0.006687532342517468, 0.12638037042590242, 0.16045025200901986, 0.10022231996416638, -0.027523586220324855, -0.08483391457990017, 0.013778665326280545, 0.150574366192091]
|
1,803.06324
|
Fast approximation and exact computation of negative curvature
parameters of graphs
|
In this paper, we study Gromov hyperbolicity and related parameters, that
represent how close (locally) a metric space is to a tree from a metric point
of view. The study of Gromov hyperbolicity for geodesic metric spaces can be
reduced to the study of graph hyperbolicity. The main contribution of this
paper is a new characterization of the hyperbolicity of graphs. This
characterization has algorithmic implications in the field of large-scale
network analysis. A sharp estimate of graph hyperbolicity is useful, e.g., in
embedding an undirected graph into hyperbolic space with minimum distortion
[Verbeek and Suri, SoCG'14]. The hyperbolicity of a graph can be computed in
polynomial-time, however it is unlikely that it can be done in subcubic time.
This makes this parameter difficult to compute or to approximate on large
graphs. Using our new characterization of graph hyperbolicity, we provide a
simple factor 8 approximation algorithm for computing the hyperbolicity of an
$n$-vertex graph $G=(V,E)$ in optimal time $O(n^2)$ (assuming that the input is
the distance matrix of the graph). This algorithm leads to constant factor
approximations of other graph-parameters related to hyperbolicity (thinness,
slimness, and insize). We also present the first efficient algorithms for exact
computation of these parameters. All of our algorithms can be used to
approximate the hyperbolicity of a geodesic metric space.
We also show that a similar characterization of hyperbolicity holds for all
geodesic metric spaces endowed with a geodesic spanning tree. Along the way, we
prove that any complete geodesic metric space $(X,d)$ has such a geodesic
spanning tree. We hope that this fundamental result can be useful in other
contexts.
|
cs.DS cs.CG cs.DM math.CO
|
in this paper we study gromov hyperbolicity and related parameters that represent how close locally a metric space is to a tree from a metric point of view the study of gromov hyperbolicity for geodesic metric spaces can be reduced to the study of graph hyperbolicity the main contribution of this paper is a new characterization of the hyperbolicity of graphs this characterization has algorithmic implications in the field of largescale network analysis a sharp estimate of graph hyperbolicity is useful eg in embedding an undirected graph into hyperbolic space with minimum distortion verbeek and suri socg14 the hyperbolicity of a graph can be computed in polynomialtime however it is unlikely that it can be done in subcubic time this makes this parameter difficult to compute or to approximate on large graphs using our new characterization of graph hyperbolicity we provide a simple factor 8 approximation algorithm for computing the hyperbolicity of an nvertex graph gve in optimal time on2 assuming that the input is the distance matrix of the graph this algorithm leads to constant factor approximations of other graphparameters related to hyperbolicity thinness slimness and insize we also present the first efficient algorithms for exact computation of these parameters all of our algorithms can be used to approximate the hyperbolicity of a geodesic metric space we also show that a similar characterization of hyperbolicity holds for all geodesic metric spaces endowed with a geodesic spanning tree along the way we prove that any complete geodesic metric space xd has such a geodesic spanning tree we hope that this fundamental result can be useful in other contexts
|
[['in', 'this', 'paper', 'we', 'study', 'gromov', 'hyperbolicity', 'and', 'related', 'parameters', 'that', 'represent', 'how', 'close', 'locally', 'a', 'metric', 'space', 'is', 'to', 'a', 'tree', 'from', 'a', 'metric', 'point', 'of', 'view', 'the', 'study', 'of', 'gromov', 'hyperbolicity', 'for', 'geodesic', 'metric', 'spaces', 'can', 'be', 'reduced', 'to', 'the', 'study', 'of', 'graph', 'hyperbolicity', 'the', 'main', 'contribution', 'of', 'this', 'paper', 'is', 'a', 'new', 'characterization', 'of', 'the', 'hyperbolicity', 'of', 'graphs', 'this', 'characterization', 'has', 'algorithmic', 'implications', 'in', 'the', 'field', 'of', 'largescale', 'network', 'analysis', 'a', 'sharp', 'estimate', 'of', 'graph', 'hyperbolicity', 'is', 'useful', 'eg', 'in', 'embedding', 'an', 'undirected', 'graph', 'into', 'hyperbolic', 'space', 'with', 'minimum', 'distortion', 'verbeek', 'and', 'suri', 'socg14', 'the', 'hyperbolicity', 'of', 'a', 'graph', 'can', 'be', 'computed', 'in', 'polynomialtime', 'however', 'it', 'is', 'unlikely', 'that', 'it', 'can', 'be', 'done', 'in', 'subcubic', 'time', 'this', 'makes', 'this', 'parameter', 'difficult', 'to', 'compute', 'or', 'to', 'approximate', 'on', 'large', 'graphs', 'using', 'our', 'new', 'characterization', 'of', 'graph', 'hyperbolicity', 'we', 'provide', 'a', 'simple', 'factor', '8', 'approximation', 'algorithm', 'for', 'computing', 'the', 'hyperbolicity', 'of', 'an', 'nvertex', 'graph', 'gve', 'in', 'optimal', 'time', 'on2', 'assuming', 'that', 'the', 'input', 'is', 'the', 'distance', 'matrix', 'of', 'the', 'graph', 'this', 'algorithm', 'leads', 'to', 'constant', 'factor', 'approximations', 'of', 'other', 'graphparameters', 'related', 'to', 'hyperbolicity', 'thinness', 'slimness', 'and', 'insize', 'we', 'also', 'present', 'the', 'first', 'efficient', 'algorithms', 'for', 'exact', 'computation', 'of', 'these', 'parameters', 'all', 'of', 'our', 'algorithms', 'can', 'be', 'used', 'to', 'approximate', 'the', 'hyperbolicity', 'of', 'a', 'geodesic', 'metric', 'space', 'we', 'also', 'show', 'that', 'a', 'similar', 'characterization', 'of', 'hyperbolicity', 'holds', 'for', 'all', 'geodesic', 'metric', 'spaces', 'endowed', 'with', 'a', 'geodesic', 'spanning', 'tree', 'along', 'the', 'way', 'we', 'prove', 'that', 'any', 'complete', 'geodesic', 'metric', 'space', 'xd', 'has', 'such', 'a', 'geodesic', 'spanning', 'tree', 'we', 'hope', 'that', 'this', 'fundamental', 'result', 'can', 'be', 'useful', 'in', 'other', 'contexts']]
|
[-0.16030756410680513, 0.07186733044352767, -0.12038735050009564, 0.10686298710943172, -0.1436634597573147, -0.08929745836190484, 0.046533096148226774, 0.39496245760043774, -0.3060004017809688, -0.2879367481924198, 0.10905929087091477, -0.23759153209142492, -0.19353964788134556, 0.1805667688648541, -0.1322105483778807, 0.06002834436455459, 0.114788406293938, 0.0695688224171163, -0.05887950242807468, -0.24383983334072665, 0.3667910623198347, 0.01224131529372905, 0.20712812378593354, 0.09483574356030051, 0.09213143445914752, 0.001986438943828089, -0.009142426918542973, 0.10391887475535358, -0.19074484644272272, 0.1281214559498811, 0.26501126577954204, 0.1817041773209701, 0.23041646662573895, -0.35855936522200477, -0.19976963697241223, 0.20313545911609032, 0.1354328952846007, 0.08921843457430827, -0.018202042106140376, -0.2578752925972257, 0.12950895061173165, -0.09341157392852685, -0.13731956143623614, -0.08067433307543538, 0.03365307418800623, -0.024378446839612232, -0.2366852916470221, 1.2821624378292737e-05, 0.1101306507396547, 0.011103115217834287, -0.004495437588599144, -0.04792946246611378, 0.006327214933028727, 0.12460219745601837, -0.014102177940499545, 0.10577652290962622, 0.05191963252957177, -0.05337241222503397, -0.12873442138979127, 0.4148876542105537, -0.07277585283648505, -0.21135018555320462, 0.12828673324618262, -0.1187151015690302, -0.17765422652221538, 0.12581485378993393, 0.2085587707159434, 0.1562523212130393, -0.13800725702083472, 0.13274503489502062, -0.08845195395759109, 0.0939890615952732, 0.09166749673683873, 0.014764846207320013, 0.09521389924074439, 0.16608752802042573, 0.1872310337511766, 0.16541260701364302, 0.009759887836866475, -0.03701926353096496, -0.28525281501722266, -0.1888434619119807, -0.2041061931804782, 0.08588871402025688, -0.22589520252624812, -0.22284639536784115, 0.4037123233526169, 0.1325814547738198, 0.18903279671477238, 0.12302486730781807, 0.27793776666107023, 0.07575825386095059, 0.012193321676353331, 0.16826334059640596, 0.2048930930340606, 0.14877465020187877, 0.009890202661291838, -0.1385883911046249, 0.082372108592553, 0.1471418981285145]
|
1,803.06325
|
Lie algebras and $v_n$-periodic spaces
|
We consider a homotopy theory obtained from that of pointed spaces by
inverting the maps inducing isomorphisms in $v_n$-periodic homotopy groups. The
case n = 0 corresponds to rational homotopy theory. In analogy with Quillen's
results in the rational case, we prove that this $v_n$-periodic homotopy theory
is equivalent to the homotopy theory of Lie algebras in T(n)-local spectra. We
also compare it to the homotopy theory of commutative coalgebras in T(n)-local
spectra, where it turns out there is only an equivalence up to a certain
convergence issue of the Goodwillie tower of the identity.
|
math.AT
|
we consider a homotopy theory obtained from that of pointed spaces by inverting the maps inducing isomorphisms in v_nperiodic homotopy groups the case n 0 corresponds to rational homotopy theory in analogy with quillens results in the rational case we prove that this v_nperiodic homotopy theory is equivalent to the homotopy theory of lie algebras in tnlocal spectra we also compare it to the homotopy theory of commutative coalgebras in tnlocal spectra where it turns out there is only an equivalence up to a certain convergence issue of the goodwillie tower of the identity
|
[['we', 'consider', 'a', 'homotopy', 'theory', 'obtained', 'from', 'that', 'of', 'pointed', 'spaces', 'by', 'inverting', 'the', 'maps', 'inducing', 'isomorphisms', 'in', 'v_nperiodic', 'homotopy', 'groups', 'the', 'case', 'n', '0', 'corresponds', 'to', 'rational', 'homotopy', 'theory', 'in', 'analogy', 'with', 'quillens', 'results', 'in', 'the', 'rational', 'case', 'we', 'prove', 'that', 'this', 'v_nperiodic', 'homotopy', 'theory', 'is', 'equivalent', 'to', 'the', 'homotopy', 'theory', 'of', 'lie', 'algebras', 'in', 'tnlocal', 'spectra', 'we', 'also', 'compare', 'it', 'to', 'the', 'homotopy', 'theory', 'of', 'commutative', 'coalgebras', 'in', 'tnlocal', 'spectra', 'where', 'it', 'turns', 'out', 'there', 'is', 'only', 'an', 'equivalence', 'up', 'to', 'a', 'certain', 'convergence', 'issue', 'of', 'the', 'goodwillie', 'tower', 'of', 'the', 'identity']]
|
[-0.14428897112350356, 0.06070435250396568, -0.12430072790061301, 0.12952336707236642, -0.04426247673604558, -0.1474645563619251, 0.01333514358130026, 0.35387192375244614, -0.3874528937121021, -0.19017541740941715, 0.05358786803070813, -0.2471777279365887, -0.17569137988314826, 0.1520799470426356, -0.16574415569986276, -0.07561389419270005, 0.01812086820087217, 0.11078564123191098, -0.08601784645183448, -0.261764576469122, 0.41566304623228595, -0.0090233048478617, 0.2088954840455312, 0.010270627473104508, 0.09786533400852312, -0.02055651864948425, -0.021074846347278738, 0.02300026491680678, -0.16116701859681734, 0.12457621702924371, 0.3652293431731139, 0.04836636826029404, 0.2303273628634262, -0.33841617714534417, -0.08636618028097648, 0.16659266203939121, 0.1420874423050183, 0.02933889324281444, -0.0007505759007317271, -0.2745678425380128, 0.14489886834672552, -0.1898794853564431, -0.12489218361418139, -0.09049309030710224, 0.030997596869364062, -0.0052576085671465446, -0.20939119143332255, -0.05877113831012777, 0.07702690781034688, 0.12707555530830583, -0.11472486680809488, -0.002950982304606983, -0.07625507436534192, 0.10842212735417675, 0.03963422762264716, 0.022629623256742636, 0.08748663264881582, -0.07169116057822124, -0.133365044484232, 0.39271542053431907, -0.06272139734628195, -0.18016755057033151, 0.12174783307660193, -0.16778418644172874, -0.23982659054107647, 0.16047400356012773, -0.051683679332045165, 0.19014867355531834, -0.009301233618084262, 0.24193061108482963, -0.1146121466646288, 0.10209495416332155, 0.11268908210455421, -0.046384245388834004, 0.10087119100833351, 0.07773800263617267, 0.08540021318030801, 0.15143570168429313, 0.04552389901785299, -0.1169693693933523, -0.3382881921815111, -0.1593249200228998, -0.05250833673957497, 0.16939397804201284, -0.10175342651757788, -0.17853404737840545, 0.3485208512581092, 0.1566102059776003, 0.14527580260913422, 0.1739463635839205, 0.2101409368197176, 0.07639059221292747, 0.051440134386908504, -0.029903206455972085, 0.21610674610797395, 0.2997698862962623, 0.020566110315910997, -0.08885542528475932, -0.11967062334371532, 0.27572534125337894]
|
1,803.06326
|
Unified Phase Diagram of Antiferromagnetic SU(N) Spin Ladders
|
Motivated by near-term experiments with ultracold alkaline-earth atoms
confined to optical lattices, we establish numerically and analytically the
phase diagram of two-leg SU($N$) spin ladders. Two-leg ladders provide a rich
and highly non-trivial extension of the single chain case on the way towards
the relatively little explored two dimensional situation. Focusing on the
experimentally relevant limit of one fermion per site, antiferromagnetic
exchange interactions, and $2\leq N \leq 6$, we show that the phase diagrams as
a function of the interchain (rung) to intrachain (leg) coupling ratio
$J_\perp/J_\Vert$ strongly differ for even vs. odd $N$. For even $N=4$ and 6,
we demonstrate that the phase diagram consists of a single valence bond crystal
(VBC) with a spatial period of $N/2$ rungs. For odd $N=3$ and 5, we find
surprisingly rich phase diagrams exhibiting three distinct phases. For weak
rung coupling, we obtain a VBC with a spatial period of $N$ rungs, whereas for
strong coupling we obtain a critical phase related to the case of a single
chain. In addition, we encounter intermediate phases for odd $N$, albeit of a
different nature for $N=3$ as compared to $N=5$. For $N=3$, we find a novel
gapless intermediate phase with $J_\perp$-dependent incommensurate spatial
fluctuations in a sizeable region of the phase diagram. For $N=5$, there are
strong indications for a narrow potentially gapped intermediate phase, whose
nature is not entirely clear.
|
cond-mat.str-el
|
motivated by nearterm experiments with ultracold alkalineearth atoms confined to optical lattices we establish numerically and analytically the phase diagram of twoleg sun spin ladders twoleg ladders provide a rich and highly nontrivial extension of the single chain case on the way towards the relatively little explored two dimensional situation focusing on the experimentally relevant limit of one fermion per site antiferromagnetic exchange interactions and 2leq n leq 6 we show that the phase diagrams as a function of the interchain rung to intrachain leg coupling ratio j_perpj_vert strongly differ for even vs odd n for even n4 and 6 we demonstrate that the phase diagram consists of a single valence bond crystal vbc with a spatial period of n2 rungs for odd n3 and 5 we find surprisingly rich phase diagrams exhibiting three distinct phases for weak rung coupling we obtain a vbc with a spatial period of n rungs whereas for strong coupling we obtain a critical phase related to the case of a single chain in addition we encounter intermediate phases for odd n albeit of a different nature for n3 as compared to n5 for n3 we find a novel gapless intermediate phase with j_perpdependent incommensurate spatial fluctuations in a sizeable region of the phase diagram for n5 there are strong indications for a narrow potentially gapped intermediate phase whose nature is not entirely clear
|
[['motivated', 'by', 'nearterm', 'experiments', 'with', 'ultracold', 'alkalineearth', 'atoms', 'confined', 'to', 'optical', 'lattices', 'we', 'establish', 'numerically', 'and', 'analytically', 'the', 'phase', 'diagram', 'of', 'twoleg', 'sun', 'spin', 'ladders', 'twoleg', 'ladders', 'provide', 'a', 'rich', 'and', 'highly', 'nontrivial', 'extension', 'of', 'the', 'single', 'chain', 'case', 'on', 'the', 'way', 'towards', 'the', 'relatively', 'little', 'explored', 'two', 'dimensional', 'situation', 'focusing', 'on', 'the', 'experimentally', 'relevant', 'limit', 'of', 'one', 'fermion', 'per', 'site', 'antiferromagnetic', 'exchange', 'interactions', 'and', '2leq', 'n', 'leq', '6', 'we', 'show', 'that', 'the', 'phase', 'diagrams', 'as', 'a', 'function', 'of', 'the', 'interchain', 'rung', 'to', 'intrachain', 'leg', 'coupling', 'ratio', 'j_perpj_vert', 'strongly', 'differ', 'for', 'even', 'vs', 'odd', 'n', 'for', 'even', 'n4', 'and', '6', 'we', 'demonstrate', 'that', 'the', 'phase', 'diagram', 'consists', 'of', 'a', 'single', 'valence', 'bond', 'crystal', 'vbc', 'with', 'a', 'spatial', 'period', 'of', 'n2', 'rungs', 'for', 'odd', 'n3', 'and', '5', 'we', 'find', 'surprisingly', 'rich', 'phase', 'diagrams', 'exhibiting', 'three', 'distinct', 'phases', 'for', 'weak', 'rung', 'coupling', 'we', 'obtain', 'a', 'vbc', 'with', 'a', 'spatial', 'period', 'of', 'n', 'rungs', 'whereas', 'for', 'strong', 'coupling', 'we', 'obtain', 'a', 'critical', 'phase', 'related', 'to', 'the', 'case', 'of', 'a', 'single', 'chain', 'in', 'addition', 'we', 'encounter', 'intermediate', 'phases', 'for', 'odd', 'n', 'albeit', 'of', 'a', 'different', 'nature', 'for', 'n3', 'as', 'compared', 'to', 'n5', 'for', 'n3', 'we', 'find', 'a', 'novel', 'gapless', 'intermediate', 'phase', 'with', 'j_perpdependent', 'incommensurate', 'spatial', 'fluctuations', 'in', 'a', 'sizeable', 'region', 'of', 'the', 'phase', 'diagram', 'for', 'n5', 'there', 'are', 'strong', 'indications', 'for', 'a', 'narrow', 'potentially', 'gapped', 'intermediate', 'phase', 'whose', 'nature', 'is', 'not', 'entirely', 'clear']]
|
[-0.23346796409239262, 0.26124654010159787, 0.0017373966655590354, 0.07787930041742368, -0.0053702301349868335, -0.23145073716680514, 0.11183484970122198, 0.41070447689422823, -0.1870713178733813, -0.2874642606242047, 0.047376472750137094, -0.29998272195579445, -0.11923776182811707, 0.12710286641702678, 0.10061052668288739, -0.06048544819824734, 0.004844759345784914, 0.015180861752912082, -0.11918466157199906, -0.23392761357811725, 0.2527075894607748, -0.059269062850607915, 0.2445210820342935, 0.05316448796105608, 0.051487510167880265, 0.04586435838844545, 0.0983461213833037, 0.0044166716943917555, -0.1525155377940563, 0.048084591299968275, 0.2394943692360385, -0.07170164391105084, 0.1384733012151219, -0.3937216765146768, -0.16554132507732425, 0.09271054424854233, 0.22025380069738673, 0.13523012597630793, -0.05207770738221442, -0.2502850317991121, 0.008608714938943279, -0.17726105717236446, -0.1682847341758995, -0.09936826521046624, 0.03949672489587037, -0.03683442394002977, -0.27343593828589347, 0.098331247755872, 0.06345035101077827, 0.10504452315351971, -0.02298853679720132, -0.13303813324432967, -0.06643535592285547, 0.1048381486004998, 0.0018448270329586814, 0.07290299110409972, 0.024369123492324275, -0.14376207430721696, -0.11263926551033156, 0.3469324557783517, -0.07324820412281852, -0.11475624718050993, 0.19780633841653555, -0.19559307011177185, -0.18231137010724272, 0.16291835186551715, 0.06664813480966639, 0.09822106389185241, -0.05959671597911398, 0.09214232448208462, -0.015503016558972224, 0.22395702203405438, 0.03890414732623238, 0.06549751656417148, 0.22568658350388385, 0.16849522597242622, 0.06607392900120795, 0.22253252279027755, -0.09598535797784376, -0.1391766173641981, -0.2501437660657477, -0.1374047387592363, -0.16250724394216987, 0.02064198695923487, -0.14744044831482897, -0.1697597117235039, 0.37012578079493363, 0.09355392428690196, 0.20945682071250893, -0.006303437895219494, 0.19871075465425947, 0.06373722911279009, 0.020993944694055244, 0.02838768084643261, 0.23330361175141606, 0.13960138728405197, 0.07640807192243373, -0.2376233153914446, -0.0011386218735135862, 0.08454196360093]
|
1,803.06327
|
A Covariant Approach to Entropic Dynamics
|
Entropic Dynamics (ED) is a framework for constructing dynamical theories of
inference using the tools of inductive reasoning. A central feature of the ED
framework is the special focus placed on time. In previous work a global
entropic time was used to derive a quantum theory of relativistic scalar
fields. This theory, however, suffered from a lack of explicit or manifest
Lorentz symmetry. In this paper we explore an alternative formulation in which
the relativistic aspects of the theory are manifest.
The approach we pursue here is inspired by the works of Dirac, Kuchar, and
Teitelboim in their development of covariant Hamiltonian methods. The key
ingredient here is the adoption of a local notion of time, which we call
entropic time. This construction allows the expression of arbitrary notion of
simultaneity, in accord with relativity. In order to ensure, however, that this
local time dynamics is compatible with the background spacetime we must impose
a set of Poisson bracket constraints; these constraints themselves result from
requiring the dynamcics to be path independent, in the sense of Teitelboim and
Kuchar.
|
gr-qc quant-ph
|
entropic dynamics ed is a framework for constructing dynamical theories of inference using the tools of inductive reasoning a central feature of the ed framework is the special focus placed on time in previous work a global entropic time was used to derive a quantum theory of relativistic scalar fields this theory however suffered from a lack of explicit or manifest lorentz symmetry in this paper we explore an alternative formulation in which the relativistic aspects of the theory are manifest the approach we pursue here is inspired by the works of dirac kuchar and teitelboim in their development of covariant hamiltonian methods the key ingredient here is the adoption of a local notion of time which we call entropic time this construction allows the expression of arbitrary notion of simultaneity in accord with relativity in order to ensure however that this local time dynamics is compatible with the background spacetime we must impose a set of poisson bracket constraints these constraints themselves result from requiring the dynamcics to be path independent in the sense of teitelboim and kuchar
|
[['entropic', 'dynamics', 'ed', 'is', 'a', 'framework', 'for', 'constructing', 'dynamical', 'theories', 'of', 'inference', 'using', 'the', 'tools', 'of', 'inductive', 'reasoning', 'a', 'central', 'feature', 'of', 'the', 'ed', 'framework', 'is', 'the', 'special', 'focus', 'placed', 'on', 'time', 'in', 'previous', 'work', 'a', 'global', 'entropic', 'time', 'was', 'used', 'to', 'derive', 'a', 'quantum', 'theory', 'of', 'relativistic', 'scalar', 'fields', 'this', 'theory', 'however', 'suffered', 'from', 'a', 'lack', 'of', 'explicit', 'or', 'manifest', 'lorentz', 'symmetry', 'in', 'this', 'paper', 'we', 'explore', 'an', 'alternative', 'formulation', 'in', 'which', 'the', 'relativistic', 'aspects', 'of', 'the', 'theory', 'are', 'manifest', 'the', 'approach', 'we', 'pursue', 'here', 'is', 'inspired', 'by', 'the', 'works', 'of', 'dirac', 'kuchar', 'and', 'teitelboim', 'in', 'their', 'development', 'of', 'covariant', 'hamiltonian', 'methods', 'the', 'key', 'ingredient', 'here', 'is', 'the', 'adoption', 'of', 'a', 'local', 'notion', 'of', 'time', 'which', 'we', 'call', 'entropic', 'time', 'this', 'construction', 'allows', 'the', 'expression', 'of', 'arbitrary', 'notion', 'of', 'simultaneity', 'in', 'accord', 'with', 'relativity', 'in', 'order', 'to', 'ensure', 'however', 'that', 'this', 'local', 'time', 'dynamics', 'is', 'compatible', 'with', 'the', 'background', 'spacetime', 'we', 'must', 'impose', 'a', 'set', 'of', 'poisson', 'bracket', 'constraints', 'these', 'constraints', 'themselves', 'result', 'from', 'requiring', 'the', 'dynamcics', 'to', 'be', 'path', 'independent', 'in', 'the', 'sense', 'of', 'teitelboim', 'and', 'kuchar']]
|
[-0.13911725106659564, 0.10809402260741316, -0.14305189314162295, 0.06814408911394709, -0.1053952399452918, -0.10864239282385457, 0.007337089706463426, 0.3087909082238552, -0.2352754058737538, -0.3078405912599286, 0.05502677062759176, -0.19856427471276722, -0.17650360371812843, 0.153930192279598, -0.09766149491050773, 0.04938442245376914, 0.010919124515873662, 0.05475407594480039, -0.09802735351376612, -0.2011502207795765, 0.343360443770875, 0.0918415942526255, 0.26093951374124946, 0.03477139237305422, 0.12442900044477304, 0.03822588553361783, -0.0695626582228317, 0.05235865878024965, -0.12316563599789548, 0.16549306601453362, 0.23497840934930098, 0.1366408693128291, 0.2812926291090468, -0.465882866250958, -0.2108958726210894, 0.07666774149827157, 0.09652321681307022, 0.1530930860415415, -0.026933339448630016, -0.28108926561106456, 0.04115424587213424, -0.174795022212084, -0.154995037831387, -0.07344826274902005, -0.009932531690057577, -0.040011807220590334, -0.24364089001535197, 0.084596603848511, 0.10272417837486399, 0.048924280469844726, -0.0560231215056958, -0.0264787090781375, 0.019413652634928318, 0.07510553906132791, 0.0758539439594959, 0.043300977067006856, 0.10211756701510546, -0.09891759373739445, -0.15111714272545337, 0.41537357373895606, -0.026536577548622417, -0.22374001219397766, 0.1698578253461655, -0.09882179664165368, -0.18625195222655624, 0.05965151900438306, 0.1393909121162436, 0.15399960856989361, -0.17977747815566952, 0.17438561913787565, -0.029180922180550236, 0.10480285168290557, 0.056508982059639994, 0.06327773721723849, 0.20012251375455786, 0.14086322031988438, 0.05734872052006507, 0.09296720429896534, -0.029762061615278317, -0.14806379027941965, -0.3542844831650512, -0.16755889257919068, -0.16128039264298055, 0.07421245955956284, -0.07382676439353898, -0.15313875084230152, 0.3629863877372628, 0.181146456865238, 0.15752167853244234, 0.06640613314386959, 0.26445132665325666, 0.13528549348292257, 0.0510357841705443, 0.05614306471373342, 0.2491120509175437, 0.1438484347694857, 0.080062163108829, -0.18791231605370812, 0.0319978925216357, 0.12072778249347813]
|
1,803.06328
|
Nesting Probabilistic Programs
|
We formalize the notion of nesting probabilistic programming queries and
investigate the resulting statistical implications. We demonstrate that while
query nesting allows the definition of models which could not otherwise be
expressed, such as those involving agents reasoning about other agents,
existing systems take approaches which lead to inconsistent estimates. We show
how to correct this by delineating possible ways one might want to nest queries
and asserting the respective conditions required for convergence. We further
introduce a new online nested Monte Carlo estimator that makes it substantially
easier to ensure these conditions are met, thereby providing a simple framework
for designing statistically correct inference engines. We prove the correctness
of this online estimator and show that, when using the recommended setup, its
asymptotic variance is always better than that of the equivalent fixed
estimator, while its bias is always within a factor of two.
|
stat.ML cs.PL stat.CO
|
we formalize the notion of nesting probabilistic programming queries and investigate the resulting statistical implications we demonstrate that while query nesting allows the definition of models which could not otherwise be expressed such as those involving agents reasoning about other agents existing systems take approaches which lead to inconsistent estimates we show how to correct this by delineating possible ways one might want to nest queries and asserting the respective conditions required for convergence we further introduce a new online nested monte carlo estimator that makes it substantially easier to ensure these conditions are met thereby providing a simple framework for designing statistically correct inference engines we prove the correctness of this online estimator and show that when using the recommended setup its asymptotic variance is always better than that of the equivalent fixed estimator while its bias is always within a factor of two
|
[['we', 'formalize', 'the', 'notion', 'of', 'nesting', 'probabilistic', 'programming', 'queries', 'and', 'investigate', 'the', 'resulting', 'statistical', 'implications', 'we', 'demonstrate', 'that', 'while', 'query', 'nesting', 'allows', 'the', 'definition', 'of', 'models', 'which', 'could', 'not', 'otherwise', 'be', 'expressed', 'such', 'as', 'those', 'involving', 'agents', 'reasoning', 'about', 'other', 'agents', 'existing', 'systems', 'take', 'approaches', 'which', 'lead', 'to', 'inconsistent', 'estimates', 'we', 'show', 'how', 'to', 'correct', 'this', 'by', 'delineating', 'possible', 'ways', 'one', 'might', 'want', 'to', 'nest', 'queries', 'and', 'asserting', 'the', 'respective', 'conditions', 'required', 'for', 'convergence', 'we', 'further', 'introduce', 'a', 'new', 'online', 'nested', 'monte', 'carlo', 'estimator', 'that', 'makes', 'it', 'substantially', 'easier', 'to', 'ensure', 'these', 'conditions', 'are', 'met', 'thereby', 'providing', 'a', 'simple', 'framework', 'for', 'designing', 'statistically', 'correct', 'inference', 'engines', 'we', 'prove', 'the', 'correctness', 'of', 'this', 'online', 'estimator', 'and', 'show', 'that', 'when', 'using', 'the', 'recommended', 'setup', 'its', 'asymptotic', 'variance', 'is', 'always', 'better', 'than', 'that', 'of', 'the', 'equivalent', 'fixed', 'estimator', 'while', 'its', 'bias', 'is', 'always', 'within', 'a', 'factor', 'of', 'two']]
|
[-0.08156892474226911, 0.04365267113557664, -0.11598171618734968, 0.15557721941892444, -0.120853368897826, -0.18822936042179836, 0.10292450559470032, 0.4032567816947041, -0.2798680647501144, -0.32559346546065704, 0.09789289048760487, -0.2290406822549091, -0.14465292873952923, 0.18513353510021135, -0.11144101964149239, 0.05603845380808644, 0.08786402267146984, 0.026452212600872434, -0.07162695426758828, -0.28848523725755515, 0.2848103793723316, 0.08783255224597865, 0.2561889795939727, 0.02383185956819818, 0.08449002501458444, 0.02058989926048651, -0.02061212133166605, 0.06189488377100948, -0.14821481685222385, 0.13555874668447107, 0.29738119930495077, 0.21217897810074018, 0.33283415447021353, -0.4142237006204909, -0.15461058171530223, 0.12762709724363583, 0.16993271644580468, 0.11006844560776291, 0.006841352769848087, -0.26273212633256254, 0.10997279342906228, -0.17317760186591025, -0.08412339828490954, -0.14258709037355308, -0.05980786665117946, -0.010955181363006604, -0.3032208201346983, 0.03159610486493029, 0.10884343352939548, 0.02072084525214701, -0.026648444119150398, -0.10551012257949031, 0.02086071554603505, 0.1007623569648472, 0.051346689760524394, -0.014883976426489394, 0.1262270561290969, -0.10480472103146643, -0.14053131048728165, 0.367761145846854, 0.0063606354419005525, -0.22008916930745132, 0.2060504235391473, -0.09790439488494705, -0.14445543137924938, 0.09133333967805936, 0.12655801497528266, 0.09836954697324284, -0.1734837286163258, 0.03572155935569377, -0.03124559722391182, 0.1639009335303101, 0.04618814273512569, 0.03475882649293233, 0.18540186060528302, 0.1419835083443543, 0.12318000517432288, 0.12959342553914557, -0.011429655127998055, -0.097821486624588, -0.2818287763873051, -0.1640025278681825, -0.12028588836627274, 0.012941906175772852, -0.12982829946287955, -0.17435709527725804, 0.3432579976731333, 0.2771076434291899, 0.15571311628445983, 0.1410479184818165, 0.29469774018587735, 0.10789824146054813, 0.05609706197062443, 0.11499306795444211, 0.20979060501398133, 0.053178207269982146, 0.04597759223061389, -0.17659843044740886, 0.18242191998769755, 0.028149290837283278]
|
1,803.06329
|
Learning deep structured active contours end-to-end
|
The world is covered with millions of buildings, and precisely knowing each
instance's position and extents is vital to a multitude of applications.
Recently, automated building footprint segmentation models have shown superior
detection accuracy thanks to the usage of Convolutional Neural Networks (CNN).
However, even the latest evolutions struggle to precisely delineating borders,
which often leads to geometric distortions and inadvertent fusion of adjacent
building instances. We propose to overcome this issue by exploiting the
distinct geometric properties of buildings. To this end, we present Deep
Structured Active Contours (DSAC), a novel framework that integrates priors and
constraints into the segmentation process, such as continuous boundaries,
smooth edges, and sharp corners. To do so, DSAC employs Active Contour Models
(ACM), a family of constraint- and prior-based polygonal models. We learn ACM
parameterizations per instance using a CNN, and show how to incorporate all
components in a structured output model, making DSAC trainable end-to-end. We
evaluate DSAC on three challenging building instance segmentation datasets,
where it compares favorably against state-of-the-art. Code will be made
available.
|
cs.CV
|
the world is covered with millions of buildings and precisely knowing each instances position and extents is vital to a multitude of applications recently automated building footprint segmentation models have shown superior detection accuracy thanks to the usage of convolutional neural networks cnn however even the latest evolutions struggle to precisely delineating borders which often leads to geometric distortions and inadvertent fusion of adjacent building instances we propose to overcome this issue by exploiting the distinct geometric properties of buildings to this end we present deep structured active contours dsac a novel framework that integrates priors and constraints into the segmentation process such as continuous boundaries smooth edges and sharp corners to do so dsac employs active contour models acm a family of constraint and priorbased polygonal models we learn acm parameterizations per instance using a cnn and show how to incorporate all components in a structured output model making dsac trainable endtoend we evaluate dsac on three challenging building instance segmentation datasets where it compares favorably against stateoftheart code will be made available
|
[['the', 'world', 'is', 'covered', 'with', 'millions', 'of', 'buildings', 'and', 'precisely', 'knowing', 'each', 'instances', 'position', 'and', 'extents', 'is', 'vital', 'to', 'a', 'multitude', 'of', 'applications', 'recently', 'automated', 'building', 'footprint', 'segmentation', 'models', 'have', 'shown', 'superior', 'detection', 'accuracy', 'thanks', 'to', 'the', 'usage', 'of', 'convolutional', 'neural', 'networks', 'cnn', 'however', 'even', 'the', 'latest', 'evolutions', 'struggle', 'to', 'precisely', 'delineating', 'borders', 'which', 'often', 'leads', 'to', 'geometric', 'distortions', 'and', 'inadvertent', 'fusion', 'of', 'adjacent', 'building', 'instances', 'we', 'propose', 'to', 'overcome', 'this', 'issue', 'by', 'exploiting', 'the', 'distinct', 'geometric', 'properties', 'of', 'buildings', 'to', 'this', 'end', 'we', 'present', 'deep', 'structured', 'active', 'contours', 'dsac', 'a', 'novel', 'framework', 'that', 'integrates', 'priors', 'and', 'constraints', 'into', 'the', 'segmentation', 'process', 'such', 'as', 'continuous', 'boundaries', 'smooth', 'edges', 'and', 'sharp', 'corners', 'to', 'do', 'so', 'dsac', 'employs', 'active', 'contour', 'models', 'acm', 'a', 'family', 'of', 'constraint', 'and', 'priorbased', 'polygonal', 'models', 'we', 'learn', 'acm', 'parameterizations', 'per', 'instance', 'using', 'a', 'cnn', 'and', 'show', 'how', 'to', 'incorporate', 'all', 'components', 'in', 'a', 'structured', 'output', 'model', 'making', 'dsac', 'trainable', 'endtoend', 'we', 'evaluate', 'dsac', 'on', 'three', 'challenging', 'building', 'instance', 'segmentation', 'datasets', 'where', 'it', 'compares', 'favorably', 'against', 'stateoftheart', 'code', 'will', 'be', 'made', 'available']]
|
[-0.06055781545837399, 0.012806539671313575, -0.038539091023099985, 0.06075111798707795, -0.14685831439210337, -0.18419838769778865, 0.018230644505652975, 0.46319797463800716, -0.265235298556736, -0.3467213587247333, 0.09758154829313721, -0.25358769864957226, -0.19052380303606048, 0.16213357224244218, -0.16216651452457714, 0.09819965474923066, 0.1223092806182973, -0.006954997462145556, -0.05599303803428066, -0.26668790815633603, 0.2725897178270629, 0.04213785495051724, 0.3345155490939666, 0.03708301461167933, 0.1450533981986301, -0.01687520909228164, -0.04776854765261577, 0.021772126003500373, -0.08396393138783664, 0.20717551662645506, 0.31059227604032197, 0.15720759437355245, 0.26442105577316605, -0.44098824782339835, -0.24503058794586138, 0.10115247767354393, 0.1531548139876044, 0.09374780009573275, 0.007027050555849598, -0.29712157287559976, 0.07435342100791462, -0.16320798578725634, -0.03500175939862156, -0.12524006180144076, -0.011118224701555124, -0.011070136697400874, -0.26554416957975036, 0.002305895261380864, 0.05304755454604653, 0.02268686713704347, -0.0442608690903597, -0.11306713734239597, -0.0019499117190061115, 0.17015484481750207, -0.01987154269942227, 0.045873998858345054, 0.14222530599271385, -0.16807872535029109, -0.1201831696450646, 0.3536929135520584, -0.024594876883101875, -0.20713924518358176, 0.22241618639077648, -0.018212080569188487, -0.1700238956729935, 0.10354357416040381, 0.23489254621531944, 0.12490946598800606, -0.15144880404749392, 0.03270033663760967, -0.010024115882797873, 0.17115362605211143, 0.07274364652219174, -0.02568477734216842, 0.2146692164697224, 0.24725764705103703, 0.048895735268160934, 0.15104718791286129, -0.12966928568159514, -0.07939436256914967, -0.22904387278075533, -0.08100330799914382, -0.14658927623431423, -0.03586403102394536, -0.06866015522848165, -0.18812915611831169, 0.3941633349776953, 0.2329255342537045, 0.25653870908099213, 0.08389038783591776, 0.353550692688374, -0.00979364362890543, 0.13776428128817472, 0.11524940716054548, 0.16854558477844594, 0.028017894976408404, 0.060600007237898636, -0.10840831105677604, 0.0765349843456335, 0.06827169266093158]
|
1,803.0633
|
Interior metric and ray-tracing map in the firework black-to-white hole
transition
|
The possibility that a black hole could tunnel into a white hole has recently
received attention. Here we present a metric that improves the 'firework'
metric: it describes the entire process and solves the Einstein equations
everywhere except on a small transition surface that corresponds to the quantum
tunnelling. We compute the corresponding ray-tracing map from past infinity to
future infinity explicitly.
|
gr-qc hep-th
|
the possibility that a black hole could tunnel into a white hole has recently received attention here we present a metric that improves the firework metric it describes the entire process and solves the einstein equations everywhere except on a small transition surface that corresponds to the quantum tunnelling we compute the corresponding raytracing map from past infinity to future infinity explicitly
|
[['the', 'possibility', 'that', 'a', 'black', 'hole', 'could', 'tunnel', 'into', 'a', 'white', 'hole', 'has', 'recently', 'received', 'attention', 'here', 'we', 'present', 'a', 'metric', 'that', 'improves', 'the', 'firework', 'metric', 'it', 'describes', 'the', 'entire', 'process', 'and', 'solves', 'the', 'einstein', 'equations', 'everywhere', 'except', 'on', 'a', 'small', 'transition', 'surface', 'that', 'corresponds', 'to', 'the', 'quantum', 'tunnelling', 'we', 'compute', 'the', 'corresponding', 'raytracing', 'map', 'from', 'past', 'infinity', 'to', 'future', 'infinity', 'explicitly']]
|
[-0.12767009413050068, 0.07594702659257417, -0.1078711140547849, 0.08788919109854525, -0.1162506895845816, -0.16278291609318507, 0.050654111309878284, 0.33534980183767693, -0.199521389729794, -0.23898236989043653, 0.05889954405926889, -0.35094245360983956, -0.17331220352301194, 0.19159930130286562, -0.0697186024063417, 0.05240135105146516, 0.0575899561067232, 0.06279938350217568, -0.1142863477317376, -0.23465799324725184, 0.3642721143701384, 0.10180308846118409, 0.25361388196958407, 0.035951986826295336, 0.17883541631219427, -0.008846715601506613, 0.021757666171798782, 0.04355908156703076, -0.1709208530799867, 0.04105337811145751, 0.20807592240312406, 0.1388720438530248, 0.262235717787858, -0.3908167309578388, -0.2564157113402842, 0.08878236586573504, 0.14719481796642103, 0.1843410698516715, -0.08431792423887659, -0.26896856406763675, 0.09823328741514424, -0.2005188032053411, -0.12306313248231046, -0.023215235481339115, 0.049426809524095824, -0.06075320700033297, -0.18873525945649994, 0.02093012147252598, 0.07192868058900198, -0.10883395593132704, -0.08646583895108872, -0.026200905307045868, -0.03128388016334464, 0.14650464854052953, 0.07059013678630319, 0.0789435270332521, 0.1467765578849902, -0.05490638105378997, -0.05843426228684914, 0.32448810070937106, -0.12211803648801099, -0.18014473044275936, 0.14523400630681746, -0.21622732105184225, -0.07420224040716646, 0.1406700980338839, 0.1745353708186397, 0.15933369438073808, -0.15359283122985112, 0.192327748232093, -0.02801373090234495, 0.1409813805948943, 0.10668045677424919, -0.03053068139049555, 0.2935748474912778, 0.1291298157565536, 0.05818905798538077, 0.16758554844906734, -0.10603685223031789, -0.1160847477449645, -0.29069905756454495, -0.1677614078826962, -0.17170037013748962, 0.1518539467210611, -0.09062547131320424, -0.18514609694360726, 0.36163773853331804, 0.1618544259559243, 0.22850284616147437, 0.0344466756984231, 0.2720120102542663, 0.12117296661580762, 0.05856049454087042, 0.09317061539848275, 0.26958055653038526, 0.11878106369066142, 0.14146445324313978, -0.19177024575295828, 0.010234678269273812, 0.08175214254597743]
|
1,803.06331
|
Measurement of the Dynamical Structure Factor of a 1D Interacting Fermi
Gas
|
We present measurements of the dynamical structure factor $S(q,\omega)$ of an
interacting one-dimensional (1D) Fermi gas for small excitation energies. We
use the two lowest hyperfine levels of the $^6$Li atom to form a
pseudo-spin-1/2 system whose s-wave interactions are tunable via a Feshbach
resonance. The atoms are confined to 1D by a two-dimensional optical lattice.
Bragg spectroscopy is used to measure a response of the gas to density
("charge") mode excitations at a momentum $q$ and frequency $\omega$. The
spectrum is obtained by varying $\omega$, while the angle between two laser
beams determines $q$, which is fixed to be less than the Fermi momentum
$k_\textrm{F}$. The measurements agree well with Tomonaga-Luttinger theory.
|
physics.atom-ph cond-mat.quant-gas
|
we present measurements of the dynamical structure factor sqomega of an interacting onedimensional 1d fermi gas for small excitation energies we use the two lowest hyperfine levels of the 6li atom to form a pseudospin12 system whose swave interactions are tunable via a feshbach resonance the atoms are confined to 1d by a twodimensional optical lattice bragg spectroscopy is used to measure a response of the gas to density charge mode excitations at a momentum q and frequency omega the spectrum is obtained by varying omega while the angle between two laser beams determines q which is fixed to be less than the fermi momentum k_textrmf the measurements agree well with tomonagaluttinger theory
|
[['we', 'present', 'measurements', 'of', 'the', 'dynamical', 'structure', 'factor', 'sqomega', 'of', 'an', 'interacting', 'onedimensional', '1d', 'fermi', 'gas', 'for', 'small', 'excitation', 'energies', 'we', 'use', 'the', 'two', 'lowest', 'hyperfine', 'levels', 'of', 'the', '6li', 'atom', 'to', 'form', 'a', 'pseudospin12', 'system', 'whose', 'swave', 'interactions', 'are', 'tunable', 'via', 'a', 'feshbach', 'resonance', 'the', 'atoms', 'are', 'confined', 'to', '1d', 'by', 'a', 'twodimensional', 'optical', 'lattice', 'bragg', 'spectroscopy', 'is', 'used', 'to', 'measure', 'a', 'response', 'of', 'the', 'gas', 'to', 'density', 'charge', 'mode', 'excitations', 'at', 'a', 'momentum', 'q', 'and', 'frequency', 'omega', 'the', 'spectrum', 'is', 'obtained', 'by', 'varying', 'omega', 'while', 'the', 'angle', 'between', 'two', 'laser', 'beams', 'determines', 'q', 'which', 'is', 'fixed', 'to', 'be', 'less', 'than', 'the', 'fermi', 'momentum', 'k_textrmf', 'the', 'measurements', 'agree', 'well', 'with', 'tomonagaluttinger', 'theory']]
|
[-0.17787834639498865, 0.2542307734559342, -0.04798081512074402, 0.018449282355764547, -0.008000637772576218, -0.18227309503812908, 0.054640668654298806, 0.4036056719487533, -0.2314285519740744, -0.26851358018549426, -0.04213602516600596, -0.33332992827386726, -0.016302106149461388, 0.1645990539088546, 0.11137872748908453, 0.05800082110467234, 0.005642462164230112, -0.0021000482561898287, -0.09325432216116626, -0.1429791809038891, 0.3411518848900284, 0.05882754226747368, 0.24829675105034507, 0.056583442276210656, 0.06104177184793765, 0.01046533250025407, 0.10954365303041413, -0.0333887995969105, -0.1551281671937821, 0.10232794499357364, 0.23180774054032685, -0.08995467108408255, 0.1904731709655607, -0.3922974092586498, -0.2069232002665688, 0.04666964555508457, 0.1679925427140136, 0.1346797798063822, 0.00929832249572168, -0.2895984780708594, -0.04486905940575525, -0.17126499420971544, -0.19102247966553218, -0.09707672354332837, 0.006460758716067565, 0.0272989556786862, -0.27380361055267194, 0.09951985118511532, -0.0019272617773822276, 0.09644268310096647, -0.09959613361570518, -0.08839580157967118, -0.0380519741842623, 0.03826703971052276, -0.0253557131342989, 0.07295216893128652, 0.1870076708520563, -0.1160596424664878, -0.05698225811024064, 0.4054530730520907, -0.1188683731344489, -0.17425491420518874, 0.18656033040523262, -0.22746085489468118, -0.02451573006380516, 0.1994509739701503, 0.11172222363789583, 0.07414754995677088, -0.12133111978047444, 0.05951933228633217, -0.057092200915836396, 0.21455591447816655, 0.09041993937820994, 0.0717464844263824, 0.2459597094649715, 0.16199833020800725, 0.026301960514891625, 0.1133921335973095, -0.15212452938950655, -0.060529540893704895, -0.23224114312324673, -0.10141319775721058, -0.24334292509671027, 0.04063138289244047, -0.01159821847340936, -0.13472768230297202, 0.3837675407641135, 0.046529662084399855, 0.2489185097178311, -0.053210293093538245, 0.29821859886786634, 0.18539563806552906, 0.05821067000111465, 0.032838650742113326, 0.24426399341194024, 0.20084505895335628, 0.04156115126845959, -0.3189388284185303, -0.061281275045725385, 0.02666474771311706]
|
1,803.06332
|
On the MSW neutrino mixing effects in atomic weak interactions and
double beta decays
|
Matter effects on the mixing of the neutrinos mass eigenstates, also know as
the Mikheyev-Smirnov-Wolfenstein effect, seem to be well established in
describing the propagation of the neutrino from the source to detecting
devices. These effects were mostly considered in bulk matter, but not inside
the atoms. Here we consider the effect of the high electron densities existing
in the atomic nuclei. We investigate if these effects can affect the known
neutrino phenomenology. It was reported that the mixing of the neutrino in high
density matter, such as inside a supernova, can affect the Majoron decay
probabilities. We investigate if the neutrino mixing effects in the high
electron density inside the atomic nuclei can change the neutrinoless double
beta decay half-life formula. In both cases we found that the standard results
stand. The results look simple, but the road to them is complex and it opens
the possibility that the neutrino mixing in atomic nuclei may affect other
observables, such as the neutrinoless double beta Majoron decays.
|
hep-ph nucl-th
|
matter effects on the mixing of the neutrinos mass eigenstates also know as the mikheyevsmirnovwolfenstein effect seem to be well established in describing the propagation of the neutrino from the source to detecting devices these effects were mostly considered in bulk matter but not inside the atoms here we consider the effect of the high electron densities existing in the atomic nuclei we investigate if these effects can affect the known neutrino phenomenology it was reported that the mixing of the neutrino in high density matter such as inside a supernova can affect the majoron decay probabilities we investigate if the neutrino mixing effects in the high electron density inside the atomic nuclei can change the neutrinoless double beta decay halflife formula in both cases we found that the standard results stand the results look simple but the road to them is complex and it opens the possibility that the neutrino mixing in atomic nuclei may affect other observables such as the neutrinoless double beta majoron decays
|
[['matter', 'effects', 'on', 'the', 'mixing', 'of', 'the', 'neutrinos', 'mass', 'eigenstates', 'also', 'know', 'as', 'the', 'mikheyevsmirnovwolfenstein', 'effect', 'seem', 'to', 'be', 'well', 'established', 'in', 'describing', 'the', 'propagation', 'of', 'the', 'neutrino', 'from', 'the', 'source', 'to', 'detecting', 'devices', 'these', 'effects', 'were', 'mostly', 'considered', 'in', 'bulk', 'matter', 'but', 'not', 'inside', 'the', 'atoms', 'here', 'we', 'consider', 'the', 'effect', 'of', 'the', 'high', 'electron', 'densities', 'existing', 'in', 'the', 'atomic', 'nuclei', 'we', 'investigate', 'if', 'these', 'effects', 'can', 'affect', 'the', 'known', 'neutrino', 'phenomenology', 'it', 'was', 'reported', 'that', 'the', 'mixing', 'of', 'the', 'neutrino', 'in', 'high', 'density', 'matter', 'such', 'as', 'inside', 'a', 'supernova', 'can', 'affect', 'the', 'majoron', 'decay', 'probabilities', 'we', 'investigate', 'if', 'the', 'neutrino', 'mixing', 'effects', 'in', 'the', 'high', 'electron', 'density', 'inside', 'the', 'atomic', 'nuclei', 'can', 'change', 'the', 'neutrinoless', 'double', 'beta', 'decay', 'halflife', 'formula', 'in', 'both', 'cases', 'we', 'found', 'that', 'the', 'standard', 'results', 'stand', 'the', 'results', 'look', 'simple', 'but', 'the', 'road', 'to', 'them', 'is', 'complex', 'and', 'it', 'opens', 'the', 'possibility', 'that', 'the', 'neutrino', 'mixing', 'in', 'atomic', 'nuclei', 'may', 'affect', 'other', 'observables', 'such', 'as', 'the', 'neutrinoless', 'double', 'beta', 'majoron', 'decays']]
|
[-0.05363813782958481, 0.2903472751791695, -0.030481521910179162, 0.1932119874508137, -0.03582932865860576, -0.114122203124609, 0.05831842355131768, 0.3340524360649065, -0.2575400060985215, -0.29504468776341414, 0.02272442307721957, -0.2999502327181622, -0.0807863497865403, 0.17676137466385158, 0.04613969632574987, 0.02196847814731969, 0.016799170634023353, 0.024661910695074025, -0.09972251191997376, -0.2049633287922284, 0.28312691606157375, 0.09830336571632031, 0.2430767837610698, 0.11361740062899976, 0.022825830953452222, -0.04628256679000891, -0.03861816410354511, -0.06137760242364346, -0.1201368604227186, 0.0007237431197287794, 0.19415200445468156, 0.10077853480766634, 0.14464757610447035, -0.44033040218947533, -0.21403566412739233, 0.16887535524351, 0.19149507663608667, 0.12172517751226436, -0.0990968986036546, -0.30292578278009047, 0.016832026330932618, -0.20956608082284917, -0.15045805660090034, -0.041456783505457784, -0.025256530490486387, 0.03313728078396734, -0.25546850133296883, 0.08067355702981815, -0.009213823895527797, -0.06686898457352769, -0.03350280366203968, -0.1585814956112759, 0.018601238252148926, 0.11257933652374202, 0.12382554856315812, -0.06321790022775531, 0.19785225768517814, -0.16024071058191494, -0.07226347089828757, 0.4320563380132446, -0.08077591614279071, -0.16373137084203968, 0.14789267383867172, -0.24292502240581065, -0.1427849655870549, 0.1231883865164894, 0.14267586987091976, 0.08046087589460665, -0.12056630036743458, 0.09611142349734757, -0.07082970597792394, 0.14481209763353634, 0.04413601725981264, 0.08447604828492723, 0.26878544102662694, 0.19330795877194867, 0.042225096828560765, 0.011229960278198012, -0.16145808226306935, -0.035633238046402164, -0.3164641449484461, -0.13718782007292715, -0.10392129784282632, 0.07795973012266014, -0.024461907719336533, -0.1561246811841687, 0.3844747011644576, 0.10776246882888661, 0.1719507599684471, -0.04990997183287215, 0.2807958804204792, 0.0902043976326066, 0.08030354340970627, 0.022209766580204585, 0.35859461472241466, 0.1492363449637806, 0.07639561709250786, -0.2976792433025862, 0.09949462320014255, 0.022666565719768852]
|
1,803.06333
|
Snap ML: A Hierarchical Framework for Machine Learning
|
We describe a new software framework for fast training of generalized linear
models. The framework, named Snap Machine Learning (Snap ML), combines recent
advances in machine learning systems and algorithms in a nested manner to
reflect the hierarchical architecture of modern computing systems. We prove
theoretically that such a hierarchical system can accelerate training in
distributed environments where intra-node communication is cheaper than
inter-node communication. Additionally, we provide a review of the
implementation of Snap ML in terms of GPU acceleration, pipelining,
communication patterns and software architecture, highlighting aspects that
were critical for achieving high performance. We evaluate the performance of
Snap ML in both single-node and multi-node environments, quantifying the
benefit of the hierarchical scheme and the data streaming functionality, and
comparing with other widely-used machine learning software frameworks. Finally,
we present a logistic regression benchmark on the Criteo Terabyte Click Logs
dataset and show that Snap ML achieves the same test loss an order of magnitude
faster than any of the previously reported results, including those obtained
using TensorFlow and scikit-learn.
|
cs.LG cs.AI cs.DC
|
we describe a new software framework for fast training of generalized linear models the framework named snap machine learning snap ml combines recent advances in machine learning systems and algorithms in a nested manner to reflect the hierarchical architecture of modern computing systems we prove theoretically that such a hierarchical system can accelerate training in distributed environments where intranode communication is cheaper than internode communication additionally we provide a review of the implementation of snap ml in terms of gpu acceleration pipelining communication patterns and software architecture highlighting aspects that were critical for achieving high performance we evaluate the performance of snap ml in both singlenode and multinode environments quantifying the benefit of the hierarchical scheme and the data streaming functionality and comparing with other widelyused machine learning software frameworks finally we present a logistic regression benchmark on the criteo terabyte click logs dataset and show that snap ml achieves the same test loss an order of magnitude faster than any of the previously reported results including those obtained using tensorflow and scikitlearn
|
[['we', 'describe', 'a', 'new', 'software', 'framework', 'for', 'fast', 'training', 'of', 'generalized', 'linear', 'models', 'the', 'framework', 'named', 'snap', 'machine', 'learning', 'snap', 'ml', 'combines', 'recent', 'advances', 'in', 'machine', 'learning', 'systems', 'and', 'algorithms', 'in', 'a', 'nested', 'manner', 'to', 'reflect', 'the', 'hierarchical', 'architecture', 'of', 'modern', 'computing', 'systems', 'we', 'prove', 'theoretically', 'that', 'such', 'a', 'hierarchical', 'system', 'can', 'accelerate', 'training', 'in', 'distributed', 'environments', 'where', 'intranode', 'communication', 'is', 'cheaper', 'than', 'internode', 'communication', 'additionally', 'we', 'provide', 'a', 'review', 'of', 'the', 'implementation', 'of', 'snap', 'ml', 'in', 'terms', 'of', 'gpu', 'acceleration', 'pipelining', 'communication', 'patterns', 'and', 'software', 'architecture', 'highlighting', 'aspects', 'that', 'were', 'critical', 'for', 'achieving', 'high', 'performance', 'we', 'evaluate', 'the', 'performance', 'of', 'snap', 'ml', 'in', 'both', 'singlenode', 'and', 'multinode', 'environments', 'quantifying', 'the', 'benefit', 'of', 'the', 'hierarchical', 'scheme', 'and', 'the', 'data', 'streaming', 'functionality', 'and', 'comparing', 'with', 'other', 'widelyused', 'machine', 'learning', 'software', 'frameworks', 'finally', 'we', 'present', 'a', 'logistic', 'regression', 'benchmark', 'on', 'the', 'criteo', 'terabyte', 'click', 'logs', 'dataset', 'and', 'show', 'that', 'snap', 'ml', 'achieves', 'the', 'same', 'test', 'loss', 'an', 'order', 'of', 'magnitude', 'faster', 'than', 'any', 'of', 'the', 'previously', 'reported', 'results', 'including', 'those', 'obtained', 'using', 'tensorflow', 'and', 'scikitlearn']]
|
[-0.1080373452082707, -0.027764950366741224, -0.048662336835250085, 0.04199680666616886, -0.08947045656696306, -0.18988491388877607, 0.03774835761712872, 0.423487130035727, -0.26585288153627534, -0.35553419423650284, 0.07768472791932028, -0.24035340779853953, -0.18694192154946698, 0.27608823109245884, -0.07633013678364714, 0.12259999925346043, 0.1385253136842969, -0.009784389187472825, -0.09927000945320924, -0.32179565493063195, 0.2580577595962879, 0.07838521748067909, 0.3672109692642799, -0.0019652961482121635, 0.0997634121064417, -0.014269155596862036, -0.017922494586892265, -0.025339087461945034, -0.09601832242278656, 0.18128950382459025, 0.27127922846319713, 0.24795202133407268, 0.3274870973451849, -0.41932457510544785, -0.19092743260354594, 0.04518561881719254, 0.1638265233648392, 0.09212422170918542, -0.06559540869633135, -0.2713166788769509, 0.09483331337038191, -0.2401739449719387, -0.017032690346240997, -0.1463137638992011, -0.0524777754726739, 0.042756350650425164, -0.27758286103156715, 0.025850391010699976, 0.046707585526662584, 0.08192563415478075, -0.004659688307478421, -0.14133173618748288, 0.06136499885523509, 0.10150602209850113, -0.027807975717486458, 0.027846493421800737, 0.15621450108259302, -0.15468153262855264, -0.20222119015313125, 0.37344749388150394, -0.05656782117308214, -0.1430646818170911, 0.22337840650650548, 0.016750720540879865, -0.16643717564303276, 0.029197534033490312, 0.30724969170543476, 0.06424241210468587, -0.16462712975305027, 0.06841173349520342, 0.0505689671720685, 0.17916225437128733, 0.03356596868286028, 0.0005553293370270315, 0.11678244625998802, 0.2937947964360345, 0.01003468572296676, 0.13118504202753747, -0.10408386261999134, -0.11944796513184647, -0.18919847887332383, -0.1794342225595987, -0.15712553080618166, -0.08238027478444439, -0.13505921256232192, -0.167643055626638, 0.3654556474615401, 0.22193611276772068, 0.15889837648558047, 0.12974779495990948, 0.3888043642550104, 0.023402927726684838, 0.13504569189666066, 0.1792870021352512, 0.2016019340015065, -0.019862948866719864, 0.12788988179910787, -0.17105578571407265, 0.06951917173957312, -0.003348834664598538]
|
1,803.06334
|
Forbidden arithmetic progressions in permutations of subsets of the
integers
|
Permutations of the positive integers avoiding arithmetic progressions of
length $5$ were constructed in (Davis et al, 1977), implying the existence of
permutations of the integers avoiding arithmetic progressions of length $7$. We
construct a permutation of the integers avoiding arithmetic progressions of
length $6$. We also prove a lower bound of $\frac{1}{2}$ on the lower density
of subsets of positive integers that can be permuted to avoid arithmetic
progressions of length $4$, sharpening the lower bound of $\frac{1}{3}$ from
(LeSaulnier and Vijay, 2011). In addition, we generalize several results about
forbidden arithmetic progressions to construct permutations avoiding
generalized arithmetic progressions.
|
math.CO cs.DM
|
permutations of the positive integers avoiding arithmetic progressions of length 5 were constructed in davis et al 1977 implying the existence of permutations of the integers avoiding arithmetic progressions of length 7 we construct a permutation of the integers avoiding arithmetic progressions of length 6 we also prove a lower bound of frac12 on the lower density of subsets of positive integers that can be permuted to avoid arithmetic progressions of length 4 sharpening the lower bound of frac13 from lesaulnier and vijay 2011 in addition we generalize several results about forbidden arithmetic progressions to construct permutations avoiding generalized arithmetic progressions
|
[['permutations', 'of', 'the', 'positive', 'integers', 'avoiding', 'arithmetic', 'progressions', 'of', 'length', '5', 'were', 'constructed', 'in', 'davis', 'et', 'al', '1977', 'implying', 'the', 'existence', 'of', 'permutations', 'of', 'the', 'integers', 'avoiding', 'arithmetic', 'progressions', 'of', 'length', '7', 'we', 'construct', 'a', 'permutation', 'of', 'the', 'integers', 'avoiding', 'arithmetic', 'progressions', 'of', 'length', '6', 'we', 'also', 'prove', 'a', 'lower', 'bound', 'of', 'frac12', 'on', 'the', 'lower', 'density', 'of', 'subsets', 'of', 'positive', 'integers', 'that', 'can', 'be', 'permuted', 'to', 'avoid', 'arithmetic', 'progressions', 'of', 'length', '4', 'sharpening', 'the', 'lower', 'bound', 'of', 'frac13', 'from', 'lesaulnier', 'and', 'vijay', '2011', 'in', 'addition', 'we', 'generalize', 'several', 'results', 'about', 'forbidden', 'arithmetic', 'progressions', 'to', 'construct', 'permutations', 'avoiding', 'generalized', 'arithmetic', 'progressions']]
|
[-0.25106008317653494, 0.18938188815701495, -0.08564746990283527, 0.1282973530803724, -0.02843596336275044, -0.10831759917079517, 0.09106827024278222, 0.2665697865390984, -0.267260808894171, -0.31666801967611996, 0.043836600214040074, -0.2882319642784129, -0.09208833161132908, 0.20149658049346122, -0.18418002153497817, 0.07253468624952406, 0.0023704175791232894, 0.031170432068555073, -0.04445222781574593, -0.38583626273078936, 0.2449890359991811, -0.04157177861987401, 0.14034359967036375, 0.05733925461686115, 0.024516802230425697, 0.009095169479340906, -0.04820750198686625, -0.06210409589849486, -0.2091971420580527, 0.13146881670644966, 0.2665146657883531, 0.13295435988676207, 0.28806161142811915, -0.42116896846875695, -0.10187010761202857, 0.20930161853643633, 0.15653819227498947, 0.08278091510038564, 0.029806478466552745, -0.22093472227749258, 0.18779936103648184, -0.060293642702595435, -0.14846611775384091, 0.012772044240690695, 0.10696581330629859, 0.0813979135761683, -0.2586808414152353, 0.05379859491056615, 0.1664508239246241, 0.1877050519907054, 0.03648900693411579, -0.24268563552805694, 0.07927246250691686, 0.04080507481968639, -0.0017501853019146636, 0.051690750955926755, 0.009364240161963914, -0.011573987999137971, -0.17381725996954017, 0.2661763564130236, -0.028470656825321735, -0.1369850970620271, 0.032793160583270656, -0.12262132225470562, -0.16847937942325775, 0.14297774927413995, 0.08541172853495815, 0.11912465306450751, 0.05563978198685195, 0.15481827949291316, -0.19103831105916252, 0.24050151820451315, 0.3549766363852685, 0.05679132186780029, 0.09259042184394185, -0.0034089294160799225, 0.06774670034093727, 0.15017351502723217, -0.009668182162106922, -0.013064678632170146, -0.2943845216535253, -0.11958261939715986, -0.17866961598986447, 0.11819524989269747, -0.14610980632285572, -0.23838275836407216, 0.35701428921801026, 0.12298613856316055, 0.1835700891252681, 0.18633141786339555, 0.19430917175025633, 0.0615552348813208, 0.048284082461983, 0.07631339509003233, -0.0026869919003531485, 0.20016339461614222, -0.10915858172673253, -0.14407860287430577, 0.019323572534883378, 0.2074714402257843]
|
1,803.06335
|
Black holes in quartic-order beyond-generalized Proca theories
|
The generalized Proca theories with second-order equations of motion can be
healthily extended to a more general framework in which the number of
propagating degrees of freedom remains unchanged. In the presence of a
quartic-order nonminimal coupling to gravity arising in beyond-generalized
Proca theories, the speed of gravitational waves $c_t$ on the
Friedmann-Lemaitre-Robertson-Walker (FLRW) cosmological background can be equal
to that of light $c$ under a certain condition. By using this condition alone,
we show that the speed of gravitational waves in the vicinity of static and
spherically symmetric black holes is also equivalent to $c$ for the propagation
of odd-parity perturbations along both radial and angular directions. As a
by-product, the black holes arising in our beyond-generalized Proca theories
are plagued by neither ghost nor Laplacian instabilities against odd-parity
perturbations. We show the existence of both exact and numerical black hole
solutions endowed with vector hairs induced by the quartic-order coupling.
|
gr-qc astro-ph.CO hep-ph hep-th
|
the generalized proca theories with secondorder equations of motion can be healthily extended to a more general framework in which the number of propagating degrees of freedom remains unchanged in the presence of a quarticorder nonminimal coupling to gravity arising in beyondgeneralized proca theories the speed of gravitational waves c_t on the friedmannlemaitrerobertsonwalker flrw cosmological background can be equal to that of light c under a certain condition by using this condition alone we show that the speed of gravitational waves in the vicinity of static and spherically symmetric black holes is also equivalent to c for the propagation of oddparity perturbations along both radial and angular directions as a byproduct the black holes arising in our beyondgeneralized proca theories are plagued by neither ghost nor laplacian instabilities against oddparity perturbations we show the existence of both exact and numerical black hole solutions endowed with vector hairs induced by the quarticorder coupling
|
[['the', 'generalized', 'proca', 'theories', 'with', 'secondorder', 'equations', 'of', 'motion', 'can', 'be', 'healthily', 'extended', 'to', 'a', 'more', 'general', 'framework', 'in', 'which', 'the', 'number', 'of', 'propagating', 'degrees', 'of', 'freedom', 'remains', 'unchanged', 'in', 'the', 'presence', 'of', 'a', 'quarticorder', 'nonminimal', 'coupling', 'to', 'gravity', 'arising', 'in', 'beyondgeneralized', 'proca', 'theories', 'the', 'speed', 'of', 'gravitational', 'waves', 'c_t', 'on', 'the', 'friedmannlemaitrerobertsonwalker', 'flrw', 'cosmological', 'background', 'can', 'be', 'equal', 'to', 'that', 'of', 'light', 'c', 'under', 'a', 'certain', 'condition', 'by', 'using', 'this', 'condition', 'alone', 'we', 'show', 'that', 'the', 'speed', 'of', 'gravitational', 'waves', 'in', 'the', 'vicinity', 'of', 'static', 'and', 'spherically', 'symmetric', 'black', 'holes', 'is', 'also', 'equivalent', 'to', 'c', 'for', 'the', 'propagation', 'of', 'oddparity', 'perturbations', 'along', 'both', 'radial', 'and', 'angular', 'directions', 'as', 'a', 'byproduct', 'the', 'black', 'holes', 'arising', 'in', 'our', 'beyondgeneralized', 'proca', 'theories', 'are', 'plagued', 'by', 'neither', 'ghost', 'nor', 'laplacian', 'instabilities', 'against', 'oddparity', 'perturbations', 'we', 'show', 'the', 'existence', 'of', 'both', 'exact', 'and', 'numerical', 'black', 'hole', 'solutions', 'endowed', 'with', 'vector', 'hairs', 'induced', 'by', 'the', 'quarticorder', 'coupling']]
|
[-0.2195098659837018, 0.16839072128488242, -0.04451228589689555, 0.08123508734953296, -0.10947594362139505, -0.13626263332308122, -0.056885061833063924, 0.28344720481943925, -0.2010134637576381, -0.2597857585366766, 0.06367070047341067, -0.2703343170854312, -0.13974308851481365, 0.14998826952528602, -0.011073960695954921, 0.015828009400712818, -0.012162536113081794, 0.041876010703976806, -0.09655590633261263, -0.2170416603085438, 0.376131716233335, 0.0505630879327471, 0.21715969989983072, 0.014527350634652018, 0.09485615631504181, -0.011812624855481676, 0.03280541148514634, 0.0971723611812769, -0.11261423972581197, 0.05256711219676378, 0.17053044586665286, 0.11601634747287455, 0.2007625452370121, -0.42932219458376303, -0.2725681681737402, 0.09036870841794696, 0.15275870275830752, 0.18960979570080158, -0.07074570552092489, -0.3285649432953888, 0.09326951721021415, -0.17246477795446194, -0.203297663797122, -0.06433725223024866, 0.013422769074646854, -0.010285438914587232, -0.23581389544874823, 0.16064021501389156, 0.06288656244501717, -0.04229629236445027, -0.11268611125476462, -0.024179208379600345, -0.08964590095810739, 0.005551425139664819, 0.15062748932733053, 0.045855198208683806, 0.10499510606429172, -0.15655997112595574, -0.12041576583502128, 0.39375196899115844, -0.1539292973343675, -0.282796734796935, 0.15825522200841652, -0.1820807677644265, -0.08112736060406621, 0.11123085406602752, 0.15700652697552486, 0.19210081556689387, -0.11064057615524354, 0.15518372633232502, 0.009946819070089413, 0.1435787553851505, 0.15353856401481225, 0.061237680752176525, 0.33424548152221467, 0.0346187433644541, 0.026111011759463797, 0.1271967377458503, -0.030462409790887154, -0.09434054035840458, -0.36914577064300447, -0.09461833427562133, -0.10575631886297886, 0.09049007710248254, -0.15707323260846207, -0.20092561940883139, 0.3445837975105908, 0.12770480910656165, 0.10077512181841915, 0.045905923637052946, 0.242617968487713, 0.07882739679955289, 0.03405080324094007, 0.11940176059847306, 0.34042699996529047, 0.1908990335022712, 0.08076046713119324, -0.2528714361251332, -0.051015785997917285, 0.06625859121375374]
|
1,803.06336
|
Applying the Delta method in metric analytics: A practical guide with
novel ideas
|
During the last decade, the information technology industry has adopted a
data-driven culture, relying on online metrics to measure and monitor business
performance. Under the setting of big data, the majority of such metrics
approximately follow normal distributions, opening up potential opportunities
to model them directly without extra model assumptions and solve big data
problems via closed-form formulas using distributed algorithms at a fraction of
the cost of simulation-based procedures like bootstrap. However, certain
attributes of the metrics, such as their corresponding data generating
processes and aggregation levels, pose numerous challenges for constructing
trustworthy estimation and inference procedures. Motivated by four real-life
examples in metric development and analytics for large-scale A/B testing, we
provide a practical guide to applying the Delta method, one of the most
important tools from the classic statistics literature, to address the
aforementioned challenges. We emphasize the central role of the Delta method in
metric analytics by highlighting both its classic and novel applications.
|
stat.AP
|
during the last decade the information technology industry has adopted a datadriven culture relying on online metrics to measure and monitor business performance under the setting of big data the majority of such metrics approximately follow normal distributions opening up potential opportunities to model them directly without extra model assumptions and solve big data problems via closedform formulas using distributed algorithms at a fraction of the cost of simulationbased procedures like bootstrap however certain attributes of the metrics such as their corresponding data generating processes and aggregation levels pose numerous challenges for constructing trustworthy estimation and inference procedures motivated by four reallife examples in metric development and analytics for largescale ab testing we provide a practical guide to applying the delta method one of the most important tools from the classic statistics literature to address the aforementioned challenges we emphasize the central role of the delta method in metric analytics by highlighting both its classic and novel applications
|
[['during', 'the', 'last', 'decade', 'the', 'information', 'technology', 'industry', 'has', 'adopted', 'a', 'datadriven', 'culture', 'relying', 'on', 'online', 'metrics', 'to', 'measure', 'and', 'monitor', 'business', 'performance', 'under', 'the', 'setting', 'of', 'big', 'data', 'the', 'majority', 'of', 'such', 'metrics', 'approximately', 'follow', 'normal', 'distributions', 'opening', 'up', 'potential', 'opportunities', 'to', 'model', 'them', 'directly', 'without', 'extra', 'model', 'assumptions', 'and', 'solve', 'big', 'data', 'problems', 'via', 'closedform', 'formulas', 'using', 'distributed', 'algorithms', 'at', 'a', 'fraction', 'of', 'the', 'cost', 'of', 'simulationbased', 'procedures', 'like', 'bootstrap', 'however', 'certain', 'attributes', 'of', 'the', 'metrics', 'such', 'as', 'their', 'corresponding', 'data', 'generating', 'processes', 'and', 'aggregation', 'levels', 'pose', 'numerous', 'challenges', 'for', 'constructing', 'trustworthy', 'estimation', 'and', 'inference', 'procedures', 'motivated', 'by', 'four', 'reallife', 'examples', 'in', 'metric', 'development', 'and', 'analytics', 'for', 'largescale', 'ab', 'testing', 'we', 'provide', 'a', 'practical', 'guide', 'to', 'applying', 'the', 'delta', 'method', 'one', 'of', 'the', 'most', 'important', 'tools', 'from', 'the', 'classic', 'statistics', 'literature', 'to', 'address', 'the', 'aforementioned', 'challenges', 'we', 'emphasize', 'the', 'central', 'role', 'of', 'the', 'delta', 'method', 'in', 'metric', 'analytics', 'by', 'highlighting', 'both', 'its', 'classic', 'and', 'novel', 'applications']]
|
[-0.05249251377852811, -0.00871630106931788, -0.052279524696707914, 0.09282662597878341, -0.1030231317169257, -0.16105115334680187, 0.08357961469954706, 0.3829734710316303, -0.28935686180948667, -0.35468850260647605, 0.14922377868419914, -0.2847013025543847, -0.1646840958089768, 0.25061480968872296, -0.1009327768272819, 0.12779447185045073, 0.09539498559411473, 0.004997811019545881, -0.07021347862186464, -0.2578345553203828, 0.3208967760880183, 0.05661463442618098, 0.35467287812741544, 0.04783953593187683, 0.08326258323128818, 0.008742995020827348, -0.09483228263126899, -0.01012413558193565, -0.12471279458590795, 0.17504355876965896, 0.299124659248333, 0.24099958119059242, 0.36765443014652954, -0.4201249577623757, -0.20812186581683875, 0.10853675965078269, 0.12005592244854078, 0.07290554589214676, -0.07596326643922308, -0.284162198611877, 0.06912183164415552, -0.16628218826224817, -0.11774013046752897, -0.11324607585173666, -0.01656495989595033, 0.01248376063937675, -0.25883841202771174, 0.037337353346940085, 0.019935294956298946, 0.07045792711639329, -0.02516069674873253, -0.1286422810841446, 0.05408782734170179, 0.17403999135735196, 0.08456986959540297, -0.010714382770960514, 0.1415581465733777, -0.17408871047730745, -0.16548247258119944, 0.3814143358399691, -0.004237192657870488, -0.17545744683740871, 0.16178568840303895, -0.050584513838461874, -0.1851974909128975, 0.06744936159281414, 0.2102778438711539, 0.09399703492357431, -0.2090577972040488, 0.08350113402282866, 0.05742326444398046, 0.10798859629850788, 0.044878038878352206, -0.0014180067242889464, 0.1836149326254484, 0.20108266441811679, 0.06857671500832031, 0.09267779927453192, -0.07135039934600391, -0.11821268601018842, -0.2465153733928558, -0.13152406230580674, -0.12683322713887202, -0.0016180204133255571, -0.14049885210914898, -0.17052564822885952, 0.3684248617007338, 0.19605160420436318, 0.17141812719416485, 0.030670519647058806, 0.3395208888981916, 0.061337788546563986, 0.07990889213912931, 0.0786034953367861, 0.17445136474805023, 0.06812994495399674, 0.13691167063536594, -0.13058115180458024, 0.09963921263896494, 0.006827676534664499]
|
1,803.06337
|
Electro-rheological fluids under random influences: martingale and
strong solutions
|
We study generalised Navier--Stokes equations governing the motion of an
electro-rheological fluid subject to stochastic perturbation. Stochastic
effects are implemented through (i) random initial data, (ii) a forcing term in
the momentum equation represented by a multiplicative white noise and (iii) a
random character of the variable exponent $p=p(\omega,t,x)$ (as a result of a
random electric field). We show the existence of a weak martingale solution
provided the variable exponent satisfies $p\geq p^->\frac{3n}{n+2}$ ($p^->1$ in
two dimensions). Under additional assumptions we obtain also pathwise
solutions.
|
math.AP
|
we study generalised navierstokes equations governing the motion of an electrorheological fluid subject to stochastic perturbation stochastic effects are implemented through i random initial data ii a forcing term in the momentum equation represented by a multiplicative white noise and iii a random character of the variable exponent ppomegatx as a result of a random electric field we show the existence of a weak martingale solution provided the variable exponent satisfies pgeq pfrac3nn2 p1 in two dimensions under additional assumptions we obtain also pathwise solutions
|
[['we', 'study', 'generalised', 'navierstokes', 'equations', 'governing', 'the', 'motion', 'of', 'an', 'electrorheological', 'fluid', 'subject', 'to', 'stochastic', 'perturbation', 'stochastic', 'effects', 'are', 'implemented', 'through', 'i', 'random', 'initial', 'data', 'ii', 'a', 'forcing', 'term', 'in', 'the', 'momentum', 'equation', 'represented', 'by', 'a', 'multiplicative', 'white', 'noise', 'and', 'iii', 'a', 'random', 'character', 'of', 'the', 'variable', 'exponent', 'ppomegatx', 'as', 'a', 'result', 'of', 'a', 'random', 'electric', 'field', 'we', 'show', 'the', 'existence', 'of', 'a', 'weak', 'martingale', 'solution', 'provided', 'the', 'variable', 'exponent', 'satisfies', 'pgeq', 'pfrac3nn2', 'p1', 'in', 'two', 'dimensions', 'under', 'additional', 'assumptions', 'we', 'obtain', 'also', 'pathwise', 'solutions']]
|
[-0.20064159864223147, 0.11257626253326777, -0.10368002636964063, 0.07634644629433751, -0.07047971032408391, -0.1658503312774631, 0.03351745487426419, 0.286643161951755, -0.32664239765649816, -0.2008417255346136, 0.11146822617479028, -0.25029174325965253, -0.14999993012499918, 0.1356706196689103, -0.07057230873804832, 0.07073619475318904, 0.031638639165559805, 0.020863356382210166, -0.02260402071532367, -0.23160808053181833, 0.33987951516847026, -0.04034659738304565, 0.21415916247944156, -0.047475491721233554, 0.18710220840911054, -0.008199309857270444, -0.05091243957629405, 0.06953456073281276, -0.17528420077154347, 0.010769319825760841, 0.1605122137186398, 0.037725588907094966, 0.3236242483751512, -0.4239948196056108, -0.22927162530327058, 0.08875071747138737, 0.09618366611153673, 0.09359939596110797, -0.05508352707263576, -0.300496877451618, 0.08099945521273885, -0.14497591008667846, -0.20775689643033476, -0.0776917473917984, 0.0358423144929672, 0.11349507222928286, -0.3878268818314894, 0.13166921934448125, 0.15625338063923172, 0.04547616408672184, -0.13511429057759514, -0.09012387517323515, 0.009108438481947026, 0.028949464805962808, 0.08636313880771308, 0.012113096700218248, 0.10086106598736291, -0.15802983693913164, -0.0879529326402369, 0.3322166414680352, -0.156200448006212, -0.317589163394499, 0.12121723289320986, -0.1196817696229162, -0.12117573633475835, 0.12193422376301634, 0.16745469594060117, 0.11187516059726477, -0.18848584791510758, 0.14746373337174554, -0.03287004622215607, 0.17605244922900506, 0.06826564505225025, 0.006440272762339158, 0.09156079154955335, 0.1088133213272969, 0.10575806972267757, 0.15297558429056263, -0.06403604409999651, -0.1372876647265112, -0.3660354186073843, -0.12244635135922806, -0.16889874995068974, 0.16444428701301567, -0.17648272257679035, -0.20277982680912476, 0.34089962721813516, 0.13444105687786836, 0.13370703193302974, 0.04957110305731914, 0.21389651476932936, 0.1959736131297155, -0.055836101337504315, 0.09018377912601075, 0.1546728522797306, 0.20576937848432775, 0.135551441522562, -0.19845308613099427, 0.05572096276355077, 0.1351053642743009]
|
1,803.06338
|
Elliptic flow in a strongly-interacting normal Bose gas
|
We study the anisotropic, elliptic expansion of a thermal atomic Bose gas
released from an anisotropic trapping potential, for a wide range of
interaction strengths across a Feshbach resonance. We show that in our system
this hydrodynamic phenomenon is for all interaction strengths fully described
by a microscopic kinetic model with no free parameters. The success of this
description crucially relies on taking into account the reduced thermalising
power of elastic collisions in a strongly interacting gas, for which we derive
an analytical theory. We also perform time-resolved measurements that directly
reveal the dynamics of the energy transfer between the different expansion
axes.
|
cond-mat.quant-gas cond-mat.stat-mech physics.atom-ph physics.plasm-ph quant-ph
|
we study the anisotropic elliptic expansion of a thermal atomic bose gas released from an anisotropic trapping potential for a wide range of interaction strengths across a feshbach resonance we show that in our system this hydrodynamic phenomenon is for all interaction strengths fully described by a microscopic kinetic model with no free parameters the success of this description crucially relies on taking into account the reduced thermalising power of elastic collisions in a strongly interacting gas for which we derive an analytical theory we also perform timeresolved measurements that directly reveal the dynamics of the energy transfer between the different expansion axes
|
[['we', 'study', 'the', 'anisotropic', 'elliptic', 'expansion', 'of', 'a', 'thermal', 'atomic', 'bose', 'gas', 'released', 'from', 'an', 'anisotropic', 'trapping', 'potential', 'for', 'a', 'wide', 'range', 'of', 'interaction', 'strengths', 'across', 'a', 'feshbach', 'resonance', 'we', 'show', 'that', 'in', 'our', 'system', 'this', 'hydrodynamic', 'phenomenon', 'is', 'for', 'all', 'interaction', 'strengths', 'fully', 'described', 'by', 'a', 'microscopic', 'kinetic', 'model', 'with', 'no', 'free', 'parameters', 'the', 'success', 'of', 'this', 'description', 'crucially', 'relies', 'on', 'taking', 'into', 'account', 'the', 'reduced', 'thermalising', 'power', 'of', 'elastic', 'collisions', 'in', 'a', 'strongly', 'interacting', 'gas', 'for', 'which', 'we', 'derive', 'an', 'analytical', 'theory', 'we', 'also', 'perform', 'timeresolved', 'measurements', 'that', 'directly', 'reveal', 'the', 'dynamics', 'of', 'the', 'energy', 'transfer', 'between', 'the', 'different', 'expansion', 'axes']]
|
[-0.13353353216498187, 0.15639874929798434, -0.09970787949679256, 0.028559519505824495, -0.017341641008456067, -0.08813963834539924, -0.010000197728869767, 0.3591373721318482, -0.26170294551242107, -0.28343090943051774, -0.014422300174488749, -0.25230321178701026, -0.08690764983772363, 0.20432839427794358, 0.09396233140192564, -0.014766325152397734, 0.06899635736984246, -0.006315655377919524, -0.05779598689484365, -0.1702614856051881, 0.323820790646652, 0.07063009501440513, 0.2656633906174921, 0.11876589676717893, 0.09967137890804595, 0.05881034429591981, 0.031083239784952508, 0.016339797485909125, -0.19158246425656913, 0.11780072381359398, 0.19690398620645, 0.014800980339025698, 0.22300663817384578, -0.43941124298980516, -0.27184602698690974, 0.06828762975168749, 0.16103949829104167, 0.15258041091457697, -0.07698412442656723, -0.2558326879787503, -0.02174040994344695, -0.2203571453952746, -0.1384583646250726, -0.109197950169209, 0.019920244315657223, 0.055864528663573984, -0.2884157981307616, 0.11060735576834702, 0.05673074779932577, 0.08527099948322166, -0.12844644981273676, -0.05454910771121063, 0.0093388730904214, 0.09251562542128332, -0.008941644283906711, -0.026219583791228535, 0.1548717826066846, -0.1487862597122445, -0.03717116418846168, 0.37738675479460687, -0.10494425873615716, -0.16127551813173058, 0.21228973628971184, -0.14513470445651092, -0.08922229729393877, 0.16857322067637176, 0.18719501336313132, 0.09052460821508204, -0.1942672831847251, 0.06622429243386418, -0.03599565048155022, 0.1765543479377458, -0.0013623941888652959, 0.012767095330117035, 0.23798901661868813, 0.16973500383692314, -0.016367884990261886, 0.13578945839578666, -0.07594133760933809, -0.13730058512758933, -0.29922427329714, -0.11568890203658527, -0.19873691176276798, 0.06906832024473154, -0.0794808781090943, -0.1627298733875047, 0.3907012473430159, 0.17843862094925445, 0.24320587984204872, -0.0031881908362265676, 0.30670600111406404, 0.13753812133506374, 0.044844812112272654, 0.03763784396064296, 0.2994747128862056, 0.13098793467551975, 0.07944849286300754, -0.30384802490300994, 0.005412861031199832, 0.04752708031814003]
|
1,803.06339
|
A time dependent Stokes interface problem: well-posedness and space-time
finite element discretization
|
In this paper a time dependent Stokes problem that is motivated by a standard
sharp interface model for the fluid dynamics of two-phase flows is studied.
This Stokes interface problem has discontinuous density and viscosity
coefficients and a pressure solution that is discontinuous across an evolving
interface. This strongly simplified two-phase Stokes equation is considered to
be a good model problem for the development and analysis of finite element
discretization methods for two-phase flow problems. In view of the unfitted
finite element methods that are often used for two-phase flow simulations, we
are particularly interested in a well-posed variational formulation of this
Stokes interface problem in a Euclidean setting. Such well-posed weak
formulations, which are not known in the literature, are the main results of
this paper. Different variants are considered, namely one with suitable spaces
of divergence free functions, a discrete-in-time version of it, and variants in
which the divergence free constraint in the solution space is treated by a
pressure Lagrange multiplier. The discrete-in-time variational formulation
involving the pressure variable for the divergence free constraint is a natural
starting point for a space-time finite element discretization. Such a method is
introduced and results of numerical experiments with this method are presented.
|
math.NA
|
in this paper a time dependent stokes problem that is motivated by a standard sharp interface model for the fluid dynamics of twophase flows is studied this stokes interface problem has discontinuous density and viscosity coefficients and a pressure solution that is discontinuous across an evolving interface this strongly simplified twophase stokes equation is considered to be a good model problem for the development and analysis of finite element discretization methods for twophase flow problems in view of the unfitted finite element methods that are often used for twophase flow simulations we are particularly interested in a wellposed variational formulation of this stokes interface problem in a euclidean setting such wellposed weak formulations which are not known in the literature are the main results of this paper different variants are considered namely one with suitable spaces of divergence free functions a discreteintime version of it and variants in which the divergence free constraint in the solution space is treated by a pressure lagrange multiplier the discreteintime variational formulation involving the pressure variable for the divergence free constraint is a natural starting point for a spacetime finite element discretization such a method is introduced and results of numerical experiments with this method are presented
|
[['in', 'this', 'paper', 'a', 'time', 'dependent', 'stokes', 'problem', 'that', 'is', 'motivated', 'by', 'a', 'standard', 'sharp', 'interface', 'model', 'for', 'the', 'fluid', 'dynamics', 'of', 'twophase', 'flows', 'is', 'studied', 'this', 'stokes', 'interface', 'problem', 'has', 'discontinuous', 'density', 'and', 'viscosity', 'coefficients', 'and', 'a', 'pressure', 'solution', 'that', 'is', 'discontinuous', 'across', 'an', 'evolving', 'interface', 'this', 'strongly', 'simplified', 'twophase', 'stokes', 'equation', 'is', 'considered', 'to', 'be', 'a', 'good', 'model', 'problem', 'for', 'the', 'development', 'and', 'analysis', 'of', 'finite', 'element', 'discretization', 'methods', 'for', 'twophase', 'flow', 'problems', 'in', 'view', 'of', 'the', 'unfitted', 'finite', 'element', 'methods', 'that', 'are', 'often', 'used', 'for', 'twophase', 'flow', 'simulations', 'we', 'are', 'particularly', 'interested', 'in', 'a', 'wellposed', 'variational', 'formulation', 'of', 'this', 'stokes', 'interface', 'problem', 'in', 'a', 'euclidean', 'setting', 'such', 'wellposed', 'weak', 'formulations', 'which', 'are', 'not', 'known', 'in', 'the', 'literature', 'are', 'the', 'main', 'results', 'of', 'this', 'paper', 'different', 'variants', 'are', 'considered', 'namely', 'one', 'with', 'suitable', 'spaces', 'of', 'divergence', 'free', 'functions', 'a', 'discreteintime', 'version', 'of', 'it', 'and', 'variants', 'in', 'which', 'the', 'divergence', 'free', 'constraint', 'in', 'the', 'solution', 'space', 'is', 'treated', 'by', 'a', 'pressure', 'lagrange', 'multiplier', 'the', 'discreteintime', 'variational', 'formulation', 'involving', 'the', 'pressure', 'variable', 'for', 'the', 'divergence', 'free', 'constraint', 'is', 'a', 'natural', 'starting', 'point', 'for', 'a', 'spacetime', 'finite', 'element', 'discretization', 'such', 'a', 'method', 'is', 'introduced', 'and', 'results', 'of', 'numerical', 'experiments', 'with', 'this', 'method', 'are', 'presented']]
|
[-0.10182016126907847, 0.0916255422899519, -0.10098924426582133, 0.045679816616621106, -0.07483653903117614, -0.14430698331014202, -0.031556705892627386, 0.3497455428111289, -0.32795362363528147, -0.23976390799186353, 0.15275819645563754, -0.24137396224788182, -0.1292776956768899, 0.18351783863328433, -0.08340302139538996, 0.10608988088954772, 0.07452323984152871, -0.016223066852187447, -0.08938727414882353, -0.18666465866741877, 0.34488329678094887, -0.011009985113085197, 0.2761099410651646, 0.050220119230118876, 0.13246853239008505, -0.0369072821096797, -0.02856470827985867, 0.11069226776249133, -0.14962525240410426, 0.08706179056591883, 0.2802818084154003, 0.05650675159608349, 0.31583255069706534, -0.3959379261371042, -0.2909549920787585, 0.07499543890607052, 0.11692547708006548, 0.10353994547398623, -0.09407432744132695, -0.22490545339295137, 0.08452856561783793, -0.12853758398608622, -0.12309265036246018, -0.0386547090283829, -0.01958041754207147, 0.017320172948386576, -0.3277449536852979, 0.11404926789204219, 0.03499405994194702, 0.0566286816952172, -0.10425013760242409, -0.09088176279558154, 0.02895895226656693, 0.059024873504178885, 0.05263160844218775, 0.02871800339241682, 0.06033549852912392, -0.10956831577605582, -0.05270557001168872, 0.42010884860007486, -0.06916596750118609, -0.30838476302184786, 0.19847980202428006, -0.06656638741162904, -0.10920438894387242, 0.13235241636230147, 0.1607463947862038, 0.20241772357301024, -0.16989329754572197, 0.116165698760274, -0.08008548514883085, 0.13438889263682366, 0.02952681087631861, -0.07230863507534263, 0.09586330993890102, 0.1684838004359801, 0.1206492925661483, 0.12132752401320714, -0.034885765151969464, -0.14710753609562807, -0.3551511836967665, -0.1895419329673217, -0.18428408286965503, -0.03439805157225421, -0.10037210292325945, -0.22202725363941175, 0.34897479118338876, 0.12676982495823663, 0.1239623657159342, 0.01598929246561258, 0.29952252614587144, 0.18182455875860354, -0.005966863473372653, 0.08635472422557439, 0.19471492526107675, 0.14351152466481615, 0.14511810294742433, -0.20860341712694816, 0.039158278245827544, 0.17364553464553664]
|
1,803.0634
|
Faces as Lighting Probes via Unsupervised Deep Highlight Extraction
|
We present a method for estimating detailed scene illumination using human
faces in a single image. In contrast to previous works that estimate lighting
in terms of low-order basis functions or distant point lights, our technique
estimates illumination at a higher precision in the form of a non-parametric
environment map. Based on the observation that faces can exhibit strong
highlight reflections from a broad range of lighting directions, we propose a
deep neural network for extracting highlights from faces, and then trace these
reflections back to the scene to acquire the environment map. Since real
training data for highlight extraction is very limited, we introduce an
unsupervised scheme for finetuning the network on real images, based on the
consistent diffuse chromaticity of a given face seen in multiple real images.
In tracing the estimated highlights to the environment, we reduce the blurring
effect of skin reflectance on reflected light through a deconvolution
determined by prior knowledge on face material properties. Comparisons to
previous techniques for highlight extraction and illumination estimation show
the state-of-the-art performance of this approach on a variety of indoor and
outdoor scenes.
|
cs.CV
|
we present a method for estimating detailed scene illumination using human faces in a single image in contrast to previous works that estimate lighting in terms of loworder basis functions or distant point lights our technique estimates illumination at a higher precision in the form of a nonparametric environment map based on the observation that faces can exhibit strong highlight reflections from a broad range of lighting directions we propose a deep neural network for extracting highlights from faces and then trace these reflections back to the scene to acquire the environment map since real training data for highlight extraction is very limited we introduce an unsupervised scheme for finetuning the network on real images based on the consistent diffuse chromaticity of a given face seen in multiple real images in tracing the estimated highlights to the environment we reduce the blurring effect of skin reflectance on reflected light through a deconvolution determined by prior knowledge on face material properties comparisons to previous techniques for highlight extraction and illumination estimation show the stateoftheart performance of this approach on a variety of indoor and outdoor scenes
|
[['we', 'present', 'a', 'method', 'for', 'estimating', 'detailed', 'scene', 'illumination', 'using', 'human', 'faces', 'in', 'a', 'single', 'image', 'in', 'contrast', 'to', 'previous', 'works', 'that', 'estimate', 'lighting', 'in', 'terms', 'of', 'loworder', 'basis', 'functions', 'or', 'distant', 'point', 'lights', 'our', 'technique', 'estimates', 'illumination', 'at', 'a', 'higher', 'precision', 'in', 'the', 'form', 'of', 'a', 'nonparametric', 'environment', 'map', 'based', 'on', 'the', 'observation', 'that', 'faces', 'can', 'exhibit', 'strong', 'highlight', 'reflections', 'from', 'a', 'broad', 'range', 'of', 'lighting', 'directions', 'we', 'propose', 'a', 'deep', 'neural', 'network', 'for', 'extracting', 'highlights', 'from', 'faces', 'and', 'then', 'trace', 'these', 'reflections', 'back', 'to', 'the', 'scene', 'to', 'acquire', 'the', 'environment', 'map', 'since', 'real', 'training', 'data', 'for', 'highlight', 'extraction', 'is', 'very', 'limited', 'we', 'introduce', 'an', 'unsupervised', 'scheme', 'for', 'finetuning', 'the', 'network', 'on', 'real', 'images', 'based', 'on', 'the', 'consistent', 'diffuse', 'chromaticity', 'of', 'a', 'given', 'face', 'seen', 'in', 'multiple', 'real', 'images', 'in', 'tracing', 'the', 'estimated', 'highlights', 'to', 'the', 'environment', 'we', 'reduce', 'the', 'blurring', 'effect', 'of', 'skin', 'reflectance', 'on', 'reflected', 'light', 'through', 'a', 'deconvolution', 'determined', 'by', 'prior', 'knowledge', 'on', 'face', 'material', 'properties', 'comparisons', 'to', 'previous', 'techniques', 'for', 'highlight', 'extraction', 'and', 'illumination', 'estimation', 'show', 'the', 'stateoftheart', 'performance', 'of', 'this', 'approach', 'on', 'a', 'variety', 'of', 'indoor', 'and', 'outdoor', 'scenes']]
|
[-0.0549720515471858, -0.00874854766416074, -0.07962072406316528, 0.02842251013058263, -0.07310317508574272, -0.10518222645529218, 0.03908080886042602, 0.4699028944042889, -0.2491076380769546, -0.3333558456217115, 0.09289961638105278, -0.2614816457989651, -0.17387330003013532, 0.22427746009559849, -0.18691323399040344, 0.04664952921165103, 0.11591943995146131, -0.00459253231717928, -0.0849362461362034, -0.20262717762458565, 0.3283432598345334, 0.013608885831923248, 0.31121146444835374, 0.0486477138826976, 0.15065485420070487, 0.022056326684164438, -0.07916570760913798, -0.027584167797672185, -0.034433396815438756, 0.1574187042179039, 0.25835156902746376, 0.15198692468913724, 0.23199304650109764, -0.4215519048412003, -0.27625112636518234, 0.06268761059319651, 0.11470757933786592, 0.10563375614709347, -0.09244910053329895, -0.36156325887737645, 0.06946325368826857, -0.08735102468698815, -0.052193890428925686, -0.08356582632892438, -0.029380296143338185, -0.03169981047913835, -0.2839346490296963, 0.03424604569083533, 0.02512526334942998, 0.1222198348221797, -0.07091050834420162, -0.11695735309826764, 0.04273467000850753, 0.17221242813519327, 0.011290209464779174, 0.03762601697439882, 0.16691341702700466, -0.20593388284355202, -0.06825820383036861, 0.3879707513830146, -0.0731748380824118, -0.20543353635915304, 0.19852156426153472, -0.1270629349063981, -0.10761220758227077, 0.13942000481427483, 0.2454087535520336, 0.12694723245662612, -0.14534908112742612, 0.0009302956974007995, -0.0603362688593365, 0.16409949435352197, 0.07351682580302696, 0.00971891381148551, 0.20550576458540368, 0.20206162533848673, 0.06031091759937841, 0.1484676585281016, -0.18907118789297905, -0.008566908510653554, -0.23540951787726955, -0.09157484530477558, -0.20845549372402397, -0.007305547383588714, -0.11417987082834746, -0.1582654874620808, 0.41323391426725525, 0.25438290968587673, 0.25278045062756016, 0.056799249315785394, 0.3757816580602446, 0.0386875126454224, 0.08655559497608527, 0.020823328937026295, 0.19938904796160656, 0.031179046218371573, 0.11420704879722482, -0.18403313682553032, 0.08871360364546244, 0.022277101596213274]
|
1,803.06341
|
Distributed Transactions: Dissecting the Nightmare
|
Many distributed storage systems are transactional and a lot of work has been
devoted to optimizing their performance, especially the performance of
read-only transactions that are considered the most frequent in practice. Yet,
the results obtained so far are rather disappointing, and some of the design
decisions seem contrived. This paper contributes to explaining this state of
affairs by proving intrinsic limitations of transactional storage systems, even
those that need not ensure strong consistency but only causality.
We first consider general storage systems where some transactions are
read-only and some also involve write operations. We show that even read-only
transactions cannot be "fast": their operations cannot be executed within one
round-trip message exchange between a client seeking an object and the server
storing it. We then consider systems (as sometimes implemented today) where all
transactions are read-only, i.e., updates are performed as individual
operations outside transactions. In this case, read-only transactions can
indeed be "fast", but we prove that they need to be "visible". They induce
inherent updates on the servers, which in turn impact their overall
performance.
|
cs.DC
|
many distributed storage systems are transactional and a lot of work has been devoted to optimizing their performance especially the performance of readonly transactions that are considered the most frequent in practice yet the results obtained so far are rather disappointing and some of the design decisions seem contrived this paper contributes to explaining this state of affairs by proving intrinsic limitations of transactional storage systems even those that need not ensure strong consistency but only causality we first consider general storage systems where some transactions are readonly and some also involve write operations we show that even readonly transactions cannot be fast their operations cannot be executed within one roundtrip message exchange between a client seeking an object and the server storing it we then consider systems as sometimes implemented today where all transactions are readonly ie updates are performed as individual operations outside transactions in this case readonly transactions can indeed be fast but we prove that they need to be visible they induce inherent updates on the servers which in turn impact their overall performance
|
[['many', 'distributed', 'storage', 'systems', 'are', 'transactional', 'and', 'a', 'lot', 'of', 'work', 'has', 'been', 'devoted', 'to', 'optimizing', 'their', 'performance', 'especially', 'the', 'performance', 'of', 'readonly', 'transactions', 'that', 'are', 'considered', 'the', 'most', 'frequent', 'in', 'practice', 'yet', 'the', 'results', 'obtained', 'so', 'far', 'are', 'rather', 'disappointing', 'and', 'some', 'of', 'the', 'design', 'decisions', 'seem', 'contrived', 'this', 'paper', 'contributes', 'to', 'explaining', 'this', 'state', 'of', 'affairs', 'by', 'proving', 'intrinsic', 'limitations', 'of', 'transactional', 'storage', 'systems', 'even', 'those', 'that', 'need', 'not', 'ensure', 'strong', 'consistency', 'but', 'only', 'causality', 'we', 'first', 'consider', 'general', 'storage', 'systems', 'where', 'some', 'transactions', 'are', 'readonly', 'and', 'some', 'also', 'involve', 'write', 'operations', 'we', 'show', 'that', 'even', 'readonly', 'transactions', 'can', 'not', 'be', 'fast', 'their', 'operations', 'can', 'not', 'be', 'executed', 'within', 'one', 'roundtrip', 'message', 'exchange', 'between', 'a', 'client', 'seeking', 'an', 'object', 'and', 'the', 'server', 'storing', 'it', 'we', 'then', 'consider', 'systems', 'as', 'sometimes', 'implemented', 'today', 'where', 'all', 'transactions', 'are', 'readonly', 'ie', 'updates', 'are', 'performed', 'as', 'individual', 'operations', 'outside', 'transactions', 'in', 'this', 'case', 'readonly', 'transactions', 'can', 'indeed', 'be', 'fast', 'but', 'we', 'prove', 'that', 'they', 'need', 'to', 'be', 'visible', 'they', 'induce', 'inherent', 'updates', 'on', 'the', 'servers', 'which', 'in', 'turn', 'impact', 'their', 'overall', 'performance']]
|
[-0.19949662254398895, 0.09588294155554548, -0.053863832305392455, 0.08336864450765359, -0.1154073605637273, -0.2162478050786174, 0.09896225688733264, 0.42166956487926655, -0.3029315563804832, -0.32613981241463785, 0.19306592709035614, -0.25862371193684847, -0.12482265011252215, 0.1732711831961448, -0.14627076934363384, 0.049571386580484815, 0.09879174071312365, 0.04862147365282807, -0.006796809915330312, -0.3642302825025076, 0.21533236655652419, 0.04696874517119593, 0.25945755360751516, 0.04738725495861015, 0.006194126194653412, -0.004951734695997503, -0.02784703008752937, 0.022833666407192747, -0.009799983667552524, 0.09050290987037847, 0.3264252038517346, 0.20264600695421298, 0.3033167894231156, -0.5338189190460576, -0.14289905440010545, 0.13561524806104394, 0.1558407137118694, 0.0930966708518099, -0.025391330680577084, -0.2436896423744555, 0.11646753918483026, -0.20911922802527746, -0.0233943803108155, -0.15375626206967152, -0.00027277121682547863, 0.037780625342080994, -0.2252807735853518, -0.020293551001911207, 0.07004322117298013, 0.03390033149238055, 0.008990284579340369, -0.06584403298523588, 0.008785336115397512, 0.15092797765973956, 0.050270747798236294, -0.023955835555938797, 0.15961921638550444, -0.0913825663130006, -0.13389502400273665, 0.4187454977279736, 0.044099350434003606, -0.19320297081851298, 0.19200731890741735, -0.09081909312970109, -0.18420993824385934, 0.08337447680856308, 0.15764971860399885, 0.08747015961756309, -0.1974452729957799, 0.07050265137804672, -0.02927384546492249, 0.2117340476203632, 0.09374528884137463, 0.14678049651783012, 0.18708492744998592, 0.12379754322787953, 0.0714281511645014, 0.08443431715067062, 0.008425660867295745, -0.12197362649151021, -0.2607619063773503, -0.15451439929957916, -0.18201503926910745, 0.010099601849247443, -0.04016563948793595, -0.14890072111350794, 0.30104797984369924, 0.2047830815375265, 0.16259290531743317, 0.04862742507636237, 0.35467301052477623, 0.0689126893865048, 0.12919510816573165, 0.18680149640681015, 0.19198902471543988, -0.008747275600520273, 0.1568120176412372, -0.12811188530306228, 0.1829452449352377, -0.03338357594847265]
|
1,803.06342
|
3D modelling of macroscopic force-free effects in superconducting thin
films and rectangular prisms
|
When the magnetic field has a parallel component to the current density ${\bf
J}$ there appear force-free effects due to flux cutting and crossing. This
results in an anisotropic ${\bf E}({\bf J})$ relation, being ${\bf E}$ the
electric field. Understanding force-free effects is interesting not only for
the design of superconducting power and magnet applications but also for
material characterization. This work develops and applies a fast and accurate
computer modeling method based on a variational approach that can handle
force-free anisotropic ${\bf E}({\bf J})$ relations and perform fully three
dimensional (3D) calculations. We present a systematic study of force-free
effects in rectangular thin films and prisms with several finite thicknesses
under applied magnetic fields with arbitrary angle $\theta$ with the surface.
The results are compared with the same situation with isotropic ${\bf E}({\bf
J})$ relation. The thin film situation shows gradual critical current density
penetration and a general increase of the magnitude of the magnetization with
the angle $\theta$ but a minimum at the remnant state of the magnetization
loop. The prism model presents current paths with 3D bending for all angles
$\theta$. The average current density over the thickness agrees very well with
the thin film model except for the highest angles. The prism hysteresis loops
reveal a peak after the remnant state, which is due to the parallel component
of the self-magnetic-field and is implicitly neglected for thin films. The
presented numerical method shows the capability to take force-free situations
into account for general 3D situations with a high number of degrees of
freedom. The results reveal new features of force-free effects in thin films
and prisms.
|
cond-mat.supr-con physics.app-ph
|
when the magnetic field has a parallel component to the current density bf j there appear forcefree effects due to flux cutting and crossing this results in an anisotropic bf ebf j relation being bf e the electric field understanding forcefree effects is interesting not only for the design of superconducting power and magnet applications but also for material characterization this work develops and applies a fast and accurate computer modeling method based on a variational approach that can handle forcefree anisotropic bf ebf j relations and perform fully three dimensional 3d calculations we present a systematic study of forcefree effects in rectangular thin films and prisms with several finite thicknesses under applied magnetic fields with arbitrary angle theta with the surface the results are compared with the same situation with isotropic bf ebf j relation the thin film situation shows gradual critical current density penetration and a general increase of the magnitude of the magnetization with the angle theta but a minimum at the remnant state of the magnetization loop the prism model presents current paths with 3d bending for all angles theta the average current density over the thickness agrees very well with the thin film model except for the highest angles the prism hysteresis loops reveal a peak after the remnant state which is due to the parallel component of the selfmagneticfield and is implicitly neglected for thin films the presented numerical method shows the capability to take forcefree situations into account for general 3d situations with a high number of degrees of freedom the results reveal new features of forcefree effects in thin films and prisms
|
[['when', 'the', 'magnetic', 'field', 'has', 'a', 'parallel', 'component', 'to', 'the', 'current', 'density', 'bf', 'j', 'there', 'appear', 'forcefree', 'effects', 'due', 'to', 'flux', 'cutting', 'and', 'crossing', 'this', 'results', 'in', 'an', 'anisotropic', 'bf', 'ebf', 'j', 'relation', 'being', 'bf', 'e', 'the', 'electric', 'field', 'understanding', 'forcefree', 'effects', 'is', 'interesting', 'not', 'only', 'for', 'the', 'design', 'of', 'superconducting', 'power', 'and', 'magnet', 'applications', 'but', 'also', 'for', 'material', 'characterization', 'this', 'work', 'develops', 'and', 'applies', 'a', 'fast', 'and', 'accurate', 'computer', 'modeling', 'method', 'based', 'on', 'a', 'variational', 'approach', 'that', 'can', 'handle', 'forcefree', 'anisotropic', 'bf', 'ebf', 'j', 'relations', 'and', 'perform', 'fully', 'three', 'dimensional', '3d', 'calculations', 'we', 'present', 'a', 'systematic', 'study', 'of', 'forcefree', 'effects', 'in', 'rectangular', 'thin', 'films', 'and', 'prisms', 'with', 'several', 'finite', 'thicknesses', 'under', 'applied', 'magnetic', 'fields', 'with', 'arbitrary', 'angle', 'theta', 'with', 'the', 'surface', 'the', 'results', 'are', 'compared', 'with', 'the', 'same', 'situation', 'with', 'isotropic', 'bf', 'ebf', 'j', 'relation', 'the', 'thin', 'film', 'situation', 'shows', 'gradual', 'critical', 'current', 'density', 'penetration', 'and', 'a', 'general', 'increase', 'of', 'the', 'magnitude', 'of', 'the', 'magnetization', 'with', 'the', 'angle', 'theta', 'but', 'a', 'minimum', 'at', 'the', 'remnant', 'state', 'of', 'the', 'magnetization', 'loop', 'the', 'prism', 'model', 'presents', 'current', 'paths', 'with', '3d', 'bending', 'for', 'all', 'angles', 'theta', 'the', 'average', 'current', 'density', 'over', 'the', 'thickness', 'agrees', 'very', 'well', 'with', 'the', 'thin', 'film', 'model', 'except', 'for', 'the', 'highest', 'angles', 'the', 'prism', 'hysteresis', 'loops', 'reveal', 'a', 'peak', 'after', 'the', 'remnant', 'state', 'which', 'is', 'due', 'to', 'the', 'parallel', 'component', 'of', 'the', 'selfmagneticfield', 'and', 'is', 'implicitly', 'neglected', 'for', 'thin', 'films', 'the', 'presented', 'numerical', 'method', 'shows', 'the', 'capability', 'to', 'take', 'forcefree', 'situations', 'into', 'account', 'for', 'general', '3d', 'situations', 'with', 'a', 'high', 'number', 'of', 'degrees', 'of', 'freedom', 'the', 'results', 'reveal', 'new', 'features', 'of', 'forcefree', 'effects', 'in', 'thin', 'films', 'and', 'prisms']]
|
[-0.1433147925790053, 0.12483236358829274, -0.026506066483317367, -0.009483923633984502, -0.08183556118959277, -0.12432687456086002, 0.019444396255406306, 0.39107759215446625, -0.2259926558930953, -0.33528509156494557, 0.05005601444757685, -0.24020208329478188, -0.09558879412177493, 0.217608594416111, -0.0028460726304651413, 0.030586798597459566, 0.026415153886935914, -0.04123230091015701, -0.09414267068907106, -0.17845543119535984, 0.2699924192719322, 0.038458227292464904, 0.31309126801382003, 0.03524456363881948, 0.07962410541625216, 0.007232676881632065, 0.04015670704623324, 0.09454951928080264, -0.1544784833271661, 0.05602515245256357, 0.2094173183401555, -0.030255846480136135, 0.19429204890289825, -0.460366472674596, -0.21558525838818207, 0.011904682378980529, 0.08962066533030132, 0.10220476567570369, -0.012356153279923761, -0.23481036309623696, 0.05234905985853943, -0.13322149117245274, -0.1491307685961843, -0.07943864966388688, 0.036576425049931756, 0.006739317431706644, -0.3034038629032737, 0.0851213108170665, 0.089576758105017, 0.08416899365433436, -0.062085523870756304, -0.14353888765493317, -0.05022985481035629, 0.05696341865594312, 0.07054611821710842, 0.09976482473324196, 0.12453967094989182, -0.16074052708237851, -0.07367184304469525, 0.3566329498744144, -0.012946460944804672, -0.17709562684916527, 0.1446218530424147, -0.18671665334083887, -0.06524806100265798, 0.16662702856491904, 0.14204166648168545, 0.11944031557345201, -0.08364289839342834, 0.11015307650356952, -0.03401914884309894, 0.16106738895567335, 0.036907958768682074, -0.032627282334029846, 0.24303841808478463, 0.14649813575756676, 0.0389968032159299, 0.14219965994250736, -0.15477670955499392, -0.06665146246086806, -0.28906449503576914, -0.14138595158874523, -0.14366507189405467, 0.05167188989973348, -0.09389246156438968, -0.214429158260388, 0.4047754752868613, 0.14530669600762544, 0.17052909530366886, 0.008087419406649376, 0.30609760063676145, 0.09002107022685903, 0.05184949130221481, 0.12206483276502046, 0.2721913348646232, 0.1887297051712926, 0.134329939511058, -0.20931481395252602, 0.05615284921385895, 0.015494221589462244]
|
1,803.06343
|
Forward Modeling of Spectroscopic Galaxy Surveys: Application to SDSS
|
Galaxy spectra are essential to probe the spatial distribution of galaxies in
our Universe. To better interpret current and future spectroscopic galaxy
redshift surveys, it is important to be able to simulate these data sets. We
describe Uspec, a forward modeling tool to generate galaxy spectra taking into
account some intrinsic galaxy properties as well as instrumental responses of a
given telescope. The model for the intrinsic properties of the galaxy
population, i.e., the luminosity functions, and size and spectral coefficients
distribu- tions, was developed in an earlier work for broad-band imaging
surveys [1], and we now aim to test the model further using spectroscopic data.
We apply Uspec to the SDSS/CMASS sample of Luminous Red Galaxies (LRGs). We
construct selection cuts that match those used to build this LRG sample, which
we then apply to data and simulations in the same way. The resulting real and
simulated average spectra show a good statistical agreement overall, with
residual differences likely coming from a bluer galaxy population of the
simulated sam- ple. We also do not explore the impact of non-solar element
ratios in our simulations. For a quantitative comparison, we perform Principal
Component Analysis (PCA) of the sets of spectra. By comparing the PCs
constructed from simulations and data, we find good agree- ment for all
components. The distributions of the eigencoefficients also show an appreciable
overlap. We are therefore able to properly simulate the LRG sample taking into
account the SDSS/BOSS instrumental responses. The differences between the two
samples can be ascribed to the intrinsic properties of the simulated galaxy
population, which can be reduced by further improvements of our modelling
method in the future. We discuss how these results can be useful for the
forward modeling of upcoming large spectroscopic surveys.
|
astro-ph.GA astro-ph.CO
|
galaxy spectra are essential to probe the spatial distribution of galaxies in our universe to better interpret current and future spectroscopic galaxy redshift surveys it is important to be able to simulate these data sets we describe uspec a forward modeling tool to generate galaxy spectra taking into account some intrinsic galaxy properties as well as instrumental responses of a given telescope the model for the intrinsic properties of the galaxy population ie the luminosity functions and size and spectral coefficients distribu tions was developed in an earlier work for broadband imaging surveys 1 and we now aim to test the model further using spectroscopic data we apply uspec to the sdsscmass sample of luminous red galaxies lrgs we construct selection cuts that match those used to build this lrg sample which we then apply to data and simulations in the same way the resulting real and simulated average spectra show a good statistical agreement overall with residual differences likely coming from a bluer galaxy population of the simulated sam ple we also do not explore the impact of nonsolar element ratios in our simulations for a quantitative comparison we perform principal component analysis pca of the sets of spectra by comparing the pcs constructed from simulations and data we find good agree ment for all components the distributions of the eigencoefficients also show an appreciable overlap we are therefore able to properly simulate the lrg sample taking into account the sdssboss instrumental responses the differences between the two samples can be ascribed to the intrinsic properties of the simulated galaxy population which can be reduced by further improvements of our modelling method in the future we discuss how these results can be useful for the forward modeling of upcoming large spectroscopic surveys
|
[['galaxy', 'spectra', 'are', 'essential', 'to', 'probe', 'the', 'spatial', 'distribution', 'of', 'galaxies', 'in', 'our', 'universe', 'to', 'better', 'interpret', 'current', 'and', 'future', 'spectroscopic', 'galaxy', 'redshift', 'surveys', 'it', 'is', 'important', 'to', 'be', 'able', 'to', 'simulate', 'these', 'data', 'sets', 'we', 'describe', 'uspec', 'a', 'forward', 'modeling', 'tool', 'to', 'generate', 'galaxy', 'spectra', 'taking', 'into', 'account', 'some', 'intrinsic', 'galaxy', 'properties', 'as', 'well', 'as', 'instrumental', 'responses', 'of', 'a', 'given', 'telescope', 'the', 'model', 'for', 'the', 'intrinsic', 'properties', 'of', 'the', 'galaxy', 'population', 'ie', 'the', 'luminosity', 'functions', 'and', 'size', 'and', 'spectral', 'coefficients', 'distribu', 'tions', 'was', 'developed', 'in', 'an', 'earlier', 'work', 'for', 'broadband', 'imaging', 'surveys', '1', 'and', 'we', 'now', 'aim', 'to', 'test', 'the', 'model', 'further', 'using', 'spectroscopic', 'data', 'we', 'apply', 'uspec', 'to', 'the', 'sdsscmass', 'sample', 'of', 'luminous', 'red', 'galaxies', 'lrgs', 'we', 'construct', 'selection', 'cuts', 'that', 'match', 'those', 'used', 'to', 'build', 'this', 'lrg', 'sample', 'which', 'we', 'then', 'apply', 'to', 'data', 'and', 'simulations', 'in', 'the', 'same', 'way', 'the', 'resulting', 'real', 'and', 'simulated', 'average', 'spectra', 'show', 'a', 'good', 'statistical', 'agreement', 'overall', 'with', 'residual', 'differences', 'likely', 'coming', 'from', 'a', 'bluer', 'galaxy', 'population', 'of', 'the', 'simulated', 'sam', 'ple', 'we', 'also', 'do', 'not', 'explore', 'the', 'impact', 'of', 'nonsolar', 'element', 'ratios', 'in', 'our', 'simulations', 'for', 'a', 'quantitative', 'comparison', 'we', 'perform', 'principal', 'component', 'analysis', 'pca', 'of', 'the', 'sets', 'of', 'spectra', 'by', 'comparing', 'the', 'pcs', 'constructed', 'from', 'simulations', 'and', 'data', 'we', 'find', 'good', 'agree', 'ment', 'for', 'all', 'components', 'the', 'distributions', 'of', 'the', 'eigencoefficients', 'also', 'show', 'an', 'appreciable', 'overlap', 'we', 'are', 'therefore', 'able', 'to', 'properly', 'simulate', 'the', 'lrg', 'sample', 'taking', 'into', 'account', 'the', 'sdssboss', 'instrumental', 'responses', 'the', 'differences', 'between', 'the', 'two', 'samples', 'can', 'be', 'ascribed', 'to', 'the', 'intrinsic', 'properties', 'of', 'the', 'simulated', 'galaxy', 'population', 'which', 'can', 'be', 'reduced', 'by', 'further', 'improvements', 'of', 'our', 'modelling', 'method', 'in', 'the', 'future', 'we', 'discuss', 'how', 'these', 'results', 'can', 'be', 'useful', 'for', 'the', 'forward', 'modeling', 'of', 'upcoming', 'large', 'spectroscopic', 'surveys']]
|
[-0.006564679577123782, 0.03067589728554395, -0.1380107340925973, 0.1412694545826326, -0.0894576162586231, -0.05198881138364899, 0.01636159649096455, 0.4462667933780037, -0.19955053078233942, -0.33859135041472643, 0.07106557120018868, -0.3157877204796197, -0.07747725931184417, 0.22642512276617136, -0.025124435347731365, 0.029608964603689295, 0.09114448880228175, -0.09981616738584045, -0.02462630779740571, -0.2667154556472007, 0.28805512577942766, 0.09210188463186743, 0.2563659281705902, -0.04386256429309357, 0.0624240322496219, -0.03066362889243564, -0.11473870461117731, 0.050977617089974704, -0.1576834338475611, 0.07968728282578187, 0.2776370481340763, 0.14671734366159286, 0.22033544918298975, -0.3912904208573309, -0.20334258668438837, 0.12045983750516052, 0.18415281021938026, 0.09769388351490568, -0.046852425241536676, -0.2687843402724853, 0.09012933437272345, -0.1495574920810799, -0.14902506871563573, -0.07395307977256455, -0.03206926422219162, 0.06127366949489168, -0.24748793151787776, 0.09133364306204658, 0.01732175379344868, 0.0531155415962144, -0.0926375641226003, -0.12258924684761975, -0.053950212470475864, 0.16878679715302672, 0.0024362382995704672, 0.013393998596468806, 0.11890552750922587, -0.10839758402478965, -0.05102431097176334, 0.38826772327892073, -0.07566309861810112, -0.09937325951484613, 0.1804556283894097, -0.1802573369178851, -0.15932844092587825, 0.06384171589201137, 0.21121503541725398, 0.06701126094622066, -0.1690231514269365, -0.004201105437584362, -0.016284241566310115, 0.21362465475398842, -0.0321720691552475, 0.039756182257979285, 0.23006162079759196, 0.12562956534085273, 0.005219790955529228, 0.11778096310963394, -0.17995845116132692, -0.009471121101404145, -0.2642626764877916, -0.1011110187862196, -0.15097324469099652, 0.05404984558760452, -0.11310363963709016, -0.10975708342348672, 0.3917183925346663, 0.19941395784294463, 0.2508609810870377, 0.07355083470720772, 0.31129212995786987, 0.07892633660749072, 0.10714831011615412, 0.025788291777669108, 0.24848296771941097, 0.1318238698654132, 0.0486998892710576, -0.23441506231587209, 0.049072806696704115, -0.03514753901642868]
|
1,803.06344
|
A Multi-Scheme Ensemble Using Coopetitive Soft-Gating With Application
to Power Forecasting for Renewable Energy Generation
|
In this article, we propose a novel ensemble technique with a multi-scheme
weighting based on a technique called coopetitive soft gating. This technique
combines both, ensemble member competition and cooperation, in order to
maximize the overall forecasting accuracy of the ensemble. The proposed
algorithm combines the ideas of multiple ensemble paradigms (power forecasting
model ensemble, weather forecasting model ensemble, and lagged ensemble) in a
hierarchical structure. The technique is designed to be used in a flexible
manner on single and multiple weather forecasting models, and for a variety of
lead times. We compare the technique to other power forecasting models and
ensemble techniques with a flexible number of weather forecasting models, which
can have the same, or varying forecasting horizons. It is shown that the model
is able to outperform those models on a number of publicly available data sets.
The article closes with a discussion of properties of the proposed model which
are relevant in its application.
|
stat.AP stat.ML
|
in this article we propose a novel ensemble technique with a multischeme weighting based on a technique called coopetitive soft gating this technique combines both ensemble member competition and cooperation in order to maximize the overall forecasting accuracy of the ensemble the proposed algorithm combines the ideas of multiple ensemble paradigms power forecasting model ensemble weather forecasting model ensemble and lagged ensemble in a hierarchical structure the technique is designed to be used in a flexible manner on single and multiple weather forecasting models and for a variety of lead times we compare the technique to other power forecasting models and ensemble techniques with a flexible number of weather forecasting models which can have the same or varying forecasting horizons it is shown that the model is able to outperform those models on a number of publicly available data sets the article closes with a discussion of properties of the proposed model which are relevant in its application
|
[['in', 'this', 'article', 'we', 'propose', 'a', 'novel', 'ensemble', 'technique', 'with', 'a', 'multischeme', 'weighting', 'based', 'on', 'a', 'technique', 'called', 'coopetitive', 'soft', 'gating', 'this', 'technique', 'combines', 'both', 'ensemble', 'member', 'competition', 'and', 'cooperation', 'in', 'order', 'to', 'maximize', 'the', 'overall', 'forecasting', 'accuracy', 'of', 'the', 'ensemble', 'the', 'proposed', 'algorithm', 'combines', 'the', 'ideas', 'of', 'multiple', 'ensemble', 'paradigms', 'power', 'forecasting', 'model', 'ensemble', 'weather', 'forecasting', 'model', 'ensemble', 'and', 'lagged', 'ensemble', 'in', 'a', 'hierarchical', 'structure', 'the', 'technique', 'is', 'designed', 'to', 'be', 'used', 'in', 'a', 'flexible', 'manner', 'on', 'single', 'and', 'multiple', 'weather', 'forecasting', 'models', 'and', 'for', 'a', 'variety', 'of', 'lead', 'times', 'we', 'compare', 'the', 'technique', 'to', 'other', 'power', 'forecasting', 'models', 'and', 'ensemble', 'techniques', 'with', 'a', 'flexible', 'number', 'of', 'weather', 'forecasting', 'models', 'which', 'can', 'have', 'the', 'same', 'or', 'varying', 'forecasting', 'horizons', 'it', 'is', 'shown', 'that', 'the', 'model', 'is', 'able', 'to', 'outperform', 'those', 'models', 'on', 'a', 'number', 'of', 'publicly', 'available', 'data', 'sets', 'the', 'article', 'closes', 'with', 'a', 'discussion', 'of', 'properties', 'of', 'the', 'proposed', 'model', 'which', 'are', 'relevant', 'in', 'its', 'application']]
|
[-0.06730796748276942, 0.07670675415047415, -0.12156701385441004, 0.07299570164830085, -0.04218133542520605, -0.15168778298743021, 0.04264223323630727, 0.41750783855273466, -0.23702106731617525, -0.3403695874171225, 0.10779615564517986, -0.25671186748963254, -0.18608744157282459, 0.21950980195935793, -0.08318364491187938, 0.09375864920127769, 0.08984321870642364, 0.04157134452775405, -0.021591016792864272, -0.26079660036992636, 0.2594689168747823, 0.13285627541766995, 0.37169286261229617, -0.03448625939310926, 0.14298100712943443, -0.01314449704483531, -0.0542277083415197, 0.02736915506802167, -0.060529482036550564, 0.1764156072619994, 0.2363014574542495, 0.17810129373079273, 0.32095543560453327, -0.3851695254468804, -0.2963460272735661, 0.10354299193165105, 0.09545513408282286, 0.07744876473139568, -0.015851620583984836, -0.24108314012313725, 0.032327194407487374, -0.24941690237732947, -0.08402746770780083, -0.137029448826649, -0.07759947830419632, 0.034252232877881664, -0.3280687622691113, 0.04260838354469105, 0.03681289905883894, 0.036741451588666936, -0.07742014014870996, -0.10124197710827468, 0.03952450588772631, 0.12080528454522893, 0.029849644389988227, 0.004432507695713241, 0.10166286367175591, -0.10271887754714472, -0.14516026909006344, 0.3699347039115182, -0.08447064118011956, -0.19974259382327367, 0.20555971276792134, -0.04672906807309408, -0.15488937758739776, 0.06873310699756406, 0.2453134648403995, 0.11946667110915207, -0.16736937670228458, 0.020752873109686217, -0.022990352265050362, 0.16068225573143288, -0.009776269320018922, -0.04070876987212023, 0.21267811802903985, 0.2451420043814619, 0.060979070790352266, 0.12526502268600936, -0.13542930483907034, -0.14159949477406064, -0.20971794926582177, -0.10376517069644657, -0.1599204356301647, -0.023884622027925483, -0.09112922686171068, -0.18938513268078203, 0.4470028358387055, 0.2601815885330319, 0.2013027995652786, 0.058326650792762495, 0.33036545731103534, 0.0757296461089971, 0.06514786577421673, 0.06779266375704271, 0.15895700858606346, 0.04575860313440904, 0.09635803402715902, -0.1733219403392416, 0.07309295807721888, 0.07614146138001589]
|
1,803.06345
|
The Role of Cosmic Ray Transport in Shaping the Simulated Circumgalactic
Medium
|
The majority of galactic baryons reside outside of the galactic disk in the
diffuse gas known as the circumgalactic medium (CGM). While state-of-the art
simulations excel at reproducing galactic disk properties, many struggle to
drive strong galactic winds or to match the observed ionization structure of
the CGM using only thermal supernova feedback. To remedy this, recent studies
have invoked non-thermal cosmic ray (CR) stellar feedback prescriptions.
However, numerical schemes of CR transport are still poorly constrained. We
explore how the choice of CR transport affects the multiphase structure of the
simulated CGM. We implement anisotropic CR physics in the astrophysical
simulation code, {\sc Enzo} and simulate a suite of isolated disk galaxies with
varying prescriptions for CR transport: isotropic diffusion, anisotropic
diffusion, and streaming. We find that all three transport mechanisms result in
strong, metal-rich outflows but differ in the temperature and ionization
structure of their CGM. Isotropic diffusion results in a spatially uniform,
warm CGM that underpredicts the column densities of low-ions. Anisotropic
diffusion develops a reservoir of cool gas that extends further from the
galactic center, but disperses rapidly with distance. CR streaming projects
cool gas out to radii of 200 kpc, supporting a truly multiphase medium. In
addition, we find that streaming is less sensitive to changes in constant
parameter values like the CR injection fraction, transport velocity, and
resolution than diffusion. We conclude that CR streaming is a more robust
implementation of CR transport and motivate the need for detailed parameter
studies of CR transport.
|
astro-ph.GA
|
the majority of galactic baryons reside outside of the galactic disk in the diffuse gas known as the circumgalactic medium cgm while stateofthe art simulations excel at reproducing galactic disk properties many struggle to drive strong galactic winds or to match the observed ionization structure of the cgm using only thermal supernova feedback to remedy this recent studies have invoked nonthermal cosmic ray cr stellar feedback prescriptions however numerical schemes of cr transport are still poorly constrained we explore how the choice of cr transport affects the multiphase structure of the simulated cgm we implement anisotropic cr physics in the astrophysical simulation code sc enzo and simulate a suite of isolated disk galaxies with varying prescriptions for cr transport isotropic diffusion anisotropic diffusion and streaming we find that all three transport mechanisms result in strong metalrich outflows but differ in the temperature and ionization structure of their cgm isotropic diffusion results in a spatially uniform warm cgm that underpredicts the column densities of lowions anisotropic diffusion develops a reservoir of cool gas that extends further from the galactic center but disperses rapidly with distance cr streaming projects cool gas out to radii of 200 kpc supporting a truly multiphase medium in addition we find that streaming is less sensitive to changes in constant parameter values like the cr injection fraction transport velocity and resolution than diffusion we conclude that cr streaming is a more robust implementation of cr transport and motivate the need for detailed parameter studies of cr transport
|
[['the', 'majority', 'of', 'galactic', 'baryons', 'reside', 'outside', 'of', 'the', 'galactic', 'disk', 'in', 'the', 'diffuse', 'gas', 'known', 'as', 'the', 'circumgalactic', 'medium', 'cgm', 'while', 'stateofthe', 'art', 'simulations', 'excel', 'at', 'reproducing', 'galactic', 'disk', 'properties', 'many', 'struggle', 'to', 'drive', 'strong', 'galactic', 'winds', 'or', 'to', 'match', 'the', 'observed', 'ionization', 'structure', 'of', 'the', 'cgm', 'using', 'only', 'thermal', 'supernova', 'feedback', 'to', 'remedy', 'this', 'recent', 'studies', 'have', 'invoked', 'nonthermal', 'cosmic', 'ray', 'cr', 'stellar', 'feedback', 'prescriptions', 'however', 'numerical', 'schemes', 'of', 'cr', 'transport', 'are', 'still', 'poorly', 'constrained', 'we', 'explore', 'how', 'the', 'choice', 'of', 'cr', 'transport', 'affects', 'the', 'multiphase', 'structure', 'of', 'the', 'simulated', 'cgm', 'we', 'implement', 'anisotropic', 'cr', 'physics', 'in', 'the', 'astrophysical', 'simulation', 'code', 'sc', 'enzo', 'and', 'simulate', 'a', 'suite', 'of', 'isolated', 'disk', 'galaxies', 'with', 'varying', 'prescriptions', 'for', 'cr', 'transport', 'isotropic', 'diffusion', 'anisotropic', 'diffusion', 'and', 'streaming', 'we', 'find', 'that', 'all', 'three', 'transport', 'mechanisms', 'result', 'in', 'strong', 'metalrich', 'outflows', 'but', 'differ', 'in', 'the', 'temperature', 'and', 'ionization', 'structure', 'of', 'their', 'cgm', 'isotropic', 'diffusion', 'results', 'in', 'a', 'spatially', 'uniform', 'warm', 'cgm', 'that', 'underpredicts', 'the', 'column', 'densities', 'of', 'lowions', 'anisotropic', 'diffusion', 'develops', 'a', 'reservoir', 'of', 'cool', 'gas', 'that', 'extends', 'further', 'from', 'the', 'galactic', 'center', 'but', 'disperses', 'rapidly', 'with', 'distance', 'cr', 'streaming', 'projects', 'cool', 'gas', 'out', 'to', 'radii', 'of', '200', 'kpc', 'supporting', 'a', 'truly', 'multiphase', 'medium', 'in', 'addition', 'we', 'find', 'that', 'streaming', 'is', 'less', 'sensitive', 'to', 'changes', 'in', 'constant', 'parameter', 'values', 'like', 'the', 'cr', 'injection', 'fraction', 'transport', 'velocity', 'and', 'resolution', 'than', 'diffusion', 'we', 'conclude', 'that', 'cr', 'streaming', 'is', 'a', 'more', 'robust', 'implementation', 'of', 'cr', 'transport', 'and', 'motivate', 'the', 'need', 'for', 'detailed', 'parameter', 'studies', 'of', 'cr', 'transport']]
|
[-0.08745004975632764, 0.12807740276306867, -0.0074701939753722395, 0.10177330276882277, -0.09748145927675068, -0.08682340944185853, 0.002450586860999465, 0.4308178288042545, -0.26637930201273413, -0.30930803208518776, -0.0125526551916264, -0.2898787331581116, -0.0031960223345085977, 0.19202640830143355, 0.05387635799869895, -0.024553269120340702, 0.010424363235011697, -0.13267909935116767, -0.04773489328823052, -0.2554689710419625, 0.3238678032476455, 0.1584712362419814, 0.1944025999326259, 0.020037651924416422, 0.04940278485231102, -0.11125469300244004, -0.08154023764282466, 0.033902738123608285, -0.150970694231597, 0.04112618863306125, 0.2202890192771447, 0.0972631642781198, 0.22020697508659215, -0.435568377174437, -0.34656326126866044, 0.040658167444635185, 0.22015357661247253, 0.07566149623994715, -0.13965078000567155, -0.18091745819337665, 0.05691382216475904, -0.19827694020047784, -0.17772604295425118, 0.012937876132084056, -0.03232365060201846, 0.05120755174635269, -0.21513518715067767, 0.16337467381265014, 0.06323432362638413, 0.05165139592811465, -0.10421853634016588, -0.08722455385990907, -0.04762761165294796, 0.04923534975526855, 0.010324770899489522, 0.03940157761238516, 0.2620681165460264, -0.1379024242227897, -0.002776557753328234, 0.437842945843935, -0.06844050966884242, -0.0792850097566843, 0.27672194320196286, -0.20483097521588206, -0.1415963859334588, 0.16160028077475727, 0.20213965207338333, 0.07915012341272086, -0.14858808594488074, 0.0645571871928405, -0.06334529056749306, 0.1632143220428843, -0.0037466428894549608, 0.020435296045528958, 0.23053607589565217, 0.11881899053789675, 0.07981112656812184, 0.033804199249250814, -0.14925778179056942, -0.08879706147522666, -0.19494220667891204, -0.13569344020448626, -0.11036286410922184, 0.10578004938550294, -0.12358743809972657, -0.1516199072636664, 0.3069133198852651, 0.1702616762141697, 0.2282403720729053, -0.026832769313827158, 0.3533765803705901, 0.0203785865502432, 0.025942886585369706, 0.22833857239037753, 0.25665725164301695, 0.18085093368496746, 0.14387790375063195, -0.2741942372499034, 0.10129169231606647, -0.001970969413407147]
|
1,803.06346
|
Improving performance of SEOBNRv3 by $\sim$300x
|
When a gravitational wave is detected by Advanced LIGO/Virgo, sophisticated
parameter estimation (PE) pipelines spring into action. These pipelines
leverage approximants to generate large numbers of theoretical gravitational
waveform predictions to characterize the detected signal. One of the most
accurate and physically comprehensive classes of approximants in wide use is
the "Spinning Effective One Body--Numerical Relativity" (SEOBNR) family.
Waveform generation with these approximants can be computationally expensive,
which has limited their usefulness in multiple data analysis contexts. In prior
work we improved the performance of the aligned-spin approximant SEOBNR version
2 (v2) by nearly 300x. In this work we focus on optimizing the full
eight-dimensional, precessing approximant SEOBNR version 3 (v3). While several
v2 optimizations were implemented during its development, v3 is far too slow
for use in state-of-the-art source characterization efforts for long-inspiral
detections. Completion of a PE run after such a detection could take centuries
to complete using v3. Here we develop and implement a host of optimizations for
v3, calling the optimized approximant v3_Opt. Our optimized approximant is
about 340x faster than v3, and generates waveforms that are numerically
indistinguishable.
|
gr-qc
|
when a gravitational wave is detected by advanced ligovirgo sophisticated parameter estimation pe pipelines spring into action these pipelines leverage approximants to generate large numbers of theoretical gravitational waveform predictions to characterize the detected signal one of the most accurate and physically comprehensive classes of approximants in wide use is the spinning effective one bodynumerical relativity seobnr family waveform generation with these approximants can be computationally expensive which has limited their usefulness in multiple data analysis contexts in prior work we improved the performance of the alignedspin approximant seobnr version 2 v2 by nearly 300x in this work we focus on optimizing the full eightdimensional precessing approximant seobnr version 3 v3 while several v2 optimizations were implemented during its development v3 is far too slow for use in stateoftheart source characterization efforts for longinspiral detections completion of a pe run after such a detection could take centuries to complete using v3 here we develop and implement a host of optimizations for v3 calling the optimized approximant v3_opt our optimized approximant is about 340x faster than v3 and generates waveforms that are numerically indistinguishable
|
[['when', 'a', 'gravitational', 'wave', 'is', 'detected', 'by', 'advanced', 'ligovirgo', 'sophisticated', 'parameter', 'estimation', 'pe', 'pipelines', 'spring', 'into', 'action', 'these', 'pipelines', 'leverage', 'approximants', 'to', 'generate', 'large', 'numbers', 'of', 'theoretical', 'gravitational', 'waveform', 'predictions', 'to', 'characterize', 'the', 'detected', 'signal', 'one', 'of', 'the', 'most', 'accurate', 'and', 'physically', 'comprehensive', 'classes', 'of', 'approximants', 'in', 'wide', 'use', 'is', 'the', 'spinning', 'effective', 'one', 'bodynumerical', 'relativity', 'seobnr', 'family', 'waveform', 'generation', 'with', 'these', 'approximants', 'can', 'be', 'computationally', 'expensive', 'which', 'has', 'limited', 'their', 'usefulness', 'in', 'multiple', 'data', 'analysis', 'contexts', 'in', 'prior', 'work', 'we', 'improved', 'the', 'performance', 'of', 'the', 'alignedspin', 'approximant', 'seobnr', 'version', '2', 'v2', 'by', 'nearly', '300x', 'in', 'this', 'work', 'we', 'focus', 'on', 'optimizing', 'the', 'full', 'eightdimensional', 'precessing', 'approximant', 'seobnr', 'version', '3', 'v3', 'while', 'several', 'v2', 'optimizations', 'were', 'implemented', 'during', 'its', 'development', 'v3', 'is', 'far', 'too', 'slow', 'for', 'use', 'in', 'stateoftheart', 'source', 'characterization', 'efforts', 'for', 'longinspiral', 'detections', 'completion', 'of', 'a', 'pe', 'run', 'after', 'such', 'a', 'detection', 'could', 'take', 'centuries', 'to', 'complete', 'using', 'v3', 'here', 'we', 'develop', 'and', 'implement', 'a', 'host', 'of', 'optimizations', 'for', 'v3', 'calling', 'the', 'optimized', 'approximant', 'v3_opt', 'our', 'optimized', 'approximant', 'is', 'about', '340x', 'faster', 'than', 'v3', 'and', 'generates', 'waveforms', 'that', 'are', 'numerically', 'indistinguishable']]
|
[-0.11021609195409207, 0.04959092858148603, -0.05099944293472328, 0.08197077381549477, -0.10301579223872896, -0.14083925274840697, -0.02828154072566114, 0.3814848065870559, -0.19016388681289276, -0.3071671153923403, 0.13574553630900096, -0.27477194096433916, -0.13091222757431964, 0.2678254114817724, -0.015020027370374212, 0.07482762320595403, 0.12131831982347323, -0.012589737177207317, -0.12935374543287365, -0.24893207777572493, 0.20705512020471584, 0.10317552397964137, 0.22004950048750546, -0.04274116957029484, 0.04141892235226638, -0.008669143429483864, -0.03704861938880559, -0.04044718395231822, -0.1175300843844027, 0.10556062610362078, 0.26880527126301057, 0.17300723237896015, 0.24527536673918782, -0.41798060784355723, -0.18286832262288424, 0.05841264667284712, 0.12377939535846008, 0.14107983777957692, -0.030645048540402932, -0.2651423123150065, 0.09715492338431198, -0.25551015509204034, -0.09728160885022173, -0.16746245543134278, 0.03915213144451962, 0.01555579641311008, -0.25234453387457, 0.04851658260186369, 0.05254085692342933, 0.03332989719337341, -0.013733166656925151, -0.12540689468131447, 0.018550436321918967, 0.08576992404593191, 0.025086318132306277, 0.10083129157783079, 0.12453571732472056, -0.09036906921095345, -0.10216455331576894, 0.3937583470144101, -0.0776421884560142, -0.19600979846189392, 0.1733187462629844, -0.11228544695053104, -0.179657303421191, 0.17584051644981075, 0.18740592477290355, 0.14225808419443292, -0.14732312664882913, 0.028695799842734227, 0.08213452866319476, 0.22137965287950784, 0.10222732049787636, 0.0029385720181939654, 0.21762645712991208, 0.17343280573151798, 0.0012824843031505133, 0.13702377594172352, -0.11165726073892714, -0.0633309845599299, -0.22634037490706505, -0.09245983860967616, -0.17332204901899456, 0.03087417382118357, -0.08434473274266881, -0.12734549335079196, 0.4242398644532155, 0.1777892233439664, 0.11685839830897748, 0.07739649408993796, 0.35033734870148436, 0.05535279284328919, 0.09980490261184145, 0.07528734130280186, 0.28826097970276904, 0.015961553526823748, 0.08893277195760949, -0.1371227079097119, 0.0627949540893542, 0.06386262573501454]
|
1,803.06347
|
Electroweak Gauge Boson Parton Distribution Functions
|
Transverse and longitudinal electroweak gauge boson parton distribution
functions (PDFs) are computed in terms of deep-inelastic scattering structure
functions, following the recently developed method to determine the photon PDF.
The calculation provides initial conditions at the electroweak scale for PDF
evolution to higher energies. Numerical results for the $W^\pm$ and $Z$
transverse, longitudinal and polarized PDFs, as well as the $\gamma Z$
transverse and polarized PDFs are presented.
|
hep-ph
|
transverse and longitudinal electroweak gauge boson parton distribution functions pdfs are computed in terms of deepinelastic scattering structure functions following the recently developed method to determine the photon pdf the calculation provides initial conditions at the electroweak scale for pdf evolution to higher energies numerical results for the wpm and z transverse longitudinal and polarized pdfs as well as the gamma z transverse and polarized pdfs are presented
|
[['transverse', 'and', 'longitudinal', 'electroweak', 'gauge', 'boson', 'parton', 'distribution', 'functions', 'pdfs', 'are', 'computed', 'in', 'terms', 'of', 'deepinelastic', 'scattering', 'structure', 'functions', 'following', 'the', 'recently', 'developed', 'method', 'to', 'determine', 'the', 'photon', 'pdf', 'the', 'calculation', 'provides', 'initial', 'conditions', 'at', 'the', 'electroweak', 'scale', 'for', 'pdf', 'evolution', 'to', 'higher', 'energies', 'numerical', 'results', 'for', 'the', 'wpm', 'and', 'z', 'transverse', 'longitudinal', 'and', 'polarized', 'pdfs', 'as', 'well', 'as', 'the', 'gamma', 'z', 'transverse', 'and', 'polarized', 'pdfs', 'are', 'presented']]
|
[-0.03008871089995784, 0.26572011554312397, -0.13781283495208138, 0.20193630836986223, -0.02236093828276567, -0.05265704120906508, -0.06595484804197707, 0.4399280013406978, -0.19270145276095718, -0.215752015602501, -0.027199398858048132, -0.2770586325513089, 0.0655823881354402, 0.16642503708820133, 0.17377631560734966, 0.19157585630412488, 0.04353633231264265, -0.10614318973795675, -0.07898061660542975, -0.23481066179502866, 0.3361818303956705, 0.06914922062937609, 0.3109374331063865, 0.14480963727349744, 0.10199396556708962, 0.1366178241750116, -0.13146187560221947, -0.08870414639001384, -0.16368291492793052, 0.04315597514676697, 0.2260234880480258, 0.04492561197976636, 0.09679536686128225, -0.3144648897954646, -0.10709486573058016, 0.02003916572122013, 0.1627457575626014, 0.12252423415467252, -0.005555200458997313, -0.28177919934558515, 0.07181322410264436, -0.21702661674798412, -0.19451414576820647, -0.14044824712704318, -0.02455762295764597, 0.05430405552718131, -0.36163338989803484, 0.13944466245661982, -0.10094773473717984, 0.03791727091404883, 0.023013957741889444, -0.2082970087580821, -0.1551659618579673, 0.01654747301055228, 0.14968451606931493, 0.18229306816561697, 0.18139325935557923, -0.24071225874564228, -0.1611672282383284, 0.369316105319954, -0.03631963286384502, -0.21839025948087082, 0.09815578814595938, -0.28558802652611015, -0.15031922923620133, 0.17320867153980277, 0.27285563284942116, 0.05648338909753982, -0.14004846392558915, 0.1354118443594095, 0.012830744750852533, 0.10534053182517014, 0.069140352849739, 0.0650605290361187, 0.14345719802248127, 0.09530679650111672, -0.02111644799108891, 0.03505207550616058, -0.10715177019044538, -0.05993095741552465, -0.43877554745139447, -0.07426326458944994, -0.10953194622005172, 0.06523733023170601, -0.06358284062640879, -0.13815445825457573, 0.40426015486831174, 0.06824215833266327, 0.2434809181072256, 0.05633607546812581, 0.3303483902641079, 0.1698378371040556, 0.04437539737452479, 0.055853176067638045, 0.20468579168321893, 0.22471348264747681, 0.1447302422431462, -0.1829694662900532, 0.04176631752702901, 0.08230960475938286]
|
1,803.06348
|
Likelihood Non-Gaussianity in Large-Scale Structure Analyses
|
Standard present day large-scale structure (LSS) analyses make a major
assumption in their Bayesian parameter inference --- that the likelihood has a
Gaussian form. For summary statistics currently used in LSS, this assumption,
even if the underlying density field is Gaussian, cannot be correct in detail.
We investigate the impact of this assumption on two recent LSS analyses: the
Beutler et al. (2017) power spectrum multipole ($P_\ell$) analysis and the
Sinha et al. (2017) group multiplicity function ($\zeta$) analysis. Using
non-parametric divergence estimators on mock catalogs originally constructed
for covariance matrix estimation, we identify significant non-Gaussianity in
both the $P_\ell$ and $\zeta$ likelihoods. We then use Gaussian mixture density
estimation and Independent Component Analysis on the same mocks to construct
likelihood estimates that approximate the true likelihood better than the
Gaussian $pseudo$-likelihood. Using these likelihood estimates, we accurately
estimate the true posterior probability distribution of the Beutler et al.
(2017) and Sinha et al. (2017) parameters. Likelihood non-Gaussianity shifts
the $f\sigma_8$ constraint by $-0.44\sigma$, but otherwise, does not
significantly impact the overall parameter constraints of Beutler et al.
(2017). For the $\zeta$ analysis, using the pseudo-likelihood significantly
underestimates the uncertainties and biases the constraints of Sinha et al.
(2017) halo occupation parameters. For $\log M_1$ and $\alpha$, the posteriors
are shifted by $+0.43\sigma$ and $-0.51\sigma$ and broadened by $42\%$ and
$66\%$, respectively. The divergence and likelihood estimation methods we
present provide a straightforward framework for quantifying the impact of
likelihood non-Gaussianity and deriving more accurate parameter constraints.
|
astro-ph.CO
|
standard present day largescale structure lss analyses make a major assumption in their bayesian parameter inference that the likelihood has a gaussian form for summary statistics currently used in lss this assumption even if the underlying density field is gaussian cannot be correct in detail we investigate the impact of this assumption on two recent lss analyses the beutler et al 2017 power spectrum multipole p_ell analysis and the sinha et al 2017 group multiplicity function zeta analysis using nonparametric divergence estimators on mock catalogs originally constructed for covariance matrix estimation we identify significant nongaussianity in both the p_ell and zeta likelihoods we then use gaussian mixture density estimation and independent component analysis on the same mocks to construct likelihood estimates that approximate the true likelihood better than the gaussian pseudolikelihood using these likelihood estimates we accurately estimate the true posterior probability distribution of the beutler et al 2017 and sinha et al 2017 parameters likelihood nongaussianity shifts the fsigma_8 constraint by 044sigma but otherwise does not significantly impact the overall parameter constraints of beutler et al 2017 for the zeta analysis using the pseudolikelihood significantly underestimates the uncertainties and biases the constraints of sinha et al 2017 halo occupation parameters for log m_1 and alpha the posteriors are shifted by 043sigma and 051sigma and broadened by 42 and 66 respectively the divergence and likelihood estimation methods we present provide a straightforward framework for quantifying the impact of likelihood nongaussianity and deriving more accurate parameter constraints
|
[['standard', 'present', 'day', 'largescale', 'structure', 'lss', 'analyses', 'make', 'a', 'major', 'assumption', 'in', 'their', 'bayesian', 'parameter', 'inference', 'that', 'the', 'likelihood', 'has', 'a', 'gaussian', 'form', 'for', 'summary', 'statistics', 'currently', 'used', 'in', 'lss', 'this', 'assumption', 'even', 'if', 'the', 'underlying', 'density', 'field', 'is', 'gaussian', 'can', 'not', 'be', 'correct', 'in', 'detail', 'we', 'investigate', 'the', 'impact', 'of', 'this', 'assumption', 'on', 'two', 'recent', 'lss', 'analyses', 'the', 'beutler', 'et', 'al', '2017', 'power', 'spectrum', 'multipole', 'p_ell', 'analysis', 'and', 'the', 'sinha', 'et', 'al', '2017', 'group', 'multiplicity', 'function', 'zeta', 'analysis', 'using', 'nonparametric', 'divergence', 'estimators', 'on', 'mock', 'catalogs', 'originally', 'constructed', 'for', 'covariance', 'matrix', 'estimation', 'we', 'identify', 'significant', 'nongaussianity', 'in', 'both', 'the', 'p_ell', 'and', 'zeta', 'likelihoods', 'we', 'then', 'use', 'gaussian', 'mixture', 'density', 'estimation', 'and', 'independent', 'component', 'analysis', 'on', 'the', 'same', 'mocks', 'to', 'construct', 'likelihood', 'estimates', 'that', 'approximate', 'the', 'true', 'likelihood', 'better', 'than', 'the', 'gaussian', 'pseudolikelihood', 'using', 'these', 'likelihood', 'estimates', 'we', 'accurately', 'estimate', 'the', 'true', 'posterior', 'probability', 'distribution', 'of', 'the', 'beutler', 'et', 'al', '2017', 'and', 'sinha', 'et', 'al', '2017', 'parameters', 'likelihood', 'nongaussianity', 'shifts', 'the', 'fsigma_8', 'constraint', 'by', '044sigma', 'but', 'otherwise', 'does', 'not', 'significantly', 'impact', 'the', 'overall', 'parameter', 'constraints', 'of', 'beutler', 'et', 'al', '2017', 'for', 'the', 'zeta', 'analysis', 'using', 'the', 'pseudolikelihood', 'significantly', 'underestimates', 'the', 'uncertainties', 'and', 'biases', 'the', 'constraints', 'of', 'sinha', 'et', 'al', '2017', 'halo', 'occupation', 'parameters', 'for', 'log', 'm_1', 'and', 'alpha', 'the', 'posteriors', 'are', 'shifted', 'by', '043sigma', 'and', '051sigma', 'and', 'broadened', 'by', '42', 'and', '66', 'respectively', 'the', 'divergence', 'and', 'likelihood', 'estimation', 'methods', 'we', 'present', 'provide', 'a', 'straightforward', 'framework', 'for', 'quantifying', 'the', 'impact', 'of', 'likelihood', 'nongaussianity', 'and', 'deriving', 'more', 'accurate', 'parameter', 'constraints']]
|
[-0.04167934286371866, 0.011109048354422262, -0.11534218084006036, 0.1254321831244151, -0.1190636732489573, -0.07162227321484843, 0.06477053629434343, 0.3423969441314884, -0.1922049348234947, -0.38858409490833273, 0.06555345317139624, -0.24918896093135356, -0.14747163557116377, 0.17047656475199904, -0.07717473602464392, 0.09802548573104299, 0.06075108496254676, -0.08619921304202986, -0.08354039301191167, -0.31155519634301554, 0.2806319558924278, 0.16625701441223442, 0.294655331774027, -0.045065672450782884, 0.04998212876516398, 0.06374100678157611, -0.1163353504115414, -0.0020754550040707176, -0.2176882079347408, 0.0980064057521751, 0.19447578267923357, 0.18291408500032855, 0.2724291716375938, -0.3161777410442468, -0.23237623064015367, 0.1484532303627214, 0.13016038816054848, 0.0764404793315735, 0.021823432085690656, -0.30076938881309795, 0.021275439051544814, -0.19134881624906155, -0.06413977248994938, -0.08793454265248672, 0.02291844478764449, 0.022705102434332224, -0.36840995206983307, 0.206783573956183, 0.03489202624530394, 0.03410056914912812, 0.011009090282328304, -0.21002238767305542, -0.021036914566944002, 0.017679040782062002, 0.01075388885319775, 0.019126825662497737, 0.12778332620786625, -0.09200435996887686, -0.05177470680863452, 0.2749835357382955, -0.07123354836072454, -0.16371346681119234, 0.09832033640552373, -0.12333107844079066, -0.21487172939728746, 0.07661370706332267, 0.17596222137742232, 0.09002656479877588, -0.14777496600257362, 0.13474205236802772, -0.021061652307074182, 0.18555593737172055, 0.06675008716744936, -0.047979924940412526, 0.17022157671143773, 0.06578137027481418, 0.04586099383619721, 0.028694095412082208, -0.16688535914309782, -0.04373661923789053, -0.2635303430037848, -0.08339977838185121, -0.21721707506975557, -0.010182581990685306, -0.12955711377512893, -0.16899406004765788, 0.37718753734714217, 0.19534312035567813, 0.20812253761925872, 0.09922534422032901, 0.2962024862855123, 0.1371976067999103, -0.027316308845613212, 0.13951371839273813, 0.25694571399572685, 0.1626304774621471, 0.012555915932934427, -0.16377093126738757, 0.1256044167060535, 0.027571098828405815]
|
1,803.06349
|
Two-dimensional Dirac nodal loop magnons in collinear antiferromagnets
|
We study the nontrivial linear magnon band crossings in the collinear
antiferromagnets on the two-dimensional (2D) CaVO lattice, also realized in
some iron-based superconductors such as AFe$_{1.6+x}$Se$_2$ (A = K, Rb, Cs). It
is shown that the combination of space-inversion and time-reversal symmetry
($\mathcal{PT}$-symmetry) leads to doubly-degenerate eight magnon branches,
which cross each other linearly along a one-dimensional loop in the 2D
Brillouin zone. We show that the Dirac nodal loops (DNLs) are not present in
the collinear ferromagnet on this lattice. Thus, the current 2D
antiferromagnetic DNLs are symmetry-protected and they provide a novel platform
to search for their analogs in 2D electronic antiferromagnetic systems.
|
cond-mat.str-el
|
we study the nontrivial linear magnon band crossings in the collinear antiferromagnets on the twodimensional 2d cavo lattice also realized in some ironbased superconductors such as afe_16xse_2 a k rb cs it is shown that the combination of spaceinversion and timereversal symmetry mathcalptsymmetry leads to doublydegenerate eight magnon branches which cross each other linearly along a onedimensional loop in the 2d brillouin zone we show that the dirac nodal loops dnls are not present in the collinear ferromagnet on this lattice thus the current 2d antiferromagnetic dnls are symmetryprotected and they provide a novel platform to search for their analogs in 2d electronic antiferromagnetic systems
|
[['we', 'study', 'the', 'nontrivial', 'linear', 'magnon', 'band', 'crossings', 'in', 'the', 'collinear', 'antiferromagnets', 'on', 'the', 'twodimensional', '2d', 'cavo', 'lattice', 'also', 'realized', 'in', 'some', 'ironbased', 'superconductors', 'such', 'as', 'afe_16xse_2', 'a', 'k', 'rb', 'cs', 'it', 'is', 'shown', 'that', 'the', 'combination', 'of', 'spaceinversion', 'and', 'timereversal', 'symmetry', 'mathcalptsymmetry', 'leads', 'to', 'doublydegenerate', 'eight', 'magnon', 'branches', 'which', 'cross', 'each', 'other', 'linearly', 'along', 'a', 'onedimensional', 'loop', 'in', 'the', '2d', 'brillouin', 'zone', 'we', 'show', 'that', 'the', 'dirac', 'nodal', 'loops', 'dnls', 'are', 'not', 'present', 'in', 'the', 'collinear', 'ferromagnet', 'on', 'this', 'lattice', 'thus', 'the', 'current', '2d', 'antiferromagnetic', 'dnls', 'are', 'symmetryprotected', 'and', 'they', 'provide', 'a', 'novel', 'platform', 'to', 'search', 'for', 'their', 'analogs', 'in', '2d', 'electronic', 'antiferromagnetic', 'systems']]
|
[-0.22720506895012, 0.1836270013025829, 0.00495294699711459, 0.02558499461128598, -0.09836105906981088, -0.17086808595008085, 0.07509478700147676, 0.4237306576632407, -0.2512450121343136, -0.17463981353101277, 0.0420949456536965, -0.3438082326203585, -0.1548517349043063, 0.16615152271863606, 0.0770820771410529, 0.07039202644179264, -0.042889261813390825, -0.025466252692387482, -0.13450631628899526, -0.21739272303169682, 0.28088215653385434, -0.08412983665420186, 0.32058196036765974, 0.037654212278790684, 0.007174352543162448, -0.014557569757813499, 0.15885683702349307, -0.018752829167282298, -0.14781738799578134, 0.07761411704899122, 0.28270010295368375, -0.13588076287969236, 0.1322611949273518, -0.4586043474752279, -0.22032964665087915, 0.0033165648113936187, 0.1875195174522343, 0.17682795101954113, -0.05810447919093782, -0.31170618835659253, 0.03641312994240295, -0.14005799367358643, -0.13835372551943043, -0.1449620895087719, -0.06309159621596336, -0.05308810224800947, -0.17854429224417323, 0.04627819137309589, 0.10950022637844085, 0.1023654164125522, -0.055432402559866506, -0.12033275351028092, -0.15325761555383602, 0.003868852790799879, 0.0348886095408705, 0.0402332607191056, 0.026777211830596483, -0.10576317331842369, -0.18754596113271657, 0.43340185149794536, -0.026836767697352028, -0.13950980504797328, 0.18293329601486524, -0.16917630136013032, -0.13823706092579024, 0.15950958550508534, 0.1140628788265444, 0.06735326636893053, -0.10870988223967808, 0.12576018727406682, -0.10273057193096195, 0.12524870841381405, 0.02917456076968284, 0.09031188462727836, 0.28131269043577567, 0.142427190747999, 0.09866429590398357, 0.13976284858072177, -0.1118292625150865, -0.08464942155849366, -0.2524917895816976, -0.1939175442082896, -0.23732976044217746, 0.0315888296392846, -0.04441020716220096, -0.23437958583318894, 0.41582265393365, 0.14056135210252943, 0.20158554764154057, -0.06683019938146961, 0.2283451497632389, 0.12392746744832644, 0.08561282074078917, 0.05916004328700226, 0.2234427832923497, 0.11387796091093194, 0.09367883008727361, -0.2880425719921255, -0.06860346016695812, 0.08402006948987643]
|
1,803.0635
|
Energetics of turbulence generated by chiral MHD dynamos
|
An asymmetry in the number density of left- and right-handed fermions is
known to give rise to a new term in the induction equation that can result in a
dynamo instability. At high temperatures, when a chiral asymmetry can survive
for long enough, this chiral dynamo instability can amplify magnetic fields
efficiently, which in turn drive turbulence via the Lorentz force. While it has
been demonstrated in numerical simulations that this chiral magnetically driven
turbulence exists and strongly affects the dynamics of the magnetic field, the
details of this process remain unclear. The goal of this paper is to analyse
the energetics of chiral magnetically driven turbulence and its effect on the
generation and dynamics of the magnetic field using direct numerical
simulations. We study these effects for different initial conditions, including
a variation of the initial chiral chemical potential and the magnetic Prandtl
number, Pm. In particular, we determine the ratio of kinetic to magnetic
energy, Upsilon, in chiral magnetically driven turbulence. Within the parameter
space explored in this study, Upsilon reaches a value of approximately
0.064-0.074 -independently of the initial chiral asymmetry and for Pm=1. Our
simulations suggest, that Upsilon decreases as a power law when increasing Pm
by decreasing the viscosity. While the exact scaling depends on the details of
the fitting criteria and the Reynolds number regime, an approximate result of
Upsilon(Pm)=0.1 Pm^{-0.4} is reported. Using the findings from our numerical
simulations, we analyse the energetics of chiral magnetically driven turbulence
in the early Universe.
|
physics.flu-dyn astro-ph.CO astro-ph.HE physics.plasm-ph
|
an asymmetry in the number density of left and righthanded fermions is known to give rise to a new term in the induction equation that can result in a dynamo instability at high temperatures when a chiral asymmetry can survive for long enough this chiral dynamo instability can amplify magnetic fields efficiently which in turn drive turbulence via the lorentz force while it has been demonstrated in numerical simulations that this chiral magnetically driven turbulence exists and strongly affects the dynamics of the magnetic field the details of this process remain unclear the goal of this paper is to analyse the energetics of chiral magnetically driven turbulence and its effect on the generation and dynamics of the magnetic field using direct numerical simulations we study these effects for different initial conditions including a variation of the initial chiral chemical potential and the magnetic prandtl number pm in particular we determine the ratio of kinetic to magnetic energy upsilon in chiral magnetically driven turbulence within the parameter space explored in this study upsilon reaches a value of approximately 00640074 independently of the initial chiral asymmetry and for pm1 our simulations suggest that upsilon decreases as a power law when increasing pm by decreasing the viscosity while the exact scaling depends on the details of the fitting criteria and the reynolds number regime an approximate result of upsilonpm01 pm04 is reported using the findings from our numerical simulations we analyse the energetics of chiral magnetically driven turbulence in the early universe
|
[['an', 'asymmetry', 'in', 'the', 'number', 'density', 'of', 'left', 'and', 'righthanded', 'fermions', 'is', 'known', 'to', 'give', 'rise', 'to', 'a', 'new', 'term', 'in', 'the', 'induction', 'equation', 'that', 'can', 'result', 'in', 'a', 'dynamo', 'instability', 'at', 'high', 'temperatures', 'when', 'a', 'chiral', 'asymmetry', 'can', 'survive', 'for', 'long', 'enough', 'this', 'chiral', 'dynamo', 'instability', 'can', 'amplify', 'magnetic', 'fields', 'efficiently', 'which', 'in', 'turn', 'drive', 'turbulence', 'via', 'the', 'lorentz', 'force', 'while', 'it', 'has', 'been', 'demonstrated', 'in', 'numerical', 'simulations', 'that', 'this', 'chiral', 'magnetically', 'driven', 'turbulence', 'exists', 'and', 'strongly', 'affects', 'the', 'dynamics', 'of', 'the', 'magnetic', 'field', 'the', 'details', 'of', 'this', 'process', 'remain', 'unclear', 'the', 'goal', 'of', 'this', 'paper', 'is', 'to', 'analyse', 'the', 'energetics', 'of', 'chiral', 'magnetically', 'driven', 'turbulence', 'and', 'its', 'effect', 'on', 'the', 'generation', 'and', 'dynamics', 'of', 'the', 'magnetic', 'field', 'using', 'direct', 'numerical', 'simulations', 'we', 'study', 'these', 'effects', 'for', 'different', 'initial', 'conditions', 'including', 'a', 'variation', 'of', 'the', 'initial', 'chiral', 'chemical', 'potential', 'and', 'the', 'magnetic', 'prandtl', 'number', 'pm', 'in', 'particular', 'we', 'determine', 'the', 'ratio', 'of', 'kinetic', 'to', 'magnetic', 'energy', 'upsilon', 'in', 'chiral', 'magnetically', 'driven', 'turbulence', 'within', 'the', 'parameter', 'space', 'explored', 'in', 'this', 'study', 'upsilon', 'reaches', 'a', 'value', 'of', 'approximately', '00640074', 'independently', 'of', 'the', 'initial', 'chiral', 'asymmetry', 'and', 'for', 'pm1', 'our', 'simulations', 'suggest', 'that', 'upsilon', 'decreases', 'as', 'a', 'power', 'law', 'when', 'increasing', 'pm', 'by', 'decreasing', 'the', 'viscosity', 'while', 'the', 'exact', 'scaling', 'depends', 'on', 'the', 'details', 'of', 'the', 'fitting', 'criteria', 'and', 'the', 'reynolds', 'number', 'regime', 'an', 'approximate', 'result', 'of', 'upsilonpm01', 'pm04', 'is', 'reported', 'using', 'the', 'findings', 'from', 'our', 'numerical', 'simulations', 'we', 'analyse', 'the', 'energetics', 'of', 'chiral', 'magnetically', 'driven', 'turbulence', 'in', 'the', 'early', 'universe']]
|
[-0.17240698006958982, 0.22736908939701453, -0.061180844273312614, 0.047859942595471654, -0.03559373650861987, -0.052022617769819736, 0.006280957469019119, 0.31658913111427295, -0.26223294240486644, -0.3138339060390753, 0.05452677447052846, -0.22479445385173535, -0.09198506241513468, 0.18203954975901224, 0.02735794179786283, 0.018911740231480418, -0.004320104020131141, 0.004833783258482256, -0.028572342644147725, -0.1784018071916007, 0.30797542025653746, 0.07332095122134487, 0.26079787709184654, 0.07239137726990498, 0.05405006793408696, -0.07696040141257363, 0.012280133398257287, 0.041317194494629006, -0.18362481173583065, 0.006276509138238936, 0.1591223631811098, 0.006935116400384167, 0.24531153823778803, -0.44855940389458226, -0.20281427563827953, 0.0729756555298479, 0.17829589237061214, 0.1372230169504715, -0.07996682548680557, -0.2439613148064809, 0.09100683909432722, -0.1663190441833892, -0.16101421793802126, -0.08895417204506598, 0.028947846787729062, 0.017701267266160513, -0.31804026913667016, 0.12312780172980733, 0.03850308887006315, 0.07485766574996806, -0.09039979354008987, -0.0754319361754154, -0.07208573065018507, 0.08132387423885021, 0.10638977457599069, 0.06834683348971461, 0.15617842443814306, -0.1884170811357512, -0.0805190817409606, 0.3674822199131977, -0.055394701910420105, -0.1631904805441074, 0.18138095136988258, -0.18774764534644028, -0.11999482508967461, 0.1481757475372389, 0.16352048851097162, 0.09725593360436553, -0.09046599058046002, 0.06170223031861346, -0.045506323344142056, 0.16352163334961542, 0.027287289012894636, -0.011472040271718312, 0.2470725494715468, 0.19160571998750664, 0.022455329214965524, 0.12062774650820414, -0.09901891914969273, -0.09006252764490422, -0.30286876394070295, -0.11688012039988313, -0.17674380236895385, 0.07488754558987795, -0.07728756969291029, -0.15023094777683332, 0.39433380554011654, 0.20630693264769367, 0.18105034979987844, -0.016752140976861875, 0.2994302161568625, 0.14145653869114017, 0.02390309267236155, 0.08412824260346169, 0.30754184159393677, 0.19583981311389884, 0.13858447035751964, -0.31076498225478355, 0.041589674187318876, 0.040061947821756365]
|
1,803.06351
|
Loop Induced Single Top Partner Production and Decay at the LHC
|
Most searches for top partners, $T$, are concerned with top partner pair
production. However, as these bounds become increasingly stringent, the LHC
energy will saturate and single top partner production will become more
important. In this paper we study the novel signature of the top partner
produced in association with the SM top, $pp\rightarrow
T\overline{t}+t\overline{T}$, in a model where the Standard Model (SM) is
extended by a vector-like $SU(2)_L$ singlet fermion top partner and a real, SM
gauge singlet scalar, $S$. In this model, $pp\rightarrow
T\overline{t}+t\overline{T}$ production is possible through loops mediated by
the scalar singlet. We find that, with reasonable coupling strengths, the
production rate of this channel can dominate top partner pair production at top
partner masses of $m_T\gtrsim 1.5$ TeV. In addition, this model allows for the
exotic decay modes $T\rightarrow tg$, $T\rightarrow t \gamma$, and
$T\rightarrow t S$. In much of the parameter space the loop induced decay
$T\rightarrow tg$ dominates and the top partner is quite long lived. New search
strategies are necessary to cover these decay modes. We project the the
sensitivity of the high luminosity LHC to $pp\rightarrow
T\overline{t}+t\overline{T}$ via a realistic collider study. We find with 3
ab$^{-1}$, the LHC is sensitive to this process for masses $m_T\lesssim2$ TeV.
In addition, we provide appendices detailing the renormalization of this model.
|
hep-ph
|
most searches for top partners t are concerned with top partner pair production however as these bounds become increasingly stringent the lhc energy will saturate and single top partner production will become more important in this paper we study the novel signature of the top partner produced in association with the sm top pprightarrow toverlinettoverlinet in a model where the standard model sm is extended by a vectorlike su2_l singlet fermion top partner and a real sm gauge singlet scalar s in this model pprightarrow toverlinettoverlinet production is possible through loops mediated by the scalar singlet we find that with reasonable coupling strengths the production rate of this channel can dominate top partner pair production at top partner masses of m_tgtrsim 15 tev in addition this model allows for the exotic decay modes trightarrow tg trightarrow t gamma and trightarrow t s in much of the parameter space the loop induced decay trightarrow tg dominates and the top partner is quite long lived new search strategies are necessary to cover these decay modes we project the the sensitivity of the high luminosity lhc to pprightarrow toverlinettoverlinet via a realistic collider study we find with 3 ab1 the lhc is sensitive to this process for masses m_tlesssim2 tev in addition we provide appendices detailing the renormalization of this model
|
[['most', 'searches', 'for', 'top', 'partners', 't', 'are', 'concerned', 'with', 'top', 'partner', 'pair', 'production', 'however', 'as', 'these', 'bounds', 'become', 'increasingly', 'stringent', 'the', 'lhc', 'energy', 'will', 'saturate', 'and', 'single', 'top', 'partner', 'production', 'will', 'become', 'more', 'important', 'in', 'this', 'paper', 'we', 'study', 'the', 'novel', 'signature', 'of', 'the', 'top', 'partner', 'produced', 'in', 'association', 'with', 'the', 'sm', 'top', 'pprightarrow', 'toverlinettoverlinet', 'in', 'a', 'model', 'where', 'the', 'standard', 'model', 'sm', 'is', 'extended', 'by', 'a', 'vectorlike', 'su2_l', 'singlet', 'fermion', 'top', 'partner', 'and', 'a', 'real', 'sm', 'gauge', 'singlet', 'scalar', 's', 'in', 'this', 'model', 'pprightarrow', 'toverlinettoverlinet', 'production', 'is', 'possible', 'through', 'loops', 'mediated', 'by', 'the', 'scalar', 'singlet', 'we', 'find', 'that', 'with', 'reasonable', 'coupling', 'strengths', 'the', 'production', 'rate', 'of', 'this', 'channel', 'can', 'dominate', 'top', 'partner', 'pair', 'production', 'at', 'top', 'partner', 'masses', 'of', 'm_tgtrsim', '15', 'tev', 'in', 'addition', 'this', 'model', 'allows', 'for', 'the', 'exotic', 'decay', 'modes', 'trightarrow', 'tg', 'trightarrow', 't', 'gamma', 'and', 'trightarrow', 't', 's', 'in', 'much', 'of', 'the', 'parameter', 'space', 'the', 'loop', 'induced', 'decay', 'trightarrow', 'tg', 'dominates', 'and', 'the', 'top', 'partner', 'is', 'quite', 'long', 'lived', 'new', 'search', 'strategies', 'are', 'necessary', 'to', 'cover', 'these', 'decay', 'modes', 'we', 'project', 'the', 'the', 'sensitivity', 'of', 'the', 'high', 'luminosity', 'lhc', 'to', 'pprightarrow', 'toverlinettoverlinet', 'via', 'a', 'realistic', 'collider', 'study', 'we', 'find', 'with', '3', 'ab1', 'the', 'lhc', 'is', 'sensitive', 'to', 'this', 'process', 'for', 'masses', 'm_tlesssim2', 'tev', 'in', 'addition', 'we', 'provide', 'appendices', 'detailing', 'the', 'renormalization', 'of', 'this', 'model']]
|
[-0.09686541238948444, 0.27955954998550525, -0.015221077651302848, 0.15444520591461663, -0.07564455417795451, -0.22181946344682257, 0.052035427167774526, 0.335568693621705, -0.22713045623310824, -0.2704310307701774, 0.030468915948639968, -0.32446180360454524, -0.011225215986390443, 0.12046141008182464, 0.09663107729930845, 0.045468890654134425, 0.09856891042781407, 0.0617658476943756, -0.005244388414549003, -0.24175101090696882, 0.2673668721949475, 0.04798780011090761, 0.20958784123434238, 0.13211945792729105, -0.00726234325729483, 0.03179680448374711, -0.013807534931941147, -0.12468577409392176, -0.12126364219730695, 0.0715735840381563, 0.18299146736454633, 0.054318920538881446, 0.14345898059696924, -0.3269735968206078, -0.0944527955941373, 0.19006492567671188, 0.15860408763573677, 0.06732213180792448, -0.08416984940123695, -0.28713783504510365, 0.14604834418612342, -0.24133166236182055, -0.10544917867863896, -0.03096142068022379, -0.014607592285352035, -0.10548285361760969, -0.33642148845225434, 0.060204756573511986, -0.054711028610957634, 0.026827903440183338, 0.028395181894464057, -0.1802742437209451, -0.12127842164611341, 0.003635402673993398, 0.12526527897460726, 0.050448140094953554, 0.1930054778629845, -0.19315768971702912, -0.16868325611209944, 0.3523771759829725, -0.16496912314323708, -0.16204942434517391, 0.21004468009885857, -0.15825236157979816, -0.1544696234743444, 0.1133227711500324, 0.2445897646550158, 0.11919626536028874, -0.19577979896200337, 0.1756616200835668, 0.020183918762389414, 0.13869761646276824, 0.0407474543036962, 0.07245493069597243, 0.23102339587920276, 0.24880512029846646, 0.019784041162994172, 0.10023882082896307, -0.07278247669778971, -0.10481945860131721, -0.4277257305242259, -0.18436917387158178, -0.030293944485795993, 0.054709014351828955, -0.010288995610608254, -0.06413552130915276, 0.4020773791923636, 0.11503968303117694, 0.2745272155713152, 0.009571678111872947, 0.2569221041652512, 0.08192034214718863, 0.09243409101556474, 0.06076213275318204, 0.2987130271331235, 0.10860877350205556, 0.1293346161535872, -0.19129054347501584, 0.019452407094865554, 0.03842333773327819]
|
1,803.06352
|
Age-resolved chemistry of red giants in the solar neighbourhood
|
In the age of high-resolution spectroscopic stellar surveys of the Milky Way,
the number of stars with detailed abundances of multiple elements is rapidly
increasing. These elemental abundances are directly influenced by the
evolutionary history of the Galaxy, but this can be difficult to interpret
without an absolute timeline of the abundance enrichment. We present
age-abundance trends for [M/H], [{\alpha}/M], and 17 individual elements using
a sample of 721 solar neighbourhood Hipparcos red giant stars observed by
APOGEE. These age trends are determined through a Bayesian hierarchical
modelling method presented by Feuillet et al. (2016). We confirm that the
[{\alpha}/M]- age relation in the solar neighbourhood is steep and relatively
narrow (0.20 dex age dispersion), as are the [O/M]- and [Mg/M]-age relations.
The age trend of [C/N] is steep and smooth, consistent with stellar evolution.
The [M/H]-age relation has a mean age dispersion of 0.28 dex and a complex
overall structure. The oldest stars in our sample are those with the lowest and
highest metallicities, while the youngest stars are those with solar
metallicity. These results provide strong constraints on theoretical models of
Galactic chemical evolution (GCE). We compare them to the predictions of
one-zone GCE mod- els and multi-zone mixtures, both analytic and numerical.
These comparisons support the hypothesis that the solar neighbourhood is
composed of stars born at a range of Galactocentric radii, and that the most
metal-rich stars likely migrated from a region with earlier and more rapid star
formation such as the inner Galaxy.
|
astro-ph.GA
|
in the age of highresolution spectroscopic stellar surveys of the milky way the number of stars with detailed abundances of multiple elements is rapidly increasing these elemental abundances are directly influenced by the evolutionary history of the galaxy but this can be difficult to interpret without an absolute timeline of the abundance enrichment we present ageabundance trends for mh alpham and 17 individual elements using a sample of 721 solar neighbourhood hipparcos red giant stars observed by apogee these age trends are determined through a bayesian hierarchical modelling method presented by feuillet et al 2016 we confirm that the alpham age relation in the solar neighbourhood is steep and relatively narrow 020 dex age dispersion as are the om and mgmage relations the age trend of cn is steep and smooth consistent with stellar evolution the mhage relation has a mean age dispersion of 028 dex and a complex overall structure the oldest stars in our sample are those with the lowest and highest metallicities while the youngest stars are those with solar metallicity these results provide strong constraints on theoretical models of galactic chemical evolution gce we compare them to the predictions of onezone gce mod els and multizone mixtures both analytic and numerical these comparisons support the hypothesis that the solar neighbourhood is composed of stars born at a range of galactocentric radii and that the most metalrich stars likely migrated from a region with earlier and more rapid star formation such as the inner galaxy
|
[['in', 'the', 'age', 'of', 'highresolution', 'spectroscopic', 'stellar', 'surveys', 'of', 'the', 'milky', 'way', 'the', 'number', 'of', 'stars', 'with', 'detailed', 'abundances', 'of', 'multiple', 'elements', 'is', 'rapidly', 'increasing', 'these', 'elemental', 'abundances', 'are', 'directly', 'influenced', 'by', 'the', 'evolutionary', 'history', 'of', 'the', 'galaxy', 'but', 'this', 'can', 'be', 'difficult', 'to', 'interpret', 'without', 'an', 'absolute', 'timeline', 'of', 'the', 'abundance', 'enrichment', 'we', 'present', 'ageabundance', 'trends', 'for', 'mh', 'alpham', 'and', '17', 'individual', 'elements', 'using', 'a', 'sample', 'of', '721', 'solar', 'neighbourhood', 'hipparcos', 'red', 'giant', 'stars', 'observed', 'by', 'apogee', 'these', 'age', 'trends', 'are', 'determined', 'through', 'a', 'bayesian', 'hierarchical', 'modelling', 'method', 'presented', 'by', 'feuillet', 'et', 'al', '2016', 'we', 'confirm', 'that', 'the', 'alpham', 'age', 'relation', 'in', 'the', 'solar', 'neighbourhood', 'is', 'steep', 'and', 'relatively', 'narrow', '020', 'dex', 'age', 'dispersion', 'as', 'are', 'the', 'om', 'and', 'mgmage', 'relations', 'the', 'age', 'trend', 'of', 'cn', 'is', 'steep', 'and', 'smooth', 'consistent', 'with', 'stellar', 'evolution', 'the', 'mhage', 'relation', 'has', 'a', 'mean', 'age', 'dispersion', 'of', '028', 'dex', 'and', 'a', 'complex', 'overall', 'structure', 'the', 'oldest', 'stars', 'in', 'our', 'sample', 'are', 'those', 'with', 'the', 'lowest', 'and', 'highest', 'metallicities', 'while', 'the', 'youngest', 'stars', 'are', 'those', 'with', 'solar', 'metallicity', 'these', 'results', 'provide', 'strong', 'constraints', 'on', 'theoretical', 'models', 'of', 'galactic', 'chemical', 'evolution', 'gce', 'we', 'compare', 'them', 'to', 'the', 'predictions', 'of', 'onezone', 'gce', 'mod', 'els', 'and', 'multizone', 'mixtures', 'both', 'analytic', 'and', 'numerical', 'these', 'comparisons', 'support', 'the', 'hypothesis', 'that', 'the', 'solar', 'neighbourhood', 'is', 'composed', 'of', 'stars', 'born', 'at', 'a', 'range', 'of', 'galactocentric', 'radii', 'and', 'that', 'the', 'most', 'metalrich', 'stars', 'likely', 'migrated', 'from', 'a', 'region', 'with', 'earlier', 'and', 'more', 'rapid', 'star', 'formation', 'such', 'as', 'the', 'inner', 'galaxy']]
|
[-0.023448700597034577, 0.13311442737889295, -0.061504536207613286, 0.08673108209599266, -0.09914656707456297, -0.022855199516658216, 0.08248098130261867, 0.4416107157910509, -0.1665318133504301, -0.41470067767920543, -0.005870720046116229, -0.30839478078545357, -0.04299518124067358, 0.20454385435512784, -0.07656064868954543, -0.006237534021160432, 0.11216865362105322, -0.05146920514585241, -0.051623495876294924, -0.26919522830095066, 0.29175166247450574, 0.05378993604123136, 0.13212376622749225, -0.07949040120144432, -0.009261178493271677, -0.1602770764038575, -0.07973362698542828, 0.0008871255081375034, -0.1567585436546194, 0.08195986560716921, 0.2454086269192161, 0.16253945497719913, 0.22062231478357344, -0.3409072289544476, -0.20877119384858073, 0.032769084410095704, 0.21387627387647423, 0.013520776324107179, -0.11963204553675107, -0.23748301841622713, 0.09498026023039176, -0.17629766825548543, -0.18702035272417933, 0.06719119609428607, 0.05464494968788242, 0.05094679355245958, -0.2343520270482333, 0.1501515260774034, 0.008032583731359668, 0.15882684451584914, -0.13211067679471203, -0.18362188778855668, -0.09784785929345051, 0.1270811568413462, -0.006514156689601285, 0.04394880105095098, 0.15008235167027736, -0.06724178402954731, 0.018035751761754558, 0.3961576097245727, -0.09656750886149856, -0.0062823816607658735, 0.22779096647222735, -0.19646124986513536, -0.16699266160781287, 0.043969846394076965, 0.1303055295255035, 0.130178627077186, -0.19603640516977566, 0.029012203772970455, -0.011273337327590099, 0.19348998292615371, 0.029711747182799238, -0.0009176060128529385, 0.3000862611400686, 0.13292388252258225, 0.009175166292876308, -0.015147593332578105, -0.18464179883380802, -0.08848692455794663, -0.20634412768757807, -0.12817983329106047, -0.07008288860777202, 0.0565794105090353, -0.19732511835113375, -0.1467348615933514, 0.3413848777121047, 0.12262686561526996, 0.2543269402860683, 0.08665479963748687, 0.294731734102896, 0.0950798789243575, 0.10241030624625748, 0.11109565400651523, 0.286497917934796, 0.21588160416624527, 0.08360151629562357, -0.2552509398788822, 0.14968044896591073, 0.0010735182243646407]
|
1,803.06353
|
Potentials for Moduli Spaces of A_m-local Systems on Surfaces
|
We study properties of potentials on quivers $Q_{\mathcal{T},m}$ arising from
cluster coordinates on moduli spaces of $PGL_{m+1}$-local systems on a
topological surface with punctures. To every quiver with potential one can
associate a $3d$ Calabi-Yau $A_\infty$-category in such a way that a natural
notion of equivalence for quivers with potentials (called "right-equivalence")
translates to $A_\infty$-equivalence of associated categories.
For any quiver one can define a notion of a "primitive" potential. Our first
result is the description of the space of equivalence classes of primitive
potentials on quivers $Q_{\mathcal{T}, m}$. Then we provide a full description
of the space of equivalence classes of all \emph{generic} potentials for the
case $m = 2$ (corresponds to $PGL_3$-local systems). In particular, we show
that it is finite-dimensional. This claim extends results of Gei\ss,
Labardini-Fragoso and Schr\"oer who have proved analogous statement in $m=1$
case.
In many cases $3d$ Calabi-Yau $A_\infty$-categories constructed from quivers
with potentials are expected to be realized geometrically as Fukaya categories
of certain Calabi-Yau $3$-folds. Bridgeland and Smith gave an explicit
construction of Fukaya categories for quivers $Q_{\mathcal{T},m=1}$. We propose
a candidate for Calabi-Yau $3$-folds that would play analogous role in higher
rank cases, $m > 1$. We study their (co)homology and describe a construction of
collections of $3$-dimensional spheres that should play a role of generating
collections of Lagrangian spheres in corresponding Fukaya categories.
|
math.RT math.AG
|
we study properties of potentials on quivers q_mathcaltm arising from cluster coordinates on moduli spaces of pgl_m1local systems on a topological surface with punctures to every quiver with potential one can associate a 3d calabiyau a_inftycategory in such a way that a natural notion of equivalence for quivers with potentials called rightequivalence translates to a_inftyequivalence of associated categories for any quiver one can define a notion of a primitive potential our first result is the description of the space of equivalence classes of primitive potentials on quivers q_mathcalt m then we provide a full description of the space of equivalence classes of all emphgeneric potentials for the case m 2 corresponds to pgl_3local systems in particular we show that it is finitedimensional this claim extends results of geiss labardinifragoso and schroer who have proved analogous statement in m1 case in many cases 3d calabiyau a_inftycategories constructed from quivers with potentials are expected to be realized geometrically as fukaya categories of certain calabiyau 3folds bridgeland and smith gave an explicit construction of fukaya categories for quivers q_mathcaltm1 we propose a candidate for calabiyau 3folds that would play analogous role in higher rank cases m 1 we study their cohomology and describe a construction of collections of 3dimensional spheres that should play a role of generating collections of lagrangian spheres in corresponding fukaya categories
|
[['we', 'study', 'properties', 'of', 'potentials', 'on', 'quivers', 'q_mathcaltm', 'arising', 'from', 'cluster', 'coordinates', 'on', 'moduli', 'spaces', 'of', 'pgl_m1local', 'systems', 'on', 'a', 'topological', 'surface', 'with', 'punctures', 'to', 'every', 'quiver', 'with', 'potential', 'one', 'can', 'associate', 'a', '3d', 'calabiyau', 'a_inftycategory', 'in', 'such', 'a', 'way', 'that', 'a', 'natural', 'notion', 'of', 'equivalence', 'for', 'quivers', 'with', 'potentials', 'called', 'rightequivalence', 'translates', 'to', 'a_inftyequivalence', 'of', 'associated', 'categories', 'for', 'any', 'quiver', 'one', 'can', 'define', 'a', 'notion', 'of', 'a', 'primitive', 'potential', 'our', 'first', 'result', 'is', 'the', 'description', 'of', 'the', 'space', 'of', 'equivalence', 'classes', 'of', 'primitive', 'potentials', 'on', 'quivers', 'q_mathcalt', 'm', 'then', 'we', 'provide', 'a', 'full', 'description', 'of', 'the', 'space', 'of', 'equivalence', 'classes', 'of', 'all', 'emphgeneric', 'potentials', 'for', 'the', 'case', 'm', '2', 'corresponds', 'to', 'pgl_3local', 'systems', 'in', 'particular', 'we', 'show', 'that', 'it', 'is', 'finitedimensional', 'this', 'claim', 'extends', 'results', 'of', 'geiss', 'labardinifragoso', 'and', 'schroer', 'who', 'have', 'proved', 'analogous', 'statement', 'in', 'm1', 'case', 'in', 'many', 'cases', '3d', 'calabiyau', 'a_inftycategories', 'constructed', 'from', 'quivers', 'with', 'potentials', 'are', 'expected', 'to', 'be', 'realized', 'geometrically', 'as', 'fukaya', 'categories', 'of', 'certain', 'calabiyau', '3folds', 'bridgeland', 'and', 'smith', 'gave', 'an', 'explicit', 'construction', 'of', 'fukaya', 'categories', 'for', 'quivers', 'q_mathcaltm1', 'we', 'propose', 'a', 'candidate', 'for', 'calabiyau', '3folds', 'that', 'would', 'play', 'analogous', 'role', 'in', 'higher', 'rank', 'cases', 'm', '1', 'we', 'study', 'their', 'cohomology', 'and', 'describe', 'a', 'construction', 'of', 'collections', 'of', '3dimensional', 'spheres', 'that', 'should', 'play', 'a', 'role', 'of', 'generating', 'collections', 'of', 'lagrangian', 'spheres', 'in', 'corresponding', 'fukaya', 'categories']]
|
[-0.16680295656961217, 0.05302979322900851, -0.08874380297277605, 0.1013147931624661, -0.0569260681793956, -0.155976953924875, -0.026976449944346247, 0.3424755797669705, -0.25808788564366597, -0.265075538366175, 0.05394326243226209, -0.22706308609297224, -0.1926196518017807, 0.18609283509323615, -0.19733058610129067, -0.053750113750100824, 0.07734553259474018, 0.05123665987600732, -0.08942510227724496, -0.3047995157755428, 0.4580728281127651, -0.0412013126252633, 0.20820061260773973, 0.02334002401201158, 0.09438044214146901, 0.014428541360690293, 0.005166272415037922, 0.015937375358404365, -0.1491957809136053, 0.17792720066952622, 0.30230979894770793, 0.06381664367789333, 0.1461670243752114, -0.37638170643064467, -0.15620226748972157, 0.19179194201542824, 0.12038963115547732, 0.09494102494015048, -0.033490124751417036, -0.2745449726547425, 0.0998289552118405, -0.1922201630573168, -0.17768826945339916, -0.09573717622077782, 0.10793893220155344, 0.03360505970151819, -0.2409724634554651, -0.04022874442981211, 0.0841916166008795, 0.1017891668781414, -0.11262192422118797, -0.08396345854055619, -0.09219043435102019, 0.10565642636976447, -0.03188136490751748, 0.046311306021245266, 0.08869129203500321, -0.1381674729184144, -0.1532347974711296, 0.37789255873347566, -0.024194922121414157, -0.22079331111874329, 0.1790131900192204, -0.08939301545561412, -0.19105918467889918, 0.12112769420060364, 0.0920583902021732, 0.1651120850714236, -0.05019767396583187, 0.16317825028548855, -0.11582754399299759, 0.049584218783787, 0.12567881713039242, 0.01880736445525178, 0.20149816466167708, 0.12430249848855762, 0.05749588296128894, 0.16112449774744972, 0.002162322664743341, -0.05783508911150016, -0.3622479447534446, -0.20574213806954772, -0.08324795175307102, 0.14740962590494072, -0.08847288455776665, -0.1635306166954925, 0.3543350074517851, 0.0707554478129303, 0.2145398752246466, 0.12880132101724517, 0.15617225049559405, 0.013364502288082062, 0.08020516885854131, -0.0037276143694826816, 0.15022314352487834, 0.2039588219874228, -0.0037856173692960983, -0.08579279145649504, -0.056142889224079055, 0.24302692568744533]
|
1,803.06354
|
Serverless Data Analytics with Flint
|
Serverless architectures organized around loosely-coupled function
invocations represent an emerging design for many applications. Recent work
mostly focuses on user-facing products and event-driven processing pipelines.
In this paper, we explore a completely different part of the application space
and examine the feasibility of analytical processing on big data using a
serverless architecture. We present Flint, a prototype Spark execution engine
that takes advantage of AWS Lambda to provide a pure pay-as-you-go cost model.
With Flint, a developer uses PySpark exactly as before, but without needing an
actual Spark cluster. We describe the design, implementation, and performance
of Flint, along with the challenges associated with serverless analytics.
|
cs.DC cs.DB
|
serverless architectures organized around looselycoupled function invocations represent an emerging design for many applications recent work mostly focuses on userfacing products and eventdriven processing pipelines in this paper we explore a completely different part of the application space and examine the feasibility of analytical processing on big data using a serverless architecture we present flint a prototype spark execution engine that takes advantage of aws lambda to provide a pure payasyougo cost model with flint a developer uses pyspark exactly as before but without needing an actual spark cluster we describe the design implementation and performance of flint along with the challenges associated with serverless analytics
|
[['serverless', 'architectures', 'organized', 'around', 'looselycoupled', 'function', 'invocations', 'represent', 'an', 'emerging', 'design', 'for', 'many', 'applications', 'recent', 'work', 'mostly', 'focuses', 'on', 'userfacing', 'products', 'and', 'eventdriven', 'processing', 'pipelines', 'in', 'this', 'paper', 'we', 'explore', 'a', 'completely', 'different', 'part', 'of', 'the', 'application', 'space', 'and', 'examine', 'the', 'feasibility', 'of', 'analytical', 'processing', 'on', 'big', 'data', 'using', 'a', 'serverless', 'architecture', 'we', 'present', 'flint', 'a', 'prototype', 'spark', 'execution', 'engine', 'that', 'takes', 'advantage', 'of', 'aws', 'lambda', 'to', 'provide', 'a', 'pure', 'payasyougo', 'cost', 'model', 'with', 'flint', 'a', 'developer', 'uses', 'pyspark', 'exactly', 'as', 'before', 'but', 'without', 'needing', 'an', 'actual', 'spark', 'cluster', 'we', 'describe', 'the', 'design', 'implementation', 'and', 'performance', 'of', 'flint', 'along', 'with', 'the', 'challenges', 'associated', 'with', 'serverless', 'analytics']]
|
[-0.13407942246566615, -0.02418399324288091, -0.06581411150916708, -0.009911429660860449, -0.11729618346424035, -0.12876492017827365, 0.041111515113372216, 0.4064955974331583, -0.25134942908595614, -0.31466315762262864, 0.14049515601374946, -0.2581165726208743, -0.1484428677479473, 0.23052014333398063, -0.07027957047212799, 0.06403382645287323, 0.1148421441925303, 0.0056415024361208535, -0.04439270108957986, -0.23016902015605978, 0.27920065512046005, 0.08561730155510441, 0.30573958592085204, 0.04374534052462792, 0.0887482989258748, 0.02094474351385011, -0.03532335973830173, -0.04226132131534198, -0.07884562865179966, 0.1582979236269273, 0.2750306433607069, 0.252365266350713, 0.3323495585937053, -0.4948983433884832, -0.13796323957800302, 0.04597998691740872, 0.14701860569382333, 0.03520412210656224, -0.11233840275002327, -0.2759722256681548, 0.08430677393170179, -0.2514271723844533, -0.07876617874827166, -0.0917096229748941, 0.0024006773963711173, 0.011202916590813196, -0.2250147140848468, -0.05546493215029532, 0.018493746867500035, 0.0776465741636337, -0.03310183486774924, -0.10063495212410278, 0.06333129928570311, 0.13047359164206768, -0.03511026682758282, 0.022206354684213985, 0.18121396584594446, -0.11350041632057291, -0.15503101364516145, 0.3828697344463951, -0.01617012900862632, -0.13919613420752422, 0.20916328314507274, 0.009563347069933167, -0.19922144884981638, 0.052208173492888234, 0.2370908335631028, 0.05103222285573072, -0.18266874329925006, 0.10999836886542155, 0.041853604900852756, 0.1775788832236222, 0.04156911952359567, 0.003379278474724588, 0.2051806828437619, 0.27540222725848545, 0.028322943450579913, 0.20866555876081, -0.02811457384608352, -0.10175927326891501, -0.2594576099149461, -0.1994075972569298, -0.13390512618605258, -0.0004596018258763372, -0.0566325074646299, -0.17585906638535406, 0.37277128024220046, 0.20210842749560778, 0.1757585378451589, 0.07274152422850987, 0.39672277171059317, 0.010634049754545866, 0.11261208552234578, 0.1314847395966216, 0.10853050503756781, -0.024184252888860426, 0.21533915899553388, -0.14962195424458566, 0.060643046054295, -0.000137357403664797]
|
1,803.06355
|
A Low-rank Tensor Regularization Strategy for Hyperspectral Unmixing
|
Tensor-based methods have recently emerged as a more natural and effective
formulation to address many problems in hyperspectral imaging. In hyperspectral
unmixing (HU), low-rank constraints on the abundance maps have been shown to
act as a regularization which adequately accounts for the multidimensional
structure of the underlying signal. However, imposing a strict low-rank
constraint for the abundance maps does not seem to be adequate, as important
information that may be required to represent fine scale abundance behavior may
be discarded. This paper introduces a new low-rank tensor regularization that
adequately captures the low-rank structure underlying the abundance maps
without hindering the flexibility of the solution. Simulation results with
synthetic and real data show that the the extra flexibility introduced by the
proposed regularization significantly improves the unmixing results.
|
cs.CV
|
tensorbased methods have recently emerged as a more natural and effective formulation to address many problems in hyperspectral imaging in hyperspectral unmixing hu lowrank constraints on the abundance maps have been shown to act as a regularization which adequately accounts for the multidimensional structure of the underlying signal however imposing a strict lowrank constraint for the abundance maps does not seem to be adequate as important information that may be required to represent fine scale abundance behavior may be discarded this paper introduces a new lowrank tensor regularization that adequately captures the lowrank structure underlying the abundance maps without hindering the flexibility of the solution simulation results with synthetic and real data show that the the extra flexibility introduced by the proposed regularization significantly improves the unmixing results
|
[['tensorbased', 'methods', 'have', 'recently', 'emerged', 'as', 'a', 'more', 'natural', 'and', 'effective', 'formulation', 'to', 'address', 'many', 'problems', 'in', 'hyperspectral', 'imaging', 'in', 'hyperspectral', 'unmixing', 'hu', 'lowrank', 'constraints', 'on', 'the', 'abundance', 'maps', 'have', 'been', 'shown', 'to', 'act', 'as', 'a', 'regularization', 'which', 'adequately', 'accounts', 'for', 'the', 'multidimensional', 'structure', 'of', 'the', 'underlying', 'signal', 'however', 'imposing', 'a', 'strict', 'lowrank', 'constraint', 'for', 'the', 'abundance', 'maps', 'does', 'not', 'seem', 'to', 'be', 'adequate', 'as', 'important', 'information', 'that', 'may', 'be', 'required', 'to', 'represent', 'fine', 'scale', 'abundance', 'behavior', 'may', 'be', 'discarded', 'this', 'paper', 'introduces', 'a', 'new', 'lowrank', 'tensor', 'regularization', 'that', 'adequately', 'captures', 'the', 'lowrank', 'structure', 'underlying', 'the', 'abundance', 'maps', 'without', 'hindering', 'the', 'flexibility', 'of', 'the', 'solution', 'simulation', 'results', 'with', 'synthetic', 'and', 'real', 'data', 'show', 'that', 'the', 'the', 'extra', 'flexibility', 'introduced', 'by', 'the', 'proposed', 'regularization', 'significantly', 'improves', 'the', 'unmixing', 'results']]
|
[-0.027311891006320366, 0.007361791253060801, -0.08827701264817733, 0.08670893216458353, -0.14583545136338216, -0.13586160996237595, -0.03930862569450255, 0.3917622193985153, -0.2989182922465261, -0.35586162164690904, 0.14440426877354184, -0.2077555719515658, -0.18977171461301623, 0.11834851519961376, -0.12775992136448622, 0.09829809540951828, 0.08705446869134903, -0.02315463943793361, -0.07474985757289687, -0.24469461039643647, 0.284289388670004, 0.10802633757703006, 0.2882750846183626, 0.06117230858399125, 0.10295403243162582, -0.04461898313820711, -0.0707856992376037, 0.06067384934431175, -0.03665562470536088, 0.15139755375639652, 0.29250729734485503, 0.19772385939177184, 0.2733033158474427, -0.4281774823757587, -0.3295125423464924, 0.13880547873486648, 0.17435299613134703, 0.08427332866540382, -0.07864272069821254, -0.28162786216125824, 0.0779266210993228, -0.11141684007816366, -0.05289210036789882, -0.1855552393317339, -0.056897524230407726, -0.043846944782671926, -0.34203348141545575, 0.07147415534814172, 0.06918817383848364, -0.004405072235385887, -0.09394065615560976, -0.16420713040497503, -0.014202286121644647, 0.1138086186547298, 0.06042829032048758, 0.0017958402559088427, 0.09997932017722633, -0.11414058139962435, -0.08570534861655688, 0.409792295016814, -0.07740401823502907, -0.23563374572404427, 0.18273709993081866, -0.06120789515625802, -0.20973453286205768, 0.13916112198057817, 0.1632293491056771, 0.08171335836232174, -0.16063330249835417, 0.1077736767974784, -0.05959339735272806, 0.19953979742422234, 0.03748842091226834, 0.04359197661324288, 0.15372343493800145, 0.16393730173876975, 0.09849987522056836, 0.066186431479764, -0.10583147104625823, -0.05846457611914957, -0.2095408074601437, -0.12052755956392502, -0.20313587192140403, -0.007477705610540397, -0.13958893610811174, -0.1681252173991652, 0.3851116130463197, 0.19487817981462285, 0.27017171367742776, 0.021642657055963355, 0.35955535129323835, 0.09145409989378095, 0.13124234047791106, 0.02838993446493987, 0.21714498927030945, 0.12514248796105676, 0.10878440405895162, -0.19456689538674254, 0.11077112905877584, 0.060667373803880764]
|
1,803.06356
|
The Spitzer-IRAC/MIPS Extragalactic Survey (SIMES): II enhanced nuclear
accretion rate in galaxy groups at z$\sim$0.2
|
For a sample of star forming galaxies in the redshift interval
0.15$<$z$<$0.3, we study how both the relative strength of the AGN infra-red
emission, compared to that due to the star formation (SF), and the numerical
fraction of AGNs, change as a function of the total stellar mass of the hosting
galaxy group (M$^{*}_{\mathrm{group}}$), between $10^{10.25}$ and
$10^{11.9}$M$_{\odot}$. Using a multi-component SED fitting analysis, we
separate the contribution of stars, AGN torus and star formation to the total
emission at different wavelengths. This technique is applied to a new
multi-wavelength data-set in the SIMES field (23 not redundant photometric
bands), spanning the wavelength range from the UV (GALEX) to the far-IR
(Herschel) and including crucial AKARI and WISE mid-IR observations (4.5 \mu
m$<\lambda<$24 \mu m), where the BH thermal emission is stronger. This new
photometric catalog, that includes our best photo-z estimates, is released
through the NASA/IPAC Infrared Science Archive (IRSA). Groups are identified
through a friends of friends algorithm ($\sim$62% purity, $\sim$51%
completeness). We identified a total of 45 galaxies requiring an AGN emission
component, 35 of which in groups and 10 in the field. We find BHAR$\propto
($M$^{*}_{\mathrm{group}})^{1.21\pm0.27}$ and (BHAR/SFR)$\propto
($M$^{*}_{\mathrm{group}})^{1.04\pm0.24}$ while, in the same range of
M$^{*}_{\mathrm{group}}$, we do not observe any sensible change in the
numerical fraction of AGNs. Our results indicate that the nuclear activity
(i.e. the BHAR and the BHAR/SFR ratio) is enhanced when galaxies are located in
more massive and richer groups.
|
astro-ph.GA astro-ph.CO
|
for a sample of star forming galaxies in the redshift interval 015z03 we study how both the relative strength of the agn infrared emission compared to that due to the star formation sf and the numerical fraction of agns change as a function of the total stellar mass of the hosting galaxy group m_mathrmgroup between 101025 and 10119m_odot using a multicomponent sed fitting analysis we separate the contribution of stars agn torus and star formation to the total emission at different wavelengths this technique is applied to a new multiwavelength dataset in the simes field 23 not redundant photometric bands spanning the wavelength range from the uv galex to the farir herschel and including crucial akari and wise midir observations 45 mu mlambda24 mu m where the bh thermal emission is stronger this new photometric catalog that includes our best photoz estimates is released through the nasaipac infrared science archive irsa groups are identified through a friends of friends algorithm sim62 purity sim51 completeness we identified a total of 45 galaxies requiring an agn emission component 35 of which in groups and 10 in the field we find bharpropto m_mathrmgroup121pm027 and bharsfrpropto m_mathrmgroup104pm024 while in the same range of m_mathrmgroup we do not observe any sensible change in the numerical fraction of agns our results indicate that the nuclear activity ie the bhar and the bharsfr ratio is enhanced when galaxies are located in more massive and richer groups
|
[['for', 'a', 'sample', 'of', 'star', 'forming', 'galaxies', 'in', 'the', 'redshift', 'interval', '015z03', 'we', 'study', 'how', 'both', 'the', 'relative', 'strength', 'of', 'the', 'agn', 'infrared', 'emission', 'compared', 'to', 'that', 'due', 'to', 'the', 'star', 'formation', 'sf', 'and', 'the', 'numerical', 'fraction', 'of', 'agns', 'change', 'as', 'a', 'function', 'of', 'the', 'total', 'stellar', 'mass', 'of', 'the', 'hosting', 'galaxy', 'group', 'm_mathrmgroup', 'between', '101025', 'and', '10119m_odot', 'using', 'a', 'multicomponent', 'sed', 'fitting', 'analysis', 'we', 'separate', 'the', 'contribution', 'of', 'stars', 'agn', 'torus', 'and', 'star', 'formation', 'to', 'the', 'total', 'emission', 'at', 'different', 'wavelengths', 'this', 'technique', 'is', 'applied', 'to', 'a', 'new', 'multiwavelength', 'dataset', 'in', 'the', 'simes', 'field', '23', 'not', 'redundant', 'photometric', 'bands', 'spanning', 'the', 'wavelength', 'range', 'from', 'the', 'uv', 'galex', 'to', 'the', 'farir', 'herschel', 'and', 'including', 'crucial', 'akari', 'and', 'wise', 'midir', 'observations', '45', 'mu', 'mlambda24', 'mu', 'm', 'where', 'the', 'bh', 'thermal', 'emission', 'is', 'stronger', 'this', 'new', 'photometric', 'catalog', 'that', 'includes', 'our', 'best', 'photoz', 'estimates', 'is', 'released', 'through', 'the', 'nasaipac', 'infrared', 'science', 'archive', 'irsa', 'groups', 'are', 'identified', 'through', 'a', 'friends', 'of', 'friends', 'algorithm', 'sim62', 'purity', 'sim51', 'completeness', 'we', 'identified', 'a', 'total', 'of', '45', 'galaxies', 'requiring', 'an', 'agn', 'emission', 'component', '35', 'of', 'which', 'in', 'groups', 'and', '10', 'in', 'the', 'field', 'we', 'find', 'bharpropto', 'm_mathrmgroup121pm027', 'and', 'bharsfrpropto', 'm_mathrmgroup104pm024', 'while', 'in', 'the', 'same', 'range', 'of', 'm_mathrmgroup', 'we', 'do', 'not', 'observe', 'any', 'sensible', 'change', 'in', 'the', 'numerical', 'fraction', 'of', 'agns', 'our', 'results', 'indicate', 'that', 'the', 'nuclear', 'activity', 'ie', 'the', 'bhar', 'and', 'the', 'bharsfr', 'ratio', 'is', 'enhanced', 'when', 'galaxies', 'are', 'located', 'in', 'more', 'massive', 'and', 'richer', 'groups']]
|
[-0.046075321879217646, 0.07620270909221448, -0.06623006726706239, 0.10038319090140842, -0.09791606749084009, -0.02621074437730662, 0.09219551680953768, 0.45660281492316207, -0.13673446042888351, -0.3526317047603104, 0.04723475059625976, -0.31309631881506544, -0.028408048980180983, 0.19549644563559684, -0.035085185851557586, -0.0531609030055773, 0.030560728972625878, -0.09629493396648246, -0.022046094362904906, -0.293308719496101, 0.2975773612728201, 0.07596422301848298, 0.1991836596098121, -0.014496134924094963, 0.052058945999116354, -0.047612063366028926, -0.12988238226136437, -0.019975696476910304, -0.15151975855137015, 0.04745617146279825, 0.2577884929123051, 0.1347527571103495, 0.23417818955166023, -0.28759313333034897, -0.2011156606933345, 0.09582950379800699, 0.17640431841592427, 0.02129574589046609, -0.05577186648664318, -0.2575867145605709, 0.07483149098343743, -0.19050789628400588, -0.11152493911491626, 0.05492853841126856, 0.036849310023345704, 0.04274716272256742, -0.2346718191471629, 0.11905177827853629, 0.0020328594585842675, 0.1090705388225615, -0.11999667418472793, -0.08769321181892377, -0.10972030678278079, 0.11254771062458926, 0.0023063716033230658, 0.10287516269853096, 0.18745770398527384, -0.17111677378162984, -0.0426625729498008, 0.3928019150443699, -0.07204694840221909, 0.003286549772905267, 0.2240471229616441, -0.21019845167174936, -0.1886714493025742, 0.16697924782461285, 0.15160913486033678, 0.13242620500158925, -0.15607874214113943, 0.00180033660549468, -0.020989920111858976, 0.25305659436600525, 0.015500378280716098, 0.09583651253797934, 0.27102762825544113, 0.09188307642268584, 0.06268011808253662, 0.13226682714733254, -0.21608777475219382, -0.01911763969970786, -0.2671672756621695, -0.09997114559961989, -0.1495734904442266, 0.09396628193499054, -0.1409075155565085, -0.09751384877701007, 0.36562783454244946, 0.11175279803447546, 0.1921074332394789, 0.07964866565801101, 0.2890081118225403, 0.05501907679844526, 0.13653242119749928, 0.11644350041270904, 0.3065331333195386, 0.13368295078651737, 0.07167406117988993, -0.23687237561174224, 0.0008653739042094221, -0.014141022624149312]
|
1,803.06357
|
Maximal subalgebras of the exceptional Lie algebras in low
characteristic
|
In this thesis we consider the maximal subalgebras of the exceptional Lie
algebras in algebraically closed fields of positive characteristic. This begins
with a quick recap of the article by Herpel and Stewart which considered the
Cartan type maximal subalgebras in the exceptional Lie algebras for good
characteristic, and then the article by Premet considering non-semisimple
maximal subalgebras in good characteristic.
For $p=5$ we give an example of what appears to be a new maximal subalgebra
in the exceptional Lie algebra of type $E_8$. We show that this maximal
subalgebra is isomorphic to the $p$-closure of the non-restricted Witt algebra
$W(1;2)$.
After this, we focus completely on characteristics $p=2$ and $p=3$ giving
examples of new non-semisimple maximal subalgebras in the exceptional Lie
algebras. We consider the Weisfeiler filtration associated to these maximal
subalgebras and leave many open questions. There are one or two examples of
simple maximal subalgebras in $F_4$ for $p=3$ and $E_8$ for $p=2$.
|
math.RA math.RT
|
in this thesis we consider the maximal subalgebras of the exceptional lie algebras in algebraically closed fields of positive characteristic this begins with a quick recap of the article by herpel and stewart which considered the cartan type maximal subalgebras in the exceptional lie algebras for good characteristic and then the article by premet considering nonsemisimple maximal subalgebras in good characteristic for p5 we give an example of what appears to be a new maximal subalgebra in the exceptional lie algebra of type e_8 we show that this maximal subalgebra is isomorphic to the pclosure of the nonrestricted witt algebra w12 after this we focus completely on characteristics p2 and p3 giving examples of new nonsemisimple maximal subalgebras in the exceptional lie algebras we consider the weisfeiler filtration associated to these maximal subalgebras and leave many open questions there are one or two examples of simple maximal subalgebras in f_4 for p3 and e_8 for p2
|
[['in', 'this', 'thesis', 'we', 'consider', 'the', 'maximal', 'subalgebras', 'of', 'the', 'exceptional', 'lie', 'algebras', 'in', 'algebraically', 'closed', 'fields', 'of', 'positive', 'characteristic', 'this', 'begins', 'with', 'a', 'quick', 'recap', 'of', 'the', 'article', 'by', 'herpel', 'and', 'stewart', 'which', 'considered', 'the', 'cartan', 'type', 'maximal', 'subalgebras', 'in', 'the', 'exceptional', 'lie', 'algebras', 'for', 'good', 'characteristic', 'and', 'then', 'the', 'article', 'by', 'premet', 'considering', 'nonsemisimple', 'maximal', 'subalgebras', 'in', 'good', 'characteristic', 'for', 'p5', 'we', 'give', 'an', 'example', 'of', 'what', 'appears', 'to', 'be', 'a', 'new', 'maximal', 'subalgebra', 'in', 'the', 'exceptional', 'lie', 'algebra', 'of', 'type', 'e_8', 'we', 'show', 'that', 'this', 'maximal', 'subalgebra', 'is', 'isomorphic', 'to', 'the', 'pclosure', 'of', 'the', 'nonrestricted', 'witt', 'algebra', 'w12', 'after', 'this', 'we', 'focus', 'completely', 'on', 'characteristics', 'p2', 'and', 'p3', 'giving', 'examples', 'of', 'new', 'nonsemisimple', 'maximal', 'subalgebras', 'in', 'the', 'exceptional', 'lie', 'algebras', 'we', 'consider', 'the', 'weisfeiler', 'filtration', 'associated', 'to', 'these', 'maximal', 'subalgebras', 'and', 'leave', 'many', 'open', 'questions', 'there', 'are', 'one', 'or', 'two', 'examples', 'of', 'simple', 'maximal', 'subalgebras', 'in', 'f_4', 'for', 'p3', 'and', 'e_8', 'for', 'p2']]
|
[-0.2006375403324892, 0.05766790257791411, -0.009330253555233797, 0.07822814597045193, -0.13880443713301188, -0.18916574108426448, -0.03313820443853929, 0.3355959954831444, -0.3235052912556506, -0.1584220875429546, 0.17208220322341236, -0.22721703239873825, -0.13083637827348157, 0.23127240658429293, -0.1735811011545215, -0.08154703878991112, 0.053125708151719075, 0.17650102999351627, -0.12837891165898846, -0.3237127363470129, 0.4239616665336025, -0.041089956066571176, 0.22442331831515222, 0.016942487941909726, 0.09949855092011828, -0.014693366774877944, 0.0035201867606926276, -0.05069358828296135, -0.18969052707249723, 0.09317477028091233, 0.33791245933162506, 0.07059896282561413, 0.1973345859419228, -0.34312642203619725, -0.03996009113684345, 0.2299697579734342, 0.2453438024642853, 0.041593450063373893, -0.03857066410415286, -0.24492247443262175, 0.09089032156081484, -0.22244817828540328, -0.21241296080920796, -0.04376421846699215, 0.0921448847662972, -0.03736250620190199, -0.1987900271340479, 0.046931458020268324, 0.11665195647956707, 0.20005627991873529, -0.09242714487028296, -0.09420804100340933, -0.02793780082720332, 0.05284219153691083, -0.031848178344911764, -0.02455326585876211, 0.07201733850184586, -0.09117298173229059, -0.1916200574215308, 0.37951738776808436, 0.01512961813502691, -0.19877482134873023, 0.1165624823808283, -0.2329747955490194, -0.1969208258125544, 0.09374398094988973, 0.03975288623145649, 0.1173936406032533, -0.06732879797289262, 0.20115112990871156, -0.13823405754232368, -0.06594424548803816, 0.07764339876095099, -0.009080436313524842, 0.13142241718392675, 0.08563221111597324, 0.037105245443511535, 0.12218645333793232, 0.10793217379930913, 0.022774939881879595, -0.41229074491889445, -0.19386158794975028, -0.04942557432344062, 0.16924188161486542, -0.09873955487528764, -0.154472495882784, 0.483674292162351, 0.12509467458207305, 0.18151296895940777, 0.06050047940988844, 0.13729763575285286, 0.033412210516292944, 0.13191987584683706, 0.05464023932385222, 0.14754813197431724, 0.24665710376877967, -0.055487727196040476, -0.1655519971674665, -0.13062647848946418, 0.199029095032458]
|
1,803.06358
|
Self-trapping and acceleration of ions in laser-driven relativistically
transparent plasma
|
Self-trapping and acceleration of ions in laser-driven relativistically
transparent plasma are investigated with the help of particle-in-cell
simulations. A theoretical model based on ion wave breaking is established in
describing ion evolution and ion trapping. The threshold for ion trapping is
identified. Near the threshold ion trapping is self-regulating and stops when
the number of trapped ions is large enough. The model is applied to ion
trapping in three-dimensional geometry. Longitudinal distributions of ions and
the electric field near the wave breaking point are derived analytically in
terms of power-law scalings. The areal density of trapped charge is obtained as
a function of the strength of ion wave breaking, which scales with target
density for fixed laser intensity. The results of the model are confirmed by
the simulations.
|
physics.plasm-ph
|
selftrapping and acceleration of ions in laserdriven relativistically transparent plasma are investigated with the help of particleincell simulations a theoretical model based on ion wave breaking is established in describing ion evolution and ion trapping the threshold for ion trapping is identified near the threshold ion trapping is selfregulating and stops when the number of trapped ions is large enough the model is applied to ion trapping in threedimensional geometry longitudinal distributions of ions and the electric field near the wave breaking point are derived analytically in terms of powerlaw scalings the areal density of trapped charge is obtained as a function of the strength of ion wave breaking which scales with target density for fixed laser intensity the results of the model are confirmed by the simulations
|
[['selftrapping', 'and', 'acceleration', 'of', 'ions', 'in', 'laserdriven', 'relativistically', 'transparent', 'plasma', 'are', 'investigated', 'with', 'the', 'help', 'of', 'particleincell', 'simulations', 'a', 'theoretical', 'model', 'based', 'on', 'ion', 'wave', 'breaking', 'is', 'established', 'in', 'describing', 'ion', 'evolution', 'and', 'ion', 'trapping', 'the', 'threshold', 'for', 'ion', 'trapping', 'is', 'identified', 'near', 'the', 'threshold', 'ion', 'trapping', 'is', 'selfregulating', 'and', 'stops', 'when', 'the', 'number', 'of', 'trapped', 'ions', 'is', 'large', 'enough', 'the', 'model', 'is', 'applied', 'to', 'ion', 'trapping', 'in', 'threedimensional', 'geometry', 'longitudinal', 'distributions', 'of', 'ions', 'and', 'the', 'electric', 'field', 'near', 'the', 'wave', 'breaking', 'point', 'are', 'derived', 'analytically', 'in', 'terms', 'of', 'powerlaw', 'scalings', 'the', 'areal', 'density', 'of', 'trapped', 'charge', 'is', 'obtained', 'as', 'a', 'function', 'of', 'the', 'strength', 'of', 'ion', 'wave', 'breaking', 'which', 'scales', 'with', 'target', 'density', 'for', 'fixed', 'laser', 'intensity', 'the', 'results', 'of', 'the', 'model', 'are', 'confirmed', 'by', 'the', 'simulations']]
|
[-0.10650345399517391, 0.2589681939025468, -0.011069477332057431, 0.06432170861990016, 0.05155301147078717, -0.15571783533687267, -0.023986581207282143, 0.39093698155193124, -0.19694593616441125, -0.2822925934960949, 0.01986651782226545, -0.28727776267896843, 0.005880936914763879, 0.18024186747970816, 0.073941677224866, 0.07315816987829749, 0.018632406145115965, -0.004065227967657847, -0.012386765229166485, -0.11878047213394893, 0.2801539099227739, 0.16129004624417576, 0.29237522069888655, 0.11507590419932967, 0.08709552555956179, -0.02301136776804924, 0.04427140505504212, 0.03588606944686035, -0.13280277596857104, 0.06648062412568834, 0.18079171779754688, 0.03770893477667414, 0.24068916311807698, -0.4795351868669968, -0.2823564234713558, 0.004603304510965245, 0.18198527463755454, 0.18974963271739398, -0.14039286995557632, -0.2621635361829249, 0.002068260026135249, -0.13275859949862934, -0.22153432244158466, -0.02135955983249005, 0.048857167174901406, 0.13562643336445035, -0.3391200725309318, 0.1021696380139474, 0.011196494484465802, 0.07787690328291319, -0.10171969205111964, -0.0409008604765404, -0.07061270120175323, 0.007716367760849607, 0.06213602866236556, 0.03949630214992794, 0.22059476758659002, -0.12655902648566553, -0.052654979190265294, 0.38485257598222233, -0.058132584492341266, -0.16492528456365108, 0.16782389042782597, -0.21490296539923293, -0.027965678005784866, 0.20163002585468348, 0.16689001994018327, 0.10874854471694562, -0.11303892583111974, 0.060218799122594646, -0.022435752625483474, 0.12713470468847277, 0.12169169764274557, 0.016834766040119575, 0.23240560816338984, 0.19737537314176734, 0.010298844281351194, 0.12640955085669248, -0.15195636315002048, -0.10936139334080508, -0.3256372281448421, -0.10311442819511285, -0.2035815414856188, -0.0011999530805724135, -0.059126680447207036, -0.14045837983576348, 0.39731377878342755, 0.12794137748170442, 0.14511624097576714, -0.054051340709520446, 0.26242023521263036, 0.17005532183884497, 0.022277915850281715, 0.06157354745846533, 0.26161203312403813, 0.17051675509355846, 0.09716885331727099, -0.3126560322853038, 0.04032945562494206, 0.06172233114921255]
|
1,803.06359
|
SMSS J130522.47-293113.0: a high-latitude stellar X-ray source with
pc-scale outflow relics?
|
We report the discovery of an unusual stellar system, SMSS
J130522.47-293113.0. The optical spectrum is dominated by a blue continuum
together with emission lines of hydrogen, neutral and ionized helium, and the N
III, C III blend at around 4640-4650 Angstrom. The emission line profiles vary
in strength and position on timescales as short as 1 day, while optical
photometry reveals fluctuations of as much as ~0.2 mag in g on timescales as
short as 10-15 min. The system is a weak X-ray source (f_{0.3-10} = (1.2 +/-
0.1) x 10^{-13} ergs cm^{-2} s^{-1} in the 0.3-10 keV band) but is not detected
at radio wavelengths (3-sigma upper limit of 50 microJy at 5.5 GHz). The most
intriguing property of the system, however, is the existence of two "blobs", a
few arcsec in size, that are symmetrically located 3.8 arcmin (2.2 pc for our
preferred system distance of ~2 kpc) each side of the central object. The blobs
are detected in optical and near-IR broadband images but do not show any excess
emission in Halpha images. We discuss the interpretation of the system,
suggesting that the central object is most likely a nova-like CV, and that the
blobs are relics of a pc-scale accretion-powered collimated outflow.
|
astro-ph.HE
|
we report the discovery of an unusual stellar system smss j130522472931130 the optical spectrum is dominated by a blue continuum together with emission lines of hydrogen neutral and ionized helium and the n iii c iii blend at around 46404650 angstrom the emission line profiles vary in strength and position on timescales as short as 1 day while optical photometry reveals fluctuations of as much as 02 mag in g on timescales as short as 1015 min the system is a weak xray source f_0310 12 01 x 1013 ergs cm2 s1 in the 0310 kev band but is not detected at radio wavelengths 3sigma upper limit of 50 microjy at 55 ghz the most intriguing property of the system however is the existence of two blobs a few arcsec in size that are symmetrically located 38 arcmin 22 pc for our preferred system distance of 2 kpc each side of the central object the blobs are detected in optical and nearir broadband images but do not show any excess emission in halpha images we discuss the interpretation of the system suggesting that the central object is most likely a novalike cv and that the blobs are relics of a pcscale accretionpowered collimated outflow
|
[['we', 'report', 'the', 'discovery', 'of', 'an', 'unusual', 'stellar', 'system', 'smss', 'j130522472931130', 'the', 'optical', 'spectrum', 'is', 'dominated', 'by', 'a', 'blue', 'continuum', 'together', 'with', 'emission', 'lines', 'of', 'hydrogen', 'neutral', 'and', 'ionized', 'helium', 'and', 'the', 'n', 'iii', 'c', 'iii', 'blend', 'at', 'around', '46404650', 'angstrom', 'the', 'emission', 'line', 'profiles', 'vary', 'in', 'strength', 'and', 'position', 'on', 'timescales', 'as', 'short', 'as', '1', 'day', 'while', 'optical', 'photometry', 'reveals', 'fluctuations', 'of', 'as', 'much', 'as', '02', 'mag', 'in', 'g', 'on', 'timescales', 'as', 'short', 'as', '1015', 'min', 'the', 'system', 'is', 'a', 'weak', 'xray', 'source', 'f_0310', '12', '01', 'x', '1013', 'ergs', 'cm2', 's1', 'in', 'the', '0310', 'kev', 'band', 'but', 'is', 'not', 'detected', 'at', 'radio', 'wavelengths', '3sigma', 'upper', 'limit', 'of', '50', 'microjy', 'at', '55', 'ghz', 'the', 'most', 'intriguing', 'property', 'of', 'the', 'system', 'however', 'is', 'the', 'existence', 'of', 'two', 'blobs', 'a', 'few', 'arcsec', 'in', 'size', 'that', 'are', 'symmetrically', 'located', '38', 'arcmin', '22', 'pc', 'for', 'our', 'preferred', 'system', 'distance', 'of', '2', 'kpc', 'each', 'side', 'of', 'the', 'central', 'object', 'the', 'blobs', 'are', 'detected', 'in', 'optical', 'and', 'nearir', 'broadband', 'images', 'but', 'do', 'not', 'show', 'any', 'excess', 'emission', 'in', 'halpha', 'images', 'we', 'discuss', 'the', 'interpretation', 'of', 'the', 'system', 'suggesting', 'that', 'the', 'central', 'object', 'is', 'most', 'likely', 'a', 'novalike', 'cv', 'and', 'that', 'the', 'blobs', 'are', 'relics', 'of', 'a', 'pcscale', 'accretionpowered', 'collimated', 'outflow']]
|
[-0.10499215941987376, 0.12739327821056115, 0.0021156364917495653, 0.07053128937062395, -0.03721050963046687, -0.15180368085544724, 0.04453272413374365, 0.4865725791192989, -0.1652727592840735, -0.336268393949499, 0.10578939548823334, -0.3372817811838801, 0.013372361604402314, 0.19527296286623053, -0.015414001225535549, -0.07921963228861627, 0.049957984627806006, -0.06189306009102112, -0.03721289975459766, -0.183911146041219, 0.22151492040651266, 0.04900916648417044, 0.15952502486912246, 0.03439227284038838, 0.08434440290430255, -0.09327685913483413, -0.022016903715942573, -0.04874814360110617, -0.06308878129008615, 0.05261793878944174, 0.2181054823290538, 0.09320421409486232, 0.2294652350710251, -0.3305557660853481, -0.18842492624190613, 0.0315831425757291, 0.2078094266526475, -0.016085680372623812, 0.01967168135906741, -0.2651249591749977, 0.07585632731090879, -0.15945621706610222, -0.17167447736273653, 0.13926449232730106, 0.12238101734992914, 0.02609635736076254, -0.1641390405674071, 0.15280215490368468, 0.026920129205053905, 0.12327611662110949, -0.11464147090643126, -0.09513661161294457, -0.06751120187902813, 0.027201040490386793, -0.009563895800169465, 0.10752843674712476, 0.22347215538964935, -0.1299743385387779, -0.045000923088281436, 0.39357455537436686, -0.09179293217637868, 0.04465110227002285, 0.21374031659899123, -0.23106272986033627, -0.1795638625241297, 0.246834669628213, 0.10553184429931324, 0.11912691723485824, -0.12008437966066066, -0.01053570681025705, -0.05020433064059016, 0.30352763003850386, 0.05596405693297436, 0.1339024571871005, 0.3249147247838144, 0.09312895059397917, 0.04603990694317985, 0.10389859070138431, -0.2910462226174234, 0.02515058826182538, -0.28647335008929475, -0.0778367787805752, -0.129256866075358, 0.12914916428992762, -0.12039010447242346, -0.1217306697212938, 0.3514795793146266, 0.12103512760400031, 0.23394982660170738, 0.023704213581965373, 0.2692916461577018, 0.09952816435203087, 0.07487850576009027, 0.12830993374207275, 0.31824898405639984, 0.1607348480289663, 0.10874012632142585, -0.16179277676282755, 0.03401431381535619, -0.008487130146918457]
|
1,803.0636
|
Transport information geometry I: Riemannian calculus on probability
simplex
|
We formulate the Riemannian calculus of the probability set embedded with
$L^2$-Wasserstein metric. This is an initial work of transport information
geometry. Our investigation starts with the probability simplex (probability
manifold) supported on vertices of a finite graph. The main idea is to embed
the probability manifold as a submanifold of the positive measure space with a
nonlinear metric tensor. Here the nonlinearity comes from the linear weighted
Laplacian operator. By this viewpoint, we establish torsion-free Christoffel
symbols, Levi-Civita connections, curvature tensors and volume forms in the
probability manifold by Euclidean coordinates. As a consequence, the Jacobi
equation, Laplace-Beltrami and Hessian operators on the probability manifold
are derived. These geometric computations are also provided in the
infinite-dimensional density space (density manifold) supported on a
finite-dimensional manifold. In particular, an identity is given connecting the
Baker-{\'E}mery $\Gamma_2$ operator (carr{\'e} du champ it{\'e}r{\'e}) by
connecting Fisher-Rao information metric and optimal transport metric. Several
examples are demonstrated.
|
math.DG cs.IT math.IT
|
we formulate the riemannian calculus of the probability set embedded with l2wasserstein metric this is an initial work of transport information geometry our investigation starts with the probability simplex probability manifold supported on vertices of a finite graph the main idea is to embed the probability manifold as a submanifold of the positive measure space with a nonlinear metric tensor here the nonlinearity comes from the linear weighted laplacian operator by this viewpoint we establish torsionfree christoffel symbols levicivita connections curvature tensors and volume forms in the probability manifold by euclidean coordinates as a consequence the jacobi equation laplacebeltrami and hessian operators on the probability manifold are derived these geometric computations are also provided in the infinitedimensional density space density manifold supported on a finitedimensional manifold in particular an identity is given connecting the bakeremery gamma_2 operator carre du champ itere by connecting fisherrao information metric and optimal transport metric several examples are demonstrated
|
[['we', 'formulate', 'the', 'riemannian', 'calculus', 'of', 'the', 'probability', 'set', 'embedded', 'with', 'l2wasserstein', 'metric', 'this', 'is', 'an', 'initial', 'work', 'of', 'transport', 'information', 'geometry', 'our', 'investigation', 'starts', 'with', 'the', 'probability', 'simplex', 'probability', 'manifold', 'supported', 'on', 'vertices', 'of', 'a', 'finite', 'graph', 'the', 'main', 'idea', 'is', 'to', 'embed', 'the', 'probability', 'manifold', 'as', 'a', 'submanifold', 'of', 'the', 'positive', 'measure', 'space', 'with', 'a', 'nonlinear', 'metric', 'tensor', 'here', 'the', 'nonlinearity', 'comes', 'from', 'the', 'linear', 'weighted', 'laplacian', 'operator', 'by', 'this', 'viewpoint', 'we', 'establish', 'torsionfree', 'christoffel', 'symbols', 'levicivita', 'connections', 'curvature', 'tensors', 'and', 'volume', 'forms', 'in', 'the', 'probability', 'manifold', 'by', 'euclidean', 'coordinates', 'as', 'a', 'consequence', 'the', 'jacobi', 'equation', 'laplacebeltrami', 'and', 'hessian', 'operators', 'on', 'the', 'probability', 'manifold', 'are', 'derived', 'these', 'geometric', 'computations', 'are', 'also', 'provided', 'in', 'the', 'infinitedimensional', 'density', 'space', 'density', 'manifold', 'supported', 'on', 'a', 'finitedimensional', 'manifold', 'in', 'particular', 'an', 'identity', 'is', 'given', 'connecting', 'the', 'bakeremery', 'gamma_2', 'operator', 'carre', 'du', 'champ', 'itere', 'by', 'connecting', 'fisherrao', 'information', 'metric', 'and', 'optimal', 'transport', 'metric', 'several', 'examples', 'are', 'demonstrated']]
|
[-0.16825377694821278, 0.05505099579903273, -0.08244205800675493, 0.0879393217734392, -0.1429213209362627, -0.11396111522519373, -0.01757919972786974, 0.3518200338769116, -0.3017379601921053, -0.20370132216301404, 0.11153844701460146, -0.3236737989967591, -0.21192495794476648, 0.10943613967270051, -0.13863165518820383, 0.0669117894071142, 0.08233656400299974, 0.12230354011683774, -0.1121509752150527, -0.2028997676474989, 0.48928724753817443, 0.048430678725708276, 0.2479158924910926, 0.0360879063723587, 0.1688706270559985, -0.01902567469331093, -0.030689656984146784, 0.025844699537341705, -0.15182756236754358, 0.13985047827621824, 0.24853669481940174, 0.1376754302243506, 0.2505788695829994, -0.4001847813641162, -0.2245811995143365, 0.13650131052494735, 0.07839529231300969, 0.003289313257769927, -0.03138451836926642, -0.3636468480169577, 0.03781106136739254, -0.086454175970223, -0.14297089968634905, -0.08752006394819259, 0.001214350150947116, -0.0200352766895728, -0.23478681449533292, 0.024767453224500826, 0.0642371041406142, 0.020287680696990145, -0.08480357544651365, -0.11514102306069904, -0.07079931409833462, 0.06734998292430598, 0.00027092435318895456, 0.09887808164057788, 0.12371983799063233, 0.003807556653076685, -0.0916275637696105, 0.2975897940402654, -0.0706115637715955, -0.3426122830194225, 0.07969212161735509, -0.14277023116531046, -0.1018303869411619, 0.08209679689178684, 0.14895346447519842, 0.15418358938155793, -0.10175033448276256, 0.19849877616912923, -0.033882240894998084, 0.08474942913361654, 0.08509156632996899, 0.028839962437479317, 0.10329703925373523, 0.09742562989183505, 0.16547064509818724, 0.10484256261866233, -0.018930216085496603, -0.13571732757478266, -0.35755107613084347, -0.22295258459512537, -0.2494573858658489, 0.14701595182506075, -0.2096470574459473, -0.1839614537051315, 0.34550256258808076, -0.003322232385950261, 0.22442100802474765, 0.1195855081543988, 0.2534437872052781, 0.11259751644846754, -0.015274920138548814, 0.12386133307958708, 0.13408943162587666, 0.2357338251114063, 0.04656432608546885, -0.1516807361147489, -0.007759385575283025, 0.19268624218315572]
|
1,803.06361
|
Halving the bounds for the Markov, Chebyshev, and Chernoff Inequalities
using smoothing
|
The Markov, Chebyshev, and Chernoff inequalities are some of the most widely
used methods for bounding the tail probabilities of random variables. In all
three cases, the bounds are tight in the sense that there exists easy examples
where the inequalities become equality. Here we will show that through a simple
smoothing using auxiliary randomness, that each of the three bounds can be cut
in half. In many common cases, the halving can be achieved without the need for
the auxiliary randomness.
|
math.PR
|
the markov chebyshev and chernoff inequalities are some of the most widely used methods for bounding the tail probabilities of random variables in all three cases the bounds are tight in the sense that there exists easy examples where the inequalities become equality here we will show that through a simple smoothing using auxiliary randomness that each of the three bounds can be cut in half in many common cases the halving can be achieved without the need for the auxiliary randomness
|
[['the', 'markov', 'chebyshev', 'and', 'chernoff', 'inequalities', 'are', 'some', 'of', 'the', 'most', 'widely', 'used', 'methods', 'for', 'bounding', 'the', 'tail', 'probabilities', 'of', 'random', 'variables', 'in', 'all', 'three', 'cases', 'the', 'bounds', 'are', 'tight', 'in', 'the', 'sense', 'that', 'there', 'exists', 'easy', 'examples', 'where', 'the', 'inequalities', 'become', 'equality', 'here', 'we', 'will', 'show', 'that', 'through', 'a', 'simple', 'smoothing', 'using', 'auxiliary', 'randomness', 'that', 'each', 'of', 'the', 'three', 'bounds', 'can', 'be', 'cut', 'in', 'half', 'in', 'many', 'common', 'cases', 'the', 'halving', 'can', 'be', 'achieved', 'without', 'the', 'need', 'for', 'the', 'auxiliary', 'randomness']]
|
[-0.09089676207840079, 0.13974843717395988, -0.059228552539446734, 0.14295045576035614, -0.053425936323658725, -0.18662762918464113, 0.060672091581381676, 0.3876970979681795, -0.2828015118749335, -0.26864890104568584, 0.16283980618435434, -0.2744537410326302, -0.1453926593758075, 0.26987574903703315, -0.07758938878343054, 0.08105169774583973, 0.04781375903204629, 0.07638102749408018, -0.06941014411007394, -0.32615898125066717, 0.2923044188902145, -0.03674766028345358, 0.21834761187684062, 0.03874191227823314, 0.07007549733786685, 0.00583852636457489, 0.0056827613947595034, 0.03414923105726591, -0.13031912398964335, 0.13706339207455154, 0.27183880586256615, 0.17232386669621053, 0.32960246505624635, -0.41601984140395026, -0.18059883982215713, 0.17941051606861194, 0.16494691739903716, 0.10975395777921487, -0.023097070411029385, -0.22505475858953305, 0.057119448984427966, -0.10661027157429333, -0.08149331097104927, -0.08642463296617768, -0.03926959470277879, 0.0735977846070011, -0.3102114562444934, 0.043014353266122136, 0.09339143607265703, 0.024630799290451515, 0.026565606299810474, -0.13164805901441268, 0.029671317006166025, 0.144312836207086, 0.0353168923771236, -0.02454550592115194, 0.056231446797028184, -0.09015891997416209, -0.14214398328175132, 0.32221997942684627, -0.0399050008528298, -0.2726508797169095, 0.16753585452480788, -0.12754869171440963, -0.1973976530021102, 0.082798028296632, 0.10129986495267963, 0.1198861363525616, -0.18009584418373045, 0.10317512054107061, -0.07031219688147625, 0.14468362441615815, 0.09980112298323614, 0.06166138753817394, 0.11988210214710818, 0.03613639436662197, 0.10003723400267318, 0.17150338900718476, -0.08435438475685149, -0.11160111670359606, -0.3423988806856115, -0.16207198591948282, -0.227320093396063, -0.002033103018908239, -0.19422242634275946, -0.14605257692803605, 0.3370487994128248, 0.16144481663046995, 0.17363508141077147, 0.05455159459251729, 0.28476276593254424, 0.13394431314408417, 0.062180000925209464, 0.13396669494942193, 0.2438483025169528, 0.10269953229850749, 0.010504935782902488, -0.09381762311634857, 0.1463730961379663, 0.09222078595378595]
|
1,803.06362
|
A Candidate Tidal Disruption Event in a Quasar at z=2.359 from Abundance
Ratio Variability
|
A small fraction of quasars show an unusually high nitrogen-to-carbon ratio
(N/C) in their spectra. These "nitrogen-rich" (N-rich) quasars are a
long-standing puzzle because their interstellar medium implies stellar
populations with abnormally high metallicities. It has recently been proposed
that N-rich quasars may result from tidal disruption events (TDEs) of stars by
supermassive black holes. The rapid enhancement of nitrogen and the depletion
of carbon due to the carbon--nitrogen--oxygen cycle in supersolar mass stars
could naturally produce high N/C. However, the TDE hypothesis predicts that the
N/C should change with time, which has never hitherto been observed. Here we
report the discovery of the first N-rich quasar with rapid N/C variability that
could be caused by a TDE. Two spectra separated by 1.7 years (rest-frame) show
that the N III]\lambda 1750/C III]\lambda 1909 intensity ratio decayed by
~86%+/-14% (1 \sigma). Optical (rest-frame UV) light-curve and X-ray
observations are qualitatively consistent with the TDE hypothesis; though, the
time baseline falls short of a definitive proof. Putting the single-object
discovery into context, statistical analyses of the ~80 known N-rich quasars
with high-quality archival spectra show evidence (at a 5\sigma\ significance
level) of a decrease in N/C on timescales of >1 year (rest-frame) and a
constant level of ionization (indicated by the C III]\lambda 1909/C IV\lambda
1549 intensity ratio). If confirmed, our results demonstrate the method of
identifying TDE candidates in quasars via abundance ratio variability, opening
a new window of TDE observations at high redshift (z>2) with upcoming
large-scale time-domain spectroscopic surveys.
|
astro-ph.GA astro-ph.CO
|
a small fraction of quasars show an unusually high nitrogentocarbon ratio nc in their spectra these nitrogenrich nrich quasars are a longstanding puzzle because their interstellar medium implies stellar populations with abnormally high metallicities it has recently been proposed that nrich quasars may result from tidal disruption events tdes of stars by supermassive black holes the rapid enhancement of nitrogen and the depletion of carbon due to the carbonnitrogenoxygen cycle in supersolar mass stars could naturally produce high nc however the tde hypothesis predicts that the nc should change with time which has never hitherto been observed here we report the discovery of the first nrich quasar with rapid nc variability that could be caused by a tde two spectra separated by 17 years restframe show that the n iiilambda 1750c iiilambda 1909 intensity ratio decayed by 8614 1 sigma optical restframe uv lightcurve and xray observations are qualitatively consistent with the tde hypothesis though the time baseline falls short of a definitive proof putting the singleobject discovery into context statistical analyses of the 80 known nrich quasars with highquality archival spectra show evidence at a 5sigma significance level of a decrease in nc on timescales of 1 year restframe and a constant level of ionization indicated by the c iiilambda 1909c ivlambda 1549 intensity ratio if confirmed our results demonstrate the method of identifying tde candidates in quasars via abundance ratio variability opening a new window of tde observations at high redshift z2 with upcoming largescale timedomain spectroscopic surveys
|
[['a', 'small', 'fraction', 'of', 'quasars', 'show', 'an', 'unusually', 'high', 'nitrogentocarbon', 'ratio', 'nc', 'in', 'their', 'spectra', 'these', 'nitrogenrich', 'nrich', 'quasars', 'are', 'a', 'longstanding', 'puzzle', 'because', 'their', 'interstellar', 'medium', 'implies', 'stellar', 'populations', 'with', 'abnormally', 'high', 'metallicities', 'it', 'has', 'recently', 'been', 'proposed', 'that', 'nrich', 'quasars', 'may', 'result', 'from', 'tidal', 'disruption', 'events', 'tdes', 'of', 'stars', 'by', 'supermassive', 'black', 'holes', 'the', 'rapid', 'enhancement', 'of', 'nitrogen', 'and', 'the', 'depletion', 'of', 'carbon', 'due', 'to', 'the', 'carbonnitrogenoxygen', 'cycle', 'in', 'supersolar', 'mass', 'stars', 'could', 'naturally', 'produce', 'high', 'nc', 'however', 'the', 'tde', 'hypothesis', 'predicts', 'that', 'the', 'nc', 'should', 'change', 'with', 'time', 'which', 'has', 'never', 'hitherto', 'been', 'observed', 'here', 'we', 'report', 'the', 'discovery', 'of', 'the', 'first', 'nrich', 'quasar', 'with', 'rapid', 'nc', 'variability', 'that', 'could', 'be', 'caused', 'by', 'a', 'tde', 'two', 'spectra', 'separated', 'by', '17', 'years', 'restframe', 'show', 'that', 'the', 'n', 'iiilambda', '1750c', 'iiilambda', '1909', 'intensity', 'ratio', 'decayed', 'by', '8614', '1', 'sigma', 'optical', 'restframe', 'uv', 'lightcurve', 'and', 'xray', 'observations', 'are', 'qualitatively', 'consistent', 'with', 'the', 'tde', 'hypothesis', 'though', 'the', 'time', 'baseline', 'falls', 'short', 'of', 'a', 'definitive', 'proof', 'putting', 'the', 'singleobject', 'discovery', 'into', 'context', 'statistical', 'analyses', 'of', 'the', '80', 'known', 'nrich', 'quasars', 'with', 'highquality', 'archival', 'spectra', 'show', 'evidence', 'at', 'a', '5sigma', 'significance', 'level', 'of', 'a', 'decrease', 'in', 'nc', 'on', 'timescales', 'of', '1', 'year', 'restframe', 'and', 'a', 'constant', 'level', 'of', 'ionization', 'indicated', 'by', 'the', 'c', 'iiilambda', '1909c', 'ivlambda', '1549', 'intensity', 'ratio', 'if', 'confirmed', 'our', 'results', 'demonstrate', 'the', 'method', 'of', 'identifying', 'tde', 'candidates', 'in', 'quasars', 'via', 'abundance', 'ratio', 'variability', 'opening', 'a', 'new', 'window', 'of', 'tde', 'observations', 'at', 'high', 'redshift', 'z2', 'with', 'upcoming', 'largescale', 'timedomain', 'spectroscopic', 'surveys']]
|
[-0.07260405145537267, 0.1441040730650553, -0.046030872679368506, 0.1093804808461289, -0.05882958837498994, -0.11553976621490153, 0.08472558895194131, 0.442166327685307, -0.12148841223641624, -0.37146020872230695, 0.03959628257321239, -0.3053189464851862, -0.03035875478460325, 0.18333983768489423, -0.04458279410808733, -0.020566698830533105, 0.08940333175298766, -0.12154546617227417, -0.021569296600222797, -0.284791044071241, 0.24331173191142336, 0.10144513940374268, 0.20516647554449435, 0.005259727955061367, 0.051523244231078034, -0.08811310791925206, -0.0874932621476975, 0.016930689926380367, -0.1175330352560831, 0.022684933636640387, 0.2499908412242596, 0.15051036543019752, 0.23375166864399383, -0.3196417104393221, -0.22046246255011623, 0.07003518353581686, 0.21496674095988424, 0.04980816027481768, -0.09925828606308612, -0.26195566505155854, 0.08009168964811143, -0.17641953990806075, -0.16129457240553224, 0.05990822396451244, 0.09112227429461674, 0.02603753497095294, -0.20440924262610924, 0.1450133535781936, 0.0034351940489207524, 0.09161426867471963, -0.10159308270255966, -0.09627498919333566, -0.05446010245468346, -0.002105818289082225, 0.07592979067940325, 0.06425686954161933, 0.14562166638187762, -0.11559826924893399, -0.07962865543332164, 0.38967141987589315, -0.11151239079114701, 0.07925805993680085, 0.2041234880916744, -0.23715915617710964, -0.19899554189476298, 0.21077922196884646, 0.12011893856106326, 0.12779916056272825, -0.12969708922924852, -0.007080621183310386, -0.011543720472240594, 0.25065391000390536, 0.05754099216035802, 0.09478857819127237, 0.3414056396473396, 0.12403207733563235, -0.018580208017634665, 0.039863408990374695, -0.21895999820217701, 0.029828661804776488, -0.20775722778909575, -0.09242616338670497, -0.10459927703269069, 0.15036376308066754, -0.12863174625048915, -0.1106381233255341, 0.32308626199534873, 0.07766867483960374, 0.24323333047966406, 0.06298027332726397, 0.2652721569949376, 0.10639266508472402, 0.10347423922626407, 0.05549086523677669, 0.3695123302712431, 0.13988868721261075, 0.09997362877115441, -0.21117021007050676, 0.1290019897732702, -0.00033829174557231304]
|
1,803.06363
|
Geometric Adaptive Control for a Quadrotor UAV with Wind Disturbance
Rejection
|
This paper presents a geometric adaptive control scheme for a quadrotor
unmanned aerial vehicle, where the effects of unknown, unstructured
disturbances are mitigated by a multilayer neural network that is adjusted
online. The stability of the proposed controller is analyzed with Lyapunov
stability theory on the special Euclidean group, and it is shown that the
tracking errors are uniformly ultimately bounded with an ultimate bound that
can be abridged arbitrarily. A mathematical model of wind disturbance on the
quadrotor dynamics is presented, and it is shown that the proposed adaptive
controller is capable of rejecting the effects of wind disturbances
successfully. These are illustrated by numerical examples.
|
math.OC
|
this paper presents a geometric adaptive control scheme for a quadrotor unmanned aerial vehicle where the effects of unknown unstructured disturbances are mitigated by a multilayer neural network that is adjusted online the stability of the proposed controller is analyzed with lyapunov stability theory on the special euclidean group and it is shown that the tracking errors are uniformly ultimately bounded with an ultimate bound that can be abridged arbitrarily a mathematical model of wind disturbance on the quadrotor dynamics is presented and it is shown that the proposed adaptive controller is capable of rejecting the effects of wind disturbances successfully these are illustrated by numerical examples
|
[['this', 'paper', 'presents', 'a', 'geometric', 'adaptive', 'control', 'scheme', 'for', 'a', 'quadrotor', 'unmanned', 'aerial', 'vehicle', 'where', 'the', 'effects', 'of', 'unknown', 'unstructured', 'disturbances', 'are', 'mitigated', 'by', 'a', 'multilayer', 'neural', 'network', 'that', 'is', 'adjusted', 'online', 'the', 'stability', 'of', 'the', 'proposed', 'controller', 'is', 'analyzed', 'with', 'lyapunov', 'stability', 'theory', 'on', 'the', 'special', 'euclidean', 'group', 'and', 'it', 'is', 'shown', 'that', 'the', 'tracking', 'errors', 'are', 'uniformly', 'ultimately', 'bounded', 'with', 'an', 'ultimate', 'bound', 'that', 'can', 'be', 'abridged', 'arbitrarily', 'a', 'mathematical', 'model', 'of', 'wind', 'disturbance', 'on', 'the', 'quadrotor', 'dynamics', 'is', 'presented', 'and', 'it', 'is', 'shown', 'that', 'the', 'proposed', 'adaptive', 'controller', 'is', 'capable', 'of', 'rejecting', 'the', 'effects', 'of', 'wind', 'disturbances', 'successfully', 'these', 'are', 'illustrated', 'by', 'numerical', 'examples']]
|
[-0.17855134616153331, 0.11564776382888298, -0.08420788820954823, 0.03568523579220523, -0.06304134522068584, -0.17324289558895986, -0.010647941741953108, 0.3836091633833875, -0.2613085738827135, -0.3096805353274691, 0.16781952912771256, -0.2254755766822948, -0.233038368904702, 0.22774070671707322, -0.1781626188323537, 0.14240457764696154, 0.09937379533581644, 0.014737718686391817, 0.040102500355341165, -0.23682018635777113, 0.2935365881775201, 0.09025276382236141, 0.2536751900007513, -0.022274013409591235, 0.1896114244569685, -0.05658276972717771, -0.0011170485587877648, 0.05494196840374792, -0.06608829247056959, 0.1060845753782925, 0.2668099444028791, 0.10520492529357288, 0.32928851974483964, -0.4071513320032124, -0.26109887863222125, 0.04838636846098805, 0.14370063676229008, 0.07986626197000808, -0.08284283133667554, -0.3613936002844962, 0.12918566316192118, -0.18113240280197324, -0.13133923449144463, -0.0820406349898081, -0.012862192971684108, 0.06044185232527763, -0.3197255091236852, -0.013037310321336594, 0.03165005130049224, 0.07704259731989598, -0.08051925018934586, -0.04692808075625206, -0.04859448009318559, 0.1297700523712159, 0.028575816786865417, 0.014934452287591646, 0.16849494298101864, -0.0708210317289596, -0.10632394626736641, 0.3792864569401908, 0.012555962646049317, -0.28940461179411264, 0.1299530257433914, -0.058538964305456, -0.06719476215663218, 0.14081622363028995, 0.218135981777004, 0.10153481623192674, -0.16822163214054064, 0.05711035243840453, -0.06679893666704263, 0.17528357892950006, -0.007921525179277931, -0.03606523494192652, 0.1318378647806767, 0.23144974607417237, 0.1470323312400936, 0.12489652292798578, -0.09368055396513125, -0.12692076405162148, -0.2974236853655741, -0.05167620897425826, -0.17048966369774438, -0.027237622532993555, -0.09016985917071133, -0.1284114022997086, 0.3675494575906677, 0.17359824747143088, 0.1069311385791505, 0.0844559970738314, 0.38388004857246005, 0.10282872626383867, 0.009102297824955433, 0.12674369351398723, 0.28909403852200155, 0.09561551531567891, 0.08369748150303125, -0.2572935192288709, 0.1350809961653132, 0.06594371694729285]
|
1,803.06364
|
Conversion rules for Weyl points and nodal lines in topological media
|
According to a widely-held paradigm, a pair of Weyl points with opposite
chirality mutually annihilate when brought together. In contrast, we show that
such a process is strictly forbidden for Weyl points related by a mirror
symmetry, provided that an effective two-band description exists in terms of
orbitals with opposite mirror eigenvalue. Instead, such a pair of Weyl points
convert into a nodal loop inside a symmetric plane upon the collision. Similar
constraints are identified for systems with multiple mirrors, facilitating
previously unreported nodal-line and nodal-chain semimetals that exhibit both
Fermi-arc and drumhead surface states. We further find that Weyl points in
systems symmetric under a $\pi$-rotation composed with time-reversal are
characterized by an additional integer charge that we call helicity. A pair of
Weyl points with opposite chirality can annihilate only if their helicities
also cancel out. We base our predictions on topological crystalline invariants
derived from relative homotopy theory, and we test our predictions on simple
tight-binding models. The outlined homotopy description can be directly
generalized to systems with multiple bands and other choices of symmetry.
|
cond-mat.mes-hall
|
according to a widelyheld paradigm a pair of weyl points with opposite chirality mutually annihilate when brought together in contrast we show that such a process is strictly forbidden for weyl points related by a mirror symmetry provided that an effective twoband description exists in terms of orbitals with opposite mirror eigenvalue instead such a pair of weyl points convert into a nodal loop inside a symmetric plane upon the collision similar constraints are identified for systems with multiple mirrors facilitating previously unreported nodalline and nodalchain semimetals that exhibit both fermiarc and drumhead surface states we further find that weyl points in systems symmetric under a pirotation composed with timereversal are characterized by an additional integer charge that we call helicity a pair of weyl points with opposite chirality can annihilate only if their helicities also cancel out we base our predictions on topological crystalline invariants derived from relative homotopy theory and we test our predictions on simple tightbinding models the outlined homotopy description can be directly generalized to systems with multiple bands and other choices of symmetry
|
[['according', 'to', 'a', 'widelyheld', 'paradigm', 'a', 'pair', 'of', 'weyl', 'points', 'with', 'opposite', 'chirality', 'mutually', 'annihilate', 'when', 'brought', 'together', 'in', 'contrast', 'we', 'show', 'that', 'such', 'a', 'process', 'is', 'strictly', 'forbidden', 'for', 'weyl', 'points', 'related', 'by', 'a', 'mirror', 'symmetry', 'provided', 'that', 'an', 'effective', 'twoband', 'description', 'exists', 'in', 'terms', 'of', 'orbitals', 'with', 'opposite', 'mirror', 'eigenvalue', 'instead', 'such', 'a', 'pair', 'of', 'weyl', 'points', 'convert', 'into', 'a', 'nodal', 'loop', 'inside', 'a', 'symmetric', 'plane', 'upon', 'the', 'collision', 'similar', 'constraints', 'are', 'identified', 'for', 'systems', 'with', 'multiple', 'mirrors', 'facilitating', 'previously', 'unreported', 'nodalline', 'and', 'nodalchain', 'semimetals', 'that', 'exhibit', 'both', 'fermiarc', 'and', 'drumhead', 'surface', 'states', 'we', 'further', 'find', 'that', 'weyl', 'points', 'in', 'systems', 'symmetric', 'under', 'a', 'pirotation', 'composed', 'with', 'timereversal', 'are', 'characterized', 'by', 'an', 'additional', 'integer', 'charge', 'that', 'we', 'call', 'helicity', 'a', 'pair', 'of', 'weyl', 'points', 'with', 'opposite', 'chirality', 'can', 'annihilate', 'only', 'if', 'their', 'helicities', 'also', 'cancel', 'out', 'we', 'base', 'our', 'predictions', 'on', 'topological', 'crystalline', 'invariants', 'derived', 'from', 'relative', 'homotopy', 'theory', 'and', 'we', 'test', 'our', 'predictions', 'on', 'simple', 'tightbinding', 'models', 'the', 'outlined', 'homotopy', 'description', 'can', 'be', 'directly', 'generalized', 'to', 'systems', 'with', 'multiple', 'bands', 'and', 'other', 'choices', 'of', 'symmetry']]
|
[-0.20442641103441378, 0.1851058864929737, -0.06761584995481908, 0.03175264841252868, -0.09323963055810944, -0.21351501679707194, 0.07412984043037979, 0.37406223818850753, -0.25067925939252705, -0.24270107446688363, -0.012161583837848993, -0.30758104214361043, -0.16828000364992557, 0.1572090723876203, -0.028535419380491117, -0.007192979300567315, 0.020325580639293774, 0.021499495046197574, -0.10620400872411144, -0.20632698394101784, 0.35961311488684394, -0.037965261710289695, 0.2951027477869134, 0.015465208219058205, 0.05798027151672358, 0.00913089242818755, 0.053942095858484425, 0.054440190017200796, -0.08853932942517705, 0.0844928569587476, 0.23082744660931578, -0.03301691117937143, 0.1448259942986992, -0.450548284728959, -0.1702485009870921, 0.08323028329315103, 0.15374020307607364, 0.09688695086024994, -0.07401182275432884, -0.3232804204054763, 0.10962541207731336, -0.14941535236345332, -0.15796409957529453, -0.10474239416574808, -0.0289285844688963, -0.012889608048200817, -0.23736965469492788, 0.009596848966661067, 0.06681428495893454, 0.06465828177529608, -0.07016509571478943, -0.10060399129798406, -0.1368756916536165, 0.06311450309981462, 0.05498951401811988, 0.0018704656532473778, 0.0802011253345585, -0.0912439260537621, -0.1804873407818377, 0.4026420612327671, -0.02461785306366621, -0.22223251647305456, 0.1902622980212144, -0.10982796112389377, -0.12136890309381435, 0.14124715913301647, 0.10634015533246435, 0.0864584297357059, -0.08965205045567702, 0.07328290645990604, -0.08072264358830335, 0.11100532790303251, 0.07770555808596062, 0.04148840537200567, 0.3158461874602049, 0.05880340753683004, 0.08677459110275665, 0.10695431349515193, -0.07334578225619337, -0.09746276518837496, -0.33630210092602547, -0.1808943263715489, -0.19388021571166666, 0.04882389031680238, -0.04319048227756703, -0.16837642978473955, 0.40705389183098345, 0.08511009768012576, 0.24553652327727485, 0.0008624436011998339, 0.22955068243926474, 0.11436360759079833, 0.0913828985825746, 0.061130216319030255, 0.21729093189534385, 0.11883266623984771, 0.007732867229248533, -0.19864317307934123, -0.006738221984398499, 0.09948629015543906]
|
1,803.06365
|
Inference for case-control studies with incident and prevalent cases
|
We propose and study a fully efficient method to estimate associations of an
exposure with disease incidence when both, incident cases and prevalent cases,
i.e. individuals who were diagnosed with the disease at some prior time point
and are alive at the time of sampling, are included in a case-control study. We
extend the exponential tilting model for the relationship between exposure and
case status to accommodate two case groups, and correct for the survival bias
in the prevalent cases through a tilting term that depends on the parametric
distribution of the backward time, i.e. the time from disease diagnosis to
study enrollment. We construct an empirical likelihood that also incorporates
the observed backward times for prevalent cases, obtain efficient estimates of
odds ratio parameters that relate exposure to disease incidence and propose a
likelihood ratio test for model parameters that has a standard chi-squared
distribution. We quantify the changes in efficiency of association parameters
when incident cases are supplemented with, or replaced by, prevalent cases in
simulations. We illustrate our methods by estimating associations of single
nucleotide polymorphisms (SNPs) with breast cancer incidence in a sample of
controls and incident and prevalent cases from the U.S. Radiologic
Technologists Health Study.
|
stat.ME
|
we propose and study a fully efficient method to estimate associations of an exposure with disease incidence when both incident cases and prevalent cases ie individuals who were diagnosed with the disease at some prior time point and are alive at the time of sampling are included in a casecontrol study we extend the exponential tilting model for the relationship between exposure and case status to accommodate two case groups and correct for the survival bias in the prevalent cases through a tilting term that depends on the parametric distribution of the backward time ie the time from disease diagnosis to study enrollment we construct an empirical likelihood that also incorporates the observed backward times for prevalent cases obtain efficient estimates of odds ratio parameters that relate exposure to disease incidence and propose a likelihood ratio test for model parameters that has a standard chisquared distribution we quantify the changes in efficiency of association parameters when incident cases are supplemented with or replaced by prevalent cases in simulations we illustrate our methods by estimating associations of single nucleotide polymorphisms snps with breast cancer incidence in a sample of controls and incident and prevalent cases from the us radiologic technologists health study
|
[['we', 'propose', 'and', 'study', 'a', 'fully', 'efficient', 'method', 'to', 'estimate', 'associations', 'of', 'an', 'exposure', 'with', 'disease', 'incidence', 'when', 'both', 'incident', 'cases', 'and', 'prevalent', 'cases', 'ie', 'individuals', 'who', 'were', 'diagnosed', 'with', 'the', 'disease', 'at', 'some', 'prior', 'time', 'point', 'and', 'are', 'alive', 'at', 'the', 'time', 'of', 'sampling', 'are', 'included', 'in', 'a', 'casecontrol', 'study', 'we', 'extend', 'the', 'exponential', 'tilting', 'model', 'for', 'the', 'relationship', 'between', 'exposure', 'and', 'case', 'status', 'to', 'accommodate', 'two', 'case', 'groups', 'and', 'correct', 'for', 'the', 'survival', 'bias', 'in', 'the', 'prevalent', 'cases', 'through', 'a', 'tilting', 'term', 'that', 'depends', 'on', 'the', 'parametric', 'distribution', 'of', 'the', 'backward', 'time', 'ie', 'the', 'time', 'from', 'disease', 'diagnosis', 'to', 'study', 'enrollment', 'we', 'construct', 'an', 'empirical', 'likelihood', 'that', 'also', 'incorporates', 'the', 'observed', 'backward', 'times', 'for', 'prevalent', 'cases', 'obtain', 'efficient', 'estimates', 'of', 'odds', 'ratio', 'parameters', 'that', 'relate', 'exposure', 'to', 'disease', 'incidence', 'and', 'propose', 'a', 'likelihood', 'ratio', 'test', 'for', 'model', 'parameters', 'that', 'has', 'a', 'standard', 'chisquared', 'distribution', 'we', 'quantify', 'the', 'changes', 'in', 'efficiency', 'of', 'association', 'parameters', 'when', 'incident', 'cases', 'are', 'supplemented', 'with', 'or', 'replaced', 'by', 'prevalent', 'cases', 'in', 'simulations', 'we', 'illustrate', 'our', 'methods', 'by', 'estimating', 'associations', 'of', 'single', 'nucleotide', 'polymorphisms', 'snps', 'with', 'breast', 'cancer', 'incidence', 'in', 'a', 'sample', 'of', 'controls', 'and', 'incident', 'and', 'prevalent', 'cases', 'from', 'the', 'us', 'radiologic', 'technologists', 'health', 'study']]
|
[-0.05352118170231729, 0.07028037480519395, -0.044683123164953875, 0.12362683822970781, -0.039656695325983995, -0.16168212293373857, 0.11037056326903218, 0.4109252181613067, -0.20785175273380246, -0.30088442855917696, 0.10586804570803947, -0.2894582452613916, -0.14423780085371846, 0.18167210646108053, -0.08889316693666525, -0.0033002741970336157, 0.10113460924569054, 0.02259829646411968, -0.007600581143410478, -0.2722432359378896, 0.30248170769518584, 0.05773202824262689, 0.2884487894674142, -0.019956270242063562, 0.09349822881979061, 0.06012001079715677, -0.06212362615085805, 0.009149355560043999, -0.13495404233032982, 0.08814652824855615, 0.28861455006561987, 0.16107672145034171, 0.31329829143869936, -0.39298052314664694, -0.21662488524148713, 0.12352212290951417, 0.12378562143679467, 0.1004795063268486, -0.03308320755836327, -0.24754545973632391, 0.05222450842645334, -0.1440423559907138, -0.11943236005200601, -0.022271859732952284, 0.008837900659653232, 0.02710252057584883, -0.3311826976743615, 0.15723192258445495, -0.04171437439300231, 0.10573334946987492, -0.05654029708717074, -0.13200949888620803, -0.01474870030480942, 0.14078959038530925, 0.11541913764027703, -0.014140393121622095, 0.11818532339431605, -0.15122833370059655, -0.1189188068241474, 0.3232458815559518, -0.015654448888945714, -0.1816809713905353, 0.1859140234202406, -0.15366463693419463, -0.11371268436720419, 0.1085545616409746, 0.20564234689855718, 0.1314316920875873, -0.17682756304544564, -0.0011485634167187509, -0.003851216388356626, 0.16641552401755808, 0.08096638723596264, -0.05382367239486593, 0.13371414930758932, 0.170210069191378, 0.03929259787969273, 0.12575360160524868, -0.1599265142698397, -0.06812313603311407, -0.26639350083892915, -0.13698852705492393, -0.08035336387420736, 0.013729488919604921, -0.08844947004493844, -0.16255605457447914, 0.3991147886373251, 0.18850383417280067, 0.17169404734014093, 0.1022380802569568, 0.252842313391087, 0.08136550928825113, 0.05996280888197434, 0.030075837069864917, 0.18014222119001796, 0.09839106608930494, 0.024647187244666007, -0.21664234680999347, 0.17874520707560415, -0.018572796834632754]
|
1,803.06366
|
Graphs, Ultrafilters and Colourability
|
Let $\beta$ be the functor from Set to CHaus which maps each discrete set X
to its Stone-Cech compactification, the set $\beta$ X of ultrafilters on X.
Every graph G with vertex set V naturally gives rise to a graph $\beta G$ on
the set $\beta V$ of ultrafilters on V . In what follows, we interrelate the
properties of G and $\beta G$. Perhaps the most striking result is that G can
be finitely coloured iff $\beta G$ has no loops.
|
math.CT math.CO
|
let beta be the functor from set to chaus which maps each discrete set x to its stonecech compactification the set beta x of ultrafilters on x every graph g with vertex set v naturally gives rise to a graph beta g on the set beta v of ultrafilters on v in what follows we interrelate the properties of g and beta g perhaps the most striking result is that g can be finitely coloured iff beta g has no loops
|
[['let', 'beta', 'be', 'the', 'functor', 'from', 'set', 'to', 'chaus', 'which', 'maps', 'each', 'discrete', 'set', 'x', 'to', 'its', 'stonecech', 'compactification', 'the', 'set', 'beta', 'x', 'of', 'ultrafilters', 'on', 'x', 'every', 'graph', 'g', 'with', 'vertex', 'set', 'v', 'naturally', 'gives', 'rise', 'to', 'a', 'graph', 'beta', 'g', 'on', 'the', 'set', 'beta', 'v', 'of', 'ultrafilters', 'on', 'v', 'in', 'what', 'follows', 'we', 'interrelate', 'the', 'properties', 'of', 'g', 'and', 'beta', 'g', 'perhaps', 'the', 'most', 'striking', 'result', 'is', 'that', 'g', 'can', 'be', 'finitely', 'coloured', 'iff', 'beta', 'g', 'has', 'no', 'loops']]
|
[-0.13857133675044703, 0.14898233541092018, -0.08786377017558725, -0.0028661710057798543, -0.12515591997883202, -0.1658729632028643, 0.06765789502978693, 0.40161669510991577, -0.34969514026162846, -0.22092652445900496, 0.0255819243123111, -0.32537053114473014, -0.0842448782497718, 0.18308132303947652, -0.11233592980805739, -0.07664740828863334, 0.0717361190666755, 0.16002259750701028, 0.00574888754348604, -0.21341296757878966, 0.32385840250271153, -0.09510043635102058, 0.13298051440685896, 0.011506588462694192, 0.09209066643207162, -0.045612378500080035, 0.008316803953529876, 0.03655190748898427, -0.19262706750853312, 0.05145914531830284, 0.23713212865002362, 0.15405929800881832, 0.2367358485489716, -0.3065671158281161, -0.14582665578496676, 0.24039488278306376, 0.06227248887542957, -0.12939184738098886, 0.04989176187922971, -0.26569285880728266, 0.13193831306071607, -0.11095140547848042, -0.09271366924714343, -0.012923156510590127, 0.21444710947495574, -0.01091531212269156, -0.33159900055393393, -0.07417332401706113, 0.09399373233778241, 0.020425563018458586, 0.10082602988853821, -0.19101413031810044, -0.1385461793505345, 0.07192345000918449, -0.013121589210551277, 0.18921686841726856, 0.09682535298993628, -0.07332667204792853, -0.09483183116686565, 0.40461007238906105, -0.08899819968199288, -0.14016944283826482, 0.12697632465925482, -0.24873249872622114, -0.17926270340534825, 0.14891301281462757, 0.04409109661930505, 0.1273578710877049, -0.05437541970362266, 0.2680523677917347, -0.14282620651072558, 0.12335429101446528, 0.09251001477942164, 0.00018599088861388557, 0.16607629507780075, 0.12717328276801396, 0.13017129432410002, 0.08059272495095537, 0.028974323391190007, 0.14734280513553524, -0.4172244329051471, -0.05201931969251162, -0.15351214573465655, 0.1796713737471972, -0.14301677936969043, -0.2163649697293654, 0.39298503215850134, 0.07407773178599683, 0.18687241084091824, 0.05656703124771378, 0.11462732885078883, 0.068800662011289, 0.03332735330763238, 0.05840725832860227, 0.029265048614714618, 0.2463676148197717, -0.09070093901597975, -0.1441622872946117, 0.013512545575698217, 0.2160673063179409]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.