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.05167
|
A generalization of the steepest-edge rule and its number of simplex
iterations for a nondegenerate LP
|
In this paper, we propose a $p$-norm rule, which is a generalization of the
steepest-edge rule, as a pivoting rule for the simplex method. For a
nondegenerate linear programming problem, we show upper bounds for the number
of iterations of the simplex method with the steepest-edge and $p$-norm rules.
One of the upper bounds is given by a function of the number of variables, that
of constraints, and the minimum and maximum positive elements in all basic
feasible solutions.
|
math.OC
|
in this paper we propose a pnorm rule which is a generalization of the steepestedge rule as a pivoting rule for the simplex method for a nondegenerate linear programming problem we show upper bounds for the number of iterations of the simplex method with the steepestedge and pnorm rules one of the upper bounds is given by a function of the number of variables that of constraints and the minimum and maximum positive elements in all basic feasible solutions
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'pnorm', 'rule', 'which', 'is', 'a', 'generalization', 'of', 'the', 'steepestedge', 'rule', 'as', 'a', 'pivoting', 'rule', 'for', 'the', 'simplex', 'method', 'for', 'a', 'nondegenerate', 'linear', 'programming', 'problem', 'we', 'show', 'upper', 'bounds', 'for', 'the', 'number', 'of', 'iterations', 'of', 'the', 'simplex', 'method', 'with', 'the', 'steepestedge', 'and', 'pnorm', 'rules', 'one', 'of', 'the', 'upper', 'bounds', 'is', 'given', 'by', 'a', 'function', 'of', 'the', 'number', 'of', 'variables', 'that', 'of', 'constraints', 'and', 'the', 'minimum', 'and', 'maximum', 'positive', 'elements', 'in', 'all', 'basic', 'feasible', 'solutions']]
|
[-0.12333795713720383, 0.05312366440118133, -0.07921799875844221, 0.044761521138504824, -0.08192168569869616, -0.13810354369003083, 0.18368750028221492, 0.2828062138816511, -0.297709073242429, -0.29870257232725234, 0.15536376794909018, -0.2629443990526261, -0.1687482658338237, 0.19086826042659194, -0.048098156119805655, 0.10303675586527045, 0.06455417041509569, 0.075605917504275, -0.10338518745870656, -0.273842435886527, 0.3242285330840326, 0.008166854330278063, 0.2052375356811885, 0.0648219282073634, 0.14253020067034022, 0.0003035292634135717, 0.014361535477173793, 0.05144110699365666, -0.11936105914195083, 0.17046186826101128, 0.2091448220678351, 0.23933695474421823, 0.31331871844247566, -0.35575417051841685, -0.12729184920960046, 0.1593389239331538, 0.08862592209003527, 0.07409102427916807, -0.005187859274930768, -0.15390932305969976, 0.11660736389821033, -0.147134994446941, -0.1092646183603286, -0.0456666655282115, 0.022061711778961025, 0.056296446082460413, -0.37209809206232625, 0.036783774353128365, 0.1192171384653004, 0.014190385414645765, -0.061029287430082825, -0.18258274627196325, 0.04260797742996123, 0.04125890448725746, 0.004904130951489334, 0.008488856695967351, 0.03617315320902831, -0.1108897234004765, -0.15624818052225686, 0.3623071012945918, -0.07630002168430523, -0.2564415249780014, 0.09288964258482704, -0.11307105002320045, -0.13477916860432884, 0.09960076938588898, 0.1786644833537375, 0.20067626015319454, -0.13201526928596297, 0.09330682850566802, -0.1355947225245756, 0.11486851229247722, 0.05041372636937863, 0.04216403262568759, 0.1625351035459475, 0.14157966166338204, 0.17935969635191096, 0.17268160292757795, -0.07093735452281771, -0.07235146160297967, -0.34840430396717864, -0.1871813843056995, -0.22554939008747263, -0.01599876560851351, -0.1449002271826914, -0.1933265082604651, 0.36866271478885954, 0.11317414520066474, 0.22339876950453882, 0.1501308913877863, 0.2917980405852779, 0.17378376583816701, 0.06222307619142842, 0.09424143976398877, 0.19772854778770502, 0.16163417914059836, 0.00989269083002945, -0.21183489559538807, 0.06379151300152207, 0.1458704893828019]
|
1,803.05168
|
A 1.6:1 Bandwidth Two-Layer Antireflection Structure for Silicon Matched
to the 190-310 GHz Atmospheric Window
|
Although high-resistivity, low-loss silicon is an excellent material for THz
transmission optics, its high refractive index necessitates antireflection
treatment. We fabricated a wide-bandwidth, two-layer antireflection treatment
by cutting subwavelength structures into the silicon surface using multi-depth
deep reactive ion etching (DRIE). A wafer with this treatment on both sides has
<-20 dB (<1%) reflectance over 190-310 GHz. We also demonstrated that bonding
wafers introduces no reflection features above the -20 dB level, reproducing
previous work. Together these developments immediately enable construction of
wide-bandwidth silicon vacuum windows and represent two important steps toward
gradient-index silicon optics with integral broadband antireflection treatment.
|
astro-ph.IM
|
although highresistivity lowloss silicon is an excellent material for thz transmission optics its high refractive index necessitates antireflection treatment we fabricated a widebandwidth twolayer antireflection treatment by cutting subwavelength structures into the silicon surface using multidepth deep reactive ion etching drie a wafer with this treatment on both sides has 20 db 1 reflectance over 190310 ghz we also demonstrated that bonding wafers introduces no reflection features above the 20 db level reproducing previous work together these developments immediately enable construction of widebandwidth silicon vacuum windows and represent two important steps toward gradientindex silicon optics with integral broadband antireflection treatment
|
[['although', 'highresistivity', 'lowloss', 'silicon', 'is', 'an', 'excellent', 'material', 'for', 'thz', 'transmission', 'optics', 'its', 'high', 'refractive', 'index', 'necessitates', 'antireflection', 'treatment', 'we', 'fabricated', 'a', 'widebandwidth', 'twolayer', 'antireflection', 'treatment', 'by', 'cutting', 'subwavelength', 'structures', 'into', 'the', 'silicon', 'surface', 'using', 'multidepth', 'deep', 'reactive', 'ion', 'etching', 'drie', 'a', 'wafer', 'with', 'this', 'treatment', 'on', 'both', 'sides', 'has', '20', 'db', '1', 'reflectance', 'over', '190310', 'ghz', 'we', 'also', 'demonstrated', 'that', 'bonding', 'wafers', 'introduces', 'no', 'reflection', 'features', 'above', 'the', '20', 'db', 'level', 'reproducing', 'previous', 'work', 'together', 'these', 'developments', 'immediately', 'enable', 'construction', 'of', 'widebandwidth', 'silicon', 'vacuum', 'windows', 'and', 'represent', 'two', 'important', 'steps', 'toward', 'gradientindex', 'silicon', 'optics', 'with', 'integral', 'broadband', 'antireflection', 'treatment']]
|
[-0.06402064946884609, 0.11954503163658294, -0.03880883528700456, -0.12571051489147875, -0.044239911749356924, -0.2777967750038387, 0.03101613847162537, 0.5784311496248149, -0.172513889877897, -0.31239527127131667, 0.06576674678504016, -0.2766105578083432, -0.12211918287482489, 0.22565380223930315, -0.07261238082293232, 0.09107352044101748, 0.051540765008240036, -0.20500541718281579, -0.04217977024558367, -0.154416850683364, 0.19446259347082237, 0.14216295487660152, 0.35569625178286146, 0.10132471106551362, 0.1348470452787223, 0.05321211514893374, 0.023656608113511043, -0.06028960374268619, -0.1149331858865076, 0.1345300848943868, 0.3103075632849012, -0.045877722882185924, 0.24301268318385788, -0.487636815493155, -0.28222101971929225, -0.06778240618719296, 0.09942147618270188, 0.0758877894794098, -0.10857600940631307, -0.22118243719498165, 0.03680190725270847, -0.13548367248490603, -0.13076213881316961, 0.019575931131839752, -0.07646545796946745, -0.07546843174431059, -0.20500854716043582, -0.06615022401768723, 0.03812082041751104, 0.0857704021706895, -0.07801517413463444, -0.16685497919756054, -0.01931304018003772, 0.01743170859837773, -0.1436593893684936, -0.04025584524538547, 0.24021598090496468, -0.07912793410283447, -0.07882693397455068, 0.3102652165860013, -0.04113743091864197, -0.07127797886766869, 0.15316833830744292, -0.12842147098736592, 0.018939084034751762, 0.2324077586732767, 0.1536218324638527, 0.0752290142794149, -0.16516443972965006, 0.02426908754995281, 0.03330943266851733, 0.24274084283788766, 0.23827756787038812, 0.10893647030532135, 0.2216890517697491, 0.2739849416139263, 0.036901865554314975, 0.10973603942333321, -0.16853565190956374, 0.05892329435381624, -0.27232167470936824, -0.21597097023429038, -0.10433228520295498, 0.06533794400442128, -0.1269201972811998, -0.21052095778474603, 0.36695470805797314, 0.0960310058329593, 0.10478037958400267, -0.030907661061395298, 0.3567514132633053, 0.07403545491773673, 0.14942902606921366, -0.01731397183800135, 0.29262241208925843, 0.17943597015115725, 0.15860102596490483, -0.14883642712833756, -0.0010173612302451422, -0.03093745295579235]
|
1,803.05169
|
Geometrical versus time-series representation of data in quantum control
learning
|
Recently machine learning techniques have become popular for analysing
physical systems and solving problems occurring in quantum computing. In this
paper we focus on using such techniques for finding the sequence of physical
operations implementing the given quantum logical operation. In this context we
analyse the flexibility of the data representation and compare the
applicability of two machine learning approaches based on different
representations of data. We demonstrate that the utilization of the geometrical
structure of control pulses is sufficient for achieving high-fidelity of the
implemented evolution. We also demonstrate that artificial neural networks,
unlike geometrical methods, posses the generalization abilities enabling them
to generate control pulses for the systems with variable strength of the
disturbance. The presented results suggest that in some quantum control
scenarios, geometrical data representation and processing is competitive to
more complex methods.
|
quant-ph cs.LG
|
recently machine learning techniques have become popular for analysing physical systems and solving problems occurring in quantum computing in this paper we focus on using such techniques for finding the sequence of physical operations implementing the given quantum logical operation in this context we analyse the flexibility of the data representation and compare the applicability of two machine learning approaches based on different representations of data we demonstrate that the utilization of the geometrical structure of control pulses is sufficient for achieving highfidelity of the implemented evolution we also demonstrate that artificial neural networks unlike geometrical methods posses the generalization abilities enabling them to generate control pulses for the systems with variable strength of the disturbance the presented results suggest that in some quantum control scenarios geometrical data representation and processing is competitive to more complex methods
|
[['recently', 'machine', 'learning', 'techniques', 'have', 'become', 'popular', 'for', 'analysing', 'physical', 'systems', 'and', 'solving', 'problems', 'occurring', 'in', 'quantum', 'computing', 'in', 'this', 'paper', 'we', 'focus', 'on', 'using', 'such', 'techniques', 'for', 'finding', 'the', 'sequence', 'of', 'physical', 'operations', 'implementing', 'the', 'given', 'quantum', 'logical', 'operation', 'in', 'this', 'context', 'we', 'analyse', 'the', 'flexibility', 'of', 'the', 'data', 'representation', 'and', 'compare', 'the', 'applicability', 'of', 'two', 'machine', 'learning', 'approaches', 'based', 'on', 'different', 'representations', 'of', 'data', 'we', 'demonstrate', 'that', 'the', 'utilization', 'of', 'the', 'geometrical', 'structure', 'of', 'control', 'pulses', 'is', 'sufficient', 'for', 'achieving', 'highfidelity', 'of', 'the', 'implemented', 'evolution', 'we', 'also', 'demonstrate', 'that', 'artificial', 'neural', 'networks', 'unlike', 'geometrical', 'methods', 'posses', 'the', 'generalization', 'abilities', 'enabling', 'them', 'to', 'generate', 'control', 'pulses', 'for', 'the', 'systems', 'with', 'variable', 'strength', 'of', 'the', 'disturbance', 'the', 'presented', 'results', 'suggest', 'that', 'in', 'some', 'quantum', 'control', 'scenarios', 'geometrical', 'data', 'representation', 'and', 'processing', 'is', 'competitive', 'to', 'more', 'complex', 'methods']]
|
[-0.10073762604147604, 0.03712554281767811, -0.08223415091361878, 0.05422686756908023, -0.06425145668840974, -0.15923387761207392, 0.019160270752099744, 0.4154561873538977, -0.2707322761144516, -0.314618145537148, 0.10193986973358168, -0.2127633103930874, -0.19451552817774734, 0.28562469485412983, -0.0873358092427145, 0.11089858704800616, 0.09058257440159465, 0.010389160075952319, -0.09131986193845804, -0.2522506001150494, 0.33223075835360555, 0.02676048452785769, 0.33623855368635297, 0.004744248213178485, 0.12977295335854683, 0.011234508908904381, -0.025652672211727956, -0.015552036423426474, -0.08461474175143258, 0.19639875065113832, 0.278779303870864, 0.20321725250772424, 0.2982559081330134, -0.44456839750658544, -0.241391915984343, 0.10185781674014309, 0.1309794396175629, 0.13821681872023828, -0.0702427639495318, -0.2728346423551875, 0.07808769456353923, -0.150271149660651, -0.06410604949877427, -0.16183848901359488, 0.004472195553205853, 0.02926118403883909, -0.2519917188294701, -0.004496760913009422, 0.058652351916271404, 0.09079261466805112, -0.05268979945090892, -0.0838992742321923, 0.05967861353283762, 0.13938640547494818, -0.02083146646890762, -0.01823766059480118, 0.13537786677811145, -0.1762887428962476, -0.20297736019222407, 0.3840503779233155, -0.0016930735853575441, -0.20714145465108164, 0.2231270660642861, -0.04089254311653004, -0.19324388684038699, 0.04671475603958986, 0.22137777898868505, 0.09736048138571264, -0.1391789118192553, 0.054014137115441674, 0.024149178877391302, 0.15505035816994325, 0.03274466927387636, 0.08296914304518242, 0.16818345541875457, 0.23444029881897635, 0.03250365464159553, 0.147880368293297, -0.08111631602280855, -0.13947947867160296, -0.22469423520956597, -0.13323029662978692, -0.18431550849154318, -0.014726376252751933, -0.08131355710676447, -0.13630021770355583, 0.4024533100263046, 0.24064846152616462, 0.16867041662607316, 0.06119242628329318, 0.3296727312959894, 0.10784273864285014, 0.08091687298223485, 0.08183004998221287, 0.2160901931298465, 0.12162626899071853, 0.12189971640991577, -0.22088053606256816, 0.05318320542743878, 0.010534464514195702]
|
1,803.0517
|
xDeepFM: Combining Explicit and Implicit Feature Interactions for
Recommender Systems
|
Combinatorial features are essential for the success of many commercial
models. Manually crafting these features usually comes with high cost due to
the variety, volume and velocity of raw data in web-scale systems.
Factorization based models, which measure interactions in terms of vector
product, can learn patterns of combinatorial features automatically and
generalize to unseen features as well. With the great success of deep neural
networks (DNNs) in various fields, recently researchers have proposed several
DNN-based factorization model to learn both low- and high-order feature
interactions. Despite the powerful ability of learning an arbitrary function
from data, plain DNNs generate feature interactions implicitly and at the
bit-wise level. In this paper, we propose a novel Compressed Interaction
Network (CIN), which aims to generate feature interactions in an explicit
fashion and at the vector-wise level. We show that the CIN share some
functionalities with convolutional neural networks (CNNs) and recurrent neural
networks (RNNs). We further combine a CIN and a classical DNN into one unified
model, and named this new model eXtreme Deep Factorization Machine (xDeepFM).
On one hand, the xDeepFM is able to learn certain bounded-degree feature
interactions explicitly; on the other hand, it can learn arbitrary low- and
high-order feature interactions implicitly. We conduct comprehensive
experiments on three real-world datasets. Our results demonstrate that xDeepFM
outperforms state-of-the-art models. We have released the source code of
xDeepFM at \url{https://github.com/Leavingseason/xDeepFM}.
|
cs.LG cs.IR
|
combinatorial features are essential for the success of many commercial models manually crafting these features usually comes with high cost due to the variety volume and velocity of raw data in webscale systems factorization based models which measure interactions in terms of vector product can learn patterns of combinatorial features automatically and generalize to unseen features as well with the great success of deep neural networks dnns in various fields recently researchers have proposed several dnnbased factorization model to learn both low and highorder feature interactions despite the powerful ability of learning an arbitrary function from data plain dnns generate feature interactions implicitly and at the bitwise level in this paper we propose a novel compressed interaction network cin which aims to generate feature interactions in an explicit fashion and at the vectorwise level we show that the cin share some functionalities with convolutional neural networks cnns and recurrent neural networks rnns we further combine a cin and a classical dnn into one unified model and named this new model extreme deep factorization machine xdeepfm on one hand the xdeepfm is able to learn certain boundeddegree feature interactions explicitly on the other hand it can learn arbitrary low and highorder feature interactions implicitly we conduct comprehensive experiments on three realworld datasets our results demonstrate that xdeepfm outperforms stateoftheart models we have released the source code of xdeepfm at urlhttpsgithubcomleavingseasonxdeepfm
|
[['combinatorial', 'features', 'are', 'essential', 'for', 'the', 'success', 'of', 'many', 'commercial', 'models', 'manually', 'crafting', 'these', 'features', 'usually', 'comes', 'with', 'high', 'cost', 'due', 'to', 'the', 'variety', 'volume', 'and', 'velocity', 'of', 'raw', 'data', 'in', 'webscale', 'systems', 'factorization', 'based', 'models', 'which', 'measure', 'interactions', 'in', 'terms', 'of', 'vector', 'product', 'can', 'learn', 'patterns', 'of', 'combinatorial', 'features', 'automatically', 'and', 'generalize', 'to', 'unseen', 'features', 'as', 'well', 'with', 'the', 'great', 'success', 'of', 'deep', 'neural', 'networks', 'dnns', 'in', 'various', 'fields', 'recently', 'researchers', 'have', 'proposed', 'several', 'dnnbased', 'factorization', 'model', 'to', 'learn', 'both', 'low', 'and', 'highorder', 'feature', 'interactions', 'despite', 'the', 'powerful', 'ability', 'of', 'learning', 'an', 'arbitrary', 'function', 'from', 'data', 'plain', 'dnns', 'generate', 'feature', 'interactions', 'implicitly', 'and', 'at', 'the', 'bitwise', 'level', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'compressed', 'interaction', 'network', 'cin', 'which', 'aims', 'to', 'generate', 'feature', 'interactions', 'in', 'an', 'explicit', 'fashion', 'and', 'at', 'the', 'vectorwise', 'level', 'we', 'show', 'that', 'the', 'cin', 'share', 'some', 'functionalities', 'with', 'convolutional', 'neural', 'networks', 'cnns', 'and', 'recurrent', 'neural', 'networks', 'rnns', 'we', 'further', 'combine', 'a', 'cin', 'and', 'a', 'classical', 'dnn', 'into', 'one', 'unified', 'model', 'and', 'named', 'this', 'new', 'model', 'extreme', 'deep', 'factorization', 'machine', 'xdeepfm', 'on', 'one', 'hand', 'the', 'xdeepfm', 'is', 'able', 'to', 'learn', 'certain', 'boundeddegree', 'feature', 'interactions', 'explicitly', 'on', 'the', 'other', 'hand', 'it', 'can', 'learn', 'arbitrary', 'low', 'and', 'highorder', 'feature', 'interactions', 'implicitly', 'we', 'conduct', 'comprehensive', 'experiments', 'on', 'three', 'realworld', 'datasets', 'our', 'results', 'demonstrate', 'that', 'xdeepfm', 'outperforms', 'stateoftheart', 'models', 'we', 'have', 'released', 'the', 'source', 'code', 'of', 'xdeepfm', 'at', 'urlhttpsgithubcomleavingseasonxdeepfm']]
|
[-0.05062894443899654, 0.019743582632177174, -0.07519585977608681, 0.08734434445362065, -0.11681331859149954, -0.2067528785504564, -0.009463602129120804, 0.4414146968996839, -0.3114999365081945, -0.31988861754928766, 0.04783005894543685, -0.3024539123840728, -0.2251172781719728, 0.16746800433815734, -0.07165129348153673, 0.09946319134905934, 0.11077496441992066, 0.03867408667799298, -0.05218941804138778, -0.26915186520853784, 0.33001913951470907, 0.05190329096589458, 0.34099117668116824, 0.04969855161509354, 0.15503576963033483, -0.053165986104112675, -0.010031328886326631, -0.052493550462889275, -0.02721195096200334, 0.18278104413184337, 0.31432965858835304, 0.17931034793671866, 0.29655915446423214, -0.45263367241836694, -0.24785139437677062, 0.11056077704058241, 0.1450768224067839, 0.11303120362731932, -0.03770276424863065, -0.32186814719860096, 0.09546383830673764, -0.1896272643240528, 0.007488696037366856, -0.1968124040817074, -0.033612650827292284, 0.022361839963674645, -0.27843383361846863, -0.004973763694962193, 0.09059649281583629, 0.06063856382899215, -0.03345147342617182, -0.12465367504812189, 0.02482017271962066, 0.14903951310266725, 0.008676369089363633, 0.061357484838625076, 0.10203708400908988, -0.20811894201834916, -0.14208380178688299, 0.3389994927780016, -0.07578098548759028, -0.21336321036837863, 0.24889757064796103, -0.022454873693947632, -0.20334727499070332, 0.08959536431888282, 0.2717362904774123, 0.1058469740796442, -0.1519779092632234, 0.03345426848248105, -0.04138552129938545, 0.17407892460183225, 0.016644292861313085, 0.027578045773368916, 0.18257366662861355, 0.21085882683390783, -0.029977774541884286, 0.12493231211964596, -0.11429626030005972, -0.07245302301619136, -0.19658146545356303, -0.06268919944704976, -0.1852672954136914, -0.01799169468965071, -0.12121037356375478, -0.13731664520705716, 0.4160594609239253, 0.23789649706394125, 0.23970459911026665, 0.1109823000233359, 0.3250998611839717, 0.02930430605345847, 0.1691200167983321, 0.09530133935786261, 0.17280319955655918, 0.029906903883736385, 0.10216988765904189, -0.12456630305652588, 0.08542162397663974, 0.05860836405445936]
|
1,803.05171
|
High fidelity field stop collection for polarization-entangled photon
pair sources
|
We present an experimental demonstration of a bright and high fidelity
polarization entangled photon pair source. The source is constructed using two
critically phase matched $\beta$-Barium Borate crystals with parallel optical
axes and photon pairs are collected after filtering with a circular field-stop.
Near unity fidelities are obtained with detected pair rates exceeding
\SI{100000}{pairs/\s/\mW} approaching the brightness of practical quasi-phase
matched entangled photon sources. We find that the brightness scales linearly
with the crystal length. We present models supporting the experimental data and
propose strategies for further improvement. The source design is a promising
candidate for emerging quantum applications outside of laboratory environments.
|
quant-ph
|
we present an experimental demonstration of a bright and high fidelity polarization entangled photon pair source the source is constructed using two critically phase matched betabarium borate crystals with parallel optical axes and photon pairs are collected after filtering with a circular fieldstop near unity fidelities are obtained with detected pair rates exceeding si100000pairssmw approaching the brightness of practical quasiphase matched entangled photon sources we find that the brightness scales linearly with the crystal length we present models supporting the experimental data and propose strategies for further improvement the source design is a promising candidate for emerging quantum applications outside of laboratory environments
|
[['we', 'present', 'an', 'experimental', 'demonstration', 'of', 'a', 'bright', 'and', 'high', 'fidelity', 'polarization', 'entangled', 'photon', 'pair', 'source', 'the', 'source', 'is', 'constructed', 'using', 'two', 'critically', 'phase', 'matched', 'betabarium', 'borate', 'crystals', 'with', 'parallel', 'optical', 'axes', 'and', 'photon', 'pairs', 'are', 'collected', 'after', 'filtering', 'with', 'a', 'circular', 'fieldstop', 'near', 'unity', 'fidelities', 'are', 'obtained', 'with', 'detected', 'pair', 'rates', 'exceeding', 'si100000pairssmw', 'approaching', 'the', 'brightness', 'of', 'practical', 'quasiphase', 'matched', 'entangled', 'photon', 'sources', 'we', 'find', 'that', 'the', 'brightness', 'scales', 'linearly', 'with', 'the', 'crystal', 'length', 'we', 'present', 'models', 'supporting', 'the', 'experimental', 'data', 'and', 'propose', 'strategies', 'for', 'further', 'improvement', 'the', 'source', 'design', 'is', 'a', 'promising', 'candidate', 'for', 'emerging', 'quantum', 'applications', 'outside', 'of', 'laboratory', 'environments']]
|
[-0.13151368758568138, 0.17503212866793938, -0.03362010900095543, -0.004237679906723583, -0.02099566472073396, -0.17512778022358486, 0.043696405350084545, 0.5013483939509765, -0.18798755673125533, -0.31418208225958927, 0.06013046257088289, -0.3369920471153569, -0.003976308302406003, 0.2679335147909382, 0.015779975609963432, 0.09092614087093548, 0.08517642767972075, -0.024959960915878706, -0.06788836328961029, -0.2092628368649029, 0.24101416810013937, 0.08593119408218555, 0.352638493355948, 0.01826958260590247, 0.15700393965052367, 0.0034708676896258897, -0.0043043310197033715, -0.04441668768413365, -0.09310377385347737, 0.08559021095325257, 0.2961062509651075, 0.08076672246862276, 0.17671572964857607, -0.3661514902304785, -0.16746371512429095, 0.06763861967399362, 0.12714967401424312, 0.1353166215715236, -0.13066990716455906, -0.2876567411094941, 0.05761219605725879, -0.13283551303560243, -0.15418926702227956, -0.019821193181069605, -0.014593769263763748, 0.010199580884849032, -0.2567870827944146, 0.0885288760490606, -0.02939122630392804, 0.05073797526340201, -0.011461202564247536, -0.08262326250391483, -0.007505484838403908, 0.047079266227014804, -0.05926914363825584, 0.04719044600029056, 0.15671576259602957, -0.12465174822365026, -0.18100045075840956, 0.33557581036881196, -0.051551914213490035, -0.10588609382930193, 0.1622418119690801, -0.1210948964170016, -0.07780693288819462, 0.1513050505617524, 0.14872256601765735, 0.1361888716380824, -0.10140290021024388, -0.04123360545125644, 0.00027092939069238946, 0.23280146542317964, 0.08864309899645913, 0.14470420767754025, 0.29107956029474735, 0.16038933605430464, -0.004124148803598741, 0.2094873460740143, -0.19597862990956536, -0.03431680359804601, -0.3130704087077403, -0.1105315741996153, -0.18121787216788268, 0.02679140833217888, -0.08210316612159801, -0.12065061146573748, 0.3558780624001634, 0.1332210702547694, 0.15956587985377102, 0.02068079435540473, 0.30019880015877826, 0.0961205341177536, 0.04825782748943597, 0.07005095538025831, 0.29060601853929896, 0.08537202425570428, 0.06695899555423096, -0.20569245424178684, 0.010180834219699689, -0.06220133971039425]
|
1,803.05172
|
Intermittent electron density and temperature fluctuations and
associated fluxes in the Alcator C-Mod scrape-off layer
|
The Alcator C-Mod mirror Langmuir probe system has been used to sample data
time series of fluctuating plasma parameters in the outboard mid-plane far
scrape-off layer. We present a statistical analysis of one second long time
series of electron density, temperature, radial electric drift velocity and the
corresponding particle and electron heat fluxes. These are sampled during
stationary plasma conditions in an ohmically heated, lower single null diverted
discharge.
The electron density and temperature are strongly correlated and feature
fluctuation statistics similar to the ion saturation current. Both electron
density and temperature time series are dominated by intermittent,
large-amplitude burst with an exponential distribution of both burst amplitudes
and waiting times between them.
The characteristic time scale of the large-amplitude bursts is approximately
15{\mu}s. Large-amplitude velocity fluctuations feature a slightly faster
characteristic time scale and appear at a faster rate than electron density and
temperature fluctuations.
Describing these time series as a superposition of uncorrelated exponential
pulses, we find that probability distribution functions, power spectral
densities as well as auto-correlation functions of the data time series agree
well with predictions from the stochastic model.
The electron particle and heat fluxes present large-amplitude fluctuations.
For this low-density plasma, the radial electron heat flux is dominated by
convection, that is, correlations of fluctuations in the electron density and
radial velocity. Hot and dense blobs contribute approximately 6% of the total
fluctuation driven heat flux.
|
physics.plasm-ph
|
the alcator cmod mirror langmuir probe system has been used to sample data time series of fluctuating plasma parameters in the outboard midplane far scrapeoff layer we present a statistical analysis of one second long time series of electron density temperature radial electric drift velocity and the corresponding particle and electron heat fluxes these are sampled during stationary plasma conditions in an ohmically heated lower single null diverted discharge the electron density and temperature are strongly correlated and feature fluctuation statistics similar to the ion saturation current both electron density and temperature time series are dominated by intermittent largeamplitude burst with an exponential distribution of both burst amplitudes and waiting times between them the characteristic time scale of the largeamplitude bursts is approximately 15mus largeamplitude velocity fluctuations feature a slightly faster characteristic time scale and appear at a faster rate than electron density and temperature fluctuations describing these time series as a superposition of uncorrelated exponential pulses we find that probability distribution functions power spectral densities as well as autocorrelation functions of the data time series agree well with predictions from the stochastic model the electron particle and heat fluxes present largeamplitude fluctuations for this lowdensity plasma the radial electron heat flux is dominated by convection that is correlations of fluctuations in the electron density and radial velocity hot and dense blobs contribute approximately 6 of the total fluctuation driven heat flux
|
[['the', 'alcator', 'cmod', 'mirror', 'langmuir', 'probe', 'system', 'has', 'been', 'used', 'to', 'sample', 'data', 'time', 'series', 'of', 'fluctuating', 'plasma', 'parameters', 'in', 'the', 'outboard', 'midplane', 'far', 'scrapeoff', 'layer', 'we', 'present', 'a', 'statistical', 'analysis', 'of', 'one', 'second', 'long', 'time', 'series', 'of', 'electron', 'density', 'temperature', 'radial', 'electric', 'drift', 'velocity', 'and', 'the', 'corresponding', 'particle', 'and', 'electron', 'heat', 'fluxes', 'these', 'are', 'sampled', 'during', 'stationary', 'plasma', 'conditions', 'in', 'an', 'ohmically', 'heated', 'lower', 'single', 'null', 'diverted', 'discharge', 'the', 'electron', 'density', 'and', 'temperature', 'are', 'strongly', 'correlated', 'and', 'feature', 'fluctuation', 'statistics', 'similar', 'to', 'the', 'ion', 'saturation', 'current', 'both', 'electron', 'density', 'and', 'temperature', 'time', 'series', 'are', 'dominated', 'by', 'intermittent', 'largeamplitude', 'burst', 'with', 'an', 'exponential', 'distribution', 'of', 'both', 'burst', 'amplitudes', 'and', 'waiting', 'times', 'between', 'them', 'the', 'characteristic', 'time', 'scale', 'of', 'the', 'largeamplitude', 'bursts', 'is', 'approximately', '15mus', 'largeamplitude', 'velocity', 'fluctuations', 'feature', 'a', 'slightly', 'faster', 'characteristic', 'time', 'scale', 'and', 'appear', 'at', 'a', 'faster', 'rate', 'than', 'electron', 'density', 'and', 'temperature', 'fluctuations', 'describing', 'these', 'time', 'series', 'as', 'a', 'superposition', 'of', 'uncorrelated', 'exponential', 'pulses', 'we', 'find', 'that', 'probability', 'distribution', 'functions', 'power', 'spectral', 'densities', 'as', 'well', 'as', 'autocorrelation', 'functions', 'of', 'the', 'data', 'time', 'series', 'agree', 'well', 'with', 'predictions', 'from', 'the', 'stochastic', 'model', 'the', 'electron', 'particle', 'and', 'heat', 'fluxes', 'present', 'largeamplitude', 'fluctuations', 'for', 'this', 'lowdensity', 'plasma', 'the', 'radial', 'electron', 'heat', 'flux', 'is', 'dominated', 'by', 'convection', 'that', 'is', 'correlations', 'of', 'fluctuations', 'in', 'the', 'electron', 'density', 'and', 'radial', 'velocity', 'hot', 'and', 'dense', 'blobs', 'contribute', 'approximately', '6', 'of', 'the', 'total', 'fluctuation', 'driven', 'heat', 'flux']]
|
[-0.12022617300079155, 0.24852664781002234, -0.08094068568256073, 0.09284088185111238, 0.029167772207513515, -0.09703516489464854, -0.008566430893301129, 0.3736160748582012, -0.24337355400323227, -0.3048376005889591, 0.0607458500594005, -0.29584507464265886, 0.01257846906885569, 0.20881584566889394, 0.03690015691220118, 0.08272924442406229, -0.0002851080082172271, -0.027659574888871406, -0.034517337849106766, -0.16000659042840887, 0.23572706579479613, 0.14568375347077783, 0.2986942927959247, 0.009983896888021765, 0.083551120717512, -0.059910478998690134, -0.048470338262067626, 0.024049602634100855, -0.11957805078857527, -0.005999500775942579, 0.19063207024612047, 0.012777471704135552, 0.22587659048590938, -0.5001225998133844, -0.2578204104452041, 0.0431063664386627, 0.15584139780385786, 0.06749287725964176, -0.02425710705725139, -0.21233357918641432, -0.03645825800174799, -0.13723516670569522, -0.15417496062783076, -0.026737627516107247, 0.07218085902999959, 0.11598590154859141, -0.27764256793106423, 0.23137569154666912, 0.03720792254572534, 0.05040561900700438, -0.06939384342143151, -0.08710348212856654, -0.06192777263891787, 0.04488820472334769, 0.09464737608856201, 0.06195968860993162, 0.2434635044292322, -0.10858273656400531, -0.017348140251324994, 0.2863679070455717, -0.13075911498595688, -0.08294440278831612, 0.18037434974845884, -0.24716236591258825, -0.07336144357947794, 0.24212193957144587, 0.16030451734871443, 0.08882559625560353, -0.15392738310941334, -0.01082030012937672, -0.010292005938465772, 0.17693431848434119, 0.10247385013920801, 0.030747155450156022, 0.2672089701811964, 0.13945431893105328, 0.04273562655274371, 0.08892449951668698, -0.19910186870289054, -0.061668906077854975, -0.28364917493108177, -0.09605130224773692, -0.18645965758859628, 0.05034506089778633, -0.0762214971105252, -0.17127101264837807, 0.43173622688407015, 0.10985984209476336, 0.1864569507808232, 0.03231912438460658, 0.2851001462409401, 0.18555481649046074, 0.008712959801978913, 0.17166713562086255, 0.17674221100028734, 0.17442813268983096, 0.16866455368440728, -0.27788850181379277, 0.05196428017257733, 0.025325002568244034]
|
1,803.05173
|
Constrained BRST-BFV and BRST-BV Lagrangians for half-integer HS fields
on $R^{1,d-1}$
|
Gauge invariant Lagrangian descriptions of irreducible and reducible
half-integer higher-spin mixed-symmetric massless and massive representations
of the Poincare group with off-shell algebraic constraints are constructed
within a metric-like formulation in a $d$-dimensional flat space-time on the
basis of a suggested constrained BRST approach. A Lorentz-invariant resolution
of the BRST complex within the constrained BRST formulations produces a
gauge-invariant Fang-Fronsdal Lagrangian entirely in terms of the initial
triple gamma-traceless spin-tensor field $\Psi_{(\mu)_{n}}$ with
gamma-traceless gauge parameter. The triplet and quartet formulations are
derived. The minimal (un)constrained BRST--BV actions for above formulations
are obtained, from proposed constrained BRST--BV approach to be by appropriate
tools to construct interacting constrained Lagrangians.
|
hep-th math-ph math.DS math.MP quant-ph
|
gauge invariant lagrangian descriptions of irreducible and reducible halfinteger higherspin mixedsymmetric massless and massive representations of the poincare group with offshell algebraic constraints are constructed within a metriclike formulation in a ddimensional flat spacetime on the basis of a suggested constrained brst approach a lorentzinvariant resolution of the brst complex within the constrained brst formulations produces a gaugeinvariant fangfronsdal lagrangian entirely in terms of the initial triple gammatraceless spintensor field psi_mu_n with gammatraceless gauge parameter the triplet and quartet formulations are derived the minimal unconstrained brstbv actions for above formulations are obtained from proposed constrained brstbv approach to be by appropriate tools to construct interacting constrained lagrangians
|
[['gauge', 'invariant', 'lagrangian', 'descriptions', 'of', 'irreducible', 'and', 'reducible', 'halfinteger', 'higherspin', 'mixedsymmetric', 'massless', 'and', 'massive', 'representations', 'of', 'the', 'poincare', 'group', 'with', 'offshell', 'algebraic', 'constraints', 'are', 'constructed', 'within', 'a', 'metriclike', 'formulation', 'in', 'a', 'ddimensional', 'flat', 'spacetime', 'on', 'the', 'basis', 'of', 'a', 'suggested', 'constrained', 'brst', 'approach', 'a', 'lorentzinvariant', 'resolution', 'of', 'the', 'brst', 'complex', 'within', 'the', 'constrained', 'brst', 'formulations', 'produces', 'a', 'gaugeinvariant', 'fangfronsdal', 'lagrangian', 'entirely', 'in', 'terms', 'of', 'the', 'initial', 'triple', 'gammatraceless', 'spintensor', 'field', 'psi_mu_n', 'with', 'gammatraceless', 'gauge', 'parameter', 'the', 'triplet', 'and', 'quartet', 'formulations', 'are', 'derived', 'the', 'minimal', 'unconstrained', 'brstbv', 'actions', 'for', 'above', 'formulations', 'are', 'obtained', 'from', 'proposed', 'constrained', 'brstbv', 'approach', 'to', 'be', 'by', 'appropriate', 'tools', 'to', 'construct', 'interacting', 'constrained', 'lagrangians']]
|
[-0.15610478952349652, 0.1862950815065276, -0.08750656150458824, 0.10950645979139068, -0.12761360602896837, -0.1628871105478278, -0.056036489616547315, 0.31885203934230266, -0.1906788488051721, -0.29340530873741955, 0.034980184897514324, -0.17564088730585006, -0.14532170046032183, 0.06521057180749873, -0.06763941625665341, 0.039594181050502116, 0.019323691399767993, 0.06984593139523418, -0.17714122908544683, -0.25083322658070495, 0.3432615282900986, -0.03391269633901261, 0.2078527943719001, -0.02992904820878591, 0.2173704650607847, 0.061792237391429285, -0.05138392406737521, 0.02826277987942809, -0.08301457836337033, 0.16352466772354785, 0.27210804546872774, 0.07945977831702856, 0.10687891237570771, -0.38232805067229836, -0.20368282388163997, 0.06384217033517503, 0.146416532505481, 0.1062370731761413, 0.022160086872810056, -0.3613880608363875, 0.033825880333426456, -0.168496808675783, -0.18067677366724683, -0.13604839248139233, -0.03994143107085533, -0.12540270506537388, -0.27360118539737804, 0.08919956900312433, -0.02497023760917641, 0.07282424720802477, -0.13891746156316784, -0.1170434405461752, -0.11702947311014647, -0.029419452976435424, 0.05558227278913061, 0.0661878687373939, 0.14865072393523796, -0.14452043125361558, -0.14702510069612237, 0.41144579128761377, -0.05796687724955735, -0.34712473629485996, 0.140931417861776, -0.04242062313216073, -0.21771628418937325, 0.14281761869899043, 0.07914110294853648, 0.20665680791827895, -0.20871115365021287, 0.2649504002787927, -0.06599331723437422, 0.045942072830872524, 0.06292115626413197, 0.055501044277722636, 0.22839237561538106, 0.04804909911361479, 0.042976829099158446, 0.06932178493478292, 0.07723324251627284, -0.17936998505985166, -0.41922407650521826, -0.09966605806368448, -0.11536932857485399, 0.06379446813038417, -0.09996402398308939, -0.13867785743482056, 0.374403964355588, 0.0976613420934882, 0.10166345100317682, 0.11046079560182989, 0.23636406666288773, 0.14515826821859393, 0.11990616786338035, 0.03769205829926899, 0.2107769516562777, 0.22413441146990018, -0.00840521971695125, -0.2299926730432725, -0.16342023831481736, 0.21329084764279072]
|
1,803.05174
|
Multi-objective Analysis of MAP-Elites Performance
|
In certain complex optimization tasks, it becomes necessary to use multiple
measures to characterize the performance of different algorithms. This paper
presents a method that combines ordinal effect sizes with Pareto dominance to
analyze such cases. Since the method is ordinal, it can also generalize across
different optimization tasks even when the performance measurements are
differently scaled. Through a case study, we show that this method can discover
and quantify relations that would be difficult to deduce using a conventional
measure-by-measure analysis. This case study applies the method to the
evolution of robot controller repertoires using the MAP-Elites algorithm. Here,
we analyze the search performance across a large set of parametrizations;
varying mutation size and operator type, as well as map resolution, across four
different robot morphologies. We show that the average magnitude of mutations
has a bigger effect on outcomes than their precise distributions.
|
cs.NE
|
in certain complex optimization tasks it becomes necessary to use multiple measures to characterize the performance of different algorithms this paper presents a method that combines ordinal effect sizes with pareto dominance to analyze such cases since the method is ordinal it can also generalize across different optimization tasks even when the performance measurements are differently scaled through a case study we show that this method can discover and quantify relations that would be difficult to deduce using a conventional measurebymeasure analysis this case study applies the method to the evolution of robot controller repertoires using the mapelites algorithm here we analyze the search performance across a large set of parametrizations varying mutation size and operator type as well as map resolution across four different robot morphologies we show that the average magnitude of mutations has a bigger effect on outcomes than their precise distributions
|
[['in', 'certain', 'complex', 'optimization', 'tasks', 'it', 'becomes', 'necessary', 'to', 'use', 'multiple', 'measures', 'to', 'characterize', 'the', 'performance', 'of', 'different', 'algorithms', 'this', 'paper', 'presents', 'a', 'method', 'that', 'combines', 'ordinal', 'effect', 'sizes', 'with', 'pareto', 'dominance', 'to', 'analyze', 'such', 'cases', 'since', 'the', 'method', 'is', 'ordinal', 'it', 'can', 'also', 'generalize', 'across', 'different', 'optimization', 'tasks', 'even', 'when', 'the', 'performance', 'measurements', 'are', 'differently', 'scaled', 'through', 'a', 'case', 'study', 'we', 'show', 'that', 'this', 'method', 'can', 'discover', 'and', 'quantify', 'relations', 'that', 'would', 'be', 'difficult', 'to', 'deduce', 'using', 'a', 'conventional', 'measurebymeasure', 'analysis', 'this', 'case', 'study', 'applies', 'the', 'method', 'to', 'the', 'evolution', 'of', 'robot', 'controller', 'repertoires', 'using', 'the', 'mapelites', 'algorithm', 'here', 'we', 'analyze', 'the', 'search', 'performance', 'across', 'a', 'large', 'set', 'of', 'parametrizations', 'varying', 'mutation', 'size', 'and', 'operator', 'type', 'as', 'well', 'as', 'map', 'resolution', 'across', 'four', 'different', 'robot', 'morphologies', 'we', 'show', 'that', 'the', 'average', 'magnitude', 'of', 'mutations', 'has', 'a', 'bigger', 'effect', 'on', 'outcomes', 'than', 'their', 'precise', 'distributions']]
|
[-0.06871008178026512, 0.05724346209558305, -0.11592690788594813, 0.10389536243927633, -0.08488557950176041, -0.14505902149489727, 0.048037690260640246, 0.4298213555895049, -0.2769418837052995, -0.3384309083737176, 0.07638741965036325, -0.23041755795992655, -0.20507894194331663, 0.2242242149414559, -0.09813126926792079, 0.02029892510317009, 0.09881518700898721, 0.010640562524826362, -0.08435168533650195, -0.2560140933456092, 0.30976488994081214, 0.007570150085114713, 0.30864901147654344, 0.013259741880706158, 0.1004690889012197, 0.00210556389185889, -0.020119103638391044, 0.06942608624239852, -0.11865257424370643, 0.08540535152504414, 0.2546264851576215, 0.17495501336545266, 0.2999916678326654, -0.3455369304608682, -0.18457785590937167, 0.14844007503626674, 0.1535063010897359, 0.10520844796415547, 0.022106131575479783, -0.24240152680250848, 0.11679103992847276, -0.16140569606795907, -0.09087037473178372, -0.12476219373177094, -0.009608513495788493, 0.031316905764156376, -0.2978738359079279, 0.03141225874564482, 0.009854126777018196, 0.05509134728204587, -0.05842557441892809, -0.10963024752985301, 0.03283378946883925, 0.16056011543259957, 0.04758381132389708, -0.01144365542889412, 0.15704730924796956, -0.09253825062950109, -0.1458333758637309, 0.36400347627570917, -0.03334831041334085, -0.23275502143218985, 0.23844442868541027, -0.14343562161485696, -0.13570372772258546, 0.09143812048473748, 0.22179880227877533, 0.1531023023071988, -0.14543302288361232, 0.020190113319629995, -0.04323068717815753, 0.1706331165459264, 0.06344790719128375, 0.005341885354498337, 0.1289591448590288, 0.20521111519332846, 0.09976928339676995, 0.18958185130714214, -0.08943563705502913, -0.09106584524029288, -0.22567156635843025, -0.12723533691645697, -0.1345844363584986, 0.015957995328313573, -0.10458767265703625, -0.14629165235393007, 0.3834243291041589, 0.21212349331431926, 0.2024676732935718, 0.10698626480518904, 0.330951621126512, 0.07740792962571943, 0.09073827457935389, 0.04131129671466248, 0.17950253129679838, 0.05531685704301143, 0.08721850235978591, -0.22442340389343685, 0.10568738864927456, 0.02354655200936671]
|
1,803.05175
|
The dynamics of thin gas layer moving between two fluids
|
The dynamics and stability of a thin gas layer moving between two fluid
layers moving in the same or opposite direction is studied. The linear
evolutionary equations describing the spatial-temporal dynamics of the
interface perturbations between gas and two fluid layers are derived for the
flat two-dimensional case. Integral correlations across the layer are obtained,
and the various kinds of time dependent base states are found. A linear
stability is considered for the system using non-stationary equation array
derived. The equation array consists of the two one-dimensional non-stationary
equations of a seventh and fourth order. The results of the numerical study of
the governing evolution equations support the results of the analysis for more
simple limit cases. It is found that the thin sheet gas flow in-between two
liquid layers is unstable and the peculiarities are found and discussed
together with some applications available.
|
physics.flu-dyn
|
the dynamics and stability of a thin gas layer moving between two fluid layers moving in the same or opposite direction is studied the linear evolutionary equations describing the spatialtemporal dynamics of the interface perturbations between gas and two fluid layers are derived for the flat twodimensional case integral correlations across the layer are obtained and the various kinds of time dependent base states are found a linear stability is considered for the system using nonstationary equation array derived the equation array consists of the two onedimensional nonstationary equations of a seventh and fourth order the results of the numerical study of the governing evolution equations support the results of the analysis for more simple limit cases it is found that the thin sheet gas flow inbetween two liquid layers is unstable and the peculiarities are found and discussed together with some applications available
|
[['the', 'dynamics', 'and', 'stability', 'of', 'a', 'thin', 'gas', 'layer', 'moving', 'between', 'two', 'fluid', 'layers', 'moving', 'in', 'the', 'same', 'or', 'opposite', 'direction', 'is', 'studied', 'the', 'linear', 'evolutionary', 'equations', 'describing', 'the', 'spatialtemporal', 'dynamics', 'of', 'the', 'interface', 'perturbations', 'between', 'gas', 'and', 'two', 'fluid', 'layers', 'are', 'derived', 'for', 'the', 'flat', 'twodimensional', 'case', 'integral', 'correlations', 'across', 'the', 'layer', 'are', 'obtained', 'and', 'the', 'various', 'kinds', 'of', 'time', 'dependent', 'base', 'states', 'are', 'found', 'a', 'linear', 'stability', 'is', 'considered', 'for', 'the', 'system', 'using', 'nonstationary', 'equation', 'array', 'derived', 'the', 'equation', 'array', 'consists', 'of', 'the', 'two', 'onedimensional', 'nonstationary', 'equations', 'of', 'a', 'seventh', 'and', 'fourth', 'order', 'the', 'results', 'of', 'the', 'numerical', 'study', 'of', 'the', 'governing', 'evolution', 'equations', 'support', 'the', 'results', 'of', 'the', 'analysis', 'for', 'more', 'simple', 'limit', 'cases', 'it', 'is', 'found', 'that', 'the', 'thin', 'sheet', 'gas', 'flow', 'inbetween', 'two', 'liquid', 'layers', 'is', 'unstable', 'and', 'the', 'peculiarities', 'are', 'found', 'and', 'discussed', 'together', 'with', 'some', 'applications', 'available']]
|
[-0.18426119888358194, 0.11258735434643717, -0.04983942264354684, 0.027967193768644292, -0.010992264582051171, -0.1252565537223644, -0.05234504002025157, 0.33269060919216525, -0.29131516108302297, -0.2680030484423494, 0.1255196879169994, -0.293051952308613, -0.1200695566836253, 0.1876702271256363, 0.06574113304506884, 0.05503008424097465, 0.04384538472044773, -0.014144536287252171, -0.07883527329896525, -0.20880839511018065, 0.3370358718934262, -0.0019716962318246565, 0.30517598249975386, -0.024682776219884142, 0.11421379625486831, -0.044090685888982586, -0.04541610213022472, 0.0501789140779465, -0.13360631348713367, 0.08659982134243667, 0.21321260539631717, -0.021565541236971814, 0.22478918116151667, -0.4825832514713208, -0.24240596063383338, -0.014261078616578339, 0.1296619231434306, 0.10247874711381479, -0.05014715804352616, -0.26438124164997134, 0.05053390676686023, -0.13354677223833278, -0.17007139106539804, -0.018302684035410896, 0.02475361717612638, 0.07622530825655202, -0.2404219527161331, 0.09350456942532522, 0.07918656595736845, 0.019912249916968803, -0.1306566373225198, -0.10511942442179942, -0.0857467721774204, 0.14152416259740777, 0.0466630332440319, -0.04156812611715092, 0.11825540773376512, -0.13719508143387632, -0.03832970364277975, 0.38153220595429754, -0.08540568403582761, -0.2247713002660829, 0.2423520172758597, -0.14230588612715817, -0.0628602138086636, 0.12381456547073968, 0.15349643293302506, 0.12138801347787699, -0.16987302947867042, 0.056854307810782406, -0.058779493671964805, 0.15793788246628537, 0.07737444981790355, -0.017552529568395887, 0.21426386133922884, 0.1868660729119761, 0.026056586702503007, 0.15869731272444673, -0.10043798755052397, -0.1713606167435905, -0.30199108893672627, -0.15843071703501563, -0.1281415352940611, -0.02430062245225094, -0.10148547737905271, -0.17411639549795332, 0.3835156630246072, 0.0859084971404324, 0.16857518897288376, -0.0011408710579416947, 0.27702974083109033, 0.14398320164117548, 0.001078971153927139, 0.09745135049322723, 0.2451220873604648, 0.18605443271290925, 0.12809383692789802, -0.21904078824283918, 0.06105565344720768, 0.07155746185809322]
|
1,803.05176
|
Localization due to topological stochastic disorder in active networks
|
An active network is a prototype model in non-equilibrium statistical
mechanics. It can represent, for example, a system with particles that have a
self-propulsion mechanism. Each node of the network specifies a possible
location of a particle, and its orientation. The orientation (which is formally
like a spin degree of freedom) determines the self-propulsion direction. The
bonds represent the possibility to make transitions: to hop between locations;
or to switch the orientation. In systems of experimental interest (Janus
particles), the self-propulsion is induced by illumination. An emergent aspect
is the topological stochastic disorder (TSD). It is implied by the
non-uniformity of the illumination. In technical terms the TSD reflects the
local non-zero circulations (affinities) of the stochastic transitions. This
type of disorder, unlike non-homogeneous magnetic field, is non-hermitian, and
can lead to the emergence of a complex relaxation spectrum. It is therefore
dramatically distinct from the conservative Anderson-type or Sinai-type
disorder. We discuss the consequences of having TSD. In particular we
illuminate 3~different routes to under-damped relaxation, and show that
localization plays a major role in the analysis. Implications of the bulk-edge
correspondence principle are addressed too.
|
cond-mat.stat-mech cond-mat.dis-nn cond-mat.soft quant-ph
|
an active network is a prototype model in nonequilibrium statistical mechanics it can represent for example a system with particles that have a selfpropulsion mechanism each node of the network specifies a possible location of a particle and its orientation the orientation which is formally like a spin degree of freedom determines the selfpropulsion direction the bonds represent the possibility to make transitions to hop between locations or to switch the orientation in systems of experimental interest janus particles the selfpropulsion is induced by illumination an emergent aspect is the topological stochastic disorder tsd it is implied by the nonuniformity of the illumination in technical terms the tsd reflects the local nonzero circulations affinities of the stochastic transitions this type of disorder unlike nonhomogeneous magnetic field is nonhermitian and can lead to the emergence of a complex relaxation spectrum it is therefore dramatically distinct from the conservative andersontype or sinaitype disorder we discuss the consequences of having tsd in particular we illuminate 3different routes to underdamped relaxation and show that localization plays a major role in the analysis implications of the bulkedge correspondence principle are addressed too
|
[['an', 'active', 'network', 'is', 'a', 'prototype', 'model', 'in', 'nonequilibrium', 'statistical', 'mechanics', 'it', 'can', 'represent', 'for', 'example', 'a', 'system', 'with', 'particles', 'that', 'have', 'a', 'selfpropulsion', 'mechanism', 'each', 'node', 'of', 'the', 'network', 'specifies', 'a', 'possible', 'location', 'of', 'a', 'particle', 'and', 'its', 'orientation', 'the', 'orientation', 'which', 'is', 'formally', 'like', 'a', 'spin', 'degree', 'of', 'freedom', 'determines', 'the', 'selfpropulsion', 'direction', 'the', 'bonds', 'represent', 'the', 'possibility', 'to', 'make', 'transitions', 'to', 'hop', 'between', 'locations', 'or', 'to', 'switch', 'the', 'orientation', 'in', 'systems', 'of', 'experimental', 'interest', 'janus', 'particles', 'the', 'selfpropulsion', 'is', 'induced', 'by', 'illumination', 'an', 'emergent', 'aspect', 'is', 'the', 'topological', 'stochastic', 'disorder', 'tsd', 'it', 'is', 'implied', 'by', 'the', 'nonuniformity', 'of', 'the', 'illumination', 'in', 'technical', 'terms', 'the', 'tsd', 'reflects', 'the', 'local', 'nonzero', 'circulations', 'affinities', 'of', 'the', 'stochastic', 'transitions', 'this', 'type', 'of', 'disorder', 'unlike', 'nonhomogeneous', 'magnetic', 'field', 'is', 'nonhermitian', 'and', 'can', 'lead', 'to', 'the', 'emergence', 'of', 'a', 'complex', 'relaxation', 'spectrum', 'it', 'is', 'therefore', 'dramatically', 'distinct', 'from', 'the', 'conservative', 'andersontype', 'or', 'sinaitype', 'disorder', 'we', 'discuss', 'the', 'consequences', 'of', 'having', 'tsd', 'in', 'particular', 'we', 'illuminate', '3different', 'routes', 'to', 'underdamped', 'relaxation', 'and', 'show', 'that', 'localization', 'plays', 'a', 'major', 'role', 'in', 'the', 'analysis', 'implications', 'of', 'the', 'bulkedge', 'correspondence', 'principle', 'are', 'addressed', 'too']]
|
[-0.18768860840223608, 0.17193498357930798, -0.0823178406872396, 0.048655134759673105, -0.047607523339089526, -0.145566089962539, 0.021785931309975522, 0.3702130898562891, -0.287103925971815, -0.28580611565160335, 0.04057765950796805, -0.2497277186616444, -0.18657628408012292, 0.11940492966440155, -0.051242784902413366, -0.008361754703938821, 0.007741939668263239, 0.02544067413558663, -0.016974394213360038, -0.15717793926903328, 0.2754191844373621, 0.04923110632526298, 0.2916078889224258, 0.07793726329863827, 0.09771260427391176, 0.015959508253902358, 0.03722855322418474, 0.029803213058790613, -0.09756417701971248, 0.09781048321590749, 0.1937451584512488, 0.05525257091804017, 0.2386761026266682, -0.4245937867590817, -0.2265003510019792, 0.10130448285139777, 0.134489350890558, 0.15160343756896735, -0.04135088273386661, -0.2719091579107748, 0.03215267389552087, -0.15138699422956267, -0.16871741469649057, -0.04806997499338562, 0.04563488915339813, 0.031318808918298094, -0.24520401597668928, 0.0757082992143208, 0.09905156113022077, 0.056860303110693414, -0.058137977964580256, -0.04539714569240929, -0.051576620407192214, 0.13975110253249046, 0.08192165532983059, 0.018500751485266993, 0.1848337208158687, -0.1513471640809189, -0.12659414165142563, 0.4058024486707103, -0.0016025444251730517, -0.22316804469277662, 0.20487780025058616, -0.12464958880226859, -0.12661231554273555, 0.1382497140677065, 0.14833550127310757, 0.08444707554399526, -0.13080041203647852, 0.06321603004721754, -0.020093126092306388, 0.15242526954620755, 0.046786629846626245, 0.04579991362087669, 0.2636626487227297, 0.19907733191040053, 0.09713384332335605, 0.15480097685690208, -0.10691513420052585, -0.13714434630368957, -0.27184920417775793, -0.16226700679599357, -0.20449617247457705, 0.0428666494873112, -0.09937895805130885, -0.15351380596453104, 0.4293516000171983, 0.16011488196935744, 0.19316585638898198, -0.008255645952573026, 0.23809135844430296, 0.12105619455988129, 0.04838302503440089, 0.01701423869423208, 0.2549034091030618, 0.13401901510842043, 0.09447529923010578, -0.26605825554153895, 0.1200636203916523, 0.0460155567865298]
|
1,803.05177
|
Electrical conductivity of carbon nanofiber reinforced resins:
potentiality of Tunneling Atomic Force Microscopy (TUNA) technique
|
Epoxy nanocomposites able to meet pressing industrial requirements in the
field of structural material have been developed and characterized. Tunneling
Atomic Force Microscopy (TUNA), which is able to detect ultra-low currents
ranging from 80 fA to 120 pA, was used to correlate the local topography with
electrical properties of tetraglycidyl methylene dianiline (TGMDA) epoxy
nanocomposites at low concentration of carbon nanofibers (CNFs) ranging from
0.05% up to 2% by wt. The results show the unique capability of TUNA technique
in identifying conductive pathways in CNF/resins even without modifying the
morphology with usual treatments employed to create electrical contacts to the
ground.
|
physics.app-ph cond-mat.mtrl-sci
|
epoxy nanocomposites able to meet pressing industrial requirements in the field of structural material have been developed and characterized tunneling atomic force microscopy tuna which is able to detect ultralow currents ranging from 80 fa to 120 pa was used to correlate the local topography with electrical properties of tetraglycidyl methylene dianiline tgmda epoxy nanocomposites at low concentration of carbon nanofibers cnfs ranging from 005 up to 2 by wt the results show the unique capability of tuna technique in identifying conductive pathways in cnfresins even without modifying the morphology with usual treatments employed to create electrical contacts to the ground
|
[['epoxy', 'nanocomposites', 'able', 'to', 'meet', 'pressing', 'industrial', 'requirements', 'in', 'the', 'field', 'of', 'structural', 'material', 'have', 'been', 'developed', 'and', 'characterized', 'tunneling', 'atomic', 'force', 'microscopy', 'tuna', 'which', 'is', 'able', 'to', 'detect', 'ultralow', 'currents', 'ranging', 'from', '80', 'fa', 'to', '120', 'pa', 'was', 'used', 'to', 'correlate', 'the', 'local', 'topography', 'with', 'electrical', 'properties', 'of', 'tetraglycidyl', 'methylene', 'dianiline', 'tgmda', 'epoxy', 'nanocomposites', 'at', 'low', 'concentration', 'of', 'carbon', 'nanofibers', 'cnfs', 'ranging', 'from', '005', 'up', 'to', '2', 'by', 'wt', 'the', 'results', 'show', 'the', 'unique', 'capability', 'of', 'tuna', 'technique', 'in', 'identifying', 'conductive', 'pathways', 'in', 'cnfresins', 'even', 'without', 'modifying', 'the', 'morphology', 'with', 'usual', 'treatments', 'employed', 'to', 'create', 'electrical', 'contacts', 'to', 'the', 'ground']]
|
[-0.02263278226858994, 0.16236339465801403, -0.038287971615215244, -0.046440266383591, -0.0067554228583869246, -0.1921613197485657, 0.06354454061743736, 0.43618167388569756, -0.2690426217651321, -0.3773419468365994, 0.040924332827718485, -0.3161145734898362, -0.10040047602516781, 0.1825481187744239, -0.033013056963682175, 0.0751458821282962, -0.03331414545128919, -0.056733709584787184, -0.01260783005693025, -0.2037442793731203, 0.18495590906090958, 0.05860214973031783, 0.34765918648888156, 0.09753493432282019, 0.08726973027307733, -0.03978970331276681, 0.03064719324489844, 0.029923760418578523, -0.15264035159837186, 0.13011240717215636, 0.2836442274094281, -0.02066723481252713, 0.18501230906311078, -0.5133117440255052, -0.2103358276341994, 0.03466843969438264, 0.09103039034747894, 0.05717045508598736, -0.06255026235360384, -0.24345027471498884, 0.1642008472675669, -0.11415268520622984, -0.15072143318361997, -0.07201313934188106, -0.023438198905985457, 0.050405561410313104, -0.22304791329697388, 0.062320326080488174, -0.007389800582253902, 0.10656531376538549, -0.0867902442390464, -0.12310664911187955, -0.054778513253772074, 0.13524728769570896, 0.008834682633024976, 0.031147472505198465, 0.2785738137281817, -0.14519138076371446, -0.06250959875292539, 0.38760130025311995, -0.04354593936910795, -0.07844930835371716, 0.2517760950764737, -0.12853883124513493, -0.06337783272983026, 0.22038689212028667, 0.12243152261332407, 0.06659285562861826, -0.22783042589375346, -0.007435854474267413, 0.08412327999537139, 0.20836128927911296, 0.15058384305730307, 0.00018515574179359318, 0.18126773122294815, 0.17771383134897836, 0.009261866904238296, 0.15015316680889845, -0.122579790915833, 0.03559761254366526, -0.11033435781533138, -0.18994106000923006, -0.13923648920764706, 0.08415749448966042, -0.03709039632119982, -0.15518899721851975, 0.35713744921052887, 0.13675328539012327, 0.14108344280765844, -0.036732898649433146, 0.25590051775534167, -0.02127493663748592, 0.15631978651604703, -0.04225883351701321, 0.23657469286285726, 0.20951101284464532, 0.1443686850234559, -0.22009620055095436, 0.11694819843828601, -0.04262079242628893]
|
1,803.05178
|
Shape resonances of Be$^-$ and Mg$^-$ investigated with method of
analytic continuation
|
The regularized method of analytic continuation is used to study the
low-energy negative ion states of beryllium (configuration 2$s^2\varepsilon p\;
^2P$) and magnesium (configuration 3$s^2\varepsilon p\; ^2P$) atoms. The method
applies an additional perturbation potential and it requires only routine
bound-state multi-electron quantum calculations. Such computations are
accessible by most of the free or commercial quantum chemistry software
available for atoms and molecules. The perturbation potential is implemented as
a spherical Gaussian function with a fixed width. Stability of the analytic
continuation technique with respect to the width and with respect to the input
range of electron affinities is studied in detail. The computed resonance
parameters $E_r$=0.282 eV, $\Gamma$=0.316 eV for the $2p$ state of Be$^-$ and
$E_r$=0.188 eV, $\Gamma$=0.167 for the $3p$ state of Mg$^-$, agree well with
the best results obtained by much more elaborated and computationally demanding
present-day methods.
|
physics.chem-ph
|
the regularized method of analytic continuation is used to study the lowenergy negative ion states of beryllium configuration 2s2varepsilon p 2p and magnesium configuration 3s2varepsilon p 2p atoms the method applies an additional perturbation potential and it requires only routine boundstate multielectron quantum calculations such computations are accessible by most of the free or commercial quantum chemistry software available for atoms and molecules the perturbation potential is implemented as a spherical gaussian function with a fixed width stability of the analytic continuation technique with respect to the width and with respect to the input range of electron affinities is studied in detail the computed resonance parameters e_r0282 ev gamma0316 ev for the 2p state of be and e_r0188 ev gamma0167 for the 3p state of mg agree well with the best results obtained by much more elaborated and computationally demanding presentday methods
|
[['the', 'regularized', 'method', 'of', 'analytic', 'continuation', 'is', 'used', 'to', 'study', 'the', 'lowenergy', 'negative', 'ion', 'states', 'of', 'beryllium', 'configuration', '2s2varepsilon', 'p', '2p', 'and', 'magnesium', 'configuration', '3s2varepsilon', 'p', '2p', 'atoms', 'the', 'method', 'applies', 'an', 'additional', 'perturbation', 'potential', 'and', 'it', 'requires', 'only', 'routine', 'boundstate', 'multielectron', 'quantum', 'calculations', 'such', 'computations', 'are', 'accessible', 'by', 'most', 'of', 'the', 'free', 'or', 'commercial', 'quantum', 'chemistry', 'software', 'available', 'for', 'atoms', 'and', 'molecules', 'the', 'perturbation', 'potential', 'is', 'implemented', 'as', 'a', 'spherical', 'gaussian', 'function', 'with', 'a', 'fixed', 'width', 'stability', 'of', 'the', 'analytic', 'continuation', 'technique', 'with', 'respect', 'to', 'the', 'width', 'and', 'with', 'respect', 'to', 'the', 'input', 'range', 'of', 'electron', 'affinities', 'is', 'studied', 'in', 'detail', 'the', 'computed', 'resonance', 'parameters', 'e_r0282', 'ev', 'gamma0316', 'ev', 'for', 'the', '2p', 'state', 'of', 'be', 'and', 'e_r0188', 'ev', 'gamma0167', 'for', 'the', '3p', 'state', 'of', 'mg', 'agree', 'well', 'with', 'the', 'best', 'results', 'obtained', 'by', 'much', 'more', 'elaborated', 'and', 'computationally', 'demanding', 'presentday', 'methods']]
|
[-0.04251020007016931, 0.11711024627980163, -0.011025685498573105, 0.0866264662327012, 0.02210089673719588, -0.174619544598767, 0.03972098714781597, 0.4037705607547918, -0.20962924966999494, -0.32897319374623135, 0.012738593733314808, -0.28789848985958516, -0.052106363859767205, 0.19270320197307123, 0.04901154800138423, 0.11865537075808628, 0.09902011659955058, 0.02851566986475304, -0.06959112664202728, -0.18590520284830264, 0.2856802655459272, 0.09249574457113768, 0.21955100770163186, 0.07656508056029185, -0.003172079388819197, 0.009982756198630394, 0.04229097372701611, -0.020951725186451393, -0.14986660899461746, 0.1519733493996147, 0.25854053493137197, 0.08162670518162057, 0.24386476391159437, -0.4305630220127675, -0.20067052125095336, 0.03184539984281668, 0.12855200090116875, 0.12615314266397892, -0.04257731808587885, -0.2901853563757065, 0.07074240007889732, -0.1578652038160191, -0.18455236450330736, -0.11501160492052269, 0.006701318396474509, 0.0072435316859114475, -0.28717999296564173, 0.052263657608658406, -0.014008955491590314, 0.06087235794936586, -0.09819599631180823, -0.17643058457350194, -0.04964906995712012, 0.0827184457979028, 0.008807922668893298, 0.050441390888676434, 0.15843556272139883, -0.07753038685426444, -0.08856690132661778, 0.4241584973026286, -0.07053503331810455, -0.16604237655444784, 0.16770062911639208, -0.1262897001579404, -0.062010433247504645, 0.17888095925616868, 0.07294399793917204, 0.159970633658197, -0.08879179635550827, 0.13870727271611993, 0.024916299608508673, 0.20381724865399733, 0.08158851181745858, 0.02259935476981542, 0.12248437857145772, 0.11791992689797874, 0.06294664325576056, 0.0859370535978515, -0.08667536779060303, -0.0951836828060229, -0.2691106597947724, -0.153404274078853, -0.2119907192125752, 0.02877981250811204, -0.04088748671283076, -0.18257026162053294, 0.3815963919931913, 0.07268368721227436, 0.17010968302458743, -0.039259691489860415, 0.302141758169883, 0.14697956958672662, 0.03889253948856255, 0.012565017756595112, 0.2300452904173118, 0.1774192437694771, 0.05463940061984912, -0.2566111850867267, 0.043259496917016804, 0.04075459945563446]
|
1,803.05179
|
Transmission Spectroscopy with the ACE-FTS Infrared Spectral Atlas of
Earth: A Model Validation and Feasibility Study
|
Infrared solar occultation measurements are well established for remote
sensing of Earth's atmosphere, and the corresponding primary transit
spectroscopy has turned out to be valuable for characterization of extrasolar
planets. Our objective is an assessment of the detectability of molecular
signatures in Earth's transit spectra.
To this end, we take a limb sequence of representative cloud-free
transmission spectra recorded by the space-borne ACE-FTS Earth observation
mission (Hughes et al., ACE infrared spectral atlases of the Earth's
atmosphere, JQSRT 2014) and combine these spectra to the effective height of
the atmosphere. These data are compared to spectra modeled with an atmospheric
radiative transfer line-by-line infrared code to study the impact of individual
molecules, spectral resolution, the choice of auxiliary data, and numerical
approximations. Moreover, the study serves as a validation of our infrared
radiative transfer code.
The largest impact is due to water, carbon dioxide, ozone, methane, nitrous
oxide, nitrogen, nitric acid, oxygen, and some chlorofluorocarbons (CFC11 and
CFC12). The effect of further molecules considered in the modeling is either
marginal or absent. The best matching model has a mean residuum of 0.4 km and a
maximum difference of 2 km to the measured effective height. For a quantitative
estimate of visibility and detectability we consider the maximum change of the
residual spectrum, the relative change of the residual norm, the additional
transit depth, and signal-to-noise ratios for a JWST setup. In conclusion, our
study provides a list of molecules that are relevant for modeling transmission
spectra of Earth-like exoplanets and discusses the feasibility of retrieval.
|
astro-ph.EP
|
infrared solar occultation measurements are well established for remote sensing of earths atmosphere and the corresponding primary transit spectroscopy has turned out to be valuable for characterization of extrasolar planets our objective is an assessment of the detectability of molecular signatures in earths transit spectra to this end we take a limb sequence of representative cloudfree transmission spectra recorded by the spaceborne acefts earth observation mission hughes et al ace infrared spectral atlases of the earths atmosphere jqsrt 2014 and combine these spectra to the effective height of the atmosphere these data are compared to spectra modeled with an atmospheric radiative transfer linebyline infrared code to study the impact of individual molecules spectral resolution the choice of auxiliary data and numerical approximations moreover the study serves as a validation of our infrared radiative transfer code the largest impact is due to water carbon dioxide ozone methane nitrous oxide nitrogen nitric acid oxygen and some chlorofluorocarbons cfc11 and cfc12 the effect of further molecules considered in the modeling is either marginal or absent the best matching model has a mean residuum of 04 km and a maximum difference of 2 km to the measured effective height for a quantitative estimate of visibility and detectability we consider the maximum change of the residual spectrum the relative change of the residual norm the additional transit depth and signaltonoise ratios for a jwst setup in conclusion our study provides a list of molecules that are relevant for modeling transmission spectra of earthlike exoplanets and discusses the feasibility of retrieval
|
[['infrared', 'solar', 'occultation', 'measurements', 'are', 'well', 'established', 'for', 'remote', 'sensing', 'of', 'earths', 'atmosphere', 'and', 'the', 'corresponding', 'primary', 'transit', 'spectroscopy', 'has', 'turned', 'out', 'to', 'be', 'valuable', 'for', 'characterization', 'of', 'extrasolar', 'planets', 'our', 'objective', 'is', 'an', 'assessment', 'of', 'the', 'detectability', 'of', 'molecular', 'signatures', 'in', 'earths', 'transit', 'spectra', 'to', 'this', 'end', 'we', 'take', 'a', 'limb', 'sequence', 'of', 'representative', 'cloudfree', 'transmission', 'spectra', 'recorded', 'by', 'the', 'spaceborne', 'acefts', 'earth', 'observation', 'mission', 'hughes', 'et', 'al', 'ace', 'infrared', 'spectral', 'atlases', 'of', 'the', 'earths', 'atmosphere', 'jqsrt', '2014', 'and', 'combine', 'these', 'spectra', 'to', 'the', 'effective', 'height', 'of', 'the', 'atmosphere', 'these', 'data', 'are', 'compared', 'to', 'spectra', 'modeled', 'with', 'an', 'atmospheric', 'radiative', 'transfer', 'linebyline', 'infrared', 'code', 'to', 'study', 'the', 'impact', 'of', 'individual', 'molecules', 'spectral', 'resolution', 'the', 'choice', 'of', 'auxiliary', 'data', 'and', 'numerical', 'approximations', 'moreover', 'the', 'study', 'serves', 'as', 'a', 'validation', 'of', 'our', 'infrared', 'radiative', 'transfer', 'code', 'the', 'largest', 'impact', 'is', 'due', 'to', 'water', 'carbon', 'dioxide', 'ozone', 'methane', 'nitrous', 'oxide', 'nitrogen', 'nitric', 'acid', 'oxygen', 'and', 'some', 'chlorofluorocarbons', 'cfc11', 'and', 'cfc12', 'the', 'effect', 'of', 'further', 'molecules', 'considered', 'in', 'the', 'modeling', 'is', 'either', 'marginal', 'or', 'absent', 'the', 'best', 'matching', 'model', 'has', 'a', 'mean', 'residuum', 'of', '04', 'km', 'and', 'a', 'maximum', 'difference', 'of', '2', 'km', 'to', 'the', 'measured', 'effective', 'height', 'for', 'a', 'quantitative', 'estimate', 'of', 'visibility', 'and', 'detectability', 'we', 'consider', 'the', 'maximum', 'change', 'of', 'the', 'residual', 'spectrum', 'the', 'relative', 'change', 'of', 'the', 'residual', 'norm', 'the', 'additional', 'transit', 'depth', 'and', 'signaltonoise', 'ratios', 'for', 'a', 'jwst', 'setup', 'in', 'conclusion', 'our', 'study', 'provides', 'a', 'list', 'of', 'molecules', 'that', 'are', 'relevant', 'for', 'modeling', 'transmission', 'spectra', 'of', 'earthlike', 'exoplanets', 'and', 'discusses', 'the', 'feasibility', 'of', 'retrieval']]
|
[-0.07289431006403772, 0.09824732487817413, -0.05112691007275226, 0.06885773391672687, -0.027806403726917277, -0.0762779260681861, 0.06824529915725952, 0.3971004011661639, -0.21453258998530067, -0.3657823469003905, 0.10460143151974652, -0.31626987437121273, -0.10059572772970497, 0.17758705627206314, -0.06911855196882143, 0.05861904603327218, 0.1126354094907612, -0.04441072987282111, -0.027104237512593332, -0.2108398558150447, 0.2337659540666238, 0.16377149077625613, 0.17716643052624736, 0.060835256286700744, 0.0289740659017668, -0.037891875357981844, -0.08129707204174294, -0.05328107162345598, -0.16078926699909335, 0.12678498156684387, 0.23820532802050645, 0.1459774847925556, 0.1788197959692258, -0.38555114638435806, -0.27452476854388247, 0.06979669577634448, 0.10377782318204906, 0.05073515546651697, -0.02547767737755191, -0.2388135174513894, 0.035997027991405826, -0.1468931661247876, -0.11939860250351751, -0.011537984701006015, 0.016975824032788692, 0.010005116139689511, -0.30153185835940094, 0.01992997084445184, 0.008102601459080754, 0.1871576143296163, -0.12516633231651125, -0.16622645052135168, -0.08884623521026003, 0.14782049625101057, 0.006523387677776131, -0.030630475888396853, 0.16935353139010462, -0.07883565333163874, -0.024689769315286707, 0.39991259522342193, -0.1540745330243758, -0.04749901163053106, 0.18911357431142434, -0.15042211128428226, -0.09497696072371169, 0.1960844890059896, 0.16001227288967065, 0.1364956205626103, -0.1651800997084073, 0.015815012547851948, -0.02768786209419171, 0.19055092963113968, 0.09960947754901463, 0.05363004658050953, 0.27623857313531486, 0.16276475861291273, 0.05218657759283283, 0.09781106908827755, -0.22502251811281376, -0.023638735287187792, -0.21360320605479344, -0.1765459433988035, -0.15334726077699556, 0.036790143018367555, -0.06340504040072623, -0.14789547964474076, 0.37531557883823424, 0.16282664116503295, 0.161432248692989, 0.0012465286226906323, 0.34723456336089625, 0.07961230579323758, 0.03127531124658058, 0.020650581684950077, 0.2853604318278891, 0.1402955713507944, 0.1109788068110057, -0.2726202540107903, 0.08391647407667262, 0.011931076632967226]
|
1,803.0518
|
Bose-Einstein Condensation in a Dilute, Trapped Gas at Positive
Temperature
|
We consider an interacting, dilute Bose gas trapped in a harmonic potential
at a positive temperature. The system is analyzed in a combination of a
thermodynamic and a Gross-Pitaevskii (GP) limit where the trap frequency
$\omega$, the temperature $T$ and the particle number $N$ are related by $N
\sim (T / \omega)^{3} \to\infty$ while the scattering length is so small that
the interaction energy per particle around the center of the trap is of the
same order of magnitude as the spectral gap in the trap. We prove that the
difference between the canonical free energy of the interacting gas and the one
of the noninteracting system can be obtained by minimizing the GP energy
functional. We also prove Bose-Einstein condensation in the following sense:
The one-particle density matrix of any approximate minimizer of the canonical
free energy functional is to leading order given by that of the noninteracting
gas but with the free condensate wavefunction replaced by the GP minimizer.
|
math-ph cond-mat.quant-gas math.MP
|
we consider an interacting dilute bose gas trapped in a harmonic potential at a positive temperature the system is analyzed in a combination of a thermodynamic and a grosspitaevskii gp limit where the trap frequency omega the temperature t and the particle number n are related by n sim t omega3 toinfty while the scattering length is so small that the interaction energy per particle around the center of the trap is of the same order of magnitude as the spectral gap in the trap we prove that the difference between the canonical free energy of the interacting gas and the one of the noninteracting system can be obtained by minimizing the gp energy functional we also prove boseeinstein condensation in the following sense the oneparticle density matrix of any approximate minimizer of the canonical free energy functional is to leading order given by that of the noninteracting gas but with the free condensate wavefunction replaced by the gp minimizer
|
[['we', 'consider', 'an', 'interacting', 'dilute', 'bose', 'gas', 'trapped', 'in', 'a', 'harmonic', 'potential', 'at', 'a', 'positive', 'temperature', 'the', 'system', 'is', 'analyzed', 'in', 'a', 'combination', 'of', 'a', 'thermodynamic', 'and', 'a', 'grosspitaevskii', 'gp', 'limit', 'where', 'the', 'trap', 'frequency', 'omega', 'the', 'temperature', 't', 'and', 'the', 'particle', 'number', 'n', 'are', 'related', 'by', 'n', 'sim', 't', 'omega3', 'toinfty', 'while', 'the', 'scattering', 'length', 'is', 'so', 'small', 'that', 'the', 'interaction', 'energy', 'per', 'particle', 'around', 'the', 'center', 'of', 'the', 'trap', 'is', 'of', 'the', 'same', 'order', 'of', 'magnitude', 'as', 'the', 'spectral', 'gap', 'in', 'the', 'trap', 'we', 'prove', 'that', 'the', 'difference', 'between', 'the', 'canonical', 'free', 'energy', 'of', 'the', 'interacting', 'gas', 'and', 'the', 'one', 'of', 'the', 'noninteracting', 'system', 'can', 'be', 'obtained', 'by', 'minimizing', 'the', 'gp', 'energy', 'functional', 'we', 'also', 'prove', 'boseeinstein', 'condensation', 'in', 'the', 'following', 'sense', 'the', 'oneparticle', 'density', 'matrix', 'of', 'any', 'approximate', 'minimizer', 'of', 'the', 'canonical', 'free', 'energy', 'functional', 'is', 'to', 'leading', 'order', 'given', 'by', 'that', 'of', 'the', 'noninteracting', 'gas', 'but', 'with', 'the', 'free', 'condensate', 'wavefunction', 'replaced', 'by', 'the', 'gp', 'minimizer']]
|
[-0.13874686220660806, 0.18733904616537983, -0.059774279844714326, 0.04951971866830718, 0.05116602508642245, -0.10725223489280325, 0.0332035769810318, 0.305197477072943, -0.26132781388005244, -0.27497686300994245, 0.022326120591606012, -0.3099524729070254, -0.043927294775494376, 0.11686182232006104, 0.04025163792757667, 0.049337837373605, 0.010753117548301817, 0.11092065719130914, -0.07177115977974609, -0.2298744025247288, 0.3417013322468847, 0.03693577954545617, 0.2210764073068276, 0.06877704965299927, 0.09622393448080402, 0.011550810682820156, 0.08267993467161432, 0.015588249330176041, -0.15461747310978352, 0.08030387063772651, 0.20325120714878722, 0.015407643191792886, 0.28754144309205004, -0.41229148515849373, -0.20735086266740838, 0.14448131283279508, 0.16357620719645638, 0.09006772644206648, -0.017790507411700674, -0.2521957369230222, 0.011582771777284506, -0.16432892320444809, -0.19782899592537434, -0.049637029487348626, 0.02549108563689515, 0.07872157339261321, -0.2571975025173742, 0.135209946804207, 0.06282984233112074, 0.0265286085777916, -0.09832486472005257, -0.08530736198736122, -0.04013190703990403, 0.046968524632393385, 0.020152982571016765, 0.06437507873561117, 0.1518085301911924, -0.13853806517727207, -0.006839575021149358, 0.3846653489292294, -0.1322677068921621, -0.17002053043106571, 0.16442587715719129, -0.17953219058981632, -0.049813647629343906, 0.16108113690133904, 0.08840353934610903, 0.08477813090394193, -0.14045106944031432, 0.1544425940610381, -0.06279066128990962, 0.17338096867315472, 0.08774319957883563, 0.004769967682659626, 0.22088269618980122, 0.1566239814448636, 0.09300997664831812, 0.14871014942109467, -0.09602492631456698, -0.1146709916589316, -0.3124224074388621, -0.18117469678436465, -0.2771553440601565, 0.05216607079200912, -0.09237197239390298, -0.1437949903367553, 0.36614734885952205, 0.1051315435935976, 0.21524381625349634, 0.04316617501317523, 0.26919589393073695, 0.2121450417143933, 0.03897688841680065, 0.0834229052910814, 0.1985904507280793, 0.126255415322521, 0.055510411872819534, -0.3056899577379227, -0.040908588486490774, 0.08292771265987539]
|
1,803.05181
|
Can Autism be Catered with Artificial Intelligence-Assisted Intervention
Technology? A Literature Review
|
This article presents an extensive literature review of technology based
intervention methodologies for individuals facing Autism Spectrum Disorder
(ASD). Reviewed methodologies include: contemporary Computer Aided Systems
(CAS), Computer Vision Assisted Technologies (CVAT) and Virtual Reality (VR) or
Artificial Intelligence (AI)-Assisted interventions. The research over the past
decade has provided enough demonstrations that individuals with ASD have a
strong interest in technology based interventions, which are useful in both,
clinical settings as well as at home and classrooms. Despite showing great
promise, research in developing an advanced technology based intervention that
is clinically quantitative for ASD is minimal. Moreover, the clinicians are
generally not convinced about the potential of the technology based
interventions due to non-empirical nature of published results. A major reason
behind this lack of acceptability is that a vast majority of studies on
distinct intervention methodologies do not follow any specific standard or
research design. We conclude from our findings that there remains a gap between
the research community of computer science, psychology and neuroscience to
develop an AI assisted intervention technology for individuals suffering from
ASD. Following the development of a standardized AI based intervention
technology, a database needs to be developed, to devise effective AI
algorithms.
|
cs.HC cs.AI cs.LG
|
this article presents an extensive literature review of technology based intervention methodologies for individuals facing autism spectrum disorder asd reviewed methodologies include contemporary computer aided systems cas computer vision assisted technologies cvat and virtual reality vr or artificial intelligence aiassisted interventions the research over the past decade has provided enough demonstrations that individuals with asd have a strong interest in technology based interventions which are useful in both clinical settings as well as at home and classrooms despite showing great promise research in developing an advanced technology based intervention that is clinically quantitative for asd is minimal moreover the clinicians are generally not convinced about the potential of the technology based interventions due to nonempirical nature of published results a major reason behind this lack of acceptability is that a vast majority of studies on distinct intervention methodologies do not follow any specific standard or research design we conclude from our findings that there remains a gap between the research community of computer science psychology and neuroscience to develop an ai assisted intervention technology for individuals suffering from asd following the development of a standardized ai based intervention technology a database needs to be developed to devise effective ai algorithms
|
[['this', 'article', 'presents', 'an', 'extensive', 'literature', 'review', 'of', 'technology', 'based', 'intervention', 'methodologies', 'for', 'individuals', 'facing', 'autism', 'spectrum', 'disorder', 'asd', 'reviewed', 'methodologies', 'include', 'contemporary', 'computer', 'aided', 'systems', 'cas', 'computer', 'vision', 'assisted', 'technologies', 'cvat', 'and', 'virtual', 'reality', 'vr', 'or', 'artificial', 'intelligence', 'aiassisted', 'interventions', 'the', 'research', 'over', 'the', 'past', 'decade', 'has', 'provided', 'enough', 'demonstrations', 'that', 'individuals', 'with', 'asd', 'have', 'a', 'strong', 'interest', 'in', 'technology', 'based', 'interventions', 'which', 'are', 'useful', 'in', 'both', 'clinical', 'settings', 'as', 'well', 'as', 'at', 'home', 'and', 'classrooms', 'despite', 'showing', 'great', 'promise', 'research', 'in', 'developing', 'an', 'advanced', 'technology', 'based', 'intervention', 'that', 'is', 'clinically', 'quantitative', 'for', 'asd', 'is', 'minimal', 'moreover', 'the', 'clinicians', 'are', 'generally', 'not', 'convinced', 'about', 'the', 'potential', 'of', 'the', 'technology', 'based', 'interventions', 'due', 'to', 'nonempirical', 'nature', 'of', 'published', 'results', 'a', 'major', 'reason', 'behind', 'this', 'lack', 'of', 'acceptability', 'is', 'that', 'a', 'vast', 'majority', 'of', 'studies', 'on', 'distinct', 'intervention', 'methodologies', 'do', 'not', 'follow', 'any', 'specific', 'standard', 'or', 'research', 'design', 'we', 'conclude', 'from', 'our', 'findings', 'that', 'there', 'remains', 'a', 'gap', 'between', 'the', 'research', 'community', 'of', 'computer', 'science', 'psychology', 'and', 'neuroscience', 'to', 'develop', 'an', 'ai', 'assisted', 'intervention', 'technology', 'for', 'individuals', 'suffering', 'from', 'asd', 'following', 'the', 'development', 'of', 'a', 'standardized', 'ai', 'based', 'intervention', 'technology', 'a', 'database', 'needs', 'to', 'be', 'developed', 'to', 'devise', 'effective', 'ai', 'algorithms']]
|
[-0.05492649721680209, 0.0559839096620999, -0.08587873784592376, 0.04874105375551153, -0.13767107375955676, -0.20356220516841858, 0.042535899258218705, 0.414371363054961, -0.17732277291826903, -0.32486313092522323, 0.11627810451784171, -0.2597481382731348, -0.24435520194238053, 0.2626640706305625, -0.17386133410269394, 0.029994053074042314, 0.10412612681509927, 0.020647667663288304, 0.015408830395899712, -0.2751202543673571, 0.2784888755477732, 0.05850192217010772, 0.3730105863884091, 0.0886868418683298, 0.027373911479953675, 0.027486166413873435, -0.05025207364582457, 0.00039874220732599497, -0.11309440228462336, 0.2044884709647158, 0.4043277591106016, 0.2593986369925551, 0.45461738022975623, -0.46831491437740624, -0.2629566080542281, 0.09858569404517765, 0.13698920546885346, 0.09799931599758566, -0.11894138970237692, -0.3103301683196332, 0.0598491767491214, -0.2066108812764287, -0.11343896070029587, -0.07143985143629834, 0.042459998074918986, -0.021368834088207223, -0.22676185641437768, -0.01762375962061924, -0.009274966191442217, 0.22030852076597512, -0.04575518267927691, -0.14155265409499407, 0.05891784551204182, 0.21685645072633633, 0.08125148807070218, 0.05159254551399499, 0.17663316735182888, -0.17307398085831666, -0.21695855116733584, 0.3338926891144365, 0.05311692110262811, -0.1115785304736346, 0.24420335878035984, -0.05463773099821992, -0.15218648715643213, 0.06083450735750375, 0.17928123309160582, 0.03382251904113218, -0.19106205637566745, 0.052886267592257355, 0.06519965414656326, 0.19614699627272786, -0.021142112293455285, -0.00757880395045504, 0.22407796010375022, 0.2177118242229335, 0.03489454747294076, 0.017733904198976233, -0.021606578184873798, -0.1192865332076326, -0.22798285767901688, -0.14706187715026317, -0.15746481541078539, 0.04614695970507455, 0.007169403848456568, -0.15693003761349245, 0.32938281326321883, 0.2246069432039076, 0.03223579958896153, -0.004269407569081523, 0.30878923064330593, 0.0065316358039854095, 0.12426865289919078, 0.050117847513174635, 0.20904970901086928, 0.02506028159055859, 0.19802798398945015, -0.14388621179154143, 0.12311196930008009, -0.054044739136006686]
|
1,803.05182
|
Approximative Theorem of Incomplete Riemann-Stieltjes Sum of Stochastic
Integral
|
The approximative theorems of incomplete Riemann-Stieltjes sums of Ito
stochastic integral, mean square integral and Stratonovich stochastic integral
with respect to Brownian motion are investigated. Some sufficient conditions of
incomplete Riemann-Stieltjes sums approaching stochastic integral are
developed, which establish the alternative ways to converge stochastic
integral. And, Two simulation examples of incomplete Riemann-Stieltjes sums
about Ito stochastic integral and Stratonovich stochastic integral are given
for demonstration.
|
math.PR cs.NA
|
the approximative theorems of incomplete riemannstieltjes sums of ito stochastic integral mean square integral and stratonovich stochastic integral with respect to brownian motion are investigated some sufficient conditions of incomplete riemannstieltjes sums approaching stochastic integral are developed which establish the alternative ways to converge stochastic integral and two simulation examples of incomplete riemannstieltjes sums about ito stochastic integral and stratonovich stochastic integral are given for demonstration
|
[['the', 'approximative', 'theorems', 'of', 'incomplete', 'riemannstieltjes', 'sums', 'of', 'ito', 'stochastic', 'integral', 'mean', 'square', 'integral', 'and', 'stratonovich', 'stochastic', 'integral', 'with', 'respect', 'to', 'brownian', 'motion', 'are', 'investigated', 'some', 'sufficient', 'conditions', 'of', 'incomplete', 'riemannstieltjes', 'sums', 'approaching', 'stochastic', 'integral', 'are', 'developed', 'which', 'establish', 'the', 'alternative', 'ways', 'to', 'converge', 'stochastic', 'integral', 'and', 'two', 'simulation', 'examples', 'of', 'incomplete', 'riemannstieltjes', 'sums', 'about', 'ito', 'stochastic', 'integral', 'and', 'stratonovich', 'stochastic', 'integral', 'are', 'given', 'for', 'demonstration']]
|
[-0.13664276765969893, -0.0025596355059833236, -0.10115564503057888, 0.15080390167845922, -0.17803539451084693, -0.09221288002851052, -0.020173426449411745, 0.38541646397700813, -0.3599004497412931, -0.2013897243860728, 0.1966685527145411, -0.284099830596736, -0.17302099460820583, 0.22632633143979491, -0.15647484010762788, 0.11083278860050169, 0.08904600661304413, 0.011199022121163029, -0.07909965505259055, -0.30700121636530664, 0.24378824293627543, -0.028991563922979614, 0.1083776529342162, -0.09143316898685457, 0.26567941837040987, 0.047873553819954395, -0.15840163715818728, -0.01637232110299396, -0.20125843434961457, 0.14877644528380848, 0.2981185472259919, -0.029303958272617874, 0.33556869942130463, -0.5136189905531479, -0.13353520509024913, 0.10400993283838034, 0.1311340651688321, -0.06715126814863955, 0.018781756311937264, -0.3058879761815523, -0.014657327989962969, -0.11112431165846912, -0.18024493110450832, -0.15568949983836236, 0.015239582171268536, 0.23039811798794704, -0.35122634833114164, 0.1354567577046427, 0.10057438357916633, 0.06229013069109483, -0.08582404593824211, -0.22978000014060826, 0.09555033211257648, 0.01979569889689711, 0.06496528688479554, -0.06739987456945307, 0.1137322928319036, -0.04449999534214536, -0.18416046267939787, 0.20079673202990583, -0.0866826873653653, -0.28592607012075005, 0.10064931995602268, -0.16774505088952454, -0.11380010633023852, 0.25409306042517227, 0.0371954545914901, 0.17006810837792177, -0.30117260742311674, 0.1111784910361607, -0.007608752062713558, -0.04680702115663073, 0.12882330094351235, 0.042604769438956726, 0.09503610381348566, 0.0588474367660555, 0.15041056156130225, 0.14347309739131367, -0.043046181460588494, -0.2964399635904666, -0.40475378185510635, -0.2130253607209659, -0.1478192405351861, 0.1990097979732761, -0.19160853614117845, -0.25318846380987176, 0.17122629112705137, 0.11666944158743277, 0.02986429381240724, 0.1404222970789609, 0.22299949567990773, 0.27950382187070016, -0.10361272663894025, 0.011161391383432077, 0.0947183419647803, 0.28452399040741677, 0.14574094456761624, -0.16712067990253368, 0.04643218491268768, 0.20236794457940216]
|
1,803.05183
|
Cross Feshbach resonance
|
Feshbach resonance occurs when a pair of free particles is resonantly coupled
to a molecular bound state. In the field of ultracold quantum gases, atomic
Feshbach resonances became a usual tool for tailoring atomic interactions
opening up many new applications in this field. In a semiconductor microcavity,
the Feshbach resonance appears when two lower polaritons are coupled to the
molecular biexciton state. Here, we demonstrate the existence of a cross
Feshbach resonance for which a pair of polaritons, lower together with upper,
effectively couples to the biexciton state. This demonstration is a crucial
step towards the efficient generation of entangled photon pairs in a
semiconductor microcavity. The existence of a Cross Feshbach resonance
establishes the condition to convert a pair of upper and lower polaritons via
the biexciton state into two lower polaritons, paving the way for the
generation of momentum and polarization entangled photons.
|
cond-mat.mes-hall
|
feshbach resonance occurs when a pair of free particles is resonantly coupled to a molecular bound state in the field of ultracold quantum gases atomic feshbach resonances became a usual tool for tailoring atomic interactions opening up many new applications in this field in a semiconductor microcavity the feshbach resonance appears when two lower polaritons are coupled to the molecular biexciton state here we demonstrate the existence of a cross feshbach resonance for which a pair of polaritons lower together with upper effectively couples to the biexciton state this demonstration is a crucial step towards the efficient generation of entangled photon pairs in a semiconductor microcavity the existence of a cross feshbach resonance establishes the condition to convert a pair of upper and lower polaritons via the biexciton state into two lower polaritons paving the way for the generation of momentum and polarization entangled photons
|
[['feshbach', 'resonance', 'occurs', 'when', 'a', 'pair', 'of', 'free', 'particles', 'is', 'resonantly', 'coupled', 'to', 'a', 'molecular', 'bound', 'state', 'in', 'the', 'field', 'of', 'ultracold', 'quantum', 'gases', 'atomic', 'feshbach', 'resonances', 'became', 'a', 'usual', 'tool', 'for', 'tailoring', 'atomic', 'interactions', 'opening', 'up', 'many', 'new', 'applications', 'in', 'this', 'field', 'in', 'a', 'semiconductor', 'microcavity', 'the', 'feshbach', 'resonance', 'appears', 'when', 'two', 'lower', 'polaritons', 'are', 'coupled', 'to', 'the', 'molecular', 'biexciton', 'state', 'here', 'we', 'demonstrate', 'the', 'existence', 'of', 'a', 'cross', 'feshbach', 'resonance', 'for', 'which', 'a', 'pair', 'of', 'polaritons', 'lower', 'together', 'with', 'upper', 'effectively', 'couples', 'to', 'the', 'biexciton', 'state', 'this', 'demonstration', 'is', 'a', 'crucial', 'step', 'towards', 'the', 'efficient', 'generation', 'of', 'entangled', 'photon', 'pairs', 'in', 'a', 'semiconductor', 'microcavity', 'the', 'existence', 'of', 'a', 'cross', 'feshbach', 'resonance', 'establishes', 'the', 'condition', 'to', 'convert', 'a', 'pair', 'of', 'upper', 'and', 'lower', 'polaritons', 'via', 'the', 'biexciton', 'state', 'into', 'two', 'lower', 'polaritons', 'paving', 'the', 'way', 'for', 'the', 'generation', 'of', 'momentum', 'and', 'polarization', 'entangled', 'photons']]
|
[-0.17295363957768883, 0.27753872660085044, -0.055938397288916565, 0.06799126979092072, -0.020386062249348594, -0.1755929599483979, 0.07205150950346784, 0.38132001151298656, -0.22453764840832044, -0.27804070645622136, -0.08501980850665734, -0.2652311620302498, -0.035689431979674203, 0.23613013320056528, 0.1073774735126539, 0.07507147796387817, 0.10031677583104064, -0.01779336874084226, 0.03427567393358411, -0.15065305541301596, 0.3197342811312912, -0.002757228394681267, 0.2910319132634021, 0.15023130621632624, 0.10057359932889712, 0.0018621877189083345, 0.17013853025333633, -0.14907073885973157, -0.13529402121002304, 0.1973032856087104, 0.2732871817617581, -0.026341518965260737, 0.28365007440142076, -0.4076067288374079, -0.17097135403289876, 0.06799246114196962, 0.24510184511991925, 0.2182563748812817, -0.10140960208654147, -0.3486291147969214, -0.047065013133246326, -0.12492196344096085, -0.12506374548478374, -0.0635527100860631, -0.0299197303821686, -0.034741271120207064, -0.29079412045639713, 0.032417406119277764, 0.06066943787937534, 0.03542066345850391, -0.05178230594329793, -0.04259293670284337, -0.009579694829881191, 0.03169825976144458, -0.08770271475458967, 0.03975956793553356, 0.1947740337771267, -0.19153958917113728, -0.1292677695939221, 0.34047584233099015, -0.16745439518949595, -0.14581765529763852, 0.20232611293422764, -0.1477813777064198, -0.012353484531671836, 0.19599434544235983, 0.176347567520008, 0.11762783835192436, -0.1313507829899177, 0.04483039869429094, -0.05481864285558976, 0.19375218112776377, 0.0902326460767152, 0.14809915200518123, 0.2677670782415903, 0.16442161396723884, 0.09570982245495543, 0.20946173053234815, -0.10880691170178611, -0.12158276930547737, -0.2424242531688049, -0.24282763873202853, -0.22233482984312136, 0.061736245761657586, 0.024386904732492786, -0.1526052183760651, 0.40540618428896213, 0.0785075284187393, 0.22290694606651007, -0.06856010845171866, 0.30407768859174744, 0.170507998083686, 0.05393235961553352, 0.0046794713121549834, 0.32228719069590345, 0.22780673950589422, 0.029314801302449456, -0.2681852405585734, -0.022644117888833942, 0.020040824310854077]
|
1,803.05184
|
A unified approach to fixed-wing aircraft path following guidance and
control
|
This paper addresses the path following control problem for scale-model
fixed-wing aircraft. Kinematic guidance and dynamic control laws are developed
within a single coherent framework that exploits a simple generic model of
aerodynamics forces acting on the aircraft and applies to almost all regular 3D
paths. The proposed control solutions are derived on the basis of theoretical
stability and convergence analyses. They are complemented by addressing several
practical issues, and validated via realistic hardware-in-the-loop simulations.
|
cs.SY
|
this paper addresses the path following control problem for scalemodel fixedwing aircraft kinematic guidance and dynamic control laws are developed within a single coherent framework that exploits a simple generic model of aerodynamics forces acting on the aircraft and applies to almost all regular 3d paths the proposed control solutions are derived on the basis of theoretical stability and convergence analyses they are complemented by addressing several practical issues and validated via realistic hardwareintheloop simulations
|
[['this', 'paper', 'addresses', 'the', 'path', 'following', 'control', 'problem', 'for', 'scalemodel', 'fixedwing', 'aircraft', 'kinematic', 'guidance', 'and', 'dynamic', 'control', 'laws', 'are', 'developed', 'within', 'a', 'single', 'coherent', 'framework', 'that', 'exploits', 'a', 'simple', 'generic', 'model', 'of', 'aerodynamics', 'forces', 'acting', 'on', 'the', 'aircraft', 'and', 'applies', 'to', 'almost', 'all', 'regular', '3d', 'paths', 'the', 'proposed', 'control', 'solutions', 'are', 'derived', 'on', 'the', 'basis', 'of', 'theoretical', 'stability', 'and', 'convergence', 'analyses', 'they', 'are', 'complemented', 'by', 'addressing', 'several', 'practical', 'issues', 'and', 'validated', 'via', 'realistic', 'hardwareintheloop', 'simulations']]
|
[-0.14655942432582378, 0.05215593228737513, -0.06430942133301869, 0.03159421002337088, -0.0882099524140358, -0.15433322956164677, 0.027721878477993112, 0.38239488468815885, -0.24795449810723463, -0.28744354570905367, 0.14505067420502504, -0.223441212537388, -0.15292801183337967, 0.2868213331171622, -0.09748349405514697, 0.15952779930084943, 0.09800354150744776, -0.05320212543010712, -0.010271284125434856, -0.1562247280155619, 0.2841287490152172, 0.03635949482520422, 0.3086198182900747, 0.02271380737423897, 0.1586539271349708, 0.0446104355280598, -0.06566897042095661, 0.08043364874902181, -0.16275214720565903, 0.13375651984009893, 0.23430688951164483, 0.12887730618899998, 0.29548527335127195, -0.47894755894318225, -0.24750878707816204, 0.03138060989479224, 0.12740374438037785, 0.09647161057218909, -0.09603434084914625, -0.30406347711881004, 0.09318277976786096, -0.16172746054207285, -0.13786828159665068, -0.12420820818593105, -0.0390616972434024, 0.08677352896736314, -0.2942695117369294, 0.0028511649214973053, 0.03380947257081668, 0.08423131259779136, -0.12253823809946576, -0.060931850485503675, 0.004039568686857819, 0.17750781609521557, -0.014422837596697113, -0.04490791023398439, 0.16585150034477314, -0.08233561849532028, -0.15481625235949953, 0.41626474807659786, 0.053854680446286995, -0.23754691378523907, 0.19821210036364695, -0.0313038585241884, -0.10548293392096336, 0.10227021229763826, 0.19130226044915616, 0.12907662759224572, -0.1979820598863686, 0.06818572064551215, -0.042990420583325126, 0.11690577959020933, 0.03054786907353749, -0.04594705736885468, 0.15149447047743403, 0.2125896462549766, 0.08885382285962502, 0.08487916854520638, -0.046919719763100144, -0.18144391518396635, -0.3034544012943904, -0.059284892215703926, -0.10986362582848717, -0.03976614985226964, -0.05279933189895625, -0.10936189126223325, 0.3930838941037655, 0.1691892257660705, 0.13179662668456635, 0.08492080539464951, 0.36867959986130394, 0.06685081156319939, -0.008959927968680859, 0.08338648402442535, 0.24908316715310017, 0.09730455026340981, 0.07832236975431442, -0.21923878592749438, 0.05303223871936401, 0.07144211729988456]
|
1,803.05185
|
The influence of Coulomb correlations on nonequilibrium quantum
transport in quadruple quantum-dot structure
|
The description of quantum transport in a quadruple quantum-dot structure
(QQD) is proposed taking into account the Coulomb correlations and nonzero bias
voltages. To achieve this goal the combination of nonequilibrium Green's
functions and equation-of-motion technique is used. It is shown that the
anisotropy of kinetic processes in the QQD leads to negative differential
conductance (NDC). The reason of the effect is an interplay of the Fano
resonances which are induced by the interdot Coulomb correlations. Different
ways to increase the peak-to-valley ratio related to the observed NDC are
discussed.
|
cond-mat.mes-hall
|
the description of quantum transport in a quadruple quantumdot structure qqd is proposed taking into account the coulomb correlations and nonzero bias voltages to achieve this goal the combination of nonequilibrium greens functions and equationofmotion technique is used it is shown that the anisotropy of kinetic processes in the qqd leads to negative differential conductance ndc the reason of the effect is an interplay of the fano resonances which are induced by the interdot coulomb correlations different ways to increase the peaktovalley ratio related to the observed ndc are discussed
|
[['the', 'description', 'of', 'quantum', 'transport', 'in', 'a', 'quadruple', 'quantumdot', 'structure', 'qqd', 'is', 'proposed', 'taking', 'into', 'account', 'the', 'coulomb', 'correlations', 'and', 'nonzero', 'bias', 'voltages', 'to', 'achieve', 'this', 'goal', 'the', 'combination', 'of', 'nonequilibrium', 'greens', 'functions', 'and', 'equationofmotion', 'technique', 'is', 'used', 'it', 'is', 'shown', 'that', 'the', 'anisotropy', 'of', 'kinetic', 'processes', 'in', 'the', 'qqd', 'leads', 'to', 'negative', 'differential', 'conductance', 'ndc', 'the', 'reason', 'of', 'the', 'effect', 'is', 'an', 'interplay', 'of', 'the', 'fano', 'resonances', 'which', 'are', 'induced', 'by', 'the', 'interdot', 'coulomb', 'correlations', 'different', 'ways', 'to', 'increase', 'the', 'peaktovalley', 'ratio', 'related', 'to', 'the', 'observed', 'ndc', 'are', 'discussed']]
|
[-0.1860825788068016, 0.1283306814692979, -0.08406362636014819, 0.1053495700445233, -0.027256596523026626, -0.14697398099944822, -0.008330782840494067, 0.3329928876625167, -0.2888803085157027, -0.29583761204654974, -0.07395823228224697, -0.298419188718415, -0.17523122656986945, 0.18670990398774545, 0.009242971500174866, 0.024608522467315198, 0.0024821985616452166, -0.033712281322934565, -0.03694417353771213, -0.22836805236163651, 0.314544380394121, 0.04905077540703739, 0.31309707454509206, 0.1544588442426175, 0.09255258906972207, -0.0020787903211183017, 0.053506113894076814, 0.06252590358360774, -0.11649183198339112, 0.06320970103455087, 0.24829915536360608, -0.035193149052146405, 0.22436212507956144, -0.4007383245146937, -0.16811190527967282, 0.04394935122173693, 0.12998878245578252, 0.1359994820254441, -0.02895092144737848, -0.25921616597721975, 0.050589313451200726, -0.15310881594713363, -0.10870497136169838, -0.06430518411927753, 0.003898984618071053, 0.025139063328970222, -0.3025626109117487, 0.0926655593328178, 0.0829822030953235, 0.0007514169129232566, -0.005064614029187295, -0.12357137803402211, -0.026306279650371935, 0.10898514072307282, 0.021021182866146168, -0.0038292198286702236, 0.16846200996337252, -0.10878178762634182, -0.12417787498173614, 0.3414561817319029, -0.059942292261661756, -0.1854051053718043, 0.13090539371284346, -0.18294507211798594, -0.043244954271035065, 0.16912360016463532, 0.11515118146522177, 0.0768461972888973, -0.19411250114919515, 0.08484719386453637, 0.06300438987091184, 0.12444666813438138, 0.039623918601622184, 0.07117824269355172, 0.19737005430894594, 0.14720967491674755, 0.048693051810065904, 0.142186641967338, -0.10903148551781973, -0.1412974496682485, -0.27249733896719086, -0.12208517899529801, -0.16019696001830097, 0.09504001112137404, -0.05282643212283599, -0.1646581461041933, 0.41550447131933954, 0.15224830163642764, 0.21587083385739889, -0.05144276803281779, 0.29821866419580245, 0.24919110499839817, 0.11621615073333184, -0.05040630794974277, 0.26966573894023893, 0.2230110181780118, 0.0913595124691104, -0.3583642672126492, 0.08489037533290685, 0.020164569650983646]
|
1,803.05186
|
Determinantal elliptic Selberg integrals
|
The classical Selberg integral contains a power of the Vandermonde
determinant. When that power is a square, it is easy to prove Selberg's
identity by interpreting it as a determinant of one-variable integrals. We give
similar proofs of summation and transformation formulas for continuous and
discrete elliptic Selberg integrals. In the continuous case, the same proof was
previously given by Noumi. Special cases of these identities have found
applications in combinatorics.
|
math.CA math.CO
|
the classical selberg integral contains a power of the vandermonde determinant when that power is a square it is easy to prove selbergs identity by interpreting it as a determinant of onevariable integrals we give similar proofs of summation and transformation formulas for continuous and discrete elliptic selberg integrals in the continuous case the same proof was previously given by noumi special cases of these identities have found applications in combinatorics
|
[['the', 'classical', 'selberg', 'integral', 'contains', 'a', 'power', 'of', 'the', 'vandermonde', 'determinant', 'when', 'that', 'power', 'is', 'a', 'square', 'it', 'is', 'easy', 'to', 'prove', 'selbergs', 'identity', 'by', 'interpreting', 'it', 'as', 'a', 'determinant', 'of', 'onevariable', 'integrals', 'we', 'give', 'similar', 'proofs', 'of', 'summation', 'and', 'transformation', 'formulas', 'for', 'continuous', 'and', 'discrete', 'elliptic', 'selberg', 'integrals', 'in', 'the', 'continuous', 'case', 'the', 'same', 'proof', 'was', 'previously', 'given', 'by', 'noumi', 'special', 'cases', 'of', 'these', 'identities', 'have', 'found', 'applications', 'in', 'combinatorics']]
|
[-0.13783741716711953, 0.021469925444173088, -0.11334809824876801, 0.14233822217145542, -0.11998436324508258, -0.15293731252518547, 0.00516244030268994, 0.2986616611244603, -0.2772800587183258, -0.23365612278207087, 0.14090813467980848, -0.2669400952028399, -0.210679584682073, 0.26017194963408746, -0.10634693178626164, 0.06794881180558406, 0.046699753385299525, 0.07239704083284022, -0.11794454975276661, -0.29950495882773065, 0.3026970954821773, -0.02722837374558751, 0.17067947877492284, 0.06484041524670599, 0.09088839170142589, 0.07478403568949918, -0.05612202223495279, -0.08336309962855216, -0.08769937015835828, 0.10055408655652698, 0.2987562106056532, 0.06416772999538398, 0.2438366856871986, -0.3535758507188777, -0.14684979908142082, 0.11797724783577969, 0.1540201057837358, 0.01800666735048445, -0.0001308727570035508, -0.24001885016291388, 0.04067029424903678, -0.1674379770460368, -0.19965509334447937, -0.1164915492974589, 0.069753034827365, 0.098618960027701, -0.283559646116386, 0.08612897143137443, 0.10628150303808737, 0.09889675552209079, -0.013292036163555065, -0.17324102809652686, 0.03811185887332638, 0.08810229061546893, 0.07084107578692722, 0.021004870030569882, 0.03660438748233965, -0.09167514828937194, -0.13047889767798374, 0.33481382854072983, -0.0009440442999746178, -0.22952807546448958, 0.07328671830850587, -0.14208704342042477, -0.19197510290418712, 0.14277185492289685, 0.04514091526171271, 0.1539877364215192, -0.12348877028402262, 0.16707222321247814, -0.14310148660041078, 0.07232577170074826, 0.15773951159921332, -0.02794534373949741, 0.09929011996940408, -0.030967750983365194, 0.04272544475987186, 0.2283668769392329, 0.03730008354194095, -0.11803695566060257, -0.33343751285172685, -0.24149263597710033, -0.21942008261791837, 0.14176087537583645, -0.13709463916914078, -0.21460857630615504, 0.3597770379593884, 0.060078488507891784, 0.11479068817046116, 0.13632999910828722, 0.24747348866674682, 0.24689575579692938, 0.12830746042030589, 0.002223555037987904, 0.11869055009119107, 0.2251338098185058, 0.10125852436561819, -0.11323271446507162, 0.011700171728054402, 0.23839369502810526]
|
1,803.05187
|
Interlocked permutations
|
The zero-error capacity of channels with a countably infinite input alphabet
formally generalises Shannon's classical problem about the capacity of discrete
memoryless channels. We solve the problem for three particular channels. Our
results are purely combinatorial and in line with previous work of the third
author about permutation capacity.
|
math.CO
|
the zeroerror capacity of channels with a countably infinite input alphabet formally generalises shannons classical problem about the capacity of discrete memoryless channels we solve the problem for three particular channels our results are purely combinatorial and in line with previous work of the third author about permutation capacity
|
[['the', 'zeroerror', 'capacity', 'of', 'channels', 'with', 'a', 'countably', 'infinite', 'input', 'alphabet', 'formally', 'generalises', 'shannons', 'classical', 'problem', 'about', 'the', 'capacity', 'of', 'discrete', 'memoryless', 'channels', 'we', 'solve', 'the', 'problem', 'for', 'three', 'particular', 'channels', 'our', 'results', 'are', 'purely', 'combinatorial', 'and', 'in', 'line', 'with', 'previous', 'work', 'of', 'the', 'third', 'author', 'about', 'permutation', 'capacity']]
|
[-0.18177454722855163, 0.06528641630382258, -0.03157547253127001, 0.04653677359527471, -0.10578576517196334, -0.23279621869287626, 0.1700587246605024, 0.3206677639058658, -0.3447473191998291, -0.24512149347942702, 0.1118250329900362, -0.3008582152578296, -0.09679985197964219, 0.17934267564049486, -0.16631023443246984, 0.13724637696785585, 0.052098539467824966, 0.12086081291948046, -0.009115237222208727, -0.32432945258915424, 0.3627291571310892, 0.036058882479460874, 0.2521688578536316, 0.0640199428842384, 0.0494130484056564, 0.031496844679706405, -0.0629082980508707, -0.04674092284878906, -0.14207806710952095, 0.08659803143664434, 0.325114335560677, 0.13818922742479006, 0.1956613294932307, -0.3689981011046591, -0.3134113911881435, 0.1424135135258643, 0.11736431355797211, 0.10832116000202237, 0.0025000291097224975, -0.26724088336436114, 0.08718840675238444, -0.18571580405708174, 0.011922200932642636, 0.08365898431107706, 0.0010317664365379177, -0.01876566443136152, -0.27332182774054153, 0.07241307601940875, 0.17451382203179658, 0.06008947418280402, -0.057797844293622336, -0.17515601582673132, 0.09816574018771704, 0.16533590188934183, 0.009228622122686736, -0.01672154115703033, 0.030021643712736513, -0.07049788684793273, -0.21984209149733794, 0.2822863580468966, -0.010878286818612595, -0.2555715787243478, 0.12430567146107858, -0.11620368639824494, -0.16580488360772022, 0.1775527853442698, 0.15305738601529476, 0.12552592743720328, -0.14230132104866966, 0.1306993582283565, -0.17213329729833166, 0.1706468996363787, 0.11784438987509632, 0.12845843979062474, 0.10115305972950799, 0.0923870964194363, 0.05477648578128036, 0.296548614207161, 0.010766053446378482, -0.2150600058007605, -0.2998410848406505, -0.14020617762390447, -0.17617998817669495, 0.053339891230725515, -0.10027123010706641, -0.09727583970038259, 0.3191644868680409, 0.11468296388178417, 0.12396248260855067, 0.21409555037068773, 0.3100995404683814, 0.07909769562253614, -0.014654252750618497, 0.13398491508061333, 0.10700957398215423, 0.26910465222080143, 0.07444535070384035, -0.1563288267435772, 0.04718871168526156, 0.0704262927364634]
|
1,803.05188
|
Measurement of forward top pair production in the dilepton channel in
$pp$ collisions at $\sqrt{s}=13$ TeV
|
Forward top quark pair production is studied in $pp$ collisions in the $\mu
eb$ final state using a data sample corresponding to an integrated luminosity
of 1.93 fb$^{-1}$ collected with the LHCb experiment at a centre-of-mass energy
of 13 TeV. The cross-section is measured in a fiducial region where both
leptons have a transverse momentum greater than 20 GeV and a pseudorapidity
between 2.0 and 4.5. The quadrature sum of the azimuthal separation and the
difference in pseudorapidities, denoted $\Delta R$, between the two leptons
must be larger than 0.1. The $b$-jet axis is required to be separated from both
leptons by a $\Delta R$ of 0.5, and to have a transverse momentum in excess of
20 GeV and a pseudorapidity between 2.2 and 4.2. The cross-section is measured
to be $$\sigma_{t\bar{t}}=
126\pm19\,(\mathrm{stat})\pm16\,(\mathrm{syst})\pm5\,(\mathrm{lumi})\,\,\mathrm{
fb}$$ where the first uncertainty is statistical, the second is systematic, and
the third is due to the luminosity determination. The measurement is compatible
with the Standard Model prediction.
|
hep-ex
|
forward top quark pair production is studied in pp collisions in the mu eb final state using a data sample corresponding to an integrated luminosity of 193 fb1 collected with the lhcb experiment at a centreofmass energy of 13 tev the crosssection is measured in a fiducial region where both leptons have a transverse momentum greater than 20 gev and a pseudorapidity between 20 and 45 the quadrature sum of the azimuthal separation and the difference in pseudorapidities denoted delta r between the two leptons must be larger than 01 the bjet axis is required to be separated from both leptons by a delta r of 05 and to have a transverse momentum in excess of 20 gev and a pseudorapidity between 22 and 42 the crosssection is measured to be sigma_tbart 126pm19mathrmstatpm16mathrmsystpm5mathrmlumimathrm fb where the first uncertainty is statistical the second is systematic and the third is due to the luminosity determination the measurement is compatible with the standard model prediction
|
[['forward', 'top', 'quark', 'pair', 'production', 'is', 'studied', 'in', 'pp', 'collisions', 'in', 'the', 'mu', 'eb', 'final', 'state', 'using', 'a', 'data', 'sample', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '193', 'fb1', 'collected', 'with', 'the', 'lhcb', 'experiment', 'at', 'a', 'centreofmass', 'energy', 'of', '13', 'tev', 'the', 'crosssection', 'is', 'measured', 'in', 'a', 'fiducial', 'region', 'where', 'both', 'leptons', 'have', 'a', 'transverse', 'momentum', 'greater', 'than', '20', 'gev', 'and', 'a', 'pseudorapidity', 'between', '20', 'and', '45', 'the', 'quadrature', 'sum', 'of', 'the', 'azimuthal', 'separation', 'and', 'the', 'difference', 'in', 'pseudorapidities', 'denoted', 'delta', 'r', 'between', 'the', 'two', 'leptons', 'must', 'be', 'larger', 'than', '01', 'the', 'bjet', 'axis', 'is', 'required', 'to', 'be', 'separated', 'from', 'both', 'leptons', 'by', 'a', 'delta', 'r', 'of', '05', 'and', 'to', 'have', 'a', 'transverse', 'momentum', 'in', 'excess', 'of', '20', 'gev', 'and', 'a', 'pseudorapidity', 'between', '22', 'and', '42', 'the', 'crosssection', 'is', 'measured', 'to', 'be', 'sigma_tbart', '126pm19mathrmstatpm16mathrmsystpm5mathrmlumimathrm', 'fb', 'where', 'the', 'first', 'uncertainty', 'is', 'statistical', 'the', 'second', 'is', 'systematic', 'and', 'the', 'third', 'is', 'due', 'to', 'the', 'luminosity', 'determination', 'the', 'measurement', 'is', 'compatible', 'with', 'the', 'standard', 'model', 'prediction']]
|
[-0.06913465693425272, 0.20704544116375947, -0.06832160526649413, 0.10786381397997925, -0.01394785502318131, -0.09349734845906728, -0.009959918744746388, 0.3566656755905321, -0.19990349091265514, -0.3915814169746193, -0.009599611983108132, -0.37729170402477247, 0.14044830665825317, 0.16048042753187836, 0.04743259162219062, 0.06287153931739538, 0.09196745340209107, 0.006680638423068044, -0.08385767490510476, -0.17980899407545695, 0.239084431172713, 0.06080903788024895, 0.21764412388112975, 0.10338365268077909, 0.09147733499755886, 0.01659252751988839, -0.05133150533378205, -0.024962584874216723, -0.09423498772894559, 0.07228560853472575, 0.2314792596485599, 0.03410498823345818, 0.18163973285081964, -0.26691594059261464, -0.03715102393209055, 0.1611859227548012, 0.13472213555324059, -0.009884136982019181, 0.0034316257105110595, -0.27175100620905435, 0.1618925146556095, -0.23373507337517435, -0.07904923669936031, 0.06308724565766984, 0.06485127816728739, -0.047063606519321476, -0.33251624880503194, 0.15460273706475677, -0.04843578709980693, 0.09756157689681566, -0.0055451995493578056, -0.19623559417769962, -0.10187065236629074, -0.02020109119182973, 0.06392215031722664, 0.14734218975960028, 0.14590460189288448, -0.09714265190345461, -0.1611907157811238, 0.35957702177559364, -0.03315676894904438, -0.18954229510464468, 0.1419041756228168, -0.22620381044385873, -0.04629993561643714, 0.18052594244960257, 0.2375470691551064, 0.05949912317854971, -0.23383432736921106, 0.054839300079580676, 0.006180100842893864, 0.22833619308831482, 0.09345566190675086, 0.03136179042896559, 0.1774203736068947, 0.21720375748125617, 0.034069794487578346, 0.06711146436698202, -0.20922178489312251, -0.058986671731708955, -0.4085529104846975, -0.13623943295827287, -0.12638243638638477, 0.06877858520800723, -0.09478289977821264, -0.01810087875306884, 0.37212837464320736, 0.0773731238839234, 0.34051633107632123, 0.0019713722152045424, 0.29843253250991614, 0.12937182022594146, 0.08552300311358911, 0.09810835696172594, 0.3407171574429904, 0.17643075618713586, 0.1757062776072055, -0.17055843682451352, 0.002617984211870602, -0.0033608704273189816]
|
1,803.05189
|
Band Structure Dynamics in Indium Wires
|
One-dimensional Indium wires grown on Si(111) substrates, which are metallic
at high temperatures, become insulating below $\sim100$ K due to the formation
of a Charge Density Wave (CDW). The physics of this transition is not
conventional and involves a multiband Peierls instability with strong interband
coupling. This CDW ground state is readily destroyed with femtosecond laser
pulses resulting in a light-induced insulator-to-metal phase transition. The
current understanding of this transition remains incomplete, requiring
measurements of the transient electronic structure to complement previous
investigations of the lattice dynamics. Time- and angle-resolved
photo\-emission spectroscopy with extreme ultra-violet radiation is applied to
this end. We find that the transition from the insulating to the metallic band
structure occurs within $\sim660$ fs that is a fraction of the amplitude mode
period. The long life time of the transient state ($>100$ ps) is attributed to
trapping in a metastable state in accordance with previous work.
|
cond-mat.mtrl-sci cond-mat.mes-hall
|
onedimensional indium wires grown on si111 substrates which are metallic at high temperatures become insulating below sim100 k due to the formation of a charge density wave cdw the physics of this transition is not conventional and involves a multiband peierls instability with strong interband coupling this cdw ground state is readily destroyed with femtosecond laser pulses resulting in a lightinduced insulatortometal phase transition the current understanding of this transition remains incomplete requiring measurements of the transient electronic structure to complement previous investigations of the lattice dynamics time and angleresolved photoemission spectroscopy with extreme ultraviolet radiation is applied to this end we find that the transition from the insulating to the metallic band structure occurs within sim660 fs that is a fraction of the amplitude mode period the long life time of the transient state 100 ps is attributed to trapping in a metastable state in accordance with previous work
|
[['onedimensional', 'indium', 'wires', 'grown', 'on', 'si111', 'substrates', 'which', 'are', 'metallic', 'at', 'high', 'temperatures', 'become', 'insulating', 'below', 'sim100', 'k', 'due', 'to', 'the', 'formation', 'of', 'a', 'charge', 'density', 'wave', 'cdw', 'the', 'physics', 'of', 'this', 'transition', 'is', 'not', 'conventional', 'and', 'involves', 'a', 'multiband', 'peierls', 'instability', 'with', 'strong', 'interband', 'coupling', 'this', 'cdw', 'ground', 'state', 'is', 'readily', 'destroyed', 'with', 'femtosecond', 'laser', 'pulses', 'resulting', 'in', 'a', 'lightinduced', 'insulatortometal', 'phase', 'transition', 'the', 'current', 'understanding', 'of', 'this', 'transition', 'remains', 'incomplete', 'requiring', 'measurements', 'of', 'the', 'transient', 'electronic', 'structure', 'to', 'complement', 'previous', 'investigations', 'of', 'the', 'lattice', 'dynamics', 'time', 'and', 'angleresolved', 'photoemission', 'spectroscopy', 'with', 'extreme', 'ultraviolet', 'radiation', 'is', 'applied', 'to', 'this', 'end', 'we', 'find', 'that', 'the', 'transition', 'from', 'the', 'insulating', 'to', 'the', 'metallic', 'band', 'structure', 'occurs', 'within', 'sim660', 'fs', 'that', 'is', 'a', 'fraction', 'of', 'the', 'amplitude', 'mode', 'period', 'the', 'long', 'life', 'time', 'of', 'the', 'transient', 'state', '100', 'ps', 'is', 'attributed', 'to', 'trapping', 'in', 'a', 'metastable', 'state', 'in', 'accordance', 'with', 'previous', 'work']]
|
[-0.17175018248458704, 0.26093956066295504, -0.07251210378638158, -0.0015632879198528827, -0.030948553622389834, -0.11774092437699438, 0.11955833001372715, 0.4342787390202284, -0.254490629574284, -0.26845633512052397, 0.04767810151369001, -0.30438311176064115, -0.09015112764512499, 0.1355177741808196, 0.04747897456555317, 0.019744070314821633, 0.0031874994561076164, -0.06352464407255563, -0.12240866219624877, -0.1713738854182884, 0.27444720436198017, 0.054466944218923646, 0.3224600780941546, 0.08650062511985501, 0.0164182104387631, -0.027612633863464, 0.13004347802663688, -0.04340459240445246, -0.16101737260090887, 0.019259879785070856, 0.30085966088498634, -0.08251574123899141, 0.22889217033982276, -0.4771830277889967, -0.26117488843699294, 0.013183650880431136, 0.11290081513114274, 0.1616414309067962, -0.06570020387958114, -0.2912454340451707, 0.020089130904525517, -0.1167761999477322, -0.1288675617131715, -0.04140338367782533, -0.0062756655861934026, -0.028396665199349323, -0.21916130576981233, 0.11981969640823081, 0.02626304204110056, 0.05970757489325479, -0.10954944902798161, -0.04438762406352907, -0.07353723110941549, 0.017166193497056764, 0.04462316163505117, 0.12327542716326813, 0.16929707854365308, -0.10115247014056271, -0.08884478475277623, 0.34494182406614227, -0.0725494900221626, 0.014289178581287464, 0.1958122661244124, -0.25110174917266703, -0.05246790075053771, 0.27386382382983965, 0.07206435004249215, 0.10946099927959342, -0.09696889895130881, 0.04964557399740443, 0.03091334789613029, 0.239833957614804, 0.07171014604934801, 0.10948721882887184, 0.258277292996645, 0.26352356432160984, 0.01840974872931838, 0.11564381017660101, -0.13464936531769733, -0.05631505080498755, -0.20674232901384434, -0.12302744858898222, -0.2349195868993411, 0.10457661257319463, 0.004773868952761404, -0.19654720587966343, 0.394819774357602, 0.1368370739199842, 0.1814815463963896, -0.042128892979429414, 0.2692521689653707, 0.11591499129155029, 0.046847691284589627, 0.005777669157056759, 0.28040947573414693, 0.14557301037013531, 0.13824344637221656, -0.2772662027219, 0.09443771605069438, -0.016750631026613217]
|
1,803.0519
|
Higher order concentration in presence of Poincar\'e-type inequalities
|
We show sharpened forms of the concentration of measure phenomenon typically
centered at stochastic expansions of order $d-1$ for any $d \in \mathbb{N}$.
Here we focus on differentiable functions on the Euclidean space in presence of
a Poincar\'e-type inequality. The bounds are based on $d$-th order derivatives.
|
math.PR
|
we show sharpened forms of the concentration of measure phenomenon typically centered at stochastic expansions of order d1 for any d in mathbbn here we focus on differentiable functions on the euclidean space in presence of a poincaretype inequality the bounds are based on dth order derivatives
|
[['we', 'show', 'sharpened', 'forms', 'of', 'the', 'concentration', 'of', 'measure', 'phenomenon', 'typically', 'centered', 'at', 'stochastic', 'expansions', 'of', 'order', 'd1', 'for', 'any', 'd', 'in', 'mathbbn', 'here', 'we', 'focus', 'on', 'differentiable', 'functions', 'on', 'the', 'euclidean', 'space', 'in', 'presence', 'of', 'a', 'poincaretype', 'inequality', 'the', 'bounds', 'are', 'based', 'on', 'dth', 'order', 'derivatives']]
|
[-0.15468615356912005, 0.06546482392289538, -0.05843924985643714, 0.07196574705712339, -0.053222691323211856, -0.07563138466843582, 0.02877250747715539, 0.34080836842668816, -0.23320044525601763, -0.19948798943152454, 0.15210964678826325, -0.3156235421576755, -0.16823383519782664, 0.19242153564428396, -0.0680933502611724, 0.03629774998556426, -0.05931941150350774, 0.10948877191131419, -0.13713120701326492, -0.2836056472535463, 0.37671627017094733, -0.06973424241964785, 0.20701857310462188, 0.07516522206207539, 0.11720682919382099, -0.007371083228908321, -0.002938807268250496, -0.024584195171012246, -0.21494571383091363, 0.1841796819675476, 0.18262334595969382, 0.07300298599070533, 0.31150155637334004, -0.41655179969173795, -0.1731607900496493, 0.17535636224288573, 0.12858273291977698, 0.001154122438202513, 3.323418910595331e-05, -0.2681873251703825, 0.040329323665417256, -0.05874517982072653, -0.1537652957312604, -0.0866983148784555, 0.03156278388416196, 0.07067568157304158, -0.3273513081701512, 0.10015995654852149, 0.10262912357265645, 0.09632829342909316, -0.06879647822178742, -0.1533541994843077, 0.00261276577936208, 0.018317889342916772, -0.022945542324413645, 0.0347249943941356, 0.0777256832993094, -0.04163389349792232, -0.10559710002246689, 0.30603929252383555, -0.13895033619445848, -0.2810401822588322, 0.11354797960140128, -0.28323512807726225, -0.20562136600269598, 0.07002951743754934, 0.22986444142310225, 0.19516791024819968, -0.059434633266101496, 0.18704233358198025, -0.024620666713552907, 0.16314613498113256, 0.15579775220496542, 0.08137420719449824, 0.0986517425131132, 0.09484720222176389, 0.13737538110147765, 0.14402063696229078, -0.05332716578677138, -0.08101576515176195, -0.38030110466036393, -0.1590849425088852, -0.2533002887317475, 0.059761722572147846, -0.17698795759574848, -0.16824740436710814, 0.306617830255802, 0.08815756828543987, 0.18067182156633824, 0.10560251683234534, 0.21830005087751023, 0.147912895207868, 0.041874053613084584, 0.05468203047131921, 0.147580863630518, 0.12468384142885817, 0.031502502009351833, -0.12336454834749407, 0.08787145011840349, 0.18561437916248402]
|
1,803.05191
|
Two-variable polynomial invariants of virtual knots arising from flat
virtual knot invariants
|
We introduce two sequences of two-variable polynomials $\{ L^n_K (t,
\ell)\}_{n=1}^{\infty}$ and $\{ F^n_K (t, \ell)\}_{n=1}^{\infty}$, expressed in
terms of index value of a crossing and $n$-dwrithe value of a virtual knot $K$,
where $t$ and $\ell$ are variables. Basing on the fact that $n$-dwrithe is a
flat virtual knot invariant we prove that $L^n_K$ and $F^n_K$ are virtual knot
invariants containing Kauffman affine index polynomial as a particular case.
Using $L^n_K$ we give sufficient conditions when virtual knot does not admit
cosmetic crossing change.
|
math.GT
|
we introduce two sequences of twovariable polynomials ln_k t ell_n1infty and fn_k t ell_n1infty expressed in terms of index value of a crossing and ndwrithe value of a virtual knot k where t and ell are variables basing on the fact that ndwrithe is a flat virtual knot invariant we prove that ln_k and fn_k are virtual knot invariants containing kauffman affine index polynomial as a particular case using ln_k we give sufficient conditions when virtual knot does not admit cosmetic crossing change
|
[['we', 'introduce', 'two', 'sequences', 'of', 'twovariable', 'polynomials', 'ln_k', 't', 'ell_n1infty', 'and', 'fn_k', 't', 'ell_n1infty', 'expressed', 'in', 'terms', 'of', 'index', 'value', 'of', 'a', 'crossing', 'and', 'ndwrithe', 'value', 'of', 'a', 'virtual', 'knot', 'k', 'where', 't', 'and', 'ell', 'are', 'variables', 'basing', 'on', 'the', 'fact', 'that', 'ndwrithe', 'is', 'a', 'flat', 'virtual', 'knot', 'invariant', 'we', 'prove', 'that', 'ln_k', 'and', 'fn_k', 'are', 'virtual', 'knot', 'invariants', 'containing', 'kauffman', 'affine', 'index', 'polynomial', 'as', 'a', 'particular', 'case', 'using', 'ln_k', 'we', 'give', 'sufficient', 'conditions', 'when', 'virtual', 'knot', 'does', 'not', 'admit', 'cosmetic', 'crossing', 'change']]
|
[-0.27092918778380637, 0.16195355140002846, -0.11967537034585883, 0.07578170022638396, -0.11240056513726146, -0.2113105102347894, 0.03442158792580513, 0.34700064366989875, -0.28302023265086396, -0.2782685138311685, 0.060629127887549185, -0.18489231895419617, -0.1851506165547084, 0.15808783973791177, -0.11471077314094652, -0.019552601507240083, 0.04421013787601002, 0.12016201144249379, -0.060514001753417, -0.241929552196584, 0.3470427491525306, -0.09771773516188693, 0.148632013180022, 0.09142382988776965, 0.10676090505351371, 0.035794260752493444, -0.006575828816010793, 0.03172130886718772, -0.201630610631686, 0.04482327204763512, 0.2669262739481947, 0.10333435541855855, 0.13400863221834733, -0.33464581069029586, -0.07309924081981747, 0.20659414858003206, 0.14064594660001464, -0.055918165535630684, 0.03781013142559206, -0.2084706843789384, 0.10810346112739813, -0.14911706655144785, -0.16102951854950737, -0.049492949926400485, 0.06493870428279985, 0.02414004463198465, -0.2504260333408189, 0.029244911963049368, 0.04942062048571585, 0.12771106675220065, 0.02640413219415689, -0.13747568358961917, -0.03988360990239661, 0.09637273144738784, -0.023635177145110844, 0.07641706286776292, 0.08948912956056339, -0.1364990520538597, -0.16688669633261766, 0.35969487304174447, -0.08372891558145609, -0.2502788209556779, 0.11634993928637874, -0.1430807150782475, -0.21507908940268092, 0.17789152111928863, 0.06674627564800313, 0.14469702570710943, 0.0002186451410459166, 0.16385205794727029, -0.15378269725302351, 0.11059016814526124, 0.1651793524882273, -0.009091134383519994, 0.10126711594388832, -0.012999065638861702, 0.036142782602883596, 0.19561893094472493, -0.026774012580914778, -0.06383774457853052, -0.3650005608325518, -0.26920472710876714, -0.14718862776821362, 0.12402521045838005, -0.10335127347299264, -0.1849823281923427, 0.358536326196752, 0.004744988300283498, 0.18897106453682047, 0.15527278879256565, 0.23326205337844505, 0.12885023302861337, 0.0334515650240893, 0.11908080833197772, 0.06752631975385019, 0.11463119886532615, 0.02068090619507564, -0.11438598405404747, 0.04245895287611439, 0.20679144143374473]
|
1,803.05192
|
Real-time Cardiovascular MR with Spatio-temporal Artifact Suppression
using Deep Learning - Proof of Concept in Congenital Heart Disease
|
PURPOSE: Real-time assessment of ventricular volumes requires high
acceleration factors. Residual convolutional neural networks (CNN) have shown
potential for removing artifacts caused by data undersampling. In this study we
investigated the effect of different radial sampling patterns on the accuracy
of a CNN. We also acquired actual real-time undersampled radial data in
patients with congenital heart disease (CHD), and compare CNN reconstruction to
Compressed Sensing (CS).
METHODS: A 3D (2D plus time) CNN architecture was developed, and trained
using 2276 gold-standard paired 3D data sets, with 14x radial undersampling.
Four sampling schemes were tested, using 169 previously unseen 3D 'synthetic'
test data sets. Actual real-time tiny Golden Angle (tGA) radial SSFP data was
acquired in 10 new patients (122 3D data sets), and reconstructed using the 3D
CNN as well as a CS algorithm; GRASP.
RESULTS: Sampling pattern was shown to be important for image quality, and
accurate visualisation of cardiac structures. For actual real-time data,
overall reconstruction time with CNN (including creation of aliased images) was
shown to be more than 5x faster than GRASP. Additionally, CNN image quality and
accuracy of biventricular volumes was observed to be superior to GRASP for the
same raw data.
CONCLUSION: This paper has demonstrated the potential for the use of a 3D CNN
for deep de-aliasing of real-time radial data, within the clinical setting.
Clinical measures of ventricular volumes using real-time data with CNN
reconstruction are not statistically significantly different from the
gold-standard, cardiac gated, BH techniques.
|
cs.CV cs.NE
|
purpose realtime assessment of ventricular volumes requires high acceleration factors residual convolutional neural networks cnn have shown potential for removing artifacts caused by data undersampling in this study we investigated the effect of different radial sampling patterns on the accuracy of a cnn we also acquired actual realtime undersampled radial data in patients with congenital heart disease chd and compare cnn reconstruction to compressed sensing cs methods a 3d 2d plus time cnn architecture was developed and trained using 2276 goldstandard paired 3d data sets with 14x radial undersampling four sampling schemes were tested using 169 previously unseen 3d synthetic test data sets actual realtime tiny golden angle tga radial ssfp data was acquired in 10 new patients 122 3d data sets and reconstructed using the 3d cnn as well as a cs algorithm grasp results sampling pattern was shown to be important for image quality and accurate visualisation of cardiac structures for actual realtime data overall reconstruction time with cnn including creation of aliased images was shown to be more than 5x faster than grasp additionally cnn image quality and accuracy of biventricular volumes was observed to be superior to grasp for the same raw data conclusion this paper has demonstrated the potential for the use of a 3d cnn for deep dealiasing of realtime radial data within the clinical setting clinical measures of ventricular volumes using realtime data with cnn reconstruction are not statistically significantly different from the goldstandard cardiac gated bh techniques
|
[['purpose', 'realtime', 'assessment', 'of', 'ventricular', 'volumes', 'requires', 'high', 'acceleration', 'factors', 'residual', 'convolutional', 'neural', 'networks', 'cnn', 'have', 'shown', 'potential', 'for', 'removing', 'artifacts', 'caused', 'by', 'data', 'undersampling', 'in', 'this', 'study', 'we', 'investigated', 'the', 'effect', 'of', 'different', 'radial', 'sampling', 'patterns', 'on', 'the', 'accuracy', 'of', 'a', 'cnn', 'we', 'also', 'acquired', 'actual', 'realtime', 'undersampled', 'radial', 'data', 'in', 'patients', 'with', 'congenital', 'heart', 'disease', 'chd', 'and', 'compare', 'cnn', 'reconstruction', 'to', 'compressed', 'sensing', 'cs', 'methods', 'a', '3d', '2d', 'plus', 'time', 'cnn', 'architecture', 'was', 'developed', 'and', 'trained', 'using', '2276', 'goldstandard', 'paired', '3d', 'data', 'sets', 'with', '14x', 'radial', 'undersampling', 'four', 'sampling', 'schemes', 'were', 'tested', 'using', '169', 'previously', 'unseen', '3d', 'synthetic', 'test', 'data', 'sets', 'actual', 'realtime', 'tiny', 'golden', 'angle', 'tga', 'radial', 'ssfp', 'data', 'was', 'acquired', 'in', '10', 'new', 'patients', '122', '3d', 'data', 'sets', 'and', 'reconstructed', 'using', 'the', '3d', 'cnn', 'as', 'well', 'as', 'a', 'cs', 'algorithm', 'grasp', 'results', 'sampling', 'pattern', 'was', 'shown', 'to', 'be', 'important', 'for', 'image', 'quality', 'and', 'accurate', 'visualisation', 'of', 'cardiac', 'structures', 'for', 'actual', 'realtime', 'data', 'overall', 'reconstruction', 'time', 'with', 'cnn', 'including', 'creation', 'of', 'aliased', 'images', 'was', 'shown', 'to', 'be', 'more', 'than', '5x', 'faster', 'than', 'grasp', 'additionally', 'cnn', 'image', 'quality', 'and', 'accuracy', 'of', 'biventricular', 'volumes', 'was', 'observed', 'to', 'be', 'superior', 'to', 'grasp', 'for', 'the', 'same', 'raw', 'data', 'conclusion', 'this', 'paper', 'has', 'demonstrated', 'the', 'potential', 'for', 'the', 'use', 'of', 'a', '3d', 'cnn', 'for', 'deep', 'dealiasing', 'of', 'realtime', 'radial', 'data', 'within', 'the', 'clinical', 'setting', 'clinical', 'measures', 'of', 'ventricular', 'volumes', 'using', 'realtime', 'data', 'with', 'cnn', 'reconstruction', 'are', 'not', 'statistically', 'significantly', 'different', 'from', 'the', 'goldstandard', 'cardiac', 'gated', 'bh', 'techniques']]
|
[-0.01056394628795548, -0.0021734338595854994, -0.04425889388895689, 0.08198427252414427, -0.058276948992314996, -0.18182861610904943, 0.005963044739518391, 0.46526188725719647, -0.21039089265146427, -0.34961046010982816, 0.11374903423474075, -0.26597789976821873, -0.14256737676202033, 0.23362158068018604, -0.14808207902088, 0.1535240634306505, 0.18446008995726554, 0.012235067558607884, -0.09221592066543442, -0.28207359525745695, 0.23040375019879822, 0.07255497459519407, 0.3729550335100111, -0.043689209885173004, 0.11628790160508028, -0.0351968923526607, -0.08094996683185501, 0.0122013896570674, -0.05977022756480289, 0.14435935143847017, 0.29275413849866205, 0.19875594985918427, 0.25567302545687015, -0.4400689835869232, -0.23877991286619585, 0.06020742967078576, 0.14740357744621532, 0.10609219772931264, -0.04796982470463857, -0.3621186026429035, 0.107659874784247, -0.13319662336963323, -0.015547820911457648, -0.13399317231865562, -0.020631496522252504, -0.03172513416740207, -0.31907876626379333, 0.1285248421406972, -0.04504876362257257, 0.1450200455168224, -0.1154022150045755, -0.1178854307582678, -0.014191413544384496, 0.16676445444475632, -0.005449510680283515, 0.11040607211560163, 0.15885964639636935, -0.1591324821399639, -0.12065059305073655, 0.3650811937390542, -0.01715665851037816, -0.17892091324818984, 0.18754528496338396, -0.11414559778985472, -0.09824473497324757, 0.18739194026768055, 0.22421256878546306, 0.059465370163777655, -0.18815224159280863, -0.04819682278142938, 0.0020150021141471, 0.18241957222320596, 0.09017455761739034, -0.04253455739924494, 0.12786750340767736, 0.2452754959159968, -0.04377077186043013, 0.1082668385525443, -0.262506192359047, 0.010161989367072832, -0.13339457574956196, -0.10654613858852678, -0.1941607222569232, -0.03185706595143028, -0.11554826042627944, -0.15296465258781647, 0.406351453186564, 0.1938712476771705, 0.1924555654656522, 0.06217657596642646, 0.3733986742110277, -0.004420484634762516, 0.15470584726379233, 0.042037437320211715, 0.17833516350329606, 0.016965016687160585, 0.14858636416789447, -0.17257315775389043, 0.06876858683036906, 0.043123241796215274]
|
1,803.05193
|
Approximation of quantum control correction scheme using deep neural
networks
|
We study the functional relationship between quantum control pulses in the
idealized case and the pulses in the presence of an unwanted drift. We show
that a class of artificial neural networks called LSTM is able to model this
functional relationship with high efficiency, and hence the correction scheme
required to counterbalance the effect of the drift. Our solution allows
studying the mapping from quantum control pulses to system dynamics and then
analysing the robustness of the latter against local variations in the control
profile.
|
quant-ph cs.LG
|
we study the functional relationship between quantum control pulses in the idealized case and the pulses in the presence of an unwanted drift we show that a class of artificial neural networks called lstm is able to model this functional relationship with high efficiency and hence the correction scheme required to counterbalance the effect of the drift our solution allows studying the mapping from quantum control pulses to system dynamics and then analysing the robustness of the latter against local variations in the control profile
|
[['we', 'study', 'the', 'functional', 'relationship', 'between', 'quantum', 'control', 'pulses', 'in', 'the', 'idealized', 'case', 'and', 'the', 'pulses', 'in', 'the', 'presence', 'of', 'an', 'unwanted', 'drift', 'we', 'show', 'that', 'a', 'class', 'of', 'artificial', 'neural', 'networks', 'called', 'lstm', 'is', 'able', 'to', 'model', 'this', 'functional', 'relationship', 'with', 'high', 'efficiency', 'and', 'hence', 'the', 'correction', 'scheme', 'required', 'to', 'counterbalance', 'the', 'effect', 'of', 'the', 'drift', 'our', 'solution', 'allows', 'studying', 'the', 'mapping', 'from', 'quantum', 'control', 'pulses', 'to', 'system', 'dynamics', 'and', 'then', 'analysing', 'the', 'robustness', 'of', 'the', 'latter', 'against', 'local', 'variations', 'in', 'the', 'control', 'profile']]
|
[-0.12849278407280937, 0.06318061127317111, -0.0872260114945033, 0.06572469962651238, -0.019897956225801917, -0.12985394362031538, 0.05469221282092964, 0.3867429709609817, -0.3176875072367051, -0.3211112484445467, 0.06562427749090335, -0.25752304145699945, -0.21188037656247616, 0.17748717076473813, -0.07951363509740023, 0.07150350989335601, 0.023183773840120173, -0.021340341781101682, -0.02144556555979173, -0.19502326142152443, 0.28962859053931694, 0.08341686014250359, 0.31900576243505757, 0.019318785934763796, 0.13200236235690468, 0.006034648125333821, 0.0004446224884732681, 0.009275837560348651, -0.07714323063752518, 0.1334397183813374, 0.18948657112743925, 0.06958927466150593, 0.29765392190174145, -0.46113493677009554, -0.2424432935193181, 0.10785954546402482, 0.10196271715959644, 0.15277988770428827, -0.06155279826865915, -0.28130183554911875, 0.0963372098391547, -0.1674257091301329, -0.1224476010483854, -0.07560288716545877, 0.012016474543248905, 0.05187444258001907, -0.2722374364268035, 0.049971228339435424, 0.06908784904243315, 0.025680418641251677, -0.09352925280177528, 0.022409960272831514, 0.004845787006813813, 0.16366323610110317, 0.021817254325758446, 0.012965354512390845, 0.13751262223128888, -0.17000850176383905, -0.10078266856315381, 0.3404128544470843, -0.11046289566575604, -0.22440927405841649, 0.18311335065347306, -0.12535087321063174, -0.08462557653513025, 0.09667627993313706, 0.1812022199963822, 0.10256280001691159, -0.1462785855264348, 0.026423931410125293, 0.033512056870933844, 0.21120348430293448, 0.015060632621102474, 0.03290454137741643, 0.16183825190562537, 0.17702214495991084, 0.09592921342700719, 0.17714537665357485, -0.13208001056576477, -0.12968879061586716, -0.28961383130620505, -0.11836735276395784, -0.1274672173182754, 0.02754415680161294, -0.0638599024313461, -0.1467068229089765, 0.43907863461452723, 0.2147339492050164, 0.15014168267302652, 0.05979648114675108, 0.31346939052729045, 0.13394808550776147, 0.06568580659873345, 0.04689435972010388, 0.22479682826601408, 0.1594025003203355, 0.08621184740434674, -0.3218881798552021, 0.08617648879504379, 0.011992855315261028]
|
1,803.05194
|
Semisimple pointed isogeny graphs for abelian varieties
|
In this paper we show that if $\phi_{i}:A_{i}\rightarrow{A}$ is a semisimple
pointed $K$-rational $\ell$-isogeny graph of order $n$ for a prime $\ell$, then
the group of $\ell$-torsion points $A[\ell](\overline{K})$ contains a subspace
of dimension $n$ generated by $K$-rational points. We also show that the same
result is true for elliptic curves without the semisimplicity condition.
Furthermore, we give an explicit counterexample for abelian varieties of higher
dimension to show that the semisimplicity condition is indeed necessary.
|
math.AG
|
in this paper we show that if phi_ia_irightarrowa is a semisimple pointed krational ellisogeny graph of order n for a prime ell then the group of elltorsion points aelloverlinek contains a subspace of dimension n generated by krational points we also show that the same result is true for elliptic curves without the semisimplicity condition furthermore we give an explicit counterexample for abelian varieties of higher dimension to show that the semisimplicity condition is indeed necessary
|
[['in', 'this', 'paper', 'we', 'show', 'that', 'if', 'phi_ia_irightarrowa', 'is', 'a', 'semisimple', 'pointed', 'krational', 'ellisogeny', 'graph', 'of', 'order', 'n', 'for', 'a', 'prime', 'ell', 'then', 'the', 'group', 'of', 'elltorsion', 'points', 'aelloverlinek', 'contains', 'a', 'subspace', 'of', 'dimension', 'n', 'generated', 'by', 'krational', 'points', 'we', 'also', 'show', 'that', 'the', 'same', 'result', 'is', 'true', 'for', 'elliptic', 'curves', 'without', 'the', 'semisimplicity', 'condition', 'furthermore', 'we', 'give', 'an', 'explicit', 'counterexample', 'for', 'abelian', 'varieties', 'of', 'higher', 'dimension', 'to', 'show', 'that', 'the', 'semisimplicity', 'condition', 'is', 'indeed', 'necessary']]
|
[-0.22159065501261, 0.0785630633907056, -0.12480362941435463, 0.08217250674371482, -0.10902848811442586, -0.16600919772266737, 0.011435262306681456, 0.3246163136602656, -0.2707370048187472, -0.19532030044010262, 0.07362235303987069, -0.24045912719432366, -0.1808181736379157, 0.22223943319624742, -0.14586587006075158, -0.022697306920874964, 0.08988221174080831, 0.15239332998926575, -0.046538460244600836, -0.3842021781133922, 0.4403779981406154, -0.06162215750412764, 0.21882562260017605, 0.09731068965551015, 0.12281865690759308, 0.018279404347963834, 0.041179495687420305, 0.0010569888746013512, -0.1583715743192344, 0.073133562370581, 0.2957442056991764, 0.09787811822811696, 0.2149348501871164, -0.339535769553402, -0.12698662440871467, 0.2643470524596302, 0.1444353127814326, 0.05534091274681929, -0.03557660235595461, -0.20436667153813146, 0.23050970633237347, -0.12951155301384829, -0.21005477916096915, -0.09264658985193819, 0.10942415506704836, -0.050696696972826846, -0.3356258159855733, -0.024690318233223405, 0.1646238104817835, 0.17378004399958896, -0.029428330604836496, -0.09392993128858507, -0.06857837632147444, 0.03842339380581335, -0.016569539102272608, 0.03689159273729987, 0.022440878139506723, -0.1014981560744943, -0.10448886002917346, 0.364332719366192, -0.05401928222744499, -0.19078763347823877, 0.08866593852085439, -0.17287821822950766, -0.17235634483340373, 0.14718710104746088, 0.06665703646737982, 0.13998784409282175, -0.00648159858443447, 0.1862274194136262, -0.1845802667651426, 0.13906753606892922, 0.09364294216848558, -0.034424552951964574, 0.07195056259405573, 0.05430837911301972, 0.15945483050686685, 0.1376515650583708, 0.0010055321696642284, 0.06598095036413823, -0.4324872114418729, -0.2052812622608365, -0.1733723401494727, 0.15387507076249332, -0.1145692854392896, -0.1299227851166113, 0.3604379299449155, 0.13185091627560355, 0.19384401545834704, 0.11799833030012008, 0.2299005707074586, 0.0708928313609716, 0.011977513880796126, 0.12547647154487268, 0.12898403612544407, 0.16288542324312133, -0.09730084628697384, -0.12554688405597936, -0.031201508125869203, 0.21272764838225133]
|
1,803.05195
|
Finite amplitude transverse oscillations of a magnetic rope
|
The effects of finite amplitudes on the transverse oscillations of a
quiescent prominence represented by a magnetic rope are investigated in terms
of the model proposed by Kolotkov et al. 2016. We consider a weakly nonlinear
case governed by a quadratic nonlinearity, and also analyse the fully nonlinear
equations of motion. We treat the prominence as a massive line current located
above the photosphere and interacting with the magnetised dipped environment
via the Lorentz force. In this concept the magnetic dip is produced by two
external current sources located at the photosphere. Finite amplitude
horizontal and vertical oscillations are found to be strongly coupled between
each other. The coupling is more efficient for larger amplitudes and smaller
attack angles between the direction of the driver and the horizontal axis.
Spatial structure of oscillations is represented by Lissajous-like curves with
the limit cycle of a hourglass shape, appearing in the resonant case, when the
frequency of the vertical mode is twice the horizontal mode frequency. A
metastable equilibrium of the prominence is revealed, which is stable for small
amplitude displacements, and becomes horizontally unstable, when the amplitude
exceeds a threshold value. The maximum oscillation amplitudes are also
analytically derived and analysed. Typical oscillation periods are determined
by the oscillation amplitude, prominence current, its mass and position above
the photosphere, and the parameters of the magnetic dip. The main new effects
of the finite amplitude are the coupling of the horizontally and vertically
polarised transverse oscillations (i.e. the lack of a simple, elliptically
polarised regime) and the presence of metastable equilibria of prominences.
|
astro-ph.SR
|
the effects of finite amplitudes on the transverse oscillations of a quiescent prominence represented by a magnetic rope are investigated in terms of the model proposed by kolotkov et al 2016 we consider a weakly nonlinear case governed by a quadratic nonlinearity and also analyse the fully nonlinear equations of motion we treat the prominence as a massive line current located above the photosphere and interacting with the magnetised dipped environment via the lorentz force in this concept the magnetic dip is produced by two external current sources located at the photosphere finite amplitude horizontal and vertical oscillations are found to be strongly coupled between each other the coupling is more efficient for larger amplitudes and smaller attack angles between the direction of the driver and the horizontal axis spatial structure of oscillations is represented by lissajouslike curves with the limit cycle of a hourglass shape appearing in the resonant case when the frequency of the vertical mode is twice the horizontal mode frequency a metastable equilibrium of the prominence is revealed which is stable for small amplitude displacements and becomes horizontally unstable when the amplitude exceeds a threshold value the maximum oscillation amplitudes are also analytically derived and analysed typical oscillation periods are determined by the oscillation amplitude prominence current its mass and position above the photosphere and the parameters of the magnetic dip the main new effects of the finite amplitude are the coupling of the horizontally and vertically polarised transverse oscillations ie the lack of a simple elliptically polarised regime and the presence of metastable equilibria of prominences
|
[['the', 'effects', 'of', 'finite', 'amplitudes', 'on', 'the', 'transverse', 'oscillations', 'of', 'a', 'quiescent', 'prominence', 'represented', 'by', 'a', 'magnetic', 'rope', 'are', 'investigated', 'in', 'terms', 'of', 'the', 'model', 'proposed', 'by', 'kolotkov', 'et', 'al', '2016', 'we', 'consider', 'a', 'weakly', 'nonlinear', 'case', 'governed', 'by', 'a', 'quadratic', 'nonlinearity', 'and', 'also', 'analyse', 'the', 'fully', 'nonlinear', 'equations', 'of', 'motion', 'we', 'treat', 'the', 'prominence', 'as', 'a', 'massive', 'line', 'current', 'located', 'above', 'the', 'photosphere', 'and', 'interacting', 'with', 'the', 'magnetised', 'dipped', 'environment', 'via', 'the', 'lorentz', 'force', 'in', 'this', 'concept', 'the', 'magnetic', 'dip', 'is', 'produced', 'by', 'two', 'external', 'current', 'sources', 'located', 'at', 'the', 'photosphere', 'finite', 'amplitude', 'horizontal', 'and', 'vertical', 'oscillations', 'are', 'found', 'to', 'be', 'strongly', 'coupled', 'between', 'each', 'other', 'the', 'coupling', 'is', 'more', 'efficient', 'for', 'larger', 'amplitudes', 'and', 'smaller', 'attack', 'angles', 'between', 'the', 'direction', 'of', 'the', 'driver', 'and', 'the', 'horizontal', 'axis', 'spatial', 'structure', 'of', 'oscillations', 'is', 'represented', 'by', 'lissajouslike', 'curves', 'with', 'the', 'limit', 'cycle', 'of', 'a', 'hourglass', 'shape', 'appearing', 'in', 'the', 'resonant', 'case', 'when', 'the', 'frequency', 'of', 'the', 'vertical', 'mode', 'is', 'twice', 'the', 'horizontal', 'mode', 'frequency', 'a', 'metastable', 'equilibrium', 'of', 'the', 'prominence', 'is', 'revealed', 'which', 'is', 'stable', 'for', 'small', 'amplitude', 'displacements', 'and', 'becomes', 'horizontally', 'unstable', 'when', 'the', 'amplitude', 'exceeds', 'a', 'threshold', 'value', 'the', 'maximum', 'oscillation', 'amplitudes', 'are', 'also', 'analytically', 'derived', 'and', 'analysed', 'typical', 'oscillation', 'periods', 'are', 'determined', 'by', 'the', 'oscillation', 'amplitude', 'prominence', 'current', 'its', 'mass', 'and', 'position', 'above', 'the', 'photosphere', 'and', 'the', 'parameters', 'of', 'the', 'magnetic', 'dip', 'the', 'main', 'new', 'effects', 'of', 'the', 'finite', 'amplitude', 'are', 'the', 'coupling', 'of', 'the', 'horizontally', 'and', 'vertically', 'polarised', 'transverse', 'oscillations', 'ie', 'the', 'lack', 'of', 'a', 'simple', 'elliptically', 'polarised', 'regime', 'and', 'the', 'presence', 'of', 'metastable', 'equilibria', 'of', 'prominences']]
|
[-0.1912079970329964, 0.2534163831410786, -0.001022405351082293, 0.06763297519825685, -0.057915668483250415, -0.08513857766609782, 0.028740326458444963, 0.35714989067771685, -0.2456726018876697, -0.2937832920919531, 0.07978661464160093, -0.2363659157472564, -0.10732379468748919, 0.21074784924186624, 0.022125338937173812, -0.004472826024553237, 0.052306307303772955, 0.029376733754403316, -0.01329062405319956, -0.16569744755084126, 0.31071681489791864, 0.04522809549413908, 0.2898688979061822, -0.0033609545968759516, 0.08268061514155796, -0.027318629605444865, -0.0013021000302754916, 0.0451601964672311, -0.09412276306247805, 0.04763006953916584, 0.15678731070455307, 0.017692847484991385, 0.225397959395867, -0.4131528737453314, -0.19140141298233246, 0.06473772324657498, 0.16335127535679092, 0.09542290353431152, 0.02077688023301352, -0.26708638123594797, 0.03876763565035967, -0.09657777689057044, -0.19259122685851673, 0.01960769879157082, 0.056287649740429165, 0.04419845221295523, -0.2563503503765857, 0.12715693660899818, 0.0517298100581124, 0.0876469260171199, -0.057657733858258536, -0.07296333640383987, -0.1058485822349142, 0.07866980129105146, 0.06917342008095707, 0.042930022321748904, 0.16535255739357896, -0.13273519036592915, -0.052297453742581775, 0.33771581815224355, -0.09908231740432362, -0.15379680633274032, 0.14416543245539426, -0.1897794702493299, -0.04181365330452816, 0.17750028198441634, 0.14821243725287225, 0.10477163648107447, -0.09878422850731743, 0.04857300038700207, -0.0246057499683677, 0.15510786252024655, 0.10921234136554771, -0.00953422284935816, 0.27667411198266423, 0.14959230975006133, 0.04122125778454714, 0.14633059460119022, -0.16186964326502326, -0.08789462194567582, -0.2887346623143038, -0.0506278555177582, -0.10124557120165824, 0.013128399060448059, -0.06117320237977905, -0.19335385170886113, 0.4205602787238044, 0.07171990083029064, 0.21882302650572874, -0.006843382198488913, 0.32874449907282655, 0.16468435670383488, 0.04222433163416169, 0.10760338187056522, 0.32261260473527587, 0.2121991676547063, 0.1291318338131532, -0.27367934702913493, 0.03671645685278166, 0.0318524313168242]
|
1,803.05196
|
EdgeStereo: A Context Integrated Residual Pyramid Network for Stereo
Matching
|
Recent convolutional neural networks, especially end-to-end disparity
estimation models, achieve remarkable performance on stereo matching task.
However, existed methods, even with the complicated cascade structure, may fail
in the regions of non-textures, boundaries and tiny details. Focus on these
problems, we propose a multi-task network EdgeStereo that is composed of a
backbone disparity network and an edge sub-network. Given a binocular image
pair, our model enables end-to-end prediction of both disparity map and edge
map. Basically, we design a context pyramid to encode multi-scale context
information in disparity branch, followed by a compact residual pyramid for
cascaded refinement. To further preserve subtle details, our EdgeStereo model
integrates edge cues by feature embedding and edge-aware smoothness loss
regularization. Comparative results demonstrates that stereo matching and edge
detection can help each other in the unified model. Furthermore, our method
achieves state-of-art performance on both KITTI Stereo and Scene Flow
benchmarks, which proves the effectiveness of our design.
|
cs.CV
|
recent convolutional neural networks especially endtoend disparity estimation models achieve remarkable performance on stereo matching task however existed methods even with the complicated cascade structure may fail in the regions of nontextures boundaries and tiny details focus on these problems we propose a multitask network edgestereo that is composed of a backbone disparity network and an edge subnetwork given a binocular image pair our model enables endtoend prediction of both disparity map and edge map basically we design a context pyramid to encode multiscale context information in disparity branch followed by a compact residual pyramid for cascaded refinement to further preserve subtle details our edgestereo model integrates edge cues by feature embedding and edgeaware smoothness loss regularization comparative results demonstrates that stereo matching and edge detection can help each other in the unified model furthermore our method achieves stateofart performance on both kitti stereo and scene flow benchmarks which proves the effectiveness of our design
|
[['recent', 'convolutional', 'neural', 'networks', 'especially', 'endtoend', 'disparity', 'estimation', 'models', 'achieve', 'remarkable', 'performance', 'on', 'stereo', 'matching', 'task', 'however', 'existed', 'methods', 'even', 'with', 'the', 'complicated', 'cascade', 'structure', 'may', 'fail', 'in', 'the', 'regions', 'of', 'nontextures', 'boundaries', 'and', 'tiny', 'details', 'focus', 'on', 'these', 'problems', 'we', 'propose', 'a', 'multitask', 'network', 'edgestereo', 'that', 'is', 'composed', 'of', 'a', 'backbone', 'disparity', 'network', 'and', 'an', 'edge', 'subnetwork', 'given', 'a', 'binocular', 'image', 'pair', 'our', 'model', 'enables', 'endtoend', 'prediction', 'of', 'both', 'disparity', 'map', 'and', 'edge', 'map', 'basically', 'we', 'design', 'a', 'context', 'pyramid', 'to', 'encode', 'multiscale', 'context', 'information', 'in', 'disparity', 'branch', 'followed', 'by', 'a', 'compact', 'residual', 'pyramid', 'for', 'cascaded', 'refinement', 'to', 'further', 'preserve', 'subtle', 'details', 'our', 'edgestereo', 'model', 'integrates', 'edge', 'cues', 'by', 'feature', 'embedding', 'and', 'edgeaware', 'smoothness', 'loss', 'regularization', 'comparative', 'results', 'demonstrates', 'that', 'stereo', 'matching', 'and', 'edge', 'detection', 'can', 'help', 'each', 'other', 'in', 'the', 'unified', 'model', 'furthermore', 'our', 'method', 'achieves', 'stateofart', 'performance', 'on', 'both', 'kitti', 'stereo', 'and', 'scene', 'flow', 'benchmarks', 'which', 'proves', 'the', 'effectiveness', 'of', 'our', 'design']]
|
[-0.08672642071829423, -0.03339124293176467, -0.07839308131185949, 0.03440199433297446, -0.09302910830899093, -0.17286635703318384, -0.0007923718305966375, 0.49053103601756065, -0.27917238243811116, -0.33614888594877956, 0.06911166871386261, -0.2649947936940742, -0.2529043858498163, 0.13790484922968685, -0.1723981125366041, 0.11540647205516794, 0.21078195811806885, -0.002426740465269081, -0.07916276908240673, -0.23064968494949617, 0.30057495771172016, 0.06100049969666686, 0.3881663234328459, 0.059781569151183295, 0.1424800915265223, -0.022134036401678856, -0.04079563554229313, 0.004046557095869885, -0.03638617676350757, 0.19220114558763607, 0.2607597583627658, 0.14987788924879983, 0.2747394830803387, -0.4457195769799383, -0.26765386477161784, 0.03653225431978507, 0.1653771761155344, 0.06126708605734166, -0.04147399776220003, -0.3398070064691925, 0.07524031924472901, -0.14391353000323043, 0.04618219138520592, -0.11443725789247669, -0.060885336602376286, -0.06515153815422836, -0.3293033626813619, 0.04354899032746049, 0.08911058924614305, 0.03254014848559899, -0.02576097522978671, -0.08355800889273125, -0.015888240742864775, 0.20001630716969407, -0.03762413085649697, 0.07016430406962938, 0.12499159784362603, -0.2176544212760698, -0.13248928077672117, 0.3369294598110412, -0.059721997410585904, -0.18703331729384923, 0.2067719831400992, -0.021635892739715546, -0.15623691473841686, 0.09247081528883427, 0.22224851394697143, 0.10009871296413046, -0.10608331541152438, -0.004091845469175544, -0.06646961286222856, 0.1943504152647955, 0.05880513483057975, 0.014813299162166291, 0.2027432086638567, 0.29711894456015314, 0.08622756960348373, 0.14371728506682158, -0.20138164049498491, -0.0809729887282868, -0.21361178628285415, -0.07566241350784701, -0.1717773187004863, -0.11325624463834653, -0.15019017528979212, -0.13974721016711555, 0.4406516962488623, 0.24190390437127607, 0.253793208251744, 0.10341710736975074, 0.3706362216295307, -0.0024771101613480007, 0.10928524428316833, 0.1001649891194048, 0.20946100914826324, 0.0031428634293230347, 0.08596911006890495, -0.17361430018162968, 0.07680651393189021, 0.14480560853323704]
|
1,803.05197
|
The Value of Reactive Power for Voltage Control in Lossy Networks
|
Reactive power has been proposed as a method of voltage control for
distribution networks, providing a means of increasing the amount of energy
transferred from distributed generators to the bulk transmission network. The
value of reactive power can therefore be measured according to an increase in
transferred energy, where the transferred energy is defined as the total
generated energy, less the total network losses. If network losses are ignored,
an error in the valuation of a given amount of reactive power will be observed
(leading to reactive power provision being under- or over-valued). The
non-linear analytic solution of a two-bus network is studied, and non-trivial
upper and lower bounds are determined for this `valuation error'. The
properties predicted by this two-bus network are demonstrated to hold on a
three-phase unbalanced distribution test feeder with good accuracy. This allows
for an analytic assessment of the importance of losses in the valuation of
reactive power in arbitrary networks.
|
math.OC cs.SY
|
reactive power has been proposed as a method of voltage control for distribution networks providing a means of increasing the amount of energy transferred from distributed generators to the bulk transmission network the value of reactive power can therefore be measured according to an increase in transferred energy where the transferred energy is defined as the total generated energy less the total network losses if network losses are ignored an error in the valuation of a given amount of reactive power will be observed leading to reactive power provision being under or overvalued the nonlinear analytic solution of a twobus network is studied and nontrivial upper and lower bounds are determined for this valuation error the properties predicted by this twobus network are demonstrated to hold on a threephase unbalanced distribution test feeder with good accuracy this allows for an analytic assessment of the importance of losses in the valuation of reactive power in arbitrary networks
|
[['reactive', 'power', 'has', 'been', 'proposed', 'as', 'a', 'method', 'of', 'voltage', 'control', 'for', 'distribution', 'networks', 'providing', 'a', 'means', 'of', 'increasing', 'the', 'amount', 'of', 'energy', 'transferred', 'from', 'distributed', 'generators', 'to', 'the', 'bulk', 'transmission', 'network', 'the', 'value', 'of', 'reactive', 'power', 'can', 'therefore', 'be', 'measured', 'according', 'to', 'an', 'increase', 'in', 'transferred', 'energy', 'where', 'the', 'transferred', 'energy', 'is', 'defined', 'as', 'the', 'total', 'generated', 'energy', 'less', 'the', 'total', 'network', 'losses', 'if', 'network', 'losses', 'are', 'ignored', 'an', 'error', 'in', 'the', 'valuation', 'of', 'a', 'given', 'amount', 'of', 'reactive', 'power', 'will', 'be', 'observed', 'leading', 'to', 'reactive', 'power', 'provision', 'being', 'under', 'or', 'overvalued', 'the', 'nonlinear', 'analytic', 'solution', 'of', 'a', 'twobus', 'network', 'is', 'studied', 'and', 'nontrivial', 'upper', 'and', 'lower', 'bounds', 'are', 'determined', 'for', 'this', 'valuation', 'error', 'the', 'properties', 'predicted', 'by', 'this', 'twobus', 'network', 'are', 'demonstrated', 'to', 'hold', 'on', 'a', 'threephase', 'unbalanced', 'distribution', 'test', 'feeder', 'with', 'good', 'accuracy', 'this', 'allows', 'for', 'an', 'analytic', 'assessment', 'of', 'the', 'importance', 'of', 'losses', 'in', 'the', 'valuation', 'of', 'reactive', 'power', 'in', 'arbitrary', 'networks']]
|
[-0.1430111728865692, 0.05206973801726305, -0.041702160716223985, 0.03425032032716375, -0.031064702320294693, -0.12280620015763606, 0.046707013923412144, 0.3670652963233013, -0.2753087824437385, -0.3292479003146768, 0.06466072609421247, -0.2628232866947469, -0.059746127689066224, 0.24276603524758217, -0.09045848395759001, 0.08653029704314227, 0.016211665104119442, 0.04901582883814207, -0.005366904043908924, -0.23179942443489265, 0.28262742033649163, 0.12603671064313787, 0.3309323994609981, 0.08584599934916835, 0.0880676444249753, -0.04526939940973161, 0.0011910610121095744, 0.05606539790157209, -0.08765276153392804, 0.15692864746177712, 0.25625472826560813, 0.09305828064232348, 0.3069043818932886, -0.4606188494258393, -0.24273646623493197, 0.14875126446042067, 0.08902427207571097, 0.04097515354470278, -0.03741713016717814, -0.20528760634195536, 0.12494556532086183, -0.23739250135781148, -0.08564149511631769, -0.0646646746690982, 0.006099931239777316, 0.07573212851555301, -0.32366039846779016, 0.03999915562916356, 0.022493471134788334, 0.0607939918407236, -0.07094135833045957, -0.09668660953190202, -0.08904728959374225, 0.14831028269019533, 0.027243232679887652, -0.013338223399701886, 0.15517299597223216, -0.13662574435614097, -0.0820531298687013, 0.37081533578487164, -0.04020612187182101, -0.20941418684919766, 0.09590438006256218, -0.07505734471114686, -0.04621283820448204, 0.1584859226609413, 0.2191750448113546, 0.08822209727375781, -0.1496850513996413, 0.03828291557594919, -0.01205522984636422, 0.16905128578909148, 0.06345473374061, 0.023038840842230294, 0.16027043009541023, 0.17300944572884758, 0.09995363371219868, 0.16869713388717708, -0.06212750055531684, -0.09146368777594314, -0.2617067579323283, -0.12021908091190152, -0.21882159993028602, 0.0839154163423257, -0.06422009347629799, -0.11698889673780052, 0.408382311087245, 0.10354491250771576, 0.19635875325482816, 0.08640713726456922, 0.3462209923055548, 0.19196901574748784, 0.06412021866223465, 0.09884297020452766, 0.23260901193134487, 0.09180688249687545, 0.10813240838559487, -0.20500531191907775, 0.1382625080146588, -0.007236326853625285]
|
1,803.05198
|
Enhancing Favorable Propagation in Cell-Free Massive MIMO Through
Spatial User Grouping
|
Cell-Free (CF) Massive multiple-input multiple-output(MIMO) is a distributed
antenna system, wherein a large number of back-haul linked access points
randomly distributed over a coverage area serve simultaneously a smaller number
of users. CF Massive MIMO inherits favorable propagation of Massive MIMO
systems. However, the level of favorable propagation which highly depends on
the network topology and environment may be hindered by user' spatial
correlation. In this paper, we investigate the impact of the network
configuration on the level of favorable propagation for a CF Massive MIMO
network. We formulate a user grouping and scheduling optimization problem that
leverages users' spatial diversity. The formulated design optimization problem
is proved to be NP-hard in general. To circumvent the prohibitively high
computational cost, we adopt the semidefinite relaxation method to find a
sub-optimal solution. The effectiveness of the proposed strategies is then
verified through numerical results which demonstrate a non-negligible
improvement in the performance of the studied scenario.
|
cs.IT math.IT
|
cellfree cf massive multipleinput multipleoutputmimo is a distributed antenna system wherein a large number of backhaul linked access points randomly distributed over a coverage area serve simultaneously a smaller number of users cf massive mimo inherits favorable propagation of massive mimo systems however the level of favorable propagation which highly depends on the network topology and environment may be hindered by user spatial correlation in this paper we investigate the impact of the network configuration on the level of favorable propagation for a cf massive mimo network we formulate a user grouping and scheduling optimization problem that leverages users spatial diversity the formulated design optimization problem is proved to be nphard in general to circumvent the prohibitively high computational cost we adopt the semidefinite relaxation method to find a suboptimal solution the effectiveness of the proposed strategies is then verified through numerical results which demonstrate a nonnegligible improvement in the performance of the studied scenario
|
[['cellfree', 'cf', 'massive', 'multipleinput', 'multipleoutputmimo', 'is', 'a', 'distributed', 'antenna', 'system', 'wherein', 'a', 'large', 'number', 'of', 'backhaul', 'linked', 'access', 'points', 'randomly', 'distributed', 'over', 'a', 'coverage', 'area', 'serve', 'simultaneously', 'a', 'smaller', 'number', 'of', 'users', 'cf', 'massive', 'mimo', 'inherits', 'favorable', 'propagation', 'of', 'massive', 'mimo', 'systems', 'however', 'the', 'level', 'of', 'favorable', 'propagation', 'which', 'highly', 'depends', 'on', 'the', 'network', 'topology', 'and', 'environment', 'may', 'be', 'hindered', 'by', 'user', 'spatial', 'correlation', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'impact', 'of', 'the', 'network', 'configuration', 'on', 'the', 'level', 'of', 'favorable', 'propagation', 'for', 'a', 'cf', 'massive', 'mimo', 'network', 'we', 'formulate', 'a', 'user', 'grouping', 'and', 'scheduling', 'optimization', 'problem', 'that', 'leverages', 'users', 'spatial', 'diversity', 'the', 'formulated', 'design', 'optimization', 'problem', 'is', 'proved', 'to', 'be', 'nphard', 'in', 'general', 'to', 'circumvent', 'the', 'prohibitively', 'high', 'computational', 'cost', 'we', 'adopt', 'the', 'semidefinite', 'relaxation', 'method', 'to', 'find', 'a', 'suboptimal', 'solution', 'the', 'effectiveness', 'of', 'the', 'proposed', 'strategies', 'is', 'then', 'verified', 'through', 'numerical', 'results', 'which', 'demonstrate', 'a', 'nonnegligible', 'improvement', 'in', 'the', 'performance', 'of', 'the', 'studied', 'scenario']]
|
[-0.24656096925088145, 0.000608608244567529, -0.008165113779099344, 0.04733554232796025, -0.08600738497946847, -0.18966468523389526, 0.10317726764909609, 0.36867051021885366, -0.2638280763647628, -0.29181002221953173, 0.07066439980619842, -0.2008869718977964, -0.21405943788817855, 0.12569639940372693, -0.10064716514974058, 0.05178029315815271, 0.09929959870899072, 0.006779575785440574, -0.042514066907725384, -0.28677577046184594, 0.296696792234963, 0.12980182516062028, 0.3658624392958334, 0.03328337275737582, 0.10313489864725474, 0.023211015144955705, -0.014958962690018649, 0.03809886098939127, -0.050973524865870104, 0.10624627306809431, 0.31227486656809395, 0.20936281581760033, 0.34005543321080794, -0.4044340364952487, -0.2509729812041155, 0.07267200903416696, 0.21383763411892698, 0.05679141310143417, -0.06619615048348114, -0.2737732008462409, 0.14943868280600078, -0.21202681993146416, -0.07071277034444759, -0.00720243015199561, -0.07961131298805696, 0.003435874440217415, -0.34458864424619584, 0.022891292449800517, -0.02682376232953718, 0.012387351126787283, -0.03337882775752866, -0.11511553028241622, 0.021930102585488324, 0.10589641682779441, 0.04157769170006913, -0.004597473056161438, 0.10485139249464158, -0.10980150011797472, -0.09463988929985442, 0.3945244226435369, 0.022951855873023824, -0.2740871715208201, 0.19699459056091773, -0.07421523628793446, -0.13890725562905337, 0.1822248688572413, 0.2979813353702813, 0.12502965534577606, -0.1698536966116978, 0.045456018694222895, -0.050841151512917376, 0.17810672717078213, 0.055544049126797584, 0.09548466058346661, 0.17726901183721258, 0.2700550678827159, 0.14533918194908213, 0.1483376675161424, -0.09324311313533841, -0.1278578996591802, -0.15945544791432073, -0.13659291434730705, -0.2318143473405923, 0.016934582779135603, -0.1207172160772773, -0.10793757278701992, 0.3700414567145628, 0.1593795204905539, 0.1286259381669005, 0.097919272658016, 0.34366407498185125, 0.10377140646171454, 0.06403775028007516, 0.13109831084714985, 0.19622434463802507, 0.08436163101804914, 0.12177208691227624, -0.2553005489269755, 0.06580188502436625, -0.015706598253727153]
|
1,803.05199
|
Maximal randomness expansion from steering inequality violations using
qudits
|
We consider the generation of randomness based upon the observed violation of
an Einstein-Podolsky-Rosen (EPR) steering inequality, known as one-sided
device-independent randomness expansion. We show that in the simplest scenario
-- involving only two parties applying two measurements with $d$ outcomes each
-- that there exist EPR steering inequalities whose maximal violation certifies
the maximal amount of randomness, equal to log(d) bits. We further show that
all pure partially entangled full-Schmidt-rank states in all dimensions can
achieve maximal violation of these inequalities, and thus lead to maximal
randomness expansion in the one-sided device-independent setting. More
generally, the amount of randomness that can be certified is given by a
semidefinite program, which we use to study the behaviour for non-maximal
violations of the inequalities.
|
quant-ph
|
we consider the generation of randomness based upon the observed violation of an einsteinpodolskyrosen epr steering inequality known as onesided deviceindependent randomness expansion we show that in the simplest scenario involving only two parties applying two measurements with d outcomes each that there exist epr steering inequalities whose maximal violation certifies the maximal amount of randomness equal to logd bits we further show that all pure partially entangled fullschmidtrank states in all dimensions can achieve maximal violation of these inequalities and thus lead to maximal randomness expansion in the onesided deviceindependent setting more generally the amount of randomness that can be certified is given by a semidefinite program which we use to study the behaviour for nonmaximal violations of the inequalities
|
[['we', 'consider', 'the', 'generation', 'of', 'randomness', 'based', 'upon', 'the', 'observed', 'violation', 'of', 'an', 'einsteinpodolskyrosen', 'epr', 'steering', 'inequality', 'known', 'as', 'onesided', 'deviceindependent', 'randomness', 'expansion', 'we', 'show', 'that', 'in', 'the', 'simplest', 'scenario', 'involving', 'only', 'two', 'parties', 'applying', 'two', 'measurements', 'with', 'd', 'outcomes', 'each', 'that', 'there', 'exist', 'epr', 'steering', 'inequalities', 'whose', 'maximal', 'violation', 'certifies', 'the', 'maximal', 'amount', 'of', 'randomness', 'equal', 'to', 'logd', 'bits', 'we', 'further', 'show', 'that', 'all', 'pure', 'partially', 'entangled', 'fullschmidtrank', 'states', 'in', 'all', 'dimensions', 'can', 'achieve', 'maximal', 'violation', 'of', 'these', 'inequalities', 'and', 'thus', 'lead', 'to', 'maximal', 'randomness', 'expansion', 'in', 'the', 'onesided', 'deviceindependent', 'setting', 'more', 'generally', 'the', 'amount', 'of', 'randomness', 'that', 'can', 'be', 'certified', 'is', 'given', 'by', 'a', 'semidefinite', 'program', 'which', 'we', 'use', 'to', 'study', 'the', 'behaviour', 'for', 'nonmaximal', 'violations', 'of', 'the', 'inequalities']]
|
[-0.14996829954422233, 0.17783110091804702, -0.03776205398219948, 0.08965221988764824, -0.02375954345334321, -0.26816902002707743, 0.08693068192903107, 0.2852012761635706, -0.27452235943637787, -0.25859106567222623, 0.08946919200728493, -0.28916504587590075, -0.07045439541107043, 0.19395538048508268, -0.08797277067011842, 0.09053138320741709, 0.00629961247711132, 0.009661861842808624, -0.048613811228036256, -0.2933186002715956, 0.3273394599479313, -0.016938035981729625, 0.2830095943490354, 0.07373315468430519, 0.0769577867933549, 0.00744921980270495, 0.03201522824044029, 0.02844955191637079, -0.10539876017840773, 0.129139356171072, 0.2514619137470921, 0.2401255708343039, 0.2717034045374021, -0.3926678400641928, -0.16088454886339604, 0.2314189305228259, 0.09097776147924984, 0.1371240805494987, -0.036444945311935345, -0.3021187346118192, 0.02339618154995454, -0.16347087676598068, -0.13604837162808206, -0.10211511256638914, -0.02316439674468711, -0.05837479109759443, -0.32151916369330136, 0.12657627400476484, 0.08778771446474518, 0.04532633915368933, 0.06168020619079471, -0.017084136543174585, 0.030587481563755622, 0.09108975551401575, 0.011018004843693537, -0.028023841893688464, 0.0625644005946621, -0.06179078741697595, -0.24879174838618687, 0.32217288586543874, -0.022385997224288683, -0.23469799182300147, 0.12719174890274493, -0.2151871260391393, -0.16221404513441182, 0.034928460822751126, 0.11390658137679566, 0.0916288543259725, -0.13224285041602948, 0.022566769865322082, -0.12669784552417696, 0.2290865291065226, 0.1382881545073663, 0.17545187315748384, 0.11102612903923728, -0.002155601559206843, 0.13865437794011087, 0.1954311478427068, -0.0073001182948549586, -0.1041706958960276, -0.39606638389329113, -0.2107320127193816, -0.25407648202769145, 0.10790148607920855, -0.14926064405578168, -0.08561860122717917, 0.32489147789310663, 0.12410584916360676, 0.11980190905742347, 0.0468532326000665, 0.2542010558381056, 0.055797590041765946, 0.05983284049046536, 0.1029797281565455, 0.285305595304817, 0.132400169596076, 0.028096239455044268, -0.2095087361012702, 0.17331215480808168, 0.04714775144432982]
|
1,803.052
|
Combining Multi-level Contexts of Superpixel using Convolutional Neural
Networks to perform Natural Scene Labeling
|
Modern deep learning algorithms have triggered various image segmentation
approaches. However most of them deal with pixel based segmentation. However,
superpixels provide a certain degree of contextual information while reducing
computation cost. In our approach, we have performed superpixel level semantic
segmentation considering 3 various levels as neighbours for semantic contexts.
Furthermore, we have enlisted a number of ensemble approaches like max-voting
and weighted-average. We have also used the Dempster-Shafer theory of
uncertainty to analyze confusion among various classes. Our method has proved
to be superior to a number of different modern approaches on the same dataset.
|
cs.CV
|
modern deep learning algorithms have triggered various image segmentation approaches however most of them deal with pixel based segmentation however superpixels provide a certain degree of contextual information while reducing computation cost in our approach we have performed superpixel level semantic segmentation considering 3 various levels as neighbours for semantic contexts furthermore we have enlisted a number of ensemble approaches like maxvoting and weightedaverage we have also used the dempstershafer theory of uncertainty to analyze confusion among various classes our method has proved to be superior to a number of different modern approaches on the same dataset
|
[['modern', 'deep', 'learning', 'algorithms', 'have', 'triggered', 'various', 'image', 'segmentation', 'approaches', 'however', 'most', 'of', 'them', 'deal', 'with', 'pixel', 'based', 'segmentation', 'however', 'superpixels', 'provide', 'a', 'certain', 'degree', 'of', 'contextual', 'information', 'while', 'reducing', 'computation', 'cost', 'in', 'our', 'approach', 'we', 'have', 'performed', 'superpixel', 'level', 'semantic', 'segmentation', 'considering', '3', 'various', 'levels', 'as', 'neighbours', 'for', 'semantic', 'contexts', 'furthermore', 'we', 'have', 'enlisted', 'a', 'number', 'of', 'ensemble', 'approaches', 'like', 'maxvoting', 'and', 'weightedaverage', 'we', 'have', 'also', 'used', 'the', 'dempstershafer', 'theory', 'of', 'uncertainty', 'to', 'analyze', 'confusion', 'among', 'various', 'classes', 'our', 'method', 'has', 'proved', 'to', 'be', 'superior', 'to', 'a', 'number', 'of', 'different', 'modern', 'approaches', 'on', 'the', 'same', 'dataset']]
|
[-0.013438650066052209, -0.023592963353874757, -0.09263684446011315, 0.08978768522111871, -0.07305197548313239, -0.15454030066210123, 0.033354555749929675, 0.45392229417627006, -0.2250467338275222, -0.3920256539527567, 0.08444374875938424, -0.2766955692090632, -0.13729803970794088, 0.17972482847453086, -0.1321064142228858, 0.1099586391535866, 0.11327719964691889, 0.08044589756173082, -0.05596416685838233, -0.3066985471385349, 0.2931166540569693, 0.022985231024201132, 0.34863298687815053, 0.02868187299463898, 0.1398376595323723, -0.03119933486858517, -0.07145332374139544, 0.06920054743244053, -0.07393006231520594, 0.1940546986987795, 0.3484211713075638, 0.21812289804892288, 0.3667233537104864, -0.4377065833619575, -0.2571610199532366, 0.10899089741011717, 0.14301043160418145, 0.10939836871363799, -0.0296512089499282, -0.3322690356061938, 0.10671188548380106, -0.18652919892443118, 0.03169273244956335, -0.14973556541492106, -0.01401427603259529, -0.00016569717578378688, -0.20929890675182194, 0.022969949306120865, 0.043571101909637755, 0.09499826310106467, -0.023997764964828017, -0.18657377409537504, 0.029370008752988556, 0.1974566817264428, 0.04341035303371699, 0.04984767542529093, 0.1459348952426508, -0.19731438885318095, -0.177482007877882, 0.3296283150461416, 0.01267848467483118, -0.21780409018230654, 0.23424257630165474, -0.0361381598727864, -0.22924066191904016, 0.09697346874157485, 0.19434799076317205, 0.10639620170275652, -0.13060682779658087, 0.027794097170363345, -0.01712746661847707, 0.16179404989576218, 0.10213204693126003, 0.06557329042248197, 0.15861499291297393, 0.23767476565367782, 0.04319138965658248, 0.109592854733022, -0.17535851216069712, -0.06073671385655468, -0.17187559346850848, -0.10236169369507235, -0.17312173279405563, -0.06755676586180925, -0.13348593107486484, -0.15839033931993024, 0.36484994577992824, 0.2617374251971079, 0.18741202371233365, 0.08545055229831294, 0.3162701652222073, 0.05880481691325333, 0.1272369146841511, 0.04714111991457103, 0.18678665929233906, 0.05900837389089782, 0.07291431727665525, -0.1327450195478621, 0.06587612333217847, 0.09649698388253905]
|
1,803.05201
|
OSINT Analysis of the TOR Foundation
|
This research paper is a study on the TOR Foundation and the TOR Network. Due
to the blind confidence over this network and this foundation we have collect
data and gather information in open sources to understand how it is organized.
We discovered that the US government is very active through the financial
aspect and development aspect. Furthermore, we discovered that some critical
points of the TOR network are running by unknown people who have special nodes
and the foundations never talks about them.
|
cs.CR
|
this research paper is a study on the tor foundation and the tor network due to the blind confidence over this network and this foundation we have collect data and gather information in open sources to understand how it is organized we discovered that the us government is very active through the financial aspect and development aspect furthermore we discovered that some critical points of the tor network are running by unknown people who have special nodes and the foundations never talks about them
|
[['this', 'research', 'paper', 'is', 'a', 'study', 'on', 'the', 'tor', 'foundation', 'and', 'the', 'tor', 'network', 'due', 'to', 'the', 'blind', 'confidence', 'over', 'this', 'network', 'and', 'this', 'foundation', 'we', 'have', 'collect', 'data', 'and', 'gather', 'information', 'in', 'open', 'sources', 'to', 'understand', 'how', 'it', 'is', 'organized', 'we', 'discovered', 'that', 'the', 'us', 'government', 'is', 'very', 'active', 'through', 'the', 'financial', 'aspect', 'and', 'development', 'aspect', 'furthermore', 'we', 'discovered', 'that', 'some', 'critical', 'points', 'of', 'the', 'tor', 'network', 'are', 'running', 'by', 'unknown', 'people', 'who', 'have', 'special', 'nodes', 'and', 'the', 'foundations', 'never', 'talks', 'about', 'them']]
|
[-0.12552975576060513, 0.03517020718261067, -0.09876476540341086, 0.07932643459034375, -0.14077370372113018, -0.16518412700610324, 0.13550525020192644, 0.37815103653286186, -0.2273837130494593, -0.33067747422804433, 0.17203870120630155, -0.306391754234764, -0.21524066154268526, 0.17917353867198385, -0.08884309655764983, 0.013100013110531671, 0.059707272675864044, 0.03774634966005882, 0.039394587627612054, -0.3258809156970875, 0.3327908960193218, 0.110127129691786, 0.3107011730427898, 0.08049240096893516, 0.06292778885108419, -0.026329589120688893, -0.09074522171258217, -0.00982295947254724, -0.13014782567794705, 0.16983116255141795, 0.3619957734786329, 0.1674379554654782, 0.350954687134141, -0.4233996798284352, -0.1585382856096008, 0.11270923292752177, 0.1080751167887467, 0.09488223596764285, 0.0011959982761514506, -0.3550247745588422, 0.10866105856950439, -0.1845433831359038, -0.09726640993418793, -0.06569514780615766, 0.03713695997084003, -0.011461335375705468, -0.14709569253803542, -0.05358368618458155, 0.02017296161059113, 0.09771429001176286, 0.030133137651275666, -0.0569667501618997, 0.028844790954497598, 0.22408834659671856, 0.10723427867439266, 0.020940132845204233, 0.1407488186433468, -0.13947359034015486, -0.09892831150708455, 0.31306637635099743, 0.04943963332334533, -0.12197598504523437, 0.18984656503224479, -0.09008534280915878, -0.20166999054518306, 0.05212328443996653, 0.23276126424648932, 0.04916899981132398, -0.194153238054631, 0.04483204329084228, -0.0954226076359018, 0.14821522274481444, 0.07399141906561064, 0.01456721454104852, 0.218993004773178, 0.19803587391617752, 0.0759676698251583, 0.10315065807108545, -0.08216270865973672, -0.10964493308260682, -0.24844046836231082, -0.16663586992459992, -0.134570475695433, 0.04683408144462321, 0.00014732454967867983, -0.10087972788425673, 0.4064339951479009, 0.21690700675493904, 0.16972140703971186, 0.026459346492109553, 0.28708806731516406, 0.005805436843296602, 0.10750768727268137, 0.14822860485652373, 0.22143902042721275, 0.06930442307687674, 0.18399694607831493, -0.08813212616258256, 0.11707620372042238, 0.0003576436623310049]
|
1,803.05202
|
Neutron-proton mass difference from gauge/gravity duality
|
Using gauge/gravity duality as a tool, we compute the strong sector, isospin
breaking induced contribution to the neutron-proton mass difference in the
Witten-Sakai-Sugimoto model of large $N$ QCD with two non-degenerate light
flavors. The mass difference, for which we provide an analytic expression,
turns out to be positive and proportional to the down-up quark mass splitting,
consistently with expectations and previous estimates based on effective QCD
models. Extrapolating the model parameters to fit QCD hadronic observables, we
find that the strong sector contribution to the nucleon mass splitting
overcomes the electromagnetic contribution and is about $0.25\%$ of the average
nucleon mass in the model, a result which approaches recent lattice QCD
estimates. Our formula is extended to resonances and $\Delta$ baryons. We thus
use it to compute the strong sector contribution to $\Delta$ baryons mass
differences. Finally, we also provide details of how isospin breaking affects
the holographic instanton solution describing the baryons.
|
hep-th hep-lat hep-ph
|
using gaugegravity duality as a tool we compute the strong sector isospin breaking induced contribution to the neutronproton mass difference in the wittensakaisugimoto model of large n qcd with two nondegenerate light flavors the mass difference for which we provide an analytic expression turns out to be positive and proportional to the downup quark mass splitting consistently with expectations and previous estimates based on effective qcd models extrapolating the model parameters to fit qcd hadronic observables we find that the strong sector contribution to the nucleon mass splitting overcomes the electromagnetic contribution and is about 025 of the average nucleon mass in the model a result which approaches recent lattice qcd estimates our formula is extended to resonances and delta baryons we thus use it to compute the strong sector contribution to delta baryons mass differences finally we also provide details of how isospin breaking affects the holographic instanton solution describing the baryons
|
[['using', 'gaugegravity', 'duality', 'as', 'a', 'tool', 'we', 'compute', 'the', 'strong', 'sector', 'isospin', 'breaking', 'induced', 'contribution', 'to', 'the', 'neutronproton', 'mass', 'difference', 'in', 'the', 'wittensakaisugimoto', 'model', 'of', 'large', 'n', 'qcd', 'with', 'two', 'nondegenerate', 'light', 'flavors', 'the', 'mass', 'difference', 'for', 'which', 'we', 'provide', 'an', 'analytic', 'expression', 'turns', 'out', 'to', 'be', 'positive', 'and', 'proportional', 'to', 'the', 'downup', 'quark', 'mass', 'splitting', 'consistently', 'with', 'expectations', 'and', 'previous', 'estimates', 'based', 'on', 'effective', 'qcd', 'models', 'extrapolating', 'the', 'model', 'parameters', 'to', 'fit', 'qcd', 'hadronic', 'observables', 'we', 'find', 'that', 'the', 'strong', 'sector', 'contribution', 'to', 'the', 'nucleon', 'mass', 'splitting', 'overcomes', 'the', 'electromagnetic', 'contribution', 'and', 'is', 'about', '025', 'of', 'the', 'average', 'nucleon', 'mass', 'in', 'the', 'model', 'a', 'result', 'which', 'approaches', 'recent', 'lattice', 'qcd', 'estimates', 'our', 'formula', 'is', 'extended', 'to', 'resonances', 'and', 'delta', 'baryons', 'we', 'thus', 'use', 'it', 'to', 'compute', 'the', 'strong', 'sector', 'contribution', 'to', 'delta', 'baryons', 'mass', 'differences', 'finally', 'we', 'also', 'provide', 'details', 'of', 'how', 'isospin', 'breaking', 'affects', 'the', 'holographic', 'instanton', 'solution', 'describing', 'the', 'baryons']]
|
[-0.08658878906063881, 0.1783459335969787, -0.11929687925803116, 0.1651739900660841, -0.10084946491615543, -0.08334664604588551, 0.07215090700443469, 0.3254654536668966, -0.17649375702394476, -0.28888252641689155, -0.0038551963756189626, -0.3244560088603179, -0.050556475005958695, 0.08161989007954748, 0.05202890027868348, 0.02378764640832064, 0.02619799690814141, 0.002713954275903091, -0.10057244413787973, -0.20167277669655828, 0.35144292140756944, 0.017439695912127205, 0.2179807607279299, 0.20901484406108853, 0.06259690711709968, -0.025446244384606485, -0.04407064264238465, -0.0410519615302678, -0.15258650793535125, 0.07811372235319973, 0.1822562833913966, 0.031864957089590674, 0.10645233087692094, -0.35692835005085455, -0.15032658459210854, 0.14280574097072865, 0.15772496226770208, 0.16321073547827408, -0.046108869731493196, -0.2561101075870539, 0.06962928725893494, -0.229974466801341, -0.19685029258549797, -0.12458574653183128, -0.01313001480793544, -0.057156076464790664, -0.32480181812984393, 0.10635007899962183, -0.02000685220620796, -0.03190996215828646, -0.03221474005688542, -0.19388062818724588, -0.03397649892885846, 0.07854014727305256, 0.1592290845457647, 0.10225213373466426, 0.13926850913969033, -0.17908965028043278, -0.08668017450087016, 0.4105663983991333, -0.09512531083705683, -0.19476845328166498, 0.10087080972171784, -0.13723729871627358, -0.14180875789934125, 0.09352291264613859, 0.16964602339069293, 0.08770993266108573, -0.15717999802086674, 0.09373134310247705, -0.060001938281203406, 0.20737017258953036, 0.035630068479994545, 0.05372520653969225, 0.23553698234719656, 0.1362400813906277, -0.001184313460648839, 0.06983672977148196, -0.04490209962971801, -0.1478802332737532, -0.34844061632768486, -0.06867396002528836, -0.13203948950151506, 0.06946134594652582, -0.11827675391510174, -0.10628334801146469, 0.3773873358800569, 0.1521361415986629, 0.23144622176301247, 0.062019283219782353, 0.32942656920370617, 0.135806750635513, 0.08268645028066304, 0.058470555185492525, 0.2759885568463919, 0.22612846174484325, 0.09600020806895557, -0.334683252258068, -0.056362086612566864, 0.12293255432003658]
|
1,803.05203
|
The propagating speed of relic gravitational waves and their refractive
index during inflation
|
If the refractive index of the tensor modes increases during a conventional
inflationary stage of expansion the relic graviton spectrum is tilted towards
high frequencies. Two apparently diverse parametrizations of this effect are
shown to be related by a rescaling of the four-dimensional metric through a
conformal factor that involves the refractive index itself. Non-monotonic
spectra with a maximum in the MHz region correspond to a limited variation of
the refractive index terminating well before the end of inflation. After
exploring a general approach encompassing the ones proposed so far, we estimate
the required sensitivity for the direct detection of the predicted
gravitational radiation and demonstrate that the allowed regions of the
parameter space are within reach for some of the planned detectors operating
either in the audio band (like Ligo/Virgo and Kagra) or in the mHz band (like
Lisa, Bbo and Decigo).
|
gr-qc astro-ph.CO hep-ph hep-th
|
if the refractive index of the tensor modes increases during a conventional inflationary stage of expansion the relic graviton spectrum is tilted towards high frequencies two apparently diverse parametrizations of this effect are shown to be related by a rescaling of the fourdimensional metric through a conformal factor that involves the refractive index itself nonmonotonic spectra with a maximum in the mhz region correspond to a limited variation of the refractive index terminating well before the end of inflation after exploring a general approach encompassing the ones proposed so far we estimate the required sensitivity for the direct detection of the predicted gravitational radiation and demonstrate that the allowed regions of the parameter space are within reach for some of the planned detectors operating either in the audio band like ligovirgo and kagra or in the mhz band like lisa bbo and decigo
|
[['if', 'the', 'refractive', 'index', 'of', 'the', 'tensor', 'modes', 'increases', 'during', 'a', 'conventional', 'inflationary', 'stage', 'of', 'expansion', 'the', 'relic', 'graviton', 'spectrum', 'is', 'tilted', 'towards', 'high', 'frequencies', 'two', 'apparently', 'diverse', 'parametrizations', 'of', 'this', 'effect', 'are', 'shown', 'to', 'be', 'related', 'by', 'a', 'rescaling', 'of', 'the', 'fourdimensional', 'metric', 'through', 'a', 'conformal', 'factor', 'that', 'involves', 'the', 'refractive', 'index', 'itself', 'nonmonotonic', 'spectra', 'with', 'a', 'maximum', 'in', 'the', 'mhz', 'region', 'correspond', 'to', 'a', 'limited', 'variation', 'of', 'the', 'refractive', 'index', 'terminating', 'well', 'before', 'the', 'end', 'of', 'inflation', 'after', 'exploring', 'a', 'general', 'approach', 'encompassing', 'the', 'ones', 'proposed', 'so', 'far', 'we', 'estimate', 'the', 'required', 'sensitivity', 'for', 'the', 'direct', 'detection', 'of', 'the', 'predicted', 'gravitational', 'radiation', 'and', 'demonstrate', 'that', 'the', 'allowed', 'regions', 'of', 'the', 'parameter', 'space', 'are', 'within', 'reach', 'for', 'some', 'of', 'the', 'planned', 'detectors', 'operating', 'either', 'in', 'the', 'audio', 'band', 'like', 'ligovirgo', 'and', 'kagra', 'or', 'in', 'the', 'mhz', 'band', 'like', 'lisa', 'bbo', 'and', 'decigo']]
|
[-0.11273281278749732, 0.1790114896367076, -0.05860968266281631, 0.04325134442611174, -0.10147561442263268, -0.09973299921119025, 0.02688565186934767, 0.3670078255236149, -0.21409834710672707, -0.31843912734330954, 0.10168063977303413, -0.272231922953852, -0.13913100212201854, 0.2047576427775585, -0.004116703671246211, 0.040492418863634756, 0.034339536380322354, 0.040629913372645425, -0.07351482172750613, -0.15526331307275312, 0.2839737134526477, 0.1346972139903924, 0.2638982315710583, 0.011190041427507059, 0.07790138438373309, -0.03608006190417425, -0.03604324963074047, 0.004250445445287986, -0.10941645335391818, 0.054716069335964596, 0.2595265651011019, 0.13096873597746675, 0.24400717259052543, -0.3812875379710556, -0.23515064854474438, 0.10546545299760007, 0.10789565858186932, 0.06770474089869669, -0.016191340242089194, -0.30618238053121766, 0.05992082943342027, -0.19544789391094364, -0.1518559917022793, 0.005772722572400853, 0.0058288483854409285, -0.028722464797327985, -0.25074757984106694, 0.06899246310333272, -0.010951640716936257, -0.01861639373603609, -0.06209934830105492, -0.08587129321519181, -0.024238334436269177, 0.05769712570891879, 0.05393738828036101, 0.004789688451853874, 0.15662958825306666, -0.1511027843258311, -0.0873042532027914, 0.3822585517944364, -0.10577364574264148, -0.12181262737024051, 0.13872506684978603, -0.18873506688050457, -0.09684825047848167, 0.15598446005707853, 0.12414805284315407, 0.12002910931848666, -0.06213006396107115, 0.08386611848804201, 0.07643025155485302, 0.19510029247388816, 0.15224101510504587, 0.05992406257468934, 0.2745151325435072, 0.14984173807999365, 0.08497201240299126, 0.13604742796095154, -0.11665532358277303, -0.006371345996231466, -0.31677582841757296, -0.11685703165008576, -0.1753802014566906, 0.013387921074131778, -0.141116690822658, -0.16757553363185526, 0.43510940797639996, 0.11668572148055383, 0.18766159064281354, 0.037539312928602415, 0.2973081662174692, 0.10884247789439465, 0.09490991413098324, 0.03653220365221215, 0.37069048999317833, 0.08730423208073733, 0.11492594047465811, -0.17895522680039147, 0.00824305698213695, 0.004536065242051349]
|
1,803.05204
|
Some remarks on Yamabe solitons
|
In this paper we have obtained evolution of some geometric quantities on a
compact Riemannian manifold $M^n$ when the metric is a Yamabe soliton. Using
these quantities we have obtained bound on the soliton constant. We have proved
that the commutator of two soliton vector fields with the same metric in a
given conformal class produces a Killing vector field. Also it is shown that
the soliton vector field becomes a geodesic vector field if and only if the
manifold is of constant curvature.
|
math.DG
|
in this paper we have obtained evolution of some geometric quantities on a compact riemannian manifold mn when the metric is a yamabe soliton using these quantities we have obtained bound on the soliton constant we have proved that the commutator of two soliton vector fields with the same metric in a given conformal class produces a killing vector field also it is shown that the soliton vector field becomes a geodesic vector field if and only if the manifold is of constant curvature
|
[['in', 'this', 'paper', 'we', 'have', 'obtained', 'evolution', 'of', 'some', 'geometric', 'quantities', 'on', 'a', 'compact', 'riemannian', 'manifold', 'mn', 'when', 'the', 'metric', 'is', 'a', 'yamabe', 'soliton', 'using', 'these', 'quantities', 'we', 'have', 'obtained', 'bound', 'on', 'the', 'soliton', 'constant', 'we', 'have', 'proved', 'that', 'the', 'commutator', 'of', 'two', 'soliton', 'vector', 'fields', 'with', 'the', 'same', 'metric', 'in', 'a', 'given', 'conformal', 'class', 'produces', 'a', 'killing', 'vector', 'field', 'also', 'it', 'is', 'shown', 'that', 'the', 'soliton', 'vector', 'field', 'becomes', 'a', 'geodesic', 'vector', 'field', 'if', 'and', 'only', 'if', 'the', 'manifold', 'is', 'of', 'constant', 'curvature']]
|
[-0.2115580026889109, 0.15425903993725246, -0.09925566079272401, 0.06141128804856202, -0.1395580496284224, -0.1396423053894458, -0.0676420995885218, 0.4231634360871145, -0.23245589807075226, -0.18141720244394882, 0.12032598788937321, -0.2682991407456852, -0.18341189064639843, 0.1824938454498936, -0.03673600060643539, 0.025084007930542742, 0.07186570756381289, 0.20558306652431688, -0.07546843569504008, -0.2842940866581297, 0.4810753164458133, -0.042037612215305366, 0.25532599825722474, 0.07073796238511845, 0.18045308632731794, -0.050779872124881616, 0.04271286376751959, 0.08762477668711827, -0.1612924091703982, 0.09685529308349249, 0.16968530489386813, 0.12217728770337999, 0.21516234001943044, -0.3581369328756063, -0.25445251325505697, 0.15120802155607158, 0.13575025121237905, 0.1245261768233918, -0.0981525269758311, -0.3003792480255167, 0.13417364270537205, -0.05337906315080112, -0.1291070118812578, -0.09798925444262013, 0.048077772763679694, -0.006923420886908259, -0.20421628682829795, 0.02739838654573153, 0.09778780499722675, 0.024008803335683688, -0.13870562606358103, -0.07357144049144283, -0.057550702460243235, 0.0443966796034753, 0.09974711435192841, 0.13868021113739815, 0.09396119048220239, -0.10075696073805115, -0.0756800592699576, 0.34285136795647086, -0.18129161520794565, -0.3239064689592591, 0.06815800132850806, -0.14635491749227403, -0.11025518276506946, 0.09358833607984707, 0.14450215589299442, 0.186326586402997, -0.10129711255684101, 0.16007914727794872, -0.07923009600268588, 0.11403687930266772, 0.09550294586058174, 0.013333122323577603, 0.1632759493021738, 0.08458888209480349, 0.13586056241599312, 0.09965623672386366, -0.04911630600136483, -0.08686601217570049, -0.3298377435477007, -0.21397795329505157, -0.19661795841308222, 0.141825350234285, -0.16029118276405607, -0.1870186872391579, 0.39311966335489634, 0.03112715573262817, 0.21581445092202298, 0.07182635264637481, 0.22869656988907427, 0.12841232901250588, 0.05743846186946723, 0.16419679020154512, 0.27755289682959083, 0.21016877676759446, 0.0817605468286534, -0.1470838433486365, -0.06919803089528744, 0.1286825093085922]
|
1,803.05205
|
The complete enumeration of 4-polytopes and 3-spheres with nine vertices
|
We describe an algorithm to enumerate polytopes. This algorithm is then
implemented to give a complete classification of combinatorial spheres of
dimension 3 with 9 vertices and decide polytopality of those spheres. In
particular, we completely enumerate all combinatorial types of 4-dimensional
polytopes with 9 vertices. It is shown that all of those combinatorial types
are rational: They can be realized with rational coordinates. We find 316014
combinatorial spheres on 9 vertices. Of those, 274148 can be realized as the
boundary complex of a four-dimensional polytope and the remaining 41866 are
non-polytopal.
|
math.MG math.CO
|
we describe an algorithm to enumerate polytopes this algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres in particular we completely enumerate all combinatorial types of 4dimensional polytopes with 9 vertices it is shown that all of those combinatorial types are rational they can be realized with rational coordinates we find 316014 combinatorial spheres on 9 vertices of those 274148 can be realized as the boundary complex of a fourdimensional polytope and the remaining 41866 are nonpolytopal
|
[['we', 'describe', 'an', 'algorithm', 'to', 'enumerate', 'polytopes', 'this', 'algorithm', 'is', 'then', 'implemented', 'to', 'give', 'a', 'complete', 'classification', 'of', 'combinatorial', 'spheres', 'of', 'dimension', '3', 'with', '9', 'vertices', 'and', 'decide', 'polytopality', 'of', 'those', 'spheres', 'in', 'particular', 'we', 'completely', 'enumerate', 'all', 'combinatorial', 'types', 'of', '4dimensional', 'polytopes', 'with', '9', 'vertices', 'it', 'is', 'shown', 'that', 'all', 'of', 'those', 'combinatorial', 'types', 'are', 'rational', 'they', 'can', 'be', 'realized', 'with', 'rational', 'coordinates', 'we', 'find', '316014', 'combinatorial', 'spheres', 'on', '9', 'vertices', 'of', 'those', '274148', 'can', 'be', 'realized', 'as', 'the', 'boundary', 'complex', 'of', 'a', 'fourdimensional', 'polytope', 'and', 'the', 'remaining', '41866', 'are', 'nonpolytopal']]
|
[-0.12369912356174854, 0.10406248534789565, -0.054560055225051605, 0.04784128680600251, -0.11370409391506502, -0.1722384017232931, -0.013557563446922584, 0.39739313960242806, -0.2934252492811405, -0.3167852819949556, 0.11499196752837827, -0.294560442982095, -0.19508265650548626, 0.1371040732777688, -0.1450914360917686, -0.015028294045059534, 0.03865142795780485, 0.057026061825872804, -0.05481789616627221, -0.4106303566041287, 0.32094037451184865, -0.07867036784967679, 0.14208332476404945, 0.04978777491528439, 0.1039697175186253, 0.0018190300651941072, -0.010073398668946845, 0.0985825564293714, -0.17867197471010574, 0.11151754208892752, 0.2982857729611772, 0.1393120037470264, 0.10613120753276215, -0.41037712501508467, -0.09317893322375394, 0.20618592713844408, 0.1576743630033112, 0.08796792406212078, 0.03294139797406878, -0.1849585586028655, 0.10338642799787306, -0.11044304230344597, -0.1540430975408199, -0.10636187546750468, 0.028486669942569195, 0.024103419269236287, -0.2399348570033908, -0.05127882432150707, 0.0639745651671056, 0.0811882079683579, -0.029400083811932737, -0.15382795959836645, -0.03942278855260503, 0.10849871789759255, -0.04879095044321893, 0.020848174265512588, 0.06783232261855783, -0.05466381225766342, -0.22882084825254057, 0.40517198281320793, 0.104814652908133, -0.2501904601178896, 0.19730142757212848, -0.12153088678134961, -0.16750081308353482, 0.16844278946518898, 0.1278479691762268, 0.18123680142309057, -0.11994521241383942, 0.1034226480418858, -0.1350674120424148, 0.07811068644579709, 0.15061923629980994, -0.019165621259448568, 0.1748436321609057, 0.08586696244179784, 0.09393780883610918, 0.18924633296091486, 0.016150059884811722, -0.051126092060186555, -0.2867980081211315, -0.1518015401134414, -0.17489991281600145, 0.1051701558439919, -0.16541179755062985, -0.17823251134950113, 0.35084215903215193, 0.027854481430755657, 0.22120670418600352, 0.10276038466502777, 0.20421362072857244, 0.030555748913091808, 0.053998158216457474, 0.09645656707665223, 0.18384321569726708, 0.10536208806371086, -0.03186598908302657, -0.09061695093529697, -0.03022950751120957, 0.1754991290253702]
|
1,803.05206
|
Learning Latent Superstructures in Variational Autoencoders for Deep
Multidimensional Clustering
|
We investigate a variant of variational autoencoders where there is a
superstructure of discrete latent variables on top of the latent features. In
general, our superstructure is a tree structure of multiple super latent
variables and it is automatically learned from data. When there is only one
latent variable in the superstructure, our model reduces to one that assumes
the latent features to be generated from a Gaussian mixture model. We call our
model the latent tree variational autoencoder (LTVAE). Whereas previous deep
learning methods for clustering produce only one partition of data, LTVAE
produces multiple partitions of data, each being given by one super latent
variable. This is desirable because high dimensional data usually have many
different natural facets and can be meaningfully partitioned in multiple ways.
|
cs.LG
|
we investigate a variant of variational autoencoders where there is a superstructure of discrete latent variables on top of the latent features in general our superstructure is a tree structure of multiple super latent variables and it is automatically learned from data when there is only one latent variable in the superstructure our model reduces to one that assumes the latent features to be generated from a gaussian mixture model we call our model the latent tree variational autoencoder ltvae whereas previous deep learning methods for clustering produce only one partition of data ltvae produces multiple partitions of data each being given by one super latent variable this is desirable because high dimensional data usually have many different natural facets and can be meaningfully partitioned in multiple ways
|
[['we', 'investigate', 'a', 'variant', 'of', 'variational', 'autoencoders', 'where', 'there', 'is', 'a', 'superstructure', 'of', 'discrete', 'latent', 'variables', 'on', 'top', 'of', 'the', 'latent', 'features', 'in', 'general', 'our', 'superstructure', 'is', 'a', 'tree', 'structure', 'of', 'multiple', 'super', 'latent', 'variables', 'and', 'it', 'is', 'automatically', 'learned', 'from', 'data', 'when', 'there', 'is', 'only', 'one', 'latent', 'variable', 'in', 'the', 'superstructure', 'our', 'model', 'reduces', 'to', 'one', 'that', 'assumes', 'the', 'latent', 'features', 'to', 'be', 'generated', 'from', 'a', 'gaussian', 'mixture', 'model', 'we', 'call', 'our', 'model', 'the', 'latent', 'tree', 'variational', 'autoencoder', 'ltvae', 'whereas', 'previous', 'deep', 'learning', 'methods', 'for', 'clustering', 'produce', 'only', 'one', 'partition', 'of', 'data', 'ltvae', 'produces', 'multiple', 'partitions', 'of', 'data', 'each', 'being', 'given', 'by', 'one', 'super', 'latent', 'variable', 'this', 'is', 'desirable', 'because', 'high', 'dimensional', 'data', 'usually', 'have', 'many', 'different', 'natural', 'facets', 'and', 'can', 'be', 'meaningfully', 'partitioned', 'in', 'multiple', 'ways']]
|
[-0.0364673998768604, 0.11593390977756667, -0.11287936320461865, 0.10072703316940793, -0.15719074494619337, -0.1732515277865801, 0.06182907691358456, 0.4105106867731564, -0.3618034493503353, -0.2932118955585692, 0.0771880728305347, -0.27800531405955553, -0.16634692372162901, 0.12013519358163374, -0.06942268910389097, 0.032058758062443564, 0.08991804120541062, 0.09217786753091901, -0.01909409876864788, -0.2739344923110265, 0.3585616241796829, -0.0053812376408752735, 0.29804431287098737, -0.1030598934259384, 0.15119294708757292, 0.0062892191622051456, -0.03502527689090043, 0.012693806163345775, -0.010725174657550053, 0.15587159167117778, 0.302524419190983, 0.18637436069917704, 0.3092257954080456, -0.40217579248183893, -0.3003151370009171, 0.0894355605696402, 0.10532341319106756, 0.09640723982057164, 0.03311821696300444, -0.26877545694717103, 0.06970893133002969, -0.13132844177547784, 0.0044772820002103725, -0.11659352329470926, -0.05844489102702706, -0.020288560672530105, -0.3178594737625053, 0.07966897810351044, 0.07523884571763495, 0.022931198062863024, -0.061515902106221466, -0.14408823039053778, -0.050751891397383245, 0.08512342843483017, 0.047818717091262994, 0.08940289582177582, 0.0617725613807875, -0.14333844614763316, -0.12563988438526552, 0.36153996481545386, -0.03308977592839963, -0.24277330166290675, 0.20234845287816983, -0.09324991607314183, -0.23127411688781446, 0.14022917714383867, 0.19184459444405216, 0.12102612304974288, -0.18597717344354828, 0.04322509260548811, -0.12217340348584074, 0.1921646088363588, 0.03259975440977585, -0.03192610918712388, 0.1848129566596259, 0.2248932648549921, 0.029029713704764457, 0.16460329101934645, -0.12542655973026293, -0.09784577785074593, -0.2342720195066206, -0.1335909292212732, -0.22929045786186758, -0.03627368765107045, -0.176011642662666, -0.19132945832190296, 0.4019445987336988, 0.1657948285015115, 0.2627173322308365, 0.027240091139295448, 0.26001345323369146, 0.09616186586485821, 0.12310824868831015, 0.09373585581927309, 0.08754839855689733, 0.07326019034602695, 0.016856758334186105, -0.10253716970189652, 0.12736595519596622, 0.033877128413656636]
|
1,803.05207
|
Sparse Fast DCT for Vectors with One-block Support
|
In this paper we present a new fast and deterministic algorithm for the
inverse discrete cosine transform of type II that reconstructs the input vector
$\mathbf{x}\in\mathbb{R}^{N}$, $N=2^{J-1}$, with short support of length $m$
from its discrete cosine transform
$\mathbf{x}^{\widehat{\mathrm{II}}}=\mathbf{C}_N^{\mathrm{II}}\mathbf{x}$.
The resulting algorithm has a runtime of $\mathcal{O}\left(m\log m\log
\frac{2N}{m}\right)$ and requires $\mathcal{O}\left(m\log \frac{2N}{m}\right)$
samples of $\mathbf{x}^{\widehat{\mathrm{II}}}$.
In order to derive this algorithm we also develop a new fast and
deterministic inverse FFT algorithm that constructs the input vector
$\mathbf{y}\in\mathbb{R}^{2N}$ with reflected block support of block length $m$
from $\widehat{\mathbf{y}}$ with the same runtime and sampling complexities as
our DCT algorithm.
|
math.NA
|
in this paper we present a new fast and deterministic algorithm for the inverse discrete cosine transform of type ii that reconstructs the input vector mathbfxinmathbbrn n2j1 with short support of length m from its discrete cosine transform mathbfxwidehatmathrmiimathbfc_nmathrmiimathbfx the resulting algorithm has a runtime of mathcaloleftmlog mlog frac2nmright and requires mathcaloleftmlog frac2nmright samples of mathbfxwidehatmathrmii in order to derive this algorithm we also develop a new fast and deterministic inverse fft algorithm that constructs the input vector mathbfyinmathbbr2n with reflected block support of block length m from widehatmathbfy with the same runtime and sampling complexities as our dct algorithm
|
[['in', 'this', 'paper', 'we', 'present', 'a', 'new', 'fast', 'and', 'deterministic', 'algorithm', 'for', 'the', 'inverse', 'discrete', 'cosine', 'transform', 'of', 'type', 'ii', 'that', 'reconstructs', 'the', 'input', 'vector', 'mathbfxinmathbbrn', 'n2j1', 'with', 'short', 'support', 'of', 'length', 'm', 'from', 'its', 'discrete', 'cosine', 'transform', 'mathbfxwidehatmathrmiimathbfc_nmathrmiimathbfx', 'the', 'resulting', 'algorithm', 'has', 'a', 'runtime', 'of', 'mathcaloleftmlog', 'mlog', 'frac2nmright', 'and', 'requires', 'mathcaloleftmlog', 'frac2nmright', 'samples', 'of', 'mathbfxwidehatmathrmii', 'in', 'order', 'to', 'derive', 'this', 'algorithm', 'we', 'also', 'develop', 'a', 'new', 'fast', 'and', 'deterministic', 'inverse', 'fft', 'algorithm', 'that', 'constructs', 'the', 'input', 'vector', 'mathbfyinmathbbr2n', 'with', 'reflected', 'block', 'support', 'of', 'block', 'length', 'm', 'from', 'widehatmathbfy', 'with', 'the', 'same', 'runtime', 'and', 'sampling', 'complexities', 'as', 'our', 'dct', 'algorithm']]
|
[-0.0757704574574271, 0.07524485887109261, -0.10445164350549811, 0.041203235992250724, -0.11566507945130781, -0.17071986990049481, 0.07512392438619155, 0.4198393149544363, -0.33258677757618466, -0.28571184311548004, 0.12347227148458605, -0.18194878907145365, -0.20022097033569994, 0.18442452576203758, -0.05819661757382362, 0.11685705703174513, 0.04311786983769549, 0.04393862515849912, -0.09359656441855528, -0.23269203440893604, 0.22132900634618558, 0.0434085777859487, 0.24577530261139263, -0.08446953403156089, 0.1595810462832046, 0.06210905568087068, -0.08424289989204187, -0.039565579606341605, -0.06505963987365249, 0.13707674551076945, 0.20241543871310094, 0.19745506943486954, 0.25752167508977913, -0.4034808132311572, -0.11949255349337244, 0.09127548858320908, 0.16303064123443936, 0.08985551842488348, -0.06218969065736493, -0.2638991884785988, 0.13983225327430535, -0.08584351276816882, -0.05292437358951682, -0.05588582265393242, 0.044422258076298494, 0.04866222116043386, -0.32138720199303783, 0.04166163860171092, 0.11190295162732186, 0.00320843398651999, -0.02482363112579586, -0.13745198698471423, 0.09175620950080211, 0.071676722803639, 0.03128502322921201, 0.07439168724459191, 0.038360571853168636, -0.0221504370185911, -0.14110862265300492, 0.34653011944306933, -0.07663429910747294, -0.1847918047974615, 0.15453595771332798, -0.07469333843429289, -0.10759924705970385, 0.1860275617167961, 0.23868557805721852, 0.0918103414233369, -0.08667070242454825, 0.14939276004746638, -0.05978940242051106, 0.20631087840656223, 0.0409359971931933, 0.03516586103638553, 0.07620951524206801, 0.16888892024239202, 0.09684867974694657, 0.18348729772918412, -0.12906936569513916, -0.02908054998387461, -0.29973180312663317, -0.21498390588828403, -0.24558597767685095, -0.01913666935718578, -0.13935014429823597, -0.21842052346176427, 0.40949859364849067, 0.1395065539197632, 0.23007015582255047, 0.1933183681179324, 0.3405881319599955, 0.12330116648935592, 0.05411502134128292, 0.17069608113809448, 0.07875191971011784, 0.09855597378412748, 0.10969058582154305, -0.22536632509233998, 0.037075275752652924, 0.15284309140912702]
|
1,803.05208
|
One-half of the Kibble-Zurek quench followed by free evolution
|
We drive the one-dimensional quantum Ising chain in the transverse field from
the paramagnetic phase to the critical point and study its free evolution
there. We analyze excitation of such a system at the critical point and
dynamics of its transverse magnetization and Loschmidt echo during free
evolution. We discuss how the system size and quench-induced scaling relations
from the Kibble-Zurek theory of non-equilibrium phase transitions are encoded
in quasi-periodic time evolution of the transverse magnetization and Loschmidt
echo.
|
quant-ph cond-mat.quant-gas cond-mat.stat-mech
|
we drive the onedimensional quantum ising chain in the transverse field from the paramagnetic phase to the critical point and study its free evolution there we analyze excitation of such a system at the critical point and dynamics of its transverse magnetization and loschmidt echo during free evolution we discuss how the system size and quenchinduced scaling relations from the kibblezurek theory of nonequilibrium phase transitions are encoded in quasiperiodic time evolution of the transverse magnetization and loschmidt echo
|
[['we', 'drive', 'the', 'onedimensional', 'quantum', 'ising', 'chain', 'in', 'the', 'transverse', 'field', 'from', 'the', 'paramagnetic', 'phase', 'to', 'the', 'critical', 'point', 'and', 'study', 'its', 'free', 'evolution', 'there', 'we', 'analyze', 'excitation', 'of', 'such', 'a', 'system', 'at', 'the', 'critical', 'point', 'and', 'dynamics', 'of', 'its', 'transverse', 'magnetization', 'and', 'loschmidt', 'echo', 'during', 'free', 'evolution', 'we', 'discuss', 'how', 'the', 'system', 'size', 'and', 'quenchinduced', 'scaling', 'relations', 'from', 'the', 'kibblezurek', 'theory', 'of', 'nonequilibrium', 'phase', 'transitions', 'are', 'encoded', 'in', 'quasiperiodic', 'time', 'evolution', 'of', 'the', 'transverse', 'magnetization', 'and', 'loschmidt', 'echo']]
|
[-0.18723525655679876, 0.25321885777189385, -0.11020266758042234, 0.08072369029344637, 0.040054392187467106, -0.11029005673702193, 0.05236529750613896, 0.36476993420503184, -0.3024601230421398, -0.20817422257335502, 0.078614405665806, -0.28095672870219884, -0.13665680877298494, 0.16885476810503988, 0.07865325360900804, 0.09945172904784308, -0.0133315838749603, 0.03435635078061797, -0.1047346859557342, -0.1441236943289449, 0.33525934951273795, -0.024111057214639325, 0.29783734915589416, 0.03436941900467382, 0.06662814107523123, 0.07581910028275621, 0.09686433012844829, -0.02622879455691274, -0.19545674769655813, -0.037025889652910864, 0.17623730389183223, 0.06253361052397309, 0.1667961264854368, -0.431760793622536, -0.17878252910332212, 0.10044394547850648, 0.17318329863144155, 0.17907872623940813, -0.0021632476415060745, -0.2698660909899664, -0.019006699948465523, -0.1424289788767884, -0.17762178159024142, -0.08206525947780738, 0.007570358542902277, 0.055289810378976824, -0.17192392394276737, 0.14029996706573647, 0.07009421934998489, 0.12583780050560645, -0.05914582812840331, 0.012983235203413457, -0.04992328729787016, 0.14225705045192868, 0.05085428409231237, 0.08191561144540864, 0.18999561567826173, -0.1466756546221485, -0.14112570525818988, 0.3209537058314191, -0.053404789270620937, -0.08250319092428382, 0.1693149067084246, -0.23525312413237517, -0.10527454300848413, 0.13466413722291024, 0.14174603952590045, 0.06085397644982308, -0.12014276848603453, 0.07699357566023629, 0.06978016959715493, 0.16299864810138434, -0.006271397494534149, 0.06956260076052026, 0.24913873547051527, 0.17550335770260683, -0.017650465274677625, 0.21421901009316685, -0.14111501888572414, -0.21794742368208833, -0.2939257000608346, -0.16119846326735202, -0.22825217183349253, 0.11501156003509141, -0.10403969137589712, -0.16793252374458162, 0.47633360918092577, 0.19830735422240225, 0.1789678867222576, -0.0038898534648403337, 0.23792245524310612, 0.1717556164941833, -0.009541077834047094, 0.07970615312504241, 0.21022592099454207, 0.17194411644853558, 0.19828724323866206, -0.38505252388812883, -0.0033647166565060616, 0.06457400206429294]
|
1,803.05209
|
Building Sparse Deep Feedforward Networks using Tree Receptive Fields
|
Sparse connectivity is an important factor behind the success of
convolutional neural networks and recurrent neural networks. In this paper, we
consider the problem of learning sparse connectivity for feedforward neural
networks (FNNs). The key idea is that a unit should be connected to a small
number of units at the next level below that are strongly correlated. We use
Chow-Liu's algorithm to learn a tree-structured probabilistic model for the
units at the current level, use the tree to identify subsets of units that are
strongly correlated, and introduce a new unit with receptive field over the
subsets. The procedure is repeated on the new units to build multiple layers of
hidden units. The resulting model is called a TRF-net. Empirical results show
that, when compared to dense FNNs, TRF-net achieves better or comparable
classification performance with much fewer parameters and sparser structures.
They are also more interpretable.
|
cs.LG
|
sparse connectivity is an important factor behind the success of convolutional neural networks and recurrent neural networks in this paper we consider the problem of learning sparse connectivity for feedforward neural networks fnns the key idea is that a unit should be connected to a small number of units at the next level below that are strongly correlated we use chowlius algorithm to learn a treestructured probabilistic model for the units at the current level use the tree to identify subsets of units that are strongly correlated and introduce a new unit with receptive field over the subsets the procedure is repeated on the new units to build multiple layers of hidden units the resulting model is called a trfnet empirical results show that when compared to dense fnns trfnet achieves better or comparable classification performance with much fewer parameters and sparser structures they are also more interpretable
|
[['sparse', 'connectivity', 'is', 'an', 'important', 'factor', 'behind', 'the', 'success', 'of', 'convolutional', 'neural', 'networks', 'and', 'recurrent', 'neural', 'networks', 'in', 'this', 'paper', 'we', 'consider', 'the', 'problem', 'of', 'learning', 'sparse', 'connectivity', 'for', 'feedforward', 'neural', 'networks', 'fnns', 'the', 'key', 'idea', 'is', 'that', 'a', 'unit', 'should', 'be', 'connected', 'to', 'a', 'small', 'number', 'of', 'units', 'at', 'the', 'next', 'level', 'below', 'that', 'are', 'strongly', 'correlated', 'we', 'use', 'chowlius', 'algorithm', 'to', 'learn', 'a', 'treestructured', 'probabilistic', 'model', 'for', 'the', 'units', 'at', 'the', 'current', 'level', 'use', 'the', 'tree', 'to', 'identify', 'subsets', 'of', 'units', 'that', 'are', 'strongly', 'correlated', 'and', 'introduce', 'a', 'new', 'unit', 'with', 'receptive', 'field', 'over', 'the', 'subsets', 'the', 'procedure', 'is', 'repeated', 'on', 'the', 'new', 'units', 'to', 'build', 'multiple', 'layers', 'of', 'hidden', 'units', 'the', 'resulting', 'model', 'is', 'called', 'a', 'trfnet', 'empirical', 'results', 'show', 'that', 'when', 'compared', 'to', 'dense', 'fnns', 'trfnet', 'achieves', 'better', 'or', 'comparable', 'classification', 'performance', 'with', 'much', 'fewer', 'parameters', 'and', 'sparser', 'structures', 'they', 'are', 'also', 'more', 'interpretable']]
|
[-0.08199009707374177, 0.09630669110769743, 0.006373839684087655, 0.07180858928758393, -0.08563925391063094, -0.16184642632202856, 0.04071558080051608, 0.4648356455924182, -0.3227069798985432, -0.27557646742026354, 0.0676605263074603, -0.25889549951615004, -0.24900942667676457, 0.1913834565110376, -0.09889776172309087, 0.0367041599583523, 0.10000591446998819, 0.10543350811309085, -0.041544613920971106, -0.30713975552854866, 0.3056216687220952, 0.08701869708903391, 0.29818144460561974, -0.043511879139033885, 0.12045392731509717, -0.04611893050003283, 0.006241099170312799, 0.02391161886846711, -0.019238599267153968, 0.21934220427888093, 0.24474666576896761, 0.14385118529778615, 0.34321209104924366, -0.46055827314226794, -0.24168134784197498, 0.12588997532388774, 0.1392028656483082, 0.07386196611673924, 0.03915351569233061, -0.2475809382900981, 0.16362016666841148, -0.14611627377633904, 0.0005831510583259936, -0.1244016124320955, -0.031078113794551585, 0.015558008778165898, -0.3136821502225538, 0.02514312516974189, 0.05399089894931892, 0.026243490814070763, -0.012887002893819891, -0.11568877826332404, 0.016517380246057593, 0.1399011192243177, -0.017382211786502136, 0.09517487289970099, 0.12258178141160772, -0.18041264288095307, -0.12771265007041652, 0.31259296719498675, -0.02758359527857653, -0.21386073319369864, 0.20702792154946204, -0.05669145600886309, -0.19564136028097107, 0.09910088732581714, 0.24504617270852985, 0.06933983226531538, -0.1427927574163889, 0.0020763180399281456, -0.0946288443234717, 0.21737514212727546, 0.01349460994824767, 0.03205498963401749, 0.19442725960839669, 0.275289284874653, 0.07609535209063827, 0.12497952071837438, -0.11275570923944228, -0.07612884402082398, -0.22020262691457274, -0.09205601191918912, -0.17287992057872228, -0.009937637068074325, -0.1338766530506385, -0.17879829212896733, 0.4136208057660481, 0.185053678112233, 0.2499992029998323, 0.17015341343037013, 0.2940573789050867, 0.07398528273313723, 0.15221378025117105, 0.13412391155765488, 0.1580592525115333, 0.11419629861825499, 0.05802806890690057, -0.12738900577713702, 0.08535562766202051, 0.05021608452922825]
|
1,803.0521
|
LivDet 2017 Fingerprint Liveness Detection Competition 2017
|
Fingerprint Presentation Attack Detection (FPAD) deals with distinguishing
images coming from artificial replicas of the fingerprint characteristic, made
up of materials like silicone, gelatine or latex, and images coming from alive
fingerprints. Images are captured by modern scanners, typically relying on
solid-state or optical technologies. Since from 2009, the Fingerprint Liveness
Detection Competition (LivDet) aims to assess the performance of the
state-of-the-art algorithms according to a rigorous experimental protocol and,
at the same time, a simple overview of the basic achievements. The competition
is open to all academics research centers and all companies that work in this
field. The positive, increasing trend of the participants number, which
supports the success of this initiative, is confirmed even this year: 17
algorithms were submitted to the competition, with a larger involvement of
companies and academies. This means that the topic is relevant for both sides,
and points out that a lot of work must be done in terms of fundamental and
applied research.
|
cs.CV
|
fingerprint presentation attack detection fpad deals with distinguishing images coming from artificial replicas of the fingerprint characteristic made up of materials like silicone gelatine or latex and images coming from alive fingerprints images are captured by modern scanners typically relying on solidstate or optical technologies since from 2009 the fingerprint liveness detection competition livdet aims to assess the performance of the stateoftheart algorithms according to a rigorous experimental protocol and at the same time a simple overview of the basic achievements the competition is open to all academics research centers and all companies that work in this field the positive increasing trend of the participants number which supports the success of this initiative is confirmed even this year 17 algorithms were submitted to the competition with a larger involvement of companies and academies this means that the topic is relevant for both sides and points out that a lot of work must be done in terms of fundamental and applied research
|
[['fingerprint', 'presentation', 'attack', 'detection', 'fpad', 'deals', 'with', 'distinguishing', 'images', 'coming', 'from', 'artificial', 'replicas', 'of', 'the', 'fingerprint', 'characteristic', 'made', 'up', 'of', 'materials', 'like', 'silicone', 'gelatine', 'or', 'latex', 'and', 'images', 'coming', 'from', 'alive', 'fingerprints', 'images', 'are', 'captured', 'by', 'modern', 'scanners', 'typically', 'relying', 'on', 'solidstate', 'or', 'optical', 'technologies', 'since', 'from', '2009', 'the', 'fingerprint', 'liveness', 'detection', 'competition', 'livdet', 'aims', 'to', 'assess', 'the', 'performance', 'of', 'the', 'stateoftheart', 'algorithms', 'according', 'to', 'a', 'rigorous', 'experimental', 'protocol', 'and', 'at', 'the', 'same', 'time', 'a', 'simple', 'overview', 'of', 'the', 'basic', 'achievements', 'the', 'competition', 'is', 'open', 'to', 'all', 'academics', 'research', 'centers', 'and', 'all', 'companies', 'that', 'work', 'in', 'this', 'field', 'the', 'positive', 'increasing', 'trend', 'of', 'the', 'participants', 'number', 'which', 'supports', 'the', 'success', 'of', 'this', 'initiative', 'is', 'confirmed', 'even', 'this', 'year', '17', 'algorithms', 'were', 'submitted', 'to', 'the', 'competition', 'with', 'a', 'larger', 'involvement', 'of', 'companies', 'and', 'academies', 'this', 'means', 'that', 'the', 'topic', 'is', 'relevant', 'for', 'both', 'sides', 'and', 'points', 'out', 'that', 'a', 'lot', 'of', 'work', 'must', 'be', 'done', 'in', 'terms', 'of', 'fundamental', 'and', 'applied', 'research']]
|
[-0.08890583915144816, 0.0865276184733375, -0.0546942609391408, 0.013716728143481304, -0.06609444973582868, -0.15398349833412794, 0.056970180239295586, 0.3549644664861262, -0.22884608395397663, -0.3574390173656866, 0.13028603443381143, -0.33296524367760866, -0.12035503588267601, 0.21214639363879542, -0.09563301096786744, 0.05669233030639589, 0.08293160696048289, 0.030972631013719366, -0.008034210256300866, -0.29273252913262693, 0.2754644161691431, 0.05149359893403016, 0.3401518371538259, 0.0697705148224486, 0.06239428241879068, -0.007954882657213603, -0.08315520571632078, 0.020453740076800387, -0.079277472406784, 0.15254306240822188, 0.31214258332765893, 0.15475171079451683, 0.31425235531060025, -0.43517926266649737, -0.15912389699660706, 0.07531435366836377, 0.11569586047553457, 0.09886834624121547, -0.06396335710669518, -0.32761319816345347, 0.07083492716919863, -0.1641323478979757, -0.07902759212302043, -0.038885804833262226, 0.023394300416111947, 0.009730052586019156, -0.19649491946329362, 0.006664406150230206, 0.02832131334289443, 0.13800342928734607, -0.05032176710956264, -0.12547140556271189, 0.04204222879779991, 0.19375235800835072, 0.08138332557045942, 0.04901932579523418, 0.14047791322809644, -0.159495990772848, -0.14715773266798352, 0.39755318433744835, -0.02745869283680804, -0.08373392076173332, 0.2355047955425107, -0.08142540773988002, -0.11490786021167879, 0.1180199975715368, 0.17992560375496397, 0.08647325943020405, -0.16041828836896457, 0.02921367272065254, -0.017844386599608696, 0.18388793069971143, 0.07960631426831241, -0.0006507897676783613, 0.23410126272501658, 0.166650389394772, 0.010178090765839443, 0.11982229310597177, -0.04954181515495293, -0.08348771196760936, -0.22486895050969907, -0.15265351292036938, -0.18609075706481235, 0.02689862218685448, 0.0013981184643853338, -0.12616961961102788, 0.42285643870709466, 0.18355313932115677, 0.14866230301850009, 0.0019144639147270937, 0.3349695388693362, 0.0027959640749031676, 0.11249467194429599, 0.040045812504831704, 0.2087492679565912, 0.041985413010115734, 0.1300538862036774, -0.14736417504027485, 0.10971144402865321, 0.009064543541171588]
|
1,803.05211
|
Renormalized solutions to a chemotaxis system with consumption of
chemoattractant
|
This paper investigates a high-dimensional chemotaxis system with consumption
of chemoattractant \begin{eqnarray*} \left\{\begin{array}{l} u_t=\Delta
u-\nabla\cdot(u\nabla v), v_t=\Delta v-uv, \end{array}\right. \end{eqnarray*}
under homogeneous boundary conditions of Neumann type, in a bounded convex
domain $\Omega\subset\mathbb{R}^n~(n\geq4)$ with smooth boundary. It is proved
that if initial data satisfy $u_0\in C^0(\overline{\Omega})$ and $v_0\in
W^{1,q}(\Omega)$ for some $q>n$, the model possesses at least one global
renormalized solution.
|
math.AP
|
this paper investigates a highdimensional chemotaxis system with consumption of chemoattractant begineqnarray leftbeginarrayl u_tdelta unablacdotunabla v v_tdelta vuv endarrayright endeqnarray under homogeneous boundary conditions of neumann type in a bounded convex domain omegasubsetmathbbrnngeq4 with smooth boundary it is proved that if initial data satisfy u_0in c0overlineomega and v_0in w1qomega for some qn the model possesses at least one global renormalized solution
|
[['this', 'paper', 'investigates', 'a', 'highdimensional', 'chemotaxis', 'system', 'with', 'consumption', 'of', 'chemoattractant', 'begineqnarray', 'leftbeginarrayl', 'u_tdelta', 'unablacdotunabla', 'v', 'v_tdelta', 'vuv', 'endarrayright', 'endeqnarray', 'under', 'homogeneous', 'boundary', 'conditions', 'of', 'neumann', 'type', 'in', 'a', 'bounded', 'convex', 'domain', 'omegasubsetmathbbrnngeq4', 'with', 'smooth', 'boundary', 'it', 'is', 'proved', 'that', 'if', 'initial', 'data', 'satisfy', 'u_0in', 'c0overlineomega', 'and', 'v_0in', 'w1qomega', 'for', 'some', 'qn', 'the', 'model', 'possesses', 'at', 'least', 'one', 'global', 'renormalized', 'solution']]
|
[-0.19792887587100266, 0.05627506747841835, -0.018187572395739458, -0.054494501231238245, -0.08017205744157158, -0.2901645580849921, -0.09426965831274477, 0.32331081681186336, -0.3208531470814099, -0.08398670832781742, 0.1958031895085393, -0.36637626379573096, -0.04370418066779772, 0.15284881232849631, -0.15176832711634536, 0.10632934629296263, 0.10923107504883471, 0.0428370819776319, 0.007446015521418303, -0.19184767461071411, 0.35969500173814595, -0.19675485353606442, 0.19707228298454235, 0.03987168985089132, 0.18071074808831328, -0.04330582555461054, 0.12952487766742707, -0.05235519046739986, -0.28195759732104003, -0.008352438015087197, 0.22729163992529114, 0.09300359257031232, 0.33238247270540644, -0.3972526725692054, -0.20771465550205903, 0.2093550052649031, 0.10646460844824711, -0.07183799000146489, -0.022739481221651658, -0.2964793094433844, 0.13354890334885566, -0.08349828398786485, -0.20363116931791106, 0.021498387896766266, 0.05126640976717075, 0.05355341654891769, -0.4398105316174527, 0.18486532194850344, 0.047731050911049046, 0.014079427583298335, -0.2282678084836031, -0.14391687585933444, -0.0899709884232531, -0.020555255298192302, -0.0037923335776819537, 0.13760350085018824, -0.002385181157539288, -0.08586613409764444, 0.07718825352688631, 0.3507413938641548, -0.06902140130987391, -0.2803476228378713, 0.10555143781627217, -0.19027538943725328, -0.13382003013975918, 0.06723166212517147, 0.10503777527871232, 0.13661007393772404, -0.17732539226611455, 0.243149654364485, -0.08004854805379485, 0.15700012523060045, 0.1558864013136675, -0.026561863929964603, -0.015311870134125154, 0.1665954728766034, 0.1842748065168659, 0.0883890295168385, 0.011742358832270839, -0.0005693939165212214, -0.3573768084247907, -0.12378270191450914, -0.14272313312394544, 0.16548729416293403, -0.10121782539232906, -0.15231897515865664, 0.26435822489826627, 0.04781716507083426, 0.1398172712380377, 0.09146043991204351, 0.195928968458126, 0.1369481990734736, -0.0673164401979496, 0.15602270502131432, 0.06422154353397976, 0.10142102598135048, 0.21552120832105479, -0.27943923583176605, 0.025079402156795064, 0.13352097806127858]
|
1,803.05212
|
Maximum principle satisfying CWENO schemes for non-local conservation
laws
|
Central WENO schemes are a natural candidate for higher-order schemes for
non-local conservation laws, since the underlying reconstructions do not only
provide single point values of the solution but a complete (high-order)
reconstruction in every time step, which is beneficial to evaluate the integral
terms. Recently, in [C. Chalons et al., SIAM J. Sci. Comput., 40(1),
A288-A305], Discontinuous Galerkin (DG) schemes and Finite Volume WENO
(FV-WENO) schemes have been proposed to obtain high-order approximations for a
certain class of non-local conservation laws. In contrast to their schemes, the
presented CWENO approach neither requires a very restrictive CFL condition (as
the DG methods) nor an additional reconstruction step (as the FV-WENO schemes).
Further, by making use of the well-known linear scaling limiter of [X. Zhang
and C.-W. Shu, J. Comput. Phys., 229, p. 3091-3120], our CWENO schemes satisfy
a maximum principle for suitable non-local conservation laws.
|
math.NA
|
central weno schemes are a natural candidate for higherorder schemes for nonlocal conservation laws since the underlying reconstructions do not only provide single point values of the solution but a complete highorder reconstruction in every time step which is beneficial to evaluate the integral terms recently in c chalons et al siam j sci comput 401 a288a305 discontinuous galerkin dg schemes and finite volume weno fvweno schemes have been proposed to obtain highorder approximations for a certain class of nonlocal conservation laws in contrast to their schemes the presented cweno approach neither requires a very restrictive cfl condition as the dg methods nor an additional reconstruction step as the fvweno schemes further by making use of the wellknown linear scaling limiter of x zhang and cw shu j comput phys 229 p 30913120 our cweno schemes satisfy a maximum principle for suitable nonlocal conservation laws
|
[['central', 'weno', 'schemes', 'are', 'a', 'natural', 'candidate', 'for', 'higherorder', 'schemes', 'for', 'nonlocal', 'conservation', 'laws', 'since', 'the', 'underlying', 'reconstructions', 'do', 'not', 'only', 'provide', 'single', 'point', 'values', 'of', 'the', 'solution', 'but', 'a', 'complete', 'highorder', 'reconstruction', 'in', 'every', 'time', 'step', 'which', 'is', 'beneficial', 'to', 'evaluate', 'the', 'integral', 'terms', 'recently', 'in', 'c', 'chalons', 'et', 'al', 'siam', 'j', 'sci', 'comput', '401', 'a288a305', 'discontinuous', 'galerkin', 'dg', 'schemes', 'and', 'finite', 'volume', 'weno', 'fvweno', 'schemes', 'have', 'been', 'proposed', 'to', 'obtain', 'highorder', 'approximations', 'for', 'a', 'certain', 'class', 'of', 'nonlocal', 'conservation', 'laws', 'in', 'contrast', 'to', 'their', 'schemes', 'the', 'presented', 'cweno', 'approach', 'neither', 'requires', 'a', 'very', 'restrictive', 'cfl', 'condition', 'as', 'the', 'dg', 'methods', 'nor', 'an', 'additional', 'reconstruction', 'step', 'as', 'the', 'fvweno', 'schemes', 'further', 'by', 'making', 'use', 'of', 'the', 'wellknown', 'linear', 'scaling', 'limiter', 'of', 'x', 'zhang', 'and', 'cw', 'shu', 'j', 'comput', 'phys', '229', 'p', '30913120', 'our', 'cweno', 'schemes', 'satisfy', 'a', 'maximum', 'principle', 'for', 'suitable', 'nonlocal', 'conservation', 'laws']]
|
[-0.09240023005501523, -0.003760701629794817, -0.09071271654748772, 0.016609182734100614, -0.10425403410853404, -0.18993089609042121, 0.0580123065770345, 0.3346370122680027, -0.22460793668869883, -0.3167164559320857, 0.07476721579749007, -0.17381050486841965, -0.07560536261674618, 0.1920101965507557, -0.14438272016640338, 0.11791507911008618, 0.038679848205194704, -0.09284828556357955, -0.10093187445697065, -0.26697781392269665, 0.2446369997665493, 0.060111674189101905, 0.3201172221763247, 0.028924249122307327, 0.1556232649470783, -0.03605472276750435, -0.10905468410864058, 0.024764112766004272, -0.13410301111758194, 0.06807934900280088, 0.2761954151978393, 0.025426073698326945, 0.30755578770509195, -0.38689526532895496, -0.26452601010290283, 0.11109796159831199, 0.077590819483804, 0.1036939410316538, -0.026302837766706944, -0.2314354078423801, 0.14265211788976254, -0.18657392000669562, -0.10297324125389827, -0.13054188034341982, 0.07010280876420438, 0.07904972510004882, -0.3570614162534993, 0.14485722130403803, 0.11513574883186568, 0.047768782901888095, 0.009944193600353578, -0.11343453593629722, -0.060025448366003625, 0.011095923552703526, -0.08269937104099274, 0.023659854910672747, -0.002043221137379684, -0.06625479511295554, -0.15900512653428855, 0.4254618175327778, -0.008692111302581098, -0.2662791696170138, 0.22058180899411026, -0.06524140368694337, -0.1470044480142355, 0.15750992950052023, 0.1178414805880392, 0.21518239942249945, -0.11210439345126764, 0.14131300803193073, -0.024899878954683017, 0.13463701910000558, 0.09937706129534894, 0.016846866017860722, 0.05136887138036804, 0.07257259424336047, 0.11559762046737079, -0.014717774606752856, -0.06616448584342531, -0.11138351237079608, -0.34061588488839334, -0.16774990461514486, -0.19075599132823604, 0.009208737423048459, -0.05249001430456701, -0.1530487990498336, 0.31451439530226505, 0.09696698342708664, 0.10198792671306162, 0.03548730760182176, 0.2652430762666174, 0.17696033684882828, 0.04661056066187383, 0.13085347932064906, 0.20657371824361487, 0.19391045762717518, 0.16124822548913975, -0.21903186011412698, 0.0020836142106822487, 0.2401828331801678]
|
1,803.05213
|
Global generalized solutions to a nonlinear Keller-Segel equation with
singular sensitivity
|
We consider the chemotaxis system \begin{eqnarray*} \begin{cases}
\begin{array}{lll} \medskip u_t =\Delta u^m - \nabla(\frac{u}{v}\nabla v),&{}
x\in\Omega,\ t>0, \medskip v_t =\Delta v -uv,&{}x\in\Omega,\ t>0, \medskip
\frac{\partial u}{\partial \nu}=\frac{\partial
v}{\partial\nu}=0,&{}x\in\partial\Omega,\ t>0, \medskip u(x,0)=u_0(x),\
v(x,0)=v_0(x), &{}x\in\Omega, \end{array} \end{cases} \end{eqnarray*} in a
smooth bounded domain $\Omega\subset \mathbb{R}^n$, $n\geq2$. In this work it
is shown that for all reasonably regular initial data $u_0\geq0$ and $v_0>0$,
the corresponding Neumann initial-boundary value problem possesses a global
generalized solution provided that $m>1+\frac{n-2}{2n}$.
|
math.AP
|
we consider the chemotaxis system begineqnarray begincases beginarraylll medskip u_t delta um nablafracuvnabla v xinomega t0 medskip v_t delta v uvxinomega t0 medskip fracpartial upartial nufracpartial vpartialnu0xinpartialomega t0 medskip ux0u_0x vx0v_0x xinomega endarray endcases endeqnarray in a smooth bounded domain omegasubset mathbbrn ngeq2 in this work it is shown that for all reasonably regular initial data u_0geq0 and v_00 the corresponding neumann initialboundary value problem possesses a global generalized solution provided that m1fracn22n
|
[['we', 'consider', 'the', 'chemotaxis', 'system', 'begineqnarray', 'begincases', 'beginarraylll', 'medskip', 'u_t', 'delta', 'um', 'nablafracuvnabla', 'v', 'xinomega', 't0', 'medskip', 'v_t', 'delta', 'v', 'uvxinomega', 't0', 'medskip', 'fracpartial', 'upartial', 'nufracpartial', 'vpartialnu0xinpartialomega', 't0', 'medskip', 'ux0u_0x', 'vx0v_0x', 'xinomega', 'endarray', 'endcases', 'endeqnarray', 'in', 'a', 'smooth', 'bounded', 'domain', 'omegasubset', 'mathbbrn', 'ngeq2', 'in', 'this', 'work', 'it', 'is', 'shown', 'that', 'for', 'all', 'reasonably', 'regular', 'initial', 'data', 'u_0geq0', 'and', 'v_00', 'the', 'corresponding', 'neumann', 'initialboundary', 'value', 'problem', 'possesses', 'a', 'global', 'generalized', 'solution', 'provided', 'that', 'm1fracn22n']]
|
[-0.23507740567067126, 0.002559043661070367, 0.06096009217688571, -0.06919124574683931, -0.08782096093383861, -0.3406892911247585, -0.1277144347820296, 0.3196530580702845, -0.35248221498171706, 0.02462987947291222, 0.20219139118705862, -0.5397607263960484, -0.016022165887989104, 0.09747388543210168, -0.10668545148834802, 0.1252601764070383, 0.034712486041615295, 0.028397976201486545, 0.012122602640664663, -0.1149216410940162, 0.31237054366088624, -0.35434592548467597, 0.10164626254497663, 0.09777296397268125, 0.16829292896115963, -0.06769153685983864, 0.23417421476240607, -0.10081334914877146, -0.46510113562913646, -0.15069137635283117, 0.27562436812381813, 0.040686549956275936, 0.3659100032047085, -0.3445608535160621, -0.14355325039165714, 0.24324518552832847, 0.19073814487732624, -0.1725815593170515, 0.049204331260862884, -0.4337813271128613, 0.13613405566919, -0.048149783464580556, -0.2168171115452002, 0.04387610292305117, 0.1934700863894777, 0.05451911300474751, -0.5052588994790247, 0.27554952338391886, 0.10595376294889096, -0.05716810300372595, -0.20762982133074084, -0.30559371041127253, -0.10844951880879808, -0.035869953499270094, -0.11309120171548177, 0.28273796041806537, -0.06656181586204447, -0.017830283013239936, 0.10188649246550124, 0.365300248120574, -0.09154685386591524, -0.3043646431811478, -0.06357780714397845, -0.22267628867395114, -0.1428183895975277, 0.010895382012308075, 0.05768493377347139, 0.19416073653037133, -0.18618905822328036, 0.3377146332421799, -0.10223038769934488, 0.15599261222245253, 0.18704030264600896, -0.08915247623741195, -0.09896502384672994, 0.14276388151979452, 0.15852012680641012, -0.02235803702522231, 0.030979018232386992, 0.0032307253948048406, -0.37365345324835053, -0.07339261510017989, -0.10858318389332651, 0.2725784266637503, -0.08153115666747275, -0.11501209184222018, 0.18981016151256103, 0.07564156241647467, 0.15752568949972265, 0.1057879676843278, 0.112707636339347, 0.18402290365159296, -0.17042053066720458, 0.19542363118650258, -0.03779816667994727, 0.08449193310545947, 0.2984347681150488, -0.3269355408678614, -0.03874398209154606, 0.14073240800918438]
|
1,803.05214
|
Exceptional Points in an Specialty Microcavity: Interplay between
State-Conversion and Cavity Control Parameters
|
Exploiting scattering-matrix in a gain-loss assisted optical-microcavity,
interplay between asymmetric-state-conversion and cavity-control parameters
around exceptional points is analyzed; where occupying a least area by coupled
states during switching, maximum conversion-efficiency with minimal asymmetry
is achieved.
|
physics.optics
|
exploiting scatteringmatrix in a gainloss assisted opticalmicrocavity interplay between asymmetricstateconversion and cavitycontrol parameters around exceptional points is analyzed where occupying a least area by coupled states during switching maximum conversionefficiency with minimal asymmetry is achieved
|
[['exploiting', 'scatteringmatrix', 'in', 'a', 'gainloss', 'assisted', 'opticalmicrocavity', 'interplay', 'between', 'asymmetricstateconversion', 'and', 'cavitycontrol', 'parameters', 'around', 'exceptional', 'points', 'is', 'analyzed', 'where', 'occupying', 'a', 'least', 'area', 'by', 'coupled', 'states', 'during', 'switching', 'maximum', 'conversionefficiency', 'with', 'minimal', 'asymmetry', 'is', 'achieved']]
|
[-0.2352055958181154, 0.198015034198761, -0.03299680896452628, -0.01966566473856801, -0.013210902850914863, -0.22890067633125, 0.12675640842644498, 0.35374490030517336, -0.22566369420383126, -0.35135413508396596, 0.061924981429910986, -0.31502564216498286, -0.1380717804422602, 0.14841516234446317, -0.020873678411589935, -0.033395412130630575, 0.015519956999924034, -0.009907630716043059, -0.04935890805791132, -0.15873541601467878, 0.26120686170179397, 0.03272316353832139, 0.2927566495491192, 0.033586383622605354, 0.1614897768740775, 0.05029266077326611, 0.06973885663319379, 0.02996478988279705, -0.09500967412895989, 0.10006130831425253, 0.2425482301041484, -0.026478971994947642, 0.23059483140241355, -0.4002934822929092, -0.1960719193739351, 0.1265195097657852, 0.16603030739861424, 0.0250053180498071, -0.07719906393322162, -0.24225793592631817, 0.04918511345749721, -0.049556323152501136, -0.13523903746681754, 0.019386830143048428, 0.03291697408712935, -0.005271913716569543, -0.3255695106345229, 0.08962622593389824, -0.0531816954317037, 0.16088120604399592, 0.014332682738313451, -0.048097363629494794, -0.12226060638204217, 0.04492602151003666, 0.0017160936404252425, -0.03171465758350678, 0.09142663506645476, -0.12741640453168657, -0.1153782982728444, 0.28179460746468976, -0.0663386145606637, -0.1632441717083566, 0.11944336065789685, -0.13799241128435824, -0.011895634845132008, 0.15482829539541854, 0.13689864790649153, 0.09475108786136843, -0.13931981555651873, 0.10582458518729254, 0.0372747460132814, 0.19251494418131188, 0.1580786758568138, 0.019540569010132458, 0.23869272563024424, 0.22929653200844768, 0.06712675308517646, 0.20572298229672015, -0.0881229987135157, -0.18973418749374105, -0.27148192356617074, -0.06977133997133933, -0.23632308261585422, 0.030621863901615143, -0.08768454882329024, -0.014791697438340634, 0.4425503711681813, 0.028379277646308765, 0.24141153410892002, -0.07278899333323352, 0.23182145622558892, 0.1447003559442237, 0.07631220103939995, 0.11103171942522749, 0.2916912184882676, 0.14538739779527532, 0.013969378604087979, -0.28010060082306154, 0.04875757734407671, 0.025080350216740044]
|
1,803.05215
|
Deep Image Demosaicking using a Cascade of Convolutional Residual
Denoising Networks
|
Demosaicking and denoising are among the most crucial steps of modern digital
camera pipelines and their joint treatment is a highly ill-posed inverse
problem where at-least two-thirds of the information are missing and the rest
are corrupted by noise. This poses a great challenge in obtaining meaningful
reconstructions and a special care for the efficient treatment of the problem
is required. While there are several machine learning approaches that have been
recently introduced to deal with joint image demosaicking-denoising, in this
work we propose a novel deep learning architecture which is inspired by
powerful classical image regularization methods and large-scale convex
optimization techniques. Consequently, our derived network is more transparent
and has a clear interpretation compared to alternative competitive deep
learning approaches. Our extensive experiments demonstrate that our network
outperforms any previous approaches on both noisy and noise-free data. This
improvement in reconstruction quality is attributed to the principled way we
design our network architecture, which also requires fewer trainable parameters
than the current state-of-the-art deep network solution. Finally, we show that
our network has the ability to generalize well even when it is trained on small
datasets, while keeping the overall number of trainable parameters low.
|
cs.CV
|
demosaicking and denoising are among the most crucial steps of modern digital camera pipelines and their joint treatment is a highly illposed inverse problem where atleast twothirds of the information are missing and the rest are corrupted by noise this poses a great challenge in obtaining meaningful reconstructions and a special care for the efficient treatment of the problem is required while there are several machine learning approaches that have been recently introduced to deal with joint image demosaickingdenoising in this work we propose a novel deep learning architecture which is inspired by powerful classical image regularization methods and largescale convex optimization techniques consequently our derived network is more transparent and has a clear interpretation compared to alternative competitive deep learning approaches our extensive experiments demonstrate that our network outperforms any previous approaches on both noisy and noisefree data this improvement in reconstruction quality is attributed to the principled way we design our network architecture which also requires fewer trainable parameters than the current stateoftheart deep network solution finally we show that our network has the ability to generalize well even when it is trained on small datasets while keeping the overall number of trainable parameters low
|
[['demosaicking', 'and', 'denoising', 'are', 'among', 'the', 'most', 'crucial', 'steps', 'of', 'modern', 'digital', 'camera', 'pipelines', 'and', 'their', 'joint', 'treatment', 'is', 'a', 'highly', 'illposed', 'inverse', 'problem', 'where', 'atleast', 'twothirds', 'of', 'the', 'information', 'are', 'missing', 'and', 'the', 'rest', 'are', 'corrupted', 'by', 'noise', 'this', 'poses', 'a', 'great', 'challenge', 'in', 'obtaining', 'meaningful', 'reconstructions', 'and', 'a', 'special', 'care', 'for', 'the', 'efficient', 'treatment', 'of', 'the', 'problem', 'is', 'required', 'while', 'there', 'are', 'several', 'machine', 'learning', 'approaches', 'that', 'have', 'been', 'recently', 'introduced', 'to', 'deal', 'with', 'joint', 'image', 'demosaickingdenoising', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'deep', 'learning', 'architecture', 'which', 'is', 'inspired', 'by', 'powerful', 'classical', 'image', 'regularization', 'methods', 'and', 'largescale', 'convex', 'optimization', 'techniques', 'consequently', 'our', 'derived', 'network', 'is', 'more', 'transparent', 'and', 'has', 'a', 'clear', 'interpretation', 'compared', 'to', 'alternative', 'competitive', 'deep', 'learning', 'approaches', 'our', 'extensive', 'experiments', 'demonstrate', 'that', 'our', 'network', 'outperforms', 'any', 'previous', 'approaches', 'on', 'both', 'noisy', 'and', 'noisefree', 'data', 'this', 'improvement', 'in', 'reconstruction', 'quality', 'is', 'attributed', 'to', 'the', 'principled', 'way', 'we', 'design', 'our', 'network', 'architecture', 'which', 'also', 'requires', 'fewer', 'trainable', 'parameters', 'than', 'the', 'current', 'stateoftheart', 'deep', 'network', 'solution', 'finally', 'we', 'show', 'that', 'our', 'network', 'has', 'the', 'ability', 'to', 'generalize', 'well', 'even', 'when', 'it', 'is', 'trained', 'on', 'small', 'datasets', 'while', 'keeping', 'the', 'overall', 'number', 'of', 'trainable', 'parameters', 'low']]
|
[-0.049514686792723035, -0.029774632100586076, -0.05450269855958011, 0.053935235997600174, -0.12308486653800711, -0.18378382825948375, 0.008621887455941463, 0.4485092716557639, -0.24258608750364036, -0.346258174404692, 0.10193110658307275, -0.2579546489153528, -0.22107673040531783, 0.21764717660357283, -0.15953142239061202, 0.11499311871724488, 0.1488089102465298, 0.0072881724163937405, -0.07528510913894303, -0.2937206437345594, 0.28523095506801727, 0.0658822331931834, 0.3448143637933939, 0.0056730035564158945, 0.14150848072558245, -0.009735617831786524, -0.0618218439779653, 0.02284631975724514, -0.04288837817679153, 0.17680582107990334, 0.3124816718853402, 0.18708845168739385, 0.3467614866569828, -0.4283832505972562, -0.264877818263497, 0.11837313390736069, 0.1585379764615862, 0.12519997312416792, -0.05686828852501966, -0.2963790167016167, 0.09401765002153947, -0.13850206586446764, 0.024119839856249034, -0.16290545447406415, -0.02032207655102699, -0.0438388030131452, -0.2962397235764632, 0.06647647582739948, 0.06493922092593085, 0.01593940000867053, -0.0395331913047014, -0.15466324978731383, 0.05180048157356451, 0.1432587962940024, 0.04322581290331555, 0.09424916238996808, 0.11827774724343373, -0.1842486044981194, -0.10369992773618777, 0.3515716298834934, -0.02083661232794913, -0.2160317168609068, 0.21195264963780017, -0.018954233784342602, -0.15973222254043712, 0.12537381901436637, 0.18553079412869958, 0.12429411209673069, -0.16826127294953783, 0.04076524143394116, -0.053214996582139476, 0.16844407801174235, 0.0051097002341316975, 0.01548626467500034, 0.149799355685269, 0.2711395391355725, 0.07085893151934772, 0.12230515679313649, -0.11976030660788434, -0.06349802103216703, -0.19891118663315643, -0.08800617654864885, -0.20424312675889694, -0.019057374319289715, -0.09585060582596307, -0.12299332341858737, 0.3843761081569733, 0.24049271644201195, 0.21495447668237422, 0.10131825252355324, 0.4196384686617922, 0.05829496645161939, 0.111659554649401, 0.0938827214353927, 0.23126162015488466, 0.04233107084470174, 0.11466811076032321, -0.16260228565435533, 0.09111587372869823, -0.0003204440961743952]
|
1,803.05216
|
Metric-space approach for distinguishing quantum phase transitions in
spin-imbalanced systems
|
Metric spaces are characterized by distances between pairs of elements.
Systems that are physically similar are expected to present smaller distances
(between their densities, wave functions and potentials) than systems that
present different physical behaviors. For this reason metric spaces are good
candidates for probing quantum phase transitions, since they could identify
regimes of distinct phases. Here we apply metric space analysis to explore the
transitions between the several phases in spin imbalanced systems. In
particular we investigate the so-called FFLO (Fulde-Ferrel-Larkin-Ovchinnikov)
phase, which is an intriguing phenomenon in which superconductivity and
magnetism coexist in the same material. This is expected to appear for example
in attractive fermionic systems with spin-imbalanced populations, due to the
internal polarization produced by the imbalance. The transition between FFLO
phase (superconducting phase) and the normal phase (non-superconducting) and
their boundaries have been subject of discussion in recent years. We consider
the Hubbard model in the attractive regime for which Density Matrix
Renormalization Group calculations allow us to obtain the exact density
function of the system. We then analyze the exact density distances as a
function of the polarization. We find that our distances display signatures of
the distinct quantum phases in spin-imbalanced fermionic systems: with respect
to a central reference polarization, systems without FFLO present a very
symmetric behavior, while systems with phase transitions are asymmetric.
|
quant-ph cond-mat.supr-con
|
metric spaces are characterized by distances between pairs of elements systems that are physically similar are expected to present smaller distances between their densities wave functions and potentials than systems that present different physical behaviors for this reason metric spaces are good candidates for probing quantum phase transitions since they could identify regimes of distinct phases here we apply metric space analysis to explore the transitions between the several phases in spin imbalanced systems in particular we investigate the socalled fflo fuldeferrellarkinovchinnikov phase which is an intriguing phenomenon in which superconductivity and magnetism coexist in the same material this is expected to appear for example in attractive fermionic systems with spinimbalanced populations due to the internal polarization produced by the imbalance the transition between fflo phase superconducting phase and the normal phase nonsuperconducting and their boundaries have been subject of discussion in recent years we consider the hubbard model in the attractive regime for which density matrix renormalization group calculations allow us to obtain the exact density function of the system we then analyze the exact density distances as a function of the polarization we find that our distances display signatures of the distinct quantum phases in spinimbalanced fermionic systems with respect to a central reference polarization systems without fflo present a very symmetric behavior while systems with phase transitions are asymmetric
|
[['metric', 'spaces', 'are', 'characterized', 'by', 'distances', 'between', 'pairs', 'of', 'elements', 'systems', 'that', 'are', 'physically', 'similar', 'are', 'expected', 'to', 'present', 'smaller', 'distances', 'between', 'their', 'densities', 'wave', 'functions', 'and', 'potentials', 'than', 'systems', 'that', 'present', 'different', 'physical', 'behaviors', 'for', 'this', 'reason', 'metric', 'spaces', 'are', 'good', 'candidates', 'for', 'probing', 'quantum', 'phase', 'transitions', 'since', 'they', 'could', 'identify', 'regimes', 'of', 'distinct', 'phases', 'here', 'we', 'apply', 'metric', 'space', 'analysis', 'to', 'explore', 'the', 'transitions', 'between', 'the', 'several', 'phases', 'in', 'spin', 'imbalanced', 'systems', 'in', 'particular', 'we', 'investigate', 'the', 'socalled', 'fflo', 'fuldeferrellarkinovchinnikov', 'phase', 'which', 'is', 'an', 'intriguing', 'phenomenon', 'in', 'which', 'superconductivity', 'and', 'magnetism', 'coexist', 'in', 'the', 'same', 'material', 'this', 'is', 'expected', 'to', 'appear', 'for', 'example', 'in', 'attractive', 'fermionic', 'systems', 'with', 'spinimbalanced', 'populations', 'due', 'to', 'the', 'internal', 'polarization', 'produced', 'by', 'the', 'imbalance', 'the', 'transition', 'between', 'fflo', 'phase', 'superconducting', 'phase', 'and', 'the', 'normal', 'phase', 'nonsuperconducting', 'and', 'their', 'boundaries', 'have', 'been', 'subject', 'of', 'discussion', 'in', 'recent', 'years', 'we', 'consider', 'the', 'hubbard', 'model', 'in', 'the', 'attractive', 'regime', 'for', 'which', 'density', 'matrix', 'renormalization', 'group', 'calculations', 'allow', 'us', 'to', 'obtain', 'the', 'exact', 'density', 'function', 'of', 'the', 'system', 'we', 'then', 'analyze', 'the', 'exact', 'density', 'distances', 'as', 'a', 'function', 'of', 'the', 'polarization', 'we', 'find', 'that', 'our', 'distances', 'display', 'signatures', 'of', 'the', 'distinct', 'quantum', 'phases', 'in', 'spinimbalanced', 'fermionic', 'systems', 'with', 'respect', 'to', 'a', 'central', 'reference', 'polarization', 'systems', 'without', 'fflo', 'present', 'a', 'very', 'symmetric', 'behavior', 'while', 'systems', 'with', 'phase', 'transitions', 'are', 'asymmetric']]
|
[-0.19447419887224027, 0.20204307735004295, -0.09958609954563079, 0.08912433267084395, -0.007321021641260601, -0.14385976929318262, 0.06042271685945961, 0.3915244586228787, -0.2285202646311813, -0.28125698070869326, 0.04548173560551158, -0.2915502241896549, -0.14985902583948127, 0.14459514320693775, 0.026290033947556333, 0.014471046651738722, -0.020869417890574917, -0.02927476175859369, -0.16534518995815217, -0.20200700697757573, 0.36251728926357385, -0.012353083837608522, 0.288339151314938, 0.0158331007319125, 0.037184823646319205, -0.03893144113622052, 0.0624163978867367, 0.015803416534237825, -0.13726496287599402, 0.059290514482806124, 0.2929446013677899, 0.015470987025371476, 0.18231021186655705, -0.4141296754414971, -0.24090670761893512, 0.14022178490549694, 0.13493821884690038, 0.15066737112188544, -0.05720360481247373, -0.3188840435851399, 0.017374698346405214, -0.17239391431002668, -0.14591006930447645, -0.11987363616463954, 0.05157284391309797, 0.03162828507400034, -0.21457219978077086, 0.10464105868149919, 0.010325702972057788, 0.04904914068643225, -0.07437215242818049, -0.09375389651154159, -0.01493196803468137, 0.11063917931840495, 0.023318888257710717, 0.02725886168306576, 0.06679784155674677, -0.1310118981605597, -0.10080477809491525, 0.382769359972093, -0.021579363259923674, -0.1308472087107434, 0.25020132739902345, -0.17012190225088145, -0.0936514885397628, 0.11841901570143229, 0.16986689734406904, 0.09257094247207918, -0.13772354869755102, 0.04550643169493121, -0.000509023720328801, 0.15103077899763226, 0.006334523230933727, 0.12419711149702486, 0.27767087957561687, 0.13804203967316295, 0.05554126403273528, 0.16147718301697359, -0.06653638874801497, -0.14365389290725109, -0.253391190673233, -0.14338676634282377, -0.17059244456499614, -0.008495861623315077, -0.06382286524675945, -0.17445340981446877, 0.37891017681046446, 0.16921242568190922, 0.22294591887023402, -0.017147075839504297, 0.23239379067200464, 0.1010339409930984, 0.04206775846945642, 0.043595273184027894, 0.2738248435067231, 0.14698227304075887, 0.08045252217535719, -0.23448461916943728, 0.057871247742687947, 0.04177902984067898]
|
1,803.05217
|
Vapor-liquid equilibrium and equation of state of two-dimensional fluids
from a discrete perturbation theory
|
The interest in the description of the properties of fluids of restricted
dimensionality is growing for theoretical and practical reasons. In this work,
we have firstly developed an analytical expression for the Helmholtz free
energy of the two-dimensional square-well fluid in the Barker--Henderson
framework. This equation of state is based on an approximate analytical radial
distribution function for $d$-dimensional hard-sphere fluids ($1\leq d\leq 3$)
and is validated against existing and new simulation results. The so-obtained
equation of state is implemented in a discrete perturbation theory able to
account for general potential shapes. The prototypical Lennard-Jones and Yukawa
fluids are tested in its two-dimensional version against available and new
simulation data with semi-quantitative agreement.
|
physics.chem-ph cond-mat.soft
|
the interest in the description of the properties of fluids of restricted dimensionality is growing for theoretical and practical reasons in this work we have firstly developed an analytical expression for the helmholtz free energy of the twodimensional squarewell fluid in the barkerhenderson framework this equation of state is based on an approximate analytical radial distribution function for ddimensional hardsphere fluids 1leq dleq 3 and is validated against existing and new simulation results the soobtained equation of state is implemented in a discrete perturbation theory able to account for general potential shapes the prototypical lennardjones and yukawa fluids are tested in its twodimensional version against available and new simulation data with semiquantitative agreement
|
[['the', 'interest', 'in', 'the', 'description', 'of', 'the', 'properties', 'of', 'fluids', 'of', 'restricted', 'dimensionality', 'is', 'growing', 'for', 'theoretical', 'and', 'practical', 'reasons', 'in', 'this', 'work', 'we', 'have', 'firstly', 'developed', 'an', 'analytical', 'expression', 'for', 'the', 'helmholtz', 'free', 'energy', 'of', 'the', 'twodimensional', 'squarewell', 'fluid', 'in', 'the', 'barkerhenderson', 'framework', 'this', 'equation', 'of', 'state', 'is', 'based', 'on', 'an', 'approximate', 'analytical', 'radial', 'distribution', 'function', 'for', 'ddimensional', 'hardsphere', 'fluids', '1leq', 'dleq', '3', 'and', 'is', 'validated', 'against', 'existing', 'and', 'new', 'simulation', 'results', 'the', 'soobtained', 'equation', 'of', 'state', 'is', 'implemented', 'in', 'a', 'discrete', 'perturbation', 'theory', 'able', 'to', 'account', 'for', 'general', 'potential', 'shapes', 'the', 'prototypical', 'lennardjones', 'and', 'yukawa', 'fluids', 'are', 'tested', 'in', 'its', 'twodimensional', 'version', 'against', 'available', 'and', 'new', 'simulation', 'data', 'with', 'semiquantitative', 'agreement']]
|
[-0.0804882962133043, 0.054788586302645985, -0.10038492559667561, 0.035025549518867535, -0.032825529422874734, -0.17001887911155952, -0.03216220522237596, 0.3307874945455449, -0.19910124280547672, -0.26861417349592775, 0.048177823048307505, -0.2815989335644496, -0.13044843074362888, 0.1956617598740211, -0.010421199419131848, 0.13200146521892878, 0.03908380779820964, 0.005952999164737695, -0.04960841059904191, -0.2120488549755738, 0.28742969283768166, 0.051427528972992985, 0.2899890681914161, 0.07360906953371205, 0.07991868595539106, 0.011330555129252308, 0.0026097625320925647, 0.0448921130788801, -0.23376342289734928, 0.09992497603293607, 0.23163981828014407, 0.056635112415142026, 0.23095337966193272, -0.4597331700203693, -0.2566338699767922, 0.057879486887724, 0.14416873435679395, 0.14106027862732917, -0.10188773992796948, -0.2778161953541294, 0.05930726803773272, -0.19709475758790443, -0.19344044721528755, -0.11714299893484706, 0.054713352702854746, 0.03042611133603923, -0.28676688888283297, 0.128220877610147, 0.013730927372549093, 0.05610968608541035, -0.14892522244924367, -0.13986099338204294, 0.006571830279169093, 0.07763198536894886, 0.02178896375956525, 0.010847136868674934, 0.06319311176904732, -0.13698338309253474, -0.08755903425255576, 0.4115414819886199, -0.05131364799211774, -0.2715307470180292, 0.21102743933958093, -0.07715600877340915, -0.10463291516247313, 0.11899129065233736, 0.1730857806844818, 0.10416063712330316, -0.17161187042989068, 0.13115231552422954, -0.04796122155354185, 0.14744154047797872, 0.012055032260188487, -0.05840300607287162, 0.14955587358372616, 0.20012053567298022, -0.015511541938475143, 0.16124889168237228, -0.06529513190075986, -0.1774104343391378, -0.31338806709880423, -0.1597536513499454, -0.24498999222445475, -0.0037517217204254944, -0.11326032166049375, -0.16301205171585348, 0.3628139067770897, 0.14524276868184716, 0.1110700941520982, 0.06968415473933966, 0.30916744637080523, 0.1094667839413855, -0.035533886637736475, 0.0766020280646935, 0.230301855560557, 0.14876634290285276, 0.08213258083431726, -0.19335254985608358, 0.0069064649390633654, 0.0676178062680812]
|
1,803.05218
|
Crystallization of hard spheres revisited. I. Extracting kinetics and
free energy landscape from forward flux sampling
|
We investigate the kinetics and the free energy landscape of the
crystallization of hard spheres from a supersaturated metastable liquid though
direct simulations and forward flux sampling. In this first paper, we describe
and test two different ways to reconstruct the free energy barriers from the
sampled steady state probability distribution of cluster sizes without sampling
the equilibrium distribution. The first method is based on mean first passage
times, the second on splitting probabilities. We verify both methods for a
single particle moving in a double-well potential. For the nucleation of hard
spheres, these methods allow to probe a wide range of supersaturations, and to
reconstruct the kinetics and the free energy landscape from the same
simulation. Results are consistent with the scaling predicted by classical
nucleation theory although a quantitative fit requires a rather large,
effective interfacial tension.
|
cond-mat.soft cond-mat.stat-mech
|
we investigate the kinetics and the free energy landscape of the crystallization of hard spheres from a supersaturated metastable liquid though direct simulations and forward flux sampling in this first paper we describe and test two different ways to reconstruct the free energy barriers from the sampled steady state probability distribution of cluster sizes without sampling the equilibrium distribution the first method is based on mean first passage times the second on splitting probabilities we verify both methods for a single particle moving in a doublewell potential for the nucleation of hard spheres these methods allow to probe a wide range of supersaturations and to reconstruct the kinetics and the free energy landscape from the same simulation results are consistent with the scaling predicted by classical nucleation theory although a quantitative fit requires a rather large effective interfacial tension
|
[['we', 'investigate', 'the', 'kinetics', 'and', 'the', 'free', 'energy', 'landscape', 'of', 'the', 'crystallization', 'of', 'hard', 'spheres', 'from', 'a', 'supersaturated', 'metastable', 'liquid', 'though', 'direct', 'simulations', 'and', 'forward', 'flux', 'sampling', 'in', 'this', 'first', 'paper', 'we', 'describe', 'and', 'test', 'two', 'different', 'ways', 'to', 'reconstruct', 'the', 'free', 'energy', 'barriers', 'from', 'the', 'sampled', 'steady', 'state', 'probability', 'distribution', 'of', 'cluster', 'sizes', 'without', 'sampling', 'the', 'equilibrium', 'distribution', 'the', 'first', 'method', 'is', 'based', 'on', 'mean', 'first', 'passage', 'times', 'the', 'second', 'on', 'splitting', 'probabilities', 'we', 'verify', 'both', 'methods', 'for', 'a', 'single', 'particle', 'moving', 'in', 'a', 'doublewell', 'potential', 'for', 'the', 'nucleation', 'of', 'hard', 'spheres', 'these', 'methods', 'allow', 'to', 'probe', 'a', 'wide', 'range', 'of', 'supersaturations', 'and', 'to', 'reconstruct', 'the', 'kinetics', 'and', 'the', 'free', 'energy', 'landscape', 'from', 'the', 'same', 'simulation', 'results', 'are', 'consistent', 'with', 'the', 'scaling', 'predicted', 'by', 'classical', 'nucleation', 'theory', 'although', 'a', 'quantitative', 'fit', 'requires', 'a', 'rather', 'large', 'effective', 'interfacial', 'tension']]
|
[-0.03349221107489664, 0.15416828458860732, -0.13591065010551712, 0.09859355880791763, 0.004737330185209247, -0.10594008783240327, 0.0782032874787625, 0.37391645904201615, -0.2717799679208681, -0.3338422326960688, 0.05500691731229237, -0.23786455207913043, -0.06825330393161062, 0.16702751484749798, -0.0003088662206537003, 0.07894140484628917, 0.06302709124560246, 0.007113846251741052, -0.06497395553847225, -0.19156918527387592, 0.2944803292755868, 0.05372215260034628, 0.31385739205284513, 0.05714081301397423, 0.10273374519947408, 0.012754189465261943, -0.0012536554416413789, 0.030797973087580085, -0.22394454038681852, 0.10598025815695417, 0.17668630562056017, 0.033392537334974076, 0.23849437720805622, -0.4602510139694531, -0.22699950073959588, 0.10923652868992616, 0.1296031169686299, 0.1542538493308875, -0.06749481527744491, -0.23137806264160993, 0.03851098881485008, -0.14710486614272641, -0.12681190071175447, -0.052950404296300824, -0.018468672660909752, 0.06639539154908929, -0.2431081130534491, 0.11363058599116609, -0.01792897683528098, 0.0082555894786827, -0.1164977277608977, -0.09317094068107423, -0.013089459419598897, 0.1276313240544388, 0.04217172897648629, -0.0002165624223609301, 0.17246431126694778, -0.1417600911013487, -0.10780177398403878, 0.387820249724892, -0.04925002457017896, -0.16322805848401442, 0.23570354810326274, -0.14996670637440554, -0.1054681397190572, 0.21437419941749344, 0.13761876689658747, 0.13609304659993207, -0.15239015515732893, 0.05456293541594683, 0.021213113608361363, 0.16974471765402838, 0.06196137006635771, -0.07434242926269984, 0.2202384964623254, 0.18745833037843218, 0.05836099731273574, 0.1455280347140975, -0.14751030439544444, -0.1801435199177576, -0.2905236857125817, -0.1676719267634849, -0.22627770730709698, 0.04393948828667509, -0.09420371462480859, -0.1773315883985312, 0.3748739786352292, 0.12590406349108038, 0.1954665917085765, 0.08195287443985559, 0.27827773232803604, 0.07725944191807037, 0.00048622977082356277, 0.029613926561160697, 0.21904248594500714, 0.11306834643833982, 0.09482351925203965, -0.22092669609311813, 0.041056959794351845, 0.02851258099193035]
|
1,803.05219
|
Global existence and boundedness of weak solutions to a
chemotaxis-stokes system with rotational flux term
|
In this paper, the three-dimensional chemotaxis-stokes system
\begin{eqnarray*} \left\{\begin{array}{lll} \medskip n_{t}+u\cdot\nabla
n=\Delta n^m-\nabla\cdot(n S(x,n,c)\cdot\nabla c),&x\in\Omega,\ \ t>0, \medskip
c_t+u\cdot\nabla c=\Delta c-nf(c),&x\in\Omega,\ \ t>0, \medskip u_t+\nabla
P=\Delta u +n\nabla\phi,&x\in\Omega,\ \ t>0, \nabla\cdot u=0, &x\in\Omega,\ \
t>0,, \end{array}\right. \end{eqnarray*} posed in a bounded domain
$\Omega\subset\mathbb{R}^3$ with smooth boundary is considered under the
no-flux boundary condition for $n$, $c$ and the Dirichlect boundary condition
for $u$ under the assumption that the Frobenius norm of the tensor-valued
chemotactic sensitivity $S(x,n,c)$ satisfies $S(x,n,c)<n^{l-2}\widetilde{S}(c)$
with $l>2$ for some non-decreasing function $\widetilde{S}\in
C^{2}((0,\infty))$. In present work, it is shown that the weak solution is
global in time and bounded while $m>m^\star(l)$, where \begin{eqnarray*}
m^\star(l)= \left\{\begin{array}{lll} \medskip l-\frac{5}{6},\ &\mathrm{if}\
\frac{31}{12}\geq l>2, \medskip \frac{7}{5}l-\frac{28}{15},\ &\mathrm{if}\
l>\frac{31}{12}. \end{array}\right. \end{eqnarray*}
|
math.AP
|
in this paper the threedimensional chemotaxisstokes system begineqnarray leftbeginarraylll medskip n_tucdotnabla ndelta nmnablacdotn sxnccdotnabla cxinomega t0 medskip c_tucdotnabla cdelta cnfcxinomega t0 medskip u_tnabla pdelta u nnablaphixinomega t0 nablacdot u0 xinomega t0 endarrayright endeqnarray posed in a bounded domain omegasubsetmathbbr3 with smooth boundary is considered under the noflux boundary condition for n c and the dirichlect boundary condition for u under the assumption that the frobenius norm of the tensorvalued chemotactic sensitivity sxnc satisfies sxncnl2widetildesc with l2 for some nondecreasing function widetildesin c20infty in present work it is shown that the weak solution is global in time and bounded while mmstarl where begineqnarray mstarl leftbeginarraylll medskip lfrac56 mathrmif frac3112geq l2 medskip frac75lfrac2815 mathrmif lfrac3112 endarrayright endeqnarray
|
[['in', 'this', 'paper', 'the', 'threedimensional', 'chemotaxisstokes', 'system', 'begineqnarray', 'leftbeginarraylll', 'medskip', 'n_tucdotnabla', 'ndelta', 'nmnablacdotn', 'sxnccdotnabla', 'cxinomega', 't0', 'medskip', 'c_tucdotnabla', 'cdelta', 'cnfcxinomega', 't0', 'medskip', 'u_tnabla', 'pdelta', 'u', 'nnablaphixinomega', 't0', 'nablacdot', 'u0', 'xinomega', 't0', 'endarrayright', 'endeqnarray', 'posed', 'in', 'a', 'bounded', 'domain', 'omegasubsetmathbbr3', 'with', 'smooth', 'boundary', 'is', 'considered', 'under', 'the', 'noflux', 'boundary', 'condition', 'for', 'n', 'c', 'and', 'the', 'dirichlect', 'boundary', 'condition', 'for', 'u', 'under', 'the', 'assumption', 'that', 'the', 'frobenius', 'norm', 'of', 'the', 'tensorvalued', 'chemotactic', 'sensitivity', 'sxnc', 'satisfies', 'sxncnl2widetildesc', 'with', 'l2', 'for', 'some', 'nondecreasing', 'function', 'widetildesin', 'c20infty', 'in', 'present', 'work', 'it', 'is', 'shown', 'that', 'the', 'weak', 'solution', 'is', 'global', 'in', 'time', 'and', 'bounded', 'while', 'mmstarl', 'where', 'begineqnarray', 'mstarl', 'leftbeginarraylll', 'medskip', 'lfrac56', 'mathrmif', 'frac3112geq', 'l2', 'medskip', 'frac75lfrac2815', 'mathrmif', 'lfrac3112', 'endarrayright', 'endeqnarray']]
|
[-0.231605215343948, 0.08067181765777516, 0.01673457786234269, -0.031768937031373234, -0.03414007578919386, -0.26623674056164043, -0.08303808745147441, 0.31921801671120975, -0.31152515715517687, -0.03696749289063554, 0.18010207836735337, -0.4009279567638741, -0.04764981384106053, 0.10219502042723345, -0.07903641209408056, 0.14292716236292002, 0.028092202415470693, 0.06597615413906455, -0.023225119903537574, -0.16238734499989627, 0.3449521022072683, -0.2176812924079451, 0.13792787756149968, 0.14550961710982865, 0.11209226405823275, -0.03219471083652666, 0.17549177449123532, -0.09071326369017947, -0.3516487976150672, -0.11519765221586853, 0.23651865044353054, 0.044815850859580966, 0.32723868130614947, -0.36820404561163456, -0.11303606718851655, 0.20814180886829456, 0.13401523697208248, -0.1533511545595841, 0.022706889281478508, -0.3964189517074356, 0.16108979232034043, -0.029911769622498575, -0.18855664995955487, 0.008432116583172306, 0.11501649663071423, 0.07492969694545072, -0.4828034622740804, 0.2156558801538731, 0.13403967608396403, -0.003696287470851459, -0.17700600718814588, -0.2545628829016898, -0.06504214806116972, -0.006950853812490024, -0.0057458693239217, 0.2610892389225317, -0.05667277520485953, -0.05294436948401306, 0.1070723663650307, 0.3395331229897006, -0.08936744792884507, -0.2919019007982284, 0.00828906757227492, -0.19278879809722888, -0.15890265807655513, 0.020341179301670075, 0.04107008506452628, 0.16090858409035147, -0.1521275624833709, 0.32754385251638607, -0.09085424801028863, 0.12514916792575853, 0.16107508904464982, -0.037786325175022964, -0.09282706030924101, 0.11546365660158735, 0.19340066691203153, 0.03077069741637245, 0.003815980252493675, -0.013037498949059085, -0.39405131765513446, -0.10408742291003685, -0.1405338577688763, 0.1628051246151182, -0.07022664371356323, -0.13103603416518536, 0.205148142559326, 0.04716119185882146, 0.17730679737367466, 0.11499647436179586, 0.17333913857902528, 0.15252807220916592, -0.09365051496641565, 0.1563663381909696, 0.05000947536495468, 0.12080341580269091, 0.2270209104685551, -0.2812251272684365, 0.027149628624137417, 0.15964970819956814]
|
1,803.0522
|
All-Lossy Quasi-Guided Dual-Mode Optical Waveguide Exhibiting
Exceptional Singularities
|
We explore exceptional points (EP) in a dual-mode symmetric planar optical
waveguide with transverse variation of inhomogeneous loss profile; where modal
evolution alongside an EP is reported in the context of selective optical mode
conversion.
|
physics.optics
|
we explore exceptional points ep in a dualmode symmetric planar optical waveguide with transverse variation of inhomogeneous loss profile where modal evolution alongside an ep is reported in the context of selective optical mode conversion
|
[['we', 'explore', 'exceptional', 'points', 'ep', 'in', 'a', 'dualmode', 'symmetric', 'planar', 'optical', 'waveguide', 'with', 'transverse', 'variation', 'of', 'inhomogeneous', 'loss', 'profile', 'where', 'modal', 'evolution', 'alongside', 'an', 'ep', 'is', 'reported', 'in', 'the', 'context', 'of', 'selective', 'optical', 'mode', 'conversion']]
|
[-0.14874264651111194, 0.1199779737379036, -0.028921644176755634, -0.012135374236718885, -0.08293148283181447, -0.12112771255363311, 0.015923263199095216, 0.5072842980069774, -0.24409538049783025, -0.2055328176489898, 0.0412718232255429, -0.26365277765850936, -0.1323826179781463, 0.1362852339765855, 0.007561653240450791, 0.09262581661875759, 0.0222000737558119, -0.0318186825673495, -0.024794334502491567, -0.09766610616019794, 0.29038873767214163, 0.019335952514250365, 0.3898580826818943, -0.0012962679245642253, 0.11616164543000715, 0.11960459922307304, 0.004241807705589703, -0.027748983060675008, -0.10759030753480536, 0.09213494862030659, 0.237219849973917, 0.015638394028480565, 0.22187455520033836, -0.3854937593319586, -0.2261954156415803, 0.09614595121570996, 0.18428043129720859, 0.11950315098677362, -0.04836222119629383, -0.19959415761487825, -0.009976920618542603, -0.16746504572885376, -0.18441817409225872, 0.0280871158332697, 0.052247670439205, 0.03707234976547105, -0.27510009216410775, 0.03010706551639097, 0.07300026991537639, 0.1178062983921596, -0.054231043319617, -0.015591010344879967, -0.04392202688114984, -0.04137394216709903, -0.05799906140060297, -0.012423375767788717, 0.11213747116271407, -0.11925491962049689, -0.13605820100222316, 0.3675801331443446, -0.10780624925558056, -0.15030065647193364, 0.12176205583715013, -0.18265305808080093, 0.005392280886215823, 0.13587508329655976, 0.232518906279334, 0.06768946225222733, -0.10801462411348309, 0.07445327813870141, 0.0008984398362892014, 0.16857794761391623, 0.16143251114657947, 0.10008827117604337, 0.1887370861002377, 0.2099624231490972, 0.0004982470168865152, 0.19110806914312498, -0.10257261910342745, -0.06960818470854845, -0.2843042440712452, -0.11662976502307824, -0.12576457970093802, 0.04815974717161485, -0.0960735178685614, -0.19190872508500303, 0.4016632668673992, 0.03444727885403803, 0.23032835969435317, -0.08395538442502064, 0.2837871049796896, 0.19243088103830813, 0.0396770621782967, 0.02631989290405597, 0.35798612541652153, 0.157689340246517, 0.1352372169494629, -0.29533458736592105, -0.0334516409119325, -0.0008887027390301228]
|
1,803.05221
|
Direct numerical computation and its application to the higher-order
radiative corrections
|
The direct computation method(DCM) is developed to calculate the multi-loop
amplitude for general masses and external momenta. The ultraviolet divergence
is under control in dimensional regularization. In this paper we report on the
progress of DCM to several scalar multi-loop integrals after the presentation
in ACAT2016. Also the discussion is given on the application of DCM to physical
2-loop processes including numerator functions.
|
hep-ph
|
the direct computation methoddcm is developed to calculate the multiloop amplitude for general masses and external momenta the ultraviolet divergence is under control in dimensional regularization in this paper we report on the progress of dcm to several scalar multiloop integrals after the presentation in acat2016 also the discussion is given on the application of dcm to physical 2loop processes including numerator functions
|
[['the', 'direct', 'computation', 'methoddcm', 'is', 'developed', 'to', 'calculate', 'the', 'multiloop', 'amplitude', 'for', 'general', 'masses', 'and', 'external', 'momenta', 'the', 'ultraviolet', 'divergence', 'is', 'under', 'control', 'in', 'dimensional', 'regularization', 'in', 'this', 'paper', 'we', 'report', 'on', 'the', 'progress', 'of', 'dcm', 'to', 'several', 'scalar', 'multiloop', 'integrals', 'after', 'the', 'presentation', 'in', 'acat2016', 'also', 'the', 'discussion', 'is', 'given', 'on', 'the', 'application', 'of', 'dcm', 'to', 'physical', '2loop', 'processes', 'including', 'numerator', 'functions']]
|
[-0.13921989390596015, 0.11299702512924789, -0.07268336911487286, 0.061222094405045516, -0.09461779428310081, -0.04865631097775014, 0.03814855230338566, 0.38371646814964344, -0.1977375352175021, -0.26070662190923927, 0.10763867208772324, -0.2258727924638718, -0.17170580975772415, 0.22787249011949437, -0.057584101707792885, 0.086390073838659, 0.05136360343331929, 0.04175155589234878, -0.10348425886486887, -0.2832387892212566, 0.361799284350127, 0.04602911683623908, 0.22170645036719372, 0.10587857880717387, 0.11124792001515504, 0.07318141440418167, -0.10450020860727938, -0.061078736342901944, -0.12089643877793531, 0.11889442862593569, 0.23093756431805307, 0.05238053672107273, 0.2304832899034573, -0.38096714618264654, -0.1670436997607839, 0.04191155808015925, 0.13803269585869352, 0.11058808699036475, -0.011093594061332892, -0.2020638214699069, 0.03685735982888546, -0.178461838284599, -0.16370847350994094, -0.13487816294349853, 0.02512785347300719, -0.06413769157084286, -0.28210508063259976, 0.05455380074677943, -0.03796580926606768, 0.07864812566120116, -0.03312632788858209, -0.11243563175743415, 0.0382384936913054, 0.08322307058289403, 0.09749852509054614, 0.03338162923903495, 0.12882816111363593, -0.18635029698205352, -0.16173896929974377, 0.3553283849547877, -0.034528183447365024, -0.21308637151235074, 0.15881070659541693, -0.16523269664679394, -0.15898372489409368, 0.11285491896121473, 0.18895133253431223, 0.1262892301988284, -0.1889589797919158, 0.1518273549755562, 0.04720863247992563, 0.10742999109454819, 0.0880172656177253, 0.0017579046705905653, 0.14413977597198893, 0.13395536301627023, 0.018378793361184538, 0.16339340061712704, -0.040719516025703464, -0.13536053106616266, -0.4112560624470476, -0.15695834874373968, -0.09917033251497101, 0.04882149683830679, -0.08294601000766232, -0.18809842388527315, 0.42608364495891526, 0.16177155362484122, 0.16620519653451246, 0.052415345932860846, 0.34167664226327765, 0.1779898566911455, 0.1029707824383847, 0.03848002945286695, 0.23745953029052155, 0.1585421780215912, 0.1106114983253303, -0.2564050491639703, -0.032187642957099145, 0.1452683300146314]
|
1,803.05222
|
ALMA observations of the nearby AGB star L$_{\rm 2}$ Puppis. II. Gas
disk properties derived from $^{\rm 12}$CO and $^{\rm13}$CO $J=$3$-$2
emission
|
The circumstellar environment of the AGB star L$_{\rm 2}$ Puppis was observed
with ALMA in cycle 3, with a resolution of $15 \times 18 \rm\ mas$. The
molecular emission shows a differentially rotating disk, inclined to a nearly
edge-on position. In the first paper in this series (paper I) the molecular
emission was analysed to accurately deduce the motion of the gas in the
equatorial regions of the disk. In this work we model the optically thick
$^{\rm 12}$CO $J=$3$-$2 and the optically thin $^{\rm 13}$CO $J=$3$-$2
rotational transition to constrain the physical conditions in the disk. To
realise this effort we make use of the 3D NLTE radiative transfer code {\tt
LIME}. The temperature structure and velocity structure show a high degree of
complexity, both radially and vertically. The radial H$_{\rm 2}$ density
profile in the disk plane is characterised by a power law with a slope of
$-3.1$. We find a $^{\rm 12}$CO over $^{\rm 13}$CO abundance ratio of 10 inside
the disk. Finally, estimations of the angular momentum in the disk surpass the
expected available angular momentum of the star, strongly supporting the
indirect detection of a compact binary companion reported in paper I. We
estimate the mass of the companion to be around 1 Jupiter mass.
|
astro-ph.SR
|
the circumstellar environment of the agb star l_rm 2 puppis was observed with alma in cycle 3 with a resolution of 15 times 18 rm mas the molecular emission shows a differentially rotating disk inclined to a nearly edgeon position in the first paper in this series paper i the molecular emission was analysed to accurately deduce the motion of the gas in the equatorial regions of the disk in this work we model the optically thick rm 12co j32 and the optically thin rm 13co j32 rotational transition to constrain the physical conditions in the disk to realise this effort we make use of the 3d nlte radiative transfer code tt lime the temperature structure and velocity structure show a high degree of complexity both radially and vertically the radial h_rm 2 density profile in the disk plane is characterised by a power law with a slope of 31 we find a rm 12co over rm 13co abundance ratio of 10 inside the disk finally estimations of the angular momentum in the disk surpass the expected available angular momentum of the star strongly supporting the indirect detection of a compact binary companion reported in paper i we estimate the mass of the companion to be around 1 jupiter mass
|
[['the', 'circumstellar', 'environment', 'of', 'the', 'agb', 'star', 'l_rm', '2', 'puppis', 'was', 'observed', 'with', 'alma', 'in', 'cycle', '3', 'with', 'a', 'resolution', 'of', '15', 'times', '18', 'rm', 'mas', 'the', 'molecular', 'emission', 'shows', 'a', 'differentially', 'rotating', 'disk', 'inclined', 'to', 'a', 'nearly', 'edgeon', 'position', 'in', 'the', 'first', 'paper', 'in', 'this', 'series', 'paper', 'i', 'the', 'molecular', 'emission', 'was', 'analysed', 'to', 'accurately', 'deduce', 'the', 'motion', 'of', 'the', 'gas', 'in', 'the', 'equatorial', 'regions', 'of', 'the', 'disk', 'in', 'this', 'work', 'we', 'model', 'the', 'optically', 'thick', 'rm', '12co', 'j32', 'and', 'the', 'optically', 'thin', 'rm', '13co', 'j32', 'rotational', 'transition', 'to', 'constrain', 'the', 'physical', 'conditions', 'in', 'the', 'disk', 'to', 'realise', 'this', 'effort', 'we', 'make', 'use', 'of', 'the', '3d', 'nlte', 'radiative', 'transfer', 'code', 'tt', 'lime', 'the', 'temperature', 'structure', 'and', 'velocity', 'structure', 'show', 'a', 'high', 'degree', 'of', 'complexity', 'both', 'radially', 'and', 'vertically', 'the', 'radial', 'h_rm', '2', 'density', 'profile', 'in', 'the', 'disk', 'plane', 'is', 'characterised', 'by', 'a', 'power', 'law', 'with', 'a', 'slope', 'of', '31', 'we', 'find', 'a', 'rm', '12co', 'over', 'rm', '13co', 'abundance', 'ratio', 'of', '10', 'inside', 'the', 'disk', 'finally', 'estimations', 'of', 'the', 'angular', 'momentum', 'in', 'the', 'disk', 'surpass', 'the', 'expected', 'available', 'angular', 'momentum', 'of', 'the', 'star', 'strongly', 'supporting', 'the', 'indirect', 'detection', 'of', 'a', 'compact', 'binary', 'companion', 'reported', 'in', 'paper', 'i', 'we', 'estimate', 'the', 'mass', 'of', 'the', 'companion', 'to', 'be', 'around', '1', 'jupiter', 'mass']]
|
[-0.09466778266692667, 0.0639125344953278, -0.007641037997035753, 0.035616455172255104, -0.041739405990145834, -0.03728216281160712, -0.003385135968814471, 0.4213811387086198, -0.2118718255843435, -0.31435245243455506, 0.06753485084752486, -0.23691929514032034, -0.009113561993165474, 0.1363184278908496, -0.01258179111783171, -0.0007220387153903998, 0.0233869013121529, -0.08308700818258027, -0.08081336437393301, -0.17836023086371522, 0.29437670028391516, 0.08275334721187218, 0.12949453095595043, 0.004515485830294589, 0.03828009648159856, -0.13582898124365048, -0.04428640818445101, -0.05071384340435976, -0.20385237572315548, 0.08732680472672828, 0.2087499852464091, 0.10117126499701823, 0.16311200985330201, -0.3547148822939822, -0.17293378127561437, 0.03187224135534572, 0.1793836530009728, 0.058055646444803904, -0.007311499480385377, -0.2440637202672882, 0.06887136002173758, -0.22433855705846023, -0.19884685556670384, 0.06359713169208372, 0.07566554924733715, -0.013941055008520683, -0.2544560546074839, 0.11414779595409831, 0.0720536763402855, 0.12270559222393093, -0.10823111036969792, -0.10316244370991452, -0.10424754530457514, 0.04526277330005542, -0.005999352265748062, 0.11338276922303651, 0.18562201460646022, -0.12496136665189018, -0.016733965696766974, 0.384893055163723, -0.1353586396726314, -0.09777517291783755, 0.19802454201050013, -0.2613665021756398, -0.15252479124104693, 0.1814815209834792, 0.15652624832554943, 0.1406254590673641, -0.10200419049942866, 0.0415000597527805, -0.07043355514373009, 0.2537379000136363, 0.064164069376836, 0.005356268249895601, 0.3168817331792698, 0.1020371788336585, 0.028508789753097865, 0.130819975437286, -0.2662752743721718, -0.057730691291813165, -0.2177961627997103, -0.17463742536714388, -0.14141983321557441, 0.11868902610260107, -0.11433114463974821, -0.08348148377124398, 0.33120057417434595, 0.10184819110491801, 0.27538569482996883, 0.028155864539024023, 0.35158448551249294, 0.07601637117719899, 0.0581159558307956, 0.167884746322497, 0.30186226037996156, 0.17820504906786871, 0.14189649966075585, -0.2718024908343241, 0.027719709978971097, -0.004311684029553795]
|
1,803.05223
|
MCScript: A Novel Dataset for Assessing Machine Comprehension Using
Script Knowledge
|
We introduce a large dataset of narrative texts and questions about these
texts, intended to be used in a machine comprehension task that requires
reasoning using commonsense knowledge. Our dataset complements similar datasets
in that we focus on stories about everyday activities, such as going to the
movies or working in the garden, and that the questions require commonsense
knowledge, or more specifically, script knowledge, to be answered. We show that
our mode of data collection via crowdsourcing results in a substantial amount
of such inference questions. The dataset forms the basis of a shared task on
commonsense and script knowledge organized at SemEval 2018 and provides
challenging test cases for the broader natural language understanding
community.
|
cs.CL
|
we introduce a large dataset of narrative texts and questions about these texts intended to be used in a machine comprehension task that requires reasoning using commonsense knowledge our dataset complements similar datasets in that we focus on stories about everyday activities such as going to the movies or working in the garden and that the questions require commonsense knowledge or more specifically script knowledge to be answered we show that our mode of data collection via crowdsourcing results in a substantial amount of such inference questions the dataset forms the basis of a shared task on commonsense and script knowledge organized at semeval 2018 and provides challenging test cases for the broader natural language understanding community
|
[['we', 'introduce', 'a', 'large', 'dataset', 'of', 'narrative', 'texts', 'and', 'questions', 'about', 'these', 'texts', 'intended', 'to', 'be', 'used', 'in', 'a', 'machine', 'comprehension', 'task', 'that', 'requires', 'reasoning', 'using', 'commonsense', 'knowledge', 'our', 'dataset', 'complements', 'similar', 'datasets', 'in', 'that', 'we', 'focus', 'on', 'stories', 'about', 'everyday', 'activities', 'such', 'as', 'going', 'to', 'the', 'movies', 'or', 'working', 'in', 'the', 'garden', 'and', 'that', 'the', 'questions', 'require', 'commonsense', 'knowledge', 'or', 'more', 'specifically', 'script', 'knowledge', 'to', 'be', 'answered', 'we', 'show', 'that', 'our', 'mode', 'of', 'data', 'collection', 'via', 'crowdsourcing', 'results', 'in', 'a', 'substantial', 'amount', 'of', 'such', 'inference', 'questions', 'the', 'dataset', 'forms', 'the', 'basis', 'of', 'a', 'shared', 'task', 'on', 'commonsense', 'and', 'script', 'knowledge', 'organized', 'at', 'semeval', '2018', 'and', 'provides', 'challenging', 'test', 'cases', 'for', 'the', 'broader', 'natural', 'language', 'understanding', 'community']]
|
[-0.032153387385834425, 0.002441875549017364, -0.05739127601293895, 0.11922322385984226, -0.2070069103820138, -0.10147119156666036, 0.08604907216583817, 0.40208663813706136, -0.22966881275861564, -0.41264310584236413, 0.07907234763519631, -0.29013480317110246, -0.13427993540978458, 0.22971419582907587, -0.14817413166324553, 0.011218393778699076, 0.18661061308195448, 0.08664134372041649, 0.012456092101911832, -0.29687633102512956, 0.33086217500858456, 0.03282746294529265, 0.32263721337016577, 0.07343910566857483, 0.0910742674391064, -0.028897394131646197, -0.08353000894610763, -0.05280866667430345, -0.06511433597014317, 0.18365400698549378, 0.41595412391779196, 0.30897406766461766, 0.339803464551512, -0.44344965969291955, -0.15915497018493965, 0.02310301088847411, 0.12121161576519665, 0.10630875703210556, -0.008121430926232869, -0.3717963251953897, 0.04979009229120695, -0.1447327151042847, 0.00652857065702287, -0.13877860682533405, 0.02097566586194767, -0.07671378916686672, -0.22711680586644822, 0.010496494129427478, 0.15969488065438314, 0.17385291301000577, -0.0038270306958554266, -0.10914493774055925, 0.06467046538113147, 0.2008515472571628, 0.054747349709972866, 0.036862996940174676, 0.14235781030888614, -0.20299772821112066, -0.18577553439411756, 0.42325923836224866, -0.04714311670480121, -0.1912627111738309, 0.2094805443293264, -0.08767235273511237, -0.19006372447738534, 0.03643909607751247, 0.24080516322332823, 0.12216001617698333, -0.16414020733477977, -0.00500324387779921, -0.11152087342248768, 0.25632963199009245, 0.08335665648436955, -0.029443630256140843, 0.2235755208027987, 0.2593961176900273, -0.057667019300393633, 0.08511121003514427, -0.00926466611896554, -0.0660252228904611, -0.22158366010293493, -0.15541286178283456, -0.17454640988064493, 0.032402055137034536, -0.04562569216528557, -0.11581363083728048, 0.37916295701621944, 0.2608094451129118, 0.15091015266465485, 0.044061759893999346, 0.26717180121912915, -0.08064419188652124, 0.10581251173319979, 0.09133657856752825, 0.09171311700573334, -0.028910622621575992, 0.1813541913532421, -0.0985667915103368, 0.07532991997053863, -0.018025202953264628]
|
1,803.05224
|
Excitonic Order and Superconductivity in the Two-Orbital Hubbard Model:
Variational Cluster Approach
|
Using the variational cluster approach based on the self-energy functional
theory, we study the possible occurrence of excitonic order and
superconductivity in the two-orbital Hubbard model with intra- and
inter-orbital Coulomb interactions. It is known that an antiferromagnetic Mott
insulator state appears in the regime of strong intra-orbital interaction, a
band insulator state appears in the regime of strong inter-orbital interaction,
and an excitonic insulator state appears between them. In addition to these
states, we find that the $s^{\pm}$-wave superconducting state appears in the
small-correlation regime, and the $d_{x^2 - y^2}$-wave superconducting state
appears on the boundary of the antiferromagnetic Mott insulator state. We
calculate the single-particle spectral function of the model and compare the
band gap formation due to the superconducting and excitonic orders.
|
cond-mat.str-el cond-mat.supr-con
|
using the variational cluster approach based on the selfenergy functional theory we study the possible occurrence of excitonic order and superconductivity in the twoorbital hubbard model with intra and interorbital coulomb interactions it is known that an antiferromagnetic mott insulator state appears in the regime of strong intraorbital interaction a band insulator state appears in the regime of strong interorbital interaction and an excitonic insulator state appears between them in addition to these states we find that the spmwave superconducting state appears in the smallcorrelation regime and the d_x2 y2wave superconducting state appears on the boundary of the antiferromagnetic mott insulator state we calculate the singleparticle spectral function of the model and compare the band gap formation due to the superconducting and excitonic orders
|
[['using', 'the', 'variational', 'cluster', 'approach', 'based', 'on', 'the', 'selfenergy', 'functional', 'theory', 'we', 'study', 'the', 'possible', 'occurrence', 'of', 'excitonic', 'order', 'and', 'superconductivity', 'in', 'the', 'twoorbital', 'hubbard', 'model', 'with', 'intra', 'and', 'interorbital', 'coulomb', 'interactions', 'it', 'is', 'known', 'that', 'an', 'antiferromagnetic', 'mott', 'insulator', 'state', 'appears', 'in', 'the', 'regime', 'of', 'strong', 'intraorbital', 'interaction', 'a', 'band', 'insulator', 'state', 'appears', 'in', 'the', 'regime', 'of', 'strong', 'interorbital', 'interaction', 'and', 'an', 'excitonic', 'insulator', 'state', 'appears', 'between', 'them', 'in', 'addition', 'to', 'these', 'states', 'we', 'find', 'that', 'the', 'spmwave', 'superconducting', 'state', 'appears', 'in', 'the', 'smallcorrelation', 'regime', 'and', 'the', 'd_x2', 'y2wave', 'superconducting', 'state', 'appears', 'on', 'the', 'boundary', 'of', 'the', 'antiferromagnetic', 'mott', 'insulator', 'state', 'we', 'calculate', 'the', 'singleparticle', 'spectral', 'function', 'of', 'the', 'model', 'and', 'compare', 'the', 'band', 'gap', 'formation', 'due', 'to', 'the', 'superconducting', 'and', 'excitonic', 'orders']]
|
[-0.20401278141189397, 0.1833565872405349, -0.03902961762586033, 0.11116854523637945, -0.022098717423595066, -0.14935988073078235, 0.12501671514568502, 0.3811340544191075, -0.25132837871513597, -0.2523960479747171, -0.05197874192863975, -0.34714508488229134, -0.13722533186731056, 0.06594391830447244, 0.0939978279430813, -0.019732276008017663, -0.047294676584017474, -0.03911009170417863, -0.13459451976696, -0.2009457823464541, 0.37072096638972074, -0.04186890292458418, 0.2991000776731871, 0.14287940526335705, -0.01182351118650257, 0.013714540049403421, 0.19779750629048037, -0.03584211701158116, -0.1575563305283081, 0.02377353716268757, 0.27647766486715103, -0.16515398449529478, 0.2304921423698344, -0.43085316127938467, -0.1900247511779511, -0.003087859312110255, 0.14086347456446024, 0.17154911881297585, -0.005072245058202283, -0.3694489389493289, -0.0392784623323175, -0.2610384213579137, -0.09865510122702889, -0.11578193334382259, -0.03653186433607849, -0.06903596370995832, -0.2530331227935972, 0.1384164438302803, 0.05229345633746768, -0.000600122324213749, -0.13047620439069058, -0.10248713647734707, -0.1004385761566445, 0.047888778362090025, 0.036073267917958944, 0.09768839415760969, 0.07128129176780339, -0.1823907069278866, -0.09605287579153247, 0.34943122366761287, -0.055261983094184196, -0.018930833377852674, 0.21689493190383585, -0.15893681258023754, -0.014508755173443294, 0.13639863443417036, 0.03615300354313075, 0.04064599629226557, -0.09060516514308084, 0.12766024220178313, -0.004312837773714427, 0.22554962446049945, -0.06898992387644144, 0.13718709483651853, 0.21709944768638417, 0.2103684858695369, 0.0757967369456783, 0.17820640416376718, -0.16581593490536023, -0.12051477068249605, -0.2492492219084889, -0.14174886904202583, -0.2743070725109277, 0.017014268303017426, -0.04749595606250014, -0.22167190143883955, 0.4195506495522521, 0.18144208608134613, 0.14478597869695262, -0.08584264583310218, 0.18972757104329946, 0.18129385694316247, 0.026713170372403977, 0.02966183252496327, 0.2808914179421537, 0.19968445395778228, 0.07196978116180838, -0.35517027827805076, 0.06427780865517453, 0.07784361111159187]
|
1,803.05225
|
Site-selective measurement of coupled spin pairs in an organic
semiconductor
|
From organic electronics to biological systems, understanding the role of
intermolecular interactions between spin pairs is a key challenge. Here we show
how such pairs can be selectively addressed with combined spin and optical
sensitivity. We demonstrate this for bound pairs of spin-triplet excitations
formed by singlet fission, with direct applicability across a wide range of
synthetic and biological systems. We show that the site-sensitivity of exchange
coupling allows distinct triplet pairs to be resonantly addressed at different
magnetic fields, tuning them between optically bright singlet (S=0) and dark
triplet, quintet (S=1,2) configurations: this induces narrow holes in a broad
optical emission spectrum, uncovering exchange-specific luminescence. Using
fields up to 60 T, we identify three distinct triplet-pair sites, with exchange
couplings varying over an order of magnitude (0.3-5 meV), each with its own
luminescence spectrum, coexisting in a single material. Our results reveal how
site-selectivity can be achieved for organic spin pairs in a broad range of
systems.
|
physics.chem-ph cond-mat.mtrl-sci
|
from organic electronics to biological systems understanding the role of intermolecular interactions between spin pairs is a key challenge here we show how such pairs can be selectively addressed with combined spin and optical sensitivity we demonstrate this for bound pairs of spintriplet excitations formed by singlet fission with direct applicability across a wide range of synthetic and biological systems we show that the sitesensitivity of exchange coupling allows distinct triplet pairs to be resonantly addressed at different magnetic fields tuning them between optically bright singlet s0 and dark triplet quintet s12 configurations this induces narrow holes in a broad optical emission spectrum uncovering exchangespecific luminescence using fields up to 60 t we identify three distinct tripletpair sites with exchange couplings varying over an order of magnitude 035 mev each with its own luminescence spectrum coexisting in a single material our results reveal how siteselectivity can be achieved for organic spin pairs in a broad range of systems
|
[['from', 'organic', 'electronics', 'to', 'biological', 'systems', 'understanding', 'the', 'role', 'of', 'intermolecular', 'interactions', 'between', 'spin', 'pairs', 'is', 'a', 'key', 'challenge', 'here', 'we', 'show', 'how', 'such', 'pairs', 'can', 'be', 'selectively', 'addressed', 'with', 'combined', 'spin', 'and', 'optical', 'sensitivity', 'we', 'demonstrate', 'this', 'for', 'bound', 'pairs', 'of', 'spintriplet', 'excitations', 'formed', 'by', 'singlet', 'fission', 'with', 'direct', 'applicability', 'across', 'a', 'wide', 'range', 'of', 'synthetic', 'and', 'biological', 'systems', 'we', 'show', 'that', 'the', 'sitesensitivity', 'of', 'exchange', 'coupling', 'allows', 'distinct', 'triplet', 'pairs', 'to', 'be', 'resonantly', 'addressed', 'at', 'different', 'magnetic', 'fields', 'tuning', 'them', 'between', 'optically', 'bright', 'singlet', 's0', 'and', 'dark', 'triplet', 'quintet', 's12', 'configurations', 'this', 'induces', 'narrow', 'holes', 'in', 'a', 'broad', 'optical', 'emission', 'spectrum', 'uncovering', 'exchangespecific', 'luminescence', 'using', 'fields', 'up', 'to', '60', 't', 'we', 'identify', 'three', 'distinct', 'tripletpair', 'sites', 'with', 'exchange', 'couplings', 'varying', 'over', 'an', 'order', 'of', 'magnitude', '035', 'mev', 'each', 'with', 'its', 'own', 'luminescence', 'spectrum', 'coexisting', 'in', 'a', 'single', 'material', 'our', 'results', 'reveal', 'how', 'siteselectivity', 'can', 'be', 'achieved', 'for', 'organic', 'spin', 'pairs', 'in', 'a', 'broad', 'range', 'of', 'systems']]
|
[-0.15083823432965623, 0.20056633165851612, 0.007613594977620749, 0.04996333221018675, -0.022968779254381757, -0.1534273632711941, 0.03099212944507599, 0.45048572858495095, -0.26438685298086173, -0.35092874420506337, -0.04494863301590686, -0.29265748758569377, -0.07038861487301126, 0.1957697092315122, 0.07911778012470853, -0.05738155823989561, 0.017162274395025545, -0.05468926872126758, -0.03828430731420315, -0.20482600728259234, 0.28799065981480865, -0.03597680177058905, 0.27806649854436755, 0.1101562675088644, 0.06720124679437328, 0.024957662467063674, 0.0860414782809394, -0.0643851840988763, -0.10894833863135465, 0.12232136729148953, 0.28672232949775794, 0.0031213394711695373, 0.21925229362152035, -0.3815492486521121, -0.21922501329813274, 0.13010788118887331, 0.18600871719630255, 0.12771033022492642, -0.08102862080258708, -0.30837103929971493, 0.06032766213700656, -0.17808319920854224, -0.10396084923319698, -0.10247007464208911, -0.018000536598171288, 0.028292459685115085, -0.2618863296064158, 0.07533696188681549, 0.008732458291905783, 0.06808058535755282, -0.0787795202186962, -0.10404634031677439, -0.06905723240737233, 0.0973902982299126, 0.02170794141599007, -0.0015485966735849937, 0.1714877728019811, -0.12968082784621313, -0.14356381208485652, 0.3348571095825924, -0.09513011963872779, -0.09753847733861015, 0.22488922888352986, -0.1497794916733138, -0.08540079552499998, 0.17395402174443006, 0.1381178678212417, 0.12753904329672935, -0.14773814646346914, 0.02373679196349375, -0.007461209979749495, 0.21891043508545527, 0.033502549990530935, 0.130170907954415, 0.3254607447738489, 0.1836522170432633, 0.009459389656061126, 0.1378747608354916, -0.11724780552753908, -0.08614480921157426, -0.21767957294359802, -0.14076430606543117, -0.15495771481505324, 0.07880911430524241, -0.044610355381624806, -0.08394143271350092, 0.4320863387877903, 0.15135911109767133, 0.2247581184871735, -0.06703101324176626, 0.2450057650207694, 0.05004476456137303, 0.10859203873983314, -0.009088595926521286, 0.24571793979416873, 0.15371773838546246, 0.06005435280967504, -0.2514740197724032, -0.0038044188141582473, -0.06584311069079464]
|
1,803.05226
|
Uniform preconditioners for problems of negative order
|
Uniform preconditioners for operators of negative order discretized by
(dis)continuous piecewise polynomials of any order are constructed from a
boundedly invertible operator of opposite order discretized by continuous
piecewise linears. Besides the cost of the application of the latter
discretized operator, the other cost of the preconditioner scales linearly with
the number of mesh cells. Compared to earlier proposals, the preconditioner has
the following advantages: It does not require the inverse of a non-diagonal
matrix; it applies without any mildly grading assumption on the mesh; and it
does not require a barycentric refinement of the mesh underlying the trial
space.
|
math.NA
|
uniform preconditioners for operators of negative order discretized by discontinuous piecewise polynomials of any order are constructed from a boundedly invertible operator of opposite order discretized by continuous piecewise linears besides the cost of the application of the latter discretized operator the other cost of the preconditioner scales linearly with the number of mesh cells compared to earlier proposals the preconditioner has the following advantages it does not require the inverse of a nondiagonal matrix it applies without any mildly grading assumption on the mesh and it does not require a barycentric refinement of the mesh underlying the trial space
|
[['uniform', 'preconditioners', 'for', 'operators', 'of', 'negative', 'order', 'discretized', 'by', 'discontinuous', 'piecewise', 'polynomials', 'of', 'any', 'order', 'are', 'constructed', 'from', 'a', 'boundedly', 'invertible', 'operator', 'of', 'opposite', 'order', 'discretized', 'by', 'continuous', 'piecewise', 'linears', 'besides', 'the', 'cost', 'of', 'the', 'application', 'of', 'the', 'latter', 'discretized', 'operator', 'the', 'other', 'cost', 'of', 'the', 'preconditioner', 'scales', 'linearly', 'with', 'the', 'number', 'of', 'mesh', 'cells', 'compared', 'to', 'earlier', 'proposals', 'the', 'preconditioner', 'has', 'the', 'following', 'advantages', 'it', 'does', 'not', 'require', 'the', 'inverse', 'of', 'a', 'nondiagonal', 'matrix', 'it', 'applies', 'without', 'any', 'mildly', 'grading', 'assumption', 'on', 'the', 'mesh', 'and', 'it', 'does', 'not', 'require', 'a', 'barycentric', 'refinement', 'of', 'the', 'mesh', 'underlying', 'the', 'trial', 'space']]
|
[-0.10223435567691923, 0.10453157363459468, -0.05787833978887647, -0.0037130455719307067, -0.10842254095477984, -0.1600266655255109, 0.011562552601099015, 0.3889833787549287, -0.31508053531870245, -0.23451247070683168, 0.14393668277654798, -0.23039064694661648, -0.1066968347877264, 0.13565210306085645, -0.08818510308861732, 0.1057078230008483, 0.07883007883094251, 0.04213304937351495, -0.1323299398238305, -0.2615233003371395, 0.3662904452648945, 0.04180524664930999, 0.2350459707528353, -0.005561282695271075, 0.13997419370803982, -0.024239099505357443, -0.09411029381677509, 0.02474171865003882, -0.018213940068671945, 0.08750494120293296, 0.21471171785145998, 0.05993000023066997, 0.31569393798708917, -0.4501829183101654, -0.20797981827054174, 0.14329321502707898, 0.1389310569409281, 0.06607441975735127, -0.017719996474916115, -0.2345537670329213, 0.06111398228444159, -0.15073186307679862, -0.1595451339520514, -0.07645649733720347, -0.056304766926914454, 0.05814153897576034, -0.3287171335425228, 0.03281385168898851, 0.1102265587542206, 0.029155631025787443, -0.053359151175245645, -0.1418695227615535, -0.061686417013406755, 0.08087338712066412, -0.002509761266410351, 0.038872824357822536, 0.07602244436275214, -0.05727383602876216, -0.07859279718715698, 0.40525640549138187, -0.025733211672632025, -0.3406703684106469, 0.1556436522677541, -0.14244592026807368, -0.08086456397548318, 0.16272917322814465, 0.11211596791399643, 0.16247718893922866, -0.042609396390616894, 0.17158971835800912, -0.03452308198437095, 0.1855654227361083, 0.0610413335217163, -0.02630174604826607, 0.0481824483606033, 0.08669410392642021, 0.177938560731709, 0.06964369275665376, 0.00963894355809316, -0.10125746101140976, -0.344298674184829, -0.1422874228004366, -0.2350172252440825, 0.02577919906034367, -0.18659301425315789, -0.2567813591007143, 0.3806311941007152, 0.12306166750378907, 0.14536458514863626, 0.07566996046807617, 0.29930193511769176, 0.14924699845025316, 0.13717364145442842, 0.07418699519708753, 0.13849081801250576, 0.13325153595302253, 0.12829895151313395, -0.24044907448173036, 0.09766083498019724, 0.2016889411304146]
|
1,803.05227
|
Lecture notes on the co-representation theory of the compact quantum
group $SU_{q}(2).$
|
This is an exposition of S.L Woronowicz co-representation theory of the
compact quantum group $SU_{q}(2)$ written for a seminar series.
|
math.QA math-ph math.FA math.MP
|
this is an exposition of sl woronowicz corepresentation theory of the compact quantum group su_q2 written for a seminar series
|
[['this', 'is', 'an', 'exposition', 'of', 'sl', 'woronowicz', 'corepresentation', 'theory', 'of', 'the', 'compact', 'quantum', 'group', 'su_q2', 'written', 'for', 'a', 'seminar', 'series']]
|
[-0.20617261377628893, 0.07790499362236006, -0.2246338665485382, 0.044360329024493696, -0.1404475617222488, -0.07410366598051041, -0.058046483475482094, 0.2816623986698687, -0.30008254759013653, -0.18547014938667417, 0.12448092284612358, -0.2602404085919261, -0.1798853874206543, 0.24316369509324431, -0.16471818364225327, -0.05575043563731015, 0.00828179947566241, 0.12635288266465067, -0.14598071719519795, -0.28386301128193736, 0.31279364658985287, 0.04182856857951265, 0.22590106055140496, -0.0452762097120285, 0.12411134950816631, 0.06751033037435264, -0.07975599747151137, -0.07620577700436115, -0.08194743194617331, 0.1545087939593941, 0.37448265405837444, 0.05000098152086139, 0.24079347718507052, -0.4138352773152292, -0.13183993748389183, -0.05366094135679304, 0.030871560610830785, 0.03902124622836709, -0.05792705621570349, -0.4225682273507118, -0.008851737761870027, -0.2691418584436178, -0.11530081434175372, -0.06259482894092798, 0.10032928353175521, -0.1510752852074802, -0.156228831037879, 0.0018551794812083245, 0.08692271783947944, 0.2173487164080143, 0.01686299270750169, -0.0710522991605103, 0.07756276476502535, 0.11331267699133604, -0.07424882674822583, 0.06557700994890184, 0.09549898132681847, -0.042965004954021425, -0.17163177651818842, 0.4017077088356018, -0.062148274993523954, -0.1359780349826906, 0.06508660246618092, -0.14239633954130113, -0.27038281727582214, 0.04723966438323259, 0.07343904848676175, 0.1768668282777071, -0.0996012753341347, 0.2695175354834646, -0.13457119828090072, 0.14670020951889456, 0.013145309500396251, -0.0022426027804613113, 0.1490878002718091, 0.10768166440539062, 0.006338707916438579, 0.07864170998800546, 0.15518951332196593, -0.04368478246033192, -0.4274764947593212, -0.2932756323367357, -0.1883672763593495, 0.20366223040036857, 0.01823007664643228, -0.2582963158376515, 0.36397957867011427, -0.034959190525114536, 0.028221035143360496, 0.04687519217841327, 0.11843773033469915, 0.15829977457178757, -0.03741196774062701, 0.037033982342109084, 0.020520338974893092, 0.32387569919228554, 0.025146660604514183, -0.13753265200648457, -0.15640734896296635, 0.24085670076310634]
|
1,803.05228
|
Ultra High Molecular Weight Polyethylene: optical features at millimeter
wavelengths
|
The next generation of experiments for the measurement of the Cosmic
Microwave Background (CMB) requires more and more the use of advanced
materials, with specific physical and structural properties. An example is the
material used for receiver's cryostat windows and internal lenses. The large
throughput of current CMB experiments requires a large diameter (of the order
of 0.5m) of these parts, resulting in heavy structural and optical requirements
on the material to be used. Ultra High Molecular Weight (UHMW) polyethylene
(PE) features high resistance to traction and good transmissivity in the
frequency range of interest. In this paper, we discuss the possibility of using
UHMW PE for windows and lenses in experiments working at millimeter
wavelengths, by measuring its optical properties: emissivity, transmission and
refraction index. Our measurements show that the material is well suited to
this purpose.
|
astro-ph.IM astro-ph.CO physics.ins-det
|
the next generation of experiments for the measurement of the cosmic microwave background cmb requires more and more the use of advanced materials with specific physical and structural properties an example is the material used for receivers cryostat windows and internal lenses the large throughput of current cmb experiments requires a large diameter of the order of 05m of these parts resulting in heavy structural and optical requirements on the material to be used ultra high molecular weight uhmw polyethylene pe features high resistance to traction and good transmissivity in the frequency range of interest in this paper we discuss the possibility of using uhmw pe for windows and lenses in experiments working at millimeter wavelengths by measuring its optical properties emissivity transmission and refraction index our measurements show that the material is well suited to this purpose
|
[['the', 'next', 'generation', 'of', 'experiments', 'for', 'the', 'measurement', 'of', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'requires', 'more', 'and', 'more', 'the', 'use', 'of', 'advanced', 'materials', 'with', 'specific', 'physical', 'and', 'structural', 'properties', 'an', 'example', 'is', 'the', 'material', 'used', 'for', 'receivers', 'cryostat', 'windows', 'and', 'internal', 'lenses', 'the', 'large', 'throughput', 'of', 'current', 'cmb', 'experiments', 'requires', 'a', 'large', 'diameter', 'of', 'the', 'order', 'of', '05m', 'of', 'these', 'parts', 'resulting', 'in', 'heavy', 'structural', 'and', 'optical', 'requirements', 'on', 'the', 'material', 'to', 'be', 'used', 'ultra', 'high', 'molecular', 'weight', 'uhmw', 'polyethylene', 'pe', 'features', 'high', 'resistance', 'to', 'traction', 'and', 'good', 'transmissivity', 'in', 'the', 'frequency', 'range', 'of', 'interest', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'possibility', 'of', 'using', 'uhmw', 'pe', 'for', 'windows', 'and', 'lenses', 'in', 'experiments', 'working', 'at', 'millimeter', 'wavelengths', 'by', 'measuring', 'its', 'optical', 'properties', 'emissivity', 'transmission', 'and', 'refraction', 'index', 'our', 'measurements', 'show', 'that', 'the', 'material', 'is', 'well', 'suited', 'to', 'this', 'purpose']]
|
[-0.10278785279682041, 0.12751640339368916, -0.03477736862470814, -0.007802022965220006, -0.06846099140365487, -0.09467871191546968, 0.021959224136283054, 0.41412024702066963, -0.23564674906378638, -0.3362302472072559, 0.10157400450291301, -0.2994436847326089, -0.09437536996573317, 0.24932673161147514, -0.0038705957931992802, 0.1048287876735718, 0.018058852562545868, -0.05171469963776568, -0.02795592837028907, -0.2064462242482662, 0.2671365217420448, 0.16011407437221403, 0.3083627576875649, 0.06987736615068886, 0.10695021203044208, 0.003386138880159706, -0.03302540098809623, 0.014380703707212124, -0.12697004189612926, 0.12385059216066494, 0.2768831360339444, 0.08956334190915569, 0.19509472483364138, -0.4259020591397648, -0.2304122453029065, 0.06902829093008261, 0.07562107195828002, 0.07652305818392315, -0.07327506618521115, -0.22183355037797836, 0.07976858000662448, -0.13271360275794522, -0.12392664684549622, -0.04496651619431931, -0.010817688343155643, 0.053663743767833366, -0.23826553350638435, 0.02843740698375294, -0.015023402982478729, 0.07299506831222444, -0.06538988483236238, -0.1078203455325675, 0.02771874059976983, 0.11368578948094037, -0.00925193439858655, -0.029591094834082152, 0.1571744785714132, -0.16977930527207427, -0.041351507276134646, 0.4155188897705596, -0.08061125182691772, -0.11660877879088123, 0.19776138792867246, -0.16936781220441766, -0.08896324137036783, 0.12926087297998584, 0.1805613244836475, 0.10221685871373916, -0.12388686706443601, 0.018985941763579223, 0.0564185360056834, 0.21765880807694318, 0.09906362930980875, 0.09904649062419607, 0.24965498813738426, 0.20109863486309684, 0.042046599484899125, 0.15630977332129722, -0.17843956344902678, 0.054595005580399564, -0.26688983503297187, -0.17778929153902698, -0.18304864384328434, 0.025008511926938336, -0.12821183166986727, -0.1368581453959147, 0.39027441373985744, 0.15763795360649913, 0.16072290527728805, 0.016113426517129985, 0.344772533309457, 0.054038651581124766, 0.10958979308159779, 0.010254086278702902, 0.27879904609079054, 0.12424607359149588, 0.15875032876510228, -0.21572502800499668, 0.046932816730881365, -0.058346488867359964]
|
1,803.05229
|
Twinning to slip transition in ultrathin BCC Fe nanowires
|
We report twinning to slip transition with decreasing size and increasing
temperature in ultrathin $<$100$>$ BCC Fe nanowires. Molecular dynamics
simulations have been performed on different nanowire size in the range
0.404-3.634 nm at temperatures ranging from 10 to 900 K. The results indicate
that slip mode dominates at low sizes and high temperatures, while deformation
twinning is promoted at high sizes and low temperatures. The temperature, at
which the nanowires show twinning to slip transition, increases with increasing
size. The different modes of deformation are also reflected appropriately in
the respective stress-strain behaviour of the nanowires.
|
cond-mat.mtrl-sci
|
we report twinning to slip transition with decreasing size and increasing temperature in ultrathin 100 bcc fe nanowires molecular dynamics simulations have been performed on different nanowire size in the range 04043634 nm at temperatures ranging from 10 to 900 k the results indicate that slip mode dominates at low sizes and high temperatures while deformation twinning is promoted at high sizes and low temperatures the temperature at which the nanowires show twinning to slip transition increases with increasing size the different modes of deformation are also reflected appropriately in the respective stressstrain behaviour of the nanowires
|
[['we', 'report', 'twinning', 'to', 'slip', 'transition', 'with', 'decreasing', 'size', 'and', 'increasing', 'temperature', 'in', 'ultrathin', '100', 'bcc', 'fe', 'nanowires', 'molecular', 'dynamics', 'simulations', 'have', 'been', 'performed', 'on', 'different', 'nanowire', 'size', 'in', 'the', 'range', '04043634', 'nm', 'at', 'temperatures', 'ranging', 'from', '10', 'to', '900', 'k', 'the', 'results', 'indicate', 'that', 'slip', 'mode', 'dominates', 'at', 'low', 'sizes', 'and', 'high', 'temperatures', 'while', 'deformation', 'twinning', 'is', 'promoted', 'at', 'high', 'sizes', 'and', 'low', 'temperatures', 'the', 'temperature', 'at', 'which', 'the', 'nanowires', 'show', 'twinning', 'to', 'slip', 'transition', 'increases', 'with', 'increasing', 'size', 'the', 'different', 'modes', 'of', 'deformation', 'are', 'also', 'reflected', 'appropriately', 'in', 'the', 'respective', 'stressstrain', 'behaviour', 'of', 'the', 'nanowires']]
|
[-0.11265045482529483, 0.29735353266490466, -0.0026177840676003448, -0.08065106723976594, 0.007165837518793221, -0.14669087477765666, 0.03266727319957378, 0.4581921808858169, -0.2571400276501663, -0.3413546366306643, 0.06732689028164411, -0.30367665517648373, -0.014302240694329763, 0.1564144325190379, 0.048042446588321276, 0.034002189626335166, -0.022207512745808344, -0.04866525208793367, -0.11150747763895197, -0.2017315595318602, 0.22327530469434956, 0.08148109509299199, 0.4058269925105075, 0.11487431561302704, 0.059470374668914396, -0.08114399831792223, 0.12222601241713467, 0.058447083635352705, -0.2131330009752522, -0.03261838347680168, 0.27343209080087644, -0.11594130628266915, 0.20460995166407278, -0.4377728828888697, -0.2020166089732811, -0.008357317720462257, 0.14302475297881756, 0.14465452304890883, -0.025583542860355617, -0.19790107101774387, 0.15816206136757197, -0.08200213934954566, -0.12370317728103448, 0.02001686799970533, 0.05958159230067395, 0.016567424967433908, -0.21606441983991923, 0.10052722657292179, 0.009351891155044237, 0.18118592860992067, -0.07929509853905377, -0.1592159317272793, -0.10267938871402293, 0.04381092445813314, 0.06810145558119984, 0.008062080503805191, 0.24887784191135628, -0.06497611595356527, -0.01988908465136774, 0.34392626777601737, -0.029759943376120646, -0.030956803656105574, 0.251518533739727, -0.20051088871938796, -0.054948110319249586, 0.2908678303841346, 0.16830908912622058, 0.08623582203290425, -0.061166066637573145, 0.0007378927924340436, 0.10679235516969736, 0.20606042488240442, 0.15466554223773224, 0.03660954424412921, 0.24407480781277022, 0.22379262973360406, -0.021551475052547175, 0.1402320274282829, -0.16182259037304902, -0.0431604761009415, -0.2159788678982295, -0.125403816079294, -0.19632735279052818, 0.005044097527085493, -0.19080635060724185, -0.15618797015728583, 0.3138864790283454, 0.15671918426717943, 0.23346838403570777, 0.08520229658097378, 0.185881303109151, 0.09264760551013751, 0.13188108146277955, 0.01945503196232797, 0.2617271143826656, 0.15449314355889024, 0.14651601333510675, -0.31177302740252344, 0.08398917654994875, -0.05674642581046404]
|
1,803.0523
|
Simplified models of circumstellar morphologies for interpreting
high-resolution data. Analytical approach to the equatorial density
enhancement
|
Equatorial density enhancements (EDEs) are a very common astronomical
phenomenon. Studies of the circumstellar environments (CSE) of young stellar
objects and of evolved stars have shown that these objects often possess these
features. These are believed to originate from different mechanisms, ranging
from binary interactions to the gravitational collapse of interstellar
material. Quantifying the effect of the presence of this type of EDE on the
observables is essential for a correct interpretation of high-resolution data.
We seek to investigate the manifestation in the observables of a circumstellar
EDE, to assess which properties can be constrained, and to provide an intuitive
bedrock on which to compare and interpret upcoming high-resolution data (e.g.
\emph{ALMA} data) using 3D models. We develop a simplified analytical
parametrised description of a 3D EDE, with a possible substructure such as
warps, gaps, and spiral instabilities. In addition, different velocity fields
(Keplerian, radial, super-Keplerian, sub-Keplerian and rigid rotation) are
considered. The effect of a bipolar outflow is also investigated. The
geometrical models are fed into the 3D radiative transfer code {\tt LIME}, that
produces 3D intensity maps throughout velocity space. We investigate the
spectral signature of the $J$=3$-$2 up to $J$=7$-$6 rotational transitions of
CO in the models, as well as the spatial aspect of this emission by means of
channel maps, wide-slit position-velocity (PV) diagrams, stereograms, and
spectral lines. Additionally, we discuss methods of constraining the geometry
of the EDE, the inclination, the mass-contrast between the EDE and the bipolar
outflow, and the global velocity field. Finally, we simulated \emph{ALMA}
observations...
|
astro-ph.SR astro-ph.GA
|
equatorial density enhancements edes are a very common astronomical phenomenon studies of the circumstellar environments cse of young stellar objects and of evolved stars have shown that these objects often possess these features these are believed to originate from different mechanisms ranging from binary interactions to the gravitational collapse of interstellar material quantifying the effect of the presence of this type of ede on the observables is essential for a correct interpretation of highresolution data we seek to investigate the manifestation in the observables of a circumstellar ede to assess which properties can be constrained and to provide an intuitive bedrock on which to compare and interpret upcoming highresolution data eg emphalma data using 3d models we develop a simplified analytical parametrised description of a 3d ede with a possible substructure such as warps gaps and spiral instabilities in addition different velocity fields keplerian radial superkeplerian subkeplerian and rigid rotation are considered the effect of a bipolar outflow is also investigated the geometrical models are fed into the 3d radiative transfer code tt lime that produces 3d intensity maps throughout velocity space we investigate the spectral signature of the j32 up to j76 rotational transitions of co in the models as well as the spatial aspect of this emission by means of channel maps wideslit positionvelocity pv diagrams stereograms and spectral lines additionally we discuss methods of constraining the geometry of the ede the inclination the masscontrast between the ede and the bipolar outflow and the global velocity field finally we simulated emphalma observations
|
[['equatorial', 'density', 'enhancements', 'edes', 'are', 'a', 'very', 'common', 'astronomical', 'phenomenon', 'studies', 'of', 'the', 'circumstellar', 'environments', 'cse', 'of', 'young', 'stellar', 'objects', 'and', 'of', 'evolved', 'stars', 'have', 'shown', 'that', 'these', 'objects', 'often', 'possess', 'these', 'features', 'these', 'are', 'believed', 'to', 'originate', 'from', 'different', 'mechanisms', 'ranging', 'from', 'binary', 'interactions', 'to', 'the', 'gravitational', 'collapse', 'of', 'interstellar', 'material', 'quantifying', 'the', 'effect', 'of', 'the', 'presence', 'of', 'this', 'type', 'of', 'ede', 'on', 'the', 'observables', 'is', 'essential', 'for', 'a', 'correct', 'interpretation', 'of', 'highresolution', 'data', 'we', 'seek', 'to', 'investigate', 'the', 'manifestation', 'in', 'the', 'observables', 'of', 'a', 'circumstellar', 'ede', 'to', 'assess', 'which', 'properties', 'can', 'be', 'constrained', 'and', 'to', 'provide', 'an', 'intuitive', 'bedrock', 'on', 'which', 'to', 'compare', 'and', 'interpret', 'upcoming', 'highresolution', 'data', 'eg', 'emphalma', 'data', 'using', '3d', 'models', 'we', 'develop', 'a', 'simplified', 'analytical', 'parametrised', 'description', 'of', 'a', '3d', 'ede', 'with', 'a', 'possible', 'substructure', 'such', 'as', 'warps', 'gaps', 'and', 'spiral', 'instabilities', 'in', 'addition', 'different', 'velocity', 'fields', 'keplerian', 'radial', 'superkeplerian', 'subkeplerian', 'and', 'rigid', 'rotation', 'are', 'considered', 'the', 'effect', 'of', 'a', 'bipolar', 'outflow', 'is', 'also', 'investigated', 'the', 'geometrical', 'models', 'are', 'fed', 'into', 'the', '3d', 'radiative', 'transfer', 'code', 'tt', 'lime', 'that', 'produces', '3d', 'intensity', 'maps', 'throughout', 'velocity', 'space', 'we', 'investigate', 'the', 'spectral', 'signature', 'of', 'the', 'j32', 'up', 'to', 'j76', 'rotational', 'transitions', 'of', 'co', 'in', 'the', 'models', 'as', 'well', 'as', 'the', 'spatial', 'aspect', 'of', 'this', 'emission', 'by', 'means', 'of', 'channel', 'maps', 'wideslit', 'positionvelocity', 'pv', 'diagrams', 'stereograms', 'and', 'spectral', 'lines', 'additionally', 'we', 'discuss', 'methods', 'of', 'constraining', 'the', 'geometry', 'of', 'the', 'ede', 'the', 'inclination', 'the', 'masscontrast', 'between', 'the', 'ede', 'and', 'the', 'bipolar', 'outflow', 'and', 'the', 'global', 'velocity', 'field', 'finally', 'we', 'simulated', 'emphalma', 'observations']]
|
[-0.09567894784186501, 0.07181595597747946, -0.07339839934674092, 0.10340630340902135, -0.0966660858374089, -0.06870646737515926, -0.021520735966041683, 0.398961679989472, -0.24538471287302674, -0.32257193097425624, 0.07477007428510114, -0.23301414091931655, -0.09666658849641681, 0.1819523465940729, -0.017606546620838343, 0.011720524561358615, 0.044717086041346193, -0.07058677680871915, -0.08239062036783434, -0.15635421627294271, 0.34900836573541166, 0.09188977751752828, 0.1874603337049484, -0.006133758906275034, 0.06993414357793518, -0.11410989726241678, -0.0808884927276522, 0.020891324984724634, -0.1640080591592123, 0.10427315773162991, 0.21546156598544622, 0.1449913283265196, 0.1557271904721856, -0.42269920589216053, -0.2557563563515432, 0.052237785447388885, 0.16932577078900068, 0.10792012047115714, -0.03244433687720448, -0.28545542421238496, 0.04559838388673961, -0.1693125416073017, -0.15282219968922436, -0.04828248209133744, 0.024410946374293415, 0.03966422143392265, -0.262155131271109, 0.09388029705674854, 0.047384513512719426, 0.1051416312935762, -0.10445556117873639, -0.08319099285732955, -0.09563191531132907, 0.10996825939696282, 0.03866996460594237, 0.02639607462659478, 0.15480769030936062, -0.16043497072998433, -0.06312008827226237, 0.43117087964341044, -0.08009782255836763, -0.13134912914055166, 0.23769954791874626, -0.17334176795603706, -0.1306419668085873, 0.13341060399916024, 0.20157769767940045, 0.11303323367144913, -0.11171127454563975, 0.0064231391455978155, -0.03819718830054626, 0.15777869887650012, 0.03372852698899806, 0.06519744387175888, 0.3120564600098878, 0.09529336698865518, -0.017171817156486212, 0.1342570903680753, -0.21641976822377182, -0.0780621106105391, -0.2522360381856561, -0.12703671623766422, -0.12780536500597373, 0.04213625814672559, -0.12444632283691316, -0.1483168959225295, 0.36701296586170795, 0.15668425809498876, 0.2370632107023848, -0.013441200100816786, 0.3237863162457943, 0.0673418937716633, 0.0783865063553676, 0.08149055572878569, 0.2888504861518741, 0.16090283147897572, 0.10392438437044621, -0.23443722609151155, 0.07011092835012823, -0.001986010179389268]
|
1,803.05231
|
Deformation space of discrete groups of SU(2,1) in quaternionic
hyperbolic plane
|
In this note, we study deformations of discrete and Zariski dense subgroups
of SU(2, 1) in quaternionic hyperbolic space. Specifi- cally we consider two
examples coming from representations of 3-manifold groups (the figure eight
knot and Whitehead links complement) and show opposite behavior: one is not
deformable outside U(2,1), while the other has a big space of deformations in
Sp(2, 1).
|
math.GT
|
in this note we study deformations of discrete and zariski dense subgroups of su2 1 in quaternionic hyperbolic space specifi cally we consider two examples coming from representations of 3manifold groups the figure eight knot and whitehead links complement and show opposite behavior one is not deformable outside u21 while the other has a big space of deformations in sp2 1
|
[['in', 'this', 'note', 'we', 'study', 'deformations', 'of', 'discrete', 'and', 'zariski', 'dense', 'subgroups', 'of', 'su2', '1', 'in', 'quaternionic', 'hyperbolic', 'space', 'specifi', 'cally', 'we', 'consider', 'two', 'examples', 'coming', 'from', 'representations', 'of', '3manifold', 'groups', 'the', 'figure', 'eight', 'knot', 'and', 'whitehead', 'links', 'complement', 'and', 'show', 'opposite', 'behavior', 'one', 'is', 'not', 'deformable', 'outside', 'u21', 'while', 'the', 'other', 'has', 'a', 'big', 'space', 'of', 'deformations', 'in', 'sp2', '1']]
|
[-0.189305587419782, 0.10073437347824944, -0.07063600900353956, 0.050971125222009715, -0.0883444841248823, -0.13072654000124664, -0.033672059214383855, 0.38164640091298546, -0.2885796795980852, -0.23210420850359026, 0.12040451822657382, -0.31616678360666406, -0.18365295461882822, 0.15817881426697628, -0.17029537778103448, -0.05183611447983956, 0.06574294622987509, 0.07364755238360557, -0.10920613312513613, -0.2449943529877079, 0.4017638700296644, -0.12206491673762193, 0.21490424607315514, 0.01537166245770259, 0.07522734904997662, -0.016690961268470913, -0.05158368203422574, -0.021472181881526026, -0.12979487498428244, 0.11348956937855872, 0.28599368017472204, 0.027316745179781658, 0.16123255265334652, -0.39138742307292634, -0.17311944907195256, 0.18299121648592295, 0.17495996253106927, -0.011267028340581254, -0.018516150574184587, -0.2967637246169272, 0.05335563285749589, -0.1770711416897715, -0.13572652482229178, -0.04979752370568573, 0.027228399721875053, -0.011622168365140736, -0.11162434187794074, -0.006590085333121605, 0.07491331554178271, 0.10497562470464189, -0.05573329915002477, -0.08904613754483032, -0.03213187792628515, 0.1360972528345883, 0.034896579053878905, 0.03535856712360477, 0.1119871708243841, -0.13880215788672326, -0.11198864962722434, 0.4389659193207006, -0.023448314227652353, -0.24662352154855846, 0.18218322678423318, -0.20046306314465942, -0.2517243953284304, 0.16827325341215388, 0.12107859210485257, 0.09276005647099408, -0.019645180095170366, 0.18463635529853312, -0.11436704105218552, 0.07765266733515061, 0.09591604943280338, -0.03797379943740661, 0.12088327983119448, 0.1181665048247478, 0.08637664950315337, 0.144579257542214, -0.0388265727393207, -0.04370477122300472, -0.32329479609539763, -0.2457152198595529, -0.11390308613364722, 0.08985478808501254, -0.09338125513917117, -0.1417400217424223, 0.406569751483373, -0.002132943693975933, 0.17346937154404451, 0.07913161301222003, 0.22682524496903184, -0.06879356678586727, 0.030728398861371162, 0.08534393217567293, 0.1719561380822761, 0.1529192780793385, -0.034740964191217645, -0.11676302138090011, -0.11937628397870748, 0.1469209655264362]
|
1,803.05232
|
Energy Reconstruction of Hadrons in highly granular combined ECAL and
HCAL systems
|
This paper discusses the hadronic energy reconstruction of two combined
electromagnetic and hadronic calorimeter systems using physics prototypes of
the CALICE collaboration: the silicon-tungsten electromagnetic calorimeter
(Si-W ECAL) and the scintillator-SiPM based analog hadron calorimeter (AHCAL);
and the scintillator-tungsten electromagnetic calorimeter (ScECAL) and the
AHCAL. These systems were operated in hadron beams at CERN and FNAL, permitting
the study of the performance in combined ECAL and HCAL systems.
Two techniques for the energy reconstruction are used, a standard
reconstruction based on calibrated sub-detector energy sums, and one based on a
software compensation algorithm making use of the local energy density
information provided by the high granularity of the detectors. The software
compensation-based algorithm improves the hadronic energy resolution by up to
30% compared to the standard reconstruction. The combined system data show
comparable energy resolutions to the one achieved for data with showers
starting only in the AHCAL and therefore demonstrate the success of the
inter-calibration of the different sub-systems, despite of their different
geometries and different readout technologies.
|
physics.ins-det
|
this paper discusses the hadronic energy reconstruction of two combined electromagnetic and hadronic calorimeter systems using physics prototypes of the calice collaboration the silicontungsten electromagnetic calorimeter siw ecal and the scintillatorsipm based analog hadron calorimeter ahcal and the scintillatortungsten electromagnetic calorimeter scecal and the ahcal these systems were operated in hadron beams at cern and fnal permitting the study of the performance in combined ecal and hcal systems two techniques for the energy reconstruction are used a standard reconstruction based on calibrated subdetector energy sums and one based on a software compensation algorithm making use of the local energy density information provided by the high granularity of the detectors the software compensationbased algorithm improves the hadronic energy resolution by up to 30 compared to the standard reconstruction the combined system data show comparable energy resolutions to the one achieved for data with showers starting only in the ahcal and therefore demonstrate the success of the intercalibration of the different subsystems despite of their different geometries and different readout technologies
|
[['this', 'paper', 'discusses', 'the', 'hadronic', 'energy', 'reconstruction', 'of', 'two', 'combined', 'electromagnetic', 'and', 'hadronic', 'calorimeter', 'systems', 'using', 'physics', 'prototypes', 'of', 'the', 'calice', 'collaboration', 'the', 'silicontungsten', 'electromagnetic', 'calorimeter', 'siw', 'ecal', 'and', 'the', 'scintillatorsipm', 'based', 'analog', 'hadron', 'calorimeter', 'ahcal', 'and', 'the', 'scintillatortungsten', 'electromagnetic', 'calorimeter', 'scecal', 'and', 'the', 'ahcal', 'these', 'systems', 'were', 'operated', 'in', 'hadron', 'beams', 'at', 'cern', 'and', 'fnal', 'permitting', 'the', 'study', 'of', 'the', 'performance', 'in', 'combined', 'ecal', 'and', 'hcal', 'systems', 'two', 'techniques', 'for', 'the', 'energy', 'reconstruction', 'are', 'used', 'a', 'standard', 'reconstruction', 'based', 'on', 'calibrated', 'subdetector', 'energy', 'sums', 'and', 'one', 'based', 'on', 'a', 'software', 'compensation', 'algorithm', 'making', 'use', 'of', 'the', 'local', 'energy', 'density', 'information', 'provided', 'by', 'the', 'high', 'granularity', 'of', 'the', 'detectors', 'the', 'software', 'compensationbased', 'algorithm', 'improves', 'the', 'hadronic', 'energy', 'resolution', 'by', 'up', 'to', '30', 'compared', 'to', 'the', 'standard', 'reconstruction', 'the', 'combined', 'system', 'data', 'show', 'comparable', 'energy', 'resolutions', 'to', 'the', 'one', 'achieved', 'for', 'data', 'with', 'showers', 'starting', 'only', 'in', 'the', 'ahcal', 'and', 'therefore', 'demonstrate', 'the', 'success', 'of', 'the', 'intercalibration', 'of', 'the', 'different', 'subsystems', 'despite', 'of', 'their', 'different', 'geometries', 'and', 'different', 'readout', 'technologies']]
|
[-0.06908460130948506, 0.1274492387533673, -0.07044731824195938, 0.056466231660075306, -0.0005571898616694226, -0.10060100228397433, -0.054561920535839914, 0.3631328437519176, -0.19166980571152564, -0.390049819204354, 0.07752495044619291, -0.3157397537899321, 0.008783252374408487, 0.21005232818424702, 0.019681877688041884, 0.16131803354884158, 0.15052706694152362, -0.0024537480656548353, -0.09078630967299917, -0.17291349713540005, 0.27460037964649925, 0.20959561484347203, 0.33875168888957913, 0.047495589008789044, 0.20934861777963754, 0.03159558746132799, -0.09635205909018656, -0.019537755731537848, -0.08309244877563979, 0.11494082282157894, 0.2798625391944239, 0.11662734784520493, 0.17959790598757253, -0.4443802977912128, -0.11682191220653093, 0.059107274190706764, 0.06187796170131755, 0.0034460695265251364, -0.06571275980105835, -0.3028758318347488, 0.10143353645327295, -0.22758592245821468, -0.0946749209030392, -0.02594442500225352, -0.12197146637220226, 0.0606470148840328, -0.23147672764443888, -0.0334152303228969, -0.018949947657320134, 0.04695544561962346, -0.0361175286837346, -0.19197757546385627, 0.03948843971725754, 0.0753290772934383, -0.0004612890958875239, 0.036161267525561064, 0.15826368560766366, -0.16019863708357432, -0.14290405753414387, 0.36045979575705744, 0.005905254960790678, -0.1749152156209272, 0.21195292286191436, -0.16243427932892596, -0.0890216139719604, 0.19591707930883426, 0.2337667221443248, 0.0323660891826549, -0.22641784536602075, 0.06627879769947034, 0.07729910769915309, 0.18150200704279953, 0.07251792074833623, 0.06863348271340845, 0.1743647102280492, 0.274572856729839, 0.023734678074433104, 0.10831175732473748, -0.14247855828053033, 0.007310899635386503, -0.3126555394198645, -0.1608871104537989, -0.18504788155505758, -0.01975087353800741, -0.02773946731087813, -0.11942737177572028, 0.42178106132872445, 0.11595482087532381, 0.13592656008888057, -0.035015038110059266, 0.3660227393586479, 0.003655152693725453, 0.07518217019586193, 0.038129511695009416, 0.310038967267889, 0.13406558328414123, 0.19926646089705521, -0.21647563202984207, -0.014189912254425759, 0.05822451186190711]
|
1,803.05233
|
CloudHealth: A Model-Driven Approach to Watch the Health of Cloud
Services
|
Cloud systems are complex and large systems where services provided by
different operators must coexist and eventually cooperate. In such a complex
environment, controlling the health of both the whole environment and the
individual services is extremely important to timely and effectively react to
misbehaviours, unexpected events, and failures. Although there are solutions to
monitor cloud systems at different granularity levels, how to relate the many
KPIs that can be collected about the health of the system and how health
information can be properly reported to operators are open questions. This
paper reports the early results we achieved in the challenge of monitoring the
health of cloud systems. In particular we present CloudHealth, a model-based
health monitoring approach that can be used by operators to watch specific
quality attributes. The CloudHealth Monitoring Model describes how to
operationalize high level monitoring goals by dividing them into subgoals,
deriving metrics for the subgoals, and using probes to collect the metrics. We
use the CloudHealth Monitoring Model to control the probes that must be
deployed on the target system, the KPIs that are dynamically collected, and the
visualization of the data in dashboards.
|
cs.SE
|
cloud systems are complex and large systems where services provided by different operators must coexist and eventually cooperate in such a complex environment controlling the health of both the whole environment and the individual services is extremely important to timely and effectively react to misbehaviours unexpected events and failures although there are solutions to monitor cloud systems at different granularity levels how to relate the many kpis that can be collected about the health of the system and how health information can be properly reported to operators are open questions this paper reports the early results we achieved in the challenge of monitoring the health of cloud systems in particular we present cloudhealth a modelbased health monitoring approach that can be used by operators to watch specific quality attributes the cloudhealth monitoring model describes how to operationalize high level monitoring goals by dividing them into subgoals deriving metrics for the subgoals and using probes to collect the metrics we use the cloudhealth monitoring model to control the probes that must be deployed on the target system the kpis that are dynamically collected and the visualization of the data in dashboards
|
[['cloud', 'systems', 'are', 'complex', 'and', 'large', 'systems', 'where', 'services', 'provided', 'by', 'different', 'operators', 'must', 'coexist', 'and', 'eventually', 'cooperate', 'in', 'such', 'a', 'complex', 'environment', 'controlling', 'the', 'health', 'of', 'both', 'the', 'whole', 'environment', 'and', 'the', 'individual', 'services', 'is', 'extremely', 'important', 'to', 'timely', 'and', 'effectively', 'react', 'to', 'misbehaviours', 'unexpected', 'events', 'and', 'failures', 'although', 'there', 'are', 'solutions', 'to', 'monitor', 'cloud', 'systems', 'at', 'different', 'granularity', 'levels', 'how', 'to', 'relate', 'the', 'many', 'kpis', 'that', 'can', 'be', 'collected', 'about', 'the', 'health', 'of', 'the', 'system', 'and', 'how', 'health', 'information', 'can', 'be', 'properly', 'reported', 'to', 'operators', 'are', 'open', 'questions', 'this', 'paper', 'reports', 'the', 'early', 'results', 'we', 'achieved', 'in', 'the', 'challenge', 'of', 'monitoring', 'the', 'health', 'of', 'cloud', 'systems', 'in', 'particular', 'we', 'present', 'cloudhealth', 'a', 'modelbased', 'health', 'monitoring', 'approach', 'that', 'can', 'be', 'used', 'by', 'operators', 'to', 'watch', 'specific', 'quality', 'attributes', 'the', 'cloudhealth', 'monitoring', 'model', 'describes', 'how', 'to', 'operationalize', 'high', 'level', 'monitoring', 'goals', 'by', 'dividing', 'them', 'into', 'subgoals', 'deriving', 'metrics', 'for', 'the', 'subgoals', 'and', 'using', 'probes', 'to', 'collect', 'the', 'metrics', 'we', 'use', 'the', 'cloudhealth', 'monitoring', 'model', 'to', 'control', 'the', 'probes', 'that', 'must', 'be', 'deployed', 'on', 'the', 'target', 'system', 'the', 'kpis', 'that', 'are', 'dynamically', 'collected', 'and', 'the', 'visualization', 'of', 'the', 'data', 'in', 'dashboards']]
|
[-0.12848546084898868, 0.09336617434838493, -0.07964957350938531, 0.07513105477770105, -0.06785689967954041, -0.14359562771983053, 0.0718772193410826, 0.38780287644384726, -0.2575049959846135, -0.35930272407989067, 0.16471080777578448, -0.3282423251823179, -0.12089282463451749, 0.1954984439880048, -0.11666702896013464, 0.054176579564074547, 0.07781751456327345, 0.003009505876290955, 0.004024308022895926, -0.2632717608670263, 0.3262925601735907, 0.05703274737553377, 0.2918905350134561, 0.0739394345810931, 0.06240348888034197, -0.010289254100797209, -0.03531670999884801, 0.010503901970131617, -0.049560128258522844, 0.15119616575048941, 0.3662118219071999, 0.22189144283582113, 0.29244650007580947, -0.45735264817546856, -0.20071116864656735, 0.10091663267322522, 0.1418393376071962, 0.04666652162436788, -0.007791586187177975, -0.3381433983039307, 0.09117134271410147, -0.1789547113946786, -0.1331251364078765, -0.13173522048041617, -0.006739504822823954, 0.03844325897577954, -0.2389021278211945, -0.0059138815801002475, -0.035215927110249665, 0.0628218908426597, -0.10918469209910224, -0.034066059782267795, -0.032795910284805455, 0.26392273294102203, 0.025871242436972496, 0.008757699109571006, 0.19179477058105954, -0.14429926562282305, -0.10591034104459379, 0.37385427083599526, -0.009522766552522386, -0.16770072571173505, 0.2326847389708028, -0.1106398402002493, -0.1568708163404249, 0.0519644022337161, 0.26373122725804266, 0.0797968330805337, -0.23375106337235163, -0.008267813789854316, 0.03710106649239989, 0.1815949071805287, -0.0023202212668318105, 0.036616727199993634, 0.2020603072253595, 0.17641274503579266, 0.055196006436476874, 0.10253597100044748, -0.021272689558865847, -0.058982595657366084, -0.2100444230839218, -0.13924026808358336, -0.11060654152135709, 0.0137683427524998, -0.04388240325129836, -0.09768420104917727, 0.39295730390831046, 0.2268990178090845, 0.17615369719355123, -0.034790815468372066, 0.3161107321514895, 0.06960810603524901, 0.10405278541147708, 0.06637767379809367, 0.17110376075204264, -0.013125008965327747, 0.15635351613409032, -0.18548690723010192, 0.11735827736571848, -0.026698240338775672]
|
1,803.05234
|
Optical properties of dense lithium in electride phases by
first-principles calculations
|
The metal-semiconductor-metal transition in dense lithium is considered as an
archetype of interplay between interstitial electron localization and
delocalization induced by compression, which leads to exotic electride phases.
In this work, the dynamic dielectric response and optical properties of the
high-pressure electride phases of cI16, oC40 and oC24 in lithium spanning a
wide pressure range from 40 to 200 GPa by first-principles calculations are
reported. Both interband and intraband contribution to the dielectric function
are deliberately treated with the linear response theory. One intraband and two
interband plasmons in cI16 at 70 GPa induced by a structural distortion at 2.1,
4.1, and 7.7 eV are discovered, which make the reflectivity of this weak
metallic phase abnormally lower than the insulating phase oC40 at the
corresponding frequencies. More strikingly, oC24 as a reentrant metallic phase
with higher conductivity becomes more transparent than oC40 in infrared and
visible light range due to its unique electronic structure around Fermi
surface. An intriguing reflectivity anisotropy in both oC40 and oC24 is
predicted, with the former being strong enough for experimental detection
within the spectrum up to 10 eV. The important role of interstitial localized
electrons is highlighted, revealing diversity and rich physics in electrides.
|
cond-mat.mtrl-sci physics.comp-ph physics.optics
|
the metalsemiconductormetal transition in dense lithium is considered as an archetype of interplay between interstitial electron localization and delocalization induced by compression which leads to exotic electride phases in this work the dynamic dielectric response and optical properties of the highpressure electride phases of ci16 oc40 and oc24 in lithium spanning a wide pressure range from 40 to 200 gpa by firstprinciples calculations are reported both interband and intraband contribution to the dielectric function are deliberately treated with the linear response theory one intraband and two interband plasmons in ci16 at 70 gpa induced by a structural distortion at 21 41 and 77 ev are discovered which make the reflectivity of this weak metallic phase abnormally lower than the insulating phase oc40 at the corresponding frequencies more strikingly oc24 as a reentrant metallic phase with higher conductivity becomes more transparent than oc40 in infrared and visible light range due to its unique electronic structure around fermi surface an intriguing reflectivity anisotropy in both oc40 and oc24 is predicted with the former being strong enough for experimental detection within the spectrum up to 10 ev the important role of interstitial localized electrons is highlighted revealing diversity and rich physics in electrides
|
[['the', 'metalsemiconductormetal', 'transition', 'in', 'dense', 'lithium', 'is', 'considered', 'as', 'an', 'archetype', 'of', 'interplay', 'between', 'interstitial', 'electron', 'localization', 'and', 'delocalization', 'induced', 'by', 'compression', 'which', 'leads', 'to', 'exotic', 'electride', 'phases', 'in', 'this', 'work', 'the', 'dynamic', 'dielectric', 'response', 'and', 'optical', 'properties', 'of', 'the', 'highpressure', 'electride', 'phases', 'of', 'ci16', 'oc40', 'and', 'oc24', 'in', 'lithium', 'spanning', 'a', 'wide', 'pressure', 'range', 'from', '40', 'to', '200', 'gpa', 'by', 'firstprinciples', 'calculations', 'are', 'reported', 'both', 'interband', 'and', 'intraband', 'contribution', 'to', 'the', 'dielectric', 'function', 'are', 'deliberately', 'treated', 'with', 'the', 'linear', 'response', 'theory', 'one', 'intraband', 'and', 'two', 'interband', 'plasmons', 'in', 'ci16', 'at', '70', 'gpa', 'induced', 'by', 'a', 'structural', 'distortion', 'at', '21', '41', 'and', '77', 'ev', 'are', 'discovered', 'which', 'make', 'the', 'reflectivity', 'of', 'this', 'weak', 'metallic', 'phase', 'abnormally', 'lower', 'than', 'the', 'insulating', 'phase', 'oc40', 'at', 'the', 'corresponding', 'frequencies', 'more', 'strikingly', 'oc24', 'as', 'a', 'reentrant', 'metallic', 'phase', 'with', 'higher', 'conductivity', 'becomes', 'more', 'transparent', 'than', 'oc40', 'in', 'infrared', 'and', 'visible', 'light', 'range', 'due', 'to', 'its', 'unique', 'electronic', 'structure', 'around', 'fermi', 'surface', 'an', 'intriguing', 'reflectivity', 'anisotropy', 'in', 'both', 'oc40', 'and', 'oc24', 'is', 'predicted', 'with', 'the', 'former', 'being', 'strong', 'enough', 'for', 'experimental', 'detection', 'within', 'the', 'spectrum', 'up', 'to', '10', 'ev', 'the', 'important', 'role', 'of', 'interstitial', 'localized', 'electrons', 'is', 'highlighted', 'revealing', 'diversity', 'and', 'rich', 'physics', 'in', 'electrides']]
|
[-0.1066867838066537, 0.22210899808749673, -0.021166134143713863, 0.01893957623571623, -0.026154251811094584, -0.1384477888868423, 0.09587082624260802, 0.41944425836205484, -0.23841282899025829, -0.32331747172400355, 0.00932400401943596, -0.34704795413650574, -0.14401934608817102, 0.1556065651238896, 0.0499402375461068, -0.0021227368531253885, -0.06244049233733676, -0.0632143388944678, -0.10392779027344659, -0.1493434051098302, 0.2224180293426616, 0.06264483576756902, 0.29761190684163014, 0.11886204775655643, 0.0005323647195473313, -0.01973893611924723, 0.08668463808920933, 0.0056472839787602425, -0.11608321510953828, 0.05753857649164274, 0.30397308815387075, -0.10192734786076471, 0.20205140610516537, -0.40763502636924387, -0.2164131008973345, 0.009156944256974385, 0.10297930478169291, 0.09348421300877817, -0.0776168529021379, -0.27982966556213795, 0.055071919187903405, -0.12538915113080293, -0.12251551879337058, -0.06083590278634801, 0.021254580533131957, -0.0519691671198234, -0.20595175424037734, 0.13654080601874738, 0.026191672841086984, 0.09445988066345308, -0.12995463288447354, -0.14017948353430257, -0.06804602890973911, 0.035860416616196746, 0.02224231383879669, 0.05271001090935897, 0.13809911036631092, -0.12131247367244213, -0.05017804078292101, 0.4260825594048947, -0.05317003809686867, -0.007477506337454543, 0.22088800112716853, -0.18561906268601888, -0.03803958524833433, 0.2662121161562391, 0.10807902154047042, 0.07647554507362657, -0.13853885042830372, 0.02349453840724891, 0.03667070420386153, 0.19030063198239078, 0.10279698649304919, 0.11546041743160458, 0.2446438440075144, 0.19556234035175293, 0.02415892792982049, 0.12634011107351398, -0.11733400282333604, -0.026202050698921085, -0.19432993461377918, -0.1265923996665515, -0.16064566873945296, 0.048365635231602935, -0.07820738797476225, -0.17930651884060353, 0.3829847850534134, 0.10629932702868246, 0.17777180759585462, -0.06608719427953474, 0.23632765639282297, 0.07335957995237549, 0.05239248282799963, 0.03874918732326478, 0.302626628659782, 0.16182932910276576, 0.11601911965291947, -0.2503131812857464, 0.061637500724755226, -0.010172763280570507]
|
1,803.05235
|
Pseudo Dirac Nodal Sphere: Unusual Electronic Structure and Material
Realization
|
Topological semimetals (TSMs) in which conduction and valence bands cross at
zero-dimensional (0D) Dirac nodal points (DNPs) or 1D Dirac nodal lines (DNLs),
in 3D momentum space, have recently drawn much attention due to their exotic
electronic properties. Here we generalize the TSM state further to a
higher-symmetry and higher-dimensional pseudo Dirac nodal sphere (PDNS) state,
with the band crossings forming a 2D closed sphere at the Fermi level. The PDNS
state is characterized with a spherical backbone consisting of multiple
crossing DNLs while band degeneracy in between the DNLs is approximately
maintained by weak interactions. It exhibits some unique electronic properties
and low-energy excitations, such as collective plasmons different from DNPs and
DNLs. Based on crystalline symmetries, we theoretically demonstrate two
possible types of PDNS states, and identify all the possible band crossings
with pairs of 1D irreducible representations to form the PDNS states in 32
point groups. Importantly, we discover that strained MH3 (M= Y, Ho, Tb, Nd) and
Si3N2 are materials candidates to realize these two types of PDNS states,
respectively. As a high-symmetry-required state, the PDNS semimetal can be
regarded as the "parent phase" for other topological gapped and gapless states.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
topological semimetals tsms in which conduction and valence bands cross at zerodimensional 0d dirac nodal points dnps or 1d dirac nodal lines dnls in 3d momentum space have recently drawn much attention due to their exotic electronic properties here we generalize the tsm state further to a highersymmetry and higherdimensional pseudo dirac nodal sphere pdns state with the band crossings forming a 2d closed sphere at the fermi level the pdns state is characterized with a spherical backbone consisting of multiple crossing dnls while band degeneracy in between the dnls is approximately maintained by weak interactions it exhibits some unique electronic properties and lowenergy excitations such as collective plasmons different from dnps and dnls based on crystalline symmetries we theoretically demonstrate two possible types of pdns states and identify all the possible band crossings with pairs of 1d irreducible representations to form the pdns states in 32 point groups importantly we discover that strained mh3 m y ho tb nd and si3n2 are materials candidates to realize these two types of pdns states respectively as a highsymmetryrequired state the pdns semimetal can be regarded as the parent phase for other topological gapped and gapless states
|
[['topological', 'semimetals', 'tsms', 'in', 'which', 'conduction', 'and', 'valence', 'bands', 'cross', 'at', 'zerodimensional', '0d', 'dirac', 'nodal', 'points', 'dnps', 'or', '1d', 'dirac', 'nodal', 'lines', 'dnls', 'in', '3d', 'momentum', 'space', 'have', 'recently', 'drawn', 'much', 'attention', 'due', 'to', 'their', 'exotic', 'electronic', 'properties', 'here', 'we', 'generalize', 'the', 'tsm', 'state', 'further', 'to', 'a', 'highersymmetry', 'and', 'higherdimensional', 'pseudo', 'dirac', 'nodal', 'sphere', 'pdns', 'state', 'with', 'the', 'band', 'crossings', 'forming', 'a', '2d', 'closed', 'sphere', 'at', 'the', 'fermi', 'level', 'the', 'pdns', 'state', 'is', 'characterized', 'with', 'a', 'spherical', 'backbone', 'consisting', 'of', 'multiple', 'crossing', 'dnls', 'while', 'band', 'degeneracy', 'in', 'between', 'the', 'dnls', 'is', 'approximately', 'maintained', 'by', 'weak', 'interactions', 'it', 'exhibits', 'some', 'unique', 'electronic', 'properties', 'and', 'lowenergy', 'excitations', 'such', 'as', 'collective', 'plasmons', 'different', 'from', 'dnps', 'and', 'dnls', 'based', 'on', 'crystalline', 'symmetries', 'we', 'theoretically', 'demonstrate', 'two', 'possible', 'types', 'of', 'pdns', 'states', 'and', 'identify', 'all', 'the', 'possible', 'band', 'crossings', 'with', 'pairs', 'of', '1d', 'irreducible', 'representations', 'to', 'form', 'the', 'pdns', 'states', 'in', '32', 'point', 'groups', 'importantly', 'we', 'discover', 'that', 'strained', 'mh3', 'm', 'y', 'ho', 'tb', 'nd', 'and', 'si3n2', 'are', 'materials', 'candidates', 'to', 'realize', 'these', 'two', 'types', 'of', 'pdns', 'states', 'respectively', 'as', 'a', 'highsymmetryrequired', 'state', 'the', 'pdns', 'semimetal', 'can', 'be', 'regarded', 'as', 'the', 'parent', 'phase', 'for', 'other', 'topological', 'gapped', 'and', 'gapless', 'states']]
|
[-0.17731489990433735, 0.17950989356942457, -0.024420682034742357, 0.061819106650447056, -0.05445622190485655, -0.20647457573524255, 0.11434928198837208, 0.3738491711408199, -0.26142135745281153, -0.2665407283525972, 0.0075097952235292234, -0.35898614666603235, -0.13731622149916897, 0.11836889340576036, 0.057878758065544864, 0.03986013282351003, -0.006293999090298547, -0.02599645954305837, -0.13686508167513353, -0.19701272691358748, 0.33785830568908254, -0.054270654762347124, 0.3035781582542381, 0.019809447210812892, 0.01791789209339864, -0.015329147438118185, 0.14382221058512906, -0.006999416568906437, -0.11258580953625744, 0.08111157611439516, 0.2872208291749166, -0.0791033605461062, 0.15994349521599285, -0.4184983526670176, -0.21456845510398748, 0.055601679481122004, 0.16030305550781132, 0.10829218776855579, -0.03241577225802418, -0.36132736576460495, 0.04441264582498704, -0.12830237102805797, -0.16676068495852883, -0.12753928085328248, -0.007139061769073826, -0.030794639939290273, -0.15071126190376097, 0.06004653977823728, 0.05284389254752875, 0.06321466700149787, -0.0830512886741464, -0.13325117430541125, -0.19424043451749523, 0.07112271604224692, 0.008769416064506522, -0.008867966138288485, 0.05026868813540883, -0.09790679163400837, -0.15381480492603208, 0.41429832770725605, -0.024701365979069873, -0.16901730563867973, 0.2155960786549635, -0.13212430413566298, -0.11755877328008761, 0.17532348207685458, 0.11218537287358339, 0.06167987800912613, -0.0681203405621312, 0.09608133634524613, -0.05831170165211619, 0.11030377790713658, 0.04703385298806267, 0.12434325100965025, 0.2802733106543479, 0.13106322040482196, 0.06323239155755489, 0.11682832158662843, -0.1411498439585105, -0.06640237583260057, -0.23337344105694433, -0.19496470275986458, -0.22985715136701637, 0.06789604758534948, -0.005948142152852041, -0.19971561338390595, 0.4566161724813572, 0.046324336901307106, 0.20142490437514887, -0.031080972677738516, 0.17991700723352286, 0.09074574035961529, 0.06041536383436983, 0.09223641130899518, 0.21707200428903456, 0.11337246197888656, 0.03879301192195497, -0.2017143678506402, -0.037300221798724345, 0.0667092340897016]
|
1,803.05236
|
Some negative results related to Poissonian pair correlation problems
|
We say that a sequence $(x_n)_{n \in \mathbb{N}}$ in $[0,1)$ has Poissonian
pair correlations if \begin{equation*} \lim_{N \to \infty} \frac{1}{N} \# \left
\lbrace 1 \leq l \neq m \leq N: \| x_l - x_m \| \leq \frac{s}{N} \right \rbrace
= 2s \end{equation*} for every $s \geq 0$. The aim of this article is twofold.
First, we will establish a gap theorem which allows to deduce that a sequence
$(x_n)_{n \in \mathbb{N}}$ of real numbers in $[0,1)$ having a certain weak gap
structure, cannot have Poissonian pair correlations. This result covers a broad
class of sequences, e.g., Kronecker sequences, the van der Corput sequence and
in more general $LS$-sequences of points and digital $(t,1)$-sequences.
Additionally, this theorem enables us to derive negative pair correlation
properties for sequences of the form $(\lbrace a_n \alpha \rbrace)_{n \in
\mathbb{N}}$, where $(a_n)_{n \in \mathbb{N}}$ is a strictly increasing
sequence of integers with maximal order of additive energy, a notion that plays
an important role in many fields, e.g., additive combinatorics, and is strongly
connected to Poissonian pair correlation problems. These statements are not
only metrical results, but hold for all possible choices of $\alpha$.
Second, in this note we study the pair correlation statistics for sequences
of the form, $x_n = \lbrace b^n \alpha \rbrace, \ n=1, 2, 3, \ldots$, with an
integer $b \geq 2$, where we choose $\alpha$ as the Stoneham number and as an
infinite de Bruijn word. We will prove that both instances fail to have the
Poissonian property. Throughout this article $\lbrace \cdot \rbrace$ denotes
the fractional part of a real number.
|
math.NT
|
we say that a sequence x_n_n in mathbbn in 01 has poissonian pair correlations if beginequation lim_n to infty frac1n left lbrace 1 leq l neq m leq n x_l x_m leq fracsn right rbrace 2s endequation for every s geq 0 the aim of this article is twofold first we will establish a gap theorem which allows to deduce that a sequence x_n_n in mathbbn of real numbers in 01 having a certain weak gap structure cannot have poissonian pair correlations this result covers a broad class of sequences eg kronecker sequences the van der corput sequence and in more general lssequences of points and digital t1sequences additionally this theorem enables us to derive negative pair correlation properties for sequences of the form lbrace a_n alpha rbrace_n in mathbbn where a_n_n in mathbbn is a strictly increasing sequence of integers with maximal order of additive energy a notion that plays an important role in many fields eg additive combinatorics and is strongly connected to poissonian pair correlation problems these statements are not only metrical results but hold for all possible choices of alpha second in this note we study the pair correlation statistics for sequences of the form x_n lbrace bn alpha rbrace n1 2 3 ldots with an integer b geq 2 where we choose alpha as the stoneham number and as an infinite de bruijn word we will prove that both instances fail to have the poissonian property throughout this article lbrace cdot rbrace denotes the fractional part of a real number
|
[['we', 'say', 'that', 'a', 'sequence', 'x_n_n', 'in', 'mathbbn', 'in', '01', 'has', 'poissonian', 'pair', 'correlations', 'if', 'beginequation', 'lim_n', 'to', 'infty', 'frac1n', 'left', 'lbrace', '1', 'leq', 'l', 'neq', 'm', 'leq', 'n', 'x_l', 'x_m', 'leq', 'fracsn', 'right', 'rbrace', '2s', 'endequation', 'for', 'every', 's', 'geq', '0', 'the', 'aim', 'of', 'this', 'article', 'is', 'twofold', 'first', 'we', 'will', 'establish', 'a', 'gap', 'theorem', 'which', 'allows', 'to', 'deduce', 'that', 'a', 'sequence', 'x_n_n', 'in', 'mathbbn', 'of', 'real', 'numbers', 'in', '01', 'having', 'a', 'certain', 'weak', 'gap', 'structure', 'can', 'not', 'have', 'poissonian', 'pair', 'correlations', 'this', 'result', 'covers', 'a', 'broad', 'class', 'of', 'sequences', 'eg', 'kronecker', 'sequences', 'the', 'van', 'der', 'corput', 'sequence', 'and', 'in', 'more', 'general', 'lssequences', 'of', 'points', 'and', 'digital', 't1sequences', 'additionally', 'this', 'theorem', 'enables', 'us', 'to', 'derive', 'negative', 'pair', 'correlation', 'properties', 'for', 'sequences', 'of', 'the', 'form', 'lbrace', 'a_n', 'alpha', 'rbrace_n', 'in', 'mathbbn', 'where', 'a_n_n', 'in', 'mathbbn', 'is', 'a', 'strictly', 'increasing', 'sequence', 'of', 'integers', 'with', 'maximal', 'order', 'of', 'additive', 'energy', 'a', 'notion', 'that', 'plays', 'an', 'important', 'role', 'in', 'many', 'fields', 'eg', 'additive', 'combinatorics', 'and', 'is', 'strongly', 'connected', 'to', 'poissonian', 'pair', 'correlation', 'problems', 'these', 'statements', 'are', 'not', 'only', 'metrical', 'results', 'but', 'hold', 'for', 'all', 'possible', 'choices', 'of', 'alpha', 'second', 'in', 'this', 'note', 'we', 'study', 'the', 'pair', 'correlation', 'statistics', 'for', 'sequences', 'of', 'the', 'form', 'x_n', 'lbrace', 'bn', 'alpha', 'rbrace', 'n1', '2', '3', 'ldots', 'with', 'an', 'integer', 'b', 'geq', '2', 'where', 'we', 'choose', 'alpha', 'as', 'the', 'stoneham', 'number', 'and', 'as', 'an', 'infinite', 'de', 'bruijn', 'word', 'we', 'will', 'prove', 'that', 'both', 'instances', 'fail', 'to', 'have', 'the', 'poissonian', 'property', 'throughout', 'this', 'article', 'lbrace', 'cdot', 'rbrace', 'denotes', 'the', 'fractional', 'part', 'of', 'a', 'real', 'number']]
|
[-0.20472523398050216, 0.16975074589836153, -0.02557217111026384, 0.058905357045788816, -0.013451622151879696, -0.1684382578457053, -0.002546335884927237, 0.37437704854872167, -0.32270812009200894, -0.22218074115379585, 0.028912442404956475, -0.3545654751700152, -0.1284393628492702, 0.13570737715913203, -0.08092000544452527, -0.011060110987695741, 0.008643977626366175, 0.08826410626867918, -0.03228863311301748, -0.2472438855645775, 0.3125197222331671, -0.0910828587137104, 0.1617853187468484, 0.005605312489618467, 0.07066467869110171, 0.022676492972468123, 0.03556867581187183, -0.04574543315006097, -0.23522992306833493, 0.05350957473915979, 0.2858613016245168, 0.11538511722836292, 0.35442869280607947, -0.32764041517422565, -0.09669592379506194, 0.25085325404363645, 0.2139146975410037, -0.02321262143169141, -0.007535800894144391, -0.21808768262331352, 0.17582183622014452, -0.1355363005354238, -0.13666589019864095, -0.036619634052195885, 0.137448889053038, 0.06820667646165321, -0.36355383472639047, 0.04893613644640922, 0.16595023416769214, 0.038792462777493035, 0.023734216762323474, -0.18405048403197782, -0.0005097012438877361, 0.130718358988529, -0.006774563937700962, 0.10505822654556865, 0.0030756434460086236, -0.06094647748084137, -0.08231918959246809, 0.3164874369436215, -0.06078099167225589, -0.1930632892240748, 0.06983501753883481, -0.2126031476659627, -0.22505394559111594, 0.0876614273393776, 0.07363974551489672, 0.1510317842054408, -0.06058108726379784, 0.17923713249601717, -0.09471402248902995, 0.19278104150645786, 0.14333278021232526, 0.04062757169388741, 0.14219385956681707, 0.06923603803958876, 0.081448579831993, 0.09233198839324108, -0.032247271095439206, 0.003921444115080453, -0.3392050802876337, -0.1783765532740018, -0.1949763105752306, 0.17696416281881205, -0.12528777122657975, -0.17570272269915407, 0.2919664048630099, 0.11855460023397477, 0.20497506691920242, 0.1264920639058421, 0.1583066085696323, 0.0869182951924369, -0.04545732535578596, 0.03375963686496078, 0.045078677761434455, 0.1438638469952298, 0.056621407768363684, -0.12387455547767907, 0.018139116071883267, 0.11863268322428673]
|
1,803.05237
|
Blue wing enhancement of the chromospheric Mg II h and k lines in a
solar flare
|
We performed coordinated observations of AR 12205, which produced a C-class
flare on 2014 November 11, with the Interface Region Imaging Spectrograph
(IRIS) and the Domeless Solar Telescope (DST) at Hida Observatory. Using
spectral data in the Si IV 1403 \AA, C II 1335 \AA, and Mg II h and k lines
from IRIS and the Ca II K, Ca II 8542 \AA, and H$\alpha$ lines from DST, we
investigated a moving flare kernel during the flare. In the Mg II h line, the
leading edge of the flare kernel showed the intensity enhancement in the blue
wing, and the smaller intensity of the blue-side peak (h2v) than that of the
red-side one (h2r). The blueshift lasted for 9-48 s with a typical speed of
10.1 $\pm$ 2.6 km s$^{-1}$ and it was followed by the high intensity and the
large redshift with a speed of up to 51 km s$^{-1}$ detected in the Mg II h
line. The large redshift was a common property for all six lines but the
blueshift prior to it was found only in the Mg II lines. A cloud modeling of
the Mg II h line suggests that the blue wing enhancement with such peak
difference can be caused by a chromospheric-temperature (cool) upflow. We
discuss a scenario in which an upflow of cool plasma is lifted up by expanding
hot plasma owing to the deep penetration of non-thermal electrons into the
chromosphere. Furthermore, we found that the blueshift persisted without any
subsequent redshift in the leading edge of the flare kernel during its decaying
phase. The cause of such long-lasting blueshift is also discussed.
|
astro-ph.SR
|
we performed coordinated observations of ar 12205 which produced a cclass flare on 2014 november 11 with the interface region imaging spectrograph iris and the domeless solar telescope dst at hida observatory using spectral data in the si iv 1403 aa c ii 1335 aa and mg ii h and k lines from iris and the ca ii k ca ii 8542 aa and halpha lines from dst we investigated a moving flare kernel during the flare in the mg ii h line the leading edge of the flare kernel showed the intensity enhancement in the blue wing and the smaller intensity of the blueside peak h2v than that of the redside one h2r the blueshift lasted for 948 s with a typical speed of 101 pm 26 km s1 and it was followed by the high intensity and the large redshift with a speed of up to 51 km s1 detected in the mg ii h line the large redshift was a common property for all six lines but the blueshift prior to it was found only in the mg ii lines a cloud modeling of the mg ii h line suggests that the blue wing enhancement with such peak difference can be caused by a chromospherictemperature cool upflow we discuss a scenario in which an upflow of cool plasma is lifted up by expanding hot plasma owing to the deep penetration of nonthermal electrons into the chromosphere furthermore we found that the blueshift persisted without any subsequent redshift in the leading edge of the flare kernel during its decaying phase the cause of such longlasting blueshift is also discussed
|
[['we', 'performed', 'coordinated', 'observations', 'of', 'ar', '12205', 'which', 'produced', 'a', 'cclass', 'flare', 'on', '2014', 'november', '11', 'with', 'the', 'interface', 'region', 'imaging', 'spectrograph', 'iris', 'and', 'the', 'domeless', 'solar', 'telescope', 'dst', 'at', 'hida', 'observatory', 'using', 'spectral', 'data', 'in', 'the', 'si', 'iv', '1403', 'aa', 'c', 'ii', '1335', 'aa', 'and', 'mg', 'ii', 'h', 'and', 'k', 'lines', 'from', 'iris', 'and', 'the', 'ca', 'ii', 'k', 'ca', 'ii', '8542', 'aa', 'and', 'halpha', 'lines', 'from', 'dst', 'we', 'investigated', 'a', 'moving', 'flare', 'kernel', 'during', 'the', 'flare', 'in', 'the', 'mg', 'ii', 'h', 'line', 'the', 'leading', 'edge', 'of', 'the', 'flare', 'kernel', 'showed', 'the', 'intensity', 'enhancement', 'in', 'the', 'blue', 'wing', 'and', 'the', 'smaller', 'intensity', 'of', 'the', 'blueside', 'peak', 'h2v', 'than', 'that', 'of', 'the', 'redside', 'one', 'h2r', 'the', 'blueshift', 'lasted', 'for', '948', 's', 'with', 'a', 'typical', 'speed', 'of', '101', 'pm', '26', 'km', 's1', 'and', 'it', 'was', 'followed', 'by', 'the', 'high', 'intensity', 'and', 'the', 'large', 'redshift', 'with', 'a', 'speed', 'of', 'up', 'to', '51', 'km', 's1', 'detected', 'in', 'the', 'mg', 'ii', 'h', 'line', 'the', 'large', 'redshift', 'was', 'a', 'common', 'property', 'for', 'all', 'six', 'lines', 'but', 'the', 'blueshift', 'prior', 'to', 'it', 'was', 'found', 'only', 'in', 'the', 'mg', 'ii', 'lines', 'a', 'cloud', 'modeling', 'of', 'the', 'mg', 'ii', 'h', 'line', 'suggests', 'that', 'the', 'blue', 'wing', 'enhancement', 'with', 'such', 'peak', 'difference', 'can', 'be', 'caused', 'by', 'a', 'chromospherictemperature', 'cool', 'upflow', 'we', 'discuss', 'a', 'scenario', 'in', 'which', 'an', 'upflow', 'of', 'cool', 'plasma', 'is', 'lifted', 'up', 'by', 'expanding', 'hot', 'plasma', 'owing', 'to', 'the', 'deep', 'penetration', 'of', 'nonthermal', 'electrons', 'into', 'the', 'chromosphere', 'furthermore', 'we', 'found', 'that', 'the', 'blueshift', 'persisted', 'without', 'any', 'subsequent', 'redshift', 'in', 'the', 'leading', 'edge', 'of', 'the', 'flare', 'kernel', 'during', 'its', 'decaying', 'phase', 'the', 'cause', 'of', 'such', 'longlasting', 'blueshift', 'is', 'also', 'discussed']]
|
[-0.05499234424507314, 0.14862389309354412, 0.026395622436690178, 0.03372235539007104, -0.03206305986968801, -0.1593259396617887, 0.030271041323754213, 0.470514965640312, -0.17130327442902382, -0.3339368536344005, 0.06145761921717268, -0.28765146912041084, -0.034818000485689414, 0.16595823233947157, -0.01155318720535703, -0.053636414273340184, 0.09015557132488876, -0.011430269497860636, -0.024988041700271423, -0.1845325829556074, 0.23521647752624833, 0.10092689449008536, 0.22198306853727748, 0.043407274065194304, 0.03147513182700129, -0.11510647465280878, -0.05510620160580233, 0.051251088423412985, -0.101817684227259, 0.048815508103170605, 0.1913562437303847, 0.14587606173914133, 0.24757321987956488, -0.3436191424141052, -0.21131097850070715, 0.030105593674643723, 0.16013239831836135, -0.016545822607359796, 0.017437369490680456, -0.3152269519783591, 0.049771755364188854, -0.10045444594730657, -0.1267570642599215, 0.1335201900176428, 0.09118287855310848, -0.016165083823553115, -0.2585704679566401, 0.07436679077617117, 0.05261045741197584, 0.15567140374534777, -0.061645405458855544, -0.09094131093782683, -0.10693107734787864, 0.03773183756404453, 0.015925228611255685, 0.059977937991627386, 0.1383439923640388, -0.08867048258824205, -0.024189975110951948, 0.37048960563347294, -0.1545500298171343, 0.09074024394396003, 0.16747648954667427, -0.20270942852884116, -0.11392589734556774, 0.28098429602881275, 0.12132514405271246, 0.08988451635878947, -0.06079443329082871, 0.04593261327353065, -0.0077431842624382284, 0.1810970568201608, 0.07560608012998407, -0.0026916040278997066, 0.20819180151447653, 0.05649788569469281, 0.023696601044179665, 0.10015699272259587, -0.3090299111126957, -0.007379478083371564, -0.29543648653672316, -0.18718229850271234, -0.07853922628392293, 0.04092079769621638, -0.10984374560109615, -0.16090654580405464, 0.38642432222755074, 0.09680517644931873, 0.27113539216591526, -0.04700819711908008, 0.22504800795749932, 0.12744939834638327, 0.09151587756566221, 0.16235409728165165, 0.28980227711920936, 0.16340808108086802, 0.2206447956962856, -0.2526993702872898, 0.0456750861576034, 0.04811937493806774]
|
1,803.05238
|
A Likely Detection of a Two-Planet System in a Low Magnification
Microlensing Event
|
We report on the analysis of a microlensing event OGLE-2014-BLG-1722 that
showed two distinct short term anomalies. The best fit model to the observed
light curves shows that the two anomalies are explained with two planetary mass
ratio companions to the primary lens. Although a binary source model is also
able to explain the second anomaly, it is marginally ruled out by 3.1 $\sigma$.
The 2-planet model indicates that the first anomaly was caused by planet "b"
with a mass ratio of $q = (4.5_{-0.6}^{+0.7}) \times 10^{-4}$ and projected
separation in unit of the Einstein radius, $s = 0.753 \pm 0.004$. The second
anomaly reveals planet "c" with a mass ratio of $q_{2} = (7.0_{-1.7}^{+2.3})
\times 10^{-4}$ with $\Delta \chi^{2} \sim 170$ compared to the single planet
model. Its separation has a so-called close-wide degeneracy. We estimated the
physical parameters of the lens system from Bayesian analysis. This gives that
the masses of planet b and c are $m_{\rm b} = 56_{-33}^{+51}\,M_{\oplus}$ and
$m_{\rm c} = 85_{-51}^{+86}\,M_{\oplus}$, respectively, and they orbit a late
type star with a mass of $M_{\rm host} = 0.40_{-0.24}^{+0.36}\,M_{\odot}$
located at $D_{\rm L} = 6.4_{-1.8}^{+1.3}\,\rm kpc$ from us. If the 2-planet
model is true, this is the third multiple planet system detected by using the
microlensing method, and the first multiple planet system detected in the low
magnification events, which are dominant in the microlensing survey data. The
occurrence rate of multiple cold gas giant systems is estimated using the two
such detections and a simple extrapolation of the survey sensitivity of 6 year
MOA microlensing survey (Suzuki et al. 2016) combined with the 4 year $\mu$FUN
detection efficiency (Gould et al. 2010). It is estimated that $6 \pm 2\,\%$ of
stars host two cold giant planets.
|
astro-ph.EP
|
we report on the analysis of a microlensing event ogle2014blg1722 that showed two distinct short term anomalies the best fit model to the observed light curves shows that the two anomalies are explained with two planetary mass ratio companions to the primary lens although a binary source model is also able to explain the second anomaly it is marginally ruled out by 31 sigma the 2planet model indicates that the first anomaly was caused by planet b with a mass ratio of q 45_0607 times 104 and projected separation in unit of the einstein radius s 0753 pm 0004 the second anomaly reveals planet c with a mass ratio of q_2 70_1723 times 104 with delta chi2 sim 170 compared to the single planet model its separation has a socalled closewide degeneracy we estimated the physical parameters of the lens system from bayesian analysis this gives that the masses of planet b and c are m_rm b 56_3351m_oplus and m_rm c 85_5186m_oplus respectively and they orbit a late type star with a mass of m_rm host 040_024036m_odot located at d_rm l 64_1813rm kpc from us if the 2planet model is true this is the third multiple planet system detected by using the microlensing method and the first multiple planet system detected in the low magnification events which are dominant in the microlensing survey data the occurrence rate of multiple cold gas giant systems is estimated using the two such detections and a simple extrapolation of the survey sensitivity of 6 year moa microlensing survey suzuki et al 2016 combined with the 4 year mufun detection efficiency gould et al 2010 it is estimated that 6 pm 2 of stars host two cold giant planets
|
[['we', 'report', 'on', 'the', 'analysis', 'of', 'a', 'microlensing', 'event', 'ogle2014blg1722', 'that', 'showed', 'two', 'distinct', 'short', 'term', 'anomalies', 'the', 'best', 'fit', 'model', 'to', 'the', 'observed', 'light', 'curves', 'shows', 'that', 'the', 'two', 'anomalies', 'are', 'explained', 'with', 'two', 'planetary', 'mass', 'ratio', 'companions', 'to', 'the', 'primary', 'lens', 'although', 'a', 'binary', 'source', 'model', 'is', 'also', 'able', 'to', 'explain', 'the', 'second', 'anomaly', 'it', 'is', 'marginally', 'ruled', 'out', 'by', '31', 'sigma', 'the', '2planet', 'model', 'indicates', 'that', 'the', 'first', 'anomaly', 'was', 'caused', 'by', 'planet', 'b', 'with', 'a', 'mass', 'ratio', 'of', 'q', '45_0607', 'times', '104', 'and', 'projected', 'separation', 'in', 'unit', 'of', 'the', 'einstein', 'radius', 's', '0753', 'pm', '0004', 'the', 'second', 'anomaly', 'reveals', 'planet', 'c', 'with', 'a', 'mass', 'ratio', 'of', 'q_2', '70_1723', 'times', '104', 'with', 'delta', 'chi2', 'sim', '170', 'compared', 'to', 'the', 'single', 'planet', 'model', 'its', 'separation', 'has', 'a', 'socalled', 'closewide', 'degeneracy', 'we', 'estimated', 'the', 'physical', 'parameters', 'of', 'the', 'lens', 'system', 'from', 'bayesian', 'analysis', 'this', 'gives', 'that', 'the', 'masses', 'of', 'planet', 'b', 'and', 'c', 'are', 'm_rm', 'b', '56_3351m_oplus', 'and', 'm_rm', 'c', '85_5186m_oplus', 'respectively', 'and', 'they', 'orbit', 'a', 'late', 'type', 'star', 'with', 'a', 'mass', 'of', 'm_rm', 'host', '040_024036m_odot', 'located', 'at', 'd_rm', 'l', '64_1813rm', 'kpc', 'from', 'us', 'if', 'the', '2planet', 'model', 'is', 'true', 'this', 'is', 'the', 'third', 'multiple', 'planet', 'system', 'detected', 'by', 'using', 'the', 'microlensing', 'method', 'and', 'the', 'first', 'multiple', 'planet', 'system', 'detected', 'in', 'the', 'low', 'magnification', 'events', 'which', 'are', 'dominant', 'in', 'the', 'microlensing', 'survey', 'data', 'the', 'occurrence', 'rate', 'of', 'multiple', 'cold', 'gas', 'giant', 'systems', 'is', 'estimated', 'using', 'the', 'two', 'such', 'detections', 'and', 'a', 'simple', 'extrapolation', 'of', 'the', 'survey', 'sensitivity', 'of', '6', 'year', 'moa', 'microlensing', 'survey', 'suzuki', 'et', 'al', '2016', 'combined', 'with', 'the', '4', 'year', 'mufun', 'detection', 'efficiency', 'gould', 'et', 'al', '2010', 'it', 'is', 'estimated', 'that', '6', 'pm', '2', 'of', 'stars', 'host', 'two', 'cold', 'giant', 'planets']]
|
[-0.15267236211587695, 0.08909265313000567, -0.0417213340492774, 0.05271624775596665, -0.0676730308771147, -0.11908653685553135, 0.07188084079087645, 0.3066604514471323, -0.16270262480922637, -0.40390254177180107, 0.08076916041191788, -0.3162049193313156, -0.08613796967277439, 0.18317298583544628, -0.048455527911900775, 0.01123581290142982, 0.0851802351600676, -0.025702042953090986, -0.04830427313910163, -0.2782707553301209, 0.25178612517640064, 0.05444191292306219, 0.12186757170138003, 0.0010638869185324597, 0.06971057403859669, -0.0377669287082044, -0.056407884924092155, -0.039379169540209834, -0.16278358234371082, 0.026540720110684902, 0.16899681593075502, 0.14025028596106626, 0.1734216658945155, -0.2700481036360767, -0.1766721128403425, 0.08757080397892582, 0.1333789871347582, 0.012838637585683382, -0.01002183319550291, -0.2783731093070895, 0.08979804932133065, -0.20693312194434574, -0.14808521301829783, 0.06068202467851233, 0.09472344463785598, -0.013835830046235165, -0.27271808426071337, 0.1508948799365907, 0.055238312555719975, 0.07834736910223475, -0.07523914831530208, -0.14300226059656226, -0.06542072283185046, 0.03181569300173526, 0.029027651728424447, 0.10333399683156091, 0.1310949132957435, -0.046334515625199274, -0.055693748789211815, 0.3988323111249053, -0.11289382880583973, -0.04157189787382368, 0.21104592449315215, -0.20077404061010093, -0.13717312746693083, 0.15597986084690818, 0.15746007341743057, 0.11506563084254014, -0.18285703295470634, 0.018780112394449752, -0.020301941376047856, 0.23490787343715952, 0.07534617797574501, -0.0324578721850665, 0.3499700949642051, 0.14037120178134344, 0.016489885194038136, 0.03354029355176718, -0.24588795874412914, -0.0360226203030333, -0.24145409945407847, -0.10289256574090003, -0.15844242776148493, 0.051228818827835115, -0.10823371376392206, -0.06788223841315325, 0.33154225316526287, 0.12421133068046006, 0.25224255458991707, 0.036466283030703366, 0.2795001982350199, 0.0975225404233071, 0.10180538128053371, 0.0793951210179712, 0.3350436403517328, 0.14708099276691244, 0.0711184608719676, -0.24899972767752185, 0.033779914725396404, 0.020846429691184734]
|
1,803.05239
|
A complex network framework to model cognition: unveiling correlation
structures from connectivity
|
Several approaches to cognition and intelligence research rely on
statistics-based models testing, namely factor analysis. In the present work we
exploit the emerging dynamical systems perspective putting the focus on the
role of the network topology underlying the relationships between cognitive
processes. We go through a couple of models of distinct cognitive phenomena and
yet find the conditions for them to be mathematically equivalent. We find a
non-trivial attractor of the system that corresponds to the exact definition of
a well-known network centrality and hence stress the interplay between the
dynamics and the underlying network connectivity, showing that both of the two
are relevant. The connectivity structure between cognitive processes is not
known but yet it is not any. Regardless of the network considered, it is always
possible to recover a positive manifold of correlations. However, we show that
different network topologies lead to different plausible statistical models
concerning correlations structure, ranging from one to multiple factors models
and richer correlation structures.
|
physics.soc-ph cond-mat.dis-nn q-bio.NC
|
several approaches to cognition and intelligence research rely on statisticsbased models testing namely factor analysis in the present work we exploit the emerging dynamical systems perspective putting the focus on the role of the network topology underlying the relationships between cognitive processes we go through a couple of models of distinct cognitive phenomena and yet find the conditions for them to be mathematically equivalent we find a nontrivial attractor of the system that corresponds to the exact definition of a wellknown network centrality and hence stress the interplay between the dynamics and the underlying network connectivity showing that both of the two are relevant the connectivity structure between cognitive processes is not known but yet it is not any regardless of the network considered it is always possible to recover a positive manifold of correlations however we show that different network topologies lead to different plausible statistical models concerning correlations structure ranging from one to multiple factors models and richer correlation structures
|
[['several', 'approaches', 'to', 'cognition', 'and', 'intelligence', 'research', 'rely', 'on', 'statisticsbased', 'models', 'testing', 'namely', 'factor', 'analysis', 'in', 'the', 'present', 'work', 'we', 'exploit', 'the', 'emerging', 'dynamical', 'systems', 'perspective', 'putting', 'the', 'focus', 'on', 'the', 'role', 'of', 'the', 'network', 'topology', 'underlying', 'the', 'relationships', 'between', 'cognitive', 'processes', 'we', 'go', 'through', 'a', 'couple', 'of', 'models', 'of', 'distinct', 'cognitive', 'phenomena', 'and', 'yet', 'find', 'the', 'conditions', 'for', 'them', 'to', 'be', 'mathematically', 'equivalent', 'we', 'find', 'a', 'nontrivial', 'attractor', 'of', 'the', 'system', 'that', 'corresponds', 'to', 'the', 'exact', 'definition', 'of', 'a', 'wellknown', 'network', 'centrality', 'and', 'hence', 'stress', 'the', 'interplay', 'between', 'the', 'dynamics', 'and', 'the', 'underlying', 'network', 'connectivity', 'showing', 'that', 'both', 'of', 'the', 'two', 'are', 'relevant', 'the', 'connectivity', 'structure', 'between', 'cognitive', 'processes', 'is', 'not', 'known', 'but', 'yet', 'it', 'is', 'not', 'any', 'regardless', 'of', 'the', 'network', 'considered', 'it', 'is', 'always', 'possible', 'to', 'recover', 'a', 'positive', 'manifold', 'of', 'correlations', 'however', 'we', 'show', 'that', 'different', 'network', 'topologies', 'lead', 'to', 'different', 'plausible', 'statistical', 'models', 'concerning', 'correlations', 'structure', 'ranging', 'from', 'one', 'to', 'multiple', 'factors', 'models', 'and', 'richer', 'correlation', 'structures']]
|
[-0.1362828565215301, 0.0683989655226469, -0.10431019497322447, 0.1239158691497761, -0.07675643298159825, -0.16116404101859066, 0.03311722514501279, 0.3833130389181782, -0.2933996547743632, -0.30820595728015, 0.06929812714080959, -0.23885102660674026, -0.2549015768389735, 0.16463156198553833, -0.011388564278245156, 0.003944118665301322, 0.04003936630374764, 0.05773506765857477, -0.05609024608009035, -0.1841881066405525, 0.3818448203943532, 0.04345907716161031, 0.3267525183554325, 0.07003848124755385, 0.09194027520371256, -0.04773171234122811, -0.032836726273088084, 0.03978173964711504, -0.10748506530491099, 0.1366580602724427, 0.2384592560268141, 0.18784407676157347, 0.26943272367453225, -0.45205491310974333, -0.2640843996418824, 0.12249960075491856, 0.11673685491090802, 0.08955675731470555, 0.027601152384670934, -0.26772880407602145, 0.06689493065803415, -0.14140303692288902, -0.058405528557889254, -0.08470661279365972, 0.011300552759986416, -0.008263303364345368, -0.24046676752465077, 0.04779361941518239, 0.09186676600685682, 0.050506359449139344, -0.05848415244663893, -0.08333250183689718, -0.0169412762409559, 0.21696234738488715, 0.06045074739786624, -0.005409883626271039, 0.12534749558494415, -0.1604049886852779, -0.14994591721125167, 0.3688315023024233, 0.029671725057450665, -0.21188707189364245, 0.27010821469737517, -0.10749966668016794, -0.17806135992990968, 0.07858361059909019, 0.1842550015490916, 0.06114631496300852, -0.15885766615795063, 0.04772277795644994, -0.024085650137154226, 0.1671816178979812, 0.008901131830902563, 0.06629360952367144, 0.19470503763008265, 0.18909942133950047, 0.0523611807298881, 0.09722818854986402, -0.03907341637844824, -0.14817971554850687, -0.24871923484125197, -0.1036279548188085, -0.14642726516144144, 0.05478243064512585, -0.08744085165857048, -0.1663544758964606, 0.4236827944951523, 0.1859687183075297, 0.213923104616158, 0.060794449312163996, 0.2651650396141189, 0.06648486441886628, 0.0760257794337784, 0.07351826219338016, 0.24059771294290572, 0.12531423324972024, 0.0799542375276854, -0.18224072436094974, 0.11240550989635795, -0.0033861525575227943]
|
1,803.0524
|
Parametric model order reduction for large-scale and complex thermal
systems
|
In this paper, a parametric model order reduction (pMOR) technique is
proposed to find a simplified system representation of a large-scale and
complex thermal system. The main principle behind this technique is that any
change of the physical parameters in the high-fidelity model can be updated
directly in the simplified model. For deriving the parametric reduced model, a
Krylov subspace method is employed which yields the relevant subspaces of the
projected state. With the help of the projection operator, first moments of the
low-rank model are set identical to the correspondent moments of the original
model. Additionally, a prior upper bound of the error induced by the
approximation is derived.
|
cs.SY
|
in this paper a parametric model order reduction pmor technique is proposed to find a simplified system representation of a largescale and complex thermal system the main principle behind this technique is that any change of the physical parameters in the highfidelity model can be updated directly in the simplified model for deriving the parametric reduced model a krylov subspace method is employed which yields the relevant subspaces of the projected state with the help of the projection operator first moments of the lowrank model are set identical to the correspondent moments of the original model additionally a prior upper bound of the error induced by the approximation is derived
|
[['in', 'this', 'paper', 'a', 'parametric', 'model', 'order', 'reduction', 'pmor', 'technique', 'is', 'proposed', 'to', 'find', 'a', 'simplified', 'system', 'representation', 'of', 'a', 'largescale', 'and', 'complex', 'thermal', 'system', 'the', 'main', 'principle', 'behind', 'this', 'technique', 'is', 'that', 'any', 'change', 'of', 'the', 'physical', 'parameters', 'in', 'the', 'highfidelity', 'model', 'can', 'be', 'updated', 'directly', 'in', 'the', 'simplified', 'model', 'for', 'deriving', 'the', 'parametric', 'reduced', 'model', 'a', 'krylov', 'subspace', 'method', 'is', 'employed', 'which', 'yields', 'the', 'relevant', 'subspaces', 'of', 'the', 'projected', 'state', 'with', 'the', 'help', 'of', 'the', 'projection', 'operator', 'first', 'moments', 'of', 'the', 'lowrank', 'model', 'are', 'set', 'identical', 'to', 'the', 'correspondent', 'moments', 'of', 'the', 'original', 'model', 'additionally', 'a', 'prior', 'upper', 'bound', 'of', 'the', 'error', 'induced', 'by', 'the', 'approximation', 'is', 'derived']]
|
[-0.08423412446440622, 0.0545014986472035, -0.0993858115451241, 0.05719508693172512, -0.04629362636796114, -0.10108733635649762, 0.054186348025475374, 0.3070966515436091, -0.30015992334281855, -0.30594402108002794, 0.09834189584415237, -0.20562517892897383, -0.14303764957849952, 0.182994792225178, -0.030095730679617686, 0.08651839619163762, 0.0726538100301034, 0.04272556653965942, -0.09888643661979586, -0.21933051999658346, 0.3077295510606332, 0.0684785952960903, 0.278140542876314, -0.02620213818101382, 0.1282945688475262, -0.024273569811008533, -0.004494040391661904, -0.014728831404566087, -0.08071169078764136, 0.18649555187333713, 0.18077612291936848, 0.14296056758612394, 0.2424836843994192, -0.39062669872390954, -0.21586667486381803, 0.12346506275405938, 0.12359332686544142, 0.1701594632097774, 0.011221161812797866, -0.2823873414150016, 0.07355648034929552, -0.19275722217068753, -0.1379356501158327, -0.08310836843976921, -0.05128659754568203, -0.0071272055703130634, -0.33309997183016754, 0.08206347874154082, 0.10962712938516316, -0.003276812486530451, -0.06577489390037954, -0.12009590545626865, -0.009960753375410357, 0.09179964474910363, -0.007347476251677356, 0.05662475890395316, 0.09770494548349895, -0.08581246471307664, -0.07785742923151702, 0.36808427389266646, -0.08209846813168208, -0.2480294520374049, 0.13171779955948956, -0.09938985634785653, -0.09796879357996989, 0.13546054794622417, 0.19718110959299587, 0.11610142794353041, -0.1945579149823805, 0.10046159080176784, -0.07761095636100931, 0.17598540306895633, -0.02964928357607939, -0.0089085811664435, 0.14243716570040718, 0.18063483916974457, 0.07265635832128199, 0.1440950515669432, -0.0849840974223546, -0.0979714327301322, -0.30456636934117837, -0.13845760531734083, -0.2049873588352718, -0.02436709941618822, -0.10763394169665513, -0.14863129107662562, 0.43030472683974286, 0.180777578745884, 0.20115992916874925, 0.024117875176439568, 0.34805759032341566, 0.1881363035805407, 0.04296541923646476, 0.04593316030011258, 0.24166182227940722, 0.1390541842228479, 0.026117161608338144, -0.23147642375393349, 0.09718164817049084, 0.13489203851839357]
|
1,803.05241
|
Plastic deformation of a permanently bonded network: stress relaxation
by pleats
|
We show that a flat two dimensional network of connected vertices, when
stretched, may deform plastically by producing `pleats'; system spanning linear
structures with width comparable to the lattice spacing, where the network
overlaps on itself. To understand the pleating process, we introduce an
external field that couples to local {\em non-affine} displacements, i.e. those
displacements of neighbouring vertices that cannot be represented as a local
affine strain. We obtain both zero and finite temperature phase diagrams in the
strain -- field plane. Pleats occur here as a result of an equilibrium
first-order transition from the homogeneous network to a heterogeneous phase
where stress is localised within pleats and eliminated elsewhere. We show that
in the thermodynamic limit the un-pleated state is always metastable at
vanishing field for infinitesimal strain. Plastic deformation of the initially
homogeneous network is akin to the decay of a metastable phase via a dynamical
transition. We make predictions concerning local stress distributions and
thermal effects associated with pleats which may be observable in suitable
experimental systems.
|
cond-mat.soft
|
we show that a flat two dimensional network of connected vertices when stretched may deform plastically by producing pleats system spanning linear structures with width comparable to the lattice spacing where the network overlaps on itself to understand the pleating process we introduce an external field that couples to local em nonaffine displacements ie those displacements of neighbouring vertices that cannot be represented as a local affine strain we obtain both zero and finite temperature phase diagrams in the strain field plane pleats occur here as a result of an equilibrium firstorder transition from the homogeneous network to a heterogeneous phase where stress is localised within pleats and eliminated elsewhere we show that in the thermodynamic limit the unpleated state is always metastable at vanishing field for infinitesimal strain plastic deformation of the initially homogeneous network is akin to the decay of a metastable phase via a dynamical transition we make predictions concerning local stress distributions and thermal effects associated with pleats which may be observable in suitable experimental systems
|
[['we', 'show', 'that', 'a', 'flat', 'two', 'dimensional', 'network', 'of', 'connected', 'vertices', 'when', 'stretched', 'may', 'deform', 'plastically', 'by', 'producing', 'pleats', 'system', 'spanning', 'linear', 'structures', 'with', 'width', 'comparable', 'to', 'the', 'lattice', 'spacing', 'where', 'the', 'network', 'overlaps', 'on', 'itself', 'to', 'understand', 'the', 'pleating', 'process', 'we', 'introduce', 'an', 'external', 'field', 'that', 'couples', 'to', 'local', 'em', 'nonaffine', 'displacements', 'ie', 'those', 'displacements', 'of', 'neighbouring', 'vertices', 'that', 'can', 'not', 'be', 'represented', 'as', 'a', 'local', 'affine', 'strain', 'we', 'obtain', 'both', 'zero', 'and', 'finite', 'temperature', 'phase', 'diagrams', 'in', 'the', 'strain', 'field', 'plane', 'pleats', 'occur', 'here', 'as', 'a', 'result', 'of', 'an', 'equilibrium', 'firstorder', 'transition', 'from', 'the', 'homogeneous', 'network', 'to', 'a', 'heterogeneous', 'phase', 'where', 'stress', 'is', 'localised', 'within', 'pleats', 'and', 'eliminated', 'elsewhere', 'we', 'show', 'that', 'in', 'the', 'thermodynamic', 'limit', 'the', 'unpleated', 'state', 'is', 'always', 'metastable', 'at', 'vanishing', 'field', 'for', 'infinitesimal', 'strain', 'plastic', 'deformation', 'of', 'the', 'initially', 'homogeneous', 'network', 'is', 'akin', 'to', 'the', 'decay', 'of', 'a', 'metastable', 'phase', 'via', 'a', 'dynamical', 'transition', 'we', 'make', 'predictions', 'concerning', 'local', 'stress', 'distributions', 'and', 'thermal', 'effects', 'associated', 'with', 'pleats', 'which', 'may', 'be', 'observable', 'in', 'suitable', 'experimental', 'systems']]
|
[-0.15446097341859166, 0.2400856173777035, -0.08526609332081588, 0.016626042106776474, -0.040333175785182154, -0.1060170628986431, 0.02196127693853615, 0.3940223930951427, -0.32164565987118027, -0.21811140450470917, 0.07970374462345396, -0.24047045019893523, -0.16034439998843214, 0.10748461658025489, -0.015812400512753382, -0.01911951989921577, 0.025156005888300782, 0.04514996449545245, -0.06349326116991613, -0.19053430610528105, 0.3103409514461151, 0.023136632169103798, 0.2999803263995358, 0.00517425130614463, 0.05717961906236323, -0.004466613106813062, 0.06015573274755084, 0.1238301746930708, -0.14525524094676845, 0.035007488814538676, 0.22657672137241153, 0.002069856144268723, 0.2131665703155758, -0.4742874897249481, -0.1988792583642541, 0.12926324524861924, 0.13778066648827755, 0.14319874310715344, 0.010004844713052187, -0.27817515340798044, 0.06244450352319023, -0.12573402727858218, -0.15821216193383889, -0.08751108985229888, 0.006133334894034574, 0.010684559902395396, -0.2683625726714073, 0.10948920726830906, 0.052329358957564076, 0.04763828915105585, -0.08533128277836916, -0.05773538202252787, -0.11035021029905799, 0.09409649110046517, 0.0103073669171221, 0.06784175464006907, 0.18236335955341074, -0.12417665237945211, -0.07872959203394951, 0.35973214694052275, -0.04940978572224541, -0.1584500486839234, 0.1771781834308058, -0.1374315710108289, -0.10245063403100871, 0.19521721082684748, 0.1648323289646, 0.08330682420620339, -0.1290412815689171, 0.04954961152534987, 0.010840760708293495, 0.1464692393735544, 0.07192051668843145, -0.00038088013089316734, 0.22478814216001947, 0.14942473421448513, 0.08225410884684499, 0.17496335809803842, -0.06273765067795894, -0.11810078818405814, -0.3189844073837294, -0.1395745963542996, -0.18502125892144464, 0.08637633151109399, -0.10943961274024332, -0.2483408402213279, 0.3442956354715587, 0.10053924055982326, 0.22506623863129574, 0.03607542742084821, 0.2170582729172619, 0.084040055729394, 0.07119770194677745, 0.055953836504041274, 0.2567553655696375, 0.1379441438749542, 0.05674213626805474, -0.20166592671508518, 0.05293866925023715, 0.050102606982759694]
|
1,803.05242
|
Ground-state properties of a dilute two-dimensional Bose gas
|
We revisit the problem of the calculation of low-temperature properties for
the dilute two-dimensional Bose gas. By using Popov's hydrodynamic approach and
perturbation theory on the one-loop level we recover not only the known
expansion for the ground-state energy but also calculate for the first time the
condensate density and Tan's contact.
|
cond-mat.quant-gas
|
we revisit the problem of the calculation of lowtemperature properties for the dilute twodimensional bose gas by using popovs hydrodynamic approach and perturbation theory on the oneloop level we recover not only the known expansion for the groundstate energy but also calculate for the first time the condensate density and tans contact
|
[['we', 'revisit', 'the', 'problem', 'of', 'the', 'calculation', 'of', 'lowtemperature', 'properties', 'for', 'the', 'dilute', 'twodimensional', 'bose', 'gas', 'by', 'using', 'popovs', 'hydrodynamic', 'approach', 'and', 'perturbation', 'theory', 'on', 'the', 'oneloop', 'level', 'we', 'recover', 'not', 'only', 'the', 'known', 'expansion', 'for', 'the', 'groundstate', 'energy', 'but', 'also', 'calculate', 'for', 'the', 'first', 'time', 'the', 'condensate', 'density', 'and', 'tans', 'contact']]
|
[-0.09558803188422015, 0.11901694300244205, -0.09969934839934397, 0.08204869057338399, 0.041484923334792256, -0.07249960066893926, 0.06341860225522676, 0.2905826907282552, -0.21625919765434587, -0.24377763786021836, 0.051353206956544176, -0.27562525123357773, -0.10780066939276786, 0.14094857298410857, 0.09107679621173212, 0.06902845434916134, 0.00041673040518967004, 0.04823975143237756, -0.13129767395842534, -0.24194236140913114, 0.3656663046702026, 0.06396352754046138, 0.2359740338109147, 0.14486833908953345, 0.08362601041041601, 0.05588938187037666, 0.017595530783112805, 0.01416174598181477, -0.24020906205092055, 0.05459438441455579, 0.17223808915766242, -0.03283573872445581, 0.16274107849368682, -0.4500173536630777, -0.23578628048282832, 0.04893494075244794, 0.15212420954440647, 0.19237666473222467, -0.020336172787490517, -0.2555846000591723, 0.003678203130570742, -0.21322464788905704, -0.19405684685513663, -0.17259161181461352, -0.026899702658948418, 0.0031056318055981626, -0.19430901939407563, 0.1732775641984727, 0.02201922295185236, 0.00337695713656453, -0.10606903046853124, -0.07105705442014508, 0.01478708125740433, 0.10484663856466515, 0.0028177343640261544, 0.013262094726647215, 0.13778911797831264, -0.19862083757582766, -0.02675032058659081, 0.42338505485811484, -0.13105385268751818, -0.13669975968794182, 0.16584255854384258, -0.18969270201901403, -0.1335298705022209, 0.14175270218849897, 0.11366901668057275, 0.12545645222640955, -0.16658400495250064, 0.13972970903985418, -0.060627275121917665, 0.14876606644919285, 0.06479679954309876, -0.014317730441689491, 0.19692980994183856, 0.13264703405394146, 0.007252878419911632, 0.1319082479637403, -0.10192003839452249, -0.1288933041595066, -0.30280129475375783, -0.16565793118654534, -0.24873568094335496, 0.037250451300608875, -0.05660372758407343, -0.20683083676088315, 0.368457617256074, 0.15851399675011635, 0.17712716507510498, 0.10320553516682524, 0.33502708189189434, 0.18423916976182506, 0.0009839702128934173, 0.0626570354663552, 0.2562166393573324, 0.1804321727473647, 0.06580603718220328, -0.31882709314007884, -0.01115853505101628, 0.17734007450053468]
|
1,803.05243
|
Robust multipartite entanglement generation via a collision model
|
We examine a simple scheme to generate genuine multipartite entangled states
across disjoint qubit registers. We employ a shuttle qubit that is sequentially
coupled, in an energy preserving manner, to the constituents within each
register through rounds of interactions. We establish that stable $W$-type
entanglement can be generated among all qubits within the registers.
Furthermore, we find that the entanglement is sensitive to how the shuttle is
treated, showing that a significantly larger degree is achieved by performing
projective measurements on it. Finally, we assess the resilience of this
entanglement generation protocol to several types of noise and imperfections,
showing that it is remarkably robust.
|
quant-ph
|
we examine a simple scheme to generate genuine multipartite entangled states across disjoint qubit registers we employ a shuttle qubit that is sequentially coupled in an energy preserving manner to the constituents within each register through rounds of interactions we establish that stable wtype entanglement can be generated among all qubits within the registers furthermore we find that the entanglement is sensitive to how the shuttle is treated showing that a significantly larger degree is achieved by performing projective measurements on it finally we assess the resilience of this entanglement generation protocol to several types of noise and imperfections showing that it is remarkably robust
|
[['we', 'examine', 'a', 'simple', 'scheme', 'to', 'generate', 'genuine', 'multipartite', 'entangled', 'states', 'across', 'disjoint', 'qubit', 'registers', 'we', 'employ', 'a', 'shuttle', 'qubit', 'that', 'is', 'sequentially', 'coupled', 'in', 'an', 'energy', 'preserving', 'manner', 'to', 'the', 'constituents', 'within', 'each', 'register', 'through', 'rounds', 'of', 'interactions', 'we', 'establish', 'that', 'stable', 'wtype', 'entanglement', 'can', 'be', 'generated', 'among', 'all', 'qubits', 'within', 'the', 'registers', 'furthermore', 'we', 'find', 'that', 'the', 'entanglement', 'is', 'sensitive', 'to', 'how', 'the', 'shuttle', 'is', 'treated', 'showing', 'that', 'a', 'significantly', 'larger', 'degree', 'is', 'achieved', 'by', 'performing', 'projective', 'measurements', 'on', 'it', 'finally', 'we', 'assess', 'the', 'resilience', 'of', 'this', 'entanglement', 'generation', 'protocol', 'to', 'several', 'types', 'of', 'noise', 'and', 'imperfections', 'showing', 'that', 'it', 'is', 'remarkably', 'robust']]
|
[-0.1765022101324229, 0.2087869638988715, -0.051147442633130896, 0.038858901013043665, 0.042233505494715204, -0.22757085581709233, 0.08072611527916576, 0.4208772714028046, -0.2556638108477706, -0.27610088343776407, 0.03264312458424164, -0.2637395185684519, -0.11600966594137606, 0.20337270116876988, -0.0841634725065281, 0.006722691136279276, 0.09649869440833019, 0.026871931588365917, -0.027893435751043614, -0.2914976186695553, 0.29935630643740296, 0.027616339691338084, 0.2874024636688687, 0.029373010256815525, 0.127466971604597, 0.0029108464318726743, 0.037908197720701406, 0.037526085460558536, -0.08022648530209803, 0.08683074494945772, 0.2794570599527409, 0.15694112787023187, 0.23370822020584628, -0.4300457202652026, -0.17406007319334008, 0.14110472205405433, 0.11269568575191356, 0.20234968855622268, -0.008940098608755285, -0.3012505775051458, 0.06604213227650949, -0.18228599053400102, -0.08233457652053662, -0.1607399206564185, 0.005833729471833933, -0.042138971180455495, -0.2640763795402433, 0.06152397786222753, 0.046905697467515155, -0.005636291653527656, 0.027703646934103397, 0.03372881104060937, -0.04040426043571815, 0.1463425614449772, -0.08143175200426153, -0.002407470018425513, 0.15727966041913966, -0.05271842219988771, -0.14983768216999513, 0.3168400559574366, -0.04588417461685215, -0.2077021822155941, 0.191234962908285, -0.09295946130919869, -0.11652225479483605, 0.046426709927618506, 0.1290559930549491, 0.10409122143118155, -0.13550804645887443, -0.0036675511332716617, -0.055683535754325844, 0.26846632181578095, 0.05845436913715232, 0.12291476122946257, 0.15097886898687907, 0.12632981528128898, 0.1299890096787186, 0.23548228178572442, -0.05253231339821858, -0.1285550745647578, -0.2879703475428479, -0.16796232334205083, -0.22143112901442993, 0.06501206899327891, -0.06252775739066281, -0.08963398244453682, 0.44303155027761626, 0.18282919893861704, 0.16498201262383233, 0.016445934313205294, 0.33509019024315334, 0.07196707159524694, 0.10004667494712131, 0.1060893787337201, 0.2506532571145466, 0.11436412435778905, -0.005545600973779247, -0.25456959854234895, 0.06177721214702442, -0.001770157322642349]
|
1,803.05244
|
Stochastic Dynamic Utilities and Inter-Temporal Preferences
|
We propose an axiomatic approach which economically underpins the
representation of dynamic preferences in terms of a stochastic utility
function, sensitive to the information available to the decision maker. Our
construction is iterative and based on inter-temporal preference relations,
whose characterization is inpired by the original intuition given by Debreu's
State Dependent Utilities (1960).
|
math.PR q-fin.EC
|
we propose an axiomatic approach which economically underpins the representation of dynamic preferences in terms of a stochastic utility function sensitive to the information available to the decision maker our construction is iterative and based on intertemporal preference relations whose characterization is inpired by the original intuition given by debreus state dependent utilities 1960
|
[['we', 'propose', 'an', 'axiomatic', 'approach', 'which', 'economically', 'underpins', 'the', 'representation', 'of', 'dynamic', 'preferences', 'in', 'terms', 'of', 'a', 'stochastic', 'utility', 'function', 'sensitive', 'to', 'the', 'information', 'available', 'to', 'the', 'decision', 'maker', 'our', 'construction', 'is', 'iterative', 'and', 'based', 'on', 'intertemporal', 'preference', 'relations', 'whose', 'characterization', 'is', 'inpired', 'by', 'the', 'original', 'intuition', 'given', 'by', 'debreus', 'state', 'dependent', 'utilities', '1960']]
|
[-0.056138481637287255, 0.04200137239020924, -0.13861532474402338, 0.08781093240820996, -0.18862140189223695, -0.11897070026728061, 0.11214896945836339, 0.37492960740653974, -0.3031518210498792, -0.3034481825526663, 0.10260639883323028, -0.2570158055860479, -0.19602967327776946, 0.13088793961225814, -0.12840451365161054, 0.032383008227455164, 0.015919309671757358, 0.06653927649670052, -0.026483446425529866, -0.27224521001554886, 0.33055215082922074, 0.09256686080787506, 0.3344778810926485, 0.03462606322301446, 0.16973878654106608, 0.13021287159502226, -0.05931465559691753, 0.020559479921775044, -0.15042579693078362, 0.20656984067469272, 0.3104147260112442, 0.22456323751687723, 0.3564383456975503, -0.3802463482221905, -0.12975712818530705, 0.042814317361434116, 0.04120247983230928, 0.03569600895214123, 0.012807409514075602, -0.28925243726457067, 0.010799547534365699, -0.18165431516069286, -0.07618679445377498, -0.10250850050613496, -0.0013457504013236964, 0.0188144293068996, -0.3263056166821493, 0.018959010880932492, 0.0590132236489499, 0.029199853521894734, -0.08826033620796395, -0.10811528541534296, -0.008802972206810736, 0.08974476137422552, 0.005095650380442165, 0.009595159140310058, 0.14326260799436635, -0.124314100938445, -0.19018867172142667, 0.37468545509607726, -0.02287779127704507, -0.22633865001207254, 0.13225995438263471, -0.050300011512348954, -0.10340232992509626, 0.12011754758796601, 0.13559516464834506, 0.12833069264888763, -0.21754711678357058, 0.05012219515079984, -0.07516248763169882, 0.16942250148727084, 0.015482984799540267, 0.046954157208707534, 0.18306209649539218, 0.1876747816974596, 0.10203416021716483, 0.14234279401881514, 0.06062156481685925, -0.16213928282542048, -0.2649464592829628, -0.10248101156980309, -0.1835881438598318, 0.02515896506396667, -0.13279142974901129, -0.17328497809621524, 0.35981971622919134, 0.1878849262336515, 0.13163471830797926, 0.10891562422851699, 0.3177534081041813, 0.16511036734369075, 0.01853199353560208, 0.05834907252025211, 0.15269878841079948, 0.05212684732615807, 0.0995034071845266, -0.18211914530190867, 0.21862945975823644, 0.0834649726397024]
|
1,803.05245
|
Device independent witness of arbitrary dimensional quantum systems
employing binary outcome measurements
|
Device independent dimension witnesses (DW) are a remarkable way to test the
dimension of a quantum system in a prepare-and-measure scenario imposing
minimal assumptions on the internal features of the devices. However, as the
dimension increases, the major obstacle in the realization of DW arises due to
the requirement of many outcome quantum measurements. In this article, we
propose a new variant of a widely studied communication task (random access
code) and take its average payoff as the DW. The presented DW applies to
arbitrarily large quantum systems employing only binary outcome measurements.
|
quant-ph
|
device independent dimension witnesses dw are a remarkable way to test the dimension of a quantum system in a prepareandmeasure scenario imposing minimal assumptions on the internal features of the devices however as the dimension increases the major obstacle in the realization of dw arises due to the requirement of many outcome quantum measurements in this article we propose a new variant of a widely studied communication task random access code and take its average payoff as the dw the presented dw applies to arbitrarily large quantum systems employing only binary outcome measurements
|
[['device', 'independent', 'dimension', 'witnesses', 'dw', 'are', 'a', 'remarkable', 'way', 'to', 'test', 'the', 'dimension', 'of', 'a', 'quantum', 'system', 'in', 'a', 'prepareandmeasure', 'scenario', 'imposing', 'minimal', 'assumptions', 'on', 'the', 'internal', 'features', 'of', 'the', 'devices', 'however', 'as', 'the', 'dimension', 'increases', 'the', 'major', 'obstacle', 'in', 'the', 'realization', 'of', 'dw', 'arises', 'due', 'to', 'the', 'requirement', 'of', 'many', 'outcome', 'quantum', 'measurements', 'in', 'this', 'article', 'we', 'propose', 'a', 'new', 'variant', 'of', 'a', 'widely', 'studied', 'communication', 'task', 'random', 'access', 'code', 'and', 'take', 'its', 'average', 'payoff', 'as', 'the', 'dw', 'the', 'presented', 'dw', 'applies', 'to', 'arbitrarily', 'large', 'quantum', 'systems', 'employing', 'only', 'binary', 'outcome', 'measurements']]
|
[-0.19473903427921957, 0.10109719709162751, -0.07063573079874678, 0.023148825606181016, -0.06837221968578555, -0.20201428794372145, 0.07912094660493876, 0.3293309415870857, -0.268053895603585, -0.2883618949281593, 0.0940524061843853, -0.2177637524787657, -0.12820732418287506, 0.2073272839789429, -0.09968629445923212, 0.1066457692587558, 0.08064592146234567, 0.047906578766302235, -0.024365769689201667, -0.24977762759500433, 0.30358294101171596, 0.023118876292550515, 0.3068520370795722, 0.03181229069107963, 0.13072325049408823, 0.039708428927296674, 0.0032717563269499647, 0.01124842549043317, -0.11424677290638248, 0.11212848140908185, 0.24062103381560696, 0.10497509985616098, 0.2682502286568765, -0.40820326431784576, -0.221850216030694, 0.09683551254772371, 0.12278668306547627, 0.17552651983675777, -0.03882899292699632, -0.2778077906520877, 0.07453965117794371, -0.19179845326930606, -0.1449622063250068, -0.03795536056721723, 0.020356754481952677, -0.03756325960945418, -0.2523791151201373, 0.03681060181610206, 0.08307678144304984, 0.05481289814023541, -0.0010268705734615064, -0.05509918191224857, 0.025084661162127892, 0.10204619254481288, 0.007253065004303891, 0.042850888729776423, 0.15709725032079844, -0.16685905631866946, -0.19516084816867627, 0.41787042262993995, -0.02453860262739322, -0.2050087556433213, 0.2123527452111825, -0.11432124737034281, -0.11041813780039159, 0.037571910293071824, 0.2009732144013528, 0.10143368356230278, -0.13605703209196368, 0.10895657537302243, -0.028150250314063922, 0.17698953717306096, 0.05568458286980267, 0.10829694829981333, 0.16300873656667048, 0.16570376787054283, 0.0854504997159795, 0.1453716362055431, -0.07205625239168845, -0.1359088184682512, -0.2907453629398538, -0.18385636560138194, -0.2414969749703643, 0.06990273814568276, -0.09756514747606425, -0.14460954480674318, 0.37055210566889213, 0.16382175341989563, 0.1819294465465411, -0.0042111990417564105, 0.30544908933581844, 0.10940078165261977, 0.09513268852105705, 0.04753933917988913, 0.20930046851556466, 0.13985639001162703, 0.10544378871739071, -0.21031921244757149, 0.12078063634990324, 0.004211794797791749]
|
1,803.05246
|
On the connectivity threshold for colorings of random graphs and
hypergraphs
|
Let $\Omega_q=\Omega_q(H)$ denote the set of proper $[q]$-colorings of the
hypergraph $H$. Let $\Gamma_q$ be the graph with vertex set $\Omega_q$ and an
edge ${\sigma,\tau\}$ where $\sigma,\tau$ are colorings iff $h(\sigma,\tau)=1$.
Here $h(\sigma,\tau)$ is the Hamming distance $|\{v\in
V(H):\sigma(v)\neq\tau(v)\}|$. We show that if $H=H_{n,m;k},\,k\geq 2$, the
random $k$-uniform hypergraph with $V=[n]$ and $m=dn/k$ then w.h.p. $\Gamma_q$
is connected if $d$ is sufficiently large and $q\gtrsim (d/\log d)^{1/(k-1)}$.
|
math.CO cs.DM math.PR
|
let omega_qomega_qh denote the set of proper qcolorings of the hypergraph h let gamma_q be the graph with vertex set omega_q and an edge sigmatau where sigmatau are colorings iff hsigmatau1 here hsigmatau is the hamming distance vin vhsigmavneqtauv we show that if hh_nmkkgeq 2 the random kuniform hypergraph with vn and mdnk then whp gamma_q is connected if d is sufficiently large and qgtrsim dlog d1k1
|
[['let', 'omega_qomega_qh', 'denote', 'the', 'set', 'of', 'proper', 'qcolorings', 'of', 'the', 'hypergraph', 'h', 'let', 'gamma_q', 'be', 'the', 'graph', 'with', 'vertex', 'set', 'omega_q', 'and', 'an', 'edge', 'sigmatau', 'where', 'sigmatau', 'are', 'colorings', 'iff', 'hsigmatau1', 'here', 'hsigmatau', 'is', 'the', 'hamming', 'distance', 'vin', 'vhsigmavneqtauv', 'we', 'show', 'that', 'if', 'hh_nmkkgeq', '2', 'the', 'random', 'kuniform', 'hypergraph', 'with', 'vn', 'and', 'mdnk', 'then', 'whp', 'gamma_q', 'is', 'connected', 'if', 'd', 'is', 'sufficiently', 'large', 'and', 'qgtrsim', 'dlog', 'd1k1']]
|
[-0.19528214155385892, 0.22319452689092334, -0.030191647556299963, -0.07659843242145144, -0.08580819825486591, -0.2458056007201473, 0.014930784640212854, 0.3793543972695867, -0.32051707851933314, -0.23910371613067885, 0.037866163463331756, -0.39344731296102203, -0.07603684353331724, 0.031609254966800414, -0.10883194426617895, -0.031437491866139075, 0.13457762305624782, 0.15835516101991137, 0.0861243373908413, -0.2456599723804781, 0.29511799666409694, -0.1246787305145214, 0.09864899601507204, 0.11889470798390296, 0.0703409834144016, 0.04324381931607301, 0.05090209547003421, 0.1251091377926059, -0.22473592649973095, 0.02497001251516243, 0.22901453773956745, 0.20096485177055, 0.27354615411410726, -0.3475706383275489, -0.08002267342138415, 0.3289986617707958, 0.15029851445772996, -0.07911509809394678, 0.09405722458225986, -0.22196323572813223, 0.25129333112078406, -0.11476522538190087, -0.06205390550506611, 0.01244496438691082, 0.2477589502930641, 0.027734553790651262, -0.4031280539308985, -0.043076695474640776, 0.06443975009024143, 0.01062072672842381, 0.10753813383635133, -0.20104796884891887, -0.14609408531493198, 0.024872341748171798, -0.14802348433295265, 0.21168687782871226, -0.006874938072481503, -0.05332488358641664, -0.13383399239586044, 0.3978322978674745, -0.0516677633083115, -0.15890533765777945, 0.02825479134141157, -0.20494023367452124, -0.12512137528974562, 0.05467971948285898, 0.0680523347419997, 0.14010913393673644, -0.023755060974508524, 0.24095693492272402, -0.13934977167906862, 0.12875338004281123, 0.12101904777033876, 0.066725695047838, 0.08500668577228983, 0.09549959486660858, 0.17470672843046486, 0.12100054165154385, -0.028547889490922292, 0.11997761300299317, -0.35159367726494867, -0.06964050796814263, -0.2841208610062798, 0.13883620999598253, -0.2526205985721996, -0.18074744121792416, 0.3499345111039778, 0.0518889724892991, 0.20081928844398741, 0.16881318691497046, 0.1868966303765774, 0.09573351343133255, -0.01725683013210073, 0.2740300652648633, 0.017587206155682603, 0.2147128304466605, -0.16420970251783729, -0.1542317703211059, 0.054943197356381764, 0.15280116772240337]
|
1,803.05247
|
Identifiability of Undirected Dynamical Networks: a Graph-Theoretic
Approach
|
This paper deals with identifiability of undirected dynamical networks with
single-integrator node dynamics. We assume that the graph structure of such
networks is known, and aim to find graph-theoretic conditions under which the
state matrix of the network can be uniquely identified. As our main
contribution, we present a graph coloring condition that ensures
identifiability of the network's state matrix. Additionally, we show how the
framework can be used to assess identifiability of dynamical networks with
general, higher-order node dynamics. As an interesting corollary of our
results, we find that excitation and measurement of all network nodes is not
required. In fact, for many network structures, identification is possible with
only small fractions of measured and excited nodes.
|
math.OC math.DS
|
this paper deals with identifiability of undirected dynamical networks with singleintegrator node dynamics we assume that the graph structure of such networks is known and aim to find graphtheoretic conditions under which the state matrix of the network can be uniquely identified as our main contribution we present a graph coloring condition that ensures identifiability of the networks state matrix additionally we show how the framework can be used to assess identifiability of dynamical networks with general higherorder node dynamics as an interesting corollary of our results we find that excitation and measurement of all network nodes is not required in fact for many network structures identification is possible with only small fractions of measured and excited nodes
|
[['this', 'paper', 'deals', 'with', 'identifiability', 'of', 'undirected', 'dynamical', 'networks', 'with', 'singleintegrator', 'node', 'dynamics', 'we', 'assume', 'that', 'the', 'graph', 'structure', 'of', 'such', 'networks', 'is', 'known', 'and', 'aim', 'to', 'find', 'graphtheoretic', 'conditions', 'under', 'which', 'the', 'state', 'matrix', 'of', 'the', 'network', 'can', 'be', 'uniquely', 'identified', 'as', 'our', 'main', 'contribution', 'we', 'present', 'a', 'graph', 'coloring', 'condition', 'that', 'ensures', 'identifiability', 'of', 'the', 'networks', 'state', 'matrix', 'additionally', 'we', 'show', 'how', 'the', 'framework', 'can', 'be', 'used', 'to', 'assess', 'identifiability', 'of', 'dynamical', 'networks', 'with', 'general', 'higherorder', 'node', 'dynamics', 'as', 'an', 'interesting', 'corollary', 'of', 'our', 'results', 'we', 'find', 'that', 'excitation', 'and', 'measurement', 'of', 'all', 'network', 'nodes', 'is', 'not', 'required', 'in', 'fact', 'for', 'many', 'network', 'structures', 'identification', 'is', 'possible', 'with', 'only', 'small', 'fractions', 'of', 'measured', 'and', 'excited', 'nodes']]
|
[-0.16252089377050682, 0.06321522598344757, -0.05024299361758818, 0.035022216961498105, -0.06940063295325548, -0.13799820256900927, 0.0314806593706342, 0.40250843810706827, -0.3032247802337347, -0.3054427092074085, 0.09541326425614435, -0.22655405467218262, -0.24388389021031937, 0.09576416876703753, -0.06975105915108096, 0.07234553435533228, 0.13507224861098358, 0.08538082386840577, 0.012752792875428479, -0.2293267864738867, 0.3647292094873422, 0.0335043414211753, 0.24242110645903622, 0.07734547386299108, 0.08731324739470067, -0.008407161010713395, 0.012348106233560937, 0.059308876259789124, -0.11665666206650804, 0.07829842549527727, 0.28334791767332007, 0.17838838578091334, 0.23556483089252991, -0.425923592947676, -0.2330481642620417, 0.17131994391290345, 0.1361256032033776, 0.12962574089045628, 0.010410985538451854, -0.2772884647109372, 0.13135318397307547, -0.16746563948217338, -0.10151464398161082, -0.11060935524450141, -0.021709206679804346, 0.028335510689954636, -0.29081017910197016, 0.04929670304754528, 0.06084901287557826, 0.00883523793101816, -0.027286437355865865, -0.11087162577116988, -0.05581543483313615, 0.15379410319551193, -0.0034299882077533056, 3.284291301112054e-05, 0.1052866730152361, -0.11357099244221097, -0.13104388333257225, 0.37828433463128947, -0.031447939841092516, -0.19662026271729147, 0.18233813406205027, -0.09266291730800423, -0.21390101363412814, 0.0806023148677738, 0.18621973736779923, 0.10005934215229699, -0.17528670055099163, 0.005756708622172127, -0.08211160520628347, 0.18475423795881413, 0.007568663100601505, 0.06271458186171712, 0.12023831829744375, 0.20364709578403192, 0.1115012805335721, 0.159801005964933, -0.0510980556521691, -0.06591516937241669, -0.2899365969489613, -0.10678683323351572, -0.21699910490256655, 0.050525947927888996, -0.10461331467044055, -0.15493500649423922, 0.43891767142498395, 0.1691245469264686, 0.20934718590766443, 0.10854264281362579, 0.2589408346783307, 0.07620781486196901, 0.04218000593058512, 0.12077567639950094, 0.21255952813189036, 0.17161755165937592, 0.043079174332857385, -0.17431249849150998, 0.13768759418784057, 0.027398829328653923]
|
1,803.05248
|
Generalized Taylor operators and Hermite subdivision schemes
|
Hermite subdivision schemes act on vector valued data that is not only
considered as functions values in $\mathbb{R}^r$, but as consecutive
derivatives, which leads to a mild form of level dependence of the scheme.
Previously, we have proved that a property called spectral condition or sum
rule implies a factorization in terms of a generalized difference operator that
gives rise to a "difference scheme" whose contractivity governs the convergence
of the scheme. But many convergent Hermite schemes, for example, those based on
cardinal splines, do not satisfy the spectral condition. In this paper, we
generalize the property in a way that preserves all the above advantages: the
associated factorizations and convergence theory. Based on these results, we
can include the case of cardinal splines and also enables us to construct new
types of convergent Hermite subdivision schemes.
|
math.NA
|
hermite subdivision schemes act on vector valued data that is not only considered as functions values in mathbbrr but as consecutive derivatives which leads to a mild form of level dependence of the scheme previously we have proved that a property called spectral condition or sum rule implies a factorization in terms of a generalized difference operator that gives rise to a difference scheme whose contractivity governs the convergence of the scheme but many convergent hermite schemes for example those based on cardinal splines do not satisfy the spectral condition in this paper we generalize the property in a way that preserves all the above advantages the associated factorizations and convergence theory based on these results we can include the case of cardinal splines and also enables us to construct new types of convergent hermite subdivision schemes
|
[['hermite', 'subdivision', 'schemes', 'act', 'on', 'vector', 'valued', 'data', 'that', 'is', 'not', 'only', 'considered', 'as', 'functions', 'values', 'in', 'mathbbrr', 'but', 'as', 'consecutive', 'derivatives', 'which', 'leads', 'to', 'a', 'mild', 'form', 'of', 'level', 'dependence', 'of', 'the', 'scheme', 'previously', 'we', 'have', 'proved', 'that', 'a', 'property', 'called', 'spectral', 'condition', 'or', 'sum', 'rule', 'implies', 'a', 'factorization', 'in', 'terms', 'of', 'a', 'generalized', 'difference', 'operator', 'that', 'gives', 'rise', 'to', 'a', 'difference', 'scheme', 'whose', 'contractivity', 'governs', 'the', 'convergence', 'of', 'the', 'scheme', 'but', 'many', 'convergent', 'hermite', 'schemes', 'for', 'example', 'those', 'based', 'on', 'cardinal', 'splines', 'do', 'not', 'satisfy', 'the', 'spectral', 'condition', 'in', 'this', 'paper', 'we', 'generalize', 'the', 'property', 'in', 'a', 'way', 'that', 'preserves', 'all', 'the', 'above', 'advantages', 'the', 'associated', 'factorizations', 'and', 'convergence', 'theory', 'based', 'on', 'these', 'results', 'we', 'can', 'include', 'the', 'case', 'of', 'cardinal', 'splines', 'and', 'also', 'enables', 'us', 'to', 'construct', 'new', 'types', 'of', 'convergent', 'hermite', 'subdivision', 'schemes']]
|
[-0.1291359000275061, 0.05478374828944785, -0.14694176690081936, 0.0837731870965366, -0.12163358547446067, -0.13197698729642987, 0.04108609317718617, 0.3831791401480454, -0.276936088029268, -0.2019804464449195, 0.10422856167271516, -0.21947927985775428, -0.17640872687325698, 0.21315574518788988, -0.1015415166514878, 0.029275792792892375, 0.0460827127965779, 0.02776909481910785, -0.10287133653913319, -0.26929479754482305, 0.36622016541455893, -0.016984159124328543, 0.2846312715882694, 0.060248006198106566, 0.14968811940949028, -0.03322951534820762, -0.03865169401001865, 0.021386967625224244, -0.1310154114364235, 0.10415252268375544, 0.211016769350989, 0.11229264027486643, 0.2843197797829571, -0.372578477221847, -0.16339515634798818, 0.16753521112701344, 0.15268308906578018, 0.0313712355747044, -0.014651330279689418, -0.18699278608202444, 0.11916317266282918, -0.16832613401849122, -0.15204523114171423, -0.16098207279013294, -0.04829572920388386, 0.08515019782132259, -0.349978539457096, 0.05959155250924476, 0.13014884541205463, 0.034171419602268154, -0.03328054382153073, -0.12257016051465469, 8.542977450211553e-05, 0.05164776655954112, 0.009511339021030895, -0.003186484457828091, 0.0266690612498698, -0.05757556343451142, -0.12745913135288894, 0.3783106676432012, -0.06916152448716309, -0.28027254495987275, 0.15529343500447862, -0.14118900507634138, -0.1694430295568313, 0.12407226070598529, 0.11985767434561884, 0.14074395755373867, -0.0805728513115242, 0.10395895665168191, -0.07444394842116502, 0.12976829978181934, 0.12341372601421938, 0.10976098077487495, 0.07594646470634824, 0.05075605437975295, 0.13938950594254587, 0.10095237993064207, -0.009826146255257491, -0.12289709216459607, -0.3343721031462842, -0.14880622257172627, -0.1609822619106471, 0.028034090985804047, -0.0984971701015844, -0.22862419785836535, 0.38330680620965457, 0.12234527036805984, 0.18801962965283625, 0.10305516353900115, 0.25468534237134144, 0.15706879022041756, 0.09876794733759696, 0.050947426954270715, 0.15227377866428807, 0.16153498755319276, 0.045695441751231025, -0.15105961035787516, 0.07920014599253625, 0.1998317452439916]
|
1,803.05249
|
The skeleton of the UIPT, seen from infinity
|
We prove that geodesic rays in the Uniform Infinite Planar Triangulation
(UIPT) coalesce in a strong sense using the skeleton decomposition of random
triangulations discovered by Krikun. This implies the existence of a unique
horofunction measuring distances from infinity in the UIPT. We then use this
horofunction to define the skeleton "seen from infinity" of the UIPT and relate
it to a simple Galton--Watson tree conditioned to survive, giving a new and
particularly simple construction of the UIPT. Scaling limits of perimeters and
volumes of horohulls within this new decomposition are also derived, as well as
a new proof of the $2$-point function formula for random triangulations in the
scaling limit due to Ambj{\o}rn and Watabiki.
|
math.PR math-ph math.CO math.MP
|
we prove that geodesic rays in the uniform infinite planar triangulation uipt coalesce in a strong sense using the skeleton decomposition of random triangulations discovered by krikun this implies the existence of a unique horofunction measuring distances from infinity in the uipt we then use this horofunction to define the skeleton seen from infinity of the uipt and relate it to a simple galtonwatson tree conditioned to survive giving a new and particularly simple construction of the uipt scaling limits of perimeters and volumes of horohulls within this new decomposition are also derived as well as a new proof of the 2point function formula for random triangulations in the scaling limit due to ambjorn and watabiki
|
[['we', 'prove', 'that', 'geodesic', 'rays', 'in', 'the', 'uniform', 'infinite', 'planar', 'triangulation', 'uipt', 'coalesce', 'in', 'a', 'strong', 'sense', 'using', 'the', 'skeleton', 'decomposition', 'of', 'random', 'triangulations', 'discovered', 'by', 'krikun', 'this', 'implies', 'the', 'existence', 'of', 'a', 'unique', 'horofunction', 'measuring', 'distances', 'from', 'infinity', 'in', 'the', 'uipt', 'we', 'then', 'use', 'this', 'horofunction', 'to', 'define', 'the', 'skeleton', 'seen', 'from', 'infinity', 'of', 'the', 'uipt', 'and', 'relate', 'it', 'to', 'a', 'simple', 'galtonwatson', 'tree', 'conditioned', 'to', 'survive', 'giving', 'a', 'new', 'and', 'particularly', 'simple', 'construction', 'of', 'the', 'uipt', 'scaling', 'limits', 'of', 'perimeters', 'and', 'volumes', 'of', 'horohulls', 'within', 'this', 'new', 'decomposition', 'are', 'also', 'derived', 'as', 'well', 'as', 'a', 'new', 'proof', 'of', 'the', '2point', 'function', 'formula', 'for', 'random', 'triangulations', 'in', 'the', 'scaling', 'limit', 'due', 'to', 'ambjorn', 'and', 'watabiki']]
|
[-0.09345821521811835, 0.13276453011304787, -0.14612567343789598, 0.09162498562819446, -0.08537391876072987, -0.07751792450232999, 0.07768245405800965, 0.3061594080665837, -0.3066229972016552, -0.21537003331898671, 0.11056880837903642, -0.25907068223813956, -0.1657069655742658, 0.17567517776852068, -0.10064081260327087, 0.04367096218199509, 0.06293061834800502, 0.020912693459135684, -0.04224470064003506, -0.20418630321105213, 0.30536438253424736, 0.008734970410232959, 0.23773669953579488, 0.061332440781204596, 0.1546789092345811, 0.04433405293232721, -0.03029451464181361, 0.07750416372943184, -0.19120162806262353, 0.10601284616910245, 0.17680648665510765, 0.11073186074221587, 0.18333458337608888, -0.38225846001473457, -0.15558039319838154, 0.13791397297957345, 0.1861924855240985, 0.09380564329254887, -0.001276319548892586, -0.27326037239121354, 0.09549613382221887, -0.1047512821240715, -0.22504141821080575, -0.03949771248128103, 0.03530086460320846, 0.029287222606818313, -0.21886747431657885, 0.03427925626519541, 0.12784671539784936, 0.03489742840275816, -0.0005955448333659898, -0.08775005459623492, -0.03132307785563171, 0.14579574947204926, 0.023650246826202974, 0.06479882544473461, 0.06603821167044098, -0.08570906763855854, -0.11931252686570035, 0.36271275021945654, -0.07117482707785118, -0.21303344570991137, 0.20068681412376463, -0.1881458152692927, -0.181137006867515, 0.1198600809170824, 0.15906188922083897, 0.1386502343715857, -0.14655044630331837, 0.1349481800550838, -0.0828164172804226, 0.03624608061964745, 0.160652233844461, 0.007358177560988975, 0.17567408538382986, 0.14526328502384864, 0.1260262299976919, 0.202518374853484, -0.036514465944112645, -0.061125870170476646, -0.33169050681323786, -0.15545964501620999, -0.21144626862976862, 0.11780972841357731, -0.19959681156729145, -0.27901462996783466, 0.3164757572073975, 0.12576101551682728, 0.2776849944792364, 0.17111396344135638, 0.22457777006025223, 0.07701457587232732, 0.06304169051025225, 0.08578523803178383, 0.16903310953436987, 0.18748801736080128, 0.03314313961435919, -0.12590456270086375, 0.02047377825188248, 0.1931173025265984]
|
1,803.0525
|
A mean-field game model for homogeneous flocking
|
Empirically derived continuum models of collective behavior among large
populations of dynamic agents are a subject of intense study in several fields,
including biology, engineering and finance. We formulate and study a mean-field
game model whose behavior mimics an empirically derived non-local homogeneous
flocking model for agents with gradient self-propulsion dynamics. The
mean-field game framework provides a non-cooperative optimal control
description of the behavior of a population of agents in a distributed setting.
In this description, each agent's state is driven by optimally controlled
dynamics that result in a Nash equilibrium between itself and the population.
The optimal control is computed by minimizing a cost that depends only on its
own state, and a mean-field term. The agent distribution in phase space evolves
under the optimal feedback control policy. We exploit the low-rank perturbative
nature of the non-local term in the forward-backward system of equations
governing the state and control distributions, and provide a linear stability
analysis demonstrating that our model exhibits bifurcations similar to those
found in the empirical model. The present work is a step towards developing a
set of tools for systematic analysis, and eventually design, of collective
behavior of non-cooperative dynamic agents via an inverse modeling approach.
|
nlin.AO cs.SY math.DS math.OC
|
empirically derived continuum models of collective behavior among large populations of dynamic agents are a subject of intense study in several fields including biology engineering and finance we formulate and study a meanfield game model whose behavior mimics an empirically derived nonlocal homogeneous flocking model for agents with gradient selfpropulsion dynamics the meanfield game framework provides a noncooperative optimal control description of the behavior of a population of agents in a distributed setting in this description each agents state is driven by optimally controlled dynamics that result in a nash equilibrium between itself and the population the optimal control is computed by minimizing a cost that depends only on its own state and a meanfield term the agent distribution in phase space evolves under the optimal feedback control policy we exploit the lowrank perturbative nature of the nonlocal term in the forwardbackward system of equations governing the state and control distributions and provide a linear stability analysis demonstrating that our model exhibits bifurcations similar to those found in the empirical model the present work is a step towards developing a set of tools for systematic analysis and eventually design of collective behavior of noncooperative dynamic agents via an inverse modeling approach
|
[['empirically', 'derived', 'continuum', 'models', 'of', 'collective', 'behavior', 'among', 'large', 'populations', 'of', 'dynamic', 'agents', 'are', 'a', 'subject', 'of', 'intense', 'study', 'in', 'several', 'fields', 'including', 'biology', 'engineering', 'and', 'finance', 'we', 'formulate', 'and', 'study', 'a', 'meanfield', 'game', 'model', 'whose', 'behavior', 'mimics', 'an', 'empirically', 'derived', 'nonlocal', 'homogeneous', 'flocking', 'model', 'for', 'agents', 'with', 'gradient', 'selfpropulsion', 'dynamics', 'the', 'meanfield', 'game', 'framework', 'provides', 'a', 'noncooperative', 'optimal', 'control', 'description', 'of', 'the', 'behavior', 'of', 'a', 'population', 'of', 'agents', 'in', 'a', 'distributed', 'setting', 'in', 'this', 'description', 'each', 'agents', 'state', 'is', 'driven', 'by', 'optimally', 'controlled', 'dynamics', 'that', 'result', 'in', 'a', 'nash', 'equilibrium', 'between', 'itself', 'and', 'the', 'population', 'the', 'optimal', 'control', 'is', 'computed', 'by', 'minimizing', 'a', 'cost', 'that', 'depends', 'only', 'on', 'its', 'own', 'state', 'and', 'a', 'meanfield', 'term', 'the', 'agent', 'distribution', 'in', 'phase', 'space', 'evolves', 'under', 'the', 'optimal', 'feedback', 'control', 'policy', 'we', 'exploit', 'the', 'lowrank', 'perturbative', 'nature', 'of', 'the', 'nonlocal', 'term', 'in', 'the', 'forwardbackward', 'system', 'of', 'equations', 'governing', 'the', 'state', 'and', 'control', 'distributions', 'and', 'provide', 'a', 'linear', 'stability', 'analysis', 'demonstrating', 'that', 'our', 'model', 'exhibits', 'bifurcations', 'similar', 'to', 'those', 'found', 'in', 'the', 'empirical', 'model', 'the', 'present', 'work', 'is', 'a', 'step', 'towards', 'developing', 'a', 'set', 'of', 'tools', 'for', 'systematic', 'analysis', 'and', 'eventually', 'design', 'of', 'collective', 'behavior', 'of', 'noncooperative', 'dynamic', 'agents', 'via', 'an', 'inverse', 'modeling', 'approach']]
|
[-0.1330474920533783, 0.058464413162567584, -0.14095900673419237, 0.06490524259015955, -0.04707450531793768, -0.15313427006844338, 0.09248858514828005, 0.35337526585665807, -0.30579376376155226, -0.2892963886220444, 0.057180963035566336, -0.2506478021977775, -0.19415425926108673, 0.12266850098967552, -0.057520972578400074, 0.03937448952688757, 0.03635738497433155, 0.0026711137533542324, 0.024021741706792228, -0.1913995068729971, 0.3009856795505227, 0.03673747596354108, 0.3024578070678095, -0.04120000505348464, 0.14335590026188474, 0.016625292278914273, 0.0192261079201169, 0.05252866593736284, -0.12896306816466352, 0.10383844764356441, 0.2589901377135386, 0.12212360040771204, 0.3664741550933625, -0.4271433103820355, -0.2241597792217091, 0.09887198254985002, 0.12949341257619418, 0.13377559613158455, -0.0517751930301212, -0.27122522841453256, 0.03592697560638931, -0.1830094457738361, -0.13795082024136437, -0.09146677541884765, -0.013832786498100158, 0.054372279862909816, -0.3100463436286322, 0.060150557436252854, 0.060984302003432383, 0.08966619354343755, -0.12826093766011243, -0.08301291993960497, -0.007583148608364128, 0.16177988649387634, 0.025621200879266608, -0.017021367351862774, 0.1674978698274255, -0.18313445899964528, -0.15467993294662652, 0.3680977317509218, -0.06828385973650387, -0.19950402427617628, 0.17798910331472162, -0.09054733918451552, -0.10252611128328395, 0.11007577134180462, 0.22393978811541007, 0.1344192102018614, -0.2076378131600384, 0.07281917441359476, -0.057617225688859006, 0.18038405359500267, -0.04834578064182282, 0.013009436097255541, 0.15608553576343392, 0.23675740317242286, 0.1278180647201243, 0.1423230154615878, 0.02130818011271605, -0.24805570415809602, -0.27787097994775617, -0.07932405588471919, -0.13086799749251993, 0.038435621582092114, -0.08699011809022608, -0.153160494796246, 0.397173814570522, 0.13352989885766078, 0.1666024963945424, 0.08755801707988058, 0.2756798799098724, 0.13590716712174772, -0.0389023848197687, 0.08017730639913856, 0.23324512544352172, 0.10671090873755255, 0.11398740227567901, -0.2975288811811612, 0.12397430257626174, 0.043623497173310585]
|
1,803.05251
|
The Local Bubble: a magnetic veil to our Galaxy
|
The magnetic field in the local interstellar medium does not follow the
large-scale Galactic magnetic field. The local magnetic field has probably been
distorted by the Local Bubble, a cavity of hot ionized gas extending all around
the Sun and surrounded by a shell of cold neutral gas and dust. However, so far
no conclusive association between the local magnetic field and the Local Bubble
has been established. Here we develop an analytical model for the magnetic
field in the shell of the Local Bubble, which we represent as an inclined
spheroid, off-centred from the Sun. We fit the model to Planck dust polarized
emission observations within 30 deg of the Galactic poles. We find a solution
that is consistent with a highly deformed magnetic field, with significantly
different directions towards the north and south Galactic poles. This work sets
a methodological framework for modelling the three-dimensional (3D) structure
of the magnetic field in the local interstellar medium, which is a most awaited
input for large-scale Galactic magnetic field models.
|
astro-ph.GA
|
the magnetic field in the local interstellar medium does not follow the largescale galactic magnetic field the local magnetic field has probably been distorted by the local bubble a cavity of hot ionized gas extending all around the sun and surrounded by a shell of cold neutral gas and dust however so far no conclusive association between the local magnetic field and the local bubble has been established here we develop an analytical model for the magnetic field in the shell of the local bubble which we represent as an inclined spheroid offcentred from the sun we fit the model to planck dust polarized emission observations within 30 deg of the galactic poles we find a solution that is consistent with a highly deformed magnetic field with significantly different directions towards the north and south galactic poles this work sets a methodological framework for modelling the threedimensional 3d structure of the magnetic field in the local interstellar medium which is a most awaited input for largescale galactic magnetic field models
|
[['the', 'magnetic', 'field', 'in', 'the', 'local', 'interstellar', 'medium', 'does', 'not', 'follow', 'the', 'largescale', 'galactic', 'magnetic', 'field', 'the', 'local', 'magnetic', 'field', 'has', 'probably', 'been', 'distorted', 'by', 'the', 'local', 'bubble', 'a', 'cavity', 'of', 'hot', 'ionized', 'gas', 'extending', 'all', 'around', 'the', 'sun', 'and', 'surrounded', 'by', 'a', 'shell', 'of', 'cold', 'neutral', 'gas', 'and', 'dust', 'however', 'so', 'far', 'no', 'conclusive', 'association', 'between', 'the', 'local', 'magnetic', 'field', 'and', 'the', 'local', 'bubble', 'has', 'been', 'established', 'here', 'we', 'develop', 'an', 'analytical', 'model', 'for', 'the', 'magnetic', 'field', 'in', 'the', 'shell', 'of', 'the', 'local', 'bubble', 'which', 'we', 'represent', 'as', 'an', 'inclined', 'spheroid', 'offcentred', 'from', 'the', 'sun', 'we', 'fit', 'the', 'model', 'to', 'planck', 'dust', 'polarized', 'emission', 'observations', 'within', '30', 'deg', 'of', 'the', 'galactic', 'poles', 'we', 'find', 'a', 'solution', 'that', 'is', 'consistent', 'with', 'a', 'highly', 'deformed', 'magnetic', 'field', 'with', 'significantly', 'different', 'directions', 'towards', 'the', 'north', 'and', 'south', 'galactic', 'poles', 'this', 'work', 'sets', 'a', 'methodological', 'framework', 'for', 'modelling', 'the', 'threedimensional', '3d', 'structure', 'of', 'the', 'magnetic', 'field', 'in', 'the', 'local', 'interstellar', 'medium', 'which', 'is', 'a', 'most', 'awaited', 'input', 'for', 'largescale', 'galactic', 'magnetic', 'field', 'models']]
|
[-0.09878309113589828, 0.11816331982109285, -0.0559548101382782, 0.06412880857653148, -0.08906359793481362, -0.026732637640088798, -0.006357282026917399, 0.40790329108781676, -0.22492788159083027, -0.3174234935863163, 0.041672882644599986, -0.23926816837081466, -0.04993406621848836, 0.14430323471041287, 0.04409032850426764, -0.05708637067103101, -0.0411456467665951, -0.013116061356028214, -0.00908448004081626, -0.18550157967461822, 0.29924821249647615, 0.11240769210682415, 0.2068989612572991, 0.014081346391535857, 0.06446682406000465, -0.07137707612093758, -0.02835202487733434, 0.06770466126720695, -0.10742337109186337, 0.07688559125561048, 0.15435146043063844, 0.07261160682503354, 0.22151124857174342, -0.4894645680029712, -0.25105402667951937, 0.06549101573798587, 0.1998755329178975, 0.12579948693541262, -0.10666576598579174, -0.2869058051530053, 0.023589257993187535, -0.13909235538312179, -0.22486672082861117, 0.004837651189197512, 0.022763019967276383, -0.0012663805042393505, -0.2640690875749843, 0.09382874649428927, 0.04354384215891033, 0.13194969562909512, -0.14340464877485135, -0.07890698885654703, -0.04748722050229416, 0.05898992825189934, 0.06978600088452154, 0.15712784120593878, 0.22692946111783385, -0.17851359725738053, -0.027044089017983747, 0.38142626075115166, -0.07228661079836242, -0.0751430125126396, 0.1866421423948315, -0.24190278780537056, -0.12296971536570174, 0.18950652630232712, 0.14222194090047302, 0.1062119782628382, -0.1676037770891151, 0.08809706007322186, -0.12220407077522182, 0.15024438834310894, 0.03185235991772702, -0.006172193246482707, 0.3479944160755943, 0.12353640088044546, 0.04467448365381536, 0.11066901997991782, -0.2140406706288238, -0.09173468842499835, -0.23421837045307792, -0.11418374549761853, -0.1211534415214213, 0.03435406528887517, -0.11828617541194784, -0.18484077253105008, 0.36253798172863966, 0.1359623656183591, 0.17760441773434116, -0.05268363367820925, 0.33274883814019096, 0.03567577386480373, 0.09231388932641815, 0.17223285942283623, 0.3368793011040372, 0.2006535404964405, 0.12161185902077705, -0.21915530482279685, 0.02573906141893959, 0.0026922165827058695]
|
1,803.05252
|
Algebraic Machine Learning
|
Machine learning algorithms use error function minimization to fit a large
set of parameters in a preexisting model. However, error minimization
eventually leads to a memorization of the training dataset, losing the ability
to generalize to other datasets. To achieve generalization something else is
needed, for example a regularization method or stopping the training when error
in a validation dataset is minimal. Here we propose a different approach to
learning and generalization that is parameter-free, fully discrete and that
does not use function minimization. We use the training data to find an
algebraic representation with minimal size and maximal freedom, explicitly
expressed as a product of irreducible components. This algebraic representation
is shown to directly generalize, giving high accuracy in test data, more so the
smaller the representation. We prove that the number of generalizing
representations can be very large and the algebra only needs to find one. We
also derive and test a relationship between compression and error rate. We give
results for a simple problem solved step by step, hand-written character
recognition, and the Queens Completion problem as an example of unsupervised
learning. As an alternative to statistical learning, algebraic learning may
offer advantages in combining bottom-up and top-down information, formal
concept derivation from data and large-scale parallelization.
|
cs.LG cs.DM math.AC math.RA
|
machine learning algorithms use error function minimization to fit a large set of parameters in a preexisting model however error minimization eventually leads to a memorization of the training dataset losing the ability to generalize to other datasets to achieve generalization something else is needed for example a regularization method or stopping the training when error in a validation dataset is minimal here we propose a different approach to learning and generalization that is parameterfree fully discrete and that does not use function minimization we use the training data to find an algebraic representation with minimal size and maximal freedom explicitly expressed as a product of irreducible components this algebraic representation is shown to directly generalize giving high accuracy in test data more so the smaller the representation we prove that the number of generalizing representations can be very large and the algebra only needs to find one we also derive and test a relationship between compression and error rate we give results for a simple problem solved step by step handwritten character recognition and the queens completion problem as an example of unsupervised learning as an alternative to statistical learning algebraic learning may offer advantages in combining bottomup and topdown information formal concept derivation from data and largescale parallelization
|
[['machine', 'learning', 'algorithms', 'use', 'error', 'function', 'minimization', 'to', 'fit', 'a', 'large', 'set', 'of', 'parameters', 'in', 'a', 'preexisting', 'model', 'however', 'error', 'minimization', 'eventually', 'leads', 'to', 'a', 'memorization', 'of', 'the', 'training', 'dataset', 'losing', 'the', 'ability', 'to', 'generalize', 'to', 'other', 'datasets', 'to', 'achieve', 'generalization', 'something', 'else', 'is', 'needed', 'for', 'example', 'a', 'regularization', 'method', 'or', 'stopping', 'the', 'training', 'when', 'error', 'in', 'a', 'validation', 'dataset', 'is', 'minimal', 'here', 'we', 'propose', 'a', 'different', 'approach', 'to', 'learning', 'and', 'generalization', 'that', 'is', 'parameterfree', 'fully', 'discrete', 'and', 'that', 'does', 'not', 'use', 'function', 'minimization', 'we', 'use', 'the', 'training', 'data', 'to', 'find', 'an', 'algebraic', 'representation', 'with', 'minimal', 'size', 'and', 'maximal', 'freedom', 'explicitly', 'expressed', 'as', 'a', 'product', 'of', 'irreducible', 'components', 'this', 'algebraic', 'representation', 'is', 'shown', 'to', 'directly', 'generalize', 'giving', 'high', 'accuracy', 'in', 'test', 'data', 'more', 'so', 'the', 'smaller', 'the', 'representation', 'we', 'prove', 'that', 'the', 'number', 'of', 'generalizing', 'representations', 'can', 'be', 'very', 'large', 'and', 'the', 'algebra', 'only', 'needs', 'to', 'find', 'one', 'we', 'also', 'derive', 'and', 'test', 'a', 'relationship', 'between', 'compression', 'and', 'error', 'rate', 'we', 'give', 'results', 'for', 'a', 'simple', 'problem', 'solved', 'step', 'by', 'step', 'handwritten', 'character', 'recognition', 'and', 'the', 'queens', 'completion', 'problem', 'as', 'an', 'example', 'of', 'unsupervised', 'learning', 'as', 'an', 'alternative', 'to', 'statistical', 'learning', 'algebraic', 'learning', 'may', 'offer', 'advantages', 'in', 'combining', 'bottomup', 'and', 'topdown', 'information', 'formal', 'concept', 'derivation', 'from', 'data', 'and', 'largescale', 'parallelization']]
|
[-0.03690334925139766, 0.010555731350697378, -0.11415221215713592, 0.09390925755225388, -0.16000827355088576, -0.1700287348701663, 0.05508413512725383, 0.3777048921611692, -0.3154478905888807, -0.33767131651208426, 0.10268207054718265, -0.25048409436602104, -0.15411364275496453, 0.1859028163887117, -0.14502447115567824, 0.04820458688107984, 0.11695433927345134, 0.06019394892223534, -0.11100189948254931, -0.2799240326386921, 0.28084895346934596, 0.04594760684385186, 0.3068765752483159, 0.040074196059833325, 0.14853239537249985, -0.013061702612321823, -0.006173285574740952, -0.013949617163078593, -0.08363660707168276, 0.15930868666314166, 0.30328329998578524, 0.20561230580566361, 0.3194247496835444, -0.4037951526099018, -0.1802345388408174, 0.14037209843573648, 0.18000131032784425, 0.13980971604559317, -0.038726867703025206, -0.25146074865811635, 0.07969850429355921, -0.1887404624636041, -0.05436610159952016, -0.1658944908889853, -0.004718893302959346, -0.050176310165607856, -0.3276422857933323, 0.03374394036516259, 0.07397972656901748, 0.0837897442376873, -0.04634322490587476, -0.10230733577239638, 0.04974188219833498, 0.12009256626770366, 0.03580642660492144, 0.06089404566557191, 0.10420813829904156, -0.14291854461411102, -0.1335576360781921, 0.3626280948730363, -0.05986072766217625, -0.26634960228665955, 0.17530819049792454, -0.038959280276183214, -0.13562973668643583, 0.0923937350630738, 0.2047429004074296, 0.09665246463292057, -0.14021695996835618, 0.03570369886472777, -0.0446092321980922, 0.16323616372232902, 0.032985170868535835, -0.009098750833211289, 0.12100007986744112, 0.20336510287486903, 0.06698796367352423, 0.16089927525387057, -0.06726818029114622, -0.05732087361227189, -0.28472601240944295, -0.13771418307996577, -0.20818871805289138, 0.03465142952218663, -0.10739549358002565, -0.1650500627515915, 0.3594110879869688, 0.181484202220149, 0.2157211641526027, 0.1478544306852633, 0.32326274810891065, 0.07833071770818649, 0.10174583751331305, 0.09386868361228456, 0.1716284487657027, 0.07950863194225045, 0.040714062222590046, -0.17344123511353418, 0.05264333446421439, 0.09181144876139505]
|
1,803.05253
|
How to Implement Dependencies in Server Pages of JEE Web Applications
|
Java Enterprise Edition (JEE) applications are implemented in terms of a set
of components developed based on several JEE technologies includ- ing, but not
limited to, Servlet, JSP, JSF, EJB, JavaBeans. These JEE technologies rely on a
varied set of communication mechanisms to commu- nicate between each others.
Examples of these communication mechanisms are HTTP requests, Remote Method
Invocation (RMI), Java DateBase Connectivity (JDBC), etc. These communication
mechanisms represent program dependencies between JEE components. However, one
communi- cation mechanism can be implemented following different implementation
ways by different JEE technologies. Therefore, to be able to detect related
dependencies, we identify these implementation ways used by a set of JEE
technologies. In this technical report, we focus on the Web tier technologies
that are Servlets, JSPs and JSFs. Also, we present how these technologies
access the JavaBeans and Manage Beans components.
|
cs.SE
|
java enterprise edition jee applications are implemented in terms of a set of components developed based on several jee technologies includ ing but not limited to servlet jsp jsf ejb javabeans these jee technologies rely on a varied set of communication mechanisms to commu nicate between each others examples of these communication mechanisms are http requests remote method invocation rmi java datebase connectivity jdbc etc these communication mechanisms represent program dependencies between jee components however one communi cation mechanism can be implemented following different implementation ways by different jee technologies therefore to be able to detect related dependencies we identify these implementation ways used by a set of jee technologies in this technical report we focus on the web tier technologies that are servlets jsps and jsfs also we present how these technologies access the javabeans and manage beans components
|
[['java', 'enterprise', 'edition', 'jee', 'applications', 'are', 'implemented', 'in', 'terms', 'of', 'a', 'set', 'of', 'components', 'developed', 'based', 'on', 'several', 'jee', 'technologies', 'includ', 'ing', 'but', 'not', 'limited', 'to', 'servlet', 'jsp', 'jsf', 'ejb', 'javabeans', 'these', 'jee', 'technologies', 'rely', 'on', 'a', 'varied', 'set', 'of', 'communication', 'mechanisms', 'to', 'commu', 'nicate', 'between', 'each', 'others', 'examples', 'of', 'these', 'communication', 'mechanisms', 'are', 'http', 'requests', 'remote', 'method', 'invocation', 'rmi', 'java', 'datebase', 'connectivity', 'jdbc', 'etc', 'these', 'communication', 'mechanisms', 'represent', 'program', 'dependencies', 'between', 'jee', 'components', 'however', 'one', 'communi', 'cation', 'mechanism', 'can', 'be', 'implemented', 'following', 'different', 'implementation', 'ways', 'by', 'different', 'jee', 'technologies', 'therefore', 'to', 'be', 'able', 'to', 'detect', 'related', 'dependencies', 'we', 'identify', 'these', 'implementation', 'ways', 'used', 'by', 'a', 'set', 'of', 'jee', 'technologies', 'in', 'this', 'technical', 'report', 'we', 'focus', 'on', 'the', 'web', 'tier', 'technologies', 'that', 'are', 'servlets', 'jsps', 'and', 'jsfs', 'also', 'we', 'present', 'how', 'these', 'technologies', 'access', 'the', 'javabeans', 'and', 'manage', 'beans', 'components']]
|
[-0.16541748463000294, 0.04615726165582229, -0.03694717277412432, 0.05186928249470699, -0.12119670597034214, -0.21242089746655882, 0.08210277609037657, 0.3996090245072859, -0.26609822060831273, -0.3505444036334427, 0.10549497723844528, -0.2618613804003944, -0.1488280630106256, 0.23801414368089532, -0.0908885286121636, 0.020657646996614924, 0.03828239719889868, -0.06156748706597264, 0.04075799096863458, -0.27783440077255894, 0.27636903135384683, 0.006079308239974245, 0.32190951010905694, 0.08235488033022419, 0.04858551224367353, -0.04000941606112722, -0.09526385856030957, -0.042579426668094895, -0.11129554506778135, 0.16061414047450262, 0.3544071487620147, 0.24822348436802952, 0.28979914997751915, -0.4689648794758059, -0.172094299667005, 0.02679214334917547, 0.13995977940826412, 0.034444118767295265, -0.028840889548372994, -0.28830760712633385, 0.08298180431100356, -0.2639610678718908, -0.04444062789684556, -0.08442361071624242, 0.009712078713941096, 0.06930959640142174, -0.1805373299289087, -0.05998938744628537, -0.01911641614185306, 0.04942913741607518, -0.006522884031580965, -0.1037895565539816, 0.022555524087341055, 0.17036031545173838, -0.029168881435137597, -0.00955146737396717, 0.19856047109925073, -0.07509809716971741, -0.2007770526161703, 0.3449188192939236, 0.023073622562589435, -0.1668633690280636, 0.25769958524611253, 0.003749964429051989, -0.20938292651158505, 0.018195819072289406, 0.2235366529729863, 0.06063812905174755, -0.23842101100234003, 0.04333255089816032, 0.04864017432895455, 0.1896517346103261, 0.06624723700670539, 0.07301386817949858, 0.19136230259059664, 0.15226202191662613, 0.016196716427524748, 0.09025988892149044, -0.02113922006097099, -0.06490944864663438, -0.22918020455034138, -0.12421844274240688, -0.12591457852488724, -0.021420323531152714, -0.017329053512271358, -0.13106189310605074, 0.3478557108867451, 0.24244545814819143, 0.07416175643022913, -0.015926667109168353, 0.34878771011819587, -0.012851893397606399, 0.1594570807324056, 0.13284145503977898, 0.1431787121755472, 0.022819875917111924, 0.18257986971374301, -0.11940346503235998, 0.13157603823083597, 0.025080565239105672]
|
1,803.05254
|
Impacts of multi-Higgs on the $\rho$ parameter, decays of a neutral
Higgs to $WW$ and $ZZ$, and a charged Higgs to $WZ$
|
In the standard model (SM), the $\rho$ parameter is equal to 1 and the ratio
$\lambda_{WZ}$ of Higgs $\to ZZ$ and Higgs $\to WW$ is also equal to 1 at the
tree level. When going beyond the SM with more than one types of Higgs
representations these quantities may be different from the SM predictions which
can provide crucial information about new physics. There may also exist a
certain charged Higgs $h^+$ decays into a $W^+$ and a $Z$. Imposing a custodial
symmetry can force the parameter $\rho$ to be equal to 1 with certain
predictions for $\lambda_{WZ}$ and $h^+ \to W^+Z$. However, imposing $\rho =1$
without custodial symmetry may have different predictions. We show how
differences arise and how to use experimental data to obtain information about
the underlying physics in a model with the SM plus a real and a complex
$SU(2)_L$ triplets.
|
hep-ph hep-ex
|
in the standard model sm the rho parameter is equal to 1 and the ratio lambda_wz of higgs to zz and higgs to ww is also equal to 1 at the tree level when going beyond the sm with more than one types of higgs representations these quantities may be different from the sm predictions which can provide crucial information about new physics there may also exist a certain charged higgs h decays into a w and a z imposing a custodial symmetry can force the parameter rho to be equal to 1 with certain predictions for lambda_wz and h to wz however imposing rho 1 without custodial symmetry may have different predictions we show how differences arise and how to use experimental data to obtain information about the underlying physics in a model with the sm plus a real and a complex su2_l triplets
|
[['in', 'the', 'standard', 'model', 'sm', 'the', 'rho', 'parameter', 'is', 'equal', 'to', '1', 'and', 'the', 'ratio', 'lambda_wz', 'of', 'higgs', 'to', 'zz', 'and', 'higgs', 'to', 'ww', 'is', 'also', 'equal', 'to', '1', 'at', 'the', 'tree', 'level', 'when', 'going', 'beyond', 'the', 'sm', 'with', 'more', 'than', 'one', 'types', 'of', 'higgs', 'representations', 'these', 'quantities', 'may', 'be', 'different', 'from', 'the', 'sm', 'predictions', 'which', 'can', 'provide', 'crucial', 'information', 'about', 'new', 'physics', 'there', 'may', 'also', 'exist', 'a', 'certain', 'charged', 'higgs', 'h', 'decays', 'into', 'a', 'w', 'and', 'a', 'z', 'imposing', 'a', 'custodial', 'symmetry', 'can', 'force', 'the', 'parameter', 'rho', 'to', 'be', 'equal', 'to', '1', 'with', 'certain', 'predictions', 'for', 'lambda_wz', 'and', 'h', 'to', 'wz', 'however', 'imposing', 'rho', '1', 'without', 'custodial', 'symmetry', 'may', 'have', 'different', 'predictions', 'we', 'show', 'how', 'differences', 'arise', 'and', 'how', 'to', 'use', 'experimental', 'data', 'to', 'obtain', 'information', 'about', 'the', 'underlying', 'physics', 'in', 'a', 'model', 'with', 'the', 'sm', 'plus', 'a', 'real', 'and', 'a', 'complex', 'su2_l', 'triplets']]
|
[-0.04737951660865982, 0.2154596676343474, -0.07215262710855438, 0.1410644224058066, -0.11090553129284546, -0.2462659425872924, 0.0424856982887863, 0.32603990281450335, -0.25935365561524343, -0.31222605964104677, 0.04968734465314653, -0.2969814598881479, -0.04894609081334081, 0.1102962862764453, 0.0075419325188829985, 0.028216911171530856, 0.029350595362484456, 0.07582084593575865, -0.09663189051929733, -0.2753961564282533, 0.283128014078428, -0.0006881422716481932, 0.19099626795163957, 0.05220138397999108, 0.037404482567618635, 0.0007580401375889778, 0.008461127616465091, -0.05715838047065611, -0.15356177837620008, 0.1049356283684229, 0.18069045585419596, 0.09678135210776638, 0.17257641403422017, -0.3543269669315938, -0.16155673421373398, 0.1810008608125921, 0.15893860989218128, 0.0960860274435053, -0.010937169600972617, -0.30304632358702605, 0.16619225306243732, -0.163289164113491, -0.07806044137426492, -0.0758547072250653, -0.03402352972148821, -0.115038760916073, -0.35469496536975853, 0.06603155145702627, -0.00041970080728160925, 0.03410594016313553, 0.012965195691855303, -0.17799153311884608, -0.10366099439561367, 0.07548187083408141, 0.15479661497761144, 0.047854124490725646, 0.14487796451671628, -0.19772254970438521, -0.14716746351713764, 0.428666536561374, -0.09116790893794728, -0.24267871235336724, 0.21332138046493818, -0.17163181898569496, -0.1389365612300402, 0.11918413962141193, 0.1719836548548834, 0.00850346264236703, -0.12217323264831693, 0.1516609217016155, -0.013412317826316274, 0.18395302799482155, 0.025536734225421118, 0.04040607422718714, 0.21125397258277598, 0.12080452610931262, 0.03659907001520282, 0.03899251611357362, -0.06532107091284003, -0.062474713567644356, -0.39117578023980404, -0.15628194481712476, -0.05327263404534937, 0.08575360045350831, -0.10084388228394252, -0.08193094051475155, 0.3733551285775571, 0.147607353303164, 0.27693619396987146, 0.014318552308169932, 0.2594499330325373, 0.08842029499596563, 0.09207770037625371, 0.024874520507352105, 0.2532039829594051, 0.12297016667715949, 0.0565081434003238, -0.14951324238209054, 0.009816918098207178, 0.026325002372072175]
|
1,803.05255
|
Addressing the Challenges in Federating Edge Resources
|
This book chapter considers how Edge deployments can be brought to bear in a
global context by federating them across multiple geographic regions to create
a global Edge-based fabric that decentralizes data center computation. This is
currently impractical, not only because of technical challenges, but is also
shrouded by social, legal and geopolitical issues. In this chapter, we discuss
two key challenges - networking and management in federating Edge deployments.
Additionally, we consider resource and modeling challenges that will need to be
addressed for a federated Edge.
|
cs.DC
|
this book chapter considers how edge deployments can be brought to bear in a global context by federating them across multiple geographic regions to create a global edgebased fabric that decentralizes data center computation this is currently impractical not only because of technical challenges but is also shrouded by social legal and geopolitical issues in this chapter we discuss two key challenges networking and management in federating edge deployments additionally we consider resource and modeling challenges that will need to be addressed for a federated edge
|
[['this', 'book', 'chapter', 'considers', 'how', 'edge', 'deployments', 'can', 'be', 'brought', 'to', 'bear', 'in', 'a', 'global', 'context', 'by', 'federating', 'them', 'across', 'multiple', 'geographic', 'regions', 'to', 'create', 'a', 'global', 'edgebased', 'fabric', 'that', 'decentralizes', 'data', 'center', 'computation', 'this', 'is', 'currently', 'impractical', 'not', 'only', 'because', 'of', 'technical', 'challenges', 'but', 'is', 'also', 'shrouded', 'by', 'social', 'legal', 'and', 'geopolitical', 'issues', 'in', 'this', 'chapter', 'we', 'discuss', 'two', 'key', 'challenges', 'networking', 'and', 'management', 'in', 'federating', 'edge', 'deployments', 'additionally', 'we', 'consider', 'resource', 'and', 'modeling', 'challenges', 'that', 'will', 'need', 'to', 'be', 'addressed', 'for', 'a', 'federated', 'edge']]
|
[-0.162502518429984, 0.05494549672043514, -0.015977499676261876, 0.06751532741513666, -0.11884377567574035, -0.16081314252927725, 0.07726992347256043, 0.40286351633691336, -0.306871083846619, -0.311809973184799, 0.18623921489695, -0.24818793696156422, -0.22204372039887793, 0.12789879345096822, -0.18961256105949573, 0.004424226838488912, 0.09969310675271202, -0.04621815564500731, 0.012262560019735247, -0.25107174397576165, 0.35460184296852976, 0.041844907211313065, 0.32838186752700876, 0.1408517107605761, 0.011258058807153396, -0.0458045804028421, -0.08705926760164805, 0.0218335528922982, -0.08517618372926061, 0.18526673624508602, 0.41279272917051646, 0.23467584166589173, 0.3818897426474926, -0.505329591373718, -0.21274293219497384, 0.07946254188454775, 0.20236763344038017, 0.0690451139952381, -0.03360674611487707, -0.26862814008843067, 0.10874196997204752, -0.21511327750374412, -0.14532599717291983, -0.0708647656990865, 0.01415069570201774, -0.014583680567569857, -0.18308345319941466, -0.013718573347094122, 0.00957819403062553, 0.03483127045640072, 0.013916652939325674, -0.07797927035257048, 0.03338191332837004, 0.1714399232215053, 0.036105792664890286, -0.005439295271021682, 0.15190350250232704, -0.1514931646376025, -0.14983429377465401, 0.40942493185054424, 0.057861874296958014, -0.17100304954273757, 0.16429715522234653, -0.06472009110675994, -0.24089251582099255, 0.010811201383381389, 0.1994779145217847, -0.020628095474527326, -0.23483466472866577, 0.051922494586865785, 0.013306238374477902, 0.15958493915494792, 0.05792262637987733, 0.04711482912128748, 0.2526949822095894, 0.19731808421310298, 0.14490610036760743, 0.10878907344141585, -0.04748893190117087, -0.1437452307923935, -0.22956199357678658, -0.13953916847619208, -0.15146402936688688, 0.00965516921420457, -0.020365017744594763, -0.11072527898778749, 0.3566708052314298, 0.22441754171213266, 0.1593310348906143, -0.03871571160020404, 0.3699925374564563, -0.0023737164284644086, 0.08248873750224363, 0.14938032878346222, 0.1464458360867358, -0.030669870326122225, 0.19042174145579338, -0.11317769205739159, 0.06533544580993611, -0.03107332447435447]
|
1,803.05256
|
Newton-type Alternating Minimization Algorithm for Convex Optimization
|
We propose NAMA (Newton-type Alternating Minimization Algorithm) for solving
structured nonsmooth convex optimization problems where the sum of two
functions is to be minimized, one being strongly convex and the other composed
with a linear mapping. The proposed algorithm is a line-search method over a
continuous, real-valued, exact penalty function for the corresponding dual
problem, which is computed by evaluating the augmented Lagrangian at the primal
points obtained by alternating minimizations. As a consequence, NAMA relies on
exactly the same computations as the classical alternating minimization
algorithm (AMA), also known as the dual proximal gradient method. Under
standard assumptions the proposed algorithm possesses strong convergence
properties, while under mild additional assumptions the asymptotic convergence
is superlinear, provided that the search directions are chosen according to
quasi-Newton formulas. Due to its simplicity, the proposed method is well
suited for embedded applications and large-scale problems. Experiments show
that using limited-memory directions in NAMA greatly improves the convergence
speed over AMA and its accelerated variant.
|
math.OC
|
we propose nama newtontype alternating minimization algorithm for solving structured nonsmooth convex optimization problems where the sum of two functions is to be minimized one being strongly convex and the other composed with a linear mapping the proposed algorithm is a linesearch method over a continuous realvalued exact penalty function for the corresponding dual problem which is computed by evaluating the augmented lagrangian at the primal points obtained by alternating minimizations as a consequence nama relies on exactly the same computations as the classical alternating minimization algorithm ama also known as the dual proximal gradient method under standard assumptions the proposed algorithm possesses strong convergence properties while under mild additional assumptions the asymptotic convergence is superlinear provided that the search directions are chosen according to quasinewton formulas due to its simplicity the proposed method is well suited for embedded applications and largescale problems experiments show that using limitedmemory directions in nama greatly improves the convergence speed over ama and its accelerated variant
|
[['we', 'propose', 'nama', 'newtontype', 'alternating', 'minimization', 'algorithm', 'for', 'solving', 'structured', 'nonsmooth', 'convex', 'optimization', 'problems', 'where', 'the', 'sum', 'of', 'two', 'functions', 'is', 'to', 'be', 'minimized', 'one', 'being', 'strongly', 'convex', 'and', 'the', 'other', 'composed', 'with', 'a', 'linear', 'mapping', 'the', 'proposed', 'algorithm', 'is', 'a', 'linesearch', 'method', 'over', 'a', 'continuous', 'realvalued', 'exact', 'penalty', 'function', 'for', 'the', 'corresponding', 'dual', 'problem', 'which', 'is', 'computed', 'by', 'evaluating', 'the', 'augmented', 'lagrangian', 'at', 'the', 'primal', 'points', 'obtained', 'by', 'alternating', 'minimizations', 'as', 'a', 'consequence', 'nama', 'relies', 'on', 'exactly', 'the', 'same', 'computations', 'as', 'the', 'classical', 'alternating', 'minimization', 'algorithm', 'ama', 'also', 'known', 'as', 'the', 'dual', 'proximal', 'gradient', 'method', 'under', 'standard', 'assumptions', 'the', 'proposed', 'algorithm', 'possesses', 'strong', 'convergence', 'properties', 'while', 'under', 'mild', 'additional', 'assumptions', 'the', 'asymptotic', 'convergence', 'is', 'superlinear', 'provided', 'that', 'the', 'search', 'directions', 'are', 'chosen', 'according', 'to', 'quasinewton', 'formulas', 'due', 'to', 'its', 'simplicity', 'the', 'proposed', 'method', 'is', 'well', 'suited', 'for', 'embedded', 'applications', 'and', 'largescale', 'problems', 'experiments', 'show', 'that', 'using', 'limitedmemory', 'directions', 'in', 'nama', 'greatly', 'improves', 'the', 'convergence', 'speed', 'over', 'ama', 'and', 'its', 'accelerated', 'variant']]
|
[-0.07381263086687267, -0.005858223739419317, -0.08173479231787317, 0.06689346335141311, -0.09903736741075085, -0.18468476171363835, 0.025881249305611063, 0.4110220872802821, -0.3507040628967922, -0.27018280690219715, 0.15268536605642258, -0.21040461717833145, -0.1782236048652802, 0.21876073333888924, -0.06763112096266496, 0.10398599801421235, 0.07995605166932498, 0.006797530725713314, -0.15298203977376776, -0.29650995979965145, 0.22477629848750147, 0.02368612686333097, 0.2831185183050916, 0.031199135677457822, 0.16665917296353497, 0.03765642174439114, 0.024846874924454216, 0.060709310193532824, -0.044549404409657274, 0.13131478717938685, 0.22458605907345766, 0.17699559075458918, 0.35534396819500136, -0.3926274624055274, -0.16915051738967268, 0.12874202715178354, 0.15219481332108298, 0.031708390170989996, -0.07806725974013615, -0.2527183450838942, 0.11991472213089259, -0.08075640192772779, -0.10771805315025519, -0.1178692510512508, -0.10271167638136741, 0.09057439599483688, -0.34068956677974377, 0.06219201729928264, 0.040650789488687604, 0.002782974455413627, -0.08543190753294362, -0.1612052862405961, 0.04049705873663181, 0.009163776383861715, 0.09679096661802535, 0.0882748811258532, 0.11761470192778901, -0.0653549732013755, -0.13656346998924826, 0.36673245864149967, -0.06491164424468154, -0.28380658437015005, 0.1742885020693741, -0.0013246039549509685, -0.12152453406604674, 0.1405705841370272, 0.16001127242041682, 0.21781795372738055, -0.13738390465876388, 0.1321161818668321, -0.07216233215984647, 0.08689755738215567, 0.04523167115446456, -0.030902257105795507, 0.06856592526849083, 0.13170848867495222, 0.2192107696592072, 0.1787827048953019, -0.0277055247132034, -0.14849827054566073, -0.2766254716696517, -0.10409503294382083, -0.22163215934235694, -0.04708594840054435, -0.15002108785227863, -0.16731543584013886, 0.3878255924698609, 0.10201768572607514, 0.15012901643992482, 0.12668854444371078, 0.360943468540539, 0.15437116687556868, 0.06308343446595066, 0.13298545546691726, 0.1986356721256779, 0.12314820384612468, 0.05481832358629707, -0.2674844562921121, 0.09596141846275624, 0.18991163258590263]
|
1,803.05257
|
Lov\'asz extension and graph cut
|
A set-pair Lov\'asz extension is established to construct equivalent
continuous optimization problems for graph $k$-cut problems.
|
math.CO math.OC math.SP
|
a setpair lovasz extension is established to construct equivalent continuous optimization problems for graph kcut problems
|
[['a', 'setpair', 'lovasz', 'extension', 'is', 'established', 'to', 'construct', 'equivalent', 'continuous', 'optimization', 'problems', 'for', 'graph', 'kcut', 'problems']]
|
[-0.07269028201699257, -0.0714857650299867, -0.09539216915145517, 0.26622707201944046, -0.19783966802060604, -0.24827562182520826, -0.013700885822375615, 0.3605507045984268, -0.42867259234189986, -0.3073726140273114, 0.22755596563220024, -0.199139004945755, -0.16426295017202694, 0.16461842482288677, -0.194416196939225, 0.14592185914516448, 0.08616362446919083, -0.05109372716397047, -0.08149302452802658, -0.2537970378781514, 0.17606105407079062, -0.10752244840065638, 0.15586370043456554, 0.07596142701804638, 0.18886729516088963, 0.07129338731368383, 0.05459183603525162, 0.11993015718956788, -0.20736363508428138, 0.11561598833650351, 0.423820831378301, 0.22901010140776634, 0.35967106620470685, -0.3129411700492104, -0.24867329994837442, 0.24675801365325847, 0.08635966529448827, -0.01551548515756925, 0.024873025715351105, -0.21912434349457424, 0.10947269148503741, -0.0221317450205485, -0.05542747403184573, -0.011739918092886607, 0.07763422938684622, -0.0472798033306996, -0.4355917563041051, 0.021221059933304788, 0.02238197441523274, 0.0032171340038379035, 0.005297014489769936, -0.1202991267045339, 0.10286607363571723, -0.0825494036388894, -0.05892229808184008, 0.18194090873003005, 0.11095127525428931, -0.04063608758151531, -0.3303648994614681, 0.34869926640142995, 0.03751410568753878, -0.23829279023533065, 0.11366124401489894, 0.14879942977180083, -0.24178834855556489, 0.10185256637632847, 0.1265703596174717, 0.2025244162728389, -0.13612468391656876, 0.24893347000082333, -0.213084930429856, 0.09835570671906074, 0.0951333500444889, -0.06353615168482066, 0.020440129827087126, 0.12610987772544224, 0.3659918437401454, 0.32037909974654516, 0.18211533517266312, -0.13543243743479252, -0.20407619302471477, -0.0400543749332428, -0.25205111913383005, -0.003977024803558985, -0.1095502307328085, -0.25004102094098923, 0.4188915217916171, 0.11671150214970112, 0.0565740538140138, 0.20634142582615217, 0.19576070060332615, 0.14463117743531864, -0.015135419741272926, 0.16350339542453488, 0.11382924268643062, 0.34473805154363313, 0.02975284308195114, -0.14522924351816377, 0.0035092711293449002, 0.253206571812431]
|
1,803.05258
|
Face-MagNet: Magnifying Feature Maps to Detect Small Faces
|
In this paper, we introduce the Face Magnifier Network (Face-MageNet), a face
detector based on the Faster-RCNN framework which enables the flow of
discriminative information of small scale faces to the classifier without any
skip or residual connections. To achieve this, Face-MagNet deploys a set of
ConvTranspose, also known as deconvolution, layers in the Region Proposal
Network (RPN) and another set before the Region of Interest (RoI) pooling layer
to facilitate detection of finer faces. In addition, we also design, train, and
evaluate three other well-tuned architectures that represent the conventional
solutions to the scale problem: context pooling, skip connections, and scale
partitioning. Each of these three networks achieves comparable results to the
state-of-the-art face detectors. With extensive experiments, we show that
Face-MagNet based on a VGG16 architecture achieves better results than the
recently proposed ResNet101-based HR method on the task of face detection on
WIDER dataset and also achieves similar results on the hard set as our other
method SSH.
|
cs.CV
|
in this paper we introduce the face magnifier network facemagenet a face detector based on the fasterrcnn framework which enables the flow of discriminative information of small scale faces to the classifier without any skip or residual connections to achieve this facemagnet deploys a set of convtranspose also known as deconvolution layers in the region proposal network rpn and another set before the region of interest roi pooling layer to facilitate detection of finer faces in addition we also design train and evaluate three other welltuned architectures that represent the conventional solutions to the scale problem context pooling skip connections and scale partitioning each of these three networks achieves comparable results to the stateoftheart face detectors with extensive experiments we show that facemagnet based on a vgg16 architecture achieves better results than the recently proposed resnet101based hr method on the task of face detection on wider dataset and also achieves similar results on the hard set as our other method ssh
|
[['in', 'this', 'paper', 'we', 'introduce', 'the', 'face', 'magnifier', 'network', 'facemagenet', 'a', 'face', 'detector', 'based', 'on', 'the', 'fasterrcnn', 'framework', 'which', 'enables', 'the', 'flow', 'of', 'discriminative', 'information', 'of', 'small', 'scale', 'faces', 'to', 'the', 'classifier', 'without', 'any', 'skip', 'or', 'residual', 'connections', 'to', 'achieve', 'this', 'facemagnet', 'deploys', 'a', 'set', 'of', 'convtranspose', 'also', 'known', 'as', 'deconvolution', 'layers', 'in', 'the', 'region', 'proposal', 'network', 'rpn', 'and', 'another', 'set', 'before', 'the', 'region', 'of', 'interest', 'roi', 'pooling', 'layer', 'to', 'facilitate', 'detection', 'of', 'finer', 'faces', 'in', 'addition', 'we', 'also', 'design', 'train', 'and', 'evaluate', 'three', 'other', 'welltuned', 'architectures', 'that', 'represent', 'the', 'conventional', 'solutions', 'to', 'the', 'scale', 'problem', 'context', 'pooling', 'skip', 'connections', 'and', 'scale', 'partitioning', 'each', 'of', 'these', 'three', 'networks', 'achieves', 'comparable', 'results', 'to', 'the', 'stateoftheart', 'face', 'detectors', 'with', 'extensive', 'experiments', 'we', 'show', 'that', 'facemagnet', 'based', 'on', 'a', 'vgg16', 'architecture', 'achieves', 'better', 'results', 'than', 'the', 'recently', 'proposed', 'resnet101based', 'hr', 'method', 'on', 'the', 'task', 'of', 'face', 'detection', 'on', 'wider', 'dataset', 'and', 'also', 'achieves', 'similar', 'results', 'on', 'the', 'hard', 'set', 'as', 'our', 'other', 'method', 'ssh']]
|
[-0.043348837787142165, -0.04271876130503817, -0.044915608351286024, 0.01155014627893718, -0.07893644590885976, -0.1782111360837753, 0.03444055441949063, 0.44376820380775595, -0.23905941910253695, -0.31560223072003096, 0.09930414914896783, -0.28560153811047667, -0.20415714933710077, 0.19422357952480057, -0.12234806279295111, 0.08824651202974984, 0.143629661846297, 0.06895457943438743, -0.08348618926725183, -0.30123948340769857, 0.32201347844705036, 0.0721392552786244, 0.3594815804061886, 0.05927979876874955, 0.14120547790960886, -0.06149979163474666, -0.014581601165282803, 0.010558340643257953, -0.05440890346849651, 0.18902046645122866, 0.22619310464674178, 0.16738980307948226, 0.28151601824002004, -0.43372550446134156, -0.21185895969392732, 0.071581931684005, 0.1253660268893537, 0.0769079364664578, -0.015178497108326364, -0.3325187420854584, 0.12747081652140388, -0.1821041213026127, 0.017002241137491252, -0.11000508499833253, -0.06523588871380362, -0.04032858418978345, -0.2836575551758496, 0.015730723714230593, 0.06802698575372162, -0.0021539479807520714, -0.05012610042019962, -0.13047818848505044, 0.01968540463787623, 0.14787675640157735, -0.003286878578364849, 0.07388153790051523, 0.13937773454026917, -0.17483051658345153, -0.14636816239008346, 0.3459038972400893, -0.046414346861498555, -0.21742661063296673, 0.2146848576137414, -0.05971947733241205, -0.1344334662784464, 0.09939586404018486, 0.23281972903686649, 0.13520233732504913, -0.11058007472027571, -0.029688326376251493, -0.08794955598214307, 0.20350144946804413, 0.07799086682438755, 0.02530807074986231, 0.15477621076533046, 0.29253449981124735, 0.09980202733407705, 0.16893322452550563, -0.22243554674190444, -0.07327339981006495, -0.22725514550275433, -0.10118882254942153, -0.1836184834067423, -0.08528489481586103, -0.12372296647047804, -0.14665485872552755, 0.4484468914198283, 0.24484100584418345, 0.23340121995006952, 0.11960135657080592, 0.33370686983928466, -0.02097897620198917, 0.16382682032119006, 0.08035015427016426, 0.20932277504844257, -0.014947374712508649, 0.10641603953636383, -0.15296070283511654, 0.05177680625974272, 0.0933630395358285]
|
1,803.05259
|
Products and Projective Limits of Continuous Valuations on $T_0$ Spaces
|
We show analogues of the Daniell-Kolmogorov and Prohorov theorems on the
existence of projective limits of measures, in the setting of continuous
valuations on $T_0$ topological spaces.
|
math.PR math.FA
|
we show analogues of the daniellkolmogorov and prohorov theorems on the existence of projective limits of measures in the setting of continuous valuations on t_0 topological spaces
|
[['we', 'show', 'analogues', 'of', 'the', 'daniellkolmogorov', 'and', 'prohorov', 'theorems', 'on', 'the', 'existence', 'of', 'projective', 'limits', 'of', 'measures', 'in', 'the', 'setting', 'of', 'continuous', 'valuations', 'on', 't_0', 'topological', 'spaces']]
|
[-0.170564873121643, 0.07360097996962185, -0.11369021844047193, 0.107831481557626, 0.027985396150213022, -0.013286845471996527, 0.09630897021494232, 0.3430777116893576, -0.25948306696059614, -0.13893980532884598, 0.14684188852641875, -0.27723240082223827, -0.08872632051889713, 0.3006096272997988, -0.16763192572845861, 0.038927487742442354, -0.05460221557698857, 0.06586634360540372, -0.15834971585382634, -0.30007879643772656, 0.461618042909182, -0.09526460531812447, 0.27021534683612675, 0.09386611317929167, 0.12141553677905065, 0.05877963616512716, -0.03141179114866715, 0.0006551056419714139, -0.23231743491039827, 0.1632799802061457, 0.2181004432674784, 0.10036243480415298, 0.2087668849585148, -0.3421728927642107, -0.17375225423333737, 0.22501209306602293, 0.000907322929169123, -0.026828685775399208, 0.028975897029830285, -0.36502965883566785, 0.08678556599009496, -0.06636348646134138, -0.10135866658618817, -0.10293792109363355, 0.010968059731217531, 0.0827509119676856, -0.19911851991827673, 0.052999160753992886, 0.16425934011259904, 0.1132600950793578, -0.18903525051875755, -0.05411570182499977, -0.06406490986522001, 0.06045560044451402, 0.024782586054733165, -0.04378494697336394, 0.08774213784804138, -0.093791304084544, -0.23982125678314611, 0.34581313744330633, -0.0965378823188635, -0.21421778596077973, 0.20002880764122194, -0.21534514498825258, -0.20676584248072827, 0.047714622118152104, 0.17686993413819715, 0.19414856263364738, 0.027514674593336307, 0.21864738845257448, -0.11968260186796005, 0.06978078401432587, 0.09445343567774846, 0.1355265828136068, 0.13294206323245397, 0.0932122587154691, 0.15809292994582883, 0.15448249790530938, 0.010445925281741299, -0.10363057105972145, -0.36844436537760955, -0.2031648991486201, -0.17931181729699558, 0.11766924494161056, -0.14036551746483802, -0.1776380128442095, 0.35951100311313683, 0.1333160541521815, 0.19803539806833634, 0.13905572379007936, 0.19631083245174244, 0.06777742583877765, -0.03672035762037222, 0.002966581807973293, 0.17761992290616035, 0.22478977332894617, 0.04644230541844781, -0.08143781039577264, 0.03474353103396984, 0.19794860342517495]
|
1,803.0526
|
A Static Program Slicing Approach for Output Stream Objects in JEE
Applications
|
In this paper, we propose a program slicing approach for the output stream
object in JEE applications. Our approach is based on extracting a dependency
call graph from KDM models of JEE applications. Then, it applies breath-first
search algorithm to identify the program slice as a graph reachability problem.
The proposed approach is implemented as an extension of our DeJEE tool.
|
cs.SE
|
in this paper we propose a program slicing approach for the output stream object in jee applications our approach is based on extracting a dependency call graph from kdm models of jee applications then it applies breathfirst search algorithm to identify the program slice as a graph reachability problem the proposed approach is implemented as an extension of our dejee tool
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'program', 'slicing', 'approach', 'for', 'the', 'output', 'stream', 'object', 'in', 'jee', 'applications', 'our', 'approach', 'is', 'based', 'on', 'extracting', 'a', 'dependency', 'call', 'graph', 'from', 'kdm', 'models', 'of', 'jee', 'applications', 'then', 'it', 'applies', 'breathfirst', 'search', 'algorithm', 'to', 'identify', 'the', 'program', 'slice', 'as', 'a', 'graph', 'reachability', 'problem', 'the', 'proposed', 'approach', 'is', 'implemented', 'as', 'an', 'extension', 'of', 'our', 'dejee', 'tool']]
|
[-0.059709252292911213, -0.06731800218088514, -0.16925979000516236, 0.08103303257764007, -0.13731154163057605, -0.13398927621698628, 0.044820476977232224, 0.3690414793168505, -0.2774542851373553, -0.35110455219013, 0.12421685954323039, -0.22163189423736185, -0.21940585951476047, 0.22779672170290724, -0.10059242491843179, 0.07980936691941072, 0.10480048602136473, 0.025942463225995503, 0.02889740854492023, -0.20097915873726985, 0.3037001968671878, 0.018438883482789, 0.2656166524005433, 0.026316701100828746, 0.1246885134993742, 0.060036463538805644, -0.05014144158922136, 0.03551657705878218, -0.08516610031947494, 0.1565796328689127, 0.2864945077985491, 0.28340997962125886, 0.304413190856576, -0.3354987058012436, -0.19661924790901442, 0.06473027491010726, 0.14369808021001518, 0.12144206929175803, -0.05919581016253991, -0.28205867918829125, 0.10729393794511756, -0.21093705085416634, -0.030338110852365693, -0.0641861201574405, -0.008788446515488128, -0.058722231071442366, -0.277285707462579, -0.04151814283492664, 0.07556113201668874, 0.00994110667379573, -0.025841223989846184, -0.06984246772869179, 0.05401733640270929, 0.09780756424491605, -0.022828890398765605, 0.11193194450655332, 0.12081263351719826, -0.07532180271421869, -0.20750223035768917, 0.38822454325854777, -0.05704635269163797, -0.19832174522647014, 0.14280304266527916, 0.03554024224479993, -0.2323895011640464, 0.05563098460746308, 0.23467459756260117, 0.20776840774342417, -0.1608906199845175, 0.11311146590548257, -0.08945364720808963, 0.1729422589763999, 0.018015885648007195, -0.024361049802973867, 0.16559979372347394, 0.2650139281215767, 0.11312811884175365, 0.22594263441084575, -0.08260409707775883, -0.034972803626442325, -0.29177624608079594, -0.16545468072096506, -0.19366459288964202, -0.06607669334237774, -0.060403642159265775, -0.18392653249514598, 0.4222177227338155, 0.2570142854315539, 0.15822146556262548, 0.1142844500951469, 0.3518591265815, 0.06656973607217272, 0.0832529076995949, 0.12530545638874174, 0.10759990954926858, 0.08610734125832095, 0.12919205718208104, -0.1499624934241486, 0.08251689927807698, 0.12612151767437657]
|
1,803.05261
|
Subnanosecond magnetization reversal of magnetic nanoparticle driven by
chirp microwave field pulse
|
We investigate the magnetization reversal of single-domain magnetic
nanoparticle driven by linear down-chirp microwave magnetic field pulse.
Numerical simulations based on the Landau-Lifshitz-Gilbert equation reveal that
solely down-chirp pulse is capable of inducing subnanosecond magnetization
reversal. With a certain range of initial frequency and chirp rate, the
required field amplitude is much smaller than that of constant-frequency
microwave field. The fast reversal is because the down-chirp microwave field
acts as an energy source and sink for the magnetic particle before and after
crossing over the energy barrier, respectively. Applying a spin-polarized
current additively to the system further reduces the microwave field amplitude.
Our findings provide a new way to realize low-cost and fast magnetization
reversal.
|
cond-mat.mes-hall
|
we investigate the magnetization reversal of singledomain magnetic nanoparticle driven by linear downchirp microwave magnetic field pulse numerical simulations based on the landaulifshitzgilbert equation reveal that solely downchirp pulse is capable of inducing subnanosecond magnetization reversal with a certain range of initial frequency and chirp rate the required field amplitude is much smaller than that of constantfrequency microwave field the fast reversal is because the downchirp microwave field acts as an energy source and sink for the magnetic particle before and after crossing over the energy barrier respectively applying a spinpolarized current additively to the system further reduces the microwave field amplitude our findings provide a new way to realize lowcost and fast magnetization reversal
|
[['we', 'investigate', 'the', 'magnetization', 'reversal', 'of', 'singledomain', 'magnetic', 'nanoparticle', 'driven', 'by', 'linear', 'downchirp', 'microwave', 'magnetic', 'field', 'pulse', 'numerical', 'simulations', 'based', 'on', 'the', 'landaulifshitzgilbert', 'equation', 'reveal', 'that', 'solely', 'downchirp', 'pulse', 'is', 'capable', 'of', 'inducing', 'subnanosecond', 'magnetization', 'reversal', 'with', 'a', 'certain', 'range', 'of', 'initial', 'frequency', 'and', 'chirp', 'rate', 'the', 'required', 'field', 'amplitude', 'is', 'much', 'smaller', 'than', 'that', 'of', 'constantfrequency', 'microwave', 'field', 'the', 'fast', 'reversal', 'is', 'because', 'the', 'downchirp', 'microwave', 'field', 'acts', 'as', 'an', 'energy', 'source', 'and', 'sink', 'for', 'the', 'magnetic', 'particle', 'before', 'and', 'after', 'crossing', 'over', 'the', 'energy', 'barrier', 'respectively', 'applying', 'a', 'spinpolarized', 'current', 'additively', 'to', 'the', 'system', 'further', 'reduces', 'the', 'microwave', 'field', 'amplitude', 'our', 'findings', 'provide', 'a', 'new', 'way', 'to', 'realize', 'lowcost', 'and', 'fast', 'magnetization', 'reversal']]
|
[-0.21344126902682625, 0.22063332731827953, -0.023494507001874887, 0.0015999288004620567, -0.109430428845403, -0.1130952884119166, 0.0414687512361485, 0.4132670178361561, -0.2717857893880295, -0.33410228383929835, 0.0470320067965709, -0.1877627449353104, -0.06148188059704135, 0.31547582723585, 0.05460386158007643, 0.00219939981141816, -0.0058112925080501514, 0.001273373492396153, -0.030351130741283944, -0.16538372377215874, 0.24606353787948257, 0.0932655504013857, 0.32567264483026837, 0.024572598136475554, 0.13425478052408638, 0.017402489412494976, 0.05707674183599327, 0.003753104797847893, -0.09312198146350135, 0.0039145439438035955, 0.14457646232989171, -0.004054543914516335, 0.19795588243590748, -0.5145723360874083, -0.21642659786663462, 0.06929598177337776, 0.14640111383658064, 0.17130556036920652, -0.10260741895813819, -0.2779976968370054, 0.0668470157229382, -0.11411270158284384, -0.12152108135025787, -0.08430294842135323, 0.005632330069277922, 0.06486381452743208, -0.2783918594303743, 0.09077975933399537, 0.06500164870123389, 0.07586433765194986, -0.08102874411674946, -0.02968532935331535, -0.04041374442977426, 0.011470319967433487, 0.05023521235460699, 0.1263846442386832, 0.21916524193695058, -0.10741162924753989, -0.1080590033903718, 0.2906690263715775, -0.08198237233737019, -0.10821731754619142, 0.0889626993291566, -0.1649248186863311, -0.0060900953456597485, 0.18013090201370094, 0.1155769139740859, 0.10167756385939276, -0.1362979172880802, 0.07681385060650824, 0.055741508993441644, 0.23382146249970664, 0.08271456542222397, 0.017934886953267067, 0.25964002465100394, 0.18993150684172694, 0.10735808098688722, 0.15281662950697153, -0.1461375499042966, -0.05609811649293355, -0.25109030509104385, -0.12346676946010278, -0.20500414325329272, 0.08848079768535884, -0.09153096066413285, -0.14787585821164692, 0.4398565114678248, 0.1637843877380795, 0.1285167345939123, -0.0028554873945920364, 0.34009994393943443, 0.17206495066132882, 0.0512669692767541, 0.061605938177798754, 0.22660665933204735, 0.19836707032974, 0.1589638999612678, -0.3382596591355927, 0.026567496368965215, -0.02467939126831682]
|
1,803.05262
|
Learning to Play General Video-Games via an Object Embedding Network
|
Deep reinforcement learning (DRL) has proven to be an effective tool for
creating general video-game AI. However most current DRL video-game agents
learn end-to-end from the video-output of the game, which is superfluous for
many applications and creates a number of additional problems. More
importantly, directly working on pixel-based raw video data is substantially
distinct from what a human player does.In this paper, we present a novel method
which enables DRL agents to learn directly from object information. This is
obtained via use of an object embedding network (OEN) that compresses a set of
object feature vectors of different lengths into a single fixed-length unified
feature vector representing the current game-state and fulfills the DRL
simultaneously. We evaluate our OEN-based DRL agent by comparing to several
state-of-the-art approaches on a selection of games from the GVG-AI
Competition. Experimental results suggest that our object-based DRL agent
yields performance comparable to that of those approaches used in our
comparative study.
|
cs.LG cs.AI
|
deep reinforcement learning drl has proven to be an effective tool for creating general videogame ai however most current drl videogame agents learn endtoend from the videooutput of the game which is superfluous for many applications and creates a number of additional problems more importantly directly working on pixelbased raw video data is substantially distinct from what a human player doesin this paper we present a novel method which enables drl agents to learn directly from object information this is obtained via use of an object embedding network oen that compresses a set of object feature vectors of different lengths into a single fixedlength unified feature vector representing the current gamestate and fulfills the drl simultaneously we evaluate our oenbased drl agent by comparing to several stateoftheart approaches on a selection of games from the gvgai competition experimental results suggest that our objectbased drl agent yields performance comparable to that of those approaches used in our comparative study
|
[['deep', 'reinforcement', 'learning', 'drl', 'has', 'proven', 'to', 'be', 'an', 'effective', 'tool', 'for', 'creating', 'general', 'videogame', 'ai', 'however', 'most', 'current', 'drl', 'videogame', 'agents', 'learn', 'endtoend', 'from', 'the', 'videooutput', 'of', 'the', 'game', 'which', 'is', 'superfluous', 'for', 'many', 'applications', 'and', 'creates', 'a', 'number', 'of', 'additional', 'problems', 'more', 'importantly', 'directly', 'working', 'on', 'pixelbased', 'raw', 'video', 'data', 'is', 'substantially', 'distinct', 'from', 'what', 'a', 'human', 'player', 'doesin', 'this', 'paper', 'we', 'present', 'a', 'novel', 'method', 'which', 'enables', 'drl', 'agents', 'to', 'learn', 'directly', 'from', 'object', 'information', 'this', 'is', 'obtained', 'via', 'use', 'of', 'an', 'object', 'embedding', 'network', 'oen', 'that', 'compresses', 'a', 'set', 'of', 'object', 'feature', 'vectors', 'of', 'different', 'lengths', 'into', 'a', 'single', 'fixedlength', 'unified', 'feature', 'vector', 'representing', 'the', 'current', 'gamestate', 'and', 'fulfills', 'the', 'drl', 'simultaneously', 'we', 'evaluate', 'our', 'oenbased', 'drl', 'agent', 'by', 'comparing', 'to', 'several', 'stateoftheart', 'approaches', 'on', 'a', 'selection', 'of', 'games', 'from', 'the', 'gvgai', 'competition', 'experimental', 'results', 'suggest', 'that', 'our', 'objectbased', 'drl', 'agent', 'yields', 'performance', 'comparable', 'to', 'that', 'of', 'those', 'approaches', 'used', 'in', 'our', 'comparative', 'study']]
|
[-0.022482970220720176, 0.0094843826503508, -0.1274130273120502, 0.039741567249467306, -0.14024103425939072, -0.18853010354274824, 0.041582480137986315, 0.44130858863619243, -0.279462852183421, -0.3087280787612227, 0.028589976451045218, -0.2610600008674619, -0.18925398666798682, 0.19696659761686602, -0.1266756361447178, 0.04788527263452408, 0.12791711367612293, 0.059048798168078065, -0.003876767627737642, -0.2713894604330326, 0.337272339471761, -0.0031721505229497424, 0.3190404440687558, -0.017967425592171102, 0.1648588353554815, 0.007129975234750997, 0.0014496926375507533, 0.016506717161595966, -0.049989672225713655, 0.21509818468158218, 0.33404511418919286, 0.2316687186762642, 0.3487085102733781, -0.4285419736323612, -0.22411188481877523, 0.08324353259310803, 0.14820571539488125, 0.13150393420546133, -0.05629646283917979, -0.3408278502560184, 0.10553685863473598, -0.18640236946313443, 0.01395058718376926, -0.12696723652920042, -0.026438790768106745, -0.03205021679501182, -0.3070963091011365, -0.0639958114753698, 0.07644885045563381, 0.041358537347563964, -0.07708555040427471, -0.12992864630000617, 0.057771776331506985, 0.18849427083374135, 0.027890917090638602, 0.10100299048361477, 0.16722845345396886, -0.21014935241866814, -0.17381119703595804, 0.3602027671242302, -0.05639219660063988, -0.16538279515112048, 0.22014742043449895, 0.00973643111322051, -0.13207946703224988, 0.10111504900208734, 0.20649195323674033, 0.14023217049959516, -0.16996543151749807, -0.007143813320707723, -0.07344871745202933, 0.194343313090987, 0.010903036958906896, -0.009655144481009549, 0.19700788813733872, 0.24751141599633478, 0.08179791796273649, 0.12722014410454513, -0.06788571020769706, -0.1273073895665055, -0.21061638935602137, -0.12198202642642397, -0.18176070262538874, -0.006335739762969799, -0.1063647786691685, -0.10172717173961021, 0.40895244012308585, 0.2619933474796836, 0.21711086490578563, 0.11334455857758695, 0.36101184233527195, 0.02905357204381053, 0.11121347064436594, 0.07674869058605333, 0.21373578283161698, -0.016211472498555365, 0.11549829611594051, -0.17595713911729247, 0.0988972694900298, 0.035723723306368985]
|
1,803.05263
|
Feature Selective Small Object Detection via Knowledge-based Recurrent
Attentive Neural Network
|
At present, the performance of deep neural network in general object
detection is comparable to or even surpasses that of human beings. However, due
to the limitations of deep learning itself, the small proportion of feature
pixels, and the occurence of blur and occlusion, the detection of small objects
in complex scenes is still an open question. But we can not deny that real-time
and accurate object detection is fundamental to automatic perception and
subsequent perception-based decision-making and planning tasks of autonomous
driving.
Considering the characteristics of small objects in autonomous driving scene,
we proposed a novel method named KB-RANN, which based on domain knowledge,
intuitive experience and feature attentive selection. It can focus on
particular parts of image features, and then it tries to stress the importance
of these features and strengthenes the learning parameters of them. Our
comparative experiments on KITTI and COCO datasets show that our proposed
method can achieve considerable results both in speed and accuracy, and can
improve the effect of small object detection through self-selection of
important features and continuous enhancement of proposed method, and deployed
it in our self-developed autonomous driving car.
|
cs.CV cs.AI
|
at present the performance of deep neural network in general object detection is comparable to or even surpasses that of human beings however due to the limitations of deep learning itself the small proportion of feature pixels and the occurence of blur and occlusion the detection of small objects in complex scenes is still an open question but we can not deny that realtime and accurate object detection is fundamental to automatic perception and subsequent perceptionbased decisionmaking and planning tasks of autonomous driving considering the characteristics of small objects in autonomous driving scene we proposed a novel method named kbrann which based on domain knowledge intuitive experience and feature attentive selection it can focus on particular parts of image features and then it tries to stress the importance of these features and strengthenes the learning parameters of them our comparative experiments on kitti and coco datasets show that our proposed method can achieve considerable results both in speed and accuracy and can improve the effect of small object detection through selfselection of important features and continuous enhancement of proposed method and deployed it in our selfdeveloped autonomous driving car
|
[['at', 'present', 'the', 'performance', 'of', 'deep', 'neural', 'network', 'in', 'general', 'object', 'detection', 'is', 'comparable', 'to', 'or', 'even', 'surpasses', 'that', 'of', 'human', 'beings', 'however', 'due', 'to', 'the', 'limitations', 'of', 'deep', 'learning', 'itself', 'the', 'small', 'proportion', 'of', 'feature', 'pixels', 'and', 'the', 'occurence', 'of', 'blur', 'and', 'occlusion', 'the', 'detection', 'of', 'small', 'objects', 'in', 'complex', 'scenes', 'is', 'still', 'an', 'open', 'question', 'but', 'we', 'can', 'not', 'deny', 'that', 'realtime', 'and', 'accurate', 'object', 'detection', 'is', 'fundamental', 'to', 'automatic', 'perception', 'and', 'subsequent', 'perceptionbased', 'decisionmaking', 'and', 'planning', 'tasks', 'of', 'autonomous', 'driving', 'considering', 'the', 'characteristics', 'of', 'small', 'objects', 'in', 'autonomous', 'driving', 'scene', 'we', 'proposed', 'a', 'novel', 'method', 'named', 'kbrann', 'which', 'based', 'on', 'domain', 'knowledge', 'intuitive', 'experience', 'and', 'feature', 'attentive', 'selection', 'it', 'can', 'focus', 'on', 'particular', 'parts', 'of', 'image', 'features', 'and', 'then', 'it', 'tries', 'to', 'stress', 'the', 'importance', 'of', 'these', 'features', 'and', 'strengthenes', 'the', 'learning', 'parameters', 'of', 'them', 'our', 'comparative', 'experiments', 'on', 'kitti', 'and', 'coco', 'datasets', 'show', 'that', 'our', 'proposed', 'method', 'can', 'achieve', 'considerable', 'results', 'both', 'in', 'speed', 'and', 'accuracy', 'and', 'can', 'improve', 'the', 'effect', 'of', 'small', 'object', 'detection', 'through', 'selfselection', 'of', 'important', 'features', 'and', 'continuous', 'enhancement', 'of', 'proposed', 'method', 'and', 'deployed', 'it', 'in', 'our', 'selfdeveloped', 'autonomous', 'driving', 'car']]
|
[-0.07042323169796504, 0.02004151434812229, -0.07530679872488594, 0.029483774677852796, -0.125538184819245, -0.13873012925069877, 0.04150549680826299, 0.44310193182153496, -0.23061105688127445, -0.35866876830033123, 0.09311712646475909, -0.25443021137327115, -0.21919949841436576, 0.2209258586850595, -0.17971608738718745, 0.07922890481855321, 0.15377989885357413, 0.06162015400468347, -0.00847855173076259, -0.25968698210227376, 0.3003283234183642, 0.043409939048211665, 0.33408807125938605, 0.09426256283254855, 0.17087255486904737, -0.02114105109812662, -0.049439887584680146, -0.011714155041801937, 0.0024399205097660327, 0.15811692339507147, 0.306660628785444, 0.1730880093621339, 0.2986607549489192, -0.4010111677141631, -0.2171193474983388, 0.08224244597542255, 0.1461749346329168, 0.0786975767616124, -0.046070280397699316, -0.39195753529388955, 0.1015842545410532, -0.15020745177644323, -0.01903906212820806, -0.13924284091089817, 0.029634083048465418, -0.013488441741499891, -0.25212547250022305, 0.03630789561336611, 0.11914325766713622, 0.05278831911721531, -0.08130660110257845, -0.07338360248987667, 0.030176797767797296, 0.21359570785475407, 0.04014528720679489, 0.028825467888186164, 0.185308465701752, -0.25317579748875957, -0.11751268859604065, 0.3981428006315295, -0.059109105858055344, -0.20095601905355812, 0.2555141307172032, -0.06569456286170584, -0.1370994942935114, 0.10338867374354685, 0.24151254506572523, 0.14776689074385693, -0.11648357772631919, -0.021058170562224053, -0.015629691642056652, 0.17677524789512894, 0.03822802539689486, -0.0008967858748535381, 0.19599731964865988, 0.2662234626309498, 0.04348469164999411, 0.10449602261165725, -0.17671987877048698, -0.06506980479107223, -0.21377001923289807, -0.11069125665734923, -0.18122028818485988, -0.04399582164797541, -0.08934201999188632, -0.12556701997309963, 0.3926616036905882, 0.28382025621233775, 0.1916815621808251, 0.044703633866252944, 0.3750914463419766, 0.03329045593895436, 0.10133310755774538, 0.06926757177178633, 0.22978706652408137, -0.024920663681506295, 0.10749896514642844, -0.21666928164020957, 0.1005543235064214, 0.026449565644958678]
|
1,803.05264
|
Towards Almost Global Synchronization on the Stiefel Manifold
|
A graph $\mathcal{G}$ is referred to as $\mathsf{S}^1$-synchronizing if,
roughly speaking, the Kuramoto-like model whose interaction topology is given
by $\mathcal{G}$ synchronizes almost globally. The Kuramoto model evolves on
the unit circle, \ie the $1$-sphere $\mathsf{S}^1$. This paper concerns
generalizations of the Kuramoto-like model and the concept of synchronizing
graphs on the Stiefel manifold $\mathsf{St}(p,n)$. Previous work on state-space
oscillators have largely been influenced by results and techniques that pertain
to the $\mathsf{S}^1$-case. It has recently been shown that all connected
graphs are $\mathsf{S}^n$-synchronizing for all $n\geq2$. The previous point of
departure may thus have been overly conservative. The $n$-sphere is a special
case of the Stiefel manifold, namely $\mathsf{St}(1,n+1)$. As such, it is
natural to ask for the extent to which the results on $\mathsf{S}^{n}$ can be
extended to the Stiefel manifold. This paper shows that all connected graphs
are $\mathsf{St}(p,n)$-synchronizing provided the pair $(p,n)$ satisfies $p\leq
\tfrac{2n}{3}-1$.
|
math.OC
|
a graph mathcalg is referred to as mathsfs1synchronizing if roughly speaking the kuramotolike model whose interaction topology is given by mathcalg synchronizes almost globally the kuramoto model evolves on the unit circle ie the 1sphere mathsfs1 this paper concerns generalizations of the kuramotolike model and the concept of synchronizing graphs on the stiefel manifold mathsfstpn previous work on statespace oscillators have largely been influenced by results and techniques that pertain to the mathsfs1case it has recently been shown that all connected graphs are mathsfsnsynchronizing for all ngeq2 the previous point of departure may thus have been overly conservative the nsphere is a special case of the stiefel manifold namely mathsfst1n1 as such it is natural to ask for the extent to which the results on mathsfsn can be extended to the stiefel manifold this paper shows that all connected graphs are mathsfstpnsynchronizing provided the pair pn satisfies pleq tfrac2n31
|
[['a', 'graph', 'mathcalg', 'is', 'referred', 'to', 'as', 'mathsfs1synchronizing', 'if', 'roughly', 'speaking', 'the', 'kuramotolike', 'model', 'whose', 'interaction', 'topology', 'is', 'given', 'by', 'mathcalg', 'synchronizes', 'almost', 'globally', 'the', 'kuramoto', 'model', 'evolves', 'on', 'the', 'unit', 'circle', 'ie', 'the', '1sphere', 'mathsfs1', 'this', 'paper', 'concerns', 'generalizations', 'of', 'the', 'kuramotolike', 'model', 'and', 'the', 'concept', 'of', 'synchronizing', 'graphs', 'on', 'the', 'stiefel', 'manifold', 'mathsfstpn', 'previous', 'work', 'on', 'statespace', 'oscillators', 'have', 'largely', 'been', 'influenced', 'by', 'results', 'and', 'techniques', 'that', 'pertain', 'to', 'the', 'mathsfs1case', 'it', 'has', 'recently', 'been', 'shown', 'that', 'all', 'connected', 'graphs', 'are', 'mathsfsnsynchronizing', 'for', 'all', 'ngeq2', 'the', 'previous', 'point', 'of', 'departure', 'may', 'thus', 'have', 'been', 'overly', 'conservative', 'the', 'nsphere', 'is', 'a', 'special', 'case', 'of', 'the', 'stiefel', 'manifold', 'namely', 'mathsfst1n1', 'as', 'such', 'it', 'is', 'natural', 'to', 'ask', 'for', 'the', 'extent', 'to', 'which', 'the', 'results', 'on', 'mathsfsn', 'can', 'be', 'extended', 'to', 'the', 'stiefel', 'manifold', 'this', 'paper', 'shows', 'that', 'all', 'connected', 'graphs', 'are', 'mathsfstpnsynchronizing', 'provided', 'the', 'pair', 'pn', 'satisfies', 'pleq', 'tfrac2n31']]
|
[-0.152853437698546, 0.08940321410274399, -0.05234404721164278, 0.03891745760338381, -0.09313901474400024, -0.1409688106871077, -0.026289676662833827, 0.38723264213352065, -0.2621700887002849, -0.26746338084340093, 0.13826697251227285, -0.28245775987161326, -0.1992933249283981, 0.19695819207201046, -0.1296812711774172, 0.03347107219243688, 0.0691905656164246, 0.1136418494861573, -0.0021931984112598, -0.27024271076516015, 0.3841108151645001, 0.01665955986827612, 0.2471385470059301, 0.03788453999441117, 0.11406651505136065, -0.04409000896848738, 0.01642481609181102, 0.05951958211641925, -0.11518614508256309, 0.07471480111458471, 0.22061723981959014, 0.12089234500391675, 0.252494772204331, -0.39207861274148204, -0.25274023779534865, 0.18505766453620578, 0.15400596010232612, 0.041714428716139604, 0.0351734213896894, -0.28330944868835756, 0.11094207648254399, -0.13764227460238285, -0.10790952137072704, -0.047969535218518496, 0.04180602009541222, 0.02600603328984497, -0.23927405849431774, -0.019173765142581293, 0.13855254737593767, 0.005997619568370282, -0.02396242913257863, -0.08768646203513657, -0.067313668540945, 0.132612027740106, 0.021606677013083494, 0.09597798738229488, 0.07873893865450685, -0.02884795930170055, -0.12105838700704875, 0.3851791455343898, -0.02649653186755521, -0.25428434505260417, 0.15439012585806527, -0.11190177233157945, -0.1844347758850615, 0.07836224175740167, 0.1406257610630876, 0.13017214625142515, -0.11461323382599013, 0.14460543226367528, -0.11774237416352012, 0.11895788155400494, 0.05681502179774855, -0.008968541646442776, 0.14953242534372424, 0.16837149203555393, 0.13590049231092313, 0.12644921655924657, 0.003226006107537874, -0.11917755068778725, -0.2502266942390374, -0.1021142293857078, -0.20920036693652427, 0.08758433712147443, -0.07100436100382856, -0.16479866263252915, 0.39418627158073444, 0.10188564247135738, 0.20032127656907375, 0.08912101401365362, 0.2529966378218627, 0.09917291558979612, 0.05828968837990293, 0.10127975250527795, 0.22127040124115802, 0.15637359427886882, 0.023416473427122192, -0.12383094524183044, 0.07319631923622053, 0.09433749371341296]
|
1,803.05265
|
Rotation-Sensitive Regression for Oriented Scene Text Detection
|
Text in natural images is of arbitrary orientations, requiring detection in
terms of oriented bounding boxes. Normally, a multi-oriented text detector
often involves two key tasks: 1) text presence detection, which is a
classification problem disregarding text orientation; 2) oriented bounding box
regression, which concerns about text orientation. Previous methods rely on
shared features for both tasks, resulting in degraded performance due to the
incompatibility of the two tasks. To address this issue, we propose to perform
classification and regression on features of different characteristics,
extracted by two network branches of different designs. Concretely, the
regression branch extracts rotation-sensitive features by actively rotating the
convolutional filters, while the classification branch extracts
rotation-invariant features by pooling the rotation-sensitive features. The
proposed method named Rotation-sensitive Regression Detector (RRD) achieves
state-of-the-art performance on three oriented scene text benchmark datasets,
including ICDAR 2015, MSRA-TD500, RCTW-17 and COCO-Text. Furthermore, RRD
achieves a significant improvement on a ship collection dataset, demonstrating
its generality on oriented object detection.
|
cs.CV
|
text in natural images is of arbitrary orientations requiring detection in terms of oriented bounding boxes normally a multioriented text detector often involves two key tasks 1 text presence detection which is a classification problem disregarding text orientation 2 oriented bounding box regression which concerns about text orientation previous methods rely on shared features for both tasks resulting in degraded performance due to the incompatibility of the two tasks to address this issue we propose to perform classification and regression on features of different characteristics extracted by two network branches of different designs concretely the regression branch extracts rotationsensitive features by actively rotating the convolutional filters while the classification branch extracts rotationinvariant features by pooling the rotationsensitive features the proposed method named rotationsensitive regression detector rrd achieves stateoftheart performance on three oriented scene text benchmark datasets including icdar 2015 msratd500 rctw17 and cocotext furthermore rrd achieves a significant improvement on a ship collection dataset demonstrating its generality on oriented object detection
|
[['text', 'in', 'natural', 'images', 'is', 'of', 'arbitrary', 'orientations', 'requiring', 'detection', 'in', 'terms', 'of', 'oriented', 'bounding', 'boxes', 'normally', 'a', 'multioriented', 'text', 'detector', 'often', 'involves', 'two', 'key', 'tasks', '1', 'text', 'presence', 'detection', 'which', 'is', 'a', 'classification', 'problem', 'disregarding', 'text', 'orientation', '2', 'oriented', 'bounding', 'box', 'regression', 'which', 'concerns', 'about', 'text', 'orientation', 'previous', 'methods', 'rely', 'on', 'shared', 'features', 'for', 'both', 'tasks', 'resulting', 'in', 'degraded', 'performance', 'due', 'to', 'the', 'incompatibility', 'of', 'the', 'two', 'tasks', 'to', 'address', 'this', 'issue', 'we', 'propose', 'to', 'perform', 'classification', 'and', 'regression', 'on', 'features', 'of', 'different', 'characteristics', 'extracted', 'by', 'two', 'network', 'branches', 'of', 'different', 'designs', 'concretely', 'the', 'regression', 'branch', 'extracts', 'rotationsensitive', 'features', 'by', 'actively', 'rotating', 'the', 'convolutional', 'filters', 'while', 'the', 'classification', 'branch', 'extracts', 'rotationinvariant', 'features', 'by', 'pooling', 'the', 'rotationsensitive', 'features', 'the', 'proposed', 'method', 'named', 'rotationsensitive', 'regression', 'detector', 'rrd', 'achieves', 'stateoftheart', 'performance', 'on', 'three', 'oriented', 'scene', 'text', 'benchmark', 'datasets', 'including', 'icdar', '2015', 'msratd500', 'rctw17', 'and', 'cocotext', 'furthermore', 'rrd', 'achieves', 'a', 'significant', 'improvement', 'on', 'a', 'ship', 'collection', 'dataset', 'demonstrating', 'its', 'generality', 'on', 'oriented', 'object', 'detection']]
|
[-0.09365004266728646, -0.04566171473707072, -0.02506755264621461, 0.022898612778953976, -0.10729408669576515, -0.1965840168093564, -0.010086420294828712, 0.4294807720463723, -0.22821321053270366, -0.3529617074877024, 0.08749645999487257, -0.32998212928068826, -0.13736909271465264, 0.19414715868188068, -0.16785104762529954, 0.08326265918476565, 0.1582634008489549, 0.05789321379270405, -0.05791489529947284, -0.2939886683343502, 0.3080262332034181, -0.018357508382177912, 0.38576187291910174, 0.010126862561082816, 0.16071991646604147, -0.017810911050764842, -0.07413458183873445, -0.015923197044321567, -0.028526045664330014, 0.17192379199477728, 0.3176124679564964, 0.1753747807320906, 0.2580314821563661, -0.33728739586658774, -0.21583734368323348, 0.033463944116374475, 0.1547221763183188, 0.059277191859382586, -0.013175311506347497, -0.3703852159465896, 0.09412760380000691, -0.10339833890757291, 0.07093636403733398, -0.09437999142228364, 0.015603653889411363, -0.04535085070856439, -0.2620906734977325, 0.06617374236957403, 0.14051404709462076, 0.11148999642318813, -0.013953033235884505, -0.14807368959154701, 0.03432963580999058, 0.15651589543849695, 0.015840437405131524, 0.07295396155968774, 0.1650998991332017, -0.21115465092443628, -0.18486229060217738, 0.362705176603049, -0.050861556379823016, -0.2510202427918557, 0.19541712824429852, -0.020075227829511277, -0.16074878493673167, 0.10875841139350087, 0.23753631721192506, 0.13879448567749933, -0.12749156795580346, -0.011112890752701787, -0.05444556256989017, 0.19498072450223844, 0.1281905080366414, -0.02694217811804265, 0.1961440189537825, 0.26150151075125905, 0.013158354960614816, 0.15168951125233435, -0.21801886002504034, -0.035548140592436536, -0.20677726463181897, -0.08423119646322448, -0.17791537789744324, -0.07462370202265448, -0.12678560263284452, -0.15561812073574402, 0.43266639003995805, 0.19950471121264854, 0.2204559746925952, 0.08151311444089515, 0.3467240833095275, -0.041491071839118376, 0.09800285357923713, 0.08467099769914058, 0.15404577524604973, 0.003313968230213504, 0.08276820753744688, -0.1491443782710121, 0.08352494601276703, 0.0995404113564291]
|
1,803.05266
|
On the Applicability of Registration Uncertainty
|
Estimating the uncertainty in (probabilistic) image registration enables,
e.g., surgeons to assess the operative risk based on the trustworthiness of the
registered image data. If surgeons receive inaccurately calculated registration
uncertainty and misplace unwarranted confidence in the alignment solutions,
severe consequences may result. For probabilistic image registration (PIR), the
predominant way to quantify the registration uncertainty is using summary
statistics of the distribution of transformation parameters. The majority of
existing research focuses on trying out different summary statistics as well as
a means to exploit them. Distinctively, in this paper, we study two rarely
examined topics: (1) whether those summary statistics of the transformation
distribution most informatively represent the registration uncertainty; (2)
Does utilizing the registration uncertainty always be beneficial. We show that
there are two types of uncertainties: the transformation uncertainty, Ut, and
label uncertainty Ul. The conventional way of using Ut to quantify Ul is
inappropriate and can be misleading. By a real data experiment, we also share a
potentially critical finding that making use of the registration uncertainty
may not always be an improvement.
|
cs.CV
|
estimating the uncertainty in probabilistic image registration enables eg surgeons to assess the operative risk based on the trustworthiness of the registered image data if surgeons receive inaccurately calculated registration uncertainty and misplace unwarranted confidence in the alignment solutions severe consequences may result for probabilistic image registration pir the predominant way to quantify the registration uncertainty is using summary statistics of the distribution of transformation parameters the majority of existing research focuses on trying out different summary statistics as well as a means to exploit them distinctively in this paper we study two rarely examined topics 1 whether those summary statistics of the transformation distribution most informatively represent the registration uncertainty 2 does utilizing the registration uncertainty always be beneficial we show that there are two types of uncertainties the transformation uncertainty ut and label uncertainty ul the conventional way of using ut to quantify ul is inappropriate and can be misleading by a real data experiment we also share a potentially critical finding that making use of the registration uncertainty may not always be an improvement
|
[['estimating', 'the', 'uncertainty', 'in', 'probabilistic', 'image', 'registration', 'enables', 'eg', 'surgeons', 'to', 'assess', 'the', 'operative', 'risk', 'based', 'on', 'the', 'trustworthiness', 'of', 'the', 'registered', 'image', 'data', 'if', 'surgeons', 'receive', 'inaccurately', 'calculated', 'registration', 'uncertainty', 'and', 'misplace', 'unwarranted', 'confidence', 'in', 'the', 'alignment', 'solutions', 'severe', 'consequences', 'may', 'result', 'for', 'probabilistic', 'image', 'registration', 'pir', 'the', 'predominant', 'way', 'to', 'quantify', 'the', 'registration', 'uncertainty', 'is', 'using', 'summary', 'statistics', 'of', 'the', 'distribution', 'of', 'transformation', 'parameters', 'the', 'majority', 'of', 'existing', 'research', 'focuses', 'on', 'trying', 'out', 'different', 'summary', 'statistics', 'as', 'well', 'as', 'a', 'means', 'to', 'exploit', 'them', 'distinctively', 'in', 'this', 'paper', 'we', 'study', 'two', 'rarely', 'examined', 'topics', '1', 'whether', 'those', 'summary', 'statistics', 'of', 'the', 'transformation', 'distribution', 'most', 'informatively', 'represent', 'the', 'registration', 'uncertainty', '2', 'does', 'utilizing', 'the', 'registration', 'uncertainty', 'always', 'be', 'beneficial', 'we', 'show', 'that', 'there', 'are', 'two', 'types', 'of', 'uncertainties', 'the', 'transformation', 'uncertainty', 'ut', 'and', 'label', 'uncertainty', 'ul', 'the', 'conventional', 'way', 'of', 'using', 'ut', 'to', 'quantify', 'ul', 'is', 'inappropriate', 'and', 'can', 'be', 'misleading', 'by', 'a', 'real', 'data', 'experiment', 'we', 'also', 'share', 'a', 'potentially', 'critical', 'finding', 'that', 'making', 'use', 'of', 'the', 'registration', 'uncertainty', 'may', 'not', 'always', 'be', 'an', 'improvement']]
|
[-0.06951717629090126, 0.017329910916321915, -0.09939102753097276, 0.1324415401216935, -0.10619279686149886, -0.13491148740021427, 0.06660808607557556, 0.4118276718231341, -0.27105717697850196, -0.35839121658566664, 0.12985778398962627, -0.2858540312233593, -0.12235102953854948, 0.17323748148456533, -0.15605330003679477, 0.07289605224253716, 0.09559425721156666, 0.02823528491915733, -0.08672372681162828, -0.23720335433873432, 0.2918790567412295, 0.07120347391438289, 0.346440047073305, 0.013475712682107273, 0.06743312626415653, 0.03451477449694225, -0.07491688580590893, 0.002289122975277926, -0.09419386226008183, 0.1409151462536432, 0.3201875436140902, 0.20951960744092835, 0.28759763068360783, -0.3867356616789369, -0.2022827050095657, 0.140544213791145, 0.1351071062674898, 0.08047018370548771, -0.016448741651732813, -0.30318633301596326, 0.032125384450906, -0.15315686011771587, -0.029837691641825422, -0.07375607830842702, -0.014831583468052982, -0.003656448289720257, -0.2841955993049355, 0.09090266209785693, 0.03785218768925089, 0.06609482333243993, -0.02657487223967275, -0.11055482144266451, -0.0029933536412003873, 0.18869673132377845, 0.07013228112753661, 0.03571405034612822, 0.1561153337137181, -0.1286390600236535, -0.09477958545771385, 0.4095027200105092, 0.00531269215174358, -0.23752583610952238, 0.14145576022829945, -0.1150844945514109, -0.1647773594674866, 0.09663868288573046, 0.18016134506483053, 0.046949202590357425, -0.21185341479246167, -0.027185803703601283, 0.011204743210162798, 0.18961240913565483, 0.058213464145823804, 0.0029016994416121056, 0.19243378694359722, 0.15828856178400616, 0.052488442647948184, 0.09541665809295162, -0.15310204304395567, -0.06092150315420109, -0.2900195444553075, -0.1264123823387887, -0.1779905924535838, 0.016264214857818097, -0.08808225478663768, -0.1056610027550381, 0.3528581055473875, 0.2574926103896525, 0.1894710720252161, 0.02349162102010186, 0.3059982674471526, 0.09567931360189422, 0.049342127265514464, 0.04312644828513095, 0.22858318183584328, 0.039769114044082184, 0.047915889394723556, -0.15353803376439662, 0.1327823071359572, 0.013678932117975572]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.