id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0856 | Teaching students about informatics and astronomy using real data for
detection of asteroids | In this paper we approach the astronomy teaching process for the students in
computer sciences through the controlled investigation method on real
astronomical data, using data reduction and quality control of the astrometry
of near-Earth asteroids. The method used the data collected on the Isaac Newton
Telescope (INT) located at the ORM observatory on the island of La Palma in the
Spanish Canary Islands and was successfully tested on a group of students in
the second-year of study.
| astro-ph.IM | in this paper we approach the astronomy teaching process for the students in computer sciences through the controlled investigation method on real astronomical data using data reduction and quality control of the astrometry of nearearth asteroids the method used the data collected on the isaac newton telescope int located at the orm observatory on the island of la palma in the spanish canary islands and was successfully tested on a group of students in the secondyear of study | [['in', 'this', 'paper', 'we', 'approach', 'the', 'astronomy', 'teaching', 'process', 'for', 'the', 'students', 'in', 'computer', 'sciences', 'through', 'the', 'controlled', 'investigation', 'method', 'on', 'real', 'astronomical', 'data', 'using', 'data', 'reduction', 'and', 'quality', 'control', 'of', 'the', 'astrometry', 'of', 'nearearth', 'asteroids', 'the', 'method', 'used', 'the', 'data', 'collected', 'on', 'the', 'isaac', 'newton', 'telescope', 'int', 'located', 'at', 'the', 'orm', 'observatory', 'on', 'the', 'island', 'of', 'la', 'palma', 'in', 'the', 'spanish', 'canary', 'islands', 'and', 'was', 'successfully', 'tested', 'on', 'a', 'group', 'of', 'students', 'in', 'the', 'secondyear', 'of', 'study']] | [-0.046647635145256154, 0.04828952184209648, -0.13473339348386687, 0.054529151595045566, -0.09009963078782536, -0.048432283267641485, 0.057934060419658914, 0.33591751878460246, -0.17088707443326712, -0.4164769590760653, 0.1359037472627675, -0.3189451862902691, -0.1429362547201797, 0.2991143348507392, -0.11687445837574509, 0.01843067483069041, 0.15053380921987505, -0.03604981494255555, 0.022065810166681424, -0.33028496398280066, 0.2808871420327192, 0.1666152332073603, 0.33672077710238785, -0.05516226276850853, 0.15817054159169158, 0.005298863242690762, -0.0679733352496838, -0.044433517751689904, -0.12782319664405897, 0.137333761035011, 0.32349256307591134, 0.1584861205998235, 0.30305790381718023, -0.4033504948975184, -0.08008510816412476, -0.0019095144712199003, 0.04996081088215877, -0.010353337471874861, -0.026087005762980342, -0.40693641711886114, 0.007428122290338461, -0.107935274693703, -0.1447166304047315, 0.03868227822180742, -0.0324480503033369, 0.015413770425276687, -0.17798050025997397, -0.04498401869279452, -0.06048386303994518, 0.2306284960717536, -0.09206654052309787, -0.13518301822328702, -0.013671134504525421, 0.16878215508320585, -0.011587776323908772, 0.02092668266954999, 0.10815309516440791, -0.06860083172945544, -0.07778340369128646, 0.3716538929117796, -0.08044090013031681, -0.04232387396041304, 0.17102486762003258, -0.20563970456043115, -0.19842959061647072, 0.06829071739831796, 0.29443153910912, 0.13937311430867666, -0.16816055224850202, 0.15971717429317486, -0.0028787609667350086, 0.1562485473905093, 0.07627946698369506, -0.09576630749357626, 0.16172998264814034, 0.20359797840818572, 0.015862895844456475, 0.05521208400097795, -0.21655811607025754, -0.07063757877898379, -0.24255283674649084, -0.19960041442074072, -0.2177859712869693, -0.038425348370741956, -0.025304643514503438, -0.10639392262778412, 0.37315594752390796, 0.16854788353427863, 0.07010746340697202, -0.04071887271502652, 0.2712867368394748, 0.002632861718153342, 0.09223178788446464, 0.05180138240281779, 0.25527056988376456, 0.01984409467341044, 0.23343383902325654, -0.2260469375178218, 0.03331062365442705, 0.053070946130901575] |
1,802.08561 | Personalized Gaussian Processes for Forecasting of Alzheimer's Disease
Assessment Scale-Cognition Sub-Scale (ADAS-Cog13) | In this paper, we introduce the use of a personalized Gaussian Process model
(pGP) to predict per-patient changes in ADAS-Cog13 -- a significant predictor
of Alzheimer's Disease (AD) in the cognitive domain -- using data from each
patient's previous visits, and testing on future (held-out) data. We start by
learning a population-level model using multi-modal data from previously seen
patients using a base Gaussian Process (GP) regression. The personalized GP
(pGP) is formed by adapting the base GP sequentially over time to a new
(target) patient using domain adaptive GPs. We extend this personalized
approach to predict the values of ADAS-Cog13 over the future 6, 12, 18, and 24
months. We compare this approach to a GP model trained only on past data of the
target patients (tGP), as well as to a new approach that combines pGP with tGP.
We find that the new approach, combining pGP with tGP, leads to large
improvements in accurately forecasting future ADAS-Cog13 scores.
| cs.LG stat.AP | in this paper we introduce the use of a personalized gaussian process model pgp to predict perpatient changes in adascog13 a significant predictor of alzheimers disease ad in the cognitive domain using data from each patients previous visits and testing on future heldout data we start by learning a populationlevel model using multimodal data from previously seen patients using a base gaussian process gp regression the personalized gp pgp is formed by adapting the base gp sequentially over time to a new target patient using domain adaptive gps we extend this personalized approach to predict the values of adascog13 over the future 6 12 18 and 24 months we compare this approach to a gp model trained only on past data of the target patients tgp as well as to a new approach that combines pgp with tgp we find that the new approach combining pgp with tgp leads to large improvements in accurately forecasting future adascog13 scores | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'use', 'of', 'a', 'personalized', 'gaussian', 'process', 'model', 'pgp', 'to', 'predict', 'perpatient', 'changes', 'in', 'adascog13', 'a', 'significant', 'predictor', 'of', 'alzheimers', 'disease', 'ad', 'in', 'the', 'cognitive', 'domain', 'using', 'data', 'from', 'each', 'patients', 'previous', 'visits', 'and', 'testing', 'on', 'future', 'heldout', 'data', 'we', 'start', 'by', 'learning', 'a', 'populationlevel', 'model', 'using', 'multimodal', 'data', 'from', 'previously', 'seen', 'patients', 'using', 'a', 'base', 'gaussian', 'process', 'gp', 'regression', 'the', 'personalized', 'gp', 'pgp', 'is', 'formed', 'by', 'adapting', 'the', 'base', 'gp', 'sequentially', 'over', 'time', 'to', 'a', 'new', 'target', 'patient', 'using', 'domain', 'adaptive', 'gps', 'we', 'extend', 'this', 'personalized', 'approach', 'to', 'predict', 'the', 'values', 'of', 'adascog13', 'over', 'the', 'future', '6', '12', '18', 'and', '24', 'months', 'we', 'compare', 'this', 'approach', 'to', 'a', 'gp', 'model', 'trained', 'only', 'on', 'past', 'data', 'of', 'the', 'target', 'patients', 'tgp', 'as', 'well', 'as', 'to', 'a', 'new', 'approach', 'that', 'combines', 'pgp', 'with', 'tgp', 'we', 'find', 'that', 'the', 'new', 'approach', 'combining', 'pgp', 'with', 'tgp', 'leads', 'to', 'large', 'improvements', 'in', 'accurately', 'forecasting', 'future', 'adascog13', 'scores']] | [0.0052175903233112235, -0.0030250545950001404, -0.07122329363575691, 0.06457725872229032, -0.10748114818885068, -0.17367931050515384, 0.12223333973366364, 0.42233319006338244, -0.25469074688353543, -0.28013883485713864, 0.09683399729335763, -0.25921023001146926, -0.1988957309072161, 0.20660028064024344, -0.12893090164103505, 0.05946403701434128, 0.1188372064880125, 0.05323998029136164, -0.031149435542215397, -0.2823322846681757, 0.2978581749258717, 0.0466987163741972, 0.29566649791553234, -0.036310616985948126, 0.11656315561538194, 0.03641917867360601, -0.06423573136021188, -0.023837899175253075, -0.08714685676191937, 0.17245460391178272, 0.3257706933328585, 0.217415251419138, 0.3502986434443741, -0.39482896007407625, -0.2791818084824047, 0.10265712643777773, 0.10753291179752274, 0.11083206270856985, 0.0011068920213373223, -0.31672098195761633, 0.0933688629487571, -0.212324675409847, -0.0673118379429742, -0.09137817763480222, -0.04995397060433296, 0.016438198388571953, -0.33519997014693775, 0.07646398210992954, -0.008132731514555775, 0.09244852336894745, -0.09705746616385165, -0.12079535930263247, 0.011528178146346265, 0.15175559956010928, 0.03796795542258473, 0.08988225412299963, 0.13429446188899077, -0.10366539428585986, -0.1801507943636103, 0.3074968297562449, -0.08831490651455227, -0.17576858825732472, 0.16989571028715297, -0.09378349893966655, -0.14100769911091893, 0.11677685760964111, 0.2594179075031844, 0.09721077087329356, -0.1863429881721308, -0.009715779473156829, -0.019283500465914417, 0.16166490822389817, 0.029960082203244708, -0.11591642110305987, 0.146770899626723, 0.2651506824831176, -0.002017537849676457, 0.07893145323440337, -0.16276390033412227, -0.06041161564718576, -0.23689411769644803, -0.13800936484721246, -0.14664507545768077, 0.034915875315749245, -0.09682443993633975, -0.12075902265793151, 0.41596171417671024, 0.21687548508226967, 0.22079617700948836, 0.1012886308287834, 0.2817087835412781, 0.03614127351665146, 0.10215596413198312, 0.05722367313577776, 0.1099448771435459, 0.011086834413125506, 0.11785073519779286, -0.14898534593985055, 0.11043661167833266, -0.02736005049709017] |
1,802.08562 | Deep Unsupervised Learning of Visual Similarities | Exemplar learning of visual similarities in an unsupervised manner is a
problem of paramount importance to Computer Vision. In this context, however,
the recent breakthrough in deep learning could not yet unfold its full
potential. With only a single positive sample, a great imbalance between one
positive and many negatives, and unreliable relationships between most samples,
training of Convolutional Neural networks is impaired. In this paper we use
weak estimates of local similarities and propose a single optimization problem
to extract batches of samples with mutually consistent relations. Conflicting
relations are distributed over different batches and similar samples are
grouped into compact groups. Learning visual similarities is then framed as a
sequence of categorization tasks. The CNN then consolidates transitivity
relations within and between groups and learns a single representation for all
samples without the need for labels. The proposed unsupervised approach has
shown competitive performance on detailed posture analysis and object
classification.
| cs.CV | exemplar learning of visual similarities in an unsupervised manner is a problem of paramount importance to computer vision in this context however the recent breakthrough in deep learning could not yet unfold its full potential with only a single positive sample a great imbalance between one positive and many negatives and unreliable relationships between most samples training of convolutional neural networks is impaired in this paper we use weak estimates of local similarities and propose a single optimization problem to extract batches of samples with mutually consistent relations conflicting relations are distributed over different batches and similar samples are grouped into compact groups learning visual similarities is then framed as a sequence of categorization tasks the cnn then consolidates transitivity relations within and between groups and learns a single representation for all samples without the need for labels the proposed unsupervised approach has shown competitive performance on detailed posture analysis and object classification | [['exemplar', 'learning', 'of', 'visual', 'similarities', 'in', 'an', 'unsupervised', 'manner', 'is', 'a', 'problem', 'of', 'paramount', 'importance', 'to', 'computer', 'vision', 'in', 'this', 'context', 'however', 'the', 'recent', 'breakthrough', 'in', 'deep', 'learning', 'could', 'not', 'yet', 'unfold', 'its', 'full', 'potential', 'with', 'only', 'a', 'single', 'positive', 'sample', 'a', 'great', 'imbalance', 'between', 'one', 'positive', 'and', 'many', 'negatives', 'and', 'unreliable', 'relationships', 'between', 'most', 'samples', 'training', 'of', 'convolutional', 'neural', 'networks', 'is', 'impaired', 'in', 'this', 'paper', 'we', 'use', 'weak', 'estimates', 'of', 'local', 'similarities', 'and', 'propose', 'a', 'single', 'optimization', 'problem', 'to', 'extract', 'batches', 'of', 'samples', 'with', 'mutually', 'consistent', 'relations', 'conflicting', 'relations', 'are', 'distributed', 'over', 'different', 'batches', 'and', 'similar', 'samples', 'are', 'grouped', 'into', 'compact', 'groups', 'learning', 'visual', 'similarities', 'is', 'then', 'framed', 'as', 'a', 'sequence', 'of', 'categorization', 'tasks', 'the', 'cnn', 'then', 'consolidates', 'transitivity', 'relations', 'within', 'and', 'between', 'groups', 'and', 'learns', 'a', 'single', 'representation', 'for', 'all', 'samples', 'without', 'the', 'need', 'for', 'labels', 'the', 'proposed', 'unsupervised', 'approach', 'has', 'shown', 'competitive', 'performance', 'on', 'detailed', 'posture', 'analysis', 'and', 'object', 'classification']] | [-0.05950208893578402, 0.02430599751462627, -0.07587334404705591, 0.07470765601679244, -0.12300365117189833, -0.1844143099090681, 0.05891420933557979, 0.4739800496939935, -0.2927724788052158, -0.34861906932477055, 0.031602668559963944, -0.30770589253603436, -0.1900680195091268, 0.16986274013137506, -0.15871035721719118, 0.06277066806226275, 0.13685642330666845, 0.05367404953546189, -0.09981695984435432, -0.27993958764648663, 0.3132293743995974, -0.014553861548169972, 0.35048681633467815, -0.0237015361465465, 0.1260285798788947, -0.004734849408147187, -0.049452482343208516, 0.030395075356210367, -0.023828738840796004, 0.19119582022235918, 0.3530619956455589, 0.1730192973448901, 0.3636603521950105, -0.39243627475319526, -0.21924679435704367, 0.15132512589247007, 0.17927967453241542, 0.08953896220514758, -0.07759478680859472, -0.3199650732849061, 0.10870217899274495, -0.14406251923098942, 0.06335635631180861, -0.1297686038557075, 0.040062977761955436, -0.009269203811890014, -0.26109430427340413, 0.0566583276525432, 0.07501663112277895, 0.08365620355109617, -0.07446397534720721, -0.09467353418262468, 0.029119220670324818, 0.22186392027081228, 0.034868507312756834, 0.04336683190537288, 0.10533237230037247, -0.19540253714080047, -0.13438057337485837, 0.3292225820265004, 0.00032567827858858637, -0.20870425566282197, 0.23766366738348202, -0.039486110580208546, -0.19085231708709663, 0.08108612518982804, 0.22420334496711886, 0.1150163166122998, -0.19087368702467264, 0.0050520571469925835, -0.06952412670563443, 0.17689644626274803, 0.03064603740014623, -0.00241299468667849, 0.23413317712720824, 0.25372118942342164, 0.01746023932640788, 0.11839716779555079, -0.08649016312153072, -0.047280072188917915, -0.2200804391869776, -0.1038306214910585, -0.1780308959708896, -0.024593932387396978, -0.1294698763139024, -0.1424579955186631, 0.3698395681780538, 0.1725790579955465, 0.24517973709936722, 0.10816461771263991, 0.31690446778011866, -0.00013272863815788155, 0.10861717296301637, 0.0677603380998073, 0.1756264880372613, 0.08477843857181618, 0.1006250319039157, -0.13655651061874785, 0.1089485908753476, 0.04573307487979726] |
1,802.08563 | The Parameterized Hardness of the k-Center Problem in Transportation
Networks | In this paper we study the hardness of the $k$-Center problem on inputs that
model transportation networks. For the problem, a graph $G=(V,E)$ with edge
lengths and an integer $k$ are given and a center set $C\subseteq V$ needs to
be chosen such that $|C|\leq k$. The aim is to minimize the maximum distance of
any vertex in the graph to the closest center. This problem arises in many
applications of logistics, and thus it is natural to consider inputs that model
transportation networks. Such inputs are often assumed to be planar graphs, low
doubling metrics, or bounded highway dimension graphs. For each of these
models, parameterized approximation algorithms have been shown to exist. We
complement these results by proving that the $k$-Center problem is W[1]-hard on
planar graphs of constant doubling dimension, where the parameter is the
combination of the number of centers $k$, the highway dimension $h$, and the
pathwidth $p$. Moreover, under the Exponential Time Hypothesis there is no
$f(k,p,h)\cdot n^{o(p+\sqrt{k+h})}$ time algorithm for any computable function
$f$. Thus it is unlikely that the optimum solution to $k$-Center can be found
efficiently, even when assuming that the input graph abides to all of the above
models for transportation networks at once!
Additionally we give a simple parameterized $(1+\varepsilon)$-approximation
algorithm for inputs of doubling dimension $d$ with runtime
$(k^k/\varepsilon^{O(kd)})\cdot n^{O(1)}$. This generalizes a previous result,
which considered inputs in $D$-dimensional $L_q$ metrics.
| cs.CC cs.DS | in this paper we study the hardness of the kcenter problem on inputs that model transportation networks for the problem a graph gve with edge lengths and an integer k are given and a center set csubseteq v needs to be chosen such that cleq k the aim is to minimize the maximum distance of any vertex in the graph to the closest center this problem arises in many applications of logistics and thus it is natural to consider inputs that model transportation networks such inputs are often assumed to be planar graphs low doubling metrics or bounded highway dimension graphs for each of these models parameterized approximation algorithms have been shown to exist we complement these results by proving that the kcenter problem is w1hard on planar graphs of constant doubling dimension where the parameter is the combination of the number of centers k the highway dimension h and the pathwidth p moreover under the exponential time hypothesis there is no fkphcdot nopsqrtkh time algorithm for any computable function f thus it is unlikely that the optimum solution to kcenter can be found efficiently even when assuming that the input graph abides to all of the above models for transportation networks at once additionally we give a simple parameterized 1varepsilonapproximation algorithm for inputs of doubling dimension d with runtime kkvarepsilonokdcdot no1 this generalizes a previous result which considered inputs in ddimensional l_q metrics | [['in', 'this', 'paper', 'we', 'study', 'the', 'hardness', 'of', 'the', 'kcenter', 'problem', 'on', 'inputs', 'that', 'model', 'transportation', 'networks', 'for', 'the', 'problem', 'a', 'graph', 'gve', 'with', 'edge', 'lengths', 'and', 'an', 'integer', 'k', 'are', 'given', 'and', 'a', 'center', 'set', 'csubseteq', 'v', 'needs', 'to', 'be', 'chosen', 'such', 'that', 'cleq', 'k', 'the', 'aim', 'is', 'to', 'minimize', 'the', 'maximum', 'distance', 'of', 'any', 'vertex', 'in', 'the', 'graph', 'to', 'the', 'closest', 'center', 'this', 'problem', 'arises', 'in', 'many', 'applications', 'of', 'logistics', 'and', 'thus', 'it', 'is', 'natural', 'to', 'consider', 'inputs', 'that', 'model', 'transportation', 'networks', 'such', 'inputs', 'are', 'often', 'assumed', 'to', 'be', 'planar', 'graphs', 'low', 'doubling', 'metrics', 'or', 'bounded', 'highway', 'dimension', 'graphs', 'for', 'each', 'of', 'these', 'models', 'parameterized', 'approximation', 'algorithms', 'have', 'been', 'shown', 'to', 'exist', 'we', 'complement', 'these', 'results', 'by', 'proving', 'that', 'the', 'kcenter', 'problem', 'is', 'w1hard', 'on', 'planar', 'graphs', 'of', 'constant', 'doubling', 'dimension', 'where', 'the', 'parameter', 'is', 'the', 'combination', 'of', 'the', 'number', 'of', 'centers', 'k', 'the', 'highway', 'dimension', 'h', 'and', 'the', 'pathwidth', 'p', 'moreover', 'under', 'the', 'exponential', 'time', 'hypothesis', 'there', 'is', 'no', 'fkphcdot', 'nopsqrtkh', 'time', 'algorithm', 'for', 'any', 'computable', 'function', 'f', 'thus', 'it', 'is', 'unlikely', 'that', 'the', 'optimum', 'solution', 'to', 'kcenter', 'can', 'be', 'found', 'efficiently', 'even', 'when', 'assuming', 'that', 'the', 'input', 'graph', 'abides', 'to', 'all', 'of', 'the', 'above', 'models', 'for', 'transportation', 'networks', 'at', 'once', 'additionally', 'we', 'give', 'a', 'simple', 'parameterized', '1varepsilonapproximation', 'algorithm', 'for', 'inputs', 'of', 'doubling', 'dimension', 'd', 'with', 'runtime', 'kkvarepsilonokdcdot', 'no1', 'this', 'generalizes', 'a', 'previous', 'result', 'which', 'considered', 'inputs', 'in', 'ddimensional', 'l_q', 'metrics']] | [-0.14535843483872865, 0.09239996972981915, -0.024410383509738103, 0.06127720356170991, -0.07893433973084313, -0.19019989963637027, 0.05845151409895857, 0.4033171496015381, -0.315377286048727, -0.312465607470861, 0.11072060660946936, -0.27518475024650496, -0.1617449316915802, 0.1684233255561409, -0.09486198675359128, 0.1005499827477968, 0.08051766232623682, 0.08526671422520467, 0.011438153789971362, -0.30148024666433026, 0.3067755144738564, -0.0021467314036744465, 0.19870288431726585, 0.07699620856039702, 0.0746094226571066, -0.006567353041020113, 0.0392613951308306, 0.08300271149305426, -0.13852745930262836, 0.08122329865441177, 0.28885407209965464, 0.18692636804441515, 0.26405382363198254, -0.37875573234672927, -0.22334245954200754, 0.23030420252246966, 0.10818783492122039, 0.06293317341110649, 0.024068244866970363, -0.21708097177743105, 0.14077489379011257, -0.0784064104187895, -0.09986678635886995, 0.00219297878347434, 0.0949640999390901, -0.009934942077268801, -0.31411385057227953, -0.0139772542933752, 0.09623115107384853, 0.007953417740935597, -0.02993919748260571, -0.14632518528617952, 3.552023982588863e-06, 0.10887726673766168, -0.004081951806551547, 0.11003740817395108, 0.06239442437790431, -0.10380678378333826, -0.16630328888097753, 0.37630604807432594, -0.02192669009056055, -0.21571338182774843, 0.15743497944360366, -0.10332284073317141, -0.15764642611460447, 0.095641831690758, 0.19199925507983248, 0.13529941159223904, -0.11562068555515423, 0.13661833244561847, -0.10188874289861102, 0.1511013656794154, 0.10522452519513119, -0.016689219468200654, 0.09827517464432414, 0.14914629373747806, 0.18877514143997512, 0.1616480720962208, -0.005346751686193662, -0.0510799293214802, -0.2740089724412857, -0.09499120634468473, -0.23327814556257115, 0.04639985495009077, -0.1671026696335601, -0.16341441752047892, 0.3565030507420823, 0.126248262594837, 0.22695133308940507, 0.12369338321868427, 0.2802800648519165, 0.11896244626049027, 0.06816574257548527, 0.1871129326232005, 0.14921407203907672, 0.09695634465297741, 0.028303543772967735, -0.17605491977228352, 0.08202082931580126, 0.088643017700897] |
1,802.08564 | Improbability of Collisions in $n$-Body Systems | For a wide class of two-body interactions, including standard examples like
gravitational or Coulomb fields, we show that collision orbits in $n$-body
systems are of Liouville measure zero for all energies. We use techniques from
symplectic geometry to relate the volume of the union of collision orbits to
the area of Poincar\'e surfaces surrounding the collision set.
| math-ph math.DS math.MP | for a wide class of twobody interactions including standard examples like gravitational or coulomb fields we show that collision orbits in nbody systems are of liouville measure zero for all energies we use techniques from symplectic geometry to relate the volume of the union of collision orbits to the area of poincare surfaces surrounding the collision set | [['for', 'a', 'wide', 'class', 'of', 'twobody', 'interactions', 'including', 'standard', 'examples', 'like', 'gravitational', 'or', 'coulomb', 'fields', 'we', 'show', 'that', 'collision', 'orbits', 'in', 'nbody', 'systems', 'are', 'of', 'liouville', 'measure', 'zero', 'for', 'all', 'energies', 'we', 'use', 'techniques', 'from', 'symplectic', 'geometry', 'to', 'relate', 'the', 'volume', 'of', 'the', 'union', 'of', 'collision', 'orbits', 'to', 'the', 'area', 'of', 'poincare', 'surfaces', 'surrounding', 'the', 'collision', 'set']] | [-0.1563070156660519, 0.08539685167437583, -0.08282219102757313, 0.10842146164035066, -0.02025271619653754, -0.06642896142020299, -0.03508283207683187, 0.3118646737645593, -0.26822487313071625, -0.2724010399951224, 0.03572954182112753, -0.30468844112597016, -0.09132428529770359, 0.25348212580980833, -0.03698253048289763, 0.0596728046310314, 0.12939439251561435, 0.058688826291217355, -0.10685296803957929, -0.23886124159233937, 0.4194685146212578, -0.002525839913767158, 0.1526900795370079, 0.04422729932948163, 0.07408403882168625, 0.05980159633123038, 0.005002211681322048, 0.04603928226258671, -0.17070580068467647, 0.11724149894884281, 0.20374770704330059, 0.09022985232111655, 0.1986756062854016, -0.40667067481237545, -0.2105284582725481, 0.13255264900886177, 0.12030071132048442, 0.13540185159562448, -0.039420274110805044, -0.29569304020454484, 0.03350902038315932, -0.206431035213826, -0.1997765440640873, -0.09245785516931822, 0.07829055984978352, 0.10831476475128479, -0.2139888781596694, 0.07187538698577044, 0.030678293751471006, 0.08098835029165473, -0.09215571207664254, -0.08317129431586516, -0.02393318695963867, 0.09273850925577183, 0.03676031330567703, -0.021327655535730485, 0.18759800992056466, -0.10755476896373327, -0.11793331368091076, 0.41566092917989744, -0.036549102465965246, -0.2052934575303082, 0.3104232233977599, -0.19819080562477834, -0.11439843810767981, 0.18375853019390712, 0.23793459023561395, 0.09567171632998477, -0.1468779407931786, 0.1603219990471476, -0.002243259946178449, 0.06366104207802237, 0.14179326388821528, 0.006025283262460378, 0.22464578713110664, 0.1066186072982913, 0.08852959483077652, 0.09322606685485593, -0.11425879718572424, -0.13391232791993962, -0.34140090918854665, -0.14735524116182014, -0.16413925459257148, 0.06825608652281134, -0.07299597431464415, -0.18952182938524506, 0.3327481804089825, 0.09706106618569608, 0.19513917227863872, 0.07598075766949669, 0.23000635631513178, 0.04341133545064, 0.09827370706561692, 0.0612960588840539, 0.24777837665629035, 0.15356964691493072, 0.025681588455642525, -0.18877691583781453, -0.1076875631534086, 0.11847530318456784] |
1,802.08565 | Additional contributions from: Nobel Symposium 162 - Microfluidics | Series of short contributions that are part of Nobel Symposium 162 -
Microfluidics arXiv:1712.08369.
| physics.flu-dyn q-bio.OT | series of short contributions that are part of nobel symposium 162 microfluidics arxiv171208369 | [['series', 'of', 'short', 'contributions', 'that', 'are', 'part', 'of', 'nobel', 'symposium', '162', 'microfluidics', 'arxiv171208369']] | [-0.1509781739441678, 0.1574738019456466, -0.09911191618690889, -0.07934357676034172, -0.16331877264504632, 0.010893094663818678, -0.07773916299144427, 0.20426983386278152, -0.24214122646177808, -0.38423041564722854, 0.12558259690801302, -0.4196042735129595, -0.16334761446341872, 0.29060941220571596, -0.054146107751876116, -0.060724328039214015, 0.11490779009182006, -0.13937694672495127, 0.0853670304059051, -0.3755594591299693, 0.15035010067125162, 0.06162021650622288, 0.25493261610002566, 0.1434131294178466, 0.10287750419229269, -0.020271080856521923, -0.21629113207260767, -0.05136210129906734, -0.11749396568545005, 0.12892078359921774, 0.35075492489462096, 0.04280581014851729, 0.4421725111703078, -0.4593081685403983, -0.07217788929119706, -0.05756325523058573, 0.04542288925343504, 0.020272554907326896, 0.030234749196097255, -0.229902232841899, -0.026367306088407833, -0.2627561030288537, -0.04499131774840256, 0.025563704470793407, 0.24301131442189217, 0.10114767743895452, -0.045886010862886906, 0.14916842880969247, 0.0279661367336909, 0.18322637242575487, 0.012830183821885536, -0.24634256671803692, 0.11665989148120086, 0.13341641798615456, 0.028280958998948336, 0.07804306332642834, 0.1219355040229857, -0.12020813231356442, -0.15647809129829207, 0.461526936541001, -0.10685312701389194, 0.06673823359111945, 0.1379189433840414, -0.18646634121735892, -0.24924358678981662, 0.17556349436442056, 0.279566307241718, 0.07639495822998772, -0.21067319996654987, 0.11951664028068383, 0.042261206855376564, 0.16828979187024137, 0.11462517435817669, 0.034410550841130316, 0.30145313559720915, 0.09964524706204732, -0.13176402170211077, 0.052984435111284256, -0.09699713380541652, -0.11165428130577008, -0.4358297449847062, -0.16790264875938496, -0.1590066865707437, 0.009134605837364992, 0.15165188648582748, -0.13931735162623227, 0.38502276812990505, 0.03781206362570325, 0.04416951475044092, -0.049893055111169815, 0.12945473690827689, 0.007107061799615622, -0.011237192278107008, -0.014634313682715097, 0.22757770059009394, 0.13841929084931812, 0.2100798012688756, -0.06865745790613194, -0.007579157206540306, 0.14195866789668798] |
1,802.08566 | Improbability of Wandering Orbits Passing Through a Sequence of
Poincar\'e Surfaces of Decreasing Size | Given a volume preserving dynamical system with non-compact phase space, one
is sometimes interested in special subsets of its wandering set. One example
from celestial mechanics is the set of initial values leading to collision.
Another one is the set of initial values of semi-orbits, whose asymptotic
velocity does not exist as a limit. We introduce techniques that can be helpful
in showing that these sets are of measure zero: by defining a sequence of
hypersurfaces, that are eventually hit by each of those semi-orbits and whose
total surface area decreases to zero.
| math-ph math.DS math.MP | given a volume preserving dynamical system with noncompact phase space one is sometimes interested in special subsets of its wandering set one example from celestial mechanics is the set of initial values leading to collision another one is the set of initial values of semiorbits whose asymptotic velocity does not exist as a limit we introduce techniques that can be helpful in showing that these sets are of measure zero by defining a sequence of hypersurfaces that are eventually hit by each of those semiorbits and whose total surface area decreases to zero | [['given', 'a', 'volume', 'preserving', 'dynamical', 'system', 'with', 'noncompact', 'phase', 'space', 'one', 'is', 'sometimes', 'interested', 'in', 'special', 'subsets', 'of', 'its', 'wandering', 'set', 'one', 'example', 'from', 'celestial', 'mechanics', 'is', 'the', 'set', 'of', 'initial', 'values', 'leading', 'to', 'collision', 'another', 'one', 'is', 'the', 'set', 'of', 'initial', 'values', 'of', 'semiorbits', 'whose', 'asymptotic', 'velocity', 'does', 'not', 'exist', 'as', 'a', 'limit', 'we', 'introduce', 'techniques', 'that', 'can', 'be', 'helpful', 'in', 'showing', 'that', 'these', 'sets', 'are', 'of', 'measure', 'zero', 'by', 'defining', 'a', 'sequence', 'of', 'hypersurfaces', 'that', 'are', 'eventually', 'hit', 'by', 'each', 'of', 'those', 'semiorbits', 'and', 'whose', 'total', 'surface', 'area', 'decreases', 'to', 'zero']] | [-0.15198871563439087, 0.16272113068650165, -0.10015887432601503, 0.03464765367924326, -0.05123331841401836, -0.11791267277677894, 0.03913521590787837, 0.32370939618477257, -0.2600934492869763, -0.26302353689892677, 0.14584413337300942, -0.3007518589741961, -0.09337992857520779, 0.20950844400231877, -0.10853175716274367, 0.040784797264120334, 0.07201477298913624, 0.11517169077940766, -0.06751724387398891, -0.26381136131252575, 0.3818365371916243, -0.02047940717148845, 0.21109915540994256, -0.005176759515238064, 0.10081402225900561, -0.02630291225373625, 0.004946213886542346, 0.09243518608510845, -0.11839290480847628, 0.09262046472279616, 0.22725528135134648, 0.15244515497057187, 0.2892566955978832, -0.3475937349221078, -0.17564052372409772, 0.18932772578010637, 0.1407725871590677, 0.09438968862166568, 0.020399657887987473, -0.24262959442992685, 0.11135444964372343, -0.11962881089834075, -0.1910815280736975, -0.062469022383572916, 0.05466299470994742, 0.06592462926862701, -0.21560466305042306, 0.03868844320056259, 0.05800510947285871, 0.04806816870827348, -0.052899818838654106, -0.10710687680365218, -0.0851831076721791, 0.15755514702909895, 0.04412336639248796, 0.07794977060609287, 0.1231203351460237, -0.07637326938590856, -0.06454067074403327, 0.38502885477357013, -0.02545707087127632, -0.24882892759576922, 0.18943962772716066, -0.20437041357890653, -0.10201487551513379, 0.1742059086782417, 0.13141172317167124, 0.0969097488303168, -0.12057311399289036, 0.07939772081488783, -0.05273245312073218, 0.13305799695112372, 0.09235007690405973, 0.03575868908095584, 0.2435145489145471, 0.12548908515162366, 0.12299200088056104, 0.12413849407539113, -0.046124435580706086, -0.08228349795825379, -0.35890048151455256, -0.13901928010126274, -0.1945297279024637, 0.07636671644771316, -0.09738976862366056, -0.21327993665291098, 0.34785793750216404, 0.08924525044858456, 0.24870823584597118, 0.05221151842946006, 0.24620194821268, 0.12163028925684186, 0.048190012935959606, 0.07867447320391895, 0.18679620943067254, 0.08763340355387779, 0.0344574480587917, -0.15526293308827124, 0.06226735651713385, 0.10358335557443801] |
1,802.08567 | Adversarial Training for Probabilistic Spiking Neural Networks | Classifiers trained using conventional empirical risk minimization or maximum
likelihood methods are known to suffer dramatic performance degradations when
tested over examples adversarially selected based on knowledge of the
classifier's decision rule. Due to the prominence of Artificial Neural Networks
(ANNs) as classifiers, their sensitivity to adversarial examples, as well as
robust training schemes, have been recently the subject of intense
investigation. In this paper, for the first time, the sensitivity of spiking
neural networks (SNNs), or third-generation neural networks, to adversarial
examples is studied. The study considers rate and time encoding, as well as
rate and first-to-spike decoding. Furthermore, a robust training mechanism is
proposed that is demonstrated to enhance the performance of SNNs under
white-box attacks.
| stat.ML cs.LG cs.NE eess.SP | classifiers trained using conventional empirical risk minimization or maximum likelihood methods are known to suffer dramatic performance degradations when tested over examples adversarially selected based on knowledge of the classifiers decision rule due to the prominence of artificial neural networks anns as classifiers their sensitivity to adversarial examples as well as robust training schemes have been recently the subject of intense investigation in this paper for the first time the sensitivity of spiking neural networks snns or thirdgeneration neural networks to adversarial examples is studied the study considers rate and time encoding as well as rate and firsttospike decoding furthermore a robust training mechanism is proposed that is demonstrated to enhance the performance of snns under whitebox attacks | [['classifiers', 'trained', 'using', 'conventional', 'empirical', 'risk', 'minimization', 'or', 'maximum', 'likelihood', 'methods', 'are', 'known', 'to', 'suffer', 'dramatic', 'performance', 'degradations', 'when', 'tested', 'over', 'examples', 'adversarially', 'selected', 'based', 'on', 'knowledge', 'of', 'the', 'classifiers', 'decision', 'rule', 'due', 'to', 'the', 'prominence', 'of', 'artificial', 'neural', 'networks', 'anns', 'as', 'classifiers', 'their', 'sensitivity', 'to', 'adversarial', 'examples', 'as', 'well', 'as', 'robust', 'training', 'schemes', 'have', 'been', 'recently', 'the', 'subject', 'of', 'intense', 'investigation', 'in', 'this', 'paper', 'for', 'the', 'first', 'time', 'the', 'sensitivity', 'of', 'spiking', 'neural', 'networks', 'snns', 'or', 'thirdgeneration', 'neural', 'networks', 'to', 'adversarial', 'examples', 'is', 'studied', 'the', 'study', 'considers', 'rate', 'and', 'time', 'encoding', 'as', 'well', 'as', 'rate', 'and', 'firsttospike', 'decoding', 'furthermore', 'a', 'robust', 'training', 'mechanism', 'is', 'proposed', 'that', 'is', 'demonstrated', 'to', 'enhance', 'the', 'performance', 'of', 'snns', 'under', 'whitebox', 'attacks']] | [-0.06050592137626925, -0.007494626582552821, 0.012874724225030613, 0.11389879054602993, -0.07770464235869379, -0.22406185823650557, 0.08289771464799325, 0.47705280188455296, -0.2352499667933937, -0.31619837577060117, 0.11612765889681907, -0.25463706577764983, -0.2676245640229307, 0.21777026570338945, -0.15415401375256638, 0.1761603345699861, 0.10378176140030689, 0.06613173686615112, -0.046336651477820665, -0.37264898332364665, 0.28996365219433556, 0.13533138797492167, 0.3695267272355445, -0.014221319824682107, 0.12564851043418335, -0.09754358350409795, 0.002381687816153517, -0.028610523008757223, -0.020533756055325068, 0.08582200366466985, 0.31232546385717025, 0.20403373661111662, 0.37420344838904124, -0.432893678072398, -0.26887602556370577, 0.15300347004973694, 0.1268665402312763, 0.12150439494526234, -0.016962430247508178, -0.33834898823840637, 0.12366874978909174, -0.17939730325587472, 0.02521303052406253, -0.15509384415917477, -0.04665169167782227, 0.05469534753760623, -0.3038023205363523, 0.02129953479299606, 0.10059580212593142, 0.07995809268569416, -0.02745957549077348, -0.132182161670999, -0.0008852104853712402, 0.09179053404215541, 0.11004102792219907, 0.03804920125709278, 0.16054540623168825, -0.17255352266227542, -0.21166367013544096, 0.3096310831843165, -0.0485131584711657, -0.17562748463350839, 0.19484360193462757, 0.04571002488166599, -0.09528402030523235, 0.11201809409816386, 0.31320699638986993, 0.10990679895473739, -0.17839842487653912, -0.02812557458242212, 0.01399652283417724, 0.15895233343560564, 0.06495324777581303, 0.04029258496869924, 0.1244435012666114, 0.28536375795325297, 0.02720465399995762, 0.17005006266536854, -0.14405720006729775, -0.08630483993033136, -0.1813056531620717, -0.03433027862713246, -0.21743489897383725, 0.027403208624445282, -0.0509117264811135, -0.15483038151691966, 0.3850491735452818, 0.19255779538366755, 0.19436965262422623, 0.16761346270282895, 0.37650589935355266, 0.05687413882697001, 0.15022194043188591, 0.07470075083280897, 0.26586547179810577, 0.09195591713759606, 0.0860180378826414, -0.1471272655328641, 0.15973297813986193, 0.020807884430800866] |
1,802.08568 | Indic Handwritten Script Identification using Offline-Online Multimodal
Deep Network | In this paper, we propose a novel approach of word-level Indic script
identification using only character-level data in training stage. The
advantages of using character level data for training have been outlined in
section I. Our method uses a multimodal deep network which takes both offline
and online modality of the data as input in order to explore the information
from both the modalities jointly for script identification task. We take
handwritten data in either modality as input and the opposite modality is
generated through intermodality conversion. Thereafter, we feed this
offline-online modality pair to our network. Hence, along with the advantage of
utilizing information from both the modalities, it can work as a single
framework for both offline and online script identification simultaneously
which alleviates the need for designing two separate script identification
modules for individual modality. One more major contribution is that we propose
a novel conditional multimodal fusion scheme to combine the information from
offline and online modality which takes into account the real origin of the
data being fed to our network and thus it combines adaptively. An exhaustive
experiment has been done on a data set consisting of English and six Indic
scripts. Our proposed framework clearly outperforms different frameworks based
on traditional classifiers along with handcrafted features and deep learning
based methods with a clear margin. Extensive experiments show that using only
character level training data can achieve state-of-art performance similar to
that obtained with traditional training using word level data in our framework.
| cs.CV | in this paper we propose a novel approach of wordlevel indic script identification using only characterlevel data in training stage the advantages of using character level data for training have been outlined in section i our method uses a multimodal deep network which takes both offline and online modality of the data as input in order to explore the information from both the modalities jointly for script identification task we take handwritten data in either modality as input and the opposite modality is generated through intermodality conversion thereafter we feed this offlineonline modality pair to our network hence along with the advantage of utilizing information from both the modalities it can work as a single framework for both offline and online script identification simultaneously which alleviates the need for designing two separate script identification modules for individual modality one more major contribution is that we propose a novel conditional multimodal fusion scheme to combine the information from offline and online modality which takes into account the real origin of the data being fed to our network and thus it combines adaptively an exhaustive experiment has been done on a data set consisting of english and six indic scripts our proposed framework clearly outperforms different frameworks based on traditional classifiers along with handcrafted features and deep learning based methods with a clear margin extensive experiments show that using only character level training data can achieve stateofart performance similar to that obtained with traditional training using word level data in our framework | [['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'approach', 'of', 'wordlevel', 'indic', 'script', 'identification', 'using', 'only', 'characterlevel', 'data', 'in', 'training', 'stage', 'the', 'advantages', 'of', 'using', 'character', 'level', 'data', 'for', 'training', 'have', 'been', 'outlined', 'in', 'section', 'i', 'our', 'method', 'uses', 'a', 'multimodal', 'deep', 'network', 'which', 'takes', 'both', 'offline', 'and', 'online', 'modality', 'of', 'the', 'data', 'as', 'input', 'in', 'order', 'to', 'explore', 'the', 'information', 'from', 'both', 'the', 'modalities', 'jointly', 'for', 'script', 'identification', 'task', 'we', 'take', 'handwritten', 'data', 'in', 'either', 'modality', 'as', 'input', 'and', 'the', 'opposite', 'modality', 'is', 'generated', 'through', 'intermodality', 'conversion', 'thereafter', 'we', 'feed', 'this', 'offlineonline', 'modality', 'pair', 'to', 'our', 'network', 'hence', 'along', 'with', 'the', 'advantage', 'of', 'utilizing', 'information', 'from', 'both', 'the', 'modalities', 'it', 'can', 'work', 'as', 'a', 'single', 'framework', 'for', 'both', 'offline', 'and', 'online', 'script', 'identification', 'simultaneously', 'which', 'alleviates', 'the', 'need', 'for', 'designing', 'two', 'separate', 'script', 'identification', 'modules', 'for', 'individual', 'modality', 'one', 'more', 'major', 'contribution', 'is', 'that', 'we', 'propose', 'a', 'novel', 'conditional', 'multimodal', 'fusion', 'scheme', 'to', 'combine', 'the', 'information', 'from', 'offline', 'and', 'online', 'modality', 'which', 'takes', 'into', 'account', 'the', 'real', 'origin', 'of', 'the', 'data', 'being', 'fed', 'to', 'our', 'network', 'and', 'thus', 'it', 'combines', 'adaptively', 'an', 'exhaustive', 'experiment', 'has', 'been', 'done', 'on', 'a', 'data', 'set', 'consisting', 'of', 'english', 'and', 'six', 'indic', 'scripts', 'our', 'proposed', 'framework', 'clearly', 'outperforms', 'different', 'frameworks', 'based', 'on', 'traditional', 'classifiers', 'along', 'with', 'handcrafted', 'features', 'and', 'deep', 'learning', 'based', 'methods', 'with', 'a', 'clear', 'margin', 'extensive', 'experiments', 'show', 'that', 'using', 'only', 'character', 'level', 'training', 'data', 'can', 'achieve', 'stateofart', 'performance', 'similar', 'to', 'that', 'obtained', 'with', 'traditional', 'training', 'using', 'word', 'level', 'data', 'in', 'our', 'framework']] | [-0.004928266791161149, -0.0338021373305819, -0.09835296321287751, 0.03835967647249345, -0.14268878578860314, -0.1905280810855329, 0.03675684072496369, 0.46300996114313603, -0.284921522791381, -0.31454725881665946, 0.06742828555498272, -0.27728976429905744, -0.14252801679540425, 0.20214662220980972, -0.09194471589103341, 0.05558665606379509, 0.16300152345001698, 0.06758012070739641, -0.02442001134622842, -0.2699752190138679, 0.3263010967820883, 0.02861503079882823, 0.37735153261572124, -0.007648476528003812, 0.1708216428910382, 0.019268437532708047, -0.048823978999396785, -0.01592435944220051, -0.015720082565647317, 0.18188946533296257, 0.34244894215464594, 0.23978475869633256, 0.3110766210258007, -0.41978464388847353, -0.19431048729363828, 0.04851756476610899, 0.15319394524767996, 0.13241111215902493, -0.054625976939045355, -0.3466164324432611, 0.09100244850758463, -0.18361800766643135, 0.07310513012297451, -0.13731840474158524, -0.05502484966814518, -0.042881211722269656, -0.31602299234643577, 0.023110292716883123, 0.08474658480752259, 0.08431631099432707, -0.05960136268194765, -0.13251683203317224, 0.02249952500872314, 0.1798817943558097, 0.024666322589851915, 0.04318303601013031, 0.10245816578343511, -0.14145721278060228, -0.16008243694528937, 0.3440842058140552, -0.07331855599908157, -0.1906865819953382, 0.18864089727168903, -0.02504761940985918, -0.15320551489107312, 0.10918667864985764, 0.2189654478612356, 0.08204852889664471, -0.1884489466343075, -0.0005897434193175286, -0.02559990288130939, 0.21009683980187402, 0.044949344729073346, -0.004181315505411476, 0.15925222886819393, 0.2758698319680989, -0.03524934909120202, 0.16648063090164214, -0.15923184286197647, -0.03419886027742177, -0.23858602275047452, -0.13323665471281856, -0.17899001896349365, -0.07461511456593871, -0.0613198815282085, -0.10991798605956137, 0.411054053440268, 0.21734101000614464, 0.22223513747379184, 0.08025829326501116, 0.3944955806955695, 0.0249203977205907, 0.1458301954995841, 0.07449743284261785, 0.16576606723852455, -0.03318665214255452, 0.12894653948396445, -0.15309430907759816, 0.08865318712592125, 0.06077429819107056] |
1,802.08569 | Toward High Temperature Quasi-two-dimensional Superconductivity | The demonstration of a quasi-two-dimensional electron gas (2DEG) and
superconducting properties in LaAlO$_3$/SrTiO$_3$ heterostructures has
stimulated intense research activity in recent ten years. The 2DEG has unique
properties that are promising for applications in all-oxide electronic devices.
The superconductivity in such heterostructures has been observed below 300 mK.
For superconductivity applications it is desirable to have more wide
temperature of the existence range and the ability to control superconductivity
properties by external stimulus. Based on first-principles calculations and
theoretical consideration we show that all-oxide heterostructures incorporating
ferroelectric constituent, such as BaTiO$_3$/La$_2$CuO$_4$, allow creating
2DEG. We predict a possibility of a high temperature guasi-two-dimensional
superconductivity state. This state could be switchable between superconducting
and conducting states by ferroelectric polarization reversal. We also discuss
that such structures must be more simple for preparation. The proposed concept
of ferroelectrically controlled interface superconductivity offers the
possibility to design novel electronic devices.
| cond-mat.supr-con | the demonstration of a quasitwodimensional electron gas 2deg and superconducting properties in laalo_3srtio_3 heterostructures has stimulated intense research activity in recent ten years the 2deg has unique properties that are promising for applications in alloxide electronic devices the superconductivity in such heterostructures has been observed below 300 mk for superconductivity applications it is desirable to have more wide temperature of the existence range and the ability to control superconductivity properties by external stimulus based on firstprinciples calculations and theoretical consideration we show that alloxide heterostructures incorporating ferroelectric constituent such as batio_3la_2cuo_4 allow creating 2deg we predict a possibility of a high temperature guasitwodimensional superconductivity state this state could be switchable between superconducting and conducting states by ferroelectric polarization reversal we also discuss that such structures must be more simple for preparation the proposed concept of ferroelectrically controlled interface superconductivity offers the possibility to design novel electronic devices | [['the', 'demonstration', 'of', 'a', 'quasitwodimensional', 'electron', 'gas', '2deg', 'and', 'superconducting', 'properties', 'in', 'laalo_3srtio_3', 'heterostructures', 'has', 'stimulated', 'intense', 'research', 'activity', 'in', 'recent', 'ten', 'years', 'the', '2deg', 'has', 'unique', 'properties', 'that', 'are', 'promising', 'for', 'applications', 'in', 'alloxide', 'electronic', 'devices', 'the', 'superconductivity', 'in', 'such', 'heterostructures', 'has', 'been', 'observed', 'below', '300', 'mk', 'for', 'superconductivity', 'applications', 'it', 'is', 'desirable', 'to', 'have', 'more', 'wide', 'temperature', 'of', 'the', 'existence', 'range', 'and', 'the', 'ability', 'to', 'control', 'superconductivity', 'properties', 'by', 'external', 'stimulus', 'based', 'on', 'firstprinciples', 'calculations', 'and', 'theoretical', 'consideration', 'we', 'show', 'that', 'alloxide', 'heterostructures', 'incorporating', 'ferroelectric', 'constituent', 'such', 'as', 'batio_3la_2cuo_4', 'allow', 'creating', '2deg', 'we', 'predict', 'a', 'possibility', 'of', 'a', 'high', 'temperature', 'guasitwodimensional', 'superconductivity', 'state', 'this', 'state', 'could', 'be', 'switchable', 'between', 'superconducting', 'and', 'conducting', 'states', 'by', 'ferroelectric', 'polarization', 'reversal', 'we', 'also', 'discuss', 'that', 'such', 'structures', 'must', 'be', 'more', 'simple', 'for', 'preparation', 'the', 'proposed', 'concept', 'of', 'ferroelectrically', 'controlled', 'interface', 'superconductivity', 'offers', 'the', 'possibility', 'to', 'design', 'novel', 'electronic', 'devices']] | [-0.17570433377103623, 0.1922773120057737, -0.04236461546528956, -0.004796926142920837, -0.0969306730022975, -0.17187366974700627, 0.08140250782257524, 0.45975233620867645, -0.2355788301118521, -0.2972364259819532, 0.0013411979957740625, -0.29706741617169585, -0.15577632972071398, 0.25152951402686025, 0.014685043821047091, 0.08071498950814893, -0.0642359387201803, -0.1291294547327762, -0.10592544563917507, -0.20384515409261503, 0.2612056745738112, 0.022089404272365158, 0.3584852155169536, 0.14916628214755448, 0.053700318502198, -0.033580239637401595, 0.1874803911958789, 0.002896014652375517, -0.13765078613385037, 0.07170729570789262, 0.33147036044151873, -0.04743344370628996, 0.2648091358999754, -0.49563300685379014, -0.27930188260105404, -0.023006939958652547, 0.10625674604791506, 0.152790640808385, -0.17238588490671927, -0.28463528658552417, 0.10867698087652038, -0.17979541081967282, -0.11249787975885456, -0.16238684879198415, 0.01526337427183472, -0.027268290792688214, -0.19694162826856662, 0.0322081572069096, 0.025549562628669985, 0.1046811744004211, -0.08877941297852948, -0.10802987349653168, -0.031192586301215765, 0.05295566904904513, -0.00847664475601552, 0.04359794239401175, 0.20177656422722443, -0.12530454075734676, -0.15079762778277028, 0.3357604034501931, -0.01705279309334683, -0.05243311690102363, 0.21301974599121204, -0.15913224238581183, -0.08255438192201586, 0.10853829027508818, 0.14581971783190967, 0.05147788193847599, -0.17823782767779353, 0.05669791773202476, -0.016232237729830026, 0.17646030635203652, 0.03454854814817422, 0.15917995557638592, 0.3031772681544053, 0.26217484203777436, 0.0553276495189117, 0.13523946965338085, -0.09204575355758826, 0.0015583380783811725, -0.18721783969808242, -0.21748561686996756, -0.1993198614952893, 0.07379421395859842, -0.02095520814583669, -0.16347080039438502, 0.41453262848522643, 0.20014327475479965, 0.1328115126118064, -0.1337154024521467, 0.2528491768343695, 0.05961847639209109, 0.1018229740703928, 0.02388145523145795, 0.25179374438935315, 0.17373774916591958, 0.13426654796469314, -0.24393268017226766, 0.13611739302005876, -0.06341935383228199] |
1,802.0857 | Relative hyperbolicity of free-by-cyclic extensions | Given a finite rank free group $\mathbb{F}$ of $\mathsf{rank}(\mathbb{F})\geq
3$, we show that the mapping torus of $\phi$ is (strongly) relatively
hyperbolic if $\phi$ is exponentially growing. We combine our result with the
work of Button-Kropholler to answer a question asked by Minasyan-Osin regarding
the acylindrical hyperbolicity of such free-by-cyclic extensions. As an
application we construct new examples of free-by-free hyperbolic extensions
where the elements of the quotient group are not necessarily fully irreducible.
We also give a new proof of the Bridson-Groves quadratic isoperimetric
inequality theorem.
| math.GR | given a finite rank free group mathbbf of mathsfrankmathbbfgeq 3 we show that the mapping torus of phi is strongly relatively hyperbolic if phi is exponentially growing we combine our result with the work of buttonkropholler to answer a question asked by minasyanosin regarding the acylindrical hyperbolicity of such freebycyclic extensions as an application we construct new examples of freebyfree hyperbolic extensions where the elements of the quotient group are not necessarily fully irreducible we also give a new proof of the bridsongroves quadratic isoperimetric inequality theorem | [['given', 'a', 'finite', 'rank', 'free', 'group', 'mathbbf', 'of', 'mathsfrankmathbbfgeq', '3', 'we', 'show', 'that', 'the', 'mapping', 'torus', 'of', 'phi', 'is', 'strongly', 'relatively', 'hyperbolic', 'if', 'phi', 'is', 'exponentially', 'growing', 'we', 'combine', 'our', 'result', 'with', 'the', 'work', 'of', 'buttonkropholler', 'to', 'answer', 'a', 'question', 'asked', 'by', 'minasyanosin', 'regarding', 'the', 'acylindrical', 'hyperbolicity', 'of', 'such', 'freebycyclic', 'extensions', 'as', 'an', 'application', 'we', 'construct', 'new', 'examples', 'of', 'freebyfree', 'hyperbolic', 'extensions', 'where', 'the', 'elements', 'of', 'the', 'quotient', 'group', 'are', 'not', 'necessarily', 'fully', 'irreducible', 'we', 'also', 'give', 'a', 'new', 'proof', 'of', 'the', 'bridsongroves', 'quadratic', 'isoperimetric', 'inequality', 'theorem']] | [-0.15682257723244952, 0.1291839583486208, -0.09645602969657176, 0.04888128186292129, -0.12466766488761073, -0.16001761439483522, 0.007374430381942813, 0.33452099434734694, -0.3248893066547902, -0.22130215346313467, 0.1294742348808341, -0.27372508404617446, -0.1861939165746884, 0.21830999689948996, -0.1412066128161713, -0.021889473686403618, 0.04208205881664848, 0.09502876230242957, -0.07173586553303389, -0.3107858604138217, 0.3888859597216474, -0.0624275828836622, 0.1621836047710442, 0.12274396374591671, 0.11496978543312629, 0.0016099143455304752, -0.04315090392682156, 0.027267631120616344, -0.1954698656241462, 0.13034492237039091, 0.26501159206396196, 0.12572674748555915, 0.26072347800179224, -0.3462407453803391, -0.14272674949408123, 0.19346024479898738, 0.14302296130122935, 0.0392343669266599, -0.10939653654349968, -0.25757150379259414, 0.12533101985918177, -0.18166846311764745, -0.20142412115819752, -0.06913871302201254, 0.032758323570838334, -0.0033459848179141194, -0.24272841104397141, 0.00019983343869481781, 0.16717697117795668, 0.10313106314619867, -0.04924469426410591, -0.04065614647413718, -0.0027337496413099693, 0.08168593920744592, 0.03261680777580007, 0.046400355626601816, 0.07776682547339034, -0.05669200391985658, -0.10639301233175325, 0.3726449934084241, -0.0791519848834269, -0.2437864461822844, 0.15480760574090954, -0.15054441096329288, -0.17443326702227863, 0.09330237588686187, 0.14965381210942458, 0.14774291652926277, -0.033466165473971445, 0.20373425321233254, -0.18175704937382806, 0.1413866752451967, 0.061023454749729575, -0.007715795094022391, 0.08350131674612896, 0.08361868065123151, 0.15438996777989017, 0.1494418667606646, 0.06832152142234874, -0.01990955127062412, -0.3785327257270493, -0.20403089347613476, -0.14960253994525752, 0.14103317045675529, -0.09601076512892799, -0.22438835572996518, 0.38063703827196504, 0.053536882144881684, 0.1699146266072625, 0.14498095949451587, 0.22506311181478383, 0.07745444527174142, 0.036281686724822335, 0.09270824850877611, 0.11934834005447423, 0.20067729475828477, -0.04957220319476796, -0.13585640777118232, -0.013681649389426882, 0.1635822769617889] |
1,802.08571 | Energy consumption for ion transport in a segmented Paul trap | There is recent interest in determining energy costs of shortcuts to
adiabaticity (STA), but different definitions of "cost" have been used. We
demonstrate the importance of taking into account the Control System (CS) for a
fair assessment of energy flows and consumptions. We model the energy
consumption and power to transport an ion by a STA protocol in a multisegmented
Paul trap. The ion is driven by an externally controlled, moving harmonic
oscillator. Even if no net ion- energy is gained at destination, setting the
time-dependent control parameters is a macroscopic operation that costs energy
and results in energy dissipation for the short time scales implied by the
intrinsically fast STA processes. The potential minimum is displaced by
modulating the voltages on control (dc) electrodes. A secondary effect of the
modulation, usually ignored as it does not affect the ion dynamics, is the
time- dependent energy shift of the potential minimum. The non trivial part of
the energy consumption is due to the electromotive forces to set the electrode
voltages through the low-pass filters required to preserve the electronic noise
from decohering the ion's motion. The results for the macroscopic CS (the Paul
trap) are compared to the microscopic power and energy of the ion alone.
Similarities are found -and may be used quantitatively to minimize costs- only
when the CS-dependent energy shift of the harmonic oscillator is included in
the ion energy.
| quant-ph | there is recent interest in determining energy costs of shortcuts to adiabaticity sta but different definitions of cost have been used we demonstrate the importance of taking into account the control system cs for a fair assessment of energy flows and consumptions we model the energy consumption and power to transport an ion by a sta protocol in a multisegmented paul trap the ion is driven by an externally controlled moving harmonic oscillator even if no net ion energy is gained at destination setting the timedependent control parameters is a macroscopic operation that costs energy and results in energy dissipation for the short time scales implied by the intrinsically fast sta processes the potential minimum is displaced by modulating the voltages on control dc electrodes a secondary effect of the modulation usually ignored as it does not affect the ion dynamics is the time dependent energy shift of the potential minimum the non trivial part of the energy consumption is due to the electromotive forces to set the electrode voltages through the lowpass filters required to preserve the electronic noise from decohering the ions motion the results for the macroscopic cs the paul trap are compared to the microscopic power and energy of the ion alone similarities are found and may be used quantitatively to minimize costs only when the csdependent energy shift of the harmonic oscillator is included in the ion energy | [['there', 'is', 'recent', 'interest', 'in', 'determining', 'energy', 'costs', 'of', 'shortcuts', 'to', 'adiabaticity', 'sta', 'but', 'different', 'definitions', 'of', 'cost', 'have', 'been', 'used', 'we', 'demonstrate', 'the', 'importance', 'of', 'taking', 'into', 'account', 'the', 'control', 'system', 'cs', 'for', 'a', 'fair', 'assessment', 'of', 'energy', 'flows', 'and', 'consumptions', 'we', 'model', 'the', 'energy', 'consumption', 'and', 'power', 'to', 'transport', 'an', 'ion', 'by', 'a', 'sta', 'protocol', 'in', 'a', 'multisegmented', 'paul', 'trap', 'the', 'ion', 'is', 'driven', 'by', 'an', 'externally', 'controlled', 'moving', 'harmonic', 'oscillator', 'even', 'if', 'no', 'net', 'ion', 'energy', 'is', 'gained', 'at', 'destination', 'setting', 'the', 'timedependent', 'control', 'parameters', 'is', 'a', 'macroscopic', 'operation', 'that', 'costs', 'energy', 'and', 'results', 'in', 'energy', 'dissipation', 'for', 'the', 'short', 'time', 'scales', 'implied', 'by', 'the', 'intrinsically', 'fast', 'sta', 'processes', 'the', 'potential', 'minimum', 'is', 'displaced', 'by', 'modulating', 'the', 'voltages', 'on', 'control', 'dc', 'electrodes', 'a', 'secondary', 'effect', 'of', 'the', 'modulation', 'usually', 'ignored', 'as', 'it', 'does', 'not', 'affect', 'the', 'ion', 'dynamics', 'is', 'the', 'time', 'dependent', 'energy', 'shift', 'of', 'the', 'potential', 'minimum', 'the', 'non', 'trivial', 'part', 'of', 'the', 'energy', 'consumption', 'is', 'due', 'to', 'the', 'electromotive', 'forces', 'to', 'set', 'the', 'electrode', 'voltages', 'through', 'the', 'lowpass', 'filters', 'required', 'to', 'preserve', 'the', 'electronic', 'noise', 'from', 'decohering', 'the', 'ions', 'motion', 'the', 'results', 'for', 'the', 'macroscopic', 'cs', 'the', 'paul', 'trap', 'are', 'compared', 'to', 'the', 'microscopic', 'power', 'and', 'energy', 'of', 'the', 'ion', 'alone', 'similarities', 'are', 'found', 'and', 'may', 'be', 'used', 'quantitatively', 'to', 'minimize', 'costs', 'only', 'when', 'the', 'csdependent', 'energy', 'shift', 'of', 'the', 'harmonic', 'oscillator', 'is', 'included', 'in', 'the', 'ion', 'energy']] | [-0.14080541350794473, 0.17108048624592403, -0.04229884531051884, 0.0455966836859167, -0.009657052054535598, -0.16549599267028528, 0.054238811587279556, 0.384518287439654, -0.2948643360136414, -0.3106574138208967, 0.05248767695568325, -0.2721243866815649, -0.040668593201754165, 0.20951822455089283, -0.06974907171840233, 0.05867949010932754, 0.04336984487409954, 0.030044196327096494, 0.005988496313311144, -0.1717705999095603, 0.2478116388020712, 0.1643492689174058, 0.29277277133098384, 0.1028875904960622, 0.10583814038044034, -0.0282018477938154, 0.028373884045165675, 0.03153908588313337, -0.0859668937298544, 0.08037125493263311, 0.215368555055867, 0.033551122444272365, 0.30322859982622724, -0.4893677426213077, -0.22796514792496275, 0.12337669701835317, 0.07697677141424783, 0.14622070886403452, -0.06715838921232277, -0.22808388225204343, 0.014631875521696076, -0.16610438966368934, -0.0960780501682793, -0.0634974760167975, 0.034945767120947935, 0.0903988551711744, -0.28421718593167966, 0.07348120522259831, 0.05763822183181564, 0.03769003135826567, -0.09533541158628489, -0.08051859172902086, -0.05534012525659536, 0.11404782829538754, 0.024522268371395605, 0.012930210764572056, 0.22140851588658828, -0.09321093261803917, -0.08258218684530785, 0.3802417033343929, -0.038945591483658566, -0.19518587944511293, 0.14606591029060556, -0.121944416757946, -0.04033250092922164, 0.1591418488227144, 0.16245407833123643, 0.041866379292232206, -0.18512441237500502, 0.057108670628528264, 0.06618706260181578, 0.17292106207376742, 0.07555654414544075, 0.04009884319033329, 0.18798991568699672, 0.15378103774253696, 0.1028203391881483, 0.13125158800652698, -0.08700884031513224, -0.09367499571967998, -0.27341174862973777, -0.1215390877452968, -0.2248835521449078, 0.027198438096155738, -0.02772532186664366, -0.08240662272836399, 0.44186281067006095, 0.12465076380788653, 0.15592837242830088, -0.013602364232265872, 0.34642881858323155, 0.18806338776009618, 0.07463592709371306, 0.08852443297216488, 0.26861618130451775, 0.11804972060731259, 0.1605124856598258, -0.3140063412597399, 0.05185559129689676, 0.02328790413970449] |
1,802.08572 | Bayesian Lasso : Concentration and MCMC Diagnosis | Using posterior distribution of Bayesian LASSO we construct a semi-norm on
the parameter space. We show that the partition function depends on the ratio
of the l 1 and l 2 norms and present three regimes. We derive the con-
centration of Bayesian LASSO, and present MCMC convergence diagnosis.
Keywords: LASSO, Bayes, MCMC, log-concave, geometry, incomplete Gamma
function
| math.ST stat.TH | using posterior distribution of bayesian lasso we construct a seminorm on the parameter space we show that the partition function depends on the ratio of the l 1 and l 2 norms and present three regimes we derive the con centration of bayesian lasso and present mcmc convergence diagnosis keywords lasso bayes mcmc logconcave geometry incomplete gamma function | [['using', 'posterior', 'distribution', 'of', 'bayesian', 'lasso', 'we', 'construct', 'a', 'seminorm', 'on', 'the', 'parameter', 'space', 'we', 'show', 'that', 'the', 'partition', 'function', 'depends', 'on', 'the', 'ratio', 'of', 'the', 'l', '1', 'and', 'l', '2', 'norms', 'and', 'present', 'three', 'regimes', 'we', 'derive', 'the', 'con', 'centration', 'of', 'bayesian', 'lasso', 'and', 'present', 'mcmc', 'convergence', 'diagnosis', 'keywords', 'lasso', 'bayes', 'mcmc', 'logconcave', 'geometry', 'incomplete', 'gamma', 'function']] | [-0.04439691598687706, 0.01850500793983068, -0.13288693261083923, 0.13699757224269982, -0.11156188678959834, -0.1267456666662775, 0.07200408177771445, 0.4255571522717846, -0.2953947332551189, -0.26433052347394925, 0.10893798517544978, -0.2400204425452855, -0.13095373913228256, 0.1185624258520467, -0.06542941324155906, 0.08660384469890389, 0.059993217201453855, -0.01680841203778982, -0.11427801191919194, -0.2790298982812413, 0.2813887945858055, 0.04085689163285083, 0.28681298268252403, -0.07508249686838224, 0.1441294731941588, 0.10345868474868095, -0.03899307809127816, -0.0386932496676936, -0.280304733869155, 0.13177355823653011, 0.23080967005005043, 0.22770904189232608, 0.3547185596464009, -0.29105920428089027, -0.1660381135859944, 0.13861492362901054, 0.16736111536236672, -0.040982525297922304, 0.017192405355484063, -0.2583832755636681, 0.014835885131795859, -0.15644780938224545, -0.04150878927863107, -0.11393922348988467, -0.057199907220161425, 0.04899487741580554, -0.37549520283937454, 0.1444546347002274, 0.013605441994451243, 0.062130587416347756, -0.035792692702921944, -0.2551561014501956, 0.02652963172194773, 0.013172148365591621, 0.0680816146256081, 0.015036903209342012, 0.14048621240714243, -0.08081223414247406, -0.07794858443004818, 0.25322808174352196, -0.06269981045725531, -0.273363495895896, 0.09871389234367284, -0.11224508356174519, -0.1849745218481483, 0.07367111421350775, 0.18473187206184555, 0.14376546590235725, -0.07740060145292303, 0.16644821592690906, -0.0397001490707445, 0.1303803490410591, 0.0036439782586590998, -0.05319731104878131, 0.049786917351443194, 0.1579126446018124, 0.15037645792973967, 0.1430427342781733, -0.19104271773891202, -0.05744457479309419, -0.33793449653553426, -0.14931507569191785, -0.2103774690627249, 0.02969815464818786, -0.22370919500851946, -0.2479511507754696, 0.3080630007376573, 0.13273462023714494, 0.21969946868043264, 0.17389803560017125, 0.21530518276167326, 0.09435056822759838, -0.04257297653961798, 0.11485619059410589, 0.17569507738768025, 0.15259058661919472, -0.008305218151031897, -0.17697255695559855, 0.10994143868346923, 0.11336372465553597] |
1,802.08573 | Higher order Seiberg-Witten functionals and their associated gradient
flows | We define functionals generalising the Seiberg-Witten functional on closed
$spin^c$ manifolds, involving higher order derivatives of the curvature form
and spinor field. We then consider their associated gradient flows and, using a
gauge fixing technique, are able to prove short time existence for the flows.
We then prove energy estimates along the flow, and establish local
$L^2$-derivative estimates. These are then used to show long time existence of
the flow in sub-critical dimensions. In the critical dimension, we are able to
show that long time existence is obstructed by an $L^{k+2}$ curvature
concentration phenomenon.
| math.DG | we define functionals generalising the seibergwitten functional on closed spinc manifolds involving higher order derivatives of the curvature form and spinor field we then consider their associated gradient flows and using a gauge fixing technique are able to prove short time existence for the flows we then prove energy estimates along the flow and establish local l2derivative estimates these are then used to show long time existence of the flow in subcritical dimensions in the critical dimension we are able to show that long time existence is obstructed by an lk2 curvature concentration phenomenon | [['we', 'define', 'functionals', 'generalising', 'the', 'seibergwitten', 'functional', 'on', 'closed', 'spinc', 'manifolds', 'involving', 'higher', 'order', 'derivatives', 'of', 'the', 'curvature', 'form', 'and', 'spinor', 'field', 'we', 'then', 'consider', 'their', 'associated', 'gradient', 'flows', 'and', 'using', 'a', 'gauge', 'fixing', 'technique', 'are', 'able', 'to', 'prove', 'short', 'time', 'existence', 'for', 'the', 'flows', 'we', 'then', 'prove', 'energy', 'estimates', 'along', 'the', 'flow', 'and', 'establish', 'local', 'l2derivative', 'estimates', 'these', 'are', 'then', 'used', 'to', 'show', 'long', 'time', 'existence', 'of', 'the', 'flow', 'in', 'subcritical', 'dimensions', 'in', 'the', 'critical', 'dimension', 'we', 'are', 'able', 'to', 'show', 'that', 'long', 'time', 'existence', 'is', 'obstructed', 'by', 'an', 'lk2', 'curvature', 'concentration', 'phenomenon']] | [-0.18206832984522467, 0.1291589723733787, -0.08915111099580122, 0.12018702750629996, -0.06445502545384149, -0.10255769500508904, -0.04591957527282898, 0.3789037614860522, -0.28285026193786694, -0.23294764607944476, 0.13530058081021473, -0.22981508881334337, -0.15767556955156628, 0.16727353820717464, -0.07195747857262451, 0.05428121492807423, -0.0005138934870320622, 0.0792982453800818, -0.0752446949156502, -0.2610683035511043, 0.37833202099527724, -0.05079086024347963, 0.23287542392399602, 0.10080352096608089, 0.12379532889212652, -0.029285454919802084, -0.01669394363078379, 0.04392264755342596, -0.2164921846760403, 0.11852704939903111, 0.201678637452724, 0.030446659655921082, 0.23669066718749462, -0.46576366219068727, -0.2360180639411493, 0.14247315886720854, 0.11988894006998468, 0.07323292714934196, -0.028305493824694668, -0.2807692040599162, 0.12684813087996377, -0.08741862017420991, -0.1955801478339239, -0.1566940099451571, -0.01325089639298097, 0.06360572212505886, -0.24154943067540405, 0.11094132638336109, 0.04318475865468543, 0.04179596550442198, -0.1155547520927509, -0.04212888587085951, -0.05216599659874074, 0.11863082597628036, 0.1066712470216957, 0.022208692160465063, 0.07635087056225666, -0.09190729994487057, -0.08584520819106249, 0.3040538225873744, -0.13894550833395453, -0.2514748602374194, 0.16282739844774047, -0.1288857981412401, -0.14797758054168475, 0.10712213557894512, 0.17185481039366574, 0.16750118240553846, -0.09369220202588426, 0.09836833633955629, -0.016854356533737593, 0.11408673723538716, 0.11415222777374169, -0.008594340419456843, 0.13887414687202984, 0.07793373178931014, 0.17638412653718905, 0.13211765438718823, -0.07479714004695916, -0.10375401153359362, -0.3511178588835142, -0.21168005957158023, -0.11594013918832105, 0.12276893090056155, -0.11826414953349584, -0.15188906152522372, 0.3613890092219076, 0.12409248685724633, 0.19397930867008625, 0.13515364999572435, 0.22607180716279612, 0.14816074491408404, 0.04405991860505153, 0.1296048632557554, 0.19412698401939324, 0.17863111290329647, 0.08677381942529351, -0.1763583069707277, -0.009561195228529233, 0.18052258347511613] |
1,802.08574 | Strong measure zero and meager-additive sets through the prism of
fractal measures | We develop a theory of \emph{sharp measure zero} sets that parallels Borel's
\emph{strong measure zero}, and prove a theorem analogous to
Galvin-Myscielski-Solovay Theorem, namely that a set of reals has sharp measure
zero if and only if it is meager-additive. Some consequences: A subset of
$2^\omega$ is meager-additive if and only if it is $\mathcal E$-additive; if
$f:2^\omega\to2^\omega$ is continuous and $X$ is meager-additive, then so is
$f(X)$.
| math.LO | we develop a theory of emphsharp measure zero sets that parallels borels emphstrong measure zero and prove a theorem analogous to galvinmyscielskisolovay theorem namely that a set of reals has sharp measure zero if and only if it is meageradditive some consequences a subset of 2omega is meageradditive if and only if it is mathcal eadditive if f2omegato2omega is continuous and x is meageradditive then so is fx | [['we', 'develop', 'a', 'theory', 'of', 'emphsharp', 'measure', 'zero', 'sets', 'that', 'parallels', 'borels', 'emphstrong', 'measure', 'zero', 'and', 'prove', 'a', 'theorem', 'analogous', 'to', 'galvinmyscielskisolovay', 'theorem', 'namely', 'that', 'a', 'set', 'of', 'reals', 'has', 'sharp', 'measure', 'zero', 'if', 'and', 'only', 'if', 'it', 'is', 'meageradditive', 'some', 'consequences', 'a', 'subset', 'of', '2omega', 'is', 'meageradditive', 'if', 'and', 'only', 'if', 'it', 'is', 'mathcal', 'eadditive', 'if', 'f2omegato2omega', 'is', 'continuous', 'and', 'x', 'is', 'meageradditive', 'then', 'so', 'is', 'fx']] | [-0.1347065325933867, 0.1503554229123088, -0.16519704623720965, 0.09191295703371558, -0.1016067155278646, -0.20240544433204027, 0.08058873894803513, 0.35175772215454626, -0.3270937306376604, -0.09010920370570742, 0.13059018556601726, -0.3335783093021466, -0.16304668166603034, 0.19214638887116542, -0.12977478782144877, -0.0472226458028532, 0.044334068063359995, 0.14961317284749104, -0.025020610662893607, -0.23871996308175417, 0.34004619168117645, -0.1266317628753873, 0.23490296130856642, 0.12626115479864752, 0.17495729417468492, -0.02342974694015888, 0.05732924936052698, 0.050033637164877014, -0.15327528188690148, 0.027784793394116256, 0.22115714269188735, 0.2063906117234952, 0.34717616914556576, -0.2802608952499353, -0.13955802218272137, 0.2663265347480774, 0.05355656349028532, -0.016243988146575596, 0.008483616903854104, -0.19343009573908954, 0.23092377578409817, -0.12056917957961559, -0.14301721307520682, -0.08758865975541993, 0.1708396526483389, 0.01450241286880695, -0.3040140072492739, -0.002001056161064368, 0.14925050494762568, 0.03182566399471118, 0.00916879062469189, -0.049289354205561374, -0.08604396065482153, 0.04732493405015423, 0.029943333229479882, 0.16211092297453433, 0.04991184925087369, -0.008033437511095634, -0.05356448053453977, 0.3572258264542772, -0.08105151014259228, -0.24596431052598816, 0.16025062194452264, -0.22239194354758812, -0.1566160155746799, 0.07604063858206456, 0.012879004487051414, 0.13205667381676345, -0.08669149021689708, 0.24495414406276092, -0.18206070546920483, 0.18415306802265918, 0.10538967161511, 0.04008176480599034, 0.12065264513859382, 0.09162598134806522, 0.17480416402507287, 0.10554075951043229, -0.004773522626895171, 0.027275331891500033, -0.34120875992454014, -0.1595524630580957, -0.21539651651938374, 0.15562368946579785, -0.03829209763610449, -0.1991721336514904, 0.28352766145880404, 0.11386487452456584, 0.16540220703643102, 0.08687998315032858, 0.2674468545959546, 0.15239838865930394, 0.0035567750348351325, 0.09760035487035146, 0.1405152437406986, 0.19916478068782734, -0.06741129414966474, -0.07947293759252017, 0.0490521622606768, 0.12680732298355837] |
1,802.08575 | Complexity, Centralization, and Fragility in Economic Networks | Trade networks, across which countries distribute their products, are crucial
components of the globalized world economy. Their structure is strongly
heterogeneous across products, given the different features of the countries
which buy and sell goods. By using a diversified pool of indicators from
network science and product complexity theory, we quantitatively confirm the
intuition that, overall, products with higher complexity -- i.e., with larger
technological content and number of components -- are traded through a more
centralized network -- i.e., with a small number of countries concentrating
most of the export flow. Since centralized networks are known to be more
vulnerable, we argue that the current composition of production and trading is
associated to high fragility at the level of the most complex -- thus strategic
-- products.
| physics.soc-ph q-fin.GN | trade networks across which countries distribute their products are crucial components of the globalized world economy their structure is strongly heterogeneous across products given the different features of the countries which buy and sell goods by using a diversified pool of indicators from network science and product complexity theory we quantitatively confirm the intuition that overall products with higher complexity ie with larger technological content and number of components are traded through a more centralized network ie with a small number of countries concentrating most of the export flow since centralized networks are known to be more vulnerable we argue that the current composition of production and trading is associated to high fragility at the level of the most complex thus strategic products | [['trade', 'networks', 'across', 'which', 'countries', 'distribute', 'their', 'products', 'are', 'crucial', 'components', 'of', 'the', 'globalized', 'world', 'economy', 'their', 'structure', 'is', 'strongly', 'heterogeneous', 'across', 'products', 'given', 'the', 'different', 'features', 'of', 'the', 'countries', 'which', 'buy', 'and', 'sell', 'goods', 'by', 'using', 'a', 'diversified', 'pool', 'of', 'indicators', 'from', 'network', 'science', 'and', 'product', 'complexity', 'theory', 'we', 'quantitatively', 'confirm', 'the', 'intuition', 'that', 'overall', 'products', 'with', 'higher', 'complexity', 'ie', 'with', 'larger', 'technological', 'content', 'and', 'number', 'of', 'components', 'are', 'traded', 'through', 'a', 'more', 'centralized', 'network', 'ie', 'with', 'a', 'small', 'number', 'of', 'countries', 'concentrating', 'most', 'of', 'the', 'export', 'flow', 'since', 'centralized', 'networks', 'are', 'known', 'to', 'be', 'more', 'vulnerable', 'we', 'argue', 'that', 'the', 'current', 'composition', 'of', 'production', 'and', 'trading', 'is', 'associated', 'to', 'high', 'fragility', 'at', 'the', 'level', 'of', 'the', 'most', 'complex', 'thus', 'strategic', 'products']] | [-0.11390079252755012, 0.12467718958036929, -0.035595121308858314, 0.057392306775384684, -0.06493977490600532, -0.12660178656659535, 0.09085556423401354, 0.381358762279274, -0.2927930164889137, -0.30790832268483026, 0.12686991503810494, -0.3122940444183059, -0.13884772713924567, 0.18456971101705136, -0.08198702542633726, -0.034888592092471755, 0.04696283595469909, 0.030613972858442525, 0.027724391016049114, -0.3267102538801094, 0.34659768242343536, 0.06717051925398863, 0.3581278280741194, 0.039477703699130354, 0.04914251797476677, -0.047900642177498926, -0.08739247192047551, 0.03534184670931379, -0.037654797126926154, 0.22978100639094062, 0.3308891947494774, 0.18394769767556735, 0.30666867902737144, -0.4507442724046759, -0.15168320839444735, 0.12745950202650685, 0.0815468577353844, 0.012999551611142308, 0.040552937609997265, -0.24418293886318257, 0.07894518664788182, -0.2602732075677382, -0.07920222865735613, -0.09956483801872265, 0.019026964709798738, 0.06511058473989852, -0.2154592466758322, 0.03690187911771813, -0.04379019396364447, 0.05773812663983705, -0.023411743481060475, -0.12281616218009495, -0.1078811317939705, 0.21440496716300042, 0.08341352852455121, -0.05762593279004938, 0.18615395367539267, -0.20158558407783267, -0.12276168364456029, 0.39153002874880305, 0.0036949256806051343, -0.14307654554751226, 0.22145914529427524, -0.14132004307688978, -0.12956937412330047, 0.11629125557468856, 0.21170477005009486, 0.06427759019567109, -0.14020669651151507, 0.0011912366276894642, -0.021958998692168937, 0.16213155728651257, 0.07857532842024191, 0.04638015888479909, 0.2103907954046215, 0.18561184886706675, 0.11953279614432931, 0.10515242903133688, -0.005391020430498037, -0.15979809980513907, -0.18743232380205055, -0.13896913703046437, -0.14117663978727732, 0.04190338872433678, -0.1624455599154997, -0.16568470845468403, 0.3708558122710726, 0.10489381585228522, 0.16053887563416872, 0.07131061155294122, 0.3001939409632024, 0.04103186145250693, 0.108825685293603, 0.13333094633010223, 0.17750062935463176, 0.027658739397908007, 0.16191868931130787, -0.12283278474720513, 0.16578369094361742, -0.03919941106076708] |
1,802.08576 | Volume average regularization for the Wheeler-DeWitt equation | In this article, I present a volume average regularization for the second
functional derivative operator that appears in the metric-basis Wheeler-DeWitt
equation. Naively, the second functional derivative operator in the
Wheeler-DeWitt equation is infinite, since it contains terms with a factor of a
delta function or derivatives of the delta function. More precisely, the second
functional derivative contains terms that are only well defined as a
distribution---these terms only yield meaningful results when they appear
within an integral. The second functional derivative may, therefore, be
regularized by performing an integral average of the distributional terms over
some finite volume; I argue that such a regularization is appropriate if one
regards quantum general relativity (from which the Wheeler-DeWitt equation may
be derived) to be the low-energy effective field theory of a full theory of
quantum gravity. I also show that a volume average regularization can be viewed
as a natural generalization of the same-variable second partial derivative for
an ordinary multivariable function. Using the regularized second functional
derivative operator, I construct an approximate solution to the Wheeler-DeWitt
equation in the low-curvature, long-distance limit.
| gr-qc | in this article i present a volume average regularization for the second functional derivative operator that appears in the metricbasis wheelerdewitt equation naively the second functional derivative operator in the wheelerdewitt equation is infinite since it contains terms with a factor of a delta function or derivatives of the delta function more precisely the second functional derivative contains terms that are only well defined as a distributionthese terms only yield meaningful results when they appear within an integral the second functional derivative may therefore be regularized by performing an integral average of the distributional terms over some finite volume i argue that such a regularization is appropriate if one regards quantum general relativity from which the wheelerdewitt equation may be derived to be the lowenergy effective field theory of a full theory of quantum gravity i also show that a volume average regularization can be viewed as a natural generalization of the samevariable second partial derivative for an ordinary multivariable function using the regularized second functional derivative operator i construct an approximate solution to the wheelerdewitt equation in the lowcurvature longdistance limit | [['in', 'this', 'article', 'i', 'present', 'a', 'volume', 'average', 'regularization', 'for', 'the', 'second', 'functional', 'derivative', 'operator', 'that', 'appears', 'in', 'the', 'metricbasis', 'wheelerdewitt', 'equation', 'naively', 'the', 'second', 'functional', 'derivative', 'operator', 'in', 'the', 'wheelerdewitt', 'equation', 'is', 'infinite', 'since', 'it', 'contains', 'terms', 'with', 'a', 'factor', 'of', 'a', 'delta', 'function', 'or', 'derivatives', 'of', 'the', 'delta', 'function', 'more', 'precisely', 'the', 'second', 'functional', 'derivative', 'contains', 'terms', 'that', 'are', 'only', 'well', 'defined', 'as', 'a', 'distributionthese', 'terms', 'only', 'yield', 'meaningful', 'results', 'when', 'they', 'appear', 'within', 'an', 'integral', 'the', 'second', 'functional', 'derivative', 'may', 'therefore', 'be', 'regularized', 'by', 'performing', 'an', 'integral', 'average', 'of', 'the', 'distributional', 'terms', 'over', 'some', 'finite', 'volume', 'i', 'argue', 'that', 'such', 'a', 'regularization', 'is', 'appropriate', 'if', 'one', 'regards', 'quantum', 'general', 'relativity', 'from', 'which', 'the', 'wheelerdewitt', 'equation', 'may', 'be', 'derived', 'to', 'be', 'the', 'lowenergy', 'effective', 'field', 'theory', 'of', 'a', 'full', 'theory', 'of', 'quantum', 'gravity', 'i', 'also', 'show', 'that', 'a', 'volume', 'average', 'regularization', 'can', 'be', 'viewed', 'as', 'a', 'natural', 'generalization', 'of', 'the', 'samevariable', 'second', 'partial', 'derivative', 'for', 'an', 'ordinary', 'multivariable', 'function', 'using', 'the', 'regularized', 'second', 'functional', 'derivative', 'operator', 'i', 'construct', 'an', 'approximate', 'solution', 'to', 'the', 'wheelerdewitt', 'equation', 'in', 'the', 'lowcurvature', 'longdistance', 'limit']] | [-0.11520682554887139, 0.04982989840957404, -0.12447121291676297, 0.11105343238801783, -0.10558401099172052, -0.10462313843891025, -0.012987438714204554, 0.27653931546175864, -0.30319457270163397, -0.2482646529006059, 0.10660208412316009, -0.28547961442788555, -0.1942276246237631, 0.14316681555378663, -0.0806198457864701, 0.016713070438644072, 0.028152235930619045, 0.13867063749862532, -0.12805342548669904, -0.25441059339063127, 0.3175517172713936, 0.012227169382411925, 0.18893792672998497, 0.03876765694875041, 0.14711907318944123, -0.009208251984904431, 0.00912318519946167, 0.049359137840131975, -0.11640831553224375, 0.11081125151740606, 0.24898704538491226, 0.06947874904261621, 0.31995437369166807, -0.41826918472499486, -0.23922091751624752, 0.08972257858287938, 0.12692345671782362, 0.09931409136098211, 0.019523747414516353, -0.26276176121650396, 0.054428903692969065, -0.19989757821244816, -0.16619302861278035, -0.09362481965518533, 0.007892202719260402, -0.00610161320093041, -0.2843800951003529, 0.1445927444501395, -0.002806459810433899, 2.0913849080725462e-05, -0.07276654857673875, -0.0977818595763171, -0.006116749173779477, 0.054508388064074584, 0.03352998597443353, 0.09018505219755142, 0.06751571070434079, -0.1337067769985391, -0.06968467449379159, 0.3735247762592811, -0.13641558958129052, -0.289766072402266, 0.06461130461770022, -0.1422773237423399, -0.13459441393312047, 0.08523612330307453, 0.08068445453930168, 0.16732369562969984, -0.17728614467809137, 0.13423925156668662, -0.0006787423460676683, 0.17303540984522447, 0.06526943529154793, 0.04244035149842511, 0.15120544548890444, 0.08842795894626923, 0.10184020095364342, 0.09060911501285636, -0.003664610275280709, -0.1342476218257245, -0.41759467572390035, -0.21330928954675626, -0.19804810033981068, 0.0788786159555152, -0.15797878129036405, -0.2121743953438195, 0.36208681606651183, 0.0940730663409259, 0.1493549378245403, 0.06212278971170185, 0.25401270059691794, 0.2863409258516287, 0.07665958953501043, 0.04415468017274108, 0.20246884457629782, 0.10762891619643145, 0.07620953717047879, -0.20620498473543997, 0.01867007903784628, 0.1514887807360075] |
1,802.08577 | On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on
Interval Graphs and Falling Platforms in Video Games | We introduce a simplified model for platform game levels with falling
platforms based on interval graphs and show that solvability of such levels
corresponds to finding Steiner cycles or Steiner paths in the corresponding
graphs. Linear time algorithms are obtained for both of these problems. We also
study these algorithms as streaming algorithms and analyze the necessary memory
with respect to the maximum number of intervals contained in another interval.
This corresponds to understanding which parts of a level have to be visible at
each point to allow the player to make optimal deterministic decisions.
| cs.DS math.OC | we introduce a simplified model for platform game levels with falling platforms based on interval graphs and show that solvability of such levels corresponds to finding steiner cycles or steiner paths in the corresponding graphs linear time algorithms are obtained for both of these problems we also study these algorithms as streaming algorithms and analyze the necessary memory with respect to the maximum number of intervals contained in another interval this corresponds to understanding which parts of a level have to be visible at each point to allow the player to make optimal deterministic decisions | [['we', 'introduce', 'a', 'simplified', 'model', 'for', 'platform', 'game', 'levels', 'with', 'falling', 'platforms', 'based', 'on', 'interval', 'graphs', 'and', 'show', 'that', 'solvability', 'of', 'such', 'levels', 'corresponds', 'to', 'finding', 'steiner', 'cycles', 'or', 'steiner', 'paths', 'in', 'the', 'corresponding', 'graphs', 'linear', 'time', 'algorithms', 'are', 'obtained', 'for', 'both', 'of', 'these', 'problems', 'we', 'also', 'study', 'these', 'algorithms', 'as', 'streaming', 'algorithms', 'and', 'analyze', 'the', 'necessary', 'memory', 'with', 'respect', 'to', 'the', 'maximum', 'number', 'of', 'intervals', 'contained', 'in', 'another', 'interval', 'this', 'corresponds', 'to', 'understanding', 'which', 'parts', 'of', 'a', 'level', 'have', 'to', 'be', 'visible', 'at', 'each', 'point', 'to', 'allow', 'the', 'player', 'to', 'make', 'optimal', 'deterministic', 'decisions']] | [-0.12247299723523228, 0.06883952040102725, -0.055377419239008116, 0.05291424481761887, -0.06245922175187029, -0.16552728743929612, 0.10893724356581898, 0.42687248044500226, -0.2795533583156372, -0.3365643970061731, 0.12588409214574647, -0.259222132511633, -0.12674987817330188, 0.1865635970411332, -0.09001341443999034, 0.06770132683511627, 0.1076532389037311, 0.08559893661570785, -0.016204161076855503, -0.2714875878839705, 0.2816740652534798, 0.022392156112350917, 0.2141323869459723, 0.03721520039498022, 0.10210231538175753, 0.0007303638383746147, -0.012438260126662881, 0.05776561598881687, -0.15739322621168533, 0.12329136928249347, 0.30241387324701796, 0.15163489197331823, 0.29613760557319774, -0.42454819745923345, -0.14046402918419948, 0.1618988356602035, 0.11106462521650093, 0.09866937763719379, 0.03808849830253932, -0.2265471496864369, 0.11876874315601431, -0.09758168819703554, -0.08021396477584188, -0.03425566690336717, 0.02021824738598968, 0.03880653337477461, -0.2803584993277725, -0.014832698831052862, 0.036239020644049894, 0.026389159578339833, -0.02916898576444701, -0.11887477556929776, 0.013380092201068214, 0.15970150133545855, 0.009563685432811709, -0.010008277744973863, 0.07905689713202024, -0.09377402763470616, -0.22448853883941314, 0.4093471273779869, -0.025209116693095942, -0.17333068231145213, 0.17507046599578308, -0.0931070689111948, -0.16350841819504766, 0.11455127366475369, 0.2279647210649656, 0.10858506849525791, -0.1323850973656303, 0.058576942140873715, -0.037325659928549276, 0.1621861411469964, 0.10442969765220034, 0.054211402495734785, 0.18015236023715453, 0.17534884111955762, 0.1657478390874243, 0.1640648563331189, -0.02322408704724359, -0.11468510362564734, -0.27489477354837094, -0.1336471376842574, -0.10390440038356343, -0.009643391147255898, -0.10576943075743896, -0.21545721846877744, 0.38499347664611905, 0.181690302589222, 0.20465106111215917, 0.12947020401418405, 0.2620510964409301, 0.13682115680758694, 0.0501316207559093, 0.14543905847485325, 0.16301823370893928, 0.07077881286018774, 0.08306441051199248, -0.1725791801600472, 0.051140658366248794, 0.09077319360926356] |
1,802.08578 | "Isocrater" impacts: Conditions and mantle dynamical responses for
different impactor types | Impactors of different types and sizes can produce a final crater of the same
diameter on a planet under certain conditions. We derive the condition for such
"isocrater impacts" from scaling laws, as well as relations that describe how
the different impactors affect the interior of the target planet; these
relations are also valid for impacts that are too small to affect the mantle.
The analysis reveals that in a given isocrater impact, asteroidal impactors
produce anomalies in the interior of smaller spatial extent than cometary or
similar impactors. The differences in the interior could be useful for
characterizing the projectile that formed a given crater on the basis of
geophysical observations and potentially offer a possibility to help constrain
the demographics of the ancient impactor population. A series of numerical
models of basin-forming impacts on Mercury, Venus, the Moon, and Mars
illustrates the dynamical effects of the different impactor types on different
planets. It shows that the signature of large impacts may be preserved to the
present in Mars, the Moon, and Mercury, where convection is less vigorous and
much of the anomaly merges with the growing lid. On the other hand, their
signature will long have been destroyed in Venus, whose vigorous convection and
recurring lithospheric instabilities obliterate larger coherent anomalies.
| astro-ph.EP | impactors of different types and sizes can produce a final crater of the same diameter on a planet under certain conditions we derive the condition for such isocrater impacts from scaling laws as well as relations that describe how the different impactors affect the interior of the target planet these relations are also valid for impacts that are too small to affect the mantle the analysis reveals that in a given isocrater impact asteroidal impactors produce anomalies in the interior of smaller spatial extent than cometary or similar impactors the differences in the interior could be useful for characterizing the projectile that formed a given crater on the basis of geophysical observations and potentially offer a possibility to help constrain the demographics of the ancient impactor population a series of numerical models of basinforming impacts on mercury venus the moon and mars illustrates the dynamical effects of the different impactor types on different planets it shows that the signature of large impacts may be preserved to the present in mars the moon and mercury where convection is less vigorous and much of the anomaly merges with the growing lid on the other hand their signature will long have been destroyed in venus whose vigorous convection and recurring lithospheric instabilities obliterate larger coherent anomalies | [['impactors', 'of', 'different', 'types', 'and', 'sizes', 'can', 'produce', 'a', 'final', 'crater', 'of', 'the', 'same', 'diameter', 'on', 'a', 'planet', 'under', 'certain', 'conditions', 'we', 'derive', 'the', 'condition', 'for', 'such', 'isocrater', 'impacts', 'from', 'scaling', 'laws', 'as', 'well', 'as', 'relations', 'that', 'describe', 'how', 'the', 'different', 'impactors', 'affect', 'the', 'interior', 'of', 'the', 'target', 'planet', 'these', 'relations', 'are', 'also', 'valid', 'for', 'impacts', 'that', 'are', 'too', 'small', 'to', 'affect', 'the', 'mantle', 'the', 'analysis', 'reveals', 'that', 'in', 'a', 'given', 'isocrater', 'impact', 'asteroidal', 'impactors', 'produce', 'anomalies', 'in', 'the', 'interior', 'of', 'smaller', 'spatial', 'extent', 'than', 'cometary', 'or', 'similar', 'impactors', 'the', 'differences', 'in', 'the', 'interior', 'could', 'be', 'useful', 'for', 'characterizing', 'the', 'projectile', 'that', 'formed', 'a', 'given', 'crater', 'on', 'the', 'basis', 'of', 'geophysical', 'observations', 'and', 'potentially', 'offer', 'a', 'possibility', 'to', 'help', 'constrain', 'the', 'demographics', 'of', 'the', 'ancient', 'impactor', 'population', 'a', 'series', 'of', 'numerical', 'models', 'of', 'basinforming', 'impacts', 'on', 'mercury', 'venus', 'the', 'moon', 'and', 'mars', 'illustrates', 'the', 'dynamical', 'effects', 'of', 'the', 'different', 'impactor', 'types', 'on', 'different', 'planets', 'it', 'shows', 'that', 'the', 'signature', 'of', 'large', 'impacts', 'may', 'be', 'preserved', 'to', 'the', 'present', 'in', 'mars', 'the', 'moon', 'and', 'mercury', 'where', 'convection', 'is', 'less', 'vigorous', 'and', 'much', 'of', 'the', 'anomaly', 'merges', 'with', 'the', 'growing', 'lid', 'on', 'the', 'other', 'hand', 'their', 'signature', 'will', 'long', 'have', 'been', 'destroyed', 'in', 'venus', 'whose', 'vigorous', 'convection', 'and', 'recurring', 'lithospheric', 'instabilities', 'obliterate', 'larger', 'coherent', 'anomalies']] | [-0.08546198606579365, 0.20910668825527645, -0.13335269219015827, 0.11923089958738395, -0.09445307013618437, -0.03164306599304733, 0.019107827040040205, 0.29266328402004266, -0.21982506926886525, -0.3398642912391194, 0.14105349690355448, -0.26177241130604, -0.1449324337156463, 0.21989767068458535, -0.10004261657330804, 0.015173168165743864, 0.11767106312514676, -0.0010662767109218367, -0.050030755615126675, -0.21780037041312145, 0.29937261931368664, 0.08286844685638403, 0.16139257120595302, 0.06350057477973428, 0.06104189520663145, -0.10428314851994198, -0.027893308060664698, -0.0048650666250366174, -0.15540622148232594, 0.06983000299588764, 0.19559966405695076, 0.1431886598890453, 0.1988322576331372, -0.5083593758026147, -0.24771047924960835, 0.07016993341835048, 0.11812387162477983, 0.050586183114039104, -0.03765550462398855, -0.2625830101392175, 0.07497000553679953, -0.19395827843699498, -0.15945805120502568, 0.01306785409166632, 0.08692138982380594, 0.03187619359563524, -0.2412791873374733, 0.05941055632807134, 0.0656224679886264, 0.11222424914274735, -0.10799775847898116, -0.1586620143738297, -0.08630627001551867, 0.17393569581285648, 0.10124510272308937, -0.0553633802442401, 0.17828679461500022, -0.08516861016418502, -0.010022883143737223, 0.42822889083007715, -0.056263110049025344, -0.14707806065978737, 0.26208655320668495, -0.2265252974325729, -0.11758348755692949, 0.14498236500967066, 0.20328102463865166, 0.0999122345533169, -0.09971249358004657, -0.01759614630313193, -0.05170674029720056, 0.1464300171264681, 0.12247413958166836, 0.034863632862010344, 0.3198420610896784, 0.17872749868850996, 0.0677318129372911, 0.08894120972030863, -0.15597818881798517, -0.0679413350232793, -0.2241872547335605, -0.1303813337697096, -0.13661587378230847, 0.006452977101724613, -0.11816200694266235, -0.15555238302452798, 0.35759678152246377, 0.1570287358497989, 0.1794104106344671, -0.015240549695814884, 0.2583765960497102, 0.036165376356030454, 0.11442733593260256, 0.07010512208892694, 0.29769672332463953, 0.051057424816695784, 0.08744378208256684, -0.2485360129431808, 0.18221988049953716, 0.006568890594616885] |
1,802.08579 | Nonparametric Estimation of a distribution function from doubly
truncated data under dependence | The NPMLE of a distribution function from doubly truncated data was
introduced in the seminal paper of Efron and Petrosian. The consistency of the
Efron-Petrosian estimator depends however on the assumption of independent
truncation. In this work we introduce an extension of the Efron-Petrosian NPMLE
when the variable of interest and the truncation variables may be dependent.
The proposed estimator is constructed on the basis of a copula function which
represents the dependence structure between the variable of interest and the
truncation variables. Two different iterative algorithms to compute the
estimator in practice are introduced, and their performance is explored through
an intensive Monte Carlo simulation study. We illustrate the use of the
estimators on two real data examples.
| stat.ME | the npmle of a distribution function from doubly truncated data was introduced in the seminal paper of efron and petrosian the consistency of the efronpetrosian estimator depends however on the assumption of independent truncation in this work we introduce an extension of the efronpetrosian npmle when the variable of interest and the truncation variables may be dependent the proposed estimator is constructed on the basis of a copula function which represents the dependence structure between the variable of interest and the truncation variables two different iterative algorithms to compute the estimator in practice are introduced and their performance is explored through an intensive monte carlo simulation study we illustrate the use of the estimators on two real data examples | [['the', 'npmle', 'of', 'a', 'distribution', 'function', 'from', 'doubly', 'truncated', 'data', 'was', 'introduced', 'in', 'the', 'seminal', 'paper', 'of', 'efron', 'and', 'petrosian', 'the', 'consistency', 'of', 'the', 'efronpetrosian', 'estimator', 'depends', 'however', 'on', 'the', 'assumption', 'of', 'independent', 'truncation', 'in', 'this', 'work', 'we', 'introduce', 'an', 'extension', 'of', 'the', 'efronpetrosian', 'npmle', 'when', 'the', 'variable', 'of', 'interest', 'and', 'the', 'truncation', 'variables', 'may', 'be', 'dependent', 'the', 'proposed', 'estimator', 'is', 'constructed', 'on', 'the', 'basis', 'of', 'a', 'copula', 'function', 'which', 'represents', 'the', 'dependence', 'structure', 'between', 'the', 'variable', 'of', 'interest', 'and', 'the', 'truncation', 'variables', 'two', 'different', 'iterative', 'algorithms', 'to', 'compute', 'the', 'estimator', 'in', 'practice', 'are', 'introduced', 'and', 'their', 'performance', 'is', 'explored', 'through', 'an', 'intensive', 'monte', 'carlo', 'simulation', 'study', 'we', 'illustrate', 'the', 'use', 'of', 'the', 'estimators', 'on', 'two', 'real', 'data', 'examples']] | [-0.06321759101692118, 0.023420538278071584, -0.1373624592870787, 0.07201255158767761, -0.050405502068896255, -0.06554442079064726, 0.05191697729771033, 0.3682926674099529, -0.24768286752866722, -0.2955045388901935, 0.14947765584772907, -0.2612837775367774, -0.15891572962976805, 0.17960821923275455, -0.09890214822395947, 0.07545013254226632, 0.042186180849661345, -0.01703701836268316, -0.10074004338772483, -0.2997071995838162, 0.3118300758881353, 0.0944972752178667, 0.2971179310952415, -0.014708847116616344, 0.12777701543620593, 0.05629057647707332, -0.11309783316428672, -0.010781891260515241, -0.14213784652989075, 0.12745781424024902, 0.19002818754490683, 0.15957444233416546, 0.3404427316497636, -0.34778761808533504, -0.1674034015408584, 0.10584175413740533, 0.1307731709646515, 0.05748132150326738, -0.01524098330087365, -0.24836964693562197, 0.03488400907592237, -0.1886515874384331, -0.09724785199001462, -0.07275143054415699, -0.01660415599075686, 0.04789813042974428, -0.33054760796411214, 0.08626742385515646, 0.034862448966146264, 0.057647763116543474, -0.021126423831813883, -0.1450961463724678, -0.0008043067044570666, 0.059263437010784153, 0.10052299518588179, 0.0015959669816299896, 0.09654628583660521, -0.08893314340277066, -0.10593572392777986, 0.2889373169491897, -0.04537276830622034, -0.24893919514695637, 0.15985787767102988, -0.1249156362306671, -0.14109718388322146, 0.056114984801461716, 0.1743552849134978, 0.15991270645059832, -0.17093778563530806, 0.1196546844195011, -0.056568710916057356, 0.12239782105027816, 0.0032080270843032528, -0.007333377871697596, 0.129045074322347, 0.16939019657350576, 0.03607093979127141, 0.1753048067785283, -0.119390201884001, -0.12038863357939139, -0.31458194048863936, -0.12102470503329542, -0.26602596343502777, -0.02565412994810701, -0.1445106261702325, -0.21333056397955208, 0.41184141818715747, 0.19018305473111788, 0.2021927892488717, 0.04734661103864083, 0.2810123989382023, 0.15148157908135101, 0.03568530692855882, 0.06913583642732696, 0.2168100890370884, 0.16025894825902431, 0.002832914998034845, -0.2165729006495084, 0.13020142625054704, 0.04912893032897733] |
1,802.0858 | Quantum Nonlocality and Indistinguishability | It is shown how a "meddlesome" photon indistinguishable from another photon
of an entangled pair can affect the result of an Einstein- Podolsky-Rosen (EPR)
experiment. This makes it clear the importance of the notion of field over that
of particle.
| quant-ph | it is shown how a meddlesome photon indistinguishable from another photon of an entangled pair can affect the result of an einstein podolskyrosen epr experiment this makes it clear the importance of the notion of field over that of particle | [['it', 'is', 'shown', 'how', 'a', 'meddlesome', 'photon', 'indistinguishable', 'from', 'another', 'photon', 'of', 'an', 'entangled', 'pair', 'can', 'affect', 'the', 'result', 'of', 'an', 'einstein', 'podolskyrosen', 'epr', 'experiment', 'this', 'makes', 'it', 'clear', 'the', 'importance', 'of', 'the', 'notion', 'of', 'field', 'over', 'that', 'of', 'particle']] | [-0.09413582965051039, 0.19830100389439254, -0.17162033170461655, 0.07384238387338626, -0.026192321352517374, -0.13410369458441168, -0.006660399051048817, 0.3598598083242392, -0.24157324870854305, -0.2876577810981335, -0.05669664007683213, -0.2953870116900175, -0.11404249420723854, 0.24424404461378565, -0.060902573383198336, -0.0011900774179360806, 0.07702370976599363, 0.10869328706310345, -0.014749327883458672, -0.22890837230265904, 0.35470771140012985, 0.11628407411850415, 0.2995126020545379, 0.08863981954084757, 0.17293351489859513, 0.06345010566740082, -0.03610350070998837, 0.016259106926811047, -0.04073142946361212, 0.07270994966324323, 0.22020952675778133, 0.18892652039917615, 0.2557931174643529, -0.33105658820997447, -0.12468461224283928, 0.14275835446105936, 0.13268890735717156, 0.16218442865647376, -0.03339540347074851, -0.2960835936932992, 0.01991993437210719, -0.2015494759230373, -0.14414951073913237, -0.01049819347472527, 0.011995373571363207, -0.05472502284325086, -0.22193169023077458, 0.047344525810331106, 0.11218442299809211, -0.01214963340988526, 0.005599409652252992, 0.016933099975666173, -0.02679207349697558, 0.0941703584498893, 0.039585932199723825, 0.055212673313247085, 0.12927034998742434, -0.14005134072608483, -0.14123038813853875, 0.37467968645386207, -0.07094080995720549, -0.17578726882138887, 0.16221445566043258, -0.12776930254096022, -0.050074073497970134, 0.146962775156284, 0.06248754277252234, 0.12480623725180824, -0.13801840100532922, 0.03340184764984327, -0.14168048726442534, 0.2390657448902344, 0.08082367138316233, 0.09773537331523421, 0.25237893618834323, 0.1030194711489364, 0.08239276157930875, 0.1664313249863111, -0.06151364867885908, -0.09692303634559114, -0.3496193698583505, -0.24332844513731125, -0.24481906846929818, 0.10751573925312513, -0.0679963622481013, -0.14706758524586733, 0.3787669583390921, 0.16582350785103747, 0.14309407961674225, -0.04420689832514677, 0.24633266213230598, 0.1009772912814067, 0.05520752554711623, -0.014591994014783548, 0.34716556049310243, 0.16054459381848574, 0.08618752230615474, -0.22962497311453214, 0.023525336470741492, -0.05995916591909451] |
1,802.08581 | X-ray study of a sample of FR0 radio galaxies: unveiling the nature of
the central engine | FR0s are compact radio sources that represent the bulk of the Radio-Loud (RL)
AGN population, but they are still poorly understood. Pilot studies on these
sources have been already performed at radio and optical wavelengths: here we
present the first X-ray study of a sample of 19 FR0 radio galaxies selected
from the SDSS/NVSS/FIRST sample of Best & Heckman (2012), with redshift $\leq$
0.15, radio size $\leq$ 10 kpc and optically classified as low-excitation
galaxies (LEG). The X-ray spectra are modeled with a power-law component
absorbed by Galactic column density with, in some cases, a contribution from
thermal extended gas. The X-ray photons are likely produced by the jet as
attested by the observed correlation between X-ray (2-10 keV) and radio (5 GHz)
luminosities, similar to FRIs. The estimated Eddington-scaled luminosities
indicate a low accretion rate. Overall, we find that the X-ray properties of
FR0s are indistinguishable from those of FRIs, thus adding another similarity
between AGN associated with compact and extended radio sources. A comparison
between FR0s and low luminosity BL Lacs, rules out important beaming effects in
the X-ray emission of the compact radio galaxies. FR0s have different X-ray
properties with respect to young radio sources (e.g. GPS/CSS sources),
generally characterized by higher X-ray luminosities and more complex spectra.
In conclusion, the paucity of extended radio emission in FR0s is probably
related to the intrinsic properties of their jets that prevent the formation of
extended structures, and/or to intermittent activity of their engines.
| astro-ph.HE astro-ph.GA | fr0s are compact radio sources that represent the bulk of the radioloud rl agn population but they are still poorly understood pilot studies on these sources have been already performed at radio and optical wavelengths here we present the first xray study of a sample of 19 fr0 radio galaxies selected from the sdssnvssfirst sample of best heckman 2012 with redshift leq 015 radio size leq 10 kpc and optically classified as lowexcitation galaxies leg the xray spectra are modeled with a powerlaw component absorbed by galactic column density with in some cases a contribution from thermal extended gas the xray photons are likely produced by the jet as attested by the observed correlation between xray 210 kev and radio 5 ghz luminosities similar to fris the estimated eddingtonscaled luminosities indicate a low accretion rate overall we find that the xray properties of fr0s are indistinguishable from those of fris thus adding another similarity between agn associated with compact and extended radio sources a comparison between fr0s and low luminosity bl lacs rules out important beaming effects in the xray emission of the compact radio galaxies fr0s have different xray properties with respect to young radio sources eg gpscss sources generally characterized by higher xray luminosities and more complex spectra in conclusion the paucity of extended radio emission in fr0s is probably related to the intrinsic properties of their jets that prevent the formation of extended structures andor to intermittent activity of their engines | [['fr0s', 'are', 'compact', 'radio', 'sources', 'that', 'represent', 'the', 'bulk', 'of', 'the', 'radioloud', 'rl', 'agn', 'population', 'but', 'they', 'are', 'still', 'poorly', 'understood', 'pilot', 'studies', 'on', 'these', 'sources', 'have', 'been', 'already', 'performed', 'at', 'radio', 'and', 'optical', 'wavelengths', 'here', 'we', 'present', 'the', 'first', 'xray', 'study', 'of', 'a', 'sample', 'of', '19', 'fr0', 'radio', 'galaxies', 'selected', 'from', 'the', 'sdssnvssfirst', 'sample', 'of', 'best', 'heckman', '2012', 'with', 'redshift', 'leq', '015', 'radio', 'size', 'leq', '10', 'kpc', 'and', 'optically', 'classified', 'as', 'lowexcitation', 'galaxies', 'leg', 'the', 'xray', 'spectra', 'are', 'modeled', 'with', 'a', 'powerlaw', 'component', 'absorbed', 'by', 'galactic', 'column', 'density', 'with', 'in', 'some', 'cases', 'a', 'contribution', 'from', 'thermal', 'extended', 'gas', 'the', 'xray', 'photons', 'are', 'likely', 'produced', 'by', 'the', 'jet', 'as', 'attested', 'by', 'the', 'observed', 'correlation', 'between', 'xray', '210', 'kev', 'and', 'radio', '5', 'ghz', 'luminosities', 'similar', 'to', 'fris', 'the', 'estimated', 'eddingtonscaled', 'luminosities', 'indicate', 'a', 'low', 'accretion', 'rate', 'overall', 'we', 'find', 'that', 'the', 'xray', 'properties', 'of', 'fr0s', 'are', 'indistinguishable', 'from', 'those', 'of', 'fris', 'thus', 'adding', 'another', 'similarity', 'between', 'agn', 'associated', 'with', 'compact', 'and', 'extended', 'radio', 'sources', 'a', 'comparison', 'between', 'fr0s', 'and', 'low', 'luminosity', 'bl', 'lacs', 'rules', 'out', 'important', 'beaming', 'effects', 'in', 'the', 'xray', 'emission', 'of', 'the', 'compact', 'radio', 'galaxies', 'fr0s', 'have', 'different', 'xray', 'properties', 'with', 'respect', 'to', 'young', 'radio', 'sources', 'eg', 'gpscss', 'sources', 'generally', 'characterized', 'by', 'higher', 'xray', 'luminosities', 'and', 'more', 'complex', 'spectra', 'in', 'conclusion', 'the', 'paucity', 'of', 'extended', 'radio', 'emission', 'in', 'fr0s', 'is', 'probably', 'related', 'to', 'the', 'intrinsic', 'properties', 'of', 'their', 'jets', 'that', 'prevent', 'the', 'formation', 'of', 'extended', 'structures', 'andor', 'to', 'intermittent', 'activity', 'of', 'their', 'engines']] | [-0.032474600895376945, 0.14620259510632988, -0.020712503534837515, 0.1704583270077636, -0.10400330521446105, -0.08872908709471118, 0.07858465560002889, 0.5365719703244575, -0.13220160593443508, -0.365268892650023, 0.07163101752622077, -0.32703732832530397, 0.0020260894029121464, 0.2203964468878847, 0.007518620622141187, -0.054840406539961084, -0.022162095183667577, -0.15305450302644522, -0.030383628657901632, -0.1884487326651689, 0.2882923360208793, 0.10828363657028342, 0.2129391248150127, -0.05876989784811474, 0.05364130881572825, -0.12849479958049975, -0.12679528289018469, 0.0027964487710702133, -0.039742871764883225, 0.06369254217169788, 0.29946859118072583, 0.09326597395814248, 0.1827397470466324, -0.33837140718667336, -0.22832528134873098, 0.07348781141716941, 0.17121416789597166, -0.04819060265328045, -0.04687906844416152, -0.26204506697520275, 0.08256060212568875, -0.21907072434002542, -0.1698647931940593, 0.10343650146100072, 0.04092893417380413, 0.06888624096414794, -0.14421676859736765, 0.16619669250428193, 0.01687982895506408, 0.06672288545832773, -0.1360692106227586, -0.08690883578165384, -0.05982756815513466, 0.059132886966192184, 0.04043454471151555, 0.05000012086219549, 0.19453971203293943, -0.1405101993903058, -0.12206675513209622, 0.38569943815155466, 0.0210337213895939, 0.024866299913552256, 0.26878031214158754, -0.22041318785790123, -0.2280786571489578, 0.19964398520350946, 0.1578486580631615, 0.10335516655691152, -0.15239094566159073, -0.03573585346598876, -0.02342909405227375, 0.24179862289298557, 0.019643938243619086, 0.15255094235073086, 0.3186507510402673, 0.05652398346643512, -0.009094175630164765, 0.1583068838799104, -0.20595064677931407, 0.057854905932444176, -0.22224396601924865, -0.012955435609192024, -0.1426022282289916, 0.16554986619545767, -0.1213026436755037, -0.09204946346307909, 0.3255405167372583, 0.059049693700845965, 0.20080695510566438, 0.0647964827426989, 0.3033867971703349, 0.09681106289180855, 0.11059732688782514, 0.16795770008185948, 0.33409218697719095, 0.16351710521681195, 0.07870702958117726, -0.21076089184857721, 0.06463488445563602, -0.0297168282238161] |
1,802.08582 | Magnetic field generation in plasma waves driven by co-propagating
intense twisted lasers | We present a new magnetic field generation mechanism in underdense plasmas
driven by the beating of two, co-propagating, Laguerre-Gaussian (LG) orbital
angular momentum (OAM) laser pulses with different frequencies and also
different twist indices. The resulting twisted ponderomotive force drives up an
electron plasma wave with a helical rotating structure. To second order, there
is a nonlinear rotating current leading to the onset of an intense, static
axial magnetic field, which persists over a long time in the plasma (ps scale)
after the laser pulses have passed by. The results are confirmed in
three-dimensional particle-in-cell simulations and also theoretical analysis.
For the case of 300 fs duration, 3.8x10^17 W/cm^2 peak laser intensity we
observe magnetic field of up to 0.4 MG. This new method of magnetic field
creation may find applications in charged beam collimation and controlled
fusion.
| physics.plasm-ph | we present a new magnetic field generation mechanism in underdense plasmas driven by the beating of two copropagating laguerregaussian lg orbital angular momentum oam laser pulses with different frequencies and also different twist indices the resulting twisted ponderomotive force drives up an electron plasma wave with a helical rotating structure to second order there is a nonlinear rotating current leading to the onset of an intense static axial magnetic field which persists over a long time in the plasma ps scale after the laser pulses have passed by the results are confirmed in threedimensional particleincell simulations and also theoretical analysis for the case of 300 fs duration 38x1017 wcm2 peak laser intensity we observe magnetic field of up to 04 mg this new method of magnetic field creation may find applications in charged beam collimation and controlled fusion | [['we', 'present', 'a', 'new', 'magnetic', 'field', 'generation', 'mechanism', 'in', 'underdense', 'plasmas', 'driven', 'by', 'the', 'beating', 'of', 'two', 'copropagating', 'laguerregaussian', 'lg', 'orbital', 'angular', 'momentum', 'oam', 'laser', 'pulses', 'with', 'different', 'frequencies', 'and', 'also', 'different', 'twist', 'indices', 'the', 'resulting', 'twisted', 'ponderomotive', 'force', 'drives', 'up', 'an', 'electron', 'plasma', 'wave', 'with', 'a', 'helical', 'rotating', 'structure', 'to', 'second', 'order', 'there', 'is', 'a', 'nonlinear', 'rotating', 'current', 'leading', 'to', 'the', 'onset', 'of', 'an', 'intense', 'static', 'axial', 'magnetic', 'field', 'which', 'persists', 'over', 'a', 'long', 'time', 'in', 'the', 'plasma', 'ps', 'scale', 'after', 'the', 'laser', 'pulses', 'have', 'passed', 'by', 'the', 'results', 'are', 'confirmed', 'in', 'threedimensional', 'particleincell', 'simulations', 'and', 'also', 'theoretical', 'analysis', 'for', 'the', 'case', 'of', '300', 'fs', 'duration', '38x1017', 'wcm2', 'peak', 'laser', 'intensity', 'we', 'observe', 'magnetic', 'field', 'of', 'up', 'to', '04', 'mg', 'this', 'new', 'method', 'of', 'magnetic', 'field', 'creation', 'may', 'find', 'applications', 'in', 'charged', 'beam', 'collimation', 'and', 'controlled', 'fusion']] | [-0.1758271427638149, 0.27705722353671824, -0.03699798546527533, 0.032610983196917895, -0.018223396454849383, -0.09565028082069527, -0.040812556992155795, 0.47866410678456517, -0.23678233097205414, -0.3242559676894741, -0.034453330950702736, -0.20339576294985565, -0.0274352996616903, 0.24584592307066327, 0.048282654852845136, 0.02575800202134317, 0.014947475770311634, -0.032137093531905955, -0.0464807120355757, -0.14552995982158412, 0.27572350884808133, 0.09858395531433668, 0.29492798024095107, 0.027158560659600435, 0.09577002627503155, -0.029284013900905848, 0.03320497555665019, -0.02020423628226684, -0.12082207989840714, 0.01730407470918811, 0.16788704872104157, -0.017410480373124353, 0.27194889668667566, -0.48228912301579097, -0.22234315131315077, -0.00329009165824221, 0.1523326063515061, 0.14245095262626853, -0.11868091444693077, -0.26368735442923746, 0.03502811023788731, -0.16214956091648905, -0.1698720710909497, -0.05917159551380705, 0.045927461987891556, 0.07303139421898518, -0.3210159739148871, 0.0552354308217424, 0.04196826869581085, 0.08646210567196355, -0.06181780688539419, -0.012065681788635298, -0.024877664198024865, 0.009790821606803168, 0.10040874048951931, 0.13444019203842447, 0.18574548794430795, -0.1424239525311443, -0.1286027968256143, 0.3513523215346419, -0.08308267169615023, -0.0800112383983975, 0.13353740577552006, -0.24783329941658644, -0.027790450242885054, 0.23545867377164753, 0.1552132330494967, 0.13849658017296576, -0.07381533606769856, -0.02171098160936436, -0.012974870034190147, 0.18901842706122973, 0.17627840749171636, 0.034025455699268264, 0.26966653540594515, 0.16421933586022605, 0.023449707315745253, 0.12725909697197813, -0.1709241302255677, -0.04185159034673532, -0.2607105040079812, -0.09200436086223944, -0.11238360228220912, 0.06850822282779578, -0.06377135466643606, -0.12703289532435746, 0.4526369951556634, 0.16365562930251099, 0.10349577558600773, -0.0784725825137452, 0.3218904195530136, 0.13084125900845023, 0.042124577063874236, 0.0750831039367502, 0.28857333559787623, 0.20065228401404553, 0.16151921362973015, -0.2645738285808589, -0.0844659610790792, 0.0013956551637201414] |
1,802.08583 | Feedback Control of Scalar Conservation Laws with Application to Density
Control in Freeways by Means of Variable Speed Limits | The paper provides results for the stabilization of a spatially uniform
equilibrium profile for a scalar conservation law that arises in the study of
traffic dynamics under variable speed limit control. Two different control
problems are studied: the problem with free speed limits at the inlet and the
problem with no speed limits at the inlet. Explicit formulas are provided for
respective feedback laws that guarantee stabilization of the desired
equilibrium profile. For the first problem, global asymptotic stabilization is
achieved; while for the second problem, regional exponential stabilization is
achieved. Moreover, the solutions for the corresponding closed-loop systems are
guaranteed to be classical solutions, i.e., there are no shocks. The obtained
results are illustrated by means of a numerical example.
| math.OC cs.SY math.AP | the paper provides results for the stabilization of a spatially uniform equilibrium profile for a scalar conservation law that arises in the study of traffic dynamics under variable speed limit control two different control problems are studied the problem with free speed limits at the inlet and the problem with no speed limits at the inlet explicit formulas are provided for respective feedback laws that guarantee stabilization of the desired equilibrium profile for the first problem global asymptotic stabilization is achieved while for the second problem regional exponential stabilization is achieved moreover the solutions for the corresponding closedloop systems are guaranteed to be classical solutions ie there are no shocks the obtained results are illustrated by means of a numerical example | [['the', 'paper', 'provides', 'results', 'for', 'the', 'stabilization', 'of', 'a', 'spatially', 'uniform', 'equilibrium', 'profile', 'for', 'a', 'scalar', 'conservation', 'law', 'that', 'arises', 'in', 'the', 'study', 'of', 'traffic', 'dynamics', 'under', 'variable', 'speed', 'limit', 'control', 'two', 'different', 'control', 'problems', 'are', 'studied', 'the', 'problem', 'with', 'free', 'speed', 'limits', 'at', 'the', 'inlet', 'and', 'the', 'problem', 'with', 'no', 'speed', 'limits', 'at', 'the', 'inlet', 'explicit', 'formulas', 'are', 'provided', 'for', 'respective', 'feedback', 'laws', 'that', 'guarantee', 'stabilization', 'of', 'the', 'desired', 'equilibrium', 'profile', 'for', 'the', 'first', 'problem', 'global', 'asymptotic', 'stabilization', 'is', 'achieved', 'while', 'for', 'the', 'second', 'problem', 'regional', 'exponential', 'stabilization', 'is', 'achieved', 'moreover', 'the', 'solutions', 'for', 'the', 'corresponding', 'closedloop', 'systems', 'are', 'guaranteed', 'to', 'be', 'classical', 'solutions', 'ie', 'there', 'are', 'no', 'shocks', 'the', 'obtained', 'results', 'are', 'illustrated', 'by', 'means', 'of', 'a', 'numerical', 'example']] | [-0.16713287503471067, 0.08155702162545544, -0.0682117378239112, 0.05530697176779412, -0.030852417665541417, -0.15678088308104182, 0.037385835513387894, 0.33761032973223726, -0.2802350727979802, -0.2854021763956282, 0.1951015342858212, -0.23663330887452014, -0.07969319395536234, 0.2551457797877552, -0.05110643704627229, 0.1178885535731496, 0.05236536937896624, 0.026138084030456164, -0.050796424762215006, -0.20863101409732804, 0.3128206395074602, 0.01569352322642899, 0.29606295213842193, 0.042646884049908525, 0.16156682261258118, -0.06881470766463528, 0.0042346038524646405, 0.04655826044959701, -0.1447738882262223, 0.09187967870538392, 0.2163610279767905, 0.10144179338620098, 0.2874385605158269, -0.4288485628949124, -0.23273471317230915, 0.10937861642946513, 0.13161920265136826, 0.10919216284643828, -0.08949622665031635, -0.23619338307021695, 0.14805474844645738, -0.11245376197621226, -0.19251005823747064, -0.0441763108126696, -0.012675348684684304, 0.06312280120674729, -0.32703760414084126, 0.09625463849626296, 0.05057328389880578, 0.07602970750448255, -0.12557811828037677, -0.06973686869725708, -0.02718026001652903, 0.1542816615725044, 0.07770054926326082, -0.041574047025955047, 0.11296190151921666, -0.1621407723623859, -0.10627655206298194, 0.38342474048480024, -0.04792302750312716, -0.25002330686312074, 0.16072666910400013, -0.08180251243824432, -0.08758956820065202, 0.15417156947299468, 0.12228286389092152, 0.10740387506047235, -0.14568511238860443, 0.07843601071681781, -0.024351629667168806, 0.15801976760464512, 0.09253452402300948, 0.004266345171134703, 0.14430857635264802, 0.14835391099726367, 0.17193425763090533, 0.15293335521204998, -0.002152401715813374, -0.17801172552584124, -0.3324684408947456, -0.0932324376065007, -0.12031739338278032, -0.00975688686401945, -0.12154446626820482, -0.11394986037688315, 0.36077528842532436, 0.08751815028848466, 0.14277264328042338, 0.11716965516097844, 0.30267597648723066, 0.21481794194310658, -0.051841922916379596, 0.09621122587116941, 0.29300042156376377, 0.11750295987806844, 0.13428311573133672, -0.24806373914889415, 0.08454053041963908, 0.08181089439914246] |
1,802.08584 | Few- and many-nucleon systems with semilocal coordinate-space
regularized chiral nucleon-nucleon forces | We employ a variety of ab initio methods including Faddeev-Yakubovsky
equations, No-Core Configuration Interaction Approach, Coupled-Cluster Theory
and In-Medium Similarity Renormalization Group to perform a comprehensive
analysis of the nucleon-deuteron elastic and breakup reactions and selected
properties of light and medium-mass nuclei up to 48Ca using the recently
constructed semilocal coordinate-space regularized chiral nucleon-nucleon
potentials. We compare the results with those based on selected
phenomenological and chiral EFT two-nucleon potentials, discuss the convergence
pattern of the chiral expansion and estimate the achievable theoretical
accuracy at various chiral orders using the novel approach to quantify
truncation errors of the chiral expansion without relying on cutoff variation.
We also address the robustness of this method and explore alternative ways to
estimate the theoretical uncertainty from the truncation of the chiral
expansion.
| nucl-th | we employ a variety of ab initio methods including faddeevyakubovsky equations nocore configuration interaction approach coupledcluster theory and inmedium similarity renormalization group to perform a comprehensive analysis of the nucleondeuteron elastic and breakup reactions and selected properties of light and mediummass nuclei up to 48ca using the recently constructed semilocal coordinatespace regularized chiral nucleonnucleon potentials we compare the results with those based on selected phenomenological and chiral eft twonucleon potentials discuss the convergence pattern of the chiral expansion and estimate the achievable theoretical accuracy at various chiral orders using the novel approach to quantify truncation errors of the chiral expansion without relying on cutoff variation we also address the robustness of this method and explore alternative ways to estimate the theoretical uncertainty from the truncation of the chiral expansion | [['we', 'employ', 'a', 'variety', 'of', 'ab', 'initio', 'methods', 'including', 'faddeevyakubovsky', 'equations', 'nocore', 'configuration', 'interaction', 'approach', 'coupledcluster', 'theory', 'and', 'inmedium', 'similarity', 'renormalization', 'group', 'to', 'perform', 'a', 'comprehensive', 'analysis', 'of', 'the', 'nucleondeuteron', 'elastic', 'and', 'breakup', 'reactions', 'and', 'selected', 'properties', 'of', 'light', 'and', 'mediummass', 'nuclei', 'up', 'to', '48ca', 'using', 'the', 'recently', 'constructed', 'semilocal', 'coordinatespace', 'regularized', 'chiral', 'nucleonnucleon', 'potentials', 'we', 'compare', 'the', 'results', 'with', 'those', 'based', 'on', 'selected', 'phenomenological', 'and', 'chiral', 'eft', 'twonucleon', 'potentials', 'discuss', 'the', 'convergence', 'pattern', 'of', 'the', 'chiral', 'expansion', 'and', 'estimate', 'the', 'achievable', 'theoretical', 'accuracy', 'at', 'various', 'chiral', 'orders', 'using', 'the', 'novel', 'approach', 'to', 'quantify', 'truncation', 'errors', 'of', 'the', 'chiral', 'expansion', 'without', 'relying', 'on', 'cutoff', 'variation', 'we', 'also', 'address', 'the', 'robustness', 'of', 'this', 'method', 'and', 'explore', 'alternative', 'ways', 'to', 'estimate', 'the', 'theoretical', 'uncertainty', 'from', 'the', 'truncation', 'of', 'the', 'chiral', 'expansion']] | [-0.05176970985349874, 0.06217818376391606, -0.15858664413076617, 0.09133841924986608, -0.0507363531911789, -0.04806689959192692, 0.06243368258876654, 0.3833739858539414, -0.19646491707743022, -0.27302454718092617, -0.02380107381099532, -0.3147609465170738, -0.12155874042551561, 0.08843741287267948, 0.06137286309268354, 0.12469635383305393, 0.03391524605171452, 0.020660594235672507, -0.1681764553113328, -0.1939558968157327, 0.3161000009579223, 0.05077103690006012, 0.24848193732404344, 0.11014025358035583, 0.04460184978927637, 0.03580258394656486, -0.04777226924116528, -0.028120722708313964, -0.17306444290736617, 0.17977679795549475, 0.21930866662183662, 0.02696981707898279, 0.2007021100022072, -0.46596690560438375, -0.2286302746569579, 0.01371504371451546, 0.1472002959849905, 0.18424986073270785, -0.051810693838669694, -0.32528375034299933, 0.06893639646780987, -0.2755050759892477, -0.18848618549518575, -0.2178093093743389, -0.02489811396081896, 0.045642227656388465, -0.28491581133891675, 0.08204149302657397, -0.0529226194958874, 0.07653309566929012, -0.0841358902930939, -0.18641818227434112, 0.038015464570755934, 0.04717024273145222, 0.0811459154825542, 0.039638972366517485, 0.16236886596884723, -0.12369280898864128, -0.1264725424269893, 0.4226335588871509, -0.03696450030488908, -0.1515184318025907, 0.14588496634960463, -0.06355995500763488, -0.14347849364298604, 0.11112416279863191, 0.17998836310075003, 0.14636477679663965, -0.17202643283404584, 0.10970198512465383, 0.023570245977440604, 0.14504053194054164, 0.0752860574600424, 0.020883162914731995, 0.10599268890570762, 0.1876125739916235, -0.013552725816853056, 0.05189614642101029, -0.11915233566303009, -0.13957679695846845, -0.33046153698174296, 0.0009095848559640175, -0.14666414462289837, 0.006663820994187638, -0.11842232741798588, -0.15841743749270373, 0.3976665270810788, 0.17830517485939948, 0.16087685622565462, 0.02399317138330188, 0.3160104936407518, 0.08548565130579726, 0.06176533073533413, 0.0037449615928091744, 0.2904640090933373, 0.21572845426655207, -0.015520234252939852, -0.3378786573952692, -0.04221414200340708, 0.14848787653577594] |
1,802.08585 | The statistical properties of solar wind temperature parameters near 1
AU | We present a long-duration ($\sim$10 years) statistical analysis of the
temperatures, plasma betas, and temperature ratios for the electron, proton,
and alpha-particle populations observed by the \emph{Wind} spacecraft near 1
AU. The mean(median) scalar temperatures are $T{\scriptstyle_{e, tot}}$ $=$
12.2(11.9) eV, $T{\scriptstyle_{p, tot}}$ $=$ 12.7(8.6) eV, and
$T{\scriptstyle_{\alpha, tot}}$ $=$ 23.9(10.8) eV. The mean(median) total
plasma betas are $\beta{\scriptstyle_{e, tot}}$ $=$ 2.31(1.09),
$\beta{\scriptstyle_{p, tot}}$ $=$ 1.79(1.05), and $\beta{\scriptstyle_{\alpha,
tot}}$ $=$ 0.17(0.05). The mean(median) temperature ratios are
$\left(T{\scriptstyle_{e}}/T{\scriptstyle_{p}}\right){\scriptstyle_{tot}}$ $=$
1.64(1.27),
$\left(T{\scriptstyle_{e}}/T{\scriptstyle_{\alpha}}\right){\scriptstyle_{tot}}$
$=$ 1.24(0.82), and
$\left(T{\scriptstyle_{\alpha}}/T{\scriptstyle_{p}}\right){\scriptstyle_{tot}}$
$=$ 2.50(1.94). We also examined these parameters during time intervals that
exclude interplanetary (IP) shocks, times within the magnetic obstacles (MOs)
of interplanetary coronal mass ejections (ICMEs), and times that exclude MOs.
The only times that show significant alterations to any of the parameters
examined are those during MOs. In fact, the only parameter that does not show a
significant change during MOs is the electron temperature. Although each
parameter shows a broad range of values, the vast majority are near the median.
We also compute particle-particle collision rates and compare to effective
wave-particle collision rates. We find that, for reasonable assumptions of wave
amplitude and occurrence rates, the effect of wave-particle interactions on the
plasma is equal to or greater than the effect of Coulomb collisions. Thus,
wave-particle interactions should not be neglected when modeling the solar
wind.
| physics.plasm-ph astro-ph.SR physics.space-ph | we present a longduration sim10 years statistical analysis of the temperatures plasma betas and temperature ratios for the electron proton and alphaparticle populations observed by the emphwind spacecraft near 1 au the meanmedian scalar temperatures are tscriptstyle_e tot 122119 ev tscriptstyle_p tot 12786 ev and tscriptstyle_alpha tot 239108 ev the meanmedian total plasma betas are betascriptstyle_e tot 231109 betascriptstyle_p tot 179105 and betascriptstyle_alpha tot 017005 the meanmedian temperature ratios are lefttscriptstyle_etscriptstyle_prightscriptstyle_tot 164127 lefttscriptstyle_etscriptstyle_alpharightscriptstyle_tot 124082 and lefttscriptstyle_alphatscriptstyle_prightscriptstyle_tot 250194 we also examined these parameters during time intervals that exclude interplanetary ip shocks times within the magnetic obstacles mos of interplanetary coronal mass ejections icmes and times that exclude mos the only times that show significant alterations to any of the parameters examined are those during mos in fact the only parameter that does not show a significant change during mos is the electron temperature although each parameter shows a broad range of values the vast majority are near the median we also compute particleparticle collision rates and compare to effective waveparticle collision rates we find that for reasonable assumptions of wave amplitude and occurrence rates the effect of waveparticle interactions on the plasma is equal to or greater than the effect of coulomb collisions thus waveparticle interactions should not be neglected when modeling the solar wind | [['we', 'present', 'a', 'longduration', 'sim10', 'years', 'statistical', 'analysis', 'of', 'the', 'temperatures', 'plasma', 'betas', 'and', 'temperature', 'ratios', 'for', 'the', 'electron', 'proton', 'and', 'alphaparticle', 'populations', 'observed', 'by', 'the', 'emphwind', 'spacecraft', 'near', '1', 'au', 'the', 'meanmedian', 'scalar', 'temperatures', 'are', 'tscriptstyle_e', 'tot', '122119', 'ev', 'tscriptstyle_p', 'tot', '12786', 'ev', 'and', 'tscriptstyle_alpha', 'tot', '239108', 'ev', 'the', 'meanmedian', 'total', 'plasma', 'betas', 'are', 'betascriptstyle_e', 'tot', '231109', 'betascriptstyle_p', 'tot', '179105', 'and', 'betascriptstyle_alpha', 'tot', '017005', 'the', 'meanmedian', 'temperature', 'ratios', 'are', 'lefttscriptstyle_etscriptstyle_prightscriptstyle_tot', '164127', 'lefttscriptstyle_etscriptstyle_alpharightscriptstyle_tot', '124082', 'and', 'lefttscriptstyle_alphatscriptstyle_prightscriptstyle_tot', '250194', 'we', 'also', 'examined', 'these', 'parameters', 'during', 'time', 'intervals', 'that', 'exclude', 'interplanetary', 'ip', 'shocks', 'times', 'within', 'the', 'magnetic', 'obstacles', 'mos', 'of', 'interplanetary', 'coronal', 'mass', 'ejections', 'icmes', 'and', 'times', 'that', 'exclude', 'mos', 'the', 'only', 'times', 'that', 'show', 'significant', 'alterations', 'to', 'any', 'of', 'the', 'parameters', 'examined', 'are', 'those', 'during', 'mos', 'in', 'fact', 'the', 'only', 'parameter', 'that', 'does', 'not', 'show', 'a', 'significant', 'change', 'during', 'mos', 'is', 'the', 'electron', 'temperature', 'although', 'each', 'parameter', 'shows', 'a', 'broad', 'range', 'of', 'values', 'the', 'vast', 'majority', 'are', 'near', 'the', 'median', 'we', 'also', 'compute', 'particleparticle', 'collision', 'rates', 'and', 'compare', 'to', 'effective', 'waveparticle', 'collision', 'rates', 'we', 'find', 'that', 'for', 'reasonable', 'assumptions', 'of', 'wave', 'amplitude', 'and', 'occurrence', 'rates', 'the', 'effect', 'of', 'waveparticle', 'interactions', 'on', 'the', 'plasma', 'is', 'equal', 'to', 'or', 'greater', 'than', 'the', 'effect', 'of', 'coulomb', 'collisions', 'thus', 'waveparticle', 'interactions', 'should', 'not', 'be', 'neglected', 'when', 'modeling', 'the', 'solar', 'wind']] | [-0.1280075426496166, 0.23112264066953592, -0.013913220184859914, 0.13751973245145602, -0.007135977025371881, -0.09935938402842873, 0.0411778711868279, 0.40093721690283596, -0.17033793708803702, -0.35752654272340695, 0.020375592509945094, -0.2751893925537564, -0.03534398229474354, 0.20604297760707727, 0.004606228638963051, -0.020603551698551034, 0.08925832775468957, -0.0170061606135723, -0.07994279964252052, -0.18877865893918336, 0.24006778671767334, 0.1276061434859448, 0.21055895407037922, 0.11436884112511192, 0.07885805218556553, -0.029711758773726393, 0.03408087203659269, 0.01070992260392071, -0.15652968006056933, 0.013706521991294646, 0.20567834417202643, 0.06250054175533089, 0.23165816233056236, -0.4309852631496532, -0.21582373381801406, 0.08629934848713859, 0.14316320665446775, 0.008140729974280586, 0.00018417696428143097, -0.23020052872075492, 0.08792568835886005, -0.1913929443737511, -0.1040372763289975, 0.02176069710534351, 0.08006629182206353, 0.07176346456803077, -0.2935734049711681, 0.14739944954650425, -0.03072899531535044, 0.0532292203011932, -0.09807051284409755, -0.15360994092473873, -0.05250826889734563, 0.0582441613940838, 0.11644127025097913, 0.022325061126231994, 0.2357112712070004, -0.09001667619438139, -0.04392715914493275, 0.3572041738721333, -0.024551063271525092, -0.06946263534292503, 0.20108753131056317, -0.2268843476788844, -0.09324329248296895, 0.17831187502823162, 0.1462438990408317, 0.07090303323906372, -0.1330466320711023, 0.02433564722518988, -0.005159338370689585, 0.21584901328635764, 0.0960086138232383, 0.022830448848699048, 0.22615697655152073, 0.1100487552431165, 0.020104958744700616, 0.007022502313888328, -0.186465946823235, -0.050181512962622875, -0.2771831702688063, -0.1265224300952134, -0.09017410741439469, 0.04786545078827565, -0.12524948380005485, -0.09976691897181623, 0.34458052620427726, 0.20590764852430748, 0.20491940256241442, 0.004635342476385817, 0.302203445999446, 0.15594006457594128, 0.06085643054245097, 0.09743420384011744, 0.3203641512972892, 0.09474287368951137, 0.12786830254896944, -0.23248817878585232, 0.09827869579229238, 0.0029271365552000247] |
1,802.08586 | Database Aggregation | Knowledge can be represented compactly in a multitude ways, from a set of
propositional formulas, to a Kripke model, to a database. In this paper we
study the aggregation of information coming from multiple sources, each source
submitting a database modelled as a first-order relational structure. In the
presence of an integrity constraint, we identify classes of aggregators that
respect it in the aggregated database, provided all individual databases
satisfy it. We also characterise languages for first-order queries on which the
answer to queries on the aggregated database coincides with the aggregation of
the answers to the query obtained on each individual database. This
contribution is meant to be a first step on the application of techniques from
rational choice theory to knowledge representation in databases.
| cs.DB | knowledge can be represented compactly in a multitude ways from a set of propositional formulas to a kripke model to a database in this paper we study the aggregation of information coming from multiple sources each source submitting a database modelled as a firstorder relational structure in the presence of an integrity constraint we identify classes of aggregators that respect it in the aggregated database provided all individual databases satisfy it we also characterise languages for firstorder queries on which the answer to queries on the aggregated database coincides with the aggregation of the answers to the query obtained on each individual database this contribution is meant to be a first step on the application of techniques from rational choice theory to knowledge representation in databases | [['knowledge', 'can', 'be', 'represented', 'compactly', 'in', 'a', 'multitude', 'ways', 'from', 'a', 'set', 'of', 'propositional', 'formulas', 'to', 'a', 'kripke', 'model', 'to', 'a', 'database', 'in', 'this', 'paper', 'we', 'study', 'the', 'aggregation', 'of', 'information', 'coming', 'from', 'multiple', 'sources', 'each', 'source', 'submitting', 'a', 'database', 'modelled', 'as', 'a', 'firstorder', 'relational', 'structure', 'in', 'the', 'presence', 'of', 'an', 'integrity', 'constraint', 'we', 'identify', 'classes', 'of', 'aggregators', 'that', 'respect', 'it', 'in', 'the', 'aggregated', 'database', 'provided', 'all', 'individual', 'databases', 'satisfy', 'it', 'we', 'also', 'characterise', 'languages', 'for', 'firstorder', 'queries', 'on', 'which', 'the', 'answer', 'to', 'queries', 'on', 'the', 'aggregated', 'database', 'coincides', 'with', 'the', 'aggregation', 'of', 'the', 'answers', 'to', 'the', 'query', 'obtained', 'on', 'each', 'individual', 'database', 'this', 'contribution', 'is', 'meant', 'to', 'be', 'a', 'first', 'step', 'on', 'the', 'application', 'of', 'techniques', 'from', 'rational', 'choice', 'theory', 'to', 'knowledge', 'representation', 'in', 'databases']] | [-0.08500721269021076, -0.027342384181143382, -0.06617895813288337, 0.0731184807825937, -0.11422799781910957, -0.08993903782943057, 0.11737480064454887, 0.37106771263042615, -0.35394649847691495, -0.32035838584794424, 0.0751132790049139, -0.3244098437181304, -0.0863170465417502, 0.17887148414627604, -0.09708214746656484, 0.015516795144076384, 0.049659116230609396, 0.11612588612802534, -0.014789224156947245, -0.2640929632350832, 0.3349643681930112, 0.006769680669383397, 0.24670288677785604, -0.0044608439969283245, 0.06507075913915676, 0.0005588846258996498, -0.07250375412995853, 0.05563447890537126, -0.10673194019603663, 0.17935966267037975, 0.3333125044148238, 0.22930303117674258, 0.2778301881349069, -0.39040094442547313, -0.14179813185529339, 0.07906320383254853, 0.08879164692812733, 0.12377017087373321, -0.0007363811194423646, -0.3253091647481871, 0.09000380323194558, -0.18691225058680017, -0.03341566839639748, -0.09228390305199557, 0.011584264071037373, 0.01981209102271509, -0.2829108750470729, -0.042483867295982594, 0.07688226475794283, 0.0741176593102633, -0.11851145296786277, -0.04516336897693922, 0.0034683889225273143, 0.16203969201472188, 0.00492694320846856, 0.03888017540642371, 0.11486416973824067, -0.10532718311463084, -0.16336841864875398, 0.4072107322336662, -0.05837879693763892, -0.208168023081112, 0.1536598563756025, -0.07972327930601461, -0.2165013350951042, 0.11612144006150109, 0.19299891171976924, 0.11136698636728974, -0.19440460453661795, 0.07619356285662406, -0.09964715650938968, 0.24590755283411236, 0.10329780056712307, 0.02736712600074945, 0.21101514262790305, 0.16222716273651236, 0.02955142552742646, 0.17422385234200943, -0.01352163772690036, -0.10302618761280817, -0.3048709325962663, -0.12427201777667043, -0.1837007679989458, 0.011547584404488878, -0.09178768729584084, -0.20514935905082402, 0.36639000568538904, 0.19797818309864, 0.18033076049242583, 0.07884177757844714, 0.2976935330837492, 0.05222524258842607, 0.09713137430685853, 0.05429960395179925, 0.09413820359253487, 0.03853195220313316, 0.11125075420926488, -0.12068736263909303, 0.13088875301440972, 0.05461702693165058] |
1,802.08587 | An ionic impurity in a Bose-Einstein condensate at sub-microkelvin
temperatures | Rydberg atoms immersed in a Bose-Einstein condensate interact with the
quantum gas via electron-atom and ion-atom interaction. To suppress the
typically dominant electron-neutral interaction, Rydberg states with principal
quantum number up to $n = 190$ are excited from a dense and tightly trapped
micron-sized condensate. This allows us to explore a regime where the Rydberg
orbit exceeds the size of the atomic sample by far. In this case, a detailed
lineshape analysis of the Rydberg excitation spectrum provides clear evidence
for ion-atom interaction at temperatures well below a microkelvin. Our results
may open up ways to enter the quantum regime of ion-atom scattering for the
exploration of charged quantum impurities and associated polaron physics.
| physics.atom-ph cond-mat.quant-gas | rydberg atoms immersed in a boseeinstein condensate interact with the quantum gas via electronatom and ionatom interaction to suppress the typically dominant electronneutral interaction rydberg states with principal quantum number up to n 190 are excited from a dense and tightly trapped micronsized condensate this allows us to explore a regime where the rydberg orbit exceeds the size of the atomic sample by far in this case a detailed lineshape analysis of the rydberg excitation spectrum provides clear evidence for ionatom interaction at temperatures well below a microkelvin our results may open up ways to enter the quantum regime of ionatom scattering for the exploration of charged quantum impurities and associated polaron physics | [['rydberg', 'atoms', 'immersed', 'in', 'a', 'boseeinstein', 'condensate', 'interact', 'with', 'the', 'quantum', 'gas', 'via', 'electronatom', 'and', 'ionatom', 'interaction', 'to', 'suppress', 'the', 'typically', 'dominant', 'electronneutral', 'interaction', 'rydberg', 'states', 'with', 'principal', 'quantum', 'number', 'up', 'to', 'n', '190', 'are', 'excited', 'from', 'a', 'dense', 'and', 'tightly', 'trapped', 'micronsized', 'condensate', 'this', 'allows', 'us', 'to', 'explore', 'a', 'regime', 'where', 'the', 'rydberg', 'orbit', 'exceeds', 'the', 'size', 'of', 'the', 'atomic', 'sample', 'by', 'far', 'in', 'this', 'case', 'a', 'detailed', 'lineshape', 'analysis', 'of', 'the', 'rydberg', 'excitation', 'spectrum', 'provides', 'clear', 'evidence', 'for', 'ionatom', 'interaction', 'at', 'temperatures', 'well', 'below', 'a', 'microkelvin', 'our', 'results', 'may', 'open', 'up', 'ways', 'to', 'enter', 'the', 'quantum', 'regime', 'of', 'ionatom', 'scattering', 'for', 'the', 'exploration', 'of', 'charged', 'quantum', 'impurities', 'and', 'associated', 'polaron', 'physics']] | [-0.10551690943879116, 0.28470350586421855, -0.035152017794120895, 0.03569345126563139, 0.03907658021682791, -0.17196787027147623, 0.07791625882243425, 0.34320611730877276, -0.22210742141902076, -0.28181346578408134, -0.06689339301515931, -0.333409469659297, -0.004020430726633794, 0.17260519816927547, 0.10278071120970643, 0.03939007602186989, 0.07606535194394286, -0.00676922415088516, 0.005971217455869887, -0.18727683391323133, 0.2906598583815735, 0.07009127383342886, 0.2160157283718607, 0.1322017517188086, 0.05039054673758492, 0.003381959760118074, 0.09177863450753873, -0.06878714443522349, -0.15832432821821585, 0.11478668384293127, 0.27879241886249934, -0.04370099819570252, 0.2385657701014945, -0.4535473225948239, -0.18398354361987615, 0.05177454534192792, 0.23370136543531464, 0.2344717540802945, -0.06346418684713163, -0.3358263573897755, -0.07288892839961084, -0.18301323851554002, -0.17365991233114517, -0.10635484525093199, 0.0372003736056849, 0.0036738896536418295, -0.29028977094366487, 0.08051555214317895, 0.06375140031342255, 0.048955862550477014, -0.05491100144067746, -0.05509301964852926, 0.06022505828311288, 0.04704638183182847, -0.05652367504956448, 0.021431251274487747, 0.2300155280339243, -0.12995645669659814, -0.05104501720155235, 0.3892346086986033, -0.10594527335194624, -0.07050930663316915, 0.27493564625048134, -0.17680320941917269, -0.059497949643579795, 0.19812658582443157, 0.17928492767423126, 0.09066338978055659, -0.11465855170684182, 0.09378483434737273, -0.029074103497298418, 0.20074427186766952, 0.09664969194054077, 0.11835746190292283, 0.27446657326072454, 0.15999720575271453, 0.028076451584960506, 0.16132777150662667, -0.10387112769613505, -0.15338689555306878, -0.25217191235005726, -0.13072494233224904, -0.1940591297837683, 0.08609280034392841, -0.0200307672072987, -0.12896438537214974, 0.3405795537874894, 0.1117993721550957, 0.21284937636877319, -0.06448356522065876, 0.29298798908042695, 0.0998098157908751, 0.045315269281906365, 0.04092033659478864, 0.26609215331552305, 0.21135052592510079, 0.056559099576773894, -0.3229877844811376, -0.013175320036841177, -0.010520501575325575] |
1,802.08588 | Implicit definability of truth constants in {\L}ukasiewicz logic | In the framework of propositional {\L}ukasiewicz logic, a suitable notion of
implicit definability, tailored to the intended real-valued semantics and
referring to the elements of its domain, is introduced. Several variants of
implicitly defining each of the rational elements in the standard semantics are
explored, and based on that, a faithful interpretation of theories in Rational
Pavelka logic in theories in {\L}ukasiewicz logic is obtained. Some of these
results were already presented in H\'ajek's "Metamathematics of Fuzzy Logic" as
technical statements. A connection to the lack of (deductive) Beth property in
{\L}ukasiewicz logic is drawn. Moreover, while irrational elements of the
standard semantics are not implicitly definable by finitary means, a parallel
development is possible for them in the infinitary {\L}ukasiewicz logic. As an
application of definability of the rationals, it is shown how computational
complexity results for Rational Pavelka logic can be obtained from analogous
results for {\L}ukasiewicz logic. The complexity of the definability notion
itself is studied as well. Finally, we review the import of these results for
the precision/vagueness discussion for fuzzy logic, and for the general
standing of truth constants in {\L}ukasiewicz logic.
| cs.LO math.LO | in the framework of propositional lukasiewicz logic a suitable notion of implicit definability tailored to the intended realvalued semantics and referring to the elements of its domain is introduced several variants of implicitly defining each of the rational elements in the standard semantics are explored and based on that a faithful interpretation of theories in rational pavelka logic in theories in lukasiewicz logic is obtained some of these results were already presented in hajeks metamathematics of fuzzy logic as technical statements a connection to the lack of deductive beth property in lukasiewicz logic is drawn moreover while irrational elements of the standard semantics are not implicitly definable by finitary means a parallel development is possible for them in the infinitary lukasiewicz logic as an application of definability of the rationals it is shown how computational complexity results for rational pavelka logic can be obtained from analogous results for lukasiewicz logic the complexity of the definability notion itself is studied as well finally we review the import of these results for the precisionvagueness discussion for fuzzy logic and for the general standing of truth constants in lukasiewicz logic | [['in', 'the', 'framework', 'of', 'propositional', 'lukasiewicz', 'logic', 'a', 'suitable', 'notion', 'of', 'implicit', 'definability', 'tailored', 'to', 'the', 'intended', 'realvalued', 'semantics', 'and', 'referring', 'to', 'the', 'elements', 'of', 'its', 'domain', 'is', 'introduced', 'several', 'variants', 'of', 'implicitly', 'defining', 'each', 'of', 'the', 'rational', 'elements', 'in', 'the', 'standard', 'semantics', 'are', 'explored', 'and', 'based', 'on', 'that', 'a', 'faithful', 'interpretation', 'of', 'theories', 'in', 'rational', 'pavelka', 'logic', 'in', 'theories', 'in', 'lukasiewicz', 'logic', 'is', 'obtained', 'some', 'of', 'these', 'results', 'were', 'already', 'presented', 'in', 'hajeks', 'metamathematics', 'of', 'fuzzy', 'logic', 'as', 'technical', 'statements', 'a', 'connection', 'to', 'the', 'lack', 'of', 'deductive', 'beth', 'property', 'in', 'lukasiewicz', 'logic', 'is', 'drawn', 'moreover', 'while', 'irrational', 'elements', 'of', 'the', 'standard', 'semantics', 'are', 'not', 'implicitly', 'definable', 'by', 'finitary', 'means', 'a', 'parallel', 'development', 'is', 'possible', 'for', 'them', 'in', 'the', 'infinitary', 'lukasiewicz', 'logic', 'as', 'an', 'application', 'of', 'definability', 'of', 'the', 'rationals', 'it', 'is', 'shown', 'how', 'computational', 'complexity', 'results', 'for', 'rational', 'pavelka', 'logic', 'can', 'be', 'obtained', 'from', 'analogous', 'results', 'for', 'lukasiewicz', 'logic', 'the', 'complexity', 'of', 'the', 'definability', 'notion', 'itself', 'is', 'studied', 'as', 'well', 'finally', 'we', 'review', 'the', 'import', 'of', 'these', 'results', 'for', 'the', 'precisionvagueness', 'discussion', 'for', 'fuzzy', 'logic', 'and', 'for', 'the', 'general', 'standing', 'of', 'truth', 'constants', 'in', 'lukasiewicz', 'logic']] | [-0.1043537186137313, 0.034416206312407764, -0.07048410385025926, 0.14486582662224248, -0.16686915448035605, -0.12260709991127813, 0.05729708293332688, 0.37976693932808214, -0.3271299950247731, -0.24963597326804834, 0.08552921214829429, -0.23687801862596183, -0.1085751897365015, 0.19407589016081664, -0.17501081885414457, 0.0822544664201472, -0.03223749945410878, 0.10980800584068783, -0.05222746268226465, -0.2541905576613561, 0.3015005232375716, -0.03813774115906688, 0.21080916590603088, 0.03861345716511771, 0.09022219983675588, 0.038770681903046625, -0.015058459971921258, 0.08632018015048998, -0.10519983160444216, 0.14979027385099902, 0.36653262221064137, 0.24921977736214043, 0.30957793070363904, -0.4489679489164583, -0.10506482207546791, 0.05871440306861674, 0.05889402989233013, 0.05915450484376721, 0.007623072490797088, -0.32745549218198383, 0.07666518082604393, -0.18629897981681812, -0.06638270764491491, -0.11838158494817914, 0.08677882337554277, 0.049480630983335654, -0.20702526525353954, -0.07401072225152885, 0.2260872377389391, 0.15800910097076207, -0.04615587235230612, -0.10984016912651338, 0.0011272709666480941, 0.05239175427805192, -0.013183011562608543, 0.004214792578701451, 0.07779623516234419, -0.08237597805207535, -0.23617618174795363, 0.35602044240040803, -0.013346854468709939, -0.22024215603627825, 0.12309742196568198, -0.09266058999734621, -0.18852924271636912, 0.06079334035761134, 0.03980497918241928, 0.11957492185656422, -0.11463066812865036, 0.17909747649951818, -0.0836256102468538, 0.19955516358592137, 0.14231773245558943, 0.0849940151505683, 0.16921160634612084, 0.17761942976334644, -0.037543940790666024, 0.15915714378996942, 0.09264734384127497, -0.15555314823355457, -0.33627135570471484, -0.18338450859551148, -0.09910543330304164, -0.02811363602790328, -0.07335883553550761, -0.19997973005479497, 0.36188179753490435, 0.1823114191597548, 0.09528972924016016, 0.18455803571068632, 0.27895630563243784, 0.11374431495336935, 0.07930657274079739, -0.03626841106276799, 0.15370248904860434, 0.19242715543406386, 0.0952239158545791, -0.12450023800490163, 0.12354957634553072, 0.12631316863686368] |
1,802.08589 | Asymptotic safety in the dark | We explore the Renormalization Group flow of massive uncharged fermions -- a
candidate for dark matter -- coupled to a scalar field through a Higgs portal.
We find that fermionic fluctuations can lower the bound on the scalar mass that
arises from vacuum stability. Further, we discuss that despite the perturbative
nonrenormalizability of the model, it could be ultraviolet complete at an
asymptotically safe fixed point. In our approximation, this simple model
exhibits two mechanisms for asymptotic safety: a balance of fermionic and
bosonic fluctuations generates a fixed point in the scalar self-interaction;
asymptotic safety in the portal coupling is triggered through a balance of
canonical scaling and quantum fluctuations. As a consequence of asymptotic
safety in the dark sector, the low-energy value of the portal coupling could
become a function of the dark fermion mass and the scalar mass, thereby
reducing the viable parameter space of the model.
| hep-ph hep-th | we explore the renormalization group flow of massive uncharged fermions a candidate for dark matter coupled to a scalar field through a higgs portal we find that fermionic fluctuations can lower the bound on the scalar mass that arises from vacuum stability further we discuss that despite the perturbative nonrenormalizability of the model it could be ultraviolet complete at an asymptotically safe fixed point in our approximation this simple model exhibits two mechanisms for asymptotic safety a balance of fermionic and bosonic fluctuations generates a fixed point in the scalar selfinteraction asymptotic safety in the portal coupling is triggered through a balance of canonical scaling and quantum fluctuations as a consequence of asymptotic safety in the dark sector the lowenergy value of the portal coupling could become a function of the dark fermion mass and the scalar mass thereby reducing the viable parameter space of the model | [['we', 'explore', 'the', 'renormalization', 'group', 'flow', 'of', 'massive', 'uncharged', 'fermions', 'a', 'candidate', 'for', 'dark', 'matter', 'coupled', 'to', 'a', 'scalar', 'field', 'through', 'a', 'higgs', 'portal', 'we', 'find', 'that', 'fermionic', 'fluctuations', 'can', 'lower', 'the', 'bound', 'on', 'the', 'scalar', 'mass', 'that', 'arises', 'from', 'vacuum', 'stability', 'further', 'we', 'discuss', 'that', 'despite', 'the', 'perturbative', 'nonrenormalizability', 'of', 'the', 'model', 'it', 'could', 'be', 'ultraviolet', 'complete', 'at', 'an', 'asymptotically', 'safe', 'fixed', 'point', 'in', 'our', 'approximation', 'this', 'simple', 'model', 'exhibits', 'two', 'mechanisms', 'for', 'asymptotic', 'safety', 'a', 'balance', 'of', 'fermionic', 'and', 'bosonic', 'fluctuations', 'generates', 'a', 'fixed', 'point', 'in', 'the', 'scalar', 'selfinteraction', 'asymptotic', 'safety', 'in', 'the', 'portal', 'coupling', 'is', 'triggered', 'through', 'a', 'balance', 'of', 'canonical', 'scaling', 'and', 'quantum', 'fluctuations', 'as', 'a', 'consequence', 'of', 'asymptotic', 'safety', 'in', 'the', 'dark', 'sector', 'the', 'lowenergy', 'value', 'of', 'the', 'portal', 'coupling', 'could', 'become', 'a', 'function', 'of', 'the', 'dark', 'fermion', 'mass', 'and', 'the', 'scalar', 'mass', 'thereby', 'reducing', 'the', 'viable', 'parameter', 'space', 'of', 'the', 'model']] | [-0.19355044352384854, 0.21237832068738474, -0.13677999334802635, 0.12104804385580173, -0.07105829843262933, -0.1459529591838316, 0.0657292719103624, 0.26045571564741077, -0.18913601588166387, -0.3077010461414347, 0.04101744097765206, -0.27551929356188193, -0.10598401829986802, 0.13159598922198576, 0.01989902205112688, 0.03862602553222658, -0.020692616466711573, 0.07014941241668195, -0.04775064811348079, -0.2080485541912011, 0.3300187043009364, 0.05086853688655637, 0.2468648112828837, 0.09004870057185212, 0.08788641360683405, 0.0048636098148389945, 0.027854700794532186, -0.03760463955078027, -0.12353978386432127, 0.050954526030738856, 0.1679954169449542, 0.06762578751144259, 0.2407868070461388, -0.3737661099112054, -0.2223136611853023, 0.15280001574721772, 0.18419279463171045, 0.11067161427772775, -0.11062652526223767, -0.27611128958639036, 0.0413811993926762, -0.21356442268006504, -0.18080952923212731, -0.08391449401205799, -0.07173136175296517, -0.08139776659584573, -0.31238992385990716, 0.08961341853038135, -0.025116249814401477, -0.007590201087802851, -0.04698066155467385, -0.05583620419706769, -0.09330170293541333, 0.058647154969777786, 0.12286277620524143, -0.009915747914184519, 0.1716669805785071, -0.25482507648269587, -0.053406457432552054, 0.3857352881514955, -0.16735011973690722, -0.18515872810238682, 0.17053598988497135, -0.09559778511828305, -0.1254765140874704, 0.10230218339711428, 0.1590485691986218, 0.09417949857342305, -0.15529808086552183, 0.19278463036919544, -0.047433199490845, 0.16404318274671947, 0.030881559759771235, 0.04965748965857411, 0.31330632373411843, 0.17567104127790248, 0.0631420921667346, 0.1293397750887627, -0.030601230495907114, -0.15574259520033185, -0.38652176230030805, -0.1787048949128283, -0.13066822811517687, 0.05427896803471444, -0.1597867480691619, -0.167559360933243, 0.3934186189710622, 0.14991087877970874, 0.16362860079278194, 0.031768924198715257, 0.2817536388622077, 0.12797610885875466, 0.0666200012019297, 0.06801995175390117, 0.32405336927559203, 0.12696297571449508, 0.07126242679790878, -0.2707267231292085, -0.055016680392531714, 0.06679191770108074] |
1,802.0859 | Reservoir computing with simple oscillators: Virtual and real networks | The reservoir computing scheme is a machine learning mechanism which utilizes
the naturally occuring computational capabilities of dynamical systems. One
important subset of systems that has proven powerful both in experiments and
theory are delay-systems. In this work, we investigate the reservoir computing
performance of hybrid network-delay systems systematically by evaluating the
NARMA10 and the Sante Fe task.. We construct 'multiplexed networks' that can be
seen as intermediate steps on the scale from classical networks to the 'virtual
networks' of delay systems. We find that the delay approach can be extended to
the network case without loss of computational power, enabling the construction
of faster reservoir computing substrates.
| cs.NE | the reservoir computing scheme is a machine learning mechanism which utilizes the naturally occuring computational capabilities of dynamical systems one important subset of systems that has proven powerful both in experiments and theory are delaysystems in this work we investigate the reservoir computing performance of hybrid networkdelay systems systematically by evaluating the narma10 and the sante fe task we construct multiplexed networks that can be seen as intermediate steps on the scale from classical networks to the virtual networks of delay systems we find that the delay approach can be extended to the network case without loss of computational power enabling the construction of faster reservoir computing substrates | [['the', 'reservoir', 'computing', 'scheme', 'is', 'a', 'machine', 'learning', 'mechanism', 'which', 'utilizes', 'the', 'naturally', 'occuring', 'computational', 'capabilities', 'of', 'dynamical', 'systems', 'one', 'important', 'subset', 'of', 'systems', 'that', 'has', 'proven', 'powerful', 'both', 'in', 'experiments', 'and', 'theory', 'are', 'delaysystems', 'in', 'this', 'work', 'we', 'investigate', 'the', 'reservoir', 'computing', 'performance', 'of', 'hybrid', 'networkdelay', 'systems', 'systematically', 'by', 'evaluating', 'the', 'narma10', 'and', 'the', 'sante', 'fe', 'task', 'we', 'construct', 'multiplexed', 'networks', 'that', 'can', 'be', 'seen', 'as', 'intermediate', 'steps', 'on', 'the', 'scale', 'from', 'classical', 'networks', 'to', 'the', 'virtual', 'networks', 'of', 'delay', 'systems', 'we', 'find', 'that', 'the', 'delay', 'approach', 'can', 'be', 'extended', 'to', 'the', 'network', 'case', 'without', 'loss', 'of', 'computational', 'power', 'enabling', 'the', 'construction', 'of', 'faster', 'reservoir', 'computing', 'substrates']] | [-0.15464104901349066, 0.05714673870506714, -0.08525494276106639, 0.047123474806145205, -0.019337797656057858, -0.16006520074541802, 0.04523897600549115, 0.38705957513346495, -0.2937801014675917, -0.3178233625543005, 0.09078268023572406, -0.21397133499278492, -0.20041682641351385, 0.2517339553121688, -0.05426704882696833, 0.0713632849719428, 0.0873126884184356, -0.011784227459498172, -0.0395301789207876, -0.2449347047587716, 0.31982430296879755, 0.07473552893882371, 0.30353830166090773, 0.029174225167634914, 0.09401368257976225, -0.03860196233496404, 0.004862556611802781, 0.017674203407467465, -0.033371663942231844, 0.17876358527277228, 0.2768513420948161, 0.1564518184717393, 0.30133314320009275, -0.4461637678257418, -0.270179483061272, 0.12435486547227176, 0.16412887976610296, 0.13541657250387734, -0.026914687683357735, -0.2424002544062634, 0.08574798225451542, -0.20522034398438233, -0.07153894870436557, -0.11096820327451119, -0.020185860699780706, 0.013327457854207957, -0.23671195956544494, 0.0205034703424833, 0.04680109055101089, 0.014625713426865777, 0.0007319373390549477, -0.08302205920939879, 0.007846999856344652, 0.14086986523350034, -0.03178850553692582, 0.02097176850052937, 0.166060085751046, -0.13796340606509233, -0.15865710670269043, 0.3892956291202386, -0.056430067615539606, -0.1532703082182638, 0.22491828028007216, -0.04831183939416594, -0.13966435581480838, 0.09948320270357829, 0.2336500401186915, 0.11492581339552999, -0.1608563002247258, 0.07078620388923776, 0.010501607729754638, 0.17342655964740464, 0.0031870041890421285, 0.07364719180732895, 0.1712811828683183, 0.23719960824533734, 0.04346630494725311, 0.15857099902262595, -0.07235960896293861, -0.1222376225072504, -0.2017660876626219, -0.1646685194905588, -0.20033468549658176, 0.02103939725367247, -0.07032824702146859, -0.11376879221478582, 0.3439007837113302, 0.17838856711359596, 0.16930464265718706, 0.09206384490573567, 0.336734599104362, 0.1281452659497758, 0.12378180639176928, 0.09426436280526379, 0.2009134535097851, 0.09015283983350152, 0.13723527338303063, -0.2329497939999268, 0.05680433276355407, 0.05491037459446574] |
1,802.08591 | Total Array Gains of Millimeter-Wave Mobile Phone Antennas Under
Practical Conditions | This paper studies a gain of an antenna array embedded on a mobile device
operating at a millimeter-wave radio frequency. Assuming that mobile phones at
millimeter-wave range operate with a single baseband unit and analog
beamforming like phased arrays, we define a total array gain denoting a path
gain of the phased antenna array in excess to the omni-directional path gain.
The total array gain circumvents the ambiguity of conventional array gain which
cannot be uniquely defined as there are multiple choices of a reference
single-element antenna in an array. Two types of 8-element patch antenna arrays
implemented on a mobile phone chassis, i.e., uniform linear array (ULA) and
distributed array (DA) both operating at 60 GHz, are studied. The gain
evaluated in a small-cell scenario in an airport shows that DA achieves higher
median and outage gain by up to 8 and 6 dB than ULA when different orientations
of the mobile phone are considered along with body torso and finger shadowing.
There are always postures of the mobile phone where ULA cannot see the
line-of-sight due to directionality of the patch antenna and of body and finger
shadowing, leading to outage gain of -15 dB in the worst case. The DA has much
smaller variation of the gain across different orientations of the phone, even
when the human torso shadowing and user's finger effects are considered.
| eess.SP | this paper studies a gain of an antenna array embedded on a mobile device operating at a millimeterwave radio frequency assuming that mobile phones at millimeterwave range operate with a single baseband unit and analog beamforming like phased arrays we define a total array gain denoting a path gain of the phased antenna array in excess to the omnidirectional path gain the total array gain circumvents the ambiguity of conventional array gain which cannot be uniquely defined as there are multiple choices of a reference singleelement antenna in an array two types of 8element patch antenna arrays implemented on a mobile phone chassis ie uniform linear array ula and distributed array da both operating at 60 ghz are studied the gain evaluated in a smallcell scenario in an airport shows that da achieves higher median and outage gain by up to 8 and 6 db than ula when different orientations of the mobile phone are considered along with body torso and finger shadowing there are always postures of the mobile phone where ula cannot see the lineofsight due to directionality of the patch antenna and of body and finger shadowing leading to outage gain of 15 db in the worst case the da has much smaller variation of the gain across different orientations of the phone even when the human torso shadowing and users finger effects are considered | [['this', 'paper', 'studies', 'a', 'gain', 'of', 'an', 'antenna', 'array', 'embedded', 'on', 'a', 'mobile', 'device', 'operating', 'at', 'a', 'millimeterwave', 'radio', 'frequency', 'assuming', 'that', 'mobile', 'phones', 'at', 'millimeterwave', 'range', 'operate', 'with', 'a', 'single', 'baseband', 'unit', 'and', 'analog', 'beamforming', 'like', 'phased', 'arrays', 'we', 'define', 'a', 'total', 'array', 'gain', 'denoting', 'a', 'path', 'gain', 'of', 'the', 'phased', 'antenna', 'array', 'in', 'excess', 'to', 'the', 'omnidirectional', 'path', 'gain', 'the', 'total', 'array', 'gain', 'circumvents', 'the', 'ambiguity', 'of', 'conventional', 'array', 'gain', 'which', 'can', 'not', 'be', 'uniquely', 'defined', 'as', 'there', 'are', 'multiple', 'choices', 'of', 'a', 'reference', 'singleelement', 'antenna', 'in', 'an', 'array', 'two', 'types', 'of', '8element', 'patch', 'antenna', 'arrays', 'implemented', 'on', 'a', 'mobile', 'phone', 'chassis', 'ie', 'uniform', 'linear', 'array', 'ula', 'and', 'distributed', 'array', 'da', 'both', 'operating', 'at', '60', 'ghz', 'are', 'studied', 'the', 'gain', 'evaluated', 'in', 'a', 'smallcell', 'scenario', 'in', 'an', 'airport', 'shows', 'that', 'da', 'achieves', 'higher', 'median', 'and', 'outage', 'gain', 'by', 'up', 'to', '8', 'and', '6', 'db', 'than', 'ula', 'when', 'different', 'orientations', 'of', 'the', 'mobile', 'phone', 'are', 'considered', 'along', 'with', 'body', 'torso', 'and', 'finger', 'shadowing', 'there', 'are', 'always', 'postures', 'of', 'the', 'mobile', 'phone', 'where', 'ula', 'can', 'not', 'see', 'the', 'lineofsight', 'due', 'to', 'directionality', 'of', 'the', 'patch', 'antenna', 'and', 'of', 'body', 'and', 'finger', 'shadowing', 'leading', 'to', 'outage', 'gain', 'of', '15', 'db', 'in', 'the', 'worst', 'case', 'the', 'da', 'has', 'much', 'smaller', 'variation', 'of', 'the', 'gain', 'across', 'different', 'orientations', 'of', 'the', 'phone', 'even', 'when', 'the', 'human', 'torso', 'shadowing', 'and', 'users', 'finger', 'effects', 'are', 'considered']] | [-0.22844970524108604, 0.08896904917321238, 0.02199875257463883, -0.023680749602879032, -0.050296029296663144, -0.20508657957366466, 0.053852510266512145, 0.4674514221665247, -0.19577889455198919, -0.31762358842761784, 0.0956791897109487, -0.2732027047637688, -0.1465250455075875, 0.18805833520752419, -0.08681589165125447, -0.004123823346225949, 0.06121710048907477, 0.028341843629174905, -0.012262663626461289, -0.20238062956208444, 0.20977725009282078, 0.10872545416426399, 0.3440897522757397, 0.005942398066753927, 0.12337454781948548, 0.02057269028306979, -0.007101460434901325, 0.015719902721922033, -0.03806996756852048, 0.08227964117718131, 0.2933446264967484, 0.12049115671897712, 0.23520396810389407, -0.4175388437371863, -0.20723987393759433, 0.0675565745782755, 0.1515126665963022, 0.02331041303291188, -0.014781758904396354, -0.28723422302965723, 0.1453956452259065, -0.23238507858123225, -0.09154921383090803, 0.10375818313990275, -0.016738537877150204, 0.07159855965241466, -0.3071622131574575, -0.04723891900933307, 0.006937090293301837, 0.08874500677515955, -0.015773665579035877, -0.15630980743014294, 0.02675462809148366, 0.18029551329394883, -0.013226713713906381, 0.008257359571997885, 0.14836849556102052, -0.08970442365591778, -0.0855230187146884, 0.3696766724668281, -0.016914384738534547, -0.22245643255908204, 0.16116184839553646, -0.1660243142740396, -0.024600007085372574, 0.1842844130304318, 0.24742003204301, 0.030400573335456378, -0.15411788311435173, 0.021488820325137804, -0.023892223490807024, 0.23814846211234514, 0.18363811021225285, 0.09692682532249423, 0.2108877808582569, 0.19065906591510967, 0.142792136149238, 0.13669709968127552, -0.1831204871887483, -0.06190542472000032, -0.18998297275798193, -0.07937390890235649, -0.1842090003364517, 0.0399057467003687, -0.13611343019469843, -0.1278803684303294, 0.33584384959312563, 0.09428768781135263, 0.11944318980120285, 0.07919683196194692, 0.36102538254901606, 0.06554532182045754, 0.12415469373252405, 0.06406941662097107, 0.20866510622689258, 0.06446459403605727, 0.15684671624103036, -0.18069398353564675, -0.021186072406682955, -0.06551815568084789] |
1,802.08592 | On a family of representations of residually finite groups | For a residually finite group $G$, its normal subgroups $G\supset G_1\supset
G_2\cdots$ with $\cap_{n\in\mathbb N}G_n=\{e\}$ and for a growth function
$\gamma$ we construct a unitary representation $\pi_\gamma$ of $G$. For the
minimal growth, $\pi_\gamma$ is weakly equivalent to the regular
representation, and for the maximal growth it is weakly equivalent to the
direct sum of the quasiregular representations on the quotients $G/G_n$. In the
case of intermediate growth we show two examples of different behaviour of
$\pi_\gamma$.
| math.GR | for a residually finite group g its normal subgroups gsupset g_1supset g_2cdots with cap_ninmathbb ng_ne and for a growth function gamma we construct a unitary representation pi_gamma of g for the minimal growth pi_gamma is weakly equivalent to the regular representation and for the maximal growth it is weakly equivalent to the direct sum of the quasiregular representations on the quotients gg_n in the case of intermediate growth we show two examples of different behaviour of pi_gamma | [['for', 'a', 'residually', 'finite', 'group', 'g', 'its', 'normal', 'subgroups', 'gsupset', 'g_1supset', 'g_2cdots', 'with', 'cap_ninmathbb', 'ng_ne', 'and', 'for', 'a', 'growth', 'function', 'gamma', 'we', 'construct', 'a', 'unitary', 'representation', 'pi_gamma', 'of', 'g', 'for', 'the', 'minimal', 'growth', 'pi_gamma', 'is', 'weakly', 'equivalent', 'to', 'the', 'regular', 'representation', 'and', 'for', 'the', 'maximal', 'growth', 'it', 'is', 'weakly', 'equivalent', 'to', 'the', 'direct', 'sum', 'of', 'the', 'quasiregular', 'representations', 'on', 'the', 'quotients', 'gg_n', 'in', 'the', 'case', 'of', 'intermediate', 'growth', 'we', 'show', 'two', 'examples', 'of', 'different', 'behaviour', 'of', 'pi_gamma']] | [-0.12795980383118946, 0.14549153430821143, -0.09263430970038403, 0.0536864116335007, -0.08307125845490253, -0.0848216724212039, -0.005742142940169736, 0.36291626326050863, -0.3131354052879631, -0.17365379632795103, 0.13097973293401555, -0.2864645345978541, -0.11525940364354277, 0.22229095358299475, -0.04800979812208512, -0.014603461171596069, 0.03423500428461049, 0.13589991396930937, -0.08877168487508666, -0.2530803156838025, 0.3609556466953395, -0.06450001949010646, 0.27571719220507734, 0.005034267149661502, 0.1229966912571698, 0.015041660428149244, -0.005109903377110828, -0.02012652160012967, -0.17219511618557043, 0.12207857617623594, 0.24296936454021767, 0.08209844692036102, 0.225748952551528, -0.3283113036942604, -0.1537924609976272, 0.18525858723545727, 0.11513920194048384, 0.006629939229316907, -0.055051880070544165, -0.22307000791156434, 0.13576910536965892, -0.19254934456046313, -0.12104061174474351, -0.018135999865217568, 0.0855013145618651, -0.008190128795981202, -0.2985542551295398, 0.05490565269368969, 0.0871421968411297, 0.06457317075755907, -0.03360893809370544, -0.046019910656119864, -0.044845457558762535, 0.11225004734675566, -0.006975879057068123, -0.01194845721100087, 0.06497763536275646, -0.13272935776630007, -0.05741539941973066, 0.3857628263737241, -0.1096444437790611, -0.2348466016071504, 0.22709304998845678, -0.19831090803219847, -0.14113760822490878, 0.11797811465388904, 0.10930838756110162, 0.15236206179204054, -0.044422197436326985, 0.16648202322340533, -0.09299311960396701, 0.08395720576095611, 0.050909818201134466, -0.03235388695173068, 0.11604898404308088, 0.15188641169376366, 0.09984927230246671, 0.16097369383102003, 0.06313751880015718, 0.020810721442103386, -0.34831012395044714, -0.1802173651601762, -0.13186383799471166, 0.10112151350468805, -0.1241370265233356, -0.22502696657017485, 0.41669574308477036, -0.0037316150376445626, 0.18059660253842194, 0.15345468872532964, 0.1755589993721614, 0.10684716807397669, 0.06245254539591197, 0.07424953865678344, 0.11380723827799195, 0.2085044638043244, -0.11147796780457847, -0.21853975212992463, 0.010071539505040401, 0.15702343485892228] |
1,802.08593 | Study of phonons in irradiated epitaxial thin films of UO$_2$ | We report experiments to determine the effect of radiation damage on the
phonon spectra of the most common nuclear fuel, UO$_2$. We have irradiated thin
($\sim$ 300 nm) epitaxial films of UO$_2$ with 2.1 MeV He$^{2+}$ ions to 0.15
dpa and a lattice swelling of $\Delta$a/a $\sim$ 0.6 %, and then used
grazing-incidence inelastic X-ray scattering to measure the phonon spectrum. We
succeeded to observe the acoustic modes, both transverse and longitudinal,
across the Brillouin zone. The phonon energies, in both the pristine and
irradiated samples, are unchanged from those observed in bulk material. On the
other hand, the phonon linewidths (inversely proportional to the phonon
lifetimes), show a significant broadening when comparing the pristine and
irradiated samples. This effect is shown to increase with phonon energy across
the Brillouin zone. The decreases in the phonon lifetimes of the acoustic modes
are roughly consistent with a 50 % reduction in the thermal conductivity.
| cond-mat.mtrl-sci | we report experiments to determine the effect of radiation damage on the phonon spectra of the most common nuclear fuel uo_2 we have irradiated thin sim 300 nm epitaxial films of uo_2 with 21 mev he2 ions to 015 dpa and a lattice swelling of deltaaa sim 06 and then used grazingincidence inelastic xray scattering to measure the phonon spectrum we succeeded to observe the acoustic modes both transverse and longitudinal across the brillouin zone the phonon energies in both the pristine and irradiated samples are unchanged from those observed in bulk material on the other hand the phonon linewidths inversely proportional to the phonon lifetimes show a significant broadening when comparing the pristine and irradiated samples this effect is shown to increase with phonon energy across the brillouin zone the decreases in the phonon lifetimes of the acoustic modes are roughly consistent with a 50 reduction in the thermal conductivity | [['we', 'report', 'experiments', 'to', 'determine', 'the', 'effect', 'of', 'radiation', 'damage', 'on', 'the', 'phonon', 'spectra', 'of', 'the', 'most', 'common', 'nuclear', 'fuel', 'uo_2', 'we', 'have', 'irradiated', 'thin', 'sim', '300', 'nm', 'epitaxial', 'films', 'of', 'uo_2', 'with', '21', 'mev', 'he2', 'ions', 'to', '015', 'dpa', 'and', 'a', 'lattice', 'swelling', 'of', 'deltaaa', 'sim', '06', 'and', 'then', 'used', 'grazingincidence', 'inelastic', 'xray', 'scattering', 'to', 'measure', 'the', 'phonon', 'spectrum', 'we', 'succeeded', 'to', 'observe', 'the', 'acoustic', 'modes', 'both', 'transverse', 'and', 'longitudinal', 'across', 'the', 'brillouin', 'zone', 'the', 'phonon', 'energies', 'in', 'both', 'the', 'pristine', 'and', 'irradiated', 'samples', 'are', 'unchanged', 'from', 'those', 'observed', 'in', 'bulk', 'material', 'on', 'the', 'other', 'hand', 'the', 'phonon', 'linewidths', 'inversely', 'proportional', 'to', 'the', 'phonon', 'lifetimes', 'show', 'a', 'significant', 'broadening', 'when', 'comparing', 'the', 'pristine', 'and', 'irradiated', 'samples', 'this', 'effect', 'is', 'shown', 'to', 'increase', 'with', 'phonon', 'energy', 'across', 'the', 'brillouin', 'zone', 'the', 'decreases', 'in', 'the', 'phonon', 'lifetimes', 'of', 'the', 'acoustic', 'modes', 'are', 'roughly', 'consistent', 'with', 'a', '50', 'reduction', 'in', 'the', 'thermal', 'conductivity']] | [-0.05474467188857186, 0.25601660418945055, -0.0203303166013211, -0.01168789153918624, -0.022818505120812915, -0.06776328561517099, 0.08122939840580026, 0.4409541495765249, -0.25434849673338855, -0.29444302604223294, 0.0009444574949642022, -0.4225999773790439, -0.006048892557931443, 0.21688853301573544, 0.03635374254236619, 0.02648605304537341, 0.03114087663901349, -0.04542537416641911, -0.04270483486975233, -0.16578350928922495, 0.2428885370120406, 0.0842756815161556, 0.3546650673200687, 0.11646460755107303, 0.02597209010273218, -0.02245083870521436, 0.05026665586978197, -0.024815818193989495, -0.1706481852273767, 0.039456183607690036, 0.25909784601380426, -0.13415212386908631, 0.1979728174644212, -0.4409148821234703, -0.2162175315618515, 0.018288669011866054, 0.1394303801159064, 0.12559874459169806, -0.027440524567694715, -0.19604499630630015, 0.04919141591216127, -0.11263903650144735, -0.11848500553828975, -2.533117930094401e-05, 0.0016511398817722995, -0.04288871888071299, -0.2017324550903868, 0.139179940566731, -0.009922188287600876, 0.07446555148887758, -0.15221005429668974, -0.1606954496509085, -0.1143089259415865, 0.02168144727688438, 0.08642406801848362, 0.018413787614554165, 0.24117933173663914, -0.04965135943998272, -0.051521627123778065, 0.3989422721043229, -0.08931329199733834, -0.028996461394320553, 0.1739236617689797, -0.24160138747344415, -0.013686338299885392, 0.24503927594671646, 0.12305000063031912, 0.09771856968291104, -0.11475715110592621, -0.009076124625668551, 0.030676171196003753, 0.19096685680095107, 0.0966113915387541, 0.09514628499513492, 0.1902179214730859, 0.18268930876239514, -0.06075746686973919, 0.13797535150350693, -0.20508713905078668, 0.04382126437034458, -0.1871866500377655, -0.12512844258608918, -0.1776427144712458, 0.06580778843412796, -0.07825069424026879, -0.155026440465784, 0.40135930544696746, 0.13701377870888487, 0.19924555339229605, -4.8300330915177864e-05, 0.26842755065299573, 0.1126010401546955, 0.12400057667633518, 0.07672962234045068, 0.3258613557368517, 0.18667519168773045, 0.09436686084149794, -0.34440421462524684, 0.03067587163299322, -0.0949068125958244] |
1,802.08594 | Links of sandwiched surface singularities and self-similarity | We characterize sandwiched singularities in terms of their link in two
different settings. We first prove that such singularities are precisely the
normal surface singularities having self-similar non-archimedean links. We
describe this self-similarity both in terms of Berkovich analytic geometry and
of the combinatorics of weighted dual graphs. We then show that a complex
surface singularity is sandwiched if and only if its complex link can be
embedded in a Kato surface in such a way that its complement remains connected.
| math.AG math.CV | we characterize sandwiched singularities in terms of their link in two different settings we first prove that such singularities are precisely the normal surface singularities having selfsimilar nonarchimedean links we describe this selfsimilarity both in terms of berkovich analytic geometry and of the combinatorics of weighted dual graphs we then show that a complex surface singularity is sandwiched if and only if its complex link can be embedded in a kato surface in such a way that its complement remains connected | [['we', 'characterize', 'sandwiched', 'singularities', 'in', 'terms', 'of', 'their', 'link', 'in', 'two', 'different', 'settings', 'we', 'first', 'prove', 'that', 'such', 'singularities', 'are', 'precisely', 'the', 'normal', 'surface', 'singularities', 'having', 'selfsimilar', 'nonarchimedean', 'links', 'we', 'describe', 'this', 'selfsimilarity', 'both', 'in', 'terms', 'of', 'berkovich', 'analytic', 'geometry', 'and', 'of', 'the', 'combinatorics', 'of', 'weighted', 'dual', 'graphs', 'we', 'then', 'show', 'that', 'a', 'complex', 'surface', 'singularity', 'is', 'sandwiched', 'if', 'and', 'only', 'if', 'its', 'complex', 'link', 'can', 'be', 'embedded', 'in', 'a', 'kato', 'surface', 'in', 'such', 'a', 'way', 'that', 'its', 'complement', 'remains', 'connected']] | [-0.19306639680512433, 0.06003565575789522, -0.12057518330115227, 0.1153682907583353, -0.08476476711623462, -0.11221265879655141, -0.015755896318565915, 0.3919127550849944, -0.3352539941760493, -0.19285914096061463, 0.10345809336286038, -0.27716155138648585, -0.25644040957990066, 0.17704999613012246, -0.1514501451043251, -0.03256808865936128, 0.017907085908967772, 0.040200678079768466, -0.09484786099041409, -0.25710367406775925, 0.41852089283229027, -0.0881658457622024, 0.21574082512431492, 0.10042456944507581, 0.07226823745180427, -0.013895517973988145, -0.002616065355983597, 0.10420901519476355, -0.18204331804880008, 0.1260745042739551, 0.2950932587278478, 0.07271772602078631, 0.19835221034152734, -0.4506547009733356, -0.1994628195455413, 0.16231752222656837, 0.1527328312764933, 0.01077337527682108, -0.0074508827191168145, -0.21989270484787815, 0.13573177884344334, -0.1336478997297861, -0.16519270475125974, -0.06169407367763788, -0.0020538593331972757, 0.04546249510697377, -0.16694261083080444, 0.017368467754603906, 0.09188765965770056, 0.07998646176017729, -0.023415726871103233, -0.0019836331154277297, -0.07250975772887928, 0.12559004604563484, -0.02917988032941925, 0.03586975222361492, 0.06935724923724917, -0.14094123142242523, -0.10237452186023195, 0.3182148443776424, -0.06244169704524087, -0.23341174610534016, 0.2141663591135983, -0.19073836911285733, -0.11207144422008207, 0.08409806498452838, 0.12200765425546302, 0.1405006557714516, -0.08006384730752972, 0.16526599224789046, -0.0713556993028356, 0.0604312331645669, 0.1382179501046783, 0.01520295857946262, 0.17655571696153025, 0.11771338514661715, 0.07653318736184803, 0.14151553442718945, -0.04138014543755555, -0.05794987635526024, -0.3351695375563002, -0.23187796705413932, -0.17199756279530257, 0.0835783240603812, -0.1361565964729784, -0.24623271760841212, 0.42024627042773327, 0.040097651468520915, 0.2328957811365893, 0.050624042059536335, 0.2637936227414527, 0.07753233613883272, -0.009363797657122766, 0.09452581505670592, 0.19640647207191328, 0.15832306796477902, -0.02754735589073396, -0.13483245601233693, 0.05163795918939106, 0.08465478435319698] |
1,802.08595 | Time-Varying Block Codes for Synchronization Errors: MAP Decoder and
Practical Issues | \begin{abstract} In this paper we consider Time-Varying Block (TVB) codes,
which generalize a number of previous synchronization error-correcting codes.
We also consider various practical issues related to MAP decoding of these
codes. Specifically, we give an expression for the expected distribution of
drift between transmitter and receiver due to synchronization errors. We
determine an appropriate choice for state space limits based on the drift
probability distribution. In turn, we obtain an expression for the decoder
complexity under given channel conditions in terms of the state space limits
used. For a given state space, we also give a number of optimizations that
reduce the algorithm complexity with no further loss of decoder performance. We
also show how the MAP decoder can be used in the absence of known frame
boundaries, and demonstrate that an appropriate choice of decoder parameters
allows the decoder to approach the performance when frame boundaries are known,
at the expense of some increase in complexity. Finally, we express some
existing constructions as TVB codes, comparing performance with published
results, and showing that improved performance is possible by taking advantage
of the flexibility of TVB codes.
| cs.IT math.IT | beginabstract in this paper we consider timevarying block tvb codes which generalize a number of previous synchronization errorcorrecting codes we also consider various practical issues related to map decoding of these codes specifically we give an expression for the expected distribution of drift between transmitter and receiver due to synchronization errors we determine an appropriate choice for state space limits based on the drift probability distribution in turn we obtain an expression for the decoder complexity under given channel conditions in terms of the state space limits used for a given state space we also give a number of optimizations that reduce the algorithm complexity with no further loss of decoder performance we also show how the map decoder can be used in the absence of known frame boundaries and demonstrate that an appropriate choice of decoder parameters allows the decoder to approach the performance when frame boundaries are known at the expense of some increase in complexity finally we express some existing constructions as tvb codes comparing performance with published results and showing that improved performance is possible by taking advantage of the flexibility of tvb codes | [['beginabstract', 'in', 'this', 'paper', 'we', 'consider', 'timevarying', 'block', 'tvb', 'codes', 'which', 'generalize', 'a', 'number', 'of', 'previous', 'synchronization', 'errorcorrecting', 'codes', 'we', 'also', 'consider', 'various', 'practical', 'issues', 'related', 'to', 'map', 'decoding', 'of', 'these', 'codes', 'specifically', 'we', 'give', 'an', 'expression', 'for', 'the', 'expected', 'distribution', 'of', 'drift', 'between', 'transmitter', 'and', 'receiver', 'due', 'to', 'synchronization', 'errors', 'we', 'determine', 'an', 'appropriate', 'choice', 'for', 'state', 'space', 'limits', 'based', 'on', 'the', 'drift', 'probability', 'distribution', 'in', 'turn', 'we', 'obtain', 'an', 'expression', 'for', 'the', 'decoder', 'complexity', 'under', 'given', 'channel', 'conditions', 'in', 'terms', 'of', 'the', 'state', 'space', 'limits', 'used', 'for', 'a', 'given', 'state', 'space', 'we', 'also', 'give', 'a', 'number', 'of', 'optimizations', 'that', 'reduce', 'the', 'algorithm', 'complexity', 'with', 'no', 'further', 'loss', 'of', 'decoder', 'performance', 'we', 'also', 'show', 'how', 'the', 'map', 'decoder', 'can', 'be', 'used', 'in', 'the', 'absence', 'of', 'known', 'frame', 'boundaries', 'and', 'demonstrate', 'that', 'an', 'appropriate', 'choice', 'of', 'decoder', 'parameters', 'allows', 'the', 'decoder', 'to', 'approach', 'the', 'performance', 'when', 'frame', 'boundaries', 'are', 'known', 'at', 'the', 'expense', 'of', 'some', 'increase', 'in', 'complexity', 'finally', 'we', 'express', 'some', 'existing', 'constructions', 'as', 'tvb', 'codes', 'comparing', 'performance', 'with', 'published', 'results', 'and', 'showing', 'that', 'improved', 'performance', 'is', 'possible', 'by', 'taking', 'advantage', 'of', 'the', 'flexibility', 'of', 'tvb', 'codes']] | [-0.14734336947824092, 0.03002897462779111, -0.05705932058094248, 0.0722105093473727, -0.048326433381125175, -0.17235009051968364, 0.07873234763664709, 0.4078130455529119, -0.27316267529819555, -0.29458974935411614, 0.1160412641245862, -0.2025976701506613, -0.18424887899705705, 0.21216724601950734, -0.1506205664593429, 0.08894253815920587, 0.09233902698194489, 0.06049216595636879, -0.13011657321693107, -0.32067673142127534, 0.30021760467330905, 0.14852956553767535, 0.2888167046426617, 0.021256832977784103, 0.10327401346628594, -0.0028226023188177895, 0.00078441987329341, -0.00967020886015776, -0.16565162737223293, 0.0990780230284609, 0.24795445975193636, 0.19335195575989386, 0.22294421326071817, -0.4004423214925176, -0.21640116150708907, 0.09235454335353001, 0.14773095615066964, 0.14879730455342066, -0.040489928094680085, -0.24664597027994534, 0.08487596481969144, -0.1906603490240238, -0.04213156006199882, -0.05576896052772351, -0.04477110523680978, 0.031074620212398547, -0.2956380200413789, -0.00995695880447648, 0.06712333497249502, 0.03476783633232117, -0.06205775942795841, -0.14362306918260304, 0.04612191337683397, 0.16276535648617899, 0.03273200137575375, 0.02559449242556745, 0.06405413302870348, -0.09943700733005088, -0.12846596438024055, 0.3411596189636955, -0.046860262106650785, -0.269516974905855, 0.15556204923276265, -0.08541224705194064, -0.11557332191683174, 0.1351780820776649, 0.2087490098065439, 0.051440099551481135, -0.11062790826682875, 0.07565705658294548, -0.004829404795755375, 0.18212529642388542, 0.08442295564863672, 0.11999656905437463, 0.11857662535956169, 0.1401415559936295, 0.09274488506699971, 0.21722518404056515, -0.08731151150881332, -0.07046760294736273, -0.3069882435882662, -0.15203896302982492, -0.16289020739892063, -0.022723943225425133, -0.10921477485781578, -0.12974183450445553, 0.3692235251853956, 0.21131793011792321, 0.19249084214630358, 0.13414921798369292, 0.2879446312596903, 0.08743182568937204, 0.029931751570287855, 0.1353489441866491, 0.18060315442129107, 0.11922582302445625, 0.022109344990507877, -0.21918786575948385, 0.09497436538011708, 0.06620757244131033] |
1,802.08596 | Static memory materials | We simulate static memory materials on a two-dimensional lattice. The bulk
properties of such materials depend on boundary conditions. Considerable
information can be stored in various local patterns. We observe local
probabilities oscillating with the distance from the boundary. The dependence
of the local statistical information on this distance can be described by a
linear evolution of classical wave functions, including the superposition
principle and classical interference. We speculate that these new phenomena
could open new algorithmic possibilities analogous to quantum computing.
| cond-mat.stat-mech hep-lat quant-ph | we simulate static memory materials on a twodimensional lattice the bulk properties of such materials depend on boundary conditions considerable information can be stored in various local patterns we observe local probabilities oscillating with the distance from the boundary the dependence of the local statistical information on this distance can be described by a linear evolution of classical wave functions including the superposition principle and classical interference we speculate that these new phenomena could open new algorithmic possibilities analogous to quantum computing | [['we', 'simulate', 'static', 'memory', 'materials', 'on', 'a', 'twodimensional', 'lattice', 'the', 'bulk', 'properties', 'of', 'such', 'materials', 'depend', 'on', 'boundary', 'conditions', 'considerable', 'information', 'can', 'be', 'stored', 'in', 'various', 'local', 'patterns', 'we', 'observe', 'local', 'probabilities', 'oscillating', 'with', 'the', 'distance', 'from', 'the', 'boundary', 'the', 'dependence', 'of', 'the', 'local', 'statistical', 'information', 'on', 'this', 'distance', 'can', 'be', 'described', 'by', 'a', 'linear', 'evolution', 'of', 'classical', 'wave', 'functions', 'including', 'the', 'superposition', 'principle', 'and', 'classical', 'interference', 'we', 'speculate', 'that', 'these', 'new', 'phenomena', 'could', 'open', 'new', 'algorithmic', 'possibilities', 'analogous', 'to', 'quantum', 'computing']] | [-0.15045318402713392, 0.17174577450652312, -0.12221595475722741, 0.09174304833016698, -0.0984554347985356, -0.11159899069859487, 0.046861400265564644, 0.3379807208960013, -0.36292090154502815, -0.2842274856776362, 0.09971256302130159, -0.2390761768854246, -0.16665709542860163, 0.20904139696234247, -0.04714009383261749, 0.09292113075100976, 0.018216807376763716, 0.02060384791707847, -0.12337209129558377, -0.19446024516307772, 0.3294849023506863, 0.014488175782522686, 0.3086057143831035, 0.06840173428787327, 0.04943277318848342, 0.007306718772913261, -0.005791107328926645, 0.06989461273840833, -0.1612277733558319, 0.11343553671954064, 0.19838823934608116, 0.09660015753243209, 0.22185662210487375, -0.49745938826988384, -0.27620023041509273, 0.08103734229850333, 0.10466082946953886, 0.16286045124345436, -0.055781006456704856, -0.29339103146297174, 0.044529233752499994, -0.10593514053559885, -0.13256841421371507, -0.0686862798487177, -0.021075713575999366, 0.07291146682393623, -0.22924560974011335, 0.09100252711327701, 0.03418339214148568, 0.04873209287378392, -0.06411759064123942, -0.0903868875750227, 0.0166009453781199, 0.1372086680039945, -0.026152324147249866, -0.002396352316548185, 0.1517906006789062, -0.11921799664311793, -0.16178221787076172, 0.36139148620252565, -0.050326264860880814, -0.19799079426291694, 0.21862799261991933, -0.12899694558255737, -0.09765039512989815, 0.07758795268685989, 0.2059915944388727, 0.07995952041706116, -0.17932737516466438, 0.08015234199313166, -0.04081933280696564, 0.14919651075260623, 0.07069353285677187, 0.1373934448560382, 0.25285074182945055, 0.11884314866691101, 0.04621024166443953, 0.16913326536362036, -0.07126139474339874, -0.13337847571138564, -0.2943116564803371, -0.1519597285518014, -0.19662993271812435, 0.08989706361242542, -0.12318518438086158, -0.18675215987534058, 0.3938373149849656, 0.14949723486305874, 0.1685358306347597, -0.032779374534673084, 0.2407702306830665, 0.117800722733458, 0.08805717232568962, 0.08799243990683973, 0.23361499723410462, 0.09587458272680367, 0.06946876253251259, -0.24303029270036283, 0.07114712544149016, 0.044371891903077686] |
1,802.08597 | Constraining the optical potential in the search for eta-mesic 4He | A consistent description of the $ d d \rightarrow$
$^{4}\hspace{-0.03cm}\mbox{He} \eta$ and $ d d \rightarrow$
($^4$He$\eta$)$_{bound} \rightarrow X $ cross sections was recently proposed
with a broad range of real ($V_{0}$) and imaginary (W0), $\eta$-$^4$He optical
potential parameters leading to a good agreement with the d d -> 4He eta data.
Here we compare the predictions of the model below the $\eta$ production
threshold, with the WASA-at-COSY excitation functions for the dd -> 3He N pi
reactions to put stronger constraints on (V0, W0). The allowed parameter space
(with |V_0| < \sim 60 MeV and |W_0| < \sim 7 MeV estimated at 90% CL ) excludes
most optical model predictions of eta-4He nuclei except for some loosely bound
narrow states.
| nucl-ex | a consistent description of the d d rightarrow 4hspace003cmmboxhe eta and d d rightarrow 4heeta_bound rightarrow x cross sections was recently proposed with a broad range of real v_0 and imaginary w0 eta4he optical potential parameters leading to a good agreement with the d d 4he eta data here we compare the predictions of the model below the eta production threshold with the wasaatcosy excitation functions for the dd 3he n pi reactions to put stronger constraints on v0 w0 the allowed parameter space with v_0 sim 60 mev and w_0 sim 7 mev estimated at 90 cl excludes most optical model predictions of eta4he nuclei except for some loosely bound narrow states | [['a', 'consistent', 'description', 'of', 'the', 'd', 'd', 'rightarrow', '4hspace003cmmboxhe', 'eta', 'and', 'd', 'd', 'rightarrow', '4heeta_bound', 'rightarrow', 'x', 'cross', 'sections', 'was', 'recently', 'proposed', 'with', 'a', 'broad', 'range', 'of', 'real', 'v_0', 'and', 'imaginary', 'w0', 'eta4he', 'optical', 'potential', 'parameters', 'leading', 'to', 'a', 'good', 'agreement', 'with', 'the', 'd', 'd', '4he', 'eta', 'data', 'here', 'we', 'compare', 'the', 'predictions', 'of', 'the', 'model', 'below', 'the', 'eta', 'production', 'threshold', 'with', 'the', 'wasaatcosy', 'excitation', 'functions', 'for', 'the', 'dd', '3he', 'n', 'pi', 'reactions', 'to', 'put', 'stronger', 'constraints', 'on', 'v0', 'w0', 'the', 'allowed', 'parameter', 'space', 'with', 'v_0', 'sim', '60', 'mev', 'and', 'w_0', 'sim', '7', 'mev', 'estimated', 'at', '90', 'cl', 'excludes', 'most', 'optical', 'model', 'predictions', 'of', 'eta4he', 'nuclei', 'except', 'for', 'some', 'loosely', 'bound', 'narrow', 'states']] | [-0.11494748081659546, 0.200369501125638, -0.015998941430872358, 0.04731476693707812, 0.021015196360609924, -0.2168626898001913, 0.11472283154390417, 0.3217758129787136, -0.17405559548055166, -0.2650554181991128, -0.06687049105813778, -0.350519746000803, 0.04861233692809201, 0.1748923426368148, 0.11091286981444773, 0.07362449712954831, 0.06867853689494098, 0.06593693936293996, -0.05408880689605097, -0.16671680923349955, 0.22985041472087572, 0.041721068356219713, 0.19383436929317074, 0.10873126045607769, 0.01635573364412496, 0.0028205588501920035, 0.03536440741096682, -0.10489819177477788, -0.26527956623147736, 0.03669850329128052, 0.2220678939861623, 0.03711602527664991, 0.14354791668419903, -0.3131771536359379, -0.155047202652723, 0.1925924148133679, 0.15956155747712195, 0.034850815453709244, 0.05537799534677352, -0.31823043483267494, 0.09330852783750743, -0.16389448762879716, -0.15778555459267385, -0.033334729653287064, 0.17037063339087474, -0.029659881816572836, -0.33496856406280723, 0.08789734782332236, -0.047978043012941875, 0.04639567260059889, -0.09949799408498514, -0.27930083889765916, -0.0743561972201139, -0.039428192992098966, 0.024131063814484724, 0.1579629375372787, 0.12603237054117764, -0.1133603946780748, -0.03898511373916188, 0.3723115807667643, -0.09724514235885025, -0.11828053620148886, 0.14735294318011216, -0.20255960243426868, -0.11035255869107975, 0.20188489964080825, 0.1418849459538857, 0.09125708469015605, -0.0628697279072996, 0.14967549238867872, -0.019243008509563567, 0.21498295576479454, 0.10516586113586887, 0.019729845632281393, 0.09964926292708663, 0.17991690021343865, -0.027651993490688434, 0.001040646416210645, -0.14607547477584099, -0.023840021656675113, -0.3827460657234664, -0.06658826668396475, -0.09146290472582788, 0.09625803765123458, -0.11401674622496241, -0.024745281710213906, 0.2786764426802931, 0.018486715106478147, 0.35659223990194994, 0.04196958298383801, 0.23657147270870638, 0.09773533426325869, -0.0016288823741257427, 0.0507609842529705, 0.2727654265496263, 0.20210759947495954, 0.07400135128330942, -0.1936197869504827, 0.03325179642116701, -0.02601259441307939] |
1,802.08598 | Learning Weighted Representations for Generalization Across Designs | Predictive models that generalize well under distributional shift are often
desirable and sometimes crucial to building robust and reliable machine
learning applications. We focus on distributional shift that arises in causal
inference from observational data and in unsupervised domain adaptation. We
pose both of these problems as prediction under a shift in design. Popular
methods for overcoming distributional shift make unrealistic assumptions such
as having a well-specified model or knowing the policy that gave rise to the
observed data. Other methods are hindered by their need for a pre-specified
metric for comparing observations, or by poor asymptotic properties. We devise
a bound on the generalization error under design shift, incorporating both
representation learning and sample re-weighting. Based on the bound, we propose
an algorithmic framework that does not require any of the above assumptions and
which is asymptotically consistent. We empirically study the new framework
using two synthetic datasets, and demonstrate its effectiveness compared to
previous methods.
| stat.ML | predictive models that generalize well under distributional shift are often desirable and sometimes crucial to building robust and reliable machine learning applications we focus on distributional shift that arises in causal inference from observational data and in unsupervised domain adaptation we pose both of these problems as prediction under a shift in design popular methods for overcoming distributional shift make unrealistic assumptions such as having a wellspecified model or knowing the policy that gave rise to the observed data other methods are hindered by their need for a prespecified metric for comparing observations or by poor asymptotic properties we devise a bound on the generalization error under design shift incorporating both representation learning and sample reweighting based on the bound we propose an algorithmic framework that does not require any of the above assumptions and which is asymptotically consistent we empirically study the new framework using two synthetic datasets and demonstrate its effectiveness compared to previous methods | [['predictive', 'models', 'that', 'generalize', 'well', 'under', 'distributional', 'shift', 'are', 'often', 'desirable', 'and', 'sometimes', 'crucial', 'to', 'building', 'robust', 'and', 'reliable', 'machine', 'learning', 'applications', 'we', 'focus', 'on', 'distributional', 'shift', 'that', 'arises', 'in', 'causal', 'inference', 'from', 'observational', 'data', 'and', 'in', 'unsupervised', 'domain', 'adaptation', 'we', 'pose', 'both', 'of', 'these', 'problems', 'as', 'prediction', 'under', 'a', 'shift', 'in', 'design', 'popular', 'methods', 'for', 'overcoming', 'distributional', 'shift', 'make', 'unrealistic', 'assumptions', 'such', 'as', 'having', 'a', 'wellspecified', 'model', 'or', 'knowing', 'the', 'policy', 'that', 'gave', 'rise', 'to', 'the', 'observed', 'data', 'other', 'methods', 'are', 'hindered', 'by', 'their', 'need', 'for', 'a', 'prespecified', 'metric', 'for', 'comparing', 'observations', 'or', 'by', 'poor', 'asymptotic', 'properties', 'we', 'devise', 'a', 'bound', 'on', 'the', 'generalization', 'error', 'under', 'design', 'shift', 'incorporating', 'both', 'representation', 'learning', 'and', 'sample', 'reweighting', 'based', 'on', 'the', 'bound', 'we', 'propose', 'an', 'algorithmic', 'framework', 'that', 'does', 'not', 'require', 'any', 'of', 'the', 'above', 'assumptions', 'and', 'which', 'is', 'asymptotically', 'consistent', 'we', 'empirically', 'study', 'the', 'new', 'framework', 'using', 'two', 'synthetic', 'datasets', 'and', 'demonstrate', 'its', 'effectiveness', 'compared', 'to', 'previous', 'methods']] | [-0.028882977867107484, 0.01302939197458223, -0.09860242226540711, 0.1004837878659415, -0.14262134917258362, -0.17911951924425068, 0.09867711632607422, 0.45089723319289793, -0.2336810062858899, -0.33103302401448986, 0.13416437779311877, -0.23084357759031426, -0.1751528600301997, 0.23150833208072386, -0.15155025141218761, 0.09266731085420354, 0.09507789601909981, 0.03893843316917966, -0.0962910663001358, -0.21661893999097265, 0.33354442878507645, 0.04252132636963562, 0.35677020057663617, 0.020066583605118357, 0.10587430608185945, -0.006671844039907216, -0.034096036180497925, 0.02044418318327635, -0.11799690019725644, 0.15558004213769913, 0.24871083035736338, 0.19507010281382567, 0.31132098293275967, -0.40710700270666994, -0.24407210307800845, 0.13172025088173378, 0.13602980502709083, 0.11699156844582495, -0.07528940370531788, -0.30041671672444437, 0.08763328992396854, -0.13479558066435302, -0.046098058942444384, -0.1778774336158375, -0.04631387612301927, -0.0037819658106513273, -0.3080812711450331, 0.06783033153160838, 0.09945374481145672, 0.06879499948268035, -0.06756667296956798, -0.15094969414803347, 0.056053685905281335, 0.12366612731022344, 0.07949596136633402, 0.006831162486071135, 0.11132269634444053, -0.1339866246080477, -0.14349002726257418, 0.37571752932112495, -0.06795507699108808, -0.22724554289145704, 0.2063060436363682, -0.035234915341731086, -0.16378719228835906, 0.055564013532226446, 0.2059607781443128, 0.11746230319877908, -0.14088334920549184, 0.07158196064017737, -0.011174723615715648, 0.15068034312219186, 0.04018722609824436, 0.03010949936760649, 0.1530153990806982, 0.19486344445520526, 0.07915314216059958, 0.09770421692278461, -0.07655550381850902, -0.10116907319492975, -0.2668738094555914, -0.07162648155339134, -0.16971137103547526, 0.0003094682634020651, -0.11546938540951562, -0.17810310325496326, 0.3393291293518843, 0.24666019274028622, 0.2150227025034096, 0.10868000861918732, 0.3206610565969519, 0.08032335582853645, 0.06184444755796272, 0.10816162202958089, 0.208389090460126, 0.0566429879640935, 0.05617163301546388, -0.18158350265836995, 0.14967223194392196, 0.009433404846520275] |
1,802.08599 | Evaluating Scoped Meaning Representations | Semantic parsing offers many opportunities to improve natural language
understanding. We present a semantically annotated parallel corpus for English,
German, Italian, and Dutch where sentences are aligned with scoped meaning
representations in order to capture the semantics of negation, modals,
quantification, and presupposition triggers. The semantic formalism is based on
Discourse Representation Theory, but concepts are represented by WordNet
synsets and thematic roles by VerbNet relations. Translating scoped meaning
representations to sets of clauses enables us to compare them for the purpose
of semantic parser evaluation and checking translations. This is done by
computing precision and recall on matching clauses, in a similar way as is done
for Abstract Meaning Representations. We show that our matching tool for
evaluating scoped meaning representations is both accurate and efficient.
Applying this matching tool to three baseline semantic parsers yields F-scores
between 43% and 54%. A pilot study is performed to automatically find changes
in meaning by comparing meaning representations of translations. This
comparison turns out to be an additional way of (i) finding annotation mistakes
and (ii) finding instances where our semantic analysis needs to be improved.
| cs.CL | semantic parsing offers many opportunities to improve natural language understanding we present a semantically annotated parallel corpus for english german italian and dutch where sentences are aligned with scoped meaning representations in order to capture the semantics of negation modals quantification and presupposition triggers the semantic formalism is based on discourse representation theory but concepts are represented by wordnet synsets and thematic roles by verbnet relations translating scoped meaning representations to sets of clauses enables us to compare them for the purpose of semantic parser evaluation and checking translations this is done by computing precision and recall on matching clauses in a similar way as is done for abstract meaning representations we show that our matching tool for evaluating scoped meaning representations is both accurate and efficient applying this matching tool to three baseline semantic parsers yields fscores between 43 and 54 a pilot study is performed to automatically find changes in meaning by comparing meaning representations of translations this comparison turns out to be an additional way of i finding annotation mistakes and ii finding instances where our semantic analysis needs to be improved | [['semantic', 'parsing', 'offers', 'many', 'opportunities', 'to', 'improve', 'natural', 'language', 'understanding', 'we', 'present', 'a', 'semantically', 'annotated', 'parallel', 'corpus', 'for', 'english', 'german', 'italian', 'and', 'dutch', 'where', 'sentences', 'are', 'aligned', 'with', 'scoped', 'meaning', 'representations', 'in', 'order', 'to', 'capture', 'the', 'semantics', 'of', 'negation', 'modals', 'quantification', 'and', 'presupposition', 'triggers', 'the', 'semantic', 'formalism', 'is', 'based', 'on', 'discourse', 'representation', 'theory', 'but', 'concepts', 'are', 'represented', 'by', 'wordnet', 'synsets', 'and', 'thematic', 'roles', 'by', 'verbnet', 'relations', 'translating', 'scoped', 'meaning', 'representations', 'to', 'sets', 'of', 'clauses', 'enables', 'us', 'to', 'compare', 'them', 'for', 'the', 'purpose', 'of', 'semantic', 'parser', 'evaluation', 'and', 'checking', 'translations', 'this', 'is', 'done', 'by', 'computing', 'precision', 'and', 'recall', 'on', 'matching', 'clauses', 'in', 'a', 'similar', 'way', 'as', 'is', 'done', 'for', 'abstract', 'meaning', 'representations', 'we', 'show', 'that', 'our', 'matching', 'tool', 'for', 'evaluating', 'scoped', 'meaning', 'representations', 'is', 'both', 'accurate', 'and', 'efficient', 'applying', 'this', 'matching', 'tool', 'to', 'three', 'baseline', 'semantic', 'parsers', 'yields', 'fscores', 'between', '43', 'and', '54', 'a', 'pilot', 'study', 'is', 'performed', 'to', 'automatically', 'find', 'changes', 'in', 'meaning', 'by', 'comparing', 'meaning', 'representations', 'of', 'translations', 'this', 'comparison', 'turns', 'out', 'to', 'be', 'an', 'additional', 'way', 'of', 'i', 'finding', 'annotation', 'mistakes', 'and', 'ii', 'finding', 'instances', 'where', 'our', 'semantic', 'analysis', 'needs', 'to', 'be', 'improved']] | [-0.041462266771122816, 0.01663714746033735, -0.07709632292641579, 0.13503433708227366, -0.2040516233719835, -0.10536627178332089, 0.08482909070994907, 0.4311489676251202, -0.27193457237570673, -0.3827049621733258, 0.008330650945395432, -0.29902388244313566, -0.10258065904113087, 0.17924341723775944, -0.11716352480438513, 0.027600384000185375, 0.12275931603099044, 0.059051433673782926, -0.06060671041518249, -0.23653444377202038, 0.29580693103347877, 0.02958306020906044, 0.3201415618478849, 0.014195132899928737, 0.11046026274310174, -0.038520292996592514, -0.12157767188382913, 0.007109579696898928, -0.038934541993492874, 0.21127434992078042, 0.39442845221508194, 0.2508996601820596, 0.268681990456566, -0.3832031647800594, -0.11444636990089674, 0.02910095192114445, 0.12261493760224029, 0.09243417712985663, 0.029165908137990817, -0.3906937630180068, 0.09488914867774961, -0.16742210510010655, 0.03647804529582326, -0.19481936023331473, 0.05453431971270491, -0.05551869683848644, -0.2499411897274439, -0.014517008613738407, 0.12512887476666554, 0.13916359656440044, -0.04541627992498311, -0.09863057899465029, 0.026340806966244773, 0.1807143379846034, 0.013881261602698548, 0.08830678748545816, 0.09853786157595144, -0.13158855136056002, -0.15703203556618678, 0.4105917635197575, -0.040951080702723484, -0.25189386075645737, 0.18677711748341855, -0.023955939356803995, -0.1786631902855997, 0.038393806955286276, 0.12502282420424995, 0.07077011393282462, -0.18382592511841575, 0.03622669607929482, -0.045062362680815767, 0.2394913251077555, 0.1595922572689282, 0.007998357990102189, 0.21901147464491627, 0.22225388707341376, -0.03160592267270879, 0.1515200330309469, -0.0037124142687881014, -0.06334891404667115, -0.2537037987425621, -0.15989756894188167, -0.09203434038177334, -0.05756776756040651, -0.09156300174009457, -0.1256334968414661, 0.361169105375538, 0.22834321130570528, 0.15595384970105983, 0.13386274595820422, 0.28806911131014695, 0.03496566788431861, 0.09360293680801987, 0.08713167577201651, 0.10131032588967198, 0.040540655259345026, 0.10848704116148371, -0.11201541238775904, 0.12771409542702541, 0.1268102864432778] |
1,802.086 | Multifrequency superscattering from subwavelength hyperbolic structures | Superscattering, i.e., a phenomenon of the scattering cross section from a
subwavelength object exceeding the single-channel limit, has important
prospects in enhanced sensing/spectroscopy, solar cells, and biomedical
imaging. Superscattering can be typically constructed only at a single
frequency regime, and depends critically on the inescapable material losses.
Under such realistic conditions, superscattering has not been predicted nor
observed to exist simultaneously at multiple frequency regimes. Here we
introduce multifrequency superscattering in a subwavelength hyperbolic
structure, which can be made from artificial metamaterials or from
naturally-existing materials, such as hexagonal boron nitride (BN), and show
the advantage of such hyperbolic materials for reducing structural complexity.
The underlying mechanism is revealed to be the multimode resonances at multiple
frequency regimes as appear in BN due to the peculiar dispersion of
phonon-polaritons. Importantly, the multifrequency superscattering has a high
tolerance to material losses and some structural variations, bringing the
concept of multifrequency superscattering closer to useful and realistic
conditions.
| physics.optics | superscattering ie a phenomenon of the scattering cross section from a subwavelength object exceeding the singlechannel limit has important prospects in enhanced sensingspectroscopy solar cells and biomedical imaging superscattering can be typically constructed only at a single frequency regime and depends critically on the inescapable material losses under such realistic conditions superscattering has not been predicted nor observed to exist simultaneously at multiple frequency regimes here we introduce multifrequency superscattering in a subwavelength hyperbolic structure which can be made from artificial metamaterials or from naturallyexisting materials such as hexagonal boron nitride bn and show the advantage of such hyperbolic materials for reducing structural complexity the underlying mechanism is revealed to be the multimode resonances at multiple frequency regimes as appear in bn due to the peculiar dispersion of phononpolaritons importantly the multifrequency superscattering has a high tolerance to material losses and some structural variations bringing the concept of multifrequency superscattering closer to useful and realistic conditions | [['superscattering', 'ie', 'a', 'phenomenon', 'of', 'the', 'scattering', 'cross', 'section', 'from', 'a', 'subwavelength', 'object', 'exceeding', 'the', 'singlechannel', 'limit', 'has', 'important', 'prospects', 'in', 'enhanced', 'sensingspectroscopy', 'solar', 'cells', 'and', 'biomedical', 'imaging', 'superscattering', 'can', 'be', 'typically', 'constructed', 'only', 'at', 'a', 'single', 'frequency', 'regime', 'and', 'depends', 'critically', 'on', 'the', 'inescapable', 'material', 'losses', 'under', 'such', 'realistic', 'conditions', 'superscattering', 'has', 'not', 'been', 'predicted', 'nor', 'observed', 'to', 'exist', 'simultaneously', 'at', 'multiple', 'frequency', 'regimes', 'here', 'we', 'introduce', 'multifrequency', 'superscattering', 'in', 'a', 'subwavelength', 'hyperbolic', 'structure', 'which', 'can', 'be', 'made', 'from', 'artificial', 'metamaterials', 'or', 'from', 'naturallyexisting', 'materials', 'such', 'as', 'hexagonal', 'boron', 'nitride', 'bn', 'and', 'show', 'the', 'advantage', 'of', 'such', 'hyperbolic', 'materials', 'for', 'reducing', 'structural', 'complexity', 'the', 'underlying', 'mechanism', 'is', 'revealed', 'to', 'be', 'the', 'multimode', 'resonances', 'at', 'multiple', 'frequency', 'regimes', 'as', 'appear', 'in', 'bn', 'due', 'to', 'the', 'peculiar', 'dispersion', 'of', 'phononpolaritons', 'importantly', 'the', 'multifrequency', 'superscattering', 'has', 'a', 'high', 'tolerance', 'to', 'material', 'losses', 'and', 'some', 'structural', 'variations', 'bringing', 'the', 'concept', 'of', 'multifrequency', 'superscattering', 'closer', 'to', 'useful', 'and', 'realistic', 'conditions']] | [-0.10987665849532206, 0.14590065837716804, -0.05384409421576374, 0.030394759351182004, -0.0933555374919836, -0.15174445564640904, 0.04807826078363827, 0.44586355703604685, -0.2721291936710235, -0.294239767567049, 0.08126950568395558, -0.25244319360316186, -0.18724464025959228, 0.24123615601444737, -0.031606188820306115, 0.08185616058793355, 0.033859698936439954, -0.04581651317451585, -0.013148299911265055, -0.13388589800444323, 0.2635194464320583, 0.06397804870612635, 0.32095229857020663, 0.08662165895629033, 0.09198426640616705, -0.03877442446764099, 0.05501008248591626, 0.025358526925133032, -0.0789471510676788, 0.06691172775243978, 0.2579303934637989, -0.006539919877775594, 0.24210638640140025, -0.4624298485963569, -0.2873999872789174, 0.05468189590568987, 0.17168347323585495, 0.12846234496818953, -0.05173468083073687, -0.27102658578327726, 0.07089828968640756, -0.10470191852866927, -0.13389161128895477, -0.04994361115054095, -0.003946883306088676, -0.004649285252384431, -0.25820710776069855, 0.03669988305924775, 0.04719654344855324, 0.044160863628018306, -0.06702514321621894, -0.09906141780764348, -0.02345731538454337, 0.08467147976020956, -0.0013837896592842488, -0.04680768193982469, 0.14524012885068532, -0.12203140666877682, -0.07942074542115261, 0.41990134349794356, -0.01991765654657955, -0.1417993386641754, 0.21586891805508185, -0.18139859211068698, -0.09252548197665336, 0.16761113811502015, 0.20756263224492696, 0.07420092048849185, -0.12364138691465358, 0.06146295944209114, -0.0014996179455117166, 0.1854112104742558, 0.14113857173784214, 0.143755396350299, 0.2551897272419233, 0.20736093661300353, 0.012944916611712716, 0.11841948123802976, -0.12528883722495868, 0.0144513040152076, -0.19719628064497072, -0.09971540876779125, -0.1775546331357743, 0.08143330276076298, -0.07753964194787179, -0.1869139009784278, 0.3664386369735486, 0.10688104546423276, 0.1892370011343004, -0.05787731995035036, 0.28683043421433585, 0.10660850839589589, 0.12287786721203525, 0.013639510010502167, 0.3059052406100015, 0.13703270575376347, 0.10426475286374909, -0.20240473525535146, 0.07697075970324252, -0.03995887670430125] |
1,802.08601 | 8T SRAM Cell as a Multi-bit Dot Product Engine for Beyond von-Neumann
Computing | Large scale digital computing almost exclusively relies on the von-Neumann
architecture which comprises of separate units for storage and computations.
The energy expensive transfer of data from the memory units to the computing
cores results in the well-known von-Neumann bottleneck. Various approaches
aimed towards bypassing the von-Neumann bottleneck are being extensively
explored in the literature. Emerging non-volatile memristive technologies have
been shown to be very efficient in computing analog dot products in an in-situ
fashion. The memristive analog computation of the dot product results in much
faster operation as opposed to digital vector in-memory bit-wise Boolean
computations. However, challenges with respect to large scale manufacturing
coupled with the limited endurance of memristors have hindered rapid
commercialization of memristive based computing solutions. In this work, we
show that the standard 8 transistor (8T) digital SRAM array can be configured
as an analog-like in-memory multi-bit dot product engine. By applying
appropriate analog voltages to the read-ports of the 8T SRAM array, and sensing
the output current, an approximate analog-digital dot-product engine can be
implemented. We present two different configurations for enabling multi-bit dot
product computations in the 8T SRAM cell array, without modifying the standard
bit-cell structure. Since our proposal preserves the standard 8T-SRAM array
structure, it can be used as a storage element with standard read-write
instructions, and also as an on-demand analog-like dot product accelerator.
| cs.ET | large scale digital computing almost exclusively relies on the vonneumann architecture which comprises of separate units for storage and computations the energy expensive transfer of data from the memory units to the computing cores results in the wellknown vonneumann bottleneck various approaches aimed towards bypassing the vonneumann bottleneck are being extensively explored in the literature emerging nonvolatile memristive technologies have been shown to be very efficient in computing analog dot products in an insitu fashion the memristive analog computation of the dot product results in much faster operation as opposed to digital vector inmemory bitwise boolean computations however challenges with respect to large scale manufacturing coupled with the limited endurance of memristors have hindered rapid commercialization of memristive based computing solutions in this work we show that the standard 8 transistor 8t digital sram array can be configured as an analoglike inmemory multibit dot product engine by applying appropriate analog voltages to the readports of the 8t sram array and sensing the output current an approximate analogdigital dotproduct engine can be implemented we present two different configurations for enabling multibit dot product computations in the 8t sram cell array without modifying the standard bitcell structure since our proposal preserves the standard 8tsram array structure it can be used as a storage element with standard readwrite instructions and also as an ondemand analoglike dot product accelerator | [['large', 'scale', 'digital', 'computing', 'almost', 'exclusively', 'relies', 'on', 'the', 'vonneumann', 'architecture', 'which', 'comprises', 'of', 'separate', 'units', 'for', 'storage', 'and', 'computations', 'the', 'energy', 'expensive', 'transfer', 'of', 'data', 'from', 'the', 'memory', 'units', 'to', 'the', 'computing', 'cores', 'results', 'in', 'the', 'wellknown', 'vonneumann', 'bottleneck', 'various', 'approaches', 'aimed', 'towards', 'bypassing', 'the', 'vonneumann', 'bottleneck', 'are', 'being', 'extensively', 'explored', 'in', 'the', 'literature', 'emerging', 'nonvolatile', 'memristive', 'technologies', 'have', 'been', 'shown', 'to', 'be', 'very', 'efficient', 'in', 'computing', 'analog', 'dot', 'products', 'in', 'an', 'insitu', 'fashion', 'the', 'memristive', 'analog', 'computation', 'of', 'the', 'dot', 'product', 'results', 'in', 'much', 'faster', 'operation', 'as', 'opposed', 'to', 'digital', 'vector', 'inmemory', 'bitwise', 'boolean', 'computations', 'however', 'challenges', 'with', 'respect', 'to', 'large', 'scale', 'manufacturing', 'coupled', 'with', 'the', 'limited', 'endurance', 'of', 'memristors', 'have', 'hindered', 'rapid', 'commercialization', 'of', 'memristive', 'based', 'computing', 'solutions', 'in', 'this', 'work', 'we', 'show', 'that', 'the', 'standard', '8', 'transistor', '8t', 'digital', 'sram', 'array', 'can', 'be', 'configured', 'as', 'an', 'analoglike', 'inmemory', 'multibit', 'dot', 'product', 'engine', 'by', 'applying', 'appropriate', 'analog', 'voltages', 'to', 'the', 'readports', 'of', 'the', '8t', 'sram', 'array', 'and', 'sensing', 'the', 'output', 'current', 'an', 'approximate', 'analogdigital', 'dotproduct', 'engine', 'can', 'be', 'implemented', 'we', 'present', 'two', 'different', 'configurations', 'for', 'enabling', 'multibit', 'dot', 'product', 'computations', 'in', 'the', '8t', 'sram', 'cell', 'array', 'without', 'modifying', 'the', 'standard', 'bitcell', 'structure', 'since', 'our', 'proposal', 'preserves', 'the', 'standard', '8tsram', 'array', 'structure', 'it', 'can', 'be', 'used', 'as', 'a', 'storage', 'element', 'with', 'standard', 'readwrite', 'instructions', 'and', 'also', 'as', 'an', 'ondemand', 'analoglike', 'dot', 'product', 'accelerator']] | [-0.14249912922969088, 0.07618380023134025, 0.029934522174592422, -0.016497688531049166, -0.03469281408582869, -0.2017308430838491, 0.04834582184563047, 0.4032777282797421, -0.30983780044013515, -0.325038568376037, 0.14783311500434285, -0.22428180682388982, -0.11161134344093535, 0.2687894142576837, -0.08319495889098287, 0.09820236992258746, 0.07346370883772636, -0.026611607559528704, -0.06589109711792122, -0.2094243560605137, 0.21236509781934926, 0.1061623313711738, 0.36156226686613113, -0.01689262919207649, 0.08916650776518509, -0.05156057729671063, -0.0011819677727888465, -0.024729331135162496, -0.024107585388592596, 0.14434373586151228, 0.2821976561330024, 0.10651600592127825, 0.2477497387161428, -0.541698268218268, -0.1324858328910662, 0.08187023070556959, 0.16701074566604016, 0.09780735586641927, -0.07128017864332677, -0.2409056826150632, 0.12821016977761393, -0.2681461207323229, -0.02743679813847684, -0.09653209156759486, 8.748538439741005e-05, 0.03332712359229304, -0.24813150216013546, -0.034491656426899345, 0.02292295771457993, 0.027789260768373538, 0.010839300117138689, -0.12299799828932763, 0.055932625793764866, 0.10801244795590907, -0.07403437669874931, 0.03053096028019649, 0.2166653947531338, -0.10429857199097069, -0.18505974358308488, 0.3231281800518601, -0.019490666681458033, -0.16973521115692533, 0.1540067132325373, -0.06743275917026105, -0.10412991624996737, 0.08352401529581428, 0.14274775523766833, 0.050685201371445214, -0.17111599363590096, 0.11512135006387735, 0.0431942476026781, 0.18983842010939125, 0.06309274440371171, 0.10192797838936786, 0.20198134372539417, 0.2355112708802964, 0.05253519348775011, 0.18377888305343454, -0.07226034984748228, -0.1381175524858246, -0.19206598652935764, -0.20331437799341237, -0.226317072576667, 0.09129161903789888, -0.09097707507533266, -0.19211628637735434, 0.3401330982813159, 0.1521412217192486, 0.1401735029911186, 0.03475365467287751, 0.396629052572288, 0.10808273878206524, 0.23099556560879825, 0.09289351446643998, 0.16083657507981836, 0.11828576697158283, 0.18511746068923474, -0.1960424156555369, 0.04049180553405889, 0.011548983151311273] |
1,802.08602 | GAtor: A First Principles Genetic Algorithm for Molecular Crystal
Structure Prediction | We present the implementation of GAtor, a massively parallel, first
principles genetic algorithm (GA) for molecular crystal structure prediction.
GAtor is written in Python and currently interfaces with the FHI-aims code to
perform local optimizations and energy evaluations using dispersion-inclusive
density functional theory (DFT). GAtor offers a variety of fitness evaluation,
selection, crossover, and mutation schemes. Breeding operators designed
specifically for molecular crystals provide a balance between exploration and
exploitation. Evolutionary niching is implemented in GAtor by using machine
learning to cluster the dynamically updated population by structural similarity
and then employing a cluster-based fitness function. Evolutionary niching
promotes uniform sampling of the potential energy surface by evolving several
sub-populations, which helps overcome initial pool biases and selection biases
(genetic drift). The various settings offered by GAtor increase the likelihood
of locating numerous low-energy minima, including those located in
disconnected, hard to reach regions of the potential energy landscape. The best
structures generated are re-relaxed and re-ranked using a hierarchy of
increasingly accurate DFT functionals and dispersion methods. GAtor is applied
to a chemically diverse set of four past blind test targets, characterized by
different types of intermolecular interactions. The experimentally observed
structures and other low-energy structures are found for all four targets. In
particular, for Target II, 5-cyano-3-hydroxythiophene, the top ranked putative
crystal structure is a $Z^\prime$=2 structure with P$\bar{1}$ symmetry and a
scaffold packing motif, which has not been reported previously.
| cond-mat.mtrl-sci | we present the implementation of gator a massively parallel first principles genetic algorithm ga for molecular crystal structure prediction gator is written in python and currently interfaces with the fhiaims code to perform local optimizations and energy evaluations using dispersioninclusive density functional theory dft gator offers a variety of fitness evaluation selection crossover and mutation schemes breeding operators designed specifically for molecular crystals provide a balance between exploration and exploitation evolutionary niching is implemented in gator by using machine learning to cluster the dynamically updated population by structural similarity and then employing a clusterbased fitness function evolutionary niching promotes uniform sampling of the potential energy surface by evolving several subpopulations which helps overcome initial pool biases and selection biases genetic drift the various settings offered by gator increase the likelihood of locating numerous lowenergy minima including those located in disconnected hard to reach regions of the potential energy landscape the best structures generated are rerelaxed and reranked using a hierarchy of increasingly accurate dft functionals and dispersion methods gator is applied to a chemically diverse set of four past blind test targets characterized by different types of intermolecular interactions the experimentally observed structures and other lowenergy structures are found for all four targets in particular for target ii 5cyano3hydroxythiophene the top ranked putative crystal structure is a zprime2 structure with pbar1 symmetry and a scaffold packing motif which has not been reported previously | [['we', 'present', 'the', 'implementation', 'of', 'gator', 'a', 'massively', 'parallel', 'first', 'principles', 'genetic', 'algorithm', 'ga', 'for', 'molecular', 'crystal', 'structure', 'prediction', 'gator', 'is', 'written', 'in', 'python', 'and', 'currently', 'interfaces', 'with', 'the', 'fhiaims', 'code', 'to', 'perform', 'local', 'optimizations', 'and', 'energy', 'evaluations', 'using', 'dispersioninclusive', 'density', 'functional', 'theory', 'dft', 'gator', 'offers', 'a', 'variety', 'of', 'fitness', 'evaluation', 'selection', 'crossover', 'and', 'mutation', 'schemes', 'breeding', 'operators', 'designed', 'specifically', 'for', 'molecular', 'crystals', 'provide', 'a', 'balance', 'between', 'exploration', 'and', 'exploitation', 'evolutionary', 'niching', 'is', 'implemented', 'in', 'gator', 'by', 'using', 'machine', 'learning', 'to', 'cluster', 'the', 'dynamically', 'updated', 'population', 'by', 'structural', 'similarity', 'and', 'then', 'employing', 'a', 'clusterbased', 'fitness', 'function', 'evolutionary', 'niching', 'promotes', 'uniform', 'sampling', 'of', 'the', 'potential', 'energy', 'surface', 'by', 'evolving', 'several', 'subpopulations', 'which', 'helps', 'overcome', 'initial', 'pool', 'biases', 'and', 'selection', 'biases', 'genetic', 'drift', 'the', 'various', 'settings', 'offered', 'by', 'gator', 'increase', 'the', 'likelihood', 'of', 'locating', 'numerous', 'lowenergy', 'minima', 'including', 'those', 'located', 'in', 'disconnected', 'hard', 'to', 'reach', 'regions', 'of', 'the', 'potential', 'energy', 'landscape', 'the', 'best', 'structures', 'generated', 'are', 'rerelaxed', 'and', 'reranked', 'using', 'a', 'hierarchy', 'of', 'increasingly', 'accurate', 'dft', 'functionals', 'and', 'dispersion', 'methods', 'gator', 'is', 'applied', 'to', 'a', 'chemically', 'diverse', 'set', 'of', 'four', 'past', 'blind', 'test', 'targets', 'characterized', 'by', 'different', 'types', 'of', 'intermolecular', 'interactions', 'the', 'experimentally', 'observed', 'structures', 'and', 'other', 'lowenergy', 'structures', 'are', 'found', 'for', 'all', 'four', 'targets', 'in', 'particular', 'for', 'target', 'ii', '5cyano3hydroxythiophene', 'the', 'top', 'ranked', 'putative', 'crystal', 'structure', 'is', 'a', 'zprime2', 'structure', 'with', 'pbar1', 'symmetry', 'and', 'a', 'scaffold', 'packing', 'motif', 'which', 'has', 'not', 'been', 'reported', 'previously']] | [-0.08792058075183457, 0.08015390582301694, -0.09327967078766644, 0.09643439164628154, -0.07051630202679561, -0.15829189933391044, 0.08951191839827832, 0.42319462244277417, -0.26439333518805064, -0.35881254904316334, 0.03839600856476666, -0.2323969061364946, -0.14356308345272933, 0.15204185479846985, 0.02372465278426914, 0.06815797911511491, 0.05666749481865934, -0.04100453225660401, -0.031142546106560115, -0.24760473200231387, 0.2675895077878601, 0.09172691732705773, 0.3050621042513977, -0.001986777057628269, 0.0717318663193905, -0.01203273971180391, -0.03395971921475037, 0.04549751822430509, -0.1280984245549442, 0.14703343779142217, 0.2900008578491195, 0.14040927397917308, 0.2962570517151819, -0.4069190686730587, -0.21685959640460128, 0.05955285222229102, 0.1283071353867063, 0.1185404990516279, -0.10429434883965018, -0.26476798794515755, 0.07079554613548047, -0.15077211011793343, -0.08422974712195118, -0.11263412551185036, -0.01886927656140988, 0.06578525817578497, -0.25070526764054946, 0.056308223201852775, -0.05317990917550481, 0.09338531296133347, -0.07442444827984614, -0.18836581539362668, -0.03731892666040474, 0.10472855401508833, -0.01007489112570234, 0.04340191704838577, 0.1895928114364126, -0.10649424607703543, -0.1363288327418875, 0.3685774814013554, -0.013493193805460697, -0.17505671299820635, 0.2312941376383052, -0.06071622839669505, -0.1472308447614879, 0.1376189996873069, 0.15503599316478991, 0.09154381274002725, -0.20469110143122912, 0.0859668915742077, 0.040306467706155355, 0.16659650561683204, 0.06936591018153274, 0.0006244600922598139, 0.1868308111073692, 0.2039462028850761, 0.05026467318631425, 0.10378938380289701, -0.11344399205965759, -0.11950978799824319, -0.20263313644606135, -0.12177671269436478, -0.15691127215117298, -0.03623421858058504, -0.06709668349168446, -0.18208230508987427, 0.38892628979342786, 0.08391791987030403, 0.14372723288631634, 0.02510074233597033, 0.25437962347337895, 0.024334176974282497, 0.10133318083117837, 0.05238539465784055, 0.17848390764759287, 0.08786776447263749, 0.05748592204637016, -0.227698461712419, 0.10250655289843132, 0.042271324628761604] |
1,802.08603 | Towards Distributed OPF using ALADIN | The present paper discusses the application of the recently proposed
Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) method to
non-convex AC Optimal Power Flow Problems (OPF) in a distributed fashion. In
contrast to the often used Alternating Direction of Multipliers Method (ADMM),
ALADIN guarantees locally quadratic convergence for AC OPF. Numerical results
for 5 to 300 bus test cases indicate that ALADIN is able to outperform ADMM and
to reduce the number of iterations by about one order of magnitude. We compare
ALADIN to numerical results for ADMM documented in the literature. The improved
convergence speed comes at the cost of increasing the communication effort per
iteration. Therefore, we propose a variant of ALADIN that uses inexact Hessians
to reduce communication. Additionally, we provide a detailed comparison of
these ALADIN variants to ADMM from an algorithmic and communication
perspective. Moreover, we prove that ALADIN converges locally at quadratic rate
even for the relevant case of suboptimally solved local NLPs.
| cs.DC cs.SY | the present paper discusses the application of the recently proposed augmented lagrangian alternating direction inexact newton aladin method to nonconvex ac optimal power flow problems opf in a distributed fashion in contrast to the often used alternating direction of multipliers method admm aladin guarantees locally quadratic convergence for ac opf numerical results for 5 to 300 bus test cases indicate that aladin is able to outperform admm and to reduce the number of iterations by about one order of magnitude we compare aladin to numerical results for admm documented in the literature the improved convergence speed comes at the cost of increasing the communication effort per iteration therefore we propose a variant of aladin that uses inexact hessians to reduce communication additionally we provide a detailed comparison of these aladin variants to admm from an algorithmic and communication perspective moreover we prove that aladin converges locally at quadratic rate even for the relevant case of suboptimally solved local nlps | [['the', 'present', 'paper', 'discusses', 'the', 'application', 'of', 'the', 'recently', 'proposed', 'augmented', 'lagrangian', 'alternating', 'direction', 'inexact', 'newton', 'aladin', 'method', 'to', 'nonconvex', 'ac', 'optimal', 'power', 'flow', 'problems', 'opf', 'in', 'a', 'distributed', 'fashion', 'in', 'contrast', 'to', 'the', 'often', 'used', 'alternating', 'direction', 'of', 'multipliers', 'method', 'admm', 'aladin', 'guarantees', 'locally', 'quadratic', 'convergence', 'for', 'ac', 'opf', 'numerical', 'results', 'for', '5', 'to', '300', 'bus', 'test', 'cases', 'indicate', 'that', 'aladin', 'is', 'able', 'to', 'outperform', 'admm', 'and', 'to', 'reduce', 'the', 'number', 'of', 'iterations', 'by', 'about', 'one', 'order', 'of', 'magnitude', 'we', 'compare', 'aladin', 'to', 'numerical', 'results', 'for', 'admm', 'documented', 'in', 'the', 'literature', 'the', 'improved', 'convergence', 'speed', 'comes', 'at', 'the', 'cost', 'of', 'increasing', 'the', 'communication', 'effort', 'per', 'iteration', 'therefore', 'we', 'propose', 'a', 'variant', 'of', 'aladin', 'that', 'uses', 'inexact', 'hessians', 'to', 'reduce', 'communication', 'additionally', 'we', 'provide', 'a', 'detailed', 'comparison', 'of', 'these', 'aladin', 'variants', 'to', 'admm', 'from', 'an', 'algorithmic', 'and', 'communication', 'perspective', 'moreover', 'we', 'prove', 'that', 'aladin', 'converges', 'locally', 'at', 'quadratic', 'rate', 'even', 'for', 'the', 'relevant', 'case', 'of', 'suboptimally', 'solved', 'local', 'nlps']] | [-0.12317116994486899, -0.050988920055583864, -0.0750873400917593, 0.061189701222029734, -0.11018148820800414, -0.1795933270188482, 0.06096380912338577, 0.4119780729495504, -0.3284344024950369, -0.3015643439530951, 0.12375324507282004, -0.25636565542352274, -0.10068160496760488, 0.24094008511582496, -0.11228575340747458, 0.0972778561214606, 0.0985059878113826, -0.024934445295311546, -0.0897023467095891, -0.31577086345872507, 0.18158816674331776, 0.06661948974613312, 0.28419040879761837, 0.01034837277641274, 0.11449915873261649, 0.007718133522305965, -0.0113578228010509, 0.057133696794021804, -0.08414205257357471, 0.1483579726930731, 0.2960010231823994, 0.12362174936804522, 0.3341557435521493, -0.4429675529611373, -0.13136945021303617, 0.09429472051385157, 0.1906322498729675, 0.0680347136456121, -0.0803392728565132, -0.21569314682065457, 0.15637983504386982, -0.17045963908188372, -0.12874599299305733, -0.13079755915674446, -0.08946591187722443, 0.0712995579079637, -0.3194723204239535, 0.04727019971484061, 0.002853945979069473, 0.06513580557181493, -0.06385445741084682, -0.1461159337557993, 0.050066463286115685, 0.04642641130811388, 0.12995523243114562, 0.0709057005932086, 0.13653232676193774, -0.04006787679786355, -0.14380824567351794, 0.34678747572895113, -0.034246268186135416, -0.20675352368205083, 0.16547585053826278, -0.03908032619939098, -0.15714366649681666, 0.1367616660822675, 0.24648554549342366, 0.15435801912099123, -0.15050285792640122, 0.06385174369272548, -0.044090489281411724, 0.1513789547080139, 0.05921492529388681, -0.049574750248612194, 0.0289318154949648, 0.12973839613610297, 0.22612690481243058, 0.1724145465888121, -0.07416021704392613, -0.13968540486768358, -0.2601330861472671, -0.1325890243598172, -0.15204872471374115, -0.0580993594877047, -0.09582746140757699, -0.09183747376280152, 0.4118028087072871, 0.20909994530080417, 0.09996334983785667, 0.13543267529047792, 0.3843739666747597, 0.09496775107991255, 0.05032102004244174, 0.158431361385463, 0.2432847522292872, 0.11223351530314851, 0.16187386959791183, -0.256454584617812, 0.05168069400912467, 0.1328117424481601] |
1,802.08604 | Limiting gaming opportunities on incentive-based demand response
programs | Demand Response (DR) is a program designed to match supply and demand by
modifying consumption profile. Some of these programs are based on economic
incentives, in which, a user is paid to reduce his energy requirements
according to an estimated baseline. Literature review and practice have shown
that the counter-factual models of employing baselines are vulnerable for
gaming. Classical solutions of mechanism design require that agents communicate
their full types which result in greater difficulties for its practical
implementation. In this paper, a novel contract is developed to induce
individual rationality (voluntary participation) and asymptotic
incentive-compatibility (truthfulness) through probability of call, where an
agent does not require to report the marginal utility. In this approach, a
consumer only announces the baseline and reduction capacity, given a payment
scheme that includes cost of electricity, incentive price, and penalty caused
by any deviation between self-reported and actual energy consumption. The
aggregator decides randomly what users are called to perform the energy
reduction. As result, asymptotic truth-telling behavior in incentive-based DR
is managed by the aggregator through the probability of call for each agent.
Mathematical proofs and numerical studies are provided to demonstrate the
properties and advantages of this contract in limiting gaming opportunities and
in terms of its implementation.
| cs.GT | demand response dr is a program designed to match supply and demand by modifying consumption profile some of these programs are based on economic incentives in which a user is paid to reduce his energy requirements according to an estimated baseline literature review and practice have shown that the counterfactual models of employing baselines are vulnerable for gaming classical solutions of mechanism design require that agents communicate their full types which result in greater difficulties for its practical implementation in this paper a novel contract is developed to induce individual rationality voluntary participation and asymptotic incentivecompatibility truthfulness through probability of call where an agent does not require to report the marginal utility in this approach a consumer only announces the baseline and reduction capacity given a payment scheme that includes cost of electricity incentive price and penalty caused by any deviation between selfreported and actual energy consumption the aggregator decides randomly what users are called to perform the energy reduction as result asymptotic truthtelling behavior in incentivebased dr is managed by the aggregator through the probability of call for each agent mathematical proofs and numerical studies are provided to demonstrate the properties and advantages of this contract in limiting gaming opportunities and in terms of its implementation | [['demand', 'response', 'dr', 'is', 'a', 'program', 'designed', 'to', 'match', 'supply', 'and', 'demand', 'by', 'modifying', 'consumption', 'profile', 'some', 'of', 'these', 'programs', 'are', 'based', 'on', 'economic', 'incentives', 'in', 'which', 'a', 'user', 'is', 'paid', 'to', 'reduce', 'his', 'energy', 'requirements', 'according', 'to', 'an', 'estimated', 'baseline', 'literature', 'review', 'and', 'practice', 'have', 'shown', 'that', 'the', 'counterfactual', 'models', 'of', 'employing', 'baselines', 'are', 'vulnerable', 'for', 'gaming', 'classical', 'solutions', 'of', 'mechanism', 'design', 'require', 'that', 'agents', 'communicate', 'their', 'full', 'types', 'which', 'result', 'in', 'greater', 'difficulties', 'for', 'its', 'practical', 'implementation', 'in', 'this', 'paper', 'a', 'novel', 'contract', 'is', 'developed', 'to', 'induce', 'individual', 'rationality', 'voluntary', 'participation', 'and', 'asymptotic', 'incentivecompatibility', 'truthfulness', 'through', 'probability', 'of', 'call', 'where', 'an', 'agent', 'does', 'not', 'require', 'to', 'report', 'the', 'marginal', 'utility', 'in', 'this', 'approach', 'a', 'consumer', 'only', 'announces', 'the', 'baseline', 'and', 'reduction', 'capacity', 'given', 'a', 'payment', 'scheme', 'that', 'includes', 'cost', 'of', 'electricity', 'incentive', 'price', 'and', 'penalty', 'caused', 'by', 'any', 'deviation', 'between', 'selfreported', 'and', 'actual', 'energy', 'consumption', 'the', 'aggregator', 'decides', 'randomly', 'what', 'users', 'are', 'called', 'to', 'perform', 'the', 'energy', 'reduction', 'as', 'result', 'asymptotic', 'truthtelling', 'behavior', 'in', 'incentivebased', 'dr', 'is', 'managed', 'by', 'the', 'aggregator', 'through', 'the', 'probability', 'of', 'call', 'for', 'each', 'agent', 'mathematical', 'proofs', 'and', 'numerical', 'studies', 'are', 'provided', 'to', 'demonstrate', 'the', 'properties', 'and', 'advantages', 'of', 'this', 'contract', 'in', 'limiting', 'gaming', 'opportunities', 'and', 'in', 'terms', 'of', 'its', 'implementation']] | [-0.10137601854456228, 0.014128077653903686, -0.07996710416622424, 0.0712946646347426, -0.13936018575531778, -0.1985642078899495, 0.146549974975923, 0.40150351715746563, -0.2555841619895708, -0.31972393574382085, 0.11314347040769757, -0.27382090137844034, -0.14833447158197166, 0.1596390945782912, -0.16922004128567839, 0.02822767677863133, 0.04337947068573988, 0.036545445088630064, 0.013403130705628076, -0.2967742281169563, 0.2698981074007804, 0.10752081496704027, 0.3364056969704871, 0.065474316003116, 0.10040653436692153, 0.009167315905175851, -0.03849109372850688, -0.002524085614273768, -0.0916053301919854, 0.1260086082873623, 0.3116351788070601, 0.19472869546355112, 0.39117693412455096, -0.46218363043136784, -0.15093924723799534, 0.10056856185971683, 0.07694677173402971, 0.04311806673818416, -0.03843579380176872, -0.23465457716101898, 0.08460964836519895, -0.25821770226879825, -0.09288326617142474, -0.08966468496738532, -0.021042280504255047, 0.07554935698694401, -0.30700848977517897, -0.006364923391203229, 0.032966694175963096, 0.06089627585072376, -0.039709549913506795, -0.10361663711604276, -0.0310478075283719, 0.1490016281580865, 0.09841000823223073, -0.04787679229174619, 0.152526188734019, -0.14087165801353968, -0.1575419112470829, 0.38873286446295496, -0.004314678391286482, -0.20213822764794429, 0.1300485100324945, -0.05391225573980218, -0.09576864387662316, 0.10581844984407532, 0.19696755136709362, 0.06708542278468393, -0.18314011176600423, 0.043893893030843276, -0.008251238303879896, 0.16819600959798853, 0.04823851927041845, 0.04384407435390864, 0.17400138603820317, 0.16951934073642255, 0.1186408228254967, 0.08966904121410588, 0.0029201894843329987, -0.13733153761665962, -0.2641084332090515, -0.1525778082145405, -0.16965823554082948, 0.039092522474446736, -0.04005201337660791, -0.1080490254209622, 0.3650284407358325, 0.17930732960424697, 0.12493985648613405, 0.11608144172730492, 0.34467109080723485, 0.10342264044574341, 0.04702169503364262, 0.10039874655532016, 0.20198383561410302, -0.016934834563528785, 0.1460728686739317, -0.21353325412826893, 0.16984306781407635, 0.015728624662438382] |
1,802.08605 | A note on the discrete Cauchy-Kovalevskaya extension | In this paper we exploit the umbral calculus framework to reformulate the
so-called discrete Cauchy-Kovalevskaya extension in the scope of hypercomplex
variables. The key idea is to consider not only formal power series
representation for the underlying solution, but also integral representations
for the Chebyshev polynomials of first and second kind by means of its Cauchy
principal values. It turns out that the resulting integral representation
associated to our toy problem is a space-time Fourier type inversion formula.
Moreover, with the aid of some Laplace transform identities involving the
generalized Mittag-Leffler function we are able to establish a link with a
Cauchy problem of differential-difference type.
| math.CV math.AP math.CA | in this paper we exploit the umbral calculus framework to reformulate the socalled discrete cauchykovalevskaya extension in the scope of hypercomplex variables the key idea is to consider not only formal power series representation for the underlying solution but also integral representations for the chebyshev polynomials of first and second kind by means of its cauchy principal values it turns out that the resulting integral representation associated to our toy problem is a spacetime fourier type inversion formula moreover with the aid of some laplace transform identities involving the generalized mittagleffler function we are able to establish a link with a cauchy problem of differentialdifference type | [['in', 'this', 'paper', 'we', 'exploit', 'the', 'umbral', 'calculus', 'framework', 'to', 'reformulate', 'the', 'socalled', 'discrete', 'cauchykovalevskaya', 'extension', 'in', 'the', 'scope', 'of', 'hypercomplex', 'variables', 'the', 'key', 'idea', 'is', 'to', 'consider', 'not', 'only', 'formal', 'power', 'series', 'representation', 'for', 'the', 'underlying', 'solution', 'but', 'also', 'integral', 'representations', 'for', 'the', 'chebyshev', 'polynomials', 'of', 'first', 'and', 'second', 'kind', 'by', 'means', 'of', 'its', 'cauchy', 'principal', 'values', 'it', 'turns', 'out', 'that', 'the', 'resulting', 'integral', 'representation', 'associated', 'to', 'our', 'toy', 'problem', 'is', 'a', 'spacetime', 'fourier', 'type', 'inversion', 'formula', 'moreover', 'with', 'the', 'aid', 'of', 'some', 'laplace', 'transform', 'identities', 'involving', 'the', 'generalized', 'mittagleffler', 'function', 'we', 'are', 'able', 'to', 'establish', 'a', 'link', 'with', 'a', 'cauchy', 'problem', 'of', 'differentialdifference', 'type']] | [-0.1010810315561204, -0.008154334025984665, -0.12460480259625979, 0.11321718224767982, -0.1868945835158229, -0.0983221963012837, 0.004304538007588389, 0.30863723526972364, -0.3699999624898411, -0.2223354648658127, 0.15222670630999963, -0.22911840771272216, -0.23596412352866158, 0.18297775457437448, -0.08851502551741125, 0.06039542141263395, 0.023385982684799873, 0.0652141336193484, -0.11157896003536528, -0.2233824090821282, 0.37163713194851605, 0.0029395427631723854, 0.22918121635536048, -0.026046989402153862, 0.12316949892666121, 0.022132055315558077, -0.0867584662837029, -0.049074914499695574, -0.10404913304276152, 0.14373649491374996, 0.2636468471071841, 0.10142058364273805, 0.28312327763513784, -0.4188345240446616, -0.1660500684673986, 0.13331228420841243, 0.15680243590196488, 0.01721541030016148, -0.010992241447861746, -0.2837479169533219, 0.07133271398554328, -0.16344351887940164, -0.19239761027120897, -0.11319016001872578, -0.005937202534866783, 0.0386354626191534, -0.2693897432181984, 0.0724750041919387, 0.08882732300597401, 0.023727435811932356, -0.07990989808755364, -0.08209493342031426, 0.06883241764362023, 0.049766261648949026, 0.04758052093763221, -0.02538549927731027, 0.015592899024135099, -0.0870134769916921, -0.09787956182844937, 0.3545245113519003, -0.027289175307641755, -0.28962152249197354, 0.09110834476986092, -0.13260373373884918, -0.18939314114878764, 0.09140305222837992, 0.10664936258756327, 0.12613819509674357, -0.15341778407488368, 0.12867255694011032, -0.07714234744989366, 0.1252787551493384, 0.0898659852342153, -0.0025618343640399993, 0.1485306304387467, 0.07821356171504858, 0.05468853565706116, 0.18403420816966384, -0.04402143893190132, -0.13824133875445938, -0.37178575373166856, -0.234909873332758, -0.1980526799507404, 0.05927164349191545, -0.10783216421300752, -0.1892415859279627, 0.4140800357673247, 0.11074869226409509, 0.13924687897197832, 0.1189493442498991, 0.2338478787679155, 0.22111656141296065, 0.05558520946036673, 0.026898154343109368, 0.11528135394762086, 0.21639781797805555, 0.1290369211511581, -0.1730933616243694, 0.009490060035736774, 0.19356448346538083] |
1,802.08606 | Speed of gravitational waves and black hole hair | The recent detection of GRB 170817A and GW170817 constrains the speed of
gravity waves $c_T$ to be that of light, which severely restricts the landscape
of modified gravity theories that impact the cosmological evolution of the
universe. In this work, we investigate the presence of black hole hair in the
remaining viable cosmological theories of modified gravity that respect the
constraint $c_T=1$. We focus mainly on scalar-tensor theories of gravity,
analyzing static, asymptotically flat black holes in Horndeski, Beyond
Horndeski, Einstein-Scalar-Gauss-Bonnet, and Chern-Simons theories. We find
that in all of the cases considered here, theories that respect $c_T=1$ do not
allow for hair, or have negligible hair. We further comment on vector-tensor
theories including Einstein Yang-Mills, Einstein-Aether, and Generalised Proca
theories, as well as bimetric theories.
| gr-qc astro-ph.CO | the recent detection of grb 170817a and gw170817 constrains the speed of gravity waves c_t to be that of light which severely restricts the landscape of modified gravity theories that impact the cosmological evolution of the universe in this work we investigate the presence of black hole hair in the remaining viable cosmological theories of modified gravity that respect the constraint c_t1 we focus mainly on scalartensor theories of gravity analyzing static asymptotically flat black holes in horndeski beyond horndeski einsteinscalargaussbonnet and chernsimons theories we find that in all of the cases considered here theories that respect c_t1 do not allow for hair or have negligible hair we further comment on vectortensor theories including einstein yangmills einsteinaether and generalised proca theories as well as bimetric theories | [['the', 'recent', 'detection', 'of', 'grb', '170817a', 'and', 'gw170817', 'constrains', 'the', 'speed', 'of', 'gravity', 'waves', 'c_t', 'to', 'be', 'that', 'of', 'light', 'which', 'severely', 'restricts', 'the', 'landscape', 'of', 'modified', 'gravity', 'theories', 'that', 'impact', 'the', 'cosmological', 'evolution', 'of', 'the', 'universe', 'in', 'this', 'work', 'we', 'investigate', 'the', 'presence', 'of', 'black', 'hole', 'hair', 'in', 'the', 'remaining', 'viable', 'cosmological', 'theories', 'of', 'modified', 'gravity', 'that', 'respect', 'the', 'constraint', 'c_t1', 'we', 'focus', 'mainly', 'on', 'scalartensor', 'theories', 'of', 'gravity', 'analyzing', 'static', 'asymptotically', 'flat', 'black', 'holes', 'in', 'horndeski', 'beyond', 'horndeski', 'einsteinscalargaussbonnet', 'and', 'chernsimons', 'theories', 'we', 'find', 'that', 'in', 'all', 'of', 'the', 'cases', 'considered', 'here', 'theories', 'that', 'respect', 'c_t1', 'do', 'not', 'allow', 'for', 'hair', 'or', 'have', 'negligible', 'hair', 'we', 'further', 'comment', 'on', 'vectortensor', 'theories', 'including', 'einstein', 'yangmills', 'einsteinaether', 'and', 'generalised', 'proca', 'theories', 'as', 'well', 'as', 'bimetric', 'theories']] | [-0.16938001839517955, 0.13750027397662282, -0.05239607599593463, 0.1491764418305903, -0.14796661133582276, -0.18907229165502248, -0.04391464164539698, 0.26015328216673217, -0.10459948811192243, -0.2754910122677093, 0.05571828975844833, -0.26643996463999864, -0.18001752100434035, 0.13648091816797941, -0.08751930375139982, 0.016116004215464705, -0.03808424182029234, 0.04918545367203594, -0.10304479323704505, -0.2780141500129719, 0.3814127852711531, 0.10028275453470765, 0.2019746907132526, 0.017378094691103175, 0.08883396238236436, -0.025721142345684626, 0.007419418595317338, 0.08788161837812714, -0.17520140639155418, 0.03950438415169686, 0.1699932043788038, 0.1808104911811709, 0.16917254590976333, -0.4515443543001773, -0.3446604191650829, 0.09825250410866583, 0.16241403859448694, 0.1680305263143964, -0.04724864020670158, -0.2972553612235638, 0.0409749531268423, -0.25106504640822846, -0.1252458189052367, -0.04165668145287782, 0.017301428456982924, -0.05486566579848942, -0.1430780978888155, 0.14964218751808245, 0.007526950929628034, -0.08019515600735469, -0.11429566229944901, -0.019896444036728807, -0.05753879068190202, 0.012084726105621528, 0.2098617167170492, 0.05312271296815385, 0.14918263128677767, -0.21444862560435599, -0.12321793819437661, 0.4334449673160201, -0.15340400617274028, -0.20283195695706777, 0.1565570727966371, -0.2226449430269736, -0.23387947997137432, 0.008139120651379464, 0.1403640506766914, 0.23466621256167336, -0.10825298101242099, 0.20860624166126068, 0.02156651293533662, 0.16016550168823745, 0.14633785409202416, 0.10771748986065624, 0.4095024419209314, 0.07484567100052825, -0.0005892277260990961, 0.06458995684090676, -0.001970852573683101, -0.08831743301365465, -0.3868063896347488, -0.12622449504921124, -0.06690890900143939, 0.07577920578513017, -0.18252600346184206, -0.196924460363493, 0.3202299895504164, 0.1920452245209913, 0.02925564686671668, 0.11322035635396513, 0.17486182791851337, 0.04255048891285523, 0.0615213549481557, 0.03886432591602825, 0.40375012926903314, 0.1625784526446036, 0.09632659059328337, -0.245436477103448, -0.09732273581256676, 0.07451206135253112] |
1,802.08607 | Photon Statistics in Collective Strong Coupling: Nano- and Microcavities | There exists a growing interest in the properties of the light generated by
hybrid systems involving a mesoscopic number of emitters as a means of
providing macroscopic quantum light sources. In this work, the quantum
correlations of the light emitted by a collection of emitters coupled to a
generic optical cavity are studied theoretically using an effective Hamiltonian
approach. Starting from the single-emitter level, we analyse the persistence of
photon antibunching as the ensemble size increases. Not only is the photon
blockade effect identifiable, but photon antibunching originated from
destructive interference processes (the so-called unconventional antibunching)
is also present. We study the dependence of these two types of negative
correlations on the spectral detuning between cavity and emitters, as well as
its evolution as the time delay between photon detections increases. Throughout
this work, the performance of plasmonic nanocavities and dielectric
microcavities is compared: despite the distinct energy scales and the
differences introduced by their respectively open and closed character, the
bunching and antibunching phenomenology presents remarkable similarities in
both types of cavities.
| cond-mat.mes-hall | there exists a growing interest in the properties of the light generated by hybrid systems involving a mesoscopic number of emitters as a means of providing macroscopic quantum light sources in this work the quantum correlations of the light emitted by a collection of emitters coupled to a generic optical cavity are studied theoretically using an effective hamiltonian approach starting from the singleemitter level we analyse the persistence of photon antibunching as the ensemble size increases not only is the photon blockade effect identifiable but photon antibunching originated from destructive interference processes the socalled unconventional antibunching is also present we study the dependence of these two types of negative correlations on the spectral detuning between cavity and emitters as well as its evolution as the time delay between photon detections increases throughout this work the performance of plasmonic nanocavities and dielectric microcavities is compared despite the distinct energy scales and the differences introduced by their respectively open and closed character the bunching and antibunching phenomenology presents remarkable similarities in both types of cavities | [['there', 'exists', 'a', 'growing', 'interest', 'in', 'the', 'properties', 'of', 'the', 'light', 'generated', 'by', 'hybrid', 'systems', 'involving', 'a', 'mesoscopic', 'number', 'of', 'emitters', 'as', 'a', 'means', 'of', 'providing', 'macroscopic', 'quantum', 'light', 'sources', 'in', 'this', 'work', 'the', 'quantum', 'correlations', 'of', 'the', 'light', 'emitted', 'by', 'a', 'collection', 'of', 'emitters', 'coupled', 'to', 'a', 'generic', 'optical', 'cavity', 'are', 'studied', 'theoretically', 'using', 'an', 'effective', 'hamiltonian', 'approach', 'starting', 'from', 'the', 'singleemitter', 'level', 'we', 'analyse', 'the', 'persistence', 'of', 'photon', 'antibunching', 'as', 'the', 'ensemble', 'size', 'increases', 'not', 'only', 'is', 'the', 'photon', 'blockade', 'effect', 'identifiable', 'but', 'photon', 'antibunching', 'originated', 'from', 'destructive', 'interference', 'processes', 'the', 'socalled', 'unconventional', 'antibunching', 'is', 'also', 'present', 'we', 'study', 'the', 'dependence', 'of', 'these', 'two', 'types', 'of', 'negative', 'correlations', 'on', 'the', 'spectral', 'detuning', 'between', 'cavity', 'and', 'emitters', 'as', 'well', 'as', 'its', 'evolution', 'as', 'the', 'time', 'delay', 'between', 'photon', 'detections', 'increases', 'throughout', 'this', 'work', 'the', 'performance', 'of', 'plasmonic', 'nanocavities', 'and', 'dielectric', 'microcavities', 'is', 'compared', 'despite', 'the', 'distinct', 'energy', 'scales', 'and', 'the', 'differences', 'introduced', 'by', 'their', 'respectively', 'open', 'and', 'closed', 'character', 'the', 'bunching', 'and', 'antibunching', 'phenomenology', 'presents', 'remarkable', 'similarities', 'in', 'both', 'types', 'of', 'cavities']] | [-0.1635116462717223, 0.2065673853881217, -0.07047404652741344, 0.07392094947190449, 0.006062651688308385, -0.1542384925976697, 0.04741113952958601, 0.4104324707859317, -0.2288339423780152, -0.3137327061570384, -0.013229606193328825, -0.33478418986361497, -0.12826749289440625, 0.2216888141516876, 0.002656023795958716, 0.044288362720590946, 0.019254413072687354, -0.02476779093718253, -0.01778542058746939, -0.17241688717608852, 0.3085707309776971, 0.05207001014257313, 0.3018834218880797, 0.07959887949006923, 0.11323715136130744, 0.006364784188665493, 0.0204004441748637, 0.006925748087158911, -0.060009347439260424, 0.08823102252353306, 0.2233079298644332, 0.04269124658756776, 0.2679195134776693, -0.3863175747690001, -0.21462832005308252, 0.09423333727297066, 0.1847174945179739, 0.12907885475288752, -0.08956598379915699, -0.2948673913333393, -0.02528510511868951, -0.1277804700861284, -0.11467778121963725, -0.011424345244260538, -0.0015995083645933626, 0.04408254472382711, -0.1828150061319846, 0.08957536131543285, 0.05076326595718913, 0.07259914170778384, 0.02473187901690667, -0.03529179154631461, -0.010159289995962054, 0.10015202407601338, 0.012817387852677806, -0.048691873519911534, 0.1561141794418238, -0.15687064115883986, -0.16046898320823305, 0.3566841786684242, -0.08081303499208364, -0.1333467343094021, 0.19030575720577184, -0.1475113136491959, -0.057480037098311725, 0.1530231398024268, 0.15087401907288098, 0.09613197044781652, -0.12917636925989837, 0.04126558649976808, -0.007939539822841311, 0.20718996420252336, 0.09157227528566829, 0.19679021564543764, 0.2292935305956019, 0.17701937642616, -0.02051104533599119, 0.19250579681846372, -0.09216106762016742, -0.08487508703706884, -0.29630902293272793, -0.14175527027607598, -0.21239957382708702, 0.07907468582057015, -0.0757321835446913, -0.16193905906082867, 0.41418060610566093, 0.12830826461939626, 0.18506082030809942, 0.00686799069850388, 0.2972781616215987, 0.14566468109304054, 0.05773208534877984, 0.0007230944761931035, 0.3041801363353569, 0.17417325874833617, 0.07728732579705343, -0.2928614518107211, 0.03293113998605767, -0.044082957793651636] |
1,802.08608 | Tubulation pattern of membrane vesicles coated with bio filaments | Narrow membrane tubes are commonly pulled out from the surface of
phospholipid vesicles using forces applied either through laser or magnetic
tweezers or through the action of processive motor proteins. Recent examples
have emerged where such tubes spontaneously grow from vesicles coated with
bioactive cytoskeletal filaments (e.g. FtsZ, microtubule) in the presence GTP.
We show how a soft vesicle deforms due to the interplay between its topology,
local curvature and the forces due to the active filaments. We present results
from Dynamically Triangulated Monte Carlo simulations of a spherical continuum
membrane coated with a nematic field and show how the intrinsic curvature of
the filaments and their ordering interactions drive membrane tubulation. We
predict interesting patterns of nematic defects, on curved 2D membrane
surfaces, which promote tube formation. Implication of our model for more
dynamic cases where vesicles coated with an active mixture of microtubule and
myosin show shape oscillation, are also discussed. All these cases point to a
common theme that defect locations on 2D membrane surfaces are hot spots of
membrane deformation activity.
| physics.bio-ph cond-mat.soft | narrow membrane tubes are commonly pulled out from the surface of phospholipid vesicles using forces applied either through laser or magnetic tweezers or through the action of processive motor proteins recent examples have emerged where such tubes spontaneously grow from vesicles coated with bioactive cytoskeletal filaments eg ftsz microtubule in the presence gtp we show how a soft vesicle deforms due to the interplay between its topology local curvature and the forces due to the active filaments we present results from dynamically triangulated monte carlo simulations of a spherical continuum membrane coated with a nematic field and show how the intrinsic curvature of the filaments and their ordering interactions drive membrane tubulation we predict interesting patterns of nematic defects on curved 2d membrane surfaces which promote tube formation implication of our model for more dynamic cases where vesicles coated with an active mixture of microtubule and myosin show shape oscillation are also discussed all these cases point to a common theme that defect locations on 2d membrane surfaces are hot spots of membrane deformation activity | [['narrow', 'membrane', 'tubes', 'are', 'commonly', 'pulled', 'out', 'from', 'the', 'surface', 'of', 'phospholipid', 'vesicles', 'using', 'forces', 'applied', 'either', 'through', 'laser', 'or', 'magnetic', 'tweezers', 'or', 'through', 'the', 'action', 'of', 'processive', 'motor', 'proteins', 'recent', 'examples', 'have', 'emerged', 'where', 'such', 'tubes', 'spontaneously', 'grow', 'from', 'vesicles', 'coated', 'with', 'bioactive', 'cytoskeletal', 'filaments', 'eg', 'ftsz', 'microtubule', 'in', 'the', 'presence', 'gtp', 'we', 'show', 'how', 'a', 'soft', 'vesicle', 'deforms', 'due', 'to', 'the', 'interplay', 'between', 'its', 'topology', 'local', 'curvature', 'and', 'the', 'forces', 'due', 'to', 'the', 'active', 'filaments', 'we', 'present', 'results', 'from', 'dynamically', 'triangulated', 'monte', 'carlo', 'simulations', 'of', 'a', 'spherical', 'continuum', 'membrane', 'coated', 'with', 'a', 'nematic', 'field', 'and', 'show', 'how', 'the', 'intrinsic', 'curvature', 'of', 'the', 'filaments', 'and', 'their', 'ordering', 'interactions', 'drive', 'membrane', 'tubulation', 'we', 'predict', 'interesting', 'patterns', 'of', 'nematic', 'defects', 'on', 'curved', '2d', 'membrane', 'surfaces', 'which', 'promote', 'tube', 'formation', 'implication', 'of', 'our', 'model', 'for', 'more', 'dynamic', 'cases', 'where', 'vesicles', 'coated', 'with', 'an', 'active', 'mixture', 'of', 'microtubule', 'and', 'myosin', 'show', 'shape', 'oscillation', 'are', 'also', 'discussed', 'all', 'these', 'cases', 'point', 'to', 'a', 'common', 'theme', 'that', 'defect', 'locations', 'on', '2d', 'membrane', 'surfaces', 'are', 'hot', 'spots', 'of', 'membrane', 'deformation', 'activity']] | [-0.12046029315662703, 0.2124207026572133, -0.03197742305330134, 0.006638570610167724, -0.03980341360239046, -0.15657256642356515, -0.007407796919079763, 0.4568675486849887, -0.27378249094422374, -0.2514646638555652, 0.03169474527971553, -0.26765760139429146, -0.24852870461397938, 0.12570290517727178, -0.0418239512297857, -0.018148412954927022, 0.019984551452632462, -0.038257769205852776, 0.05920433260009823, -0.155721536369196, 0.24251538311530438, 0.03464776574234877, 0.2966428366210312, 0.060402598894600354, 0.09187662528827786, -0.04517923875578812, 0.05920423856537257, 0.05681775394442541, -0.20578818207760508, 0.1179126643775297, 0.1871821401840342, -0.05215572865546814, 0.1856912747052099, -0.5931438039456095, -0.2659543984170471, 0.05684337665859077, 0.17531194828874763, 0.13011555132256555, -0.07460510275833908, -0.27207797319761345, 0.039204518103173804, -0.12174665262124368, -0.12841197941053126, -0.05384743460054908, 0.00510949110213135, 0.11222962365884866, -0.1813179724769933, 0.11763998140032136, 0.05387436269649438, 0.09486712093132416, -0.11164051070875887, -0.07165279987900118, -0.1195913157758436, 0.12980401394423097, 0.12048472991080156, 0.02585266370858465, 0.36577935710549353, -0.16491422903091008, -0.07528705302625895, 0.35438919310058864, 0.013651824226336819, -0.20375082531278688, 0.2254506377463362, -0.11668327459799392, -0.08343251375215394, 0.19590104497836106, 0.15329481439931053, 0.11536617216654121, -0.09599731757488501, -0.0024791107685970407, -0.024061729087095175, 0.17579651843839592, 0.1202372683824173, -0.07765545375112977, 0.3122588030089225, 0.20644690308320734, 0.025413831642695835, 0.18583181077547903, -0.12915533512198765, -0.11186812346801162, -0.24483023643759744, -0.13903857060841152, -0.11391430015609201, 0.03592091660680515, -0.08390974937239662, -0.2275578908994794, 0.3258661559596658, 0.04193773574328848, 0.19563493675419263, 0.018057360024540683, 0.23246178730091613, -0.08647143413645349, 0.10741850021295249, 0.010079449765118105, 0.240580312764006, 0.15355240629985928, 0.08205597447497504, -0.2532836562315268, 0.013607246759513926, 0.05267437305966658] |
1,802.08609 | Nonlocal orbital magnetism of 3d adatoms deposited on the Pt(111)
surface | The orbital magnetic moment is still surprisingly not well understood, in
contrast to the spin part. Its description in finite systems, such as isolated
atoms and molecules, is not problematic, but it was only recently that a
rigorous picture was provided for extended systems. Here we focus on an
intermediate class of systems: magnetic adatoms placed on a non-magnetic
surface. We show that the essential quantity is the ground-state charge current
density, in the presence of spin-orbit coupling, and set out its
first-principles description. This is illustrated by studying the magnetism of
the surface Pt electrons, induced by the presence of Cr, Mn, Fe, Co and Ni
adatoms. A physically appealing partition of the charge current is introduced.
This reveals that there is an important nonlocal contribution to the orbital
moments of the Pt atoms, extending three times as far from each magnetic adatom
as the induced spin and local orbital moments. We find that it is as sizable as
the latter, and attribute its origin to a spin-orbital susceptibility of the Pt
surface, different from the one responsible for the formation of the local
orbital moments.
| cond-mat.mes-hall | the orbital magnetic moment is still surprisingly not well understood in contrast to the spin part its description in finite systems such as isolated atoms and molecules is not problematic but it was only recently that a rigorous picture was provided for extended systems here we focus on an intermediate class of systems magnetic adatoms placed on a nonmagnetic surface we show that the essential quantity is the groundstate charge current density in the presence of spinorbit coupling and set out its firstprinciples description this is illustrated by studying the magnetism of the surface pt electrons induced by the presence of cr mn fe co and ni adatoms a physically appealing partition of the charge current is introduced this reveals that there is an important nonlocal contribution to the orbital moments of the pt atoms extending three times as far from each magnetic adatom as the induced spin and local orbital moments we find that it is as sizable as the latter and attribute its origin to a spinorbital susceptibility of the pt surface different from the one responsible for the formation of the local orbital moments | [['the', 'orbital', 'magnetic', 'moment', 'is', 'still', 'surprisingly', 'not', 'well', 'understood', 'in', 'contrast', 'to', 'the', 'spin', 'part', 'its', 'description', 'in', 'finite', 'systems', 'such', 'as', 'isolated', 'atoms', 'and', 'molecules', 'is', 'not', 'problematic', 'but', 'it', 'was', 'only', 'recently', 'that', 'a', 'rigorous', 'picture', 'was', 'provided', 'for', 'extended', 'systems', 'here', 'we', 'focus', 'on', 'an', 'intermediate', 'class', 'of', 'systems', 'magnetic', 'adatoms', 'placed', 'on', 'a', 'nonmagnetic', 'surface', 'we', 'show', 'that', 'the', 'essential', 'quantity', 'is', 'the', 'groundstate', 'charge', 'current', 'density', 'in', 'the', 'presence', 'of', 'spinorbit', 'coupling', 'and', 'set', 'out', 'its', 'firstprinciples', 'description', 'this', 'is', 'illustrated', 'by', 'studying', 'the', 'magnetism', 'of', 'the', 'surface', 'pt', 'electrons', 'induced', 'by', 'the', 'presence', 'of', 'cr', 'mn', 'fe', 'co', 'and', 'ni', 'adatoms', 'a', 'physically', 'appealing', 'partition', 'of', 'the', 'charge', 'current', 'is', 'introduced', 'this', 'reveals', 'that', 'there', 'is', 'an', 'important', 'nonlocal', 'contribution', 'to', 'the', 'orbital', 'moments', 'of', 'the', 'pt', 'atoms', 'extending', 'three', 'times', 'as', 'far', 'from', 'each', 'magnetic', 'adatom', 'as', 'the', 'induced', 'spin', 'and', 'local', 'orbital', 'moments', 'we', 'find', 'that', 'it', 'is', 'as', 'sizable', 'as', 'the', 'latter', 'and', 'attribute', 'its', 'origin', 'to', 'a', 'spinorbital', 'susceptibility', 'of', 'the', 'pt', 'surface', 'different', 'from', 'the', 'one', 'responsible', 'for', 'the', 'formation', 'of', 'the', 'local', 'orbital', 'moments']] | [-0.15798965139678098, 0.1429193682912899, -0.006986414276581397, 0.08461612284763712, -0.01715225112290784, -0.09257031313547077, 0.048590376934865835, 0.36863411165136384, -0.24742212887594406, -0.29818747189135, 0.019502982045872447, -0.29179714437833126, -0.118660428289842, 0.1484716139247586, 0.041910997141192466, -0.036038222128493, -0.018103497627036856, 0.014660290477269473, -0.09290835201829911, -0.21247432386393056, 0.30404352353397696, 0.05098285958828295, 0.23357874986386912, 0.1165858867751275, 0.0523770795139001, 0.011739858274253454, 0.07447618517008694, 0.05198675798834924, -0.09408859468770542, 0.09561621267778082, 0.20339417400804752, -0.011835328338139835, 0.19692528755578367, -0.4506426421616645, -0.18932719107276516, 0.040208408641404805, 0.12423330858346066, 0.16724557866327425, -0.07956876592675752, -0.26444218176252704, 0.0540236054725427, -0.15173212676881787, -0.14755451548993986, -0.09685041297807354, 0.053109537358121836, 0.008674562059561996, -0.24876977563437253, 0.08187946347509795, 0.13840326668185998, 0.091160421553541, -0.08409054194923171, -0.13570990157438154, -0.13162160172988785, 0.07748925788228445, 0.08489876849213267, 0.07109150141328174, 0.1503295948788683, -0.08767422567025814, -0.07990157233680634, 0.38861182854475984, -0.04303190951673862, -0.14918402346588153, 0.1996704733315457, -0.18129137344471613, -0.10445564657071217, 0.1400264338117073, 0.08563974495469169, 0.14627308214212803, -0.16265837957255821, 0.10189214826251485, -0.031856593003721886, 0.17108449420236788, 0.0011677804769061626, 0.0757952213964679, 0.2769837037455988, 0.173276024402423, 0.08283602712781139, 0.11239027730961215, -0.13196100188010834, -0.07234440851373906, -0.24361324029411863, -0.17617133652659403, -0.269514826206082, 0.07682885508003824, -0.0353689945540559, -0.1642349496618272, 0.39274670229477676, 0.13134500872403543, 0.19950895166873714, -0.08859847182094215, 0.2675786565473791, 0.12083777172323179, 0.0692787314715352, 0.0340741029679078, 0.24903390050820887, 0.17690665865277144, 0.09266937217167155, -0.2826147523041277, 0.10890450766795678, 0.04725450450021594] |
1,802.0861 | Revisiting the Magnetic Structure and Charge Ordering in
La$_{1/3}$Sr$_{2/3}$FeO$_3$ by Neutron Powder Diffraction and M\"ossbauer
Spectroscopy | The magnetic ordering of La$_{1/3}$Sr$_{2/3}$FeO$_3$ perovskite has been
studied by neutron powder diffraction and $^{57}$Fe M\"ossbauer spectroscopy
down to 2 K. From symmetry analysis, a chiral helical model and a collinear
model are proposed to describe the magnetic structure. Both are commensurate,
with propagation vector k = (0,0,1) in R-3c space group. In the former model,
the magnetic moments of Fe adopt the magnetic space group P3$_{2}$21 and have
helical and antiferromagnetic ordering propagating along the c axis. The model
allows only one Fe site, with a magnetic moment of 3.46(2) $\mu_{\rm{B}}$ at 2
K. In the latter model, the magnetic moments of iron ions adopt the magnetic
space group C2/c or C2'/c' and are aligned collinearly. The model allows the
presence of two inequivalent Fe sites with magnetic moments of amplitude
3.26(3) $\mu_{\rm{B}}$ and 3.67(2) $\mu_{\rm{B}}$, respectively. The neutron
diffraction pattern is equally well fitted by either model. The M\"ossbauer
spectroscopy study suggests a single charge state Fe$^{3.66+}$ above the
magnetic transition and a charge disproportionation into Fe$^{(3.66-\zeta)+}$
and Fe$^{(3.66+2\zeta)+}$ below the magnetic transition. The compatibility of
the magnetic structure models with the M\"ossbauer spectroscopy results is
discussed.
| cond-mat.mtrl-sci | the magnetic ordering of la_13sr_23feo_3 perovskite has been studied by neutron powder diffraction and 57fe mossbauer spectroscopy down to 2 k from symmetry analysis a chiral helical model and a collinear model are proposed to describe the magnetic structure both are commensurate with propagation vector k 001 in r3c space group in the former model the magnetic moments of fe adopt the magnetic space group p3_221 and have helical and antiferromagnetic ordering propagating along the c axis the model allows only one fe site with a magnetic moment of 3462 mu_rmb at 2 k in the latter model the magnetic moments of iron ions adopt the magnetic space group c2c or c2c and are aligned collinearly the model allows the presence of two inequivalent fe sites with magnetic moments of amplitude 3263 mu_rmb and 3672 mu_rmb respectively the neutron diffraction pattern is equally well fitted by either model the mossbauer spectroscopy study suggests a single charge state fe366 above the magnetic transition and a charge disproportionation into fe366zeta and fe3662zeta below the magnetic transition the compatibility of the magnetic structure models with the mossbauer spectroscopy results is discussed | [['the', 'magnetic', 'ordering', 'of', 'la_13sr_23feo_3', 'perovskite', 'has', 'been', 'studied', 'by', 'neutron', 'powder', 'diffraction', 'and', '57fe', 'mossbauer', 'spectroscopy', 'down', 'to', '2', 'k', 'from', 'symmetry', 'analysis', 'a', 'chiral', 'helical', 'model', 'and', 'a', 'collinear', 'model', 'are', 'proposed', 'to', 'describe', 'the', 'magnetic', 'structure', 'both', 'are', 'commensurate', 'with', 'propagation', 'vector', 'k', '001', 'in', 'r3c', 'space', 'group', 'in', 'the', 'former', 'model', 'the', 'magnetic', 'moments', 'of', 'fe', 'adopt', 'the', 'magnetic', 'space', 'group', 'p3_221', 'and', 'have', 'helical', 'and', 'antiferromagnetic', 'ordering', 'propagating', 'along', 'the', 'c', 'axis', 'the', 'model', 'allows', 'only', 'one', 'fe', 'site', 'with', 'a', 'magnetic', 'moment', 'of', '3462', 'mu_rmb', 'at', '2', 'k', 'in', 'the', 'latter', 'model', 'the', 'magnetic', 'moments', 'of', 'iron', 'ions', 'adopt', 'the', 'magnetic', 'space', 'group', 'c2c', 'or', 'c2c', 'and', 'are', 'aligned', 'collinearly', 'the', 'model', 'allows', 'the', 'presence', 'of', 'two', 'inequivalent', 'fe', 'sites', 'with', 'magnetic', 'moments', 'of', 'amplitude', '3263', 'mu_rmb', 'and', '3672', 'mu_rmb', 'respectively', 'the', 'neutron', 'diffraction', 'pattern', 'is', 'equally', 'well', 'fitted', 'by', 'either', 'model', 'the', 'mossbauer', 'spectroscopy', 'study', 'suggests', 'a', 'single', 'charge', 'state', 'fe366', 'above', 'the', 'magnetic', 'transition', 'and', 'a', 'charge', 'disproportionation', 'into', 'fe366zeta', 'and', 'fe3662zeta', 'below', 'the', 'magnetic', 'transition', 'the', 'compatibility', 'of', 'the', 'magnetic', 'structure', 'models', 'with', 'the', 'mossbauer', 'spectroscopy', 'results', 'is', 'discussed']] | [-0.16044445745646954, 0.24184113821341982, 0.013392148728205546, 0.024529515464815337, -0.06132530529505095, -0.10685214589450609, 0.06982095780864207, 0.44389153811577203, -0.25793302530875883, -0.32162361180258764, 0.016677934797858264, -0.34024276074188814, -0.02843147917159808, 0.10635302369860379, 0.1468867764455845, -0.052000954498008296, -0.05643967914999135, 0.06095147844202615, -0.1189852839814046, -0.153186383545147, 0.2669122765356725, 0.028449079803367323, 0.3037283865042736, 0.027823943286706267, 0.03947135585838476, 0.01820921761462012, 0.1024696751271148, 0.0188299153800865, -0.09762586798468555, 0.038527518361602356, 0.1827668009737445, -0.032668518157977916, 0.1364277026616037, -0.41938292047864684, -0.20641484279216998, 0.0030600464953159964, 0.12319339686702635, 0.08021777018501952, -0.05842427629710024, -0.28624711074690157, 0.0743555410944454, -0.1103198247936529, -0.1387487580361021, -0.12449911022810517, -0.06110726916105361, 0.013286219719747031, -0.26866519371412595, 0.09226330954933891, 0.08666617121434192, 0.1422456011830552, -0.17591074453729733, -0.1455778560525662, -0.09944353947994879, 0.02835718312653134, 0.08841576932967213, 0.12600540911803979, 0.12665259497605164, -0.05408229021374388, -0.1290606588930697, 0.3786284287837712, -0.01955457294322047, -0.056153857129047045, 0.09870169495005865, -0.25623803786332466, -0.11389719660117013, 0.20675957537684087, 0.0893314408415274, 0.13538419286267378, -0.1163859245977742, 0.09206798165105283, -0.03887790580456321, 0.1932196152667087, 0.027667638776521827, -0.009488828753977007, 0.25811316285886476, 0.16495584435760974, -0.010988669196848532, 0.11845636145413123, -0.18722274404371508, -0.03598292773035733, -0.19972477941899686, -0.14635193215783787, -0.14062336822216576, 0.01739718873821501, -0.09492549328825663, -0.16440666866161532, 0.35902375701965916, 0.10260506504391496, 0.16791139600949512, -0.10737263869141807, 0.2772097805867324, 0.035655858338105716, 0.0582925023221587, 0.031365193843816384, 0.21730559692541893, 0.2571271345812223, 0.13656311857866477, -0.28075521826567884, 0.0757577443646418, 0.047485171357874535] |
1,802.08611 | An investigation of the classifiers to detect android malicious apps | Android devices are growing exponentially and are connected through the
internet accessing billion of online websites. The popularity of these devices
encourages malware developer to penetrate the market with malicious apps to
annoy and disrupt the victim. Although, for the detection of malicious apps
different approaches are discussed. However, proposed approaches are not
suffice to detect the advanced malware to limit/prevent the damages. In this,
very few approaches are based on opcode occurrence to classify the malicious
apps. Therefore, this paper investigates the five classifiers using opcodes
occurrence as the prominent features for the detection of malicious apps. For
the analysis, we use WEKA tool and found that FT detection accuracy (79.27%) is
best among the investigated classifiers. However, true positives rate i.e.
malware detection rate is highest (99.91%) by RF and fluctuate least with the
different number of prominent features compared to other studied classifiers.
The analysis shows that overall accuracy is majorly affected by the false
positives of the classifier.
| cs.CR cs.AI | android devices are growing exponentially and are connected through the internet accessing billion of online websites the popularity of these devices encourages malware developer to penetrate the market with malicious apps to annoy and disrupt the victim although for the detection of malicious apps different approaches are discussed however proposed approaches are not suffice to detect the advanced malware to limitprevent the damages in this very few approaches are based on opcode occurrence to classify the malicious apps therefore this paper investigates the five classifiers using opcodes occurrence as the prominent features for the detection of malicious apps for the analysis we use weka tool and found that ft detection accuracy 7927 is best among the investigated classifiers however true positives rate ie malware detection rate is highest 9991 by rf and fluctuate least with the different number of prominent features compared to other studied classifiers the analysis shows that overall accuracy is majorly affected by the false positives of the classifier | [['android', 'devices', 'are', 'growing', 'exponentially', 'and', 'are', 'connected', 'through', 'the', 'internet', 'accessing', 'billion', 'of', 'online', 'websites', 'the', 'popularity', 'of', 'these', 'devices', 'encourages', 'malware', 'developer', 'to', 'penetrate', 'the', 'market', 'with', 'malicious', 'apps', 'to', 'annoy', 'and', 'disrupt', 'the', 'victim', 'although', 'for', 'the', 'detection', 'of', 'malicious', 'apps', 'different', 'approaches', 'are', 'discussed', 'however', 'proposed', 'approaches', 'are', 'not', 'suffice', 'to', 'detect', 'the', 'advanced', 'malware', 'to', 'limitprevent', 'the', 'damages', 'in', 'this', 'very', 'few', 'approaches', 'are', 'based', 'on', 'opcode', 'occurrence', 'to', 'classify', 'the', 'malicious', 'apps', 'therefore', 'this', 'paper', 'investigates', 'the', 'five', 'classifiers', 'using', 'opcodes', 'occurrence', 'as', 'the', 'prominent', 'features', 'for', 'the', 'detection', 'of', 'malicious', 'apps', 'for', 'the', 'analysis', 'we', 'use', 'weka', 'tool', 'and', 'found', 'that', 'ft', 'detection', 'accuracy', '7927', 'is', 'best', 'among', 'the', 'investigated', 'classifiers', 'however', 'true', 'positives', 'rate', 'ie', 'malware', 'detection', 'rate', 'is', 'highest', '9991', 'by', 'rf', 'and', 'fluctuate', 'least', 'with', 'the', 'different', 'number', 'of', 'prominent', 'features', 'compared', 'to', 'other', 'studied', 'classifiers', 'the', 'analysis', 'shows', 'that', 'overall', 'accuracy', 'is', 'majorly', 'affected', 'by', 'the', 'false', 'positives', 'of', 'the', 'classifier']] | [-0.13321645815458338, 0.00010983273386955261, -0.0030774202064744066, 0.08087533429881083, -0.09833716877203967, -0.24315246116798023, 0.09532284348847356, 0.3735246652726775, -0.20678735894631156, -0.3522120673232567, 0.11733833191589516, -0.3986277468126522, -0.13771234019890843, 0.21212311441493467, -0.11399084009643737, 0.06393063005048388, 0.05190190039079792, 0.08824754928626259, -0.004524777158198196, -0.3610347217376928, 0.2920315383844185, 0.08207067231190686, 0.32097751680784714, 0.05522788097714623, 0.017587691582363355, -0.029988495779790632, -0.0788631611648276, -0.027878482259162094, -0.04217549294324791, 0.1251327219580156, 0.36288799488228624, 0.2118770632493709, 0.33255400139873165, -0.37309139144392856, -0.18483834144563893, 0.10926120890801923, 0.16037334956703073, 0.10538008043496228, -0.035229920651850447, -0.3500173059870599, 0.2107570506169559, -0.22100644329019029, -0.05271452910578463, -0.0923503732673176, 0.010524251975512468, 0.057389691931930206, -0.19261414151904838, 0.03436767890389939, 0.016840697520684383, 0.08109843657461938, -0.014040885113724883, -0.09049371819688666, -0.019649501748221075, 0.18155860984177322, 0.13979738160551336, -0.04283889713957443, 0.22340283104687098, -0.1503611049985062, -0.15328226413762902, 0.309263112818857, -0.014054589554152643, -0.0966988950016943, 0.2268492476298815, -0.027510652526842882, -0.1351546342477422, 0.15365739356471886, 0.2336543875150614, 0.12631834469741407, -0.17627886692636865, -0.042409853315594034, 0.036594243798266105, 0.19987528652722097, 0.09246669844536239, 0.023554899295942382, 0.19575021814797883, 0.2060522126389656, 0.02873028230836025, 0.1088728165425366, -0.13731640755337726, -0.01963553649679937, -0.17522347390706658, -0.12481600672631345, -0.1659267525660794, -0.013406141872155504, -0.0670498337257532, -0.1631649257542901, 0.40282470871179554, 0.25727787974503136, 0.12743130527575564, 0.06731124269133955, 0.35585676563140123, 0.004283547290797513, 0.13886120417357786, 0.14506813588766207, 0.22929240795581238, -0.027258856600925602, 0.10843402262406875, -0.15451895875671173, 0.1843372265626069, -0.023700827256897868] |
1,802.08612 | More Specificity, More Attention to Social Context: Reframing How We
Address "Bad Actors" | To address "bad actors" online, I argue for more specific definitions of
acceptable and unacceptable behaviors and explicit attention to the social
structures in which behaviors occur.
| cs.SI cs.CY cs.HC | to address bad actors online i argue for more specific definitions of acceptable and unacceptable behaviors and explicit attention to the social structures in which behaviors occur | [['to', 'address', 'bad', 'actors', 'online', 'i', 'argue', 'for', 'more', 'specific', 'definitions', 'of', 'acceptable', 'and', 'unacceptable', 'behaviors', 'and', 'explicit', 'attention', 'to', 'the', 'social', 'structures', 'in', 'which', 'behaviors', 'occur']] | [-0.1204830758333965, 0.06759261490811629, -0.0628032284202399, 0.2121570587710098, -0.17665585120105082, -0.2428769531004407, 0.11995030553252609, 0.4213302801880572, -0.2106943232593713, -0.33815637451631053, 0.04349659379416456, -0.2914491687832331, -0.23518071709959595, 0.10861635263750537, -0.16332151223387983, -0.020043117856537854, 0.044104740023612976, 0.048488720078711155, -0.054432223516481894, -0.24908418905127933, 0.30367109841770595, 0.014255033254071518, 0.3335551235962797, 0.0746021988387737, 0.06335251252339394, -0.053292526846268666, -0.03590099431608838, 0.028334901357690494, -0.12441017965061797, 0.14969089215069456, 0.423533723310188, 0.17647628900077608, 0.328747751639673, -0.46179867949750686, -0.1924797927753793, 0.10600265189660368, 0.1296848597832852, 0.0996304254820441, -0.002375498011436624, -0.3033995121820933, 0.07020319372208582, -0.2252388091550933, -0.09056458242789463, -0.11911034659930954, 0.059999879742800084, 0.013336493581947353, -0.2636945298700421, 0.020903037796314392, 0.08149212505668402, 0.1043280395851643, -0.015615341426045806, -0.06476595928823506, 0.024479228451296135, 0.2047282456661816, 0.1598462444488649, -0.12893151707464345, 0.11110785915688784, -0.222433278820029, -0.09672712883049692, 0.41792503330442643, 0.05983238943197109, -0.15431001373670167, 0.23440821237724135, -0.06248400620771227, -0.16984196159022827, 0.11221302576639035, 0.23352174033169393, 0.06575926734755437, -0.13660638931172867, -0.04560129128448251, 0.049163181265747105, 0.10219006204149789, 0.10519587355493396, 0.08351561292592022, 0.15880054980516434, 0.09103777011235555, 0.0408749575899155, 0.08078691508207056, 0.1144271941717576, -0.16698094712639297, -0.2504664696408091, -0.08961246845622857, -0.043001797533145654, 0.035813180867720534, -0.09481754228019984, -0.20255513854876714, 0.3832853310913951, 0.21400788235876933, 0.2555639147758484, -0.022458176952096873, 0.22440476650027213, 0.016125091213594983, 0.06747346357614906, 0.08629251754394283, 0.17781587952265032, -0.09399184515630757, 0.16205178240866022, -0.16878163262649817, 0.14588845878218612, -0.03551038916878126] |
1,802.08613 | Accelerate iterated filtering | In simulation-based inferences for partially observed Markov process models
(POMP), the by-product of the Monte Carlo filtering is an approximation of the
log likelihood function. Recently, iterated filtering [14, 13] has originally
been introduced and it has been shown that the gradient of the log likelihood
can also be approximated. Consequently, different stochastic optimization
algorithm can be applied to estimate the parameters of the underlying models.
As accelerated gradient is an efficient approach in the optimization
literature, we show that we can accelerate iterated filtering in the same
manner and inherit that high convergence rate while relaxing the restricted
conditions of unbiased gradient approximation. We show that this novel
algorithm can be applied to both convex and non-convex log likelihood
functions. In addition, this approach has substantially outperformed most of
other previous approaches in a toy example and in a challenging scientific
problem of modeling infectious diseases.
| stat.ME | in simulationbased inferences for partially observed markov process models pomp the byproduct of the monte carlo filtering is an approximation of the log likelihood function recently iterated filtering 14 13 has originally been introduced and it has been shown that the gradient of the log likelihood can also be approximated consequently different stochastic optimization algorithm can be applied to estimate the parameters of the underlying models as accelerated gradient is an efficient approach in the optimization literature we show that we can accelerate iterated filtering in the same manner and inherit that high convergence rate while relaxing the restricted conditions of unbiased gradient approximation we show that this novel algorithm can be applied to both convex and nonconvex log likelihood functions in addition this approach has substantially outperformed most of other previous approaches in a toy example and in a challenging scientific problem of modeling infectious diseases | [['in', 'simulationbased', 'inferences', 'for', 'partially', 'observed', 'markov', 'process', 'models', 'pomp', 'the', 'byproduct', 'of', 'the', 'monte', 'carlo', 'filtering', 'is', 'an', 'approximation', 'of', 'the', 'log', 'likelihood', 'function', 'recently', 'iterated', 'filtering', '14', '13', 'has', 'originally', 'been', 'introduced', 'and', 'it', 'has', 'been', 'shown', 'that', 'the', 'gradient', 'of', 'the', 'log', 'likelihood', 'can', 'also', 'be', 'approximated', 'consequently', 'different', 'stochastic', 'optimization', 'algorithm', 'can', 'be', 'applied', 'to', 'estimate', 'the', 'parameters', 'of', 'the', 'underlying', 'models', 'as', 'accelerated', 'gradient', 'is', 'an', 'efficient', 'approach', 'in', 'the', 'optimization', 'literature', 'we', 'show', 'that', 'we', 'can', 'accelerate', 'iterated', 'filtering', 'in', 'the', 'same', 'manner', 'and', 'inherit', 'that', 'high', 'convergence', 'rate', 'while', 'relaxing', 'the', 'restricted', 'conditions', 'of', 'unbiased', 'gradient', 'approximation', 'we', 'show', 'that', 'this', 'novel', 'algorithm', 'can', 'be', 'applied', 'to', 'both', 'convex', 'and', 'nonconvex', 'log', 'likelihood', 'functions', 'in', 'addition', 'this', 'approach', 'has', 'substantially', 'outperformed', 'most', 'of', 'other', 'previous', 'approaches', 'in', 'a', 'toy', 'example', 'and', 'in', 'a', 'challenging', 'scientific', 'problem', 'of', 'modeling', 'infectious', 'diseases']] | [-0.038680107946520305, 0.027499838043392327, -0.13665356129395212, 0.11832449188799493, -0.0749803725360785, -0.1373327366475548, 0.011339035689780097, 0.4334525387151306, -0.30473468850959146, -0.3361044241761675, 0.12080983090100392, -0.22635852197045778, -0.19432273591261953, 0.20137411523546997, -0.08996412062345921, 0.10993018000922007, 0.06254055631841171, -0.018612806978683005, -0.08132746662361687, -0.30244909468911535, 0.2182114424380366, 0.09952044191130367, 0.28392603525061944, 0.007008764927661946, 0.12082811439840271, 0.0004020397437318247, -0.014794567005342938, 0.05541075261778572, -0.08154358358069348, 0.0906843815361574, 0.2689261870848456, 0.19270594057240556, 0.3387718210060175, -0.3841316446814002, -0.25040820341867703, 0.14232004247289023, 0.22032089790524947, 0.10948379697487215, -0.04302598852573159, -0.22781722878619115, 0.07728979418839828, -0.18237796135018675, -0.08035969099213629, -0.10519787822501594, -0.058611773318756805, 0.045445101392268504, -0.3187012167229336, 0.08573098026582698, 0.05059507358058983, 0.00891517961182359, -0.02613340258015459, -0.15166582365450607, 0.009360144184078692, 0.05743050718439274, 0.059121528667909394, 0.058078827897124756, 0.11753574465353954, -0.10002743979269753, -0.14765328757439544, 0.306747948167985, -0.09345158159124609, -0.2232325985191428, 0.1790754666906737, -0.05679450261400265, -0.1779319586067581, 0.1328878432154326, 0.2072930822630419, 0.19730156774119456, -0.20026257265751965, 0.11010236365460874, -0.03370074706063384, 0.12943485109325575, 0.021709314910188116, -0.0656025750169746, 0.10514076362517631, 0.17441806665361942, 0.1079698402440923, 0.13947773180770542, -0.07506741259601854, -0.14060261987504505, -0.21969669755725635, -0.13887721080599086, -0.18722150276801516, 0.01846164583583318, -0.12345675651425952, -0.166832643067488, 0.35243040545951243, 0.21376343351491048, 0.18935566711663998, 0.07189637960447949, 0.3046903862906176, 0.18367763519917493, 0.047358257658019355, 0.10102685711340231, 0.23013163039929607, 0.10093459706329012, 0.04268488216730228, -0.19096233816754046, 0.15100332882673462, 0.061776473427660204] |
1,802.08614 | Visualizing the Flow of Discourse with a Concept Ontology | Understanding and visualizing human discourse has long being a challenging
task. Although recent work on argument mining have shown success in classifying
the role of various sentences, the task of recognizing concepts and
understanding the ways in which they are discussed remains challenging. Given
an email thread or a transcript of a group discussion, our task is to extract
the relevant concepts and understand how they are referenced and re-referenced
throughout the discussion. In the present work, we present a preliminary
approach for extracting and visualizing group discourse by adapting Wikipedia's
category hierarchy to be an external concept ontology. From a user study, we
found that our method achieved better results than 4 strong alternative
approaches, and we illustrate our visualization method based on the extracted
discourse flows.
| cs.CL cs.AI cs.IR | understanding and visualizing human discourse has long being a challenging task although recent work on argument mining have shown success in classifying the role of various sentences the task of recognizing concepts and understanding the ways in which they are discussed remains challenging given an email thread or a transcript of a group discussion our task is to extract the relevant concepts and understand how they are referenced and rereferenced throughout the discussion in the present work we present a preliminary approach for extracting and visualizing group discourse by adapting wikipedias category hierarchy to be an external concept ontology from a user study we found that our method achieved better results than 4 strong alternative approaches and we illustrate our visualization method based on the extracted discourse flows | [['understanding', 'and', 'visualizing', 'human', 'discourse', 'has', 'long', 'being', 'a', 'challenging', 'task', 'although', 'recent', 'work', 'on', 'argument', 'mining', 'have', 'shown', 'success', 'in', 'classifying', 'the', 'role', 'of', 'various', 'sentences', 'the', 'task', 'of', 'recognizing', 'concepts', 'and', 'understanding', 'the', 'ways', 'in', 'which', 'they', 'are', 'discussed', 'remains', 'challenging', 'given', 'an', 'email', 'thread', 'or', 'a', 'transcript', 'of', 'a', 'group', 'discussion', 'our', 'task', 'is', 'to', 'extract', 'the', 'relevant', 'concepts', 'and', 'understand', 'how', 'they', 'are', 'referenced', 'and', 'rereferenced', 'throughout', 'the', 'discussion', 'in', 'the', 'present', 'work', 'we', 'present', 'a', 'preliminary', 'approach', 'for', 'extracting', 'and', 'visualizing', 'group', 'discourse', 'by', 'adapting', 'wikipedias', 'category', 'hierarchy', 'to', 'be', 'an', 'external', 'concept', 'ontology', 'from', 'a', 'user', 'study', 'we', 'found', 'that', 'our', 'method', 'achieved', 'better', 'results', 'than', '4', 'strong', 'alternative', 'approaches', 'and', 'we', 'illustrate', 'our', 'visualization', 'method', 'based', 'on', 'the', 'extracted', 'discourse', 'flows']] | [-0.06838369454114192, 0.032663764210471034, -0.08622639922527817, 0.1118161315034239, -0.13509216924027473, -0.11157547583891533, 0.04655174598992458, 0.42514776219943845, -0.24489327326534302, -0.35445187367704206, 0.07743026543221634, -0.260945174285746, -0.21448088792798028, 0.233439005125776, -0.09733913088305376, 0.0009814818677543772, 0.10959228007196206, 0.06814131026310245, -0.028747012831388027, -0.25720601280102523, 0.33715420741565877, 0.049896613555395694, 0.33871725801374825, 0.08791519930644885, 0.079283884170742, -0.02319938783702536, -0.14911530739270282, -0.0006902551106140604, -0.10568132526618218, 0.2138537742329512, 0.34721113216337257, 0.2093332018483225, 0.3328754200469922, -0.409145444939573, -0.19818519047043454, 0.03741092281049396, 0.15436665847893863, 0.14132288931117312, -0.06095026310452619, -0.36369429020519095, 0.09109848794549352, -0.17126240447808908, -0.04108592035894201, -0.1627459116802573, 0.041081800866197414, -0.0557410277409743, -0.16172840081037967, 0.01182059918651284, 0.10971137879812341, 0.12862972195780886, -0.038574551127660346, -0.09892615702692566, 0.04950941527192664, 0.2115506073478316, 0.07677835206809182, 0.06886538115740702, 0.13844432576200155, -0.16264745021077592, -0.1400007184404205, 0.4009150239807649, -0.0017815986653931042, -0.21481172294964587, 0.198245918167403, -0.059016559483835426, -0.1816334558584852, 0.023268788471803303, 0.1674914312013608, 0.1240523591588112, -0.16513409885746522, -0.006403393001207627, -0.058498410262372784, 0.19860812041296177, 0.061652553759104625, -0.010862429285289969, 0.21531836376122132, 0.279020212658527, -0.024923045327520276, 0.10660978482658498, -0.020440045223520026, -0.0760572931076598, -0.23027749755603122, -0.12698445549256748, -0.14534530329598686, -0.011195190947532184, -0.04310115883204771, -0.10436702588656514, 0.40241809592648287, 0.22126134658437663, 0.18541469622227386, 0.05303136007878636, 0.30829156886815556, 0.03284653972405353, 0.05301323637012695, 0.05355706778914103, 0.1525813094633595, 0.036324111614596304, 0.13709593476272944, -0.15942330382889006, 0.10109823733828521, 0.08100563753396273] |
1,802.08615 | Scalar dark matter search from the extended $\nu$THDM | We consider a neutrino Two Higgs Doublet Model ($\nu$THDM) in which neutrinos
obtain {\it naturally} small Dirac masses from the soft symmetry breaking of a
global $U(1)_X$ symmetry. We extended the model so the soft term is generated
by the spontaneous breaking of $U(1)_X$ by a new scalar field. The symmetry
breaking pattern can also stabilize a scalar dark matter candidate. After
constructing the model, we study the phenomenology of the dark matter: relic
density, direct and indirect detection.
| hep-ph hep-ex | we consider a neutrino two higgs doublet model nuthdm in which neutrinos obtain it naturally small dirac masses from the soft symmetry breaking of a global u1_x symmetry we extended the model so the soft term is generated by the spontaneous breaking of u1_x by a new scalar field the symmetry breaking pattern can also stabilize a scalar dark matter candidate after constructing the model we study the phenomenology of the dark matter relic density direct and indirect detection | [['we', 'consider', 'a', 'neutrino', 'two', 'higgs', 'doublet', 'model', 'nuthdm', 'in', 'which', 'neutrinos', 'obtain', 'it', 'naturally', 'small', 'dirac', 'masses', 'from', 'the', 'soft', 'symmetry', 'breaking', 'of', 'a', 'global', 'u1_x', 'symmetry', 'we', 'extended', 'the', 'model', 'so', 'the', 'soft', 'term', 'is', 'generated', 'by', 'the', 'spontaneous', 'breaking', 'of', 'u1_x', 'by', 'a', 'new', 'scalar', 'field', 'the', 'symmetry', 'breaking', 'pattern', 'can', 'also', 'stabilize', 'a', 'scalar', 'dark', 'matter', 'candidate', 'after', 'constructing', 'the', 'model', 'we', 'study', 'the', 'phenomenology', 'of', 'the', 'dark', 'matter', 'relic', 'density', 'direct', 'and', 'indirect', 'detection']] | [-0.163924433338114, 0.27773512752514473, -0.07242787065267374, 0.1912703402296204, -0.14609815383070632, -0.1669469608489094, -0.0001227318285669707, 0.31470722180814775, -0.25302190281733683, -0.34666587728299675, 0.05093173562885038, -0.2185502077476416, -0.09129846178561071, 0.01340182849701164, 0.09931848342589374, 0.009575453622243072, -0.07417038261678212, 0.014651682652250121, -0.05954454230922687, -0.18290102215707774, 0.2850789250688085, 0.001656507861010636, 0.2408718753818281, 0.05990081450229959, 0.1035208612256035, -0.021564186975076984, 0.006370998111470968, -0.1310148696662693, -0.1006390692996262, 0.0568631881364633, 0.10344865783176656, 0.049581806800222096, 0.10950505870830597, -0.4077508030341396, -0.25791146109894486, 0.19612924709821802, 0.12456676145555758, 0.16253845929315525, -0.16839906692363416, -0.40357340862856633, 0.07968264722996214, -0.27390771582015333, -0.13624146162190393, -0.05006960662128993, -0.09412189264033179, -0.14611257701416652, -0.30630064554235464, 0.13872750352477195, -0.03697313574626099, -0.03408975521974926, -0.045645632050176965, -0.056366632574626915, -0.10570476657439824, -0.06956872374668152, 0.22105819289572537, -0.04904130007187494, 0.162930771827851, -0.25762681875236426, -0.11228936197695948, 0.44800889506181585, -0.1462433248834944, -0.13417321053934814, 0.10849975030338746, -0.07204500207370973, -0.19587084635078342, 0.15789990117655525, 0.14679632103660062, 0.09841323232490427, -0.1444115302513672, 0.19178026425283803, -0.12325280361743998, 0.18687901528009884, 0.006346975688975823, 0.010820469052731237, 0.3587145424341854, 0.17697683909224182, 0.0898659728184531, 0.0788441237380516, -0.07400936426527067, -0.08089814511646481, -0.4425671802291387, -0.13426470337877686, -0.11211418098168849, 0.0438539095560407, -0.06342284408890896, -0.07912659958665129, 0.46853769877100293, 0.11348918112749352, 0.21382408888857293, -0.015553487145011844, 0.28349971523673473, 0.08443217458132701, 0.09845118047787418, -0.022687395966812213, 0.29861004981860706, 0.1379495635333978, 0.05902807042002678, -0.255369984866061, -0.08325332245211813, 0.09643425028240662] |
1,802.08616 | Mastery Learning in Practice: A (Mostly) Descriptive Analysis of Log
Data from the Cognitive Tutor Algebra I Effectiveness Trial | Mastery learning, the notion that students learn best if they move on from
studying a topic only after having demonstrated mastery, sits at the foundation
of the theory of intelligent tutoring. This paper is an exploration of how
mastery learning plays out in practice, based on log data from a large
randomized effectiveness trial of the Cognitive Tutor Algebra I (CTAI)
curriculum. We find that students frequently progressed from CTAI sections they
were working on without demonstrating mastery and worked units out of order.
Moreover, these behaviors were substantially more common in the second year of
the study, in which the CTAI effect was significantly larger. We explore the
various ways students departed from the official CTAI curriculum, focusing on
heterogeneity between years, states, schools, and students. The paper concludes
with an observational study of the effect on post-test scores of teachers
reassigning students out of their current sections before they mastered the
requisite skills, finding that reassignment appears to lowers posttest
scores--a finding that is fairly resilient to confounding from omitted
covariates--but that the effect varies substantially between classrooms.
| stat.AP | mastery learning the notion that students learn best if they move on from studying a topic only after having demonstrated mastery sits at the foundation of the theory of intelligent tutoring this paper is an exploration of how mastery learning plays out in practice based on log data from a large randomized effectiveness trial of the cognitive tutor algebra i ctai curriculum we find that students frequently progressed from ctai sections they were working on without demonstrating mastery and worked units out of order moreover these behaviors were substantially more common in the second year of the study in which the ctai effect was significantly larger we explore the various ways students departed from the official ctai curriculum focusing on heterogeneity between years states schools and students the paper concludes with an observational study of the effect on posttest scores of teachers reassigning students out of their current sections before they mastered the requisite skills finding that reassignment appears to lowers posttest scoresa finding that is fairly resilient to confounding from omitted covariatesbut that the effect varies substantially between classrooms | [['mastery', 'learning', 'the', 'notion', 'that', 'students', 'learn', 'best', 'if', 'they', 'move', 'on', 'from', 'studying', 'a', 'topic', 'only', 'after', 'having', 'demonstrated', 'mastery', 'sits', 'at', 'the', 'foundation', 'of', 'the', 'theory', 'of', 'intelligent', 'tutoring', 'this', 'paper', 'is', 'an', 'exploration', 'of', 'how', 'mastery', 'learning', 'plays', 'out', 'in', 'practice', 'based', 'on', 'log', 'data', 'from', 'a', 'large', 'randomized', 'effectiveness', 'trial', 'of', 'the', 'cognitive', 'tutor', 'algebra', 'i', 'ctai', 'curriculum', 'we', 'find', 'that', 'students', 'frequently', 'progressed', 'from', 'ctai', 'sections', 'they', 'were', 'working', 'on', 'without', 'demonstrating', 'mastery', 'and', 'worked', 'units', 'out', 'of', 'order', 'moreover', 'these', 'behaviors', 'were', 'substantially', 'more', 'common', 'in', 'the', 'second', 'year', 'of', 'the', 'study', 'in', 'which', 'the', 'ctai', 'effect', 'was', 'significantly', 'larger', 'we', 'explore', 'the', 'various', 'ways', 'students', 'departed', 'from', 'the', 'official', 'ctai', 'curriculum', 'focusing', 'on', 'heterogeneity', 'between', 'years', 'states', 'schools', 'and', 'students', 'the', 'paper', 'concludes', 'with', 'an', 'observational', 'study', 'of', 'the', 'effect', 'on', 'posttest', 'scores', 'of', 'teachers', 'reassigning', 'students', 'out', 'of', 'their', 'current', 'sections', 'before', 'they', 'mastered', 'the', 'requisite', 'skills', 'finding', 'that', 'reassignment', 'appears', 'to', 'lowers', 'posttest', 'scoresa', 'finding', 'that', 'is', 'fairly', 'resilient', 'to', 'confounding', 'from', 'omitted', 'covariatesbut', 'that', 'the', 'effect', 'varies', 'substantially', 'between', 'classrooms']] | [-0.013741812142255727, 0.11330651399418529, -0.11682410334142741, 0.07846824477460716, -0.14432350849586256, -0.1420091089604192, 0.09515758647041897, 0.3899295168897409, -0.2197356017756412, -0.37640578710353734, 0.03609286960321636, -0.2963818786181823, -0.18392912736241027, 0.20019174770064904, -0.12019114634231402, -0.036512026117246056, 0.08309456099640955, 0.06049708481040898, -0.062499392697237054, -0.3399768516204184, 0.31765012225408235, 0.11950845069649597, 0.3024496469281096, 0.02382265529438351, 0.06861769992606702, -0.0030014833090094366, -0.07643099728150272, -0.00931036629546643, -0.07881254202845994, 0.11603334614466823, 0.35058117325004357, 0.18981608063286023, 0.413831871369163, -0.4290723732013381, -0.13388663578673535, 0.06883674778902296, 0.10226488087896593, 0.07860303102545126, -0.0380443908020578, -0.32177280775451866, 0.04788790529939147, -0.17322492381175875, -0.06254309409931093, -0.06675622251889998, -0.0011817850159439312, -0.02349055958964098, -0.19070351273907096, 0.00021598155850942216, 0.06355479968473181, 0.16379324830362177, -0.028550341516063456, -0.17423646707935364, -0.005045884315662211, 0.18615980841104318, 0.07619515213993734, 0.01638478058484498, 0.1713192007070135, -0.18931964409061489, -0.1332631869021845, 0.3575301672713936, 0.023805162609748416, -0.1170273261940044, 0.1890796573062197, -0.12520791731023995, -0.12866979107794382, 0.06338576286288208, 0.22145488659401288, 0.08818756036978383, -0.12248055615954184, 0.01992936179060175, 0.0009385806696719668, 0.1683481965322581, 0.07035741633787919, -0.07525432487397737, 0.20293952117077588, 0.17281463717665063, 0.020896538113651986, 0.07526097242887854, -0.026184726133680995, -0.11133062605369376, -0.25965383658028635, -0.1498678415396324, -0.13295699326580473, 0.033055683095635995, -0.02201487354360641, -0.08857451080649717, 0.3877792251139377, 0.20395299592160024, 0.1207762224981666, 0.04783553670548305, 0.24223942739700668, 0.058321358050020894, 0.09529029525518208, 0.07559629809372964, 0.24216891504468374, 0.039733974011928845, 0.146627856719339, -0.17986495120673548, 0.1237624521403877, -0.01713795539677101] |
1,802.08617 | Surface Edge Explorer (SEE): Planning Next Best Views Directly from 3D
Observations | Surveying 3D scenes is a common task in robotics. Systems can do so
autonomously by iteratively obtaining measurements. This process of planning
observations to improve the model of a scene is called Next Best View (NBV)
planning.
NBV planning approaches often use either volumetric (e.g., voxel grids) or
surface (e.g., triangulated meshes) representations. Volumetric approaches
generalise well between scenes as they do not depend on surface geometry but do
not scale to high-resolution models of large scenes. Surface representations
can obtain high-resolution models at any scale but often require tuning of
unintuitive parameters or multiple survey stages.
This paper presents a scene-model-free NBV planning approach with a density
representation. The Surface Edge Explorer (SEE) uses the density of current
measurements to detect and explore observed surface boundaries. This approach
is shown experimentally to provide better surface coverage in lower computation
time than the evaluated state-of-the-art volumetric approaches while moving
equivalent distances.
| cs.RO | surveying 3d scenes is a common task in robotics systems can do so autonomously by iteratively obtaining measurements this process of planning observations to improve the model of a scene is called next best view nbv planning nbv planning approaches often use either volumetric eg voxel grids or surface eg triangulated meshes representations volumetric approaches generalise well between scenes as they do not depend on surface geometry but do not scale to highresolution models of large scenes surface representations can obtain highresolution models at any scale but often require tuning of unintuitive parameters or multiple survey stages this paper presents a scenemodelfree nbv planning approach with a density representation the surface edge explorer see uses the density of current measurements to detect and explore observed surface boundaries this approach is shown experimentally to provide better surface coverage in lower computation time than the evaluated stateoftheart volumetric approaches while moving equivalent distances | [['surveying', '3d', 'scenes', 'is', 'a', 'common', 'task', 'in', 'robotics', 'systems', 'can', 'do', 'so', 'autonomously', 'by', 'iteratively', 'obtaining', 'measurements', 'this', 'process', 'of', 'planning', 'observations', 'to', 'improve', 'the', 'model', 'of', 'a', 'scene', 'is', 'called', 'next', 'best', 'view', 'nbv', 'planning', 'nbv', 'planning', 'approaches', 'often', 'use', 'either', 'volumetric', 'eg', 'voxel', 'grids', 'or', 'surface', 'eg', 'triangulated', 'meshes', 'representations', 'volumetric', 'approaches', 'generalise', 'well', 'between', 'scenes', 'as', 'they', 'do', 'not', 'depend', 'on', 'surface', 'geometry', 'but', 'do', 'not', 'scale', 'to', 'highresolution', 'models', 'of', 'large', 'scenes', 'surface', 'representations', 'can', 'obtain', 'highresolution', 'models', 'at', 'any', 'scale', 'but', 'often', 'require', 'tuning', 'of', 'unintuitive', 'parameters', 'or', 'multiple', 'survey', 'stages', 'this', 'paper', 'presents', 'a', 'scenemodelfree', 'nbv', 'planning', 'approach', 'with', 'a', 'density', 'representation', 'the', 'surface', 'edge', 'explorer', 'see', 'uses', 'the', 'density', 'of', 'current', 'measurements', 'to', 'detect', 'and', 'explore', 'observed', 'surface', 'boundaries', 'this', 'approach', 'is', 'shown', 'experimentally', 'to', 'provide', 'better', 'surface', 'coverage', 'in', 'lower', 'computation', 'time', 'than', 'the', 'evaluated', 'stateoftheart', 'volumetric', 'approaches', 'while', 'moving', 'equivalent', 'distances']] | [-0.05670457876073973, 0.060573748381187516, -0.10213809934444726, 0.05528805213947635, -0.13941785583272576, -0.15137459818584223, 0.0042495927849086, 0.44232171287139255, -0.2463582665845752, -0.4033726221850763, 0.10394712468919655, -0.23828592407206695, -0.14296058332857986, 0.18556661727294946, -0.16805100578640123, 0.04945857187655444, 0.13298731880262493, 0.0016981005468793835, -0.09324378547336286, -0.2093646157036225, 0.25200158077136925, 0.0568406669019411, 0.3203346180294951, 0.006515251416713, 0.12307764078800877, -0.027220667771374187, -0.06747403843328356, 0.043102924805134536, -0.12305049839739998, 0.1380377491315206, 0.31127086187620684, 0.14231234457654257, 0.22824544580342868, -0.4821277292942007, -0.29323070211336016, 0.09400267906370573, 0.1743970247519125, 0.10324024467263371, 0.0266154120140709, -0.2838124542931716, 0.0550131596547241, -0.11811400158020358, -0.07159928174999854, -0.11223648985226949, -0.01616133103147149, 0.0002540792947790275, -0.247546046472465, 0.03822163993337502, 0.032044702308097237, 0.08256789630589385, -0.10220256414885322, -0.08842009283912679, -0.015555830504745245, 0.16979814316611738, -0.021745609860906068, 0.0701992377669861, 0.17656960536415378, -0.1972456851741299, -0.11469395519855122, 0.40179417791465916, -0.00596298737655161, -0.21148157274117693, 0.23798887382727116, -0.13023136711058517, -0.10786658650885025, 0.1389544644773317, 0.2114401472406462, 0.18523250229967136, -0.15772885384658972, 0.054343121628820275, -0.0035224495936806003, 0.18544848502147943, 0.06395119107638796, -0.02179492940738176, 0.23657092892875273, 0.20857697007556755, 0.11267438421879584, 0.053694884359526136, -0.1473766572990765, -0.029012516994650166, -0.20728849764020804, -0.09626735924743116, -0.1832455459687238, -0.019294910078363803, -0.05931006236302589, -0.19263577128896334, 0.3277415862431129, 0.22765823416722317, 0.2160979887517169, 0.08502757780253888, 0.36754403981690603, 0.03393833983146275, 0.10669737356714905, 0.08844937714088398, 0.1627838944470083, -0.0034359646262601016, 0.11670965712983161, -0.13614435145864262, 0.09328040288450817, 0.08508912905740242] |
1,802.08618 | Simple derivation of the $(- \lambda H)^{5/2}$ tail for the 1D KPZ
equation | We study the long-time regime of the Kardar-Parisi-Zhang (KPZ) equation in
$1+1$ dimensions for the Brownian and droplet initial conditions and present a
simple derivation of the tail of the large deviations of the height on the
negative side $\lambda H<0$. We show that for both initial conditions, the
cumulative distribution functions take a large deviations form, with a tail for
$- \tilde s \gg 1$ given by $-\log
\mathbb{P}\left(\frac{H}{t}<\tilde{s}\right)=t^2 \frac{4 }{15 \pi}
(-\tilde{s})^{5/2} $. This exact expression was already observed at small time
for both initial conditions suggesting that these large deviations remain valid
at all times. We present two methods to derive the result (i) long time
estimate using a Fredholm determinant formula and (ii) the evaluation of the
cumulants of a determinantal point process where the successive cumulants
appear to give the successive orders of the large deviation rate function in
the large $\tilde s$ expansion. An interpretation in terms of large deviations
for trapped fermions at low temperature is also given. In addition, we perform
a similar calculation for the KPZ equation in a half-space with a droplet
initial condition, and show that the same tail as above arises, with the
prefactor $\frac{4}{15\pi}$ replaced by $\frac{2}{15\pi}$. Finally, the
arguments can be extended to show that this tail holds for all times. This is
consistent with the fact that the same tail was obtained previously in the
short time limit for the full-space problem.
| cond-mat.stat-mech cond-mat.dis-nn math-ph math.MP math.PR | we study the longtime regime of the kardarparisizhang kpz equation in 11 dimensions for the brownian and droplet initial conditions and present a simple derivation of the tail of the large deviations of the height on the negative side lambda h0 we show that for both initial conditions the cumulative distribution functions take a large deviations form with a tail for tilde s gg 1 given by log mathbbpleftfrachttildesrightt2 frac4 15 pi tildes52 this exact expression was already observed at small time for both initial conditions suggesting that these large deviations remain valid at all times we present two methods to derive the result i long time estimate using a fredholm determinant formula and ii the evaluation of the cumulants of a determinantal point process where the successive cumulants appear to give the successive orders of the large deviation rate function in the large tilde s expansion an interpretation in terms of large deviations for trapped fermions at low temperature is also given in addition we perform a similar calculation for the kpz equation in a halfspace with a droplet initial condition and show that the same tail as above arises with the prefactor frac415pi replaced by frac215pi finally the arguments can be extended to show that this tail holds for all times this is consistent with the fact that the same tail was obtained previously in the short time limit for the fullspace problem | [['we', 'study', 'the', 'longtime', 'regime', 'of', 'the', 'kardarparisizhang', 'kpz', 'equation', 'in', '11', 'dimensions', 'for', 'the', 'brownian', 'and', 'droplet', 'initial', 'conditions', 'and', 'present', 'a', 'simple', 'derivation', 'of', 'the', 'tail', 'of', 'the', 'large', 'deviations', 'of', 'the', 'height', 'on', 'the', 'negative', 'side', 'lambda', 'h0', 'we', 'show', 'that', 'for', 'both', 'initial', 'conditions', 'the', 'cumulative', 'distribution', 'functions', 'take', 'a', 'large', 'deviations', 'form', 'with', 'a', 'tail', 'for', 'tilde', 's', 'gg', '1', 'given', 'by', 'log', 'mathbbpleftfrachttildesrightt2', 'frac4', '15', 'pi', 'tildes52', 'this', 'exact', 'expression', 'was', 'already', 'observed', 'at', 'small', 'time', 'for', 'both', 'initial', 'conditions', 'suggesting', 'that', 'these', 'large', 'deviations', 'remain', 'valid', 'at', 'all', 'times', 'we', 'present', 'two', 'methods', 'to', 'derive', 'the', 'result', 'i', 'long', 'time', 'estimate', 'using', 'a', 'fredholm', 'determinant', 'formula', 'and', 'ii', 'the', 'evaluation', 'of', 'the', 'cumulants', 'of', 'a', 'determinantal', 'point', 'process', 'where', 'the', 'successive', 'cumulants', 'appear', 'to', 'give', 'the', 'successive', 'orders', 'of', 'the', 'large', 'deviation', 'rate', 'function', 'in', 'the', 'large', 'tilde', 's', 'expansion', 'an', 'interpretation', 'in', 'terms', 'of', 'large', 'deviations', 'for', 'trapped', 'fermions', 'at', 'low', 'temperature', 'is', 'also', 'given', 'in', 'addition', 'we', 'perform', 'a', 'similar', 'calculation', 'for', 'the', 'kpz', 'equation', 'in', 'a', 'halfspace', 'with', 'a', 'droplet', 'initial', 'condition', 'and', 'show', 'that', 'the', 'same', 'tail', 'as', 'above', 'arises', 'with', 'the', 'prefactor', 'frac415pi', 'replaced', 'by', 'frac215pi', 'finally', 'the', 'arguments', 'can', 'be', 'extended', 'to', 'show', 'that', 'this', 'tail', 'holds', 'for', 'all', 'times', 'this', 'is', 'consistent', 'with', 'the', 'fact', 'that', 'the', 'same', 'tail', 'was', 'obtained', 'previously', 'in', 'the', 'short', 'time', 'limit', 'for', 'the', 'fullspace', 'problem']] | [-0.10691535867069288, 0.1377286616037121, -0.09505555439675913, 0.09512775027962081, 0.011495133765138589, -0.1220580121599041, 0.03306120835714348, 0.31243585509719785, -0.24153405737063297, -0.26127450395117463, 0.10097098591318153, -0.25993822576595044, -0.0886727544306213, 0.18617283746305838, -0.008033927413886937, 0.03297197096275561, 0.05352927922690489, 0.02614162781263714, -0.09135807133521642, -0.22168545659494918, 0.297615059684192, 0.02735842828028049, 0.23829444537233577, 0.06665306140414694, 0.10784036726227184, -0.012740837038924023, 0.006756612335561545, 0.004738129890580295, -0.18228005734514832, 0.058328928955068644, 0.19230068402336628, 0.0460840228956545, 0.2308961151437874, -0.3880887130936567, -0.16650780283309746, 0.11042213376643725, 0.139769335338862, 0.11614982263755569, -0.02124652703790583, -0.2592094127225863, 0.10652132734487002, -0.15018767504489203, -0.19337481394656067, -0.01290800269225459, 0.08553097255777939, 0.028326538041661378, -0.31417632404537427, 0.13542355443247658, 0.07408564662343109, 0.030067840387472212, -0.03272029181445437, -0.14343086680603007, 0.029759840047978735, 0.10404687801182463, 0.08370190942133333, 0.025834114334114637, 0.0844395412333729, -0.13876919507137722, -0.052590165043338424, 0.34145459235954256, -0.12649281159798248, -0.1630928227536832, 0.16321852108366885, -0.22307422213070902, -0.12988527467296945, 0.14706203404227391, 0.1259156570871143, 0.12601325353728487, -0.1393483541381759, 0.11634954586295004, -0.05641977762192633, 0.14185932497214224, 0.0988885457577079, -0.0009920361383265748, 0.14503828492378454, 0.11209695398589814, 0.06427005589012363, 0.14329477633375803, -0.09024531565086505, -0.0927703476418213, -0.3841694357333245, -0.16583846899246377, -0.206585834396487, 0.08039943522015723, -0.1540994213738285, -0.1694049085792783, 0.3395527550674475, 0.1323218519186593, 0.26002284751608323, 0.15211840678163646, 0.21620695031695553, 0.20272529072146378, 0.04075205151306151, 0.09092120961104701, 0.18507008582103626, 0.07497908430097391, 0.10546365486320866, -0.1994213265733737, 0.08476519187104997, 0.06979784910623549] |
1,802.08619 | First-principles simulations for attosecond photoelectron spectroscopy
based on time-dependent density functional theory | We develop a first-principles simulation method for attosecond time-resolved
photoelectron spectroscopy. This method enables us to directly simulate the
whole experimental processes, including excitation, emission and detection on
equal footing. To examine the performance of the method, we use it to compute
the reconstruction of attosecond beating by interference of two-photon
transitions (RABBITT) experiments of gas-phase Argon. The computed RABBITT
photoionization delay is in very good agreement with recent experimental
results from [Kl\"under et al, Phys. Rev. Lett. 106 143002 (2011)] and
[Gu\'enot et al, Phys. Rev. A 85 053424 (2012)]. This indicates the
significance of a fully-consistent theoretical treatment of the whole
measurement process to properly describe experimental observables in attosecond
photoelectron spectroscopy. The present framework opens the path to unravel the
microscopic processes underlying RABBITT spectra in more complex materials and
nanostructures.
| physics.atom-ph | we develop a firstprinciples simulation method for attosecond timeresolved photoelectron spectroscopy this method enables us to directly simulate the whole experimental processes including excitation emission and detection on equal footing to examine the performance of the method we use it to compute the reconstruction of attosecond beating by interference of twophoton transitions rabbitt experiments of gasphase argon the computed rabbitt photoionization delay is in very good agreement with recent experimental results from klunder et al phys rev lett 106 143002 2011 and guenot et al phys rev a 85 053424 2012 this indicates the significance of a fullyconsistent theoretical treatment of the whole measurement process to properly describe experimental observables in attosecond photoelectron spectroscopy the present framework opens the path to unravel the microscopic processes underlying rabbitt spectra in more complex materials and nanostructures | [['we', 'develop', 'a', 'firstprinciples', 'simulation', 'method', 'for', 'attosecond', 'timeresolved', 'photoelectron', 'spectroscopy', 'this', 'method', 'enables', 'us', 'to', 'directly', 'simulate', 'the', 'whole', 'experimental', 'processes', 'including', 'excitation', 'emission', 'and', 'detection', 'on', 'equal', 'footing', 'to', 'examine', 'the', 'performance', 'of', 'the', 'method', 'we', 'use', 'it', 'to', 'compute', 'the', 'reconstruction', 'of', 'attosecond', 'beating', 'by', 'interference', 'of', 'twophoton', 'transitions', 'rabbitt', 'experiments', 'of', 'gasphase', 'argon', 'the', 'computed', 'rabbitt', 'photoionization', 'delay', 'is', 'in', 'very', 'good', 'agreement', 'with', 'recent', 'experimental', 'results', 'from', 'klunder', 'et', 'al', 'phys', 'rev', 'lett', '106', '143002', '2011', 'and', 'guenot', 'et', 'al', 'phys', 'rev', 'a', '85', '053424', '2012', 'this', 'indicates', 'the', 'significance', 'of', 'a', 'fullyconsistent', 'theoretical', 'treatment', 'of', 'the', 'whole', 'measurement', 'process', 'to', 'properly', 'describe', 'experimental', 'observables', 'in', 'attosecond', 'photoelectron', 'spectroscopy', 'the', 'present', 'framework', 'opens', 'the', 'path', 'to', 'unravel', 'the', 'microscopic', 'processes', 'underlying', 'rabbitt', 'spectra', 'in', 'more', 'complex', 'materials', 'and', 'nanostructures']] | [-0.012100820552211988, 0.0885906915945904, -0.08763542977006485, -0.014624481320190556, -0.03273276397676179, -0.07254876048219475, 0.10637060731868118, 0.41958854715763166, -0.16337537070891509, -0.36265595928963384, -0.09631091351250441, -0.3032991105803486, -0.15988430618855284, 0.23595054250803182, -0.05786295068647825, 0.10078078062471116, 0.08557664124104618, -0.157793694133447, -0.03345649968479958, -0.20193291196659574, 0.16392425125620017, 0.15928034373615502, 0.2909651526010059, 0.10160293855005875, 0.07144200348535157, 0.05677496879643789, -0.056011340146968985, -0.07084381526554794, -0.20468650043458733, 0.08018896104697364, 0.26123078247165366, 0.08895750797466573, 0.19423613877910556, -0.44446007347185956, -0.2639408571289316, 0.032337299877932914, 0.07709860166704113, 0.16081342466570664, -0.03863104165209348, -0.33579511851580307, 0.0010741742849914413, -0.16698032140971697, -0.1068682282154138, -0.13895903519270095, 0.05627896219569569, -0.014096687178332077, -0.2923573670100957, 0.13432856773513116, -0.05036692916165163, 0.048623801956912786, -0.04060010199794884, -0.029571605949472127, 0.013189825391622655, 0.021013825278108317, -0.07658769033878343, 0.06773742074217422, 0.1443047433259022, -0.03293842781038785, -0.17761402892541478, 0.3599877975824656, -0.04957265194477231, -0.05574573941218356, 0.21670235202393748, -0.18784717001571236, -0.11822557351357925, 0.17509831190391473, 0.15821502063155288, 0.20075553867817772, -0.16270955859429456, 0.056439785740539344, -0.040869470413423245, 0.17612497910864255, 0.08979995031735268, 0.04898398695816771, 0.12278311706138607, 0.17886614412859533, -0.0649404982528226, 0.06851149452091759, -0.15425952888361996, -0.07923042659813566, -0.2572440504357501, -0.15351782482177828, -0.18356858817401878, 0.09096482569866841, 0.051902044300236, -0.09641530745571028, 0.42306082098123926, 0.2042457021377755, 0.22821879932466385, -0.032868747796976204, 0.2983261372287278, 0.08924814310916135, -0.04492261372929947, 0.028602762765138214, 0.2837503627789291, 0.19629743080903692, 0.10946208882060918, -0.3033612721897732, 0.039332640934982475, 0.011965991830396833] |
1,802.0862 | Irreducible 3-manifolds that cannot be obtained by 0-surgery on a knot | We give two infinite families of examples of closed, orientable, irreducible
3-manifolds $M$ such that $b_1(M)=1$ and $\pi_1(M)$ has weight 1, but $M$ is
not the result of Dehn surgery along a knot in the 3-sphere. This answers a
question of Aschenbrenner, Friedl and Wilton, and provides the first examples
of irreducible manifolds with $b_1=1$ that are known not to be surgery on a
knot in the 3-sphere. One family consists of Seifert fibered 3-manifolds, while
each member of the other family is not even homology cobordant to any Seifert
fibered 3-manifold. None of our examples are homology cobordant to any manifold
obtained by Dehn surgery along a knot in the 3-sphere.
| math.GT | we give two infinite families of examples of closed orientable irreducible 3manifolds m such that b_1m1 and pi_1m has weight 1 but m is not the result of dehn surgery along a knot in the 3sphere this answers a question of aschenbrenner friedl and wilton and provides the first examples of irreducible manifolds with b_11 that are known not to be surgery on a knot in the 3sphere one family consists of seifert fibered 3manifolds while each member of the other family is not even homology cobordant to any seifert fibered 3manifold none of our examples are homology cobordant to any manifold obtained by dehn surgery along a knot in the 3sphere | [['we', 'give', 'two', 'infinite', 'families', 'of', 'examples', 'of', 'closed', 'orientable', 'irreducible', '3manifolds', 'm', 'such', 'that', 'b_1m1', 'and', 'pi_1m', 'has', 'weight', '1', 'but', 'm', 'is', 'not', 'the', 'result', 'of', 'dehn', 'surgery', 'along', 'a', 'knot', 'in', 'the', '3sphere', 'this', 'answers', 'a', 'question', 'of', 'aschenbrenner', 'friedl', 'and', 'wilton', 'and', 'provides', 'the', 'first', 'examples', 'of', 'irreducible', 'manifolds', 'with', 'b_11', 'that', 'are', 'known', 'not', 'to', 'be', 'surgery', 'on', 'a', 'knot', 'in', 'the', '3sphere', 'one', 'family', 'consists', 'of', 'seifert', 'fibered', '3manifolds', 'while', 'each', 'member', 'of', 'the', 'other', 'family', 'is', 'not', 'even', 'homology', 'cobordant', 'to', 'any', 'seifert', 'fibered', '3manifold', 'none', 'of', 'our', 'examples', 'are', 'homology', 'cobordant', 'to', 'any', 'manifold', 'obtained', 'by', 'dehn', 'surgery', 'along', 'a', 'knot', 'in', 'the', '3sphere']] | [-0.2935323070830366, 0.09973495056120944, -0.1148892074790118, 0.07753124110188635, -0.1504096858136888, -0.24847814540511795, -0.031166712212975005, 0.36469483213399406, -0.2536503999227924, -0.3133052548260561, 0.11556186659332265, -0.29474469299228595, -0.1849338324661533, 0.23095314608820314, -0.23819092540985107, -0.03756110639577465, 0.13343099003291822, 0.1023156545124948, -0.05460792330476189, -0.3174470926346008, 0.4377220610372855, -0.12137593808334454, 0.0886426121495398, 0.1368963784556659, 0.1306773799795857, -0.06746165256065849, 0.005485436908202246, 0.014776418218389153, -0.2220937083980711, 0.08894787899927385, 0.3234478383258517, 0.002732541657418811, 0.096859861676681, -0.3425816459348425, -0.1595488728780765, 0.19675364468483686, 0.1719066705097378, -0.054529165002999695, -0.03804905723934228, -0.27766409570384504, 0.05829745086209316, -0.12463809349407841, -0.15448761354283697, -0.05970014809697334, 0.028574224054214677, -0.011843807638277732, -0.09135849942997863, -0.07812156250500786, 0.12727280690367998, 0.09963540101723213, -0.013408833425533626, -0.1159655918059538, -0.07525993468464419, 0.1891294122449056, 0.03838392860312264, 0.145719819810308, 0.08974440744662258, -0.08446933750903034, -0.16074727335944772, 0.3369155996177661, -0.07626677949312059, -0.3273773490384753, 0.11577618148710046, -0.13739080868046066, -0.2700863715674911, 0.27384844404878095, -0.01554723792027549, 0.13757622794115118, -0.007484475716150233, 0.12514168620119953, -0.17941695818028944, 0.07777100570300328, 0.10320865404459514, -0.10957840117459584, 0.15521052334224805, 0.055619661264440116, 0.10968718602920749, 0.1465523558181303, 0.026716796417271586, 0.015087559840009947, -0.30670143231067676, -0.2962570156336629, -0.16006912024126255, 0.1919882745947429, -0.10122878076968586, -0.19595972180832177, 0.4095076837776495, -0.0776276160447326, 0.1459393683887486, 0.19878857234393113, 0.2676175822354188, -0.08492394335813255, 0.09465972720395907, 0.1353616289312153, 0.10598193400073797, 0.15512810142120412, -0.10774046619397788, -0.04926541100888114, -0.045839825839721016, 0.25849754858063534] |
1,802.08621 | DataSite: Proactive Visual Data Exploration with Computation of
Insight-based Recommendations | Effective data analysis ideally requires the analyst to have high expertise
as well as high knowledge of the data. Even with such familiarity, manually
pursuing all potential hypotheses and exploring all possible views is
impractical. We present DataSite, a proactive visual analytics system where the
burden of selecting and executing appropriate computations is shared by an
automatic server-side computation engine. Salient features identified by these
automatic background processes are surfaced as notifications in a feed
timeline. DataSite effectively turns data analysis into a conversation between
analyst and computer, thereby reducing the cognitive load and domain knowledge
requirements. We validate the system with a user study comparing it to a recent
visualization recommendation system, yielding significant improvement,
particularly for complex analyses that existing analytics systems do not
support well.
| cs.HC | effective data analysis ideally requires the analyst to have high expertise as well as high knowledge of the data even with such familiarity manually pursuing all potential hypotheses and exploring all possible views is impractical we present datasite a proactive visual analytics system where the burden of selecting and executing appropriate computations is shared by an automatic serverside computation engine salient features identified by these automatic background processes are surfaced as notifications in a feed timeline datasite effectively turns data analysis into a conversation between analyst and computer thereby reducing the cognitive load and domain knowledge requirements we validate the system with a user study comparing it to a recent visualization recommendation system yielding significant improvement particularly for complex analyses that existing analytics systems do not support well | [['effective', 'data', 'analysis', 'ideally', 'requires', 'the', 'analyst', 'to', 'have', 'high', 'expertise', 'as', 'well', 'as', 'high', 'knowledge', 'of', 'the', 'data', 'even', 'with', 'such', 'familiarity', 'manually', 'pursuing', 'all', 'potential', 'hypotheses', 'and', 'exploring', 'all', 'possible', 'views', 'is', 'impractical', 'we', 'present', 'datasite', 'a', 'proactive', 'visual', 'analytics', 'system', 'where', 'the', 'burden', 'of', 'selecting', 'and', 'executing', 'appropriate', 'computations', 'is', 'shared', 'by', 'an', 'automatic', 'serverside', 'computation', 'engine', 'salient', 'features', 'identified', 'by', 'these', 'automatic', 'background', 'processes', 'are', 'surfaced', 'as', 'notifications', 'in', 'a', 'feed', 'timeline', 'datasite', 'effectively', 'turns', 'data', 'analysis', 'into', 'a', 'conversation', 'between', 'analyst', 'and', 'computer', 'thereby', 'reducing', 'the', 'cognitive', 'load', 'and', 'domain', 'knowledge', 'requirements', 'we', 'validate', 'the', 'system', 'with', 'a', 'user', 'study', 'comparing', 'it', 'to', 'a', 'recent', 'visualization', 'recommendation', 'system', 'yielding', 'significant', 'improvement', 'particularly', 'for', 'complex', 'analyses', 'that', 'existing', 'analytics', 'systems', 'do', 'not', 'support', 'well']] | [-0.10105892199475969, 0.0037189187558916664, -0.05701213853345031, 0.07556467257358784, -0.18948454498904682, -0.20536501930716136, 0.10729802197717603, 0.40155239527424175, -0.2218455348611026, -0.4034303730826766, 0.13717105860419068, -0.3026743635187842, -0.1427612723967445, 0.19615434289130101, -0.08405690115395127, 0.10478306554317002, 0.13235894121259215, 0.018593425542810963, -0.010739592698103349, -0.2515924537613515, 0.2894056447105305, 0.10800083775797652, 0.32122753781177815, 0.042889055261935385, 0.061347386833938165, 0.02103254109406696, -0.11979543851200669, -0.007717019874632122, -0.028824703527962334, 0.13471124072500046, 0.385383414089798, 0.24959258452087404, 0.34604169471218943, -0.4308623291759027, -0.22533736358736717, 0.06872626916239304, 0.17314746730133063, 0.07287398473330078, -0.06257705214629246, -0.33445705235418344, 0.09967281386932536, -0.18395468353899935, -0.042678180431562754, -0.17841407160518602, -0.0035033313158367363, -0.0014496309154238256, -0.27677662579697515, -0.028802576065774903, 0.07214037648084322, 0.12622129934329895, -0.03787232954646387, -0.07401891223927369, 0.0004704661486256454, 0.2291880124802923, 0.05175458296429179, 0.03905840247817752, 0.17994585214182734, -0.18261478728954755, -0.13942927191226137, 0.38919257725928985, 0.008925632760298275, -0.19236740648482245, 0.22161673163876883, -0.04659916557896409, -0.1527474940706429, 0.0974217119611918, 0.19743998790536785, 0.051529216277043495, -0.19401396954402564, 0.03279562343266748, 0.025445474524213564, 0.2091377342146607, 0.013996797122268213, 0.004648396967067605, 0.22657660460321322, 0.2512604675906163, 0.02506351314618119, 0.08896918584858733, -0.010880809744805216, -0.06193869133777399, -0.23644286203050305, -0.15111826588806238, -0.15424720092033523, -0.02040395861302617, -0.0885912695292583, -0.11720352175290741, 0.33629788942856803, 0.20299268677961893, 0.18501409670958915, 0.04314223505992679, 0.3906196704252608, 0.04193340516917127, 0.12542491590618968, 0.09922471867933397, 0.13015737587233567, -0.0360200909254629, 0.17425411116213552, -0.15117153728617325, 0.10260576119605777, -0.02768371437513639] |
1,802.08622 | Variable selection via Group LASSO Approach : Application to the Cox
Regression and frailty model | In the analysis of survival outcome supplemented with both clinical
information and high-dimensional gene expression data, use of the traditional
Cox proportional hazards model (1972) fails to meet some emerging needs in
biomedical research. First, the number of covariates is generally much larger
the sample size. Secondly, predicting an outcome based on individual gene
expression is inadequate because multiple biological processes and functional
pathways regulate the expression associated with a gene. Another challenge is
that the Cox model assumes that populations are homogenous, implying that all
individuals have the same risk of death, which is rarely true due to unmeasured
risk factors among populations. In this paper we propose group LASSO with
gamma-distributed frailty for variable selection in Cox regression by extending
previous scholarship to account for heterogeneity among group structures
related to exposure and susceptibility. The consistency property of the
proposed method is established. This method is appropriate for addressing a
wide variety of research questions from genetics to air pollution. Simulated
analysis shows promising performance by group LASSO compared with other
methods, including group SCAD and group MCP. Future directions include
expanding the use of frailty with adaptive group LASSO and sparse group LASS.
| stat.CO stat.ME | in the analysis of survival outcome supplemented with both clinical information and highdimensional gene expression data use of the traditional cox proportional hazards model 1972 fails to meet some emerging needs in biomedical research first the number of covariates is generally much larger the sample size secondly predicting an outcome based on individual gene expression is inadequate because multiple biological processes and functional pathways regulate the expression associated with a gene another challenge is that the cox model assumes that populations are homogenous implying that all individuals have the same risk of death which is rarely true due to unmeasured risk factors among populations in this paper we propose group lasso with gammadistributed frailty for variable selection in cox regression by extending previous scholarship to account for heterogeneity among group structures related to exposure and susceptibility the consistency property of the proposed method is established this method is appropriate for addressing a wide variety of research questions from genetics to air pollution simulated analysis shows promising performance by group lasso compared with other methods including group scad and group mcp future directions include expanding the use of frailty with adaptive group lasso and sparse group lass | [['in', 'the', 'analysis', 'of', 'survival', 'outcome', 'supplemented', 'with', 'both', 'clinical', 'information', 'and', 'highdimensional', 'gene', 'expression', 'data', 'use', 'of', 'the', 'traditional', 'cox', 'proportional', 'hazards', 'model', '1972', 'fails', 'to', 'meet', 'some', 'emerging', 'needs', 'in', 'biomedical', 'research', 'first', 'the', 'number', 'of', 'covariates', 'is', 'generally', 'much', 'larger', 'the', 'sample', 'size', 'secondly', 'predicting', 'an', 'outcome', 'based', 'on', 'individual', 'gene', 'expression', 'is', 'inadequate', 'because', 'multiple', 'biological', 'processes', 'and', 'functional', 'pathways', 'regulate', 'the', 'expression', 'associated', 'with', 'a', 'gene', 'another', 'challenge', 'is', 'that', 'the', 'cox', 'model', 'assumes', 'that', 'populations', 'are', 'homogenous', 'implying', 'that', 'all', 'individuals', 'have', 'the', 'same', 'risk', 'of', 'death', 'which', 'is', 'rarely', 'true', 'due', 'to', 'unmeasured', 'risk', 'factors', 'among', 'populations', 'in', 'this', 'paper', 'we', 'propose', 'group', 'lasso', 'with', 'gammadistributed', 'frailty', 'for', 'variable', 'selection', 'in', 'cox', 'regression', 'by', 'extending', 'previous', 'scholarship', 'to', 'account', 'for', 'heterogeneity', 'among', 'group', 'structures', 'related', 'to', 'exposure', 'and', 'susceptibility', 'the', 'consistency', 'property', 'of', 'the', 'proposed', 'method', 'is', 'established', 'this', 'method', 'is', 'appropriate', 'for', 'addressing', 'a', 'wide', 'variety', 'of', 'research', 'questions', 'from', 'genetics', 'to', 'air', 'pollution', 'simulated', 'analysis', 'shows', 'promising', 'performance', 'by', 'group', 'lasso', 'compared', 'with', 'other', 'methods', 'including', 'group', 'scad', 'and', 'group', 'mcp', 'future', 'directions', 'include', 'expanding', 'the', 'use', 'of', 'frailty', 'with', 'adaptive', 'group', 'lasso', 'and', 'sparse', 'group', 'lass']] | [-0.03385847079453572, 0.04141012236438228, -0.06805713775529697, 0.09955739292490762, -0.12494881083114948, -0.1729192611884934, 0.05803743374773909, 0.40337461843250355, -0.24586601237937503, -0.2770797821778652, 0.10957879865332981, -0.2772914130235927, -0.1910319262153317, 0.1881415078521003, -0.1356189870798238, 0.042555645507361205, 0.06536269848851478, 0.032427229633440774, 0.036556818891359415, -0.2896127232631944, 0.27986991330054684, 0.07949424060109091, 0.34374734135439655, -0.0331908136692934, 0.08412350033949205, 0.04411316494343384, -0.1085321797195784, 0.0185031135024845, -0.06500439105325406, 0.13929447952220786, 0.3355295425150258, 0.16871276541793606, 0.37748167856848247, -0.39062736234822926, -0.26946651172225494, 0.139450442663641, 0.11628087696605077, 0.07541088190199083, -0.030639538306823685, -0.2559800716972321, 0.03310112065453871, -0.18076190015563043, -0.10821647376857926, -0.07017737029747544, 0.003554262097316737, 0.03061700758122725, -0.30900467063148257, 0.1428404387647324, -0.011778050326808755, 0.10502921522604491, -0.07158462812991015, -0.17875896423831772, 0.0055481791032991395, 0.1363510471811442, 0.14080824949232176, 0.010135515515778062, 0.155597604523717, -0.11647088670561433, -0.1185641090221684, 0.3555992036245345, -0.028706719731788476, -0.19776863610485987, 0.20490590986721183, -0.13968038719328008, -0.17250441885921552, 0.10875102398977662, 0.18194556669201417, 0.05200909314218585, -0.2138873403036625, 0.04431407676376545, -0.02102592729070053, 0.13147273585105276, 0.03209484891540713, -0.024679580393332835, 0.1235344299526258, 0.21062909786076267, 0.05539566522098279, 0.08541996898254313, -0.10220752169802186, -0.08114727906055977, -0.24895942016838507, -0.12129464713685519, -0.12486026884348854, 0.00455594759040075, -0.11368654365614188, -0.18112345832894194, 0.35039788124398613, 0.16479289805640143, 0.16090816518705225, 0.07137193725377854, 0.26165109584927654, 0.03387181188484145, 0.09685338918792027, 0.05058614935545365, 0.11523846154916695, 0.13608943476252275, -0.0016022073580142186, -0.2229312016677387, 0.18572752376334095, 0.01204738892823914] |
1,802.08623 | 2D Navier-Stokes equation with cylindrical fractional Brownian noise | We consider the Navier-Stokes equation on the 2D torus, with a stochastic
forcing term which is a cylindrical fractional Wiener noise of Hurst parameter
$H$. Following [3,8] which dealt with the case $1/2$, we prove a local
existence and uniqueness result when $7/16< H< 1/ 2$ and a global existence and
uniqueness result when $ 1/2<H<1$.
| math.AP math.PR | we consider the navierstokes equation on the 2d torus with a stochastic forcing term which is a cylindrical fractional wiener noise of hurst parameter h following 38 which dealt with the case 12 we prove a local existence and uniqueness result when 716 h 1 2 and a global existence and uniqueness result when 12h1 | [['we', 'consider', 'the', 'navierstokes', 'equation', 'on', 'the', '2d', 'torus', 'with', 'a', 'stochastic', 'forcing', 'term', 'which', 'is', 'a', 'cylindrical', 'fractional', 'wiener', 'noise', 'of', 'hurst', 'parameter', 'h', 'following', '38', 'which', 'dealt', 'with', 'the', 'case', '12', 'we', 'prove', 'a', 'local', 'existence', 'and', 'uniqueness', 'result', 'when', '716', 'h', '1', '2', 'and', 'a', 'global', 'existence', 'and', 'uniqueness', 'result', 'when', '12h1']] | [-0.14348448443819176, 0.08713662639598954, -0.029596425559033048, 0.03973928711334752, -0.05523892999203368, -0.16558603066951036, -0.0005820654332637787, 0.2672975259748372, -0.28349372072314677, -0.26481665711511265, 0.19200362085618755, -0.2574201189574193, -0.12096004939892076, 0.12513704183088106, -0.08294651421972296, 0.048627024406397885, 0.06291925239969384, -0.010914391126822342, -0.018702521141279828, -0.2195562724405053, 0.3265331315892664, -0.07527590763162482, 0.15640921885655684, -0.0277026967568831, 0.1289318651352501, -0.008125747088342905, -0.05301955341446129, 0.041349975019693376, -0.24906239804219116, 0.026275027040074665, 0.1494751956991174, -0.030074553119696, 0.3448764156634835, -0.34764219734140417, -0.2256592258303003, 0.13671049871905283, 0.08097286424123343, 0.034256586699153886, -0.018088612927716564, -0.31020211066458037, 0.1116994897453961, -0.13110207476737826, -0.19092748339541935, -0.0026229910721833056, 0.0889220251490108, 0.05380788155916062, -0.35164734065871345, 0.1560256225395609, 0.19580417785116216, 0.055122938684441826, -0.137625629928979, -0.09516417103904215, -0.053562539392574264, 0.019824002019595353, 0.0468022872461006, 0.06465833533385938, 0.06455531099133871, -0.12237138392573053, -0.11535864452069455, 0.32272998533126984, -0.14397873798893257, -0.28685492816042496, 0.17526793019338088, -0.1743247332220728, -0.1299005255949768, 0.12573603168976577, 0.08848085990598933, 0.10767860972237858, -0.09904946443804709, 0.14575940874003043, -0.1044333512132818, 0.18018243951214985, 0.1038568598810922, -0.025677971965210003, 0.030988847320391373, 0.12967968697405674, 0.2042114534923299, 0.13371253294700927, -0.12454111346953803, -0.0772113574668765, -0.33948265346275136, -0.15893847536803646, -0.15046766681427307, 0.17469559213231234, -0.1527669071550587, -0.17643873474814675, 0.3596965039995584, 0.0984811333431439, 0.18770303768529134, 0.07905623233739541, 0.1999778227372603, 0.16265544667840004, -0.1004218756983226, 0.11402867523614656, 0.17731469761241567, 0.17993095544251528, 0.13731632040474903, -0.17588588338853284, -0.022583871834318748, 0.15505418963730336] |
1,802.08624 | Novel Edge States in Self-Dual Gravity | In contrast to the Einstein-Hilbert action, the action for self-dual gravity
contains vierbeins. They are eleminated at the level of observables by an
$SL(2,\mathbb{C})$ gauge condition implied by the action. We argue that despite
this condition, new "edge" or superselected state vectors corresponding to maps
of the spheres $S^2_{\infty}$ at infinity to $SL(2, \mathbb{C})$ arise. They
are characterised by new quantum numbers and they lead to mixed states. For
black holes, they arise both at the horizon and the spatial infinity and may be
relevant for the black hole information paradox. Similar comments can be made
about the Einstein-Palatini action which uses vierbeins.
| hep-th gr-qc | in contrast to the einsteinhilbert action the action for selfdual gravity contains vierbeins they are eleminated at the level of observables by an sl2mathbbc gauge condition implied by the action we argue that despite this condition new edge or superselected state vectors corresponding to maps of the spheres s2_infty at infinity to sl2 mathbbc arise they are characterised by new quantum numbers and they lead to mixed states for black holes they arise both at the horizon and the spatial infinity and may be relevant for the black hole information paradox similar comments can be made about the einsteinpalatini action which uses vierbeins | [['in', 'contrast', 'to', 'the', 'einsteinhilbert', 'action', 'the', 'action', 'for', 'selfdual', 'gravity', 'contains', 'vierbeins', 'they', 'are', 'eleminated', 'at', 'the', 'level', 'of', 'observables', 'by', 'an', 'sl2mathbbc', 'gauge', 'condition', 'implied', 'by', 'the', 'action', 'we', 'argue', 'that', 'despite', 'this', 'condition', 'new', 'edge', 'or', 'superselected', 'state', 'vectors', 'corresponding', 'to', 'maps', 'of', 'the', 'spheres', 's2_infty', 'at', 'infinity', 'to', 'sl2', 'mathbbc', 'arise', 'they', 'are', 'characterised', 'by', 'new', 'quantum', 'numbers', 'and', 'they', 'lead', 'to', 'mixed', 'states', 'for', 'black', 'holes', 'they', 'arise', 'both', 'at', 'the', 'horizon', 'and', 'the', 'spatial', 'infinity', 'and', 'may', 'be', 'relevant', 'for', 'the', 'black', 'hole', 'information', 'paradox', 'similar', 'comments', 'can', 'be', 'made', 'about', 'the', 'einsteinpalatini', 'action', 'which', 'uses', 'vierbeins']] | [-0.1570641841812461, 0.17573309841513857, -0.09840236092442829, 0.11510664953361723, -0.09092617467246658, -0.1657691857847157, -0.014451514452458451, 0.32265399573553427, -0.25148214370596644, -0.26945240823004174, 0.12936802643383213, -0.32183456168893504, -0.10663168070102841, 0.14661440718234242, -0.12105452535244837, 0.008227760761442101, 0.03309440450268049, 0.10785966910714027, -0.08237724941108016, -0.25347827831123426, 0.37364095173474837, 0.056515419840876595, 0.2152194722336443, 0.02564865599532484, 0.11627968408135406, -0.017736358613725387, 0.013089784688953146, 0.03771313222344307, -0.10436471015953644, 0.08119893150447466, 0.2507974105549282, 0.10154699699327752, 0.18421760343891733, -0.4450016632383945, -0.1916107827792967, 0.0791309388701384, 0.11822090455897007, 0.14946627565636755, 0.011215139563907595, -0.33851246263685764, 0.08516044273753376, -0.15567294000556656, -0.14227927784440017, -0.08117060466012095, 0.001019650787188142, -0.08119987588211455, -0.230303625649243, 0.07768378263983108, 0.062324423610013634, 0.0020658824907834918, -0.060711639572628866, -0.08602371435685485, -0.06882335445113189, 0.13827575976029038, 0.0992113066946759, 0.03924719860244259, 0.13742720900906943, -0.16142167847155017, -0.11696712298355266, 0.36597789175735385, -0.05767174243844826, -0.2438309448451607, 0.18642477367036775, -0.18121866483296104, -0.136384286470346, 0.11027925822646449, 0.11304457105842292, 0.13926314167660095, -0.09339765936830173, 0.13075881514198365, -0.022375457879046306, 0.10660237052897904, 0.14003754991983228, 0.09088214023002222, 0.32188027131133806, 0.009046272968179454, 0.04346704962617699, 0.10494198500607893, -0.0031191910680967803, -0.09491075939663193, -0.34438119410518925, -0.13990721415999965, -0.12571103063722452, 0.10367367005171985, -0.11620429837371464, -0.12567690065970608, 0.30498114748693567, 0.11065983525865401, 0.1859090272291545, 0.04843614530845491, 0.14923327498546118, 0.1318415224543024, 0.11216714216724914, 0.10251430815597083, 0.23500064786468797, 0.10162317864916415, 0.05763262729320273, -0.18171337232285856, -0.04707430403076989, 0.11835989438673007] |
1,802.08625 | On polar actions invariant solutions of semilinear equations on
manifolds | In this paper we put together some tools from differential topology and
analysis in order to study second order semi-linear partial differential
equations on a Riemannian manifold $M$. We look for solutions that are
constants along orbits of a given group action. Using some results obtained by
Helgason in [J DIFFER GEOM,6(3), 411-419] we are able to write a (reduced)
second order semi-linear problem on a submanifold $\Sigma$. This submanifold
is, in certain sense, transversal to the orbits of the group actions and its
existence is assumed. We describe precise conditions on the Riemannian Manifold
$M$ and the submanifold $\Sigma$ in order to be able to write the reduced
equation on $\Sigma$. These conditions are satisfied by several particular
cases including some examples treated separately in the literature such as the
sphere, surfaces of revolution and others. Our framework also includes the
setup of polar actions or exponential coordinates. Using this procedure, we are
left with a second order semi-linear equation posed on a submanifold. In
particular, if the submanifold $\Sigma$ is one-dimensional, we can use suitable
tools from analysis to obtain existence and properties of solutions.
| math.DG math.AP | in this paper we put together some tools from differential topology and analysis in order to study second order semilinear partial differential equations on a riemannian manifold m we look for solutions that are constants along orbits of a given group action using some results obtained by helgason in j differ geom63 411419 we are able to write a reduced second order semilinear problem on a submanifold sigma this submanifold is in certain sense transversal to the orbits of the group actions and its existence is assumed we describe precise conditions on the riemannian manifold m and the submanifold sigma in order to be able to write the reduced equation on sigma these conditions are satisfied by several particular cases including some examples treated separately in the literature such as the sphere surfaces of revolution and others our framework also includes the setup of polar actions or exponential coordinates using this procedure we are left with a second order semilinear equation posed on a submanifold in particular if the submanifold sigma is onedimensional we can use suitable tools from analysis to obtain existence and properties of solutions | [['in', 'this', 'paper', 'we', 'put', 'together', 'some', 'tools', 'from', 'differential', 'topology', 'and', 'analysis', 'in', 'order', 'to', 'study', 'second', 'order', 'semilinear', 'partial', 'differential', 'equations', 'on', 'a', 'riemannian', 'manifold', 'm', 'we', 'look', 'for', 'solutions', 'that', 'are', 'constants', 'along', 'orbits', 'of', 'a', 'given', 'group', 'action', 'using', 'some', 'results', 'obtained', 'by', 'helgason', 'in', 'j', 'differ', 'geom63', '411419', 'we', 'are', 'able', 'to', 'write', 'a', 'reduced', 'second', 'order', 'semilinear', 'problem', 'on', 'a', 'submanifold', 'sigma', 'this', 'submanifold', 'is', 'in', 'certain', 'sense', 'transversal', 'to', 'the', 'orbits', 'of', 'the', 'group', 'actions', 'and', 'its', 'existence', 'is', 'assumed', 'we', 'describe', 'precise', 'conditions', 'on', 'the', 'riemannian', 'manifold', 'm', 'and', 'the', 'submanifold', 'sigma', 'in', 'order', 'to', 'be', 'able', 'to', 'write', 'the', 'reduced', 'equation', 'on', 'sigma', 'these', 'conditions', 'are', 'satisfied', 'by', 'several', 'particular', 'cases', 'including', 'some', 'examples', 'treated', 'separately', 'in', 'the', 'literature', 'such', 'as', 'the', 'sphere', 'surfaces', 'of', 'revolution', 'and', 'others', 'our', 'framework', 'also', 'includes', 'the', 'setup', 'of', 'polar', 'actions', 'or', 'exponential', 'coordinates', 'using', 'this', 'procedure', 'we', 'are', 'left', 'with', 'a', 'second', 'order', 'semilinear', 'equation', 'posed', 'on', 'a', 'submanifold', 'in', 'particular', 'if', 'the', 'submanifold', 'sigma', 'is', 'onedimensional', 'we', 'can', 'use', 'suitable', 'tools', 'from', 'analysis', 'to', 'obtain', 'existence', 'and', 'properties', 'of', 'solutions']] | [-0.16793903957649664, 0.037721251980779136, -0.060034471553926536, 0.062446271882367295, -0.12765643814880703, -0.11893119088348908, -0.0007395378458691207, 0.34874086634608337, -0.25410111002825403, -0.26058895179397756, 0.15910323237861834, -0.30456168932487837, -0.16308338459505625, 0.197876795578899, -0.10702016316102565, 0.05292911436880712, 0.07159070314562603, 0.08644252300287622, -0.10313653829381675, -0.260480646754464, 0.3969938338809722, -0.04315098994537383, 0.168107680393213, 0.009340281437176304, 0.12064864706575266, -0.01989266158465447, -0.005477931652520154, 0.039735172041508955, -0.20965745555810358, 0.11931838915192497, 0.24125748514433742, 0.07257208799364398, 0.2143817499431001, -0.42913138088644354, -0.18766493103592782, 0.11231770119755655, 0.11072457426202459, 0.0766180926430467, -0.008036981842077866, -0.30890293291241333, 0.11477888120791396, -0.11203742428003131, -0.18253002998393936, -0.11394286090759813, 0.011011802817921381, 0.017013584901704577, -0.2288390581873623, 0.027357003720621956, 0.09319114836839003, 0.04146703962312155, -0.08550625921768212, -0.0826251570160526, -0.017401390826027537, 0.10744733147549669, 0.05583628966296847, 0.03908002271342116, 0.07631015393480256, -0.061066548152499504, -0.06227996754648819, 0.40344657488167285, -0.1096281460517816, -0.3217000779469271, 0.16257005088987786, -0.1546130585156985, -0.15105458366105684, 0.09768780256193635, 0.19341876921621529, 0.16954064349568373, -0.15064632378367557, 0.1501866948045161, -0.039748324658344124, 0.1315627374949022, 0.08495181978277459, -0.030500722986117407, 0.10242690078511431, 0.11748972424129779, 0.12162779404945369, 0.09912549189631702, -0.017763284736036045, -0.07724019602645893, -0.36763212596242495, -0.16971040354991282, -0.09380668321548885, 0.1051363728197946, -0.05681070331586336, -0.1204994323789268, 0.3733885712116151, 0.09503911038155893, 0.198805338705613, 0.05599421675889627, 0.22492769028790094, 0.1349121391999762, 0.0037922216453463646, 0.0936083883067162, 0.15892706981882126, 0.18233847370169856, 0.06669468762529258, -0.14914194405428133, -0.0054480982239584665, 0.12776040714611678] |
1,802.08626 | Empirical Risk Minimization under Fairness Constraints | We address the problem of algorithmic fairness: ensuring that sensitive
variables do not unfairly influence the outcome of a classifier. We present an
approach based on empirical risk minimization, which incorporates a fairness
constraint into the learning problem. It encourages the conditional risk of the
learned classifier to be approximately constant with respect to the sensitive
variable. We derive both risk and fairness bounds that support the statistical
consistency of our approach. We specify our approach to kernel methods and
observe that the fairness requirement implies an orthogonality constraint which
can be easily added to these methods. We further observe that for linear models
the constraint translates into a simple data preprocessing step. Experiments
indicate that the method is empirically effective and performs favorably
against state-of-the-art approaches.
| stat.ML cs.LG | we address the problem of algorithmic fairness ensuring that sensitive variables do not unfairly influence the outcome of a classifier we present an approach based on empirical risk minimization which incorporates a fairness constraint into the learning problem it encourages the conditional risk of the learned classifier to be approximately constant with respect to the sensitive variable we derive both risk and fairness bounds that support the statistical consistency of our approach we specify our approach to kernel methods and observe that the fairness requirement implies an orthogonality constraint which can be easily added to these methods we further observe that for linear models the constraint translates into a simple data preprocessing step experiments indicate that the method is empirically effective and performs favorably against stateoftheart approaches | [['we', 'address', 'the', 'problem', 'of', 'algorithmic', 'fairness', 'ensuring', 'that', 'sensitive', 'variables', 'do', 'not', 'unfairly', 'influence', 'the', 'outcome', 'of', 'a', 'classifier', 'we', 'present', 'an', 'approach', 'based', 'on', 'empirical', 'risk', 'minimization', 'which', 'incorporates', 'a', 'fairness', 'constraint', 'into', 'the', 'learning', 'problem', 'it', 'encourages', 'the', 'conditional', 'risk', 'of', 'the', 'learned', 'classifier', 'to', 'be', 'approximately', 'constant', 'with', 'respect', 'to', 'the', 'sensitive', 'variable', 'we', 'derive', 'both', 'risk', 'and', 'fairness', 'bounds', 'that', 'support', 'the', 'statistical', 'consistency', 'of', 'our', 'approach', 'we', 'specify', 'our', 'approach', 'to', 'kernel', 'methods', 'and', 'observe', 'that', 'the', 'fairness', 'requirement', 'implies', 'an', 'orthogonality', 'constraint', 'which', 'can', 'be', 'easily', 'added', 'to', 'these', 'methods', 'we', 'further', 'observe', 'that', 'for', 'linear', 'models', 'the', 'constraint', 'translates', 'into', 'a', 'simple', 'data', 'preprocessing', 'step', 'experiments', 'indicate', 'that', 'the', 'method', 'is', 'empirically', 'effective', 'and', 'performs', 'favorably', 'against', 'stateoftheart', 'approaches']] | [-0.05447293212499807, -0.008907976570148681, -0.14797170219693598, 0.11533661850445764, -0.12508598847432048, -0.18982222885458078, 0.11825866633879505, 0.4282498910553812, -0.2827327941401356, -0.30846214273763, 0.09170123642882494, -0.2552666268604771, -0.1604470785058243, 0.1685031467118744, -0.13084715370851474, 0.08899309483950767, 0.10143672306284007, 0.04836097153593001, -0.060393535761221306, -0.3208261795312636, 0.3137082290362684, 0.07498374931132934, 0.34147909322504216, 0.07289887067502526, 0.12636509644120608, -0.0138441629847145, -0.02188293168808913, 0.07524828308474595, -0.09315670448073275, 0.15126911588893163, 0.25366397212777037, 0.2555201818880544, 0.3615729668375662, -0.395705221039353, -0.19486939053483834, 0.10663109468516167, 0.09777643106965803, 0.07027832045234506, 0.005287517913558528, -0.2705181274181745, 0.07609310293914824, -0.17144147387346415, -0.03939406126077602, -0.15580090314083858, -0.10566888164406217, -0.009950005889349566, -0.37401295094714154, 0.06577489165819295, 0.10380130036052053, -0.009552703261023431, -0.09156327107994575, -0.12142502692872732, 0.03821675888974014, 0.10246497762983474, 0.10591354633050817, 0.031028417463407038, 0.13906304664381847, -0.08772835267641706, -0.12948036958705486, 0.36781636385731104, -0.07311751144960171, -0.23937081063063595, 0.16823362260250244, -0.023431336103872522, -0.17163822460574957, 0.0728238535179632, 0.21160917084546774, 0.08645979947168526, -0.16022477794702597, 0.020185043799276575, -0.05515348597789022, 0.20480769585935385, -0.007648638483525555, 0.03277659727861797, 0.1385797304211287, 0.18241544263290727, 0.12806319754284726, 0.1482841751160555, -0.07072132361473471, -0.07822299230015126, -0.26943044238320485, -0.1145993250488179, -0.15185117100064796, -0.045429074148510905, -0.13045479185335196, -0.1343923752648961, 0.35960856832446547, 0.24580558212693987, 0.19112570566220546, 0.15666874616010862, 0.34259876491516594, 0.13535244544550012, 0.0973814570970144, 0.11018509299523659, 0.22702748439179396, 0.04712300926564247, 0.02533794756553422, -0.2332429076493608, 0.13556377573386127, 0.03698937306693924] |
1,802.08627 | Generation and detection of dissipationless spin current in MgO/Si
bilayer | Spintronics is an analogue to electronics where spin of the electron rather
than its charge is functionally controlled for devices. The generation and
detection of spin current without ferromagnetic or exotic/scarce materials are
two the biggest challenges for spintronics devices. In this study, we report a
solution to the two problems of spin current generation and detection in Si.
Using non-local measurement, we experimentally demonstrate the generation of
helical dissipationless spin current using spin-Hall effect. Contrary to the
theoretical prediction, we observe the spin-Hall effect in both n-doped and
p-doped Si. The helical spin current is attributed to the site-inversion
asymmetry of the diamond cubic lattice of Si and structure inversion asymmetry
in MgO/Si bilayer. The spin to charge conversion in Si is insignificant due to
weak spin-orbit coupling. For the efficient detection of spin current, we
report spin to charge conversion at the MgO (1nm)/Si (2 um) (p-doped and
n-doped) thin film interface due to Rashba spin-orbit coupling. We detected the
spin current at a distance of >100 um, which is an order of magnitude larger
than the longest spin diffusion length measured using spin injection
techniques. The existence of spin current in Si is verified from coercivity
reduction in Co/Pd multilayer due to spin-orbit torque generated by spin
current from Si.
| cond-mat.mes-hall cond-mat.mtrl-sci | spintronics is an analogue to electronics where spin of the electron rather than its charge is functionally controlled for devices the generation and detection of spin current without ferromagnetic or exoticscarce materials are two the biggest challenges for spintronics devices in this study we report a solution to the two problems of spin current generation and detection in si using nonlocal measurement we experimentally demonstrate the generation of helical dissipationless spin current using spinhall effect contrary to the theoretical prediction we observe the spinhall effect in both ndoped and pdoped si the helical spin current is attributed to the siteinversion asymmetry of the diamond cubic lattice of si and structure inversion asymmetry in mgosi bilayer the spin to charge conversion in si is insignificant due to weak spinorbit coupling for the efficient detection of spin current we report spin to charge conversion at the mgo 1nmsi 2 um pdoped and ndoped thin film interface due to rashba spinorbit coupling we detected the spin current at a distance of 100 um which is an order of magnitude larger than the longest spin diffusion length measured using spin injection techniques the existence of spin current in si is verified from coercivity reduction in copd multilayer due to spinorbit torque generated by spin current from si | [['spintronics', 'is', 'an', 'analogue', 'to', 'electronics', 'where', 'spin', 'of', 'the', 'electron', 'rather', 'than', 'its', 'charge', 'is', 'functionally', 'controlled', 'for', 'devices', 'the', 'generation', 'and', 'detection', 'of', 'spin', 'current', 'without', 'ferromagnetic', 'or', 'exoticscarce', 'materials', 'are', 'two', 'the', 'biggest', 'challenges', 'for', 'spintronics', 'devices', 'in', 'this', 'study', 'we', 'report', 'a', 'solution', 'to', 'the', 'two', 'problems', 'of', 'spin', 'current', 'generation', 'and', 'detection', 'in', 'si', 'using', 'nonlocal', 'measurement', 'we', 'experimentally', 'demonstrate', 'the', 'generation', 'of', 'helical', 'dissipationless', 'spin', 'current', 'using', 'spinhall', 'effect', 'contrary', 'to', 'the', 'theoretical', 'prediction', 'we', 'observe', 'the', 'spinhall', 'effect', 'in', 'both', 'ndoped', 'and', 'pdoped', 'si', 'the', 'helical', 'spin', 'current', 'is', 'attributed', 'to', 'the', 'siteinversion', 'asymmetry', 'of', 'the', 'diamond', 'cubic', 'lattice', 'of', 'si', 'and', 'structure', 'inversion', 'asymmetry', 'in', 'mgosi', 'bilayer', 'the', 'spin', 'to', 'charge', 'conversion', 'in', 'si', 'is', 'insignificant', 'due', 'to', 'weak', 'spinorbit', 'coupling', 'for', 'the', 'efficient', 'detection', 'of', 'spin', 'current', 'we', 'report', 'spin', 'to', 'charge', 'conversion', 'at', 'the', 'mgo', '1nmsi', '2', 'um', 'pdoped', 'and', 'ndoped', 'thin', 'film', 'interface', 'due', 'to', 'rashba', 'spinorbit', 'coupling', 'we', 'detected', 'the', 'spin', 'current', 'at', 'a', 'distance', 'of', '100', 'um', 'which', 'is', 'an', 'order', 'of', 'magnitude', 'larger', 'than', 'the', 'longest', 'spin', 'diffusion', 'length', 'measured', 'using', 'spin', 'injection', 'techniques', 'the', 'existence', 'of', 'spin', 'current', 'in', 'si', 'is', 'verified', 'from', 'coercivity', 'reduction', 'in', 'copd', 'multilayer', 'due', 'to', 'spinorbit', 'torque', 'generated', 'by', 'spin', 'current', 'from', 'si']] | [-0.16987631870790176, 0.1724449533638578, 0.07211306963770976, -0.01830013926780413, -0.04945736333647627, -0.14933938172347308, 0.004573994223696835, 0.40404437566577106, -0.28690488640949774, -0.30731198319086905, 0.03219690158323755, -0.3122474992754713, -0.07452113402263222, 0.22704760591125195, 0.047670743918340454, -0.007511262119353335, -0.04412877390998901, -0.0867996301833968, -0.10071946207754777, -0.17887837382069116, 0.23902282331352742, 0.012773726879659168, 0.3569119898234739, 0.11671393773291242, 0.06556753344771465, 0.01076144269672022, 0.08447095182274232, -0.008958729549921586, -0.11717047997968691, 0.09153062835086191, 0.23506345500518974, -0.11324000514544653, 0.16045314456674864, -0.5034678726318921, -0.1455001304208515, 0.018253438946741977, 0.09869045411954014, 0.21585541384564222, -0.09869794384799185, -0.26257273410424664, 0.09189523654682429, -0.18011126134090089, -0.09062559296625987, -0.022329201823786685, 0.035189990156985214, -0.06089151002640466, -0.251115566287212, 0.09835260531544222, 0.09676701636566072, 0.06227343408702806, -0.05039919774578862, -0.12943380022127376, -0.09933567210657603, 0.015983866949891002, 0.039695890301740484, 0.04393462409960489, 0.21082231838564705, -0.1495492537210709, -0.20034055462169448, 0.32885917244951407, -0.0967662625392714, -0.15327618003301502, 0.13902712302754797, -0.20417972951102556, -0.029859418082875355, 0.12229797946574371, 0.13166745266605293, 0.10624412452672835, -0.13149255488995845, 0.052773826700717695, 0.04469292316781847, 0.17179823756378376, 0.03028252769626998, 0.08927947955883363, 0.294122057570296, 0.2490730516419804, 0.08256140885803331, 0.10273931394654223, -0.2090277051548674, -0.02787303689167652, -0.17747952199082054, -0.20596328866111036, -0.2523083651179902, 0.1426398969259844, -0.04855567414716552, -0.13924804346136857, 0.41747091177173634, 0.22305510290029446, 0.1288517815234701, -0.06154587105502548, 0.30846794194911725, 0.11207877216374938, 0.10619752334306043, -0.0022855023496993706, 0.29136175392852853, 0.1978378745723899, 0.12204275291941394, -0.3277064188807962, 0.11220530679050619, -0.034920468623415704] |
1,802.08628 | Conditional infimum and recovery of monotone processes | Monotone processes, just like martingales, can often be recovered from their
final values. Examples include running maxima of supermartingales, as well as
running maxima, local times, and various integral functionals of sticky
processes such as fractional Brownian motion. An interesting corollary is that
any positive local martingale can be reconstructed from its final value and its
global maximum. These results rely on the notion of conditional infimum, which
is developed for a large class of complete lattices. The framework is
sufficiently general to handle also more exotic examples, such as the process
of convex hulls of certain multidimensional processes, and the process of sites
visited by a random walk.
| math.PR | monotone processes just like martingales can often be recovered from their final values examples include running maxima of supermartingales as well as running maxima local times and various integral functionals of sticky processes such as fractional brownian motion an interesting corollary is that any positive local martingale can be reconstructed from its final value and its global maximum these results rely on the notion of conditional infimum which is developed for a large class of complete lattices the framework is sufficiently general to handle also more exotic examples such as the process of convex hulls of certain multidimensional processes and the process of sites visited by a random walk | [['monotone', 'processes', 'just', 'like', 'martingales', 'can', 'often', 'be', 'recovered', 'from', 'their', 'final', 'values', 'examples', 'include', 'running', 'maxima', 'of', 'supermartingales', 'as', 'well', 'as', 'running', 'maxima', 'local', 'times', 'and', 'various', 'integral', 'functionals', 'of', 'sticky', 'processes', 'such', 'as', 'fractional', 'brownian', 'motion', 'an', 'interesting', 'corollary', 'is', 'that', 'any', 'positive', 'local', 'martingale', 'can', 'be', 'reconstructed', 'from', 'its', 'final', 'value', 'and', 'its', 'global', 'maximum', 'these', 'results', 'rely', 'on', 'the', 'notion', 'of', 'conditional', 'infimum', 'which', 'is', 'developed', 'for', 'a', 'large', 'class', 'of', 'complete', 'lattices', 'the', 'framework', 'is', 'sufficiently', 'general', 'to', 'handle', 'also', 'more', 'exotic', 'examples', 'such', 'as', 'the', 'process', 'of', 'convex', 'hulls', 'of', 'certain', 'multidimensional', 'processes', 'and', 'the', 'process', 'of', 'sites', 'visited', 'by', 'a', 'random', 'walk']] | [-0.04915099128239164, 0.14552499365967744, -0.08983360111303286, 0.12206231836041188, -0.06712101198681587, -0.12614785859344202, 0.04165215253586445, 0.356455977288408, -0.32752791601617676, -0.27067699090261527, 0.1801141574786583, -0.2648411578661121, -0.15410309984699028, 0.21365789106807784, -0.0771411548479708, 0.09991421648998074, 0.06568627077642905, 0.029597966649800266, -0.030858748377762188, -0.2510628185636543, 0.2802661183768661, 0.009546859993026891, 0.19689027044426546, 0.038731059837026884, 0.11702173893604803, 0.03899116027211651, -0.032871678988492, 0.04946748462907218, -0.11933626720945857, 0.07455394090323628, 0.22263357614021784, 0.12521662217470894, 0.2902335818865499, -0.4249385590365994, -0.17447438539612456, 0.17365845207364186, 0.11234771990251445, 0.06680237931955538, 0.0013588641500773353, -0.3247164793210019, 0.05688839618099529, -0.11521063348782513, -0.13162291574146634, -0.10966261337861555, 0.041211353905430625, 0.11137967990762597, -0.31824031436320294, 0.0775039064024528, 0.11550443749255372, 0.02750240936725819, -0.02730735264282776, -0.14083680627897485, -0.05460099496242137, 0.12019721162291842, 0.0601073303745863, 0.02039567095659024, 0.19217505573867522, -0.10111978884846178, -0.19520236003221175, 0.3632129907710563, -0.07401165696407813, -0.21736156476080554, 0.21951859517860303, -0.14792707720087891, -0.12462566248696605, 0.1399985330153701, 0.18413768405385247, 0.17434549739439076, -0.16796711466591294, 0.1159060808019328, -0.0642699242458431, 0.052663287968127005, 0.06266949569310891, 0.07204065433478543, 0.16293357765951424, 0.10690014504981356, 0.1624447557425827, 0.13618545614422187, -0.012216553517613013, -0.14401695261700848, -0.34568268142708947, -0.1583162341138707, -0.22950451793747212, 0.0945925678023983, -0.16845064402577667, -0.213879990382889, 0.3486626103152991, 0.07983185640972006, 0.22883585869514067, 0.09605372127747898, 0.21950566731051568, 0.15988009157718733, 0.04008642617194409, 0.04870141547711549, 0.12045852426405347, 0.10315724679508136, 0.061216303275539244, -0.1003709649709865, 0.11685977047821934, 0.09045833908235056] |
1,802.08629 | Gaussian ancillary bombardment | We analyze in full detail the time evolution of an open Gaussian quantum
system rapidly bombarded by Gaussian ancillae. As a particular case this
analysis covers the thermalization (or not) of a harmonic oscillator coupled to
a thermal reservoir made of harmonic oscillators. We derive general results for
this scenario and apply them to the problem of thermalization. We show that
only a particular family of system-environment couplings will cause the system
to thermalize to the temperature of its environment. We discuss that if we want
to understand thermalization as ensuing from the Markovian interaction of a
system with the individual microconstituents of its (thermal) environment then
the process of thermalization is not as robust as one might expect.
| quant-ph | we analyze in full detail the time evolution of an open gaussian quantum system rapidly bombarded by gaussian ancillae as a particular case this analysis covers the thermalization or not of a harmonic oscillator coupled to a thermal reservoir made of harmonic oscillators we derive general results for this scenario and apply them to the problem of thermalization we show that only a particular family of systemenvironment couplings will cause the system to thermalize to the temperature of its environment we discuss that if we want to understand thermalization as ensuing from the markovian interaction of a system with the individual microconstituents of its thermal environment then the process of thermalization is not as robust as one might expect | [['we', 'analyze', 'in', 'full', 'detail', 'the', 'time', 'evolution', 'of', 'an', 'open', 'gaussian', 'quantum', 'system', 'rapidly', 'bombarded', 'by', 'gaussian', 'ancillae', 'as', 'a', 'particular', 'case', 'this', 'analysis', 'covers', 'the', 'thermalization', 'or', 'not', 'of', 'a', 'harmonic', 'oscillator', 'coupled', 'to', 'a', 'thermal', 'reservoir', 'made', 'of', 'harmonic', 'oscillators', 'we', 'derive', 'general', 'results', 'for', 'this', 'scenario', 'and', 'apply', 'them', 'to', 'the', 'problem', 'of', 'thermalization', 'we', 'show', 'that', 'only', 'a', 'particular', 'family', 'of', 'systemenvironment', 'couplings', 'will', 'cause', 'the', 'system', 'to', 'thermalize', 'to', 'the', 'temperature', 'of', 'its', 'environment', 'we', 'discuss', 'that', 'if', 'we', 'want', 'to', 'understand', 'thermalization', 'as', 'ensuing', 'from', 'the', 'markovian', 'interaction', 'of', 'a', 'system', 'with', 'the', 'individual', 'microconstituents', 'of', 'its', 'thermal', 'environment', 'then', 'the', 'process', 'of', 'thermalization', 'is', 'not', 'as', 'robust', 'as', 'one', 'might', 'expect']] | [-0.12485269664497185, 0.15436643896687546, -0.09677570307736888, 0.05786089227736173, -0.00732957518917798, -0.14985696107790875, 0.04736046864604186, 0.3693158721332164, -0.27966656329055484, -0.2256762415381978, 0.10110060620109919, -0.24985040138874734, -0.11602935127785798, 0.1878246503623844, -0.03276634809537595, 0.016066366559121477, 0.08418124622935351, 0.06663827354894529, -0.03588557459351396, -0.24799375018464917, 0.33843732829510914, 0.07262050196383649, 0.1962861542965622, 0.060924141479953495, 0.08601967349820652, 0.007793881398226533, 0.04524710066146961, -0.013760948737598016, -0.10436965034701842, 0.06096563038138375, 0.20760570534655606, 0.11929566370902442, 0.2850464422866201, -0.43845456658604265, -0.22068216799594023, 0.1345573645985114, 0.15349255205805123, 0.16635480234712488, -0.0060753743712078125, -0.24825432665642164, 0.008433836310741906, -0.18915243809181853, -0.18690372782782846, -0.0877521247001357, 0.008230420815594056, -0.001631483729114803, -0.2533795947850752, 0.06899543053337506, 0.11282446357312009, -0.0030175100605027015, -0.03791221313202018, -0.011995797432927774, -0.015497388776016086, 0.13386751303425795, 0.011959813713015863, -0.01230623320277248, 0.17403487535976186, -0.114454403961813, -0.0825731196820329, 0.39503042784298403, -0.11536217269002452, -0.17412626994147645, 0.24311017435329707, -0.15047913357740691, -0.1308861304927586, 0.06533590855249086, 0.1948129098682406, 0.08764677552287192, -0.20312365003227562, 0.05320083073627971, -0.014094281839911177, 0.1776434179823924, 0.009755061602830385, 0.05978444167618256, 0.20887728784812473, 0.17100999225322314, 0.04355800839360146, 0.20904564204970139, -0.0468624044396081, -0.1157819314648499, -0.31011210037630144, -0.1664479654595381, -0.18807689370117894, 0.11842884325168972, -0.03438600410006357, -0.1687913441897503, 0.3975408043900207, 0.20674439627645896, 0.18048227302917913, 0.04363370163389677, 0.2645593934395045, 0.12671281470518028, 0.006919298923629171, 0.051267278791569615, 0.24199583606027505, 0.14392377371398904, 0.1107827490978256, -0.26018101714371444, 0.01290743051002882, -0.013666058859216566] |
1,802.0863 | PV-Powered CoMP-Based Green Cellular Networks with a Standby Grid Supply | This paper proposes a novel framework for PV-powered cellular networks with a
standby grid supply and an essential energy management technique for achieving
envisaged green networks. The proposal considers an emerging cellular network
architecture employing two types of coordinated multipoint (CoMP) transmission
techniques for serving the subscribers. Under the proposed framework, each base
station (BS) is powered by an individual PV solar energy module having an
independent storage device. BSs are also connected to the conventional grid
supply for meeting additional energy demand. We also propose a dynamic inter-BS
solar energy sharing policy through a transmission line for further greening
the proposed network by minimizing the consumption from the grid supply. An
extensive simulation-based study in the downlink of a Long-Term Evolution (LTE)
cellular system is carried out for evaluating the energy efficiency performance
of the proposed framework. System performance is also investigated for
identifying the impact of various system parameters including storage factor,
storage capacity, solar generation capacity, transmission line loss, and
different CoMP techniques.
| eess.SP | this paper proposes a novel framework for pvpowered cellular networks with a standby grid supply and an essential energy management technique for achieving envisaged green networks the proposal considers an emerging cellular network architecture employing two types of coordinated multipoint comp transmission techniques for serving the subscribers under the proposed framework each base station bs is powered by an individual pv solar energy module having an independent storage device bss are also connected to the conventional grid supply for meeting additional energy demand we also propose a dynamic interbs solar energy sharing policy through a transmission line for further greening the proposed network by minimizing the consumption from the grid supply an extensive simulationbased study in the downlink of a longterm evolution lte cellular system is carried out for evaluating the energy efficiency performance of the proposed framework system performance is also investigated for identifying the impact of various system parameters including storage factor storage capacity solar generation capacity transmission line loss and different comp techniques | [['this', 'paper', 'proposes', 'a', 'novel', 'framework', 'for', 'pvpowered', 'cellular', 'networks', 'with', 'a', 'standby', 'grid', 'supply', 'and', 'an', 'essential', 'energy', 'management', 'technique', 'for', 'achieving', 'envisaged', 'green', 'networks', 'the', 'proposal', 'considers', 'an', 'emerging', 'cellular', 'network', 'architecture', 'employing', 'two', 'types', 'of', 'coordinated', 'multipoint', 'comp', 'transmission', 'techniques', 'for', 'serving', 'the', 'subscribers', 'under', 'the', 'proposed', 'framework', 'each', 'base', 'station', 'bs', 'is', 'powered', 'by', 'an', 'individual', 'pv', 'solar', 'energy', 'module', 'having', 'an', 'independent', 'storage', 'device', 'bss', 'are', 'also', 'connected', 'to', 'the', 'conventional', 'grid', 'supply', 'for', 'meeting', 'additional', 'energy', 'demand', 'we', 'also', 'propose', 'a', 'dynamic', 'interbs', 'solar', 'energy', 'sharing', 'policy', 'through', 'a', 'transmission', 'line', 'for', 'further', 'greening', 'the', 'proposed', 'network', 'by', 'minimizing', 'the', 'consumption', 'from', 'the', 'grid', 'supply', 'an', 'extensive', 'simulationbased', 'study', 'in', 'the', 'downlink', 'of', 'a', 'longterm', 'evolution', 'lte', 'cellular', 'system', 'is', 'carried', 'out', 'for', 'evaluating', 'the', 'energy', 'efficiency', 'performance', 'of', 'the', 'proposed', 'framework', 'system', 'performance', 'is', 'also', 'investigated', 'for', 'identifying', 'the', 'impact', 'of', 'various', 'system', 'parameters', 'including', 'storage', 'factor', 'storage', 'capacity', 'solar', 'generation', 'capacity', 'transmission', 'line', 'loss', 'and', 'different', 'comp', 'techniques']] | [-0.23335554325816835, -0.002806317264468994, 0.03399957592951179, 0.0006120463679885356, -0.014396306688090922, -0.19517070572346268, 0.13815288001560697, 0.38826062639879927, -0.25355777121290973, -0.30808484134059855, 0.07027850859931943, -0.2244425545014986, -0.14740988600249516, 0.2005291030477454, -0.1068830798016634, 0.07211795128120972, 0.07558511611178557, 0.0028180860475602947, 0.013116446610472007, -0.22127046194367633, 0.2851960550051001, 0.20481731914120113, 0.41672551743231895, 0.046806526964845524, 0.07110906826550845, -0.0039394251780766176, -0.04885669641917935, -0.020191495736958685, -0.07591374798375466, 0.1641712997551644, 0.2881713464100868, 0.19780341333104687, 0.2982103274908008, -0.46437804633219126, -0.30579742632604706, 0.09199492404203317, 0.12588565881653666, -0.026127376576612998, -0.05936411563193471, -0.18628459471482328, 0.1035604427707745, -0.2782679641471676, -0.07687218096135638, -0.025357444858655515, -0.06427801189171832, 0.06976107180703477, -0.35089773225893334, -0.039237047766197596, -0.01772625532381736, 0.08846989998923296, -0.09932490648480313, -0.10360920838174047, -0.01793581323212626, 0.19021469954026454, -0.030990662591293364, -0.053293679223293665, 0.13535369990078347, -0.08671920191888448, -0.11272394142210165, 0.3685873766265037, 0.014089930238963173, -0.17474369715513072, 0.13488016522449736, -0.004498226171296953, -0.11574631356974928, 0.14461145970243505, 0.22814650750696297, 0.05335618643283208, -0.25451447234330016, 0.014191050049082218, 0.004958692199845866, 0.1489255885443105, 0.045052816006695716, 0.06717487928037327, 0.2247866183525042, 0.2825901311504223, 0.14842299942676795, 0.12421741071668249, -0.1427137318248974, -0.12485128808936967, -0.20166626973886884, -0.15205120697912827, -0.17337632088399516, 0.03870829308360088, -0.07266428910473378, -0.07406602854124929, 0.4027424811725146, 0.11252936969579357, 0.11228546344252054, 0.06474188602211453, 0.41607636417597305, 0.13310720394763007, 0.07333125960842775, 0.14650603746370663, 0.15808416170800296, 0.04180549091102964, 0.24042065459780576, -0.2531917082378641, 0.006525388253066922, 0.044965457827102664] |
1,802.08631 | Optimal three spheres inequality at the boundary for the Kirchhoff-Love
plate's equation with Dirichlet conditions | We prove a three sphere inequality with optimal exponent at the boundary for
solutions to the Kirchhoff-Love plate's equation satisfying homogeneous
Dirichlet conditions. This result implies the Strong Unique Continuation
Property at the Boundary (SUCPB). Our approach is based on the method of
Carleman estimates, and involves the construction of an ad hoc conformal
mapping preserving the structure of the operator and the employment of a
suitable reflection of the solution with respect to the flatten boundary which
ensures the needed regularity of the extended solution. To the authors'
knowledge, this is the first (nontrivial) SUCPB result for fourth-order
equations with bi-Laplacian principal part.
| math.AP | we prove a three sphere inequality with optimal exponent at the boundary for solutions to the kirchhofflove plates equation satisfying homogeneous dirichlet conditions this result implies the strong unique continuation property at the boundary sucpb our approach is based on the method of carleman estimates and involves the construction of an ad hoc conformal mapping preserving the structure of the operator and the employment of a suitable reflection of the solution with respect to the flatten boundary which ensures the needed regularity of the extended solution to the authors knowledge this is the first nontrivial sucpb result for fourthorder equations with bilaplacian principal part | [['we', 'prove', 'a', 'three', 'sphere', 'inequality', 'with', 'optimal', 'exponent', 'at', 'the', 'boundary', 'for', 'solutions', 'to', 'the', 'kirchhofflove', 'plates', 'equation', 'satisfying', 'homogeneous', 'dirichlet', 'conditions', 'this', 'result', 'implies', 'the', 'strong', 'unique', 'continuation', 'property', 'at', 'the', 'boundary', 'sucpb', 'our', 'approach', 'is', 'based', 'on', 'the', 'method', 'of', 'carleman', 'estimates', 'and', 'involves', 'the', 'construction', 'of', 'an', 'ad', 'hoc', 'conformal', 'mapping', 'preserving', 'the', 'structure', 'of', 'the', 'operator', 'and', 'the', 'employment', 'of', 'a', 'suitable', 'reflection', 'of', 'the', 'solution', 'with', 'respect', 'to', 'the', 'flatten', 'boundary', 'which', 'ensures', 'the', 'needed', 'regularity', 'of', 'the', 'extended', 'solution', 'to', 'the', 'authors', 'knowledge', 'this', 'is', 'the', 'first', 'nontrivial', 'sucpb', 'result', 'for', 'fourthorder', 'equations', 'with', 'bilaplacian', 'principal', 'part']] | [-0.14597980885346437, -0.012426608679079972, -0.10930486495478772, 0.002947426661301185, -0.13039061912009037, -0.1205637630933494, 0.0057779460022335544, 0.3054400061875783, -0.2693055500002468, -0.2360175591785068, 0.15815172343932585, -0.2673441262404416, -0.12245643376737979, 0.152616620305743, -0.049231685104542504, 0.11667515742409901, 0.06181137643608393, 0.055262587521700005, -0.09019048863738849, -0.19205234790056505, 0.4148496058586912, 0.0043894769258651075, 0.2880691208411008, 0.07550686849600763, 0.12487014126050852, -0.018702942617785406, -0.04293282786338572, -0.03177230561742166, -0.1766897582029011, 0.15473259994577543, 0.18833912042763962, 0.04835063812788576, 0.2878653723769365, -0.40262288943517444, -0.18591460935496407, 0.08555103056292579, 0.08162939417867593, 0.05706393908978641, -0.020010958276186867, -0.29279784052906666, 0.1134063618111552, -0.08911071040247585, -0.24791871865882592, -0.01388198719816465, -0.041715697768856495, -0.00382955099214051, -0.35116303084913514, 0.09174709786277484, 0.1105805679827052, 0.03160505876054659, -0.1718084264418804, -0.05572125986309759, -0.01669507379433615, 0.09431418344177597, 0.08100576020603743, 0.017855558400590194, 0.03389936685562134, -0.10015417117050246, -0.03921774105629975, 0.3453605682132583, -0.06784465958309524, -0.2636206280714011, 0.1587190848076716, -0.12327017514582943, -0.13580198525725043, 0.11379916651868353, 0.08254546420557388, 0.1587632698573026, -0.13507785914892642, 0.1370014955926522, -0.05321258298856407, 0.13438318017870188, 0.0917558329654675, -0.01957010124426554, 0.09849105986273464, 0.12012430210141282, 0.19131056579998604, 0.15069656452054486, -0.009680070512581105, -0.08966624364256859, -0.3868100590109095, -0.1894395861283342, -0.18170005726335825, 0.07982696019975907, -0.15688941149952976, -0.22424062403539816, 0.38209648166929244, 0.1112077891084482, 0.14993759948194174, 0.07387212558087948, 0.2510272991688301, 0.17745006208276085, 0.06530013582532239, 0.10071450828885038, 0.21241062682341127, 0.1541424677707255, 0.13251004875614764, -0.2186346824027543, 0.03231437821123822, 0.1773338146032948] |
1,802.08632 | An Approach to Vehicle Trajectory Prediction Using Automatically
Generated Traffic Maps | Trajectory and intention prediction of traffic participants is an important
task in automated driving and crucial for safe interaction with the
environment. In this paper, we present a new approach to vehicle trajectory
prediction based on automatically generated maps containing statistical
information about the behavior of traffic participants in a given area. These
maps are generated based on trajectory observations using image processing and
map matching techniques and contain all typical vehicle movements and
probabilities in the considered area. Our prediction approach matches an
observed trajectory to a behavior contained in the map and uses this
information to generate a prediction. We evaluated our approach on a dataset
containing over 14000 trajectories and found that it produces significantly
more precise mid-term predictions compared to motion model-based prediction
approaches.
| cs.CV | trajectory and intention prediction of traffic participants is an important task in automated driving and crucial for safe interaction with the environment in this paper we present a new approach to vehicle trajectory prediction based on automatically generated maps containing statistical information about the behavior of traffic participants in a given area these maps are generated based on trajectory observations using image processing and map matching techniques and contain all typical vehicle movements and probabilities in the considered area our prediction approach matches an observed trajectory to a behavior contained in the map and uses this information to generate a prediction we evaluated our approach on a dataset containing over 14000 trajectories and found that it produces significantly more precise midterm predictions compared to motion modelbased prediction approaches | [['trajectory', 'and', 'intention', 'prediction', 'of', 'traffic', 'participants', 'is', 'an', 'important', 'task', 'in', 'automated', 'driving', 'and', 'crucial', 'for', 'safe', 'interaction', 'with', 'the', 'environment', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'approach', 'to', 'vehicle', 'trajectory', 'prediction', 'based', 'on', 'automatically', 'generated', 'maps', 'containing', 'statistical', 'information', 'about', 'the', 'behavior', 'of', 'traffic', 'participants', 'in', 'a', 'given', 'area', 'these', 'maps', 'are', 'generated', 'based', 'on', 'trajectory', 'observations', 'using', 'image', 'processing', 'and', 'map', 'matching', 'techniques', 'and', 'contain', 'all', 'typical', 'vehicle', 'movements', 'and', 'probabilities', 'in', 'the', 'considered', 'area', 'our', 'prediction', 'approach', 'matches', 'an', 'observed', 'trajectory', 'to', 'a', 'behavior', 'contained', 'in', 'the', 'map', 'and', 'uses', 'this', 'information', 'to', 'generate', 'a', 'prediction', 'we', 'evaluated', 'our', 'approach', 'on', 'a', 'dataset', 'containing', 'over', '14000', 'trajectories', 'and', 'found', 'that', 'it', 'produces', 'significantly', 'more', 'precise', 'midterm', 'predictions', 'compared', 'to', 'motion', 'modelbased', 'prediction', 'approaches']] | [-0.07707603754442971, 0.013606630356889582, -0.11935374568020052, 0.05773864343609603, -0.05749512981128646, -0.12526069109844684, 0.06521168770541408, 0.4251991256896872, -0.21705019392902614, -0.3581953709363006, 0.09676153030068235, -0.3239984861793346, -0.15538070490947575, 0.2496414471497701, -0.14516106223891256, 0.08820917169941822, 0.1379304491347284, 0.10295061609940603, 0.0009288096171076177, -0.21372838233037328, 0.2591745116187667, 0.032450515260279644, 0.3214829400967574, 0.009338155581644969, 0.14913386637726944, 0.032361991001380375, -0.07565926395182032, 0.03202901460463181, -0.0939822298662989, 0.19211040282789327, 0.26082809336026, 0.17529458612261806, 0.24424920066667255, -0.3911342525825603, -0.2093032017655787, 0.0767972780377022, 0.11616246219273307, 0.09238168994852458, -0.06376656960640048, -0.34604045045853127, 0.08470544295050786, -0.146276437339111, -0.04872450519178528, -0.09521124589809915, 0.010636740975314751, -0.027682571098466724, -0.3011731521587535, 0.038677358297718456, 0.006611577613512054, 0.09184403683866549, -0.07734062893905502, -0.0465555350347131, 0.02041450387093846, 0.22942797711948515, 0.042779798994160956, 0.07823665599607921, 0.17346854673087364, -0.16271212790115896, -0.13619644174468704, 0.40426507353549823, -0.06604067274383851, -0.19698870988213457, 0.16941869067886728, -0.09038446258091426, -0.13621617878925463, 0.1412628864054568, 0.23778360323922243, 0.11637850390252424, -0.18253360505696037, -0.058318062132002524, -0.0193172379367752, 0.20869039960598457, 0.02296312156613567, -0.04648227634970681, 0.20765006248257123, 0.23957950589829125, 0.06486615377070848, 0.08586117528466275, -0.11654471864494553, -0.13159186065513495, -0.26006030771532096, -0.09290946954570245, -0.13574356238405016, -0.01716954972653184, -0.05417843106181408, -0.13783737484300218, 0.42219787883368554, 0.260378436105384, 0.2132467338051356, 0.07931610927153088, 0.3412563679594314, 0.04087635694850178, 0.05974383325155941, 0.11689073895058755, 0.16654073237714329, -0.0008634421574242879, 0.10952298292158957, -0.1559799816359373, 0.09944929829907778, 0.045339880449319026] |
1,802.08633 | IMLS-SLAM: scan-to-model matching based on 3D data | The Simultaneous Localization And Mapping (SLAM) problem has been well
studied in the robotics community, especially using mono, stereo cameras or
depth sensors. 3D depth sensors, such as Velodyne LiDAR, have proved in the
last 10 years to be very useful to perceive the environment in autonomous
driving, but few methods exist that directly use these 3D data for odometry. We
present a new low-drift SLAM algorithm based only on 3D LiDAR data. Our method
relies on a scan-to-model matching framework. We first have a specific sampling
strategy based on the LiDAR scans. We then define our model as the previous
localized LiDAR sweeps and use the Implicit Moving Least Squares (IMLS) surface
representation. We show experiments with the Velodyne HDL32 with only 0.40%
drift over a 4 km acquisition without any loop closure (i.e., 16 m drift after
4 km). We tested our solution on the KITTI benchmark with a Velodyne HDL64 and
ranked among the best methods (against mono, stereo and LiDAR methods) with a
global drift of only 0.69%.
| cs.RO | the simultaneous localization and mapping slam problem has been well studied in the robotics community especially using mono stereo cameras or depth sensors 3d depth sensors such as velodyne lidar have proved in the last 10 years to be very useful to perceive the environment in autonomous driving but few methods exist that directly use these 3d data for odometry we present a new lowdrift slam algorithm based only on 3d lidar data our method relies on a scantomodel matching framework we first have a specific sampling strategy based on the lidar scans we then define our model as the previous localized lidar sweeps and use the implicit moving least squares imls surface representation we show experiments with the velodyne hdl32 with only 040 drift over a 4 km acquisition without any loop closure ie 16 m drift after 4 km we tested our solution on the kitti benchmark with a velodyne hdl64 and ranked among the best methods against mono stereo and lidar methods with a global drift of only 069 | [['the', 'simultaneous', 'localization', 'and', 'mapping', 'slam', 'problem', 'has', 'been', 'well', 'studied', 'in', 'the', 'robotics', 'community', 'especially', 'using', 'mono', 'stereo', 'cameras', 'or', 'depth', 'sensors', '3d', 'depth', 'sensors', 'such', 'as', 'velodyne', 'lidar', 'have', 'proved', 'in', 'the', 'last', '10', 'years', 'to', 'be', 'very', 'useful', 'to', 'perceive', 'the', 'environment', 'in', 'autonomous', 'driving', 'but', 'few', 'methods', 'exist', 'that', 'directly', 'use', 'these', '3d', 'data', 'for', 'odometry', 'we', 'present', 'a', 'new', 'lowdrift', 'slam', 'algorithm', 'based', 'only', 'on', '3d', 'lidar', 'data', 'our', 'method', 'relies', 'on', 'a', 'scantomodel', 'matching', 'framework', 'we', 'first', 'have', 'a', 'specific', 'sampling', 'strategy', 'based', 'on', 'the', 'lidar', 'scans', 'we', 'then', 'define', 'our', 'model', 'as', 'the', 'previous', 'localized', 'lidar', 'sweeps', 'and', 'use', 'the', 'implicit', 'moving', 'least', 'squares', 'imls', 'surface', 'representation', 'we', 'show', 'experiments', 'with', 'the', 'velodyne', 'hdl32', 'with', 'only', '040', 'drift', 'over', 'a', '4', 'km', 'acquisition', 'without', 'any', 'loop', 'closure', 'ie', '16', 'm', 'drift', 'after', '4', 'km', 'we', 'tested', 'our', 'solution', 'on', 'the', 'kitti', 'benchmark', 'with', 'a', 'velodyne', 'hdl64', 'and', 'ranked', 'among', 'the', 'best', 'methods', 'against', 'mono', 'stereo', 'and', 'lidar', 'methods', 'with', 'a', 'global', 'drift', 'of', 'only', '069']] | [-0.05815727701383097, 0.035124369659984604, -0.06070685039340524, -0.018381674328306414, -0.03863966813691225, -0.17969390160415166, 0.026401897863940937, 0.44955456777084507, -0.2218680911471505, -0.34989461438873637, 0.15510386501276346, -0.2933259541609672, -0.15556014683125155, 0.2432670435322636, -0.11970537161032983, 0.12653888409582556, 0.1583781722111947, 0.02605452259021574, -0.07303127086963836, -0.22206316868906853, 0.24039308663689085, -0.00819584628093172, 0.27662635354749504, 0.005858111480449343, 0.17209166521895347, 0.03126435157410338, -0.04155643211991785, 0.032266473626310126, -0.06928719745656323, 0.11837918417853407, 0.23159498642246962, 0.15801463718112757, 0.2494297022490415, -0.421998769430631, -0.23264528572774276, 0.05234234043556822, 0.1233805753015114, 0.07435738152449609, -0.07452425613073554, -0.37357787800038, 0.06796315231308142, -0.1590412235929019, -0.03612350856560866, -0.0664500010085496, 0.01168611475380865, 0.008563350656720087, -0.2827355376335919, 0.02062884371826899, -0.012625356076509808, 0.13516180450372264, -0.08646811096179546, -0.11051755194612861, 0.00952132566165201, 0.16733919563923672, -0.034135763986675435, 0.074845807932692, 0.13864546483272366, -0.1307444594932731, -0.11831333254155367, 0.3766005982137864, -0.07602737609781986, -0.1826102285805715, 0.24510477783334766, -0.10158293417754126, -0.13564282374390396, 0.14179221800798494, 0.18106257336864456, 0.1691641289046442, -0.12691650595123324, 0.037554125441376054, -0.07848306564261487, 0.1828443700993246, 0.08938196218936269, -0.045400328121351946, 0.15954627646904815, 0.22180406990207555, 0.12361631933434387, 0.03945425406205826, -0.24638142678149585, -0.02342722125795047, -0.2094111872703311, -0.11664394044576312, -0.1793219737444051, -0.025193569330311208, -0.07907539568311045, -0.13971402783211342, 0.3517885008694593, 0.26905139485388213, 0.20931908053197187, 0.04764569024197184, 0.39936895662306987, 0.03435026559243034, 0.08472731970967008, 0.09609697758118187, 0.2331479977590401, 0.025056160442233525, 0.13026556944317522, -0.11967895048658071, 0.03046669802330875, 0.09649841295632385] |
1,802.08634 | Fully Asynchronous Push-Sum With Growing Intercommunication Intervals | We propose an algorithm for average consensus over a directed graph which is
both fully asynchronous and robust to unreliable communications. We show its
convergence to the average, while allowing for slowly growing but potentially
unbounded communication failures.
| math.OC | we propose an algorithm for average consensus over a directed graph which is both fully asynchronous and robust to unreliable communications we show its convergence to the average while allowing for slowly growing but potentially unbounded communication failures | [['we', 'propose', 'an', 'algorithm', 'for', 'average', 'consensus', 'over', 'a', 'directed', 'graph', 'which', 'is', 'both', 'fully', 'asynchronous', 'and', 'robust', 'to', 'unreliable', 'communications', 'we', 'show', 'its', 'convergence', 'to', 'the', 'average', 'while', 'allowing', 'for', 'slowly', 'growing', 'but', 'potentially', 'unbounded', 'communication', 'failures']] | [-0.2193336655618623, 0.08199467643288172, -0.058181751764526494, 0.01701544707114073, -0.07538699091559178, -0.21936771810348882, 0.11467644611471578, 0.4699924006425518, -0.3072353777916808, -0.29605639470614015, 0.13365461407719473, -0.19725058835588002, -0.1594959331774398, 0.14461926861028923, -0.14920511868733324, 0.11814379569382015, 0.0866927070249068, 0.08525212118892293, 0.006872031470074465, -0.2866102953014074, 0.17383793604217077, 0.06188142831486307, 0.2656681323240168, 0.05400161013791436, 0.09064543302367001, 0.0294662044861501, -0.023619264903429308, 0.050350175410705175, -0.05711785255392131, 0.13098717287280842, 0.2762213618445553, 0.17258326233805796, 0.34872736781835556, -0.4504216920682474, -0.222636216148538, 0.19740854592160567, 0.24588213978629364, 0.14881687337152757, -0.041343402043965305, -0.3004831959444441, 0.1547257397078762, -0.22133768477330082, -0.019633893217695386, -0.07831525278130644, 0.07832888822610441, 0.042235972358244715, -0.3480557922862078, 0.03906064201146364, 0.08340246818567577, 0.03827392564792382, -0.002298521999220707, -0.012883347937052972, 0.019753369276019696, 0.13037086437505327, 0.0006028513460861225, 0.044021407130027286, 0.07564016883751672, -0.11581442644819617, -0.11967356416004661, 0.33083725960827187, -0.024016987679428177, -0.1746566390081027, 0.19887541097245717, -0.05664972375196062, -0.12296427502051781, 0.14339365398413256, 0.2560278829187155, 0.10844998321446933, -0.1514433649564652, -0.005300652825481896, 0.038716404551738186, 0.16140629047233807, -0.031925456953774155, 0.056185249190189336, 0.13289119489490986, 0.17812824555623688, 0.24766035636543834, 0.14755344381065746, -0.045335823069571665, -0.15207526563225607, -0.1956995977578979, -0.11617900460566345, -0.13103814414506287, 0.023763797025343304, -0.14678549507937677, -0.20558225280164102, 0.3941575212306098, 0.17925244114533262, 0.1736381922505404, 0.23101556980308438, 0.3726768388265842, 0.08025587195726602, 0.034272543706097884, 0.26211129005165085, 0.20616141280257388, 0.09765886395593713, 0.11825502290402685, -0.16227288084643843, 0.14382639633320077, -0.04348259987799745] |
1,802.08635 | Loss-aware Weight Quantization of Deep Networks | The huge size of deep networks hinders their use in small computing devices.
In this paper, we consider compressing the network by weight quantization. We
extend a recently proposed loss-aware weight binarization scheme to
ternarization, with possibly different scaling parameters for the positive and
negative weights, and m-bit (where m > 2) quantization. Experiments on
feedforward and recurrent neural networks show that the proposed scheme
outperforms state-of-the-art weight quantization algorithms, and is as accurate
(or even more accurate) than the full-precision network.
| cs.LG | the huge size of deep networks hinders their use in small computing devices in this paper we consider compressing the network by weight quantization we extend a recently proposed lossaware weight binarization scheme to ternarization with possibly different scaling parameters for the positive and negative weights and mbit where m 2 quantization experiments on feedforward and recurrent neural networks show that the proposed scheme outperforms stateoftheart weight quantization algorithms and is as accurate or even more accurate than the fullprecision network | [['the', 'huge', 'size', 'of', 'deep', 'networks', 'hinders', 'their', 'use', 'in', 'small', 'computing', 'devices', 'in', 'this', 'paper', 'we', 'consider', 'compressing', 'the', 'network', 'by', 'weight', 'quantization', 'we', 'extend', 'a', 'recently', 'proposed', 'lossaware', 'weight', 'binarization', 'scheme', 'to', 'ternarization', 'with', 'possibly', 'different', 'scaling', 'parameters', 'for', 'the', 'positive', 'and', 'negative', 'weights', 'and', 'mbit', 'where', 'm', '2', 'quantization', 'experiments', 'on', 'feedforward', 'and', 'recurrent', 'neural', 'networks', 'show', 'that', 'the', 'proposed', 'scheme', 'outperforms', 'stateoftheart', 'weight', 'quantization', 'algorithms', 'and', 'is', 'as', 'accurate', 'or', 'even', 'more', 'accurate', 'than', 'the', 'fullprecision', 'network']] | [-0.11501529883380611, 0.045844581024146375, 0.013527817035346855, 0.03204223184765857, -0.07932970988460714, -0.23353971503560006, 0.062432551723444994, 0.44785030370141254, -0.24890961790066443, -0.26980118076374504, 0.06078489262461202, -0.2327266840701118, -0.26616927179116984, 0.19487996442519404, -0.12195078564094908, 0.09012577777015573, 0.145026530334611, 0.03991852990455098, -0.0975051904679276, -0.31867730902956315, 0.33196447878777063, 0.10369135928879215, 0.34548179679952656, -0.0026061376729221257, 0.14744730922070126, -0.008064532869518448, -0.03824411683146738, 0.0025112078852813553, -0.051245093480112566, 0.1637528633330891, 0.23784749489133877, 0.10555953913609739, 0.32274029935123744, -0.43447118871097945, -0.26902970471591864, 0.12738828028172808, 0.14962332012465246, 0.11127465587385275, -0.008419255190852305, -0.24587556467115604, 0.17220105735274652, -0.19914192746013956, 0.032438031900968736, -0.1575777495831803, -7.092246762764307e-05, 0.009079431959738335, -0.30207610440750915, 0.03465561281004346, 0.06853836989260198, -0.01607993908835874, -0.051537536656129014, -0.18885097957365674, 0.046046512891296985, 0.10654911461838142, -0.04040453066606718, 0.0549164068767295, 0.08802986453735719, -0.18304266131563504, -0.13490033708512783, 0.3040246705950042, -0.05791831427964491, -0.22597980545258817, 0.15028369694913704, -0.027182208721951387, -0.12747837170774554, 0.08719703946032642, 0.20816743946461766, 0.12894470653968093, -0.06584405917444347, 0.014633317636095999, -0.01307867365360352, 0.15063341010798825, 0.07910182024352252, 0.038274477805114455, 0.09860157559591311, 0.2333334653902753, 0.0825012704892153, 0.13234138771615647, -0.12686278746624327, -0.08494601798255319, -0.18150140320951189, -0.10075007609262729, -0.22954334961365402, 0.02443199239694226, -0.12918499081588156, -0.14009606673807642, 0.3832673516463493, 0.18913924386207429, 0.2575115543290007, 0.18179483668459004, 0.37640035355946533, 0.07246277878998009, 0.15664497975915395, 0.15632064699735723, 0.1594896471834983, 0.07779851592904716, 0.11743848696839708, -0.18372655008563105, 0.06017048412288631, 0.06833141173500522] |
1,802.08636 | Ranking Sentences for Extractive Summarization with Reinforcement
Learning | Single document summarization is the task of producing a shorter version of a
document while preserving its principal information content. In this paper we
conceptualize extractive summarization as a sentence ranking task and propose a
novel training algorithm which globally optimizes the ROUGE evaluation metric
through a reinforcement learning objective. We use our algorithm to train a
neural summarization model on the CNN and DailyMail datasets and demonstrate
experimentally that it outperforms state-of-the-art extractive and abstractive
systems when evaluated automatically and by humans.
| cs.CL | single document summarization is the task of producing a shorter version of a document while preserving its principal information content in this paper we conceptualize extractive summarization as a sentence ranking task and propose a novel training algorithm which globally optimizes the rouge evaluation metric through a reinforcement learning objective we use our algorithm to train a neural summarization model on the cnn and dailymail datasets and demonstrate experimentally that it outperforms stateoftheart extractive and abstractive systems when evaluated automatically and by humans | [['single', 'document', 'summarization', 'is', 'the', 'task', 'of', 'producing', 'a', 'shorter', 'version', 'of', 'a', 'document', 'while', 'preserving', 'its', 'principal', 'information', 'content', 'in', 'this', 'paper', 'we', 'conceptualize', 'extractive', 'summarization', 'as', 'a', 'sentence', 'ranking', 'task', 'and', 'propose', 'a', 'novel', 'training', 'algorithm', 'which', 'globally', 'optimizes', 'the', 'rouge', 'evaluation', 'metric', 'through', 'a', 'reinforcement', 'learning', 'objective', 'we', 'use', 'our', 'algorithm', 'to', 'train', 'a', 'neural', 'summarization', 'model', 'on', 'the', 'cnn', 'and', 'dailymail', 'datasets', 'and', 'demonstrate', 'experimentally', 'that', 'it', 'outperforms', 'stateoftheart', 'extractive', 'and', 'abstractive', 'systems', 'when', 'evaluated', 'automatically', 'and', 'by', 'humans']] | [-0.03439123541253006, -0.025613898380159785, -0.07378405551766841, 0.10226426307657142, -0.17096339693724563, -0.2128106169800115, 0.051356941780995397, 0.5087124212395128, -0.23283283262536292, -0.3084105167356206, 0.013770296782107524, -0.30665624777718287, -0.22353440255108403, 0.18142275347817327, -0.1482318219637907, 0.08606702376585794, 0.19023169606083595, 0.08966075871720067, -0.05465641112078163, -0.33960508954961127, 0.30462032031529107, 0.030889045106383357, 0.4187575733976257, 0.040291715100998195, 0.20235836550042532, -0.019859586121150997, -0.02825900747173852, -0.03522170875391855, -0.035878906631718034, 0.20303663659113935, 0.3657804765715832, 0.3036486443824975, 0.3769829267374717, -0.2968582625659864, -0.18642209088089082, 0.06220989051365816, 0.1520776815099142, 0.11681698441307384, -0.031131075406958145, -0.36512485157880115, 0.0738085565929551, -0.20607257108118884, 0.15499360406226137, -0.20173289761992125, -0.02207876677715742, -0.03562677357553096, -0.28561733514865545, 0.000853362481859399, 0.13200192002397848, 0.05140752992422388, -0.045975361350162815, -0.06729963155486053, 0.04979277489899953, 0.10760811343114744, 0.057734059943624474, 0.16518008264730025, 0.15278506019470714, -0.1885419745969291, -0.20217177588151905, 0.39425255873853843, -0.10822127093049902, -0.24633495892375346, 0.13275840115984022, 0.0763725511014189, -0.16643684024627253, 0.035629690261330546, 0.24441032197536539, 0.1796734861649073, -0.20552948817824404, -0.04253282923061151, -0.07124703970209627, 0.24117750338443397, 0.0408847311784218, -0.05537855182774365, 0.18040969474922594, 0.34912293717526355, 0.0041941208310607, 0.16244982299962785, -0.0722434932632917, -0.03652639673432199, -0.18273462745838048, -0.11623736308808098, -0.20555115694168774, -0.05628511323252829, -0.1062439504786176, -0.19017769489437342, 0.45870863482719515, 0.2969938036190664, 0.18542009421124508, 0.17553678732904857, 0.4110357263466207, -0.03022026146262339, 0.08091372676568515, 0.1210549648286116, 0.11516585567875243, -0.09237414080274814, 0.17509819512971017, -0.16798929749170272, 0.11643391363777039, 0.11264085968411187] |
1,802.08637 | Network Models for Multiobjective Discrete Optimization | This paper provides a novel framework for solving multiobjective discrete
optimization problems with an arbitrary number of objectives. Our framework
formulates these problems as network models, in that enumerating the Pareto
frontier amounts to solving a multicriteria shortest path problem in an
auxiliary network. We design techniques for exploiting the network model in
order to accelerate the identification of the Pareto frontier, most notably a
number of operations to simplify the network by removing nodes and arcs while
preserving the set of nondominated solutions. We show that the proposed
framework yields orders-of-magnitude performance improvements over existing
state-of-the-art algorithms on five problem classes containing both linear and
nonlinear objective functions.
| math.OC cs.DS | this paper provides a novel framework for solving multiobjective discrete optimization problems with an arbitrary number of objectives our framework formulates these problems as network models in that enumerating the pareto frontier amounts to solving a multicriteria shortest path problem in an auxiliary network we design techniques for exploiting the network model in order to accelerate the identification of the pareto frontier most notably a number of operations to simplify the network by removing nodes and arcs while preserving the set of nondominated solutions we show that the proposed framework yields ordersofmagnitude performance improvements over existing stateoftheart algorithms on five problem classes containing both linear and nonlinear objective functions | [['this', 'paper', 'provides', 'a', 'novel', 'framework', 'for', 'solving', 'multiobjective', 'discrete', 'optimization', 'problems', 'with', 'an', 'arbitrary', 'number', 'of', 'objectives', 'our', 'framework', 'formulates', 'these', 'problems', 'as', 'network', 'models', 'in', 'that', 'enumerating', 'the', 'pareto', 'frontier', 'amounts', 'to', 'solving', 'a', 'multicriteria', 'shortest', 'path', 'problem', 'in', 'an', 'auxiliary', 'network', 'we', 'design', 'techniques', 'for', 'exploiting', 'the', 'network', 'model', 'in', 'order', 'to', 'accelerate', 'the', 'identification', 'of', 'the', 'pareto', 'frontier', 'most', 'notably', 'a', 'number', 'of', 'operations', 'to', 'simplify', 'the', 'network', 'by', 'removing', 'nodes', 'and', 'arcs', 'while', 'preserving', 'the', 'set', 'of', 'nondominated', 'solutions', 'we', 'show', 'that', 'the', 'proposed', 'framework', 'yields', 'ordersofmagnitude', 'performance', 'improvements', 'over', 'existing', 'stateoftheart', 'algorithms', 'on', 'five', 'problem', 'classes', 'containing', 'both', 'linear', 'and', 'nonlinear', 'objective', 'functions']] | [-0.11042047825368514, -0.049889869413097226, -0.03685902268839402, 0.025356469256162577, -0.09517633246146825, -0.12275707871661684, 0.05810394556872513, 0.3899645337305211, -0.3283358280506378, -0.37849257742866466, 0.06150876527007054, -0.24914679176456064, -0.1903306749615169, 0.21979696401437626, -0.07446826131450474, 0.14792877769657334, 0.11418598125594745, -0.0408169688195537, -0.07204267860031388, -0.3092697547372738, 0.31115469185917405, 0.017758536725005974, 0.304377357945393, 0.010424164237578425, 0.14227075720795457, 0.02213030402471713, -0.016396357267753247, 0.072581174200264, -0.07502489144886618, 0.20543824027104457, 0.31430569487782606, 0.2544345289528575, 0.36384492337601176, -0.4148668169360095, -0.21587242906135634, 0.15296160293649028, 0.1379909193433753, 0.08845509343285012, -0.020290318057325524, -0.2440037220596857, 0.08252780631487898, -0.11589304240070147, -0.06968083048512766, -0.08381484122786653, -0.056473129868951685, 0.01274938848021295, -0.322182175677714, -0.012219575814766074, 0.026217513170879368, -0.0233346263476468, -0.07585237703474085, -0.15021910419721807, 0.06814538487105058, 0.07964207767295318, 0.01663783304457373, 0.03765948960523403, 0.06100763184223495, -0.18010688887763804, -0.2239126242663062, 0.3767716991843297, 0.0016529623711686752, -0.2315910109532399, 0.15725922505926648, 0.017660810120848067, -0.1823256889917811, 0.15625594615286917, 0.2414846588225198, 0.16738580739757883, -0.18499508907232398, 0.06579169589030735, -0.05662734593358745, 0.13053850566011366, 0.05094389943619592, 0.009943026720349668, 0.14842327839862865, 0.2426853204966275, 0.1858365515059014, 0.1741089436328124, -0.04933745153739604, -0.12335880828696653, -0.2600371244645447, -0.11677262820132556, -0.12923803418840563, -0.06972499272931333, -0.12101088633623033, -0.1687737007309264, 0.4491721148337793, 0.1774811186921706, 0.15724164694163162, 0.1450152555993254, 0.3120952741170319, 0.09297129240459998, 0.050591396428473774, 0.13901873164459927, 0.1578627601853324, 0.0558598976381499, 0.06737837152782007, -0.21650207548406522, 0.060986234648409514, 0.10518965186709282] |
1,802.08638 | HEP Community White Paper on Software trigger and event reconstruction | Realizing the physics programs of the planned and upgraded high-energy
physics (HEP) experiments over the next 10 years will require the HEP community
to address a number of challenges in the area of software and computing. For
this reason, the HEP software community has engaged in a planning process over
the past two years, with the objective of identifying and prioritizing the
research and development required to enable the next generation of HEP
detectors to fulfill their full physics potential. The aim is to produce a
Community White Paper which will describe the community strategy and a roadmap
for software and computing research and development in HEP for the 2020s. The
topics of event reconstruction and software triggers were considered by a joint
working group and are summarized together in this document.
| physics.comp-ph | realizing the physics programs of the planned and upgraded highenergy physics hep experiments over the next 10 years will require the hep community to address a number of challenges in the area of software and computing for this reason the hep software community has engaged in a planning process over the past two years with the objective of identifying and prioritizing the research and development required to enable the next generation of hep detectors to fulfill their full physics potential the aim is to produce a community white paper which will describe the community strategy and a roadmap for software and computing research and development in hep for the 2020s the topics of event reconstruction and software triggers were considered by a joint working group and are summarized together in this document | [['realizing', 'the', 'physics', 'programs', 'of', 'the', 'planned', 'and', 'upgraded', 'highenergy', 'physics', 'hep', 'experiments', 'over', 'the', 'next', '10', 'years', 'will', 'require', 'the', 'hep', 'community', 'to', 'address', 'a', 'number', 'of', 'challenges', 'in', 'the', 'area', 'of', 'software', 'and', 'computing', 'for', 'this', 'reason', 'the', 'hep', 'software', 'community', 'has', 'engaged', 'in', 'a', 'planning', 'process', 'over', 'the', 'past', 'two', 'years', 'with', 'the', 'objective', 'of', 'identifying', 'and', 'prioritizing', 'the', 'research', 'and', 'development', 'required', 'to', 'enable', 'the', 'next', 'generation', 'of', 'hep', 'detectors', 'to', 'fulfill', 'their', 'full', 'physics', 'potential', 'the', 'aim', 'is', 'to', 'produce', 'a', 'community', 'white', 'paper', 'which', 'will', 'describe', 'the', 'community', 'strategy', 'and', 'a', 'roadmap', 'for', 'software', 'and', 'computing', 'research', 'and', 'development', 'in', 'hep', 'for', 'the', '2020s', 'the', 'topics', 'of', 'event', 'reconstruction', 'and', 'software', 'triggers', 'were', 'considered', 'by', 'a', 'joint', 'working', 'group', 'and', 'are', 'summarized', 'together', 'in', 'this', 'document']] | [-0.07819875115246484, 0.10011736510998824, -0.05634760193413857, 0.05232722084106585, -0.11268295354746057, -0.09396870714739304, 0.0033219889182047073, 0.36654287226723903, -0.24228603112737113, -0.39866816997528076, 0.14707443738183373, -0.2596697125453361, -0.0917667572626449, 0.24290649581587676, -0.05515331741789299, 0.10605907700179766, 0.14724398851676873, 0.02963728270851513, -0.047168275043297785, -0.2834121154437801, 0.2609880381602455, 0.16605892783792858, 0.30481541105969384, 0.08854730346788667, 0.050089546259683135, 0.02373082811457359, -0.148167797237296, -0.02897625465905576, -0.09867656207114289, 0.18665404055465126, 0.4068564327264374, 0.24777023025407371, 0.37922829886277515, -0.4418765563997581, -0.17829610578800467, 0.09031021947069376, 0.11301731281194159, 0.05840608695760955, -0.08867796187846441, -0.2800549887910937, 0.056047083933442605, -0.241948657669127, -0.13186471573091252, -0.025032023366072804, 0.013830275853362047, 0.026941243982450527, -0.20323736623465788, -0.09064267075595897, 0.01911966857319798, 0.06332148681747529, -0.007804340474787309, -0.11200569909432846, 0.07043592680499634, 0.17333084514812622, 0.05478370158777001, 0.05208551499526948, 0.11610048982115448, -0.1851500322527224, -0.18919484088528957, 0.40771461584099045, 0.021004815762298124, -0.08233541895892951, 0.18220936444545674, -0.11661825140331392, -0.1954771485391327, 0.09678290817519707, 0.2565464970839182, 0.024459916318653886, -0.20703746257773178, 0.09106106143824008, 0.07950524419941234, 0.12314508129687358, 0.021706719801648323, 0.004586709381052942, 0.2697610933418301, 0.27380389222790574, 0.09382104985133717, 0.07387955441443024, -0.10509107856848983, -0.05931292040358213, -0.2976671345249722, -0.19745869260761095, -0.13584601075324992, -0.03849015008855724, 0.07884189493393712, -0.12444360131595397, 0.46615311507643625, 0.1863139945463362, 0.07578885430385443, 0.005073328814901426, 0.2737806305116409, -0.001804972900021257, 0.09658390472847686, 0.0593591942134398, 0.21537934466632028, 0.046829416159060645, 0.2206494153325559, -0.14402906947846836, 0.06473397242040267, -0.0037018077829006043] |
1,802.08639 | A prototype detector for the CRESST-III low-mass dark matter search | The CRESST-III experiment which is dedicated to low-mass dark matter search
uses scintillating CaWO$_4$ crystals operated as cryogenic particle detectors.
Background discrimination is achieved by exploiting the scintillating light
signal of CaWO$_4$ and by a novel active detector holder presented in this
paper. In a test setup above ground, a nuclear-recoil energy threshold of
$E_{th}=(190.6\pm5.2)$eV is reached with a 24g prototype detector, which
corresponds to an estimated threshold of $\sim$50eV when being operated in the
low-noise CRESST cryostat. This is the lowest threshold reported for direct
dark matter searches. For CRESST-III phase 1, ten such detector modules were
installed in the cryostat which have the potential to improve significantly the
sensitivity to scatterings of dark matter particles with masses down to
$\sim$0.1GeV/c$^2$.
| astro-ph.IM physics.ins-det | the cresstiii experiment which is dedicated to lowmass dark matter search uses scintillating cawo_4 crystals operated as cryogenic particle detectors background discrimination is achieved by exploiting the scintillating light signal of cawo_4 and by a novel active detector holder presented in this paper in a test setup above ground a nuclearrecoil energy threshold of e_th1906pm52ev is reached with a 24g prototype detector which corresponds to an estimated threshold of sim50ev when being operated in the lownoise cresst cryostat this is the lowest threshold reported for direct dark matter searches for cresstiii phase 1 ten such detector modules were installed in the cryostat which have the potential to improve significantly the sensitivity to scatterings of dark matter particles with masses down to sim01gevc2 | [['the', 'cresstiii', 'experiment', 'which', 'is', 'dedicated', 'to', 'lowmass', 'dark', 'matter', 'search', 'uses', 'scintillating', 'cawo_4', 'crystals', 'operated', 'as', 'cryogenic', 'particle', 'detectors', 'background', 'discrimination', 'is', 'achieved', 'by', 'exploiting', 'the', 'scintillating', 'light', 'signal', 'of', 'cawo_4', 'and', 'by', 'a', 'novel', 'active', 'detector', 'holder', 'presented', 'in', 'this', 'paper', 'in', 'a', 'test', 'setup', 'above', 'ground', 'a', 'nuclearrecoil', 'energy', 'threshold', 'of', 'e_th1906pm52ev', 'is', 'reached', 'with', 'a', '24g', 'prototype', 'detector', 'which', 'corresponds', 'to', 'an', 'estimated', 'threshold', 'of', 'sim50ev', 'when', 'being', 'operated', 'in', 'the', 'lownoise', 'cresst', 'cryostat', 'this', 'is', 'the', 'lowest', 'threshold', 'reported', 'for', 'direct', 'dark', 'matter', 'searches', 'for', 'cresstiii', 'phase', '1', 'ten', 'such', 'detector', 'modules', 'were', 'installed', 'in', 'the', 'cryostat', 'which', 'have', 'the', 'potential', 'to', 'improve', 'significantly', 'the', 'sensitivity', 'to', 'scatterings', 'of', 'dark', 'matter', 'particles', 'with', 'masses', 'down', 'to', 'sim01gevc2']] | [-0.06176871083424253, 0.22808092398585267, -0.08888003665369824, 0.02792389427461677, -0.045834756038009614, -0.19065731141905665, 0.032244892436734764, 0.3299412365600277, -0.14484389633792688, -0.4145968066433729, 0.0658824828145552, -0.32990129011035974, 0.01903255597956605, 0.19531944946689783, 0.0032957565864169245, 0.09404684165966208, 0.03969610253273967, 0.03640551412067676, -0.04045021055282046, -0.2242914909828391, 0.20946832887544217, 0.172600998866798, 0.27632439608480464, 0.03321614925418112, 0.17228473972931693, -0.03070445924847371, -0.016827185824217463, -0.07497205259673045, -0.11255747881339137, -0.012865543195788386, 0.3278733797497668, 0.07431133626170962, 0.13926317321996884, -0.39812048093684144, -0.17700468699084754, 0.18423957805449176, 0.10570698876281158, 0.029902165275169694, -0.12861201342321554, -0.3451875590885026, 0.09598366640334538, -0.20916404439357378, -0.12185189529653576, 0.02282757245761863, -0.07403902754471717, 0.01118526307834407, -0.23739901405040933, -0.0061891586717091876, -0.01478961015404281, -0.0318614640667782, -0.035277299290933345, -0.13660601579773604, 0.06776768962805302, -0.023141396757544775, -0.012147748481750615, 0.034104223911634694, 0.25037428586925303, -0.18929096454580835, -0.07684351158549346, 0.33346011407547077, -0.09286089172938018, -0.1075474508757845, 0.1684052920032103, -0.16577578584221586, -0.08711796441368001, 0.21395025478865384, 0.1695172173223632, 0.08572464314352532, -0.2139651761731869, 0.0234723551217585, 0.029198238054404857, 0.2366572627057795, 0.1085907316064241, 0.0259709991238443, 0.2623618086444814, 0.3291825552735383, 0.07776952425306032, 0.1305508259595056, -0.19394774501354006, 0.033709562486195464, -0.3355423849139173, -0.17217252495840696, -0.14858127911811916, -0.011574816109683618, 0.033021640424568295, -0.08077503907517924, 0.36532141467145945, 0.08863082350531624, 0.12770167903153826, -0.02051831897983517, 0.31274228421497646, 0.030556807372427025, 0.08885820201692819, -0.04069618198288589, 0.38993692160998394, 0.11806637219515169, 0.12914344463970953, -0.1764458141731635, -0.013556691032629145, -0.01788456056965515] |
1,802.0864 | HEP Community White Paper on Software trigger and event reconstruction:
Executive Summary | Realizing the physics programs of the planned and upgraded high-energy
physics (HEP) experiments over the next 10 years will require the HEP community
to address a number of challenges in the area of software and computing. For
this reason, the HEP software community has engaged in a planning process over
the past two years, with the objective of identifying and prioritizing the
research and development required to enable the next generation of HEP
detectors to fulfill their full physics potential. The aim is to produce a
Community White Paper which will describe the community strategy and a roadmap
for software and computing research and development in HEP for the 2020s. The
topics of event reconstruction and software triggers were considered by a joint
working group and are summarized together in this document.
| physics.comp-ph | realizing the physics programs of the planned and upgraded highenergy physics hep experiments over the next 10 years will require the hep community to address a number of challenges in the area of software and computing for this reason the hep software community has engaged in a planning process over the past two years with the objective of identifying and prioritizing the research and development required to enable the next generation of hep detectors to fulfill their full physics potential the aim is to produce a community white paper which will describe the community strategy and a roadmap for software and computing research and development in hep for the 2020s the topics of event reconstruction and software triggers were considered by a joint working group and are summarized together in this document | [['realizing', 'the', 'physics', 'programs', 'of', 'the', 'planned', 'and', 'upgraded', 'highenergy', 'physics', 'hep', 'experiments', 'over', 'the', 'next', '10', 'years', 'will', 'require', 'the', 'hep', 'community', 'to', 'address', 'a', 'number', 'of', 'challenges', 'in', 'the', 'area', 'of', 'software', 'and', 'computing', 'for', 'this', 'reason', 'the', 'hep', 'software', 'community', 'has', 'engaged', 'in', 'a', 'planning', 'process', 'over', 'the', 'past', 'two', 'years', 'with', 'the', 'objective', 'of', 'identifying', 'and', 'prioritizing', 'the', 'research', 'and', 'development', 'required', 'to', 'enable', 'the', 'next', 'generation', 'of', 'hep', 'detectors', 'to', 'fulfill', 'their', 'full', 'physics', 'potential', 'the', 'aim', 'is', 'to', 'produce', 'a', 'community', 'white', 'paper', 'which', 'will', 'describe', 'the', 'community', 'strategy', 'and', 'a', 'roadmap', 'for', 'software', 'and', 'computing', 'research', 'and', 'development', 'in', 'hep', 'for', 'the', '2020s', 'the', 'topics', 'of', 'event', 'reconstruction', 'and', 'software', 'triggers', 'were', 'considered', 'by', 'a', 'joint', 'working', 'group', 'and', 'are', 'summarized', 'together', 'in', 'this', 'document']] | [-0.07819875115246484, 0.10011736510998824, -0.05634760193413857, 0.05232722084106585, -0.11268295354746057, -0.09396870714739304, 0.0033219889182047073, 0.36654287226723903, -0.24228603112737113, -0.39866816997528076, 0.14707443738183373, -0.2596697125453361, -0.0917667572626449, 0.24290649581587676, -0.05515331741789299, 0.10605907700179766, 0.14724398851676873, 0.02963728270851513, -0.047168275043297785, -0.2834121154437801, 0.2609880381602455, 0.16605892783792858, 0.30481541105969384, 0.08854730346788667, 0.050089546259683135, 0.02373082811457359, -0.148167797237296, -0.02897625465905576, -0.09867656207114289, 0.18665404055465126, 0.4068564327264374, 0.24777023025407371, 0.37922829886277515, -0.4418765563997581, -0.17829610578800467, 0.09031021947069376, 0.11301731281194159, 0.05840608695760955, -0.08867796187846441, -0.2800549887910937, 0.056047083933442605, -0.241948657669127, -0.13186471573091252, -0.025032023366072804, 0.013830275853362047, 0.026941243982450527, -0.20323736623465788, -0.09064267075595897, 0.01911966857319798, 0.06332148681747529, -0.007804340474787309, -0.11200569909432846, 0.07043592680499634, 0.17333084514812622, 0.05478370158777001, 0.05208551499526948, 0.11610048982115448, -0.1851500322527224, -0.18919484088528957, 0.40771461584099045, 0.021004815762298124, -0.08233541895892951, 0.18220936444545674, -0.11661825140331392, -0.1954771485391327, 0.09678290817519707, 0.2565464970839182, 0.024459916318653886, -0.20703746257773178, 0.09106106143824008, 0.07950524419941234, 0.12314508129687358, 0.021706719801648323, 0.004586709381052942, 0.2697610933418301, 0.27380389222790574, 0.09382104985133717, 0.07387955441443024, -0.10509107856848983, -0.05931292040358213, -0.2976671345249722, -0.19745869260761095, -0.13584601075324992, -0.03849015008855724, 0.07884189493393712, -0.12444360131595397, 0.46615311507643625, 0.1863139945463362, 0.07578885430385443, 0.005073328814901426, 0.2737806305116409, -0.001804972900021257, 0.09658390472847686, 0.0593591942134398, 0.21537934466632028, 0.046829416159060645, 0.2206494153325559, -0.14402906947846836, 0.06473397242040267, -0.0037018077829006043] |
1,802.08641 | Gossiping in Message-Passing Systems | We study the gossip problem in a message-passing environment: When a process
receives a message, it has to decide whether the sender has more recent
information on other processes than itself. This problem is at the heart of
many distributed algorithms, and it is tightly related to questions from formal
methods concerning the expressive power of distributed automata. We provide a
non-deterministic gossip protocol for message-passing systems with unbounded
FIFO channels, using only finitely many local states and a finite message
alphabet. We show that this is optimal in the sense that there is no
deterministic counterpart. As an application, the gossip protocol allows us to
show that message-passing systems capture well-known extensions of linear-time
temporal logics to a concurrent setting.
| cs.FL cs.LO | we study the gossip problem in a messagepassing environment when a process receives a message it has to decide whether the sender has more recent information on other processes than itself this problem is at the heart of many distributed algorithms and it is tightly related to questions from formal methods concerning the expressive power of distributed automata we provide a nondeterministic gossip protocol for messagepassing systems with unbounded fifo channels using only finitely many local states and a finite message alphabet we show that this is optimal in the sense that there is no deterministic counterpart as an application the gossip protocol allows us to show that messagepassing systems capture wellknown extensions of lineartime temporal logics to a concurrent setting | [['we', 'study', 'the', 'gossip', 'problem', 'in', 'a', 'messagepassing', 'environment', 'when', 'a', 'process', 'receives', 'a', 'message', 'it', 'has', 'to', 'decide', 'whether', 'the', 'sender', 'has', 'more', 'recent', 'information', 'on', 'other', 'processes', 'than', 'itself', 'this', 'problem', 'is', 'at', 'the', 'heart', 'of', 'many', 'distributed', 'algorithms', 'and', 'it', 'is', 'tightly', 'related', 'to', 'questions', 'from', 'formal', 'methods', 'concerning', 'the', 'expressive', 'power', 'of', 'distributed', 'automata', 'we', 'provide', 'a', 'nondeterministic', 'gossip', 'protocol', 'for', 'messagepassing', 'systems', 'with', 'unbounded', 'fifo', 'channels', 'using', 'only', 'finitely', 'many', 'local', 'states', 'and', 'a', 'finite', 'message', 'alphabet', 'we', 'show', 'that', 'this', 'is', 'optimal', 'in', 'the', 'sense', 'that', 'there', 'is', 'no', 'deterministic', 'counterpart', 'as', 'an', 'application', 'the', 'gossip', 'protocol', 'allows', 'us', 'to', 'show', 'that', 'messagepassing', 'systems', 'capture', 'wellknown', 'extensions', 'of', 'lineartime', 'temporal', 'logics', 'to', 'a', 'concurrent', 'setting']] | [-0.16851201808476465, 0.03103540658150811, -0.11060220068166694, 0.09382002677127523, -0.10177138278430159, -0.2497778389956956, 0.10302645596098309, 0.42129219797524536, -0.34689324949521666, -0.2354178756075211, 0.08738027867035601, -0.26364883027928937, -0.13968024346669597, 0.19864972934034492, -0.12972974277694116, 0.09027135541878087, 0.0690337136327212, 0.09799758194246298, 0.012128144048523805, -0.2760138385313417, 0.27243301039754053, 0.036934619063265194, 0.2525134215685577, 0.029159062149480355, 0.10967200795912053, 0.04541079576939252, 0.013844153605216791, -0.008096050434507245, -0.07246883815313904, 0.08002232316802525, 0.33725713437600136, 0.2385764366924024, 0.32087934855371714, -0.4247190937292108, -0.2082884558813246, 0.1493899789042309, 0.1566944251775988, 0.15238727203162372, -0.025565370503252118, -0.25984066810982287, 0.13081858711594269, -0.19692780168040094, -0.015643453466983065, -0.019454565684288, 0.0363114295606232, 2.729850782712629e-06, -0.2749668785086102, -0.02178967018681001, 0.12838863990893049, 0.03257736763801457, 0.029485514413946392, -0.019499244845726273, 0.07414390398324121, 0.11002291100073706, -0.009679548896720232, -0.0002691340257513745, 0.11493831643188172, -0.06988417241753132, -0.22103047620385793, 0.3711089216141908, 0.0045429317559421535, -0.19813174531364058, 0.22199265717544153, -0.048397848224806146, -0.19253096505922596, 0.10606947495440437, 0.17330365554883706, 0.1365346707796201, -0.14937928542824297, 0.10964718405907774, -0.11898921920402238, 0.2423832765664936, 0.052845076996494426, 0.07240147609167448, 0.12261096034622328, 0.17123308936942153, 0.15464998027290533, 0.14883757808316914, 0.05366087699701532, -0.1623622564645099, -0.22319525552909697, -0.13616209974404703, -0.1435899168699364, -0.0006323620111273586, -0.06776589941265146, -0.1765476750885329, 0.37125122526752924, 0.1934319985126076, 0.1465929139151492, 0.14649018650289533, 0.34799972835404813, 0.10640840657817369, 0.015269297259775076, 0.18269812321859943, 0.12312857494381649, 0.1412228585898199, 0.11455909270131268, -0.15717281544511782, 0.16064215561640563, 0.04838151809921073] |
1,802.08642 | Search for $C$ violation in the decay $\eta\rightarrow\pi^0+e^++e^-$
with WASA-at-COSY | We report on the investigation of the rare decay
$\eta\rightarrow\pi^0+\text{e}^++\text{e}^-$ which is of interest to study both
$C$ violation in the electromagnetic interaction and to search for
contributions from physics beyond the Standard Model, since the allowed decay
via a two-photon intermediate state is strongly suppressed. The experiment has
been performed using the WASA-at-COSY installation, located at the COSY
accelerator of the Forschungszentrum J\"ulich, Germany. In total $3\times10^7$
events of the reaction $\text{p}+\text{d}\rightarrow{^3\text{He}}+\eta$ have
been recorded at an excess energy of $Q = 59.8\,\textrm{MeV}$. Based on this
data set the $C$ parity violating decay
$\eta\rightarrow\pi^0+\gamma^*\rightarrow\pi^0+\textrm{e}^++\textrm{e}^-$ via a
single-photon intermediate state has been searched for, resulting in new upper
limits of $\Gamma\left(\eta\rightarrow\pi^0+\textrm{e}^++\textrm{e}^-\right)/
\Gamma\left(\eta\rightarrow\pi^++\pi^-+\pi^0\right) < 3.28\times10^{-5}$ and
$\Gamma\left(\eta\rightarrow\pi^0+\textrm{e}^++\textrm{e}^-\right)/
\Gamma\left(\eta\rightarrow\textrm{all}\right) < 7.5\times10^{-6}\ (\textrm{CL}
= 90\,\%)$, respectively.
| hep-ex | we report on the investigation of the rare decay etarightarrowpi0textetexte which is of interest to study both c violation in the electromagnetic interaction and to search for contributions from physics beyond the standard model since the allowed decay via a twophoton intermediate state is strongly suppressed the experiment has been performed using the wasaatcosy installation located at the cosy accelerator of the forschungszentrum julich germany in total 3times107 events of the reaction textptextdrightarrow3textheeta have been recorded at an excess energy of q 598textrmmev based on this data set the c parity violating decay etarightarrowpi0gammarightarrowpi0textrmetextrme via a singlephoton intermediate state has been searched for resulting in new upper limits of gammaleftetarightarrowpi0textrmetextrmeright gammaleftetarightarrowpipipi0right 328times105 and gammaleftetarightarrowpi0textrmetextrmeright gammaleftetarightarrowtextrmallright 75times106 textrmcl 90 respectively | [['we', 'report', 'on', 'the', 'investigation', 'of', 'the', 'rare', 'decay', 'etarightarrowpi0textetexte', 'which', 'is', 'of', 'interest', 'to', 'study', 'both', 'c', 'violation', 'in', 'the', 'electromagnetic', 'interaction', 'and', 'to', 'search', 'for', 'contributions', 'from', 'physics', 'beyond', 'the', 'standard', 'model', 'since', 'the', 'allowed', 'decay', 'via', 'a', 'twophoton', 'intermediate', 'state', 'is', 'strongly', 'suppressed', 'the', 'experiment', 'has', 'been', 'performed', 'using', 'the', 'wasaatcosy', 'installation', 'located', 'at', 'the', 'cosy', 'accelerator', 'of', 'the', 'forschungszentrum', 'julich', 'germany', 'in', 'total', '3times107', 'events', 'of', 'the', 'reaction', 'textptextdrightarrow3textheeta', 'have', 'been', 'recorded', 'at', 'an', 'excess', 'energy', 'of', 'q', '598textrmmev', 'based', 'on', 'this', 'data', 'set', 'the', 'c', 'parity', 'violating', 'decay', 'etarightarrowpi0gammarightarrowpi0textrmetextrme', 'via', 'a', 'singlephoton', 'intermediate', 'state', 'has', 'been', 'searched', 'for', 'resulting', 'in', 'new', 'upper', 'limits', 'of', 'gammaleftetarightarrowpi0textrmetextrmeright', 'gammaleftetarightarrowpipipi0right', '328times105', 'and', 'gammaleftetarightarrowpi0textrmetextrmeright', 'gammaleftetarightarrowtextrmallright', '75times106', 'textrmcl', '90', 'respectively']] | [-0.0880437331593216, 0.1802936161716557, -0.07900803812582227, 0.04951827618168426, -0.020343713436482683, -0.12363612842401145, 0.08662801574812168, 0.29600727322718334, -0.18512465673740264, -0.3306547521992966, 0.07909492573903494, -0.3265423602252095, 0.020231797670324642, 0.20331041752446996, 0.10649679415790295, 0.07382915669155342, 0.055665999013365726, 0.07066655472024447, -0.027636452704124775, -0.16714693550710324, 0.2605019636706587, 0.13658335406540167, 0.28949776384979486, 0.10871385049109382, 0.08167872981155394, 0.0004500954010937777, -0.04101368795252509, -0.07762539329835111, -0.09628645015914959, 0.06906160490621847, 0.22416953628514116, 0.1288073738493646, 0.1941307849785382, -0.41918820414381724, -0.13033341020949324, 0.135250004844878, 0.12598083001406243, 0.0703185299116066, -0.09596285261041312, -0.33204874783512894, 0.06914320566553485, -0.1799446071403239, -0.06850066662041678, -0.011126513198380254, 0.04524549857079466, -0.030026210081780812, -0.27435198833269103, 0.021652937888305773, -0.028267728953829244, 0.07890266642007865, -0.013048253048004376, -0.1717942585668492, 0.0038655696294477414, 0.06748606860896365, 0.04336760947491577, 0.04388447349413548, 0.12873466058496247, -0.11511017796281656, -0.15015866810938827, 0.34664360261349764, -0.0832517841880434, -0.09049380872036433, 0.17693501899096495, -0.21574274313429165, -0.15136101525018197, 0.18919251825125818, 0.21305145871722037, 0.10274421838915225, -0.19361679404284116, 0.14015436304314924, -0.0011098530591913947, 0.14485771414021859, 0.06962245110318893, 0.047901870855302724, 0.19182740872794832, 0.2212001012133745, -0.014955759227396575, 0.1407820803406476, -0.1647752208044511, -0.06322924646169499, -0.34696628312425065, -0.12098566820431086, -0.1371616169085933, 0.0404116827606534, 0.06333252777174628, -0.056669703240644326, 0.3775780787819477, 0.08188490446493099, 0.18898480050955657, -0.0346493330100741, 0.26455509125393023, 0.10763290360113455, 0.08587234237886689, 0.044794255552847904, 0.3484046655724308, 0.10938033142506524, 0.126992235368191, -0.25403340549544534, 0.09513401391450316, -0.002220297329283009] |
1,802.08643 | Scattering on a rectangular potential barrier in nodal-line Weyl
semimetals | We investigate single-particle ballistic scattering on a rectangular barrier
in the nodal-line Weyl semimetals. Since the system under study has a
crystallographic anisotropy, the scattering properties are dependent on mutual
orientation of the crystalline axis and the barrier. To account for the
anisotropy, we examine two different barrier orientations. It is demonstrated
that, for certain angles of incidence, the incoming particle passes through the
barrier with probability of unity. This is a manifestation of the Klein
tunneling, a familiar phenomenon in the context of graphene and semimetals with
Weyl points. However, the Klein tunneling in the Weyl-ring systems is observed
when the angle of incidence differs from 90$^\circ$, unlike the cases of
graphene and Weyl-point semimetals. The reflectionless transmission also occurs
for the so-called `magic angles'. The values of `the magic angles' are
determined by geometrical resonances between the barrier width and the de
Broglie length of the scattered particle. In addition, we show that under
certain conditions the wave function of the transmitted and reflected particles
may be a superposition of two plane waves with unequal momenta. Such a feature
is a consequence of the non-trivial structure of the iso-energy surfaces of the
nodal-line semimetals.
| cond-mat.mes-hall | we investigate singleparticle ballistic scattering on a rectangular barrier in the nodalline weyl semimetals since the system under study has a crystallographic anisotropy the scattering properties are dependent on mutual orientation of the crystalline axis and the barrier to account for the anisotropy we examine two different barrier orientations it is demonstrated that for certain angles of incidence the incoming particle passes through the barrier with probability of unity this is a manifestation of the klein tunneling a familiar phenomenon in the context of graphene and semimetals with weyl points however the klein tunneling in the weylring systems is observed when the angle of incidence differs from 90circ unlike the cases of graphene and weylpoint semimetals the reflectionless transmission also occurs for the socalled magic angles the values of the magic angles are determined by geometrical resonances between the barrier width and the de broglie length of the scattered particle in addition we show that under certain conditions the wave function of the transmitted and reflected particles may be a superposition of two plane waves with unequal momenta such a feature is a consequence of the nontrivial structure of the isoenergy surfaces of the nodalline semimetals | [['we', 'investigate', 'singleparticle', 'ballistic', 'scattering', 'on', 'a', 'rectangular', 'barrier', 'in', 'the', 'nodalline', 'weyl', 'semimetals', 'since', 'the', 'system', 'under', 'study', 'has', 'a', 'crystallographic', 'anisotropy', 'the', 'scattering', 'properties', 'are', 'dependent', 'on', 'mutual', 'orientation', 'of', 'the', 'crystalline', 'axis', 'and', 'the', 'barrier', 'to', 'account', 'for', 'the', 'anisotropy', 'we', 'examine', 'two', 'different', 'barrier', 'orientations', 'it', 'is', 'demonstrated', 'that', 'for', 'certain', 'angles', 'of', 'incidence', 'the', 'incoming', 'particle', 'passes', 'through', 'the', 'barrier', 'with', 'probability', 'of', 'unity', 'this', 'is', 'a', 'manifestation', 'of', 'the', 'klein', 'tunneling', 'a', 'familiar', 'phenomenon', 'in', 'the', 'context', 'of', 'graphene', 'and', 'semimetals', 'with', 'weyl', 'points', 'however', 'the', 'klein', 'tunneling', 'in', 'the', 'weylring', 'systems', 'is', 'observed', 'when', 'the', 'angle', 'of', 'incidence', 'differs', 'from', '90circ', 'unlike', 'the', 'cases', 'of', 'graphene', 'and', 'weylpoint', 'semimetals', 'the', 'reflectionless', 'transmission', 'also', 'occurs', 'for', 'the', 'socalled', 'magic', 'angles', 'the', 'values', 'of', 'the', 'magic', 'angles', 'are', 'determined', 'by', 'geometrical', 'resonances', 'between', 'the', 'barrier', 'width', 'and', 'the', 'de', 'broglie', 'length', 'of', 'the', 'scattered', 'particle', 'in', 'addition', 'we', 'show', 'that', 'under', 'certain', 'conditions', 'the', 'wave', 'function', 'of', 'the', 'transmitted', 'and', 'reflected', 'particles', 'may', 'be', 'a', 'superposition', 'of', 'two', 'plane', 'waves', 'with', 'unequal', 'momenta', 'such', 'a', 'feature', 'is', 'a', 'consequence', 'of', 'the', 'nontrivial', 'structure', 'of', 'the', 'isoenergy', 'surfaces', 'of', 'the', 'nodalline', 'semimetals']] | [-0.22735891771531597, 0.2008994075844122, -0.05987447913563282, 0.05542952223553697, -0.05834668563059579, -0.13562797835293544, 0.03945079070429519, 0.36747112895179657, -0.275280989446082, -0.2693954343984345, 0.00023058390715303495, -0.29527992404728515, -0.16313288786170102, 0.20276772258107156, 0.01562614745902109, 0.03845237505651987, 0.007653564794382714, -0.0001854596157875104, -0.0944003730834721, -0.18683461560603692, 0.3544511332719097, 0.029335811779355465, 0.29562984549286825, 0.08174935236186769, 0.08034069527699084, 0.08880893301732416, 0.07991618379415252, 0.020794959488683293, -0.14758008221902744, 0.04627180350080286, 0.18438853768478194, -0.027127761206560835, 0.15889716243669005, -0.40700335095914986, -0.187261933091183, 0.039915217326704375, 0.13553695573673114, 0.13283110566235617, -0.05616235307696247, -0.2956615302270067, 0.026484817376878765, -0.10274110993336809, -0.17362036618413693, 0.044607735839048306, 0.012645425810238597, 0.020677390336131043, -0.20023909492985845, 0.0624925537170187, 0.04284791714006545, 0.06670305165990266, -0.04905569713836363, -0.09173779359228966, -0.09297938185465551, 0.07292289314080466, 0.094866274940042, -0.04947595953336466, 0.1128288112981629, -0.12113893179723408, -0.121680067734524, 0.42335447045907226, 0.005731515785602411, -0.18672695650412166, 0.1408370672581122, -0.20937005311164275, -0.020454471549211244, 0.18048088170213566, 0.11752524098967077, 0.10824704155105061, -0.07416076888997869, 0.10974251595895843, -0.07831680718513827, 0.08723005988351885, 0.14212276153362444, 0.039324725855660346, 0.2586953330451392, 0.10461467473537267, 0.0647360781590531, 0.12828631896331197, -0.1706278413803, -0.05972224467232363, -0.2967894443769258, -0.19989121709854255, -0.211155854643817, 0.037567083799078, -0.07193131263560758, -0.20297131538583138, 0.4290461000103081, 0.1082422798097412, 0.23446947293231243, -0.017755282896369236, 0.25552125877134274, 0.14961972827399053, 0.07687324274465748, 0.001166597263138626, 0.2802924652735117, 0.15034877274907915, 0.08185372730841879, -0.2399782634906701, 0.08019926808486433, 0.018552124923705386] |
1,802.08644 | Navier--Stokes equations on the $\beta$-plane: determining modes and
nodes | We revisit the 2d Navier--Stokes equations on the periodic $\beta$-plane,
with the Coriolis parameter varying as $\beta y$, and obtain bounds on the
number of determining modes and nodes of the flow. The number of modes {and
nodes} scale as $cG_0^{1/2} + c'(M/\beta)^{1/2}$ and $cG_0^{2/3} +
c'(M/\beta)^{1/2}$ respectively, where the Grashof number
$G_0=|f_v|_{L^2}^{}/(\mu^2\kappa_0^2)$ and $M$ involves higher derivatives of
the forcing $f_v$. For large $\beta$ (strong rotation), this results in fewer
degrees of freedom than the classical (non-rotating) bound that scales as
$cG_0$.
| math.AP physics.geo-ph | we revisit the 2d navierstokes equations on the periodic betaplane with the coriolis parameter varying as beta y and obtain bounds on the number of determining modes and nodes of the flow the number of modes and nodes scale as cg_012 cmbeta12 and cg_023 cmbeta12 respectively where the grashof number g_0f_v_l2mu2kappa_02 and m involves higher derivatives of the forcing f_v for large beta strong rotation this results in fewer degrees of freedom than the classical nonrotating bound that scales as cg_0 | [['we', 'revisit', 'the', '2d', 'navierstokes', 'equations', 'on', 'the', 'periodic', 'betaplane', 'with', 'the', 'coriolis', 'parameter', 'varying', 'as', 'beta', 'y', 'and', 'obtain', 'bounds', 'on', 'the', 'number', 'of', 'determining', 'modes', 'and', 'nodes', 'of', 'the', 'flow', 'the', 'number', 'of', 'modes', 'and', 'nodes', 'scale', 'as', 'cg_012', 'cmbeta12', 'and', 'cg_023', 'cmbeta12', 'respectively', 'where', 'the', 'grashof', 'number', 'g_0f_v_l2mu2kappa_02', 'and', 'm', 'involves', 'higher', 'derivatives', 'of', 'the', 'forcing', 'f_v', 'for', 'large', 'beta', 'strong', 'rotation', 'this', 'results', 'in', 'fewer', 'degrees', 'of', 'freedom', 'than', 'the', 'classical', 'nonrotating', 'bound', 'that', 'scales', 'as', 'cg_0']] | [-0.2159817936271429, 0.20911373205172518, 0.013232338080803553, 0.016417395228830477, -0.05462928424899777, -0.1072113661809514, 0.04105359753593803, 0.21642457495133083, -0.2297935482735435, -0.3544503293186426, 0.09065191900978485, -0.2674329578628143, -0.07527493144075076, 0.20059769574242334, -0.002437996979181965, 0.05514202008023858, 0.01579445678619474, 0.05635692189137141, -0.051001628410692015, -0.21201282691520948, 0.32632263337572415, 0.03835976878801982, 0.21717694990336894, -0.018293969358007114, 0.0940815809989969, -0.013913590492059787, -0.01868592663357655, 0.034503379787007966, -0.19477961662273932, 0.05351527785261472, 0.15281064920748275, 0.028273778203874826, 0.25280784916132687, -0.43206540883208316, -0.2071283523614208, 0.07427074206372102, 0.15920644811044138, 0.06980495568364858, 0.03269881742385527, -0.23231073944984626, 0.07477298234899839, -0.11952117200319966, -0.13789660385499397, -0.05928593854730328, 0.07956859258313974, 0.08626848509535194, -0.3128155948811521, 0.12138467243562143, 0.06691262573003769, 0.08642435035357873, -0.04460338963816563, -0.17286154825861255, -0.08825881532082955, 0.10538305724660556, 0.1266148632237067, 0.03038591378678878, 0.07891618176052968, -0.18263490743624666, -0.03738894092539946, 0.37740406618764005, -0.09268146373118119, -0.2656080175439517, 0.18692431784545382, -0.17864876257876555, -0.08968412006273865, 0.1052423246204853, 0.20080451878408592, 0.15229200496027867, -0.026482446957379578, 0.08400654542803143, -0.07677887546519438, 0.17917500710735718, 0.12540853414684533, 0.06420737248534958, 0.13314722313856084, 0.11761795330792665, 0.13280091387530168, 0.10886540923578043, -0.13785323607890557, -0.08093105333546798, -0.31277063851555187, -0.1460304737316134, -0.18153828581174214, 0.018805544261510175, -0.17355028871349834, -0.16770782279316335, 0.37562630280231435, 0.09685143935882176, 0.2035524855554104, 0.09371097619334856, 0.2683808288536966, 0.11116308864982177, 0.051467529013752934, 0.1186525372043252, 0.2412911973427981, 0.16719289155987402, 0.053798745957513654, -0.26358744273117435, -0.009658698284377654, 0.09552600738902886] |
1,802.08645 | Interactive Image Manipulation with Natural Language Instruction
Commands | We propose an interactive image-manipulation system with natural language
instruction, which can generate a target image from a source image and an
instruction that describes the difference between the source and the target
image. The system makes it possible to modify a generated image interactively
and make natural language conditioned image generation more controllable. We
construct a neural network that handles image vectors in latent space to
transform the source vector to the target vector by using the vector of
instruction. The experimental results indicate that the proposed framework
successfully generates the target image by using a source image and an
instruction on manipulation in our dataset.
| cs.CV | we propose an interactive imagemanipulation system with natural language instruction which can generate a target image from a source image and an instruction that describes the difference between the source and the target image the system makes it possible to modify a generated image interactively and make natural language conditioned image generation more controllable we construct a neural network that handles image vectors in latent space to transform the source vector to the target vector by using the vector of instruction the experimental results indicate that the proposed framework successfully generates the target image by using a source image and an instruction on manipulation in our dataset | [['we', 'propose', 'an', 'interactive', 'imagemanipulation', 'system', 'with', 'natural', 'language', 'instruction', 'which', 'can', 'generate', 'a', 'target', 'image', 'from', 'a', 'source', 'image', 'and', 'an', 'instruction', 'that', 'describes', 'the', 'difference', 'between', 'the', 'source', 'and', 'the', 'target', 'image', 'the', 'system', 'makes', 'it', 'possible', 'to', 'modify', 'a', 'generated', 'image', 'interactively', 'and', 'make', 'natural', 'language', 'conditioned', 'image', 'generation', 'more', 'controllable', 'we', 'construct', 'a', 'neural', 'network', 'that', 'handles', 'image', 'vectors', 'in', 'latent', 'space', 'to', 'transform', 'the', 'source', 'vector', 'to', 'the', 'target', 'vector', 'by', 'using', 'the', 'vector', 'of', 'instruction', 'the', 'experimental', 'results', 'indicate', 'that', 'the', 'proposed', 'framework', 'successfully', 'generates', 'the', 'target', 'image', 'by', 'using', 'a', 'source', 'image', 'and', 'an', 'instruction', 'on', 'manipulation', 'in', 'our', 'dataset']] | [-0.03993226199318602, 0.03866726182385256, -0.09818618055784477, 0.07795953832101077, -0.12602394775329334, -0.14520787399422536, 0.042822015599154356, 0.46714676927142545, -0.3138033030993955, -0.3284451355806218, 0.041093005717486, -0.257998180320873, -0.1393894848352263, 0.214511009565783, -0.12185516398848158, 0.06648356719206105, 0.1336504781996515, 0.09623426043885355, -0.027758501868207393, -0.23692818842652552, 0.346414109340535, 0.037058324122555414, 0.32030252966467504, -0.017248207962421595, 0.20970066515992414, 0.018287261526258487, -0.042532119807734525, -0.07761647718006368, 0.009692342127170874, 0.1944501792006019, 0.2919024596614587, 0.2700123209989507, 0.249191018506744, -0.4279903473402813, -0.1889620056059563, 0.027920739514366636, 0.08907754148163323, 0.13012095018320735, -0.11028457606908149, -0.36745273875388895, 0.11186645868814217, -0.12497600627500775, 0.02988451690290053, -0.1162472104495567, -0.0005688277503721556, -0.035519951133536315, -0.30384527595125066, -0.050603267490723226, 0.11596054190172339, 0.0416759992158919, -0.08324659795869353, -0.028678833153362403, -0.019329641372369567, 0.16738836286712508, -0.013375819115987364, 0.16379583216676452, 0.14605540569096295, -0.17866442688325648, -0.13449660635922314, 0.39863426235662597, -0.09735691679624033, -0.2704675339737837, 0.16477544828458637, -0.049657304591130255, -0.09292059415898654, 0.09283802273929259, 0.2324268480868272, 0.07822083886097765, -0.15314455110720307, 0.012809261615950404, -0.07470864219204434, 0.2612562464761003, 0.0639625057613231, -0.04550705131863789, 0.22613230320835873, 0.19517869642882976, 0.02563022504086202, 0.22726601449869363, -0.17403626332349442, -0.0354411855591505, -0.27475797143360636, -0.15163493001798414, -0.19678556915583476, -0.04116696689084594, -0.06986386288904128, -0.14769010646883748, 0.4429217480729281, 0.2278024922783996, 0.22499066376004298, 0.04403505433583632, 0.31498685855207575, 0.05389792239842585, 0.12281440912728321, 0.056577905098784645, 0.07486966923582104, 0.005983938924300502, 0.11327937341137033, -0.16141995911284368, 0.04285271885312812, 0.02945807439116937] |
1,802.08646 | The Three-Dimensional Spatial Distribution of Interstellar Gas in the
Milky Way: Implications for Cosmic Rays and High-Energy Gamma-Ray Emissions | Direct measurements of cosmic ray (CR) species combined with observations of
their associated gamma-ray emissions can be used to constrain models of CR
propagation, trace the structure of the Galaxy, and search for signatures of
new physics. The spatial density distribution of the interstellar gas is a
vital element for all these studies. So far models have employed the 2D
cylindrically symmetric geometry, but their accuracy is well behind that of the
available data. In this paper, 3D spatial density models for the neutral and
molecular hydrogen are constructed based on empirical model fitting to gas
line-survey data. The developed density models incorporate spiral arms and
account for the warping of the disk, and the increasing gas scale height with
radial distance from the Galactic center. They are employed together with the
GALPROP CR propagation code to investigate how the new 3D gas models affect
calculations of CR propagation and high-energy gamma-ray intensity maps. The
calculations made reveal non-trivial features that are directly related to the
new gas models. The best-fit values for propagation model parameters employing
3D gas models are presented and they differ significantly from the values
derived with the 2D gas density models that have been widely used. The
combination of 3D CR and gas density models provide a more realistic basis for
the interpretation of non-thermal emissions from the Galaxy.
| astro-ph.HE astro-ph.GA | direct measurements of cosmic ray cr species combined with observations of their associated gammaray emissions can be used to constrain models of cr propagation trace the structure of the galaxy and search for signatures of new physics the spatial density distribution of the interstellar gas is a vital element for all these studies so far models have employed the 2d cylindrically symmetric geometry but their accuracy is well behind that of the available data in this paper 3d spatial density models for the neutral and molecular hydrogen are constructed based on empirical model fitting to gas linesurvey data the developed density models incorporate spiral arms and account for the warping of the disk and the increasing gas scale height with radial distance from the galactic center they are employed together with the galprop cr propagation code to investigate how the new 3d gas models affect calculations of cr propagation and highenergy gammaray intensity maps the calculations made reveal nontrivial features that are directly related to the new gas models the bestfit values for propagation model parameters employing 3d gas models are presented and they differ significantly from the values derived with the 2d gas density models that have been widely used the combination of 3d cr and gas density models provide a more realistic basis for the interpretation of nonthermal emissions from the galaxy | [['direct', 'measurements', 'of', 'cosmic', 'ray', 'cr', 'species', 'combined', 'with', 'observations', 'of', 'their', 'associated', 'gammaray', 'emissions', 'can', 'be', 'used', 'to', 'constrain', 'models', 'of', 'cr', 'propagation', 'trace', 'the', 'structure', 'of', 'the', 'galaxy', 'and', 'search', 'for', 'signatures', 'of', 'new', 'physics', 'the', 'spatial', 'density', 'distribution', 'of', 'the', 'interstellar', 'gas', 'is', 'a', 'vital', 'element', 'for', 'all', 'these', 'studies', 'so', 'far', 'models', 'have', 'employed', 'the', '2d', 'cylindrically', 'symmetric', 'geometry', 'but', 'their', 'accuracy', 'is', 'well', 'behind', 'that', 'of', 'the', 'available', 'data', 'in', 'this', 'paper', '3d', 'spatial', 'density', 'models', 'for', 'the', 'neutral', 'and', 'molecular', 'hydrogen', 'are', 'constructed', 'based', 'on', 'empirical', 'model', 'fitting', 'to', 'gas', 'linesurvey', 'data', 'the', 'developed', 'density', 'models', 'incorporate', 'spiral', 'arms', 'and', 'account', 'for', 'the', 'warping', 'of', 'the', 'disk', 'and', 'the', 'increasing', 'gas', 'scale', 'height', 'with', 'radial', 'distance', 'from', 'the', 'galactic', 'center', 'they', 'are', 'employed', 'together', 'with', 'the', 'galprop', 'cr', 'propagation', 'code', 'to', 'investigate', 'how', 'the', 'new', '3d', 'gas', 'models', 'affect', 'calculations', 'of', 'cr', 'propagation', 'and', 'highenergy', 'gammaray', 'intensity', 'maps', 'the', 'calculations', 'made', 'reveal', 'nontrivial', 'features', 'that', 'are', 'directly', 'related', 'to', 'the', 'new', 'gas', 'models', 'the', 'bestfit', 'values', 'for', 'propagation', 'model', 'parameters', 'employing', '3d', 'gas', 'models', 'are', 'presented', 'and', 'they', 'differ', 'significantly', 'from', 'the', 'values', 'derived', 'with', 'the', '2d', 'gas', 'density', 'models', 'that', 'have', 'been', 'widely', 'used', 'the', 'combination', 'of', '3d', 'cr', 'and', 'gas', 'density', 'models', 'provide', 'a', 'more', 'realistic', 'basis', 'for', 'the', 'interpretation', 'of', 'nonthermal', 'emissions', 'from', 'the', 'galaxy']] | [-0.024906791682666244, 0.07903450895560228, -0.05442144345876347, 0.11245015845581839, -0.04351730258183161, -0.09490504421840835, -0.02527579264203713, 0.41612202771041423, -0.25203872986572207, -0.3237158556723541, 0.050370745015781655, -0.27998466572553055, -0.06226153815825023, 0.19400695826119072, 0.07087707286909423, 0.048969412520721, 0.035152950356484726, -0.0594484897876198, -0.0835753075398438, -0.19519116415760576, 0.33284959544097764, 0.1439037563053749, 0.2599207066049624, 0.023532632568166196, 0.059944357626680954, -0.06930057217905741, -0.08999919978433994, 0.012610544615546284, -0.15271411767547752, 0.152216851958721, 0.18286146190795108, 0.13139699381930678, 0.15107004890832298, -0.47152567111924626, -0.3358961614141149, 0.07620755699985231, 0.15040682607451494, 0.10211604788341881, -0.07606552585609927, -0.2800137491566818, 0.02954274353468394, -0.16532289991131938, -0.16204492961611983, -0.024788412659099084, -0.027232964648426648, 0.07957085985805204, -0.23693450295179455, 0.09741880102479838, 0.006660381684418049, 0.04565196662859087, -0.10459514383921993, -0.12129952019130635, -0.06833351220446952, 0.1273780753877799, 0.03329151290711099, 0.038336237758865806, 0.1687923285712367, -0.13452373800335676, -0.06119099071023844, 0.42664984692798535, -0.07638834529522924, -0.1532849302586385, 0.2447475980154986, -0.16542621821555573, -0.1402281630834389, 0.15986145155153533, 0.2076549057602348, 0.06297070674614923, -0.13986565183556843, 0.06556801638496004, -0.04677992510440187, 0.16479070846047753, -0.004332072865802611, 0.017129779059461822, 0.2748512303531838, 0.10125428071922117, 0.0024255350098481626, 0.046568783369195135, -0.18882005143886632, -0.0642085818880793, -0.23101795201853853, -0.12832613578358573, -0.15073160540715544, 0.007344452877249151, -0.08703321096013068, -0.143783887410787, 0.38327506227803004, 0.16206008185879975, 0.22041463824991353, 0.016803925146971047, 0.3184794504446032, 0.0998760072567663, 0.0870606557407621, 0.11030526139831898, 0.2500618588296287, 0.15388297174551896, 0.07540766650292972, -0.21008502122462672, 0.09833297647761323, 0.029263456802055107] |
1,802.08647 | On dual definite subspaces in Krein space | Extensions of dual definite subspaces to dual maximal definite ones are
described. The concepts of dual quasi maximal subspaces and quasi basis are
introduced and studied. The obtained results are applied to the classification
of C-symmetries.
| math.FA math-ph math.MP | extensions of dual definite subspaces to dual maximal definite ones are described the concepts of dual quasi maximal subspaces and quasi basis are introduced and studied the obtained results are applied to the classification of csymmetries | [['extensions', 'of', 'dual', 'definite', 'subspaces', 'to', 'dual', 'maximal', 'definite', 'ones', 'are', 'described', 'the', 'concepts', 'of', 'dual', 'quasi', 'maximal', 'subspaces', 'and', 'quasi', 'basis', 'are', 'introduced', 'and', 'studied', 'the', 'obtained', 'results', 'are', 'applied', 'to', 'the', 'classification', 'of', 'csymmetries']] | [-0.10081977780376161, 0.13246019667546663, -0.02488810531795025, 0.12208825615899903, -0.0828502862581185, -0.14849533907004764, -0.07575665158884866, 0.3543387823871204, -0.28152053143296923, -0.14600608572363855, 0.15138070934585163, -0.27692378908395765, -0.13000645054770368, 0.20610944139105933, -0.07693623964275632, 0.10468648898282222, 0.02081259415884103, 0.06953978804605347, -0.21607693465692657, -0.3131197149200099, 0.317898307208504, 0.036222900875977106, 0.3020303777818169, -0.016905461890356882, 0.12306067155940192, 0.0292098011156278, -0.12425360879195588, 0.09219112481389727, -0.12739226073026658, 0.20266547703317234, 0.3076338455080986, 0.1527936683036387, 0.19539391552763327, -0.3691412576607295, -0.14732684594179904, 0.16682000915919032, 0.11485877756827644, 0.016892316804400512, -0.010774298225130353, -0.293657356487321, 0.10926581215379494, -0.12944516031337636, -0.16373127145426614, -0.15918378670300756, -0.030197738520135835, 0.018098103015550544, -0.27766120952687096, 0.01573262672339167, 0.1123149886727333, 0.05444719865918159, -0.1453231156005391, -0.15955308292593276, -0.05297600621623652, 0.058535968299422945, -0.00286147945693561, -0.007047758610653026, 0.05822595514889274, -0.03993423273786902, -0.2319684658731733, 0.3374468786375863, -0.029642692367945398, -0.2836028508841991, 0.2240626682128225, -0.1380010178046567, -0.04420106098321932, 0.07596014368214778, 0.11085327217089279, 0.12672574562685832, -0.10429363854761635, 0.11926882104370244, -0.10206795006192156, -0.007763596198388508, 0.09786621570321066, 0.1021721672798906, 0.16140274299042565, 0.04102749122040612, 0.06264332120439836, 0.16413474756825183, 0.04477366799754756, -0.1588706665539316, -0.3157274109444448, -0.10879775711468288, -0.18668668781008038, -0.005855251103639603, -0.026280282729671204, -0.17998795378620602, 0.4287044710346631, 0.00224874953606299, 0.23300152865371535, 0.0372475303709507, 0.15504784401107047, 0.11506992461425918, 0.0731666595408959, 0.039206792121487005, 0.20531683745128768, 0.27539950848690103, -0.02685387773173196, -0.1860098958015442, -0.048462255897798706, 0.21404546563114438] |
1,802.08648 | Evidence for negative thermal expansion in the superconducting precursor
phase SmFeAsO | The fluorine-doped rare-earth iron oxypnictide series SmFeAsO$_{1-x}$F$_x$ (0
$\leq x \leq$ 0.10) was investigated with high resolution powder x-ray
scattering. In agreement with previous studies, the parent compound SmFeAsO
exhibits a tetragonal-to-orthorhombic structural distortion at
T$\rm{_{S}}$~=~130~K which is rapidly suppressed by $x \simeq$ 0.10 deep within
the superconducting dome. The change in unit cell symmetry is followed by a
previously unreported magnetoelastic distortion at 120~K. The temperature
dependence of the thermal expansion coefficient $\alpha_{V}$ reveals a rich
phase diagram for SmFeAsO: (i) a global minimum at 125 K corresponds to the
opening of a spin-density wave instability as measured by pump-probe
femtosecond spectroscopy whilst (ii) a global maximum at 110 K corresponds to
magnetic ordering of the Sm and Fe sublattices as measured by magnetic x-ray
scattering. At much lower temperatures than T$\rm{_{N}}$, SmFeAsO exhibits a
significant negative thermal expansion on the order of -40~ppm~$\cdot$~K$^{-1}$
in contrast to the behavior of other rare-earth oxypnictides such as PrFeAsO
and the actinide oxypnictide NpFeAsO where the onset of $\alpha <$ 0 only
appears in the vicinity of magnetic ordering. Correlating this feature with the
temperature and doping dependence of the resistivity and the unit cell
parameters, we interpret the negative thermal expansion as being indicative of
the possible condensation of itinerant electrons accompanying the opening of a
SDW gap, consistent with transport measurements.
| cond-mat.supr-con | the fluorinedoped rareearth iron oxypnictide series smfeaso_1xf_x 0 leq x leq 010 was investigated with high resolution powder xray scattering in agreement with previous studies the parent compound smfeaso exhibits a tetragonaltoorthorhombic structural distortion at trm_s130k which is rapidly suppressed by x simeq 010 deep within the superconducting dome the change in unit cell symmetry is followed by a previously unreported magnetoelastic distortion at 120k the temperature dependence of the thermal expansion coefficient alpha_v reveals a rich phase diagram for smfeaso i a global minimum at 125 k corresponds to the opening of a spindensity wave instability as measured by pumpprobe femtosecond spectroscopy whilst ii a global maximum at 110 k corresponds to magnetic ordering of the sm and fe sublattices as measured by magnetic xray scattering at much lower temperatures than trm_n smfeaso exhibits a significant negative thermal expansion on the order of 40ppmcdotk1 in contrast to the behavior of other rareearth oxypnictides such as prfeaso and the actinide oxypnictide npfeaso where the onset of alpha 0 only appears in the vicinity of magnetic ordering correlating this feature with the temperature and doping dependence of the resistivity and the unit cell parameters we interpret the negative thermal expansion as being indicative of the possible condensation of itinerant electrons accompanying the opening of a sdw gap consistent with transport measurements | [['the', 'fluorinedoped', 'rareearth', 'iron', 'oxypnictide', 'series', 'smfeaso_1xf_x', '0', 'leq', 'x', 'leq', '010', 'was', 'investigated', 'with', 'high', 'resolution', 'powder', 'xray', 'scattering', 'in', 'agreement', 'with', 'previous', 'studies', 'the', 'parent', 'compound', 'smfeaso', 'exhibits', 'a', 'tetragonaltoorthorhombic', 'structural', 'distortion', 'at', 'trm_s130k', 'which', 'is', 'rapidly', 'suppressed', 'by', 'x', 'simeq', '010', 'deep', 'within', 'the', 'superconducting', 'dome', 'the', 'change', 'in', 'unit', 'cell', 'symmetry', 'is', 'followed', 'by', 'a', 'previously', 'unreported', 'magnetoelastic', 'distortion', 'at', '120k', 'the', 'temperature', 'dependence', 'of', 'the', 'thermal', 'expansion', 'coefficient', 'alpha_v', 'reveals', 'a', 'rich', 'phase', 'diagram', 'for', 'smfeaso', 'i', 'a', 'global', 'minimum', 'at', '125', 'k', 'corresponds', 'to', 'the', 'opening', 'of', 'a', 'spindensity', 'wave', 'instability', 'as', 'measured', 'by', 'pumpprobe', 'femtosecond', 'spectroscopy', 'whilst', 'ii', 'a', 'global', 'maximum', 'at', '110', 'k', 'corresponds', 'to', 'magnetic', 'ordering', 'of', 'the', 'sm', 'and', 'fe', 'sublattices', 'as', 'measured', 'by', 'magnetic', 'xray', 'scattering', 'at', 'much', 'lower', 'temperatures', 'than', 'trm_n', 'smfeaso', 'exhibits', 'a', 'significant', 'negative', 'thermal', 'expansion', 'on', 'the', 'order', 'of', '40ppmcdotk1', 'in', 'contrast', 'to', 'the', 'behavior', 'of', 'other', 'rareearth', 'oxypnictides', 'such', 'as', 'prfeaso', 'and', 'the', 'actinide', 'oxypnictide', 'npfeaso', 'where', 'the', 'onset', 'of', 'alpha', '0', 'only', 'appears', 'in', 'the', 'vicinity', 'of', 'magnetic', 'ordering', 'correlating', 'this', 'feature', 'with', 'the', 'temperature', 'and', 'doping', 'dependence', 'of', 'the', 'resistivity', 'and', 'the', 'unit', 'cell', 'parameters', 'we', 'interpret', 'the', 'negative', 'thermal', 'expansion', 'as', 'being', 'indicative', 'of', 'the', 'possible', 'condensation', 'of', 'itinerant', 'electrons', 'accompanying', 'the', 'opening', 'of', 'a', 'sdw', 'gap', 'consistent', 'with', 'transport', 'measurements']] | [-0.15670281729965646, 0.23954630393399706, -0.0026767134305930905, -0.007025175873288876, -0.04515176338319611, -0.12449505398788142, 0.12776041625500528, 0.37777580144334466, -0.2588842005956025, -0.29972197802969114, 0.00790928705479555, -0.40242466046410497, -0.02932845690708247, 0.13238218152886985, 0.08199503416869326, -0.0110236842631607, -0.0971118117287521, 0.025055062442895643, -0.1690945910927754, -0.1735582340783375, 0.23071476328723167, 0.07779742457808965, 0.30057532905948603, 0.056358252762503544, 0.04368170600144133, -0.023347699734669883, 0.11825270830274856, 0.022428602218404755, -0.18468953598175875, 0.011942881161630291, 0.2600797346969079, -0.08016736896532643, 0.1952182202619256, -0.34044218697254697, -0.23031957219606952, -0.0029713665178122883, 0.1479073892616289, 0.0492724992215745, -0.06580233868881566, -0.2214975196783418, 0.0740748625575921, -0.10583576093500797, -0.1324801794671741, -0.048421518122662, -0.014044279711157908, -0.022415204002620644, -0.2792348263609279, 0.15967915909716748, 0.05409245942354477, 0.17104282741722424, -0.10976883363995855, -0.17261036720624717, -0.08079348303901229, -0.01396711817127116, 0.07597681643733162, 0.12378259692212334, 0.13893692314996028, -0.07375048589892685, -0.05806061397692884, 0.3482135298623261, -0.07917980000883403, 0.038785618017449085, 0.12806514597794016, -0.2665008676736208, -0.11256422722557385, 0.2450852777620065, 0.0771659075812016, 0.11437777289369654, -0.11439583301844616, 0.06765847711089981, -0.008044101612163334, 0.21319717249976822, 0.07587991202838101, 0.07043315051951685, 0.2356761606852202, 0.2194085617990701, 0.0034331970006948515, 0.139302534674893, -0.1515881245975138, 0.002664906019720459, -0.2315147848969351, -0.14818069742443168, -0.17980499796473853, 0.07143683275356749, -0.12730466986846498, -0.17635355526227334, 0.3558357252915334, 0.10391445295275768, 0.23504615308339213, -0.0755988666911133, 0.2002111310305606, 0.0848739465311264, 0.08873221390850601, 0.03337168447675467, 0.2340214067559329, 0.1745908479227723, 0.15852446759050962, -0.32094291833439664, 0.15063712231746193, 0.006188336834912339] |
1,802.08649 | Planck intermediate results. LIV. The Planck Multi-frequency Catalogue
of Non-thermal Sources | This paper presents the Planck Multi-frequency Catalogue of Non-thermal (i.e.
synchrotron-dominated) Sources (PCNT) observed between 30 and 857 GHz by the
ESA Planck mission. This catalogue was constructed by selecting objects
detected in the full mission all-sky temperature maps at 30 and 143 GHz, with a
signal-to-noise ratio (S/N)>3 in at least one of the two channels after
filtering with a particular Mexican hat wavelet. As a result, 29400 source
candidates were selected. Then, a multi-frequency analysis was performed using
the Matrix Filters methodology at the position of these objects, and flux
densities and errors were calculated for all of them in the nine Planck
channels. The present catalogue is the first unbiased, full-sky catalogue of
synchrotron-dominated sources published at millimetre and submillimetre
wavelengths and constitutes a powerful database for statistical studies of
non-thermal extragalactic sources, whose emission is dominated by the central
active galactic nucleus. Together with the full multi-frequency catalogue, we
also define the Bright Planck Multi-frequency Catalogue of Non-thermal Sources
PCNTb, where only those objects with a S/N>4 at both 30 and 143 GHz were
selected. In this catalogue 1146 compact sources are detected outside the
adopted Planck GAL070 mask; thus, these sources constitute a highly reliable
sample of extragalactic radio sources. We also flag the high-significance
subsample PCNThs, a subset of 151 sources that are detected with S/N>4 in all
nine Planck channels, 75 of which are found outside the Planck mask adopted
here. The remaining 76 sources inside the Galactic mask are very likely
Galactic objects.
| astro-ph.CO | this paper presents the planck multifrequency catalogue of nonthermal ie synchrotrondominated sources pcnt observed between 30 and 857 ghz by the esa planck mission this catalogue was constructed by selecting objects detected in the full mission allsky temperature maps at 30 and 143 ghz with a signaltonoise ratio sn3 in at least one of the two channels after filtering with a particular mexican hat wavelet as a result 29400 source candidates were selected then a multifrequency analysis was performed using the matrix filters methodology at the position of these objects and flux densities and errors were calculated for all of them in the nine planck channels the present catalogue is the first unbiased fullsky catalogue of synchrotrondominated sources published at millimetre and submillimetre wavelengths and constitutes a powerful database for statistical studies of nonthermal extragalactic sources whose emission is dominated by the central active galactic nucleus together with the full multifrequency catalogue we also define the bright planck multifrequency catalogue of nonthermal sources pcntb where only those objects with a sn4 at both 30 and 143 ghz were selected in this catalogue 1146 compact sources are detected outside the adopted planck gal070 mask thus these sources constitute a highly reliable sample of extragalactic radio sources we also flag the highsignificance subsample pcnths a subset of 151 sources that are detected with sn4 in all nine planck channels 75 of which are found outside the planck mask adopted here the remaining 76 sources inside the galactic mask are very likely galactic objects | [['this', 'paper', 'presents', 'the', 'planck', 'multifrequency', 'catalogue', 'of', 'nonthermal', 'ie', 'synchrotrondominated', 'sources', 'pcnt', 'observed', 'between', '30', 'and', '857', 'ghz', 'by', 'the', 'esa', 'planck', 'mission', 'this', 'catalogue', 'was', 'constructed', 'by', 'selecting', 'objects', 'detected', 'in', 'the', 'full', 'mission', 'allsky', 'temperature', 'maps', 'at', '30', 'and', '143', 'ghz', 'with', 'a', 'signaltonoise', 'ratio', 'sn3', 'in', 'at', 'least', 'one', 'of', 'the', 'two', 'channels', 'after', 'filtering', 'with', 'a', 'particular', 'mexican', 'hat', 'wavelet', 'as', 'a', 'result', '29400', 'source', 'candidates', 'were', 'selected', 'then', 'a', 'multifrequency', 'analysis', 'was', 'performed', 'using', 'the', 'matrix', 'filters', 'methodology', 'at', 'the', 'position', 'of', 'these', 'objects', 'and', 'flux', 'densities', 'and', 'errors', 'were', 'calculated', 'for', 'all', 'of', 'them', 'in', 'the', 'nine', 'planck', 'channels', 'the', 'present', 'catalogue', 'is', 'the', 'first', 'unbiased', 'fullsky', 'catalogue', 'of', 'synchrotrondominated', 'sources', 'published', 'at', 'millimetre', 'and', 'submillimetre', 'wavelengths', 'and', 'constitutes', 'a', 'powerful', 'database', 'for', 'statistical', 'studies', 'of', 'nonthermal', 'extragalactic', 'sources', 'whose', 'emission', 'is', 'dominated', 'by', 'the', 'central', 'active', 'galactic', 'nucleus', 'together', 'with', 'the', 'full', 'multifrequency', 'catalogue', 'we', 'also', 'define', 'the', 'bright', 'planck', 'multifrequency', 'catalogue', 'of', 'nonthermal', 'sources', 'pcntb', 'where', 'only', 'those', 'objects', 'with', 'a', 'sn4', 'at', 'both', '30', 'and', '143', 'ghz', 'were', 'selected', 'in', 'this', 'catalogue', '1146', 'compact', 'sources', 'are', 'detected', 'outside', 'the', 'adopted', 'planck', 'gal070', 'mask', 'thus', 'these', 'sources', 'constitute', 'a', 'highly', 'reliable', 'sample', 'of', 'extragalactic', 'radio', 'sources', 'we', 'also', 'flag', 'the', 'highsignificance', 'subsample', 'pcnths', 'a', 'subset', 'of', '151', 'sources', 'that', 'are', 'detected', 'with', 'sn4', 'in', 'all', 'nine', 'planck', 'channels', '75', 'of', 'which', 'are', 'found', 'outside', 'the', 'planck', 'mask', 'adopted', 'here', 'the', 'remaining', '76', 'sources', 'inside', 'the', 'galactic', 'mask', 'are', 'very', 'likely', 'galactic', 'objects']] | [-0.05666970708823907, 0.11641772721356493, -0.03625861500537523, 0.06754363693507025, -0.07584980706688077, -0.07398969902490395, 0.08621872511571198, 0.4342805501679337, -0.14322563469205507, -0.3900880567479606, 0.10588857728365157, -0.37524386471879434, 0.014024344123369916, 0.22274565833669943, 0.019089230998301863, 0.0004134831417208098, 0.030655112442166763, -0.09982965038180715, 0.015232005125816487, -0.24490271717910012, 0.24805639582455188, 0.1587054595631373, 0.2120475278319261, -0.09349657507653882, 0.10949228414546365, -0.10376562473243027, -0.19012124000526057, -0.019992087244593757, -0.08209693178340365, 0.06803362195122593, 0.28760261482623506, 0.12251105559403001, 0.18910409898943897, -0.27850471770781166, -0.21027153619277344, 0.08140244983833253, 0.11141442929629267, 0.06339727661229776, -0.02335239608859174, -0.33676326799214007, 0.07642902354747663, -0.16128805434478946, -0.15014960626670257, 0.0525058068844255, 0.047598862878569376, 0.019991610032635006, -0.18589324047656472, 0.11980211849365104, -0.026987636848485354, 0.09013657826396478, -0.14098775457984547, -0.15601118841602246, -0.04729474783965909, 0.0876643189259358, -0.07282740349608768, 0.08629825031403755, 0.15059190924370253, -0.07927890714897766, -0.08311042816371551, 0.38886765580495625, -0.04813075868594574, -0.022339599530261798, 0.14277415570984708, -0.20251684994588234, -0.23363437011697882, 0.17243540293075205, 0.14437187240247015, 0.09155876200827884, -0.23147215627463216, 0.01066182763528692, -0.012184491888354949, 0.23687197682135397, 0.09676516538403541, 0.07792843931460587, 0.2989252485728603, 0.0599095696172624, 0.056396607676808666, 0.18970032088076166, -0.30258219542535025, 0.03587164218836593, -0.31259496805657505, -0.017513265979014397, -0.16544615458441536, 0.06379177564105806, -0.09931094409114487, -0.10089430121522268, 0.35565824103655247, 0.10916666913355466, 0.15914954575643747, 0.041244388053977364, 0.31065197923027615, 0.004767722462027568, 0.07889323203722243, 0.11466757412356271, 0.32727931111452846, 0.11641018149514902, 0.07918528958064754, -0.09529777624993585, -0.025211321377399856, -0.04618647155669949] |
1,802.0865 | A smeared quantum phase transition in disordered holography | We study the effects of quenched one-dimensional disorder on the holographic
Weyl semimetal quantum phase transition (QPT), with a particular focus on the
quantum critical region. We observe the smearing of the sharp QPT linked to the
appearance of rare regions at the horizon where locally the order parameter is
non-zero. We discuss the role of the disorder correlation and we compare our
results to expectations from condensed matter theory at weak coupling. We
analyze also the interplay of finite temperature and disorder. Within the
quantum critical region we find indications for the presence of log-oscillatory
structures in the order parameter hinting at the existence of an IR fixed point
with discrete scale invariance.
| hep-th | we study the effects of quenched onedimensional disorder on the holographic weyl semimetal quantum phase transition qpt with a particular focus on the quantum critical region we observe the smearing of the sharp qpt linked to the appearance of rare regions at the horizon where locally the order parameter is nonzero we discuss the role of the disorder correlation and we compare our results to expectations from condensed matter theory at weak coupling we analyze also the interplay of finite temperature and disorder within the quantum critical region we find indications for the presence of logoscillatory structures in the order parameter hinting at the existence of an ir fixed point with discrete scale invariance | [['we', 'study', 'the', 'effects', 'of', 'quenched', 'onedimensional', 'disorder', 'on', 'the', 'holographic', 'weyl', 'semimetal', 'quantum', 'phase', 'transition', 'qpt', 'with', 'a', 'particular', 'focus', 'on', 'the', 'quantum', 'critical', 'region', 'we', 'observe', 'the', 'smearing', 'of', 'the', 'sharp', 'qpt', 'linked', 'to', 'the', 'appearance', 'of', 'rare', 'regions', 'at', 'the', 'horizon', 'where', 'locally', 'the', 'order', 'parameter', 'is', 'nonzero', 'we', 'discuss', 'the', 'role', 'of', 'the', 'disorder', 'correlation', 'and', 'we', 'compare', 'our', 'results', 'to', 'expectations', 'from', 'condensed', 'matter', 'theory', 'at', 'weak', 'coupling', 'we', 'analyze', 'also', 'the', 'interplay', 'of', 'finite', 'temperature', 'and', 'disorder', 'within', 'the', 'quantum', 'critical', 'region', 'we', 'find', 'indications', 'for', 'the', 'presence', 'of', 'logoscillatory', 'structures', 'in', 'the', 'order', 'parameter', 'hinting', 'at', 'the', 'existence', 'of', 'an', 'ir', 'fixed', 'point', 'with', 'discrete', 'scale', 'invariance']] | [-0.16342906630802245, 0.20505301343604387, -0.06666515733955318, 0.06570257428367704, -0.01494824183541105, -0.11338003042660523, 0.09036411669231918, 0.335590745959627, -0.2342299245534824, -0.23489870314012495, 0.07337328777628085, -0.3250652205672834, -0.15000265099827134, 0.09778954552715285, 0.03743154256300298, 0.029514868037056243, -0.061228732235337556, 0.04397115152811207, -0.12701067183546624, -0.196446013783938, 0.39998634235132813, 0.04389179162293052, 0.3064560997544935, 0.11936925706992808, 0.03893326285801697, -0.013066654097648305, 0.026024305000247664, 0.034797688790907465, -0.19731198426074625, 0.012368532714613696, 0.21965187169578776, -0.04857474546805494, 0.22656110246061234, -0.3851178592855209, -0.21346750631601663, 0.11406914766248838, 0.11443825054652336, 0.1519657449649745, -0.08610955911909084, -0.33370415611486687, 0.06820569744562371, -0.11791089592959013, -0.1652357125973427, -0.06694745293638685, -0.029606013591482974, -0.050592405086366886, -0.2394787079834363, 0.11528941458514932, 0.03319415010168756, 0.08548549102341528, -0.038797145370361316, -0.029666272786511273, -0.011800742996121315, 0.12657738836857965, 0.05236338230621952, 0.014074965072754901, 0.12920356011671716, -0.17429366942776955, -0.09598531838038757, 0.3722954097350961, -0.06391773705897656, -0.09496075381818962, 0.20796528123237454, -0.2269627393974939, -0.15223478992763712, 0.11923171595359842, 0.14793615314186337, 0.08418068159861784, -0.046886937615151204, 0.1197561855303336, 0.004621655588332368, 0.16587977107561178, -0.008920952365243514, 0.09551235093130615, 0.2518943823187759, 0.14781641779496058, 0.06821084955886922, 0.18222239750984795, -0.14277767105816389, -0.1685928488150239, -0.37307563834219126, -0.13152448016039112, -0.18659927949039756, 0.025625594189031084, -0.1382445009430899, -0.18689342520379446, 0.3821919030477211, 0.20036496623141462, 0.2188534488607394, 0.004217489058838079, 0.1887649125909727, 0.14706433736494529, 0.026705809215312463, 0.05038353364930995, 0.2652227275886393, 0.12694021947518513, 0.0926842987067638, -0.3036188238316722, 0.024091045043365865, 0.06608391526612666] |
1,802.08651 | Kinetic schemes for assessing stability of traveling fronts for the
Allen-Cahn equation with relaxation | This paper deals with the numerical (finite volume) approximation of
reaction-diffusion systems with relaxation, among which the hyperbolic
extension of the Allen--Cahn equation represents a notable prototype.
Appropriate discretizations are constructed starting from the kinetic
interpretation of the model as a particular case of reactive jump process.
Numerical experiments are provided for exemplifying the theoretical analysis
(previously developed by the same authors) concerning the stability of
traveling waves, and important evidence of the validity of those results beyond
the formal hypotheses is numerically established.
| math.NA | this paper deals with the numerical finite volume approximation of reactiondiffusion systems with relaxation among which the hyperbolic extension of the allencahn equation represents a notable prototype appropriate discretizations are constructed starting from the kinetic interpretation of the model as a particular case of reactive jump process numerical experiments are provided for exemplifying the theoretical analysis previously developed by the same authors concerning the stability of traveling waves and important evidence of the validity of those results beyond the formal hypotheses is numerically established | [['this', 'paper', 'deals', 'with', 'the', 'numerical', 'finite', 'volume', 'approximation', 'of', 'reactiondiffusion', 'systems', 'with', 'relaxation', 'among', 'which', 'the', 'hyperbolic', 'extension', 'of', 'the', 'allencahn', 'equation', 'represents', 'a', 'notable', 'prototype', 'appropriate', 'discretizations', 'are', 'constructed', 'starting', 'from', 'the', 'kinetic', 'interpretation', 'of', 'the', 'model', 'as', 'a', 'particular', 'case', 'of', 'reactive', 'jump', 'process', 'numerical', 'experiments', 'are', 'provided', 'for', 'exemplifying', 'the', 'theoretical', 'analysis', 'previously', 'developed', 'by', 'the', 'same', 'authors', 'concerning', 'the', 'stability', 'of', 'traveling', 'waves', 'and', 'important', 'evidence', 'of', 'the', 'validity', 'of', 'those', 'results', 'beyond', 'the', 'formal', 'hypotheses', 'is', 'numerically', 'established']] | [-0.13010252967415864, 0.04024343154326614, -0.07390213427355602, 0.0567338858500729, -0.061306031864313854, -0.10938265278846734, 0.016044789605075493, 0.27762600374851554, -0.23530320219392056, -0.27190944610074874, 0.13229876436248778, -0.2861141043582133, -0.1520777940860994, 0.22763949133444666, 0.002035505961560245, 0.12338656235841058, 0.05809080829411479, 0.009016329932603099, -0.06181667699101603, -0.19357369529704252, 0.3236990900643702, 0.055143853255902375, 0.26444103520008777, 0.04065670132903116, 0.1032295642320865, -0.037180775831941335, -0.06969696549432618, 0.04399585202779798, -0.17122408584137225, 0.11847473989196476, 0.24171700716639558, 0.06164805997451324, 0.2873257572091894, -0.4172984520084269, -0.2756800073132451, 0.03190645982422644, 0.1320799606065044, 0.11589167447701107, -0.08299170493236965, -0.2864254448158179, 0.07058326290765156, -0.15693958899715826, -0.21343166580689804, -0.05352012868527146, -0.011916169747044998, 0.09329844538920692, -0.24915639778953932, 0.09712628039276405, 0.10878689372856613, 0.0854782788997649, -0.1160624699911014, -0.1234818147495389, -0.008046837502791147, 0.07067733929891672, 0.0861853860568815, -0.05262910091273841, 0.047880036579001514, -0.06969888484759611, -0.1325113429865312, 0.3876107699969517, -0.06468908969933788, -0.2224642106198839, 0.23122794953884468, -0.11698513800677444, -0.12570755405994577, 0.1229602918666344, 0.125100573990494, 0.12663575361615845, -0.15584828136932283, 0.12019301883230496, -0.065703233327007, 0.11648857930586451, 0.06636412455866646, -0.044673457575429766, 0.12321003768149585, 0.23485305562471262, 0.021430106345741523, 0.1476708061714557, 0.004817853132928056, -0.18769264563785068, -0.38405892887108384, -0.15009691240265965, -0.15366344131152368, 0.017502694422589792, -0.08693916819850399, -0.16518338047899306, 0.3832758304308213, 0.13901575138082817, 0.11545172276064045, 0.06927743402844672, 0.2818016757789467, 0.15210858845204625, -0.020602481173617498, 0.0207557853677177, 0.2240078387493711, 0.1752971855042103, 0.11054680352598163, -0.22306754930468742, 0.08080099898368298, 0.1124789530877024] |
1,802.08652 | The dynamic of contrast agent and surrounding fluid in the vicinity of a
wall for sonoporation | Contrast microbubbles (contrast agents) were initially developed to increase
the contrast of the image in ultrasound imaging. These microbubbles consist of
a gas core encapsulated by a layer of protein or lipid to stabilize them
against early dissolution in the bloodstream. Contrast agents, in the presence
of ultrasound, can also help facilitate the uptake of drugs and genes in to
desired cells through the process called sonoporation. Sonoporation is the
temporarily rupture of cell membranes in the presence of ultrasound. In this
work, we have studied the contrast agent near a rigid wall (assumed as a cell
membrane with high elastic modulus) in the presence of ultrasound using
boundary element method. The contrast agent forms non-symmetrical high velocity
microjet at the last stage of the collapse phase. The microjet and the adjacent
surrounding fluid move toward the rigid wall with a very high velocity. This
high velocity fluid impinges the wall and spreads radially along it. This will
generate high velocity gradient on the wall which gives rise to shear stress
resulting in the perforation of cell membrane. The encapsulation of the
microbubble can be assumed as an interface with an infinitesimal thickness.
There are several models to simulate the interface. In this study, the
encapsulation is simulated with two models; viscoelastic model with
exponentially varying elasticity (EEM) and Marmottant model. In this research,
we have studied the effect of different parameters on the dynamics of the
contrast microbubble, the induced shear stress on the wall due to its collapse,
and the velocity and pressure fields surrounding the contrast microbubble, to
better understand sonoporation.
| physics.med-ph physics.flu-dyn | contrast microbubbles contrast agents were initially developed to increase the contrast of the image in ultrasound imaging these microbubbles consist of a gas core encapsulated by a layer of protein or lipid to stabilize them against early dissolution in the bloodstream contrast agents in the presence of ultrasound can also help facilitate the uptake of drugs and genes in to desired cells through the process called sonoporation sonoporation is the temporarily rupture of cell membranes in the presence of ultrasound in this work we have studied the contrast agent near a rigid wall assumed as a cell membrane with high elastic modulus in the presence of ultrasound using boundary element method the contrast agent forms nonsymmetrical high velocity microjet at the last stage of the collapse phase the microjet and the adjacent surrounding fluid move toward the rigid wall with a very high velocity this high velocity fluid impinges the wall and spreads radially along it this will generate high velocity gradient on the wall which gives rise to shear stress resulting in the perforation of cell membrane the encapsulation of the microbubble can be assumed as an interface with an infinitesimal thickness there are several models to simulate the interface in this study the encapsulation is simulated with two models viscoelastic model with exponentially varying elasticity eem and marmottant model in this research we have studied the effect of different parameters on the dynamics of the contrast microbubble the induced shear stress on the wall due to its collapse and the velocity and pressure fields surrounding the contrast microbubble to better understand sonoporation | [['contrast', 'microbubbles', 'contrast', 'agents', 'were', 'initially', 'developed', 'to', 'increase', 'the', 'contrast', 'of', 'the', 'image', 'in', 'ultrasound', 'imaging', 'these', 'microbubbles', 'consist', 'of', 'a', 'gas', 'core', 'encapsulated', 'by', 'a', 'layer', 'of', 'protein', 'or', 'lipid', 'to', 'stabilize', 'them', 'against', 'early', 'dissolution', 'in', 'the', 'bloodstream', 'contrast', 'agents', 'in', 'the', 'presence', 'of', 'ultrasound', 'can', 'also', 'help', 'facilitate', 'the', 'uptake', 'of', 'drugs', 'and', 'genes', 'in', 'to', 'desired', 'cells', 'through', 'the', 'process', 'called', 'sonoporation', 'sonoporation', 'is', 'the', 'temporarily', 'rupture', 'of', 'cell', 'membranes', 'in', 'the', 'presence', 'of', 'ultrasound', 'in', 'this', 'work', 'we', 'have', 'studied', 'the', 'contrast', 'agent', 'near', 'a', 'rigid', 'wall', 'assumed', 'as', 'a', 'cell', 'membrane', 'with', 'high', 'elastic', 'modulus', 'in', 'the', 'presence', 'of', 'ultrasound', 'using', 'boundary', 'element', 'method', 'the', 'contrast', 'agent', 'forms', 'nonsymmetrical', 'high', 'velocity', 'microjet', 'at', 'the', 'last', 'stage', 'of', 'the', 'collapse', 'phase', 'the', 'microjet', 'and', 'the', 'adjacent', 'surrounding', 'fluid', 'move', 'toward', 'the', 'rigid', 'wall', 'with', 'a', 'very', 'high', 'velocity', 'this', 'high', 'velocity', 'fluid', 'impinges', 'the', 'wall', 'and', 'spreads', 'radially', 'along', 'it', 'this', 'will', 'generate', 'high', 'velocity', 'gradient', 'on', 'the', 'wall', 'which', 'gives', 'rise', 'to', 'shear', 'stress', 'resulting', 'in', 'the', 'perforation', 'of', 'cell', 'membrane', 'the', 'encapsulation', 'of', 'the', 'microbubble', 'can', 'be', 'assumed', 'as', 'an', 'interface', 'with', 'an', 'infinitesimal', 'thickness', 'there', 'are', 'several', 'models', 'to', 'simulate', 'the', 'interface', 'in', 'this', 'study', 'the', 'encapsulation', 'is', 'simulated', 'with', 'two', 'models', 'viscoelastic', 'model', 'with', 'exponentially', 'varying', 'elasticity', 'eem', 'and', 'marmottant', 'model', 'in', 'this', 'research', 'we', 'have', 'studied', 'the', 'effect', 'of', 'different', 'parameters', 'on', 'the', 'dynamics', 'of', 'the', 'contrast', 'microbubble', 'the', 'induced', 'shear', 'stress', 'on', 'the', 'wall', 'due', 'to', 'its', 'collapse', 'and', 'the', 'velocity', 'and', 'pressure', 'fields', 'surrounding', 'the', 'contrast', 'microbubble', 'to', 'better', 'understand', 'sonoporation']] | [-0.09747602981307187, 0.15653786172184248, -0.05531178459561848, -0.05024789980925285, -0.04005337462799461, -0.09702339875706588, 0.005872063515814085, 0.39503790746963524, -0.2806242886105616, -0.2666876378076101, 0.09330960264263016, -0.24846165920979565, -0.1305459264927887, 0.11844757707885151, -0.06859030897158974, 0.019461693528804135, 0.03183652080698186, 0.02420116527034359, 0.026520180766315363, -0.1776981717170333, 0.24880826229604933, 0.058609527066976766, 0.3115286237476996, 0.04561793115414934, 0.09232072902758369, -0.0419015234149572, 0.016415367287604895, 0.05228506360812105, -0.15535465333107928, 0.10292376151234053, 0.21906935907369715, 0.0014089179568757576, 0.26806698484388763, -0.5119469268778658, -0.2550263468161962, 0.06552825912394111, 0.15611058423479757, 0.1288337119509282, -0.04537336234916922, -0.2538791537398168, 0.06895296269728529, -0.15026678019475473, -0.15050576454446343, 0.004671408309682694, -0.00898098000573143, 0.04562618962188956, -0.2195974202656644, 0.13034437725596226, 0.023312450101078547, 0.06197218373488678, -0.13036449077254084, -0.04345335729221881, -0.06729546251543886, 0.1191830155005884, 0.07680342619884103, 0.06985062485500575, 0.2412099447844996, -0.1754221989285863, -0.02060622085853455, 0.37961325732222667, -0.052507423517779366, -0.213443986079992, 0.2509809774089916, -0.1529201604939374, -0.02929144052384924, 0.17464381094115428, 0.20076599558850772, 0.10060422724994172, -0.1211760126128651, 0.003262499045003418, 0.007298878668506449, 0.16422187699449423, 0.14887267339287658, -0.05683045953285558, 0.2176283030653861, 0.20179250374694882, 0.02505339063994388, 0.17629832180859628, -0.13549085097671168, -0.06912609697173495, -0.2306678921618134, -0.1828276640881639, -0.13591453917023547, -0.0128815726601933, -0.09350963931023001, -0.20433819435975964, 0.35119272544165586, 0.1146678692960453, 0.1946263978273932, -0.0002612740588427553, 0.29211517341236654, 0.04861058943069225, 0.09643608617451141, 0.022811724174902296, 0.2715075508513317, 0.14489468405936834, 0.14730627024139034, -0.26491082939514077, 0.11756624337179522, 0.0028549814388729605] |
1,802.08653 | Becker's conjecture on Mahler functions | In 1994, Becker conjectured that if $F(z)$ is a $k$-regular power series,
then there exists a $k$-regular rational function $R(z)$ such that $F(z)/R(z)$
satisfies a Mahler-type functional equation with polynomial coefficients where
the initial coefficient satisfies $a_0(z)=1$. In this paper, we prove Becker's
conjecture in the best-possible form; we show that the rational function $R(z)$
can be taken to be a polynomial $z^\gamma Q(z)$ for some explicit non-negative
integer $\gamma$ and such that $1/Q(z)$ is $k$-regular.
| math.NT cs.FL | in 1994 becker conjectured that if fz is a kregular power series then there exists a kregular rational function rz such that fzrz satisfies a mahlertype functional equation with polynomial coefficients where the initial coefficient satisfies a_0z1 in this paper we prove beckers conjecture in the bestpossible form we show that the rational function rz can be taken to be a polynomial zgamma qz for some explicit nonnegative integer gamma and such that 1qz is kregular | [['in', '1994', 'becker', 'conjectured', 'that', 'if', 'fz', 'is', 'a', 'kregular', 'power', 'series', 'then', 'there', 'exists', 'a', 'kregular', 'rational', 'function', 'rz', 'such', 'that', 'fzrz', 'satisfies', 'a', 'mahlertype', 'functional', 'equation', 'with', 'polynomial', 'coefficients', 'where', 'the', 'initial', 'coefficient', 'satisfies', 'a_0z1', 'in', 'this', 'paper', 'we', 'prove', 'beckers', 'conjecture', 'in', 'the', 'bestpossible', 'form', 'we', 'show', 'that', 'the', 'rational', 'function', 'rz', 'can', 'be', 'taken', 'to', 'be', 'a', 'polynomial', 'zgamma', 'qz', 'for', 'some', 'explicit', 'nonnegative', 'integer', 'gamma', 'and', 'such', 'that', '1qz', 'is', 'kregular']] | [-0.1740155698886762, 0.04783757892437279, -0.13969519469214398, 0.0570682165578344, -0.13017751754442644, -0.21463820845302609, -0.02916393288857459, 0.34636166744813734, -0.3395958843951424, -0.15951534759046304, 0.039101827063455455, -0.27071274036037113, -0.25906818406656384, 0.19810048069080544, -0.06044642799275203, 0.06252585279677685, 0.05287294546077545, 0.0661904764904951, -0.024260850047640916, -0.3323825375409797, 0.2864992614874306, -0.08946162858046591, 0.10694839431542075, 0.0919641775997459, 0.1406905776433026, -0.011778329295743283, 0.04844318477747341, 0.002872880871614648, -0.2439550070448604, -0.005869707529200241, 0.2975087773326474, 0.14561510317273335, 0.2605764221969164, -0.345260773319751, -0.1225744701934875, 0.251866409710298, 0.14976166469407165, -0.03211995685059163, -0.05584219272714108, -0.15524640669011408, 0.16735333710029307, -0.1450901684842797, -0.14731301904086852, -0.043928150061724916, 0.1429554179517759, 0.04523757558328927, -0.41728590426242185, 0.07051839138795105, 0.07740686504015078, 0.06520895916037261, -0.03729019687873208, -0.1496476314496249, -0.0367395789297815, 0.02684033195125974, -0.03406536314610599, 0.1426110050524585, 0.0041682309561616015, -0.0819623236279262, -0.07859088356942973, 0.32110858482256943, -0.09535691930028002, -0.24270233255811036, 0.041292666722761676, -0.17708083392224377, -0.2456639062664989, 0.06921386506615414, 0.0847881935769692, 0.09954359462588197, -0.03397950972430408, 0.2081507252158998, -0.16877740528434515, 0.18409156356938183, 0.14677348766579396, -0.06060125112223128, 0.10800425966347878, -0.012110303026727505, 0.08302033806103282, 0.13676604675129056, 0.04400045543702112, -0.0021147240832861927, -0.3610771458544251, -0.1787147703451208, -0.2312858256045729, 0.15398171331293675, -0.14489509768686226, -0.1802944990195101, 0.3333972688447425, 0.03928393090286085, 0.19729548258086047, 0.14984464345616288, 0.19755965113452273, 0.2453065984365013, -0.014905565858094228, 0.13332535362698966, 0.14607697036707476, 0.11508902381562318, 0.016190806972897716, -0.14212233500115368, 0.0906100034351564, 0.18397199092174155] |
1,802.08654 | Black Hole Mergers from Globular Clusters Observable by LISA and LIGO:
Results from post-Newtonian Binary-Single Scatterings | We study the gravitational wave (GW) frequency and chirp mass distribution of
binary black hole (BBH) mergers assembled through three-body interactions in
globular clusters (GCs), when GW emission at the 2.5 post-Newtonian (PN) level
is included in the $N$-body equation-of-motion (EOM). From performing $\sim
2.5\times10^{6}$ PN binary-single interactions based on GC data from the
`MOCCA-Survey Database I' project, and by the use of analytical methods, we
find that $5-10\%$ of all the three-body assembled GC BBH mergers have a GW
frequency at formation that is $\gtrsim 10^{-1}$ Hz, implying they enter the
LIGO band without having drifted through the LISA band first. If PN terms are
not included in the EOM, one finds instead that all BBH mergers drifts through
both LISA and LIGO. As the fraction of BBH mergers that only show up in LIGO is
expected to be $\sim 0\%$ for standard field binary BBH mergers, future joint
measurements with LISA and LIGO can be used to gain insight into the formation
of BBH mergers.
| astro-ph.HE | we study the gravitational wave gw frequency and chirp mass distribution of binary black hole bbh mergers assembled through threebody interactions in globular clusters gcs when gw emission at the 25 postnewtonian pn level is included in the nbody equationofmotion eom from performing sim 25times106 pn binarysingle interactions based on gc data from the moccasurvey database i project and by the use of analytical methods we find that 510 of all the threebody assembled gc bbh mergers have a gw frequency at formation that is gtrsim 101 hz implying they enter the ligo band without having drifted through the lisa band first if pn terms are not included in the eom one finds instead that all bbh mergers drifts through both lisa and ligo as the fraction of bbh mergers that only show up in ligo is expected to be sim 0 for standard field binary bbh mergers future joint measurements with lisa and ligo can be used to gain insight into the formation of bbh mergers | [['we', 'study', 'the', 'gravitational', 'wave', 'gw', 'frequency', 'and', 'chirp', 'mass', 'distribution', 'of', 'binary', 'black', 'hole', 'bbh', 'mergers', 'assembled', 'through', 'threebody', 'interactions', 'in', 'globular', 'clusters', 'gcs', 'when', 'gw', 'emission', 'at', 'the', '25', 'postnewtonian', 'pn', 'level', 'is', 'included', 'in', 'the', 'nbody', 'equationofmotion', 'eom', 'from', 'performing', 'sim', '25times106', 'pn', 'binarysingle', 'interactions', 'based', 'on', 'gc', 'data', 'from', 'the', 'moccasurvey', 'database', 'i', 'project', 'and', 'by', 'the', 'use', 'of', 'analytical', 'methods', 'we', 'find', 'that', '510', 'of', 'all', 'the', 'threebody', 'assembled', 'gc', 'bbh', 'mergers', 'have', 'a', 'gw', 'frequency', 'at', 'formation', 'that', 'is', 'gtrsim', '101', 'hz', 'implying', 'they', 'enter', 'the', 'ligo', 'band', 'without', 'having', 'drifted', 'through', 'the', 'lisa', 'band', 'first', 'if', 'pn', 'terms', 'are', 'not', 'included', 'in', 'the', 'eom', 'one', 'finds', 'instead', 'that', 'all', 'bbh', 'mergers', 'drifts', 'through', 'both', 'lisa', 'and', 'ligo', 'as', 'the', 'fraction', 'of', 'bbh', 'mergers', 'that', 'only', 'show', 'up', 'in', 'ligo', 'is', 'expected', 'to', 'be', 'sim', '0', 'for', 'standard', 'field', 'binary', 'bbh', 'mergers', 'future', 'joint', 'measurements', 'with', 'lisa', 'and', 'ligo', 'can', 'be', 'used', 'to', 'gain', 'insight', 'into', 'the', 'formation', 'of', 'bbh', 'mergers']] | [-0.1519996307310592, 0.1174028612426426, -0.03375543589656051, 0.10962239826162604, -0.10304684247344688, -0.009312999005575317, 0.016365998354459923, 0.3621693400621235, -0.15051317336711, -0.3078200767372163, 0.022547453375398575, -0.32438535980195793, -0.08198522040879926, 0.27236991540068783, 0.08097091163171971, 0.0019698881709678882, 0.16147692308547984, -0.07679266957229519, -0.08411256888536288, -0.2868973334861291, 0.2975169122611812, 0.0853131847254124, 0.05191628163096955, -0.09727955833694572, 0.0794699608877088, 0.03256690860950354, 0.0019915250301114225, -0.08006475089925778, -0.15958001034359548, -0.033979289400242606, 0.31830631239698776, 0.16907242995810257, 0.23735047879079021, -0.40230473298130626, -0.1746740245122844, 0.040351462494357525, 0.19066177154274053, 0.13334142459775264, -0.09290874198132408, -0.3273251653124343, 0.12206322564680343, -0.3300717184235937, -0.11080012424759207, 0.0486868761188115, 0.049783411937736326, 0.07744012647224253, -0.2041619262259723, 0.13319499605526047, 0.025240819460112064, -0.11960327395810241, -0.0838134099577879, -0.08174689129522317, -0.07269168954836316, 0.05990466809251587, 0.03406934313481696, 0.11190824771067828, 0.2098387243529131, -0.045799182277700176, -0.11989800483360046, 0.4075925437935505, -0.06278007759373208, -0.09581781625018332, 0.17402211713733667, -0.2669395765328937, -0.17453474284104822, 0.15165120918662792, 0.20103390625375042, 0.0782903009513323, -0.17021113620407904, 0.062140161477321064, 0.13613801405644843, 0.2745154062054591, 0.16460192728407558, 0.03638429192444646, 0.3818491020812148, 0.14013815302884272, 0.026427520019653063, 0.030887919900299286, -0.18898095603869577, 0.0031314349862331726, -0.23052692046411424, -0.05396167838003441, -0.19463622992639487, 0.1138581273399142, -0.1601098827952491, -0.09655180399822273, 0.314579533553312, 0.1177851610399042, 0.12737510598079493, 0.04542385543842452, 0.2787817350914141, 0.11124269469747747, 0.08745081643630044, 0.07002307028588221, 0.38596981819101933, 0.08827675084431981, -0.00305876656539222, -0.2308116701595676, 0.031657998938203216, -0.029010398599532354] |
1,802.08655 | Comparative Analysis of Unsupervised Algorithms for Breast MRI Lesion
Segmentation | Accurate segmentation of breast lesions is a crucial step in evaluating the
characteristics of tumors. However, this is a challenging task, since breast
lesions have sophisticated shape, topological structure, and variation in the
intensity distribution. In this paper, we evaluated the performance of three
unsupervised algorithms for the task of breast Magnetic Resonance (MRI) lesion
segmentation, namely, Gaussian Mixture Model clustering, K-means clustering and
a marker-controlled Watershed transformation based method. All methods were
applied on breast MRI slices following selection of regions of interest (ROIs)
by an expert radiologist and evaluated on 106 subjects' images, which include
59 malignant and 47 benign lesions. Segmentation accuracy was evaluated by
comparing our results with ground truth masks, using the Dice similarity
coefficient (DSC), Jaccard index (JI), Hausdorff distance and precision-recall
metrics. The results indicate that the marker-controlled Watershed
transformation outperformed all other algorithms investigated.
| cs.CV | accurate segmentation of breast lesions is a crucial step in evaluating the characteristics of tumors however this is a challenging task since breast lesions have sophisticated shape topological structure and variation in the intensity distribution in this paper we evaluated the performance of three unsupervised algorithms for the task of breast magnetic resonance mri lesion segmentation namely gaussian mixture model clustering kmeans clustering and a markercontrolled watershed transformation based method all methods were applied on breast mri slices following selection of regions of interest rois by an expert radiologist and evaluated on 106 subjects images which include 59 malignant and 47 benign lesions segmentation accuracy was evaluated by comparing our results with ground truth masks using the dice similarity coefficient dsc jaccard index ji hausdorff distance and precisionrecall metrics the results indicate that the markercontrolled watershed transformation outperformed all other algorithms investigated | [['accurate', 'segmentation', 'of', 'breast', 'lesions', 'is', 'a', 'crucial', 'step', 'in', 'evaluating', 'the', 'characteristics', 'of', 'tumors', 'however', 'this', 'is', 'a', 'challenging', 'task', 'since', 'breast', 'lesions', 'have', 'sophisticated', 'shape', 'topological', 'structure', 'and', 'variation', 'in', 'the', 'intensity', 'distribution', 'in', 'this', 'paper', 'we', 'evaluated', 'the', 'performance', 'of', 'three', 'unsupervised', 'algorithms', 'for', 'the', 'task', 'of', 'breast', 'magnetic', 'resonance', 'mri', 'lesion', 'segmentation', 'namely', 'gaussian', 'mixture', 'model', 'clustering', 'kmeans', 'clustering', 'and', 'a', 'markercontrolled', 'watershed', 'transformation', 'based', 'method', 'all', 'methods', 'were', 'applied', 'on', 'breast', 'mri', 'slices', 'following', 'selection', 'of', 'regions', 'of', 'interest', 'rois', 'by', 'an', 'expert', 'radiologist', 'and', 'evaluated', 'on', '106', 'subjects', 'images', 'which', 'include', '59', 'malignant', 'and', '47', 'benign', 'lesions', 'segmentation', 'accuracy', 'was', 'evaluated', 'by', 'comparing', 'our', 'results', 'with', 'ground', 'truth', 'masks', 'using', 'the', 'dice', 'similarity', 'coefficient', 'dsc', 'jaccard', 'index', 'ji', 'hausdorff', 'distance', 'and', 'precisionrecall', 'metrics', 'the', 'results', 'indicate', 'that', 'the', 'markercontrolled', 'watershed', 'transformation', 'outperformed', 'all', 'other', 'algorithms', 'investigated']] | [0.01617207678533356, -0.02993102046457352, -0.06402580419712713, 0.10387614208050597, -0.04023573598430925, -0.1502217916529101, 0.01263168962708425, 0.4333289405462188, -0.13548566828995065, -0.32851432973492734, 0.07507271272159824, -0.31700080290148164, -0.18927836890863647, 0.1901769667165354, -0.1455843143073291, 0.11189947850529997, 0.13749841925471654, 0.04335665778940688, -0.018222078699028303, -0.32596540086227144, 0.2748832792030569, 0.013863288554769586, 0.4128169773776137, 0.01789326907437242, 0.11085481875294059, -0.04131108497164514, -0.081601095671149, 0.04476697382994298, -0.09144398191490606, 0.12931072150855522, 0.3374600109208087, 0.19964890262689178, 0.3044400084353852, -0.31911666017570073, -0.22465176727216113, 0.08873865367602032, 0.16700988067445202, 0.015665943153091038, -0.027756287278541902, -0.3977231150820956, 0.11033586913746007, -0.08356481886400782, 0.04845279418456722, -0.10476585462505758, 0.004379811858213966, -0.04584270930589951, -0.27682069893254124, 0.18889509630732815, 0.010648810662145555, 0.141434684905722, -0.144668422790218, -0.1654057488112684, 0.039099161708268375, 0.17878786094066962, 0.018897659010024295, 0.09859786294630243, 0.23522172545240275, -0.1984251415087271, -0.14888297916065352, 0.32047347563423845, 0.023517387591197456, -0.207092908864044, 0.15133715981886472, -0.06749518629504551, -0.12410622337032896, 0.15741406650033216, 0.16538152133252368, 0.15167266009441038, -0.16623592270992393, -0.044180134439621196, 0.015037183485872728, 0.1977844231657054, 0.1354102176141886, -0.11788175011366855, 0.12107809404531021, 0.2414459677308168, -0.031980872794930025, 0.1413648132875096, -0.24920299785001807, 0.02380213171283019, -0.1535309495365011, -0.15435958288117677, -0.2088869348886541, -0.08204111927287312, -0.17330800145026215, -0.21180123243477642, 0.4326045385063429, 0.1611135363263983, 0.18743387831073308, 0.04667172815509692, 0.32328542777087904, -0.031013198835532586, 0.08715689445281742, -0.00414529691850373, 0.18882406304318222, 0.04648056347742939, 0.05758179605833556, -0.21580173009367082, 0.11071273248846, 0.11586976745067505] |
1,802.08656 | Homomorphism Extension | We define the Homomorphism Extension (HomExt) problem: given a group $G$, a
subgroup $M \leq G$ and a homomorphism $\varphi: M \to H$, decide whether or
not there exists a homomorphism $\widetilde{\varphi}: G\to H$ extending
$\varphi$, i.e., $\widetilde{\varphi}|_M = \varphi$. This problem arose in the
context of list-decoding homomorphism codes but is also of independent
interest, both as a problem in computational group theory and as a new and
natural problem in NP of unsettled complexity status.
We consider the case $H=S_m$ (the symmetric group of degree $m$), i.e.,
$\varphi : G \to H$ is a $G$-action on a set of $m$ elements. We assume $G\le
S_n$ is given as a permutation group by a list of generators. We characterize
the equivalence classes of extensions in terms of a multidimensional oracle
subset-sum problem. From this we infer that for bounded $G$ the HomExt problem
can be solved in polynomial time.
Our main result concerns the case $G=A_n$ (the alternating group of degree
$n$) for variable $n$ under the assumption that the index of $M$ in $G$ is
bounded by poly$(n)$. We solve this case in polynomial time for all $m <
2^{n-1}/\sqrt{n}$. This is the case with direct relevance to homomorphism codes
(Babai, Black, and Wuu, arXiv 2018); it is used as a component of one of the
main algorithms in that paper.
| cs.DS | we define the homomorphism extension homext problem given a group g a subgroup m leq g and a homomorphism varphi m to h decide whether or not there exists a homomorphism widetildevarphi gto h extending varphi ie widetildevarphi_m varphi this problem arose in the context of listdecoding homomorphism codes but is also of independent interest both as a problem in computational group theory and as a new and natural problem in np of unsettled complexity status we consider the case hs_m the symmetric group of degree m ie varphi g to h is a gaction on a set of m elements we assume gle s_n is given as a permutation group by a list of generators we characterize the equivalence classes of extensions in terms of a multidimensional oracle subsetsum problem from this we infer that for bounded g the homext problem can be solved in polynomial time our main result concerns the case ga_n the alternating group of degree n for variable n under the assumption that the index of m in g is bounded by polyn we solve this case in polynomial time for all m 2n1sqrtn this is the case with direct relevance to homomorphism codes babai black and wuu arxiv 2018 it is used as a component of one of the main algorithms in that paper | [['we', 'define', 'the', 'homomorphism', 'extension', 'homext', 'problem', 'given', 'a', 'group', 'g', 'a', 'subgroup', 'm', 'leq', 'g', 'and', 'a', 'homomorphism', 'varphi', 'm', 'to', 'h', 'decide', 'whether', 'or', 'not', 'there', 'exists', 'a', 'homomorphism', 'widetildevarphi', 'gto', 'h', 'extending', 'varphi', 'ie', 'widetildevarphi_m', 'varphi', 'this', 'problem', 'arose', 'in', 'the', 'context', 'of', 'listdecoding', 'homomorphism', 'codes', 'but', 'is', 'also', 'of', 'independent', 'interest', 'both', 'as', 'a', 'problem', 'in', 'computational', 'group', 'theory', 'and', 'as', 'a', 'new', 'and', 'natural', 'problem', 'in', 'np', 'of', 'unsettled', 'complexity', 'status', 'we', 'consider', 'the', 'case', 'hs_m', 'the', 'symmetric', 'group', 'of', 'degree', 'm', 'ie', 'varphi', 'g', 'to', 'h', 'is', 'a', 'gaction', 'on', 'a', 'set', 'of', 'm', 'elements', 'we', 'assume', 'gle', 's_n', 'is', 'given', 'as', 'a', 'permutation', 'group', 'by', 'a', 'list', 'of', 'generators', 'we', 'characterize', 'the', 'equivalence', 'classes', 'of', 'extensions', 'in', 'terms', 'of', 'a', 'multidimensional', 'oracle', 'subsetsum', 'problem', 'from', 'this', 'we', 'infer', 'that', 'for', 'bounded', 'g', 'the', 'homext', 'problem', 'can', 'be', 'solved', 'in', 'polynomial', 'time', 'our', 'main', 'result', 'concerns', 'the', 'case', 'ga_n', 'the', 'alternating', 'group', 'of', 'degree', 'n', 'for', 'variable', 'n', 'under', 'the', 'assumption', 'that', 'the', 'index', 'of', 'm', 'in', 'g', 'is', 'bounded', 'by', 'polyn', 'we', 'solve', 'this', 'case', 'in', 'polynomial', 'time', 'for', 'all', 'm', '2n1sqrtn', 'this', 'is', 'the', 'case', 'with', 'direct', 'relevance', 'to', 'homomorphism', 'codes', 'babai', 'black', 'and', 'wuu', 'arxiv', '2018', 'it', 'is', 'used', 'as', 'a', 'component', 'of', 'one', 'of', 'the', 'main', 'algorithms', 'in', 'that', 'paper']] | [-0.1835835905739158, 0.07575642765840274, -0.04709828109911608, 0.03625898043025733, -0.09208505080055653, -0.14558500393845694, 0.04868424166192266, 0.35068699701393297, -0.3453005445728734, -0.30352544465481684, 0.10188258978693436, -0.2456369059789857, -0.12452072990547297, 0.16157464710812308, -0.12632372692287727, 0.003384715614460961, 0.06095078429509023, 0.10586656094218833, -0.07249826697968981, -0.2593492894418348, 0.3286480037215235, -0.022733948831618937, 0.1571084177380221, 0.027589898934551188, 0.0916606084641966, 0.006792990696676834, -0.014303307199885172, 0.020262981290687567, -0.15592560430940028, 0.05057669499742419, 0.2862803396872348, 0.1537493916103577, 0.277911119153874, -0.32728608597729664, -0.15736334433636834, 0.2298373144952132, 0.10797208853397967, 0.0069281798129884045, -0.04479683283770336, -0.22443228578453678, 0.12956186992663857, -0.1644853965878644, -0.09341694321894331, 0.04500806021840415, 0.12156970664714377, -0.04661510638133795, -0.29310379970034034, 0.0043807386293203176, 0.12168155007357537, 0.05392979780487992, 0.010883129629763533, -0.11478357443680849, 0.01497882974109854, 0.10362141242108515, 0.0008621231186057061, 0.11523370931994308, 0.05506766608407445, -0.08709650458142816, -0.11505399854784762, 0.42595716725379507, -0.09328343219520455, -0.21398815682752886, 0.11564469045454946, -0.13503567897067922, -0.20468911951347427, 0.07374026174053412, 0.12400067787341497, 0.1830374108135907, -0.05560821778986051, 0.21921968022339838, -0.17064799611129006, 0.14589628355989354, 0.06838445959793818, -0.02789299711541928, 0.10225409130335147, 0.10641888323071827, 0.12882424271406812, 0.16977718624629132, 0.042642779998627874, 0.038219668790353115, -0.341717190475686, -0.16989017033376042, -0.1924075643856432, 0.09662924788433346, -0.07248922530682951, -0.1324123426545864, 0.3704850096083074, 0.09609222635346534, 0.16443446867884226, 0.09953239483163795, 0.20437447530167885, 0.08481297917407776, 0.017116929025279306, 0.1179940644630093, 0.09582504421942523, 0.20091904346891507, -0.016086173808650562, -0.19294856123613296, 0.041186723463599466, 0.15294550286853337] |
1,802.08657 | The Leo-I group: new dwarf galaxy and UDG candidates | The study of dwarf galaxies and their environments provides crucial testbeds
for predictions of cosmological models and insights on the structure formation
on small cosmological scales. In recent years, many problems on the scale of
groups of galaxies challenged the current standard model of cosmology. We aim
to increase the sample of known galaxies in the Leo-I group, containing the
M\,96 subgroup and the Leo Triplet. This galaxy aggregate is located at the
edge of the Local Volume at a mean distance of 10.7 Mpc. We employ image
enhancing techniques to search for low-surface brightness objects in publicly
available gr images taken by the Sloan Digital Sky Survey within 500 square
degrees around the Leo-I group. Once detected, we perform surface photometry
and compare their structural parameters to other known dwarf galaxies in the
nearby universe. We found 36 new dwarf galaxy candidates within the search
area. Their morphology and structural parameters resemble known dwarfs in other
groups. Among the candidates 5 to 6 galaxies are considered as ultra diffuse
galaxies candidates. If confirmed, they would be some of the closest examples
of this galaxy type. We assessed the luminosity function of the Leo-I group and
find it to be considerably rich in dwarf galaxies, with twice the number of
galaxies as the Local Group at a limiting magnitude of M_V=-10 and a steeper
faint-end slope.
| astro-ph.GA | the study of dwarf galaxies and their environments provides crucial testbeds for predictions of cosmological models and insights on the structure formation on small cosmological scales in recent years many problems on the scale of groups of galaxies challenged the current standard model of cosmology we aim to increase the sample of known galaxies in the leoi group containing the m96 subgroup and the leo triplet this galaxy aggregate is located at the edge of the local volume at a mean distance of 107 mpc we employ image enhancing techniques to search for lowsurface brightness objects in publicly available gr images taken by the sloan digital sky survey within 500 square degrees around the leoi group once detected we perform surface photometry and compare their structural parameters to other known dwarf galaxies in the nearby universe we found 36 new dwarf galaxy candidates within the search area their morphology and structural parameters resemble known dwarfs in other groups among the candidates 5 to 6 galaxies are considered as ultra diffuse galaxies candidates if confirmed they would be some of the closest examples of this galaxy type we assessed the luminosity function of the leoi group and find it to be considerably rich in dwarf galaxies with twice the number of galaxies as the local group at a limiting magnitude of m_v10 and a steeper faintend slope | [['the', 'study', 'of', 'dwarf', 'galaxies', 'and', 'their', 'environments', 'provides', 'crucial', 'testbeds', 'for', 'predictions', 'of', 'cosmological', 'models', 'and', 'insights', 'on', 'the', 'structure', 'formation', 'on', 'small', 'cosmological', 'scales', 'in', 'recent', 'years', 'many', 'problems', 'on', 'the', 'scale', 'of', 'groups', 'of', 'galaxies', 'challenged', 'the', 'current', 'standard', 'model', 'of', 'cosmology', 'we', 'aim', 'to', 'increase', 'the', 'sample', 'of', 'known', 'galaxies', 'in', 'the', 'leoi', 'group', 'containing', 'the', 'm96', 'subgroup', 'and', 'the', 'leo', 'triplet', 'this', 'galaxy', 'aggregate', 'is', 'located', 'at', 'the', 'edge', 'of', 'the', 'local', 'volume', 'at', 'a', 'mean', 'distance', 'of', '107', 'mpc', 'we', 'employ', 'image', 'enhancing', 'techniques', 'to', 'search', 'for', 'lowsurface', 'brightness', 'objects', 'in', 'publicly', 'available', 'gr', 'images', 'taken', 'by', 'the', 'sloan', 'digital', 'sky', 'survey', 'within', '500', 'square', 'degrees', 'around', 'the', 'leoi', 'group', 'once', 'detected', 'we', 'perform', 'surface', 'photometry', 'and', 'compare', 'their', 'structural', 'parameters', 'to', 'other', 'known', 'dwarf', 'galaxies', 'in', 'the', 'nearby', 'universe', 'we', 'found', '36', 'new', 'dwarf', 'galaxy', 'candidates', 'within', 'the', 'search', 'area', 'their', 'morphology', 'and', 'structural', 'parameters', 'resemble', 'known', 'dwarfs', 'in', 'other', 'groups', 'among', 'the', 'candidates', '5', 'to', '6', 'galaxies', 'are', 'considered', 'as', 'ultra', 'diffuse', 'galaxies', 'candidates', 'if', 'confirmed', 'they', 'would', 'be', 'some', 'of', 'the', 'closest', 'examples', 'of', 'this', 'galaxy', 'type', 'we', 'assessed', 'the', 'luminosity', 'function', 'of', 'the', 'leoi', 'group', 'and', 'find', 'it', 'to', 'be', 'considerably', 'rich', 'in', 'dwarf', 'galaxies', 'with', 'twice', 'the', 'number', 'of', 'galaxies', 'as', 'the', 'local', 'group', 'at', 'a', 'limiting', 'magnitude', 'of', 'm_v10', 'and', 'a', 'steeper', 'faintend', 'slope']] | [-0.07174735141514216, 0.03589022153498094, -0.0887864917533192, 0.11518102750518004, -0.11437404574105203, -0.049724589956025966, 0.05358120253251915, 0.4145441877334255, -0.1613388012999883, -0.38301515235952965, 0.0608148836135139, -0.3144161452382671, -0.05155499878883428, 0.21383126837972025, -0.034357415067147366, -0.03853571217402041, 0.016486931282386135, -0.03164099765718972, -0.051784563245070456, -0.3476009843695859, 0.2776417730765549, 0.06651181717963675, 0.1888032894394442, -0.09440643164541457, 0.05369843621697046, -0.07385646902947826, -0.11960316697481722, -0.018653884101494225, -0.1714564461108561, 0.01823173768393926, 0.2591955448318495, 0.10817158304204323, 0.2368677000142222, -0.35778600726656146, -0.1928820598466668, 0.11758957847703529, 0.18837789573966304, 0.03759258895477824, -0.09883200439966523, -0.3140486817502013, 0.10845894429243409, -0.15076874856078848, -0.18759772764823804, 0.05864984347573605, 0.04344374323171044, 0.02516428613520137, -0.163893429316741, 0.1538411623569601, -0.015098310105576782, 0.10618667852182963, -0.0887780621363493, -0.1327791885365691, -0.046451397968530324, 0.11242983861624437, 0.007942589624698349, 0.06178576684354978, 0.2053621839793745, -0.1780659463998359, -0.01848409703285722, 0.43977324428877473, -0.05756315358850561, 0.004338663596808251, 0.24695382664903207, -0.19040516552317524, -0.1719341699932331, 0.07411581319416832, 0.17349250018761486, 0.11276152544135673, -0.16508887680602854, 0.052212305834972245, -0.022869323637847484, 0.18406810242460167, 0.001899948384843569, 0.07522487421889647, 0.28749140874540385, 0.132272681387232, 0.06878836743870495, 0.06683306574159038, -0.20083180558970776, -0.004863192815646793, -0.23963181674100542, -0.09727496921859549, -0.15610413661894215, 0.05734524281646034, -0.13688064791243865, -0.11069458035908772, 0.38778866671872597, 0.10881678862971114, 0.2161600781693247, 0.08440058591489194, 0.2741863928617811, 0.006474326194709052, 0.17332470699201083, 0.10159094763334543, 0.2789642529314089, 0.14735893878583028, 0.0205761368522437, -0.19756355535175107, 0.027986637605106935, 0.004107404980845585] |
1,802.08658 | On detecting changes in the jumps of arbitrary size of a time-continuous
stochastic process | This paper introduces test and estimation procedures for abrupt and gradual
changes in the entire jump behaviour of a discretely observed Ito
semimartingale. In contrast to existing work we analyse jumps of arbitrary size
which are not restricted to a minimum height. Our methods are based on weak
convergence of a truncated sequential empirical distribution function of the
jump characteristic of the underlying Ito semimartingale. Critical values for
the new tests are obtained by a multiplier bootstrap approach and we
investigate the performance of the tests also under local alternatives. An
extensive simulation study shows the finite-sample properties of the new
procedures.
| math.ST stat.TH | this paper introduces test and estimation procedures for abrupt and gradual changes in the entire jump behaviour of a discretely observed ito semimartingale in contrast to existing work we analyse jumps of arbitrary size which are not restricted to a minimum height our methods are based on weak convergence of a truncated sequential empirical distribution function of the jump characteristic of the underlying ito semimartingale critical values for the new tests are obtained by a multiplier bootstrap approach and we investigate the performance of the tests also under local alternatives an extensive simulation study shows the finitesample properties of the new procedures | [['this', 'paper', 'introduces', 'test', 'and', 'estimation', 'procedures', 'for', 'abrupt', 'and', 'gradual', 'changes', 'in', 'the', 'entire', 'jump', 'behaviour', 'of', 'a', 'discretely', 'observed', 'ito', 'semimartingale', 'in', 'contrast', 'to', 'existing', 'work', 'we', 'analyse', 'jumps', 'of', 'arbitrary', 'size', 'which', 'are', 'not', 'restricted', 'to', 'a', 'minimum', 'height', 'our', 'methods', 'are', 'based', 'on', 'weak', 'convergence', 'of', 'a', 'truncated', 'sequential', 'empirical', 'distribution', 'function', 'of', 'the', 'jump', 'characteristic', 'of', 'the', 'underlying', 'ito', 'semimartingale', 'critical', 'values', 'for', 'the', 'new', 'tests', 'are', 'obtained', 'by', 'a', 'multiplier', 'bootstrap', 'approach', 'and', 'we', 'investigate', 'the', 'performance', 'of', 'the', 'tests', 'also', 'under', 'local', 'alternatives', 'an', 'extensive', 'simulation', 'study', 'shows', 'the', 'finitesample', 'properties', 'of', 'the', 'new', 'procedures']] | [-0.07178068041399706, 0.02807418194581759, -0.12600316649403276, 0.09317090649239938, -0.05492027366406047, -0.09586035062481339, 0.08368540641865418, 0.3966164613831971, -0.2582075117639832, -0.26442742454545465, 0.13476147269830108, -0.21237214248371766, -0.15387368398061133, 0.21621471465400913, -0.11217061538413606, 0.10697468083169809, 0.03085242771525301, -0.013591217729673885, -0.1195776983091206, -0.2727056598363846, 0.28118479139326763, 0.0640527070773875, 0.32044934828345684, -0.023091206509692996, 0.09793947670407885, -0.00092440908409509, -0.04361942209595559, 0.05036477125980252, -0.1781063182507733, 0.10792654361434603, 0.19556656969236394, 0.07949795515057356, 0.3252865675398532, -0.40412659545009044, -0.18560514342058085, 0.10070130302954246, 0.09318306831661247, 0.04785666232084052, -0.03904309958634971, -0.2554399408879416, 0.08956641228139109, -0.14110947581117644, -0.13656207644745855, -0.0794728126019632, -0.023205798311049446, 0.09081222251851988, -0.3461294886062616, 0.08431960544839967, 0.09174391286739823, 0.11434373443982765, -0.04196799414885212, -0.10510612446723469, 0.0451916905266105, 0.07995279816061478, 0.09069212914134066, -0.05885930733946974, 0.15144728275253347, -0.09446159078894804, -0.1489483269168904, 0.2727785606813781, -0.09403055197988436, -0.1919321921110774, 0.2016893332006921, -0.16235603642759516, -0.1360288076856009, 0.14477641481047898, 0.16966400991248734, 0.14300456554537602, -0.17317156350313156, 0.11757270147505801, -0.03109733164584374, 0.12259810036687437, 0.024132903076379615, -0.01868943102183003, 0.13044597139620842, 0.1805874138120927, 0.0755389234685686, 0.17515489550343916, -0.10463779777580616, -0.1270035358337576, -0.36417533230839993, -0.18491992802706128, -0.17555806397086046, 0.02916858245532471, -0.12249918746280908, -0.24129516253357425, 0.4125407583573285, 0.20183066693225912, 0.20265658331267974, 0.10396102060650603, 0.261334615914772, 0.14927693482547744, 0.0004880957524566089, 0.057688105344662774, 0.18102598559184402, 0.11097326402223724, 0.07478792076546918, -0.20853025002368525, 0.16313109578628676, 0.033896545302031525] |
1,802.08659 | Skew cyclic codes over F_{p}+uF_{p}+\dots +u^{k-1}F_{p} | In this article, we study the skew cyclic codes over R_{k}=F_{p}+uF_{p}+\dots
+u^{k-1}F_{p} of length n. We characterize the skew cyclic codes of length $n$
over R_{k} as free left R_{k}[x;\theta]-submodules of R_{k}[x;\theta]/\langle
x^{n}-1\rangle and construct their generators and minimal generating sets.
Also, an algorithm has been provided to encode and decode these skew cyclic
codes.
| cs.IT math.IT | in this article we study the skew cyclic codes over r_kf_puf_pdots uk1f_p of length n we characterize the skew cyclic codes of length n over r_k as free left r_kxthetasubmodules of r_kxthetalangle xn1rangle and construct their generators and minimal generating sets also an algorithm has been provided to encode and decode these skew cyclic codes | [['in', 'this', 'article', 'we', 'study', 'the', 'skew', 'cyclic', 'codes', 'over', 'r_kf_puf_pdots', 'uk1f_p', 'of', 'length', 'n', 'we', 'characterize', 'the', 'skew', 'cyclic', 'codes', 'of', 'length', 'n', 'over', 'r_k', 'as', 'free', 'left', 'r_kxthetasubmodules', 'of', 'r_kxthetalangle', 'xn1rangle', 'and', 'construct', 'their', 'generators', 'and', 'minimal', 'generating', 'sets', 'also', 'an', 'algorithm', 'has', 'been', 'provided', 'to', 'encode', 'and', 'decode', 'these', 'skew', 'cyclic', 'codes']] | [-0.20717540091159298, 0.15384215475590762, -0.032214205780559606, 0.07287073788899637, -0.0033563929153423685, -0.19168358235893881, -0.04820652415647226, 0.4110530885392983, -0.40910322920364495, -0.18737670811185358, 0.08601710337953751, -0.25226309179675344, -0.1646231919545315, 0.23008606564618794, -0.12253513146995329, 0.014257365801170761, -0.017923191463684335, 0.11397561405365374, -0.15352145806137546, -0.3480655179158145, 0.2551200704503001, 0.13215644854833097, 0.18137311595765984, 0.01704573890596044, 0.1176782124401892, 0.03832801533680336, -0.12966261757537723, -0.009936349402528768, -0.2665305905336258, 0.08936425126796844, 0.25556003561645163, 0.16870227464766918, 0.10927288782070665, -0.38137416127046536, -0.16531747592357443, 0.22702847245861502, 0.16420424364361108, 0.11280484530417358, -0.00024247563937131097, -0.14823761942120744, 0.21497194662544072, -0.2407775303604556, -0.04918237546385795, -0.02790480362726193, 0.07426879927515984, 0.03822810142118411, -0.2578983674483264, -0.06732929339598152, 0.08032054810182136, 0.1624873606385389, 0.01649728640183514, -0.11824324904192313, 0.05807037230617568, 0.17174764056963956, 0.04021701023128687, -0.0025898451761653027, -0.01648570984309795, -0.0016990111428586876, -0.18392602405419536, 0.31522034386209413, 0.0005044763652133007, -0.19789884810098538, 0.06787506845670149, -0.10718445848746627, -0.07925471170421909, 0.11238000005958419, 0.18983173295490297, 0.1200204086216057, -0.09343669141697533, 0.18234472274072652, -0.1592485967512224, 0.13309913114005445, 0.16297562707069457, 0.12020171172551665, 0.1609380803271836, 0.028949722465054662, 0.025886913432794458, 0.19400992622489438, -0.03618080800800931, -0.053691061651882005, -0.3049906899869515, -0.16573135825056656, -0.11411632137263522, 0.07403499766380764, -0.11600205653681483, -0.22529715281345097, 0.41942216364630297, 0.1279737410939061, 0.16050716011109306, 0.12499367232050966, 0.21941855954755024, -0.015870328629663324, 0.13137339697876835, 0.13162586417998753, -0.020264471415430307, 0.2158449014018783, -0.0960566254889629, -0.23019832387274386, 0.055900229150246755, 0.13717286381870508] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.