id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0406 | Notable Characteristics Search through Knowledge Graphs | Query answering routinely employs knowledge graphs to assist the user in the
search process. Given a knowledge graph that represents entities and
relationships among them, one aims at complementing the search with intuitive
but effective mechanisms. In particular, we focus on the comparison of two or
more entities and the detection of unexpected, surprising properties, called
notable characteristics. Such characteristics provide intuitive explanations of
the peculiarities of the selected entities with respect to similar entities. We
propose a solid probabilistic approach that first retrieves entity nodes
similar to the query nodes provided by the user, and then exploits
distributional properties to understand whether a certain attribute is
interesting or not. Our preliminary experiments demonstrate the solidity of our
approach and show that we are able to discover notable characteristics that are
indeed interesting and relevant for the user.
| cs.DB | query answering routinely employs knowledge graphs to assist the user in the search process given a knowledge graph that represents entities and relationships among them one aims at complementing the search with intuitive but effective mechanisms in particular we focus on the comparison of two or more entities and the detection of unexpected surprising properties called notable characteristics such characteristics provide intuitive explanations of the peculiarities of the selected entities with respect to similar entities we propose a solid probabilistic approach that first retrieves entity nodes similar to the query nodes provided by the user and then exploits distributional properties to understand whether a certain attribute is interesting or not our preliminary experiments demonstrate the solidity of our approach and show that we are able to discover notable characteristics that are indeed interesting and relevant for the user | [['query', 'answering', 'routinely', 'employs', 'knowledge', 'graphs', 'to', 'assist', 'the', 'user', 'in', 'the', 'search', 'process', 'given', 'a', 'knowledge', 'graph', 'that', 'represents', 'entities', 'and', 'relationships', 'among', 'them', 'one', 'aims', 'at', 'complementing', 'the', 'search', 'with', 'intuitive', 'but', 'effective', 'mechanisms', 'in', 'particular', 'we', 'focus', 'on', 'the', 'comparison', 'of', 'two', 'or', 'more', 'entities', 'and', 'the', 'detection', 'of', 'unexpected', 'surprising', 'properties', 'called', 'notable', 'characteristics', 'such', 'characteristics', 'provide', 'intuitive', 'explanations', 'of', 'the', 'peculiarities', 'of', 'the', 'selected', 'entities', 'with', 'respect', 'to', 'similar', 'entities', 'we', 'propose', 'a', 'solid', 'probabilistic', 'approach', 'that', 'first', 'retrieves', 'entity', 'nodes', 'similar', 'to', 'the', 'query', 'nodes', 'provided', 'by', 'the', 'user', 'and', 'then', 'exploits', 'distributional', 'properties', 'to', 'understand', 'whether', 'a', 'certain', 'attribute', 'is', 'interesting', 'or', 'not', 'our', 'preliminary', 'experiments', 'demonstrate', 'the', 'solidity', 'of', 'our', 'approach', 'and', 'show', 'that', 'we', 'are', 'able', 'to', 'discover', 'notable', 'characteristics', 'that', 'are', 'indeed', 'interesting', 'and', 'relevant', 'for', 'the', 'user']] | [-0.08828370686893797, 0.02301856431691651, -0.08298365275065105, 0.10975451400278963, -0.1839559985952371, -0.1676422568557757, 0.10837145655017778, 0.40374889686379745, -0.25270931281324854, -0.35040063937270566, 0.02668257446898876, -0.32723292978345486, -0.21093057761765152, 0.16669075028714386, -0.06126087456874117, 0.02085085680026669, 0.0639602011331168, 0.11562322676574062, -0.028182938782687204, -0.21866362219093455, 0.34926463635233435, 0.05540656255882071, 0.26956117792270967, 0.056422478181944374, 0.10184212735233207, -0.01235518190272463, -0.08481574392256637, 0.01791001211149969, -0.10598127794408989, 0.155889507835272, 0.31229782570153475, 0.19573781005970703, 0.26007413208835584, -0.41118033507002005, -0.18150319859463102, 0.07303833563397032, 0.11893856353328927, 0.07510114984208907, -0.061279242625143684, -0.3139156772336666, 0.11843812002790281, -0.11802243220322914, -0.06340088148979281, -0.12901736208764109, 0.013172621177374453, 0.044481750712662506, -0.2371324223054546, -0.008422559063731476, 0.11195277572150572, 0.03389333247247597, -0.03424545877403917, -0.0920094545033045, 0.0344476966774496, 0.18435303823671478, 0.042803187899930956, -0.018211336365219315, 0.09612193295354213, -0.1324776597051085, -0.1719916883241925, 0.41496207658201456, 0.0002813406518080096, -0.17691129320503576, 0.2712785408332728, -0.09493591550035753, -0.17354136015342522, 0.0758658988819714, 0.16273812716151925, 0.10705231541035481, -0.18266517691233236, -0.008416890830182861, -0.055100246076978256, 0.19341511917098062, 0.040540131866810436, 0.059343950448395764, 0.216224225865596, 0.19036465937076003, 0.037782696726988405, 0.1475306901189944, -0.03527379606574592, -0.08004986646372582, -0.2613176910503619, -0.16568507428577953, -0.1585352967756436, -0.03271379466900396, -0.10995655616884967, -0.13363834935159463, 0.4182241467111137, 0.2494709246346484, 0.23645529994045963, 0.03172392721382388, 0.2891197653784268, 0.03587969853981412, 0.06368359108961633, 0.10148734077676266, 0.170310947010243, 0.024644081728816356, 0.09684760574811557, -0.16624975342141546, 0.16640187655676805, 0.01869015865351843] |
1,802.04061 | Abelian extensions and crossed modules of Hom-Lie algebras | In this paper we study the low dimensional cohomology groups of Hom-Lie
algebras and their relation with derivations, abelian extensions and crossed
modules. On one hand, we introduce the notion of $\alpha$-abelian extensions
and we obtain a five term exact sequence in cohomology. On the other hand, we
introduce crossed modules of Hom-Lie algebras showing their equivalence with
cat$^1$-Hom-Lie algebras, and we introduce $\alpha$-crossed modules to have a
better understanding of the third cohomology group.
| math.RA | in this paper we study the low dimensional cohomology groups of homlie algebras and their relation with derivations abelian extensions and crossed modules on one hand we introduce the notion of alphaabelian extensions and we obtain a five term exact sequence in cohomology on the other hand we introduce crossed modules of homlie algebras showing their equivalence with cat1homlie algebras and we introduce alphacrossed modules to have a better understanding of the third cohomology group | [['in', 'this', 'paper', 'we', 'study', 'the', 'low', 'dimensional', 'cohomology', 'groups', 'of', 'homlie', 'algebras', 'and', 'their', 'relation', 'with', 'derivations', 'abelian', 'extensions', 'and', 'crossed', 'modules', 'on', 'one', 'hand', 'we', 'introduce', 'the', 'notion', 'of', 'alphaabelian', 'extensions', 'and', 'we', 'obtain', 'a', 'five', 'term', 'exact', 'sequence', 'in', 'cohomology', 'on', 'the', 'other', 'hand', 'we', 'introduce', 'crossed', 'modules', 'of', 'homlie', 'algebras', 'showing', 'their', 'equivalence', 'with', 'cat1homlie', 'algebras', 'and', 'we', 'introduce', 'alphacrossed', 'modules', 'to', 'have', 'a', 'better', 'understanding', 'of', 'the', 'third', 'cohomology', 'group']] | [-0.19894032490750155, 0.02944503925068097, -0.08647556168337663, 0.09612750356932843, -0.1438696738494198, -0.14793426379199243, -0.02591179537315232, 0.4122782373904354, -0.35220756029917133, -0.23661418453169367, 0.14174556535888566, -0.23508238204522058, -0.18746706359605822, 0.14528906126765329, -0.1824514682456437, -0.1051571623910503, 0.07278108510137019, 0.12620135315228254, -0.13235393780632876, -0.28141936794660677, 0.502887292254147, -0.003249918508421009, 0.22705703191200477, 0.035532586819802724, 0.12842759859955144, 0.02667607866654483, -0.06372790739664601, -0.018938236106704507, -0.20269513657937446, 0.1863136147795659, 0.29931182253898847, 0.007641276771513124, 0.1956145707711888, -0.37708280871932703, -0.04301394717509134, 0.18364512261986318, 0.11943904706276953, 0.05246187309643978, -0.061391555254683934, -0.27040755805662936, 0.07097167917527258, -0.3206299345264496, -0.06770486498135142, -0.09676172411612545, 0.023280509692590892, 0.005274543934825083, -0.17274426623609745, 0.014415330602787435, 0.08446531414261295, 0.1738126787952044, -0.15509591857618135, -0.06035635189618915, -0.036451905632727884, 0.10237381007108423, -0.0685854382140355, -0.07245194120655975, 0.1250436827346372, -0.11522313612062539, -0.23035398989708888, 0.35389839010571855, -0.06135682442173776, -0.2194064522886442, 0.20850512049057418, -0.2302197958342731, -0.24126044989356565, -0.016024243319407105, 0.04362308896250195, 0.14751291137913036, -0.029599269179420337, 0.15905452558500757, -0.08714856751935764, -0.0022385972034600046, 0.07129284070752975, 0.06593480995959705, 0.13484453276032582, 0.13749840357599574, 0.04258083287277259, 0.20014422059709128, 0.058589069871231914, 0.0060899111235307325, -0.3192132346125113, -0.2328982968061205, 0.02361847554695689, 0.06280553689996143, -0.06477321694627688, -0.16041794833533154, 0.4817107156979748, 0.19034217481304141, 0.1624178750336998, 0.1836660675600999, 0.23516522761848238, 0.05651939304273886, 0.1742893226328306, 0.019326849116219416, 0.13909588880940443, 0.28958982713003123, -0.025537717207852337, -0.08793486894056615, -0.0849034824512071, 0.2562130375040902] |
1,802.04062 | Elastic modeling of point-defects and their interaction | Different descriptions used to model a point-defect in an elastic continuum
are reviewed. The emphasis is put on the elastic dipole approximation, which is
shown to be equivalent to the infinitesimal Eshelby inclusion and to the
infinitesimal dislocation loop. Knowing this elastic dipole, a second rank
tensor fully characterizing the point-defect, one can directly obtain the
long-range elastic field induced by the point-defect and its interaction with
other elastic fields. The polarizability of the point-defect, resulting from
the elastic dipole dependence with the applied strain, is also introduced.
Parameterization of such an elastic model, either from experiments or from
atomic simulations, is discussed. Different examples, like elastodiffusion and
bias calculations, are finally considered to illustrate the usefulness of such
an elastic model to describe the evolution of a point-defect in a external
elastic field.
| cond-mat.mtrl-sci | different descriptions used to model a pointdefect in an elastic continuum are reviewed the emphasis is put on the elastic dipole approximation which is shown to be equivalent to the infinitesimal eshelby inclusion and to the infinitesimal dislocation loop knowing this elastic dipole a second rank tensor fully characterizing the pointdefect one can directly obtain the longrange elastic field induced by the pointdefect and its interaction with other elastic fields the polarizability of the pointdefect resulting from the elastic dipole dependence with the applied strain is also introduced parameterization of such an elastic model either from experiments or from atomic simulations is discussed different examples like elastodiffusion and bias calculations are finally considered to illustrate the usefulness of such an elastic model to describe the evolution of a pointdefect in a external elastic field | [['different', 'descriptions', 'used', 'to', 'model', 'a', 'pointdefect', 'in', 'an', 'elastic', 'continuum', 'are', 'reviewed', 'the', 'emphasis', 'is', 'put', 'on', 'the', 'elastic', 'dipole', 'approximation', 'which', 'is', 'shown', 'to', 'be', 'equivalent', 'to', 'the', 'infinitesimal', 'eshelby', 'inclusion', 'and', 'to', 'the', 'infinitesimal', 'dislocation', 'loop', 'knowing', 'this', 'elastic', 'dipole', 'a', 'second', 'rank', 'tensor', 'fully', 'characterizing', 'the', 'pointdefect', 'one', 'can', 'directly', 'obtain', 'the', 'longrange', 'elastic', 'field', 'induced', 'by', 'the', 'pointdefect', 'and', 'its', 'interaction', 'with', 'other', 'elastic', 'fields', 'the', 'polarizability', 'of', 'the', 'pointdefect', 'resulting', 'from', 'the', 'elastic', 'dipole', 'dependence', 'with', 'the', 'applied', 'strain', 'is', 'also', 'introduced', 'parameterization', 'of', 'such', 'an', 'elastic', 'model', 'either', 'from', 'experiments', 'or', 'from', 'atomic', 'simulations', 'is', 'discussed', 'different', 'examples', 'like', 'elastodiffusion', 'and', 'bias', 'calculations', 'are', 'finally', 'considered', 'to', 'illustrate', 'the', 'usefulness', 'of', 'such', 'an', 'elastic', 'model', 'to', 'describe', 'the', 'evolution', 'of', 'a', 'pointdefect', 'in', 'a', 'external', 'elastic', 'field']] | [-0.090613334682082, 0.15517334795655569, -0.06746687715761919, 0.05478790962509116, -0.08162546566854328, -0.06797414155913267, -0.04633372343743025, 0.38904317020118906, -0.31563761969333265, -0.2610170365582262, 0.0522988265738197, -0.2833525927028438, -0.1679177037874626, 0.13378370711545168, 0.057497074992618344, 0.04834647445006421, -0.01590905991841608, 0.07704134641646115, -0.04288664538719093, -0.16622382859741128, 0.312895551254389, 0.07364182516154069, 0.29246411425471586, 0.09728993917120371, 0.07527315395592309, 0.06322968949619402, -0.012713580454852599, 0.08538293492730095, -0.12202017521485686, 0.12554638606840188, 0.21161649582617387, -0.020458181492928693, 0.16326294497433883, -0.5034938415846051, -0.1843875960738801, 0.06634237759732711, 0.08472160019202908, 0.1649783846336667, 0.0025279854151503698, -0.2830758580326367, 0.030847972818414, -0.17667743683542445, -0.14380220686165449, -0.11819319199047872, 0.01813363457539939, 0.05979512049034655, -0.2605106482532487, 0.050467344386452714, 0.049312606041229314, 0.03996192610516593, -0.13994059680853344, -0.11883494699088884, -0.03434837202597132, 0.057645415344254686, 0.08876744070205031, 0.038095726049505174, 0.18083637188633542, -0.12292275345126695, -0.0810560430026502, 0.42425210864297047, -0.0470528559183264, -0.2210666708119992, 0.16406555705245085, -0.08016933294694259, -0.0570776981767267, 0.14262018819103267, 0.18694810960233324, 0.05974743735377934, -0.1693840687607985, 0.08869218609318373, 0.01748544459644733, 0.14848184116782426, 0.04317850658822971, -0.04566004118228804, 0.18094885757248572, 0.16872836408420785, -0.014014225619942394, 0.15948417605163265, -0.08303222654714447, -0.0707659569687085, -0.3308225654816227, -0.09408761337121475, -0.17393618739912037, 0.0509114060342423, -0.08763692081081004, -0.2100207940177947, 0.34401104823380374, 0.11560064306267218, 0.19178142159727207, -0.006850926517404671, 0.3012361296456057, 0.13009391542273893, 0.07741524484495062, 0.01738948398269713, 0.3305646914557846, 0.20628421179734782, 0.03896725640320323, -0.24485601691043513, 0.05881904304347265, 0.03757210171593826] |
1,802.04063 | Taking gradients through experiments: LSTMs and memory proximal policy
optimization for black-box quantum control | In this work we introduce the application of black-box quantum control as an
interesting rein- forcement learning problem to the machine learning community.
We analyze the structure of the reinforcement learning problems arising in
quantum physics and argue that agents parameterized by long short-term memory
(LSTM) networks trained via stochastic policy gradients yield a general method
to solving them. In this context we introduce a variant of the proximal policy
optimization (PPO) algorithm called the memory proximal policy optimization
(MPPO) which is based on this analysis. We then show how it can be applied to
specific learning tasks and present results of nu- merical experiments showing
that our method achieves state-of-the-art results for several learning tasks in
quantum control with discrete and continouous control parameters.
| cs.LG quant-ph | in this work we introduce the application of blackbox quantum control as an interesting rein forcement learning problem to the machine learning community we analyze the structure of the reinforcement learning problems arising in quantum physics and argue that agents parameterized by long shortterm memory lstm networks trained via stochastic policy gradients yield a general method to solving them in this context we introduce a variant of the proximal policy optimization ppo algorithm called the memory proximal policy optimization mppo which is based on this analysis we then show how it can be applied to specific learning tasks and present results of nu merical experiments showing that our method achieves stateoftheart results for several learning tasks in quantum control with discrete and continouous control parameters | [['in', 'this', 'work', 'we', 'introduce', 'the', 'application', 'of', 'blackbox', 'quantum', 'control', 'as', 'an', 'interesting', 'rein', 'forcement', 'learning', 'problem', 'to', 'the', 'machine', 'learning', 'community', 'we', 'analyze', 'the', 'structure', 'of', 'the', 'reinforcement', 'learning', 'problems', 'arising', 'in', 'quantum', 'physics', 'and', 'argue', 'that', 'agents', 'parameterized', 'by', 'long', 'shortterm', 'memory', 'lstm', 'networks', 'trained', 'via', 'stochastic', 'policy', 'gradients', 'yield', 'a', 'general', 'method', 'to', 'solving', 'them', 'in', 'this', 'context', 'we', 'introduce', 'a', 'variant', 'of', 'the', 'proximal', 'policy', 'optimization', 'ppo', 'algorithm', 'called', 'the', 'memory', 'proximal', 'policy', 'optimization', 'mppo', 'which', 'is', 'based', 'on', 'this', 'analysis', 'we', 'then', 'show', 'how', 'it', 'can', 'be', 'applied', 'to', 'specific', 'learning', 'tasks', 'and', 'present', 'results', 'of', 'nu', 'merical', 'experiments', 'showing', 'that', 'our', 'method', 'achieves', 'stateoftheart', 'results', 'for', 'several', 'learning', 'tasks', 'in', 'quantum', 'control', 'with', 'discrete', 'and', 'continouous', 'control', 'parameters']] | [-0.04390739006694497, 0.013353379599573053, -0.10117778010530079, 0.06657524837173401, -0.11834232177115916, -0.20293901251189836, 0.06269157225856693, 0.4598220977705063, -0.3510199126302893, -0.30926424197519453, 0.08327721791887065, -0.19306119561301377, -0.2528557013114536, 0.23350375602248966, -0.1411985470345471, 0.1027652645233746, 0.10632622193893403, 0.021712235557445423, -0.0671754489024359, -0.28825404830617696, 0.273009627552067, 0.03182636941991353, 0.28932864984452, 0.024547478755769448, 0.157982652401173, -0.008815468211821092, 0.03301137054293621, 0.02935449779033661, -0.10218397971884843, 0.17976013536099344, 0.35155732389085176, 0.2089102045269456, 0.39760973033471825, -0.3951931918812234, -0.21491754627635143, 0.11168140393295665, 0.114872040224926, 0.11385350285866487, -0.07583142315322434, -0.30799035718891676, 0.0730301539273554, -0.1664531133478371, 0.01952044007830261, -0.16955656377689504, -0.0727380682199406, 0.006395681458336066, -0.2948838613110564, 0.012230966681220787, 0.08266550401316547, 0.029699847673830704, -0.060578669917323, -0.10649196368857945, 0.10656148374148804, 0.10414877104974253, 0.04275228480554784, 0.05001763177929613, 0.1852965129584801, -0.14666998186868016, -0.24871067132997682, 0.3333110211235357, -0.06926804297694528, -0.2069772934291239, 0.15425628579100517, 0.02324495920002824, -0.19683105203633508, 0.033688778761865164, 0.26816027373741796, 0.16559441964619043, -0.155668045947332, 0.07261479871841602, -0.05817266004690068, 0.15525908421013293, -0.012298269532393755, -0.028574542106011867, 0.09344382009684767, 0.2589245192286354, 0.10258506788925184, 0.1715810353502374, -0.07880735346158717, -0.16413563303933365, -0.21785969004731595, -0.12229040937831367, -0.1673494752220113, 0.007525744530887199, -0.09453794980628465, -0.1319000634111131, 0.38216492994044854, 0.21922955834470043, 0.16776454355567694, 0.13026751875517723, 0.3274112551404936, 0.0961749173768955, 0.08101150738756831, 0.1522949833566762, 0.19162134789460436, 0.05702166657750987, 0.1570405898453872, -0.2727477044260841, 0.07214863530201156, 0.0691903141531639] |
1,802.04064 | A Contextual Bandit Bake-off | Contextual bandit algorithms are essential for solving many real-world
interactive machine learning problems. Despite multiple recent successes on
statistically and computationally efficient methods, the practical behavior of
these algorithms is still poorly understood. We leverage the availability of
large numbers of supervised learning datasets to empirically evaluate
contextual bandit algorithms, focusing on practical methods that learn by
relying on optimization oracles from supervised learning. We find that a recent
method (Foster et al., 2018) using optimism under uncertainty works the best
overall. A surprisingly close second is a simple greedy baseline that only
explores implicitly through the diversity of contexts, followed by a variant of
Online Cover (Agarwal et al., 2014) which tends to be more conservative but
robust to problem specification by design. Along the way, we also evaluate
various components of contextual bandit algorithm design such as loss
estimators. Overall, this is a thorough study and review of contextual bandit
methodology.
| stat.ML cs.LG | contextual bandit algorithms are essential for solving many realworld interactive machine learning problems despite multiple recent successes on statistically and computationally efficient methods the practical behavior of these algorithms is still poorly understood we leverage the availability of large numbers of supervised learning datasets to empirically evaluate contextual bandit algorithms focusing on practical methods that learn by relying on optimization oracles from supervised learning we find that a recent method foster et al 2018 using optimism under uncertainty works the best overall a surprisingly close second is a simple greedy baseline that only explores implicitly through the diversity of contexts followed by a variant of online cover agarwal et al 2014 which tends to be more conservative but robust to problem specification by design along the way we also evaluate various components of contextual bandit algorithm design such as loss estimators overall this is a thorough study and review of contextual bandit methodology | [['contextual', 'bandit', 'algorithms', 'are', 'essential', 'for', 'solving', 'many', 'realworld', 'interactive', 'machine', 'learning', 'problems', 'despite', 'multiple', 'recent', 'successes', 'on', 'statistically', 'and', 'computationally', 'efficient', 'methods', 'the', 'practical', 'behavior', 'of', 'these', 'algorithms', 'is', 'still', 'poorly', 'understood', 'we', 'leverage', 'the', 'availability', 'of', 'large', 'numbers', 'of', 'supervised', 'learning', 'datasets', 'to', 'empirically', 'evaluate', 'contextual', 'bandit', 'algorithms', 'focusing', 'on', 'practical', 'methods', 'that', 'learn', 'by', 'relying', 'on', 'optimization', 'oracles', 'from', 'supervised', 'learning', 'we', 'find', 'that', 'a', 'recent', 'method', 'foster', 'et', 'al', '2018', 'using', 'optimism', 'under', 'uncertainty', 'works', 'the', 'best', 'overall', 'a', 'surprisingly', 'close', 'second', 'is', 'a', 'simple', 'greedy', 'baseline', 'that', 'only', 'explores', 'implicitly', 'through', 'the', 'diversity', 'of', 'contexts', 'followed', 'by', 'a', 'variant', 'of', 'online', 'cover', 'agarwal', 'et', 'al', '2014', 'which', 'tends', 'to', 'be', 'more', 'conservative', 'but', 'robust', 'to', 'problem', 'specification', 'by', 'design', 'along', 'the', 'way', 'we', 'also', 'evaluate', 'various', 'components', 'of', 'contextual', 'bandit', 'algorithm', 'design', 'such', 'as', 'loss', 'estimators', 'overall', 'this', 'is', 'a', 'thorough', 'study', 'and', 'review', 'of', 'contextual', 'bandit', 'methodology']] | [-0.032245133611604915, -0.03633020313006211, -0.06761067852779638, 0.10402821828732936, -0.18348329110996298, -0.19867973249813456, 0.08847229849863676, 0.46570685328124395, -0.2645735045882806, -0.3691367614965618, 0.07914353567601662, -0.22756320083235373, -0.23742367700351025, 0.2289635032454195, -0.19029548726793305, 0.10584488807526095, 0.11147229346320006, -0.03526443841994977, -0.060050482538702224, -0.3383704189612877, 0.28260473960864485, 0.08973738549922416, 0.3115066919640145, -0.00945213299398341, 0.12086750444609161, 0.006437279659877318, -0.055470615142980725, 0.05793394102087987, -0.1095026217414248, 0.15159075668354038, 0.33754284900393994, 0.2555251457771055, 0.4221395776801883, -0.3617622401516617, -0.2063034476516038, 0.08371765322654563, 0.1389985202729483, 0.12192592910786533, -0.04729229190017423, -0.32710204143807586, 0.033923229955903744, -0.16599918385736304, 0.03968154717224583, -0.15139150222933856, -0.011511100252962434, 0.002182193745302, -0.30552826702801716, 0.05563404423384805, 0.08196380445916279, 0.05813286588009861, 0.01138023633564658, -0.13940654878255004, 0.10673855424606016, 0.08615683161598794, 0.04752347218268399, 0.032398468283692895, 0.13101236674374614, -0.14346928630255124, -0.23138694627533113, 0.3389894045171103, 0.0032000224428628786, -0.15147300214762344, 0.2068289710890526, 0.011390801676658584, -0.20753969031757388, 0.09131384974047298, 0.26243519625669115, 0.15649594389072624, -0.1728254693706392, 0.0745428337242296, -0.09196506203243546, 0.1609805893180344, 0.03431583104922978, -0.013690799968530199, 0.12952815687277786, 0.25277365521631306, 0.08310436683601746, 0.1094985106294926, -0.020062801913583492, -0.12695490715346525, -0.2014999603521645, -0.06629447807258092, -0.18687301653047744, -0.03434995227429431, -0.09822661015703464, -0.1387778462830123, 0.3336317208443397, 0.239429301837934, 0.1981594930136625, 0.11753015992462976, 0.37460744706000765, 0.022331525144788127, 0.02781317520010121, 0.15157463090810802, 0.21889713233918123, 0.0472189539379982, 0.12009810098732998, -0.18739475655613705, 0.14793676853003407, 0.041581324720146515] |
1,802.04065 | Bitcoin Volatility Forecasting with a Glimpse into Buy and Sell Orders | In this paper, we study the ability to make the short-term prediction of the
exchange price fluctuations towards the United States dollar for the Bitcoin
market. We use the data of realized volatility collected from one of the
largest Bitcoin digital trading offices in 2016 and 2017 as well as order
information. Experiments are performed to evaluate a variety of statistical and
machine learning approaches.
| stat.ML cs.LG | in this paper we study the ability to make the shortterm prediction of the exchange price fluctuations towards the united states dollar for the bitcoin market we use the data of realized volatility collected from one of the largest bitcoin digital trading offices in 2016 and 2017 as well as order information experiments are performed to evaluate a variety of statistical and machine learning approaches | [['in', 'this', 'paper', 'we', 'study', 'the', 'ability', 'to', 'make', 'the', 'shortterm', 'prediction', 'of', 'the', 'exchange', 'price', 'fluctuations', 'towards', 'the', 'united', 'states', 'dollar', 'for', 'the', 'bitcoin', 'market', 'we', 'use', 'the', 'data', 'of', 'realized', 'volatility', 'collected', 'from', 'one', 'of', 'the', 'largest', 'bitcoin', 'digital', 'trading', 'offices', 'in', '2016', 'and', '2017', 'as', 'well', 'as', 'order', 'information', 'experiments', 'are', 'performed', 'to', 'evaluate', 'a', 'variety', 'of', 'statistical', 'and', 'machine', 'learning', 'approaches']] | [-0.06496001678304031, 0.018458908882278663, -0.09222324234433472, 0.10390223332573302, -0.0795755002934199, -0.09049844910175754, 0.11719110551326034, 0.36401987792565843, -0.2776341010458194, -0.3311539405813584, 0.19248905839183583, -0.3707688889824427, -0.1264666283646455, 0.18562647294468032, -0.11546677021355069, 0.06988299998315947, 0.048084697034209964, 0.018014169656313382, 0.04146717410857001, -0.3086697683024865, 0.25738421655260024, 0.0793805089367267, 0.3593869009270118, 0.04641165766291894, 0.11981634344511594, -0.004950287730361407, -0.0709974815782446, -0.041820613165887505, -0.11191931552468584, 0.18575829443288966, 0.3335002011261307, 0.14612085111439227, 0.36059858437914116, -0.442818639255487, -0.12814324721693993, 0.1392706264096957, 0.043150691265383595, 0.08478407784042737, 0.02094033144127864, -0.3113869834118165, 0.023630971708693185, -0.2794624170431724, -0.07225176947048077, -0.13018442234740807, 0.0031197616543907386, 0.0047526288025367715, -0.2399575974792242, 0.04732262917722647, -0.008628354685452696, 0.0915099293714425, -0.011772559590351122, -0.093140185968234, -0.04058955439652961, 0.19701407755940006, 0.11036654464327372, -0.04539900679821865, 0.15017041909293485, -0.15176813764970015, -0.23970625523764352, 0.3604521273993529, -0.09571943065832154, -0.05441789432213857, 0.136791752722974, -0.10456888910669547, -0.1265812213317706, 0.022866684184051477, 0.29197201379216636, 0.02534419927172936, -0.18704808591506802, 0.0074083900634342665, -0.028906435834673734, 0.17278249296717918, 0.04080100813522362, 0.0023591387873658767, 0.1747290170393311, 0.23451900449223242, 0.036822050136442366, 0.1145223890646146, -0.1273258312856062, -0.17010566334311777, -0.23314401917159558, -0.15116681430775386, -0.2045936819165945, 0.021546376682817937, -0.04837350861769384, -0.14503421135819874, 0.4230920807530101, 0.21505067206632633, 0.1602083770200037, 0.043646902025032505, 0.29599070666501154, 0.023184243829634327, 0.03196351039939775, 0.11575242827216593, 0.20966437542094635, 0.00048140672823557485, 0.22613077986125762, -0.1626380174008843, 0.12143284276915857, -0.02587174099798386] |
1,802.04066 | Accessible bounds for general quantum resources | The recent development of general quantum resource theories has given a sound
basis for the quantification of useful quantum effects. Nevertheless, the
evaluation of a resource measure can be highly non-trivial, involving an
optimisation that is often intractable analytically or intensive numerically.
In this paper, we describe a general framework that provides quantitative lower
bounds to any resource quantifier that satisfies the essential property of
monotonicity under the corresponding set of free operations. Our framework
relies on projecting all quantum states onto a restricted subset using a fixed
resource non-increasing operation. The resources of the resultant family can
then be evaluated using a simplified optimisation, with the result providing
lower bounds on the resource contents of any state. This approach also reduces
the experimental overhead, requiring only the relevant statistics of the
restricted family of states. We illustrate the application of our framework by
focusing on the resource of multiqubit entanglement and outline applications to
other quantum resources.
| quant-ph cond-mat.stat-mech hep-th math-ph math.MP | the recent development of general quantum resource theories has given a sound basis for the quantification of useful quantum effects nevertheless the evaluation of a resource measure can be highly nontrivial involving an optimisation that is often intractable analytically or intensive numerically in this paper we describe a general framework that provides quantitative lower bounds to any resource quantifier that satisfies the essential property of monotonicity under the corresponding set of free operations our framework relies on projecting all quantum states onto a restricted subset using a fixed resource nonincreasing operation the resources of the resultant family can then be evaluated using a simplified optimisation with the result providing lower bounds on the resource contents of any state this approach also reduces the experimental overhead requiring only the relevant statistics of the restricted family of states we illustrate the application of our framework by focusing on the resource of multiqubit entanglement and outline applications to other quantum resources | [['the', 'recent', 'development', 'of', 'general', 'quantum', 'resource', 'theories', 'has', 'given', 'a', 'sound', 'basis', 'for', 'the', 'quantification', 'of', 'useful', 'quantum', 'effects', 'nevertheless', 'the', 'evaluation', 'of', 'a', 'resource', 'measure', 'can', 'be', 'highly', 'nontrivial', 'involving', 'an', 'optimisation', 'that', 'is', 'often', 'intractable', 'analytically', 'or', 'intensive', 'numerically', 'in', 'this', 'paper', 'we', 'describe', 'a', 'general', 'framework', 'that', 'provides', 'quantitative', 'lower', 'bounds', 'to', 'any', 'resource', 'quantifier', 'that', 'satisfies', 'the', 'essential', 'property', 'of', 'monotonicity', 'under', 'the', 'corresponding', 'set', 'of', 'free', 'operations', 'our', 'framework', 'relies', 'on', 'projecting', 'all', 'quantum', 'states', 'onto', 'a', 'restricted', 'subset', 'using', 'a', 'fixed', 'resource', 'nonincreasing', 'operation', 'the', 'resources', 'of', 'the', 'resultant', 'family', 'can', 'then', 'be', 'evaluated', 'using', 'a', 'simplified', 'optimisation', 'with', 'the', 'result', 'providing', 'lower', 'bounds', 'on', 'the', 'resource', 'contents', 'of', 'any', 'state', 'this', 'approach', 'also', 'reduces', 'the', 'experimental', 'overhead', 'requiring', 'only', 'the', 'relevant', 'statistics', 'of', 'the', 'restricted', 'family', 'of', 'states', 'we', 'illustrate', 'the', 'application', 'of', 'our', 'framework', 'by', 'focusing', 'on', 'the', 'resource', 'of', 'multiqubit', 'entanglement', 'and', 'outline', 'applications', 'to', 'other', 'quantum', 'resources']] | [-0.12517330613682826, 0.09792614406826862, -0.09969440751555789, 0.04736521729500964, -0.06894663085459578, -0.15535490398731414, 0.09852474265440096, 0.3178216343719064, -0.24696049321725777, -0.2872193947941348, 0.12193173762702654, -0.2000163609973933, -0.130599628457552, 0.2507558741144058, -0.07626871494694223, 0.1127637092501538, 0.08872706143633474, 0.04049939127297058, -0.06694250998877083, -0.2521256863911742, 0.31704056883802567, 0.04625543714736741, 0.32542933327959306, 0.08804227460486684, 0.07704567059850957, 0.025225903043122607, -0.0032161947242514807, 0.026083315237089285, -0.1356034710099519, 0.1878189157622371, 0.2645579852087164, 0.22425946862071375, 0.30338433912743024, -0.4420026579305907, -0.20340709403655316, 0.12989135113724543, 0.11091078732485435, 0.1275415764826857, -0.04823307282382717, -0.2806014622874039, 0.05283848610795044, -0.18780655385425338, -0.08354573597235582, -0.1457854555625044, -0.004049479607728463, -0.026357100323090164, -0.2690630291096418, 0.039617844484267535, 0.0437089444614823, 0.035779743680812985, -0.02830615026369408, -0.08326912322081625, 0.017478990202026937, 0.12864165374260583, -0.029518013747039294, 0.0015563225296997948, 0.12286535018017586, -0.1294377360881978, -0.14887854646923776, 0.3901562071545344, -0.020952676487732913, -0.2590977736524766, 0.1680513113454173, -0.06962332342341661, -0.17090394730455702, 0.07152707637228732, 0.14844916615033923, 0.13880719501183286, -0.14796904707622208, 0.12459020020073291, -0.060784755018245006, 0.17259511654559948, 0.0353117487319639, 0.11860153398254025, 0.1640106034428294, 0.16280059097629465, 0.11141416646799521, 0.2101485004543203, -0.015144919447565474, -0.13208013576532043, -0.334123424580026, -0.1792385597253525, -0.2187467102319462, 0.046639986470329894, -0.07455457975677895, -0.14742808254830586, 0.4068637738310838, 0.1383371769282613, 0.1314707874899577, 0.08704539483908234, 0.30888175125575706, 0.15529168106822216, 0.05358878758373446, 0.09018015235815716, 0.16552976006641984, 0.09111158397266807, 0.03618235716484251, -0.2194523423986769, 0.09197774235987329, 0.04247622658746152] |
1,802.04067 | Alternating Nonzero Automata | We introduce a new class of automata on infinite trees called
\emph{alternating nonzero automata}, which extends the class of
non-deterministic nonzero automata. We reduce the emptiness problem for
alternating nonzero automata to the same problem for non-deterministic ones,
which implies decidability. We obtain as a corollary algorithms for the
satisfiability of a probabilistic temporal logic extending both CTL* and the
qualitative fragment of pCTL*.
| cs.LO cs.FL | we introduce a new class of automata on infinite trees called emphalternating nonzero automata which extends the class of nondeterministic nonzero automata we reduce the emptiness problem for alternating nonzero automata to the same problem for nondeterministic ones which implies decidability we obtain as a corollary algorithms for the satisfiability of a probabilistic temporal logic extending both ctl and the qualitative fragment of pctl | [['we', 'introduce', 'a', 'new', 'class', 'of', 'automata', 'on', 'infinite', 'trees', 'called', 'emphalternating', 'nonzero', 'automata', 'which', 'extends', 'the', 'class', 'of', 'nondeterministic', 'nonzero', 'automata', 'we', 'reduce', 'the', 'emptiness', 'problem', 'for', 'alternating', 'nonzero', 'automata', 'to', 'the', 'same', 'problem', 'for', 'nondeterministic', 'ones', 'which', 'implies', 'decidability', 'we', 'obtain', 'as', 'a', 'corollary', 'algorithms', 'for', 'the', 'satisfiability', 'of', 'a', 'probabilistic', 'temporal', 'logic', 'extending', 'both', 'ctl', 'and', 'the', 'qualitative', 'fragment', 'of', 'pctl']] | [-0.12836408609291539, 0.12181857101131754, -0.016847341234097257, 0.18737499648705125, -0.1350018907978665, -0.198729335104872, 0.15318317821947858, 0.33427421923261136, -0.3546876814798452, -0.21883468369196635, 0.0717478803708218, -0.18748020777275087, -0.06488347257254645, 0.15913966508378508, -0.11049772826663684, 0.14242158347042277, 0.049260576262895484, 0.07085404096869752, -0.04838865064266429, -0.20950094754152815, 0.28979009452450555, -0.045729362274869345, 0.20729643390222918, 0.029302890616236255, 0.13589607066387543, 0.051247401257569436, 0.0038063907268224284, 0.12564928852953017, -0.0991182057550759, 0.08426079900164041, 0.3459727338049561, 0.2481200947513571, 0.2852031016082037, -0.4004346337169409, -0.16264679077721667, 0.23097845654410776, 0.11745064117349102, 0.15748298087419244, 0.018084174565956346, -0.2887335897103185, 0.10032737615256337, -0.22025703443796374, -0.039799069960281486, -0.039298741809034254, 0.04896259697852656, 0.04325101152062416, -0.22603351715952158, -0.032023495690737036, 0.24906662150169723, 0.07514764218649361, -0.06962417345494032, -0.13006686732114758, 0.04408710967982188, 0.05387257861002581, -0.08754848111129832, -0.05724117018689867, 0.02042209629144054, -0.07755016253940994, -0.2998717257723911, 0.32000830603647046, -0.05799056358227972, -0.18440483062295243, 0.15977772953920066, -0.04534181539202109, -0.2690590776037425, 0.13256929357521585, 0.126776647332008, 0.15467513199837413, -0.04863817503064638, 0.14363481855889404, -0.1886501000262797, 0.22820447673439048, 0.13705437931639608, 0.0460879022575682, 0.13133119646226987, 0.22942419621540466, 0.13429903135693166, 0.2622130031231791, 0.09007455210303306, -0.11573358721216209, -0.2623700888361782, -0.18298636592226103, -0.03735240547757712, -0.03990342589531792, -0.06417450786079826, -0.2825047820497275, 0.3989415280520916, 0.1726316273707198, 0.0950439664361511, 0.3907678497089364, 0.2569552275526803, 0.139939092199711, 0.04883736746705836, 0.04170722329581622, 0.04943117013408482, 0.20338615075161215, 0.10984672895574477, -0.2546712244366063, 0.13969070706662023, 0.22539173302720883] |
1,802.04068 | Towards an Open Science Platform for the Evaluation of Data Fusion | Combining the results of different search engines in order to improve upon
their performance has been the subject of many research papers. This has become
known as the "Data Fusion" task, and has great promise in dealing with the vast
quantity of unstructured textual data that is a feature of many Big Data
scenarios. However, no universally-accepted evaluation methodology has emerged
in the community. This makes it difficult to make meaningful comparisons
between the various proposed techniques from reading the literature alone.
Variations in the datasets, metrics, and baseline results have all contributed
to this difficulty.
This paper argues that a more unified approach is required, and that a
centralised software platform should be developed to aid researchers in making
comparisons between their algorithms and others. The desirable qualities of
such a system have been identified and proposed, and an early prototype has
been developed. Re-implementing algorithms published by other researchers is a
great burden on those proposing new techniques. The prototype system has the
potential to greatly reduce this burden and thus encourage more comparable
results being generated and published more easily.
| cs.IR | combining the results of different search engines in order to improve upon their performance has been the subject of many research papers this has become known as the data fusion task and has great promise in dealing with the vast quantity of unstructured textual data that is a feature of many big data scenarios however no universallyaccepted evaluation methodology has emerged in the community this makes it difficult to make meaningful comparisons between the various proposed techniques from reading the literature alone variations in the datasets metrics and baseline results have all contributed to this difficulty this paper argues that a more unified approach is required and that a centralised software platform should be developed to aid researchers in making comparisons between their algorithms and others the desirable qualities of such a system have been identified and proposed and an early prototype has been developed reimplementing algorithms published by other researchers is a great burden on those proposing new techniques the prototype system has the potential to greatly reduce this burden and thus encourage more comparable results being generated and published more easily | [['combining', 'the', 'results', 'of', 'different', 'search', 'engines', 'in', 'order', 'to', 'improve', 'upon', 'their', 'performance', 'has', 'been', 'the', 'subject', 'of', 'many', 'research', 'papers', 'this', 'has', 'become', 'known', 'as', 'the', 'data', 'fusion', 'task', 'and', 'has', 'great', 'promise', 'in', 'dealing', 'with', 'the', 'vast', 'quantity', 'of', 'unstructured', 'textual', 'data', 'that', 'is', 'a', 'feature', 'of', 'many', 'big', 'data', 'scenarios', 'however', 'no', 'universallyaccepted', 'evaluation', 'methodology', 'has', 'emerged', 'in', 'the', 'community', 'this', 'makes', 'it', 'difficult', 'to', 'make', 'meaningful', 'comparisons', 'between', 'the', 'various', 'proposed', 'techniques', 'from', 'reading', 'the', 'literature', 'alone', 'variations', 'in', 'the', 'datasets', 'metrics', 'and', 'baseline', 'results', 'have', 'all', 'contributed', 'to', 'this', 'difficulty', 'this', 'paper', 'argues', 'that', 'a', 'more', 'unified', 'approach', 'is', 'required', 'and', 'that', 'a', 'centralised', 'software', 'platform', 'should', 'be', 'developed', 'to', 'aid', 'researchers', 'in', 'making', 'comparisons', 'between', 'their', 'algorithms', 'and', 'others', 'the', 'desirable', 'qualities', 'of', 'such', 'a', 'system', 'have', 'been', 'identified', 'and', 'proposed', 'and', 'an', 'early', 'prototype', 'has', 'been', 'developed', 'reimplementing', 'algorithms', 'published', 'by', 'other', 'researchers', 'is', 'a', 'great', 'burden', 'on', 'those', 'proposing', 'new', 'techniques', 'the', 'prototype', 'system', 'has', 'the', 'potential', 'to', 'greatly', 'reduce', 'this', 'burden', 'and', 'thus', 'encourage', 'more', 'comparable', 'results', 'being', 'generated', 'and', 'published', 'more', 'easily']] | [-0.05919847514574503, 0.0060153697252997495, -0.10669209933305374, 0.053457586017126836, -0.1373909519618896, -0.15188739621563932, 0.037605039999932255, 0.40965712303041274, -0.20632047746126933, -0.37295858795077746, 0.11962400849392037, -0.2997371293171792, -0.15532420790382748, 0.27196395100359017, -0.11618091380020064, 0.10959624122927485, 0.1109441678991409, 0.015649662951734762, -0.042511267719861585, -0.30597842205951975, 0.27011102946510773, 0.11143610712911811, 0.34732292672934756, 0.06797274674640083, 0.0462339061071913, -0.056875913818697624, -0.10866523797075453, 0.02688715060093934, -0.06654662762502497, 0.1783263396161298, 0.31190676676730317, 0.21171734213976628, 0.35656070109212495, -0.42374510005564314, -0.2445450638894175, 0.11946736984374765, 0.15146445681066176, 0.12376539010493799, -0.08406563113178597, -0.3016624410173606, 0.10214853135339631, -0.2182950799294895, -0.06706791065246519, -0.12258345643414663, 0.03374060752414818, -0.012321342350889629, -0.2187251018492576, -0.02424427499750354, 0.041387817496052165, 0.0691655117031085, -0.014354886621990002, -0.14552645407912265, 0.035918960113032555, 0.19306288810467215, 0.09844387701427554, 0.062375243928772015, 0.07229279222404533, -0.1374884340908923, -0.14448933500053535, 0.3915710846099575, -0.003355819676605771, -0.18376615276188676, 0.26919715639834846, -0.04677121571260072, -0.16878652017146267, 0.11520634578299821, 0.16847426214960246, 0.08667290011481917, -0.2132807226261236, 0.059251781106453204, -0.00565659659380307, 0.15828451306159644, 0.021657588684300337, 0.01887495620392487, 0.18388706811225358, 0.21623136195267648, 0.028497691553142024, 0.10655656168994346, -0.04487164007484547, -0.07134947781654614, -0.15846746849517027, -0.15066907765398493, -0.16296833925155282, -0.04450935199144271, -0.028153094996779628, -0.10765978487849724, 0.36978469200335606, 0.22991877603420957, 0.14965266181166217, -0.004719112377901322, 0.3252570909839836, 0.05297108596671739, 0.1508953737647176, 0.05420113633650157, 0.2363442322124773, 0.04780674006540552, 0.16621516093794927, -0.1331675421374041, 0.11799006225907656, -0.028647120082700026] |
1,802.04069 | Searchers adjust their eye movement dynamics to the target
characteristics in natural scenes | When searching a target in a natural scene, both the target's visual
properties and similarity to the background influence whether (and how fast)
humans are able to find it. However, thus far it has been unclear whether
searchers adjust the dynamics of their eye movements (e.g., fixation durations,
saccade amplitudes) to the target they search for. In our experiment
participants searched natural scenes for six artificial targets with different
spatial frequency throughout eight consecutive sessions. High-spatial frequency
targets led to smaller saccade amplitudes and shorter fixation durations than
low-spatial frequency targets if target identity was known before the trial. If
a saccade was programmed in the same direction as the previous saccade
(saccadic momentum), fixation durations and successive saccade amplitudes were
not influenced by target type. Visual saliency and empirical density at the
endpoints of saccadic momentum saccades were comparatively low, indicating that
these saccades were less selective. Our results demonstrate that searchers
adjust their eye movement dynamics to the search target in a sensible fashion,
since low-spatial frequencies are visible farther into the periphery than
high-spatial frequencies. Additionally, the saccade direction specificity of
our effects suggests a separation of saccades into a default scanning mechanism
and a selective, target-dependent mechanism.
| q-bio.NC | when searching a target in a natural scene both the targets visual properties and similarity to the background influence whether and how fast humans are able to find it however thus far it has been unclear whether searchers adjust the dynamics of their eye movements eg fixation durations saccade amplitudes to the target they search for in our experiment participants searched natural scenes for six artificial targets with different spatial frequency throughout eight consecutive sessions highspatial frequency targets led to smaller saccade amplitudes and shorter fixation durations than lowspatial frequency targets if target identity was known before the trial if a saccade was programmed in the same direction as the previous saccade saccadic momentum fixation durations and successive saccade amplitudes were not influenced by target type visual saliency and empirical density at the endpoints of saccadic momentum saccades were comparatively low indicating that these saccades were less selective our results demonstrate that searchers adjust their eye movement dynamics to the search target in a sensible fashion since lowspatial frequencies are visible farther into the periphery than highspatial frequencies additionally the saccade direction specificity of our effects suggests a separation of saccades into a default scanning mechanism and a selective targetdependent mechanism | [['when', 'searching', 'a', 'target', 'in', 'a', 'natural', 'scene', 'both', 'the', 'targets', 'visual', 'properties', 'and', 'similarity', 'to', 'the', 'background', 'influence', 'whether', 'and', 'how', 'fast', 'humans', 'are', 'able', 'to', 'find', 'it', 'however', 'thus', 'far', 'it', 'has', 'been', 'unclear', 'whether', 'searchers', 'adjust', 'the', 'dynamics', 'of', 'their', 'eye', 'movements', 'eg', 'fixation', 'durations', 'saccade', 'amplitudes', 'to', 'the', 'target', 'they', 'search', 'for', 'in', 'our', 'experiment', 'participants', 'searched', 'natural', 'scenes', 'for', 'six', 'artificial', 'targets', 'with', 'different', 'spatial', 'frequency', 'throughout', 'eight', 'consecutive', 'sessions', 'highspatial', 'frequency', 'targets', 'led', 'to', 'smaller', 'saccade', 'amplitudes', 'and', 'shorter', 'fixation', 'durations', 'than', 'lowspatial', 'frequency', 'targets', 'if', 'target', 'identity', 'was', 'known', 'before', 'the', 'trial', 'if', 'a', 'saccade', 'was', 'programmed', 'in', 'the', 'same', 'direction', 'as', 'the', 'previous', 'saccade', 'saccadic', 'momentum', 'fixation', 'durations', 'and', 'successive', 'saccade', 'amplitudes', 'were', 'not', 'influenced', 'by', 'target', 'type', 'visual', 'saliency', 'and', 'empirical', 'density', 'at', 'the', 'endpoints', 'of', 'saccadic', 'momentum', 'saccades', 'were', 'comparatively', 'low', 'indicating', 'that', 'these', 'saccades', 'were', 'less', 'selective', 'our', 'results', 'demonstrate', 'that', 'searchers', 'adjust', 'their', 'eye', 'movement', 'dynamics', 'to', 'the', 'search', 'target', 'in', 'a', 'sensible', 'fashion', 'since', 'lowspatial', 'frequencies', 'are', 'visible', 'farther', 'into', 'the', 'periphery', 'than', 'highspatial', 'frequencies', 'additionally', 'the', 'saccade', 'direction', 'specificity', 'of', 'our', 'effects', 'suggests', 'a', 'separation', 'of', 'saccades', 'into', 'a', 'default', 'scanning', 'mechanism', 'and', 'a', 'selective', 'targetdependent', 'mechanism']] | [-0.04605946091434626, 0.18905968064168904, -0.10886457002494689, 0.1176729899858917, -0.10890734529664824, -0.18045182006934019, 0.10631133202898932, 0.516599661564056, -0.2154069357209628, -0.33916957482153465, 0.05371081533109704, -0.2431833403861493, -0.13404925998800726, 0.157197219433161, -0.08472103093384732, 0.013656572134996213, 0.09028212179601267, 0.04718423546732065, 0.0036966483455049383, -0.2314541930916594, 0.19554684322966792, 0.07956533276925411, 0.3070184801385474, -0.023470379016014623, 0.10108559835523794, -0.002294493315565349, -0.07699791310172335, -0.04578352975311564, -0.05284654328274362, 0.05107287896579289, 0.28094835790101236, 0.15231706330666217, 0.2760875155866628, -0.4378201362876157, -0.21728357682363664, 0.0680271499420734, 0.17205954586126465, 0.10067208128893257, -0.015431540406573175, -0.3369807286364077, 0.06787639955610074, -0.09069398332154668, -0.08912346350603659, -0.030140818527897364, 0.11280674841579291, 0.031514316086891335, -0.2254027941420808, 0.030278485200011092, 0.03944927125251783, 0.10404471095201943, -0.0890725839741769, -0.11045501501396743, -0.03373946453827208, 0.21565458917048, 0.07076307390967097, 0.04975355323983254, 0.18150129174554155, -0.14572681608929564, -0.11680495663805499, 0.33516987137593773, 0.003758147206714618, -0.18322442998340474, 0.22917898414906726, -0.19230934968264543, -0.10479419074537909, 0.19136811921081104, 0.16060353318618528, 0.15610366708144954, -0.16337467570053887, -0.09254674123184853, 0.031785167495961025, 0.2179235277363836, 0.16116847050844216, 0.018053684277061503, 0.23881355645737393, 0.16451173859407467, 0.02204650665392441, 0.08390393547872452, -0.19251945243212418, -0.06861185895357819, -0.19026464958726175, -0.06618385991100129, -0.10736672633990127, -0.021128519622314216, -0.06839338313994943, -0.06598972506932359, 0.40250179883259446, 0.17299618536782502, 0.22677518320339385, 0.08261993689003831, 0.3123392032375976, 0.034849784302233316, 0.10382917219661732, 0.03163300431449318, 0.2149584315467014, -0.012433718542443283, 0.13236376461086433, -0.22185742613611587, 0.14894839693254686, 0.004192703789266855] |
1,802.0407 | Compact embedded surfaces with constant mean curvature in
$\mathbb{S}^2\times\mathbb{R}$ | We obtain compact orientable embedded surfaces with constant mean curvature
$0<H<\frac{1}{2}$ and arbitrary genus in $\mathbb{S}^2\times\mathbb{R}$. These
surfaces have dihedral symmetry and desingularize a pair of spheres with mean
curvature $\frac{1}{2}$ tangent along an equator. This is a particular case of
a conjugate Plateau construction of doubly periodic surfaces with constant mean
curvature in $\mathbb{S}^2\times\mathbb{R}$, $\mathbb{H}^2\times\mathbb{R}$,
and $\mathbb{R}^3$ with bounded height and enjoying the symmetries of certain
tessellations of $\mathbb{S}^2$, $\mathbb{H}^2$, and $\mathbb{R}^2$ by regular
polygons.
| math.DG | we obtain compact orientable embedded surfaces with constant mean curvature 0hfrac12 and arbitrary genus in mathbbs2timesmathbbr these surfaces have dihedral symmetry and desingularize a pair of spheres with mean curvature frac12 tangent along an equator this is a particular case of a conjugate plateau construction of doubly periodic surfaces with constant mean curvature in mathbbs2timesmathbbr mathbbh2timesmathbbr and mathbbr3 with bounded height and enjoying the symmetries of certain tessellations of mathbbs2 mathbbh2 and mathbbr2 by regular polygons | [['we', 'obtain', 'compact', 'orientable', 'embedded', 'surfaces', 'with', 'constant', 'mean', 'curvature', '0hfrac12', 'and', 'arbitrary', 'genus', 'in', 'mathbbs2timesmathbbr', 'these', 'surfaces', 'have', 'dihedral', 'symmetry', 'and', 'desingularize', 'a', 'pair', 'of', 'spheres', 'with', 'mean', 'curvature', 'frac12', 'tangent', 'along', 'an', 'equator', 'this', 'is', 'a', 'particular', 'case', 'of', 'a', 'conjugate', 'plateau', 'construction', 'of', 'doubly', 'periodic', 'surfaces', 'with', 'constant', 'mean', 'curvature', 'in', 'mathbbs2timesmathbbr', 'mathbbh2timesmathbbr', 'and', 'mathbbr3', 'with', 'bounded', 'height', 'and', 'enjoying', 'the', 'symmetries', 'of', 'certain', 'tessellations', 'of', 'mathbbs2', 'mathbbh2', 'and', 'mathbbr2', 'by', 'regular', 'polygons']] | [-0.23396500370154777, 0.1726171885386187, -0.02910579303900401, 0.02761608348538478, -0.08494726856860021, -0.18358208874240517, -0.06339074755397936, 0.41053022603193917, -0.2447503440702955, -0.23389628166953721, 0.11588301431077222, -0.30283973067998887, -0.13882811564641695, 0.1288775661153098, -0.14579065040995678, 0.04487161656220754, 0.027846836869915327, 0.08710497377129893, -0.11487634918342034, -0.2800099232296149, 0.35414269658116004, -0.08772940963506698, 0.16568719130009413, 0.07727510920570542, 0.11928331935157378, -0.027724614491065343, 0.06879153834035, 0.0428294496362408, -0.261971435546875, 0.14969508254279693, 0.16136892961959043, -0.06560100215176741, 0.14127798083238305, -0.4062460698932409, -0.22378268586743313, 0.19020879815022151, 0.12878445830817023, -0.016515303443496426, -0.05742574303100507, -0.2857273751093696, 0.04115154369423787, -0.005845273459951083, -0.2738097207807004, -0.0239803862820069, 0.04330091871321201, 0.030888291895389556, -0.15005236530055602, 0.07380177867909272, 0.1306770526741942, 0.1537954913203915, -0.059875336761275925, -0.10901889144753417, -0.12993174080426495, 0.05930295776575804, 0.046794960446034865, 0.1311422722414136, 0.05827705566616108, -0.03453187778281669, -0.09554450005913774, 0.35820008570949236, -0.11937777222444614, -0.34536031395196914, 0.05939713904634118, -0.1965129223652184, -0.09858343950162331, 0.1986539518336455, 0.16570231132830182, 0.2146613018276791, -0.00856426871692141, 0.208946879489813, -0.05340742612878482, 0.06274273971716562, 0.18726826924830675, -0.07860332320133845, 0.18332553444119792, 0.03386887568670015, 0.18085829531463485, 0.13970210919855164, -0.08364187102143963, -0.1112120531934003, -0.36558552404244743, -0.2232498689496424, -0.12624809610346954, 0.14663537325958412, -0.1842708417204752, -0.2658865086718773, 0.3414373804628849, -0.11919286994884412, 0.2064306044050803, 0.1848942312474052, 0.19893983146583197, 0.009914861368015409, 0.029130023246010144, 0.15154636553799114, 0.13080626843885207, 0.19354906977464756, -0.05231294956523925, -0.12168655368809898, -0.08543347336972754, 0.15471725551469717] |
1,802.04071 | pyGDM -- A python toolkit for full-field electro-dynamical simulations
and evolutionary optimization of nanostructures | pyGDM is a python toolkit for electro-dynamical simulations in nano-optics
based on the Green Dyadic Method (GDM). In contrast to most other
coupled-dipole codes, pyGDM uses a generalized propagator, which allows to
cost-efficiently solve large monochromatic problems such as
polarization-resolved calculations or raster-scan simulations with a focused
beam or a quantum-emitter probe. A further peculiarity of this software is the
possibility to very easily solve 3D problems including a dielectric or metallic
substrate. Furthermore, pyGDM includes tools to easily derive several physical
quantities such as far-field patterns, extinction and scattering cross-section,
the electric and magnetic near-field in the vicinity of the structure, the
decay rate of quantum emitters and the LDOS or the heat deposited inside a
nanoparticle. Finally, pyGDM provides a toolkit for efficient evolutionary
optimization of nanoparticle geometries in order to maximize (or minimize)
optical properties such as a scattering at selected resonance wavelengths.
| physics.comp-ph cond-mat.mes-hall physics.optics | pygdm is a python toolkit for electrodynamical simulations in nanooptics based on the green dyadic method gdm in contrast to most other coupleddipole codes pygdm uses a generalized propagator which allows to costefficiently solve large monochromatic problems such as polarizationresolved calculations or rasterscan simulations with a focused beam or a quantumemitter probe a further peculiarity of this software is the possibility to very easily solve 3d problems including a dielectric or metallic substrate furthermore pygdm includes tools to easily derive several physical quantities such as farfield patterns extinction and scattering crosssection the electric and magnetic nearfield in the vicinity of the structure the decay rate of quantum emitters and the ldos or the heat deposited inside a nanoparticle finally pygdm provides a toolkit for efficient evolutionary optimization of nanoparticle geometries in order to maximize or minimize optical properties such as a scattering at selected resonance wavelengths | [['pygdm', 'is', 'a', 'python', 'toolkit', 'for', 'electrodynamical', 'simulations', 'in', 'nanooptics', 'based', 'on', 'the', 'green', 'dyadic', 'method', 'gdm', 'in', 'contrast', 'to', 'most', 'other', 'coupleddipole', 'codes', 'pygdm', 'uses', 'a', 'generalized', 'propagator', 'which', 'allows', 'to', 'costefficiently', 'solve', 'large', 'monochromatic', 'problems', 'such', 'as', 'polarizationresolved', 'calculations', 'or', 'rasterscan', 'simulations', 'with', 'a', 'focused', 'beam', 'or', 'a', 'quantumemitter', 'probe', 'a', 'further', 'peculiarity', 'of', 'this', 'software', 'is', 'the', 'possibility', 'to', 'very', 'easily', 'solve', '3d', 'problems', 'including', 'a', 'dielectric', 'or', 'metallic', 'substrate', 'furthermore', 'pygdm', 'includes', 'tools', 'to', 'easily', 'derive', 'several', 'physical', 'quantities', 'such', 'as', 'farfield', 'patterns', 'extinction', 'and', 'scattering', 'crosssection', 'the', 'electric', 'and', 'magnetic', 'nearfield', 'in', 'the', 'vicinity', 'of', 'the', 'structure', 'the', 'decay', 'rate', 'of', 'quantum', 'emitters', 'and', 'the', 'ldos', 'or', 'the', 'heat', 'deposited', 'inside', 'a', 'nanoparticle', 'finally', 'pygdm', 'provides', 'a', 'toolkit', 'for', 'efficient', 'evolutionary', 'optimization', 'of', 'nanoparticle', 'geometries', 'in', 'order', 'to', 'maximize', 'or', 'minimize', 'optical', 'properties', 'such', 'as', 'a', 'scattering', 'at', 'selected', 'resonance', 'wavelengths']] | [-0.07227372813584476, 0.0755989233770504, -0.07766283536329865, 0.06805709827578915, -0.0873216207476397, -0.1506267381350285, 0.01943341054118656, 0.4238218919984226, -0.2524910707115035, -0.3017045477983253, 0.0643937506311541, -0.2901553160784935, -0.1339389175658339, 0.23761732156773838, 0.041821421183453035, 0.0985080037256482, 0.03573701863401923, -0.03489983495132162, -0.04254060663475559, -0.1405939171789214, 0.2659023730052186, 0.06931499353256719, 0.2733701574327103, 0.09586441459069991, 0.06671167736198624, 0.03477824629958848, 0.021442854866899293, 0.01588936186042325, -0.12706577453505377, 0.10079167671019917, 0.2632751961399255, 0.06441535124201969, 0.2329562563208285, -0.4427815990137129, -0.22652191403482494, 0.043895338790426994, 0.1599960528956405, 0.14547656768178246, -0.07318708938466192, -0.2414537066979141, 0.02750981338001017, -0.1046511797234416, -0.14848728692159058, -0.055584502300440236, -0.03498268800562826, 0.039662791750040546, -0.3002060006906535, 0.01801166503272694, -0.0121551057018725, 0.049503231839756565, -0.0447425633961945, -0.08504702608775476, 0.001457819108176848, 0.07344666737260233, -0.017648341278706133, 0.021456159367868356, 0.19149025533461728, -0.11484563128203795, -0.1114358568820974, 0.3974906293996449, -0.0540440216528027, -0.17053963797295402, 0.1798173788421113, -0.11236303295048981, -0.06317376695444872, 0.16131510042810235, 0.21032345300090724, 0.15292849847163748, -0.19017425374135954, 0.0668485681963924, 0.011654911039332892, 0.19337874739912564, 0.08866635280950316, 0.06531048546834238, 0.2210837359973711, 0.18158836792512187, 0.021316876105064976, 0.1726765417594238, -0.11171273746656189, -0.04505300219331322, -0.2327230974509991, -0.1656866024473104, -0.1760760201847759, 0.06274852570435353, -0.07188041361725231, -0.2273271373986941, 0.35329714938998225, 0.12719288471893503, 0.13485514802922463, 0.005784659094883707, 0.3324808009354205, 0.07021274046795764, 0.10663912142546655, 0.061340109809655055, 0.22829376480959612, 0.15640597392539976, 0.11320342104560856, -0.24269388285947258, 0.010963270511349727, 0.02721294890125764] |
1,802.04072 | Higher structures, quantum groups, and genus zero modular operad | In my Montreal lecture notes of 1988, it was suggested that the theory of
linear quantum groups can be presented in the framework of the category of {\it
quadratic algebras} (imagined as algebras of functions on "quantum linear
spaces"), and quadratic algebras of their inner (co)homomorphisms.
Soon it was understood (E. Getzler and J. Jones, V. Ginzburg, M. Kapranov, M.
Kontsevich, M. Markl, B. Vallette et al.) that the class of {\it quadratic
operads} can be introduced and the main theorems about quadratic algebras can
be generalised to the level of such operads, if their components are {\it
linear spaces} (or objects of more general monoidal categories.)
When quantum cohomology entered the scene, it turned out that the basic tree
level (genus zero) (co)operad of quantum cohomology not only is {\it quadratic}
one, but its {\it components are themselves quadratic algebras.}
In this short note, I am studying the interaction of quadratic algebras
structure with operadic structure in the context of enriched category formalism
due to G. M. Kelly et al.
| math.CT | in my montreal lecture notes of 1988 it was suggested that the theory of linear quantum groups can be presented in the framework of the category of it quadratic algebras imagined as algebras of functions on quantum linear spaces and quadratic algebras of their inner cohomomorphisms soon it was understood e getzler and j jones v ginzburg m kapranov m kontsevich m markl b vallette et al that the class of it quadratic operads can be introduced and the main theorems about quadratic algebras can be generalised to the level of such operads if their components are it linear spaces or objects of more general monoidal categories when quantum cohomology entered the scene it turned out that the basic tree level genus zero cooperad of quantum cohomology not only is it quadratic one but its it components are themselves quadratic algebras in this short note i am studying the interaction of quadratic algebras structure with operadic structure in the context of enriched category formalism due to g m kelly et al | [['in', 'my', 'montreal', 'lecture', 'notes', 'of', '1988', 'it', 'was', 'suggested', 'that', 'the', 'theory', 'of', 'linear', 'quantum', 'groups', 'can', 'be', 'presented', 'in', 'the', 'framework', 'of', 'the', 'category', 'of', 'it', 'quadratic', 'algebras', 'imagined', 'as', 'algebras', 'of', 'functions', 'on', 'quantum', 'linear', 'spaces', 'and', 'quadratic', 'algebras', 'of', 'their', 'inner', 'cohomomorphisms', 'soon', 'it', 'was', 'understood', 'e', 'getzler', 'and', 'j', 'jones', 'v', 'ginzburg', 'm', 'kapranov', 'm', 'kontsevich', 'm', 'markl', 'b', 'vallette', 'et', 'al', 'that', 'the', 'class', 'of', 'it', 'quadratic', 'operads', 'can', 'be', 'introduced', 'and', 'the', 'main', 'theorems', 'about', 'quadratic', 'algebras', 'can', 'be', 'generalised', 'to', 'the', 'level', 'of', 'such', 'operads', 'if', 'their', 'components', 'are', 'it', 'linear', 'spaces', 'or', 'objects', 'of', 'more', 'general', 'monoidal', 'categories', 'when', 'quantum', 'cohomology', 'entered', 'the', 'scene', 'it', 'turned', 'out', 'that', 'the', 'basic', 'tree', 'level', 'genus', 'zero', 'cooperad', 'of', 'quantum', 'cohomology', 'not', 'only', 'is', 'it', 'quadratic', 'one', 'but', 'its', 'it', 'components', 'are', 'themselves', 'quadratic', 'algebras', 'in', 'this', 'short', 'note', 'i', 'am', 'studying', 'the', 'interaction', 'of', 'quadratic', 'algebras', 'structure', 'with', 'operadic', 'structure', 'in', 'the', 'context', 'of', 'enriched', 'category', 'formalism', 'due', 'to', 'g', 'm', 'kelly', 'et', 'al']] | [-0.13525825788808868, 0.1032174227511434, -0.101943487888311, 0.09991739879836116, -0.14569271094988137, -0.17032935209735706, -0.03868606189137858, 0.32656019870518593, -0.3710410290599218, -0.2877262430483399, 0.06735584739805335, -0.21183521301915859, -0.2061139923365166, 0.16682990828947006, -0.18550096129541072, -0.051960180956415546, 0.049897183679120494, 0.0542337287092113, -0.056264927631178706, -0.39278021910668987, 0.36051199892372415, 0.06775563053939251, 0.17344912091268047, -0.009667502059900796, 0.08373579298205978, 0.0327063757158293, -0.03109328983329803, 0.011992773945220032, -0.12576819183804436, 0.10523072059868088, 0.3543819459812166, 0.06971660713605278, 0.22708115122847433, -0.3511007476478205, -0.11032348255251061, 0.12015947710167159, 0.06828055322736676, 0.03594092305049121, 0.03740292026997307, -0.3130865993021786, 0.08115901260933572, -0.22944800478368127, -0.09898341519006512, -0.05520630123540323, 0.13459224687522953, -0.026906607360088902, -0.1829978174180043, 0.0031066671863459704, 0.15697242571749012, 0.10283218182443657, -0.05311307907499351, -0.13954190161817487, -0.11283801009126923, 0.06476538912995652, -0.05512295170599998, 0.04532603473077142, 0.12611922669450465, -0.07803276316426172, -0.14565921852321564, 0.34487415147585826, -0.030091176615559566, -0.15986442250949848, 0.15755743307486308, -0.14066230239753735, -0.16648202490371963, 0.07505172225701139, 0.04124790164560341, 0.16717058101026286, -0.08130055614748809, 0.22866251432283766, -0.10643845148293005, 0.042344420865090965, 0.12251663707980984, -0.0054058786056124285, 0.18875564651411267, 0.06824744921395479, -0.0019925999250405943, 0.08696750152314202, 0.04743606349240923, -0.08186358898573103, -0.31430028011336136, -0.17966810067316427, -0.11708274962413207, 0.11546682808706496, -0.04120375056268051, -0.1468055981241319, 0.3618451365275167, 0.0840428602576735, 0.14348424693885428, 0.07991001203285845, 0.19511679899933262, 0.10517890453107154, 0.11591155653750002, 0.05385380843373448, 0.1777458229723076, 0.2782367040533899, 0.057280472286415904, -0.10746420886059842, -0.012679853776132155, 0.18393083916274472] |
1,802.04073 | Blind Image Deconvolution using Deep Generative Priors | This paper proposes a novel approach to regularize the \textit{ill-posed} and
\textit{non-linear} blind image deconvolution (blind deblurring) using deep
generative networks as priors. We employ two separate generative models --- one
trained to produce sharp images while the other trained to generate blur
kernels from lower-dimensional parameters. To deblur, we propose an alternating
gradient descent scheme operating in the latent lower-dimensional space of each
of the pretrained generative models. Our experiments show promising deblurring
results on images even under large blurs, and heavy noise. To address the
shortcomings of generative models such as mode collapse, we augment our
generative priors with classical image priors and report improved performance
on complex image datasets. The deblurring performance depends on how well the
range of the generator spans the image class. Interestingly, our experiments
show that even an untrained structured (convolutional) generative networks acts
as an image prior in the image deblurring context allowing us to extend our
results to more diverse natural image datasets.
| cs.CV | this paper proposes a novel approach to regularize the textitillposed and textitnonlinear blind image deconvolution blind deblurring using deep generative networks as priors we employ two separate generative models one trained to produce sharp images while the other trained to generate blur kernels from lowerdimensional parameters to deblur we propose an alternating gradient descent scheme operating in the latent lowerdimensional space of each of the pretrained generative models our experiments show promising deblurring results on images even under large blurs and heavy noise to address the shortcomings of generative models such as mode collapse we augment our generative priors with classical image priors and report improved performance on complex image datasets the deblurring performance depends on how well the range of the generator spans the image class interestingly our experiments show that even an untrained structured convolutional generative networks acts as an image prior in the image deblurring context allowing us to extend our results to more diverse natural image datasets | [['this', 'paper', 'proposes', 'a', 'novel', 'approach', 'to', 'regularize', 'the', 'textitillposed', 'and', 'textitnonlinear', 'blind', 'image', 'deconvolution', 'blind', 'deblurring', 'using', 'deep', 'generative', 'networks', 'as', 'priors', 'we', 'employ', 'two', 'separate', 'generative', 'models', 'one', 'trained', 'to', 'produce', 'sharp', 'images', 'while', 'the', 'other', 'trained', 'to', 'generate', 'blur', 'kernels', 'from', 'lowerdimensional', 'parameters', 'to', 'deblur', 'we', 'propose', 'an', 'alternating', 'gradient', 'descent', 'scheme', 'operating', 'in', 'the', 'latent', 'lowerdimensional', 'space', 'of', 'each', 'of', 'the', 'pretrained', 'generative', 'models', 'our', 'experiments', 'show', 'promising', 'deblurring', 'results', 'on', 'images', 'even', 'under', 'large', 'blurs', 'and', 'heavy', 'noise', 'to', 'address', 'the', 'shortcomings', 'of', 'generative', 'models', 'such', 'as', 'mode', 'collapse', 'we', 'augment', 'our', 'generative', 'priors', 'with', 'classical', 'image', 'priors', 'and', 'report', 'improved', 'performance', 'on', 'complex', 'image', 'datasets', 'the', 'deblurring', 'performance', 'depends', 'on', 'how', 'well', 'the', 'range', 'of', 'the', 'generator', 'spans', 'the', 'image', 'class', 'interestingly', 'our', 'experiments', 'show', 'that', 'even', 'an', 'untrained', 'structured', 'convolutional', 'generative', 'networks', 'acts', 'as', 'an', 'image', 'prior', 'in', 'the', 'image', 'deblurring', 'context', 'allowing', 'us', 'to', 'extend', 'our', 'results', 'to', 'more', 'diverse', 'natural', 'image', 'datasets']] | [0.027773437878204278, -0.041723982440180406, -0.06336701302207075, 0.08974045569812006, -0.1399304670863785, -0.18507074156659656, -0.03523991844194825, 0.5091959817102178, -0.3044932329270523, -0.33015172319719566, 0.06468036679216312, -0.24560933677712454, -0.21046247689519076, 0.17486537218792364, -0.1986287933861604, 0.09612531721359119, 0.15443690985412104, -0.007725860437494703, -0.09924488597171148, -0.29095218803267925, 0.3182940357364714, 0.03695692895980755, 0.3669330490170978, -0.034967858922391314, 0.16083674140245421, -0.05029366420349106, -0.036251503915991634, -0.05499071266112878, -0.058186364738730845, 0.15248444344761083, 0.28868515863011907, 0.19224226790829563, 0.28548190725414313, -0.4472725330851972, -0.29258122635656036, 0.11398902842483949, 0.13700286565763237, 0.11481824352104013, -0.07845877493500666, -0.3992128450423479, 0.043479139805276644, -0.10958507418108639, 0.0582513319546706, -0.18206487588468007, -0.11405046979052713, -0.024415190952277045, -0.33884108151542025, 0.057885708344838346, 0.11218140622586362, 0.015556667267810553, -0.05426751905470155, -0.1213513643902843, 0.03939410901875817, 0.14350466981122736, 0.03227225533337332, 0.06849538618625957, 0.15473133861378302, -0.24297214853831975, -0.12513771027879556, 0.3483101222082041, -0.13418955432716756, -0.24192377302633758, 0.21212666187730064, -0.0007875573253841139, -0.15266572485270444, 0.09888974883942865, 0.2568765533680562, 0.1586395793943666, -0.14008522361400538, 0.011245692485317704, -0.07422163940500467, 0.18318248582072555, 0.044497160331229677, -0.027701736820745282, 0.15044461967045208, 0.2453671960713109, 0.04877842687419616, 0.1921834342796501, -0.22962675984745146, -0.04257881017401814, -0.20555345425527777, -0.048537816054886204, -0.21357513146122073, -0.03385382613196271, -0.1303650094513614, -0.17906285107310396, 0.4077822476880783, 0.2884085133406188, 0.26185477317048933, 0.1144453219283605, 0.3697945107589476, -0.005694153547665337, 0.13485124440630897, 0.05695775100030005, 0.14604595749697183, 0.04234456958365627, 0.09867065163707593, -0.14033022379080648, 0.028072034329215966, 0.04122610541598988] |
1,802.04074 | Nuclear emulsions for the detection of micrometric-scale fringe
patterns: an application to positron interferometry | Nuclear emulsions are capable of very high position resolution in the
detection of ionizing particles. This feature can be exploited to directly
resolve the micrometric-scale fringe pattern produced by a matter-wave
interferometer for low energy positrons (in the 10-20 keV range). We have
tested the performance of emulsion films in this specific scenario. Exploiting
silicon nitride diffraction gratings as absorption masks, we produced periodic
patterns with features comparable to the expected interferometer signal. Test
samples with periodicities of 6, 7 and 20 {\mu}m were exposed to the positron
beam, and the patterns clearly reconstructed. Our results support the
feasibility of matter-wave interferometry experiments with positrons.
| physics.ins-det hep-ex | nuclear emulsions are capable of very high position resolution in the detection of ionizing particles this feature can be exploited to directly resolve the micrometricscale fringe pattern produced by a matterwave interferometer for low energy positrons in the 1020 kev range we have tested the performance of emulsion films in this specific scenario exploiting silicon nitride diffraction gratings as absorption masks we produced periodic patterns with features comparable to the expected interferometer signal test samples with periodicities of 6 7 and 20 mum were exposed to the positron beam and the patterns clearly reconstructed our results support the feasibility of matterwave interferometry experiments with positrons | [['nuclear', 'emulsions', 'are', 'capable', 'of', 'very', 'high', 'position', 'resolution', 'in', 'the', 'detection', 'of', 'ionizing', 'particles', 'this', 'feature', 'can', 'be', 'exploited', 'to', 'directly', 'resolve', 'the', 'micrometricscale', 'fringe', 'pattern', 'produced', 'by', 'a', 'matterwave', 'interferometer', 'for', 'low', 'energy', 'positrons', 'in', 'the', '1020', 'kev', 'range', 'we', 'have', 'tested', 'the', 'performance', 'of', 'emulsion', 'films', 'in', 'this', 'specific', 'scenario', 'exploiting', 'silicon', 'nitride', 'diffraction', 'gratings', 'as', 'absorption', 'masks', 'we', 'produced', 'periodic', 'patterns', 'with', 'features', 'comparable', 'to', 'the', 'expected', 'interferometer', 'signal', 'test', 'samples', 'with', 'periodicities', 'of', '6', '7', 'and', '20', 'mum', 'were', 'exposed', 'to', 'the', 'positron', 'beam', 'and', 'the', 'patterns', 'clearly', 'reconstructed', 'our', 'results', 'support', 'the', 'feasibility', 'of', 'matterwave', 'interferometry', 'experiments', 'with', 'positrons']] | [-0.07065573846921325, 0.18910010434606542, -0.08186952129919799, 0.055456727203608565, 0.0016359166542175584, -0.12592501778495857, 0.0025066431631925157, 0.47164262215105385, -0.2200824535639885, -0.403664008105317, 0.026789724450701706, -0.3283219891510761, -0.0185581719986378, 0.20196852421996972, -0.012357017325344853, 0.09504295657657516, 0.09252461295825644, -0.09741674334285423, -0.020670009060547903, -0.21109700188613856, 0.21419698752624056, 0.16275832261621523, 0.2983572585373902, 0.057543433551193, 0.1004252504476776, -0.03807295869662015, -0.017725957450098716, -0.025098712662628923, -0.07346978276753081, 0.07072817875394741, 0.29649736911344987, 0.07051741045814616, 0.1400244007863176, -0.4572337502971865, -0.21472210064978123, 0.08772757523603594, 0.1490417275300178, 0.07638696891864619, -0.11565145881524166, -0.34156754857394844, 0.10011454386851536, -0.1186938087339513, -0.14853653525754523, -0.032652549172500864, -0.046252818536371566, 0.06467614283834476, -0.21271644693423206, 0.05222656768343698, -0.013707889395076424, 0.049023366873510756, -0.06933134168279, -0.07880286572393604, 0.04063108344248926, 0.020053304960198987, -0.020821408592522718, 0.02516425212021344, 0.2087220412280518, -0.12979011096131915, -0.13158958627676698, 0.37616562678550297, -0.07504245931228909, -0.11381745715894234, 0.18450420178795376, -0.21308498738709694, -0.04888435197958293, 0.24325393139420506, 0.1557785390625493, 0.11947157844238412, -0.11852778049293332, -0.06724826611725103, -0.020970769752658762, 0.25746549830700344, 0.19477315670407663, 0.08981792952937002, 0.254895812905698, 0.2095132157421456, -0.002794030666476689, 0.14140943172857917, -0.2707235695471844, 0.04784950185365652, -0.22297599094879564, -0.09463605670204672, -0.16056789131835103, -0.010254169610561803, -0.0697303473221277, -0.07499223599398437, 0.385149372750535, 0.13213844668322194, 0.17841772129087566, -0.04642587734941536, 0.32020615484977427, 0.029926991972248428, 0.09974814338896137, -0.0382684087425542, 0.3017856621008832, 0.13981819044308325, 0.15484521185191205, -0.2162157418564535, 0.024586357310629234, -0.06977820622649653] |
1,802.04075 | On effects of inhomogeneity on anisotropy in Backus average | In general, the Backus average of an inhomogeneous stack of isotropic layers
is a transversely isotropic medium. Herein, we examine a relation between this
inhomogeneity and the strength of resulting anisotropy, and show that, in
general, they are proportional to one another. There is an important case,
however, in which the Backus average of isotropic layers results in an
isotropic -- as opposed to a transversely isotropic -- medium. We show that it
is a consequence of the same rigidity of layers, regardless of their
compressibility. Thus, in general, the strength of anisotropy of the Backus
average increases with the degree of inhomogeneity among layers, except for the
case in which all layers exhibit the same rigidity.
| physics.geo-ph | in general the backus average of an inhomogeneous stack of isotropic layers is a transversely isotropic medium herein we examine a relation between this inhomogeneity and the strength of resulting anisotropy and show that in general they are proportional to one another there is an important case however in which the backus average of isotropic layers results in an isotropic as opposed to a transversely isotropic medium we show that it is a consequence of the same rigidity of layers regardless of their compressibility thus in general the strength of anisotropy of the backus average increases with the degree of inhomogeneity among layers except for the case in which all layers exhibit the same rigidity | [['in', 'general', 'the', 'backus', 'average', 'of', 'an', 'inhomogeneous', 'stack', 'of', 'isotropic', 'layers', 'is', 'a', 'transversely', 'isotropic', 'medium', 'herein', 'we', 'examine', 'a', 'relation', 'between', 'this', 'inhomogeneity', 'and', 'the', 'strength', 'of', 'resulting', 'anisotropy', 'and', 'show', 'that', 'in', 'general', 'they', 'are', 'proportional', 'to', 'one', 'another', 'there', 'is', 'an', 'important', 'case', 'however', 'in', 'which', 'the', 'backus', 'average', 'of', 'isotropic', 'layers', 'results', 'in', 'an', 'isotropic', 'as', 'opposed', 'to', 'a', 'transversely', 'isotropic', 'medium', 'we', 'show', 'that', 'it', 'is', 'a', 'consequence', 'of', 'the', 'same', 'rigidity', 'of', 'layers', 'regardless', 'of', 'their', 'compressibility', 'thus', 'in', 'general', 'the', 'strength', 'of', 'anisotropy', 'of', 'the', 'backus', 'average', 'increases', 'with', 'the', 'degree', 'of', 'inhomogeneity', 'among', 'layers', 'except', 'for', 'the', 'case', 'in', 'which', 'all', 'layers', 'exhibit', 'the', 'same', 'rigidity']] | [-0.14897556846718427, 0.16028678324415208, -0.024808670094479686, 0.029897442093604933, 0.0015544616212339504, -0.07277051799971124, -0.026903584907236308, 0.40829304353050566, -0.2748587605907865, -0.2732417577472718, 0.02002510343597311, -0.26981242953435236, -0.14412701540505107, 0.1560967176504757, 0.004286384007529072, -0.05022424558663498, -0.023039758685247404, 0.052789774002588316, -0.08845120654745109, -0.24902480631742788, 0.3494552275813792, 0.08859530748880427, 0.3298857525233989, 0.0679922011114009, 0.07221812946802895, 0.031056061103616073, 0.017416246615998124, 0.06896900651247605, -0.11131206980524282, 0.09369132971472066, 0.20161905230387397, -0.008342589219303235, 0.2099057884036523, -0.4097314008714064, -0.22728168618379405, 0.08519810195809797, 0.12692495891824365, 0.12413274523316194, 0.006308200590960358, -0.19609529260626954, 0.06158799354250179, -0.13525540161100924, -0.18303052918661547, 0.008477550688321176, 0.06193802242531725, 0.060606745317699794, -0.2448578316880309, 0.12532134062570074, 0.1471669589371785, 0.05194010214434694, -0.10075106492428028, -0.08936542686905063, -0.04609661429472592, 0.12732335639226697, 0.08405317392240724, 0.03578146608222438, 0.07876221051075212, -0.1777261757393084, -0.017994118263216122, 0.38861640646405843, -0.08391453790599886, -0.20249308312068814, 0.1822337846312186, -0.12728710121110728, -0.09224868989068731, 0.10059967890948705, 0.17639109927189092, 0.09279010208809506, -0.08983844403663407, 0.04187777363796435, -0.09951365583515523, 0.19879668431923442, 0.06546870226688359, 0.008458949612838256, 0.15436003909486792, 0.15310315833447258, 0.09686851482028547, 0.17937173478345833, -0.058890822813238784, -0.042710974757843044, -0.3002224811879189, -0.19565013378615612, -0.1642813886485427, 0.0731886591276397, -0.15889247559876504, -0.19886988000539335, 0.36422625361415356, 0.11528961101911314, 0.23226551381142244, 0.0057048561476656925, 0.2583899841198455, 0.0902782287640983, 0.0516072111831897, 0.12494574358038928, 0.31463966039211855, 0.17703154039285754, 0.07747218286132683, -0.15022950227088902, 0.09041963160523901, -0.0055590435214664625] |
1,802.04076 | Performance Analysis of Low Latency Multiple Full-Duplex Selective
Decode and Forward Relays | In order to follow up with mission-critical applications, new features need
to be carried to satisfy a reliable communication with reduced latency. With
this regard, this paper proposes a low latency cooperative transmission scheme,
where multiple full-duplex relays, simultaneously, assist the communication
between a source node and a destination node. First, we present the
communication model of the proposed transmission scheme. Then, we derive the
outage probability closed-form for two cases: asynchronous transmission (where
all relays have different processing delay) and synchronous transmissions
(where all relays have the same processing delay). Finally, using simulations,
we confirm the theoretical results and compare the proposed multi-relays
transmission scheme with relay selection schemes.
| cs.IT cs.PF eess.SP math.IT | in order to follow up with missioncritical applications new features need to be carried to satisfy a reliable communication with reduced latency with this regard this paper proposes a low latency cooperative transmission scheme where multiple fullduplex relays simultaneously assist the communication between a source node and a destination node first we present the communication model of the proposed transmission scheme then we derive the outage probability closedform for two cases asynchronous transmission where all relays have different processing delay and synchronous transmissions where all relays have the same processing delay finally using simulations we confirm the theoretical results and compare the proposed multirelays transmission scheme with relay selection schemes | [['in', 'order', 'to', 'follow', 'up', 'with', 'missioncritical', 'applications', 'new', 'features', 'need', 'to', 'be', 'carried', 'to', 'satisfy', 'a', 'reliable', 'communication', 'with', 'reduced', 'latency', 'with', 'this', 'regard', 'this', 'paper', 'proposes', 'a', 'low', 'latency', 'cooperative', 'transmission', 'scheme', 'where', 'multiple', 'fullduplex', 'relays', 'simultaneously', 'assist', 'the', 'communication', 'between', 'a', 'source', 'node', 'and', 'a', 'destination', 'node', 'first', 'we', 'present', 'the', 'communication', 'model', 'of', 'the', 'proposed', 'transmission', 'scheme', 'then', 'we', 'derive', 'the', 'outage', 'probability', 'closedform', 'for', 'two', 'cases', 'asynchronous', 'transmission', 'where', 'all', 'relays', 'have', 'different', 'processing', 'delay', 'and', 'synchronous', 'transmissions', 'where', 'all', 'relays', 'have', 'the', 'same', 'processing', 'delay', 'finally', 'using', 'simulations', 'we', 'confirm', 'the', 'theoretical', 'results', 'and', 'compare', 'the', 'proposed', 'multirelays', 'transmission', 'scheme', 'with', 'relay', 'selection', 'schemes']] | [-0.26858671338493945, -0.022851845589167346, -0.019031776132386758, -0.04161792580217738, -0.06340817512235168, -0.32739445608143414, 0.17666852803913655, 0.43197034292538233, -0.2713412911473098, -0.2733200687675848, 0.05844263939097216, -0.24411081141629898, -0.187249588075205, 0.11932008534909115, -0.10429975707639316, 0.09217264771957052, 0.055364751105342024, 0.04739293832024303, -0.005436235034855407, -0.30381896232314615, 0.2562104912235513, 0.11744561723920457, 0.35261623302491707, 0.022619734800190007, 0.08361739086183728, 0.018705644187679806, -0.036211079858038404, -0.06804541509198049, -0.11580586105525288, 0.07307298051475317, 0.3576894862526054, 0.17599105745246377, 0.26147363076003594, -0.45533052510624633, -0.290014954651236, 0.09238844251883892, 0.18978842647763294, 0.09213386664814273, -0.05406871689227196, -0.2556016658595122, 0.15554566390026325, -0.27566476011197, -0.010202432478513193, 0.002865552150328225, -0.09649613184786034, 0.11159480676277105, -0.3374742797806586, -0.009133914002823994, -0.08370875975185442, 0.03410978526423831, -0.04480964386271774, -0.035070232011018956, 0.04992436276697511, 0.20628737560110252, 0.0074381813943095575, -0.04377505242175192, 0.028526462482100508, -0.03391227437559208, -0.1647609824511231, 0.36915956119741866, 0.022054755633564477, -0.19962139097854084, 0.16059423525018807, -0.06164175607349484, -0.1514599750399453, 0.13912561774006063, 0.2577911774294639, 0.06110906041731391, -0.2021819786809453, -0.024748074906769234, 0.03641622586799529, 0.15213316168055074, 0.11346790635394394, 0.1253063790884655, 0.11475155016069873, 0.17587013534962312, 0.13218762041090928, 0.11335163470037248, -0.1436229751129216, -0.10010722828729915, -0.267887622285143, -0.1414065702322768, -0.1672314675738437, -0.01312110826817401, -0.11084884288894342, -0.02159732794645456, 0.3410927621499059, 0.1884336498605489, 0.14235929986825127, 0.16612454845544394, 0.45572363841561003, 0.1448867569438293, 0.02923869478319763, 0.1935893296511895, 0.1798492883665299, 0.08443121321781308, 0.13353023628507732, -0.2338791191593932, 0.06460919425557923, -0.03135137811491112] |
1,802.04077 | Compact operators on the sets of fractional difference sequences | Fractional difference sequence spaces have been studied in the literature
recently. In this work, some identities or estimates for the operator norms and
the Hausdorff measures of noncompactness of certain operators on some
difference sequence spaces of fractional orders are established. Some classes
of compact operators on those spaces are characterized. The results of this
work are more general and comprehensive then many other studies in literature.
| math.FA | fractional difference sequence spaces have been studied in the literature recently in this work some identities or estimates for the operator norms and the hausdorff measures of noncompactness of certain operators on some difference sequence spaces of fractional orders are established some classes of compact operators on those spaces are characterized the results of this work are more general and comprehensive then many other studies in literature | [['fractional', 'difference', 'sequence', 'spaces', 'have', 'been', 'studied', 'in', 'the', 'literature', 'recently', 'in', 'this', 'work', 'some', 'identities', 'or', 'estimates', 'for', 'the', 'operator', 'norms', 'and', 'the', 'hausdorff', 'measures', 'of', 'noncompactness', 'of', 'certain', 'operators', 'on', 'some', 'difference', 'sequence', 'spaces', 'of', 'fractional', 'orders', 'are', 'established', 'some', 'classes', 'of', 'compact', 'operators', 'on', 'those', 'spaces', 'are', 'characterized', 'the', 'results', 'of', 'this', 'work', 'are', 'more', 'general', 'and', 'comprehensive', 'then', 'many', 'other', 'studies', 'in', 'literature']] | [-0.11355421240893263, 0.10162098848247039, -0.05226960279214293, 0.15731511842945953, -0.06612551332548705, -0.038212760490601634, -0.02244199808242161, 0.4123418241489067, -0.25782774251176793, -0.25466043756468526, 0.20258629062289454, -0.3344684454487331, -0.14822118152836478, 0.2683219630236445, -0.14176485540150707, 0.08560864617283553, 0.017131086244289554, 0.04860496946346404, -0.1531308700483459, -0.2940050020202327, 0.46950027263209, -0.0885984369817732, 0.22495974322308354, 0.032790300012357644, 0.012467417587984853, -0.10570781561893536, -0.13182186475718644, 0.030828306437539522, -0.18036123126078007, 0.19247710821566297, 0.23895982019047238, 0.06872715306496109, 0.32229936317499003, -0.37621891431844057, -0.24044752709998457, 0.18467241741105248, 0.11121662754092866, 0.02037235334126362, -0.05321992148489712, -0.32776742568934586, 0.07586863585886781, -0.13697814043096976, -0.0883357592149457, -0.11631240367666999, 0.06056299341369921, 0.08595344332505518, -0.24103164411525227, 0.03438282343767472, 0.09270114482227546, 0.0883314881335645, -0.1161622649281105, -0.1784901424126922, 0.01912648543548673, 0.13305526715703309, 0.07256391839082561, 0.012617386113018242, 0.04215718630645702, -0.06717703642268012, -0.17108130452237022, 0.3033822021905833, -0.0009354565348198165, -0.26504286656628795, 0.18918748983918732, -0.21069806237329744, -0.21416256015897908, 0.05190708741212069, 0.1220306969150456, 0.18279668859748252, -0.1684436649362098, 0.10819748736077002, -0.09600285651968486, 0.0427680982471402, 0.1060980503002543, 0.17927231239033306, 0.059755140053692146, 0.1037853077026223, 0.10188131266770495, 0.0930711693007068, 0.04586285657819305, -0.11125889362909817, -0.284980843761074, -0.1484702724073805, -0.15910804036782303, -0.011882874155556089, -0.09292385851531706, -0.14916942650869267, 0.36712697543092626, 0.09510957958426938, 0.164263857598069, 0.07709687381093182, 0.22307175653639125, 0.15197067687969043, 0.048275304228456606, 0.012587922402838273, 0.1879406887408061, 0.16431830840101883, 0.09126379062880331, -0.10396048912444888, 0.0403582705462824, 0.1609247406221815] |
1,802.04078 | A concept of biopharmaceutical nanosatellite | The article is a short overview of a proposal of a CubeSat type nanosatellite
designed to conduct biopharmaceutical tests on the low earth orbit. Motivations
behind the emerging demand for such solution nowadays and in the close future
are emphasized. The possible objectives and challenges to be addressed in the
planned biopharmaceutical CubeSat missions are discussed. In particular, it is
hard to imagine progress of the space tourism and colonization of Mars without
a wide-ranging development of pharmaceutics dedicated to be used in space.
Finally, an exemplary layout of a 3U type CubeSat is presented. We stress that,
thanks to recent development in both nanosatellite technologies and
lab-on-a-chip type biofluidic systems the proposed idea becomes now both
feasible and relatively affordable.
| physics.bio-ph physics.space-ph | the article is a short overview of a proposal of a cubesat type nanosatellite designed to conduct biopharmaceutical tests on the low earth orbit motivations behind the emerging demand for such solution nowadays and in the close future are emphasized the possible objectives and challenges to be addressed in the planned biopharmaceutical cubesat missions are discussed in particular it is hard to imagine progress of the space tourism and colonization of mars without a wideranging development of pharmaceutics dedicated to be used in space finally an exemplary layout of a 3u type cubesat is presented we stress that thanks to recent development in both nanosatellite technologies and labonachip type biofluidic systems the proposed idea becomes now both feasible and relatively affordable | [['the', 'article', 'is', 'a', 'short', 'overview', 'of', 'a', 'proposal', 'of', 'a', 'cubesat', 'type', 'nanosatellite', 'designed', 'to', 'conduct', 'biopharmaceutical', 'tests', 'on', 'the', 'low', 'earth', 'orbit', 'motivations', 'behind', 'the', 'emerging', 'demand', 'for', 'such', 'solution', 'nowadays', 'and', 'in', 'the', 'close', 'future', 'are', 'emphasized', 'the', 'possible', 'objectives', 'and', 'challenges', 'to', 'be', 'addressed', 'in', 'the', 'planned', 'biopharmaceutical', 'cubesat', 'missions', 'are', 'discussed', 'in', 'particular', 'it', 'is', 'hard', 'to', 'imagine', 'progress', 'of', 'the', 'space', 'tourism', 'and', 'colonization', 'of', 'mars', 'without', 'a', 'wideranging', 'development', 'of', 'pharmaceutics', 'dedicated', 'to', 'be', 'used', 'in', 'space', 'finally', 'an', 'exemplary', 'layout', 'of', 'a', '3u', 'type', 'cubesat', 'is', 'presented', 'we', 'stress', 'that', 'thanks', 'to', 'recent', 'development', 'in', 'both', 'nanosatellite', 'technologies', 'and', 'labonachip', 'type', 'biofluidic', 'systems', 'the', 'proposed', 'idea', 'becomes', 'now', 'both', 'feasible', 'and', 'relatively', 'affordable']] | [-0.11541579648813544, 0.1089692706757584, -0.041261912531141816, 0.06482337377868437, -0.11054300264028522, -0.12683691915978368, -0.0016155397907520333, 0.37597810983036956, -0.2135569652193226, -0.2963413911444756, 0.20354944716576331, -0.2477386511551837, -0.16253031634259968, 0.27511808938967686, -0.12471502085487979, 0.08389925428200513, 0.08204855453320002, -0.014656258203710118, -0.029069772050812997, -0.24067677729181014, 0.24503725489291053, 0.11681838021613658, 0.27034954861737787, 0.06406423560110852, 0.09916127458175955, -0.025889199378646786, -0.053194440881876894, 0.0028017238291795366, -0.11674865875981293, 0.1542707537832636, 0.3115703942719847, 0.1903351190073105, 0.32018829279889666, -0.46201256244288136, -0.1713513762127453, 0.06583595429741157, 0.09863135099876671, 0.02885303501583015, -0.1088108458527131, -0.2879837597021833, 0.04544741517699246, -0.2208960078113402, -0.1958619594030703, -0.059378726109086226, 0.05104232238057496, 0.01569672890085106, -0.21492780044209212, -0.08381107865910356, -0.008648037437039117, 0.04018569337980201, -0.06426203224885588, -0.08358847122290172, 0.05048611756258955, 0.13022704552471018, 0.051263323839521036, 0.05360231935046613, 0.10035843909330046, -0.12301191029061252, -0.10215642501134425, 0.4186047764495015, -0.009376576442931158, -0.13167978168348782, 0.2194731599302031, -0.11995358534816963, -0.1514671296424543, 0.08091786288035413, 0.19886895481031389, 0.10970015492445478, -0.17607106907526032, 0.07173335188975519, 0.06483512093545869, 0.13571487114143868, 0.010798492785155153, 0.042986449288825196, 0.25896860195789484, 0.28174237498509075, 0.08692268865076282, 0.09365195075709683, -0.10272481640762028, -0.06813788730699646, -0.2761617684077161, -0.19587055750501653, -0.1665073591400869, 0.005485645964896927, 0.026607201955266647, -0.10323560234780113, 0.336384320189245, 0.17431334719682734, 0.11930297020977984, -0.03866120095093114, 0.3295227913806836, -0.007805975223891437, 0.07419948093981171, 0.04130777675503244, 0.26638775531513, 0.05646057703919117, 0.17169732929905876, -0.15268220517706746, 0.042876260581154686, 0.00025502423328968387] |
1,802.04079 | Accelerated Stochastic Matrix Inversion: General Theory and Speeding up
BFGS Rules for Faster Second-Order Optimization | We present the first accelerated randomized algorithm for solving linear
systems in Euclidean spaces. One essential problem of this type is the matrix
inversion problem. In particular, our algorithm can be specialized to invert
positive definite matrices in such a way that all iterates (approximate
solutions) generated by the algorithm are positive definite matrices
themselves. This opens the way for many applications in the field of
optimization and machine learning. As an application of our general theory, we
develop the {\em first accelerated (deterministic and stochastic) quasi-Newton
updates}. Our updates lead to provably more aggressive approximations of the
inverse Hessian, and lead to speed-ups over classical non-accelerated rules in
numerical experiments. Experiments with empirical risk minimization show that
our rules can accelerate training of machine learning models.
| math.OC cs.NA | we present the first accelerated randomized algorithm for solving linear systems in euclidean spaces one essential problem of this type is the matrix inversion problem in particular our algorithm can be specialized to invert positive definite matrices in such a way that all iterates approximate solutions generated by the algorithm are positive definite matrices themselves this opens the way for many applications in the field of optimization and machine learning as an application of our general theory we develop the em first accelerated deterministic and stochastic quasinewton updates our updates lead to provably more aggressive approximations of the inverse hessian and lead to speedups over classical nonaccelerated rules in numerical experiments experiments with empirical risk minimization show that our rules can accelerate training of machine learning models | [['we', 'present', 'the', 'first', 'accelerated', 'randomized', 'algorithm', 'for', 'solving', 'linear', 'systems', 'in', 'euclidean', 'spaces', 'one', 'essential', 'problem', 'of', 'this', 'type', 'is', 'the', 'matrix', 'inversion', 'problem', 'in', 'particular', 'our', 'algorithm', 'can', 'be', 'specialized', 'to', 'invert', 'positive', 'definite', 'matrices', 'in', 'such', 'a', 'way', 'that', 'all', 'iterates', 'approximate', 'solutions', 'generated', 'by', 'the', 'algorithm', 'are', 'positive', 'definite', 'matrices', 'themselves', 'this', 'opens', 'the', 'way', 'for', 'many', 'applications', 'in', 'the', 'field', 'of', 'optimization', 'and', 'machine', 'learning', 'as', 'an', 'application', 'of', 'our', 'general', 'theory', 'we', 'develop', 'the', 'em', 'first', 'accelerated', 'deterministic', 'and', 'stochastic', 'quasinewton', 'updates', 'our', 'updates', 'lead', 'to', 'provably', 'more', 'aggressive', 'approximations', 'of', 'the', 'inverse', 'hessian', 'and', 'lead', 'to', 'speedups', 'over', 'classical', 'nonaccelerated', 'rules', 'in', 'numerical', 'experiments', 'experiments', 'with', 'empirical', 'risk', 'minimization', 'show', 'that', 'our', 'rules', 'can', 'accelerate', 'training', 'of', 'machine', 'learning', 'models']] | [-0.05946952123543262, 0.04004608601156171, -0.09253577215553034, 0.09299822759128902, -0.10380241277766979, -0.1570773787877163, 0.04155885096819059, 0.41918431933030603, -0.3475199662383616, -0.2742609783116083, 0.10670184756548504, -0.23514324942911705, -0.22617493887105591, 0.22496269349976789, -0.06703320453236775, 0.12737594429572208, 0.09884509521235865, -0.003967200603893423, -0.12929002917555021, -0.3105804154458712, 0.27390852430468704, 0.0392699661466667, 0.2363158674419337, -0.014634037001689118, 0.1213339602897369, -0.01353588613028836, -0.0019726812890840796, 0.014892195899582168, -0.027718832395859906, 0.17620165335696455, 0.3240796661266645, 0.2288692313334428, 0.3623446397278018, -0.44272916947352137, -0.16356581555199112, 0.18301780205119153, 0.1754129102605296, 0.1440912163303065, -0.1028308284045683, -0.25014651409079003, 0.09197263999688109, -0.13501690114356987, -0.07748795037366832, -0.1820991218005725, -0.057848305414856124, 0.036479111638939465, -0.3418505871155131, 0.05767101926296422, 0.07115085309694015, 0.004584910898051393, -0.06890112801828957, -0.15189701232116845, 0.12239938546852099, 0.06928465708606238, 0.05519160512270127, 0.032620745727528384, 0.10893491543022783, -0.0783615939238468, -0.195551749993497, 0.3328772574281833, -0.04414588999824496, -0.22501677917096558, 0.1542555371768714, -0.03750437110255465, -0.1371314828944077, 0.12966091492337975, 0.2356995635841951, 0.16759028012211633, -0.12329279023083294, 0.1047570406533521, -0.053942913702857774, 0.10610466937288847, 0.019922514339747625, -0.06286349945186498, 0.10991576806400118, 0.12481204240480218, 0.14430857972584768, 0.12478661391009599, 0.013391211700413054, -0.14314517602677398, -0.2883768914135422, -0.17057249707345828, -0.1801905001442161, 0.03108377757988225, -0.15582609072148407, -0.18731579778525304, 0.368010938490235, 0.20352454140267195, 0.18545484987562375, 0.11745448688991134, 0.31611079926507213, 0.12060794038753077, 0.05250119483905045, 0.14320130579129564, 0.19692189302148783, 0.1058040873833206, 0.10842693352789479, -0.22281161249490586, 0.07325231231837057, 0.09948932905278103] |
1,802.0408 | Seeding of the Self-Modulation in a Long Proton Bunch by Charge
Cancellation with a Short Electron Bunch | In plasma wakefield accelerators (e.g. AWAKE) the proton bunch
self-modulation is seeded by the ionization front of a high-power laser pulse
ionizing a vapour and by the resulting steep edge of the driving bunch profile
inside the created plasma. In this paper, we present calculations in 2D linear
theory for a concept of a different self-modulation seeding mechanism based on
electron injection. The whole proton bunch propagates through a preformed
plasma and the effective beam current is modulated by the external injection of
a short electron bunch at the centre of the proton beam. The resulting sharp
edge in the effective beam current in the trailing part of the proton bunch is
driving large wakefields that can lead to a growth of the seeded
self-modulation (SSM). Furthermore, we discuss the feasibility for applications
in AWAKE Run 2.
| physics.plasm-ph physics.acc-ph | in plasma wakefield accelerators eg awake the proton bunch selfmodulation is seeded by the ionization front of a highpower laser pulse ionizing a vapour and by the resulting steep edge of the driving bunch profile inside the created plasma in this paper we present calculations in 2d linear theory for a concept of a different selfmodulation seeding mechanism based on electron injection the whole proton bunch propagates through a preformed plasma and the effective beam current is modulated by the external injection of a short electron bunch at the centre of the proton beam the resulting sharp edge in the effective beam current in the trailing part of the proton bunch is driving large wakefields that can lead to a growth of the seeded selfmodulation ssm furthermore we discuss the feasibility for applications in awake run 2 | [['in', 'plasma', 'wakefield', 'accelerators', 'eg', 'awake', 'the', 'proton', 'bunch', 'selfmodulation', 'is', 'seeded', 'by', 'the', 'ionization', 'front', 'of', 'a', 'highpower', 'laser', 'pulse', 'ionizing', 'a', 'vapour', 'and', 'by', 'the', 'resulting', 'steep', 'edge', 'of', 'the', 'driving', 'bunch', 'profile', 'inside', 'the', 'created', 'plasma', 'in', 'this', 'paper', 'we', 'present', 'calculations', 'in', '2d', 'linear', 'theory', 'for', 'a', 'concept', 'of', 'a', 'different', 'selfmodulation', 'seeding', 'mechanism', 'based', 'on', 'electron', 'injection', 'the', 'whole', 'proton', 'bunch', 'propagates', 'through', 'a', 'preformed', 'plasma', 'and', 'the', 'effective', 'beam', 'current', 'is', 'modulated', 'by', 'the', 'external', 'injection', 'of', 'a', 'short', 'electron', 'bunch', 'at', 'the', 'centre', 'of', 'the', 'proton', 'beam', 'the', 'resulting', 'sharp', 'edge', 'in', 'the', 'effective', 'beam', 'current', 'in', 'the', 'trailing', 'part', 'of', 'the', 'proton', 'bunch', 'is', 'driving', 'large', 'wakefields', 'that', 'can', 'lead', 'to', 'a', 'growth', 'of', 'the', 'seeded', 'selfmodulation', 'ssm', 'furthermore', 'we', 'discuss', 'the', 'feasibility', 'for', 'applications', 'in', 'awake', 'run', '2']] | [-0.0997863415812217, 0.28590961910417156, -0.07260966011200672, 0.06926897369549494, 0.04056502779415489, -0.10814229363446416, -0.0216643705532417, 0.4124798661430985, -0.22556975667184748, -0.2805849756624033, 0.029939325521258216, -0.23430529795077215, 0.026838406040095283, 0.21669641722938604, 0.011550296264544239, 0.06727537652817521, 0.050944593748635185, -0.046524058646746795, 0.007382682924852265, -0.12399071678995108, 0.28845030338890904, 0.17409244047165134, 0.3168960745500768, 0.11065662057431293, 0.11609079617238774, 0.024883480735775763, 0.029716012999415398, -0.05402163730213677, -0.10124922292021292, 0.08199766391453191, 0.18005006111831995, 0.080303888206275, 0.2954893310207629, -0.5480104157170893, -0.23331938278147557, -0.006340464012846894, 0.17410134657549103, 0.15382982075323154, -0.1562590038677487, -0.205693745761294, 0.06176062397332522, -0.2073729876088944, -0.19217988812317052, 0.0779682610950426, -0.0006862442301463907, 0.11633793331629998, -0.2956474541965192, 0.016506029131064314, 0.02636358024973939, -0.010192892135660093, -0.014751847303152954, -0.023185344370435516, 0.0008155443692022432, 0.01535752612628369, 0.05671181599269655, 0.12924192428510692, 0.269114471893812, -0.17206885508451963, -0.07604955848693902, 0.33385984387493484, -0.04637804718511383, -0.08520155992821185, 0.1222514217926774, -0.22016894064476564, -0.007767596008446421, 0.19236505792958894, 0.18779666388890007, 0.06541606384995699, -0.09699742727144792, 0.0027848937621775226, 0.000132114476911778, 0.17460728471548073, 0.18633470525897114, -0.027455382886934127, 0.22446296752913156, 0.2387304977704193, 0.06291836353841435, 0.1530659994124061, -0.1608240649127327, 0.02400644821706262, -0.33314950411364325, -0.07760901612494767, -0.13159715026841384, 0.018974631854868747, -0.018293083974892734, -0.15089204208245569, 0.5242643489801482, 0.1298229618772973, 0.12569129147845573, -0.09302935501846084, 0.3543143100954973, 0.1332121427497235, 0.01656915884750494, 0.07241149100876093, 0.2401964785803082, 0.09960888570725211, 0.15866006605571856, -0.277195524019835, 0.029236784860845248, 0.03829719426695013] |
1,802.04081 | Characterizations of Compact Operators on $\ell_{p}$ Type Fractional
Sets of Sequences | Among the sets of sequences studied, difference sets of sequences are
probably the most common type of sets. This paper considers some $\ell_{p}$
type fractional difference sequence spaces via Euler gamma function. Although
we characterize compactness conditions on those spaces using the main tools of
Hausdorff measure of noncompactness, we can only obtain sufficient conditions
when the final space is $\ell _{\infty }$. However, we use some recent results
to exactly characterize the classes of compact matrix operators when the final
space is the set of bounded sequences.
| math.FA | among the sets of sequences studied difference sets of sequences are probably the most common type of sets this paper considers some ell_p type fractional difference sequence spaces via euler gamma function although we characterize compactness conditions on those spaces using the main tools of hausdorff measure of noncompactness we can only obtain sufficient conditions when the final space is ell _infty however we use some recent results to exactly characterize the classes of compact matrix operators when the final space is the set of bounded sequences | [['among', 'the', 'sets', 'of', 'sequences', 'studied', 'difference', 'sets', 'of', 'sequences', 'are', 'probably', 'the', 'most', 'common', 'type', 'of', 'sets', 'this', 'paper', 'considers', 'some', 'ell_p', 'type', 'fractional', 'difference', 'sequence', 'spaces', 'via', 'euler', 'gamma', 'function', 'although', 'we', 'characterize', 'compactness', 'conditions', 'on', 'those', 'spaces', 'using', 'the', 'main', 'tools', 'of', 'hausdorff', 'measure', 'of', 'noncompactness', 'we', 'can', 'only', 'obtain', 'sufficient', 'conditions', 'when', 'the', 'final', 'space', 'is', 'ell', '_infty', 'however', 'we', 'use', 'some', 'recent', 'results', 'to', 'exactly', 'characterize', 'the', 'classes', 'of', 'compact', 'matrix', 'operators', 'when', 'the', 'final', 'space', 'is', 'the', 'set', 'of', 'bounded', 'sequences']] | [-0.13503945535369988, 0.1061349319369029, -0.03833795071247666, 0.16104293995852656, -0.05521198458188138, -0.05201720355892147, 0.013931782198962808, 0.36819876306529703, -0.32895578813990684, -0.21983684816172924, 0.15349973337831854, -0.2739184791430959, -0.12171698031925607, 0.22978738823841358, -0.14778417931205926, 0.04272059896350678, 0.09648523790140946, 0.061883437736281036, -0.11202239716725274, -0.28301457253862816, 0.47620947701835087, -0.09279058249560239, 0.21674704356868377, -0.00703676604804979, 0.0758846169658776, -0.02168302566626634, -0.06267036952816978, 0.004505979241776526, -0.20010813785417156, 0.13919981569319365, 0.2195339686392496, 0.16184926328474078, 0.28577997663925436, -0.33568790032603274, -0.163231388569392, 0.24503001987655787, 0.11008832820466366, 0.034045747791727386, 0.021163726814262485, -0.27373754046857357, 0.14379450249025363, -0.06855238645856708, -0.11143182618436458, -0.09280602762679002, 0.0504626684832847, 0.08503101579175898, -0.29967179851627895, 0.0114813643914444, 0.06941302447718964, 0.02931790777927682, -0.09298477050227423, -0.15348787254643168, -0.005400901282976927, 0.13662899063228384, 0.025956769666538156, 0.03226560380994931, 0.0639246170537482, -0.04273521076170621, -0.10096460785288577, 0.3458373561801239, -0.031303812661368786, -0.2421710317226491, 0.2147580967445312, -0.21108190200409327, -0.16169749989827303, 0.10398875878074731, 0.12190725706817432, 0.14288451031235785, -0.15009430775200766, 0.128332421531494, -0.06565132009229441, 0.14204619701780463, 0.11671668734808249, 0.11292146949696986, 0.08895946902105178, 0.1315675372787719, 0.11618243290603845, 0.15406613131910135, -0.032474366185287463, -0.016637406048322118, -0.34443528225495557, -0.13633452100015578, -0.20028336669971375, 0.028789504977135824, -0.10995692760822759, -0.1792196417548533, 0.34400493532804577, 0.06464362006912801, 0.18186657560518246, 0.09568465545227559, 0.236894053888732, 0.09311496255863806, -0.00929129879450661, 0.05111424799409063, 0.13456138025704323, 0.16389953058437798, 0.03167835305626879, -0.14804556932107643, 0.061441378267856596, 0.18309353369648768] |
1,802.04082 | Towards self-adaptable robots: from programming to training machines | We argue that hardware modularity plays a key role in the convergence of
Robotics and Artificial Intelligence (AI). We introduce a new approach for
building robots that leads to more adaptable and capable machines. We present
the concept of a self-adaptable robot that makes use of hardware modularity and
AI techniques to reduce the effort and time required to be built. We
demonstrate in simulation and with a real robot how, rather than programming,
training produces behaviors in the robot that generalize fast and produce
robust outputs in the presence of noise. In particular, we advocate for
mammals.
| cs.RO | we argue that hardware modularity plays a key role in the convergence of robotics and artificial intelligence ai we introduce a new approach for building robots that leads to more adaptable and capable machines we present the concept of a selfadaptable robot that makes use of hardware modularity and ai techniques to reduce the effort and time required to be built we demonstrate in simulation and with a real robot how rather than programming training produces behaviors in the robot that generalize fast and produce robust outputs in the presence of noise in particular we advocate for mammals | [['we', 'argue', 'that', 'hardware', 'modularity', 'plays', 'a', 'key', 'role', 'in', 'the', 'convergence', 'of', 'robotics', 'and', 'artificial', 'intelligence', 'ai', 'we', 'introduce', 'a', 'new', 'approach', 'for', 'building', 'robots', 'that', 'leads', 'to', 'more', 'adaptable', 'and', 'capable', 'machines', 'we', 'present', 'the', 'concept', 'of', 'a', 'selfadaptable', 'robot', 'that', 'makes', 'use', 'of', 'hardware', 'modularity', 'and', 'ai', 'techniques', 'to', 'reduce', 'the', 'effort', 'and', 'time', 'required', 'to', 'be', 'built', 'we', 'demonstrate', 'in', 'simulation', 'and', 'with', 'a', 'real', 'robot', 'how', 'rather', 'than', 'programming', 'training', 'produces', 'behaviors', 'in', 'the', 'robot', 'that', 'generalize', 'fast', 'and', 'produce', 'robust', 'outputs', 'in', 'the', 'presence', 'of', 'noise', 'in', 'particular', 'we', 'advocate', 'for', 'mammals']] | [-0.10615171829822986, 0.07323921297923947, -0.10499500386340886, 0.04691494141743347, -0.1244320768805943, -0.16537207793159298, 0.02074712578668164, 0.4137183889290508, -0.21390929713617174, -0.34298144345532877, 0.05205696950457534, -0.17792908683400221, -0.2844733299535452, 0.24026223719690223, -0.15273462779991023, 0.05772720763877946, 0.10408180284941075, -0.0015252644376715226, -0.0032281440894157453, -0.23868831051561068, 0.300857961310872, 0.04472901632686203, 0.2592355265396134, 0.017804084081982016, 0.1261112666118662, 0.01394896953110108, 0.020697935234888325, -0.007910450711390194, -0.061286413284524686, 0.19664863409588532, 0.3155561693069734, 0.24134066227671444, 0.3463150344560949, -0.48244713326650007, -0.15342923181549628, 0.11363662574297692, 0.13034536411073439, 0.09394180080710854, -0.06660009039953774, -0.26561639378113405, 0.11075301577660199, -0.17587994933318424, -0.13142388430186452, -0.17541993948350643, 0.013525766802818648, -0.010141892887875247, -0.2675167427740383, -0.020517242947659855, 0.06377255629596053, 0.08610976852324544, -0.036191360003371933, -0.0778070982897236, 0.05850594006098655, 0.15829995357222398, 0.011005149508009151, 0.029073564150389666, 0.1764736939269137, -0.16091273693434363, -0.1705546785402587, 0.3918622952068643, -0.010719134404154123, -0.22324580445705094, 0.23461605697794227, -0.045191953495639016, -0.17191252574723745, 0.06802567594437575, 0.2503965662896861, 0.07067381066498252, -0.1198752103658507, 0.03420541911713817, 0.03432395266445012, 0.18461908099279567, 0.014371038241102835, -0.008065663829293787, 0.15872671249873785, 0.24708625862175332, 0.12171727151857042, 0.17171382257710116, -0.06505500940767554, -0.10082242453271258, -0.21761090688084309, -0.18271808819465188, -0.15504665209493618, -0.002557440599122522, -0.05139058823988307, -0.13607124474887944, 0.37024116422030695, 0.30620260336151234, 0.16715685070055175, 0.13654232653789222, 0.3356617869220066, 0.04627782032273862, 0.12029737852779883, 0.10396942382260245, 0.19314977777195258, 0.015799813922874783, 0.17195231657076096, -0.21046489296001097, 0.10133942904910642, -0.012307048580438202] |
1,802.04083 | On parameterised toric codes | Let $X$ be a complete simplicial toric variety over a finite field with a
split torus $T_X$. For any matrix $Q$, we are interested in the subgroup $Y_Q$
of $T_X$ parameterized by the columns of $Q$. We give an algorithm for
obtaining a basis for the unique lattice $L$ whose lattice ideal $I_L$ is
$I(Y_Q)$. We also give two direct algorithmic methods to compute the order of
$Y_Q$, which is the length of the corresponding code ${\cC}_{\aa,Y_Q}$. We
share procedures implementing them in \verb|Macaulay2|. Finally, we give a
lower bound for the minimum distance of ${\cC}_{\aa,Y_Q}$, taking advantage of
the parametric description of the subgroup $Y_Q$. As an application, we compute
the main parameters of the toric codes on Hirzebruch surfaces $\cl H_{\ell}$
generalizing the corresponding result given by Hansen.
| math.AG | let x be a complete simplicial toric variety over a finite field with a split torus t_x for any matrix q we are interested in the subgroup y_q of t_x parameterized by the columns of q we give an algorithm for obtaining a basis for the unique lattice l whose lattice ideal i_l is iy_q we also give two direct algorithmic methods to compute the order of y_q which is the length of the corresponding code cc_aay_q we share procedures implementing them in verbmacaulay2 finally we give a lower bound for the minimum distance of cc_aay_q taking advantage of the parametric description of the subgroup y_q as an application we compute the main parameters of the toric codes on hirzebruch surfaces cl h_ell generalizing the corresponding result given by hansen | [['let', 'x', 'be', 'a', 'complete', 'simplicial', 'toric', 'variety', 'over', 'a', 'finite', 'field', 'with', 'a', 'split', 'torus', 't_x', 'for', 'any', 'matrix', 'q', 'we', 'are', 'interested', 'in', 'the', 'subgroup', 'y_q', 'of', 't_x', 'parameterized', 'by', 'the', 'columns', 'of', 'q', 'we', 'give', 'an', 'algorithm', 'for', 'obtaining', 'a', 'basis', 'for', 'the', 'unique', 'lattice', 'l', 'whose', 'lattice', 'ideal', 'i_l', 'is', 'iy_q', 'we', 'also', 'give', 'two', 'direct', 'algorithmic', 'methods', 'to', 'compute', 'the', 'order', 'of', 'y_q', 'which', 'is', 'the', 'length', 'of', 'the', 'corresponding', 'code', 'cc_aay_q', 'we', 'share', 'procedures', 'implementing', 'them', 'in', 'verbmacaulay2', 'finally', 'we', 'give', 'a', 'lower', 'bound', 'for', 'the', 'minimum', 'distance', 'of', 'cc_aay_q', 'taking', 'advantage', 'of', 'the', 'parametric', 'description', 'of', 'the', 'subgroup', 'y_q', 'as', 'an', 'application', 'we', 'compute', 'the', 'main', 'parameters', 'of', 'the', 'toric', 'codes', 'on', 'hirzebruch', 'surfaces', 'cl', 'h_ell', 'generalizing', 'the', 'corresponding', 'result', 'given', 'by', 'hansen']] | [-0.15807326696813107, 0.07999058439611598, -0.07086497653157466, 0.04441574320293194, -0.05393209581869462, -0.12860243880958666, 0.04339768261268055, 0.35687693214923555, -0.28422909169753513, -0.23215441030287554, 0.10320979267098232, -0.23998190747529624, -0.0832222593238666, 0.22235952237147896, -0.06859672545743663, -0.005006768435816325, 0.01528806208692018, 0.06910867674557107, -0.11581294809833967, -0.2971711639750985, 0.3415345144716816, 0.020645664080918308, 0.19403755860698838, 0.04385346806209002, 0.10668080191438396, 0.028089187669730377, -0.008875660723932678, 0.0021757628650419295, -0.22121909325055422, 0.14726221778555698, 0.25238804209659554, 0.1163647760201009, 0.19198737914363542, -0.3576023343965293, -0.1324409499028993, 0.1820671555682248, 0.11699381534246699, 0.07223379644768549, -0.0007346641458940529, -0.20224548763565955, 0.13177416652500157, -0.16447761374948885, -0.14977941636203063, -0.06411727003583181, 0.06972829966218255, 0.010239209758029097, -0.2980358505673293, -0.023977650556988674, 0.0909621936476065, 0.1155064517026028, -0.01129099145709049, -0.16687790614308878, -0.022307262844627813, 0.10977941148892223, -0.030256217687449877, 0.05912499443169624, 0.049382910206322635, -0.07947784978046363, -0.11525808462488746, 0.39305669854954994, -0.06278480739390019, -0.19755662508338453, 0.10034558002556128, -0.11756200412110913, -0.10885017521546356, 0.13421201097616364, 0.13538896401102343, 0.13467263774798502, -0.052557169481934535, 0.1766547089856532, -0.12719969945176254, 0.10302348323591379, 0.04848642116190777, 0.011564492877657777, 0.15499235853175855, 0.10939042469660293, 0.0843430918526821, 0.1656452315731994, -0.017338290160368492, -0.005530995061798464, -0.3662400404804401, -0.17806752787261743, -0.168407103098515, 0.1268966453563836, -0.15007314515842443, -0.18674025647637862, 0.3956318169329611, 0.0938757043257947, 0.24837552928384246, 0.09381875804036907, 0.22994324357973206, 0.11767136226389704, 0.02386921246550859, 0.10881997333721273, 0.1133122661258168, 0.18168131253286635, -0.07494302117727726, -0.19215942293198573, -0.004953980732280466, 0.19245448702621082] |
1,802.04084 | Randomized Block Cubic Newton Method | We study the problem of minimizing the sum of three convex functions: a
differentiable, twice-differentiable and a non-smooth term in a high
dimensional setting. To this effect we propose and analyze a randomized block
cubic Newton (RBCN) method, which in each iteration builds a model of the
objective function formed as the sum of the natural models of its three
components: a linear model with a quadratic regularizer for the differentiable
term, a quadratic model with a cubic regularizer for the twice differentiable
term, and perfect (proximal) model for the nonsmooth term. Our method in each
iteration minimizes the model over a random subset of blocks of the search
variable. RBCN is the first algorithm with these properties, generalizing
several existing methods, matching the best known bounds in all special cases.
We establish ${\cal O}(1/\epsilon)$, ${\cal O}(1/\sqrt{\epsilon})$ and ${\cal
O}(\log (1/\epsilon))$ rates under different assumptions on the component
functions. Lastly, we show numerically that our method outperforms the
state-of-the-art on a variety of machine learning problems, including cubically
regularized least-squares, logistic regression with constraints, and Poisson
regression.
| math.OC | we study the problem of minimizing the sum of three convex functions a differentiable twicedifferentiable and a nonsmooth term in a high dimensional setting to this effect we propose and analyze a randomized block cubic newton rbcn method which in each iteration builds a model of the objective function formed as the sum of the natural models of its three components a linear model with a quadratic regularizer for the differentiable term a quadratic model with a cubic regularizer for the twice differentiable term and perfect proximal model for the nonsmooth term our method in each iteration minimizes the model over a random subset of blocks of the search variable rbcn is the first algorithm with these properties generalizing several existing methods matching the best known bounds in all special cases we establish cal o1epsilon cal o1sqrtepsilon and cal olog 1epsilon rates under different assumptions on the component functions lastly we show numerically that our method outperforms the stateoftheart on a variety of machine learning problems including cubically regularized leastsquares logistic regression with constraints and poisson regression | [['we', 'study', 'the', 'problem', 'of', 'minimizing', 'the', 'sum', 'of', 'three', 'convex', 'functions', 'a', 'differentiable', 'twicedifferentiable', 'and', 'a', 'nonsmooth', 'term', 'in', 'a', 'high', 'dimensional', 'setting', 'to', 'this', 'effect', 'we', 'propose', 'and', 'analyze', 'a', 'randomized', 'block', 'cubic', 'newton', 'rbcn', 'method', 'which', 'in', 'each', 'iteration', 'builds', 'a', 'model', 'of', 'the', 'objective', 'function', 'formed', 'as', 'the', 'sum', 'of', 'the', 'natural', 'models', 'of', 'its', 'three', 'components', 'a', 'linear', 'model', 'with', 'a', 'quadratic', 'regularizer', 'for', 'the', 'differentiable', 'term', 'a', 'quadratic', 'model', 'with', 'a', 'cubic', 'regularizer', 'for', 'the', 'twice', 'differentiable', 'term', 'and', 'perfect', 'proximal', 'model', 'for', 'the', 'nonsmooth', 'term', 'our', 'method', 'in', 'each', 'iteration', 'minimizes', 'the', 'model', 'over', 'a', 'random', 'subset', 'of', 'blocks', 'of', 'the', 'search', 'variable', 'rbcn', 'is', 'the', 'first', 'algorithm', 'with', 'these', 'properties', 'generalizing', 'several', 'existing', 'methods', 'matching', 'the', 'best', 'known', 'bounds', 'in', 'all', 'special', 'cases', 'we', 'establish', 'cal', 'o1epsilon', 'cal', 'o1sqrtepsilon', 'and', 'cal', 'olog', '1epsilon', 'rates', 'under', 'different', 'assumptions', 'on', 'the', 'component', 'functions', 'lastly', 'we', 'show', 'numerically', 'that', 'our', 'method', 'outperforms', 'the', 'stateoftheart', 'on', 'a', 'variety', 'of', 'machine', 'learning', 'problems', 'including', 'cubically', 'regularized', 'leastsquares', 'logistic', 'regression', 'with', 'constraints', 'and', 'poisson', 'regression']] | [-0.10392221657825368, -0.029371425516105124, -0.05662569223237889, 0.056667380471314706, -0.07800353389632489, -0.1819888170316283, 0.04541429650836757, 0.36376895819391525, -0.3239632970972785, -0.26128171644040515, 0.11636062651872635, -0.2730627557934661, -0.2126363789037402, 0.1792036792289998, -0.07177761710648026, 0.11815721741045958, 0.057313251100214464, 0.04329594112134406, -0.1393951085223151, -0.33098033686900247, 0.29263542100388024, -0.014445334901767118, 0.22784802871224072, 0.01161631422217137, 0.1876036631735042, 0.019029484234218085, 0.00517069600322949, 0.020558022717751943, -0.08902096052009646, 0.1282552846807188, 0.2324092045861471, 0.13973975094168314, 0.3579498875673328, -0.37163697197634193, -0.20623389894674932, 0.15547198551108263, 0.08491107857653073, 0.05995064381709588, 0.0060043409559875725, -0.20472322728085732, 0.06650857809664948, -0.1463807103250708, -0.06592288047873548, -0.07602253576208438, -0.06776486566556351, 0.04229422463769359, -0.37648358395522724, 0.06554757344935622, 0.08052233337424695, 0.003053979551685708, -0.09471075598483107, -0.16895676622965505, 0.0215370586887002, 0.01373066666136895, 0.05695194352218615, 0.09429682505317033, 0.08562538443266281, -0.11818736504950461, -0.13031813319639435, 0.3535586036794952, -0.12090153303529536, -0.2542605232061552, 0.15432825480188642, -0.06413584791123866, -0.16615946265602752, 0.0851719731311979, 0.22361891432565503, 0.20555885312014394, -0.1328624406190855, 0.12500107432150148, -0.08179813052660652, 0.11909177823723958, 0.02633034828518118, -0.009313831384227212, 0.09316151765042117, 0.18209126302972437, 0.13516158894265703, 0.18093153116426297, -0.05509343366803868, -0.1088167302470122, -0.33157594086868425, -0.09669174513912626, -0.19228223426866212, -0.03321511259169451, -0.18824608042794613, -0.20361056828006568, 0.41187831066548825, 0.09327819387661293, 0.23135484784575444, 0.18310492616213325, 0.32978261602776393, 0.1406926157651469, 0.08091622404754162, 0.11491209284801568, 0.16944203833251129, 0.09127056551964155, 0.022791732572950422, -0.217328692091895, 0.05610412810396935, 0.14182577050956233] |
1,802.04085 | Empirical Risk Minimization in Non-interactive Local Differential
Privacy: Efficiency and High Dimensional Case | In this paper, we study the Empirical Risk Minimization problem in the
non-interactive local model of differential privacy. In the case of constant or
low dimensionality ($p\ll n$), we first show that if the ERM loss function is
$(\infty, T)$-smooth, then we can avoid a dependence of the sample complexity,
to achieve error $\alpha$, on the exponential of the dimensionality $p$ with
base $1/\alpha$ (i.e., $\alpha^{-p}$), which answers a question in [smith 2017
interaction]. Our approach is based on polynomial approximation. Then, we
propose player-efficient algorithms with $1$-bit communication complexity and
$O(1)$ computation cost for each player. The error bound is asymptotically the
same as the original one. Also with additional assumptions we show a server
efficient algorithm. Next we consider the high dimensional case ($n\ll p$), we
show that if the loss function is Generalized Linear function and convex, then
we could get an error bound which is dependent on the Gaussian width of the
underlying constrained set instead of $p$, which is lower than that in [smith
2017 interaction].
| cs.LG cs.CR stat.ML | in this paper we study the empirical risk minimization problem in the noninteractive local model of differential privacy in the case of constant or low dimensionality pll n we first show that if the erm loss function is infty tsmooth then we can avoid a dependence of the sample complexity to achieve error alpha on the exponential of the dimensionality p with base 1alpha ie alphap which answers a question in smith 2017 interaction our approach is based on polynomial approximation then we propose playerefficient algorithms with 1bit communication complexity and o1 computation cost for each player the error bound is asymptotically the same as the original one also with additional assumptions we show a server efficient algorithm next we consider the high dimensional case nll p we show that if the loss function is generalized linear function and convex then we could get an error bound which is dependent on the gaussian width of the underlying constrained set instead of p which is lower than that in smith 2017 interaction | [['in', 'this', 'paper', 'we', 'study', 'the', 'empirical', 'risk', 'minimization', 'problem', 'in', 'the', 'noninteractive', 'local', 'model', 'of', 'differential', 'privacy', 'in', 'the', 'case', 'of', 'constant', 'or', 'low', 'dimensionality', 'pll', 'n', 'we', 'first', 'show', 'that', 'if', 'the', 'erm', 'loss', 'function', 'is', 'infty', 'tsmooth', 'then', 'we', 'can', 'avoid', 'a', 'dependence', 'of', 'the', 'sample', 'complexity', 'to', 'achieve', 'error', 'alpha', 'on', 'the', 'exponential', 'of', 'the', 'dimensionality', 'p', 'with', 'base', '1alpha', 'ie', 'alphap', 'which', 'answers', 'a', 'question', 'in', 'smith', '2017', 'interaction', 'our', 'approach', 'is', 'based', 'on', 'polynomial', 'approximation', 'then', 'we', 'propose', 'playerefficient', 'algorithms', 'with', '1bit', 'communication', 'complexity', 'and', 'o1', 'computation', 'cost', 'for', 'each', 'player', 'the', 'error', 'bound', 'is', 'asymptotically', 'the', 'same', 'as', 'the', 'original', 'one', 'also', 'with', 'additional', 'assumptions', 'we', 'show', 'a', 'server', 'efficient', 'algorithm', 'next', 'we', 'consider', 'the', 'high', 'dimensional', 'case', 'nll', 'p', 'we', 'show', 'that', 'if', 'the', 'loss', 'function', 'is', 'generalized', 'linear', 'function', 'and', 'convex', 'then', 'we', 'could', 'get', 'an', 'error', 'bound', 'which', 'is', 'dependent', 'on', 'the', 'gaussian', 'width', 'of', 'the', 'underlying', 'constrained', 'set', 'instead', 'of', 'p', 'which', 'is', 'lower', 'than', 'that', 'in', 'smith', '2017', 'interaction']] | [-0.11476115792003624, 0.048785978214051715, -0.07307078843826757, 0.0892972877009443, -0.05812190850402283, -0.17766917263815069, 0.0960705064189182, 0.3600004745976013, -0.2967339805491707, -0.3016151356373859, 0.07632700013585718, -0.26677527112667176, -0.18080170352066702, 0.13812039357007427, -0.10851806031201063, 0.08282067700946594, 0.04104874747846385, 0.06793807499822886, -0.0651161068423843, -0.3378255239126327, 0.3138294498689527, 0.04919837044812191, 0.24577681368545573, 0.048172999114510326, 0.0915433910647955, 0.016176592681885642, 0.02746376137742225, 0.0010208689662463525, -0.14639232743951758, 0.10372453794424312, 0.21522837072569767, 0.1583042359500028, 0.3340701556709759, -0.37020902219480967, -0.14629304765121026, 0.14040821898071204, 0.1395443249877323, 0.08549775952158277, -0.014255102513604524, -0.21202771379834945, 0.1167666561285253, -0.1501671037691481, -0.06609915317625135, -0.039170057445709755, 0.01056326940546141, 0.0097754817113609, -0.35971932059482614, 0.06670084875470766, 0.08827223540557658, 0.004142706101650701, -0.04450444722589215, -0.13106742280754535, 0.033265118613181745, 0.05505472867688, 0.030164057020481458, 0.05667286326095243, 0.08299083292265148, -0.10344566154102829, -0.11202964420800152, 0.330240968113546, -0.08940371739488054, -0.22572469681857482, 0.12637633361497566, -0.14133211240610655, -0.14831831093042103, 0.09987231216749505, 0.21425100213793272, 0.11472488798557177, -0.0847914504709051, 0.15642050532709725, -0.06666131253518602, 0.20290280942092923, 0.062274961737806306, 0.022340682592681224, 0.03721503602779087, 0.1653745025954456, 0.14185526369906523, 0.14140247121891555, -0.07553348980487927, -0.052233276143670085, -0.3200764571919161, -0.16259836960542837, -0.2097958240493694, 0.06628720311530154, -0.11141564917514402, -0.1367187994203585, 0.3235473273048068, 0.12296106105992187, 0.22399863693315317, 0.13932405237094772, 0.33913771317833485, 0.1691896580181064, -0.006557651656090884, 0.1490705043907356, 0.19467091747860918, 0.05925606306614902, 0.009415400956812151, -0.21639930464272553, 0.09979343578726163, 0.09130658631432144] |
1,802.04086 | The Complex Event Recognition Group | The Complex Event Recognition (CER) group is a research team, affiliated with
the National Centre of Scientific Research "Demokritos" in Greece. The CER
group works towards advanced and efficient methods for the recognition of
complex events in a multitude of large, heterogeneous and interdependent data
streams. Its research covers multiple aspects of complex event recognition,
from efficient detection of patterns on event streams to handling uncertainty
and noise in streams, and machine learning techniques for inferring interesting
patterns. Lately, it has expanded to methods for forecasting the occurrence of
events. It was founded in 2009 and currently hosts 3 senior researchers, 5 PhD
students and works regularly with under-graduate students.
| cs.AI | the complex event recognition cer group is a research team affiliated with the national centre of scientific research demokritos in greece the cer group works towards advanced and efficient methods for the recognition of complex events in a multitude of large heterogeneous and interdependent data streams its research covers multiple aspects of complex event recognition from efficient detection of patterns on event streams to handling uncertainty and noise in streams and machine learning techniques for inferring interesting patterns lately it has expanded to methods for forecasting the occurrence of events it was founded in 2009 and currently hosts 3 senior researchers 5 phd students and works regularly with undergraduate students | [['the', 'complex', 'event', 'recognition', 'cer', 'group', 'is', 'a', 'research', 'team', 'affiliated', 'with', 'the', 'national', 'centre', 'of', 'scientific', 'research', 'demokritos', 'in', 'greece', 'the', 'cer', 'group', 'works', 'towards', 'advanced', 'and', 'efficient', 'methods', 'for', 'the', 'recognition', 'of', 'complex', 'events', 'in', 'a', 'multitude', 'of', 'large', 'heterogeneous', 'and', 'interdependent', 'data', 'streams', 'its', 'research', 'covers', 'multiple', 'aspects', 'of', 'complex', 'event', 'recognition', 'from', 'efficient', 'detection', 'of', 'patterns', 'on', 'event', 'streams', 'to', 'handling', 'uncertainty', 'and', 'noise', 'in', 'streams', 'and', 'machine', 'learning', 'techniques', 'for', 'inferring', 'interesting', 'patterns', 'lately', 'it', 'has', 'expanded', 'to', 'methods', 'for', 'forecasting', 'the', 'occurrence', 'of', 'events', 'it', 'was', 'founded', 'in', '2009', 'and', 'currently', 'hosts', '3', 'senior', 'researchers', '5', 'phd', 'students', 'and', 'works', 'regularly', 'with', 'undergraduate', 'students']] | [-0.09290463491471125, 0.052124250727201546, -0.07936548679178461, 0.08516649360695872, -0.15039902545272485, -0.13765371605271148, 0.02879178681445026, 0.37842488302550187, -0.1947323398604784, -0.3938684250685224, 0.12373732765623872, -0.3306737105199777, -0.1552427292955236, 0.241701046902037, -0.14774477249593806, 0.04432564944727346, 0.14368042813767806, 0.07666858376234496, -0.013251507842759474, -0.307013223272398, 0.25755689289728434, 0.12171527340051232, 0.3358918946650768, -0.02395500552011739, 0.1021202687492355, 0.018866465548736923, -0.12097891039907112, -0.05510566968026511, -0.05626347894276228, 0.173270909006733, 0.4402625563665541, 0.22732857522050584, 0.36210374108199544, -0.38403603378170675, -0.20692136838451164, 0.03228232866887926, 0.1042933912665814, 0.05204228155871366, -0.0567932420275644, -0.3747403534864067, 0.03107572469322028, -0.21713069725542442, -0.06747186345575856, -0.01117384639609212, 0.12910591553332745, -5.029064150304969e-05, -0.23020235802807393, 0.03257145370365283, 0.05913404459048302, 0.1932522019610629, -0.027070480340092077, -0.11629962370145656, 0.06561998438534386, 0.18402149406936738, 0.08149638364236768, 0.020689862299659245, 0.16096056417194665, -0.17091607879163748, -0.18652202717002925, 0.3667768194348714, 0.013856406955885778, -0.0956046415873111, 0.2555325533596611, -0.1369107537005746, -0.23344480984100918, 0.11017418577369952, 0.26597669979540306, 0.07071148292930506, -0.16708152486575306, 0.03779839057530866, 0.02345815094170767, 0.11577326227663033, 0.08736794409043061, -0.07604283935159718, 0.2218070201396327, 0.24080816609571354, 0.040885560248696474, 0.02787753787007046, -0.10465599310054623, -0.09151099253138271, -0.16926193150634014, -0.11706462993773573, -0.11084200575127515, -0.03572312893063992, -0.020348300404660832, -0.13045976522865646, 0.4072948724988404, 0.14044853800976084, 0.09517461788806415, -0.02577061984482982, 0.2790225992286834, 0.02642406536898482, 0.12111352009852545, 0.10552871041427102, 0.1349380055139132, 0.05239040955661907, 0.18821016820831174, -0.10964459865759853, 0.10206875215293071, -0.03513784314411769] |
1,802.04087 | Deep learning based supervised semantic segmentation of Electron
Cryo-Subtomograms | Cellular Electron Cryo-Tomography (CECT) is a powerful imaging technique for
the 3D visualization of cellular structure and organization at submolecular
resolution. It enables analyzing the native structures of macromolecular
complexes and their spatial organization inside single cells. However, due to
the high degree of structural complexity and practical imaging limitations,
systematic macromolecular structural recovery inside CECT images remains
challenging. Particularly, the recovery of a macromolecule is likely to be
biased by its neighbor structures due to the high molecular crowding. To reduce
the bias, here we introduce a novel 3D convolutional neural network inspired by
Fully Convolutional Network and Encoder-Decoder Architecture for the supervised
segmentation of macromolecules of interest in subtomograms. The tests of our
models on realistically simulated CECT data demonstrate that our new approach
has significantly improved segmentation performance compared to our baseline
approach. Also, we demonstrate that the proposed model has generalization
ability to segment new structures that do not exist in training data.
| q-bio.QM cs.CV stat.ML | cellular electron cryotomography cect is a powerful imaging technique for the 3d visualization of cellular structure and organization at submolecular resolution it enables analyzing the native structures of macromolecular complexes and their spatial organization inside single cells however due to the high degree of structural complexity and practical imaging limitations systematic macromolecular structural recovery inside cect images remains challenging particularly the recovery of a macromolecule is likely to be biased by its neighbor structures due to the high molecular crowding to reduce the bias here we introduce a novel 3d convolutional neural network inspired by fully convolutional network and encoderdecoder architecture for the supervised segmentation of macromolecules of interest in subtomograms the tests of our models on realistically simulated cect data demonstrate that our new approach has significantly improved segmentation performance compared to our baseline approach also we demonstrate that the proposed model has generalization ability to segment new structures that do not exist in training data | [['cellular', 'electron', 'cryotomography', 'cect', 'is', 'a', 'powerful', 'imaging', 'technique', 'for', 'the', '3d', 'visualization', 'of', 'cellular', 'structure', 'and', 'organization', 'at', 'submolecular', 'resolution', 'it', 'enables', 'analyzing', 'the', 'native', 'structures', 'of', 'macromolecular', 'complexes', 'and', 'their', 'spatial', 'organization', 'inside', 'single', 'cells', 'however', 'due', 'to', 'the', 'high', 'degree', 'of', 'structural', 'complexity', 'and', 'practical', 'imaging', 'limitations', 'systematic', 'macromolecular', 'structural', 'recovery', 'inside', 'cect', 'images', 'remains', 'challenging', 'particularly', 'the', 'recovery', 'of', 'a', 'macromolecule', 'is', 'likely', 'to', 'be', 'biased', 'by', 'its', 'neighbor', 'structures', 'due', 'to', 'the', 'high', 'molecular', 'crowding', 'to', 'reduce', 'the', 'bias', 'here', 'we', 'introduce', 'a', 'novel', '3d', 'convolutional', 'neural', 'network', 'inspired', 'by', 'fully', 'convolutional', 'network', 'and', 'encoderdecoder', 'architecture', 'for', 'the', 'supervised', 'segmentation', 'of', 'macromolecules', 'of', 'interest', 'in', 'subtomograms', 'the', 'tests', 'of', 'our', 'models', 'on', 'realistically', 'simulated', 'cect', 'data', 'demonstrate', 'that', 'our', 'new', 'approach', 'has', 'significantly', 'improved', 'segmentation', 'performance', 'compared', 'to', 'our', 'baseline', 'approach', 'also', 'we', 'demonstrate', 'that', 'the', 'proposed', 'model', 'has', 'generalization', 'ability', 'to', 'segment', 'new', 'structures', 'that', 'do', 'not', 'exist', 'in', 'training', 'data']] | [-0.04775067295947343, 0.019696649766058488, -0.034953475048896045, 0.06761640550681408, -0.07130164441290744, -0.1537641614414514, 0.03517109982277842, 0.4476295107394267, -0.29192067916463516, -0.317722438724495, 0.05443482399787635, -0.2196155636345932, -0.22694889002533, 0.17215128365687576, -0.12086582074392659, 0.059778648958049095, 0.1451975398016263, -0.03559275196604193, -0.011255806031678417, -0.22640830857062322, 0.2450159007185109, 0.12496757425462744, 0.3785104933268966, 0.06421992638011932, 0.12950875040197116, -0.03290965155532263, 0.0010588976397374822, 0.02722676027385269, -0.07991348867964372, 0.20611489068265934, 0.27473115986376684, 0.1512791962284227, 0.2796650825996711, -0.46511613829120707, -0.28851705531672733, 0.05522470754292456, 0.18288169180748948, 0.13984410902396271, -0.049097876793743486, -0.3130079789953247, 0.13195966007365922, -0.13268038464324908, -0.04808903617968273, -0.15396330017258358, -0.03290665758533439, -0.006327403345216469, -0.23468360995798176, 0.07777111258214654, 0.04373916025884497, 0.06532094768846518, -0.05915772599082108, -0.0668313738379841, -0.004749478755969625, 0.16551946522668004, -0.05637606975969497, 0.04727448822610128, 0.1643947514640108, -0.19002402311147956, -0.11947789036662905, 0.3737239534462428, 0.005765087792433348, -0.21527925941642304, 0.25255013719960384, -0.09901727365395113, -0.16861953729300933, 0.18262565334455055, 0.20759191602812546, 0.08684310703805298, -0.1573888569470394, 0.025350973563221326, -0.016944472357678184, 0.2011644663526469, 0.045949011453824816, 0.015549921516661241, 0.17944838714513003, 0.31739228260911007, 0.030272685367299636, 0.12755149701731813, -0.19334654632368523, -0.053410225221776006, -0.13183523872333347, -0.12473098005043567, -0.20646541770755247, 0.0015396467146981258, -0.0956802728202544, -0.17065849596082833, 0.398734080534025, 0.21193591174283985, 0.18120877337968275, 0.0739131249564516, 0.3559461725433802, -0.03656287078825745, 0.15531693521892995, 0.00928248087193366, 0.16697591072790752, 0.07892100253456812, 0.11274293987495694, -0.2184254124150374, 0.08781613599787805, 0.019426218696697882] |
1,802.04088 | On the number of Bose-selected modes in driven-dissipative ideal Bose
gases | In an ideal Bose gas that is driven into a steady state far from thermal
equilibrium, a generalized form of Bose condensation can occur. Namely, the
single-particle states unambiguously separate into two groups: the group of
Bose-selected states, whose occupations increase linearly with the total
particle number, and the group of all other states whose occupations saturate
[Phys. Rev. Lett. 111, 240405 (2013)]. However, so far very little is known
about how the number of Bose-selected states depends on the properties of the
system and its coupling to the environment. The answer to this question is
crucial since systems hosting a single, a few, or an extensive number of
Bose-selected states will show rather different behavior. While in the former
two scenarios each selected mode acquires a macroscopic occupation,
corresponding to (fragmented) Bose condensation, the latter case rather bears
resemblance to a high-temperature state of matter. In this paper, we
systematically investigate the number of Bose-selected states, considering
different classes of the rate matrices that characterize the driven-dissipative
ideal Bose gases in the limit of weak system-bath coupling. These include rate
matrices with continuum limit, rate matrices of chaotic driven systems, random
rate matrices, and rate matrices resulting from thermal baths that couple to a
few observables only.
| cond-mat.quant-gas cond-mat.stat-mech quant-ph | in an ideal bose gas that is driven into a steady state far from thermal equilibrium a generalized form of bose condensation can occur namely the singleparticle states unambiguously separate into two groups the group of boseselected states whose occupations increase linearly with the total particle number and the group of all other states whose occupations saturate phys rev lett 111 240405 2013 however so far very little is known about how the number of boseselected states depends on the properties of the system and its coupling to the environment the answer to this question is crucial since systems hosting a single a few or an extensive number of boseselected states will show rather different behavior while in the former two scenarios each selected mode acquires a macroscopic occupation corresponding to fragmented bose condensation the latter case rather bears resemblance to a hightemperature state of matter in this paper we systematically investigate the number of boseselected states considering different classes of the rate matrices that characterize the drivendissipative ideal bose gases in the limit of weak systembath coupling these include rate matrices with continuum limit rate matrices of chaotic driven systems random rate matrices and rate matrices resulting from thermal baths that couple to a few observables only | [['in', 'an', 'ideal', 'bose', 'gas', 'that', 'is', 'driven', 'into', 'a', 'steady', 'state', 'far', 'from', 'thermal', 'equilibrium', 'a', 'generalized', 'form', 'of', 'bose', 'condensation', 'can', 'occur', 'namely', 'the', 'singleparticle', 'states', 'unambiguously', 'separate', 'into', 'two', 'groups', 'the', 'group', 'of', 'boseselected', 'states', 'whose', 'occupations', 'increase', 'linearly', 'with', 'the', 'total', 'particle', 'number', 'and', 'the', 'group', 'of', 'all', 'other', 'states', 'whose', 'occupations', 'saturate', 'phys', 'rev', 'lett', '111', '240405', '2013', 'however', 'so', 'far', 'very', 'little', 'is', 'known', 'about', 'how', 'the', 'number', 'of', 'boseselected', 'states', 'depends', 'on', 'the', 'properties', 'of', 'the', 'system', 'and', 'its', 'coupling', 'to', 'the', 'environment', 'the', 'answer', 'to', 'this', 'question', 'is', 'crucial', 'since', 'systems', 'hosting', 'a', 'single', 'a', 'few', 'or', 'an', 'extensive', 'number', 'of', 'boseselected', 'states', 'will', 'show', 'rather', 'different', 'behavior', 'while', 'in', 'the', 'former', 'two', 'scenarios', 'each', 'selected', 'mode', 'acquires', 'a', 'macroscopic', 'occupation', 'corresponding', 'to', 'fragmented', 'bose', 'condensation', 'the', 'latter', 'case', 'rather', 'bears', 'resemblance', 'to', 'a', 'hightemperature', 'state', 'of', 'matter', 'in', 'this', 'paper', 'we', 'systematically', 'investigate', 'the', 'number', 'of', 'boseselected', 'states', 'considering', 'different', 'classes', 'of', 'the', 'rate', 'matrices', 'that', 'characterize', 'the', 'drivendissipative', 'ideal', 'bose', 'gases', 'in', 'the', 'limit', 'of', 'weak', 'systembath', 'coupling', 'these', 'include', 'rate', 'matrices', 'with', 'continuum', 'limit', 'rate', 'matrices', 'of', 'chaotic', 'driven', 'systems', 'random', 'rate', 'matrices', 'and', 'rate', 'matrices', 'resulting', 'from', 'thermal', 'baths', 'that', 'couple', 'to', 'a', 'few', 'observables', 'only']] | [-0.16580142699268224, 0.2094446138235071, -0.05413609821922504, 0.020414120140020923, 0.0019328547619247378, -0.14187152402099365, 0.08702451325314961, 0.30299167019368795, -0.24001216869510245, -0.27478763265893436, 0.04814778143190779, -0.30484112337357006, -0.08782705832205605, 0.16461864708141477, -8.647958300291345e-05, 0.02025101525158299, 0.03581229134691127, 0.04561121457272048, -0.06923829088806926, -0.24541527864214283, 0.3315788983600214, 0.05629954613742974, 0.29135449042279593, 0.033596777014631346, 0.07480190867611852, -0.025986904010866195, 0.04779780322860461, 0.0020393761022625347, -0.10180580638101534, 0.030879104855277825, 0.2136721291597216, 0.0560286982911818, 0.2592116636134541, -0.42943906038104057, -0.17966491419848843, 0.14199910608910543, 0.13781425257464155, 0.13708131113246333, -0.012984951401729351, -0.2861744566325797, -0.005828072618057307, -0.21023258168805534, -0.13738905829646123, -0.07138983856286639, 0.051338922906255066, 0.004950093644975613, -0.2290731144221354, 0.12432290390223408, 0.06661609115634257, 0.0273468182763631, -0.030433325387443453, -0.10273705767926564, -0.04737813338467207, 0.10547823166864244, 0.016240935768350413, -0.017166890870542444, 0.16626350647017646, -0.151927206903705, -0.06670654180477588, 0.3700101627036929, -0.057981320022148654, -0.16994983625213186, 0.263119215592339, -0.17433450551470742, -0.10764652359424733, 0.1528541931374303, 0.13921525230230494, 0.10667509837982764, -0.14831776541317454, 0.058763441897519024, -0.09749304883790991, 0.1916817539850644, 0.04298510254235365, 0.10291216910991352, 0.2391966434359067, 0.10898425123349835, 0.03184508183935227, 0.16225035724962183, -0.04109275970907989, -0.14480668686043757, -0.247584951589278, -0.13891993676015074, -0.21581949171699166, 0.09478594585044238, -0.01447781781833048, -0.1694397123523791, 0.4014939004947127, 0.13076328716684096, 0.22926925934287004, 0.009633029780861061, 0.21743188281274903, 0.11906662706594663, 0.003895066365098151, 0.08237988535368529, 0.2432665015445449, 0.17941950458267597, 0.06155912361975005, -0.2503253901061096, 0.02383068254745852, 0.04496122870030096] |
1,802.04089 | Threshold phenomena for high-dimensional random polytopes | Let $X_1,\ldots,X_N$, $N>n$, be independent random points in $\mathbb{R}^n$,
distributed according to the so-called beta or beta-prime distribution,
respectively. We establish threshold phenomena for the volume, intrinsic
volumes, or more general measures of the convex hulls of these random point
sets, as the space dimension $n$ tends to infinity. The dual setting of
polytopes generated by random halfspaces is also investigated.
| math.MG math.PR | let x_1ldotsx_n nn be independent random points in mathbbrn distributed according to the socalled beta or betaprime distribution respectively we establish threshold phenomena for the volume intrinsic volumes or more general measures of the convex hulls of these random point sets as the space dimension n tends to infinity the dual setting of polytopes generated by random halfspaces is also investigated | [['let', 'x_1ldotsx_n', 'nn', 'be', 'independent', 'random', 'points', 'in', 'mathbbrn', 'distributed', 'according', 'to', 'the', 'socalled', 'beta', 'or', 'betaprime', 'distribution', 'respectively', 'we', 'establish', 'threshold', 'phenomena', 'for', 'the', 'volume', 'intrinsic', 'volumes', 'or', 'more', 'general', 'measures', 'of', 'the', 'convex', 'hulls', 'of', 'these', 'random', 'point', 'sets', 'as', 'the', 'space', 'dimension', 'n', 'tends', 'to', 'infinity', 'the', 'dual', 'setting', 'of', 'polytopes', 'generated', 'by', 'random', 'halfspaces', 'is', 'also', 'investigated']] | [-0.11440926242703725, 0.192865581099005, -0.044072002508356925, 0.06777839720836978, -0.011013478338413063, -0.13213172715279412, 0.07711587827194666, 0.3335970718352521, -0.31827575069104064, -0.1535983801605638, 0.10394293430345286, -0.33662036206328966, -0.10778961331797306, 0.14002276438700614, -0.1163463665050317, 0.08090301888582647, -0.04288836070441366, 0.0474199916037624, -0.04960977774949317, -0.30830176925805747, 0.35087550372137216, -0.039830194450304154, 0.25812423748315355, -0.01928310729868588, 0.07476822931231687, 0.0498943891009835, -0.0013342253772205995, 0.07636060791515238, -0.16868273857370264, 0.10661585804563566, 0.25496493782237417, 0.10583443292423789, 0.2682470605082688, -0.38387427976751914, -0.17487426587670554, 0.23877217799241915, 0.15951377101486824, -0.016467666100771702, 0.0331305067355985, -0.2644028043007997, 0.1460077835048442, -0.04019947255366161, -0.20573566517731573, -0.05868564184266524, 0.05930048670642628, 0.06803995212082004, -0.34525200442151455, 0.013533640175305887, 0.09189520959482818, 0.06221305242296858, -0.026738523001797864, -0.18214300534207006, 0.0020095765834949055, 0.0750627086142872, 0.01573309524091663, 0.10056596138651987, 0.12556581949570872, -0.01909718635018732, -0.1491831020894842, 0.36654242463257225, 0.008291551137159838, -0.2889860516383511, 0.16029664264900273, -0.19428102811798453, -0.07494037525850486, 0.1102177756456811, 0.24001137658068147, 0.13964739076976404, -0.11253843058786187, 0.164118563489164, -0.06910112571948376, 0.09034585033888837, 0.11817700148666979, 0.02664087846833205, 0.133886350776817, 0.08281873653215341, 0.1359961765558749, 0.1775832762531402, -0.05298028142786906, -0.1015024238006502, -0.3349764923580357, -0.09138434752821922, -0.2627114359381013, 0.12824965646437017, -0.23616685419816708, -0.1940947432971758, 0.26497382080548854, 0.06294638478792593, 0.25554660454270295, 0.13028783771041474, 0.19582882187649853, 0.09814271010023343, -0.0038888226950266323, 0.10867882362561163, 0.08009522489928564, 0.1515377393549644, 0.008085492059405222, -0.10421479612466741, 0.049506512508712346, 0.14079519494085527] |
1,802.0409 | Don't Leave Me Alone: Retrospective Think Aloud supported by Real-time
Monitoring of Participant's Physiology | Think aloud protocols are widely applied in user experience studies. In this
paper, the effect of two different applications of the Retrospective Think
Aloud (RTA) protocol on the number of user-reported usability issues is
examined. To this end, 30 users were asked to use the National Cadastre and
Mapping Agency web application and complete a set of tasks, such as measuring
the land area of a square in their hometown. The order of tasks was randomized
per participant. Next, participants were involved in RTA sessions. Each
participant was involved in two different RTA modes: (a) the strict guidance,
in which the facilitator stayed in the background and prompted participants to
keep thinking aloud based on his judgement and experience, and (b) the
physiology-supported interventions, in which the facilitator intervened based
on real-time monitoring of user's physiological signals. During each session,
three participant's physiological signals were recorded: skin conductance, skin
temperature and blood volume pulse. Participants were also asked to provide
valence-arousal ratings for each self-reported usability issue. Analysis of the
collected data showed that participants in the physiology-supported RTA mode
reported significantly more usability issues. No significant effect of the RTA
mode was found on the va-lence-arousal ratings for the reported usability
issues. Participants' physiological signals during the RTA sessions did not
also differ significantly between the two modes.
| cs.HC cs.CY | think aloud protocols are widely applied in user experience studies in this paper the effect of two different applications of the retrospective think aloud rta protocol on the number of userreported usability issues is examined to this end 30 users were asked to use the national cadastre and mapping agency web application and complete a set of tasks such as measuring the land area of a square in their hometown the order of tasks was randomized per participant next participants were involved in rta sessions each participant was involved in two different rta modes a the strict guidance in which the facilitator stayed in the background and prompted participants to keep thinking aloud based on his judgement and experience and b the physiologysupported interventions in which the facilitator intervened based on realtime monitoring of users physiological signals during each session three participants physiological signals were recorded skin conductance skin temperature and blood volume pulse participants were also asked to provide valencearousal ratings for each selfreported usability issue analysis of the collected data showed that participants in the physiologysupported rta mode reported significantly more usability issues no significant effect of the rta mode was found on the valencearousal ratings for the reported usability issues participants physiological signals during the rta sessions did not also differ significantly between the two modes | [['think', 'aloud', 'protocols', 'are', 'widely', 'applied', 'in', 'user', 'experience', 'studies', 'in', 'this', 'paper', 'the', 'effect', 'of', 'two', 'different', 'applications', 'of', 'the', 'retrospective', 'think', 'aloud', 'rta', 'protocol', 'on', 'the', 'number', 'of', 'userreported', 'usability', 'issues', 'is', 'examined', 'to', 'this', 'end', '30', 'users', 'were', 'asked', 'to', 'use', 'the', 'national', 'cadastre', 'and', 'mapping', 'agency', 'web', 'application', 'and', 'complete', 'a', 'set', 'of', 'tasks', 'such', 'as', 'measuring', 'the', 'land', 'area', 'of', 'a', 'square', 'in', 'their', 'hometown', 'the', 'order', 'of', 'tasks', 'was', 'randomized', 'per', 'participant', 'next', 'participants', 'were', 'involved', 'in', 'rta', 'sessions', 'each', 'participant', 'was', 'involved', 'in', 'two', 'different', 'rta', 'modes', 'a', 'the', 'strict', 'guidance', 'in', 'which', 'the', 'facilitator', 'stayed', 'in', 'the', 'background', 'and', 'prompted', 'participants', 'to', 'keep', 'thinking', 'aloud', 'based', 'on', 'his', 'judgement', 'and', 'experience', 'and', 'b', 'the', 'physiologysupported', 'interventions', 'in', 'which', 'the', 'facilitator', 'intervened', 'based', 'on', 'realtime', 'monitoring', 'of', 'users', 'physiological', 'signals', 'during', 'each', 'session', 'three', 'participants', 'physiological', 'signals', 'were', 'recorded', 'skin', 'conductance', 'skin', 'temperature', 'and', 'blood', 'volume', 'pulse', 'participants', 'were', 'also', 'asked', 'to', 'provide', 'valencearousal', 'ratings', 'for', 'each', 'selfreported', 'usability', 'issue', 'analysis', 'of', 'the', 'collected', 'data', 'showed', 'that', 'participants', 'in', 'the', 'physiologysupported', 'rta', 'mode', 'reported', 'significantly', 'more', 'usability', 'issues', 'no', 'significant', 'effect', 'of', 'the', 'rta', 'mode', 'was', 'found', 'on', 'the', 'valencearousal', 'ratings', 'for', 'the', 'reported', 'usability', 'issues', 'participants', 'physiological', 'signals', 'during', 'the', 'rta', 'sessions', 'did', 'not', 'also', 'differ', 'significantly', 'between', 'the', 'two', 'modes']] | [-0.11134935335818834, 0.09290549550981571, -0.0808155822173662, 0.063966864088326, -0.10741126585074838, -0.15434923026650385, 0.10950940988011469, 0.3865351127288132, -0.17483627742708283, -0.3621549068289082, 0.08600644332182128, -0.34249997376227165, -0.11882071621733269, 0.1894423680216143, -0.12307061981280437, 0.04429926932371692, 0.07684617082338298, 0.08117028957147138, 0.004914228996009721, -0.3459968320266516, 0.24732822122953418, 0.06454631060154901, 0.35697399306593947, 0.0643611926382248, 0.06097727627288636, 0.039954471167961685, -0.0927248495885309, -0.009403732292142834, -0.0654670777894016, 0.04940775530499027, 0.35076333962691325, 0.17222700258544474, 0.3658738423751115, -0.4606115681386587, -0.15142901919467408, 0.03409278824390775, 0.07423198136206742, 0.05322020831927485, -0.011571150526732608, -0.32172027484651794, 0.06318090324660901, -0.17929004791572137, -0.030730432785478316, 0.0031941624722633235, 0.008539291211356478, 0.0045692431093711, -0.23187607567955706, 0.03841845746689985, -0.0019023825578322565, 0.15727851507943813, -0.059590558060099955, -0.11324377540990503, 0.013565107576192127, 0.22900664105394822, 0.09556622360940781, -0.008456778145584933, 0.1999790237966442, -0.12140796134675232, -0.15573657352770506, 0.36281031689981724, 0.03653474389499967, -0.1320203857720588, 0.17654809011448244, -0.12263401117417272, -0.13694274392576147, 0.08868560478300357, 0.21530614653925617, 0.07211791957012827, -0.18647120501743672, -0.062290423240887724, 0.0033058817713969837, 0.23613404513377678, 0.12210902590110588, -0.028703414760120387, 0.1349428225905824, 0.16581310430558882, -0.017235051111061626, 0.08355863578267249, -0.057270048496623836, -0.04542329462883235, -0.21645796357053634, -0.15191069918175884, -0.10037612368183478, -0.025067852162397618, -0.022130530572919978, -0.08164385897085864, 0.4269694238599321, 0.17878943364808542, 0.11912794704376548, 0.003192401684053173, 0.29908153997665204, 0.018223546769890905, 0.07821216760014606, 0.036759084577001715, 0.22163018021361763, -0.0014360820211920698, 0.23148760066315946, -0.21190046112665353, 0.15637490988269243, -0.0055665165677459705] |
1,802.04091 | On the contact geometry and the Poisson geometry of the ideal gas | We elaborate on existing notions of contact geometry and Poisson geometry as
applied to the classical ideal gas. Specifically we observe that it is possible
to describe its dynamics using a 3-dimensional contact submanifold of the
standard 5-dimensional contact manifold used in the literature. This reflects
the fact that the internal energy of the ideal gas depends exclusively on its
temperature. We also present a Poisson algebra of thermodynamic operators for a
quantum-like description of the classical ideal gas. The central element of
this Poisson algebra is proportional to Boltzmann's constant. A Hilbert space
of states is identified and a system of wave equations governing the
wavefunction is found. Expectation values for the operators representing
pressure, volume and temperature are found to satisfy the classical equations
of state.
| math-ph math.MP quant-ph | we elaborate on existing notions of contact geometry and poisson geometry as applied to the classical ideal gas specifically we observe that it is possible to describe its dynamics using a 3dimensional contact submanifold of the standard 5dimensional contact manifold used in the literature this reflects the fact that the internal energy of the ideal gas depends exclusively on its temperature we also present a poisson algebra of thermodynamic operators for a quantumlike description of the classical ideal gas the central element of this poisson algebra is proportional to boltzmanns constant a hilbert space of states is identified and a system of wave equations governing the wavefunction is found expectation values for the operators representing pressure volume and temperature are found to satisfy the classical equations of state | [['we', 'elaborate', 'on', 'existing', 'notions', 'of', 'contact', 'geometry', 'and', 'poisson', 'geometry', 'as', 'applied', 'to', 'the', 'classical', 'ideal', 'gas', 'specifically', 'we', 'observe', 'that', 'it', 'is', 'possible', 'to', 'describe', 'its', 'dynamics', 'using', 'a', '3dimensional', 'contact', 'submanifold', 'of', 'the', 'standard', '5dimensional', 'contact', 'manifold', 'used', 'in', 'the', 'literature', 'this', 'reflects', 'the', 'fact', 'that', 'the', 'internal', 'energy', 'of', 'the', 'ideal', 'gas', 'depends', 'exclusively', 'on', 'its', 'temperature', 'we', 'also', 'present', 'a', 'poisson', 'algebra', 'of', 'thermodynamic', 'operators', 'for', 'a', 'quantumlike', 'description', 'of', 'the', 'classical', 'ideal', 'gas', 'the', 'central', 'element', 'of', 'this', 'poisson', 'algebra', 'is', 'proportional', 'to', 'boltzmanns', 'constant', 'a', 'hilbert', 'space', 'of', 'states', 'is', 'identified', 'and', 'a', 'system', 'of', 'wave', 'equations', 'governing', 'the', 'wavefunction', 'is', 'found', 'expectation', 'values', 'for', 'the', 'operators', 'representing', 'pressure', 'volume', 'and', 'temperature', 'are', 'found', 'to', 'satisfy', 'the', 'classical', 'equations', 'of', 'state']] | [-0.14799695333704221, 0.08614380060316762, -0.09274701163667487, 0.07080701594713901, -0.08266111169723445, -0.09707312902537524, 0.007486032809538301, 0.2972464459890034, -0.2919213227405635, -0.22764710818591993, 0.08024284644670843, -0.25709382624336286, -0.1287139894120628, 0.16671523021068424, -0.04991744186190772, 0.02857423716534413, 0.024811434574075975, 0.09961544481393503, -0.11857935135822117, -0.20996198804641608, 0.41943874687603966, 0.07551682081248146, 0.2652303005270369, 0.024754144575126702, 0.16895684702467406, -0.021233877037047932, -0.0027245161327300593, 0.05266229506992204, -0.17126232677094322, 0.08967848665406564, 0.2176526791172364, 0.06089719889132539, 0.19849736453033984, -0.41348055889829993, -0.19863283500785656, 0.1081869528425159, 0.09874738175494713, 0.08424210931843845, 0.011534305091117858, -0.24737543403171003, 0.019603428248956334, -0.15708998900299775, -0.19887221620592754, -0.06820956018054858, 0.030353265945450403, -0.0007563123508589342, -0.2205090240586287, 0.0884199085464843, 0.06465019439383468, 0.037946060714602936, -0.09277027577536501, -0.09489412005586928, -0.048430398612254066, 0.07826355193174095, -0.024040951142524136, 0.030118478996428166, 0.1963758017773216, -0.09667744095077069, -0.07342679298290022, 0.40415421286888886, -0.06247297192521728, -0.2532653997623129, 0.19995398647733964, -0.15744076082728498, -0.09424874439719133, 0.11562688212416106, 0.12029809332580044, 0.08099517062873929, -0.14341187827085378, 0.15150678182772026, -0.06949681885441805, 0.11442558398994152, 0.028652975966366512, 0.006387808982253773, 0.17365134424107964, 0.14564218960731523, 0.04161937857134035, 0.1333019157277704, -0.048191504127316875, -0.16123291827580033, -0.32287052951869555, -0.22522369964281097, -0.17929910653765546, 0.11730097752331403, -0.09206364428030156, -0.2036036731733475, 0.3436027503594232, 0.12975929898357208, 0.17837041969687562, 0.01578303061251063, 0.27299696018599207, 0.15410312487711053, 0.041833589237285196, 0.07728358592430595, 0.2233117668893101, 0.19126870270883956, 0.104718405083986, -0.2208812545868568, 0.024546308735807543, 0.11008712840521184] |
1,802.04092 | Linear combination of composition operators on $H^\infty$ and the Bloch
space | Let $\lambda_i (i=1,...,k)$ be any nonzero complex scalars and $\varphi_i
(i=1,..,k)$ be any analytic self-maps of the unit disk $\mathbb{D}$. We show
that the operator $\sum_{i=1}^k\lambda_iC_{\varphi_i}$ is compact on the Bloch
space $\mathcal{B}$ if and only if
$$\lim_{n\to\infty}\|\lambda_1\varphi_1^n+\lambda_2\varphi_2^n+...+\lambda_k\varphi_k^n\|_{\mathcal{B}}=0.$$
We also study the linear combination of composition operators on the Banach
algebra of bounded analytic functions.
| math.CV math.FA | let lambda_i i1k be any nonzero complex scalars and varphi_i i1k be any analytic selfmaps of the unit disk mathbbd we show that the operator sum_i1klambda_ic_varphi_i is compact on the bloch space mathcalb if and only if lim_ntoinftylambda_1varphi_1nlambda_2varphi_2nlambda_kvarphi_kn_mathcalb0 we also study the linear combination of composition operators on the banach algebra of bounded analytic functions | [['let', 'lambda_i', 'i1k', 'be', 'any', 'nonzero', 'complex', 'scalars', 'and', 'varphi_i', 'i1k', 'be', 'any', 'analytic', 'selfmaps', 'of', 'the', 'unit', 'disk', 'mathbbd', 'we', 'show', 'that', 'the', 'operator', 'sum_i1klambda_ic_varphi_i', 'is', 'compact', 'on', 'the', 'bloch', 'space', 'mathcalb', 'if', 'and', 'only', 'if', 'lim_ntoinftylambda_1varphi_1nlambda_2varphi_2nlambda_kvarphi_kn_mathcalb0', 'we', 'also', 'study', 'the', 'linear', 'combination', 'of', 'composition', 'operators', 'on', 'the', 'banach', 'algebra', 'of', 'bounded', 'analytic', 'functions']] | [-0.18275115734849232, 0.1481680831046037, -0.021282919946144212, 0.0298363601301252, -0.12758850861112322, -0.10149585603261893, -0.02703720710749896, 0.3803015250782922, -0.326206615862419, -0.05953766433697826, 0.14132698432032792, -0.2968716951930579, -0.14374997635494988, 0.20248167206234527, -0.06143963988870382, -0.016737191744570463, 0.05616155185930009, 0.08073641094466988, -0.11309834669414416, -0.24208082151511368, 0.4508613686973475, -0.10385089656689538, 0.0703641613945365, 0.04932913927466802, 0.13073152880061348, 0.012226224305846219, 0.02241808448408572, -0.05937629159296125, -0.18854806737884777, 0.08095565153602159, 0.23225846703884737, 0.13806527524413365, 0.22873175530782286, -0.4034494524733778, -0.14795131278487872, 0.26138063659891486, 0.1420364876295317, -0.13405796393470945, 0.006906343883184611, -0.25984348282920866, 0.12480205722715494, -0.13099784938231954, -0.1199578587492963, -0.09824736971618994, 0.0992549897593288, 0.021218135047985136, -0.35134547759058343, -0.024621367784555263, 0.11217769228343694, 0.07249197219762038, -0.1473902977282568, -0.10947629083650855, -0.14726906251338012, 0.048956594754994476, -0.08391043247286019, 0.14294568577974612, 0.13300738897490896, 0.0085997000898955, -0.07451192100690503, 0.32221168833169733, -0.09445435052983603, -0.34550628392904437, 0.09296273784536235, -0.3388994377071284, -0.11234747166393923, 0.01623792809276086, 0.12882385975769106, 0.1840040057475837, -0.04449520059773382, 0.2949682223184456, -0.16386786549580548, 0.16117897471588738, 0.08256259407707543, 0.0353752525813245, 0.17057532405937617, 0.00785247247033524, 0.12112829150667168, 0.07207309891786075, 0.07527895813878134, -0.009342222549196965, -0.4012052799170872, -0.1714648002020593, -0.2015433751819831, 0.14617257456312766, -0.16430847044487237, -0.18700737832992706, 0.37284194831824247, 0.034495161565126116, 0.2246293314152731, 0.09825520713831175, 0.24383891533779087, 0.1784276963466392, 0.08959766533577217, 0.10051568779426645, 0.0935282255259325, 0.17407698992569492, -0.027183146883715998, -0.17182994551324057, -0.000302933534290993, 0.16704547557324162] |
1,802.04093 | Reasoning in a Hierarchical System with Missing Group Size Information | The paper analyzes the problem of judgments or preferences subsequent to
initial analysis by autonomous agents in a hierarchical system where the higher
level agents does not have access to group size information. We propose methods
that reduce instances of preference reversal of the kind encountered in
Simpson's paradox.
| cs.AI | the paper analyzes the problem of judgments or preferences subsequent to initial analysis by autonomous agents in a hierarchical system where the higher level agents does not have access to group size information we propose methods that reduce instances of preference reversal of the kind encountered in simpsons paradox | [['the', 'paper', 'analyzes', 'the', 'problem', 'of', 'judgments', 'or', 'preferences', 'subsequent', 'to', 'initial', 'analysis', 'by', 'autonomous', 'agents', 'in', 'a', 'hierarchical', 'system', 'where', 'the', 'higher', 'level', 'agents', 'does', 'not', 'have', 'access', 'to', 'group', 'size', 'information', 'we', 'propose', 'methods', 'that', 'reduce', 'instances', 'of', 'preference', 'reversal', 'of', 'the', 'kind', 'encountered', 'in', 'simpsons', 'paradox']] | [-0.14367225754777996, 0.03210738917090455, -0.08732703700661659, 0.07386036487106158, -0.1562245441458131, -0.1601079746757691, 0.1321513127863445, 0.3840519073514306, -0.2762028042759214, -0.3540571355546007, 0.0846509591780831, -0.24700035545404772, -0.15161922408210837, 0.08395322708279959, -0.1669127545984728, 0.013566164413885194, 0.09446284383991543, 0.08143292851651049, -0.03767981493788562, -0.28029972388960267, 0.38377925481324143, 0.04359362916830851, 0.29962094753448454, -0.002132144347973624, 0.12400901405026718, 0.05541436626707746, -0.025894184520810236, 0.04448032248004967, -0.08198034967493613, 0.10822280701392387, 0.3058490675436903, 0.20028993654616026, 0.3998023910181863, -0.43870901149146413, -0.20182062772444773, 0.14037174337106395, 0.15120855996347204, 0.130896291966379, 0.01123862568175002, -0.30516301295529974, 0.08169057726508425, -0.19675696098568793, -0.09648797043352103, -0.04934713998999523, -0.016566835876022066, 0.021917942388705453, -0.2503092889674008, 0.06662866935057908, 0.1071958068226065, 0.081333208943204, -0.08351767336835667, -0.07026001959991622, 0.019590153796028117, 0.15411783697330678, 0.058291975750910996, -0.05824643462760925, 0.1333536044884549, -0.14832638690666278, -0.20977120873831898, 0.4091111680074614, 0.010285059455782175, -0.20530747101471133, 0.16784846317973368, -0.13623041113154316, -0.18624399157659133, 0.10478182642587594, 0.21620357488947256, 0.10818887138929294, -0.15598480013788354, 0.007769847364754093, -0.06506237769689487, 0.23181662738931422, 0.06304266655399483, -0.004868786164312338, 0.15135865024652104, 0.1662233351748817, 0.11253733813705645, 0.08666675623354254, -0.0013126857930376213, -0.11875423323363066, -0.22402578434545775, -0.14504415925820263, -0.16242005687435063, -0.003637879566296612, -0.04691940880314048, -0.1349065477902792, 0.3422641442442427, 0.21242571112756825, 0.17715085832858268, 0.0518496980966658, 0.29870876323963913, 0.07558070664883268, 0.08026073926261493, 0.04024835013100231, 0.12993529932193307, -0.0031298627858335265, 0.1419793972555472, -0.21659159426558383, 0.1721435780827032, 0.05154438550603025] |
1,802.04094 | A rational QZ method | We propose a rational QZ method for the solution of the dense, unsymmetric
generalized eigenvalue problem. This generalization of the classical QZ method
operates implicitly on a Hessenberg, Hessenberg pencil instead of on a
Hessenberg, triangular pencil. Whereas the QZ method performs nested subspace
iteration driven by a polynomial, the rational QZ method allows for nested
subspace iteration driven by a rational function, this creates the additional
freedom of selecting poles. In this article we study Hessenberg, Hessenberg
pencils, link them to rational Krylov subspaces, propose a direct reduction
method to such a pencil, and introduce the implicit rational QZ step. The link
with rational Krylov subspaces allows us to prove essential uniqueness
(implicit Q theorem) of the rational QZ iterates as well as convergence of the
proposed method. In the proofs, we operate directly on the pencil instead of
rephrasing it all in terms of a single matrix. Numerical experiments are
included to illustrate competitiveness in terms of speed and accuracy with the
classical approach. Two other types of experiments exemplify new possibilities.
First we illustrate that good pole selection can be used to deflate the
original problem during the reduction phase, and second we use the rational QZ
method to implicitly filter a rational Krylov subspace in an iterative method.
| math.NA | we propose a rational qz method for the solution of the dense unsymmetric generalized eigenvalue problem this generalization of the classical qz method operates implicitly on a hessenberg hessenberg pencil instead of on a hessenberg triangular pencil whereas the qz method performs nested subspace iteration driven by a polynomial the rational qz method allows for nested subspace iteration driven by a rational function this creates the additional freedom of selecting poles in this article we study hessenberg hessenberg pencils link them to rational krylov subspaces propose a direct reduction method to such a pencil and introduce the implicit rational qz step the link with rational krylov subspaces allows us to prove essential uniqueness implicit q theorem of the rational qz iterates as well as convergence of the proposed method in the proofs we operate directly on the pencil instead of rephrasing it all in terms of a single matrix numerical experiments are included to illustrate competitiveness in terms of speed and accuracy with the classical approach two other types of experiments exemplify new possibilities first we illustrate that good pole selection can be used to deflate the original problem during the reduction phase and second we use the rational qz method to implicitly filter a rational krylov subspace in an iterative method | [['we', 'propose', 'a', 'rational', 'qz', 'method', 'for', 'the', 'solution', 'of', 'the', 'dense', 'unsymmetric', 'generalized', 'eigenvalue', 'problem', 'this', 'generalization', 'of', 'the', 'classical', 'qz', 'method', 'operates', 'implicitly', 'on', 'a', 'hessenberg', 'hessenberg', 'pencil', 'instead', 'of', 'on', 'a', 'hessenberg', 'triangular', 'pencil', 'whereas', 'the', 'qz', 'method', 'performs', 'nested', 'subspace', 'iteration', 'driven', 'by', 'a', 'polynomial', 'the', 'rational', 'qz', 'method', 'allows', 'for', 'nested', 'subspace', 'iteration', 'driven', 'by', 'a', 'rational', 'function', 'this', 'creates', 'the', 'additional', 'freedom', 'of', 'selecting', 'poles', 'in', 'this', 'article', 'we', 'study', 'hessenberg', 'hessenberg', 'pencils', 'link', 'them', 'to', 'rational', 'krylov', 'subspaces', 'propose', 'a', 'direct', 'reduction', 'method', 'to', 'such', 'a', 'pencil', 'and', 'introduce', 'the', 'implicit', 'rational', 'qz', 'step', 'the', 'link', 'with', 'rational', 'krylov', 'subspaces', 'allows', 'us', 'to', 'prove', 'essential', 'uniqueness', 'implicit', 'q', 'theorem', 'of', 'the', 'rational', 'qz', 'iterates', 'as', 'well', 'as', 'convergence', 'of', 'the', 'proposed', 'method', 'in', 'the', 'proofs', 'we', 'operate', 'directly', 'on', 'the', 'pencil', 'instead', 'of', 'rephrasing', 'it', 'all', 'in', 'terms', 'of', 'a', 'single', 'matrix', 'numerical', 'experiments', 'are', 'included', 'to', 'illustrate', 'competitiveness', 'in', 'terms', 'of', 'speed', 'and', 'accuracy', 'with', 'the', 'classical', 'approach', 'two', 'other', 'types', 'of', 'experiments', 'exemplify', 'new', 'possibilities', 'first', 'we', 'illustrate', 'that', 'good', 'pole', 'selection', 'can', 'be', 'used', 'to', 'deflate', 'the', 'original', 'problem', 'during', 'the', 'reduction', 'phase', 'and', 'second', 'we', 'use', 'the', 'rational', 'qz', 'method', 'to', 'implicitly', 'filter', 'a', 'rational', 'krylov', 'subspace', 'in', 'an', 'iterative', 'method']] | [-0.12604864219611045, -0.03738921446848457, -0.08121928120721658, 0.054765752501860436, -0.13107967144976598, -0.18293173873647697, 0.0676066924582833, 0.3429558121045735, -0.3481225226302895, -0.21003274607059177, 0.07565715230208847, -0.21562856173745185, -0.20013244399462632, 0.19896804436795273, -0.07704329470234027, 0.08370796166237374, 0.09828116839975645, 0.006102623540978387, -0.1334925722566934, -0.2961648407223072, 0.3583368826569673, 0.035337097368989455, 0.22111064623514154, -0.03508976544363354, 0.16316978522369918, 0.0017879071935378717, -0.03772269601204415, -0.06092394084696008, -0.10056642603853587, 0.1377576608759931, 0.29267275670130366, 0.1430069931117238, 0.3066088793324834, -0.3621384556457963, -0.12276697960926027, 0.1649594793737567, 0.21802610988132348, 0.07810280557594455, -0.028708549035726255, -0.2258823212534892, 0.05273549577643005, -0.1710781823814339, -0.1732716974472838, -0.1412445018276625, -0.08440787379546442, 0.03714909821689428, -0.30588294128131754, 0.02251382159148255, 0.061547735344095786, 0.06186298281318159, -0.01044634140902726, -0.15702223580743555, 0.008019401572143906, 0.03371407512250304, -0.020361606866332156, 0.03698902971985451, 0.08182263555980446, -0.030234414764530607, -0.11053448093435639, 0.35378825646069534, -0.05574603663990274, -0.30167756650930727, 0.15573132222184455, -0.0720598387893263, -0.1248407457441197, 0.14778063141406989, 0.15814160105782202, 0.16015637316082096, -0.06767440494149923, 0.1255962327905197, -0.0732922060744626, 0.12281054310953105, 0.08168427163805321, -0.07646316407415313, 0.10667157957752077, 0.12200386938501703, 0.0940421806156354, 0.11604661467229235, -0.03255579739884267, -0.07889458801946603, -0.29592907057969636, -0.17963800095636748, -0.1796558759716682, 0.0027502941292763317, -0.12064539959767058, -0.19076152971422933, 0.4351357035251018, 0.11093106631844146, 0.21169687304173526, 0.08085256075609545, 0.32702638785231786, 0.11808835377615771, 0.014653315144659125, 0.03833061866989394, 0.16845963126540464, 0.12528279447161486, 0.04344164877789499, -0.21607498075433607, 0.0390587265554921, 0.244200564246572] |
1,802.04095 | A New Multi Criteria Decision Making Method: Approach of Logarithmic
Concept (APLOCO) | The primary aim of the study is to introduce APLOCO method which is developed
for the solution of multicriteria decision making problems both theoretically
and practically. In this context, application subject of APLACO constitutes
evaluation of investment potential of different cities in metropolitan status
in Turkey. The secondary purpose of the study is to identify the independent
variables affecting the factories in the operating phase and to estimate the
effect levels of independent variables on the dependent variable in the
organized industrial zones (OIZs), whose mission is to reduce regional
development disparities and to mobilize local production dynamics. For this
purpose, the effect levels of independent variables on dependent variables have
been determined using the multilayer perceptron (MLP) method, which has a wide
use in artificial neural networks (ANNs). The effect levels derived from MLP
have been then used as the weight levels of the decision criteria in APLOCO.
The independent variables included in MLP are also used as the decision
criteria in APLOCO. According to the results obtained from APLOCO, Istanbul
city is the best alternative in term of the investment potential and other
alternatives are Manisa, Denizli, Izmir, Kocaeli, Bursa, Ankara, Adana, and
Antalya, respectively. Although APLOCO is used to solve the ranking problem in
order to show application process in the paper, it can be employed easily in
the solution of classification and selection problems. On the other hand, the
study also shows a rare example of the nested usage of APLOCO which is one of
the methods of operation research as well as MLP used in determination of
weights.
| cs.AI | the primary aim of the study is to introduce aploco method which is developed for the solution of multicriteria decision making problems both theoretically and practically in this context application subject of aplaco constitutes evaluation of investment potential of different cities in metropolitan status in turkey the secondary purpose of the study is to identify the independent variables affecting the factories in the operating phase and to estimate the effect levels of independent variables on the dependent variable in the organized industrial zones oizs whose mission is to reduce regional development disparities and to mobilize local production dynamics for this purpose the effect levels of independent variables on dependent variables have been determined using the multilayer perceptron mlp method which has a wide use in artificial neural networks anns the effect levels derived from mlp have been then used as the weight levels of the decision criteria in aploco the independent variables included in mlp are also used as the decision criteria in aploco according to the results obtained from aploco istanbul city is the best alternative in term of the investment potential and other alternatives are manisa denizli izmir kocaeli bursa ankara adana and antalya respectively although aploco is used to solve the ranking problem in order to show application process in the paper it can be employed easily in the solution of classification and selection problems on the other hand the study also shows a rare example of the nested usage of aploco which is one of the methods of operation research as well as mlp used in determination of weights | [['the', 'primary', 'aim', 'of', 'the', 'study', 'is', 'to', 'introduce', 'aploco', 'method', 'which', 'is', 'developed', 'for', 'the', 'solution', 'of', 'multicriteria', 'decision', 'making', 'problems', 'both', 'theoretically', 'and', 'practically', 'in', 'this', 'context', 'application', 'subject', 'of', 'aplaco', 'constitutes', 'evaluation', 'of', 'investment', 'potential', 'of', 'different', 'cities', 'in', 'metropolitan', 'status', 'in', 'turkey', 'the', 'secondary', 'purpose', 'of', 'the', 'study', 'is', 'to', 'identify', 'the', 'independent', 'variables', 'affecting', 'the', 'factories', 'in', 'the', 'operating', 'phase', 'and', 'to', 'estimate', 'the', 'effect', 'levels', 'of', 'independent', 'variables', 'on', 'the', 'dependent', 'variable', 'in', 'the', 'organized', 'industrial', 'zones', 'oizs', 'whose', 'mission', 'is', 'to', 'reduce', 'regional', 'development', 'disparities', 'and', 'to', 'mobilize', 'local', 'production', 'dynamics', 'for', 'this', 'purpose', 'the', 'effect', 'levels', 'of', 'independent', 'variables', 'on', 'dependent', 'variables', 'have', 'been', 'determined', 'using', 'the', 'multilayer', 'perceptron', 'mlp', 'method', 'which', 'has', 'a', 'wide', 'use', 'in', 'artificial', 'neural', 'networks', 'anns', 'the', 'effect', 'levels', 'derived', 'from', 'mlp', 'have', 'been', 'then', 'used', 'as', 'the', 'weight', 'levels', 'of', 'the', 'decision', 'criteria', 'in', 'aploco', 'the', 'independent', 'variables', 'included', 'in', 'mlp', 'are', 'also', 'used', 'as', 'the', 'decision', 'criteria', 'in', 'aploco', 'according', 'to', 'the', 'results', 'obtained', 'from', 'aploco', 'istanbul', 'city', 'is', 'the', 'best', 'alternative', 'in', 'term', 'of', 'the', 'investment', 'potential', 'and', 'other', 'alternatives', 'are', 'manisa', 'denizli', 'izmir', 'kocaeli', 'bursa', 'ankara', 'adana', 'and', 'antalya', 'respectively', 'although', 'aploco', 'is', 'used', 'to', 'solve', 'the', 'ranking', 'problem', 'in', 'order', 'to', 'show', 'application', 'process', 'in', 'the', 'paper', 'it', 'can', 'be', 'employed', 'easily', 'in', 'the', 'solution', 'of', 'classification', 'and', 'selection', 'problems', 'on', 'the', 'other', 'hand', 'the', 'study', 'also', 'shows', 'a', 'rare', 'example', 'of', 'the', 'nested', 'usage', 'of', 'aploco', 'which', 'is', 'one', 'of', 'the', 'methods', 'of', 'operation', 'research', 'as', 'well', 'as', 'mlp', 'used', 'in', 'determination', 'of', 'weights']] | [-0.053075042006639706, 0.04564074827294462, -0.08215862784709316, 0.06896999385006808, -0.06266941396370385, -0.11416176057900884, 0.0730608668518471, 0.3625533452432137, -0.25427290147490567, -0.32153532217489555, 0.13901037386494863, -0.25441656298426096, -0.17023764585542267, 0.20332208946638275, -0.07681250834184539, 0.05902202071820284, 0.03785083826733171, 0.04592639479869831, 0.008838249346354132, -0.2911985060081861, 0.3076631513931716, 0.07467387941687775, 0.32200515470685787, 0.022414877274968603, 0.0907508112030655, 0.004525144375293166, -0.06221486715750757, 0.007178724905969602, -0.08226302737693914, 0.12257245161299579, 0.30207295493437414, 0.1468308758293233, 0.3128254822513554, -0.3971219843342624, -0.18553475236694794, 0.09333917464709884, 0.11423704748176533, 0.05259205042011672, 0.022796257791469543, -0.25726367875722644, 0.07267030014600095, -0.16713726744103496, -0.10365533096410218, -0.05016437587073597, 0.015376999126601731, 0.03895621327342269, -0.2768226965217764, 0.029313025596593434, 0.003437265071170259, 0.05971930899704603, -0.09643787644836266, -0.16369901668804232, -0.010410758223770245, 0.16495324479501505, 0.06377564229921973, 0.014048413631144285, 0.11407664287071384, -0.12545399291229842, -0.15321622205374297, 0.37856506591197103, -0.044548876572662266, -0.2105185005406156, 0.1811294406752495, -0.07235995642349735, -0.1620879060246807, 0.05608473576648976, 0.23523104807281925, 0.1098689837033362, -0.19600546351557568, 0.03930734322284479, 0.004334255465437309, 0.1372534872552933, 0.050036449792969506, 0.0005123604050822905, 0.1656357319388917, 0.23073127302450303, 0.05350397832444287, 0.1610175075566076, -0.10503084519677941, -0.102279666261893, -0.24395557591469696, -0.14419524607546919, -0.15547555581542838, -0.016733998279050866, -0.0693183572362841, -0.15840322191797895, 0.40111815043201204, 0.1919784095025534, 0.1509832377632847, 0.0029535168973779946, 0.27097084154593176, 0.11763011036055104, 0.09462273646610697, 0.04150502118682198, 0.23241837811838195, 0.09337054932643696, 0.11586765248694064, -0.18214358884688409, 0.12376307039960466, 0.03756213491124072] |
1,802.04096 | Indole moiety induced biological potency in pseudo- peptides derived
from 2-amino-2-(1H-indole-2-yl) based acetamides: synthesis, structure and
computational investigations | We report the synthesis and theoretical investigations of three novel
pseudo-peptide molecules derived from 2-amino-2-(1H-indole-2-yl) acetamides.
The compounds were subjected to spectroscopic characterization ($^1$H,
$^{13}$C-NMR and MS) and their chemical, electronic, and optical properties
have been investigated. To ascertain their potential pharmacological
applicability, the prospective reactive centers and molecular sites prone to
interaction with water were identified along with possible sensitivity to
autoxidation. Further, we have studied the optical response in the presence of
different solvents and compared the electronic and optical properties of the
pristine molecules. We highlight the subtle dependence of the properties on the
structure and composition of these pseudo-peptides. Our results indicate that
these molecules have high pharmaceutical potential and could serve as lead
components in new drug formulations.
| cond-mat.mtrl-sci | we report the synthesis and theoretical investigations of three novel pseudopeptide molecules derived from 2amino21hindole2yl acetamides the compounds were subjected to spectroscopic characterization 1h 13cnmr and ms and their chemical electronic and optical properties have been investigated to ascertain their potential pharmacological applicability the prospective reactive centers and molecular sites prone to interaction with water were identified along with possible sensitivity to autoxidation further we have studied the optical response in the presence of different solvents and compared the electronic and optical properties of the pristine molecules we highlight the subtle dependence of the properties on the structure and composition of these pseudopeptides our results indicate that these molecules have high pharmaceutical potential and could serve as lead components in new drug formulations | [['we', 'report', 'the', 'synthesis', 'and', 'theoretical', 'investigations', 'of', 'three', 'novel', 'pseudopeptide', 'molecules', 'derived', 'from', '2amino21hindole2yl', 'acetamides', 'the', 'compounds', 'were', 'subjected', 'to', 'spectroscopic', 'characterization', '1h', '13cnmr', 'and', 'ms', 'and', 'their', 'chemical', 'electronic', 'and', 'optical', 'properties', 'have', 'been', 'investigated', 'to', 'ascertain', 'their', 'potential', 'pharmacological', 'applicability', 'the', 'prospective', 'reactive', 'centers', 'and', 'molecular', 'sites', 'prone', 'to', 'interaction', 'with', 'water', 'were', 'identified', 'along', 'with', 'possible', 'sensitivity', 'to', 'autoxidation', 'further', 'we', 'have', 'studied', 'the', 'optical', 'response', 'in', 'the', 'presence', 'of', 'different', 'solvents', 'and', 'compared', 'the', 'electronic', 'and', 'optical', 'properties', 'of', 'the', 'pristine', 'molecules', 'we', 'highlight', 'the', 'subtle', 'dependence', 'of', 'the', 'properties', 'on', 'the', 'structure', 'and', 'composition', 'of', 'these', 'pseudopeptides', 'our', 'results', 'indicate', 'that', 'these', 'molecules', 'have', 'high', 'pharmaceutical', 'potential', 'and', 'could', 'serve', 'as', 'lead', 'components', 'in', 'new', 'drug', 'formulations']] | [-0.06773342589843831, 0.08685705941874816, -0.038086404217829724, -0.0018391828639667575, -0.015032148788910077, -0.09463820813082847, 0.08029424414007354, 0.4597819891421735, -0.2367916140047943, -0.32386902103028375, 0.08087058231663037, -0.30203055197513906, -0.14755070955050373, 0.1874524436405852, 0.026433385532944144, 0.051406958723487724, 0.015888422423339755, -0.06254754522658822, -0.04758743437627299, -0.21274067925782325, 0.24650600566939615, 0.05877026737894581, 0.2757146177547319, 0.130762972103964, 0.03453405718945217, -0.042844160600807986, -0.02571795434894494, -0.00018037497183354963, -0.14617254034873586, 0.1365941309091841, 0.23045103713731133, 0.03504215779776896, 0.22101014520495565, -0.5005931535407024, -0.24603114731046333, 0.05475462240190441, 0.09941004048406828, 0.12084135071945791, -0.11169252806527055, -0.2691482481930186, 0.07897867613370303, -0.11776783966122806, -0.13827755087653973, -0.15809397817151072, -0.005413383846132069, 0.1307208378126203, -0.17842341898676367, 0.0683942395321117, -0.026180862910857722, 0.12239902860195447, -0.16358232441820017, -0.2088030185706976, -0.05158439107794909, 0.16987506212557063, 0.03975989071636641, -0.03148924961525697, 0.19338599880061605, -0.11423923462206702, -0.08594540651778088, 0.413849702198841, -0.05138894927907078, -0.117793956740188, 0.292645752341917, -0.1226631220148391, -0.15141939112384403, 0.12068491300740161, 0.17691596567302065, 0.11087093180820283, -0.16953260972440445, -0.012352710202856757, 0.03762303712237783, 0.1457151780374536, 0.045959087577844115, 0.12835697042794914, 0.21870148026760072, 0.17233863446720632, -0.052624444610856476, 0.15764451610949673, -0.13417995813255737, -0.04282368827628817, -0.16175239290572516, -0.17144032842440515, -0.10932680167367353, 0.03702330497727424, -0.03924652624045236, -0.12562779129772378, 0.4040330171647693, 0.15491648034012617, 0.15644057872783423, -0.05380331041260051, 0.23125965586871283, 0.03374928466490462, 0.08549351518300652, -0.036563802776592116, 0.30577345439741593, 0.15297865873484426, 0.09792113706309098, -0.28203838708920076, 0.12273924040193317, -0.053858859902795625] |
1,802.04097 | The discreet charm of higgsino dark matter - a pocket review | We give a brief review of the current constraints and prospects for detection
of higgsino dark matter in low-scale supersymmetry. In the first part we argue,
after performing a survey of all potential dark matter particles in the MSSM,
that the (nearly) pure higgsino is the only candidate emerging virtually
unscathed from the wealth of observational data of recent years. In doing so by
virtue of its gauge quantum numbers and electroweak symmetry breaking only, it
maintains at the same time a relatively high degree of model-independence. In
the second part we properly review the prospects for detection of a
higgsino-like neutralino in direct underground dark matter searches, collider
searches, and indirect astrophysical signals. We provide estimates for the
typical scale of the superpartners and fine tuning in the context of
traditional scenarios where the breaking of supersymmetry is mediated at about
the scale of Grand Unification and where strong expectations for a timely
detection of higgsinos in underground detectors are closely related to the
measured 125 GeV mass of the Higgs boson at the LHC.
| hep-ph astro-ph.HE hep-ex | we give a brief review of the current constraints and prospects for detection of higgsino dark matter in lowscale supersymmetry in the first part we argue after performing a survey of all potential dark matter particles in the mssm that the nearly pure higgsino is the only candidate emerging virtually unscathed from the wealth of observational data of recent years in doing so by virtue of its gauge quantum numbers and electroweak symmetry breaking only it maintains at the same time a relatively high degree of modelindependence in the second part we properly review the prospects for detection of a higgsinolike neutralino in direct underground dark matter searches collider searches and indirect astrophysical signals we provide estimates for the typical scale of the superpartners and fine tuning in the context of traditional scenarios where the breaking of supersymmetry is mediated at about the scale of grand unification and where strong expectations for a timely detection of higgsinos in underground detectors are closely related to the measured 125 gev mass of the higgs boson at the lhc | [['we', 'give', 'a', 'brief', 'review', 'of', 'the', 'current', 'constraints', 'and', 'prospects', 'for', 'detection', 'of', 'higgsino', 'dark', 'matter', 'in', 'lowscale', 'supersymmetry', 'in', 'the', 'first', 'part', 'we', 'argue', 'after', 'performing', 'a', 'survey', 'of', 'all', 'potential', 'dark', 'matter', 'particles', 'in', 'the', 'mssm', 'that', 'the', 'nearly', 'pure', 'higgsino', 'is', 'the', 'only', 'candidate', 'emerging', 'virtually', 'unscathed', 'from', 'the', 'wealth', 'of', 'observational', 'data', 'of', 'recent', 'years', 'in', 'doing', 'so', 'by', 'virtue', 'of', 'its', 'gauge', 'quantum', 'numbers', 'and', 'electroweak', 'symmetry', 'breaking', 'only', 'it', 'maintains', 'at', 'the', 'same', 'time', 'a', 'relatively', 'high', 'degree', 'of', 'modelindependence', 'in', 'the', 'second', 'part', 'we', 'properly', 'review', 'the', 'prospects', 'for', 'detection', 'of', 'a', 'higgsinolike', 'neutralino', 'in', 'direct', 'underground', 'dark', 'matter', 'searches', 'collider', 'searches', 'and', 'indirect', 'astrophysical', 'signals', 'we', 'provide', 'estimates', 'for', 'the', 'typical', 'scale', 'of', 'the', 'superpartners', 'and', 'fine', 'tuning', 'in', 'the', 'context', 'of', 'traditional', 'scenarios', 'where', 'the', 'breaking', 'of', 'supersymmetry', 'is', 'mediated', 'at', 'about', 'the', 'scale', 'of', 'grand', 'unification', 'and', 'where', 'strong', 'expectations', 'for', 'a', 'timely', 'detection', 'of', 'higgsinos', 'in', 'underground', 'detectors', 'are', 'closely', 'related', 'to', 'the', 'measured', '125', 'gev', 'mass', 'of', 'the', 'higgs', 'boson', 'at', 'the', 'lhc']] | [-0.1191104369116312, 0.22449916911269116, -0.03848096144189516, 0.14397113187243865, -0.09469723878481257, -0.13487440375187856, 0.03102363131024917, 0.312522845400963, -0.2144996650233886, -0.35267287107523193, 0.0965387132442133, -0.26673184679979883, -0.014562134641561319, 0.15759777332013156, 0.030355088064838623, 0.054709032743796175, 0.04535264040830291, 0.02325946338946365, -0.04925775495278437, -0.2667420673467198, 0.27317623565216886, 0.08291865174528952, 0.18783266612081206, 0.10292684465821367, 0.0964162480516031, -0.010969513545701788, -0.05346959912937812, -0.10332561865983404, -0.12161863967400098, 0.08480449283061633, 0.24448496521059002, 0.1271328521146312, 0.18141492558722597, -0.38301708898573206, -0.16497847147614017, 0.19030054594093765, 0.12604793700368397, 0.10254163542280863, -0.13858483525903217, -0.3464044247282965, 0.09110047065769322, -0.2076121093778883, -0.08661207924292698, -0.025780780806433704, -0.02353433284654536, -0.0877103236800229, -0.24602958147840004, 0.10869938018533337, -0.04592297650048171, 0.02644148551520299, -0.027770593874182934, -0.129103762550089, -0.03471523998252286, -0.005963418913200836, 0.14184830052280714, -0.0353674490232317, 0.17833108379603468, -0.29480333579704165, -0.1372797525129334, 0.4397446859776127, -0.10387547021938107, -0.07986662309585055, 0.188855906582665, -0.1568214702790349, -0.2068439043412747, 0.12326164604019141, 0.16995258887684692, 0.09480676209998572, -0.12444641223158794, 0.1691630270939971, -0.02704512771875174, 0.16538964899584904, 0.03969669634402222, 0.07564388156011277, 0.3321268767520616, 0.2532098499776277, 0.10647040210791271, 0.0371504029939057, -0.09513288922078739, -0.06695538726159032, -0.4393790500322542, -0.14499206691768698, -0.11937644535249671, 0.01398570459125701, -0.03397356222765004, -0.06021059814586558, 0.4125723743530795, 0.14885491505265236, 0.23220368721310727, 0.029097039376872337, 0.3163025176988661, 0.026757379014849324, 0.07209101114213726, -0.004991684763560691, 0.3527972322481219, 0.08806178991455288, 0.12322355130361923, -0.18204034609863645, -0.02008308073841776, 0.02003743062959984] |
1,802.04098 | Cohesive fracture with irreversibility: quasistatic evolution for a
model subject to fatigue | In this paper we prove the existence of quasistatic evolutions for a cohesive
fracture on a prescribed crack surface, in small-strain antiplane elasticity.
The main feature of the model is that the density of the energy dissipated in
the fracture process depends on the total variation of the amplitude of the
jump. Thus, any change in the crack opening entails a loss of energy, until the
crack is complete. In particular this implies a fatigue phenomenon, i.e., a
complete fracture may be produced by oscillation of small jumps.
The first step of the existence proof is the construction of approximate
evolutions obtained by solving discrete-time incremental minimum problems. The
main difficulty in the passage to the continuous-time limit is that we lack of
controls on the variations of the jump of the approximate evolutions. Therefore
we resort to a weak formulation where the variation of the jump is replaced by
a Young measure. Eventually, after proving the existence in this weak
formulation, we improve the result by showing that the Young measure is
concentrated on a function and coincides with the variation of the jump of the
displacement.
| math.AP math.FA | in this paper we prove the existence of quasistatic evolutions for a cohesive fracture on a prescribed crack surface in smallstrain antiplane elasticity the main feature of the model is that the density of the energy dissipated in the fracture process depends on the total variation of the amplitude of the jump thus any change in the crack opening entails a loss of energy until the crack is complete in particular this implies a fatigue phenomenon ie a complete fracture may be produced by oscillation of small jumps the first step of the existence proof is the construction of approximate evolutions obtained by solving discretetime incremental minimum problems the main difficulty in the passage to the continuoustime limit is that we lack of controls on the variations of the jump of the approximate evolutions therefore we resort to a weak formulation where the variation of the jump is replaced by a young measure eventually after proving the existence in this weak formulation we improve the result by showing that the young measure is concentrated on a function and coincides with the variation of the jump of the displacement | [['in', 'this', 'paper', 'we', 'prove', 'the', 'existence', 'of', 'quasistatic', 'evolutions', 'for', 'a', 'cohesive', 'fracture', 'on', 'a', 'prescribed', 'crack', 'surface', 'in', 'smallstrain', 'antiplane', 'elasticity', 'the', 'main', 'feature', 'of', 'the', 'model', 'is', 'that', 'the', 'density', 'of', 'the', 'energy', 'dissipated', 'in', 'the', 'fracture', 'process', 'depends', 'on', 'the', 'total', 'variation', 'of', 'the', 'amplitude', 'of', 'the', 'jump', 'thus', 'any', 'change', 'in', 'the', 'crack', 'opening', 'entails', 'a', 'loss', 'of', 'energy', 'until', 'the', 'crack', 'is', 'complete', 'in', 'particular', 'this', 'implies', 'a', 'fatigue', 'phenomenon', 'ie', 'a', 'complete', 'fracture', 'may', 'be', 'produced', 'by', 'oscillation', 'of', 'small', 'jumps', 'the', 'first', 'step', 'of', 'the', 'existence', 'proof', 'is', 'the', 'construction', 'of', 'approximate', 'evolutions', 'obtained', 'by', 'solving', 'discretetime', 'incremental', 'minimum', 'problems', 'the', 'main', 'difficulty', 'in', 'the', 'passage', 'to', 'the', 'continuoustime', 'limit', 'is', 'that', 'we', 'lack', 'of', 'controls', 'on', 'the', 'variations', 'of', 'the', 'jump', 'of', 'the', 'approximate', 'evolutions', 'therefore', 'we', 'resort', 'to', 'a', 'weak', 'formulation', 'where', 'the', 'variation', 'of', 'the', 'jump', 'is', 'replaced', 'by', 'a', 'young', 'measure', 'eventually', 'after', 'proving', 'the', 'existence', 'in', 'this', 'weak', 'formulation', 'we', 'improve', 'the', 'result', 'by', 'showing', 'that', 'the', 'young', 'measure', 'is', 'concentrated', 'on', 'a', 'function', 'and', 'coincides', 'with', 'the', 'variation', 'of', 'the', 'jump', 'of', 'the', 'displacement']] | [-0.13859251018197455, 0.12835073851772208, -0.11150879943446118, 0.034440075987180185, -0.05447325512068346, -0.040491495610888495, 0.05972702292901305, 0.3189502897501448, -0.30183327186634723, -0.2597665232810578, 0.12502898761638478, -0.22318594293431082, -0.13903226464506277, 0.16030770931467217, -0.08511240998508428, 0.0515337846157676, 0.06946762753501931, 0.029172566005070892, -0.06950092465899131, -0.1932250334676281, 0.3335029553037454, 0.033069029524259795, 0.26265065904899915, 0.08651788739804575, 0.11761103714122734, 0.012731131156312024, -0.007462694807513121, 0.03895529747465031, -0.15063292058515257, 0.13179589681664206, 0.18117698148497322, 0.07517874865926445, 0.31255014060421826, -0.40294597884441946, -0.22192569581424554, 0.10269238612678971, 0.09228305963606158, 0.11299874341026186, 0.0050266395246193925, -0.2420330666243396, 0.09212048464712311, -0.09768756462057973, -0.17077667556921058, 0.03223818611660774, 0.038405076023488444, 0.055952950990065295, -0.25477943958855787, 0.12489965501825939, 0.10441053901616969, 0.056968539393447495, -0.08739277586449888, -0.02971395570537115, -0.020022170038576773, 0.10348175662356686, 0.06445734127485961, 0.019669645055979887, 0.11719063083155755, -0.12895559334874826, -0.07392718968417575, 0.378409498272107, -0.07789672263699801, -0.17335417577301765, 0.14877107701799336, -0.14423258616520895, -0.11542615982049957, 0.1724617237601667, 0.1574400927985404, 0.11775200126910622, -0.1292554064297137, 0.07825671289298199, -0.011267119585483593, 0.12981528176695722, 0.08783516704421887, -0.04540202882576813, 0.17157383398351042, 0.2056180949711756, 0.11770232650079823, 0.17626061610706606, -0.07477334898678546, -0.10493482139142368, -0.3774455397370014, -0.17467120430011804, -0.22114777071847322, 0.05538772421386192, -0.1044141308507762, -0.2157864175870658, 0.39278169451380507, 0.12266907147181398, 0.20175469475005695, 0.08797687651748036, 0.2381298098889021, 0.17480322422628153, 0.0327300600549008, 0.07286388208678468, 0.2688054786400592, 0.1437687297175797, 0.09416038181355342, -0.26728348774795835, 0.15267219368933124, 0.07293313045916643] |
1,802.04099 | Rortex A New Vortex Vector Definition and Vorticity Tensor and Vector
Decompositions | A vortex is intuitively recognized as the rotational/swirling motion of the
fluids. However, an unambiguous and universally-accepted definition for vortex
is yet to be achieved in the field of fluid mechanics, which is probably one of
the major obstacles causing considerable confusions and misunderstandings in
turbulence research. In our previous work, a new vector quantity which is
called vortex vector was proposed to accurately describe the local fluid
rotation and clearly display vortical structures. In this paper, the definition
of the vortex vector, named Rortex here, is revisited from the mathematical
perspective. The existence of the rotational axis is proved through real Schur
decomposition. Based on real Schur decomposition, a fast algorithm for
calculating Rortex is also presented. In addition, new vorticity tensor and
vector decompositions are introduced: the vorticity tensor is decomposed to a
rigidly rotational part and an anti-symmetric deformation part, and the
vorticity vector is decomposed to a rigidly rotational vector and a
non-rotational vector. Several cases, including 2D Couette flow, 2D rigid
rotational flow and 3D boundary layer transition on a flat plate, are studied
to demonstrate the justification of the definition of Rortex. It can be
observed that Rortex identifies both the precise swirling strength and the
rotational axis, and thus it can reasonably represent the local fluid rotation
and provide a new powerful tool for vortex dynamics and turbulence research.
| physics.flu-dyn | a vortex is intuitively recognized as the rotationalswirling motion of the fluids however an unambiguous and universallyaccepted definition for vortex is yet to be achieved in the field of fluid mechanics which is probably one of the major obstacles causing considerable confusions and misunderstandings in turbulence research in our previous work a new vector quantity which is called vortex vector was proposed to accurately describe the local fluid rotation and clearly display vortical structures in this paper the definition of the vortex vector named rortex here is revisited from the mathematical perspective the existence of the rotational axis is proved through real schur decomposition based on real schur decomposition a fast algorithm for calculating rortex is also presented in addition new vorticity tensor and vector decompositions are introduced the vorticity tensor is decomposed to a rigidly rotational part and an antisymmetric deformation part and the vorticity vector is decomposed to a rigidly rotational vector and a nonrotational vector several cases including 2d couette flow 2d rigid rotational flow and 3d boundary layer transition on a flat plate are studied to demonstrate the justification of the definition of rortex it can be observed that rortex identifies both the precise swirling strength and the rotational axis and thus it can reasonably represent the local fluid rotation and provide a new powerful tool for vortex dynamics and turbulence research | [['a', 'vortex', 'is', 'intuitively', 'recognized', 'as', 'the', 'rotationalswirling', 'motion', 'of', 'the', 'fluids', 'however', 'an', 'unambiguous', 'and', 'universallyaccepted', 'definition', 'for', 'vortex', 'is', 'yet', 'to', 'be', 'achieved', 'in', 'the', 'field', 'of', 'fluid', 'mechanics', 'which', 'is', 'probably', 'one', 'of', 'the', 'major', 'obstacles', 'causing', 'considerable', 'confusions', 'and', 'misunderstandings', 'in', 'turbulence', 'research', 'in', 'our', 'previous', 'work', 'a', 'new', 'vector', 'quantity', 'which', 'is', 'called', 'vortex', 'vector', 'was', 'proposed', 'to', 'accurately', 'describe', 'the', 'local', 'fluid', 'rotation', 'and', 'clearly', 'display', 'vortical', 'structures', 'in', 'this', 'paper', 'the', 'definition', 'of', 'the', 'vortex', 'vector', 'named', 'rortex', 'here', 'is', 'revisited', 'from', 'the', 'mathematical', 'perspective', 'the', 'existence', 'of', 'the', 'rotational', 'axis', 'is', 'proved', 'through', 'real', 'schur', 'decomposition', 'based', 'on', 'real', 'schur', 'decomposition', 'a', 'fast', 'algorithm', 'for', 'calculating', 'rortex', 'is', 'also', 'presented', 'in', 'addition', 'new', 'vorticity', 'tensor', 'and', 'vector', 'decompositions', 'are', 'introduced', 'the', 'vorticity', 'tensor', 'is', 'decomposed', 'to', 'a', 'rigidly', 'rotational', 'part', 'and', 'an', 'antisymmetric', 'deformation', 'part', 'and', 'the', 'vorticity', 'vector', 'is', 'decomposed', 'to', 'a', 'rigidly', 'rotational', 'vector', 'and', 'a', 'nonrotational', 'vector', 'several', 'cases', 'including', '2d', 'couette', 'flow', '2d', 'rigid', 'rotational', 'flow', 'and', '3d', 'boundary', 'layer', 'transition', 'on', 'a', 'flat', 'plate', 'are', 'studied', 'to', 'demonstrate', 'the', 'justification', 'of', 'the', 'definition', 'of', 'rortex', 'it', 'can', 'be', 'observed', 'that', 'rortex', 'identifies', 'both', 'the', 'precise', 'swirling', 'strength', 'and', 'the', 'rotational', 'axis', 'and', 'thus', 'it', 'can', 'reasonably', 'represent', 'the', 'local', 'fluid', 'rotation', 'and', 'provide', 'a', 'new', 'powerful', 'tool', 'for', 'vortex', 'dynamics', 'and', 'turbulence', 'research']] | [-0.1414100135417862, 0.13224946878966876, -0.10407618823150794, 0.02892216566329201, -0.1289880193086962, -0.10854398864631852, -0.0645636558972506, 0.34238444861852463, -0.2883212994766008, -0.2440892911552348, 0.09779698536472602, -0.1804816467066606, -0.15762679369913207, 0.17263028474938538, -0.052472783371146456, 0.04338539915987187, 0.026133232932123874, 0.02315523541959313, -0.02648181712979244, -0.15981443636585027, 0.2969348065979365, 0.016739831587506665, 0.31843538771279983, 0.04587052611918706, 0.11038702980615199, -0.05004583504878812, -0.047270573005080224, 0.05843529200963126, -0.12380073873601052, 0.11069065107239617, 0.2019570568419941, 0.09192353756063515, 0.21230329977969328, -0.414770168421997, -0.21026286962545582, 0.05652542292554345, 0.17046685858319202, 0.13927737896641096, -0.03365914381523099, -0.2832779615993301, 0.0727179134844078, -0.13859199197238517, -0.152772875510984, -0.1269272447998325, 0.08223403852691667, -0.015772820148720508, -0.24115135812614527, 0.09202233955768557, 0.10272884248548912, 0.09900514645295011, -0.10438453568973476, -0.08931629956389467, -0.06033257469431394, 0.08399672405897743, 0.07157066917719526, 0.10522645584100651, 0.12691198296534517, -0.13222955567037895, -0.09226912390026781, 0.43016080445713467, -0.040748155584765806, -0.25553536758447687, 0.16351159747793442, -0.10693989245014059, -0.08978274966486627, 0.13714470372431808, 0.15988932073944145, 0.09332835672630205, -0.10347227411758568, 0.01842378838505182, -0.08943563953404211, 0.11388487852385475, 0.07130994952206189, -0.032018185954334005, 0.257150892863671, 0.13258099907181328, 0.05108409254863444, 0.13179787948210206, -0.1204079344879008, -0.1214342337857104, -0.29349072402136195, -0.2023093150411215, -0.19288959600290076, 0.005237491224995918, -0.055002497911918906, -0.19139588536280724, 0.40741817572050626, 0.08459638262788455, 0.17179916604305617, -0.0045077226373056575, 0.3176150032743398, 0.08320570414471957, 0.060490102030129896, 0.10210272576866879, 0.2774147886203395, 0.21650577143662506, 0.13205544458081325, -0.1956672767808454, 0.030327028694252172, 0.10189366620913562] |
1,802.041 | Agile development for vulnerable populations: lessons learned and
recommendations | In this paper we draw attention to the challenges of managing software
projects for vulnerable populations, i.e., people potentially exposed to harm
or not capable of protecting their own interests. The focus on human aspects,
and particularly, the inclusion of human-centered approaches, has been a
popular topic in the software engineering community. We argue, however, that
current literature provides little understanding and guidance on how to
approach these type of scenarios. Here, we shed some light on the topic by
reporting on our experiences in developing innovative solutions for the
residential care scenario, outlining potential issues and recommendations.
| cs.CY | in this paper we draw attention to the challenges of managing software projects for vulnerable populations ie people potentially exposed to harm or not capable of protecting their own interests the focus on human aspects and particularly the inclusion of humancentered approaches has been a popular topic in the software engineering community we argue however that current literature provides little understanding and guidance on how to approach these type of scenarios here we shed some light on the topic by reporting on our experiences in developing innovative solutions for the residential care scenario outlining potential issues and recommendations | [['in', 'this', 'paper', 'we', 'draw', 'attention', 'to', 'the', 'challenges', 'of', 'managing', 'software', 'projects', 'for', 'vulnerable', 'populations', 'ie', 'people', 'potentially', 'exposed', 'to', 'harm', 'or', 'not', 'capable', 'of', 'protecting', 'their', 'own', 'interests', 'the', 'focus', 'on', 'human', 'aspects', 'and', 'particularly', 'the', 'inclusion', 'of', 'humancentered', 'approaches', 'has', 'been', 'a', 'popular', 'topic', 'in', 'the', 'software', 'engineering', 'community', 'we', 'argue', 'however', 'that', 'current', 'literature', 'provides', 'little', 'understanding', 'and', 'guidance', 'on', 'how', 'to', 'approach', 'these', 'type', 'of', 'scenarios', 'here', 'we', 'shed', 'some', 'light', 'on', 'the', 'topic', 'by', 'reporting', 'on', 'our', 'experiences', 'in', 'developing', 'innovative', 'solutions', 'for', 'the', 'residential', 'care', 'scenario', 'outlining', 'potential', 'issues', 'and', 'recommendations']] | [-0.07398117528230484, 0.03155329982080136, -0.054956487750596535, 0.0761858553266894, -0.17028655708596416, -0.16857652122401917, 0.09200553521062532, 0.4158182530853973, -0.19275441554812145, -0.32772075461831934, 0.13814240199518485, -0.3047961251220989, -0.20610239924815466, 0.23992415766436037, -0.1651179544634794, 0.027719921413428928, 0.08977086938459103, 0.006100680470010456, -0.013982310092874936, -0.2770651040826829, 0.34082073249321965, 0.06732650258226738, 0.3556973785779686, 0.11934186114302399, 0.028341922445735912, -0.006841670446173877, -0.1080432298821302, -0.02976495406723448, -0.10633688810917286, 0.187374199857004, 0.33745026293837904, 0.23079933915809936, 0.41106187172082004, -0.4912343869860075, -0.24837924236887876, 0.07336096894186066, 0.13555278599604356, 0.10003172455127446, -0.14512856627757453, -0.3078535929184445, 0.03770406714317446, -0.19352354693264529, -0.16396650125519657, -0.08042931102919487, 0.014962060355619356, -0.009078283058907077, -0.16435403076038524, -0.040338055828196585, 0.052862982995028854, 0.0818038691566991, -0.025003050164110502, -0.1360908508638148, 0.04372991080994585, 0.19779150584494049, 0.1360859498631076, -0.025245043510875226, 0.15398047958994854, -0.2074018695881134, -0.11401023072480433, 0.4164084409344561, 0.04408066479337155, -0.18860167867447042, 0.21550830356700687, -0.05526771047152579, -0.19567765758315825, 0.015658933099131196, 0.2435774536166644, 0.0618090307392294, -0.17165547776587156, 0.053947748941231555, 0.041417285448358376, 0.14619686356650627, -0.0010261542570054987, 0.03664061817226513, 0.26833338857799466, 0.23090411135356645, 0.01890703672733234, 0.07653702984145862, -0.012939642715666975, -0.11948053632881872, -0.18716080632174806, -0.10030762001881566, -0.08777417061489304, 0.014887183598315163, -0.0013642299367050755, -0.12893715672128434, 0.42681852437802875, 0.2612734464833475, 0.11334162045564806, -0.01194082464718697, 0.3369998131327483, -0.014906857384853445, 0.07100650114815074, 0.056576918513628144, 0.2129797347532039, -0.0035526968362950243, 0.17857245957402854, -0.1683684699421473, 0.1351063754670892, -0.041912523171940476] |
1,802.04101 | A New Approach for Higher Order Difference Equations and Eigenvalue
problems via Physical Potentials | In this study, we give the variation of parameters method from a different
viewpoint for the Nth order inhomogeneous linear ordinary difference equations
with constant coefficient by means of delta exponential function . Advantage of
this new approachment is to enable us to investigate the solution of difference
equations in the closed form. Also, the method is supported with three
difference eigenvalue problems, the second-order Sturm-Liouville problem, which
is called also one dimensional Schr\"odinger equation, having Coulomb
potential, hydrogen atom equation, and the fourth-order relaxation difference
equations. We find sum representation of solution for the second order discrete
Sturm-Liouville problem having Coulomb potential, hydrogen atom equation, and
analytical solution of the fourth order discrete relaxation problem by the
variation of parameters method via delta exponential and delta trigonometric
functions .
| math.CA | in this study we give the variation of parameters method from a different viewpoint for the nth order inhomogeneous linear ordinary difference equations with constant coefficient by means of delta exponential function advantage of this new approachment is to enable us to investigate the solution of difference equations in the closed form also the method is supported with three difference eigenvalue problems the secondorder sturmliouville problem which is called also one dimensional schrodinger equation having coulomb potential hydrogen atom equation and the fourthorder relaxation difference equations we find sum representation of solution for the second order discrete sturmliouville problem having coulomb potential hydrogen atom equation and analytical solution of the fourth order discrete relaxation problem by the variation of parameters method via delta exponential and delta trigonometric functions | [['in', 'this', 'study', 'we', 'give', 'the', 'variation', 'of', 'parameters', 'method', 'from', 'a', 'different', 'viewpoint', 'for', 'the', 'nth', 'order', 'inhomogeneous', 'linear', 'ordinary', 'difference', 'equations', 'with', 'constant', 'coefficient', 'by', 'means', 'of', 'delta', 'exponential', 'function', 'advantage', 'of', 'this', 'new', 'approachment', 'is', 'to', 'enable', 'us', 'to', 'investigate', 'the', 'solution', 'of', 'difference', 'equations', 'in', 'the', 'closed', 'form', 'also', 'the', 'method', 'is', 'supported', 'with', 'three', 'difference', 'eigenvalue', 'problems', 'the', 'secondorder', 'sturmliouville', 'problem', 'which', 'is', 'called', 'also', 'one', 'dimensional', 'schrodinger', 'equation', 'having', 'coulomb', 'potential', 'hydrogen', 'atom', 'equation', 'and', 'the', 'fourthorder', 'relaxation', 'difference', 'equations', 'we', 'find', 'sum', 'representation', 'of', 'solution', 'for', 'the', 'second', 'order', 'discrete', 'sturmliouville', 'problem', 'having', 'coulomb', 'potential', 'hydrogen', 'atom', 'equation', 'and', 'analytical', 'solution', 'of', 'the', 'fourth', 'order', 'discrete', 'relaxation', 'problem', 'by', 'the', 'variation', 'of', 'parameters', 'method', 'via', 'delta', 'exponential', 'and', 'delta', 'trigonometric', 'functions']] | [-0.10721402809571101, 0.035938591366325774, -0.07380376914589423, 0.045702841775455166, -0.10575609038195272, -0.12910762628335065, 0.009711606758023341, 0.299939255240212, -0.33188369846719457, -0.28651279152378323, 0.06637522612889041, -0.31917561185876214, -0.1520396700517575, 0.1449279285322024, 0.040715150080445246, 0.09779100045635122, 0.04513665265037026, 0.02938240266397713, -0.1216385853880151, -0.22174526092515687, 0.3636013781285192, -0.05830591977170602, 0.20229636128317183, 0.05438968461505541, 0.14238914055383112, -0.025981009688492367, 0.0050307515913283266, 0.007297245616929268, -0.16789664466146703, 0.11900833062919253, 0.21309297884939107, 0.025131958547803597, 0.3006173089351945, -0.39727808535832354, -0.19516445984917247, 0.12943230302340725, 0.13087638472683552, 0.11131519485745345, -0.045006678689007214, -0.2453403684537946, 0.01940406089663271, -0.15412180119113425, -0.21796275677496757, -0.052366451814946695, 0.032241422950664136, 0.06426928573706019, -0.3136793353602173, 0.1679133968863189, 0.026174130189547857, -0.007276609077990994, -0.11440535964935607, -0.12348513456252147, 0.05528901171628532, 0.04264384770388238, 0.036450165422911955, 0.001426819673424044, 0.0007145567430461955, -0.06807220655047255, -0.06215857551616477, 0.4074823639802928, -0.12512645097431088, -0.2788798948089907, 0.07585897395665955, -0.13973775049158205, -0.0750944037265401, 0.14837375817835097, 0.1374867850635934, 0.15642930440766017, -0.17048715492783803, 0.14666868806642472, 0.003000876198955408, 0.170447731602343, 0.1138287742482865, -0.0059473374748499844, 0.10170577128425123, 0.13063876539208436, 0.12512826256263326, 0.13380144031234378, -0.02056872187086975, -0.15143922289217435, -0.3073247073027562, -0.15592561387933615, -0.17938324830340824, 0.05677705402596025, -0.13931318537360077, -0.19661161651757847, 0.4006669631738428, 0.07618461728717502, 0.13417793044776427, 0.03584450807543398, 0.2677120172132657, 0.2864309649797171, 0.0010609488666614914, 0.0103760205531689, 0.17137626320395002, 0.19546801523547472, 0.09153132434699714, -0.31761657974273005, 0.012103423467052616, 0.19466268884634055] |
1,802.04102 | Advertising in the IoT Era: Vision and Challenges | The Internet of Things (IoT) extends the idea of interconnecting computers to
a plethora of different devices, collectively referred to as smart devices.
These are physical items - i.e., "things" - such as wearable devices, home
appliances, and vehicles, enriched with computational and networking
capabilities. Due to the huge set of devices involved - and therefore, its
pervasiveness - IoT is a great platform to leverage for building new
applications and services or extending existing ones. In this regard, expanding
online advertising into the IoT realm is an under-investigated yet promising
research direction, especially considering that traditional Internet
advertising market is already worth hundreds of billions of dollars. In this
paper, we first propose the architecture of an IoT advertising platform
inspired by the well-known business ecosystem, which the traditional Internet
advertising is based on. Additionally, we discuss the key challenges to
implement such a platform with a special focus on issues related to
architecture, advertisement content delivery, security, and privacy of the
users.
| cs.CY cs.SI | the internet of things iot extends the idea of interconnecting computers to a plethora of different devices collectively referred to as smart devices these are physical items ie things such as wearable devices home appliances and vehicles enriched with computational and networking capabilities due to the huge set of devices involved and therefore its pervasiveness iot is a great platform to leverage for building new applications and services or extending existing ones in this regard expanding online advertising into the iot realm is an underinvestigated yet promising research direction especially considering that traditional internet advertising market is already worth hundreds of billions of dollars in this paper we first propose the architecture of an iot advertising platform inspired by the wellknown business ecosystem which the traditional internet advertising is based on additionally we discuss the key challenges to implement such a platform with a special focus on issues related to architecture advertisement content delivery security and privacy of the users | [['the', 'internet', 'of', 'things', 'iot', 'extends', 'the', 'idea', 'of', 'interconnecting', 'computers', 'to', 'a', 'plethora', 'of', 'different', 'devices', 'collectively', 'referred', 'to', 'as', 'smart', 'devices', 'these', 'are', 'physical', 'items', 'ie', 'things', 'such', 'as', 'wearable', 'devices', 'home', 'appliances', 'and', 'vehicles', 'enriched', 'with', 'computational', 'and', 'networking', 'capabilities', 'due', 'to', 'the', 'huge', 'set', 'of', 'devices', 'involved', 'and', 'therefore', 'its', 'pervasiveness', 'iot', 'is', 'a', 'great', 'platform', 'to', 'leverage', 'for', 'building', 'new', 'applications', 'and', 'services', 'or', 'extending', 'existing', 'ones', 'in', 'this', 'regard', 'expanding', 'online', 'advertising', 'into', 'the', 'iot', 'realm', 'is', 'an', 'underinvestigated', 'yet', 'promising', 'research', 'direction', 'especially', 'considering', 'that', 'traditional', 'internet', 'advertising', 'market', 'is', 'already', 'worth', 'hundreds', 'of', 'billions', 'of', 'dollars', 'in', 'this', 'paper', 'we', 'first', 'propose', 'the', 'architecture', 'of', 'an', 'iot', 'advertising', 'platform', 'inspired', 'by', 'the', 'wellknown', 'business', 'ecosystem', 'which', 'the', 'traditional', 'internet', 'advertising', 'is', 'based', 'on', 'additionally', 'we', 'discuss', 'the', 'key', 'challenges', 'to', 'implement', 'such', 'a', 'platform', 'with', 'a', 'special', 'focus', 'on', 'issues', 'related', 'to', 'architecture', 'advertisement', 'content', 'delivery', 'security', 'and', 'privacy', 'of', 'the', 'users']] | [-0.17061319139029366, 0.016248785973766645, 0.0186656586243771, 0.014227010352988146, -0.20166796763805905, -0.1933425731229363, 0.06912675394050893, 0.37288946997141464, -0.2932918264414184, -0.3262548082275316, 0.13251164759931272, -0.3336915811014478, -0.2081084101650049, 0.25290534946689147, -0.17304253794354735, 0.055646180657277, 0.013501631611143238, 0.011991860883426853, 0.04457464110600995, -0.2992077202856308, 0.29914507129287815, 0.03496676147333346, 0.3807041901731282, 0.09702299301861786, 0.04377448580926284, -0.02652145286047016, -0.04612023324589245, -0.03651094044034835, -0.06574357962913382, 0.22906293858832213, 0.3669764410937205, 0.21936131679008214, 0.42028325285646134, -0.4721962785348296, -0.19436208434053698, 0.0914305871920078, 0.18564880108606302, 0.03349249948269062, -0.11428583843953674, -0.3554176340287086, 0.10416995359701105, -0.3015191602622508, -0.10036327370016807, -0.061840464104898275, 0.026742796117105172, 0.0580965799104888, -0.18796138411271385, -0.09363408125645947, -0.049142877467602375, 0.047494133230065926, -0.0026383391432318604, -0.06668657747795806, 0.030276253634656313, 0.1887135146811488, 0.07999104748596438, -0.05457006235665176, 0.20987508094694932, -0.17748213455779477, -0.17075510677241254, 0.43033177048200744, 0.0671636306309665, -0.09592955585103483, 0.19193558398546884, 0.012429023224467529, -0.1490182289031509, 0.024441205210314364, 0.24458302431739867, 0.06064841429179069, -0.22537687950825785, 0.049907035508294936, 0.021269747117185035, 0.1427179109028657, 0.011147288419306279, 0.10650241391558665, 0.22511364161618985, 0.29642705957521687, 0.15099140862439525, 0.0934733413392678, 0.010805688440450467, -0.11183581836667145, -0.17250084290499218, -0.2084409761999268, -0.17068666229606605, 0.05792509229213465, -0.0894300254522932, -0.13801155225301046, 0.3698491079667292, 0.2310040092386771, 0.12769280043721665, 0.005231302168976981, 0.4180242834147066, -0.012920454462346243, 0.15802327610144856, 0.11525622768967878, 0.1252545470953919, -0.031452519602316896, 0.28216756344772875, -0.08296117958088871, 0.09709951124968938, -0.03082836717894679] |
1,802.04103 | Ethical and Social Aspects of Self-Driving Cars | As an envisaged future of transportation, self-driving cars are being
discussed from various perspectives, including social, economical, engineering,
computer science, design, and ethics. On the one hand, self-driving cars
present new engineering problems that are being gradually successfully solved.
On the other hand, social and ethical problems are typically being presented in
the form of an idealized unsolvable decision-making problem, the so-called
trolley problem, which is grossly misleading. We argue that an applied
engineering ethical approach for the development of new technology is what is
needed; the approach should be applied, meaning that it should focus on the
analysis of complex real-world engineering problems. Software plays a crucial
role for the control of self-driving cars; therefore, software engineering
solutions should seriously handle ethical and social considerations. In this
paper we take a closer look at the regulative instruments, standards, design,
and implementations of components, systems, and services and we present
practical social and ethical challenges that have to be met, as well as novel
expectations for software engineering.
| cs.CY | as an envisaged future of transportation selfdriving cars are being discussed from various perspectives including social economical engineering computer science design and ethics on the one hand selfdriving cars present new engineering problems that are being gradually successfully solved on the other hand social and ethical problems are typically being presented in the form of an idealized unsolvable decisionmaking problem the socalled trolley problem which is grossly misleading we argue that an applied engineering ethical approach for the development of new technology is what is needed the approach should be applied meaning that it should focus on the analysis of complex realworld engineering problems software plays a crucial role for the control of selfdriving cars therefore software engineering solutions should seriously handle ethical and social considerations in this paper we take a closer look at the regulative instruments standards design and implementations of components systems and services and we present practical social and ethical challenges that have to be met as well as novel expectations for software engineering | [['as', 'an', 'envisaged', 'future', 'of', 'transportation', 'selfdriving', 'cars', 'are', 'being', 'discussed', 'from', 'various', 'perspectives', 'including', 'social', 'economical', 'engineering', 'computer', 'science', 'design', 'and', 'ethics', 'on', 'the', 'one', 'hand', 'selfdriving', 'cars', 'present', 'new', 'engineering', 'problems', 'that', 'are', 'being', 'gradually', 'successfully', 'solved', 'on', 'the', 'other', 'hand', 'social', 'and', 'ethical', 'problems', 'are', 'typically', 'being', 'presented', 'in', 'the', 'form', 'of', 'an', 'idealized', 'unsolvable', 'decisionmaking', 'problem', 'the', 'socalled', 'trolley', 'problem', 'which', 'is', 'grossly', 'misleading', 'we', 'argue', 'that', 'an', 'applied', 'engineering', 'ethical', 'approach', 'for', 'the', 'development', 'of', 'new', 'technology', 'is', 'what', 'is', 'needed', 'the', 'approach', 'should', 'be', 'applied', 'meaning', 'that', 'it', 'should', 'focus', 'on', 'the', 'analysis', 'of', 'complex', 'realworld', 'engineering', 'problems', 'software', 'plays', 'a', 'crucial', 'role', 'for', 'the', 'control', 'of', 'selfdriving', 'cars', 'therefore', 'software', 'engineering', 'solutions', 'should', 'seriously', 'handle', 'ethical', 'and', 'social', 'considerations', 'in', 'this', 'paper', 'we', 'take', 'a', 'closer', 'look', 'at', 'the', 'regulative', 'instruments', 'standards', 'design', 'and', 'implementations', 'of', 'components', 'systems', 'and', 'services', 'and', 'we', 'present', 'practical', 'social', 'and', 'ethical', 'challenges', 'that', 'have', 'to', 'be', 'met', 'as', 'well', 'as', 'novel', 'expectations', 'for', 'software', 'engineering']] | [-0.09095851124619089, 0.07672368141174957, -0.06633436257418777, 0.0869287115347106, -0.14878427389232587, -0.19127187532527992, -0.011802591113900278, 0.3879340165738194, -0.27211927192097174, -0.3229014134239627, 0.18157588040014075, -0.2678197510692934, -0.21993409859992208, 0.2728041212179787, -0.1302246599807404, 0.07086189346487767, 0.09395162679027722, -0.029456580203259364, 0.011525030278356834, -0.22662699674990672, 0.3087061512633227, 0.033382457603390016, 0.34811853826561545, 0.09928015064880517, 0.03247335818984235, 0.00838078996769452, -0.0035943661472022845, 0.01113660430738015, -0.07912319590174038, 0.16887445915130056, 0.39091303004395395, 0.2364871762388031, 0.39998373545018867, -0.45696688200613217, -0.21148552210070193, 0.06771002991479777, 0.15800334273565872, 0.0708674637460804, -0.05655132115255886, -0.3044136698313412, 0.0392633092688768, -0.18960618438930915, -0.15055179275527952, -0.08408005585564145, 0.005988524927358542, -0.004301415491638528, -0.20244353315328703, -0.0448354985419428, 0.023583919964342687, 0.10817079932340198, -0.03885107105209803, -0.15001105419304667, 0.03357229105521193, 0.19559768224800272, 0.060119008707780655, -0.012603945398171033, 0.18580914014906047, -0.18547380099577518, -0.1694696217475991, 0.47955325899446116, 0.08488268031422715, -0.18175106381420933, 0.19446178592763663, 0.007610494415054009, -0.20958467973728798, 0.003359160513528401, 0.25023691470795756, 0.06699561790308162, -0.1825468004747, 0.03730798450366516, 0.02305768918900174, 0.1320360262061946, 0.021708226902687568, -0.0005418990027205187, 0.21928301423377844, 0.2259120631261751, 0.10544646945964771, 0.06616246033566615, 0.020768784511823297, -0.0997342787173, -0.2547654990727703, -0.14361194463812613, -0.12272832007216666, 0.034761382106808014, -0.051527747086895816, -0.12186130777713731, 0.3113605479880962, 0.24884757501006657, 0.08766429070549618, -0.029845286640920676, 0.3385704921425453, 0.09075917810038109, 0.07485948127162244, 0.04842305735274706, 0.2352278218272009, 0.0009080682204858888, 0.19934351605618195, -0.13775645296638167, 0.1201547018440795, -0.03562924229551018] |
1,802.04104 | Driving Simulator Platform for Development and Evaluation of Safety and
Emergency Systems | According to data from the United Nations, more than 3000 people have died
each day in the world due to road traffic collision. Considering recent
researches, the human error may be considered as the main responsible for these
fatalities. Because of this, researchers seek alternatives to transfer the
vehicle control from people to autonomous systems. However, providing this
technological innovation for the people may demand complex challenges in the
legal, economic and technological areas. Consequently, carmakers and
researchers have divided the driving automation in safety and emergency systems
that improve the driver perception on the road. This may reduce the human
error. Therefore, the main contribution of this study is to propose a driving
simulator platform to develop and evaluate safety and emergency systems, in the
first design stage. This driving simulator platform has an advantage: a
flexible software structure.This allows in the simulation one adaptation for
development or evaluation of a system. The proposed driving simulator platform
was tested in two applications: cooperative vehicle system development and the
influence evaluation of a Driving Assistance System (\textit{DAS}) on a driver.
In the cooperative vehicle system development, the results obtained show that
the increment of the time delay in the communication among vehicles ($V2V$) is
determinant for the system performance. On the other hand, in the influence
evaluation of a \textit{DAS} in a driver, it was possible to conclude that the
\textit{DAS'} model does not have the level of influence necessary in a driver
to avoid an accident.
| cs.CY cs.RO | according to data from the united nations more than 3000 people have died each day in the world due to road traffic collision considering recent researches the human error may be considered as the main responsible for these fatalities because of this researchers seek alternatives to transfer the vehicle control from people to autonomous systems however providing this technological innovation for the people may demand complex challenges in the legal economic and technological areas consequently carmakers and researchers have divided the driving automation in safety and emergency systems that improve the driver perception on the road this may reduce the human error therefore the main contribution of this study is to propose a driving simulator platform to develop and evaluate safety and emergency systems in the first design stage this driving simulator platform has an advantage a flexible software structurethis allows in the simulation one adaptation for development or evaluation of a system the proposed driving simulator platform was tested in two applications cooperative vehicle system development and the influence evaluation of a driving assistance system textitdas on a driver in the cooperative vehicle system development the results obtained show that the increment of the time delay in the communication among vehicles v2v is determinant for the system performance on the other hand in the influence evaluation of a textitdas in a driver it was possible to conclude that the textitdas model does not have the level of influence necessary in a driver to avoid an accident | [['according', 'to', 'data', 'from', 'the', 'united', 'nations', 'more', 'than', '3000', 'people', 'have', 'died', 'each', 'day', 'in', 'the', 'world', 'due', 'to', 'road', 'traffic', 'collision', 'considering', 'recent', 'researches', 'the', 'human', 'error', 'may', 'be', 'considered', 'as', 'the', 'main', 'responsible', 'for', 'these', 'fatalities', 'because', 'of', 'this', 'researchers', 'seek', 'alternatives', 'to', 'transfer', 'the', 'vehicle', 'control', 'from', 'people', 'to', 'autonomous', 'systems', 'however', 'providing', 'this', 'technological', 'innovation', 'for', 'the', 'people', 'may', 'demand', 'complex', 'challenges', 'in', 'the', 'legal', 'economic', 'and', 'technological', 'areas', 'consequently', 'carmakers', 'and', 'researchers', 'have', 'divided', 'the', 'driving', 'automation', 'in', 'safety', 'and', 'emergency', 'systems', 'that', 'improve', 'the', 'driver', 'perception', 'on', 'the', 'road', 'this', 'may', 'reduce', 'the', 'human', 'error', 'therefore', 'the', 'main', 'contribution', 'of', 'this', 'study', 'is', 'to', 'propose', 'a', 'driving', 'simulator', 'platform', 'to', 'develop', 'and', 'evaluate', 'safety', 'and', 'emergency', 'systems', 'in', 'the', 'first', 'design', 'stage', 'this', 'driving', 'simulator', 'platform', 'has', 'an', 'advantage', 'a', 'flexible', 'software', 'structurethis', 'allows', 'in', 'the', 'simulation', 'one', 'adaptation', 'for', 'development', 'or', 'evaluation', 'of', 'a', 'system', 'the', 'proposed', 'driving', 'simulator', 'platform', 'was', 'tested', 'in', 'two', 'applications', 'cooperative', 'vehicle', 'system', 'development', 'and', 'the', 'influence', 'evaluation', 'of', 'a', 'driving', 'assistance', 'system', 'textitdas', 'on', 'a', 'driver', 'in', 'the', 'cooperative', 'vehicle', 'system', 'development', 'the', 'results', 'obtained', 'show', 'that', 'the', 'increment', 'of', 'the', 'time', 'delay', 'in', 'the', 'communication', 'among', 'vehicles', 'v2v', 'is', 'determinant', 'for', 'the', 'system', 'performance', 'on', 'the', 'other', 'hand', 'in', 'the', 'influence', 'evaluation', 'of', 'a', 'textitdas', 'in', 'a', 'driver', 'it', 'was', 'possible', 'to', 'conclude', 'that', 'the', 'textitdas', 'model', 'does', 'not', 'have', 'the', 'level', 'of', 'influence', 'necessary', 'in', 'a', 'driver', 'to', 'avoid', 'an', 'accident']] | [-0.15137045232179702, 0.05514603569581669, -0.07559600126800861, 0.033263586374942394, -0.067275392050605, -0.15168734164757094, 0.05377032241984687, 0.36200885623466317, -0.20499832114219907, -0.32655273910945026, 0.12861353320654528, -0.2569558770894248, -0.17858599868084388, 0.25275337548616034, -0.15022559315761233, 0.05826101561523671, 0.09402810619070717, 0.05280439482861751, 0.03590407873890968, -0.24827449233649768, 0.263514665210983, 0.0537258669794575, 0.3365376640103636, 0.08516752686563546, 0.06785155473767006, -0.007917145241574362, -0.026092673740368638, -0.046903655961104074, -0.054706194082139455, 0.1449296252169775, 0.31371572026150013, 0.18174105834564178, 0.38646726439161816, -0.45195501995447085, -0.23120482054035504, 0.09684990301379949, 0.12347802881348302, 0.07176674854831876, -0.032996346508505345, -0.3229086988234544, 0.05677856945970315, -0.23895025587209115, -0.134586177323377, -0.026655837363465044, 0.038308318478634536, 0.028321403719019145, -0.2585653513158876, -0.03696569584582637, 0.016541184844237153, 0.08986474156788574, -0.06747992010242912, -0.05601347439753922, 0.008345588901632927, 0.2450639304005289, 0.061789259743759394, 0.024204607916322944, 0.18046601525151995, -0.16962698743343463, -0.1444475223980863, 0.40928027628943686, 0.014255037249623877, -0.1645613880298002, 0.20332741825644385, -0.08320478113686167, -0.13416304183949723, 0.0823056808515732, 0.2495368609888237, 0.029197840762089908, -0.20382904493613396, -0.02178414868014842, 0.040320530611400805, 0.16063661828288825, 0.021473526956543813, -0.015785514021186324, 0.1897810773073475, 0.24545282075878203, 0.11081484475691719, 0.09721286830845349, -0.05534200507549312, -0.11422505037839206, -0.22618095692184687, -0.17210556167685162, -0.1384758073879156, 0.01719746928255318, -0.03616455101421788, -0.10766973964987338, 0.388992189550848, 0.24741740125975367, 0.09813694828719931, 0.019133617114313554, 0.3522736648839664, 0.06710595553442722, 0.10669692613494892, 0.07753644802236581, 0.21460851055013425, -0.012273784271607979, 0.188413624507394, -0.2367729408263297, 0.14243442209284163, -0.004623026290825167] |
1,802.04105 | Scalable Architecture for Personalized Healthcare Service Recommendation
using Big Data Lake | The personalized health care service utilizes the relational patient data and
big data analytics to tailor the medication recommendations. However, most of
the health care data are in unstructured form and it consumes a lot of time and
effort to pull them into relational form. This study proposes a novel data lake
architecture to reduce the data ingestion time and improve the precision of
healthcare analytics. It also removes the data silos and enhances the analytics
by allowing the connectivity to the third-party data providers (such as
clinical lab results, chemist, insurance company,etc.). The data lake
architecture uses the Hadoop Distributed File System (HDFS) to provide the
storage for both structured and unstructured data. This study uses K-means
clustering algorithm to find the patient clusters with similar health
conditions. Subsequently, it employs a support vector machine to find the most
successful healthcare recommendations for the each cluster. Our experiment
results demonstrate the ability of data lake to reduce the time for ingesting
data from various data vendors regardless of its format. Moreover, it is
evident that the data lake poses the potential to generate clusters of patients
more precisely than the existing approaches. It is obvious that the data lake
provides a unified storage location for the data in its native format. It can
also improve the personalized healthcare medication recommendations by removing
the data silos.
| cs.CY | the personalized health care service utilizes the relational patient data and big data analytics to tailor the medication recommendations however most of the health care data are in unstructured form and it consumes a lot of time and effort to pull them into relational form this study proposes a novel data lake architecture to reduce the data ingestion time and improve the precision of healthcare analytics it also removes the data silos and enhances the analytics by allowing the connectivity to the thirdparty data providers such as clinical lab results chemist insurance companyetc the data lake architecture uses the hadoop distributed file system hdfs to provide the storage for both structured and unstructured data this study uses kmeans clustering algorithm to find the patient clusters with similar health conditions subsequently it employs a support vector machine to find the most successful healthcare recommendations for the each cluster our experiment results demonstrate the ability of data lake to reduce the time for ingesting data from various data vendors regardless of its format moreover it is evident that the data lake poses the potential to generate clusters of patients more precisely than the existing approaches it is obvious that the data lake provides a unified storage location for the data in its native format it can also improve the personalized healthcare medication recommendations by removing the data silos | [['the', 'personalized', 'health', 'care', 'service', 'utilizes', 'the', 'relational', 'patient', 'data', 'and', 'big', 'data', 'analytics', 'to', 'tailor', 'the', 'medication', 'recommendations', 'however', 'most', 'of', 'the', 'health', 'care', 'data', 'are', 'in', 'unstructured', 'form', 'and', 'it', 'consumes', 'a', 'lot', 'of', 'time', 'and', 'effort', 'to', 'pull', 'them', 'into', 'relational', 'form', 'this', 'study', 'proposes', 'a', 'novel', 'data', 'lake', 'architecture', 'to', 'reduce', 'the', 'data', 'ingestion', 'time', 'and', 'improve', 'the', 'precision', 'of', 'healthcare', 'analytics', 'it', 'also', 'removes', 'the', 'data', 'silos', 'and', 'enhances', 'the', 'analytics', 'by', 'allowing', 'the', 'connectivity', 'to', 'the', 'thirdparty', 'data', 'providers', 'such', 'as', 'clinical', 'lab', 'results', 'chemist', 'insurance', 'companyetc', 'the', 'data', 'lake', 'architecture', 'uses', 'the', 'hadoop', 'distributed', 'file', 'system', 'hdfs', 'to', 'provide', 'the', 'storage', 'for', 'both', 'structured', 'and', 'unstructured', 'data', 'this', 'study', 'uses', 'kmeans', 'clustering', 'algorithm', 'to', 'find', 'the', 'patient', 'clusters', 'with', 'similar', 'health', 'conditions', 'subsequently', 'it', 'employs', 'a', 'support', 'vector', 'machine', 'to', 'find', 'the', 'most', 'successful', 'healthcare', 'recommendations', 'for', 'the', 'each', 'cluster', 'our', 'experiment', 'results', 'demonstrate', 'the', 'ability', 'of', 'data', 'lake', 'to', 'reduce', 'the', 'time', 'for', 'ingesting', 'data', 'from', 'various', 'data', 'vendors', 'regardless', 'of', 'its', 'format', 'moreover', 'it', 'is', 'evident', 'that', 'the', 'data', 'lake', 'poses', 'the', 'potential', 'to', 'generate', 'clusters', 'of', 'patients', 'more', 'precisely', 'than', 'the', 'existing', 'approaches', 'it', 'is', 'obvious', 'that', 'the', 'data', 'lake', 'provides', 'a', 'unified', 'storage', 'location', 'for', 'the', 'data', 'in', 'its', 'native', 'format', 'it', 'can', 'also', 'improve', 'the', 'personalized', 'healthcare', 'medication', 'recommendations', 'by', 'removing', 'the', 'data', 'silos']] | [-0.051750962996544934, 0.006023236075933609, -0.07992013529408723, 0.0774667906264464, -0.14813794201964306, -0.1517291634819574, 0.08874328627147608, 0.3694670199230313, -0.26006286084755426, -0.3509306648539172, 0.13989923128444287, -0.3566663012932986, -0.090471796873543, 0.19369567842947114, -0.13279930715656116, 0.0733868624854626, 0.1519351622237203, 0.05069982403488312, -0.0028878886469950278, -0.31543055312087137, 0.2702433608322301, 0.09712587486538622, 0.39029571298302873, 0.036968874586228696, 0.04981882593491011, 0.01727300907485187, -0.06282401582847039, -0.06441424614128967, -0.07027266144060478, 0.1519190830163037, 0.3769140763663583, 0.29985454080005486, 0.3256452004445924, -0.4691296760882768, -0.17327997085586605, 0.07447094973176718, 0.09820311188723685, 0.095900328349736, -0.08305888852240363, -0.3216419531984462, 0.08201008841084938, -0.18768887526666125, -0.10015905137173832, -0.12311838418969677, -0.006139282317211231, -0.00762755660003879, -0.2932026063733631, 0.03394112610749694, -0.013998575009172782, 0.05479399672192004, -0.07668616922882696, -0.09522870601284214, -0.04722404946210897, 0.1924791001362933, 0.05050233804323297, 0.041785085457894534, 0.17498129414601457, -0.1269117063953955, -0.0789819916896522, 0.413519709026441, 0.034074832004068106, -0.13449548568162653, 0.14983802317434716, -0.051386191823645885, -0.15548894328789578, 0.08651125016932686, 0.2427911061912568, 9.54860717886024e-05, -0.2420033960706658, 0.02654483203931401, -9.402248025354413e-06, 0.1715300652384758, 0.020084303613338204, -0.036272558983829285, 0.13910598987247794, 0.24375899867051176, 0.06011683543937074, 0.10469329074283855, -0.10030059784974178, -0.059176991478436525, -0.16645124034335215, -0.16441948973056342, -0.14480587750052412, -0.03651636102650729, -0.13843324522138573, -0.15867359379099474, 0.3574884021220108, 0.22670772512236403, 0.15659011708158585, 0.04714766120745076, 0.3647267925325367, -0.002890449199411604, 0.17093798626421228, 0.11012050159482492, 0.09076284622980489, -0.03675541709073716, 0.2352495803601212, -0.17925175562811393, 0.10994250493007712, -0.08194115033683677] |
1,802.04106 | Recent progress in subset combinatorics of groups | We systematize and analyze some results obtained in Subset Combinatorics of
$G$ groups after publications the previous surveys [1-4]. The main topics: the
dynamical and descriptive characterizations of subsets of a group relatively
their combinatorial size, Ramsey-product subsets in connection with some
general concept of recurrence in $G$-spaces, new ideals in the Boolean algebra
$\mathcal{P}_{G}$ of all subsets of a group $G$ and in the Stone-$\check{C}$ech
compactification $\beta G$ of $G$ , the combinatorial derivation.
| math.CO math.GR | we systematize and analyze some results obtained in subset combinatorics of g groups after publications the previous surveys 14 the main topics the dynamical and descriptive characterizations of subsets of a group relatively their combinatorial size ramseyproduct subsets in connection with some general concept of recurrence in gspaces new ideals in the boolean algebra mathcalp_g of all subsets of a group g and in the stonecheckcech compactification beta g of g the combinatorial derivation | [['we', 'systematize', 'and', 'analyze', 'some', 'results', 'obtained', 'in', 'subset', 'combinatorics', 'of', 'g', 'groups', 'after', 'publications', 'the', 'previous', 'surveys', '14', 'the', 'main', 'topics', 'the', 'dynamical', 'and', 'descriptive', 'characterizations', 'of', 'subsets', 'of', 'a', 'group', 'relatively', 'their', 'combinatorial', 'size', 'ramseyproduct', 'subsets', 'in', 'connection', 'with', 'some', 'general', 'concept', 'of', 'recurrence', 'in', 'gspaces', 'new', 'ideals', 'in', 'the', 'boolean', 'algebra', 'mathcalp_g', 'of', 'all', 'subsets', 'of', 'a', 'group', 'g', 'and', 'in', 'the', 'stonecheckcech', 'compactification', 'beta', 'g', 'of', 'g', 'the', 'combinatorial', 'derivation']] | [-0.1631009856622817, 0.07492665550671518, -0.0800152168156126, 0.07455298421602394, -0.13396293870676812, -0.05931055463529569, 0.09767069175958985, 0.3328239541450465, -0.309342685684159, -0.2640639909360608, 0.09833561097164764, -0.280551901061994, -0.11614845238777029, 0.20084863850796544, -0.15930788153530778, -0.030633633478066406, 0.05609184784210614, 0.09382775269851491, -0.07599534909535872, -0.29155005502036296, 0.36540282332350976, -0.040434912142872405, 0.18711299779573204, -0.016525598343562434, 0.035895896068698654, 0.0005701102026914423, -0.12543496108815275, 0.04426773265004158, -0.21785080761371836, 0.12286661851937203, 0.28945965042992217, 0.16190112825181033, 0.2696865232334145, -0.354776679962949, -0.13329088432412292, 0.1460888449643814, 0.09462293684860137, -0.020478164122716802, -0.009368259547832044, -0.2748044242836988, 0.07347969931072078, -0.16499955729562538, -0.11404361758173469, -0.026009910288455618, 0.14347697283468536, 0.06189519918926463, -0.19000936051786602, -0.03163918026571942, 0.07224694498920045, 0.13582246680743992, -0.026527752161987214, -0.18450479076489354, -0.014720561904706867, 0.1008524546097662, -0.010797317240487886, 0.03432078906209082, 0.08232398671601471, -0.10846451309987822, -0.148842479630902, 0.37205037824507503, -0.00676604441675433, -0.1655281803293808, 0.14248917745174589, -0.23336811714830832, -0.2819923727924155, 0.0830470569607978, 0.0971615654038819, 0.1415915209548296, -0.08837421136480328, 0.17445974187009866, -0.15099085893205091, 0.058720541841073615, 0.07931276993523981, 0.07602250340435579, 0.12334382907185401, 0.13428487618629997, 0.03735545462601491, 0.14044043859403982, 0.053879632614552975, 0.03620934174899515, -0.35654612789182244, -0.10180940432474017, -0.12533691730130012, 0.09864690966551772, -0.1833312953753488, -0.17627038376569445, 0.440307004981347, 0.08446582999533496, 0.16387670522404685, 0.1090350012748024, 0.16718648563491534, -0.021695684717112296, 0.044299672316835334, 0.05885836062008968, 0.07717335289989195, 0.28176980294488574, -0.0431567938067019, -0.14142694698042563, -0.0335769344866905, 0.19411763578426797] |
1,802.04107 | p-Laplacian Fractional Sturm-Liouville Problem for Diffusion Operator
via Impulsive Condition | In this study, the existence results of solution is given for fractional
p-Laplacian Stum-Liouville problem for diffusion operator of order with
impulsive conditions. The derivatives are described in Riemann-Liouville and
Caputo sense. The Riemann-Liouville integral operator is used to acquire the
integral representation of solution. The existence of solution is demonstrate
via Schaefer fixed point theorem.
| math.CA | in this study the existence results of solution is given for fractional plaplacian stumliouville problem for diffusion operator of order with impulsive conditions the derivatives are described in riemannliouville and caputo sense the riemannliouville integral operator is used to acquire the integral representation of solution the existence of solution is demonstrate via schaefer fixed point theorem | [['in', 'this', 'study', 'the', 'existence', 'results', 'of', 'solution', 'is', 'given', 'for', 'fractional', 'plaplacian', 'stumliouville', 'problem', 'for', 'diffusion', 'operator', 'of', 'order', 'with', 'impulsive', 'conditions', 'the', 'derivatives', 'are', 'described', 'in', 'riemannliouville', 'and', 'caputo', 'sense', 'the', 'riemannliouville', 'integral', 'operator', 'is', 'used', 'to', 'acquire', 'the', 'integral', 'representation', 'of', 'solution', 'the', 'existence', 'of', 'solution', 'is', 'demonstrate', 'via', 'schaefer', 'fixed', 'point', 'theorem']] | [-0.14512142263860864, 0.0014188225889070467, -0.07637027756057002, 0.05994373503225771, -0.14052870114418595, -0.0937357599762353, -0.04068406444381584, 0.324437460235574, -0.3088101563128558, -0.24639448259364474, 0.19933544581502, -0.3086191025308587, -0.16534732783382589, 0.15187719210304998, -0.09724450326863338, 0.07861213650215756, 0.06230067324570634, 0.041045683063566686, -0.05948788450861519, -0.19670214490457014, 0.37793385684490205, -0.07074603611095386, 0.16277780344879086, 0.04328935992988673, 0.15454580435021356, -0.03829148827459324, -0.055213299664584076, -0.05129345486109907, -0.15162731638940222, 0.08601290293842215, 0.25688976164568555, 0.020294067399068312, 0.3277874721044844, -0.3967378278855573, -0.18541712974282828, 0.10424509223772806, 0.09427960228005594, -0.016551208157430997, -0.04187431083145467, -0.32798536589199845, 0.11408253025094217, -0.10062055448916825, -0.23504248556934976, -0.09059778524732048, 0.010840963504531167, 0.04974548223597759, -0.35182344540953636, 0.16550035513937472, 0.06578602994030172, -0.002524012394926765, -0.20047357498075474, -0.10141995857385072, 0.030465660041028804, 0.048479327915067025, 0.057507021602412514, 0.0004956748717549173, 0.025062969225374133, -0.12304752328094434, -0.15693682019217786, 0.34816320999102157, -0.1076043723764914, -0.30294037117538125, 0.07341582590544765, -0.16992028608113866, -0.06530509605495767, 0.11991098362275145, 0.07032182969322259, 0.2080172422426668, -0.1997548968615857, 0.15619324001983675, -0.02631802555512298, 0.07921542813419365, 0.117327807886018, 0.0317187128175812, 0.06023233190856197, 0.1496959661726247, 0.19170930167152123, 0.13452406544661658, 0.007599571787498214, -0.17703044604171406, -0.3654448662461205, -0.23307835176925767, -0.2189771994948387, 0.06167281823740764, -0.10860983598104212, -0.20180182023481888, 0.33590818870685657, 0.16459959981624375, 0.09355699320493097, 0.05540190620178526, 0.19776085911064661, 0.30608315958895466, -0.02310000327839093, 0.04602088688618757, 0.15798464864492417, 0.17384072229350833, 0.19742180096324194, -0.23009017674591054, 0.04631278515285389, 0.28187395550987937] |
1,802.04108 | Design a multicultural blended e-learning system | Most universities in developing countries are using a teaching and learning
approach known as blended e-learning, however, there was no multicultural-based
blended e-learning framework. Furthermore, there is no research to show the
impact of multicultural blended e-learning on satisfaction of learners. This
research employed two categories of students, the Iranian students and the
Iraqi students studying at Razi University of Iran. These two groups were
taught using the multicultural blended e-learning approach. We utilized an open
source application named Claroline. Questionnaires were designed and
administered to students to collect information about the level of satisfaction
and the optimal mix of tools that go into blended multicultural-based
e-learning. The collected information was analyzed using SPSS. We found that
blended multicultural based e-learning improves the level of satisfaction of
learners. In addition, the optimal mix of multicultural blended learning should
be comprised 19% still pictures, audio files 23%, video files 31% and text
files 27%.
| cs.CY | most universities in developing countries are using a teaching and learning approach known as blended elearning however there was no multiculturalbased blended elearning framework furthermore there is no research to show the impact of multicultural blended elearning on satisfaction of learners this research employed two categories of students the iranian students and the iraqi students studying at razi university of iran these two groups were taught using the multicultural blended elearning approach we utilized an open source application named claroline questionnaires were designed and administered to students to collect information about the level of satisfaction and the optimal mix of tools that go into blended multiculturalbased elearning the collected information was analyzed using spss we found that blended multicultural based elearning improves the level of satisfaction of learners in addition the optimal mix of multicultural blended learning should be comprised 19 still pictures audio files 23 video files 31 and text files 27 | [['most', 'universities', 'in', 'developing', 'countries', 'are', 'using', 'a', 'teaching', 'and', 'learning', 'approach', 'known', 'as', 'blended', 'elearning', 'however', 'there', 'was', 'no', 'multiculturalbased', 'blended', 'elearning', 'framework', 'furthermore', 'there', 'is', 'no', 'research', 'to', 'show', 'the', 'impact', 'of', 'multicultural', 'blended', 'elearning', 'on', 'satisfaction', 'of', 'learners', 'this', 'research', 'employed', 'two', 'categories', 'of', 'students', 'the', 'iranian', 'students', 'and', 'the', 'iraqi', 'students', 'studying', 'at', 'razi', 'university', 'of', 'iran', 'these', 'two', 'groups', 'were', 'taught', 'using', 'the', 'multicultural', 'blended', 'elearning', 'approach', 'we', 'utilized', 'an', 'open', 'source', 'application', 'named', 'claroline', 'questionnaires', 'were', 'designed', 'and', 'administered', 'to', 'students', 'to', 'collect', 'information', 'about', 'the', 'level', 'of', 'satisfaction', 'and', 'the', 'optimal', 'mix', 'of', 'tools', 'that', 'go', 'into', 'blended', 'multiculturalbased', 'elearning', 'the', 'collected', 'information', 'was', 'analyzed', 'using', 'spss', 'we', 'found', 'that', 'blended', 'multicultural', 'based', 'elearning', 'improves', 'the', 'level', 'of', 'satisfaction', 'of', 'learners', 'in', 'addition', 'the', 'optimal', 'mix', 'of', 'multicultural', 'blended', 'learning', 'should', 'be', 'comprised', '19', 'still', 'pictures', 'audio', 'files', '23', 'video', 'files', '31', 'and', 'text', 'files', '27']] | [0.004416336106986507, 0.05506410188873333, -0.077856918156222, 0.11021967027836398, -0.13601954619950246, -0.20635568725582737, 0.08304020554927372, 0.4428984645344692, -0.18077922031680285, -0.4128088366690298, 0.06882751699155759, -0.3313174453382724, -0.10914172107453814, 0.1498568484953436, -0.13885023081737677, -0.0071164801702740905, 0.07838091515504673, 0.05516080331329206, -0.007555189852652784, -0.38048585878697616, 0.3096203538870451, 0.04293514940975197, 0.3327964529670125, 0.01046362989261784, 0.10938872220525955, -0.011092909897721354, -0.09822889813378254, -0.013147305912844487, -0.01673434511221236, 0.19886820617283463, 0.48298747545802, 0.25582919723898073, 0.42760310916155075, -0.330678553789254, -0.10255508920202819, -0.009386720102602279, 0.12987422869046963, 0.028649750893823052, -0.055743545914950135, -0.37854038657708056, 0.06487222176495215, -0.1931768808913911, -0.04958650110689486, -0.04320521824586911, -0.05047706933067049, -0.008565712258400983, -0.18837056600491847, -0.05618610709668106, 0.03532227213438225, 0.23020041094867874, -0.07933827708537797, -0.19343658065385866, 0.0023715865842047954, 0.24674515953074966, 0.03752195588766204, -0.0063183536349120705, 0.19956342936587212, -0.1413003621019748, -0.13155948724160157, 0.37276786298259795, -0.005432330311397903, -0.11254186228217694, 0.2199711844343817, -0.039622386679953374, -0.17581563582956392, 0.13139150779219283, 0.243275635882012, 0.07332426640080075, -0.24913361481697166, -0.018510021365032023, 0.017043017561550584, 0.2577509949344754, 0.09606622334182162, -0.06194471346758206, 0.17736554664056497, 0.19514874390157677, -0.04501867685552949, 0.0982074724477497, -0.020926835763911973, -0.07931878037700717, -0.20311671881092674, -0.17844962121156238, -0.10837370056296455, 0.0008588626561998921, -0.013410230497997598, -0.10246748416122024, 0.34432835540509216, 0.18606333959739868, 0.026292910618119992, -0.00875271036720916, 0.24307910256687826, 0.017213875239546216, 0.08126835885688963, 0.14347841767844238, 0.19013887058143447, 0.03470396154072611, 0.2085124829865292, -0.0937824761838771, 0.06727789285211455, -0.018784697617610428] |
1,802.04109 | Analysis of Complex System Development Based on Fuzzy Cognitive Mapping | This article represents one of the contemporary trends in the application of
the latest methods of classification in business, where intense competition and
the desire to expand drive this science to far-reaching prospects using the
discusses months and the most recent classification and forecasting algorithms
such as SVM, FFM, C4.5, which are used to build better business decision
support models, including basic steps in data pre-processing such as Attributes
using Information Gain Ratio and filling missing values with several
algorithms:K-Means,K-NearestNeighbor,Linear Regression,Neural Network(Back
Propagation)
| cs.CY | this article represents one of the contemporary trends in the application of the latest methods of classification in business where intense competition and the desire to expand drive this science to farreaching prospects using the discusses months and the most recent classification and forecasting algorithms such as svm ffm c45 which are used to build better business decision support models including basic steps in data preprocessing such as attributes using information gain ratio and filling missing values with several algorithmskmeansknearestneighborlinear regressionneural networkback propagation | [['this', 'article', 'represents', 'one', 'of', 'the', 'contemporary', 'trends', 'in', 'the', 'application', 'of', 'the', 'latest', 'methods', 'of', 'classification', 'in', 'business', 'where', 'intense', 'competition', 'and', 'the', 'desire', 'to', 'expand', 'drive', 'this', 'science', 'to', 'farreaching', 'prospects', 'using', 'the', 'discusses', 'months', 'and', 'the', 'most', 'recent', 'classification', 'and', 'forecasting', 'algorithms', 'such', 'as', 'svm', 'ffm', 'c45', 'which', 'are', 'used', 'to', 'build', 'better', 'business', 'decision', 'support', 'models', 'including', 'basic', 'steps', 'in', 'data', 'preprocessing', 'such', 'as', 'attributes', 'using', 'information', 'gain', 'ratio', 'and', 'filling', 'missing', 'values', 'with', 'several', 'algorithmskmeansknearestneighborlinear', 'regressionneural', 'networkback', 'propagation']] | [-0.03156184908002615, 0.04902252332540229, -0.0271332561300369, 0.07550925482937601, -0.13145338839967735, -0.13327356980880722, 0.05809311839402653, 0.3830448826774955, -0.26883774600719335, -0.3646963082370348, 0.16733290878037224, -0.28135929638519885, -0.1758250432481873, 0.1996031263959594, -0.07044737170726875, 0.09682883349032637, 0.07142399997101165, 0.02512086553615518, -0.038262996706180274, -0.3219186666668975, 0.28427523039863445, 0.07456587756751105, 0.3180387644446455, 0.03679963804315776, 0.03164286918618018, 0.02398739269701764, -0.09364429574925452, -0.023436583951115607, -0.10160049347905442, 0.17073257497977465, 0.3433300452734784, 0.21305361380800605, 0.3344426572788507, -0.42099006578791887, -0.21466609883354976, 0.0881328966584988, 0.12512147883389843, 0.07773105310589017, -0.03125021790037863, -0.2689269396360032, 0.02537605697871186, -0.19195972313173115, -0.07280551058938727, -0.11705687822541222, 0.016356677789008244, 0.05347715926618548, -0.2462995462206891, 0.023003996087936684, 0.04462101718527265, 0.0896532510407269, -0.063629486845457, -0.16861174934310838, 0.020552109007257967, 0.1775256069144234, 0.09365072599612176, 0.08243649556970922, 0.11736487467424013, -0.2051267635950353, -0.22411012918455525, 0.39693094343529084, -0.04478045677242335, -0.11758652399294078, 0.23385977239231578, -0.07021536093197937, -0.1784716437163297, 0.0483117894269526, 0.24231140431948006, 0.0279770522902254, -0.13352976902788213, -0.016155518942105117, 0.04541948400437832, 0.129793545557186, 0.044628071889746934, 0.0006413965951651335, 0.19148516819404904, 0.28506794506683947, 0.01948009872576222, 0.09522689521545544, -0.09490821573417633, -0.09274168995907531, -0.23821400360320694, -0.1498774702544324, -0.12182443003257504, 0.007891328807454556, -0.07669329672280582, -0.15200996545609086, 0.4116396280936897, 0.24964154416229575, 0.20523537165136077, -0.003874243806058075, 0.35837784233735875, 0.045599241586751306, 0.08329984124284237, 0.0720856367261149, 0.21249535124807153, 0.07468763858196326, 0.159469273276045, -0.10949667478562333, 0.09801224137918325, 0.015896577143575997] |
1,802.0411 | Means of unbounded sets | We study generalized means whose domain may contain unbounded sets as well.
We investigate usual properties of this type of means and also new attributes
that regard for such means only. We examine how a mean defined on bounded sets
can be extended to this type of mean. We generalize some classic means and also
present many new examples for means defined on unbounded sets.
| math.CA | we study generalized means whose domain may contain unbounded sets as well we investigate usual properties of this type of means and also new attributes that regard for such means only we examine how a mean defined on bounded sets can be extended to this type of mean we generalize some classic means and also present many new examples for means defined on unbounded sets | [['we', 'study', 'generalized', 'means', 'whose', 'domain', 'may', 'contain', 'unbounded', 'sets', 'as', 'well', 'we', 'investigate', 'usual', 'properties', 'of', 'this', 'type', 'of', 'means', 'and', 'also', 'new', 'attributes', 'that', 'regard', 'for', 'such', 'means', 'only', 'we', 'examine', 'how', 'a', 'mean', 'defined', 'on', 'bounded', 'sets', 'can', 'be', 'extended', 'to', 'this', 'type', 'of', 'mean', 'we', 'generalize', 'some', 'classic', 'means', 'and', 'also', 'present', 'many', 'new', 'examples', 'for', 'means', 'defined', 'on', 'unbounded', 'sets']] | [-0.0699576437262854, 0.08407874319415826, -0.031710170653577036, 0.13644838178028854, -0.12224080677215869, -0.05988264823905551, 0.04970998137007253, 0.377853100001812, -0.3397227233419052, -0.26507321089649427, 0.15082461151939172, -0.24679313976890765, -0.21414144142315938, 0.2648646088173756, -0.1345713795019457, 0.027438871820385638, 0.01498129485318294, 0.06146452299390848, -0.06644941079430282, -0.23643715971937546, 0.3823214995316588, -0.05501036033070145, 0.18547209752007174, 0.06266256195421402, 0.09034295218387763, 0.02541222102366961, -0.06510364920474015, 0.16378185519805322, -0.19339875971882764, 0.14043634975902164, 0.1700451579159842, 0.15103250588648595, 0.27027238816595994, -0.4037150870148952, -0.23784565469966484, 0.17850506847294478, 0.18557018488645555, 0.07324012680910527, -0.04546970055044557, -0.2749883075029804, 0.13369030150083394, -0.17459109915563695, -0.18305237021727058, -0.1471234800437322, -0.046135470185142295, 0.09180645533980658, -0.24792296651464243, 0.03164997868007049, 0.06334613606942674, 0.09431471403401631, -0.07220665202117883, -0.11875847113820223, 0.046022544597060636, 0.10431064466874186, -0.014088174070303256, -0.041563505575490683, 0.049051906569645955, -0.04695803950755642, -0.12880582762882115, 0.33813856633809897, -0.06532378440292982, -0.284571967073358, 0.23122702470192544, -0.0941424098295661, -0.13985535979557495, -0.014233235764102294, 0.17524576387726343, 0.16543666541289825, -0.13911216915226898, 0.08666920331485856, -0.0838634645136503, 0.14338258963364822, 0.10765547219377297, 0.09019640689142622, 0.14954481474482095, 0.12367568251032096, 0.06670227786436533, 0.20623059602131924, -0.008426418313040184, -0.08265370321818269, -0.35467018485069274, -0.15344589054405403, -0.1696570863803992, 0.07262224722653628, -0.0500071435857815, -0.2030137161509349, 0.3932744431954164, 0.12616756206844001, 0.2099561358300539, 0.04334907960146665, 0.20307149053909457, 0.13206038424709382, 0.03975667744301833, 0.07858688844940984, 0.1486595439532091, 0.08959842244019875, 0.020324804433263264, -0.1258940841214588, 0.06910119278786274, 0.07957899623187796] |
1,802.04111 | TMOKE as efficient tool for the magneto-optic analysis of ultra-thin
magnetic films | Ultra-thin magnetic dielectric films are of prime importance due to their
applications for nanophotonics and spintronics. Here, we propose an efficient
method for the magneto-optical investigation of ultra-thin magnetic films which
allows one to access their state of magnetization and magneto-optical
properties. It is based on the surface-plasmon-polariton-assisted transverse
magneto-optical Kerr effect (TMOKE). In our experiments, sub-100 nm-thick
bismuth-substituted lutetium iron-garnet films covered with a plasmonic gold
grating have been analyzed. The excitation of surface plasmon-polaritons
provides resonance enhancement of TMOKE up to 0.04 and makes it easily
detectable in the experiment. For films thicker than 40 nm, the TMOKE
marginally depends on the film thickness. A further decrease in the film
thickness diminishes TMOKE since for such thicknesses the surface
plasmon-polariton field partly penetrates inside the non-magnetic substrate.
Nevertheless, the TMOKE remains measurable even for few-nm-thick films, which
makes this technique unique for the magneto-optical study of ultra-thin films.
Particularly, the proposed method reveals that the off-diagonal components of
the magnetic film permittivity tensor grow slightly with the reduction of the
film thickness.
| physics.ins-det physics.optics | ultrathin magnetic dielectric films are of prime importance due to their applications for nanophotonics and spintronics here we propose an efficient method for the magnetooptical investigation of ultrathin magnetic films which allows one to access their state of magnetization and magnetooptical properties it is based on the surfaceplasmonpolaritonassisted transverse magnetooptical kerr effect tmoke in our experiments sub100 nmthick bismuthsubstituted lutetium irongarnet films covered with a plasmonic gold grating have been analyzed the excitation of surface plasmonpolaritons provides resonance enhancement of tmoke up to 004 and makes it easily detectable in the experiment for films thicker than 40 nm the tmoke marginally depends on the film thickness a further decrease in the film thickness diminishes tmoke since for such thicknesses the surface plasmonpolariton field partly penetrates inside the nonmagnetic substrate nevertheless the tmoke remains measurable even for fewnmthick films which makes this technique unique for the magnetooptical study of ultrathin films particularly the proposed method reveals that the offdiagonal components of the magnetic film permittivity tensor grow slightly with the reduction of the film thickness | [['ultrathin', 'magnetic', 'dielectric', 'films', 'are', 'of', 'prime', 'importance', 'due', 'to', 'their', 'applications', 'for', 'nanophotonics', 'and', 'spintronics', 'here', 'we', 'propose', 'an', 'efficient', 'method', 'for', 'the', 'magnetooptical', 'investigation', 'of', 'ultrathin', 'magnetic', 'films', 'which', 'allows', 'one', 'to', 'access', 'their', 'state', 'of', 'magnetization', 'and', 'magnetooptical', 'properties', 'it', 'is', 'based', 'on', 'the', 'surfaceplasmonpolaritonassisted', 'transverse', 'magnetooptical', 'kerr', 'effect', 'tmoke', 'in', 'our', 'experiments', 'sub100', 'nmthick', 'bismuthsubstituted', 'lutetium', 'irongarnet', 'films', 'covered', 'with', 'a', 'plasmonic', 'gold', 'grating', 'have', 'been', 'analyzed', 'the', 'excitation', 'of', 'surface', 'plasmonpolaritons', 'provides', 'resonance', 'enhancement', 'of', 'tmoke', 'up', 'to', '004', 'and', 'makes', 'it', 'easily', 'detectable', 'in', 'the', 'experiment', 'for', 'films', 'thicker', 'than', '40', 'nm', 'the', 'tmoke', 'marginally', 'depends', 'on', 'the', 'film', 'thickness', 'a', 'further', 'decrease', 'in', 'the', 'film', 'thickness', 'diminishes', 'tmoke', 'since', 'for', 'such', 'thicknesses', 'the', 'surface', 'plasmonpolariton', 'field', 'partly', 'penetrates', 'inside', 'the', 'nonmagnetic', 'substrate', 'nevertheless', 'the', 'tmoke', 'remains', 'measurable', 'even', 'for', 'fewnmthick', 'films', 'which', 'makes', 'this', 'technique', 'unique', 'for', 'the', 'magnetooptical', 'study', 'of', 'ultrathin', 'films', 'particularly', 'the', 'proposed', 'method', 'reveals', 'that', 'the', 'offdiagonal', 'components', 'of', 'the', 'magnetic', 'film', 'permittivity', 'tensor', 'grow', 'slightly', 'with', 'the', 'reduction', 'of', 'the', 'film', 'thickness']] | [-0.12040768679079794, 0.1763228541383077, -0.029822742279489025, -0.055883981440443715, -0.07742896126948709, -0.14556765686625853, 0.03186453924904209, 0.47470818932146525, -0.21569367810856377, -0.30363382749715656, 0.029292558817000693, -0.29709262207435067, -0.09324774944201805, 0.280673660378535, 0.013807500273985572, 0.050910464846691504, -0.04552945301212847, -0.12194834578630709, -0.0444676584691394, -0.18131763612320864, 0.24257847465314838, 0.027544885652470076, 0.3740697770005872, 0.13860060591629686, 0.03719260399013238, -0.012215862245580484, 0.1374486387114387, 0.018229643478556427, -0.16051394785206993, 0.09601520927796184, 0.23552047340964172, -0.13249517428325921, 0.20929075707258457, -0.4859976488095167, -0.20850921084909418, -0.04273561700138935, 0.15571901628606802, 0.1407355495571527, -0.10159007724926829, -0.24962811402131824, 0.09225142032427844, -0.07964522017674996, -0.13119814458552229, -0.08557473230283967, 0.016597081417743072, -0.04897415341246267, -0.2506183375456224, 0.04123399494795215, 0.10222781615651234, 0.11417906590856525, -0.10963542840401588, -0.13125364145881302, -0.09000094519077995, -0.011501496668558481, 0.0702072897544239, 0.04137824305203245, 0.23842172242625248, -0.10439240574961269, -0.03188418341952181, 0.32833519799981353, -0.05152085614378827, -0.08708333890332819, 0.12008149194704412, -0.21791597402676247, 0.040139828382877545, 0.1958645602774828, 0.1664698976200334, 0.17694413110879142, -0.09926033728257862, 0.06952824225807616, 0.002341226598811011, 0.26425868604700403, 0.1369943099304882, 0.10476974226523537, 0.2339440436487568, 0.27470139870528393, 0.02377309296431587, 0.16911885482232022, -0.17142628174482272, 0.05818889139025191, -0.161604538286473, -0.22650353544050567, -0.20370245007202462, 0.0643815302051777, -0.11132250010378748, -0.2372828682689646, 0.37602456804191653, 0.15221129239775066, 0.11753507799551509, -0.06659750099061057, 0.2917164392135821, 0.04501472525555792, 0.12645353502756373, -0.020047794308697502, 0.33620711297966366, 0.21800920647720612, 0.14977202669522444, -0.25278864257297545, 0.10213056282779245, -0.05500901034738067] |
1,802.04112 | Infrastructure Enabled Autonomy: A Distributed Intelligence Architecture
for Autonomous Vehicles | Multiple studies have illustrated the potential for dramatic societal,
environmental and economic benefits from significant penetration of autonomous
driving. However, all the current approaches to autonomous driving require the
automotive manufacturers to shoulder the primary responsibility and liability
associated with replacing human perception and decision making with automation,
potentially slowing the penetration of autonomous vehicles, and consequently
slowing the realization of the societal benefits of autonomous vehicles. We
propose here a new approach to autonomous driving that will re-balance the
responsibility and liabilities associated with autonomous driving between
traditional automotive manufacturers, infrastructure players, and third-party
players. Our proposed distributed intelligence architecture leverages the
significant advancements in connectivity and edge computing in the recent
decades to partition the driving functions between the vehicle, edge computers
on the road side, and specialized third-party computers that reside in the
vehicle. Infrastructure becomes a critical enabler for autonomy. With this
Infrastructure Enabled Autonomy (IEA) concept, the traditional automotive
manufacturers will only need to shoulder responsibility and liability
comparable to what they already do today, and the infrastructure and
third-party players will share the added responsibility and liabilities
associated with autonomous functionalities. We propose a Bayesian Network Model
based framework for assessing the risk benefits of such a distributed
intelligence architecture. An additional benefit of the proposed architecture
is that it enables "autonomy as a service" while still allowing for private
ownership of automobiles.
| cs.CY cs.DC cs.MA cs.RO | multiple studies have illustrated the potential for dramatic societal environmental and economic benefits from significant penetration of autonomous driving however all the current approaches to autonomous driving require the automotive manufacturers to shoulder the primary responsibility and liability associated with replacing human perception and decision making with automation potentially slowing the penetration of autonomous vehicles and consequently slowing the realization of the societal benefits of autonomous vehicles we propose here a new approach to autonomous driving that will rebalance the responsibility and liabilities associated with autonomous driving between traditional automotive manufacturers infrastructure players and thirdparty players our proposed distributed intelligence architecture leverages the significant advancements in connectivity and edge computing in the recent decades to partition the driving functions between the vehicle edge computers on the road side and specialized thirdparty computers that reside in the vehicle infrastructure becomes a critical enabler for autonomy with this infrastructure enabled autonomy iea concept the traditional automotive manufacturers will only need to shoulder responsibility and liability comparable to what they already do today and the infrastructure and thirdparty players will share the added responsibility and liabilities associated with autonomous functionalities we propose a bayesian network model based framework for assessing the risk benefits of such a distributed intelligence architecture an additional benefit of the proposed architecture is that it enables autonomy as a service while still allowing for private ownership of automobiles | [['multiple', 'studies', 'have', 'illustrated', 'the', 'potential', 'for', 'dramatic', 'societal', 'environmental', 'and', 'economic', 'benefits', 'from', 'significant', 'penetration', 'of', 'autonomous', 'driving', 'however', 'all', 'the', 'current', 'approaches', 'to', 'autonomous', 'driving', 'require', 'the', 'automotive', 'manufacturers', 'to', 'shoulder', 'the', 'primary', 'responsibility', 'and', 'liability', 'associated', 'with', 'replacing', 'human', 'perception', 'and', 'decision', 'making', 'with', 'automation', 'potentially', 'slowing', 'the', 'penetration', 'of', 'autonomous', 'vehicles', 'and', 'consequently', 'slowing', 'the', 'realization', 'of', 'the', 'societal', 'benefits', 'of', 'autonomous', 'vehicles', 'we', 'propose', 'here', 'a', 'new', 'approach', 'to', 'autonomous', 'driving', 'that', 'will', 'rebalance', 'the', 'responsibility', 'and', 'liabilities', 'associated', 'with', 'autonomous', 'driving', 'between', 'traditional', 'automotive', 'manufacturers', 'infrastructure', 'players', 'and', 'thirdparty', 'players', 'our', 'proposed', 'distributed', 'intelligence', 'architecture', 'leverages', 'the', 'significant', 'advancements', 'in', 'connectivity', 'and', 'edge', 'computing', 'in', 'the', 'recent', 'decades', 'to', 'partition', 'the', 'driving', 'functions', 'between', 'the', 'vehicle', 'edge', 'computers', 'on', 'the', 'road', 'side', 'and', 'specialized', 'thirdparty', 'computers', 'that', 'reside', 'in', 'the', 'vehicle', 'infrastructure', 'becomes', 'a', 'critical', 'enabler', 'for', 'autonomy', 'with', 'this', 'infrastructure', 'enabled', 'autonomy', 'iea', 'concept', 'the', 'traditional', 'automotive', 'manufacturers', 'will', 'only', 'need', 'to', 'shoulder', 'responsibility', 'and', 'liability', 'comparable', 'to', 'what', 'they', 'already', 'do', 'today', 'and', 'the', 'infrastructure', 'and', 'thirdparty', 'players', 'will', 'share', 'the', 'added', 'responsibility', 'and', 'liabilities', 'associated', 'with', 'autonomous', 'functionalities', 'we', 'propose', 'a', 'bayesian', 'network', 'model', 'based', 'framework', 'for', 'assessing', 'the', 'risk', 'benefits', 'of', 'such', 'a', 'distributed', 'intelligence', 'architecture', 'an', 'additional', 'benefit', 'of', 'the', 'proposed', 'architecture', 'is', 'that', 'it', 'enables', 'autonomy', 'as', 'a', 'service', 'while', 'still', 'allowing', 'for', 'private', 'ownership', 'of', 'automobiles']] | [-0.16866859535617534, 0.041860547699158764, -0.030891168136637673, 0.008306519060769815, -0.1441840072219386, -0.2008806763310392, 0.08606572027672, 0.4089727472456977, -0.25635425940839224, -0.3317107485961088, 0.1072137663491664, -0.29136496041515053, -0.1813260300743788, 0.21081955961458076, -0.1792169201480607, 0.09111577706354544, 0.0762169742346721, 0.020103875299565917, 0.07027271728785749, -0.2281198759713743, 0.2914325831728422, 0.055585184771014484, 0.3396548555867023, 0.09777184389328267, 0.09668789194701351, 0.014677696544107652, -0.0059434991455982605, -0.02908559725162325, -0.010633901330431685, 0.20924818009167592, 0.35007825210755567, 0.21077722186505704, 0.43729754595907494, -0.49907195740521737, -0.19050481881718578, 0.15328606035291953, 0.12150208573121431, 0.01321568221512645, -0.02400079070423693, -0.34578624471826847, 0.037060060778807635, -0.29374829275273273, -0.14394629400784728, -0.06850575880039744, 0.002701867561925642, 0.04150036483821073, -0.2541172958841328, -0.05842054870353776, 0.0071693367942939935, 0.11577609504316831, -0.07464508287096193, -0.08057076332879183, -0.03105627196051961, 0.23941790881070033, 0.051701135900863913, -0.0017770141664095321, 0.22932684028269032, -0.20589448452121925, -0.17296662772588806, 0.3833264187954399, 0.06271087788614774, -0.12929864881731018, 0.19754801801655963, -0.026538427804132077, -0.14908684672600708, 0.06568373946826823, 0.21749971188222542, -0.031766204541654824, -0.19476726974917813, 0.007780071783111345, 0.0741356780597997, 0.14883730348248408, 0.011969302675186547, 0.026839717132686007, 0.20784733059315832, 0.23908624062558645, 0.16586851870120548, 0.048356580287706126, -0.043847205265532915, -0.15759767969769292, -0.19229785339295757, -0.15406541023545747, -0.12071825477689115, 0.02580562005567824, -0.07572574909358575, -0.1182527898099857, 0.33352649508920545, 0.26422940777700116, 0.06890858485928725, 0.07006535444136172, 0.42811678554944077, 0.044279049370258915, 0.14782025978908625, 0.12322606458267661, 0.18957970602596463, -0.03593590461514792, 0.22681570875684132, -0.18671449021218695, 0.15038225782616269, -0.03775060667471317] |
1,802.04113 | Linear Regression for Speaker Verification | This paper presents a linear regression based back-end for speaker
verification. Linear regression is a simple linear model that minimizes the
mean squared estimation error between the target and its estimate with a closed
form solution, where the target is defined as the ground-truth indicator
vectors of utterances. We use the linear regression model to learn speaker
models from a front-end, and verify the similarity of two speaker models by a
cosine similarity scoring classifier. To evaluate the effectiveness of the
linear regression model, we construct three speaker verification systems that
use the Gaussian mixture model and identity-vector (GMM/i-vector) front-end,
deep neural network and i-vector (DNN/i-vector) front-end, and deep vector
(d-vector) front-end as their front-ends, respectively. Our empirical
comparison results on the NIST speaker recognition evaluation data sets show
that the proposed method outperforms within-class covariance normalization,
linear discriminant analysis, and probabilistic linear discriminant analysis,
given any of the three front-ends.
| cs.SD eess.AS | this paper presents a linear regression based backend for speaker verification linear regression is a simple linear model that minimizes the mean squared estimation error between the target and its estimate with a closed form solution where the target is defined as the groundtruth indicator vectors of utterances we use the linear regression model to learn speaker models from a frontend and verify the similarity of two speaker models by a cosine similarity scoring classifier to evaluate the effectiveness of the linear regression model we construct three speaker verification systems that use the gaussian mixture model and identityvector gmmivector frontend deep neural network and ivector dnnivector frontend and deep vector dvector frontend as their frontends respectively our empirical comparison results on the nist speaker recognition evaluation data sets show that the proposed method outperforms withinclass covariance normalization linear discriminant analysis and probabilistic linear discriminant analysis given any of the three frontends | [['this', 'paper', 'presents', 'a', 'linear', 'regression', 'based', 'backend', 'for', 'speaker', 'verification', 'linear', 'regression', 'is', 'a', 'simple', 'linear', 'model', 'that', 'minimizes', 'the', 'mean', 'squared', 'estimation', 'error', 'between', 'the', 'target', 'and', 'its', 'estimate', 'with', 'a', 'closed', 'form', 'solution', 'where', 'the', 'target', 'is', 'defined', 'as', 'the', 'groundtruth', 'indicator', 'vectors', 'of', 'utterances', 'we', 'use', 'the', 'linear', 'regression', 'model', 'to', 'learn', 'speaker', 'models', 'from', 'a', 'frontend', 'and', 'verify', 'the', 'similarity', 'of', 'two', 'speaker', 'models', 'by', 'a', 'cosine', 'similarity', 'scoring', 'classifier', 'to', 'evaluate', 'the', 'effectiveness', 'of', 'the', 'linear', 'regression', 'model', 'we', 'construct', 'three', 'speaker', 'verification', 'systems', 'that', 'use', 'the', 'gaussian', 'mixture', 'model', 'and', 'identityvector', 'gmmivector', 'frontend', 'deep', 'neural', 'network', 'and', 'ivector', 'dnnivector', 'frontend', 'and', 'deep', 'vector', 'dvector', 'frontend', 'as', 'their', 'frontends', 'respectively', 'our', 'empirical', 'comparison', 'results', 'on', 'the', 'nist', 'speaker', 'recognition', 'evaluation', 'data', 'sets', 'show', 'that', 'the', 'proposed', 'method', 'outperforms', 'withinclass', 'covariance', 'normalization', 'linear', 'discriminant', 'analysis', 'and', 'probabilistic', 'linear', 'discriminant', 'analysis', 'given', 'any', 'of', 'the', 'three', 'frontends']] | [-0.04565148413845187, -0.08531376733004141, -0.08844703479632232, 0.06542869861004874, -0.12020911287667381, -0.25015355468250977, 0.0187770130775076, 0.4145719183206156, -0.27876893590783347, -0.2564537184583527, 0.07190855228770021, -0.30480181580610777, -0.20572962098624367, 0.18998375552739064, -0.08289775411548042, 0.1573795915759842, 0.10184950974134326, 0.06685794588190981, -0.10931316142857729, -0.28009379604151724, 0.28251296191199404, 0.029996633872223035, 0.3810477592129688, -0.059284211338554334, 0.20041351364311963, 0.026943684356189584, -0.06746460950061856, -0.08661910040206527, -0.011517200857269927, 0.16118248464300525, 0.34244277506558, 0.22082959501563595, 0.315962076766064, -0.31194325689402586, -0.1765040817381059, 0.09573201621360322, 0.0741112599294079, 0.04914597394196568, 0.0018037857442175515, -0.3480323846955356, 0.07073618342071092, -0.20884346952536018, 0.04765668435248773, -0.12349033368612967, -0.04668683040496969, 0.024492405600392737, -0.332458844181855, 0.06008732103549158, 0.145920310200922, 0.12725778943796112, -0.09614574742846417, -0.15576375783043536, 0.006044333871466586, 0.10295400210983448, 0.033762513688211704, 0.057915966561366175, 0.13275394128396403, -0.12233230716038954, -0.12754931522224955, 0.3139091714637706, -0.1506090156507452, -0.2924694295719304, 0.1710650721058325, 0.018338339249100034, -0.11144009754974143, 0.028355146663867542, 0.29488300462882666, 0.032105028302081534, -0.1989073445705848, 0.02425587220775039, -0.07815983580312112, 0.2607133793518753, 0.0346808383037569, -0.06972811073442367, 0.16289145685732365, 0.24702395401844704, -0.007769101591956978, 0.16221570021416237, -0.18645025642330734, -0.019678784864702942, -0.28238798003656335, -0.1115149663874527, -0.21846803939725096, -0.09039580096597657, -0.15710669600131852, -0.18799855691709988, 0.42260316364637046, 0.18621039507293924, 0.20372616641877875, 0.21215852120784237, 0.36437183789707517, 0.09311148585245088, 0.09025632578256615, 0.087430281920132, 0.16810559145469106, 0.0916775436002157, 0.04621017280324186, -0.1896980665985973, 0.1118491552518429, 0.08620333949236099] |
1,802.04114 | A sharpened Strichartz inequality for the wave equation | We disprove a conjecture of Foschi, regarding extremizers for the Strichartz
inequality with data in the Sobolev space
$\dot{H}^{1/2}\times\dot{H}^{-1/2}(\mathbb R^d)$, for even $d\ge 2$. On the
other hand, we provide evidence to support the conjecture in odd dimensions,
and refine his sharp inequality in $\mathbb R^{1+3}$, adding a term
proportional to the distance of the initial data from the set of extremizers.
The proofs use the conformal compactification of the Minkowski space-time given
by the Penrose transform.
| math.CA math.AP | we disprove a conjecture of foschi regarding extremizers for the strichartz inequality with data in the sobolev space doth12timesdoth12mathbb rd for even dge 2 on the other hand we provide evidence to support the conjecture in odd dimensions and refine his sharp inequality in mathbb r13 adding a term proportional to the distance of the initial data from the set of extremizers the proofs use the conformal compactification of the minkowski spacetime given by the penrose transform | [['we', 'disprove', 'a', 'conjecture', 'of', 'foschi', 'regarding', 'extremizers', 'for', 'the', 'strichartz', 'inequality', 'with', 'data', 'in', 'the', 'sobolev', 'space', 'doth12timesdoth12mathbb', 'rd', 'for', 'even', 'dge', '2', 'on', 'the', 'other', 'hand', 'we', 'provide', 'evidence', 'to', 'support', 'the', 'conjecture', 'in', 'odd', 'dimensions', 'and', 'refine', 'his', 'sharp', 'inequality', 'in', 'mathbb', 'r13', 'adding', 'a', 'term', 'proportional', 'to', 'the', 'distance', 'of', 'the', 'initial', 'data', 'from', 'the', 'set', 'of', 'extremizers', 'the', 'proofs', 'use', 'the', 'conformal', 'compactification', 'of', 'the', 'minkowski', 'spacetime', 'given', 'by', 'the', 'penrose', 'transform']] | [-0.12467986451826475, 0.05421772099247104, -0.07914106762281765, 0.11268232760515898, -0.08946615789624814, -0.15573930714622533, 0.02891557628141814, 0.26299572539956945, -0.2278926546905974, -0.23520199088441013, 0.16154051792814003, -0.31648197488883806, -0.09633117573531835, 0.18232071469537914, -0.09304278731150062, 0.059666290217520374, 0.0022052234455354905, 0.038728292293518804, -0.07555366758146863, -0.33154188770506726, 0.395780861426733, -0.018452990187430067, 0.21106137031395183, 0.10008104571974591, 0.04858169561607371, 0.04070820810738951, -0.04286253479260363, -0.05230700933584318, -0.23859926786175684, 0.17190472490007155, 0.17324423057174212, 0.15253442179681242, 0.22908428847471154, -0.42740021214673396, -0.1945572020669811, 0.15562986554945574, 0.1258114048181788, 0.04494020183521666, -0.025025785390569485, -0.33611996606678557, 0.041400617956625, -0.05849207576217228, -0.24976679422941647, -0.04208743056331418, 0.048066359681175334, -0.007561239279120376, -0.299626435588212, 0.1098505898354281, 0.14722428193904066, 0.050902555923369765, -0.14891182281395518, -0.07135497762417224, 0.0004572036192066183, 0.056206068569353146, 0.0875369805940672, 0.12681547871723428, 0.0012848114864410537, -0.06390564209830604, -0.1418276553556911, 0.31044625309541035, -0.06153601050027646, -0.24599063072941804, 0.09923834438852377, -0.21931424949587763, -0.16178871031489075, 0.051904958403228146, 0.11507784426947565, 0.10412902389898111, -0.035199001027075086, 0.1976524466444971, -0.0927780958836114, 0.12049766648315678, 0.17331444344630367, 0.03365896970621849, 0.08427450867173703, 0.05365520612777848, 0.13513306563254446, 0.14016157203724633, -0.04631612221342757, -0.02448564711468, -0.40054234966488655, -0.2132853844913801, -0.23358080029414086, 0.12982728244050554, -0.21144194683457548, -0.12213538443718694, 0.29077036068223316, 0.12113030586528782, 0.1623988548465269, 0.11459517856373598, 0.18609438505709955, 0.06601572660962886, 0.06726490647384994, 0.10937413436094127, 0.19079819228500128, 0.12594807544098185, 0.10903502407477629, -0.13597628932237918, -0.0037980323387800078, 0.20427810571058408] |
1,802.04115 | Socle deformed preprojective algebras of generalized Dynkin type | We provide a complete classification of finite-dimensional self-injective
algebras which are socle equivalent to preprojective algebras of generalized
Dynkin type. In particular, we conclude that these algebras are deformed
preprojective algebras of generalized Dynkin type (in the sense of [5, 12]),
and hence are periodic algebras.
| math.RT | we provide a complete classification of finitedimensional selfinjective algebras which are socle equivalent to preprojective algebras of generalized dynkin type in particular we conclude that these algebras are deformed preprojective algebras of generalized dynkin type in the sense of 5 12 and hence are periodic algebras | [['we', 'provide', 'a', 'complete', 'classification', 'of', 'finitedimensional', 'selfinjective', 'algebras', 'which', 'are', 'socle', 'equivalent', 'to', 'preprojective', 'algebras', 'of', 'generalized', 'dynkin', 'type', 'in', 'particular', 'we', 'conclude', 'that', 'these', 'algebras', 'are', 'deformed', 'preprojective', 'algebras', 'of', 'generalized', 'dynkin', 'type', 'in', 'the', 'sense', 'of', '5', '12', 'and', 'hence', 'are', 'periodic', 'algebras']] | [-0.13461032436917658, 0.04969340745035721, -0.01742668251466492, 0.13925011184714411, -0.17515055632785612, -0.24496687807993073, -0.10454748009594725, 0.42143866946191894, -0.4071207996255354, -0.14093187678625566, 0.1492425291545932, -0.1908823117694777, -0.1708182522561401, 0.1346237111998641, -0.2718387590923711, -0.16752058118784233, 0.12367838918757827, 0.1726793322020018, -0.16132005121376689, -0.38515985870490904, 0.47663972142111993, -0.0756447950033876, 0.2073591337741717, -0.05406616644366928, 0.041546513680773584, 0.04774752391866692, -0.039643081350494984, 0.024340289908096842, -0.20569085214953267, 0.09386745219766769, 0.38770478008233983, 0.011737606123737667, 0.17969152298958405, -0.3154697705100736, -0.01601416392899726, 0.22969689341666905, 0.26779488880065794, 0.04822256499850799, 0.01357271293502139, -0.2550318961882073, 0.09974847460651527, -0.34355376525174663, -0.19830128218492735, -0.06508530151989797, 0.13319845031946898, 0.03827826759737471, -0.22699292769412632, 0.10967773806465708, 0.1139542925293031, 0.19020778155359236, -0.20872857459091945, -0.130306303480883, -0.1332699598683773, 0.041516088182106614, -0.2191764394874158, -0.05094790988115837, 0.09935499216510874, -0.05549102817135661, -0.28126709339583456, 0.3081247942400691, 0.1113361955984779, -0.23169024960826273, 0.10785446054828556, -0.2055960066576043, -0.22312921719909037, 0.12821551999482123, -0.03254109110845172, 0.11204221517697949, -0.06113453209400177, 0.1493265090862026, -0.13441151242865168, -0.10108709023536547, 0.10875914234708509, 0.03850382377403667, 0.11272635071983804, 0.11976317391330983, -0.030224146817446403, 0.14037951316846453, 0.09326662663775294, -0.004876259532149719, -0.37153271504718327, -0.13439073814484087, 0.0353760145118703, 0.16527970171655001, -0.15878732001336807, -0.19493259192930293, 0.39135680671619333, 0.1040731705725193, 0.08563569816254565, 0.16889134088136337, 0.04413729079027215, 0.041747100327325905, 0.163647259960113, 0.004155421548563501, 0.1530551853356883, 0.37264291682462813, -0.04274779424557219, -0.06947119847830871, -0.132161542312647, 0.2896051751449704] |
1,802.04116 | A Split Random Time Stepping Method for Stiff and Non-stiff Chemically
Reacting Flows | In this paper, a new fractional step method is proposed for simulating stiff
and nonstiff chemically reacting flows. In stiff cases, a well-known spurious
numerical phenomenon, i.e. the incorrect propagation speed of discontinuities,
may be produced by general fractional step methods due to the under-resolved
discretization in both space and time. The previous random projection method
has been successfully applied for stiff detonation capturing in under-resolved
conditions. Not to randomly project the intermediate state into two presumed
equilibrium states (completely burnt or unburnt) as in the random projection
method, the present study is to randomly choose the time-dependent advance or
stop of a reaction process. Each one-way reaction has been decoupled from the
multi-reaction kinetics using operator splitting and the local smeared
temperature due to numerical dissipation of shock-capturing schemes is compared
with a random one within two limited temperatures corresponding to the advance
and its inverse states, respectively, to control the random reaction. The
random activation or deactivation in the reaction step is thus promising to
correct the deterministic accumulative error of the propagation of
discontinuities. Extensive numerical experiments, including model problems and
realistic reacting flows in one and two dimensions, demonstrate this
expectation as well as the effectiveness and robustness of the method.
Meanwhile, for nonstiff problems when spatial and temporal resolutions are
fine, the proposed random method recovers the results as general fractional
step methods, owing to the increasing possibility of activation with
diminishing randomness by adding a shift term.
| physics.comp-ph physics.chem-ph | in this paper a new fractional step method is proposed for simulating stiff and nonstiff chemically reacting flows in stiff cases a wellknown spurious numerical phenomenon ie the incorrect propagation speed of discontinuities may be produced by general fractional step methods due to the underresolved discretization in both space and time the previous random projection method has been successfully applied for stiff detonation capturing in underresolved conditions not to randomly project the intermediate state into two presumed equilibrium states completely burnt or unburnt as in the random projection method the present study is to randomly choose the timedependent advance or stop of a reaction process each oneway reaction has been decoupled from the multireaction kinetics using operator splitting and the local smeared temperature due to numerical dissipation of shockcapturing schemes is compared with a random one within two limited temperatures corresponding to the advance and its inverse states respectively to control the random reaction the random activation or deactivation in the reaction step is thus promising to correct the deterministic accumulative error of the propagation of discontinuities extensive numerical experiments including model problems and realistic reacting flows in one and two dimensions demonstrate this expectation as well as the effectiveness and robustness of the method meanwhile for nonstiff problems when spatial and temporal resolutions are fine the proposed random method recovers the results as general fractional step methods owing to the increasing possibility of activation with diminishing randomness by adding a shift term | [['in', 'this', 'paper', 'a', 'new', 'fractional', 'step', 'method', 'is', 'proposed', 'for', 'simulating', 'stiff', 'and', 'nonstiff', 'chemically', 'reacting', 'flows', 'in', 'stiff', 'cases', 'a', 'wellknown', 'spurious', 'numerical', 'phenomenon', 'ie', 'the', 'incorrect', 'propagation', 'speed', 'of', 'discontinuities', 'may', 'be', 'produced', 'by', 'general', 'fractional', 'step', 'methods', 'due', 'to', 'the', 'underresolved', 'discretization', 'in', 'both', 'space', 'and', 'time', 'the', 'previous', 'random', 'projection', 'method', 'has', 'been', 'successfully', 'applied', 'for', 'stiff', 'detonation', 'capturing', 'in', 'underresolved', 'conditions', 'not', 'to', 'randomly', 'project', 'the', 'intermediate', 'state', 'into', 'two', 'presumed', 'equilibrium', 'states', 'completely', 'burnt', 'or', 'unburnt', 'as', 'in', 'the', 'random', 'projection', 'method', 'the', 'present', 'study', 'is', 'to', 'randomly', 'choose', 'the', 'timedependent', 'advance', 'or', 'stop', 'of', 'a', 'reaction', 'process', 'each', 'oneway', 'reaction', 'has', 'been', 'decoupled', 'from', 'the', 'multireaction', 'kinetics', 'using', 'operator', 'splitting', 'and', 'the', 'local', 'smeared', 'temperature', 'due', 'to', 'numerical', 'dissipation', 'of', 'shockcapturing', 'schemes', 'is', 'compared', 'with', 'a', 'random', 'one', 'within', 'two', 'limited', 'temperatures', 'corresponding', 'to', 'the', 'advance', 'and', 'its', 'inverse', 'states', 'respectively', 'to', 'control', 'the', 'random', 'reaction', 'the', 'random', 'activation', 'or', 'deactivation', 'in', 'the', 'reaction', 'step', 'is', 'thus', 'promising', 'to', 'correct', 'the', 'deterministic', 'accumulative', 'error', 'of', 'the', 'propagation', 'of', 'discontinuities', 'extensive', 'numerical', 'experiments', 'including', 'model', 'problems', 'and', 'realistic', 'reacting', 'flows', 'in', 'one', 'and', 'two', 'dimensions', 'demonstrate', 'this', 'expectation', 'as', 'well', 'as', 'the', 'effectiveness', 'and', 'robustness', 'of', 'the', 'method', 'meanwhile', 'for', 'nonstiff', 'problems', 'when', 'spatial', 'and', 'temporal', 'resolutions', 'are', 'fine', 'the', 'proposed', 'random', 'method', 'recovers', 'the', 'results', 'as', 'general', 'fractional', 'step', 'methods', 'owing', 'to', 'the', 'increasing', 'possibility', 'of', 'activation', 'with', 'diminishing', 'randomness', 'by', 'adding', 'a', 'shift', 'term']] | [-0.0675453384645468, 0.12302202603554599, -0.055954479451256624, 0.027605237917962145, -0.04605591510834311, -0.16719399876161364, 0.0347543776805959, 0.36742917587595786, -0.30490940811414624, -0.2913938445416241, 0.11506640268990016, -0.24229954389955324, -0.11033798660241137, 0.16586119512361588, -0.03521876022015691, 0.11804029191670985, 0.06505731760917716, -0.005765229983838306, -0.052424256396402934, -0.22819198018867398, 0.29849712174839904, 0.0628048377281126, 0.2699378503703951, 0.03682419731404848, 0.11954114528965544, -0.054680677909646494, -0.04248863638190226, 0.03479235979177082, -0.057590455648081365, 0.05752346177214049, 0.23665997181530302, 0.04152868570488578, 0.315901169561096, -0.44813389741730963, -0.2818205478901336, 0.08620757791059754, 0.15255489109338008, 0.16762616020465684, -0.05477982623529551, -0.2826406304447427, 0.08120637506531352, -0.14382573484812577, -0.12628584898275147, -0.08133379684776561, -0.001240224666000644, 0.04394554826219312, -0.2840858431973625, 0.10455036977756275, 0.05325657784749276, 0.00629705428332836, -0.04811591764455969, -0.10664531111251563, -0.024248270211117882, 0.12130536935313832, 0.0530220398380881, 0.00569537744885272, 0.110496428656615, -0.10713577766956622, -0.11618115076764433, 0.4051754898276211, -0.05471698047058303, -0.23604478939908533, 0.19224267156913968, -0.08047105621595574, -0.10182768219604718, 0.18184839855410034, 0.17705688486188412, 0.15369873357867467, -0.12976673737771796, 0.025475742853408263, 0.027841919759858, 0.12670291416454782, 0.07623078573826116, -0.030400891333706832, 0.11733963162338068, 0.18114303286314348, 0.0826256255602872, 0.1365353296160186, -0.10825742604134005, -0.14845694951262817, -0.2811060556232706, -0.14330845774720954, -0.18387958926171805, 0.020201783393057976, -0.09766146243349764, -0.1556650633415715, 0.37601929362132097, 0.15392366460811208, 0.18916502598700044, 0.028810603671114553, 0.3349525244360066, 0.12910750502728172, 0.024999692415518394, 0.07017135647633536, 0.19885896880964726, 0.13671820697928816, 0.12381915121593258, -0.2523724228463113, 0.12102333764153078, 0.08235573276592618] |
1,802.04117 | Review of Smart Meter Data Analytics: Applications, Methodologies, and
Challenges | The widespread popularity of smart meters enables an immense amount of
fine-grained electricity consumption data to be collected. Meanwhile, the
deregulation of the power industry, particularly on the delivery side, has
continuously been moving forward worldwide. How to employ massive smart meter
data to promote and enhance the efficiency and sustainability of the power grid
is a pressing issue. To date, substantial works have been conducted on smart
meter data analytics. To provide a comprehensive overview of the current
research and to identify challenges for future research, this paper conducts an
application-oriented review of smart meter data analytics. Following the three
stages of analytics, namely, descriptive, predictive and prescriptive
analytics, we identify the key application areas as load analysis, load
forecasting, and load management. We also review the techniques and
methodologies adopted or developed to address each application. In addition, we
also discuss some research trends, such as big data issues, novel machine
learning technologies, new business models, the transition of energy systems,
and data privacy and security.
| cs.CY | the widespread popularity of smart meters enables an immense amount of finegrained electricity consumption data to be collected meanwhile the deregulation of the power industry particularly on the delivery side has continuously been moving forward worldwide how to employ massive smart meter data to promote and enhance the efficiency and sustainability of the power grid is a pressing issue to date substantial works have been conducted on smart meter data analytics to provide a comprehensive overview of the current research and to identify challenges for future research this paper conducts an applicationoriented review of smart meter data analytics following the three stages of analytics namely descriptive predictive and prescriptive analytics we identify the key application areas as load analysis load forecasting and load management we also review the techniques and methodologies adopted or developed to address each application in addition we also discuss some research trends such as big data issues novel machine learning technologies new business models the transition of energy systems and data privacy and security | [['the', 'widespread', 'popularity', 'of', 'smart', 'meters', 'enables', 'an', 'immense', 'amount', 'of', 'finegrained', 'electricity', 'consumption', 'data', 'to', 'be', 'collected', 'meanwhile', 'the', 'deregulation', 'of', 'the', 'power', 'industry', 'particularly', 'on', 'the', 'delivery', 'side', 'has', 'continuously', 'been', 'moving', 'forward', 'worldwide', 'how', 'to', 'employ', 'massive', 'smart', 'meter', 'data', 'to', 'promote', 'and', 'enhance', 'the', 'efficiency', 'and', 'sustainability', 'of', 'the', 'power', 'grid', 'is', 'a', 'pressing', 'issue', 'to', 'date', 'substantial', 'works', 'have', 'been', 'conducted', 'on', 'smart', 'meter', 'data', 'analytics', 'to', 'provide', 'a', 'comprehensive', 'overview', 'of', 'the', 'current', 'research', 'and', 'to', 'identify', 'challenges', 'for', 'future', 'research', 'this', 'paper', 'conducts', 'an', 'applicationoriented', 'review', 'of', 'smart', 'meter', 'data', 'analytics', 'following', 'the', 'three', 'stages', 'of', 'analytics', 'namely', 'descriptive', 'predictive', 'and', 'prescriptive', 'analytics', 'we', 'identify', 'the', 'key', 'application', 'areas', 'as', 'load', 'analysis', 'load', 'forecasting', 'and', 'load', 'management', 'we', 'also', 'review', 'the', 'techniques', 'and', 'methodologies', 'adopted', 'or', 'developed', 'to', 'address', 'each', 'application', 'in', 'addition', 'we', 'also', 'discuss', 'some', 'research', 'trends', 'such', 'as', 'big', 'data', 'issues', 'novel', 'machine', 'learning', 'technologies', 'new', 'business', 'models', 'the', 'transition', 'of', 'energy', 'systems', 'and', 'data', 'privacy', 'and', 'security']] | [-0.09084801000010755, 0.01349006499973863, -0.045334577366399266, 0.03547911228157491, -0.1392917188017496, -0.16247827331313774, 0.06728298987183648, 0.36148714580728364, -0.2637448630107212, -0.3594494206481613, 0.1829394605992136, -0.3447800027733181, -0.11926902973694571, 0.22713030525795017, -0.1682986477251342, 0.10232244460244797, 0.06626410570710764, -0.00405353286502456, 0.0032079480865615465, -0.27853659433977945, 0.2823814813967883, 0.11578323710100016, 0.44014382913952604, 0.11834278747361775, 0.06555701408416055, -0.04621265657728405, -0.09179881246139605, -0.02738249307453987, -0.12973360834248956, 0.20523509881847227, 0.36914306871102825, 0.25073288831931895, 0.3981118790938386, -0.47747386199244785, -0.22551731498069352, 0.08756603992722896, 0.1371545254563292, 0.036819114978979564, -0.11259900533921263, -0.25481848176873645, 0.06201380131720465, -0.2533465185635058, -0.12124055056206305, -0.12434601703370433, 0.021891622809648868, 0.039209633331102806, -0.21710534884117633, -0.04497978710077448, -0.014792382890369654, 0.12512525535809496, -0.020427624563342846, -0.11644587031609956, 0.01880885103517877, 0.19860167032346085, 0.09366759963311433, -0.021861871346897845, 0.1717948733435367, -0.14621087322510512, -0.15089222414202855, 0.3818859244707883, 0.021556702606349495, -0.08920914616984581, 0.16410701512359083, -0.016764583955851516, -0.19426231912664316, 0.01805627829578173, 0.3142545605972243, 0.025636538145287584, -0.2206934794542446, 0.010707114365816648, 0.06449785077434388, 0.18051243205610218, 0.014976099953942355, 0.009036680267724608, 0.22347893028719618, 0.29422411349202904, 0.10693247590097599, 0.10239823845179108, -0.09996979840521124, -0.10615411166578442, -0.19341259999921367, -0.16006535853826098, -0.12065202170578275, 0.00921323191488184, -0.056153748050703486, -0.10048628931898358, 0.3953968850297055, 0.24728057568427175, 0.13653700274326616, -0.023789108599885367, 0.41493118006924523, 0.039967562089995703, 0.10032558771005522, 0.07736217372751396, 0.15556870671034198, 0.0014889900977279815, 0.2801930734089443, -0.14134886671118216, 0.05422831095555531, -0.05295933678696331] |
1,802.04118 | On a toy network of neurons interacting through their dendrites | Consider a large number $n$ of neurons, each being connected to approximately
$N$ other ones, chosen at random. When a neuron spikes, which occurs randomly
at some rate depending on its electric potential, its potential is set to a
minimum value $v_{min}$, and this initiates, after a small delay, two fronts on
the (linear) dendrites of all the neurons to which it is connected. Fronts move
at constant speed. When two fronts (on the dendrite of the same neuron)
collide, they annihilate. When a front hits the soma of a neuron, its potential
is increased by a small value $w_n$. Between jumps, the potentials of the
neurons are assumed to drift in $[v_{min},\infty)$, according to some
well-posed ODE. We prove the existence and uniqueness of a heuristically
derived mean-field limit of the system when $n,N \to \infty$ with $w_n \simeq
N^{-1/2}$. We make use of some recent versions of the results of Deuschel and
Zeitouni \cite{dz} concerning the size of the longest increasing subsequence of
an i.i.d. collection of points in the plan. We also study, in a very particular
case, a slightly different model where the neurons spike when their potential
reach some maximum value $v_{max}$, and find an explicit formula for the
(heuristic) mean-field limit.
| math.PR q-bio.NC | consider a large number n of neurons each being connected to approximately n other ones chosen at random when a neuron spikes which occurs randomly at some rate depending on its electric potential its potential is set to a minimum value v_min and this initiates after a small delay two fronts on the linear dendrites of all the neurons to which it is connected fronts move at constant speed when two fronts on the dendrite of the same neuron collide they annihilate when a front hits the soma of a neuron its potential is increased by a small value w_n between jumps the potentials of the neurons are assumed to drift in v_mininfty according to some wellposed ode we prove the existence and uniqueness of a heuristically derived meanfield limit of the system when nn to infty with w_n simeq n12 we make use of some recent versions of the results of deuschel and zeitouni citedz concerning the size of the longest increasing subsequence of an iid collection of points in the plan we also study in a very particular case a slightly different model where the neurons spike when their potential reach some maximum value v_max and find an explicit formula for the heuristic meanfield limit | [['consider', 'a', 'large', 'number', 'n', 'of', 'neurons', 'each', 'being', 'connected', 'to', 'approximately', 'n', 'other', 'ones', 'chosen', 'at', 'random', 'when', 'a', 'neuron', 'spikes', 'which', 'occurs', 'randomly', 'at', 'some', 'rate', 'depending', 'on', 'its', 'electric', 'potential', 'its', 'potential', 'is', 'set', 'to', 'a', 'minimum', 'value', 'v_min', 'and', 'this', 'initiates', 'after', 'a', 'small', 'delay', 'two', 'fronts', 'on', 'the', 'linear', 'dendrites', 'of', 'all', 'the', 'neurons', 'to', 'which', 'it', 'is', 'connected', 'fronts', 'move', 'at', 'constant', 'speed', 'when', 'two', 'fronts', 'on', 'the', 'dendrite', 'of', 'the', 'same', 'neuron', 'collide', 'they', 'annihilate', 'when', 'a', 'front', 'hits', 'the', 'soma', 'of', 'a', 'neuron', 'its', 'potential', 'is', 'increased', 'by', 'a', 'small', 'value', 'w_n', 'between', 'jumps', 'the', 'potentials', 'of', 'the', 'neurons', 'are', 'assumed', 'to', 'drift', 'in', 'v_mininfty', 'according', 'to', 'some', 'wellposed', 'ode', 'we', 'prove', 'the', 'existence', 'and', 'uniqueness', 'of', 'a', 'heuristically', 'derived', 'meanfield', 'limit', 'of', 'the', 'system', 'when', 'nn', 'to', 'infty', 'with', 'w_n', 'simeq', 'n12', 'we', 'make', 'use', 'of', 'some', 'recent', 'versions', 'of', 'the', 'results', 'of', 'deuschel', 'and', 'zeitouni', 'citedz', 'concerning', 'the', 'size', 'of', 'the', 'longest', 'increasing', 'subsequence', 'of', 'an', 'iid', 'collection', 'of', 'points', 'in', 'the', 'plan', 'we', 'also', 'study', 'in', 'a', 'very', 'particular', 'case', 'a', 'slightly', 'different', 'model', 'where', 'the', 'neurons', 'spike', 'when', 'their', 'potential', 'reach', 'some', 'maximum', 'value', 'v_max', 'and', 'find', 'an', 'explicit', 'formula', 'for', 'the', 'heuristic', 'meanfield', 'limit']] | [-0.13548996170120342, 0.14499663690783793, -0.031243712030966014, 0.02423957509137871, -0.03278789996142382, -0.17814506944585412, 0.09730010806103644, 0.35203358811638275, -0.2862461473865127, -0.22909964560937968, 0.093361849870049, -0.3290663454907684, -0.13145361857283047, 0.15964141476885824, -0.058023235059876756, 0.027831387374091226, 0.04925265511072883, 0.1262787449890205, -0.006021741826259034, -0.2725481895980814, 0.2565804763608929, -0.0013872862938176659, 0.2227861493796526, 0.006082981857652007, 0.11234486550974289, -0.028978418824443755, 0.044943955336139055, -0.0024097790239501443, -0.13253391817499188, 0.06603728011205286, 0.19212725742955158, 0.07988485679351408, 0.3274945538961193, -0.4572451009134789, -0.180013824358257, 0.1546728093814539, 0.14169905044718248, 0.11241883177477505, -0.0032521276932562368, -0.25041307603434015, 0.1063313687308375, -0.12045385923295382, -0.16833132940109422, 0.02751929023714501, 0.08470441689895629, 0.1113986116641843, -0.28086853418465324, 0.042454139468372, 0.059278400131112456, 0.006189416910892406, -0.04506269392943986, -0.10889282220583499, -0.037789650610648096, 0.10751640224658084, 0.07298824449241595, 0.053689030927009156, 0.1338242417635414, -0.16051452994703777, -0.04904724285006523, 0.31542283887929706, -0.06374211557033173, -0.1890294476032474, 0.18317782318612869, -0.15899091891410932, -0.11045150549246509, 0.13436234238991532, 0.150127044887942, 0.10070951028672744, -0.1214897869821232, 0.06723364917629227, -0.03161281569255064, 0.14952051338289854, 0.113321204759063, -0.019086363093556782, 0.16238450058831977, 0.16157370461241424, 0.1104549278631734, 0.11898597558305907, -0.06650474508523543, -0.0930566167565135, -0.32807095454626, -0.09535066802529348, -0.18395450497690352, 0.058293116645146054, -0.15953080335522332, -0.16895072512471035, 0.3871813398532714, 0.13078692046138773, 0.27111547521216056, 0.12975952860750078, 0.21811818271520483, 0.12891604579049581, 0.02342872416320284, 0.1012125361509603, 0.17979746526932272, 0.1416282715576529, 0.0806205200203197, -0.205184066347163, 0.06192809334861169, 0.06832413662121026] |
1,802.04119 | Fully self-referenced frequency comb consuming 5 Watts of electrical
power | We present a hybrid fiber/waveguide design for a 100-MHz frequency comb that
is fully self-referenced and temperature controlled with less than 5 W of
electrical power. Self-referencing is achieved by supercontinuum generation in
a silicon nitride waveguide, which requires much lower pulse energies (~200 pJ)
than with highly nonlinear fiber. These low-energy pulses are achieved with an
erbium fiber oscillator/amplifier pumped by two 250-mW passively-cooled pump
diodes that consume less than 5 W of electrical power. The temperature tuning
of the oscillator, necessary to stabilize the repetition rate in the presence
of environmental temperature changes, is achieved by resistive heating of a
section of gold-palladium-coated fiber within the laser cavity. By heating only
the small thermal mass of the fiber, the repetition rate is tuned over 4.2 kHz
(corresponding to an effective temperature change of 4.2 {\deg}C) with a fast
time constant of 0.5 s, at a low power consumption of 0.077 W/{\deg}C, compared
to 2.5 W/{\deg}C in the conventional 200-MHz comb design.
| physics.ins-det physics.optics | we present a hybrid fiberwaveguide design for a 100mhz frequency comb that is fully selfreferenced and temperature controlled with less than 5 w of electrical power selfreferencing is achieved by supercontinuum generation in a silicon nitride waveguide which requires much lower pulse energies 200 pj than with highly nonlinear fiber these lowenergy pulses are achieved with an erbium fiber oscillatoramplifier pumped by two 250mw passivelycooled pump diodes that consume less than 5 w of electrical power the temperature tuning of the oscillator necessary to stabilize the repetition rate in the presence of environmental temperature changes is achieved by resistive heating of a section of goldpalladiumcoated fiber within the laser cavity by heating only the small thermal mass of the fiber the repetition rate is tuned over 42 khz corresponding to an effective temperature change of 42 degc with a fast time constant of 05 s at a low power consumption of 0077 wdegc compared to 25 wdegc in the conventional 200mhz comb design | [['we', 'present', 'a', 'hybrid', 'fiberwaveguide', 'design', 'for', 'a', '100mhz', 'frequency', 'comb', 'that', 'is', 'fully', 'selfreferenced', 'and', 'temperature', 'controlled', 'with', 'less', 'than', '5', 'w', 'of', 'electrical', 'power', 'selfreferencing', 'is', 'achieved', 'by', 'supercontinuum', 'generation', 'in', 'a', 'silicon', 'nitride', 'waveguide', 'which', 'requires', 'much', 'lower', 'pulse', 'energies', '200', 'pj', 'than', 'with', 'highly', 'nonlinear', 'fiber', 'these', 'lowenergy', 'pulses', 'are', 'achieved', 'with', 'an', 'erbium', 'fiber', 'oscillatoramplifier', 'pumped', 'by', 'two', '250mw', 'passivelycooled', 'pump', 'diodes', 'that', 'consume', 'less', 'than', '5', 'w', 'of', 'electrical', 'power', 'the', 'temperature', 'tuning', 'of', 'the', 'oscillator', 'necessary', 'to', 'stabilize', 'the', 'repetition', 'rate', 'in', 'the', 'presence', 'of', 'environmental', 'temperature', 'changes', 'is', 'achieved', 'by', 'resistive', 'heating', 'of', 'a', 'section', 'of', 'goldpalladiumcoated', 'fiber', 'within', 'the', 'laser', 'cavity', 'by', 'heating', 'only', 'the', 'small', 'thermal', 'mass', 'of', 'the', 'fiber', 'the', 'repetition', 'rate', 'is', 'tuned', 'over', '42', 'khz', 'corresponding', 'to', 'an', 'effective', 'temperature', 'change', 'of', '42', 'degc', 'with', 'a', 'fast', 'time', 'constant', 'of', '05', 's', 'at', 'a', 'low', 'power', 'consumption', 'of', '0077', 'wdegc', 'compared', 'to', '25', 'wdegc', 'in', 'the', 'conventional', '200mhz', 'comb', 'design']] | [-0.14924664626267017, 0.22557480443278533, 0.022676197046109434, -0.08156197253851155, 0.004252111851149854, -0.2035194812225377, 0.08094884357019767, 0.46816426899823005, -0.2092736090340142, -0.3231032198212994, 0.07611088003192987, -0.24202214820902068, 0.0077701606670593695, 0.3058696180705051, -0.04338473856958719, 0.035734270899937304, -0.005476216929115402, -0.020779195887405635, -0.01818247555913228, -0.17118552749033478, 0.19223168791336176, 0.14157343237681327, 0.31309633123916836, 0.021358462432750833, 0.12505309028351833, -0.06175859657309528, 0.049281351400082406, -0.0785227773986382, -0.10992356810073366, 0.09298617560853017, 0.25112576050531565, -0.03191407497550519, 0.28261688409033436, -0.38583562092609563, -0.2243878266118092, 0.05286762243833791, 0.0909125642739705, 0.08166920727795376, -0.0574411758098681, -0.18723420489509152, 0.11384639207056999, -0.19430589968772055, -0.0938745046974564, -0.007593631221614075, 0.0076879783146926815, 0.03357139343993282, -0.2638115724958714, 0.05904009715568292, 0.046902402041263225, 0.08942028171376987, -0.009279154951291732, -0.0784391447983729, -0.0627562918897232, -0.011254200629843105, -0.06651712910114031, 0.05119951896709185, 0.23377665177935078, -0.10866532921014975, -0.07608987830151692, 0.34888547942417225, -0.13967940915343366, -0.06464808659756896, 0.11480457179904359, -0.17021084193772865, 0.0392822974138899, 0.2520288629398781, 0.12755074068382616, 0.09854599428304571, -0.13556258598527046, -0.019788827157159097, 0.08437669868493136, 0.3099811261727726, 0.19302210105735362, 0.1016758696978572, 0.16707100793602145, 0.23968049850455433, 0.07283887111086913, 0.12846135502093933, -0.10926479792351243, 0.010063771758837707, -0.23015617729170518, -0.0940825667982019, -0.17396710914670951, 0.11368675969552787, -0.11571409463955297, -0.07915968136311327, 0.4378286425035986, 0.09555427416128183, 0.1551591181752723, 0.023469159916283434, 0.312836137442094, 0.16390005895083057, 0.0967436065537117, 0.056247662817297865, 0.2955328218357743, 0.17061841700507221, 0.1451047457975728, -0.2567516592003218, -0.02662835005998799, -0.03705934660638091] |
1,802.0412 | Exact solution for Schwarzschild black hole in radiation gauge | Recently Chen and Zhu propose a true radiation gauge for gravity [Phys. Rev.
D 83, 061501(R) (2011)]. This work presents a general solution for the metric
of Schwarzschild black hole in this radiation gauge.
| physics.gen-ph | recently chen and zhu propose a true radiation gauge for gravity phys rev d 83 061501r 2011 this work presents a general solution for the metric of schwarzschild black hole in this radiation gauge | [['recently', 'chen', 'and', 'zhu', 'propose', 'a', 'true', 'radiation', 'gauge', 'for', 'gravity', 'phys', 'rev', 'd', '83', '061501r', '2011', 'this', 'work', 'presents', 'a', 'general', 'solution', 'for', 'the', 'metric', 'of', 'schwarzschild', 'black', 'hole', 'in', 'this', 'radiation', 'gauge']] | [-0.11581558295909096, 0.0622587944380939, -0.04520574809216401, -0.017308067126363954, -0.13384892747682683, -0.15169400171212413, 0.040258316323161125, 0.2527735307538772, -0.01844123311286025, -0.3632773345007616, -0.08172689032097183, -0.25553957219509515, -0.18623422924429178, 0.09824496773345505, -0.23644261347020373, 0.044916862936909586, -0.017586958594620228, -0.07030469009324032, -0.05325621770530501, -0.30451602844850106, 0.2582667883595123, 0.15997457986368852, 0.2524651639601764, 0.05899466004441766, 0.1042583402903641, 0.07728427041815046, -0.02376677411581006, 0.008259985897251788, -0.22060639061965048, 0.019493262776557135, 0.1914109707234756, 0.12196658710565637, 0.24703064517063253, -0.3077038218376829, -0.2999443154891624, 0.05643653606667238, 0.0321467002196347, 0.2057286727735225, -0.09371165961355847, -0.36977913953802166, 0.05822918551070068, -0.28333811292096095, -0.11064775129917133, -0.07527129930060576, 0.22350682460648172, -0.1723149327068206, -0.3009183194269152, 0.18315603167695158, 0.06436413433402777, -0.011094582650591345, -0.032120827722417956, -0.019795285370063913, 0.017565968966878513, -0.10298626448082573, 0.06130568146267358, 0.20781376147094896, 0.08538401862332488, -0.00885616207276197, -0.13878090793321676, 0.3374763162916197, -0.06341119220151621, -0.18795302609899356, 0.20002007736440966, -0.17208335365113966, -0.16596131141448175, 0.06530718434163753, 0.1585418723304482, 0.2789559051187312, -0.22272303295047843, 0.25952287177000577, -0.08498596635592334, 0.057311931310002416, 0.19071658218950582, 0.012716078331269434, 0.2639686827383497, 0.06339756525395547, -0.06696527475929435, 0.12240782297928543, -0.04505846167311949, -0.01954707656713093, -0.32926762520390396, -0.22910471422202297, -0.14672291492495468, 0.17697397509918494, -0.044622259830408864, -0.12405228077927057, 0.3574606503962594, 0.14169828276670374, 0.17985931038856506, 0.03170191692462301, 0.1773388328934636, 0.045708705164382565, -0.11705993904786952, 0.24378705041154342, 0.3761991426786956, 0.19084778583526393, 0.17312696252209955, -0.20519245813107667, -0.15519446078413987, 0.16973749161971843] |
1,802.04121 | Comparison Criteria for Discrete Fractional Sturm-Liouville Equations | In this study, we give the Sturm comparison theorems for discrete fractional
Sturm-Liouville (DFSL) equations within Riemann-Liouville and
Gr\"unwald-Letnikov sense. The emergence of Sturm-Liouville equations began as
one dimensional Schr\"odinger equation in quantum mechanics and one of the most
important results is Sturm comparison theorems [27]. These theorems give
information about the properties of zeros of two equations having different
potentials.
| math.CA math.SP | in this study we give the sturm comparison theorems for discrete fractional sturmliouville dfsl equations within riemannliouville and grunwaldletnikov sense the emergence of sturmliouville equations began as one dimensional schrodinger equation in quantum mechanics and one of the most important results is sturm comparison theorems 27 these theorems give information about the properties of zeros of two equations having different potentials | [['in', 'this', 'study', 'we', 'give', 'the', 'sturm', 'comparison', 'theorems', 'for', 'discrete', 'fractional', 'sturmliouville', 'dfsl', 'equations', 'within', 'riemannliouville', 'and', 'grunwaldletnikov', 'sense', 'the', 'emergence', 'of', 'sturmliouville', 'equations', 'began', 'as', 'one', 'dimensional', 'schrodinger', 'equation', 'in', 'quantum', 'mechanics', 'and', 'one', 'of', 'the', 'most', 'important', 'results', 'is', 'sturm', 'comparison', 'theorems', '27', 'these', 'theorems', 'give', 'information', 'about', 'the', 'properties', 'of', 'zeros', 'of', 'two', 'equations', 'having', 'different', 'potentials']] | [-0.12069983945273963, 0.037431255280666174, -0.11106046118017775, 0.12372584353949202, -0.10380620915503776, -0.16735260736685795, -0.04480347100294149, 0.24190430021005088, -0.22395192226585856, -0.24811653248187093, 0.1563558174243777, -0.3536560115877722, -0.1499666610396788, 0.1972139843999118, -0.08405778122317718, 0.10116098104540991, 0.055134184994414207, 0.030184546525620658, -0.12707390825523704, -0.20706258897410065, 0.34627716176089696, -0.09451527618154211, 0.17499587752047133, 0.03467162649651043, 0.09179142325139436, -0.009332074224567194, -0.07942744341037679, -0.07757516629749635, -0.22594573277480076, 0.11347824754193425, 0.2980644667185232, 0.026125585110705406, 0.3200694383045689, -0.45357793989423356, -0.19503252258615905, 0.10037298063884993, 0.1010295548247265, 0.05914474338232005, 0.00426859582667468, -0.32517523642201895, 0.01760179904045262, -0.07304204798868445, -0.23266167899013543, -0.05943763341571464, 0.018041140537281505, 0.07181788655761324, -0.17237584860842736, 0.18334174868612566, 0.12188453795235665, 0.06291915262576009, -0.13895611760786689, -0.15612986210550442, 0.023499532018742355, 0.05458800244664193, 0.022683856413379066, -0.07998517926469384, 0.01800045356551399, -0.07349373377083332, -0.20990644557378638, 0.34871903312255126, -0.044359929397793825, -0.24118977229370445, 0.12680930416786768, -0.13817263951860978, -0.17652380452720356, 0.050916865842080994, 0.09114854439299126, 0.16095315634471472, -0.19245270801494357, 0.12922823763276894, -0.039879829744945784, 0.0904079476279802, 0.1933162715629537, 0.07627429107784248, 0.08741658008428382, 0.09802305844963574, 0.08148341891584826, 0.10028655015191705, 0.022818570122596058, -0.22834215737634994, -0.34948309663622107, -0.19449495735624042, -0.14053815191794858, 0.13119263121224634, -0.18083775111380582, -0.20835950526363048, 0.4107441655131149, 0.15271741955934215, 0.09449945732981699, 0.04626063016228012, 0.1883869079537079, 0.24659108177980132, -0.01842707587925137, 0.013914090268252815, 0.17302411119835298, 0.29810690046211735, 0.1841596949570736, -0.1587820964956992, -0.06706455026249417, 0.2529934948829354] |
1,802.04122 | Tagvisor: A Privacy Advisor for Sharing Hashtags | Hashtag has emerged as a widely used concept of popular culture and
campaigns, but its implications on people's privacy have not been investigated
so far. In this paper, we present the first systematic analysis of privacy
issues induced by hashtags. We concentrate in particular on location, which is
recognized as one of the key privacy concerns in the Internet era. By relying
on a random forest model, we show that we can infer a user's precise location
from hashtags with accuracy of 70\% to 76\%, depending on the city. To remedy
this situation, we introduce a system called Tagvisor that systematically
suggests alternative hashtags if the user-selected ones constitute a threat to
location privacy. Tagvisor realizes this by means of three conceptually
different obfuscation techniques and a semantics-based metric for measuring the
consequent utility loss. Our findings show that obfuscating as little as two
hashtags already provides a near-optimal trade-off between privacy and utility
in our dataset. This in particular renders Tagvisor highly time-efficient, and
thus, practical in real-world settings.
| cs.CR cs.SI | hashtag has emerged as a widely used concept of popular culture and campaigns but its implications on peoples privacy have not been investigated so far in this paper we present the first systematic analysis of privacy issues induced by hashtags we concentrate in particular on location which is recognized as one of the key privacy concerns in the internet era by relying on a random forest model we show that we can infer a users precise location from hashtags with accuracy of 70 to 76 depending on the city to remedy this situation we introduce a system called tagvisor that systematically suggests alternative hashtags if the userselected ones constitute a threat to location privacy tagvisor realizes this by means of three conceptually different obfuscation techniques and a semanticsbased metric for measuring the consequent utility loss our findings show that obfuscating as little as two hashtags already provides a nearoptimal tradeoff between privacy and utility in our dataset this in particular renders tagvisor highly timeefficient and thus practical in realworld settings | [['hashtag', 'has', 'emerged', 'as', 'a', 'widely', 'used', 'concept', 'of', 'popular', 'culture', 'and', 'campaigns', 'but', 'its', 'implications', 'on', 'peoples', 'privacy', 'have', 'not', 'been', 'investigated', 'so', 'far', 'in', 'this', 'paper', 'we', 'present', 'the', 'first', 'systematic', 'analysis', 'of', 'privacy', 'issues', 'induced', 'by', 'hashtags', 'we', 'concentrate', 'in', 'particular', 'on', 'location', 'which', 'is', 'recognized', 'as', 'one', 'of', 'the', 'key', 'privacy', 'concerns', 'in', 'the', 'internet', 'era', 'by', 'relying', 'on', 'a', 'random', 'forest', 'model', 'we', 'show', 'that', 'we', 'can', 'infer', 'a', 'users', 'precise', 'location', 'from', 'hashtags', 'with', 'accuracy', 'of', '70', 'to', '76', 'depending', 'on', 'the', 'city', 'to', 'remedy', 'this', 'situation', 'we', 'introduce', 'a', 'system', 'called', 'tagvisor', 'that', 'systematically', 'suggests', 'alternative', 'hashtags', 'if', 'the', 'userselected', 'ones', 'constitute', 'a', 'threat', 'to', 'location', 'privacy', 'tagvisor', 'realizes', 'this', 'by', 'means', 'of', 'three', 'conceptually', 'different', 'obfuscation', 'techniques', 'and', 'a', 'semanticsbased', 'metric', 'for', 'measuring', 'the', 'consequent', 'utility', 'loss', 'our', 'findings', 'show', 'that', 'obfuscating', 'as', 'little', 'as', 'two', 'hashtags', 'already', 'provides', 'a', 'nearoptimal', 'tradeoff', 'between', 'privacy', 'and', 'utility', 'in', 'our', 'dataset', 'this', 'in', 'particular', 'renders', 'tagvisor', 'highly', 'timeefficient', 'and', 'thus', 'practical', 'in', 'realworld', 'settings']] | [-0.10177700120822171, 0.0053944839767235166, -0.07121173483593499, 0.10617932541371214, -0.1294964929768706, -0.1586105351610219, 0.11454799017690889, 0.4024662074249457, -0.24028071362580009, -0.3267896488418474, 0.08774287685176686, -0.3004724828635945, -0.19954071043620764, 0.2101098322898478, -0.15172374232343452, 0.04211209973094382, 0.030950388694455957, 0.046009676297463185, -0.003980553402181934, -0.2689485252807465, 0.34883456679492475, 0.06589635157245485, 0.327189336296664, 0.09194159105913166, 0.08835053335437003, -0.010446557588190498, -0.04542597212883479, 0.03413781880894128, -0.10022270128936404, 0.1433291518868988, 0.2925116683341056, 0.23142096551237046, 0.3693529448198045, -0.37524044705445275, -0.2079253256375737, 0.07477290080312421, 0.1662363912546425, 0.12126700657981393, -0.10880398932050037, -0.31564228970776587, 0.09047741551938303, -0.20544777676764436, -0.06435932220535025, -0.0858748605598093, -0.00012677444131387508, -0.006807480091982357, -0.21202500475406208, 0.030788819832891664, 0.01951963928363779, 0.08656194686122677, 0.014335618913858471, -0.08402258905184948, 0.000505297609796638, 0.14924983258687835, 0.08115944621386006, -0.012445797245292102, 0.13220995385199785, -0.12362201453241355, -0.15999781593735166, 0.39416040580938844, -0.03655104857787271, -0.17312970819389994, 0.16686675224918873, -0.07549884114140536, -0.17597061987582813, 0.029660370196763645, 0.21471228224827962, 0.11621619006618858, -0.18866420624681804, 0.0167249060852234, -0.057700955067925594, 0.18861014816690894, 0.06734513417160248, 0.05338340628864791, 0.168578064874472, 0.21624471647990182, 0.09042209314648061, 0.11362714124021724, -0.06638603966737933, -0.07439109486911227, -0.21301798329085989, -0.14403479702989844, -0.14003409747760195, 0.032950558912039817, -0.07389932927737176, -0.14336168337270946, 0.3898158145520617, 0.23350892675876178, 0.21338981741436702, 0.03988610649933381, 0.3360314505941728, 0.024156619431724882, 0.06812138277215554, 0.08771835198242436, 0.22187542691073545, -0.003229524864924743, 0.1363824808038771, -0.12251362766392584, 0.16839255676056972, 0.01105711128535297] |
1,802.04123 | Iterated logarithms and gradient flows | We consider applications of the theory of balanced weight filtrations and
iterated logarithms, initiated in arXiv:1706.01073, to PDEs. The main result is
a complete description of the asymptotics of the Yang--Mills flow on the space
of metrics on a holomorphic bundle over a Riemann surface. A key ingredient in
the argument is a monotonicity property of the flow which holds in arbitrary
dimension. The A-side analog is a modified curve shortening flow for which we
provide a heuristic calculation in support of a detailed conjectural picture.
| math.RT math.AP math.DG | we consider applications of the theory of balanced weight filtrations and iterated logarithms initiated in arxiv170601073 to pdes the main result is a complete description of the asymptotics of the yangmills flow on the space of metrics on a holomorphic bundle over a riemann surface a key ingredient in the argument is a monotonicity property of the flow which holds in arbitrary dimension the aside analog is a modified curve shortening flow for which we provide a heuristic calculation in support of a detailed conjectural picture | [['we', 'consider', 'applications', 'of', 'the', 'theory', 'of', 'balanced', 'weight', 'filtrations', 'and', 'iterated', 'logarithms', 'initiated', 'in', 'arxiv170601073', 'to', 'pdes', 'the', 'main', 'result', 'is', 'a', 'complete', 'description', 'of', 'the', 'asymptotics', 'of', 'the', 'yangmills', 'flow', 'on', 'the', 'space', 'of', 'metrics', 'on', 'a', 'holomorphic', 'bundle', 'over', 'a', 'riemann', 'surface', 'a', 'key', 'ingredient', 'in', 'the', 'argument', 'is', 'a', 'monotonicity', 'property', 'of', 'the', 'flow', 'which', 'holds', 'in', 'arbitrary', 'dimension', 'the', 'aside', 'analog', 'is', 'a', 'modified', 'curve', 'shortening', 'flow', 'for', 'which', 'we', 'provide', 'a', 'heuristic', 'calculation', 'in', 'support', 'of', 'a', 'detailed', 'conjectural', 'picture']] | [-0.19396317445618264, 0.04225217404172701, -0.1702975730466492, 0.08242550349712152, -0.07400811484960072, -0.08488064154927784, 0.03004495284985751, 0.2848742489839959, -0.23386697047663962, -0.19300250575384673, 0.10359402511487989, -0.22840374032692873, -0.17499120072735583, 0.22229330840465777, -0.12190284047494916, 0.05437555519096991, 0.06429146186941687, 0.046960773097474456, -0.09523969668456737, -0.23810319078620523, 0.37751790399608365, 0.013816964943372808, 0.2503508729750619, 0.1225808364982881, 0.12429531963870806, 0.04551150409833473, -0.053613250790273445, 0.00725111736169578, -0.1681321489679463, 0.17291034597369348, 0.22795385185300426, 0.072346174040371, 0.2510576785706422, -0.3809805529438617, -0.23368922784267104, 0.10490553637637812, 0.10137814653708654, 0.06760181556455791, -0.015465893456712365, -0.19147677888326786, 0.09177655404269257, -0.144713461081333, -0.2104323548867422, -0.05330924719352933, 0.010918505139210645, -0.004514148195876795, -0.2708586124045884, 0.021030442318057313, 0.13935961870969657, 0.09077717086628956, -0.0772884355748401, -0.03729415556196781, -0.016681523511514945, 0.07560747445095331, 0.039221892819520744, 0.06474021049764227, 0.08357191538328633, -0.14555285782484775, -0.12019949390883353, 0.3808659182368394, -0.08596328760990325, -0.21135937965968077, 0.1092509862528566, -0.10489519957233878, -0.15503538635504596, 0.13024485139724087, 0.17260008589912426, 0.15842980145312408, -0.056720912215464256, 0.13096195327816532, -0.10423446256557808, 0.09684865927214131, 0.08100125328363741, -0.0046597863437936584, 0.15314329244634683, 0.15691882270552657, 0.10815666900838122, 0.1477586923276677, 0.0034829376600956654, -0.1320713750716737, -0.39765565985923307, -0.2449533553684459, -0.1525295246830758, 0.150913680552998, -0.12785999393073486, -0.21775133765357382, 0.42503026732079247, 0.04341394357821521, 0.21834792873876938, 0.09965047184651828, 0.27856686605031, 0.11911579172181733, 0.057053545402253374, 0.05698464811396073, 0.16590229029602865, 0.1948221866698826, 0.07088140166392003, -0.166414342234459, 0.018813654121956513, 0.2254476892597535] |
1,802.04124 | Impact of Oxygen Diffusion on Superconductivity in
YBa$_2$Cu$_3$O$_{7-\delta}$ Thin Films Studied by Positron Annihilation
Spectroscopy | The oxygen deficiency $\delta$ in YBa$_2$Cu$_3$O$_{7-\delta}$ (YBCO) plays a
crucial role for affecting high-temperature superconductivity. We applied
(coincident) Doppler broadening spectroscopy of the electron-positron
annihilation line to study in situ the temperature dependence of the oxygen
concentration and its depth profile in single crystalline YBCO film grown on
SrTiO$_3$ (STO) substrates. The oxygen diffusion during tempering was found to
lead to a distinct depth dependence of $\delta$, which is not accessible using
X-ray diffraction. A steady-state reached within a few minutes is defined by
both, the oxygen exchange at the surface and at the interface to the STO
substrate. Moreover, we revealed the depth dependent critical temperature
$T_{\mathrm{c}}$ in the as prepared and tempered YBCO film.
| cond-mat.supr-con | the oxygen deficiency delta in yba_2cu_3o_7delta ybco plays a crucial role for affecting hightemperature superconductivity we applied coincident doppler broadening spectroscopy of the electronpositron annihilation line to study in situ the temperature dependence of the oxygen concentration and its depth profile in single crystalline ybco film grown on srtio_3 sto substrates the oxygen diffusion during tempering was found to lead to a distinct depth dependence of delta which is not accessible using xray diffraction a steadystate reached within a few minutes is defined by both the oxygen exchange at the surface and at the interface to the sto substrate moreover we revealed the depth dependent critical temperature t_mathrmc in the as prepared and tempered ybco film | [['the', 'oxygen', 'deficiency', 'delta', 'in', 'yba_2cu_3o_7delta', 'ybco', 'plays', 'a', 'crucial', 'role', 'for', 'affecting', 'hightemperature', 'superconductivity', 'we', 'applied', 'coincident', 'doppler', 'broadening', 'spectroscopy', 'of', 'the', 'electronpositron', 'annihilation', 'line', 'to', 'study', 'in', 'situ', 'the', 'temperature', 'dependence', 'of', 'the', 'oxygen', 'concentration', 'and', 'its', 'depth', 'profile', 'in', 'single', 'crystalline', 'ybco', 'film', 'grown', 'on', 'srtio_3', 'sto', 'substrates', 'the', 'oxygen', 'diffusion', 'during', 'tempering', 'was', 'found', 'to', 'lead', 'to', 'a', 'distinct', 'depth', 'dependence', 'of', 'delta', 'which', 'is', 'not', 'accessible', 'using', 'xray', 'diffraction', 'a', 'steadystate', 'reached', 'within', 'a', 'few', 'minutes', 'is', 'defined', 'by', 'both', 'the', 'oxygen', 'exchange', 'at', 'the', 'surface', 'and', 'at', 'the', 'interface', 'to', 'the', 'sto', 'substrate', 'moreover', 'we', 'revealed', 'the', 'depth', 'dependent', 'critical', 'temperature', 't_mathrmc', 'in', 'the', 'as', 'prepared', 'and', 'tempered', 'ybco', 'film']] | [-0.10139649641370915, 0.2198328462284829, -0.04961942971065833, -0.005017182336124624, -0.003118700139096071, -0.1253637941233043, 0.1298271122765888, 0.46223556741686733, -0.2702034356008316, -0.2970274414642361, 0.009795539948190081, -0.3203835019215556, -0.02116896947524671, 0.21462033054759277, 0.03389835895384373, 0.0446204334805551, -0.05416630485079026, -0.0674964895528131, -0.09884678387255728, -0.2303627123253356, 0.26365720489511973, 0.07628737242715754, 0.3510122954913672, 0.13941368367522955, 0.02113520384139927, -0.002773776485841593, 0.0843834868744658, 0.011817012508078638, -0.1978528089138904, 0.02150593197840298, 0.2685748525104357, -0.10928273329447055, 0.16507970569013009, -0.462612715100163, -0.23902822462520723, 0.005741400885042445, 0.15590961164281028, 0.0805649833978507, -0.09140174757741423, -0.224054286886681, 0.019992412001713467, -0.05963831009535954, -0.13081334980309073, -0.0014149095995576475, 0.001346842731060139, -0.04245625617151181, -0.2412880398980382, 0.12928760130006564, 0.034994087310443664, 0.15252382287370234, -0.10210316252577568, -0.10783093055340878, -0.14464845941381946, 0.04256243533645516, 0.037720997711434834, 0.09672115231936412, 0.26541345721865395, -0.09846312066154747, -0.006088156935534087, 0.29932335569876534, -0.0995298689873568, -0.02166230919578209, 0.1500720800269909, -0.207874330938874, -0.08921404004273616, 0.18055952964190009, 0.08976037159224907, 0.11759943966071346, -0.14015668538270581, 0.07811791303914827, 0.03838999314908067, 0.2473734040897147, 0.15211954526603222, 0.02356752031482756, 0.21553534504873195, 0.24143123964815208, 0.014280485222116113, 0.12426538641387917, -0.1926903209693184, 0.030366123091943305, -0.205074552649327, -0.19213468996719618, -0.17236478474585276, 0.05084901638863436, -0.07413705637849614, -0.2110976113472134, 0.3452037879916165, 0.12262263340104756, 0.19721852003693066, -0.11709060386758587, 0.22192279622360164, 0.10073435659709001, 0.06481596549314543, 0.0044767441115631116, 0.227873590823006, 0.18393153986484134, 0.17512688779769914, -0.29941846471749534, 0.1839179314175171, -0.018609467703158612] |
1,802.04125 | On a nonstatic Painleve-Gullstrand spacetime | A time dependent geometry outside a spherically symmetric mass is proposed.
The source has zero energy density but nonzero radial and tangential pressures.
The time variable is interpreted as the duration of measurement performed upon
the physical system. For very short time intervals, the effect of the mass
source is much reduced, going to zero when $t \rightarrow 0$. All physical
quantities are finite when $t \rightarrow 0$ and $r \rightarrow 0$ and also at
infinity. The total energy flux measured on a hypersurface of constant $r$ is
vanishing.
| physics.gen-ph | a time dependent geometry outside a spherically symmetric mass is proposed the source has zero energy density but nonzero radial and tangential pressures the time variable is interpreted as the duration of measurement performed upon the physical system for very short time intervals the effect of the mass source is much reduced going to zero when t rightarrow 0 all physical quantities are finite when t rightarrow 0 and r rightarrow 0 and also at infinity the total energy flux measured on a hypersurface of constant r is vanishing | [['a', 'time', 'dependent', 'geometry', 'outside', 'a', 'spherically', 'symmetric', 'mass', 'is', 'proposed', 'the', 'source', 'has', 'zero', 'energy', 'density', 'but', 'nonzero', 'radial', 'and', 'tangential', 'pressures', 'the', 'time', 'variable', 'is', 'interpreted', 'as', 'the', 'duration', 'of', 'measurement', 'performed', 'upon', 'the', 'physical', 'system', 'for', 'very', 'short', 'time', 'intervals', 'the', 'effect', 'of', 'the', 'mass', 'source', 'is', 'much', 'reduced', 'going', 'to', 'zero', 'when', 't', 'rightarrow', '0', 'all', 'physical', 'quantities', 'are', 'finite', 'when', 't', 'rightarrow', '0', 'and', 'r', 'rightarrow', '0', 'and', 'also', 'at', 'infinity', 'the', 'total', 'energy', 'flux', 'measured', 'on', 'a', 'hypersurface', 'of', 'constant', 'r', 'is', 'vanishing']] | [-0.17309717068793984, 0.19670688468711764, -0.06717911600187589, 0.04004658406516642, -0.026997749374530623, -0.15860993914787522, 0.04001896562619826, 0.34480173442136036, -0.261438156268821, -0.23908838118018394, 0.08764889285889234, -0.2723566172539853, 0.04339878024072962, 0.154139683979532, 0.014861094556079152, 0.037539951365932904, 0.002167619534590271, 0.12705566818574757, -0.11741086855279596, -0.19815573221846913, 0.2797106089818637, 0.07829076882577345, 0.2254199091386929, 0.08773031318037028, 0.1042110677945867, -0.022665161260121157, -0.006582708793870184, 0.02455585990938243, -0.1763489282208631, -0.08490828286563412, 0.21286770488983126, 0.07515904209524225, 0.25069918887417636, -0.3385989584912954, -0.20529755232123176, 0.15133374672006356, 0.12811569779002097, 0.045941951402117695, 0.022076108444513482, -0.2449091403127721, 0.10800696505505718, -0.13263047468231132, -0.17042588164213668, 0.013830153909878115, 0.15102879922795162, 0.010305643301415309, -0.26923575759813023, 0.12391059294969545, 0.04089900895199749, 0.05776413744629434, -0.07536655465883904, -0.16892615689378065, -0.09148650266899822, 0.08805855776685594, 0.09565658638191023, 0.11248505752784817, 0.15189621350571011, -0.06683610018677591, 0.006720258310186059, 0.3412738475697429, -0.1308051957879634, -0.21542502228128776, 0.15406393775653637, -0.19676940004979626, -0.08087763799814864, 0.17810517681364932, 0.13544315302592774, 0.18073494554486838, -0.10212580753611976, 0.17665938775936726, 0.010716447218195693, 0.17978646966113362, 0.0975467942529515, 0.009731436632259676, 0.19955867133364918, 0.09698398223439797, 0.07931825429661556, 0.07147711426872509, -0.11297348516030509, -0.039727633240831534, -0.38363894686270295, -0.12982984960832622, -0.21829419618268403, 0.13910254430067673, -0.11296177233698165, -0.12703833936221814, 0.32903213949685683, 0.040405680456858, 0.24119843624982187, 0.09672003257182542, 0.28858333470278913, 0.16241791919580126, 0.04305470515607616, 0.07243110694702756, 0.19302011082430234, 0.15443020664793805, 0.14062993394294648, -0.22970374523965495, 0.05859902152121904, 0.025090715097096025] |
1,802.04126 | Classification of proper holomorphic mappings between certain unbounded
non-hyperbolic domains | The Fock-Bargmann-Hartogs domain $D_{n,m}(\mu)$ ($\mu>0$) in
$\mathbb{C}^{n+m}$ is defined by the inequality $\|w\|^2<e^{-\mu\|z\|^2},$
where $(z,w)\in \mathbb{C}^n\times \mathbb{C}^m$, which is an unbounded
non-hyperbolic domain in $\mathbb{C}^{n+m}$. Recently, Tu-Wang obtained the
rigidity result that proper holomorphic self-mappings of $D_{n,m}(\mu)$ are
automorphisms for $m\geq 2$, and found a counter-example to show that the
rigidity result isn't true for $D_{n,1}(\mu)$. In this article, we obtain a
classification of proper holomorphic mappings between $D_{n,1}(\mu)$ and
$D_{N,1}(\mu)$ with $N<2n$.
| math.CV | the fockbargmannhartogs domain d_nmmu mu0 in mathbbcnm is defined by the inequality w2emuz2 where zwin mathbbcntimes mathbbcm which is an unbounded nonhyperbolic domain in mathbbcnm recently tuwang obtained the rigidity result that proper holomorphic selfmappings of d_nmmu are automorphisms for mgeq 2 and found a counterexample to show that the rigidity result isnt true for d_n1mu in this article we obtain a classification of proper holomorphic mappings between d_n1mu and d_n1mu with n2n | [['the', 'fockbargmannhartogs', 'domain', 'd_nmmu', 'mu0', 'in', 'mathbbcnm', 'is', 'defined', 'by', 'the', 'inequality', 'w2emuz2', 'where', 'zwin', 'mathbbcntimes', 'mathbbcm', 'which', 'is', 'an', 'unbounded', 'nonhyperbolic', 'domain', 'in', 'mathbbcnm', 'recently', 'tuwang', 'obtained', 'the', 'rigidity', 'result', 'that', 'proper', 'holomorphic', 'selfmappings', 'of', 'd_nmmu', 'are', 'automorphisms', 'for', 'mgeq', '2', 'and', 'found', 'a', 'counterexample', 'to', 'show', 'that', 'the', 'rigidity', 'result', 'isnt', 'true', 'for', 'd_n1mu', 'in', 'this', 'article', 'we', 'obtain', 'a', 'classification', 'of', 'proper', 'holomorphic', 'mappings', 'between', 'd_n1mu', 'and', 'd_n1mu', 'with', 'n2n']] | [-0.17487693638799506, 0.06372732543180366, -0.04647444327323077, 0.029055019538241647, -0.058354637931592554, -0.16408236839601564, -0.021282421011063788, 0.34754485204919344, -0.27374568503970903, -0.17064139720686297, 0.12632962772396342, -0.26124438063965905, -0.16904395240029166, 0.195145219616178, -0.16139547746732003, 0.021287325368676748, 0.03711094564965202, 0.05143376215710305, -0.05561575528635229, -0.22234222160962722, 0.37653085749803317, -0.10364356678393152, 0.15071739125738126, 0.13117383919759756, 0.09708298152933519, -0.019165208614948723, 0.027720035150802385, -0.01695215255798151, -0.20472152151604758, 0.09744932442360248, 0.27958628064435387, 0.0916409950134241, 0.23111600172705948, -0.28295728512522245, -0.1766371297692078, 0.21570622122898284, 0.13437036328509244, -0.05057354943548691, -0.02327047901861887, -0.311512838725725, 0.1368632254727547, -0.08612984211908446, -0.17066527152847913, -0.08064042240019059, 0.08921288098726007, 0.008807187511896094, -0.2948058581678197, 0.0784148008743715, 0.21422484804255268, 0.10961088367750765, -0.09568845367498903, -0.07984206918627024, -0.06452816374237752, 0.07649105562207599, 0.016119721132175375, 0.17882021394648795, 0.015876840237372864, -0.029172126517450023, -0.08427009045974249, 0.3150811689621251, -0.04251064778913537, -0.2684085288136784, 0.10026079199613175, -0.1709045523376618, -0.18693891165538742, 0.07823692394110064, 0.08524875223196836, 0.1513900852167151, -0.09774865451941474, 0.19588218565816837, -0.10765381465898827, 0.11876804417827064, 0.15809269827150274, -0.05996376667947819, 0.04986056178394291, 0.08300270232009804, 0.1549514889354921, 0.13143710993851224, 0.03362680061642701, -0.0035977567442589337, -0.3560392558057275, -0.18347455374896526, -0.17742963646176374, 0.14147822701165247, -0.12369086681307333, -0.13679002340520835, 0.2835891813479571, 0.003818182640113971, 0.2061923645540244, 0.15275036823166172, 0.1746108002876604, 0.035340711461483605, 0.02737761447658866, 0.11212942403896402, 0.17532756079324624, 0.14809880155048127, 0.013159245343154503, -0.10002528577266882, -0.02767219682896717, 0.14884378441557702] |
1,802.04127 | A New Algorithmic Decision for Categorical Syllogisms via Caroll's
Diagrams | In this paper, we deal with a calculus system SLCD (Syllogistic Logic with
Carroll Diagrams), which gives a formal approach to logical reasoning with
diagrams, for representations of the fundamental Aristotelian categorical
propositions and show that they are closed under the syllogistic criterion of
inference which is the deletion of middle term. Therefore, it is implemented to
let the formalism comprise synchronically bilateral and trilateral
diagrammatical appearance and a naive algorithmic nature. And also, there is no
need specific knowledge or exclusive ability to understand as well as to use
it. Consequently, we give an effective algorithm used to determine whether a
syllogistic reasoning valid or not by using SLCD.
| cs.AI cs.LO | in this paper we deal with a calculus system slcd syllogistic logic with carroll diagrams which gives a formal approach to logical reasoning with diagrams for representations of the fundamental aristotelian categorical propositions and show that they are closed under the syllogistic criterion of inference which is the deletion of middle term therefore it is implemented to let the formalism comprise synchronically bilateral and trilateral diagrammatical appearance and a naive algorithmic nature and also there is no need specific knowledge or exclusive ability to understand as well as to use it consequently we give an effective algorithm used to determine whether a syllogistic reasoning valid or not by using slcd | [['in', 'this', 'paper', 'we', 'deal', 'with', 'a', 'calculus', 'system', 'slcd', 'syllogistic', 'logic', 'with', 'carroll', 'diagrams', 'which', 'gives', 'a', 'formal', 'approach', 'to', 'logical', 'reasoning', 'with', 'diagrams', 'for', 'representations', 'of', 'the', 'fundamental', 'aristotelian', 'categorical', 'propositions', 'and', 'show', 'that', 'they', 'are', 'closed', 'under', 'the', 'syllogistic', 'criterion', 'of', 'inference', 'which', 'is', 'the', 'deletion', 'of', 'middle', 'term', 'therefore', 'it', 'is', 'implemented', 'to', 'let', 'the', 'formalism', 'comprise', 'synchronically', 'bilateral', 'and', 'trilateral', 'diagrammatical', 'appearance', 'and', 'a', 'naive', 'algorithmic', 'nature', 'and', 'also', 'there', 'is', 'no', 'need', 'specific', 'knowledge', 'or', 'exclusive', 'ability', 'to', 'understand', 'as', 'well', 'as', 'to', 'use', 'it', 'consequently', 'we', 'give', 'an', 'effective', 'algorithm', 'used', 'to', 'determine', 'whether', 'a', 'syllogistic', 'reasoning', 'valid', 'or', 'not', 'by', 'using', 'slcd']] | [-0.05854648299445616, 0.04878661470505666, -0.13049420054051628, 0.12496285567660685, -0.16978873680650353, -0.1764932704905035, 0.08521977875427404, 0.37654763001243574, -0.2748856117652955, -0.3219094522837027, 0.08761406372079329, -0.19890192615139737, -0.1809569507419506, 0.1525927025337364, -0.13964382712685755, 0.0015538268108965358, 0.03691860504239519, 0.09973471934872323, -0.04544063783498268, -0.2285321436204434, 0.31193493962044194, 0.013022520294343339, 0.23049169081637513, 0.055490729424593294, 0.11333091453754911, 0.05160599008907573, -0.018968319972959634, 0.029267016857009484, -0.09790415783603425, 0.14944055560697742, 0.32414304236794395, 0.19643115148149, 0.2729029318591945, -0.42499462046843267, -0.13841843182464766, 0.09985492489448636, 0.14125536051992257, 0.08712921547921043, 0.038192892273035, -0.2861092191137304, 0.09026726525903583, -0.19881590661618895, -0.09279376001610795, -0.1615027135290275, 0.04079690215691367, -0.041908510951934576, -0.25970417433897053, -0.007677658512713997, 0.1507439277097844, 0.0855082266171959, -0.027236065696750845, -0.06561138435532382, 0.020268999406780664, 0.11696194940481648, 0.0003306782264784675, 0.0348578313992263, 0.08429721882131612, -0.0947266777011209, -0.1841654091655651, 0.38012137812362096, 0.0001811481703281681, -0.25756203515507353, 0.191973335809231, -0.06471163342558892, -0.15640378729918988, 0.06948085681091402, 0.09501745899982542, 0.07917360146747571, -0.1690964067232943, 0.08098790525441345, -0.02371263553205634, 0.1806829913865305, 0.07999061833562277, 0.028882375986872363, 0.1926032231476541, 0.13752776335611522, 0.006957115857888048, 0.13598044375479917, 0.006842556479169387, -0.12537096422078592, -0.3296114357501686, -0.159441383981787, -0.08321586201646339, 0.0379347183066257, -0.031739998055582815, -0.2281602812521856, 0.31893667077023324, 0.19428744481098034, 0.1561468211018968, 0.08796752954693947, 0.29310973923409656, 0.11529271432773044, 0.09445839443148296, 0.0670475196572038, 0.14350726883901962, 0.15975488577186017, 0.07509138769683402, -0.131730934674634, 0.09958269735188963, 0.08629705225308991] |
1,802.04128 | Smart energy management as a means towards improved energy efficiency | The costs associated with refrigerator equipment often represent more than
half of the total energy costs in supermarkets. This presents a good motivation
for running these systems efficiently. In this study, we investigate different
ways to construct a reference behavior, which can serve as a baseline for
judging the performance of energy consumption. We used 3 distinct learning
models: Multiple Linear Regression, Random Forests, and Artificial Neural
Networks. During our experiments we used a variation of the sliding window
method in combination with learning curves. We applied this approach on five
different supermarkets, across Portugal. We are able to create baselines using
off-the-shelf data mining techniques. Moreover, we found a way to create them
based on short term historical data. We believe that our research will serve as
a base for future studies, for which we provide interesting directions.
| cs.CY cs.LG | the costs associated with refrigerator equipment often represent more than half of the total energy costs in supermarkets this presents a good motivation for running these systems efficiently in this study we investigate different ways to construct a reference behavior which can serve as a baseline for judging the performance of energy consumption we used 3 distinct learning models multiple linear regression random forests and artificial neural networks during our experiments we used a variation of the sliding window method in combination with learning curves we applied this approach on five different supermarkets across portugal we are able to create baselines using offtheshelf data mining techniques moreover we found a way to create them based on short term historical data we believe that our research will serve as a base for future studies for which we provide interesting directions | [['the', 'costs', 'associated', 'with', 'refrigerator', 'equipment', 'often', 'represent', 'more', 'than', 'half', 'of', 'the', 'total', 'energy', 'costs', 'in', 'supermarkets', 'this', 'presents', 'a', 'good', 'motivation', 'for', 'running', 'these', 'systems', 'efficiently', 'in', 'this', 'study', 'we', 'investigate', 'different', 'ways', 'to', 'construct', 'a', 'reference', 'behavior', 'which', 'can', 'serve', 'as', 'a', 'baseline', 'for', 'judging', 'the', 'performance', 'of', 'energy', 'consumption', 'we', 'used', '3', 'distinct', 'learning', 'models', 'multiple', 'linear', 'regression', 'random', 'forests', 'and', 'artificial', 'neural', 'networks', 'during', 'our', 'experiments', 'we', 'used', 'a', 'variation', 'of', 'the', 'sliding', 'window', 'method', 'in', 'combination', 'with', 'learning', 'curves', 'we', 'applied', 'this', 'approach', 'on', 'five', 'different', 'supermarkets', 'across', 'portugal', 'we', 'are', 'able', 'to', 'create', 'baselines', 'using', 'offtheshelf', 'data', 'mining', 'techniques', 'moreover', 'we', 'found', 'a', 'way', 'to', 'create', 'them', 'based', 'on', 'short', 'term', 'historical', 'data', 'we', 'believe', 'that', 'our', 'research', 'will', 'serve', 'as', 'a', 'base', 'for', 'future', 'studies', 'for', 'which', 'we', 'provide', 'interesting', 'directions']] | [-0.08625016230779949, 0.038694229322023314, -0.09902483877464593, 0.09607570857335579, -0.10579016743723652, -0.1561149288263681, 0.07648768104452024, 0.44956979214501896, -0.25783864707223697, -0.33365152366526374, 0.09657420674188183, -0.2709646024305722, -0.16788454098700673, 0.2634764578890243, -0.08054877408250845, 0.0532867920102565, 0.09841943148895428, 0.013069495654425403, -0.038361797938391354, -0.28062361746812037, 0.2639440414529267, 0.06390062621426132, 0.3258114336527509, 0.01247672319559635, 0.08755041696231732, -0.006726017903549959, -0.049225435506807066, 0.03027342704104648, -0.11076978540301144, 0.17743920181750608, 0.33724268413896413, 0.1633293599077909, 0.3089386954293888, -0.4492797312936444, -0.2208067479094477, 0.11646052647596426, 0.10182147801069798, 0.10455499904853352, -0.04470822349638367, -0.2380936851845585, 0.06311120044753264, -0.18705103401992496, -0.08716738525536849, -0.11320868684581929, -0.03352652282768981, 0.0412956653016271, -0.27318227721257604, -0.0006094886904595781, 0.0050855583189685135, 0.06775501822690955, -0.04439640212335068, -0.14710287446919962, 0.0611154955992703, 0.1624220815862415, 0.034669659921242824, 0.01613793827856308, 0.10560015388998947, -0.08564613527608299, -0.1573143378620391, 0.3706834266337452, -0.11118267512959411, -0.1892499362190569, 0.2312114302239803, -0.027334865802403192, -0.16814598843468714, 0.055712355970800355, 0.26402470985722304, 0.09932570725850252, -0.16121643542466188, -0.04193280235296383, -0.010306421251927348, 0.15938927441594197, 0.03896532507392196, -0.007740052530823423, 0.22244660606735098, 0.2383131670946483, 0.055928796322064864, 0.1627736851219557, -0.11900328172989719, -0.05819548186410567, -0.25672148764945846, -0.12703601296793454, -0.13184228067775425, 0.022577572116467486, -0.07084195879981066, -0.12565590342734573, 0.4124197149515259, 0.21956780204790638, 0.20215736773860032, 0.08399052262157972, 0.3152080566602216, 0.04663412384487849, 0.11279610093522201, 0.08323263356515723, 0.17962099688559796, -0.00298798776720818, 0.1578488534169017, -0.1520427112264907, 0.05302889727846646, -0.005819580993420786] |
1,802.04129 | Integer completely positive matrices of order two | We show that every integer doubly nonnegative $2 \times 2$ matrix has an
integer cp-factorization.
| math.OC | we show that every integer doubly nonnegative 2 times 2 matrix has an integer cpfactorization | [['we', 'show', 'that', 'every', 'integer', 'doubly', 'nonnegative', '2', 'times', '2', 'matrix', 'has', 'an', 'integer', 'cpfactorization']] | [-0.20250021889805794, 0.19150439039124953, 0.004232613493998846, -0.027062364295125006, 0.03774297991767526, -0.29183289520442485, -0.11606656533355514, 0.3948361774285634, -0.3187841941912969, -0.15182705981036027, 0.18810314806178213, -0.3793009455005328, -0.27353687000771365, 0.019682406013210616, 0.0013825152069330215, 0.010101000382564961, 0.054786629726489386, 0.12128838375210763, -0.12198391828375559, -0.31580460667610166, 0.26457434793313345, -0.1537175669024388, 0.02269816448291143, 0.09566674667100111, 0.21057958950599034, 0.0704021376868089, 0.06028135406474273, 0.0269203282892704, -0.09671079692052445, 0.0013665517792105675, 0.27994436770677567, 0.20567291378974914, 0.33340946162740387, -0.412218463193858, -0.06731237744291624, 0.25920350179076196, 0.12647859153027335, 0.03339979574084282, -0.0657502203558882, -0.14738962488869825, 0.3055256880819798, -0.13673426310221354, -0.11540146463861069, -0.04478802291365961, 0.26695731381575266, -0.11688758954405784, -0.4245640836656094, -0.05466115263601144, 0.06530700903385878, -0.0038557155057787895, -0.030421232432127, -0.38615939213583866, 0.046471710627277694, 0.01886303008844455, -0.04491548898319404, 0.08572568943103155, -0.04677672281007593, 0.04473299930493037, -0.2535580104837815, 0.27259626270582277, -0.09899039442340533, -0.26368020015458266, 0.009753058354059855, -0.16751641382773716, -0.19071463098128635, 0.1813399851322174, 0.10789558980613947, 0.1492860034108162, 0.038349620749553046, 0.1778022105495135, -0.2336301808555921, 0.32669522166252135, 0.029099160929520924, -0.07350756845747432, 0.15486624756207068, 0.05550928885738055, 0.17861926406621934, 0.08094844377289216, -0.01910276859998703, 0.08582130068292221, -0.25371951597432296, -0.19881398648334045, -0.2813828801115354, 0.24182101438442866, -0.20076047039280334, -0.09348755652705829, 0.3058260592321555, 0.004231903205315272, 0.1782663121819496, 0.21071156940112512, 0.187141205308338, 0.2320135795821746, -0.013794146726528804, 0.15157094721992811, 0.002924264447453121, 0.09379969437917074, -0.029886850838859877, -0.14380110849936803, -0.010007199893395106, 0.11858848979075749] |
1,802.0413 | Exploring the decay probability of neutron-rich superheavy nuclei | The modes of decay for the even-even isotopes of superheavy nuclei of Z = 118
and 120 with neutron number $160 \leq N \leq 204$ are investigated in the
framework of the axially deformed relativistic mean field model. The asymmetry
parameter $\eta$ and the relative neutron-proton asymmetry of the surface to
the center ($R_{\eta}$) are estimated for the ground state density
distributions of the nuclei. We suggest that the resulting asymmetry parameter
$\eta$ and the relative neutron-proton asymmetry $R_{\eta}$ of the density play
a crucial role in the preformation factor of the decay half life.
| nucl-th | the modes of decay for the eveneven isotopes of superheavy nuclei of z 118 and 120 with neutron number 160 leq n leq 204 are investigated in the framework of the axially deformed relativistic mean field model the asymmetry parameter eta and the relative neutronproton asymmetry of the surface to the center r_eta are estimated for the ground state density distributions of the nuclei we suggest that the resulting asymmetry parameter eta and the relative neutronproton asymmetry r_eta of the density play a crucial role in the preformation factor of the decay half life | [['the', 'modes', 'of', 'decay', 'for', 'the', 'eveneven', 'isotopes', 'of', 'superheavy', 'nuclei', 'of', 'z', '118', 'and', '120', 'with', 'neutron', 'number', '160', 'leq', 'n', 'leq', '204', 'are', 'investigated', 'in', 'the', 'framework', 'of', 'the', 'axially', 'deformed', 'relativistic', 'mean', 'field', 'model', 'the', 'asymmetry', 'parameter', 'eta', 'and', 'the', 'relative', 'neutronproton', 'asymmetry', 'of', 'the', 'surface', 'to', 'the', 'center', 'r_eta', 'are', 'estimated', 'for', 'the', 'ground', 'state', 'density', 'distributions', 'of', 'the', 'nuclei', 'we', 'suggest', 'that', 'the', 'resulting', 'asymmetry', 'parameter', 'eta', 'and', 'the', 'relative', 'neutronproton', 'asymmetry', 'r_eta', 'of', 'the', 'density', 'play', 'a', 'crucial', 'role', 'in', 'the', 'preformation', 'factor', 'of', 'the', 'decay', 'half', 'life']] | [-0.10448815269356078, 0.23336173379991917, -0.06196022259586669, 0.11210473819061163, 0.07111826294319744, -0.06396836597234645, 0.05786704547960866, 0.3124966368158447, -0.1996223856199612, -0.3233472929172654, -0.04285084582280685, -0.31185982713198407, 0.0384828222573715, 0.12468538288413449, 0.10471720380233006, 0.021064943386281423, -0.00818494944139681, 0.05748012864050713, -0.07102752192332311, -0.16591706680520338, 0.3160606908235461, 0.08167731250695726, 0.26902624564443495, 0.05377603244863728, 0.02303301226942146, 0.023103072223788563, 0.006104317642352048, -0.06444119555043414, -0.15741405399564834, 0.08453144020638725, 0.19895648286043804, 0.053592074206693374, 0.17756551029061543, -0.3544029776759921, -0.11659197460741122, 0.16249572107211707, 0.19011706040498424, 0.08823802096254015, -0.07626073661834952, -0.29881021519132117, 0.07772340578648777, -0.2190260412617329, -0.18787389728141593, -0.02334201225931657, 0.11102940553942933, 0.06378435206777872, -0.274975676927344, 0.14409658221646826, -0.013435106082203887, 0.04915899003637915, -0.11671279334126318, -0.25052004697871333, -0.07583746913463828, 0.06181292880841709, 0.13072510560890263, 0.05237864911496798, 0.18751304747754746, -0.12340889268733085, -0.006906644193495208, 0.3755823843815225, -0.013749658675032092, -0.11604270684790421, 0.025791180022853487, -0.21363733406674038, -0.10061642607832526, 0.1804328663175569, 0.17276158217994614, 0.14726395074753684, -0.05481144142872159, 0.09369628256040705, -0.023124398851886073, 0.18641894030325273, 0.03146220235237009, 0.042629334844024654, 0.18855763422672023, 0.16506945617506874, -0.029429310268940443, 0.035028348775937204, -0.2304315057365184, -0.10578261762659283, -0.3560380381185244, -0.15391686411098915, -0.09566040300922667, 0.04890205024059198, -0.12586964434461712, -0.06820628712321582, 0.3688442787314032, 0.027610935934601313, 0.23317241242918324, -0.019460034281748567, 0.19113000361447005, 0.08652795222092499, 0.024409659008713478, 0.061884130369822314, 0.34103663692726416, 0.25717316443556326, 0.044569390351596745, -0.3310543002481473, 0.05220665430967161, 0.010093534982049877] |
1,802.04131 | Annular Evaluation and Link Homology | We use categorical annular evaluation to give a uniform construction of both
$\mathfrak{sl}_n$ and HOMFLYPT Khovanov-Rozansky link homology, as well as
annular versions of these theories. Variations on our construction yield
$\mathfrak{gl}_{-n}$ link homology, i.e. a link homology theory associated to
the Lie superalgebra $\mathfrak{gl}_{0|n}$, both for links in $S^3$ and in the
thickened annulus. In the $n=2$ case, this produces a categorification of the
Jones polynomial that we show is distinct from Khovanov homology, and gives a
finite-dimensional categorification of the colored Jones polynomial. This
behavior persists for general $n$. Our approach yields simple constructions of
spectral sequences relating these theories, and emphasizes the roles of super
vector spaces, categorical traces, and current algebras in link homology.
| math.GT math.QA math.RT | we use categorical annular evaluation to give a uniform construction of both mathfraksl_n and homflypt khovanovrozansky link homology as well as annular versions of these theories variations on our construction yield mathfrakgl_n link homology ie a link homology theory associated to the lie superalgebra mathfrakgl_0n both for links in s3 and in the thickened annulus in the n2 case this produces a categorification of the jones polynomial that we show is distinct from khovanov homology and gives a finitedimensional categorification of the colored jones polynomial this behavior persists for general n our approach yields simple constructions of spectral sequences relating these theories and emphasizes the roles of super vector spaces categorical traces and current algebras in link homology | [['we', 'use', 'categorical', 'annular', 'evaluation', 'to', 'give', 'a', 'uniform', 'construction', 'of', 'both', 'mathfraksl_n', 'and', 'homflypt', 'khovanovrozansky', 'link', 'homology', 'as', 'well', 'as', 'annular', 'versions', 'of', 'these', 'theories', 'variations', 'on', 'our', 'construction', 'yield', 'mathfrakgl_n', 'link', 'homology', 'ie', 'a', 'link', 'homology', 'theory', 'associated', 'to', 'the', 'lie', 'superalgebra', 'mathfrakgl_0n', 'both', 'for', 'links', 'in', 's3', 'and', 'in', 'the', 'thickened', 'annulus', 'in', 'the', 'n2', 'case', 'this', 'produces', 'a', 'categorification', 'of', 'the', 'jones', 'polynomial', 'that', 'we', 'show', 'is', 'distinct', 'from', 'khovanov', 'homology', 'and', 'gives', 'a', 'finitedimensional', 'categorification', 'of', 'the', 'colored', 'jones', 'polynomial', 'this', 'behavior', 'persists', 'for', 'general', 'n', 'our', 'approach', 'yields', 'simple', 'constructions', 'of', 'spectral', 'sequences', 'relating', 'these', 'theories', 'and', 'emphasizes', 'the', 'roles', 'of', 'super', 'vector', 'spaces', 'categorical', 'traces', 'and', 'current', 'algebras', 'in', 'link', 'homology']] | [-0.22962777795365605, 0.05023614308422702, -0.1303418346752341, 0.11134364252858278, -0.07334214647431882, -0.1687005183611734, -0.03396803154122546, 0.3401555867754241, -0.32854982688386214, -0.2677776513513751, 0.0757709929249926, -0.18338062246723108, -0.25276670248534244, 0.16239879657633793, -0.1857464359824458, -0.052424416614648625, 0.07456897874561767, 0.07402938184563197, -0.10213393514426664, -0.26395531109749126, 0.36257808351427573, -0.010136514390683454, 0.19575987635259953, 0.05920573279388949, 0.07713124733895828, 0.0343584783283723, -0.08270432479265663, -0.026770588527950976, -0.191248305956149, 0.14892026658406735, 0.3090514100721886, 0.025502360843790647, 0.08850179208267449, -0.38928397100132245, -0.09368688943467508, 0.13260264820459053, 0.15492404359900272, 0.016015979365851633, 0.00704885289992373, -0.2660038465590208, 0.06770346029542196, -0.24124107062498218, -0.10494586516521935, -0.07845735286848031, 0.02129133369646266, -0.011210166982526326, -0.2130671895117077, 0.010169922407770243, 0.07286890325610104, 0.1331935997526997, -0.04310141948577112, -0.0875753733741406, -0.02642959238201157, 0.12754521866400653, -0.03152174349579737, 0.05470657120976183, 0.10417329662869501, -0.16806068113193107, -0.22571219428259337, 0.3371445626880114, -0.06345202749730366, -0.22581560941588166, 0.18022583544445345, -0.12342399313377264, -0.24926634748569793, 0.12983071900760898, -0.009375123227508659, 0.08465154398169018, 0.025388624280309066, 0.15702132620146245, -0.14293849656883723, 0.0515926281372324, 0.12139049186729468, 0.016459374443297554, 0.20230034708530983, 0.0849066187396773, 0.06970003218604968, 0.19624724309159142, -0.0007847306566336789, -0.12095564540274617, -0.32872596946664345, -0.24487352335047471, -0.0906208532018603, 0.10817749497807051, -0.1613080235844643, -0.20228959169461685, 0.4186655693552178, 0.07438691017719415, 0.17320606005019867, 0.23843378343611446, 0.2565405817113371, 0.04401831370260981, 0.07027131920127182, 0.007961246005904216, 0.08808223486870018, 0.27583210683690434, 0.050712911814100974, -0.10530720439811166, -0.022733606246865202, 0.26635076861796725] |
1,802.04132 | Hierarchical Learning for Modular Robots | We argue that hierarchical methods can become the key for modular robots
achieving reconfigurability. We present a hierarchical approach for modular
robots that allows a robot to simultaneously learn multiple tasks. Our
evaluation results present an environment composed of two different modular
robot configurations, namely 3 degrees-of-freedom (DoF) and 4DoF with two
corresponding targets. During the training, we switch between configurations
and targets aiming to evaluate the possibility of training a neural network
that is able to select appropriate motor primitives and robot configuration to
achieve the target. The trained neural network is then transferred and executed
on a real robot with 3DoF and 4DoF configurations. We demonstrate how this
technique generalizes to robots with different configurations and tasks.
| cs.RO | we argue that hierarchical methods can become the key for modular robots achieving reconfigurability we present a hierarchical approach for modular robots that allows a robot to simultaneously learn multiple tasks our evaluation results present an environment composed of two different modular robot configurations namely 3 degreesoffreedom dof and 4dof with two corresponding targets during the training we switch between configurations and targets aiming to evaluate the possibility of training a neural network that is able to select appropriate motor primitives and robot configuration to achieve the target the trained neural network is then transferred and executed on a real robot with 3dof and 4dof configurations we demonstrate how this technique generalizes to robots with different configurations and tasks | [['we', 'argue', 'that', 'hierarchical', 'methods', 'can', 'become', 'the', 'key', 'for', 'modular', 'robots', 'achieving', 'reconfigurability', 'we', 'present', 'a', 'hierarchical', 'approach', 'for', 'modular', 'robots', 'that', 'allows', 'a', 'robot', 'to', 'simultaneously', 'learn', 'multiple', 'tasks', 'our', 'evaluation', 'results', 'present', 'an', 'environment', 'composed', 'of', 'two', 'different', 'modular', 'robot', 'configurations', 'namely', '3', 'degreesoffreedom', 'dof', 'and', '4dof', 'with', 'two', 'corresponding', 'targets', 'during', 'the', 'training', 'we', 'switch', 'between', 'configurations', 'and', 'targets', 'aiming', 'to', 'evaluate', 'the', 'possibility', 'of', 'training', 'a', 'neural', 'network', 'that', 'is', 'able', 'to', 'select', 'appropriate', 'motor', 'primitives', 'and', 'robot', 'configuration', 'to', 'achieve', 'the', 'target', 'the', 'trained', 'neural', 'network', 'is', 'then', 'transferred', 'and', 'executed', 'on', 'a', 'real', 'robot', 'with', '3dof', 'and', '4dof', 'configurations', 'we', 'demonstrate', 'how', 'this', 'technique', 'generalizes', 'to', 'robots', 'with', 'different', 'configurations', 'and', 'tasks']] | [-0.13497459920545837, 0.05497900751126371, -0.09055298817257922, -0.004793883340448893, -0.1254084349860351, -0.21025858255212798, 0.033554574615564665, 0.4811658933289161, -0.22065237341370403, -0.36960844254950764, 0.0209622396813596, -0.18336786058383597, -0.23171069300068275, 0.18503584860659697, -0.10534707921314515, 0.09855632562612911, 0.14515532143785767, 0.027674399355442084, -0.0139212331337416, -0.270571051334704, 0.3299991237422737, -0.0058375591991328395, 0.2876001431317139, -0.01901887318103754, 0.21775307021487286, 0.008945397535699005, 0.06756691755179096, -0.05554816800467044, -0.061989845310280615, 0.17644303742044865, 0.3187110551139888, 0.18153291163934754, 0.25802623545124875, -0.44559075861059894, -0.14263495848271526, 0.0984402571984825, 0.13976109747094015, 0.07063388143971312, 0.028501928556013946, -0.3360967859782341, 0.12510301601709092, -0.17208602845261828, -0.07190493829235309, -0.15395985870082088, -0.03559597543276408, -0.004649818366189965, -0.336102737947328, -0.09587228705053914, 0.03039276973586999, 0.05887926405123552, -0.09201648351276576, -0.07619698169962072, 0.01025485315266214, 0.23364209150504164, -0.020388543914940927, 0.037788473500111025, 0.1969429682602738, -0.15043683855214984, -0.18279213558866822, 0.35617706631975515, 0.046570985578000546, -0.25869666188250945, 0.24113663667891205, -0.027704362260537737, -0.15662117137088433, 0.0684119736259224, 0.25354077382905393, 0.12715692429200692, -0.17223059141836247, -0.044936432713983156, -0.019086081816368745, 0.20390684922233598, 0.05219356950466372, -0.06498467805208404, 0.16663674996606223, 0.2549118698425904, 0.08642594344100031, 0.20038304338231683, -0.11120291249317844, -0.11638155576827772, -0.22088435190160438, -0.11091169528271846, -0.15084715243507207, -0.04663240200519061, -0.08465951748760692, -0.060499285871750956, 0.3908058815780526, 0.21172920486473032, 0.20945215420093105, 0.13880676544514023, 0.34178035601410045, -0.019939657143207595, 0.12951189157466927, 0.110357312235136, 0.18218224960528, -0.0007041448476810415, 0.11821508179066562, -0.19564609123519114, 0.03456064421652245, -0.014743721906972282] |
1,802.04133 | A semi-analytical approach to black body radiation | We describe a semi-analytical method to calculate the total radiance received
form a black body, between two frequencies. As has been done before, the method
takes advantage of the fact that the solution simplifies with the use of
polylogarithm functions. We then use it to study the amount of radiation from
the sun received by bodies at Earths surface.
| physics.gen-ph | we describe a semianalytical method to calculate the total radiance received form a black body between two frequencies as has been done before the method takes advantage of the fact that the solution simplifies with the use of polylogarithm functions we then use it to study the amount of radiation from the sun received by bodies at earths surface | [['we', 'describe', 'a', 'semianalytical', 'method', 'to', 'calculate', 'the', 'total', 'radiance', 'received', 'form', 'a', 'black', 'body', 'between', 'two', 'frequencies', 'as', 'has', 'been', 'done', 'before', 'the', 'method', 'takes', 'advantage', 'of', 'the', 'fact', 'that', 'the', 'solution', 'simplifies', 'with', 'the', 'use', 'of', 'polylogarithm', 'functions', 'we', 'then', 'use', 'it', 'to', 'study', 'the', 'amount', 'of', 'radiation', 'from', 'the', 'sun', 'received', 'by', 'bodies', 'at', 'earths', 'surface']] | [-0.05155057471119246, 0.04635695192836604, -0.11964980350985878, 0.0344752231297099, -0.0826142820198152, -0.027954353840421824, 0.040822234288868255, 0.3600922371892227, -0.21924613922897537, -0.31551816691723417, 0.04767007031872616, -0.2809300512643689, -0.16987130921965432, 0.23104079478120398, -0.03744557888199717, 0.03999411179763028, 0.04460578079935226, 0.06227828650656393, -0.08218901638746641, -0.22352412769223673, 0.31726761834727507, 0.05434915467591609, 0.24468788993939505, 0.033944573955831385, 0.14399804653781387, 0.01721581647772405, -0.03349562182675226, 0.006659230681025754, -0.11134553554734725, 0.12091674314717114, 0.18830242279475018, 0.18388441117811885, 0.27808280601718666, -0.47372411399827163, -0.25029716937471247, 0.08197007312486737, 0.10744266270786144, 0.14826948763960499, -0.04651553867290081, -0.21294812536877344, 0.06698760732818963, -0.2314951774048603, -0.13268693558619185, 0.005056937604006064, 0.06844008938898727, -0.01088048316048995, -0.22544358904331419, 0.021747287141822152, 0.005425253914574445, 0.01761024581047438, -0.0718638687473485, -0.112302442744248, -0.03035519484004353, 0.16748754377082242, 0.12304487691844924, 0.028833420430231144, 0.13381452749530642, -0.06687024066824529, -0.02549598167918749, 0.3898997183541878, -0.08172715666814376, -0.18661279966896874, 0.15494744789044737, -0.19660228567387342, -0.08818878360503053, 0.18417795082964636, 0.19808991673260423, 0.14505478207385009, -0.14768163441538307, 0.09356370528812631, -0.026506797189555936, 0.14467735437013335, 0.12860083020828916, -0.0014499884209264132, 0.24797344747615063, 0.09992446810385938, 0.0191782056196135, 0.20071934315107637, -0.11849484990461398, -0.05798126469855591, -0.23577408394697358, -0.1552083706207005, -0.23239966746719587, 0.019592300605944406, -0.02592113833495621, -0.1281014136677525, 0.3776805745082576, 0.15310735781124588, 0.19050561006859704, 0.0635591372847557, 0.3385340602184504, 0.13090895873818043, 0.09332697964825873, 0.0564199950633831, 0.29110840032413854, 0.14224959398477766, 0.12283068429678679, -0.21143683788398185, 0.0437702667678438, 0.1376807934809792] |
1,802.04134 | Power System Simulation Using the Differential Transformation Method | This paper proposes a new semi-analytical approach for online time-domain
power system simulation. The approach applies the differential transformation
method (DTM) to the power system differential equation model to offline derive
a semi-analytical solution (SAS) having symbolic variables about time, the
initial state and system conditions. When simulation is online needed for a
contingency under the current system condition, the SAS can be evaluated in
real time to generate simulation results. Compared to the Adomian decomposition
method in obtaining a power system SAS, an SAS derived by the DTM adopts a
recursive form to avoid generating and storing its complete symbolic
expression, which makes both derivation and evaluation of the SAS more
efficient especially for multi-machine power systems. The optimal order of a
DTM-based SAS is studied for the best time performance of simulation. The paper
also designs a parallel computing strategy for power system simulation using
the DTM-based SAS. Tests on the IEEE 10-machine 39-bus system demonstrate
significant speedup of simulation using the proposed approach compared with the
Runge-Kutta method.
| math.DS cs.SY math.NA | this paper proposes a new semianalytical approach for online timedomain power system simulation the approach applies the differential transformation method dtm to the power system differential equation model to offline derive a semianalytical solution sas having symbolic variables about time the initial state and system conditions when simulation is online needed for a contingency under the current system condition the sas can be evaluated in real time to generate simulation results compared to the adomian decomposition method in obtaining a power system sas an sas derived by the dtm adopts a recursive form to avoid generating and storing its complete symbolic expression which makes both derivation and evaluation of the sas more efficient especially for multimachine power systems the optimal order of a dtmbased sas is studied for the best time performance of simulation the paper also designs a parallel computing strategy for power system simulation using the dtmbased sas tests on the ieee 10machine 39bus system demonstrate significant speedup of simulation using the proposed approach compared with the rungekutta method | [['this', 'paper', 'proposes', 'a', 'new', 'semianalytical', 'approach', 'for', 'online', 'timedomain', 'power', 'system', 'simulation', 'the', 'approach', 'applies', 'the', 'differential', 'transformation', 'method', 'dtm', 'to', 'the', 'power', 'system', 'differential', 'equation', 'model', 'to', 'offline', 'derive', 'a', 'semianalytical', 'solution', 'sas', 'having', 'symbolic', 'variables', 'about', 'time', 'the', 'initial', 'state', 'and', 'system', 'conditions', 'when', 'simulation', 'is', 'online', 'needed', 'for', 'a', 'contingency', 'under', 'the', 'current', 'system', 'condition', 'the', 'sas', 'can', 'be', 'evaluated', 'in', 'real', 'time', 'to', 'generate', 'simulation', 'results', 'compared', 'to', 'the', 'adomian', 'decomposition', 'method', 'in', 'obtaining', 'a', 'power', 'system', 'sas', 'an', 'sas', 'derived', 'by', 'the', 'dtm', 'adopts', 'a', 'recursive', 'form', 'to', 'avoid', 'generating', 'and', 'storing', 'its', 'complete', 'symbolic', 'expression', 'which', 'makes', 'both', 'derivation', 'and', 'evaluation', 'of', 'the', 'sas', 'more', 'efficient', 'especially', 'for', 'multimachine', 'power', 'systems', 'the', 'optimal', 'order', 'of', 'a', 'dtmbased', 'sas', 'is', 'studied', 'for', 'the', 'best', 'time', 'performance', 'of', 'simulation', 'the', 'paper', 'also', 'designs', 'a', 'parallel', 'computing', 'strategy', 'for', 'power', 'system', 'simulation', 'using', 'the', 'dtmbased', 'sas', 'tests', 'on', 'the', 'ieee', '10machine', '39bus', 'system', 'demonstrate', 'significant', 'speedup', 'of', 'simulation', 'using', 'the', 'proposed', 'approach', 'compared', 'with', 'the', 'rungekutta', 'method']] | [-0.12607382013277874, -0.07867888770589382, -0.11987051904510111, 0.016385454231233904, -0.059769306453110196, -0.14766943389715176, 0.04470764284129613, 0.33884092207623306, -0.2490656250555994, -0.3090623875297386, 0.143372099558663, -0.23401034766664872, -0.1686678982268159, 0.29397336382022093, -0.03931589620794065, 0.13773642595514335, 0.10324847999100502, -0.006864684097986867, -0.042409393842712306, -0.24567861509503874, 0.26649460470656583, 0.09521216887308384, 0.32373512022268885, -0.04789956267847344, 0.15574283683920534, -0.0031211301202185935, -0.0571422192334203, 0.01716827799031544, -0.08801820378794649, 0.09850178445419351, 0.25458565740928757, 0.18181395054293367, 0.2527925144307889, -0.4219578245114645, -0.16904762937665294, 0.046561869081749016, 0.1406974328362201, 0.11166639336365546, -0.06547913781324878, -0.2625702557170532, 0.12495166918031386, -0.22724679624524033, -0.09796292108043439, -0.1316439956851984, -0.00819755918842316, 0.026247651922067395, -0.35769880300156287, 0.0368954361533805, 0.02977584982318418, 0.045638554900355593, -0.08189616194229088, -0.09881376245364921, 0.04185333685775855, 0.08685300928990346, -0.038543849590388764, -0.021514127130162788, 0.09338175093468565, -0.06879216885523452, -0.12423394514921468, 0.37863725090961486, -0.029138553221834017, -0.24376182526952075, 0.14586346349320733, -0.057768448958581194, -0.08252959878090219, 0.14471088516520414, 0.23261941803520073, 0.12480127738965069, -0.19634345729848074, 0.058194057361881345, 0.0023139432725667423, 0.21198887482682277, 0.034219672280699893, -0.058118254954777876, 0.11463584480862293, 0.2212973039627582, 0.0639941474524762, 0.15222978519658784, -0.05235265255575041, -0.13042973305963906, -0.25000437855522134, -0.16229956815041294, -0.1672103948527451, -0.02464643136746961, -0.10722760372416643, -0.15893633590360895, 0.3942806736094954, 0.18847871088207915, 0.07820488450244158, 0.13130614650229092, 0.42271712030003056, 0.19123350813455836, 0.006791980273073771, 0.10633388869795045, 0.1623854559554151, 0.06733404623465777, 0.1650603117101644, -0.25828697009993024, 0.07024354324538327, 0.06856610686325375] |
1,802.04135 | A New Uzawa-exact Type Algorithm for Nonsymmetric Saddle Point Problems | Saddle point problems have been attracting people's attention in recent
years. To solve large and sparse saddle point problems, Uzawa type algorithms
were proposed. The main contribution of this paper is to present a new
Uzawa-exact type algorithm from the aspect of optimization method to solve
nonsymmetric saddle point problems, which often arise from linear variational
inequalities and finite element discretization of Navier-Stokes equations. In
the paper, convergence of the new algorithm is analysed and numerical
experiments are presented.
| math.OC | saddle point problems have been attracting peoples attention in recent years to solve large and sparse saddle point problems uzawa type algorithms were proposed the main contribution of this paper is to present a new uzawaexact type algorithm from the aspect of optimization method to solve nonsymmetric saddle point problems which often arise from linear variational inequalities and finite element discretization of navierstokes equations in the paper convergence of the new algorithm is analysed and numerical experiments are presented | [['saddle', 'point', 'problems', 'have', 'been', 'attracting', 'peoples', 'attention', 'in', 'recent', 'years', 'to', 'solve', 'large', 'and', 'sparse', 'saddle', 'point', 'problems', 'uzawa', 'type', 'algorithms', 'were', 'proposed', 'the', 'main', 'contribution', 'of', 'this', 'paper', 'is', 'to', 'present', 'a', 'new', 'uzawaexact', 'type', 'algorithm', 'from', 'the', 'aspect', 'of', 'optimization', 'method', 'to', 'solve', 'nonsymmetric', 'saddle', 'point', 'problems', 'which', 'often', 'arise', 'from', 'linear', 'variational', 'inequalities', 'and', 'finite', 'element', 'discretization', 'of', 'navierstokes', 'equations', 'in', 'the', 'paper', 'convergence', 'of', 'the', 'new', 'algorithm', 'is', 'analysed', 'and', 'numerical', 'experiments', 'are', 'presented']] | [-0.0732139517666581, -0.01675073740382989, -0.1084446440068766, 0.05003438854906469, -0.11361779893438022, -0.18020071504183877, 0.018979533656070437, 0.341147635000734, -0.34381436587621766, -0.273075439943335, 0.15515934994432312, -0.2866884587475887, -0.21906211329862857, 0.19602627673735604, -0.11658293302529134, 0.15052504105588946, 0.13579147359213004, -0.04277454875409603, -0.1004688317144218, -0.274452964309603, 0.34510515697407895, -0.009338433651301341, 0.2565654179451462, 0.040485738549763575, 0.12739370031377825, -0.09190675037172742, -0.0440242346495581, 0.060042873347321384, -0.08559101668353646, 0.13675027011702648, 0.32418881483280504, 0.11755967910031383, 0.37436302101764923, -0.4103254921352252, -0.20302288455124468, 0.13321789663929778, 0.17621259410411882, 0.136917587409978, -0.0965673186075993, -0.2825070472004322, 0.11512539759636499, -0.10405079423426053, -0.13945404070023543, -0.0809547341389892, -0.012643311029443374, 0.06277817752785407, -0.2778785774866358, 0.06387508439365774, 0.027654825041118342, 0.06401585802012004, -0.05509290399435812, -0.1698937303541849, 0.08487732409804057, 0.05764544095533589, 0.11512258856330448, 0.014149205430816764, 0.05429580980816331, -0.05325908279822519, -0.1649941549075242, 0.37454673344603717, 0.031688546403669395, -0.21650036350071716, 0.17635247896825418, -0.031382232158182144, -0.19393021204711822, 0.19588780725518098, 0.2791578957082656, 0.19783509586854145, -0.17078082171531442, 0.1428506126103457, -0.05557219070406296, 0.08719851157757848, 0.0445458391496243, -0.06865288089745893, 0.09241818431585741, 0.16971990308509424, 0.13797174458905387, 0.13214910314537776, -0.06417485761145751, -0.208754560790765, -0.2686498216114556, -0.09750988175614904, -0.1843944292706557, 0.00041270179029267567, -0.09718334951191, -0.19544915478819838, 0.36445584926658714, 0.17777103792207363, 0.13926626904270586, 0.023791024188260332, 0.27177961610066587, 0.15558132284413426, 0.007938176490521679, 0.09468644758304343, 0.2413584183429917, 0.14920924773786026, 0.15166057122704119, -0.19859602933642095, -0.009330869400097678, 0.20696707254944322] |
1,802.04136 | Cryptographically Secure Multi-Tenant Provisioning of FPGAs | FPGAs (Field Programmable Gate arrays) have gained massive popularity today
as accelerators for a variety of workloads, including big data analytics, and
parallel and distributed computing. This has fueled the study of mechanisms to
provision FPGAs among multiple tenants as general purpose computing resources
on the cloud. Such mechanisms offer new challenges, such as ensuring IP
protection and bitstream confidentiality for mutually distrusting clients
sharing the same FPGA. A direct adoption of existing IP protection techniques
from the single tenancy setting do not completely address these challenges, and
are also not scalable enough for practical deployment. In this paper, we
propose a dedicated and scalable framework for secure multi-tenant FPGA
provisioning that can be easily integrated into existing cloud-based
infrastructures such as OpenStack. Our technique has constant resource/memory
overhead irrespective of the number of tenants sharing a given FPGA, and is
provably secure under well-studied cryptographic assumptions. A prototype
implementation of our proposition on Xilinx Virtex-7 UltraScale FPGAs is
presented to validate its overheads and scalability when supporting multiple
tenants and workloads. To the best of our knowledge, this is the first FPGA
provisioning framework to be prototyped that achieves a desirable balance
between security and scalability in the multi-tenancy setting.
| cs.CR | fpgas field programmable gate arrays have gained massive popularity today as accelerators for a variety of workloads including big data analytics and parallel and distributed computing this has fueled the study of mechanisms to provision fpgas among multiple tenants as general purpose computing resources on the cloud such mechanisms offer new challenges such as ensuring ip protection and bitstream confidentiality for mutually distrusting clients sharing the same fpga a direct adoption of existing ip protection techniques from the single tenancy setting do not completely address these challenges and are also not scalable enough for practical deployment in this paper we propose a dedicated and scalable framework for secure multitenant fpga provisioning that can be easily integrated into existing cloudbased infrastructures such as openstack our technique has constant resourcememory overhead irrespective of the number of tenants sharing a given fpga and is provably secure under wellstudied cryptographic assumptions a prototype implementation of our proposition on xilinx virtex7 ultrascale fpgas is presented to validate its overheads and scalability when supporting multiple tenants and workloads to the best of our knowledge this is the first fpga provisioning framework to be prototyped that achieves a desirable balance between security and scalability in the multitenancy setting | [['fpgas', 'field', 'programmable', 'gate', 'arrays', 'have', 'gained', 'massive', 'popularity', 'today', 'as', 'accelerators', 'for', 'a', 'variety', 'of', 'workloads', 'including', 'big', 'data', 'analytics', 'and', 'parallel', 'and', 'distributed', 'computing', 'this', 'has', 'fueled', 'the', 'study', 'of', 'mechanisms', 'to', 'provision', 'fpgas', 'among', 'multiple', 'tenants', 'as', 'general', 'purpose', 'computing', 'resources', 'on', 'the', 'cloud', 'such', 'mechanisms', 'offer', 'new', 'challenges', 'such', 'as', 'ensuring', 'ip', 'protection', 'and', 'bitstream', 'confidentiality', 'for', 'mutually', 'distrusting', 'clients', 'sharing', 'the', 'same', 'fpga', 'a', 'direct', 'adoption', 'of', 'existing', 'ip', 'protection', 'techniques', 'from', 'the', 'single', 'tenancy', 'setting', 'do', 'not', 'completely', 'address', 'these', 'challenges', 'and', 'are', 'also', 'not', 'scalable', 'enough', 'for', 'practical', 'deployment', 'in', 'this', 'paper', 'we', 'propose', 'a', 'dedicated', 'and', 'scalable', 'framework', 'for', 'secure', 'multitenant', 'fpga', 'provisioning', 'that', 'can', 'be', 'easily', 'integrated', 'into', 'existing', 'cloudbased', 'infrastructures', 'such', 'as', 'openstack', 'our', 'technique', 'has', 'constant', 'resourcememory', 'overhead', 'irrespective', 'of', 'the', 'number', 'of', 'tenants', 'sharing', 'a', 'given', 'fpga', 'and', 'is', 'provably', 'secure', 'under', 'wellstudied', 'cryptographic', 'assumptions', 'a', 'prototype', 'implementation', 'of', 'our', 'proposition', 'on', 'xilinx', 'virtex7', 'ultrascale', 'fpgas', 'is', 'presented', 'to', 'validate', 'its', 'overheads', 'and', 'scalability', 'when', 'supporting', 'multiple', 'tenants', 'and', 'workloads', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'fpga', 'provisioning', 'framework', 'to', 'be', 'prototyped', 'that', 'achieves', 'a', 'desirable', 'balance', 'between', 'security', 'and', 'scalability', 'in', 'the', 'multitenancy', 'setting']] | [-0.20840998677929967, -0.025685153148094914, -0.02117551563672684, 0.013948106249073642, -0.11085760994725416, -0.25137489101610816, 0.0841631544338558, 0.4291452888502323, -0.26731926774671627, -0.35151351305033696, 0.13160342855224544, -0.2002349761946492, -0.09815436234199278, 0.24920150832958687, -0.1350336278620265, 0.11505853859345012, 0.06614422135700906, -0.06480976479390084, -0.005411843860512552, -0.31873950723561006, 0.25104526582819847, 0.08432148167648208, 0.3824287166166115, 0.10202606588025255, 0.06257850072585308, -0.03932412411905264, 0.005588200820806488, -0.05879256372508504, -0.009446173506404563, 0.17797688856702204, 0.33965208111611667, 0.2633755075459804, 0.33355357392396234, -0.4844359676517434, -0.14305927419576364, 0.05973056652091781, 0.1711194850761799, 0.03830205235190352, -0.10965469314941396, -0.2701312224731673, 0.17154375014881645, -0.28350658749871366, -0.06211345371130349, -0.11910707724453816, -0.015512111824621264, 0.040555677588458114, -0.26501612167281274, -0.08337464862068455, -0.009331603164140523, 0.05304635241019291, -0.0013776296105039254, -0.07965913934378076, 0.04059203333179256, 0.15366432329492957, -0.013651250463784041, 0.01868868791954545, 0.18678814391623105, -0.10802824220657536, -0.18534089725268021, 0.389712031911965, 0.0501397043459548, -0.1749770626105162, 0.19352156162875045, 0.03389465435754377, -0.19618965826001972, 0.04105652010433338, 0.23664998054333575, 0.03540194339186758, -0.20576322954079315, 0.09845697312778443, 0.004016643254339096, 0.20178812079777445, 0.04499670448034403, 0.11972630504973879, 0.19998978073392812, 0.24793381332747413, 0.10020209190870949, 0.13088769457231617, -0.027993688146916017, -0.11839814570524154, -0.22318749274677088, -0.1943145488604117, -0.18242772522115677, 0.01848075124476808, -0.09019500416934305, -0.1490621095506858, 0.3454951902654902, 0.20367090628440282, 0.08915832772354909, 0.09786328234377518, 0.469250162361405, 0.007208211140955176, 0.1852541294044829, 0.19175662209066896, 0.12217401174287869, -0.005234037494837089, 0.20981579003229633, -0.13784128967754486, 0.10430003982563807, -0.06430558657891412] |
1,802.04137 | Erd\H{o}s Semi-groups, arithmetic progressions and Szemer\'edi's theorem | In this paper we introduce and study a certain type of sub semi-group of
$\mathbb{R}/\mathbb{Z}$ which turns out to be closely related to \sz's theorem
on arithmetic progressions.
| math.MG | in this paper we introduce and study a certain type of sub semigroup of mathbbrmathbbz which turns out to be closely related to szs theorem on arithmetic progressions | [['in', 'this', 'paper', 'we', 'introduce', 'and', 'study', 'a', 'certain', 'type', 'of', 'sub', 'semigroup', 'of', 'mathbbrmathbbz', 'which', 'turns', 'out', 'to', 'be', 'closely', 'related', 'to', 'szs', 'theorem', 'on', 'arithmetic', 'progressions']] | [-0.1254826138860413, 0.08630758267827332, -0.14462921885206015, 0.10023005677170918, -0.08208454583239343, -0.11465743362038795, 0.07294208480327923, 0.2874943540830697, -0.35941232022430214, -0.19132621453276702, 0.16824678870034404, -0.23219228416149104, -0.17639133959476436, 0.24919908656738698, -0.19846390916167625, -0.006920218467712402, 0.03794886065380914, 0.05728127960381763, -0.04380774634358074, -0.24160570893270364, 0.39946829421179636, -0.022051734550456916, 0.20335343939119152, 0.0853352686223973, 0.06917879673918444, -0.035432532795571854, -0.06807514527047585, 0.013459517354411739, -0.19662751307311868, 0.14673058147309348, 0.30020748171955347, 0.053508925575962554, 0.30197133526339065, -0.3612039504306657, -0.08932413420240794, 0.18761776447562234, 0.12481096223928034, 0.007569639615082581, 0.06459258571183975, -0.23414940599884307, 0.17864564328920096, -0.1187317194417119, -0.13553660297267406, -0.08673839360874679, -0.017725756857544184, 0.06540296761418826, -0.2317358076106757, 0.02443370094156957, 0.15584152525324108, 0.0749245655523347, 0.027894599288369397, -0.05796449649746397, 0.06916338764131069, 0.01299120720276343, 0.06617066616724644, 0.05291443736392206, 0.048609329819945354, -0.01942973250489948, -0.09752674292706486, 0.3801960957103542, -0.0232612063243453, -0.19272683371257568, 0.1257854128406117, -0.14398637773203, -0.2144551574851253, 0.05054741805153234, 0.14564262137615255, 0.15971605466412647, -0.11072845021927995, 0.07468981704732869, -0.14570279898388044, 0.17811019266290323, 0.15670470001974277, 0.05672503138027553, 0.158457224490121, 0.08844365568698517, 0.08431562551829432, 0.22849282738336893, 0.019457218079229018, -0.09007603502167123, -0.3252377480800663, -0.18045642225271358, -0.09453754657754741, 0.1834665479670678, -0.02876374143722517, -0.25405524857342243, 0.41996087985379355, 0.1584694314515218, 0.16225040797144175, 0.09271220889890433, 0.1387011269107461, 0.14182962626884027, 0.051373252973592444, -0.0019724950127835783, 0.07604961822341595, 0.1930638698727957, 0.004149241788711931, -0.15928919377204562, -0.041048778304164965, 0.18064776563551277] |
1,802.04138 | Growth of Sobolev norms for time dependent periodic Schr\"odinger
equations with sublinear dispersion | In this paper we consider Schr\"odinger equations with sublinear dispersion
relation on the one-dimensional torus $\T := \R /(2 \pi \Z)$. More precisely,
we deal with equations of the form $\partial_t u = \ii {\cal V}(\omega t)[u]$
where ${\cal V}(\omega t)$ is a quasi-periodic in time, self-adjoint
pseudo-differential operator of the form ${\cal V}(\omega t) = V(\omega t, x)
|D|^M + {\cal W}(\omega t)$, $0 < M \leq 1$, $|D| := \sqrt{- \partial_{xx}}$,
$V$ is a smooth, quasi-periodic in time function and ${\cal W}$ is a
quasi-periodic time-dependent pseudo-differential operator of order strictly
smaller than $M$. Under suitable assumptions on $V$ and ${\cal W}$, we prove
that if $\omega$ satisfies some non-resonance conditions, the solutions of the
Schr\"odinger equation $\partial_t u = \ii {\cal V}(\omega t)[u]$ grow at most
as $t^\eta$, $t \to + \infty$ for any $\eta > 0$. The proof is based on a
reduction to constant coefficients up to smoothing remainders of the vector
field $\ii {\cal V}(\omega t)$ which uses Egorov type theorems and
pseudo-differential calculus. The {\it homological equations} arising in the
reduction procedure involve both time and space derivatives, since the
dispersion relation is sublinear. Such equations can be solved by imposing some
Melnikov non-resonance conditions on the frequency vector $\omega$.
| math.AP | in this paper we consider schrodinger equations with sublinear dispersion relation on the onedimensional torus t r 2 pi z more precisely we deal with equations of the form partial_t u ii cal vomega tu where cal vomega t is a quasiperiodic in time selfadjoint pseudodifferential operator of the form cal vomega t vomega t x dm cal womega t 0 m leq 1 d sqrt partial_xx v is a smooth quasiperiodic in time function and cal w is a quasiperiodic timedependent pseudodifferential operator of order strictly smaller than m under suitable assumptions on v and cal w we prove that if omega satisfies some nonresonance conditions the solutions of the schrodinger equation partial_t u ii cal vomega tu grow at most as teta t to infty for any eta 0 the proof is based on a reduction to constant coefficients up to smoothing remainders of the vector field ii cal vomega t which uses egorov type theorems and pseudodifferential calculus the it homological equations arising in the reduction procedure involve both time and space derivatives since the dispersion relation is sublinear such equations can be solved by imposing some melnikov nonresonance conditions on the frequency vector omega | [['in', 'this', 'paper', 'we', 'consider', 'schrodinger', 'equations', 'with', 'sublinear', 'dispersion', 'relation', 'on', 'the', 'onedimensional', 'torus', 't', 'r', '2', 'pi', 'z', 'more', 'precisely', 'we', 'deal', 'with', 'equations', 'of', 'the', 'form', 'partial_t', 'u', 'ii', 'cal', 'vomega', 'tu', 'where', 'cal', 'vomega', 't', 'is', 'a', 'quasiperiodic', 'in', 'time', 'selfadjoint', 'pseudodifferential', 'operator', 'of', 'the', 'form', 'cal', 'vomega', 't', 'vomega', 't', 'x', 'dm', 'cal', 'womega', 't', '0', 'm', 'leq', '1', 'd', 'sqrt', 'partial_xx', 'v', 'is', 'a', 'smooth', 'quasiperiodic', 'in', 'time', 'function', 'and', 'cal', 'w', 'is', 'a', 'quasiperiodic', 'timedependent', 'pseudodifferential', 'operator', 'of', 'order', 'strictly', 'smaller', 'than', 'm', 'under', 'suitable', 'assumptions', 'on', 'v', 'and', 'cal', 'w', 'we', 'prove', 'that', 'if', 'omega', 'satisfies', 'some', 'nonresonance', 'conditions', 'the', 'solutions', 'of', 'the', 'schrodinger', 'equation', 'partial_t', 'u', 'ii', 'cal', 'vomega', 'tu', 'grow', 'at', 'most', 'as', 'teta', 't', 'to', 'infty', 'for', 'any', 'eta', '0', 'the', 'proof', 'is', 'based', 'on', 'a', 'reduction', 'to', 'constant', 'coefficients', 'up', 'to', 'smoothing', 'remainders', 'of', 'the', 'vector', 'field', 'ii', 'cal', 'vomega', 't', 'which', 'uses', 'egorov', 'type', 'theorems', 'and', 'pseudodifferential', 'calculus', 'the', 'it', 'homological', 'equations', 'arising', 'in', 'the', 'reduction', 'procedure', 'involve', 'both', 'time', 'and', 'space', 'derivatives', 'since', 'the', 'dispersion', 'relation', 'is', 'sublinear', 'such', 'equations', 'can', 'be', 'solved', 'by', 'imposing', 'some', 'melnikov', 'nonresonance', 'conditions', 'on', 'the', 'frequency', 'vector', 'omega']] | [-0.1984948180304285, 0.14832945329353514, -0.02267408469513134, 0.038688297334098905, -0.12487438265140159, -0.23175033883690233, -0.010996068467390771, 0.3081188311910896, -0.29344528135337933, -0.16903343377634883, 0.07933871025887478, -0.3249452076029183, -0.07746254782794476, 0.1315244051917089, -0.03444958439289658, 0.06881594921596292, 0.021832418218819483, 0.10111005373553118, -0.1214778419663998, -0.20355503470754496, 0.31659750878867327, -0.11393174160544695, 0.13000900842804425, -0.013218537230818353, 0.07297137685148328, -0.01004331895488907, 0.023489868675236298, -0.04376291176977431, -0.2119732072844474, 0.00032927550850530164, 0.22425242280352373, 0.06913536789267315, 0.27343277437654306, -0.3744087677608912, -0.14155800663572124, 0.1613330994356386, 0.1379984224466795, -0.043622862728138576, 0.058906416971024216, -0.2920918633262956, 0.1425075684662325, -0.10795266308229078, -0.16623168349068498, -0.046663606934475174, 0.18328506471600967, 0.004849597652950747, -0.3735790063410696, 0.11057183943980496, 0.12621869801219102, 0.03533336643195438, -0.04523182448324268, -0.13193078457161483, -0.07288722284232275, -0.04734914750095946, 0.005631062000486624, 0.13648415686600288, 0.0485948675189807, -0.07605254278410076, -0.030106073057260176, 0.35441464513088716, -0.15845213182050924, -0.26081654325955445, 0.08940548858384254, -0.2155516842060318, -0.1506222085565719, 0.0836456420365721, 0.12762763107964542, 0.19554319404150275, -0.09064226156521607, 0.3086893590357663, -0.03774959464896132, 0.14716631258620924, 0.13463716590400748, 0.03141560661136126, 0.008011770872116991, 0.0839846453845802, 0.10310026215779773, 0.04019256798736281, 0.011437200771814043, -0.014417440828048822, -0.4232039562793392, -0.13095748402893242, -0.1120902839507155, 0.17682178066855278, -0.13088361365747675, -0.13112558804057312, 0.2982224910802236, 0.055690742855082555, 0.24033522420101847, 0.08273646222927838, 0.1410814736113705, 0.23990688408957794, 0.027523522106507284, 0.1094804531588887, 0.09459920302345041, 0.19314996689214664, 0.14207785015083813, -0.24355196594519335, -0.035547629017571004, 0.1717900229674397] |
1,802.04139 | Quasi-periodic solutions for the forced Kirchhoff equation on
$\mathbb{T}^d$ | In this paper we prove the existence of small-amplitude quasi-periodic
solutions with Sobolev regularity, for the $d$-dimensional forced Kirchhoff
equation with periodic boundary conditions. This is the first result of this
type for a quasi-linear equations in high dimension. The proof is based on a
Nash-Moser scheme in Sobolev class and a regularization procedure combined with
a multiscale analysis in order to solve the linearized problem at any
approximate solution.
| math.AP | in this paper we prove the existence of smallamplitude quasiperiodic solutions with sobolev regularity for the ddimensional forced kirchhoff equation with periodic boundary conditions this is the first result of this type for a quasilinear equations in high dimension the proof is based on a nashmoser scheme in sobolev class and a regularization procedure combined with a multiscale analysis in order to solve the linearized problem at any approximate solution | [['in', 'this', 'paper', 'we', 'prove', 'the', 'existence', 'of', 'smallamplitude', 'quasiperiodic', 'solutions', 'with', 'sobolev', 'regularity', 'for', 'the', 'ddimensional', 'forced', 'kirchhoff', 'equation', 'with', 'periodic', 'boundary', 'conditions', 'this', 'is', 'the', 'first', 'result', 'of', 'this', 'type', 'for', 'a', 'quasilinear', 'equations', 'in', 'high', 'dimension', 'the', 'proof', 'is', 'based', 'on', 'a', 'nashmoser', 'scheme', 'in', 'sobolev', 'class', 'and', 'a', 'regularization', 'procedure', 'combined', 'with', 'a', 'multiscale', 'analysis', 'in', 'order', 'to', 'solve', 'the', 'linearized', 'problem', 'at', 'any', 'approximate', 'solution']] | [-0.14820077943482568, -0.004325583543894547, -0.0977494498415451, 0.044401979398181926, -0.10097425098730517, -0.13284005227365664, -0.012008562788832933, 0.2697289312324886, -0.30479362072157007, -0.21175504655444197, 0.17985372606199235, -0.2501603888613837, -0.14994240991239036, 0.16439234534544603, -0.08753580573414053, 0.13142153630033135, 0.10093281360875284, 0.009410091289984329, -0.08770179157810552, -0.20472032435770546, 0.39075481199792456, -0.050143747271171636, 0.23755458799589957, 0.02328801250883511, 0.1192557050713471, -0.026532818463497927, 0.0142449822809015, 0.025895845484254616, -0.20889231560951366, 0.12944160862659504, 0.23893494737733686, 0.0023074771310868008, 0.35505164757903135, -0.4116163895864572, -0.23289763452485204, 0.10842792212830059, 0.11760945095281516, 0.1483033881389669, -0.037823917369158674, -0.271629722309964, 0.13698965032984103, -0.08777825376018882, -0.2585311977991036, -0.0488869722799531, -0.014217813485967262, 0.03837645777634212, -0.3504909332841635, 0.12243427994128848, 0.10781941854261927, 0.03339842391599502, -0.18523265654221177, 0.012601491529494524, 0.0453153167385608, -0.015733308113911854, 0.041922408495364445, 0.04452963066287339, -0.045469274789294495, -0.09147297598621143, -0.08927152103611401, 0.34871707748222563, -0.10260676110462685, -0.31856658839221513, 0.15756182991566936, -0.09380215890705586, -0.17286274659314327, 0.12663053720524267, 0.19312452226211982, 0.18995714294058935, -0.13865427200549416, 0.13791610064966206, -0.06821606449084357, 0.17770023979246616, 0.12316271119884083, -0.02292248618655971, 0.04432379459696156, 0.18013647056317755, 0.17567185791475431, 0.15037736536136695, -0.039614066208845805, -0.07908746767123895, -0.3658588791798268, -0.13997742126562765, -0.16979622412472964, 0.0893859947782143, -0.1434896888941044, -0.23874378401253904, 0.38318857487938657, 0.14080443107523025, 0.14955625677747386, 0.09885316178468721, 0.23790173707529902, 0.20941640366467515, -0.013292736895216097, 0.12725795414298774, 0.19961145020289614, 0.13303675201189305, 0.16910538551663715, -0.21197089179019843, -0.0054571297884519615, 0.2727643553965858] |
1,802.0414 | Making "fetch" happen: The influence of social and linguistic context on
nonstandard word growth and decline | In an online community, new words come and go: today's "haha" may be replaced
by tomorrow's "lol." Changes in online writing are usually studied as a social
process, with innovations diffusing through a network of individuals in a
speech community. But unlike other types of innovation, language change is
shaped and constrained by the system in which it takes part. To investigate the
links between social and structural factors in language change, we undertake a
large-scale analysis of nonstandard word growth in the online community Reddit.
We find that dissemination across many linguistic contexts is a sign of growth:
words that appear in more linguistic contexts grow faster and survive longer.
We also find that social dissemination likely plays a less important role in
explaining word growth and decline than previously hypothesized.
| cs.CL | in an online community new words come and go todays haha may be replaced by tomorrows lol changes in online writing are usually studied as a social process with innovations diffusing through a network of individuals in a speech community but unlike other types of innovation language change is shaped and constrained by the system in which it takes part to investigate the links between social and structural factors in language change we undertake a largescale analysis of nonstandard word growth in the online community reddit we find that dissemination across many linguistic contexts is a sign of growth words that appear in more linguistic contexts grow faster and survive longer we also find that social dissemination likely plays a less important role in explaining word growth and decline than previously hypothesized | [['in', 'an', 'online', 'community', 'new', 'words', 'come', 'and', 'go', 'todays', 'haha', 'may', 'be', 'replaced', 'by', 'tomorrows', 'lol', 'changes', 'in', 'online', 'writing', 'are', 'usually', 'studied', 'as', 'a', 'social', 'process', 'with', 'innovations', 'diffusing', 'through', 'a', 'network', 'of', 'individuals', 'in', 'a', 'speech', 'community', 'but', 'unlike', 'other', 'types', 'of', 'innovation', 'language', 'change', 'is', 'shaped', 'and', 'constrained', 'by', 'the', 'system', 'in', 'which', 'it', 'takes', 'part', 'to', 'investigate', 'the', 'links', 'between', 'social', 'and', 'structural', 'factors', 'in', 'language', 'change', 'we', 'undertake', 'a', 'largescale', 'analysis', 'of', 'nonstandard', 'word', 'growth', 'in', 'the', 'online', 'community', 'reddit', 'we', 'find', 'that', 'dissemination', 'across', 'many', 'linguistic', 'contexts', 'is', 'a', 'sign', 'of', 'growth', 'words', 'that', 'appear', 'in', 'more', 'linguistic', 'contexts', 'grow', 'faster', 'and', 'survive', 'longer', 'we', 'also', 'find', 'that', 'social', 'dissemination', 'likely', 'plays', 'a', 'less', 'important', 'role', 'in', 'explaining', 'word', 'growth', 'and', 'decline', 'than', 'previously', 'hypothesized']] | [-0.0917240903566408, 0.11540307321818986, -0.05064485820758185, 0.11454304989661757, -0.14388328293606525, -0.1329192788318985, 0.04369518420637839, 0.42192273844160477, -0.29654514143299876, -0.2988106312682662, 0.08043303954146916, -0.2858566745254035, -0.2278052899337402, 0.17462424215751304, -0.07987678715620529, -0.0540766102882723, 0.07512166484340208, 0.07593672183187057, 0.020740282889385002, -0.27806201797317376, 0.2968948346520351, 0.042712566100597156, 0.2873884550398075, 0.009422134100036188, 0.032863462241507616, -0.014346567178356716, -0.09467717712378186, -0.00563476200543598, -0.09673354974289726, 0.1415533047751193, 0.34495459241566784, 0.2073157981997638, 0.38083367840612703, -0.4434425871480595, -0.24061313839840956, 0.11408790931895826, 0.20335002961942475, 0.12340120262568675, -0.05110968018859487, -0.28961054765562894, 0.06027175087453515, -0.20124619504944843, -0.02474568679815892, -0.03606473700369172, 0.05226747221736745, -0.0010955306726938227, -0.2114918596890868, 0.07085187271546932, 0.07826155554997086, 0.12048344010007427, 0.0011084695985173862, -0.08367812803110362, 0.016919566011479634, 0.19395446453850265, 0.10424145747564387, 0.019415023071677282, 0.18733440935752835, -0.1805542592685952, -0.1398535540096363, 0.40267956182783976, -0.055776615327803564, -0.14444941092480088, 0.21521016797333054, -0.09489106917471597, -0.18293645902127592, 0.08334314353256063, 0.23688070781557172, 0.025831039289407658, -0.1642460467957073, 0.020978488823995136, -0.02522963363409155, 0.2207279079082196, 0.13235085012010214, 0.02737456468413725, 0.18604890399453297, 0.22865673923639185, 0.062217668157025015, 0.08982745371362068, 0.029293934786410042, -0.11763531897414589, -0.1681918799242174, -0.16746145505219995, -0.13295052864828683, 0.014087374360039548, -0.10711683949866159, -0.18536821308644544, 0.3626739302029212, 0.1421949097923723, 0.16909854000109728, 0.024286622734287062, 0.20576765975883146, 0.02932089489838814, 0.12859424740203063, 0.10238115276054789, 0.16657975070869946, -0.003813287846159338, 0.18275243454175352, -0.1340930141847242, 0.19804970560741794, -0.010770969130879332] |
1,802.04141 | Conservative stochastic 2-dimensional Cahn-Hilliard equation | We consider the stochastic 2-dimensional Cahn-Hilliard equation which is
driven by the derivative in space of a space-time white noise. We use two
different approaches to study this equation. First we prove that there exists a
unique solution $Y$ to the shifted equation (see (1.4) below), then $X:=Y+{Z}$
is the unique solution to stochastic Cahn-Hilliard equaiton, where ${Z}$ is the
corresponding O-U process. Moreover, we use Dirichlet form approach in
\cite{Albeverio:1991hk} to construct the probabilistically weak solution the
the original equation (1.1) below. By clarifying the precise relation between
the solutions obtained by the Dirichlet forms aprroach and $X$, we can also get
the restricted Markov uniquness of the generator and the uniqueness of
martingale solutions to the equation (1.1).
| math.PR math.AP math.FA | we consider the stochastic 2dimensional cahnhilliard equation which is driven by the derivative in space of a spacetime white noise we use two different approaches to study this equation first we prove that there exists a unique solution y to the shifted equation see 14 below then xyz is the unique solution to stochastic cahnhilliard equaiton where z is the corresponding ou process moreover we use dirichlet form approach in citealbeverio1991hk to construct the probabilistically weak solution the the original equation 11 below by clarifying the precise relation between the solutions obtained by the dirichlet forms aprroach and x we can also get the restricted markov uniquness of the generator and the uniqueness of martingale solutions to the equation 11 | [['we', 'consider', 'the', 'stochastic', '2dimensional', 'cahnhilliard', 'equation', 'which', 'is', 'driven', 'by', 'the', 'derivative', 'in', 'space', 'of', 'a', 'spacetime', 'white', 'noise', 'we', 'use', 'two', 'different', 'approaches', 'to', 'study', 'this', 'equation', 'first', 'we', 'prove', 'that', 'there', 'exists', 'a', 'unique', 'solution', 'y', 'to', 'the', 'shifted', 'equation', 'see', '14', 'below', 'then', 'xyz', 'is', 'the', 'unique', 'solution', 'to', 'stochastic', 'cahnhilliard', 'equaiton', 'where', 'z', 'is', 'the', 'corresponding', 'ou', 'process', 'moreover', 'we', 'use', 'dirichlet', 'form', 'approach', 'in', 'citealbeverio1991hk', 'to', 'construct', 'the', 'probabilistically', 'weak', 'solution', 'the', 'the', 'original', 'equation', '11', 'below', 'by', 'clarifying', 'the', 'precise', 'relation', 'between', 'the', 'solutions', 'obtained', 'by', 'the', 'dirichlet', 'forms', 'aprroach', 'and', 'x', 'we', 'can', 'also', 'get', 'the', 'restricted', 'markov', 'uniquness', 'of', 'the', 'generator', 'and', 'the', 'uniqueness', 'of', 'martingale', 'solutions', 'to', 'the', 'equation', '11']] | [-0.11363655746267257, 0.04987801867833171, -0.08133399908300647, 0.08495089235788389, -0.0972687597149762, -0.14661525961769334, 0.03726049055645274, 0.30336369315193873, -0.34064109384682095, -0.22402532053006402, 0.11773001356543657, -0.3099794173534265, -0.13731095249737738, 0.13300143548492657, -0.043185533442676574, 0.0490756445303875, 0.03525799373559401, 0.036623730611794046, -0.0914564308832731, -0.20819624129611747, 0.37656134087197735, -0.045881855122003136, 0.22420773409717418, -0.028069016152708712, 0.18411726396436157, -0.03287729731725403, 0.006368942645583618, -0.03126565729276774, -0.22990815948638957, 0.08181446851073307, 0.20534541714967078, 0.07714735033282599, 0.28706231981642166, -0.3738082234226799, -0.1817546178097442, 0.13687124251687932, 0.13099064138053002, 0.09241419913796255, -0.029363172146554848, -0.3012214406409254, 0.11011723142267221, -0.11288449772775679, -0.17205696630733625, -0.047085391793605255, 0.005314596861569306, 0.05391383078738542, -0.2734226513598746, 0.11466600373954615, 0.10053659888907825, -0.04077429025161664, -0.13263255332486104, -0.0791453113463723, -0.03608782033799058, 0.04970530257165685, 0.04650406526146117, 0.04365411900986239, 0.020920555513762568, -0.09497338105821825, -0.0928073180385597, 0.32507114514552643, -0.1368182672550744, -0.2883646337017496, 0.15243114272558714, -0.16330910202952387, -0.1265557982201167, 0.11299291944951774, 0.10761390819206391, 0.12983144781852174, -0.20508852834671232, 0.16030985254979835, -0.039041654266006615, 0.15520484194601492, 0.09185468722766234, -0.056470085839125314, 0.11324725567088936, 0.1511567697748818, 0.10601470018421316, 0.14934911909986728, -0.030414073546495984, -0.13274638683898216, -0.330249208230841, -0.18333778589356187, -0.14728169565846733, 0.12716690915778783, -0.10816270312944513, -0.1717169769897552, 0.3242793910430302, 0.16127560191622037, 0.17980059693267536, 0.03360216860300309, 0.2126689518799895, 0.21351145904006089, -0.05205249322146193, 0.08250325984100543, 0.1768942886995057, 0.16436217467979355, 0.14231570443864597, -0.18800063020060376, 0.016249930188138733, 0.13512080420061187] |
1,802.04142 | An ADMM Based Method for Computation Rate Maximization in Wireless
Powered Mobile-Edge Computing Networks | In this paper, we consider a wireless powered mobile edge computing (MEC)
network, where the distributed energy-harvesting wireless devices (WDs) are
powered by means of radio frequency (RF) wireless power transfer (WPT). In
particular, the WDs follow a binary computation offloading policy, i.e., data
set of a computing task has to be executed as a whole either locally or
remotely at the MEC server via task offloading. We are interested in maximizing
the (weighted) sum computation rate of all the WDs in the network by jointly
optimizing the individual computing mode selection (i.e., local computing or
offloading) and the system transmission time allocation (on WPT and task
offloading). The major difficulty lies in the combinatorial nature of
multi-user computing mode selection and its strong coupling with transmission
time allocation. To tackle this problem, we propose a joint optimization method
based on the ADMM (alternating direction method of multipliers) decomposition
technique. Simulation results show that the proposed method can efficiently
achieve near-optimal performance under various network setups, and
significantly outperform the other representative benchmark methods considered.
Besides, using both theoretical analysis and numerical study, we show that the
proposed method enjoys low computational complexity against the increase of
networks size.
| cs.IT math.IT | in this paper we consider a wireless powered mobile edge computing mec network where the distributed energyharvesting wireless devices wds are powered by means of radio frequency rf wireless power transfer wpt in particular the wds follow a binary computation offloading policy ie data set of a computing task has to be executed as a whole either locally or remotely at the mec server via task offloading we are interested in maximizing the weighted sum computation rate of all the wds in the network by jointly optimizing the individual computing mode selection ie local computing or offloading and the system transmission time allocation on wpt and task offloading the major difficulty lies in the combinatorial nature of multiuser computing mode selection and its strong coupling with transmission time allocation to tackle this problem we propose a joint optimization method based on the admm alternating direction method of multipliers decomposition technique simulation results show that the proposed method can efficiently achieve nearoptimal performance under various network setups and significantly outperform the other representative benchmark methods considered besides using both theoretical analysis and numerical study we show that the proposed method enjoys low computational complexity against the increase of networks size | [['in', 'this', 'paper', 'we', 'consider', 'a', 'wireless', 'powered', 'mobile', 'edge', 'computing', 'mec', 'network', 'where', 'the', 'distributed', 'energyharvesting', 'wireless', 'devices', 'wds', 'are', 'powered', 'by', 'means', 'of', 'radio', 'frequency', 'rf', 'wireless', 'power', 'transfer', 'wpt', 'in', 'particular', 'the', 'wds', 'follow', 'a', 'binary', 'computation', 'offloading', 'policy', 'ie', 'data', 'set', 'of', 'a', 'computing', 'task', 'has', 'to', 'be', 'executed', 'as', 'a', 'whole', 'either', 'locally', 'or', 'remotely', 'at', 'the', 'mec', 'server', 'via', 'task', 'offloading', 'we', 'are', 'interested', 'in', 'maximizing', 'the', 'weighted', 'sum', 'computation', 'rate', 'of', 'all', 'the', 'wds', 'in', 'the', 'network', 'by', 'jointly', 'optimizing', 'the', 'individual', 'computing', 'mode', 'selection', 'ie', 'local', 'computing', 'or', 'offloading', 'and', 'the', 'system', 'transmission', 'time', 'allocation', 'on', 'wpt', 'and', 'task', 'offloading', 'the', 'major', 'difficulty', 'lies', 'in', 'the', 'combinatorial', 'nature', 'of', 'multiuser', 'computing', 'mode', 'selection', 'and', 'its', 'strong', 'coupling', 'with', 'transmission', 'time', 'allocation', 'to', 'tackle', 'this', 'problem', 'we', 'propose', 'a', 'joint', 'optimization', 'method', 'based', 'on', 'the', 'admm', 'alternating', 'direction', 'method', 'of', 'multipliers', 'decomposition', 'technique', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'method', 'can', 'efficiently', 'achieve', 'nearoptimal', 'performance', 'under', 'various', 'network', 'setups', 'and', 'significantly', 'outperform', 'the', 'other', 'representative', 'benchmark', 'methods', 'considered', 'besides', 'using', 'both', 'theoretical', 'analysis', 'and', 'numerical', 'study', 'we', 'show', 'that', 'the', 'proposed', 'method', 'enjoys', 'low', 'computational', 'complexity', 'against', 'the', 'increase', 'of', 'networks', 'size']] | [-0.20467813614239314, -0.025091007887736785, -0.00831161705009527, -0.01616519566826597, -0.08395744430196084, -0.2127694518974603, 0.1294057730698827, 0.42286611237942273, -0.2978023952107184, -0.30067078173909356, 0.09785555267938174, -0.22916491825283322, -0.16564587858650628, 0.20383541883161319, -0.10321397774697202, 0.08902703635552524, 0.1146784718051885, -0.004133424142506629, -0.02529452348138345, -0.26498554322175943, 0.2825580102540131, 0.08674542288572046, 0.3900003343804192, 0.01878893868640842, 0.0639795079943139, 0.012601529221148721, -0.02810238208972741, -0.021510556262412377, -0.059419135869982015, 0.13950381305737974, 0.32280235525791595, 0.20088896789265112, 0.33695193057898526, -0.43374182364374547, -0.225518734072658, 0.13114199409818267, 0.19109134142340894, 0.011701637820513854, -0.07110713746213827, -0.23518083171202947, 0.15250069368279648, -0.2420598651898496, 0.004718943266271165, -0.05354772615901677, -0.06414067547361194, 0.05257643257904255, -0.3200100296593491, 0.014205018698995998, -0.021999995473388528, 0.0031236977342471725, -0.08262691364529129, -0.10234891937462959, 0.04436571354891206, 0.14342946397496303, 0.02575431312680076, 0.0022191435985510523, 0.15613788359882733, -0.12200362094000552, -0.1636184614488677, 0.3782256154820847, -0.000809505210379747, -0.20145065859123953, 0.1410486902971401, -0.026829210214139004, -0.13520817182508846, 0.10265997181595046, 0.24436522180907166, 0.13975386266788495, -0.16566622442268678, 0.0416207516040295, -0.009908408165240109, 0.11729620890832276, 0.044564212513291956, 0.06452690963937559, 0.1814262804097903, 0.23287307942665214, 0.1366692786467678, 0.15268154559588532, -0.11660508808548839, -0.10167909795933183, -0.1674278937280178, -0.11471450605269419, -0.26808676400705095, 0.00582794975501078, -0.09841355553091956, -0.08737930070945815, 0.38758567305527164, 0.14432811519205946, 0.12410837651029154, 0.11749538344485526, 0.43442643858754454, 0.14664471950319108, 0.06063395041045756, 0.19099837310767812, 0.17975620950581553, 0.055879477540208916, 0.16338158183118057, -0.27847616468443903, 0.06090287711054798, 0.04062803263715164] |
1,802.04143 | The Fundamentals of Policy Crowdsourcing | What is the state of the research on crowdsourcing for policy making? This
article begins to answer this question by collecting, categorizing, and
situating an extensive body of the extant research investigating policy
crowdsourcing, within a new framework built on fundamental typologies from each
field. We first define seven universal characteristics of the three general
crowdsourcing techniques (virtual labor markets, tournament crowdsourcing, open
collaboration), to examine the relative trade-offs of each modality. We then
compare these three types of crowdsourcing to the different stages of the
policy cycle, in order to situate the literature spanning both domains. We
finally discuss research trends in crowdsourcing for public policy, and
highlight the research gaps and overlaps in the literature.
KEYWORDS: crowdsourcing, policy cycle, crowdsourcing trade-offs, policy
processes, policy stages, virtual labor markets, tournament crowdsourcing, open
collaboration
| cs.CY cs.HC cs.SI | what is the state of the research on crowdsourcing for policy making this article begins to answer this question by collecting categorizing and situating an extensive body of the extant research investigating policy crowdsourcing within a new framework built on fundamental typologies from each field we first define seven universal characteristics of the three general crowdsourcing techniques virtual labor markets tournament crowdsourcing open collaboration to examine the relative tradeoffs of each modality we then compare these three types of crowdsourcing to the different stages of the policy cycle in order to situate the literature spanning both domains we finally discuss research trends in crowdsourcing for public policy and highlight the research gaps and overlaps in the literature keywords crowdsourcing policy cycle crowdsourcing tradeoffs policy processes policy stages virtual labor markets tournament crowdsourcing open collaboration | [['what', 'is', 'the', 'state', 'of', 'the', 'research', 'on', 'crowdsourcing', 'for', 'policy', 'making', 'this', 'article', 'begins', 'to', 'answer', 'this', 'question', 'by', 'collecting', 'categorizing', 'and', 'situating', 'an', 'extensive', 'body', 'of', 'the', 'extant', 'research', 'investigating', 'policy', 'crowdsourcing', 'within', 'a', 'new', 'framework', 'built', 'on', 'fundamental', 'typologies', 'from', 'each', 'field', 'we', 'first', 'define', 'seven', 'universal', 'characteristics', 'of', 'the', 'three', 'general', 'crowdsourcing', 'techniques', 'virtual', 'labor', 'markets', 'tournament', 'crowdsourcing', 'open', 'collaboration', 'to', 'examine', 'the', 'relative', 'tradeoffs', 'of', 'each', 'modality', 'we', 'then', 'compare', 'these', 'three', 'types', 'of', 'crowdsourcing', 'to', 'the', 'different', 'stages', 'of', 'the', 'policy', 'cycle', 'in', 'order', 'to', 'situate', 'the', 'literature', 'spanning', 'both', 'domains', 'we', 'finally', 'discuss', 'research', 'trends', 'in', 'crowdsourcing', 'for', 'public', 'policy', 'and', 'highlight', 'the', 'research', 'gaps', 'and', 'overlaps', 'in', 'the', 'literature', 'keywords', 'crowdsourcing', 'policy', 'cycle', 'crowdsourcing', 'tradeoffs', 'policy', 'processes', 'policy', 'stages', 'virtual', 'labor', 'markets', 'tournament', 'crowdsourcing', 'open', 'collaboration']] | [-0.09917344320426459, 0.05480452468229976, -0.046508700866599695, 0.09306675048350398, -0.15087935744798672, -0.11343102466050925, 0.14412897281042897, 0.44444817849504414, -0.28257983884732446, -0.31332222393838993, 0.09502442690992116, -0.3011553715844986, -0.15640011738374163, 0.17760266318444662, -0.12428357624170829, 0.04435433504526128, 0.09193988611449057, 0.004745627985398438, 0.06105147040476883, -0.3080826091057527, 0.37007401113523475, 0.02727199628351451, 0.36444716873481425, 0.037186504042804686, 0.07514902091334894, -0.04323599121269228, -0.1227470240451451, -0.003130546593760599, -0.18090144081263623, 0.16431400794605378, 0.385951296349904, 0.26693376308001243, 0.4264795154666723, -0.3891909627466282, -0.11898269972055038, 0.0738603567379638, 0.1211738352291981, 0.06650720597870315, -0.03611862945627532, -0.3003636626109703, 0.022754599778989415, -0.23045132970854418, -0.04789285548378838, -0.06100529739494199, 0.01800514270860785, -0.023350708243965325, -0.25112675848840943, -0.05705990331984167, -0.028779176126115646, 0.14082432516377918, -0.09484289772113536, -0.14154090064164224, 0.06091990461920513, 0.2586353339998524, 0.115388561380986, 0.014899316500983577, 0.13883725201464328, -0.17709498673872048, -0.2668256206583899, 0.351442104942207, 0.03229873680636467, -0.0997309291095876, 0.17551401700327562, -0.08180548633281975, -0.1967973669733741, 0.0031074512291199238, 0.2219858577026666, 0.07799577215554387, -0.218940126007673, 0.012348770565759918, -0.06579051314290169, 0.13670366106045767, 0.08527803963828665, -0.04231097416234648, 0.16844325495619716, 0.23885773065319257, 0.08051826173453522, 0.1358716286173257, 0.030236234144766384, -0.1681151968155946, -0.21049511089309383, -0.12922468441781768, -0.12002143259472978, 0.002249861323733383, -0.10116806163753594, -0.10225162150532897, 0.40625274142097517, 0.1868957274179878, 0.11400828225218426, 0.04402534226511619, 0.32788557104537014, -0.009443783861543261, 0.043979775944182564, 0.07391592972119575, 0.16371919184926648, -0.04547629346758294, 0.19516187136534102, -0.20156879145904, 0.06316798309962363, 0.019548323761051478] |
1,802.04144 | Arithmetic summable sequence space over non-Newtonian field | Recently Ruckle \cite{RuckleArithmeticalSummability} introduced the theory of
arithmetical summability suggested by the sum $ \sum_{k|m}f(k) $ as $ k $
ranges over the divisors of $m$ including $ 1 $ and $ m .$ Following Ruckle
\cite{RuckleArithmeticalSummability} we construct the sequence space $ AS(G) $
and $ AC(G) $ of arithmetic summable and arithmetic convergent sequences in the
sense of geometric calculus and derive interesting results in the geometric
field.
| math.GM | recently ruckle citerucklearithmeticalsummability introduced the theory of arithmetical summability suggested by the sum sum_kmfk as k ranges over the divisors of m including 1 and m following ruckle citerucklearithmeticalsummability we construct the sequence space asg and acg of arithmetic summable and arithmetic convergent sequences in the sense of geometric calculus and derive interesting results in the geometric field | [['recently', 'ruckle', 'citerucklearithmeticalsummability', 'introduced', 'the', 'theory', 'of', 'arithmetical', 'summability', 'suggested', 'by', 'the', 'sum', 'sum_kmfk', 'as', 'k', 'ranges', 'over', 'the', 'divisors', 'of', 'm', 'including', '1', 'and', 'm', 'following', 'ruckle', 'citerucklearithmeticalsummability', 'we', 'construct', 'the', 'sequence', 'space', 'asg', 'and', 'acg', 'of', 'arithmetic', 'summable', 'and', 'arithmetic', 'convergent', 'sequences', 'in', 'the', 'sense', 'of', 'geometric', 'calculus', 'and', 'derive', 'interesting', 'results', 'in', 'the', 'geometric', 'field']] | [-0.15412305953543423, 0.09605644101206705, -0.12163997336097483, 0.08057297797838472, -0.02977528099743825, -0.0957426585626068, 0.0348723901074406, 0.31059276744863895, -0.3155290312880545, -0.2859957482454912, 0.11089777950425896, -0.21939177429830692, -0.1677937718681587, 0.1861751068620679, -0.1558088675176479, 0.0553604311612874, -0.006221392104085887, 0.08515808334187516, -0.07693675771917936, -0.3015282479628815, 0.3543718965319952, -0.042758489906225564, 0.15214505064178188, -0.015497478436270097, 0.1357215832158888, 0.0436386842948367, -0.09128730911937244, -0.0034441878664403943, -0.21755979491292304, 0.15511160842933744, 0.26174606523423827, 0.10547399896917478, 0.27056393397198814, -0.3631114180217374, -0.15371370695109637, 0.12355473743013616, 0.14241857830224172, -0.06166728346977594, 0.0030491848845245703, -0.2587011855113197, 0.12679362257520826, -0.10443348736932748, -0.10729378102487831, -0.13701082862702743, 0.09161260621490414, 0.1009693288789043, -0.2845516875386238, -0.0283829820922242, 0.1383790011728569, 0.14539339283990832, -0.027711216896280366, -0.18127591802545315, 0.02483288154779178, 0.06980369029619363, 0.0699358011051169, 0.058813247952680545, 0.03440655658970464, -0.04497579038846043, -0.1131252220344185, 0.31828672210422326, -0.08648564267622412, -0.14942013134933868, 0.09720354448160473, -0.15631155806751745, -0.15160677258698446, 0.10238878766320786, 0.04668262175214038, 0.16634437372415978, -0.02169428187650892, 0.2018537468162699, -0.0841986999587806, 0.09922234418819535, 0.16200284728393802, 0.09205033860327501, 0.11573535870795823, 0.06281134217344927, 0.06469152864279612, 0.10753726209777426, -0.010090659732737069, -0.0940386980139422, -0.3343012622856307, -0.17637392435714883, -0.16567778077749712, 0.09231548529680607, -0.14540199365989603, -0.20277301773850648, 0.3777584216979174, 0.10055121977128229, 0.1623282940478398, 0.15700499916378902, 0.21281147087959326, 0.12608317306643035, 0.016964911415136227, 0.028605150410308026, 0.09378948204553211, 0.2429598245181073, 0.026663160133878438, -0.15426991846113694, -0.023964968041016034, 0.1972254529454798] |
1,802.04145 | DCFNet: Deep Neural Network with Decomposed Convolutional Filters | Filters in a Convolutional Neural Network (CNN) contain model parameters
learned from enormous amounts of data. In this paper, we suggest to decompose
convolutional filters in CNN as a truncated expansion with pre-fixed bases,
namely the Decomposed Convolutional Filters network (DCFNet), where the
expansion coefficients remain learned from data. Such a structure not only
reduces the number of trainable parameters and computation, but also imposes
filter regularity by bases truncation. Through extensive experiments, we
consistently observe that DCFNet maintains accuracy for image classification
tasks with a significant reduction of model parameters, particularly with
Fourier-Bessel (FB) bases, and even with random bases. Theoretically, we
analyze the representation stability of DCFNet with respect to input
variations, and prove representation stability under generic assumptions on the
expansion coefficients. The analysis is consistent with the empirical
observations.
| stat.ML cs.CV cs.LG | filters in a convolutional neural network cnn contain model parameters learned from enormous amounts of data in this paper we suggest to decompose convolutional filters in cnn as a truncated expansion with prefixed bases namely the decomposed convolutional filters network dcfnet where the expansion coefficients remain learned from data such a structure not only reduces the number of trainable parameters and computation but also imposes filter regularity by bases truncation through extensive experiments we consistently observe that dcfnet maintains accuracy for image classification tasks with a significant reduction of model parameters particularly with fourierbessel fb bases and even with random bases theoretically we analyze the representation stability of dcfnet with respect to input variations and prove representation stability under generic assumptions on the expansion coefficients the analysis is consistent with the empirical observations | [['filters', 'in', 'a', 'convolutional', 'neural', 'network', 'cnn', 'contain', 'model', 'parameters', 'learned', 'from', 'enormous', 'amounts', 'of', 'data', 'in', 'this', 'paper', 'we', 'suggest', 'to', 'decompose', 'convolutional', 'filters', 'in', 'cnn', 'as', 'a', 'truncated', 'expansion', 'with', 'prefixed', 'bases', 'namely', 'the', 'decomposed', 'convolutional', 'filters', 'network', 'dcfnet', 'where', 'the', 'expansion', 'coefficients', 'remain', 'learned', 'from', 'data', 'such', 'a', 'structure', 'not', 'only', 'reduces', 'the', 'number', 'of', 'trainable', 'parameters', 'and', 'computation', 'but', 'also', 'imposes', 'filter', 'regularity', 'by', 'bases', 'truncation', 'through', 'extensive', 'experiments', 'we', 'consistently', 'observe', 'that', 'dcfnet', 'maintains', 'accuracy', 'for', 'image', 'classification', 'tasks', 'with', 'a', 'significant', 'reduction', 'of', 'model', 'parameters', 'particularly', 'with', 'fourierbessel', 'fb', 'bases', 'and', 'even', 'with', 'random', 'bases', 'theoretically', 'we', 'analyze', 'the', 'representation', 'stability', 'of', 'dcfnet', 'with', 'respect', 'to', 'input', 'variations', 'and', 'prove', 'representation', 'stability', 'under', 'generic', 'assumptions', 'on', 'the', 'expansion', 'coefficients', 'the', 'analysis', 'is', 'consistent', 'with', 'the', 'empirical', 'observations']] | [-0.05919555007284017, 0.013879630476572459, -0.0777534572337579, 0.004554959511230315, -0.06858214808810026, -0.14327673014617504, 0.020191193998553195, 0.45469003132215347, -0.29751330335393433, -0.2805489578684337, 0.11623739513228963, -0.2527087796024306, -0.19965272356188835, 0.1373472242385037, -0.08455880601077229, 0.07187703662355871, 0.17503083954544219, 0.03825990486053288, -0.12040798347513366, -0.2648521765096715, 0.2824819741728611, 0.06422408500728302, 0.29926470474031913, -0.059651899020646215, 0.1576624812262441, -0.022441392389819362, -0.07019845367920466, -0.010939605920960693, -0.0786320919618365, 0.16399679386190005, 0.2585428894000282, 0.14168534526090257, 0.26832881831578015, -0.4174578395301014, -0.22356667080403944, 0.09609509885479185, 0.14695938432211042, 0.08053577837667295, 0.008477643337906023, -0.27584554315229554, 0.07849851120534682, -0.1717715291166328, -0.02729894104588749, -0.17293899240238325, -0.028748567317633478, 0.010368744989759043, -0.3522383030455847, 0.07845674622852068, 0.06454589309983123, 0.07688477943052671, -0.07832683892255383, -0.12643743860115178, -0.02466340547539574, 0.0905322742865498, 0.0207572087568504, 0.015797498863526528, 0.10026197880856637, -0.19859905255856902, -0.096679589585086, 0.33246957825818907, -0.10171910621404395, -0.2437304584099386, 0.14848019895178818, -0.09008670975874297, -0.1447238306465902, 0.10113484030624473, 0.2089371373771893, 0.057021811653516795, -0.11859027028330636, 0.07763875245608572, -0.07261954852786, 0.22942600661321522, 0.09639677912157897, 0.04585944358049367, 0.139657518944591, 0.2001833775731966, 0.020731888193273006, 0.15582089591071122, -0.10903854028293793, -0.05564634634192361, -0.26508194440625665, -0.06284080423533749, -0.18181581725191354, -0.000943370930972173, -0.158823747950789, -0.17211612416221236, 0.42480948206065294, 0.20569306547592456, 0.2640722371931923, 0.11278439243849282, 0.30080009842487543, 0.07334499033010404, 0.16618079748844966, 0.11893879971291899, 0.18646442762723095, 0.0940012646912548, 0.056123110997889726, -0.14141055483623108, 0.08165587666024335, 0.09055675481904746] |
1,802.04146 | Measurements of Higgs boson properties in the diphoton decay channel
with 36 fb$^{-1}$ of $pp$ collision data at $\sqrt{s} = 13$ TeV with the
ATLAS detector | Properties of the Higgs boson are measured in the two-photon final state
using 36.1 fb$^{-1}$ of proton-proton collision data recorded at $\sqrt{s} =
13$ TeV by the ATLAS experiment at the Large Hadron Collider. Cross-section
measurements for the production of a Higgs boson through gluon-gluon fusion,
vector-boson fusion, and in association with a vector bosonor a top-quark pair
are reported. The signal strength, defined as the ratio of the observed to the
expected signal yield, is measured for each of these production processes as
well as inclusively. The global signal strength measurement of $0.99 \pm 0.14$
improves on the precision of the ATLAS measurement at $\sqrt{s} = 7$ and 8 TeV
by a factor of two. Measurements of gluon-gluon fusion and vector-boson fusion
productions yield signal strengths compatible with the Standard Model
prediction. Measurements of simplified template cross sections, designed to
quantify the different Higgs boson production processes in specific regions of
phase space, are reported. The cross section for the production of the Higgs
boson decaying to two isolated photons in a fiducial region closely matching
the experimental selection of the photons is measured to be $55 \pm 10$ fb,
which is in good agreement with the Standard Model prediction of $64 \pm 2$ fb.
Furthermore, cross sections in fiducial regions enriched in Higgs boson
production in vector-boson fusion or in association with large missing
transverse momentum, leptons or top-quark pairs are reported. Differential and
double-differential measurements are performed for several variables related to
the diphoton kinematics as well as the kinematics and multiplicity of the jets
produced in association with a Higgs boson. No significant deviations from a
wide array of Standard Model predictions are observed.
| hep-ex | properties of the higgs boson are measured in the twophoton final state using 361 fb1 of protonproton collision data recorded at sqrts 13 tev by the atlas experiment at the large hadron collider crosssection measurements for the production of a higgs boson through gluongluon fusion vectorboson fusion and in association with a vector bosonor a topquark pair are reported the signal strength defined as the ratio of the observed to the expected signal yield is measured for each of these production processes as well as inclusively the global signal strength measurement of 099 pm 014 improves on the precision of the atlas measurement at sqrts 7 and 8 tev by a factor of two measurements of gluongluon fusion and vectorboson fusion productions yield signal strengths compatible with the standard model prediction measurements of simplified template cross sections designed to quantify the different higgs boson production processes in specific regions of phase space are reported the cross section for the production of the higgs boson decaying to two isolated photons in a fiducial region closely matching the experimental selection of the photons is measured to be 55 pm 10 fb which is in good agreement with the standard model prediction of 64 pm 2 fb furthermore cross sections in fiducial regions enriched in higgs boson production in vectorboson fusion or in association with large missing transverse momentum leptons or topquark pairs are reported differential and doubledifferential measurements are performed for several variables related to the diphoton kinematics as well as the kinematics and multiplicity of the jets produced in association with a higgs boson no significant deviations from a wide array of standard model predictions are observed | [['properties', 'of', 'the', 'higgs', 'boson', 'are', 'measured', 'in', 'the', 'twophoton', 'final', 'state', 'using', '361', 'fb1', 'of', 'protonproton', 'collision', 'data', 'recorded', 'at', 'sqrts', '13', 'tev', 'by', 'the', 'atlas', 'experiment', 'at', 'the', 'large', 'hadron', 'collider', 'crosssection', 'measurements', 'for', 'the', 'production', 'of', 'a', 'higgs', 'boson', 'through', 'gluongluon', 'fusion', 'vectorboson', 'fusion', 'and', 'in', 'association', 'with', 'a', 'vector', 'bosonor', 'a', 'topquark', 'pair', 'are', 'reported', 'the', 'signal', 'strength', 'defined', 'as', 'the', 'ratio', 'of', 'the', 'observed', 'to', 'the', 'expected', 'signal', 'yield', 'is', 'measured', 'for', 'each', 'of', 'these', 'production', 'processes', 'as', 'well', 'as', 'inclusively', 'the', 'global', 'signal', 'strength', 'measurement', 'of', '099', 'pm', '014', 'improves', 'on', 'the', 'precision', 'of', 'the', 'atlas', 'measurement', 'at', 'sqrts', '7', 'and', '8', 'tev', 'by', 'a', 'factor', 'of', 'two', 'measurements', 'of', 'gluongluon', 'fusion', 'and', 'vectorboson', 'fusion', 'productions', 'yield', 'signal', 'strengths', 'compatible', 'with', 'the', 'standard', 'model', 'prediction', 'measurements', 'of', 'simplified', 'template', 'cross', 'sections', 'designed', 'to', 'quantify', 'the', 'different', 'higgs', 'boson', 'production', 'processes', 'in', 'specific', 'regions', 'of', 'phase', 'space', 'are', 'reported', 'the', 'cross', 'section', 'for', 'the', 'production', 'of', 'the', 'higgs', 'boson', 'decaying', 'to', 'two', 'isolated', 'photons', 'in', 'a', 'fiducial', 'region', 'closely', 'matching', 'the', 'experimental', 'selection', 'of', 'the', 'photons', 'is', 'measured', 'to', 'be', '55', 'pm', '10', 'fb', 'which', 'is', 'in', 'good', 'agreement', 'with', 'the', 'standard', 'model', 'prediction', 'of', '64', 'pm', '2', 'fb', 'furthermore', 'cross', 'sections', 'in', 'fiducial', 'regions', 'enriched', 'in', 'higgs', 'boson', 'production', 'in', 'vectorboson', 'fusion', 'or', 'in', 'association', 'with', 'large', 'missing', 'transverse', 'momentum', 'leptons', 'or', 'topquark', 'pairs', 'are', 'reported', 'differential', 'and', 'doubledifferential', 'measurements', 'are', 'performed', 'for', 'several', 'variables', 'related', 'to', 'the', 'diphoton', 'kinematics', 'as', 'well', 'as', 'the', 'kinematics', 'and', 'multiplicity', 'of', 'the', 'jets', 'produced', 'in', 'association', 'with', 'a', 'higgs', 'boson', 'no', 'significant', 'deviations', 'from', 'a', 'wide', 'array', 'of', 'standard', 'model', 'predictions', 'are', 'observed']] | [-0.05422229960391467, 0.19819246574812993, -0.03300625090947671, 0.1375273293675855, -0.00931028308770196, -0.14187942978418008, 0.0014692976799878207, 0.36004697762091054, -0.19925295792181383, -0.33472844388674605, -0.012388900282200088, -0.3505986483801495, 0.08503545592285015, 0.16827893211675637, 0.07619310467662713, 0.13629537153989077, 0.16734661435454407, 0.03989909937097268, -0.012021881626410918, -0.23376657042313706, 0.27102078989232803, 0.10145822387950665, 0.2524661890835374, 0.07567101098935712, 0.0941615369740281, 0.06997098018499938, -0.09514201320009306, -0.08123366457336074, -0.09840318483215842, 0.10033922698856755, 0.24770767410455102, 0.060924489196728576, 0.08779504610749428, -0.26637980469925837, -0.07311795112422921, 0.1556659257564355, 0.15598503658209334, 0.047967970957556234, -0.08324603466105393, -0.3254956944206391, 0.14402483724227005, -0.24131886464808222, -0.04531077020716938, 0.023836477105929094, -0.01651219296184453, -0.05265176561407067, -0.36789153842255473, 0.13259995621544393, -0.09669196117055517, 0.08895332479172133, -0.019891890019855717, -0.1948315336622975, -0.1212057439728894, -0.017353860261765393, 0.08967836142221296, 0.07898178393740884, 0.23680539445443588, -0.1967413109998134, -0.2557694059089673, 0.3481282553415407, -0.09198992613872344, -0.1588021758080206, 0.2014725341444666, -0.21958166024287823, -0.11580133132890544, 0.2032565067556094, 0.2661088778417219, 0.04670591435437514, -0.21641068116423082, 0.07740624794461341, 0.0072504774582656945, 0.16550217785279858, 0.0661803033372218, 0.0580617171925736, 0.20316633733328093, 0.2216078781218014, -0.05657636315963993, 0.05010441568595442, -0.1777136296112175, -0.06842760201204907, -0.46151090028272435, -0.12357387243008072, -0.035905578146180644, 0.02640596505847167, -0.06404458322366488, -0.05881396926262162, 0.33925972173329105, 0.08326644027695611, 0.3685494496944276, -0.015141701151786202, 0.3093470455206592, 0.11035103633957492, 0.0962810710314873, 0.0048038363619178365, 0.3805245897478678, 0.19481231900609353, 0.13906406897374174, -0.15767888949083333, 0.037904111800545995, 0.035206092534248126] |
1,802.04147 | Vanishing Shear Viscosity Limit and Boundary Layer Study on the Planar
MHD system | We consider an initial boundary problem for the planar MHD system under the
general condition on the heat conductivity $\kappa$ that may depend on both the
density $\rho$ and the temperature $\theta$ satisfying
$\kappa(\rho,\theta)\geq\kappa_1 \theta^{q}$ for some constants $\kappa_1>0$
and $q>0.$ Firstly, the global existence of strong solution for large initial
data is obtained, and then the limit of the vanishing shear viscosity is
justified. In addition, the $L^2$ convergence rate is obtained together with
the estimation on the thickness of the boundary layer.
| math.AP | we consider an initial boundary problem for the planar mhd system under the general condition on the heat conductivity kappa that may depend on both the density rho and the temperature theta satisfying kapparhothetageqkappa_1 thetaq for some constants kappa_10 and q0 firstly the global existence of strong solution for large initial data is obtained and then the limit of the vanishing shear viscosity is justified in addition the l2 convergence rate is obtained together with the estimation on the thickness of the boundary layer | [['we', 'consider', 'an', 'initial', 'boundary', 'problem', 'for', 'the', 'planar', 'mhd', 'system', 'under', 'the', 'general', 'condition', 'on', 'the', 'heat', 'conductivity', 'kappa', 'that', 'may', 'depend', 'on', 'both', 'the', 'density', 'rho', 'and', 'the', 'temperature', 'theta', 'satisfying', 'kapparhothetageqkappa_1', 'thetaq', 'for', 'some', 'constants', 'kappa_10', 'and', 'q0', 'firstly', 'the', 'global', 'existence', 'of', 'strong', 'solution', 'for', 'large', 'initial', 'data', 'is', 'obtained', 'and', 'then', 'the', 'limit', 'of', 'the', 'vanishing', 'shear', 'viscosity', 'is', 'justified', 'in', 'addition', 'the', 'l2', 'convergence', 'rate', 'is', 'obtained', 'together', 'with', 'the', 'estimation', 'on', 'the', 'thickness', 'of', 'the', 'boundary', 'layer']] | [-0.1820269077791866, 0.11066078563681551, -0.05176755469516817, 0.013139796659283071, -0.03863291526549911, -0.1056005333112665, 0.022959439521543234, 0.3050073631870818, -0.2699707924354687, -0.20576435541846308, 0.18353521347141274, -0.26007326120084306, -0.05414058999943895, 0.19396668213352292, -0.03118256887376129, 0.1021214081367186, 0.05739280522705605, 0.07895072772594011, -0.0806732429724456, -0.20587353590112853, 0.38611496925488653, 0.018648149546639747, 0.29887754317507687, 0.10577140631454335, 0.08647234312185725, -0.010177861862670046, 0.04283113917335868, 0.05407436477042824, -0.2416547886605258, 0.04218025393755994, 0.13621744800762958, 0.03868034518469708, 0.21444125992669555, -0.41585121463131475, -0.2061444923775383, 0.06124475271811327, 0.08025913373623268, 0.06269201774329665, -0.014258108658615095, -0.2289473025004817, 0.09814627148513963, -0.07171366322247019, -0.15125797025814472, -0.06523978220739302, 0.0202620675316058, 0.03116483114525137, -0.358897526355752, 0.14671769729220724, 0.07431826059964586, 0.03277100206363991, -0.17841129268643008, -0.14433562587553928, -0.060234687369630995, 0.10697870694257948, 0.09998110869439342, 0.04485980862841369, 0.09257823536845755, -0.17970386353960957, 0.02412740143958524, 0.3213495035846549, -0.09236832895787456, -0.23775860261037407, 0.1738238539546728, -0.16016975726303925, -0.10142991717635508, 0.09951591531813414, 0.13637079519545098, 0.1202642567713846, -0.10256933354694082, 0.13645367013326992, -0.0743791039749778, 0.15621563194162516, 0.096219754856394, -0.009231636095202965, 0.13384716443897013, 0.13259317547486849, 0.12989975775855717, 0.13760015250643692, -0.09856910280201651, -0.05196423585812775, -0.36225949447736683, -0.14820106577195497, -0.19336421092052059, 0.06576416481016989, -0.17525722760744308, -0.1749651030446571, 0.3351071991688426, 0.12395845692049352, 0.19638658685087934, 0.07779420171976538, 0.24879558866910906, 0.19253437435156273, -0.005929945205080222, 0.10192721311833305, 0.2665200200572144, 0.15622751622079276, 0.13013396928849888, -0.2731117650933833, 0.08316156127860388, 0.10073694554774697] |
1,802.04148 | On Dendrites Generated By Symmetric Polygonal Systems: The Case of
Regular Polygons | We define $G$-symmetric polygonal systems of similarities and study the
properties of symmetric dendrites, which appear as their attractors. This
allows us to find the conditions under which the attractor of a zipper becomes
a dendrite.
| math.MG math.DS | we define gsymmetric polygonal systems of similarities and study the properties of symmetric dendrites which appear as their attractors this allows us to find the conditions under which the attractor of a zipper becomes a dendrite | [['we', 'define', 'gsymmetric', 'polygonal', 'systems', 'of', 'similarities', 'and', 'study', 'the', 'properties', 'of', 'symmetric', 'dendrites', 'which', 'appear', 'as', 'their', 'attractors', 'this', 'allows', 'us', 'to', 'find', 'the', 'conditions', 'under', 'which', 'the', 'attractor', 'of', 'a', 'zipper', 'becomes', 'a', 'dendrite']] | [-0.17608169311036667, 0.10543431540847653, -0.1449032266650142, 0.04906154104133344, -0.05727128735614113, -0.12059642454712755, 0.06484534821680023, 0.35322377892831963, -0.2786922159915169, -0.188116491979195, 0.10369532761008789, -0.23945208298108708, -0.2417948050941858, 0.12163550505000684, -0.053485701947162546, 0.03476909320387575, 0.0105416064357592, 0.06661777573430704, -0.07934743846352729, -0.1527459817007184, 0.33477902609027094, -0.02851438636167182, 0.27127568832495147, 0.01912773306604423, 0.09206302707187003, -0.06451815831112778, 0.006308874115347862, 0.05472590328038981, -0.19397958800093168, 0.1208409315182103, 0.19647559132621004, 0.08898309087898168, 0.21604734679891002, -0.44030453347497517, -0.20293398085050285, 0.16568652502933723, 0.12154614871057372, 0.09139684398218782, -0.014413327030423615, -0.2741712027022408, 0.09479412507304612, -0.1018820475470016, -0.2177692159699897, -0.07239479602624972, 0.05093388122299479, 0.07421541245680095, -0.3059513316386276, 0.0018330417547581925, 0.14023378594881958, -0.00027587458801766235, -0.06220246347139538, 0.04650286983491646, -0.08625648372496168, 0.17752179115389785, 0.0025986449068619143, -0.040834341411634036, 0.13199762067395365, -0.09200396683041213, -0.09046325889519519, 0.4003825570560164, -0.008517634304654267, -0.2038155756632073, 0.2816979208857649, -0.14081231018321383, -0.1309029743489292, 0.12107189738243404, 0.17814041705181202, 0.13677728129550815, -0.14069704225079882, 0.1074121944434915, -0.06935926588873069, 0.11162983562422192, 0.10679115223724188, 0.05819730372685525, 0.19564102662520277, 0.1432203558894495, 0.11759522823720342, 0.24116939826247594, -0.032255665476744376, -0.1215571153184606, -0.2765399381104443, -0.1557102363763584, -0.024879887234419584, 0.07214209934075673, -0.08999038688125438, -0.31018546839348143, 0.43974012395160067, 0.10541417454886767, 0.2982046877344449, 0.05460379414984749, 0.1563350544634482, 0.07792424361105077, 0.09097672382550728, 0.03993929653531975, 0.16513146303865747, 0.1494412743486464, 0.08758467244398263, -0.2370819991144041, 0.04305152782439513, 0.08739127221310304] |
1,802.04149 | Algorithms and Uncertainty Sets for Data-Driven Robust Shortest Path
Problems | We consider robust shortest path problems, where the aim is to find a path
that optimizes the worst-case performance over an uncertainty set containing
all relevant scenarios for arc costs. The usual approach for such problems is
to assume this uncertainty set given by an expert who can advise on the shape
and size of the set.
Following the idea of data-driven robust optimization, we instead construct a
range of uncertainty sets from the current literature based on real-world
traffic measurements provided by the City of Chicago. We then compare the
performance of the resulting robust paths within and outside the sample, which
allows us to draw conclusions what the most suited uncertainty set is.
Based on our experiments, we then focus on ellipsoidal uncertainty sets, and
develop a new solution algorithm that significantly outperforms a
state-of-the-art solver.
| math.OC | we consider robust shortest path problems where the aim is to find a path that optimizes the worstcase performance over an uncertainty set containing all relevant scenarios for arc costs the usual approach for such problems is to assume this uncertainty set given by an expert who can advise on the shape and size of the set following the idea of datadriven robust optimization we instead construct a range of uncertainty sets from the current literature based on realworld traffic measurements provided by the city of chicago we then compare the performance of the resulting robust paths within and outside the sample which allows us to draw conclusions what the most suited uncertainty set is based on our experiments we then focus on ellipsoidal uncertainty sets and develop a new solution algorithm that significantly outperforms a stateoftheart solver | [['we', 'consider', 'robust', 'shortest', 'path', 'problems', 'where', 'the', 'aim', 'is', 'to', 'find', 'a', 'path', 'that', 'optimizes', 'the', 'worstcase', 'performance', 'over', 'an', 'uncertainty', 'set', 'containing', 'all', 'relevant', 'scenarios', 'for', 'arc', 'costs', 'the', 'usual', 'approach', 'for', 'such', 'problems', 'is', 'to', 'assume', 'this', 'uncertainty', 'set', 'given', 'by', 'an', 'expert', 'who', 'can', 'advise', 'on', 'the', 'shape', 'and', 'size', 'of', 'the', 'set', 'following', 'the', 'idea', 'of', 'datadriven', 'robust', 'optimization', 'we', 'instead', 'construct', 'a', 'range', 'of', 'uncertainty', 'sets', 'from', 'the', 'current', 'literature', 'based', 'on', 'realworld', 'traffic', 'measurements', 'provided', 'by', 'the', 'city', 'of', 'chicago', 'we', 'then', 'compare', 'the', 'performance', 'of', 'the', 'resulting', 'robust', 'paths', 'within', 'and', 'outside', 'the', 'sample', 'which', 'allows', 'us', 'to', 'draw', 'conclusions', 'what', 'the', 'most', 'suited', 'uncertainty', 'set', 'is', 'based', 'on', 'our', 'experiments', 'we', 'then', 'focus', 'on', 'ellipsoidal', 'uncertainty', 'sets', 'and', 'develop', 'a', 'new', 'solution', 'algorithm', 'that', 'significantly', 'outperforms', 'a', 'stateoftheart', 'solver']] | [-0.05635479718878649, 0.013145945111055102, -0.07864688971903229, 0.056907436903228685, -0.12334787640619375, -0.09465239543224806, 0.11093383105606705, 0.3901731578660184, -0.2568462593793073, -0.32432275069742533, 0.10772638298247171, -0.27973598706296837, -0.13353922712090222, 0.2598353235803518, -0.13516150535239527, 0.0823671415893604, 0.12165735150430945, 0.051951093174031245, -0.044073328365693276, -0.2616393880841012, 0.3353453526413933, 0.026747732534599694, 0.3036894563153602, 0.019839739860153582, 0.11724845869500405, 0.01923160224079924, -0.026679879094075844, 0.0729047105330434, -0.1360234021234699, 0.16541545369081956, 0.24830706671312236, 0.2090492092234933, 0.30704190526697517, -0.4036724189685154, -0.19356661506564074, 0.10463126886136614, 0.08498658893791877, 0.09396392080099389, 0.0004925106625086155, -0.27891561814982013, 0.08370139557055022, -0.14323595437504674, -0.07067148381358256, -0.050742002109578556, 0.009158129883133739, 0.003494858101475984, -0.30926738041655527, 0.024162026437714805, 0.011529469751226514, 0.007608121247503204, -0.04647757237704565, -0.1415700163351426, 0.045913537989532495, 0.1260310755300241, 0.013092953994350535, 0.01952275249472671, 0.1300597753994963, -0.07269312993225142, -0.15254335253722157, 0.40599498612995166, -0.00957762437072866, -0.2100046197411375, 0.16521717707413094, -0.06643206698388077, -0.12687251756332166, 0.09746810896288388, 0.2167648734656446, 0.12270223439765582, -0.16716766495654525, 0.04882366283994127, -0.06495032918916178, 0.1939578401232712, 0.0032221844919241857, -0.013548201739626087, 0.16357773732517567, 0.22129451040941142, 0.1311614943526523, 0.13384017025700945, -0.10695290430516437, -0.1104767248608118, -0.2898265277980354, -0.08791597055075555, -0.16105104265380246, -0.0018172601264887962, -0.10873378771055656, -0.15065408862479354, 0.39736883390856825, 0.2588022030245486, 0.1937901615473084, 0.11324968010244513, 0.32090792757715436, 0.06894928371015788, 0.020373904679402494, 0.12978608402814987, 0.19012287334687467, 0.016388471521761105, 0.04426349654533914, -0.20879151348355293, 0.09704426280391551, 0.03766989763961106] |
1,802.0415 | Late-time acceleration driven by shift-symmetric Galileon in the
presence of Torsion | A shift-symmetric Galileon model in presence of spacetime torsion has been
constructed for the first time. This has been realized by localizing (or,
gauging) the Galileon symmetry in flat spacetime in an appropriate manner. We
have applied the above model to study the evolution of the universe at a
cosmological scale. Interestingly, for a wide class of torsional structures we
have shown that the model leads to late time cosmic acceleration. Furthermore,
as torsion vanishes, our model reproduces the standard results.
| gr-qc hep-th | a shiftsymmetric galileon model in presence of spacetime torsion has been constructed for the first time this has been realized by localizing or gauging the galileon symmetry in flat spacetime in an appropriate manner we have applied the above model to study the evolution of the universe at a cosmological scale interestingly for a wide class of torsional structures we have shown that the model leads to late time cosmic acceleration furthermore as torsion vanishes our model reproduces the standard results | [['a', 'shiftsymmetric', 'galileon', 'model', 'in', 'presence', 'of', 'spacetime', 'torsion', 'has', 'been', 'constructed', 'for', 'the', 'first', 'time', 'this', 'has', 'been', 'realized', 'by', 'localizing', 'or', 'gauging', 'the', 'galileon', 'symmetry', 'in', 'flat', 'spacetime', 'in', 'an', 'appropriate', 'manner', 'we', 'have', 'applied', 'the', 'above', 'model', 'to', 'study', 'the', 'evolution', 'of', 'the', 'universe', 'at', 'a', 'cosmological', 'scale', 'interestingly', 'for', 'a', 'wide', 'class', 'of', 'torsional', 'structures', 'we', 'have', 'shown', 'that', 'the', 'model', 'leads', 'to', 'late', 'time', 'cosmic', 'acceleration', 'furthermore', 'as', 'torsion', 'vanishes', 'our', 'model', 'reproduces', 'the', 'standard', 'results']] | [-0.14525866964803202, 0.11917991615579619, -0.096046610120224, 0.06966753946588501, -0.08174111609013728, -0.12393051232671204, -0.09433470445794317, 0.3721268724328206, -0.2055203728147863, -0.29768765996422986, 0.052432119660941814, -0.19152971840015165, -0.13937426146039347, 0.16301883864331485, -0.025138510149662143, 0.0053095674533167, -0.03983963271717966, 0.07059308457659719, -0.06365554539751216, -0.27263954408282853, 0.3243344809333966, 0.126532239092077, 0.2739082224736059, -0.0018699875929289395, 0.13812635102263296, -0.07183551168023253, 0.0008796571368023891, 0.05728045477888283, -0.13242346798344645, 0.023283890779072672, 0.18343759567856235, 0.0666038315616732, 0.21224578911220127, -0.4116846211484553, -0.3259676352925139, 0.14221028209790404, 0.13990023537872381, 0.195627412615045, -0.0827748436699219, -0.2816623692619212, 0.09273456889032214, -0.20019904739096944, -0.15560533521397982, -0.0801375061618509, 0.008254332536900486, -0.08559420198075657, -0.2015402099221117, 0.10075151153414706, 0.04079818975088405, -0.005803699263107078, -0.10823264912943598, -0.007801342169167819, -0.03230669813656053, 0.08724429072340789, 0.1378121885103116, 0.04060965652985751, 0.07529688188030075, -0.1250460979120553, -0.11242133443370278, 0.4204925314787729, -0.15083155857778532, -0.1720971811654759, 0.14457846466267918, -0.15084392844733815, -0.18130909855029098, 0.09848050137602345, 0.13947732724755266, 0.12630660873320368, -0.14658696666635848, 0.224477066612446, -0.04039322197391295, 0.12204945255300881, 0.09785689053666076, -0.023090491410528803, 0.2500764336436987, 0.17166343356057265, 0.02939403667057186, 0.12257607724161151, -0.06216774434771067, -0.09837769746872378, -0.36253785824886076, -0.1308859815062196, -0.13129618717932406, 0.05416894138411239, -0.10165384100221189, -0.1660658259007269, 0.42247968902926386, 0.13020202133482622, 0.17359873381684776, 0.06201117131629108, 0.2151007639175212, 0.09163925892753917, 0.10770431478266362, 0.04910563547767837, 0.3094875740324273, 0.11238470742835399, 0.10002470370037136, -0.20941400513078812, 0.005135109860817959, 0.06863856946842538] |
1,802.04151 | The HERA-19 Commissioning Array: Direction Dependent Effects | Foreground power dominates the measurements of interferometers that seek a
statistical detection of highly-redshifted HI emission from the Epoch of
Reionization (EoR). The chromaticity of the instrument creates a boundary in
the Fourier transform of frequency (proportional to $k_\parallel$) between
spectrally smooth emission, characteristic of the strong synchrotron foreground
(the "wedge"), and the spectrally structured emission from HI in the EoR (the
"EoR window"). Faraday rotation can inject spectral structure into otherwise
smooth polarized foreground emission, which through instrument effects or
miscalibration could possibly pollute the EoR window. Using data from the HERA
19-element commissioning array, we investigate the polarization response of
this new instrument in the power spectrum domain. We perform a simple
image-based calibration based on the unpolarized diffuse emission of the Global
Sky Model, and show that it achieves qualitative redundancy between the
nominally-redundant baselines of the array and reasonable amplitude accuracy.
We construct power spectra of all fully polarized coherencies in all
pseudo-Stokes parameters. We compare to simulations based on an unpolarized
diffuse sky model and detailed electromagnetic simulations of the dish and
feed, confirming that in Stokes I, the calibration does not add significant
spectral structure beyond the expected level. Further, this calibration is
stable over the 8 days of observations considered. Excess power is seen in the
power spectra of the linear polarization Stokes parameters which is not easily
attributable to leakage via the primary beam, and results from some combination
of residual calibration errors and actual polarized emission. Stokes V is found
to be highly discrepant from the expectation of zero power, strongly pointing
to the need for more accurate polarized calibration.
| astro-ph.IM | foreground power dominates the measurements of interferometers that seek a statistical detection of highlyredshifted hi emission from the epoch of reionization eor the chromaticity of the instrument creates a boundary in the fourier transform of frequency proportional to k_parallel between spectrally smooth emission characteristic of the strong synchrotron foreground the wedge and the spectrally structured emission from hi in the eor the eor window faraday rotation can inject spectral structure into otherwise smooth polarized foreground emission which through instrument effects or miscalibration could possibly pollute the eor window using data from the hera 19element commissioning array we investigate the polarization response of this new instrument in the power spectrum domain we perform a simple imagebased calibration based on the unpolarized diffuse emission of the global sky model and show that it achieves qualitative redundancy between the nominallyredundant baselines of the array and reasonable amplitude accuracy we construct power spectra of all fully polarized coherencies in all pseudostokes parameters we compare to simulations based on an unpolarized diffuse sky model and detailed electromagnetic simulations of the dish and feed confirming that in stokes i the calibration does not add significant spectral structure beyond the expected level further this calibration is stable over the 8 days of observations considered excess power is seen in the power spectra of the linear polarization stokes parameters which is not easily attributable to leakage via the primary beam and results from some combination of residual calibration errors and actual polarized emission stokes v is found to be highly discrepant from the expectation of zero power strongly pointing to the need for more accurate polarized calibration | [['foreground', 'power', 'dominates', 'the', 'measurements', 'of', 'interferometers', 'that', 'seek', 'a', 'statistical', 'detection', 'of', 'highlyredshifted', 'hi', 'emission', 'from', 'the', 'epoch', 'of', 'reionization', 'eor', 'the', 'chromaticity', 'of', 'the', 'instrument', 'creates', 'a', 'boundary', 'in', 'the', 'fourier', 'transform', 'of', 'frequency', 'proportional', 'to', 'k_parallel', 'between', 'spectrally', 'smooth', 'emission', 'characteristic', 'of', 'the', 'strong', 'synchrotron', 'foreground', 'the', 'wedge', 'and', 'the', 'spectrally', 'structured', 'emission', 'from', 'hi', 'in', 'the', 'eor', 'the', 'eor', 'window', 'faraday', 'rotation', 'can', 'inject', 'spectral', 'structure', 'into', 'otherwise', 'smooth', 'polarized', 'foreground', 'emission', 'which', 'through', 'instrument', 'effects', 'or', 'miscalibration', 'could', 'possibly', 'pollute', 'the', 'eor', 'window', 'using', 'data', 'from', 'the', 'hera', '19element', 'commissioning', 'array', 'we', 'investigate', 'the', 'polarization', 'response', 'of', 'this', 'new', 'instrument', 'in', 'the', 'power', 'spectrum', 'domain', 'we', 'perform', 'a', 'simple', 'imagebased', 'calibration', 'based', 'on', 'the', 'unpolarized', 'diffuse', 'emission', 'of', 'the', 'global', 'sky', 'model', 'and', 'show', 'that', 'it', 'achieves', 'qualitative', 'redundancy', 'between', 'the', 'nominallyredundant', 'baselines', 'of', 'the', 'array', 'and', 'reasonable', 'amplitude', 'accuracy', 'we', 'construct', 'power', 'spectra', 'of', 'all', 'fully', 'polarized', 'coherencies', 'in', 'all', 'pseudostokes', 'parameters', 'we', 'compare', 'to', 'simulations', 'based', 'on', 'an', 'unpolarized', 'diffuse', 'sky', 'model', 'and', 'detailed', 'electromagnetic', 'simulations', 'of', 'the', 'dish', 'and', 'feed', 'confirming', 'that', 'in', 'stokes', 'i', 'the', 'calibration', 'does', 'not', 'add', 'significant', 'spectral', 'structure', 'beyond', 'the', 'expected', 'level', 'further', 'this', 'calibration', 'is', 'stable', 'over', 'the', '8', 'days', 'of', 'observations', 'considered', 'excess', 'power', 'is', 'seen', 'in', 'the', 'power', 'spectra', 'of', 'the', 'linear', 'polarization', 'stokes', 'parameters', 'which', 'is', 'not', 'easily', 'attributable', 'to', 'leakage', 'via', 'the', 'primary', 'beam', 'and', 'results', 'from', 'some', 'combination', 'of', 'residual', 'calibration', 'errors', 'and', 'actual', 'polarized', 'emission', 'stokes', 'v', 'is', 'found', 'to', 'be', 'highly', 'discrepant', 'from', 'the', 'expectation', 'of', 'zero', 'power', 'strongly', 'pointing', 'to', 'the', 'need', 'for', 'more', 'accurate', 'polarized', 'calibration']] | [-0.05754781046804661, 0.08586962603793212, -0.08553895885159683, 0.03994025516128412, -0.10092645150448862, -0.09629441987965535, 0.0032093443450856296, 0.4482046553816242, -0.25662029646415513, -0.275366648187519, 0.07982633765856648, -0.279646943668636, -0.05181641798302503, 0.20425308795300512, -0.015410536605418286, 0.01301718143264899, 0.04008523797945988, -0.10398218421132935, -0.028584294810312126, -0.18423654157398026, 0.2805350839172591, 0.13694773201241198, 0.263579698943983, 0.012700637493784844, 0.09004307306704742, -0.033951351984163346, -0.1285630287079329, -0.006047257874509815, -0.0665323871003596, 0.06851484494158223, 0.2557422520988708, 0.14093076344841066, 0.154190982669271, -0.38745787718476316, -0.21361812435121935, 0.10649594693873705, 0.11510896341973734, 0.06938603800836574, -0.015716950861095758, -0.2740920452638233, 0.0217653956283442, -0.14304740203384045, -0.1185694707554071, -0.01980020587196511, -0.018681012627700073, 0.027362006348435688, -0.28172580892619525, 0.07724037677946079, 0.0345604684795096, 0.06403709656021764, -0.06030953833519408, -0.11315710311197442, -0.038531962146438406, 0.09942103978351094, 0.0035186317792486694, 0.02726328513471232, 0.14437746046562697, -0.14417242503302932, -0.03520354652107599, 0.3802581793185644, -0.1234882897906675, -0.09758563599922461, 0.12164184699412296, -0.2349500334315867, -0.11377390882624697, 0.22528453075940885, 0.18518675204143206, 0.06914023500396295, -0.11988900036442927, 0.037064757401495126, 0.001890158377961022, 0.27080590802956417, 0.06819104973561643, 0.04234967100209895, 0.27537854329058514, 0.11780596212815311, 0.08546060270717898, 0.12621850853006283, -0.24484041224827655, 0.007116051441344541, -0.31234948010853586, -0.05496801021250535, -0.1458969237527039, 0.09419856508437296, -0.0879348872581755, -0.12811067753993777, 0.41944834202255926, 0.16935392152971487, 0.17946452745550384, 0.04097854629968213, 0.4002789318045315, 0.09007904345862051, 0.05407990593016706, 0.04973218237875685, 0.2917745922512701, 0.13682142120859261, 0.08865837040047723, -0.2423286623712141, 0.03680883843647072, -0.05343975351464129] |
1,802.04152 | Mid Infrared Nonlinear Plasmonics using Germanium Nanoantennas on
Silicon Substrates | We demonstrate third harmonic generation in plasmonic antennas made of highly
doped germanium and designed to be resonant in the mid infrared. Owing to the
near-field enhancement, the result is an ultrafast, sub-diffraction, coherent
light source tunable between 3 and 5 micrometer wavelength on a silicon
substrate. To observe nonlinearity in this challenging spectral region, a
high-power femtosecond laser system equipped with parametric frequency
conversion in combination with an all-reflective confocal microscope setup is
employed. We show spatially resolved maps of the linear scattering cross
section and the nonlinear emission of single isolated antenna structures. A
clear third order power dependence as well as the mid-infrared emission spectra
prove the nonlinear nature of the light emission. Simulations support the
observed resonance length of the double rod antenna and demonstrate that the
field enhancement inside the antenna material is responsible for the nonlinear
frequency mixing.
| physics.app-ph cond-mat.mes-hall | we demonstrate third harmonic generation in plasmonic antennas made of highly doped germanium and designed to be resonant in the mid infrared owing to the nearfield enhancement the result is an ultrafast subdiffraction coherent light source tunable between 3 and 5 micrometer wavelength on a silicon substrate to observe nonlinearity in this challenging spectral region a highpower femtosecond laser system equipped with parametric frequency conversion in combination with an allreflective confocal microscope setup is employed we show spatially resolved maps of the linear scattering cross section and the nonlinear emission of single isolated antenna structures a clear third order power dependence as well as the midinfrared emission spectra prove the nonlinear nature of the light emission simulations support the observed resonance length of the double rod antenna and demonstrate that the field enhancement inside the antenna material is responsible for the nonlinear frequency mixing | [['we', 'demonstrate', 'third', 'harmonic', 'generation', 'in', 'plasmonic', 'antennas', 'made', 'of', 'highly', 'doped', 'germanium', 'and', 'designed', 'to', 'be', 'resonant', 'in', 'the', 'mid', 'infrared', 'owing', 'to', 'the', 'nearfield', 'enhancement', 'the', 'result', 'is', 'an', 'ultrafast', 'subdiffraction', 'coherent', 'light', 'source', 'tunable', 'between', '3', 'and', '5', 'micrometer', 'wavelength', 'on', 'a', 'silicon', 'substrate', 'to', 'observe', 'nonlinearity', 'in', 'this', 'challenging', 'spectral', 'region', 'a', 'highpower', 'femtosecond', 'laser', 'system', 'equipped', 'with', 'parametric', 'frequency', 'conversion', 'in', 'combination', 'with', 'an', 'allreflective', 'confocal', 'microscope', 'setup', 'is', 'employed', 'we', 'show', 'spatially', 'resolved', 'maps', 'of', 'the', 'linear', 'scattering', 'cross', 'section', 'and', 'the', 'nonlinear', 'emission', 'of', 'single', 'isolated', 'antenna', 'structures', 'a', 'clear', 'third', 'order', 'power', 'dependence', 'as', 'well', 'as', 'the', 'midinfrared', 'emission', 'spectra', 'prove', 'the', 'nonlinear', 'nature', 'of', 'the', 'light', 'emission', 'simulations', 'support', 'the', 'observed', 'resonance', 'length', 'of', 'the', 'double', 'rod', 'antenna', 'and', 'demonstrate', 'that', 'the', 'field', 'enhancement', 'inside', 'the', 'antenna', 'material', 'is', 'responsible', 'for', 'the', 'nonlinear', 'frequency', 'mixing']] | [-0.133706293048211, 0.1302888713045023, -0.018626452979838684, 0.004379129118104983, -0.045532814367713094, -0.16293125385224508, -0.012574880175331296, 0.48938602238841766, -0.25658793120864076, -0.2731870361086395, 0.018243293501048658, -0.2877945664157677, -0.12817117551498491, 0.23938599207233185, 0.013979495258657456, 0.05337795530471744, 0.0017109946250760306, -0.07860874879083389, 0.02775257997402352, -0.1030422383345366, 0.2721135028760828, 0.09133871710764652, 0.3200866356880094, 0.07748681515254753, 0.11543688958045095, 0.015405948055558838, 0.009070670390630968, -0.06483132949668086, -0.07506451271855338, 0.08958624833677378, 0.27494149274813634, -0.014644541219846966, 0.1943027070883545, -0.40851865748926586, -0.22487174510509553, 0.02854251089027255, 0.1388117277862572, 0.0809524311334826, -0.09152896775372533, -0.25547869642549714, 0.02412714319103139, -0.10900162318850765, -0.16359774810310532, -0.0013838784297048631, -0.029796397509926464, 0.03447849465333598, -0.279213201901358, 0.005679748234494279, 0.03455225620968526, 0.06247206403648104, -0.040962208426208235, -0.015156749554282416, -0.020028651006416313, 0.02743161662187453, -0.041656569754801843, -0.0023315554733724436, 0.18029471461866503, -0.10893821501182781, -0.10088891543758412, 0.3615827240125024, -0.12709289250374745, -0.09947644802741706, 0.14703761542397034, -0.22793439542227942, -0.014846679149842303, 0.22229938462583554, 0.18166768327743435, 0.13758373963193865, -0.13015690264647775, 0.02813564275695373, 0.01664866138728232, 0.3012875075671925, 0.15434830505142194, 0.13724921869450352, 0.23414409110814127, 0.2329284650784555, 0.03646119788148402, 0.16735235815010835, -0.21145558635261194, 0.01157246175312644, -0.26297804545740494, -0.11259159750544415, -0.18230638289565426, 0.06963419373884487, -0.0694191246839182, -0.1462924945905494, 0.3661910998489475, 0.07859167492198241, 0.1548080094378545, -0.03269372077354799, 0.35347292567085886, 0.1357722581006884, 0.10401621786877513, -0.0227222606449181, 0.3262980043113607, 0.18059505114878346, 0.11929168374303521, -0.2853652948542731, -0.05160197298715098, -0.05941003641621339] |
1,802.04153 | Influence of a chemical reaction on viscous fingering: Effect of the
injection flow rate | The hydrodynamic viscous fingering instability can be influenced by a simple
viscosity changing chemical reaction of type A+B --> C, when a solution of
reactant A is injected into a solution of B and a product C of different
viscosity is formed. We investigate here numerically such reactive viscous
fingering in the case of a reaction decreasing the viscosity to define the
optimal conditions on the chemical and hydrodynamic parameters for controlling
fingering. In particular, we analyze the influence of the injection flow rate
or equivalently of the Peclet number (Pe) of the problem on the efficiency of
the chemical control of fingering. We show that the viscosity decreasing
reaction has an increased stabilizing effect when Pe is decreased. On the
contrary, fingering is more intense and the system more unstable when Pe is
increased. The related reactive fingering patterns cover then respectively a
smaller (larger) area than in the non-reactive equivalent. Depending on the
value of the flow rate, a given chemical reaction may thus either enhance or
suppress a fingering instability. This stabilization and destabilization at low
and high Pe are shown to be related to the Pe-dependent characteristics of a
minimum in the viscosity profile that develops around the miscible interface
thanks to the effect of the chemical reaction.
| physics.flu-dyn | the hydrodynamic viscous fingering instability can be influenced by a simple viscosity changing chemical reaction of type ab c when a solution of reactant a is injected into a solution of b and a product c of different viscosity is formed we investigate here numerically such reactive viscous fingering in the case of a reaction decreasing the viscosity to define the optimal conditions on the chemical and hydrodynamic parameters for controlling fingering in particular we analyze the influence of the injection flow rate or equivalently of the peclet number pe of the problem on the efficiency of the chemical control of fingering we show that the viscosity decreasing reaction has an increased stabilizing effect when pe is decreased on the contrary fingering is more intense and the system more unstable when pe is increased the related reactive fingering patterns cover then respectively a smaller larger area than in the nonreactive equivalent depending on the value of the flow rate a given chemical reaction may thus either enhance or suppress a fingering instability this stabilization and destabilization at low and high pe are shown to be related to the pedependent characteristics of a minimum in the viscosity profile that develops around the miscible interface thanks to the effect of the chemical reaction | [['the', 'hydrodynamic', 'viscous', 'fingering', 'instability', 'can', 'be', 'influenced', 'by', 'a', 'simple', 'viscosity', 'changing', 'chemical', 'reaction', 'of', 'type', 'ab', 'c', 'when', 'a', 'solution', 'of', 'reactant', 'a', 'is', 'injected', 'into', 'a', 'solution', 'of', 'b', 'and', 'a', 'product', 'c', 'of', 'different', 'viscosity', 'is', 'formed', 'we', 'investigate', 'here', 'numerically', 'such', 'reactive', 'viscous', 'fingering', 'in', 'the', 'case', 'of', 'a', 'reaction', 'decreasing', 'the', 'viscosity', 'to', 'define', 'the', 'optimal', 'conditions', 'on', 'the', 'chemical', 'and', 'hydrodynamic', 'parameters', 'for', 'controlling', 'fingering', 'in', 'particular', 'we', 'analyze', 'the', 'influence', 'of', 'the', 'injection', 'flow', 'rate', 'or', 'equivalently', 'of', 'the', 'peclet', 'number', 'pe', 'of', 'the', 'problem', 'on', 'the', 'efficiency', 'of', 'the', 'chemical', 'control', 'of', 'fingering', 'we', 'show', 'that', 'the', 'viscosity', 'decreasing', 'reaction', 'has', 'an', 'increased', 'stabilizing', 'effect', 'when', 'pe', 'is', 'decreased', 'on', 'the', 'contrary', 'fingering', 'is', 'more', 'intense', 'and', 'the', 'system', 'more', 'unstable', 'when', 'pe', 'is', 'increased', 'the', 'related', 'reactive', 'fingering', 'patterns', 'cover', 'then', 'respectively', 'a', 'smaller', 'larger', 'area', 'than', 'in', 'the', 'nonreactive', 'equivalent', 'depending', 'on', 'the', 'value', 'of', 'the', 'flow', 'rate', 'a', 'given', 'chemical', 'reaction', 'may', 'thus', 'either', 'enhance', 'or', 'suppress', 'a', 'fingering', 'instability', 'this', 'stabilization', 'and', 'destabilization', 'at', 'low', 'and', 'high', 'pe', 'are', 'shown', 'to', 'be', 'related', 'to', 'the', 'pedependent', 'characteristics', 'of', 'a', 'minimum', 'in', 'the', 'viscosity', 'profile', 'that', 'develops', 'around', 'the', 'miscible', 'interface', 'thanks', 'to', 'the', 'effect', 'of', 'the', 'chemical', 'reaction']] | [-0.15353983099783017, 0.18391473932653232, -0.07027746594602442, 0.01142416793764347, -0.03050693226978183, -0.12851250696306427, 0.04372971620233286, 0.27677503627658423, -0.3238945204941999, -0.25318869121505744, 0.07786954220473057, -0.25139894179689387, -0.09654447031872614, 0.16564266514254822, -0.03151325917736228, 0.015404500974164832, 0.020489801061783164, -0.008264245200414388, -0.0219303550805004, -0.20062353639819083, 0.31763716933894015, 0.0663428151716722, 0.2638605158798219, 0.09174433391308412, 0.058328514548373366, -0.0834039301512738, -0.004329109962522385, 0.08423637656073663, -0.20494261520971555, 0.01959138851269104, 0.1986507528982613, 0.03452148465883164, 0.2587022660388833, -0.4428286293211083, -0.2475685169559992, 0.09002049989732248, 0.15665521332772359, 0.12675736014775577, -0.0423103111072643, -0.16508163854457616, 0.11233858305827847, -0.16899915310953345, -0.09824593902255098, 0.0009386060315938223, 0.07529755967635927, 0.043273067795893266, -0.2928663256045963, 0.10243515967990138, 0.05583789709822408, 0.06997297380917838, -0.10268313885843824, -0.09195768337064822, -0.1109225760546646, 0.08251074499081976, 0.070359951680127, 0.02485125936869909, 0.2099382371486475, -0.1789742115474794, 0.003040262061126885, 0.3930244483275428, -0.085905706213158, -0.2280750586850835, 0.2315755911215785, -0.13443193553414728, -0.03141961560939394, 0.2106749688507989, 0.19927371586229475, 0.15487265456246124, -0.08780686659509748, 0.007778409098890344, 0.012838915690025758, 0.1620328370459555, 0.1046436400418835, -0.07350849793957813, 0.16907260819293912, 0.24671205501293852, 0.08544441668893255, 0.1635973214839829, -0.07486385476811501, -0.09331870817335411, -0.2394217960403434, -0.18486904130494666, -0.11967683660664728, 0.0660575800774885, -0.09883274619122469, -0.166698597218991, 0.3585163784523805, 0.11217803007401969, 0.19767372745665765, -0.010759009944186325, 0.28154605048198605, 0.14541618360006917, 0.04781208094015407, 0.05084909440040411, 0.27360663575208966, 0.12368463664426513, 0.13008878400017107, -0.3400333483625824, 0.1479945798936699, 0.04946445841674826] |
1,802.04154 | Laboratory Space Physics: Investigating the Physics of Space Plasmas in
the Laboratory | Laboratory experiments provide a valuable complement to explore the
fundamental physics of space plasmas without the limitations inherent to
spacecraft measurements. Specifically, experiments overcome the restriction
that spacecraft measurements are made at only one (or a few) points in space,
enable greater control of the plasma conditions and applied perturbations, can
be reproducible, and are orders of magnitude less expensive than launching
spacecraft. Here I highlight key open questions about the physics of space
plasmas and identify the aspects of these problems that can potentially be
tackled in laboratory experiments. Several past successes in laboratory space
physics provide concrete examples of how complementary experiments can
contribute to our understanding of physical processes at play in the solar
corona, solar wind, planetary magnetospheres, and outer boundary of the
heliosphere. I present developments on the horizon of laboratory space physics,
identifying velocity space as a key new frontier, highlighting new and enhanced
experimental facilities, and showcasing anticipated developments to produce
improved diagnostics and innovative analysis methods. A strategy for future
laboratory space physics investigations will be outlined, with explicit
connections to specific fundamental plasma phenomena of interest.
| physics.space-ph astro-ph.EP astro-ph.SR physics.plasm-ph | laboratory experiments provide a valuable complement to explore the fundamental physics of space plasmas without the limitations inherent to spacecraft measurements specifically experiments overcome the restriction that spacecraft measurements are made at only one or a few points in space enable greater control of the plasma conditions and applied perturbations can be reproducible and are orders of magnitude less expensive than launching spacecraft here i highlight key open questions about the physics of space plasmas and identify the aspects of these problems that can potentially be tackled in laboratory experiments several past successes in laboratory space physics provide concrete examples of how complementary experiments can contribute to our understanding of physical processes at play in the solar corona solar wind planetary magnetospheres and outer boundary of the heliosphere i present developments on the horizon of laboratory space physics identifying velocity space as a key new frontier highlighting new and enhanced experimental facilities and showcasing anticipated developments to produce improved diagnostics and innovative analysis methods a strategy for future laboratory space physics investigations will be outlined with explicit connections to specific fundamental plasma phenomena of interest | [['laboratory', 'experiments', 'provide', 'a', 'valuable', 'complement', 'to', 'explore', 'the', 'fundamental', 'physics', 'of', 'space', 'plasmas', 'without', 'the', 'limitations', 'inherent', 'to', 'spacecraft', 'measurements', 'specifically', 'experiments', 'overcome', 'the', 'restriction', 'that', 'spacecraft', 'measurements', 'are', 'made', 'at', 'only', 'one', 'or', 'a', 'few', 'points', 'in', 'space', 'enable', 'greater', 'control', 'of', 'the', 'plasma', 'conditions', 'and', 'applied', 'perturbations', 'can', 'be', 'reproducible', 'and', 'are', 'orders', 'of', 'magnitude', 'less', 'expensive', 'than', 'launching', 'spacecraft', 'here', 'i', 'highlight', 'key', 'open', 'questions', 'about', 'the', 'physics', 'of', 'space', 'plasmas', 'and', 'identify', 'the', 'aspects', 'of', 'these', 'problems', 'that', 'can', 'potentially', 'be', 'tackled', 'in', 'laboratory', 'experiments', 'several', 'past', 'successes', 'in', 'laboratory', 'space', 'physics', 'provide', 'concrete', 'examples', 'of', 'how', 'complementary', 'experiments', 'can', 'contribute', 'to', 'our', 'understanding', 'of', 'physical', 'processes', 'at', 'play', 'in', 'the', 'solar', 'corona', 'solar', 'wind', 'planetary', 'magnetospheres', 'and', 'outer', 'boundary', 'of', 'the', 'heliosphere', 'i', 'present', 'developments', 'on', 'the', 'horizon', 'of', 'laboratory', 'space', 'physics', 'identifying', 'velocity', 'space', 'as', 'a', 'key', 'new', 'frontier', 'highlighting', 'new', 'and', 'enhanced', 'experimental', 'facilities', 'and', 'showcasing', 'anticipated', 'developments', 'to', 'produce', 'improved', 'diagnostics', 'and', 'innovative', 'analysis', 'methods', 'a', 'strategy', 'for', 'future', 'laboratory', 'space', 'physics', 'investigations', 'will', 'be', 'outlined', 'with', 'explicit', 'connections', 'to', 'specific', 'fundamental', 'plasma', 'phenomena', 'of', 'interest']] | [-0.07326533734999799, 0.16616804449491807, -0.062481244034259704, 0.09244133263222269, -0.12416002704963289, -0.117700838826194, 0.016690934410419415, 0.34856878239661454, -0.25706660585427604, -0.3543119821621961, 0.12601000218324968, -0.23898414799037415, -0.10678808981225499, 0.3117432656509147, -0.044370136598779544, 0.05826550417617467, 0.11578042173405757, -0.06228061513440381, -0.06820083174955201, -0.231579761601028, 0.2749937257452591, 0.14102455981176448, 0.2174839748900283, 0.06509734537398185, 0.07371153132990002, -0.08016578419058508, -0.07386310862981386, 0.008377477445016691, -0.16471896966159458, 0.14149535319131148, 0.3161168630841358, 0.16719171237200497, 0.2903613398002612, -0.5037598263371635, -0.2862271869152382, 0.03880861669501944, 0.1502766154731649, 0.03392058298797221, -0.08336210955576216, -0.27986623083014744, 0.004181208976582196, -0.12221896976635263, -0.16259784956456388, -0.11258339369166138, -0.0007451193382007045, 0.009219687475627791, -0.2380143190356525, -0.01523696862261843, 0.011298369208501803, 0.09299031659155278, -0.06414006076866409, -0.11728285163943027, 0.04935736575516293, 0.1386619318758037, 0.041113882806353474, 0.031945051257876125, 0.18745669878113108, -0.1342879909870995, -0.14442978614903482, 0.407991714252008, 0.004220074995002408, -0.13574454386441692, 0.25388108710380825, -0.21381339314267844, -0.1476718604539496, 0.08653886983787792, 0.21873625595613408, 0.07707625330501311, -0.1175263973355696, 0.059130618102357695, -0.01281793644035084, 0.10577942626991284, 0.04861825808026903, 0.07773272483294981, 0.2760708963951549, 0.19920592116745742, 0.05973842843762926, 0.06006098125268378, -0.07913622018327383, -0.0660137858367651, -0.32574106538416564, -0.15605092722217778, -0.10036638366763254, -0.00493436471442692, -0.04524349287550305, -0.07555278768712605, 0.3767246541995052, 0.23980684344966682, 0.15673863502420687, -0.10948938718569037, 0.3097037714767597, 0.02161775632711077, 0.029622906104132936, 0.0549541111179703, 0.2927698208925289, 0.1013599288221952, 0.12811938842909562, -0.17766014973859529, 0.06209421147265144, 0.021728383261408354] |
1,802.04155 | Long-distance near-field energy transport via propagating surface waves | Near-field radiative heat transfer (RHT) between two bodies can significantly
exceed the far-field limit set by Planck's law due to the evanescent wave
tunneling, which typically can only occur when the two bodies are separated at
subwavelength distances. We show that the RHT between two SiC nanoparticles
with separation distances much larger than the thermal wavelength can still
exceed the far-field limit when the particles are located within a
subwavelength distance away from a SiC substrate. In this configuration, the
localized surface phonon polariton (SPhP) of the particles couples to the
propagating SPhP of the substrate which then provides a new channel for the
near-field energy transport and enhances the RHT by orders of magnitude at
large distances. The enhancement is also demonstrated to appear in a chain of
closely spaced SiC nanoparticles located in the near field of a SiC substrate.
The findings provide a new way for the long-distance transport of near-field
energy.
| physics.app-ph | nearfield radiative heat transfer rht between two bodies can significantly exceed the farfield limit set by plancks law due to the evanescent wave tunneling which typically can only occur when the two bodies are separated at subwavelength distances we show that the rht between two sic nanoparticles with separation distances much larger than the thermal wavelength can still exceed the farfield limit when the particles are located within a subwavelength distance away from a sic substrate in this configuration the localized surface phonon polariton sphp of the particles couples to the propagating sphp of the substrate which then provides a new channel for the nearfield energy transport and enhances the rht by orders of magnitude at large distances the enhancement is also demonstrated to appear in a chain of closely spaced sic nanoparticles located in the near field of a sic substrate the findings provide a new way for the longdistance transport of nearfield energy | [['nearfield', 'radiative', 'heat', 'transfer', 'rht', 'between', 'two', 'bodies', 'can', 'significantly', 'exceed', 'the', 'farfield', 'limit', 'set', 'by', 'plancks', 'law', 'due', 'to', 'the', 'evanescent', 'wave', 'tunneling', 'which', 'typically', 'can', 'only', 'occur', 'when', 'the', 'two', 'bodies', 'are', 'separated', 'at', 'subwavelength', 'distances', 'we', 'show', 'that', 'the', 'rht', 'between', 'two', 'sic', 'nanoparticles', 'with', 'separation', 'distances', 'much', 'larger', 'than', 'the', 'thermal', 'wavelength', 'can', 'still', 'exceed', 'the', 'farfield', 'limit', 'when', 'the', 'particles', 'are', 'located', 'within', 'a', 'subwavelength', 'distance', 'away', 'from', 'a', 'sic', 'substrate', 'in', 'this', 'configuration', 'the', 'localized', 'surface', 'phonon', 'polariton', 'sphp', 'of', 'the', 'particles', 'couples', 'to', 'the', 'propagating', 'sphp', 'of', 'the', 'substrate', 'which', 'then', 'provides', 'a', 'new', 'channel', 'for', 'the', 'nearfield', 'energy', 'transport', 'and', 'enhances', 'the', 'rht', 'by', 'orders', 'of', 'magnitude', 'at', 'large', 'distances', 'the', 'enhancement', 'is', 'also', 'demonstrated', 'to', 'appear', 'in', 'a', 'chain', 'of', 'closely', 'spaced', 'sic', 'nanoparticles', 'located', 'in', 'the', 'near', 'field', 'of', 'a', 'sic', 'substrate', 'the', 'findings', 'provide', 'a', 'new', 'way', 'for', 'the', 'longdistance', 'transport', 'of', 'nearfield', 'energy']] | [-0.13865475145529113, 0.20247366047734694, -0.05206509315804954, 0.015210955223489192, -0.012545854030477423, -0.13632338334836305, 0.04156399621147542, 0.3999013991966363, -0.2855473940921647, -0.296744290120419, 0.00523531885231815, -0.3152248902426612, -0.09964203213101193, 0.23023082242617685, 0.025624275584554962, -0.017154208796038743, 0.03952356458175928, -0.041699496267416, -0.03873720963996264, -0.13543948450711585, 0.2897856820795325, 0.061665081769047725, 0.31064778250311653, 0.12350700820285467, 0.05966293204635863, -0.01333624561131376, 0.07216524958700662, 0.007304626799398853, -0.11840570331274179, 0.13441371936839255, 0.21857373437003022, -0.06433757798025204, 0.209036866299087, -0.46921399704691386, -0.24048843549023713, 0.04088546116986582, 0.19097650465405275, 0.15846702745334515, -0.025041271103245596, -0.2534016933352236, 0.05318135845534984, -0.045783428192859695, -0.09935926864404351, 0.037164632924982614, -0.0179933964447569, 0.005763187419037304, -0.2497767888189804, 0.08898693024342309, 0.05396463897064208, 0.02038706643206458, -0.014225401960673833, -0.11057996067609037, -0.05427222760063746, 0.10247770592818156, 0.03447894244454801, -0.0016251198091213742, 0.2029946827089354, -0.08683036496382086, -0.04233284783061413, 0.38123672679066656, -0.07352192243758304, -0.14387883268777402, 0.21749520762410435, -0.20899906005830535, 0.07962692448148323, 0.22066774565366007, 0.17156482737721696, 0.14087189513567513, -0.17186999506854092, 0.035070983578466, 0.004848499947711976, 0.1769799977285607, 0.1637390634720965, 0.11824498477602197, 0.29930745576538387, 0.1743586629388794, 0.06549674178503694, 0.14209605406128592, -0.1630545690054855, -0.06807584900168642, -0.2621459232102479, -0.16381696533081272, -0.25302281357468137, 0.05017155004212738, -0.1303608297850118, -0.1598381865293167, 0.32866060427960847, 0.13252453738580022, 0.16667463712454322, 0.016009671621084694, 0.2976352301215933, 0.09015205307167039, 0.12975904997137766, 0.08931454555281708, 0.3590119242908493, 0.1333273242407989, 0.09872083335874542, -0.2567828704002163, 0.0004137593287704212, -0.0016334181471217063] |
1,802.04156 | The Coupled TuFF-BFF Algorithm for Automatic 3D Segmentation of
Microglia | We propose an automatic 3D segmentation algorithm for multiphoton microscopy
images of microglia. Our method is capable of segmenting tubular and blob-like
structures from noisy images. Current segmentation techniques and software fail
to capture the fine processes and soma of the microglia cells, useful for the
study of the microglia role in the brain during healthy and diseased states.
Our coupled tubularity flow field (TuFF)-blob flow field (BFF) method evolves a
level set toward the object boundary using the directional tubularity and
blobness measure of 3D images. Our method found a 20% performance increase
against state of the art segmentation methods on a dataset of 3D images of
microglia even in images with intensity heterogeneity throughout the object.
The coupled TuFF-BFF segmentation results also yielded 40% improvement in
accuracy for the ramification index of the processes, which displays the
efficacy of our method.
| eess.IV | we propose an automatic 3d segmentation algorithm for multiphoton microscopy images of microglia our method is capable of segmenting tubular and bloblike structures from noisy images current segmentation techniques and software fail to capture the fine processes and soma of the microglia cells useful for the study of the microglia role in the brain during healthy and diseased states our coupled tubularity flow field tuffblob flow field bff method evolves a level set toward the object boundary using the directional tubularity and blobness measure of 3d images our method found a 20 performance increase against state of the art segmentation methods on a dataset of 3d images of microglia even in images with intensity heterogeneity throughout the object the coupled tuffbff segmentation results also yielded 40 improvement in accuracy for the ramification index of the processes which displays the efficacy of our method | [['we', 'propose', 'an', 'automatic', '3d', 'segmentation', 'algorithm', 'for', 'multiphoton', 'microscopy', 'images', 'of', 'microglia', 'our', 'method', 'is', 'capable', 'of', 'segmenting', 'tubular', 'and', 'bloblike', 'structures', 'from', 'noisy', 'images', 'current', 'segmentation', 'techniques', 'and', 'software', 'fail', 'to', 'capture', 'the', 'fine', 'processes', 'and', 'soma', 'of', 'the', 'microglia', 'cells', 'useful', 'for', 'the', 'study', 'of', 'the', 'microglia', 'role', 'in', 'the', 'brain', 'during', 'healthy', 'and', 'diseased', 'states', 'our', 'coupled', 'tubularity', 'flow', 'field', 'tuffblob', 'flow', 'field', 'bff', 'method', 'evolves', 'a', 'level', 'set', 'toward', 'the', 'object', 'boundary', 'using', 'the', 'directional', 'tubularity', 'and', 'blobness', 'measure', 'of', '3d', 'images', 'our', 'method', 'found', 'a', '20', 'performance', 'increase', 'against', 'state', 'of', 'the', 'art', 'segmentation', 'methods', 'on', 'a', 'dataset', 'of', '3d', 'images', 'of', 'microglia', 'even', 'in', 'images', 'with', 'intensity', 'heterogeneity', 'throughout', 'the', 'object', 'the', 'coupled', 'tuffbff', 'segmentation', 'results', 'also', 'yielded', '40', 'improvement', 'in', 'accuracy', 'for', 'the', 'ramification', 'index', 'of', 'the', 'processes', 'which', 'displays', 'the', 'efficacy', 'of', 'our', 'method']] | [-0.029593944043985434, 0.007607858835191499, -0.061110201378219896, 0.02438944695168175, -0.009481101686001888, -0.09949362607356826, 0.009238247692701406, 0.4203990215036486, -0.21749900133082908, -0.3455264964273998, 0.07417775644904136, -0.2673760951130784, -0.16731083020567894, 0.21171674792920905, -0.12159972604474335, 0.06396904421438064, 0.14230886103053178, 0.0412229258483941, 0.006155172547525061, -0.22198726985869663, 0.28883476748596876, 0.030091010529680978, 0.3554209798607709, 0.019820333230641803, 0.13454898127155113, -0.035752019262872636, -0.034521033006188064, 0.018020874735209094, -0.06944111131597311, 0.16187319294507949, 0.2577190840068007, 0.13685049864663076, 0.2586602887138724, -0.42867433719470033, -0.23247441982218464, 0.0366576891908023, 0.14837110666558145, 0.09223374327328722, -0.06924937632367281, -0.36871253677776883, 0.07950961917189749, -0.08305453557986767, -0.06979558558668941, -0.09166135903713958, -0.01885194811787057, -0.033338742373078795, -0.2801836307792525, 0.1224461619656982, 0.03667540853535424, 0.09928572719717133, -0.12298838473590357, -0.06513661992669638, -0.018864195001411385, 0.20688516705496504, -0.013402378407772631, 0.06530511325961146, 0.1871300549778555, -0.2361702890734055, -0.11417377893397185, 0.3296253171549844, -0.04695744616910815, -0.18748445364513566, 0.1911341415851244, -0.1137798960985882, -0.10442876969796738, 0.207825597980991, 0.1850459348077753, 0.1584227498022041, -0.09724446625914425, 0.001627721285746832, -0.0126412062997198, 0.19395675449964722, 0.0582267737282174, -0.03618067548876362, 0.16376226194302684, 0.25336918268751885, 0.016538475252621407, 0.1500890628900379, -0.22980497073980846, -0.02418050663836766, -0.2082046931409942, -0.17220186144446156, -0.12839178367451365, -0.031261095605441366, -0.12834402822637847, -0.1904647416568228, 0.45166663849460226, 0.20963626803298083, 0.17499919719994067, 0.05407444509827266, 0.33886849028390964, -0.0027036842930621267, 0.08318384280511444, 0.03019274942510362, 0.174507726057865, 0.08236828816588967, 0.12139593309589795, -0.23398764978711759, 0.05737964908060219, 0.06166904777325856] |
1,802.04157 | Elliptic boundary value problems for the stationary vacuum spacetimes | We develop a general method of proving the ellipticity of boundary value
problems for the stationary vacuum space time, by showing that the stationary
vacuum field equations are elliptic subjected to a geometrically natural
collection of boundary conditions in the projection formalism. Using this we
prove the manifold theorem for the moduli space of stationary vacuum
spacetimes.
| math.DG gr-qc math.AP | we develop a general method of proving the ellipticity of boundary value problems for the stationary vacuum space time by showing that the stationary vacuum field equations are elliptic subjected to a geometrically natural collection of boundary conditions in the projection formalism using this we prove the manifold theorem for the moduli space of stationary vacuum spacetimes | [['we', 'develop', 'a', 'general', 'method', 'of', 'proving', 'the', 'ellipticity', 'of', 'boundary', 'value', 'problems', 'for', 'the', 'stationary', 'vacuum', 'space', 'time', 'by', 'showing', 'that', 'the', 'stationary', 'vacuum', 'field', 'equations', 'are', 'elliptic', 'subjected', 'to', 'a', 'geometrically', 'natural', 'collection', 'of', 'boundary', 'conditions', 'in', 'the', 'projection', 'formalism', 'using', 'this', 'we', 'prove', 'the', 'manifold', 'theorem', 'for', 'the', 'moduli', 'space', 'of', 'stationary', 'vacuum', 'spacetimes']] | [-0.1531182028876062, 0.1153077945243894, -0.1407703369234999, 0.06982319688285586, -0.05075323346005589, -0.08087332600629643, -0.02972001000715975, 0.3264689214135471, -0.2671590879428805, -0.225771192886066, 0.1336721293281012, -0.17231749929487705, -0.09005981651870043, 0.20122062512918523, -0.11334582356115182, 0.1256684720222103, 0.06510249772027396, 0.013632222225791529, -0.1108467618305759, -0.22984982097292678, 0.45496191675856446, -0.07599141027190183, 0.2793299593684966, 0.007895674981307565, 0.1658859514843738, -0.005162683286981886, 0.036743239816196524, 0.053387962913818726, -0.16925730484013402, 0.09223177040551316, 0.23257804583970523, 0.08014366701817173, 0.2592860554067189, -0.41925322813423055, -0.20768020047168984, 0.1467664604189626, 0.06347187663216078, 0.1382377766758988, -0.029219703965313863, -0.32176422929031806, 0.07109392024249885, -0.05636492831093308, -0.25520121400130164, -0.09020496245980132, 0.00227890947318979, -0.02962823759503009, -0.2958211520065864, 0.07474804543808364, 0.06966974266004144, 0.02511279425469407, -0.1609303712142272, -0.035164289337811634, -0.02144443995335646, 0.03672556087309331, 0.06958008639661498, 0.03520359632379392, 0.1109168930305985, -0.09776317490379147, -0.07308267547111762, 0.34436443418656526, -0.09538338415063265, -0.28619321742862985, 0.08924003677409992, -0.158021667600495, -0.09691727655661996, 0.1483395275937622, 0.15079697917558646, 0.22384157038310118, -0.12067780283018294, 0.181514170437463, -0.07783553864921264, 0.07975357695760434, 0.1180841556358102, -0.007593975005173043, 0.17131278703087255, 0.09427989547124557, 0.1307522372522375, 0.18634603372693323, -0.019655038676175633, -0.11784210745061405, -0.4123101057321356, -0.20210233507960015, -0.15303191895547666, 0.1192171161038507, -0.1516304322959561, -0.24208252453817086, 0.35585932490791666, 0.11644730557638563, 0.14006522482898282, 0.07200573021768114, 0.24063310648821162, 0.15028628798430427, -0.04186529030190095, 0.1074643504658812, 0.23020439242061816, 0.17664060438166193, 0.10364348103145235, -0.19719284110735252, -0.040495245325330054, 0.15558767055667805] |
1,802.04158 | Influence of multiplet structure on photoemission spectra of spin-orbit
driven Mott insulators: application to $\bf{Sr_2IrO_4}$ | Most of the low-energy effective descriptions of spin-orbit driven Mott
insulators consider spin orbit coupling (SOC) as a second order perturbation to
electron-electron interactions. However, when SOC is comparable to anisotropic
Hund's coupling, such as in Ir, validity of this formally weak-SOC approach is
not a priori known. Depending on the relative strength of SOC and anisotropic
Hund's coupling, different descriptions of the multiplet structure should be
employed in the weak and strong SOC limits, \textit{viz.} \textit{LS} and
\textit{jj} coupling schemes, respectively. We investigate the implications of
both the coupling schemes on the low-energy effective $t-J$ model and calculate
the angle resolved photoemission (ARPES) spectra using self-consistent Born
approximation. In particular, we obtain the ARPES spectra of
quasi-two-dimensional square-lattice iridate ${\rm Sr_2IrO_4}$ in both weak and
strong SOC limits. The differences in the limiting cases are understood in
terms of the composition and relative energy splittings of the multiplet
structure. Our results indicate that the LS coupling scheme yields better
agreement with the experiment, thus providing an indirect evidence for the
validity of LS coupling scheme for iridates. We also discuss the implications
for other metal ions with strong SOC.
| cond-mat.str-el | most of the lowenergy effective descriptions of spinorbit driven mott insulators consider spin orbit coupling soc as a second order perturbation to electronelectron interactions however when soc is comparable to anisotropic hunds coupling such as in ir validity of this formally weaksoc approach is not a priori known depending on the relative strength of soc and anisotropic hunds coupling different descriptions of the multiplet structure should be employed in the weak and strong soc limits textitviz textitls and textitjj coupling schemes respectively we investigate the implications of both the coupling schemes on the lowenergy effective tj model and calculate the angle resolved photoemission arpes spectra using selfconsistent born approximation in particular we obtain the arpes spectra of quasitwodimensional squarelattice iridate rm sr_2iro_4 in both weak and strong soc limits the differences in the limiting cases are understood in terms of the composition and relative energy splittings of the multiplet structure our results indicate that the ls coupling scheme yields better agreement with the experiment thus providing an indirect evidence for the validity of ls coupling scheme for iridates we also discuss the implications for other metal ions with strong soc | [['most', 'of', 'the', 'lowenergy', 'effective', 'descriptions', 'of', 'spinorbit', 'driven', 'mott', 'insulators', 'consider', 'spin', 'orbit', 'coupling', 'soc', 'as', 'a', 'second', 'order', 'perturbation', 'to', 'electronelectron', 'interactions', 'however', 'when', 'soc', 'is', 'comparable', 'to', 'anisotropic', 'hunds', 'coupling', 'such', 'as', 'in', 'ir', 'validity', 'of', 'this', 'formally', 'weaksoc', 'approach', 'is', 'not', 'a', 'priori', 'known', 'depending', 'on', 'the', 'relative', 'strength', 'of', 'soc', 'and', 'anisotropic', 'hunds', 'coupling', 'different', 'descriptions', 'of', 'the', 'multiplet', 'structure', 'should', 'be', 'employed', 'in', 'the', 'weak', 'and', 'strong', 'soc', 'limits', 'textitviz', 'textitls', 'and', 'textitjj', 'coupling', 'schemes', 'respectively', 'we', 'investigate', 'the', 'implications', 'of', 'both', 'the', 'coupling', 'schemes', 'on', 'the', 'lowenergy', 'effective', 'tj', 'model', 'and', 'calculate', 'the', 'angle', 'resolved', 'photoemission', 'arpes', 'spectra', 'using', 'selfconsistent', 'born', 'approximation', 'in', 'particular', 'we', 'obtain', 'the', 'arpes', 'spectra', 'of', 'quasitwodimensional', 'squarelattice', 'iridate', 'rm', 'sr_2iro_4', 'in', 'both', 'weak', 'and', 'strong', 'soc', 'limits', 'the', 'differences', 'in', 'the', 'limiting', 'cases', 'are', 'understood', 'in', 'terms', 'of', 'the', 'composition', 'and', 'relative', 'energy', 'splittings', 'of', 'the', 'multiplet', 'structure', 'our', 'results', 'indicate', 'that', 'the', 'ls', 'coupling', 'scheme', 'yields', 'better', 'agreement', 'with', 'the', 'experiment', 'thus', 'providing', 'an', 'indirect', 'evidence', 'for', 'the', 'validity', 'of', 'ls', 'coupling', 'scheme', 'for', 'iridates', 'we', 'also', 'discuss', 'the', 'implications', 'for', 'other', 'metal', 'ions', 'with', 'strong', 'soc']] | [-0.16759052120751755, 0.10699080424901548, 0.0017445133385786359, 0.1157168228618731, -0.042443425174214865, -0.162286945394574, 0.07343769140222813, 0.38039566324973967, -0.23428153875719676, -0.29577077116398887, -0.01929958100570117, -0.2738854694404306, -0.109687143545797, 0.17685960966067757, 0.07276553420952576, -0.02228619716905884, 0.009815089962380456, -0.06489342798847446, -0.12077593170778757, -0.20277611315648825, 0.3164547912908449, 0.06377878152195085, 0.2904267670751056, 0.14143618447257872, 0.012302565695294603, 0.02610002937826283, 0.09310160464741649, 0.026739438208271633, -0.14311469791670745, 0.09844546286727894, 0.23465945370330968, -0.09189035341561956, 0.18989123243161224, -0.38898273668486005, -0.1657647637886917, -0.014441255949136308, 0.11038786544150768, 0.14988728157458778, -0.024953028391349445, -0.3107916889911428, 0.013109706975967887, -0.21597827366929262, -0.10613291575150056, -0.14657369290757427, -0.002394141584515253, 0.011466354187727373, -0.306002565077506, 0.09887611164719509, 0.06765564846630982, 0.09209376823077386, -0.11023699207465477, -0.13268781400828517, -0.060635573792216534, 0.06350077929944523, 0.09744091681951786, 0.016992895881381424, 0.06430672414670574, -0.1357833063117861, -0.1161662451051335, 0.4228314519785145, -0.12724279073492828, -0.14022124763378963, 0.20338491523728014, -0.15128551966406126, -0.11608565128582685, 0.09286958051043598, 0.11651055456542554, 0.1042550727500914, -0.10141597576615248, 0.15745079201424525, -0.027865222724961405, 0.19317141775462657, -0.013059427628024695, 0.12702061270483, 0.22115399874248767, 0.15980454620825535, 0.024187865691324247, 0.05584255038022268, -0.11789706729372396, -0.08262324269318126, -0.27245478949604185, -0.12544142815625584, -0.2066918365423254, 0.04831055314835711, -0.09899917973985492, -0.1320230582489926, 0.3704229891114606, 0.17657015671490386, 0.16135807516162887, -0.04425341170032155, 0.2203221528686304, 0.12428207883211649, 0.025637960302977162, 0.023504417997232095, 0.3727975862927456, 0.18335850613520427, 0.07176831451538492, -0.31830801824895283, 0.048866250599550215, 0.06768949719066208] |
1,802.04159 | Urban vs. rural divide in HTTPS implementation for hospital websites in
Illinois | The Hypertext Transfer Protocol Secure (HTTPS) communications protocol is
used to secure traffic between a web browser and server. This technology can
significantly reduce the risk of interception and manipulation of web
information for nefarious purposes such as identity theft. Deployment of HTTPS
has reached about 50% of all webs sites. Little is known about HTTPS
implantation for hospital websites. To investigate the prevalence of HTTPS
implementation, we analyzed the websites of the 210 public hospitals in the
state of Illinois, USA. HTTPS was implemented to industry standards for 54% of
all hospital websites in Illinois. Geographical analysis showed an urban vs.
rural digital divide with 60% of urban hospitals and 40% of rural hospitals
implementing HTTPS.
| cs.CY | the hypertext transfer protocol secure https communications protocol is used to secure traffic between a web browser and server this technology can significantly reduce the risk of interception and manipulation of web information for nefarious purposes such as identity theft deployment of https has reached about 50 of all webs sites little is known about https implantation for hospital websites to investigate the prevalence of https implementation we analyzed the websites of the 210 public hospitals in the state of illinois usa https was implemented to industry standards for 54 of all hospital websites in illinois geographical analysis showed an urban vs rural digital divide with 60 of urban hospitals and 40 of rural hospitals implementing https | [['the', 'hypertext', 'transfer', 'protocol', 'secure', 'https', 'communications', 'protocol', 'is', 'used', 'to', 'secure', 'traffic', 'between', 'a', 'web', 'browser', 'and', 'server', 'this', 'technology', 'can', 'significantly', 'reduce', 'the', 'risk', 'of', 'interception', 'and', 'manipulation', 'of', 'web', 'information', 'for', 'nefarious', 'purposes', 'such', 'as', 'identity', 'theft', 'deployment', 'of', 'https', 'has', 'reached', 'about', '50', 'of', 'all', 'webs', 'sites', 'little', 'is', 'known', 'about', 'https', 'implantation', 'for', 'hospital', 'websites', 'to', 'investigate', 'the', 'prevalence', 'of', 'https', 'implementation', 'we', 'analyzed', 'the', 'websites', 'of', 'the', '210', 'public', 'hospitals', 'in', 'the', 'state', 'of', 'illinois', 'usa', 'https', 'was', 'implemented', 'to', 'industry', 'standards', 'for', '54', 'of', 'all', 'hospital', 'websites', 'in', 'illinois', 'geographical', 'analysis', 'showed', 'an', 'urban', 'vs', 'rural', 'digital', 'divide', 'with', '60', 'of', 'urban', 'hospitals', 'and', '40', 'of', 'rural', 'hospitals', 'implementing', 'https']] | [-0.14679052049899075, 0.010677837566835767, -0.00841013976555859, 0.0868507342832959, -0.05536845408809873, -0.2051150955699591, 0.1679227295307777, 0.3913990011295447, -0.18375693920713204, -0.35856145666514194, 0.17238716212992802, -0.3605311479992591, -0.045897056396381974, 0.22591086033270016, -0.16400018275882572, 0.01448397956486059, 0.02814734714010205, 0.017865303728697646, 0.06226771871005105, -0.35416018201882005, 0.22037393596564603, 0.07473660169893669, 0.42412576326129275, 0.16263151393693864, 0.05399513644508074, 0.045681868035059706, -0.06623840637596595, -0.11470071169382069, -0.071551616405113, 0.13882474251910865, 0.4473071451434213, 0.2904994992348246, 0.3338183542379202, -0.40967101618074453, -0.1551427358490789, 0.06584773742908245, 0.13025378900715429, 0.05863108828019064, -0.008039402863026684, -0.3373751510810266, 0.11168975427420412, -0.33138192955277157, -0.11872409837734368, 0.018065770236281756, 0.017455628344741386, 0.016592286833617676, -0.19440673776448536, 0.011250640547229376, -0.10154432617326896, 0.21628949213693413, 0.007006188838655113, -0.1064375140147013, -0.07595391151630598, 0.29620941922578037, 0.010632062945753718, 0.004208465183400509, 0.2510614545993969, -0.1468473273830918, -0.14277113627037433, 0.3554688889501441, 0.06152381328666885, -0.020021548558376793, 0.16001218464623532, -0.009273106244225532, -0.0914916090734908, 0.038345862195914626, 0.2367015035631947, 0.026015195267227214, -0.26775131174004996, -0.017115914821525257, -0.021196217698037114, 0.2123831847252754, 0.13504823500242752, -0.003975032749645508, 0.10799255133327892, 0.20395374600576538, 0.09618944755922525, 0.06954405771003255, -0.09964000727408208, -0.11252338102119219, -0.11726898265381654, -0.19741232831898725, -0.15164742100004774, 0.06532344522858118, -0.0973939139742462, -0.1102061997462287, 0.3470424219456493, 0.1801091924460971, 0.014517732151648682, -0.002522731343140969, 0.32810532537281006, -0.10538161350971359, 0.14831220746661225, 0.18400714234011167, 0.11700748736994007, -0.04230093968232186, 0.2946804266056826, -0.09834326694184183, 0.14101315861265373, -0.051171658766101726] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.