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.07867
|
Transit Photometry as an Exoplanet Discovery Method
|
Photometry with the transit method has arguably been the most successful
exoplanet discovery method to date. A short overview about the rise of that
method to its present status is given. The method's strength is the rich set of
parameters that can be obtained from transiting planets, in particular in
combination with radial velocity observations; the basic principles of these
parameters are given, with explicit formulations for the transit detection
probability and the times of transit epochs in comparison to radial velocity
epochs. The transit method has however also drawbacks, which are the low
probability of properly aligned planet systems and the presence of
astrophysical phenomena that may mimic transits and give rise to false
detection positives. In the second part, we outline the main factors that
determine the design of transit surveys, such as the size of the survey sample,
the temporal coverage, the photometric precision, the sample brightness and the
methods to extract transit events from observed light curves. Lastly, an
overview over past, current, and future transit surveys is given. For these
surveys we indicate their basic instrument configuration and their planet
catch, including the ranges of planet sizes and stellar magnitudes that were
encountered. Current and future transit detection experiments concentrate
primarily on bright or special targets, and we expect that the transit method
remains a principal driver of exoplanet science, through new discoveries to be
made and through the development of new generations of instruments.
|
astro-ph.EP
|
photometry with the transit method has arguably been the most successful exoplanet discovery method to date a short overview about the rise of that method to its present status is given the methods strength is the rich set of parameters that can be obtained from transiting planets in particular in combination with radial velocity observations the basic principles of these parameters are given with explicit formulations for the transit detection probability and the times of transit epochs in comparison to radial velocity epochs the transit method has however also drawbacks which are the low probability of properly aligned planet systems and the presence of astrophysical phenomena that may mimic transits and give rise to false detection positives in the second part we outline the main factors that determine the design of transit surveys such as the size of the survey sample the temporal coverage the photometric precision the sample brightness and the methods to extract transit events from observed light curves lastly an overview over past current and future transit surveys is given for these surveys we indicate their basic instrument configuration and their planet catch including the ranges of planet sizes and stellar magnitudes that were encountered current and future transit detection experiments concentrate primarily on bright or special targets and we expect that the transit method remains a principal driver of exoplanet science through new discoveries to be made and through the development of new generations of instruments
|
[['photometry', 'with', 'the', 'transit', 'method', 'has', 'arguably', 'been', 'the', 'most', 'successful', 'exoplanet', 'discovery', 'method', 'to', 'date', 'a', 'short', 'overview', 'about', 'the', 'rise', 'of', 'that', 'method', 'to', 'its', 'present', 'status', 'is', 'given', 'the', 'methods', 'strength', 'is', 'the', 'rich', 'set', 'of', 'parameters', 'that', 'can', 'be', 'obtained', 'from', 'transiting', 'planets', 'in', 'particular', 'in', 'combination', 'with', 'radial', 'velocity', 'observations', 'the', 'basic', 'principles', 'of', 'these', 'parameters', 'are', 'given', 'with', 'explicit', 'formulations', 'for', 'the', 'transit', 'detection', 'probability', 'and', 'the', 'times', 'of', 'transit', 'epochs', 'in', 'comparison', 'to', 'radial', 'velocity', 'epochs', 'the', 'transit', 'method', 'has', 'however', 'also', 'drawbacks', 'which', 'are', 'the', 'low', 'probability', 'of', 'properly', 'aligned', 'planet', 'systems', 'and', 'the', 'presence', 'of', 'astrophysical', 'phenomena', 'that', 'may', 'mimic', 'transits', 'and', 'give', 'rise', 'to', 'false', 'detection', 'positives', 'in', 'the', 'second', 'part', 'we', 'outline', 'the', 'main', 'factors', 'that', 'determine', 'the', 'design', 'of', 'transit', 'surveys', 'such', 'as', 'the', 'size', 'of', 'the', 'survey', 'sample', 'the', 'temporal', 'coverage', 'the', 'photometric', 'precision', 'the', 'sample', 'brightness', 'and', 'the', 'methods', 'to', 'extract', 'transit', 'events', 'from', 'observed', 'light', 'curves', 'lastly', 'an', 'overview', 'over', 'past', 'current', 'and', 'future', 'transit', 'surveys', 'is', 'given', 'for', 'these', 'surveys', 'we', 'indicate', 'their', 'basic', 'instrument', 'configuration', 'and', 'their', 'planet', 'catch', 'including', 'the', 'ranges', 'of', 'planet', 'sizes', 'and', 'stellar', 'magnitudes', 'that', 'were', 'encountered', 'current', 'and', 'future', 'transit', 'detection', 'experiments', 'concentrate', 'primarily', 'on', 'bright', 'or', 'special', 'targets', 'and', 'we', 'expect', 'that', 'the', 'transit', 'method', 'remains', 'a', 'principal', 'driver', 'of', 'exoplanet', 'science', 'through', 'new', 'discoveries', 'to', 'be', 'made', 'and', 'through', 'the', 'development', 'of', 'new', 'generations', 'of', 'instruments']]
|
[-0.0808173499557597, 0.08874869774645049, -0.08537204238479414, 0.029812235381784073, -0.12877610868308692, -0.10398254411217446, 0.05311953331959861, 0.38413194050857175, -0.20074718342948472, -0.36671121502683185, 0.1470308861612769, -0.30125193466374184, -0.1287519268623631, 0.24757995882052153, -0.08741775112963902, 0.04873416458940483, 0.14155205356267592, -0.027996138165084023, -0.02692947048538675, -0.310547703493891, 0.2544619281611328, 0.055667362515426554, 0.15509084009778842, 0.015769741927821695, 0.06360423034833124, -0.016311291941625918, -0.11819371461169795, -0.011895060217163215, -0.17502527238848414, 0.08693729067357102, 0.25033851779686905, 0.1949465252410543, 0.21493232261467105, -0.36663563400864707, -0.22179105848966477, 0.08223900986098064, 0.13171879871709583, 0.09280519065335587, -0.03710448020671417, -0.3020338695535126, 0.059704232677662124, -0.13981894936490183, -0.15983750486921053, -0.03863462119673689, 0.0732758843107149, 0.07129109987048045, -0.22631421414747213, 0.04391422977702556, 0.00223192426104409, 0.11836530734896465, -0.10316553536637608, -0.14611259984085337, -0.011461429282401998, 0.13156853728869464, 0.059264154259775145, 0.014574089867528528, 0.1067355545780932, -0.13780494830959167, -0.09411940741896009, 0.3808883647977685, -0.09172383975916697, -0.05054499808854113, 0.21191182730641836, -0.17427953402633042, -0.1413578954699915, 0.13242050706079075, 0.2144719573649733, 0.11382615375575066, -0.16206871605245396, -0.01607852637862379, 0.018950903725635727, 0.16644632274789425, 0.048135019252852844, 0.07230186169423784, 0.3412482328596525, 0.1566151566619131, 0.08310275044156394, 0.050960699282101514, -0.2420448146032868, -0.04523866504508381, -0.25988405967364087, -0.13042211649008095, -0.14609801563201472, 0.013737676957195315, -0.05871196938035913, -0.1199059360359873, 0.4364811247292285, 0.2126836435602551, 0.17267993659576555, 0.04915802255903448, 0.346267021757861, 0.08867618322359097, 0.09814809949796957, 0.029060586894047447, 0.29302400020727265, 0.09172426028041324, 0.0872231482824039, -0.19654350320646094, 0.12644543240894562, -0.010012909894188245]
|
1,803.07868
|
Scalable Generalized Dynamic Topic Models
|
Dynamic topic models (DTMs) model the evolution of prevalent themes in
literature, online media, and other forms of text over time. DTMs assume that
word co-occurrence statistics change continuously and therefore impose
continuous stochastic process priors on their model parameters. These dynamical
priors make inference much harder than in regular topic models, and also limit
scalability. In this paper, we present several new results around DTMs. First,
we extend the class of tractable priors from Wiener processes to the generic
class of Gaussian processes (GPs). This allows us to explore topics that
develop smoothly over time, that have a long-term memory or are temporally
concentrated (for event detection). Second, we show how to perform scalable
approximate inference in these models based on ideas around stochastic
variational inference and sparse Gaussian processes. This way we can train a
rich family of DTMs to massive data. Our experiments on several large-scale
datasets show that our generalized model allows us to find interesting patterns
that were not accessible by previous approaches.
|
stat.ML cs.LG
|
dynamic topic models dtms model the evolution of prevalent themes in literature online media and other forms of text over time dtms assume that word cooccurrence statistics change continuously and therefore impose continuous stochastic process priors on their model parameters these dynamical priors make inference much harder than in regular topic models and also limit scalability in this paper we present several new results around dtms first we extend the class of tractable priors from wiener processes to the generic class of gaussian processes gps this allows us to explore topics that develop smoothly over time that have a longterm memory or are temporally concentrated for event detection second we show how to perform scalable approximate inference in these models based on ideas around stochastic variational inference and sparse gaussian processes this way we can train a rich family of dtms to massive data our experiments on several largescale datasets show that our generalized model allows us to find interesting patterns that were not accessible by previous approaches
|
[['dynamic', 'topic', 'models', 'dtms', 'model', 'the', 'evolution', 'of', 'prevalent', 'themes', 'in', 'literature', 'online', 'media', 'and', 'other', 'forms', 'of', 'text', 'over', 'time', 'dtms', 'assume', 'that', 'word', 'cooccurrence', 'statistics', 'change', 'continuously', 'and', 'therefore', 'impose', 'continuous', 'stochastic', 'process', 'priors', 'on', 'their', 'model', 'parameters', 'these', 'dynamical', 'priors', 'make', 'inference', 'much', 'harder', 'than', 'in', 'regular', 'topic', 'models', 'and', 'also', 'limit', 'scalability', 'in', 'this', 'paper', 'we', 'present', 'several', 'new', 'results', 'around', 'dtms', 'first', 'we', 'extend', 'the', 'class', 'of', 'tractable', 'priors', 'from', 'wiener', 'processes', 'to', 'the', 'generic', 'class', 'of', 'gaussian', 'processes', 'gps', 'this', 'allows', 'us', 'to', 'explore', 'topics', 'that', 'develop', 'smoothly', 'over', 'time', 'that', 'have', 'a', 'longterm', 'memory', 'or', 'are', 'temporally', 'concentrated', 'for', 'event', 'detection', 'second', 'we', 'show', 'how', 'to', 'perform', 'scalable', 'approximate', 'inference', 'in', 'these', 'models', 'based', 'on', 'ideas', 'around', 'stochastic', 'variational', 'inference', 'and', 'sparse', 'gaussian', 'processes', 'this', 'way', 'we', 'can', 'train', 'a', 'rich', 'family', 'of', 'dtms', 'to', 'massive', 'data', 'our', 'experiments', 'on', 'several', 'largescale', 'datasets', 'show', 'that', 'our', 'generalized', 'model', 'allows', 'us', 'to', 'find', 'interesting', 'patterns', 'that', 'were', 'not', 'accessible', 'by', 'previous', 'approaches']]
|
[-0.025826925560804306, 0.06402856794219199, -0.10102156625084933, 0.10585235516855175, -0.15897163420560814, -0.13030801075191925, 0.0648670464226078, 0.4466598003526174, -0.2889398808696396, -0.3021391179978049, 0.09851736228890895, -0.24297605045094747, -0.1900628407571016, 0.21028130847151347, -0.05949082165690405, 0.06298852198302657, 0.08879078614215057, 0.02577313902189157, -0.06528067691778276, -0.26378725324424784, 0.3216049147082404, 0.04040945721776336, 0.29161064945427434, -0.03699618660556596, 0.08197584670727208, -0.02799379273173621, -0.09388485080922865, -0.01783355341328951, -0.13767415281476825, 0.15582181347833415, 0.27971596144975375, 0.18226496778550513, 0.3120928773728554, -0.4372776749189056, -0.2901890639304405, 0.11743198311610502, 0.15583986098222558, 0.10771596109363946, -0.018016088018720483, -0.30071965793502475, 0.05370952071998978, -0.18356040589112257, -0.039688644922404946, -0.15348484145943075, 0.0021440260586262283, 0.015873885882597062, -0.2672388076482873, 0.09328040033783293, 0.10170253551855456, 0.0014184135555600126, -0.025042443525827757, -0.09611075257305943, 0.04933699916901311, 0.09196239351045474, 0.0420429719744702, -0.021605074766003304, 0.11629712228508045, -0.10760449089520123, -0.15727251437298642, 0.3322655454709699, -0.07419835778420661, -0.21236495604638808, 0.23602211230484368, -0.1153046913927288, -0.2238932662017067, 0.08966717576064791, 0.2693381088652781, 0.15208179953264161, -0.19120751902283656, 0.06110553950392863, -0.04790116138922583, 0.18367660812856185, 0.023843603523259628, -0.0060754963605653585, 0.19344291563556043, 0.17856198686474403, 0.05520581565603303, 0.11918799551321649, -0.08778570793774201, -0.14989104082009622, -0.2270354287188855, -0.07635870087099084, -0.11755463881473545, -7.615627024885423e-05, -0.1007295524835908, -0.18444570644004715, 0.39263744286671726, 0.2789638053370817, 0.20040228401748686, 0.12228710273657703, 0.26631698195290354, 0.053370501509302164, 0.05343968252002794, 0.1022581755948652, 0.14944005338059338, 0.06077656138777023, 0.12340010556397915, -0.09412314974681413, 0.08061074707629381, -0.0040352892260887615]
|
1,803.07869
|
Nucleation at quantized vortices and the heterogeneous phase separation
in supersaturated superfluid 3He-4He liquid mixtures
|
Supersaturated superfluid 3He-4He liquid mixture, separating into the
3He-concentrated c-phase and 3He-diluted d-phase, represents a unique
possibility for studying macroscopic quantum nucleation and quantum
phase-separation kinetics in binary mixtures at low temperatures down to
absolute zero. One of possible heterogeneous mechanisms for the phase
separation of supersaturated d-phase is associated with superfluidity of this
phase and with a possible existence of quantized vortices playing a role of
nucleation sites for the c-phase of liquid mixture. We analyze the growth
dynamics of vortex core filled with the c-phase and determine the temperature
behavior of c-phase nucleation rate and the crossover temperature between the
classical and quantum nucleation mechanisms.
|
cond-mat.other
|
supersaturated superfluid 3he4he liquid mixture separating into the 3heconcentrated cphase and 3hediluted dphase represents a unique possibility for studying macroscopic quantum nucleation and quantum phaseseparation kinetics in binary mixtures at low temperatures down to absolute zero one of possible heterogeneous mechanisms for the phase separation of supersaturated dphase is associated with superfluidity of this phase and with a possible existence of quantized vortices playing a role of nucleation sites for the cphase of liquid mixture we analyze the growth dynamics of vortex core filled with the cphase and determine the temperature behavior of cphase nucleation rate and the crossover temperature between the classical and quantum nucleation mechanisms
|
[['supersaturated', 'superfluid', '3he4he', 'liquid', 'mixture', 'separating', 'into', 'the', '3heconcentrated', 'cphase', 'and', '3hediluted', 'dphase', 'represents', 'a', 'unique', 'possibility', 'for', 'studying', 'macroscopic', 'quantum', 'nucleation', 'and', 'quantum', 'phaseseparation', 'kinetics', 'in', 'binary', 'mixtures', 'at', 'low', 'temperatures', 'down', 'to', 'absolute', 'zero', 'one', 'of', 'possible', 'heterogeneous', 'mechanisms', 'for', 'the', 'phase', 'separation', 'of', 'supersaturated', 'dphase', 'is', 'associated', 'with', 'superfluidity', 'of', 'this', 'phase', 'and', 'with', 'a', 'possible', 'existence', 'of', 'quantized', 'vortices', 'playing', 'a', 'role', 'of', 'nucleation', 'sites', 'for', 'the', 'cphase', 'of', 'liquid', 'mixture', 'we', 'analyze', 'the', 'growth', 'dynamics', 'of', 'vortex', 'core', 'filled', 'with', 'the', 'cphase', 'and', 'determine', 'the', 'temperature', 'behavior', 'of', 'cphase', 'nucleation', 'rate', 'and', 'the', 'crossover', 'temperature', 'between', 'the', 'classical', 'and', 'quantum', 'nucleation', 'mechanisms']]
|
[-0.12051686130109288, 0.3082131857451584, -0.08996159169556839, 0.00345021424194177, 0.031706588012388064, -0.1819499371706375, 0.13525444449679483, 0.30280976472422483, -0.2666093821992122, -0.24384665218669743, 0.05166998439457356, -0.2592572001651639, -0.06014985091806877, 0.1304334746851098, 0.06473469728870052, 0.028699242208330405, -0.07471375878279408, -0.021559037315282262, -0.07662355088340563, -0.2200289537686677, 0.2927980754879259, 0.01840930805608098, 0.34477882151092804, 0.0579142776096151, 0.1055589291267097, -0.04021428797527083, 0.09606728322715277, -0.02387403639122134, -0.22933275947081191, -0.003300890773451621, 0.264981206819149, -0.01381472669807928, 0.19028809969978674, -0.45420467035756223, -0.2074440285253028, 0.10140785813508998, 0.11553915462323598, 0.16393920505375026, -0.08845331722072193, -0.23530383136322988, -0.0038938993055905612, -0.12841740229743578, -0.17051144733573198, -0.06783429069244969, 0.03548508819547438, 0.0038917660092314082, -0.22168104510887393, 0.1510415613030394, 0.07582568409187453, 0.05492752363816613, -0.09974341507823695, -0.07867605720779726, -0.018646189832084235, 0.10108587649163037, -0.037212711761129044, -0.0004140776759457021, 0.2020308568053657, -0.18027993369226655, -0.09855855518419827, 0.37411226200028547, -0.05337441629353201, -0.06912078083980651, 0.24799551137146494, -0.15135440476061332, -0.03802329797652506, 0.22197905853390693, 0.12273376541921781, 0.07170909350471837, -0.08072814388821523, -0.020706828777578526, 0.043160855648152176, 0.17736698416106048, 0.09553837002742858, 0.01868148147172871, 0.3217536975585279, 0.2984464051113242, -0.002180539248954682, 0.20849924796493724, -0.13463881962234153, -0.21806029966211923, -0.27304506603451, -0.2367091232955101, -0.17356256546363943, 0.035951618907884474, -0.10846978981585596, -0.2078415936169525, 0.32515544685579484, 0.08414584619070714, 0.14890663390507966, -0.03342828120858896, 0.21239662995961095, 0.03237336292153313, -0.010301105203550487, 0.007424381725667488, 0.19407208498035158, 0.19703397044823284, 0.09949390256910452, -0.33610760378429577, 0.08816785575555904, 0.05402783358558303]
|
1,803.0787
|
Reservoir computing approaches for representation and classification of
multivariate time series
|
Classification of multivariate time series (MTS) has been tackled with a
large variety of methodologies and applied to a wide range of scenarios.
Reservoir Computing (RC) provides efficient tools to generate a vectorial,
fixed-size representation of the MTS that can be further processed by standard
classifiers. Despite their unrivaled training speed, MTS classifiers based on a
standard RC architecture fail to achieve the same accuracy of fully trainable
neural networks. In this paper we introduce the reservoir model space, an
unsupervised approach based on RC to learn vectorial representations of MTS.
Each MTS is encoded within the parameters of a linear model trained to predict
a low-dimensional embedding of the reservoir dynamics. Compared to other RC
methods, our model space yields better representations and attains comparable
computational performance, thanks to an intermediate dimensionality reduction
procedure. As a second contribution we propose a modular RC framework for MTS
classification, with an associated open-source Python library. The framework
provides different modules to seamlessly implement advanced RC architectures.
The architectures are compared to other MTS classifiers, including deep
learning models and time series kernels. Results obtained on benchmark and
real-world MTS datasets show that RC classifiers are dramatically faster and,
when implemented using our proposed representation, also achieve superior
classification accuracy.
|
cs.NE
|
classification of multivariate time series mts has been tackled with a large variety of methodologies and applied to a wide range of scenarios reservoir computing rc provides efficient tools to generate a vectorial fixedsize representation of the mts that can be further processed by standard classifiers despite their unrivaled training speed mts classifiers based on a standard rc architecture fail to achieve the same accuracy of fully trainable neural networks in this paper we introduce the reservoir model space an unsupervised approach based on rc to learn vectorial representations of mts each mts is encoded within the parameters of a linear model trained to predict a lowdimensional embedding of the reservoir dynamics compared to other rc methods our model space yields better representations and attains comparable computational performance thanks to an intermediate dimensionality reduction procedure as a second contribution we propose a modular rc framework for mts classification with an associated opensource python library the framework provides different modules to seamlessly implement advanced rc architectures the architectures are compared to other mts classifiers including deep learning models and time series kernels results obtained on benchmark and realworld mts datasets show that rc classifiers are dramatically faster and when implemented using our proposed representation also achieve superior classification accuracy
|
[['classification', 'of', 'multivariate', 'time', 'series', 'mts', 'has', 'been', 'tackled', 'with', 'a', 'large', 'variety', 'of', 'methodologies', 'and', 'applied', 'to', 'a', 'wide', 'range', 'of', 'scenarios', 'reservoir', 'computing', 'rc', 'provides', 'efficient', 'tools', 'to', 'generate', 'a', 'vectorial', 'fixedsize', 'representation', 'of', 'the', 'mts', 'that', 'can', 'be', 'further', 'processed', 'by', 'standard', 'classifiers', 'despite', 'their', 'unrivaled', 'training', 'speed', 'mts', 'classifiers', 'based', 'on', 'a', 'standard', 'rc', 'architecture', 'fail', 'to', 'achieve', 'the', 'same', 'accuracy', 'of', 'fully', 'trainable', 'neural', 'networks', 'in', 'this', 'paper', 'we', 'introduce', 'the', 'reservoir', 'model', 'space', 'an', 'unsupervised', 'approach', 'based', 'on', 'rc', 'to', 'learn', 'vectorial', 'representations', 'of', 'mts', 'each', 'mts', 'is', 'encoded', 'within', 'the', 'parameters', 'of', 'a', 'linear', 'model', 'trained', 'to', 'predict', 'a', 'lowdimensional', 'embedding', 'of', 'the', 'reservoir', 'dynamics', 'compared', 'to', 'other', 'rc', 'methods', 'our', 'model', 'space', 'yields', 'better', 'representations', 'and', 'attains', 'comparable', 'computational', 'performance', 'thanks', 'to', 'an', 'intermediate', 'dimensionality', 'reduction', 'procedure', 'as', 'a', 'second', 'contribution', 'we', 'propose', 'a', 'modular', 'rc', 'framework', 'for', 'mts', 'classification', 'with', 'an', 'associated', 'opensource', 'python', 'library', 'the', 'framework', 'provides', 'different', 'modules', 'to', 'seamlessly', 'implement', 'advanced', 'rc', 'architectures', 'the', 'architectures', 'are', 'compared', 'to', 'other', 'mts', 'classifiers', 'including', 'deep', 'learning', 'models', 'and', 'time', 'series', 'kernels', 'results', 'obtained', 'on', 'benchmark', 'and', 'realworld', 'mts', 'datasets', 'show', 'that', 'rc', 'classifiers', 'are', 'dramatically', 'faster', 'and', 'when', 'implemented', 'using', 'our', 'proposed', 'representation', 'also', 'achieve', 'superior', 'classification', 'accuracy']]
|
[-0.049078560613382324, -0.03534659181863949, -0.07836826205983435, 0.045623702621714286, -0.10243495099488288, -0.20903531707321796, 0.01690080774726364, 0.4422045729364842, -0.2986431257539572, -0.3090586202958478, 0.04533052675889429, -0.21803603662892085, -0.17624089559719253, 0.2637492444896802, -0.0844931650935905, 0.0796768083830382, 0.1556800958362426, 0.04282465543544207, -0.08303660188105894, -0.3047207604255303, 0.2496170038155889, 0.043116462422403856, 0.375684381454798, -0.05332918144995347, 0.15041556901549205, -0.06044230590878914, -0.022562425134240654, 0.003926962262294882, -0.040975028720962516, 0.21938420073890413, 0.3141911736990656, 0.15246118168481468, 0.28767987923436944, -0.4159216674026818, -0.24540862159427398, 0.09937746396462899, 0.1577695794090127, 0.10691694010228485, 0.00951721737902307, -0.2899690433248627, 0.08842575285458364, -0.1971670430161444, -0.004869998330832459, -0.17776809246788616, -0.025363073106676053, 0.015879270662340926, -0.2880390004944414, 0.018534943845224916, 0.04265618061225933, 0.06060930141337359, -0.062495150335542766, -0.13735344769772312, 0.033537442789216027, 0.13612440987722388, -0.024579992798792843, 0.07522524519131715, 0.1536307080689137, -0.1398539387701021, -0.15383186538775379, 0.3426746320731651, -0.10257631221723457, -0.2184915701375128, 0.25618264591545226, 0.01661586573642965, -0.11517587748172585, 0.09829524731993353, 0.26439295527346146, 0.08996972332869728, -0.1788901738286418, 0.042227475142471334, -0.0036851231147570964, 0.18313890192859197, 0.019789712862872805, -0.002105225412658631, 0.1460398060609385, 0.29101295704178765, 0.002294011237189317, 0.1486016714849169, -0.11832153426103804, -0.07921578302809323, -0.2158917845808901, -0.11501073139655861, -0.15602171095535874, -0.045540855087613005, -0.11500530904840371, -0.13929490738106465, 0.4068808417561321, 0.18372635777968055, 0.21902410696762112, 0.1656310650331971, 0.34167382549136305, 0.047025731066521706, 0.1747148495487636, 0.11929730536156477, 0.16105381771922112, 0.06773619469402967, 0.09062126032837953, -0.19208584886949281, 0.05195701518207967, 0.0644515891845703]
|
1,803.07871
|
Cosmic Ray Propagation in Turbulent Spiral Magnetic Fields associated
with Young Stellar Objects
|
External cosmic rays impinging upon circumstellar disks associated with young
stellar objects provide an important source of ionization, and as such, play an
important role in disk evolution and planet formation. However, these incoming
cosmic rays are affected by a variety of physical processes internal to
stellar/disk systems, including modulation by turbulent magnetic fields.
Globally, these fields naturally provide both a funneling effect, where cosmic
rays from larger volumes are focused into the disk region, and a magnetic
mirroring effect, where cosmic rays are repelled due to the increasing field
strength. This paper considers cosmic ray propagation in the presence of a
turbulent spiral magnetic field, analogous to that produced by the Solar wind.
The interaction of this wind with the interstellar medium defines a transition
radius, analogous to the Heliopause, which provides the outer boundary to this
problem. We construct a new coordinate system where one coordinate follows the
spiral magnetic field lines and consider magnetic perturbations to the field in
the perpendicular directions. The presence of magnetic turbulence replaces the
mirroring points with a distribution of values and moves the mean location
outward. Our results thus help quantify the degree to which cosmic ray fluxes
are reduced in circumstellar disks by the presence of magnetic field structures
that are shaped by stellar winds. The new coordinate system constructed herein
should also be useful in other astronomical applications.
|
astro-ph.HE
|
external cosmic rays impinging upon circumstellar disks associated with young stellar objects provide an important source of ionization and as such play an important role in disk evolution and planet formation however these incoming cosmic rays are affected by a variety of physical processes internal to stellardisk systems including modulation by turbulent magnetic fields globally these fields naturally provide both a funneling effect where cosmic rays from larger volumes are focused into the disk region and a magnetic mirroring effect where cosmic rays are repelled due to the increasing field strength this paper considers cosmic ray propagation in the presence of a turbulent spiral magnetic field analogous to that produced by the solar wind the interaction of this wind with the interstellar medium defines a transition radius analogous to the heliopause which provides the outer boundary to this problem we construct a new coordinate system where one coordinate follows the spiral magnetic field lines and consider magnetic perturbations to the field in the perpendicular directions the presence of magnetic turbulence replaces the mirroring points with a distribution of values and moves the mean location outward our results thus help quantify the degree to which cosmic ray fluxes are reduced in circumstellar disks by the presence of magnetic field structures that are shaped by stellar winds the new coordinate system constructed herein should also be useful in other astronomical applications
|
[['external', 'cosmic', 'rays', 'impinging', 'upon', 'circumstellar', 'disks', 'associated', 'with', 'young', 'stellar', 'objects', 'provide', 'an', 'important', 'source', 'of', 'ionization', 'and', 'as', 'such', 'play', 'an', 'important', 'role', 'in', 'disk', 'evolution', 'and', 'planet', 'formation', 'however', 'these', 'incoming', 'cosmic', 'rays', 'are', 'affected', 'by', 'a', 'variety', 'of', 'physical', 'processes', 'internal', 'to', 'stellardisk', 'systems', 'including', 'modulation', 'by', 'turbulent', 'magnetic', 'fields', 'globally', 'these', 'fields', 'naturally', 'provide', 'both', 'a', 'funneling', 'effect', 'where', 'cosmic', 'rays', 'from', 'larger', 'volumes', 'are', 'focused', 'into', 'the', 'disk', 'region', 'and', 'a', 'magnetic', 'mirroring', 'effect', 'where', 'cosmic', 'rays', 'are', 'repelled', 'due', 'to', 'the', 'increasing', 'field', 'strength', 'this', 'paper', 'considers', 'cosmic', 'ray', 'propagation', 'in', 'the', 'presence', 'of', 'a', 'turbulent', 'spiral', 'magnetic', 'field', 'analogous', 'to', 'that', 'produced', 'by', 'the', 'solar', 'wind', 'the', 'interaction', 'of', 'this', 'wind', 'with', 'the', 'interstellar', 'medium', 'defines', 'a', 'transition', 'radius', 'analogous', 'to', 'the', 'heliopause', 'which', 'provides', 'the', 'outer', 'boundary', 'to', 'this', 'problem', 'we', 'construct', 'a', 'new', 'coordinate', 'system', 'where', 'one', 'coordinate', 'follows', 'the', 'spiral', 'magnetic', 'field', 'lines', 'and', 'consider', 'magnetic', 'perturbations', 'to', 'the', 'field', 'in', 'the', 'perpendicular', 'directions', 'the', 'presence', 'of', 'magnetic', 'turbulence', 'replaces', 'the', 'mirroring', 'points', 'with', 'a', 'distribution', 'of', 'values', 'and', 'moves', 'the', 'mean', 'location', 'outward', 'our', 'results', 'thus', 'help', 'quantify', 'the', 'degree', 'to', 'which', 'cosmic', 'ray', 'fluxes', 'are', 'reduced', 'in', 'circumstellar', 'disks', 'by', 'the', 'presence', 'of', 'magnetic', 'field', 'structures', 'that', 'are', 'shaped', 'by', 'stellar', 'winds', 'the', 'new', 'coordinate', 'system', 'constructed', 'herein', 'should', 'also', 'be', 'useful', 'in', 'other', 'astronomical', 'applications']]
|
[-0.15261992731631843, 0.20276320902907746, -0.023475702056929663, 0.07817366110276854, -0.09805052695942303, -0.02233448262249148, -0.04840604947446785, 0.3772048763168252, -0.28331876120745614, -0.33297194237820804, 0.025288462939298016, -0.23270632130577834, -0.07960219750603799, 0.20860936588660597, -0.0069126885265618256, -0.045369820737350616, 0.01474428979688076, -0.03760570932284412, 0.0076576596927650144, -0.21480291568131216, 0.3548195644131329, 0.13465996306617317, 0.20056649973193044, 0.012690210507015442, 0.0654968795858173, -0.04241606357912065, -0.024423128388431654, 0.024515887242477535, -0.12471182965379926, 0.0907446210609147, 0.18340218537043543, 0.08143672139656336, 0.20156372647618623, -0.4737234187178216, -0.2885989091220804, 0.06324038318537306, 0.1970111747988089, 0.062445108501208074, -0.09268191976342595, -0.2680893071060878, 0.05420571443925746, -0.11630712972917567, -0.1872464330504978, 0.033054478965724075, 0.006672257586488069, 0.06492561509367079, -0.2545960089110456, 0.0561727836846799, 0.05710425784233876, 0.10354696784074943, -0.12209307123382279, -0.04923475130489625, -0.03478117913361557, 0.10196525256015262, 0.10471779794084501, 0.11604823981000997, 0.2246169827453483, -0.15263244299946035, -0.04800738031288617, 0.4041997228126859, -0.06196216360857003, -0.13903101565373258, 0.19923898364177306, -0.20391053813202084, -0.10286204738127612, 0.19156161260152618, 0.19428225293934476, 0.0798017350615177, -0.13067683578147574, 0.05527105628829002, -0.007743717089405194, 0.11780759929903015, 0.06709851859153683, 0.03137009536774268, 0.3346501792797323, 0.08272026305688814, 0.0802845060794846, 0.12872893599728244, -0.1493865600860816, -0.06707608078577958, -0.25487518216194543, -0.1359126088534803, -0.1195037762022386, 0.07815991780747594, -0.11723171787174555, -0.18760934174386174, 0.33988122238399354, 0.14350974798918292, 0.20707290135242662, -0.06816010341133646, 0.31445129033723057, 0.06656743122168662, 0.04890146904104434, 0.14597148188353234, 0.28554998227704204, 0.1939262190496134, 0.13848860661283657, -0.23174226566906164, 0.08222164151840335, 0.03474346613389436]
|
1,803.07872
|
A differential game with exit costs
|
We study a differential game where two players separately control their own
dynamics, pay a running cost, and moreover pay an exit cost (quitting the game)
when they leave a fixed domain. In particular, each player has its own domain
and the exit cost consists of three different exit costs, depending whether
either the first player only leaves its domain, or the second player only
leaves its domain, or they both simultaneously leave their own domain. We prove
that, under suitable hypotheses, the lower and upper value are continuous and
are, respectively, the unique viscosity solution of a suitable Dirichlet
problem for a Hamilton-Jacobi-Isaacs equation. The continuity of the values
relies on the existence of suitable non-anticipating strategies respecting the
domain-constraint. This problem is also treated in this work.
|
math.OC
|
we study a differential game where two players separately control their own dynamics pay a running cost and moreover pay an exit cost quitting the game when they leave a fixed domain in particular each player has its own domain and the exit cost consists of three different exit costs depending whether either the first player only leaves its domain or the second player only leaves its domain or they both simultaneously leave their own domain we prove that under suitable hypotheses the lower and upper value are continuous and are respectively the unique viscosity solution of a suitable dirichlet problem for a hamiltonjacobiisaacs equation the continuity of the values relies on the existence of suitable nonanticipating strategies respecting the domainconstraint this problem is also treated in this work
|
[['we', 'study', 'a', 'differential', 'game', 'where', 'two', 'players', 'separately', 'control', 'their', 'own', 'dynamics', 'pay', 'a', 'running', 'cost', 'and', 'moreover', 'pay', 'an', 'exit', 'cost', 'quitting', 'the', 'game', 'when', 'they', 'leave', 'a', 'fixed', 'domain', 'in', 'particular', 'each', 'player', 'has', 'its', 'own', 'domain', 'and', 'the', 'exit', 'cost', 'consists', 'of', 'three', 'different', 'exit', 'costs', 'depending', 'whether', 'either', 'the', 'first', 'player', 'only', 'leaves', 'its', 'domain', 'or', 'the', 'second', 'player', 'only', 'leaves', 'its', 'domain', 'or', 'they', 'both', 'simultaneously', 'leave', 'their', 'own', 'domain', 'we', 'prove', 'that', 'under', 'suitable', 'hypotheses', 'the', 'lower', 'and', 'upper', 'value', 'are', 'continuous', 'and', 'are', 'respectively', 'the', 'unique', 'viscosity', 'solution', 'of', 'a', 'suitable', 'dirichlet', 'problem', 'for', 'a', 'hamiltonjacobiisaacs', 'equation', 'the', 'continuity', 'of', 'the', 'values', 'relies', 'on', 'the', 'existence', 'of', 'suitable', 'nonanticipating', 'strategies', 'respecting', 'the', 'domainconstraint', 'this', 'problem', 'is', 'also', 'treated', 'in', 'this', 'work']]
|
[-0.12308576463692589, 0.06603730019662635, -0.11360362928826362, 0.03785106993291265, -0.14152645242393191, -0.19132954443921335, 0.11032863178479602, 0.391329125923221, -0.3114205887504795, -0.23762170584814157, 0.1901205416920675, -0.2676787921845971, -0.08428898850252153, 0.1132396617813356, -0.10352450963546289, 0.028665881136134885, 0.060141556763483095, 0.12340397533262148, -0.0034660074556995824, -0.2867517516870066, 0.3467339883090972, -0.019712780143890996, 0.2336907034750766, 0.04681404502252917, 0.13258333822523127, -0.012233341141836718, 0.007947896294353995, 0.011323492115479894, -0.1508729185573543, 0.06295242138912727, 0.19630746475195338, 0.1484651403970929, 0.4004355706856586, -0.4541842720209388, -0.13936497828399297, 0.16462235573271755, 0.07434302558249328, 0.06628170393378241, -0.04462981863434834, -0.2620899419016496, 0.0788584894980886, -0.10673804042926349, -0.09168035964103183, -0.008464226875730674, 0.006314945116173476, 0.018079022563142644, -0.27386758352804463, -0.014932385818838156, 0.05446732403288479, 0.00692995725489709, -0.0969098931627741, -0.13954892574838595, -0.050350606645224616, 0.22246963363727446, 0.06603677773637173, -0.013889092580939177, 0.13532489054341568, -0.17189338993466663, -0.11403520788007881, 0.39092525535670575, -0.051947179879789473, -0.2726162768594804, 0.17148377728517517, -0.12841774618209456, -0.12186116236989619, 0.08303275874823157, 0.15298681200874853, 0.17089072165617836, -0.14355427403154408, 0.13519491856095556, -0.040861172064978746, 0.16011562622952624, 0.11913211023056647, 0.02381403002436855, 0.1656825382160605, 0.14801395552422036, 0.18165508379752282, 0.11442811585038726, -0.00373630834837968, -0.13425745651329635, -0.3183001764664368, -0.15179496038035722, -0.1680691403671517, 0.013999960936416755, -0.09099560634376758, -0.14724283089162782, 0.3874072582102599, 0.09633845552889397, 0.19180278656540395, 0.09513745579170063, 0.3063342252498842, 0.14665405325649772, -0.020764412060088944, 0.09099135360156652, 0.18182672531111166, 0.019939883104598266, 0.12085957914314349, -0.2262879087559213, 0.1119395598070696, 0.03112868315383821]
|
1,803.07873
|
Gamma Ray Bursts. Progenitors, accretion in the central engine, jet
acceleration mechanisms
|
The collapsar model was proposed to explain the long-duration gamma-ray
bursts (GRBs), while the short GRBs are associated with the mergers of compact
objects. In the first case, mainly the energetics of the events is consistent
with the proposed progenitor models, while the duration, time variability, as
well as the afterglow emission may shed some light on the detailed properties
of the collapsing massive stars. In the latter case, the recent discovery of
the binary neutron star (NS-NS) merger in the gravitational wave observation
made by LIGO (GW170817), and the detection of associated electromagnetic
counterparts, for the first time gave a direct proof of the NS-NS merger being
a progenitor of a short GRB.
In general, all GRBs are believed to be powered by accretion through a
rotationally supported torus, or by fast rotation of a compact object. For long
ones, the rotation of the progenitor star is a key property in order to support
accretion over relatively long activity periods, and also to sustain the
rotation of the black hole itself. The latter is responsible for ejection of
the relativistic jets, which are powered due to the extraction of the BH
rotational energy, mitigated by the accretion torus and magnetic fields. The
jets must break through the stellar envelope though, which poses a question on
the efficiency of this process. Similar mechanisms of powering the jet ejection
may act in short GRBs, which in this case may freely propagate through the
interstellar medium. The power of the jets launched from the rotating black
hole is at first associated mostly with the magnetic Poynting flux, and then at
large distances it is transferred to the kinetic and finally radiative energy
of the expanding shells.
|
astro-ph.HE
|
the collapsar model was proposed to explain the longduration gammaray bursts grbs while the short grbs are associated with the mergers of compact objects in the first case mainly the energetics of the events is consistent with the proposed progenitor models while the duration time variability as well as the afterglow emission may shed some light on the detailed properties of the collapsing massive stars in the latter case the recent discovery of the binary neutron star nsns merger in the gravitational wave observation made by ligo gw170817 and the detection of associated electromagnetic counterparts for the first time gave a direct proof of the nsns merger being a progenitor of a short grb in general all grbs are believed to be powered by accretion through a rotationally supported torus or by fast rotation of a compact object for long ones the rotation of the progenitor star is a key property in order to support accretion over relatively long activity periods and also to sustain the rotation of the black hole itself the latter is responsible for ejection of the relativistic jets which are powered due to the extraction of the bh rotational energy mitigated by the accretion torus and magnetic fields the jets must break through the stellar envelope though which poses a question on the efficiency of this process similar mechanisms of powering the jet ejection may act in short grbs which in this case may freely propagate through the interstellar medium the power of the jets launched from the rotating black hole is at first associated mostly with the magnetic poynting flux and then at large distances it is transferred to the kinetic and finally radiative energy of the expanding shells
|
[['the', 'collapsar', 'model', 'was', 'proposed', 'to', 'explain', 'the', 'longduration', 'gammaray', 'bursts', 'grbs', 'while', 'the', 'short', 'grbs', 'are', 'associated', 'with', 'the', 'mergers', 'of', 'compact', 'objects', 'in', 'the', 'first', 'case', 'mainly', 'the', 'energetics', 'of', 'the', 'events', 'is', 'consistent', 'with', 'the', 'proposed', 'progenitor', 'models', 'while', 'the', 'duration', 'time', 'variability', 'as', 'well', 'as', 'the', 'afterglow', 'emission', 'may', 'shed', 'some', 'light', 'on', 'the', 'detailed', 'properties', 'of', 'the', 'collapsing', 'massive', 'stars', 'in', 'the', 'latter', 'case', 'the', 'recent', 'discovery', 'of', 'the', 'binary', 'neutron', 'star', 'nsns', 'merger', 'in', 'the', 'gravitational', 'wave', 'observation', 'made', 'by', 'ligo', 'gw170817', 'and', 'the', 'detection', 'of', 'associated', 'electromagnetic', 'counterparts', 'for', 'the', 'first', 'time', 'gave', 'a', 'direct', 'proof', 'of', 'the', 'nsns', 'merger', 'being', 'a', 'progenitor', 'of', 'a', 'short', 'grb', 'in', 'general', 'all', 'grbs', 'are', 'believed', 'to', 'be', 'powered', 'by', 'accretion', 'through', 'a', 'rotationally', 'supported', 'torus', 'or', 'by', 'fast', 'rotation', 'of', 'a', 'compact', 'object', 'for', 'long', 'ones', 'the', 'rotation', 'of', 'the', 'progenitor', 'star', 'is', 'a', 'key', 'property', 'in', 'order', 'to', 'support', 'accretion', 'over', 'relatively', 'long', 'activity', 'periods', 'and', 'also', 'to', 'sustain', 'the', 'rotation', 'of', 'the', 'black', 'hole', 'itself', 'the', 'latter', 'is', 'responsible', 'for', 'ejection', 'of', 'the', 'relativistic', 'jets', 'which', 'are', 'powered', 'due', 'to', 'the', 'extraction', 'of', 'the', 'bh', 'rotational', 'energy', 'mitigated', 'by', 'the', 'accretion', 'torus', 'and', 'magnetic', 'fields', 'the', 'jets', 'must', 'break', 'through', 'the', 'stellar', 'envelope', 'though', 'which', 'poses', 'a', 'question', 'on', 'the', 'efficiency', 'of', 'this', 'process', 'similar', 'mechanisms', 'of', 'powering', 'the', 'jet', 'ejection', 'may', 'act', 'in', 'short', 'grbs', 'which', 'in', 'this', 'case', 'may', 'freely', 'propagate', 'through', 'the', 'interstellar', 'medium', 'the', 'power', 'of', 'the', 'jets', 'launched', 'from', 'the', 'rotating', 'black', 'hole', 'is', 'at', 'first', 'associated', 'mostly', 'with', 'the', 'magnetic', 'poynting', 'flux', 'and', 'then', 'at', 'large', 'distances', 'it', 'is', 'transferred', 'to', 'the', 'kinetic', 'and', 'finally', 'radiative', 'energy', 'of', 'the', 'expanding', 'shells']]
|
[-0.12481940960721441, 0.16131431993890658, -0.03816094302939592, 0.14366806085445205, -0.13420383861242519, -0.05175627789355185, 0.016795012458804732, 0.3947467053354993, -0.19658764200383455, -0.2962912197887215, 0.093135802352778, -0.2496856764049317, -0.01570092032509397, 0.25159007069510475, -0.021709479394034337, -0.019497597978686467, 0.09064251360869606, -0.013732842658318475, -0.06702705185768575, -0.22474686074944566, 0.32823690464744726, 0.12659295348116054, 0.16879726789387936, -0.01538544679208147, 0.08175488811172381, -0.06644656860456527, -0.04980820618446057, -0.06051913069882496, -0.08404601912315883, 0.046488754139740913, 0.1924638045916702, 0.12040397102418224, 0.20316231640779886, -0.43134203530244636, -0.2696396820509518, 0.06387431061134713, 0.15384037536814887, 0.06238318578624798, -0.08704717210772722, -0.283072616838978, 0.07694043095131785, -0.240814902829531, -0.1404699927850128, 0.06980460163855165, 0.06670656196386095, 0.08011746802982139, -0.19687730403335005, 0.10543038356509371, 0.08852211762839456, -0.028940990276169032, -0.09907098029720479, 0.030399339776535347, -0.06383185948058306, 0.06957459036616648, 0.15180898589132483, 0.08551562198070468, 0.1436310973966127, -0.14710442235194882, -0.08834817750144973, 0.42579728757149315, -0.032649599802540945, -0.07386154559290063, 0.2221059038387415, -0.20371582597317042, -0.14226000070650602, 0.19487835350446403, 0.16691748799533176, 0.14279868932355616, -0.13678702158266415, -0.023409228211778713, 0.009921527382457369, 0.15536561139496896, 0.04256510379491374, 0.04529893846832327, 0.35859517642611666, 0.15608193788966032, -0.012314982768017011, 0.11176017558789964, -0.16935474437216302, -0.03422081494264462, -0.29576396730787474, -0.12093764379055692, -0.1653019133631409, 0.1405137806187911, -0.09565072275034536, -0.12335778613374765, 0.3782941087535529, 0.05961821333162526, 0.19271028995461448, 0.012840843755582964, 0.2937179613337052, 0.08888062480369806, 0.08118943588539276, 0.1528549454401208, 0.34517263365521267, 0.16380454366698757, 0.11614250115071371, -0.2372832644958718, 0.10322154048563008, 0.05686916572305794]
|
1,803.07874
|
Joint Power and Trajectory Design for Physical-Layer Secrecy in the
UAV-Aided Mobile Relaying System
|
Mobile relaying is emerged as a promising technique to assist wireless
communication, driven by the rapid development of unmanned aerial vehicles
(UAVs). In this paper, we study secure transmission in a four-node (source,
destination, mobile relay, and eavesdropper) system, wherein we focus on
maximizing the secrecy rate via jointly optimizing the relay trajectory and the
source/relay transmit power. Nevertheless, due to the coupling of the
trajectory designing and the power allocating, the secrecy rate maximization
(SRM) problem is intractable to solve. Accordingly, we propose an alternating
optimization (AO) approach, wherein the trajectory designing and the power
allocating are tackled in an alternating manner. Unfortunately, the trajectory
designing is a nonconvex problem, and thus is still hard to solve. To
circumvent the nonconvexity, we exploit sequential convex programming (SCP) to
derive an iterative algorithm, which is proven to converge to a
Karush-Kuhn-Tucker (KKT) point of the trajectory design problem. The simulation
results demonstrate the efficacy of the joint power and trajectory design in
improving the secrecy throughput.
|
cs.IT math.IT
|
mobile relaying is emerged as a promising technique to assist wireless communication driven by the rapid development of unmanned aerial vehicles uavs in this paper we study secure transmission in a fournode source destination mobile relay and eavesdropper system wherein we focus on maximizing the secrecy rate via jointly optimizing the relay trajectory and the sourcerelay transmit power nevertheless due to the coupling of the trajectory designing and the power allocating the secrecy rate maximization srm problem is intractable to solve accordingly we propose an alternating optimization ao approach wherein the trajectory designing and the power allocating are tackled in an alternating manner unfortunately the trajectory designing is a nonconvex problem and thus is still hard to solve to circumvent the nonconvexity we exploit sequential convex programming scp to derive an iterative algorithm which is proven to converge to a karushkuhntucker kkt point of the trajectory design problem the simulation results demonstrate the efficacy of the joint power and trajectory design in improving the secrecy throughput
|
[['mobile', 'relaying', 'is', 'emerged', 'as', 'a', 'promising', 'technique', 'to', 'assist', 'wireless', 'communication', 'driven', 'by', 'the', 'rapid', 'development', 'of', 'unmanned', 'aerial', 'vehicles', 'uavs', 'in', 'this', 'paper', 'we', 'study', 'secure', 'transmission', 'in', 'a', 'fournode', 'source', 'destination', 'mobile', 'relay', 'and', 'eavesdropper', 'system', 'wherein', 'we', 'focus', 'on', 'maximizing', 'the', 'secrecy', 'rate', 'via', 'jointly', 'optimizing', 'the', 'relay', 'trajectory', 'and', 'the', 'sourcerelay', 'transmit', 'power', 'nevertheless', 'due', 'to', 'the', 'coupling', 'of', 'the', 'trajectory', 'designing', 'and', 'the', 'power', 'allocating', 'the', 'secrecy', 'rate', 'maximization', 'srm', 'problem', 'is', 'intractable', 'to', 'solve', 'accordingly', 'we', 'propose', 'an', 'alternating', 'optimization', 'ao', 'approach', 'wherein', 'the', 'trajectory', 'designing', 'and', 'the', 'power', 'allocating', 'are', 'tackled', 'in', 'an', 'alternating', 'manner', 'unfortunately', 'the', 'trajectory', 'designing', 'is', 'a', 'nonconvex', 'problem', 'and', 'thus', 'is', 'still', 'hard', 'to', 'solve', 'to', 'circumvent', 'the', 'nonconvexity', 'we', 'exploit', 'sequential', 'convex', 'programming', 'scp', 'to', 'derive', 'an', 'iterative', 'algorithm', 'which', 'is', 'proven', 'to', 'converge', 'to', 'a', 'karushkuhntucker', 'kkt', 'point', 'of', 'the', 'trajectory', 'design', 'problem', 'the', 'simulation', 'results', 'demonstrate', 'the', 'efficacy', 'of', 'the', 'joint', 'power', 'and', 'trajectory', 'design', 'in', 'improving', 'the', 'secrecy', 'throughput']]
|
[-0.2469714904114245, -0.047333496985048844, -0.033000189415459714, -0.002752924816267767, -0.11835754178015583, -0.2760659778064274, 0.10305522500708453, 0.40928893221026086, -0.34920373522390397, -0.2844419530705066, 0.11453676093313618, -0.2368032841505595, -0.18117463154050645, 0.14568245638595298, -0.1720849271745881, 0.13124128029378782, 0.04346429467403207, -0.0018208902069507377, -0.005689835759351052, -0.26646056778291355, 0.252478631653722, 0.15085771872033646, 0.360926627265626, 0.05077198987927692, 0.10057847325252481, 0.061581995662200795, 0.026885231964378507, -0.024573112843580634, -0.09279481289734368, 0.1333636890767922, 0.37585039895746003, 0.2335108696281102, 0.3539429008680205, -0.4153999775670559, -0.22380216782407678, 0.11253518604460251, 0.18672513826301387, 0.047371921161083075, -0.08991566226265045, -0.2579244983505951, 0.12129383253113153, -0.1959312501242833, -0.04553538042047701, -0.005638201495896217, -0.11756243175162137, 0.03708104853916644, -0.3737846026589802, -0.04135563631937558, -0.030471741606155973, -0.0006710946341101304, -0.09990839558619871, -0.05273464580097359, 0.07220017685308065, 0.15740968165701782, 0.08220182863731745, 0.032827433453962565, 0.11909631118234472, -0.11789487643273974, -0.13614126540295432, 0.37607166508818607, 0.07354536720590824, -0.22857288234721285, 0.09653035478234426, 0.012140032310734492, -0.1132044790239713, 0.17236925440515022, 0.27669058093543064, 0.14192686817631214, -0.2281142548512084, 0.027530818659368992, 0.004576188686068158, 0.142303891783806, 0.042030558624046754, 0.03220279934445778, 0.1799231622527993, 0.20386298761299126, 0.2282742807607963, 0.19218422872356578, -0.10359238923796599, -0.16116585387183488, -0.16722615726687665, -0.1333772667784648, -0.2503897106970649, 0.03275616073150592, -0.06501425308941902, -0.06222793663198308, 0.34836448045694324, 0.16204710098128386, 0.11179733977664306, 0.14302524516473986, 0.4517801360575011, 0.14630448689238246, -0.017421715259580053, 0.15972286019564033, 0.24048508512955832, 0.071056290465149, 0.13665789947424264, -0.29236165077898213, 0.07997130379164928, 0.04575264265098755]
|
1,803.07875
|
Disruption of Saturn's Quasi-Periodic Equatorial Oscillation by the
Great Northern Storm
|
Observations of planets throughout our Solar System have revealed that the
Earth is not alone in possessing natural, inter-annual atmospheric cycles. The
equatorial middle atmospheres of the Earth, Jupiter and Saturn all exhibit a
remarkably similar phenomenon - a vertical, cyclic pattern of alternating
temperatures and zonal (east-west) wind regimes that propagate slowly downwards
with a well-defined multi-Earth-year period. Earth's Quasi-Biennial Oscillation
(QBO, observed in the lower stratospheres with an average period of 28 months)
is one of the most regular, repeatable cycles exhibited by our climate system,
and yet recent work has shown that this regularity can be disrupted by events
occurring far away from the equatorial region, an example of a phenomenon known
as atmospheric teleconnection. Here we reveal that Saturn's equatorial
Quasi-Periodic Oscillation (QPO, with a ~15-year period) can also be
dramatically perturbed. An intense springtime storm erupted at Saturn's
northern mid-latitudes in December 2010, spawning a gigantic hot vortex in the
stratosphere at $40^\circ$N that persisted for 3 years. Far from the storm, the
Cassini temperature measurements showed a dramatic $\sim10$-K cooling in the
0.5-5 mbar range across the entire equatorial region, disrupting the regular
QPO pattern and significantly altering the middle-atmospheric wind structure,
suggesting an injection of westward momentum into the equatorial wind system
from waves generated by the northern storm. Hence, as on Earth, meteorological
activity at mid-latitudes can have a profound effect on the regular atmospheric
cycles in the tropics, demonstrating that waves can provide horizontal
teleconnections between the phenomena shaping the middle atmospheres of giant
planets.
|
astro-ph.EP
|
observations of planets throughout our solar system have revealed that the earth is not alone in possessing natural interannual atmospheric cycles the equatorial middle atmospheres of the earth jupiter and saturn all exhibit a remarkably similar phenomenon a vertical cyclic pattern of alternating temperatures and zonal eastwest wind regimes that propagate slowly downwards with a welldefined multiearthyear period earths quasibiennial oscillation qbo observed in the lower stratospheres with an average period of 28 months is one of the most regular repeatable cycles exhibited by our climate system and yet recent work has shown that this regularity can be disrupted by events occurring far away from the equatorial region an example of a phenomenon known as atmospheric teleconnection here we reveal that saturns equatorial quasiperiodic oscillation qpo with a 15year period can also be dramatically perturbed an intense springtime storm erupted at saturns northern midlatitudes in december 2010 spawning a gigantic hot vortex in the stratosphere at 40circn that persisted for 3 years far from the storm the cassini temperature measurements showed a dramatic sim10k cooling in the 055 mbar range across the entire equatorial region disrupting the regular qpo pattern and significantly altering the middleatmospheric wind structure suggesting an injection of westward momentum into the equatorial wind system from waves generated by the northern storm hence as on earth meteorological activity at midlatitudes can have a profound effect on the regular atmospheric cycles in the tropics demonstrating that waves can provide horizontal teleconnections between the phenomena shaping the middle atmospheres of giant planets
|
[['observations', 'of', 'planets', 'throughout', 'our', 'solar', 'system', 'have', 'revealed', 'that', 'the', 'earth', 'is', 'not', 'alone', 'in', 'possessing', 'natural', 'interannual', 'atmospheric', 'cycles', 'the', 'equatorial', 'middle', 'atmospheres', 'of', 'the', 'earth', 'jupiter', 'and', 'saturn', 'all', 'exhibit', 'a', 'remarkably', 'similar', 'phenomenon', 'a', 'vertical', 'cyclic', 'pattern', 'of', 'alternating', 'temperatures', 'and', 'zonal', 'eastwest', 'wind', 'regimes', 'that', 'propagate', 'slowly', 'downwards', 'with', 'a', 'welldefined', 'multiearthyear', 'period', 'earths', 'quasibiennial', 'oscillation', 'qbo', 'observed', 'in', 'the', 'lower', 'stratospheres', 'with', 'an', 'average', 'period', 'of', '28', 'months', 'is', 'one', 'of', 'the', 'most', 'regular', 'repeatable', 'cycles', 'exhibited', 'by', 'our', 'climate', 'system', 'and', 'yet', 'recent', 'work', 'has', 'shown', 'that', 'this', 'regularity', 'can', 'be', 'disrupted', 'by', 'events', 'occurring', 'far', 'away', 'from', 'the', 'equatorial', 'region', 'an', 'example', 'of', 'a', 'phenomenon', 'known', 'as', 'atmospheric', 'teleconnection', 'here', 'we', 'reveal', 'that', 'saturns', 'equatorial', 'quasiperiodic', 'oscillation', 'qpo', 'with', 'a', '15year', 'period', 'can', 'also', 'be', 'dramatically', 'perturbed', 'an', 'intense', 'springtime', 'storm', 'erupted', 'at', 'saturns', 'northern', 'midlatitudes', 'in', 'december', '2010', 'spawning', 'a', 'gigantic', 'hot', 'vortex', 'in', 'the', 'stratosphere', 'at', '40circn', 'that', 'persisted', 'for', '3', 'years', 'far', 'from', 'the', 'storm', 'the', 'cassini', 'temperature', 'measurements', 'showed', 'a', 'dramatic', 'sim10k', 'cooling', 'in', 'the', '055', 'mbar', 'range', 'across', 'the', 'entire', 'equatorial', 'region', 'disrupting', 'the', 'regular', 'qpo', 'pattern', 'and', 'significantly', 'altering', 'the', 'middleatmospheric', 'wind', 'structure', 'suggesting', 'an', 'injection', 'of', 'westward', 'momentum', 'into', 'the', 'equatorial', 'wind', 'system', 'from', 'waves', 'generated', 'by', 'the', 'northern', 'storm', 'hence', 'as', 'on', 'earth', 'meteorological', 'activity', 'at', 'midlatitudes', 'can', 'have', 'a', 'profound', 'effect', 'on', 'the', 'regular', 'atmospheric', 'cycles', 'in', 'the', 'tropics', 'demonstrating', 'that', 'waves', 'can', 'provide', 'horizontal', 'teleconnections', 'between', 'the', 'phenomena', 'shaping', 'the', 'middle', 'atmospheres', 'of', 'giant', 'planets']]
|
[-0.14424144366802646, 0.24863809631229378, -0.05718817775417119, 0.07800799496704712, -0.050339688224717974, -0.029117866698652507, 0.03496305397478863, 0.3445290621612221, -0.2249274750431068, -0.325348180193454, 0.12857571002002804, -0.26830882641067727, -0.14972721895575522, 0.2583154127039015, -0.08376222431310452, -0.06031222727661952, 0.1139259961405769, -0.013155579821555876, -0.008084462937898934, -0.18919142484813348, 0.1786867055222392, 0.11397059851163067, 0.17445485985465348, 0.019642954194918273, 0.06147533669602126, -0.12299338851775975, 0.021101566317607647, -0.038178022367879746, -0.12184450510836906, 0.0023656699508428575, 0.21791385127138346, 0.09193282029032707, 0.1979958523651585, -0.46467854365706446, -0.2848912240355276, 0.04302726715011522, 0.15694619845738633, 0.030200741715729236, -0.029784129303880035, -0.24945018968731164, 0.011629193738102913, -0.19564938935264944, -0.1797612153524533, 0.05491983172064647, 0.0846462448183447, -0.015319033533334732, -0.23582724453997797, 0.10265029651799705, 0.10782603132259101, 0.21617292683012784, -0.11897506745671853, -0.09802280544955283, -0.13436131751909852, 0.09518270380049944, 0.107329918484902, 0.050210678910836574, 0.17447947079129517, -0.045112933968659494, -0.05023671240312979, 0.3604414316862822, -0.10799840000178665, 0.007012017450877465, 0.20795326206367462, -0.29398766146041455, -0.08055271008703857, 0.21751840562745928, 0.1688990226495662, 0.060443708811886605, -0.11084428228327306, -0.014898380296304822, -0.10229755148966797, 0.16426836754567922, 0.17888095126673578, -0.015415500082075597, 0.37332886005192994, 0.13466169663891198, 0.10688339577708393, 0.08454284199373796, -0.22663539759255946, -0.0699473963258788, -0.15751448128838091, -0.029370110086165368, -0.08561694340081885, 0.026559522380230193, -0.08603206881671213, -0.1582152330915269, 0.43750703955069187, 0.1269631654713303, 0.1686199386351509, -0.036485695165931246, 0.2988604373149574, 0.06709753017453476, 0.07464648971467977, 0.1752567279152572, 0.3326628331914544, 0.10447497640643269, 0.20130364202335477, -0.22004084764886647, 0.1276053011645563, 0.017980434937402607]
|
1,803.07876
|
Elastic backbone defines a new transition in the percolation model
|
The elastic backbone is the set of all shortest paths. We found a new phase
transition at $p_{eb}$ above the classical percolation threshold at which the
elastic backbone becomes dense. At this transition in $2d$ its fractal
dimension is $1.750\pm 0.003$, and one obtains a novel set of critical
exponents $\beta_{eb} = 0.50\pm 0.02$, $\gamma_{eb} = 1.97\pm 0.05$, and
$\nu_{eb} = 2.00\pm 0.02$ fulfilling consistent critical scaling laws.
Interestingly, however, the hyperscaling relation is violated. Using Binder's
cumulant, we determine, with high precision, the critical probabilities
$p_{eb}$ for the triangular and tilted square lattice for site and bond
percolation. This transition describes a sudden rigidification as a function of
density when stretching a damaged tissue.
|
cond-mat.stat-mech
|
the elastic backbone is the set of all shortest paths we found a new phase transition at p_eb above the classical percolation threshold at which the elastic backbone becomes dense at this transition in 2d its fractal dimension is 1750pm 0003 and one obtains a novel set of critical exponents beta_eb 050pm 002 gamma_eb 197pm 005 and nu_eb 200pm 002 fulfilling consistent critical scaling laws interestingly however the hyperscaling relation is violated using binders cumulant we determine with high precision the critical probabilities p_eb for the triangular and tilted square lattice for site and bond percolation this transition describes a sudden rigidification as a function of density when stretching a damaged tissue
|
[['the', 'elastic', 'backbone', 'is', 'the', 'set', 'of', 'all', 'shortest', 'paths', 'we', 'found', 'a', 'new', 'phase', 'transition', 'at', 'p_eb', 'above', 'the', 'classical', 'percolation', 'threshold', 'at', 'which', 'the', 'elastic', 'backbone', 'becomes', 'dense', 'at', 'this', 'transition', 'in', '2d', 'its', 'fractal', 'dimension', 'is', '1750pm', '0003', 'and', 'one', 'obtains', 'a', 'novel', 'set', 'of', 'critical', 'exponents', 'beta_eb', '050pm', '002', 'gamma_eb', '197pm', '005', 'and', 'nu_eb', '200pm', '002', 'fulfilling', 'consistent', 'critical', 'scaling', 'laws', 'interestingly', 'however', 'the', 'hyperscaling', 'relation', 'is', 'violated', 'using', 'binders', 'cumulant', 'we', 'determine', 'with', 'high', 'precision', 'the', 'critical', 'probabilities', 'p_eb', 'for', 'the', 'triangular', 'and', 'tilted', 'square', 'lattice', 'for', 'site', 'and', 'bond', 'percolation', 'this', 'transition', 'describes', 'a', 'sudden', 'rigidification', 'as', 'a', 'function', 'of', 'density', 'when', 'stretching', 'a', 'damaged', 'tissue']]
|
[-0.13958624722781005, 0.2137744130342509, -0.026175410954035923, 0.04591389773607565, 0.0059695024047633286, -0.17502044005905865, 0.12329023791891006, 0.31741081410695593, -0.2614007275199886, -0.22109572682529688, 0.06740166127673108, -0.3556465435373226, -0.12355752058189225, 0.11863230041193741, 0.01577269237626482, 0.0999616654110098, -0.036383628323501734, 0.04282565928857635, -0.09524121144958944, -0.14277520876796054, 0.2725580415669726, 0.024748377396328444, 0.3329403598521215, 0.09149650771858567, 0.07938767639118144, 0.012805185793830012, 0.09032683319808846, 0.03804518648474994, -0.23578374550130252, 0.041578796261024696, 0.1927698017281256, 0.0003563742976877148, 0.1878259904592091, -0.3233131786842865, -0.16641286084066248, 0.09794051783305972, 0.16002496669642385, 0.08795511686023222, 0.012064811411417194, -0.22545877374553433, 0.09708036480609465, -0.13794528490743013, -0.1789195850206953, -0.00861361540026135, 0.061826338750068786, 0.013773828263327704, -0.2857919635285658, 0.17182371545910696, 0.011457907641737687, 0.0966617855657306, -0.03529989060243005, -0.11996590824263101, -0.04053729177556104, 0.11227357537400504, -0.023260662510842342, 0.11236784999534764, 0.1543078667924015, -0.12642320548184216, -0.058709672186523676, 0.40877810530623215, 0.009885942308486577, -0.09237774233632215, 0.1439962878972033, -0.1887589503010666, -0.16667338999751438, 0.18831810916998182, 0.09797020595417255, 0.034545473702665835, -0.11354024656813838, 0.029055872804881935, 0.013638339092722163, 0.18179094839271986, 0.06715230867094188, -0.03877863967015097, 0.2172968589735252, 0.2155127496850953, 0.07651406914508832, 0.14171908068022243, -0.10640183048909185, -0.10545664380683943, -0.29575055306432424, -0.13100827933737524, -0.20113223930928614, 0.058372939541220185, -0.2158506772199568, -0.21090453141368926, 0.32351574764793944, 0.1134163462443717, 0.22131610754553954, 0.11462464020695295, 0.193455191712861, 0.14390709972428373, 0.04160365003971728, 0.06346702718184571, 0.2457284925988427, 0.1205650745067504, 0.08607757281343867, -0.16860246881238977, 0.07792708250969925, 0.10979915450810006]
|
1,803.07877
|
A Case Study for Grain Quality Assurance Tracking based on a Blockchain
Business Network
|
One of the key processes in Agriculture is quality measurement throughout the
transportation of grains along its complex supply chain. This procedure is
suitable for failures, such as delays to final destinations, poor monitoring,
and frauds. To address the grain quality measurement challenge through the
transportation chain, novel technologies, such as Distributed Ledger and
Blockchain, can bring more efficiency and resilience to the process.
Particularly, Blockchain is a new type of distributed database in which
transactions are securely appended using cryptography and hashed pointers.
Those transactions can be generated and ruled by special network-embedded
software -- known as smart contracts -- that may be public to all nodes of the
network or may be private to a specific set of peer nodes. This paper analyses
the implementation of Blockchain technology targeting grain quality assurance
tracking in a real scenario. Preliminary results support a potential demand for
a Blockchain-based certification that would lead to an added valuation of
around 15% for GM-free soy in the scope of a Grain Exporter Business Network in
Brazil.
|
cs.CY cs.DC
|
one of the key processes in agriculture is quality measurement throughout the transportation of grains along its complex supply chain this procedure is suitable for failures such as delays to final destinations poor monitoring and frauds to address the grain quality measurement challenge through the transportation chain novel technologies such as distributed ledger and blockchain can bring more efficiency and resilience to the process particularly blockchain is a new type of distributed database in which transactions are securely appended using cryptography and hashed pointers those transactions can be generated and ruled by special networkembedded software known as smart contracts that may be public to all nodes of the network or may be private to a specific set of peer nodes this paper analyses the implementation of blockchain technology targeting grain quality assurance tracking in a real scenario preliminary results support a potential demand for a blockchainbased certification that would lead to an added valuation of around 15 for gmfree soy in the scope of a grain exporter business network in brazil
|
[['one', 'of', 'the', 'key', 'processes', 'in', 'agriculture', 'is', 'quality', 'measurement', 'throughout', 'the', 'transportation', 'of', 'grains', 'along', 'its', 'complex', 'supply', 'chain', 'this', 'procedure', 'is', 'suitable', 'for', 'failures', 'such', 'as', 'delays', 'to', 'final', 'destinations', 'poor', 'monitoring', 'and', 'frauds', 'to', 'address', 'the', 'grain', 'quality', 'measurement', 'challenge', 'through', 'the', 'transportation', 'chain', 'novel', 'technologies', 'such', 'as', 'distributed', 'ledger', 'and', 'blockchain', 'can', 'bring', 'more', 'efficiency', 'and', 'resilience', 'to', 'the', 'process', 'particularly', 'blockchain', 'is', 'a', 'new', 'type', 'of', 'distributed', 'database', 'in', 'which', 'transactions', 'are', 'securely', 'appended', 'using', 'cryptography', 'and', 'hashed', 'pointers', 'those', 'transactions', 'can', 'be', 'generated', 'and', 'ruled', 'by', 'special', 'networkembedded', 'software', 'known', 'as', 'smart', 'contracts', 'that', 'may', 'be', 'public', 'to', 'all', 'nodes', 'of', 'the', 'network', 'or', 'may', 'be', 'private', 'to', 'a', 'specific', 'set', 'of', 'peer', 'nodes', 'this', 'paper', 'analyses', 'the', 'implementation', 'of', 'blockchain', 'technology', 'targeting', 'grain', 'quality', 'assurance', 'tracking', 'in', 'a', 'real', 'scenario', 'preliminary', 'results', 'support', 'a', 'potential', 'demand', 'for', 'a', 'blockchainbased', 'certification', 'that', 'would', 'lead', 'to', 'an', 'added', 'valuation', 'of', 'around', '15', 'for', 'gmfree', 'soy', 'in', 'the', 'scope', 'of', 'a', 'grain', 'exporter', 'business', 'network', 'in', 'brazil']]
|
[-0.16355193393523915, 0.0505610274940409, -0.041645326018278, 0.019912055436883576, -0.08967171037580729, -0.1898073278051535, 0.1128732372869438, 0.37920689671522095, -0.2982198159942137, -0.3124182329075189, 0.16016394427597766, -0.2792450714914594, -0.07697418521621287, 0.19146456790033317, -0.17417615318914786, 0.06618907880779477, 0.07366229400282637, -0.01644008635498938, 0.04437033240295326, -0.3005581050002504, 0.26926324829747456, 0.08483954929258852, 0.30920297685883097, 0.08910666983623135, 0.015809573560199214, -0.004058141397157063, -0.03815682655909941, -0.022035988974883885, -0.05338444672789982, 0.1401969518919941, 0.3410266139696995, 0.2053643194431927, 0.3290935870636964, -0.4481493211462207, -0.1716829151513853, 0.11271606881096627, 0.13819901562549472, 0.07240482570722677, -0.05215707269729007, -0.2945881677469948, 0.1059961150999048, -0.2566508282907307, -0.13066921873195542, -0.07002120821215656, -0.012045379270732934, 0.04501399880003495, -0.27135798270769773, -0.00238985841306636, 0.0018419688900134393, 0.06811834950106761, -0.008219159089743957, -0.06232113192700559, -0.05641496018367997, 0.1714181672751216, 0.020041611727979865, 0.014551948984652492, 0.20248810908205564, -0.12102936892188154, -0.1578624918311973, 0.3912131868045045, 0.017059561468028863, -0.14949979530259347, 0.15002370904299564, -0.03255316267521786, -0.18005444798784861, 0.07893989726116638, 0.24634783373386154, 0.044131525627259784, -0.23691656065472802, -0.005941097094147976, 0.016948471876925657, 0.1724362931937711, 0.04324554313990077, 0.03940562843317388, 0.21376173661389788, 0.20380739166631384, 0.10037179487491292, 0.10857788046165037, -0.038915506370055176, -0.1275233365844802, -0.24945720344424313, -0.2079466599139518, -0.18032817325868, 0.04608780936022023, -0.11327749031685623, -0.17503496903061336, 0.3615092909756294, 0.1826780396330984, 0.13061828300955572, 0.002088196653944795, 0.3445543892670512, 0.00866792195518515, 0.11496742791426923, 0.09643563835804041, 0.1579484291917955, -0.0073135600077442915, 0.18251029179442585, -0.10887089119170837, 0.18455112509850768, -0.039814492526818956]
|
1,803.07878
|
Simplified Approach to the Mixed Time-averaging Semiclassical Initial
Value Representation for the Calculation of Dense Vibrational Spectra
|
We present and test an approximate method for the semiclassical calculation
of vibrational spectra. The approach is based on the mixed time-averaging
semiclassical initial value representation method, which is simplified to a
form that contains a filter to remove contributions from approximately harmonic
environmental degrees of freedom. This filter comes at no additional numerical
cost, and it has no negative effect on the accuracy of peaks from the
anharmonic system of interest. The method is successfully tested for a model
Hamiltonian, and then applied to the study of the frequency shift of iodine in
a krypton matrix. Using a hierarchic model with up to 108 normal modes included
in the calculation, we show how the dynamical interaction between iodine and
krypton yields results for the lowest excited iodine peaks that reproduce
experimental findings to a high degree of accuracy.
|
physics.chem-ph
|
we present and test an approximate method for the semiclassical calculation of vibrational spectra the approach is based on the mixed timeaveraging semiclassical initial value representation method which is simplified to a form that contains a filter to remove contributions from approximately harmonic environmental degrees of freedom this filter comes at no additional numerical cost and it has no negative effect on the accuracy of peaks from the anharmonic system of interest the method is successfully tested for a model hamiltonian and then applied to the study of the frequency shift of iodine in a krypton matrix using a hierarchic model with up to 108 normal modes included in the calculation we show how the dynamical interaction between iodine and krypton yields results for the lowest excited iodine peaks that reproduce experimental findings to a high degree of accuracy
|
[['we', 'present', 'and', 'test', 'an', 'approximate', 'method', 'for', 'the', 'semiclassical', 'calculation', 'of', 'vibrational', 'spectra', 'the', 'approach', 'is', 'based', 'on', 'the', 'mixed', 'timeaveraging', 'semiclassical', 'initial', 'value', 'representation', 'method', 'which', 'is', 'simplified', 'to', 'a', 'form', 'that', 'contains', 'a', 'filter', 'to', 'remove', 'contributions', 'from', 'approximately', 'harmonic', 'environmental', 'degrees', 'of', 'freedom', 'this', 'filter', 'comes', 'at', 'no', 'additional', 'numerical', 'cost', 'and', 'it', 'has', 'no', 'negative', 'effect', 'on', 'the', 'accuracy', 'of', 'peaks', 'from', 'the', 'anharmonic', 'system', 'of', 'interest', 'the', 'method', 'is', 'successfully', 'tested', 'for', 'a', 'model', 'hamiltonian', 'and', 'then', 'applied', 'to', 'the', 'study', 'of', 'the', 'frequency', 'shift', 'of', 'iodine', 'in', 'a', 'krypton', 'matrix', 'using', 'a', 'hierarchic', 'model', 'with', 'up', 'to', '108', 'normal', 'modes', 'included', 'in', 'the', 'calculation', 'we', 'show', 'how', 'the', 'dynamical', 'interaction', 'between', 'iodine', 'and', 'krypton', 'yields', 'results', 'for', 'the', 'lowest', 'excited', 'iodine', 'peaks', 'that', 'reproduce', 'experimental', 'findings', 'to', 'a', 'high', 'degree', 'of', 'accuracy']]
|
[-0.056600237712883826, 0.08682080782104448, -0.11354798792439291, 0.021939260490647376, -0.007777292334990536, -0.11667276268051066, 0.06115352362729341, 0.3811177055371537, -0.20423906643560036, -0.309183487032118, 0.047973227390697856, -0.3082005472170363, -0.12269241274687295, 0.18073323847082773, 3.771150900091199e-05, 0.025984907941557736, 0.10061700727703492, 0.044243062831287226, -0.05951347096074413, -0.19401442346652206, 0.24925508641339705, 0.07162478172535197, 0.2577494840680374, 0.05489207641054079, 0.13715688079568766, -0.030828007984330223, 0.007415454744247438, -0.012173728414362282, -0.10437622667185999, 0.11907885956792362, 0.20933481820954492, 0.06275961868692752, 0.2660653528375484, -0.38533873599451435, -0.192124053636539, 0.06713926141559005, 0.10322450640906157, 0.159265420576323, -0.04880995901214401, -0.25671494021180935, 0.0692911955105851, -0.16548648377532466, -0.15482665999732215, -0.11219898481659002, -0.008309349960399618, -0.019411947884305426, -0.29676956663296805, 0.1111341525009907, 0.0200520345106597, 0.05676598753947631, -0.0750745860457742, -0.151201265421026, -0.04310553024435858, 0.09436061125409474, 0.023092801575448445, -0.0026019586697421807, 0.125067431909131, -0.08076041535848731, -0.07922717362555186, 0.3880535786931249, -0.13039653956900157, -0.20348975792017987, 0.1636287925460061, -0.14022397956804192, -0.11250546563537323, 0.1923443313366432, 0.17310430749701403, 0.08630036167057546, -0.13639117333378054, 0.05109462866110714, -0.0007919487710908162, 0.22774321717216814, 0.06433225974520977, 0.010021366321367861, 0.13934664276475422, 0.1465097944714504, 0.028758111001133062, 0.14471926804960256, -0.10483374406429503, -0.0813312714428661, -0.2886075967702539, -0.1269026647904794, -0.2013071939657382, 0.010222761161464582, -0.06036067128863199, -0.14495114894188513, 0.43620370114523677, 0.1794024040083327, 0.18624282149236193, 0.010572367415616034, 0.31992394736425267, 0.1496032308519101, 0.06715638326521185, 0.008982124711594564, 0.24716748453998308, 0.15254839487615035, 0.046128436614819565, -0.28119336504475784, 0.01099459048889899, 0.04447057516240387]
|
1,803.07879
|
An Unsupervised Multivariate Time Series Kernel Approach for Identifying
Patients with Surgical Site Infection from Blood Samples
|
A large fraction of the electronic health records consists of clinical
measurements collected over time, such as blood tests, which provide important
information about the health status of a patient. These sequences of clinical
measurements are naturally represented as time series, characterized by
multiple variables and the presence of missing data, which complicate analysis.
In this work, we propose a surgical site infection detection framework for
patients undergoing colorectal cancer surgery that is completely unsupervised,
hence alleviating the problem of getting access to labelled training data. The
framework is based on powerful kernels for multivariate time series that
account for missing data when computing similarities. Our approach show
superior performance compared to baselines that have to resort to imputation
techniques and performs comparable to a supervised classification baseline.
|
stat.ML cs.LG
|
a large fraction of the electronic health records consists of clinical measurements collected over time such as blood tests which provide important information about the health status of a patient these sequences of clinical measurements are naturally represented as time series characterized by multiple variables and the presence of missing data which complicate analysis in this work we propose a surgical site infection detection framework for patients undergoing colorectal cancer surgery that is completely unsupervised hence alleviating the problem of getting access to labelled training data the framework is based on powerful kernels for multivariate time series that account for missing data when computing similarities our approach show superior performance compared to baselines that have to resort to imputation techniques and performs comparable to a supervised classification baseline
|
[['a', 'large', 'fraction', 'of', 'the', 'electronic', 'health', 'records', 'consists', 'of', 'clinical', 'measurements', 'collected', 'over', 'time', 'such', 'as', 'blood', 'tests', 'which', 'provide', 'important', 'information', 'about', 'the', 'health', 'status', 'of', 'a', 'patient', 'these', 'sequences', 'of', 'clinical', 'measurements', 'are', 'naturally', 'represented', 'as', 'time', 'series', 'characterized', 'by', 'multiple', 'variables', 'and', 'the', 'presence', 'of', 'missing', 'data', 'which', 'complicate', 'analysis', 'in', 'this', 'work', 'we', 'propose', 'a', 'surgical', 'site', 'infection', 'detection', 'framework', 'for', 'patients', 'undergoing', 'colorectal', 'cancer', 'surgery', 'that', 'is', 'completely', 'unsupervised', 'hence', 'alleviating', 'the', 'problem', 'of', 'getting', 'access', 'to', 'labelled', 'training', 'data', 'the', 'framework', 'is', 'based', 'on', 'powerful', 'kernels', 'for', 'multivariate', 'time', 'series', 'that', 'account', 'for', 'missing', 'data', 'when', 'computing', 'similarities', 'our', 'approach', 'show', 'superior', 'performance', 'compared', 'to', 'baselines', 'that', 'have', 'to', 'resort', 'to', 'imputation', 'techniques', 'and', 'performs', 'comparable', 'to', 'a', 'supervised', 'classification', 'baseline']]
|
[-0.05283863424847368, 0.025828467281826306, -0.07603131909127114, 0.09782327809170965, -0.09902191901346669, -0.18033200571881025, 0.07955166513602308, 0.3797107602131291, -0.21253436453116592, -0.32505251641350696, 0.1441158760962935, -0.30043820082210004, -0.13241800184187014, 0.23096431815065444, -0.13345280562862172, 0.05550218634016346, 0.1976147033055895, 0.041729524351694636, -0.02101643210517068, -0.2932135165656291, 0.26414325456426013, 0.0519621006314992, 0.33891858241713635, 0.0016129208552229102, 0.11070698451931094, 0.04519114912363875, -0.09287264447266352, 0.01642728427395923, -0.04025768296099841, 0.12070219649376668, 0.39418274151466903, 0.2028126413388236, 0.346460723070777, -0.432405552106502, -0.23729805425136874, 0.12337440241390141, 0.1368741080059408, 0.07963450204806577, -0.03188588862030883, -0.3148970912916411, 0.0591020688698336, -0.14724696916528046, -0.03696300779301964, -0.15465989717267803, -0.03493684592831414, -0.026964815337123582, -0.3255163472422282, 0.146148678893951, -0.003324348770547658, 0.12426276987389429, -0.08017114926769864, -0.12786847216557362, 0.037768607082398375, 0.19760630174937432, 0.09278588836241397, 0.05035637541277538, 0.13323663789014972, -0.1338169590326288, -0.15719533292212873, 0.33066851837793365, -0.002768604951143061, -0.16348259853111813, 0.1841865558835707, -0.08179472505435115, -0.17407278764949297, 0.12793527577014174, 0.2242449214336375, 0.08935147182273795, -0.20807593533629642, -0.052201018102095986, 0.0007034383888822049, 0.1569288334248995, 0.03999942506925436, -0.0004088136010977905, 0.15019950701071139, 0.25177914329651685, 0.003853557236652705, 0.10762039855399053, -0.1382711522583122, -0.04023304887232371, -0.2235594190537995, -0.13887578981666593, -0.17509823432010307, 0.024491353758094192, -0.0983379981660164, -0.2008434269191639, 0.3971854823830654, 0.19457975426121266, 0.1921490055956383, 0.06775942999774998, 0.34669151171692647, 0.007756289072858635, 0.11522336725192872, 0.02811250303784618, 0.10079904610483936, 0.02903986433193495, 0.11840716127881024, -0.2052860404846797, 0.13944386093498906, -0.0024800412174954545]
|
1,803.0788
|
Certain Classes of Cohen-Macaulay Multipartite Graphs
|
The Cohen-Macaulay property of a graph arising from a poset has been studied
by various authors. In this article, we study the Cohen-Macaulay property of a
graph arising from a family of reflexive and antisymmetric relations on a set.
We use this result to find classes of multipartite graphs which are
Cohen-Macaulay.
|
math.AC
|
the cohenmacaulay property of a graph arising from a poset has been studied by various authors in this article we study the cohenmacaulay property of a graph arising from a family of reflexive and antisymmetric relations on a set we use this result to find classes of multipartite graphs which are cohenmacaulay
|
[['the', 'cohenmacaulay', 'property', 'of', 'a', 'graph', 'arising', 'from', 'a', 'poset', 'has', 'been', 'studied', 'by', 'various', 'authors', 'in', 'this', 'article', 'we', 'study', 'the', 'cohenmacaulay', 'property', 'of', 'a', 'graph', 'arising', 'from', 'a', 'family', 'of', 'reflexive', 'and', 'antisymmetric', 'relations', 'on', 'a', 'set', 'we', 'use', 'this', 'result', 'to', 'find', 'classes', 'of', 'multipartite', 'graphs', 'which', 'are', 'cohenmacaulay']]
|
[-0.16567322260771805, 0.022357614872117456, -0.08347074856283143, 0.04965113584722321, -0.1035402906127274, -0.09759720088018534, -0.028499349306982297, 0.37127931595135194, -0.3637838640536826, -0.22429564301497662, 0.11667327502017052, -0.29226379619481474, -0.17317605305176514, 0.136582921187465, -0.13289968277184436, -0.004104609690749874, 0.08713489077770366, 0.0702243815176189, -0.05078510453817076, -0.2701368667778577, 0.4680925692216708, -0.07170437491283967, 0.23619500182282466, 0.0733502519209511, 0.09107898184223674, -0.006714511456756065, -0.02809678974489753, 0.14129776779848796, -0.2145002398532457, 0.1560342377409912, 0.30377548581992203, 0.1521036583939209, 0.23927885522453624, -0.34574209314842635, -0.13675681940423182, 0.26441100001550066, 0.07837655204975118, 0.09207545171375386, -0.03771102302394306, -0.2672401000208293, 0.10154920481503583, -0.22682649004631317, -0.10595912815859684, -0.06747335944181451, 0.04599574459000276, 0.0019487089504344533, -0.2615081702466481, -0.012584714899555994, 0.17071819172885555, 0.15753165865316987, 0.05581893479057516, -0.07300802797544748, -0.0652984994835256, 0.03655014055458686, -0.04638189643334884, -0.017996707344606806, 0.02223335759033664, -0.1089632629792994, -0.18129138878206363, 0.369006832330622, 0.002183013022519075, -0.15023931617347094, 0.16154956679719573, -0.14357329139378494, -0.20619021197601867, 0.06898954038758977, 0.13062370541648796, 0.16435881958414728, -0.12556923782596222, 0.1482679956724706, -0.19978991507266003, 0.036301229372978784, 0.11522117804270238, 0.06495598873768288, 0.13041017985401246, 0.15069986209094238, 0.06058370717801154, 0.25050847148164535, 0.026165855461910654, -0.010174957632373732, -0.27796115206841093, -0.1438721424470154, -0.21424873323681262, 0.12204085929820743, -0.0928190307411289, -0.16700823073132107, 0.4857959013002423, 0.10148474631401208, 0.1930366962825736, 0.09175241511324063, 0.18627988359031195, -5.1663957632487065e-05, 0.0646532294429982, 0.05505356167514737, 0.16391338006808207, 0.23172331245419067, 0.008665654244116293, -0.09570169093338056, 0.05528187389091517, 0.17105882459033567]
|
1,803.07881
|
Many-Body Expansion Dynamics of a Bose-Fermi Mixture Confined in an
Optical Lattice
|
We unravel the correlated non-equilibrium dynamics of a mass balanced
Bose-Fermi mixture in a one-dimensional optical lattice upon quenching an
imposed harmonic trap from strong to weak confinement. Regarding the system's
ground state, the competition between the inter and intraspecies interaction
strength gives rise to the immiscible and miscible phases characterized by
negligible and complete overlap of the constituting atomic clouds respectively.
The resulting dynamical response depends strongly on the initial phase and
consists of an expansion of each cloud and an interwell tunneling dynamics. For
varying quench amplitude and referring to a fixed phase a multitude of response
regimes is unveiled, being richer within the immiscible phase, which are
described by distinct expansion strengths and tunneling channels.
|
quant-ph cond-mat.quant-gas physics.atom-ph
|
we unravel the correlated nonequilibrium dynamics of a mass balanced bosefermi mixture in a onedimensional optical lattice upon quenching an imposed harmonic trap from strong to weak confinement regarding the systems ground state the competition between the inter and intraspecies interaction strength gives rise to the immiscible and miscible phases characterized by negligible and complete overlap of the constituting atomic clouds respectively the resulting dynamical response depends strongly on the initial phase and consists of an expansion of each cloud and an interwell tunneling dynamics for varying quench amplitude and referring to a fixed phase a multitude of response regimes is unveiled being richer within the immiscible phase which are described by distinct expansion strengths and tunneling channels
|
[['we', 'unravel', 'the', 'correlated', 'nonequilibrium', 'dynamics', 'of', 'a', 'mass', 'balanced', 'bosefermi', 'mixture', 'in', 'a', 'onedimensional', 'optical', 'lattice', 'upon', 'quenching', 'an', 'imposed', 'harmonic', 'trap', 'from', 'strong', 'to', 'weak', 'confinement', 'regarding', 'the', 'systems', 'ground', 'state', 'the', 'competition', 'between', 'the', 'inter', 'and', 'intraspecies', 'interaction', 'strength', 'gives', 'rise', 'to', 'the', 'immiscible', 'and', 'miscible', 'phases', 'characterized', 'by', 'negligible', 'and', 'complete', 'overlap', 'of', 'the', 'constituting', 'atomic', 'clouds', 'respectively', 'the', 'resulting', 'dynamical', 'response', 'depends', 'strongly', 'on', 'the', 'initial', 'phase', 'and', 'consists', 'of', 'an', 'expansion', 'of', 'each', 'cloud', 'and', 'an', 'interwell', 'tunneling', 'dynamics', 'for', 'varying', 'quench', 'amplitude', 'and', 'referring', 'to', 'a', 'fixed', 'phase', 'a', 'multitude', 'of', 'response', 'regimes', 'is', 'unveiled', 'being', 'richer', 'within', 'the', 'immiscible', 'phase', 'which', 'are', 'described', 'by', 'distinct', 'expansion', 'strengths', 'and', 'tunneling', 'channels']]
|
[-0.20144022840974948, 0.2562219599271499, -0.05970135355620819, 0.011765833491246389, 0.026132463665000338, -0.1620966756876195, 0.0639070978790711, 0.35349324594993714, -0.2625867506031389, -0.24400497640688287, -0.0003164392290242269, -0.24956258264038775, -0.091546383033254, 0.12076646481025016, 0.057889361942771, -0.014536060184690218, -0.0003453845047723439, -0.03063402209683495, -0.08104362248411497, -0.19459087505908998, 0.337665925173373, 0.013928671079387858, 0.2984920492301048, 0.07312276198576062, 0.08906743210598321, 0.03682325150170442, 0.03612357485690154, 0.013343642272402421, -0.15895404189162082, 0.03156541922658492, 0.16215138376534569, -0.029305348748941036, 0.22328035666023271, -0.4460078154422216, -0.19718696400365335, 0.06810573573220301, 0.16685289895690789, 0.13642783043412807, -0.009548262792631542, -0.3299993390209531, -0.07590159172413208, -0.15898904602153827, -0.1292866808441231, -0.08124932104532244, 0.04768734455298064, 0.0738372857193068, -0.29054087772176174, 0.12377909263122384, 0.043650275124661166, 0.07703433228238343, -0.09847626551567434, -0.047726454876236994, -0.04430574463617246, 0.13285334613292588, -0.011736708892493557, 0.029544818910604374, 0.1396049886105298, -0.18086730896384787, -0.041301253196483444, 0.37970524859788307, -0.07063291589946534, -0.11765270935118956, 0.28542048910285456, -0.12841523516643497, -0.038326950435984435, 0.19653545659414287, 0.12984060829947308, 0.03769256523810327, -0.12756202858478083, 0.02447961601957736, 0.01463304347974264, 0.2021642827961132, 0.06457030415235056, 0.057490054076000795, 0.28177483943369935, 0.19234713095721742, 0.03319609229910677, 0.18449173876384306, -0.06382322562976851, -0.18992049430133934, -0.23586332894293432, -0.07225151937967955, -0.2003458687025359, 0.01958097858054532, -0.08642860185031846, -0.1858038124667828, 0.39640790087928585, 0.08685464349326726, 0.21770779644454813, -0.03739577157213747, 0.2752762614054826, 0.12106383351167127, -0.010007883122159262, 0.008428712223715176, 0.25468633511356253, 0.17817658681611895, 0.07672170904599193, -0.32573614253907196, 0.0624540799250037, 0.055697632284629775]
|
1,803.07882
|
Doubly stochastic operators with zero entropy
|
We study doubly stochastic operators with zero entropy. We generalize three
famous theorems: the Rokhlin's theorem on genericity of zero entropy, the
Kushnirenko's theorem on equivalence of discrete spectrum and nullity and the
Halmos-von Neumann's theorem on representation of maps with discrete spectrum
as group rotations.
|
math.DS math.FA
|
we study doubly stochastic operators with zero entropy we generalize three famous theorems the rokhlins theorem on genericity of zero entropy the kushnirenkos theorem on equivalence of discrete spectrum and nullity and the halmosvon neumanns theorem on representation of maps with discrete spectrum as group rotations
|
[['we', 'study', 'doubly', 'stochastic', 'operators', 'with', 'zero', 'entropy', 'we', 'generalize', 'three', 'famous', 'theorems', 'the', 'rokhlins', 'theorem', 'on', 'genericity', 'of', 'zero', 'entropy', 'the', 'kushnirenkos', 'theorem', 'on', 'equivalence', 'of', 'discrete', 'spectrum', 'and', 'nullity', 'and', 'the', 'halmosvon', 'neumanns', 'theorem', 'on', 'representation', 'of', 'maps', 'with', 'discrete', 'spectrum', 'as', 'group', 'rotations']]
|
[-0.12198134130713614, 0.09483093323863366, -0.15022966286844827, 0.10548299713462422, -0.024765539284668524, -0.16239641260736706, 0.06372240812263706, 0.2614540173248811, -0.2938749461688779, -0.19881640408526768, 0.1431556881447746, -0.32130447987318883, -0.10952798802066933, 0.18812422848052598, -0.15172214327718725, 0.0465764367360283, 0.047680698155256156, 0.09548134864731268, -0.12201428233476524, -0.1836388799155512, 0.40961438773030584, -0.022728323936462402, 0.312327206177129, 0.09947358016242189, 0.1268527094613422, 0.08666281137530776, -0.07281444882127372, -0.03178382211957465, -0.1499226430261677, 0.12480626106050542, 0.19556453542529859, 0.12322057501031933, 0.21943391032982618, -0.3402429698035121, -0.16395991478136487, 0.1944725111296231, 0.008558781393565534, 0.02421152460473505, 0.021226555937160316, -0.31286725169047713, 0.0927567210746929, -0.14272419905120676, -0.18418970581313426, -0.10318642009091987, -0.034258755326101724, -0.0009609609895216471, -0.17206750293685633, 0.16089478627228262, 0.22706908283924515, 0.10795843749391762, -0.0997364666016603, -0.06964330838739195, -0.0600555768892677, 0.06778984988870268, 0.07577184621583331, -0.06757698610784825, 0.08825983308171007, 0.030615232207558372, -0.20781317164867438, 0.2971900182310492, -0.11825735972855579, -0.2378306667405096, 0.15383536567572842, -0.15299733700654047, -0.24101222556253726, 0.028509555067020385, 0.13732650626281445, 0.14810854806141419, -0.04292299757203595, 0.1655369904289149, -0.1439743525221605, 0.07922296329607806, 0.13649160713380712, 0.062074271623383866, 0.09165832551661879, 0.012913297501985322, 0.14639101044105535, 0.19807552779093385, 0.0016596780730072749, -0.1362188654443757, -0.3494266943836754, -0.14904459136728707, -0.18707777976735748, 0.14393803392621604, -0.13378996391375866, -0.211415591141717, 0.3947675667110492, 0.037798078254457905, 0.13487468325448307, 0.1812142948196693, 0.24209980706853623, 0.1831516886939591, 0.02406477494249967, 0.04208500917196612, 0.12337766206738623, 0.3545708490789614, 0.04001424612943083, -0.14519899173385717, -0.08492141021733088, 0.2748768931593407]
|
1,803.07883
|
Scan transcription of two-dimensional shapes as an alternative
neuromorphic concept
|
Selfridge, along with Sutherland and Marr provided some of the earliest
proposals for how to program computers to recognize shapes. Their emphasis on
filtering for contour features, especially the orientation of boundary
segments, was reinforced by the Nobel Prize winning work of Hubel & Wiesel who
discovered that neurons in primary visual cortex selectively respond as a
function of contour orientation. Countless investigators and theorists have
continued to build on this approach. These models are often described as
neuromorphic, which implies that the computational methods are based on
biologically plausible principles. Recent work from the present lab has
challenged the emphasis on orientation selectivity and the use of neural
network principles. The goal of the present report is not to relitigate those
issues, but to provide an alternative concept for encoding of shape information
that may be useful to neuromorphic modelers.
|
q-bio.NC
|
selfridge along with sutherland and marr provided some of the earliest proposals for how to program computers to recognize shapes their emphasis on filtering for contour features especially the orientation of boundary segments was reinforced by the nobel prize winning work of hubel wiesel who discovered that neurons in primary visual cortex selectively respond as a function of contour orientation countless investigators and theorists have continued to build on this approach these models are often described as neuromorphic which implies that the computational methods are based on biologically plausible principles recent work from the present lab has challenged the emphasis on orientation selectivity and the use of neural network principles the goal of the present report is not to relitigate those issues but to provide an alternative concept for encoding of shape information that may be useful to neuromorphic modelers
|
[['selfridge', 'along', 'with', 'sutherland', 'and', 'marr', 'provided', 'some', 'of', 'the', 'earliest', 'proposals', 'for', 'how', 'to', 'program', 'computers', 'to', 'recognize', 'shapes', 'their', 'emphasis', 'on', 'filtering', 'for', 'contour', 'features', 'especially', 'the', 'orientation', 'of', 'boundary', 'segments', 'was', 'reinforced', 'by', 'the', 'nobel', 'prize', 'winning', 'work', 'of', 'hubel', 'wiesel', 'who', 'discovered', 'that', 'neurons', 'in', 'primary', 'visual', 'cortex', 'selectively', 'respond', 'as', 'a', 'function', 'of', 'contour', 'orientation', 'countless', 'investigators', 'and', 'theorists', 'have', 'continued', 'to', 'build', 'on', 'this', 'approach', 'these', 'models', 'are', 'often', 'described', 'as', 'neuromorphic', 'which', 'implies', 'that', 'the', 'computational', 'methods', 'are', 'based', 'on', 'biologically', 'plausible', 'principles', 'recent', 'work', 'from', 'the', 'present', 'lab', 'has', 'challenged', 'the', 'emphasis', 'on', 'orientation', 'selectivity', 'and', 'the', 'use', 'of', 'neural', 'network', 'principles', 'the', 'goal', 'of', 'the', 'present', 'report', 'is', 'not', 'to', 'relitigate', 'those', 'issues', 'but', 'to', 'provide', 'an', 'alternative', 'concept', 'for', 'encoding', 'of', 'shape', 'information', 'that', 'may', 'be', 'useful', 'to', 'neuromorphic', 'modelers']]
|
[-0.05191942285779837, 0.06226710796035012, -0.10475309881911003, 0.02575414017405656, -0.15621724377868684, -0.17224459112965226, 0.024919516710135682, 0.42245204342033366, -0.22629150164668724, -0.32917188438955397, 0.10257106896978971, -0.25146794078617, -0.22750779731440351, 0.2123986755718859, -0.1287890482332102, 0.06111902615604855, 0.0695344048096604, 0.020914488855838145, 0.009204770349595937, -0.26826623695895824, 0.264561514683376, 0.10515502312307735, 0.2811995494722141, 0.033811493105047365, 0.09195928984797365, -0.022483123731028905, -0.052916230290471544, -0.01192031261467596, -0.10838228666717513, 0.20003487396543082, 0.2862000499039659, 0.18486781050568352, 0.3002091649779045, -0.4867588257108875, -0.20455397678796275, 0.0402087098374467, 0.12257481090265507, 0.0936827578928603, -0.03605787282836416, -0.3146604575859986, 0.06160069592699087, -0.13497111643497034, -0.10496133414834986, -0.08849889445771872, 0.04889182122960258, 0.04311573041415365, -0.17501185979466322, -0.008635380613557297, 0.06749553841382948, 0.08389295145480645, -0.03619660125047022, -0.13856221677186034, 0.013219613062633242, 0.16016364785031878, 0.04095702173972248, 0.060636438629522976, 0.1536241582123288, -0.16383138751751816, -0.15642435813872077, 0.3544343661972516, 0.019482911123874055, -0.18298844855426133, 0.20306795354925847, -0.08907610631259762, -0.17986558656469523, 0.07190944685051284, 0.17363432057791475, 0.09255760365748684, -0.15791998996915255, 0.016116545006782303, -0.02171078694083145, 0.15395267821995795, 0.05941187812471025, 0.011697002421903739, 0.25043985847276534, 0.17457907154432517, 0.011383739676956328, 0.10456517043275584, -0.05379619974418537, -0.0830889987832994, -0.22331441997838536, -0.12742738285363256, -0.18201441542922164, 0.0008132259040885009, -0.008577223243748789, -0.13900860350766628, 0.3835150144672651, 0.19870923645543134, 0.20189308345974458, 0.05979145395405349, 0.255666367763238, 0.03608801925266764, 0.10481265316744127, 0.024052457625997795, 0.23602804088426532, 0.08244810697267489, 0.12295022798893075, -0.17707906693401043, 0.13705760552510185, 0.06165510124573819]
|
1,803.07884
|
Parabolic equations with rough coefficients and singular forcing
|
This article focuses on parabolic equations with rough diffusion coefficients
which are ill-posed in the classical sense of distributions due to the presence
of a singular forcing. Inspired by the philosophy of rough paths and regularity
structures, we introduce a notion of modelled distribution which is suitable in
this context. We prove two general tools for reconstruction and integration, as
well as a product lemma which is tailor made for the reconstruction of the
rough diffusion operator. This yields a partially automated deterministic
theory, which we apply to obtain an existence and uniqueness theory for
parabolic equations with rough diffusion coefficients and a singular forcing in
the negative parabolic H\"{o}lder space of order larger than $-\frac{3}{2}$.
|
math.AP math.PR
|
this article focuses on parabolic equations with rough diffusion coefficients which are illposed in the classical sense of distributions due to the presence of a singular forcing inspired by the philosophy of rough paths and regularity structures we introduce a notion of modelled distribution which is suitable in this context we prove two general tools for reconstruction and integration as well as a product lemma which is tailor made for the reconstruction of the rough diffusion operator this yields a partially automated deterministic theory which we apply to obtain an existence and uniqueness theory for parabolic equations with rough diffusion coefficients and a singular forcing in the negative parabolic holder space of order larger than frac32
|
[['this', 'article', 'focuses', 'on', 'parabolic', 'equations', 'with', 'rough', 'diffusion', 'coefficients', 'which', 'are', 'illposed', 'in', 'the', 'classical', 'sense', 'of', 'distributions', 'due', 'to', 'the', 'presence', 'of', 'a', 'singular', 'forcing', 'inspired', 'by', 'the', 'philosophy', 'of', 'rough', 'paths', 'and', 'regularity', 'structures', 'we', 'introduce', 'a', 'notion', 'of', 'modelled', 'distribution', 'which', 'is', 'suitable', 'in', 'this', 'context', 'we', 'prove', 'two', 'general', 'tools', 'for', 'reconstruction', 'and', 'integration', 'as', 'well', 'as', 'a', 'product', 'lemma', 'which', 'is', 'tailor', 'made', 'for', 'the', 'reconstruction', 'of', 'the', 'rough', 'diffusion', 'operator', 'this', 'yields', 'a', 'partially', 'automated', 'deterministic', 'theory', 'which', 'we', 'apply', 'to', 'obtain', 'an', 'existence', 'and', 'uniqueness', 'theory', 'for', 'parabolic', 'equations', 'with', 'rough', 'diffusion', 'coefficients', 'and', 'a', 'singular', 'forcing', 'in', 'the', 'negative', 'parabolic', 'holder', 'space', 'of', 'order', 'larger', 'than', 'frac32']]
|
[-0.09733849136431798, 0.09392665719308846, -0.08466169312154746, 0.07705478660525465, -0.12065438055915051, -0.11429466383836778, -0.0276598482962762, 0.3022546217664434, -0.3421645336944995, -0.2375677233955277, 0.13524702059482385, -0.2491561572412671, -0.16128324678143616, 0.19373015649937864, -0.1121776156279997, 0.08429381030346748, 0.06349430472493686, 0.006134769445734805, -0.07739082121306323, -0.2113598526218617, 0.37739700899798884, -0.01948451716452837, 0.22936156102263466, 0.029096715553695786, 0.13889870901014015, 0.05217769338171287, -0.0609354723188705, 0.03870107749941686, -0.19316547175047413, 0.19931277739293551, 0.24276964839523787, 0.009697848119058421, 0.30036994438730824, -0.39627536110869, -0.23659448348114204, 0.0792320054987895, 0.10779764361936471, 0.09202099944553177, -0.030073584441761968, -0.2764554198124799, 0.08544705343304267, -0.12023422085872755, -0.19798077777899192, -0.07348255304105837, 0.015794374482256585, 0.03891323398445444, -0.3145318988325267, 0.10730561946422376, 0.11066764357182647, 0.06523917469292365, -0.09278580668013028, -0.06898144955228983, 0.0008776435941650436, 0.060307703739642324, 0.02416841593442549, 0.003888004517648369, 0.04766792692806058, -0.11174934271698946, -0.1123594017388251, 0.35173912988253064, -0.1061899614283777, -0.28720988485769466, 0.18195268953347515, -0.1196930984894199, -0.09879325598012656, 0.10560676805546572, 0.1651914716569771, 0.1659950996098783, -0.15339602024599525, 0.11474771618818992, -0.049148713744341814, 0.10769699327647686, 0.10883423847001816, 0.0033426141624282725, 0.0905638886615634, 0.15401322202724888, 0.16430895934523693, 0.1199823377136109, -0.018389006036911803, -0.11906648094862185, -0.3297687862871279, -0.16730587074236045, -0.12905655750314352, 0.10745445097363072, -0.07520810058209965, -0.2741347779921288, 0.33939130250605404, 0.148095305354218, 0.20614005915884828, 0.08100297768471827, 0.2580700430151974, 0.17097900307472347, 0.001918118651795747, 0.06232955378248429, 0.19217922517243002, 0.19312481317420266, 0.11901388675624762, -0.13797612752612873, 0.08698159009860508, 0.144316144584646]
|
1,803.07885
|
On the necessary and sufficient conditions to solve a heat equation with
general additive Gaussian noise
|
In this note we consider stochastic heat equation with general additive
Gaussian noise. Our aim is to derive some necessary and sufficient conditions
on the Gaussian noise in order to solve the corresponding heat equation. We
investigate this problem invoking two different methods, respectively based on
variance computations and on path-wise considerations in Besov spaces. We are
going to see that, as anticipated, both approaches lead to the same necessary
and sufficient condition on the noise. In addition, the path-wise approach
brings out regularity results for the solution.
|
math.PR
|
in this note we consider stochastic heat equation with general additive gaussian noise our aim is to derive some necessary and sufficient conditions on the gaussian noise in order to solve the corresponding heat equation we investigate this problem invoking two different methods respectively based on variance computations and on pathwise considerations in besov spaces we are going to see that as anticipated both approaches lead to the same necessary and sufficient condition on the noise in addition the pathwise approach brings out regularity results for the solution
|
[['in', 'this', 'note', 'we', 'consider', 'stochastic', 'heat', 'equation', 'with', 'general', 'additive', 'gaussian', 'noise', 'our', 'aim', 'is', 'to', 'derive', 'some', 'necessary', 'and', 'sufficient', 'conditions', 'on', 'the', 'gaussian', 'noise', 'in', 'order', 'to', 'solve', 'the', 'corresponding', 'heat', 'equation', 'we', 'investigate', 'this', 'problem', 'invoking', 'two', 'different', 'methods', 'respectively', 'based', 'on', 'variance', 'computations', 'and', 'on', 'pathwise', 'considerations', 'in', 'besov', 'spaces', 'we', 'are', 'going', 'to', 'see', 'that', 'as', 'anticipated', 'both', 'approaches', 'lead', 'to', 'the', 'same', 'necessary', 'and', 'sufficient', 'condition', 'on', 'the', 'noise', 'in', 'addition', 'the', 'pathwise', 'approach', 'brings', 'out', 'regularity', 'results', 'for', 'the', 'solution']]
|
[-0.08675058658065443, 0.023396875147062183, -0.08892696726516905, 0.13625507800580552, -0.07952869022317993, -0.12432770670222287, 0.0450057712507921, 0.373350045601414, -0.2620082144302697, -0.254028550402092, 0.154066338209139, -0.22856038370677692, -0.16640678288372743, 0.19798318414938298, -0.1483818160750988, 0.08179647530513731, 0.049044655858200385, 0.02824757709591226, -0.09187145798668181, -0.2831814087720969, 0.3635297819802707, 0.014215956039896066, 0.26660778117366135, 0.061894637535178015, 0.12175418727565557, -0.04490551055641845, -0.0706435739941133, -0.00782862572867254, -0.22874388549602867, 0.07816315710475795, 0.2099211119030687, 0.06681488930586386, 0.3094257368621501, -0.4659780168440193, -0.20182242264590142, 0.14962739273059097, 0.0925374971963968, 0.1163521019149233, -0.0004159597420683977, -0.2572183007035743, 0.08874113789219833, -0.0794764910930429, -0.11875456408597529, -0.14072592058007352, -0.07226282363461162, 0.04998639156110585, -0.3289761328752237, 0.09753273156556216, 0.12872058498165148, -0.010311132222837345, -0.11461399039465257, -0.12790454551445277, 0.0632527667357036, 0.07031395051374355, 0.0506010646653191, -0.02066681399248244, 0.06566282709404318, -0.09016812874787403, -0.07986123470420187, 0.3350942991144786, -0.10347805865008426, -0.30378138938580046, 0.19790468987775967, -0.12545952230522578, -0.15068100996590642, 0.08550685468733056, 0.17866850017294797, 0.09772698806641116, -0.20789108303671872, 0.08262695166591914, 0.015983691354366867, 0.11925896846646951, 0.07917280206774277, 0.04645554006261095, 0.08310113241896033, 0.1357430381467566, 0.14318286142819983, 0.1728287095399785, -0.06580893882148137, -0.11373313621879788, -0.34840006042610516, -0.1313655453585935, -0.14054022760088133, 0.08945027568419887, -0.0959394896789573, -0.13812706344337625, 0.3269969705830921, 0.24993793036661704, 0.15326341001359237, 0.07641062812498686, 0.28549476484080183, 0.17447357588654003, -0.047882140658409546, 0.09646081586834043, 0.18366033473450277, 0.18833750699890184, 0.15561278176028281, -0.1988248025035401, 0.04104755103154192, 0.07018885737158019]
|
1,803.07886
|
Beyond activator-inhibitor networks: the generalised Turing mechanism
|
The Turing patterning mechanism is believed to underly the formation of
repetitive structures in development, such as zebrafish stripes and mammalian
digits, but it has proved difficult to isolate the specific biochemical species
responsible for pattern formation. Meanwhile, synthetic biologists have
designed Turing systems for implementation in cell colonies, but none have yet
led to visible patterns in the laboratory. In both cases, the relationship
between underlying chemistry and emergent biology remains mysterious. To help
resolve the mystery, this article asks the question: what kinds of biochemical
systems can generate Turing patterns? We find general conditions for Turing
pattern inception -- the ability to generate unstable patterns from random
noise -- which may lead to the ultimate formation of stable patterns, depending
on biochemical non-linearities. We find that a wide variety of systems can
generate stable Turing patterns, including several which are currently unknown,
such as two-species systems composed of two self-activators, and systems
composed of a short-range inhibitor and a long-range activator. We furthermore
find that systems which are widely believed to generate stable patterns may in
fact only generate unstable patterns, which ultimately converge to
spatially-homogeneous concentrations. Our results suggest that a much wider
variety of systems than is commonly believed could be responsible for observed
patterns in development, or could be good candidates for synthetic patterning
networks.
|
q-bio.MN
|
the turing patterning mechanism is believed to underly the formation of repetitive structures in development such as zebrafish stripes and mammalian digits but it has proved difficult to isolate the specific biochemical species responsible for pattern formation meanwhile synthetic biologists have designed turing systems for implementation in cell colonies but none have yet led to visible patterns in the laboratory in both cases the relationship between underlying chemistry and emergent biology remains mysterious to help resolve the mystery this article asks the question what kinds of biochemical systems can generate turing patterns we find general conditions for turing pattern inception the ability to generate unstable patterns from random noise which may lead to the ultimate formation of stable patterns depending on biochemical nonlinearities we find that a wide variety of systems can generate stable turing patterns including several which are currently unknown such as twospecies systems composed of two selfactivators and systems composed of a shortrange inhibitor and a longrange activator we furthermore find that systems which are widely believed to generate stable patterns may in fact only generate unstable patterns which ultimately converge to spatiallyhomogeneous concentrations our results suggest that a much wider variety of systems than is commonly believed could be responsible for observed patterns in development or could be good candidates for synthetic patterning networks
|
[['the', 'turing', 'patterning', 'mechanism', 'is', 'believed', 'to', 'underly', 'the', 'formation', 'of', 'repetitive', 'structures', 'in', 'development', 'such', 'as', 'zebrafish', 'stripes', 'and', 'mammalian', 'digits', 'but', 'it', 'has', 'proved', 'difficult', 'to', 'isolate', 'the', 'specific', 'biochemical', 'species', 'responsible', 'for', 'pattern', 'formation', 'meanwhile', 'synthetic', 'biologists', 'have', 'designed', 'turing', 'systems', 'for', 'implementation', 'in', 'cell', 'colonies', 'but', 'none', 'have', 'yet', 'led', 'to', 'visible', 'patterns', 'in', 'the', 'laboratory', 'in', 'both', 'cases', 'the', 'relationship', 'between', 'underlying', 'chemistry', 'and', 'emergent', 'biology', 'remains', 'mysterious', 'to', 'help', 'resolve', 'the', 'mystery', 'this', 'article', 'asks', 'the', 'question', 'what', 'kinds', 'of', 'biochemical', 'systems', 'can', 'generate', 'turing', 'patterns', 'we', 'find', 'general', 'conditions', 'for', 'turing', 'pattern', 'inception', 'the', 'ability', 'to', 'generate', 'unstable', 'patterns', 'from', 'random', 'noise', 'which', 'may', 'lead', 'to', 'the', 'ultimate', 'formation', 'of', 'stable', 'patterns', 'depending', 'on', 'biochemical', 'nonlinearities', 'we', 'find', 'that', 'a', 'wide', 'variety', 'of', 'systems', 'can', 'generate', 'stable', 'turing', 'patterns', 'including', 'several', 'which', 'are', 'currently', 'unknown', 'such', 'as', 'twospecies', 'systems', 'composed', 'of', 'two', 'selfactivators', 'and', 'systems', 'composed', 'of', 'a', 'shortrange', 'inhibitor', 'and', 'a', 'longrange', 'activator', 'we', 'furthermore', 'find', 'that', 'systems', 'which', 'are', 'widely', 'believed', 'to', 'generate', 'stable', 'patterns', 'may', 'in', 'fact', 'only', 'generate', 'unstable', 'patterns', 'which', 'ultimately', 'converge', 'to', 'spatiallyhomogeneous', 'concentrations', 'our', 'results', 'suggest', 'that', 'a', 'much', 'wider', 'variety', 'of', 'systems', 'than', 'is', 'commonly', 'believed', 'could', 'be', 'responsible', 'for', 'observed', 'patterns', 'in', 'development', 'or', 'could', 'be', 'good', 'candidates', 'for', 'synthetic', 'patterning', 'networks']]
|
[-0.11022514362888161, 0.1775461526486748, -0.0674902777324864, 0.12827605525651853, -0.07389193368015579, -0.16865884694380767, -0.0001023209284699183, 0.36188556314853754, -0.2985287991680703, -0.3108626704165188, 0.08095571491545418, -0.20636785375319147, -0.2555228942857137, 0.23461293544478645, -0.056360249186024794, 0.03054865581854697, 0.054252537652476764, -0.004687591822826505, 0.04247837977737085, -0.22827760735687624, 0.26469753461156026, 0.022335116903851246, 0.31031259635145764, 0.019275406346021193, 0.07034234234350754, -0.10731529351967614, 0.02774410231536778, -0.020452516236013428, -0.08903987433549852, 0.09211822040379047, 0.3037349799720888, 0.14327897735085973, 0.23758522414469294, -0.47156150340347247, -0.26385928901161326, 0.16247332448993856, 0.20483362122142712, 0.16034373305609217, -0.06896772254167194, -0.23433252095249116, 0.12518553258631215, -0.09946265470071305, -0.13418098614006066, -0.12625643120672095, 0.057869070439174566, 0.03596877043873387, -0.25493050051192123, 0.058998537086774404, 0.06074989492648757, 0.07975418553236992, -0.06023643200697747, -0.06952064280014073, -0.03152160438030855, 0.15040314308376254, -0.005851292044937198, -0.00022868374373317453, 0.14744719234831666, -0.13647194834043003, -0.1621932416707964, 0.42184968655371036, 0.01901943672684178, -0.17806548778019193, 0.31944257539186266, -0.12653721357622796, -0.14425163537967728, 0.15469408494609188, 0.18911285794764962, 0.07633734975237623, -0.1547712321277313, -0.02885864438137151, -0.026690771739955665, 0.21680962667083753, 0.11919074106000123, 0.038328110576502136, 0.2656555142219303, 0.19481570319452834, 0.014062520057286998, 0.10434845283687595, -0.0385754311748717, -0.15041770386264963, -0.17314702046666003, -0.09931930776445135, -0.09103619474338256, 0.046775351111103314, -0.010834502459134615, -0.21163021776533347, 0.366167787663115, 0.16986921127953444, 0.1677931204936269, -0.0007869000868519879, 0.2018073300449049, 0.017255080534973554, 0.1218126974742396, 0.018892897168509146, 0.19531553045498884, 0.08983771556190082, 0.10897693745920667, -0.19466426451518823, 0.17761445117788174, -0.006123123952286309]
|
1,803.07887
|
On Enumeration of Dyck Paths with colored hills
|
We continue to investigate the properties of the earlier defined functions fm
and gm, which depend on an initial arithmetic function f0. In this papers
values of f0 are the Fine numbers. We investigate functions fi; gi; (i = 1; 2;
3; 4). For each function, we derive an explicit formula and give a
combinatorial interpretation. It appears that g2 and g3 are well-known
combinatoric object called the Catalan triangles. We finish with an identity
consisting of ten items.
|
math.CO
|
we continue to investigate the properties of the earlier defined functions fm and gm which depend on an initial arithmetic function f0 in this papers values of f0 are the fine numbers we investigate functions fi gi i 1 2 3 4 for each function we derive an explicit formula and give a combinatorial interpretation it appears that g2 and g3 are wellknown combinatoric object called the catalan triangles we finish with an identity consisting of ten items
|
[['we', 'continue', 'to', 'investigate', 'the', 'properties', 'of', 'the', 'earlier', 'defined', 'functions', 'fm', 'and', 'gm', 'which', 'depend', 'on', 'an', 'initial', 'arithmetic', 'function', 'f0', 'in', 'this', 'papers', 'values', 'of', 'f0', 'are', 'the', 'fine', 'numbers', 'we', 'investigate', 'functions', 'fi', 'gi', 'i', '1', '2', '3', '4', 'for', 'each', 'function', 'we', 'derive', 'an', 'explicit', 'formula', 'and', 'give', 'a', 'combinatorial', 'interpretation', 'it', 'appears', 'that', 'g2', 'and', 'g3', 'are', 'wellknown', 'combinatoric', 'object', 'called', 'the', 'catalan', 'triangles', 'we', 'finish', 'with', 'an', 'identity', 'consisting', 'of', 'ten', 'items']]
|
[-0.16373373441493663, 0.08753973406717892, -0.05971270529792095, 0.12087748880880192, -0.09236618445422022, -0.11542299777666369, 0.015164695208510146, 0.36005658384125966, -0.2512086068297951, -0.30236600061508423, 0.08716718785469241, -0.26481205811843467, -0.17141023942102224, 0.15019000156854206, -0.09560797164121117, -0.017273965943716645, 0.004823123072035229, 0.07139183435803996, -0.09772855920248101, -0.2686620717868209, 0.341174640167409, -0.05313785499534928, 0.15553275691434884, 0.05594757242868535, 0.08461759967777209, 0.01930740036858389, -0.0632733102195347, -0.04497902287552372, -0.22526963813671058, 0.10037535426612848, 0.17877749730952275, 0.16477511277517828, 0.20948404957277653, -0.3744448318910331, -0.07658047099502231, 0.11680811942698291, 0.13146026751910073, 0.022060444188984826, 0.016167689644648, -0.20292825303309095, 0.11777205847036572, -0.16596649594616908, -0.1423502275123237, -0.03788966440109876, 0.09385129750873415, 0.059379773918921366, -0.2849789584557024, 0.02309393303062862, 0.0701384399838459, 0.10882934120346387, -0.048332246975638926, -0.21284563660932085, 0.04555921052367641, 0.130104300703328, 0.0042038774073052294, 0.07294986920001414, 0.07690931449477108, -0.15861021743741077, -0.10968333474981289, 0.3230227085146814, -0.013350586926278014, -0.22522339510182157, 0.13096577142819, -0.142615902189834, -0.18162402136919972, 0.0648884673614819, 0.08165983769756097, 0.16544681958531818, -0.0809070431233312, 0.07061698684507671, -0.07997799461755233, 0.17174778315119255, 0.10484204575037345, 0.0037488385091702906, 0.16277825106412935, 0.09208911535321161, 0.005870721364119209, 0.18782339679698148, -0.044534030833090536, -0.010234990742248602, -0.33873997817789087, -0.18395512863898125, -0.14636470053944953, 0.08702706846480186, -0.13361983151620593, -0.1894778060989502, 0.39203183515331685, 0.08811332208987994, 0.2539960912022835, 0.07789081291038877, 0.23010098819549268, 0.15756674748188695, 0.04572672124665517, 0.035312395432414725, 0.14932044319665203, 0.11648895532394257, 0.03806861098975134, -0.13998692440322769, 0.007656330809904597, 0.13783777642469758]
|
1,803.07888
|
Epidemic SIR model on a face-to-face interaction network: new mobility
induced phase transitions
|
In this work, we study the epidemic SIR model on a system which takes into
consideration face-to-face interaction networks. This approach has been used as
prototype to describe people interactions in different kinds of social
organizations and, here, it is considered by means of three features of human
interactions: the mobility, the duration of the interaction among people, and
the dependence of the number of interactions of each person on the time
evolution of the system. For this purpose, the initial configuration of the
system is set as a regular square lattice where the nodes are the individuals
which, in turn, are able to move in a random walk along the network. So, the
connectivity among the individuals evolve with time and is defined by the
positions of the individuals at each iteration. In a time unit, each individual
is able move up to a distance $v$ creating different networks along the time
evolution of the system. In addition, the individuals are interacting with each
other only if they are within the interaction distance $\delta$ and, in this
case, they are considered as neighbors. If a given individual is interacting
with other ones, he performs the random walk with a diffusion probability
$\omega$. Otherwise, the diffusion occurs with probability 1. The study was
carried out through non-equilibrium Monte Carlo Simulations and we take into
account the asynchronous updating scheme. The results show that, for a given
$v>0$, there exist a critical line in the $(c, \delta)$ space, where $c$ is the
immunization rate. We also obtain the dynamic critical exponent $\theta$ for
some points belonging to this line and show that this model does not belong to
the directed percolation universality class.
|
physics.soc-ph cond-mat.stat-mech
|
in this work we study the epidemic sir model on a system which takes into consideration facetoface interaction networks this approach has been used as prototype to describe people interactions in different kinds of social organizations and here it is considered by means of three features of human interactions the mobility the duration of the interaction among people and the dependence of the number of interactions of each person on the time evolution of the system for this purpose the initial configuration of the system is set as a regular square lattice where the nodes are the individuals which in turn are able to move in a random walk along the network so the connectivity among the individuals evolve with time and is defined by the positions of the individuals at each iteration in a time unit each individual is able move up to a distance v creating different networks along the time evolution of the system in addition the individuals are interacting with each other only if they are within the interaction distance delta and in this case they are considered as neighbors if a given individual is interacting with other ones he performs the random walk with a diffusion probability omega otherwise the diffusion occurs with probability 1 the study was carried out through nonequilibrium monte carlo simulations and we take into account the asynchronous updating scheme the results show that for a given v0 there exist a critical line in the c delta space where c is the immunization rate we also obtain the dynamic critical exponent theta for some points belonging to this line and show that this model does not belong to the directed percolation universality class
|
[['in', 'this', 'work', 'we', 'study', 'the', 'epidemic', 'sir', 'model', 'on', 'a', 'system', 'which', 'takes', 'into', 'consideration', 'facetoface', 'interaction', 'networks', 'this', 'approach', 'has', 'been', 'used', 'as', 'prototype', 'to', 'describe', 'people', 'interactions', 'in', 'different', 'kinds', 'of', 'social', 'organizations', 'and', 'here', 'it', 'is', 'considered', 'by', 'means', 'of', 'three', 'features', 'of', 'human', 'interactions', 'the', 'mobility', 'the', 'duration', 'of', 'the', 'interaction', 'among', 'people', 'and', 'the', 'dependence', 'of', 'the', 'number', 'of', 'interactions', 'of', 'each', 'person', 'on', 'the', 'time', 'evolution', 'of', 'the', 'system', 'for', 'this', 'purpose', 'the', 'initial', 'configuration', 'of', 'the', 'system', 'is', 'set', 'as', 'a', 'regular', 'square', 'lattice', 'where', 'the', 'nodes', 'are', 'the', 'individuals', 'which', 'in', 'turn', 'are', 'able', 'to', 'move', 'in', 'a', 'random', 'walk', 'along', 'the', 'network', 'so', 'the', 'connectivity', 'among', 'the', 'individuals', 'evolve', 'with', 'time', 'and', 'is', 'defined', 'by', 'the', 'positions', 'of', 'the', 'individuals', 'at', 'each', 'iteration', 'in', 'a', 'time', 'unit', 'each', 'individual', 'is', 'able', 'move', 'up', 'to', 'a', 'distance', 'v', 'creating', 'different', 'networks', 'along', 'the', 'time', 'evolution', 'of', 'the', 'system', 'in', 'addition', 'the', 'individuals', 'are', 'interacting', 'with', 'each', 'other', 'only', 'if', 'they', 'are', 'within', 'the', 'interaction', 'distance', 'delta', 'and', 'in', 'this', 'case', 'they', 'are', 'considered', 'as', 'neighbors', 'if', 'a', 'given', 'individual', 'is', 'interacting', 'with', 'other', 'ones', 'he', 'performs', 'the', 'random', 'walk', 'with', 'a', 'diffusion', 'probability', 'omega', 'otherwise', 'the', 'diffusion', 'occurs', 'with', 'probability', '1', 'the', 'study', 'was', 'carried', 'out', 'through', 'nonequilibrium', 'monte', 'carlo', 'simulations', 'and', 'we', 'take', 'into', 'account', 'the', 'asynchronous', 'updating', 'scheme', 'the', 'results', 'show', 'that', 'for', 'a', 'given', 'v0', 'there', 'exist', 'a', 'critical', 'line', 'in', 'the', 'c', 'delta', 'space', 'where', 'c', 'is', 'the', 'immunization', 'rate', 'we', 'also', 'obtain', 'the', 'dynamic', 'critical', 'exponent', 'theta', 'for', 'some', 'points', 'belonging', 'to', 'this', 'line', 'and', 'show', 'that', 'this', 'model', 'does', 'not', 'belong', 'to', 'the', 'directed', 'percolation', 'universality', 'class']]
|
[-0.14532374508700793, 0.13223061885962145, -0.060424242941670925, 0.036541891868840506, -0.02814664418337675, -0.17310955775208137, 0.07181308695184503, 0.4107364403308495, -0.2640501332571664, -0.2686958709626016, 0.06543465571871014, -0.2999748539910049, -0.14492754319353288, 0.12186977662540747, 0.0009198665052507046, -0.001748398767044464, 0.05988173088073691, 0.1083456058821357, 0.009390437365377468, -0.27121113407044134, 0.31278079365221584, 0.017758239034219837, 0.24049857789518456, 0.015339680570045632, 0.07782323561701263, 0.010503311821503948, 0.002567541144015466, 0.04646508681787267, -0.11596073401978954, 0.07864215000489634, 0.22016893637904084, 0.10908555440977877, 0.3195378540549427, -0.4037153337362176, -0.21207206141771684, 0.1314581147005372, 0.15264765350626952, 0.10477654028152188, 0.011727118309412204, -0.29794096538932424, 0.06588082796240106, -0.14999647906168978, -0.11429029866080427, -0.000705955834094937, 0.040417667384199954, 0.0777537649892046, -0.26332735235915117, 0.03278537845833092, 0.03617539465987183, 0.03679270821653227, -0.03122406847137588, -0.08525688007576325, -0.030311366167507327, 0.20083068146953253, 0.03756595364357312, 0.03279911154214002, 0.1194836542196902, -0.1119224016491905, -0.09847437027438893, 0.3990442637710812, -0.013355471917051585, -0.21114718599958307, 0.20426861193453802, -0.15556370506248046, -0.13664549337666984, 0.11486883532728154, 0.18549290819414346, 0.10209852182768708, -0.16672209665800133, 0.05816659967849322, -0.04661587879131053, 0.1395041616889483, 0.022016705189673032, -0.014007155842094927, 0.17173150046035013, 0.18552178143299058, 0.07890478641881297, 0.1037339726112063, -0.09115325978210738, -0.13560927615060095, -0.2783394317499342, -0.1500645113286582, -0.18350470345384765, 0.04451314446931013, -0.09513955612442744, -0.1487050617690832, 0.4026870531280555, 0.17277681826554397, 0.22390475486989747, 0.07764618034748665, 0.24503612694337118, 0.10546323750936963, 0.06987195596815556, 0.08911268719544647, 0.18910259356301573, 0.05524074207002244, 0.10895370940367381, -0.1988928705090178, 0.11510404662546167, 0.057544323137683914]
|
1,803.07889
|
Radiation of the electromagnetic field beyond the dipole approximation
|
The expression for the intensity of the electromagnetic field radiation is
derived in the approximation next to the dipole one. The presented approach is
based on fundamental equations from the introductory course on classical
electrodynamics and straightforward mathematical transformations.
|
physics.class-ph
|
the expression for the intensity of the electromagnetic field radiation is derived in the approximation next to the dipole one the presented approach is based on fundamental equations from the introductory course on classical electrodynamics and straightforward mathematical transformations
|
[['the', 'expression', 'for', 'the', 'intensity', 'of', 'the', 'electromagnetic', 'field', 'radiation', 'is', 'derived', 'in', 'the', 'approximation', 'next', 'to', 'the', 'dipole', 'one', 'the', 'presented', 'approach', 'is', 'based', 'on', 'fundamental', 'equations', 'from', 'the', 'introductory', 'course', 'on', 'classical', 'electrodynamics', 'and', 'straightforward', 'mathematical', 'transformations']]
|
[-0.05164528227387331, 0.050366439116306796, -0.09235410898541793, 0.10243879578028543, -0.10841319079582508, -0.07031672567320175, -0.00799942990908256, 0.3116400883986782, -0.2236927538537062, -0.29646779654117733, 0.04563170915039686, -0.23761280519792286, -0.1812077335631236, 0.26016380165058833, -0.006809986697939726, 0.03380070493007318, -0.008031827081233645, 0.10235292474046731, -0.05000627807413156, -0.18871606375353459, 0.3226686293223443, 0.07315329882578972, 0.327000615783991, 0.013574948056768149, 0.15089529879295674, 0.05369321781043441, -0.05790066064741367, -0.016289910146345694, -0.08869710660730608, 0.15397368834759945, 0.21561967600614595, 0.1271828034809098, 0.2384880015101188, -0.4697628606779453, -0.16180492629511997, -0.016475326835345, 0.06870756460688053, 0.17241252151628336, -0.043103225368003435, -0.28826612771417087, -0.027710747522994492, -0.08027060825425462, -0.12520895530589116, -0.010987615642639307, 0.02386677023083067, 0.015765483288142163, -0.24044965570553756, 0.045235654046663486, 0.0344783131343623, 0.06456357546341725, -0.09632197020050043, -0.12941853896690866, 0.07640473542209619, 0.10323520290116087, 0.058595870078230895, 0.04565235047051922, 0.14568011314632037, -0.1342892879858995, -0.10206660957863697, 0.45646429756799567, -0.09108849034573023, -0.2165450166719846, 0.12994292748268121, -0.16869760672442424, -0.10985278265061191, 0.15118505656181908, 0.17665806035391796, 0.12982401855958578, -0.17997879394067404, 0.12864673338108099, 0.002386361336669861, 0.12758733461109492, 0.043862608643487476, -0.013797678387699982, 0.19713674265986833, 0.13443929539659086, -0.028473869348183658, 0.11783571335940789, -0.035517241017749675, -0.1439366526901722, -0.3923887495811169, -0.13921157330370101, -0.18288442205924255, 0.06400211289142951, -0.053745950813232087, -0.15981322328727215, 0.4069587652070018, 0.16967959561570284, 0.02375117383706264, 0.020942463169399746, 0.3703088158598313, 0.22305818675802305, 0.04153320168216641, 0.020935352748403184, 0.32077983590081716, 0.21570706866586056, 0.12608957464973897, -0.2309542188886553, -0.006457910096893708, 0.12820403409214357]
|
1,803.0789
|
Multiple Models for Recommending Temporal Aspects of Entities
|
Entity aspect recommendation is an emerging task in semantic search that
helps users discover serendipitous and prominent information with respect to an
entity, of which salience (e.g., popularity) is the most important factor in
previous work. However, entity aspects are temporally dynamic and often driven
by events happening over time. For such cases, aspect suggestion based solely
on salience features can give unsatisfactory results, for two reasons. First,
salience is often accumulated over a long time period and does not account for
recency. Second, many aspects related to an event entity are strongly
time-dependent. In this paper, we study the task of temporal aspect
recommendation for a given entity, which aims at recommending the most relevant
aspects and takes into account time in order to improve search experience. We
propose a novel event-centric ensemble ranking method that learns from multiple
time and type-dependent models and dynamically trades off salience and recency
characteristics. Through extensive experiments on real-world query logs, we
demonstrate that our method is robust and achieves better effectiveness than
competitive baselines.
|
cs.IR cs.LG
|
entity aspect recommendation is an emerging task in semantic search that helps users discover serendipitous and prominent information with respect to an entity of which salience eg popularity is the most important factor in previous work however entity aspects are temporally dynamic and often driven by events happening over time for such cases aspect suggestion based solely on salience features can give unsatisfactory results for two reasons first salience is often accumulated over a long time period and does not account for recency second many aspects related to an event entity are strongly timedependent in this paper we study the task of temporal aspect recommendation for a given entity which aims at recommending the most relevant aspects and takes into account time in order to improve search experience we propose a novel eventcentric ensemble ranking method that learns from multiple time and typedependent models and dynamically trades off salience and recency characteristics through extensive experiments on realworld query logs we demonstrate that our method is robust and achieves better effectiveness than competitive baselines
|
[['entity', 'aspect', 'recommendation', 'is', 'an', 'emerging', 'task', 'in', 'semantic', 'search', 'that', 'helps', 'users', 'discover', 'serendipitous', 'and', 'prominent', 'information', 'with', 'respect', 'to', 'an', 'entity', 'of', 'which', 'salience', 'eg', 'popularity', 'is', 'the', 'most', 'important', 'factor', 'in', 'previous', 'work', 'however', 'entity', 'aspects', 'are', 'temporally', 'dynamic', 'and', 'often', 'driven', 'by', 'events', 'happening', 'over', 'time', 'for', 'such', 'cases', 'aspect', 'suggestion', 'based', 'solely', 'on', 'salience', 'features', 'can', 'give', 'unsatisfactory', 'results', 'for', 'two', 'reasons', 'first', 'salience', 'is', 'often', 'accumulated', 'over', 'a', 'long', 'time', 'period', 'and', 'does', 'not', 'account', 'for', 'recency', 'second', 'many', 'aspects', 'related', 'to', 'an', 'event', 'entity', 'are', 'strongly', 'timedependent', 'in', 'this', 'paper', 'we', 'study', 'the', 'task', 'of', 'temporal', 'aspect', 'recommendation', 'for', 'a', 'given', 'entity', 'which', 'aims', 'at', 'recommending', 'the', 'most', 'relevant', 'aspects', 'and', 'takes', 'into', 'account', 'time', 'in', 'order', 'to', 'improve', 'search', 'experience', 'we', 'propose', 'a', 'novel', 'eventcentric', 'ensemble', 'ranking', 'method', 'that', 'learns', 'from', 'multiple', 'time', 'and', 'typedependent', 'models', 'and', 'dynamically', 'trades', 'off', 'salience', 'and', 'recency', 'characteristics', 'through', 'extensive', 'experiments', 'on', 'realworld', 'query', 'logs', 'we', 'demonstrate', 'that', 'our', 'method', 'is', 'robust', 'and', 'achieves', 'better', 'effectiveness', 'than', 'competitive', 'baselines']]
|
[-0.08336018602366457, 0.038409996833877684, -0.0607384602227006, 0.08815744290373294, -0.16530671404039413, -0.1545488728813267, 0.06562480173327569, 0.45517326417147597, -0.24480313616750946, -0.35463678443735747, 0.049818213767223354, -0.3072192406596756, -0.17243719129753166, 0.1913762699299212, -0.10096069401926819, 0.02566602156932245, 0.11250050748682264, 0.08404455988902082, -0.012921887673329928, -0.27164888933753173, 0.32324681116128073, 0.10168558631544512, 0.32493693780993793, 0.08676091721550577, 0.11550669585195816, 0.01217606299384524, -0.1100462589924684, 0.0061674263931986995, -0.049730260177430326, 0.11635530445014121, 0.3352807809936592, 0.215853551607256, 0.34477123164577206, -0.39941479175787614, -0.19242896592901276, 0.07828400351478573, 0.16797907162089953, 0.07206002235559968, -0.03782952352523847, -0.3387797116921041, 0.07969621320341234, -0.16662251352564017, 0.023473133125767716, -0.12223150387723968, 0.04956999467147482, -0.00625227015422431, -0.27636769176272385, 0.06344640094348138, 0.10249433849771329, 0.021830797211584672, -0.057168937414733834, -0.0783735980371261, 0.07443968875392884, 0.1797006118590432, 0.08754611760512468, 0.009908770475498901, 0.1251825141327488, -0.14474762109582007, -0.19768308986091415, 0.4139251512276127, -0.041251239529423916, -0.1560922023024374, 0.2115045861930538, -0.053910652350505135, -0.1653656969519838, 0.10167661821200497, 0.22958362681758887, 0.1253975209354583, -0.15750337507026646, -0.03974908626789087, -0.03651123538860954, 0.26233730191025734, 0.030876598631454404, 0.04337713138248793, 0.2257979427857292, 0.25604282990986255, 0.04259655120778517, 0.10498659265486017, -0.08317456889165446, -0.12826927772095975, -0.19425775578839036, -0.12304234743990392, -0.146761357480111, -0.022953094892265043, -0.11708122975733992, -0.12004677898578905, 0.4143382288687836, 0.24553435074143257, 0.2213288743689527, 0.05583671836232608, 0.3271940076882504, 0.05485727254508569, 0.060372549022774676, 0.08334680545652512, 0.13510663685997185, -0.07381089560208422, 0.14389203996915703, -0.15762800076788674, 0.16655699200837368, 0.06800027727014843]
|
1,803.07891
|
First muon acceleration using a radio frequency accelerator
|
Muons have been accelerated by using a radio frequency accelerator for the
first time. Negative muonium atoms (Mu$^-$), which are bound states of positive
muons ($\mu^+$) and two electrons, are generated from $\mu^+$'s through the
electron capture process in an aluminum degrader. The generated Mu$^-$'s are
initially electrostatically accelerated and injected into a radio frequency
quadrupole linac (RFQ). In the RFQ, the Mu$^-$'s are accelerated to 89 keV. The
accelerated Mu$^-$'s are identified by momentum measurement and time of flight.
This compact muon linac opens the door to various muon accelerator applications
including particle physics measurements and the construction of a transmission
muon microscope.
|
physics.acc-ph hep-ex
|
muons have been accelerated by using a radio frequency accelerator for the first time negative muonium atoms mu which are bound states of positive muons mu and two electrons are generated from mus through the electron capture process in an aluminum degrader the generated mus are initially electrostatically accelerated and injected into a radio frequency quadrupole linac rfq in the rfq the mus are accelerated to 89 kev the accelerated mus are identified by momentum measurement and time of flight this compact muon linac opens the door to various muon accelerator applications including particle physics measurements and the construction of a transmission muon microscope
|
[['muons', 'have', 'been', 'accelerated', 'by', 'using', 'a', 'radio', 'frequency', 'accelerator', 'for', 'the', 'first', 'time', 'negative', 'muonium', 'atoms', 'mu', 'which', 'are', 'bound', 'states', 'of', 'positive', 'muons', 'mu', 'and', 'two', 'electrons', 'are', 'generated', 'from', 'mus', 'through', 'the', 'electron', 'capture', 'process', 'in', 'an', 'aluminum', 'degrader', 'the', 'generated', 'mus', 'are', 'initially', 'electrostatically', 'accelerated', 'and', 'injected', 'into', 'a', 'radio', 'frequency', 'quadrupole', 'linac', 'rfq', 'in', 'the', 'rfq', 'the', 'mus', 'are', 'accelerated', 'to', '89', 'kev', 'the', 'accelerated', 'mus', 'are', 'identified', 'by', 'momentum', 'measurement', 'and', 'time', 'of', 'flight', 'this', 'compact', 'muon', 'linac', 'opens', 'the', 'door', 'to', 'various', 'muon', 'accelerator', 'applications', 'including', 'particle', 'physics', 'measurements', 'and', 'the', 'construction', 'of', 'a', 'transmission', 'muon', 'microscope']]
|
[-0.07873126434592101, 0.31127989813005397, -0.015731789267962225, 0.029348794551756676, -0.0017063960862847476, -0.1906322498062554, 0.022067241245307602, 0.4182837546899324, -0.24103108573203477, -0.3264319364948628, 0.0017149639920367359, -0.30674134693981614, 0.1035198144325897, 0.2694200405799515, 0.07121426564677116, 0.0757856825277066, 0.08251291777616224, -0.03836813923687889, -0.020831103329188548, -0.1492258010470183, 0.20308145835028532, 0.1855800879868464, 0.27351109576053345, 0.06980535194564325, 0.14457853622018144, -0.0739743267902388, 0.020009590724769693, -0.09824056565020538, -0.03691705020929266, 0.06363422332875555, 0.24231389772746928, 0.10825317972641922, 0.2231944194600846, -0.46434474698841, -0.1661435439799299, 0.07337227270069818, 0.1437328110265438, 0.023279201842692252, -0.12741441196368003, -0.33897534111299765, 0.09044577602225427, -0.19408193160332024, -0.11163998424756126, 0.0039178403586937255, -0.02632558798023428, 0.06786347181724313, -0.27041231288323897, 0.04529135100221118, 0.00820465152635454, 0.032823328367577724, -0.11714865109220576, -0.11815329381408027, 0.11148840221554004, 0.05662210613865262, 0.06388760217025545, 0.08465063544505168, 0.20637006339921543, -0.007436760340799362, -0.1841016584658064, 0.34264573580898844, -0.006193760804867802, -0.0952103308473642, 0.1269973466405645, -0.24772069896034038, 0.00016387132927775383, 0.2006316400410679, 0.2070464716044416, 0.09422734370365596, -0.20930268290192963, 0.06800301309200361, 0.066421750151606, 0.14457260819304232, 0.14935673310313946, 0.01765247118377234, 0.2280986147502867, 0.169761214324703, 0.06544370031602179, 0.11342058768227267, -0.17457929750358184, 0.020795539169249914, -0.27412089347713986, -0.18036424074083557, -0.17049631574907556, 0.10442294464043628, 0.04618645786775652, -0.05630088164112889, 0.4722618550563661, 0.041748397871672824, 0.1567028689896688, -0.07615181406883774, 0.3740211575327871, 0.07236473545400748, 0.04514397712102017, 0.06360878364200918, 0.23185667073210844, 0.13673122457783812, 0.141416658678701, -0.27770590483739327, 0.007633893146143796, 0.007518960646568582]
|
1,803.07892
|
Taxon and trait recognition from digitized herbarium specimens using
deep convolutional neural networks
|
Herbaria worldwide are housing a treasure of 100s of millions of herbarium
specimens, which are increasingly being digitized in recent years and thereby
made more easily accessible to the scientific community. At the same time, deep
learning algorithms are rapidly improving pattern recognition from images and
these techniques are more and more being applied to biological objects. We are
using digital images of herbarium specimens in order to identify taxa and
traits of these collection objects by applying convolutional neural networks
(CNN). Images of the 1000 species most frequently documented by herbarium
specimens on GBIF have been downloaded and combined with morphological trait
data, preprocessed and divided into training and test datasets for species and
trait recognition. Good performance in both domains is promising to use this
approach in future tools supporting taxonomy and natural history collection
management.
|
q-bio.PE
|
herbaria worldwide are housing a treasure of 100s of millions of herbarium specimens which are increasingly being digitized in recent years and thereby made more easily accessible to the scientific community at the same time deep learning algorithms are rapidly improving pattern recognition from images and these techniques are more and more being applied to biological objects we are using digital images of herbarium specimens in order to identify taxa and traits of these collection objects by applying convolutional neural networks cnn images of the 1000 species most frequently documented by herbarium specimens on gbif have been downloaded and combined with morphological trait data preprocessed and divided into training and test datasets for species and trait recognition good performance in both domains is promising to use this approach in future tools supporting taxonomy and natural history collection management
|
[['herbaria', 'worldwide', 'are', 'housing', 'a', 'treasure', 'of', '100s', 'of', 'millions', 'of', 'herbarium', 'specimens', 'which', 'are', 'increasingly', 'being', 'digitized', 'in', 'recent', 'years', 'and', 'thereby', 'made', 'more', 'easily', 'accessible', 'to', 'the', 'scientific', 'community', 'at', 'the', 'same', 'time', 'deep', 'learning', 'algorithms', 'are', 'rapidly', 'improving', 'pattern', 'recognition', 'from', 'images', 'and', 'these', 'techniques', 'are', 'more', 'and', 'more', 'being', 'applied', 'to', 'biological', 'objects', 'we', 'are', 'using', 'digital', 'images', 'of', 'herbarium', 'specimens', 'in', 'order', 'to', 'identify', 'taxa', 'and', 'traits', 'of', 'these', 'collection', 'objects', 'by', 'applying', 'convolutional', 'neural', 'networks', 'cnn', 'images', 'of', 'the', '1000', 'species', 'most', 'frequently', 'documented', 'by', 'herbarium', 'specimens', 'on', 'gbif', 'have', 'been', 'downloaded', 'and', 'combined', 'with', 'morphological', 'trait', 'data', 'preprocessed', 'and', 'divided', 'into', 'training', 'and', 'test', 'datasets', 'for', 'species', 'and', 'trait', 'recognition', 'good', 'performance', 'in', 'both', 'domains', 'is', 'promising', 'to', 'use', 'this', 'approach', 'in', 'future', 'tools', 'supporting', 'taxonomy', 'and', 'natural', 'history', 'collection', 'management']]
|
[-0.01023043206505998, 0.0577485296423273, -0.03859028227367055, 0.06070502470923683, -0.09169419008129112, -0.15741147238911843, 0.00931433103088399, 0.4635351859512465, -0.23874760324371677, -0.35535927597940076, 0.13677265529301674, -0.32764016767032444, -0.1276423665754812, 0.26869927391902926, -0.11623898892909945, 0.06915545963891097, 0.13828892793561168, -0.00035716006395352236, 0.04031301486675682, -0.3427245900007513, 0.2647874987554079, 0.03684672497889979, 0.33102740676087494, -0.029614086964797667, 0.0639337351098862, -0.07711423893445446, -0.09274151962616838, 0.017297287153162283, -0.05571873231961303, 0.2060318022952689, 0.3826183244801702, 0.2374941619568477, 0.30316079999594125, -0.45792742335127995, -0.21747877029702067, 0.07819181765936424, 0.15759744617047117, 0.10939592946509519, -0.04399330343317963, -0.3483528071425526, 0.11073320806291817, -0.12618623298818848, -0.00535310840303496, -0.12117815810094779, 0.03601224679946694, 0.006524299324476434, -0.2083510550095097, 0.03640423300813007, -0.020694221787647727, 0.17672875558491796, -0.03312418328417099, -0.15038009826093912, -0.013614074720809347, 0.2105782713076812, 0.04852584326769883, 0.028312918348306352, 0.15292109739504453, -0.18382208166226252, -0.09962580092157142, 0.3719068769475116, -0.001439295829828445, -0.12529750473742537, 0.25684240281664056, -0.1042259593412061, -0.1551981652275358, 0.13563913603224242, 0.23578103779650786, 0.1048062830369043, -0.23457026000901618, -0.04042915373686222, 0.007015619067447808, 0.16646095191518887, 0.11881596452953733, -0.010644887601408888, 0.22651178154389046, 0.2590441992300946, -0.02436845119433094, 0.11545106716135599, -0.12109164756496765, -0.033386903568444884, -0.1223266252730836, -0.11521418327602613, -0.15799350049522165, -0.017702819178606766, -0.09309124506644902, -0.1320442125434056, 0.38653024438142036, 0.18248246966226467, 0.17698976275620654, 0.0587132106995662, 0.2947374252218972, -0.04704359353405273, 0.19249843958737878, 0.028505826755837703, 0.11956943250826203, 0.03656266732586493, 0.1522665615159306, -0.07373524448057116, 0.10693173033531125, -0.012157180885825417]
|
1,803.07893
|
Midterm Periodicity Analysis of the Mount Wilson Magnetic Indices Using
the Synchrosqueezing Transform
|
A novel time--frequency technique, called the synchrosqueezing transform
(SST), is used to investigate the midterm periodic variations of magnetic
fields on the solar surface. The Magnetic Plage Strength Index (MPSI) and the
Mount Wilson Sunspot Index (MWSI), measured daily by the Mount Wilson
Observatory between 1970 January 19 and 2012 January 22, are selected. The
short-, mid, and longer-term periodicities are represented and decomposed by
the SST with hardly any mode mixing. This demonstrates that the SST is a useful
time--frequency analysis technique to characterize the periodic modes of
helioseismic data. Apart from the fundamental modes of the annual periodicity,
$\sim$27 day rotational cycle and $\sim$11 year solar cycle, the SST reveals
several midterm periodicities in the two magnetic activity indices,
specifically, $\sim$157 day (i.e., Rieger-type periodicity), and $\sim$1.3 and
1.7 years. The periodic modes, with 116.4 and 276.2 day periodicity in the
MPSI, with 108.5 and 251.6 day periodicity in the MWSI, and the 157.7 day
periodicity in the two indices, are in better accord with those significant
periodicities derived from the Rossby waves theoretical model. This study
suggests that the modes are caused by the Rossby waves. For the 1.30 and 1.71
year periodicity of the MPSI, and the 1.33 and 1.67 year periodicity of the
MWSI, our analysis infers that they are related to those periodicity with the
same timescale in the interior of the Sun and in the high atmospheric layers.
|
astro-ph.SR
|
a novel timefrequency technique called the synchrosqueezing transform sst is used to investigate the midterm periodic variations of magnetic fields on the solar surface the magnetic plage strength index mpsi and the mount wilson sunspot index mwsi measured daily by the mount wilson observatory between 1970 january 19 and 2012 january 22 are selected the short mid and longerterm periodicities are represented and decomposed by the sst with hardly any mode mixing this demonstrates that the sst is a useful timefrequency analysis technique to characterize the periodic modes of helioseismic data apart from the fundamental modes of the annual periodicity sim27 day rotational cycle and sim11 year solar cycle the sst reveals several midterm periodicities in the two magnetic activity indices specifically sim157 day ie riegertype periodicity and sim13 and 17 years the periodic modes with 1164 and 2762 day periodicity in the mpsi with 1085 and 2516 day periodicity in the mwsi and the 1577 day periodicity in the two indices are in better accord with those significant periodicities derived from the rossby waves theoretical model this study suggests that the modes are caused by the rossby waves for the 130 and 171 year periodicity of the mpsi and the 133 and 167 year periodicity of the mwsi our analysis infers that they are related to those periodicity with the same timescale in the interior of the sun and in the high atmospheric layers
|
[['a', 'novel', 'timefrequency', 'technique', 'called', 'the', 'synchrosqueezing', 'transform', 'sst', 'is', 'used', 'to', 'investigate', 'the', 'midterm', 'periodic', 'variations', 'of', 'magnetic', 'fields', 'on', 'the', 'solar', 'surface', 'the', 'magnetic', 'plage', 'strength', 'index', 'mpsi', 'and', 'the', 'mount', 'wilson', 'sunspot', 'index', 'mwsi', 'measured', 'daily', 'by', 'the', 'mount', 'wilson', 'observatory', 'between', '1970', 'january', '19', 'and', '2012', 'january', '22', 'are', 'selected', 'the', 'short', 'mid', 'and', 'longerterm', 'periodicities', 'are', 'represented', 'and', 'decomposed', 'by', 'the', 'sst', 'with', 'hardly', 'any', 'mode', 'mixing', 'this', 'demonstrates', 'that', 'the', 'sst', 'is', 'a', 'useful', 'timefrequency', 'analysis', 'technique', 'to', 'characterize', 'the', 'periodic', 'modes', 'of', 'helioseismic', 'data', 'apart', 'from', 'the', 'fundamental', 'modes', 'of', 'the', 'annual', 'periodicity', 'sim27', 'day', 'rotational', 'cycle', 'and', 'sim11', 'year', 'solar', 'cycle', 'the', 'sst', 'reveals', 'several', 'midterm', 'periodicities', 'in', 'the', 'two', 'magnetic', 'activity', 'indices', 'specifically', 'sim157', 'day', 'ie', 'riegertype', 'periodicity', 'and', 'sim13', 'and', '17', 'years', 'the', 'periodic', 'modes', 'with', '1164', 'and', '2762', 'day', 'periodicity', 'in', 'the', 'mpsi', 'with', '1085', 'and', '2516', 'day', 'periodicity', 'in', 'the', 'mwsi', 'and', 'the', '1577', 'day', 'periodicity', 'in', 'the', 'two', 'indices', 'are', 'in', 'better', 'accord', 'with', 'those', 'significant', 'periodicities', 'derived', 'from', 'the', 'rossby', 'waves', 'theoretical', 'model', 'this', 'study', 'suggests', 'that', 'the', 'modes', 'are', 'caused', 'by', 'the', 'rossby', 'waves', 'for', 'the', '130', 'and', '171', 'year', 'periodicity', 'of', 'the', 'mpsi', 'and', 'the', '133', 'and', '167', 'year', 'periodicity', 'of', 'the', 'mwsi', 'our', 'analysis', 'infers', 'that', 'they', 'are', 'related', 'to', 'those', 'periodicity', 'with', 'the', 'same', 'timescale', 'in', 'the', 'interior', 'of', 'the', 'sun', 'and', 'in', 'the', 'high', 'atmospheric', 'layers']]
|
[-0.1404347961609985, 0.22174031254240967, -0.044864801440122934, 0.10076976370145665, -0.04842953902094605, -0.06447502406155492, 0.05673046678086703, 0.3595654560530439, -0.22247863180063507, -0.37495625049192854, 0.1703038533976143, -0.30232186367180436, -0.14329712387431967, 0.23450377921207233, -0.07803314805149715, -0.0056505559101463, 0.0800776449913912, -0.013552178408792043, -0.012152922840570991, -0.1935280929487991, 0.18754871474539345, 0.052896081969300485, 0.25241894693847033, -0.01983904030491063, 0.02856203542992552, -0.03032231438171832, -0.10678879739320342, -0.04093239905827857, -0.09642620385036818, 0.08487355999173002, 0.1879984875070922, 0.08302584462823902, 0.17553437175427344, -0.4041208199205551, -0.18248715145473784, 0.022435846801926482, 0.10303810202972369, -0.030407638855754062, 0.049796589644764494, -0.2774483284496881, 0.0713873102215733, -0.09462526406736133, -0.12152817981773394, 0.05008707335070172, 0.09116519156922685, 0.004992141883741034, -0.24114890632645644, 0.11119834842071175, 0.010980859708209383, 0.2025950904093445, -0.1179393070735077, -0.09393617250025273, -0.07926583103736506, 0.14887188104813562, 0.11432567095294832, 0.05539501406936015, 0.07173262762619143, -0.018828608318321168, -0.10243535696187037, 0.36105714982098086, -0.11149031678313746, -0.010368404935728362, 0.16313509495156084, -0.2169275301751344, -0.12648815599448504, 0.1638260113909479, 0.12709632941541518, 0.053783150313501345, -0.10325823715650179, -0.009287571006930097, -0.04974528681214384, 0.24291366826188057, 0.13769881538055995, 0.0191815878423129, 0.2657349311716934, 0.10194390848752091, 0.025351493291437942, 0.060937181596168656, -0.24748811888151823, -0.03537617015994174, -0.2131903778642733, -0.10313914235225542, -0.09985344236198951, 0.01944485727222042, -0.09735588741976708, -0.1291777625699785, 0.4895199640827412, 0.12595269319779695, 0.14138153227680225, 0.01008545025152729, 0.21757249997512615, 0.10771641857535677, 0.07686685855658923, 0.09236023534842311, 0.2991879233089771, 0.15493696701336415, 0.21296056109341852, -0.2282543312480792, -0.01173677731582776, 0.06034860115726181]
|
1,803.07894
|
3D-Printed Phase Waveplates for THz Beam Shaping
|
The advancement of 3D-printing opens up a new way of constructing affordable
custom terahertz (THz) components due to suitable printing resolution and THz
transparency of polymer materials. We present a way of calculating, designing
and fabricating a THz waveplate that phase-modulates an incident THz beam
({\lambda}=2.14 mm) in order to create a predefined intensity profile of the
optical wavefront on a distant image plane. Our calculations were performed for
two distinct target intensities with the use of a modified Gerchberg-Saxton
algorithm. The resulting phase-modulating profiles were used to model the
polyactide elements, which were printed out with a commercially available
3D-printer. The results were tested in an THz experimental setup equipped with
a scanning option and they showed good agreement with theoretical predictions.
|
physics.optics
|
the advancement of 3dprinting opens up a new way of constructing affordable custom terahertz thz components due to suitable printing resolution and thz transparency of polymer materials we present a way of calculating designing and fabricating a thz waveplate that phasemodulates an incident thz beam lambda214 mm in order to create a predefined intensity profile of the optical wavefront on a distant image plane our calculations were performed for two distinct target intensities with the use of a modified gerchbergsaxton algorithm the resulting phasemodulating profiles were used to model the polyactide elements which were printed out with a commercially available 3dprinter the results were tested in an thz experimental setup equipped with a scanning option and they showed good agreement with theoretical predictions
|
[['the', 'advancement', 'of', '3dprinting', 'opens', 'up', 'a', 'new', 'way', 'of', 'constructing', 'affordable', 'custom', 'terahertz', 'thz', 'components', 'due', 'to', 'suitable', 'printing', 'resolution', 'and', 'thz', 'transparency', 'of', 'polymer', 'materials', 'we', 'present', 'a', 'way', 'of', 'calculating', 'designing', 'and', 'fabricating', 'a', 'thz', 'waveplate', 'that', 'phasemodulates', 'an', 'incident', 'thz', 'beam', 'lambda214', 'mm', 'in', 'order', 'to', 'create', 'a', 'predefined', 'intensity', 'profile', 'of', 'the', 'optical', 'wavefront', 'on', 'a', 'distant', 'image', 'plane', 'our', 'calculations', 'were', 'performed', 'for', 'two', 'distinct', 'target', 'intensities', 'with', 'the', 'use', 'of', 'a', 'modified', 'gerchbergsaxton', 'algorithm', 'the', 'resulting', 'phasemodulating', 'profiles', 'were', 'used', 'to', 'model', 'the', 'polyactide', 'elements', 'which', 'were', 'printed', 'out', 'with', 'a', 'commercially', 'available', '3dprinter', 'the', 'results', 'were', 'tested', 'in', 'an', 'thz', 'experimental', 'setup', 'equipped', 'with', 'a', 'scanning', 'option', 'and', 'they', 'showed', 'good', 'agreement', 'with', 'theoretical', 'predictions']]
|
[-0.08530781539545083, 0.1044532527232756, -0.0714887037485217, -0.0495665658187742, -0.07443003839192291, -0.1769018670078367, 0.024207341748600206, 0.521199131058529, -0.19620620653343698, -0.3434335222778221, 0.04509699391395164, -0.27144619692311, -0.08582632161463456, 0.28340372047775114, -0.024871622988333304, 0.10654015536420047, 0.06567004872874047, -0.09271889213317384, -0.03368085795664229, -0.1662558613345027, 0.19969657711529484, 0.09983444871225705, 0.323189434572123, 0.013415452492578576, 0.12511959475814366, -0.021165311974861347, -0.029637050613140068, 0.004665665010300775, -0.13522722647594493, 0.18988685324244822, 0.30090627120031666, 0.032803030300419776, 0.2239734099052536, -0.43573463171099625, -0.21171459231991321, 0.009041728676917653, 0.09197616143307338, 0.12250562603488409, -0.1267622721856848, -0.2759563443095734, 0.08146866197154547, -0.12278255430671076, -0.14444788611338785, -0.05058974643810264, -0.043522901697239526, 0.036546750188184284, -0.2699587682533699, -0.05893159608434265, -0.0548744306472751, 0.09288197197935612, -0.043158715004877495, -0.10293467241572216, 0.00792407664412167, 0.09727841578035926, -0.06219641592761036, 0.059474235592642796, 0.14820847124016534, -0.1150799616977262, -0.11325760589291652, 0.37741081543111554, -0.05826928264771899, -0.1183255955732117, 0.141746648333113, -0.12009808985361209, -0.016110692376969382, 0.18774523112224414, 0.14573249334935098, 0.1312543587332281, -0.151418046397157, 0.0015162587112475497, 0.005674392204188431, 0.24610714171237003, 0.14578876571419339, 0.008789435637724333, 0.229019770398736, 0.199739087553462, 0.0006531862129122601, 0.16036239456346568, -0.15236108731284428, 0.013457529259540024, -0.2614952380215982, -0.1465576451126253, -0.15285653350583744, 0.040782390457267566, -0.0566409305549314, -0.15919285441438358, 0.4189998554298654, 0.17616405765487192, 0.14116618330590427, 0.017681196006985072, 0.34345517673840126, 0.07169803597595698, 0.09129831816341417, -0.010002458894935748, 0.25165110190573614, 0.10216629570350051, 0.12950621406004453, -0.166632590656324, 0.015836519334698096, -0.044324158399831504]
|
1,803.07895
|
Invariant algebraic curves for Li\'{e}nard dynamical systems revisited
|
A novel algebraic method for finding invariant algebraic curves for a
polynomial vector field in $\mathbb{C}^2$ is introduced. The structure of
irreducible invariant algebraic curves for Li\'{e}nard dynamical systems
$x_t=y$, $y_t=-g(x)y-f(x)$ with $\text{deg} f=\text{deg} g+1$ is obtained. It
is shown that there exist Li\'{e}nard systems that possess more complicated
invariant algebraic curves than it was supposed before.
As an example, all irreducible invariant algebraic curves for the Li\'{e}nard
differential system with $\text{deg} f=3$, $\text{deg} g=2$ are obtained. All
these results seem to be new.
|
nlin.SI math.DS
|
a novel algebraic method for finding invariant algebraic curves for a polynomial vector field in mathbbc2 is introduced the structure of irreducible invariant algebraic curves for lienard dynamical systems x_ty y_tgxyfx with textdeg ftextdeg g1 is obtained it is shown that there exist lienard systems that possess more complicated invariant algebraic curves than it was supposed before as an example all irreducible invariant algebraic curves for the lienard differential system with textdeg f3 textdeg g2 are obtained all these results seem to be new
|
[['a', 'novel', 'algebraic', 'method', 'for', 'finding', 'invariant', 'algebraic', 'curves', 'for', 'a', 'polynomial', 'vector', 'field', 'in', 'mathbbc2', 'is', 'introduced', 'the', 'structure', 'of', 'irreducible', 'invariant', 'algebraic', 'curves', 'for', 'lienard', 'dynamical', 'systems', 'x_ty', 'y_tgxyfx', 'with', 'textdeg', 'ftextdeg', 'g1', 'is', 'obtained', 'it', 'is', 'shown', 'that', 'there', 'exist', 'lienard', 'systems', 'that', 'possess', 'more', 'complicated', 'invariant', 'algebraic', 'curves', 'than', 'it', 'was', 'supposed', 'before', 'as', 'an', 'example', 'all', 'irreducible', 'invariant', 'algebraic', 'curves', 'for', 'the', 'lienard', 'differential', 'system', 'with', 'textdeg', 'f3', 'textdeg', 'g2', 'are', 'obtained', 'all', 'these', 'results', 'seem', 'to', 'be', 'new']]
|
[-0.2436099109359131, 0.10029622440090795, -0.13680561117986897, 0.12932849429950982, -0.1139961381942579, -0.23912280135384828, -0.08627608850053171, 0.31178509721123593, -0.2717907859307782, -0.2199874719457201, 0.10879043427653746, -0.25687558780901315, -0.20106722194156268, 0.30567800074179724, -0.08327595392105783, 0.07098516409580664, 0.04488687862346812, 0.08297801955046541, -0.0941523432493119, -0.31697767668278753, 0.3740438590416821, -0.1161701642544713, 0.16283400947364365, -0.04309814966215593, 0.14288893730305816, -0.023588067014338222, 0.04329767174700775, -0.013757889437284775, -0.13833339905977482, 0.07080343653016337, 0.3466908504005249, 0.08764664828777313, 0.09956838665586873, -0.3156984584496879, -0.17516891112573807, 0.18788493160022104, 0.15755230734102066, 0.04772948358980257, -0.030277958870389806, -0.26623130296697706, 0.11426035225073375, -0.12108808202759885, -0.21213971821182384, -0.16109080911364135, 0.10456444981377344, 0.011357415921804382, -0.23757604549130676, 0.0005432149259055533, 0.09142991725927525, 0.17255840997961236, -0.06454803912173503, -0.12265065284275518, -0.06592651258120541, 0.007498743387348041, -0.03125996747701543, 0.11436504198283684, 0.036195802899849853, -0.05323143133598312, -0.07022333936197911, 0.39015721947681614, -0.05522849799148744, -0.2339324541844246, 0.11885761474145622, -0.12429039897226797, -0.2128178627150724, 0.21473107230281685, 0.07278404646076081, 0.13473270074805108, -0.12983703061373245, 0.14150345634964362, -0.08741569162414568, 0.08778307918550038, 0.04543902857297259, -0.020545294088107055, 0.11921062210302164, 0.04788121717368684, 0.04437047667892241, 0.08916190399067113, 0.05507057182286389, -0.08350646808152883, -0.3003313531644824, -0.14971684194283513, -0.09725879880361168, 0.1477542711711466, -0.09230831624917323, -0.1464752739919321, 0.371214971502834, -0.002893015469719724, 0.15382647767883764, 0.08192195182825189, 0.21847300544216455, 0.1811073556096611, 0.06532885180786252, 0.1082851132661922, 0.17959518274065198, 0.19720234847968307, 0.024866928346455097, -0.17318319260616924, -0.001243884283367817, 0.13785257342089785]
|
1,803.07896
|
Statistical properties of Faraday rotation measure in external galaxies
-- I: intervening disc galaxies
|
Deriving the Faraday rotation measure (RM) of quasar absorption line systems,
which are tracers of high-redshift galaxies intervening background quasars, is
a powerful tool for probing magnetic fields in distant galaxies. Statistically
comparing the RM distributions of two quasar samples, with and without
absorption line systems, allows one to infer magnetic field properties of the
intervening galaxy population. Here, we have derived the analytical form of the
probability distribution function (PDF) of RM produced by a single galaxy with
an axisymmetric large-scale magnetic field. We then further determine the PDF
of RM for one random sight line traversing each galaxy in a population with a
large-scale magnetic field prescription. We find that the resulting PDF of RM
is dominated by a Lorentzian with a width that is directly related to the mean
axisymmetric large-scale field strength $\langle B_0 \rangle$ of the galaxy
population if the dispersion of $B_0$ within the population is smaller than
$\langle B_0 \rangle$. Provided that RMs produced by the intervening galaxies
have been successfully isolated from other RM contributions along the line of
sight, our simple model suggests that $\langle B_0 \rangle$ in galaxies probed
by quasar absorption line systems can be measured within $\approx50$ per cent
accuracy without additional constraints on the magneto-ionic medium properties
of the galaxies. Finally, we discuss quasar sample selection criteria that are
crucial to reliably interpret observations, and argue that within the
limitations of the current database of absorption line systems,
high-metallicity damped Lyman-$\alpha$ absorbers are best suited to study
galactic dynamo action in distant disc galaxies.
|
astro-ph.GA
|
deriving the faraday rotation measure rm of quasar absorption line systems which are tracers of highredshift galaxies intervening background quasars is a powerful tool for probing magnetic fields in distant galaxies statistically comparing the rm distributions of two quasar samples with and without absorption line systems allows one to infer magnetic field properties of the intervening galaxy population here we have derived the analytical form of the probability distribution function pdf of rm produced by a single galaxy with an axisymmetric largescale magnetic field we then further determine the pdf of rm for one random sight line traversing each galaxy in a population with a largescale magnetic field prescription we find that the resulting pdf of rm is dominated by a lorentzian with a width that is directly related to the mean axisymmetric largescale field strength langle b_0 rangle of the galaxy population if the dispersion of b_0 within the population is smaller than langle b_0 rangle provided that rms produced by the intervening galaxies have been successfully isolated from other rm contributions along the line of sight our simple model suggests that langle b_0 rangle in galaxies probed by quasar absorption line systems can be measured within approx50 per cent accuracy without additional constraints on the magnetoionic medium properties of the galaxies finally we discuss quasar sample selection criteria that are crucial to reliably interpret observations and argue that within the limitations of the current database of absorption line systems highmetallicity damped lymanalpha absorbers are best suited to study galactic dynamo action in distant disc galaxies
|
[['deriving', 'the', 'faraday', 'rotation', 'measure', 'rm', 'of', 'quasar', 'absorption', 'line', 'systems', 'which', 'are', 'tracers', 'of', 'highredshift', 'galaxies', 'intervening', 'background', 'quasars', 'is', 'a', 'powerful', 'tool', 'for', 'probing', 'magnetic', 'fields', 'in', 'distant', 'galaxies', 'statistically', 'comparing', 'the', 'rm', 'distributions', 'of', 'two', 'quasar', 'samples', 'with', 'and', 'without', 'absorption', 'line', 'systems', 'allows', 'one', 'to', 'infer', 'magnetic', 'field', 'properties', 'of', 'the', 'intervening', 'galaxy', 'population', 'here', 'we', 'have', 'derived', 'the', 'analytical', 'form', 'of', 'the', 'probability', 'distribution', 'function', 'pdf', 'of', 'rm', 'produced', 'by', 'a', 'single', 'galaxy', 'with', 'an', 'axisymmetric', 'largescale', 'magnetic', 'field', 'we', 'then', 'further', 'determine', 'the', 'pdf', 'of', 'rm', 'for', 'one', 'random', 'sight', 'line', 'traversing', 'each', 'galaxy', 'in', 'a', 'population', 'with', 'a', 'largescale', 'magnetic', 'field', 'prescription', 'we', 'find', 'that', 'the', 'resulting', 'pdf', 'of', 'rm', 'is', 'dominated', 'by', 'a', 'lorentzian', 'with', 'a', 'width', 'that', 'is', 'directly', 'related', 'to', 'the', 'mean', 'axisymmetric', 'largescale', 'field', 'strength', 'langle', 'b_0', 'rangle', 'of', 'the', 'galaxy', 'population', 'if', 'the', 'dispersion', 'of', 'b_0', 'within', 'the', 'population', 'is', 'smaller', 'than', 'langle', 'b_0', 'rangle', 'provided', 'that', 'rms', 'produced', 'by', 'the', 'intervening', 'galaxies', 'have', 'been', 'successfully', 'isolated', 'from', 'other', 'rm', 'contributions', 'along', 'the', 'line', 'of', 'sight', 'our', 'simple', 'model', 'suggests', 'that', 'langle', 'b_0', 'rangle', 'in', 'galaxies', 'probed', 'by', 'quasar', 'absorption', 'line', 'systems', 'can', 'be', 'measured', 'within', 'approx50', 'per', 'cent', 'accuracy', 'without', 'additional', 'constraints', 'on', 'the', 'magnetoionic', 'medium', 'properties', 'of', 'the', 'galaxies', 'finally', 'we', 'discuss', 'quasar', 'sample', 'selection', 'criteria', 'that', 'are', 'crucial', 'to', 'reliably', 'interpret', 'observations', 'and', 'argue', 'that', 'within', 'the', 'limitations', 'of', 'the', 'current', 'database', 'of', 'absorption', 'line', 'systems', 'highmetallicity', 'damped', 'lymanalpha', 'absorbers', 'are', 'best', 'suited', 'to', 'study', 'galactic', 'dynamo', 'action', 'in', 'distant', 'disc', 'galaxies']]
|
[-0.10856856000410385, 0.09879232918376381, -0.026949153766434655, 0.08332216119799575, -0.0824747879152342, -0.06454565985026817, -0.025176025454610847, 0.4587934321437596, -0.16276158501868815, -0.3110441818963809, 0.00554650299548233, -0.2914057784120517, -0.008120521587765403, 0.2072932475675912, 0.054811556252799494, -0.020847192680977778, -0.015634285286974872, -0.05957704783391918, -0.019288311797603677, -0.23713425865690388, 0.3199069465597519, 0.0656122882752625, 0.22044637622420427, -0.061636908073612426, 0.07164435055929486, -0.07344001088044987, -0.06073916617215607, 0.055344549618328014, -0.15310668892806698, 0.04566243069847966, 0.22394662123021275, 0.14600249866190357, 0.22772266917068382, -0.33769679513242046, -0.20542008898824324, 0.08994828737050961, 0.2343761581249883, 0.08739644334722195, -0.054530537825400294, -0.3048832062994228, 0.08379847586430349, -0.13429889826890867, -0.17741869299777635, 0.05004693275582089, 0.03228375038081338, 0.05401488047832413, -0.23683276050837335, 0.15950047801265035, 0.006851948517762443, 0.11593035993380073, -0.054232705707239634, -0.07150669722339494, -0.09617082556983246, 0.051553584834568, 0.02322785798523662, 0.0988794083658113, 0.23783920322461524, -0.169421805878775, -0.03815152676950901, 0.42563364832346773, -0.09909581713672186, -0.057146423961287766, 0.1238347012975438, -0.21667172654861663, -0.16777467897799633, 0.1435491412172297, 0.177478403346758, 0.10431902328923305, -0.14254914878066702, 0.03730674494730113, -0.06795728996990372, 0.22401949573228505, -0.033262393649999084, 0.04239246422802696, 0.30045954300750205, 0.04858996750286813, 0.042503623348019354, 0.07832160016185702, -0.1935651459602516, 0.011313007742253491, -0.2542629108749736, -0.10173104594258686, -0.1380292328286568, 0.13603865148967081, -0.13474781038445705, -0.1282055159796986, 0.341122853742724, 0.1632543855767103, 0.24426583240917568, 0.057336207953959356, 0.32030944979535814, 0.12512341890609116, 0.07593142364527394, 0.11068866233652139, 0.27773465946360204, 0.21166336229197855, 0.012938401290371377, -0.23318555189119036, 0.06849026474250111, -0.008673406409911434]
|
1,803.07897
|
(Weak) incidence bialgebras of monoidal categories
|
Incidence coalgebras of categories in the sense of Joni and Rota are studied,
specifically cases where a monoidal product on the category turns these into
(weak) bialgebras. The overlap with the theory of combinatorial Hopf algebras
and that of Hopf quivers is discussed, and examples including trees, skew
shapes, Milner's bigraphs and crossed modules are considered.
|
math.QA math.CT
|
incidence coalgebras of categories in the sense of joni and rota are studied specifically cases where a monoidal product on the category turns these into weak bialgebras the overlap with the theory of combinatorial hopf algebras and that of hopf quivers is discussed and examples including trees skew shapes milners bigraphs and crossed modules are considered
|
[['incidence', 'coalgebras', 'of', 'categories', 'in', 'the', 'sense', 'of', 'joni', 'and', 'rota', 'are', 'studied', 'specifically', 'cases', 'where', 'a', 'monoidal', 'product', 'on', 'the', 'category', 'turns', 'these', 'into', 'weak', 'bialgebras', 'the', 'overlap', 'with', 'the', 'theory', 'of', 'combinatorial', 'hopf', 'algebras', 'and', 'that', 'of', 'hopf', 'quivers', 'is', 'discussed', 'and', 'examples', 'including', 'trees', 'skew', 'shapes', 'milners', 'bigraphs', 'and', 'crossed', 'modules', 'are', 'considered']]
|
[-0.1532777241092514, 0.06961186673830856, 0.0010738880796865983, 0.1611947660524906, -0.11038906691934575, -0.16645072450522672, -0.04510621824090115, 0.42651154354891996, -0.4148443883877586, -0.1818571627140045, 0.13200885041997854, -0.20809373542327772, -0.19270628100176426, 0.16449111716991122, -0.18528211030431768, -0.11340353093533354, 0.12694035649976948, 0.12217433989386667, -0.07789047092651757, -0.2740852493475276, 0.49143504060974175, -0.018555400473996998, 0.2377301954918287, 0.018787886295467616, 0.09693995898758823, 0.04943881986493414, -0.06535907895727591, 0.07635508574864865, -0.19340474808189106, 0.09288602195341479, 0.3501540918919173, 0.06163333859294653, 0.15646841382311488, -0.3579132056202401, -0.024104377409887755, 0.09222672414457933, 0.14099110268395054, 0.032501632305370134, -0.006280546205710958, -0.36579547153616493, 0.043219665421003646, -0.27817366172305563, -0.009506285021250898, -0.049687005223875695, 0.11480368369004944, 0.05839595484801314, -0.25098446843224914, -0.044438334385102446, 0.10463360451500524, 0.11973511275242675, -0.06297769719226794, -0.12356151267886162, -0.14071372309699653, 0.11123249899087982, -0.06695281113497913, -0.09772182311862707, 0.14710905694148757, -0.1306342184712941, -0.22039346026510678, 0.3500404366715388, 0.06662645798853853, -0.20692325969311323, 0.17599251430735668, -0.14458119571208955, -0.15850895912471144, 0.10077047744257883, -0.005044933611696416, 0.14077807564119046, -0.05638335314579308, 0.18355053683150221, -0.14030755419622767, -0.05638427087529139, 0.1798495241356167, 0.030418529590083794, 0.14883126901801336, 0.11215341384099288, -0.014179862030273811, 0.20847354410216212, 0.036471045918932014, -0.12688451463525946, -0.31181430254470216, -0.12297552142038264, 0.042572006464681844, 0.06676307616924698, -0.08745987258576364, -0.21492196871814404, 0.40147052830593155, 0.09203024933283979, 0.12833320390941066, 0.12412815912288021, 0.17573559605939823, 0.020018563690510662, 0.13796743299304084, -0.019868873796341092, 0.15265446386554024, 0.36294698132710024, 0.012509389738128944, 0.00039262852462177924, -0.025672950273887676, 0.21674816530113192]
|
1,803.07898
|
Explicit Computational Wave Propagation in Micro-Heterogeneous Media
|
Explicit time stepping schemes are popular for linear acoustic and elastic
wave propagation due to their simple nature which does not require
sophisticated solvers for the inversion of the stiffness matrices. However,
explicit schemes are only stable if the time step size is bounded by the mesh
size in space subject to the so-called CFL condition. In micro-heterogeneous
media, this condition is typically prohibitively restrictive because spatial
oscillations of the medium need to be resolved by the discretization in space.
This paper presents a way to reduce the spatial complexity in such a setting
and, hence, to enable a relaxation of the CFL condition. This is done using the
Localized Orthogonal Decomposition method as a tool for numerical
homogenization. A complete convergence analysis is presented with appropriate,
weak regularity assumptions on the initial data.
|
math.NA
|
explicit time stepping schemes are popular for linear acoustic and elastic wave propagation due to their simple nature which does not require sophisticated solvers for the inversion of the stiffness matrices however explicit schemes are only stable if the time step size is bounded by the mesh size in space subject to the socalled cfl condition in microheterogeneous media this condition is typically prohibitively restrictive because spatial oscillations of the medium need to be resolved by the discretization in space this paper presents a way to reduce the spatial complexity in such a setting and hence to enable a relaxation of the cfl condition this is done using the localized orthogonal decomposition method as a tool for numerical homogenization a complete convergence analysis is presented with appropriate weak regularity assumptions on the initial data
|
[['explicit', 'time', 'stepping', 'schemes', 'are', 'popular', 'for', 'linear', 'acoustic', 'and', 'elastic', 'wave', 'propagation', 'due', 'to', 'their', 'simple', 'nature', 'which', 'does', 'not', 'require', 'sophisticated', 'solvers', 'for', 'the', 'inversion', 'of', 'the', 'stiffness', 'matrices', 'however', 'explicit', 'schemes', 'are', 'only', 'stable', 'if', 'the', 'time', 'step', 'size', 'is', 'bounded', 'by', 'the', 'mesh', 'size', 'in', 'space', 'subject', 'to', 'the', 'socalled', 'cfl', 'condition', 'in', 'microheterogeneous', 'media', 'this', 'condition', 'is', 'typically', 'prohibitively', 'restrictive', 'because', 'spatial', 'oscillations', 'of', 'the', 'medium', 'need', 'to', 'be', 'resolved', 'by', 'the', 'discretization', 'in', 'space', 'this', 'paper', 'presents', 'a', 'way', 'to', 'reduce', 'the', 'spatial', 'complexity', 'in', 'such', 'a', 'setting', 'and', 'hence', 'to', 'enable', 'a', 'relaxation', 'of', 'the', 'cfl', 'condition', 'this', 'is', 'done', 'using', 'the', 'localized', 'orthogonal', 'decomposition', 'method', 'as', 'a', 'tool', 'for', 'numerical', 'homogenization', 'a', 'complete', 'convergence', 'analysis', 'is', 'presented', 'with', 'appropriate', 'weak', 'regularity', 'assumptions', 'on', 'the', 'initial', 'data']]
|
[-0.12313949881835763, 0.10022877076906818, -0.0978627206435553, 0.06975822348613292, -0.13463596905812733, -0.1256524343428699, 0.052186530236595946, 0.37530334100575374, -0.2900314180471906, -0.2826547912756135, 0.1777656701729542, -0.15838254923070955, -0.09628410551774043, 0.17157742932055467, -0.06211870707417453, 0.1108395958667677, 0.0844434557790707, -0.013483033161890461, -0.09690671676815368, -0.23500477011784687, 0.3243798045336472, 0.055448290559330156, 0.31267573082945627, 0.035505754265696146, 0.08615635670598988, -0.004370552638223521, -0.04513624157840596, 0.023951479598365136, -0.11026898926901683, 0.09715197727616344, 0.25875410365984125, 0.08220000816614163, 0.31356111496574895, -0.4635906010810146, -0.22569531211419439, 0.1094455952595051, 0.16664094996509052, 0.1474505559133394, -0.03176669768474408, -0.24853582263230942, 0.09884755960070438, -0.09115059383885753, -0.16138141869070163, -0.10341989886211722, 0.010312705839935103, 0.022281109470054787, -0.31574543718514697, 0.09686759906239752, 0.08150711002990715, 0.04471370773179863, -0.016486516498953552, -0.04939742902419845, 0.013988963427211166, 0.07422555405366466, 0.030507480700262227, -0.0028982030935025306, 0.05287250149224822, -0.08172407761020095, -0.030842307107733155, 0.41431316842598126, -0.024726244059034196, -0.29851964694759425, 0.19911414990114062, -0.08891278171375275, -0.10755262262173894, 0.1649329198937499, 0.18026418436784297, 0.1432923391370341, -0.11745664197032486, 0.1031567710513053, -0.013979617279452706, 0.19022045837701262, 0.08198316166303436, 0.042322132830977216, 0.09992970648410737, 0.19217819427105046, 0.14214606093648904, 0.08995724315807588, -0.026070165670217763, -0.06945608297881103, -0.3115130905131984, -0.1306745420679226, -0.1940463133772513, 0.018414024291192425, -0.07986209271987725, -0.19392343021752453, 0.3420668832355536, 0.12358687724217884, 0.1718411209758483, 0.05939096698442936, 0.3584103909692258, 0.13444273573910132, 0.07471122918825568, 0.07859246048348066, 0.20062118523607128, 0.1298251216565924, 0.14599673510213992, -0.22225554274479137, 0.09823438442921392, 0.11382595018719592]
|
1,803.07899
|
On scaling limits of planar maps with stable face-degrees
|
We discuss the asymptotic behaviour of random critical Boltzmann planar maps
in which the degree of a typical face belongs to the domain of attraction of a
stable law with index $\alpha \in (1,2]$. We prove that when conditioning such
maps to have $n$ vertices, or $n$ edges, or $n$ faces, the vertex-set endowed
with the graph distance suitably rescaled converges in distribution towards the
celebrated Brownian map when $\alpha=2$, and, after extraction of a
subsequence, towards another `$\alpha$-stable map' when $\alpha <2$, which
improves on a first result due to Le Gall & Miermont who assumed slightly more
regularity.
|
math.PR
|
we discuss the asymptotic behaviour of random critical boltzmann planar maps in which the degree of a typical face belongs to the domain of attraction of a stable law with index alpha in 12 we prove that when conditioning such maps to have n vertices or n edges or n faces the vertexset endowed with the graph distance suitably rescaled converges in distribution towards the celebrated brownian map when alpha2 and after extraction of a subsequence towards another alphastable map when alpha 2 which improves on a first result due to le gall miermont who assumed slightly more regularity
|
[['we', 'discuss', 'the', 'asymptotic', 'behaviour', 'of', 'random', 'critical', 'boltzmann', 'planar', 'maps', 'in', 'which', 'the', 'degree', 'of', 'a', 'typical', 'face', 'belongs', 'to', 'the', 'domain', 'of', 'attraction', 'of', 'a', 'stable', 'law', 'with', 'index', 'alpha', 'in', '12', 'we', 'prove', 'that', 'when', 'conditioning', 'such', 'maps', 'to', 'have', 'n', 'vertices', 'or', 'n', 'edges', 'or', 'n', 'faces', 'the', 'vertexset', 'endowed', 'with', 'the', 'graph', 'distance', 'suitably', 'rescaled', 'converges', 'in', 'distribution', 'towards', 'the', 'celebrated', 'brownian', 'map', 'when', 'alpha2', 'and', 'after', 'extraction', 'of', 'a', 'subsequence', 'towards', 'another', 'alphastable', 'map', 'when', 'alpha', '2', 'which', 'improves', 'on', 'a', 'first', 'result', 'due', 'to', 'le', 'gall', 'miermont', 'who', 'assumed', 'slightly', 'more', 'regularity']]
|
[-0.0862979903720752, 0.1447452058582896, -0.07895925771586146, 0.009400640802476743, -0.02899529224948374, -0.19635882793991555, 0.05973763508026046, 0.3472962262899135, -0.29135793612122235, -0.2513168091048496, 0.07792078555124163, -0.35257058025271903, -0.12260737942973848, 0.11292640319696129, -0.10519626301424749, 0.043689992278814316, 0.03743533434986015, 0.07802776698107747, 0.0078579541883723, -0.2204312548183041, 0.3221117482718193, -0.002947733878637805, 0.2288360930226668, -0.015206830049253474, 0.09704449749316531, 0.020875303616813112, -0.0012423036093212137, 0.019553810287492746, -0.18048073077902746, 0.07366332286178615, 0.1650374596656272, 0.058585533902820466, 0.2886269466123647, -0.33490855248663765, -0.16796636818484825, 0.18182383868325916, 0.16826182185211266, 0.022093567317539847, 0.015448490822554867, -0.2795580066176075, 0.13865573809604453, -0.09030383812499379, -0.20145510243383621, 0.007401635343528757, 0.1103738821723094, 0.062294837350797175, -0.314411884212556, 0.05425431112749408, 0.16100595045053975, 0.035497560231673594, 0.0026509921734381202, -0.14286108522421934, -0.05099714643350153, 0.11443700759661045, 0.03231184733937485, 0.09436068275115556, 0.08650872115083415, -0.14353748553931112, -0.08399140926999878, 0.34559907788655375, -0.08066753981249275, -0.2121963128588642, 0.13898920742888946, -0.19517822803710727, -0.17840448010599974, 0.11028133435268896, 0.11956275492492649, 0.13526908578411406, -0.06007024958818526, 0.134805934376088, -0.037106343610870715, 0.16014264708366058, 0.14874968710684716, -0.03834697277275751, 0.1196433667045303, 0.12288693968686416, 0.17329471788517284, 0.1770222227117329, -0.06729956681727234, -0.0749043366175634, -0.2648053998174616, -0.12368245373922165, -0.22697202533935057, 0.14142617629370605, -0.21249874591379958, -0.19404524287227728, 0.3278032687652593, 0.11754739333433334, 0.2572090816637031, 0.1506309040723312, 0.19182639379016678, 0.09928607091665118, -0.007117700019870141, 0.12416447603585895, 0.12484903761122207, 0.11200810923720851, 0.06582892232226452, -0.11634448681478247, 0.06657383411962803, 0.13917314546239196]
|
1,803.079
|
Josephson Current in Rashba-based Superconducting Nanowires with
Geometric Misalignment
|
We investigate the properties of a weak link between two Rashba-based
superconducting nanowires with geometric misalignment. By applying an external
magnetic field the system can be driven into a topological non-trivial regime.
We demonstrate that the Josephson current can be modulated in amplitude and
sign through the variation of the applied field and, remarkably, via the angle
controlling the spin-orbit locking mismatch at the interface of the nanowires.
The proposed setup with misaligned coplanar nanowires provides the building
block configuration for the manipulation of coherent transport via
geometric-controlled mixing/splitting of interface states.
|
cond-mat.supr-con cond-mat.mes-hall
|
we investigate the properties of a weak link between two rashbabased superconducting nanowires with geometric misalignment by applying an external magnetic field the system can be driven into a topological nontrivial regime we demonstrate that the josephson current can be modulated in amplitude and sign through the variation of the applied field and remarkably via the angle controlling the spinorbit locking mismatch at the interface of the nanowires the proposed setup with misaligned coplanar nanowires provides the building block configuration for the manipulation of coherent transport via geometriccontrolled mixingsplitting of interface states
|
[['we', 'investigate', 'the', 'properties', 'of', 'a', 'weak', 'link', 'between', 'two', 'rashbabased', 'superconducting', 'nanowires', 'with', 'geometric', 'misalignment', 'by', 'applying', 'an', 'external', 'magnetic', 'field', 'the', 'system', 'can', 'be', 'driven', 'into', 'a', 'topological', 'nontrivial', 'regime', 'we', 'demonstrate', 'that', 'the', 'josephson', 'current', 'can', 'be', 'modulated', 'in', 'amplitude', 'and', 'sign', 'through', 'the', 'variation', 'of', 'the', 'applied', 'field', 'and', 'remarkably', 'via', 'the', 'angle', 'controlling', 'the', 'spinorbit', 'locking', 'mismatch', 'at', 'the', 'interface', 'of', 'the', 'nanowires', 'the', 'proposed', 'setup', 'with', 'misaligned', 'coplanar', 'nanowires', 'provides', 'the', 'building', 'block', 'configuration', 'for', 'the', 'manipulation', 'of', 'coherent', 'transport', 'via', 'geometriccontrolled', 'mixingsplitting', 'of', 'interface', 'states']]
|
[-0.26762126848722495, 0.18039500781790896, -0.03582273440745969, -0.014256076895010968, -0.05444853329875817, -0.13956886031147506, 0.04262623289962196, 0.39977187986175217, -0.2976776237651292, -0.3204027088048557, 0.04619973743101582, -0.19655328693592714, -0.1354046581261274, 0.23913824902330008, 0.02602228149254289, 0.011491678246400423, 0.014101941464468836, -0.0789470228806345, -0.08462848466200133, -0.15521944704685464, 0.343747847330653, 0.012269436397279303, 0.33468352873913115, 0.05645397110040196, 0.08555478807668099, 0.03763910896506988, 0.1045846450323653, 0.05743310866722216, -0.10823197345315647, 0.07875700782298939, 0.17944916559564364, -0.06610318078762956, 0.17749978648498654, -0.4897517995287975, -0.18092946025232473, 0.02101005625186695, 0.14624237907668836, 0.15072023389447067, -0.08267227044691228, -0.3320286352601316, 0.07651279203386771, -0.13831934083718805, -0.10751840544140173, -0.06018553148282485, -0.04415949847704421, 0.0045257696364488864, -0.26234591024048215, 0.029367783272431957, 0.06276942098306285, 0.06644816088179747, -0.028402553307306434, -0.02595842619711119, -0.0655887039197195, 0.10819060856269466, 0.029513445010201797, 0.051174754028518996, 0.17068618401147737, -0.1379802599756254, -0.13672073268228108, 0.3092229081317782, -0.1122772231982607, -0.1860253368711306, 0.15791616436714928, -0.12833082724569572, -0.005187864053166575, 0.1043498214851651, 0.13632528915380437, 0.06419535930164987, -0.12635774871127473, 0.06628996263025329, 0.018229140744855005, 0.17537493118240188, 0.05756992069590423, 0.06098165162321594, 0.3173673558876746, 0.18536349688139225, 0.06296174944404306, 0.20413920904328633, -0.14737152960410135, -0.06415079550610649, -0.2528824038286176, -0.15625675596917668, -0.19539771171079742, 0.026333735197679037, -0.07861452050371251, -0.15904867487649124, 0.4362237207746754, 0.15970135474991468, 0.1957160759044604, -0.06361657854221348, 0.2843738391167588, 0.13893656278443006, 0.0753313029702339, 0.02249872664558805, 0.2975410253288121, 0.1939397998386994, 0.07284516893430716, -0.3250995183363557, 0.08334044519708389, -0.013054652799231311]
|
1,803.07901
|
Selecting Fault Revealing Mutants
|
Mutant selection refers to the problem of choosing, among a large number of
mutants, the (few) ones that should be used by the testers. In view of this, we
investigate the problem of selecting the fault revealing mutants, i.e., the
mutants that are most likely to be killable and lead to test cases that uncover
unknown program faults. We formulate two variants of this problem: the fault
revealing mutant selection and the fault revealing mutant prioritization. We
argue and show that these problems can be tackled through a set of 'static'
program features and propose a machine learning approach, named FaRM, that
learns to select and rank killable and fault revealing mutants. Experimental
results involving 1,692 real faults show the practical benefits of our approach
in both examined problems. Our results show that FaRM achieves a good trade-off
between application cost and effectiveness (measured in terms of faults
revealed). We also show that FaRM outperforms all the existing mutant selection
methods, i.e., the random mutant sampling, the selective mutation and defect
prediction (mutating the code areas pointed by defect prediction). In
particular, our results show that with respect to mutant selection, our
approach reveals 23% to 34% more faults than any of the baseline methods,
while, with respect to mutant prioritization, it achieves higher average
percentage of revealed faults with a median difference between 4% and 9% (from
the random mutant orderings).
|
cs.SE
|
mutant selection refers to the problem of choosing among a large number of mutants the few ones that should be used by the testers in view of this we investigate the problem of selecting the fault revealing mutants ie the mutants that are most likely to be killable and lead to test cases that uncover unknown program faults we formulate two variants of this problem the fault revealing mutant selection and the fault revealing mutant prioritization we argue and show that these problems can be tackled through a set of static program features and propose a machine learning approach named farm that learns to select and rank killable and fault revealing mutants experimental results involving 1692 real faults show the practical benefits of our approach in both examined problems our results show that farm achieves a good tradeoff between application cost and effectiveness measured in terms of faults revealed we also show that farm outperforms all the existing mutant selection methods ie the random mutant sampling the selective mutation and defect prediction mutating the code areas pointed by defect prediction in particular our results show that with respect to mutant selection our approach reveals 23 to 34 more faults than any of the baseline methods while with respect to mutant prioritization it achieves higher average percentage of revealed faults with a median difference between 4 and 9 from the random mutant orderings
|
[['mutant', 'selection', 'refers', 'to', 'the', 'problem', 'of', 'choosing', 'among', 'a', 'large', 'number', 'of', 'mutants', 'the', 'few', 'ones', 'that', 'should', 'be', 'used', 'by', 'the', 'testers', 'in', 'view', 'of', 'this', 'we', 'investigate', 'the', 'problem', 'of', 'selecting', 'the', 'fault', 'revealing', 'mutants', 'ie', 'the', 'mutants', 'that', 'are', 'most', 'likely', 'to', 'be', 'killable', 'and', 'lead', 'to', 'test', 'cases', 'that', 'uncover', 'unknown', 'program', 'faults', 'we', 'formulate', 'two', 'variants', 'of', 'this', 'problem', 'the', 'fault', 'revealing', 'mutant', 'selection', 'and', 'the', 'fault', 'revealing', 'mutant', 'prioritization', 'we', 'argue', 'and', 'show', 'that', 'these', 'problems', 'can', 'be', 'tackled', 'through', 'a', 'set', 'of', 'static', 'program', 'features', 'and', 'propose', 'a', 'machine', 'learning', 'approach', 'named', 'farm', 'that', 'learns', 'to', 'select', 'and', 'rank', 'killable', 'and', 'fault', 'revealing', 'mutants', 'experimental', 'results', 'involving', '1692', 'real', 'faults', 'show', 'the', 'practical', 'benefits', 'of', 'our', 'approach', 'in', 'both', 'examined', 'problems', 'our', 'results', 'show', 'that', 'farm', 'achieves', 'a', 'good', 'tradeoff', 'between', 'application', 'cost', 'and', 'effectiveness', 'measured', 'in', 'terms', 'of', 'faults', 'revealed', 'we', 'also', 'show', 'that', 'farm', 'outperforms', 'all', 'the', 'existing', 'mutant', 'selection', 'methods', 'ie', 'the', 'random', 'mutant', 'sampling', 'the', 'selective', 'mutation', 'and', 'defect', 'prediction', 'mutating', 'the', 'code', 'areas', 'pointed', 'by', 'defect', 'prediction', 'in', 'particular', 'our', 'results', 'show', 'that', 'with', 'respect', 'to', 'mutant', 'selection', 'our', 'approach', 'reveals', '23', 'to', '34', 'more', 'faults', 'than', 'any', 'of', 'the', 'baseline', 'methods', 'while', 'with', 'respect', 'to', 'mutant', 'prioritization', 'it', 'achieves', 'higher', 'average', 'percentage', 'of', 'revealed', 'faults', 'with', 'a', 'median', 'difference', 'between', '4', 'and', '9', 'from', 'the', 'random', 'mutant', 'orderings']]
|
[-0.10082932772145242, 0.02246490028362883, -0.04398192430886885, 0.0746639325172114, -0.03499142985548014, -0.20080478393027315, 0.12069461541655271, 0.39873973882716635, -0.24973092001164332, -0.3349572666622091, 0.0669616185877796, -0.26232952201819937, -0.209762232914648, 0.1959425938649751, -0.11573725017496263, 0.008353320712162911, 0.13372229268450453, 0.00455658177126442, 0.0019674280994956424, -0.32383475228030556, 0.2568899136790803, 0.04799220166776491, 0.305685440422056, 0.017052930436804434, 0.10432548457706023, 0.009368495959991022, -0.03557206920054539, 0.07447611508117045, -0.08157359354587718, 0.10816040342602798, 0.302449680139999, 0.17991501796059312, 0.3226181957526537, -0.36901420654486056, -0.1907348878317229, 0.10175354419600056, 0.12903030725276987, 0.14065128998000823, -0.01686758804976505, -0.25926926057461813, 0.15153938961599994, -0.17311010630851936, -0.07336478696771614, -0.08096752841045837, -0.03284486301354659, 0.03675905154567495, -0.26974272109649106, 0.05826231295270744, 0.013405571766602604, 0.07485427495659046, -0.0521057623570137, -0.1336165100052629, -0.027523960894905032, 0.12006932062263924, 0.09265683279372752, 0.010490830295273791, 0.1729304507314025, -0.11722334887751419, -0.2035921185074941, 0.36116175566516495, 0.014694072388848999, -0.1890209601442937, 0.20564466330182293, -0.10235210962026664, -0.1739094376002749, 0.13224927517787918, 0.1362497096425732, 0.09989525211542218, -0.12028514186740326, -0.025104474140908165, -0.0016420742066617568, 0.17054140967944556, 0.07208189196965617, -0.017633292427205523, 0.1407797864101746, 0.1855474376590396, 0.08716110315973587, 0.17629875090965272, -0.13161217691376806, -0.07540268386187761, -0.23967904734384754, -0.15302889515119403, -0.12922070387437048, 0.007008557394146919, -0.12534542390209896, -0.17536965155032586, 0.422065231560365, 0.1966673872400703, 0.16091366967429285, 0.13940874545470527, 0.24202644722131283, 0.02807540391203593, 0.08180498707518817, 0.0775199721182656, 0.17419127205224788, 0.018497358537886453, 0.023935385827359785, -0.24206106157305285, 0.15990089297335108, 0.0015567512625990355]
|
1,803.07902
|
Analyses of multi-pion Hanbury-Brown-Twiss correlations for the
pion-emitting sources with Bose-Einstein condensation
|
We calculate the three- and four-particle correlations of identical pions in
an evolving pion gas (EPG) model with Bose-Einstein condensation. The
multi-pion correlation functions in the EPG model are analyzed in different
momentum intervals and compared with the experimental data for Pb-Pb collisions
at $\sqrt{s_{NN}}=2.76$ TeV. It is found that the multi-pion correlation
functions and cumulant correlation functions are sensitive to the condensation
fraction of the EPG sources in the low average transverse-momentum intervals of
the three and four pions. The model results of the multi-pion correlations are
consistent with the experimental data in a considerable degree, which gives a
source condensation fraction between 16~--~47\%.
|
nucl-th
|
we calculate the three and fourparticle correlations of identical pions in an evolving pion gas epg model with boseeinstein condensation the multipion correlation functions in the epg model are analyzed in different momentum intervals and compared with the experimental data for pbpb collisions at sqrts_nn276 tev it is found that the multipion correlation functions and cumulant correlation functions are sensitive to the condensation fraction of the epg sources in the low average transversemomentum intervals of the three and four pions the model results of the multipion correlations are consistent with the experimental data in a considerable degree which gives a source condensation fraction between 1647
|
[['we', 'calculate', 'the', 'three', 'and', 'fourparticle', 'correlations', 'of', 'identical', 'pions', 'in', 'an', 'evolving', 'pion', 'gas', 'epg', 'model', 'with', 'boseeinstein', 'condensation', 'the', 'multipion', 'correlation', 'functions', 'in', 'the', 'epg', 'model', 'are', 'analyzed', 'in', 'different', 'momentum', 'intervals', 'and', 'compared', 'with', 'the', 'experimental', 'data', 'for', 'pbpb', 'collisions', 'at', 'sqrts_nn276', 'tev', 'it', 'is', 'found', 'that', 'the', 'multipion', 'correlation', 'functions', 'and', 'cumulant', 'correlation', 'functions', 'are', 'sensitive', 'to', 'the', 'condensation', 'fraction', 'of', 'the', 'epg', 'sources', 'in', 'the', 'low', 'average', 'transversemomentum', 'intervals', 'of', 'the', 'three', 'and', 'four', 'pions', 'the', 'model', 'results', 'of', 'the', 'multipion', 'correlations', 'are', 'consistent', 'with', 'the', 'experimental', 'data', 'in', 'a', 'considerable', 'degree', 'which', 'gives', 'a', 'source', 'condensation', 'fraction', 'between', '1647']]
|
[-0.10288035415966684, 0.23261890354735357, -0.12193430371671206, 0.16319557365052226, 0.09841801013930568, -0.07935919505322263, -0.04232556564689037, 0.3721316305476995, -0.15932397979222948, -0.2887975408385197, -0.0409078933309675, -0.4264672181435994, 0.012714408515464692, 0.1477038462934572, 0.11597432237828062, 0.08545385576962006, 0.0504419620814068, 0.004908310497800509, -0.07000409933028831, -0.21928916072384233, 0.3279107786803728, 0.06749021835137337, 0.2858687682343381, 0.14841782933633244, 0.07378604612756698, 0.017451708777142423, -0.04765410868539697, -0.01175614045489402, -0.11001184998070433, 0.05078756821458228, 0.24758049168934423, 0.04492654794206222, 0.15499933058662074, -0.3270982780804237, -0.13360843893495344, 0.13822864641745886, 0.15662315775684657, 0.07981953685992353, -0.034560322651772626, -0.2522332704492978, 0.018421132600910606, -0.22688489622295102, -0.08969755321741105, -0.05242345617817981, 0.021679811459034682, 0.06995768034387202, -0.3073911305738702, 0.180738358518907, -0.024775664792174384, 0.07201902666794402, -0.07569985870005828, -0.1865901648199984, -0.06585542108154013, 0.06997623343375467, 0.05634478401486939, 0.09050211725490434, 0.10828063089755319, -0.16123475598370923, -0.1174960778122546, 0.3472196105601532, -0.0412120625288004, -0.1835951388791381, 0.17461831241491296, -0.2321382278753888, -0.132143962494142, 0.17593482470228558, 0.20661049286136404, 0.06267559954985266, -0.20845194920187904, -0.021753691420391467, -0.06087514823579806, 0.1993380151334263, 0.04542217795249252, 0.06786196821679671, 0.19016113909227508, 0.13754454467977797, -0.05663954314908811, 0.1570890649377058, -0.10172756335565022, -0.14026288247356813, -0.34718368287153895, -0.07410057547191778, -0.13727404692520698, -0.021863169808472905, -0.13038693519608516, -0.0943500095041513, 0.381705696827599, 0.12312521585485055, 0.2891262772803505, 0.05973825300267587, 0.2661511198994482, 0.12300496785014513, 0.08272516499495222, 0.08766752359501663, 0.2485990260062473, 0.1105480180365876, 0.15240215345818017, -0.24120504079563987, 0.044125923314797026, 0.011535662891609328]
|
1,803.07903
|
Giant Asymmetric Radiation from an Ultrathin Bianisotropic Metamaterial
|
Unidirectional radiation is of particular interest in high-power lasing and
optics. Commonly, however, it is difficult to achieve a unidirectional profile
in such a system without breaking reciprocity. Recently, assisted by
metamaterials without structural symmetry, antennas that radiate asymmetrically
have been developed, hence providing the possibility of achieving
unidirectionality. Nevertheless, it has been challenging to achieve extremely
high radiation asymmetry in such antennas. Here, we demonstrate that this
radiation asymmetry is further enhanced when magnetic plasmons are present in
the metamaterials. Experimentally, we show that a thin metamaterial with a
thickness of approximately {\lambda}_0/8 can exhibit a forward-to-backward
emission asymmetry of up to 1:32 without any optimization. Our work paves the
way for manipulating asymmetric radiation by means of metamaterials and may
have a variety of promising applications, such as directional optical and
quantum emitters, lasers, and absorbers.
|
physics.app-ph physics.optics
|
unidirectional radiation is of particular interest in highpower lasing and optics commonly however it is difficult to achieve a unidirectional profile in such a system without breaking reciprocity recently assisted by metamaterials without structural symmetry antennas that radiate asymmetrically have been developed hence providing the possibility of achieving unidirectionality nevertheless it has been challenging to achieve extremely high radiation asymmetry in such antennas here we demonstrate that this radiation asymmetry is further enhanced when magnetic plasmons are present in the metamaterials experimentally we show that a thin metamaterial with a thickness of approximately lambda_08 can exhibit a forwardtobackward emission asymmetry of up to 132 without any optimization our work paves the way for manipulating asymmetric radiation by means of metamaterials and may have a variety of promising applications such as directional optical and quantum emitters lasers and absorbers
|
[['unidirectional', 'radiation', 'is', 'of', 'particular', 'interest', 'in', 'highpower', 'lasing', 'and', 'optics', 'commonly', 'however', 'it', 'is', 'difficult', 'to', 'achieve', 'a', 'unidirectional', 'profile', 'in', 'such', 'a', 'system', 'without', 'breaking', 'reciprocity', 'recently', 'assisted', 'by', 'metamaterials', 'without', 'structural', 'symmetry', 'antennas', 'that', 'radiate', 'asymmetrically', 'have', 'been', 'developed', 'hence', 'providing', 'the', 'possibility', 'of', 'achieving', 'unidirectionality', 'nevertheless', 'it', 'has', 'been', 'challenging', 'to', 'achieve', 'extremely', 'high', 'radiation', 'asymmetry', 'in', 'such', 'antennas', 'here', 'we', 'demonstrate', 'that', 'this', 'radiation', 'asymmetry', 'is', 'further', 'enhanced', 'when', 'magnetic', 'plasmons', 'are', 'present', 'in', 'the', 'metamaterials', 'experimentally', 'we', 'show', 'that', 'a', 'thin', 'metamaterial', 'with', 'a', 'thickness', 'of', 'approximately', 'lambda_08', 'can', 'exhibit', 'a', 'forwardtobackward', 'emission', 'asymmetry', 'of', 'up', 'to', '132', 'without', 'any', 'optimization', 'our', 'work', 'paves', 'the', 'way', 'for', 'manipulating', 'asymmetric', 'radiation', 'by', 'means', 'of', 'metamaterials', 'and', 'may', 'have', 'a', 'variety', 'of', 'promising', 'applications', 'such', 'as', 'directional', 'optical', 'and', 'quantum', 'emitters', 'lasers', 'and', 'absorbers']]
|
[-0.1374724851426223, 0.16341687149510983, -0.059936047293735244, 0.0023514681124386723, -0.10961501249392605, -0.17650246100133135, 0.01740172629696691, 0.5038678349152098, -0.21196723565200928, -0.3430663252529352, 0.051763545256108046, -0.2620990277628285, -0.1842026570743888, 0.23913681443889429, -0.025192614114523806, 0.08432072707635425, -0.024775131605565548, -0.09038389580031979, 0.010148678912210149, -0.14218241190979677, 0.2564021827292758, 0.08208662270225013, 0.33783277798185707, 0.09485447111396786, 0.10450916635688312, -0.03567542848993011, 0.07294372328128802, 0.015559356425120666, -0.046595213687874594, 0.09730718796732869, 0.2796553741855017, 0.029242316984918214, 0.2506323349628135, -0.43408438443065195, -0.30116812759215, 0.10326168200606141, 0.1907459306666614, 0.16968204627275793, -0.15575773608666865, -0.24486093188425267, 0.10068353494615669, -0.15774401927869902, -0.1444954464728706, -0.08222641688465637, 0.0031671129629342225, 0.019015222508290335, -0.2612239908988683, 0.00855863971948406, 0.049605219506821764, 0.05919390067077466, 0.01851055270101685, -0.03872916429986783, -0.006000200784459275, 0.04817683003901463, 0.00917843917051643, -0.01090355506880603, 0.1393246560609886, -0.14414891282123696, -0.1330668919882907, 0.39621244646935133, -0.034266162971306566, -0.14456545628172202, 0.17803008512705973, -0.15683778831531314, -0.05317047620736008, 0.18813238384875122, 0.17798103338420174, 0.11468925388074433, -0.12751907862803175, 0.031852756111957405, -0.02167951498167032, 0.17360799557386633, 0.12528781326025398, 0.1336423154532855, 0.25844305231453457, 0.1869602277433078, 0.06368612201653258, 0.15904255892850294, -0.06841766068637099, 0.016443318568414796, -0.22057677419298757, -0.16161939295783748, -0.18640335821240706, 0.08457189186197454, -0.05188988182348723, -0.11833726542655133, 0.34906840565899916, 0.16818734173353653, 0.13076147885422093, -0.021256872588755006, 0.3233776165293122, 0.126146008291139, 0.12386822436739059, 0.03882348698557076, 0.34224989654047644, 0.13756397009630056, 0.11269474587155537, -0.21871346899097527, 0.045288969767721794, -0.09547277097250369]
|
1,803.07904
|
A path integral based model for stocks and order dynamics
|
We introduce a model for the short-term dynamics of financial assets based on
an application to finance of quantum gauge theory, developing ideas of Ilinski.
We present a numerical algorithm for the computation of the probability
distribution of prices and compare the results with APPLE stocks prices and the
S&P500 index.
|
q-fin.CP
|
we introduce a model for the shortterm dynamics of financial assets based on an application to finance of quantum gauge theory developing ideas of ilinski we present a numerical algorithm for the computation of the probability distribution of prices and compare the results with apple stocks prices and the sp500 index
|
[['we', 'introduce', 'a', 'model', 'for', 'the', 'shortterm', 'dynamics', 'of', 'financial', 'assets', 'based', 'on', 'an', 'application', 'to', 'finance', 'of', 'quantum', 'gauge', 'theory', 'developing', 'ideas', 'of', 'ilinski', 'we', 'present', 'a', 'numerical', 'algorithm', 'for', 'the', 'computation', 'of', 'the', 'probability', 'distribution', 'of', 'prices', 'and', 'compare', 'the', 'results', 'with', 'apple', 'stocks', 'prices', 'and', 'the', 'sp500', 'index']]
|
[-0.05314241348784052, 0.04940970428544782, -0.15578489073132182, 0.1106192826786462, -0.04504040716325536, -0.10828419714508687, 0.12338480188776099, 0.40125047455669616, -0.2317096457140995, -0.2516140919726561, 0.16094768191596456, -0.3142973752874954, -0.1998423635046564, 0.23270558726097293, -0.11699232089221386, 0.05354135410458434, 0.017783396256466705, -0.024151075293547382, 0.027183983365402502, -0.27344744157173906, 0.25726747838780284, 0.07397504590734766, 0.2962157708939676, 0.050258383675314044, 0.15049176412981516, 0.009738742693455196, -0.07696917032202084, -0.04302528303335695, -0.1687402789134021, 0.23862677398046442, 0.2290299368620503, 0.12568915769567385, 0.34667876264189973, -0.4629209000690311, -0.1671399348871965, 0.07586068753153086, -0.009240027699692576, 0.04742756399255264, -0.023212231634020367, -0.2816203572586471, 0.01873777593102525, -0.2821432937338364, -0.12973618868729284, -0.1163975374086066, 0.03958892153904719, 0.04378488516508072, -0.31321587362417985, 0.040927918392744865, -0.01775107348301247, 0.08490848844396133, -0.045387556310743093, -0.10518217079487502, 0.002004342372803127, 0.14542964890635773, 0.14511994928961583, -0.11497574190919597, 0.13510204915541643, -0.1607373670090501, -0.2652038642223559, 0.36837149323786006, -0.09699759192253445, -0.15092073640256537, 0.09220798310421992, -0.06423289513251945, -0.13306117054148048, 0.019449921571375692, 0.23251828023542961, 0.057896332943118085, -0.10915906690791541, 0.08710675006138854, -0.06265710223484419, 0.1859955693248148, 0.008008370194218907, -0.03418103879427209, 0.15961411348589713, 0.17511772579860455, 0.08188090628633897, 0.1352987873730907, -0.10784065604264684, -0.2171214407711637, -0.29237129436988457, -0.181613586057781, -0.1483969953363104, 0.04089470657830437, -0.16306170843046286, -0.21181590226935407, 0.4457368051961941, 0.20218930372457003, 0.11691766613911764, 0.14693378861628326, 0.2703449826906709, 0.14092668008935802, -0.06538926528803274, 0.10206281765382372, 0.10070794224099931, 0.045895278563394266, 0.1720990897704135, -0.1507057606553038, 0.09647769054544031, 0.09098329347576581]
|
1,803.07905
|
Importance of Amplifier Physics in Maximizing the Capacity of Submarine
Links
|
The throughput of submarine transport cables is approaching fundamental
limits imposed by amplifier noise and Kerr nonlinearity. Energy constraints in
ultra-long submarine links exacerbate this problem, as the throughput per fiber
is further limited by the electrical power available to the undersea optical
amplifiers. Recent works have studied how employing more spatial dimensions can
mitigate these limitations. In this paper, we address the fundamental question
of how to optimally use each spatial dimension. Specifically, we discuss how to
optimize the channel power allocation in order to maximize the
information-theoretic capacity under an electrical power constraint. Our
formulation accounts for amplifier physics, Kerr nonlinearity, and power feed
constraints. Whereas recent works assume the optical amplifiers operate in deep
saturation, where power-conversion efficiency (PCE) is high, we show that given
a power constraint, operating in a less saturated regime, where PCE is lower,
supports a wider bandwidth and a larger number of spatial dimensions, thereby
maximizing capacity. This design strategy increases the capacity of submarine
links by about 70% compared to the theoretical capacity of a recently proposed
high-capacity system.
|
physics.app-ph eess.SP physics.optics
|
the throughput of submarine transport cables is approaching fundamental limits imposed by amplifier noise and kerr nonlinearity energy constraints in ultralong submarine links exacerbate this problem as the throughput per fiber is further limited by the electrical power available to the undersea optical amplifiers recent works have studied how employing more spatial dimensions can mitigate these limitations in this paper we address the fundamental question of how to optimally use each spatial dimension specifically we discuss how to optimize the channel power allocation in order to maximize the informationtheoretic capacity under an electrical power constraint our formulation accounts for amplifier physics kerr nonlinearity and power feed constraints whereas recent works assume the optical amplifiers operate in deep saturation where powerconversion efficiency pce is high we show that given a power constraint operating in a less saturated regime where pce is lower supports a wider bandwidth and a larger number of spatial dimensions thereby maximizing capacity this design strategy increases the capacity of submarine links by about 70 compared to the theoretical capacity of a recently proposed highcapacity system
|
[['the', 'throughput', 'of', 'submarine', 'transport', 'cables', 'is', 'approaching', 'fundamental', 'limits', 'imposed', 'by', 'amplifier', 'noise', 'and', 'kerr', 'nonlinearity', 'energy', 'constraints', 'in', 'ultralong', 'submarine', 'links', 'exacerbate', 'this', 'problem', 'as', 'the', 'throughput', 'per', 'fiber', 'is', 'further', 'limited', 'by', 'the', 'electrical', 'power', 'available', 'to', 'the', 'undersea', 'optical', 'amplifiers', 'recent', 'works', 'have', 'studied', 'how', 'employing', 'more', 'spatial', 'dimensions', 'can', 'mitigate', 'these', 'limitations', 'in', 'this', 'paper', 'we', 'address', 'the', 'fundamental', 'question', 'of', 'how', 'to', 'optimally', 'use', 'each', 'spatial', 'dimension', 'specifically', 'we', 'discuss', 'how', 'to', 'optimize', 'the', 'channel', 'power', 'allocation', 'in', 'order', 'to', 'maximize', 'the', 'informationtheoretic', 'capacity', 'under', 'an', 'electrical', 'power', 'constraint', 'our', 'formulation', 'accounts', 'for', 'amplifier', 'physics', 'kerr', 'nonlinearity', 'and', 'power', 'feed', 'constraints', 'whereas', 'recent', 'works', 'assume', 'the', 'optical', 'amplifiers', 'operate', 'in', 'deep', 'saturation', 'where', 'powerconversion', 'efficiency', 'pce', 'is', 'high', 'we', 'show', 'that', 'given', 'a', 'power', 'constraint', 'operating', 'in', 'a', 'less', 'saturated', 'regime', 'where', 'pce', 'is', 'lower', 'supports', 'a', 'wider', 'bandwidth', 'and', 'a', 'larger', 'number', 'of', 'spatial', 'dimensions', 'thereby', 'maximizing', 'capacity', 'this', 'design', 'strategy', 'increases', 'the', 'capacity', 'of', 'submarine', 'links', 'by', 'about', '70', 'compared', 'to', 'the', 'theoretical', 'capacity', 'of', 'a', 'recently', 'proposed', 'highcapacity', 'system']]
|
[-0.1686999134299492, 0.0744308864998172, 0.009475523148129663, -0.009653056887360394, -0.1112422927222581, -0.19764156509033834, 0.11221286501497386, 0.35803202639093223, -0.2703461716150384, -0.2932170736786564, 0.11523420364907262, -0.26718246662371864, -0.14495897277917588, 0.21971682087633382, -0.1427530882791145, 0.09693794107303975, -0.008693510191672053, -0.0018998433723313253, -0.008356873350207475, -0.253312690944798, 0.2573845045329752, 0.1558220231958882, 0.3794448820800845, 0.07453568516334445, 0.11635365054335738, -0.01704828867301596, 0.013549293072245429, 0.00722787725141408, -0.1386202081714268, 0.12511240775903604, 0.2843938528735379, 0.11105600851417906, 0.2998031976507202, -0.438483121454339, -0.29694295680317817, 0.09603808482512413, 0.1230375598153862, 0.04593039432728893, -0.009961281931946666, -0.1798855113911997, 0.08589245277990619, -0.20151803670503365, -0.07971822262448625, -0.04948436910825457, -0.03515284265956601, 0.056825449593438195, -0.27687809776431055, 0.0280855427067099, 0.06123467583962706, 0.028840472900800492, -0.004130329504436447, -0.07801278360028427, 0.01880416239669358, 0.12006648991903122, -0.004402380398725777, -0.03343627931487359, 0.1321634959512563, -0.16434016531422274, -0.09819429089757352, 0.3434201458591989, -0.044882801905525536, -0.18547524770805507, 0.12784105278008742, -0.13154836995474828, -0.07778640190911809, 0.1400867285098347, 0.2243385340340221, 0.04908262236106597, -0.15916108486786737, 0.037978720431689574, -0.0004900409212189444, 0.22423751014180146, 0.12997324854067496, 0.12438878015970832, 0.17742374880773046, 0.24238767354027108, 0.10711916158985597, 0.17440190056229032, -0.1026428123057056, -0.060193094090045834, -0.21334047824290864, -0.09744903636609696, -0.18467761954721693, 0.07253301098649756, -0.0865566878985212, -0.01598599312429348, 0.35589960943175, 0.1772003042998232, 0.15081330483747918, 0.06894508479267694, 0.4080921895802021, 0.1532986350763024, 0.06633064447996322, 0.10806658894629374, 0.27887727790564465, 0.12597540252170986, 0.1573501937876173, -0.22485532966217422, 0.010687338472134695, -0.03539802377593568]
|
1,803.07906
|
Daytime passive radiative cooler using porous alumina
|
We report a daytime passive radiative cooler using chemically fabricated
porous anodic aluminum oxide (AAO) membranes. Effective medium theory (EMT) has
been applied to analyzing the optical properties of the air-doped porous
medium. The composite structure is specifically optimized so that it has a high
absorbance (emittance) in the far-infrared atmospheric window and nearly no
loss in the solar spectrum. The calculated emittance is well reproduced in the
experiment by our AAO sample. The fabricated porous membrane shows a potential
cooling power density of 64 W/m2 at ambient (humidity = 75%) under direct
sunlight irradiance (AM1.5). Experimentally, the sample is cooled by a 2.6C
temperature reduction below the ambient air temperature in the sunlight. This
performance shows little variance at night. The AAO approach proposed here may
provide a promising way to produce low-cost and efficient radiative cooler in
large scales for feasible energy conservation.
|
physics.app-ph physics.optics
|
we report a daytime passive radiative cooler using chemically fabricated porous anodic aluminum oxide aao membranes effective medium theory emt has been applied to analyzing the optical properties of the airdoped porous medium the composite structure is specifically optimized so that it has a high absorbance emittance in the farinfrared atmospheric window and nearly no loss in the solar spectrum the calculated emittance is well reproduced in the experiment by our aao sample the fabricated porous membrane shows a potential cooling power density of 64 wm2 at ambient humidity 75 under direct sunlight irradiance am15 experimentally the sample is cooled by a 26c temperature reduction below the ambient air temperature in the sunlight this performance shows little variance at night the aao approach proposed here may provide a promising way to produce lowcost and efficient radiative cooler in large scales for feasible energy conservation
|
[['we', 'report', 'a', 'daytime', 'passive', 'radiative', 'cooler', 'using', 'chemically', 'fabricated', 'porous', 'anodic', 'aluminum', 'oxide', 'aao', 'membranes', 'effective', 'medium', 'theory', 'emt', 'has', 'been', 'applied', 'to', 'analyzing', 'the', 'optical', 'properties', 'of', 'the', 'airdoped', 'porous', 'medium', 'the', 'composite', 'structure', 'is', 'specifically', 'optimized', 'so', 'that', 'it', 'has', 'a', 'high', 'absorbance', 'emittance', 'in', 'the', 'farinfrared', 'atmospheric', 'window', 'and', 'nearly', 'no', 'loss', 'in', 'the', 'solar', 'spectrum', 'the', 'calculated', 'emittance', 'is', 'well', 'reproduced', 'in', 'the', 'experiment', 'by', 'our', 'aao', 'sample', 'the', 'fabricated', 'porous', 'membrane', 'shows', 'a', 'potential', 'cooling', 'power', 'density', 'of', '64', 'wm2', 'at', 'ambient', 'humidity', '75', 'under', 'direct', 'sunlight', 'irradiance', 'am15', 'experimentally', 'the', 'sample', 'is', 'cooled', 'by', 'a', '26c', 'temperature', 'reduction', 'below', 'the', 'ambient', 'air', 'temperature', 'in', 'the', 'sunlight', 'this', 'performance', 'shows', 'little', 'variance', 'at', 'night', 'the', 'aao', 'approach', 'proposed', 'here', 'may', 'provide', 'a', 'promising', 'way', 'to', 'produce', 'lowcost', 'and', 'efficient', 'radiative', 'cooler', 'in', 'large', 'scales', 'for', 'feasible', 'energy', 'conservation']]
|
[-0.059662864737251735, 0.18986509265899137, -0.0601258281096523, 0.014686909959719914, -0.0009891650659012627, -0.11552097872420625, 0.03666583711926181, 0.4631039542048336, -0.19794008277122166, -0.34103273328432776, 0.06684702432509251, -0.284888265211578, -0.0728291932858162, 0.2258151640685705, -0.05958880084058778, 0.07286972425865022, 0.02363829224344369, -0.10366748122745063, -0.014312621490977756, -0.18594152653440052, 0.17301469126234312, 0.16969113947556622, 0.3321931571960189, 0.08892042799551574, 0.11001926001773535, -0.09628968782905307, 0.010768607594203073, 0.018490051145264814, -0.1364215130405765, 0.03787150015155752, 0.2476304960192891, 0.0032105213405655606, 0.2234541318636596, -0.4430744603297216, -0.2928721426523753, 0.02471603142175745, 0.09322135646703776, 0.05122288419715278, -0.1328081780298893, -0.1642257866247759, 0.057105535722721916, -0.14329009127340742, -0.1435914879267501, -0.007412338222318388, -0.01500624619502496, -0.046766704244708475, -0.2471175091296363, 0.053331611514168015, -0.026286027559496047, 0.11504636795774519, -0.09506019185723776, -0.16032404627103905, -0.08906829550250114, 0.053206526527793466, -0.02899249436144906, 0.0007085214544843126, 0.2901717502089751, -0.056884277628252766, 0.03673980462648157, 0.3702670475533167, -0.11666103208541766, -0.0648181149345282, 0.16754005706732297, -0.16615773032832942, -0.013696446337483147, 0.24345283615370314, 0.16235933641470005, 0.09588885352901229, -0.22494854534515407, 0.0283309450508193, -0.024016379063681967, 0.21715076747545778, 0.11429605643440793, 0.0455331517223894, 0.2196633595097289, 0.2524059651829823, 0.04765786183021077, 0.15640741320965174, -0.15129864148443917, 0.01559849156691999, -0.18767934622506813, -0.17877493396570737, -0.15754696752849992, 0.090316019906708, -0.09074694642974585, -0.15216770433003435, 0.3692302586237242, 0.1269103593003311, 0.12247638566862348, -0.012598665076197236, 0.37517062588953054, 0.05502991816045234, 0.1122279162534962, 0.06546105052038402, 0.31405654460374083, 0.1613613512575418, 0.21785482500803532, -0.25797105755720456, 0.05597857700113754, -0.013121879167066744]
|
1,803.07907
|
Fabrication and Characterization of a Mode-selective 45-Mode Spatial
Multiplexer based on Multi-Plane Light Conversion
|
Space Division Multiplexing (SMD) is a very attractive technique for
addressing the ever-growing demands in transmission capacity by enabling the
use of a new parameter \textemdash\ space \textemdash\ to increase the number
of channels in multi-mode fibers. One key component to build a spatially
multiplexed-based optical network is a spatial multiplexer and demultiplexer
combining signals from multiple single-mode fibers into as many channels in a
multi-mode fiber. In this article, we report the fabrication and
characterization of a pair of 45-mode spatial multiplexer and demultiplexer
saturating all the modes of a standard 50~$\mu$m core graded-index (OM2)
multi-mode fiber. The multiplexers are based on Multi-Plane Light Conversion
(MPLC), a technique that enables the control of the transverse shape of the
light by multiple reflections on specifically designed phase plates. We show
that by using a separable variable basis of modes, such as Hermite-Gaussian
(HG) modes, we are able to drastically reduce the number of reflections hence
reducing the insertion losses and modal crosstalks. The multiplexers typically
show an average 4~dB insertion loss and -28~dB cross-talk across the C band.
Finally, we emphasize the use of this higher-order modes multiplexer to explore
the propagation properties inside multi-mode fibers and more specifically the
mode group crosstalks as well as the impact of fiber bending.
|
physics.app-ph
|
space division multiplexing smd is a very attractive technique for addressing the evergrowing demands in transmission capacity by enabling the use of a new parameter textemdash space textemdash to increase the number of channels in multimode fibers one key component to build a spatially multiplexedbased optical network is a spatial multiplexer and demultiplexer combining signals from multiple singlemode fibers into as many channels in a multimode fiber in this article we report the fabrication and characterization of a pair of 45mode spatial multiplexer and demultiplexer saturating all the modes of a standard 50mum core gradedindex om2 multimode fiber the multiplexers are based on multiplane light conversion mplc a technique that enables the control of the transverse shape of the light by multiple reflections on specifically designed phase plates we show that by using a separable variable basis of modes such as hermitegaussian hg modes we are able to drastically reduce the number of reflections hence reducing the insertion losses and modal crosstalks the multiplexers typically show an average 4db insertion loss and 28db crosstalk across the c band finally we emphasize the use of this higherorder modes multiplexer to explore the propagation properties inside multimode fibers and more specifically the mode group crosstalks as well as the impact of fiber bending
|
[['space', 'division', 'multiplexing', 'smd', 'is', 'a', 'very', 'attractive', 'technique', 'for', 'addressing', 'the', 'evergrowing', 'demands', 'in', 'transmission', 'capacity', 'by', 'enabling', 'the', 'use', 'of', 'a', 'new', 'parameter', 'textemdash', 'space', 'textemdash', 'to', 'increase', 'the', 'number', 'of', 'channels', 'in', 'multimode', 'fibers', 'one', 'key', 'component', 'to', 'build', 'a', 'spatially', 'multiplexedbased', 'optical', 'network', 'is', 'a', 'spatial', 'multiplexer', 'and', 'demultiplexer', 'combining', 'signals', 'from', 'multiple', 'singlemode', 'fibers', 'into', 'as', 'many', 'channels', 'in', 'a', 'multimode', 'fiber', 'in', 'this', 'article', 'we', 'report', 'the', 'fabrication', 'and', 'characterization', 'of', 'a', 'pair', 'of', '45mode', 'spatial', 'multiplexer', 'and', 'demultiplexer', 'saturating', 'all', 'the', 'modes', 'of', 'a', 'standard', '50mum', 'core', 'gradedindex', 'om2', 'multimode', 'fiber', 'the', 'multiplexers', 'are', 'based', 'on', 'multiplane', 'light', 'conversion', 'mplc', 'a', 'technique', 'that', 'enables', 'the', 'control', 'of', 'the', 'transverse', 'shape', 'of', 'the', 'light', 'by', 'multiple', 'reflections', 'on', 'specifically', 'designed', 'phase', 'plates', 'we', 'show', 'that', 'by', 'using', 'a', 'separable', 'variable', 'basis', 'of', 'modes', 'such', 'as', 'hermitegaussian', 'hg', 'modes', 'we', 'are', 'able', 'to', 'drastically', 'reduce', 'the', 'number', 'of', 'reflections', 'hence', 'reducing', 'the', 'insertion', 'losses', 'and', 'modal', 'crosstalks', 'the', 'multiplexers', 'typically', 'show', 'an', 'average', '4db', 'insertion', 'loss', 'and', '28db', 'crosstalk', 'across', 'the', 'c', 'band', 'finally', 'we', 'emphasize', 'the', 'use', 'of', 'this', 'higherorder', 'modes', 'multiplexer', 'to', 'explore', 'the', 'propagation', 'properties', 'inside', 'multimode', 'fibers', 'and', 'more', 'specifically', 'the', 'mode', 'group', 'crosstalks', 'as', 'well', 'as', 'the', 'impact', 'of', 'fiber', 'bending']]
|
[-0.16718516124316152, 0.14694383593961483, -0.061673214422906034, -0.028994852985936, -0.06889022309937551, -0.15889541796059348, 0.0685524042077864, 0.4341945393064704, -0.25557511317814574, -0.25098604862040913, 0.0863338122883131, -0.2362535563275182, -0.1514476578182579, 0.23071273414937493, -0.06281374286425909, 0.07400650837595234, 0.05233711985895822, -0.039075120036543995, -0.021180446369936153, -0.1678768387517686, 0.2964121633021233, 0.0400065882556821, 0.35076195048616055, 0.00495139625407039, 0.11371570633939253, 0.08146604131056498, -0.031014106749073386, -0.0384103609772305, -0.07740281048588188, 0.1346647749395253, 0.22735818513879516, 0.08384403228186645, 0.2590990646892281, -0.4169368313126212, -0.24217180791758716, 0.0809862843710177, 0.15802452877575818, 0.10352012995169318, -0.011276413687483, -0.24258856040922602, 0.05055746789618682, -0.15287461547730066, -0.09962003403332066, -0.041530450248571396, -0.03814955555236128, 0.047477501239112686, -0.258512893158835, -0.019933226202668335, 0.04437436468400007, 0.037176631776114494, 0.015518627353370763, -0.06192677766599585, -0.018574282648982123, 0.09019887802871661, -0.06142645310207557, -0.027314405319674943, 0.12326193678353985, -0.11467282242217781, -0.09865685991266779, 0.3637921417046947, -0.09653758616640026, -0.18493533368186596, 0.1451250994410097, -0.10992849985730292, -0.022154118618065974, 0.15606644884190665, 0.21316730673201023, 0.06490362517153979, -0.11186377756306544, 0.0034911891276491447, 0.03002804382525098, 0.22340679393920043, 0.14503691166352767, 0.1566461543110423, 0.18278118764730886, 0.20179490864869037, 0.043303875682445675, 0.17803631048389854, -0.1489092977655953, -0.01436261477199598, -0.2836292091314345, -0.19928860546161348, -0.1540863459106801, -0.01134836999923349, -0.08892418312699682, -0.14745694571711981, 0.40923741190748003, 0.07324465204762348, 0.17471121226788874, 0.047900922606389104, 0.3394347932637454, 0.06998295130226605, 0.13601847439041684, 0.024334230482614096, 0.25674645619493763, 0.16123438433882817, 0.07497402755521201, -0.24312777444496392, -0.0478931622458801, -0.02252176815650623]
|
1,803.07908
|
Passive advection of a vector field: effects of strong compressibility
|
The field theoretic renormalization group and the operator product expansion
are applied to the stochastic model of a passively advected vector field. The
advecting velocity field is generated by the stochastic Navier-Stokes equation
with compressibility taken into account. The model is considered in the
vicinity of space dimension $d=4$ and the perturbation theory is constructed
within a double expansion scheme in $y$ and $\epsilon=4-d$, where $y$ describes
scaling behaviour of the random force that enters a stochastic equation for the
velocity field. We show that the correlation functions of the passive vector
field in the inertial range exhibit anomalous scaling behaviour. The critical
dimensions of tensor composite operators of passive vector field are calculated
in the leading order of $y$,$\epsilon$ expansion.
|
cond-mat.stat-mech
|
the field theoretic renormalization group and the operator product expansion are applied to the stochastic model of a passively advected vector field the advecting velocity field is generated by the stochastic navierstokes equation with compressibility taken into account the model is considered in the vicinity of space dimension d4 and the perturbation theory is constructed within a double expansion scheme in y and epsilon4d where y describes scaling behaviour of the random force that enters a stochastic equation for the velocity field we show that the correlation functions of the passive vector field in the inertial range exhibit anomalous scaling behaviour the critical dimensions of tensor composite operators of passive vector field are calculated in the leading order of yepsilon expansion
|
[['the', 'field', 'theoretic', 'renormalization', 'group', 'and', 'the', 'operator', 'product', 'expansion', 'are', 'applied', 'to', 'the', 'stochastic', 'model', 'of', 'a', 'passively', 'advected', 'vector', 'field', 'the', 'advecting', 'velocity', 'field', 'is', 'generated', 'by', 'the', 'stochastic', 'navierstokes', 'equation', 'with', 'compressibility', 'taken', 'into', 'account', 'the', 'model', 'is', 'considered', 'in', 'the', 'vicinity', 'of', 'space', 'dimension', 'd4', 'and', 'the', 'perturbation', 'theory', 'is', 'constructed', 'within', 'a', 'double', 'expansion', 'scheme', 'in', 'y', 'and', 'epsilon4d', 'where', 'y', 'describes', 'scaling', 'behaviour', 'of', 'the', 'random', 'force', 'that', 'enters', 'a', 'stochastic', 'equation', 'for', 'the', 'velocity', 'field', 'we', 'show', 'that', 'the', 'correlation', 'functions', 'of', 'the', 'passive', 'vector', 'field', 'in', 'the', 'inertial', 'range', 'exhibit', 'anomalous', 'scaling', 'behaviour', 'the', 'critical', 'dimensions', 'of', 'tensor', 'composite', 'operators', 'of', 'passive', 'vector', 'field', 'are', 'calculated', 'in', 'the', 'leading', 'order', 'of', 'yepsilon', 'expansion']]
|
[-0.1874646142551986, 0.1858820085413754, -0.10306448613021833, 0.03148696441106343, -0.03346797428287876, -0.09933294008563583, -0.047669445037414944, 0.3008186377468519, -0.2841720095447575, -0.21939195385202764, 0.05186867385637015, -0.26376522039063277, -0.13958022046911842, 0.14237174836065, 0.0376097703333168, 0.024848508792153248, -0.04700056406048437, 0.09340110794485858, -0.04883312659415727, -0.21112455152130374, 0.3632010999911775, -0.01795548345738401, 0.2891916434513405, -0.03300270832454165, 0.1452202779163296, 0.026914103756037852, -0.035031143381881215, 0.08422325393160766, -0.10842371219441702, 0.05772383892714667, 0.1745169349538628, 0.026461362852326906, 0.25136734276311473, -0.4022393272413562, -0.254578845272772, 0.06545606504272049, 0.17393288154392697, 0.0756604342837818, -0.04229376328488191, -0.2746502127731219, 0.058974001242313535, -0.1632970884985601, -0.18678496758220717, -0.08914523172813157, 0.01504659181033882, 0.02815718968777219, -0.31656635584464915, 0.1291926927360085, 0.022601025722300012, 0.05705276793451049, -0.10427667165640742, -0.07199789865796144, -0.030222395384528984, 0.10803796223190147, 0.0775213330751285, 0.08615182735569155, 0.1651915165731528, -0.167761349658637, -0.053968117253680246, 0.36986175599740817, -0.14426997167853794, -0.21997489092561107, 0.10074870131987458, -0.19761140627088025, -0.06252167441416531, 0.13625840217185517, 0.17991668034422523, 0.08749555773865722, -0.13128811138837287, 0.16905275821385052, -0.01944245368455692, 0.12095408083987422, 0.0030990658036898822, -0.012850242309893171, 0.13610969798173755, 0.11188368166525227, 0.020129701922026774, 0.10974600070621818, -0.055604089113573237, -0.16551715407986195, -0.35354347579802076, -0.16061319330862414, -0.15602331915094206, 0.0519836155930534, -0.17379819203209385, -0.19491233627389495, 0.3696222199777973, 0.1408026930798466, 0.18210423723066924, 0.026536205756322793, 0.2720290436875075, 0.19770569790465137, 0.07476652826881036, 0.09682579362221683, 0.245695753612866, 0.22760763536401404, 0.12809018985523532, -0.22765434054357078, -0.005219838422878335, 0.17176115727828195]
|
1,803.07909
|
Newton's Second Law and the Concept of Relativistic Mass
|
In this work we discuss different interpretations of mass in the relativistic
dynamics. A new way to introduce mass is proposed. Our way is based on the
relativistic equation of motion expressed in the form of the Newton$'$s second
law. In this approach mass appears as a tensor, not as a scalar. The tensor
mass allows us simply to describe anisotropic character of inert features of a
relativistic object.
|
physics.class-ph physics.pop-ph
|
in this work we discuss different interpretations of mass in the relativistic dynamics a new way to introduce mass is proposed our way is based on the relativistic equation of motion expressed in the form of the newtons second law in this approach mass appears as a tensor not as a scalar the tensor mass allows us simply to describe anisotropic character of inert features of a relativistic object
|
[['in', 'this', 'work', 'we', 'discuss', 'different', 'interpretations', 'of', 'mass', 'in', 'the', 'relativistic', 'dynamics', 'a', 'new', 'way', 'to', 'introduce', 'mass', 'is', 'proposed', 'our', 'way', 'is', 'based', 'on', 'the', 'relativistic', 'equation', 'of', 'motion', 'expressed', 'in', 'the', 'form', 'of', 'the', 'newtons', 'second', 'law', 'in', 'this', 'approach', 'mass', 'appears', 'as', 'a', 'tensor', 'not', 'as', 'a', 'scalar', 'the', 'tensor', 'mass', 'allows', 'us', 'simply', 'to', 'describe', 'anisotropic', 'character', 'of', 'inert', 'features', 'of', 'a', 'relativistic', 'object']]
|
[-0.11305386016982188, 0.10486891116622997, -0.1570411300205666, 0.05588429312025993, -0.1357028295920379, -0.0877483166160359, -0.04084917380595985, 0.3072071598194864, -0.24296833309547408, -0.3081669319367063, -0.0026326789318219476, -0.19333240280853267, -0.13037435294709343, 0.1695453602604676, -0.058318314614935196, 0.011677712445025858, 0.005601192240778735, 0.07714532908268165, -0.08625635497973881, -0.1640691457660464, 0.3744955907990832, 0.041798434503700424, 0.20859180083093437, 0.054036770771810974, 0.11292269361623819, -0.016668831598877474, -0.019130254744727543, 0.02360716822516659, -0.09518496250814718, 0.14345274033510816, 0.17822150622858948, 0.08913526402624405, 0.25889547143563413, -0.3767876878812693, -0.19675276413613904, 0.05009907548167351, 0.12959913311499185, 0.142650960529547, -0.07720426113203006, -0.254279047130958, 0.027305423376568848, -0.2460374286317307, -0.1992000935740931, -0.09229987810397068, 0.0012260835509801257, -0.035058229702754296, -0.2517557398389107, 0.1490447349421194, 0.06948538551080054, -0.060320538998432996, -0.09484418175281092, -0.07724706205687877, 0.024692780091899676, 0.07179508931543407, 0.07996971135203174, 0.009724087628495434, 0.1412628658750243, -0.1523605152370705, -0.09430435984361701, 0.480060621664144, -0.11877561503670354, -0.23923881589502527, 0.16220070804010375, -0.14365806525060232, -0.14886810756086008, 0.07355837434854197, 0.2190747343921575, 0.1720913076775184, -0.20232444229549257, 0.08484229364472887, -0.06764868217641892, 0.1436991905996009, 0.023770588608728587, -0.0011775507389203362, 0.23763673929868778, 0.1581419801366502, 0.0049759158527181635, 0.1298743156662238, -0.0729995787622866, -0.09290287051133919, -0.3354505859045447, -0.224103261311741, -0.1845940202170902, 0.07527225367759482, -0.07489404471024223, -0.16443724734573692, 0.42543582640844735, 0.16899040199654258, 0.23764626182568516, 0.03305346483661645, 0.3037776699073721, 0.12144734999806067, 0.0922188705670229, 0.05359020769812059, 0.26913506364908774, 0.16319024307734292, 0.10919011985559178, -0.22189513534903055, 0.007846629962433075, 0.12154655813819905]
|
1,803.0791
|
Energy transfer mechanisms in a dipole chain: From energy equipartition
to the formation of breathers
|
We study the energy transfer in a classical dipole chain of $N$ interacting
rigid rotating dipoles. The underlying high--dimensional potential energy
landscape is analyzed in particular by determining the equilibrium points and
their stability in the common plane of rotation. Starting from the minimal
energy configuration, the response of the chain to excitation of a single
dipole is investigated. Using both the linearized and the exact Hamiltonian of
the dipole chain, we detect an approximate excitation energy threshold between
a weakly and a strongly nonlinear dynamics. In the weakly nonlinear regime, the
chain approaches in the course of time the expected energy equipartition among
the dipoles. For excitations of higher energy, strongly localized excitations
appear whose trajectories in time are either periodic or irregular, relating to
the well-known discrete or chaotic breathers, respectively. The phenomenon of
spontaneous formation of domains of opposite polarization and phase locking is
found to commonly accompany the time evolution of the chaotic breathers.
Finally, the sensitivity of the dipole chain dynamics to the initial conditions
is studied as a function of the initial excitation energy by computing a fast
chaos indicator. The results of this study confirm the aforementioned
approximate threshold value for the initial excitation energy, below which the
dynamics of the dipole chain is regular and above which it is chaotic.
|
nlin.CD physics.atm-clus
|
we study the energy transfer in a classical dipole chain of n interacting rigid rotating dipoles the underlying highdimensional potential energy landscape is analyzed in particular by determining the equilibrium points and their stability in the common plane of rotation starting from the minimal energy configuration the response of the chain to excitation of a single dipole is investigated using both the linearized and the exact hamiltonian of the dipole chain we detect an approximate excitation energy threshold between a weakly and a strongly nonlinear dynamics in the weakly nonlinear regime the chain approaches in the course of time the expected energy equipartition among the dipoles for excitations of higher energy strongly localized excitations appear whose trajectories in time are either periodic or irregular relating to the wellknown discrete or chaotic breathers respectively the phenomenon of spontaneous formation of domains of opposite polarization and phase locking is found to commonly accompany the time evolution of the chaotic breathers finally the sensitivity of the dipole chain dynamics to the initial conditions is studied as a function of the initial excitation energy by computing a fast chaos indicator the results of this study confirm the aforementioned approximate threshold value for the initial excitation energy below which the dynamics of the dipole chain is regular and above which it is chaotic
|
[['we', 'study', 'the', 'energy', 'transfer', 'in', 'a', 'classical', 'dipole', 'chain', 'of', 'n', 'interacting', 'rigid', 'rotating', 'dipoles', 'the', 'underlying', 'highdimensional', 'potential', 'energy', 'landscape', 'is', 'analyzed', 'in', 'particular', 'by', 'determining', 'the', 'equilibrium', 'points', 'and', 'their', 'stability', 'in', 'the', 'common', 'plane', 'of', 'rotation', 'starting', 'from', 'the', 'minimal', 'energy', 'configuration', 'the', 'response', 'of', 'the', 'chain', 'to', 'excitation', 'of', 'a', 'single', 'dipole', 'is', 'investigated', 'using', 'both', 'the', 'linearized', 'and', 'the', 'exact', 'hamiltonian', 'of', 'the', 'dipole', 'chain', 'we', 'detect', 'an', 'approximate', 'excitation', 'energy', 'threshold', 'between', 'a', 'weakly', 'and', 'a', 'strongly', 'nonlinear', 'dynamics', 'in', 'the', 'weakly', 'nonlinear', 'regime', 'the', 'chain', 'approaches', 'in', 'the', 'course', 'of', 'time', 'the', 'expected', 'energy', 'equipartition', 'among', 'the', 'dipoles', 'for', 'excitations', 'of', 'higher', 'energy', 'strongly', 'localized', 'excitations', 'appear', 'whose', 'trajectories', 'in', 'time', 'are', 'either', 'periodic', 'or', 'irregular', 'relating', 'to', 'the', 'wellknown', 'discrete', 'or', 'chaotic', 'breathers', 'respectively', 'the', 'phenomenon', 'of', 'spontaneous', 'formation', 'of', 'domains', 'of', 'opposite', 'polarization', 'and', 'phase', 'locking', 'is', 'found', 'to', 'commonly', 'accompany', 'the', 'time', 'evolution', 'of', 'the', 'chaotic', 'breathers', 'finally', 'the', 'sensitivity', 'of', 'the', 'dipole', 'chain', 'dynamics', 'to', 'the', 'initial', 'conditions', 'is', 'studied', 'as', 'a', 'function', 'of', 'the', 'initial', 'excitation', 'energy', 'by', 'computing', 'a', 'fast', 'chaos', 'indicator', 'the', 'results', 'of', 'this', 'study', 'confirm', 'the', 'aforementioned', 'approximate', 'threshold', 'value', 'for', 'the', 'initial', 'excitation', 'energy', 'below', 'which', 'the', 'dynamics', 'of', 'the', 'dipole', 'chain', 'is', 'regular', 'and', 'above', 'which', 'it', 'is', 'chaotic']]
|
[-0.1865142553473594, 0.17785338135154485, -0.06608297490437917, 0.10193572963701152, -0.002133598383473352, -0.08576630946214593, 0.026990590089720615, 0.3494839535774065, -0.28084186153751245, -0.27080008703061814, 0.09020980725165269, -0.248089568986378, -0.10118156748101834, 0.15026642204211052, 0.05547754248762247, 0.035671279101350574, 0.0371104769165292, 0.07832265166627722, -0.03938449447154315, -0.14468400617644891, 0.29813442112655814, 0.08356002327698227, 0.29735452674517254, 0.021361259079256324, 0.06667886211412934, 0.007598013200566446, 0.05444279789856268, -0.015377984386484285, -0.13997420496649082, 0.0953294480381824, 0.19661592649041734, 0.031022683061539717, 0.23156192046461985, -0.4308355107151587, -0.19108706327804595, 0.1265814183066266, 0.13856556069815035, 0.14816832289830226, -0.026060615135399506, -0.2622327018665885, 0.028019229439300818, -0.10540211092843034, -0.19747575352805743, -0.04596051050204818, 0.03283495484603518, 0.10453985390945449, -0.2578258000638917, 0.11022845937639748, 0.09607510442777169, 0.04461112194865464, -0.08346838991845522, -0.049775896068457344, -0.0880854562364963, 0.08037736943982747, 0.04568467350621118, 0.016027093903426458, 0.13965050513437444, -0.13880097317090684, -0.09772498905872327, 0.3604028998498181, -0.06699603565978185, -0.18081531730509062, 0.20189967089964914, -0.15712026121530578, -0.0734991350172754, 0.1891787869240576, 0.15161875285338525, 0.1353907751372306, -0.13844064950442087, 0.07405918669206552, 0.0021795481229799057, 0.16591550728066937, 0.05986933809397486, 0.028853333608563476, 0.23397728365658005, 0.1629434922707925, 0.0702410927704544, 0.16430656156831616, -0.09299657223457812, -0.17676642509775425, -0.2817176772434256, -0.09873529884017952, -0.21144126727963464, 0.04472930189179376, -0.05693518980629176, -0.197030917346187, 0.4464956183507697, 0.08951630195019997, 0.18586327572387362, 0.010056729022618553, 0.2707556278355112, 0.17228435326331304, 0.0023795408175386694, 0.05744598254587057, 0.2756935395118823, 0.13246457031372627, 0.0864299437278933, -0.3017389391486986, 0.00765156559939838, 0.04404981974768666]
|
1,803.07911
|
Spin field-effect transistor action via tunable polarization of the spin
injection in a Co/MgO/graphene contact
|
We fabricated a non-local spin valve device with Co-MgO injector/detector
tunnel contacts on a graphene spin channel. In this device, the spin
polarization of the injector contact can be tuned by both the injector current
bias and the gate voltage. The spin polarization can be turned off and even
inverted. This behavior enables a spin transistor where the signal is switched
off by turning off the spin injection using the field-effect. We propose a
model based on a gate-dependent shift of the minimum in the graphene density of
states with respect to the tunneling density of states of cobalt, which can
explain the observed bias and gate dependence.
|
cond-mat.mes-hall
|
we fabricated a nonlocal spin valve device with comgo injectordetector tunnel contacts on a graphene spin channel in this device the spin polarization of the injector contact can be tuned by both the injector current bias and the gate voltage the spin polarization can be turned off and even inverted this behavior enables a spin transistor where the signal is switched off by turning off the spin injection using the fieldeffect we propose a model based on a gatedependent shift of the minimum in the graphene density of states with respect to the tunneling density of states of cobalt which can explain the observed bias and gate dependence
|
[['we', 'fabricated', 'a', 'nonlocal', 'spin', 'valve', 'device', 'with', 'comgo', 'injectordetector', 'tunnel', 'contacts', 'on', 'a', 'graphene', 'spin', 'channel', 'in', 'this', 'device', 'the', 'spin', 'polarization', 'of', 'the', 'injector', 'contact', 'can', 'be', 'tuned', 'by', 'both', 'the', 'injector', 'current', 'bias', 'and', 'the', 'gate', 'voltage', 'the', 'spin', 'polarization', 'can', 'be', 'turned', 'off', 'and', 'even', 'inverted', 'this', 'behavior', 'enables', 'a', 'spin', 'transistor', 'where', 'the', 'signal', 'is', 'switched', 'off', 'by', 'turning', 'off', 'the', 'spin', 'injection', 'using', 'the', 'fieldeffect', 'we', 'propose', 'a', 'model', 'based', 'on', 'a', 'gatedependent', 'shift', 'of', 'the', 'minimum', 'in', 'the', 'graphene', 'density', 'of', 'states', 'with', 'respect', 'to', 'the', 'tunneling', 'density', 'of', 'states', 'of', 'cobalt', 'which', 'can', 'explain', 'the', 'observed', 'bias', 'and', 'gate', 'dependence']]
|
[-0.20294806125780773, 0.1823839265551349, -0.07423861777082223, -0.017567063364872917, -0.007027386187541264, -0.23977526701141702, 0.10496593759119234, 0.40345688437379, -0.25828296813253676, -0.3149693191587209, 0.01330278465239745, -0.2753641774610582, -0.07693117056731824, 0.2265501478147969, 0.02285574511969807, 0.0070433943334070066, -0.026398318742091458, -0.05243398043051086, -0.10401910855176134, -0.1616033023326761, 0.25835676982145134, 0.040769748959940406, 0.33834138402232417, 0.12045303827876018, 0.11256287476754989, 0.03468677786144393, 0.13932777538947347, 0.027173209715531103, -0.05433014562543206, 0.029745960654475278, 0.2241399204768068, -0.10446298970082016, 0.1665582902531713, -0.5056130570290541, -0.14991082589969867, 0.012023191627425453, 0.11049552916342185, 0.18057939011702762, -0.06209847743459115, -0.303899843107771, 0.048964898826347455, -0.1966535397891507, -0.07255548925928047, -0.008367168620073548, -0.037774439426828864, 0.009217510463376702, -0.2597093145811447, 0.04293589238982855, 0.06986447019045483, 0.003453418431389663, -0.005257850892289921, -0.10512643805015143, -0.10638972535660421, 0.06914841856498108, -0.007695333653828129, 0.0499258799849216, 0.2829104813841965, -0.10207243582246722, -0.15890069417138067, 0.24364870508132433, -0.08482383418379834, -0.18685766294840034, 0.0778175168482078, -0.19381754343932564, 0.039387608930054635, 0.07092024609058474, 0.15187117353909546, 0.09186753371075072, -0.16494749584752652, 0.059569939569445084, 0.02939530185001247, 0.18030375810512514, 0.06244088701162211, 0.016904796499551997, 0.30895009683445096, 0.23279761871391977, 0.11346264191713461, 0.1553864357885215, -0.1943159207003191, 0.0015378823521098605, -0.22609584938079394, -0.13403204714672434, -0.20174982699703564, 0.16107863120096563, -0.03644746565219571, -0.14525332158707357, 0.5072430068006119, 0.15973426656435347, 0.20063900769929643, -0.0284053932765447, 0.32023206358792744, 0.17876676293262453, 0.11331366268159063, -0.01688219565915427, 0.2308651254495123, 0.18782069861319745, 0.09987360560680153, -0.3328340041162274, 0.1215047587595311, -0.09376944195806843]
|
1,803.07912
|
Series and power series on universally complete complex vector lattices
|
In this paper we prove an $n$th root test for series as well as a
Cauchy-Hadamard type formula and Abel's' theorem for power series on
universally complete Archimedean complex vector lattices. These results are
aimed at developing an alternative approach to the classical theory of complex
series and power series using the notion of order convergence.
|
math.FA
|
in this paper we prove an nth root test for series as well as a cauchyhadamard type formula and abels theorem for power series on universally complete archimedean complex vector lattices these results are aimed at developing an alternative approach to the classical theory of complex series and power series using the notion of order convergence
|
[['in', 'this', 'paper', 'we', 'prove', 'an', 'nth', 'root', 'test', 'for', 'series', 'as', 'well', 'as', 'a', 'cauchyhadamard', 'type', 'formula', 'and', 'abels', 'theorem', 'for', 'power', 'series', 'on', 'universally', 'complete', 'archimedean', 'complex', 'vector', 'lattices', 'these', 'results', 'are', 'aimed', 'at', 'developing', 'an', 'alternative', 'approach', 'to', 'the', 'classical', 'theory', 'of', 'complex', 'series', 'and', 'power', 'series', 'using', 'the', 'notion', 'of', 'order', 'convergence']]
|
[-0.08929139917547052, 0.0058440731462641535, -0.10143645819784565, 0.07550799397709355, -0.09042343859645453, -0.07413509113036773, -0.005331381427293474, 0.3092859412120147, -0.3146248897876252, -0.23431104682385923, 0.12388861244544387, -0.24535072527148508, -0.20440542306751014, 0.279168877242641, -0.055662514777346093, 0.08893277054144577, -0.03579613363624296, 0.07628580125218087, -0.0285690471699292, -0.29952047819441013, 0.31355956704355775, 0.05341894430193034, 0.28233846283771774, 0.024863458196209234, 0.09305530884514816, 0.0398223876953125, -0.037673889405348084, -0.0007216894152489576, -0.13707832783799279, 0.15520278095606377, 0.2753647682129998, 0.07938970162702555, 0.3008509686047381, -0.4204346850514412, -0.14087077389386568, 0.10142598155547272, 0.11987895140085708, 0.05672648475420746, -0.004714982074008069, -0.22223107530312106, 0.13123468470505692, -0.2195362291468138, -0.20099842043762858, -0.17618065530603583, 0.00893436030230739, 0.04730682640590451, -0.3145783027464693, 0.06676266247575934, 0.12687270985281265, 0.18676423191685568, -0.053177339270372284, -0.08996080792593684, 0.09509231061251326, 0.06518246625465425, 0.011349190350367942, 0.0003305916505103762, 0.016380848236043345, -0.07420952319675549, -0.16039347330277617, 0.36817064115946946, -0.08514770297545263, -0.18676529838280245, 0.1546503641388633, -0.1268942292779684, -0.18481095652519303, 0.06144039011137052, 0.1752117433500561, 0.15089108727195047, -0.09522920853712342, 0.08133274204817346, -0.050838881155306645, 0.08521886508573186, 0.09018108850683679, -0.0005634019151329994, 0.17531943055377766, 0.10900305478240956, 0.06718391263010827, 0.15620846625163473, -0.005112364892424508, -0.10017397402023727, -0.3556252374906432, -0.21282011538066647, -0.19161157799376682, 0.08281856057318775, -0.10827306674274785, -0.19396879828789018, 0.37698765044862576, 0.054855948003982614, 0.16361010357398878, 0.1462084591219371, 0.27325660999525675, 0.17688206465999512, -0.01175720953297886, 0.015088149773972956, 0.09222960783676667, 0.1707191308790987, 0.0637501402758062, -0.11771382707255808, -0.014752881736917928, 0.19220715116032144]
|
1,803.07913
|
HATS: Histograms of Averaged Time Surfaces for Robust Event-based Object
Classification
|
Event-based cameras have recently drawn the attention of the Computer Vision
community thanks to their advantages in terms of high temporal resolution, low
power consumption and high dynamic range, compared to traditional frame-based
cameras. These properties make event-based cameras an ideal choice for
autonomous vehicles, robot navigation or UAV vision, among others. However, the
accuracy of event-based object classification algorithms, which is of crucial
importance for any reliable system working in real-world conditions, is still
far behind their frame-based counterparts. Two main reasons for this
performance gap are: 1. The lack of effective low-level representations and
architectures for event-based object classification and 2. The absence of large
real-world event-based datasets. In this paper we address both problems. First,
we introduce a novel event-based feature representation together with a new
machine learning architecture. Compared to previous approaches, we use local
memory units to efficiently leverage past temporal information and build a
robust event-based representation. Second, we release the first large
real-world event-based dataset for object classification. We compare our method
to the state-of-the-art with extensive experiments, showing better
classification performance and real-time computation.
|
cs.CV
|
eventbased cameras have recently drawn the attention of the computer vision community thanks to their advantages in terms of high temporal resolution low power consumption and high dynamic range compared to traditional framebased cameras these properties make eventbased cameras an ideal choice for autonomous vehicles robot navigation or uav vision among others however the accuracy of eventbased object classification algorithms which is of crucial importance for any reliable system working in realworld conditions is still far behind their framebased counterparts two main reasons for this performance gap are 1 the lack of effective lowlevel representations and architectures for eventbased object classification and 2 the absence of large realworld eventbased datasets in this paper we address both problems first we introduce a novel eventbased feature representation together with a new machine learning architecture compared to previous approaches we use local memory units to efficiently leverage past temporal information and build a robust eventbased representation second we release the first large realworld eventbased dataset for object classification we compare our method to the stateoftheart with extensive experiments showing better classification performance and realtime computation
|
[['eventbased', 'cameras', 'have', 'recently', 'drawn', 'the', 'attention', 'of', 'the', 'computer', 'vision', 'community', 'thanks', 'to', 'their', 'advantages', 'in', 'terms', 'of', 'high', 'temporal', 'resolution', 'low', 'power', 'consumption', 'and', 'high', 'dynamic', 'range', 'compared', 'to', 'traditional', 'framebased', 'cameras', 'these', 'properties', 'make', 'eventbased', 'cameras', 'an', 'ideal', 'choice', 'for', 'autonomous', 'vehicles', 'robot', 'navigation', 'or', 'uav', 'vision', 'among', 'others', 'however', 'the', 'accuracy', 'of', 'eventbased', 'object', 'classification', 'algorithms', 'which', 'is', 'of', 'crucial', 'importance', 'for', 'any', 'reliable', 'system', 'working', 'in', 'realworld', 'conditions', 'is', 'still', 'far', 'behind', 'their', 'framebased', 'counterparts', 'two', 'main', 'reasons', 'for', 'this', 'performance', 'gap', 'are', '1', 'the', 'lack', 'of', 'effective', 'lowlevel', 'representations', 'and', 'architectures', 'for', 'eventbased', 'object', 'classification', 'and', '2', 'the', 'absence', 'of', 'large', 'realworld', 'eventbased', 'datasets', 'in', 'this', 'paper', 'we', 'address', 'both', 'problems', 'first', 'we', 'introduce', 'a', 'novel', 'eventbased', 'feature', 'representation', 'together', 'with', 'a', 'new', 'machine', 'learning', 'architecture', 'compared', 'to', 'previous', 'approaches', 'we', 'use', 'local', 'memory', 'units', 'to', 'efficiently', 'leverage', 'past', 'temporal', 'information', 'and', 'build', 'a', 'robust', 'eventbased', 'representation', 'second', 'we', 'release', 'the', 'first', 'large', 'realworld', 'eventbased', 'dataset', 'for', 'object', 'classification', 'we', 'compare', 'our', 'method', 'to', 'the', 'stateoftheart', 'with', 'extensive', 'experiments', 'showing', 'better', 'classification', 'performance', 'and', 'realtime', 'computation']]
|
[-0.09334062456900438, -0.036494662009028, -0.056855922779784754, 0.04966112756065431, -0.15302988122585792, -0.17130039894062984, -0.0009019272600218736, 0.4840481779640438, -0.2521093617459493, -0.3828889376043782, 0.11636544841374936, -0.25999046285038013, -0.1845501502067526, 0.2196989692763584, -0.198325577025541, 0.1397759687708138, 0.17491018160113267, 0.046514457027085, -0.06418183703835194, -0.26593142302046724, 0.251950775908951, 0.04837543439826222, 0.3540672197078283, 0.0011100453442310567, 0.16870968096510885, -0.005449977061189302, -0.04435682065585362, -0.009742876801353235, -0.045935249902758296, 0.19898469545424322, 0.3362890422845689, 0.1731210795440967, 0.3129448657740255, -0.4360120896823131, -0.22426013943769937, 0.10498466618758227, 0.14209837467757638, 0.07901284761496905, -0.06117771004306173, -0.34839270634136604, 0.12060043922303101, -0.21445582314793551, -0.01142958923790522, -0.142191481601033, 0.0267044993998842, 0.02805041040646956, -0.24566069989916767, 0.013838095954270102, 0.056294655346301715, 0.10962891761996466, -0.06117847215660571, -0.0795042381134488, 0.0935224416361262, 0.21955126668147457, 0.010967446772565882, 0.011430146358779293, 0.14468501179202736, -0.21230882121209096, -0.19434870944926413, 0.36859617807012013, 0.0005133002075356441, -0.17779240939525662, 0.2782656097846044, -0.015513005356846766, -0.17467838293964882, 0.1046728380152362, 0.24248776643199252, 0.1078277396764651, -0.1636972429619713, 0.010907101386532463, 0.010464415851287073, 0.19055584848252033, 0.014136117915008831, 0.047751602135946626, 0.18660391819315378, 0.29053653010607255, 0.051970465442646746, 0.09417542577260635, -0.12808481011485967, -0.08973581692879344, -0.18941327707923866, -0.11025650579492552, -0.1800445762966954, -0.0369723640979718, -0.10751146796646535, -0.09638477386497371, 0.3783856928143855, 0.2898749108426273, 0.17802202692421684, 0.12802911118925983, 0.41910104654156244, 0.02990609904364836, 0.09874752527205172, 0.092548383801541, 0.191961731461061, -0.005245062302552409, 0.19485069270204794, -0.169766458290134, 0.03385348511209896, 0.030791825408904024]
|
1,803.07914
|
Well-posedness and stabilization of the Benjamin-Bona-Mahony equation on
star-shaped networks
|
We study the stabilization issue of the Benjamin-Bona-Mahony (BBM) equation
on a finite star-shaped network with a damping term acting on the central node.
In a first time, we prove the well-posedness of this system. Then thanks to the
frequency domain method, we get the asymptotic stabilization result.
|
math.AP
|
we study the stabilization issue of the benjaminbonamahony bbm equation on a finite starshaped network with a damping term acting on the central node in a first time we prove the wellposedness of this system then thanks to the frequency domain method we get the asymptotic stabilization result
|
[['we', 'study', 'the', 'stabilization', 'issue', 'of', 'the', 'benjaminbonamahony', 'bbm', 'equation', 'on', 'a', 'finite', 'starshaped', 'network', 'with', 'a', 'damping', 'term', 'acting', 'on', 'the', 'central', 'node', 'in', 'a', 'first', 'time', 'we', 'prove', 'the', 'wellposedness', 'of', 'this', 'system', 'then', 'thanks', 'to', 'the', 'frequency', 'domain', 'method', 'we', 'get', 'the', 'asymptotic', 'stabilization', 'result']]
|
[-0.2068419756445413, 0.040046139096375555, -0.1116400169072828, 0.012486760589429954, -0.10023146858050798, -0.08568945355364121, 0.05467834242153913, 0.3012581521179527, -0.3104441207833588, -0.19025140180019662, 0.18094891540022218, -0.22967706449950734, -0.15002115848862255, 0.14855681652746475, -0.07801615635010724, 0.053157668570444606, 0.07742951042988959, 0.06683766269028031, -0.0028542152528340616, -0.21724367522013685, 0.36479853400184464, -0.019376318976962164, 0.2505791218136437, 0.054116752561337, 0.1517684311644795, -0.002479615383587467, 0.009875414058721313, -0.02187690741508656, -0.18921105528715998, 0.08589356208297734, 0.17183828363583112, 0.008893600834805207, 0.3460039710626006, -0.4188071351187925, -0.21539370901882648, 0.1294542993127834, 0.1340074989857385, 0.17084557002332681, -0.03760270680504618, -0.31127513634661835, 0.1045069141255226, -0.17786858727534613, -0.20508509944193065, -0.023985143033011507, -0.003883148485329002, 0.05102355878625531, -0.26330251671606675, 0.08127313384708638, 0.11656697067276885, 0.010391981670788178, -0.1728288642091987, -0.023545615333811536, 0.010886785748880357, 0.09223524615905869, 0.051774707389995456, 0.020535866511636414, 0.027036783644386258, -0.08415580004899918, -0.05430194841270956, 0.3404323590608935, -0.114508507225158, -0.2860445105858768, 0.14775496628135443, -0.15536722032508501, -0.1251851732376963, 0.04292566856990258, 0.22492588156213364, 0.15347126925674578, -0.11210472719540121, 0.11859045374634054, -0.032969248636315264, 0.18502331940302005, 0.10038212958412866, 0.009429444093257189, 0.04670517022411028, 0.2506781005358789, 0.16246878212162605, 0.2053215150287239, -0.06757058033933087, -0.08642664998963785, -0.34501733337917057, -0.1415110672630059, -0.1891035184962675, 0.07544715225230902, -0.09990723285106166, -0.1713557075127028, 0.4037506890793641, 0.13128410931676626, 0.1917519240329663, 0.11364381122014795, 0.2868892625750353, 0.18911195953842252, 0.001922044379170984, 0.06369847406555589, 0.1978570843154254, 0.1501409230598559, 0.17093328741611913, -0.2989571752162495, 0.009934808864879111, 0.19490991111767167]
|
1,803.07915
|
Modelling the Influence of Cultural Information on Vision-Based Human
Home Activity Recognition
|
Daily life activities, such as eating and sleeping, are deeply influenced by
a person's culture, hence generating differences in the way a same activity is
performed by individuals belonging to different cultures. We argue that taking
cultural information into account can improve the performance of systems for
the automated recognition of human activities. We propose four different
solutions to the problem and present a system which uses a Naive Bayes model to
associate cultural information with semantic information extracted from still
images. Preliminary experiments with a dataset of images of individuals lying
on the floor, sleeping on a futon and sleeping on a bed suggest that: i)
solutions explicitly taking cultural information into account are more accurate
than culture-unaware solutions; and ii) the proposed system is a promising
starting point for the development of culture-aware Human Activity Recognition
methods.
|
cs.CV cs.CY cs.RO
|
daily life activities such as eating and sleeping are deeply influenced by a persons culture hence generating differences in the way a same activity is performed by individuals belonging to different cultures we argue that taking cultural information into account can improve the performance of systems for the automated recognition of human activities we propose four different solutions to the problem and present a system which uses a naive bayes model to associate cultural information with semantic information extracted from still images preliminary experiments with a dataset of images of individuals lying on the floor sleeping on a futon and sleeping on a bed suggest that i solutions explicitly taking cultural information into account are more accurate than cultureunaware solutions and ii the proposed system is a promising starting point for the development of cultureaware human activity recognition methods
|
[['daily', 'life', 'activities', 'such', 'as', 'eating', 'and', 'sleeping', 'are', 'deeply', 'influenced', 'by', 'a', 'persons', 'culture', 'hence', 'generating', 'differences', 'in', 'the', 'way', 'a', 'same', 'activity', 'is', 'performed', 'by', 'individuals', 'belonging', 'to', 'different', 'cultures', 'we', 'argue', 'that', 'taking', 'cultural', 'information', 'into', 'account', 'can', 'improve', 'the', 'performance', 'of', 'systems', 'for', 'the', 'automated', 'recognition', 'of', 'human', 'activities', 'we', 'propose', 'four', 'different', 'solutions', 'to', 'the', 'problem', 'and', 'present', 'a', 'system', 'which', 'uses', 'a', 'naive', 'bayes', 'model', 'to', 'associate', 'cultural', 'information', 'with', 'semantic', 'information', 'extracted', 'from', 'still', 'images', 'preliminary', 'experiments', 'with', 'a', 'dataset', 'of', 'images', 'of', 'individuals', 'lying', 'on', 'the', 'floor', 'sleeping', 'on', 'a', 'futon', 'and', 'sleeping', 'on', 'a', 'bed', 'suggest', 'that', 'i', 'solutions', 'explicitly', 'taking', 'cultural', 'information', 'into', 'account', 'are', 'more', 'accurate', 'than', 'cultureunaware', 'solutions', 'and', 'ii', 'the', 'proposed', 'system', 'is', 'a', 'promising', 'starting', 'point', 'for', 'the', 'development', 'of', 'cultureaware', 'human', 'activity', 'recognition', 'methods']]
|
[-0.06331288236833643, 0.07289661027436309, -0.10159682388663949, 0.11151529400547802, -0.08640816663939725, -0.14599949400871992, 0.0847638037024915, 0.3913623468731256, -0.20216120288515574, -0.31240766659902874, 0.11623444067406714, -0.32358881003935547, -0.18880366220358102, 0.17321730157367282, -0.12369623211527463, -0.015519614060073817, 0.1146970726618105, 0.09866591834339916, 0.000940898313488373, -0.24406098901732443, 0.3115711871325723, 0.004516423933262772, 0.33080707900636996, 0.026442353723242003, 0.1334498596697813, -0.035541140250964366, -0.05445325123967931, 0.01603397689691252, -0.058944336363471364, 0.15616462839748504, 0.304016206495683, 0.2335508549483219, 0.34875396136468384, -0.4488256675300791, -0.2182863582377596, 0.055523219956632924, 0.16485710582106977, 0.08982173476953689, -0.04665220307363009, -0.3774163163308164, 0.06647778271230088, -0.1502056745615418, -0.035100302436416424, -0.07203182282254976, 0.018506016904104722, -0.0064268231028964855, -0.2596947490580051, 0.048168229345773236, 0.025491197086761102, 0.11960797461763244, -0.10475948501570041, -0.12544293361818692, -0.0047074550564181715, 0.26183277275413275, 0.06959529357246698, 0.014264191832968636, 0.18813639046514735, -0.17692444467855453, -0.1352995048788109, 0.4005711307348547, -0.019280617360409986, -0.19812613496940365, 0.19395485200563117, -0.11232837758999427, -0.12810657069306164, 0.10394236145999886, 0.23739056651453105, 0.07377787300570429, -0.19792017889866495, -0.04764717667849789, -0.03322308029301519, 0.16382908503467608, 0.033514558116782125, -0.009583168642540626, 0.23025929874583037, 0.24962606463882633, 0.013404442360350752, 0.0995550995460636, -0.06952677362577935, -0.08753134627990863, -0.21154428371365236, -0.14051648228750685, -0.12724782242987523, 0.016444449285593105, -0.08990480427532663, -0.11395518852719654, 0.4142598264194984, 0.17978228819351094, 0.16576942686429796, 0.07077783206049763, 0.28810717220253806, 0.009510737753932035, 0.10277139884590938, 0.058707912103272974, 0.16149726861690664, -0.04246760202530662, 0.1422244022216867, -0.18099598693216273, 0.12187676363528761, 0.034095814845332986]
|
1,803.07916
|
Cosmic Censorship and Weak Gravity Conjecture in the
Einstein-Maxwell-dilaton theory
|
We explore the cosmic censorship in the Einstein-Maxwell-dilaton theory
following Wald's thought experiment to destroy a black hole by throwing in a
test particle. We discover that at probe limit the extremal charged dilaton
black hole could be destroyed by a test particle with specific energy.
Nevertheless the censorship is well protected if backreaction or self-force is
included. At the end, we discuss an interesting connection between Hoop
Conjecture and Weak Gravity Conjecture.
|
gr-qc hep-th
|
we explore the cosmic censorship in the einsteinmaxwelldilaton theory following walds thought experiment to destroy a black hole by throwing in a test particle we discover that at probe limit the extremal charged dilaton black hole could be destroyed by a test particle with specific energy nevertheless the censorship is well protected if backreaction or selfforce is included at the end we discuss an interesting connection between hoop conjecture and weak gravity conjecture
|
[['we', 'explore', 'the', 'cosmic', 'censorship', 'in', 'the', 'einsteinmaxwelldilaton', 'theory', 'following', 'walds', 'thought', 'experiment', 'to', 'destroy', 'a', 'black', 'hole', 'by', 'throwing', 'in', 'a', 'test', 'particle', 'we', 'discover', 'that', 'at', 'probe', 'limit', 'the', 'extremal', 'charged', 'dilaton', 'black', 'hole', 'could', 'be', 'destroyed', 'by', 'a', 'test', 'particle', 'with', 'specific', 'energy', 'nevertheless', 'the', 'censorship', 'is', 'well', 'protected', 'if', 'backreaction', 'or', 'selfforce', 'is', 'included', 'at', 'the', 'end', 'we', 'discuss', 'an', 'interesting', 'connection', 'between', 'hoop', 'conjecture', 'and', 'weak', 'gravity', 'conjecture']]
|
[-0.16868778461373526, 0.15993443469071206, -0.10991389575503664, 0.2189805681708792, -0.06435089869574605, -0.2254935330073413, 0.014324744185751737, 0.23634440048712574, -0.19014669791476368, -0.321598195190197, 0.06908742061892703, -0.32549558307541765, -0.09543988543996358, 0.14428945234019872, -0.07635990890661536, -0.004849357753736924, 0.00219979108955507, 0.019360891534557743, -0.04977047708434091, -0.254548908766257, 0.3519897450029544, 0.1586942941409676, 0.24246844667175863, 0.11677424099347362, 0.0816759739696265, 0.016169835529481508, 0.007825016898855772, 0.09488826831930304, -0.16825689610513644, -0.0038944833675935253, 0.18749429885782812, 0.13764891267932747, 0.21036783550716043, -0.4395479806890226, -0.19878371327171382, 0.10159103382914646, 0.14580287836007264, 0.19717911992553774, -0.15756178843112637, -0.2961323198109661, 0.09296945422530582, -0.20095971160989307, -0.2084605592392283, -0.03795118808063793, 0.029155755670715686, -0.09270106211355696, -0.20176726869907077, 0.11300336658214666, 0.05028121030653431, -0.07277815759641258, -0.07488784491250368, 0.06667541750796037, -0.0357697751175306, 0.06764181640815653, 0.18850241190026681, 0.06632851041878944, 0.1984138835463928, -0.11881001197496965, -0.14730027075601768, 0.33514259786230244, -0.07422029108370412, -0.18235865824741043, 0.18312624421597407, -0.24290579790249467, -0.14873237220238741, 0.036458048497467005, 0.1316604518924827, 0.18083891188343093, -0.1454543145245885, 0.15005829041004054, -0.024059095668721282, 0.14250512520642314, 0.17600676968489606, 0.0005401833419853898, 0.44604943602741376, 0.10338683274880767, 0.042374262190742855, 0.18092698779767252, -0.04361444456528311, -0.05626938634947555, -0.3450408595971355, -0.16931788183187377, -0.17432722236246687, 0.15573704881874256, -0.13086147328869804, -0.14857658889297753, 0.27549926676366426, 0.1574402593607673, 0.1392478907149132, 0.017073414875322008, 0.20737146244269528, 0.044100066197219574, 0.008772003483537533, 0.10069054597350832, 0.3718771808844519, 0.11741654084331982, 0.08847895354169663, -0.23576422838162478, -0.027114020800855877, 0.12197801123743188]
|
1,803.07917
|
The Hbot : A Holonomic Spherical Haptic Interface Driven by
Non-Holonomic Wheels
|
We present the Hbot, a holonomic, singularity-free spherical robot designed
for haptic simulations. The Hbot is made up of a caged sphere actuated by
steered and driven non-holonomic wheels to produce continuous and unlimited
spherical motions. We analyse the kinematic interface between a sphere and $n$
arbitrarily positioned, steered and driven non-holonomic wheels in the general
case. We also present a detailed singularity analysis and show that
workspace-boundary and workspace-interior singularities can both be avoided at
the design stage. We implement a prototype using two steered and driven
non-holonomic wheels and show experimental results for trajectory tracking and
rendering of various rotational stiffness levels.
|
cs.RO
|
we present the hbot a holonomic singularityfree spherical robot designed for haptic simulations the hbot is made up of a caged sphere actuated by steered and driven nonholonomic wheels to produce continuous and unlimited spherical motions we analyse the kinematic interface between a sphere and n arbitrarily positioned steered and driven nonholonomic wheels in the general case we also present a detailed singularity analysis and show that workspaceboundary and workspaceinterior singularities can both be avoided at the design stage we implement a prototype using two steered and driven nonholonomic wheels and show experimental results for trajectory tracking and rendering of various rotational stiffness levels
|
[['we', 'present', 'the', 'hbot', 'a', 'holonomic', 'singularityfree', 'spherical', 'robot', 'designed', 'for', 'haptic', 'simulations', 'the', 'hbot', 'is', 'made', 'up', 'of', 'a', 'caged', 'sphere', 'actuated', 'by', 'steered', 'and', 'driven', 'nonholonomic', 'wheels', 'to', 'produce', 'continuous', 'and', 'unlimited', 'spherical', 'motions', 'we', 'analyse', 'the', 'kinematic', 'interface', 'between', 'a', 'sphere', 'and', 'n', 'arbitrarily', 'positioned', 'steered', 'and', 'driven', 'nonholonomic', 'wheels', 'in', 'the', 'general', 'case', 'we', 'also', 'present', 'a', 'detailed', 'singularity', 'analysis', 'and', 'show', 'that', 'workspaceboundary', 'and', 'workspaceinterior', 'singularities', 'can', 'both', 'be', 'avoided', 'at', 'the', 'design', 'stage', 'we', 'implement', 'a', 'prototype', 'using', 'two', 'steered', 'and', 'driven', 'nonholonomic', 'wheels', 'and', 'show', 'experimental', 'results', 'for', 'trajectory', 'tracking', 'and', 'rendering', 'of', 'various', 'rotational', 'stiffness', 'levels']]
|
[-0.1755750405478894, 0.12877732608010808, -0.08260183968562998, -0.015664787851182707, -0.07598440272404867, -0.21351162955511874, -0.02995962417666234, 0.43603881642076314, -0.2531053168406966, -0.28423222635562223, 0.09652996045313593, -0.21114904631166628, -0.15712948572849306, 0.2105236456971433, -0.070129382685991, 0.07963857227849647, 0.13024286080297887, -0.02982306737434484, -0.03204041542302744, -0.12608068158642352, 0.2833284015411182, 0.02463350655949291, 0.19729365568206297, 0.00839034995685021, 0.2047811976186566, 0.022667500172175614, 0.028559472402740343, 0.07360504760735613, -0.17346318854127757, 0.08648759796850237, 0.2053303362997979, 0.05479397098807728, 0.21283515216326157, -0.48428366744123835, -0.13616203172497598, 0.07986842220941302, 0.1323936766711995, 0.11677640210380595, -0.0746063506322018, -0.33909122137964576, 0.05866552378945783, -0.16977022611992618, -0.19993610460512048, -0.11966563437325771, -0.0047900654494251104, 0.02736329668037155, -0.23795215275102094, -0.007160047300025255, 0.06253369333332076, 0.08457092802935079, -0.07225342308326314, -0.0167164550991455, -0.05549034678409168, 0.14089725156401411, -0.03737887851985208, 0.02019871837304284, 0.19899953640632184, -0.0701159140969371, -0.10513231099820604, 0.3831641893176472, 0.010866276472441707, -0.27569505196137756, 0.19755789131615495, -0.10255498968649145, -0.09788762096215185, 0.1110283594405023, 0.19904428482165232, 0.12952619384832717, -0.11751536960603998, 0.029276150985798964, 0.061934554205257814, 0.15945135106277816, 0.13331550965770422, -0.08951013988767312, 0.2198328965151792, 0.1301142911737164, 0.059423436813042775, 0.19634868322492705, -0.11831839630544624, -0.13499121151764093, -0.3039895181690215, -0.1475284460466355, -0.14467620552407906, 0.02916373267390893, -0.05402669634121612, -0.07555814312003992, 0.3331518605917546, 0.08629369629017995, 0.17743616458941616, 0.0667406056058027, 0.3345556537821597, 0.030848278424373883, 0.003540028142286282, 0.08802331581839598, 0.25922045860366494, 0.06473802360842991, 0.10839915296574142, -0.22140363459566645, -0.03366174650670705, 0.023593210430037433]
|
1,803.07918
|
Bosonic Szilard Engine Assisted by Feshbach Resonances
|
It was recently found that the information-to-work conversion in a quantum
Szilard engine can be increased by using a working medium of bosons with
attractive interactions. In the original scheme, the work output depends on the
insertion and removal position of an impenetrable barrier that acts like a
piston, separating the chambers of the engine. Here, we show that the barrier
removal process can be made fully reversible, resulting in a full
information-to-work conversion if we also allow for the interaction strength to
change during the cycle. Hence, it becomes possible to reach the maximum work
output per cycle dictated by the second law of thermodynamics. These findings
can, for instance, be experimentally verified with ultra-cold atoms as a
working medium, where a change of interaction strength can be controlled by
Feshbach resonances.
|
quant-ph cond-mat.quant-gas
|
it was recently found that the informationtowork conversion in a quantum szilard engine can be increased by using a working medium of bosons with attractive interactions in the original scheme the work output depends on the insertion and removal position of an impenetrable barrier that acts like a piston separating the chambers of the engine here we show that the barrier removal process can be made fully reversible resulting in a full informationtowork conversion if we also allow for the interaction strength to change during the cycle hence it becomes possible to reach the maximum work output per cycle dictated by the second law of thermodynamics these findings can for instance be experimentally verified with ultracold atoms as a working medium where a change of interaction strength can be controlled by feshbach resonances
|
[['it', 'was', 'recently', 'found', 'that', 'the', 'informationtowork', 'conversion', 'in', 'a', 'quantum', 'szilard', 'engine', 'can', 'be', 'increased', 'by', 'using', 'a', 'working', 'medium', 'of', 'bosons', 'with', 'attractive', 'interactions', 'in', 'the', 'original', 'scheme', 'the', 'work', 'output', 'depends', 'on', 'the', 'insertion', 'and', 'removal', 'position', 'of', 'an', 'impenetrable', 'barrier', 'that', 'acts', 'like', 'a', 'piston', 'separating', 'the', 'chambers', 'of', 'the', 'engine', 'here', 'we', 'show', 'that', 'the', 'barrier', 'removal', 'process', 'can', 'be', 'made', 'fully', 'reversible', 'resulting', 'in', 'a', 'full', 'informationtowork', 'conversion', 'if', 'we', 'also', 'allow', 'for', 'the', 'interaction', 'strength', 'to', 'change', 'during', 'the', 'cycle', 'hence', 'it', 'becomes', 'possible', 'to', 'reach', 'the', 'maximum', 'work', 'output', 'per', 'cycle', 'dictated', 'by', 'the', 'second', 'law', 'of', 'thermodynamics', 'these', 'findings', 'can', 'for', 'instance', 'be', 'experimentally', 'verified', 'with', 'ultracold', 'atoms', 'as', 'a', 'working', 'medium', 'where', 'a', 'change', 'of', 'interaction', 'strength', 'can', 'be', 'controlled', 'by', 'feshbach', 'resonances']]
|
[-0.08785247671964082, 0.2081611392140096, -0.0596286187362437, 0.008246988350947504, -0.048606793413680974, -0.159312644574259, 0.10356128754801489, 0.3814827104526243, -0.2808679025690246, -0.32062134991182867, 0.06619867139156292, -0.2490908030028406, -0.10477606314269447, 0.2048440555852831, -0.013363710454055914, 0.009109445028287127, 0.06460630692037425, 0.027026896265202334, -0.014011456661321978, -0.21861053928312726, 0.2592757597803733, 0.10618549505427227, 0.2498388043534767, 0.11683049870486882, 0.09323869147372985, 0.00981283391286668, 0.06323960435198606, 0.031208857617347985, -0.07515000287504452, 0.06891551974957767, 0.19834540113789217, 0.060438030500917284, 0.2254392786084541, -0.44459324321688565, -0.21714075675052136, 0.10158609138815698, 0.17465023779663907, 0.1321834752938353, -0.055302517342423196, -0.2630376303148337, 0.03231882293799654, -0.1935617016502341, -0.11834821402956557, -0.04328226661103904, 0.03823108386416409, 0.03297539731125256, -0.2720054657989763, 0.03651071673664404, 0.07513365384484064, 0.01821624756531608, -0.027747776767210963, -0.024144272358485853, -0.018657287705297534, 0.1303654847582592, -0.031242781529891045, 0.032351667415070576, 0.214675368993242, -0.133050617412664, -0.10176600678648828, 0.382678702737982, -0.08498728075204767, -0.18235786733238546, 0.15689743057425534, -0.11381179526714343, -0.06724955322206917, 0.13788080232960165, 0.131663720776446, 0.08584427651784013, -0.14847443238797045, 0.05811716537682788, -0.009446403172735433, 0.19633374216395633, 0.09308285023176804, -0.011314793157258205, 0.21360331009093084, 0.18062551729897514, 0.03778077593717472, 0.19462459190237455, -0.0758496565981488, -0.10050979823695104, -0.2995201044862992, -0.19130081607070856, -0.21110947011563844, 0.042695819088642985, -0.0478734516299503, -0.11805726357392575, 0.36034630154901426, 0.14180854317045918, 0.19621533989430145, -0.031999534091831684, 0.28199150269637513, 0.17059674721011625, 0.10214820974357636, 0.0408757125155272, 0.30658341991834176, 0.1007412835514467, 0.08522010924070514, -0.233264646830109, 0.09620560413398045, 0.04831457806968207]
|
1,803.07919
|
Quantum games: a review of the history, current state, and
interpretation
|
We review both theoretical and experimental developments in the area of
quantum games since the inception of the subject circa 1999. We will also offer
a narrative on the controversy that surrounded the subject in its early days,
and how this controversy has affected the development of the subject.
|
quant-ph
|
we review both theoretical and experimental developments in the area of quantum games since the inception of the subject circa 1999 we will also offer a narrative on the controversy that surrounded the subject in its early days and how this controversy has affected the development of the subject
|
[['we', 'review', 'both', 'theoretical', 'and', 'experimental', 'developments', 'in', 'the', 'area', 'of', 'quantum', 'games', 'since', 'the', 'inception', 'of', 'the', 'subject', 'circa', '1999', 'we', 'will', 'also', 'offer', 'a', 'narrative', 'on', 'the', 'controversy', 'that', 'surrounded', 'the', 'subject', 'in', 'its', 'early', 'days', 'and', 'how', 'this', 'controversy', 'has', 'affected', 'the', 'development', 'of', 'the', 'subject']]
|
[-0.0861940186147635, 0.08644229327613602, -0.1302900794627411, 0.0035810938024209166, -0.059145819927964895, -0.06645938495592195, 0.06391736701111861, 0.3500047073680527, -0.19825330732048166, -0.29851552946683096, 0.1660456339952213, -0.2955929760450535, -0.17694076087934021, 0.18181209634913473, -0.15050958034259324, 0.03139705149984291, 0.09241782710412327, 0.03223793151579341, -0.05490985820164942, -0.3379230151066975, 0.25339063218965824, 0.12015745777171105, 0.27393733957611327, 0.16550078672565977, 0.06892268895646747, -0.016771064301458548, -0.08784910013937221, 0.022732538076079622, -0.1835762583040359, 0.15105131268501282, 0.20600498498094325, 0.18822219875660173, 0.36431497723168255, -0.5145048277870733, -0.18439905046561392, 0.060012786440095126, 0.11055226065218449, 0.055330644114589204, -0.09942240535272096, -0.3042186346209171, 0.0007743177441309909, -0.19385124302032042, -0.08100834977337901, 0.005727423868161075, 0.09977006411407979, -0.0345517579580144, -0.11544830732199611, 0.06058607959813362, 0.08328728020495298, 0.08290705673054469, -0.06751319899328281, -0.10290852411441048, 0.07628752302606495, 0.13549448611518863, 0.09928043029385106, 0.06764291287209763, 0.09399779578100662, -0.17315437294523783, -0.1298701631247389, 0.39622277614413476, -0.024460702013148337, -0.1047822248798852, 0.18930386364155885, -0.11276585367337173, -0.13314608484506607, 0.054474850147202304, 0.15629664297234647, 0.059891870169311155, -0.10824248552018283, 0.07568239964003086, -0.05731958683047976, 0.12726581301920267, 0.03134546974407775, 0.06742439211859387, 0.29519619982765644, 0.20492972310024257, -0.020227168952780112, 0.12631025205233268, -0.08702959961790059, -0.1659901588394934, -0.2790663904814544, -0.11198550713609676, -0.11835813402597394, 0.08147588436852912, 0.05796549664109432, -0.11793511731512084, 0.46421353503757595, 0.21061746160290679, 0.117021923447598, -0.02838530807223703, 0.23272425388651236, 0.03919418365219418, 0.026551680382797305, 0.05494016759116583, 0.312424686490273, 0.13754933000523217, 0.21390908908060924, -0.20027898475337697, 0.10699541370752054, -0.05019864559705768]
|
1,803.0792
|
Two-Parameter Quasi-Ballistic Transport Model for Nanoscale Transistors
|
We show that by adding only two fitting parameters to a purely ballistic
transport model, we can accurately characterize the current-voltage
characteristics of nanoscale MOSFETs. The model is an extension to a ballistic
model (J. Appl. Phys. 76, 4879 (1994)) and includes transmission probability
and the drain-channel coupling capacitor. The latter parameter gives rise to a
theoretical RON that is significantly larger than those predicted previously.
To validate our model, we fabricated n-channel MOSFETs with varying channel
lengths. We show the length dependence of these parameters to support a
quasi-ballistic description of our devices.
|
cond-mat.mes-hall
|
we show that by adding only two fitting parameters to a purely ballistic transport model we can accurately characterize the currentvoltage characteristics of nanoscale mosfets the model is an extension to a ballistic model j appl phys 76 4879 1994 and includes transmission probability and the drainchannel coupling capacitor the latter parameter gives rise to a theoretical ron that is significantly larger than those predicted previously to validate our model we fabricated nchannel mosfets with varying channel lengths we show the length dependence of these parameters to support a quasiballistic description of our devices
|
[['we', 'show', 'that', 'by', 'adding', 'only', 'two', 'fitting', 'parameters', 'to', 'a', 'purely', 'ballistic', 'transport', 'model', 'we', 'can', 'accurately', 'characterize', 'the', 'currentvoltage', 'characteristics', 'of', 'nanoscale', 'mosfets', 'the', 'model', 'is', 'an', 'extension', 'to', 'a', 'ballistic', 'model', 'j', 'appl', 'phys', '76', '4879', '1994', 'and', 'includes', 'transmission', 'probability', 'and', 'the', 'drainchannel', 'coupling', 'capacitor', 'the', 'latter', 'parameter', 'gives', 'rise', 'to', 'a', 'theoretical', 'ron', 'that', 'is', 'significantly', 'larger', 'than', 'those', 'predicted', 'previously', 'to', 'validate', 'our', 'model', 'we', 'fabricated', 'nchannel', 'mosfets', 'with', 'varying', 'channel', 'lengths', 'we', 'show', 'the', 'length', 'dependence', 'of', 'these', 'parameters', 'to', 'support', 'a', 'quasiballistic', 'description', 'of', 'our', 'devices']]
|
[-0.12395699574869681, 0.08715070074593198, -0.0690294707471386, -0.007969075058428372, -0.07575295683079489, -0.21235297387465835, 0.061961089424353015, 0.3851797108023249, -0.21980274738644826, -0.32060881689230497, -0.019550889111223057, -0.28820475438570087, -0.15266553244177014, 0.23948126538914252, -0.06504472339912219, 0.033283306795984825, 0.00502795771140843, -0.07326856000903756, -0.036512373745976455, -0.20898654143464693, 0.18163008555928442, 0.08871168138501433, 0.29570489987004006, 0.06628357637128694, 0.055282038752920926, -0.0007405579337810582, 0.02184512033226325, 0.05604365502702112, -0.21248205174336537, 0.06228953325486881, 0.1883056360232505, -0.04422133631429615, 0.18333750647155844, -0.4093079723794251, -0.2781247047539008, 0.03862269349129031, 0.11438736135258953, 0.15460164142658617, 0.02207580979348735, -0.2496562848224285, 0.12313143625617662, -0.19544683949665187, -0.09093863703666547, -0.037083424855657715, 0.043356433585087985, 0.014538153015235637, -0.31379671812433985, 0.07984750916527465, 0.06242809194992197, 0.006739802574342552, -0.0552527877978022, -0.14220723353742443, -0.032656388978989044, 0.048221529317781966, -0.022969810217817094, -0.008407084261404072, 0.16037885005526403, -0.07567323732160111, -0.13214970678289203, 0.3020157921722436, -0.06304142156914942, -0.15680615054542554, 0.2016019015529619, -0.1350810283230261, -0.017969787081188345, 0.12830408125313275, 0.1390373009019234, 0.09221256869111924, -0.17942379323884527, 0.0720393686998695, -0.05735420765469168, 0.2054714384944515, 0.05742209007408708, 0.029837790316842656, 0.14187525913238208, 0.19611544599954753, -0.024127057347288157, 0.1174258950458681, -0.1264928543266464, -0.08820386016939549, -0.26648387589313566, -0.14528690982718973, -0.17508946159022284, 0.107037232851887, -0.06577953937967516, -0.14617889627016725, 0.4377511067197044, 0.24125729872290283, 0.22959945004116347, 0.08465521042037041, 0.27694700812385914, 0.1281812078284813, 0.0616816704736111, 0.09176664390264357, 0.22732188421341173, 0.15839595438669773, 0.05388034366943101, -0.22503269033536236, 0.07502178170103976, 0.001313505179070412]
|
1,803.07921
|
White Paper: Exoplanetary Microlensing from the Ground in the 2020s
|
Microlensing can access planet populations that no other method can probe:
cold wide-orbit planets beyond the snow line, planets in both the Galactic
bulge and disk, and free floating planets (FFPs). The demographics of each
population will provide unique constraints on planet formation.
Over the past 5 years, U.S. microlensing campaigns with Spitzer and UKIRT
have provided a powerful complement to international ground-based microlensing
surveys, with major breakthroughs in parallax measurements and probing new
regions of the Galaxy. The scientific vitality of these projects has also
promoted the development of the U.S. microlensing community.
In the 2020s, the U.S. can continue to play a major role in ground-based
microlensing by leveraging U.S. assets to complement ongoing ground-based
international surveys. LSST and UKIRT microlensing surveys would probe vast
regions of the Galaxy, where planets form under drastically different
conditions. Moreover, while ground-based surveys will measure the planet
mass-ratio function beyond the snow line, adaptive optics (AO) observations
with ELTs would turn all of these mass ratios into masses and also distinguish
between very wide-orbit planets and genuine FFPs. To the extent possible,
cooperation of U.S. scientists with international surveys should also be
encouraged and supported.
|
astro-ph.EP
|
microlensing can access planet populations that no other method can probe cold wideorbit planets beyond the snow line planets in both the galactic bulge and disk and free floating planets ffps the demographics of each population will provide unique constraints on planet formation over the past 5 years us microlensing campaigns with spitzer and ukirt have provided a powerful complement to international groundbased microlensing surveys with major breakthroughs in parallax measurements and probing new regions of the galaxy the scientific vitality of these projects has also promoted the development of the us microlensing community in the 2020s the us can continue to play a major role in groundbased microlensing by leveraging us assets to complement ongoing groundbased international surveys lsst and ukirt microlensing surveys would probe vast regions of the galaxy where planets form under drastically different conditions moreover while groundbased surveys will measure the planet massratio function beyond the snow line adaptive optics ao observations with elts would turn all of these mass ratios into masses and also distinguish between very wideorbit planets and genuine ffps to the extent possible cooperation of us scientists with international surveys should also be encouraged and supported
|
[['microlensing', 'can', 'access', 'planet', 'populations', 'that', 'no', 'other', 'method', 'can', 'probe', 'cold', 'wideorbit', 'planets', 'beyond', 'the', 'snow', 'line', 'planets', 'in', 'both', 'the', 'galactic', 'bulge', 'and', 'disk', 'and', 'free', 'floating', 'planets', 'ffps', 'the', 'demographics', 'of', 'each', 'population', 'will', 'provide', 'unique', 'constraints', 'on', 'planet', 'formation', 'over', 'the', 'past', '5', 'years', 'us', 'microlensing', 'campaigns', 'with', 'spitzer', 'and', 'ukirt', 'have', 'provided', 'a', 'powerful', 'complement', 'to', 'international', 'groundbased', 'microlensing', 'surveys', 'with', 'major', 'breakthroughs', 'in', 'parallax', 'measurements', 'and', 'probing', 'new', 'regions', 'of', 'the', 'galaxy', 'the', 'scientific', 'vitality', 'of', 'these', 'projects', 'has', 'also', 'promoted', 'the', 'development', 'of', 'the', 'us', 'microlensing', 'community', 'in', 'the', '2020s', 'the', 'us', 'can', 'continue', 'to', 'play', 'a', 'major', 'role', 'in', 'groundbased', 'microlensing', 'by', 'leveraging', 'us', 'assets', 'to', 'complement', 'ongoing', 'groundbased', 'international', 'surveys', 'lsst', 'and', 'ukirt', 'microlensing', 'surveys', 'would', 'probe', 'vast', 'regions', 'of', 'the', 'galaxy', 'where', 'planets', 'form', 'under', 'drastically', 'different', 'conditions', 'moreover', 'while', 'groundbased', 'surveys', 'will', 'measure', 'the', 'planet', 'massratio', 'function', 'beyond', 'the', 'snow', 'line', 'adaptive', 'optics', 'ao', 'observations', 'with', 'elts', 'would', 'turn', 'all', 'of', 'these', 'mass', 'ratios', 'into', 'masses', 'and', 'also', 'distinguish', 'between', 'very', 'wideorbit', 'planets', 'and', 'genuine', 'ffps', 'to', 'the', 'extent', 'possible', 'cooperation', 'of', 'us', 'scientists', 'with', 'international', 'surveys', 'should', 'also', 'be', 'encouraged', 'and', 'supported']]
|
[-0.09471865142359562, 0.09367068169984161, -0.10315563219368995, 0.07939956828798216, -0.20981564273284845, -0.07217869981877342, 0.061980263550871426, 0.3549840941943574, -0.17296824937916755, -0.36675033689543757, 0.099092372173153, -0.3217605322121748, -0.08927096396002956, 0.25469950427176413, -0.08217978243207194, 0.036426506539297854, 0.16799588752166397, -0.16854193838917503, 0.00418306284280465, -0.3470249202572885, 0.25340750933710016, 0.14534658278199392, 0.0865844211531515, -0.006995428570176561, 0.0022850215300610384, -0.0497359687476851, -0.14856689542138315, -0.016525353583478435, -0.21125133440082866, 0.07195468351830603, 0.3417155610831915, 0.23373564185584253, 0.26663099595623996, -0.3822982274835987, -0.19648858424775378, 0.12182382756805758, 0.19181675487437966, 0.007799665596019285, -0.01795841036568463, -0.34093834893158687, -0.006946841370045524, -0.20535297214159184, -0.2092620346613574, 0.007684434932709393, 0.04300501215578892, 0.051297687553049344, -0.2288870718186126, -0.008639469461187902, -0.025897349835824722, 0.12995575433632972, -0.10551222469225603, -0.09840627933477926, -0.057200861864329614, 0.15738577567240147, 0.018014076222862434, 0.04727191303150978, 0.17063958513593666, -0.1409251260086318, -0.07938135041346409, 0.4069306559899111, -0.08250942685852576, 0.0022575041548032124, 0.25552590031023187, -0.28708236176429375, -0.18607393258548888, 0.10128869772552676, 0.23733863763069524, 0.07309945350748093, -0.1835528480359497, 0.017003876783587422, 0.001952827984908807, 0.21198610764851353, 0.09419591807683488, 0.08265203249730174, 0.4585200535114278, 0.13468377762888173, 0.15083548208079348, 0.009411155559739443, -0.26547338085407485, -0.058940924413936675, -0.17949790435785562, -0.12112794970114206, -0.10353252308421586, 0.05652998878453143, -0.08665554780862894, -0.07360271118658106, 0.3256617753428033, 0.17686778643245318, 0.12281445588570894, 0.012381710802035685, 0.30322724574043886, -0.012156586755023905, 0.19026769260628648, 0.008852560118743285, 0.36141205130663423, 0.09903355998697586, 0.11706070289239, -0.19701176451893582, 0.10258756478115455, -0.048715959742338846]
|
1,803.07922
|
Self-assembly of magnetic iron oxide nanoparticles into cuboidal
superstructures
|
This chapter describes the synthesis and some characteristics of magnetic
iron oxide nanoparticles, mainly nanocubes, and focus on their self-assembly
into crystalline cuboids in dispersion. The influence of external magnetic
fields, the concentration of particles, and the temperature on the assembly
process is experimentally investigated.
|
cond-mat.soft physics.app-ph
|
this chapter describes the synthesis and some characteristics of magnetic iron oxide nanoparticles mainly nanocubes and focus on their selfassembly into crystalline cuboids in dispersion the influence of external magnetic fields the concentration of particles and the temperature on the assembly process is experimentally investigated
|
[['this', 'chapter', 'describes', 'the', 'synthesis', 'and', 'some', 'characteristics', 'of', 'magnetic', 'iron', 'oxide', 'nanoparticles', 'mainly', 'nanocubes', 'and', 'focus', 'on', 'their', 'selfassembly', 'into', 'crystalline', 'cuboids', 'in', 'dispersion', 'the', 'influence', 'of', 'external', 'magnetic', 'fields', 'the', 'concentration', 'of', 'particles', 'and', 'the', 'temperature', 'on', 'the', 'assembly', 'process', 'is', 'experimentally', 'investigated']]
|
[-0.13273922971760233, 0.21582752482758627, -0.003506218290163411, 0.004419935853163932, -0.01469684574339125, -0.04898299467232492, 0.012650279224746756, 0.44909632719225356, -0.2290335638862517, -0.35298157195664115, 0.051786131460943984, -0.2591165208568176, -0.11961424739824401, 0.1552058337463273, 0.034283008188423184, 0.004729029241328438, -0.06481924549572998, -0.039906486744681995, -0.008794840073419942, -0.21369729182786412, 0.3021790517183642, 0.05288214291342431, 0.33199851231442556, 0.09029539411680566, 0.07055584493403634, 0.01847429858106706, 0.0683390967340933, 0.017483426816761495, -0.20424694863872395, 0.11449295367217727, 0.16071756821539668, -0.02565890316747957, 0.17433563804046975, -0.48113359068002964, -0.20249853467361795, -0.0035327346064150333, 0.1467225925789939, 0.10991998741196261, -0.16154094206479688, -0.2596659210820993, 0.051462916202015346, -0.04302946283585495, -0.10898710526525975, 3.8250452942318386e-07, -0.0065529642005761465, 0.07456714811010492, -0.15484691423674424, 0.014086789306667116, 0.14523263827431948, 0.14692646467851267, -0.15828865141504342, -0.16185063481744794, -0.0650447672026025, 0.07050494892108772, 0.06182773423109514, -0.07900827114159863, 0.28885249607264996, -0.138556065922603, -0.036086253904634054, 0.37182607965336906, -0.00038991951280170016, -0.14121822669274278, 0.2043856971586744, -0.1729052778126465, -0.10717885738445652, 0.15930308107700614, 0.20892746042874125, 0.12846212944843702, -0.18582502593182856, 0.1195298878230258, 0.033630839983622235, 0.23687306294838587, 0.06663100320018, 0.004991585782004727, 0.27549313911133344, 0.2526118218070931, -0.042873945666684045, 0.18721367510863476, -0.06816759646559754, -0.028661032310790487, -0.1568847217441847, -0.23486393428304128, -0.17895469408896233, 0.023046529474150805, -0.07150540219315897, -0.24185130013566877, 0.41198222876215973, 0.14787378875124785, 0.1399540587535335, -0.07090931489235824, 0.25765100651996264, 0.020175132445163196, 0.04031684624755548, -0.06294144328890575, 0.2609808321764123, 0.23008787327756483, 0.1541431987658143, -0.28957924421669706, 0.12569815007348856, 0.016200628586941296]
|
1,803.07923
|
Holomorphic Frobenius actions for DQ-modules
|
Given a complex manifold endowed with a $\mathbb{C}^\times$-action and a
DQ-algebra equipped with a compatible holomorphic Frobenius action (F-action),
we prove that if the $\mathbb{C}^\times$-action is free and proper, then the
category of F-equivariant DQ-modules is equivalent to the category of modules
over the sheaf of invariant sections of the DQ-algebra. As an application, we
deduce the codimension three conjecture for formal microdifferential modules
from the one for DQ-modules on a symplectic manifold.
|
math.AG
|
given a complex manifold endowed with a mathbbctimesaction and a dqalgebra equipped with a compatible holomorphic frobenius action faction we prove that if the mathbbctimesaction is free and proper then the category of fequivariant dqmodules is equivalent to the category of modules over the sheaf of invariant sections of the dqalgebra as an application we deduce the codimension three conjecture for formal microdifferential modules from the one for dqmodules on a symplectic manifold
|
[['given', 'a', 'complex', 'manifold', 'endowed', 'with', 'a', 'mathbbctimesaction', 'and', 'a', 'dqalgebra', 'equipped', 'with', 'a', 'compatible', 'holomorphic', 'frobenius', 'action', 'faction', 'we', 'prove', 'that', 'if', 'the', 'mathbbctimesaction', 'is', 'free', 'and', 'proper', 'then', 'the', 'category', 'of', 'fequivariant', 'dqmodules', 'is', 'equivalent', 'to', 'the', 'category', 'of', 'modules', 'over', 'the', 'sheaf', 'of', 'invariant', 'sections', 'of', 'the', 'dqalgebra', 'as', 'an', 'application', 'we', 'deduce', 'the', 'codimension', 'three', 'conjecture', 'for', 'formal', 'microdifferential', 'modules', 'from', 'the', 'one', 'for', 'dqmodules', 'on', 'a', 'symplectic', 'manifold']]
|
[-0.1812756963706176, 0.0070119405117501235, -0.08263502103010459, 0.06572662054760647, -0.09073536124612604, -0.1466169962326863, -0.056668793889028686, 0.35565829218498296, -0.32987271951777597, -0.1585805061871984, 0.09685708263090678, -0.22091004433043834, -0.1327774070070258, 0.22057711758783885, -0.17858778719923327, -0.046648849407210945, 0.10320817309298685, 0.18740869323456927, -0.09981443555693009, -0.2288816393353045, 0.5263034592781748, -0.015817202388175897, 0.21034564961280142, 0.041678015954260315, 0.24270753050222993, 0.008326999929600528, 0.027988525080893722, 0.016193800100258417, -0.11992953539478808, 0.1744478845303612, 0.2793383536328162, 0.058406431497340754, 0.18069624481972174, -0.3561010455978768, -0.09600985456324582, 0.17037158744143588, 0.07837784594989249, -0.019304683046149355, 0.011364054945547, -0.28717465717345475, 0.15270819922110865, -0.20590334561254298, -0.13810830798798374, -0.06587557626355972, 0.04890438871350073, -0.01193397895965193, -0.2624518888869456, -0.08096477227019412, 0.06739952029726867, 0.1276103753197406, -0.1386025672005157, -0.04331588559517903, -0.10496511824728388, 0.07543538069751646, -0.02993619924943362, 0.08204830757625002, 0.11069616586236017, -0.08350720442831516, -0.12952900739785816, 0.35499871990510395, -0.1063531206679597, -0.27301606328359673, 0.1224465907019164, -0.1092709159278976, -0.16841060034265476, 0.12868792530415313, 0.0293946523219347, 0.14775970671325922, -0.004569558160645621, 0.1884211562557279, -0.12222911782030549, 0.07798873082335506, 0.07603294753602573, -0.01054693454477404, 0.13257368606448705, 0.15467260718412165, 0.11333810752922935, 0.08511992697604001, -0.025397100628885838, -0.0366431743837893, -0.37432146051100323, -0.2563643876729267, -0.08330335878500982, 0.19883458212550198, -0.08578306962029143, -0.1771930837138955, 0.4063567556174738, 0.026632435167474405, 0.22786411798026945, 0.1798509627979781, 0.24112694270110557, 0.035095289587375844, 0.08349278815356749, 0.05105914772887315, 0.1285945997174297, 0.24051888407474117, -0.053399974508543634, -0.06943945754069968, -0.05163361474073359, 0.1643658363393375]
|
1,803.07924
|
A brief description of operators associated to the quantum harmonic
oscillator on Schatten-von Neumann classes
|
In this note we study pseudo-multipliers associated to the harmonic
oscillator (also called Hermite multipliers) belonging to Schatten classes on
$L^2(\mathbb{R}^n)$. We also investigate the spectral trace of these operators.
|
math.FA
|
in this note we study pseudomultipliers associated to the harmonic oscillator also called hermite multipliers belonging to schatten classes on l2mathbbrn we also investigate the spectral trace of these operators
|
[['in', 'this', 'note', 'we', 'study', 'pseudomultipliers', 'associated', 'to', 'the', 'harmonic', 'oscillator', 'also', 'called', 'hermite', 'multipliers', 'belonging', 'to', 'schatten', 'classes', 'on', 'l2mathbbrn', 'we', 'also', 'investigate', 'the', 'spectral', 'trace', 'of', 'these', 'operators']]
|
[-0.09606355739136536, 0.07001773659139872, -0.00155459176748991, 0.12923644319719946, -0.06868700528672586, -0.06835416317917406, -0.023222814686596392, 0.42648512373367947, -0.31155527134736377, -0.13771771118044854, 0.10675721309380606, -0.269186648974816, -0.18799983374774457, 0.18384741796180606, -0.12662370366354783, 0.02982524873999258, 0.01902053163697322, 0.0680035307382544, -0.138197579421103, -0.17593048621589938, 0.4463759599874417, 0.002045149728655815, 0.15367523199335362, -0.001746109314262867, 0.018673133006086574, -0.0656509142369032, -0.07543670237064362, -0.0988693181425333, -0.1794079235754907, 0.19380302913486958, 0.20252508353441953, 0.06887994698869686, 0.27800867706537247, -0.33823501380781335, -0.10602571396157146, 0.26253923438489435, 0.14052584460005163, -0.05085695292800665, -0.011309006623923779, -0.28596232322355114, 0.041876376544435816, -0.15841756785909336, -0.16143327237417301, -0.13014414149026077, -0.016635038455327354, 0.13663334448356182, -0.26196171684811514, 0.04436459326922583, 0.11342763820042213, 0.034402438811957835, -0.1354030080139637, -0.09749200652974348, 0.05203854793993135, 0.027221686361978453, -0.009509181945274274, -0.04237132458171497, 0.029227219470582592, -0.003466523679283758, -0.0811114505243798, 0.31633525546640157, -0.10105372841159503, -0.2391082209845384, 0.17624593491200358, -0.22997012343257667, -0.238009293222179, -0.009975263786812624, 0.22280168778573473, 0.168055484816432, -0.15668004658073187, 0.11580201247707009, -0.073006038274616, 0.09357101414352656, 0.13442937539269526, 0.09188902548824747, 0.03726619054020072, -0.02641962468624115, 0.11968344956015547, 0.24774891268170904, -0.047233243932714684, -0.05279661874907712, -0.32867380951841674, -0.23565520731111367, -0.1929166581268267, 0.03562491536140442, -0.020550717397903404, -0.21295598509411018, 0.5376355138917764, 0.17275693314149976, 0.14711867761798203, 0.06285763091097275, 0.15444797438879806, 0.17826171051710843, 0.0758870737006267, 0.048301429285978276, 0.18380456641316414, 0.23395826338479916, 0.08827167881342272, -0.2523528576673319, -0.11883030997899671, 0.22973136886333426]
|
1,803.07925
|
Entropic No-Disturbance as a Physical Principle
|
The celebrated Bell-Kochen-Specker no-go theorem asserts that quantum
mechanics does not present the property of realism, the essence of the theorem
is the lack of a joint probability distributions for some experiment settings.
In this work, we exploit the information theoretic form of the theorem using
information measure instead of probabilistic measure and indicate that quantum
mechanics does not present such entropic realism neither. The entropic form of
Gleason's no-disturbance principle is developed and it turns out to be
characterized by the intersection of several entropic cones. Entropic
contextuality and entropic nonlocality are investigated in depth in this
framework. We show how one can construct monogamy relations using entropic cone
and basic Shannon-type inequalities. The general criterion for several entropic
tests to be monogamous is also developed, using the criterion, we demonstrate
that entropic nonlocal correlations are monogamous, entropic contextuality
tests are monogamous and entropic nonlocality and entropic contextuality are
also monogamous. Finally, we analyze the entropic monogamy relations for
multiparty and many-test case, which plays a crucial role in quantum network
communication.
|
quant-ph
|
the celebrated bellkochenspecker nogo theorem asserts that quantum mechanics does not present the property of realism the essence of the theorem is the lack of a joint probability distributions for some experiment settings in this work we exploit the information theoretic form of the theorem using information measure instead of probabilistic measure and indicate that quantum mechanics does not present such entropic realism neither the entropic form of gleasons nodisturbance principle is developed and it turns out to be characterized by the intersection of several entropic cones entropic contextuality and entropic nonlocality are investigated in depth in this framework we show how one can construct monogamy relations using entropic cone and basic shannontype inequalities the general criterion for several entropic tests to be monogamous is also developed using the criterion we demonstrate that entropic nonlocal correlations are monogamous entropic contextuality tests are monogamous and entropic nonlocality and entropic contextuality are also monogamous finally we analyze the entropic monogamy relations for multiparty and manytest case which plays a crucial role in quantum network communication
|
[['the', 'celebrated', 'bellkochenspecker', 'nogo', 'theorem', 'asserts', 'that', 'quantum', 'mechanics', 'does', 'not', 'present', 'the', 'property', 'of', 'realism', 'the', 'essence', 'of', 'the', 'theorem', 'is', 'the', 'lack', 'of', 'a', 'joint', 'probability', 'distributions', 'for', 'some', 'experiment', 'settings', 'in', 'this', 'work', 'we', 'exploit', 'the', 'information', 'theoretic', 'form', 'of', 'the', 'theorem', 'using', 'information', 'measure', 'instead', 'of', 'probabilistic', 'measure', 'and', 'indicate', 'that', 'quantum', 'mechanics', 'does', 'not', 'present', 'such', 'entropic', 'realism', 'neither', 'the', 'entropic', 'form', 'of', 'gleasons', 'nodisturbance', 'principle', 'is', 'developed', 'and', 'it', 'turns', 'out', 'to', 'be', 'characterized', 'by', 'the', 'intersection', 'of', 'several', 'entropic', 'cones', 'entropic', 'contextuality', 'and', 'entropic', 'nonlocality', 'are', 'investigated', 'in', 'depth', 'in', 'this', 'framework', 'we', 'show', 'how', 'one', 'can', 'construct', 'monogamy', 'relations', 'using', 'entropic', 'cone', 'and', 'basic', 'shannontype', 'inequalities', 'the', 'general', 'criterion', 'for', 'several', 'entropic', 'tests', 'to', 'be', 'monogamous', 'is', 'also', 'developed', 'using', 'the', 'criterion', 'we', 'demonstrate', 'that', 'entropic', 'nonlocal', 'correlations', 'are', 'monogamous', 'entropic', 'contextuality', 'tests', 'are', 'monogamous', 'and', 'entropic', 'nonlocality', 'and', 'entropic', 'contextuality', 'are', 'also', 'monogamous', 'finally', 'we', 'analyze', 'the', 'entropic', 'monogamy', 'relations', 'for', 'multiparty', 'and', 'manytest', 'case', 'which', 'plays', 'a', 'crucial', 'role', 'in', 'quantum', 'network', 'communication']]
|
[-0.10134519696733806, 0.12692034032823907, -0.19427711039857376, 0.1827380141537084, -0.06662741952662378, -0.23872217444735472, 0.05000940467729125, 0.29536361251632837, -0.2711879358123338, -0.2551577280784502, 0.018797728663505337, -0.2609447852388934, -0.20113572840535537, 0.1860318470984524, -0.1490548538669489, 0.10625560382424398, 0.018932752868940316, 0.01641806040695587, -0.038897011893379047, -0.2321026301617886, 0.3351495932397801, 0.02022152172934892, 0.31260977098230963, 0.15722043070736405, 0.09904630019234394, 0.04459506753009072, 0.009167573371425618, 0.1034944960725667, -0.18866554546087194, 0.16876541111255497, 0.2582845592013084, 0.23421476779202388, 0.31870730818779924, -0.4060479215519546, -0.21276301733044864, 0.15320662231466106, 0.0565217878821111, 0.11591806388064152, -0.0017803220977183692, -0.33677475351358355, 0.0034696370780164768, -0.1697862986840719, -0.09769595167973569, -0.1548892273405177, 0.0023260764279511084, -0.04686389244865453, -0.22445634341301926, 0.1889956334147597, 0.17128612741362303, 0.07392961826503039, 0.00840512340953357, -0.015150596250287193, 0.029912451374192916, 0.06151422256939546, -0.018187156124419512, -0.048406153834738966, 0.13826145906661919, -0.0479952581863049, -0.19301310544738784, 0.35123799029916397, 0.04552630810331022, -0.2544474178481154, 0.14120400698211175, -0.10467192426535063, -0.19552621352594607, -0.038185890634046045, 0.06274671496574355, 0.06644139877489368, -0.1615334449777228, 0.06043626776074742, -0.0902576808341194, 0.1543207046146732, 0.08321616222383454, 0.17799439827734226, 0.17745635563204454, 0.02646786359756059, 0.061888223687230154, 0.1906877067116046, -0.04564100257283466, -0.19557151439881257, -0.38865636438564505, -0.2434266660102578, -0.25724098395805284, 0.09303896539266895, -0.12552238974003135, -0.07406099029643418, 0.2648561933682961, 0.15060607768557316, 0.08147631103692707, 0.07855716476901868, 0.23133057295236475, 0.0813846136240267, 0.042039857453092674, 0.04594258677084432, 0.3005326173651008, 0.1910791474050669, 0.02615821585708926, -0.18819651293749703, 0.12786343988764837, 0.10495291855375738]
|
1,803.07926
|
A Distributed Control Framework of Multiple Unmanned Aerial Vehicles for
Dynamic Wildfire Tracking
|
Wild-land fire fighting is a hazardous job. A key task for firefighters is to
observe the "fire front" to chart the progress of the fire and areas that will
likely spread next. Lack of information of the fire front causes many
accidents. Using Unmanned Aerial Vehicles (UAVs) to cover wildfire is promising
because it can replace humans in hazardous fire tracking and significantly
reduce operation costs. In this paper we propose a distributed control
framework designed for a team of UAVs that can closely monitor a wildfire in
open space, and precisely track its development. The UAV team, designed for
flexible deployment, can effectively avoid in-flight collisions and cooperate
well with neighbors. They can maintain a certain height level to the ground for
safe flight above fire. Experimental results are conducted to demonstrate the
capabilities of the UAV team in covering a spreading wildfire.
|
cs.RO
|
wildland fire fighting is a hazardous job a key task for firefighters is to observe the fire front to chart the progress of the fire and areas that will likely spread next lack of information of the fire front causes many accidents using unmanned aerial vehicles uavs to cover wildfire is promising because it can replace humans in hazardous fire tracking and significantly reduce operation costs in this paper we propose a distributed control framework designed for a team of uavs that can closely monitor a wildfire in open space and precisely track its development the uav team designed for flexible deployment can effectively avoid inflight collisions and cooperate well with neighbors they can maintain a certain height level to the ground for safe flight above fire experimental results are conducted to demonstrate the capabilities of the uav team in covering a spreading wildfire
|
[['wildland', 'fire', 'fighting', 'is', 'a', 'hazardous', 'job', 'a', 'key', 'task', 'for', 'firefighters', 'is', 'to', 'observe', 'the', 'fire', 'front', 'to', 'chart', 'the', 'progress', 'of', 'the', 'fire', 'and', 'areas', 'that', 'will', 'likely', 'spread', 'next', 'lack', 'of', 'information', 'of', 'the', 'fire', 'front', 'causes', 'many', 'accidents', 'using', 'unmanned', 'aerial', 'vehicles', 'uavs', 'to', 'cover', 'wildfire', 'is', 'promising', 'because', 'it', 'can', 'replace', 'humans', 'in', 'hazardous', 'fire', 'tracking', 'and', 'significantly', 'reduce', 'operation', 'costs', 'in', 'this', 'paper', 'we', 'propose', 'a', 'distributed', 'control', 'framework', 'designed', 'for', 'a', 'team', 'of', 'uavs', 'that', 'can', 'closely', 'monitor', 'a', 'wildfire', 'in', 'open', 'space', 'and', 'precisely', 'track', 'its', 'development', 'the', 'uav', 'team', 'designed', 'for', 'flexible', 'deployment', 'can', 'effectively', 'avoid', 'inflight', 'collisions', 'and', 'cooperate', 'well', 'with', 'neighbors', 'they', 'can', 'maintain', 'a', 'certain', 'height', 'level', 'to', 'the', 'ground', 'for', 'safe', 'flight', 'above', 'fire', 'experimental', 'results', 'are', 'conducted', 'to', 'demonstrate', 'the', 'capabilities', 'of', 'the', 'uav', 'team', 'in', 'covering', 'a', 'spreading', 'wildfire']]
|
[-0.13196028617029595, 0.11369886354077607, -0.05870391249391105, 0.05206708993702907, -0.11359423518782326, -0.1525277114059362, 0.08276353338199745, 0.4163739448413253, -0.24114826240757894, -0.35153599137750763, 0.13923684817725895, -0.2858311701404293, -0.15710367616783413, 0.17395634518308928, -0.20437270301368293, 0.09965545883905078, 0.12329121826850395, 0.05104669572190485, 0.09127875811827835, -0.2604004536406137, 0.2052712777585839, 0.109564367557242, 0.2757844527190577, 0.058186528825899586, 0.12270933097493576, -0.0035053839383181185, -0.023264211075406313, -0.008413097894946178, -0.10738648165119634, 0.08204069627572608, 0.37406664999838946, 0.19708744367300016, 0.3483555944532984, -0.47605651358349454, -0.24116609462685623, 0.12883089960167934, 0.14512981132591246, 0.06676519363504162, -0.016427397890462696, -0.3599356040617244, 0.07026904657605984, -0.2206908416992519, -0.16231885683050173, -0.023240299449147035, 0.001735919219855633, 0.07531613041000026, -0.25748274224396384, -0.10556843291528316, -0.05202628917342938, 0.04170224145248843, -0.027999236302599054, -0.0340712034149975, -0.03242479519071316, 0.24558421236967357, -0.007035318716791355, 0.028057155176914723, 0.21598461806166191, -0.15498936643901592, -0.08356475339112673, 0.42202533992369556, 0.028994285490221552, -0.13606316661106474, 0.1941706780263404, -0.07025483241523034, -0.11890476871889809, 0.13875638264127904, 0.25821193628831274, 0.06120418258877988, -0.18608148779538977, -0.017356182136508223, 0.01856849430542853, 0.12164401130576152, 0.055276527441391304, -0.058886801131949246, 0.20810341694838522, 0.2670447275482325, 0.219079992103717, 0.08708537275379058, -0.13267357022009996, -0.10075474939690644, -0.21420066876129973, -0.1378641743148263, -0.11268618903704919, -0.03783809992536488, -0.006060153294028068, -0.11690705890052616, 0.3806509654548588, 0.21758764842525125, 0.11370708545412829, 0.0623503120231261, 0.3578836175535495, 0.022774157966422435, 0.09317826913967212, 0.09448307498314534, 0.17905797644764082, -0.046614812716143206, 0.15303852517778674, -0.206212585449167, 0.13706560444067387, -0.010382746508184937]
|
1,803.07927
|
New Quantum MDS codes constructed from Constacyclic codes
|
Quantum maximum-distance-separable (MDS) codes are an important class of
quantum codes. In this paper, using constacyclic codes and Hermitain
construction, we construct some new quantum MDS codes of the form $q=2am+t$,
$n=\frac{q^{2}+1}{a}$. Most of these quantum MDS codes are new in the sense
that their parameters are not covered be the codes available in the literature.
|
cs.IT math.IT
|
quantum maximumdistanceseparable mds codes are an important class of quantum codes in this paper using constacyclic codes and hermitain construction we construct some new quantum mds codes of the form q2amt nfracq21a most of these quantum mds codes are new in the sense that their parameters are not covered be the codes available in the literature
|
[['quantum', 'maximumdistanceseparable', 'mds', 'codes', 'are', 'an', 'important', 'class', 'of', 'quantum', 'codes', 'in', 'this', 'paper', 'using', 'constacyclic', 'codes', 'and', 'hermitain', 'construction', 'we', 'construct', 'some', 'new', 'quantum', 'mds', 'codes', 'of', 'the', 'form', 'q2amt', 'nfracq21a', 'most', 'of', 'these', 'quantum', 'mds', 'codes', 'are', 'new', 'in', 'the', 'sense', 'that', 'their', 'parameters', 'are', 'not', 'covered', 'be', 'the', 'codes', 'available', 'in', 'the', 'literature']]
|
[-0.20430434699047287, 0.1204453686821683, -0.05549166994696518, 0.11642140825498709, 0.032634654205362754, -0.26459423326096443, -0.055992785557876075, 0.38069486786734386, -0.351290751593451, -0.22757484746288578, 0.16466653760619251, -0.2766661289025028, -0.18393531199193225, 0.2811378764937509, -0.13462970038559638, 0.1633082971016367, 0.09717040201034045, -0.012372867327253774, -0.16853410938209942, -0.40042377755327047, 0.3757645625550792, 0.20372289000079036, 0.21472639400722845, -0.03285818364260332, -0.007621653782168649, -0.048885595839786924, -0.0454674981675058, 0.007081040989537284, -0.2681257195979684, 0.15108191344957306, 0.36285294323087725, 0.21745451392149026, 0.142003053008526, -0.3262463285991887, -0.24360054751961352, 0.07929100665562558, 0.13856808991470146, 0.28120202718759485, -0.08542610861290738, -0.16968694733420633, 0.12109448377675605, -0.23495442834946345, 0.027048823687265505, -0.01827580414993583, -0.05722674565776339, 0.03889229701708932, -0.20795910149144958, -0.08283434042109633, 0.05361175250683753, 0.11767681904207423, -0.011817942483280346, -0.17010088713031332, 0.1282539940790607, 0.16556737910218114, -0.08091351994366017, 0.028302614849482505, -0.0061411583743427155, -0.07038981152505104, -0.15406971741335923, 0.35373037259252565, 0.051732151874534366, -0.2147456761537436, 0.1038617165934927, -0.03031062032535391, -0.13998488541516774, 0.07806687148393325, 0.23254159099931987, 0.1368773969698627, -0.14677865103871193, 0.15169076995708858, -0.11001488863367517, 0.13276781619719738, 0.027794180569713407, 0.23738100887539815, 0.1969921525286616, 0.013500636188699951, -0.01246634851438257, 0.18015196157469995, -0.03425212119231528, -0.12097420582090909, -0.35199794714462085, -0.17232093470718027, -0.19890604983523208, 0.03384850313475153, -0.10696971972603658, -0.2348862833009576, 0.3767551406646885, 0.15134999737635535, 0.07198145207158237, 0.07838813150477297, 0.16676688201303752, -0.03780570590235996, 0.18591476681220503, 0.2847415928219287, 0.19590946050846228, 0.19267311562204137, -0.058218382070508765, -0.15567470143355852, 0.04657942322873563, 0.10441991229945759]
|
1,803.07928
|
Minimal Structural Perturbations for Network Controllability: Complexity
Analysis
|
Link (edge) addition/deletion or sensor/actuator failures are common
structural perturbations for real network systems. This paper is related to the
computation complexity of minimal (cost) link insertion, deletion and vertex
deletion with respect to structural controllability of networks. Formally,
given a structured system, we prove that: i) it is NP-hard to add the minimal
cost of links (including links between state variables and from inputs to state
variables) from a given set of links to make the system structurally
controllable, even with identical link costs or a prescribed input topology;
ii) it is NP-hard to determine the minimal cost of links whose deletion
deteriorates structural controllability of the system, even with identical link
costs or when the removable links are restricted in input links. It is also
proven that determining the minimal cost of inputs whose deletion causes
structural uncontrollability is NP-hard in the strong sense. The reductions in
their proofs are technically independent. These results may serve an answer to
the general hardness of optimally designing (modifying) a structurally
controllable network topology and of measuring controllability robustness
against link/actuator failures. Some fundamental approximation results for
these related problems are also provided.
|
math.OC cs.SY math.DS
|
link edge additiondeletion or sensoractuator failures are common structural perturbations for real network systems this paper is related to the computation complexity of minimal cost link insertion deletion and vertex deletion with respect to structural controllability of networks formally given a structured system we prove that i it is nphard to add the minimal cost of links including links between state variables and from inputs to state variables from a given set of links to make the system structurally controllable even with identical link costs or a prescribed input topology ii it is nphard to determine the minimal cost of links whose deletion deteriorates structural controllability of the system even with identical link costs or when the removable links are restricted in input links it is also proven that determining the minimal cost of inputs whose deletion causes structural uncontrollability is nphard in the strong sense the reductions in their proofs are technically independent these results may serve an answer to the general hardness of optimally designing modifying a structurally controllable network topology and of measuring controllability robustness against linkactuator failures some fundamental approximation results for these related problems are also provided
|
[['link', 'edge', 'additiondeletion', 'or', 'sensoractuator', 'failures', 'are', 'common', 'structural', 'perturbations', 'for', 'real', 'network', 'systems', 'this', 'paper', 'is', 'related', 'to', 'the', 'computation', 'complexity', 'of', 'minimal', 'cost', 'link', 'insertion', 'deletion', 'and', 'vertex', 'deletion', 'with', 'respect', 'to', 'structural', 'controllability', 'of', 'networks', 'formally', 'given', 'a', 'structured', 'system', 'we', 'prove', 'that', 'i', 'it', 'is', 'nphard', 'to', 'add', 'the', 'minimal', 'cost', 'of', 'links', 'including', 'links', 'between', 'state', 'variables', 'and', 'from', 'inputs', 'to', 'state', 'variables', 'from', 'a', 'given', 'set', 'of', 'links', 'to', 'make', 'the', 'system', 'structurally', 'controllable', 'even', 'with', 'identical', 'link', 'costs', 'or', 'a', 'prescribed', 'input', 'topology', 'ii', 'it', 'is', 'nphard', 'to', 'determine', 'the', 'minimal', 'cost', 'of', 'links', 'whose', 'deletion', 'deteriorates', 'structural', 'controllability', 'of', 'the', 'system', 'even', 'with', 'identical', 'link', 'costs', 'or', 'when', 'the', 'removable', 'links', 'are', 'restricted', 'in', 'input', 'links', 'it', 'is', 'also', 'proven', 'that', 'determining', 'the', 'minimal', 'cost', 'of', 'inputs', 'whose', 'deletion', 'causes', 'structural', 'uncontrollability', 'is', 'nphard', 'in', 'the', 'strong', 'sense', 'the', 'reductions', 'in', 'their', 'proofs', 'are', 'technically', 'independent', 'these', 'results', 'may', 'serve', 'an', 'answer', 'to', 'the', 'general', 'hardness', 'of', 'optimally', 'designing', 'modifying', 'a', 'structurally', 'controllable', 'network', 'topology', 'and', 'of', 'measuring', 'controllability', 'robustness', 'against', 'linkactuator', 'failures', 'some', 'fundamental', 'approximation', 'results', 'for', 'these', 'related', 'problems', 'are', 'also', 'provided']]
|
[-0.22166803233777735, 0.080573432916164, 0.0030816125668858356, 0.0656716497919732, -0.08762738619643357, -0.23358783446720446, 0.12134134986606081, 0.3881584783986757, -0.33777902372844554, -0.3033563032035024, 0.11240535371398055, -0.282766269783231, -0.2005789523142151, 0.13467200200746313, -0.14529565648472603, 0.10048243853980333, 0.11717396366474489, 0.05263491519190449, -0.024740242841775426, -0.28649946303577384, 0.3243236440984796, 0.04397294188103595, 0.23888361361944385, 0.0465515416764035, 0.053379972148394086, 0.017793916147543574, -0.0188880756763127, 0.06443017636698851, -0.09865530193528875, 0.11310499100531426, 0.279002736981075, 0.14910925623465723, 0.24396685624973, -0.44522841814515324, -0.16483892969718855, 0.154404880596003, 0.07656792524613255, 0.0971532599203269, 0.024052281903605227, -0.22838795556642935, 0.1266525557157413, -0.11479313911489791, -0.09325610175094913, -0.06653923380885916, 0.005119761239971322, 0.031067851109854407, -0.2610470718016643, 0.006908216930289523, 0.06367304807538605, 0.03250485545034028, -0.04167683989282561, -0.07344630428380211, -0.03790862996165314, 0.1705460394740273, 0.006012015448214359, 0.036182965471955375, 0.0893209261429028, -0.1627437212267959, -0.14087458899919997, 0.36960978189688076, 0.05236365289929572, -0.2543104097724975, 0.2286484591292305, -0.03536827604076703, -0.15005472285126906, 0.1328975028670466, 0.15381948196412068, 0.03770849914948276, -0.15441894872976206, 0.047027648869397226, -0.02636923489321745, 0.16525426091923726, 0.08808240647968978, 0.08610520635625464, 0.13211613346326423, 0.15539887149974274, 0.15060046211821246, 0.18460461660897778, 0.030032897915103576, -0.08736328292072443, -0.2743255314344043, -0.12429264750507177, -0.18458023939783932, 0.045487116218949256, -0.12366062039681601, -0.1957297020650308, 0.3812107033954436, 0.11846123940338191, 0.18254990497401657, 0.12441897727134613, 0.2905757826928498, 0.08894208085508981, 0.03684413950666005, 0.1295842558842796, 0.17295606438566064, 0.14992361199793391, 0.038962278164026004, -0.19704185251185563, 0.17051835715312375, 0.034836378272778856]
|
1,803.07929
|
Symplectic vortex equations for Kahler cones over Sasakian manifolds
|
We obtain a Hitchin-Kobayashi-type correspondence for symplectic vortex
equations, with the target a Kahler cone over a compact Sasakian manifold. We
show that the correspondence reduces to studying the existence and uniqueness
of Kazdan-Warner equations. Using this, we construct a map between the moduli
space of solutions to the symplectic vortex equations and effective divisors.
|
math.DG math-ph math.MP
|
we obtain a hitchinkobayashitype correspondence for symplectic vortex equations with the target a kahler cone over a compact sasakian manifold we show that the correspondence reduces to studying the existence and uniqueness of kazdanwarner equations using this we construct a map between the moduli space of solutions to the symplectic vortex equations and effective divisors
|
[['we', 'obtain', 'a', 'hitchinkobayashitype', 'correspondence', 'for', 'symplectic', 'vortex', 'equations', 'with', 'the', 'target', 'a', 'kahler', 'cone', 'over', 'a', 'compact', 'sasakian', 'manifold', 'we', 'show', 'that', 'the', 'correspondence', 'reduces', 'to', 'studying', 'the', 'existence', 'and', 'uniqueness', 'of', 'kazdanwarner', 'equations', 'using', 'this', 'we', 'construct', 'a', 'map', 'between', 'the', 'moduli', 'space', 'of', 'solutions', 'to', 'the', 'symplectic', 'vortex', 'equations', 'and', 'effective', 'divisors']]
|
[-0.22581897900198344, 0.011615231331368839, -0.13980744996418557, 0.11020672856614476, -0.1472828629323178, -0.10824453951445995, 0.0051207222104831425, 0.3097888515848253, -0.29076700333367894, -0.2135766794629119, 0.08313904261147534, -0.24157449873854164, -0.17593473441795343, 0.15710693803891815, -0.09982931472499061, 0.012219331054775804, 0.08601814022943101, 0.010947226305250768, -0.20719921252155607, -0.2281585450594624, 0.4935213268769008, -0.06423795959670786, 0.23139043693879136, 0.06675021350383759, 0.24376233206647965, -0.04231967272978552, 0.04321710515284428, 0.0017223039860794044, -0.18711246717012492, 0.15057913858995395, 0.2946151057387599, 0.05328552293832655, 0.14982720564498944, -0.4059291154974037, -0.17931768487862967, 0.1959814382199612, 0.11830546258500328, 0.10290088725310785, -0.0385644285146285, -0.31248722028815085, 0.10245572962729191, -0.08077354705030168, -0.24700779769638623, -0.15008243177672503, 0.024099782143753988, 0.034922421892622006, -0.21388629768302458, -0.01256093819446741, 0.0700300606140108, 0.05136445173303838, -0.16531265359716835, -0.00522437998680053, -0.0778646992209057, 0.04753349152290159, 0.028544650952055776, 0.07203623635211477, 0.04379873449431249, -0.12572877210375197, -0.06293221125896606, 0.352340498732196, -0.13735214208632154, -0.32838684254912315, 0.11016147131859153, -0.10789749866213512, -0.11942098017661246, 0.13524880578916054, 0.11850078278048723, 0.20129102991066045, -0.05026880482694617, 0.15602183195167324, -0.13414473434979166, 0.06702085807747035, 0.13474829343182068, -0.04622182561326082, 0.14816146216320772, 0.15338936990506394, 0.1464815771000253, 0.1308385338720486, -0.04028254866393076, -0.1188152073710053, -0.36128827067161046, -0.23441688198578992, -0.07110666953613637, 0.18846265111049568, -0.14417074925074336, -0.18558827957517846, 0.3941127120396467, 0.05465273572890847, 0.21013445007782947, 0.13378638681024313, 0.20737339449287565, 0.06612059655081895, 0.01759568757067124, 0.1045861681750803, 0.19865491955230632, 0.2415032992484393, 0.05345989833370334, -0.21067481012842446, -0.1403150800443082, 0.21543914576371512]
|
1,803.0793
|
A 30nA Quiescent 80nW to 14mW Power Range Shock-Optimized SECE-based
Piezoelectric Harvesting Interface with 420% Harvested Energy Improvement
|
Piezoelectric Energy Harvesters (PEH) are usually used to convert mechanical
energy (vibration, shocks) into electrical energy, in order to supply
energy-autonomous sensor nodes in industrial, biomedical or domotic
applications. Non-linear extraction strategies such as Synchronous Electrical
Charge Extraction (SECE) [1-2], energy investing [3] or Synchronized Switch
Harvesting on Inductor (SSHI) [4] have been developed to maximize the extracted
energy from harmonic excitations. However, in most of today's applications,
vibrations are not periodic and mechanical shocks occur at unpredictable rates
[4]. SSHI interfaces naturally seemed to be the most appropriate candidate for
harvesting shocks as they exhibit outstanding performance in periodic
excitations [4]. However, the SSHI strategy presents inherent weaknesses while
harvesting shocks, since the invested energy stored in the piezoelectric
capacitance cannot be recovered. In this work, we propose a self-starting,
battery-less, 0.55mm 2 integrated energy harvesting interface based on SECE
strategy which has been optimized to work under shock stimulus. Due to the
sporadic nature of mechanical shocks which imply long periods of inactivity and
brief energy peaks, the interface's average consumption is optimized by
minimizing the quiescent power. A dedicated energy saving sequencing has thus
been designed, reducing the static current to 30nA and enabling energy to be
extracted with only one single 8$\mu$J shock occurring every 100s. Our
SECE-based circuit features a shock FoM 1.6x greater than previous SSHI-based
interfaces [4]. The proposed system depicted in Fig.1 is made of a negative
voltage converter rectifying the PEH output voltage, and a SECE power path
controlled by a sequenced circuit. The sequencing is divided in 4 phases and
the associated time diagrams are illustrated in Fig.2. During the sleeping mode
T1, all blocks except the shock detection (SD) are turned off. During the
starting phase, the energy is stored in CASIC through a cold-start path,
increasing VASIC. This will progressively turn on the SD. Next, when stress
applied to the piezoelectric material leads to an increase in VREC, the SD
checks if the electrical energy
|
physics.app-ph
|
piezoelectric energy harvesters peh are usually used to convert mechanical energy vibration shocks into electrical energy in order to supply energyautonomous sensor nodes in industrial biomedical or domotic applications nonlinear extraction strategies such as synchronous electrical charge extraction sece 12 energy investing 3 or synchronized switch harvesting on inductor sshi 4 have been developed to maximize the extracted energy from harmonic excitations however in most of todays applications vibrations are not periodic and mechanical shocks occur at unpredictable rates 4 sshi interfaces naturally seemed to be the most appropriate candidate for harvesting shocks as they exhibit outstanding performance in periodic excitations 4 however the sshi strategy presents inherent weaknesses while harvesting shocks since the invested energy stored in the piezoelectric capacitance cannot be recovered in this work we propose a selfstarting batteryless 055mm 2 integrated energy harvesting interface based on sece strategy which has been optimized to work under shock stimulus due to the sporadic nature of mechanical shocks which imply long periods of inactivity and brief energy peaks the interfaces average consumption is optimized by minimizing the quiescent power a dedicated energy saving sequencing has thus been designed reducing the static current to 30na and enabling energy to be extracted with only one single 8muj shock occurring every 100s our secebased circuit features a shock fom 16x greater than previous sshibased interfaces 4 the proposed system depicted in fig1 is made of a negative voltage converter rectifying the peh output voltage and a sece power path controlled by a sequenced circuit the sequencing is divided in 4 phases and the associated time diagrams are illustrated in fig2 during the sleeping mode t1 all blocks except the shock detection sd are turned off during the starting phase the energy is stored in casic through a coldstart path increasing vasic this will progressively turn on the sd next when stress applied to the piezoelectric material leads to an increase in vrec the sd checks if the electrical energy
|
[['piezoelectric', 'energy', 'harvesters', 'peh', 'are', 'usually', 'used', 'to', 'convert', 'mechanical', 'energy', 'vibration', 'shocks', 'into', 'electrical', 'energy', 'in', 'order', 'to', 'supply', 'energyautonomous', 'sensor', 'nodes', 'in', 'industrial', 'biomedical', 'or', 'domotic', 'applications', 'nonlinear', 'extraction', 'strategies', 'such', 'as', 'synchronous', 'electrical', 'charge', 'extraction', 'sece', '12', 'energy', 'investing', '3', 'or', 'synchronized', 'switch', 'harvesting', 'on', 'inductor', 'sshi', '4', 'have', 'been', 'developed', 'to', 'maximize', 'the', 'extracted', 'energy', 'from', 'harmonic', 'excitations', 'however', 'in', 'most', 'of', 'todays', 'applications', 'vibrations', 'are', 'not', 'periodic', 'and', 'mechanical', 'shocks', 'occur', 'at', 'unpredictable', 'rates', '4', 'sshi', 'interfaces', 'naturally', 'seemed', 'to', 'be', 'the', 'most', 'appropriate', 'candidate', 'for', 'harvesting', 'shocks', 'as', 'they', 'exhibit', 'outstanding', 'performance', 'in', 'periodic', 'excitations', '4', 'however', 'the', 'sshi', 'strategy', 'presents', 'inherent', 'weaknesses', 'while', 'harvesting', 'shocks', 'since', 'the', 'invested', 'energy', 'stored', 'in', 'the', 'piezoelectric', 'capacitance', 'can', 'not', 'be', 'recovered', 'in', 'this', 'work', 'we', 'propose', 'a', 'selfstarting', 'batteryless', '055mm', '2', 'integrated', 'energy', 'harvesting', 'interface', 'based', 'on', 'sece', 'strategy', 'which', 'has', 'been', 'optimized', 'to', 'work', 'under', 'shock', 'stimulus', 'due', 'to', 'the', 'sporadic', 'nature', 'of', 'mechanical', 'shocks', 'which', 'imply', 'long', 'periods', 'of', 'inactivity', 'and', 'brief', 'energy', 'peaks', 'the', 'interfaces', 'average', 'consumption', 'is', 'optimized', 'by', 'minimizing', 'the', 'quiescent', 'power', 'a', 'dedicated', 'energy', 'saving', 'sequencing', 'has', 'thus', 'been', 'designed', 'reducing', 'the', 'static', 'current', 'to', '30na', 'and', 'enabling', 'energy', 'to', 'be', 'extracted', 'with', 'only', 'one', 'single', '8muj', 'shock', 'occurring', 'every', '100s', 'our', 'secebased', 'circuit', 'features', 'a', 'shock', 'fom', '16x', 'greater', 'than', 'previous', 'sshibased', 'interfaces', '4', 'the', 'proposed', 'system', 'depicted', 'in', 'fig1', 'is', 'made', 'of', 'a', 'negative', 'voltage', 'converter', 'rectifying', 'the', 'peh', 'output', 'voltage', 'and', 'a', 'sece', 'power', 'path', 'controlled', 'by', 'a', 'sequenced', 'circuit', 'the', 'sequencing', 'is', 'divided', 'in', '4', 'phases', 'and', 'the', 'associated', 'time', 'diagrams', 'are', 'illustrated', 'in', 'fig2', 'during', 'the', 'sleeping', 'mode', 't1', 'all', 'blocks', 'except', 'the', 'shock', 'detection', 'sd', 'are', 'turned', 'off', 'during', 'the', 'starting', 'phase', 'the', 'energy', 'is', 'stored', 'in', 'casic', 'through', 'a', 'coldstart', 'path', 'increasing', 'vasic', 'this', 'will', 'progressively', 'turn', 'on', 'the', 'sd', 'next', 'when', 'stress', 'applied', 'to', 'the', 'piezoelectric', 'material', 'leads', 'to', 'an', 'increase', 'in', 'vrec', 'the', 'sd', 'checks', 'if', 'the', 'electrical', 'energy']]
|
[-0.16683680867715348, 0.13627694855772163, -0.026881957862590008, 0.02964997566827338, -0.0655741739098412, -0.1912643915068393, 0.05186558750275279, 0.4048732062837985, -0.2741624810479036, -0.3245116847681862, 0.09045328770987573, -0.2795766568551387, -0.08918056816640209, 0.21927474062625796, -0.06370862264395039, 0.033444056964865264, 0.05165459630375139, 0.014890905203460208, 0.01180708601329522, -0.20216266354371873, 0.19549890812754783, 0.10697004666393826, 0.322681926154224, 0.04982911857230171, 0.08912620146220661, -0.03450406946943974, 0.018013991333991782, -0.015299868592600747, -0.07823561398920638, 0.0840581426853198, 0.2998943568361093, 0.05782500844132561, 0.2713177435526572, -0.49733956837749205, -0.2300087062473702, 0.10992646785133817, 0.1502225020094528, 0.07628601860701806, -0.04725784758204519, -0.21111369026589824, 0.09051695746490064, -0.18048373626753966, -0.06725678494275544, -0.015694826787680017, 0.02080989111036445, 0.060195428823197776, -0.21666741973468076, 0.0591821479230301, 0.02065409144540419, 0.038647583632503646, -0.08307684379676211, -0.11237976934602688, -0.06300564609232977, 0.1094899262849066, 0.039760858545114644, 0.033451175052785775, 0.20148373389528842, -0.11494137958269508, -0.09638547026291142, 0.35563743278613413, 0.006573653711788313, -0.1425262790371307, 0.16182875846667835, -0.07954593388857124, -0.07392208991141415, 0.19823513534921003, 0.17257894937680146, 0.03548290233513648, -0.17902707582365213, 0.00808611064855549, 0.10618708480361304, 0.19154500725861884, 0.12129253038927634, 0.0363527616027908, 0.2136853051151463, 0.19545438247036503, 0.049973785886113065, 0.14624582595341315, -0.0898333354621895, -0.044839179428001266, -0.22437717145630898, -0.13261356218601938, -0.17997598436048523, 0.07224562446246971, -0.047463035962906686, -0.1234858691629974, 0.4009268397517572, 0.11388089407722805, 0.13531694364053273, -0.011413959210384579, 0.31974795874428713, 0.1322727746288858, 0.10169938561358602, 0.09715260783677508, 0.2573066098387774, 0.0825212618078907, 0.17699369362619274, -0.2188062380902858, 0.07123231090027897, -0.011307829598579962]
|
1,803.07931
|
Linear independence in the rational homology cobordism group
|
We give simple homological conditions for a rational homology 3-sphere Y to
have infinite order in the rational homology cobordism group, and for a
collection of rational homology spheres to be linearly independent. These
translate immediately to statements about knot concordance when Y is the
branched double cover of a knot, recovering some results of Livingston and
Naik. The statements depend only on the homology groups of the 3-manifolds, but
are proven through an analysis of correction terms and their behavior under
connected sums.
|
math.GT
|
we give simple homological conditions for a rational homology 3sphere y to have infinite order in the rational homology cobordism group and for a collection of rational homology spheres to be linearly independent these translate immediately to statements about knot concordance when y is the branched double cover of a knot recovering some results of livingston and naik the statements depend only on the homology groups of the 3manifolds but are proven through an analysis of correction terms and their behavior under connected sums
|
[['we', 'give', 'simple', 'homological', 'conditions', 'for', 'a', 'rational', 'homology', '3sphere', 'y', 'to', 'have', 'infinite', 'order', 'in', 'the', 'rational', 'homology', 'cobordism', 'group', 'and', 'for', 'a', 'collection', 'of', 'rational', 'homology', 'spheres', 'to', 'be', 'linearly', 'independent', 'these', 'translate', 'immediately', 'to', 'statements', 'about', 'knot', 'concordance', 'when', 'y', 'is', 'the', 'branched', 'double', 'cover', 'of', 'a', 'knot', 'recovering', 'some', 'results', 'of', 'livingston', 'and', 'naik', 'the', 'statements', 'depend', 'only', 'on', 'the', 'homology', 'groups', 'of', 'the', '3manifolds', 'but', 'are', 'proven', 'through', 'an', 'analysis', 'of', 'correction', 'terms', 'and', 'their', 'behavior', 'under', 'connected', 'sums']]
|
[-0.22316187816128755, 0.07078528192626739, -0.16415949826616616, 0.08937527732286114, -0.10399511476723655, -0.189365435519167, 0.024990102081487532, 0.33872865708101363, -0.32373168504619526, -0.2653465875967716, 0.14554219217167147, -0.26011932550352956, -0.14745475243017564, 0.2082320220790626, -0.178539646113114, -0.024473967751310693, 0.0509553437087951, 0.09965097847383558, -0.071951618961369, -0.34769087890163064, 0.36210230093759793, -0.06725860724136942, 0.15312478630360038, 0.1279431580575571, 0.09716069663409144, 0.00952498374750749, -0.05988252616953105, 0.013864583535385984, -0.20936741469250547, 0.10403837381108176, 0.3260644995053077, 0.011320902459331029, 0.1086319178076727, -0.3899214224934223, -0.11967061612466794, 0.1596298963829343, 0.13590335381394697, -0.022733012280826057, 0.021936413791817835, -0.2758664788367848, 0.11468418891586009, -0.1618422674503, -0.10926703350352389, -0.09246963920027372, 0.03265863880958585, 0.08289778545925704, -0.15833764677379458, -0.050251763413793275, 0.06566250165702686, 0.12565273221670872, -0.01561245157305772, -0.08734019866789736, -0.02253373138540025, 0.18554691992418762, 0.06293010998550537, 0.0686217593638936, 0.13286285038616152, -0.1102311923390343, -0.1276408676058054, 0.3716135532318038, -0.04074466144499768, -0.27248906687877716, 0.12986868006798127, -0.14336311651970304, -0.2505984433006406, 0.23045789217576385, 0.02289208077958652, 0.11859658767934889, -0.013548985243687639, 0.1320970210979881, -0.12387991448243459, 0.1288184309932625, 0.10937869348674126, -0.04052267336547153, 0.1787891475417252, 0.03880584629951045, 0.10964147794653573, 0.11677954812850137, 0.013142907961515621, -0.0663321997992517, -0.32076040881552864, -0.2315013269184246, -0.10886045081895732, 0.13556863101707894, -0.14409320044744942, -0.22092823706667072, 0.39810597413175164, 0.006866181823646738, 0.16179880292509638, 0.19737816294876948, 0.23774651457400373, 0.019968929290327998, 0.02938279061622563, 0.01719851093366742, 0.11878807606193559, 0.22328612895771152, -0.04700348451955333, -0.06839929366140582, 0.026079486365363534, 0.22854048135923222]
|
1,803.07932
|
C-image partition regularity near zero
|
In \cite{dehind1}, the concept of image partition regularity near zero was
first instigated. In contrast to the finite case , infinite image partition
regular matrices near zero are very fascinating to analyze. In this regard the
abstraction of Centrally image partition regular matrices near zero was
introduced in \cite{biswaspaul}. In this paper we propose the notion of
matrices that are C-image partition regular near zero for dense subsemigropus
of $((0,\infty),+)$.
|
math.GN math.CO math.GR
|
in citedehind1 the concept of image partition regularity near zero was first instigated in contrast to the finite case infinite image partition regular matrices near zero are very fascinating to analyze in this regard the abstraction of centrally image partition regular matrices near zero was introduced in citebiswaspaul in this paper we propose the notion of matrices that are cimage partition regular near zero for dense subsemigropus of 0infty
|
[['in', 'citedehind1', 'the', 'concept', 'of', 'image', 'partition', 'regularity', 'near', 'zero', 'was', 'first', 'instigated', 'in', 'contrast', 'to', 'the', 'finite', 'case', 'infinite', 'image', 'partition', 'regular', 'matrices', 'near', 'zero', 'are', 'very', 'fascinating', 'to', 'analyze', 'in', 'this', 'regard', 'the', 'abstraction', 'of', 'centrally', 'image', 'partition', 'regular', 'matrices', 'near', 'zero', 'was', 'introduced', 'in', 'citebiswaspaul', 'in', 'this', 'paper', 'we', 'propose', 'the', 'notion', 'of', 'matrices', 'that', 'are', 'cimage', 'partition', 'regular', 'near', 'zero', 'for', 'dense', 'subsemigropus', 'of', '0infty']]
|
[-0.11608211168398459, 0.12141178192740137, -0.0661941730755974, 0.07219750271531555, -0.033530849794095215, -0.11147581111413962, -0.0019787449061616576, 0.36497629292760836, -0.26014621006889327, -0.18099283135608968, 0.10875282902094169, -0.3027639461850578, -0.16495291510540427, 0.06415600432647449, -0.1402414348258665, 0.06034883897695126, 0.020622563350832825, 0.10934710821531939, -0.13204164801264237, -0.250612273276078, 0.34907968287271535, 0.021200745098405714, 0.2955787302643964, 0.06505467937412587, 0.04856691355675911, -0.0038445470149092603, -0.004783065171178543, 0.02088134207367671, -0.12988302862736004, 0.09341989502056756, 0.31878507137298584, 0.10297347990457308, 0.27922957687582256, -0.395042895706314, -0.12587932244676983, 0.15641370558208137, 0.19773852691816335, 0.05498671569776806, -0.03921606967395002, -0.2207278807358252, 0.18919973110667232, -0.1480985234745524, -0.17996483083080614, -0.020587371014919358, 0.03222146177325736, -0.04038850110814427, -0.24935290297832002, 0.03012936892495914, 0.09750189455790502, 0.07476345191455701, -0.06345251607567523, -0.10028731453260689, -0.006961141321384771, 0.09924520549336166, -0.02607248971859614, 0.04266169655955199, 0.05852743868264511, -0.12464651907794178, -0.05342147411835013, 0.32570662755857815, -0.03586229521103881, -0.22599823389089468, 0.17600817295412222, -0.210790324053078, -0.1645556578948868, 0.14346467810824062, 0.15116204682801088, 0.13361264302423506, -0.11999860343833764, 0.17400973024919178, -0.11337365791427367, 0.07142565066389965, 0.1679045747485802, 0.022910291547745917, 0.21372542122491833, 0.1193222159406904, 0.13733945977097997, 0.25756702329399006, -0.04869514584513099, -0.11629445235611814, -0.2652475387140205, -0.12053915659304369, -0.2392123547862425, 0.043768464919236125, -0.08026572186358724, -0.256861364497154, 0.3882886929381074, 0.15354485465495876, 0.22246484825331153, 0.08229751766339177, 0.2442867383678359, 0.1142264652545705, 0.043239305141579476, 0.021187158668357315, 0.12475162507458167, 0.14199355995338975, 0.09864185713796002, -0.15400064815626, 0.00201698276919849, 0.14458042325339082]
|
1,803.07933
|
Neutrino mixing in SO(10) GUTs with non-abelian flavor symmetry in the
hidden sector
|
The relation between the mixing matrices of leptons and quarks:
$U_{\rm{PMNS}} \approx V_{\rm{CKM}}^\dagger U_0$, where $U_0$ is a matrix of
special forms (e.g. BM, TBM), can be a clue for understanding the lepton mixing
and neutrino masses. It may imply the Grand unification and existence of a
hidden sector with certain symmetry which generates $U_0$ and leads to the
smallness of neutrino masses. We apply the residual symmetry approach to obtain
$U_0$. The residual symmetries of both the visible and hidden sectors are
$\mathbb{Z}_{2} \times \mathbb{Z}_{2}$. Their embedding in a unified flavor
group is considered. We find that there are only several possible structures of
$U_0$, including the BM mixing and matrices with elements determined by the
golden ratio. Realization of the BM scenario based on the $SO(10)$ GUT with the
$S_4$ flavor group is presented. Generic features of this scenario are
discussed, in particular, the prediction of CP phase
$144^{\circ}\lesssim\delta_{\rm CP}\lesssim 210^{\circ}$ in the minimal
version.
|
hep-ph hep-ex
|
the relation between the mixing matrices of leptons and quarks u_rmpmns approx v_rmckmdagger u_0 where u_0 is a matrix of special forms eg bm tbm can be a clue for understanding the lepton mixing and neutrino masses it may imply the grand unification and existence of a hidden sector with certain symmetry which generates u_0 and leads to the smallness of neutrino masses we apply the residual symmetry approach to obtain u_0 the residual symmetries of both the visible and hidden sectors are mathbbz_2 times mathbbz_2 their embedding in a unified flavor group is considered we find that there are only several possible structures of u_0 including the bm mixing and matrices with elements determined by the golden ratio realization of the bm scenario based on the so10 gut with the s_4 flavor group is presented generic features of this scenario are discussed in particular the prediction of cp phase 144circlesssimdelta_rm cplesssim 210circ in the minimal version
|
[['the', 'relation', 'between', 'the', 'mixing', 'matrices', 'of', 'leptons', 'and', 'quarks', 'u_rmpmns', 'approx', 'v_rmckmdagger', 'u_0', 'where', 'u_0', 'is', 'a', 'matrix', 'of', 'special', 'forms', 'eg', 'bm', 'tbm', 'can', 'be', 'a', 'clue', 'for', 'understanding', 'the', 'lepton', 'mixing', 'and', 'neutrino', 'masses', 'it', 'may', 'imply', 'the', 'grand', 'unification', 'and', 'existence', 'of', 'a', 'hidden', 'sector', 'with', 'certain', 'symmetry', 'which', 'generates', 'u_0', 'and', 'leads', 'to', 'the', 'smallness', 'of', 'neutrino', 'masses', 'we', 'apply', 'the', 'residual', 'symmetry', 'approach', 'to', 'obtain', 'u_0', 'the', 'residual', 'symmetries', 'of', 'both', 'the', 'visible', 'and', 'hidden', 'sectors', 'are', 'mathbbz_2', 'times', 'mathbbz_2', 'their', 'embedding', 'in', 'a', 'unified', 'flavor', 'group', 'is', 'considered', 'we', 'find', 'that', 'there', 'are', 'only', 'several', 'possible', 'structures', 'of', 'u_0', 'including', 'the', 'bm', 'mixing', 'and', 'matrices', 'with', 'elements', 'determined', 'by', 'the', 'golden', 'ratio', 'realization', 'of', 'the', 'bm', 'scenario', 'based', 'on', 'the', 'so10', 'gut', 'with', 'the', 's_4', 'flavor', 'group', 'is', 'presented', 'generic', 'features', 'of', 'this', 'scenario', 'are', 'discussed', 'in', 'particular', 'the', 'prediction', 'of', 'cp', 'phase', '144circlesssimdelta_rm', 'cplesssim', '210circ', 'in', 'the', 'minimal', 'version']]
|
[-0.1425394313052309, 0.2494256381109795, -0.018092493683379753, 0.11631785833970736, -0.0741586145591843, -0.15669886991868612, 0.028821197314814855, 0.3250126151666289, -0.25177279299770305, -0.2585536854652067, 0.11132813396397978, -0.2513385116703979, -0.09633869827219765, 0.09361752064204683, -0.006867909613765435, 0.003558254441599441, 0.011818093291842958, 0.01928462909254568, -0.1358344608577717, -0.19190801784861833, 0.31203276652909717, -0.03382545246383528, 0.27328952743970103, 0.03469341545931849, 0.09729870935914174, -0.0581241386023417, -0.004661497285626098, -0.1046226279493543, -0.08392527435163037, 0.0758067289552974, 0.15760556650439314, 0.10990537877736334, 0.09411882373254771, -0.39037222824869006, -0.16325349480163281, 0.1682869851911818, 0.10472552115704448, 0.07421019664445125, -0.10738001861594301, -0.3074111691584774, 0.1071867820064178, -0.17680516708763985, -0.11959739515764846, -0.08225145779422247, -0.023474776377791867, -0.06933289821095326, -0.36293263282943394, 0.12218057400747842, 0.014717456361193672, 0.0014574905473958043, -0.01674250312441704, -0.16662894478341675, -0.05884891373464485, 0.07564088789855733, 0.17466396701010858, 0.008218856528401375, 0.07836332796841519, -0.14155917965770498, -0.08389261317914169, 0.4748139796547251, -0.0491877331282773, -0.199262303297729, 0.135607627897639, -0.1516582217140525, -0.1557035648836176, 0.0640108059715857, 0.13588679798580464, 0.05280263097256763, -0.11459481819636291, 0.16720771704103457, -0.13474240500002102, 0.15412119607398517, 0.038303255958762626, 0.014102417029123874, 0.21385122119187336, 0.1767744852604308, 0.08642901165496095, 0.0076972946541359515, -0.06249129742511785, -0.09179951351027923, -0.3956683992219517, -0.12498301997768625, -0.11756619796525151, 0.0787583004829346, -0.1136828159658144, -0.12213961027100001, 0.44028807112496665, 0.10597461274615032, 0.2601783314531097, 0.03484960440378879, 0.20749037958121572, 0.07931793243106869, 0.10048636026357854, 0.039940712221721617, 0.22070120765334544, 0.16901821798486696, 0.06428665578977077, -0.23653345802050157, 0.022159722941818043, 0.12412803641861317]
|
1,803.07934
|
Probing the quiet solar atmosphere from the photosphere to the corona
|
We investigate the morphology and temporal variability of a quiet Sun network
region in different solar layers. The emission in several EUV spectral lines
through both raster and slot time series, recorded by EIS/Hinode is studied
along with H$\alpha$ observations and high resolution spectropolarimetric
observations of the photospheric magnetic field. The photospheric magnetic
field is extrapolated up to the corona showing a multitude of large and small
scale structures. We show for the first time that the smallest magnetic
structures both at the network and the internetwork contribute significantly to
the emission in EUV lines, with temperatures ranging from 8 10$^{4}$ K to 6
10$^{5}$ K. Two components of transition region emission are present, one
associated with small-scale loops that do not reach coronal temperatures and
another one acting as an interface between coronal and chromospheric plasma.
Both components are associated with persistent chromospheric structures. The
temporal variability of the EUV intensity at the network region is also
associated with chromospheric motions, pointing to a connection between
transition region and chromospheric features. Intensity enhancements in the EUV
transition region lines are preferentially produced by H$\alpha$ upflows.
Examination of two individual chromospheric jets shows that their evolution is
associated with intensity variations in transition region and coronal
temperatures.
|
astro-ph.SR
|
we investigate the morphology and temporal variability of a quiet sun network region in different solar layers the emission in several euv spectral lines through both raster and slot time series recorded by eishinode is studied along with halpha observations and high resolution spectropolarimetric observations of the photospheric magnetic field the photospheric magnetic field is extrapolated up to the corona showing a multitude of large and small scale structures we show for the first time that the smallest magnetic structures both at the network and the internetwork contribute significantly to the emission in euv lines with temperatures ranging from 8 104 k to 6 105 k two components of transition region emission are present one associated with smallscale loops that do not reach coronal temperatures and another one acting as an interface between coronal and chromospheric plasma both components are associated with persistent chromospheric structures the temporal variability of the euv intensity at the network region is also associated with chromospheric motions pointing to a connection between transition region and chromospheric features intensity enhancements in the euv transition region lines are preferentially produced by halpha upflows examination of two individual chromospheric jets shows that their evolution is associated with intensity variations in transition region and coronal temperatures
|
[['we', 'investigate', 'the', 'morphology', 'and', 'temporal', 'variability', 'of', 'a', 'quiet', 'sun', 'network', 'region', 'in', 'different', 'solar', 'layers', 'the', 'emission', 'in', 'several', 'euv', 'spectral', 'lines', 'through', 'both', 'raster', 'and', 'slot', 'time', 'series', 'recorded', 'by', 'eishinode', 'is', 'studied', 'along', 'with', 'halpha', 'observations', 'and', 'high', 'resolution', 'spectropolarimetric', 'observations', 'of', 'the', 'photospheric', 'magnetic', 'field', 'the', 'photospheric', 'magnetic', 'field', 'is', 'extrapolated', 'up', 'to', 'the', 'corona', 'showing', 'a', 'multitude', 'of', 'large', 'and', 'small', 'scale', 'structures', 'we', 'show', 'for', 'the', 'first', 'time', 'that', 'the', 'smallest', 'magnetic', 'structures', 'both', 'at', 'the', 'network', 'and', 'the', 'internetwork', 'contribute', 'significantly', 'to', 'the', 'emission', 'in', 'euv', 'lines', 'with', 'temperatures', 'ranging', 'from', '8', '104', 'k', 'to', '6', '105', 'k', 'two', 'components', 'of', 'transition', 'region', 'emission', 'are', 'present', 'one', 'associated', 'with', 'smallscale', 'loops', 'that', 'do', 'not', 'reach', 'coronal', 'temperatures', 'and', 'another', 'one', 'acting', 'as', 'an', 'interface', 'between', 'coronal', 'and', 'chromospheric', 'plasma', 'both', 'components', 'are', 'associated', 'with', 'persistent', 'chromospheric', 'structures', 'the', 'temporal', 'variability', 'of', 'the', 'euv', 'intensity', 'at', 'the', 'network', 'region', 'is', 'also', 'associated', 'with', 'chromospheric', 'motions', 'pointing', 'to', 'a', 'connection', 'between', 'transition', 'region', 'and', 'chromospheric', 'features', 'intensity', 'enhancements', 'in', 'the', 'euv', 'transition', 'region', 'lines', 'are', 'preferentially', 'produced', 'by', 'halpha', 'upflows', 'examination', 'of', 'two', 'individual', 'chromospheric', 'jets', 'shows', 'that', 'their', 'evolution', 'is', 'associated', 'with', 'intensity', 'variations', 'in', 'transition', 'region', 'and', 'coronal', 'temperatures']]
|
[-0.09940866154735539, 0.21576744815451937, 0.04891726500848207, 0.09439476665361347, -0.058237594448857836, -0.06616713627112764, -0.0006766736637890914, 0.5187947831638517, -0.20251004459057453, -0.3641672685544416, 0.07354501353133613, -0.2831068948307187, -0.08304453597084624, 0.18058973684477292, 0.019607395810752225, -0.038044424950266664, 0.060522558990919934, -0.028961586219017902, -0.025675720368188038, -0.13745962041947576, 0.2937808982456544, 0.07761392973426387, 0.22336077002430524, 0.030627299235134884, 0.044115297388620585, -0.16936136442484054, -0.039630814225993294, 0.04438388166029078, -0.06681742647889544, 0.06272938209900786, 0.21797269916584813, 0.10732870158775382, 0.21260867604404038, -0.4349134049067895, -0.2672945198148561, -0.027381360107933843, 0.17799455097933853, -0.014772074351060217, 0.023397619388367676, -0.26482186995554663, 0.0849273783488847, -0.06462352785196353, -0.07527551120642015, 0.04870734495619213, 0.026823286472140374, 0.003705524614503706, -0.27305613132193685, 0.05836283355140901, 0.0017485894509681145, 0.17728506252147114, -0.10398127370095556, -0.01675702673709245, -0.08398884440803729, 0.13408276847910117, 0.06467339514691725, 0.05884635126148463, 0.19394849426594477, -0.1334430452634171, -0.08276431128418676, 0.31934379100133686, -0.09726564744082482, 0.01479854924235367, 0.2302093098686945, -0.2701764918710802, -0.13384870146873637, 0.27711386046853764, 0.13139363747216076, 0.09471629308716614, -0.077742444437924, -0.03581573088709063, -0.012748411739613988, 0.17618449378628193, 0.08827647653178892, 0.069176189456324, 0.28546562216330124, 0.07257432548176264, 0.027553250799942558, 0.13760383702012607, -0.2953797501347653, -0.0465720247619016, -0.2788143976218099, -0.1022072246912327, -0.06701102724356761, 0.011855557921484837, -0.10650212242731157, -0.1835435725616939, 0.40697083725697464, 0.14946430988366838, 0.27577831053089547, -0.0023809720498874135, 0.28987839415271266, 0.10669589607587202, 0.05485606917117133, 0.15792134623965565, 0.2622982886066471, 0.22357780095594731, 0.21884755699350927, -0.24780856248706687, 0.037874344676161624, 0.05199898998950415]
|
1,803.07935
|
Precision measurements of the scintillation pulse shape for low-energy
recoils in liquid xenon
|
We present measurements of the scintillation pulse shape in liquid xenon for
nuclear recoils (NR) and electronic recoils (ER) at electric fields of 0 to 0.5
kV/cm for energies $<$ 15 keV and $<$ 70 keV electron-equivalent, respectively.
The average pulse shapes are well-described by an effective model with two
exponential decay components, where both decay times are fit parameters. We
find significant broadening of the pulse for ER due to delayed luminescence
from the recombination process. In addition to the effective model, we fit a
model describing the recombination luminescence for ER at zero field and obtain
good agreement. We estimate the best performance of a combined S2/S1 and pulse
shape ER/NR discrimination and show that even with 2 ns time resolution, the
improvement over S2/S1 discrimination alone is marginal, so that pulse shape
discrimination will likely not be useful for future dual-phase liquid xenon
experiments looking for elastic dark matter recoil interactions.
|
physics.ins-det
|
we present measurements of the scintillation pulse shape in liquid xenon for nuclear recoils nr and electronic recoils er at electric fields of 0 to 05 kvcm for energies 15 kev and 70 kev electronequivalent respectively the average pulse shapes are welldescribed by an effective model with two exponential decay components where both decay times are fit parameters we find significant broadening of the pulse for er due to delayed luminescence from the recombination process in addition to the effective model we fit a model describing the recombination luminescence for er at zero field and obtain good agreement we estimate the best performance of a combined s2s1 and pulse shape ernr discrimination and show that even with 2 ns time resolution the improvement over s2s1 discrimination alone is marginal so that pulse shape discrimination will likely not be useful for future dualphase liquid xenon experiments looking for elastic dark matter recoil interactions
|
[['we', 'present', 'measurements', 'of', 'the', 'scintillation', 'pulse', 'shape', 'in', 'liquid', 'xenon', 'for', 'nuclear', 'recoils', 'nr', 'and', 'electronic', 'recoils', 'er', 'at', 'electric', 'fields', 'of', '0', 'to', '05', 'kvcm', 'for', 'energies', '15', 'kev', 'and', '70', 'kev', 'electronequivalent', 'respectively', 'the', 'average', 'pulse', 'shapes', 'are', 'welldescribed', 'by', 'an', 'effective', 'model', 'with', 'two', 'exponential', 'decay', 'components', 'where', 'both', 'decay', 'times', 'are', 'fit', 'parameters', 'we', 'find', 'significant', 'broadening', 'of', 'the', 'pulse', 'for', 'er', 'due', 'to', 'delayed', 'luminescence', 'from', 'the', 'recombination', 'process', 'in', 'addition', 'to', 'the', 'effective', 'model', 'we', 'fit', 'a', 'model', 'describing', 'the', 'recombination', 'luminescence', 'for', 'er', 'at', 'zero', 'field', 'and', 'obtain', 'good', 'agreement', 'we', 'estimate', 'the', 'best', 'performance', 'of', 'a', 'combined', 's2s1', 'and', 'pulse', 'shape', 'ernr', 'discrimination', 'and', 'show', 'that', 'even', 'with', '2', 'ns', 'time', 'resolution', 'the', 'improvement', 'over', 's2s1', 'discrimination', 'alone', 'is', 'marginal', 'so', 'that', 'pulse', 'shape', 'discrimination', 'will', 'likely', 'not', 'be', 'useful', 'for', 'future', 'dualphase', 'liquid', 'xenon', 'experiments', 'looking', 'for', 'elastic', 'dark', 'matter', 'recoil', 'interactions']]
|
[-0.00726222103486294, 0.17269828988153207, -0.08168742673306584, 0.09551908965775945, 0.014136109713909049, -0.18373786336711503, 0.012724228269599427, 0.4536553563439096, -0.2051739597952129, -0.3785951179513917, 0.002044822792491771, -0.33255578668954605, 0.00643829176231713, 0.17308081154686875, 0.019611416413874323, 0.02478379574881879, 0.04928279055177623, 0.0072166958749787695, -0.07674091401670301, -0.1873863316202746, 0.16863546145783848, 0.12378438522681495, 0.26715982005937605, 0.07607762720929273, 0.10068595798883513, 0.030468835991912132, 0.008366521247446735, -0.0394616153936167, -0.13903551023568733, 0.03745851786005379, 0.26417452508016237, 0.05884721336712049, 0.11898205625602593, -0.4196630074698108, -0.20192640291627909, 0.13601983042544877, 0.1472456304915211, 0.0862405514591281, -0.08849860766643522, -0.26066672812456526, 0.056491242820745496, -0.1796409223685103, -0.09386163742731739, -0.05814869864072823, 0.03669979002724544, 0.05115519614160887, -0.27851735027383595, 0.12294046430261066, 0.023730497706268255, 0.004543431333554539, -0.10342368543678462, -0.14989852977435517, 0.05907065626881425, 0.03614418962908699, 0.04866780030956671, 0.04429844267888377, 0.21622551205823975, -0.16993034348224864, -0.06970781287400435, 0.3530686983394603, -0.11299023324691548, -0.07632149394990148, 0.11206258440680111, -0.17735521496421602, -0.06159621381219353, 0.26307209231119777, 0.14409877002294735, 0.07488344276990026, -0.11384831293060488, 0.012385058754496893, 0.06093309652630782, 0.267471198572327, 0.10526938440466287, 0.027642292013291242, 0.21703658110018054, 0.19346758477784545, 0.03511089741113397, 0.05407054771997639, -0.17739685580738826, -0.01488314029939522, -0.28807330328280367, -0.11309239270769997, -0.10893107153512291, 0.06976776990111662, -0.09173171494465664, -0.09103834524207952, 0.42720030811892834, 0.08753996802530936, 0.1739287996134221, 0.030802065973780705, 0.28247040727897393, 0.0925837523123569, -0.0066180618368829325, 0.019244541490551884, 0.307383679772499, 0.13893983631074083, 0.07623085277139623, -0.26190679814413637, 0.05184730187687554, -0.062163493429489486]
|
1,803.07936
|
On the physical nature of globular cluster candidates in the Milky Way
bulge
|
We present results from 2MASS JKs photometry on the physical reality of
recently reported globular cluster (GC) candidates in the Milky Way (MW) bulge.
We relied our analysis on photometric membership probabilities that allowed us
to distinguish real stellar aggregates from the composite field star
population. When building colour-magnitude diagrams and stellar density maps
for stars at different membership probability levels, the genuine GC candidate
populations are clearly highlighted. We then used the tip of the red giant
branch (RGB) as distance estimator, resulting heliocentric distances that place
many of the objects in regions near of the MW bulge where no GC had been
previously recognised. Some few GC candidates resulted to be MW halo/disc
objects.Metallicities estimated from the standard RGB method are in agreement
with the values expected according to the position of the GC candidates in the
Galaxy. We finally derived from the first time their structural parameters. We
found that the studied objects have core, half-light and tidal radii in the
ranges spanned by the population of known MW GCs. Their internal dynamical
evolutionary stages will be described properly when their masses are estimated.
|
astro-ph.GA
|
we present results from 2mass jks photometry on the physical reality of recently reported globular cluster gc candidates in the milky way mw bulge we relied our analysis on photometric membership probabilities that allowed us to distinguish real stellar aggregates from the composite field star population when building colourmagnitude diagrams and stellar density maps for stars at different membership probability levels the genuine gc candidate populations are clearly highlighted we then used the tip of the red giant branch rgb as distance estimator resulting heliocentric distances that place many of the objects in regions near of the mw bulge where no gc had been previously recognised some few gc candidates resulted to be mw halodisc objectsmetallicities estimated from the standard rgb method are in agreement with the values expected according to the position of the gc candidates in the galaxy we finally derived from the first time their structural parameters we found that the studied objects have core halflight and tidal radii in the ranges spanned by the population of known mw gcs their internal dynamical evolutionary stages will be described properly when their masses are estimated
|
[['we', 'present', 'results', 'from', '2mass', 'jks', 'photometry', 'on', 'the', 'physical', 'reality', 'of', 'recently', 'reported', 'globular', 'cluster', 'gc', 'candidates', 'in', 'the', 'milky', 'way', 'mw', 'bulge', 'we', 'relied', 'our', 'analysis', 'on', 'photometric', 'membership', 'probabilities', 'that', 'allowed', 'us', 'to', 'distinguish', 'real', 'stellar', 'aggregates', 'from', 'the', 'composite', 'field', 'star', 'population', 'when', 'building', 'colourmagnitude', 'diagrams', 'and', 'stellar', 'density', 'maps', 'for', 'stars', 'at', 'different', 'membership', 'probability', 'levels', 'the', 'genuine', 'gc', 'candidate', 'populations', 'are', 'clearly', 'highlighted', 'we', 'then', 'used', 'the', 'tip', 'of', 'the', 'red', 'giant', 'branch', 'rgb', 'as', 'distance', 'estimator', 'resulting', 'heliocentric', 'distances', 'that', 'place', 'many', 'of', 'the', 'objects', 'in', 'regions', 'near', 'of', 'the', 'mw', 'bulge', 'where', 'no', 'gc', 'had', 'been', 'previously', 'recognised', 'some', 'few', 'gc', 'candidates', 'resulted', 'to', 'be', 'mw', 'halodisc', 'objectsmetallicities', 'estimated', 'from', 'the', 'standard', 'rgb', 'method', 'are', 'in', 'agreement', 'with', 'the', 'values', 'expected', 'according', 'to', 'the', 'position', 'of', 'the', 'gc', 'candidates', 'in', 'the', 'galaxy', 'we', 'finally', 'derived', 'from', 'the', 'first', 'time', 'their', 'structural', 'parameters', 'we', 'found', 'that', 'the', 'studied', 'objects', 'have', 'core', 'halflight', 'and', 'tidal', 'radii', 'in', 'the', 'ranges', 'spanned', 'by', 'the', 'population', 'of', 'known', 'mw', 'gcs', 'their', 'internal', 'dynamical', 'evolutionary', 'stages', 'will', 'be', 'described', 'properly', 'when', 'their', 'masses', 'are', 'estimated']]
|
[-0.019874885137117392, 0.07588714618814757, -0.13391647867959094, 0.11412257848659883, -0.10818077261635178, -0.03141158427350928, 0.10168687802286365, 0.44484835434201603, -0.1701451289174902, -0.3892992895599958, 0.0088081394693487, -0.2645995510993777, -0.06059399492837287, 0.20739396829661486, -0.07442809194452255, 0.004753878697000972, 0.08726730161296153, -0.006801814346800785, -0.017886255979789673, -0.29906029794428096, 0.2900754235659701, -0.00471332675928401, 0.15155229713969134, -0.12281335868315796, 0.04967029335077953, -0.08788974084325034, -0.06165418528976875, -0.006148228861393118, -0.17973180995444685, 0.06108399087160423, 0.23865587375554684, 0.15150483990767719, 0.19915614445769303, -0.35340790406523925, -0.17798919396449786, 0.08307302172541166, 0.234765427640161, 0.0673794037989668, -0.08480264719676327, -0.3195038924597808, 0.09117205309606081, -0.17356643097324145, -0.20345713443601052, 0.06932617202904579, 0.07501508068557627, 0.06115115814766771, -0.1794420078849873, 0.1149126652747745, -0.007681736853005163, 0.09577177757951054, -0.12350641916933898, -0.19548658109395892, -0.10817797103569515, 0.16232641116760016, 0.004717290547449847, 0.03734574120089009, 0.19180953175181875, -0.11172041719829715, -0.03617994562043129, 0.3806381992190271, -0.026693334226257394, -0.020519826770130846, 0.24363728180854907, -0.18949089754574203, -0.1691386306910096, 0.04745971756559369, 0.1279716366398576, 0.10952915887071474, -0.23265428383334388, 0.03506774591172674, -0.0008220396495449382, 0.1828883359208703, 0.09960247673648032, 0.07003669948478361, 0.3212798985300233, 0.08562598880160147, 0.016749548310149662, 0.07850693100559954, -0.2443821396074585, -0.0974978947546333, -0.2132952941128531, -0.05378559853982281, -0.13661772765823313, 0.012784474457274316, -0.15846494002554037, -0.11219673766880423, 0.34752483348790053, 0.13234851981915935, 0.24091540140625264, 0.04780656386110176, 0.28052168972727315, 0.0923105036789501, 0.1573475368006306, 0.09305351299258906, 0.3183911763038801, 0.1744181670688999, 0.03329756358084646, -0.22107194402078922, 0.1003277425666818, 0.0014334699283731548]
|
1,803.07937
|
The Augustin Capacity and Center
|
For any channel, the existence of a unique Augustin mean is established for
any positive order and probability mass function on the input set. The Augustin
mean is shown to be the unique fixed point of an operator defined in terms of
the order and the input distribution. The Augustin information is shown to be
continuously differentiable in the order. For any channel and convex constraint
set with finite Augustin capacity, the existence of a unique Augustin center
and the associated van Erven-Harremoes bound are established. The
Augustin-Legendre (A-L) information, capacity, center, and radius are
introduced and the latter three are proved to be equal to the corresponding
Renyi-Gallager quantities. The equality of the A-L capacity to the A-L radius
for arbitrary channels and the existence of a unique A-L center for channels
with finite A-L capacity are established. For all interior points of the
feasible set of cost constraints, the cost constrained Augustin capacity and
center are expressed in terms of the A-L capacity and center. Certain shift
invariant families of probabilities and certain Gaussian channels are analyzed
as examples.
|
cs.IT math.IT
|
for any channel the existence of a unique augustin mean is established for any positive order and probability mass function on the input set the augustin mean is shown to be the unique fixed point of an operator defined in terms of the order and the input distribution the augustin information is shown to be continuously differentiable in the order for any channel and convex constraint set with finite augustin capacity the existence of a unique augustin center and the associated van ervenharremoes bound are established the augustinlegendre al information capacity center and radius are introduced and the latter three are proved to be equal to the corresponding renyigallager quantities the equality of the al capacity to the al radius for arbitrary channels and the existence of a unique al center for channels with finite al capacity are established for all interior points of the feasible set of cost constraints the cost constrained augustin capacity and center are expressed in terms of the al capacity and center certain shift invariant families of probabilities and certain gaussian channels are analyzed as examples
|
[['for', 'any', 'channel', 'the', 'existence', 'of', 'a', 'unique', 'augustin', 'mean', 'is', 'established', 'for', 'any', 'positive', 'order', 'and', 'probability', 'mass', 'function', 'on', 'the', 'input', 'set', 'the', 'augustin', 'mean', 'is', 'shown', 'to', 'be', 'the', 'unique', 'fixed', 'point', 'of', 'an', 'operator', 'defined', 'in', 'terms', 'of', 'the', 'order', 'and', 'the', 'input', 'distribution', 'the', 'augustin', 'information', 'is', 'shown', 'to', 'be', 'continuously', 'differentiable', 'in', 'the', 'order', 'for', 'any', 'channel', 'and', 'convex', 'constraint', 'set', 'with', 'finite', 'augustin', 'capacity', 'the', 'existence', 'of', 'a', 'unique', 'augustin', 'center', 'and', 'the', 'associated', 'van', 'ervenharremoes', 'bound', 'are', 'established', 'the', 'augustinlegendre', 'al', 'information', 'capacity', 'center', 'and', 'radius', 'are', 'introduced', 'and', 'the', 'latter', 'three', 'are', 'proved', 'to', 'be', 'equal', 'to', 'the', 'corresponding', 'renyigallager', 'quantities', 'the', 'equality', 'of', 'the', 'al', 'capacity', 'to', 'the', 'al', 'radius', 'for', 'arbitrary', 'channels', 'and', 'the', 'existence', 'of', 'a', 'unique', 'al', 'center', 'for', 'channels', 'with', 'finite', 'al', 'capacity', 'are', 'established', 'for', 'all', 'interior', 'points', 'of', 'the', 'feasible', 'set', 'of', 'cost', 'constraints', 'the', 'cost', 'constrained', 'augustin', 'capacity', 'and', 'center', 'are', 'expressed', 'in', 'terms', 'of', 'the', 'al', 'capacity', 'and', 'center', 'certain', 'shift', 'invariant', 'families', 'of', 'probabilities', 'and', 'certain', 'gaussian', 'channels', 'are', 'analyzed', 'as', 'examples']]
|
[-0.1480091900223939, 0.07594951285140696, -0.03306152693167662, 0.03684202387705237, -0.051812873899614094, -0.11722311760200052, 0.07892477446802834, 0.31185471090649425, -0.29308020312588806, -0.2780607882522921, 0.13794873862373824, -0.2926037415306672, -0.08682646327287832, 0.17812022761904828, -0.08882674122718293, 0.11666923417975117, 0.01141398736697169, 0.10603469590182994, -0.05938554452485067, -0.26012420727918184, 0.3294234493364939, 0.06199487499039433, 0.26035143923035214, 0.0926920073588155, 0.11162111275522403, -0.0006351779272269937, 0.0019229466210030977, 0.046351341075425205, -0.15960516828741858, 0.10155223216081048, 0.22405050448844385, 0.1336531859871999, 0.23739414231321, -0.3326094676974599, -0.22177331624604638, 0.14970832102666687, 0.07752599362700179, 0.050596635747055765, -0.026255967634646795, -0.27683996933632055, 0.13593460179412706, -0.1441205554907132, -0.1310654157725834, -0.029313259432872746, 0.051020816543436084, 0.061817037846955504, -0.3438728364892096, 0.053931664519386587, 0.06341814964635079, 0.027403296705064827, -0.08854676501867076, -0.14827880965982818, -0.06428007975704551, 0.15976816122602233, -0.01895525337550685, 0.04289091120450628, 0.07143669204484651, -0.07612178652344385, -0.09120099902655097, 0.31463870942831956, -0.02681308921183298, -0.22281634582040113, 0.1751695786864242, -0.14232778931608914, -0.05378426055751699, 0.13902552546569089, 0.14673519884002026, 0.09686598788645098, -0.1668054055963648, 0.13343563587365764, -0.06074524403539325, 0.11271082530888812, 0.10092153835667078, 0.08402067388527554, 0.1743597300078033, 0.08066338742953107, 0.13156691715953736, 0.13003955102804007, -0.059624636427736084, -0.1238395934501746, -0.3238844903987213, -0.16442654552048738, -0.21875312536572467, 0.015101153627246119, -0.0743276536243242, -0.13765209500239536, 0.33540180988815305, 0.05528282446984472, 0.22353937358767126, 0.07597356857783967, 0.2258459259729895, 0.16017480617330224, 0.04731473395621727, 0.15013407672854276, 0.20919015136282038, 0.17821138310142112, 0.040425503553624925, -0.19759476948373395, 0.06911071720916788, 0.06705857241557464]
|
1,803.07938
|
Tracking Control of Marine Craft in the port-Hamiltonian Framework: A
Virtual Differential Passivity Approach
|
In this work we propose a family of trajectory tracking controllers for
marine craft in the port-Hamiltonian (pH) framework using virtual differential
passivity based control (v-dPBC). Two pH models of marine craft are considered,
one in a body frame and another in an inertial frame. The structure and
workless forces of pH models are exploited to design two virtual control
systems which are related to the original marine craft's pH models. These
virtual systems are rendered differentially passive with an imposed
steady-state trajectory, both by means of a control scheme. Finally, the
original marine craft pH models in closed-loop with above controllers solve the
trajectory tracking problem. The performance of the closedloop system is
evaluated on numerical simulations.
|
cs.SY
|
in this work we propose a family of trajectory tracking controllers for marine craft in the porthamiltonian ph framework using virtual differential passivity based control vdpbc two ph models of marine craft are considered one in a body frame and another in an inertial frame the structure and workless forces of ph models are exploited to design two virtual control systems which are related to the original marine crafts ph models these virtual systems are rendered differentially passive with an imposed steadystate trajectory both by means of a control scheme finally the original marine craft ph models in closedloop with above controllers solve the trajectory tracking problem the performance of the closedloop system is evaluated on numerical simulations
|
[['in', 'this', 'work', 'we', 'propose', 'a', 'family', 'of', 'trajectory', 'tracking', 'controllers', 'for', 'marine', 'craft', 'in', 'the', 'porthamiltonian', 'ph', 'framework', 'using', 'virtual', 'differential', 'passivity', 'based', 'control', 'vdpbc', 'two', 'ph', 'models', 'of', 'marine', 'craft', 'are', 'considered', 'one', 'in', 'a', 'body', 'frame', 'and', 'another', 'in', 'an', 'inertial', 'frame', 'the', 'structure', 'and', 'workless', 'forces', 'of', 'ph', 'models', 'are', 'exploited', 'to', 'design', 'two', 'virtual', 'control', 'systems', 'which', 'are', 'related', 'to', 'the', 'original', 'marine', 'crafts', 'ph', 'models', 'these', 'virtual', 'systems', 'are', 'rendered', 'differentially', 'passive', 'with', 'an', 'imposed', 'steadystate', 'trajectory', 'both', 'by', 'means', 'of', 'a', 'control', 'scheme', 'finally', 'the', 'original', 'marine', 'craft', 'ph', 'models', 'in', 'closedloop', 'with', 'above', 'controllers', 'solve', 'the', 'trajectory', 'tracking', 'problem', 'the', 'performance', 'of', 'the', 'closedloop', 'system', 'is', 'evaluated', 'on', 'numerical', 'simulations']]
|
[-0.16622413706826247, 0.06910414595768088, -0.07455405659857206, 0.01028055328361947, -0.0007681426399483763, -0.16217363997892445, -0.021424735077367776, 0.3717176931878102, -0.2774633468281285, -0.3304113450074761, 0.11919441833140745, -0.2055353852880091, -0.18884993754809015, 0.23878035183739046, -0.16800150178685977, 0.15314493717521366, 0.039722320053662205, 0.007769914105101007, 0.012453974754517448, -0.18799867823214172, 0.270035962224938, 0.022576715528226363, 0.26910607153870936, -0.038430714835252226, 0.16892549985265037, -0.01956196115071211, 0.016758883444206982, 0.009520204537066406, -0.07620416291194551, 0.14349193894003262, 0.26460252172308113, 0.14295195499916785, 0.29467457263722435, -0.43463554731088466, -0.22411716127254325, 0.06898628350283051, 0.09626952921048385, 0.10049835193384407, -0.07737945200542212, -0.3444729007355034, 0.08267694330726076, -0.20087740157634534, -0.10582235976973356, -0.06772446818649769, -0.0405880401928604, 0.06193789353610241, -0.2702115302617413, 0.01319411350414157, 0.010770481882681107, 0.08755808829426251, -0.1793280008674503, -0.06325897322425715, -0.05145319574512541, 0.16472190375347492, 0.035607811936642975, -0.028728025696433054, 0.2352620090341902, -0.1259296797757872, -0.1195758343192524, 0.3887563878283956, -0.0043048689082658305, -0.31109276343265485, 0.22270979481982067, -0.028056065543907983, -0.07617384132704344, 0.11982954308743878, 0.24824277566472902, 0.11882239451093984, -0.24136105553168755, 0.04093793760242487, -0.04121427851375835, 0.1871274206666918, 0.017533573426370477, -0.05231314314256326, 0.15599517318909858, 0.211164453704159, 0.10325264580676267, 0.11474391418220155, -0.03813274319339865, -0.14627936395720162, -0.2664488426024287, -0.13694200741833654, -0.07513775939426931, -0.054770322103085446, -0.01234856824032312, -0.10924618657485678, 0.3700094297198026, 0.17059349061535864, 0.16158968505072246, 0.05716775620761649, 0.3549236523886693, 0.08792571205613685, 0.018749492722141943, 0.08212009661204728, 0.24034567323416986, 0.037585172699844654, 0.1366048647644769, -0.25936230852726266, 0.06161763823334256, 0.07605511066503823]
|
1,803.07939
|
Remarks on Jordan derivations over matrix algebras
|
Let C be a commutative ring with unity. In this article, we show that every
Jordan derivation over an upper triangular matrix algebra T_n(C) is an inner
derivation. Further, we extend the result for Jordan derivation on full matrix
algebra M_n(C).
|
math.RA
|
let c be a commutative ring with unity in this article we show that every jordan derivation over an upper triangular matrix algebra t_nc is an inner derivation further we extend the result for jordan derivation on full matrix algebra m_nc
|
[['let', 'c', 'be', 'a', 'commutative', 'ring', 'with', 'unity', 'in', 'this', 'article', 'we', 'show', 'that', 'every', 'jordan', 'derivation', 'over', 'an', 'upper', 'triangular', 'matrix', 'algebra', 't_nc', 'is', 'an', 'inner', 'derivation', 'further', 'we', 'extend', 'the', 'result', 'for', 'jordan', 'derivation', 'on', 'full', 'matrix', 'algebra', 'm_nc']]
|
[-0.15421992874272714, 0.013668818644208198, -0.06977425019892795, -0.09030605789001395, -0.11938010290174222, -0.1450491325316451, -0.06898000020613303, 0.3285599379777545, -0.3355764528600181, -0.10589947478800285, 0.09505936261209683, -0.2408032435469511, -0.15831646877454547, 0.19263571818790784, -0.12524868041367793, -0.14209512509859917, 0.09531065735329942, 0.12513297030747664, -0.193376845685856, -0.23261164455879024, 0.31375074241219497, 0.03517000331747823, 0.14132999181293132, 0.04548775927140945, 0.04672791011540628, 0.06819706899681832, -0.012817995622754097, -0.012578319559418938, -0.23713673059008702, 0.07732130604137372, 0.28919389253345934, 0.127026593482985, 0.198964954603736, -0.387153728214155, -0.04926500124175374, 0.1977422063511501, 0.22041559480584977, 0.006548691631817236, -0.03341581628419368, -0.21157750666777536, 0.13325566664428973, -0.3016590500568471, -0.12911102820823833, -0.019427012777092252, 0.13916663253089276, -0.12873214696783844, -0.3187312198711968, 0.0036817962848922103, 0.15475521027678396, 0.1509198573831094, -0.07280517184379988, -0.14307600451724195, 0.020126612629832293, 0.003212732069830342, -0.15229125564531765, 0.055984625536039834, 0.11872522361298296, 0.05124434047923764, -0.08787677563704187, 0.3110631844255982, -0.055119680195319945, -0.2319582284132882, 0.06015648088622384, -0.23131969191770002, -0.13777798171177869, 0.05322512484541753, 0.0746812369765305, 0.07333792955046747, -0.09211050128427947, 0.26966017736803466, -0.25657089572490716, 0.12951987582009014, 0.056515210876014174, -0.03510306202011501, 0.1711859256029129, 0.07814458011445112, 0.08280761561586476, 0.11225404147138228, 0.11195555000520516, -0.015255732870683438, -0.40130094547824163, -0.2099223959872999, -0.17872146442078235, 0.17969570857495432, -0.18321259293659795, -0.15781795288004527, 0.37879876533477774, 0.12101830142300303, 0.20664272230209374, 0.14716506867510518, 0.22172340555343686, 0.1607802852224445, 0.09658269394791072, 0.10584863099246854, 0.11561477182024135, 0.3188748326516006, -0.0058577694481511304, -0.13125808406394066, -0.07726595893774818, 0.23735222717883384]
|
1,803.0794
|
Communication-based Decentralized Cooperative Object Transportation
Using Nonlinear Model Predictive Control
|
This paper addresses the problem of cooperative transportation of an object
rigidly grasped by N robotic agents. We propose a Nonlinear Model Predictive
Control (NMPC) scheme that guarantees the navigation of the object to a desired
pose in a bounded workspace with obstacles, while complying with certain input
saturations of the agents. The control scheme is based on inter-agent
communication and is decentralized in the sense that each agent calculates its
own control signal. Moreover, the proposed methodology ensures that the agents
do not collide with each other or with the workspace obstacles as well as that
they do not pass through singular configurations. The feasibility and
convergence analysis of the NMPC are explicitly provided. Finally, simulation
results illustrate the validity and efficiency of the proposed method.
|
cs.RO
|
this paper addresses the problem of cooperative transportation of an object rigidly grasped by n robotic agents we propose a nonlinear model predictive control nmpc scheme that guarantees the navigation of the object to a desired pose in a bounded workspace with obstacles while complying with certain input saturations of the agents the control scheme is based on interagent communication and is decentralized in the sense that each agent calculates its own control signal moreover the proposed methodology ensures that the agents do not collide with each other or with the workspace obstacles as well as that they do not pass through singular configurations the feasibility and convergence analysis of the nmpc are explicitly provided finally simulation results illustrate the validity and efficiency of the proposed method
|
[['this', 'paper', 'addresses', 'the', 'problem', 'of', 'cooperative', 'transportation', 'of', 'an', 'object', 'rigidly', 'grasped', 'by', 'n', 'robotic', 'agents', 'we', 'propose', 'a', 'nonlinear', 'model', 'predictive', 'control', 'nmpc', 'scheme', 'that', 'guarantees', 'the', 'navigation', 'of', 'the', 'object', 'to', 'a', 'desired', 'pose', 'in', 'a', 'bounded', 'workspace', 'with', 'obstacles', 'while', 'complying', 'with', 'certain', 'input', 'saturations', 'of', 'the', 'agents', 'the', 'control', 'scheme', 'is', 'based', 'on', 'interagent', 'communication', 'and', 'is', 'decentralized', 'in', 'the', 'sense', 'that', 'each', 'agent', 'calculates', 'its', 'own', 'control', 'signal', 'moreover', 'the', 'proposed', 'methodology', 'ensures', 'that', 'the', 'agents', 'do', 'not', 'collide', 'with', 'each', 'other', 'or', 'with', 'the', 'workspace', 'obstacles', 'as', 'well', 'as', 'that', 'they', 'do', 'not', 'pass', 'through', 'singular', 'configurations', 'the', 'feasibility', 'and', 'convergence', 'analysis', 'of', 'the', 'nmpc', 'are', 'explicitly', 'provided', 'finally', 'simulation', 'results', 'illustrate', 'the', 'validity', 'and', 'efficiency', 'of', 'the', 'proposed', 'method']]
|
[-0.14084737917030685, 0.015882608584448232, -0.0662684740011001, -0.030959740375520618, -0.10545826820458659, -0.19301608050843394, 0.057182920646604414, 0.41392389285253495, -0.28026091822929033, -0.315548904907457, 0.12336953192471259, -0.23565418086579348, -0.1776374150333398, 0.15312305776453686, -0.1517048690369074, 0.11841240224903303, 0.09010828788736909, 0.07100861890637498, 0.013703107764196443, -0.25915142860058255, 0.28576326960932436, 0.029542944401385277, 0.2794021298085875, 0.018409462077323142, 0.19309188058145169, 0.04508768895301348, 0.020723554745727166, 0.029464578369676364, -0.07038597667917029, 0.1296664099117345, 0.2595748807781185, 0.18741785059866356, 0.3298643277298043, -0.4394307042156735, -0.19575915993814627, 0.09472688510060662, 0.16327274932826716, 0.0726871330962025, -0.0410029719570857, -0.3219026460194975, 0.12288384660565126, -0.17479610262992315, -0.1270373788750254, -0.06521546137409182, -0.06049564484814842, 0.09347689375382166, -0.2919522386528258, -0.017444844834330515, 0.07386183835232381, 0.022469726526801747, -0.10893810074134752, -0.03263281318212412, -0.029639556045152657, 0.18315268463939136, 0.028293472141812107, -0.01841946956738243, 0.18092720266651569, -0.13925805534456132, -0.1600900154820218, 0.4102694618746668, 0.02114663291933367, -0.2775141219205157, 0.20042147569717678, -0.07214450726182911, -0.0963883207813932, 0.10612223993649515, 0.19201421052012152, 0.1334251872975174, -0.147365001198931, 0.08153164700841473, -0.056658551434245634, 0.1747504585536241, 0.022483145942779507, -0.001780946119358455, 0.1472238803797541, 0.19124964357713076, 0.18328083058320513, 0.09644377993384934, -0.04414531854384645, -0.14223279438428874, -0.3244836209726879, -0.10287646817659417, -0.1896696971384735, -0.0688028799992799, -0.09601971277140729, -0.11202182371433325, 0.3597574328297752, 0.19323784329994456, 0.18167689215303875, 0.13009964497979937, 0.39138708683097456, 0.0684678929025586, 0.023774575574074204, 0.11722734886566251, 0.23817874827810864, 0.023160721190039098, 0.10036950582807047, -0.24905045631920963, 0.11556454664499564, 0.04632016783064565]
|
1,803.07941
|
Jordan {g, h}-derivations on algebra of matrices
|
In this article, we show that every Jordan {g, h}-derivation over T_n(C) is a
{g, h}-derivation under an assumption, where C is a commutative ring with unity
1 not equal to 0. We give an example of a Jordan {g, h}-derivation over T_n(C)
which is not a {g, h}-derivation. Also, we study Jordan {g, h}-derivation over
M_n(C).
|
math.RA
|
in this article we show that every jordan g hderivation over t_nc is a g hderivation under an assumption where c is a commutative ring with unity 1 not equal to 0 we give an example of a jordan g hderivation over t_nc which is not a g hderivation also we study jordan g hderivation over m_nc
|
[['in', 'this', 'article', 'we', 'show', 'that', 'every', 'jordan', 'g', 'hderivation', 'over', 't_nc', 'is', 'a', 'g', 'hderivation', 'under', 'an', 'assumption', 'where', 'c', 'is', 'a', 'commutative', 'ring', 'with', 'unity', '1', 'not', 'equal', 'to', '0', 'we', 'give', 'an', 'example', 'of', 'a', 'jordan', 'g', 'hderivation', 'over', 't_nc', 'which', 'is', 'not', 'a', 'g', 'hderivation', 'also', 'we', 'study', 'jordan', 'g', 'hderivation', 'over', 'm_nc']]
|
[-0.22671141646998494, 0.07116998592034195, -0.10224791304535118, -0.09354979660476379, -0.09830536439263246, -0.16962901444027298, -0.05690011120679086, 0.4142872544103547, -0.28085871472170476, -0.14447009014455894, 0.06524122190833288, -0.22947743348777294, -0.1617937774250382, 0.19540998163191894, -0.15632549616132388, -0.1562160485865254, 0.050843824975584685, 0.2049578867460552, -0.09477602152496968, -0.3028829931689982, 0.2912044617951962, -0.06353889528269831, 0.11920484047579138, 0.055360318989729866, 0.08223293948787869, -0.003544584292460952, 0.06715120528742932, 0.03396599602542425, -0.23780806474206384, -6.839039882546977e-05, 0.28584562117854756, 0.11741926834771507, 0.29065034865287315, -0.296810633818958, -0.10024093412549089, 0.2807885417551325, 0.12818346676629103, -0.06440564230484724, 0.014864359769904823, -0.20396996543562987, 0.192903198628572, -0.24872108457381265, -0.050910083086867085, 0.044461758300792756, 0.2159424020598332, -0.07247590323044151, -0.3107275288192588, -0.008743756520663993, 0.13667507204962404, 0.1274936224186891, -0.002793745431852968, -0.10736758307668201, -0.024319470778369066, 0.020433079957831324, -0.08576510885419945, 0.12225476246768315, 0.048605750125971736, -0.006124446858864343, -0.054198050299626696, 0.4155036675041182, -0.1518603749246451, -0.17835263404668422, 0.08439719695761277, -0.191167725103074, -0.13009874272699418, 0.06083529061850226, 0.03509746779475296, 0.19146131114674764, -0.06690448501327059, 0.25139023789220993, -0.21830989106705315, 0.1198126284667013, 0.09799206204581679, -0.08102358376868722, 0.1401052502465941, 0.06547349746535092, 0.09499508811604117, 0.0825363466548815, 0.05347479141333647, 0.12872468112363367, -0.3986713686271718, -0.1668181902271483, -0.14829440171454558, 0.2234537836675851, -0.08381990701156228, -0.1537367720320298, 0.40371002423527996, 0.0785709829151369, 0.20269361759225527, 0.11250583432296193, 0.17254136819719224, 0.047208816849569415, 0.08939619405039896, 0.162386475465865, 0.08518965686099571, 0.23324083275439447, -0.07037414384703561, -0.13416323473415614, -0.0893029738626067, 0.10282602120321571]
|
1,803.07942
|
Alternative angular variables for suppression of QCD multijet events in
new physics searches with missing transverse momentum at the LHC
|
We introduce three alternative angular variables-denoted by
$\tilde{\omega}_\text{min}$, $\hat{\omega}_\text{min}$, and
$\chi_\text{min}$-for QCD multijet event suppression in supersymmetry searches
in events with large missing transverse momentum in proton-proton collisions at
the LHC at CERN. In searches in all-hadronic final states in the CMS and ATLAS
experiments, the angle $\Delta\varphi_i$, the azimuthal angle between a jet and
the missing transverse momentum, is widely used to reduce QCD multijet
background events with large missing transverse momentum, which is primarily
caused by a jet momentum mismeasurement or neutrinos in hadron decays-the
missing transverse momentum is aligned with a jet. A related angular
variable-denoted by $\Delta\varphi^*_\text{min}$, the minimum of the azimuthal
angles between a jet and the transverse momentum imbalance of the other jets in
the event-is used instead in a series of searches in all-hadronic final states
in CMS to suppress QCD multijet background events to a negligible level. In
this paper, before introducing the alternative variables, we review the
variable $\Delta\varphi^*_\text{min}$ in detail and identify room for
improvement, in particular, to maintain good acceptances for signal models with
high jet multiplicity final states. Furthermore, we demonstrate with simulated
event samples that $\hat{\omega}_\text{min}$ and $\chi_\text{min}$ considerably
outperform $\Delta\varphi^*_\text{min}$ and $\Delta\varphi_i$ in rejecting QCD
multijet background events and that $\hat{\omega}_\text{min}$ and
$\tilde{\omega}_\text{min}$ are also useful for reducing the total standard
model background events.
|
hep-ph
|
we introduce three alternative angular variablesdenoted by tildeomega_textmin hatomega_textmin and chi_textminfor qcd multijet event suppression in supersymmetry searches in events with large missing transverse momentum in protonproton collisions at the lhc at cern in searches in allhadronic final states in the cms and atlas experiments the angle deltavarphi_i the azimuthal angle between a jet and the missing transverse momentum is widely used to reduce qcd multijet background events with large missing transverse momentum which is primarily caused by a jet momentum mismeasurement or neutrinos in hadron decaysthe missing transverse momentum is aligned with a jet a related angular variabledenoted by deltavarphi_textmin the minimum of the azimuthal angles between a jet and the transverse momentum imbalance of the other jets in the eventis used instead in a series of searches in allhadronic final states in cms to suppress qcd multijet background events to a negligible level in this paper before introducing the alternative variables we review the variable deltavarphi_textmin in detail and identify room for improvement in particular to maintain good acceptances for signal models with high jet multiplicity final states furthermore we demonstrate with simulated event samples that hatomega_textmin and chi_textmin considerably outperform deltavarphi_textmin and deltavarphi_i in rejecting qcd multijet background events and that hatomega_textmin and tildeomega_textmin are also useful for reducing the total standard model background events
|
[['we', 'introduce', 'three', 'alternative', 'angular', 'variablesdenoted', 'by', 'tildeomega_textmin', 'hatomega_textmin', 'and', 'chi_textminfor', 'qcd', 'multijet', 'event', 'suppression', 'in', 'supersymmetry', 'searches', 'in', 'events', 'with', 'large', 'missing', 'transverse', 'momentum', 'in', 'protonproton', 'collisions', 'at', 'the', 'lhc', 'at', 'cern', 'in', 'searches', 'in', 'allhadronic', 'final', 'states', 'in', 'the', 'cms', 'and', 'atlas', 'experiments', 'the', 'angle', 'deltavarphi_i', 'the', 'azimuthal', 'angle', 'between', 'a', 'jet', 'and', 'the', 'missing', 'transverse', 'momentum', 'is', 'widely', 'used', 'to', 'reduce', 'qcd', 'multijet', 'background', 'events', 'with', 'large', 'missing', 'transverse', 'momentum', 'which', 'is', 'primarily', 'caused', 'by', 'a', 'jet', 'momentum', 'mismeasurement', 'or', 'neutrinos', 'in', 'hadron', 'decaysthe', 'missing', 'transverse', 'momentum', 'is', 'aligned', 'with', 'a', 'jet', 'a', 'related', 'angular', 'variabledenoted', 'by', 'deltavarphi_textmin', 'the', 'minimum', 'of', 'the', 'azimuthal', 'angles', 'between', 'a', 'jet', 'and', 'the', 'transverse', 'momentum', 'imbalance', 'of', 'the', 'other', 'jets', 'in', 'the', 'eventis', 'used', 'instead', 'in', 'a', 'series', 'of', 'searches', 'in', 'allhadronic', 'final', 'states', 'in', 'cms', 'to', 'suppress', 'qcd', 'multijet', 'background', 'events', 'to', 'a', 'negligible', 'level', 'in', 'this', 'paper', 'before', 'introducing', 'the', 'alternative', 'variables', 'we', 'review', 'the', 'variable', 'deltavarphi_textmin', 'in', 'detail', 'and', 'identify', 'room', 'for', 'improvement', 'in', 'particular', 'to', 'maintain', 'good', 'acceptances', 'for', 'signal', 'models', 'with', 'high', 'jet', 'multiplicity', 'final', 'states', 'furthermore', 'we', 'demonstrate', 'with', 'simulated', 'event', 'samples', 'that', 'hatomega_textmin', 'and', 'chi_textmin', 'considerably', 'outperform', 'deltavarphi_textmin', 'and', 'deltavarphi_i', 'in', 'rejecting', 'qcd', 'multijet', 'background', 'events', 'and', 'that', 'hatomega_textmin', 'and', 'tildeomega_textmin', 'are', 'also', 'useful', 'for', 'reducing', 'the', 'total', 'standard', 'model', 'background', 'events']]
|
[-0.08769802686024028, 0.24249133677221835, -0.10032523514774556, 0.16993450785006503, -0.05780569810527735, -0.07733083065697709, -0.016349164709446577, 0.3589449124130904, -0.16846517202121994, -0.34052186847055477, 0.006298880319473728, -0.32123871995225695, 0.044699267030899555, 0.12749648194249646, -0.0030182592667048224, 0.11087067535845563, 0.14846521696577278, -0.05799253541940393, -0.061992500214658394, -0.19116448202112224, 0.28998689192051713, 0.12877326297054353, 0.23335886327997565, 0.07246020514643393, 0.13394943075735893, 0.07035141725925943, -0.10714166981275551, 0.014438134313632663, -0.06421257933197921, 0.018208704171719055, 0.2791136082475637, 0.04010372281593915, 0.13354969368999894, -0.35130647908954415, -0.1144931728519553, 0.12997485698612693, 0.15219727379511683, 0.10373403544032883, -0.07083140760704947, -0.2715936180141468, 0.12669502598482024, -0.23046132418452403, -0.08793118299777583, -0.0480344350843762, -0.013620920622578034, -0.041094952379353344, -0.289374270346553, 0.14172343137467508, -0.013680703549863001, 0.0456313743085887, 0.017727011107266523, -0.15758627217012242, -0.09417357365153013, -0.0017797059442203206, 0.14881287476265032, 0.12114842428645016, 0.1471366448990571, -0.22961189625129919, -0.23518118763996215, 0.3213768651879106, -0.017408943910245746, -0.22578614468847474, 0.18625902036392988, -0.2315151136037737, -0.14959218427135895, 0.17709228958343515, 0.2804916050697032, 0.07692142428669076, -0.16212246867340022, 0.04042593265470574, 0.03024560072942852, 0.13763171461043663, 0.07554175935197585, 0.08237404815512352, 0.23598977302138407, 0.1733088817373545, 0.014497756861741297, 0.10694762724569255, -0.17714536685245827, -0.04947123098043868, -0.39244854289035386, -0.09952522894925026, -0.11804167477888629, 0.018364908326475415, -0.0497361837203873, -0.08638407546991053, 0.3905279017411746, 0.1315244006064649, 0.31672220651167804, -0.04081430853749715, 0.3559397912870806, 0.047525065249199264, 0.06582045058894437, 0.09181010386135732, 0.30405011951986055, 0.10400325797225098, 0.19926584967806077, -0.21110093891351986, 0.04048453571606213, 0.03529737028069436]
|
1,803.07943
|
Precise predictions for same-sign W-boson scattering at the LHC
|
Vector-boson scattering processes are of great importance for the current
run-II and future runs of the Large Hadron Collider. The presence of triple and
quartic gauge couplings in the process gives access to the gauge sector of the
Standard Model (SM) and possible new-physics contributions there. To test any
new-physics hypothesis, sound knowledge of the SM contributions is necessary,
with a precision which at least matches the experimental uncertainties of
existing and forthcoming measurements. In this article we present a detailed
study of the vector-boson scattering process with two positively-charged
leptons and missing transverse momentum in the final state. In particular, we
first carry out a systematic comparison of the various approximations that are
usually performed for this kind of process against the complete calculation, at
LO and NLO QCD accuracy. Such a study is performed both in the usual fiducial
region used by experimental collaborations and in a more inclusive phase space,
where the differences among the various approximations lead to more sizeable
effects. Afterwards, we turn to predictions matched to parton showers, at LO
and NLO: we show that on the one hand, the inclusion of NLO QCD corrections
leads to more stable predictions, but on the other hand the details of the
matching and of the parton-shower programs cause differences which are
considerably larger than those observed at fixed order, even in the
experimental fiducial region. We conclude with recommendations for experimental
studies of vector-boson scattering processes.
|
hep-ph
|
vectorboson scattering processes are of great importance for the current runii and future runs of the large hadron collider the presence of triple and quartic gauge couplings in the process gives access to the gauge sector of the standard model sm and possible newphysics contributions there to test any newphysics hypothesis sound knowledge of the sm contributions is necessary with a precision which at least matches the experimental uncertainties of existing and forthcoming measurements in this article we present a detailed study of the vectorboson scattering process with two positivelycharged leptons and missing transverse momentum in the final state in particular we first carry out a systematic comparison of the various approximations that are usually performed for this kind of process against the complete calculation at lo and nlo qcd accuracy such a study is performed both in the usual fiducial region used by experimental collaborations and in a more inclusive phase space where the differences among the various approximations lead to more sizeable effects afterwards we turn to predictions matched to parton showers at lo and nlo we show that on the one hand the inclusion of nlo qcd corrections leads to more stable predictions but on the other hand the details of the matching and of the partonshower programs cause differences which are considerably larger than those observed at fixed order even in the experimental fiducial region we conclude with recommendations for experimental studies of vectorboson scattering processes
|
[['vectorboson', 'scattering', 'processes', 'are', 'of', 'great', 'importance', 'for', 'the', 'current', 'runii', 'and', 'future', 'runs', 'of', 'the', 'large', 'hadron', 'collider', 'the', 'presence', 'of', 'triple', 'and', 'quartic', 'gauge', 'couplings', 'in', 'the', 'process', 'gives', 'access', 'to', 'the', 'gauge', 'sector', 'of', 'the', 'standard', 'model', 'sm', 'and', 'possible', 'newphysics', 'contributions', 'there', 'to', 'test', 'any', 'newphysics', 'hypothesis', 'sound', 'knowledge', 'of', 'the', 'sm', 'contributions', 'is', 'necessary', 'with', 'a', 'precision', 'which', 'at', 'least', 'matches', 'the', 'experimental', 'uncertainties', 'of', 'existing', 'and', 'forthcoming', 'measurements', 'in', 'this', 'article', 'we', 'present', 'a', 'detailed', 'study', 'of', 'the', 'vectorboson', 'scattering', 'process', 'with', 'two', 'positivelycharged', 'leptons', 'and', 'missing', 'transverse', 'momentum', 'in', 'the', 'final', 'state', 'in', 'particular', 'we', 'first', 'carry', 'out', 'a', 'systematic', 'comparison', 'of', 'the', 'various', 'approximations', 'that', 'are', 'usually', 'performed', 'for', 'this', 'kind', 'of', 'process', 'against', 'the', 'complete', 'calculation', 'at', 'lo', 'and', 'nlo', 'qcd', 'accuracy', 'such', 'a', 'study', 'is', 'performed', 'both', 'in', 'the', 'usual', 'fiducial', 'region', 'used', 'by', 'experimental', 'collaborations', 'and', 'in', 'a', 'more', 'inclusive', 'phase', 'space', 'where', 'the', 'differences', 'among', 'the', 'various', 'approximations', 'lead', 'to', 'more', 'sizeable', 'effects', 'afterwards', 'we', 'turn', 'to', 'predictions', 'matched', 'to', 'parton', 'showers', 'at', 'lo', 'and', 'nlo', 'we', 'show', 'that', 'on', 'the', 'one', 'hand', 'the', 'inclusion', 'of', 'nlo', 'qcd', 'corrections', 'leads', 'to', 'more', 'stable', 'predictions', 'but', 'on', 'the', 'other', 'hand', 'the', 'details', 'of', 'the', 'matching', 'and', 'of', 'the', 'partonshower', 'programs', 'cause', 'differences', 'which', 'are', 'considerably', 'larger', 'than', 'those', 'observed', 'at', 'fixed', 'order', 'even', 'in', 'the', 'experimental', 'fiducial', 'region', 'we', 'conclude', 'with', 'recommendations', 'for', 'experimental', 'studies', 'of', 'vectorboson', 'scattering', 'processes']]
|
[-0.07494398350972915, 0.15405220376172413, -0.08874112024107793, 0.1270310458085608, -0.06376427142628624, -0.08355747728152589, 0.04347894232535812, 0.36039696002068616, -0.1802139266432884, -0.28234140828911525, 0.04648290433251532, -0.3355028447394337, -0.04369684693568464, 0.16066684063116554, 0.04838895585150264, 0.09065756214161715, 0.12377281362181142, -0.00920343358302489, -0.07000661948623019, -0.25736766358216606, 0.3165449145900008, 0.08198511423931147, 0.22983314050106857, 0.10594003563552784, 0.04161173104172728, 0.031310085128886084, -0.09157633252713519, -0.017800645606015072, -0.11855507013406168, 0.09910126027825754, 0.2548069037720173, 0.05051668580660286, 0.16486614479799755, -0.4005319656028102, -0.13646862248230415, 0.1098526756943708, 0.12429854343742287, 0.13316418734223892, -0.034971234998799144, -0.26733655591427424, 0.09104541504905986, -0.20631532332336064, -0.09780991633597295, -0.09628981020262775, -0.05012052382420128, -0.06774311736337116, -0.3236018555762712, 0.05808159881974764, 0.001735163700262395, 0.021411789164024714, 0.022304559026573165, -0.1842257411442309, -0.04314261120453011, 0.08242589684862954, 0.10603567190034179, 0.04805450149967025, 0.1269812342807806, -0.18514210996606076, -0.18282303067389877, 0.4176525736693293, -0.056920451773536725, -0.17421976290255164, 0.19160490438710742, -0.2207155048495527, -0.16207753343514925, 0.14990744225215166, 0.2127987359330291, 0.0869235466789784, -0.1580143782601226, 0.0894689949847816, 0.026410503924125805, 0.15238644497779508, 0.042121656167243296, 0.04988087471574545, 0.1832630280366478, 0.18953797384456267, 0.008853662033410122, 0.07082981291096076, -0.08773597490944667, -0.10893044618448282, -0.41071437776942427, -0.10386828505046045, -0.07209289978297116, 0.0037716722101322374, -0.08290583395810244, -0.12903239025642202, 0.3772675962478388, 0.2080854634172283, 0.22704453039429306, 0.028748937114141882, 0.3301145412532302, 0.07493448656896362, 0.07152270738891578, 0.014070558701435705, 0.301102329173591, 0.10389800565026235, 0.09039174687932246, -0.22303456764493604, 0.06361646510971089, 0.019217738598429908]
|
1,803.07944
|
High energy neutrinos
|
We describe several components in the diffuse flux of high energy neutrinos
reaching the Earth and discuss whether they could explain IceCube's
observations. Then we focus on TeV neutrinos from the Sun. We show that this
solar neutrino flux is correlated with the cosmic-ray shadow of the Sun
measured by HAWC, and we find that it is much larger than the flux of
atmospheric neutrinos. Stars like our Sun provide neutrinos with a very steep
spectrum and no associated gammas. We argue that this is the type of
contribution that could solve the main puzzle presented by the high energy
IceCube data.
|
hep-ph astro-ph.HE
|
we describe several components in the diffuse flux of high energy neutrinos reaching the earth and discuss whether they could explain icecubes observations then we focus on tev neutrinos from the sun we show that this solar neutrino flux is correlated with the cosmicray shadow of the sun measured by hawc and we find that it is much larger than the flux of atmospheric neutrinos stars like our sun provide neutrinos with a very steep spectrum and no associated gammas we argue that this is the type of contribution that could solve the main puzzle presented by the high energy icecube data
|
[['we', 'describe', 'several', 'components', 'in', 'the', 'diffuse', 'flux', 'of', 'high', 'energy', 'neutrinos', 'reaching', 'the', 'earth', 'and', 'discuss', 'whether', 'they', 'could', 'explain', 'icecubes', 'observations', 'then', 'we', 'focus', 'on', 'tev', 'neutrinos', 'from', 'the', 'sun', 'we', 'show', 'that', 'this', 'solar', 'neutrino', 'flux', 'is', 'correlated', 'with', 'the', 'cosmicray', 'shadow', 'of', 'the', 'sun', 'measured', 'by', 'hawc', 'and', 'we', 'find', 'that', 'it', 'is', 'much', 'larger', 'than', 'the', 'flux', 'of', 'atmospheric', 'neutrinos', 'stars', 'like', 'our', 'sun', 'provide', 'neutrinos', 'with', 'a', 'very', 'steep', 'spectrum', 'and', 'no', 'associated', 'gammas', 'we', 'argue', 'that', 'this', 'is', 'the', 'type', 'of', 'contribution', 'that', 'could', 'solve', 'the', 'main', 'puzzle', 'presented', 'by', 'the', 'high', 'energy', 'icecube', 'data']]
|
[-0.056979304816409504, 0.25540813873065454, -0.030673811576122593, 0.21867111675537138, -0.06239997283281649, -0.04865512334485995, 0.011246604733077772, 0.38571634214809714, -0.19050929751977616, -0.3811497045863493, 0.06440562038915232, -0.3328832977122682, -0.0692533361885295, 0.2039231784349563, -0.030642897698699552, -0.0671353701878152, 0.11733922396795642, 0.011822523748075279, -0.05061989017949421, -0.20576083924000463, 0.2887231411512795, 0.1637692824028907, 0.18670161620613335, 0.08675190092831411, 0.0925627330959519, -0.1047811010971154, -0.07843781824168913, -0.04545678148575712, -0.07277367455917913, 0.07833919806780257, 0.19391819173881017, 0.15344638786023007, 0.1101604702827685, -0.44587766249463257, -0.2465302590006853, 0.15525590448740723, 0.13792472723506244, 0.021180082591907942, -0.09047177040095751, -0.2665836595309277, 0.09443276763583223, -0.17654728556882737, -0.1683783562415663, 0.04117686847480489, -0.02568749545653369, -0.009310844171719224, -0.196945007612853, 0.047944780395768, -0.0024648033465970963, 0.000892516152531493, -0.08670242968975228, -0.1534354841500959, -0.011609385655188532, 0.047213339169199266, 0.15322096730975032, 0.008560070882131364, 0.11663038234052923, -0.13696504404823132, -0.06496192063844088, 0.3968858795112693, -0.08086148186603347, -0.07699090554196314, 0.17836158635898255, -0.22796322079831918, -0.17581190221358603, 0.1677321315624331, 0.1409407575505183, 0.06383645338891987, -0.16536965594608702, 0.04489581250213543, -0.09150022314861417, 0.18126361669205568, 0.007010257919318974, 0.011916977767695618, 0.2853907323625012, 0.1796716521391371, 0.14311356608938214, 0.03905389227735463, -0.22866563603804702, 0.0365002844984844, -0.2984958672622109, -0.1279334356145495, -0.14732618680150777, 0.11296387269006421, -0.06495654225470977, -0.09199983917870651, 0.4152548486257301, 0.2001729875109067, 0.19618619372155152, 0.0030882479714266224, 0.28608105568598735, 0.10035074518950127, 0.04625187612734461, 0.1282958132853987, 0.36460717305467993, 0.11179457246508523, 0.15309940634167515, -0.240780075902448, -0.006474363142807109, 0.016958414439988488]
|
1,803.07945
|
Mean free path and shear viscosity in central $^{129}$Xe+$^{119}$Sn
collisions below 100 MeV/nucleon
|
Thermal and transport properties of hot nuclear matter formed in central
$^{129}$Xe + $^{119}$Sn collisions at the Fermi energy are investigated using
the isospin-dependent quantum molecular dynamical (IQMD) model. Temperature
($T$), average density ($\rho$), chemical potential ($\mu$), mean momentum
($P$), shear viscosity ($\eta$) and entropy density ($s$) are obtained from the
phase-space information. The mean free path ($\lambda_{nn}$) and the in-medium
nucleon-nucleon cross section ($\sigma_{nn}$) in the highest compressible stage
at different incident energies are deduced and compared with the experimental
results from Phys. Rev. C $\bf{90}$ (2014) 064602. The result shows that
$\lambda_{nn}$ and $\sigma_{nn}$ have the same trend and similar values as the
experimental results when the beam energy is greater than 40 MeV/u at maximum
compressed state. Furthermore, the derived shear viscosity over entropy density
($\eta/s$) shows a decreasing behaviour to a saturated value around
$\frac{3}{4\pi}$ as a function of incident energy.
|
nucl-th nucl-ex
|
thermal and transport properties of hot nuclear matter formed in central 129xe 119sn collisions at the fermi energy are investigated using the isospindependent quantum molecular dynamical iqmd model temperature t average density rho chemical potential mu mean momentum p shear viscosity eta and entropy density s are obtained from the phasespace information the mean free path lambda_nn and the inmedium nucleonnucleon cross section sigma_nn in the highest compressible stage at different incident energies are deduced and compared with the experimental results from phys rev c bf90 2014 064602 the result shows that lambda_nn and sigma_nn have the same trend and similar values as the experimental results when the beam energy is greater than 40 mevu at maximum compressed state furthermore the derived shear viscosity over entropy density etas shows a decreasing behaviour to a saturated value around frac34pi as a function of incident energy
|
[['thermal', 'and', 'transport', 'properties', 'of', 'hot', 'nuclear', 'matter', 'formed', 'in', 'central', '129xe', '119sn', 'collisions', 'at', 'the', 'fermi', 'energy', 'are', 'investigated', 'using', 'the', 'isospindependent', 'quantum', 'molecular', 'dynamical', 'iqmd', 'model', 'temperature', 't', 'average', 'density', 'rho', 'chemical', 'potential', 'mu', 'mean', 'momentum', 'p', 'shear', 'viscosity', 'eta', 'and', 'entropy', 'density', 's', 'are', 'obtained', 'from', 'the', 'phasespace', 'information', 'the', 'mean', 'free', 'path', 'lambda_nn', 'and', 'the', 'inmedium', 'nucleonnucleon', 'cross', 'section', 'sigma_nn', 'in', 'the', 'highest', 'compressible', 'stage', 'at', 'different', 'incident', 'energies', 'are', 'deduced', 'and', 'compared', 'with', 'the', 'experimental', 'results', 'from', 'phys', 'rev', 'c', 'bf90', '2014', '064602', 'the', 'result', 'shows', 'that', 'lambda_nn', 'and', 'sigma_nn', 'have', 'the', 'same', 'trend', 'and', 'similar', 'values', 'as', 'the', 'experimental', 'results', 'when', 'the', 'beam', 'energy', 'is', 'greater', 'than', '40', 'mevu', 'at', 'maximum', 'compressed', 'state', 'furthermore', 'the', 'derived', 'shear', 'viscosity', 'over', 'entropy', 'density', 'etas', 'shows', 'a', 'decreasing', 'behaviour', 'to', 'a', 'saturated', 'value', 'around', 'frac34pi', 'as', 'a', 'function', 'of', 'incident', 'energy']]
|
[-0.09540598607342039, 0.2156345073778469, -0.1363893421464502, 0.02327721643870553, 0.043462526312071856, -0.08540949892168018, 0.026707955452099027, 0.3312910130065117, -0.2184086479409435, -0.31727663482298385, -0.05343492453351252, -0.3430060341993308, 0.02333036348894499, 0.16314983283417053, 0.05630370955653749, 0.08679199108776191, 0.051731264899269894, 0.07815814573135409, -0.09246182829708226, -0.17364840804423382, 0.2478819465088834, 0.11912347504159214, 0.2743830807910828, 0.13850034402693145, 0.05640704109874013, 0.029653100594736748, 0.013053828210511303, 0.03804386071730535, -0.23216338845978735, 0.021811355502300706, 0.2421468960469706, -0.0007557875421419219, 0.16918770222227786, -0.35747221290700504, -0.23448356558158473, 0.07353250374952397, 0.07074562254299938, 0.07161984882330509, -0.020359395403200045, -0.23286905787051557, 0.07010900597674186, -0.22567376904873424, -0.13896236893675334, -0.027023805513769598, 0.07845387457205646, 0.045062945234126565, -0.26221414486766903, 0.21195754845841572, -0.03957994751427876, 0.0746492219053313, -0.10619085591279909, -0.2535510873519718, -0.1157653824087571, -0.01189142066095565, 0.042816884145694234, 0.1071250401624524, 0.24074619885377743, -0.14078811872945904, -0.024801927722886308, 0.35135478087394806, -0.07325774172479303, -0.10631071161999778, 0.16815599637477288, -0.17870578284772648, -0.07257445220561971, 0.2074148954279799, 0.15161449306093358, 0.10677056497295055, -0.12966774825962876, 0.05937653479176098, -0.02060358874073213, 0.1687356308053762, 0.11857045647994309, 0.024520954843350016, 0.18215211082097849, 0.1268112375677752, 0.006051557374649219, 0.07564458409096342, -0.1371366713176501, -0.10878680863945217, -0.2999552030090269, -0.1187991093928841, -0.18848185677901952, 0.07343209888525568, -0.08680234297640277, -0.04836879379825888, 0.323228241432901, 0.0793746193004707, 0.2375730351443969, 0.03504678879219752, 0.2680219862401694, 0.14399805523526782, 0.009745355240407993, 0.1544995695463271, 0.2609591075916078, 0.21215737498222062, 0.14741828214699546, -0.28277257995328287, 0.04097908033201328, 0.03413849175660187]
|
1,803.07946
|
Solutions concentrating around the saddle points of the potential for
Schr\"{o}dinger equations with critical exponential growth
|
In this paper, we deal with the following nonlinear Schr\"odinger equation
$$ -\epsilon^2\Delta u+V(x)u=f(u),\ u\in H^1(\mathbb R^2), $$ where $f(t)$
has critical growth of Trudinger-Moser type. By using the variational
techniques, we construct a positive solution $u_\epsilon$ concentrating around
the saddle points of the potential $V(x)$ as $\epsilon\rightarrow 0$. Our
results complete the analysis made in \cite{MR2900480} and \cite{MR3426106},
where the Schr\"odinger equation was studied in $\mathbb R^N$, $N\geq 3$ for
sub-critical and critical case respectively in the sense of Sobolev embedding.
Moreover, we relax the monotonicity condition on the nonlinear term $f(t)/t$
together with a compactness assumption on the potential $V(x)$, imposed in
\cite{MR3503193}.
|
math.AP
|
in this paper we deal with the following nonlinear schrodinger equation epsilon2delta uvxufu uin h1mathbb r2 where ft has critical growth of trudingermoser type by using the variational techniques we construct a positive solution u_epsilon concentrating around the saddle points of the potential vx as epsilonrightarrow 0 our results complete the analysis made in citemr2900480 and citemr3426106 where the schrodinger equation was studied in mathbb rn ngeq 3 for subcritical and critical case respectively in the sense of sobolev embedding moreover we relax the monotonicity condition on the nonlinear term ftt together with a compactness assumption on the potential vx imposed in citemr3503193
|
[['in', 'this', 'paper', 'we', 'deal', 'with', 'the', 'following', 'nonlinear', 'schrodinger', 'equation', 'epsilon2delta', 'uvxufu', 'uin', 'h1mathbb', 'r2', 'where', 'ft', 'has', 'critical', 'growth', 'of', 'trudingermoser', 'type', 'by', 'using', 'the', 'variational', 'techniques', 'we', 'construct', 'a', 'positive', 'solution', 'u_epsilon', 'concentrating', 'around', 'the', 'saddle', 'points', 'of', 'the', 'potential', 'vx', 'as', 'epsilonrightarrow', '0', 'our', 'results', 'complete', 'the', 'analysis', 'made', 'in', 'citemr2900480', 'and', 'citemr3426106', 'where', 'the', 'schrodinger', 'equation', 'was', 'studied', 'in', 'mathbb', 'rn', 'ngeq', '3', 'for', 'subcritical', 'and', 'critical', 'case', 'respectively', 'in', 'the', 'sense', 'of', 'sobolev', 'embedding', 'moreover', 'we', 'relax', 'the', 'monotonicity', 'condition', 'on', 'the', 'nonlinear', 'term', 'ftt', 'together', 'with', 'a', 'compactness', 'assumption', 'on', 'the', 'potential', 'vx', 'imposed', 'in', 'citemr3503193']]
|
[-0.15469022194854914, -0.004500808068551123, -0.03512330370955169, 0.022935017551062628, -0.06514852554537356, -0.18535486260429024, -0.012291175503050908, 0.2957847533421591, -0.2562777617201209, -0.15459397575818, 0.1551463893370237, -0.3531589228659868, -0.13817119886167348, 0.14790953908814117, -0.06550985079258681, 0.10025118796620518, 0.002905290890485048, 0.07071463650092483, -0.0785992535855621, -0.2142672109976411, 0.3965613611694425, -0.10252024142071604, 0.17490471591590903, 0.06566474710591137, 0.08156903915572912, -0.012191809741780161, 0.0807933866744861, -0.019417170658707617, -0.26031258459202944, 0.06297573735238984, 0.17372936979634687, 0.053328512450680134, 0.3461395915970206, -0.4223249998409301, -0.23571337894070893, 0.17588042998686432, 0.15161530736833811, -0.007963456977158785, -0.07482965802308172, -0.33175633841892704, 0.0993743167235516, -0.06405063431710005, -0.22140734636690468, -0.04647142697125673, 0.06437261276878417, 0.07838136380829383, -0.3454102172423154, 0.12187177158892154, 0.10599565710872412, 0.012148258956149221, -0.16601839901180937, -0.10238875877577812, -0.03698236443451606, 0.01740264502353966, 0.03143524213228375, 0.12773160608368925, 0.004666146920062602, -0.10895060813752934, -0.019209963945904747, 0.3430995333287865, -0.12044143879786134, -0.2585958229377866, 0.09579039751552046, -0.1665001513203606, -0.17689791802316904, 0.03776199382264167, 0.13046677107224242, 0.16084301861934364, -0.10493949251249432, 0.2513626840140205, -0.00601112829754129, 0.13409281542524695, 0.1276457658689469, -0.027569038113579154, 0.03733349195215851, 0.14029606448486448, 0.13041778238490223, 0.11766309252940119, -0.030857416335493326, -0.08624579054536298, -0.35510690143331886, -0.12332578614354134, -0.1793163587525487, 0.15162346375291236, -0.12077081001683837, -0.14337340906495227, 0.3418043242977001, 0.10085809271899052, 0.17226430678740143, 0.0618781914934516, 0.1714949261350557, 0.17585909597575664, -0.017088388637639583, 0.0869753153808415, 0.19615319985314272, 0.12431057436391711, 0.14944557894486935, -0.1902733895194251, -0.04114790584193542, 0.15046853887848555]
|
1,803.07947
|
Crowd-Machine Collaboration for Item Screening
|
In this paper we describe how crowd and machine classifier can be efficiently
combined to screen items that satisfy a set of predicates. We show that this is
a recurring problem in many domains, present machine-human (hybrid) algorithms
that screen items efficiently and estimate the gain over human-only or
machine-only screening in terms of performance and cost.
|
cs.HC cs.LG
|
in this paper we describe how crowd and machine classifier can be efficiently combined to screen items that satisfy a set of predicates we show that this is a recurring problem in many domains present machinehuman hybrid algorithms that screen items efficiently and estimate the gain over humanonly or machineonly screening in terms of performance and cost
|
[['in', 'this', 'paper', 'we', 'describe', 'how', 'crowd', 'and', 'machine', 'classifier', 'can', 'be', 'efficiently', 'combined', 'to', 'screen', 'items', 'that', 'satisfy', 'a', 'set', 'of', 'predicates', 'we', 'show', 'that', 'this', 'is', 'a', 'recurring', 'problem', 'in', 'many', 'domains', 'present', 'machinehuman', 'hybrid', 'algorithms', 'that', 'screen', 'items', 'efficiently', 'and', 'estimate', 'the', 'gain', 'over', 'humanonly', 'or', 'machineonly', 'screening', 'in', 'terms', 'of', 'performance', 'and', 'cost']]
|
[-0.06630748076297875, 0.0348923248904092, -0.10531905808186691, 0.0866708942635991, -0.11595300014596432, -0.14035578808813756, 0.095755178379477, 0.4176738542903747, -0.3072564272941755, -0.31520658185971634, 0.09066002554235249, -0.2776728669580604, -0.1885060500031354, 0.17027477030179788, -0.15813405203100825, 0.02888184559664556, 0.10046308753745896, 0.022875180900362984, -0.007326415111102895, -0.325995283400906, 0.3305340706740805, -0.011361387874265867, 0.2572994340610291, 0.04956082157358261, 0.09850645015415337, -0.00269427801582164, 0.027560943072395667, 0.111884924221418, -0.05367844571121948, 0.17107496638241823, 0.357646688652624, 0.21450397254167392, 0.3308950427453965, -0.4357557426805475, -0.1904067505383864, 0.14658688128526723, 0.15218507565857312, 0.08698742573947779, -0.0379385568750357, -0.2256731564245586, 0.1526305287469378, -0.19910909943947835, -0.008572561491746455, -0.14302745066067604, -0.03240076609654352, 0.04535517848229834, -0.30868678907531183, 0.0020468446808601065, 0.0320615051324629, 0.016804805856996348, -0.04247140318953565, -0.050234811596705446, 0.10339806566896316, 0.11483734315385975, 0.04416609781245435, 0.041979290066852366, 0.12766446880206267, -0.13755088973890192, -0.15733708677414274, 0.38395875768869053, -0.035359484975093176, -0.22833088644048466, 0.18137000790531083, -0.07866586516943894, -0.11424717643032116, 0.08755240010629807, 0.2832038742323805, 0.12320685878096681, -0.19235745609538363, 0.04025215396645113, -0.08998522242265088, 0.22349474402809782, 0.07298295482178219, 0.026449574082757214, 0.17580699982603878, 0.17692662685710406, 0.06529238176361625, 0.1703354800390246, -0.0376771946570703, -0.01170219514252884, -0.2464177375991962, -0.18793629119837924, -0.1792479334898027, -0.033528113554764004, -0.08446863715159582, -0.16210433993754642, 0.38020251245637027, 0.25197253378740114, 0.20020515220572374, 0.09122362769474941, 0.30569057564051555, 0.07211107988327317, 0.07396505856221276, 0.11782516104306394, 0.13368597202185942, -0.028260749473702163, 0.09165099187313379, -0.1751017600846743, 0.08431891820094149, 0.04701307138228523]
|
1,803.07948
|
Higher Lelong numbers and convex geometry
|
We prove the reversed Alexandrov-Fenchel inequality for mixed Monge-Amp\`ere
masses of plurisubharmonic functions, which generalizes a result of Demailly
and Pham. As applications to convex geometry, this gives a complex analytic
proof of the reversed Alexandrov-Fenchel inequality for mixed covolumes, which
generalizes recent results in convex geometry of Kaveh-Khovanskii,
Khovanskii-Timorin, Milman-Rotem and R. Schneider on reversed (or complemented)
Brunn-Minkowski and Alexandrov-Fenchel inequalities. Also for toric
plurisubharmonic functions in the Cegrell class, we confirm Demailly's
conjecture on the convergence of higher Lelong numbers under the canonical
approximation.
|
math.CV math.AG math.MG
|
we prove the reversed alexandrovfenchel inequality for mixed mongeampere masses of plurisubharmonic functions which generalizes a result of demailly and pham as applications to convex geometry this gives a complex analytic proof of the reversed alexandrovfenchel inequality for mixed covolumes which generalizes recent results in convex geometry of kavehkhovanskii khovanskiitimorin milmanrotem and r schneider on reversed or complemented brunnminkowski and alexandrovfenchel inequalities also for toric plurisubharmonic functions in the cegrell class we confirm demaillys conjecture on the convergence of higher lelong numbers under the canonical approximation
|
[['we', 'prove', 'the', 'reversed', 'alexandrovfenchel', 'inequality', 'for', 'mixed', 'mongeampere', 'masses', 'of', 'plurisubharmonic', 'functions', 'which', 'generalizes', 'a', 'result', 'of', 'demailly', 'and', 'pham', 'as', 'applications', 'to', 'convex', 'geometry', 'this', 'gives', 'a', 'complex', 'analytic', 'proof', 'of', 'the', 'reversed', 'alexandrovfenchel', 'inequality', 'for', 'mixed', 'covolumes', 'which', 'generalizes', 'recent', 'results', 'in', 'convex', 'geometry', 'of', 'kavehkhovanskii', 'khovanskiitimorin', 'milmanrotem', 'and', 'r', 'schneider', 'on', 'reversed', 'or', 'complemented', 'brunnminkowski', 'and', 'alexandrovfenchel', 'inequalities', 'also', 'for', 'toric', 'plurisubharmonic', 'functions', 'in', 'the', 'cegrell', 'class', 'we', 'confirm', 'demaillys', 'conjecture', 'on', 'the', 'convergence', 'of', 'higher', 'lelong', 'numbers', 'under', 'the', 'canonical', 'approximation']]
|
[-0.1305837308533401, -0.002498581589731787, -0.1185740661541266, 0.16120882540070897, -0.08541092924064114, -0.18190897494510172, 0.008563606600676264, 0.24957538315183705, -0.2872676304208913, -0.1898084347735026, 0.11140632859453381, -0.23869883956199156, -0.1535941344114863, 0.2814006273485055, -0.2064651277004963, 0.060163728560187986, 0.013096849212334269, -0.07223049413767599, -0.14241243042384408, -0.2956071746801691, 0.4004986918575707, -0.1005896599298077, 0.2080629923480696, 0.18644359090484658, 0.04860635839300119, 0.058737535268023965, 0.011639239199991738, 0.012997728894420323, -0.22833950853063947, 0.19599586864933372, 0.26668529693658155, 0.14345559116641415, 0.24525705503211134, -0.3565761338409391, -0.13585410694247999, 0.14794611977967656, 0.08803903138531106, -0.024836664556503473, -0.054729227686212176, -0.3048876940073179, 0.04676242073747701, -0.08329745616009902, -0.2599438677674958, -0.09179500779247887, -0.00800205433430771, 0.0914775813441901, -0.33667400735984776, 0.13433519695085816, 0.15196774816805764, 0.10307068966600734, -0.10528534883633256, -0.14873865180804083, -0.030786330074382324, -0.048031134206602086, 0.01663466461468488, 0.11119838598339508, 0.04350994865498727, -0.02611418740014501, -0.1546870994470304, 0.26403523308025406, -0.05409297961852558, -0.25899180721136783, 0.1255373558517368, -0.18872228879038067, -0.20895744443294548, 0.03962901459834982, 0.1299487392894835, 0.22239166662274373, -0.013393742498010397, 0.1717508905657312, -0.15291514906233974, 0.03224374292351838, 0.17873511278247906, 0.026612214744091034, 0.037230951007499936, 0.03348925442523545, 0.17826001623844995, 0.1866963414525214, 0.0751389647068988, -0.1072416218563116, -0.34359299808385824, -0.22357686664465637, -0.20386829309254176, 0.17409158946317066, -0.14254459322910407, -0.17799810874497607, 0.31587624159597216, -0.02022708367024149, 0.10824180755298585, 0.18135122247760938, 0.1937309619457838, 0.06645162885736984, 0.017316255773905487, 0.054052900445337095, 0.1713407974110894, 0.28998708243792254, 0.10409825672173784, -0.13153853410455799, 0.03226059232422683, 0.23337375102675564]
|
1,803.07949
|
Spin caloric effects in antiferromagnets assisted by an external spin
current
|
Searching for novel spin caloric effects in antiferromagnets we study the
properties of thermally activated magnons in the presence of an external spin
current and temperature gradient. We predict the spin Peltier effect --
generation of a heat flux by spin accumulation -- in an antiferromagnetic
insulator with cubic or uniaxial magnetic symmetry. This effect is related with
spin-current induced splitting of the relaxation times of the magnons with
opposite spin direction. We show that the Peltier effect can trigger
antiferromagnetic domain wall motion with a force whose value grows with the
temperature of a sample. At a temperature, larger than the energy of the
low-frequency magnons, this force is much larger than the force caused by
direct spin transfer between the spin current and the domain wall. We also
demonstrate that the external spin current can induce the magnon spin Seebeck
effect. The corresponding Seebeck coefficient is controlled by the current
density. These spin-current assisted caloric effects open new ways for the
manipulation of the magnetic states in antiferromagnets.
|
cond-mat.mes-hall
|
searching for novel spin caloric effects in antiferromagnets we study the properties of thermally activated magnons in the presence of an external spin current and temperature gradient we predict the spin peltier effect generation of a heat flux by spin accumulation in an antiferromagnetic insulator with cubic or uniaxial magnetic symmetry this effect is related with spincurrent induced splitting of the relaxation times of the magnons with opposite spin direction we show that the peltier effect can trigger antiferromagnetic domain wall motion with a force whose value grows with the temperature of a sample at a temperature larger than the energy of the lowfrequency magnons this force is much larger than the force caused by direct spin transfer between the spin current and the domain wall we also demonstrate that the external spin current can induce the magnon spin seebeck effect the corresponding seebeck coefficient is controlled by the current density these spincurrent assisted caloric effects open new ways for the manipulation of the magnetic states in antiferromagnets
|
[['searching', 'for', 'novel', 'spin', 'caloric', 'effects', 'in', 'antiferromagnets', 'we', 'study', 'the', 'properties', 'of', 'thermally', 'activated', 'magnons', 'in', 'the', 'presence', 'of', 'an', 'external', 'spin', 'current', 'and', 'temperature', 'gradient', 'we', 'predict', 'the', 'spin', 'peltier', 'effect', 'generation', 'of', 'a', 'heat', 'flux', 'by', 'spin', 'accumulation', 'in', 'an', 'antiferromagnetic', 'insulator', 'with', 'cubic', 'or', 'uniaxial', 'magnetic', 'symmetry', 'this', 'effect', 'is', 'related', 'with', 'spincurrent', 'induced', 'splitting', 'of', 'the', 'relaxation', 'times', 'of', 'the', 'magnons', 'with', 'opposite', 'spin', 'direction', 'we', 'show', 'that', 'the', 'peltier', 'effect', 'can', 'trigger', 'antiferromagnetic', 'domain', 'wall', 'motion', 'with', 'a', 'force', 'whose', 'value', 'grows', 'with', 'the', 'temperature', 'of', 'a', 'sample', 'at', 'a', 'temperature', 'larger', 'than', 'the', 'energy', 'of', 'the', 'lowfrequency', 'magnons', 'this', 'force', 'is', 'much', 'larger', 'than', 'the', 'force', 'caused', 'by', 'direct', 'spin', 'transfer', 'between', 'the', 'spin', 'current', 'and', 'the', 'domain', 'wall', 'we', 'also', 'demonstrate', 'that', 'the', 'external', 'spin', 'current', 'can', 'induce', 'the', 'magnon', 'spin', 'seebeck', 'effect', 'the', 'corresponding', 'seebeck', 'coefficient', 'is', 'controlled', 'by', 'the', 'current', 'density', 'these', 'spincurrent', 'assisted', 'caloric', 'effects', 'open', 'new', 'ways', 'for', 'the', 'manipulation', 'of', 'the', 'magnetic', 'states', 'in', 'antiferromagnets']]
|
[-0.19616242814282442, 0.2741029221390255, -0.019007857894480583, -0.0043535092810911705, -0.10191134953007956, -0.06599094479766097, 0.02439584696479696, 0.38184798087569927, -0.3032248928461091, -0.27769646596252207, 0.030938345029772746, -0.30486662683653687, -0.07850212605747704, 0.2273778980085072, 0.07722407104890971, -0.03381888882445526, -0.06601307009224824, 0.006149038533857535, -0.08558776976063937, -0.1613116565311516, 0.26614024046631085, -0.0017477779904203046, 0.332585051217826, 0.1178905834233211, 0.07653107651276514, 0.016520647815750203, 0.11047798769903325, 0.04232902541047051, -0.1393913252704806, 0.03683732855348526, 0.18911301556120938, -0.1460190096626147, 0.1741923458508349, -0.47785962379094554, -0.20344799299657876, 0.07652291036876184, 0.10462045441437069, 0.20526248131257793, -0.08072373722929374, -0.2660209348292223, 0.014276550459076784, -0.18893607815178776, -0.11814705801953096, -0.0785225331616987, 0.008588417706223914, -0.021537973535790417, -0.25858534075364115, 0.16692460593999603, 0.13155717478643747, 0.08658949307365608, -0.06968530436695021, -0.13761004664827073, -0.08805954586603634, 0.04508323060387435, 0.1051445392229306, 0.07659031351656831, 0.21922787471842076, -0.16632454437092833, -0.17577010705800994, 0.2935420368531985, -0.1030746862415981, -0.1691100927557619, 0.12974040066390963, -0.20242958185276838, -0.01122946645565597, 0.12479840602914226, 0.1257535801379986, 0.1085015219481041, -0.14371092375811367, 0.030376438879535443, 0.03311256327807704, 0.15253442190268765, 0.022319491054596647, 0.05144521738180802, 0.3130906360567592, 0.19922515558677592, 0.09666938083717555, 0.20131946221781186, -0.15912759457049624, -0.033582562600107245, -0.218445959735185, -0.1650586881719175, -0.24901134193143143, 0.12336910774484706, -0.08910438735931946, -0.13586175022300312, 0.40982100655258236, 0.2049407198515144, 0.14262749591753596, -0.05355084170947694, 0.30763665050090777, 0.1642757331331571, 0.10155929854261644, 0.0625969773308108, 0.24785471576199467, 0.16646133385005496, 0.14038480727911173, -0.4052627807305682, 0.07266061366092236, 0.007059097915771417]
|
1,803.0795
|
End-to-End Video Captioning with Multitask Reinforcement Learning
|
Although end-to-end (E2E) learning has led to impressive progress on a
variety of visual understanding tasks, it is often impeded by hardware
constraints (e.g., GPU memory) and is prone to overfitting. When it comes to
video captioning, one of the most challenging benchmark tasks in computer
vision, those limitations of E2E learning are especially amplified by the fact
that both the input videos and output captions are lengthy sequences. Indeed,
state-of-the-art methods for video captioning process video frames by
convolutional neural networks and generate captions by unrolling recurrent
neural networks. If we connect them in an E2E manner, the resulting model is
both memory-consuming and data-hungry, making it extremely hard to train. In
this paper, we propose a multitask reinforcement learning approach to training
an E2E video captioning model. The main idea is to mine and construct as many
effective tasks (e.g., attributes, rewards, and the captions) as possible from
the human captioned videos such that they can jointly regulate the search space
of the E2E neural network, from which an E2E video captioning model can be
found and generalized to the testing phase. To the best of our knowledge, this
is the first video captioning model that is trained end-to-end from the raw
video input to the caption output. Experimental results show that such a model
outperforms existing ones to a large margin on two benchmark video captioning
datasets.
|
cs.CV
|
although endtoend e2e learning has led to impressive progress on a variety of visual understanding tasks it is often impeded by hardware constraints eg gpu memory and is prone to overfitting when it comes to video captioning one of the most challenging benchmark tasks in computer vision those limitations of e2e learning are especially amplified by the fact that both the input videos and output captions are lengthy sequences indeed stateoftheart methods for video captioning process video frames by convolutional neural networks and generate captions by unrolling recurrent neural networks if we connect them in an e2e manner the resulting model is both memoryconsuming and datahungry making it extremely hard to train in this paper we propose a multitask reinforcement learning approach to training an e2e video captioning model the main idea is to mine and construct as many effective tasks eg attributes rewards and the captions as possible from the human captioned videos such that they can jointly regulate the search space of the e2e neural network from which an e2e video captioning model can be found and generalized to the testing phase to the best of our knowledge this is the first video captioning model that is trained endtoend from the raw video input to the caption output experimental results show that such a model outperforms existing ones to a large margin on two benchmark video captioning datasets
|
[['although', 'endtoend', 'e2e', 'learning', 'has', 'led', 'to', 'impressive', 'progress', 'on', 'a', 'variety', 'of', 'visual', 'understanding', 'tasks', 'it', 'is', 'often', 'impeded', 'by', 'hardware', 'constraints', 'eg', 'gpu', 'memory', 'and', 'is', 'prone', 'to', 'overfitting', 'when', 'it', 'comes', 'to', 'video', 'captioning', 'one', 'of', 'the', 'most', 'challenging', 'benchmark', 'tasks', 'in', 'computer', 'vision', 'those', 'limitations', 'of', 'e2e', 'learning', 'are', 'especially', 'amplified', 'by', 'the', 'fact', 'that', 'both', 'the', 'input', 'videos', 'and', 'output', 'captions', 'are', 'lengthy', 'sequences', 'indeed', 'stateoftheart', 'methods', 'for', 'video', 'captioning', 'process', 'video', 'frames', 'by', 'convolutional', 'neural', 'networks', 'and', 'generate', 'captions', 'by', 'unrolling', 'recurrent', 'neural', 'networks', 'if', 'we', 'connect', 'them', 'in', 'an', 'e2e', 'manner', 'the', 'resulting', 'model', 'is', 'both', 'memoryconsuming', 'and', 'datahungry', 'making', 'it', 'extremely', 'hard', 'to', 'train', 'in', 'this', 'paper', 'we', 'propose', 'a', 'multitask', 'reinforcement', 'learning', 'approach', 'to', 'training', 'an', 'e2e', 'video', 'captioning', 'model', 'the', 'main', 'idea', 'is', 'to', 'mine', 'and', 'construct', 'as', 'many', 'effective', 'tasks', 'eg', 'attributes', 'rewards', 'and', 'the', 'captions', 'as', 'possible', 'from', 'the', 'human', 'captioned', 'videos', 'such', 'that', 'they', 'can', 'jointly', 'regulate', 'the', 'search', 'space', 'of', 'the', 'e2e', 'neural', 'network', 'from', 'which', 'an', 'e2e', 'video', 'captioning', 'model', 'can', 'be', 'found', 'and', 'generalized', 'to', 'the', 'testing', 'phase', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'video', 'captioning', 'model', 'that', 'is', 'trained', 'endtoend', 'from', 'the', 'raw', 'video', 'input', 'to', 'the', 'caption', 'output', 'experimental', 'results', 'show', 'that', 'such', 'a', 'model', 'outperforms', 'existing', 'ones', 'to', 'a', 'large', 'margin', 'on', 'two', 'benchmark', 'video', 'captioning', 'datasets']]
|
[-0.057679077958607154, 0.00789987530689636, -0.041390041040216125, 0.08220335342849348, -0.12824499203884246, -0.19558808638552286, -0.01330295848791771, 0.5077225444595451, -0.29036398591402834, -0.34913412326056026, 0.05345113127057076, -0.28173322976242915, -0.2312467819666895, 0.20141235961902726, -0.22013482275702384, 0.11322013343249084, 0.20061830500059802, 0.06772232462409074, -0.026192325785624512, -0.34215420798762985, 0.26956256940535717, 0.0338837012380321, 0.3551991760163851, 0.011603151788206204, 0.14587280671618394, -0.08946534017222407, -0.01336933291104683, -0.07649620287183612, -0.005647626829601865, 0.1851063295543376, 0.3777714876943956, 0.24452841987823257, 0.3319312108032729, -0.41775808502798495, -0.2365241754364789, 0.0786058447394601, 0.14554348826729793, 0.1053070417018835, -0.03560189966962713, -0.3824429477160068, 0.10767173071432373, -0.19020374041334118, 0.12521085176685237, -0.1583765607225992, -0.009700239407222555, -0.031983297375162416, -0.3093558536194589, -0.021877327258319028, 0.09128490264284546, 0.02569279357507501, -0.037352238770614825, -0.05100053088010653, 0.02907489355876232, 0.2012395064039004, 0.08611736388753026, 0.13948243133035368, 0.15297204638102457, -0.2663393098504141, -0.1503558191106371, 0.4103959229653296, -0.05239495313321443, -0.1991593852456983, 0.21363935321569444, 0.026318742010904395, -0.14593065286500623, 0.1027233682679134, 0.232000088037761, 0.1111755650146338, -0.20424498985856823, -0.02227316712935293, -0.06218418671304117, 0.21428812248632312, 0.05743282684327468, 0.001055711050234411, 0.21062624775450273, 0.30114796565865853, -0.019681090335412276, 0.12772443796376415, -0.109851611463186, -0.08622218303751888, -0.16961873028346378, -0.05642395657487213, -0.20967778211419025, -0.022920945048858613, -0.09825394932470416, -0.11883347187059648, 0.3668109389366177, 0.27671809813270914, 0.20378775795030854, 0.15097364445632, 0.4231701001929848, -0.003705876651118793, 0.13489544643494097, 0.09088857476599514, 0.14449038805399575, -0.06347843410406748, 0.16744602693133462, -0.1459387246488958, 0.08304975351581917, 0.06527568362349563]
|
1,803.07951
|
Testing Continuity of a Density via g-order statistics in the Regression
Discontinuity Design
|
In the regression discontinuity design (RDD), it is common practice to assess
the credibility of the design by testing the continuity of the density of the
running variable at the cut-off, e.g., McCrary (2008). In this paper we propose
an approximate sign test for continuity of a density at a point based on the
so-called g-order statistics, and study its properties under two complementary
asymptotic frameworks. In the first asymptotic framework, the number q of
observations local to the cut-off is fixed as the sample size n diverges to
infinity, while in the second framework q diverges to infinity slowly as n
diverges to infinity. Under both of these frameworks, we show that the test we
propose is asymptotically valid in the sense that it has limiting rejection
probability under the null hypothesis not exceeding the nominal level. More
importantly, the test is easy to implement, asymptotically valid under weaker
conditions than those used by competing methods, and exhibits finite sample
validity under stronger conditions than those needed for its asymptotic
validity. In a simulation study, we find that the approximate sign test
provides good control of the rejection probability under the null hypothesis
while remaining competitive under the alternative hypothesis. We finally apply
our test to the design in Lee (2008), a well-known application of the RDD to
study incumbency advantage.
|
econ.EM
|
in the regression discontinuity design rdd it is common practice to assess the credibility of the design by testing the continuity of the density of the running variable at the cutoff eg mccrary 2008 in this paper we propose an approximate sign test for continuity of a density at a point based on the socalled gorder statistics and study its properties under two complementary asymptotic frameworks in the first asymptotic framework the number q of observations local to the cutoff is fixed as the sample size n diverges to infinity while in the second framework q diverges to infinity slowly as n diverges to infinity under both of these frameworks we show that the test we propose is asymptotically valid in the sense that it has limiting rejection probability under the null hypothesis not exceeding the nominal level more importantly the test is easy to implement asymptotically valid under weaker conditions than those used by competing methods and exhibits finite sample validity under stronger conditions than those needed for its asymptotic validity in a simulation study we find that the approximate sign test provides good control of the rejection probability under the null hypothesis while remaining competitive under the alternative hypothesis we finally apply our test to the design in lee 2008 a wellknown application of the rdd to study incumbency advantage
|
[['in', 'the', 'regression', 'discontinuity', 'design', 'rdd', 'it', 'is', 'common', 'practice', 'to', 'assess', 'the', 'credibility', 'of', 'the', 'design', 'by', 'testing', 'the', 'continuity', 'of', 'the', 'density', 'of', 'the', 'running', 'variable', 'at', 'the', 'cutoff', 'eg', 'mccrary', '2008', 'in', 'this', 'paper', 'we', 'propose', 'an', 'approximate', 'sign', 'test', 'for', 'continuity', 'of', 'a', 'density', 'at', 'a', 'point', 'based', 'on', 'the', 'socalled', 'gorder', 'statistics', 'and', 'study', 'its', 'properties', 'under', 'two', 'complementary', 'asymptotic', 'frameworks', 'in', 'the', 'first', 'asymptotic', 'framework', 'the', 'number', 'q', 'of', 'observations', 'local', 'to', 'the', 'cutoff', 'is', 'fixed', 'as', 'the', 'sample', 'size', 'n', 'diverges', 'to', 'infinity', 'while', 'in', 'the', 'second', 'framework', 'q', 'diverges', 'to', 'infinity', 'slowly', 'as', 'n', 'diverges', 'to', 'infinity', 'under', 'both', 'of', 'these', 'frameworks', 'we', 'show', 'that', 'the', 'test', 'we', 'propose', 'is', 'asymptotically', 'valid', 'in', 'the', 'sense', 'that', 'it', 'has', 'limiting', 'rejection', 'probability', 'under', 'the', 'null', 'hypothesis', 'not', 'exceeding', 'the', 'nominal', 'level', 'more', 'importantly', 'the', 'test', 'is', 'easy', 'to', 'implement', 'asymptotically', 'valid', 'under', 'weaker', 'conditions', 'than', 'those', 'used', 'by', 'competing', 'methods', 'and', 'exhibits', 'finite', 'sample', 'validity', 'under', 'stronger', 'conditions', 'than', 'those', 'needed', 'for', 'its', 'asymptotic', 'validity', 'in', 'a', 'simulation', 'study', 'we', 'find', 'that', 'the', 'approximate', 'sign', 'test', 'provides', 'good', 'control', 'of', 'the', 'rejection', 'probability', 'under', 'the', 'null', 'hypothesis', 'while', 'remaining', 'competitive', 'under', 'the', 'alternative', 'hypothesis', 'we', 'finally', 'apply', 'our', 'test', 'to', 'the', 'design', 'in', 'lee', '2008', 'a', 'wellknown', 'application', 'of', 'the', 'rdd', 'to', 'study', 'incumbency', 'advantage']]
|
[-0.10117976364139891, 0.052231961619492555, -0.12682723291456402, 0.09947371109843847, -0.04826925972963429, -0.14559010185555302, 0.08166447482759726, 0.3478089655622501, -0.18728770199443467, -0.28330631197895856, 0.10688864092861133, -0.23278702538968488, -0.10474996599157087, 0.1752397428012707, -0.062166341035415164, 0.09617879221120595, 0.017744070549749514, 0.06124028180598874, -0.08696300198789686, -0.26506488942117856, 0.28718493334864353, 0.10548607741736553, 0.3563290758164261, 0.008972257300840945, 0.07214055135396351, 0.023531815644607625, 0.01124224843542007, 0.02360879262454215, -0.14362141071466217, 0.0609383211301809, 0.20824284180575472, 0.14361594187265092, 0.3177182736467909, -0.3926774102905421, -0.16540468612960962, 0.10356086327228695, 0.10725337276360898, 0.05161843695677817, -0.0054640776920264625, -0.2297549680182287, 0.1488468112974343, -0.12824105149537154, -0.18576155777766623, -0.06972775203175843, 0.003254607880742035, -0.0007097672327125276, -0.3141148455403957, 0.07215048009106381, 0.09374357912985777, 0.029127745323983784, -0.03806990012367764, -0.11353234599915926, 0.03717658942861652, 0.0893968928054991, 0.11288241479672831, 4.21190778566101e-05, 0.09695233258799735, -0.10419463265359148, -0.07151596575329842, 0.34945206029806286, -0.08961983469238145, -0.21566998615691607, 0.22666114793603562, -0.15023860532621092, -0.13896096928510815, 0.08685433914334598, 0.1532967976881826, 0.13217707100980491, -0.14089799152888274, 0.11342046663366173, -0.02961823955093595, 0.13997324408013478, 0.09530116959728978, -0.0013068415933627296, 0.15238485493041068, 0.152610274607485, 0.11238927443681115, 0.17686358672482047, -0.1085781169187447, -0.09034944899507205, -0.3586089720457411, -0.15262059554119, -0.17699646691961043, 0.03429942761490979, -0.12129594274804482, -0.16147731116718866, 0.3564228785467673, 0.22941813792885196, 0.18180251938214165, 0.11953308154320852, 0.27612043439664624, 0.12239715165024707, 0.022144864478402516, 0.10504902074952208, 0.23989336542488837, 0.09673727652460168, 0.03367525955281136, -0.2053930462117106, 0.10538661898727614, 0.02497537869957424]
|
1,803.07952
|
An Exercise Fatigue Detection Model Based on Machine Learning Methods
|
This study proposes an exercise fatigue detection model based on real-time
clinical data which includes time domain analysis, frequency domain analysis,
detrended fluctuation analysis, approximate entropy, and sample entropy.
Furthermore, this study proposed a feature extraction method which is combined
with an analytical hierarchy process to analyze and extract critical features.
Finally, machine learning algorithms were adopted to analyze the data of each
feature for the detection of exercise fatigue. The practical experimental
results showed that the proposed exercise fatigue detection model and feature
extraction method could precisely detect the level of exercise fatigue, and the
accuracy of exercise fatigue detection could be improved up to 98.65%.
|
stat.ML cs.LG
|
this study proposes an exercise fatigue detection model based on realtime clinical data which includes time domain analysis frequency domain analysis detrended fluctuation analysis approximate entropy and sample entropy furthermore this study proposed a feature extraction method which is combined with an analytical hierarchy process to analyze and extract critical features finally machine learning algorithms were adopted to analyze the data of each feature for the detection of exercise fatigue the practical experimental results showed that the proposed exercise fatigue detection model and feature extraction method could precisely detect the level of exercise fatigue and the accuracy of exercise fatigue detection could be improved up to 9865
|
[['this', 'study', 'proposes', 'an', 'exercise', 'fatigue', 'detection', 'model', 'based', 'on', 'realtime', 'clinical', 'data', 'which', 'includes', 'time', 'domain', 'analysis', 'frequency', 'domain', 'analysis', 'detrended', 'fluctuation', 'analysis', 'approximate', 'entropy', 'and', 'sample', 'entropy', 'furthermore', 'this', 'study', 'proposed', 'a', 'feature', 'extraction', 'method', 'which', 'is', 'combined', 'with', 'an', 'analytical', 'hierarchy', 'process', 'to', 'analyze', 'and', 'extract', 'critical', 'features', 'finally', 'machine', 'learning', 'algorithms', 'were', 'adopted', 'to', 'analyze', 'the', 'data', 'of', 'each', 'feature', 'for', 'the', 'detection', 'of', 'exercise', 'fatigue', 'the', 'practical', 'experimental', 'results', 'showed', 'that', 'the', 'proposed', 'exercise', 'fatigue', 'detection', 'model', 'and', 'feature', 'extraction', 'method', 'could', 'precisely', 'detect', 'the', 'level', 'of', 'exercise', 'fatigue', 'and', 'the', 'accuracy', 'of', 'exercise', 'fatigue', 'detection', 'could', 'be', 'improved', 'up', 'to', '9865']]
|
[-0.029900392324428673, -0.012515099426755629, -0.1595891700741255, 0.03919743740102861, -0.10166857904701862, -0.16820092071814216, 0.09829728022428616, 0.3949112128642089, -0.23188244354612422, -0.324859255652453, 0.15302485897082765, -0.2685506865140578, -0.17151049661168935, 0.23543667887724093, -0.09587531360437355, 0.08997985971915834, 0.11701445051091108, 0.05102251644931593, -0.034717855970638825, -0.22024475309540922, 0.22319674447952015, 0.0833579852105171, 0.419134416740458, 0.07266212885492077, 0.07569030690103558, -0.017399219611554214, -0.10091004249165361, -0.029266646232912846, -0.11898544143682471, 0.13497785803914633, 0.32565913620879344, 0.19756547477149036, 0.28222653860191127, -0.35698422156064274, -0.24822190565382182, 0.08410385576568825, 0.1161408045676203, 0.08932787483944646, -0.02295278424709016, -0.335230168078165, 0.09831905293603481, -0.1470515003146709, -0.07059282226101407, -0.15038753625110918, 0.008412375048962686, -0.08135543409998547, -0.28679965668410623, 0.08215783173130509, 0.04873628895026895, 0.12162582079862368, -0.09853348578765707, -0.07746015863168, 0.05831665685400367, 0.14301165845245123, 0.09528018206875236, 0.01621793454896246, 0.1973844654429792, -0.10496026709377063, -0.1708240438898463, 0.32455798999388824, -0.035357038721657484, -0.1596929406360635, 0.1712734407222531, -0.03756252424967176, -0.13047816793715475, 0.09614982725700962, 0.2655075721811714, 0.08831329738286342, -0.20299358957640404, -0.060154173441916564, 0.05876053592084714, 0.22297428252245738, 0.04243364048032266, -0.07949360535163784, 0.14322018387006982, 0.25682138173647645, -0.009188777485967806, 0.17567548795519747, -0.17946539926210875, -0.029023601691115578, -0.2933503607999674, -0.15089114090726483, -0.14935497363660274, -0.031079334407860308, -0.1175394894567292, -0.16209599976691436, 0.43463301583070235, 0.2524731676445676, 0.11845383417072161, 0.07699833379153444, 0.3296358334427735, 0.1327794626320027, 0.05203272007792344, 0.031531408530185524, 0.20701735938310553, 0.014160829949860444, 0.1148447722486519, -0.259689633563196, 0.12324769048125676, 0.049216228730554853]
|
1,803.07953
|
Jordan left {g, h}-derivations over some algebras
|
In this article, left {g, h}-derivation and Jordan left {g, h}-derivation on
algebras are introduced. It is shown that there is no Jordan left {g,
h}-derivation over $\mathcal{M}_n(C)$ and $\mathbb{H}_{\mathbb{R}}$, for g not
equal to h. Examples are given which show that every Jordan left $\{g,
h\}$-derivation over $\mathcal{T}_n(C)$, $\mathcal{M}_n(C)$ and
$\mathbb{H}_{\mathbb{R}}$ are not left $\{g, h\}$-derivations. Moreover, we
characterize left $\{g, h\}$-derivation and Jordan left $\{g, h\}$-derivation
over $\mathcal{T}_n(C)$, $\mathcal{M}_n(C)$ and $\mathbb{H}_{\mathbb{R}}$
respectively. Also, we prove the result of Jordan left $\{g, h\}$-derivation to
be a left $\{g, h\}$-derivation over tensor products of algebras as well as for
algebra of polynomials.
|
math.RA
|
in this article left g hderivation and jordan left g hderivation on algebras are introduced it is shown that there is no jordan left g hderivation over mathcalm_nc and mathbbh_mathbbr for g not equal to h examples are given which show that every jordan left g hderivation over mathcalt_nc mathcalm_nc and mathbbh_mathbbr are not left g hderivations moreover we characterize left g hderivation and jordan left g hderivation over mathcalt_nc mathcalm_nc and mathbbh_mathbbr respectively also we prove the result of jordan left g hderivation to be a left g hderivation over tensor products of algebras as well as for algebra of polynomials
|
[['in', 'this', 'article', 'left', 'g', 'hderivation', 'and', 'jordan', 'left', 'g', 'hderivation', 'on', 'algebras', 'are', 'introduced', 'it', 'is', 'shown', 'that', 'there', 'is', 'no', 'jordan', 'left', 'g', 'hderivation', 'over', 'mathcalm_nc', 'and', 'mathbbh_mathbbr', 'for', 'g', 'not', 'equal', 'to', 'h', 'examples', 'are', 'given', 'which', 'show', 'that', 'every', 'jordan', 'left', 'g', 'hderivation', 'over', 'mathcalt_nc', 'mathcalm_nc', 'and', 'mathbbh_mathbbr', 'are', 'not', 'left', 'g', 'hderivations', 'moreover', 'we', 'characterize', 'left', 'g', 'hderivation', 'and', 'jordan', 'left', 'g', 'hderivation', 'over', 'mathcalt_nc', 'mathcalm_nc', 'and', 'mathbbh_mathbbr', 'respectively', 'also', 'we', 'prove', 'the', 'result', 'of', 'jordan', 'left', 'g', 'hderivation', 'to', 'be', 'a', 'left', 'g', 'hderivation', 'over', 'tensor', 'products', 'of', 'algebras', 'as', 'well', 'as', 'for', 'algebra', 'of', 'polynomials']]
|
[-0.16861539397910802, 0.09592484646109921, -0.020674934443744897, -0.06130780706610154, -0.10541770526330278, -0.1859485299439367, -0.09221067886348024, 0.4342221391264989, -0.3274591708875666, -0.1642871352119578, 0.12234729849568785, -0.2711083409235333, -0.14197415937528465, 0.2123821402683553, -0.15971820494818567, -0.12065260299490858, 0.043028737822867404, 0.21165486817269333, -0.06281324079926973, -0.29626443276576925, 0.28738783497005854, -0.09192087731060732, 0.09234970354597376, 0.08329226735113847, 0.1111890073169512, -0.02653589235345899, -0.004643583275151976, -0.008392382732997037, -0.19758099539166038, -0.01263561568251162, 0.27451393787156453, 0.1286151328458065, 0.24969680396595387, -0.33517636776745385, -0.062172805375391334, 0.2559360309993152, 0.15737228111053506, -0.15040312954483348, 0.017486185786747044, -0.2857032562841219, 0.1876479157651163, -0.21636121684327872, -0.004632738809280022, -0.004999586804346604, 0.23290871619952447, -0.0619713401120871, -0.26306751726025884, 0.056242390098038476, 0.11974333957745459, 0.07683699831103134, -0.008590840654579377, -0.15800083380173705, -0.12632791186457104, 0.07810849499314873, -0.0688988559107964, 0.09381299972477736, 0.016727525824939624, -0.025949263385487625, -0.06829842107577457, 0.38045841030249694, -0.08424040391062847, -0.17366011396069267, 0.07113935747254414, -0.19035772261012232, -0.09582263542188689, -0.009604800520746998, -0.0002549127440410431, 0.186688585639602, -0.04651584264568307, 0.2611117887779873, -0.1746572234263324, 0.009411991263429323, 0.20099481493893145, -0.04583422478048526, 0.1177899587918261, 0.021218680870728663, 0.0796773219434074, 0.033425121416450675, 0.10571979184522096, 0.13854616075622464, -0.35288496751037207, -0.13510115415967924, -0.10287131727532003, 0.1601514990392701, -0.05579309574151388, -0.1776040252871374, 0.4080746765013295, 0.07662044704487228, 0.1544670024880848, 0.12383296970169841, 0.13029751512033846, 0.021933455144835995, 0.10463210173666176, 0.16833974487816145, 0.07449545739500811, 0.3047903101759577, -0.08352860220416326, -0.12204892976171892, -0.07556568841083032, 0.15761694010121352]
|
1,803.07954
|
Resilient Monotone Sequential Maximization
|
Applications in machine learning, optimization, and control require the
sequential selection of a few system elements, such as sensors, data, or
actuators, to optimize the system performance across multiple time steps.
However, in failure-prone and adversarial environments, sensors get attacked,
data get deleted, and actuators fail. Thence, traditional sequential design
paradigms become insufficient and, in contrast, resilient sequential designs
that adapt against system-wide attacks, deletions, or failures become
important. In general, resilient sequential design problems are computationally
hard. Also, even though they often involve objective functions that are
monotone and (possibly) submodular, no scalable approximation algorithms are
known for their solution. In this paper, we provide the first scalable
algorithm, that achieves the following characteristics: system-wide resiliency,
i.e., the algorithm is valid for any number of denial-of-service attacks,
deletions, or failures; adaptiveness, i.e., at each time step, the algorithm
selects system elements based on the history of inflicted attacks, deletions,
or failures; and provable approximation performance, i.e., the algorithm
guarantees for monotone objective functions a solution close to the optimal. We
quantify the algorithm's approximation performance using a notion of curvature
for monotone (not necessarily submodular) set functions. Finally, we support
our theoretical analyses with simulated experiments, by considering a
control-aware sensor scheduling scenario, namely, sensing-constrained robot
navigation.
|
stat.ML cs.LG math.OC
|
applications in machine learning optimization and control require the sequential selection of a few system elements such as sensors data or actuators to optimize the system performance across multiple time steps however in failureprone and adversarial environments sensors get attacked data get deleted and actuators fail thence traditional sequential design paradigms become insufficient and in contrast resilient sequential designs that adapt against systemwide attacks deletions or failures become important in general resilient sequential design problems are computationally hard also even though they often involve objective functions that are monotone and possibly submodular no scalable approximation algorithms are known for their solution in this paper we provide the first scalable algorithm that achieves the following characteristics systemwide resiliency ie the algorithm is valid for any number of denialofservice attacks deletions or failures adaptiveness ie at each time step the algorithm selects system elements based on the history of inflicted attacks deletions or failures and provable approximation performance ie the algorithm guarantees for monotone objective functions a solution close to the optimal we quantify the algorithms approximation performance using a notion of curvature for monotone not necessarily submodular set functions finally we support our theoretical analyses with simulated experiments by considering a controlaware sensor scheduling scenario namely sensingconstrained robot navigation
|
[['applications', 'in', 'machine', 'learning', 'optimization', 'and', 'control', 'require', 'the', 'sequential', 'selection', 'of', 'a', 'few', 'system', 'elements', 'such', 'as', 'sensors', 'data', 'or', 'actuators', 'to', 'optimize', 'the', 'system', 'performance', 'across', 'multiple', 'time', 'steps', 'however', 'in', 'failureprone', 'and', 'adversarial', 'environments', 'sensors', 'get', 'attacked', 'data', 'get', 'deleted', 'and', 'actuators', 'fail', 'thence', 'traditional', 'sequential', 'design', 'paradigms', 'become', 'insufficient', 'and', 'in', 'contrast', 'resilient', 'sequential', 'designs', 'that', 'adapt', 'against', 'systemwide', 'attacks', 'deletions', 'or', 'failures', 'become', 'important', 'in', 'general', 'resilient', 'sequential', 'design', 'problems', 'are', 'computationally', 'hard', 'also', 'even', 'though', 'they', 'often', 'involve', 'objective', 'functions', 'that', 'are', 'monotone', 'and', 'possibly', 'submodular', 'no', 'scalable', 'approximation', 'algorithms', 'are', 'known', 'for', 'their', 'solution', 'in', 'this', 'paper', 'we', 'provide', 'the', 'first', 'scalable', 'algorithm', 'that', 'achieves', 'the', 'following', 'characteristics', 'systemwide', 'resiliency', 'ie', 'the', 'algorithm', 'is', 'valid', 'for', 'any', 'number', 'of', 'denialofservice', 'attacks', 'deletions', 'or', 'failures', 'adaptiveness', 'ie', 'at', 'each', 'time', 'step', 'the', 'algorithm', 'selects', 'system', 'elements', 'based', 'on', 'the', 'history', 'of', 'inflicted', 'attacks', 'deletions', 'or', 'failures', 'and', 'provable', 'approximation', 'performance', 'ie', 'the', 'algorithm', 'guarantees', 'for', 'monotone', 'objective', 'functions', 'a', 'solution', 'close', 'to', 'the', 'optimal', 'we', 'quantify', 'the', 'algorithms', 'approximation', 'performance', 'using', 'a', 'notion', 'of', 'curvature', 'for', 'monotone', 'not', 'necessarily', 'submodular', 'set', 'functions', 'finally', 'we', 'support', 'our', 'theoretical', 'analyses', 'with', 'simulated', 'experiments', 'by', 'considering', 'a', 'controlaware', 'sensor', 'scheduling', 'scenario', 'namely', 'sensingconstrained', 'robot', 'navigation']]
|
[-0.1651567849263117, 0.009151498274202797, -0.03839862551135213, 0.08750309447357477, -0.07547992628724606, -0.2518355080920861, 0.10510788871940441, 0.4331931877489863, -0.26724179175902824, -0.30864906873428016, 0.12179988980740938, -0.2568102139633167, -0.20249422904664138, 0.18304570285594407, -0.16156551906791772, 0.15661161720014857, 0.10230097434132536, -0.00045573885385554445, -0.02083882538361052, -0.302646412273446, 0.2577177787397579, 0.04626530260500017, 0.28569410731880995, 0.006929667549576736, 0.06883320672514034, 0.033637832633134176, -0.0018781486669204373, 0.0394889610990486, -0.06336289324067564, 0.055593573625518936, 0.3375924165137922, 0.23908686774539883, 0.37157027493568434, -0.47951936751946017, -0.1663954194167242, 0.13407845624693296, 0.11684304263649715, 0.08772132361919624, -0.053504057371413005, -0.24587723401775538, 0.11917987612418039, -0.16019330826120626, -0.054456683071465166, -0.1184517296787817, -0.03994022909515866, 0.05178037092960237, -0.33822854930885893, -0.006067253719112085, 0.06779007244054318, 0.020521866274628663, -0.04298646718315366, -0.09347668697198196, 0.05617875582538545, 0.12318931681054514, 0.013811639210339725, 0.020919547076584492, 0.19811386363535832, -0.10837785783448765, -0.19823434730712775, 0.36382339274339776, 0.04272345242012913, -0.2203391613236264, 0.18550543336913097, 0.004681284516905817, -0.18010709209565595, 0.1453450214171755, 0.25681433393754927, 0.1436812584378401, -0.14087490447131007, 0.03322773442799361, 0.026248375765961292, 0.1735991013645766, 0.05960010889589175, 0.05950385202166674, 0.12159526539552543, 0.1753677239254621, 0.17038959325493677, 0.12785351538472778, -0.015625475686502414, -0.1097814505537387, -0.23531716415047835, -0.08560773951748323, -0.17794138129130185, -0.021858742073049504, -0.10218546630610523, -0.20138469549595572, 0.3512160029568246, 0.18305261911833343, 0.15316105569186417, 0.14774787547851345, 0.41679658084783866, 0.036400215452323796, 0.06358034015354219, 0.1638758126038896, 0.18586496495223348, 0.024074784764043698, 0.08905756319389377, -0.16864364858995673, 0.19902811800512138, 0.012352442616317872]
|
1,803.07955
|
A Cascaded Convolutional Neural Network for Single Image Dehazing
|
Images captured under outdoor scenes usually suffer from low contrast and
limited visibility due to suspended atmospheric particles, which directly
affects the quality of photos. Despite numerous image dehazing methods have
been proposed, effective hazy image restoration remains a challenging problem.
Existing learning-based methods usually predict the medium transmission by
Convolutional Neural Networks (CNNs), but ignore the key global atmospheric
light. Different from previous learning-based methods, we propose a flexible
cascaded CNN for single hazy image restoration, which considers the medium
transmission and global atmospheric light jointly by two task-driven
subnetworks. Specifically, the medium transmission estimation subnetwork is
inspired by the densely connected CNN while the global atmospheric light
estimation subnetwork is a light-weight CNN. Besides, these two subnetworks are
cascaded by sharing the common features. Finally, with the estimated model
parameters, the haze-free image is obtained by the atmospheric scattering model
inversion, which achieves more accurate and effective restoration performance.
Qualitatively and quantitatively experimental results on the synthetic and
real-world hazy images demonstrate that the proposed method effectively removes
haze from such images, and outperforms several state-of-the-art dehazing
methods.
|
cs.CV
|
images captured under outdoor scenes usually suffer from low contrast and limited visibility due to suspended atmospheric particles which directly affects the quality of photos despite numerous image dehazing methods have been proposed effective hazy image restoration remains a challenging problem existing learningbased methods usually predict the medium transmission by convolutional neural networks cnns but ignore the key global atmospheric light different from previous learningbased methods we propose a flexible cascaded cnn for single hazy image restoration which considers the medium transmission and global atmospheric light jointly by two taskdriven subnetworks specifically the medium transmission estimation subnetwork is inspired by the densely connected cnn while the global atmospheric light estimation subnetwork is a lightweight cnn besides these two subnetworks are cascaded by sharing the common features finally with the estimated model parameters the hazefree image is obtained by the atmospheric scattering model inversion which achieves more accurate and effective restoration performance qualitatively and quantitatively experimental results on the synthetic and realworld hazy images demonstrate that the proposed method effectively removes haze from such images and outperforms several stateoftheart dehazing methods
|
[['images', 'captured', 'under', 'outdoor', 'scenes', 'usually', 'suffer', 'from', 'low', 'contrast', 'and', 'limited', 'visibility', 'due', 'to', 'suspended', 'atmospheric', 'particles', 'which', 'directly', 'affects', 'the', 'quality', 'of', 'photos', 'despite', 'numerous', 'image', 'dehazing', 'methods', 'have', 'been', 'proposed', 'effective', 'hazy', 'image', 'restoration', 'remains', 'a', 'challenging', 'problem', 'existing', 'learningbased', 'methods', 'usually', 'predict', 'the', 'medium', 'transmission', 'by', 'convolutional', 'neural', 'networks', 'cnns', 'but', 'ignore', 'the', 'key', 'global', 'atmospheric', 'light', 'different', 'from', 'previous', 'learningbased', 'methods', 'we', 'propose', 'a', 'flexible', 'cascaded', 'cnn', 'for', 'single', 'hazy', 'image', 'restoration', 'which', 'considers', 'the', 'medium', 'transmission', 'and', 'global', 'atmospheric', 'light', 'jointly', 'by', 'two', 'taskdriven', 'subnetworks', 'specifically', 'the', 'medium', 'transmission', 'estimation', 'subnetwork', 'is', 'inspired', 'by', 'the', 'densely', 'connected', 'cnn', 'while', 'the', 'global', 'atmospheric', 'light', 'estimation', 'subnetwork', 'is', 'a', 'lightweight', 'cnn', 'besides', 'these', 'two', 'subnetworks', 'are', 'cascaded', 'by', 'sharing', 'the', 'common', 'features', 'finally', 'with', 'the', 'estimated', 'model', 'parameters', 'the', 'hazefree', 'image', 'is', 'obtained', 'by', 'the', 'atmospheric', 'scattering', 'model', 'inversion', 'which', 'achieves', 'more', 'accurate', 'and', 'effective', 'restoration', 'performance', 'qualitatively', 'and', 'quantitatively', 'experimental', 'results', 'on', 'the', 'synthetic', 'and', 'realworld', 'hazy', 'images', 'demonstrate', 'that', 'the', 'proposed', 'method', 'effectively', 'removes', 'haze', 'from', 'such', 'images', 'and', 'outperforms', 'several', 'stateoftheart', 'dehazing', 'methods']]
|
[-0.029640273900521506, 0.026510544813289825, -0.03259458962000079, 0.061494511878764674, -0.052090503395690275, -0.20436841854825616, -0.01722176315702705, 0.4852324009562532, -0.2553644169264266, -0.3576774970938762, 0.0935925331328892, -0.27597479303884836, -0.23138629886994344, 0.15954519457494218, -0.1679361335777988, 0.13936461656962315, 0.1621266853594635, -0.022927244281810193, -0.04077604343943272, -0.2536402338792363, 0.30225264774635435, 0.04215346559390633, 0.3898232397933801, 0.04225659988296684, 0.14794826347691317, -0.028913083093033896, -0.07579127204953692, -0.03064593897563302, -0.010589207277007517, 0.14679612201547976, 0.27059424059051607, 0.1548799184888291, 0.21969201159146096, -0.4537515708969699, -0.34956038462437894, 0.07284058704196165, 0.1713413343894192, 0.09141199632690081, -0.05257495299940476, -0.35784843516432574, 0.0609005119987867, -0.11750051817701508, 0.04827328470742537, -0.11594328455264784, -0.10361663908244939, -0.054901194850228624, -0.3265346779746728, 0.06643469908416996, 0.023673046419086557, 0.07241515702464514, -0.06142224546379617, -0.12943824769657417, -0.015454815470406578, 0.1643962010068612, 0.0025813902047553306, 0.009946134070762329, 0.18708411692124274, -0.2141029313834022, -0.04917700362146004, 0.40113325040632236, -0.05606023550402218, -0.1708599093201984, 0.21103267344749635, -0.02198436530565636, -0.08307734488302634, 0.19695720513765183, 0.18288513550036845, 0.1142485913535994, -0.1872562135466271, -0.030289848565816, -0.10037718830474963, 0.17707825912576583, 0.07334861341999689, 0.025054379513797662, 0.2035483749415208, 0.24897716357890104, 0.029068893377876118, 0.10125540022401967, -0.21847882922706452, -0.02707031133274237, -0.11407071115940602, -0.014297149639767465, -0.19242252778882782, -0.07142924368446175, -0.1185107494896834, -0.10652571636277976, 0.4465752999143054, 0.2535355034646475, 0.2023563819950343, 0.06691638676695422, 0.4799354001465771, 0.010787076761739121, 0.11337508900970635, 0.08136854512461772, 0.22711366364059762, 0.013353749008901003, 0.13326340702575787, -0.19812356621518523, 0.09762980572543004, 0.05970518319971031]
|
1,803.07956
|
A note on $\sigma$-algebras on sets of affine and measurable maps to the
unit interval
|
In The factorization of the Giry monad (arXiv:1707.00488v2) the author
considers two $\sigma$-algebras on convex spaces of functions to the unit
interval. One of them is generated by the Boolean subobjects and the other is
the $\sigma$-algebra induced by the evaluation maps. The author asserts that,
under the assumptions given in the paper, the two $\sigma$-algebras coincide.
We give examples contradicting this statement.
|
math.CT
|
in the factorization of the giry monad arxiv170700488v2 the author considers two sigmaalgebras on convex spaces of functions to the unit interval one of them is generated by the boolean subobjects and the other is the sigmaalgebra induced by the evaluation maps the author asserts that under the assumptions given in the paper the two sigmaalgebras coincide we give examples contradicting this statement
|
[['in', 'the', 'factorization', 'of', 'the', 'giry', 'monad', 'arxiv170700488v2', 'the', 'author', 'considers', 'two', 'sigmaalgebras', 'on', 'convex', 'spaces', 'of', 'functions', 'to', 'the', 'unit', 'interval', 'one', 'of', 'them', 'is', 'generated', 'by', 'the', 'boolean', 'subobjects', 'and', 'the', 'other', 'is', 'the', 'sigmaalgebra', 'induced', 'by', 'the', 'evaluation', 'maps', 'the', 'author', 'asserts', 'that', 'under', 'the', 'assumptions', 'given', 'in', 'the', 'paper', 'the', 'two', 'sigmaalgebras', 'coincide', 'we', 'give', 'examples', 'contradicting', 'this', 'statement']]
|
[-0.15270735662911208, 0.07057935633366147, -0.0463476701068782, 0.1088118471163926, -0.06027323880322998, -0.071901451105312, 0.04079769149370071, 0.3818403127933702, -0.3328692634259501, -0.18674226820228562, 0.1004225434923184, -0.29983214306975564, -0.11756125739925812, 0.18432828396438591, -0.14699711614558775, 0.014005064423526488, 0.0654182163247418, 0.07827504531991097, -0.07993626569382727, -0.31581871049298393, 0.49190498738279265, -0.04867506974316653, 0.24489910703813356, 0.06818284097244032, 0.13275977107696235, 0.03665871294816175, -0.06929909393581893, -0.004366933623509061, -0.14981493192047515, 0.1637550233863294, 0.23077093674651078, 0.1813119319042251, 0.2716710007366454, -0.3745990478463711, -0.12126629798853349, 0.15347360690394718, -0.01835080417203567, -0.010367927652212882, 0.01936121429729786, -0.29910532358072456, 0.10438865645518226, -0.14285347667793113, -0.054142802488058805, -0.025295118140357155, 0.024793412634021333, 0.034825406957327595, -0.2792369374825108, -0.01125126183333416, 0.2033445625115306, 0.08915437660330246, -0.09491988580163208, -0.0828006657351169, -0.005696507944394985, 0.0981426109830218, 0.04955285947559582, 0.05462610225884184, 0.10892796302364478, -0.037815950686983284, -0.17695923597221414, 0.34497404468035503, -0.036023542029602874, -0.2499431694347051, 0.13443393312815216, -0.18434253967397154, -0.17075492549807794, 0.06706678508330256, 0.023724638691712773, 0.11496721455947526, -0.10115189205915216, 0.17188484586621333, -0.1523539136284061, 0.07900502082456144, 0.144610853790636, 0.01979933842085302, 0.11327546029802292, 0.08602522929469424, 0.08676280412492493, 0.20576393777117763, 0.04142199879495292, -0.09347943373629072, -0.36274293329446544, -0.1525911872064875, -0.1782382747548963, 0.04619603189489534, -0.07446461875013248, -0.18116976308726496, 0.4038438035715972, 0.11170696611365964, 0.19843622267005906, 0.12822710919464309, 0.2629252435158818, 0.10846638149251381, 0.05162815066174634, 0.010895718970606405, 0.16449498825315986, 0.16863117632155697, 0.028917484293361346, -0.10849258138407622, 0.11368935013700637, 0.18960093906629952]
|
1,803.07957
|
Multicolor Photometry of the Neptune Irregular Satellite Neso
|
We report on time series photometry of the faint Neptune irregular satellite
Neso. Observations in the V, R, and I pass-bands were performed in photometric
conditions at the Cerro Paranal observatory using the instrument FORS2, in the
night of July 15th, 2010. Astrometry and photometry derived from these
observations are presented here. The time coverage of about six hours does not
allow to construct a light curve and derive a meaningful rotational period.
However, we could derive new estimates of apparent magnitudes obtaining R=25.2
pm 0.2 mag in agreement with Brozovic, Jacobson, Sheppard (2011), and also
V=25.6 pm 0.3 mag, and I=24.5 pm 0.3. In this way we could derive for the first
time Neso colors, V-I=1.0 pm 0.4 mag, R-I=0.7 pm 0.4 mag and V-R=0.3 pm 0.4
mag. We compared those colors with those in Peixinho, Delsanti, Doressoundiram
(2015). The color R-I appears to be slightly redder than the typical values for
Centaurs and KBOs, the color V-I is in nice agreement with both populations.
The large error-bars prevents from assigning Neso to any of the reference
classes, just looking at Neso colors, although the data seem to suggest that we
can rule out its membership in classes of resonant objects or Plutinos.
|
astro-ph.EP
|
we report on time series photometry of the faint neptune irregular satellite neso observations in the v r and i passbands were performed in photometric conditions at the cerro paranal observatory using the instrument fors2 in the night of july 15th 2010 astrometry and photometry derived from these observations are presented here the time coverage of about six hours does not allow to construct a light curve and derive a meaningful rotational period however we could derive new estimates of apparent magnitudes obtaining r252 pm 02 mag in agreement with brozovic jacobson sheppard 2011 and also v256 pm 03 mag and i245 pm 03 in this way we could derive for the first time neso colors vi10 pm 04 mag ri07 pm 04 mag and vr03 pm 04 mag we compared those colors with those in peixinho delsanti doressoundiram 2015 the color ri appears to be slightly redder than the typical values for centaurs and kbos the color vi is in nice agreement with both populations the large errorbars prevents from assigning neso to any of the reference classes just looking at neso colors although the data seem to suggest that we can rule out its membership in classes of resonant objects or plutinos
|
[['we', 'report', 'on', 'time', 'series', 'photometry', 'of', 'the', 'faint', 'neptune', 'irregular', 'satellite', 'neso', 'observations', 'in', 'the', 'v', 'r', 'and', 'i', 'passbands', 'were', 'performed', 'in', 'photometric', 'conditions', 'at', 'the', 'cerro', 'paranal', 'observatory', 'using', 'the', 'instrument', 'fors2', 'in', 'the', 'night', 'of', 'july', '15th', '2010', 'astrometry', 'and', 'photometry', 'derived', 'from', 'these', 'observations', 'are', 'presented', 'here', 'the', 'time', 'coverage', 'of', 'about', 'six', 'hours', 'does', 'not', 'allow', 'to', 'construct', 'a', 'light', 'curve', 'and', 'derive', 'a', 'meaningful', 'rotational', 'period', 'however', 'we', 'could', 'derive', 'new', 'estimates', 'of', 'apparent', 'magnitudes', 'obtaining', 'r252', 'pm', '02', 'mag', 'in', 'agreement', 'with', 'brozovic', 'jacobson', 'sheppard', '2011', 'and', 'also', 'v256', 'pm', '03', 'mag', 'and', 'i245', 'pm', '03', 'in', 'this', 'way', 'we', 'could', 'derive', 'for', 'the', 'first', 'time', 'neso', 'colors', 'vi10', 'pm', '04', 'mag', 'ri07', 'pm', '04', 'mag', 'and', 'vr03', 'pm', '04', 'mag', 'we', 'compared', 'those', 'colors', 'with', 'those', 'in', 'peixinho', 'delsanti', 'doressoundiram', '2015', 'the', 'color', 'ri', 'appears', 'to', 'be', 'slightly', 'redder', 'than', 'the', 'typical', 'values', 'for', 'centaurs', 'and', 'kbos', 'the', 'color', 'vi', 'is', 'in', 'nice', 'agreement', 'with', 'both', 'populations', 'the', 'large', 'errorbars', 'prevents', 'from', 'assigning', 'neso', 'to', 'any', 'of', 'the', 'reference', 'classes', 'just', 'looking', 'at', 'neso', 'colors', 'although', 'the', 'data', 'seem', 'to', 'suggest', 'that', 'we', 'can', 'rule', 'out', 'its', 'membership', 'in', 'classes', 'of', 'resonant', 'objects', 'or', 'plutinos']]
|
[-0.048529532660025784, 0.11407178239116851, -0.1331094549637912, 0.04931870766627002, -0.06737624518549647, -0.1200900715444861, 0.09054451233702641, 0.44478098726665916, -0.13557689595461686, -0.42006409151224317, 0.09569859845022467, -0.3249227931997195, -0.03316124223839246, 0.18085196860333158, -0.18408519730473002, -0.02325878663277809, 0.11510839280235076, -0.07940525544670217, -0.06520078460352619, -0.280005916433059, 0.16377080063959631, 0.004095560034292603, 0.16145677127530278, -0.06590179543762567, 0.03897646277124147, -0.03587764533541548, -0.102828646602427, -0.036265141169923513, -0.20676386507298486, 0.02390439561591838, 0.23909161461465211, 0.06999509140546552, 0.1817190910897544, -0.31876630045303384, -0.08959120593336883, 0.08628254642870825, 0.13723672465255796, 0.025276072805529924, 0.016545907210743026, -0.3062639939250084, 0.0671069947444257, -0.12558372906848864, -0.17327273550069877, 0.04689758029660898, 0.12436557629826446, -0.016320568150698874, -0.2525430063688702, 0.13584378325757995, -0.04299341015952644, 0.17503824996345954, -0.1272714127092693, -0.19221468316154733, -0.07874433054271991, 0.08819749413842931, -0.03193605416052535, 0.1036244405617909, 0.05434888570101431, -0.09398140756621352, -0.03573074297350713, 0.4121876829971564, -0.08184490996085847, 0.03701289890683847, 0.17003971743893806, -0.2232028003782034, -0.15089724756195802, 0.13173620254723215, 0.12164767434252344, 0.11389543910139727, -0.17186593947941578, -0.0004193422802355197, -0.00034567095613494744, 0.22921711072647177, 0.08706477831169812, 0.07416435461519416, 0.26841194079249275, 0.06785725419844506, 0.02431202212202027, 0.017010198695098195, -0.27495366561245455, -0.004906381495169312, -0.26324873941425747, -0.06411823978049853, -0.10341717539869869, 0.07915818457603088, -0.1533473300917321, -0.056607631229420856, 0.36109596723927007, 0.168284721592167, 0.21101708690928966, 0.09095317656221577, 0.2409669584074639, 0.09218360184866765, 0.09604911793469213, 0.10706559611678827, 0.3312567929656902, 0.10614817631714575, 0.10833345892068547, -0.13940909897984208, 0.04057016044968578, 0.022130883383318818]
|
1,803.07958
|
Sub-picosecond proton tunnelling in deformed DNA hydrogen bonds under an
asymmetric double-oscillator model
|
We present a model of proton tunnelling across DNA hydrogen bonds, compute
the characteristic tunnelling time (CTT) from donor to acceptor and discuss its
biological implications. The model is a double oscillator characterised by
three geometry parameters describing planar deformations of the H bond, and a
symmetry parameter representing the energy ratio between ground states in the
individual oscillators. If the symmetry parameter takes its maximum value of 1,
then we recover a known model which produced CTTs too large to be biologically
relevant; but this is reduced by up to 40 orders of magnitude as the symmetry
parameter is decreased. We discover that unless the symmetry parameter is close
to 1 or 0, the proton's CTT under any planar deformation is guaranteed to be
below one picosecond, which is a biologically relevant time-scale. This
supports theories of links between proton tunnelling and biological processes
such as spontaneous mutation.
|
physics.bio-ph
|
we present a model of proton tunnelling across dna hydrogen bonds compute the characteristic tunnelling time ctt from donor to acceptor and discuss its biological implications the model is a double oscillator characterised by three geometry parameters describing planar deformations of the h bond and a symmetry parameter representing the energy ratio between ground states in the individual oscillators if the symmetry parameter takes its maximum value of 1 then we recover a known model which produced ctts too large to be biologically relevant but this is reduced by up to 40 orders of magnitude as the symmetry parameter is decreased we discover that unless the symmetry parameter is close to 1 or 0 the protons ctt under any planar deformation is guaranteed to be below one picosecond which is a biologically relevant timescale this supports theories of links between proton tunnelling and biological processes such as spontaneous mutation
|
[['we', 'present', 'a', 'model', 'of', 'proton', 'tunnelling', 'across', 'dna', 'hydrogen', 'bonds', 'compute', 'the', 'characteristic', 'tunnelling', 'time', 'ctt', 'from', 'donor', 'to', 'acceptor', 'and', 'discuss', 'its', 'biological', 'implications', 'the', 'model', 'is', 'a', 'double', 'oscillator', 'characterised', 'by', 'three', 'geometry', 'parameters', 'describing', 'planar', 'deformations', 'of', 'the', 'h', 'bond', 'and', 'a', 'symmetry', 'parameter', 'representing', 'the', 'energy', 'ratio', 'between', 'ground', 'states', 'in', 'the', 'individual', 'oscillators', 'if', 'the', 'symmetry', 'parameter', 'takes', 'its', 'maximum', 'value', 'of', '1', 'then', 'we', 'recover', 'a', 'known', 'model', 'which', 'produced', 'ctts', 'too', 'large', 'to', 'be', 'biologically', 'relevant', 'but', 'this', 'is', 'reduced', 'by', 'up', 'to', '40', 'orders', 'of', 'magnitude', 'as', 'the', 'symmetry', 'parameter', 'is', 'decreased', 'we', 'discover', 'that', 'unless', 'the', 'symmetry', 'parameter', 'is', 'close', 'to', '1', 'or', '0', 'the', 'protons', 'ctt', 'under', 'any', 'planar', 'deformation', 'is', 'guaranteed', 'to', 'be', 'below', 'one', 'picosecond', 'which', 'is', 'a', 'biologically', 'relevant', 'timescale', 'this', 'supports', 'theories', 'of', 'links', 'between', 'proton', 'tunnelling', 'and', 'biological', 'processes', 'such', 'as', 'spontaneous', 'mutation']]
|
[-0.11223369425837726, 0.22535675102157282, -0.01129874274534667, 0.07640234522221473, -0.036937826113062816, -0.18266369245521374, 0.07998628888572973, 0.35297521455025915, -0.297733829600499, -0.30046571228003144, 0.04121239093247951, -0.2518169280554124, -0.12083261397717233, 0.14403437488343593, -0.0030205553528796507, -0.010161268684994304, 0.005759614769794397, 0.03821573222381056, -0.042341894388605916, -0.18871702253818512, 0.270819764162395, 0.04663743675005116, 0.2375341539158667, 0.06388315116328769, 0.10406984600719789, -0.02142111332805815, 0.06579198673580017, -0.008386580411019742, -0.16421202516782718, 0.07766433605641414, 0.23843275905030487, 0.07142254973342954, 0.20936470232503926, -0.41673293971025305, -0.21005374136937144, 0.11686495108758069, 0.12452498517364839, 0.1315604104104158, 0.017378700887721858, -0.23661378098514257, 0.06580686556712893, -0.16447471543340225, -0.14439620093861283, -0.05540387206492108, 0.07211038672158983, 0.004309499723799277, -0.2677153148219589, 0.09283209506472286, 0.049731980136130005, 0.04119556857762865, -0.07664497662960683, -0.06995742092371587, -0.07089873119851187, 0.08796716717871894, 0.09076142781210951, 0.035603567554721695, 0.19158266974150534, -0.13193524439800405, -0.09477467767444232, 0.38155678740933835, -0.026287386459517198, -0.1587923532101832, 0.16985864977933615, -0.15432991231822926, -0.10483273524703496, 0.16324786744361755, 0.08226159639068997, 0.1311259374910053, -0.13478052484859157, 0.0961479568410971, 0.015184522215776996, 0.2109397487564875, 0.09562364668779125, 0.012026085799572452, 0.20478473215257662, 0.19608113103102418, 0.05670453715544419, 0.13871569101754952, -0.11036141754921851, -0.11011454220954954, -0.2906965727999106, -0.13772324210770379, -0.16549440996093212, 0.10387861631551269, -0.10658936243750008, -0.14365838151800153, 0.393633065263947, 0.11467295275976094, 0.24193979742242985, 0.020098585194568995, 0.23801977927452767, 0.13423976502631285, 0.1008890378304551, 0.001491804997086675, 0.23199973863568282, 0.13774142206815265, 0.04345543001897183, -0.2298364247954857, 0.08424365393279883, 0.026130666946929774]
|
1,803.07959
|
Stability and optimality of multi-scale transportation networks with
distributed dynamic tolls
|
We study transportation networks controlled by dynamical feedback tolls. We
consider a multiscale transportation network model whereby the dynamics of the
traffic flows are intertwined with those of the drivers' route choices. The
latter are influenced by the congestion status on the whole network as well as
dynamic tolls set by the system operator. Our main result shows that a broad
class of decentralized congestion-dependent tolls globally stabilise the
transportation network around a Wardrop equilibrium. Moreover, using dynamic
marginal cost tolls, stability of the transportation network can be guaranteed
around the social optimum traffic assignment. This is particularly remarkable
as the considered decentralized feedback toll policies do not require any
global information about the network structure or the exogenous traffic load on
the network or state and can be computed in a fully local way. We also evaluate
the performance of these feedback toll policies both in the asymptotic and
during the transient regime, through numerical simulations.
|
math.OC
|
we study transportation networks controlled by dynamical feedback tolls we consider a multiscale transportation network model whereby the dynamics of the traffic flows are intertwined with those of the drivers route choices the latter are influenced by the congestion status on the whole network as well as dynamic tolls set by the system operator our main result shows that a broad class of decentralized congestiondependent tolls globally stabilise the transportation network around a wardrop equilibrium moreover using dynamic marginal cost tolls stability of the transportation network can be guaranteed around the social optimum traffic assignment this is particularly remarkable as the considered decentralized feedback toll policies do not require any global information about the network structure or the exogenous traffic load on the network or state and can be computed in a fully local way we also evaluate the performance of these feedback toll policies both in the asymptotic and during the transient regime through numerical simulations
|
[['we', 'study', 'transportation', 'networks', 'controlled', 'by', 'dynamical', 'feedback', 'tolls', 'we', 'consider', 'a', 'multiscale', 'transportation', 'network', 'model', 'whereby', 'the', 'dynamics', 'of', 'the', 'traffic', 'flows', 'are', 'intertwined', 'with', 'those', 'of', 'the', 'drivers', 'route', 'choices', 'the', 'latter', 'are', 'influenced', 'by', 'the', 'congestion', 'status', 'on', 'the', 'whole', 'network', 'as', 'well', 'as', 'dynamic', 'tolls', 'set', 'by', 'the', 'system', 'operator', 'our', 'main', 'result', 'shows', 'that', 'a', 'broad', 'class', 'of', 'decentralized', 'congestiondependent', 'tolls', 'globally', 'stabilise', 'the', 'transportation', 'network', 'around', 'a', 'wardrop', 'equilibrium', 'moreover', 'using', 'dynamic', 'marginal', 'cost', 'tolls', 'stability', 'of', 'the', 'transportation', 'network', 'can', 'be', 'guaranteed', 'around', 'the', 'social', 'optimum', 'traffic', 'assignment', 'this', 'is', 'particularly', 'remarkable', 'as', 'the', 'considered', 'decentralized', 'feedback', 'toll', 'policies', 'do', 'not', 'require', 'any', 'global', 'information', 'about', 'the', 'network', 'structure', 'or', 'the', 'exogenous', 'traffic', 'load', 'on', 'the', 'network', 'or', 'state', 'and', 'can', 'be', 'computed', 'in', 'a', 'fully', 'local', 'way', 'we', 'also', 'evaluate', 'the', 'performance', 'of', 'these', 'feedback', 'toll', 'policies', 'both', 'in', 'the', 'asymptotic', 'and', 'during', 'the', 'transient', 'regime', 'through', 'numerical', 'simulations']]
|
[-0.17959479036000678, 0.05666544023775854, -0.06144102942944767, 0.06299484719802888, -0.04300050515657625, -0.13679783217361172, 0.12343611617987522, 0.39512461505066127, -0.32114308185350054, -0.2969264140045151, 0.16197313469064495, -0.24528354989925924, -0.21376579807390675, 0.14033594407747166, -0.10511968625136293, 0.08906940695268507, 0.07159183423619908, 0.041179838026157364, 0.017013286210175674, -0.2123055732032905, 0.32194235878892075, 0.06701521491273664, 0.30914493368413204, 0.044585519204608716, 0.07940814207690075, -0.009291133519488936, -0.004573721958037753, 0.06585193909361409, -0.07835505213925223, 0.08005689081544869, 0.25857057322550997, 0.17919834642163598, 0.33374395590568057, -0.4551211242946104, -0.26317900650871867, 0.1368933939613784, 0.12773319829900104, 0.07869528224154447, -0.0004855300663994291, -0.2889611719426914, 0.08813909918684751, -0.20659132995523322, -0.09987100632861257, -0.08204944751923904, -0.06694868195933314, 0.07804420074674057, -0.2952985800612413, 0.024921636689470734, 0.01327389917311778, 0.02102783614865098, -0.0737334094204319, -0.045511810442593954, -0.11592335040824345, 0.20420979448513557, 0.016804334863524836, -0.015418196705211766, 0.1923891181165042, -0.16918809168768909, -0.14802674466493324, 0.3713353720899576, -0.02183616650216162, -0.19684822077845007, 0.17322727408594427, -0.06473813227449472, -0.11224677408478247, 0.10083056093814473, 0.24834570416416496, 0.10919750881835054, -0.1998612651581285, -0.006800218644247462, -0.07748421764848992, 0.1436288919305811, 0.007716039633706737, 0.02635781646359903, 0.16891094185158204, 0.23276193656672078, 0.2048101744074255, 0.11395595932956964, -0.014088674851779778, -0.17158475819115454, -0.2615698606808646, -0.07825529177894051, -0.148464371312935, 0.04612325605324795, -0.12270984499851832, -0.11018102500551882, 0.40751871957372016, 0.12545545783061057, 0.1641019246964835, 0.09241217168537566, 0.30768181577933806, 0.0962469395488323, 0.046188922121356696, 0.16389558298620754, 0.223869649376959, 0.00974750569394718, 0.1861701695672356, -0.26670850274445584, 0.1754632031198782, 0.034176293739643045]
|
1,803.0796
|
Direct computational approach to lattice supersymmetric quantum
mechanics
|
We propose a numerical method of estimating various physical quantities in
lattice (supersymmetric) quantum mechanics. The method consists only of
deterministic processes such as computing a product of transfer matrix, and has
no statistical uncertainties. We use the numerical quadrature to define the
transfer matrix as a finite dimensional matrix, and find that it effectively
works by rescaling variable for sufficiently small lattice spacings. For a
lattice supersymmetric quantum mechanics, the correlators can be estimated
without statistical errors, and the effective masses coincide with the exact
solution within very small errors less than 0.001%. The SUSY Ward identity is
also precisely studied in compared with the Monte-Carlo method. Our method is
not limited to a lattice SUSY quantum mechanics, but is also applicable to any
other lattice models of quantum mechanics.
|
hep-lat
|
we propose a numerical method of estimating various physical quantities in lattice supersymmetric quantum mechanics the method consists only of deterministic processes such as computing a product of transfer matrix and has no statistical uncertainties we use the numerical quadrature to define the transfer matrix as a finite dimensional matrix and find that it effectively works by rescaling variable for sufficiently small lattice spacings for a lattice supersymmetric quantum mechanics the correlators can be estimated without statistical errors and the effective masses coincide with the exact solution within very small errors less than 0001 the susy ward identity is also precisely studied in compared with the montecarlo method our method is not limited to a lattice susy quantum mechanics but is also applicable to any other lattice models of quantum mechanics
|
[['we', 'propose', 'a', 'numerical', 'method', 'of', 'estimating', 'various', 'physical', 'quantities', 'in', 'lattice', 'supersymmetric', 'quantum', 'mechanics', 'the', 'method', 'consists', 'only', 'of', 'deterministic', 'processes', 'such', 'as', 'computing', 'a', 'product', 'of', 'transfer', 'matrix', 'and', 'has', 'no', 'statistical', 'uncertainties', 'we', 'use', 'the', 'numerical', 'quadrature', 'to', 'define', 'the', 'transfer', 'matrix', 'as', 'a', 'finite', 'dimensional', 'matrix', 'and', 'find', 'that', 'it', 'effectively', 'works', 'by', 'rescaling', 'variable', 'for', 'sufficiently', 'small', 'lattice', 'spacings', 'for', 'a', 'lattice', 'supersymmetric', 'quantum', 'mechanics', 'the', 'correlators', 'can', 'be', 'estimated', 'without', 'statistical', 'errors', 'and', 'the', 'effective', 'masses', 'coincide', 'with', 'the', 'exact', 'solution', 'within', 'very', 'small', 'errors', 'less', 'than', '0001', 'the', 'susy', 'ward', 'identity', 'is', 'also', 'precisely', 'studied', 'in', 'compared', 'with', 'the', 'montecarlo', 'method', 'our', 'method', 'is', 'not', 'limited', 'to', 'a', 'lattice', 'susy', 'quantum', 'mechanics', 'but', 'is', 'also', 'applicable', 'to', 'any', 'other', 'lattice', 'models', 'of', 'quantum', 'mechanics']]
|
[-0.05505241743175185, 0.17148437220176668, -0.0840200140915868, 0.10094136730430094, -0.038156267020936684, -0.18961859967573794, 0.05281006383802031, 0.37993926458231364, -0.23767815119380714, -0.26253149880252724, 0.11887017951190529, -0.2656568138725089, -0.1404677529602475, 0.1815630765205235, -0.0487477446369514, 0.13779426831752062, 0.09736740998994872, 0.018492552814365345, -0.1354090051266955, -0.21668241838107014, 0.2585013677696662, 0.030742030599659294, 0.2497805700680056, 0.039376843987274486, 0.10976453324182685, 0.008271342349587051, -0.0029978089439789304, 0.027268694655059746, -0.1022775480757536, 0.1302013933886987, 0.22426193505197337, 0.07623830873817775, 0.2189835803085611, -0.3925880315279915, -0.2498958002249817, 0.11289972027422476, 0.14258033099570064, 0.18323128889599202, -0.01597707309824137, -0.23822836768777886, 0.0933131598334276, -0.19998818000366214, -0.11659305118191418, -0.12817465298354114, 0.0006588971018364638, -0.06169750934594687, -0.27698282705875865, 0.1088607003576858, -0.007472741431805469, 0.05919781750252911, 0.01490124586777662, -0.13811281184534335, 0.011969106055917006, 0.10201484529401054, 0.019566355665918182, 0.012750167673354159, 0.13954048605194982, -0.10185184335863291, -0.1435985604322423, 0.4578397761415406, -0.0161033238215196, -0.2885355051635331, 0.15742556358339221, -0.12231720691077581, -0.14165927528026906, 0.11019289453748528, 0.11254416850798955, 0.11713211594206345, -0.15131169140253586, 0.1276343857664224, -0.028215907613625964, 0.18544928502035504, 0.024039472590150837, 0.01826340397233357, 0.18689369008954587, 0.1197707557354037, 0.047223759089944924, 0.09971717616342335, -0.03928583893455736, -0.17641696277365998, -0.33968146190843507, -0.1312646098152329, -0.24923098145962785, 0.09733971481165717, -0.1402141267238478, -0.19418490169399227, 0.3251460291523458, 0.18334526378609853, 0.1796852522707395, 0.07761901850947214, 0.28891486552444406, 0.14054410812846663, 0.08160516907254817, 0.04392513532532763, 0.208942741732369, 0.16173702021989658, 0.06319621377375745, -0.22492821218325038, -0.0018761059383058365, 0.10921628385042871]
|
1,803.07961
|
Modularity based community detection in heterogeneous networks
|
Heterogeneous networks are networks consisting of different types of nodes
and multiple types of edges linking such nodes. While community detection has
been extensively developed as a useful technique for analyzing networks that
contain only one type of nodes, very few community detection techniques have
been developed for heterogeneous networks. In this paper, we propose a
modularity based community detection framework for heterogeneous networks.
Unlike existing methods, the proposed approach has the flexibility to treat the
number of communities as an unknown quantity. We describe a Louvain type
maximization method for finding the community structure that maximizes the
modularity function. Our simulation results show the advantages of the proposed
method over existing methods. Moreover, the proposed modularity function is
shown to be consistent under a heterogeneous stochastic blockmodel framework.
Analyses of the DBLP four-area dataset and a MovieLens dataset demonstrate the
usefulness of the proposed method.
|
cs.SI physics.soc-ph stat.ME
|
heterogeneous networks are networks consisting of different types of nodes and multiple types of edges linking such nodes while community detection has been extensively developed as a useful technique for analyzing networks that contain only one type of nodes very few community detection techniques have been developed for heterogeneous networks in this paper we propose a modularity based community detection framework for heterogeneous networks unlike existing methods the proposed approach has the flexibility to treat the number of communities as an unknown quantity we describe a louvain type maximization method for finding the community structure that maximizes the modularity function our simulation results show the advantages of the proposed method over existing methods moreover the proposed modularity function is shown to be consistent under a heterogeneous stochastic blockmodel framework analyses of the dblp fourarea dataset and a movielens dataset demonstrate the usefulness of the proposed method
|
[['heterogeneous', 'networks', 'are', 'networks', 'consisting', 'of', 'different', 'types', 'of', 'nodes', 'and', 'multiple', 'types', 'of', 'edges', 'linking', 'such', 'nodes', 'while', 'community', 'detection', 'has', 'been', 'extensively', 'developed', 'as', 'a', 'useful', 'technique', 'for', 'analyzing', 'networks', 'that', 'contain', 'only', 'one', 'type', 'of', 'nodes', 'very', 'few', 'community', 'detection', 'techniques', 'have', 'been', 'developed', 'for', 'heterogeneous', 'networks', 'in', 'this', 'paper', 'we', 'propose', 'a', 'modularity', 'based', 'community', 'detection', 'framework', 'for', 'heterogeneous', 'networks', 'unlike', 'existing', 'methods', 'the', 'proposed', 'approach', 'has', 'the', 'flexibility', 'to', 'treat', 'the', 'number', 'of', 'communities', 'as', 'an', 'unknown', 'quantity', 'we', 'describe', 'a', 'louvain', 'type', 'maximization', 'method', 'for', 'finding', 'the', 'community', 'structure', 'that', 'maximizes', 'the', 'modularity', 'function', 'our', 'simulation', 'results', 'show', 'the', 'advantages', 'of', 'the', 'proposed', 'method', 'over', 'existing', 'methods', 'moreover', 'the', 'proposed', 'modularity', 'function', 'is', 'shown', 'to', 'be', 'consistent', 'under', 'a', 'heterogeneous', 'stochastic', 'blockmodel', 'framework', 'analyses', 'of', 'the', 'dblp', 'fourarea', 'dataset', 'and', 'a', 'movielens', 'dataset', 'demonstrate', 'the', 'usefulness', 'of', 'the', 'proposed', 'method']]
|
[-0.1036540855067493, -0.06731032327947543, -0.05769528867355708, 0.04167175794919503, -0.0819116040935804, -0.13793689828669123, 0.018028707530124692, 0.40356111714038356, -0.24950268844399473, -0.3374207962047437, 0.058533952599551915, -0.2634042872694032, -0.2602841220282275, 0.19947604219718226, -0.04575377727120087, 0.08309749268509191, 0.13529820505786558, 0.05842672518679294, 0.004785795140497644, -0.291522376687298, 0.320586917151151, 0.05479833993193661, 0.4021678851467782, 0.062284516836596845, 0.11036147676038974, -0.010164572899069252, -0.058021523392406, 0.09844414530129268, -0.07663580940068893, 0.1627302235779192, 0.3011423082893779, 0.23151226268182026, 0.359276418582183, -0.3940185160472475, -0.3013872831160652, 0.13701848292859786, 0.1413570770959707, 0.10877857364810489, -0.029040403876068262, -0.3183399233067858, 0.1334031040426986, -0.22462265248057142, -0.07218572514067437, -0.12214609290119903, -0.029368527529054674, 0.052780984951873666, -0.26327133645536377, 0.03494762122502615, 0.0009403557095130713, 0.02242333600618716, -0.0273196160151013, -0.1559105028462564, 0.046945772302369106, 0.14105258085925518, 0.01887077250646363, -0.035368234304518534, 0.11185517286046825, -0.11812258609570563, -0.18554042584166444, 0.33801444946820364, -0.01848838089740482, -0.1924170501851316, 0.21569339908691573, 0.010207621232959731, -0.2209113423616208, 0.10774301318772908, 0.22130009898080907, 0.15483989278496854, -0.19320767750554108, 0.03557802049748214, -0.08047445785768073, 0.14322414937718161, 0.021771541059595244, 0.004494152237372152, 0.13566825619802392, 0.2590248725409138, 0.07482499195872967, 0.12361458208620676, -0.12848525630984584, -0.08314755843502694, -0.16277869812349371, -0.1232328596685467, -0.23773148727025195, -0.06919359728404931, -0.1078916892375203, -0.16840529249848574, 0.4609410761759199, 0.1892619898606991, 0.15060364241262192, 0.10288812174493897, 0.31544158866564775, 0.028992218867040658, 0.11563097212848993, 0.08634533340047146, 0.1792182834602186, 0.09241905431102576, 0.1182928285248385, -0.15124362089494564, 0.13035952646188953, 0.03572642502760322]
|
1,803.07962
|
Configurational stability for the Kuramoto-Sakaguchi model
|
The Kuramoto--Sakaguchi model is a modification of the well-known Kuramoto
model that adds a phase-lag paramater, or "frustration" to a network of
phase-coupled oscillators. The Kuramoto model is a flow of gradient type, but
adding a phase-lag breaks the gradient structure, significantly complicating
the analysis of the model. We present several results determining the stability
of phase-locked configurations: the first of these gives a sufficient condition
for stability, and the second a sufficient condition for instability. (In fact,
the instability criterion gives a count, modulo 2, of the dimension of the
unstable manifold to a fixed point and having an odd count is a sufficient
condition for instability of the fixed point.) We also present numerical
results for both small and large collections of Kuramoto--Sakaguchi
oscillators.
|
math.DS nlin.AO nlin.PS
|
the kuramotosakaguchi model is a modification of the wellknown kuramoto model that adds a phaselag paramater or frustration to a network of phasecoupled oscillators the kuramoto model is a flow of gradient type but adding a phaselag breaks the gradient structure significantly complicating the analysis of the model we present several results determining the stability of phaselocked configurations the first of these gives a sufficient condition for stability and the second a sufficient condition for instability in fact the instability criterion gives a count modulo 2 of the dimension of the unstable manifold to a fixed point and having an odd count is a sufficient condition for instability of the fixed point we also present numerical results for both small and large collections of kuramotosakaguchi oscillators
|
[['the', 'kuramotosakaguchi', 'model', 'is', 'a', 'modification', 'of', 'the', 'wellknown', 'kuramoto', 'model', 'that', 'adds', 'a', 'phaselag', 'paramater', 'or', 'frustration', 'to', 'a', 'network', 'of', 'phasecoupled', 'oscillators', 'the', 'kuramoto', 'model', 'is', 'a', 'flow', 'of', 'gradient', 'type', 'but', 'adding', 'a', 'phaselag', 'breaks', 'the', 'gradient', 'structure', 'significantly', 'complicating', 'the', 'analysis', 'of', 'the', 'model', 'we', 'present', 'several', 'results', 'determining', 'the', 'stability', 'of', 'phaselocked', 'configurations', 'the', 'first', 'of', 'these', 'gives', 'a', 'sufficient', 'condition', 'for', 'stability', 'and', 'the', 'second', 'a', 'sufficient', 'condition', 'for', 'instability', 'in', 'fact', 'the', 'instability', 'criterion', 'gives', 'a', 'count', 'modulo', '2', 'of', 'the', 'dimension', 'of', 'the', 'unstable', 'manifold', 'to', 'a', 'fixed', 'point', 'and', 'having', 'an', 'odd', 'count', 'is', 'a', 'sufficient', 'condition', 'for', 'instability', 'of', 'the', 'fixed', 'point', 'we', 'also', 'present', 'numerical', 'results', 'for', 'both', 'small', 'and', 'large', 'collections', 'of', 'kuramotosakaguchi', 'oscillators']]
|
[-0.22238774795550853, 0.10375459446853104, -0.10332608807809829, 0.06054522440720734, -0.05740874809848647, -0.1559842263407532, 0.05938899617952605, 0.28185014363880906, -0.23365529552693404, -0.2690549593803192, 0.12158536927549109, -0.22678202531108307, -0.16896990579479035, 0.15834769172527427, -0.03926187122447623, 0.025765841028520038, 0.057650154803172524, 0.050234952146956134, -0.05298443869428916, -0.21066663763301063, 0.330750119901957, 0.041403058842415845, 0.25959181246746865, 0.03233241670883246, 0.12534996810629512, -0.046534831365866086, 0.03091203887015581, 0.03986121246421207, -0.1537996618216788, 0.09367663591974489, 0.1451024721295292, 0.09165312007756993, 0.2893543868059559, -0.3724087888729714, -0.21275498915374988, 0.1428787192950646, 0.11569575071963112, 0.16641005002228276, -0.026433432280013915, -0.2262762740793978, 0.10277405559706192, -0.14789162717190468, -0.18043734394900857, -0.09214898357759156, -0.003896171995808208, 0.042053016634391885, -0.33763310639049104, 0.07947470559456778, 0.14721685736292292, 0.08246105700908672, -0.09331730281793704, -0.04192690911244542, -0.044933732879895064, 0.10090290361900799, 0.01994878838267473, -0.010305497115330091, 0.05357342095129074, -0.13485365555370374, -0.0776080575795652, 0.37814325871433885, -0.06182794075547939, -0.21682588809302875, 0.17506927476515846, -0.09957864199624589, -0.13829191791869344, 0.14637906183738128, 0.13718663756957367, 0.10076058245012684, -0.09600072686739694, 0.05015348781515578, -0.03956729590538002, 0.1842068166269677, 0.04591952610967888, -0.023747256055237757, 0.1438994205128106, 0.21387723779364948, 0.12472207476902339, 0.2034129065217539, -0.08987163363157638, -0.10097068548202515, -0.3474601483192398, -0.10890987505655854, -0.14708275189771067, 0.03632220692862387, -0.14871879787489659, -0.2049522277130376, 0.4298939692292599, 0.11697482646975134, 0.2137405569073818, 0.0656447400161553, 0.2723144516496668, 0.10847145905912232, 0.03072161783301641, 0.04533381059826795, 0.22728364763870126, 0.17568513758144239, 0.08003846044459986, -0.22555035620115677, 0.016277732224100165, 0.10573589985281051]
|
1,803.07963
|
A conjecture on Gallai-Ramsey numbers of even cycles and paths
|
A Gallai coloring is a coloring of the edges of a complete graph without
rainbow triangles, and a Gallai $k$-coloring is a Gallai coloring that uses at
most $k$ colors. Given an integer $k\ge1$ and graphs $H_1, \ldots, H_k$, the
Gallai-Ramsey number $GR(H_1, \ldots, H_k)$ is the least integer $n$ such that
every Gallai $k$-coloring of the complete graph $K_n$ contains a monochromatic
copy of $H_i$ in color $i$ for some $i \in \{1,2, \ldots, k\}$. When $H = H_1 =
\cdots = H_k$, we simply write $GR_k(H)$. We study Gallai-Ramsey numbers of
even cycles and paths. For all $n\ge3$ and $k\ge2$, let $G_i=P_{2i+3}$ be a
path on $2i+3$ vertices for all $i\in\{0,1, \ldots, n-2\}$ and
$G_{n-1}\in\{C_{2n}, P_{2n+1}\}$. Let $ i_j\in\{0,1,\ldots, n-1 \}$ for all
$j\in\{1,2, \ldots, k\}$ with $ i_1\ge i_2\ge\cdots\ge i_k $. The first author
recently conjectured that $ GR(G_{i_1}, G_{i_2}, \ldots, G_{i_k}) =
|G_{i_1}|+\sum_{j=2}^k i_j$. The truth of this conjecture implies that
$GR_k(C_{2n})=GR_k(P_{2n})=(n-1)k+n+1$ for all $n\ge3$ and $k\ge1$, and
$GR_k(P_{2n+1})=(n-1)k+n+2$ for all $n\ge1$ and $k\ge1$. In this paper, we
prove that the aforementioned conjecture holds for $n\in\{3,4\}$ and all
$k\ge2$. Our proof relies only on Gallai's result and the classical Ramsey
numbers $R(H_1, H_2)$, where $H_1, H_2\in\{C_8, C_6, P_7, P_5, P_3\}$. We
believe the recoloring method we developed here will be very useful for solving
subsequent cases, and perhaps the conjecture.
|
math.CO
|
a gallai coloring is a coloring of the edges of a complete graph without rainbow triangles and a gallai kcoloring is a gallai coloring that uses at most k colors given an integer kge1 and graphs h_1 ldots h_k the gallairamsey number grh_1 ldots h_k is the least integer n such that every gallai kcoloring of the complete graph k_n contains a monochromatic copy of h_i in color i for some i in 12 ldots k when h h_1 cdots h_k we simply write gr_kh we study gallairamsey numbers of even cycles and paths for all nge3 and kge2 let g_ip_2i3 be a path on 2i3 vertices for all iin01 ldots n2 and g_n1inc_2n p_2n1 let i_jin01ldots n1 for all jin12 ldots k with i_1ge i_2gecdotsge i_k the first author recently conjectured that grg_i_1 g_i_2 ldots g_i_k g_i_1sum_j2k i_j the truth of this conjecture implies that gr_kc_2ngr_kp_2nn1kn1 for all nge3 and kge1 and gr_kp_2n1n1kn2 for all nge1 and kge1 in this paper we prove that the aforementioned conjecture holds for nin34 and all kge2 our proof relies only on gallais result and the classical ramsey numbers rh_1 h_2 where h_1 h_2inc_8 c_6 p_7 p_5 p_3 we believe the recoloring method we developed here will be very useful for solving subsequent cases and perhaps the conjecture
|
[['a', 'gallai', 'coloring', 'is', 'a', 'coloring', 'of', 'the', 'edges', 'of', 'a', 'complete', 'graph', 'without', 'rainbow', 'triangles', 'and', 'a', 'gallai', 'kcoloring', 'is', 'a', 'gallai', 'coloring', 'that', 'uses', 'at', 'most', 'k', 'colors', 'given', 'an', 'integer', 'kge1', 'and', 'graphs', 'h_1', 'ldots', 'h_k', 'the', 'gallairamsey', 'number', 'grh_1', 'ldots', 'h_k', 'is', 'the', 'least', 'integer', 'n', 'such', 'that', 'every', 'gallai', 'kcoloring', 'of', 'the', 'complete', 'graph', 'k_n', 'contains', 'a', 'monochromatic', 'copy', 'of', 'h_i', 'in', 'color', 'i', 'for', 'some', 'i', 'in', '12', 'ldots', 'k', 'when', 'h', 'h_1', 'cdots', 'h_k', 'we', 'simply', 'write', 'gr_kh', 'we', 'study', 'gallairamsey', 'numbers', 'of', 'even', 'cycles', 'and', 'paths', 'for', 'all', 'nge3', 'and', 'kge2', 'let', 'g_ip_2i3', 'be', 'a', 'path', 'on', '2i3', 'vertices', 'for', 'all', 'iin01', 'ldots', 'n2', 'and', 'g_n1inc_2n', 'p_2n1', 'let', 'i_jin01ldots', 'n1', 'for', 'all', 'jin12', 'ldots', 'k', 'with', 'i_1ge', 'i_2gecdotsge', 'i_k', 'the', 'first', 'author', 'recently', 'conjectured', 'that', 'grg_i_1', 'g_i_2', 'ldots', 'g_i_k', 'g_i_1sum_j2k', 'i_j', 'the', 'truth', 'of', 'this', 'conjecture', 'implies', 'that', 'gr_kc_2ngr_kp_2nn1kn1', 'for', 'all', 'nge3', 'and', 'kge1', 'and', 'gr_kp_2n1n1kn2', 'for', 'all', 'nge1', 'and', 'kge1', 'in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'aforementioned', 'conjecture', 'holds', 'for', 'nin34', 'and', 'all', 'kge2', 'our', 'proof', 'relies', 'only', 'on', 'gallais', 'result', 'and', 'the', 'classical', 'ramsey', 'numbers', 'rh_1', 'h_2', 'where', 'h_1', 'h_2inc_8', 'c_6', 'p_7', 'p_5', 'p_3', 'we', 'believe', 'the', 'recoloring', 'method', 'we', 'developed', 'here', 'will', 'be', 'very', 'useful', 'for', 'solving', 'subsequent', 'cases', 'and', 'perhaps', 'the', 'conjecture']]
|
[-0.22603183858726747, 0.18178022165346336, -0.022681102865556284, -0.010334421395768982, -0.08216238044206961, -0.19554280298090174, -0.0002653145860296799, 0.3619214978447851, -0.2501608639989113, -0.2632396446276845, 0.05626918775937636, -0.3529519488703719, -0.11554490149412674, 0.10680284910946529, -0.10512744835045058, -0.026784517274664445, 0.10840445630187492, 0.08935548428130981, 0.09350048524758486, -0.30148717711722495, 0.2370902756015108, -0.16445576172062562, 0.1028938403872041, 0.10406254611061469, 0.07394655906266315, 0.0733897358107274, 0.0600318791088764, 0.028752685804330887, -0.25712849384852693, 0.03834378443205433, 0.27785438372387516, 0.1904858684952635, 0.26349798585311396, -0.36020534016138095, -0.0907154447498699, 0.28766063440693035, 0.17657220884416233, -0.008430289016545411, 0.019889277399086684, -0.1825005235257605, 0.17062418968231413, -0.06156402672942153, -0.09692933061275984, -0.01751867798620381, 0.17165076347596164, -0.03172392867371181, -0.36584323642321337, -0.020194855699343466, 0.1468652021565558, 0.07723221973057336, 0.07266159074737769, -0.2677310593982241, -0.0689444473529911, 0.06729610960317234, -0.08597132893144825, 0.12141652450003702, -0.05971004924156578, -0.0828969625868216, -0.16272913406959813, 0.3883048656086127, -0.028206133090807543, -0.12833241854020538, 0.027867832830388895, -0.1499638473568716, -0.2646933780584614, 0.08125686002385557, 0.011898991200651288, 0.21940480082745278, -0.0468621241333182, 0.15419709823466143, -0.18497105898215108, 0.10140018237856638, 0.1785392242655232, 0.024753520796040714, 0.0908661056019262, 0.02832451228409153, 0.1325635978823472, 0.12149369037496992, 0.04249098339808447, 0.07794044088729801, -0.35064157280394465, -0.1787958625896338, -0.25752186233441887, 0.16081799122166648, -0.17094814003509207, -0.1233868797457967, 0.34607508907845214, 0.11596156515045536, 0.17528412036078783, 0.1548961697769495, 0.21249801542367253, 0.039844742568965016, 0.005673270985317319, 0.17993669300594956, 0.02765545228438855, 0.18109789091760098, -0.06569017817869212, -0.1493319218158166, 0.006364330072511933, 0.20004938251862478]
|
1,803.07964
|
Stochastic Learning under Random Reshuffling with Constant Step-sizes
|
In empirical risk optimization, it has been observed that stochastic gradient
implementations that rely on random reshuffling of the data achieve better
performance than implementations that rely on sampling the data uniformly.
Recent works have pursued justifications for this behavior by examining the
convergence rate of the learning process under diminishing step-sizes. This
work focuses on the constant step-size case and strongly convex loss function.
In this case, convergence is guaranteed to a small neighborhood of the
optimizer albeit at a linear rate. The analysis establishes analytically that
random reshuffling outperforms uniform sampling by showing explicitly that
iterates approach a smaller neighborhood of size $O(\mu^2)$ around the
minimizer rather than $O(\mu)$. Furthermore, we derive an analytical expression
for the steady-state mean-square-error performance of the algorithm, which
helps clarify in greater detail the differences between sampling with and
without replacement. We also explain the periodic behavior that is observed in
random reshuffling implementations.
|
cs.LG math.OC stat.ML
|
in empirical risk optimization it has been observed that stochastic gradient implementations that rely on random reshuffling of the data achieve better performance than implementations that rely on sampling the data uniformly recent works have pursued justifications for this behavior by examining the convergence rate of the learning process under diminishing stepsizes this work focuses on the constant stepsize case and strongly convex loss function in this case convergence is guaranteed to a small neighborhood of the optimizer albeit at a linear rate the analysis establishes analytically that random reshuffling outperforms uniform sampling by showing explicitly that iterates approach a smaller neighborhood of size omu2 around the minimizer rather than omu furthermore we derive an analytical expression for the steadystate meansquareerror performance of the algorithm which helps clarify in greater detail the differences between sampling with and without replacement we also explain the periodic behavior that is observed in random reshuffling implementations
|
[['in', 'empirical', 'risk', 'optimization', 'it', 'has', 'been', 'observed', 'that', 'stochastic', 'gradient', 'implementations', 'that', 'rely', 'on', 'random', 'reshuffling', 'of', 'the', 'data', 'achieve', 'better', 'performance', 'than', 'implementations', 'that', 'rely', 'on', 'sampling', 'the', 'data', 'uniformly', 'recent', 'works', 'have', 'pursued', 'justifications', 'for', 'this', 'behavior', 'by', 'examining', 'the', 'convergence', 'rate', 'of', 'the', 'learning', 'process', 'under', 'diminishing', 'stepsizes', 'this', 'work', 'focuses', 'on', 'the', 'constant', 'stepsize', 'case', 'and', 'strongly', 'convex', 'loss', 'function', 'in', 'this', 'case', 'convergence', 'is', 'guaranteed', 'to', 'a', 'small', 'neighborhood', 'of', 'the', 'optimizer', 'albeit', 'at', 'a', 'linear', 'rate', 'the', 'analysis', 'establishes', 'analytically', 'that', 'random', 'reshuffling', 'outperforms', 'uniform', 'sampling', 'by', 'showing', 'explicitly', 'that', 'iterates', 'approach', 'a', 'smaller', 'neighborhood', 'of', 'size', 'omu2', 'around', 'the', 'minimizer', 'rather', 'than', 'omu', 'furthermore', 'we', 'derive', 'an', 'analytical', 'expression', 'for', 'the', 'steadystate', 'meansquareerror', 'performance', 'of', 'the', 'algorithm', 'which', 'helps', 'clarify', 'in', 'greater', 'detail', 'the', 'differences', 'between', 'sampling', 'with', 'and', 'without', 'replacement', 'we', 'also', 'explain', 'the', 'periodic', 'behavior', 'that', 'is', 'observed', 'in', 'random', 'reshuffling', 'implementations']]
|
[-0.10473987298380387, 0.03354379176677245, -0.10109423457853202, 0.08099487647657617, -0.05372875681343047, -0.13266702673067093, 0.10950331169480801, 0.4284438769038963, -0.23769242091772244, -0.2717701329705673, 0.10361002512447733, -0.24259449036310943, -0.1692332144900176, 0.19954615957900196, -0.10705178627425707, 0.06330804994918014, 0.09157313552905659, 0.02354289297823255, -0.102636220583104, -0.2995738195344242, 0.26994384590714043, 0.09832756835232048, 0.3248573146196769, -0.001421573331754189, 0.0938987962903124, -0.0014590234947574668, 0.005913094089727996, 0.019312326468551827, -0.12670596329161, 0.10456026958739753, 0.19465064081841296, 0.14986520007062754, 0.35787930801559825, -0.3920580499903544, -0.19813418218568826, 0.1397533524723258, 0.16844498044271236, 0.07891129427757972, -0.07321016502637097, -0.21199413262901975, 0.11459249740245898, -0.11123181797493568, -0.09920926200912188, -0.11071410699131727, -0.02106003546597142, 0.05841575696295446, -0.3173870148541602, 0.07704199481993687, 0.10241751664694962, 0.06690354170400258, -0.023053494629781006, -0.14187663189123237, 0.030762471047254575, 0.08153596347332687, 0.1000212931668868, 0.03516476149793322, 0.13975168295253657, -0.08231451918637551, -0.11420821279668751, 0.3173962764866653, -0.08052142679260119, -0.2372510680365131, 0.16494226734472536, -0.12266369260185839, -0.13504685383247161, 0.1509897260081121, 0.17785379308502583, 0.13439519335454525, -0.16323957790767676, 0.08969802028839599, -0.041533069646806996, 0.154240778788287, 0.07032423385106468, 0.027216308446919645, 0.09558733464157405, 0.1992823445195283, 0.14647177894948982, 0.13876512789590234, -0.04639216842923289, -0.17373936582895877, -0.25798713497964565, -0.08620922303050879, -0.23146045529957568, 0.015237632470272825, -0.13862564313622946, -0.1485079094142604, 0.362964590110718, 0.19714407228533865, 0.20063858291771458, 0.15250255729417977, 0.33205775618798244, 0.11931610234866016, 0.04670200287211245, 0.13356452777761182, 0.2337419181406547, 0.0665264573885667, 0.08496815758438683, -0.23775809301725148, 0.16880224011363584, 0.0745488760508842]
|
1,803.07965
|
High-resolution numerical relativity simulations of spinning binary
neutron star mergers
|
The recent detection of gravitational waves and electromagnetic counterparts
emitted during and after the collision of two neutron stars marks a
breakthrough in the field of multi-messenger astronomy. Numerical relativity
simulations are the only tool to describe the binary's merger dynamics in the
regime when speeds are largest and gravity is strongest. In this work we report
state-of-the-art binary neutron star simulations for irrotational
(non-spinning) and spinning configurations. The main use of these simulations
is to model the gravitational-wave signal. Key numerical requirements are the
understanding of the convergence properties of the numerical data and a
detailed error budget. The simulations have been performed on different HPC
clusters, they use multiple grid resolutions, and are based on eccentricity
reduced quasi-circular initial data. We obtain convergent waveforms with phase
errors of 0.5-1.5 rad accumulated over approximately 12 orbits to merger. The
waveforms have been used for the construction of a phenomenological waveform
model which has been applied for the analysis of the recent binary neutron star
detection. Additionally, we show that the data can also be used to test other
state-of-the-art semi-analytical waveform models.
|
gr-qc astro-ph.HE
|
the recent detection of gravitational waves and electromagnetic counterparts emitted during and after the collision of two neutron stars marks a breakthrough in the field of multimessenger astronomy numerical relativity simulations are the only tool to describe the binarys merger dynamics in the regime when speeds are largest and gravity is strongest in this work we report stateoftheart binary neutron star simulations for irrotational nonspinning and spinning configurations the main use of these simulations is to model the gravitationalwave signal key numerical requirements are the understanding of the convergence properties of the numerical data and a detailed error budget the simulations have been performed on different hpc clusters they use multiple grid resolutions and are based on eccentricity reduced quasicircular initial data we obtain convergent waveforms with phase errors of 0515 rad accumulated over approximately 12 orbits to merger the waveforms have been used for the construction of a phenomenological waveform model which has been applied for the analysis of the recent binary neutron star detection additionally we show that the data can also be used to test other stateoftheart semianalytical waveform models
|
[['the', 'recent', 'detection', 'of', 'gravitational', 'waves', 'and', 'electromagnetic', 'counterparts', 'emitted', 'during', 'and', 'after', 'the', 'collision', 'of', 'two', 'neutron', 'stars', 'marks', 'a', 'breakthrough', 'in', 'the', 'field', 'of', 'multimessenger', 'astronomy', 'numerical', 'relativity', 'simulations', 'are', 'the', 'only', 'tool', 'to', 'describe', 'the', 'binarys', 'merger', 'dynamics', 'in', 'the', 'regime', 'when', 'speeds', 'are', 'largest', 'and', 'gravity', 'is', 'strongest', 'in', 'this', 'work', 'we', 'report', 'stateoftheart', 'binary', 'neutron', 'star', 'simulations', 'for', 'irrotational', 'nonspinning', 'and', 'spinning', 'configurations', 'the', 'main', 'use', 'of', 'these', 'simulations', 'is', 'to', 'model', 'the', 'gravitationalwave', 'signal', 'key', 'numerical', 'requirements', 'are', 'the', 'understanding', 'of', 'the', 'convergence', 'properties', 'of', 'the', 'numerical', 'data', 'and', 'a', 'detailed', 'error', 'budget', 'the', 'simulations', 'have', 'been', 'performed', 'on', 'different', 'hpc', 'clusters', 'they', 'use', 'multiple', 'grid', 'resolutions', 'and', 'are', 'based', 'on', 'eccentricity', 'reduced', 'quasicircular', 'initial', 'data', 'we', 'obtain', 'convergent', 'waveforms', 'with', 'phase', 'errors', 'of', '0515', 'rad', 'accumulated', 'over', 'approximately', '12', 'orbits', 'to', 'merger', 'the', 'waveforms', 'have', 'been', 'used', 'for', 'the', 'construction', 'of', 'a', 'phenomenological', 'waveform', 'model', 'which', 'has', 'been', 'applied', 'for', 'the', 'analysis', 'of', 'the', 'recent', 'binary', 'neutron', 'star', 'detection', 'additionally', 'we', 'show', 'that', 'the', 'data', 'can', 'also', 'be', 'used', 'to', 'test', 'other', 'stateoftheart', 'semianalytical', 'waveform', 'models']]
|
[-0.1349305740186736, 0.08238659183306446, -0.09758371053533273, 0.06650737479384454, -0.08863255045570108, -0.04084093351924761, -0.01639907792559825, 0.3856721423500182, -0.16903027692361852, -0.3314049427545136, 0.10995536257037028, -0.2850435743759809, -0.08762014619853409, 0.279720888176966, -0.008585509691448485, 0.10399478910304161, 0.17151949520075255, 0.004135442341046784, -0.09885082192288945, -0.2519001932121315, 0.2814575614333865, 0.11531084747934113, 0.20489115813808118, -0.03528832679848528, 0.07123890529002465, -0.045626430179353784, -0.06091246644513366, -0.04302502458004149, -0.158415802824637, 0.04307056380635575, 0.25891235846952715, 0.1633953555255538, 0.21538881938001192, -0.4544221988721379, -0.2386205977430412, 0.06498630336470536, 0.13362557420766621, 0.15297906163537905, -0.09363118815156275, -0.27710364622196254, 0.09659939695943574, -0.2556068989692531, -0.08781127395016737, -0.04969030131122779, 0.05126232443481704, 0.08616316723611837, -0.2437818571677065, 0.07928706354209059, 0.036593261050172354, -0.0009902211547386452, -0.07276119285166427, -0.10240170951293975, -0.0016931346363179345, 0.11082648963217695, 0.06831626930748637, 0.059349195957896325, 0.12015680393682478, -0.10425338188639226, -0.12644099617692453, 0.38206404209381245, -0.044708078509563064, -0.15575527681719736, 0.20841587206241904, -0.19177188445391552, -0.1408529513225448, 0.15020863746694935, 0.22346990979963638, 0.1611087094722672, -0.1419410485042866, 0.011830916287901663, 0.04579996687100559, 0.19314921077574945, 0.07962607981794885, -0.010677115281768998, 0.31267520927320247, 0.19221375394444606, -0.02409891932795608, 0.09276399835454341, -0.18612968081053693, -0.08136563779324385, -0.24631781678658254, -0.06443207263020936, -0.1584139495892094, 0.03493183522798182, -0.10878016088226915, -0.11777216408788506, 0.37964219043204367, 0.17787856147548214, 0.10935807871108091, 0.047654753839062744, 0.32748453264618343, 0.0883483757319621, 0.02515196016877686, 0.0703602875468367, 0.340180466254369, 0.13857023004707092, 0.06913359656667876, -0.2229488097930256, 0.03317583246694756, 0.025284991375694836]
|
1,803.07966
|
Consistent Adaptive Multiple Importance Sampling and Controlled
Diffusions
|
Recent progress has been made with Adaptive Multiple Importance Sampling
(AMIS) methods that show improvement in effective sample size. However,
consistency for the AMIS estimator has only been established in very restricted
cases. Furthermore, the high computational complexity of the re-weighting in
AMIS (called balance heuristic) makes it expensive for applications involving
diffusion processes. In this work we consider sequential and adaptive
importance sampling that is particularly suitable for diffusion processes. We
propose a new discarding-re-weighting scheme that is of lower computational
complexity, and we prove that the resulting AMIS is consistent. Using numerical
experiments, we demonstrate that discarding-re-weighting performs very similar
to the balance heuristic, but at a fraction of the computational cost.
|
math.OC
|
recent progress has been made with adaptive multiple importance sampling amis methods that show improvement in effective sample size however consistency for the amis estimator has only been established in very restricted cases furthermore the high computational complexity of the reweighting in amis called balance heuristic makes it expensive for applications involving diffusion processes in this work we consider sequential and adaptive importance sampling that is particularly suitable for diffusion processes we propose a new discardingreweighting scheme that is of lower computational complexity and we prove that the resulting amis is consistent using numerical experiments we demonstrate that discardingreweighting performs very similar to the balance heuristic but at a fraction of the computational cost
|
[['recent', 'progress', 'has', 'been', 'made', 'with', 'adaptive', 'multiple', 'importance', 'sampling', 'amis', 'methods', 'that', 'show', 'improvement', 'in', 'effective', 'sample', 'size', 'however', 'consistency', 'for', 'the', 'amis', 'estimator', 'has', 'only', 'been', 'established', 'in', 'very', 'restricted', 'cases', 'furthermore', 'the', 'high', 'computational', 'complexity', 'of', 'the', 'reweighting', 'in', 'amis', 'called', 'balance', 'heuristic', 'makes', 'it', 'expensive', 'for', 'applications', 'involving', 'diffusion', 'processes', 'in', 'this', 'work', 'we', 'consider', 'sequential', 'and', 'adaptive', 'importance', 'sampling', 'that', 'is', 'particularly', 'suitable', 'for', 'diffusion', 'processes', 'we', 'propose', 'a', 'new', 'discardingreweighting', 'scheme', 'that', 'is', 'of', 'lower', 'computational', 'complexity', 'and', 'we', 'prove', 'that', 'the', 'resulting', 'amis', 'is', 'consistent', 'using', 'numerical', 'experiments', 'we', 'demonstrate', 'that', 'discardingreweighting', 'performs', 'very', 'similar', 'to', 'the', 'balance', 'heuristic', 'but', 'at', 'a', 'fraction', 'of', 'the', 'computational', 'cost']]
|
[-0.08327505692432169, 0.05965097221113475, -0.1004239761844344, 0.09110594526490397, -0.08137117035221308, -0.14392553827825136, 0.09871324060700967, 0.44927653996273875, -0.23544708205320472, -0.3025862063347761, 0.10983176678252805, -0.20574243559219343, -0.17697290750220418, 0.21951902968742484, -0.11821532524689767, 0.10605974962735283, 0.12689020401532097, -0.028858899970405867, -0.05602970504852627, -0.2873765914222791, 0.24669741516845534, 0.12979662243742496, 0.3272788734175265, 0.03628504530310498, 0.14752535789531457, -0.0062338185151540005, -0.05080741157455902, 0.07338914644383619, -0.11274672281284179, 0.12638264103900707, 0.2623775223182747, 0.14963225106683758, 0.3627741132430466, -0.3925429925768315, -0.2309831472271721, 0.09227528613700997, 0.16665737172921322, 0.10885647055277202, -0.13850647072415864, -0.15365592553488178, 0.10370832164127412, -0.15604653894635184, -0.07089215599782099, -0.14881862967948628, 0.011938503427830125, -0.009807952934352215, -0.32617785685163525, 0.08317296629450409, 0.02861185546914515, 0.041557030261693786, 0.03217239001241978, -0.1555981692675102, 0.06809207739258584, 0.08651866003804441, 0.039089967510205624, 0.005880513771054601, 0.07369210124098961, -0.1327092283318052, -0.12519407688107873, 0.35840041109726634, -0.030277547775767744, -0.21408929382284572, 0.24683151668536343, -0.09409228131906795, -0.22028436525891135, 0.15286159457173198, 0.1656510930042714, 0.1273822873689434, -0.13050740516544984, 0.1149936286456068, -0.016093264599995955, 0.14544747325375543, 0.030179582205684192, 0.02344833407135281, 0.06667681300574, 0.2506878548821468, 0.10676229306409368, 0.1546807948283718, -0.10152632607995267, -0.12230230845411175, -0.2309950681400161, -0.15740541832097474, -0.21782794785602683, -0.01705858779522324, -0.08445066124191467, -0.1284264568821527, 0.30226018863436366, 0.221032088445749, 0.17687016832808564, 0.11702255251085651, 0.33327968346254366, 0.1177946434171255, 0.05188025321175311, 0.0904914717414483, 0.232516663997168, 0.06800282713291901, 0.09143953229379674, -0.2342896293432984, 0.128859988905398, 0.049840308887983804]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.