id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.01567 | Controlled Film Flow in Granulation of Metals for the Development of
Amorphous Superhard and Functionally Unique New Materials | The problem of granulation is very bright by the granulated materials, as
well as by their application. In the paper, some history of the granulation
problem during over century and modern applications of the metallic granulates
and amorphous materials are given at the beginning. Then the specific own
granulation problem is presented, which has concern to the controlled liquid
metal jet and film flows for a production of the uniform by size and form
particles (granules) cooled with a high rate, to be amorphous or close to the
amorphous materials. Such granules of the given size and form are needed for
the new material science. The basics of developed theory of the controlled jet
and film flow disintegration with further rapid cooling of the drops obtained
after flow disintegration are presented together with the new patented
granulation devices. The developed methods and devices can be used for
production of the amorphous or close to amorphous granules in a wide range of
the given sizes, with very narrow (plus-minus 50% deviation of size from the
average one).
| physics.app-ph | the problem of granulation is very bright by the granulated materials as well as by their application in the paper some history of the granulation problem during over century and modern applications of the metallic granulates and amorphous materials are given at the beginning then the specific own granulation problem is presented which has concern to the controlled liquid metal jet and film flows for a production of the uniform by size and form particles granules cooled with a high rate to be amorphous or close to the amorphous materials such granules of the given size and form are needed for the new material science the basics of developed theory of the controlled jet and film flow disintegration with further rapid cooling of the drops obtained after flow disintegration are presented together with the new patented granulation devices the developed methods and devices can be used for production of the amorphous or close to amorphous granules in a wide range of the given sizes with very narrow plusminus 50 deviation of size from the average one | [['the', 'problem', 'of', 'granulation', 'is', 'very', 'bright', 'by', 'the', 'granulated', 'materials', 'as', 'well', 'as', 'by', 'their', 'application', 'in', 'the', 'paper', 'some', 'history', 'of', 'the', 'granulation', 'problem', 'during', 'over', 'century', 'and', 'modern', 'applications', 'of', 'the', 'metallic', 'granulates', 'and', 'amorphous', 'materials', 'are', 'given', 'at', 'the', 'beginning', 'then', 'the', 'specific', 'own', 'granulation', 'problem', 'is', 'presented', 'which', 'has', 'concern', 'to', 'the', 'controlled', 'liquid', 'metal', 'jet', 'and', 'film', 'flows', 'for', 'a', 'production', 'of', 'the', 'uniform', 'by', 'size', 'and', 'form', 'particles', 'granules', 'cooled', 'with', 'a', 'high', 'rate', 'to', 'be', 'amorphous', 'or', 'close', 'to', 'the', 'amorphous', 'materials', 'such', 'granules', 'of', 'the', 'given', 'size', 'and', 'form', 'are', 'needed', 'for', 'the', 'new', 'material', 'science', 'the', 'basics', 'of', 'developed', 'theory', 'of', 'the', 'controlled', 'jet', 'and', 'film', 'flow', 'disintegration', 'with', 'further', 'rapid', 'cooling', 'of', 'the', 'drops', 'obtained', 'after', 'flow', 'disintegration', 'are', 'presented', 'together', 'with', 'the', 'new', 'patented', 'granulation', 'devices', 'the', 'developed', 'methods', 'and', 'devices', 'can', 'be', 'used', 'for', 'production', 'of', 'the', 'amorphous', 'or', 'close', 'to', 'amorphous', 'granules', 'in', 'a', 'wide', 'range', 'of', 'the', 'given', 'sizes', 'with', 'very', 'narrow', 'plusminus', '50', 'deviation', 'of', 'size', 'from', 'the', 'average', 'one']] | [-0.03493222452710721, 0.1911562550336715, -0.06554135590373665, 0.009321958537012424, -0.03964586983387231, -0.08959628743468784, 0.026238050666341387, 0.36447212675755675, -0.28926147308877925, -0.3435477867513493, 0.13113661582809238, -0.27680129724533553, -0.08011165077385324, 0.22735921693277883, -0.06566373155378229, 0.07647214522334748, 0.04141788931552914, -0.009390532301040366, -0.03390075067926029, -0.22082496008475905, 0.27449678927686444, 0.06849040087862787, 0.2703367272730578, 0.05588935677554797, 0.07683017983717119, -0.04625312150032683, 0.011607391760414677, 0.05344390406125141, -0.13736863373593555, 0.10984770868526539, 0.2413348410945301, 0.03951782488200644, 0.25209798191843386, -0.4819802340247076, -0.2231041696822186, 0.028779123237737538, 0.11836202595308846, 0.07176248992949365, -0.07357683318100912, -0.25597857483742037, 0.11660705491455949, -0.1447126507171726, -0.12032109095211622, -0.007705381351777099, 0.03005156776105816, 0.058200252506801255, -0.22218497758876765, 0.05352589289065112, 0.03307236983792708, 0.08867437949216268, -0.05745932593394669, -0.12252724124118686, -0.04488542203828481, 0.13582106960794507, 0.061735918491401455, 0.013778858193042899, 0.20230881328197112, -0.15761420890107108, -0.03933532675199041, 0.41929959368214686, -0.052612587772521445, -0.09235456420786002, 0.20390674103294837, -0.1432427029225933, -0.0461643689724786, 0.18702578312844376, 0.18437098488158715, 0.11965480475390161, -0.11872432302665072, -0.005240913318795554, -0.0031065744194413787, 0.1560686535694086, 0.06363769186480733, 0.0341679183938223, 0.24411461733159906, 0.2310926345684989, 0.020755488555137577, 0.15809658073306887, -0.12090241712311664, -0.05454344073289328, -0.26314975634555926, -0.1802041026372039, -0.1697893108939752, 0.018642037926342295, -0.0946961641477835, -0.19426369842734525, 0.3676883787146918, 0.09884481041949171, 0.19274740120586517, -0.004101021153804719, 0.26957666632634675, 0.07750876926663543, 0.0813433163176259, 0.05664124444460454, 0.23514800434565009, 0.18202418442789084, 0.1688799373163916, -0.17183334315433801, 0.10074237730375236, 0.00854188168887049] |
1,803.01568 | Simple and efficient LCAO basis sets for the diffuse states in carbon
nanostructures | We present a simple way to describe the lowest unoccupied diffuse states in
carbon nanostructures in density functional theory (DFT) calculations using a
minimal LCAO (linear combination of atomic orbitals) basis set. By comparing
plane wave basis calculations, we show how these states can be captured by
adding long-range orbitals to the standard LCAO basis sets for the extreme
cases of planar <it>sp2</it> (graphene) and curved carbon (C60). In particular,
using Bessel functions with a long range as additional basis functions retain a
minimal basis size. This provides a smaller and simpler atom-centered basis set
compared to the standard pseudo-atomic orbitals (PAOs) with multiple
polarization orbitals or by adding non-atom-centered states to the basis.
| cond-mat.mes-hall | we present a simple way to describe the lowest unoccupied diffuse states in carbon nanostructures in density functional theory dft calculations using a minimal lcao linear combination of atomic orbitals basis set by comparing plane wave basis calculations we show how these states can be captured by adding longrange orbitals to the standard lcao basis sets for the extreme cases of planar itsp2it graphene and curved carbon c60 in particular using bessel functions with a long range as additional basis functions retain a minimal basis size this provides a smaller and simpler atomcentered basis set compared to the standard pseudoatomic orbitals paos with multiple polarization orbitals or by adding nonatomcentered states to the basis | [['we', 'present', 'a', 'simple', 'way', 'to', 'describe', 'the', 'lowest', 'unoccupied', 'diffuse', 'states', 'in', 'carbon', 'nanostructures', 'in', 'density', 'functional', 'theory', 'dft', 'calculations', 'using', 'a', 'minimal', 'lcao', 'linear', 'combination', 'of', 'atomic', 'orbitals', 'basis', 'set', 'by', 'comparing', 'plane', 'wave', 'basis', 'calculations', 'we', 'show', 'how', 'these', 'states', 'can', 'be', 'captured', 'by', 'adding', 'longrange', 'orbitals', 'to', 'the', 'standard', 'lcao', 'basis', 'sets', 'for', 'the', 'extreme', 'cases', 'of', 'planar', 'itsp2it', 'graphene', 'and', 'curved', 'carbon', 'c60', 'in', 'particular', 'using', 'bessel', 'functions', 'with', 'a', 'long', 'range', 'as', 'additional', 'basis', 'functions', 'retain', 'a', 'minimal', 'basis', 'size', 'this', 'provides', 'a', 'smaller', 'and', 'simpler', 'atomcentered', 'basis', 'set', 'compared', 'to', 'the', 'standard', 'pseudoatomic', 'orbitals', 'paos', 'with', 'multiple', 'polarization', 'orbitals', 'or', 'by', 'adding', 'nonatomcentered', 'states', 'to', 'the', 'basis']] | [-0.07722816124909773, 0.11371807527653541, -0.03786856321884053, 0.06174589985727964, -0.00030905893072485924, -0.07732010472812233, 0.08729224232021286, 0.3963043484753663, -0.26070088420445764, -0.2604265128154241, -0.03467790093002675, -0.28647535789059475, -0.12574875152910994, 0.12447253174156815, 0.06449648555800584, 0.06356046030746906, 0.08631718127123479, -0.11263652432743194, -0.11557534948016317, -0.1842062511880483, 0.2853305912680558, 0.07038444252767866, 0.24267233106573777, 0.0013531992943691356, 0.02566441215458326, 0.04831743228299144, 0.05210607629435669, 0.030309046603162772, -0.08787807229756643, 0.20879127626176341, 0.2656976980464866, 0.05049004563729146, 0.24946871511415988, -0.546863662677684, -0.19172498916512787, -0.005703623244439119, 0.12619477160374767, 0.16917439101962373, -0.024595570721430704, -0.2514010848639633, -0.004636238229327968, -0.18450648655250138, -0.17830291446132054, -0.17293200040746473, 0.008519788971170783, 0.05169602599926293, -0.274008948975409, 0.06475428488400732, -0.03838286952980395, 0.08135941851118592, -0.07082469365559518, -0.2047369002081853, -0.10600212672891628, 0.01592207771318499, -0.04277768770017636, 0.06782657820440363, 0.13458913807075337, -0.040576494167908095, -0.12037306721738007, 0.42979562415608336, -0.09116030373011849, -0.2615887630303665, 0.1854393781811398, -0.17303531128085783, -0.08055351845645678, 0.11465948025163795, 0.08985379882921864, 0.0949603696145849, -0.15328858045450033, 0.12686686528884042, -0.07352237959159018, 0.18630020930348629, 0.1209109113447734, 0.09419457363713134, 0.19131704652681947, 0.13061953989381436, 0.03795463921414921, 0.11830154441642142, -0.08004953452070497, -0.06023166088185202, -0.2682896466290653, -0.14358039469412429, -0.23724244146952905, 0.021429923729296467, -0.06083361459786829, -0.20689416623541287, 0.4353321513876186, 0.05927799519434172, 0.16078478605153837, 0.007743158577276128, 0.22831765945634938, 0.14267456854187394, 0.1114704927562603, 0.013908470814515437, 0.17039805322253546, 0.138204750478118, -0.04953061758507309, -0.17975314506994827, 0.018951125808858445, 0.09060625365444659] |
1,803.01569 | Constraints on submicrojansky radio number counts based on evolving
VLA-COSMOS luminosity functions | We present an investigation of radio luminosity functions (LFs) and number
counts based on the Karl G. Jansky Very Large Array-COSMOS 3 GHz Large Project.
The radio-selected sample of 7826 galaxies with robust optical/near-infrared
counterparts with excellent photometric coverage allows us to construct the
total radio LF since z~5.7. Using the Markov chain Monte Carlo algorithm, we
fit the redshift dependent pure luminosity evolution model to the data and
compare it with previously published VLA-COSMOS LFs obtained on individual
populations of radio-selected star-forming galaxies and galaxies hosting active
galactic nuclei classified on the basis of presence or absence of a radio
excess with respect to the star-formation rates derived from the infrared
emission. We find they are in excellent agreement, thus showing the reliability
of the radio excess method in selecting these two galaxy populations at radio
wavelengths. We study radio number counts down to submicrojansky levels drawn
from different models of evolving LFs. We show that our evolving LFs are able
to reproduce the observed radio sky brightness, even though we rely on
extrapolations toward the faint end. Our results also imply that no new
radio-emitting galaxy population is present below 1 ujy. Our work suggests that
selecting galaxies with radio flux densities between 0.1 and 10 ujy will yield
a star-forming galaxy in 90-95 % of the cases with a high percentage of these
galaxies existing around a redshift of z~2, thus providing useful constraints
for planned surveys with the Square Kilometer Array and its precursors.
| astro-ph.GA | we present an investigation of radio luminosity functions lfs and number counts based on the karl g jansky very large arraycosmos 3 ghz large project the radioselected sample of 7826 galaxies with robust opticalnearinfrared counterparts with excellent photometric coverage allows us to construct the total radio lf since z57 using the markov chain monte carlo algorithm we fit the redshift dependent pure luminosity evolution model to the data and compare it with previously published vlacosmos lfs obtained on individual populations of radioselected starforming galaxies and galaxies hosting active galactic nuclei classified on the basis of presence or absence of a radio excess with respect to the starformation rates derived from the infrared emission we find they are in excellent agreement thus showing the reliability of the radio excess method in selecting these two galaxy populations at radio wavelengths we study radio number counts down to submicrojansky levels drawn from different models of evolving lfs we show that our evolving lfs are able to reproduce the observed radio sky brightness even though we rely on extrapolations toward the faint end our results also imply that no new radioemitting galaxy population is present below 1 ujy our work suggests that selecting galaxies with radio flux densities between 01 and 10 ujy will yield a starforming galaxy in 9095 of the cases with a high percentage of these galaxies existing around a redshift of z2 thus providing useful constraints for planned surveys with the square kilometer array and its precursors | [['we', 'present', 'an', 'investigation', 'of', 'radio', 'luminosity', 'functions', 'lfs', 'and', 'number', 'counts', 'based', 'on', 'the', 'karl', 'g', 'jansky', 'very', 'large', 'arraycosmos', '3', 'ghz', 'large', 'project', 'the', 'radioselected', 'sample', 'of', '7826', 'galaxies', 'with', 'robust', 'opticalnearinfrared', 'counterparts', 'with', 'excellent', 'photometric', 'coverage', 'allows', 'us', 'to', 'construct', 'the', 'total', 'radio', 'lf', 'since', 'z57', 'using', 'the', 'markov', 'chain', 'monte', 'carlo', 'algorithm', 'we', 'fit', 'the', 'redshift', 'dependent', 'pure', 'luminosity', 'evolution', 'model', 'to', 'the', 'data', 'and', 'compare', 'it', 'with', 'previously', 'published', 'vlacosmos', 'lfs', 'obtained', 'on', 'individual', 'populations', 'of', 'radioselected', 'starforming', 'galaxies', 'and', 'galaxies', 'hosting', 'active', 'galactic', 'nuclei', 'classified', 'on', 'the', 'basis', 'of', 'presence', 'or', 'absence', 'of', 'a', 'radio', 'excess', 'with', 'respect', 'to', 'the', 'starformation', 'rates', 'derived', 'from', 'the', 'infrared', 'emission', 'we', 'find', 'they', 'are', 'in', 'excellent', 'agreement', 'thus', 'showing', 'the', 'reliability', 'of', 'the', 'radio', 'excess', 'method', 'in', 'selecting', 'these', 'two', 'galaxy', 'populations', 'at', 'radio', 'wavelengths', 'we', 'study', 'radio', 'number', 'counts', 'down', 'to', 'submicrojansky', 'levels', 'drawn', 'from', 'different', 'models', 'of', 'evolving', 'lfs', 'we', 'show', 'that', 'our', 'evolving', 'lfs', 'are', 'able', 'to', 'reproduce', 'the', 'observed', 'radio', 'sky', 'brightness', 'even', 'though', 'we', 'rely', 'on', 'extrapolations', 'toward', 'the', 'faint', 'end', 'our', 'results', 'also', 'imply', 'that', 'no', 'new', 'radioemitting', 'galaxy', 'population', 'is', 'present', 'below', '1', 'ujy', 'our', 'work', 'suggests', 'that', 'selecting', 'galaxies', 'with', 'radio', 'flux', 'densities', 'between', '01', 'and', '10', 'ujy', 'will', 'yield', 'a', 'starforming', 'galaxy', 'in', '9095', 'of', 'the', 'cases', 'with', 'a', 'high', 'percentage', 'of', 'these', 'galaxies', 'existing', 'around', 'a', 'redshift', 'of', 'z2', 'thus', 'providing', 'useful', 'constraints', 'for', 'planned', 'surveys', 'with', 'the', 'square', 'kilometer', 'array', 'and', 'its', 'precursors']] | [-0.03349609334706044, 0.06677188067180247, -0.05723544357876693, 0.11999421639626903, -0.09594610455274886, -0.06638610188146027, 0.07872656370722214, 0.5164455326083972, -0.07257408936488993, -0.3884056900601777, 0.06934786622212934, -0.3073005098251422, -0.020530203316623242, 0.21534956865563837, 0.016266187452426067, -0.027099822968368097, 0.06209368455100196, -0.15397598510608076, -0.023938352976122644, -0.2915022330928822, 0.2623719123952395, 0.12094665169050652, 0.23604082243650087, -0.07701341313956192, 0.07539699818150197, -0.09542548432280974, -0.1265787366473553, -0.007630028455390189, -0.13314753807365434, 0.05671601131634445, 0.2982687406362615, 0.13383617134745784, 0.2122728797203234, -0.35282502828949314, -0.17065257701870737, 0.12177835927553932, 0.17062760771689367, 0.04155425778114978, -0.06491496321597916, -0.2790460633845734, 0.06939122185766773, -0.17915529195092766, -0.18436581260163565, 0.07828564155960874, -0.009466994252267926, 0.08338573826714514, -0.19866260092441773, 0.13722618873770426, -0.051424971253050455, 0.09612616663988756, -0.09673846776155298, -0.13454324477257168, -0.05326231811290645, 0.09417087394929471, -0.004102484525504465, 0.09655286511786434, 0.16330932047674243, -0.15666617037804456, -0.057100666736309626, 0.347003750404229, -0.04461587776040316, 0.012729515445095544, 0.25099918653390235, -0.23364426110281933, -0.24301676576135517, 0.13958401952547078, 0.16336191549590712, 0.07093076445162297, -0.1429148483489241, 0.015600419315100856, -0.021129347530326675, 0.23810984759724566, -0.008962894911516686, 0.09177804599763774, 0.29781649526284665, 0.11297192002494573, 0.07087059348051873, 0.132473202704509, -0.22404536870403252, 0.006876291668194593, -0.2626716737065236, -0.02681090318008649, -0.16426995591146454, 0.1361234475487881, -0.12573460342941037, -0.12146466018784106, 0.3753510988678555, 0.14057025999456008, 0.20348499831933603, 0.20234239870796397, 0.28434736393392085, 0.07893294780942782, 0.12996751484746227, 0.12152880674456151, 0.2801604302143868, 0.14697351541598233, 0.047863923933128924, -0.20197375438233114, 0.024129825864671446, -0.0379324708951219] |
1,803.0157 | Adversarial Extreme Multi-label Classification | The goal in extreme multi-label classification is to learn a classifier which
can assign a small subset of relevant labels to an instance from an extremely
large set of target labels. Datasets in extreme classification exhibit a long
tail of labels which have small number of positive training instances. In this
work, we pose the learning task in extreme classification with large number of
tail-labels as learning in the presence of adversarial perturbations. This view
motivates a robust optimization framework and equivalence to a corresponding
regularized objective.
Under the proposed robustness framework, we demonstrate efficacy of Hamming
loss for tail-label detection in extreme classification. The equivalent
regularized objective, in combination with proximal gradient based
optimization, performs better than state-of-the-art methods on propensity
scored versions of precision@k and nDCG@k(upto 20% relative improvement over
PFastreXML - a leading tree-based approach and 60% relative improvement over
SLEEC - a leading label-embedding approach). Furthermore, we also highlight the
sub-optimality of a sparse solver in a widely used package for large-scale
linear classification, which is interesting in its own right. We also
investigate the spectral properties of label graphs for providing novel
insights towards understanding the conditions governing the performance of
Hamming loss based one-vs-rest scheme vis-\`a-vis label embedding methods.
| stat.ML cs.LG | the goal in extreme multilabel classification is to learn a classifier which can assign a small subset of relevant labels to an instance from an extremely large set of target labels datasets in extreme classification exhibit a long tail of labels which have small number of positive training instances in this work we pose the learning task in extreme classification with large number of taillabels as learning in the presence of adversarial perturbations this view motivates a robust optimization framework and equivalence to a corresponding regularized objective under the proposed robustness framework we demonstrate efficacy of hamming loss for taillabel detection in extreme classification the equivalent regularized objective in combination with proximal gradient based optimization performs better than stateoftheart methods on propensity scored versions of precisionk and ndcgkupto 20 relative improvement over pfastrexml a leading treebased approach and 60 relative improvement over sleec a leading labelembedding approach furthermore we also highlight the suboptimality of a sparse solver in a widely used package for largescale linear classification which is interesting in its own right we also investigate the spectral properties of label graphs for providing novel insights towards understanding the conditions governing the performance of hamming loss based onevsrest scheme visavis label embedding methods | [['the', 'goal', 'in', 'extreme', 'multilabel', 'classification', 'is', 'to', 'learn', 'a', 'classifier', 'which', 'can', 'assign', 'a', 'small', 'subset', 'of', 'relevant', 'labels', 'to', 'an', 'instance', 'from', 'an', 'extremely', 'large', 'set', 'of', 'target', 'labels', 'datasets', 'in', 'extreme', 'classification', 'exhibit', 'a', 'long', 'tail', 'of', 'labels', 'which', 'have', 'small', 'number', 'of', 'positive', 'training', 'instances', 'in', 'this', 'work', 'we', 'pose', 'the', 'learning', 'task', 'in', 'extreme', 'classification', 'with', 'large', 'number', 'of', 'taillabels', 'as', 'learning', 'in', 'the', 'presence', 'of', 'adversarial', 'perturbations', 'this', 'view', 'motivates', 'a', 'robust', 'optimization', 'framework', 'and', 'equivalence', 'to', 'a', 'corresponding', 'regularized', 'objective', 'under', 'the', 'proposed', 'robustness', 'framework', 'we', 'demonstrate', 'efficacy', 'of', 'hamming', 'loss', 'for', 'taillabel', 'detection', 'in', 'extreme', 'classification', 'the', 'equivalent', 'regularized', 'objective', 'in', 'combination', 'with', 'proximal', 'gradient', 'based', 'optimization', 'performs', 'better', 'than', 'stateoftheart', 'methods', 'on', 'propensity', 'scored', 'versions', 'of', 'precisionk', 'and', 'ndcgkupto', '20', 'relative', 'improvement', 'over', 'pfastrexml', 'a', 'leading', 'treebased', 'approach', 'and', '60', 'relative', 'improvement', 'over', 'sleec', 'a', 'leading', 'labelembedding', 'approach', 'furthermore', 'we', 'also', 'highlight', 'the', 'suboptimality', 'of', 'a', 'sparse', 'solver', 'in', 'a', 'widely', 'used', 'package', 'for', 'largescale', 'linear', 'classification', 'which', 'is', 'interesting', 'in', 'its', 'own', 'right', 'we', 'also', 'investigate', 'the', 'spectral', 'properties', 'of', 'label', 'graphs', 'for', 'providing', 'novel', 'insights', 'towards', 'understanding', 'the', 'conditions', 'governing', 'the', 'performance', 'of', 'hamming', 'loss', 'based', 'onevsrest', 'scheme', 'visavis', 'label', 'embedding', 'methods']] | [-0.0443699074544635, -0.03615320519232378, -0.06100061415324933, 0.07880564494498411, -0.08976570953352929, -0.16170260172112652, 0.05267734479290157, 0.4294428638926703, -0.26081991950096794, -0.34412790187423925, 0.08019833915794371, -0.24847796071296202, -0.1755174420324702, 0.18916344131428184, -0.16017893594353474, 0.09341844773574044, 0.129030912494446, 0.07608339246877249, -0.10960867640506196, -0.2909616654383103, 0.28555008814548466, 0.06343004084777218, 0.32168999625178024, 0.025752615701610776, 0.12183851726591849, -0.01323450158874331, -0.020251747894676486, 0.04581178647311564, -0.05018184298705591, 0.1748128152000788, 0.29266841809086014, 0.18850251262885842, 0.382466306629118, -0.3283853703857067, -0.18818857895219746, 0.12290303222484063, 0.11646034218921986, 0.08319052943531903, -0.04408687836403991, -0.2963484464559573, 0.11225189371666305, -0.17182267353818495, -0.023209600758518856, -0.13105593787637262, -0.020818671578981318, -0.006430401209971151, -0.32335911341123846, 0.05338953260534757, 0.06917515901818547, 0.048066904990648356, -0.08305689548060353, -0.13424958554728322, 0.05725688674842855, 0.11626532150376308, 0.05334303504202384, 0.04976830051348418, 0.09057516785719942, -0.18431674175891072, -0.15028322371829714, 0.3674558013696317, -0.08504409821572112, -0.2170061622465488, 0.1970503539731492, -0.03478687999292684, -0.14842629574950617, 0.13414801875288462, 0.2725188728999908, 0.1692800124418037, -0.12526356287057225, 0.02028603379494141, -0.04913442091894659, 0.14413471323152507, 0.0548285851886861, 0.03983912549107967, 0.16463315614789312, 0.25251350801756334, 0.09711398467396376, 0.17510895444262753, -0.13490867941878998, -0.06528439047283038, -0.2427379904062155, -0.11496170770947882, -0.17834469682569778, 0.008744839142528877, -0.15198134529340285, -0.17341719529728683, 0.41432121737184685, 0.21696501411146593, 0.23015699879501492, 0.10435179396984097, 0.3090961365094736, 0.03155472715528291, 0.07773611624198662, 0.10200889788400709, 0.18496205077866962, 0.07371766993953804, 0.029013192995998954, -0.19917050837398736, 0.09303425105777686, 0.0794174445175271] |
1,803.01571 | Explanatory relations in arbitrary logics based on satisfaction systems,
cutting and retraction | The aim of this paper is to introduce a new framework for defining abductive
reasoning operators based on a notion of retraction in arbitrary logics defined
as satisfaction systems. We show how this framework leads to the design of
explanatory relations satisfying properties of abductive reasoning, and discuss
its application to several logics. This extends previous work on propositional
logics where retraction was defined as a morphological erosion. Here weaker
properties are required for retraction, leading to a larger set of suitable
operators for abduction for different logics.
| cs.AI | the aim of this paper is to introduce a new framework for defining abductive reasoning operators based on a notion of retraction in arbitrary logics defined as satisfaction systems we show how this framework leads to the design of explanatory relations satisfying properties of abductive reasoning and discuss its application to several logics this extends previous work on propositional logics where retraction was defined as a morphological erosion here weaker properties are required for retraction leading to a larger set of suitable operators for abduction for different logics | [['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'introduce', 'a', 'new', 'framework', 'for', 'defining', 'abductive', 'reasoning', 'operators', 'based', 'on', 'a', 'notion', 'of', 'retraction', 'in', 'arbitrary', 'logics', 'defined', 'as', 'satisfaction', 'systems', 'we', 'show', 'how', 'this', 'framework', 'leads', 'to', 'the', 'design', 'of', 'explanatory', 'relations', 'satisfying', 'properties', 'of', 'abductive', 'reasoning', 'and', 'discuss', 'its', 'application', 'to', 'several', 'logics', 'this', 'extends', 'previous', 'work', 'on', 'propositional', 'logics', 'where', 'retraction', 'was', 'defined', 'as', 'a', 'morphological', 'erosion', 'here', 'weaker', 'properties', 'are', 'required', 'for', 'retraction', 'leading', 'to', 'a', 'larger', 'set', 'of', 'suitable', 'operators', 'for', 'abduction', 'for', 'different', 'logics']] | [-0.09998611647593365, 0.051568269676698204, -0.09840331375545991, 0.11607781362412921, -0.19288210382431067, -0.10189184983028099, 0.06363743859269148, 0.375864370027557, -0.2862993361671794, -0.2727711346868256, 0.06093442109572193, -0.21466628685381942, -0.14069933619413694, 0.1908685780892318, -0.15515251077224754, 0.09295683795393085, -0.007383317443203519, 0.04107383898967369, -0.10997208049362102, -0.18474155555172314, 0.3782140377654948, -0.029183604997921397, 0.2143237343539526, 0.07432076253462583, 0.10976355875821107, 0.029449287420985373, 0.00030002685856412757, 0.06481255909470333, -0.13469739753583615, 0.2038886032797481, 0.3010927012523594, 0.2605934012787078, 0.35355605074966495, -0.42260524547997524, -0.18243925748604603, 0.06888219802534547, 0.08779266947054896, 0.02777260351153514, 0.02370885884209367, -0.2880326233888892, 0.07965146239042621, -0.2127879624128003, -0.067731305467367, -0.12681060317184098, 0.07618100458586757, 0.01688212277473543, -0.2692673936676742, -0.03936881138625639, 0.20291233939034017, 0.13847930830458857, -0.07133680723993828, -0.05629291947909885, 0.03701373725198209, 0.05686735394622453, -0.002057207698023624, -0.002838974408487874, 0.14087827076648615, -0.07634060832259076, -0.20330683304928243, 0.3775183491472324, -0.006024822719733824, -0.21536874589086932, 0.18693296297781423, -0.06610852951945906, -0.2153368046433157, 0.023756293357688595, 0.1669859824575145, 0.171177492359923, -0.1891838702881201, 0.09886702924731336, -0.04822505571329119, 0.15218041592214088, 0.09200790227359076, 0.08625348257324235, 0.16535293840305795, 0.23511437788097697, 0.06694058971797032, 0.20652205399660903, 0.043510098649511005, -0.09154127898033369, -0.3328713639639318, -0.16931258868531918, -0.03158758637834002, -0.012312172316755592, -0.06136089734272074, -0.1904373496284031, 0.3896113608286462, 0.23589738792824475, 0.18519400493030183, 0.1717550884482493, 0.2646418090655722, 0.10593949159523287, 0.07905837046299977, -0.020370647782163524, 0.16095934706390835, 0.15907344948077065, 0.11244508814045483, -0.1448160612357738, 0.12053068675926294, 0.09634838245851411] |
1,803.01572 | Robust preconditioning for stochastic Galerkin formulations of
parameter-dependent nearly incompressible linear elasticity equations | We consider the nearly incompressible linear elasticity problem with an
uncertain spatially varying Young's modulus. The uncertainty is modelled with a
finite set of parameters with prescribed probability distribution. We introduce
a novel three-field mixed variational formulation of the PDE model and discuss
its approximation by stochastic Galerkin mixed finite element techniques.
First, we establish the well posedness of the proposed variational formulation
and the associated finite-dimensional approximation. Second, we focus on the
efficient solution of the associated large and indefinite linear system of
equations. A new preconditioner is introduced for use with the minimal residual
method (MINRES). Eigenvalue bounds for the preconditioned system are
established and shown to be independent of the discretisation parameters and
the Poisson ratio. The S-IFISS software used for computation is available
online.
| math.NA | we consider the nearly incompressible linear elasticity problem with an uncertain spatially varying youngs modulus the uncertainty is modelled with a finite set of parameters with prescribed probability distribution we introduce a novel threefield mixed variational formulation of the pde model and discuss its approximation by stochastic galerkin mixed finite element techniques first we establish the well posedness of the proposed variational formulation and the associated finitedimensional approximation second we focus on the efficient solution of the associated large and indefinite linear system of equations a new preconditioner is introduced for use with the minimal residual method minres eigenvalue bounds for the preconditioned system are established and shown to be independent of the discretisation parameters and the poisson ratio the sifiss software used for computation is available online | [['we', 'consider', 'the', 'nearly', 'incompressible', 'linear', 'elasticity', 'problem', 'with', 'an', 'uncertain', 'spatially', 'varying', 'youngs', 'modulus', 'the', 'uncertainty', 'is', 'modelled', 'with', 'a', 'finite', 'set', 'of', 'parameters', 'with', 'prescribed', 'probability', 'distribution', 'we', 'introduce', 'a', 'novel', 'threefield', 'mixed', 'variational', 'formulation', 'of', 'the', 'pde', 'model', 'and', 'discuss', 'its', 'approximation', 'by', 'stochastic', 'galerkin', 'mixed', 'finite', 'element', 'techniques', 'first', 'we', 'establish', 'the', 'well', 'posedness', 'of', 'the', 'proposed', 'variational', 'formulation', 'and', 'the', 'associated', 'finitedimensional', 'approximation', 'second', 'we', 'focus', 'on', 'the', 'efficient', 'solution', 'of', 'the', 'associated', 'large', 'and', 'indefinite', 'linear', 'system', 'of', 'equations', 'a', 'new', 'preconditioner', 'is', 'introduced', 'for', 'use', 'with', 'the', 'minimal', 'residual', 'method', 'minres', 'eigenvalue', 'bounds', 'for', 'the', 'preconditioned', 'system', 'are', 'established', 'and', 'shown', 'to', 'be', 'independent', 'of', 'the', 'discretisation', 'parameters', 'and', 'the', 'poisson', 'ratio', 'the', 'sifiss', 'software', 'used', 'for', 'computation', 'is', 'available', 'online']] | [-0.10469215192307725, 0.04757415982594394, -0.0642286163395432, 0.03613948994994486, -0.08152345122813474, -0.15899277802586087, -0.005493682721175078, 0.32615170634799, -0.35284424109721746, -0.2709531040466207, 0.14511331688158038, -0.2210275223955336, -0.14353666908298363, 0.15579648068592716, -0.08202324507324443, 0.15580887176549268, 0.08623672852211992, 0.0030696205024820142, -0.11347655179419035, -0.22757363559927526, 0.33133382546004114, 0.030116496094333842, 0.26520011488414247, 0.002477488212844753, 0.18464353048484625, -0.008410642055545266, -0.057499468575899056, 0.04088411186858425, -0.1457492432091385, 0.1540174949799635, 0.2282684772627384, 0.0755835994293773, 0.3063700705268017, -0.40175787935869434, -0.2007307417280092, 0.09980966852552543, 0.0913546096611911, 0.0970063633157131, -0.02415207267177885, -0.2675559599627191, 0.08247842362304549, -0.18044614319608906, -0.17642742877378767, -0.0830722320604864, -0.05884931551835199, 0.046634307743497486, -0.3200131906278974, 0.10775566089341021, 0.02472534145166232, 0.03568093995123691, -0.11804895634363281, -0.1611740725228607, 0.0322557678501173, 0.03781981377928393, 0.011847171904042539, -0.03662349595358287, 0.03628682039355434, -0.06531819356532079, -0.07213772556150523, 0.388510221446769, -0.10499254168253246, -0.3032534579475095, 0.1367642223820325, -0.035327410087077404, -0.11877182797770801, 0.09742236740733166, 0.2072648998555236, 0.16854133793541531, -0.14110564273290746, 0.1269941862015325, -0.04036446368160445, 0.1459053975977297, 0.0064683787902362466, -0.037460500121439304, 0.07555576062607249, 0.19136880652055027, 0.14461579097170882, 0.15759524566902391, -0.0640522559882897, -0.1352119282709332, -0.338873023357917, -0.14723027430797422, -0.1987309996359505, 0.0035725856405191534, -0.1535470405895782, -0.23784673265268563, 0.34691038297665283, 0.10980293331814446, 0.13934526889489626, 0.10399884690244601, 0.286180397733958, 0.21077024113072, 0.004506786328219757, 0.1103970274021189, 0.1991284541486887, 0.21270333393293572, 0.0736849897313775, -0.2561172958892884, 0.06718190743103916, 0.15719921201628845] |
1,803.01573 | Single rare-earth ions as atomic-scale probes in ultra-scaled
transistors | Continued dimensional scaling of semiconductor devices has driven information
technology into vastly diverse applications. As the size of devices approaches
fundamental limits, metrology techniques with nanometre resolution and
three-dimensional (3D) capabilities are desired for device optimisation. For
example, the performance of an ultra-scaled transistor can be strongly
influenced by the local electric field and strain. Here we study the spectral
response of single erbium ions to applied electric field and strain in a
silicon ultra-scaled transistor. Stark shifts induced by both the overall
electric field and the local charge environment are observed. Further, changes
in strain smaller than $3\times 10^{-6}$ are detected, which is around two
orders of magnitude more sensitive than the standard techniques used in the
semiconductor industry. These results open new possibilities for
non-destructive 3D mapping of the local strain and electric field in the
channel of ultra-scaled transistors, using the single erbium ions as
ultra-sensitive atomic probes.
| physics.app-ph cond-mat.mes-hall quant-ph | continued dimensional scaling of semiconductor devices has driven information technology into vastly diverse applications as the size of devices approaches fundamental limits metrology techniques with nanometre resolution and threedimensional 3d capabilities are desired for device optimisation for example the performance of an ultrascaled transistor can be strongly influenced by the local electric field and strain here we study the spectral response of single erbium ions to applied electric field and strain in a silicon ultrascaled transistor stark shifts induced by both the overall electric field and the local charge environment are observed further changes in strain smaller than 3times 106 are detected which is around two orders of magnitude more sensitive than the standard techniques used in the semiconductor industry these results open new possibilities for nondestructive 3d mapping of the local strain and electric field in the channel of ultrascaled transistors using the single erbium ions as ultrasensitive atomic probes | [['continued', 'dimensional', 'scaling', 'of', 'semiconductor', 'devices', 'has', 'driven', 'information', 'technology', 'into', 'vastly', 'diverse', 'applications', 'as', 'the', 'size', 'of', 'devices', 'approaches', 'fundamental', 'limits', 'metrology', 'techniques', 'with', 'nanometre', 'resolution', 'and', 'threedimensional', '3d', 'capabilities', 'are', 'desired', 'for', 'device', 'optimisation', 'for', 'example', 'the', 'performance', 'of', 'an', 'ultrascaled', 'transistor', 'can', 'be', 'strongly', 'influenced', 'by', 'the', 'local', 'electric', 'field', 'and', 'strain', 'here', 'we', 'study', 'the', 'spectral', 'response', 'of', 'single', 'erbium', 'ions', 'to', 'applied', 'electric', 'field', 'and', 'strain', 'in', 'a', 'silicon', 'ultrascaled', 'transistor', 'stark', 'shifts', 'induced', 'by', 'both', 'the', 'overall', 'electric', 'field', 'and', 'the', 'local', 'charge', 'environment', 'are', 'observed', 'further', 'changes', 'in', 'strain', 'smaller', 'than', '3times', '106', 'are', 'detected', 'which', 'is', 'around', 'two', 'orders', 'of', 'magnitude', 'more', 'sensitive', 'than', 'the', 'standard', 'techniques', 'used', 'in', 'the', 'semiconductor', 'industry', 'these', 'results', 'open', 'new', 'possibilities', 'for', 'nondestructive', '3d', 'mapping', 'of', 'the', 'local', 'strain', 'and', 'electric', 'field', 'in', 'the', 'channel', 'of', 'ultrascaled', 'transistors', 'using', 'the', 'single', 'erbium', 'ions', 'as', 'ultrasensitive', 'atomic', 'probes']] | [-0.12354903896601364, 0.1747475658129594, 0.026278248309645036, -0.01489106129965936, 0.016792385132724283, -0.16700879071487595, 0.0173793551912963, 0.4327929081851678, -0.24825805210699606, -0.34261717368534067, 0.05346155537921467, -0.2569680007680362, -0.1037686892741958, 0.2860227008997802, -0.01703454237369611, 0.060691286088121646, -0.020015669977354097, -0.040860426248304105, -0.06899062218144536, -0.18462114829249335, 0.22979329186121605, 0.06364365454935869, 0.3708692221649435, 0.05530024308168533, 0.062138665926994276, -0.012884441789857187, 0.044540054479379525, 0.06174590430894731, -0.11122656208370497, 0.14861753947123313, 0.2478307325073783, -0.005842699367084251, 0.245888758503172, -0.5099473584640697, -0.20798948035492185, 0.02742287770168284, 0.15295880048887323, 0.1293679919018293, -0.0994554910079664, -0.29807235511630426, 0.07104237881159126, -0.13875984165829836, -0.10803138860636267, -0.08755588356562773, 0.002208836885502204, 0.050777738731946576, -0.25169372386514943, 0.04355608819003236, 0.017953686904939297, 0.08505486799342347, -0.08389509036857172, -0.1038487610501231, -0.0011723495307470987, 0.10218711650393755, -0.02010287869943688, 0.04677439397370554, 0.2888435833094432, -0.16929933459973864, -0.1470640403163058, 0.3619781993082817, -0.06581719001906998, -0.12437586095105065, 0.16962692347572597, -0.17084179782240794, -0.038656712673135744, 0.15341496148720285, 0.176210698694286, 0.114359269399714, -0.1580564272744174, 0.08230149359804646, 0.0655749314295017, 0.1904618251006372, 0.06679735016671398, 0.12103038382969353, 0.25070552235709764, 0.2207042410297455, 0.07565870077429426, 0.11300727027423667, -0.1242050852546382, -0.017558488410447312, -0.18024405703528334, -0.1868425933489983, -0.19051363177301472, 0.09147845498758017, -0.11185036063614835, -0.1463362140124602, 0.4054308280854529, 0.18871856482802823, 0.09139783644357956, -0.09424685230494063, 0.3441523038813018, 0.11857589030027735, 0.12781565680495457, -0.01560397060365965, 0.26238035726120434, 0.17155958191084594, 0.12350926579697835, -0.22420067805565572, 0.031898749065554594, -0.033686204485761755] |
1,803.01574 | Loop Effects in Direct Detection | We consider loop level contributions to dark matter scattering off nucleons
in cases where the spin independent scattering cross section is absent or
suppressed at tree level. In the case of a pseudoscalar interaction, for which
the tree level cross section is both spin-dependent and suppressed by 4 powers
of the exchanged momentum, we show that loop diagrams give rise to a non- zero
spin independent cross section. Importantly, if the pseudoscalar interaction is
formulated using a gauge invariant framework, loop effects generate an
effective $\bar{\chi}\chi h$ vertex and result in a scattering cross section
that is within reach of current or forthcoming experiments. We also consider
the case of inelastic dark matter, for which the tree-level direct detection
cross section is negligible when the inelastic $\chi_1 N \to \chi_2 N$ process
is kinematically suppressed. In this case, loop diagrams generate an
interaction with both initial and final $\chi_1$ states and hence permit
measurable, spin independent, $\chi_1 N \to \chi_1 N$ elastic scattering. As
such, we are able to probe parameter space that was previously considered
inaccessible to direct detection
| hep-ph | we consider loop level contributions to dark matter scattering off nucleons in cases where the spin independent scattering cross section is absent or suppressed at tree level in the case of a pseudoscalar interaction for which the tree level cross section is both spindependent and suppressed by 4 powers of the exchanged momentum we show that loop diagrams give rise to a non zero spin independent cross section importantly if the pseudoscalar interaction is formulated using a gauge invariant framework loop effects generate an effective barchichi h vertex and result in a scattering cross section that is within reach of current or forthcoming experiments we also consider the case of inelastic dark matter for which the treelevel direct detection cross section is negligible when the inelastic chi_1 n to chi_2 n process is kinematically suppressed in this case loop diagrams generate an interaction with both initial and final chi_1 states and hence permit measurable spin independent chi_1 n to chi_1 n elastic scattering as such we are able to probe parameter space that was previously considered inaccessible to direct detection | [['we', 'consider', 'loop', 'level', 'contributions', 'to', 'dark', 'matter', 'scattering', 'off', 'nucleons', 'in', 'cases', 'where', 'the', 'spin', 'independent', 'scattering', 'cross', 'section', 'is', 'absent', 'or', 'suppressed', 'at', 'tree', 'level', 'in', 'the', 'case', 'of', 'a', 'pseudoscalar', 'interaction', 'for', 'which', 'the', 'tree', 'level', 'cross', 'section', 'is', 'both', 'spindependent', 'and', 'suppressed', 'by', '4', 'powers', 'of', 'the', 'exchanged', 'momentum', 'we', 'show', 'that', 'loop', 'diagrams', 'give', 'rise', 'to', 'a', 'non', 'zero', 'spin', 'independent', 'cross', 'section', 'importantly', 'if', 'the', 'pseudoscalar', 'interaction', 'is', 'formulated', 'using', 'a', 'gauge', 'invariant', 'framework', 'loop', 'effects', 'generate', 'an', 'effective', 'barchichi', 'h', 'vertex', 'and', 'result', 'in', 'a', 'scattering', 'cross', 'section', 'that', 'is', 'within', 'reach', 'of', 'current', 'or', 'forthcoming', 'experiments', 'we', 'also', 'consider', 'the', 'case', 'of', 'inelastic', 'dark', 'matter', 'for', 'which', 'the', 'treelevel', 'direct', 'detection', 'cross', 'section', 'is', 'negligible', 'when', 'the', 'inelastic', 'chi_1', 'n', 'to', 'chi_2', 'n', 'process', 'is', 'kinematically', 'suppressed', 'in', 'this', 'case', 'loop', 'diagrams', 'generate', 'an', 'interaction', 'with', 'both', 'initial', 'and', 'final', 'chi_1', 'states', 'and', 'hence', 'permit', 'measurable', 'spin', 'independent', 'chi_1', 'n', 'to', 'chi_1', 'n', 'elastic', 'scattering', 'as', 'such', 'we', 'are', 'able', 'to', 'probe', 'parameter', 'space', 'that', 'was', 'previously', 'considered', 'inaccessible', 'to', 'direct', 'detection']] | [-0.14647271707395298, 0.2640711747628908, -0.04247565532827543, 0.11996795762458229, -0.05356960186683055, -0.14629807984973822, 0.021534781825418275, 0.32989831479887166, -0.24487960641143017, -0.2601573888729844, -0.014937881025899616, -0.32773595254143906, -0.061052153810548286, 0.1526738543386778, 0.09438813641900197, 0.018691037703926366, 0.05739330167739859, 0.07783187340117163, 0.0022412596736103296, -0.2567600803009959, 0.3374438190263592, 0.02003733417853558, 0.1972682183860646, 0.1539086091125177, 0.07075459299246883, 0.1169690886990995, -0.017605134868063033, -0.02924501600800795, -0.11508793556838808, 0.02622360186748362, 0.27691902794532425, 0.013645976143703189, 0.07856556571253653, -0.40082739933083456, -0.11124259205664405, 0.1409152602388834, 0.196065415845563, 0.09021755407124551, -0.0069653404837784665, -0.2742876441179154, 0.052605170764339466, -0.20442228579065866, -0.12350117101709152, -0.08086822008093199, 0.045017091634993754, -0.11130794493235752, -0.3103820329428547, 0.08654794011607818, 0.025106500953228937, -0.050552521889201465, -0.008677451152147518, -0.14803030090665237, -0.04343354855793425, 0.040462706251774866, 0.0582773722564323, 0.04735107083736997, 0.17485344921717316, -0.18409115426410508, -0.1276958605610869, 0.34371136465213364, -0.11486226863279525, -0.21553477028177845, 0.12135128814520107, -0.17160224046868583, -0.11215344548561713, 0.186005747747711, 0.18422843785956503, 0.11153212235092522, -0.13176230914129217, 0.14370908454034684, -0.009109032937299668, 0.16388661119983428, 0.10235197706303249, 0.010228527991825508, 0.1898347419841836, 0.16655721762864334, 0.05517159672648025, 0.07249371191590197, -0.0944563245969928, -0.07573065928235236, -0.37994163115767554, -0.1264248390371601, -0.09085101066157222, 0.06364869145521274, -0.0211917899581345, -0.13608256236184388, 0.28871157655020296, 0.09752864774264809, 0.2667873236606182, 0.022419258203202237, 0.34776820213883186, 0.14942990932678285, 0.05834971575532109, 0.03281911555883805, 0.2830645330690054, 0.17827406190723802, 0.038724800346729656, -0.207909175765235, 0.029664784556694537, 0.021726153304593432] |
1,803.01575 | A Comparative Study of Pairwise Learning Methods based on Kernel Ridge
Regression | Many machine learning problems can be formulated as predicting labels for a
pair of objects. Problems of that kind are often referred to as pairwise
learning, dyadic prediction or network inference problems. During the last
decade kernel methods have played a dominant role in pairwise learning. They
still obtain a state-of-the-art predictive performance, but a theoretical
analysis of their behavior has been underexplored in the machine learning
literature.
In this work we review and unify existing kernel-based algorithms that are
commonly used in different pairwise learning settings, ranging from matrix
filtering to zero-shot learning. To this end, we focus on closed-form efficient
instantiations of Kronecker kernel ridge regression. We show that independent
task kernel ridge regression, two-step kernel ridge regression and a linear
matrix filter arise naturally as a special case of Kronecker kernel ridge
regression, implying that all these methods implicitly minimize a squared loss.
In addition, we analyze universality, consistency and spectral filtering
properties. Our theoretical results provide valuable insights in assessing the
advantages and limitations of existing pairwise learning methods.
| stat.ML cs.LG | many machine learning problems can be formulated as predicting labels for a pair of objects problems of that kind are often referred to as pairwise learning dyadic prediction or network inference problems during the last decade kernel methods have played a dominant role in pairwise learning they still obtain a stateoftheart predictive performance but a theoretical analysis of their behavior has been underexplored in the machine learning literature in this work we review and unify existing kernelbased algorithms that are commonly used in different pairwise learning settings ranging from matrix filtering to zeroshot learning to this end we focus on closedform efficient instantiations of kronecker kernel ridge regression we show that independent task kernel ridge regression twostep kernel ridge regression and a linear matrix filter arise naturally as a special case of kronecker kernel ridge regression implying that all these methods implicitly minimize a squared loss in addition we analyze universality consistency and spectral filtering properties our theoretical results provide valuable insights in assessing the advantages and limitations of existing pairwise learning methods | [['many', 'machine', 'learning', 'problems', 'can', 'be', 'formulated', 'as', 'predicting', 'labels', 'for', 'a', 'pair', 'of', 'objects', 'problems', 'of', 'that', 'kind', 'are', 'often', 'referred', 'to', 'as', 'pairwise', 'learning', 'dyadic', 'prediction', 'or', 'network', 'inference', 'problems', 'during', 'the', 'last', 'decade', 'kernel', 'methods', 'have', 'played', 'a', 'dominant', 'role', 'in', 'pairwise', 'learning', 'they', 'still', 'obtain', 'a', 'stateoftheart', 'predictive', 'performance', 'but', 'a', 'theoretical', 'analysis', 'of', 'their', 'behavior', 'has', 'been', 'underexplored', 'in', 'the', 'machine', 'learning', 'literature', 'in', 'this', 'work', 'we', 'review', 'and', 'unify', 'existing', 'kernelbased', 'algorithms', 'that', 'are', 'commonly', 'used', 'in', 'different', 'pairwise', 'learning', 'settings', 'ranging', 'from', 'matrix', 'filtering', 'to', 'zeroshot', 'learning', 'to', 'this', 'end', 'we', 'focus', 'on', 'closedform', 'efficient', 'instantiations', 'of', 'kronecker', 'kernel', 'ridge', 'regression', 'we', 'show', 'that', 'independent', 'task', 'kernel', 'ridge', 'regression', 'twostep', 'kernel', 'ridge', 'regression', 'and', 'a', 'linear', 'matrix', 'filter', 'arise', 'naturally', 'as', 'a', 'special', 'case', 'of', 'kronecker', 'kernel', 'ridge', 'regression', 'implying', 'that', 'all', 'these', 'methods', 'implicitly', 'minimize', 'a', 'squared', 'loss', 'in', 'addition', 'we', 'analyze', 'universality', 'consistency', 'and', 'spectral', 'filtering', 'properties', 'our', 'theoretical', 'results', 'provide', 'valuable', 'insights', 'in', 'assessing', 'the', 'advantages', 'and', 'limitations', 'of', 'existing', 'pairwise', 'learning', 'methods']] | [-0.005055586417808569, -0.03584133303923414, -0.10294952440799639, 0.1348333141397728, -0.14773804084882355, -0.19097666917476436, -0.0012901939944272613, 0.4835778617130517, -0.3058776952127113, -0.26396723109367437, 0.10589518148434884, -0.2597304613186811, -0.21406859613422066, 0.19016869604248401, -0.11758128849983301, 0.14216224692837265, 0.14171430237881968, 0.01378515323861556, -0.10985561979011325, -0.28532704400340086, 0.2933339687626852, 0.03921133416537949, 0.319230914577866, 0.024561082446312457, 0.1201311165515355, 0.01853103473018101, -0.04130088855011787, 0.007743773464452626, -0.0809728654292937, 0.17071497899169275, 0.3957792490430047, 0.18985151381643503, 0.40221259809728993, -0.3766052133559836, -0.2744164471864442, 0.15658060726682746, 0.16701727423472384, 0.06351832712386772, -0.01708593960808364, -0.25344181998439047, 0.03342531049338767, -0.18022979900908437, 0.00567572075076875, -0.14144708442695525, -0.05381205421737853, 0.0020296774963401475, -0.29760740292554644, 0.08374891200808086, 0.11854069630885927, 0.0717904123160019, -0.0006039259643051666, -0.22159400405200746, 0.11017849345185465, 0.11457222718287884, 0.07323074405420722, 0.0008259012439218215, 0.13914126841246413, -0.16609823567297505, -0.18733712929944277, 0.3294587203253039, -0.05005915978697339, -0.20957989641330663, 0.21871720169902364, -0.016340061981833912, -0.19925016530175732, 0.054480294178837554, 0.28209893093202154, 0.10692425252670541, -0.1660114098636358, 0.045992300742052794, -0.05841778583200164, 0.09790524034464808, 0.03564857497725184, 0.013773751070970572, 0.14308787088415914, 0.1982334420257221, 0.037257560083004675, 0.11324705329058811, -0.07853146302890614, -0.1154971293926056, -0.24150573476244605, -0.10643940767531708, -0.2000309461169214, -0.050386851857351735, -0.1400305004598643, -0.19682868946925064, 0.3721942188261303, 0.182347433181275, 0.24653252017162094, 0.09335239640453216, 0.3169259735614578, 0.08066655270825275, 0.08534539669665987, 0.1062637195176165, 0.21300351760630104, 0.11696853504295467, 0.06648272843331615, -0.16182824683031122, 0.11194319596899016, 0.06956610851517389] |
1,803.01576 | Asymptotic Equivalence of Fixed-size and Varying-size Determinantal
Point Processes | Determinantal Point Processes (DPPs) are popular models for point processes
with repulsion. They appear in numerous contexts, from physics to graph theory,
and display appealing theoretical properties. On the more practical side of
things, since DPPs tend to select sets of points that are some distance apart
(repulsion), they have been advocated as a way of producing random subsets with
high diversity. DPPs come in two variants: fixed-size and varying-size. A
sample from a varying-size DPP is a subset of random cardinality, while in
fixed-size "$k$-DPPs" the cardinality is fixed. The latter makes more sense in
many applications, but unfortunately their computational properties are less
attractive, since, among other things, inclusion probabilities are harder to
compute. In this work we show that as the size of the ground set grows,
$k$-DPPs and DPPs become equivalent, meaning that their inclusion probabilities
converge. As a by-product, we obtain saddlepoint formulas for inclusion
probabilities in $k$-DPPs. These turn out to be extremely accurate, and suffer
less from numerical difficulties than exact methods do. Our results also
suggest that $k$-DPPs and DPPs also have equivalent maximum likelihood
estimators. Finally, we obtain results on asymptotic approximations of
elementary symmetric polynomials which may be of independent interest.
| math.ST stat.ML stat.TH | determinantal point processes dpps are popular models for point processes with repulsion they appear in numerous contexts from physics to graph theory and display appealing theoretical properties on the more practical side of things since dpps tend to select sets of points that are some distance apart repulsion they have been advocated as a way of producing random subsets with high diversity dpps come in two variants fixedsize and varyingsize a sample from a varyingsize dpp is a subset of random cardinality while in fixedsize kdpps the cardinality is fixed the latter makes more sense in many applications but unfortunately their computational properties are less attractive since among other things inclusion probabilities are harder to compute in this work we show that as the size of the ground set grows kdpps and dpps become equivalent meaning that their inclusion probabilities converge as a byproduct we obtain saddlepoint formulas for inclusion probabilities in kdpps these turn out to be extremely accurate and suffer less from numerical difficulties than exact methods do our results also suggest that kdpps and dpps also have equivalent maximum likelihood estimators finally we obtain results on asymptotic approximations of elementary symmetric polynomials which may be of independent interest | [['determinantal', 'point', 'processes', 'dpps', 'are', 'popular', 'models', 'for', 'point', 'processes', 'with', 'repulsion', 'they', 'appear', 'in', 'numerous', 'contexts', 'from', 'physics', 'to', 'graph', 'theory', 'and', 'display', 'appealing', 'theoretical', 'properties', 'on', 'the', 'more', 'practical', 'side', 'of', 'things', 'since', 'dpps', 'tend', 'to', 'select', 'sets', 'of', 'points', 'that', 'are', 'some', 'distance', 'apart', 'repulsion', 'they', 'have', 'been', 'advocated', 'as', 'a', 'way', 'of', 'producing', 'random', 'subsets', 'with', 'high', 'diversity', 'dpps', 'come', 'in', 'two', 'variants', 'fixedsize', 'and', 'varyingsize', 'a', 'sample', 'from', 'a', 'varyingsize', 'dpp', 'is', 'a', 'subset', 'of', 'random', 'cardinality', 'while', 'in', 'fixedsize', 'kdpps', 'the', 'cardinality', 'is', 'fixed', 'the', 'latter', 'makes', 'more', 'sense', 'in', 'many', 'applications', 'but', 'unfortunately', 'their', 'computational', 'properties', 'are', 'less', 'attractive', 'since', 'among', 'other', 'things', 'inclusion', 'probabilities', 'are', 'harder', 'to', 'compute', 'in', 'this', 'work', 'we', 'show', 'that', 'as', 'the', 'size', 'of', 'the', 'ground', 'set', 'grows', 'kdpps', 'and', 'dpps', 'become', 'equivalent', 'meaning', 'that', 'their', 'inclusion', 'probabilities', 'converge', 'as', 'a', 'byproduct', 'we', 'obtain', 'saddlepoint', 'formulas', 'for', 'inclusion', 'probabilities', 'in', 'kdpps', 'these', 'turn', 'out', 'to', 'be', 'extremely', 'accurate', 'and', 'suffer', 'less', 'from', 'numerical', 'difficulties', 'than', 'exact', 'methods', 'do', 'our', 'results', 'also', 'suggest', 'that', 'kdpps', 'and', 'dpps', 'also', 'have', 'equivalent', 'maximum', 'likelihood', 'estimators', 'finally', 'we', 'obtain', 'results', 'on', 'asymptotic', 'approximations', 'of', 'elementary', 'symmetric', 'polynomials', 'which', 'may', 'be', 'of', 'independent', 'interest']] | [-0.05314486892430566, 0.08579535889833127, -0.1007012344841192, 0.12711020319117927, -0.10348114346858318, -0.16232010257657414, 0.0860200419724312, 0.4215330812449924, -0.25241709654178907, -0.26189030846117517, 0.09603462015065499, -0.326247169405676, -0.15055848734681518, 0.2229428126005252, -0.061438645916441874, 0.03366552868774578, 0.07134493652601444, 0.030638340364826554, -0.08304489807420369, -0.2682134546416253, 0.28210357500735983, 0.03392509693877577, 0.25625603545957537, 0.001868340851095, 0.04397286127427991, -0.029143532117207844, -0.027953214524082136, 0.0560322041856125, -0.09654578266839672, 0.1180638114676176, 0.3031301373596205, 0.15070779349874858, 0.3072711273110402, -0.39767118305209254, -0.20433308547872364, 0.17300290545588823, 0.1830922329157767, 0.11692532945936314, -0.03538229682935119, -0.23893642270432516, 0.10590590941181073, -0.1418351262109354, -0.1106423727463727, -0.12350135672818963, 0.03932795001295817, 0.07857051949261164, -0.27174205843020993, 0.019099596054675476, 0.08142226447689518, 0.022223884500424142, 0.008913423888042421, -0.21944641791844732, -0.003232842352964095, 0.10082330045276391, 0.07937059510008093, -0.01942371605983495, 0.09759704749370966, -0.12773740077414433, -0.10147011019023071, 0.3720834062142826, 0.03400982843776551, -0.21110840588437385, 0.26549860467295633, -0.10744074539545534, -0.17355605857261452, 0.1599008716105377, 0.16311429842781805, 0.12340166059494093, -0.142831944043294, 0.10009478521272679, -0.059790394297888995, 0.10192034658147671, 0.08219745796433284, 0.12180674204658438, 0.20183039730905894, 0.09602373289593046, 0.10576936299883673, 0.12071221887941394, -0.01677706921635316, -0.1522985439404697, -0.25908729175293344, -0.09452821451245949, -0.18875328702064445, 0.054174633692041854, -0.13221227006246256, -0.20230823211297763, 0.3067601342263877, 0.20637815996520315, 0.22266756364292656, 0.10902518785584125, 0.23644130775213834, 0.10884338226356134, 0.059457266506326586, 0.07967590411548127, 0.18151220826062012, 0.11176460628785524, 0.01311325206217444, -0.09477012623356312, 0.09413839745264621, 0.05718461946069972] |
1,803.01577 | Predicting Out-of-View Feature Points for Model-Based Camera Pose
Estimation | In this work we present a novel framework that uses deep learning to predict
object feature points that are out-of-view in the input image. This system was
developed with the application of model-based tracking in mind, particularly in
the case of autonomous inspection robots, where only partial views of the
object are available. Out-of-view prediction is enabled by applying scaling to
the feature point labels during network training. This is combined with a
recurrent neural network architecture designed to provide the final prediction
layers with rich feature information from across the spatial extent of the
input image. To show the versatility of these out-of-view predictions, we
describe how to integrate them in both a particle filter tracker and an
optimisation based tracker. To evaluate our work we compared our framework with
one that predicts only points inside the image. We show that as the amount of
the object in view decreases, being able to predict outside the image bounds
adds robustness to the final pose estimation.
| cs.CV cs.RO | in this work we present a novel framework that uses deep learning to predict object feature points that are outofview in the input image this system was developed with the application of modelbased tracking in mind particularly in the case of autonomous inspection robots where only partial views of the object are available outofview prediction is enabled by applying scaling to the feature point labels during network training this is combined with a recurrent neural network architecture designed to provide the final prediction layers with rich feature information from across the spatial extent of the input image to show the versatility of these outofview predictions we describe how to integrate them in both a particle filter tracker and an optimisation based tracker to evaluate our work we compared our framework with one that predicts only points inside the image we show that as the amount of the object in view decreases being able to predict outside the image bounds adds robustness to the final pose estimation | [['in', 'this', 'work', 'we', 'present', 'a', 'novel', 'framework', 'that', 'uses', 'deep', 'learning', 'to', 'predict', 'object', 'feature', 'points', 'that', 'are', 'outofview', 'in', 'the', 'input', 'image', 'this', 'system', 'was', 'developed', 'with', 'the', 'application', 'of', 'modelbased', 'tracking', 'in', 'mind', 'particularly', 'in', 'the', 'case', 'of', 'autonomous', 'inspection', 'robots', 'where', 'only', 'partial', 'views', 'of', 'the', 'object', 'are', 'available', 'outofview', 'prediction', 'is', 'enabled', 'by', 'applying', 'scaling', 'to', 'the', 'feature', 'point', 'labels', 'during', 'network', 'training', 'this', 'is', 'combined', 'with', 'a', 'recurrent', 'neural', 'network', 'architecture', 'designed', 'to', 'provide', 'the', 'final', 'prediction', 'layers', 'with', 'rich', 'feature', 'information', 'from', 'across', 'the', 'spatial', 'extent', 'of', 'the', 'input', 'image', 'to', 'show', 'the', 'versatility', 'of', 'these', 'outofview', 'predictions', 'we', 'describe', 'how', 'to', 'integrate', 'them', 'in', 'both', 'a', 'particle', 'filter', 'tracker', 'and', 'an', 'optimisation', 'based', 'tracker', 'to', 'evaluate', 'our', 'work', 'we', 'compared', 'our', 'framework', 'with', 'one', 'that', 'predicts', 'only', 'points', 'inside', 'the', 'image', 'we', 'show', 'that', 'as', 'the', 'amount', 'of', 'the', 'object', 'in', 'view', 'decreases', 'being', 'able', 'to', 'predict', 'outside', 'the', 'image', 'bounds', 'adds', 'robustness', 'to', 'the', 'final', 'pose', 'estimation']] | [-0.030099273756067885, -0.0061117493292753, -0.09597546407000543, 0.013814923763752028, -0.08605957624547363, -0.15550059296964971, 0.022901570915345507, 0.4329884183783847, -0.26330250213820355, -0.3464651018134262, 0.07175930865047253, -0.27201142175268966, -0.18775973490338368, 0.15227968072173667, -0.14749176819606807, 0.0781314612568934, 0.12830271556516212, 0.05706297759410606, -0.055944312095967494, -0.24226443237254777, 0.31555800818759633, 0.05315420819086679, 0.30666448437911736, 0.00033172202038477704, 0.14282633180741267, -0.00556264600470376, -0.04326827717273137, -0.006419826003004718, -0.055727289202209304, 0.17549228105492082, 0.2942940743229105, 0.1753905652959113, 0.2738277295727776, -0.41476326884634523, -0.20697925215676785, 0.05804269389440137, 0.13945720045187746, 0.11746276323318885, -0.04979454768058586, -0.3299862035839112, 0.11632927656398122, -0.154862074203879, -0.05465116626786416, -0.10452629513589733, -0.022517081709152245, -0.017771622098713035, -0.2788623655241204, -0.0030686507472790867, 0.06641592708428906, 0.017916607307214064, -0.07210103207525898, -0.067597472558432, -0.006417927767026676, 0.18531361977423888, 0.03130303914602622, 0.07085373722709692, 0.15853430784702952, -0.19244275712761405, -0.09995410075209227, 0.3470559859625905, -0.048107869040883, -0.20885560660432262, 0.20114131567926785, -0.09822257169864577, -0.13490871903879276, 0.10628031861283872, 0.22703635217537768, 0.09703372412428529, -0.15014256575672202, 0.008353591908866271, -0.03804876400629081, 0.20780853033595276, 0.008352747679328972, -0.013076527291033641, 0.19302948225003455, 0.26193713527509427, 0.049413080762367674, 0.1847200582353735, -0.18107585702529766, -0.07883973216991423, -0.2596103455703032, -0.1329512942066214, -0.17764209014649715, -0.05601704030449177, -0.06722095327008956, -0.1381390369882953, 0.41055340797876017, 0.27288166757852556, 0.27339719976186305, 0.07304424273129974, 0.33215572605896965, 0.0416104939369294, 0.12058385222286255, 0.07851442255932524, 0.24143567954818437, 0.027899900639250158, 0.11713466582629066, -0.16684146095151417, 0.06453984197375016, 0.05856877627939614] |
1,803.01578 | Elliptic flow of hadrons via quark coalescence mechanism using Boltzmann
transport equation for Pb+Pb collision at $\sqrt{s_{NN}}$=2.76 TeV | Elliptic flow of hadrons observed at relativistic heavy-ion collision
experiments at Relativistic Heavy-Ion Collider (RHIC) and Large Hadron Collider
(LHC), provides us an important signature of possible de-confinement transition
from hadronic phase to partonic phase. However, hadronization processes of
de-confined partons back into final hadrons are found to play a vital role in
the observed hadronic flow. In the present work, we use coalescence mechanism
also known as Recombination (ReCo) to combine quarks into hadrons. To get
there, we have used Boltzmann transport equation in relaxation time
approximation to transport the quarks into equilibration and finally to
freeze-out surface, before coalescence takes place. A Boltzmann-Gibbs Blast
Wave (BGBW) function is taken as an equilibrium function to get the final
distribution and a power-like function to describe the initial distributions of
partons produced in heavy-ion collisions. In the present work, we try to
estimate the elliptic flow of identified hadrons such as $\pi$, $K$, $p$ etc.,
produced in Pb+Pb collisions at $\sqrt{s_{\rm NN}}$ = 2.76 TeV at the LHC for
different centralities. The elliptic flow ($v_2$) of identified hadrons seems
to be described quite well in the available $p_{\rm T}$ range. After the
evolution of quarks until freeze-out time, has been calculated using BTE-RTA,
the approach used in this paper consists of combining two or more quarks to
explain the produced hadrons at intermediate momenta regions. The formalism is
found to describe elliptic flow of hadrons produced in Pb+Pb collisions to a
large extent.
| hep-ph hep-ex nucl-ex nucl-th | elliptic flow of hadrons observed at relativistic heavyion collision experiments at relativistic heavyion collider rhic and large hadron collider lhc provides us an important signature of possible deconfinement transition from hadronic phase to partonic phase however hadronization processes of deconfined partons back into final hadrons are found to play a vital role in the observed hadronic flow in the present work we use coalescence mechanism also known as recombination reco to combine quarks into hadrons to get there we have used boltzmann transport equation in relaxation time approximation to transport the quarks into equilibration and finally to freezeout surface before coalescence takes place a boltzmanngibbs blast wave bgbw function is taken as an equilibrium function to get the final distribution and a powerlike function to describe the initial distributions of partons produced in heavyion collisions in the present work we try to estimate the elliptic flow of identified hadrons such as pi k p etc produced in pbpb collisions at sqrts_rm nn 276 tev at the lhc for different centralities the elliptic flow v_2 of identified hadrons seems to be described quite well in the available p_rm t range after the evolution of quarks until freezeout time has been calculated using bterta the approach used in this paper consists of combining two or more quarks to explain the produced hadrons at intermediate momenta regions the formalism is found to describe elliptic flow of hadrons produced in pbpb collisions to a large extent | [['elliptic', 'flow', 'of', 'hadrons', 'observed', 'at', 'relativistic', 'heavyion', 'collision', 'experiments', 'at', 'relativistic', 'heavyion', 'collider', 'rhic', 'and', 'large', 'hadron', 'collider', 'lhc', 'provides', 'us', 'an', 'important', 'signature', 'of', 'possible', 'deconfinement', 'transition', 'from', 'hadronic', 'phase', 'to', 'partonic', 'phase', 'however', 'hadronization', 'processes', 'of', 'deconfined', 'partons', 'back', 'into', 'final', 'hadrons', 'are', 'found', 'to', 'play', 'a', 'vital', 'role', 'in', 'the', 'observed', 'hadronic', 'flow', 'in', 'the', 'present', 'work', 'we', 'use', 'coalescence', 'mechanism', 'also', 'known', 'as', 'recombination', 'reco', 'to', 'combine', 'quarks', 'into', 'hadrons', 'to', 'get', 'there', 'we', 'have', 'used', 'boltzmann', 'transport', 'equation', 'in', 'relaxation', 'time', 'approximation', 'to', 'transport', 'the', 'quarks', 'into', 'equilibration', 'and', 'finally', 'to', 'freezeout', 'surface', 'before', 'coalescence', 'takes', 'place', 'a', 'boltzmanngibbs', 'blast', 'wave', 'bgbw', 'function', 'is', 'taken', 'as', 'an', 'equilibrium', 'function', 'to', 'get', 'the', 'final', 'distribution', 'and', 'a', 'powerlike', 'function', 'to', 'describe', 'the', 'initial', 'distributions', 'of', 'partons', 'produced', 'in', 'heavyion', 'collisions', 'in', 'the', 'present', 'work', 'we', 'try', 'to', 'estimate', 'the', 'elliptic', 'flow', 'of', 'identified', 'hadrons', 'such', 'as', 'pi', 'k', 'p', 'etc', 'produced', 'in', 'pbpb', 'collisions', 'at', 'sqrts_rm', 'nn', '276', 'tev', 'at', 'the', 'lhc', 'for', 'different', 'centralities', 'the', 'elliptic', 'flow', 'v_2', 'of', 'identified', 'hadrons', 'seems', 'to', 'be', 'described', 'quite', 'well', 'in', 'the', 'available', 'p_rm', 't', 'range', 'after', 'the', 'evolution', 'of', 'quarks', 'until', 'freezeout', 'time', 'has', 'been', 'calculated', 'using', 'bterta', 'the', 'approach', 'used', 'in', 'this', 'paper', 'consists', 'of', 'combining', 'two', 'or', 'more', 'quarks', 'to', 'explain', 'the', 'produced', 'hadrons', 'at', 'intermediate', 'momenta', 'regions', 'the', 'formalism', 'is', 'found', 'to', 'describe', 'elliptic', 'flow', 'of', 'hadrons', 'produced', 'in', 'pbpb', 'collisions', 'to', 'a', 'large', 'extent']] | [-0.05256119271000283, 0.2569881374668765, -0.2467957697132471, 0.14570896406377823, -0.010590478140257948, -0.09788079246785879, -0.08736262374791351, 0.34232454644168314, -0.2359459584006939, -0.24387540559272797, -0.07820724289046979, -0.34538612200557817, 0.09663611717007212, 0.11135230211761328, 0.0799990770188682, 0.11885157836740257, 0.12752768693344968, 0.003139884404826492, -0.03854204555785021, -0.21801144963070457, 0.2953413539494608, 0.07348381564082941, 0.18193589196505636, 0.1737397434769577, 0.08803080311924204, 0.03620096025176934, -0.008385168347909614, -0.017585995541383122, -0.14578383633503653, -0.002641030510571588, 0.32219733215416335, 0.04825038509346792, 0.1436411195021138, -0.4129228477764303, -0.18283287562909092, 0.12347423271672159, 0.20372843855404568, 0.10753349147648145, -0.055608658229507585, -0.2307207391025398, 0.0983546438058877, -0.24012093732512219, -0.15972843976436316, -0.07492081273764495, 0.011215141757982649, -0.020937942407534486, -0.27934124793024556, 0.10597718649636084, -0.01623532621632427, 0.047945288527772384, -0.013103914358247365, -0.19324344028602838, -0.08036693223728895, 0.03736257551458212, 0.11230732989980534, 0.1235729042743526, 0.1699438021301883, -0.15480267964119934, -0.13099195619202625, 0.44674511889335833, 0.008184951363678217, -0.09558692540687459, 0.1924804586190653, -0.19900029865615224, -0.14138982329842215, 0.1736582546606969, 0.30851929496850095, 0.09607496280300419, -0.2082907887276154, -0.000828018305451016, 0.008228350465567068, 0.1270881537744134, 0.11191965226389282, 0.036652968411963756, 0.19216556846129387, 0.1933127151941301, -0.03299563236271816, 0.1312888013049226, -0.0672084010820604, -0.11549001281788279, -0.39652470534829676, -0.08071421132570858, -0.1426251357657008, 0.06879686872085751, -0.048110466662814155, -0.07492004877489632, 0.36708462463413594, 0.11225969402440263, 0.30577666880524257, -0.05073380731316708, 0.265395852257942, 0.08251767430147272, 0.021868467939818562, 0.14678246438292172, 0.27233024012452933, 0.15132592423409377, 0.2595334405009925, -0.2524033657601683, 0.05917971390512042, 0.12327168948360993] |
1,803.01579 | Motion and Cooperative Transportation Planning for Multi-Agent Systems
under Temporal Logic Formulas | This paper presents a hybrid control framework for the motion planning of a
multi-agent system including N robotic agents and M objects, under high level
goals expressed as Linear Temporal Logic (LTL) formulas. In particular, we
design control protocols that allow the transition of the agents as well as the
cooperative transportation of the objects by the agents, among predefined
regions of interest in the workspace. This allows to abstract the coupled
behavior of the agents and the objects as a finite transition system and to
design a high-level multi-agent plan that satisfies the agents' and the
objects' specifications, given as temporal logic formulas. Simulation results
verify the proposed framework.
| cs.SY cs.RO | this paper presents a hybrid control framework for the motion planning of a multiagent system including n robotic agents and m objects under high level goals expressed as linear temporal logic ltl formulas in particular we design control protocols that allow the transition of the agents as well as the cooperative transportation of the objects by the agents among predefined regions of interest in the workspace this allows to abstract the coupled behavior of the agents and the objects as a finite transition system and to design a highlevel multiagent plan that satisfies the agents and the objects specifications given as temporal logic formulas simulation results verify the proposed framework | [['this', 'paper', 'presents', 'a', 'hybrid', 'control', 'framework', 'for', 'the', 'motion', 'planning', 'of', 'a', 'multiagent', 'system', 'including', 'n', 'robotic', 'agents', 'and', 'm', 'objects', 'under', 'high', 'level', 'goals', 'expressed', 'as', 'linear', 'temporal', 'logic', 'ltl', 'formulas', 'in', 'particular', 'we', 'design', 'control', 'protocols', 'that', 'allow', 'the', 'transition', 'of', 'the', 'agents', 'as', 'well', 'as', 'the', 'cooperative', 'transportation', 'of', 'the', 'objects', 'by', 'the', 'agents', 'among', 'predefined', 'regions', 'of', 'interest', 'in', 'the', 'workspace', 'this', 'allows', 'to', 'abstract', 'the', 'coupled', 'behavior', 'of', 'the', 'agents', 'and', 'the', 'objects', 'as', 'a', 'finite', 'transition', 'system', 'and', 'to', 'design', 'a', 'highlevel', 'multiagent', 'plan', 'that', 'satisfies', 'the', 'agents', 'and', 'the', 'objects', 'specifications', 'given', 'as', 'temporal', 'logic', 'formulas', 'simulation', 'results', 'verify', 'the', 'proposed', 'framework']] | [-0.15302252098917962, 0.045323154275220906, -0.06455218795348297, 0.02448461198972919, -0.10158126311038028, -0.14174079581756482, 0.06300695163557644, 0.3865719857858494, -0.2609584518538957, -0.3448733737184243, 0.07506539694837887, -0.20779747799136783, -0.1616737183712592, 0.13852157793642783, -0.13682615215842486, 0.12164478177120062, 0.04409060505726798, 0.0509895742807368, 0.009440974315459079, -0.18933577096110887, 0.2867430301129141, 0.01124736395960843, 0.24843976015902378, -0.03120141532748345, 0.19638888620432804, 0.06409875474531543, 0.06945194393735041, 0.052601232718337665, -0.10595418223754016, 0.14847022937187418, 0.3784308109432459, 0.19972336969592355, 0.3198254381221804, -0.4304442616348917, -0.17068200233942746, 0.07395927449264987, 0.1151819536547092, 0.054986672188070684, 0.01847966519099745, -0.35119351294230333, 0.0617264808494259, -0.21076667275787755, -0.104703430513936, -0.08440311150096187, 0.004123079268769784, 0.09380074969429353, -0.27756764008240264, -0.06675803424282507, 0.12328478437954221, 0.07577885821969672, -0.10920135839471848, -0.04882634965575893, 0.008097794713367792, 0.20242964972487903, -0.027372315238145265, -0.04353227776088964, 0.17754157873886553, -0.1451283485205336, -0.20699194878001104, 0.41930630850521, 0.009945119098252193, -0.19747852136656133, 0.1862585908521644, -0.0804770049977709, -0.1536094193621962, 0.07967248054390604, 0.21968598010187798, 0.1798767299433662, -0.1811487945135344, 0.06441089100924066, -0.029786102058873935, 0.1976130150343207, 0.016089248771525243, 0.059825591239231556, 0.19093457588777793, 0.2372748620786958, 0.12428324752995236, 0.16003748112654484, 0.0046788287497210234, -0.15780191904949872, -0.32064740166745404, -0.14514447614889253, -0.10694986556402662, -0.05990993499078534, -0.0918172444338614, -0.1194913483669304, 0.363845368728719, 0.1737116547978737, 0.15127112199975687, 0.15285744256424633, 0.3244246080433103, 0.08930284368107096, 0.05469178582795642, 0.04763059223240072, 0.16107992631044576, 0.07267440916250714, 0.1676544117995284, -0.23612378239208323, 0.12354051321956583, 0.029170606094835835] |
1,803.0158 | Calculated attributes of synonym sets | The goal of formalization, proposed in this paper, is to bring together, as
near as possible, the theoretic linguistic problem of synonym conception and
the computer linguistic methods based generally on empirical intuitive
unjustified factors. Using the word vector representation we have proposed the
geometric approach to mathematical modeling of synonym set (synset). The word
embedding is based on the neural networks (Skip-gram, CBOW), developed and
realized as word2vec program by T. Mikolov. The standard cosine similarity is
used as the distance between word-vectors. Several geometric characteristics of
the synset words are introduced: the interior of synset, the synset word rank
and centrality. These notions are intended to select the most significant
synset words, i.e. the words which senses are the nearest to the sense of a
synset. Some experiments with proposed notions, based on RusVectores resources,
are represented. A brief description of this work can be viewed in slides
https://goo.gl/K82Fei
| cs.CL cs.IR | the goal of formalization proposed in this paper is to bring together as near as possible the theoretic linguistic problem of synonym conception and the computer linguistic methods based generally on empirical intuitive unjustified factors using the word vector representation we have proposed the geometric approach to mathematical modeling of synonym set synset the word embedding is based on the neural networks skipgram cbow developed and realized as word2vec program by t mikolov the standard cosine similarity is used as the distance between wordvectors several geometric characteristics of the synset words are introduced the interior of synset the synset word rank and centrality these notions are intended to select the most significant synset words ie the words which senses are the nearest to the sense of a synset some experiments with proposed notions based on rusvectores resources are represented a brief description of this work can be viewed in slides httpsgooglk82fei | [['the', 'goal', 'of', 'formalization', 'proposed', 'in', 'this', 'paper', 'is', 'to', 'bring', 'together', 'as', 'near', 'as', 'possible', 'the', 'theoretic', 'linguistic', 'problem', 'of', 'synonym', 'conception', 'and', 'the', 'computer', 'linguistic', 'methods', 'based', 'generally', 'on', 'empirical', 'intuitive', 'unjustified', 'factors', 'using', 'the', 'word', 'vector', 'representation', 'we', 'have', 'proposed', 'the', 'geometric', 'approach', 'to', 'mathematical', 'modeling', 'of', 'synonym', 'set', 'synset', 'the', 'word', 'embedding', 'is', 'based', 'on', 'the', 'neural', 'networks', 'skipgram', 'cbow', 'developed', 'and', 'realized', 'as', 'word2vec', 'program', 'by', 't', 'mikolov', 'the', 'standard', 'cosine', 'similarity', 'is', 'used', 'as', 'the', 'distance', 'between', 'wordvectors', 'several', 'geometric', 'characteristics', 'of', 'the', 'synset', 'words', 'are', 'introduced', 'the', 'interior', 'of', 'synset', 'the', 'synset', 'word', 'rank', 'and', 'centrality', 'these', 'notions', 'are', 'intended', 'to', 'select', 'the', 'most', 'significant', 'synset', 'words', 'ie', 'the', 'words', 'which', 'senses', 'are', 'the', 'nearest', 'to', 'the', 'sense', 'of', 'a', 'synset', 'some', 'experiments', 'with', 'proposed', 'notions', 'based', 'on', 'rusvectores', 'resources', 'are', 'represented', 'a', 'brief', 'description', 'of', 'this', 'work', 'can', 'be', 'viewed', 'in', 'slides', 'httpsgooglk82fei']] | [-0.02219868998899556, 0.028196921993997072, -0.09478126910371368, 0.1008243990207291, -0.17082976101391367, -0.12727569248652298, 0.06042386483222921, 0.40059477825892853, -0.322591148439526, -0.29164519088792823, 0.04315870020994854, -0.3031211202595408, -0.18050842369662834, 0.17535413807881495, -0.13911988142637174, 0.07452983117659245, 0.056189125650656105, 0.13263034981819208, -0.06454157611728652, -0.2699643486966973, 0.339879352613446, 0.04819885411318517, 0.3145983692714882, -0.0024244775667461574, 0.1307617337911721, -0.03018942656583034, -0.10114937467538071, 0.022520847824845938, -0.09504904236250726, 0.2123499029529306, 0.3223156428711501, 0.23096110928341146, 0.32340237140755523, -0.3813769463637231, -0.20149875743214615, 0.07166713609941454, 0.108610628320423, 0.053301221937184916, 0.00329166651006488, -0.3528255647698405, 0.09884498891851946, -0.16842666496491474, 0.02443342870913896, -0.0996995520717058, 0.010850892553024695, 0.037607579788930666, -0.19757004455825777, 0.009922740285616093, 0.12301884139200435, 0.093875824309723, -0.014760714485278766, -0.16093202812547153, 0.021601738994191058, 0.13482102955497752, 0.06168200688017845, 0.07211443446201567, 0.09858751949860446, -0.08525299976873618, -0.20144759742746243, 0.4061085372044386, -0.058240351767197954, -0.2495555156379338, 0.20610156912128472, -0.01176536124162126, -0.11600732277053714, 0.014614902249218634, 0.17377884515979947, 0.07416946411889903, -0.1575324695007313, 0.04291362883722341, -0.09085014450595083, 0.17426758308913684, 0.11586936882809555, 0.040229142299734504, 0.1788546008451673, 0.20738559158756428, -0.02426663159092751, 0.1055127874871516, -0.06685983143815608, -0.08237197263605404, -0.25455218437596555, -0.13563257064545314, -0.20225418963463315, -0.0555443302821993, -0.10099731039089048, -0.18011913299185517, 0.4014736071233669, 0.19120481418095678, 0.20099250304093896, 0.07943234464931834, 0.27768000583601926, 0.049564296688400865, 0.08942445230063976, 0.06868436134064057, 0.13847431401513524, 0.0935159433311189, 0.0824397366693956, -0.1306579283129224, 0.11741449671091149, 0.17964836018659633] |
1,803.01581 | Efficiency and timing performance of the MuPix7 high-voltage monolithic
active pixel sensor | The MuPix7 is a prototype high voltage monolithic active pixel sensor with
103 times 80 um2 pixels thinned to 64 um and incorporating the complete
read-out circuitry including a 1.25 Gbit/s differential data link. Using data
taken at the DESY electron test beam, we demonstrate an efficiency of 99.3% and
a time resolution of 14 ns. The efficiency and time resolution are studied with
sub-pixel resolution and reproduced in simulations.
| physics.ins-det hep-ex | the mupix7 is a prototype high voltage monolithic active pixel sensor with 103 times 80 um2 pixels thinned to 64 um and incorporating the complete readout circuitry including a 125 gbits differential data link using data taken at the desy electron test beam we demonstrate an efficiency of 993 and a time resolution of 14 ns the efficiency and time resolution are studied with subpixel resolution and reproduced in simulations | [['the', 'mupix7', 'is', 'a', 'prototype', 'high', 'voltage', 'monolithic', 'active', 'pixel', 'sensor', 'with', '103', 'times', '80', 'um2', 'pixels', 'thinned', 'to', '64', 'um', 'and', 'incorporating', 'the', 'complete', 'readout', 'circuitry', 'including', 'a', '125', 'gbits', 'differential', 'data', 'link', 'using', 'data', 'taken', 'at', 'the', 'desy', 'electron', 'test', 'beam', 'we', 'demonstrate', 'an', 'efficiency', 'of', '993', 'and', 'a', 'time', 'resolution', 'of', '14', 'ns', 'the', 'efficiency', 'and', 'time', 'resolution', 'are', 'studied', 'with', 'subpixel', 'resolution', 'and', 'reproduced', 'in', 'simulations']] | [-0.09812253354383367, 0.06406698221128733, 0.03822605312369498, -0.02440570109091433, 0.045557986851781605, -0.17378543333948723, 0.0515410962880456, 0.45739200743181363, -0.17080952235098396, -0.45527190398424866, 0.12654655163143097, -0.3105609769001603, 0.06385597277299634, 0.19913462113722094, -0.08208117450787021, 0.10739799795140113, 0.0933567564801446, -0.05625868088432721, -0.06459351647645235, -0.22355700781336055, 0.1215278498495796, 0.18339666092236126, 0.2967989986496312, 0.019253383896180563, 0.253848794917576, -0.02948488699538367, -0.0673448379018477, -0.029409142743263925, -0.08935929309310657, 0.020349042496777006, 0.26260968051252087, 0.053780378294842585, 0.19977550645624953, -0.45077730010296885, -0.14158602913043328, -0.015251930204353161, 0.08259416863189212, -0.00519903874290841, -0.07522828513756394, -0.28448042189702394, 0.15729104517293827, -0.16873035144859128, -0.09549773658758827, 0.01914291496255568, -0.002904199404396682, 0.026866858851696762, -0.26247016245366206, 0.06136371152741568, -0.02131371398988579, 0.08710250916358615, -0.003752883936145476, -0.11102241237780877, -0.008926791291950004, 0.05840639601935566, -0.1263654708496428, 0.05081819287900414, 0.21263487764102007, -0.10385600393638014, -0.11498549298516342, 0.32189140412956474, -0.03155460343030947, -0.10913957026121872, 0.14484233598091772, -0.21535658302849958, -0.019505752363641347, 0.25394520203449894, 0.15559793716030462, 0.08347998401815337, -0.15835062502218145, 0.007536871182466192, 0.05475522785314492, 0.3021611492282578, 0.12273073743895761, 0.04699491551145911, 0.17101825205609203, 0.3287468279578856, 8.206417052341359e-05, 0.07732732105734093, -0.30943168784890857, 0.004470150864550045, -0.27063514506444336, -0.13875670335920795, -0.1487857788269009, 0.060052994811641315, -0.12345511487468944, -0.013691117847338318, 0.4051191922809396, 0.12371627677764212, 0.22600802426459268, 0.05022467553748616, 0.33789979336517195, 0.0796507232955524, 0.1364448076346889, 0.006678731087595225, 0.2092236685167466, 0.1288611363885658, 0.19420211112924984, -0.18592946504774902, -0.09168555653387947, -0.060015630964854995] |
1,803.01582 | Degree Associated Edge Reconstruction Parameters of Strong Double Brooms | An edge deleted unlabeled subgraph of a graph G is an ecard. A da-ecard
specifies the degree of the deleted edge along with the ecard. The degree
associated edge reconstruction number of a graph G, dern(G), is the size of the
smallest collection of da-ecards of G that uniquely determines G. The adversary
degree associated edge reconstruction number of a graph G, adern(G), is the
minimum number k such that every collection of k da-ecards of G uniquely
determines G. A strong double broom is the graph on at least 5 vertices
obtained from a union of (at least two) internally vertex disjoint paths with
same ends u and v by appending leaves at u and v. In particular, B(n, n,mPk) is
the strong double broom with n leaves at both the ends u and v and with m
internally vertex disjoint paths of order k joining u and v. We show that dern
of strong double brooms is 1 or 2. We also determine adern(B(n, n,mPk)). It is
3 in most of the cases and 1 or 2 for all the remaining cases, except
adern(B(1, 1, 2Pk)) = 5 for k > 3.
| math.CO | an edge deleted unlabeled subgraph of a graph g is an ecard a daecard specifies the degree of the deleted edge along with the ecard the degree associated edge reconstruction number of a graph g derng is the size of the smallest collection of daecards of g that uniquely determines g the adversary degree associated edge reconstruction number of a graph g aderng is the minimum number k such that every collection of k daecards of g uniquely determines g a strong double broom is the graph on at least 5 vertices obtained from a union of at least two internally vertex disjoint paths with same ends u and v by appending leaves at u and v in particular bn nmpk is the strong double broom with n leaves at both the ends u and v and with m internally vertex disjoint paths of order k joining u and v we show that dern of strong double brooms is 1 or 2 we also determine adernbn nmpk it is 3 in most of the cases and 1 or 2 for all the remaining cases except adernb1 1 2pk 5 for k 3 | [['an', 'edge', 'deleted', 'unlabeled', 'subgraph', 'of', 'a', 'graph', 'g', 'is', 'an', 'ecard', 'a', 'daecard', 'specifies', 'the', 'degree', 'of', 'the', 'deleted', 'edge', 'along', 'with', 'the', 'ecard', 'the', 'degree', 'associated', 'edge', 'reconstruction', 'number', 'of', 'a', 'graph', 'g', 'derng', 'is', 'the', 'size', 'of', 'the', 'smallest', 'collection', 'of', 'daecards', 'of', 'g', 'that', 'uniquely', 'determines', 'g', 'the', 'adversary', 'degree', 'associated', 'edge', 'reconstruction', 'number', 'of', 'a', 'graph', 'g', 'aderng', 'is', 'the', 'minimum', 'number', 'k', 'such', 'that', 'every', 'collection', 'of', 'k', 'daecards', 'of', 'g', 'uniquely', 'determines', 'g', 'a', 'strong', 'double', 'broom', 'is', 'the', 'graph', 'on', 'at', 'least', '5', 'vertices', 'obtained', 'from', 'a', 'union', 'of', 'at', 'least', 'two', 'internally', 'vertex', 'disjoint', 'paths', 'with', 'same', 'ends', 'u', 'and', 'v', 'by', 'appending', 'leaves', 'at', 'u', 'and', 'v', 'in', 'particular', 'bn', 'nmpk', 'is', 'the', 'strong', 'double', 'broom', 'with', 'n', 'leaves', 'at', 'both', 'the', 'ends', 'u', 'and', 'v', 'and', 'with', 'm', 'internally', 'vertex', 'disjoint', 'paths', 'of', 'order', 'k', 'joining', 'u', 'and', 'v', 'we', 'show', 'that', 'dern', 'of', 'strong', 'double', 'brooms', 'is', '1', 'or', '2', 'we', 'also', 'determine', 'adernbn', 'nmpk', 'it', 'is', '3', 'in', 'most', 'of', 'the', 'cases', 'and', '1', 'or', '2', 'for', 'all', 'the', 'remaining', 'cases', 'except', 'adernb1', '1', '2pk', '5', 'for', 'k', '3']] | [-0.21250293030828724, 0.14939969013911372, 0.01260953164993502, -0.054892335449593425, -0.05472015070415143, -0.1703658554824474, 0.0717417425045784, 0.3695794082659236, -0.3088851338587752, -0.31906790106111893, 0.057526802936437256, -0.3725199641092964, -0.08243322286263878, 0.0885418378558192, -0.038570120978756284, -0.044912711536871146, 0.10858662883022233, 0.17076521149694757, 0.017525893295659564, -0.2601723970444215, 0.30281741856149735, -0.07597666626553172, 0.14099629793781787, 0.0515048169586605, 0.09087138045477965, 0.056872333240513086, 0.0034531288458864487, 0.0895861294533184, -0.15343544987955166, 0.06963191578751834, 0.21169085864676163, 0.14454826207213994, 0.2614073550155255, -0.3462644228830354, -0.1347155624193281, 0.16037043878342325, 0.09331514025309487, -0.0037593709585844013, 0.03793359145145033, -0.18466052343517178, 0.19906185647920685, -0.08993585503483938, -0.1236143127240686, 0.06689623109338319, 0.1484320523146459, 0.0023909128250797157, -0.28446208342464396, -0.03089290212997382, 0.08958903863347824, 0.03424032699600186, 0.07967711938924724, -0.18792012611242093, -0.1171708537781935, 0.13043412199476734, -0.06621814857150995, 0.13816807477016244, 0.03058914138407841, -0.15299776455503888, -0.10332344640451281, 0.36180866472220613, -0.06492739070887657, -0.10021869994305076, 0.15380608949034585, -0.16991111129644434, -0.13113031379686182, 0.16681208911367043, 0.07252879715119691, 0.12599654466359186, -0.08148120593978092, 0.16067921616511582, -0.07643517951794859, 0.11357855160325847, 0.1207833910036994, -0.01580564408188524, 0.1510865523925294, 0.11848537530307152, 0.1739864263518425, 0.12386617308568573, -0.06437012108242766, 0.10252987059167303, -0.36594021306170715, -0.1112772933189737, -0.227883393912318, 0.07215535121656064, -0.16510949694787522, -0.16063189795291374, 0.4114106060942109, 0.04673645014269784, 0.2544129790140964, 0.03787269847184096, 0.21104616467820722, 0.07252867309706863, 0.04617898168963502, 0.18926607385409347, 0.09104484792054712, 0.15263573842188952, -0.07500457260302147, -0.1913082178507466, 0.03479558396224013, 0.0950774674344322] |
1,803.01583 | A topological interpretation about $m_{G, N}$ for finite group $G$ with
normal subgroup $N$ | Let $G$ be a finite group and $N\unlhd G$. In this note, we construct a class
poset of $G$ for some cyclic subgroup $C$ of $G$. And we find a relation
between $m_{G,N}$ and the Euler characteristic of some nerve spaces of these
posets(see Main Theorem).
| math.GR | let g be a finite group and nunlhd g in this note we construct a class poset of g for some cyclic subgroup c of g and we find a relation between m_gn and the euler characteristic of some nerve spaces of these posetssee main theorem | [['let', 'g', 'be', 'a', 'finite', 'group', 'and', 'nunlhd', 'g', 'in', 'this', 'note', 'we', 'construct', 'a', 'class', 'poset', 'of', 'g', 'for', 'some', 'cyclic', 'subgroup', 'c', 'of', 'g', 'and', 'we', 'find', 'a', 'relation', 'between', 'm_gn', 'and', 'the', 'euler', 'characteristic', 'of', 'some', 'nerve', 'spaces', 'of', 'these', 'posetssee', 'main', 'theorem']] | [-0.22561904980631714, 0.11163938947191293, -0.1299885784445161, 0.03698200439050032, -0.1257816723293879, -0.11307877775239335, 0.033482055899433115, 0.38547419841316616, -0.3602517028762536, -0.24862294593317943, 0.06371978979653002, -0.20276393588441846, -0.153026140591299, 0.21493602279489013, -0.16635870476337997, -0.10813010458580473, 0.05698936085470698, 0.11623856543817303, -0.07477469541217116, -0.22204261298545383, 0.3891673558814959, -0.15351344048130242, 0.1638893513855609, 0.04691323595629497, 0.09566226565617729, -0.027048844759437172, -0.02397448372688483, 0.041899267430628905, -0.21541691886853764, 0.10610093366862698, 0.30299113191325555, 0.06262372389689765, 0.27383639925921505, -0.31260438466613943, -0.15095049255019563, 0.2834758904593235, 0.08573646214790642, -0.02313266419382258, -0.013794107849455693, -0.23830260979858311, 0.1793672386768528, -0.1973704652522098, -0.1463197817687284, 0.006610328162258322, 0.17054314610802315, 0.04252213925461878, -0.23515364434570074, -0.0438360776223073, 0.12092036804692312, 0.1431634115393866, 0.011855148509229448, -0.11046154085885394, -0.06602529795120725, 0.08428423008246516, -0.03666911159896038, 0.105241490453905, 0.016789447706700725, -0.05197969628815455, -0.06822954316157848, 0.42223745821551845, -0.11263913436877457, -0.16250387943794273, 0.09565434698015451, -0.20192874047312548, -0.19497293779965152, 0.05408998805267567, 0.10998044125947425, 0.18213214170695705, 0.006518848388540474, 0.15782035825461868, -0.15450841120698236, 0.04999451602766798, 0.07068748674778776, -0.016949496464803815, 0.1192794545468959, 0.10104490307540717, 0.07463525354184887, 0.14969600350013934, 0.025202528965151447, 0.14856330177942503, -0.4370038180866025, -0.19632755414667455, -0.10702187932011756, 0.15713157183067364, -0.14229528540222833, -0.1856237679127265, 0.41349080636758695, 0.07862796544478359, 0.1361268073828383, 0.1745012749346312, 0.12614258207296106, 0.02998571616428142, -0.001789670318513262, 0.10467753895897079, 0.020869420699785802, 0.29875911882316525, -0.12887563482350248, -0.19871890436942605, -0.031582217261364516, 0.2312576066893102] |
1,803.01584 | The endomorphism ring of projectives and the Bernstein centre | Let $F$ be a local non-archimedean field and $\mathcal{O}_F$ its ring of
integers. Let $\Omega$ be a Bernstein component of the category of smooth
representations of $GL_n(F)$, let $(J, \lambda)$ be a Bushnell-Kutzko
$\Omega$-type, and let $\mathfrak{Z}_{\Omega}$ be the centre of the Bernstein
component $\Omega$. This paper contains two major results. Let $\sigma$ be a
direct summand of $\mathrm{Ind}_J^{GL_n(\mathcal{O}_F)} \lambda$. We will begin
by computing $\mathrm{c\text{--} Ind}_{GL_n(\mathcal{O}_F)}^{GL_n(F)}
\sigma\otimes_{\mathfrak{Z}_{\Omega}}\kappa(\mathfrak{m})$, where
$\kappa(\mathfrak{m})$ is the residue field at maximal ideal $\mathfrak{m}$ of
$\mathfrak{Z}_{\Omega}$, and the maximal ideal $\mathfrak{m}$ belongs to a
Zariski-dense set in $\mathrm{Spec}\: \mathfrak{Z}_{\Omega}$. This result
allows us to deduce that the endomorphism ring
$\mathrm{End}_{GL_n(F)}(\mathrm{c\text{--} Ind}_{GL_n(\mathcal{O}_F)}^{GL_n(F)}
\sigma)$ is isomorphic to $\mathfrak{Z}_{\Omega}$, when $\sigma$ appears with
multiplicity one in $\mathrm{Ind}_J^{GL_n(\mathcal{O}_F)} \lambda$.
| math.NT math.RT | let f be a local nonarchimedean field and mathcalo_f its ring of integers let omega be a bernstein component of the category of smooth representations of gl_nf let j lambda be a bushnellkutzko omegatype and let mathfrakz_omega be the centre of the bernstein component omega this paper contains two major results let sigma be a direct summand of mathrmind_jgl_nmathcalo_f lambda we will begin by computing mathrmctext ind_gl_nmathcalo_fgl_nf sigmaotimes_mathfrakz_omegakappamathfrakm where kappamathfrakm is the residue field at maximal ideal mathfrakm of mathfrakz_omega and the maximal ideal mathfrakm belongs to a zariskidense set in mathrmspec mathfrakz_omega this result allows us to deduce that the endomorphism ring mathrmend_gl_nfmathrmctext ind_gl_nmathcalo_fgl_nf sigma is isomorphic to mathfrakz_omega when sigma appears with multiplicity one in mathrmind_jgl_nmathcalo_f lambda | [['let', 'f', 'be', 'a', 'local', 'nonarchimedean', 'field', 'and', 'mathcalo_f', 'its', 'ring', 'of', 'integers', 'let', 'omega', 'be', 'a', 'bernstein', 'component', 'of', 'the', 'category', 'of', 'smooth', 'representations', 'of', 'gl_nf', 'let', 'j', 'lambda', 'be', 'a', 'bushnellkutzko', 'omegatype', 'and', 'let', 'mathfrakz_omega', 'be', 'the', 'centre', 'of', 'the', 'bernstein', 'component', 'omega', 'this', 'paper', 'contains', 'two', 'major', 'results', 'let', 'sigma', 'be', 'a', 'direct', 'summand', 'of', 'mathrmind_jgl_nmathcalo_f', 'lambda', 'we', 'will', 'begin', 'by', 'computing', 'mathrmctext', 'ind_gl_nmathcalo_fgl_nf', 'sigmaotimes_mathfrakz_omegakappamathfrakm', 'where', 'kappamathfrakm', 'is', 'the', 'residue', 'field', 'at', 'maximal', 'ideal', 'mathfrakm', 'of', 'mathfrakz_omega', 'and', 'the', 'maximal', 'ideal', 'mathfrakm', 'belongs', 'to', 'a', 'zariskidense', 'set', 'in', 'mathrmspec', 'mathfrakz_omega', 'this', 'result', 'allows', 'us', 'to', 'deduce', 'that', 'the', 'endomorphism', 'ring', 'mathrmend_gl_nfmathrmctext', 'ind_gl_nmathcalo_fgl_nf', 'sigma', 'is', 'isomorphic', 'to', 'mathfrakz_omega', 'when', 'sigma', 'appears', 'with', 'multiplicity', 'one', 'in', 'mathrmind_jgl_nmathcalo_f', 'lambda']] | [-0.2114958235981396, 0.07828605356405967, -0.13145923401808013, -0.04173848548272692, -0.1279561721619118, -0.17204556113260017, -0.07330315424494345, 0.27939577142263317, -0.36868675407190044, -0.13930725915407813, 0.045675918484014366, -0.27235976220876806, -0.013300858194696473, 0.1724842074935467, -0.09907857906744555, -0.12461288969361785, 0.023963732435158244, 0.15885935055914227, -0.020747875691987237, -0.22134613184056975, 0.363419373158936, -0.0477388339821954, 0.1321720026681506, 0.02527772827568959, 0.059591013055110165, 0.0027840154891548394, 0.03114880332387648, 0.018107492103333678, -0.20916513599139935, 0.12531595277916724, 0.3536411130649818, 0.10829655283659294, 0.28276111305531887, -0.32698052591300225, -0.09415395730720447, 0.29961206607084284, 0.16473099733765767, -0.08624922052059356, 0.04064475893654424, -0.2642332401938384, 0.19321930038465843, -0.1903879809705121, -0.2019525166214989, -0.024423828771833942, 0.14606868094494063, 0.004944274843191133, -0.36283789185790327, 0.0061140110917328565, 0.09042748946985985, 0.1375191861780377, -0.02798954462622049, -0.12282626224715296, -0.06402891892142729, 0.010461102826321532, -0.06013771037881573, 0.1739279932503983, 0.10006311359324467, -0.07753169805683019, -0.091128890629153, 0.39040216978068826, -0.13229975389182433, -0.20367126559696017, 0.10374477183916145, -0.24096384876657295, -0.07943859967394723, 0.12801706441887864, 0.06064482292512784, 0.11668966712874805, -0.01719538239735443, 0.2674256289143929, -0.14893177056764798, 0.10128597360521739, 0.06234509035575766, -0.02896288573859377, 0.19115453884047498, 0.05511255415685072, 0.09409721541430315, 0.1289826822498612, -0.017571243667253503, 0.09157120959564775, -0.36337285915070827, -0.1732375365472189, -0.14672714300025758, 0.2102047754493584, -0.08601415481013015, -0.11907539579614594, 0.3741779148679327, 0.05636945848462281, 0.1881833531424982, 0.07788996572337777, 0.17981896921153273, 0.09646461886337535, 0.05367930999931854, 0.06585156798600282, 0.0458573368419935, 0.2665148900070874, -0.07095376579174856, -0.15548974868992493, -0.02280115489302589, 0.1437997739460017] |
1,803.01585 | Atomic Clocks for Geodesy | We review experimental progress on optical atomic clocks and frequency
transfer, and consider the prospects of using these technologies for geodetic
measurements. Today, optical atomic frequency standards have reached relative
frequency inaccuracies below 10-17, opening new fields of fundamental and
applied research. The dependence of atomic frequencies on the gravitational
potential makes atomic clocks ideal candidates for the search for deviations in
the predictions of Einstein's general relativity, tests of modern unifying
theories and the development of new gravity field sensors. In this review, we
introduce the concepts of optical atomic clocks and present the status of
international clock development and comparison. Besides further improvement in
stability and accuracy of today's best clocks, a large effort is put into
increasing the reliability and technological readiness for applications outside
of specialized laboratories with compact, portable devices. With relative
frequency uncertainties of 10-18, comparisons of optical frequency standards
are foreseen to contribute together with satellite and terrestrial data to the
precise determination of fundamental height reference systems in geodesy with a
resolution at the cm-level. The long-term stability of atomic standards will
deliver excellent long-term height references for geodetic measurements and for
the modelling and understanding of our Earth.
| physics.atom-ph physics.geo-ph quant-ph | we review experimental progress on optical atomic clocks and frequency transfer and consider the prospects of using these technologies for geodetic measurements today optical atomic frequency standards have reached relative frequency inaccuracies below 1017 opening new fields of fundamental and applied research the dependence of atomic frequencies on the gravitational potential makes atomic clocks ideal candidates for the search for deviations in the predictions of einsteins general relativity tests of modern unifying theories and the development of new gravity field sensors in this review we introduce the concepts of optical atomic clocks and present the status of international clock development and comparison besides further improvement in stability and accuracy of todays best clocks a large effort is put into increasing the reliability and technological readiness for applications outside of specialized laboratories with compact portable devices with relative frequency uncertainties of 1018 comparisons of optical frequency standards are foreseen to contribute together with satellite and terrestrial data to the precise determination of fundamental height reference systems in geodesy with a resolution at the cmlevel the longterm stability of atomic standards will deliver excellent longterm height references for geodetic measurements and for the modelling and understanding of our earth | [['we', 'review', 'experimental', 'progress', 'on', 'optical', 'atomic', 'clocks', 'and', 'frequency', 'transfer', 'and', 'consider', 'the', 'prospects', 'of', 'using', 'these', 'technologies', 'for', 'geodetic', 'measurements', 'today', 'optical', 'atomic', 'frequency', 'standards', 'have', 'reached', 'relative', 'frequency', 'inaccuracies', 'below', '1017', 'opening', 'new', 'fields', 'of', 'fundamental', 'and', 'applied', 'research', 'the', 'dependence', 'of', 'atomic', 'frequencies', 'on', 'the', 'gravitational', 'potential', 'makes', 'atomic', 'clocks', 'ideal', 'candidates', 'for', 'the', 'search', 'for', 'deviations', 'in', 'the', 'predictions', 'of', 'einsteins', 'general', 'relativity', 'tests', 'of', 'modern', 'unifying', 'theories', 'and', 'the', 'development', 'of', 'new', 'gravity', 'field', 'sensors', 'in', 'this', 'review', 'we', 'introduce', 'the', 'concepts', 'of', 'optical', 'atomic', 'clocks', 'and', 'present', 'the', 'status', 'of', 'international', 'clock', 'development', 'and', 'comparison', 'besides', 'further', 'improvement', 'in', 'stability', 'and', 'accuracy', 'of', 'todays', 'best', 'clocks', 'a', 'large', 'effort', 'is', 'put', 'into', 'increasing', 'the', 'reliability', 'and', 'technological', 'readiness', 'for', 'applications', 'outside', 'of', 'specialized', 'laboratories', 'with', 'compact', 'portable', 'devices', 'with', 'relative', 'frequency', 'uncertainties', 'of', '1018', 'comparisons', 'of', 'optical', 'frequency', 'standards', 'are', 'foreseen', 'to', 'contribute', 'together', 'with', 'satellite', 'and', 'terrestrial', 'data', 'to', 'the', 'precise', 'determination', 'of', 'fundamental', 'height', 'reference', 'systems', 'in', 'geodesy', 'with', 'a', 'resolution', 'at', 'the', 'cmlevel', 'the', 'longterm', 'stability', 'of', 'atomic', 'standards', 'will', 'deliver', 'excellent', 'longterm', 'height', 'references', 'for', 'geodetic', 'measurements', 'and', 'for', 'the', 'modelling', 'and', 'understanding', 'of', 'our', 'earth']] | [-0.13120997840713539, 0.12844602587079715, -0.007066677578873838, 0.008119285328852647, -0.054589422976924346, -0.10489747640653159, 0.08515798709908415, 0.37622343478157055, -0.20450977218304264, -0.3435763940687863, 0.11673391601165312, -0.2528361864269801, -0.04656611079217743, 0.28019461557529113, -0.061103048980198235, 0.0815980307483658, 0.08152225564782352, 0.0004396752199054067, -0.07407655092198544, -0.1825603840986106, 0.23048449490162623, 0.15491494792158986, 0.3097290184991765, 0.034926977608976936, 0.07420062253752198, -0.01773943298060192, -0.0983588385164057, -0.019185594236360022, -0.1387633213024057, 0.19132805492452387, 0.2973989087207477, 0.1415187283597832, 0.26532164112981504, -0.4488187903717992, -0.19233337753608368, 0.055735823588426874, 0.07672145617369393, 0.11535976552829941, -0.06587593274919061, -0.2913904984760557, 0.008517548363587257, -0.16847233663355637, -0.1737208641222105, -0.07629607768190391, 0.08475877963411882, 0.09647608647208075, -0.19840571106066407, 0.020900957679037987, -0.01743827567949624, 0.15931799848975264, -0.10427753195300436, -0.11985861459335662, 0.07482052097442149, 0.15499313213734836, 0.0001648378819652696, 0.032911082774608726, 0.15126971996431876, -0.12215710396235478, -0.14077618994707536, 0.4560796228440734, -0.10428029294911687, -0.10250259866597614, 0.20810474767668768, -0.1760672349790064, -0.13699057663857067, 0.04489816026385403, 0.18973717314715918, 0.02594905360578205, -0.1210126836215699, 0.0653819796729119, 0.08621844485269736, 0.19259058222024544, 0.11112657966456248, 0.13545531020080198, 0.2942153072589772, 0.22234731040384412, 0.06455221725982345, 0.018582996945393268, -0.10215723289881223, -0.05137168931559693, -0.279309096812332, -0.1419682674178485, -0.10901502014709835, 0.035927270534377415, -0.06007324611133752, -0.10855272581781908, 0.3657029754408933, 0.21140081649717077, 0.0828377340735896, 0.002773353446459369, 0.3613915379882464, 0.04598075103813659, 0.07512272715682003, -0.010543505030064867, 0.3330991499901272, 0.1421464705700291, 0.1435922603063796, -0.20394581996689215, 0.023140790014229903, -0.004561941787071034] |
1,803.01586 | Tetrahedron Equation and Quantum $R$ Matrices for $q$-Oscillator
Representations Mixing Particles and Holes | We construct $2^n+1$ solutions to the Yang-Baxter equation associated with
the quantum affine algebras $U_q\big(A^{(1)}_{n-1}\big)$,
$U_q\big(A^{(2)}_{2n}\big)$, $U_q\big(C^{(1)}_n\big)$ and
$U_q\big(D^{(2)}_{n+1}\big)$. They act on the Fock spaces of arbitrary mixture
of particles and holes in general. Our method is based on new reductions of the
tetrahedron equation and an embedding of the quantum affine algebras into $n$
copies of the $q$-oscillator algebra which admits an automorphism interchanging
particles and holes.
| nlin.SI math-ph math.MP math.QA | we construct 2n1 solutions to the yangbaxter equation associated with the quantum affine algebras u_qbiga1_n1big u_qbiga2_2nbig u_qbigc1_nbig and u_qbigd2_n1big they act on the fock spaces of arbitrary mixture of particles and holes in general our method is based on new reductions of the tetrahedron equation and an embedding of the quantum affine algebras into n copies of the qoscillator algebra which admits an automorphism interchanging particles and holes | [['we', 'construct', '2n1', 'solutions', 'to', 'the', 'yangbaxter', 'equation', 'associated', 'with', 'the', 'quantum', 'affine', 'algebras', 'u_qbiga1_n1big', 'u_qbiga2_2nbig', 'u_qbigc1_nbig', 'and', 'u_qbigd2_n1big', 'they', 'act', 'on', 'the', 'fock', 'spaces', 'of', 'arbitrary', 'mixture', 'of', 'particles', 'and', 'holes', 'in', 'general', 'our', 'method', 'is', 'based', 'on', 'new', 'reductions', 'of', 'the', 'tetrahedron', 'equation', 'and', 'an', 'embedding', 'of', 'the', 'quantum', 'affine', 'algebras', 'into', 'n', 'copies', 'of', 'the', 'qoscillator', 'algebra', 'which', 'admits', 'an', 'automorphism', 'interchanging', 'particles', 'and', 'holes']] | [-0.1340256484982092, 0.13606045418828216, -0.07336125926667592, 0.027687095609508106, -0.0945589728653431, -0.1591931325092446, -0.05229670201515546, 0.3029013288614806, -0.30825219154939987, -0.2228156375931576, 0.10217329852275725, -0.32535590062616393, -0.13055536917454447, 0.16327811310475226, -0.09350658554467373, 0.002174915309296921, 0.0417746092134621, 0.09896533077699132, -0.1288471073294204, -0.30068531245342456, 0.42475836629455443, -0.015535363108938327, 0.24165980494581163, -0.038485046388814226, 0.22853011186089134, 0.04040727189567406, 0.017466252204030752, -0.04038263941765763, -0.16432967703440227, 0.12964216667751316, 0.2312416544809821, 0.07367501869157422, 0.14989903988316655, -0.44269683156744577, -0.11500894353230251, 0.15090238499396946, 0.19384790104231797, 0.10146999455719197, -0.0537295346330211, -0.3384926100989105, -0.01211655986844562, -0.1801018053884036, -0.1515673296089517, -0.06257715862011537, 0.039356136781862006, -0.021560686072916724, -0.23251788402558304, 0.024379402057093102, 0.11394576347083785, -0.004125384453800507, -0.14955841728806263, -0.0908007236339472, -0.07405973328786786, 0.06942068291391479, -0.07982911803628667, 0.009754120517754927, 0.09373828758543823, -0.090134569152724, -0.20673126787005458, 0.3620927623123862, 0.022365356897353195, -0.3105610569473356, 0.1311071656855347, -0.12235434606554918, -0.15629711926158052, 0.09347732676542364, 0.11611948347854195, 0.12880937084264588, -0.04746966340462677, 0.20248820487540797, -0.08919656361103989, 0.08904494009766495, 0.07907825817528646, 0.03735436314036633, 0.16966526261967374, 0.08334952105724369, 0.05199358760728501, 0.16414083415293135, 0.06535250962679129, -0.12057548357824999, -0.3465121474582702, -0.2311880267880042, -0.12756856906344183, 0.12691955752961803, -0.18954839729030937, -0.2186235028784722, 0.35726553009590134, 0.06997322010283824, 0.14240146677184384, 0.06347289736913808, 0.1777334671120343, 0.11316594374693523, 0.09787496138596907, 0.07533022836287273, 0.11647828311834019, 0.24478478186938446, -0.03964705322869122, -0.19686061591346515, -0.08977276635778253, 0.21963448155293008] |
1,803.01587 | Beyond the Melnikov method II: multidimensional setting | We present a Melnikov type approach for establishing transversal
intersections of stable/unstable manifolds of perturbed normally hyperbolic
invariant manifolds. We do not need to know the explicit formulas for the
homoclinic orbits prior to the perturbation. We also do not need to compute any
integrals along such homoclinics. All needed bounds are established using
rigorous computer assisted numerics. Lastly, and most importantly, the method
establishes intersections for an explicit range of parameters, and not only for
perturbations that are `small enough', as is the case in the classical Melnikov
approach.
| math.DS | we present a melnikov type approach for establishing transversal intersections of stableunstable manifolds of perturbed normally hyperbolic invariant manifolds we do not need to know the explicit formulas for the homoclinic orbits prior to the perturbation we also do not need to compute any integrals along such homoclinics all needed bounds are established using rigorous computer assisted numerics lastly and most importantly the method establishes intersections for an explicit range of parameters and not only for perturbations that are small enough as is the case in the classical melnikov approach | [['we', 'present', 'a', 'melnikov', 'type', 'approach', 'for', 'establishing', 'transversal', 'intersections', 'of', 'stableunstable', 'manifolds', 'of', 'perturbed', 'normally', 'hyperbolic', 'invariant', 'manifolds', 'we', 'do', 'not', 'need', 'to', 'know', 'the', 'explicit', 'formulas', 'for', 'the', 'homoclinic', 'orbits', 'prior', 'to', 'the', 'perturbation', 'we', 'also', 'do', 'not', 'need', 'to', 'compute', 'any', 'integrals', 'along', 'such', 'homoclinics', 'all', 'needed', 'bounds', 'are', 'established', 'using', 'rigorous', 'computer', 'assisted', 'numerics', 'lastly', 'and', 'most', 'importantly', 'the', 'method', 'establishes', 'intersections', 'for', 'an', 'explicit', 'range', 'of', 'parameters', 'and', 'not', 'only', 'for', 'perturbations', 'that', 'are', 'small', 'enough', 'as', 'is', 'the', 'case', 'in', 'the', 'classical', 'melnikov', 'approach']] | [-0.18975959529893266, 0.0677423828296014, -0.09130118245051967, 0.13647125063903837, -0.13515279624261894, -0.15573193105455074, 0.02536626165577521, 0.3572497637528512, -0.21484189518960192, -0.2657321000678672, 0.1337178397613267, -0.24338302320490282, -0.19256249706571302, 0.25591935077940836, -0.09725947694565143, 0.10266272419054683, 0.07976632004396783, 0.04900720445051168, -0.0856692691721643, -0.23892185321698586, 0.3520074753077804, -0.02590654750044147, 0.19047537799924613, 0.07468801964488295, 0.05747189606643385, 0.011353479170550903, -0.010704761681457361, -0.008245643476645153, -0.18276044522297322, 0.0995402000973829, 0.2694071365965, 0.08180903732880122, 0.21434994974535787, -0.44588605734623143, -0.19095010275228155, 0.1646840641482009, 0.20581784362439065, 0.1770629898024102, -0.010073885807974471, -0.23647261659045601, 0.12545892276490728, -0.13118310181113582, -0.208775534780903, -0.18459547424895895, 0.024282504526329123, 0.03549112593237724, -0.274045624382173, 0.04037111294682189, 0.1318153779850238, 0.09798639978075194, -0.05720339695560849, -0.052695767765140365, -0.034777780037580266, 0.16141946105183, 0.023838083029517697, -0.0200706011770914, 0.08907303567458358, -0.04497138381832176, -0.08027709489688277, 0.33312499770480725, -0.04693084015679132, -0.27912634801533487, 0.18373778590466827, -0.1303982050778965, -0.15665266901875535, 0.12560948588264484, 0.11279965824602793, 0.18904550845941737, -0.12825642705817397, 0.10291672754489506, -0.01536046416990252, 0.10408553034067154, 0.08427460604450769, -0.012972041943834887, 0.12844844941670697, 0.031105750263668595, 0.14002074117565322, 0.07054509330126975, -0.03567805961809224, -0.12180282132596605, -0.3691978697147634, -0.13649264296723737, -0.16774545456412146, 0.05739322594777655, -0.06704520441611142, -0.2056431184613353, 0.34748170762840247, 0.12670553051025812, 0.1697351053978006, 0.12875920375809075, 0.29176934173123703, 0.09568644662892135, 0.04176093656052318, 0.1250875520054251, 0.2517424455119504, 0.14111082317928472, 0.04924216109017531, -0.1307566363364458, 0.03121719218066169, 0.12479203553456399] |
1,803.01588 | N-body Networks: a Covariant Hierarchical Neural Network Architecture
for Learning Atomic Potentials | We describe N-body networks, a neural network architecture for learning the
behavior and properties of complex many body physical systems. Our specific
application is to learn atomic potential energy surfaces for use in molecular
dynamics simulations. Our architecture is novel in that (a) it is based on a
hierarchical decomposition of the many body system into subsytems, (b) the
activations of the network correspond to the internal state of each subsystem,
(c) the "neurons" in the network are constructed explicitly so as to guarantee
that each of the activations is covariant to rotations, (d) the neurons operate
entirely in Fourier space, and the nonlinearities are realized by tensor
products followed by Clebsch-Gordan decompositions. As part of the description
of our network, we give a characterization of what way the weights of the
network may interact with the activations so as to ensure that the covariance
property is maintained.
| cs.LG cs.AI | we describe nbody networks a neural network architecture for learning the behavior and properties of complex many body physical systems our specific application is to learn atomic potential energy surfaces for use in molecular dynamics simulations our architecture is novel in that a it is based on a hierarchical decomposition of the many body system into subsytems b the activations of the network correspond to the internal state of each subsystem c the neurons in the network are constructed explicitly so as to guarantee that each of the activations is covariant to rotations d the neurons operate entirely in fourier space and the nonlinearities are realized by tensor products followed by clebschgordan decompositions as part of the description of our network we give a characterization of what way the weights of the network may interact with the activations so as to ensure that the covariance property is maintained | [['we', 'describe', 'nbody', 'networks', 'a', 'neural', 'network', 'architecture', 'for', 'learning', 'the', 'behavior', 'and', 'properties', 'of', 'complex', 'many', 'body', 'physical', 'systems', 'our', 'specific', 'application', 'is', 'to', 'learn', 'atomic', 'potential', 'energy', 'surfaces', 'for', 'use', 'in', 'molecular', 'dynamics', 'simulations', 'our', 'architecture', 'is', 'novel', 'in', 'that', 'a', 'it', 'is', 'based', 'on', 'a', 'hierarchical', 'decomposition', 'of', 'the', 'many', 'body', 'system', 'into', 'subsytems', 'b', 'the', 'activations', 'of', 'the', 'network', 'correspond', 'to', 'the', 'internal', 'state', 'of', 'each', 'subsystem', 'c', 'the', 'neurons', 'in', 'the', 'network', 'are', 'constructed', 'explicitly', 'so', 'as', 'to', 'guarantee', 'that', 'each', 'of', 'the', 'activations', 'is', 'covariant', 'to', 'rotations', 'd', 'the', 'neurons', 'operate', 'entirely', 'in', 'fourier', 'space', 'and', 'the', 'nonlinearities', 'are', 'realized', 'by', 'tensor', 'products', 'followed', 'by', 'clebschgordan', 'decompositions', 'as', 'part', 'of', 'the', 'description', 'of', 'our', 'network', 'we', 'give', 'a', 'characterization', 'of', 'what', 'way', 'the', 'weights', 'of', 'the', 'network', 'may', 'interact', 'with', 'the', 'activations', 'so', 'as', 'to', 'ensure', 'that', 'the', 'covariance', 'property', 'is', 'maintained']] | [-0.12821473561328006, 0.07127252854784397, -0.08090067853698053, 0.013345771480974666, -0.06305109670486402, -0.11857471052192252, 0.0036411703567372986, 0.40321255656513005, -0.3128996421236897, -0.2636641045100987, 0.08571594935288099, -0.22439674483738034, -0.22497976867079333, 0.1491635117327442, -0.049982552044565566, 0.05387029068771045, 0.08316788916803293, 0.06691273414007565, -0.03778598201618454, -0.24072445946670062, 0.3342695899647535, 0.04095943455231955, 0.250745044703394, -0.026417125356257766, 0.1271574055629301, -0.03168378016798178, 0.009602391986944084, -0.021885292936309957, -0.05247478110544074, 0.16210264124753382, 0.24594583724172334, 0.15736540667932933, 0.2794781210832298, -0.4594352354257795, -0.2309853808806479, 0.08263760798522649, 0.12079329330574821, 0.09870002762339003, 0.02680050060892402, -0.268066357261174, 0.0883907105315892, -0.1731878070513139, -0.07625851958260141, -0.14770539987020548, 0.002716970239841455, 0.034558248767515995, -0.27720658079330884, 0.020943960615408583, 0.07290026004380165, 0.022102230695718143, -0.06707930406933096, -0.08730744471776651, -0.05494412313360167, 0.17182340498500806, -0.02257336547906586, 0.034348547608100785, 0.17512323807868352, -0.1450974183468576, -0.09887314886381736, 0.3616020352000723, -0.02934756417872032, -0.24271229329846195, 0.18899817012464376, -0.09458931237836746, -0.14455355405555786, 0.08904925283875216, 0.19721723068505526, 0.07155471118922169, -0.16424027974780248, 0.05614353334641311, -0.055342084331739996, 0.14955928148324224, 0.03712456883403246, 0.046386966233242406, 0.17667816863930155, 0.20150344453852725, 0.050321482454672, 0.14130824051696705, -0.057687705667450316, -0.0793868960542101, -0.2895618725593227, -0.14802549743861262, -0.22379466516242638, 0.023400590069138923, -0.08358199736461314, -0.16246446759907632, 0.4313554069486673, 0.11659498419858455, 0.248086711401639, 0.08109607860427098, 0.28313887013575517, 0.06053496195896957, 0.15043412047914997, 0.08294909420687505, 0.21829989660103377, 0.13408283548542876, 0.10142640843106485, -0.18974021981773911, 0.06974873746229285, 0.07603897918267427] |
1,803.01589 | Autophoretic motion in three dimensions | Janus particles with the ability to move phoretically in self-generated
chemical concentration gradients are model systems for active matter. Their
motion typically consists of straight paths with rotational diffusion being the
dominant reorientation mechanism. In this paper, we show theoretically that by
a suitable surface coverage of both activity and mobility, translational and
rotational motion can be induced arbitrarily in three dimensions. The resulting
trajectories are in general helical, and their pitch and radius can be
controlled by adjusting the angle between the translational and angular
velocity. Building on the classical mathematical framework for axisymmetric
self-phoretic motion under fixed-flux chemical boundary condition, we first
show how to calculate the most general three-dimensional motion for an
arbitrary surface coverage of a spherical particle. After illustrating our
results on surface distributions, we next introduce a simple intuitive patch
model to serve as a guide for designing arbitrary phoretic spheres.
| cond-mat.soft physics.flu-dyn | janus particles with the ability to move phoretically in selfgenerated chemical concentration gradients are model systems for active matter their motion typically consists of straight paths with rotational diffusion being the dominant reorientation mechanism in this paper we show theoretically that by a suitable surface coverage of both activity and mobility translational and rotational motion can be induced arbitrarily in three dimensions the resulting trajectories are in general helical and their pitch and radius can be controlled by adjusting the angle between the translational and angular velocity building on the classical mathematical framework for axisymmetric selfphoretic motion under fixedflux chemical boundary condition we first show how to calculate the most general threedimensional motion for an arbitrary surface coverage of a spherical particle after illustrating our results on surface distributions we next introduce a simple intuitive patch model to serve as a guide for designing arbitrary phoretic spheres | [['janus', 'particles', 'with', 'the', 'ability', 'to', 'move', 'phoretically', 'in', 'selfgenerated', 'chemical', 'concentration', 'gradients', 'are', 'model', 'systems', 'for', 'active', 'matter', 'their', 'motion', 'typically', 'consists', 'of', 'straight', 'paths', 'with', 'rotational', 'diffusion', 'being', 'the', 'dominant', 'reorientation', 'mechanism', 'in', 'this', 'paper', 'we', 'show', 'theoretically', 'that', 'by', 'a', 'suitable', 'surface', 'coverage', 'of', 'both', 'activity', 'and', 'mobility', 'translational', 'and', 'rotational', 'motion', 'can', 'be', 'induced', 'arbitrarily', 'in', 'three', 'dimensions', 'the', 'resulting', 'trajectories', 'are', 'in', 'general', 'helical', 'and', 'their', 'pitch', 'and', 'radius', 'can', 'be', 'controlled', 'by', 'adjusting', 'the', 'angle', 'between', 'the', 'translational', 'and', 'angular', 'velocity', 'building', 'on', 'the', 'classical', 'mathematical', 'framework', 'for', 'axisymmetric', 'selfphoretic', 'motion', 'under', 'fixedflux', 'chemical', 'boundary', 'condition', 'we', 'first', 'show', 'how', 'to', 'calculate', 'the', 'most', 'general', 'threedimensional', 'motion', 'for', 'an', 'arbitrary', 'surface', 'coverage', 'of', 'a', 'spherical', 'particle', 'after', 'illustrating', 'our', 'results', 'on', 'surface', 'distributions', 'we', 'next', 'introduce', 'a', 'simple', 'intuitive', 'patch', 'model', 'to', 'serve', 'as', 'a', 'guide', 'for', 'designing', 'arbitrary', 'phoretic', 'spheres']] | [-0.11144577328766352, 0.1936665859962662, -0.06890252681946611, 0.021064883837163807, -0.07187815678101798, -0.1283363239610032, -0.016133896064823367, 0.43103637279024065, -0.2619894622316367, -0.33163328505797335, 0.04455678099973689, -0.19867817980033178, -0.15341398951737847, 0.17328077082263868, -0.052243716664746254, 0.03711222064895045, 0.019720769503268683, -0.0038936683766173886, -0.026724853729892983, -0.15843101495586667, 0.260771487693652, 0.04047469097294858, 0.2690851003416393, 0.035400797869318025, 0.10457585507378697, 0.018610502749502864, 0.021567126796245957, 0.07567193301407339, -0.1669390675612691, 0.12405143707252286, 0.16512461097541023, 0.025252365653900658, 0.20611514986416146, -0.46307772436268524, -0.23711404270071484, 0.05655935304941074, 0.15899952106841214, 0.16462244469933976, -0.0799914267430822, -0.2821027394543619, 0.060751050627752115, -0.13671749017730814, -0.19372465205697775, -0.09207571770562088, 0.05562665054817008, 0.05863724000216143, -0.2566305954680676, 0.09017131210317554, 0.07696948181965375, 0.08460331446019141, -0.10969890369587157, -0.05795720288026057, -0.06749757169426916, 0.14472036791984502, 0.046342867201717236, 0.005893086438858244, 0.19536698172953337, -0.1293825381985636, -0.08676957774090849, 0.4091751523417969, -0.05388590039315391, -0.2959487367523451, 0.21923006370692347, -0.13752456460856155, -0.06996940463551715, 0.14359458945755374, 0.2135736465658227, 0.13971383351679534, -0.1585879070103832, 0.03331109789664194, -0.003730999305844307, 0.12024217407451943, 0.08969093567041093, -0.03336567630630931, 0.28239721288802483, 0.16001966497254852, 0.083780545224627, 0.12285738433743125, -0.1360040057166671, -0.11692969095956994, -0.29324646114869274, -0.17207761557313472, -0.1549771037845783, 0.00463418541029606, -0.0945339968442169, -0.13253732222732004, 0.36308070824621885, 0.11390922252728272, 0.2071015881310689, 0.0653668567203368, 0.28712241008737416, 0.05919817928543748, 0.014941517056335937, 0.07448039028621342, 0.23317483355839774, 0.09691685693791417, 0.07500551179791354, -0.24168773441358585, 0.05632395782086947, 0.07064415298702119] |
1,803.0159 | Enumeration on row-increasing tableaux of shape $2 \times n$ | Recently O. Pechenik studied the cyclic sieving of increasing tableaux of
shape $2\times n$, and obtained a polynomial on the major index of these
tableaux, which is a $q$-analogue of refined small Schr\"{o}der numbers. We
define row-increasing tableaux and study the major index and amajor index of
row-increasing tableaux of shape $2 \times n$. The resulting polynomials are
both $q$-analogues of refined large Schr\"{o}der numbers. For both results we
give bijective proofs.
| math.CO | recently o pechenik studied the cyclic sieving of increasing tableaux of shape 2times n and obtained a polynomial on the major index of these tableaux which is a qanalogue of refined small schroder numbers we define rowincreasing tableaux and study the major index and amajor index of rowincreasing tableaux of shape 2 times n the resulting polynomials are both qanalogues of refined large schroder numbers for both results we give bijective proofs | [['recently', 'o', 'pechenik', 'studied', 'the', 'cyclic', 'sieving', 'of', 'increasing', 'tableaux', 'of', 'shape', '2times', 'n', 'and', 'obtained', 'a', 'polynomial', 'on', 'the', 'major', 'index', 'of', 'these', 'tableaux', 'which', 'is', 'a', 'qanalogue', 'of', 'refined', 'small', 'schroder', 'numbers', 'we', 'define', 'rowincreasing', 'tableaux', 'and', 'study', 'the', 'major', 'index', 'and', 'amajor', 'index', 'of', 'rowincreasing', 'tableaux', 'of', 'shape', '2', 'times', 'n', 'the', 'resulting', 'polynomials', 'are', 'both', 'qanalogues', 'of', 'refined', 'large', 'schroder', 'numbers', 'for', 'both', 'results', 'we', 'give', 'bijective', 'proofs']] | [-0.16949056678340244, 0.15666069311049322, -0.04197092879347611, 0.1054281439865008, -0.053031373256142586, -0.1354917026617551, 0.050475052618624075, 0.3157453978488195, -0.2814003947744335, -0.364744010631103, 0.05900435461460248, -0.23560323954924292, -0.15647928678916526, 0.1636793562008635, -0.16886849882270116, 0.024751945236778778, 0.02919322383198617, -0.01448029878994693, -0.09641114456336135, -0.26298529765420203, 0.27643803299229214, -0.011375330543766419, 0.19280585911178935, -0.0009614913791849993, 0.04403565714702658, 0.013630226456081036, -0.10488277881581715, -0.024274295114952583, -0.19380319189361256, 0.15205270788915778, 0.18908135609134383, 0.1402251225815195, 0.16626263561024182, -0.38051498856773414, 0.002647652513469043, 0.16058648028073536, 0.22194270619218223, 0.0022079608305289908, -0.08033079919371539, -0.24147087767504263, 0.05921947057156459, -0.17372620898042468, -0.1507772756335528, -0.024166450785149052, 0.1652544172534692, 0.12518419184641022, -0.27903542810700077, -0.009512418098207832, 0.11328529042826183, 0.1388572157509085, 0.03352649706294355, -0.27347825159845146, 0.019228332034865583, 0.0666376278884169, 0.010800468354094504, -0.009477841431625944, 0.004904642856369416, -0.12432129077100451, -0.17828428036654773, 0.3239025110783784, 0.04064525623360406, -0.17886926417333493, 0.08868725576262543, -0.18954504636602235, -0.22328496972044956, 0.12167760592115962, 0.06917492035722388, 0.15932439632065917, 0.02006252189639254, 0.09843668176714952, -0.1972339661400495, 0.13108743014542953, 0.227983345216869, -0.026272868599229747, 0.13893196748002715, 0.04497078992763831, -0.02202609111217485, 0.21993646000349976, -0.031742351234256144, -0.07243941061576639, -0.25525610733345366, -0.1848839281288826, -0.14514680557033938, 0.052942465896299785, -0.222513552889459, -0.2391096616325819, 0.37686595164131426, 0.04822000857456115, 0.19629662247725588, 0.18267575332361774, 0.13342953330931673, 0.11065011613232933, 0.07839016841076639, -0.07057830044135883, 0.04617696983631754, 0.2576346940266481, 0.05161575169262031, -0.15425754131317354, 0.020550317083741877, 0.24020715454674285] |
1,803.01591 | Global generalized characteristics for the Dirichlet problem for
Hamilton-Jacobi equations at a supercritical energy level | We study the nonhomogeneous Dirichlet problem for first order Hamilton-Jacobi
equations associated with Tonelli Hamiltonians on a bounded domain $\Omega$ of
$\R^n$ assuming the energy level to be supercritical. First, we show that the
viscosity (weak KAM) solution of such a problem is Lipschitz continuous and
locally semiconcave in $\Omega$. Then, we analyse the singular set of a
solution showing that singularities propagate along suitable curves, the
so-called generalized characteristics, and that such curves stay singular
unless they reach the boundary of $\Omega$. Moreover, we prove that the latter
is never the case for mechanical systems and that singular generalized
characteristics converge to a critical point of the solution in finite or
infinite time. Finally, under stronger assumptions for the domain and Dirichlet
data, we are able to conclude that solutions are globally semiconcave and
semiconvex near the boundary.
| math.AP math.DS | we study the nonhomogeneous dirichlet problem for first order hamiltonjacobi equations associated with tonelli hamiltonians on a bounded domain omega of rn assuming the energy level to be supercritical first we show that the viscosity weak kam solution of such a problem is lipschitz continuous and locally semiconcave in omega then we analyse the singular set of a solution showing that singularities propagate along suitable curves the socalled generalized characteristics and that such curves stay singular unless they reach the boundary of omega moreover we prove that the latter is never the case for mechanical systems and that singular generalized characteristics converge to a critical point of the solution in finite or infinite time finally under stronger assumptions for the domain and dirichlet data we are able to conclude that solutions are globally semiconcave and semiconvex near the boundary | [['we', 'study', 'the', 'nonhomogeneous', 'dirichlet', 'problem', 'for', 'first', 'order', 'hamiltonjacobi', 'equations', 'associated', 'with', 'tonelli', 'hamiltonians', 'on', 'a', 'bounded', 'domain', 'omega', 'of', 'rn', 'assuming', 'the', 'energy', 'level', 'to', 'be', 'supercritical', 'first', 'we', 'show', 'that', 'the', 'viscosity', 'weak', 'kam', 'solution', 'of', 'such', 'a', 'problem', 'is', 'lipschitz', 'continuous', 'and', 'locally', 'semiconcave', 'in', 'omega', 'then', 'we', 'analyse', 'the', 'singular', 'set', 'of', 'a', 'solution', 'showing', 'that', 'singularities', 'propagate', 'along', 'suitable', 'curves', 'the', 'socalled', 'generalized', 'characteristics', 'and', 'that', 'such', 'curves', 'stay', 'singular', 'unless', 'they', 'reach', 'the', 'boundary', 'of', 'omega', 'moreover', 'we', 'prove', 'that', 'the', 'latter', 'is', 'never', 'the', 'case', 'for', 'mechanical', 'systems', 'and', 'that', 'singular', 'generalized', 'characteristics', 'converge', 'to', 'a', 'critical', 'point', 'of', 'the', 'solution', 'in', 'finite', 'or', 'infinite', 'time', 'finally', 'under', 'stronger', 'assumptions', 'for', 'the', 'domain', 'and', 'dirichlet', 'data', 'we', 'are', 'able', 'to', 'conclude', 'that', 'solutions', 'are', 'globally', 'semiconcave', 'and', 'semiconvex', 'near', 'the', 'boundary']] | [-0.16663129225694875, 0.0760293096478144, -0.095960364636811, 0.06926321561227171, -0.10831183047710563, -0.13593483887773625, 0.02309199803502118, 0.3454131041016939, -0.3294459159800903, -0.1496335319879887, 0.1833656913309405, -0.2989114457171866, -0.12654220884692646, 0.1848126345627318, -0.06616512552178432, 0.0984411765653774, 0.08904974503868106, 0.07986338645648614, -0.07464589701426089, -0.21158255317764316, 0.42367041194409455, -0.08226786733591568, 0.22683056078770822, 0.06134307844247736, 0.10985709361567852, -0.050774818361676535, 0.06773281333927843, 0.07321892159810062, -0.194012175573655, 0.06328711594227139, 0.23543630562313972, 0.056795243704825533, 0.2769329932739409, -0.4226524912678509, -0.20974352134880778, 0.1713331444054949, 0.12324109558257268, 0.04776609906752547, 0.0006904964755697966, -0.2795818904264019, 0.16688457068404278, -0.07360730953045565, -0.2274261317014855, -0.07376886367221637, 0.017219956212161148, 0.0703544778759397, -0.28916939095386285, 0.08427310094116724, 0.11160976305041168, 0.0015803203723735088, -0.1785222587741831, -0.0527070045702347, -0.046453797074182214, 0.062196371076869775, 0.04591185016483872, 0.041603127472050715, 0.06616140277922261, -0.0989581186444961, -0.03807185447218714, 0.3480949538254025, -0.08986285963496059, -0.2874644390180064, 0.185412305032017, -0.17107891349671342, -0.1331656832505929, 0.10283612098759241, 0.14894437358091525, 0.17756865550797407, -0.12634550454765023, 0.14595103859960054, -0.044871655632842254, 0.1231182069936851, 0.12051268826446516, -0.022266275276222245, 0.12246933842761268, 0.09343329004326956, 0.17466966100305104, 0.1287434273374287, -0.022680059807767033, -0.11055476069383377, -0.3799697075226753, -0.14500069230620702, -0.16280768887917077, 0.10243236155101774, -0.10197662191560555, -0.2171582302963026, 0.3338693848311928, 0.12271762289200648, 0.1916860961838937, 0.10076051474575677, 0.21401459856290478, 0.1801949592313282, -0.022339889685884653, 0.1305820448190081, 0.1989233957690676, 0.0837037850643689, 0.07979553413959287, -0.208000169893586, 0.014515813481122953, 0.09113579321174846] |
1,803.01592 | OpenMath and SMT-LIB | OpenMath and SMT-LIB are languages with very different origins, but both
"represent mathematics". We describe SMT-LIB for the OpenMath community and
consider adaptations for both languages to support the growing SC-Square
initiative.
| cs.SC cs.MS | openmath and smtlib are languages with very different origins but both represent mathematics we describe smtlib for the openmath community and consider adaptations for both languages to support the growing scsquare initiative | [['openmath', 'and', 'smtlib', 'are', 'languages', 'with', 'very', 'different', 'origins', 'but', 'both', 'represent', 'mathematics', 'we', 'describe', 'smtlib', 'for', 'the', 'openmath', 'community', 'and', 'consider', 'adaptations', 'for', 'both', 'languages', 'to', 'support', 'the', 'growing', 'scsquare', 'initiative']] | [-0.04134767338837264, 0.04773580588516779, -0.020336014247732237, 0.15916704863775522, -0.17009377508657053, -0.1689716472174041, 0.012117296617361717, 0.39095135973821016, -0.25728023215197027, -0.3289561925921589, 0.1375080349826021, -0.2596471735741943, -0.13469226495362818, 0.20379978459095582, -0.07141323771793395, -0.033702952263411134, 0.07543256934150122, -0.026768194162286818, 0.015592495357850567, -0.22855466738838004, 0.30273784580640495, -0.003957624721806496, 0.2912167195463553, 0.03412254802242387, 0.06335236452287063, -0.03123615335789509, -0.09420346206752583, -0.0037724076537415385, -0.07630586439336184, 0.18289914923661854, 0.4172343983082101, 0.30521808890625834, 0.29175017098896205, -0.45651476364582777, -0.14089115521346685, 0.04285604221513495, 0.06781150730967056, 0.13146507198689505, -0.035426239963271655, -0.30937268878915347, 0.06948023345466936, -0.1915703349513933, -0.024816914461553097, -0.12193800209206529, 0.0534006396192126, 0.04718256322667003, -0.1747044600197114, -0.06180311588104814, 0.027298122993670404, 0.15048048316384666, -0.08413015874248231, -0.19410319195594639, 0.01426013739546761, 0.17189600141136907, 0.05768602310490678, 0.027440579899121076, 0.0522571185574634, -0.11979547535884194, -0.18439479428343475, 0.39683380140922964, -0.002387446686043404, -0.1657736951019615, 0.322739020222798, -0.08590691781137139, -0.21613041790260468, -0.023351672920398414, 0.2398493459331803, 0.010684495769964997, -0.16447709380008746, 0.13619550212388276, 0.021285201321006753, 0.1645543836784782, 0.12111091295810184, 0.006844299205113202, 0.22974689863622189, 0.2002331691328436, -0.012831995962187648, 0.08729227125877514, 0.006933006356121041, -0.11474104877561331, -0.2163387486943975, -0.18162937634042464, -0.05526220631873002, -0.11010381135565694, -0.00785390598957747, -0.22690749043249525, 0.3620578858535737, 0.17283227437292226, 0.05961553554516286, 0.17245002134586684, 0.19132124094176106, -0.0029419258935377, 0.10856261199660366, 0.11967999933813189, 0.11854752735234797, 0.06442760885693133, 0.18013287332723849, -0.0952748041599989, 0.09874810514156707, -0.0035834774607792497] |
1,803.01593 | IGR J17329-2731: The birth of a symbiotic X-ray binary | We report on the results of the multiwavelength campaign carried out after
the discovery of the INTEGRAL transient IGR J17329-2731. The optical data
collected with the SOAR telescope allowed us to identify the donor star in this
system as a late M giant at a distance of 2.7$^{+3.4}_{-1.2}$ kpc. The data
collected quasi-simultaneously with XMM-Newton and NuSTAR showed the presence
of a modulation with a period of 6680$\pm$3 s in the X-ray light curves of the
source. This unveils that the compact object hosted in this system is a slowly
rotating neutron star. The broadband X-ray spectrum showed the presence of a
strong absorption ($\gg$10$^{23}$ cm$^{-2}$) and prominent emission lines at
6.4 keV, and 7.1 keV. These features are usually found in wind-fed systems, in
which the emission lines result from the fluorescence of the X-rays from the
accreting compact object on the surrounding stellar wind. The presence of a
strong absorption line around $\sim$21 keV in the NuSTAR spectrum suggests a
cyclotron origin, thus allowing us to estimate the neutron star magnetic field
as $\sim$2.4$\times$10$^{12}$ G. All evidence thus suggests IGR J17329-2731 is
a symbiotic X-ray binary. As no X-ray emission was ever observed from the
location of IGR J17329-2731 by INTEGRAL (or other X-ray facilities) during the
past 15 yr in orbit and considering that symbiotic X-ray binaries are known to
be variable but persistent X-ray sources, we concluded that INTEGRAL caught the
first detectable X-ray emission from IGR J17329-2731 when the source shined as
a symbiotic X-ray binary. The Swift/XRT monitoring performed up to $\sim$3
months after the discovery of the source, showed that it maintained a
relatively stable X-ray flux and spectral properties.
| astro-ph.HE | we report on the results of the multiwavelength campaign carried out after the discovery of the integral transient igr j173292731 the optical data collected with the soar telescope allowed us to identify the donor star in this system as a late m giant at a distance of 2734_12 kpc the data collected quasisimultaneously with xmmnewton and nustar showed the presence of a modulation with a period of 6680pm3 s in the xray light curves of the source this unveils that the compact object hosted in this system is a slowly rotating neutron star the broadband xray spectrum showed the presence of a strong absorption gg1023 cm2 and prominent emission lines at 64 kev and 71 kev these features are usually found in windfed systems in which the emission lines result from the fluorescence of the xrays from the accreting compact object on the surrounding stellar wind the presence of a strong absorption line around sim21 kev in the nustar spectrum suggests a cyclotron origin thus allowing us to estimate the neutron star magnetic field as sim24times1012 g all evidence thus suggests igr j173292731 is a symbiotic xray binary as no xray emission was ever observed from the location of igr j173292731 by integral or other xray facilities during the past 15 yr in orbit and considering that symbiotic xray binaries are known to be variable but persistent xray sources we concluded that integral caught the first detectable xray emission from igr j173292731 when the source shined as a symbiotic xray binary the swiftxrt monitoring performed up to sim3 months after the discovery of the source showed that it maintained a relatively stable xray flux and spectral properties | [['we', 'report', 'on', 'the', 'results', 'of', 'the', 'multiwavelength', 'campaign', 'carried', 'out', 'after', 'the', 'discovery', 'of', 'the', 'integral', 'transient', 'igr', 'j173292731', 'the', 'optical', 'data', 'collected', 'with', 'the', 'soar', 'telescope', 'allowed', 'us', 'to', 'identify', 'the', 'donor', 'star', 'in', 'this', 'system', 'as', 'a', 'late', 'm', 'giant', 'at', 'a', 'distance', 'of', '2734_12', 'kpc', 'the', 'data', 'collected', 'quasisimultaneously', 'with', 'xmmnewton', 'and', 'nustar', 'showed', 'the', 'presence', 'of', 'a', 'modulation', 'with', 'a', 'period', 'of', '6680pm3', 's', 'in', 'the', 'xray', 'light', 'curves', 'of', 'the', 'source', 'this', 'unveils', 'that', 'the', 'compact', 'object', 'hosted', 'in', 'this', 'system', 'is', 'a', 'slowly', 'rotating', 'neutron', 'star', 'the', 'broadband', 'xray', 'spectrum', 'showed', 'the', 'presence', 'of', 'a', 'strong', 'absorption', 'gg1023', 'cm2', 'and', 'prominent', 'emission', 'lines', 'at', '64', 'kev', 'and', '71', 'kev', 'these', 'features', 'are', 'usually', 'found', 'in', 'windfed', 'systems', 'in', 'which', 'the', 'emission', 'lines', 'result', 'from', 'the', 'fluorescence', 'of', 'the', 'xrays', 'from', 'the', 'accreting', 'compact', 'object', 'on', 'the', 'surrounding', 'stellar', 'wind', 'the', 'presence', 'of', 'a', 'strong', 'absorption', 'line', 'around', 'sim21', 'kev', 'in', 'the', 'nustar', 'spectrum', 'suggests', 'a', 'cyclotron', 'origin', 'thus', 'allowing', 'us', 'to', 'estimate', 'the', 'neutron', 'star', 'magnetic', 'field', 'as', 'sim24times1012', 'g', 'all', 'evidence', 'thus', 'suggests', 'igr', 'j173292731', 'is', 'a', 'symbiotic', 'xray', 'binary', 'as', 'no', 'xray', 'emission', 'was', 'ever', 'observed', 'from', 'the', 'location', 'of', 'igr', 'j173292731', 'by', 'integral', 'or', 'other', 'xray', 'facilities', 'during', 'the', 'past', '15', 'yr', 'in', 'orbit', 'and', 'considering', 'that', 'symbiotic', 'xray', 'binaries', 'are', 'known', 'to', 'be', 'variable', 'but', 'persistent', 'xray', 'sources', 'we', 'concluded', 'that', 'integral', 'caught', 'the', 'first', 'detectable', 'xray', 'emission', 'from', 'igr', 'j173292731', 'when', 'the', 'source', 'shined', 'as', 'a', 'symbiotic', 'xray', 'binary', 'the', 'swiftxrt', 'monitoring', 'performed', 'up', 'to', 'sim3', 'months', 'after', 'the', 'discovery', 'of', 'the', 'source', 'showed', 'that', 'it', 'maintained', 'a', 'relatively', 'stable', 'xray', 'flux', 'and', 'spectral', 'properties']] | [-0.08923424496110734, 0.09407228139832943, -0.06332159925409125, 0.07947173191579025, -0.11393612659546537, -0.10885037376200814, 0.10861276279821064, 0.44893988811550833, -0.17867790645622944, -0.35139799877044303, 0.11856733862312353, -0.35910108581103467, -0.022981318212139862, 0.2672192378842951, -0.01295101841495478, -0.024047500658575652, 0.11251999669658845, -0.034813326522503255, -0.03978269575027264, -0.22865999376336488, 0.25968581133039376, 0.09448921749958489, 0.14706161729445605, -0.006111570961445898, 0.07767626251462478, -0.009715184589827454, -0.05729965959309307, -0.07235886210800854, -0.04132784417036822, 0.05058448367339351, 0.2558155751381165, 0.10088395951132396, 0.1778914036106441, -0.32932433833055974, -0.2520118639412107, 0.03685916784763568, 0.1471637401225782, -0.0573358401940153, -0.03749509737229882, -0.2970088936308324, 0.041138076194435796, -0.2104157509210591, -0.1896408376379464, 0.07010697567282798, 0.07409153647777103, 0.03803422701657637, -0.17096542918648666, 0.08622389835998034, 0.02453544729597348, 0.07009189924293013, -0.2022845231601286, -0.01679400169467997, -0.023326793360615987, 0.04250358084556578, 0.0581264860076052, 0.08229896219766225, 0.1313306284307642, -0.10425699491792823, -0.0849989819964701, 0.33673056514486804, -0.058887170550955846, 0.0963223567624805, 0.20172159311202978, -0.2288475837771723, -0.21157367444245806, 0.23844894079914514, 0.1010807984757609, 0.15812716352831804, -0.16342548775213092, -0.009854522695971292, -0.03342934338642018, 0.29133293699241164, 0.054952777963943586, 0.06610969631572769, 0.3547537646566828, 0.1083166045025878, -0.0014549364419415211, 0.17829543668346057, -0.29802646761207463, 0.03686983398103834, -0.22493252057527557, -0.05832574531715704, -0.13155466597058194, 0.14341154611659246, -0.06421440879142913, -0.13387688337599232, 0.35617960222114914, 0.0589765680043646, 0.18091362835532362, -0.044933640820677, 0.2900371044198727, 0.09501901216337615, 0.06120431807981471, 0.12789372030829826, 0.33365361012804967, 0.14585719789692198, 0.15715067460109572, -0.25829915080949556, 0.06034280160900833, -0.01780623196105681] |
1,803.01594 | Reconstruction method of $f(R)$ gravity for isotropic and anisotropic
spacetimes | We present the reconstruction method of $f(R)$ gravity for the homogeneous
and anisotropic Bianchi-I spacetime, which was previously formulated only for
homogeneous and isotropic FLRW spacetime. We argue in this paper that for
anisotropic spacetimes, the total anisotropy behaves as an independent metric
degree of freedom on top of the average scale factor in $f(R)$ gravity. This is
not like $GR$, where specifying the form of the average scale factor as a
function of time also specify the total anisotropy as a function of time
uniqely. We link this peculiar fact to an interesting intertwining between the
definition of Ricci scalar for anisotropic metric and anisotropy evolution
equation in $f(R)$ gravity. Consequently, specifying an anisotropic solution of
$f(R)$ gravity implies specifying both the average scale factor and the total
anisotropy as functions of time. The reconstruction method hence formulated is
applied to two scenarios where anisotropy suppression is important, namely, a
quasi de-Sitter expansion as required in inflation, and a power law contraction
as required in ekpyrotic bounce models.
| gr-qc | we present the reconstruction method of fr gravity for the homogeneous and anisotropic bianchii spacetime which was previously formulated only for homogeneous and isotropic flrw spacetime we argue in this paper that for anisotropic spacetimes the total anisotropy behaves as an independent metric degree of freedom on top of the average scale factor in fr gravity this is not like gr where specifying the form of the average scale factor as a function of time also specify the total anisotropy as a function of time uniqely we link this peculiar fact to an interesting intertwining between the definition of ricci scalar for anisotropic metric and anisotropy evolution equation in fr gravity consequently specifying an anisotropic solution of fr gravity implies specifying both the average scale factor and the total anisotropy as functions of time the reconstruction method hence formulated is applied to two scenarios where anisotropy suppression is important namely a quasi desitter expansion as required in inflation and a power law contraction as required in ekpyrotic bounce models | [['we', 'present', 'the', 'reconstruction', 'method', 'of', 'fr', 'gravity', 'for', 'the', 'homogeneous', 'and', 'anisotropic', 'bianchii', 'spacetime', 'which', 'was', 'previously', 'formulated', 'only', 'for', 'homogeneous', 'and', 'isotropic', 'flrw', 'spacetime', 'we', 'argue', 'in', 'this', 'paper', 'that', 'for', 'anisotropic', 'spacetimes', 'the', 'total', 'anisotropy', 'behaves', 'as', 'an', 'independent', 'metric', 'degree', 'of', 'freedom', 'on', 'top', 'of', 'the', 'average', 'scale', 'factor', 'in', 'fr', 'gravity', 'this', 'is', 'not', 'like', 'gr', 'where', 'specifying', 'the', 'form', 'of', 'the', 'average', 'scale', 'factor', 'as', 'a', 'function', 'of', 'time', 'also', 'specify', 'the', 'total', 'anisotropy', 'as', 'a', 'function', 'of', 'time', 'uniqely', 'we', 'link', 'this', 'peculiar', 'fact', 'to', 'an', 'interesting', 'intertwining', 'between', 'the', 'definition', 'of', 'ricci', 'scalar', 'for', 'anisotropic', 'metric', 'and', 'anisotropy', 'evolution', 'equation', 'in', 'fr', 'gravity', 'consequently', 'specifying', 'an', 'anisotropic', 'solution', 'of', 'fr', 'gravity', 'implies', 'specifying', 'both', 'the', 'average', 'scale', 'factor', 'and', 'the', 'total', 'anisotropy', 'as', 'functions', 'of', 'time', 'the', 'reconstruction', 'method', 'hence', 'formulated', 'is', 'applied', 'to', 'two', 'scenarios', 'where', 'anisotropy', 'suppression', 'is', 'important', 'namely', 'a', 'quasi', 'desitter', 'expansion', 'as', 'required', 'in', 'inflation', 'and', 'a', 'power', 'law', 'contraction', 'as', 'required', 'in', 'ekpyrotic', 'bounce', 'models']] | [-0.15665729558427952, 0.11853463057152458, -0.10980005325594296, 0.09637281045849834, -0.0945288571251911, -0.13960164211208134, -0.0819143253659907, 0.31726323308179244, -0.2451091571156645, -0.32546785446105614, 0.05042011513710133, -0.20766287444747009, -0.12675164691782334, 0.13431656179073753, -0.00793273133292262, 0.022047351907184792, -0.04761481158562847, 0.0431672081689439, -0.09567231672588691, -0.2372940069374939, 0.3626183652585106, 0.13428187748927267, 0.2770878694219781, 0.01569675992886048, 0.13169838655163144, -0.022110954825101153, -0.0002909088978499529, 0.09040538578812543, -0.17307027375175363, 0.03450918594829827, 0.19180842201943787, 0.09407133426841374, 0.20653951212686175, -0.375031290963913, -0.2554401214666931, 0.10918489091342226, 0.16751930868208764, 0.10954874635249975, -0.04096177236767419, -0.23188272631904555, 0.028164139826826397, -0.16754950921910808, -0.14083057467325402, -0.04146781967331966, 0.05669534866077205, -0.045750351345521356, -0.2816389405218485, 0.1716015514731615, 0.05779410267825283, 0.0006783362478017807, -0.09643467445857823, -0.06209998066575887, -0.002136662449975986, 0.055744438487592904, 0.11028248949913264, 0.07241682564407322, 0.10603875561112848, -0.1509940500240884, -0.0629815553554744, 0.4121504478611141, -0.14513811409761684, -0.22850697642535947, 0.09111340023671455, -0.1335043516065482, -0.13249351791594, 0.045378502003759855, 0.16884667980706408, 0.14334910468793774, -0.12901202509030035, 0.13566303373573602, 0.031031007069118675, 0.15723753158818, 0.10770248244183936, 0.04424843634478748, 0.216079394555501, 0.12779523624894432, 0.0799232188312869, 0.1335008319680734, -0.02821406467479565, -0.08705470453042792, -0.37224241429274635, -0.18279585949910274, -0.17785086522677115, 0.0920816751314262, -0.22490352153224757, -0.20783108203960138, 0.37904338410451255, 0.09731636527812086, 0.1540674355623889, 0.042945015427817236, 0.2547003413949694, 0.10339827774441801, 0.04420081966756178, 0.11155169168930679, 0.26944202066044365, 0.10829604435518074, 0.11084978490821197, -0.22114454311529352, 0.023591622050541144, 0.06602337255719162] |
1,803.01595 | Spectral reflectance estimation from one RGB image using
self-interreflections in a concave object | Light interreflections occurring in a concave object generate a color
gradient which is characteristic of the object's spectral reflectance. In this
paper, we use this property in order to estimate the spectral reflectance of
matte, uniformly colored, V-shaped surfaces from a single RGB image taken under
directional lighting. First, simulations show that using one image of the
concave object is equivalent to, and can even outperform, the state of the art
approaches based on three images taken under three lightings with different
colors. Experiments on real images of folded papers were performed under
unmeasured direct sunlight. The results show that our interreflection-based
approach outperforms existing approaches even when the latter are improved by a
calibration step. The mathematical solution for the interreflection equation
and the effect of surface parameters on the performance of the method are also
discussed in this paper.
| cs.CV | light interreflections occurring in a concave object generate a color gradient which is characteristic of the objects spectral reflectance in this paper we use this property in order to estimate the spectral reflectance of matte uniformly colored vshaped surfaces from a single rgb image taken under directional lighting first simulations show that using one image of the concave object is equivalent to and can even outperform the state of the art approaches based on three images taken under three lightings with different colors experiments on real images of folded papers were performed under unmeasured direct sunlight the results show that our interreflectionbased approach outperforms existing approaches even when the latter are improved by a calibration step the mathematical solution for the interreflection equation and the effect of surface parameters on the performance of the method are also discussed in this paper | [['light', 'interreflections', 'occurring', 'in', 'a', 'concave', 'object', 'generate', 'a', 'color', 'gradient', 'which', 'is', 'characteristic', 'of', 'the', 'objects', 'spectral', 'reflectance', 'in', 'this', 'paper', 'we', 'use', 'this', 'property', 'in', 'order', 'to', 'estimate', 'the', 'spectral', 'reflectance', 'of', 'matte', 'uniformly', 'colored', 'vshaped', 'surfaces', 'from', 'a', 'single', 'rgb', 'image', 'taken', 'under', 'directional', 'lighting', 'first', 'simulations', 'show', 'that', 'using', 'one', 'image', 'of', 'the', 'concave', 'object', 'is', 'equivalent', 'to', 'and', 'can', 'even', 'outperform', 'the', 'state', 'of', 'the', 'art', 'approaches', 'based', 'on', 'three', 'images', 'taken', 'under', 'three', 'lightings', 'with', 'different', 'colors', 'experiments', 'on', 'real', 'images', 'of', 'folded', 'papers', 'were', 'performed', 'under', 'unmeasured', 'direct', 'sunlight', 'the', 'results', 'show', 'that', 'our', 'interreflectionbased', 'approach', 'outperforms', 'existing', 'approaches', 'even', 'when', 'the', 'latter', 'are', 'improved', 'by', 'a', 'calibration', 'step', 'the', 'mathematical', 'solution', 'for', 'the', 'interreflection', 'equation', 'and', 'the', 'effect', 'of', 'surface', 'parameters', 'on', 'the', 'performance', 'of', 'the', 'method', 'are', 'also', 'discussed', 'in', 'this', 'paper']] | [-0.038151394930141774, 0.05099774333580896, -0.14008725553993945, 0.0346926168236625, -0.04788930366571615, -0.1163619877230646, 0.002339836545760973, 0.4551409849073684, -0.22389615555226372, -0.3108992917307963, 0.10195750720879954, -0.2696492340233501, -0.15977950026053409, 0.22533221167269285, -0.1397091358177958, 0.06293982994216292, 0.12696262929872001, 0.029943989893502516, -0.07590221861492087, -0.2774442935605412, 0.32916041402537644, -0.030756649831174942, 0.29427974207826174, 0.02176755406612031, 0.11305254757188368, -0.009033760346094336, -0.02183379579345574, 0.04499849467875733, -0.083885221050034, 0.12807056776828307, 0.21778246339754728, 0.091117952224812, 0.21563246831858018, -0.4102615784799707, -0.23044507306717013, 0.07490846781613494, 0.09808883929382199, 0.06983795371395873, -0.0665811251442326, -0.29663855833527836, 0.09508339229269304, -0.09758099333207676, -0.06460083698502918, -0.030970252368707155, -0.04367409812360732, 0.005686443490971663, -0.27445868944641255, 0.05306295226172011, 0.07213165774769352, 0.04792225508329769, -0.09432457137407492, -0.1558276713670542, -0.012266455073098557, 0.13450902187542996, 0.04462122995460379, 0.012792099719408197, 0.124325776654903, -0.1623193806246517, -0.09007442066111886, 0.38217169375739235, -0.10376113073552783, -0.20313236624697575, 0.17576271420904854, -0.10365717255415907, -0.10569576668026655, 0.15628687894997606, 0.16004917679516517, 0.17196569283681828, -0.14531407542275754, 0.033508487753536334, -0.06270357870253855, 0.1768469821418757, 0.08321253971054988, 0.02607019246974285, 0.1656110330056264, 0.1646852296071829, 0.04121160394498619, 0.16428194211735186, -0.17677823766100936, -0.03967264768384073, -0.27151552643593185, -0.12406569715434064, -0.19520977186207808, -0.0016107647544771864, -0.07015222333501551, -0.1377324962725296, 0.42903600861925795, 0.19820162396459584, 0.1975238687929063, 0.057061274833741016, 0.35844494989546744, 0.07698781939098558, 0.06579993940776795, 0.028162305155580027, 0.236011163508722, 0.04866616806332562, 0.0761044698909087, -0.19749710703963766, 0.05929276951507706, 0.03888167738108862] |
1,803.01596 | L'usage de la combinatoire chez Girard Desargues : le cas du
th\'eor\`eme de M\'en\'ela\"us | We show in this article how Girard Desargues, in his well known text on
conics, the \textit{Brouillon Project,} manages to use Menelaos' theorem with
some awesome virtuosity. To this end, we propose a detailed analysis of his
\textit{combinatorial} approach, which was already visible in the development
of his notion of involution. We shall study the proofs of two important
theorems of the \textit{Brouillon.} The first is the theorem of the "ram\'ee",
stating that the configuration of involution is invariant by perspective
projection, and the second is the great theorem of Desargues on pencils of
conics. We shall also study in the same spirit the first lemma (dealing with
the hexagram) of the \textit{Essay pour les coniques} by Pascal and the
\textit{Advis charitables} by de Beaugrand.
| math.HO | we show in this article how girard desargues in his well known text on conics the textitbrouillon project manages to use menelaos theorem with some awesome virtuosity to this end we propose a detailed analysis of his textitcombinatorial approach which was already visible in the development of his notion of involution we shall study the proofs of two important theorems of the textitbrouillon the first is the theorem of the ramee stating that the configuration of involution is invariant by perspective projection and the second is the great theorem of desargues on pencils of conics we shall also study in the same spirit the first lemma dealing with the hexagram of the textitessay pour les coniques by pascal and the textitadvis charitables by de beaugrand | [['we', 'show', 'in', 'this', 'article', 'how', 'girard', 'desargues', 'in', 'his', 'well', 'known', 'text', 'on', 'conics', 'the', 'textitbrouillon', 'project', 'manages', 'to', 'use', 'menelaos', 'theorem', 'with', 'some', 'awesome', 'virtuosity', 'to', 'this', 'end', 'we', 'propose', 'a', 'detailed', 'analysis', 'of', 'his', 'textitcombinatorial', 'approach', 'which', 'was', 'already', 'visible', 'in', 'the', 'development', 'of', 'his', 'notion', 'of', 'involution', 'we', 'shall', 'study', 'the', 'proofs', 'of', 'two', 'important', 'theorems', 'of', 'the', 'textitbrouillon', 'the', 'first', 'is', 'the', 'theorem', 'of', 'the', 'ramee', 'stating', 'that', 'the', 'configuration', 'of', 'involution', 'is', 'invariant', 'by', 'perspective', 'projection', 'and', 'the', 'second', 'is', 'the', 'great', 'theorem', 'of', 'desargues', 'on', 'pencils', 'of', 'conics', 'we', 'shall', 'also', 'study', 'in', 'the', 'same', 'spirit', 'the', 'first', 'lemma', 'dealing', 'with', 'the', 'hexagram', 'of', 'the', 'textitessay', 'pour', 'les', 'coniques', 'by', 'pascal', 'and', 'the', 'textitadvis', 'charitables', 'by', 'de', 'beaugrand']] | [-0.12553504633004936, 0.01700411289950075, -0.14887557464249243, 0.06588539231363368, -0.0801997419951831, -0.08171385389721116, 0.009462563370322903, 0.27670420527110917, -0.246445157474412, -0.28705937865237563, 0.11981763554267365, -0.27095640803316323, -0.21034035569706033, 0.173312100976453, -0.1968234569481495, 0.0054496809587640275, 0.04552106279090552, 0.027427431349879353, -0.05704430092946958, -0.2726277893426891, 0.37614286812495884, 0.0478821443778589, 0.24340663782036784, 0.07947243621446572, 0.11104756558187685, 0.06939543108751808, -0.06431118692705502, -0.05960709834668659, -0.1658636104314656, 0.16638990394155478, 0.2562557757137564, 0.14952564231085275, 0.26675253260044096, -0.3653719971840412, -0.08618477909525825, 0.10009900727151436, 0.08367679004510076, 0.0965775911315439, 0.008707109876213816, -0.31512141877280203, 0.09709184747820689, -0.12810080085675848, -0.16327463413225646, -0.043516519147965865, -0.032239350300850504, 0.0370014668205532, -0.1500533961659392, 0.009389074880114787, 0.18007305644993213, 0.09533622304359411, -0.019073845299702706, -0.10155212689759367, -0.027094022733932834, 0.07318978310736307, 0.0398764136361779, 0.031568377775976715, 0.0417814500071503, -0.058398088629720575, -0.13821329284159434, 0.3641495668976489, -0.053228736419025494, -0.15377898696589015, 0.12920497808116094, -0.13748577734755385, -0.21792604858193831, 0.03467907578786993, 0.11639569793291138, 0.15834585507005705, -0.09662070236034628, 0.1375958955347522, -0.12929317787668462, 0.0951266129011825, 0.14067927323344906, -0.02308973151069703, 0.12172668041085224, 0.1322889738100565, 0.038382406849650885, 0.14529705560821407, -0.04314490462854599, -0.07878023370611087, -0.3368466386129543, -0.2289479166837567, -0.1485449815745134, 0.07595184069596451, -0.044737954781601856, -0.14076439133190186, 0.37993398058165057, 0.16252547573945406, 0.14009192462475828, 0.05465731681896752, 0.2700907450674449, 0.033758282799557865, 0.02415157772868998, 0.020636240742563948, 0.2079110495971567, 0.14647882409449034, 0.13626434206489033, -0.13902320519856265, -0.005485865867586206, 0.19326174189731227] |
1,803.01597 | Divergence of $\langle p^6\rangle$ in discontinuous potential wells | The surprising divergence of the expectation value $<\!p^6\!>$ for the square
well potential is known. Here, we prove and demonstrate the divergence of
$<\!p^6\!>$ in potential wells which have a finite jump discontinuity; apart
from the square-well two-piece half-potentials wells are examples. These
half-potential wells can be expressed as $V(x)=-U(x) \Theta(x)$, where
$\Theta(x)$ is the Heaviside step function. $U(x)$ are continuous and
differentiable functions with minimum at $x=0$ and which may or not vanish as
$x\sim \infty$.
| quant-ph | the surprising divergence of the expectation value p6 for the square well potential is known here we prove and demonstrate the divergence of p6 in potential wells which have a finite jump discontinuity apart from the squarewell twopiece halfpotentials wells are examples these halfpotential wells can be expressed as vxux thetax where thetax is the heaviside step function ux are continuous and differentiable functions with minimum at x0 and which may or not vanish as xsim infty | [['the', 'surprising', 'divergence', 'of', 'the', 'expectation', 'value', 'p6', 'for', 'the', 'square', 'well', 'potential', 'is', 'known', 'here', 'we', 'prove', 'and', 'demonstrate', 'the', 'divergence', 'of', 'p6', 'in', 'potential', 'wells', 'which', 'have', 'a', 'finite', 'jump', 'discontinuity', 'apart', 'from', 'the', 'squarewell', 'twopiece', 'halfpotentials', 'wells', 'are', 'examples', 'these', 'halfpotential', 'wells', 'can', 'be', 'expressed', 'as', 'vxux', 'thetax', 'where', 'thetax', 'is', 'the', 'heaviside', 'step', 'function', 'ux', 'are', 'continuous', 'and', 'differentiable', 'functions', 'with', 'minimum', 'at', 'x0', 'and', 'which', 'may', 'or', 'not', 'vanish', 'as', 'xsim', 'infty']] | [-0.09763798580781834, 0.13544657085141218, -0.05965293126457648, 0.08308081315339517, -0.027960144782539557, -0.2014589376458143, 0.016764435829040972, 0.390715666552628, -0.29506065000660364, -0.22365118621068225, 0.1254985981881996, -0.3511323620253746, -0.1553483811219701, 0.14365843411321072, -0.016839699423242663, 0.08390903377251045, -0.0371193116958681, 0.07282011867249133, -0.1104475956762562, -0.2266896919951447, 0.307784574109482, -0.07393283651185197, 0.16025804605561536, 0.13336515600000182, 0.09997990809859254, -0.03215456276351737, 0.1193585456160174, -0.013607955927885062, -0.14623357590942368, -0.028609255920290143, 0.23046175611985698, 0.013653689617844852, 0.3043797782093689, -0.3546925478589696, -0.19491923187632818, 0.1514790224279529, 0.19163967304032398, 0.04926844113317595, -0.020831840021560924, -0.25830917896048444, 0.07366039247151364, -0.11056703217390522, -0.16340258528755322, -0.07720494749200707, 0.02367720685622378, 0.12726011565836096, -0.3280121301539947, 0.1370417555680851, 0.042703249751325896, 0.053126707874439856, -0.03714594640139792, -0.21429036986837918, -0.058640976496217016, 0.10638896195293479, 0.06101205775740783, 0.14140280766484983, 0.1189540331818264, -0.11140693438465933, -0.06520262195074276, 0.3423651667544618, -0.07542981227507463, -0.1968159322324838, 0.11829082258171528, -0.2092164575525031, -0.061404684099142216, 0.08353716132507936, 0.10404368575561691, 0.12039489246200065, -0.10599577846005559, 0.18515290894838227, -0.0004483952778517394, 0.10051024220632138, 0.10511971475254442, 0.01573022670345381, 0.19731080438941717, 0.04919212258647423, 0.10863906803628984, 0.14110185794777716, -0.05942367723312329, -0.10194974760147366, -0.41161351983208916, -0.17317941716897325, -0.2579534364662863, 0.07204158399179357, -0.09687412992010454, -0.2418857966675549, 0.3126735296100378, 0.05924182327470515, 0.20923904656130518, 0.09965099363172478, 0.19799808680860176, 0.22791344232894983, 0.0731758048279664, 0.04272248923174433, 0.1964034853704475, 0.07581559542528782, 0.06308363732957356, -0.14735249459831598, 0.05052244604086956, 0.05726278023290876] |
1,803.01598 | RAPTOR: Ransomware Attack PredicTOR | Ransomware, a type of malicious software that encrypts a victim's files and
only releases the cryptographic key once a ransom is paid, has emerged as a
potentially devastating class of cybercrimes in the past few years. In this
paper, we present RAPTOR, a promising line of defense against ransomware
attacks. RAPTOR fingerprints attackers' operations to forecast ransomware
activity. More specifically, our method learns features of malicious domains by
looking at examples of domains involved in known ransomware attacks, and then
monitors newly registered domains to identify potentially malicious ones. In
addition, RAPTOR uses time series forecasting techniques to learn models of
historical ransomware activity and then leverages malicious domain
registrations as an external signal to forecast future ransomware activity. We
illustrate RAPTOR's effectiveness by forecasting all activity stages of Cerber,
a popular ransomware family. By monitoring zone files of the top-level domain
.top starting from August 30, 2016 through May 31, 2017, RAPTOR predicted 2,126
newly registered domains to be potential Cerber domains. Of these, 378 later
actually appeared in blacklists. Our empirical evaluation results show that
using predicted domain registrations helped improve forecasts of future Cerber
activity. Most importantly, our approach demonstrates the value of fusing
different signals in forecasting applications in the cyber domain.
| cs.CR | ransomware a type of malicious software that encrypts a victims files and only releases the cryptographic key once a ransom is paid has emerged as a potentially devastating class of cybercrimes in the past few years in this paper we present raptor a promising line of defense against ransomware attacks raptor fingerprints attackers operations to forecast ransomware activity more specifically our method learns features of malicious domains by looking at examples of domains involved in known ransomware attacks and then monitors newly registered domains to identify potentially malicious ones in addition raptor uses time series forecasting techniques to learn models of historical ransomware activity and then leverages malicious domain registrations as an external signal to forecast future ransomware activity we illustrate raptors effectiveness by forecasting all activity stages of cerber a popular ransomware family by monitoring zone files of the toplevel domain top starting from august 30 2016 through may 31 2017 raptor predicted 2126 newly registered domains to be potential cerber domains of these 378 later actually appeared in blacklists our empirical evaluation results show that using predicted domain registrations helped improve forecasts of future cerber activity most importantly our approach demonstrates the value of fusing different signals in forecasting applications in the cyber domain | [['ransomware', 'a', 'type', 'of', 'malicious', 'software', 'that', 'encrypts', 'a', 'victims', 'files', 'and', 'only', 'releases', 'the', 'cryptographic', 'key', 'once', 'a', 'ransom', 'is', 'paid', 'has', 'emerged', 'as', 'a', 'potentially', 'devastating', 'class', 'of', 'cybercrimes', 'in', 'the', 'past', 'few', 'years', 'in', 'this', 'paper', 'we', 'present', 'raptor', 'a', 'promising', 'line', 'of', 'defense', 'against', 'ransomware', 'attacks', 'raptor', 'fingerprints', 'attackers', 'operations', 'to', 'forecast', 'ransomware', 'activity', 'more', 'specifically', 'our', 'method', 'learns', 'features', 'of', 'malicious', 'domains', 'by', 'looking', 'at', 'examples', 'of', 'domains', 'involved', 'in', 'known', 'ransomware', 'attacks', 'and', 'then', 'monitors', 'newly', 'registered', 'domains', 'to', 'identify', 'potentially', 'malicious', 'ones', 'in', 'addition', 'raptor', 'uses', 'time', 'series', 'forecasting', 'techniques', 'to', 'learn', 'models', 'of', 'historical', 'ransomware', 'activity', 'and', 'then', 'leverages', 'malicious', 'domain', 'registrations', 'as', 'an', 'external', 'signal', 'to', 'forecast', 'future', 'ransomware', 'activity', 'we', 'illustrate', 'raptors', 'effectiveness', 'by', 'forecasting', 'all', 'activity', 'stages', 'of', 'cerber', 'a', 'popular', 'ransomware', 'family', 'by', 'monitoring', 'zone', 'files', 'of', 'the', 'toplevel', 'domain', 'top', 'starting', 'from', 'august', '30', '2016', 'through', 'may', '31', '2017', 'raptor', 'predicted', '2126', 'newly', 'registered', 'domains', 'to', 'be', 'potential', 'cerber', 'domains', 'of', 'these', '378', 'later', 'actually', 'appeared', 'in', 'blacklists', 'our', 'empirical', 'evaluation', 'results', 'show', 'that', 'using', 'predicted', 'domain', 'registrations', 'helped', 'improve', 'forecasts', 'of', 'future', 'cerber', 'activity', 'most', 'importantly', 'our', 'approach', 'demonstrates', 'the', 'value', 'of', 'fusing', 'different', 'signals', 'in', 'forecasting', 'applications', 'in', 'the', 'cyber', 'domain']] | [-0.10980608485491447, 0.008647112771598964, -0.07530987444220157, 0.08520815267380917, -0.10385213257381465, -0.18541092846553955, 0.10057175604388027, 0.3544208414352885, -0.22471119897246997, -0.34416126714701334, 0.148579555774312, -0.34899660398638466, -0.17451657503616155, 0.2429132677273961, -0.14849946789170912, 0.06617148866161432, 0.06473859630968058, 0.005320619276697072, -0.0013068247745495016, -0.3134405250774651, 0.2649065121639202, 0.08619245800030667, 0.29530069684927784, -0.00011803978690650405, 0.027283379422478014, -0.03319558507263115, -0.07957948272729792, -0.05890830964144254, -0.04951010219214723, 0.09301612775704664, 0.3710585293379398, 0.2304072574848627, 0.33760504238307476, -0.4232855842108043, -0.2575746709662603, 0.083185269926368, 0.10710144903618705, 0.10090210968003858, -0.06482205677290571, -0.3723925715812096, 0.11332094861682868, -0.2572449660076328, -0.07458999480075407, -0.10613675040466904, 0.035668547199499544, 0.02166069517786637, -0.23503602064986964, -0.015474417623950213, 0.00258861054870777, 0.11327465209178626, -0.039893703443770544, -0.09485852586378048, -0.03594656307136685, 0.18640550846097673, 0.09303262099260237, 0.0048344884090489, 0.1865561102357943, -0.09572267373115188, -0.18401015441773869, 0.3007417266685856, -0.029148575880496602, -0.051380835355418486, 0.17922551258944155, -0.05432166961226158, -0.16380376324920756, 0.1181520537677698, 0.26853969937144984, 0.12811826626974634, -0.18604983028433308, -0.04256223704319493, 0.010993855894066212, 0.21174081456009866, 0.07674315462297783, -0.0077996628586112, 0.1944148443980006, 0.19250648234113368, 0.040689097976925354, 0.13301139360623115, -0.14049896881802054, -0.04104681489080554, -0.21535632678608568, -0.10287978804965571, -0.14691594167237693, -0.006437455171083168, -0.06426906969672262, -0.11628945976724314, 0.45605039106591083, 0.21162664359037922, 0.13699663902701037, 0.019608318689847137, 0.3090022836289391, -0.05026443440569338, 0.10544985268583021, 0.13134898269867024, 0.17469458455367515, -0.025883748569730216, 0.15795693634214197, -0.09264637431550043, 0.16845014345173429, -0.0009784953384773761] |
1,803.01599 | AdaDepth: Unsupervised Content Congruent Adaptation for Depth Estimation | Supervised deep learning methods have shown promising results for the task of
monocular depth estimation; but acquiring ground truth is costly, and prone to
noise as well as inaccuracies. While synthetic datasets have been used to
circumvent above problems, the resultant models do not generalize well to
natural scenes due to the inherent domain shift. Recent adversarial approaches
for domain adaption have performed well in mitigating the differences between
the source and target domains. But these methods are mostly limited to a
classification setup and do not scale well for fully-convolutional
architectures. In this work, we propose AdaDepth - an unsupervised domain
adaptation strategy for the pixel-wise regression task of monocular depth
estimation. The proposed approach is devoid of above limitations through a)
adversarial learning and b) explicit imposition of content consistency on the
adapted target representation. Our unsupervised approach performs competitively
with other established approaches on depth estimation tasks and achieves
state-of-the-art results in a semi-supervised setting.
| cs.CV | supervised deep learning methods have shown promising results for the task of monocular depth estimation but acquiring ground truth is costly and prone to noise as well as inaccuracies while synthetic datasets have been used to circumvent above problems the resultant models do not generalize well to natural scenes due to the inherent domain shift recent adversarial approaches for domain adaption have performed well in mitigating the differences between the source and target domains but these methods are mostly limited to a classification setup and do not scale well for fullyconvolutional architectures in this work we propose adadepth an unsupervised domain adaptation strategy for the pixelwise regression task of monocular depth estimation the proposed approach is devoid of above limitations through a adversarial learning and b explicit imposition of content consistency on the adapted target representation our unsupervised approach performs competitively with other established approaches on depth estimation tasks and achieves stateoftheart results in a semisupervised setting | [['supervised', 'deep', 'learning', 'methods', 'have', 'shown', 'promising', 'results', 'for', 'the', 'task', 'of', 'monocular', 'depth', 'estimation', 'but', 'acquiring', 'ground', 'truth', 'is', 'costly', 'and', 'prone', 'to', 'noise', 'as', 'well', 'as', 'inaccuracies', 'while', 'synthetic', 'datasets', 'have', 'been', 'used', 'to', 'circumvent', 'above', 'problems', 'the', 'resultant', 'models', 'do', 'not', 'generalize', 'well', 'to', 'natural', 'scenes', 'due', 'to', 'the', 'inherent', 'domain', 'shift', 'recent', 'adversarial', 'approaches', 'for', 'domain', 'adaption', 'have', 'performed', 'well', 'in', 'mitigating', 'the', 'differences', 'between', 'the', 'source', 'and', 'target', 'domains', 'but', 'these', 'methods', 'are', 'mostly', 'limited', 'to', 'a', 'classification', 'setup', 'and', 'do', 'not', 'scale', 'well', 'for', 'fullyconvolutional', 'architectures', 'in', 'this', 'work', 'we', 'propose', 'adadepth', 'an', 'unsupervised', 'domain', 'adaptation', 'strategy', 'for', 'the', 'pixelwise', 'regression', 'task', 'of', 'monocular', 'depth', 'estimation', 'the', 'proposed', 'approach', 'is', 'devoid', 'of', 'above', 'limitations', 'through', 'a', 'adversarial', 'learning', 'and', 'b', 'explicit', 'imposition', 'of', 'content', 'consistency', 'on', 'the', 'adapted', 'target', 'representation', 'our', 'unsupervised', 'approach', 'performs', 'competitively', 'with', 'other', 'established', 'approaches', 'on', 'depth', 'estimation', 'tasks', 'and', 'achieves', 'stateoftheart', 'results', 'in', 'a', 'semisupervised', 'setting']] | [-0.0017459618535119658, -0.030153763115567226, -0.035763978790969424, 0.0815145792010485, -0.13579486380629718, -0.1979884033685383, 0.03544727924208228, 0.4987758969267209, -0.2438788655637883, -0.3675637169359013, 0.1007324299269105, -0.23559134667560172, -0.17460084630725667, 0.196359280382286, -0.20980146462217164, 0.13069487378099717, 0.14123796717598078, 0.03257145493392809, -0.0783478779067548, -0.2692481851629101, 0.29294898854165624, 0.03200372624138627, 0.376347286053575, 0.04605377186537506, 0.13850252474404465, -0.0348024934810849, -0.0456692513738138, -0.007600496721585305, -0.052885763362073936, 0.14937851735008642, 0.3384736147719685, 0.1718000824046799, 0.3131693199945566, -0.3924178214704928, -0.28809356572440803, 0.11234500945414393, 0.1852313918986907, 0.13566038344372197, -0.025325666110849198, -0.3766678308184521, 0.06523708193503225, -0.13150066740360136, 0.02299329519677812, -0.18321893823285323, -0.04174565344762344, -0.03476258048239964, -0.2956596459262073, 0.08685502821269135, 0.10226813321470474, 0.08442435208230446, -0.08773474743476328, -0.160636192584673, 0.07794491794312564, 0.18621529208329052, 0.05376519224134823, 0.07828034090403563, 0.1343665027137225, -0.20838785416130215, -0.15590098491893747, 0.34988268483310747, -0.05542384163858608, -0.25815647718114537, 0.2576040493963191, 0.004500493693810243, -0.14321821049237862, 0.07826717746912693, 0.20309474110082448, 0.15905781023693868, -0.11699669004137365, 0.05069288031238382, -0.010495978580692258, 0.16443331419484308, 0.04619795780178183, -0.005889138854213226, 0.1425302063677615, 0.2546685273185946, 0.07365321320666669, 0.10856904294408966, -0.15098676146067774, -0.06301545886060175, -0.20610173927464834, -0.03314867254215269, -0.21787826055422044, -0.06951947351197492, -0.051124295037227103, -0.1593003315761169, 0.3337662974432206, 0.24905998595297718, 0.22059600865945983, 0.1109372459960958, 0.41935064684217555, 0.0122093691107017, 0.1190376684912152, 0.06795981927112174, 0.2028336389182816, 0.03337451211588744, 0.14180090680355745, -0.17221966699640362, 0.10453249127469742, 0.023696211862186782] |
1,803.016 | Generalised monopole equations on Kahler surfaces | In this article, we establish a Hitchin-Kobayashi type correspondence for
generalised Seiberg-Witten monopole equations on Kahler surfaces. We show that
the "stability" criterion we obtain, for the existence of solutions, coincides
with that of the usual Seiberg-Witten monopole equations. This enables us to
construct a map from the moduli space of solutions to the generalised equations
to effective divisors.
| math-ph math.MP | in this article we establish a hitchinkobayashi type correspondence for generalised seibergwitten monopole equations on kahler surfaces we show that the stability criterion we obtain for the existence of solutions coincides with that of the usual seibergwitten monopole equations this enables us to construct a map from the moduli space of solutions to the generalised equations to effective divisors | [['in', 'this', 'article', 'we', 'establish', 'a', 'hitchinkobayashi', 'type', 'correspondence', 'for', 'generalised', 'seibergwitten', 'monopole', 'equations', 'on', 'kahler', 'surfaces', 'we', 'show', 'that', 'the', 'stability', 'criterion', 'we', 'obtain', 'for', 'the', 'existence', 'of', 'solutions', 'coincides', 'with', 'that', 'of', 'the', 'usual', 'seibergwitten', 'monopole', 'equations', 'this', 'enables', 'us', 'to', 'construct', 'a', 'map', 'from', 'the', 'moduli', 'space', 'of', 'solutions', 'to', 'the', 'generalised', 'equations', 'to', 'effective', 'divisors']] | [-0.17778611350488865, -0.0001390485045642166, -0.1654148436964379, 0.12396706514044713, -0.13456845106714863, -0.1090476589940362, 0.02288868648820888, 0.23789213575675325, -0.25643606007225433, -0.2291079352341466, 0.061229322237846585, -0.24824706463427362, -0.21191559353906472, 0.1683465780027337, -0.12887442689704692, 0.020521923899650574, 0.024798360653221607, 0.03337527822576842, -0.16739006966384032, -0.23785954821160285, 0.44564080711896137, -0.0595848540917544, 0.26382626760435307, 0.04229220369104612, 0.17440229460142723, -0.03891495622741848, 0.02784929445044974, 0.0002523548343668739, -0.23329900468081055, 0.1787348883384365, 0.2522350811099602, 0.06750174431067149, 0.11728796186083454, -0.39582371244491155, -0.18258279448343537, 0.17571925791769716, 0.13455684985018382, 0.1318890719903412, 0.005223149360725814, -0.27584668951330044, 0.10179786762948763, -0.1373460292342608, -0.2783117981280311, -0.15621638429051232, -0.013633032029463072, 0.03903233138370817, -0.25546073732045244, 0.020591555555426057, 0.04606860359909676, 0.01629194707246655, -0.15791277200678142, -0.012990640776263456, -0.045619689370110884, 0.05280033523469406, 0.07802725321676393, 0.017113748779993946, 0.018868857939427688, -0.12416986831448089, -0.07645332106089188, 0.33368531789756933, -0.14941088763712826, -0.27858159698987917, 0.13096970187152845, -0.09951716143701037, -0.1722059215860978, 0.11325818578065452, 0.10465936936532795, 0.19294098114310684, -0.11220523247779426, 0.17917230229635359, -0.08933437034740287, 0.1139995763709737, 0.12789679995848466, -0.03750211919136977, 0.16527990903705359, 0.06914775089313419, 0.13529951267449533, 0.17217057943344116, -0.01877550231056067, -0.1293634412241942, -0.3904132226134761, -0.21833982051871084, -0.05522960985584532, 0.1639873634834411, -0.1267953952458703, -0.21356984612263613, 0.39592977063098955, 0.12834035215299514, 0.17492366402204765, 0.13030406266008898, 0.18397695525407287, 0.11060540603821055, 0.02599834565515235, 0.025101114948422223, 0.24453727717874413, 0.21805024982066984, 0.08789864333220206, -0.20429116193899663, -0.12100076627270398, 0.28712167665046656] |
1,803.01601 | Quantum Algorithms to Matrix Multiplication | In this paper, we study quantum algorithms of matrix multiplication from the
viewpoint of inputting quantum/classical data to outputting quantum/classical
data. The main target is trying to overcome the input and output problem, which
are not easy to solve and many quantum algorithms will encounter, to study
matrix operations in quantum computer with high efficiency. And solving matrix
multiplication will be the first step. We propose three quantum algorithms to
matrix multiplication based on swap test, SVE and HHL. From the point of making
fewer assumptions, swap test method works the best than the other two. We also
show that the quantum algorithm of matrix multiplication with classical input
and output data by swap test achieves the best complexity
$\widetilde{O}(n^2/\epsilon)$ with no assumptions. This is proved by giving an
efficient quantum algorithm in polynomial time to solve the input problem, that
is to prepare the quantum states of the classical data efficiently. Other
contributions of this paper include: (1). Extending swap test to a more general
form that is suitable to deal with quantum data in parallel, which will have
further applications in other matrix operations. (2). Generalizing SVE
technique such that it applies to any matrix (not just Hermitian) directly only
with quantum data. (3). Proposing two new efficient quantum algorithms to
prepare quantum states of classical data, which solves the input problem
efficiently than other quantum algorithms.
| quant-ph | in this paper we study quantum algorithms of matrix multiplication from the viewpoint of inputting quantumclassical data to outputting quantumclassical data the main target is trying to overcome the input and output problem which are not easy to solve and many quantum algorithms will encounter to study matrix operations in quantum computer with high efficiency and solving matrix multiplication will be the first step we propose three quantum algorithms to matrix multiplication based on swap test sve and hhl from the point of making fewer assumptions swap test method works the best than the other two we also show that the quantum algorithm of matrix multiplication with classical input and output data by swap test achieves the best complexity widetildeon2epsilon with no assumptions this is proved by giving an efficient quantum algorithm in polynomial time to solve the input problem that is to prepare the quantum states of the classical data efficiently other contributions of this paper include 1 extending swap test to a more general form that is suitable to deal with quantum data in parallel which will have further applications in other matrix operations 2 generalizing sve technique such that it applies to any matrix not just hermitian directly only with quantum data 3 proposing two new efficient quantum algorithms to prepare quantum states of classical data which solves the input problem efficiently than other quantum algorithms | [['in', 'this', 'paper', 'we', 'study', 'quantum', 'algorithms', 'of', 'matrix', 'multiplication', 'from', 'the', 'viewpoint', 'of', 'inputting', 'quantumclassical', 'data', 'to', 'outputting', 'quantumclassical', 'data', 'the', 'main', 'target', 'is', 'trying', 'to', 'overcome', 'the', 'input', 'and', 'output', 'problem', 'which', 'are', 'not', 'easy', 'to', 'solve', 'and', 'many', 'quantum', 'algorithms', 'will', 'encounter', 'to', 'study', 'matrix', 'operations', 'in', 'quantum', 'computer', 'with', 'high', 'efficiency', 'and', 'solving', 'matrix', 'multiplication', 'will', 'be', 'the', 'first', 'step', 'we', 'propose', 'three', 'quantum', 'algorithms', 'to', 'matrix', 'multiplication', 'based', 'on', 'swap', 'test', 'sve', 'and', 'hhl', 'from', 'the', 'point', 'of', 'making', 'fewer', 'assumptions', 'swap', 'test', 'method', 'works', 'the', 'best', 'than', 'the', 'other', 'two', 'we', 'also', 'show', 'that', 'the', 'quantum', 'algorithm', 'of', 'matrix', 'multiplication', 'with', 'classical', 'input', 'and', 'output', 'data', 'by', 'swap', 'test', 'achieves', 'the', 'best', 'complexity', 'widetildeon2epsilon', 'with', 'no', 'assumptions', 'this', 'is', 'proved', 'by', 'giving', 'an', 'efficient', 'quantum', 'algorithm', 'in', 'polynomial', 'time', 'to', 'solve', 'the', 'input', 'problem', 'that', 'is', 'to', 'prepare', 'the', 'quantum', 'states', 'of', 'the', 'classical', 'data', 'efficiently', 'other', 'contributions', 'of', 'this', 'paper', 'include', '1', 'extending', 'swap', 'test', 'to', 'a', 'more', 'general', 'form', 'that', 'is', 'suitable', 'to', 'deal', 'with', 'quantum', 'data', 'in', 'parallel', 'which', 'will', 'have', 'further', 'applications', 'in', 'other', 'matrix', 'operations', '2', 'generalizing', 'sve', 'technique', 'such', 'that', 'it', 'applies', 'to', 'any', 'matrix', 'not', 'just', 'hermitian', 'directly', 'only', 'with', 'quantum', 'data', '3', 'proposing', 'two', 'new', 'efficient', 'quantum', 'algorithms', 'to', 'prepare', 'quantum', 'states', 'of', 'classical', 'data', 'which', 'solves', 'the', 'input', 'problem', 'efficiently', 'than', 'other', 'quantum', 'algorithms']] | [-0.05144162607795902, 0.09463202883853228, -0.0820749512906268, 0.06706491870072409, -0.087623112316227, -0.2256846843315942, 0.041487982352631854, 0.38330337542043835, -0.31377727362703073, -0.32895478923404753, 0.11169056835422995, -0.24099408323940893, -0.16348624221363775, 0.23519499309099556, -0.09400353588678531, 0.13258160982411682, 0.1057638088128889, 0.02999642811584891, -0.10498762763873265, -0.3086612641059777, 0.3010671162312001, 0.03998995584072219, 0.24934639301347106, -0.0070754290209151804, 0.08927708478560753, 0.0035951946966203026, -0.015245013257586643, -0.037676375737136, -0.05420579803505557, 0.13555171602434202, 0.29609379664537283, 0.1995722572829803, 0.2762928898854737, -0.46271864555187914, -0.15164420553973237, 0.11957556362725436, 0.10164026058127842, 0.15601104177716352, -0.029448563637216513, -0.2565360710549724, 0.10273195521113578, -0.12875503737948174, -0.07100135706397787, -0.09635786665092926, -0.025932808480176487, -0.05127241341611616, -0.28635265384371833, 0.012512194516475256, 0.06010265095290123, -0.010046509997265642, 0.017751949710624392, -0.10042401032548871, 0.10322789333989485, 0.1170190389987016, -0.031876294120018814, 0.03986948437625216, 0.1115496746476805, -0.09418861503128714, -0.1992826246158138, 0.3815049016929902, -0.018062455161590038, -0.2185910935452404, 0.15685368317951398, -0.0944113256756968, -0.1381736407740646, 0.07999125746356552, 0.14496500362139686, 0.10356565599399721, -0.14115595211797768, 0.09068939225261075, -0.029673790220138534, 0.1740530322576728, 0.04875944018682563, 0.020578460320074668, 0.0996726690178835, 0.10259093532518468, 0.1087684304999257, 0.1574958430224286, -0.04996521154233753, -0.16235628681106232, -0.24892580497186845, -0.18568195978163235, -0.23838928132726436, 0.05265684412363937, -0.07370856544379453, -0.1530683880984342, 0.3829385136660564, 0.20803664294873128, 0.1971822541305109, 0.052677222703718336, 0.35157881781311806, 0.1095951198918843, 0.07109633592958026, 0.11378769022657682, 0.17407278074952365, 0.12275050101973313, 0.0680078466163985, -0.1988522482937888, 0.03891607048296321, 0.0552051000954714] |
1,803.01602 | Feedback control of the acoustic pressure in ultrasonic wave propagation | Classical models for the propagation of ultrasound waves are the Westervelt
equation, the Kuznetsov and the Khokhlov-Zabolotskaya-Kuznetsov equations. The
Jordan-Moore-Gibson-Thompson equation is a prominent example of a Partial
Differential Equation (PDE) model which describes the acoustic velocity
potential in ultrasound wave propagation, where the paradox of infinite speed
of propagation of thermal signals is eliminated; the use of the constitutive
Cattaneo law for the heat flux, in place of the Fourier law, accounts for its
being of third order in time. Aiming at the understanding of the fully
quasilinear PDE, a great deal of attention has been recently devoted to its
linearization -- referred to in the literature as the Moore-Gibson-Thompson
equation -- whose mathematical analysis is also of independent interest, posing
already several questions and challenges. In this work we consider and solve a
quadratic control problem associated with the linear equation, formulated
consistently with the goal of keeping the acoustic pressure close to a
reference pressure during ultrasound excitation, as required in medical and
industrial applications. While optimal control problems with smooth controls
have been considered in the recent literature, we aim at relying on controls
which are just $L^2$ in time; this leads to a singular control problem and to
non-standard Riccati equations. In spite of the unfavourable combination of the
semigroup describing the free dynamics that is not analytic, with the
challenging pattern displayed by the dynamics subject to boundary control, a
feedback synthesis of the optimal control as well as well-posedness of operator
Riccati equations are established.
| math.OC math.AP | classical models for the propagation of ultrasound waves are the westervelt equation the kuznetsov and the khokhlovzabolotskayakuznetsov equations the jordanmooregibsonthompson equation is a prominent example of a partial differential equation pde model which describes the acoustic velocity potential in ultrasound wave propagation where the paradox of infinite speed of propagation of thermal signals is eliminated the use of the constitutive cattaneo law for the heat flux in place of the fourier law accounts for its being of third order in time aiming at the understanding of the fully quasilinear pde a great deal of attention has been recently devoted to its linearization referred to in the literature as the mooregibsonthompson equation whose mathematical analysis is also of independent interest posing already several questions and challenges in this work we consider and solve a quadratic control problem associated with the linear equation formulated consistently with the goal of keeping the acoustic pressure close to a reference pressure during ultrasound excitation as required in medical and industrial applications while optimal control problems with smooth controls have been considered in the recent literature we aim at relying on controls which are just l2 in time this leads to a singular control problem and to nonstandard riccati equations in spite of the unfavourable combination of the semigroup describing the free dynamics that is not analytic with the challenging pattern displayed by the dynamics subject to boundary control a feedback synthesis of the optimal control as well as wellposedness of operator riccati equations are established | [['classical', 'models', 'for', 'the', 'propagation', 'of', 'ultrasound', 'waves', 'are', 'the', 'westervelt', 'equation', 'the', 'kuznetsov', 'and', 'the', 'khokhlovzabolotskayakuznetsov', 'equations', 'the', 'jordanmooregibsonthompson', 'equation', 'is', 'a', 'prominent', 'example', 'of', 'a', 'partial', 'differential', 'equation', 'pde', 'model', 'which', 'describes', 'the', 'acoustic', 'velocity', 'potential', 'in', 'ultrasound', 'wave', 'propagation', 'where', 'the', 'paradox', 'of', 'infinite', 'speed', 'of', 'propagation', 'of', 'thermal', 'signals', 'is', 'eliminated', 'the', 'use', 'of', 'the', 'constitutive', 'cattaneo', 'law', 'for', 'the', 'heat', 'flux', 'in', 'place', 'of', 'the', 'fourier', 'law', 'accounts', 'for', 'its', 'being', 'of', 'third', 'order', 'in', 'time', 'aiming', 'at', 'the', 'understanding', 'of', 'the', 'fully', 'quasilinear', 'pde', 'a', 'great', 'deal', 'of', 'attention', 'has', 'been', 'recently', 'devoted', 'to', 'its', 'linearization', 'referred', 'to', 'in', 'the', 'literature', 'as', 'the', 'mooregibsonthompson', 'equation', 'whose', 'mathematical', 'analysis', 'is', 'also', 'of', 'independent', 'interest', 'posing', 'already', 'several', 'questions', 'and', 'challenges', 'in', 'this', 'work', 'we', 'consider', 'and', 'solve', 'a', 'quadratic', 'control', 'problem', 'associated', 'with', 'the', 'linear', 'equation', 'formulated', 'consistently', 'with', 'the', 'goal', 'of', 'keeping', 'the', 'acoustic', 'pressure', 'close', 'to', 'a', 'reference', 'pressure', 'during', 'ultrasound', 'excitation', 'as', 'required', 'in', 'medical', 'and', 'industrial', 'applications', 'while', 'optimal', 'control', 'problems', 'with', 'smooth', 'controls', 'have', 'been', 'considered', 'in', 'the', 'recent', 'literature', 'we', 'aim', 'at', 'relying', 'on', 'controls', 'which', 'are', 'just', 'l2', 'in', 'time', 'this', 'leads', 'to', 'a', 'singular', 'control', 'problem', 'and', 'to', 'nonstandard', 'riccati', 'equations', 'in', 'spite', 'of', 'the', 'unfavourable', 'combination', 'of', 'the', 'semigroup', 'describing', 'the', 'free', 'dynamics', 'that', 'is', 'not', 'analytic', 'with', 'the', 'challenging', 'pattern', 'displayed', 'by', 'the', 'dynamics', 'subject', 'to', 'boundary', 'control', 'a', 'feedback', 'synthesis', 'of', 'the', 'optimal', 'control', 'as', 'well', 'as', 'wellposedness', 'of', 'operator', 'riccati', 'equations', 'are', 'established']] | [-0.12056605236613259, 0.05928213448796962, -0.06030926260639042, 0.03119814431298554, -0.12235818176733089, -0.1171766629108348, -0.007941997999648353, 0.298445345003969, -0.3080310931545682, -0.28183862251124436, 0.1577767844979873, -0.27913952487212934, -0.14454910919565947, 0.2182718183696946, -0.06744685879206255, 0.1413472178781728, 0.01620584044271269, 0.05549393459917947, -0.041598689941418986, -0.1966323277907401, 0.3101575315053079, 0.0341159597775268, 0.26689779497927146, 0.02473950294417239, 0.16126329130342892, -0.010468944990744574, -0.04256732276131046, -0.004163962841923949, -0.11326554567603447, 0.09129281847215738, 0.28542725648045936, 0.06972335568541659, 0.32731563008142517, -0.4511564893858327, -0.2741435033902, 0.08234445961011995, 0.1342035576099372, 0.12296075548510998, -0.05608367197067222, -0.2651963061991058, 0.04812055616592613, -0.11491799534245904, -0.1776440653465538, -0.02228436466576832, 0.013469208805491366, 0.04817768446537963, -0.2441319316276349, 0.12141433773238884, 0.062011915178793, 0.03654784851953023, -0.12035380783509614, -0.06168384346998327, -0.016956786165997807, 0.09785938108313619, 0.06834325804037132, 0.011692310664183159, 0.06312749252021839, -0.15336064762818896, -0.08751624131447545, 0.40420037473555687, -0.05109589334977265, -0.23683719945538248, 0.15823676890595967, -0.12162148240954153, -0.09352101214678823, 0.13502788428787985, 0.1921904958059801, 0.12729755331765186, -0.18290539049062757, 0.10713636002295854, -0.014964087072404519, 0.13630410171190893, 0.06695168509501062, -0.013796494209072403, 0.1347359024070864, 0.18557307192860473, 0.06974078356776567, 0.13635825095210044, -0.016949620428579604, -0.12332065101157152, -0.29877087837737615, -0.12422777895933963, -0.12655613898119378, 0.041540375583281275, -0.05185696124475902, -0.17015160203370597, 0.39494322548665467, 0.15130496472592048, 0.161889563622554, 0.013764342164523118, 0.2929393160344672, 0.19124757163339265, 0.03327047835867439, 0.04359456159610061, 0.24549399555243942, 0.18468917134469526, 0.16407169167594535, -0.25792384634616844, 0.08325407229929097, 0.07963847994969617] |
1,803.01603 | Core Partitions With d-Distinct Parts | In this paper, we study $(s,s+1)$-core partitions with $d$-distinct parts. We
obtain results on the number and the largest size of such partitions, so we
extend Xiong's paper in which the results are obtained about $(s,s+1)$-core
partitions with distinct parts. Also, we propose a conjecture about
$(s,s+r)$-core partitions with $d$-distinct parts for $1 \le r \le d$.
| math.CO math.NT | in this paper we study ss1core partitions with ddistinct parts we obtain results on the number and the largest size of such partitions so we extend xiongs paper in which the results are obtained about ss1core partitions with distinct parts also we propose a conjecture about ssrcore partitions with ddistinct parts for 1 le r le d | [['in', 'this', 'paper', 'we', 'study', 'ss1core', 'partitions', 'with', 'ddistinct', 'parts', 'we', 'obtain', 'results', 'on', 'the', 'number', 'and', 'the', 'largest', 'size', 'of', 'such', 'partitions', 'so', 'we', 'extend', 'xiongs', 'paper', 'in', 'which', 'the', 'results', 'are', 'obtained', 'about', 'ss1core', 'partitions', 'with', 'distinct', 'parts', 'also', 'we', 'propose', 'a', 'conjecture', 'about', 'ssrcore', 'partitions', 'with', 'ddistinct', 'parts', 'for', '1', 'le', 'r', 'le', 'd']] | [-0.14197545728114033, 0.11090247850266419, -0.06011267868702167, -0.0010406815417809412, -0.0403738104671772, -0.04841130488784984, 0.022816945736329735, 0.31226248533598017, -0.21542423344882472, -0.3233481171274824, 0.07820653421055924, -0.3283853115738436, -0.15190431066522642, 0.13641065553695494, -0.08678981749108061, -0.030337078605693284, 0.040199383444684954, 0.012280443550220557, -0.027440172536963865, -0.2843380417408688, 0.34414345013958936, -0.05792827727938337, 0.14886234594242914, 0.052887873125395606, 0.04870552033285743, 0.0427115260307411, -0.048342561906403195, 0.05147206746707005, -0.2668296986625397, 0.1340377851904902, 0.2415346433574866, 0.16115816967794672, 0.23649603567485297, -0.36211771729202674, -0.06819187896741953, 0.14549754595749878, 0.1928767381718249, 0.052406413819491196, 0.011642998955461994, -0.254194775059919, 0.17534204061874853, -0.13737340510955878, -0.09777365074426468, -0.02803408063482493, 0.06826090154105, 0.023270845009912073, -0.2961939532875216, 0.015763392355438555, 0.0967243833833241, 0.06063987461051771, -0.03535505642815094, -0.247267597321687, 0.06326459886206846, 0.11388805393861341, 0.01742089421687914, -0.013975465266932068, -0.008223010310237961, -0.06426197192714815, -0.10511841224173882, 0.28128488681146074, 0.03538255438408149, -0.20138504030182958, 0.15131752099426063, -0.20541826672186808, -0.2147372796815554, 0.04975604829711041, 0.13931086067376391, 0.15505981611620104, -0.0231809044489637, 0.096660986250624, -0.15328171414356412, 0.1787866355818031, 0.14110002938624738, 0.02050328510813415, 0.13632859036858594, 0.1097193946396666, 0.05342457806649951, 0.22025773659281964, -0.05831976014555299, -0.015372365164304418, -0.3063873052597046, -0.18480648501177452, -0.1839781752953838, 0.04543814927871738, -0.11636857788185548, -0.10844131479305881, 0.3910597903055272, 0.1796739684318059, 0.26232912078765885, 0.16234465574754203, 0.23123293253593147, 0.04393828319319125, 0.03878380241803825, 0.10924376033446086, 0.07745819671046254, 0.1034287780390254, 0.037730020113355876, -0.1008071242166417, 0.005818788070298199, 0.11456402441087578] |
1,803.01604 | Integrated Plasmonics: Broadband Dirac Plasmons in Borophene | The past decade has witnessed numerous discoveries of two-dimensional (2D)
semimetals and insulators, whereas 2D metals are rarely identified. Borophene,
a monolayer boron sheet, has recently emerged as a perfect 2D metal with unique
structure and electronic properties. Here we study collective excitations in
borophene, which exhibit two major plasmon modes with low damping rates
extending from infrared to ultraviolet regime. The anisotropic 1D plasmon
originates from electronic excitations of tilted Dirac cones in borophene,
analogous to that in heavily doped Dirac semimetals. These features make
borophene promising to realize directional polariton transportation and
broadband optical communications for next-generation optoelectronic devices.
| cond-mat.mtrl-sci cond-mat.mes-hall | the past decade has witnessed numerous discoveries of twodimensional 2d semimetals and insulators whereas 2d metals are rarely identified borophene a monolayer boron sheet has recently emerged as a perfect 2d metal with unique structure and electronic properties here we study collective excitations in borophene which exhibit two major plasmon modes with low damping rates extending from infrared to ultraviolet regime the anisotropic 1d plasmon originates from electronic excitations of tilted dirac cones in borophene analogous to that in heavily doped dirac semimetals these features make borophene promising to realize directional polariton transportation and broadband optical communications for nextgeneration optoelectronic devices | [['the', 'past', 'decade', 'has', 'witnessed', 'numerous', 'discoveries', 'of', 'twodimensional', '2d', 'semimetals', 'and', 'insulators', 'whereas', '2d', 'metals', 'are', 'rarely', 'identified', 'borophene', 'a', 'monolayer', 'boron', 'sheet', 'has', 'recently', 'emerged', 'as', 'a', 'perfect', '2d', 'metal', 'with', 'unique', 'structure', 'and', 'electronic', 'properties', 'here', 'we', 'study', 'collective', 'excitations', 'in', 'borophene', 'which', 'exhibit', 'two', 'major', 'plasmon', 'modes', 'with', 'low', 'damping', 'rates', 'extending', 'from', 'infrared', 'to', 'ultraviolet', 'regime', 'the', 'anisotropic', '1d', 'plasmon', 'originates', 'from', 'electronic', 'excitations', 'of', 'tilted', 'dirac', 'cones', 'in', 'borophene', 'analogous', 'to', 'that', 'in', 'heavily', 'doped', 'dirac', 'semimetals', 'these', 'features', 'make', 'borophene', 'promising', 'to', 'realize', 'directional', 'polariton', 'transportation', 'and', 'broadband', 'optical', 'communications', 'for', 'nextgeneration', 'optoelectronic', 'devices']] | [-0.16592696189216458, 0.16647152780638177, -0.02571381424267841, -0.040772363915232625, -0.07838130878090932, -0.24139766405235127, 0.03998420009444846, 0.4804481745208844, -0.24761576740310923, -0.21833737240643195, -0.02969173139242437, -0.3911383830767014, -0.25846052684563, 0.21432640369852432, 0.027966660147735682, 0.08820416436226357, -0.02415610332558356, -0.18592908391886764, -0.067707046467608, -0.15969040850407934, 0.23311538909017893, 0.024318292448850403, 0.40540918106176327, 0.05392912399982757, -0.007664981233601523, -0.050031233929318956, 0.12658967875810986, 0.002271020453017537, -0.1665553170107772, 0.10824210705762351, 0.3014641728754718, -0.1925056955343721, 0.22629333240565577, -0.4803683008851096, -0.301213926912313, -0.01842004311556863, 0.20287843380990153, 0.15491850007818736, -0.168093345257094, -0.29410024895332754, 0.04052016876250653, -0.1492038424735391, -0.1575706673272837, -0.09859266938955182, 0.005533913714064304, -0.03431243802383911, -0.1292136744256039, 0.06678092057844347, -0.013008300408647202, 0.07509846118276496, -0.09239033187493466, -0.1424111262941272, -0.15607792654047065, 0.024573279877820303, 0.052891147890045204, -0.03777033657453364, 0.13861627422393033, -0.15809590378683983, -0.16276369960333156, 0.4413443747077986, -0.045736263561440574, -0.02041705279140779, 0.22361817698012854, -0.19180318023456205, -0.07217138667249738, 0.1667851371792062, 0.16083320313349994, 0.06494824875994484, -0.13460380037252948, 0.08317231888609643, -0.07077135807272084, 0.07962206099182367, 0.05772003628737708, 0.24562861339308986, 0.34652340277513066, 0.19944376801832184, 0.03846374134611486, 0.08144595576300387, -0.10485917973069309, 0.0282066441187174, -0.09338871852522439, -0.22528215913599967, -0.23590822848906318, 0.1225156679860141, -0.0008389722669121376, -0.2637924898673992, 0.4632083501408596, 0.10145672453143219, 0.11566082535929388, -0.1219086823789034, 0.2169459173824675, 0.09263810355303864, 0.1129777337387573, 0.04459917433283264, 0.34506656035854677, 0.1710754915182064, 0.1482432604177237, -0.18289399144728438, -0.020992963454953516, 0.005828476498263086] |
1,803.01605 | Weak metal-metal transition in the vanadium oxytelluride
Rb$_{1-\delta}$V$_2$Te$_2$O | We report the synthesis, crystal structure, physical properties, and
first-principles calculations of a vanadium-based oxytelluride
Rb$_{1-\delta}$V$_2$Te$_2$O ($\delta\approx0.2$). The crystal structure bears
two-dimensional V$_2$O square nets sandwiched with tellurium layers, mimicking
the structural motifs of cuprate and iron-based superconductors. The material
exhibits metallic conductivity with dominant hole-type charge carriers. A weak
metal-to-metal transition takes place at $\sim$100 K, which is conformably
characterized by a slight kink/hump in the electrical resistivity, jumps in the
Hall and Seebeck coefficients, a minute drop in the magnetic susceptibility,
and a small peak in the heat capacity. Neither Bragg-peak splitting nor
superlattice reflections can be detected within the resolution of conventional
x-ray diffractions. The band-structure calculations show that V-3$d$ orbitals
dominate the electronic states at around Fermi energy where a $d_{yz}/d_{xz}$
orbital polarization shows up. There are three Fermi-surface sheets that seem
unfavorable for nesting. Our results suggest an orbital or spin-density-wave
order for the low-temperature state and, upon suppression of the competing
order, emergence of superconductivity could be expected.
| cond-mat.supr-con cond-mat.str-el | we report the synthesis crystal structure physical properties and firstprinciples calculations of a vanadiumbased oxytelluride rb_1deltav_2te_2o deltaapprox02 the crystal structure bears twodimensional v_2o square nets sandwiched with tellurium layers mimicking the structural motifs of cuprate and ironbased superconductors the material exhibits metallic conductivity with dominant holetype charge carriers a weak metaltometal transition takes place at sim100 k which is conformably characterized by a slight kinkhump in the electrical resistivity jumps in the hall and seebeck coefficients a minute drop in the magnetic susceptibility and a small peak in the heat capacity neither braggpeak splitting nor superlattice reflections can be detected within the resolution of conventional xray diffractions the bandstructure calculations show that v3d orbitals dominate the electronic states at around fermi energy where a d_yzd_xz orbital polarization shows up there are three fermisurface sheets that seem unfavorable for nesting our results suggest an orbital or spindensitywave order for the lowtemperature state and upon suppression of the competing order emergence of superconductivity could be expected | [['we', 'report', 'the', 'synthesis', 'crystal', 'structure', 'physical', 'properties', 'and', 'firstprinciples', 'calculations', 'of', 'a', 'vanadiumbased', 'oxytelluride', 'rb_1deltav_2te_2o', 'deltaapprox02', 'the', 'crystal', 'structure', 'bears', 'twodimensional', 'v_2o', 'square', 'nets', 'sandwiched', 'with', 'tellurium', 'layers', 'mimicking', 'the', 'structural', 'motifs', 'of', 'cuprate', 'and', 'ironbased', 'superconductors', 'the', 'material', 'exhibits', 'metallic', 'conductivity', 'with', 'dominant', 'holetype', 'charge', 'carriers', 'a', 'weak', 'metaltometal', 'transition', 'takes', 'place', 'at', 'sim100', 'k', 'which', 'is', 'conformably', 'characterized', 'by', 'a', 'slight', 'kinkhump', 'in', 'the', 'electrical', 'resistivity', 'jumps', 'in', 'the', 'hall', 'and', 'seebeck', 'coefficients', 'a', 'minute', 'drop', 'in', 'the', 'magnetic', 'susceptibility', 'and', 'a', 'small', 'peak', 'in', 'the', 'heat', 'capacity', 'neither', 'braggpeak', 'splitting', 'nor', 'superlattice', 'reflections', 'can', 'be', 'detected', 'within', 'the', 'resolution', 'of', 'conventional', 'xray', 'diffractions', 'the', 'bandstructure', 'calculations', 'show', 'that', 'v3d', 'orbitals', 'dominate', 'the', 'electronic', 'states', 'at', 'around', 'fermi', 'energy', 'where', 'a', 'd_yzd_xz', 'orbital', 'polarization', 'shows', 'up', 'there', 'are', 'three', 'fermisurface', 'sheets', 'that', 'seem', 'unfavorable', 'for', 'nesting', 'our', 'results', 'suggest', 'an', 'orbital', 'or', 'spindensitywave', 'order', 'for', 'the', 'lowtemperature', 'state', 'and', 'upon', 'suppression', 'of', 'the', 'competing', 'order', 'emergence', 'of', 'superconductivity', 'could', 'be', 'expected']] | [-0.21218430942301697, 0.20587717195948116, -0.03457442022524067, 0.014658235723028974, -0.0459813877624825, -0.1260821488803795, 0.12296792345646108, 0.37875586405361095, -0.27309968787882055, -0.2653560187620453, -0.01482307377177043, -0.36974476863736216, -0.11284013988179024, 0.1571782505687892, 0.054287266071673626, -0.012593445564976442, -0.021299871180613255, -0.04362758663718742, -0.1534949634165232, -0.1884391582047838, 0.2731926500814955, 0.03846279218869543, 0.31175981942399206, 0.10115987541230655, 0.037406638901256305, -0.02719400132139791, 0.13947112045745966, 0.03823497780610489, -0.1291711889064607, 0.03383146283987473, 0.2861064058917138, -0.14955149411777907, 0.1667115409546119, -0.4517809234712792, -0.22979706764601382, -0.038845823047670855, 0.10087592395676795, 0.10980250615894771, -0.06511216846742679, -0.2426666613149492, 0.05319386363564401, -0.13248144761553104, -0.09601057987421445, -0.11916533107147258, -0.05635759096203631, -0.025034801996183357, -0.21741479538938124, 0.1439554490608788, 0.08015353399582349, 0.1070079036288905, -0.12714720036704802, -0.15177430572712874, -0.09275485905288142, 0.006783725111745298, 0.04039368704639234, 0.05462373779273203, 0.15530048091483267, -0.10149626246848013, -0.12146353433232848, 0.36608651215564225, -0.02313884422978787, -0.028454134769773088, 0.14555744355974742, -0.23844827068792773, -0.07787810052436323, 0.22659840520332816, 0.07486587548495824, 0.049434502278985104, -0.09991860505277468, 0.05769479374771148, -0.013318632619751653, 0.22470463993900183, 0.06294637769048067, 0.09336711366106815, 0.289461565590051, 0.19741665211851014, 0.026828519249912586, 0.11375031718111868, -0.17393320133317192, -0.029144405972365808, -0.21225774838424089, -0.17454312459412444, -0.20822580116712547, 0.07894944060029081, -0.08744354793885531, -0.21332242190719972, 0.3985470651878822, 0.09535706010823951, 0.18594189170899778, -0.07931774854438993, 0.2029541770100912, 0.10699048380903853, 0.11919425148737935, 0.07562932371909, 0.23687043845730163, 0.1578448211959905, 0.11941766108775252, -0.31048635561962296, 0.13531045090477867, 0.007263403438927629] |
1,803.01606 | Formation Shape Control Based on Distance Measurements Using Lie Bracket
Approximations | We study the problem of distance-based formation control in autonomous
multi-agent systems in which only distance measurements are available. This
means that the target formations as well as the sensed variables are both
determined by distances. We propose a fully distributed distance-only control
law, which requires neither a time synchronization of the agents nor storage of
measured data. The approach is applicable to point agents in the Euclidean
space of arbitrary dimension. Under the assumption of infinitesimal rigidity of
the target formations, we show that the proposed control law induces local
uniform asymptotic stability. Our approach involves sinusoidal perturbations in
order to extract information about the negative gradient direction of each
agent's local potential function. An averaging analysis reveals that the
gradient information originates from an approximation of Lie brackets of
certain vector fields. The method is based on a recently introduced approach to
the problem of extremum seeking control. We discuss the relation in the paper.
| math.DS | we study the problem of distancebased formation control in autonomous multiagent systems in which only distance measurements are available this means that the target formations as well as the sensed variables are both determined by distances we propose a fully distributed distanceonly control law which requires neither a time synchronization of the agents nor storage of measured data the approach is applicable to point agents in the euclidean space of arbitrary dimension under the assumption of infinitesimal rigidity of the target formations we show that the proposed control law induces local uniform asymptotic stability our approach involves sinusoidal perturbations in order to extract information about the negative gradient direction of each agents local potential function an averaging analysis reveals that the gradient information originates from an approximation of lie brackets of certain vector fields the method is based on a recently introduced approach to the problem of extremum seeking control we discuss the relation in the paper | [['we', 'study', 'the', 'problem', 'of', 'distancebased', 'formation', 'control', 'in', 'autonomous', 'multiagent', 'systems', 'in', 'which', 'only', 'distance', 'measurements', 'are', 'available', 'this', 'means', 'that', 'the', 'target', 'formations', 'as', 'well', 'as', 'the', 'sensed', 'variables', 'are', 'both', 'determined', 'by', 'distances', 'we', 'propose', 'a', 'fully', 'distributed', 'distanceonly', 'control', 'law', 'which', 'requires', 'neither', 'a', 'time', 'synchronization', 'of', 'the', 'agents', 'nor', 'storage', 'of', 'measured', 'data', 'the', 'approach', 'is', 'applicable', 'to', 'point', 'agents', 'in', 'the', 'euclidean', 'space', 'of', 'arbitrary', 'dimension', 'under', 'the', 'assumption', 'of', 'infinitesimal', 'rigidity', 'of', 'the', 'target', 'formations', 'we', 'show', 'that', 'the', 'proposed', 'control', 'law', 'induces', 'local', 'uniform', 'asymptotic', 'stability', 'our', 'approach', 'involves', 'sinusoidal', 'perturbations', 'in', 'order', 'to', 'extract', 'information', 'about', 'the', 'negative', 'gradient', 'direction', 'of', 'each', 'agents', 'local', 'potential', 'function', 'an', 'averaging', 'analysis', 'reveals', 'that', 'the', 'gradient', 'information', 'originates', 'from', 'an', 'approximation', 'of', 'lie', 'brackets', 'of', 'certain', 'vector', 'fields', 'the', 'method', 'is', 'based', 'on', 'a', 'recently', 'introduced', 'approach', 'to', 'the', 'problem', 'of', 'extremum', 'seeking', 'control', 'we', 'discuss', 'the', 'relation', 'in', 'the', 'paper']] | [-0.17843549374648915, 0.06544053029127354, -0.113734477881793, 0.030959273748556566, -0.07979925408971253, -0.11260493718692736, 0.053662377545331263, 0.36987710664653856, -0.31886182599671326, -0.29322261622051005, 0.09532871708247194, -0.23257689173244367, -0.17216696310195195, 0.14101887128914997, -0.08446377581044746, 0.05689354499232522, 0.01230111874634056, 0.0817197822034359, -0.04899000565248547, -0.22891891984102927, 0.32690421203047537, 0.03344889317941704, 0.30744022783485186, -0.006885311894406487, 0.15912108982328896, 0.05162347735433727, -0.03188364068046212, 0.044773897586003315, -0.11478740732929081, 0.1523468366388089, 0.23359814327783737, 0.12595902675552187, 0.2891359621967385, -0.4025769110258882, -0.2196020808925105, 0.12183704912354043, 0.1217401110193437, 0.10951508730383008, -0.04840992195131316, -0.28438175534888815, 0.09069753784662599, -0.12872341747698227, -0.14117466344996385, -0.08072031951349252, -0.006174584743893071, 0.06377434366750442, -0.28793071296991435, 0.08713580333111677, 0.08484693055165707, 0.06581205541600182, -0.12932177068618167, -0.04904840427456768, -0.0050708370306974, 0.14151439648477515, 0.031662380708393396, 0.023285238603189304, 0.16213942179752952, -0.09359132330775688, -0.12363931407839071, 0.37154864790036707, -0.041328898525743445, -0.20799104873870297, 0.14990633719149907, -0.10672749793690861, -0.10435908836472756, 0.08399949836467577, 0.19323239979114692, 0.1588938190422138, -0.1854540332084059, 0.0887696155418114, -0.028351447242460432, 0.16618539517612646, 0.0345083776991933, 0.013486625279661766, 0.15223486786174356, 0.15526033752259744, 0.1666051610046701, 0.12269242647308619, -0.07616022021130059, -0.15127115826579227, -0.30753576525955634, -0.10659276391527835, -0.19336626044575386, 0.021589502609452783, -0.09806238097556909, -0.1464408770512054, 0.3609421779105001, 0.15445856919666384, 0.20881840149177963, 0.060784176282679576, 0.3028909788796216, 0.113141352116504, 0.06484098632814018, 0.09160136863304551, 0.2326918064919152, 0.13550557088474655, 0.09116457958533696, -0.2235676217030817, 0.09753432185062842, 0.06272733604215133] |
1,803.01607 | Three-dimensional structure of the Upper Scorpius association with the
Gaia first data release | Using new proper motion data from recently published catalogs, we revisit the
membership of previously identified members of the Upper Scorpius association.
We confirmed 750 of them as cluster members based on the convergent point
method, compute their kinematic parallaxes and combined them with Gaia
parallaxes to investigate the 3D structure and geometry of the association
using a robust covariance method. We find a mean distance of $146\pm 3\pm 6$~pc
and show that the morphology of the association defined by the brightest (and
most massive) stars yields a prolate ellipsoid with dimensions of
$74\times38\times32$~pc$^{3}$, while the faintest cluster members define a more
elongated structure with dimensions of $98\times24\times18$~pc$^{3}$. We
suggest that the different properties of both populations is an imprint of the
star formation history in this region.
| astro-ph.SR | using new proper motion data from recently published catalogs we revisit the membership of previously identified members of the upper scorpius association we confirmed 750 of them as cluster members based on the convergent point method compute their kinematic parallaxes and combined them with gaia parallaxes to investigate the 3d structure and geometry of the association using a robust covariance method we find a mean distance of 146pm 3pm 6pc and show that the morphology of the association defined by the brightest and most massive stars yields a prolate ellipsoid with dimensions of 74times38times32pc3 while the faintest cluster members define a more elongated structure with dimensions of 98times24times18pc3 we suggest that the different properties of both populations is an imprint of the star formation history in this region | [['using', 'new', 'proper', 'motion', 'data', 'from', 'recently', 'published', 'catalogs', 'we', 'revisit', 'the', 'membership', 'of', 'previously', 'identified', 'members', 'of', 'the', 'upper', 'scorpius', 'association', 'we', 'confirmed', '750', 'of', 'them', 'as', 'cluster', 'members', 'based', 'on', 'the', 'convergent', 'point', 'method', 'compute', 'their', 'kinematic', 'parallaxes', 'and', 'combined', 'them', 'with', 'gaia', 'parallaxes', 'to', 'investigate', 'the', '3d', 'structure', 'and', 'geometry', 'of', 'the', 'association', 'using', 'a', 'robust', 'covariance', 'method', 'we', 'find', 'a', 'mean', 'distance', 'of', '146pm', '3pm', '6pc', 'and', 'show', 'that', 'the', 'morphology', 'of', 'the', 'association', 'defined', 'by', 'the', 'brightest', 'and', 'most', 'massive', 'stars', 'yields', 'a', 'prolate', 'ellipsoid', 'with', 'dimensions', 'of', '74times38times32pc3', 'while', 'the', 'faintest', 'cluster', 'members', 'define', 'a', 'more', 'elongated', 'structure', 'with', 'dimensions', 'of', '98times24times18pc3', 'we', 'suggest', 'that', 'the', 'different', 'properties', 'of', 'both', 'populations', 'is', 'an', 'imprint', 'of', 'the', 'star', 'formation', 'history', 'in', 'this', 'region']] | [-0.07771707975420185, 0.047496941412862814, -0.12047745912550165, 0.07897393670790488, -0.11731042943170501, -0.04171266914567068, 0.09891778077733415, 0.4186843820581479, -0.20609505851623705, -0.3355262427191649, 0.05813137720993143, -0.2637502055703884, -0.08866930859429496, 0.1712967339341366, -0.03179129201106705, -0.004504892105672745, 0.10956675203014461, 0.025535426113665813, -0.05619999152951918, -0.257625984172115, 0.33890173814281643, 0.03835806778321663, 0.1881365060717577, -0.08098241970745018, 0.09009154289240195, -0.045979186835225734, -0.10985608528264695, 0.021983814950559347, -0.16871640645394875, 0.1658663284033537, 0.14201153117039847, 0.14139741276656942, 0.22530906479288307, -0.30188348034899387, -0.1759011977913952, 0.04323363898041111, 0.18445363683655622, 0.03963023896219619, -0.08259856411672127, -0.3278465345427985, 0.09947093304326123, -0.19002288499743575, -0.20352895493205223, -0.005612158024358371, 0.05245497683802294, 0.03517687385522997, -0.21184513671785624, 0.14961336355467902, -0.012564792879857123, 0.10118494131061848, -0.12068519597348298, -0.15069278552832585, -0.054140955272559375, 0.13250031395785747, -0.008139372923381863, 0.050212707906399694, 0.11014733404486574, -0.13666217592507895, -0.11979141493239218, 0.39413150840453687, -0.03803326381326076, -0.10100417716857342, 0.22705951084508486, -0.19121891496303892, -0.18294602075576902, 0.07791216523268275, 0.169003172108667, 0.1490739134495102, -0.20850926948182788, 0.029236943274366833, -0.04729706707728347, 0.1809718595710971, 0.05346686905249953, 0.039363056691067794, 0.24543545862275457, 0.12496459535840485, 0.04798752657832608, 0.15052242343690955, -0.23074839446215062, -0.06757180758618883, -0.2289544632436619, -0.1398933022356932, -0.12284350757568424, 0.014312844328020536, -0.12654784604831273, -0.159494763698488, 0.3365026984570755, 0.11250604351066397, 0.21841406683245349, 0.04581659812746303, 0.24640776426900948, 0.05236112612340274, 0.12266446160529518, 0.12314261057014976, 0.27268701708239934, 0.17328870035005764, -0.004459892771029402, -0.21856458266524392, 0.05082720117634236, 0.03769662247837654] |
1,803.01608 | Generalized solutions of the degenerate hyperbolic equation of the
second kind with a spectral parameter | For a degenerate hyperbolic equation of the second kind, and with a spectral
parameter are studied the Cauchy problem, Cauchy-Goursat and Goursat in a new
class of generalized solutions and is given an example that shows the
importance of introducing the concept of such a class. Some operators with
Bessel functions in the nucleus are introduced and their basic properties are
studied. The important identities of these operators are helped to find an
explicit representations of the stated problems.
| math.AP | for a degenerate hyperbolic equation of the second kind and with a spectral parameter are studied the cauchy problem cauchygoursat and goursat in a new class of generalized solutions and is given an example that shows the importance of introducing the concept of such a class some operators with bessel functions in the nucleus are introduced and their basic properties are studied the important identities of these operators are helped to find an explicit representations of the stated problems | [['for', 'a', 'degenerate', 'hyperbolic', 'equation', 'of', 'the', 'second', 'kind', 'and', 'with', 'a', 'spectral', 'parameter', 'are', 'studied', 'the', 'cauchy', 'problem', 'cauchygoursat', 'and', 'goursat', 'in', 'a', 'new', 'class', 'of', 'generalized', 'solutions', 'and', 'is', 'given', 'an', 'example', 'that', 'shows', 'the', 'importance', 'of', 'introducing', 'the', 'concept', 'of', 'such', 'a', 'class', 'some', 'operators', 'with', 'bessel', 'functions', 'in', 'the', 'nucleus', 'are', 'introduced', 'and', 'their', 'basic', 'properties', 'are', 'studied', 'the', 'important', 'identities', 'of', 'these', 'operators', 'are', 'helped', 'to', 'find', 'an', 'explicit', 'representations', 'of', 'the', 'stated', 'problems']] | [-0.12124131805015893, 0.08838604750513995, -0.057938498232655136, 0.10507176712279126, -0.09119621339501648, -0.08451227130533397, -0.039938426452771396, 0.32223034124302713, -0.3005955989319312, -0.2619418163276926, 0.13705650401372416, -0.282013270125689, -0.18627986913146097, 0.2261378659477717, -0.055633547108714716, 0.09883547151649866, 0.018337763185742536, 0.055937841192736655, -0.1026400044277499, -0.21816134158097492, 0.4159568228487727, -0.009637424717893046, 0.1964679815087326, 0.06081351302602826, 0.12466918227492678, -0.02745514391343805, -0.05696888140084434, 0.009893308806268476, -0.12989616774870275, 0.16293691139803798, 0.24271633474840015, 0.10106857984527191, 0.3017831744001353, -0.36490402302315716, -0.19663636980554725, 0.1273490872788184, 0.10610821594401629, 0.0670071872377833, -0.08581301827820702, -0.2861130047306607, 0.07620336120517901, -0.15026137145542645, -0.20857413361862867, -0.06782705518505477, 0.0035956067481089996, 0.10068706440727544, -0.2701496223247127, 0.058823320277836884, 0.10364863010052638, 0.026968970352524442, -0.10675029973558421, -0.13419757122056017, 0.004628111549381969, 0.10940657554583365, 0.039243025195348676, -0.04864418482455083, 0.013698462043193322, -0.15383093656170405, -0.1122597044840738, 0.3868320078199989, 0.004395362532025651, -0.2544993038607549, 0.14598210016265512, -0.10179306956338166, -0.1577634155821008, 0.07609059035047135, 0.13310612100942792, 0.1712529411940258, -0.1474301077755569, 0.10159282354178213, -0.06472103779876157, 0.08948690788908803, 0.06623196184540851, 0.052306859736342595, 0.1392494354668203, 0.11009825512035927, 0.04330013070514874, 0.18346894775293296, -0.012891918509208325, -0.10350756974348539, -0.3287056822424071, -0.18704480133196222, -0.13942939793408105, 0.0403353803543539, -0.08183297814869121, -0.19392594337887778, 0.42477063716778274, 0.06589048882781327, 0.19248591531421752, 0.043813564649582665, 0.1773807442646851, 0.18771362008565234, 0.06361950772130696, 0.04811925334484564, 0.1941822719707926, 0.16441763607384283, 0.08371245144288751, -0.1546319211111846, 0.03092893918598943, 0.13861158177480573] |
1,803.01609 | Assessment of a silicon quantum dot spin qubit environment via noise
spectroscopy | Preserving coherence long enough to perform meaningful calculations is one of
the major challenges on the pathway to large scale quantum computer
implementations. Noise coupled from the environment is the main contributing
factor to decoherence but can be mitigated via engineering design and control
solutions. However, this is only possible after acquiring a thorough
understanding of the dominant noise sources and their spectrum. In this paper,
we employ a silicon quantum dot spin qubit as a metrological device to study
the noise environment experienced by the qubit. We compare the sensitivity of
this qubit to electrical noise with that of an implanted phosphorus donor in
silicon qubit in the same environment and measurement set-up. Our results show
that, as expected, a quantum dot spin qubit is more sensitive to electrical
noise than a donor spin qubit due to the larger Stark shift, and the noise
spectroscopy data shows pronounced charge noise contributions at intermediate
frequencies (2-20 kHz).
| quant-ph | preserving coherence long enough to perform meaningful calculations is one of the major challenges on the pathway to large scale quantum computer implementations noise coupled from the environment is the main contributing factor to decoherence but can be mitigated via engineering design and control solutions however this is only possible after acquiring a thorough understanding of the dominant noise sources and their spectrum in this paper we employ a silicon quantum dot spin qubit as a metrological device to study the noise environment experienced by the qubit we compare the sensitivity of this qubit to electrical noise with that of an implanted phosphorus donor in silicon qubit in the same environment and measurement setup our results show that as expected a quantum dot spin qubit is more sensitive to electrical noise than a donor spin qubit due to the larger stark shift and the noise spectroscopy data shows pronounced charge noise contributions at intermediate frequencies 220 khz | [['preserving', 'coherence', 'long', 'enough', 'to', 'perform', 'meaningful', 'calculations', 'is', 'one', 'of', 'the', 'major', 'challenges', 'on', 'the', 'pathway', 'to', 'large', 'scale', 'quantum', 'computer', 'implementations', 'noise', 'coupled', 'from', 'the', 'environment', 'is', 'the', 'main', 'contributing', 'factor', 'to', 'decoherence', 'but', 'can', 'be', 'mitigated', 'via', 'engineering', 'design', 'and', 'control', 'solutions', 'however', 'this', 'is', 'only', 'possible', 'after', 'acquiring', 'a', 'thorough', 'understanding', 'of', 'the', 'dominant', 'noise', 'sources', 'and', 'their', 'spectrum', 'in', 'this', 'paper', 'we', 'employ', 'a', 'silicon', 'quantum', 'dot', 'spin', 'qubit', 'as', 'a', 'metrological', 'device', 'to', 'study', 'the', 'noise', 'environment', 'experienced', 'by', 'the', 'qubit', 'we', 'compare', 'the', 'sensitivity', 'of', 'this', 'qubit', 'to', 'electrical', 'noise', 'with', 'that', 'of', 'an', 'implanted', 'phosphorus', 'donor', 'in', 'silicon', 'qubit', 'in', 'the', 'same', 'environment', 'and', 'measurement', 'setup', 'our', 'results', 'show', 'that', 'as', 'expected', 'a', 'quantum', 'dot', 'spin', 'qubit', 'is', 'more', 'sensitive', 'to', 'electrical', 'noise', 'than', 'a', 'donor', 'spin', 'qubit', 'due', 'to', 'the', 'larger', 'stark', 'shift', 'and', 'the', 'noise', 'spectroscopy', 'data', 'shows', 'pronounced', 'charge', 'noise', 'contributions', 'at', 'intermediate', 'frequencies', '220', 'khz']] | [-0.11974700232211405, 0.15460937397021007, -0.008467157522607951, 0.025729111761335213, 0.004809433991789438, -0.21235914872870276, 0.07576428475466432, 0.40749346906805683, -0.22983357199960075, -0.31767746883557196, 0.06302823214183687, -0.29600346004175154, -0.10372413910783021, 0.23259383072679163, -0.08515720464479012, 0.0396673521679488, 0.08473839338684964, -0.009129828275151693, -0.06996230754718054, -0.18757471274643853, 0.2755798326180892, 0.09600146732420607, 0.292301940885936, 0.03263511940403871, 0.09561247506347978, -0.022865037733368624, 0.026685572045434054, -0.05371618876678596, -0.05808148563108748, 0.07442111820338448, 0.2836529950946451, 0.0251040655487828, 0.2596308895576579, -0.4469788150393232, -0.186509656986803, 0.07252892183961501, 0.11967070765532316, 0.20004546902717868, -0.04184593925236615, -0.3022130195549719, 0.04896455294316172, -0.1711150930903757, -0.06782606802287565, -0.0825824386048706, 0.0035245243792131446, -0.05945060956128725, -0.23162018206151452, 0.07756199007839036, 0.08091638595011133, 0.01703350188518885, -0.01047066617668102, -0.06950883013581868, 0.0163716737352976, 0.14717352099881276, -0.010200452326446962, 0.04793551663132562, 0.2536703298820456, -0.1188358380474079, -0.12324454315054188, 0.3335303754373721, -0.06577512424242324, -0.14880846538744083, 0.18134165425031523, -0.1794609141678425, -0.07765553731939927, 0.09958528559862571, 0.1407977793229281, 0.0713032054283677, -0.18792257478140342, 0.022178687781071776, 0.09459541065790424, 0.26046117074835073, 0.0371254986036379, 0.1478245576960776, 0.20595169464826205, 0.2010681233339154, 0.11149429391096731, 0.16468907380550743, -0.1295488707374212, -0.06332988916357955, -0.24551149436337932, -0.1383294619821534, -0.21407941691013896, 0.15734301878222426, -0.05831872601808007, -0.11409310382830905, 0.42095930043868957, 0.1856698173893153, 0.15496948761806176, -0.04601123628271803, 0.3610047789492235, 0.13047172418264613, 0.09541233187499841, 0.005024494382309591, 0.2397919070371575, 0.2029007480236565, 0.0980984903901673, -0.3142582626841298, 0.040579884330842905, -0.10775392173320815] |
1,803.0161 | On the Breuil-Schneider conjecture: Generic case | We use the Taylor-Wiles-Kisin patching method to prove some new cases of the
Breuil-Schneider conjecture.
| math.NT | we use the taylorwileskisin patching method to prove some new cases of the breuilschneider conjecture | [['we', 'use', 'the', 'taylorwileskisin', 'patching', 'method', 'to', 'prove', 'some', 'new', 'cases', 'of', 'the', 'breuilschneider', 'conjecture']] | [-0.1277084669098258, -0.040559582971036436, -0.13484228824575742, 0.09117422824104628, -0.08728910187880198, -0.15398355287810167, 0.057325880974531174, 0.2787865792711576, -0.3023496682755649, -0.22112589764098325, 0.08937502363696695, -0.19806738593615592, -0.2279466117421786, 0.24883271306753157, -0.17017643029491106, 0.029235183822068696, 0.05827130787074566, -0.014628857374191284, -0.09500298152367274, -0.38021169702212015, 0.3397851934035619, -0.07039941921830177, 0.2304874914387862, 0.14685063809156418, 0.07321757227182388, 0.04414867715289195, -0.020325321766237418, -0.06423404770042301, -0.19811595554153125, 0.1735360562801361, 0.17138100787997246, 0.18426907489386699, 0.2938629984855652, -0.36629059811433157, -0.14969555817854902, 0.14418195287386576, 0.10405602908382813, 0.1799799240504702, -0.07089812719884019, -0.28578211516141894, 0.15776545219123364, -0.18813788866003353, -0.2810200115044912, -0.16073713451623917, -0.09031324312090874, 0.02365982166181008, -0.24511214022835096, 0.01620643992597858, 0.1012765683233738, 0.039078906364738944, -0.07912672064267098, -0.0918602411945661, 0.07229372356086969, 0.07939071608707308, 0.07928499865035216, -0.040136602831383546, 0.006533935324599346, -0.05834561300774415, -0.10515692854921023, 0.2699729676047961, -0.024683595697085062, -0.17301137248675028, 0.13677715783317884, -0.11012120172381401, -0.26436372424165405, 0.02706769574433565, 0.09782069449623426, 0.2068914478023847, -0.041572593587140244, 0.08734985692426563, -0.14611601332823435, 0.03199849724769592, 0.1508692542091012, -0.04234151896089315, 0.056778517862161, 0.048776925851901375, 0.1150335173898687, 0.16901177174101273, -0.10871211998164654, 0.01944568691154321, -0.3119013080994288, -0.25050289581219354, -0.0986576858907938, 0.04888913705945015, -0.09951256265242894, -0.16650011502206324, 0.36499853481849037, 0.2664972003238896, 0.12700229678303004, 0.16886010449379682, 0.24045413346029818, 0.06660710082699856, 0.01965981990409394, 0.1200541707376639, 0.1557497754790044, 0.19672495275735855, 0.038157962759335834, -0.13558069343368212, -0.029098647522429626, 0.20837412206456066] |
1,803.01611 | Higgs bundles, Lagrangians and mirror symmetry | This thesis is dedicated to the study of certain loci of the Higgs bundle
moduli space on a compact Riemann surface. Motivated by mirror symmetry, we
give a detailed description of the fibres of the $G$-Hitchin fibration
containing $G_0$-Higgs bundles for the real forms $G_0 = SU^*(2m)$, $SO^*(4m)$
and $Sp(m,m)$ of $G = SL(2m,\mathbb{C})$, $SO(4m,\mathbb{C})$ and
$Sp(4m,\mathbb{C})$, respectively. The spectral curves associated to these
fibres are examples of ribbons and our description is done in two different
ways, one in term of objects on the reduced scheme associated to the spectral
curve, while the other in terms of the (non-reduced) spectral curve. A link is
provided between the two approaches. We use this description to give a proposal
for the support of the dual BBB-brane inside the moduli space of Higgs bundles
for the Langlands dual group of $G$, corroborating the conjectural picture.
In the second part of the thesis we discuss Gaiotto Lagrangian subvarieties
inside the moduli spaces of $G$-Higgs bundles, where $G$ is a complex reductive
group. These Lagrangians are obtained from a symplectic representation of $G$
and we discuss some of its general properties. We then focus our attention to
the Gaiotto Lagrangian for the standard representation of the symplectic group.
This is an irreducible component of the nilpotent cone for the symplectic
Hitchin fibration. We describe this component by using the usual Morse function
on the Higgs bundle moduli space restricted to the Lagrangian in question.
Lastly, we discuss natural questions and applications of the ideas developed in
this thesis. In particular, we say a few words about the hyperholomorphic
bundle, how to generalize the Gaiotto Lagrangian to vector bundles which admit
many sections and give an analogue of the Gaiotto Lagrangian for the orthogonal
group.
| math.AG | this thesis is dedicated to the study of certain loci of the higgs bundle moduli space on a compact riemann surface motivated by mirror symmetry we give a detailed description of the fibres of the ghitchin fibration containing g_0higgs bundles for the real forms g_0 su2m so4m and spmm of g sl2mmathbbc so4mmathbbc and sp4mmathbbc respectively the spectral curves associated to these fibres are examples of ribbons and our description is done in two different ways one in term of objects on the reduced scheme associated to the spectral curve while the other in terms of the nonreduced spectral curve a link is provided between the two approaches we use this description to give a proposal for the support of the dual bbbbrane inside the moduli space of higgs bundles for the langlands dual group of g corroborating the conjectural picture in the second part of the thesis we discuss gaiotto lagrangian subvarieties inside the moduli spaces of ghiggs bundles where g is a complex reductive group these lagrangians are obtained from a symplectic representation of g and we discuss some of its general properties we then focus our attention to the gaiotto lagrangian for the standard representation of the symplectic group this is an irreducible component of the nilpotent cone for the symplectic hitchin fibration we describe this component by using the usual morse function on the higgs bundle moduli space restricted to the lagrangian in question lastly we discuss natural questions and applications of the ideas developed in this thesis in particular we say a few words about the hyperholomorphic bundle how to generalize the gaiotto lagrangian to vector bundles which admit many sections and give an analogue of the gaiotto lagrangian for the orthogonal group | [['this', 'thesis', 'is', 'dedicated', 'to', 'the', 'study', 'of', 'certain', 'loci', 'of', 'the', 'higgs', 'bundle', 'moduli', 'space', 'on', 'a', 'compact', 'riemann', 'surface', 'motivated', 'by', 'mirror', 'symmetry', 'we', 'give', 'a', 'detailed', 'description', 'of', 'the', 'fibres', 'of', 'the', 'ghitchin', 'fibration', 'containing', 'g_0higgs', 'bundles', 'for', 'the', 'real', 'forms', 'g_0', 'su2m', 'so4m', 'and', 'spmm', 'of', 'g', 'sl2mmathbbc', 'so4mmathbbc', 'and', 'sp4mmathbbc', 'respectively', 'the', 'spectral', 'curves', 'associated', 'to', 'these', 'fibres', 'are', 'examples', 'of', 'ribbons', 'and', 'our', 'description', 'is', 'done', 'in', 'two', 'different', 'ways', 'one', 'in', 'term', 'of', 'objects', 'on', 'the', 'reduced', 'scheme', 'associated', 'to', 'the', 'spectral', 'curve', 'while', 'the', 'other', 'in', 'terms', 'of', 'the', 'nonreduced', 'spectral', 'curve', 'a', 'link', 'is', 'provided', 'between', 'the', 'two', 'approaches', 'we', 'use', 'this', 'description', 'to', 'give', 'a', 'proposal', 'for', 'the', 'support', 'of', 'the', 'dual', 'bbbbrane', 'inside', 'the', 'moduli', 'space', 'of', 'higgs', 'bundles', 'for', 'the', 'langlands', 'dual', 'group', 'of', 'g', 'corroborating', 'the', 'conjectural', 'picture', 'in', 'the', 'second', 'part', 'of', 'the', 'thesis', 'we', 'discuss', 'gaiotto', 'lagrangian', 'subvarieties', 'inside', 'the', 'moduli', 'spaces', 'of', 'ghiggs', 'bundles', 'where', 'g', 'is', 'a', 'complex', 'reductive', 'group', 'these', 'lagrangians', 'are', 'obtained', 'from', 'a', 'symplectic', 'representation', 'of', 'g', 'and', 'we', 'discuss', 'some', 'of', 'its', 'general', 'properties', 'we', 'then', 'focus', 'our', 'attention', 'to', 'the', 'gaiotto', 'lagrangian', 'for', 'the', 'standard', 'representation', 'of', 'the', 'symplectic', 'group', 'this', 'is', 'an', 'irreducible', 'component', 'of', 'the', 'nilpotent', 'cone', 'for', 'the', 'symplectic', 'hitchin', 'fibration', 'we', 'describe', 'this', 'component', 'by', 'using', 'the', 'usual', 'morse', 'function', 'on', 'the', 'higgs', 'bundle', 'moduli', 'space', 'restricted', 'to', 'the', 'lagrangian', 'in', 'question', 'lastly', 'we', 'discuss', 'natural', 'questions', 'and', 'applications', 'of', 'the', 'ideas', 'developed', 'in', 'this', 'thesis', 'in', 'particular', 'we', 'say', 'a', 'few', 'words', 'about', 'the', 'hyperholomorphic', 'bundle', 'how', 'to', 'generalize', 'the', 'gaiotto', 'lagrangian', 'to', 'vector', 'bundles', 'which', 'admit', 'many', 'sections', 'and', 'give', 'an', 'analogue', 'of', 'the', 'gaiotto', 'lagrangian', 'for', 'the', 'orthogonal', 'group']] | [-0.18268875597836948, 0.056194402902321625, -0.11615365000401899, 0.07629560590373664, -0.13102874355274666, -0.09657770525200086, -0.0018662680967899828, 0.35637579129485153, -0.26981531216819304, -0.22472234232899288, 0.08006074865559096, -0.2207725053401233, -0.17802658475756486, 0.18959735221087806, -0.13970229337058193, -0.005231787724249741, 0.039212584267685265, 0.0828616949746193, -0.11136525722048196, -0.28703245978091524, 0.44426135937898714, -0.02223353795860513, 0.2313880485033424, 0.05919648506769785, 0.1055427908100307, 0.03292345684154284, -0.030890156246483114, -0.052690347098456235, -0.14011658299416038, 0.1961111717159757, 0.27776170707990505, 0.0816457728172563, 0.1746238981940356, -0.3995294201509278, -0.19651189410986106, 0.16677262208646568, 0.11042857673383745, 0.021489111562856072, 0.014582074300743958, -0.2764906830906709, 0.08288826696819947, -0.14137514320523661, -0.17238071899251264, -0.08193008809804492, 0.018866453992593967, -0.01665648301417883, -0.1678468016783286, -0.04056648767198638, 0.059792073320073746, 0.10815905507826296, -0.06127324127351859, -0.09095357110073626, -0.07130181025282821, 0.056433014193834785, 0.06491223175088573, 0.051942813708165204, 0.10506352969218258, -0.137989806025405, -0.09967056368858788, 0.3979654013447702, -0.08302326347957302, -0.22815123739407075, 0.13006093590835183, -0.11280970649339683, -0.1737995722324478, 0.12329109244585515, 0.1262598683149471, 0.16910092156625675, -0.03182661628807991, 0.15303799353504316, -0.10403109092291882, 0.05439060564679873, 0.04905702530703047, -0.0069785892954709345, 0.16914275150147046, 0.12462120014657117, 0.03872070960792484, 0.11702638100298267, -0.018625349932834108, -0.07357550235411311, -0.3985884260532058, -0.23754582406946348, -0.09508761318377303, 0.08887653838050986, -0.09253100633881804, -0.14254413563857565, 0.4636988714085021, 0.06128474555286542, 0.24900543532629243, 0.08650197647553388, 0.2400881235539131, 0.046289155263042746, 0.04995022282779906, 0.027020051346236702, 0.21596390066564405, 0.2225962065279538, -0.003983327632544569, -0.1649486008349821, -0.09491480338665594, 0.20054184634808545] |
1,803.01612 | Embedding the Picard group inside the class group: the case of
$\Q$-factorial complete toric varieties | Let $X$ be a $\Q$-factorial complete toric variety over an algebraic closed
field of characteristic $0$. There is a canonical injection of the Picard group
${\rm Pic}(X)$ in the group ${\rm Cl}(X)$ of classes of Weil divisors. These
two groups are finitely generated abelian groups; whilst the first one is a
free group, the second one may have torsion. We investigate algebraic and
geometrical conditions under which the image of ${\rm Pic}(X)$ in ${\rm Cl}(X)$
is contained in a free part of the latter group.
| math.AG | let x be a qfactorial complete toric variety over an algebraic closed field of characteristic 0 there is a canonical injection of the picard group rm picx in the group rm clx of classes of weil divisors these two groups are finitely generated abelian groups whilst the first one is a free group the second one may have torsion we investigate algebraic and geometrical conditions under which the image of rm picx in rm clx is contained in a free part of the latter group | [['let', 'x', 'be', 'a', 'qfactorial', 'complete', 'toric', 'variety', 'over', 'an', 'algebraic', 'closed', 'field', 'of', 'characteristic', '0', 'there', 'is', 'a', 'canonical', 'injection', 'of', 'the', 'picard', 'group', 'rm', 'picx', 'in', 'the', 'group', 'rm', 'clx', 'of', 'classes', 'of', 'weil', 'divisors', 'these', 'two', 'groups', 'are', 'finitely', 'generated', 'abelian', 'groups', 'whilst', 'the', 'first', 'one', 'is', 'a', 'free', 'group', 'the', 'second', 'one', 'may', 'have', 'torsion', 'we', 'investigate', 'algebraic', 'and', 'geometrical', 'conditions', 'under', 'which', 'the', 'image', 'of', 'rm', 'picx', 'in', 'rm', 'clx', 'is', 'contained', 'in', 'a', 'free', 'part', 'of', 'the', 'latter', 'group']] | [-0.2539538009859183, 0.1046008914751891, -0.11384573437492637, 0.055628292173530686, -0.07438841985593385, -0.1074617380166755, -0.07673199761056286, 0.3528285106205765, -0.3413064061855788, -0.19123803992920063, 0.10293948381509194, -0.23272776031757103, -0.038076416309922936, 0.24580246956799837, -0.13445181552978122, -0.10241745720233987, -0.03575137477806386, 0.17431416945422398, -0.1081145829110242, -0.3129688954309506, 0.4110947313554147, -0.09096666839631165, 0.2248723224901101, 0.007947683681542164, 0.12894900179303745, -0.02836294282666024, 0.02250585654640899, -0.011877467343583702, -0.14118682524627624, 0.1068811626995311, 0.3380742471555577, 0.06536231324734057, 0.2097754656775471, -0.36022410524242066, -0.16619719581349807, 0.23314544869696394, 0.10803312880041845, -0.00876441159258213, -0.03963156365515555, -0.25120793570052175, 0.16979266899511192, -0.1752650794956614, -0.11407465154633803, -0.01827502292306984, 0.06775468186447944, -0.003227040960508234, -0.21413002019638525, -0.033063025799963404, 0.049144897993434876, 0.19368182198308848, -0.012272492357913186, -0.08383709161323222, -0.09537675526979215, 0.08337284394485109, 0.00330335376510287, 0.06757498707841425, 0.1211565648260362, -0.10164510254912516, -0.07315434915397097, 0.4217147997196983, -0.06418845834867919, -0.20079319508855833, 0.11549929259892772, -0.1700518211678547, -0.1691633944509222, 0.20664456178817678, 0.07641624788589338, 0.18892410834703374, -0.0015703093917930828, 0.22832966790849563, -0.18307669931913123, 0.09589702844181482, 0.02474415987620459, -0.03238505080123158, 0.11287877234246801, 0.08008853366927189, 0.06292899098959477, 0.08971795219352798, -0.005135569370844785, 0.03264073900987997, -0.4057422282941201, -0.2204064699985525, -0.07556214707848781, 0.1912634672158781, -0.10105150994444129, -0.12842600379029617, 0.4190977214890368, 0.024130035812199555, 0.14326318529817988, 0.06374463798505638, 0.20380308487836052, 0.03417107167051119, 0.05374321792932118, 0.05402400168206762, 0.0746730056755683, 0.23567246735534247, -0.1432742072885637, -0.1582518632773666, -0.03161408341873218, 0.16943562734762535] |
1,803.01613 | A Family of ESDIRK Integration Methods | In this paper we derive and analyze the properties of explicit singly
diagonal implicit Runge-Kutta (ESDIRK) integration methods. We discuss the
principles for construction of Runge-Kutta methods with embedded methods of
different order for error estimation and continuous extensions for discrete
event location. These principles are used to derive a family of ESDIRK
integration methods with error estimators and continuous-extensions. The orders
of the advancing method (and error estimator) are 1(2), 2(3) and 3(4),
respectively. These methods are suitable for obtaining low to medium accuracy
solutions of systems of ordinary differential equations as well as index-1
differential algebraic equations. The continuous extensions facilitates
solution of hybrid systems with discrete-events. Other ESDIRK methods due to
Kv{\ae}rn{\o} are equipped with continuous-extensions as well to make them
applicable to hybrid systems with discrete events.
| math.NA | in this paper we derive and analyze the properties of explicit singly diagonal implicit rungekutta esdirk integration methods we discuss the principles for construction of rungekutta methods with embedded methods of different order for error estimation and continuous extensions for discrete event location these principles are used to derive a family of esdirk integration methods with error estimators and continuousextensions the orders of the advancing method and error estimator are 12 23 and 34 respectively these methods are suitable for obtaining low to medium accuracy solutions of systems of ordinary differential equations as well as index1 differential algebraic equations the continuous extensions facilitates solution of hybrid systems with discreteevents other esdirk methods due to kvaerno are equipped with continuousextensions as well to make them applicable to hybrid systems with discrete events | [['in', 'this', 'paper', 'we', 'derive', 'and', 'analyze', 'the', 'properties', 'of', 'explicit', 'singly', 'diagonal', 'implicit', 'rungekutta', 'esdirk', 'integration', 'methods', 'we', 'discuss', 'the', 'principles', 'for', 'construction', 'of', 'rungekutta', 'methods', 'with', 'embedded', 'methods', 'of', 'different', 'order', 'for', 'error', 'estimation', 'and', 'continuous', 'extensions', 'for', 'discrete', 'event', 'location', 'these', 'principles', 'are', 'used', 'to', 'derive', 'a', 'family', 'of', 'esdirk', 'integration', 'methods', 'with', 'error', 'estimators', 'and', 'continuousextensions', 'the', 'orders', 'of', 'the', 'advancing', 'method', 'and', 'error', 'estimator', 'are', '12', '23', 'and', '34', 'respectively', 'these', 'methods', 'are', 'suitable', 'for', 'obtaining', 'low', 'to', 'medium', 'accuracy', 'solutions', 'of', 'systems', 'of', 'ordinary', 'differential', 'equations', 'as', 'well', 'as', 'index1', 'differential', 'algebraic', 'equations', 'the', 'continuous', 'extensions', 'facilitates', 'solution', 'of', 'hybrid', 'systems', 'with', 'discreteevents', 'other', 'esdirk', 'methods', 'due', 'to', 'kvaerno', 'are', 'equipped', 'with', 'continuousextensions', 'as', 'well', 'to', 'make', 'them', 'applicable', 'to', 'hybrid', 'systems', 'with', 'discrete', 'events']] | [-0.09742468002978272, -0.019659592088047913, -0.04051874731264011, 0.09397865768465191, -0.05174823282249859, -0.15305098746793241, 0.011629487561083979, 0.39749640848223616, -0.2586836546978466, -0.33975200120388993, 0.1823772393656513, -0.27835292508092335, -0.12564863835820766, 0.23430571903833958, -0.07627891997007404, 0.13154582790737077, 0.044985751240096225, -0.009241917111918213, -0.163303794760961, -0.24383758918902887, 0.3203939197394322, -0.0122624344273111, 0.23270848524705398, -0.03883127788976422, 0.16389549319361021, -0.04194098794612828, -0.0688877640013385, 0.0026372013261585724, -0.12468222420897306, 0.17244345769946148, 0.2905520764509524, 0.07128411902510744, 0.2556272034082327, -0.4060073660422615, -0.20221608450914014, 0.06308010912052994, 0.14566242268792992, 0.13154400743367187, -0.031896601981065406, -0.284283615516748, 0.10327003344042798, -0.18767756446609346, -0.14364580043012232, -0.14638113719594525, -0.029448247155335946, 0.12481467832451848, -0.28887134446124507, 0.09390207270790976, 0.038322723329463224, 0.06177290476946615, -0.05250894435219408, -0.15260021210241123, 0.020190457454112572, 0.10112801693951873, 0.03607527816514155, -0.052082559495328334, 0.07275384061009162, -0.05620404782954339, -0.16368059259582693, 0.38421969273536444, -0.08890660774919724, -0.2490558491682443, 0.21234006529277938, -0.06612005467548615, -0.13091828812676387, 0.14306929867025317, 0.20456810368547643, 0.1559016490795129, -0.1356983552650204, 0.05990532293203507, 0.08789352389917833, 0.12718539347681473, 0.006926715172328583, 0.07838440637331544, 0.10320492916718477, 0.15880935064949622, 0.09040260699936958, 0.08029146766057238, -0.061335260019404814, -0.13567680605929197, -0.3004039458959825, -0.18311974164084752, -0.08163671072308473, -0.013764617700628408, -0.08586311971850777, -0.19561181999156324, 0.3307185489977673, 0.14786601851384457, 0.12404376866046603, 0.10319366441181618, 0.2987811294068971, 0.16496293887580327, 0.04099998376002227, 0.08045712553375349, 0.18323039231220567, 0.17478974642943385, 0.07864103350773688, -0.16356003838297947, 0.03645627366334904, 0.14226139377340616] |
1,803.01614 | Local energy transfer rate and kinetic processes: the fate of turbulent
energy in two-dimensional Hybrid Vlasov-Maxwell numerical simulations | The nature of the cross-scale connections between the inertial range
turbulent energy cascade and the small-scale kinetic processes in collisionless
plasmas is explored through the analysis of two-dimensional Hybrid
Vlasov-Maxwell numerical simulation (HVM), with alpha particles, and through a
proxy of the turbulent energy transfer rate, namely the Local Energy Transfer
rate (LET). Correlations between pairs of variables, including those related to
kinetic processes and to deviation from Maxwellian distributions, are first
evidenced. Then, the general properties and the statistical scaling laws of the
LET are described, confirming its reliability for the description of the
turbulent cascade and revealing its textured topology. Finally, the connection
between such proxy and the diagnostic variables is explored using conditional
averaging, showing that several quantities are enhanced in the presence of
large positive energy flux, and reduced near sites of negative flux. These
observations can help determining which processes are involved in the
dissipation of energy at small scales, as for example ion-cyclotron or mirror
instabilities typically associated with perpendicular anisotropy of
temperature.
| physics.space-ph physics.plasm-ph | the nature of the crossscale connections between the inertial range turbulent energy cascade and the smallscale kinetic processes in collisionless plasmas is explored through the analysis of twodimensional hybrid vlasovmaxwell numerical simulation hvm with alpha particles and through a proxy of the turbulent energy transfer rate namely the local energy transfer rate let correlations between pairs of variables including those related to kinetic processes and to deviation from maxwellian distributions are first evidenced then the general properties and the statistical scaling laws of the let are described confirming its reliability for the description of the turbulent cascade and revealing its textured topology finally the connection between such proxy and the diagnostic variables is explored using conditional averaging showing that several quantities are enhanced in the presence of large positive energy flux and reduced near sites of negative flux these observations can help determining which processes are involved in the dissipation of energy at small scales as for example ioncyclotron or mirror instabilities typically associated with perpendicular anisotropy of temperature | [['the', 'nature', 'of', 'the', 'crossscale', 'connections', 'between', 'the', 'inertial', 'range', 'turbulent', 'energy', 'cascade', 'and', 'the', 'smallscale', 'kinetic', 'processes', 'in', 'collisionless', 'plasmas', 'is', 'explored', 'through', 'the', 'analysis', 'of', 'twodimensional', 'hybrid', 'vlasovmaxwell', 'numerical', 'simulation', 'hvm', 'with', 'alpha', 'particles', 'and', 'through', 'a', 'proxy', 'of', 'the', 'turbulent', 'energy', 'transfer', 'rate', 'namely', 'the', 'local', 'energy', 'transfer', 'rate', 'let', 'correlations', 'between', 'pairs', 'of', 'variables', 'including', 'those', 'related', 'to', 'kinetic', 'processes', 'and', 'to', 'deviation', 'from', 'maxwellian', 'distributions', 'are', 'first', 'evidenced', 'then', 'the', 'general', 'properties', 'and', 'the', 'statistical', 'scaling', 'laws', 'of', 'the', 'let', 'are', 'described', 'confirming', 'its', 'reliability', 'for', 'the', 'description', 'of', 'the', 'turbulent', 'cascade', 'and', 'revealing', 'its', 'textured', 'topology', 'finally', 'the', 'connection', 'between', 'such', 'proxy', 'and', 'the', 'diagnostic', 'variables', 'is', 'explored', 'using', 'conditional', 'averaging', 'showing', 'that', 'several', 'quantities', 'are', 'enhanced', 'in', 'the', 'presence', 'of', 'large', 'positive', 'energy', 'flux', 'and', 'reduced', 'near', 'sites', 'of', 'negative', 'flux', 'these', 'observations', 'can', 'help', 'determining', 'which', 'processes', 'are', 'involved', 'in', 'the', 'dissipation', 'of', 'energy', 'at', 'small', 'scales', 'as', 'for', 'example', 'ioncyclotron', 'or', 'mirror', 'instabilities', 'typically', 'associated', 'with', 'perpendicular', 'anisotropy', 'of', 'temperature']] | [-0.1402308018685225, 0.18482131432168758, -0.0413251602223154, 0.09738370861955258, -0.005114201015445608, -0.07784684589711299, -0.0028877751984407564, 0.32702086745766845, -0.3103066525620425, -0.3558585085580952, 0.04846526790181583, -0.2644928294790567, -0.06755896989454532, 0.21657750679224114, 0.04834533180385696, 0.03788384913877424, 0.024872140693849402, -0.015818376603850423, -0.047156547492414096, -0.12318725119132724, 0.3267447721163505, 0.14800324945120946, 0.2821557230272016, 0.05624123608286888, 0.1025886392061042, -0.04962011948696299, -0.054036789646746936, 0.04341125375447938, -0.1371954123255092, 0.06682893775805443, 0.20701545698515872, 0.05187304118323035, 0.2431072272972022, -0.4397682704290819, -0.25329740150947366, 0.09797085996044899, 0.1597161910265199, 0.03436696918656466, -0.036532322028872265, -0.22901369440617295, 0.0558634044867031, -0.14146271562644627, -0.109652737813751, -0.07032920089522762, 0.015915949078422788, 0.11294617489002337, -0.2992228176858078, 0.15989470398935252, 0.049788842906282674, 0.0730501219668817, -0.08044453623660526, -0.08268728326061002, -0.0985929101606357, 0.10953006851927724, 0.09340321722773824, -0.019519565481631935, 0.16510388507237714, -0.15229629787489685, -0.08500217622388485, 0.36314282662196623, -0.03603399838575785, -0.18328733211135237, 0.2377850316745951, -0.15781304320133122, -0.07950713931026279, 0.15296689947493947, 0.17460011216376484, 0.0807578708623817, -0.12109488222924386, 0.039818545908520075, 0.0008385811199450633, 0.11821824855435661, 0.024013322684362796, 0.04929851553955297, 0.2296367623655886, 0.15127020378282965, 0.000372515164712477, 0.1106872386547059, -0.12847067270952844, -0.14507173004142732, -0.31406259564297084, -0.15162134419619686, -0.1769677033184989, 0.06344592799336136, -0.10446662181575395, -0.1404442595340003, 0.36558133664337045, 0.13765662209924376, 0.19086877309535383, 0.018529749718582886, 0.2740946496566813, 0.15199977735308215, 0.01974677254608419, 0.1040637704844107, 0.24428699087880595, 0.19393985415395548, 0.110341712854494, -0.2451600191244007, 0.06500655566562606, 0.0451166526464051] |
1,803.01615 | On the index of minimal 2-tori in the 4-sphere | In this note we prove that any minimal $2$-torus in $S^4$ has Morse index at
least $6$, with equality if and only if it is congruent to the Clifford torus
in some great $S^3\subset S^4$.For a minimal $2$-torus in $S^n$ with vanishing
Hopf differential, we show that its index is at least $n+3$, and that this
estimate is sharp: the equilateral $2$-torus fully embedded in $S^5\subset S^n$
as a homogeneous minimal surface in $S^n$ has index exactly $n+3$.
| math.DG | in this note we prove that any minimal 2torus in s4 has morse index at least 6 with equality if and only if it is congruent to the clifford torus in some great s3subset s4for a minimal 2torus in sn with vanishing hopf differential we show that its index is at least n3 and that this estimate is sharp the equilateral 2torus fully embedded in s5subset sn as a homogeneous minimal surface in sn has index exactly n3 | [['in', 'this', 'note', 'we', 'prove', 'that', 'any', 'minimal', '2torus', 'in', 's4', 'has', 'morse', 'index', 'at', 'least', '6', 'with', 'equality', 'if', 'and', 'only', 'if', 'it', 'is', 'congruent', 'to', 'the', 'clifford', 'torus', 'in', 'some', 'great', 's3subset', 's4for', 'a', 'minimal', '2torus', 'in', 'sn', 'with', 'vanishing', 'hopf', 'differential', 'we', 'show', 'that', 'its', 'index', 'is', 'at', 'least', 'n3', 'and', 'that', 'this', 'estimate', 'is', 'sharp', 'the', 'equilateral', '2torus', 'fully', 'embedded', 'in', 's5subset', 'sn', 'as', 'a', 'homogeneous', 'minimal', 'surface', 'in', 'sn', 'has', 'index', 'exactly', 'n3']] | [-0.12487189225717693, 0.10336044594939602, -0.06210457352235129, 0.0708787916794934, -0.046692790616744834, -0.227476315480951, -0.03362513516147278, 0.40413526278356776, -0.22474860941599073, -0.23638544856619678, 0.1485207352349167, -0.3312929457139322, -0.16966176247239528, 0.14784068067092448, -0.1677294113844829, -0.041751577103001945, 0.04428406954914527, 0.11139550296847071, -0.0877819457489654, -0.2965335361659527, 0.3043747896598162, -0.04205058093525862, 0.1625959955884977, 0.07066597118606105, 0.09046255156403947, -0.024775688089185247, 0.074869506306162, 0.007820376918013943, -0.17810675886443947, 0.08285428847088233, 0.223375588214319, 0.06952236028155312, 0.16968160478312425, -0.3607977079472652, -0.21665439916480528, 0.21851541057817245, 0.14828592040392227, 0.009910488991360916, -0.022412445656587614, -0.14671129859542767, 0.166633473099577, -0.1451223025490579, -0.19046603082097135, 0.015661639639323478, 0.09053395173855518, -0.06300574156308644, -0.17891708156093955, 0.03847473592644459, 0.11900150524697413, 0.1114072347317185, -0.022369772074805377, -0.03264457983497873, -0.1450042730123785, 0.05740849040816293, 0.03183375050522093, 0.06081675463754341, 0.011403027284694346, -0.05401093045886802, -0.0678880061513107, 0.36177988727822114, -0.10604662771067142, -0.22374153224212168, 0.1205015687262762, -0.23443381017760226, -0.22371463244780898, 0.14552060894570068, 0.050336011716066616, 0.09637230269512848, -0.06250522739106887, 0.18884844914856858, -0.10414970188254588, 0.1844848604186585, 0.12396501570841983, -0.036524583573306076, 0.13064560514727705, 0.11140727723020398, 0.14963766054470876, 0.13580257624485775, -0.05769201466127446, 0.009249045636112752, -0.3599259045073076, -0.2064334146041227, -0.1772743708233496, 0.1590581626606811, -0.16237830539734874, -0.16444929422026403, 0.35599954078268065, 0.021878623722219152, 0.1813933989339459, 0.047548152790879705, 0.24340685212212665, 0.0779954842398997, 0.05197364004255321, 0.14379997531757813, 0.214151015286533, 0.1360553652048111, -0.013417761469578468, -0.12448335018646169, -0.051826140953620016, 0.15225233039573619] |
1,803.01616 | Tensorial and bipartite block models for link prediction in layered
networks and temporal networks | Many real-world complex systems are well represented as multilayer networks;
predicting interactions in those systems is one of the most pressing problems
in predictive network science. To address this challenge, we introduce two
stochastic block models for multilayer and temporal networks; one of them uses
nodes as its fundamental unit, whereas the other focuses on links. We also
develop scalable algorithms for inferring the parameters of these models.
Because our models describe all layers simultaneously, our approach takes full
advantage of the information contained in the whole network when making
predictions about any particular layer. We illustrate the potential of our
approach by analyzing two empirical datasets---a temporal network of email
communications, and a network of drug interactions for treating different
cancer types. We find that modeling all layers simultaneously does result, in
general, in more accurate link prediction. However, the most predictive model
depends on the dataset under consideration; whereas the node-based model is
more appropriate for predicting drug interactions, the link-based model is more
appropriate for predicting email communication.
| physics.soc-ph cs.SI physics.data-an q-bio.MN stat.ML | many realworld complex systems are well represented as multilayer networks predicting interactions in those systems is one of the most pressing problems in predictive network science to address this challenge we introduce two stochastic block models for multilayer and temporal networks one of them uses nodes as its fundamental unit whereas the other focuses on links we also develop scalable algorithms for inferring the parameters of these models because our models describe all layers simultaneously our approach takes full advantage of the information contained in the whole network when making predictions about any particular layer we illustrate the potential of our approach by analyzing two empirical datasetsa temporal network of email communications and a network of drug interactions for treating different cancer types we find that modeling all layers simultaneously does result in general in more accurate link prediction however the most predictive model depends on the dataset under consideration whereas the nodebased model is more appropriate for predicting drug interactions the linkbased model is more appropriate for predicting email communication | [['many', 'realworld', 'complex', 'systems', 'are', 'well', 'represented', 'as', 'multilayer', 'networks', 'predicting', 'interactions', 'in', 'those', 'systems', 'is', 'one', 'of', 'the', 'most', 'pressing', 'problems', 'in', 'predictive', 'network', 'science', 'to', 'address', 'this', 'challenge', 'we', 'introduce', 'two', 'stochastic', 'block', 'models', 'for', 'multilayer', 'and', 'temporal', 'networks', 'one', 'of', 'them', 'uses', 'nodes', 'as', 'its', 'fundamental', 'unit', 'whereas', 'the', 'other', 'focuses', 'on', 'links', 'we', 'also', 'develop', 'scalable', 'algorithms', 'for', 'inferring', 'the', 'parameters', 'of', 'these', 'models', 'because', 'our', 'models', 'describe', 'all', 'layers', 'simultaneously', 'our', 'approach', 'takes', 'full', 'advantage', 'of', 'the', 'information', 'contained', 'in', 'the', 'whole', 'network', 'when', 'making', 'predictions', 'about', 'any', 'particular', 'layer', 'we', 'illustrate', 'the', 'potential', 'of', 'our', 'approach', 'by', 'analyzing', 'two', 'empirical', 'datasetsa', 'temporal', 'network', 'of', 'email', 'communications', 'and', 'a', 'network', 'of', 'drug', 'interactions', 'for', 'treating', 'different', 'cancer', 'types', 'we', 'find', 'that', 'modeling', 'all', 'layers', 'simultaneously', 'does', 'result', 'in', 'general', 'in', 'more', 'accurate', 'link', 'prediction', 'however', 'the', 'most', 'predictive', 'model', 'depends', 'on', 'the', 'dataset', 'under', 'consideration', 'whereas', 'the', 'nodebased', 'model', 'is', 'more', 'appropriate', 'for', 'predicting', 'drug', 'interactions', 'the', 'linkbased', 'model', 'is', 'more', 'appropriate', 'for', 'predicting', 'email', 'communication']] | [-0.1160387978567194, 0.01620271034840056, -0.0016799255544730626, 0.09698380137218492, -0.06932252193938064, -0.20561100630199208, 0.03874881320961696, 0.3975952922996572, -0.2598312681006706, -0.3243429389398764, 0.0793517161237747, -0.28306117556725546, -0.23045611402862157, 0.20049145989366532, -0.04510441638584085, 0.0591751576795051, 0.09994287998689448, 0.044594079058836486, -0.008959486112957273, -0.25333435297806695, 0.3297430655946407, 0.02665238683385884, 0.32928335362196187, 0.03932857442585587, 0.0929709354056018, 0.054825227233745596, -0.06558704571250606, -0.00787541987511384, -0.052920685200618156, 0.1843189078533803, 0.28907545199358803, 0.16128030008745983, 0.31899776204543956, -0.4728547763188972, -0.3135742972878849, 0.10503057538915206, 0.13257845483757966, 0.13724182400551133, 0.01922619767796919, -0.25300835452645143, 0.08923259750830338, -0.15815284720293302, -0.04712735540473231, -0.10496103093028068, -0.012533843835048816, 0.01800678269184359, -0.27539176522370645, 0.051225351154468676, 0.05371610752430142, 0.03931788701892776, -0.06355184448732282, -0.11961810381411958, -0.012004102254286409, 0.2107755742249805, 0.022216312981018907, -0.02200892095467733, 0.12684765228563372, -0.18835182225961677, -0.11405763266580728, 0.40405740674913804, -0.010012968587141265, -0.19619240608915467, 0.20502870750668295, -0.04588480465223684, -0.18196070032906445, 0.041209271032472745, 0.22752430279369412, 0.11666447035968304, -0.2001704168797861, -0.001230491597123225, -0.031237748928148956, 0.17251576039501848, -0.0009658301838071031, -0.0012128942889188799, 0.18540808577158982, 0.2814184664748609, 0.03948386201655547, 0.09513286411358209, -0.0750371460818261, -0.12993992564323195, -0.21799565539421403, -0.12702621618783963, -0.1496194062206675, -0.027105491183807746, -0.13560370933521293, -0.14887475981103146, 0.44148454219650696, 0.21206976261318605, 0.18315892321715022, 0.0823538527741809, 0.32904496941825045, 0.03735631462528973, 0.08924275645173003, 0.0775578982771977, 0.19486887686584584, 0.05552802576943684, 0.09961166276103434, -0.1305906660224804, 0.1412535722641384, 0.017645972935647212] |
1,803.01617 | Cross-Domain Recommendation for Cold-Start Users via Neighborhood Based
Feature Mapping | Collaborative Filtering (CF) is a widely adopted technique in recommender
systems. Traditional CF models mainly focus on predicting a user's preference
to the items in a single domain such as the movie domain or the music domain. A
major challenge for such models is the data sparsity problem, and especially,
CF cannot make accurate predictions for the cold-start users who have no
ratings at all. Although Cross-Domain Collaborative Filtering (CDCF) is
proposed for effectively transferring users' rating preference across different
domains, it is still difficult for existing CDCF models to tackle the
cold-start users in the target domain due to the extreme data sparsity. In this
paper, we propose a Cross-Domain Latent Feature Mapping (CDLFM) model for
cold-start users in the target domain. Firstly, in order to better characterize
users in sparse domains, we take the users' similarity relationship on rating
behaviors into consideration and propose the Matrix Factorization by
incorporating User Similarities (MFUS) in which three similarity measures are
proposed. Next, to perform knowledge transfer across domains, we propose a
neighborhood based gradient boosting trees method to learn the cross-domain
user latent feature mapping function. For each cold-start user, we learn
his/her feature mapping function based on the latent feature pairs of those
linked users who have similar rating behaviors with the cold-start user in the
auxiliary domain. And the preference of the cold-start user in the target
domain can be predicted based on the mapping function and his/her latent
features in the auxiliary domain. Experimental results on two real data sets
extracted from Amazon transaction data demonstrate the superiority of our
proposed model against other state-of-the-art methods.
| cs.IR cs.SI | collaborative filtering cf is a widely adopted technique in recommender systems traditional cf models mainly focus on predicting a users preference to the items in a single domain such as the movie domain or the music domain a major challenge for such models is the data sparsity problem and especially cf cannot make accurate predictions for the coldstart users who have no ratings at all although crossdomain collaborative filtering cdcf is proposed for effectively transferring users rating preference across different domains it is still difficult for existing cdcf models to tackle the coldstart users in the target domain due to the extreme data sparsity in this paper we propose a crossdomain latent feature mapping cdlfm model for coldstart users in the target domain firstly in order to better characterize users in sparse domains we take the users similarity relationship on rating behaviors into consideration and propose the matrix factorization by incorporating user similarities mfus in which three similarity measures are proposed next to perform knowledge transfer across domains we propose a neighborhood based gradient boosting trees method to learn the crossdomain user latent feature mapping function for each coldstart user we learn hisher feature mapping function based on the latent feature pairs of those linked users who have similar rating behaviors with the coldstart user in the auxiliary domain and the preference of the coldstart user in the target domain can be predicted based on the mapping function and hisher latent features in the auxiliary domain experimental results on two real data sets extracted from amazon transaction data demonstrate the superiority of our proposed model against other stateoftheart methods | [['collaborative', 'filtering', 'cf', 'is', 'a', 'widely', 'adopted', 'technique', 'in', 'recommender', 'systems', 'traditional', 'cf', 'models', 'mainly', 'focus', 'on', 'predicting', 'a', 'users', 'preference', 'to', 'the', 'items', 'in', 'a', 'single', 'domain', 'such', 'as', 'the', 'movie', 'domain', 'or', 'the', 'music', 'domain', 'a', 'major', 'challenge', 'for', 'such', 'models', 'is', 'the', 'data', 'sparsity', 'problem', 'and', 'especially', 'cf', 'can', 'not', 'make', 'accurate', 'predictions', 'for', 'the', 'coldstart', 'users', 'who', 'have', 'no', 'ratings', 'at', 'all', 'although', 'crossdomain', 'collaborative', 'filtering', 'cdcf', 'is', 'proposed', 'for', 'effectively', 'transferring', 'users', 'rating', 'preference', 'across', 'different', 'domains', 'it', 'is', 'still', 'difficult', 'for', 'existing', 'cdcf', 'models', 'to', 'tackle', 'the', 'coldstart', 'users', 'in', 'the', 'target', 'domain', 'due', 'to', 'the', 'extreme', 'data', 'sparsity', 'in', 'this', 'paper', 'we', 'propose', 'a', 'crossdomain', 'latent', 'feature', 'mapping', 'cdlfm', 'model', 'for', 'coldstart', 'users', 'in', 'the', 'target', 'domain', 'firstly', 'in', 'order', 'to', 'better', 'characterize', 'users', 'in', 'sparse', 'domains', 'we', 'take', 'the', 'users', 'similarity', 'relationship', 'on', 'rating', 'behaviors', 'into', 'consideration', 'and', 'propose', 'the', 'matrix', 'factorization', 'by', 'incorporating', 'user', 'similarities', 'mfus', 'in', 'which', 'three', 'similarity', 'measures', 'are', 'proposed', 'next', 'to', 'perform', 'knowledge', 'transfer', 'across', 'domains', 'we', 'propose', 'a', 'neighborhood', 'based', 'gradient', 'boosting', 'trees', 'method', 'to', 'learn', 'the', 'crossdomain', 'user', 'latent', 'feature', 'mapping', 'function', 'for', 'each', 'coldstart', 'user', 'we', 'learn', 'hisher', 'feature', 'mapping', 'function', 'based', 'on', 'the', 'latent', 'feature', 'pairs', 'of', 'those', 'linked', 'users', 'who', 'have', 'similar', 'rating', 'behaviors', 'with', 'the', 'coldstart', 'user', 'in', 'the', 'auxiliary', 'domain', 'and', 'the', 'preference', 'of', 'the', 'coldstart', 'user', 'in', 'the', 'target', 'domain', 'can', 'be', 'predicted', 'based', 'on', 'the', 'mapping', 'function', 'and', 'hisher', 'latent', 'features', 'in', 'the', 'auxiliary', 'domain', 'experimental', 'results', 'on', 'two', 'real', 'data', 'sets', 'extracted', 'from', 'amazon', 'transaction', 'data', 'demonstrate', 'the', 'superiority', 'of', 'our', 'proposed', 'model', 'against', 'other', 'stateoftheart', 'methods']] | [-0.04520185149809929, -0.05206010373111175, -0.054437332903903755, 0.10345892144958732, -0.19498742494381158, -0.19010256821942975, 0.08608959615795261, 0.4764093259738675, -0.29015321190010257, -0.3337370623128989, 0.061052075372192205, -0.3346758907461676, -0.16715650005637905, 0.10432878808455485, -0.10969850422168123, 0.05909157914101709, 0.078037003513926, 0.0743435912577908, -0.059379326928504256, -0.2797918755764406, 0.37480923373498887, 0.021247589996313928, 0.3733530164063811, 0.019972717003730028, 0.08546089097325787, 0.013947827706752873, -0.08526556863477315, -0.025766995529567738, -0.045733578659836446, 0.153537826671451, 0.3838017107311669, 0.21954271290451288, 0.3507151465294813, -0.37497650864473264, -0.24909556589659249, 0.06595164829336886, 0.13520582276222698, 0.06621006442583166, -0.06021712505156105, -0.3628684185591262, 0.08984859850354937, -0.19591810454357303, 0.04268200786203518, -0.09134052260913504, -0.04811351775685186, 0.01101831335239043, -0.3354986134669813, 0.033847745078782646, 0.04042095897385656, 0.04673080571663024, -0.07461895019601364, -0.12171711874847758, 0.05813118213450592, 0.20829522039710002, 0.08811674142558712, 0.0122138910454267, 0.12246333295045031, -0.16506021858519637, -0.14739632924824064, 0.39340217362171903, -0.03970641306008094, -0.26277353281221255, 0.21522803261177614, -0.07183108619699227, -0.12903219194120186, 0.06129629376762261, 0.24580658941335087, 0.1061492237477883, -0.17808390642627517, -0.002623885373911584, -0.07609121631761429, 0.20830206137233928, 0.04258908428262168, -0.036022747620512774, 0.19103463119201697, 0.2119103086245274, 0.0780038076145366, 0.08052416686068546, -0.07134701378223028, -0.08097561450028765, -0.1391313735764029, -0.10214435291226125, -0.21317731337526244, -0.054133120945899366, -0.12367624812563986, -0.12540242656226594, 0.4222964981141667, 0.2244276284681522, 0.22147451470599078, 0.046836319000941505, 0.3247145995264873, 0.05392263338504943, 0.09876845733596207, 0.07959570412510145, 0.10061823378608965, -0.040775650322920326, 0.16543095907258953, -0.1743736031922206, 0.13659792102755172, 0.032887605480231175] |
1,803.01618 | On the accuracy and usefulness of analytic energy models for
contemporary multicore processors | This paper presents refinements to the execution-cache-memory performance
model and a previously published power model for multicore processors. The
combination of both enables a very accurate prediction of performance and
energy consumption of contemporary multicore processors as a function of
relevant parameters such as number of active cores as well as core and Uncore
frequencies. Model validation is performed on the Sandy Bridge-EP and
Broadwell-EP microarchitectures. Production-related variations in chip quality
are demonstrated through a statistical analysis of the fit parameters obtained
on one hundred Broadwell-EP CPUs of the same model. Insights from the models
are used to explain the performance- and energy-related behavior of the
processors for scalable as well as saturating (i.e., memory-bound) codes. In
the process we demonstrate the models' capability to identify optimal operating
points with respect to highest performance, lowest energy-to-solution, and
lowest energy-delay product and identify a set of best practices for
energy-efficient execution.
| cs.PF | this paper presents refinements to the executioncachememory performance model and a previously published power model for multicore processors the combination of both enables a very accurate prediction of performance and energy consumption of contemporary multicore processors as a function of relevant parameters such as number of active cores as well as core and uncore frequencies model validation is performed on the sandy bridgeep and broadwellep microarchitectures productionrelated variations in chip quality are demonstrated through a statistical analysis of the fit parameters obtained on one hundred broadwellep cpus of the same model insights from the models are used to explain the performance and energyrelated behavior of the processors for scalable as well as saturating ie memorybound codes in the process we demonstrate the models capability to identify optimal operating points with respect to highest performance lowest energytosolution and lowest energydelay product and identify a set of best practices for energyefficient execution | [['this', 'paper', 'presents', 'refinements', 'to', 'the', 'executioncachememory', 'performance', 'model', 'and', 'a', 'previously', 'published', 'power', 'model', 'for', 'multicore', 'processors', 'the', 'combination', 'of', 'both', 'enables', 'a', 'very', 'accurate', 'prediction', 'of', 'performance', 'and', 'energy', 'consumption', 'of', 'contemporary', 'multicore', 'processors', 'as', 'a', 'function', 'of', 'relevant', 'parameters', 'such', 'as', 'number', 'of', 'active', 'cores', 'as', 'well', 'as', 'core', 'and', 'uncore', 'frequencies', 'model', 'validation', 'is', 'performed', 'on', 'the', 'sandy', 'bridgeep', 'and', 'broadwellep', 'microarchitectures', 'productionrelated', 'variations', 'in', 'chip', 'quality', 'are', 'demonstrated', 'through', 'a', 'statistical', 'analysis', 'of', 'the', 'fit', 'parameters', 'obtained', 'on', 'one', 'hundred', 'broadwellep', 'cpus', 'of', 'the', 'same', 'model', 'insights', 'from', 'the', 'models', 'are', 'used', 'to', 'explain', 'the', 'performance', 'and', 'energyrelated', 'behavior', 'of', 'the', 'processors', 'for', 'scalable', 'as', 'well', 'as', 'saturating', 'ie', 'memorybound', 'codes', 'in', 'the', 'process', 'we', 'demonstrate', 'the', 'models', 'capability', 'to', 'identify', 'optimal', 'operating', 'points', 'with', 'respect', 'to', 'highest', 'performance', 'lowest', 'energytosolution', 'and', 'lowest', 'energydelay', 'product', 'and', 'identify', 'a', 'set', 'of', 'best', 'practices', 'for', 'energyefficient', 'execution']] | [-0.10084146814734907, 0.005701191872186434, -0.029120921680778764, 0.0369955002109743, -0.05373767645867079, -0.1476345672147136, 0.07928684595800412, 0.3820651409860025, -0.22108706462528283, -0.4039784092444383, 0.10674828508300019, -0.25511443408693646, -0.10420512411416814, 0.2696683953434929, -0.05243161922217591, 0.13174111166993943, 0.08226800599329223, 0.036784083566834665, -0.054839876261633516, -0.24051607395803568, 0.21646354232614723, 0.12771373908285477, 0.32524825065027946, 0.034168154620815495, 0.09032991945106011, -0.07028534847636701, 0.013197516100543658, -0.0280303330013791, -0.07527355945765997, 0.12378524135815405, 0.25389880405477405, 0.14331481891415462, 0.2665854106538448, -0.42158893983961154, -0.18683835319649653, 0.047773293672471726, 0.13721037595985994, 0.02562073762716113, -0.0029924806135537842, -0.20202053969744718, 0.08070870000093976, -0.21019973643374124, -0.07176852725358718, -0.10877613847975263, -0.021235470503768665, 0.07393715942384763, -0.2671218599761592, 0.031419179764820025, -0.0024125285707601663, 0.05383132132482809, -0.05345923524356178, -0.17545344849310865, 0.012901886899161759, 0.15794058030958744, 0.0009749359746179199, 0.0014378472650111121, 0.14350697819781083, -0.13583149059188096, -0.16947185471747694, 0.3996050604337814, -0.05589996254065343, -0.153973792652262, 0.19760916790231162, -0.05575329587238547, -0.12507275120986489, 0.06149380897084288, 0.23394056036755842, 0.06681794242545862, -0.13192563483666553, 0.029867846634779625, 0.027307889818045116, 0.19970168622254375, 0.05152604089512321, 0.05336741536805694, 0.18056182298909298, 0.2684247227285632, 0.022546578970606496, 0.161545849211464, -0.08047799109450023, -0.10304178399090098, -0.24046424595129695, -0.15724891458937645, -0.15506923112677623, -0.0139696087083473, -0.08607738332804558, -0.15513288380028117, 0.4083407050023643, 0.1651364779959264, 0.20509421566013722, 0.10398127061108615, 0.36041679138617727, 0.040656339703069144, 0.1323197019214573, 0.1208951845124439, 0.19488222176996653, 0.06679688186084715, 0.0998709827517753, -0.20494335138038952, 0.06411556354426973, -0.02789835687164192] |
1,803.01619 | Wavenumber-explicit $hp$-FEM analysis for Maxwell's equations with
transparent boundary conditions | The time-harmonic Maxwell equations at high wavenumber $k$ are discretized by
edge elements of degree $p$ on a mesh of width $h$. For the case of a ball and
exact, transparent boundary conditions, we show quasi-optimality of the
Galerkin method under the $k$-explicit scale resolution condition that a)
$kh/p$ is sufficient small and b) $p/\log k$ is bounded from below.
| math.NA cs.NA | the timeharmonic maxwell equations at high wavenumber k are discretized by edge elements of degree p on a mesh of width h for the case of a ball and exact transparent boundary conditions we show quasioptimality of the galerkin method under the kexplicit scale resolution condition that a khp is sufficient small and b plog k is bounded from below | [['the', 'timeharmonic', 'maxwell', 'equations', 'at', 'high', 'wavenumber', 'k', 'are', 'discretized', 'by', 'edge', 'elements', 'of', 'degree', 'p', 'on', 'a', 'mesh', 'of', 'width', 'h', 'for', 'the', 'case', 'of', 'a', 'ball', 'and', 'exact', 'transparent', 'boundary', 'conditions', 'we', 'show', 'quasioptimality', 'of', 'the', 'galerkin', 'method', 'under', 'the', 'kexplicit', 'scale', 'resolution', 'condition', 'that', 'a', 'khp', 'is', 'sufficient', 'small', 'and', 'b', 'plog', 'k', 'is', 'bounded', 'from', 'below']] | [-0.18334664539434015, 0.14736369343784947, -0.04569368782298019, -0.01970104855718091, -0.0793127914541401, -0.14696039232658223, 0.028336597280576824, 0.35343464047958456, -0.2803316837797562, -0.2597804434442272, 0.12205684637495627, -0.23138957615786543, -0.049789624148979784, 0.13283965652808546, -0.0463356952687415, 0.09991020573070272, 0.08203743601528307, 0.05950907863831768, -0.059413841844070704, -0.18686573238422474, 0.31422490449622276, 0.0030496034771203993, 0.23983229914059243, 0.08164156103642502, 0.11479551033116878, -0.056686984875705095, 0.019206771491250645, 0.058422462455928324, -0.19865327721599896, 0.03424573550776889, 0.21261288411915302, 0.04900368629799535, 0.28136558178812265, -0.38161300177065033, -0.167322847712785, 0.0574153626182427, 0.08300644172898804, 0.04702753253125896, 0.005874383781338111, -0.2510726796424327, 0.19932443429715932, -0.02463884497822922, -0.18921835496245573, -0.017673441705604396, 0.053171595884487034, 0.013264713156968356, -0.3794812464620918, 0.10113505040838694, 0.08978305850178003, 0.10661486556443076, -0.08392667525525516, -0.1569826617371291, -0.04293967945656429, 0.018077351331400374, -0.039097547527247416, 0.005546278537561496, 0.0470482606596003, -0.11144644760837158, 0.02615888377962013, 0.3882852020518233, -0.09043468088493682, -0.24264676949630182, 0.14781084711042544, -0.1703040182357654, -0.03700892793325086, 0.21743538813510288, 0.14831950770070154, 0.20886381827294825, -0.06030749160951624, 0.21474913914959567, -0.08866858701027619, 0.15306638373294845, 0.14838394183510292, -0.009261438281585772, 0.08479959851441284, 0.11577104609459639, 0.17154636643826962, 0.10634565524136026, -0.0716116134232531, 0.00011206651106476784, -0.40801310651004313, -0.12183049156058891, -0.22664472157290827, 0.04652061494998634, -0.14917216650937917, -0.16991853212627273, 0.30794710100938877, 0.09444534260158738, 0.17829287784794967, 0.07498027568993469, 0.2638348471683761, 0.1483585344113332, 0.023812780797986002, 0.12289826786145568, 0.13263536157707373, 0.18679572376810635, 0.09972076776903123, -0.23739418626064435, 0.0024215037391210597, 0.15137106461988878] |
1,803.0162 | Extracting maximum power from active colloidal heat engines | Colloidal heat engines extract power out of a fluctuating bath by
manipulating a confined tracer. Considering a self-propelled tracer surrounded
by a bath of passive colloids, we optimize the engine performances based on the
maximum available power. Our approach relies on an adiabatic mean-field
treatment of the bath particles which reduces the many-body description into an
effective tracer dynamics. It leads us to reveal that, when operated at
constant activity, an engine can only produce less maximum power than its
passive counterpart. In contrast, the output power of an isothermal engine,
operating with cyclic variations of the self-propulsion without any passive
equivalent, exhibits an optimum in terms of confinement and activity. Direct
numerical simulations of the microscopic dynamics support the validity of these
results even beyond the mean-field regime, with potential relevance to the
design of experimental engines.
| cond-mat.stat-mech cond-mat.soft | colloidal heat engines extract power out of a fluctuating bath by manipulating a confined tracer considering a selfpropelled tracer surrounded by a bath of passive colloids we optimize the engine performances based on the maximum available power our approach relies on an adiabatic meanfield treatment of the bath particles which reduces the manybody description into an effective tracer dynamics it leads us to reveal that when operated at constant activity an engine can only produce less maximum power than its passive counterpart in contrast the output power of an isothermal engine operating with cyclic variations of the selfpropulsion without any passive equivalent exhibits an optimum in terms of confinement and activity direct numerical simulations of the microscopic dynamics support the validity of these results even beyond the meanfield regime with potential relevance to the design of experimental engines | [['colloidal', 'heat', 'engines', 'extract', 'power', 'out', 'of', 'a', 'fluctuating', 'bath', 'by', 'manipulating', 'a', 'confined', 'tracer', 'considering', 'a', 'selfpropelled', 'tracer', 'surrounded', 'by', 'a', 'bath', 'of', 'passive', 'colloids', 'we', 'optimize', 'the', 'engine', 'performances', 'based', 'on', 'the', 'maximum', 'available', 'power', 'our', 'approach', 'relies', 'on', 'an', 'adiabatic', 'meanfield', 'treatment', 'of', 'the', 'bath', 'particles', 'which', 'reduces', 'the', 'manybody', 'description', 'into', 'an', 'effective', 'tracer', 'dynamics', 'it', 'leads', 'us', 'to', 'reveal', 'that', 'when', 'operated', 'at', 'constant', 'activity', 'an', 'engine', 'can', 'only', 'produce', 'less', 'maximum', 'power', 'than', 'its', 'passive', 'counterpart', 'in', 'contrast', 'the', 'output', 'power', 'of', 'an', 'isothermal', 'engine', 'operating', 'with', 'cyclic', 'variations', 'of', 'the', 'selfpropulsion', 'without', 'any', 'passive', 'equivalent', 'exhibits', 'an', 'optimum', 'in', 'terms', 'of', 'confinement', 'and', 'activity', 'direct', 'numerical', 'simulations', 'of', 'the', 'microscopic', 'dynamics', 'support', 'the', 'validity', 'of', 'these', 'results', 'even', 'beyond', 'the', 'meanfield', 'regime', 'with', 'potential', 'relevance', 'to', 'the', 'design', 'of', 'experimental', 'engines']] | [-0.10496035013837146, 0.1312493615142834, -0.09154750468492832, 0.007248587457571125, -0.04808426067988942, -0.16688045414259145, 0.06246151115519224, 0.34269344021795667, -0.22026233512408816, -0.31915660885810526, 0.03066539438272678, -0.29901072458175104, -0.08432451253959342, 0.24331514563654427, -0.0007275655744192393, 0.01877726041467226, 0.032212320492481405, 0.03718164355149898, -0.011544759344795475, -0.16556463250821832, 0.20809609326196538, 0.14562543811600492, 0.29469732392370107, 0.038711028399647796, 0.11081595588273005, -0.0010676474539913993, 0.00888756162190027, 0.04994718319452975, -0.11268296905657643, 0.059101460150618484, 0.19755758734865356, 0.0349378811424949, 0.26832544152368454, -0.4759282433238906, -0.2640618960629555, 0.11127641039185118, 0.15001307727357346, 0.08368331975678144, -0.08975584015327816, -0.23437907887568724, 0.025301576015013066, -0.19626898462276743, -0.1255457585144356, -0.08872601462771064, -0.006242041550306738, 0.05892813621439796, -0.26858794320867385, 0.09497534680628197, 0.08499698309511271, 0.07468443520475125, -0.06140498562287404, -0.02476036593493452, 0.00812717211479996, 0.12825475135785225, -0.004524830492986096, -0.021500262539779793, 0.2875542287863251, -0.1804056056404817, -0.09425950686420327, 0.3948856615798845, -0.08819224652583268, -0.19660749527342294, 0.2283932964378239, -0.10282633204580001, -0.046562304568436484, 0.1741573276349168, 0.15804421632091745, 0.1301202149698983, -0.16790995889132845, 0.012898410481073475, -0.017099818673686706, 0.23783161001536401, 0.0005797715587676436, 0.0036471472189262295, 0.25738730837769835, 0.2218377789857028, 0.05017381093964197, 0.20115773965844183, -0.055507752377720404, -0.1659466869027381, -0.26221115685041074, -0.12128719069954494, -0.22034890894724082, 0.06629456075556252, -0.15224378467488955, -0.13556871259504039, 0.37349379793538345, 0.16115981664009177, 0.1346839967932876, 0.061801385509855776, 0.3117583401069261, 0.11191594076049312, 0.040984385662064284, 0.10745121165772603, 0.28736036924807273, 0.13197550096927022, 0.11235239594985826, -0.31781455138495757, 0.053289262143390144, 0.04213486288579694] |
1,803.01621 | Proximal Gradient Algorithms: Applications in Signal Processing | Advances in numerical optimization have supported breakthroughs in several
areas of signal processing. This paper focuses on the recent enhanced variants
of the proximal gradient numerical optimization algorithm, which combine
quasi-Newton methods with forward-adjoint oracles to tackle large-scale
problems and reduce the computational burden of many applications. These
proximal gradient algorithms are here described in an easy-to-understand way,
illustrating how they are able to address a wide variety of problems arising in
signal processing. A new high-level modeling language is presented which is
used to demonstrate the versatility of the presented algorithms in a series of
signal processing application examples such as sparse deconvolution, total
variation denoising, audio de-clipping and others.
| eess.SP math.OC | advances in numerical optimization have supported breakthroughs in several areas of signal processing this paper focuses on the recent enhanced variants of the proximal gradient numerical optimization algorithm which combine quasinewton methods with forwardadjoint oracles to tackle largescale problems and reduce the computational burden of many applications these proximal gradient algorithms are here described in an easytounderstand way illustrating how they are able to address a wide variety of problems arising in signal processing a new highlevel modeling language is presented which is used to demonstrate the versatility of the presented algorithms in a series of signal processing application examples such as sparse deconvolution total variation denoising audio declipping and others | [['advances', 'in', 'numerical', 'optimization', 'have', 'supported', 'breakthroughs', 'in', 'several', 'areas', 'of', 'signal', 'processing', 'this', 'paper', 'focuses', 'on', 'the', 'recent', 'enhanced', 'variants', 'of', 'the', 'proximal', 'gradient', 'numerical', 'optimization', 'algorithm', 'which', 'combine', 'quasinewton', 'methods', 'with', 'forwardadjoint', 'oracles', 'to', 'tackle', 'largescale', 'problems', 'and', 'reduce', 'the', 'computational', 'burden', 'of', 'many', 'applications', 'these', 'proximal', 'gradient', 'algorithms', 'are', 'here', 'described', 'in', 'an', 'easytounderstand', 'way', 'illustrating', 'how', 'they', 'are', 'able', 'to', 'address', 'a', 'wide', 'variety', 'of', 'problems', 'arising', 'in', 'signal', 'processing', 'a', 'new', 'highlevel', 'modeling', 'language', 'is', 'presented', 'which', 'is', 'used', 'to', 'demonstrate', 'the', 'versatility', 'of', 'the', 'presented', 'algorithms', 'in', 'a', 'series', 'of', 'signal', 'processing', 'application', 'examples', 'such', 'as', 'sparse', 'deconvolution', 'total', 'variation', 'denoising', 'audio', 'declipping', 'and', 'others']] | [-0.06879143420237678, -0.04892848919841633, -0.05503161681967007, 0.05471173349688216, -0.10964134458225926, -0.13425465448767887, -0.025878135147420607, 0.4468444870734537, -0.36796129890927326, -0.3408785804472696, 0.151134924194356, -0.24210288656009193, -0.24652730632648878, 0.2734444815883631, -0.1669054324612827, 0.1237890963224476, 0.10585314739256392, -0.03526474999867984, -0.11214173285328355, -0.28249945219706846, 0.19759890904675262, 0.03023896936897759, 0.2766741918576126, 0.03994687392821049, 0.09725326007685146, -0.04719003732525953, -0.07311135755751182, 0.020351614492634933, -0.05376494696011414, 0.2127896083753791, 0.3663443365545423, 0.22729924814943392, 0.3659029139171335, -0.4543999058974756, -0.2516283102685938, 0.09977940159329625, 0.17345384990813228, 0.10799892237284095, -0.1441693025135628, -0.2652198282817194, 0.06659473986406853, -0.11758603278530745, 0.0012658254992267168, -0.14981454917070297, -0.0379477080024846, 0.07141031655860511, -0.25381109124518353, 0.036627217351148524, 0.03446758173506807, 0.05888282399423219, -0.0005431616813078657, -0.15654367553321896, 0.1168323457828379, 0.09110168016175865, 0.05557848543750944, 0.02616772755481269, 0.16399074152850354, -0.13575760815879917, -0.2115834078852188, 0.3740444811279172, -0.03022805132341009, -0.21024318617508486, 0.22538115396290212, -0.0043311941181519275, -0.21470544297617297, 0.13279962004372128, 0.26658640992366245, 0.1349390476841379, -0.1550868326957497, 0.09789249404478527, 0.0314382084704063, 0.13774506814005943, 0.046245387910554804, 0.0018972941162484186, 0.12328327929408096, 0.20679675242318227, 0.10754297070597457, 0.15417777155400128, -0.06789039047896392, -0.08930846316706356, -0.238054413138679, -0.1187599840876017, -0.19545132117262026, -0.06920090150759295, -0.07790661339311407, -0.1633126926818141, 0.39400202314461674, 0.2093505695009151, 0.18484598554477835, 0.027228074730898312, 0.36847231714977874, 0.08307442652913197, 0.04591676858799146, 0.05908637360338256, 0.1657864320939323, 0.15261326330034314, 0.1523774901094536, -0.1974680902906232, 0.024343725080971042, 0.03962209492686901] |
1,803.01622 | Lie symmetry analysis and group invariant solutions of the nonlinear
Helmholtz equation | We consider the nonlinear Helmholtz (NLH) equation describing the beam
propagation in a planar waveguide with Kerr-like nonlinearity under
non-paraxial approximation. By applying the Lie symmetry analysis, we determine
the Lie point symmetries and the corresponding symmetry reductions in the form
of ordinary differential equations (ODEs) with the help of the optimal systems
of one-dimensional subalgebras. Our investigation reveals an important fact
that in spite of the original NLH equation being non-integrable, its symmetry
reductions are of Painlev\'e integrable. We study the resulting sets of
nonlinear ODEs analytically either by constructing the integrals of motion
using the modified Prelle-Singer method or by obtaining explicit travelling
wave-like solutions including solitary and symbiotic solitary wave solutions.
Also, we carry out a detailed numerical analysis of the reduced equations and
obtain multi-peak nonlinear wave trains. As a special case of the NLH equation,
we also make a comparison between the symmetries of the present NLH system and
that of the standard nonlinear Schr\"odinger equation for which symmetries are
long available in the literature.
| nlin.SI nlin.PS | we consider the nonlinear helmholtz nlh equation describing the beam propagation in a planar waveguide with kerrlike nonlinearity under nonparaxial approximation by applying the lie symmetry analysis we determine the lie point symmetries and the corresponding symmetry reductions in the form of ordinary differential equations odes with the help of the optimal systems of onedimensional subalgebras our investigation reveals an important fact that in spite of the original nlh equation being nonintegrable its symmetry reductions are of painleve integrable we study the resulting sets of nonlinear odes analytically either by constructing the integrals of motion using the modified prellesinger method or by obtaining explicit travelling wavelike solutions including solitary and symbiotic solitary wave solutions also we carry out a detailed numerical analysis of the reduced equations and obtain multipeak nonlinear wave trains as a special case of the nlh equation we also make a comparison between the symmetries of the present nlh system and that of the standard nonlinear schrodinger equation for which symmetries are long available in the literature | [['we', 'consider', 'the', 'nonlinear', 'helmholtz', 'nlh', 'equation', 'describing', 'the', 'beam', 'propagation', 'in', 'a', 'planar', 'waveguide', 'with', 'kerrlike', 'nonlinearity', 'under', 'nonparaxial', 'approximation', 'by', 'applying', 'the', 'lie', 'symmetry', 'analysis', 'we', 'determine', 'the', 'lie', 'point', 'symmetries', 'and', 'the', 'corresponding', 'symmetry', 'reductions', 'in', 'the', 'form', 'of', 'ordinary', 'differential', 'equations', 'odes', 'with', 'the', 'help', 'of', 'the', 'optimal', 'systems', 'of', 'onedimensional', 'subalgebras', 'our', 'investigation', 'reveals', 'an', 'important', 'fact', 'that', 'in', 'spite', 'of', 'the', 'original', 'nlh', 'equation', 'being', 'nonintegrable', 'its', 'symmetry', 'reductions', 'are', 'of', 'painleve', 'integrable', 'we', 'study', 'the', 'resulting', 'sets', 'of', 'nonlinear', 'odes', 'analytically', 'either', 'by', 'constructing', 'the', 'integrals', 'of', 'motion', 'using', 'the', 'modified', 'prellesinger', 'method', 'or', 'by', 'obtaining', 'explicit', 'travelling', 'wavelike', 'solutions', 'including', 'solitary', 'and', 'symbiotic', 'solitary', 'wave', 'solutions', 'also', 'we', 'carry', 'out', 'a', 'detailed', 'numerical', 'analysis', 'of', 'the', 'reduced', 'equations', 'and', 'obtain', 'multipeak', 'nonlinear', 'wave', 'trains', 'as', 'a', 'special', 'case', 'of', 'the', 'nlh', 'equation', 'we', 'also', 'make', 'a', 'comparison', 'between', 'the', 'symmetries', 'of', 'the', 'present', 'nlh', 'system', 'and', 'that', 'of', 'the', 'standard', 'nonlinear', 'schrodinger', 'equation', 'for', 'which', 'symmetries', 'are', 'long', 'available', 'in', 'the', 'literature']] | [-0.1749145754804725, 0.03159814615304212, -0.06858352668966879, 0.0680742385550676, -0.127757402287577, -0.1300147405524245, -0.03587749160634463, 0.3202678698608104, -0.2580300924313419, -0.23586283857276774, 0.1201824254301541, -0.2990590648020289, -0.1841317184310516, 0.18511637117686297, 0.04145882560268921, 0.10621981150710352, 0.08040550988414051, 0.000761527700952309, -0.11796648587264559, -0.20197094090159654, 0.35658576169106015, -0.021839435556081727, 0.25109207091770847, -0.045452051830601276, 0.15560664684402153, 0.008442637924556894, 0.0035927993570700947, -0.030709725736832137, -0.14648212409511496, 0.08571809167316292, 0.23164453868452897, 0.03892064767903374, 0.21923998029738226, -0.45059412774794244, -0.22763190700617783, 0.06694394134478096, 0.18048711531412076, 0.17793168738169376, -0.0505358051864759, -0.3351600725463975, 0.011918379080837921, -0.12192225037690471, -0.2328206037335536, -0.09113355298417018, 0.004447243590017452, 0.1004681005334372, -0.2129424435826128, 0.12037559587796054, 0.0892285100869177, 0.03264396937807118, -0.1033794853651403, -0.04332012934815686, -0.06660683453493917, 0.020808269824449194, 0.04609747787752199, -0.062481624796055256, 0.012743573265341932, -0.1385810268111527, -0.09093135809902485, 0.4232926924219903, -0.06059820054934415, -0.2760284082744928, 0.12608668621328167, -0.10888652423831552, -0.09496511026997777, 0.1486879026003675, 0.17312635221682926, 0.12560948180034756, -0.1546662231797681, 0.10714602553532185, -0.0516518332541797, 0.1381954356288428, 0.11246685574707739, -0.007949541424236753, 0.1273215040400186, 0.153311169845641, 0.04622263992718859, 0.15011220823370797, 0.004775465718087028, -0.14299676608266856, -0.3547669337843271, -0.13522506499498643, -0.08928040516672327, 0.08485187645642059, -0.09443673119462534, -0.16455751418629114, 0.428227062291904, 0.12163868674816673, 0.11505869596593958, 0.026771179333959214, 0.2189701823901166, 0.23733358442071167, 0.013392440677168506, 0.06660257624462247, 0.2476021812954808, 0.18200283514417928, 0.10677735445993569, -0.2830917818362222, -0.06081201608895379, 0.11685107895994888] |
1,803.01623 | On the partially symmetric rank of tensor products of W-states and other
symmetric tensors | Given tensors $T$ and $T'$ of order $k$ and $k'$ respectively, the tensor
product $T \otimes T'$ is a tensor of order $k+k'$. It was recently shown that
the tensor rank can be strictly submultiplicative under this operation
([Christandl-Jensen-Zuiddam]). We study this phenomenon for symmetric tensors
where additional techniques from algebraic geometry become available. The
tensor product of symmetric tensors results in a partially symmetric tensor and
our results amount to bounds on the partially symmetric rank. Following
motivations from algebraic complexity theory and quantum information theory, we
focus on the so-called "W-states", namely monomials of the form $x^{d-1}y$, and
on products of such. In particular, we prove that the partially symmetric rank
of $x^{d_1 -1}y \otimes ... \otimes x^{d_k-1} y$ is at most $2^{k-1}(d_1+ ...
+d_k)$.
| math.AG quant-ph | given tensors t and t of order k and k respectively the tensor product t otimes t is a tensor of order kk it was recently shown that the tensor rank can be strictly submultiplicative under this operation christandljensenzuiddam we study this phenomenon for symmetric tensors where additional techniques from algebraic geometry become available the tensor product of symmetric tensors results in a partially symmetric tensor and our results amount to bounds on the partially symmetric rank following motivations from algebraic complexity theory and quantum information theory we focus on the socalled wstates namely monomials of the form xd1y and on products of such in particular we prove that the partially symmetric rank of xd_1 1y otimes otimes xd_k1 y is at most 2k1d_1 d_k | [['given', 'tensors', 't', 'and', 't', 'of', 'order', 'k', 'and', 'k', 'respectively', 'the', 'tensor', 'product', 't', 'otimes', 't', 'is', 'a', 'tensor', 'of', 'order', 'kk', 'it', 'was', 'recently', 'shown', 'that', 'the', 'tensor', 'rank', 'can', 'be', 'strictly', 'submultiplicative', 'under', 'this', 'operation', 'christandljensenzuiddam', 'we', 'study', 'this', 'phenomenon', 'for', 'symmetric', 'tensors', 'where', 'additional', 'techniques', 'from', 'algebraic', 'geometry', 'become', 'available', 'the', 'tensor', 'product', 'of', 'symmetric', 'tensors', 'results', 'in', 'a', 'partially', 'symmetric', 'tensor', 'and', 'our', 'results', 'amount', 'to', 'bounds', 'on', 'the', 'partially', 'symmetric', 'rank', 'following', 'motivations', 'from', 'algebraic', 'complexity', 'theory', 'and', 'quantum', 'information', 'theory', 'we', 'focus', 'on', 'the', 'socalled', 'wstates', 'namely', 'monomials', 'of', 'the', 'form', 'xd1y', 'and', 'on', 'products', 'of', 'such', 'in', 'particular', 'we', 'prove', 'that', 'the', 'partially', 'symmetric', 'rank', 'of', 'xd_1', '1y', 'otimes', 'otimes', 'xd_k1', 'y', 'is', 'at', 'most', '2k1d_1', 'd_k']] | [-0.14088665521491997, 0.17477568573018243, -0.044060237925068656, -0.007996288851703986, -0.07346295619244911, -0.1316783621845659, -0.04429450400620083, 0.33970449109800344, -0.29511614505313183, -0.1740910648945565, 0.14413961918431928, -0.27100309697249214, -0.17313736590868525, 0.10200269003437201, -0.018596093139557308, -0.012390469363505744, -0.019048120699003183, 0.1436978523236553, -0.12005232677464027, -0.2821633979093191, 0.38626910018742333, -0.01209938903469092, 0.2684580007229339, 0.07328731446740533, 0.10357154706831682, 0.005550953621152511, -0.02346692391895412, 0.029317268624532322, -0.12223976901754033, 0.121421587031935, 0.2926509965149578, 0.15277067248032175, 0.18095608463526264, -0.3774077993594418, -0.11751568144233512, 0.16253230476478683, 0.049800360071172646, 0.058100985201491304, -0.000558571667749096, -0.2681348125935217, 0.14072749882259153, -0.2204776991866837, -0.0712911391030412, -0.11628998514680454, 0.04138947284707322, -0.08436396175972379, -0.3215359263429957, 0.051390216978313016, 0.11483744279412199, 0.048208038030146075, -0.05531250470133175, -0.21190237166352324, -0.025844032870420863, 0.03659546815536239, 0.021717208964857928, 0.021598078984928833, 0.057568235480619116, -0.10308644334854912, -0.09817036238214201, 0.3426905597352292, -0.07769217890348624, -0.22516383090639036, 0.13581754768667512, -0.1507720141873641, -0.16948434589661596, 0.06474215646797776, 0.15241442444688094, 0.18064216914281733, -0.03923558974099799, 0.19364629106063103, -0.09199808659570768, 0.13522724845650613, 0.07972430996596813, 0.03639034757944794, 0.10691061408777552, 0.03608046621199666, 0.08501084465995308, 0.16089174515771687, 0.02412050371135254, -0.07430689383205796, -0.31793512445528155, -0.16895879571872555, -0.18599141626580318, 0.14488592824498422, -0.1213507546637013, -0.10249020636427093, 0.37273207159659033, 0.04401677230773263, 0.1782518469767976, 0.060510281527276374, 0.25713857956045916, 0.06011370290551827, 0.07465484816858098, 0.10737801835802961, 0.15155860956869865, 0.2544425024597113, 0.030339679076559534, -0.1514990186570828, 0.038415245488593895, 0.13400326255893658] |
1,803.01624 | Dynamical obstruction to perpetual motion from Lorentz-violating black
holes | Black holes in Lorentz-violating theories have been claimed to violate the
second law of thermodynamics by perpetual motion energy extraction. We revisit
this question for a Penrose splitting process in a spherically symmetric
setting with two species of particles that move on radial geodesics that extend
to infinity. We show that energy extraction by this process cannot happen in
any theory in which gravity is attractive, in the sense of a geometric
inequality that we describe. This inequality is satisfied by all known
Einstein-\ae{}ther and Ho\v{r}ava black hole solutions.
| gr-qc hep-th | black holes in lorentzviolating theories have been claimed to violate the second law of thermodynamics by perpetual motion energy extraction we revisit this question for a penrose splitting process in a spherically symmetric setting with two species of particles that move on radial geodesics that extend to infinity we show that energy extraction by this process cannot happen in any theory in which gravity is attractive in the sense of a geometric inequality that we describe this inequality is satisfied by all known einsteinaether and hovrava black hole solutions | [['black', 'holes', 'in', 'lorentzviolating', 'theories', 'have', 'been', 'claimed', 'to', 'violate', 'the', 'second', 'law', 'of', 'thermodynamics', 'by', 'perpetual', 'motion', 'energy', 'extraction', 'we', 'revisit', 'this', 'question', 'for', 'a', 'penrose', 'splitting', 'process', 'in', 'a', 'spherically', 'symmetric', 'setting', 'with', 'two', 'species', 'of', 'particles', 'that', 'move', 'on', 'radial', 'geodesics', 'that', 'extend', 'to', 'infinity', 'we', 'show', 'that', 'energy', 'extraction', 'by', 'this', 'process', 'can', 'not', 'happen', 'in', 'any', 'theory', 'in', 'which', 'gravity', 'is', 'attractive', 'in', 'the', 'sense', 'of', 'a', 'geometric', 'inequality', 'that', 'we', 'describe', 'this', 'inequality', 'is', 'satisfied', 'by', 'all', 'known', 'einsteinaether', 'and', 'hovrava', 'black', 'hole', 'solutions']] | [-0.13336149535348846, 0.13018131555420243, -0.09755921357104348, 0.13017553220419764, -0.08728705189811686, -0.18955081819763614, 0.016071946943540954, 0.2982741007051017, -0.20059280051953263, -0.2688968198787835, 0.06213922704854566, -0.2862735512149003, -0.12961928196665312, 0.1445930300332192, -0.10219679551406038, 0.026280515568537846, 0.003473059708873431, 0.03637573633136021, -0.03124151162078811, -0.2477191018160536, 0.3745553069023622, 0.04333983201326595, 0.2433429428169297, 0.047074188376104255, 0.10188353174792913, 0.001326093382926451, 0.038918801247038774, 0.062219588743108845, -0.18515078488692072, 0.10141120506450534, 0.2138001127116796, 0.14073742737527936, 0.23245718291857176, -0.40496683986857535, -0.26756051120658714, 0.1373208749224432, 0.16652022246271372, 0.15097839714209033, -0.09968815684551373, -0.24640819332044986, 0.06541050682879157, -0.19691956899025373, -0.1803171990180595, -0.07976523092430499, 0.04443049679717256, -0.0200850370236569, -0.2086088802303291, 0.1373558721686196, 0.1379995699144072, -0.0639999945130613, -0.10567509951587352, 0.003926308184034295, 0.014380717060218255, 0.04290752150635752, 0.11492993471975853, -0.004889248239083423, 0.11881600090612968, -0.07849544193854349, -0.16156487718560836, 0.3710488388521804, -0.06173387312640746, -0.24786640295965803, 0.14647534339067836, -0.21525029429855447, -0.187602888347788, 0.05613607049195303, 0.1376162629108876, 0.17997099146830603, -0.20311058108798333, 0.17048408405583662, -0.04603236053759853, 0.13234389518879147, 0.17146639082736026, -0.0051675938587221835, 0.28461790949934057, 0.057768597329656286, 0.07504226768441084, 0.13329122205161387, 0.00022067382362567716, -0.13034470121169256, -0.3422089679373635, -0.18510485189294235, -0.18755718381014755, 0.10982359914746162, -0.0910987049339585, -0.1490090839150879, 0.2800550784294804, 0.145588593651256, 0.14759072251617908, 0.032644779326963344, 0.22232948945428588, 0.10974912169492906, 0.05109337482394444, 0.10866798937527669, 0.33955163737345073, 0.10043855263696362, 0.14295170318800957, -0.17370096713388597, -0.008990081560073627, 0.1464346879110154] |
1,803.01625 | A New 3D Maser Code Applied to Flaring Events | We set out the theory and discretization scheme for a new finite-element
computer code, written specifically for the simulation of maser sources. The
code was used to compute fractional inversions at each node of a 3-D domain for
a range of optical thicknesses. Saturation behaviour of the nodes with regard
to location and optical depth were broadly as expected. We have demonstrated
via formal solutions of the radiative transfer equation that the apparent size
of the model maser cloud decreases as expected with optical depth as viewed by
a distant observer. Simulations of rotation of the cloud allowed the
construction of light-curves for a number of observable quantities. Rotation of
the model cloud may be a reasonable model for quasi-periodic variability, but
cannot explain periodic flaring.
| astro-ph.SR | we set out the theory and discretization scheme for a new finiteelement computer code written specifically for the simulation of maser sources the code was used to compute fractional inversions at each node of a 3d domain for a range of optical thicknesses saturation behaviour of the nodes with regard to location and optical depth were broadly as expected we have demonstrated via formal solutions of the radiative transfer equation that the apparent size of the model maser cloud decreases as expected with optical depth as viewed by a distant observer simulations of rotation of the cloud allowed the construction of lightcurves for a number of observable quantities rotation of the model cloud may be a reasonable model for quasiperiodic variability but cannot explain periodic flaring | [['we', 'set', 'out', 'the', 'theory', 'and', 'discretization', 'scheme', 'for', 'a', 'new', 'finiteelement', 'computer', 'code', 'written', 'specifically', 'for', 'the', 'simulation', 'of', 'maser', 'sources', 'the', 'code', 'was', 'used', 'to', 'compute', 'fractional', 'inversions', 'at', 'each', 'node', 'of', 'a', '3d', 'domain', 'for', 'a', 'range', 'of', 'optical', 'thicknesses', 'saturation', 'behaviour', 'of', 'the', 'nodes', 'with', 'regard', 'to', 'location', 'and', 'optical', 'depth', 'were', 'broadly', 'as', 'expected', 'we', 'have', 'demonstrated', 'via', 'formal', 'solutions', 'of', 'the', 'radiative', 'transfer', 'equation', 'that', 'the', 'apparent', 'size', 'of', 'the', 'model', 'maser', 'cloud', 'decreases', 'as', 'expected', 'with', 'optical', 'depth', 'as', 'viewed', 'by', 'a', 'distant', 'observer', 'simulations', 'of', 'rotation', 'of', 'the', 'cloud', 'allowed', 'the', 'construction', 'of', 'lightcurves', 'for', 'a', 'number', 'of', 'observable', 'quantities', 'rotation', 'of', 'the', 'model', 'cloud', 'may', 'be', 'a', 'reasonable', 'model', 'for', 'quasiperiodic', 'variability', 'but', 'can', 'not', 'explain', 'periodic', 'flaring']] | [-0.10348120615927606, 0.08192495264728943, -0.06225727908826602, 0.05169915875757304, -0.05324014851559452, -0.13527070478660855, 0.05690715374978714, 0.3998598387890209, -0.2759009164970691, -0.3406016612205449, 0.11122276435796846, -0.23982814939208622, -0.07028392820589714, 0.2262314687332681, -0.03134640074870366, 0.08677733765697788, 0.0592299197492461, -0.012479390179019743, -0.051983020728541995, -0.17462708624299822, 0.27369528506354496, 0.08692395437772818, 0.22156772864102495, -0.0007045782413186989, 0.09225366933740617, -0.07354153894386657, -0.04424209849483619, 0.03812839319254822, -0.10687211631297906, 0.09149131201863964, 0.21978167594065817, 0.1089204718454147, 0.21169582245446097, -0.4116269964578114, -0.2705065960561358, 0.06626581691029504, 0.1691708773682554, 0.13509397388721897, -0.0034867649555103634, -0.24381888512059988, 0.06525594317610925, -0.19004102023391742, -0.18047022935384371, -0.02304374974396989, 0.06417738691734987, 0.05179929776542534, -0.2700712177389133, 0.047978898279339544, -0.00853897592485479, 0.11167657114272042, -0.09376898147514105, -0.07545545505447768, -0.060403725963753215, 0.13029174676153985, 0.007713872269272629, 0.042218038672947975, 0.12335404647536224, -0.12185864986514482, -0.1045347915560843, 0.4134055952006203, -0.059156177682787414, -0.14562028994615095, 0.17572235059557761, -0.13876212273511712, -0.10149018266274938, 0.14308680538234747, 0.19320108154495283, 0.11715123527609986, -0.11440363254280776, 0.0072696424615532745, -0.062347087312460414, 0.20383904585578133, 0.04750530021338482, 0.04370825013189804, 0.25194254968183366, 0.13619021041773435, 0.023106217841749762, 0.16059265768166456, -0.16661869409112773, -0.08675997888332042, -0.30639276977657803, -0.12744525284345964, -0.1769988872738753, 0.04578320719826486, -0.10928580566381808, -0.1734517651136165, 0.3931836471994585, 0.16443162014447593, 0.16908275078263457, 0.05316710538106171, 0.29368490932553304, 0.13461674198769052, 0.09619498673797124, 0.07933630667421526, 0.22522851824210444, 0.1043307574220207, 0.11797578210436453, -0.2386738077873056, 0.0827004430489248, 0.04943115595273498] |
1,803.01626 | Variance-Aware Regret Bounds for Undiscounted Reinforcement Learning in
MDPs | The problem of reinforcement learning in an unknown and discrete Markov
Decision Process (MDP) under the average-reward criterion is considered, when
the learner interacts with the system in a single stream of observations,
starting from an initial state without any reset. We revisit the minimax lower
bound for that problem by making appear the local variance of the bias function
in place of the diameter of the MDP. Furthermore, we provide a novel analysis
of the KL-UCRL algorithm establishing a high-probability regret bound scaling
as $\widetilde {\mathcal O}\Bigl({\textstyle \sqrt{S\sum_{s,a}{\bf
V}^\star_{s,a}T}}\Big)$ for this algorithm for ergodic MDPs, where $S$ denotes
the number of states and where ${\bf V}^\star_{s,a}$ is the variance of the
bias function with respect to the next-state distribution following action $a$
in state $s$. The resulting bound improves upon the best previously known
regret bound $\widetilde {\mathcal O}(DS\sqrt{AT})$ for that algorithm, where
$A$ and $D$ respectively denote the maximum number of actions (per state) and
the diameter of MDP. We finally compare the leading terms of the two bounds in
some benchmark MDPs indicating that the derived bound can provide an order of
magnitude improvement in some cases. Our analysis leverages novel variations of
the transportation lemma combined with Kullback-Leibler concentration
inequalities, that we believe to be of independent interest.
| stat.ML cs.LG cs.SY | the problem of reinforcement learning in an unknown and discrete markov decision process mdp under the averagereward criterion is considered when the learner interacts with the system in a single stream of observations starting from an initial state without any reset we revisit the minimax lower bound for that problem by making appear the local variance of the bias function in place of the diameter of the mdp furthermore we provide a novel analysis of the klucrl algorithm establishing a highprobability regret bound scaling as widetilde mathcal obigltextstyle sqrtssum_sabf vstar_satbig for this algorithm for ergodic mdps where s denotes the number of states and where bf vstar_sa is the variance of the bias function with respect to the nextstate distribution following action a in state s the resulting bound improves upon the best previously known regret bound widetilde mathcal odssqrtat for that algorithm where a and d respectively denote the maximum number of actions per state and the diameter of mdp we finally compare the leading terms of the two bounds in some benchmark mdps indicating that the derived bound can provide an order of magnitude improvement in some cases our analysis leverages novel variations of the transportation lemma combined with kullbackleibler concentration inequalities that we believe to be of independent interest | [['the', 'problem', 'of', 'reinforcement', 'learning', 'in', 'an', 'unknown', 'and', 'discrete', 'markov', 'decision', 'process', 'mdp', 'under', 'the', 'averagereward', 'criterion', 'is', 'considered', 'when', 'the', 'learner', 'interacts', 'with', 'the', 'system', 'in', 'a', 'single', 'stream', 'of', 'observations', 'starting', 'from', 'an', 'initial', 'state', 'without', 'any', 'reset', 'we', 'revisit', 'the', 'minimax', 'lower', 'bound', 'for', 'that', 'problem', 'by', 'making', 'appear', 'the', 'local', 'variance', 'of', 'the', 'bias', 'function', 'in', 'place', 'of', 'the', 'diameter', 'of', 'the', 'mdp', 'furthermore', 'we', 'provide', 'a', 'novel', 'analysis', 'of', 'the', 'klucrl', 'algorithm', 'establishing', 'a', 'highprobability', 'regret', 'bound', 'scaling', 'as', 'widetilde', 'mathcal', 'obigltextstyle', 'sqrtssum_sabf', 'vstar_satbig', 'for', 'this', 'algorithm', 'for', 'ergodic', 'mdps', 'where', 's', 'denotes', 'the', 'number', 'of', 'states', 'and', 'where', 'bf', 'vstar_sa', 'is', 'the', 'variance', 'of', 'the', 'bias', 'function', 'with', 'respect', 'to', 'the', 'nextstate', 'distribution', 'following', 'action', 'a', 'in', 'state', 's', 'the', 'resulting', 'bound', 'improves', 'upon', 'the', 'best', 'previously', 'known', 'regret', 'bound', 'widetilde', 'mathcal', 'odssqrtat', 'for', 'that', 'algorithm', 'where', 'a', 'and', 'd', 'respectively', 'denote', 'the', 'maximum', 'number', 'of', 'actions', 'per', 'state', 'and', 'the', 'diameter', 'of', 'mdp', 'we', 'finally', 'compare', 'the', 'leading', 'terms', 'of', 'the', 'two', 'bounds', 'in', 'some', 'benchmark', 'mdps', 'indicating', 'that', 'the', 'derived', 'bound', 'can', 'provide', 'an', 'order', 'of', 'magnitude', 'improvement', 'in', 'some', 'cases', 'our', 'analysis', 'leverages', 'novel', 'variations', 'of', 'the', 'transportation', 'lemma', 'combined', 'with', 'kullbackleibler', 'concentration', 'inequalities', 'that', 'we', 'believe', 'to', 'be', 'of', 'independent', 'interest']] | [-0.10220488640682204, 0.09594028129585139, -0.08615259380430738, 0.04232069603166244, -0.058215767485966935, -0.13294426850065733, 0.11375142016070153, 0.3410953071850222, -0.2747583381251257, -0.3234866520174518, 0.09857666703584438, -0.26043397882741826, -0.11744119328838112, 0.1925526470494803, -0.10118409007414275, 0.06621001249995838, 0.04401007342233282, 0.11211925956835646, -0.05877944987924131, -0.26833657610932016, 0.29879623371432873, 0.03593887910156866, 0.23998808169035593, 0.029957281742503658, 0.11167571522575406, 0.018152306329881872, 0.030159166538278045, -0.009644214189234923, -0.15272352723632535, 0.11014346067275141, 0.23184065530380316, 0.17855687553856994, 0.31711365614122383, -0.3598700177356385, -0.1551702691844984, 0.15011944292970272, 0.1378587719389341, 0.058219972979907254, -0.010934186614554933, -0.28872528981309437, 0.07125497928309897, -0.14489975780392614, -0.07690436725059281, -0.02179104311235366, 0.007736303668091263, 0.009970503964951792, -0.35421966852683234, 0.05501277463686099, 0.10083808399318461, 0.0066411833010011035, -0.07987458700008222, -0.17105348027201037, 0.00894015686078096, 0.10675422192153584, 0.04999190181252493, 0.05911941935700828, 0.09693005934283408, -0.1333444927389405, -0.15911237259309938, 0.3023781196218758, -0.0978906049990941, -0.18028283575527226, 0.1275119178035355, -0.10998814170820198, -0.14895399753004313, 0.11591750157970017, 0.19940398778689908, 0.16108863098194803, -0.12571533306329996, 0.11085610910417773, -0.08206229924296303, 0.16118822248139675, 0.037049118609388094, 0.0623225835894329, 0.07792409384569181, 0.18127093660889265, 0.16631072196616806, 0.18002357967321622, -0.07042799548837604, -0.09873575575937683, -0.3257414300516608, -0.15264151017839575, -0.20139230093986227, 0.03169119588418859, -0.1530089897802662, -0.14410737311132343, 0.32115367022995356, 0.15626899223068305, 0.221180056421995, 0.15572740699969917, 0.2529423170664532, 0.13730460183654467, -0.006396267079446771, 0.13964574195327606, 0.20467361754199023, 0.11444143184172755, 0.00554433625848325, -0.23337457760502606, 0.14376671198763377, 0.08318288487512708] |
1,803.01627 | Optimal Impedance Matching and Quantum Limits of Electromagnetic Axion
and Hidden-Photon Dark Matter Searches | For the first time, we determine the properties of the optimal single-moded,
linear, passive search for electromagnetic coupling to axion and hidden-photon
dark matter, subject to the Standard Quantum Limit on phase-insensitive
amplification. We establish the parameters that must be considered to determine
the optimal search: the impedance match to dark matter; receiver
frequency-response and tuning; irreducible noise sources; and prior information
on the dark-matter signal. Using complex-power flow equations, we identify two
categories of coupling to the dark-matter signal: radiative and reactive. We
motivate a focus on single-moded reactive couplings, as receivers using solely
radiative couplings are limited in sensitivity by mismatch with the dark-matter
source impedance. We define integrated sensitivity as a figure of merit in
comparing searches over a wide frequency range and show that the Bode-Fano
criterion sets a limit on integrated sensitivity in a reactively coupled
receiver. We examine single-pole resonators, a broadly used form of reactive
coupling, and show that when thermal noise dominates amplifier noise and noise
matching is optimized, substantial sensitivity is available away from the
resonator bandwidth. The Bode-Fano constraint establishes the single-pole
resonator as near-ideal for single-moded dark-matter detection. Additionally,
the optimized resonator is superior to the optimized reactive broadband
receiver at all frequencies at which a resonator may practically be made. We
optimize time allocation in a tunable resonator search using priors and derive
quantum limits on resonant search sensitivity. At low frequencies, the
application of our optimization may enhance scan rates by a few orders of
magnitude. While our results broadly inform laboratory searches for light
fields, they are the basis for DMRadio, a DOE-funded program in axion and
hidden-photon detection.
| hep-ph | for the first time we determine the properties of the optimal singlemoded linear passive search for electromagnetic coupling to axion and hiddenphoton dark matter subject to the standard quantum limit on phaseinsensitive amplification we establish the parameters that must be considered to determine the optimal search the impedance match to dark matter receiver frequencyresponse and tuning irreducible noise sources and prior information on the darkmatter signal using complexpower flow equations we identify two categories of coupling to the darkmatter signal radiative and reactive we motivate a focus on singlemoded reactive couplings as receivers using solely radiative couplings are limited in sensitivity by mismatch with the darkmatter source impedance we define integrated sensitivity as a figure of merit in comparing searches over a wide frequency range and show that the bodefano criterion sets a limit on integrated sensitivity in a reactively coupled receiver we examine singlepole resonators a broadly used form of reactive coupling and show that when thermal noise dominates amplifier noise and noise matching is optimized substantial sensitivity is available away from the resonator bandwidth the bodefano constraint establishes the singlepole resonator as nearideal for singlemoded darkmatter detection additionally the optimized resonator is superior to the optimized reactive broadband receiver at all frequencies at which a resonator may practically be made we optimize time allocation in a tunable resonator search using priors and derive quantum limits on resonant search sensitivity at low frequencies the application of our optimization may enhance scan rates by a few orders of magnitude while our results broadly inform laboratory searches for light fields they are the basis for dmradio a doefunded program in axion and hiddenphoton detection | [['for', 'the', 'first', 'time', 'we', 'determine', 'the', 'properties', 'of', 'the', 'optimal', 'singlemoded', 'linear', 'passive', 'search', 'for', 'electromagnetic', 'coupling', 'to', 'axion', 'and', 'hiddenphoton', 'dark', 'matter', 'subject', 'to', 'the', 'standard', 'quantum', 'limit', 'on', 'phaseinsensitive', 'amplification', 'we', 'establish', 'the', 'parameters', 'that', 'must', 'be', 'considered', 'to', 'determine', 'the', 'optimal', 'search', 'the', 'impedance', 'match', 'to', 'dark', 'matter', 'receiver', 'frequencyresponse', 'and', 'tuning', 'irreducible', 'noise', 'sources', 'and', 'prior', 'information', 'on', 'the', 'darkmatter', 'signal', 'using', 'complexpower', 'flow', 'equations', 'we', 'identify', 'two', 'categories', 'of', 'coupling', 'to', 'the', 'darkmatter', 'signal', 'radiative', 'and', 'reactive', 'we', 'motivate', 'a', 'focus', 'on', 'singlemoded', 'reactive', 'couplings', 'as', 'receivers', 'using', 'solely', 'radiative', 'couplings', 'are', 'limited', 'in', 'sensitivity', 'by', 'mismatch', 'with', 'the', 'darkmatter', 'source', 'impedance', 'we', 'define', 'integrated', 'sensitivity', 'as', 'a', 'figure', 'of', 'merit', 'in', 'comparing', 'searches', 'over', 'a', 'wide', 'frequency', 'range', 'and', 'show', 'that', 'the', 'bodefano', 'criterion', 'sets', 'a', 'limit', 'on', 'integrated', 'sensitivity', 'in', 'a', 'reactively', 'coupled', 'receiver', 'we', 'examine', 'singlepole', 'resonators', 'a', 'broadly', 'used', 'form', 'of', 'reactive', 'coupling', 'and', 'show', 'that', 'when', 'thermal', 'noise', 'dominates', 'amplifier', 'noise', 'and', 'noise', 'matching', 'is', 'optimized', 'substantial', 'sensitivity', 'is', 'available', 'away', 'from', 'the', 'resonator', 'bandwidth', 'the', 'bodefano', 'constraint', 'establishes', 'the', 'singlepole', 'resonator', 'as', 'nearideal', 'for', 'singlemoded', 'darkmatter', 'detection', 'additionally', 'the', 'optimized', 'resonator', 'is', 'superior', 'to', 'the', 'optimized', 'reactive', 'broadband', 'receiver', 'at', 'all', 'frequencies', 'at', 'which', 'a', 'resonator', 'may', 'practically', 'be', 'made', 'we', 'optimize', 'time', 'allocation', 'in', 'a', 'tunable', 'resonator', 'search', 'using', 'priors', 'and', 'derive', 'quantum', 'limits', 'on', 'resonant', 'search', 'sensitivity', 'at', 'low', 'frequencies', 'the', 'application', 'of', 'our', 'optimization', 'may', 'enhance', 'scan', 'rates', 'by', 'a', 'few', 'orders', 'of', 'magnitude', 'while', 'our', 'results', 'broadly', 'inform', 'laboratory', 'searches', 'for', 'light', 'fields', 'they', 'are', 'the', 'basis', 'for', 'dmradio', 'a', 'doefunded', 'program', 'in', 'axion', 'and', 'hiddenphoton', 'detection']] | [-0.14358157174385808, 0.09864023350248183, -0.0529848141733695, 0.045701118011493236, -0.09097200242405826, -0.17134883336084722, 0.06999752305672262, 0.39873107391995966, -0.22764676454287297, -0.33624391695678546, 0.08958938910757382, -0.25665454332095883, -0.06565715319097594, 0.23520716133579198, 0.00859367163049885, 0.07079994592500885, 0.02761792277020437, -0.006743476124204419, -0.023031184576986427, -0.18934672235832464, 0.24215803568130703, 0.08788894462588899, 0.2914833080575422, 0.021889943939944107, 0.11338644433608688, -0.020722915502954964, -0.017777859862824832, -0.04058769465924275, -0.14203360114994143, 0.05793763249250198, 0.28481799482661124, 0.07894797782085974, 0.20513246243095232, -0.39108559908000406, -0.2049103482876456, 0.12482347715197614, 0.1330181971390697, 0.09947583387407509, -0.044474454380623585, -0.27620883428241577, 0.062181390746910536, -0.15461951066150775, -0.04649512307132008, -0.061965384553359065, -0.051209235951062984, 0.029615924948679834, -0.30635338920616995, 0.026755088736751566, -0.008907934510649217, 0.004610203244481925, -0.03794814402979143, -0.11644002514367457, 0.021921665269743512, 0.05620308766385144, -0.023684757585740752, -0.025376873715194287, 0.22779020331692193, -0.14273444432592777, -0.0995718326204008, 0.3639975232818095, -0.13736847642274505, -0.1826974264641413, 0.16735516705817577, -0.10247516322329088, -0.0779391301597503, 0.1455687190492258, 0.20666130520036893, 0.06416528467261405, -0.16001656175342052, 0.05609308970710521, 0.03659555357018555, 0.2296228838386014, 0.10032257647770974, 0.09516318002198305, 0.2456361649678675, 0.18355455554211167, 0.08873974370545949, 0.14581303831224365, -0.10537912910761035, -0.03325961154057748, -0.2914827653551819, -0.10221299870905501, -0.17407251025110276, 0.030614329815014368, -0.08469430410671824, -0.09649243923046959, 0.39041017548750256, 0.17869421626372195, 0.14727671756581576, 0.04954398058794646, 0.3452636852817334, 0.1316067780182628, 0.06396445069091257, 0.03577182960558545, 0.3398042692406172, 0.14099939851073065, 0.06539964555742228, -0.2507173049367136, 0.0011761423804003883, -0.042306041774443456] |
1,803.01628 | Frames of directional wavelets on $n$-dimensional spheres | The major goal of the paper is to prove that discrete frames of (directional)
wavelets derived from an approximate identity exist. Additionally, a kind of
energy conservation property is shown to hold in the case when a wavelet family
is not its own reconstruction family. Although an additional constraint on the
spectrum of the wavelet family must be satisfied, it is shown that all the
wavelets so far defined in the literature possess this property.
| math.CA math-ph math.MP | the major goal of the paper is to prove that discrete frames of directional wavelets derived from an approximate identity exist additionally a kind of energy conservation property is shown to hold in the case when a wavelet family is not its own reconstruction family although an additional constraint on the spectrum of the wavelet family must be satisfied it is shown that all the wavelets so far defined in the literature possess this property | [['the', 'major', 'goal', 'of', 'the', 'paper', 'is', 'to', 'prove', 'that', 'discrete', 'frames', 'of', 'directional', 'wavelets', 'derived', 'from', 'an', 'approximate', 'identity', 'exist', 'additionally', 'a', 'kind', 'of', 'energy', 'conservation', 'property', 'is', 'shown', 'to', 'hold', 'in', 'the', 'case', 'when', 'a', 'wavelet', 'family', 'is', 'not', 'its', 'own', 'reconstruction', 'family', 'although', 'an', 'additional', 'constraint', 'on', 'the', 'spectrum', 'of', 'the', 'wavelet', 'family', 'must', 'be', 'satisfied', 'it', 'is', 'shown', 'that', 'all', 'the', 'wavelets', 'so', 'far', 'defined', 'in', 'the', 'literature', 'possess', 'this', 'property']] | [-0.11649918208209177, 0.054078697391863294, -0.12846250128621856, 0.07113883454197396, -0.10917131485417485, -0.09492537785942355, -0.046782750324346124, 0.39549855078260104, -0.3359760874758164, -0.23557067934423684, 0.13068664381590983, -0.2644400395825505, -0.18587850352749227, 0.19267575186987718, -0.10750698181490104, 0.07529307393434768, 0.04255732027503351, 0.10840159500017763, -0.05263688807065288, -0.22584157476822536, 0.3007653839451571, 0.058019210336109, 0.31911806878012916, 0.00874578367297848, 0.10288300277044375, -0.035422221357002855, -0.02936196199307839, -0.0008247563739617666, -0.09878812170994934, 0.09956402104347944, 0.22683548361063002, 0.15817671632083755, 0.26848961534599464, -0.36226507638891536, -0.21936146259307862, 0.17526879670719306, 0.1365115054929629, 0.05613230284303427, -0.06639655460758756, -0.23326899115927519, 0.1350449054983134, -0.1496258527537187, -0.1549505722274383, -0.06985044348984956, 0.009004089832305908, 0.008857118456314008, -0.2827971702379485, 0.030703240393971404, 0.16382739706585805, 0.020867980296413104, -0.06995056030806154, -0.08475791791453957, -0.05534293092787266, 0.0921930115596236, 0.07960635336736838, 0.018404724032928546, 0.035529984462385374, -0.05440034955429534, -0.060573312537744645, 0.40020541386756425, -0.005300262092302243, -0.28839245056112606, 0.150728671902325, -0.13236681076698006, -0.1975887394323945, 0.12113664851834377, 0.11813021849219997, 0.1155171919427812, -0.19215625474636908, 0.1240700871264562, -0.10740476894502839, 0.16523278047641118, 0.08670375409225622, 0.09871321604897579, 0.1536130653321743, 0.056181278303265574, 0.14936581960568826, 0.12908149789087475, -0.035414178736197455, -0.06879258346433441, -0.31533754751086235, -0.15418992384026448, -0.27957451205855854, 0.018366683141211978, -0.016847520635152855, -0.18398565090183788, 0.39814878708372514, 0.11781685667733352, 0.1543592638274034, 0.07499400986358523, 0.23799124086896578, 0.1628924468376984, 0.10193570485338568, 0.07196318015456199, 0.2651529236634572, 0.10095761062577367, 0.05032004842534661, -0.12134082343662157, 0.0524140656615297, 0.08356025449931621] |
1,803.01629 | Robust extraction of proton charge radius from electron-proton
scattering data | Extracting the proton charge radius from electron scattering data requires
determining the slope of the charge form factor at $Q^2$ of zero. But as
experimental data never reach that limit, numerous methods for making the
extraction have been proposed, though often the functions are determined after
seeing the data which can lead to confirmation bias. To find functional forms
that will allow for a robust extraction of the input radius for a wide variety
of functional forms in order to have confidence in the extraction from upcoming
low $Q^2$ experimental data such as the Jefferson Lab PRad experiment, we
create a general framework for inputting form-factor functions as well as
various fitting functions. The input form factors are used to generate
pseudo-data with fluctuations intended to mimic the binning and random
uncertainty of a given set of real data. All combinations of input functions
and fit functions can then be tested repeatedly against regenerated
pseudo-data. Since the input radius is known, this allows us to find fit
functions that are robust for radius extractions in an objective fashion. For
the range and uncertainty of the PRad data, we find that a two-parameter
rational function, a two-parameter continued fraction and the second order
polynomial expansion of $z$ can extract the input radius regardless of the
input charge form factor function that is used. We have created an easily
expandable framework to search for functional forms that allow for a robust
extraction of the radius from a given binning and uncertainty of pseudo-data
generated from a wide variety of trial functions. This method has enabled a
successful search for the best functional forms to extract the radius from the
upcoming PRad data and can be used for other experiments.
| nucl-ex hep-ph nucl-th | extracting the proton charge radius from electron scattering data requires determining the slope of the charge form factor at q2 of zero but as experimental data never reach that limit numerous methods for making the extraction have been proposed though often the functions are determined after seeing the data which can lead to confirmation bias to find functional forms that will allow for a robust extraction of the input radius for a wide variety of functional forms in order to have confidence in the extraction from upcoming low q2 experimental data such as the jefferson lab prad experiment we create a general framework for inputting formfactor functions as well as various fitting functions the input form factors are used to generate pseudodata with fluctuations intended to mimic the binning and random uncertainty of a given set of real data all combinations of input functions and fit functions can then be tested repeatedly against regenerated pseudodata since the input radius is known this allows us to find fit functions that are robust for radius extractions in an objective fashion for the range and uncertainty of the prad data we find that a twoparameter rational function a twoparameter continued fraction and the second order polynomial expansion of z can extract the input radius regardless of the input charge form factor function that is used we have created an easily expandable framework to search for functional forms that allow for a robust extraction of the radius from a given binning and uncertainty of pseudodata generated from a wide variety of trial functions this method has enabled a successful search for the best functional forms to extract the radius from the upcoming prad data and can be used for other experiments | [['extracting', 'the', 'proton', 'charge', 'radius', 'from', 'electron', 'scattering', 'data', 'requires', 'determining', 'the', 'slope', 'of', 'the', 'charge', 'form', 'factor', 'at', 'q2', 'of', 'zero', 'but', 'as', 'experimental', 'data', 'never', 'reach', 'that', 'limit', 'numerous', 'methods', 'for', 'making', 'the', 'extraction', 'have', 'been', 'proposed', 'though', 'often', 'the', 'functions', 'are', 'determined', 'after', 'seeing', 'the', 'data', 'which', 'can', 'lead', 'to', 'confirmation', 'bias', 'to', 'find', 'functional', 'forms', 'that', 'will', 'allow', 'for', 'a', 'robust', 'extraction', 'of', 'the', 'input', 'radius', 'for', 'a', 'wide', 'variety', 'of', 'functional', 'forms', 'in', 'order', 'to', 'have', 'confidence', 'in', 'the', 'extraction', 'from', 'upcoming', 'low', 'q2', 'experimental', 'data', 'such', 'as', 'the', 'jefferson', 'lab', 'prad', 'experiment', 'we', 'create', 'a', 'general', 'framework', 'for', 'inputting', 'formfactor', 'functions', 'as', 'well', 'as', 'various', 'fitting', 'functions', 'the', 'input', 'form', 'factors', 'are', 'used', 'to', 'generate', 'pseudodata', 'with', 'fluctuations', 'intended', 'to', 'mimic', 'the', 'binning', 'and', 'random', 'uncertainty', 'of', 'a', 'given', 'set', 'of', 'real', 'data', 'all', 'combinations', 'of', 'input', 'functions', 'and', 'fit', 'functions', 'can', 'then', 'be', 'tested', 'repeatedly', 'against', 'regenerated', 'pseudodata', 'since', 'the', 'input', 'radius', 'is', 'known', 'this', 'allows', 'us', 'to', 'find', 'fit', 'functions', 'that', 'are', 'robust', 'for', 'radius', 'extractions', 'in', 'an', 'objective', 'fashion', 'for', 'the', 'range', 'and', 'uncertainty', 'of', 'the', 'prad', 'data', 'we', 'find', 'that', 'a', 'twoparameter', 'rational', 'function', 'a', 'twoparameter', 'continued', 'fraction', 'and', 'the', 'second', 'order', 'polynomial', 'expansion', 'of', 'z', 'can', 'extract', 'the', 'input', 'radius', 'regardless', 'of', 'the', 'input', 'charge', 'form', 'factor', 'function', 'that', 'is', 'used', 'we', 'have', 'created', 'an', 'easily', 'expandable', 'framework', 'to', 'search', 'for', 'functional', 'forms', 'that', 'allow', 'for', 'a', 'robust', 'extraction', 'of', 'the', 'radius', 'from', 'a', 'given', 'binning', 'and', 'uncertainty', 'of', 'pseudodata', 'generated', 'from', 'a', 'wide', 'variety', 'of', 'trial', 'functions', 'this', 'method', 'has', 'enabled', 'a', 'successful', 'search', 'for', 'the', 'best', 'functional', 'forms', 'to', 'extract', 'the', 'radius', 'from', 'the', 'upcoming', 'prad', 'data', 'and', 'can', 'be', 'used', 'for', 'other', 'experiments']] | [-0.043022308189532225, 0.07753880425059814, -0.11853125186650024, 0.08616166669171213, -0.07749403129941833, -0.10520368794734566, 0.04472478987642593, 0.358766113914134, -0.26148388967021835, -0.334025330862634, 0.08525160623490015, -0.27729669374009985, -0.08212707058335118, 0.24528644221651494, 0.003811790046480059, 0.11082500705287796, 0.05558504353291126, 0.02219683857706054, -0.08720909669072098, -0.2066016926499934, 0.30888546791531224, 0.07074562959025779, 0.2609806942237535, 0.04636908493910102, 0.08380725693106911, 0.029144392733767188, -0.046647647663444695, 0.005736092903784343, -0.11781049283493743, 0.10694916984058254, 0.29617842012133694, 0.17168618456333978, 0.23421258877683757, -0.3836644908692363, -0.19108218591715426, 0.1080828243724593, 0.12868385811219518, 0.11556078736404223, -0.041663285805632846, -0.25116829954100717, 0.08988884302790728, -0.19566079512731746, -0.1298835548062773, -0.1424467067594416, 0.02698095872647775, 0.03211122363110524, -0.3483241155507523, 0.057792192627594705, -0.028650667694825615, 0.016695994549537994, -0.05123802239033929, -0.1605173652121174, -0.0033172696284488987, 0.15597802486257686, 0.024921176059070963, 0.08709766823337624, 0.14933603244609742, -0.12464372058158078, -0.07368700589841874, 0.36343739768457745, -0.04686693288933466, -0.20674088949332328, 0.12086380845526369, -0.1599247104452618, -0.12073731046001254, 0.12448959201428299, 0.20573492788219702, 0.07881616002097985, -0.15517572640645794, 0.04077056393431717, -0.028562136285269848, 0.2116894798267321, 0.07321519923286078, 0.01600960932792901, 0.20457983462185395, 0.13730892777858295, 0.022724535669125488, 0.11165514399921392, -0.11586866448679259, -0.043265768349939754, -0.319802048041336, -0.09035436227554228, -0.16537151736400385, 0.02687144850280123, -0.09658117053954447, -0.15719378466039688, 0.3776822106219919, 0.14450682442390297, 0.25265196376262744, 0.05453429338627719, 0.27953777027045434, 0.1256295380707143, 0.14991724033408413, 0.030551747703691134, 0.21369655027528023, 0.082905089659519, 0.05311492166217442, -0.14749095006450405, 0.08646769859803312, 0.009452920683695309] |
1,803.0163 | Finger Grip Force Estimation from Video using Two Stream Approach | Estimation of a hand grip force is essential for the understanding of force
pattern during the execution of assembly or disassembly operations. Human
demonstration of a correct way of doing an operation is a powerful source of
information which can be used for guided robot teaching. Typically to assess
this problem instrumented approach is used, which requires hand or object
mounted devices and poses an inconvenience for an operator or limits the scope
of addressable objects. The work demonstrates that contact force may be
estimated using a noninvasive contactless method with the help of vision system
alone. We propose a two-stream approach for video processing, which utilizes
both spatial information of each frame and dynamic information of frame change.
In this work, image processing and machine learning techniques are used along
with dense optical flow for frame change tracking and Kalman filter is used for
stream fusion. Our studies show that the proposed method can successfully
estimate contact grip force with RMSE < 10% of sensor range (RMSE $\approx 0.2$
N), the performances of each stream and overall method performance are
reported. The proposed method has a wide range of applications, including robot
teaching through demonstration, haptic force feedback, and validation of human-
performed operations.
| cs.RO | estimation of a hand grip force is essential for the understanding of force pattern during the execution of assembly or disassembly operations human demonstration of a correct way of doing an operation is a powerful source of information which can be used for guided robot teaching typically to assess this problem instrumented approach is used which requires hand or object mounted devices and poses an inconvenience for an operator or limits the scope of addressable objects the work demonstrates that contact force may be estimated using a noninvasive contactless method with the help of vision system alone we propose a twostream approach for video processing which utilizes both spatial information of each frame and dynamic information of frame change in this work image processing and machine learning techniques are used along with dense optical flow for frame change tracking and kalman filter is used for stream fusion our studies show that the proposed method can successfully estimate contact grip force with rmse 10 of sensor range rmse approx 02 n the performances of each stream and overall method performance are reported the proposed method has a wide range of applications including robot teaching through demonstration haptic force feedback and validation of human performed operations | [['estimation', 'of', 'a', 'hand', 'grip', 'force', 'is', 'essential', 'for', 'the', 'understanding', 'of', 'force', 'pattern', 'during', 'the', 'execution', 'of', 'assembly', 'or', 'disassembly', 'operations', 'human', 'demonstration', 'of', 'a', 'correct', 'way', 'of', 'doing', 'an', 'operation', 'is', 'a', 'powerful', 'source', 'of', 'information', 'which', 'can', 'be', 'used', 'for', 'guided', 'robot', 'teaching', 'typically', 'to', 'assess', 'this', 'problem', 'instrumented', 'approach', 'is', 'used', 'which', 'requires', 'hand', 'or', 'object', 'mounted', 'devices', 'and', 'poses', 'an', 'inconvenience', 'for', 'an', 'operator', 'or', 'limits', 'the', 'scope', 'of', 'addressable', 'objects', 'the', 'work', 'demonstrates', 'that', 'contact', 'force', 'may', 'be', 'estimated', 'using', 'a', 'noninvasive', 'contactless', 'method', 'with', 'the', 'help', 'of', 'vision', 'system', 'alone', 'we', 'propose', 'a', 'twostream', 'approach', 'for', 'video', 'processing', 'which', 'utilizes', 'both', 'spatial', 'information', 'of', 'each', 'frame', 'and', 'dynamic', 'information', 'of', 'frame', 'change', 'in', 'this', 'work', 'image', 'processing', 'and', 'machine', 'learning', 'techniques', 'are', 'used', 'along', 'with', 'dense', 'optical', 'flow', 'for', 'frame', 'change', 'tracking', 'and', 'kalman', 'filter', 'is', 'used', 'for', 'stream', 'fusion', 'our', 'studies', 'show', 'that', 'the', 'proposed', 'method', 'can', 'successfully', 'estimate', 'contact', 'grip', 'force', 'with', 'rmse', '10', 'of', 'sensor', 'range', 'rmse', 'approx', '02', 'n', 'the', 'performances', 'of', 'each', 'stream', 'and', 'overall', 'method', 'performance', 'are', 'reported', 'the', 'proposed', 'method', 'has', 'a', 'wide', 'range', 'of', 'applications', 'including', 'robot', 'teaching', 'through', 'demonstration', 'haptic', 'force', 'feedback', 'and', 'validation', 'of', 'human', 'performed', 'operations']] | [-0.08300113065086086, 0.03814067116756775, -0.1086718810008332, -0.017397746956204156, -0.10305102943789725, -0.1873274738626445, 0.010812472322654417, 0.4303672861344382, -0.2579213400718336, -0.3780081425245632, 0.09968495283300952, -0.2263952807281349, -0.17040527984870862, 0.25662804009534385, -0.12935619677106538, 0.10432054163053787, 0.1294758357061986, 0.06706425128048103, -0.02534243753225561, -0.20683594090537644, 0.2290266244044509, 0.06681739667649655, 0.3076707360462523, 0.03351530291176602, 0.17270706636447677, 0.04151235813589986, -0.032614622025421876, 0.008084202685744921, -0.07455615915608302, 0.153719285932454, 0.2823696100739671, 0.1596141740966214, 0.3183718048488064, -0.42115640088769735, -0.21700137260189628, 0.06833819621961619, 0.15986722699530861, 0.09303364638460562, -0.07094962072476525, -0.31445017239928025, 0.0792772988206707, -0.18383213425940817, -0.06039951894055383, -0.08966020450416003, -0.015192868327265423, -0.0012831593061866228, -0.30872641103091086, 0.0322937898054792, 0.04547119079392823, 0.10933251393954362, -0.07251113311105976, -0.055391135412683784, 0.0463595374398317, 0.2057711749769035, -0.0029254051258641423, 0.06357978257651933, 0.25786094033323664, -0.14793645403936834, -0.1283143353100647, 0.39642868847266644, -0.028053526789424757, -0.19294547933546424, 0.19433912896784022, -0.050943768396631214, -0.08486808901744, 0.11688321985888715, 0.21167983112436736, 0.11539011006015261, -0.18294668206990713, -0.014505484161382615, 0.0231294872190155, 0.21859428092184494, 0.05847900932399081, -0.0018484666304407166, 0.19877071967736507, 0.23101011573738767, 0.06939050663198691, 0.11341272998377498, -0.1509310898836702, -0.038736465025816444, -0.24576867504990385, -0.16772278545963049, -0.1754574363391536, -0.04478319430285517, -0.07534050648788324, -0.11165076355431594, 0.34760302914690006, 0.21154708315118434, 0.15546782268496578, 0.03521495520344972, 0.3809504452773242, 0.055476749236535686, 0.11680268751133197, 0.05490480606471572, 0.21285059815558022, 0.058053256862787714, 0.14180794713206077, -0.19622415695830212, 0.07560006129856714, 0.03929191401260266] |
1,803.01631 | Agile Behaviour Design: A Design Approach for Structuring Game
Characters and Interactions | In this paper, a novel design methodology-Agile Behaviour Design-is presented
that accommodates the requirements for developing complex game agents suitable
for industrial environments. An essential part of the design approach is to
support independent work of both designers and programmers by reducing
bottleneck situations. The approach fosters the creation of more loose and
fluid interactions between design and implementation, leaving more freedom for
creative expression.
| cs.SE | in this paper a novel design methodologyagile behaviour designis presented that accommodates the requirements for developing complex game agents suitable for industrial environments an essential part of the design approach is to support independent work of both designers and programmers by reducing bottleneck situations the approach fosters the creation of more loose and fluid interactions between design and implementation leaving more freedom for creative expression | [['in', 'this', 'paper', 'a', 'novel', 'design', 'methodologyagile', 'behaviour', 'designis', 'presented', 'that', 'accommodates', 'the', 'requirements', 'for', 'developing', 'complex', 'game', 'agents', 'suitable', 'for', 'industrial', 'environments', 'an', 'essential', 'part', 'of', 'the', 'design', 'approach', 'is', 'to', 'support', 'independent', 'work', 'of', 'both', 'designers', 'and', 'programmers', 'by', 'reducing', 'bottleneck', 'situations', 'the', 'approach', 'fosters', 'the', 'creation', 'of', 'more', 'loose', 'and', 'fluid', 'interactions', 'between', 'design', 'and', 'implementation', 'leaving', 'more', 'freedom', 'for', 'creative', 'expression']] | [-0.134723180428236, 0.0823421941218724, -0.07969226156424228, 0.015490437739543499, -0.13749558174066126, -0.17030801625168396, 0.04744776054322424, 0.35665356119473773, -0.21742008547372524, -0.34082183584807413, 0.04435636001705591, -0.19177025595369437, -0.23693240617239286, 0.21003544150245568, -0.09723686585054984, 0.017657395629655747, 0.06761007595600353, -0.05350110180295324, 0.02345604664139775, -0.22257711035421207, 0.30879311884442967, 0.09855473378584498, 0.3060701681995794, 0.06601319621716227, 0.0719672162603173, 0.05475024079223947, -0.01910787591681121, -0.03366364890502559, -0.07839980126150223, 0.19799747430379427, 0.34720937351858805, 0.19363982595273732, 0.36291539142765694, -0.45945767493593315, -0.17434227774252317, 0.04477196664268535, 0.15073388294568138, 0.07148666537204196, -0.08789153979021302, -0.27962533767438597, 0.06975131207201186, -0.2063513405136912, -0.14982022928990543, -0.11810470283741042, 0.021504499299067354, -0.042497237922535055, -0.28005968996634084, -0.03624897980914703, 0.08305785328238494, 0.08218222753041321, -0.040959282571242914, -0.09988990538413563, 0.05695678309966174, 0.1866247068484506, 0.0017767783738524905, -0.03153213873202543, 0.1613893158704279, -0.19628444281111043, -0.1122370679596705, 0.4189070284603134, 0.04392484077326362, -0.23157007797133355, 0.227225087730894, -0.0032680414872066606, -0.1396354419578399, 0.09053147052015577, 0.23488954429529488, 0.1011234716778355, -0.21315192757913518, 0.04200909285351545, 0.05365999540432342, 0.16094429439510263, 0.04551469343381801, 0.020290224461831034, 0.17887628069590955, 0.25705206850987106, 0.11836932212232597, 0.13373987706348536, 0.06044823796828351, -0.15307250882070217, -0.28559717612474095, -0.20087378483916085, -0.13761830663988514, -0.026885478890367916, -0.08001529474096883, -0.14722368932728255, 0.35366801876160836, 0.20542250595624661, 0.09823666965507621, 0.08264991563434403, 0.34539449868339395, 0.05117400482274769, 0.05489887794597991, 0.09359504719309154, 0.14796242302668, 0.052792579375414386, 0.16089080161755048, -0.19538331797553432, 0.10552583360630605, -0.038187937818408485] |
1,803.01632 | Excitable London: Street map analysis with Oregonator model | We explore geometry of London's streets using computational mode of an
excitable chemical system, Belousov-Zhabotinsky (BZ) medium. We virtually fill
in the streets with a BZ medium and study propagation of excitation waves for a
range of excitability parameters, gradual transition from excitable to
sub-excitable to non-excitable. We demonstrate a pruning strategy adopted by
the medium with decreasing excitability when wider and ballistically
appropriate streets are selected. We explain mechanics of streets selection and
pruning. The results of the paper will be used in future studies of studying
dynamics of cities with living excitable substrates.
| cs.ET nlin.PS | we explore geometry of londons streets using computational mode of an excitable chemical system belousovzhabotinsky bz medium we virtually fill in the streets with a bz medium and study propagation of excitation waves for a range of excitability parameters gradual transition from excitable to subexcitable to nonexcitable we demonstrate a pruning strategy adopted by the medium with decreasing excitability when wider and ballistically appropriate streets are selected we explain mechanics of streets selection and pruning the results of the paper will be used in future studies of studying dynamics of cities with living excitable substrates | [['we', 'explore', 'geometry', 'of', 'londons', 'streets', 'using', 'computational', 'mode', 'of', 'an', 'excitable', 'chemical', 'system', 'belousovzhabotinsky', 'bz', 'medium', 'we', 'virtually', 'fill', 'in', 'the', 'streets', 'with', 'a', 'bz', 'medium', 'and', 'study', 'propagation', 'of', 'excitation', 'waves', 'for', 'a', 'range', 'of', 'excitability', 'parameters', 'gradual', 'transition', 'from', 'excitable', 'to', 'subexcitable', 'to', 'nonexcitable', 'we', 'demonstrate', 'a', 'pruning', 'strategy', 'adopted', 'by', 'the', 'medium', 'with', 'decreasing', 'excitability', 'when', 'wider', 'and', 'ballistically', 'appropriate', 'streets', 'are', 'selected', 'we', 'explain', 'mechanics', 'of', 'streets', 'selection', 'and', 'pruning', 'the', 'results', 'of', 'the', 'paper', 'will', 'be', 'used', 'in', 'future', 'studies', 'of', 'studying', 'dynamics', 'of', 'cities', 'with', 'living', 'excitable', 'substrates']] | [-0.14148788074840252, 0.17526976270248845, -0.052089059882258114, 0.005740886563925367, -0.05670712526985689, -0.11593066627943986, 0.1020474114222452, 0.43271491043269633, -0.2571683117433598, -0.24006932246939916, 0.01948866765504997, -0.24605233249695677, -0.21431182271947985, 0.170140641329712, -0.0318904853376903, 0.007160614413748446, 0.040615305010425415, -0.04837783541481354, 0.03633044116002949, -0.16260175573590555, 0.2775993601370015, 0.06273115282192042, 0.2849442054664618, -0.010244830761496957, 0.06662427038199416, -0.018582221696660302, -0.021409264875968035, 0.04547275783200013, -0.1623897090306089, 0.06891963217211397, 0.2866759938898643, 0.07948751967204244, 0.2578047106091521, -0.5019194138677496, -0.2989215844948041, 0.061158224111913066, 0.19517566898445549, 0.11764777281174535, -0.02985446469760255, -0.3074960404712903, 0.06289438878026742, -0.15323673856818412, -0.17953914159320686, -0.009923646541804039, 0.016820899848090976, 0.09570753870188797, -0.22755517008420276, 0.026178135340543168, 0.02547939080058744, 0.09236429866991545, -0.057272263062431626, -0.04476279583391979, -0.07410921128956895, 0.13313305497469724, 0.018027221509500552, -0.02860842432312079, 0.23061318977882989, -0.13882053227801072, -0.09249007058495312, 0.386486485786736, -0.05457926170998498, -0.17171089763900166, 0.21452857531411082, -0.14590179008082488, -0.05058116886495172, 0.12540444359183311, 0.23373262648911852, 0.051807708165755396, -0.15056935431953447, -0.011306926168770971, -0.04089242340996861, 0.1198942528547425, 0.10028063215217307, 0.0017185520540040574, 0.1445978853263353, 0.3140124397719965, 0.03592939339333067, 0.10548745268882301, -0.06736018086146367, -0.08000821381023056, -0.2428458600059936, -0.1435746575362588, -0.09067504790360353, 0.03584309106594638, -0.08015405419971916, -0.1501548317996295, 0.41815739862228696, 0.16170346849647008, 0.19683872426026747, 0.02257109553013977, 0.2285919517768841, 0.07805407709981266, 0.06202402690204939, 0.07723751359276082, 0.2281983126739138, 0.13522263866555143, 0.17653385406654132, -0.2078328432294687, 0.023427743886254335, 0.048131849896162746] |
1,803.01633 | Velocity-Space Cascade in Magnetized Plasmas: Numerical Simulations | Plasma turbulence is studied via direct numerical simulations in a
two-dimensional spatial geometry. Using a hybrid Vlasov-Maxwell model, we
investigate the possibility of a velocity-space cascade. A novel theory of
space plasma turbulence has been recently proposed by Servidio {\it et al.}
[PRL, {\bf 119}, 205101 (2017)], supported by a three-dimensional Hermite
decomposition applied to spacecraft measurements, showing that velocity space
fluctuations of the ion velocity distribution follow a broad-band, power-law
Hermite spectrum $P(m)$, where $m$ is the Hermite index. We numerically explore
these mechanisms in a more magnetized regime. We find that (1) the plasma
reveals spectral anisotropy in velocity space, due to the presence of an
external magnetic field (analogous to spatial anisotropy of fluid and plasma
turbulence); (2) the distribution of energy follows the prediction $P(m)\sim
m^{-2}$, proposed in the above theoretical-observational work; and (3) the
velocity-space activity is intermittent in space, being enhanced close to
coherent structures such as the reconnecting current sheets produced by
turbulence. These results may be relevant to the nonlinear dynamics
weakly-collisional plasma in a wide variety of circumstances.
| physics.plasm-ph | plasma turbulence is studied via direct numerical simulations in a twodimensional spatial geometry using a hybrid vlasovmaxwell model we investigate the possibility of a velocityspace cascade a novel theory of space plasma turbulence has been recently proposed by servidio it et al prl bf 119 205101 2017 supported by a threedimensional hermite decomposition applied to spacecraft measurements showing that velocity space fluctuations of the ion velocity distribution follow a broadband powerlaw hermite spectrum pm where m is the hermite index we numerically explore these mechanisms in a more magnetized regime we find that 1 the plasma reveals spectral anisotropy in velocity space due to the presence of an external magnetic field analogous to spatial anisotropy of fluid and plasma turbulence 2 the distribution of energy follows the prediction pmsim m2 proposed in the above theoreticalobservational work and 3 the velocityspace activity is intermittent in space being enhanced close to coherent structures such as the reconnecting current sheets produced by turbulence these results may be relevant to the nonlinear dynamics weaklycollisional plasma in a wide variety of circumstances | [['plasma', 'turbulence', 'is', 'studied', 'via', 'direct', 'numerical', 'simulations', 'in', 'a', 'twodimensional', 'spatial', 'geometry', 'using', 'a', 'hybrid', 'vlasovmaxwell', 'model', 'we', 'investigate', 'the', 'possibility', 'of', 'a', 'velocityspace', 'cascade', 'a', 'novel', 'theory', 'of', 'space', 'plasma', 'turbulence', 'has', 'been', 'recently', 'proposed', 'by', 'servidio', 'it', 'et', 'al', 'prl', 'bf', '119', '205101', '2017', 'supported', 'by', 'a', 'threedimensional', 'hermite', 'decomposition', 'applied', 'to', 'spacecraft', 'measurements', 'showing', 'that', 'velocity', 'space', 'fluctuations', 'of', 'the', 'ion', 'velocity', 'distribution', 'follow', 'a', 'broadband', 'powerlaw', 'hermite', 'spectrum', 'pm', 'where', 'm', 'is', 'the', 'hermite', 'index', 'we', 'numerically', 'explore', 'these', 'mechanisms', 'in', 'a', 'more', 'magnetized', 'regime', 'we', 'find', 'that', '1', 'the', 'plasma', 'reveals', 'spectral', 'anisotropy', 'in', 'velocity', 'space', 'due', 'to', 'the', 'presence', 'of', 'an', 'external', 'magnetic', 'field', 'analogous', 'to', 'spatial', 'anisotropy', 'of', 'fluid', 'and', 'plasma', 'turbulence', '2', 'the', 'distribution', 'of', 'energy', 'follows', 'the', 'prediction', 'pmsim', 'm2', 'proposed', 'in', 'the', 'above', 'theoreticalobservational', 'work', 'and', '3', 'the', 'velocityspace', 'activity', 'is', 'intermittent', 'in', 'space', 'being', 'enhanced', 'close', 'to', 'coherent', 'structures', 'such', 'as', 'the', 'reconnecting', 'current', 'sheets', 'produced', 'by', 'turbulence', 'these', 'results', 'may', 'be', 'relevant', 'to', 'the', 'nonlinear', 'dynamics', 'weaklycollisional', 'plasma', 'in', 'a', 'wide', 'variety', 'of', 'circumstances']] | [-0.14761911421548576, 0.1837571044300317, -0.07612885743246547, 0.04766341910181966, -0.03680240167970104, -0.05771652468214077, -0.04749462414333331, 0.3615947938284704, -0.25962340303563647, -0.3071626123573099, 0.02167780539420034, -0.20530348033777304, -0.11856779687904886, 0.20810083075825658, -0.013861369155347348, 0.05426307626268161, 0.0052229576651006936, -0.07524723050317594, -0.01698475825666849, -0.15940503546169826, 0.2885816514412207, 0.12402905615578805, 0.2990043351586376, 0.007551066675888641, 0.07167317091786701, -0.05843348395478513, -0.02933322637242132, 0.04862585290933826, -0.17011085188847833, 0.04711968683637679, 0.1800488514133862, 0.032204481098534805, 0.25137626391436374, -0.4105113539738314, -0.3038993469426142, 0.037970383736704076, 0.17202696970015366, 0.06246473729610443, -0.04917830128929511, -0.2661603216720479, 0.05899138065321105, -0.18217643981799483, -0.14914051785665963, -0.06613662043320281, 0.052685377915123746, 0.04408449092081615, -0.314015136025846, 0.11867871040877487, 0.05542523586224499, 0.05391077771782875, -0.06431410687975586, -0.051557414207075325, -0.053457506885752085, 0.01798503310419619, 0.02773299150767603, 0.06629180325461285, 0.14894311404787003, -0.12893371410135712, -0.08065807133181287, 0.37560354899082865, -0.07368784950114787, -0.16847414592014892, 0.1961182477371767, -0.20705845390313438, -0.10112633947016937, 0.16967777342136417, 0.17504465509206057, 0.08224857772168304, -0.10194664814376406, 0.07359048454556615, -0.07371514771931938, 0.14901901201521728, 0.06876420587567346, -0.01947977396459984, 0.2179797166053738, 0.15873600726148912, 0.007260793197367873, 0.10246267744680933, -0.1381243444939277, -0.07472459396513711, -0.24733561326350484, -0.14420702997994211, -0.1929633302880185, 0.05056890115341438, -0.07100943873403594, -0.14730297909783466, 0.3988373309347246, 0.16480775516280638, 0.17081180794696724, -0.06247899023283805, 0.2836176577902266, 0.12831267177193825, -0.021611240031197666, 0.13840440799881304, 0.2665102686413697, 0.1948125413206539, 0.1490368353708514, -0.2130286520959011, -0.004640729586992945, 0.058071768180068054] |
1,803.01634 | Impact of the reduced speed of light approximation on ionization front
velocities in cosmological simulations of the epoch of reionization | Coupled radiative-hydrodynamics simulations of the epoch of reionization aim
to reproduce the propagation of ionization fronts during the transition before
the overlap of HII regions. Many of these simulations use moment-based methods
to track radiative transfer processes using explicit solvers and are therefore
subject to strict stability conditions regarding the speed of light, which
implies a great computational cost. It can be reduced by assuming a reduced
speed of light, and this approximation is now widely used to produce
large-scale simulations of reionization. We introduce a new method for
estimating and comparing the ionization front speeds based on maps of the
reionization redshifts. We applied it to a set of cosmological simulations of
the reionization using a set of reduced speeds of light, and measured the
evolution of the ionization front speeds during the reionization process. We
find that ionization fronts progress via a two-stage process, the first stage
at low velocity as the fronts emerge from high density regions and a second
later stage just before the overlap, during which front speeds increase close
to the speed of light. Using a set of small 8Mpc/h^3 simulations, we find that
a minimal velocity of 0.3c is able to model these two stages in this specific
context without significant impact. Values as low as 0.05c can model the first
low velocity stage, but limit the acceleration at later times. Lower values
modify the distribution of front speeds at all times. Using larger 64Mpc/h^3
volumes that better account for distant sources, we find that reduced speed of
light has a greater impact on reionization times and front speeds in underdense
regions that are reionized at late times. The same quantities measured in dense
regions with slow fronts are less sensitive to c values.
| astro-ph.CO | coupled radiativehydrodynamics simulations of the epoch of reionization aim to reproduce the propagation of ionization fronts during the transition before the overlap of hii regions many of these simulations use momentbased methods to track radiative transfer processes using explicit solvers and are therefore subject to strict stability conditions regarding the speed of light which implies a great computational cost it can be reduced by assuming a reduced speed of light and this approximation is now widely used to produce largescale simulations of reionization we introduce a new method for estimating and comparing the ionization front speeds based on maps of the reionization redshifts we applied it to a set of cosmological simulations of the reionization using a set of reduced speeds of light and measured the evolution of the ionization front speeds during the reionization process we find that ionization fronts progress via a twostage process the first stage at low velocity as the fronts emerge from high density regions and a second later stage just before the overlap during which front speeds increase close to the speed of light using a set of small 8mpch3 simulations we find that a minimal velocity of 03c is able to model these two stages in this specific context without significant impact values as low as 005c can model the first low velocity stage but limit the acceleration at later times lower values modify the distribution of front speeds at all times using larger 64mpch3 volumes that better account for distant sources we find that reduced speed of light has a greater impact on reionization times and front speeds in underdense regions that are reionized at late times the same quantities measured in dense regions with slow fronts are less sensitive to c values | [['coupled', 'radiativehydrodynamics', 'simulations', 'of', 'the', 'epoch', 'of', 'reionization', 'aim', 'to', 'reproduce', 'the', 'propagation', 'of', 'ionization', 'fronts', 'during', 'the', 'transition', 'before', 'the', 'overlap', 'of', 'hii', 'regions', 'many', 'of', 'these', 'simulations', 'use', 'momentbased', 'methods', 'to', 'track', 'radiative', 'transfer', 'processes', 'using', 'explicit', 'solvers', 'and', 'are', 'therefore', 'subject', 'to', 'strict', 'stability', 'conditions', 'regarding', 'the', 'speed', 'of', 'light', 'which', 'implies', 'a', 'great', 'computational', 'cost', 'it', 'can', 'be', 'reduced', 'by', 'assuming', 'a', 'reduced', 'speed', 'of', 'light', 'and', 'this', 'approximation', 'is', 'now', 'widely', 'used', 'to', 'produce', 'largescale', 'simulations', 'of', 'reionization', 'we', 'introduce', 'a', 'new', 'method', 'for', 'estimating', 'and', 'comparing', 'the', 'ionization', 'front', 'speeds', 'based', 'on', 'maps', 'of', 'the', 'reionization', 'redshifts', 'we', 'applied', 'it', 'to', 'a', 'set', 'of', 'cosmological', 'simulations', 'of', 'the', 'reionization', 'using', 'a', 'set', 'of', 'reduced', 'speeds', 'of', 'light', 'and', 'measured', 'the', 'evolution', 'of', 'the', 'ionization', 'front', 'speeds', 'during', 'the', 'reionization', 'process', 'we', 'find', 'that', 'ionization', 'fronts', 'progress', 'via', 'a', 'twostage', 'process', 'the', 'first', 'stage', 'at', 'low', 'velocity', 'as', 'the', 'fronts', 'emerge', 'from', 'high', 'density', 'regions', 'and', 'a', 'second', 'later', 'stage', 'just', 'before', 'the', 'overlap', 'during', 'which', 'front', 'speeds', 'increase', 'close', 'to', 'the', 'speed', 'of', 'light', 'using', 'a', 'set', 'of', 'small', '8mpch3', 'simulations', 'we', 'find', 'that', 'a', 'minimal', 'velocity', 'of', '03c', 'is', 'able', 'to', 'model', 'these', 'two', 'stages', 'in', 'this', 'specific', 'context', 'without', 'significant', 'impact', 'values', 'as', 'low', 'as', '005c', 'can', 'model', 'the', 'first', 'low', 'velocity', 'stage', 'but', 'limit', 'the', 'acceleration', 'at', 'later', 'times', 'lower', 'values', 'modify', 'the', 'distribution', 'of', 'front', 'speeds', 'at', 'all', 'times', 'using', 'larger', '64mpch3', 'volumes', 'that', 'better', 'account', 'for', 'distant', 'sources', 'we', 'find', 'that', 'reduced', 'speed', 'of', 'light', 'has', 'a', 'greater', 'impact', 'on', 'reionization', 'times', 'and', 'front', 'speeds', 'in', 'underdense', 'regions', 'that', 'are', 'reionized', 'at', 'late', 'times', 'the', 'same', 'quantities', 'measured', 'in', 'dense', 'regions', 'with', 'slow', 'fronts', 'are', 'less', 'sensitive', 'to', 'c', 'values']] | [-0.06107498728750744, 0.1449441688625097, -0.07425255550290732, 0.05085621606186203, -0.025352051591171938, -0.0728613155665179, 0.04723808864634291, 0.4018789616761452, -0.22582479897938076, -0.3112661690873361, 0.0963787648965408, -0.22677800046810945, -0.055897901264414275, 0.21457192861993885, 0.0072719490390825234, 0.024126250584193692, 0.07877693175431663, -0.02848116828895667, -0.07559507328611685, -0.2590952282356562, 0.273931128112277, 0.116004313969063, 0.23240227545821027, 0.02184145543144236, 0.12611677408521305, -0.10199621384544459, -0.037494539030244294, 0.014472769987833877, -0.14979705995230821, 0.05068007101559412, 0.19295447633221463, 0.14920110022165783, 0.27168674946353355, -0.46203302665755386, -0.2488893882297366, 0.10532546291473421, 0.17140892733800447, 0.12890273692556833, -0.04675604222696049, -0.24381175506489422, 0.07203506728453775, -0.13730473316735411, -0.1517004150112569, 0.016890001809546744, 0.025813308164193763, 0.035888130936504156, -0.24487208976220198, 0.11558373367323646, -0.03449657657038691, 0.00616622115501483, -0.015285668763328847, -0.07409199322557727, -0.039267582420878445, 0.11223823759522752, 0.024305755027390977, 0.044358155350152494, 0.1674441801654787, -0.17233887960921626, -0.0366745361877818, 0.39640888212422704, -0.09678771824150581, -0.09369663121505031, 0.23064074758843078, -0.18874495532748348, -0.10851680649972963, 0.22197892736227842, 0.21802492714309774, 0.1071307779544365, -0.09916833309282687, -0.010937754010921022, 0.037162595119361146, 0.17468946794076956, 0.10887278861504783, -0.003703998701460015, 0.22165114514104325, 0.1406472590542479, 0.04001341253872735, 0.09202213488578809, -0.11922889049761126, -0.0719528874514502, -0.29142288052215914, -0.12567213198184568, -0.11244441301096231, 0.015548012523902225, -0.11791612321938304, -0.12259314191035417, 0.37840456177664206, 0.18803089517044833, 0.23444172432710605, 0.052525783791512924, 0.331870400886596, 0.12426181800650782, 0.04264760641808135, 0.11458985829704915, 0.26739238871093907, 0.11569276068659312, 0.10602143592165725, -0.21054561335722768, 0.10804415542058723, 0.04142713992353722] |
1,803.01635 | Exact Ground States of the Extended Hubbard Model on the Kagome lattice | We discuss the exact plaquette-ordered ground states of the generalized
Hubbard model on the Kagom\'e lattice for several fillings, by constructing the
Hamiltonian as a sum of products of projection operators for up and down spin
sectors. The obtained exact ground states are interpreted as N\'eel ordered
states on the bond-located electrons. We determine several parameter regions of
the exact ground states, and calculate the entanglement entropy. We examine the
above results by numerical calculations based on exact diagonalization and
density-matrix renormalization group methods.
| cond-mat.str-el cond-mat.stat-mech | we discuss the exact plaquetteordered ground states of the generalized hubbard model on the kagome lattice for several fillings by constructing the hamiltonian as a sum of products of projection operators for up and down spin sectors the obtained exact ground states are interpreted as neel ordered states on the bondlocated electrons we determine several parameter regions of the exact ground states and calculate the entanglement entropy we examine the above results by numerical calculations based on exact diagonalization and densitymatrix renormalization group methods | [['we', 'discuss', 'the', 'exact', 'plaquetteordered', 'ground', 'states', 'of', 'the', 'generalized', 'hubbard', 'model', 'on', 'the', 'kagome', 'lattice', 'for', 'several', 'fillings', 'by', 'constructing', 'the', 'hamiltonian', 'as', 'a', 'sum', 'of', 'products', 'of', 'projection', 'operators', 'for', 'up', 'and', 'down', 'spin', 'sectors', 'the', 'obtained', 'exact', 'ground', 'states', 'are', 'interpreted', 'as', 'neel', 'ordered', 'states', 'on', 'the', 'bondlocated', 'electrons', 'we', 'determine', 'several', 'parameter', 'regions', 'of', 'the', 'exact', 'ground', 'states', 'and', 'calculate', 'the', 'entanglement', 'entropy', 'we', 'examine', 'the', 'above', 'results', 'by', 'numerical', 'calculations', 'based', 'on', 'exact', 'diagonalization', 'and', 'densitymatrix', 'renormalization', 'group', 'methods']] | [-0.15265685928065376, 0.19158204719536456, -0.027348423331796406, 0.12549872372575743, 0.03306434984060835, -0.08641118283035705, 0.13150397629802485, 0.3545419575579195, -0.2156992342592363, -0.2514818064778684, 0.11830996747229652, -0.3197851702570915, -0.07329542694770429, 0.15498693818324638, 0.11358846123723021, 0.05802607481334224, 0.0519185624119029, 0.032067951690181194, -0.1978929182290133, -0.2009589700589338, 0.32230008047926856, -0.016151702784686292, 0.2650918870580843, 0.09200191479849529, 0.08686367745500014, 0.04167335146634155, 0.060875762944076074, 0.0036740940125905967, -0.20364988858934985, 0.10702136339316795, 0.22789801702082876, 0.006452600466065019, 0.15819036950783646, -0.44118793242532445, -0.1776679445125432, 0.01948855789266078, 0.14419767537143036, 0.17961015423524182, 0.0084615618857297, -0.3948596715029464, 0.012508692966033536, -0.2403407393651734, -0.15150257950671106, -0.2125440420784864, -0.05055539366082255, -0.005747879726296088, -0.2203931636233107, 0.09998841627489731, -0.01864082592606814, 0.04898942805220392, -0.1184639807941998, -0.18716364033542662, -0.059249822249501406, 0.11955050721270852, 0.03475636232459177, -0.019281719833702207, 0.08900299091004284, -0.1158748239290014, -0.18327866717668093, 0.3456390870802374, -0.04215879411105605, -0.18100325407527657, 0.15658346664283918, -0.10631364087170236, -0.11111267057460654, 0.08793239063774068, 0.07807033395686422, 0.10799066408211927, -0.08000915491089494, 0.14157159317702794, -0.09279586800306766, 0.12165563156357012, 0.011024049690823597, 0.04627729386809361, 0.16756568606718478, 0.0678302577909935, 0.10941818610664053, 0.19685059437157967, -0.08211587905373245, -0.16969519403639688, -0.2797587850602366, -0.13990092440788826, -0.26926169878836853, 0.04981029742812536, -0.08247316777316926, -0.170292300452669, 0.45792012679648686, 0.11632377483197544, 0.17148359035175428, 0.04302801523941109, 0.21387538008661156, 0.136329858662022, 0.002533820244562195, 0.0711738893955789, 0.20044271643722364, 0.19364223105227013, -0.0376470908242087, -0.2985669425744788, -0.02797101535105023, 0.17751185328935284] |
1,803.01636 | The first $\Delta(27)$ flavor 3-3-1 model with low scale seesaw
mechanism | We propose a viable model based on the $SU(3)_C\times SU(3)_L\times U(1)_X$
gauge group, augmented by the $U(1)_{L_g}$ global lepton number symmetry and
the $\Delta(27) \times Z_3\times Z_{16}$ discrete group, capable of explaining
the Standard Model (SM) fermion masses and mixings, and having a low scale
seesaw mechanism which can be tested at the LHC. In addition the model provides
an explanation for the SM fermion masses and mixings. In the proposed model,
small masses for the light active neutrinos are generated by an inverse seesaw
mechanism caused by non renormalizable Yukawa operators and mediated by three
very light Majorana neutrinos and the observed hierarchy of the SM fermion
masses and mixing angles is produced by the spontaneous breaking of the
$\Delta(27) \times Z_{3}\times Z_{16}$ symmetry at very large energy scale.
This neutrino mass generation mechanism is not presented in our previous 3-3-1
models with $\Delta(27)$ group (Nucl.Phys. B913 (2016) 792-814 and Eur.Phys.J.
C76 (2016) no.5, 242), where the masses of the light active neutrinos arise
from a combination of type I and type II seesaw mechanisms (Nucl.Phys. B913
(2016) 792-814) as well as from a double seesaw mechanism (Eur.Phys.J. C76
(2016) no.5, 242). Thus, this work corresponds to the first implementation of
the $\Delta(27)$ symmetry in a 3-3-1 model with low scale seesaw mechanism.
| hep-ph | we propose a viable model based on the su3_ctimes su3_ltimes u1_x gauge group augmented by the u1_l_g global lepton number symmetry and the delta27 times z_3times z_16 discrete group capable of explaining the standard model sm fermion masses and mixings and having a low scale seesaw mechanism which can be tested at the lhc in addition the model provides an explanation for the sm fermion masses and mixings in the proposed model small masses for the light active neutrinos are generated by an inverse seesaw mechanism caused by non renormalizable yukawa operators and mediated by three very light majorana neutrinos and the observed hierarchy of the sm fermion masses and mixing angles is produced by the spontaneous breaking of the delta27 times z_3times z_16 symmetry at very large energy scale this neutrino mass generation mechanism is not presented in our previous 331 models with delta27 group nuclphys b913 2016 792814 and eurphysj c76 2016 no5 242 where the masses of the light active neutrinos arise from a combination of type i and type ii seesaw mechanisms nuclphys b913 2016 792814 as well as from a double seesaw mechanism eurphysj c76 2016 no5 242 thus this work corresponds to the first implementation of the delta27 symmetry in a 331 model with low scale seesaw mechanism | [['we', 'propose', 'a', 'viable', 'model', 'based', 'on', 'the', 'su3_ctimes', 'su3_ltimes', 'u1_x', 'gauge', 'group', 'augmented', 'by', 'the', 'u1_l_g', 'global', 'lepton', 'number', 'symmetry', 'and', 'the', 'delta27', 'times', 'z_3times', 'z_16', 'discrete', 'group', 'capable', 'of', 'explaining', 'the', 'standard', 'model', 'sm', 'fermion', 'masses', 'and', 'mixings', 'and', 'having', 'a', 'low', 'scale', 'seesaw', 'mechanism', 'which', 'can', 'be', 'tested', 'at', 'the', 'lhc', 'in', 'addition', 'the', 'model', 'provides', 'an', 'explanation', 'for', 'the', 'sm', 'fermion', 'masses', 'and', 'mixings', 'in', 'the', 'proposed', 'model', 'small', 'masses', 'for', 'the', 'light', 'active', 'neutrinos', 'are', 'generated', 'by', 'an', 'inverse', 'seesaw', 'mechanism', 'caused', 'by', 'non', 'renormalizable', 'yukawa', 'operators', 'and', 'mediated', 'by', 'three', 'very', 'light', 'majorana', 'neutrinos', 'and', 'the', 'observed', 'hierarchy', 'of', 'the', 'sm', 'fermion', 'masses', 'and', 'mixing', 'angles', 'is', 'produced', 'by', 'the', 'spontaneous', 'breaking', 'of', 'the', 'delta27', 'times', 'z_3times', 'z_16', 'symmetry', 'at', 'very', 'large', 'energy', 'scale', 'this', 'neutrino', 'mass', 'generation', 'mechanism', 'is', 'not', 'presented', 'in', 'our', 'previous', '331', 'models', 'with', 'delta27', 'group', 'nuclphys', 'b913', '2016', '792814', 'and', 'eurphysj', 'c76', '2016', 'no5', '242', 'where', 'the', 'masses', 'of', 'the', 'light', 'active', 'neutrinos', 'arise', 'from', 'a', 'combination', 'of', 'type', 'i', 'and', 'type', 'ii', 'seesaw', 'mechanisms', 'nuclphys', 'b913', '2016', '792814', 'as', 'well', 'as', 'from', 'a', 'double', 'seesaw', 'mechanism', 'eurphysj', 'c76', '2016', 'no5', '242', 'thus', 'this', 'work', 'corresponds', 'to', 'the', 'first', 'implementation', 'of', 'the', 'delta27', 'symmetry', 'in', 'a', '331', 'model', 'with', 'low', 'scale', 'seesaw', 'mechanism']] | [-0.09604561311260122, 0.28105499338089945, 0.013732025165870009, 0.17315496523948432, -0.08994895655560303, -0.20542942315353283, 0.05975231415508271, 0.3066233454439877, -0.20313683754910156, -0.35085503915015837, 0.05272592253259149, -0.23961557689789348, -0.07286512901977817, 0.087211766409339, 0.005725026741994642, -0.008106365422519603, -0.04874425395546366, -0.05669641869045547, -0.04433936525193612, -0.22191327323881088, 0.2618207566029617, 0.06282980324423505, 0.2570422095251027, 0.04014834003099262, 0.121282834263951, -0.059203233407651434, -0.011366155225302477, -0.16558809060232615, -0.02215863736258087, 0.049551840472118976, 0.12104275633583535, 0.04536371859523216, 0.09264225601902788, -0.36943128021760574, -0.1773886071888827, 0.14556838438285613, 0.13626937776852524, 0.08344048300760211, -0.13979970071281603, -0.34642692065634434, 0.07893442699875489, -0.2605321551507595, -0.11395652459380416, -0.02873580363442265, -0.03445726942482859, -0.14333732480015518, -0.35040674388399834, 0.11935297463760133, -0.02280000957877759, 0.04920597675022497, -0.0014973504985219212, -0.16658238614181065, -0.08153145594116283, -0.03572676308956262, 0.16708800247131064, -0.03321514530681179, 0.09372280876431394, -0.13535006892518692, -0.1703696616073426, 0.4744396572289834, -0.07798561533820325, -0.10711911288575574, 0.1449265955578783, -0.0853681268823726, -0.14657751079992187, 0.09940547496852822, 0.1743187602516705, 0.09457614874992502, -0.17868198769970386, 0.19585056263088332, -0.12850329236643857, 0.1369133839423446, 0.0030241854228432426, 0.014102684528129926, 0.2606113618901838, 0.22027354398345073, -0.007036539288988046, -0.05460434381009225, -0.07256403119580256, -0.05095098877570623, -0.3899936273520795, -0.08489419457445282, -0.09688170668029036, 0.03905380023175782, -0.06426234926163027, -0.051419858432317514, 0.45348697198969773, 0.12612032411858368, 0.2262863211413201, 0.04745506989367977, 0.21585632983917344, 0.043997934738602223, 0.1388927012896033, 0.043599015579865674, 0.25543707696129503, 0.12171986004474498, 0.08756815346390433, -0.27293483593161283, -0.05314247249691831, 0.1609215540943835] |
1,803.01637 | Observation of a superconducting glass state in granular superconducting
diamond | The magnetic field dependence of the superconductivity in nanocrystalline
boron doped diamond thin films is reported. Evidence of a glass state in the
phase diagram is presented, as demonstrated by electrical resistance and
magnetic relaxation measurements. The position of the phase boundary in the H-T
plane is determined from resistance data by detailed fitting to
zero-dimensional fluctuation conductivity theory. This allows determination of
the boundary between resistive and non-resistive behavior to be made with
greater precision than the standard ad hoc onset/midpoint/offset criterion.
| cond-mat.supr-con | the magnetic field dependence of the superconductivity in nanocrystalline boron doped diamond thin films is reported evidence of a glass state in the phase diagram is presented as demonstrated by electrical resistance and magnetic relaxation measurements the position of the phase boundary in the ht plane is determined from resistance data by detailed fitting to zerodimensional fluctuation conductivity theory this allows determination of the boundary between resistive and nonresistive behavior to be made with greater precision than the standard ad hoc onsetmidpointoffset criterion | [['the', 'magnetic', 'field', 'dependence', 'of', 'the', 'superconductivity', 'in', 'nanocrystalline', 'boron', 'doped', 'diamond', 'thin', 'films', 'is', 'reported', 'evidence', 'of', 'a', 'glass', 'state', 'in', 'the', 'phase', 'diagram', 'is', 'presented', 'as', 'demonstrated', 'by', 'electrical', 'resistance', 'and', 'magnetic', 'relaxation', 'measurements', 'the', 'position', 'of', 'the', 'phase', 'boundary', 'in', 'the', 'ht', 'plane', 'is', 'determined', 'from', 'resistance', 'data', 'by', 'detailed', 'fitting', 'to', 'zerodimensional', 'fluctuation', 'conductivity', 'theory', 'this', 'allows', 'determination', 'of', 'the', 'boundary', 'between', 'resistive', 'and', 'nonresistive', 'behavior', 'to', 'be', 'made', 'with', 'greater', 'precision', 'than', 'the', 'standard', 'ad', 'hoc', 'onsetmidpointoffset', 'criterion']] | [-0.14600894290090696, 0.17041346455765208, -0.06079983119512113, -0.0399479050070002, -0.05723267585811455, -0.1328425916570534, 0.09144455686115047, 0.3858445265171368, -0.22626172369573175, -0.2992560711871015, 0.062093559483622725, -0.29420052655342904, -0.08676297031910862, 0.18054120971753104, -0.0020239098997014327, 0.07250646568221472, -0.018443074622532217, -0.025909771239839313, -0.10303023564288528, -0.16992790883452427, 0.2638147124827544, 0.048640533145971415, 0.3649557562908385, 0.06267060605218498, 0.004909300791840041, -0.0005670678120379041, 0.06825389915214079, 0.08256679667705079, -0.19886695063195942, 0.02153342088866161, 0.22538871150009515, -0.06789145582332844, 0.1445425805613035, -0.46171672894369536, -0.23765648439208545, 0.0336274707281008, 0.09908043781704293, 0.09076551131750797, -0.04022516318165311, -0.24939756554256126, 0.07126798161600785, -0.0932351220967021, -0.14041280930310987, -0.0529401398422878, 0.005604273658075438, -0.05406949993098018, -0.2573857976715705, 0.12110098816522556, 0.038382837756128024, 0.14141364848786375, -0.10894613991358044, -0.12796056252427218, -0.07479031212491596, 0.04774079203219494, 0.04225283540592233, 0.07252947652212731, 0.18793933409288888, -0.12650216657884147, -0.09131723015126204, 0.31928236098823753, -0.029925409975076922, -0.10392619327112476, 0.13579572315850272, -0.20424737608650836, -0.009050829432586708, 0.16967170126168285, 0.06657314260785537, 0.09550304497342284, -0.18873682055940352, 0.06219125979597021, 0.03145790416122664, 0.18824752988066615, 0.04431659206691221, 0.010821854695677757, 0.19560277555137873, 0.2634476933446599, 0.005149597881316412, 0.1695368468247513, -0.10974327193732124, -0.044495615290432444, -0.24422326013900159, -0.19445841700383804, -0.20795434415936698, 0.0995559481699474, -0.13319708219489435, -0.23068816146654328, 0.3745303533789588, 0.14543132379469348, 0.17404523255621515, -0.08810202528654439, 0.27809129141998, 0.08681646996552533, 0.060075078295861804, 0.03306497012764761, 0.2946244043116344, 0.23848809036653398, 0.16384229204555684, -0.2754422432044521, 0.12045179366520266, 0.04597877895192629] |
1,803.01638 | H\"older continuity of the Lyapunov exponent for Schr\"odinger cocycle
with quasi-periodic Gevrey potential and weak Liouville frequency | For analytic quasi-periodic Schr\"odinger cocycles, You and Zhang [9] proved
that the Lyapunov exponent is H\"older continuous for weak Liouville frequency.
In this paper, we prove that the H\"older continuity also holds if the analytic
potential is weakened to Gevrey potential.
| math-ph math.MP | for analytic quasiperiodic schrodinger cocycles you and zhang 9 proved that the lyapunov exponent is holder continuous for weak liouville frequency in this paper we prove that the holder continuity also holds if the analytic potential is weakened to gevrey potential | [['for', 'analytic', 'quasiperiodic', 'schrodinger', 'cocycles', 'you', 'and', 'zhang', '9', 'proved', 'that', 'the', 'lyapunov', 'exponent', 'is', 'holder', 'continuous', 'for', 'weak', 'liouville', 'frequency', 'in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'holder', 'continuity', 'also', 'holds', 'if', 'the', 'analytic', 'potential', 'is', 'weakened', 'to', 'gevrey', 'potential']] | [-0.19460311608116437, 0.08732779789716005, -0.09608926513891031, 0.16900146404201755, -0.14864526237730255, -0.21668391315857086, 0.015559122582511386, 0.3524749906642771, -0.3195608825218387, -0.034264440284814776, 0.11358810832621757, -0.23669671916925325, -0.17684210648351326, 0.2766015440929772, -0.11390147512642348, 0.13641706918843272, 0.015304672917941721, 0.014732793836695393, -0.07523694733248615, -0.2742192073747879, 0.3751062216100896, -0.07128473811941903, 0.16760846418215009, 0.10199363799833142, 0.06288765936453895, 0.00675034664412279, 0.03663045672200075, -0.046188454484430756, -0.22839998636890213, 0.07944123263658229, 0.20903906503283395, 0.015169711255400283, 0.3555168523112448, -0.32163913761515445, -0.2522478908436691, 0.19806627872990581, 0.13939691754625883, -0.00546465489286475, -0.0641453729136052, -0.32206262357351256, 0.18770158295406075, -0.11066258271656386, -0.291718708669267, -0.10682489697980445, 0.18327099457383156, 0.09915478538903522, -0.36094883702150204, 0.17107643097817965, 0.15371377325457772, 0.0724803540719355, -0.16988046394615638, 0.006648963362705417, -0.08304612765588411, 0.083634839824787, 0.042760920813080014, 0.12016877803451768, 0.0581596087687081, -0.008221347606173011, -0.07058046035832022, 0.26458318049951296, -0.10262853738556547, -0.24586337623072835, 0.1507446761555379, -0.25320786517113447, -0.19546379894018173, 0.04914206302747494, 0.06858379539193177, 0.06084828128720202, -0.13420142963380985, 0.22431817602951126, -0.022634919806633416, 0.17911471006256052, 0.16965217511283187, 0.009855941119717389, -0.018192920561243848, 0.003996098050620497, 0.21636233056282125, 0.11397589543243734, 0.0478347807032306, -0.032130052290129954, -0.3456787900408594, -0.170337036524604, -0.20367029627285352, 0.1967482931639363, -0.10872449454384367, -0.19237984980388387, 0.4035940303370675, 0.19311758756592143, 0.06766118558986885, 0.20050328165837905, 0.18192996911522819, 0.2175577434188709, -0.08111677582502769, 0.10003186094506485, 0.26192305627756, 0.15213603971571457, 0.19772981357101987, -0.10730683619565354, -0.00499802291756723, 0.23317011193622175] |
1,803.01639 | When do we have the power to detect biological interactions in spatial
point patterns? | Determining the relative importance of environmental factors, biotic
interactions and stochasticity in assembling and maintaining species-rich
communities remains a major challenge in ecology. In plant communities,
interactions between individuals of different species are expected to leave a
spatial signature in the form of positive or negative spatial correlations over
distances relating to the spatial scale of interaction. Most studies using
spatial point process tools have found relatively little evidence for
interactions between pairs of species. More interactions tend to be detected in
communities with fewer species. However, there is currently no understanding of
how the power to detect spatial interactions may change with sample size, or
the scale and intensity of interactions.
We use a simple 2-species model where the scale and intensity of interactions
are controlled to simulate point pattern data. In combination with an
approximation to the variance of the spatial summary statistics that we sample,
we investigate the power of current spatial point pattern methods to correctly
reject the null model of bivariate species independence.
We show that the power to detect interactions is positively related to the
abundances of the species tested, and the intensity and scale of interactions.
Increasing imbalance in abundances has a negative effect on the power to detect
interactions. At population sizes typically found in currently available
datasets for species-rich plant communities we find only a very low power to
detect interactions. Differences in power may explain the increased frequency
of interactions in communities with fewer species. Furthermore, the
community-wide frequency of detected interactions is very sensitive to a
minimum abundance criterion for including species in the analyses.
| q-bio.PE stat.ME | determining the relative importance of environmental factors biotic interactions and stochasticity in assembling and maintaining speciesrich communities remains a major challenge in ecology in plant communities interactions between individuals of different species are expected to leave a spatial signature in the form of positive or negative spatial correlations over distances relating to the spatial scale of interaction most studies using spatial point process tools have found relatively little evidence for interactions between pairs of species more interactions tend to be detected in communities with fewer species however there is currently no understanding of how the power to detect spatial interactions may change with sample size or the scale and intensity of interactions we use a simple 2species model where the scale and intensity of interactions are controlled to simulate point pattern data in combination with an approximation to the variance of the spatial summary statistics that we sample we investigate the power of current spatial point pattern methods to correctly reject the null model of bivariate species independence we show that the power to detect interactions is positively related to the abundances of the species tested and the intensity and scale of interactions increasing imbalance in abundances has a negative effect on the power to detect interactions at population sizes typically found in currently available datasets for speciesrich plant communities we find only a very low power to detect interactions differences in power may explain the increased frequency of interactions in communities with fewer species furthermore the communitywide frequency of detected interactions is very sensitive to a minimum abundance criterion for including species in the analyses | [['determining', 'the', 'relative', 'importance', 'of', 'environmental', 'factors', 'biotic', 'interactions', 'and', 'stochasticity', 'in', 'assembling', 'and', 'maintaining', 'speciesrich', 'communities', 'remains', 'a', 'major', 'challenge', 'in', 'ecology', 'in', 'plant', 'communities', 'interactions', 'between', 'individuals', 'of', 'different', 'species', 'are', 'expected', 'to', 'leave', 'a', 'spatial', 'signature', 'in', 'the', 'form', 'of', 'positive', 'or', 'negative', 'spatial', 'correlations', 'over', 'distances', 'relating', 'to', 'the', 'spatial', 'scale', 'of', 'interaction', 'most', 'studies', 'using', 'spatial', 'point', 'process', 'tools', 'have', 'found', 'relatively', 'little', 'evidence', 'for', 'interactions', 'between', 'pairs', 'of', 'species', 'more', 'interactions', 'tend', 'to', 'be', 'detected', 'in', 'communities', 'with', 'fewer', 'species', 'however', 'there', 'is', 'currently', 'no', 'understanding', 'of', 'how', 'the', 'power', 'to', 'detect', 'spatial', 'interactions', 'may', 'change', 'with', 'sample', 'size', 'or', 'the', 'scale', 'and', 'intensity', 'of', 'interactions', 'we', 'use', 'a', 'simple', '2species', 'model', 'where', 'the', 'scale', 'and', 'intensity', 'of', 'interactions', 'are', 'controlled', 'to', 'simulate', 'point', 'pattern', 'data', 'in', 'combination', 'with', 'an', 'approximation', 'to', 'the', 'variance', 'of', 'the', 'spatial', 'summary', 'statistics', 'that', 'we', 'sample', 'we', 'investigate', 'the', 'power', 'of', 'current', 'spatial', 'point', 'pattern', 'methods', 'to', 'correctly', 'reject', 'the', 'null', 'model', 'of', 'bivariate', 'species', 'independence', 'we', 'show', 'that', 'the', 'power', 'to', 'detect', 'interactions', 'is', 'positively', 'related', 'to', 'the', 'abundances', 'of', 'the', 'species', 'tested', 'and', 'the', 'intensity', 'and', 'scale', 'of', 'interactions', 'increasing', 'imbalance', 'in', 'abundances', 'has', 'a', 'negative', 'effect', 'on', 'the', 'power', 'to', 'detect', 'interactions', 'at', 'population', 'sizes', 'typically', 'found', 'in', 'currently', 'available', 'datasets', 'for', 'speciesrich', 'plant', 'communities', 'we', 'find', 'only', 'a', 'very', 'low', 'power', 'to', 'detect', 'interactions', 'differences', 'in', 'power', 'may', 'explain', 'the', 'increased', 'frequency', 'of', 'interactions', 'in', 'communities', 'with', 'fewer', 'species', 'furthermore', 'the', 'communitywide', 'frequency', 'of', 'detected', 'interactions', 'is', 'very', 'sensitive', 'to', 'a', 'minimum', 'abundance', 'criterion', 'for', 'including', 'species', 'in', 'the', 'analyses']] | [-0.12013124231414526, 0.14371920441487618, -0.048421817602584474, 0.11061989801437722, -0.029704946560235482, -0.12158508161103652, 0.03814082203522198, 0.38233594574240787, -0.2538902531749975, -0.3641842929646373, 0.0422254826937438, -0.3199614859483716, -0.09853612323190064, 0.12306860473385095, -0.0058779266690905385, -0.04238072361668425, 0.03041051196239841, 0.0212411857984743, 0.016301174003882965, -0.2056428298596608, 0.3006738603834581, 0.10100145128650129, 0.28431285377171706, 0.066381456501978, 0.07439609777172602, -0.06108768370450664, -0.0698161389743489, 0.047966794433383815, -0.06477547705982492, 0.09246150355548002, 0.27839485672762077, 0.13711394876096383, 0.25876154203696133, -0.4262109260961367, -0.2121229452725248, 0.1744663162328499, 0.1582663714040169, 0.11166104816712825, -0.059435046288279794, -0.2423317835174319, 0.03916638782177877, -0.12444533035903119, -0.13423099165565258, -0.05665329622570425, 0.053298298160097374, 0.046782575935892114, -0.27235191102188666, 0.12530532729973023, 0.015608982942063804, 0.10254653392331604, -0.01876257340724867, -0.11011269019524518, -0.030220727653319675, 0.17451496829744428, 0.06796734526202422, -0.03351801630552452, 0.13381673923879162, -0.17893743715809196, -0.08335793658362743, 0.3687307318126349, -0.0625895210314206, -0.17561614620884447, 0.2685144423941304, -0.1793206021753385, -0.16367058362811804, 0.12411873939769216, 0.23467583865928637, 0.056885254262995566, -0.16341250712188535, 0.012337271811784581, 0.019876092211938555, 0.23624353079268398, 0.07450079077266548, 0.02168945482576658, 0.22012354264077835, 0.16669072828052522, 0.06616387691758432, 0.07580446174212459, -0.1173617960596317, -0.1029692939819621, -0.1869435185086003, -0.09140489268135472, -0.15283065507034385, -0.001960195249989909, -0.08947204833833196, -0.14152610972278604, 0.39754076068345595, 0.19321787981158892, 0.21764768388724529, 0.04299454505142188, 0.2672192745761512, 0.050407889486409556, 0.1166371028604252, 0.01718798958647408, 0.22652039040034092, 0.10204086306021738, 0.05564247432849335, -0.22044768920881652, 0.13385732398942618, -0.03666469145258118] |
1,803.0164 | J plots: a new method for characterizing structures in the interstellar
medium | Large scale surveys have brought about a revolution in astronomy. To analyse
the resulting wealth of data, we need automated tools to identify, classify,
and quantify the important underlying structures. We present here a method for
classifying and quantifying a pixelated structure, based on its principal
moments of inertia. The method enables us to automatically detect, and
objectively compare, centrally condensed cores, elongated filaments and hollow
rings. We illustrate the method by applying it to (i) observations of
surface-density from Hi-GAL, and (ii) simulations of filament growth in a
turbulent medium. We limit the discussion here to 2D data; in a future paper we
will extend the method to 3D data.
| astro-ph.GA | large scale surveys have brought about a revolution in astronomy to analyse the resulting wealth of data we need automated tools to identify classify and quantify the important underlying structures we present here a method for classifying and quantifying a pixelated structure based on its principal moments of inertia the method enables us to automatically detect and objectively compare centrally condensed cores elongated filaments and hollow rings we illustrate the method by applying it to i observations of surfacedensity from higal and ii simulations of filament growth in a turbulent medium we limit the discussion here to 2d data in a future paper we will extend the method to 3d data | [['large', 'scale', 'surveys', 'have', 'brought', 'about', 'a', 'revolution', 'in', 'astronomy', 'to', 'analyse', 'the', 'resulting', 'wealth', 'of', 'data', 'we', 'need', 'automated', 'tools', 'to', 'identify', 'classify', 'and', 'quantify', 'the', 'important', 'underlying', 'structures', 'we', 'present', 'here', 'a', 'method', 'for', 'classifying', 'and', 'quantifying', 'a', 'pixelated', 'structure', 'based', 'on', 'its', 'principal', 'moments', 'of', 'inertia', 'the', 'method', 'enables', 'us', 'to', 'automatically', 'detect', 'and', 'objectively', 'compare', 'centrally', 'condensed', 'cores', 'elongated', 'filaments', 'and', 'hollow', 'rings', 'we', 'illustrate', 'the', 'method', 'by', 'applying', 'it', 'to', 'i', 'observations', 'of', 'surfacedensity', 'from', 'higal', 'and', 'ii', 'simulations', 'of', 'filament', 'growth', 'in', 'a', 'turbulent', 'medium', 'we', 'limit', 'the', 'discussion', 'here', 'to', '2d', 'data', 'in', 'a', 'future', 'paper', 'we', 'will', 'extend', 'the', 'method', 'to', '3d', 'data']] | [-0.05947057005707049, 0.0331581883082116, -0.11239715263683785, 0.07775172161206871, -0.11782920408809373, -0.055543722933040815, 0.028241106651949923, 0.41504958262750963, -0.2533099983676194, -0.3251859487856629, 0.12681113868670724, -0.2723174296269143, -0.14386184880224703, 0.1865519874032822, -0.04201098065403802, 0.028597872233886674, 0.05941638174290593, -0.05819177681680869, -0.0461861122240153, -0.208667881793116, 0.33512134160343054, 0.0759170930077498, 0.27799815931441346, 0.021424118601423396, 0.07785660316559344, -0.05572342379689888, -0.1212578754167299, 0.050730351694263855, -0.18318827303628823, 0.19528184577755564, 0.23977594476965097, 0.15364838465796532, 0.2543340585307797, -0.4491803723697861, -0.1724375091988157, 0.08538242610305682, 0.17443214728589262, 0.13472629833110683, -0.04062771461044044, -0.29546613302417435, 0.08842972859998259, -0.16216731187258218, -0.1888620959687139, -0.12316208832838514, 0.023397193676246715, 0.027681495988561126, -0.21206775635978006, 0.05951517065231864, 0.012630514769084953, 0.06338009706945871, -0.08599241919970761, -0.04192517028265708, 0.009715626240699543, 0.1269909347258592, 0.00630253513379291, 0.007601195849847418, 0.15494495512800174, -0.13368024616890276, -0.078573778611482, 0.4060053513930725, -0.03940788863503651, -0.1317268128733377, 0.18931733146582538, -0.1806801002103466, -0.17858492529338543, 0.12191132958223289, 0.2583593186536418, 0.08983727632644209, -0.137528440814889, 0.007092847209318902, -0.024713369692583476, 0.1730219756404089, 0.016313314211328287, -0.03878344062648646, 0.260825957515621, 0.19677594831204964, 0.037551440212556776, 0.15693562476988043, -0.19422319988082457, -0.0536801892055853, -0.24083314282685384, -0.18087547345439325, -0.15037791394032873, 0.029354243866495183, -0.044905583464791204, -0.1290484254609223, 0.3952429391410168, 0.23276679249908272, 0.1903956320120005, 0.015532766182110896, 0.3091845758729153, 0.006219698359501791, 0.10378333676170122, 0.07152756765853983, 0.2065534785322778, 0.15494210743513126, 0.1076821885847797, -0.1723812381099272, 0.000655895963244073, 0.0023411653646444146] |
1,803.01641 | Generation of multiphoton entangled quantum states with a single silicon
nanowire | Multiphoton entanglement plays a critical role in quantum information
processing, and greatly improves our fundamental understanding of the quantum
world. Despite tremendous efforts in either bulk media or fiber-based devices,
nonlinear interactions in integrated circuits show great promise as an
excellent platform for photon pair generation with its high brightness,
stability and scalability \cite{Caspani2017}. Here, we demonstrate the
generation of bi- and multiphoton polarization entangled qubits in a single
silicon nanowire waveguide, and these qubits directly compatible with the dense
wavelength division multiplexing in telecommunication system. Multiphoton
interference and quantum state tomography were used to characterize the quality
of the entangled states. Four-photon entanglement states among two frequency
channels were ascertained with a fidelity of $0.78\pm0.02$. Our work realizes
the integrated multiphoton source in a relatively simple pattern and paves a
way for the revolution of multiphoton quantum science.
| quant-ph | multiphoton entanglement plays a critical role in quantum information processing and greatly improves our fundamental understanding of the quantum world despite tremendous efforts in either bulk media or fiberbased devices nonlinear interactions in integrated circuits show great promise as an excellent platform for photon pair generation with its high brightness stability and scalability citecaspani2017 here we demonstrate the generation of bi and multiphoton polarization entangled qubits in a single silicon nanowire waveguide and these qubits directly compatible with the dense wavelength division multiplexing in telecommunication system multiphoton interference and quantum state tomography were used to characterize the quality of the entangled states fourphoton entanglement states among two frequency channels were ascertained with a fidelity of 078pm002 our work realizes the integrated multiphoton source in a relatively simple pattern and paves a way for the revolution of multiphoton quantum science | [['multiphoton', 'entanglement', 'plays', 'a', 'critical', 'role', 'in', 'quantum', 'information', 'processing', 'and', 'greatly', 'improves', 'our', 'fundamental', 'understanding', 'of', 'the', 'quantum', 'world', 'despite', 'tremendous', 'efforts', 'in', 'either', 'bulk', 'media', 'or', 'fiberbased', 'devices', 'nonlinear', 'interactions', 'in', 'integrated', 'circuits', 'show', 'great', 'promise', 'as', 'an', 'excellent', 'platform', 'for', 'photon', 'pair', 'generation', 'with', 'its', 'high', 'brightness', 'stability', 'and', 'scalability', 'citecaspani2017', 'here', 'we', 'demonstrate', 'the', 'generation', 'of', 'bi', 'and', 'multiphoton', 'polarization', 'entangled', 'qubits', 'in', 'a', 'single', 'silicon', 'nanowire', 'waveguide', 'and', 'these', 'qubits', 'directly', 'compatible', 'with', 'the', 'dense', 'wavelength', 'division', 'multiplexing', 'in', 'telecommunication', 'system', 'multiphoton', 'interference', 'and', 'quantum', 'state', 'tomography', 'were', 'used', 'to', 'characterize', 'the', 'quality', 'of', 'the', 'entangled', 'states', 'fourphoton', 'entanglement', 'states', 'among', 'two', 'frequency', 'channels', 'were', 'ascertained', 'with', 'a', 'fidelity', 'of', '078pm002', 'our', 'work', 'realizes', 'the', 'integrated', 'multiphoton', 'source', 'in', 'a', 'relatively', 'simple', 'pattern', 'and', 'paves', 'a', 'way', 'for', 'the', 'revolution', 'of', 'multiphoton', 'quantum', 'science']] | [-0.1526061728950182, 0.1804778798642427, -0.021452163553874887, -0.016720547923736655, 0.024605757052106034, -0.19563551605713084, 0.05396789938456168, 0.4455895101971054, -0.2212163511235403, -0.29758632660972595, 0.015725736160436304, -0.29100725403816924, -0.11257850261486686, 0.268101364991077, -0.028763592511714592, 0.16996988999771198, 0.08889238160089964, -0.05062842714586669, 0.012421897976203774, -0.19949165555091072, 0.2530293371885281, 0.05039998316409977, 0.40906446135983576, 0.07485180553966576, 0.10417913879696143, 0.033750200978935746, 0.0041281171049582805, -0.08061602187553679, -0.03688113197657096, 0.15913855403671925, 0.32137624605687976, 0.0924878383402026, 0.2517557685555768, -0.4447605660742652, -0.23096299908518192, 0.07046114993247672, 0.15749422561744378, 0.16472359274745152, -0.10175844045682218, -0.3196906306216643, -0.013327458808810389, -0.16675800129594484, -0.10423662906916673, -0.06814700411632657, -0.0057803936690146475, -0.05698209605094753, -0.22387346619209886, 0.037186182743060764, 0.03243792029675504, 0.038631206810012135, 0.04185844649827145, -0.004438153837712305, -0.006942401963020981, 0.12941644844313555, -0.1541387076034163, -0.006758401026765741, 0.15082455897129338, -0.19166616789051705, -0.22365135962592206, 0.362805567518638, -0.05943248542297604, -0.12755777131609727, 0.1831589430404052, -0.15444013456827588, -0.07541288464010631, 0.10039403029024112, 0.16580693494277007, 0.051093941180538525, -0.1286330345608498, 0.04406570101812835, 0.05748414770312553, 0.22753013752699985, 0.11707044514847824, 0.23841334416626198, 0.2521991988331297, 0.1903518694282992, 0.03837073522358181, 0.18729468854484113, -0.08407179228145711, -0.1129159887396071, -0.24586027181523779, -0.23962250434288782, -0.22088825746174276, 0.09217646357307659, -0.08249949468456949, -0.1152496190527522, 0.4079942502910747, 0.12208580921988689, 0.10990082107851432, -0.04420116747029289, 0.31609488861893653, 0.09401814077460771, 0.0809967203888308, 0.011116929807747802, 0.2901106826471586, 0.17144630949121703, 0.11483464932613445, -0.26308456638634176, 0.028794659330529996, -0.09290456665802176] |
1,803.01642 | On the nonstationary Stokes system in a cone: asymptotics of solutions
at infinity | The paper deals with the Dirichlet problem for the nonstationary Stokes
system in a cone. The authors obtain existence and uniqueness results for
solutions in weighted Sobolev spaces and study the asymptotics of the solutions
at infinity.
| math.AP | the paper deals with the dirichlet problem for the nonstationary stokes system in a cone the authors obtain existence and uniqueness results for solutions in weighted sobolev spaces and study the asymptotics of the solutions at infinity | [['the', 'paper', 'deals', 'with', 'the', 'dirichlet', 'problem', 'for', 'the', 'nonstationary', 'stokes', 'system', 'in', 'a', 'cone', 'the', 'authors', 'obtain', 'existence', 'and', 'uniqueness', 'results', 'for', 'solutions', 'in', 'weighted', 'sobolev', 'spaces', 'and', 'study', 'the', 'asymptotics', 'of', 'the', 'solutions', 'at', 'infinity']] | [-0.13265543803572655, -0.03319280539211389, -0.05132670827663025, 0.09589650648067126, -0.05478307297704993, -0.07804013988808603, -0.007152457114283902, 0.2680941826689082, -0.28097625610393445, -0.17837012247056575, 0.21377173158642207, -0.34830387278988556, -0.08996172201492496, 0.169256042689085, -0.0903977299159443, 0.13024452585424925, 0.09401949206870552, 0.019702127675299306, -0.09084637291930817, -0.2030091559564745, 0.46258954260800333, -0.049301745130907036, 0.2632926346079723, 0.05266550895632119, 0.09003850810915685, -0.010449646160358915, -0.03568087326916489, -0.003830885816667531, -0.22060192259959877, 0.12394790668229295, 0.2706620699247798, 0.045324899961014055, 0.3373837391468319, -0.3796804452667365, -0.19826420376429688, 0.1403044926355014, 0.13545609889803706, 0.057396589854662936, -0.020569874980562442, -0.31355392046876857, 0.11201805784996297, -0.04758285844346156, -0.2577154952025897, -0.05031057130671232, -0.010889094788581133, 0.09060716309043504, -0.33564686060354515, 0.09456151341264313, 0.09354508345367739, 0.029560997830452147, -0.2651065795153782, -0.06332787003909313, 0.07577312217924644, 0.07063061750267406, 0.12947785431468808, -0.025232888839987887, -0.0751862857692145, -0.1530154301105319, -0.12175344424070539, 0.3266987855974081, -0.09477188862935715, -0.28796399807607803, 0.1393817536331512, -0.16354258373581074, -0.11410855977619822, 0.0875301821207678, 0.20232335400037668, 0.2146133397882049, -0.09629868559942052, 0.18004076873468286, -0.09894203414788118, 0.0628026689629297, 0.1523243710650383, 0.009592980926705373, 0.0902419202029705, 0.10775139182806015, 0.18296972480980125, 0.19836022584648752, -0.016792839128725433, -0.08943378049848802, -0.369250793513414, -0.19931796293177112, -0.16514993710695086, 0.05358702457837156, -0.14163261591504026, -0.20841652001380115, 0.4151222371571773, 0.09732988207424814, 0.17802451842942754, 0.16698230742602735, 0.17776536584101818, 0.14883613716055816, -0.11131743341684341, 0.10697993253533905, 0.18888361027111877, 0.16640887887695352, 0.2510916120498567, -0.20339832570705865, 0.04213590505910483, 0.21919062547385693] |
1,803.01643 | Dynamics of a system of coupled inverted pendula with vertical forcing | Dynamical stabilization of an inverted pendulum through vertical movement of
the pivot is a well-known counterintuitive phenomenon in classical mechanics.
This system is also known as Kapitza pendulum and the stability can be
explained with the aid of effective potential. We explore the effect of many
body interaction for such a system. Our numerical analysis shows that
interaction between pendula generally degrades the dynamical stability of each
pendulum. This effect is more pronounced in nearest neighbour coupling than
all-to-all coupling and stability improves with the increase of the system
size. We report development of beats and clustering in network of coupled
pendula.
| physics.class-ph | dynamical stabilization of an inverted pendulum through vertical movement of the pivot is a wellknown counterintuitive phenomenon in classical mechanics this system is also known as kapitza pendulum and the stability can be explained with the aid of effective potential we explore the effect of many body interaction for such a system our numerical analysis shows that interaction between pendula generally degrades the dynamical stability of each pendulum this effect is more pronounced in nearest neighbour coupling than alltoall coupling and stability improves with the increase of the system size we report development of beats and clustering in network of coupled pendula | [['dynamical', 'stabilization', 'of', 'an', 'inverted', 'pendulum', 'through', 'vertical', 'movement', 'of', 'the', 'pivot', 'is', 'a', 'wellknown', 'counterintuitive', 'phenomenon', 'in', 'classical', 'mechanics', 'this', 'system', 'is', 'also', 'known', 'as', 'kapitza', 'pendulum', 'and', 'the', 'stability', 'can', 'be', 'explained', 'with', 'the', 'aid', 'of', 'effective', 'potential', 'we', 'explore', 'the', 'effect', 'of', 'many', 'body', 'interaction', 'for', 'such', 'a', 'system', 'our', 'numerical', 'analysis', 'shows', 'that', 'interaction', 'between', 'pendula', 'generally', 'degrades', 'the', 'dynamical', 'stability', 'of', 'each', 'pendulum', 'this', 'effect', 'is', 'more', 'pronounced', 'in', 'nearest', 'neighbour', 'coupling', 'than', 'alltoall', 'coupling', 'and', 'stability', 'improves', 'with', 'the', 'increase', 'of', 'the', 'system', 'size', 'we', 'report', 'development', 'of', 'beats', 'and', 'clustering', 'in', 'network', 'of', 'coupled', 'pendula']] | [-0.19615834626693315, 0.1221850136189103, -0.06679766121156075, 0.022697569666585576, -0.06400568389753793, -0.16835976258038962, 0.03068424601509583, 0.3395833891232078, -0.29000196838751435, -0.3149860015540731, 0.0814128589437471, -0.2712477928429258, -0.2315678090477983, 0.2138027508158748, -0.03759466114855718, 0.019006293613974955, 0.09113668279001015, 0.03868398720663333, -0.02795178407355778, -0.16673416322252402, 0.2827802000056003, 0.07472228314059869, 0.2575094961177777, 0.03270726671040643, 0.07851102650074251, 0.02449567986917043, 0.06847193358265155, 0.03964337099265928, -0.05868873337328528, 0.05882250293906705, 0.1344266145081515, 0.026397034617177413, 0.2699592262506485, -0.3941259129776382, -0.1994824681120614, 0.0728014803813387, 0.20961623391656972, 0.15625879095465528, -0.05231575561900208, -0.28232626750490025, 0.01919421006688008, -0.17953958861100688, -0.1663928085609394, -0.05458808128890928, 0.027132027042920098, 0.04028335352446519, -0.2654539718310915, 0.11681121524352599, 0.07590751387076178, 0.09420129202087135, -0.06525747043391068, -0.06986333523972836, -0.010897693975244229, 0.14629734142263437, 0.045078629840110594, -0.0073002426127227495, 0.1401991542684389, -0.0947551079660508, -0.1215905904925118, 0.4070464336112434, -0.09560716287167309, -0.20757233075767312, 0.21646142417254546, -0.11569543483018802, -0.07832260689168584, 0.07320478090139873, 0.1593924933250117, 0.06423618639225834, -0.11598422047773413, 0.02201273748434295, -0.005904749720631277, 0.21123445317304382, 0.05434458423405886, -0.004785280084630072, 0.2020987795994562, 0.2986280955556853, 0.09493166572065093, 0.18793595628584644, -0.05416018426345259, -0.15452668578455261, -0.2365922819327691, -0.12116010126819853, -0.14820316439156658, 0.010056436350614782, -0.11986727398941772, -0.16983925906813466, 0.4010866751127383, 0.17645339932299547, 0.17429944550545484, 0.030471374472493633, 0.3015777785970154, 0.11515453229110469, 0.045122744602279045, -0.00012854073543612865, 0.34164702683554815, 0.12945238450615137, 0.08751310744578493, -0.3209892709821682, 0.05015717206212381, 0.030844081170382162] |
1,803.01644 | The BINGO telescope: a new instrument exploring the new 21-cm cosmology
window | BINGO is a unique radio telescope designed to make the first detection of
Baryon Acoustic Oscillations (BAO) at radio frequencies. This will be achieved
by measuring the distribution of neutral hydrogen gas at cosmological distances
using a technique called Intensity Mapping. Along with the Cosmic Microwave
Background anisotropies, the scale of BAO is one of the most powerful probes of
cosmological parameters, including dark energy. The telescope will be built in
a very low RFI site in South America and will operate in the frequency range
from 0.96 GHz to 1.26 GHz. The telescope design consists of two $\thicksim$
40-m compact mirrors with no moving parts. Such a design will give the
excellent polarization performance and very low sidelobe levels required for
intensity mapping. With a feedhorn array of 50 receivers, it will map a
$15^{\circ}$ declination strip as the sky drifts past the field-of-view of the
telescope. The BINGO consortium is composed Universidade de S\~ao Paulo,
Instituto Nacional de Pesquisas Espaciais (Brazil), University of Manchester
and University College London (United Kingdom), ETH Z\"urich (Switzerland) and
Universidad de La Republica (Uruguay). The telescope assembly and horn design
and fabrication are under way in Brazil. The receiver was designed in UK and
will be developed in Brazil, with most of the components for the receiver will
also be supplied by Brazilian industry. The experience and science goals
achieved by the BINGO team will be advantageous as a pathfinder mission for the
Square Kilometre Array (SKA) project. This paper reports the current status of
the BINGO mission, as well as preliminary results already obtained for the
instrumentation development.
| astro-ph.IM | bingo is a unique radio telescope designed to make the first detection of baryon acoustic oscillations bao at radio frequencies this will be achieved by measuring the distribution of neutral hydrogen gas at cosmological distances using a technique called intensity mapping along with the cosmic microwave background anisotropies the scale of bao is one of the most powerful probes of cosmological parameters including dark energy the telescope will be built in a very low rfi site in south america and will operate in the frequency range from 096 ghz to 126 ghz the telescope design consists of two thicksim 40m compact mirrors with no moving parts such a design will give the excellent polarization performance and very low sidelobe levels required for intensity mapping with a feedhorn array of 50 receivers it will map a 15circ declination strip as the sky drifts past the fieldofview of the telescope the bingo consortium is composed universidade de sao paulo instituto nacional de pesquisas espaciais brazil university of manchester and university college london united kingdom eth zurich switzerland and universidad de la republica uruguay the telescope assembly and horn design and fabrication are under way in brazil the receiver was designed in uk and will be developed in brazil with most of the components for the receiver will also be supplied by brazilian industry the experience and science goals achieved by the bingo team will be advantageous as a pathfinder mission for the square kilometre array ska project this paper reports the current status of the bingo mission as well as preliminary results already obtained for the instrumentation development | [['bingo', 'is', 'a', 'unique', 'radio', 'telescope', 'designed', 'to', 'make', 'the', 'first', 'detection', 'of', 'baryon', 'acoustic', 'oscillations', 'bao', 'at', 'radio', 'frequencies', 'this', 'will', 'be', 'achieved', 'by', 'measuring', 'the', 'distribution', 'of', 'neutral', 'hydrogen', 'gas', 'at', 'cosmological', 'distances', 'using', 'a', 'technique', 'called', 'intensity', 'mapping', 'along', 'with', 'the', 'cosmic', 'microwave', 'background', 'anisotropies', 'the', 'scale', 'of', 'bao', 'is', 'one', 'of', 'the', 'most', 'powerful', 'probes', 'of', 'cosmological', 'parameters', 'including', 'dark', 'energy', 'the', 'telescope', 'will', 'be', 'built', 'in', 'a', 'very', 'low', 'rfi', 'site', 'in', 'south', 'america', 'and', 'will', 'operate', 'in', 'the', 'frequency', 'range', 'from', '096', 'ghz', 'to', '126', 'ghz', 'the', 'telescope', 'design', 'consists', 'of', 'two', 'thicksim', '40m', 'compact', 'mirrors', 'with', 'no', 'moving', 'parts', 'such', 'a', 'design', 'will', 'give', 'the', 'excellent', 'polarization', 'performance', 'and', 'very', 'low', 'sidelobe', 'levels', 'required', 'for', 'intensity', 'mapping', 'with', 'a', 'feedhorn', 'array', 'of', '50', 'receivers', 'it', 'will', 'map', 'a', '15circ', 'declination', 'strip', 'as', 'the', 'sky', 'drifts', 'past', 'the', 'fieldofview', 'of', 'the', 'telescope', 'the', 'bingo', 'consortium', 'is', 'composed', 'universidade', 'de', 'sao', 'paulo', 'instituto', 'nacional', 'de', 'pesquisas', 'espaciais', 'brazil', 'university', 'of', 'manchester', 'and', 'university', 'college', 'london', 'united', 'kingdom', 'eth', 'zurich', 'switzerland', 'and', 'universidad', 'de', 'la', 'republica', 'uruguay', 'the', 'telescope', 'assembly', 'and', 'horn', 'design', 'and', 'fabrication', 'are', 'under', 'way', 'in', 'brazil', 'the', 'receiver', 'was', 'designed', 'in', 'uk', 'and', 'will', 'be', 'developed', 'in', 'brazil', 'with', 'most', 'of', 'the', 'components', 'for', 'the', 'receiver', 'will', 'also', 'be', 'supplied', 'by', 'brazilian', 'industry', 'the', 'experience', 'and', 'science', 'goals', 'achieved', 'by', 'the', 'bingo', 'team', 'will', 'be', 'advantageous', 'as', 'a', 'pathfinder', 'mission', 'for', 'the', 'square', 'kilometre', 'array', 'ska', 'project', 'this', 'paper', 'reports', 'the', 'current', 'status', 'of', 'the', 'bingo', 'mission', 'as', 'well', 'as', 'preliminary', 'results', 'already', 'obtained', 'for', 'the', 'instrumentation', 'development']] | [-0.10898188178818498, 0.1414483232546668, -0.05627972211442747, 0.038438710214060576, -0.11024012472656257, -0.12193962503839635, -0.017626905987008456, 0.3545163970844785, -0.1507709841006699, -0.35001879639853284, 0.16861033377013573, -0.2994655324497594, -0.0870184751422988, 0.24085442584956873, -0.04431242052957697, -0.023823873946478346, 0.07147571372817148, -0.0879831067321576, 0.012242905314976595, -0.2497034000390965, 0.21608343498675892, 0.2522079585895452, 0.3238342233072474, -0.018939797263284968, 0.1465159561493838, -0.04492226374722174, -0.06392134001988145, -0.019320685152438875, -0.09813201680240212, 0.0548571621779493, 0.36156846064555825, 0.19166176611113359, 0.26037127358997064, -0.3560495014109139, -0.11493431411876853, 0.062492868355211784, 0.06836422302953477, 0.043181633430902124, -0.014601126032055548, -0.3724464366370636, 0.002388354750648844, -0.19099676496028584, -0.1780534590251814, 0.06330434027971384, -0.03397709526437915, 0.055110639336360796, -0.19637840053479555, -0.008649264139074938, -0.08124654419623527, 0.09726083184952654, -0.056473149243250205, -0.1850738392967098, -0.007691326416492954, 0.14305109931068177, -0.06305798275290796, 0.07923105082140779, 0.12839269539481907, -0.09112905972935963, -0.06161096496858968, 0.3553395735833548, -0.1115549418565659, -0.025266722504506414, 0.12067463512462125, -0.22217074156374197, -0.17842304119664543, 0.08854854516509288, 0.1857878236932008, 0.016826401627622545, -0.16578405378342448, 0.10540648411700221, 0.04345967266664682, 0.2130492944481238, 0.14619897000298326, 0.009008488893280474, 0.28359431826579823, 0.18714158949354348, 0.10999995844264598, 0.09039327413028211, -0.23493979528792344, 0.015041092965084145, -0.2569954746631238, -0.13279148172587157, -0.15610847843301323, 0.038332545967280585, -0.020059010494096238, -0.10015681312366757, 0.37812573278019695, 0.10541107651759993, 0.07660723038562485, 0.02503579866562812, 0.3182075031312569, -0.02372703518683337, 0.0919491870034451, 0.03793118077523585, 0.2876924507539579, 0.07577805896465367, 0.21973661616585163, -0.17603067980710208, -0.006915117232656142, -0.022649838699836215] |
1,803.01645 | You Are Okay: Towards User Interfaces for Improving Well-being | Well-being is a relatively broad concept which can be succinctly described as
the state of being happy, healthy or successful. Interesting things happen when
bridging user interface design with the psychology of human well-being. This
position paper aims at providing a short on reflection the challenges and
opportunities in this context and presents concrete examples on how to tackle
these challenges and exploit the existing design opportunities.
| cs.HC | wellbeing is a relatively broad concept which can be succinctly described as the state of being happy healthy or successful interesting things happen when bridging user interface design with the psychology of human wellbeing this position paper aims at providing a short on reflection the challenges and opportunities in this context and presents concrete examples on how to tackle these challenges and exploit the existing design opportunities | [['wellbeing', 'is', 'a', 'relatively', 'broad', 'concept', 'which', 'can', 'be', 'succinctly', 'described', 'as', 'the', 'state', 'of', 'being', 'happy', 'healthy', 'or', 'successful', 'interesting', 'things', 'happen', 'when', 'bridging', 'user', 'interface', 'design', 'with', 'the', 'psychology', 'of', 'human', 'wellbeing', 'this', 'position', 'paper', 'aims', 'at', 'providing', 'a', 'short', 'on', 'reflection', 'the', 'challenges', 'and', 'opportunities', 'in', 'this', 'context', 'and', 'presents', 'concrete', 'examples', 'on', 'how', 'to', 'tackle', 'these', 'challenges', 'and', 'exploit', 'the', 'existing', 'design', 'opportunities']] | [-0.09385683258244795, 0.091702323314845, -0.04177788912610554, 0.06782630432584781, -0.18112385154131855, -0.21113503129402203, 0.04758237488741583, 0.3989500294981608, -0.28152507000060667, -0.3534057938785695, 0.10819351626386338, -0.2721037096274433, -0.2408405912921889, 0.17737005615203794, -0.15774649703082866, -0.0017068942577870034, 0.054230092232351874, 0.034461431872488846, -0.0050991086928702115, -0.23454796711900341, 0.3182691026395604, 0.06929781032142354, 0.29176859378314285, 0.12024672162621769, 0.045439468498633645, -0.013348144249740377, -0.015168520317016753, 0.016258693251536407, -0.11710651277272559, 0.20971360954164125, 0.39862656081790354, 0.2163470596936879, 0.39386395112708655, -0.43221656230292216, -0.17011903010920357, 0.04915351337238924, 0.13369055100588073, 0.07655815729252827, -0.08990671204528146, -0.33868280125420486, 0.03549328602072018, -0.18992247239255639, -0.1531289287915787, -0.07135615434059735, -0.02848957734766291, -0.015813893124238768, -0.2024634054292049, 0.0069658234576458365, 0.02631846045616514, 0.08483201646204315, -0.0008632939816244058, -0.08025822499349936, 0.06415779513320816, 0.21428486730759172, 0.08696694275600586, -0.002144522144834497, 0.11534144955256315, -0.1671970415297451, -0.14856475053716506, 0.39765964403970916, 0.0476146089816605, -0.15996894521687402, 0.24635270356075534, -0.08138491042347541, -0.12425489633330214, 0.05196090415120125, 0.21916143814407624, 0.06257174135561087, -0.1885625349417235, 0.03947780111471431, 0.01432781588675371, 0.14652421004173638, 0.04136227252684645, 0.060756001044620776, 0.284557552896996, 0.2319124283289898, 0.05772741211216841, 0.12194627268872321, 0.0008718545840524915, -0.05471141683632758, -0.28923247359804255, -0.16709155486479624, -0.11936642107234072, 0.033331239915717, -0.012849207376103863, -0.09358823738658606, 0.44528659449806857, 0.1779542959455067, 0.1575516936605546, 0.04285665095693418, 0.337604218565706, 0.039933799159601886, 0.04507770886950528, 0.03813051915407848, 0.16829706344809106, -0.0040059041704482105, 0.19379262560839527, -0.14774484281886868, 0.13662197802271417, -0.037893815671524674] |
1,803.01646 | Subradiance and radiation trapping in cold atoms | We experimentally and numerically study the temporal dynamics of light
scattered by large clouds of cold atoms after the exciting laser is switched
off in the low intensity (linear optics) regime. Radiation trapping due to
multiple scattering as well as subradiance lead to decay much slower than the
single atom fluorescence decay. These two effects have already been observed
separately, but the interplay between them remained to be understood. Here, we
show that with well chosen parameters of the driving field, the two effects can
occur at the same time, but follow different scaling behaviors. The subradiant
decay is observed at late time and its rate is independent of the detuning,
while the radiation trapping decay is observed at intermediate time and depends
on the detuning through the optical depth of the sample. Numerical simulations
based on random walk process and coupled-dipole equations support our
interpretations. Our study clarifies the different interpretations and physical
mechanisms at the origin of slow temporal dynamics of light in cold atoms.
| physics.atom-ph | we experimentally and numerically study the temporal dynamics of light scattered by large clouds of cold atoms after the exciting laser is switched off in the low intensity linear optics regime radiation trapping due to multiple scattering as well as subradiance lead to decay much slower than the single atom fluorescence decay these two effects have already been observed separately but the interplay between them remained to be understood here we show that with well chosen parameters of the driving field the two effects can occur at the same time but follow different scaling behaviors the subradiant decay is observed at late time and its rate is independent of the detuning while the radiation trapping decay is observed at intermediate time and depends on the detuning through the optical depth of the sample numerical simulations based on random walk process and coupleddipole equations support our interpretations our study clarifies the different interpretations and physical mechanisms at the origin of slow temporal dynamics of light in cold atoms | [['we', 'experimentally', 'and', 'numerically', 'study', 'the', 'temporal', 'dynamics', 'of', 'light', 'scattered', 'by', 'large', 'clouds', 'of', 'cold', 'atoms', 'after', 'the', 'exciting', 'laser', 'is', 'switched', 'off', 'in', 'the', 'low', 'intensity', 'linear', 'optics', 'regime', 'radiation', 'trapping', 'due', 'to', 'multiple', 'scattering', 'as', 'well', 'as', 'subradiance', 'lead', 'to', 'decay', 'much', 'slower', 'than', 'the', 'single', 'atom', 'fluorescence', 'decay', 'these', 'two', 'effects', 'have', 'already', 'been', 'observed', 'separately', 'but', 'the', 'interplay', 'between', 'them', 'remained', 'to', 'be', 'understood', 'here', 'we', 'show', 'that', 'with', 'well', 'chosen', 'parameters', 'of', 'the', 'driving', 'field', 'the', 'two', 'effects', 'can', 'occur', 'at', 'the', 'same', 'time', 'but', 'follow', 'different', 'scaling', 'behaviors', 'the', 'subradiant', 'decay', 'is', 'observed', 'at', 'late', 'time', 'and', 'its', 'rate', 'is', 'independent', 'of', 'the', 'detuning', 'while', 'the', 'radiation', 'trapping', 'decay', 'is', 'observed', 'at', 'intermediate', 'time', 'and', 'depends', 'on', 'the', 'detuning', 'through', 'the', 'optical', 'depth', 'of', 'the', 'sample', 'numerical', 'simulations', 'based', 'on', 'random', 'walk', 'process', 'and', 'coupleddipole', 'equations', 'support', 'our', 'interpretations', 'our', 'study', 'clarifies', 'the', 'different', 'interpretations', 'and', 'physical', 'mechanisms', 'at', 'the', 'origin', 'of', 'slow', 'temporal', 'dynamics', 'of', 'light', 'in', 'cold', 'atoms']] | [-0.09507913604479082, 0.23553328797734246, -0.09455123738926685, 0.07355277226514102, -0.011088732620255051, -0.15971292778682297, 0.03894356512994377, 0.4189652540681962, -0.2879463325137507, -0.2885469675822529, 0.061853453529507905, -0.26425557939369165, -0.08228722378516759, 0.2053327131099737, 0.03933416219695867, 0.041362420605247405, 0.01467180749942398, -0.021185328453377693, -0.0060043170752594925, -0.21398759181443935, 0.2838148751211057, 0.09353125288045246, 0.280426000569763, 0.06524834354145977, 0.08942315716039903, -0.016315902775700043, -0.0072055144478081765, -0.04128152875419327, -0.0882414005250021, 0.010382911625379574, 0.17708119909867398, 0.0665607551653196, 0.2461738832166675, -0.48087471039263596, -0.22196593546882987, 0.0973836036293048, 0.18552427203255054, 0.1455168738350562, -0.05092931129066218, -0.2776110954080781, -0.018977312418537402, -0.07101147523161001, -0.1392570154010848, -0.029922007658368277, 0.049376491665656115, 0.04317688176228559, -0.22404585173144423, 0.06872263279169084, 0.021506860605468917, 0.05774308896684897, -0.05441344603910083, -0.0688209477756284, -0.0035008517885859497, 0.10229887100895811, 0.07455435981761391, -0.015808369565621285, 0.18116434682216384, -0.10741566390657943, -0.09428700011134326, 0.3714709002691918, -0.09156884442539788, -0.1077059312238397, 0.2377459985625088, -0.21959443044887778, -0.06759110892687863, 0.1703469141534234, 0.1738358738213153, 0.11444594772131055, -0.10406537138171003, 0.030272907536152003, 0.001233966142764527, 0.16856852623990953, 0.104182960533866, 0.13029790224652446, 0.2239917727538613, 0.1860206108428761, -0.03085927175452743, 0.1354293095967091, -0.10811184699285335, -0.12754701135378932, -0.2625468480543646, -0.07325892982109378, -0.17106980131660215, 0.048428361078244664, -0.08214721373032463, -0.10047248391640891, 0.3861599787456279, 0.13963608232098157, 0.21958021802861177, 0.01709692321388709, 0.32759790923892557, 0.16415751264793074, 0.054688079820800865, 0.038910298202532584, 0.31383836970101303, 0.11743912410442746, 0.10403797795722808, -0.3189442204722778, 0.09126459011071902, -0.02296376616337119] |
1,803.01647 | Characterization of the second- and third-harmonic optical
susceptibilities of atomically thin tungsten diselenide | We report the first detailed characterization of the sheet third-harmonic
optical susceptibility, $\chi_{s}^{(3)}$, of tungsten diselenide (WSe$_{2}$).
With a home-built confocal microscope setup developed to study harmonics
generation, we map the second- and third-harmonic intensities as a function of
position in the sample, pump power and polarization angle, for single and few
layers flakes of WSe$_{2}$. We register a value of $|\chi_{s}^{(3)}| \approx$
0.91 $\times$ 10$^{-28}$ m$^{3}$ V$^{-2}$ at a fundamental excitation frequency
of $\hbar\omega$ = 0.8 eV, which is comparable in magnitude to the
third-harmonic susceptibility of other group-VI transition metal
dichalcogenides. The simultaneously recorded second-harmonic susceptibility is
found to be $|\chi_{s}^{(2)}| \approx$ 0.70 $\times$ 10$^{-19}$ m$^{2}$
V$^{-1}$ in very good agreement on the order of magnitude with recent reports
for WSe$_{2}$, which asserts the robustness of our values for
$|\chi_{s}^{(3)}|$.
| physics.optics cond-mat.mtrl-sci | we report the first detailed characterization of the sheet thirdharmonic optical susceptibility chi_s3 of tungsten diselenide wse_2 with a homebuilt confocal microscope setup developed to study harmonics generation we map the second and thirdharmonic intensities as a function of position in the sample pump power and polarization angle for single and few layers flakes of wse_2 we register a value of chi_s3 approx 091 times 1028 m3 v2 at a fundamental excitation frequency of hbaromega 08 ev which is comparable in magnitude to the thirdharmonic susceptibility of other groupvi transition metal dichalcogenides the simultaneously recorded secondharmonic susceptibility is found to be chi_s2 approx 070 times 1019 m2 v1 in very good agreement on the order of magnitude with recent reports for wse_2 which asserts the robustness of our values for chi_s3 | [['we', 'report', 'the', 'first', 'detailed', 'characterization', 'of', 'the', 'sheet', 'thirdharmonic', 'optical', 'susceptibility', 'chi_s3', 'of', 'tungsten', 'diselenide', 'wse_2', 'with', 'a', 'homebuilt', 'confocal', 'microscope', 'setup', 'developed', 'to', 'study', 'harmonics', 'generation', 'we', 'map', 'the', 'second', 'and', 'thirdharmonic', 'intensities', 'as', 'a', 'function', 'of', 'position', 'in', 'the', 'sample', 'pump', 'power', 'and', 'polarization', 'angle', 'for', 'single', 'and', 'few', 'layers', 'flakes', 'of', 'wse_2', 'we', 'register', 'a', 'value', 'of', 'chi_s3', 'approx', '091', 'times', '1028', 'm3', 'v2', 'at', 'a', 'fundamental', 'excitation', 'frequency', 'of', 'hbaromega', '08', 'ev', 'which', 'is', 'comparable', 'in', 'magnitude', 'to', 'the', 'thirdharmonic', 'susceptibility', 'of', 'other', 'groupvi', 'transition', 'metal', 'dichalcogenides', 'the', 'simultaneously', 'recorded', 'secondharmonic', 'susceptibility', 'is', 'found', 'to', 'be', 'chi_s2', 'approx', '070', 'times', '1019', 'm2', 'v1', 'in', 'very', 'good', 'agreement', 'on', 'the', 'order', 'of', 'magnitude', 'with', 'recent', 'reports', 'for', 'wse_2', 'which', 'asserts', 'the', 'robustness', 'of', 'our', 'values', 'for', 'chi_s3']] | [-0.12904177648406334, 0.1480891131369383, 0.030959218580503274, -0.0535810591976464, 0.024527380619738394, -0.12744143012136164, 0.06915469461241523, 0.4488065144303077, -0.1707577874727604, -0.32884707307542554, 0.017172466761802275, -0.3718141524675693, -0.08074256229633821, 0.24477118110454832, 0.01875721256938258, 0.05218393026723594, -0.010602766973186881, -0.04297917977487313, -0.06347633900391009, -0.15140260137859304, 0.18653890904650547, 0.05069792917254203, 0.3393018324041867, 0.08366972821558477, 0.09110068584941612, -0.03088994055652266, 0.10063180812982885, -0.053016127727015784, -0.1616785151667125, 0.074546194261203, 0.22741213387575085, -0.0815932905436529, 0.20515879798140235, -0.37466397489755876, -0.14785452508047678, 0.016496729004402994, 0.08418225682383218, 0.06873839960490417, -0.06022379257563388, -0.24722918547789446, 0.0688099710924821, -0.13125061125402118, -0.09163960538633907, -0.04668933887901993, 0.033197533396136666, -0.0051463720964566445, -0.3085737129040631, 0.1383365568196586, -0.001969038770100429, 0.0887046801264021, -0.05789324605858792, -0.151950434547003, -0.06545558445447103, 0.04287041759274843, 0.017430186566704784, 0.10873115642301966, 0.1704926795023138, -0.12327492399717048, -0.09236654607963016, 0.3778661132384916, -0.12082709473973666, -0.015169250167451288, 0.0888040002954427, -0.2711794528157543, -0.054285727236028904, 0.16000481468859976, 0.11874828432181864, 0.16549536980375762, -0.09338006836394175, -0.037690902691785926, -0.0031164234401018336, 0.27955519748524627, 0.13470300095767238, 0.08258772550726386, 0.1996979737967139, 0.19204284475391148, 0.025147846953246657, 0.11789581036410217, -0.1589590313236535, 0.04936435353366359, -0.2269978395926247, -0.16138144477114139, -0.18010166838395458, 0.12666750987920597, -0.11017147672084028, -0.12260429758422134, 0.4418935392777087, 0.13701249732287557, 0.20860700194816326, -0.0018430640761036682, 0.29204542156778107, 0.1360090676275658, 0.08145179014425469, -0.038066296290805324, 0.30573563985544333, 0.16801532609779246, 0.13519958789524344, -0.20855721988637918, 0.009279266889349252, 0.02724811532321379] |
1,803.01648 | A Genetic Programming Framework for 2D Platform AI | There currently exists a wide range of techniques to model and evolve
artificial players for games. Existing techniques range from black box neural
networks to entirely hand-designed solutions. In this paper, we demonstrate the
feasibility of a genetic programming framework using human controller input to
derive meaningful artificial players which can, later on, be optimised by hand.
The current state of the art in game character design relies heavily on human
designers to manually create and edit scripts and rules for game characters. To
address this manual editing bottleneck, current computational intelligence
techniques approach the issue with fully autonomous character generators,
replacing most of the design process using black box solutions such as neural
networks or the like. Our GP approach to this problem creates character
controllers which can be further authored and developed by a designer it also
offers designers to included their play style without the need to use a
programming language. This keeps the designer in the loop while reducing
repetitive manual labour. Our system also provides insights into how players
express themselves in games and into deriving appropriate models for
representing those insights. We present our framework, supporting findings and
open challenges.
| cs.AI | there currently exists a wide range of techniques to model and evolve artificial players for games existing techniques range from black box neural networks to entirely handdesigned solutions in this paper we demonstrate the feasibility of a genetic programming framework using human controller input to derive meaningful artificial players which can later on be optimised by hand the current state of the art in game character design relies heavily on human designers to manually create and edit scripts and rules for game characters to address this manual editing bottleneck current computational intelligence techniques approach the issue with fully autonomous character generators replacing most of the design process using black box solutions such as neural networks or the like our gp approach to this problem creates character controllers which can be further authored and developed by a designer it also offers designers to included their play style without the need to use a programming language this keeps the designer in the loop while reducing repetitive manual labour our system also provides insights into how players express themselves in games and into deriving appropriate models for representing those insights we present our framework supporting findings and open challenges | [['there', 'currently', 'exists', 'a', 'wide', 'range', 'of', 'techniques', 'to', 'model', 'and', 'evolve', 'artificial', 'players', 'for', 'games', 'existing', 'techniques', 'range', 'from', 'black', 'box', 'neural', 'networks', 'to', 'entirely', 'handdesigned', 'solutions', 'in', 'this', 'paper', 'we', 'demonstrate', 'the', 'feasibility', 'of', 'a', 'genetic', 'programming', 'framework', 'using', 'human', 'controller', 'input', 'to', 'derive', 'meaningful', 'artificial', 'players', 'which', 'can', 'later', 'on', 'be', 'optimised', 'by', 'hand', 'the', 'current', 'state', 'of', 'the', 'art', 'in', 'game', 'character', 'design', 'relies', 'heavily', 'on', 'human', 'designers', 'to', 'manually', 'create', 'and', 'edit', 'scripts', 'and', 'rules', 'for', 'game', 'characters', 'to', 'address', 'this', 'manual', 'editing', 'bottleneck', 'current', 'computational', 'intelligence', 'techniques', 'approach', 'the', 'issue', 'with', 'fully', 'autonomous', 'character', 'generators', 'replacing', 'most', 'of', 'the', 'design', 'process', 'using', 'black', 'box', 'solutions', 'such', 'as', 'neural', 'networks', 'or', 'the', 'like', 'our', 'gp', 'approach', 'to', 'this', 'problem', 'creates', 'character', 'controllers', 'which', 'can', 'be', 'further', 'authored', 'and', 'developed', 'by', 'a', 'designer', 'it', 'also', 'offers', 'designers', 'to', 'included', 'their', 'play', 'style', 'without', 'the', 'need', 'to', 'use', 'a', 'programming', 'language', 'this', 'keeps', 'the', 'designer', 'in', 'the', 'loop', 'while', 'reducing', 'repetitive', 'manual', 'labour', 'our', 'system', 'also', 'provides', 'insights', 'into', 'how', 'players', 'express', 'themselves', 'in', 'games', 'and', 'into', 'deriving', 'appropriate', 'models', 'for', 'representing', 'those', 'insights', 'we', 'present', 'our', 'framework', 'supporting', 'findings', 'and', 'open', 'challenges']] | [-0.05913292813323894, 0.011873060178319919, -0.09092611921190911, 0.07782697295257948, -0.16368608029882367, -0.20358581799652656, 0.09750836370073315, 0.4001036728447189, -0.27806212923344586, -0.37181778545776495, 0.09239610488412484, -0.2398689890479935, -0.19877719050106993, 0.20747023593867198, -0.12867151517468522, 0.06664830164767668, 0.11026160913158436, -0.014410157451567677, 0.02813523529781675, -0.264451803011126, 0.3186057977264329, 0.028326771072378115, 0.2768557743307165, 0.02047542048314092, 0.09363601327640936, -0.004711946305030083, -0.017402828191121926, 0.007249477987025617, -0.08688012219143423, 0.17459873455559968, 0.33445074485593884, 0.2359056801093286, 0.3535327246384125, -0.48702284821062064, -0.18843274101453397, 0.07729048109542085, 0.15395558220619449, 0.14468994443257321, -0.03922570352228739, -0.3209309419617057, 0.08769527138020768, -0.18707657003851266, -0.05032283863603917, -0.12835344340181815, -0.01895326784929517, -0.026929502747834146, -0.2617215397144069, -0.05888260197522813, 0.08022029207762787, 0.06395845931755113, -0.05157910947740192, -0.12033705736156458, 0.02854635027042419, 0.206511003736226, 0.009467308050020341, 0.0490798668868184, 0.161860487385824, -0.1684587653809493, -0.18821817857203815, 0.36705802358230766, 0.006050667529498056, -0.23771435255659934, 0.20197307835487477, -0.01841143702099822, -0.12219461710168505, 0.06392311369192463, 0.20440381478366196, 0.08845744972777723, -0.17853905135594614, 0.05361530002579568, 0.015617506112309401, 0.21232327292566378, 0.04345838514356209, 0.0015591836097289104, 0.22657422662821922, 0.21846363995680396, 0.039748425566061514, 0.1441636954099225, 0.025108170612449094, -0.13060935159042783, -0.2105647941067701, -0.11361449526394812, -0.12286971382112527, 0.008819691759768199, -0.06473322213364276, -0.17659435683519256, 0.3821368559064077, 0.2286668604783885, 0.12043747551069828, 0.08408074007887507, 0.33949850926505953, 0.061457070687130015, 0.11457922284572138, 0.07403541778271296, 0.1664107693020701, -0.0032184283291844993, 0.16420957659150245, -0.19358828991808338, 0.08963340030607711, 0.06188886002557262] |
1,803.01649 | Genus one Lefschetz fibrations on disk cotangent bundles of surfaces | We describe a Lefschetz fibration of genus one on the disk cotangent bundle
of any closed orientable surface S. As a corollary, we obtain an explicit genus
one open book decomposition adapted to the canonical contact structure on the
unit cotangent bundle of S.
| math.GT math.SG | we describe a lefschetz fibration of genus one on the disk cotangent bundle of any closed orientable surface s as a corollary we obtain an explicit genus one open book decomposition adapted to the canonical contact structure on the unit cotangent bundle of s | [['we', 'describe', 'a', 'lefschetz', 'fibration', 'of', 'genus', 'one', 'on', 'the', 'disk', 'cotangent', 'bundle', 'of', 'any', 'closed', 'orientable', 'surface', 's', 'as', 'a', 'corollary', 'we', 'obtain', 'an', 'explicit', 'genus', 'one', 'open', 'book', 'decomposition', 'adapted', 'to', 'the', 'canonical', 'contact', 'structure', 'on', 'the', 'unit', 'cotangent', 'bundle', 'of', 's']] | [-0.2621345138600604, -0.021451566333615283, -0.09384689201727849, 0.10095199557359923, -0.17112932390194724, -0.19255417346192355, 0.016434139995412392, 0.3328109925443476, -0.309512218079445, -0.2030902895229784, 0.057628955162892286, -0.2316074484472417, -0.12883540334984322, 0.20301137574609707, -0.1862861329096962, -0.030076768164607613, 0.10488063922490586, 0.12106429271675138, -0.1309631937421562, -0.2713009149513461, 0.45243395399302244, -0.07376899108798667, 0.15227763653224843, 0.13112356113693255, 0.17651306800921288, 0.00044766160532493484, 0.05923462218858979, -0.043593494994142515, -0.22629980941895733, 0.12569569646042178, 0.2686548160643063, 0.009857621615413915, 0.08853059575829486, -0.46200701187957416, -0.1787343361118639, 0.15647987547245892, 0.09203488887711005, -0.08289684943685477, 0.08559288376074453, -0.1870337554613467, 0.015919804895516296, -0.12429049208929593, -0.24220663334496997, -0.06847691665064883, 0.06801211895336481, -0.06213470988123762, -0.1084006350363118, -0.12424556779759852, 0.13157122569497337, 0.14045317191630602, -0.0608459723351354, -0.09709259071810679, -0.15936333188702437, 0.07650157561610368, -0.020573424048383127, 0.17898030520882457, 0.16011129497465762, -0.03928820132701234, -0.1083975595168092, 0.335438090080226, -0.1572084230243821, -0.284778037362478, 0.03504582699811594, -0.11166250054851513, -0.20096271921118553, 0.1851485992189158, 0.10760299169289117, 0.20530106183353133, 0.017891245448316277, 0.21034841366450896, -0.1616084888916124, 0.0730010231253056, 0.12474371822529727, -0.11040629676691341, 0.1645252167416567, 0.1483683851230043, 0.11936514551581984, 0.13696808439933442, -0.056351057603023946, -0.039707694964652714, -0.38987883942371065, -0.3279720552011647, -0.11105142099338329, 0.324116221081402, -0.13127111746209927, -0.2362723407674242, 0.42697254263541917, -0.05994975118135864, 0.25719490994445304, 0.12682881383013658, 0.29797225587323983, 0.012170109437482262, 0.06325300207192247, 0.08569464625113389, 0.06737916036085649, 0.2603883996436542, -0.06234089746563272, -0.10209330882538449, -0.0696395334300839, 0.2761196395890279] |
1,803.0165 | Off-Diagonal Observable Elements from Random Matrix Theory:
Distributions, Fluctuations, and Eigenstate Thermalization | We derive the Eigenstate Thermalization Hypothesis (ETH) from a random matrix
Hamiltonian by extending the model introduced by J. M. Deutsch [Phys. Rev. A
43, 2046 (1991)]. We approximate the coupling between a subsystem and a
many-body environment by means of a random Gaussian matrix. We show that a
common assumption in the analysis of quantum chaotic systems, namely the
treatment of eigenstates as independent random vectors, leads to inconsistent
results. However, a consistent approach to the ETH can be developed by
introducing an interaction between random wave-functions that arises as a
result of the orthonormality condition. This approach leads to a consistent
form for off-diagonal matrix elements of observables. From there we obtain the
scaling of time-averaged fluctuations with system size for which we calculate
an analytic form in terms of the Inverse Participation Ratio. The analytic
results are compared to exact diagonalizations of a quantum spin chain for
different physical observables in multiple parameter regimes.
| cond-mat.stat-mech quant-ph | we derive the eigenstate thermalization hypothesis eth from a random matrix hamiltonian by extending the model introduced by j m deutsch phys rev a 43 2046 1991 we approximate the coupling between a subsystem and a manybody environment by means of a random gaussian matrix we show that a common assumption in the analysis of quantum chaotic systems namely the treatment of eigenstates as independent random vectors leads to inconsistent results however a consistent approach to the eth can be developed by introducing an interaction between random wavefunctions that arises as a result of the orthonormality condition this approach leads to a consistent form for offdiagonal matrix elements of observables from there we obtain the scaling of timeaveraged fluctuations with system size for which we calculate an analytic form in terms of the inverse participation ratio the analytic results are compared to exact diagonalizations of a quantum spin chain for different physical observables in multiple parameter regimes | [['we', 'derive', 'the', 'eigenstate', 'thermalization', 'hypothesis', 'eth', 'from', 'a', 'random', 'matrix', 'hamiltonian', 'by', 'extending', 'the', 'model', 'introduced', 'by', 'j', 'm', 'deutsch', 'phys', 'rev', 'a', '43', '2046', '1991', 'we', 'approximate', 'the', 'coupling', 'between', 'a', 'subsystem', 'and', 'a', 'manybody', 'environment', 'by', 'means', 'of', 'a', 'random', 'gaussian', 'matrix', 'we', 'show', 'that', 'a', 'common', 'assumption', 'in', 'the', 'analysis', 'of', 'quantum', 'chaotic', 'systems', 'namely', 'the', 'treatment', 'of', 'eigenstates', 'as', 'independent', 'random', 'vectors', 'leads', 'to', 'inconsistent', 'results', 'however', 'a', 'consistent', 'approach', 'to', 'the', 'eth', 'can', 'be', 'developed', 'by', 'introducing', 'an', 'interaction', 'between', 'random', 'wavefunctions', 'that', 'arises', 'as', 'a', 'result', 'of', 'the', 'orthonormality', 'condition', 'this', 'approach', 'leads', 'to', 'a', 'consistent', 'form', 'for', 'offdiagonal', 'matrix', 'elements', 'of', 'observables', 'from', 'there', 'we', 'obtain', 'the', 'scaling', 'of', 'timeaveraged', 'fluctuations', 'with', 'system', 'size', 'for', 'which', 'we', 'calculate', 'an', 'analytic', 'form', 'in', 'terms', 'of', 'the', 'inverse', 'participation', 'ratio', 'the', 'analytic', 'results', 'are', 'compared', 'to', 'exact', 'diagonalizations', 'of', 'a', 'quantum', 'spin', 'chain', 'for', 'different', 'physical', 'observables', 'in', 'multiple', 'parameter', 'regimes']] | [-0.13830988515397552, 0.15620792414685325, -0.09738869038499465, 0.05044590768101773, 0.012924990118451558, -0.13413719525360532, 0.06757828683420351, 0.305112913328039, -0.21291415018450682, -0.26474396922999316, 0.042192465564158926, -0.2593198964004494, -0.15551331377985655, 0.17477507384013455, -0.0068176820292879066, 0.08023793078294605, 0.06539170510746586, -0.0007332454681704948, -0.11221430625597453, -0.18055211513000688, 0.2963241430586738, 0.05664089554772493, 0.25113931902076986, 0.026166726695670255, 0.08936466509624603, 0.054751199552979156, 0.005817068005158643, 0.02004186360011245, -0.11476192890659381, 0.08945635508799296, 0.2078264252706075, 0.1056017409701914, 0.2519655108724715, -0.4064211455695806, -0.18581173170927415, 0.09101409968700569, 0.12238603374464022, 0.13858552592595932, 0.011873495515886765, -0.31048353299480763, 0.04963951831487761, -0.20917241988335825, -0.1547846124940522, -0.09445074691947336, 0.03034426751220302, -0.014658619942600322, -0.35392201074345664, 0.1280081036328605, 0.07864475120778439, 0.04065406159349498, -0.03378422208023584, -0.09206263338894861, 0.042676461392281, 0.08205489354552167, 0.03383772026830513, 0.007401447310142076, 0.10586312172970005, -0.07392970392937256, -0.1199130534734221, 0.3528830692302554, -0.0838348473641713, -0.21465721715739958, 0.1884425285533308, -0.09697548514765919, -0.11795477638210936, 0.09043728772296487, 0.12671721141761655, 0.07424993967862835, -0.18013469778167404, 0.12699886065556307, -0.08885228949462533, 0.152361613514412, 0.02472954964455051, 0.02875153876390237, 0.17688708378085097, 0.0781191982844975, 0.03885243529643698, 0.14755406383362712, -0.027628471603273017, -0.15502033233464618, -0.3026367359773173, -0.13575333852400992, -0.2565293891383572, 0.12296303776671197, -0.10767245258471207, -0.1733987144591987, 0.3890533042080985, 0.17224981362696953, 0.25300787561102234, 0.06758086297847923, 0.21631021754501778, 0.16700774947756747, 0.015935859438269192, 0.09130017374268477, 0.21152323288665076, 0.19661961286477034, 0.04499432368939565, -0.24306137446361553, 0.045396277538625296, 0.10177584104892459] |
1,803.01651 | A balance index for phylogenetic trees based on rooted quartets | We define a new balance index for rooted phylogenetic trees based on the
symmetry of the evolutive history of every set of 4 leaves. This index makes
sense for multifurcating trees and it can be computed in time linear in the
number of leaves. We determine its maximum and minimum values for arbitrary and
bifurcating trees, and we provide exact formulas for its expected value and
variance on bifurcating trees under Ford's $\alpha$-model and Aldous'
$\beta$-model and on arbitrary trees under the $\alpha$-$\gamma$-model.
| q-bio.PE | we define a new balance index for rooted phylogenetic trees based on the symmetry of the evolutive history of every set of 4 leaves this index makes sense for multifurcating trees and it can be computed in time linear in the number of leaves we determine its maximum and minimum values for arbitrary and bifurcating trees and we provide exact formulas for its expected value and variance on bifurcating trees under fords alphamodel and aldous betamodel and on arbitrary trees under the alphagammamodel | [['we', 'define', 'a', 'new', 'balance', 'index', 'for', 'rooted', 'phylogenetic', 'trees', 'based', 'on', 'the', 'symmetry', 'of', 'the', 'evolutive', 'history', 'of', 'every', 'set', 'of', '4', 'leaves', 'this', 'index', 'makes', 'sense', 'for', 'multifurcating', 'trees', 'and', 'it', 'can', 'be', 'computed', 'in', 'time', 'linear', 'in', 'the', 'number', 'of', 'leaves', 'we', 'determine', 'its', 'maximum', 'and', 'minimum', 'values', 'for', 'arbitrary', 'and', 'bifurcating', 'trees', 'and', 'we', 'provide', 'exact', 'formulas', 'for', 'its', 'expected', 'value', 'and', 'variance', 'on', 'bifurcating', 'trees', 'under', 'fords', 'alphamodel', 'and', 'aldous', 'betamodel', 'and', 'on', 'arbitrary', 'trees', 'under', 'the', 'alphagammamodel']] | [-0.12256868051207927, 0.1398189318400011, -0.083787251578038, 0.10054858273360878, -0.08963080280157457, -0.10686904641362019, 0.1222475024588204, 0.35384182309653295, -0.26152005462896033, -0.29772514531231786, 0.13879267523659208, -0.25970124278262435, -0.13146158899755656, 0.17848498109694436, -0.07182376791848605, 0.05637323457192972, 0.0639242857963924, 0.09151071476846855, -0.006614982262702592, -0.23214680717203273, 0.3135623987988535, 0.06613328620926084, 0.2280416326493541, 0.0241976701359949, 0.17131544839231724, 0.07339416361829064, -0.05022756620071806, 0.06538119756459561, -0.215575080207852, 0.07934983157979167, 0.21689326192689948, 0.19320482729810728, 0.1653638022940561, -0.3696050556549797, -0.16070815267781896, 0.1856742898810161, 0.09886976120943002, 0.10841935648897057, 0.027729736098245413, -0.18205617732895785, 0.13307243107021394, -0.12591241722286914, -0.12681364844250212, -0.019061980499740106, 0.0854316306221916, 0.016075166705322552, -0.2745709389852113, 0.0648175657008696, 0.07869405622582838, 0.047905689284923565, -0.055306514918647076, -0.17303379023649607, -0.0843242323559047, 0.12810296859558537, -0.012264095718063504, -0.012190461809556168, 0.045081702777021844, -0.07445591551683708, -0.15245460815508907, 0.3149830881977476, -0.05755373611709619, -0.21107440719841025, 0.16795045577539466, -0.10634171121181493, -0.19240697141994823, 0.059129152166466394, 0.16553308704800634, 0.13519650933905, -0.09865260630262544, 0.11866467415301847, -0.05139679524553827, 0.11967128723213191, 0.1639354922752603, -0.06310141503429377, 0.1870635844520237, 0.12490023712414396, 0.14287867262420884, 0.17448148949223244, -0.05681748208253229, -0.07342162492954318, -0.23402306818998003, -0.1307022825924186, -0.13539537251646439, 0.03882280862273042, -0.22688968561983144, -0.25680000931922214, 0.375042476935357, 0.14431798566379642, 0.22355256912982965, 0.21293787962297, 0.1950203814145447, 0.133898950371427, -0.007959273329610566, 0.13253368502931603, 0.12439779600083649, 0.19204822882830377, -0.0008702198918684419, -0.1523057532521997, 0.14949987775993995, 0.12286363064636846] |
1,803.01652 | An Offline-Sampling SMPC Framework with Application to Automated Space
Maneuvers | In this paper, a sampling-based Stochastic Model Predictive Control algorithm
is proposed for discrete-time linear systems subject to both parametric
uncertainties and additive disturbances. One of the main drivers for the
development of the proposed control strategy is the need of real-time
implementability of guidance and control strategies for automated rendezvous
and proximity operations between spacecraft. The paper presents considers the
validation of the proposed control algorithm on an experimental testbed,
showing how it may indeed be implemented in a realistic framework. Parametric
uncertainties due to the mass variations during operations, linearization
errors, and disturbances due to external space environment are simultaneously
considered.
The approach enables to suitably tighten the constraints to guarantee robust
recursive feasibility when bounds on the uncertain variables are provided, and
under mild assumptions, asymptotic stability in probability of the origin can
be established. The offline sampling approach in the control design phase is
shown to reduce the computational cost, which usually constitutes the main
limit for the adoption of Stochastic Model Predictive Control schemes,
especially for low-cost on-board hardware. These characteristics are
demonstrated both through simulations and by means of experimental results.
| cs.SY math.OC | in this paper a samplingbased stochastic model predictive control algorithm is proposed for discretetime linear systems subject to both parametric uncertainties and additive disturbances one of the main drivers for the development of the proposed control strategy is the need of realtime implementability of guidance and control strategies for automated rendezvous and proximity operations between spacecraft the paper presents considers the validation of the proposed control algorithm on an experimental testbed showing how it may indeed be implemented in a realistic framework parametric uncertainties due to the mass variations during operations linearization errors and disturbances due to external space environment are simultaneously considered the approach enables to suitably tighten the constraints to guarantee robust recursive feasibility when bounds on the uncertain variables are provided and under mild assumptions asymptotic stability in probability of the origin can be established the offline sampling approach in the control design phase is shown to reduce the computational cost which usually constitutes the main limit for the adoption of stochastic model predictive control schemes especially for lowcost onboard hardware these characteristics are demonstrated both through simulations and by means of experimental results | [['in', 'this', 'paper', 'a', 'samplingbased', 'stochastic', 'model', 'predictive', 'control', 'algorithm', 'is', 'proposed', 'for', 'discretetime', 'linear', 'systems', 'subject', 'to', 'both', 'parametric', 'uncertainties', 'and', 'additive', 'disturbances', 'one', 'of', 'the', 'main', 'drivers', 'for', 'the', 'development', 'of', 'the', 'proposed', 'control', 'strategy', 'is', 'the', 'need', 'of', 'realtime', 'implementability', 'of', 'guidance', 'and', 'control', 'strategies', 'for', 'automated', 'rendezvous', 'and', 'proximity', 'operations', 'between', 'spacecraft', 'the', 'paper', 'presents', 'considers', 'the', 'validation', 'of', 'the', 'proposed', 'control', 'algorithm', 'on', 'an', 'experimental', 'testbed', 'showing', 'how', 'it', 'may', 'indeed', 'be', 'implemented', 'in', 'a', 'realistic', 'framework', 'parametric', 'uncertainties', 'due', 'to', 'the', 'mass', 'variations', 'during', 'operations', 'linearization', 'errors', 'and', 'disturbances', 'due', 'to', 'external', 'space', 'environment', 'are', 'simultaneously', 'considered', 'the', 'approach', 'enables', 'to', 'suitably', 'tighten', 'the', 'constraints', 'to', 'guarantee', 'robust', 'recursive', 'feasibility', 'when', 'bounds', 'on', 'the', 'uncertain', 'variables', 'are', 'provided', 'and', 'under', 'mild', 'assumptions', 'asymptotic', 'stability', 'in', 'probability', 'of', 'the', 'origin', 'can', 'be', 'established', 'the', 'offline', 'sampling', 'approach', 'in', 'the', 'control', 'design', 'phase', 'is', 'shown', 'to', 'reduce', 'the', 'computational', 'cost', 'which', 'usually', 'constitutes', 'the', 'main', 'limit', 'for', 'the', 'adoption', 'of', 'stochastic', 'model', 'predictive', 'control', 'schemes', 'especially', 'for', 'lowcost', 'onboard', 'hardware', 'these', 'characteristics', 'are', 'demonstrated', 'both', 'through', 'simulations', 'and', 'by', 'means', 'of', 'experimental', 'results']] | [-0.13239211943090823, 0.036975706768807966, -0.0774559088183298, 0.053271258781043246, -0.07498457696149374, -0.1391721549717819, 0.07419767475096797, 0.39530293790892485, -0.27264805546996584, -0.3486585909859302, 0.1567889437943829, -0.17790475880159415, -0.17420578493492647, 0.2598330393299102, -0.1567167249149618, 0.15321345023442318, 0.07757337787748878, -0.025819369405010006, -0.028388939938417082, -0.25382803874165016, 0.25933124351422276, 0.08883614126682521, 0.30401036834573364, 0.0027826710857505746, 0.12147538335296638, 0.005453098511801445, -0.041200002314234006, 0.0016321199069877857, -0.08112705021257448, 0.11498765017616906, 0.26209626226302457, 0.1475457364947281, 0.33008700015053233, -0.43979993525314776, -0.20568314931021733, 0.09858482979103564, 0.10868433415908416, 0.08822488094204389, -0.04424894566866843, -0.30381970539848435, 0.08546397114486338, -0.1665716928524528, -0.10933204457667448, -0.11276879883869327, -0.03789665987266895, 0.04073570787727355, -0.34928749631193867, 0.004932140831880391, 0.04919432191350024, 0.024244882007014943, -0.07585479081035616, -0.07367226821594539, 0.005112572792260086, 0.13390683667391245, 0.04264160118658434, -0.021054071281478806, 0.1505297579476361, -0.0947995785671102, -0.14253032054094708, 0.3788413525687252, -0.0035327581731094556, -0.2262942809580432, 0.16880041258322465, -0.06463256243984887, -0.1355607314545781, 0.12095782679211807, 0.22800850605014414, 0.07613430772335293, -0.20639096906965532, 0.0802761931750515, 0.046123588462683926, 0.1752560102707024, -0.01333442963298689, 0.04158916716578412, 0.14420173841996745, 0.22613862686153044, 0.1341164051169121, 0.1253662948723245, -0.0665360277115223, -0.1454046899950839, -0.289535543938008, -0.09226134606950821, -0.1274017242958799, -0.04519374833447251, -0.07257316807234525, -0.10992335836464703, 0.36773361414820355, 0.21515702603716044, 0.12339550728366815, 0.07786439935350542, 0.39115274135760447, 0.11791850740269305, 0.01614909168372658, 0.0821781465883322, 0.25500891494619493, 0.10617208935913038, 0.07473090335597249, -0.2582174113050183, 0.1494801761184067, 0.024299981097446726] |
1,803.01653 | Novel approach to Raman spectra of nanoparticles | In crystalline nanoparticles the Raman peak is downshifted with respect to
the bulk material and has asymmetric broadening. These effects are straightly
related to the finite size of nanoparticles, giving the perspective to use the
Raman spectroscopy as the size probe. By combining the dynamical matrix method
(DMM) and the bond polarization model (BPM), we develop a new (DMM-BPM)
approach to the description of Raman spectra for random arrays of
nanoparticles. The numerical variant of this approach is suitable for the
description of small particles, whereas its simplier to implement analytical
version allows to obtain the Raman spectra of arbitrary sized particles.
Focusing on nanodiamond powders, the DMM-BPM theory is shown to fit the most
recent experimental data much better than the commonly used phonon confinement
model (PCM), especially for small enough nanoparticles.
| cond-mat.mes-hall | in crystalline nanoparticles the raman peak is downshifted with respect to the bulk material and has asymmetric broadening these effects are straightly related to the finite size of nanoparticles giving the perspective to use the raman spectroscopy as the size probe by combining the dynamical matrix method dmm and the bond polarization model bpm we develop a new dmmbpm approach to the description of raman spectra for random arrays of nanoparticles the numerical variant of this approach is suitable for the description of small particles whereas its simplier to implement analytical version allows to obtain the raman spectra of arbitrary sized particles focusing on nanodiamond powders the dmmbpm theory is shown to fit the most recent experimental data much better than the commonly used phonon confinement model pcm especially for small enough nanoparticles | [['in', 'crystalline', 'nanoparticles', 'the', 'raman', 'peak', 'is', 'downshifted', 'with', 'respect', 'to', 'the', 'bulk', 'material', 'and', 'has', 'asymmetric', 'broadening', 'these', 'effects', 'are', 'straightly', 'related', 'to', 'the', 'finite', 'size', 'of', 'nanoparticles', 'giving', 'the', 'perspective', 'to', 'use', 'the', 'raman', 'spectroscopy', 'as', 'the', 'size', 'probe', 'by', 'combining', 'the', 'dynamical', 'matrix', 'method', 'dmm', 'and', 'the', 'bond', 'polarization', 'model', 'bpm', 'we', 'develop', 'a', 'new', 'dmmbpm', 'approach', 'to', 'the', 'description', 'of', 'raman', 'spectra', 'for', 'random', 'arrays', 'of', 'nanoparticles', 'the', 'numerical', 'variant', 'of', 'this', 'approach', 'is', 'suitable', 'for', 'the', 'description', 'of', 'small', 'particles', 'whereas', 'its', 'simplier', 'to', 'implement', 'analytical', 'version', 'allows', 'to', 'obtain', 'the', 'raman', 'spectra', 'of', 'arbitrary', 'sized', 'particles', 'focusing', 'on', 'nanodiamond', 'powders', 'the', 'dmmbpm', 'theory', 'is', 'shown', 'to', 'fit', 'the', 'most', 'recent', 'experimental', 'data', 'much', 'better', 'than', 'the', 'commonly', 'used', 'phonon', 'confinement', 'model', 'pcm', 'especially', 'for', 'small', 'enough', 'nanoparticles']] | [-0.029463291039543326, 0.147754466930961, -0.10467819871969129, 0.02514114616179657, -0.05842609086101945, -0.1482590055627104, 0.04044864332229879, 0.40664262279756086, -0.2445482439405278, -0.2951771070033179, 0.036939376822490724, -0.30001625081332123, -0.09331154270461739, 0.19326533982880356, -0.0075745054877790294, 0.06806336444998651, 0.018559471844114307, -0.03144653737404965, -0.01906476088596466, -0.16834645359461806, 0.2294460806209608, 0.0980736071134907, 0.3205027997833362, 0.07137836673808165, 0.04506702914123276, 0.04044931114448192, 0.00873960056727318, 0.007221210845991185, -0.1406022474463833, 0.15713403962335473, 0.2205088792519322, -0.007373593574305786, 0.18597603609603375, -0.43253578748413946, -0.21461302493576354, 0.06345891841001024, 0.14407947350685535, 0.1752087916623927, -0.03777409794904936, -0.24833508753532865, 0.08835605991990271, -0.1250453449963396, -0.15742468655733496, -0.10813281958033436, -0.0026887511043228152, -0.007213743978628146, -0.27842420646990823, 0.04815542344284013, 0.030685835824955494, 0.05216611938330492, -0.07571542383779079, -0.1222945528973202, -0.0031065866596212514, 0.04908996933013817, 0.03971454024987113, -0.007364856765458458, 0.17523235176808963, -0.06445988421363377, -0.07783566713613227, 0.42868020469882995, -0.0639217212894464, -0.13286334284602253, 0.18925391033263808, -0.1596353123615727, -0.06693538254182926, 0.17214669906219146, 0.15173485955657592, 0.13553590591492734, -0.14177788579766465, 0.045350814386116885, -0.015955942007187838, 0.20687275545153402, 0.06067814155572787, 0.07386501322857532, 0.157616048890229, 0.21262073409358473, 0.0037748971253745538, 0.16497768020201334, -0.11759849836790752, -0.061420222835377195, -0.20077039276361747, -0.1375632992791558, -0.1979088648012314, 0.02011261378192602, -0.12960132433401764, -0.18523921040337554, 0.3743955859760369, 0.12741705949621318, 0.1760919191944588, 0.02222354855752529, 0.292921824044639, 0.09541049257141392, 0.09059739713837162, -0.02965135188927328, 0.24158106338148727, 0.21310661646320408, 0.10850791042474539, -0.25251974501556024, 0.054798061170797316, 0.025270618957640687] |
1,803.01654 | Autonomous quantum rotator | We consider a minimal model of a quantum rotator composed of a single
particle confined in an harmonic potential and driven by two temperature-biased
heat reservoirs. In the case the particle potential is rendered asymmetric and
rotated an angle, a finite angular momentum develops, corresponding to a
directed rotary motion. At variance with the classical case, the thermal
fluctuations in the baths give rise to a non-vanishing average torque
contribution; this is a genuine quantum effect akin to the Casimir effect. In
the steady state the heat current flowing between the two baths is
systematically converted into particle rotation. We derive exact expressions
for the work rate and heat currents in the case where the system is driven by
an external time periodic mechanical force. We show, in agreement with previous
works on classical systems, that for this choice of external manipulation
protocol, the rotator cannot work either as a heat pump or as a heat engine. We
finally use our exact results to extend an ab-initio quantum simulation
algorithm to the out-of-equilibrium regime.
| quant-ph cond-mat.stat-mech | we consider a minimal model of a quantum rotator composed of a single particle confined in an harmonic potential and driven by two temperaturebiased heat reservoirs in the case the particle potential is rendered asymmetric and rotated an angle a finite angular momentum develops corresponding to a directed rotary motion at variance with the classical case the thermal fluctuations in the baths give rise to a nonvanishing average torque contribution this is a genuine quantum effect akin to the casimir effect in the steady state the heat current flowing between the two baths is systematically converted into particle rotation we derive exact expressions for the work rate and heat currents in the case where the system is driven by an external time periodic mechanical force we show in agreement with previous works on classical systems that for this choice of external manipulation protocol the rotator cannot work either as a heat pump or as a heat engine we finally use our exact results to extend an abinitio quantum simulation algorithm to the outofequilibrium regime | [['we', 'consider', 'a', 'minimal', 'model', 'of', 'a', 'quantum', 'rotator', 'composed', 'of', 'a', 'single', 'particle', 'confined', 'in', 'an', 'harmonic', 'potential', 'and', 'driven', 'by', 'two', 'temperaturebiased', 'heat', 'reservoirs', 'in', 'the', 'case', 'the', 'particle', 'potential', 'is', 'rendered', 'asymmetric', 'and', 'rotated', 'an', 'angle', 'a', 'finite', 'angular', 'momentum', 'develops', 'corresponding', 'to', 'a', 'directed', 'rotary', 'motion', 'at', 'variance', 'with', 'the', 'classical', 'case', 'the', 'thermal', 'fluctuations', 'in', 'the', 'baths', 'give', 'rise', 'to', 'a', 'nonvanishing', 'average', 'torque', 'contribution', 'this', 'is', 'a', 'genuine', 'quantum', 'effect', 'akin', 'to', 'the', 'casimir', 'effect', 'in', 'the', 'steady', 'state', 'the', 'heat', 'current', 'flowing', 'between', 'the', 'two', 'baths', 'is', 'systematically', 'converted', 'into', 'particle', 'rotation', 'we', 'derive', 'exact', 'expressions', 'for', 'the', 'work', 'rate', 'and', 'heat', 'currents', 'in', 'the', 'case', 'where', 'the', 'system', 'is', 'driven', 'by', 'an', 'external', 'time', 'periodic', 'mechanical', 'force', 'we', 'show', 'in', 'agreement', 'with', 'previous', 'works', 'on', 'classical', 'systems', 'that', 'for', 'this', 'choice', 'of', 'external', 'manipulation', 'protocol', 'the', 'rotator', 'can', 'not', 'work', 'either', 'as', 'a', 'heat', 'pump', 'or', 'as', 'a', 'heat', 'engine', 'we', 'finally', 'use', 'our', 'exact', 'results', 'to', 'extend', 'an', 'abinitio', 'quantum', 'simulation', 'algorithm', 'to', 'the', 'outofequilibrium', 'regime']] | [-0.1591184669546783, 0.18349328043970412, -0.07806839723938278, 0.01110060090332159, -0.04403942189578499, -0.14608134440279433, 0.0433545527507418, 0.3593129186891019, -0.27043907395830113, -0.26478184326950993, 0.03876272817541446, -0.2889404353818723, -0.0960688698038991, 0.24580634146197033, -0.01707838355563581, 0.03055522936795439, 0.03982210864712085, 0.04955045761673578, -0.03387727935465851, -0.16422902032200778, 0.27310661443110024, 0.06076440573603447, 0.2718068982926863, 0.04279069439641067, 0.11550555243289896, -0.0019805587655199425, 0.045295120419136116, 0.0402213252907885, -0.13027898976999236, 0.05278901974404497, 0.16703361751511692, -0.04443586831380214, 0.23019897488611085, -0.45908175619851266, -0.21211907402129976, 0.11892924221498626, 0.12510123617148824, 0.16413625259484563, -0.07775411577895283, -0.23367381435020693, -0.022238654379200723, -0.19265953640985703, -0.14088477839216856, -0.05926867802560862, 0.028879514799586364, 0.010039609934070281, -0.27665189321818096, 0.11849600548456822, 0.10605317780614963, 0.04509054388850928, -0.06705515901890717, -0.04833304640504398, 0.008291534902527929, 0.1076079285277852, 0.013644908641331962, 0.04551841857909624, 0.19350573421855058, -0.14592471214709804, -0.12582826815545559, 0.34540889325950824, -0.10443385161226615, -0.25957442661481245, 0.18291983979887197, -0.12642877367192082, -0.060392530632338355, 0.10022461856582335, 0.1409933984598943, 0.1160569663112983, -0.18555100154663834, 0.04679988159565255, -0.013235562536532857, 0.149357936253239, 0.0269857763312757, -0.012982663788009502, 0.2544196819993002, 0.13556316960070813, 0.06019474188131946, 0.2438144023570099, -0.08039441198376672, -0.15334856653186893, -0.2901327670684883, -0.16363951253571682, -0.1945334852752941, 0.10119668835649333, -0.04004598918745095, -0.14778378980500356, 0.3822215688175389, 0.15425968115550598, 0.17810550034578357, 0.024215795388445257, 0.33781035593311703, 0.15910235786710733, 0.006360236369073391, 0.10440085613301822, 0.24835093973869724, 0.16387248476834168, 0.1455229809161808, -0.30487484989155617, 0.009376408318057656, 0.041467983197154744] |
1,803.01655 | Axial quasinormal modes of static neutron stars in the nonminimal
derivative coupling sector of Horndeski gravity: spectrum and universal
relations for realistic equations of state | We study axial quasinormal modes of static neutron stars in the nonminimal
derivative coupling sector of Horndeski theory. We focus on the fundamental
curvature mode, which we analyse for ten different equations of state with
different matter content. A comparison with the results obtained in pure
General Relativity reveals that, apart from modifying the spectrum of the
frequencies and the damping times of the stars, this theory modifies several
universal relations between the modes and physical parameters of the stars,
that are otherwise matter-independent.
| gr-qc | we study axial quasinormal modes of static neutron stars in the nonminimal derivative coupling sector of horndeski theory we focus on the fundamental curvature mode which we analyse for ten different equations of state with different matter content a comparison with the results obtained in pure general relativity reveals that apart from modifying the spectrum of the frequencies and the damping times of the stars this theory modifies several universal relations between the modes and physical parameters of the stars that are otherwise matterindependent | [['we', 'study', 'axial', 'quasinormal', 'modes', 'of', 'static', 'neutron', 'stars', 'in', 'the', 'nonminimal', 'derivative', 'coupling', 'sector', 'of', 'horndeski', 'theory', 'we', 'focus', 'on', 'the', 'fundamental', 'curvature', 'mode', 'which', 'we', 'analyse', 'for', 'ten', 'different', 'equations', 'of', 'state', 'with', 'different', 'matter', 'content', 'a', 'comparison', 'with', 'the', 'results', 'obtained', 'in', 'pure', 'general', 'relativity', 'reveals', 'that', 'apart', 'from', 'modifying', 'the', 'spectrum', 'of', 'the', 'frequencies', 'and', 'the', 'damping', 'times', 'of', 'the', 'stars', 'this', 'theory', 'modifies', 'several', 'universal', 'relations', 'between', 'the', 'modes', 'and', 'physical', 'parameters', 'of', 'the', 'stars', 'that', 'are', 'otherwise', 'matterindependent']] | [-0.16140533569661608, 0.18774215764287544, -0.0822239438147587, 0.06763482336600098, -0.11369068117206355, -0.08470044063449085, 0.035997991581974795, 0.29261686215850424, -0.1875494517139103, -0.2884346864758486, 0.026915533160257816, -0.29437930657562, -0.11835886930194066, 0.18092729012111583, 0.018838164693934012, -0.004603787813425423, 0.028936006341982318, 0.0566579703275249, -0.09035597046478147, -0.1712969507564824, 0.40081894318068245, 0.008017338812351227, 0.2554390726453928, -0.008814514917602023, 0.05135891548391566, -0.04020455626824153, -0.0354110855407205, -0.002181936324719923, -0.17176461194628564, 0.07773556323520031, 0.19604541268199682, 0.10240480611774039, 0.18296855997226863, -0.4386796953089266, -0.223030474081815, 0.044830270773585305, 0.11137406454500125, 0.15360950766529619, -0.03098467366730637, -0.26237210592097904, 0.053708206437225174, -0.16579571727618395, -0.1509690027156598, -0.0545311437594334, 0.01213168089154614, -0.023293171170537908, -0.2232487830950553, 0.11507394704168258, 0.034424068162172854, 0.031665942126727964, -0.11939690007648644, -0.11302611753288432, -0.03949547297859856, 0.10321987086503082, 0.15198102393411997, -0.03745322945774589, 0.10982904074354524, -0.16602396442420242, -0.07782624932903662, 0.4068190990891083, -0.14295248222447574, -0.172140671074929, 0.17794119223323931, -0.20157847956316657, -0.1423131535278566, 0.054226684449685016, 0.1530264252880925, 0.1789856439299253, -0.1367781847288989, 0.10017925057509712, 0.012775333923657975, 0.18345778653151298, 0.11703592970271606, 0.09371248361477853, 0.2632461203351976, 0.10364912812743919, -0.029738427050052637, 0.10325626108629898, -0.058247578867531596, -0.12139421581369207, -0.32502484009096244, -0.11770261866208839, -0.1084976490900476, 0.027968185426420475, -0.1680857684173627, -0.14446252413060381, 0.4504461813807847, 0.10376159424882338, 0.12570479374199386, 0.055113827384705376, 0.2644734022667609, 0.12190034918217774, 0.06964107978729958, 0.06426631816359887, 0.3700199475265052, 0.19400935606043562, 0.08883809360552085, -0.2847812114345157, -0.05478657290608768, 0.014289123578423477] |
1,803.01656 | Electric-field modification of interfacial spin-orbit field-vector | Current induced spin-orbit magnetic fields (iSOFs), arising either in
single-crystalline ferromagnets with broken inversion symmetry1,2 or in
non-magnetic metal/ferromagnetic metal bilayers3,4, can produce spin-orbit
torques which act on a ferromagnet's magnetization,thus offering an efficient
way for its manipulation.To further reduce power consumption in spin-orbit
torque devices, it is highly desirable to control iSOFs by the field-effect,
where power consumption is determined by charging/discharging a capacitor5,6.
In particular, efficient electric-field control of iSOFs acting on
ferromagnetic metals is of vital importance for practical applications. It is
known that in single crystalline Fe/GaAs (001) heterostructures with C2v
symmetry, interfacial SOFs emerge at the Fe/GaAs (001) interface due to the
lack of inversion symmetry7,8. Here, we show that by applying a gate-voltage
across the Fe/GaAs interface, interfacial SOFs acting on Fe can be robustly
modulated via the change of the magnitude of the interfacial spin-orbit
interaction. Our results show that, for the first time, the electric-field in a
Schottky barrier is capable of modifying SOFs, which can be exploited for the
development of low-power-consumption spin-orbit torque devices.
| cond-mat.mes-hall | current induced spinorbit magnetic fields isofs arising either in singlecrystalline ferromagnets with broken inversion symmetry12 or in nonmagnetic metalferromagnetic metal bilayers34 can produce spinorbit torques which act on a ferromagnets magnetizationthus offering an efficient way for its manipulationto further reduce power consumption in spinorbit torque devices it is highly desirable to control isofs by the fieldeffect where power consumption is determined by chargingdischarging a capacitor56 in particular efficient electricfield control of isofs acting on ferromagnetic metals is of vital importance for practical applications it is known that in single crystalline fegaas 001 heterostructures with c2v symmetry interfacial sofs emerge at the fegaas 001 interface due to the lack of inversion symmetry78 here we show that by applying a gatevoltage across the fegaas interface interfacial sofs acting on fe can be robustly modulated via the change of the magnitude of the interfacial spinorbit interaction our results show that for the first time the electricfield in a schottky barrier is capable of modifying sofs which can be exploited for the development of lowpowerconsumption spinorbit torque devices | [['current', 'induced', 'spinorbit', 'magnetic', 'fields', 'isofs', 'arising', 'either', 'in', 'singlecrystalline', 'ferromagnets', 'with', 'broken', 'inversion', 'symmetry12', 'or', 'in', 'nonmagnetic', 'metalferromagnetic', 'metal', 'bilayers34', 'can', 'produce', 'spinorbit', 'torques', 'which', 'act', 'on', 'a', 'ferromagnets', 'magnetizationthus', 'offering', 'an', 'efficient', 'way', 'for', 'its', 'manipulationto', 'further', 'reduce', 'power', 'consumption', 'in', 'spinorbit', 'torque', 'devices', 'it', 'is', 'highly', 'desirable', 'to', 'control', 'isofs', 'by', 'the', 'fieldeffect', 'where', 'power', 'consumption', 'is', 'determined', 'by', 'chargingdischarging', 'a', 'capacitor56', 'in', 'particular', 'efficient', 'electricfield', 'control', 'of', 'isofs', 'acting', 'on', 'ferromagnetic', 'metals', 'is', 'of', 'vital', 'importance', 'for', 'practical', 'applications', 'it', 'is', 'known', 'that', 'in', 'single', 'crystalline', 'fegaas', '001', 'heterostructures', 'with', 'c2v', 'symmetry', 'interfacial', 'sofs', 'emerge', 'at', 'the', 'fegaas', '001', 'interface', 'due', 'to', 'the', 'lack', 'of', 'inversion', 'symmetry78', 'here', 'we', 'show', 'that', 'by', 'applying', 'a', 'gatevoltage', 'across', 'the', 'fegaas', 'interface', 'interfacial', 'sofs', 'acting', 'on', 'fe', 'can', 'be', 'robustly', 'modulated', 'via', 'the', 'change', 'of', 'the', 'magnitude', 'of', 'the', 'interfacial', 'spinorbit', 'interaction', 'our', 'results', 'show', 'that', 'for', 'the', 'first', 'time', 'the', 'electricfield', 'in', 'a', 'schottky', 'barrier', 'is', 'capable', 'of', 'modifying', 'sofs', 'which', 'can', 'be', 'exploited', 'for', 'the', 'development', 'of', 'lowpowerconsumption', 'spinorbit', 'torque', 'devices']] | [-0.2041851623105772, 0.17674967240747633, -0.0013042467929023718, -0.01511956502370248, -0.08838301029200443, -0.1718416885622511, 0.03324851761239448, 0.42802909697361646, -0.30069312055240427, -0.3362442273868337, 0.01288191155791061, -0.23419224737500327, -0.14390472065064214, 0.27170138381327325, -0.0063522816607950346, -0.025029578376797007, -0.06016323072323021, -0.10771395505816188, -0.0604037331469867, -0.1781016385010887, 0.270568425118524, 0.007031751740409423, 0.3251103523944039, 0.11697850699835856, 0.04635147991541003, 0.0011080730418186811, 0.1450472156727864, 0.014823306872997256, -0.08821142524811876, 0.09158301239533882, 0.26548710987948915, -0.14213485457280295, 0.20443000207493847, -0.5144865289884841, -0.1987795931875423, 0.0014040451912608529, 0.11510740683990575, 0.15623264638235837, -0.14692595248717616, -0.2723111962439448, 0.08888353650885013, -0.1765930384419681, -0.08165927786068919, -0.10055784388844456, 0.0011967551268060646, 0.01825194664221878, -0.2852593061868988, 0.06432970349227876, 0.09103658070879257, 0.07981004139981537, -0.05985814586182685, -0.08082446085089552, -0.12663117229766657, 0.08791407575925059, 0.04618825915219661, 0.047008378680662384, 0.20392184982345152, -0.1115223762341581, -0.11420559768919789, 0.3626712265845743, -0.04771893247657101, -0.1541610232052335, 0.13600259606859513, -0.11916231517361234, -0.03857464037026234, 0.12775337127857797, 0.15238360863544845, 0.10791951229163844, -0.143508828786296, 0.1126634475963545, 0.05975968359381936, 0.1599882817882601, 0.023456515372908188, 0.04170680784210119, 0.26642851344686713, 0.19860088562875586, 0.10435044303310514, 0.12031294587012824, -0.10812875635955217, -0.010356072937914481, -0.19048543476604946, -0.18494335199024395, -0.25200996103341733, 0.09116644183328997, -0.06228312687363498, -0.16310369756649293, 0.36928029571260723, 0.17054521552165083, 0.12934505347151398, -0.06776351544613135, 0.304748617603244, 0.12697576138903277, 0.13297185660173585, 0.010706024193842452, 0.26128362055446597, 0.14936535354700892, 0.10650217426951886, -0.3056512296842855, 0.15437584034156143, -0.03257573733571917] |
1,803.01657 | Strange baryons with two heavy quarks | The LHCb Experiment at CERN has observed a doubly-charmed baryon
$\Xi_{cc}^{++} =ccu$ with a mass of $3621.40 \pm 0.78$ MeV, consistent with
many predictions. We use the same methods that led us to predict
$M(\Xi_{cc},~J^P{=}1/2^+) = 3627 \pm 12$ MeV and $M(\Xi_{cc}^*,~J^P{=}3/2^+) =
3690 \pm 12$ MeV to predict $M(\Omega_{cc}^+,J^P{=}1/2^+) = 3692 \pm 16$ MeV
and $M(\Omega_{cc}^*,~J^P{=} 3/2^+) = 3756 \pm 16$ MeV. Production and decay
are discussed briefly, and predictions for $M(\Omega_{bc})$ and
$M(\Omega_{bb})$ are included.
| hep-ph hep-ex | the lhcb experiment at cern has observed a doublycharmed baryon xi_cc ccu with a mass of 362140 pm 078 mev consistent with many predictions we use the same methods that led us to predict mxi_ccjp12 3627 pm 12 mev and mxi_ccjp32 3690 pm 12 mev to predict momega_ccjp12 3692 pm 16 mev and momega_ccjp 32 3756 pm 16 mev production and decay are discussed briefly and predictions for momega_bc and momega_bb are included | [['the', 'lhcb', 'experiment', 'at', 'cern', 'has', 'observed', 'a', 'doublycharmed', 'baryon', 'xi_cc', 'ccu', 'with', 'a', 'mass', 'of', '362140', 'pm', '078', 'mev', 'consistent', 'with', 'many', 'predictions', 'we', 'use', 'the', 'same', 'methods', 'that', 'led', 'us', 'to', 'predict', 'mxi_ccjp12', '3627', 'pm', '12', 'mev', 'and', 'mxi_ccjp32', '3690', 'pm', '12', 'mev', 'to', 'predict', 'momega_ccjp12', '3692', 'pm', '16', 'mev', 'and', 'momega_ccjp', '32', '3756', 'pm', '16', 'mev', 'production', 'and', 'decay', 'are', 'discussed', 'briefly', 'and', 'predictions', 'for', 'momega_bc', 'and', 'momega_bb', 'are', 'included']] | [-0.020271662674816466, 0.23494943534371568, -0.028127583098222515, 0.10776606346689054, 0.012151412985117328, -0.16989275077774899, 0.09073593792741869, 0.34656237341018753, -0.05810691152157178, -0.4180739482225322, 0.01470210848231939, -0.4330674417511518, 0.11018604203474833, 0.16593687613008182, 0.04904277890281224, 0.05804306798989871, 0.09294446248477742, -0.008418142649609207, -0.06269701715183458, -0.177785400092713, 0.12322369746085424, 0.07051980431511332, 0.2181680797974565, 0.1241708266368108, 0.06732319476197599, -0.06098743880501212, -0.003068971564930711, -0.1494109021715208, -0.2491459988598206, 0.06086892912636942, 0.20545621670838168, 0.028932684073363666, 0.1379163938282586, -0.2377231551174408, -0.021536234404836128, 0.12148470070852495, 0.16099508857326722, 0.027866241452631665, -0.017702806782700233, -0.3430032751092048, 0.20315877701253143, -0.23435880291039374, -0.18683523976647143, 0.0008743803169745118, 0.04918283931632985, -0.05821384985430805, -0.2924881297260968, 0.18760128856511482, -0.17973191549640094, 0.06341391852222827, -0.08647373708055368, -0.3483222719288862, -0.02508015305832473, 0.0005725305110438546, 0.06719012899018491, 0.20175869689225706, 0.10595761500159974, 0.012234400033450393, -0.15616008584603056, 0.3986361049004455, -0.05637984856295941, 0.00047541731871219716, 0.08642796857921935, -0.17616466074181136, -0.16070128722922572, 0.17635037099122444, 0.13419442318741287, -0.0005551632702239413, -0.15558435670586665, -0.009390803086119634, 0.024931980922484574, 0.2855086903428353, 0.09702037866991847, -0.011190707009952904, 0.20760606861336212, 0.18189851102877908, -0.08751848321355907, -0.06767319333253068, -0.1975095157247426, -0.02261563017964363, -0.2973685359665707, -0.06818174884946489, -0.03662718471084068, 0.13649230202270754, -0.038155560380624565, 0.03995513426723765, 0.3278432224057059, 0.11809862197251685, 0.3030996995964157, 0.02260710528718113, 0.1773442371588534, 0.04881955834050009, 0.08411014221831044, 0.09110189933997037, 0.3101092699095051, 0.24397816108678705, 0.15651206669411552, -0.2066529786853648, -0.05500311235403781, -0.06979854966152403] |
1,803.01658 | New characterizations of Sobolev metric spaces | We provide new characterizations of Sobolev ad BV spaces in doubling and
Poincare metric spaces in the spirit of the Bourgain-Brezis-Mironescu and
Nguyen limit formulas holding in domains of R^N.
| math.AP | we provide new characterizations of sobolev ad bv spaces in doubling and poincare metric spaces in the spirit of the bourgainbrezismironescu and nguyen limit formulas holding in domains of rn | [['we', 'provide', 'new', 'characterizations', 'of', 'sobolev', 'ad', 'bv', 'spaces', 'in', 'doubling', 'and', 'poincare', 'metric', 'spaces', 'in', 'the', 'spirit', 'of', 'the', 'bourgainbrezismironescu', 'and', 'nguyen', 'limit', 'formulas', 'holding', 'in', 'domains', 'of', 'rn']] | [-0.12437546647464236, 0.03901579148174884, -0.0649063928052783, 0.16170122114320595, -0.08867015378200449, -0.057854816193381946, 0.05410195281729102, 0.34424855262041093, -0.24127723400791487, -0.1645267948197822, 0.14479403423223022, -0.24778186914821465, -0.10177542852858702, 0.23005316803852718, -0.24508385862912593, 0.04929097310329477, -0.023846919710437457, 0.015610657656604113, -0.15936634190535795, -0.2921049264880518, 0.4113949544514374, -0.09686333239078522, 0.23653344810009003, 0.03630756655087074, 0.05589596529801687, 0.025799807626754045, -0.034735053513819975, -0.007010180627306303, -0.2714235141252478, 0.21109059390922388, 0.24019075085719427, 0.08288077777251601, 0.25928739439696075, -0.38579208087176087, -0.17914780204494793, 0.15361795679976542, 0.10026665863891443, -0.05340735757102569, -0.004245107807219028, -0.36348356331388154, 0.011594505980610847, -0.06882085874676705, -0.1577533153196176, -0.15110082323662938, 0.1089579448569566, 0.06303800231932352, -0.2953714565684398, 0.08537750608908633, 0.15051212101243436, 0.10000282572582364, -0.21908350164691606, -0.06119712553918362, 0.006364860323568185, 0.08820031688859066, 0.013246760641535123, 0.09844361552968621, -0.008260900209036966, -0.03566290711363156, -0.18121094292340179, 0.3258562770982583, -0.12308058113170167, -0.24121777151400844, 0.09341398887336254, -0.20609626279522975, -0.16966275610029696, -0.010387824227412542, 0.12589741268505653, 0.18489858036239942, -0.08318205109486977, 0.2515647701569833, -0.030247638002038002, 0.0171154764170448, 0.21847364756589135, 0.1605409019937118, -0.02057271860539913, 0.12450282424688339, 0.12983886933264632, 0.15770667443672817, -0.007017493465294441, -0.09438028721682107, -0.3533523562053839, -0.2486526573697726, -0.1202801172931989, 0.09124286497632662, -0.2239095538534457, -0.18480033163990203, 0.2818874743456642, 0.03480152152478695, 0.16255634700258573, 0.13378992568080625, 0.11909396968161066, 0.04079177177821596, 0.02747266540924708, 0.10020293400933346, 0.21646812371909618, 0.18362006642855705, 0.19920015651732684, -0.0498990323394537, -0.05063522726607819, 0.2828757595115652] |
1,803.01659 | Derived Brackets and Symmetries in Generalized Geometry and Double Field
Theory | Derived brackets as introduced and studied by Kosmann-Schwarzbach and Voronov
are a powerful tool for describing and understanding infinitesimal symmetry
actions relevant in physics. Roytenberg and Weinstein showed that this
continues to hold for the categorified symmetries arising in Hitchin's
generalized geometry. After reviewing some well-established examples, we prove
that derived brackets also underlie the symmetries of Double Field Theory and
heterotic Double Field Theory. This leads to a common framework for large
classes of symmetries, which suggests that derived bracket constructions can
function as a guiding principle in the description of infinitesimal actions of
symmetries in physics. As a new result, we present sufficient conditions on a
bracket to give rise to a Lie 2-algebra of symmetries via antisymmetrized
derived brackets.
| hep-th math-ph math.MP | derived brackets as introduced and studied by kosmannschwarzbach and voronov are a powerful tool for describing and understanding infinitesimal symmetry actions relevant in physics roytenberg and weinstein showed that this continues to hold for the categorified symmetries arising in hitchins generalized geometry after reviewing some wellestablished examples we prove that derived brackets also underlie the symmetries of double field theory and heterotic double field theory this leads to a common framework for large classes of symmetries which suggests that derived bracket constructions can function as a guiding principle in the description of infinitesimal actions of symmetries in physics as a new result we present sufficient conditions on a bracket to give rise to a lie 2algebra of symmetries via antisymmetrized derived brackets | [['derived', 'brackets', 'as', 'introduced', 'and', 'studied', 'by', 'kosmannschwarzbach', 'and', 'voronov', 'are', 'a', 'powerful', 'tool', 'for', 'describing', 'and', 'understanding', 'infinitesimal', 'symmetry', 'actions', 'relevant', 'in', 'physics', 'roytenberg', 'and', 'weinstein', 'showed', 'that', 'this', 'continues', 'to', 'hold', 'for', 'the', 'categorified', 'symmetries', 'arising', 'in', 'hitchins', 'generalized', 'geometry', 'after', 'reviewing', 'some', 'wellestablished', 'examples', 'we', 'prove', 'that', 'derived', 'brackets', 'also', 'underlie', 'the', 'symmetries', 'of', 'double', 'field', 'theory', 'and', 'heterotic', 'double', 'field', 'theory', 'this', 'leads', 'to', 'a', 'common', 'framework', 'for', 'large', 'classes', 'of', 'symmetries', 'which', 'suggests', 'that', 'derived', 'bracket', 'constructions', 'can', 'function', 'as', 'a', 'guiding', 'principle', 'in', 'the', 'description', 'of', 'infinitesimal', 'actions', 'of', 'symmetries', 'in', 'physics', 'as', 'a', 'new', 'result', 'we', 'present', 'sufficient', 'conditions', 'on', 'a', 'bracket', 'to', 'give', 'rise', 'to', 'a', 'lie', '2algebra', 'of', 'symmetries', 'via', 'antisymmetrized', 'derived', 'brackets']] | [-0.12882571801024137, 0.09747498215473883, -0.10232426514696391, 0.14397059181289076, -0.12465580529724171, -0.14130813700956155, 0.0003118290151774761, 0.30007591396264854, -0.29735895764601766, -0.29123498532218767, 0.04078250302437914, -0.14789148574298033, -0.23242215745028902, 0.195478931512134, -0.11942235075822863, -0.026639988488464265, 0.0346991371012247, 0.04300139540210977, -0.13467654139452354, -0.20611459817584665, 0.3515437156931482, 0.052647428391463136, 0.2698811491050559, 0.02890721120734195, 0.14502389957941306, 0.034955258004092535, -0.02117731056718125, 0.002360800571251111, -0.17259567168527654, 0.13786708914720622, 0.2708098857365854, 0.08029860778917848, 0.14922217544785854, -0.4451730924307323, -0.1933177472206718, 0.03703553794861602, 0.11658085729224515, 0.12444411171123111, -0.0734828065643774, -0.3251942568992982, 0.06372859979956792, -0.18114238556046955, -0.2035970636070935, -0.13752123693263799, 0.010412555701313083, -0.006106069639752634, -0.2154640305766332, 0.04363919722205448, 0.11773728052360295, 0.08242659663784387, -0.08020736309356194, -0.08418729677261999, -0.07309203986536528, 0.06187088211967808, 0.030258641830172208, -0.0006724171546577919, 0.09516337766125035, -0.11609452009033107, -0.1742132655125432, 0.4196492085905104, -0.013175612949140247, -0.21361318638273438, 0.1500178637029794, -0.08226320752015215, -0.24897372602011825, 0.07922450433481393, 0.10562373909977127, 0.10911266869802379, -0.16011158018907318, 0.15915518951913357, -0.060628012944867866, 0.011434991431773687, 0.07944949400672292, 0.035124888319186254, 0.18493433698981268, 0.07644267242447642, 0.04431890941713555, 0.10671089791509582, 0.029009451728970667, -0.1502980505513241, -0.39426970492559865, -0.1647491766574991, -0.07477642544430727, 0.1437038909033185, -0.048020283587932484, -0.14351107281409434, 0.37514149965565713, 0.11911060962612267, 0.17465095975069847, 0.06773537396334997, 0.16351017803449916, 0.11069311674724364, 0.10928777831637101, 0.007506166601965784, 0.1904722390609095, 0.2598588753789358, 0.047293101517544664, -0.13718263759109817, -0.057162077887533386, 0.1990758789413166] |
1,803.0166 | Continuous Affect Prediction using Eye Gaze | In recent times, there has been significant interest in the machine
recognition of human emotions, due to the suite of applications to which this
knowledge can be applied. A number of different modalities, such as speech or
facial expression, individually and with eye gaze, have been investigated by
the affective computing research community to either classify the emotion (e.g.
sad, happy, angry) or predict the continuous values of affective dimensions
(e.g. valence, arousal, dominance) at each moment in time. Surprisingly after
an extensive literature review, eye gaze as a unimodal input to a continuous
affect prediction system has not been considered. In this context, this paper
evaluates the use of eye gaze as a unimodal input to a continuous affect
prediction system. The performance of continuous prediction of arousal and
valence using eye gaze is compared with the performance of a speech system
using the AVEC 2014 speech feature set. The experimental evaluation when using
eye gaze as the single modality in a continuous affect prediction system
produced a correlation result for valence prediction that is better than the
correlation result obtained with the AVEC 2014 speech feature set. Furthermore,
the eye gaze feature set proposed in this paper contains 98% fewer features
compared to the number of features in the AVEC 2014 feature set.
| cs.HC | in recent times there has been significant interest in the machine recognition of human emotions due to the suite of applications to which this knowledge can be applied a number of different modalities such as speech or facial expression individually and with eye gaze have been investigated by the affective computing research community to either classify the emotion eg sad happy angry or predict the continuous values of affective dimensions eg valence arousal dominance at each moment in time surprisingly after an extensive literature review eye gaze as a unimodal input to a continuous affect prediction system has not been considered in this context this paper evaluates the use of eye gaze as a unimodal input to a continuous affect prediction system the performance of continuous prediction of arousal and valence using eye gaze is compared with the performance of a speech system using the avec 2014 speech feature set the experimental evaluation when using eye gaze as the single modality in a continuous affect prediction system produced a correlation result for valence prediction that is better than the correlation result obtained with the avec 2014 speech feature set furthermore the eye gaze feature set proposed in this paper contains 98 fewer features compared to the number of features in the avec 2014 feature set | [['in', 'recent', 'times', 'there', 'has', 'been', 'significant', 'interest', 'in', 'the', 'machine', 'recognition', 'of', 'human', 'emotions', 'due', 'to', 'the', 'suite', 'of', 'applications', 'to', 'which', 'this', 'knowledge', 'can', 'be', 'applied', 'a', 'number', 'of', 'different', 'modalities', 'such', 'as', 'speech', 'or', 'facial', 'expression', 'individually', 'and', 'with', 'eye', 'gaze', 'have', 'been', 'investigated', 'by', 'the', 'affective', 'computing', 'research', 'community', 'to', 'either', 'classify', 'the', 'emotion', 'eg', 'sad', 'happy', 'angry', 'or', 'predict', 'the', 'continuous', 'values', 'of', 'affective', 'dimensions', 'eg', 'valence', 'arousal', 'dominance', 'at', 'each', 'moment', 'in', 'time', 'surprisingly', 'after', 'an', 'extensive', 'literature', 'review', 'eye', 'gaze', 'as', 'a', 'unimodal', 'input', 'to', 'a', 'continuous', 'affect', 'prediction', 'system', 'has', 'not', 'been', 'considered', 'in', 'this', 'context', 'this', 'paper', 'evaluates', 'the', 'use', 'of', 'eye', 'gaze', 'as', 'a', 'unimodal', 'input', 'to', 'a', 'continuous', 'affect', 'prediction', 'system', 'the', 'performance', 'of', 'continuous', 'prediction', 'of', 'arousal', 'and', 'valence', 'using', 'eye', 'gaze', 'is', 'compared', 'with', 'the', 'performance', 'of', 'a', 'speech', 'system', 'using', 'the', 'avec', '2014', 'speech', 'feature', 'set', 'the', 'experimental', 'evaluation', 'when', 'using', 'eye', 'gaze', 'as', 'the', 'single', 'modality', 'in', 'a', 'continuous', 'affect', 'prediction', 'system', 'produced', 'a', 'correlation', 'result', 'for', 'valence', 'prediction', 'that', 'is', 'better', 'than', 'the', 'correlation', 'result', 'obtained', 'with', 'the', 'avec', '2014', 'speech', 'feature', 'set', 'furthermore', 'the', 'eye', 'gaze', 'feature', 'set', 'proposed', 'in', 'this', 'paper', 'contains', '98', 'fewer', 'features', 'compared', 'to', 'the', 'number', 'of', 'features', 'in', 'the', 'avec', '2014', 'feature', 'set']] | [-0.02564805282149897, 0.04358176819819058, -0.06720709785450857, 0.012395458091266973, -0.06172195273603118, -0.17706019860843933, 0.008103203020047743, 0.44375928167340367, -0.21569402712548888, -0.3179993274480884, 0.07896936135637292, -0.3125783201523645, -0.1982498131020991, 0.1850947077212812, -0.14691143616124294, 0.09012155074492194, 0.10613666017496481, 0.13042667613873735, -0.026945360771483243, -0.23232227751760484, 0.26527017589745133, 0.022931236028671264, 0.3172198677825373, 0.03332832107363745, 0.10380100981267386, -0.008113082543795192, -0.055735911894589665, -0.005879864629444688, -0.01934511599819268, 0.13846944961047103, 0.3317105408162312, 0.18851572228270735, 0.3139011157719895, -0.35672177828328555, -0.21478831030774947, 0.09213060739688402, 0.13254246662389813, 0.09288998929686237, -0.046846793475019376, -0.39995607588505155, 0.06882058185590215, -0.2043297097563397, -0.011117960417339968, -0.07896481975479874, 0.05719970151955305, -0.035127157122329916, -0.27439355182428954, 0.06398976941181476, 0.07363195722451607, 0.1616297375237526, -0.07970798081653409, -0.1401985797798261, -0.025365532436516396, 0.23834171606577, 0.10153384388229528, 0.11609573284608074, 0.13327635293826462, -0.19934506318193515, -0.14498770292685909, 0.3674650878493869, -0.05155397543695831, -0.2118811320166948, 0.20611101537293128, -0.10219209635370347, -0.12880239870215138, 0.10869075879021439, 0.2146430271547721, 0.07925763976825184, -0.13647971224441832, 0.0008358915612578045, -0.05829749354486202, 0.21974029027380396, 0.10551132563241693, -0.006781646846587158, 0.20444992093022826, 0.19871023287888356, -0.021726966440287786, 0.1226143826995868, -0.11648199269006591, -0.023035177623116694, -0.18987291912754, -0.1391508688424649, -0.17888356332428926, -0.023758569881144023, -0.04982460350824282, -0.1514015700386534, 0.4471688658172308, 0.1957282902218055, 0.2085208418605806, 0.08861110163690132, 0.3049014936222933, 0.06524857310713594, 0.055631612599719056, 0.02334836218614391, 0.19639474326084086, -0.05133069816348684, 0.15487877073329548, -0.19630687999928934, 0.1274102303816742, 0.055592663396626364] |
1,803.01661 | ReviewChain: Untampered Product Reviews on the Blockchain | Online portals include an increasing amount of user feedback in form of
ratings and reviews. Recent research highlighted the importance of this
feedback and confirmed that positive feedback improves product sales figures
and thus its success. However, online portals' operators act as central
authorities throughout the overall review process. In the worst case, operators
can exclude users from submitting reviews, modify existing reviews, and
introduce fake reviews by fictional consumers. This paper presents ReviewChain,
a decentralized review approach. Our approach avoids central authorities by
using blockchain technologies, decentralized apps and storage. Thereby, we
enable users to submit and retrieve untampered reviews. We highlight the
implementation challenges encountered when realizing our approach on the public
Ethereum blockchain. For each implementation challange, we discuss possible
design alternatives and their trade-offs regarding costs, security, and
trustworthiness. Finally, we analyze which design decision should be chosen to
support specific trade-offs and present resulting combinations of decentralized
blockchain technologies, also with conventional centralized technologies.
| cs.CY | online portals include an increasing amount of user feedback in form of ratings and reviews recent research highlighted the importance of this feedback and confirmed that positive feedback improves product sales figures and thus its success however online portals operators act as central authorities throughout the overall review process in the worst case operators can exclude users from submitting reviews modify existing reviews and introduce fake reviews by fictional consumers this paper presents reviewchain a decentralized review approach our approach avoids central authorities by using blockchain technologies decentralized apps and storage thereby we enable users to submit and retrieve untampered reviews we highlight the implementation challenges encountered when realizing our approach on the public ethereum blockchain for each implementation challange we discuss possible design alternatives and their tradeoffs regarding costs security and trustworthiness finally we analyze which design decision should be chosen to support specific tradeoffs and present resulting combinations of decentralized blockchain technologies also with conventional centralized technologies | [['online', 'portals', 'include', 'an', 'increasing', 'amount', 'of', 'user', 'feedback', 'in', 'form', 'of', 'ratings', 'and', 'reviews', 'recent', 'research', 'highlighted', 'the', 'importance', 'of', 'this', 'feedback', 'and', 'confirmed', 'that', 'positive', 'feedback', 'improves', 'product', 'sales', 'figures', 'and', 'thus', 'its', 'success', 'however', 'online', 'portals', 'operators', 'act', 'as', 'central', 'authorities', 'throughout', 'the', 'overall', 'review', 'process', 'in', 'the', 'worst', 'case', 'operators', 'can', 'exclude', 'users', 'from', 'submitting', 'reviews', 'modify', 'existing', 'reviews', 'and', 'introduce', 'fake', 'reviews', 'by', 'fictional', 'consumers', 'this', 'paper', 'presents', 'reviewchain', 'a', 'decentralized', 'review', 'approach', 'our', 'approach', 'avoids', 'central', 'authorities', 'by', 'using', 'blockchain', 'technologies', 'decentralized', 'apps', 'and', 'storage', 'thereby', 'we', 'enable', 'users', 'to', 'submit', 'and', 'retrieve', 'untampered', 'reviews', 'we', 'highlight', 'the', 'implementation', 'challenges', 'encountered', 'when', 'realizing', 'our', 'approach', 'on', 'the', 'public', 'ethereum', 'blockchain', 'for', 'each', 'implementation', 'challange', 'we', 'discuss', 'possible', 'design', 'alternatives', 'and', 'their', 'tradeoffs', 'regarding', 'costs', 'security', 'and', 'trustworthiness', 'finally', 'we', 'analyze', 'which', 'design', 'decision', 'should', 'be', 'chosen', 'to', 'support', 'specific', 'tradeoffs', 'and', 'present', 'resulting', 'combinations', 'of', 'decentralized', 'blockchain', 'technologies', 'also', 'with', 'conventional', 'centralized', 'technologies']] | [-0.1433154837180902, -0.012554121122804506, 0.017043051674701035, 0.04172838641266692, -0.16416476895012388, -0.20788780776012666, 0.14889043722239437, 0.4001308380252427, -0.24158578814499698, -0.31675932593169104, 0.12568958111071757, -0.33041929029177425, -0.16328386820046006, 0.17071834253888743, -0.16400441162104298, 0.021185816505517527, 0.07370346023962139, -0.012604494216543426, -0.012041075812477714, -0.3575513868097358, 0.31911684769045584, 0.10371472348998877, 0.3517170251023831, 0.10878893520659322, 0.04712765997536718, 0.026254596019602696, -0.14620087519703304, -0.06329580866598233, -0.1155982410283941, 0.17086720102092928, 0.3765314472587127, 0.28782499168412223, 0.37850276474799416, -0.4329040657289943, -0.12316764506754602, 0.06360542867332697, 0.15515646548084558, 0.07749666004355665, -0.11618005315410596, -0.3260619526559926, 0.06503823553775526, -0.29886797598598724, -0.08571995711725229, -0.13135031709198358, -0.04219309756959415, 0.03852181144772721, -0.24240642410827576, -0.017663286514113107, -0.015219401307166761, 0.04029899372298057, -0.020807895479445008, -0.12471206912290377, 0.035960586160231546, 0.18722971290469342, 0.07679808100038149, -0.06888838289498357, 0.21254104518281167, -0.14498592351984446, -0.22913631439731, 0.3630712268648634, 0.03635431267728934, -0.14815215536787701, 0.1407367492770883, -0.01018028317915074, -0.15551900899536006, 0.023698341223013817, 0.2495614316931386, 0.037414733406488494, -0.19786078165996016, 0.025822095750537434, 0.008777862862582989, 0.17752164786171382, 0.03583449084655779, 0.07349788840818604, 0.20659515155764047, 0.19273370169518386, 0.08841385839471391, 0.12430054534769433, 0.05847973114763428, -0.12818529851813237, -0.23711592070965962, -0.16510493180619637, -0.1188916381697651, 0.016786277461737678, -0.06418727278317529, -0.09155267958713185, 0.3666090942062082, 0.26615279129638475, 0.11996809883483621, 0.046397696113492704, 0.3807553819078169, -0.011832748214969305, 0.0824030776831446, 0.12304679795085292, 0.16351891607327898, -0.018831083749770928, 0.21271486587786845, -0.14663981455734154, 0.16036796449182353, -0.006655210587581632] |
1,803.01662 | Continuous Affect Prediction Using Eye Gaze and Speech | Affective computing research traditionally focused on labeling a person's
emotion as one of a discrete number of classes e.g. happy or sad. In recent
times, more attention has been given to continuous affect prediction across
dimensions in the emotional space, e.g. arousal and valence. Continuous affect
prediction is the task of predicting a numerical value for different emotion
dimensions. The application of continuous affect prediction is powerful in
domains involving real-time audio-visual communications which could include
remote or assistive technologies for psychological assessment of subjects.
Modalities used for continuous affect prediction may include speech, facial
expressions and physiological responses. As opposed to single modality
analysis, the research community have combined multiple modalities to improve
the accuracy of continuous affect prediction. In this context, this paper
investigates a continuous affect prediction system using the novel combination
of speech and eye gaze. A new eye gaze feature set is proposed. This novel
approach uses open source software for real-time affect prediction in
audio-visual communication environments. A unique advantage of the
human-computer interface used here is that it does not require the subject to
wear specialized and expensive eye-tracking headsets or intrusive devices. The
results indicate that the combination of speech and eye gaze improves arousal
prediction by 3.5% and valence prediction by 19.5% compared to using speech
alone.
| cs.HC | affective computing research traditionally focused on labeling a persons emotion as one of a discrete number of classes eg happy or sad in recent times more attention has been given to continuous affect prediction across dimensions in the emotional space eg arousal and valence continuous affect prediction is the task of predicting a numerical value for different emotion dimensions the application of continuous affect prediction is powerful in domains involving realtime audiovisual communications which could include remote or assistive technologies for psychological assessment of subjects modalities used for continuous affect prediction may include speech facial expressions and physiological responses as opposed to single modality analysis the research community have combined multiple modalities to improve the accuracy of continuous affect prediction in this context this paper investigates a continuous affect prediction system using the novel combination of speech and eye gaze a new eye gaze feature set is proposed this novel approach uses open source software for realtime affect prediction in audiovisual communication environments a unique advantage of the humancomputer interface used here is that it does not require the subject to wear specialized and expensive eyetracking headsets or intrusive devices the results indicate that the combination of speech and eye gaze improves arousal prediction by 35 and valence prediction by 195 compared to using speech alone | [['affective', 'computing', 'research', 'traditionally', 'focused', 'on', 'labeling', 'a', 'persons', 'emotion', 'as', 'one', 'of', 'a', 'discrete', 'number', 'of', 'classes', 'eg', 'happy', 'or', 'sad', 'in', 'recent', 'times', 'more', 'attention', 'has', 'been', 'given', 'to', 'continuous', 'affect', 'prediction', 'across', 'dimensions', 'in', 'the', 'emotional', 'space', 'eg', 'arousal', 'and', 'valence', 'continuous', 'affect', 'prediction', 'is', 'the', 'task', 'of', 'predicting', 'a', 'numerical', 'value', 'for', 'different', 'emotion', 'dimensions', 'the', 'application', 'of', 'continuous', 'affect', 'prediction', 'is', 'powerful', 'in', 'domains', 'involving', 'realtime', 'audiovisual', 'communications', 'which', 'could', 'include', 'remote', 'or', 'assistive', 'technologies', 'for', 'psychological', 'assessment', 'of', 'subjects', 'modalities', 'used', 'for', 'continuous', 'affect', 'prediction', 'may', 'include', 'speech', 'facial', 'expressions', 'and', 'physiological', 'responses', 'as', 'opposed', 'to', 'single', 'modality', 'analysis', 'the', 'research', 'community', 'have', 'combined', 'multiple', 'modalities', 'to', 'improve', 'the', 'accuracy', 'of', 'continuous', 'affect', 'prediction', 'in', 'this', 'context', 'this', 'paper', 'investigates', 'a', 'continuous', 'affect', 'prediction', 'system', 'using', 'the', 'novel', 'combination', 'of', 'speech', 'and', 'eye', 'gaze', 'a', 'new', 'eye', 'gaze', 'feature', 'set', 'is', 'proposed', 'this', 'novel', 'approach', 'uses', 'open', 'source', 'software', 'for', 'realtime', 'affect', 'prediction', 'in', 'audiovisual', 'communication', 'environments', 'a', 'unique', 'advantage', 'of', 'the', 'humancomputer', 'interface', 'used', 'here', 'is', 'that', 'it', 'does', 'not', 'require', 'the', 'subject', 'to', 'wear', 'specialized', 'and', 'expensive', 'eyetracking', 'headsets', 'or', 'intrusive', 'devices', 'the', 'results', 'indicate', 'that', 'the', 'combination', 'of', 'speech', 'and', 'eye', 'gaze', 'improves', 'arousal', 'prediction', 'by', '35', 'and', 'valence', 'prediction', 'by', '195', 'compared', 'to', 'using', 'speech', 'alone']] | [-0.03806486979118307, 0.052704085253127336, -0.042204954280923294, 0.03957659225529318, -0.12098877480753732, -0.21067369266852942, 0.03827287621324002, 0.4436581918486842, -0.21297859897647328, -0.3244305664330669, 0.08248545231294378, -0.2875527582903117, -0.19577846938153487, 0.22308102917439235, -0.17482769762864336, 0.08938652236894187, 0.11385704679102034, 0.09392824316186037, -0.033857179810891265, -0.19321818301290883, 0.2610618804615957, 0.008543477158700288, 0.35546448406616776, 0.07742954329673753, 0.08473795635469557, 0.04191710136580729, -0.10274114994401182, -0.02544138949222677, -0.0204441519753918, 0.17300060852991278, 0.3563755409117288, 0.1982176990703145, 0.3443441615112264, -0.4268108615824194, -0.2575769479537687, 0.07230005136376282, 0.13643261110795452, 0.07147680855996441, -0.037156399608715286, -0.37786815133532164, 0.06303730035088612, -0.19182777991927988, 0.000944122612862783, -0.09763985507500668, 0.006881439302728891, -0.024338938153555825, -0.2942258111412499, 0.08253259160469666, 0.037693304279215495, 0.16327358436925957, -0.08990782863198817, -0.09772801932100535, 0.028367118597358326, 0.2670390065080331, 0.07283677242230624, 0.082513832875217, 0.18767108533507712, -0.20223073860203536, -0.15998568179256162, 0.3832760175983249, -0.03269349174311005, -0.2269971726151804, 0.2398378474075192, -0.05915394712765529, -0.14470849616487544, 0.0952176817011571, 0.2580568358966115, 0.08218517164156462, -0.14844531304293518, -0.011486556723226656, 0.0029754038507774196, 0.220052640411369, 0.0765290126480438, 0.016262939980219084, 0.21196039740856645, 0.22960472649342759, 0.004999502168545776, 0.10384960331915256, -0.08099345861733633, -0.033870426754691395, -0.18136689434807826, -0.14745446557410308, -0.16013243701847926, -0.02885273524339869, -0.0583830137681313, -0.1469553228558248, 0.41898658357483026, 0.20765781565299862, 0.13099737238587328, 0.06040627893889905, 0.3244910165840001, 0.04174272884908229, 0.08009407505462016, 0.018701307557219278, 0.18001327877088139, -0.04786686455729607, 0.17069778602173621, -0.19526763206684133, 0.14636521739939107, 0.03373078874709016] |
1,803.01663 | Defender-Attacker-Target Game: Open-Loop Solution | A defender-attacker-target problem with non-moving target is considered. This
problem is modeled by a pursuit-evasion zero-sum differential game with linear
dynamics and quadratic cost functional. In this game the pursuer is the
defender, while the evader is the attacker. The objective of the pursuer is to
minimize the cost functional, while the evader has two objectives: to maximize
the cost functional and to keep a given terminal state inequality constraint.
The open-loop saddle point solution of this game is obtained in the case where
the transfer functions of the controllers for the defender and the attacker are
of arbitrary orders. Then, this result is applied to the case of the first
order controllers for the defender and the attacker. Numerical illustrating
examples are presented.
| math.OC | a defenderattackertarget problem with nonmoving target is considered this problem is modeled by a pursuitevasion zerosum differential game with linear dynamics and quadratic cost functional in this game the pursuer is the defender while the evader is the attacker the objective of the pursuer is to minimize the cost functional while the evader has two objectives to maximize the cost functional and to keep a given terminal state inequality constraint the openloop saddle point solution of this game is obtained in the case where the transfer functions of the controllers for the defender and the attacker are of arbitrary orders then this result is applied to the case of the first order controllers for the defender and the attacker numerical illustrating examples are presented | [['a', 'defenderattackertarget', 'problem', 'with', 'nonmoving', 'target', 'is', 'considered', 'this', 'problem', 'is', 'modeled', 'by', 'a', 'pursuitevasion', 'zerosum', 'differential', 'game', 'with', 'linear', 'dynamics', 'and', 'quadratic', 'cost', 'functional', 'in', 'this', 'game', 'the', 'pursuer', 'is', 'the', 'defender', 'while', 'the', 'evader', 'is', 'the', 'attacker', 'the', 'objective', 'of', 'the', 'pursuer', 'is', 'to', 'minimize', 'the', 'cost', 'functional', 'while', 'the', 'evader', 'has', 'two', 'objectives', 'to', 'maximize', 'the', 'cost', 'functional', 'and', 'to', 'keep', 'a', 'given', 'terminal', 'state', 'inequality', 'constraint', 'the', 'openloop', 'saddle', 'point', 'solution', 'of', 'this', 'game', 'is', 'obtained', 'in', 'the', 'case', 'where', 'the', 'transfer', 'functions', 'of', 'the', 'controllers', 'for', 'the', 'defender', 'and', 'the', 'attacker', 'are', 'of', 'arbitrary', 'orders', 'then', 'this', 'result', 'is', 'applied', 'to', 'the', 'case', 'of', 'the', 'first', 'order', 'controllers', 'for', 'the', 'defender', 'and', 'the', 'attacker', 'numerical', 'illustrating', 'examples', 'are', 'presented']] | [-0.14794127176879202, -0.004848915432405666, -0.08537323903140982, 0.07982880347200132, -0.06859815593740744, -0.203117985585023, 0.07270730656952165, 0.3306658241852391, -0.33251417812898876, -0.32209291853525535, 0.11242186773106516, -0.32720979139572237, -0.14610164788763638, 0.0800366292488042, -0.14445157296864725, 0.10935146168131775, 0.019955663108910487, 0.09756841022914987, 0.04496319309053034, -0.3082534404153504, 0.3505443744484441, 0.02223104125880674, 0.1734184976212862, 0.019435653235854174, 0.1571865952564252, 0.013142029569310144, 0.06189669668295882, 0.037056721686347716, -0.10549186158364987, 0.07360758216544319, 0.34786645895460755, 0.15505491631347837, 0.39165957585522315, -0.4365892214473428, -0.16343542635705838, 0.14152684726381326, 0.041794249220047056, 0.09081497779343187, -0.01179549273678927, -0.2711767640496733, 0.1084381107806902, -0.15749491257517317, -0.07770034176774504, 0.013935507496637179, -0.015212878906660206, 0.037934315874529015, -0.3527485692979601, -0.05165976490371111, 0.01365394126510293, 0.018630430663602683, -0.08648952520338864, -0.05964343670407325, -0.030438656721839576, 0.18541894038775708, 0.05900096037894548, 0.0444891617057951, 0.14304844228308497, -0.13461146204982224, -0.13509341290341767, 0.37805863057179906, -0.0019715142339786014, -0.23455413403670963, 0.1185432002024074, -0.08777256490571833, -0.05127160762232251, 0.11169384282491193, 0.16432488446192042, 0.1683754176128565, -0.16779110430005362, 0.09517096073699857, -0.0327248577808401, 0.15956801847423185, 0.03767044457599399, -0.013673997957380564, 0.08947812453124339, 0.1871833205185225, 0.2370661574920329, 0.16698731309014972, -0.015128046789062701, -0.17970467128268466, -0.30903956278916295, -0.14678157390496596, -0.18717011279328083, -0.009170237535845518, -0.062294562461282454, -0.08282468458107574, 0.3855997255238576, 0.10092522341727726, 0.12100973694274823, 0.10968240370171342, 0.3714557044904649, 0.18286430287530753, -0.009384870620035544, 0.10132723575461716, 0.24313577334207248, 0.0709277553880413, 0.10344063019667699, -0.2719979532218228, 0.1403780480642326, 0.0668776457621981] |
1,803.01664 | Adjoint functor theorems for $\infty$-categories | Adjoint functor theorems give necessary and sufficient conditions for a
functor to admit an adjoint. In this paper we prove general adjoint functor
theorems for functors between $\infty$-categories. One of our main results is
an $\infty$-categorical generalization of Freyd's classical General Adjoint
Functor Theorem. As an application of this result, we recover Lurie's adjoint
functor theorems for presentable $\infty$-categories. We also discuss the
comparison between adjunctions of $\infty$-categories and homotopy adjunctions,
and give a treatment of Brown representability for $\infty$-categories based on
Heller's purely categorical formulation of the classical Brown representability
theorem.
| math.CT math.AT | adjoint functor theorems give necessary and sufficient conditions for a functor to admit an adjoint in this paper we prove general adjoint functor theorems for functors between inftycategories one of our main results is an inftycategorical generalization of freyds classical general adjoint functor theorem as an application of this result we recover luries adjoint functor theorems for presentable inftycategories we also discuss the comparison between adjunctions of inftycategories and homotopy adjunctions and give a treatment of brown representability for inftycategories based on hellers purely categorical formulation of the classical brown representability theorem | [['adjoint', 'functor', 'theorems', 'give', 'necessary', 'and', 'sufficient', 'conditions', 'for', 'a', 'functor', 'to', 'admit', 'an', 'adjoint', 'in', 'this', 'paper', 'we', 'prove', 'general', 'adjoint', 'functor', 'theorems', 'for', 'functors', 'between', 'inftycategories', 'one', 'of', 'our', 'main', 'results', 'is', 'an', 'inftycategorical', 'generalization', 'of', 'freyds', 'classical', 'general', 'adjoint', 'functor', 'theorem', 'as', 'an', 'application', 'of', 'this', 'result', 'we', 'recover', 'luries', 'adjoint', 'functor', 'theorems', 'for', 'presentable', 'inftycategories', 'we', 'also', 'discuss', 'the', 'comparison', 'between', 'adjunctions', 'of', 'inftycategories', 'and', 'homotopy', 'adjunctions', 'and', 'give', 'a', 'treatment', 'of', 'brown', 'representability', 'for', 'inftycategories', 'based', 'on', 'hellers', 'purely', 'categorical', 'formulation', 'of', 'the', 'classical', 'brown', 'representability', 'theorem']] | [-0.08144926618399989, -0.027152127612403685, -0.1819631097909144, 0.20286448154998335, -0.1564115800302597, -0.16617598183169638, 0.023324586449788236, 0.3268829149234554, -0.38687389550487633, -0.16922921337106306, 0.043485517169440005, -0.12366867616615111, -0.12949444132897517, 0.16548056525947608, -0.3407812438318101, -0.09260300569155294, 0.1020199075434863, 0.05595422759348446, -0.071637340851695, -0.2207302221795544, 0.4533686391989012, -0.08877493161708117, 0.20543582981083644, 0.11235588810244657, 0.11458515504415592, 0.020330169747467153, -0.04122106554037284, -0.11339258848001128, -0.19060039089020828, 0.1291530394784944, 0.39732476811775047, 0.09908347964823327, 0.20546947632227902, -0.3993724675889572, -0.013012228472887175, 0.16736627389606007, 0.04368454893119633, 0.040345187281396334, -0.02331105583858595, -0.3606640479385691, 0.15252277673267678, -0.25185618715603714, -0.11305721427071029, -0.1646585811091506, 0.03281321847791095, -0.004186489829368404, -0.3002563869610996, -0.01155706730882546, 0.22712896212571018, 0.17696161865862212, -0.1652078324392357, -0.05025190860286112, -0.05208257243857193, 0.08008534925244495, -0.015063656182736968, -0.008595546737880162, 0.11347856463196324, -0.09971976618829143, -0.18196228134405354, 0.35032264483363734, -0.09707603993339707, -0.16005733229584343, 0.18904337801454266, -0.020422146240573213, -0.21400556397502837, 0.0366356232173174, -0.07726664564815229, 0.23128973512464893, -0.05721595825667938, 0.20210496174062745, -0.19468367488487906, 0.02261284020040994, 0.16413729743141195, 0.0733929508449206, 0.12662242755101508, 0.09525373563709487, 0.08459370148509902, 0.1722952670787218, 0.09446209180421884, -0.08216930715033137, -0.398196316688605, -0.22505074530920904, 0.004381902799334215, 0.13553569167245016, -0.10788945642596683, -0.19676648169431998, 0.33650129167970433, 0.19074753778556403, 0.07301324881289316, 0.2751327987567967, 0.3135931356202649, 0.0622334944042529, -0.02578161435161272, -0.07953471174139691, 0.16680646054041776, 0.43887100504387333, 0.03435301268979421, -0.0149287845010606, -0.10950969433938355, 0.3875974933869894] |
1,803.01665 | On the length of post-model-selection confidence intervals conditional
on polyhedral constraints | Valid inference after model selection is currently a very active area of
research. The polyhedral method, pioneered by Lee, et al. (2016), allows for
valid inference after model selection if the model selection event can be
described by polyhedral constraints. In that reference, the method is
exemplified by constructing two valid confidence intervals when the Lasso
estimator is used to select a model. We here study the length of these
intervals. For one of these confidence intervals, which is easier to compute,
we find that its expected length is always infinite. For the other of these
confidence intervals, whose computation is more demanding, we give a necessary
and sufficient condition for its expected length to be infinite. In
simulations, we find that this sufficient condition is typically satisfied,
unless the selected model includes almost all or almost none of the available
regressors. For the distribution of confidence interval length, we find that
the $\kappa$-quantiles behave like $1/(1-\kappa)$ for $\kappa$ close to $1$.
Our results can also be used to analyze other confidence intervals that are
based on the polyhedral method.
| math.ST stat.TH | valid inference after model selection is currently a very active area of research the polyhedral method pioneered by lee et al 2016 allows for valid inference after model selection if the model selection event can be described by polyhedral constraints in that reference the method is exemplified by constructing two valid confidence intervals when the lasso estimator is used to select a model we here study the length of these intervals for one of these confidence intervals which is easier to compute we find that its expected length is always infinite for the other of these confidence intervals whose computation is more demanding we give a necessary and sufficient condition for its expected length to be infinite in simulations we find that this sufficient condition is typically satisfied unless the selected model includes almost all or almost none of the available regressors for the distribution of confidence interval length we find that the kappaquantiles behave like 11kappa for kappa close to 1 our results can also be used to analyze other confidence intervals that are based on the polyhedral method | [['valid', 'inference', 'after', 'model', 'selection', 'is', 'currently', 'a', 'very', 'active', 'area', 'of', 'research', 'the', 'polyhedral', 'method', 'pioneered', 'by', 'lee', 'et', 'al', '2016', 'allows', 'for', 'valid', 'inference', 'after', 'model', 'selection', 'if', 'the', 'model', 'selection', 'event', 'can', 'be', 'described', 'by', 'polyhedral', 'constraints', 'in', 'that', 'reference', 'the', 'method', 'is', 'exemplified', 'by', 'constructing', 'two', 'valid', 'confidence', 'intervals', 'when', 'the', 'lasso', 'estimator', 'is', 'used', 'to', 'select', 'a', 'model', 'we', 'here', 'study', 'the', 'length', 'of', 'these', 'intervals', 'for', 'one', 'of', 'these', 'confidence', 'intervals', 'which', 'is', 'easier', 'to', 'compute', 'we', 'find', 'that', 'its', 'expected', 'length', 'is', 'always', 'infinite', 'for', 'the', 'other', 'of', 'these', 'confidence', 'intervals', 'whose', 'computation', 'is', 'more', 'demanding', 'we', 'give', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'its', 'expected', 'length', 'to', 'be', 'infinite', 'in', 'simulations', 'we', 'find', 'that', 'this', 'sufficient', 'condition', 'is', 'typically', 'satisfied', 'unless', 'the', 'selected', 'model', 'includes', 'almost', 'all', 'or', 'almost', 'none', 'of', 'the', 'available', 'regressors', 'for', 'the', 'distribution', 'of', 'confidence', 'interval', 'length', 'we', 'find', 'that', 'the', 'kappaquantiles', 'behave', 'like', '11kappa', 'for', 'kappa', 'close', 'to', '1', 'our', 'results', 'can', 'also', 'be', 'used', 'to', 'analyze', 'other', 'confidence', 'intervals', 'that', 'are', 'based', 'on', 'the', 'polyhedral', 'method']] | [-0.08212626953229957, 0.10336031343296087, -0.09701083258600131, 0.1292347872009752, -0.07874669425262745, -0.16961772943156236, 0.06995144046338149, 0.4124872364899081, -0.22311997620305152, -0.31693004886881354, 0.13607068441080955, -0.2260219830447537, -0.10433883130618403, 0.23538770333058043, -0.05362568064471785, 0.05691025884798466, 0.06497289483524399, 0.0475210429252952, -0.033843182864483824, -0.3067371351225825, 0.24707937747595854, 0.08881715082908782, 0.2545396507602562, 0.015400736124432657, 0.08727859347676753, 0.026639783815114518, -0.033111419117999044, 0.05440974273206143, -0.1667302268334639, 0.11885638559613837, 0.25550259446746176, 0.1584967327947739, 0.286888356812055, -0.35629553758549726, -0.182587339799999, 0.11218336193424681, 0.13563659269800227, 0.09562561285254949, 0.027119311159643413, -0.23035272104100565, 0.12677426719410198, -0.14718235025932525, -0.12028421232675653, -0.07622062606381232, 0.03874710748911302, -0.007940274180603748, -0.3235860897455066, 0.09146034165682516, 0.07149503750496367, 0.008766642075785425, -0.03263412275138374, -0.11678475752509503, -0.021355251994852522, 0.09556373437814901, 0.034545952091228974, 0.002094402051860404, 0.07855227863248647, -0.049017749050517014, -0.09246345783133855, 0.3500972878125109, -0.03909757260358735, -0.2347750092301978, 0.17836746677428972, -0.12151246866096188, -0.1579748832508189, 0.11815152080269174, 0.1444167386801924, 0.1440039080674917, -0.16997521208885996, 0.07696733180551399, -0.05538666104045016, 0.16093155629723593, 0.058969795714352236, -0.017744847871572447, 0.19346740314464891, 0.1606188256364169, 0.09721120467587385, 0.1203720719197744, -0.10393011245321943, -0.07168655510987888, -0.35074183857591634, -0.10577061610673083, -0.17989185132842322, -0.010891055868771137, -0.08614427366369506, -0.18393816706839572, 0.35164963233996227, 0.20767253968508892, 0.2036633527460979, 0.11681873117523854, 0.24861183832661155, 0.12865064275880042, 0.05185500682551372, 0.10430098081980779, 0.22405533282755968, 0.05652719417592155, -0.034099972924594296, -0.13327245765595874, 0.09961571169525302, 0.0625890762534704] |
1,803.01666 | Searching for MOND in scalar-tensor theories of gravity | In this paper, I study spherically symmetric solutions in a simple class of
geometric sigma models of the Universe. This class of models is a subclass of
the wider class of scalar-tensor theories of gravity. The purpose of this work
is to examine how the additional scalar degree of freedom modifies Newtonian
gravitational force. The general solution for spherically symmetric metric far
from the point source is obtained in a weak field approximation. As it turns
out, it is parametrized by the mass of the source, and an additional function
of time. One particular model is examined as an example. It is shown that there
are solutions that accommodate MOND regime at some distances from the source.
Unfortunately, the obtained interval of distances turns out to be smaller than
it is needed. An additional analysis shows that genuine MOND, that explains
galactic curves of all nearby galaxies, cannot be obtained.
| gr-qc | in this paper i study spherically symmetric solutions in a simple class of geometric sigma models of the universe this class of models is a subclass of the wider class of scalartensor theories of gravity the purpose of this work is to examine how the additional scalar degree of freedom modifies newtonian gravitational force the general solution for spherically symmetric metric far from the point source is obtained in a weak field approximation as it turns out it is parametrized by the mass of the source and an additional function of time one particular model is examined as an example it is shown that there are solutions that accommodate mond regime at some distances from the source unfortunately the obtained interval of distances turns out to be smaller than it is needed an additional analysis shows that genuine mond that explains galactic curves of all nearby galaxies cannot be obtained | [['in', 'this', 'paper', 'i', 'study', 'spherically', 'symmetric', 'solutions', 'in', 'a', 'simple', 'class', 'of', 'geometric', 'sigma', 'models', 'of', 'the', 'universe', 'this', 'class', 'of', 'models', 'is', 'a', 'subclass', 'of', 'the', 'wider', 'class', 'of', 'scalartensor', 'theories', 'of', 'gravity', 'the', 'purpose', 'of', 'this', 'work', 'is', 'to', 'examine', 'how', 'the', 'additional', 'scalar', 'degree', 'of', 'freedom', 'modifies', 'newtonian', 'gravitational', 'force', 'the', 'general', 'solution', 'for', 'spherically', 'symmetric', 'metric', 'far', 'from', 'the', 'point', 'source', 'is', 'obtained', 'in', 'a', 'weak', 'field', 'approximation', 'as', 'it', 'turns', 'out', 'it', 'is', 'parametrized', 'by', 'the', 'mass', 'of', 'the', 'source', 'and', 'an', 'additional', 'function', 'of', 'time', 'one', 'particular', 'model', 'is', 'examined', 'as', 'an', 'example', 'it', 'is', 'shown', 'that', 'there', 'are', 'solutions', 'that', 'accommodate', 'mond', 'regime', 'at', 'some', 'distances', 'from', 'the', 'source', 'unfortunately', 'the', 'obtained', 'interval', 'of', 'distances', 'turns', 'out', 'to', 'be', 'smaller', 'than', 'it', 'is', 'needed', 'an', 'additional', 'analysis', 'shows', 'that', 'genuine', 'mond', 'that', 'explains', 'galactic', 'curves', 'of', 'all', 'nearby', 'galaxies', 'can', 'not', 'be', 'obtained']] | [-0.12989184697581121, 0.07141283514478863, -0.11187952321133768, 0.10996213186507588, -0.08675542866983851, -0.1451744689137385, -0.02400872970249701, 0.34103054369472907, -0.23643744935201394, -0.2788690858094996, 0.0554798082471671, -0.24502059494126713, -0.139794864771974, 0.21507636130639407, -0.03520896356700864, -0.02086083393617971, 0.02029646427327434, 0.049004711075809275, -0.0597829036318253, -0.24086714982493035, 0.35967305996486093, 0.07055406366777144, 0.19644334642154887, 0.005771567918967752, 0.08598325244885012, -0.05959843350759405, -0.01799491054643661, 0.07198219141299954, -0.11878619162116773, 0.04698735254119761, 0.21103833004469338, 0.1404481598280913, 0.24766463519918996, -0.3455126619996466, -0.2548966568004994, 0.1518142366202067, 0.1269187251913873, 0.14681052741292394, -0.040191977052018046, -0.25736479395815476, 0.0910223913841591, -0.16899538685851775, -0.20073331289597793, -0.037264458224522755, 0.04365209285678675, -0.0012860102625255356, -0.23552216352919572, 0.07306309917861509, 0.0858313020331082, 0.01805515197531277, -0.058426313866269064, -0.08632537438179558, -0.002080579201956064, 0.07041926170076361, 0.10251548338376158, 0.0855641484997599, 0.09755319781256037, -0.14741286663924474, -0.03374043152442461, 0.43665019152624324, -0.06711913143727537, -0.20465857140867916, 0.1671761927466272, -0.14795389616652238, -0.13799750455500964, 0.11301374390554793, 0.12444853335804004, 0.17832238529037858, -0.20589981758920783, 0.13190068925587486, -0.07489790777916348, 0.1808221731853397, 0.060489242054546706, 0.024020213557064952, 0.2677741129851795, 0.11106506581048155, 0.0653246051588694, 0.13989731624941434, -0.05787918611509812, -0.12306141118451164, -0.3581668605776627, -0.12169105400537936, -0.169508087895163, 0.08440622241810251, -0.11814615852189858, -0.14678461167445586, 0.3724546341953293, 0.12512558665271503, 0.14722562224190955, 0.06656464813307963, 0.23626926711556928, 0.11744905790446684, 0.0753960120399168, 0.07882450055639377, 0.3063250537632135, 0.1138717479054008, 0.052648835696761084, -0.18121440156628163, 0.024888388565833995, 0.04125777782451374] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.